-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathtest.py
executable file
·383 lines (349 loc) · 11.7 KB
/
test.py
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
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
#!/usr/bin/env python
# Copyright (c) 2004 Damien Miller <[email protected]>
#
# Permission to use, copy, modify, and distribute this software for any
# purpose with or without fee is hereby granted, provided that the above
# copyright notice and this permission notice appear in all copies.
#
# THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES
# WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF
# MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR
# ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
# WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN
# ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF
# OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
# $Id$
import sys
import radix
import unittest
import socket
import struct
import pickle
if sys.version_info[0] >= 3:
# for Py3K
t00_class_name = "<class 'radix.Radix'>"
t01_node_name = "<class 'radix.RadixNode'>"
t14_packed_addr = struct.pack('4B', 0xe0, 0x14, 0x0b, 0x40)
t15_packed_addr = struct.pack('16B',
0xde, 0xad ,0xbe, 0xef, 0x12, 0x34, 0x56 ,0x78,
0x9a, 0xbc, 0xde, 0xf0, 0x00, 0x00, 0x00, 0x00)
else:
# for 2.x
import cPickle
t00_class_name = "<type 'radix.Radix'>"
t01_node_name = "<type 'radix.RadixNode'>"
t14_packed_addr = '\xe0\x14\x0b@'
t15_packed_addr = '\xde\xad\xbe\xef\x124Vx\x9a\xbc\xde\xf0\x00\x00\x00\x00'
class TestRadix(unittest.TestCase):
def test_00__create_destroy(self):
tree = radix.Radix()
self.assertEqual(str(type(tree)), t00_class_name)
del tree
def test_01__create_node(self):
tree = radix.Radix()
node = tree.add("10.0.0.0/8")
self.assertEqual(str(type(node)), t01_node_name)
self.assertEqual(node.prefix, "10.0.0.0/8")
self.assertEqual(node.network, "10.0.0.0")
self.assertEqual(node.prefixlen, 8)
self.assertEqual(node.family, socket.AF_INET)
node = tree.add("10.0.0.0", 16)
self.assertEqual(node.network, "10.0.0.0")
self.assertEqual(node.prefixlen, 16)
node = tree.add(network = "10.0.0.0", masklen = 24)
self.assertEqual(node.network, "10.0.0.0")
self.assertEqual(node.prefixlen, 24)
node2 = tree.add(network = "ff00::", masklen = 24)
self.assertEqual(node2.network, "ff00::")
self.assertEqual(node2.prefixlen, 24)
self.assert_(node is not node2)
def test_02__node_userdata(self):
tree = radix.Radix()
node = tree.add(network = "10.0.0.0", masklen=28)
node.data["blah"] = "abc123"
node.data["foo"] = 12345
self.assertEqual(node.data["blah"], "abc123")
self.assertEqual(node.data["foo"], 12345)
self.assertRaises(AttributeError, lambda x: x.nonexist, node)
del node.data["blah"]
self.assertRaises(KeyError, lambda x: x.data["blah"], node)
def test_03__search_exact(self):
tree = radix.Radix()
node1 = tree.add("10.0.0.0/8")
node2 = tree.add("10.0.0.0/16")
node3 = tree.add("10.0.0.0/24")
node2.data["foo"] = 12345
node = tree.search_exact("127.0.0.1")
self.assertEqual(node, None)
node = tree.search_exact("10.0.0.0")
self.assertEqual(node, None)
node = tree.search_exact("10.0.0.0/24")
self.assertEqual(node, node3)
node = tree.search_exact("10.0.0.0/8")
self.assertEqual(node, node1)
node = tree.search_exact("10.0.0.0/16")
self.assertEqual(node.data["foo"], 12345)
def test_04__search_best(self):
tree = radix.Radix()
node1 = tree.add("10.0.0.0/8")
node2 = tree.add("10.0.0.0/16")
node3 = tree.add("10.0.0.0/24")
node = tree.search_best("127.0.0.1")
self.assertEqual(node, None)
node = tree.search_best("10.0.0.0")
self.assertEqual(node, node3)
node = tree.search_best("10.0.0.0/24")
self.assertEqual(node, node3)
node = tree.search_best("10.0.1.0/24")
self.assertEqual(node, node2)
def test_05__concurrent_trees(self):
tree1 = radix.Radix()
node1_1 = tree1.add("20.0.0.0/8")
node1_1 = tree1.add("10.0.0.0/8")
node1_2 = tree1.add("10.0.0.0/16")
node1_3 = tree1.add("10.0.0.0/24")
node1_3.data["blah"] = 12345
tree2 = radix.Radix()
node2_1 = tree2.add("30.0.0.0/8")
node2_1 = tree2.add("10.0.0.0/8")
node2_2 = tree2.add("10.0.0.0/16")
node2_3 = tree2.add("10.0.0.0/24")
node2_3.data["blah"] = 45678
self.assertNotEqual(tree1, tree2)
self.assertNotEqual(node1_2, node2_2)
node = tree1.search_best("10.0.1.0/24")
self.assertEqual(node, node1_2)
self.assertNotEqual(node, node2_2)
node = tree2.search_best("20.0.0.0/24")
self.assertEqual(node, None)
node = tree2.search_best("10.0.0.10")
self.assertEqual(node.data["blah"], 45678)
def test_06__deletes(self):
tree = radix.Radix()
node1 = tree.add("10.0.0.0/8")
node3 = tree.add("10.0.0.0/24")
tree.delete("10.0.0.0/24")
self.assertRaises(KeyError, tree.delete, "127.0.0.1")
self.assertRaises(KeyError, tree.delete, "10.0.0.0/24")
node = tree.search_best("10.0.0.10")
self.assertEqual(node, node1)
def test_07__nodes(self):
tree = radix.Radix()
prefixes = [
"10.0.0.0/8", "127.0.0.1/32",
"10.1.0.0/16", "10.100.100.100/32",
"abcd:ef12::/32", "abcd:ef01:2345:6789::/64", "::1/128"
]
prefixes.sort()
for prefix in prefixes:
tree.add(prefix)
nodes = tree.nodes()
addrs = list(map(lambda x: x.prefix, nodes))
addrs.sort()
self.assertEqual(addrs, prefixes)
def test_08__nodes_empty_tree(self):
tree = radix.Radix()
nodes = tree.nodes()
self.assertEqual(nodes, [])
def test_09__prefixes(self):
tree = radix.Radix()
prefixes = [
"10.0.0.0/8", "127.0.0.1/32",
"10.1.0.0/16", "10.100.100.100/32",
"abcd:ef12::/32", "abcd:ef01:2345:6789::/64", "::1/128"
]
prefixes.sort()
for prefix in prefixes:
tree.add(prefix)
addrs = tree.prefixes()
addrs.sort()
self.assertEqual(addrs, prefixes)
def test_10__use_after_free(self):
tree = radix.Radix()
node1 = tree.add("10.0.0.0/8")
del tree
self.assertEquals(node1.prefix, "10.0.0.0/8")
def test_11__unique_instance(self):
tree = radix.Radix()
node1 = tree.add("10.0.0.0/8")
node2 = tree.add("10.0.0.0/8")
self.assert_(node1 is node2)
self.assert_(node1.prefix is node2.prefix)
def test_12__inconsistent_masks4(self):
tree = radix.Radix()
node1 = tree.add("10.255.255.255", 28)
node2 = tree.add(network = "10.255.255.240/28")
node3 = tree.add(network = "10.255.255.252", masklen = 28)
self.assert_(node1 is node2)
self.assert_(node1 is node3)
self.assertEquals(node1.prefix, "10.255.255.240/28")
def test_13__inconsistent_masks6(self):
tree = radix.Radix()
node1 = tree.add("dead:beef:1234:5678::", 32)
node2 = tree.add(network = "dead:beef:8888:9999::/32")
node3 = tree.add(network = "dead:beef::", masklen = 32)
self.assert_(node1 is node2)
self.assert_(node1 is node3)
self.assertEquals(node1.prefix, "dead:beef::/32")
def test_14__packed_addresses4(self):
tree = radix.Radix()
p = struct.pack('4B', 0xe0, 0x14, 0x0b, 0x40)
node = tree.add(packed = p, masklen = 26)
self.assertEquals(node.family, socket.AF_INET)
self.assertEquals(node.prefix, "224.20.11.64/26")
self.assertEquals(node.packed, p)
def test_15__packed_addresses6(self):
tree = radix.Radix()
p = struct.pack('16B',
0xde, 0xad ,0xbe, 0xef, 0x12, 0x34, 0x56 ,0x78,
0x9a, 0xbc, 0xde, 0xf0, 0x00, 0x00, 0x00, 0x00)
node = tree.add(packed = p, masklen = 108)
self.assertEquals(node.family, socket.AF_INET6)
self.assertEquals(node.prefix, "dead:beef:1234:5678:9abc:def0::/108")
self.assertEquals(node.packed, p)
def test_16__bad_addresses(self):
tree = radix.Radix()
self.assertRaises(TypeError, tree.add)
self.assertRaises(ValueError, tree.add, "blah/32")
self.assertRaises(ValueError, tree.add, "blah", 32)
self.assertRaises(ValueError, tree.add, "127.0.0.1", -2)
self.assertRaises(ValueError, tree.add, "127.0.0.1", 64)
self.assertRaises(ValueError, tree.add, "::", -2)
self.assertRaises(ValueError, tree.add, "::", 256)
self.assertEquals(len(tree.nodes()), 0)
def test_17__mixed_address_family(self):
tree = radix.Radix()
node1 = tree.add("255.255.255.255", 32)
node2 = tree.add("ffff::/32")
node1_o = tree.search_best("255.255.255.255")
node2_o = tree.search_best("ffff::")
self.assert_(node1 is node1_o)
self.assert_(node2 is node2_o)
self.assertNotEquals(node1.prefix, node2.prefix)
self.assertNotEquals(node1.network, node2.network)
self.assertNotEquals(node1.family, node2.family)
def test_18__iterator(self):
tree = radix.Radix()
prefixes = [
"::1/128", "2000::/16", "2000::/8", "dead:beef::/64",
"ffff::/16", "10.0.0.0/8", "a00::/8", "255.255.0.0/16",
"::/0", "0.0.0.0/0"
]
prefixes.sort()
for prefix in prefixes:
tree.add(prefix)
iterprefixes = []
for node in tree:
iterprefixes.append(node.prefix)
iterprefixes.sort()
self.assertEqual(iterprefixes, prefixes)
def test_19__iterate_on_empty(self):
tree = radix.Radix()
prefixes = []
for node in tree:
prefixes.append(node.prefix)
self.assertEqual(prefixes, [])
def test_20__iterate_and_modify_tree(self):
tree = radix.Radix()
prefixes = [
"::1/128", "2000::/16", "2000::/8", "dead:beef::/64",
"0.0.0.0/8", "127.0.0.1/32"
]
prefixes.sort()
for prefix in prefixes:
tree.add(prefix)
def iter_mod(t):
[t.delete(x.prefix) for x in t]
self.assertRaises(RuntimeWarning, iter_mod, tree)
def test_21__lots_of_prefixes(self):
tree = radix.Radix()
num_nodes_in = 0
for i in range(0,128):
for j in range(0,128):
k = ((i + j) % 8) + 24
node = tree.add("1.%d.%d.0" % (i, j), k)
node.data["i"] = i
node.data["j"] = j
num_nodes_in += 1
num_nodes_del = 0
for i in range(0,128,5):
for j in range(0,128,3):
k = ((i + j) % 8) + 24
tree.delete("1.%d.%d.0" % (i, j), k)
num_nodes_del += 1
num_nodes_out = 0
for node in tree:
i = node.data["i"]
j = node.data["j"]
k = ((i + j) % 8) + 24
prefix = "1.%d.%d.0/%d" % (i, j, k)
self.assertEquals(node.prefix, prefix)
num_nodes_out += 1
self.assertEquals(num_nodes_in - num_nodes_del, num_nodes_out)
self.assertEquals(num_nodes_in - num_nodes_del,
len(tree.nodes()))
def test_22__broken_sanitise(self):
tree = radix.Radix()
node = tree.add("255.255.255.255/15")
self.assertEquals(node.prefix, "255.254.0.0/15")
def test_21__pickle(self):
tree = radix.Radix()
num_nodes_in = 0
for i in range(0,128):
for j in range(0,128):
k = ((i + j) % 8) + 24
addr = "1.%d.%d.0" % (i, j)
node = tree.add(addr, k)
node.data["i"] = i
node.data["j"] = j
num_nodes_in += 1
tree_pickled = pickle.dumps(tree)
del tree
tree2 = pickle.loads(tree_pickled)
for i in range(0,128):
for j in range(0,128):
k = ((i + j) % 8) + 24
addr = "1.%d.%d.0" % (i, j)
node = tree2.search_exact(addr, k)
self.assertNotEquals(node, None)
self.assertEquals(node.data["i"], i)
self.assertEquals(node.data["j"], j)
node.data["j"] = j
self.assertEquals(len(tree2.nodes()), num_nodes_in)
def test_21__cpickle(self):
if sys.version_info[0] >= 3:
return
tree = radix.Radix()
num_nodes_in = 0
for i in range(0,128):
for j in range(0,128):
k = ((i + j) % 8) + 24
addr = "1.%d.%d.0" % (i, j)
node = tree.add(addr, k)
node.data["i"] = i
node.data["j"] = j
num_nodes_in += 1
tree_pickled = cPickle.dumps(tree)
del tree
tree2 = cPickle.loads(tree_pickled)
for i in range(0,128):
for j in range(0,128):
k = ((i + j) % 8) + 24
addr = "1.%d.%d.0" % (i, j)
node = tree2.search_exact(addr, k)
self.assertNotEquals(node, None)
self.assertEquals(node.data["i"], i)
self.assertEquals(node.data["j"], j)
node.data["j"] = j
self.assertEquals(len(tree2.nodes()), num_nodes_in)
def test_22_search_best(self):
tree = radix.Radix()
tree.add('10.0.0.0/8')
tree.add('10.0.0.0/13')
tree.add('10.0.0.0/16')
self.assertEquals(tree.search_best('10.0.0.0/15').prefix,
'10.0.0.0/13')
def main():
unittest.main()
if __name__ == '__main__':
main()