890 			     struct ulist *roots, const u64 *extent_item_pos,  argument
1019 		if (roots && ref->count && ref->root_id && ref->parent == 0) {
1026 			ret = ulist_add(roots, ref->root_id, 0, GFP_NOFS);
1153 				  u64 time_seq, struct ulist **roots)  argument
1163 	*roots = ulist_alloc(GFP_NOFS);
1164 	if (!*roots) {
1172 					time_seq, tmp, *roots, NULL, 0, 0);
1175 			ulist_free(*roots);
1191 			 u64 time_seq, struct ulist **roots)  argument
1197 	ret = __btrfs_find_all_roots(trans, fs_info, bytenr, time_seq, roots);
1221 	struct ulist *roots = NULL;  local
1228 	roots = ulist_alloc(GFP_NOFS);
1229 	if (!tmp || !roots) {
1231 		ulist_free(roots);
1242 					roots, NULL, root_objectid, inum);
1262 	ulist_free(roots);
1629 	struct ulist *roots = NULL;  local
1657 					     tree_mod_seq_elem.seq, &roots);
1661 		while (!ret && (root_node = ulist_next(roots, &root_uiter))) {
1671 		ulist_free(roots);