18 	unsigned i;  in test_empty_list()  local
24 	i = 0;  in test_empty_list()
26 		i++;  in test_empty_list()
28 	assert_u_eq(i, 0, "Unexpected element for empty list");  in test_empty_list()
30 	i = 0;  in test_empty_list()
32 		i++;  in test_empty_list()
34 	assert_u_eq(i, 0, "Unexpected element for empty list");  in test_empty_list()
49 	unsigned i;  in init_entries()  local
51 	for (i = 0; i < nentries; i++) {  in init_entries()
52 		entries[i].id = 'a' + i;  in init_entries()
53 		ql_elm_new(&entries[i], link);  in init_entries()
61 	unsigned i;  in test_entries_list()  local
67 	i = 0;  in test_entries_list()
69 		assert_c_eq(t->id, entries[i].id, "Element id mismatch");  in test_entries_list()
70 		i++;  in test_entries_list()
73 	i = 0;  in test_entries_list()
75 		assert_c_eq(t->id, entries[nentries-i-1].id,  in test_entries_list()
77 		i++;  in test_entries_list()
80 	for (i = 0; i < nentries-1; i++) {  in test_entries_list()
81 		t = ql_next(head, &entries[i], link);  in test_entries_list()
82 		assert_c_eq(t->id, entries[i+1].id, "Element id mismatch");  in test_entries_list()
88 	for (i = 1; i < nentries; i++) {  in test_entries_list()
89 		t = ql_prev(head, &entries[i], link);  in test_entries_list()
90 		assert_c_eq(t->id, entries[i-1].id, "Element id mismatch");  in test_entries_list()
98 	unsigned i;  in TEST_BEGIN()  local
102 	for (i = 0; i < NENTRIES; i++)  in TEST_BEGIN()
103 		ql_tail_insert(&head, &entries[i], link);  in TEST_BEGIN()
113 	unsigned i;  in TEST_BEGIN()  local
117 	for (i = 0; i < NENTRIES; i++)  in TEST_BEGIN()
118 		ql_tail_insert(&head, &entries[i], link);  in TEST_BEGIN()
120 	for (i = 0; i < NENTRIES; i++) {  in TEST_BEGIN()
121 		test_entries_list(&head, entries, NENTRIES-i);  in TEST_BEGIN()
132 	unsigned i;  in TEST_BEGIN()  local
136 	for (i = 0; i < NENTRIES; i++)  in TEST_BEGIN()
137 		ql_head_insert(&head, &entries[NENTRIES-i-1], link);  in TEST_BEGIN()
147 	unsigned i;  in TEST_BEGIN()  local
151 	for (i = 0; i < NENTRIES; i++)  in TEST_BEGIN()
152 		ql_head_insert(&head, &entries[NENTRIES-i-1], link);  in TEST_BEGIN()
154 	for (i = 0; i < NENTRIES; i++) {  in TEST_BEGIN()
155 		test_entries_list(&head, &entries[i], NENTRIES-i);  in TEST_BEGIN()