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()
368 	*result_key = le64_to_cpu(ro_node(s)->keys[i]);  in btree_lookup_raw()
375 		    uint64_t *keys, void *value_le)  in dm_btree_lookup()  argument
397 		r = btree_lookup_raw(&spine, root, keys[level],  in dm_btree_lookup()
402 			if (rkey != keys[level]) {  in dm_btree_lookup()
462 		*rkey = le64_to_cpu(n->keys[i]);  in dm_btree_lookup_next_single()
471 			 uint64_t *keys, uint64_t *rkey, void *value_le)  in dm_btree_lookup_next()  argument
480 		r = btree_lookup_raw(&spine, root, keys[level],  in dm_btree_lookup_next()
486 		if (*rkey != keys[level]) {  in dm_btree_lookup_next()
494 	r = dm_btree_lookup_next_single(info, root, keys[level], rkey, value_le);  in dm_btree_lookup_next()
560 	memcpy(rn->keys, ln->keys + nr_left, nr_right * sizeof(rn->keys[0]));  in btree_split_sibling()
582 		      le64_to_cpu(rn->keys[0]), &location);  in btree_split_sibling()
588 	if (key < le64_to_cpu(rn->keys[0])) {  in btree_split_sibling()
647 	memcpy(ln->keys, pn->keys, nr_left * sizeof(pn->keys[0]));  in btree_split_beneath()
664 	memcpy(rn->keys, pn->keys + nr_left, nr_right * sizeof(pn->keys[0]));  in btree_split_beneath()
679 	pn->keys[0] = ln->keys[0];  in btree_split_beneath()
684 	pn->keys[1] = rn->keys[0];  in btree_split_beneath()
740 			node->keys[0] = cpu_to_le64(key);  in btree_insert_raw()
748 	if (i < 0 || le64_to_cpu(node->keys[i]) != key)  in btree_insert_raw()
755 static bool need_insert(struct btree_node *node, uint64_t *keys,  in need_insert()  argument
759 		(le64_to_cpu(node->keys[index]) != keys[level]));  in need_insert()
763 		  uint64_t *keys, void *value, dm_block_t *new_root,  in insert()  argument
778 		r = btree_insert_raw(&spine, block, &le64_type, keys[level], &index);  in insert()
784 		if (need_insert(n, keys, level, index)) {  in insert()
796 				      keys[level], &new_le);  in insert()
806 			     keys[level], &index);  in insert()
812 	if (need_insert(n, keys, level, index)) {  in insert()
817 			      keys[level], value);  in insert()
850 		    uint64_t *keys, void *value, dm_block_t *new_root)  in dm_btree_insert()  argument
853 	return insert(info, root, keys, value, new_root, NULL);  in dm_btree_insert()
858 			   uint64_t *keys, void *value, dm_block_t *new_root,  in dm_btree_insert_notify()  argument
862 	return insert(info, root, keys, value, new_root, inserted);  in dm_btree_insert_notify()
887 			*result_key = le64_to_cpu(ro_node(s)->keys[i]);  in find_key()
889 			*result_key = le64_to_cpu(ro_node(s)->keys[0]);  in find_key()
950 		     int (*fn)(void *context, uint64_t *keys, void *leaf),  in walk_node()  argument
957 	uint64_t keys;  in walk_node()  local
972 			keys = le64_to_cpu(*key_ptr(n, i));  in walk_node()
973 			r = fn(context, &keys, value_ptr(n, i));  in walk_node()
985 		  int (*fn)(void *context, uint64_t *keys, void *leaf),  in dm_btree_walk()  argument