1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
|
/* Copyright (C) 2016 Hewlett Packard Enterprise Development LP
* All Rights Reserved.
*
* Licensed under the Apache License, Version 2.0 (the "License"); you may
* not use this file except in compliance with the License. You may obtain
* a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS, WITHOUT
* WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. See the
* License for the specific language governing permissions and limitations
* under the License.
*/
/* A non-exhaustive test for some of the functions and macros declared in
* skiplist.h. */
#include <config.h>
#undef NDEBUG
#include <stdio.h>
#include <string.h>
#include "ovstest.h"
#include "skiplist.h"
#include "random.h"
#include "util.h"
static void
test_skiplist_main(int argc OVS_UNUSED, char *argv[] OVS_UNUSED);
static int test_skiplist_cmp(const void *a, const void *b, const void *conf);
static void test_skiplist_insert(void);
static void test_skiplist_delete(void);
static void test_skiplist_find(void);
static void test_skiplist_forward_to(void);
static void test_skiplist_random(void);
static int
test_skiplist_cmp(const void *a, const void *b,
const void *conf OVS_UNUSED)
{
const int *n = (const int *)a;
const int *m = (const int *)b;
return (*n > *m) - (*n < *m);
}
static void
test_skiplist_insert(void)
{
struct skiplist *sl = skiplist_create(test_skiplist_cmp, NULL);
int i;
int *integer;
/* Insert a million rows */
for (i = 0; i < 1000000; i++) {
integer = xmalloc(sizeof(int));
*integer = i;
skiplist_insert(sl, integer);
}
/* Check that the skiplist maintains the list sorted */
struct skiplist_node *node = skiplist_first(sl);
for (i = 0; i < 1000000; i++) {
integer = (int *)skiplist_get_data(node);
ovs_assert(i == *integer);
node = skiplist_next(node);
}
skiplist_destroy(sl, free);
}
static void
test_skiplist_delete(void)
{
struct skiplist *sl = skiplist_create(test_skiplist_cmp, NULL);
int a, b, c;
a = 1;
b = 2;
c = 3;
/* Insert rows */
skiplist_insert(sl, &a);
skiplist_insert(sl, &c);
skiplist_insert(sl, &b);
/* Check that the items exists */
ovs_assert(a == *(int *)skiplist_get_data(skiplist_find(sl, &a)));
ovs_assert(b == *(int *)skiplist_get_data(skiplist_find(sl, &b)));
ovs_assert(c == *(int *)skiplist_get_data(skiplist_find(sl, &c)));
/* Delete b*/
skiplist_delete(sl, &b);
/* Check that the items doesn't exists */
ovs_assert(a == *(int *)skiplist_get_data(skiplist_find(sl, &a)));
ovs_assert(NULL == skiplist_get_data(skiplist_find(sl, &b)));
ovs_assert(c == *(int *)skiplist_get_data(skiplist_find(sl, &c)));
skiplist_destroy(sl, NULL);
}
static void
test_skiplist_find(void)
{
struct skiplist *sl = skiplist_create(test_skiplist_cmp, NULL);
int i;
int *integer;
/* Insert a many rows */
for (i = 0; i < 1000000; i++) {
integer = xmalloc(sizeof(int));
*integer = i;
skiplist_insert(sl, integer);
}
/* Seek all the items */
for (i = 0; i < 1000000; i++) {
integer = (int *)skiplist_get_data(skiplist_find(sl, &i));
ovs_assert(i == *integer);
}
skiplist_destroy(sl, free);
}
static void
test_skiplist_forward_to(void)
{
struct skiplist *sl = skiplist_create(test_skiplist_cmp, NULL);
int a, b, c, d, x;
a = 1;
b = 3;
c = 7;
d = 10;
/* Insert rows */
skiplist_insert(sl, &a);
skiplist_insert(sl, &c);
skiplist_insert(sl, &b);
skiplist_insert(sl, &d);
/* Check that forward_to returns the expected value */
x = a;
ovs_assert(a == *(int *)skiplist_get_data(skiplist_forward_to(sl, &x)));
x = 2;
ovs_assert(b == *(int *)skiplist_get_data(skiplist_forward_to(sl, &x)));
x = 5;
ovs_assert(c == *(int *)skiplist_get_data(skiplist_forward_to(sl, &x)));
x = 8;
ovs_assert(d == *(int *)skiplist_get_data(skiplist_forward_to(sl, &x)));
x = 15;
ovs_assert(NULL == (int *)skiplist_get_data(skiplist_forward_to(sl, &x)));
/* Destroy skiplist */
skiplist_destroy(sl, NULL);
}
static void
test_skiplist_random(void)
{
struct skiplist *sl = skiplist_create(test_skiplist_cmp, NULL);
int total_numbers = 50;
int expected_count = 0;
int *numbers = xmalloc(sizeof(int) * total_numbers);
int i, op, element;
for (i = 0; i < total_numbers; i++) {
numbers[i] = i;
}
random_init();
for (i = 0; i < total_numbers * 1000; i++) {
op = random_uint32() % 2;
element = random_range(total_numbers);
if (op == 0) {
if (!skiplist_find(sl, &numbers[element])) {
expected_count++;
}
skiplist_insert(sl, &numbers[element]);
} else {
if (skiplist_find(sl, &numbers[element])) {
expected_count--;
}
skiplist_delete(sl, &numbers[element]);
}
ovs_assert(expected_count == skiplist_get_size(sl));
}
skiplist_destroy(sl, NULL);
free(numbers);
}
static void
test_skiplist_main(int argc OVS_UNUSED, char *argv[] OVS_UNUSED)
{
printf("skiplist insert\n");
test_skiplist_insert();
printf("skiplist delete\n");
test_skiplist_delete();
printf("skiplist find\n");
test_skiplist_find();
printf("skiplist forward_to\n");
test_skiplist_forward_to();
printf("skiplist random\n");
test_skiplist_random();
printf("\n");
}
OVSTEST_REGISTER("test-skiplist", test_skiplist_main);
|
