Lines Matching defs:list
25 objlist_t *list = kmem_alloc(sizeof (*list), KM_SLEEP);
26 list_create(&list->ol_list, sizeof (objlist_node_t),
28 list->ol_last_lookup = 0;
29 return (list);
33 objlist_destroy(objlist_t *list)
35 for (objlist_node_t *n = list_remove_head(&list->ol_list);
36 n != NULL; n = list_remove_head(&list->ol_list)) {
39 list_destroy(&list->ol_list);
40 kmem_free(list, sizeof (*list));
46 * numbers in the list that are smaller than the specified object number. Thus,
52 objlist_exists(objlist_t *list, uint64_t object)
54 objlist_node_t *node = list_head(&list->ol_list);
55 ASSERT3U(object, >=, list->ol_last_lookup);
56 list->ol_last_lookup = object;
58 VERIFY3P(node, ==, list_remove_head(&list->ol_list));
60 node = list_head(&list->ol_list);
66 * The objlist is a list of object numbers stored in ascending order. However,
68 * store a new object number; instead, it appends it to the list for simplicity.
73 objlist_insert(objlist_t *list, uint64_t object)
78 objlist_node_t *last_object = list_tail(&list->ol_list);
83 list_insert_tail(&list->ol_list, node);