Searched refs:search (Results 1 – 14 of 14) sorted by relevance
| /fs/incfs/ |
| D | vfs.c | 312 struct inode_search *search = opaque; in inode_test() local
314 struct inode *backing_inode = d_inode(search->backing_dentry); in inode_test()
320 inode->i_ino == search->ino; in inode_test()
325 struct inode_search *search = opaque; in inode_set() local
327 struct dentry *backing_dentry = search->backing_dentry; in inode_set()
332 u64 size = search->size; in inode_set()
340 if (search->verity) in inode_set()
372 struct inode_search search = { in fetch_regular_inode() local
378 struct inode *inode = iget5_locked(sb, search.ino, inode_test, in fetch_regular_inode()
379 inode_set, &search); in fetch_regular_inode()
|
| D | pseudo_files.c | 1321 struct inode_search *search = opaque; in inode_test() local
1323 return inode->i_ino == search->ino; in inode_test()
1328 struct inode_search *search = opaque; in inode_set() local
1330 if (get_pseudo_inode(search->ino, inode)) in inode_set()
1339 struct inode_search search = { in fetch_inode() local
1342 struct inode *inode = iget5_locked(sb, search.ino, inode_test, in fetch_inode()
1343 inode_set, &search); in fetch_inode()
|
| /fs/reiserfs/ |
| D | Kconfig | 18 database and keyword search systems than block allocation based file
|
| /fs/btrfs/ |
| D | ctree.c | 2224 u64 search; in reada_for_search() local
2240 search = btrfs_node_blockptr(node, slot); in reada_for_search()
2242 eb = find_extent_buffer(fs_info, search); in reada_for_search()
2248 target = search; in reada_for_search()
2268 search = btrfs_node_blockptr(node, nr); in reada_for_search()
2269 if ((search <= target && target - search <= 65536) || in reada_for_search()
2270 (search > target && search - target <= 65536)) { in reada_for_search()
2271 readahead_tree_block(fs_info, search); in reada_for_search()
|
| D | delayed-inode.c | 1052 goto search; in __btrfs_update_delayed_inode()
1086 search: in __btrfs_update_delayed_inode()
|
| D | extent-tree.c | 4080 search: in find_free_extent()
4207 goto search; in find_free_extent()
|
| D | tree-log.c | 3655 search: in log_dir_items()
3679 goto search; in log_dir_items()
|
| /fs/ocfs2/ |
| D | extent_map.c | 229 search: in ocfs2_extent_map_insert_rec()
255 goto search; in ocfs2_extent_map_insert_rec()
|
| D | xattr.c | 3827 struct ocfs2_xattr_bucket *search; in ocfs2_xattr_bucket_find() local
3830 search = ocfs2_xattr_bucket_new(inode); in ocfs2_xattr_bucket_find()
3831 if (!search) { in ocfs2_xattr_bucket_find()
3837 ret = ocfs2_read_xattr_bucket(search, p_blkno); in ocfs2_xattr_bucket_find()
3843 xh = bucket_xh(search); in ocfs2_xattr_bucket_find()
3846 ocfs2_xattr_bucket_relse(search); in ocfs2_xattr_bucket_find()
3850 ret = ocfs2_read_xattr_bucket(search, blkno); in ocfs2_xattr_bucket_find()
3856 xh = bucket_xh(search); in ocfs2_xattr_bucket_find()
3880 ret = ocfs2_find_xe_in_bucket(inode, search, in ocfs2_xattr_bucket_find()
3919 ocfs2_xattr_bucket_free(search); in ocfs2_xattr_bucket_find()
|
| D | suballoc.c | 1482 int search = -ENOSPC; in ocfs2_cluster_group_search() local
1534 search = 0; /* success */ in ocfs2_cluster_group_search()
1544 return search; in ocfs2_cluster_group_search()
|
| D | dir.c | 911 goto search; in ocfs2_dx_dir_search()
940 search: in ocfs2_dx_dir_search()
|
| /fs/befs/ |
| 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/ |
| D | jfs_xtree.c | 94 uint search; member
242 INCREMENT(xtStat.search); in xtSearch()
3872 xtStat.search, in jfs_xtstat_proc_show()
|
| /fs/gfs2/ |
| D | rgrp.c | 164 static const u64 search[] = { in gfs2_bit_search() local
170 tmp = le64_to_cpu(*ptr) ^ search[state]; in gfs2_bit_search()
|