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()
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()
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()
550 	size = le32_to_cpu(pn->header.flags) & INTERNAL_NODE ?  in btree_split_beneath()
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()