Lines Matching refs:list
25 objlist_t *list = kmem_alloc(sizeof (*list), KM_SLEEP); in objlist_create() local
26 list_create(&list->ol_list, sizeof (objlist_node_t), in objlist_create()
28 list->ol_last_lookup = 0; in objlist_create()
29 return (list); in objlist_create()
33 objlist_destroy(objlist_t *list) in objlist_destroy() argument
35 for (objlist_node_t *n = list_remove_head(&list->ol_list); in objlist_destroy()
36 n != NULL; n = list_remove_head(&list->ol_list)) { in objlist_destroy()
39 list_destroy(&list->ol_list); in objlist_destroy()
40 kmem_free(list, sizeof (*list)); in objlist_destroy()
52 objlist_exists(objlist_t *list, uint64_t object) in objlist_exists() argument
54 objlist_node_t *node = list_head(&list->ol_list); in objlist_exists()
55 ASSERT3U(object, >=, list->ol_last_lookup); in objlist_exists()
56 list->ol_last_lookup = object; in objlist_exists()
58 VERIFY3P(node, ==, list_remove_head(&list->ol_list)); in objlist_exists()
60 node = list_head(&list->ol_list); in objlist_exists()
73 objlist_insert(objlist_t *list, uint64_t object) in objlist_insert() argument
78 objlist_node_t *last_object = list_tail(&list->ol_list); in objlist_insert()
83 list_insert_tail(&list->ol_list, node); in objlist_insert()