Lines Matching refs:ulist
12 #include "ulist.h"
419 struct ulist *parents,
544 struct prelim_ref *ref, struct ulist *parents,
656 static void free_leaf_list(struct ulist *ulist)
662 while ((node = ulist_next(ulist, &uiter)))
665 ulist_free(ulist);
692 struct ulist *parents;
783 * We may have inode lists attached to refs in the parents ulist, so we
784 * must free them before freeing the ulist and its refs.
1204 u64 time_seq, struct ulist *refs,
1205 struct ulist *roots, const u64 *extent_item_pos,
1338 * read in as needed. Unique entries are added to the ulist, and
1430 * this ref to the ref we added to the 'refs' ulist.
1455 * free each list element). The leafs will be stored in the leafs ulist, which
1462 u64 time_seq, struct ulist **leafs,
1496 u64 time_seq, struct ulist **roots,
1499 struct ulist *tmp;
1536 u64 time_seq, struct ulist **roots,
1565 struct ulist *roots, struct ulist *tmp)
2000 struct ulist *refs = NULL;
2001 struct ulist *roots = NULL;