Lines Matching refs:nr_entries
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() local
73 for (i = 0; i < nr_entries; i++) in inc_children()
76 for (i = 0; i < nr_entries; i++) in inc_children()
84 uint32_t nr_entries = le32_to_cpu(node->header.nr_entries); in insert_at() local
87 if (index > nr_entries || in insert_at()
96 array_insert(node->keys, sizeof(*node->keys), nr_entries, index, &key_le); in insert_at()
97 array_insert(value_base(node), value_size, nr_entries, index, value); in insert_at()
98 node->header.nr_entries = cpu_to_le32(nr_entries + 1); in insert_at()
139 n->header.nr_entries = cpu_to_le32(0); in dm_btree_empty()
218 f->nr_children = le32_to_cpu(f->n->header.nr_entries); in push_frame()
307 uint32_t flags, nr_entries; in btree_lookup_raw() local
317 nr_entries = le32_to_cpu(ro_node(s)->header.nr_entries); in btree_lookup_raw()
318 if (i < 0 || i >= nr_entries) in btree_lookup_raw()
426 nr_left = le32_to_cpu(ln->header.nr_entries) / 2; in btree_split_sibling()
427 nr_right = le32_to_cpu(ln->header.nr_entries) - nr_left; in btree_split_sibling()
429 ln->header.nr_entries = cpu_to_le32(nr_left); in btree_split_sibling()
432 rn->header.nr_entries = cpu_to_le32(nr_right); in btree_split_sibling()
518 nr_left = le32_to_cpu(pn->header.nr_entries) / 2; in btree_split_beneath()
519 nr_right = le32_to_cpu(pn->header.nr_entries) - nr_left; in btree_split_beneath()
522 ln->header.nr_entries = cpu_to_le32(nr_left); in btree_split_beneath()
527 rn->header.nr_entries = cpu_to_le32(nr_right); in btree_split_beneath()
542 pn->header.nr_entries = cpu_to_le32(2); in btree_split_beneath()
608 if (node->header.nr_entries == node->header.max_entries) { in btree_insert_raw()
668 need_insert = ((index >= le32_to_cpu(n->header.nr_entries)) || in insert()
698 need_insert = ((index >= le32_to_cpu(n->header.nr_entries)) || in insert()
769 i = le32_to_cpu(ro_node(s)->header.nr_entries); in find_highest_key()
827 nr = le32_to_cpu(n->header.nr_entries); in walk_node()