421 			   int level, u64 time_seq, const u64 *extent_item_pos,  in add_all_parents()  argument
458 		if (time_seq == SEQ_LAST)  in add_all_parents()
461 			ret = btrfs_next_old_leaf(root, path, time_seq);  in add_all_parents()
482 			if (time_seq == SEQ_LAST)  in add_all_parents()
485 				ret = btrfs_next_old_leaf(root, path, time_seq);  in add_all_parents()
520 		if (time_seq == SEQ_LAST)  in add_all_parents()
523 			ret = btrfs_next_old_item(root, path, time_seq);  in add_all_parents()
538 				struct btrfs_path *path, u64 time_seq,  in resolve_indirect_ref()  argument
580 	else if (time_seq == SEQ_LAST)  in resolve_indirect_ref()
583 		root_level = btrfs_old_root_level(root, time_seq);  in resolve_indirect_ref()
611 	if (time_seq == SEQ_LAST)  in resolve_indirect_ref()
614 		ret = btrfs_search_old_slot(root, &search_key, path, time_seq);  in resolve_indirect_ref()
635 			      time_seq, extent_item_pos, ignore_offset);  in resolve_indirect_ref()
681 				 struct btrfs_path *path, u64 time_seq,  in resolve_indirect_refs()  argument
727 		err = resolve_indirect_ref(fs_info, path, time_seq, preftrees,  in resolve_indirect_refs()
1200 			     u64 time_seq, struct ulist *refs,  argument
1234 	if (time_seq == SEQ_LAST)
1257 	    time_seq != SEQ_LAST) {
1259 	if (trans && time_seq != SEQ_LAST) {
1285 			ret = add_delayed_refs(fs_info, head, time_seq,
1325 	ret = resolve_indirect_refs(fs_info, path, time_seq, &preftrees,
1458 			 u64 time_seq, struct ulist **leafs,  argument
1467 	ret = find_parent_nodes(trans, fs_info, bytenr, time_seq,
1492 				     u64 time_seq, struct ulist **roots,  argument
1511 		ret = find_parent_nodes(trans, fs_info, bytenr, time_seq,
1532 			 u64 time_seq, struct ulist **roots,  argument
1540 					time_seq, roots, ignore_offset);