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()  local
78 		for (i = 0; i < nr_entries; i++)  in inc_children()
81 		for (i = 0; i < nr_entries; i++)  in inc_children()
89 	uint32_t nr_entries = le32_to_cpu(node->header.nr_entries);  in insert_at()  local
92 	if (index > nr_entries ||  in insert_at()
101 	array_insert(node->keys, sizeof(*node->keys), nr_entries, index, &key_le);  in insert_at()
102 	array_insert(value_base(node), value_size, nr_entries, index, value);  in insert_at()
103 	node->header.nr_entries = cpu_to_le32(nr_entries + 1);  in insert_at()
144 	n->header.nr_entries = cpu_to_le32(0);  in dm_btree_empty()
241 		f->nr_children = le32_to_cpu(f->n->header.nr_entries);  in push_frame()
344 	uint32_t flags, nr_entries;  in btree_lookup_raw()  local
354 		nr_entries = le32_to_cpu(ro_node(s)->header.nr_entries);  in btree_lookup_raw()
355 		if (i < 0 || i >= nr_entries)  in btree_lookup_raw()
418 	uint32_t flags, nr_entries;  in dm_btree_lookup_next_single()  local
428 	nr_entries = le32_to_cpu(n->header.nr_entries);  in dm_btree_lookup_next_single()
432 		if (i < 0 || i >= nr_entries) {  in dm_btree_lookup_next_single()
438 		if (r == -ENODATA && i < (nr_entries - 1)) {  in dm_btree_lookup_next_single()
445 		if (i < 0 || i >= 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()
545 	rn->header.nr_entries = cpu_to_le32(nr_right);  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()
637 	ln->header.nr_entries = cpu_to_le32(nr_left);  in btree_split_beneath()
642 	rn->header.nr_entries = cpu_to_le32(nr_right);  in btree_split_beneath()
657 	pn->header.nr_entries = cpu_to_le32(2);  in btree_split_beneath()
723 		if (node->header.nr_entries == node->header.max_entries) {  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()
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()