46 	int lo = -1, hi = le32_to_cpu(n->header.nr_entries);  in bsearch()
77 	uint32_t nr_entries = le32_to_cpu(n->header.nr_entries);  in inc_children()  local
80 		dm_tm_with_runs(tm, value_ptr(n, 0), nr_entries, dm_tm_inc_range);  in inc_children()
83 		vt->inc(vt->context, value_ptr(n, 0), nr_entries);  in inc_children()
90 	uint32_t nr_entries = le32_to_cpu(node->header.nr_entries);  in insert_at()  local
94 	if (index > nr_entries ||  in insert_at()
96 	    nr_entries >= max_entries) {  in insert_at()
104 	array_insert(node->keys, sizeof(*node->keys), nr_entries, index, &key_le);  in insert_at()
105 	array_insert(value_base(node), value_size, nr_entries, index, value);  in insert_at()
106 	node->header.nr_entries = cpu_to_le32(nr_entries + 1);  in insert_at()
147 	n->header.nr_entries = cpu_to_le32(0);  in dm_btree_empty()
244 		f->nr_children = le32_to_cpu(f->n->header.nr_entries);  in push_frame()
348 	uint32_t flags, nr_entries;  in btree_lookup_raw()  local
358 		nr_entries = le32_to_cpu(ro_node(s)->header.nr_entries);  in btree_lookup_raw()
359 		if (i < 0 || i >= nr_entries)  in btree_lookup_raw()
423 	uint32_t flags, nr_entries;  in dm_btree_lookup_next_single()  local
433 	nr_entries = le32_to_cpu(n->header.nr_entries);  in dm_btree_lookup_next_single()
444 		if (i >= nr_entries) {  in dm_btree_lookup_next_single()
450 		if (r == -ENODATA && i < (nr_entries - 1)) {  in dm_btree_lookup_next_single()
457 		if (i < 0 || i >= nr_entries) {  in dm_btree_lookup_next_single()
537 	move_entries(n, 0, n, count, le32_to_cpu(n->header.nr_entries) - count);  in shift_down()
546 	move_entries(n, count, n, 0, le32_to_cpu(n->header.nr_entries));  in shift_up()
555 	unsigned int nr_left = le32_to_cpu(left->header.nr_entries);  in redistribute2()
556 	unsigned int nr_right = le32_to_cpu(right->header.nr_entries);  in redistribute2()
574 	left->header.nr_entries = cpu_to_le32(target_left);  in redistribute2()
575 	right->header.nr_entries = cpu_to_le32(target_right);  in redistribute2()
585 	unsigned int nr_left = le32_to_cpu(left->header.nr_entries);  in redistribute3()
586 	unsigned int nr_center = le32_to_cpu(center->header.nr_entries);  in redistribute3()
587 	unsigned int nr_right = le32_to_cpu(right->header.nr_entries);  in redistribute3()
619 	left->header.nr_entries = cpu_to_le32(target_left);  in redistribute3()
620 	center->header.nr_entries = cpu_to_le32(target_center);  in redistribute3()
621 	right->header.nr_entries = cpu_to_le32(target_right);  in redistribute3()
672 	rn->header.nr_entries = cpu_to_le32(0);  in split_one_into_two()
771 	mn->header.nr_entries = cpu_to_le32(0);  in split_two_into_three()
859 	nr_left = le32_to_cpu(pn->header.nr_entries) / 2;  in btree_split_beneath()
862 	ln->header.nr_entries = cpu_to_le32(nr_left);  in btree_split_beneath()
876 	nr_right = le32_to_cpu(pn->header.nr_entries) - nr_left;  in btree_split_beneath()
879 	rn->header.nr_entries = cpu_to_le32(nr_right);  in btree_split_beneath()
888 	pn->header.nr_entries = cpu_to_le32(2);  in btree_split_beneath()
976 	unsigned int nr_entries;  in get_node_free_space()  local
985 	nr_entries = le32_to_cpu(node->header.nr_entries);  in get_node_free_space()
986 	*space = le32_to_cpu(node->header.max_entries) - nr_entries;  in get_node_free_space()
1006 	unsigned int nr_parent = le32_to_cpu(parent->header.nr_entries);  in rebalance_or_split()
1080 	if (node->header.nr_entries == node->header.max_entries) {  in has_space_for_insert()
1187 		BUG_ON(i >= le32_to_cpu(node->header.nr_entries));  in __btree_get_overwrite_leaf()
1230 	return ((index >= le32_to_cpu(node->header.nr_entries)) ||  in need_insert()
1352 		i = le32_to_cpu(ro_node(s)->header.nr_entries);  in find_key()
1437 	nr = le32_to_cpu(n->header.nr_entries);  in walk_node()
1477 	nr = le32_to_cpu(bn->header.nr_entries);  in prefetch_values()
1534 		if (n->index < le32_to_cpu(bn->header.nr_entries))  in inc_or_backtrack()
1565 	if (!r && (le32_to_cpu(bn->header.nr_entries) == 0))  in find_leaf()