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
|
#!/usr/bin/env python3
# SPDX-License-Identifier: MPL-2.0
# SPDX-FileCopyrightText: 2013-2018 Andrew McCreight <continuation@gmail.com>
# SPDX-FileCopyrightText: 2018 Andy Holmes <andrew.g.r.holmes@gmail.com>
#
# heapdot.py - DOT Graph output
import re
func_regex = re.compile('Function(?: ([^/]+)(?:/([<|\w]+))?)?')
priv_regex = re.compile(r'([^ ]+) (\(nil\)|0x[a-fA-F0-9]+$)')
###############################################################################
# DOT Graph Output
###############################################################################
dot_graph_paths = []
unreachable = set()
def add_dot_graph_path(path):
dot_graph_paths.append(path)
def add_dot_graph_unreachable(node):
unreachable.add(node)
def output_dot_file(args, graph, targs, fname):
# build the set of nodes
nodes = set([])
for p in dot_graph_paths:
for x in p:
nodes.add(x)
nodes.update(unreachable)
# build the edge map
edges = {}
for p in dot_graph_paths:
prevNode = None
for x in p:
if prevNode:
edges.setdefault(prevNode, set([])).add(x)
prevNode = x
# Write out the DOT graph
outf = open(fname, 'w')
outf.write('digraph {\n')
# Nodes
for addr in nodes:
label = graph.node_labels.get(addr, '')
color = 'black'
style = 'solid'
shape = 'rect'
priv = ''
if label.endswith('<no private>'):
label = label[:-13]
# Lookup the edge label for this node
elabel = ''
for origin in graph.edge_labels.values():
if addr in origin:
elabels = origin[addr]
elabel = elabels[0]
break
# GObject or something else with JS instance private data
pm = priv_regex.match(label)
if pm:
label = pm.group(1)
color = 'orange'
style = 'bold'
if not args.no_addr:
priv = pm.group(2)
# Some kind of GObject
if label.startswith('GObject_'):
shape = 'circle'
if elabel in ['prototype', 'group_proto']:
style += ',dashed'
# Another object native to Gjs
elif label.startswith('Cjs') or label.startswith('GIR'):
shape = 'octagon'
elif label.startswith('Function'):
fm = func_regex.match(label)
if fm.group(2) == '<':
label = 'Function via {}()'.format(fm.group(1))
elif fm.group(2):
label = 'Function {} in {}'.format(fm.group(2), fm.group(1))
else:
if len(label) > 10:
label = label[9:]
label += '()'
color = 'green'
style = 'bold,rounded'
# A function context
elif label == 'Call' or label == 'LexicalEnvironment':
color = 'green'
style = 'bold,dashed'
# A file/script reference
elif label.startswith('script'):
label = label[7:].split('/')[-1]
shape = 'note'
color = 'blue'
# A WeakMap
elif label.startswith('WeakMap'):
label = 'WeakMap'
style = 'dashed'
# A Proxy
elif label.startswith('Proxy'):
shape = 'doublecircle'
color = 'goldenrod2'
# Mostly uninteresting objects
elif label in ['base_shape', 'object_group', 'type_object']:
style = 'dotted'
if label == 'base_shape':
label = 'shape'
elif label == 'type_object':
label = 'type'
# Only mark the target if it's a single match
if addr == targs[0] and len(targs) == 1:
color = 'red'
style = 'bold'
node_label = label
if addr in unreachable:
style += ',dotted'
node_label = 'Unreachable\\n' + node_label
if not args.no_addr:
node_label += '\\njsobj@' + addr
if priv:
node_label += '\\npriv@' + priv
annotation = graph.annotations.get(addr, None)
if annotation:
node_label += '\\n\\"{}\\"'.format(annotation)
node_text = ' node [label="{0}", color={1}, shape={2}, style="{3}"] q{4};\n'.format(node_label, color, shape, style, addr)
outf.write(node_text)
# Edges (relationships)
for origin, destinations in edges.items():
for destination in destinations:
labels = graph.edge_labels.get(origin, {}).get(destination, [])
ll = []
for l in labels:
if len(l) == 2:
l = l[0]
if l.startswith('**UNKNOWN SLOT '):
continue
ll.append(l)
label = ''
style = 'solid'
color = 'black'
if len(ll) == 1:
label = ll[0]
# Object children
if label.startswith('objects['):
label = label[7:]
# Array elements
elif label.startswith('objectElements['):
label = label[14:]
# prototype/constructor function
elif label in ['prototype', 'group_proto']:
color = 'orange'
style = 'bold,dashed'
# fun_environment
elif label == 'fun_environment':
label = ''
color = 'green'
style = 'bold,dashed'
elif label == 'script':
label = ''
color = 'blue'
# Signals
# TODO: better heap label via gi/closure.cpp & gi/object.cpp
elif label == 'signal connection':
color = 'red'
style = 'bold,dashed'
if len(label) > 18:
label = label[:8] + '...' + label[-8:]
else:
label = ',\\n'.join(ll)
outf.write(' q{0} -> q{1} [label="{2}", color={3}, style="{4}"];\n'.format(origin, destination, label, color, style))
# Extra edges, marked as "interesting" via a command line argument
if args.edge_targets:
for origin, paths in graph.edge_labels.items():
for destination, labels in paths.items():
if destination in edges.get(origin, set()):
continue # already printed
for label in labels:
if label in args.edge_targets:
outf.write(' q{0} -> q{1} [label="{2}", color=black, style="solid"];\n'.format(origin, destination, label))
outf.write('}\n')
outf.close()
|
