10 	ql_elm(list_t) link;
21 	assert_ptr_null(ql_last(head, link),  in test_empty_list()
25 	ql_foreach(t, head, link) {  in test_empty_list()
31 	ql_reverse_foreach(t, head, link) {  in test_empty_list()
53 		ql_elm_new(&entries[i], link);  in init_entries()
64 	assert_c_eq(ql_last(head, link)->id, entries[nentries-1].id,  in test_entries_list()
68 	ql_foreach(t, head, link) {  in test_entries_list()
74 	ql_reverse_foreach(t, head, link) {  in test_entries_list()
81 		t = ql_next(head, &entries[i], link);  in test_entries_list()
84 	assert_ptr_null(ql_next(head, &entries[nentries-1], link),  in test_entries_list()
87 	assert_ptr_null(ql_prev(head, &entries[0], link), "Unexpected element");  in test_entries_list()
89 		t = ql_prev(head, &entries[i], link);  in test_entries_list()
103 		ql_tail_insert(&head, &entries[i], link);  in TEST_BEGIN()
118 		ql_tail_insert(&head, &entries[i], link);  in TEST_BEGIN()
122 		ql_tail_remove(&head, list_t, link);  in TEST_BEGIN()
137 		ql_head_insert(&head, &entries[NENTRIES-i-1], link);  in TEST_BEGIN()
152 		ql_head_insert(&head, &entries[NENTRIES-i-1], link);  in TEST_BEGIN()
156 		ql_head_remove(&head, list_t, link);  in TEST_BEGIN()
185 	ql_tail_insert(&head, f, link);  in TEST_BEGIN()
186 	ql_before_insert(&head, f, b, link);  in TEST_BEGIN()
187 	ql_before_insert(&head, f, c, link);  in TEST_BEGIN()
188 	ql_after_insert(f, h, link);  in TEST_BEGIN()
189 	ql_after_insert(f, g, link);  in TEST_BEGIN()
190 	ql_before_insert(&head, b, a, link);  in TEST_BEGIN()
191 	ql_after_insert(c, d, link);  in TEST_BEGIN()
192 	ql_before_insert(&head, f, e, link);  in TEST_BEGIN()