libamxc  1.10.3
C Generic Data Containers
test_amxc_lqueue.c
Go to the documentation of this file.
1 /****************************************************************************
2 **
3 ** SPDX-License-Identifier: BSD-2-Clause-Patent
4 **
5 ** SPDX-FileCopyrightText: Copyright (c) 2023 SoftAtHome
6 **
7 ** Redistribution and use in source and binary forms, with or without modification,
8 ** are permitted provided that the following conditions are met:
9 **
10 ** 1. Redistributions of source code must retain the above copyright notice,
11 ** this list of conditions and the following disclaimer.
12 **
13 ** 2. Redistributions in binary form must reproduce the above copyright notice,
14 ** this list of conditions and the following disclaimer in the documentation
15 ** and/or other materials provided with the distribution.
16 **
17 ** Subject to the terms and conditions of this license, each copyright holder
18 ** and contributor hereby grants to those receiving rights under this license
19 ** a perpetual, worldwide, non-exclusive, no-charge, royalty-free, irrevocable
20 ** (except for failure to satisfy the conditions of this license) patent license
21 ** to make, have made, use, offer to sell, sell, import, and otherwise transfer
22 ** this software, where such license applies only to those patent claims, already
23 ** acquired or hereafter acquired, licensable by such copyright holder or contributor
24 ** that are necessarily infringed by:
25 **
26 ** (a) their Contribution(s) (the licensed copyrights of copyright holders and
27 ** non-copyrightable additions of contributors, in source or binary form) alone;
28 ** or
29 **
30 ** (b) combination of their Contribution(s) with the work of authorship to which
31 ** such Contribution(s) was added by such copyright holder or contributor, if,
32 ** at the time the Contribution is added, such addition causes such combination
33 ** to be necessarily infringed. The patent license shall not apply to any other
34 ** combinations which include the Contribution.
35 **
36 ** Except as expressly stated above, no rights or licenses from any copyright
37 ** holder or contributor is granted under this license, whether expressly, by
38 ** implication, estoppel or otherwise.
39 **
40 ** DISCLAIMER
41 **
42 ** THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
43 ** AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
44 ** IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
45 ** ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDERS OR CONTRIBUTORS BE
46 ** LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
47 ** DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
48 ** SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
49 ** CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
50 ** OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE
51 ** USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
52 **
53 ****************************************************************************/
54 
55 #include <stdio.h>
56 
57 #include <stdlib.h>
58 #include <setjmp.h>
59 #include <stdarg.h>
60 #include <cmocka.h>
61 #include <amxc/amxc_lqueue.h>
62 
63 #include "test_amxc_lqueue.h"
64 
65 #include <amxc/amxc_macros.h>
67  // passing NULL pointers should not lead to segfault
68  assert_int_equal(amxc_lqueue_new(NULL), -1);
69  amxc_lqueue_delete(NULL, NULL);
70 }
71 
73  amxc_lqueue_t* lqueue = NULL;
74  assert_int_equal(amxc_lqueue_new(&lqueue), 0);
75  amxc_lqueue_delete(&lqueue, NULL);
76  assert_ptr_equal(lqueue, NULL);
77 }
78 
80  // passing NULL pointers should not lead to segfault
81  assert_int_equal(amxc_lqueue_init(NULL), -1);
82  amxc_lqueue_clean(NULL, NULL);
83 }
84 
86  amxc_lqueue_t lqueue;
87 
88  assert_int_equal(amxc_lqueue_init(&lqueue), 0);
89  amxc_lqueue_clean(&lqueue, NULL);
90 }
91 
92 void amxc_lqueue_add_check(UNUSED void** state) {
93  amxc_lqueue_t lqueue;
97 
98  assert_int_equal(amxc_lqueue_init(&lqueue), 0);
99  assert_int_equal(amxc_lqueue_it_init(&it1), 0);
100  assert_int_equal(amxc_lqueue_it_init(&it2), 0);
101  assert_int_equal(amxc_lqueue_it_init(&it3), 0);
102 
103  assert_int_equal(amxc_lqueue_add(&lqueue, &it1), 0);
104  assert_ptr_equal(it1.next, NULL);
105  assert_ptr_equal(it1.prev, NULL);
106  assert_int_equal(amxc_lqueue_add(&lqueue, &it2), 0);
107  assert_ptr_equal(it1.next, &it2);
108  assert_ptr_equal(it1.prev, NULL);
109  assert_ptr_equal(it2.next, NULL);
110  assert_ptr_equal(it2.prev, &it1);
111  assert_int_equal(amxc_lqueue_add(&lqueue, &it3), 0);
112  assert_ptr_equal(it1.next, &it2);
113  assert_ptr_equal(it1.prev, NULL);
114  assert_ptr_equal(it2.next, &it3);
115  assert_ptr_equal(it2.prev, &it1);
116  assert_ptr_equal(it3.next, NULL);
117  assert_ptr_equal(it3.prev, &it2);
118 
119  amxc_lqueue_clean(&lqueue, NULL);
120  assert_ptr_equal(it1.next, NULL);
121  assert_ptr_equal(it1.prev, NULL);
122  assert_ptr_equal(it2.next, NULL);
123  assert_ptr_equal(it2.prev, NULL);
124  assert_ptr_equal(it3.next, NULL);
125  assert_ptr_equal(it3.prev, NULL);
126 }
127 
128 
129 void amxc_lqueue_remove_check(UNUSED void** state) {
130  amxc_lqueue_t lqueue;
134 
135  assert_int_equal(amxc_lqueue_init(&lqueue), 0);
136  assert_int_equal(amxc_lqueue_it_init(&it1), 0);
137  assert_int_equal(amxc_lqueue_it_init(&it2), 0);
138  assert_int_equal(amxc_lqueue_it_init(&it3), 0);
139 
140  assert_int_equal(amxc_lqueue_add(&lqueue, &it1), 0);
141  assert_int_equal(amxc_lqueue_add(&lqueue, &it2), 0);
142  assert_int_equal(amxc_lqueue_add(&lqueue, &it3), 0);
143 
144  assert_ptr_equal(amxc_lqueue_remove(&lqueue), &it1);
145  assert_ptr_equal(it1.next, NULL);
146  assert_ptr_equal(it1.prev, NULL);
147  assert_ptr_equal(amxc_lqueue_remove(&lqueue), &it2);
148  assert_ptr_equal(it2.next, NULL);
149  assert_ptr_equal(it2.prev, NULL);
150  assert_ptr_equal(amxc_lqueue_remove(&lqueue), &it3);
151  assert_ptr_equal(it3.next, NULL);
152  assert_ptr_equal(it3.prev, NULL);
153  assert_ptr_equal(amxc_lqueue_remove(&lqueue), NULL);
154 
155  amxc_lqueue_clean(&lqueue, NULL);
156 }
Ambiorix linked queue API header file.
#define UNUSED
Definition: amxc_macros.h:70
AMXC_INLINE int amxc_lqueue_new(amxc_lqueue_t **lqueue)
Allocates a linked queue.
Definition: amxc_lqueue.h:122
AMXC_INLINE int amxc_lqueue_it_init(amxc_lqueue_it_t *const it)
Initializes a linked queue iterator.
Definition: amxc_lqueue.h:283
AMXC_INLINE void amxc_lqueue_clean(amxc_lqueue_t *const lqueue, amxc_lqueue_it_delete_t func)
Removes all items from the linked queue.
Definition: amxc_lqueue.h:190
AMXC_INLINE amxc_lqueue_it_t * amxc_lqueue_remove(amxc_lqueue_t *const lqueue)
Removes the first added item from the queue.
Definition: amxc_lqueue.h:228
AMXC_INLINE int amxc_lqueue_init(amxc_lqueue_t *const lqueue)
Initializes a linked queue.
Definition: amxc_lqueue.h:173
AMXC_INLINE int amxc_lqueue_add(amxc_lqueue_t *const lqueue, amxc_lqueue_it_t *const it)
Adds an item to the linked queue.
Definition: amxc_lqueue.h:213
AMXC_INLINE void amxc_lqueue_delete(amxc_lqueue_t **lqueue, amxc_lqueue_it_delete_t func)
Frees the previously allocated linked queue.
Definition: amxc_lqueue.h:147
The linked list iterator structure.
Definition: amxc_llist.h:215
struct _amxc_llist_it * next
Definition: amxc_llist.h:216
struct _amxc_llist_it * prev
Definition: amxc_llist.h:218
The linked list structure.
Definition: amxc_llist.h:228
static amxc_llist_it_t it3
static amxc_llist_it_t it2
static amxc_llist_it_t it1
void amxc_lqueue_remove_check(UNUSED void **state)
void amxc_lqueue_new_delete_check(UNUSED void **state)
void amxc_lqueue_new_delete_null_check(UNUSED void **state)
void amxc_lqueue_init_clean_null_check(UNUSED void **state)
void amxc_lqueue_init_clean_check(UNUSED void **state)
void amxc_lqueue_add_check(UNUSED void **state)