1 /* A non-exhaustive test for some of the functions and macros declared in
10 /* Sample list element. */
16 /* Puts the 'n' values in 'values' into 'elements', and then puts those
17 * elements in order into 'list'. */
19 make_list(struct list *list, struct element elements[],
20 int values[], size_t n)
25 for (i = 0; i < n; i++) {
26 elements[i].value = i;
27 list_push_back(list, &elements[i].node);
32 /* Verifies that 'list' contains exactly the 'n' values in 'values', in the
35 check_list(struct list *list, const int values[], size_t n)
41 LIST_FOR_EACH (e, struct element, node, list) {
43 assert(e->value == values[i]);
46 assert(&e->node == list);
50 LIST_FOR_EACH_REVERSE (e, struct element, node, list) {
52 assert(e->value == values[n - i - 1]);
55 assert(&e->node == list);
58 assert(list_is_empty(list) == !n);
59 assert(list_size(list) == n);
63 /* Prints the values in 'list', plus 'name' as a title. */
65 print_list(const char *name, struct list *list)
70 LIST_FOR_EACH (e, struct element, node, list) {
71 printf(" %d", e->value);
77 /* Tests basic list construction. */
79 test_list_construction(void)
81 enum { MAX_ELEMS = 100 };
84 for (n = 0; n <= MAX_ELEMS; n++) {
85 struct element elements[MAX_ELEMS];
86 int values[MAX_ELEMS];
89 make_list(&list, elements, values, n);
90 check_list(&list, values, n);
94 /* Tests that LIST_FOR_EACH_SAFE properly allows for deletion of the current
95 * element of a list. */
97 test_list_for_each_safe(void)
99 enum { MAX_ELEMS = 10 };
101 unsigned long int pattern;
103 for (n = 0; n <= MAX_ELEMS; n++) {
104 for (pattern = 0; pattern < 1ul << n; pattern++) {
105 struct element elements[MAX_ELEMS];
106 int values[MAX_ELEMS];
108 struct element *e, *next;
109 size_t values_idx, n_remaining;
112 make_list(&list, elements, values, n);
117 LIST_FOR_EACH_SAFE (e, next, struct element, node, &list) {
119 if (pattern & (1ul << i)) {
120 list_remove(&e->node);
122 memmove(&values[values_idx], &values[values_idx + 1],
123 sizeof *values * (n_remaining - values_idx));
127 check_list(&list, values, n_remaining);
131 assert(&e->node == &list);
133 for (i = 0; i < n; i++) {
134 if (pattern & (1ul << i)) {
138 assert(n == n_remaining);
144 run_test(void (*function)(void))
153 run_test(test_list_construction);
154 run_test(test_list_for_each_safe);