Lines Matching refs:entries

3 /* Number of ring entries, in [2..26]. */
47 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 assert_c_eq(ql_first(head)->id, entries[0].id, "Element id mismatch");
64 assert_c_eq(ql_last(head, link)->id, entries[nentries-1].id,
69 assert_c_eq(t->id, entries[i].id, "Element id mismatch");
75 assert_c_eq(t->id, entries[nentries-i-1].id,
81 t = ql_next(head, &entries[i], link);
82 assert_c_eq(t->id, entries[i+1].id, "Element id mismatch");
84 assert_ptr_null(ql_next(head, &entries[nentries-1], link),
87 assert_ptr_null(ql_prev(head, &entries[0], link), "Unexpected element");
89 t = ql_prev(head, &entries[i], link);
90 assert_c_eq(t->id, entries[i-1].id, "Element id mismatch");
97 list_t entries[NENTRIES];
101 init_entries(entries, sizeof(entries)/sizeof(list_t));
103 ql_tail_insert(&head, &entries[i], link);
105 test_entries_list(&head, entries, NENTRIES);
112 list_t entries[NENTRIES];
116 init_entries(entries, sizeof(entries)/sizeof(list_t));
118 ql_tail_insert(&head, &entries[i], link);
121 test_entries_list(&head, entries, NENTRIES-i);
131 list_t entries[NENTRIES];
135 init_entries(entries, sizeof(entries)/sizeof(list_t));
137 ql_head_insert(&head, &entries[NENTRIES-i-1], link);
139 test_entries_list(&head, entries, NENTRIES);
146 list_t entries[NENTRIES];
150 init_entries(entries, sizeof(entries)/sizeof(list_t));
152 ql_head_insert(&head, &entries[NENTRIES-i-1], link);
155 test_entries_list(&head, &entries[i], NENTRIES-i);
165 list_t entries[8];
169 init_entries(entries, sizeof(entries)/sizeof(list_t));
170 a = &entries[0];
171 b = &entries[1];
172 c = &entries[2];
173 d = &entries[3];
174 e = &entries[4];
175 f = &entries[5];
176 g = &entries[6];
177 h = &entries[7];
194 test_entries_list(&head, entries, sizeof(entries)/sizeof(list_t));