226 			   int level, u64 time_seq, const u64 *extent_item_pos,  in add_all_parents()  argument
254 		ret = btrfs_next_old_leaf(root, path, time_seq);  in add_all_parents()
294 		ret = btrfs_next_old_item(root, path, time_seq);  in add_all_parents()
309 				  struct btrfs_path *path, u64 time_seq,  in __resolve_indirect_ref()  argument
338 		root_level = btrfs_old_root_level(root, time_seq);  in __resolve_indirect_ref()
346 	ret = btrfs_search_old_slot(root, &ref->key_for_search, path, time_seq);  in __resolve_indirect_ref()
369 	ret = add_all_parents(root, path, parents, ref, level, time_seq,  in __resolve_indirect_ref()
381 				   struct btrfs_path *path, u64 time_seq,  in __resolve_indirect_refs()  argument
413 		err = __resolve_indirect_ref(fs_info, path, time_seq, ref,  in __resolve_indirect_refs()
889 			     u64 time_seq, struct ulist *refs,  argument
965 			ret = __add_delayed_refs(head, time_seq,
1008 	ret = __resolve_indirect_refs(fs_info, path, time_seq, &prefs,
1119 				u64 time_seq, struct ulist **leafs,  argument
1129 				time_seq, *leafs, NULL, extent_item_pos, 0, 0);
1153 				  u64 time_seq, struct ulist **roots)  argument
1172 					time_seq, tmp, *roots, NULL, 0, 0);
1191 			 u64 time_seq, struct ulist **roots)  argument
1197 	ret = __btrfs_find_all_roots(trans, fs_info, bytenr, time_seq, roots);