-
Notifications
You must be signed in to change notification settings - Fork 12
/
cjdnsmap.py
executable file
·352 lines (322 loc) · 10.1 KB
/
cjdnsmap.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
#!/usr/bin/env python
#
# cjdnsmap.py (c) 2012 Gerard Krol
#
# You may redistribute this program and/or modify it under the terms of
# the GNU General Public License as published by the Free Software Foundation,
# either version 3 of the License, or (at your option) any later version.
#
# This program is distributed in the hope that it will be useful,
# but WITHOUT ANY WARRANTY; without even the implied warranty of
# MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
# GNU General Public License for more details.
#
# You should have received a copy of the GNU General Public License
# along with this program. If not, see <http://www.gnu.org/licenses/>.
#
# Todo:
# - Color nodes depending on the number of connections
#
import pydot
import re
import socket
import httplib2
import sys
import math
#################################################
# code from http://effbot.org/zone/bencode.htm
# Fredrik Lundh
#
# Unless otherwise noted, source code can be be used freely. Examples,
# test scripts and other short code fragments can be considered as
# being in the public domain. Downloads usually include a README file
# that includes the relevant copyright/license information.
def tokenize(text, match=re.compile("([idel])|(\d+):|(-?\d+)").match):
i = 0
while i < len(text):
m = match(text, i)
s = m.group(m.lastindex)
i = m.end()
if m.lastindex == 2:
yield "s"
yield text[i:i+int(s)]
i = i + int(s)
else:
yield s
def decode_item(next, token):
if token == "i":
# integer: "i" value "e"
data = int(next())
if next() != "e":
raise ValueError
elif token == "s":
# string: "s" value (virtual tokens)
data = next()
elif token == "l" or token == "d":
# container: "l" (or "d") values "e"
data = []
tok = next()
while tok != "e":
data.append(decode_item(next, tok))
tok = next()
if token == "d":
data = dict(zip(data[0::2], data[1::2]))
else:
raise ValueError
return data
def decode(text):
try:
src = tokenize(text)
data = decode_item(src.next, src.next())
for token in src: # look for more tokens
raise SyntaxError("trailing junk")
except (AttributeError, ValueError, StopIteration):
raise SyntaxError("syntax error")
return data
# end code from http://effbot.org/zone/bencode.htm
###################################################
###################################################
def hsv_to_rgb(h,s,v):
""" convert hsv to rgb. h is 0-360, s and v are 0-1"""
r = 0.0
g = 0.0
b = 0.0
chroma = v * s
h_dash = h / 60.0
x = chroma * (1.0 - math.fabs((h_dash % 2.0) - 1.0))
if h_dash < 1.0:
r = chroma
g = x
elif h_dash < 2.0:
r = x
g = chroma
elif h_dash < 3.0:
g = chroma
b = x
elif h_dash < 4.0:
g = x
b = chroma
elif h_dash < 5.0:
r = x
b = chroma
elif h_dash < 6.0:
r = chroma
b = x
m = v - chroma
r += m
g += m
b += m
return (r,g,b)
def hsv_to_color(h,s,v):
r,g,b = hsv_to_rgb(h,s,v)
return '#{0:02x}{1:02x}{2:02x}'.format(int(r*255),int(g*255),int(b*255))
###################################################
class route:
def __init__(self, ip, name, path, link):
self.ip = ip
self.name = name
route = path
route = route.replace('.','')
route = route.replace('0','x')
route = route.replace('1','y')
route = route.replace('f','1111')
route = route.replace('e','1110')
route = route.replace('d','1101')
route = route.replace('c','1100')
route = route.replace('b','1011')
route = route.replace('a','1010')
route = route.replace('9','1001')
route = route.replace('8','1000')
route = route.replace('7','0111')
route = route.replace('6','0110')
route = route.replace('5','0101')
route = route.replace('4','0100')
route = route.replace('3','0011')
route = route.replace('2','0010')
route = route.replace('y','0001')
route = route.replace('x','0000')
self.route = route[::-1].rstrip('0')[:-1]
self.quality = link / 536870.0 # LINK_STATE_MULTIPLIER
def find_parent(self, routes):
parents = [(len(other.route),other) for other in routes if self.route.startswith(other.route) and self != other]
parents.sort(reverse=True)
if parents:
parent = parents[0][1]
return parent
return None
if len(sys.argv) > 1:
filename = sys.argv[-1]
else:
filename = 'map.png'
# retrieve the node names from the page maintained by ircerr
page = 'http://[fc38:4c2c:1a8f:3981:f2e7:c2b9:6870:6e84]/ipv6-cjdnet.data.txt'
print('Downloading the list of node names from {0} ...'.format(page))
names = {}
h = httplib2.Http(".cache")
r, content = h.request(page, "GET")
existing_names = set()
doubles = set()
nameip = []
for l in content.split('\n'):
l = l.strip()
if not l or l.startswith('#'):
continue
d = l.split(' ')
if len(d) < 2:
continue # use the standard last two bytes
ip = d[0]
name = d[1]
nameip.append((name,ip))
if name in existing_names:
doubles.add(name)
existing_names.add(name)
for name,ip in nameip:
if not name in doubles:
names[ip]=name
else:
names[ip]=name + ' ' + ip.split(':')[-1]
# retrieve the routing data from the admin interface
# FIXME: read these from the commandline or even from the config
HOST = 'localhost'
PORT = 11234
print('Retrieving the routing table from the admin interface at {0} port {1}'.format(HOST,PORT))
s = socket.socket(socket.AF_INET, socket.SOCK_STREAM)
s.connect((HOST, PORT))
s.send('d1:q19:NodeStore_dumpTable4:txid4:....e')
data = ''
while True:
r = s.recv(1024)
data += r
if not r or r.endswith('....e\n'):
break
s.shutdown(socket.SHUT_RDWR)
s.close()
data = data.strip()
bencode = decode(data)
routes = []
for r in bencode['routingTable']:
ip = r['ip']
path = r['path']
link = r['link']
if ip in names:
name = names[ip]
else:
name = ip.split(':')[-1]
r = route(ip,name,path,link)
routes.append(r)
# sort the routes on quality
tmp = [(r.quality,r) for r in routes]
tmp.sort(reverse=True)
routes = [q[1] for q in tmp]
family_set = set()
family_list = []
class MyNode:
def __init__(self, name):
self.name = name
self.connections = 0
self.active_connections = 0
p = self.name.split('.')
if len(p) == 1:
self.family = None
else:
self.family = '.'.join(p[1::])
if not self.family in family_set:
family_set.add(self.family)
family_list.append(self.family)
def Node(self):
if self.active_connections:
color = 'black'
if self.name in existing_names:
fontcolor = 'black'
else:
fontcolor = 'black'
if not self.family:
fillcolor = 'white'
else:
h = family_hues[self.family]
s = 0.3
v = 1.0
fillcolor = hsv_to_color(h,s,v)
else:
if not self.family:
h = 0.0
s = 0.0
v = 0.6
else:
h = family_hues[self.family]
s = 0.5
v = 0.7
color = hsv_to_color(h,s,v)
fontcolor = color
fillcolor = 'white'
self.node = pydot.Node(self.name, shape='box', color=color, fontcolor=fontcolor, style='filled', fillcolor=fillcolor)
return self.node
family_hues = {}
def calculate_family_hues():
family_list.sort() # so they get the same color every time
for i,f in enumerate(family_list):
family_hues[f] = 360.0/len(family_list)*i
nodes = {}
for r in routes:
if not r.ip in nodes:
nodes[r.ip] = MyNode(r.name)
# we need to find the parents for every node and draw a line
# to do this we take the route and find the node with the longest
# overlap at the end
# we then assume this is the parent
link_strength = {}
def linked(a,b):
a,b = sorted([a,b])
return (a,b) in link_strength
def set_link_strength(a,b,s):
a,b = sorted([a,b])
if not linked(a,b):
link_strength[(a,b)] = s
else:
l = link_strength[(a,b)]
if s > l:
link_strength[(a,b)] = s
edges = []
def add_edges(active,color):
for r in routes:
if active and r.quality == 0:
continue
if not active and r.quality > 0:
continue
parent = r.find_parent(routes)
if parent:
pn = nodes[parent.ip]
rn = nodes[r.ip]
if not linked(pn,rn):
pn.connections += 1
rn.connections += 1
if active:
weight = '1'
pn.active_connections += 1
rn.active_connections += 1
else:
weight = '0.01'
edges.append((pn,rn,weight,color,r.quality))
set_link_strength(pn,rn,r.quality)
add_edges(True,'black')
add_edges(False,'grey')
graph = pydot.Dot(graph_type='graph', K='2', splines='true', dpi='50', maxiter='10000', ranksep='2', nodesep='1', epsilon='0.1', overlap='true')
calculate_family_hues()
for n in nodes.itervalues():
graph.add_node(n.Node())
for pn,rn,weight,color,quality in edges:
width = math.log(float(quality)+1)
if width < 1:
width = 1
style = 'setlinewidth({0})'.format(width)
len = '0.5'
minlen = '0.5'
if quality > 0:
len = str(6/width)
if pn.connections == 1 or rn.connections == 1:
weight = '1'
edge = pydot.Edge(pn.node,rn.node, color=color, len=len, weight=weight, minlen=minlen, style=style)
graph.add_edge(edge)
print('Generating the map...')
graph.write_png(filename, prog='fdp') # dot neato twopi fdp circo
print('Map written to {0}'.format(filename))