414 			   int level, u64 time_seq, const u64 *extent_item_pos,  in add_all_parents()  argument
442 		if (time_seq == SEQ_LAST)  in add_all_parents()
445 			ret = btrfs_next_old_leaf(root, path, time_seq);  in add_all_parents()
486 		if (time_seq == SEQ_LAST)  in add_all_parents()
489 			ret = btrfs_next_old_item(root, path, time_seq);  in add_all_parents()
504 				struct btrfs_path *path, u64 time_seq,  in resolve_indirect_ref()  argument
538 	else if (time_seq == SEQ_LAST)  in resolve_indirect_ref()
541 		root_level = btrfs_old_root_level(root, time_seq);  in resolve_indirect_ref()
549 	if (time_seq == SEQ_LAST)  in resolve_indirect_ref()
554 					    time_seq);  in resolve_indirect_ref()
577 	ret = add_all_parents(root, path, parents, ref, level, time_seq,  in resolve_indirect_ref()
610 				 struct btrfs_path *path, u64 time_seq,  in resolve_indirect_refs()  argument
656 		err = resolve_indirect_ref(fs_info, path, time_seq, ref,  in resolve_indirect_refs()
1115 			     u64 time_seq, struct ulist *refs,  argument
1151 	if (time_seq == SEQ_LAST)
1169 	    time_seq != SEQ_LAST) {
1171 	if (trans && time_seq != SEQ_LAST) {
1197 			ret = add_delayed_refs(fs_info, head, time_seq,
1238 	ret = resolve_indirect_refs(fs_info, path, time_seq, &preftrees,
1367 				u64 time_seq, struct ulist **leafs,  argument
1376 	ret = find_parent_nodes(trans, fs_info, bytenr, time_seq,
1401 				     u64 time_seq, struct ulist **roots,  argument
1420 		ret = find_parent_nodes(trans, fs_info, bytenr, time_seq,
1440 			 u64 time_seq, struct ulist **roots,  argument
1448 					time_seq, roots, ignore_offset);