Lines Matching refs:header
43 int lo = -1, hi = le32_to_cpu(n->header.nr_entries); in bsearch()
70 uint32_t nr_entries = le32_to_cpu(n->header.nr_entries); in inc_children()
72 if (le32_to_cpu(n->header.flags) & INTERNAL_NODE) in inc_children()
84 uint32_t nr_entries = le32_to_cpu(node->header.nr_entries); in insert_at()
88 index >= le32_to_cpu(node->header.max_entries)) { in insert_at()
98 node->header.nr_entries = cpu_to_le32(nr_entries + 1); in insert_at()
138 n->header.flags = cpu_to_le32(LEAF_NODE); in dm_btree_empty()
139 n->header.nr_entries = cpu_to_le32(0); in dm_btree_empty()
140 n->header.max_entries = cpu_to_le32(max_entries); in dm_btree_empty()
141 n->header.value_size = cpu_to_le32(info->value_type.size); in dm_btree_empty()
234 f->nr_children = le32_to_cpu(f->n->header.nr_entries); in push_frame()
237 flags = le32_to_cpu(f->n->header.flags); in push_frame()
283 flags = le32_to_cpu(f->n->header.flags); in dm_btree_del()
332 flags = le32_to_cpu(ro_node(s)->header.flags); in btree_lookup_raw()
333 nr_entries = le32_to_cpu(ro_node(s)->header.nr_entries); in btree_lookup_raw()
442 nr_left = le32_to_cpu(ln->header.nr_entries) / 2; in btree_split_sibling()
443 nr_right = le32_to_cpu(ln->header.nr_entries) - nr_left; in btree_split_sibling()
445 ln->header.nr_entries = cpu_to_le32(nr_left); in btree_split_sibling()
447 rn->header.flags = ln->header.flags; in btree_split_sibling()
448 rn->header.nr_entries = cpu_to_le32(nr_right); in btree_split_sibling()
449 rn->header.max_entries = ln->header.max_entries; in btree_split_sibling()
450 rn->header.value_size = ln->header.value_size; in btree_split_sibling()
453 size = le32_to_cpu(ln->header.flags) & INTERNAL_NODE ? in btree_split_sibling()
534 nr_left = le32_to_cpu(pn->header.nr_entries) / 2; in btree_split_beneath()
535 nr_right = le32_to_cpu(pn->header.nr_entries) - nr_left; in btree_split_beneath()
537 ln->header.flags = pn->header.flags; in btree_split_beneath()
538 ln->header.nr_entries = cpu_to_le32(nr_left); in btree_split_beneath()
539 ln->header.max_entries = pn->header.max_entries; in btree_split_beneath()
540 ln->header.value_size = pn->header.value_size; in btree_split_beneath()
542 rn->header.flags = pn->header.flags; in btree_split_beneath()
543 rn->header.nr_entries = cpu_to_le32(nr_right); in btree_split_beneath()
544 rn->header.max_entries = pn->header.max_entries; in btree_split_beneath()
545 rn->header.value_size = pn->header.value_size; in btree_split_beneath()
550 size = le32_to_cpu(pn->header.flags) & INTERNAL_NODE ? in btree_split_beneath()
557 pn->header.flags = cpu_to_le32(INTERNAL_NODE); in btree_split_beneath()
558 pn->header.nr_entries = cpu_to_le32(2); in btree_split_beneath()
559 pn->header.max_entries = cpu_to_le32( in btree_split_beneath()
563 pn->header.value_size = cpu_to_le32(sizeof(__le64)); in btree_split_beneath()
624 if (node->header.nr_entries == node->header.max_entries) { in btree_insert_raw()
638 if (le32_to_cpu(node->header.flags) & LEAF_NODE) in btree_insert_raw()
679 need_insert = ((index >= le32_to_cpu(n->header.nr_entries)) || in insert()
709 need_insert = ((index >= le32_to_cpu(n->header.nr_entries)) || in insert()
779 flags = le32_to_cpu(ro_node(s)->header.flags); in find_key()
780 i = le32_to_cpu(ro_node(s)->header.nr_entries); in find_key()
861 nr = le32_to_cpu(n->header.nr_entries); in walk_node()
863 if (le32_to_cpu(n->header.flags) & INTERNAL_NODE) { in walk_node()