Sun, 26 Sep 2021 18:31:24 +0200
change inheritance model for lists
1 /*
2 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS HEADER.
3 *
4 * Copyright 2021 Mike Becker, Olaf Wintermann All rights reserved.
5 *
6 * Redistribution and use in source and binary forms, with or without
7 * modification, are permitted provided that the following conditions are met:
8 *
9 * 1. Redistributions of source code must retain the above copyright
10 * notice, this list of conditions and the following disclaimer.
11 *
12 * 2. Redistributions in binary form must reproduce the above copyright
13 * notice, this list of conditions and the following disclaimer in the
14 * documentation and/or other materials provided with the distribution.
15 *
16 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
17 * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
18 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
19 * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE
20 * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
21 * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
22 * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
23 * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
24 * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
25 * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
26 * POSSIBILITY OF SUCH DAMAGE.
27 */
29 #include "cx/linked_list.h"
30 #include "test_config.h"
31 #include "util_allocator.h"
33 int cmp_int(int const *l, int const *r) {
34 int left = *l, right = *r;
35 return left == right ? 0 : (left < right ? -1 : 1);
36 }
38 void test_linked_list_create() {
39 cxTestingAllocatorReset();
41 CxList list = cxLinkedListCreate(cxTestingAllocator, (CxListComparator) cmp_int, sizeof(int));
43 CU_ASSERT_EQUAL(list->size, 0)
44 CU_ASSERT_EQUAL(list->capacity, (size_t) -1)
45 CU_ASSERT_PTR_EQUAL(list->allocator, cxTestingAllocator)
46 CU_ASSERT_EQUAL(list->itemsize, sizeof(int))
47 CU_ASSERT_PTR_EQUAL(list->cmpfunc, cmp_int)
49 // assume this structure for a linked list
50 struct ll_check {
51 cx_list_s base;
52 void *begin;
53 void *end;
54 ptrdiff_t ploc;
55 ptrdiff_t nloc;
56 };
58 struct ll_check *actual = (struct ll_check *) list;
59 CU_ASSERT_PTR_NULL(actual->begin)
60 CU_ASSERT_PTR_NULL(actual->end)
61 CU_ASSERT_EQUAL(0, actual->ploc)
62 CU_ASSERT_EQUAL(sizeof(void *), actual->nloc)
64 cxLinkedListDestroy(list);
66 CU_ASSERT_TRUE(cxTestingAllocatorVerify())
67 }
69 int main() {
70 CU_pSuite suite = NULL;
72 if (CUE_SUCCESS != CU_initialize_registry()) {
73 return CU_get_error();
74 }
76 suite = CU_add_suite("linked list suite", NULL, NULL);
77 if (NULL == suite) {
78 CU_cleanup_registry();
79 return CU_get_error();
80 }
82 if (
83 !CU_add_test(suite, "create and destroy linked list", test_linked_list_create)
84 ) {
85 CU_cleanup_registry();
86 return CU_get_error();
87 }
89 suite = CU_add_suite("array suite", NULL, NULL);
90 if (NULL == suite) {
91 CU_cleanup_registry();
92 return CU_get_error();
93 }
95 /*
96 if (
97 !CU_add_test(suite, "array...", test_array...)
98 ) {
99 CU_cleanup_registry();
100 return CU_get_error();
101 }
102 */
104 CU_basic_set_mode(UCX_CU_BRM);
106 int exitcode;
107 if (CU_basic_run_tests()) {
108 exitcode = CU_get_error();
109 } else {
110 exitcode = CU_get_number_of_failures() == 0 ? 0 : 1;
111 }
112 CU_cleanup_registry();
113 return exitcode;
114 }