Lines Matching refs:time_seq

422 			   int level, u64 time_seq, const u64 *extent_item_pos,  in add_all_parents()  argument
460 if (time_seq == BTRFS_SEQ_LAST) in add_all_parents()
463 ret = btrfs_next_old_leaf(root, path, time_seq); in add_all_parents()
484 if (time_seq == BTRFS_SEQ_LAST) in add_all_parents()
487 ret = btrfs_next_old_leaf(root, path, time_seq); in add_all_parents()
525 if (time_seq == BTRFS_SEQ_LAST) in add_all_parents()
528 ret = btrfs_next_old_item(root, path, time_seq); in add_all_parents()
543 struct btrfs_path *path, u64 time_seq, in resolve_indirect_ref() argument
585 else if (time_seq == BTRFS_SEQ_LAST) in resolve_indirect_ref()
588 root_level = btrfs_old_root_level(root, time_seq); in resolve_indirect_ref()
616 if (time_seq == BTRFS_SEQ_LAST) in resolve_indirect_ref()
619 ret = btrfs_search_old_slot(root, &search_key, path, time_seq); in resolve_indirect_ref()
640 time_seq, extent_item_pos, ignore_offset); in resolve_indirect_ref()
686 struct btrfs_path *path, u64 time_seq, in resolve_indirect_refs() argument
732 err = resolve_indirect_ref(fs_info, path, time_seq, preftrees, in resolve_indirect_refs()
1207 u64 time_seq, struct ulist *refs, in find_parent_nodes() argument
1242 if (time_seq == BTRFS_SEQ_LAST) in find_parent_nodes()
1259 time_seq != BTRFS_SEQ_LAST) { in find_parent_nodes()
1286 ret = add_delayed_refs(fs_info, head, time_seq, in find_parent_nodes()
1326 ret = resolve_indirect_refs(fs_info, path, time_seq, &preftrees, in find_parent_nodes()
1458 u64 time_seq, struct ulist **leafs, in btrfs_find_all_leafs() argument
1467 ret = find_parent_nodes(trans, fs_info, bytenr, time_seq, in btrfs_find_all_leafs()
1492 u64 time_seq, struct ulist **roots, in btrfs_find_all_roots_safe() argument
1511 ret = find_parent_nodes(trans, fs_info, bytenr, time_seq, in btrfs_find_all_roots_safe()
1532 u64 time_seq, struct ulist **roots, in btrfs_find_all_roots() argument
1540 time_seq, roots, false); in btrfs_find_all_roots()