nutils.pas 9.1 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286
  1. {
  2. $Id$
  3. Copyright (c) 1998-2002 by Florian Klaempfl
  4. Type checking and register allocation for inline nodes
  5. This program is free software; you can redistribute it and/or modify
  6. it under the terms of the GNU General Public License as published by
  7. the Free Software Foundation; either version 2 of the License, or
  8. (at your option) any later version.
  9. This program is distributed in the hope that it will be useful,
  10. but WITHOUT ANY WARRANTY; without even the implied warranty of
  11. MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
  12. GNU General Public License for more details.
  13. You should have received a copy of the GNU General Public License
  14. along with this program; if not, write to the Free Software
  15. Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
  16. ****************************************************************************
  17. }
  18. unit nutils;
  19. {$i fpcdefs.inc}
  20. interface
  21. uses
  22. node;
  23. type
  24. { resulttype of functions that process on all nodes in a (sub)tree }
  25. foreachnoderesult = (
  26. { false, continue recursion }
  27. fen_false,
  28. { false, stop recursion }
  29. fen_norecurse_false,
  30. { true, continue recursion }
  31. fen_true,
  32. { true, stop recursion }
  33. fen_norecurse_true
  34. );
  35. foreachnodefunction = function(var n: tnode): foreachnoderesult of object;
  36. staticforeachnodefunction = function(var n: tnode): foreachnoderesult;
  37. function foreachnode(var n: tnode; f: foreachnodefunction): boolean;
  38. function foreachnodestatic(var n: tnode; f: staticforeachnodefunction): boolean;
  39. function call_fail_node:tnode;
  40. function initialize_data_node(p:tnode):tnode;
  41. function finalize_data_node(p:tnode):tnode;
  42. implementation
  43. uses
  44. verbose,
  45. symconst,symsym,symtype,symdef,symtable,
  46. nbas,ncon,ncnv,nld,nflw,nset,ncal,nadd,nmem,
  47. cgbase,procinfo,
  48. pass_1;
  49. function foreachnode(var n: tnode; f: foreachnodefunction): boolean;
  50. begin
  51. result := false;
  52. if not assigned(n) then
  53. exit;
  54. case f(n) of
  55. fen_norecurse_false:
  56. exit;
  57. fen_norecurse_true:
  58. begin
  59. result := true;
  60. exit;
  61. end;
  62. fen_true:
  63. result := true;
  64. { result is already false
  65. fen_false:
  66. result := false; }
  67. end;
  68. case n.nodetype of
  69. calln:
  70. begin
  71. { not in one statement, won't work because of b- }
  72. result := foreachnode(tcallnode(n).methodpointer,f) or result;
  73. result := foreachnode(tcallnode(n).inlinecode,f) or result;
  74. end;
  75. ifn, whilerepeatn, forn:
  76. begin
  77. { not in one statement, won't work because of b- }
  78. result := foreachnode(tloopnode(n).t1,f) or result;
  79. result := foreachnode(tloopnode(n).t2,f) or result;
  80. end;
  81. raisen:
  82. result := foreachnode(traisenode(n).frametree,f) or result;
  83. casen:
  84. result := foreachnode(tcasenode(n). elseblock,f) or result;
  85. end;
  86. if n.inheritsfrom(tbinarynode) then
  87. begin
  88. result := foreachnode(tbinarynode(n).right,f) or result;
  89. result := foreachnode(tbinarynode(n).left,f) or result;
  90. end
  91. else if n.inheritsfrom(tunarynode) then
  92. result := foreachnode(tunarynode(n).left,f) or result;
  93. end;
  94. function foreachnodestatic(var n: tnode; f: staticforeachnodefunction): boolean;
  95. begin
  96. result := false;
  97. if not assigned(n) then
  98. exit;
  99. case f(n) of
  100. fen_norecurse_false:
  101. exit;
  102. fen_norecurse_true:
  103. begin
  104. result := true;
  105. exit;
  106. end;
  107. fen_true:
  108. result := true;
  109. { result is already false
  110. fen_false:
  111. result := false; }
  112. end;
  113. case n.nodetype of
  114. calln:
  115. begin
  116. result := foreachnodestatic(tcallnode(n).methodpointer,f) or result;
  117. result := foreachnodestatic(tcallnode(n).inlinecode,f) or result;
  118. end;
  119. ifn, whilerepeatn, forn:
  120. begin
  121. { not in one statement, won't work because of b- }
  122. result := foreachnodestatic(tloopnode(n).t1,f) or result;
  123. result := foreachnodestatic(tloopnode(n).t2,f) or result;
  124. end;
  125. raisen:
  126. result := foreachnodestatic(traisenode(n).frametree,f) or result;
  127. casen:
  128. result := foreachnodestatic(tcasenode(n). elseblock,f) or result;
  129. end;
  130. if n.inheritsfrom(tbinarynode) then
  131. begin
  132. result := foreachnodestatic(tbinarynode(n).right,f) or result;
  133. result := foreachnodestatic(tbinarynode(n).left,f) or result;
  134. end
  135. else if n.inheritsfrom(tunarynode) then
  136. result := foreachnodestatic(tunarynode(n).left,f) or result;
  137. end;
  138. function call_fail_node:tnode;
  139. var
  140. para : tcallparanode;
  141. newstatement : tstatementnode;
  142. srsym : tsym;
  143. begin
  144. result:=internalstatements(newstatement,true);
  145. { call fail helper and exit normal }
  146. if is_class(current_procinfo.procdef._class) then
  147. begin
  148. srsym:=search_class_member(current_procinfo.procdef._class,'FREEINSTANCE');
  149. if assigned(srsym) and
  150. (srsym.typ=procsym) then
  151. begin
  152. { if self<>0 and vmt=1 then freeinstance }
  153. addstatement(newstatement,cifnode.create(
  154. caddnode.create(andn,
  155. caddnode.create(unequaln,
  156. load_self_pointer_node,
  157. cnilnode.create),
  158. caddnode.create(equaln,
  159. ctypeconvnode.create(
  160. load_vmt_pointer_node,
  161. voidpointertype),
  162. cpointerconstnode.create(1,voidpointertype))),
  163. ccallnode.create(nil,tprocsym(srsym),srsym.owner,load_self_node),
  164. nil));
  165. end
  166. else
  167. internalerror(200305108);
  168. end
  169. else
  170. if is_object(current_procinfo.procdef._class) then
  171. begin
  172. { parameter 3 : vmt_offset }
  173. { parameter 2 : pointer to vmt }
  174. { parameter 1 : self pointer }
  175. para:=ccallparanode.create(
  176. cordconstnode.create(current_procinfo.procdef._class.vmt_offset,s32bittype,false),
  177. ccallparanode.create(
  178. ctypeconvnode.create_explicit(
  179. load_vmt_pointer_node,
  180. voidpointertype),
  181. ccallparanode.create(
  182. ctypeconvnode.create_explicit(
  183. load_self_pointer_node,
  184. voidpointertype),
  185. nil)));
  186. addstatement(newstatement,
  187. ccallnode.createintern('fpc_help_fail',para));
  188. end
  189. else
  190. internalerror(200305132);
  191. { self:=nil }
  192. addstatement(newstatement,cassignmentnode.create(
  193. load_self_pointer_node,
  194. cnilnode.create));
  195. { exit }
  196. addstatement(newstatement,cexitnode.create(nil));
  197. end;
  198. function initialize_data_node(p:tnode):tnode;
  199. begin
  200. if not assigned(p.resulttype.def) then
  201. resulttypepass(p);
  202. result:=ccallnode.createintern('fpc_initialize',
  203. ccallparanode.create(
  204. caddrnode.create(
  205. crttinode.create(
  206. tstoreddef(p.resulttype.def),initrtti)),
  207. ccallparanode.create(
  208. caddrnode.create(p),
  209. nil)));
  210. end;
  211. function finalize_data_node(p:tnode):tnode;
  212. begin
  213. if not assigned(p.resulttype.def) then
  214. resulttypepass(p);
  215. result:=ccallnode.createintern('fpc_finalize',
  216. ccallparanode.create(
  217. caddrnode.create(
  218. crttinode.create(
  219. tstoreddef(p.resulttype.def),initrtti)),
  220. ccallparanode.create(
  221. caddrnode.create(p),
  222. nil)));
  223. end;
  224. end.
  225. {
  226. $Log$
  227. Revision 1.7 2003-10-01 20:34:49 peter
  228. * procinfo unit contains tprocinfo
  229. * cginfo renamed to cgbase
  230. * moved cgmessage to verbose
  231. * fixed ppc and sparc compiles
  232. Revision 1.6 2003/06/13 21:19:30 peter
  233. * current_procdef removed, use current_procinfo.procdef instead
  234. Revision 1.5 2003/05/26 21:17:17 peter
  235. * procinlinenode removed
  236. * aktexit2label removed, fast exit removed
  237. + tcallnode.inlined_pass_2 added
  238. Revision 1.4 2003/05/16 14:33:31 peter
  239. * regvar fixes
  240. Revision 1.3 2003/05/13 20:54:06 peter
  241. * fail checks vmt value before calling dispose
  242. Revision 1.2 2003/05/13 19:14:41 peter
  243. * failn removed
  244. * inherited result code check moven to pexpr
  245. Revision 1.1 2003/04/23 12:35:34 florian
  246. * fixed several issues with powerpc
  247. + applied a patch from Jonas for nested function calls (PowerPC only)
  248. * ...
  249. }