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
93 	if (index > nr_entries ||  in insert_at()
95 	    nr_entries >= max_entries) {  in insert_at()
103 	array_insert(node->keys, sizeof(*node->keys), nr_entries, index, &key_le);  in insert_at()
104 	array_insert(value_base(node), value_size, nr_entries, index, value);  in insert_at()
105 	node->header.nr_entries = cpu_to_le32(nr_entries + 1);  in insert_at()
146 	n->header.nr_entries = cpu_to_le32(0);  in dm_btree_empty()
243 		f->nr_children = le32_to_cpu(f->n->header.nr_entries);  in push_frame()
351 	uint32_t flags, nr_entries;  in btree_lookup_raw()  local
361 		nr_entries = le32_to_cpu(ro_node(s)->header.nr_entries);  in btree_lookup_raw()
362 		if (i < 0 || i >= nr_entries)  in btree_lookup_raw()
426 	uint32_t flags, nr_entries;  in dm_btree_lookup_next_single()  local
436 	nr_entries = le32_to_cpu(n->header.nr_entries);  in dm_btree_lookup_next_single()
447 		if (i >= nr_entries) {  in dm_btree_lookup_next_single()
453 		if (r == -ENODATA && i < (nr_entries - 1)) {  in dm_btree_lookup_next_single()
460 		if (i < 0 || i >= nr_entries) {  in dm_btree_lookup_next_single()
554 	nr_left = le32_to_cpu(ln->header.nr_entries) / 2;  in btree_split_sibling()
555 	nr_right = le32_to_cpu(ln->header.nr_entries) - nr_left;  in btree_split_sibling()
557 	ln->header.nr_entries = cpu_to_le32(nr_left);  in btree_split_sibling()
560 	rn->header.nr_entries = cpu_to_le32(nr_right);  in btree_split_sibling()
644 	nr_left = le32_to_cpu(pn->header.nr_entries) / 2;  in btree_split_beneath()
647 	ln->header.nr_entries = cpu_to_le32(nr_left);  in btree_split_beneath()
661 	nr_right = le32_to_cpu(pn->header.nr_entries) - nr_left;  in btree_split_beneath()
664 	rn->header.nr_entries = cpu_to_le32(nr_right);  in btree_split_beneath()
673 	pn->header.nr_entries = cpu_to_le32(2);  in btree_split_beneath()
724 		if (node->header.nr_entries == node->header.max_entries) {  in btree_insert_raw()
761         return ((index >= le32_to_cpu(node->header.nr_entries)) ||  in need_insert()
883 		i = le32_to_cpu(ro_node(s)->header.nr_entries);  in find_key()
968 	nr = le32_to_cpu(n->header.nr_entries);  in walk_node()
1008 	nr = le32_to_cpu(bn->header.nr_entries);  in prefetch_values()
1065 		if (n->index < le32_to_cpu(bn->header.nr_entries))  in inc_or_backtrack()
1096 	if (!r && (le32_to_cpu(bn->header.nr_entries) == 0))  in find_leaf()