forked from scylladb/scylladb
-
Notifications
You must be signed in to change notification settings - Fork 1
/
scylla-gdb.py
3740 lines (2991 loc) · 140 KB
/
scylla-gdb.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
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
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
#!/usr/bin/env python3
# -*- coding: utf-8 -*-
import gdb
import gdb.printing
import uuid
import argparse
import re
from operator import attrgetter
from collections import defaultdict
import sys
import struct
import random
import bisect
import os
import subprocess
import time
import html
def template_arguments(gdb_type):
n = 0
while True:
try:
yield gdb_type.template_argument(n)
n += 1
except RuntimeError:
return
def get_template_arg_with_prefix(gdb_type, prefix):
for arg in template_arguments(gdb_type):
if str(arg).startswith(prefix):
return arg
def get_base_class_offset(gdb_type, base_class_name):
name_pattern = re.escape(base_class_name) + "(<.*>)?$"
for field in gdb_type.fields():
if field.is_base_class and re.match(name_pattern, field.name):
return field.bitpos / 8
class intrusive_list:
size_t = gdb.lookup_type('size_t')
def __init__(self, list_ref):
list_type = list_ref.type.strip_typedefs()
self.node_type = list_type.template_argument(0)
rps = list_ref['data_']['root_plus_size_']
try:
self.root = rps['root_']
except Exception:
# Some boost versions have this instead
self.root = rps['m_header']
member_hook = get_template_arg_with_prefix(list_type, "boost::intrusive::member_hook")
if not member_hook:
member_hook = get_template_arg_with_prefix(list_type, "struct boost::intrusive::member_hook")
if member_hook:
self.link_offset = member_hook.template_argument(2).cast(self.size_t)
else:
self.link_offset = get_base_class_offset(self.node_type, "boost::intrusive::list_base_hook")
if self.link_offset is None:
raise Exception("Class does not extend list_base_hook: " + str(self.node_type))
def __iter__(self):
hook = self.root['next_']
while hook != self.root.address:
node_ptr = hook.cast(self.size_t) - self.link_offset
yield node_ptr.cast(self.node_type.pointer()).dereference()
hook = hook['next_']
def __nonzero__(self):
return self.root['next_'] != self.root.address
def __bool__(self):
return self.__nonzero__()
class std_optional:
def __init__(self, ref):
self.ref = ref
def get(self):
try:
return self.ref['_M_payload']['_M_payload']['_M_value']
except gdb.error:
return self.ref['_M_payload'] # Scylla 3.0 compatibility
def __bool__(self):
return self.__nonzero__()
def __nonzero__(self):
try:
return bool(self.ref['_M_payload']['_M_engaged'])
except gdb.error:
return bool(self.ref['_M_engaged']) # Scylla 3.0 compatibility
class intrusive_set:
size_t = gdb.lookup_type('size_t')
def __init__(self, ref):
container_type = ref.type.strip_typedefs()
self.node_type = container_type.template_argument(0)
member_hook = get_template_arg_with_prefix(container_type, "boost::intrusive::member_hook")
if not member_hook:
raise Exception('Expected member_hook<> option not found in container\'s template parameters')
self.link_offset = member_hook.template_argument(2).cast(self.size_t)
self.root = ref['holder']['root']['parent_']
def __visit(self, node):
if node:
for n in self.__visit(node['left_']):
yield n
node_ptr = node.cast(self.size_t) - self.link_offset
yield node_ptr.cast(self.node_type.pointer()).dereference()
for n in self.__visit(node['right_']):
yield n
def __iter__(self):
for n in self.__visit(self.root):
yield n
class boost_variant:
def __init__(self, ref):
self.ref = ref
def which(self):
return self.ref['which_']
def type(self):
return self.ref.type.template_argument(self.ref['which_'])
def get(self):
return self.ref['storage_'].address.cast(self.type().pointer())
class std_variant:
"""Wrapper around and std::variant.
Call get() to access the current value.
"""
def __init__(self, ref):
self.ref = ref
self.member_types = list(template_arguments(self.ref.type))
def index(self):
return int(self.ref['_M_index'])
def get(self):
index = self.index()
variadic_union = self.ref['_M_u']
current_type = self.member_types[index].strip_typedefs()
for i in range(index):
variadic_union = variadic_union['_M_rest']
wrapper = variadic_union['_M_first']['_M_storage']
# literal types are stored directly in `_M_storage`.
if wrapper.type.strip_typedefs() == current_type:
return wrapper
# non-literal types are stored via a __gnu_cxx::__aligned_membuf
return wrapper['_M_storage'].reinterpret_cast(current_type.pointer()).dereference()
class std_map:
size_t = gdb.lookup_type('size_t')
def __init__(self, ref):
container_type = ref.type.strip_typedefs()
kt = container_type.template_argument(0)
vt = container_type.template_argument(1)
self.value_type = gdb.lookup_type('::std::pair<{} const, {} >'.format(str(kt), str(vt)))
self.root = ref['_M_t']['_M_impl']['_M_header']['_M_parent']
def __visit(self, node):
if node:
for n in self.__visit(node['_M_left']):
yield n
value = (node + 1).cast(self.value_type.pointer()).dereference()
yield value['first'], value['second']
for n in self.__visit(node['_M_right']):
yield n
def __iter__(self):
for n in self.__visit(self.root):
yield n
class intrusive_set_external_comparator:
size_t = gdb.lookup_type('size_t')
def __init__(self, ref):
container_type = ref.type.strip_typedefs()
self.node_type = container_type.template_argument(0)
self.link_offset = container_type.template_argument(1).cast(self.size_t)
self.root = ref['_header']['parent_']
def __visit(self, node):
if node:
for n in self.__visit(node['left_']):
yield n
node_ptr = node.cast(self.size_t) - self.link_offset
yield node_ptr.cast(self.node_type.pointer()).dereference()
for n in self.__visit(node['right_']):
yield n
def __iter__(self):
for n in self.__visit(self.root):
yield n
class std_array:
def __init__(self, ref):
self.ref = ref
def __len__(self):
elems = self.ref['_M_elems']
return elems.type.sizeof / elems[0].type.sizeof
def __iter__(self):
elems = self.ref['_M_elems']
count = self.__len__()
i = 0
while i < count:
yield elems[i]
i += 1
def __nonzero__(self):
return self.__len__() > 0
def __bool__(self):
return self.__nonzero__()
class std_vector:
def __init__(self, ref):
self.ref = ref
def __len__(self):
return int(self.ref['_M_impl']['_M_finish'] - self.ref['_M_impl']['_M_start'])
def __iter__(self):
i = self.ref['_M_impl']['_M_start']
end = self.ref['_M_impl']['_M_finish']
while i != end:
yield i.dereference()
i += 1
def __getitem__(self, item):
return (self.ref['_M_impl']['_M_start'] + item).dereference()
def __nonzero__(self):
return self.__len__() > 0
def __bool__(self):
return self.__nonzero__()
def external_memory_footprint(self):
return int(self.ref['_M_impl']['_M_end_of_storage']) - int(self.ref['_M_impl']['_M_start'])
class std_deque:
# should reflect the value of _GLIBCXX_DEQUE_BUF_SIZE
DEQUE_BUF_SIZE = 512
class iterator:
def __init__(self, ref, buf_size):
self.cur = ref['_M_cur']
self.first = ref['_M_first']
self.last = ref['_M_last']
self.node = ref['_M_node']
self.buf_size = buf_size
def _set_node(self, node):
self.first = node.dereference()
self.last = self.first + self.buf_size
self.node = node
def __eq__(self, other):
return self.node == other.node and self.cur == other.cur
def __str__(self):
return "{{node=0x{:x}, first=0x{:x}, last=0x{:x}, cur=0x{:x}}}".format(
int(self.node),
int(self.first),
int(self.last),
int(self.cur))
def next(self):
self.cur += 1
if self.cur == self.last:
self._set_node(self.node + 1)
self.cur = self.first
def get(self):
return self.cur.dereference()
def __init__(self, ref):
self.ref = ref
self.value_type = self.ref.type.strip_typedefs().template_argument(0)
if self.value_type.sizeof < std_deque.DEQUE_BUF_SIZE:
self.buf_size = int(std_deque.DEQUE_BUF_SIZE / self.value_type.sizeof)
else:
self.buf_size = 1
def __len__(self):
start = self.ref['_M_impl']['_M_start']
finish = self.ref['_M_impl']['_M_finish']
return (self.buf_size * (max(1, finish['_M_node'] - start['_M_node']) - 1) +
start['_M_last'] - start['_M_cur'] +
finish['_M_cur'] - finish['_M_first'])
def __nonzero__(self):
return self.__len__() > 0
def __bool__(self):
return self.__len__() > 0
def __iter__(self):
it = std_deque.iterator(self.ref['_M_impl']['_M_start'], self.buf_size)
finish = std_deque.iterator(self.ref['_M_impl']['_M_finish'], self.buf_size)
while it != finish:
yield it.get()
it.next()
def __str__(self):
items = [str(item) for item in self]
return "{{size={}, [{}]}}".format(len(self), ", ".join(items))
class static_vector:
def __init__(self, ref):
self.ref = ref
def __len__(self):
return int(self.ref['m_holder']['m_size'])
def __iter__(self):
t = self.ref.type.strip_typedefs()
value_type = t.template_argument(0)
try:
data = self.ref['m_holder']['storage']['data'].cast(value_type.pointer())
except:
try:
data = self.ref['m_holder']['storage']['dummy']['dummy'].cast(value_type.pointer()) # Scylla 3.1 compatibility
except gdb.error:
data = self.ref['m_holder']['storage']['dummy'].cast(value_type.pointer()) # Scylla 3.0 compatibility
for i in range(self.__len__()):
yield data[i]
def __nonzero__(self):
return self.__len__() > 0
def __bool__(self):
return self.__nonzero__()
class std_list:
"""Make `std::list` usable in python as a read-only container."""
@staticmethod
def _make_dereference_func(value_type):
list_node_type = gdb.lookup_type('std::_List_node<{}>'.format(str(value_type))).pointer()
def deref(node):
list_node = node.cast(list_node_type)
return list_node['_M_storage']['_M_storage'].cast(value_type.pointer()).dereference()
return deref
def __init__(self, ref):
self.ref = ref
self._dereference_node = std_list._make_dereference_func(self.ref.type.strip_typedefs().template_argument(0))
def __len__(self):
try:
return int(self.ref['_M_impl']['_M_node']['_M_size'])
except gdb.error:
i = 0
for _ in self:
i += 1
return i
def __nonzero__(self):
return self.__len__() > 0
def __bool__(self):
return self.__nonzero__()
def __getitem__(self, item):
if not isinstance(item, int):
raise ValueError("Invalid index: expected `{}`, got: `{}`".format(int, type(item)))
if item >= len(self):
raise ValueError("Index out of range: expected < {}, got {}".format(len(self), item))
i = 0
it = iter(self)
val = next(it)
while i != item:
i += 1
val = next(it)
return val
def __iter__(self):
class std_list_iterator:
def __init__(self, lst):
self._list = lst
node_header = self._list.ref['_M_impl']['_M_node']
self._node = node_header['_M_next']
self._end = node_header['_M_next']['_M_prev']
def __next__(self):
if self._node == self._end:
raise StopIteration()
val = self._list._dereference_node(self._node)
self._node = self._node['_M_next']
return val
return std_list_iterator(self)
@staticmethod
def dereference_iterator(it):
deref = std_list._make_dereference_func(it.type.strip_typedefs().template_argument(0))
return deref(it['_M_node'])
def uint64_t(val):
val = int(val)
if val < 0:
val += 1 << 64
return val
class sstring_printer(gdb.printing.PrettyPrinter):
'print an sstring'
def __init__(self, val):
self.val = val
def to_string(self):
if self.val['u']['internal']['size'] >= 0:
array = self.val['u']['internal']['str']
len = int(self.val['u']['internal']['size'])
return ''.join([chr(array[x]) for x in range(len)])
else:
return self.val['u']['external']['str']
def display_hint(self):
return 'string'
class managed_bytes_printer(gdb.printing.PrettyPrinter):
'print a managed_bytes'
def __init__(self, val):
self.val = val
def bytes(self):
def signed_chr(c):
return int(c).to_bytes(1, byteorder='little', signed=True)
if self.val['_u']['small']['size'] >= 0:
array = self.val['_u']['small']['data']
len = int(self.val['_u']['small']['size'])
return b''.join([signed_chr(array[x]) for x in range(len)])
else:
ref = self.val['_u']['ptr']
chunks = list()
while ref['ptr']:
array = ref['ptr']['data']
len = int(ref['ptr']['frag_size'])
ref = ref['ptr']['next']
chunks.append(b''.join([signed_chr(array[x]) for x in range(len)]))
return b''.join(chunks)
def to_string(self):
return str(self.bytes())
def display_hint(self):
return 'managed_bytes'
class partition_entry_printer(gdb.printing.PrettyPrinter):
def __init__(self, val):
self.val = val
def to_string(self):
versions = list()
v = self.val['_version']['_version']
while v:
versions.append('@%s: %s' % (v, v.dereference()))
v = v['_next']
return '{_snapshot=%s, _version=%s, versions=[\n%s\n]}' % (self.val['_snapshot'], self.val['_version'], ',\n'.join(versions))
def display_hint(self):
return 'partition_entry'
class mutation_partition_printer(gdb.printing.PrettyPrinter):
def __init__(self, val):
self.val = val
def to_string(self):
rows = list(str(r) for r in intrusive_set_external_comparator(self.val['_rows']))
range_tombstones = list(str(r) for r in intrusive_set(self.val['_row_tombstones']['_tombstones']))
return '{_tombstone=%s, _static_row=%s (cont=%s), _row_tombstones=[%s], _rows=[%s]}' % (
self.val['_tombstone'],
self.val['_static_row'],
('no', 'yes')[self.val['_static_row_continuous']],
'\n' + ',\n'.join(range_tombstones) + '\n' if range_tombstones else '',
'\n' + ',\n'.join(rows) + '\n' if rows else '')
def display_hint(self):
return 'mutation_partition'
class row_printer(gdb.printing.PrettyPrinter):
def __init__(self, val):
self.val = val
def to_string(self):
if self.val['_type'] == gdb.parse_and_eval('row::storage_type::vector'):
cells = str(self.val['_storage']['vector'])
elif self.val['_type'] == gdb.parse_and_eval('row::storage_type::set'):
cells = '[%s]' % (', '.join(str(cell) for cell in intrusive_set(self.val['_storage']['set'])))
else:
raise Exception('Unsupported storage type: ' + self.val['_type'])
return '{type=%s, cells=%s}' % (self.val['_type'], cells)
def display_hint(self):
return 'row'
class managed_vector_printer(gdb.printing.PrettyPrinter):
def __init__(self, val):
self.val = val
def to_string(self):
size = int(self.val['_size'])
items = list()
for i in range(size):
items.append(str(self.val['_data'][i]))
return '{size=%d, items=[%s]}' % (size, ', '.join(items))
def display_hint(self):
return 'managed_vector'
class uuid_printer(gdb.printing.PrettyPrinter):
'print a uuid'
def __init__(self, val):
self.val = val
def to_string(self):
msb = uint64_t(self.val['most_sig_bits'])
lsb = uint64_t(self.val['least_sig_bits'])
return str(uuid.UUID(int=(msb << 64) | lsb))
def display_hint(self):
return 'string'
def build_pretty_printer():
pp = gdb.printing.RegexpCollectionPrettyPrinter('scylla')
pp.add_printer('sstring', r'^seastar::basic_sstring<char,.*>$', sstring_printer)
pp.add_printer('managed_bytes', r'^managed_bytes$', managed_bytes_printer)
pp.add_printer('partition_entry', r'^partition_entry$', partition_entry_printer)
pp.add_printer('mutation_partition', r'^mutation_partition$', mutation_partition_printer)
pp.add_printer('row', r'^row$', row_printer)
pp.add_printer('managed_vector', r'^managed_vector<.*>$', managed_vector_printer)
pp.add_printer('uuid', r'^utils::UUID$', uuid_printer)
return pp
gdb.printing.register_pretty_printer(gdb.current_objfile(), build_pretty_printer(), replace=True)
def cpus():
return int(gdb.parse_and_eval('::seastar::smp::count'))
def current_shard():
return int(gdb.parse_and_eval('\'seastar\'::local_engine->_id'))
def find_db(shard=None):
if not shard:
shard = current_shard()
return gdb.parse_and_eval('::debug::db')['_instances']['_M_impl']['_M_start'][shard]['service']['_p']
def find_dbs():
return [find_db(shard) for shard in range(cpus())]
def for_each_table(db=None):
if not db:
db = find_db()
cfs = db['_column_families']
for (key, value) in list_unordered_map(cfs):
yield value['_p'].reinterpret_cast(gdb.lookup_type('column_family').pointer()).dereference() # it's a lw_shared_ptr
def list_unordered_map(map, cache=True):
kt = map.type.template_argument(0)
vt = map.type.template_argument(1)
value_type = gdb.lookup_type('::std::pair<{} const, {} >'.format(str(kt), str(vt)))
hashnode_ptr_type = gdb.lookup_type('::std::__detail::_Hash_node<' + value_type.name + ', ' + ('false', 'true')[cache] + '>').pointer()
h = map['_M_h']
p = h['_M_before_begin']['_M_nxt']
while p:
pc = p.cast(hashnode_ptr_type)['_M_storage']['_M_storage']['__data'].cast(value_type.pointer())
yield (pc['first'], pc['second'])
p = p['_M_nxt']
def list_unordered_set(map, cache=True):
value_type = map.type.template_argument(0)
hashnode_ptr_type = gdb.lookup_type('::std::__detail::_Hash_node<' + value_type.name + ', ' + ('false', 'true')[cache] + '>').pointer()
h = map['_M_h']
p = h['_M_before_begin']['_M_nxt']
while p:
pc = p.cast(hashnode_ptr_type)['_M_storage']['_M_storage']['__data'].cast(value_type.pointer())
yield pc.dereference()
p = p['_M_nxt']
def get_text_range():
try:
vptr_type = gdb.lookup_type('uintptr_t').pointer()
reactor_backend = gdb.parse_and_eval('seastar::local_engine->_backend')
# 2019.1 has value member, >=3.0 has std::unique_ptr<>
if reactor_backend.type.strip_typedefs().name.startswith('std::unique_ptr<'):
reactor_backend = std_unique_ptr(reactor_backend).get()
else:
reactor_backend = gdb.parse_and_eval('&seastar::local_engine->_backend')
known_vptr = int(reactor_backend.reinterpret_cast(vptr_type).dereference())
except Exception as e:
gdb.write("get_text_range(): Falling back to locating .rodata section because lookup to reactor backend to use as known vptr failed: {}\n".format(e))
known_vptr = None
sections = gdb.execute('info files', False, True).split('\n')
for line in sections:
if known_vptr:
if not " is ." in line:
continue
items = line.split()
start = int(items[0], 16)
end = int(items[2], 16)
if start <= known_vptr and known_vptr <= end:
return start, end
# vptrs are in .rodata section
elif line.endswith("is .rodata"):
items = line.split()
text_start = int(items[0], 16)
text_end = int(items[2], 16)
return text_start, text_end
raise Exception("Failed to find text start and end")
class histogram:
"""Simple histogram.
Aggregate items by their count and present them in a histogram format.
Example:
h = histogram()
h['item1'] = 20 # Set an absolute value
h.add('item2') # Equivalent to h['item2'] += 1
h.add('item2')
h.add('item3')
h.print()
Would print:
4 item1 ++++++++++++++++++++++++++++++++++++++++
2 item2 ++++
1 item1 ++
Note that the number of indicators ('+') is does not correspond to the
actual number of items, rather it is supposed to illustrate their relative
counts.
"""
_column_count = 40
def __init__(self, counts = defaultdict(int), print_indicators = True, formatter=None):
"""Constructor.
Params:
* counts: initial counts (default to empty).
* print_indicators: print the '+' characters to illustrate relative
count. Can be turned off when the item names are very long and would
thus make indicators unreadable.
* formatter: a callable that receives the item as its argument and is
expected to return the string to be printed in the second column.
By default, items are printed verbatim.
"""
self._counts = counts
self._print_indicators = print_indicators
def default_formatter(value):
return str(value)
if formatter is None:
self._formatter = default_formatter
else:
self._formatter = formatter
def __len__(self):
return len(self._counts)
def __nonzero__(self):
return bool(len(self))
def __getitem__(self, item):
return self._counts[item]
def __setitem__(self, item, value):
self._counts[item] = value
def add(self, item):
self._counts[item] += 1
def __str__(self):
if not self._counts:
return ''
by_counts = defaultdict(list)
for k, v in self._counts.items():
by_counts[v].append(k)
counts_sorted = list(reversed(sorted(by_counts.keys())))
max_count = counts_sorted[0]
if max_count == 0:
count_per_column = 0
else:
count_per_column = self._column_count / max_count
lines = []
for count in counts_sorted:
items = by_counts[count]
if self._print_indicators:
indicator = '+' * max(1, int(count * count_per_column))
else:
indicator = ''
for item in items:
lines.append('{:9d} {} {}'.format(count, self._formatter(item), indicator))
return '\n'.join(lines)
def __repr__(self):
return 'histogram({})'.format(self._counts)
def print(self):
gdb.write(str(self) + '\n')
class scylla(gdb.Command):
def __init__(self):
gdb.Command.__init__(self, 'scylla', gdb.COMMAND_USER, gdb.COMPLETE_COMMAND, True)
class scylla_databases(gdb.Command):
def __init__(self):
gdb.Command.__init__(self, 'scylla databases', gdb.COMMAND_USER, gdb.COMPLETE_COMMAND)
def invoke(self, arg, from_tty):
for shard in range(cpus()):
db = find_db(shard)
gdb.write('{:5} (database*){}\n'.format(shard, db))
class scylla_keyspaces(gdb.Command):
def __init__(self):
gdb.Command.__init__(self, 'scylla keyspaces', gdb.COMMAND_USER, gdb.COMPLETE_COMMAND)
def invoke(self, arg, from_tty):
for shard in range(cpus()):
db = find_db(shard)
keyspaces = db['_keyspaces']
for (key, value) in list_unordered_map(keyspaces):
gdb.write('{:5} {:20} (keyspace*){}\n'.format(shard, str(key), value.address))
class scylla_column_families(gdb.Command):
def __init__(self):
gdb.Command.__init__(self, 'scylla column_families', gdb.COMMAND_USER, gdb.COMPLETE_COMMAND)
def invoke(self, arg, from_tty):
for shard in range(cpus()):
db = find_db(shard)
cfs = db['_column_families']
for (key, value) in list_unordered_map(cfs):
value = value['_p'].reinterpret_cast(gdb.lookup_type('column_family').pointer()).dereference() # it's a lw_shared_ptr
schema = value['_schema']['_p'].reinterpret_cast(gdb.lookup_type('schema').pointer())
name = str(schema['_raw']['_ks_name']) + '/' + str(schema['_raw']['_cf_name'])
schema_version = str(schema['_raw']['_version'])
gdb.write('{:5} {} v={} {:45} (column_family*){}\n'.format(shard, key, schema_version, name, value.address))
class scylla_task_histogram(gdb.Command):
"""Print a histogram of the virtual objects found in memory.
Sample the virtual objects in memory and create a histogram with the results.
By default up to 20000 samples will be collected and the top 30 items will
be shown. The number of collected samples, as well as number of items shown
can be customized by command line arguments. The sampling can also be
constrained to objects of a certain size. For more details invoke:
scylla task_histogram --help
Example:
12280: 0x4bc5878 vtable for seastar::file_data_source_impl + 16
9352: 0x4be2cf0 vtable for seastar::continuation<seastar::future<seasta...
9352: 0x4bc59a0 vtable for seastar::continuation<seastar::future<seasta...
(1) (2) (3)
Where:
(1): Number of objects of this type.
(2): The address of the class's vtable.
(3): The name of the class's vtable symbol.
"""
def __init__(self):
gdb.Command.__init__(self, 'scylla task_histogram', gdb.COMMAND_USER, gdb.COMPLETE_COMMAND)
def invoke(self, arg, from_tty):
parser = argparse.ArgumentParser(description="scylla task_histogram")
parser.add_argument("-m", "--samples", action="store", type=int, default=20000,
help="The number of samples to collect. Defaults to 20000. Set to 0 to sample all objects. Ignored when `--all` is used."
" Note that due to this limit being checked only after scanning an entire page, in practice it will always be overshot.")
parser.add_argument("-c", "--count", action="store", type=int, default=30,
help="Show only the top COUNT elements of the histogram. Defaults to 30. Set to 0 to show all items. Ignored when `--all` is used.")
parser.add_argument("-a", "--all", action="store_true", default=False,
help="Sample all pages and show all results. Equivalent to -m=0 -c=0.")
parser.add_argument("-s", "--size", action="store", default=0,
help="The size of objects to sample. When set, only objects of this size will be sampled. A size of 0 (the default value) means no size restrictions.")
try:
args = parser.parse_args(arg.split())
except SystemExit:
return
size = args.size
cpu_mem = gdb.parse_and_eval('\'seastar::memory::cpu_mem\'')
page_size = int(gdb.parse_and_eval('\'seastar::memory::page_size\''))
mem_start = cpu_mem['memory']
vptr_type = gdb.lookup_type('uintptr_t').pointer()
pages = cpu_mem['pages']
nr_pages = int(cpu_mem['nr_pages'])
page_samples = range(0, nr_pages) if args.all else random.sample(range(0, nr_pages), nr_pages)
text_start, text_end = get_text_range()
sc = span_checker()
vptr_count = defaultdict(int)
scanned_pages = 0
for idx in page_samples:
span = sc.get_span(mem_start + idx * page_size)
if not span or span.index != idx or not span.is_small():
continue
pool = span.pool()
if int(pool.dereference()['_object_size']) != size and size != 0:
continue
scanned_pages += 1
objsize = size if size != 0 else int(pool.dereference()['_object_size'])
span_size = span.used_span_size() * page_size
for idx2 in range(0, int(span_size / objsize)):
obj_addr = span.start + idx2 * objsize
addr = gdb.Value(obj_addr).reinterpret_cast(vptr_type).dereference()
if addr >= text_start and addr <= text_end:
vptr_count[int(addr)] += 1
if args.all or args.samples == 0:
continue
if scanned_pages >= args.samples or len(vptr_count) >= args.samples:
break
sorted_counts = sorted(vptr_count.items(), key=lambda e: -e[1])
to_show = sorted_counts if args.all or args.count == 0 else sorted_counts[:args.count]
for vptr, count in to_show:
sym = resolve(vptr)
if sym:
gdb.write('%10d: 0x%x %s\n' % (count, vptr, sym))
def find_vptrs():
cpu_mem = gdb.parse_and_eval('\'seastar::memory::cpu_mem\'')
page_size = int(gdb.parse_and_eval('\'seastar::memory::page_size\''))
mem_start = cpu_mem['memory']
vptr_type = gdb.lookup_type('uintptr_t').pointer()
pages = cpu_mem['pages']
nr_pages = int(cpu_mem['nr_pages'])
text_start, text_end = get_text_range()
def is_vptr(addr):
return addr >= text_start and addr <= text_end
idx = 0
while idx < nr_pages:
if pages[idx]['free']:
idx += pages[idx]['span_size']
continue
pool = pages[idx]['pool']
if not pool or pages[idx]['offset_in_span'] != 0:
idx += 1
continue
objsize = int(pool.dereference()['_object_size'])
span_size = pages[idx]['span_size'] * page_size
for idx2 in range(0, int(span_size / objsize) + 1):
obj_addr = mem_start + idx * page_size + idx2 * objsize
vptr = obj_addr.reinterpret_cast(vptr_type).dereference()
if is_vptr(vptr):
yield obj_addr, vptr
idx += pages[idx]['span_size']
def find_single_sstable_readers():
def _lookup_type(type_name):
return {'name': type_name, 'ptr_type': gdb.lookup_type(type_name).pointer()}
types = []
try:
# For Scylla < 2.1
# FIXME: this only finds range readers
types = [_lookup_type('sstable_range_wrapping_reader')]
except Exception:
types = [_lookup_type('sstables::sstable_mutation_reader<sstables::data_consume_rows_context_m, sstables::mp_row_consumer_m>'),
_lookup_type('sstables::sstable_mutation_reader<sstables::data_consume_rows_context, sstables::mp_row_consumer_k_l>')]
def _lookup_obj(obj_addr, vtable_addr):
vtable_pfx = 'vtable for '
name = resolve(vtable_addr, startswith=vtable_pfx)
if not name:
return None
name = name[len(vtable_pfx):]
for t in types:
if name.startswith(t['name']):
ptr_type = t['ptr_type']
return obj_addr.reinterpret_cast(ptr_type)
for obj_addr, vtable_addr in find_vptrs():
obj = _lookup_obj(obj_addr, vtable_addr)
if obj:
yield obj
def find_active_sstables():
""" Yields sstable* once for each active sstable reader. """
sstable_ptr_type = gdb.lookup_type('sstables::sstable').pointer()
for reader in find_single_sstable_readers():
sstable_ptr = reader['_sst']['_p']
yield sstable_ptr.reinterpret_cast(sstable_ptr_type)
class schema_ptr:
def __init__(self, ptr):
schema_ptr_type = gdb.lookup_type('schema').pointer()
self.ptr = ptr['_p'].reinterpret_cast(schema_ptr_type)
@property
def ks_name(self):
return self.ptr['_raw']['_ks_name']
@property
def cf_name(self):
return self.ptr['_raw']['_cf_name']
def table_name(self):
return '%s.%s' % (self.ptr['_raw']['_ks_name'], self.ptr['_raw']['_cf_name'])
class scylla_active_sstables(gdb.Command):
def __init__(self):
gdb.Command.__init__(self, 'scylla active-sstables', gdb.COMMAND_USER, gdb.COMPLETE_COMMAND)
def invoke(self, arg, from_tty):
try:
sizeof_index_entry = int(gdb.parse_and_eval('sizeof(sstables::index_entry)'))
sizeof_entry = int(gdb.parse_and_eval('sizeof(sstables::shared_index_lists::entry)'))
def count_index_lists(sst):
index_lists_size = 0
for key, entry in list_unordered_map(sst['_index_lists']['_lists'], cache=False):
index_entries = std_vector(entry['list'])
index_lists_size += sizeof_entry
for e in index_entries:
index_lists_size += sizeof_index_entry