test/unit/ql.c

5 /* Number of ring entries, in [2..26]. */
47 init_entries(list_t *entries, unsigned nentries) {
51 		entries[i].id = 'a' + i;
52 		ql_elm_new(&entries[i], link);
57 test_entries_list(list_head_t *head, list_t *entries, unsigned nentries) {
61 	assert_c_eq(ql_first(head)->id, entries[0].id, "Element id mismatch");
62 	assert_c_eq(ql_last(head, link)->id, entries[nentries-1].id,
67 		assert_c_eq(t->id, entries[i].id, "Element id mismatch");
73 		assert_c_eq(t->id, entries[nentries-i-1].id,
79 		t = ql_next(head, &entries[i], link);
80 		assert_c_eq(t->id, entries[i+1].id, "Element id mismatch");
82 	assert_ptr_null(ql_next(head, &entries[nentries-1], link),
85 	assert_ptr_null(ql_prev(head, &entries[0], link), "Unexpected element");
87 		t = ql_prev(head, &entries[i], link);
88 		assert_c_eq(t->id, entries[i-1].id, "Element id mismatch");
94 	list_t entries[NENTRIES];
98 	init_entries(entries, sizeof(entries)/sizeof(list_t));
100 		ql_tail_insert(&head, &entries[i], link);
103 	test_entries_list(&head, entries, NENTRIES);
109 	list_t entries[NENTRIES];
113 	init_entries(entries, sizeof(entries)/sizeof(list_t));
115 		ql_tail_insert(&head, &entries[i], link);
119 		test_entries_list(&head, entries, NENTRIES-i);
128 	list_t entries[NENTRIES];
132 	init_entries(entries, sizeof(entries)/sizeof(list_t));
134 		ql_head_insert(&head, &entries[NENTRIES-i-1], link);
137 	test_entries_list(&head, entries, NENTRIES);
143 	list_t entries[NENTRIES];
147 	init_entries(entries, sizeof(entries)/sizeof(list_t));
149 		ql_head_insert(&head, &entries[NENTRIES-i-1], link);
153 		test_entries_list(&head, &entries[i], NENTRIES-i);
162 	list_t entries[8];
166 	init_entries(entries, sizeof(entries)/sizeof(list_t));
167 	a = &entries[0];
168 	b = &entries[1];
169 	c = &entries[2];
170 	d = &entries[3];
171 	e = &entries[4];
172 	f = &entries[5];
173 	g = &entries[6];
174 	h = &entries[7];
191 	test_entries_list(&head, entries, sizeof(entries)/sizeof(list_t));