Lines Matching refs:header

43 	int lo = -1, hi = le32_to_cpu(n->header.nr_entries);  in bsearch()
75 uint32_t nr_entries = le32_to_cpu(n->header.nr_entries); in inc_children()
77 if (le32_to_cpu(n->header.flags) & INTERNAL_NODE) in inc_children()
89 uint32_t nr_entries = le32_to_cpu(node->header.nr_entries); in insert_at()
93 index >= le32_to_cpu(node->header.max_entries)) { in insert_at()
103 node->header.nr_entries = cpu_to_le32(nr_entries + 1); in insert_at()
143 n->header.flags = cpu_to_le32(LEAF_NODE); in dm_btree_empty()
144 n->header.nr_entries = cpu_to_le32(0); in dm_btree_empty()
145 n->header.max_entries = cpu_to_le32(max_entries); in dm_btree_empty()
146 n->header.value_size = cpu_to_le32(info->value_type.size); in dm_btree_empty()
241 f->nr_children = le32_to_cpu(f->n->header.nr_entries); in push_frame()
244 flags = le32_to_cpu(f->n->header.flags); in push_frame()
300 flags = le32_to_cpu(f->n->header.flags); in dm_btree_del()
353 flags = le32_to_cpu(ro_node(s)->header.flags); in btree_lookup_raw()
354 nr_entries = le32_to_cpu(ro_node(s)->header.nr_entries); in btree_lookup_raw()
427 flags = le32_to_cpu(n->header.flags); in dm_btree_lookup_next_single()
428 nr_entries = le32_to_cpu(n->header.nr_entries); in dm_btree_lookup_next_single()
539 nr_left = le32_to_cpu(ln->header.nr_entries) / 2; in btree_split_sibling()
540 nr_right = le32_to_cpu(ln->header.nr_entries) - nr_left; in btree_split_sibling()
542 ln->header.nr_entries = cpu_to_le32(nr_left); in btree_split_sibling()
544 rn->header.flags = ln->header.flags; in btree_split_sibling()
545 rn->header.nr_entries = cpu_to_le32(nr_right); in btree_split_sibling()
546 rn->header.max_entries = ln->header.max_entries; in btree_split_sibling()
547 rn->header.value_size = ln->header.value_size; in btree_split_sibling()
550 size = le32_to_cpu(ln->header.flags) & INTERNAL_NODE ? in btree_split_sibling()
633 nr_left = le32_to_cpu(pn->header.nr_entries) / 2; in btree_split_beneath()
634 nr_right = le32_to_cpu(pn->header.nr_entries) - nr_left; in btree_split_beneath()
636 ln->header.flags = pn->header.flags; in btree_split_beneath()
637 ln->header.nr_entries = cpu_to_le32(nr_left); in btree_split_beneath()
638 ln->header.max_entries = pn->header.max_entries; in btree_split_beneath()
639 ln->header.value_size = pn->header.value_size; in btree_split_beneath()
641 rn->header.flags = pn->header.flags; in btree_split_beneath()
642 rn->header.nr_entries = cpu_to_le32(nr_right); in btree_split_beneath()
643 rn->header.max_entries = pn->header.max_entries; in btree_split_beneath()
644 rn->header.value_size = pn->header.value_size; in btree_split_beneath()
649 size = le32_to_cpu(pn->header.flags) & INTERNAL_NODE ? in btree_split_beneath()
656 pn->header.flags = cpu_to_le32(INTERNAL_NODE); in btree_split_beneath()
657 pn->header.nr_entries = cpu_to_le32(2); in btree_split_beneath()
658 pn->header.max_entries = cpu_to_le32( in btree_split_beneath()
662 pn->header.value_size = cpu_to_le32(sizeof(__le64)); in btree_split_beneath()
723 if (node->header.nr_entries == node->header.max_entries) { in btree_insert_raw()
737 if (le32_to_cpu(node->header.flags) & LEAF_NODE) in btree_insert_raw()
778 need_insert = ((index >= le32_to_cpu(n->header.nr_entries)) || in insert()
808 need_insert = ((index >= le32_to_cpu(n->header.nr_entries)) || in insert()
878 flags = le32_to_cpu(ro_node(s)->header.flags); in find_key()
879 i = le32_to_cpu(ro_node(s)->header.nr_entries); in find_key()
960 nr = le32_to_cpu(n->header.nr_entries); in walk_node()
962 if (le32_to_cpu(n->header.flags) & INTERNAL_NODE) { in walk_node()