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
|
extern "C" {
#include "libavl.h"
}
#include <MESA/stream.h>
#include <stdlib.h>
#include <string.h>
#include <stdio.h>
#include <unistd.h>
#include <gtest/gtest.h>
#define TEST_NUM_COUNT 10000
#define MAX_TREE_NODE_NUM 10000
#if defined(__x86_64__) || defined(_M_X64) || defined(__i386) || defined(_M_IX86)
#include <x86intrin.h>
#elif defined(__aarch64__)
#include <arm_neon.h>
#elif defined(__arm__)
#include <arm_neon.h>
#else
#error "Unsupported architecture"
#endif
uint64_t get_cycles() {
#if defined(__x86_64__) || defined(_M_X64) || defined(__i386) || defined(_M_IX86)
return __rdtsc();
#elif defined(__aarch64__)
uint64_t cntvct;
asm volatile("mrs %0, cntvct_el0" : "=r"(cntvct));
return cntvct;
#elif defined(__arm__)
uint32_t cntvct;
asm volatile("mrc p15, 0, %0, c9, c13, 0" : "=r"(cntvct));
return cntvct;
#else
#error "Unsupported architecture"
#endif
}
static int
cmp_long(const void *p1, const void *p2)
{
if (*(const unsigned long long *)p1 > *(const unsigned long long *)p2) {
return 1;
} else if (*(const unsigned long long *)p1 < *(const unsigned long long *)p2) {
return -1;
}
return 0;
}
TEST(LibavlTest, EnqueueDequeueInOrder)
{
struct avl_node *pnode = NULL;
struct avl_tree *tree = NULL;
unsigned long long time_array[TEST_NUM_COUNT];
int i;
tree = avl_tree_init(MAX_TREE_NODE_NUM);
for (i = 0; i < TEST_NUM_COUNT; i++) {
time_array[i] = get_cycles();
pnode = avl_tree_node_new(time_array[i], NULL, NULL);
EXPECT_TRUE(NULL != pnode);
EXPECT_TRUE(0 == avl_tree_node_insert(tree, pnode));
EXPECT_EQ(pnode, avl_tree_node_lookup(tree, avl_tree_node_key_get(pnode)));
}
qsort(time_array, TEST_NUM_COUNT, sizeof(unsigned long long), cmp_long);
for (i = 0; i < TEST_NUM_COUNT; i++) {
pnode = avl_tree_minimum_node_get(tree);
EXPECT_TRUE(NULL != pnode);
EXPECT_EQ(time_array[i], avl_tree_node_key_get(pnode)) << "time != time in node at index " << i;
avl_tree_node_remove(tree, pnode);
avl_tree_node_free(pnode);
}
avl_tree_destroy(tree);
}
TEST(LibavlTest, EnqueueDequeueRandom)
{
struct avl_node *pnode = NULL;
struct avl_node *pnode2 = NULL;
struct avl_tree *tree;
unsigned long long time_array[TEST_NUM_COUNT];
int i;
tree = avl_tree_init(MAX_TREE_NODE_NUM);
for (i = 0; i < TEST_NUM_COUNT; i++) {
time_array[i] = get_cycles();
pnode = avl_tree_node_new(time_array[i], NULL, NULL);
EXPECT_TRUE(NULL != pnode);
EXPECT_TRUE(0 == avl_tree_node_insert(tree, pnode));
}
qsort(time_array, TEST_NUM_COUNT, sizeof(unsigned long long), cmp_long);
for (i = 0; i < TEST_NUM_COUNT; i++) {
pnode = avl_tree_minimum_node_get_and_pop(tree);
EXPECT_TRUE(NULL != pnode);
EXPECT_EQ(time_array[0], avl_tree_node_key_get(pnode));
pnode2 = avl_tree_minimum_node_get_and_pop(tree);
EXPECT_TRUE(NULL != pnode2);
EXPECT_EQ(time_array[1], avl_tree_node_key_get(pnode2));
avl_tree_node_insert(tree, pnode);
avl_tree_node_insert(tree, pnode2);
}
avl_tree_destroy(tree);
}
TEST(LibavlTest, ExceedMaxNumLimit)
{
struct avl_node *pnode = NULL;
struct avl_tree *tree;
int i;
tree = avl_tree_init(MAX_TREE_NODE_NUM);
for (i = 0; i < MAX_TREE_NODE_NUM; i++) {
pnode = avl_tree_node_new(get_cycles(), NULL, NULL);
EXPECT_TRUE(NULL != pnode);
EXPECT_TRUE(0 == avl_tree_node_insert(tree, pnode));
}
pnode = avl_tree_node_new(get_cycles(), NULL, NULL);
EXPECT_TRUE(-1 == avl_tree_node_insert(tree, pnode));
avl_tree_node_free(pnode);
avl_tree_destroy(tree);
}
TEST(LibavlTest, GetNextInOrder)
{
struct avl_node *pnode = NULL;
struct avl_tree *tree = NULL;
unsigned long long time_array[TEST_NUM_COUNT];
int i;
tree = avl_tree_init(MAX_TREE_NODE_NUM);
for (i = 0; i < TEST_NUM_COUNT; i++) {
time_array[i] = get_cycles();
pnode = avl_tree_node_new(time_array[i], NULL, NULL);
EXPECT_TRUE(NULL != pnode);
EXPECT_TRUE(0 == avl_tree_node_insert(tree, pnode));
EXPECT_EQ(pnode, avl_tree_node_lookup(tree, avl_tree_node_key_get(pnode)));
}
qsort(time_array, TEST_NUM_COUNT, sizeof(unsigned long long), cmp_long);
pnode = avl_tree_minimum_node_get(tree);
for (i = 0; i < TEST_NUM_COUNT; i++) {
EXPECT_TRUE(NULL != pnode);
EXPECT_EQ(time_array[i], avl_tree_node_key_get(pnode)) << "time != time in node at index " << i;
pnode = avl_tree_next_in_order_node_get(pnode);
}
avl_tree_destroy(tree);
}
int main(int argc, char **argv)
{
testing::InitGoogleTest(&argc, argv);
return RUN_ALL_TESTS();
}
|
