40 /* makes the assumption that no two keys are the same. */
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()
376 		    uint64_t *keys, void *value_le)  in dm_btree_lookup()  argument
398 		r = btree_lookup_raw(&spine, root, keys[level],  in dm_btree_lookup()
403 			if (rkey != keys[level]) {  in dm_btree_lookup()
463 		*rkey = le64_to_cpu(n->keys[i]);  in dm_btree_lookup_next_single()
472 			 uint64_t *keys, uint64_t *rkey, void *value_le)  in dm_btree_lookup_next()  argument
481 		r = btree_lookup_raw(&spine, root, keys[level],  in dm_btree_lookup_next()
487 		if (*rkey != keys[level]) {  in dm_btree_lookup_next()
495 	r = dm_btree_lookup_next_single(info, root, keys[level], rkey, value_le);  in dm_btree_lookup_next()
561 	memcpy(rn->keys, ln->keys + nr_left, nr_right * sizeof(rn->keys[0]));  in btree_split_sibling()
583 		      le64_to_cpu(rn->keys[0]), &location);  in btree_split_sibling()
589 	if (key < le64_to_cpu(rn->keys[0])) {  in btree_split_sibling()
648 	memcpy(ln->keys, pn->keys, nr_left * sizeof(pn->keys[0]));  in btree_split_beneath()
665 	memcpy(rn->keys, pn->keys + nr_left, nr_right * sizeof(pn->keys[0]));  in btree_split_beneath()
680 	pn->keys[0] = ln->keys[0];  in btree_split_beneath()
685 	pn->keys[1] = rn->keys[0];  in btree_split_beneath()
741 			node->keys[0] = cpu_to_le64(key);  in btree_insert_raw()
749 	if (i < 0 || le64_to_cpu(node->keys[i]) != key)  in btree_insert_raw()
756 static bool need_insert(struct btree_node *node, uint64_t *keys,  in need_insert()  argument
760 		(le64_to_cpu(node->keys[index]) != keys[level]));  in need_insert()
764 		  uint64_t *keys, void *value, dm_block_t *new_root,  in insert()  argument
779 		r = btree_insert_raw(&spine, block, &le64_type, keys[level], &index);  in insert()
785 		if (need_insert(n, keys, level, index)) {  in insert()
797 				      keys[level], &new_le);  in insert()
807 			     keys[level], &index);  in insert()
813 	if (need_insert(n, keys, level, index)) {  in insert()
818 			      keys[level], value);  in insert()
851 		    uint64_t *keys, void *value, dm_block_t *new_root)  in dm_btree_insert()  argument
854 	return insert(info, root, keys, value, new_root, NULL);  in dm_btree_insert()
859 			   uint64_t *keys, void *value, dm_block_t *new_root,  in dm_btree_insert_notify()  argument
863 	return insert(info, root, keys, value, new_root, inserted);  in dm_btree_insert_notify()
888 			*result_key = le64_to_cpu(ro_node(s)->keys[i]);  in find_key()
890 			*result_key = le64_to_cpu(ro_node(s)->keys[0]);  in find_key()
951 		     int (*fn)(void *context, uint64_t *keys, void *leaf),  in walk_node()  argument
958 	uint64_t keys;  in walk_node()  local
973 			keys = le64_to_cpu(*key_ptr(n, i));  in walk_node()
974 			r = fn(context, &keys, value_ptr(n, i));  in walk_node()
986 		  int (*fn)(void *context, uint64_t *keys, void *leaf),  in dm_btree_walk()  argument