Home
last modified time | relevance | path

Searched refs:reada (Results 1 – 19 of 19) sorted by relevance

/linux/fs/btrfs/
A DMakefile30 reada.o backref.o ulist.o qgroup.o send.o dev-replace.o raid56.o \
A Dctree.c1242 if (level != 1 && path->reada != READA_FORWARD_ALWAYS) in reada_for_search()
1255 if (path->reada == READA_FORWARD_ALWAYS) { in reada_for_search()
1266 if (path->reada != READA_FORWARD_ALWAYS) { in reada_for_search()
1282 if (path->reada == READA_BACK) { in reada_for_search()
1286 } else if (path->reada == READA_FORWARD || in reada_for_search()
1287 path->reada == READA_FORWARD_ALWAYS) { in reada_for_search()
1292 if (path->reada == READA_BACK && objectid) { in reada_for_search()
1298 if (path->reada == READA_FORWARD_ALWAYS || in reada_for_search()
1414 if (p->reada == READA_FORWARD_ALWAYS) in read_block_for_search()
1453 if (p->reada != READA_NONE) in read_block_for_search()
A Dxattr.c295 path->reada = READA_FORWARD; in btrfs_listxattr()
A Dverity.c313 path->reada = READA_FORWARD; in read_key_bytes()
A Dfile-item.c421 path->reada = READA_FORWARD; in btrfs_lookup_bio_sums()
519 path->reada = READA_FORWARD; in btrfs_lookup_csums_range()
A Dfree-space-tree.c1058 path->reada = READA_FORWARD; in populate_free_space_tree()
1558 path->reada = READA_FORWARD; in load_free_space_tree()
A Dextent-tree.c5013 goto reada; in reada_walk_down()
5030 goto reada; in reada_walk_down()
5048 reada: in reada_walk_down()
5185 int reada = 0; in do_walk_down() local
5212 reada = 1; in do_walk_down()
5263 if (reada && level == 1) in do_walk_down()
A Dreflink.c359 path->reada = READA_FORWARD; in btrfs_clone()
A Ddev-replace.c515 path->reada = READA_FORWARD; in mark_block_group_to_copy()
A Drelocation.c1696 path->reada = READA_FORWARD; in merge_reloc_root()
3591 path->reada = READA_FORWARD; in relocate_block_group()
4141 path->reada = READA_BACK; in btrfs_recover_relocation()
A Dinode.c3488 path->reada = READA_BACK; in btrfs_orphan_cleanup()
4694 path->reada = READA_BACK; in btrfs_truncate_inode_items()
6141 path->reada = READA_FORWARD; in btrfs_real_readdir()
7095 path->reada = READA_FORWARD; in btrfs_get_extent()
A Dvolumes.c1607 path->reada = READA_FORWARD; in find_free_dev_extent_start()
4815 path->reada = READA_BACK; in btrfs_shrink_device()
8166 path->reada = READA_FORWARD; in btrfs_verify_dev_extents()
A Dblock-group.c550 path->reada = READA_FORWARD; in load_extent_tree_free()
A Dctree.h388 u8 reada; member
A Dscrub.c3672 path->reada = READA_FORWARD; in scrub_enumerate_chunks()
A Dsend.c6658 path->reada = READA_FORWARD_ALWAYS; in full_send_tree()
/linux/fs/reiserfs/
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()
1961 s_search_path.reada = PATH_READA | PATH_READA_BACK; in reiserfs_do_truncate()
A Ddir.c90 path_to_entry.reada = PATH_READA; in reiserfs_readdir_inode()
A Dreiserfs.h2133 int reada; member
2142 struct treepath var = {.path_length = ILLEGAL_PATH_ELEMENT_OFFSET, .reada = 0,}

Completed in 885 milliseconds