Lines Matching refs:keys
760 * Compare two keys, on little-endian the disk order is same as CPU order and
774 * compare two keys in a memcmp fashion
1208 * So, pull some keys from the left.
2166 * level 1 so we can update keys
2469 * Search the tree again to find a leaf with smaller keys.
2471 * Returns 1 if there are no smaller keys.
3421 /* Key greater than all keys in the leaf, right neighbor has
4310 * Before anything else, update keys in the parent and other ancestors
4315 btrfs_cpu_key_to_disk(&disk_key, &batch->keys[0]);
4367 btrfs_cpu_key_to_disk(&disk_key, &batch->keys[i]);
4400 batch.keys = key;
4422 ret = btrfs_search_slot(trans, root, &batch->keys[0], path, total_size, 1);
4848 * and 1 is returned if there are no higher keys in the tree