Lines Matching refs:btrfs_search_slot
1611 * Helper function for btrfs_search_slot() and other functions that do a search
1736 * helper function for btrfs_search_slot. This does all of the checks
1741 * drop the path, -EAGAIN is returned and btrfs_search_slot must
1805 ret = btrfs_search_slot(NULL, fs_root, &key, path, 0, 0);
2094 * btrfs_search_slot - look for a key in a tree and perform necessary
2124 int btrfs_search_slot(struct btrfs_trans_handle *trans, struct btrfs_root *root,
2362 ALLOW_ERROR_INJECTION(btrfs_search_slot, ERRNO);
2365 * Like btrfs_search_slot, this looks for a key in the given tree. It uses the
2373 * btrfs_search_slot at that point in time with ins_len and cow both set to 0.
2393 return btrfs_search_slot(NULL, root, key, p, 0, 0);
2501 ret = btrfs_search_slot(NULL, root, &key, path, 0, 0);
2507 * before releasing the path and calling btrfs_search_slot(), we now may
2570 ret = btrfs_search_slot(NULL, root, key, p, 0, 0);
2637 ret = btrfs_search_slot(NULL, root, key, path, 0, 0);
3993 ret = btrfs_search_slot(trans, root, &key, path, 0, 1);
4293 * function that doesn't call btrfs_search_slot
4422 ret = btrfs_search_slot(trans, root, &batch->keys[0], path, total_size, 1);
4725 * into min_key, so you can call btrfs_search_slot with cow=1 on the
4889 ret = btrfs_search_slot(NULL, root, &cur_key, path,
4966 ret = btrfs_search_slot(NULL, root, &key, path, 0, 0);