Lines Matching refs:llist

26 static struct Curl_llist llist;  variable
39   Curl_llist_init(&llist, test_Curl_llist_dtor);  in unit_setup()
61   size_t llist_size = Curl_llist_count(&llist);
74   fail_unless(llist.size == 0, "list initial size should be zero");
75   fail_unless(llist.head == NULL, "list head should initiate to NULL");
76   fail_unless(llist.tail == NULL, "list tail should intiate to NULL");
77   fail_unless(llist.dtor == test_Curl_llist_dtor,
90   Curl_llist_insert_next(&llist, llist.head, &unusedData_case1, &case1_list);
92   fail_unless(Curl_llist_count(&llist) == 1,
95   fail_unless(llist.head->ptr == &unusedData_case1,
98   fail_unless(llist.tail == llist.head,
110   Curl_llist_insert_next(&llist, llist.head,
112   fail_unless(llist.head->next->ptr == &unusedData_case3,
114   fail_unless(llist.tail->ptr == &unusedData_case3,
126   Curl_llist_insert_next(&llist, llist.head,
128   fail_unless(llist.head->next->ptr == &unusedData_case2,
131   fail_unless(llist.tail->ptr != &unusedData_case2,
145   head = llist.head;
148   llist_size = Curl_llist_count(&llist);
150   Curl_llist_remove(&llist, llist.head, NULL);
152   fail_unless(Curl_llist_count(&llist) ==  (llist_size-1),
154   fail_unless(llist.head == element_next,
156   abort_unless(llist.head, "llist.head is NULL");
157   fail_unless(llist.head->prev == NULL,
170   Curl_llist_insert_next(&llist, llist.head, &unusedData_case3,
172   llist_size = Curl_llist_count(&llist);
175   to_remove = llist.head->next;
179   Curl_llist_remove(&llist, to_remove, NULL);
196   to_remove = llist.tail;
198   Curl_llist_remove(&llist, to_remove, NULL);
199   fail_unless(llist.tail == element_prev,
211   to_remove = llist.head;
212   Curl_llist_remove(&llist, to_remove, NULL);
213   fail_unless(llist.head == NULL,
215   fail_unless(llist.tail == NULL,
218   Curl_llist_destroy(&llist, NULL);