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()
98 	node->header.nr_entries = cpu_to_le32(nr_entries + 1);  in insert_at()
138 	n->header.flags = cpu_to_le32(LEAF_NODE);  in dm_btree_empty()
139 	n->header.nr_entries = cpu_to_le32(0);  in dm_btree_empty()
140 	n->header.max_entries = cpu_to_le32(max_entries);  in dm_btree_empty()
141 	n->header.value_size = cpu_to_le32(info->value_type.size);  in dm_btree_empty()
218 		f->nr_children = le32_to_cpu(f->n->header.nr_entries);  in push_frame()
267 		flags = le32_to_cpu(f->n->header.flags);  in dm_btree_del()
316 		flags = le32_to_cpu(ro_node(s)->header.flags);  in btree_lookup_raw()
317 		nr_entries = le32_to_cpu(ro_node(s)->header.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()
431 	rn->header.flags = ln->header.flags;  in btree_split_sibling()
432 	rn->header.nr_entries = cpu_to_le32(nr_right);  in btree_split_sibling()
433 	rn->header.max_entries = ln->header.max_entries;  in btree_split_sibling()
434 	rn->header.value_size = ln->header.value_size;  in btree_split_sibling()
437 	size = le32_to_cpu(ln->header.flags) & INTERNAL_NODE ?  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()
521 	ln->header.flags = pn->header.flags;  in btree_split_beneath()
522 	ln->header.nr_entries = cpu_to_le32(nr_left);  in btree_split_beneath()
523 	ln->header.max_entries = pn->header.max_entries;  in btree_split_beneath()
524 	ln->header.value_size = pn->header.value_size;  in btree_split_beneath()
526 	rn->header.flags = pn->header.flags;  in btree_split_beneath()
527 	rn->header.nr_entries = cpu_to_le32(nr_right);  in btree_split_beneath()
528 	rn->header.max_entries = pn->header.max_entries;  in btree_split_beneath()
529 	rn->header.value_size = pn->header.value_size;  in btree_split_beneath()
534 	size = le32_to_cpu(pn->header.flags) & INTERNAL_NODE ?  in btree_split_beneath()
541 	pn->header.flags = cpu_to_le32(INTERNAL_NODE);  in btree_split_beneath()
542 	pn->header.nr_entries = cpu_to_le32(2);  in btree_split_beneath()
543 	pn->header.max_entries = cpu_to_le32(  in btree_split_beneath()
547 	pn->header.value_size = cpu_to_le32(sizeof(__le64));  in btree_split_beneath()
608 		if (node->header.nr_entries == node->header.max_entries) {  in btree_insert_raw()
622 		if (le32_to_cpu(node->header.flags) & LEAF_NODE)  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()
768 		flags = le32_to_cpu(ro_node(s)->header.flags);  in find_highest_key()
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()
829 		if (le32_to_cpu(n->header.flags) & INTERNAL_NODE) {  in walk_node()