1112 			     struct ulist *roots, const u64 *extent_item_pos,  argument
1262 		if (roots && ref->count && ref->root_id && ref->parent == 0) {
1270 			ret = ulist_add(roots, ref->root_id, 0, GFP_NOFS);
1393 				     u64 time_seq, struct ulist **roots,  argument
1404 	*roots = ulist_alloc(GFP_NOFS);
1405 	if (!*roots) {
1413 					tmp, *roots, NULL, NULL, ignore_offset);
1416 			ulist_free(*roots);
1432 			 u64 time_seq, struct ulist **roots,  argument
1440 					time_seq, roots, ignore_offset);
1465 	struct ulist *roots = NULL;  local
1477 	roots = ulist_alloc(GFP_NOFS);
1478 	if (!tmp || !roots) {
1480 		ulist_free(roots);
1495 					roots, NULL, &shared, false);
1519 	ulist_free(roots);
1896 	struct ulist *roots = NULL;  local
1924 						tree_mod_seq_elem.seq, &roots,
1929 		while (!ret && (root_node = ulist_next(roots, &root_uiter))) {
1941 		ulist_free(roots);