1*5113495bSYour Name /*
2*5113495bSYour Name * Copyright (c) 2019 The Linux Foundation. All rights reserved.
3*5113495bSYour Name *
4*5113495bSYour Name * Permission to use, copy, modify, and/or distribute this software for
5*5113495bSYour Name * any purpose with or without fee is hereby granted, provided that the
6*5113495bSYour Name * above copyright notice and this permission notice appear in all
7*5113495bSYour Name * copies.
8*5113495bSYour Name *
9*5113495bSYour Name * THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL
10*5113495bSYour Name * WARRANTIES WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED
11*5113495bSYour Name * WARRANTIES OF MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE
12*5113495bSYour Name * AUTHOR BE LIABLE FOR ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL
13*5113495bSYour Name * DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR
14*5113495bSYour Name * PROFITS, WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR OTHER
15*5113495bSYour Name * TORTIOUS ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE OR
16*5113495bSYour Name * PERFORMANCE OF THIS SOFTWARE.
17*5113495bSYour Name */
18*5113495bSYour Name
19*5113495bSYour Name #include "qdf_slist.h"
20*5113495bSYour Name #include "qdf_slist_test.h"
21*5113495bSYour Name #include "qdf_trace.h"
22*5113495bSYour Name
23*5113495bSYour Name struct qdf_slist_test_item {
24*5113495bSYour Name uint32_t id;
25*5113495bSYour Name struct qdf_slist_node node;
26*5113495bSYour Name };
27*5113495bSYour Name
28*5113495bSYour Name #define qdf_slist_node_count 10
29*5113495bSYour Name
qdf_slist_test_empty(void)30*5113495bSYour Name static uint32_t qdf_slist_test_empty(void)
31*5113495bSYour Name {
32*5113495bSYour Name struct qdf_slist list;
33*5113495bSYour Name struct qdf_slist_test_item *item;
34*5113495bSYour Name
35*5113495bSYour Name /* a new list should ... */
36*5113495bSYour Name qdf_slist_init(&list);
37*5113495bSYour Name
38*5113495bSYour Name /* ... be empty */
39*5113495bSYour Name QDF_BUG(qdf_slist_empty(&list));
40*5113495bSYour Name
41*5113495bSYour Name /* ... return NULL when pop()'d */
42*5113495bSYour Name QDF_BUG(!qdf_slist_pop(&list, item, node));
43*5113495bSYour Name
44*5113495bSYour Name qdf_slist_deinit(&list);
45*5113495bSYour Name
46*5113495bSYour Name return 0;
47*5113495bSYour Name }
48*5113495bSYour Name
qdf_slist_test_push_pop(void)49*5113495bSYour Name static uint32_t qdf_slist_test_push_pop(void)
50*5113495bSYour Name {
51*5113495bSYour Name struct qdf_slist list;
52*5113495bSYour Name struct qdf_slist_test_item items[qdf_slist_node_count];
53*5113495bSYour Name struct qdf_slist_test_item *item;
54*5113495bSYour Name int i;
55*5113495bSYour Name
56*5113495bSYour Name qdf_slist_init(&list);
57*5113495bSYour Name
58*5113495bSYour Name /* a list with items should ... */
59*5113495bSYour Name for (i = 0; i < qdf_slist_node_count; i++)
60*5113495bSYour Name qdf_slist_push(&list, &items[i], node);
61*5113495bSYour Name
62*5113495bSYour Name /* ... not be empty */
63*5113495bSYour Name QDF_BUG(!qdf_slist_empty(&list));
64*5113495bSYour Name
65*5113495bSYour Name /* ... be able to pop() all items previously push()'d */
66*5113495bSYour Name for (i = 0; i < qdf_slist_node_count; i++)
67*5113495bSYour Name QDF_BUG(qdf_slist_pop(&list, item, node));
68*5113495bSYour Name
69*5113495bSYour Name /* ... be empty after pop()'ing all items */
70*5113495bSYour Name QDF_BUG(qdf_slist_empty(&list));
71*5113495bSYour Name
72*5113495bSYour Name qdf_slist_deinit(&list);
73*5113495bSYour Name
74*5113495bSYour Name return 0;
75*5113495bSYour Name }
76*5113495bSYour Name
qdf_slist_test_for_each(void)77*5113495bSYour Name static uint32_t qdf_slist_test_for_each(void)
78*5113495bSYour Name {
79*5113495bSYour Name struct qdf_slist list;
80*5113495bSYour Name struct qdf_slist_test_item items[qdf_slist_node_count];
81*5113495bSYour Name struct qdf_slist_test_item *prev;
82*5113495bSYour Name struct qdf_slist_test_item *item;
83*5113495bSYour Name int i;
84*5113495bSYour Name
85*5113495bSYour Name qdf_slist_init(&list);
86*5113495bSYour Name
87*5113495bSYour Name /* a list with items should ... */
88*5113495bSYour Name for (i = 0; i < qdf_slist_node_count; i++)
89*5113495bSYour Name qdf_slist_push(&list, &items[i], node);
90*5113495bSYour Name
91*5113495bSYour Name /* ... be able to iterate over each item */
92*5113495bSYour Name i = 0;
93*5113495bSYour Name qdf_slist_for_each(&list, item, node) {
94*5113495bSYour Name item->id = i++;
95*5113495bSYour Name }
96*5113495bSYour Name QDF_BUG(i == qdf_slist_node_count);
97*5113495bSYour Name
98*5113495bSYour Name /* ... be able to remove each item in the same order */
99*5113495bSYour Name i = 0;
100*5113495bSYour Name qdf_slist_for_each_del(&list, prev, item, node) {
101*5113495bSYour Name QDF_BUG(item);
102*5113495bSYour Name QDF_BUG(item->id == i++);
103*5113495bSYour Name QDF_BUG(qdf_slist_remove(&list, prev, node)->id == item->id);
104*5113495bSYour Name }
105*5113495bSYour Name QDF_BUG(i == qdf_slist_node_count);
106*5113495bSYour Name
107*5113495bSYour Name /* ... be empty after all items are removed */
108*5113495bSYour Name QDF_BUG(!qdf_slist_pop(&list, item, node));
109*5113495bSYour Name QDF_BUG(qdf_slist_empty(&list));
110*5113495bSYour Name
111*5113495bSYour Name qdf_slist_deinit(&list);
112*5113495bSYour Name
113*5113495bSYour Name return 0;
114*5113495bSYour Name }
115*5113495bSYour Name
qdf_slist_unit_test(void)116*5113495bSYour Name uint32_t qdf_slist_unit_test(void)
117*5113495bSYour Name {
118*5113495bSYour Name uint32_t errors = 0;
119*5113495bSYour Name
120*5113495bSYour Name errors += qdf_slist_test_empty();
121*5113495bSYour Name errors += qdf_slist_test_push_pop();
122*5113495bSYour Name errors += qdf_slist_test_for_each();
123*5113495bSYour Name
124*5113495bSYour Name return errors;
125*5113495bSYour Name }
126*5113495bSYour Name
127