418 			   int level, u64 time_seq, const u64 *extent_item_pos,  in add_all_parents()  argument
455 		if (time_seq == SEQ_LAST)  in add_all_parents()
458 			ret = btrfs_next_old_leaf(root, path, time_seq);  in add_all_parents()
479 			if (time_seq == SEQ_LAST)  in add_all_parents()
482 				ret = btrfs_next_old_leaf(root, path, time_seq);  in add_all_parents()
517 		if (time_seq == SEQ_LAST)  in add_all_parents()
520 			ret = btrfs_next_old_item(root, path, time_seq);  in add_all_parents()
535 				struct btrfs_path *path, u64 time_seq,  in resolve_indirect_ref()  argument
577 	else if (time_seq == SEQ_LAST)  in resolve_indirect_ref()
580 		root_level = btrfs_old_root_level(root, time_seq);  in resolve_indirect_ref()
608 	if (time_seq == SEQ_LAST)  in resolve_indirect_ref()
611 		ret = btrfs_search_old_slot(root, &search_key, path, time_seq);  in resolve_indirect_ref()
632 			      time_seq, extent_item_pos, ignore_offset);  in resolve_indirect_ref()
666 				 struct btrfs_path *path, u64 time_seq,  in resolve_indirect_refs()  argument
712 		err = resolve_indirect_ref(fs_info, path, time_seq, preftrees,  in resolve_indirect_refs()
1168 			     u64 time_seq, struct ulist *refs,  argument
1202 	if (time_seq == SEQ_LAST)
1220 	    time_seq != SEQ_LAST) {
1222 	if (trans && time_seq != SEQ_LAST) {
1248 			ret = add_delayed_refs(fs_info, head, time_seq,
1288 	ret = resolve_indirect_refs(fs_info, path, time_seq, &preftrees,
1417 			 u64 time_seq, struct ulist **leafs,  argument
1426 	ret = find_parent_nodes(trans, fs_info, bytenr, time_seq,
1451 				     u64 time_seq, struct ulist **roots,  argument
1470 		ret = find_parent_nodes(trans, fs_info, bytenr, time_seq,
1491 			 u64 time_seq, struct ulist **roots,  argument
1499 					time_seq, roots, ignore_offset);