Home
last modified time | relevance | path

Searched refs:reada (Results 1 - 25 of 38) sorted by relevance

12

/kernel/linux/linux-5.10/drivers/md/bcache/
H A Drequest.c881 unsigned int reada = 0; in cached_dev_cache_miss() local
896 reada = min_t(sector_t, dc->readahead >> 9, in cached_dev_cache_miss()
899 s->insert_bio_sectors = min(sectors, bio_sectors(bio) + reada); in cached_dev_cache_miss()
933 if (reada) in cached_dev_cache_miss()
/kernel/linux/linux-5.10/fs/reiserfs/
H A Ddir.c90 path_to_entry.reada = PATH_READA; in reiserfs_readdir_inode()
H A Dstree.c806 if ((search_path->reada & PATH_READA) && in search_by_key()
812 if (search_path->reada & PATH_READA_BACK) in search_by_key()
819 if (search_path->reada & PATH_READA_BACK) in search_by_key()
1958 * kick in the reada code in reiserfs_do_truncate()
1961 s_search_path.reada = PATH_READA | PATH_READA_BACK; in reiserfs_do_truncate()
H A Dreiserfs.h2135 int reada; member
2144 struct treepath var = {.path_length = ILLEGAL_PATH_ELEMENT_OFFSET, .reada = 0,}
/kernel/linux/linux-6.6/fs/reiserfs/
H A Ddir.c90 path_to_entry.reada = PATH_READA; in reiserfs_readdir_inode()
H A Dstree.c806 if ((search_path->reada & PATH_READA) && in search_by_key()
812 if (search_path->reada & PATH_READA_BACK) in search_by_key()
819 if (search_path->reada & PATH_READA_BACK) in search_by_key()
1956 * kick in the reada code in reiserfs_do_truncate()
1959 s_search_path.reada = PATH_READA | PATH_READA_BACK; in reiserfs_do_truncate()
H A Dreiserfs.h2132 int reada; member
2141 struct treepath var = {.path_length = ILLEGAL_PATH_ELEMENT_OFFSET, .reada = 0,}
/kernel/linux/linux-6.6/fs/btrfs/
H A Dctree.c1465 if (level != 1 && path->reada != READA_FORWARD_ALWAYS) in reada_for_search()
1478 if (path->reada == READA_FORWARD_ALWAYS) { in reada_for_search()
1489 if (path->reada != READA_FORWARD_ALWAYS) { in reada_for_search()
1505 if (path->reada == READA_BACK) { in reada_for_search()
1509 } else if (path->reada == READA_FORWARD || in reada_for_search()
1510 path->reada == READA_FORWARD_ALWAYS) { in reada_for_search()
1515 if (path->reada == READA_BACK && objectid) { in reada_for_search()
1521 if (path->reada == READA_FORWARD_ALWAYS || in reada_for_search()
1652 if (p->reada == READA_FORWARD_ALWAYS) in read_block_for_search()
1707 if (p->reada ! in read_block_for_search()
[all...]
H A Dverity.c319 path->reada = READA_FORWARD; in read_key_bytes()
H A Dctree.h57 /* Read ahead values for struct btrfs_path.reada */
91 u8 reada; member
H A Dxattr.c300 path->reada = READA_FORWARD; in btrfs_listxattr()
H A Dfile-item.c394 path->reada = READA_FORWARD; in btrfs_lookup_bio_sums()
480 path->reada = READA_FORWARD; in btrfs_lookup_csums_list()
H A Dinode-item.c498 path->reada = READA_BACK; in btrfs_truncate_inode_items()
H A Dextent-tree.c5074 goto reada; in reada_walk_down()
5091 goto reada; in reada_walk_down()
5109 reada: in reada_walk_down()
5245 int reada = 0; in do_walk_down() local
5277 reada = 1; in do_walk_down()
5328 if (reada && level == 1) in do_walk_down()
H A Dreflink.c365 path->reada = READA_FORWARD; in btrfs_clone()
H A Dfree-space-tree.c1078 path->reada = READA_FORWARD; in populate_free_space_tree()
1644 path->reada = READA_FORWARD; in load_free_space_tree()
H A Drelocation.c1714 path->reada = READA_FORWARD; in merge_reloc_root()
3662 path->reada = READA_FORWARD; in relocate_block_group()
4220 path->reada = READA_BACK; in btrfs_recover_relocation()
/kernel/linux/linux-5.10/fs/btrfs/
H A Dinode-map.c53 path->reada = READA_FORWARD; in caching_kthread()
H A Dxattr.c295 path->reada = READA_FORWARD; in btrfs_listxattr()
H A Dfile-item.c299 path->reada = READA_FORWARD; in btrfs_lookup_bio_sums()
420 path->reada = READA_FORWARD; in btrfs_lookup_csums_range()
H A Dextent-tree.c4796 goto reada; in reada_walk_down()
4813 goto reada; in reada_walk_down()
4831 reada: in reada_walk_down()
4968 int reada = 0; in do_walk_down() local
4997 reada = 1; in do_walk_down()
5049 if (reada && level == 1) in do_walk_down()
H A Dreflink.c355 path->reada = READA_FORWARD; in btrfs_clone()
H A Dfree-space-tree.c1060 path->reada = READA_FORWARD; in populate_free_space_tree()
1562 path->reada = READA_FORWARD; in load_free_space_tree()
H A Drelocation.c1680 path->reada = READA_FORWARD; in merge_reloc_root()
3298 path->reada = READA_FORWARD; in relocate_block_group()
3760 path->reada = READA_BACK; in btrfs_recover_relocation()
H A Dctree.c2254 if (path->reada == READA_BACK) { in reada_for_search()
2258 } else if (path->reada == READA_FORWARD) { in reada_for_search()
2263 if (path->reada == READA_BACK && objectid) { in reada_for_search()
2389 * reada. -EAGAIN is returned and the search must be repeated.
2456 if (p->reada != READA_NONE) in read_block_for_search()

Completed in 78 milliseconds

12