-
Notifications
You must be signed in to change notification settings - Fork 20
Expand file tree
/
Copy pathbpptree_printer.py
More file actions
executable file
·448 lines (378 loc) · 15.4 KB
/
Copy pathbpptree_printer.py
File metadata and controls
executable file
·448 lines (378 loc) · 15.4 KB
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
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
"""GDB pretty-printer for b_plus_plus_tree (bpptree.h).
Usage:
(gdb) source /path/to/bpptree_printer.py
Supports live debugging and core dumps. Compatible with Python 2/3.
Covers the type alias families exposed via bpptree.h / bpptree_set.h /
bpptree_map.h: `b_plus_plus_tree<config>` and the user-facing aliases
`bpptree_set`, `bpptree_multiset`, `bpptree_map`, `bpptree_multimap` (all of
which are `using`-aliases for `b_plus_plus_tree<...>`, so the underlying
GDB type name matches `b_plus_plus_tree`).
"""
try:
import lldb as _aime_lldb
_AIME_USING_LLDB = True
except ImportError:
_AIME_USING_LLDB = False
import gdb # noqa: F401
if _AIME_USING_LLDB:
# LLDB-only branch: build a fake `gdb` module so the body Printer code
# (which uses gdb.* APIs) can run unchanged under LLDB. We deliberately
# do NOT rely on `try: import gdb` for environment detection, because
# once any printer file installs the fake module into sys.modules['gdb'],
# subsequent printer files would observe a successful `import gdb` and
# misdetect as a GDB session.
import sys as _aime_sys
_aime_target = None
class _AimeType(object):
def __init__(self, t):
self._t = t
@property
def name(self):
n = self._t.GetName()
return n if n else None
def __str__(self):
return self.name or ''
def strip_typedefs(self):
return _AimeType(self._t.GetCanonicalType())
def pointer(self):
return _AimeType(self._t.GetPointerType())
def range(self):
elem = self._t.GetArrayElementType()
n = self._t.GetByteSize() // elem.GetByteSize()
return (0, n - 1)
class _AimeValue(object):
def __init__(self, sb):
self._sb = sb
if sb is not None and sb.IsValid():
global _aime_target
_aime_target = sb.GetTarget()
def __getitem__(self, key):
sb = self._sb
if isinstance(key, str):
return _AimeValue(sb.GetChildMemberWithName(key))
t = sb.GetType()
if t.IsArrayType():
return _AimeValue(sb.GetChildAtIndex(int(key)))
pointee = t.GetPointeeType()
base = sb.GetValueAsUnsigned()
addr = base + int(key) * pointee.GetByteSize()
target = _aime_target
new_sb = target.CreateValueFromAddress(
"[%d]" % int(key),
_aime_lldb.SBAddress(addr, target), pointee)
return _AimeValue(new_sb)
def cast(self, ttype):
return _AimeValue(self._sb.Cast(ttype._t))
def dereference(self):
return _AimeValue(self._sb.Dereference())
@property
def address(self):
return _AimeValue(self._sb.AddressOf())
@property
def type(self):
return _AimeType(self._sb.GetType())
def __int__(self):
return self._sb.GetValueAsUnsigned()
def __index__(self):
return self.__int__()
def __long__(self):
return self.__int__()
def __eq__(self, other):
if isinstance(other, _AimeValue):
return int(self) == int(other)
try:
return int(self) == int(other)
except Exception:
return NotImplemented
def __ne__(self, other):
r = self.__eq__(other)
if r is NotImplemented:
return r
return not r
def __hash__(self):
return int(self)
def __add__(self, n):
sb = self._sb
t = sb.GetType()
if t.IsPointerType():
pointee = t.GetPointeeType()
base = sb.GetValueAsUnsigned()
else:
pointee = t.GetArrayElementType()
base = sb.GetLoadAddress()
addr = base + int(n) * pointee.GetByteSize()
target = _aime_target
new_sb = target.CreateValueFromAddress(
"_p", _aime_lldb.SBAddress(addr, target), pointee)
return _AimePointer(new_sb, pointee, addr, target)
def __sub__(self, other):
if isinstance(other, _AimeValue):
return int(self) - int(other)
return int(self) - int(other)
def __str__(self):
v = self._sb.GetValue()
return v if v is not None else ''
class _AimePointer(_AimeValue):
# Pointer-like value produced by `ptr + i` or by casting a raw int.
# Subscripting [int] indexes from this position; [str] does field
# access on the pointee.
def __init__(self, sb_pointee, pointee_type, addr, target):
self._sb = sb_pointee
self._pointee = pointee_type
self._addr = addr
self._target = target
global _aime_target
_aime_target = target
def __getitem__(self, key):
if isinstance(key, str):
return _AimeValue(self._sb.GetChildMemberWithName(key))
offset = int(key)
addr = self._addr + offset * self._pointee.GetByteSize()
new_sb = self._target.CreateValueFromAddress(
"[%d]" % offset,
_aime_lldb.SBAddress(addr, self._target), self._pointee)
return _AimeValue(new_sb)
def __int__(self):
return self._addr
def __add__(self, n):
addr = self._addr + int(n) * self._pointee.GetByteSize()
new_sb = self._target.CreateValueFromAddress(
"_p", _aime_lldb.SBAddress(addr, self._target),
self._pointee)
return _AimePointer(new_sb, self._pointee, addr, self._target)
class _AimeRawAddr(object):
# Wraps a raw integer address; only meaningful after .cast(ptr_type).
def __init__(self, addr):
self._addr = int(addr)
def cast(self, ttype):
target = _aime_target
if target is None:
target = _aime_lldb.debugger.GetSelectedTarget()
ptr_t = ttype._t
pointee = ptr_t.GetPointeeType()
new_sb = target.CreateValueFromAddress(
"_p", _aime_lldb.SBAddress(self._addr, target), pointee)
return _AimePointer(new_sb, pointee, self._addr, target)
def __int__(self):
return self._addr
class _AimeFakeGdb(object):
error = Exception
pretty_printers = []
class ValuePrinter(object):
pass
@staticmethod
def lookup_type(name):
target = _aime_target
if target is None:
target = _aime_lldb.debugger.GetSelectedTarget()
types = target.FindTypes(name)
if types.GetSize() == 0:
raise Exception("type not found: %s" % name)
return _AimeType(types.GetTypeAtIndex(0))
@staticmethod
def parse_and_eval(expr):
target = _aime_target
if target is None:
target = _aime_lldb.debugger.GetSelectedTarget()
return _AimeValue(target.EvaluateExpression(expr))
@staticmethod
def Value(x):
return _AimeRawAddr(x)
_aime_fake_gdb = _AimeFakeGdb()
_aime_sys.modules['gdb'] = _aime_fake_gdb
import gdb # noqa: F401
def _aime_register_lldb_provider(debugger, type_regex, klass, short):
printer_klass = klass
class _Provider(object):
def __init__(self, valobj, internal_dict):
self.valobj = valobj
self._items = []
self._build()
def _build(self):
self._items = []
try:
wrapped = _AimeValue(self.valobj.GetNonSyntheticValue())
p = printer_klass(short, wrapped)
for k, v in p.children():
self._items.append((k, v))
except Exception:
pass
def num_children(self):
return len(self._items)
def has_children(self):
return True
def get_child_index(self, name):
for i, (k, _) in enumerate(self._items):
if k == name:
return i
return -1
def get_child_at_index(self, idx):
if idx < 0 or idx >= len(self._items):
return None
name, val = self._items[idx]
sb = val._sb if isinstance(val, _AimeValue) else val
t = sb.GetType()
addr = sb.GetLoadAddress()
if addr != _aime_lldb.LLDB_INVALID_ADDRESS:
return self.valobj.CreateValueFromAddress(name, addr, t)
return self.valobj.CreateValueFromData(
name, sb.GetData(), t)
def update(self):
self._build()
return False
def _summary_fn(valobj, internal_dict):
try:
wrapped = _AimeValue(valobj.GetNonSyntheticValue())
p = printer_klass(short, wrapped)
return p.to_string()
except Exception as e:
return '<aime-error: %s>' % e
provider_name = "_AimeProvider_%s" % short
summary_name = "_aime_summary_%s" % short
g = globals()
g[provider_name] = _Provider
g[summary_name] = _summary_fn
mod = __name__
debugger.HandleCommand(
'type synthetic add -l %s.%s -x "%s"'
% (mod, provider_name, type_regex))
debugger.HandleCommand(
'type summary add -F %s.%s -e -x "%s"'
% (mod, summary_name, type_regex))
import sys
if sys.version_info[0] > 2:
Iterator = object
else:
class Iterator(object):
def next(self):
return self.__next__()
PrinterBase = gdb.ValuePrinter if hasattr(gdb, 'ValuePrinter') else object
# ---------------------------------------------------------------------------
# Relevant structures from bpptree.h:
#
# struct node_t { node_t *parent; size_t level; };
# struct child_slot_t { size_t size; node_t *ptr; };
# struct inner_node_t : node_t
# { child_slot_t children[max+1]; key_type item[max]; };
# // Empty slots are encoded by children[i].ptr == nullptr (sentinel).
# // No `used` field is stored.
# struct leaf_node_t : node_t
# { node_t *prev; node_t *next; storage_type item[max]; };
# // Leaf size is NOT stored on the leaf itself.
# // It lives in the parent slot's child_slot_t.size, except for the
# // single-leaf-tree case where it lives in root_.size.
# struct root_node_t : node_t, ...
# { size_t size; node_t *left; node_t *right; };
# // root_.size = total element count of the whole tree
# // root_.left = leftmost leaf (or &root_ when the tree is empty)
# // root_.parent = root inner node (or self when the tree is empty)
#
# Iteration order (in-order over leaves):
# leaf = root_.left
# while leaf != &root_:
# sz = leaf_size(leaf)
# for i in 0..sz-1: yield leaf->item[i]
# leaf = leaf->next
# ---------------------------------------------------------------------------
class BpptreePrinter(PrinterBase):
"""Print a b_plus_plus_tree."""
class BpptreeIterator(Iterator):
def __init__(self, val, leaf_type, inner_type, item_type, total):
self._val = val
self._leaf_type = leaf_type
self._inner_type = inner_type
self._item_type = item_type
self._root_addr = int(val['root_'].address)
self._total = int(total)
self._index = 0 # global element index (output key)
self._leaf = None # current leaf_node_t* (gdb.Value)
self._leaf_size = 0
self._leaf_pos = 0
self._prime()
def __iter__(self):
return self
# Locate the first leaf and its size. May leave _leaf as None when
# the tree is empty.
def _prime(self):
if self._total == 0:
return
leaf_node = self._val['root_']['left']
if int(leaf_node) == self._root_addr:
return
self._leaf = leaf_node.cast(self._leaf_type.pointer())
self._leaf_size = self._leaf_size_of(self._leaf)
self._leaf_pos = 0
# leaf size lives in the parent slot, except for single-leaf trees
# where the leaf's parent is &root_ and the size lives in root_.size.
def _leaf_size_of(self, leaf_ptr):
parent = leaf_ptr['parent']
if int(parent) == self._root_addr:
return int(self._val['root_']['size'])
inner = parent.cast(self._inner_type.pointer())
children = inner['children']
leaf_addr = int(leaf_ptr)
# children has length max+1; scan until ptr matches.
n = children.type.range()[1] + 1
for i in range(n):
slot = children[i]
if int(slot['ptr']) == leaf_addr:
return int(slot['size'])
return 0 # should not happen with a well-formed tree
def _advance_leaf(self):
nxt = self._leaf['next']
if int(nxt) == self._root_addr:
self._leaf = None
return
self._leaf = nxt.cast(self._leaf_type.pointer())
self._leaf_size = self._leaf_size_of(self._leaf)
self._leaf_pos = 0
def __next__(self):
while True:
if self._leaf is None or self._index >= self._total:
raise StopIteration
if self._leaf_pos >= self._leaf_size:
self._advance_leaf()
continue
item = self._leaf['item'][self._leaf_pos]
key = '[%d]' % self._index
self._leaf_pos += 1
self._index += 1
return (key, item)
def __init__(self, typename, val):
self._typename = typename
self._val = val
gdb_type = val.type.strip_typedefs()
type_name = gdb_type.name or str(gdb_type)
self._tname = type_name
try:
self._value_type = gdb.lookup_type('%s::value_type' % type_name)
except gdb.error:
self._value_type = None
self._leaf_type = gdb.lookup_type('%s::leaf_node_t' % type_name)
self._inner_type = gdb.lookup_type('%s::inner_node_t' % type_name)
def to_string(self):
count = int(self._val['root_']['size'])
vname = self._value_type.name if self._value_type else '?'
return '%s<%s> with %d items' % (self._typename, vname, count)
def children(self):
total = int(self._val['root_']['size'])
return self.BpptreeIterator(
self._val, self._leaf_type, self._inner_type,
self._value_type, total)
def display_hint(self):
return 'array'
def _bpptree_lookup(val):
try:
name = str(val.type.strip_typedefs())
except Exception:
return None
bare = name.split('<', 1)[0].rsplit('::', 1)[-1]
if bare == 'b_plus_plus_tree':
return BpptreePrinter('bpptree', val)
return None
gdb.pretty_printers.append(_bpptree_lookup)
def __lldb_init_module(debugger, internal_dict):
if _AIME_USING_LLDB:
_aime_register_lldb_provider(
debugger, r'^(.*::)?b_plus_plus_tree<.*>$',
BpptreePrinter, 'bpptree')