1*5113495bSYour Name /*
2*5113495bSYour Name * Copyright (c) 2018-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_hashtable.h"
20*5113495bSYour Name #include "qdf_hashtable_test.h"
21*5113495bSYour Name #include "qdf_trace.h"
22*5113495bSYour Name
23*5113495bSYour Name /* 16 buckets */
24*5113495bSYour Name #define QDF_HT_HASH_BITS 4
25*5113495bSYour Name
26*5113495bSYour Name struct qdf_ht_test_item {
27*5113495bSYour Name struct qdf_ht_entry entry;
28*5113495bSYour Name uintptr_t key;
29*5113495bSYour Name };
30*5113495bSYour Name
qdf_ht_test_single(void)31*5113495bSYour Name static uint32_t qdf_ht_test_single(void)
32*5113495bSYour Name {
33*5113495bSYour Name const int bits = QDF_HT_HASH_BITS;
34*5113495bSYour Name struct qdf_ht_test_item item = { .key = (uintptr_t)&bits };
35*5113495bSYour Name struct qdf_ht_test_item *cursor;
36*5113495bSYour Name int i, count;
37*5113495bSYour Name
38*5113495bSYour Name qdf_ht_declare(ht, QDF_HT_HASH_BITS);
39*5113495bSYour Name
40*5113495bSYour Name qdf_ht_init(ht);
41*5113495bSYour Name qdf_ht_add(ht, &item.entry, item.key);
42*5113495bSYour Name
43*5113495bSYour Name qdf_ht_get(ht, cursor, entry, item.key, key);
44*5113495bSYour Name QDF_BUG(cursor);
45*5113495bSYour Name QDF_BUG(cursor->key == item.key);
46*5113495bSYour Name
47*5113495bSYour Name count = 0;
48*5113495bSYour Name qdf_ht_for_each(ht, i, cursor, entry) {
49*5113495bSYour Name QDF_BUG(cursor->key == item.key);
50*5113495bSYour Name count++;
51*5113495bSYour Name }
52*5113495bSYour Name QDF_BUG(count == 1);
53*5113495bSYour Name
54*5113495bSYour Name count = 0;
55*5113495bSYour Name qdf_ht_for_each_in_bucket(ht, cursor, entry, item.key) {
56*5113495bSYour Name QDF_BUG(cursor->key == item.key);
57*5113495bSYour Name count++;
58*5113495bSYour Name }
59*5113495bSYour Name QDF_BUG(count == 1);
60*5113495bSYour Name
61*5113495bSYour Name count = 0;
62*5113495bSYour Name qdf_ht_for_each_match(ht, cursor, entry, item.key, key) {
63*5113495bSYour Name QDF_BUG(cursor->key == item.key);
64*5113495bSYour Name count++;
65*5113495bSYour Name }
66*5113495bSYour Name QDF_BUG(count == 1);
67*5113495bSYour Name
68*5113495bSYour Name qdf_ht_remove(&item.entry);
69*5113495bSYour Name
70*5113495bSYour Name QDF_BUG(qdf_ht_empty(ht));
71*5113495bSYour Name
72*5113495bSYour Name qdf_ht_deinit(ht);
73*5113495bSYour Name
74*5113495bSYour Name return 0;
75*5113495bSYour Name }
76*5113495bSYour Name
qdf_ht_unit_test(void)77*5113495bSYour Name uint32_t qdf_ht_unit_test(void)
78*5113495bSYour Name {
79*5113495bSYour Name uint32_t errors = 0;
80*5113495bSYour Name
81*5113495bSYour Name errors += qdf_ht_test_single();
82*5113495bSYour Name
83*5113495bSYour Name return errors;
84*5113495bSYour Name }
85*5113495bSYour Name
86