249 			   int level, u64 time_seq, const u64 *extent_item_pos,  in add_all_parents()  argument
277 		if (time_seq == (u64)-1)  in add_all_parents()
280 			ret = btrfs_next_old_leaf(root, path, time_seq);  in add_all_parents()
321 		if (time_seq == (u64)-1)  in add_all_parents()
324 			ret = btrfs_next_old_item(root, path, time_seq);  in add_all_parents()
339 				  struct btrfs_path *path, u64 time_seq,  in __resolve_indirect_ref()  argument
373 	else if (time_seq == (u64)-1)  in __resolve_indirect_ref()
376 		root_level = btrfs_old_root_level(root, time_seq);  in __resolve_indirect_ref()
384 	if (time_seq == (u64)-1)  in __resolve_indirect_ref()
389 					    time_seq);  in __resolve_indirect_ref()
412 	ret = add_all_parents(root, path, parents, ref, level, time_seq,  in __resolve_indirect_ref()
424 				   struct btrfs_path *path, u64 time_seq,  in __resolve_indirect_refs()  argument
456 		err = __resolve_indirect_ref(fs_info, path, time_seq, ref,  in __resolve_indirect_refs()
930 			     u64 time_seq, struct ulist *refs,  argument
964 	if (time_seq == (u64)-1)
982 	    time_seq != (u64)-1) {
984 	if (trans && time_seq != (u64)-1) {
1010 			ret = __add_delayed_refs(head, time_seq,
1053 	ret = __resolve_indirect_refs(fs_info, path, time_seq, &prefs,
1167 				u64 time_seq, struct ulist **leafs,  argument
1177 				time_seq, *leafs, NULL, extent_item_pos, 0, 0);
1201 				  u64 time_seq, struct ulist **roots)  argument
1220 					time_seq, tmp, *roots, NULL, 0, 0);
1239 			 u64 time_seq, struct ulist **roots)  argument
1245 	ret = __btrfs_find_all_roots(trans, fs_info, bytenr, time_seq, roots);