-
Notifications
You must be signed in to change notification settings - Fork 1
/
astdump.d
417 lines (369 loc) · 12.8 KB
/
astdump.d
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
module astdump;
import std.stdio;
import std.range : iota;
import std.algorithm : map;
import std.array : join;
import std.conv : text;
import std.string : fromStringz;
import parser;
import util;
void dumpAST(Node[] nodes)
{
stderr.writeln("digraph G {\ngraph [layout=dot,rankdir=LR]\nnode [shape=record];");
id = 0;
foreach (fn; nodes)
dump(&fn);
stderr.writeln("}");
}
private:
size_t id;
size_t dump(Node* node)
{
if (node == null)
{
size_t id_null = id++;
stderr.writefln("n%d [label=\"NULL\",shape=circle,color=red]", id_null);
return id_null;
}
string type = genType(node.type);
string typestr = (type != "") ? " : " ~ type : "";
if (node.op == NodeType.FUNCTION)
{
size_t id_func = id++;
stderr.writefln("n%d [label=\"<op>FUNCTION|name = %s|<type>type = %s|<args>args|<body>body\"]",
id_func, node.name, genType(node.type));
size_t id_args = dumpArgs(node.args);
stderr.writefln("n%d:args -> n%d", id_func, id_args);
size_t id_body = dump(node.bdy);
stderr.writefln("n%d:body -> n%d", id_func, id_body);
return id_func;
}
if (node.op == NodeType.VARIABLE_DEFINITION)
{
size_t id_var = id++;
if (node.initalize == null)
{
stderr.writefln("n%d [label=\"<op>VARIABLE_DEFINITION|name = %s%s|<type>type = %s\"]",
id_var, node.name, (node.is_extern) ? "|extern" : "", genType(node.type));
}
else
{
size_t id_init = dump(node.initalize);
stderr.writefln("n%d [label=\"<op>VARIABLE_DEFINITION|name = %s%s|<type>type = %s|<init>init\"]",
id_var, node.name, (node.is_extern) ? "|extern" : "", genType(node.type));
stderr.writefln("n%d:init -> n%d", id_var, id_init);
}
return id_var;
}
if (node.op == NodeType.COMPOUND_STATEMENT)
{
size_t id_cpstmt = id++;
if (node.statements.length == 0)
{
stderr.writefln("n%d [label=\"COMPOUND_STATEMENT|∅\"]", id_cpstmt);
return id_cpstmt;
}
stderr.writefln("n%d [label=\"%s\"]", id_cpstmt,
"COMPOUND_STATEMENT|" ~ iota(node.statements.length)
.map!(n => "<" ~ n.text ~ ">" ~ n.text).join("|"));
foreach (i, stmt; node.statements)
{
size_t id_stmt = dump(&stmt);
stderr.writefln("n%d:%d -> n%d", id_cpstmt, i, id_stmt);
}
return id_cpstmt;
}
if (node.op == NodeType.NULL)
{
size_t id_null = id++;
stderr.writefln("n%d [label=\"∅\"]");
return id_null;
}
if (node.op == NodeType.IF)
{
size_t id_if = id++;
size_t id_cond = dump(node.cond);
size_t id_then = dump(node.then);
if (node.els == null)
{
stderr.writefln("n%d [label=\"IF|<cond>cond|<then>then\"]", id_if);
stderr.writefln("n%d:cond -> n%d", id_if, id_cond);
stderr.writefln("n%d:then -> n%d", id_if, id_then);
}
else
{
size_t id_else = dump(node.els);
stderr.writefln("n%d [label=\"IF|<cond>cond|<then>then|<else>else\"]", id_if);
stderr.writefln("n%d:cond -> n%d", id_if, id_cond);
stderr.writefln("n%d:then -> n%d", id_if, id_then);
stderr.writefln("n%d:else -> n%d", id_if, id_else);
}
return id_if;
}
if (node.op == NodeType.FOR)
{
size_t id_for = id++;
size_t id_init = dump(node.initalize);
size_t id_cond = dump(node.cond);
size_t id_inc = dump(node.inc);
size_t id_body = dump(node.bdy);
stderr.writefln("n%d [label=\"FOR|<init>init|<cond>cond|<inc>inc|<body>body\"]", id_for);
stderr.writefln("n%d:init -> n%d", id_for, id_init);
stderr.writefln("n%d:cond -> n%d", id_for, id_cond);
stderr.writefln("n%d:inc -> n%d", id_for, id_inc);
stderr.writefln("n%d:body -> n%d", id_for, id_body);
return id_for;
}
if (node.op == NodeType.DO_WHILE)
{
size_t id_dowhile = id++;
size_t id_body = dump(node.bdy);
size_t id_cond = dump(node.cond);
stderr.writefln("n%d [label=\"DO_WHILE|<body>body|<cond>cond\"]", id_dowhile);
stderr.writefln("n%d:body -> n%d", id_dowhile, id_body);
stderr.writefln("n%d:cond -> n%d", id_dowhile, id_cond);
return id_dowhile;
}
if (node.op == NodeType.RETURN)
{
size_t id_return = id++;
size_t id_expr = dump(node.expr);
stderr.writefln("n%d [label=\"RETURN|<expr>expr\"]", id_return);
stderr.writefln("n%d:expr -> n%d", id_return, id_expr);
return id_return;
}
if (node.op == NodeType.EXPRESSION_STATEMENT)
{
size_t id_expr_stmt = id++;
size_t id_expr = dump(node.expr);
stderr.writefln("n%d [label=\"EXPRESSION_STATEMENT|<expr>expr\"]", id_expr_stmt);
stderr.writefln("n%d:expr -> n%d", id_expr_stmt, id_expr);
return id_expr_stmt;
}
if (node.op == NodeType.STATEMENT_EXPRESSION)
{
size_t id_expr = id++;
size_t id_body = dump(node.expr);
stderr.writefln("n%d [label=\"STATEMENT_EXPRESSION%s|<body>body\"]", typestr, id_expr);
stderr.writefln("n%d:expr -> n%d", id_expr, id_body);
return id_expr;
}
if (node.op == NodeType.ASSIGN)
{
size_t id_binop = id++;
size_t id_lhs = dump(node.lhs);
size_t id_rhs = dump(node.rhs);
stderr.writefln("n%d [label=\"ASSIGN%s|<lhs>lhs|<rhs>rhs\"]", id_binop, typestr);
stderr.writefln("n%d:lhs -> n%d", id_binop, id_lhs);
stderr.writefln("n%d:rhs -> n%d", id_binop, id_rhs);
return id_binop;
}
if (node.op == NodeType.LOGICAL_OR)
{
size_t id_binop = id++;
size_t id_lhs = dump(node.lhs);
size_t id_rhs = dump(node.rhs);
stderr.writefln("n%d [label=\"\\|\\|%s|<lhs>lhs|<rhs>rhs\"]", id_binop, typestr);
stderr.writefln("n%d:lhs -> n%d", id_binop, id_lhs);
stderr.writefln("n%d:rhs -> n%d", id_binop, id_rhs);
return id_binop;
}
if (node.op == NodeType.LOGICAL_AND)
{
size_t id_binop = id++;
size_t id_lhs = dump(node.lhs);
size_t id_rhs = dump(node.rhs);
stderr.writefln("n%d [label=\"&&%s|<lhs>lhs|<rhs>rhs\"]", id_binop, typestr);
stderr.writefln("n%d:lhs -> n%d", id_binop, id_lhs);
stderr.writefln("n%d:rhs -> n%d", id_binop, id_rhs);
return id_binop;
}
if (node.op == NodeType.EQUAL)
{
size_t id_binop = id++;
size_t id_lhs = dump(node.lhs);
size_t id_rhs = dump(node.rhs);
stderr.writefln("n%d [label=\"==%s|<lhs>lhs|<rhs>rhs\"]", id_binop, typestr);
stderr.writefln("n%d:lhs -> n%d", id_binop, id_lhs);
stderr.writefln("n%d:rhs -> n%d", id_binop, id_rhs);
return id_binop;
}
if (node.op == NodeType.NOT_EQUAL)
{
size_t id_binop = id++;
size_t id_lhs = dump(node.lhs);
size_t id_rhs = dump(node.rhs);
stderr.writefln("n%d [label=\"!=%s|<lhs>lhs|<rhs>rhs\"]", id_binop, typestr);
stderr.writefln("n%d:lhs -> n%d", id_binop, id_lhs);
stderr.writefln("n%d:rhs -> n%d", id_binop, id_rhs);
return id_binop;
}
if (node.op == NodeType.LESS_THAN)
{
size_t id_binop = id++;
size_t id_lhs = dump(node.lhs);
size_t id_rhs = dump(node.rhs);
stderr.writefln("n%d [label=\"\\<%s|<lhs>lhs|<rhs>rhs\"]", id_binop, typestr);
stderr.writefln("n%d:lhs -> n%d", id_binop, id_lhs);
stderr.writefln("n%d:rhs -> n%d", id_binop, id_rhs);
return id_binop;
}
if (node.op == NodeType.ADD)
{
size_t id_binop = id++;
size_t id_lhs = dump(node.lhs);
size_t id_rhs = dump(node.rhs);
stderr.writefln("n%d [label=\"\\+%s|<lhs>lhs|<rhs>rhs\"]", id_binop, typestr);
stderr.writefln("n%d:lhs -> n%d", id_binop, id_lhs);
stderr.writefln("n%d:rhs -> n%d", id_binop, id_rhs);
return id_binop;
}
if (node.op == NodeType.SUB)
{
size_t id_binop = id++;
size_t id_lhs = dump(node.lhs);
size_t id_rhs = dump(node.rhs);
stderr.writefln("n%d [label=\"\\-%s|<lhs>lhs|<rhs>rhs\"]", id_binop, typestr);
stderr.writefln("n%d:lhs -> n%d", id_binop, id_lhs);
stderr.writefln("n%d:rhs -> n%d", id_binop, id_rhs);
return id_binop;
}
if (node.op == NodeType.MUL)
{
size_t id_binop = id++;
size_t id_lhs = dump(node.lhs);
size_t id_rhs = dump(node.rhs);
stderr.writefln("n%d [label=\"\\*%s|<lhs>lhs|<rhs>rhs\"]", id_binop, typestr);
stderr.writefln("n%d:lhs -> n%d", id_binop, id_lhs);
stderr.writefln("n%d:rhs -> n%d", id_binop, id_rhs);
return id_binop;
}
if (node.op == NodeType.DIV)
{
size_t id_binop = id++;
size_t id_lhs = dump(node.lhs);
size_t id_rhs = dump(node.rhs);
stderr.writefln("n%d [label=\"\\/%s|<lhs>lhs|<rhs>rhs\"]", id_binop, typestr);
stderr.writefln("n%d:lhs -> n%d", id_binop, id_lhs);
stderr.writefln("n%d:rhs -> n%d", id_binop, id_rhs);
return id_binop;
}
if (node.op == NodeType.DEREFERENCE)
{
size_t id_unary = id++;
size_t id_expr = dump(node.expr);
stderr.writefln("n%d [label=\"\\*%s|<expr>expr\"]", id_unary, typestr);
stderr.writefln("n%d:expr -> n%d", id_unary, id_expr);
return id_unary;
}
if (node.op == NodeType.ADDRESS)
{
size_t id_unary = id++;
size_t id_expr = dump(node.expr);
stderr.writefln("n%d [label=\"&%s|<expr>expr\"]", id_unary, typestr);
stderr.writefln("n%d:expr -> n%d", id_unary, id_expr);
return id_unary;
}
if (node.op == NodeType.SIZEOF)
{
size_t id_unary = id++;
size_t id_expr = dump(node.expr);
stderr.writefln("n%d [label=\"sizeof|<expr>expr\"]", id_unary);
stderr.writefln("n%d:expr -> n%d", id_unary, id_expr);
return id_unary;
}
if (node.op == NodeType.ALIGNOF)
{
size_t id_unary = id++;
size_t id_expr = dump(node.expr);
stderr.writefln("n%d [label=\"_Alignof|<expr>expr\"]", id_unary);
stderr.writefln("n%d:expr -> n%d", id_unary, id_expr);
return id_unary;
}
if (node.op == NodeType.IDENTIFIER)
{
size_t id_ident = id++;
stderr.writefln("n%d [label=\"IDENTIFIER|name = %s\"]", id_ident, node.name);
return id_ident;
}
if (node.op == NodeType.CALL)
{
size_t id_ident = id++;
if (node.args == null)
{
stderr.writefln("n%d [label=\"CALL%s|name = %s\"]", id_ident, typestr, node.name);
}
else
{
stderr.writefln("n%d [label=\"CALL%s|name = %s|<args>args\"]",
id_ident, typestr, node.name);
size_t id_args = dumpArgs(node.args);
stderr.writefln("n%d:args -> n%d", id_ident, id_args);
}
return id_ident;
}
if (node.op == NodeType.LOCAL_VARIABLE)
{
size_t id_var = id++;
stderr.writefln("n%d [label=\"LOCAL_VARIABLE%s|offset = %d\"]", id_var,
typestr, node.offset);
return id_var;
}
if (node.op == NodeType.GLOBAL_VARIABLE)
{
size_t id_var = id++;
stderr.writefln("n%d [label=\"GLOBAL_VARIABLE%s|%s\"]", id_var, typestr, node.name);
return id_var;
}
if (node.op == NodeType.STRING)
{
size_t id_str = id++;
stderr.writefln("n%d [label=\"STRING%s\"]", id_str, typestr);
return id_str;
}
if (node.op == NodeType.NUM)
{
size_t id_num = id++;
stderr.writefln("n%d [label=\"NUM|val = %d\"]", id_num, node.val);
return id_num;
}
size_t id_other = id++;
stderr.writefln("n%d [label=\"%s%s\"]", id_other, node.op, typestr);
return id_other;
}
size_t dumpArgs(Node[] args)
{
size_t id_args = id++;
if (args.length == 0)
{
stderr.writefln("n%d [label=\"∅\"]", id_args);
return id_args;
}
stderr.writefln("n%d [label=\"%s\"]", id_args, iota(args.length)
.map!(n => "<" ~ n.text ~ ">" ~ n.text).join("|"));
foreach (i, arg; args)
{
size_t id_arg = dump(&arg);
stderr.writefln("n%d:%d -> n%d", id_args, i, id_arg);
}
return id_args;
}
string genType(Type* t)
{
if (t == null)
{
return "";
}
with (TypeName) switch (t.type)
{
case CHAR:
return "char";
case INT:
return "int";
case POINTER:
return "*" ~ genType(t.pointer_to);
default:
assert(t.type == TypeName.ARRAY);
return genType(t.array_of) ~ "[" ~ t.array_length.text ~ "]";
}
}