/linux-master/fs/btrfs/ |
H A D | orphan.c | 45 ret = btrfs_search_slot(trans, root, &key, path, -1, 1);
|
H A D | root-tree.c | 76 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);
|
H A D | raid-stripe-tree.c | 41 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 D | inode-item.c | 96 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 D | uuid-tree.c | 47 ret = btrfs_search_slot(NULL, uuid_root, &key, path, 0, 0); 177 ret = btrfs_search_slot(trans, uuid_root, &key, path, -1, 1);
|
H A D | export.c | 173 ret = btrfs_search_slot(NULL, root, &key, path, 0, 0); 256 ret = btrfs_search_slot(NULL, root, &key, path, 0, 0);
|
H A D | tree-log.c | 400 ret = btrfs_search_slot(NULL, root, key, path, 0, 0); 1028 ret = btrfs_search_slot(NULL, log, key, path, 0, 0); 1068 ret = btrfs_search_slot(NULL, root, &search_key, path, 0, 0); 1276 ret = btrfs_search_slot(NULL, root, key, path, 0, 0); 1542 ret = btrfs_search_slot(NULL, inode->root, &key, path, 0, 0); 1657 ret = btrfs_search_slot(trans, root, &key, path, -1, 1); 2036 ret = btrfs_search_slot(NULL, root, &key, path, 0, 0); 2190 ret = btrfs_search_slot(NULL, root, &search_key, path, 0, 0); 2325 ret = btrfs_search_slot(NULL, root, &dir_key, path, 3355 ret = btrfs_search_slot(NUL [all...] |
H A D | file-item.c | 218 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 D | verity.c | 137 ret = btrfs_search_slot(trans, root, &key, path, -1, 1); 324 ret = btrfs_search_slot(NULL, root, &key, path, 0, 0);
|
H A D | ctree.h | 78 * 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 D | ctree.c | 1484 * 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 D | dir-item.c | 187 ret = btrfs_search_slot(trans, root, key, path, ins_len, cow);
|
H A D | dev-replace.c | 96 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 D | relocation.c | 1339 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 D | reflink.c | 195 ret = btrfs_search_slot(NULL, root, &key, path, 0, 0); 382 ret = btrfs_search_slot(NULL, BTRFS_I(src)->root, &key, path,
|
H A D | volumes.c | 1777 ret = btrfs_search_slot(trans, root, &key, path, -1, 1); 1844 ret = btrfs_search_slot(NULL, fs_info->chunk_root, &key, path, 0, 0); 1967 ret = btrfs_search_slot(trans, root, &key, path, -1, 1); 2583 ret = btrfs_search_slot(trans, root, &key, path, 0, 1); 2899 ret = btrfs_search_slot(trans, root, &key, path, 0, 1); 2987 ret = btrfs_search_slot(trans, root, &key, path, -1, 1); 3444 ret = btrfs_search_slot(NULL, chunk_root, &key, path, 0, 0); 3660 ret = btrfs_search_slot(trans, root, &key, path, -1, 1); 4059 ret = btrfs_search_slot(NULL, chunk_root, &key, path, 0, 0); 4650 ret = btrfs_search_slot(NUL [all...] |
H A D | extent-tree.c | 86 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 D | qgroup.c | 690 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); 2189 * It should acts as a simplified btrfs_search_slot(). 2240 /* A simplified version of btrfs_search_slot() */
|
H A D | free-space-tree.c | 115 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 D | defrag.c | 508 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 D | backref.c | 665 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 D | scrub.c | 416 ret = btrfs_search_slot(NULL, local_root, &key, swarn->path, 0, 0); 1360 * a btrfs_search_slot(). 1362 * slot, to avoid duplicated btrfs_search_slot() calls. 1390 ret = btrfs_search_slot(NULL, extent_root, &key, path, 0, 0); 2488 ret = btrfs_search_slot(NULL, root, &key, path, 0, 0);
|
H A D | send.c | 940 ret = btrfs_search_slot(NULL, root, &key, path, 0, 0); 1767 ret = btrfs_search_slot(NULL, root, &key, path, 0, 0); 2752 ret = btrfs_search_slot(NULL, sctx->send_root, &key, path, 0, 0); 3241 ret = btrfs_search_slot(NULL, root, &key, path, 0, 0); 3791 ret = btrfs_search_slot(NULL, sctx->parent_root, &key, path, 0, 0); 5951 ret = btrfs_search_slot(NULL, clone_root->root, &key, path, 0, 0); 6421 ret = btrfs_search_slot(NULL, root, &key, path, 0, 0); 7332 ret = btrfs_search_slot(NULL, root, key, path, 0, 0);
|
H A D | delayed-inode.c | 945 ret = btrfs_search_slot(trans, root, &key, path, -1, 1); 1061 ret = btrfs_search_slot(trans, root, &key, path, -1, 1);
|
/linux-master/fs/btrfs/tests/ |
H A D | qgroup-tests.c | 90 ret = btrfs_search_slot(&trans, root, &key, path, 0, 1); 139 ret = btrfs_search_slot(&trans, root, &key, path, -1, 1); 172 ret = btrfs_search_slot(&trans, root, &key, path, 0, 1); 194 ret = btrfs_search_slot(&trans, root, &key, path, -1, 1);
|