|
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 */ |
|
28 |
|
29 #include "cx/linked_list.h" |
|
30 #include "test_config.h" |
|
31 |
|
32 int cmp_int(int const *l, int const *r) { |
|
33 int left = *l, right = *r; |
|
34 return left == right ? 0 : (left < right ? -1 : 1); |
|
35 } |
|
36 |
|
37 void test_linked_list_create() { |
|
38 CxList list = cxLinkedListCreate(cxDefaultAllocator, (CxListComparator) cmp_int, sizeof(int)); |
|
39 |
|
40 CU_ASSERT_EQUAL(list->data.size, 0) |
|
41 CU_ASSERT_EQUAL(list->data.capacity, (size_t) -1) |
|
42 CU_ASSERT_PTR_EQUAL(list->data.allocator, cxDefaultAllocator) |
|
43 CU_ASSERT_EQUAL(list->data.itemsize, sizeof(int)) |
|
44 CU_ASSERT_PTR_EQUAL(list->data.cmpfunc, cmp_int) |
|
45 |
|
46 struct node { |
|
47 void* begin; void* end; ptrdiff_t ploc; ptrdiff_t nloc; |
|
48 }; |
|
49 |
|
50 struct node* actual = (struct node*) list->data.listdata; |
|
51 CU_ASSERT_PTR_NULL(actual->begin) |
|
52 CU_ASSERT_PTR_NULL(actual->end) |
|
53 CU_ASSERT_EQUAL(0, actual->ploc) |
|
54 CU_ASSERT_EQUAL(sizeof(void*), actual->nloc) |
|
55 |
|
56 cxLinkedListDestroy(list); |
|
57 |
|
58 // TODO: use allocator that keeps track of the freed memory |
|
59 } |
|
60 |
|
61 int main() { |
|
62 CU_pSuite suite = NULL; |
|
63 |
|
64 if (CUE_SUCCESS != CU_initialize_registry()) { |
|
65 return CU_get_error(); |
|
66 } |
|
67 |
|
68 suite = CU_add_suite("linked list suite", NULL, NULL); |
|
69 if (NULL == suite) { |
|
70 CU_cleanup_registry(); |
|
71 return CU_get_error(); |
|
72 } |
|
73 |
|
74 if ( |
|
75 !CU_add_test(suite, "create and destroy linked list", test_linked_list_create) |
|
76 ) { |
|
77 CU_cleanup_registry(); |
|
78 return CU_get_error(); |
|
79 } |
|
80 |
|
81 suite = CU_add_suite("array suite", NULL, NULL); |
|
82 if (NULL == suite) { |
|
83 CU_cleanup_registry(); |
|
84 return CU_get_error(); |
|
85 } |
|
86 |
|
87 /* |
|
88 if ( |
|
89 !CU_add_test(suite, "array...", test_array...) |
|
90 ) { |
|
91 CU_cleanup_registry(); |
|
92 return CU_get_error(); |
|
93 } |
|
94 */ |
|
95 |
|
96 CU_basic_set_mode(UCX_CU_BRM); |
|
97 |
|
98 int exitcode; |
|
99 if (CU_basic_run_tests()) { |
|
100 exitcode = CU_get_error(); |
|
101 } else { |
|
102 exitcode = CU_get_number_of_failures() == 0 ? 0 : 1; |
|
103 } |
|
104 CU_cleanup_registry(); |
|
105 return exitcode; |
|
106 } |