47 		uint64_t mid_key = le64_to_cpu(n->keys[mid]);  in bsearch()
101 	array_insert(node->keys, sizeof(*node->keys), nr_entries, index, &key_le);  in insert_at()
363 	*result_key = le64_to_cpu(ro_node(s)->keys[i]);  in btree_lookup_raw()
370 		    uint64_t *keys, void *value_le)  in dm_btree_lookup()  argument
392 		r = btree_lookup_raw(&spine, root, keys[level],  in dm_btree_lookup()
397 			if (rkey != keys[level]) {  in dm_btree_lookup()
450 		*rkey = le64_to_cpu(n->keys[i]);  in dm_btree_lookup_next_single()
459 			 uint64_t *keys, uint64_t *rkey, void *value_le)  in dm_btree_lookup_next()  argument
468 		r = btree_lookup_raw(&spine, root, keys[level],  in dm_btree_lookup_next()
474 		if (*rkey != keys[level]) {  in dm_btree_lookup_next()
482 	r = dm_btree_lookup_next_single(info, root, keys[level], rkey, value_le);  in dm_btree_lookup_next()
548 	memcpy(rn->keys, ln->keys + nr_left, nr_right * sizeof(rn->keys[0]));  in btree_split_sibling()
570 		      le64_to_cpu(rn->keys[0]), &location);  in btree_split_sibling()
576 	if (key < le64_to_cpu(rn->keys[0])) {  in btree_split_sibling()
646 	memcpy(ln->keys, pn->keys, nr_left * sizeof(pn->keys[0]));  in btree_split_beneath()
647 	memcpy(rn->keys, pn->keys + nr_left, nr_right * sizeof(pn->keys[0]));  in btree_split_beneath()
666 	pn->keys[0] = ln->keys[0];  in btree_split_beneath()
671 	pn->keys[1] = rn->keys[0];  in btree_split_beneath()
682 	if (key < le64_to_cpu(rn->keys[0])) {  in btree_split_beneath()
742 			node->keys[0] = cpu_to_le64(key);  in btree_insert_raw()
750 	if (i < 0 || le64_to_cpu(node->keys[i]) != key)  in btree_insert_raw()
758 		  uint64_t *keys, void *value, dm_block_t *new_root,  in insert()  argument
773 		r = btree_insert_raw(&spine, block, &le64_type, keys[level], &index);  in insert()
779 			       (le64_to_cpu(n->keys[index]) != keys[level]));  in insert()
793 				      keys[level], &new_le);  in insert()
803 			     keys[level], &index);  in insert()
809 		       (le64_to_cpu(n->keys[index]) != keys[level]));  in insert()
816 			      keys[level], value);  in insert()
849 		    uint64_t *keys, void *value, dm_block_t *new_root)  in dm_btree_insert()  argument
852 	return insert(info, root, keys, value, new_root, NULL);  in dm_btree_insert()
857 			   uint64_t *keys, void *value, dm_block_t *new_root,  in dm_btree_insert_notify()  argument
861 	return insert(info, root, keys, value, new_root, inserted);  in dm_btree_insert_notify()
886 			*result_key = le64_to_cpu(ro_node(s)->keys[i]);  in find_key()
888 			*result_key = le64_to_cpu(ro_node(s)->keys[0]);  in find_key()
945 		     int (*fn)(void *context, uint64_t *keys, void *leaf),  in walk_node()  argument
952 	uint64_t keys;  in walk_node()  local
967 			keys = le64_to_cpu(*key_ptr(n, i));  in walk_node()
968 			r = fn(context, &keys, value_ptr(n, i));  in walk_node()
980 		  int (*fn)(void *context, uint64_t *keys, void *leaf),  in dm_btree_walk()  argument