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
|
{
Tail recursion optimization
Copyright (c) 2006 by Florian Klaempfl
This program is free software; you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation; either version 2 of the License, or
(at your option) any later version.
This program is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU General Public License for more details.
You should have received a copy of the GNU General Public License
along with this program; if not, write to the Free Software
Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
****************************************************************************
}
unit opttail;
{$i fpcdefs.inc}
interface
uses
symdef,node;
procedure do_opttail(var n : tnode;p : tprocdef);
implementation
uses
globtype,
symconst,symsym,
defcmp,defutil,
nutils,nbas,nflw,ncal,nld,ncnv,nmem,
pass_1,
paramgr;
procedure do_opttail(var n : tnode;p : tprocdef);
var
labelnode : tlabelnode;
function find_and_replace_tailcalls(var n : tnode) : boolean;
var
usedcallnode : tcallnode;
function has_copyback_paras(call: tcallnode): boolean;
var
n: tcallparanode;
begin
n:=tcallparanode(call.left);
result:=false;
while assigned(n) do
begin
if assigned(n.fparacopyback) then
begin
result:=true;
exit;
end;
n:=tcallparanode(n.right);
end;
end;
function is_optimizable_recursivecall(n : tnode) : boolean;
begin
result:=
(n.nodetype=calln) and
(tcallnode(n).procdefinition=p) and
not(assigned(tcallnode(n).methodpointer)) and
not has_copyback_paras(tcallnode(n));
if result then
usedcallnode:=tcallnode(n)
else
{ obsolete type cast? }
result:=((n.nodetype=typeconvn) and (ttypeconvnode(n).convtype=tc_equal) and is_optimizable_recursivecall(ttypeconvnode(n).left));
end;
function is_resultassignment(n : tnode) : boolean;
begin
result:=((n.nodetype=loadn) and (tloadnode(n).symtableentry=p.funcretsym)) or
((n.nodetype=typeconvn) and (ttypeconvnode(n).convtype=tc_equal) and is_resultassignment(ttypeconvnode(n).left));
end;
var
calcnodes,
copynodes,
hp : tnode;
nodes,
calcstatements,
copystatements : tstatementnode;
paranode : tcallparanode;
tempnode : ttempcreatenode;
loadnode : tloadnode;
oldnodetree : tnode;
useaddr : boolean;
begin
{ no tail call found and replaced so far }
result:=false;
if n=nil then
exit;
usedcallnode:=nil;
case n.nodetype of
statementn:
begin
hp:=n;
{ search last node }
while assigned(tstatementnode(hp).right) do
hp:=tstatementnode(hp).right;
result:=find_and_replace_tailcalls(tstatementnode(hp).left);
end;
ifn:
begin
result:=find_and_replace_tailcalls(tifnode(n).right);
{ avoid short bool eval here }
result:=find_and_replace_tailcalls(tifnode(n).t1) or result;
end;
calln,
assignn:
begin
if ((n.nodetype=calln) and is_optimizable_recursivecall(n)) or
((n.nodetype=assignn) and is_resultassignment(tbinarynode(n).left) and
is_optimizable_recursivecall(tbinarynode(n).right)) then
begin
{ found one! }
{
writeln('tail recursion optimization for ',p.mangledname);
printnode(output,n);
}
{ create assignments for all parameters }
{ this is hairy to do because one parameter could be used to calculate another one, so
assign them first to temps and then add them }
calcnodes:=internalstatements(calcstatements);
copynodes:=internalstatements(copystatements);
paranode:=tcallparanode(usedcallnode.left);
while assigned(paranode) do
begin
if assigned(paranode.fparainit) then
begin
addstatement(calcstatements,paranode.fparainit);
paranode.fparainit:=nil;
end;
useaddr:=(paranode.parasym.varspez in [vs_var,vs_constref]) or
((paranode.parasym.varspez=vs_const) and
paramanager.push_addr_param(paranode.parasym.varspez,paranode.parasym.vardef,p.proccalloption)) or
((paranode.parasym.varspez=vs_value) and
is_open_array(paranode.parasym.vardef));
if useaddr then
begin
tempnode:=ctempcreatenode.create(voidpointertype,voidpointertype.size,tt_persistent,true);
addstatement(calcstatements,tempnode);
addstatement(calcstatements,
cassignmentnode.create(
ctemprefnode.create(tempnode),
caddrnode.create_internal(paranode.left)
));
end
else
begin
tempnode:=ctempcreatenode.create(paranode.left.resultdef,paranode.left.resultdef.size,tt_persistent,true);
addstatement(calcstatements,tempnode);
addstatement(calcstatements,
cassignmentnode.create_internal(
ctemprefnode.create(tempnode),
paranode.left
));
end;
{ "cast" away const varspezs }
loadnode:=cloadnode.create(paranode.parasym,paranode.parasym.owner);
include(tloadnode(loadnode).loadnodeflags,loadnf_isinternal_ignoreconst);
{ load the address of the symbol instead of symbol }
if useaddr then
include(tloadnode(loadnode).loadnodeflags,loadnf_load_addr);
addstatement(copystatements,
cassignmentnode.create_internal(
loadnode,
ctemprefnode.create(tempnode)
));
addstatement(copystatements,ctempdeletenode.create_normal_temp(tempnode));
{ reused }
paranode.left:=nil;
paranode:=tcallparanode(paranode.right);
end;
oldnodetree:=n;
n:=internalstatements(nodes);
if assigned(usedcallnode.callinitblock) then
begin
addstatement(nodes,usedcallnode.callinitblock);
usedcallnode.callinitblock:=nil;
end;
addstatement(nodes,calcnodes);
addstatement(nodes,copynodes);
{ create goto }
addstatement(nodes,cgotonode.create(labelnode.labsym));
if assigned(usedcallnode.callcleanupblock) then
begin
{ callcleanupblock should contain only temp. node clean up }
checktreenodetypes(usedcallnode.callcleanupblock,
[tempdeleten,blockn,statementn,temprefn,nothingn]);
addstatement(nodes,usedcallnode.callcleanupblock);
usedcallnode.callcleanupblock:=nil;
end;
oldnodetree.free;
do_firstpass(n);
result:=true;
end;
end;
blockn:
result:=find_and_replace_tailcalls(tblocknode(n).left);
else
;
end;
end;
var
s : tstatementnode;
oldnodes : tnode;
i : longint;
labelsym : tlabelsym;
begin
{ check if the parameters actually would support tail recursion elimination }
for i:=0 to p.paras.count-1 do
with tparavarsym(p.paras[i]) do
if (varspez=vs_out) or
{ parameters requiring tables are too complicated to handle
and slow down things anyways so a tail recursion call
makes no sense
}
is_managed_type(vardef) then
exit;
labelsym:=clabelsym.create('$opttail');
labelnode:=clabelnode.create(cnothingnode.create,labelsym);
if find_and_replace_tailcalls(n) then
begin
oldnodes:=n;
n:=internalstatements(s);
addstatement(s,labelnode);
addstatement(s,oldnodes);
end
else
labelnode.free;
end;
end.
|
