19 	unsigned i;  in init_entries()  local
21 	for (i = 0; i < NENTRIES; i++) {  in init_entries()
22 		qr_new(&entries[i], link);  in init_entries()
23 		entries[i].id = 'a' + i;  in init_entries()
30 	unsigned i, j;  in test_independent_entries()  local
32 	for (i = 0; i < NENTRIES; i++) {  in test_independent_entries()
34 		qr_foreach(t, &entries[i], link) {  in test_independent_entries()
41 	for (i = 0; i < NENTRIES; i++) {  in test_independent_entries()
43 		qr_reverse_foreach(t, &entries[i], link) {  in test_independent_entries()
50 	for (i = 0; i < NENTRIES; i++) {  in test_independent_entries()
51 		t = qr_next(&entries[i], link);  in test_independent_entries()
52 		assert_ptr_eq(t, &entries[i],  in test_independent_entries()
56 	for (i = 0; i < NENTRIES; i++) {  in test_independent_entries()
57 		t = qr_prev(&entries[i], link);  in test_independent_entries()
58 		assert_ptr_eq(t, &entries[i],  in test_independent_entries()
75 	unsigned i, j;  in test_entries_ring()  local
77 	for (i = 0; i < NENTRIES; i++) {  in test_entries_ring()
79 		qr_foreach(t, &entries[i], link) {  in test_entries_ring()
80 			assert_c_eq(t->id, entries[(i+j) % NENTRIES].id,  in test_entries_ring()
85 	for (i = 0; i < NENTRIES; i++) {  in test_entries_ring()
87 		qr_reverse_foreach(t, &entries[i], link) {  in test_entries_ring()
88 			assert_c_eq(t->id, entries[(NENTRIES+i-j-1) %  in test_entries_ring()
93 	for (i = 0; i < NENTRIES; i++) {  in test_entries_ring()
94 		t = qr_next(&entries[i], link);  in test_entries_ring()
95 		assert_c_eq(t->id, entries[(i+1) % NENTRIES].id,  in test_entries_ring()
98 	for (i = 0; i < NENTRIES; i++) {  in test_entries_ring()
99 		t = qr_prev(&entries[i], link);  in test_entries_ring()
100 		assert_c_eq(t->id, entries[(NENTRIES+i-1) % NENTRIES].id,  in test_entries_ring()
107 	unsigned i;  in TEST_BEGIN()  local
110 	for (i = 1; i < NENTRIES; i++) {  in TEST_BEGIN()
111 		qr_after_insert(&entries[i - 1], &entries[i], link);  in TEST_BEGIN()
120 	unsigned i, j;  in TEST_BEGIN()  local
123 	for (i = 1; i < NENTRIES; i++) {  in TEST_BEGIN()
124 		qr_after_insert(&entries[i - 1], &entries[i], link);  in TEST_BEGIN()
127 	for (i = 0; i < NENTRIES; i++) {  in TEST_BEGIN()
129 		qr_foreach(t, &entries[i], link) {  in TEST_BEGIN()
130 			assert_c_eq(t->id, entries[i+j].id,  in TEST_BEGIN()
135 		qr_reverse_foreach(t, &entries[i], link) {  in TEST_BEGIN()
140 		qr_remove(&entries[i], link);  in TEST_BEGIN()
149 	unsigned i, j;  in TEST_BEGIN()  local
152 	for (i = 1; i < NENTRIES; i++) {  in TEST_BEGIN()
153 		qr_before_insert(&entries[i - 1], &entries[i], link);  in TEST_BEGIN()
155 	for (i = 0; i < NENTRIES; i++) {  in TEST_BEGIN()
157 		qr_foreach(t, &entries[i], link) {  in TEST_BEGIN()
158 			assert_c_eq(t->id, entries[(NENTRIES+i-j) %  in TEST_BEGIN()
163 	for (i = 0; i < NENTRIES; i++) {  in TEST_BEGIN()
165 		qr_reverse_foreach(t, &entries[i], link) {  in TEST_BEGIN()
166 			assert_c_eq(t->id, entries[(i+j+1) % NENTRIES].id,  in TEST_BEGIN()
171 	for (i = 0; i < NENTRIES; i++) {  in TEST_BEGIN()
172 		t = qr_next(&entries[i], link);  in TEST_BEGIN()
173 		assert_c_eq(t->id, entries[(NENTRIES+i-1) % NENTRIES].id,  in TEST_BEGIN()
176 	for (i = 0; i < NENTRIES; i++) {  in TEST_BEGIN()
177 		t = qr_prev(&entries[i], link);  in TEST_BEGIN()
178 		assert_c_eq(t->id, entries[(i+1) % NENTRIES].id,  in TEST_BEGIN()
187 	unsigned i, j;  in test_split_entries()  local
189 	for (i = 0; i < NENTRIES; i++) {  in test_split_entries()
191 		qr_foreach(t, &entries[i], link) {  in test_split_entries()
192 			if (i < SPLIT_INDEX) {  in test_split_entries()
194 				    entries[(i+j) % SPLIT_INDEX].id,  in test_split_entries()
197 				assert_c_eq(t->id, entries[(i+j-SPLIT_INDEX) %  in test_split_entries()
208 	unsigned i;  in TEST_BEGIN()  local
211 	for (i = 1; i < NENTRIES; i++) {  in TEST_BEGIN()
212 		qr_after_insert(&entries[i - 1], &entries[i], link);  in TEST_BEGIN()