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
|
//
//
// The Nimrod Compiler
// (c) Copyright 2008 Andreas Rumpf
//
// See the file "copying.txt", included in this
// distribution, for details about the copyright.
//
unit trees;
// tree helper routines
interface
{$include 'config.inc'}
uses
nsystem, ast, astalgo, scanner, msgs, strutils;
function getMagic(op: PNode): TMagic;
// function getConstExpr(const t: TNode; out res: TNode): Boolean;
function isConstExpr(n: PNode): Boolean;
function flattenTree(root: PNode; op: TMagic): PNode;
function TreeToSym(t: PNode): PSym;
procedure SwapOperands(op: PNode);
function getOpSym(op: PNode): PSym;
function getProcSym(call: PNode): PSym;
function ExprStructuralEquivalent(a, b: PNode): Boolean;
function sameTree(a, b: PNode): boolean;
function cyclicTree(n: PNode): boolean;
implementation
function hasSon(father, son: PNode): boolean;
var
i: int;
begin
for i := 0 to sonsLen(father)-1 do
if father.sons[i] = son then begin result := true; exit end;
result := false
end;
function cyclicTreeAux(n, s: PNode): boolean;
var
i, m: int;
begin
if n = nil then begin result := false; exit end;
if hasSon(s, n) then begin result := true; exit end;
m := sonsLen(s);
addSon(s, n);
if not (n.kind in [nkEmpty..nkNilLit]) then
for i := 0 to sonsLen(n)-1 do
if cyclicTreeAux(n.sons[i], s) then begin
result := true; exit
end;
result := false;
delSon(s, m);
end;
function cyclicTree(n: PNode): boolean;
var
s: PNode;
begin
s := newNodeI(nkEmpty, n.info);
result := cyclicTreeAux(n, s);
end;
function ExprStructuralEquivalent(a, b: PNode): Boolean;
var
i: int;
begin
result := false;
if a = b then begin
result := true
end
else if (a <> nil) and (b <> nil) and (a.kind = b.kind) then
case a.kind of
nkSym: // don't go nuts here: same symbol as string is enough:
result := a.sym.name.id = b.sym.name.id;
nkIdent:
result := a.ident.id = b.ident.id;
nkCharLit..nkInt64Lit:
result := a.intVal = b.intVal;
nkFloatLit..nkFloat64Lit:
result := a.floatVal = b.floatVal;
nkStrLit..nkTripleStrLit:
result := a.strVal = b.strVal;
nkEmpty, nkNilLit, nkType: result := true;
else if sonsLen(a) = sonsLen(b) then begin
for i := 0 to sonsLen(a)-1 do
if not ExprStructuralEquivalent(a.sons[i], b.sons[i]) then exit;
result := true
end
end
end;
function sameTree(a, b: PNode): Boolean;
var
i: int;
begin
result := false;
if a = b then begin
result := true
end
else if (a <> nil) and (b <> nil) and (a.kind = b.kind) then begin
if a.flags <> b.flags then exit;
if a.info.line <> b.info.line then exit;
if a.info.col <> b.info.col then exit;
//if a.info.fileIndex <> b.info.fileIndex then exit;
case a.kind of
nkSym: // don't go nuts here: same symbol as string is enough:
result := a.sym.name.id = b.sym.name.id;
nkIdent:
result := a.ident.id = b.ident.id;
nkCharLit..nkInt64Lit:
result := a.intVal = b.intVal;
nkFloatLit..nkFloat64Lit:
result := a.floatVal = b.floatVal;
nkStrLit..nkTripleStrLit:
result := a.strVal = b.strVal;
nkEmpty, nkNilLit, nkType: result := true;
else if sonsLen(a) = sonsLen(b) then begin
for i := 0 to sonsLen(a)-1 do
if not sameTree(a.sons[i], b.sons[i]) then exit;
result := true
end
end
end
end;
function getProcSym(call: PNode): PSym;
begin
result := call.sons[0].sym;
end;
function getOpSym(op: PNode): PSym;
begin
if not (op.kind in [nkCall, nkHiddenCallConv, nkCommand, nkCallStrLit]) then
result := nil
else begin
if (sonsLen(op) <= 0) then InternalError(op.info, 'getOpSym');
if op.sons[0].Kind = nkSym then result := op.sons[0].sym
else result := nil
end
end;
function getMagic(op: PNode): TMagic;
begin
case op.kind of
nkCall, nkHiddenCallConv, nkCommand, nkCallStrLit: begin
case op.sons[0].Kind of
nkSym: begin
result := op.sons[0].sym.magic;
end;
else result := mNone
end
end;
else
result := mNone
end
end;
function TreeToSym(t: PNode): PSym;
begin
result := t.sym
end;
function isConstExpr(n: PNode): Boolean;
begin
result := (n.kind in [nkCharLit..nkInt64Lit, nkStrLit..nkTripleStrLit,
nkFloatLit..nkFloat64Lit, nkNilLit])
or (nfAllConst in n.flags)
end;
procedure flattenTreeAux(d, a: PNode; op: TMagic);
var
i: int;
begin
if (getMagic(a) = op) then // BUGFIX
for i := 1 to sonsLen(a)-1 do // BUGFIX
flattenTreeAux(d, a.sons[i], op)
else
// a is a "leaf", so add it:
addSon(d, copyTree(a))
end;
function flattenTree(root: PNode; op: TMagic): PNode;
begin
result := copyNode(root);
if (getMagic(root) = op) then begin // BUGFIX: forget to copy prc
addSon(result, copyNode(root.sons[0]));
flattenTreeAux(result, root, op)
end
end;
procedure SwapOperands(op: PNode);
var
tmp: PNode;
begin
tmp := op.sons[1];
op.sons[1] := op.sons[2];
op.sons[2] := tmp;
end;
end.
|