Lines Matching refs:llist
28 static struct Curl_llist llist; variable
41 Curl_llist_init(&llist, test_Curl_llist_dtor); in unit_setup()
63 size_t llist_size = Curl_llist_count(&llist);
76 fail_unless(Curl_llist_count(&llist) == 0,
78 fail_unless(Curl_llist_head(&llist) == NULL,
80 fail_unless(Curl_llist_tail(&llist) == NULL,
93 Curl_llist_insert_next(&llist, Curl_llist_head(&llist), &unusedData_case1,
96 fail_unless(Curl_llist_count(&llist) == 1,
99 fail_unless(Curl_node_elem(Curl_llist_head(&llist)) == &unusedData_case1,
102 fail_unless(Curl_llist_tail(&llist) == Curl_llist_head(&llist),
114 Curl_llist_insert_next(&llist, Curl_llist_head(&llist),
116 fail_unless(Curl_node_elem(Curl_node_next(Curl_llist_head(&llist))) ==
119 fail_unless(Curl_node_elem(Curl_llist_tail(&llist)) == &unusedData_case3,
131 Curl_llist_insert_next(&llist, Curl_llist_head(&llist),
133 fail_unless(Curl_node_elem(Curl_node_next(Curl_llist_head(&llist))) ==
137 fail_unless(Curl_node_elem(Curl_llist_tail(&llist)) != &unusedData_case2,
151 head = Curl_llist_head(&llist);
154 llist_size = Curl_llist_count(&llist);
156 Curl_node_remove(Curl_llist_head(&llist));
158 fail_unless(Curl_llist_count(&llist) == (llist_size-1),
160 fail_unless(Curl_llist_head(&llist) == element_next,
162 abort_unless(Curl_llist_head(&llist), "llist.head is NULL");
163 fail_unless(Curl_node_prev(Curl_llist_head(&llist)) == NULL,
176 Curl_llist_insert_next(&llist, Curl_llist_head(&llist), &unusedData_case3,
178 llist_size = Curl_llist_count(&llist);
181 to_remove = Curl_node_next(Curl_llist_head(&llist));
202 to_remove = Curl_llist_tail(&llist);
205 fail_unless(Curl_llist_tail(&llist) == element_prev,
217 to_remove = Curl_llist_head(&llist);
219 fail_unless(Curl_llist_head(&llist) == NULL,
221 fail_unless(Curl_llist_tail(&llist) == NULL,
232 Curl_llist_append(&llist, &unusedData_case1, &case1_list);
233 fail_unless(Curl_llist_count(&llist) == 1,
236 fail_unless(Curl_node_elem(Curl_llist_head(&llist)) == &unusedData_case1,
239 fail_unless(Curl_llist_tail(&llist) == Curl_llist_head(&llist),
250 Curl_llist_append(&llist, &unusedData_case2, &case2_list);
251 fail_unless(Curl_node_elem(Curl_node_next(Curl_llist_head(&llist))) ==
254 fail_unless(Curl_node_elem(Curl_llist_tail(&llist)) == &unusedData_case2,
265 Curl_llist_append(&llist, &unusedData_case3, &case3_list);
266 fail_unless(Curl_node_elem(Curl_node_next(Curl_llist_head(&llist))) ==
269 fail_unless(Curl_node_elem(Curl_llist_tail(&llist)) == &unusedData_case3,
272 Curl_llist_destroy(&llist, NULL);