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
|
/*
* Asterisk -- An open source telephony toolkit.
*
* Copyright (C) 2009, Digium, Inc.
*
* Russell Bryant <russell@digium.com>
*
* See http://www.asterisk.org for more information about
* the Asterisk project. Please do not directly contact
* any of the maintainers of this project for assistance;
* the project provides a web site, mailing lists and IRC
* channels for your use.
*
* This program is free software, distributed under the terms of
* the GNU General Public License Version 2. See the LICENSE file
* at the top of the source tree.
*/
/*! \file
*
* \brief Heap data structure test module
*
* \author Russell Bryant <russell@digium.com>
*/
/*** MODULEINFO
<depend>TEST_FRAMEWORK</depend>
***/
#include "asterisk.h"
ASTERISK_FILE_VERSION(__FILE__, "$Revision$")
#include "asterisk/module.h"
#include "asterisk/utils.h"
#include "asterisk/heap.h"
#include "asterisk/test.h"
struct node {
long val;
size_t index;
};
static int node_cmp(void *_n1, void *_n2)
{
struct node *n1 = _n1;
struct node *n2 = _n2;
if (n1->val < n2->val) {
return -1;
} else if (n1->val == n2->val) {
return 0;
} else {
return 1;
}
}
AST_TEST_DEFINE(heap_test_1)
{
struct ast_heap *h;
struct node *obj;
struct node nodes[3] = {
{ 1, } ,
{ 2, } ,
{ 3, } ,
};
switch (cmd) {
case TEST_INIT:
info->name = "heap_test_1";
info->category = "main/heap/";
info->summary = "push and pop elements";
info->description = "Push a few elements onto a heap and make sure that they come back off in the right order.";
return AST_TEST_NOT_RUN;
case TEST_EXECUTE:
break;
}
if (!(h = ast_heap_create(8, node_cmp, offsetof(struct node, index)))) {
return AST_TEST_FAIL;
}
ast_heap_push(h, &nodes[0]);
ast_heap_push(h, &nodes[1]);
ast_heap_push(h, &nodes[2]);
obj = ast_heap_pop(h);
if (obj->val != 3) {
ast_test_status_update(test, "expected 3, got %ld\n", obj->val);
return AST_TEST_FAIL;
}
obj = ast_heap_pop(h);
if (obj->val != 2) {
ast_test_status_update(test, "expected 2, got %ld\n", obj->val);
return AST_TEST_FAIL;
}
obj = ast_heap_pop(h);
if (obj->val != 1) {
ast_test_status_update(test, "expected 1, got %ld\n", obj->val);
return AST_TEST_FAIL;
}
obj = ast_heap_pop(h);
if (obj) {
ast_test_status_update(test, "got unexpected object\n");
return AST_TEST_FAIL;
}
h = ast_heap_destroy(h);
return AST_TEST_PASS;
}
AST_TEST_DEFINE(heap_test_2)
{
struct ast_heap *h = NULL;
static const unsigned int total = 100000;
struct node *nodes = NULL;
struct node *node;
unsigned int i = total;
long last = LONG_MAX;
long cur;
enum ast_test_result_state res = AST_TEST_PASS;
switch (cmd) {
case TEST_INIT:
info->name = "heap_test_2";
info->category = "main/heap/";
info->summary = "load test";
info->description =
"Push one hundred thousand random elements on to a heap, "
"verify that the heap has been properly constructed, "
"and then ensure that the elements are come back off "
"in the proper order.";
return AST_TEST_NOT_RUN;
case TEST_EXECUTE:
break;
}
if (!(nodes = ast_malloc(total * sizeof(*node)))) {
res = AST_TEST_FAIL;
goto return_cleanup;
}
if (!(h = ast_heap_create(20, node_cmp, offsetof(struct node, index)))) {
res = AST_TEST_FAIL;
goto return_cleanup;
}
while (i--) {
nodes[i].val = ast_random();
ast_heap_push(h, &nodes[i]);
}
if (ast_heap_verify(h)) {
res = AST_TEST_FAIL;
goto return_cleanup;
}
i = 0;
while ((node = ast_heap_pop(h))) {
cur = node->val;
if (cur > last) {
ast_test_status_update(test, "i: %u, cur: %ld, last: %ld\n", i, cur, last);
res = AST_TEST_FAIL;
goto return_cleanup;
}
last = cur;
i++;
}
if (i != total) {
ast_test_status_update(test, "Stopped popping off after only getting %u nodes\n", i);
res = AST_TEST_FAIL;
goto return_cleanup;
}
return_cleanup:
if (h) {
h = ast_heap_destroy(h);
}
if (nodes) {
ast_free(nodes);
}
return res;
}
static int unload_module(void)
{
AST_TEST_UNREGISTER(heap_test_1);
AST_TEST_UNREGISTER(heap_test_2);
return 0;
}
static int load_module(void)
{
AST_TEST_REGISTER(heap_test_1);
AST_TEST_REGISTER(heap_test_2);
return AST_MODULE_LOAD_SUCCESS;
}
AST_MODULE_INFO_STANDARD(ASTERISK_GPL_KEY, "Heap test module");
|
