| /fs/bcachefs/ |
| A D | util.c | 814 cmp_u16, &search);
816 if (test_array[r] > search) {
839 search, r, s);
851 cmp_u16, &search);
876 search, r, s);
888 cmp_u16, &search);
890 if (test_array[r] < search) {
913 search, r, s);
926 cmp_u16, &search);
933 cmp_u16, &search);
[all …]
|
| A D | eytzinger.h | 244 cmp_func_t cmp, const void *search) in eytzinger0_find_le() argument
250 n = eytzinger1_child(n, cmp(base1 + n * size, search) <= 0); in eytzinger0_find_le()
257 cmp_func_t cmp, const void *search) in eytzinger0_find_gt() argument
263 n = eytzinger1_child(n, cmp(base1 + n * size, search) <= 0); in eytzinger0_find_gt()
270 cmp_func_t cmp, const void *search) in eytzinger0_find_ge() argument
276 n = eytzinger1_child(n, cmp(base1 + n * size, search) < 0); in eytzinger0_find_ge()
281 #define eytzinger0_find(base, nr, size, _cmp, search) \ argument
285 const void *_search = (search); \
|
| A D | replicas.c | 246 struct bch_replicas_entry_v1 *search) in __replicas_entry_idx() argument
255 entry_cmp, search); in __replicas_entry_idx()
262 struct bch_replicas_entry_v1 *search) in bch2_replicas_entry_idx() argument
264 bch2_replicas_entry_sort(search); in bch2_replicas_entry_idx()
270 struct bch_replicas_entry_v1 *search) in __replicas_has_entry() argument
272 return __replicas_entry_idx(r, search) >= 0; in __replicas_has_entry()
276 struct bch_replicas_entry_v1 *search) in bch2_replicas_marked_locked() argument
278 verify_replicas_entry(search); in bch2_replicas_marked_locked()
280 return !search->nr_devs || in bch2_replicas_marked_locked()
281 (__replicas_has_entry(&c->replicas, search) && in bch2_replicas_marked_locked()
[all …]
|
| A D | bset.c | 1052 struct bpos *search) in bset_search_write_set() argument
1102 const struct bpos *search, in bset_search_tree() argument
1156 struct bpos *search, in __bch2_bset_search() argument
1179 return bset_search_write_set(b, t, search); in __bch2_bset_search()
1190 struct bpos *search, in bch2_bset_search_linear() argument
1198 lossy_packed_search, search) < 0) in bch2_bset_search_linear()
1203 bkey_iter_pos_cmp(b, m, search) < 0) in bch2_bset_search_linear()
1211 packed_search, search) >= 0); in bch2_bset_search_linear()
1253 trace_bkey_pack_pos_fail(search); in btree_node_iter_init_pack_failed()
1258 bkey_iter_pos_cmp(b, k, search) < 0) in btree_node_iter_init_pack_failed()
[all …]
|
| A D | btree_write_buffer.h | 52 struct btree_write_buffered_key search; in bch2_accounting_key_to_wb() local
53 search.btree = btree; in bch2_accounting_key_to_wb()
54 search.k.k.p = k->k.p; in bch2_accounting_key_to_wb()
58 wb_key_cmp, &search); in bch2_accounting_key_to_wb()
|
| A D | acl.c | 275 struct xattr_search_key search = X_SEARCH(acl_to_xattr_type(type), "", 0); in bch2_get_acl() local
287 &hash, inode_inum(inode), &search, 0); in bch2_get_acl()
331 struct xattr_search_key search = in bch2_set_acl_trans() local
335 inum, &search); in bch2_set_acl_trans()
407 struct xattr_search_key search = X_SEARCH(KEY_TYPE_XATTR_INDEX_POSIX_ACL_ACCESS, "", 0); in bch2_acl_chmod() local
412 &hash_info, inum, &search, BTREE_ITER_intent); in bch2_acl_chmod()
|
| A D | btree_node_scan.c | 498 found_btree_node_range_start_cmp, &search); \
509 struct found_btree_node search = { in bch2_btree_node_is_stale() local
516 for_each_found_btree_node_in_range(f, search, idx) in bch2_btree_node_is_stale()
528 struct found_btree_node search = { in bch2_btree_has_scanned_nodes() local
535 for_each_found_btree_node_in_range(&c->found_btree_nodes, search, idx) in bch2_btree_has_scanned_nodes()
566 struct found_btree_node search = { in bch2_get_scanned_nodes() local
573 for_each_found_btree_node_in_range(f, search, idx) { in bch2_get_scanned_nodes()
|
| A D | btree_journal_iter.c | 84 search: in bch2_journal_keys_peek_max()
94 goto search; in bch2_journal_keys_peek_max()
123 goto search; in bch2_journal_keys_peek_max()
143 search: in bch2_journal_keys_peek_prev_min()
153 goto search; in bch2_journal_keys_peek_prev_min()
188 goto search; in bch2_journal_keys_peek_prev_min()
|
| A D | xattr.c | 144 struct xattr_search_key search = X_SEARCH(type, name, strlen(name)); in bch2_xattr_get_trans() local
147 inode_inum(inode), &search, 0); in bch2_xattr_get_trans()
218 struct xattr_search_key search = in bch2_xattr_set() local
222 hash_info, inum, &search); in bch2_xattr_set()
|
| A D | journal_seq_blacklist.c | 110 struct journal_seq_blacklist_table_entry search = { .start = seq }; in bch2_journal_seq_is_blacklisted() local
119 &search); in bch2_journal_seq_is_blacklisted()
|
| /fs/resctrl/ |
| A D | Kconfig | 38 This causes the CLOSID allocator to search for CLOSID with clean
|
| /fs/btrfs/ |
| A D | ctree.c | 1288 u64 search; in reada_for_search() local
1318 search = btrfs_node_blockptr(node, slot); in reada_for_search()
1323 eb = find_extent_buffer(fs_info, search); in reada_for_search()
1330 target = search; in reada_for_search()
1351 search = btrfs_node_blockptr(node, nr); in reada_for_search()
1353 (search <= target && target - search <= 65536) || in reada_for_search()
1354 (search > target && search - target <= 65536)) { in reada_for_search()
|
| A D | extent-io-tree.c | 1683 goto search; in btrfs_count_range_bits()
1688 goto search; in btrfs_count_range_bits()
1713 search: in btrfs_count_range_bits()
|
| A D | extent-tree.c | 4475 search: in find_free_extent()
4624 goto search; in find_free_extent()
|
| A D | tree-log.c | 3959 search: in log_dir_items()
4019 goto search; in log_dir_items()
|
| /fs/ocfs2/ |
| A D | extent_map.c | 227 search: in ocfs2_extent_map_insert_rec()
253 goto search; in ocfs2_extent_map_insert_rec()
|
| A D | suballoc.c | 1536 int search = -ENOSPC; in ocfs2_cluster_group_search() local
1593 search = 0; /* success */ in ocfs2_cluster_group_search()
1596 return search; in ocfs2_cluster_group_search()
1999 search: in ocfs2_claim_suballoc_bits()
2047 goto search; in ocfs2_claim_suballoc_bits()
|
| A D | xattr.c | 3829 struct ocfs2_xattr_bucket *search; in ocfs2_xattr_bucket_find() local
3832 search = ocfs2_xattr_bucket_new(inode); in ocfs2_xattr_bucket_find()
3833 if (!search) { in ocfs2_xattr_bucket_find()
3839 ret = ocfs2_read_xattr_bucket(search, p_blkno); in ocfs2_xattr_bucket_find()
3845 xh = bucket_xh(search); in ocfs2_xattr_bucket_find()
3848 ocfs2_xattr_bucket_relse(search); in ocfs2_xattr_bucket_find()
3852 ret = ocfs2_read_xattr_bucket(search, blkno); in ocfs2_xattr_bucket_find()
3858 xh = bucket_xh(search); in ocfs2_xattr_bucket_find()
3882 ret = ocfs2_find_xe_in_bucket(inode, search, in ocfs2_xattr_bucket_find()
3921 ocfs2_xattr_bucket_free(search); in ocfs2_xattr_bucket_find()
|
| A D | dir.c | 923 goto search; in ocfs2_dx_dir_search()
952 search: in ocfs2_dx_dir_search()
|
| /fs/befs/ |
| A D | ChangeLog | 37 * Sergey S. Kostyliov made befs_find_key() use a binary search to find
38 keys within btree nodes, rather than the linear search we were using
|
| /fs/jfs/ |
| A D | jfs_xtree.c | 74 uint search; member
246 INCREMENT(xtStat.search); in xtSearch()
2925 xtStat.search, in jfs_xtstat_proc_show()
|
| /fs/gfs2/ |
| A D | rgrp.c | 182 static const u64 search[] = { in gfs2_bit_search() local
188 tmp = le64_to_cpu(*ptr) ^ search[state]; in gfs2_bit_search()
|