-
Notifications
You must be signed in to change notification settings - Fork 1
/
iplookuptree_test.go
301 lines (218 loc) · 6.01 KB
/
iplookuptree_test.go
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
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
package iplookuptree
import (
"bufio"
"fmt"
"math/rand"
"net"
"os"
"testing"
)
type ipNetList []net.IPNet
func newIPNetList(rawCIDRs []string) (ipNetList, error) {
ans := make([]net.IPNet, len(rawCIDRs))
for i, rawCIDR := range rawCIDRs {
_, ipv4Net, err := net.ParseCIDR(rawCIDR)
if err != nil {
return nil, fmt.Errorf("could not parse CIDR at %d with cidr %s", i, rawCIDR)
}
ans[i] = *ipv4Net
}
return ans, nil
}
func newIPNetListFromFile(filename string) (cidrList ipNetList, err error) {
f, err := os.Open(filename)
if err != nil {
return
}
defer f.Close()
r := bufio.NewScanner(f)
var lines []string
for r.Scan() {
lines = append(lines, r.Text())
}
if err = r.Err(); err != nil {
return
}
return newIPNetList(lines)
}
func Test_getSubstring(t *testing.T) {
// 00001010 11000000 10101011 00011000
ipv4bytes := []byte{0x0A, 0xC0, 0xAB, 0x18}
if found := getSubstring(ipv4bytes, 0); found != 0x0 {
t.Errorf("getSubstring() - found %v", found)
}
if found := getSubstring(ipv4bytes, 1); found != 0xA {
t.Errorf("getSubstring() - found %v", found)
}
if found := getSubstring(ipv4bytes, 2); found != 0xC {
t.Errorf("getSubstring() - found %v", found)
}
if found := getSubstring(ipv4bytes, 3); found != 0x0 {
t.Errorf("getSubstring() - found %v", found)
}
if found := getSubstring(ipv4bytes, 4); found != 0xA {
t.Errorf("getSubstring() - found %v", found)
}
if found := getSubstring(ipv4bytes, 5); found != 0xB {
t.Errorf("getSubstring() - found %v", found)
}
if found := getSubstring(ipv4bytes, 6); found != 0x1 {
t.Errorf("getSubstring() - found %v", found)
}
if found := getSubstring(ipv4bytes, 7); found != 0x8 {
t.Errorf("getSubstring() - found %v", found)
}
}
func TestTree_Add(t *testing.T) {
// 00001010 11000000 10101011 00011000
ipv4bytes := []byte{0x0A, 0xC0, 0xAB, 0x18}
ipnet := net.IPNet{ipv4bytes, []byte{0xFF, 0xFF, 0xFF, 0xFF}}
tree := New()
var id SID = 1
tree.Add(id, ipnet)
cur := tree.root
index := 0x0
if cur.ptrs[index] == nil {
t.Errorf("Add() - expected to have pointer at %v", index)
}
cur = cur.ptrs[index]
index = 0xA
if cur.ptrs[index] == nil {
t.Errorf("Add() - expected to have pointer at %v", index)
}
cur = cur.ptrs[index]
index = 0xC
if cur.ptrs[index] == nil {
t.Errorf("Add() - expected to have pointer at %v", index)
}
cur = cur.ptrs[index]
index = 0x0
if cur.ptrs[index] == nil {
t.Errorf("Add() - expected to have pointer at %v", index)
}
cur = cur.ptrs[index]
index = 0xA
if cur.ptrs[index] == nil {
t.Errorf("Add() - expected to have pointer at %v", index)
}
cur = cur.ptrs[index]
index = 0xB
if cur.ptrs[index] == nil {
t.Errorf("Add() - expected to have pointer at %v", index)
}
cur = cur.ptrs[index]
index = 0x1
if cur.ptrs[index] == nil {
t.Errorf("Add() - expected to have pointer at %v", index)
}
cur = cur.ptrs[index]
index = 0x8
if cur.ptrs[index] != nil {
t.Errorf("Add() - expected to not have pointer at %v", index)
}
if cur.srvs[index] | id != 1 {
t.Errorf("Add() - expected to have service id, but found %v", cur.srvs[index])
}
}
func TestTree_Remove(t *testing.T) {
var id SID = 1
tree := New()
ipv4bytes := []byte{0x0A, 0xC0, 0xAB, 0x18}
ipnet := net.IPNet{ipv4bytes, []byte{0xFF, 0xFF, 0xFF, 0xFF}}
tree.Add(id, ipnet)
tree.Remove(id, net.IPNet{[]byte{0x0A, 0xC0, 0xAB, 0x19}, []byte{0xFF, 0xFF, 0xFF, 0xFF}})
if ans := tree.Get(ipv4bytes); ans != id {
t.Errorf("Remove() - expected to find id")
}
tree.Remove(id, ipnet)
if ans := tree.Get(ipv4bytes); ans != 0 {
t.Errorf("Remove() - expected to find zero services")
}
if tree.root.isEmpty() != true {
t.Errorf("Remove() - expected to not have any nodes")
}
}
func TestTree_Remove2(t *testing.T) {
var id1 SID = 1
var id2 SID = 2
tree := New()
ipv4bytes := []byte{0x0A, 0xC0, 0xAB, 0x18}
ipnet := net.IPNet{ipv4bytes, []byte{0xFF, 0xFF, 0xFF, 0xFF}}
tree.Add(id1, ipnet)
tree.Remove(id2, ipnet)
if ans := tree.Get(ipv4bytes); ans != id1 {
t.Errorf("Remove() - expected to find id1")
}
}
func TestTree_Remove3(t *testing.T) {
var id SID = 16
tree := New()
ipv4bytes1 := []byte{0x0A, 0xC0, 0xAB, 0x18}
ipnet1 := net.IPNet{ipv4bytes1, []byte{0xFF, 0xFF, 0xFF, 0xFF}}
ipv4bytes2 := []byte{0x0A, 0xC0, 0xAD, 0x18}
ipnet2 := net.IPNet{ipv4bytes2, []byte{0xFF, 0xFF, 0xFF, 0xFF}}
tree.Add(id, ipnet1)
tree.Add(id, ipnet2)
if ans := tree.Get(ipv4bytes1); ans != id {
t.Errorf("Remove() - expected to find id")
}
if ans := tree.Get(ipv4bytes2); ans != id {
t.Errorf("Remove() - expected to find id")
}
tree.Remove(id, ipnet1)
if ans := tree.Get(ipv4bytes1); ans != 0 {
t.Errorf("Remove() - expected to find zero services")
}
if ans := tree.Get(ipv4bytes2); ans != id {
t.Errorf("Remove() - expected to find id")
}
}
func TestTree_Get(t *testing.T) {
t.Skip()
var id SID = 1
tree := New()
ipNetList, _ := newIPNetListFromFile("./test_data/cidr_list.txt")
for _, ipnet := range ipNetList {
tree.Add(id, ipnet)
}
var ip []byte
ip = net.ParseIP("31.13.64.51").To4()
if found := tree.Get(ip); found != id {
t.Errorf("Treenode_Get() - found %v", found)
}
ip = net.ParseIP("31.13.64.52").To4()
if found := tree.Get(ip); found != 0 {
t.Errorf("Treenode_Get() - found %v", found)
}
ip = net.ParseIP("198.11.251.32").To4()
if found := tree.Get(ip); found != 1 {
t.Errorf("Treenode_Get() - found %v", found)
}
ip = net.ParseIP("198.11.251.255").To4()
if found := tree.Get(ip); found != 0 {
t.Errorf("Treenode_Get() - found %v", found)
}
ip = net.ParseIP("217.76.74.226").To4()
if found := tree.Get(ip); found != 1 {
t.Errorf("Treenode_Get() - found %v", found)
}
}
func BenchmarkTreenode_Get(b *testing.B) {
b.Skip()
const querynum = 1000 * 1000
var id SID = 1
tree := New()
ipNetList, _ := newIPNetListFromFile("./test_data/cidr_list.txt")
for _, ipnet := range ipNetList {
tree.Add(id, ipnet)
}
b.ResetTimer()
b.ReportAllocs()
for i := 0; i < b.N; i++ {
ip := make([]byte, 4)
for j := 0; j < querynum; j++ {
rand.Read(ip)
tree.Get(ip)
}
}
}