Lines Matching refs:entries
5 /* Number of ring entries, in [2..26]. */
48 init_entries(list_t *entries, unsigned nentries) {
52 entries[i].id = 'a' + i;
53 ql_elm_new(&entries[i], link);
58 test_entries_list(list_head_t *head, list_t *entries, unsigned nentries) {
63 expect_c_eq(ql_first(head)->id, entries[0].id, "Element id mismatch");
64 expect_c_eq(ql_last(head, link)->id, entries[nentries-1].id,
69 expect_c_eq(t->id, entries[i].id, "Element id mismatch");
75 expect_c_eq(t->id, entries[nentries-i-1].id,
81 t = ql_next(head, &entries[i], link);
82 expect_c_eq(t->id, entries[i+1].id, "Element id mismatch");
84 expect_ptr_null(ql_next(head, &entries[nentries-1], link),
87 expect_ptr_null(ql_prev(head, &entries[0], link), "Unexpected element");
89 t = ql_prev(head, &entries[i], link);
90 expect_c_eq(t->id, entries[i-1].id, "Element id mismatch");
96 list_t entries[NENTRIES];
100 init_entries(entries, sizeof(entries)/sizeof(list_t));
102 ql_tail_insert(&head, &entries[i], link);
105 test_entries_list(&head, entries, NENTRIES);
111 list_t entries[NENTRIES];
115 init_entries(entries, sizeof(entries)/sizeof(list_t));
117 ql_tail_insert(&head, &entries[i], link);
121 test_entries_list(&head, entries, NENTRIES-i);
130 list_t entries[NENTRIES];
134 init_entries(entries, sizeof(entries)/sizeof(list_t));
136 ql_head_insert(&head, &entries[NENTRIES-i-1], link);
139 test_entries_list(&head, entries, NENTRIES);
145 list_t entries[NENTRIES];
149 init_entries(entries, sizeof(entries)/sizeof(list_t));
151 ql_head_insert(&head, &entries[NENTRIES-i-1], link);
155 test_entries_list(&head, &entries[i], NENTRIES-i);
164 list_t entries[8];
168 init_entries(entries, sizeof(entries)/sizeof(list_t));
169 a = &entries[0];
170 b = &entries[1];
171 c = &entries[2];
172 d = &entries[3];
173 e = &entries[4];
174 f = &entries[5];
175 g = &entries[6];
176 h = &entries[7];
193 test_entries_list(&head, entries, sizeof(entries)/sizeof(list_t));
198 test_concat_split_entries(list_t *entries, unsigned nentries_a,
200 init_entries(entries, nentries_a + nentries_b);
205 ql_tail_insert(&head_a, &entries[i], link);
210 test_entries_list(&head_a, entries, nentries_a);
216 ql_tail_insert(&head_b, &entries[nentries_a + i], link);
221 test_entries_list(&head_b, entries + nentries_a, nentries_b);
228 test_entries_list(&head_a, entries, nentries_a + nentries_b);
237 ql_split(&head_a, &entries[nentries_a], &head_c, link);
241 test_entries_list(&head_a, entries, nentries_a);
243 test_entries_list(&head_c, entries + nentries_a, nentries_b);
247 list_t entries[NENTRIES];
249 test_concat_split_entries(entries, 0, 0);
251 test_concat_split_entries(entries, 0, 1);
252 test_concat_split_entries(entries, 1, 0);
254 test_concat_split_entries(entries, 0, NENTRIES);
255 test_concat_split_entries(entries, 1, NENTRIES - 1);
256 test_concat_split_entries(entries, NENTRIES / 2,
258 test_concat_split_entries(entries, NENTRIES - 1, 1);
259 test_concat_split_entries(entries, NENTRIES, 0);
265 list_t entries[NENTRIES];
269 init_entries(entries, sizeof(entries)/sizeof(list_t));
271 ql_tail_insert(&head, &entries[i], link);
281 test_entries_list(&head, entries, NENTRIES);
287 list_t entries[NENTRIES];
295 init_entries(entries, sizeof(entries)/sizeof(list_t));
297 ql_tail_insert(&head_src, &entries[i], link);
301 test_entries_list(&head_dest, entries, NENTRIES);