ucx: test/test_list.c@668757098b73

     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(void) {

    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     };

    56     struct ll_check *actual = (struct ll_check *) list;

    57     CU_ASSERT_PTR_NULL(actual->begin)

    58     CU_ASSERT_PTR_NULL(actual->end)

    60     cxLinkedListDestroy(list);

    62     CU_ASSERT_TRUE(cxTestingAllocatorVerify())

    63 }

    65 void test_linked_list_at(void) {

    66     struct node {

    67         void *next;

    68         void *prev;

    69     };

    70     const ptrdiff_t loc_prev = offsetof(struct node, prev);

    71     const ptrdiff_t loc_next = offsetof(struct node, next);

    73     struct node a, b, c, d;

    74     a.prev = NULL;

    75     a.next = &b;

    76     b.prev = &a;

    77     b.next = &c;

    78     c.prev = &b;

    79     c.next = &d;

    80     d.prev = &c;

    81     d.next = NULL;

    83     CU_ASSERT_PTR_EQUAL(&a, cx_linked_list_at(&a, 0, loc_next, 0));

    84     CU_ASSERT_PTR_EQUAL(&b, cx_linked_list_at(&a, 0, loc_next, 1));

    85     CU_ASSERT_PTR_EQUAL(&c, cx_linked_list_at(&a, 0, loc_next, 2));

    86     CU_ASSERT_PTR_EQUAL(&d, cx_linked_list_at(&a, 0, loc_next, 3));

    87     CU_ASSERT_PTR_NULL(cx_linked_list_at(&a, 0, loc_next, 4));

    89     CU_ASSERT_PTR_EQUAL(&a, cx_linked_list_at(&b, 1, loc_prev, 0));

    90     CU_ASSERT_PTR_EQUAL(&b, cx_linked_list_at(&b, 1, loc_next, 1));

    91     CU_ASSERT_PTR_EQUAL(&c, cx_linked_list_at(&b, 1, loc_next, 2));

    92     CU_ASSERT_PTR_EQUAL(&d, cx_linked_list_at(&b, 1, loc_next, 3));

    93     CU_ASSERT_PTR_NULL(cx_linked_list_at(&b, 1, loc_next, 4));

    95     CU_ASSERT_PTR_EQUAL(&a, cx_linked_list_at(&d, 3, loc_prev, 0));

    96     CU_ASSERT_PTR_EQUAL(&b, cx_linked_list_at(&d, 3, loc_prev, 1));

    97 }

    99 void test_linked_list_add(void) {

   100     struct node {

   101         void *prev;

   102         void *next;

   103         int value;

   104     };

   106     struct node nodes[4];

   108     // test with begin, end / prev, next

   109     memset(nodes, 0, 4*sizeof(struct node));

   110     void *begin = NULL;

   111     void *end = NULL;

   113     ptrdiff_t loc_prev = offsetof(struct node, prev);

   114     ptrdiff_t loc_next = offsetof(struct node, next);

   116     int ret;

   117     ret = cx_linked_list_add(&begin, &end, loc_prev, loc_next, &nodes[0]);

   118     CU_ASSERT_EQUAL(ret, 0);

   119     CU_ASSERT_PTR_EQUAL(begin, &nodes[0]);

   120     CU_ASSERT_PTR_EQUAL(end, &nodes[0]);

   121     CU_ASSERT_PTR_EQUAL(nodes[0].prev, NULL);

   122     CU_ASSERT_PTR_EQUAL(nodes[0].next, NULL);

   124     ret = cx_linked_list_add(&begin, &end, loc_prev, loc_next, &nodes[1]);

   125     CU_ASSERT_EQUAL(ret, 0);

   126     CU_ASSERT_PTR_EQUAL(begin, &nodes[0]);

   127     CU_ASSERT_PTR_EQUAL(end, &nodes[1]);

   128     CU_ASSERT_PTR_EQUAL(nodes[0].next, &nodes[1]);

   129     CU_ASSERT_PTR_EQUAL(nodes[1].prev, &nodes[0]);

   131     // test with begin only / prev, next

   132     memset(nodes, 0, 4*sizeof(struct node));

   133     begin = NULL;

   134     end = NULL;

   136     ret = cx_linked_list_add(&begin, NULL, loc_prev, loc_next, &nodes[0]);

   137     CU_ASSERT_EQUAL(ret, 0);

   138     CU_ASSERT_PTR_EQUAL(begin, &nodes[0]);

   139     ret = cx_linked_list_add(&begin, NULL, loc_prev, loc_next, &nodes[1]);

   140     CU_ASSERT_EQUAL(ret, 0);

   141     CU_ASSERT_PTR_EQUAL(begin, &nodes[0]);

   142     CU_ASSERT_PTR_EQUAL(nodes[0].next, &nodes[1]);

   143     CU_ASSERT_PTR_EQUAL(nodes[1].prev, &nodes[0]);

   145     ret = cx_linked_list_add(&begin, NULL, loc_prev, loc_next, &nodes[2]);

   146     CU_ASSERT_PTR_EQUAL(nodes[1].next, &nodes[2]);

   147     CU_ASSERT_PTR_EQUAL(nodes[2].prev, &nodes[1]);

   149     // test with begin, end / next

   150     memset(nodes, 0, 4*sizeof(struct node));

   151     begin = NULL;

   152     end = NULL;

   154     ret = cx_linked_list_add(&begin, &end, -1, loc_next, &nodes[0]);

   155     CU_ASSERT_EQUAL(ret, 0);

   156     CU_ASSERT_PTR_EQUAL(begin, &nodes[0]);

   157     CU_ASSERT_PTR_EQUAL(end, &nodes[0]);

   158     ret = cx_linked_list_add(&begin, &end, -1, loc_next, &nodes[1]);

   159     CU_ASSERT_PTR_EQUAL(end, &nodes[1]);

   160     CU_ASSERT_PTR_EQUAL(nodes[0].next, &nodes[1]);

   161     CU_ASSERT_PTR_EQUAL(nodes[1].prev, NULL);

   162 }

   164 int main() {

   165     CU_pSuite suite = NULL;

   167     if (CUE_SUCCESS != CU_initialize_registry()) {

   168         return CU_get_error();

   169     }

   171     suite = CU_add_suite("linked list suite", NULL, NULL);

   173     CU_add_test(suite, "linked list: create and destroy", test_linked_list_create);

   174     CU_add_test(suite, "linked list: get node at index", test_linked_list_at);

   175     CU_add_test(suite, "linked list: add", test_linked_list_add);

   177     CU_basic_set_mode(UCX_CU_BRM);

   179     int exitcode;

   180     if (CU_basic_run_tests()) {

   181         exitcode = CU_get_error();

   182     } else {

   183         exitcode = CU_get_number_of_failures() == 0 ? 0 : 1;

   184     }

   185     CU_cleanup_registry();

   186     return exitcode;

   187 }

Mercurial > hg > ucx / file revision