419 			   int level, u64 time_seq, const u64 *extent_item_pos,  in add_all_parents()  argument
456 		if (time_seq == BTRFS_SEQ_LAST)  in add_all_parents()
459 			ret = btrfs_next_old_leaf(root, path, time_seq);  in add_all_parents()
480 			if (time_seq == BTRFS_SEQ_LAST)  in add_all_parents()
483 				ret = btrfs_next_old_leaf(root, path, time_seq);  in add_all_parents()
518 		if (time_seq == BTRFS_SEQ_LAST)  in add_all_parents()
521 			ret = btrfs_next_old_item(root, path, time_seq);  in add_all_parents()
536 				struct btrfs_path *path, u64 time_seq,  in resolve_indirect_ref()  argument
578 	else if (time_seq == BTRFS_SEQ_LAST)  in resolve_indirect_ref()
581 		root_level = btrfs_old_root_level(root, time_seq);  in resolve_indirect_ref()
609 	if (time_seq == BTRFS_SEQ_LAST)  in resolve_indirect_ref()
612 		ret = btrfs_search_old_slot(root, &search_key, path, time_seq);  in resolve_indirect_ref()
633 			      time_seq, extent_item_pos, ignore_offset);  in resolve_indirect_ref()
667 				 struct btrfs_path *path, u64 time_seq,  in resolve_indirect_refs()  argument
713 		err = resolve_indirect_ref(fs_info, path, time_seq, preftrees,  in resolve_indirect_refs()
1169 			     u64 time_seq, struct ulist *refs,  argument
1203 	if (time_seq == BTRFS_SEQ_LAST)
1221 	    time_seq != BTRFS_SEQ_LAST) {
1223 	if (trans && time_seq != BTRFS_SEQ_LAST) {
1249 			ret = add_delayed_refs(fs_info, head, time_seq,
1289 	ret = resolve_indirect_refs(fs_info, path, time_seq, &preftrees,
1416 			 u64 time_seq, struct ulist **leafs,  argument
1425 	ret = find_parent_nodes(trans, fs_info, bytenr, time_seq,
1450 				     u64 time_seq, struct ulist **roots,  argument
1469 		ret = find_parent_nodes(trans, fs_info, bytenr, time_seq,
1490 			 u64 time_seq, struct ulist **roots,  argument
1498 					time_seq, roots, false);