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
|
# By Peter V. Saveliev https://pypi.python.org/pypi/pyroute2. Dual licensed under the Apache 2 and GPLv2+ see https://github.com/svinota/pyroute2 for License details.
# -*- coding: utf-8 -*-
'''
Common utilities
'''
import re
import os
import sys
import types
import struct
import platform
import threading
from socket import inet_aton
try:
basestring = basestring
except NameError:
basestring = (str, bytes)
AF_PIPE = 255 # Right now AF_MAX == 40
DEFAULT_RCVBUF = 16384
ANCIENT = (platform.dist()[0] in ('redhat', 'centos') and
platform.dist()[1].startswith('6.') or
os.environ.get('PYROUTE2_ANCIENT', False))
size_suffixes = {'b': 1,
'k': 1024,
'kb': 1024,
'm': 1024 * 1024,
'mb': 1024 * 1024,
'g': 1024 * 1024 * 1024,
'gb': 1024 * 1024 * 1024,
'kbit': 1024 / 8,
'mbit': 1024 * 1024 / 8,
'gbit': 1024 * 1024 * 1024 / 8}
time_suffixes = {'s': 1,
'sec': 1,
'secs': 1,
'ms': 1000,
'msec': 1000,
'msecs': 1000,
'us': 1000000,
'usec': 1000000,
'usecs': 1000000}
rate_suffixes = {'bit': 1,
'Kibit': 1024,
'kbit': 1000,
'mibit': 1024 * 1024,
'mbit': 1000000,
'gibit': 1024 * 1024 * 1024,
'gbit': 1000000000,
'tibit': 1024 * 1024 * 1024 * 1024,
'tbit': 1000000000000,
'Bps': 8,
'KiBps': 8 * 1024,
'KBps': 8000,
'MiBps': 8 * 1024 * 1024,
'MBps': 8000000,
'GiBps': 8 * 1024 * 1024 * 1024,
'GBps': 8000000000,
'TiBps': 8 * 1024 * 1024 * 1024 * 1024,
'TBps': 8000000000000}
##
# General purpose
#
class Dotkeys(dict):
'''
This is a sick-minded hack of dict, intended to be an eye-candy.
It allows to get dict's items byt dot reference:
ipdb["lo"] == ipdb.lo
ipdb["eth0"] == ipdb.eth0
Obviously, it will not work for some cases, like unicode names
of interfaces and so on. Beside of that, it introduces some
complexity.
But it simplifies live for old-school admins, who works with good
old "lo", "eth0", and like that naming schemes.
'''
var_name = re.compile('^[a-zA-Z_]+[a-zA-Z_0-9]*$')
def __dir__(self):
return [i for i in self if
type(i) == str and self.var_name.match(i)]
def __getattribute__(self, key, *argv):
try:
return dict.__getattribute__(self, key)
except AttributeError as e:
if key == '__deepcopy__':
raise e
return self[key]
def __setattr__(self, key, value):
if key in self:
self[key] = value
else:
dict.__setattr__(self, key, value)
def __delattr__(self, key):
if key in self:
del self[key]
else:
dict.__delattr__(self, key)
def map_namespace(prefix, ns, normalize=None):
'''
Take the namespace prefix, list all constants and build two
dictionaries -- straight and reverse mappings. E.g.:
## neighbor attributes
NDA_UNSPEC = 0
NDA_DST = 1
NDA_LLADDR = 2
NDA_CACHEINFO = 3
NDA_PROBES = 4
(NDA_NAMES, NDA_VALUES) = map_namespace('NDA', globals())
Will lead to::
NDA_NAMES = {'NDA_UNSPEC': 0,
...
'NDA_PROBES': 4}
NDA_VALUES = {0: 'NDA_UNSPEC',
...
4: 'NDA_PROBES'}
The `normalize` parameter can be:
- None — no name transformation will be done
- True — cut the prefix and `lower()` the rest
- lambda x: … — apply the function to every name
'''
nmap = {None: lambda x: x,
True: lambda x: x[len(prefix):].lower()}
if not isinstance(normalize, types.FunctionType):
normalize = nmap[normalize]
by_name = dict([(normalize(i), ns[i]) for i in ns.keys()
if i.startswith(prefix)])
by_value = dict([(ns[i], normalize(i)) for i in ns.keys()
if i.startswith(prefix)])
return (by_name, by_value)
def dqn2int(mask):
'''
IPv4 dotted quad notation to int mask conversion
'''
return bin(struct.unpack('>L', inet_aton(mask))[0]).count('1')
def hexdump(payload, length=0):
'''
Represent byte string as hex -- for debug purposes
'''
if sys.version[0] == '3':
return ':'.join('{0:02x}'.format(c)
for c in payload[:length] or payload)
else:
return ':'.join('{0:02x}'.format(ord(c))
for c in payload[:length] or payload)
class AddrPool(object):
'''
Address pool
'''
cell = 0xffffffffffffffff
def __init__(self,
minaddr=0xf,
maxaddr=0xffffff,
reverse=False,
release=False):
self.cell_size = 0 # in bits
mx = self.cell
self.reverse = reverse
self.release = release
self.allocated = 0
if self.release:
assert isinstance(self.release, int)
self.ban = []
while mx:
mx >>= 8
self.cell_size += 1
self.cell_size *= 8
# calculate, how many ints we need to bitmap all addresses
self.cells = int((maxaddr - minaddr) / self.cell_size + 1)
# initial array
self.addr_map = [self.cell]
self.minaddr = minaddr
self.maxaddr = maxaddr
self.lock = threading.RLock()
def alloc(self):
with self.lock:
# gc self.ban:
for item in tuple(self.ban):
if item['counter'] == 0:
self.free(item['addr'])
self.ban.remove(item)
else:
item['counter'] -= 1
# iterate through addr_map
base = 0
for cell in self.addr_map:
if cell:
# not allocated addr
bit = 0
while True:
if (1 << bit) & self.addr_map[base]:
self.addr_map[base] ^= 1 << bit
break
bit += 1
ret = (base * self.cell_size + bit)
if self.reverse:
ret = self.maxaddr - ret
else:
ret = ret + self.minaddr
if self.minaddr <= ret <= self.maxaddr:
if self.release:
self.free(ret, ban=self.release)
self.allocated += 1
return ret
else:
self.free(ret)
raise KeyError('no free address available')
base += 1
# no free address available
if len(self.addr_map) < self.cells:
# create new cell to allocate address from
self.addr_map.append(self.cell)
return self.alloc()
else:
raise KeyError('no free address available')
def locate(self, addr):
if self.reverse:
addr = self.maxaddr - addr
else:
addr -= self.minaddr
base = addr // self.cell_size
bit = addr % self.cell_size
try:
is_allocated = not self.addr_map[base] & (1 << bit)
except IndexError:
is_allocated = False
return (base, bit, is_allocated)
def setaddr(self, addr, value):
assert value in ('free', 'allocated')
with self.lock:
base, bit, is_allocated = self.locate(addr)
if value == 'free' and is_allocated:
self.allocated -= 1
self.addr_map[base] |= 1 << bit
elif value == 'allocated' and not is_allocated:
self.allocated += 1
self.addr_map[base] &= ~(1 << bit)
def free(self, addr, ban=0):
with self.lock:
if ban != 0:
self.ban.append({'addr': addr,
'counter': ban})
else:
base, bit, is_allocated = self.locate(addr)
if len(self.addr_map) <= base:
raise KeyError('address is not allocated')
if self.addr_map[base] & (1 << bit):
raise KeyError('address is not allocated')
self.allocated -= 1
self.addr_map[base] ^= 1 << bit
|
