Searched refs:btrfs_search_slot (Results 1 - 25 of 33) sorted by path

12

/linux-master/fs/btrfs/
H A Dbackref.c665 ret = btrfs_search_slot(NULL, root, &search_key, path, 0, 0);
1429 ret = btrfs_search_slot(NULL, root, &key, path, 0, 0);
2065 ret = btrfs_search_slot(NULL, root, &key, path, 0, 0);
2075 * btrfs_search_slot will point us to the slot
2222 ret = btrfs_search_slot(NULL, extent_root, &key, path, 0, 0);
2874 ret = btrfs_search_slot(NULL, extent_root, &key, path, 0, 0);
3351 ret = btrfs_search_slot(NULL, root, tree_key, path, 0, 0);
H A Dblock-group.c747 ret = btrfs_search_slot(NULL, extent_root, &key, path, 0, 0);
1039 ret = btrfs_search_slot(trans, root, &key, path, -1, 1);
3071 ret = btrfs_search_slot(trans, root, &key, path, 0, 1);
H A Dctree.c1484 * Helper function for btrfs_search_slot() and other functions that do a search
1609 * helper function for btrfs_search_slot. This does all of the checks
1614 * drop the path, -EAGAIN is returned and btrfs_search_slot must
1678 ret = btrfs_search_slot(NULL, fs_root, &key, path, 0, 0);
1997 int btrfs_search_slot(struct btrfs_trans_handle *trans, struct btrfs_root *root, function
2235 ALLOW_ERROR_INJECTION(btrfs_search_slot, ERRNO);
2238 * Like btrfs_search_slot, this looks for a key in the given tree. It uses the
2246 * btrfs_search_slot at that point in time with ins_len and cow both set to 0.
2266 return btrfs_search_slot(NULL, root, key, p, 0, 0);
2374 ret = btrfs_search_slot(NUL
[all...]
H A Dctree.h78 * Indicate that new item (btrfs_search_slot) is extending already
577 int btrfs_search_slot(struct btrfs_trans_handle *trans, struct btrfs_root *root,
669 * @iter_ret: Contains the value returned from btrfs_search_slot or
673 * btrfs_search_slot, if it encountered an error, or the value returned from
679 * values stemming from btrfs_search_slot.
682 for (iter_ret = btrfs_search_slot(NULL, (root), (key), (path), 0, 0); \
H A Ddefrag.c508 wret = btrfs_search_slot(trans, root, &key, path, 0, 1);
536 * btrfs_search_slot() / ctree.c:unlock_up() does not keeps a lock on a
654 ret = btrfs_search_slot(NULL, root, &key, &path, 0, 0);
660 * If btrfs_search_slot() makes path to point beyond nritems,
H A Ddelayed-inode.c945 ret = btrfs_search_slot(trans, root, &key, path, -1, 1);
1061 ret = btrfs_search_slot(trans, root, &key, path, -1, 1);
H A Ddev-replace.c96 ret = btrfs_search_slot(NULL, dev_root, &key, path, 0, 0);
372 ret = btrfs_search_slot(trans, dev_root, &key, path, -1, 1);
H A Ddir-item.c187 ret = btrfs_search_slot(trans, root, key, path, ins_len, cow);
H A Ddisk-io.c1383 ret = btrfs_search_slot(NULL, fs_info->tree_root, &key, path, 0, 0);
2150 ret = btrfs_search_slot(NULL, tree_root, &key, path, 0, 0);
4928 ret = btrfs_search_slot(NULL, root, &search_key, path, 0, 0);
H A Dexport.c173 ret = btrfs_search_slot(NULL, root, &key, path, 0, 0);
256 ret = btrfs_search_slot(NULL, root, &key, path, 0, 0);
H A Dextent-tree.c86 ret = btrfs_search_slot(NULL, root, &key, path, 0, 0);
145 ret = btrfs_search_slot(NULL, extent_root, &key, path, 0, 0);
466 ret = btrfs_search_slot(trans, root, &key, path, -1, 1);
700 ret = btrfs_search_slot(trans, root, &key, path, -1, 1);
827 ret = btrfs_search_slot(trans, root, &key, path, extra_size, 1);
1674 ret = btrfs_search_slot(trans, root, &key, path, 0, 1);
2396 ret = btrfs_search_slot(NULL, extent_root, &key, path, 0, 0);
3209 ret = btrfs_search_slot(trans, extent_root,
3231 ret = btrfs_search_slot(trans, extent_root,
5933 ret = btrfs_search_slot(NUL
[all...]
H A Dextent_io.c2814 ret = btrfs_search_slot(NULL, root, &key, path, 0, 0);
3008 * For a non-existing key, btrfs_search_slot() always leaves us at a
H A Dfile-item.c218 ret = btrfs_search_slot(trans, root, &file_key, path, 0, cow);
266 return btrfs_search_slot(trans, root, &file_key, path, ins_len, cow);
484 ret = btrfs_search_slot(NULL, root, &key, path, 0, 0);
633 ret = btrfs_search_slot(NULL, root, &key, path, 0, 0);
885 ret = btrfs_search_slot(trans, root, &key, path, -1, 1);
1119 ret = btrfs_search_slot(trans, root, &file_key, path,
H A Dfile.c631 ret = btrfs_search_slot(trans, root, &key, path, -1, 1);
2099 ret = btrfs_search_slot(trans, root, &key, path, 0, 1);
3541 ret = btrfs_search_slot(NULL, root, &key, path, 0, 0);
H A Dfree-space-cache.c99 ret = btrfs_search_slot(NULL, root, &key, path, 0, 0);
285 ret = btrfs_search_slot(trans, trans->fs_info->tree_root, &key, path,
761 ret = btrfs_search_slot(NULL, root, &key, path, 0, 0);
1163 ret = btrfs_search_slot(trans, root, &key, path, 0, 1);
H A Dfree-space-tree.c115 ret = btrfs_search_slot(trans, root, &key, path, 0, cow);
130 * btrfs_search_slot() but we're looking for the greatest key less than the
140 ret = btrfs_search_slot(trans, root, key, p, ins_len, cow);
1239 ret = btrfs_search_slot(trans, root, &key, path, -1, 1);
H A Dinode-item.c96 ret = btrfs_search_slot(trans, root, &key, path, ins_len, cow);
130 ret = btrfs_search_slot(trans, root, &key, path, -1, 1);
201 ret = btrfs_search_slot(trans, root, &key, path, -1, 1);
411 ret = btrfs_search_slot(trans, root, location, path, ins_len, cow);
515 ret = btrfs_search_slot(trans, root, &key, path, -1, 1);
H A Dinode.c171 ret = btrfs_search_slot(NULL, local_root, &key, &warn->path, 0, 0);
3521 ret = btrfs_search_slot(NULL, root, &key, path, 0, 0);
4407 ret = btrfs_search_slot(NULL, fs_info->tree_root, &key, path, 0, 0);
5475 ret = btrfs_search_slot(NULL, fs_info->tree_root, &key, path, 0, 0);
5637 * ret > 0 can come from btrfs_search_slot called by
5815 ret = btrfs_search_slot(NULL, root, &key, path, 0, 0);
H A Dioctl.c2045 ret = btrfs_search_slot(NULL, fs_info->tree_root, &key, path, 0, 0);
2229 ret = btrfs_search_slot(NULL, fs_info->tree_root, &key, path, 0, 0);
2312 ret = btrfs_search_slot(NULL, root, &key, path, 0, 0);
H A Dorphan.c45 ret = btrfs_search_slot(trans, root, &key, path, -1, 1);
H A Dqgroup.c690 ret = btrfs_search_slot(trans, quota_root, &key, path, -1, 1);
787 ret = btrfs_search_slot(trans, quota_root, &key, path, -1, 1);
803 ret = btrfs_search_slot(trans, quota_root, &key, path, -1, 1);
838 ret = btrfs_search_slot(trans, quota_root, &key, path, 0, 1);
884 ret = btrfs_search_slot(trans, quota_root, &key, path, 0, 1);
926 ret = btrfs_search_slot(trans, quota_root, &key, path, 0, 1);
970 ret = btrfs_search_slot(trans, root, &key, path, -1, 1);
2184 * It should acts as a simplified btrfs_search_slot().
2235 /* A simplified version of btrfs_search_slot() */
H A Draid-stripe-tree.c41 ret = btrfs_search_slot(trans, stripe_root, &key, path, -1, 1);
183 ret = btrfs_search_slot(NULL, stripe_root, &stripe_key, path, 0, 0);
H A Dreflink.c195 ret = btrfs_search_slot(NULL, root, &key, path, 0, 0);
382 ret = btrfs_search_slot(NULL, BTRFS_I(src)->root, &key, path,
H A Drelocation.c1339 ret = btrfs_search_slot(trans, src, &key, path, 0, 1);
1729 ret = btrfs_search_slot(NULL, reloc_root, &key, path, 0, 0);
2451 ret = btrfs_search_slot(trans, root, key, path, 0, 1);
2749 ret = btrfs_search_slot(trans, root, key, path, 0, 1);
3358 ret = btrfs_search_slot(NULL, rc->extent_root, &key, path, 0, 0);
3554 ret = btrfs_search_slot(NULL, rc->extent_root, &key, path,
3906 ret = btrfs_search_slot(trans, root, &key, path, -1, 1);
4274 ret = btrfs_search_slot(NULL, fs_info->tree_root, &key,
H A Droot-tree.c76 ret = btrfs_search_slot(NULL, root, search_key, path, 0, 0);
144 ret = btrfs_search_slot(trans, root, key, path, 0, 1);
170 ret = btrfs_search_slot(trans, root, key, path,
238 ret = btrfs_search_slot(NULL, tree_root, &key, path, 0, 0);
329 ret = btrfs_search_slot(trans, root, key, path, -1, 1);
364 ret = btrfs_search_slot(trans, tree_root, &key, path, -1, 1);

Completed in 581 milliseconds

12