Lines Matching refs:time_seq
421 int level, u64 time_seq, const u64 *extent_item_pos,
459 if (time_seq == SEQ_LAST)
462 ret = btrfs_next_old_leaf(root, path, time_seq);
483 if (time_seq == SEQ_LAST)
486 ret = btrfs_next_old_leaf(root, path, time_seq);
524 if (time_seq == SEQ_LAST)
527 ret = btrfs_next_old_item(root, path, time_seq);
542 struct btrfs_path *path, u64 time_seq,
584 else if (time_seq == SEQ_LAST)
587 root_level = btrfs_old_root_level(root, time_seq);
615 if (time_seq == SEQ_LAST)
618 ret = btrfs_search_old_slot(root, &search_key, path, time_seq);
639 time_seq, extent_item_pos, ignore_offset);
685 struct btrfs_path *path, u64 time_seq,
731 err = resolve_indirect_ref(fs_info, path, time_seq, preftrees,
1186 * If time_seq is set to SEQ_LAST, it will not search delayed_refs, and behave
1204 u64 time_seq, struct ulist *refs,
1238 if (time_seq == SEQ_LAST)
1261 time_seq != SEQ_LAST) {
1263 if (trans && time_seq != SEQ_LAST) {
1289 ret = add_delayed_refs(fs_info, head, time_seq,
1329 ret = resolve_indirect_refs(fs_info, path, time_seq, &preftrees,
1462 u64 time_seq, struct ulist **leafs,
1471 ret = find_parent_nodes(trans, fs_info, bytenr, time_seq,
1496 u64 time_seq, struct ulist **roots,
1515 ret = find_parent_nodes(trans, fs_info, bytenr, time_seq,
1536 u64 time_seq, struct ulist **roots,
1544 time_seq, roots, ignore_offset);