nutils.pas 8.5 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268
  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. pass_1;
  48. function foreachnode(var n: tnode; f: foreachnodefunction): boolean;
  49. begin
  50. result := false;
  51. if not assigned(n) then
  52. exit;
  53. case f(n) of
  54. fen_norecurse_false:
  55. exit;
  56. fen_norecurse_true:
  57. begin
  58. result := true;
  59. exit;
  60. end;
  61. fen_true:
  62. result := true;
  63. { result is already false
  64. fen_false:
  65. result := false; }
  66. end;
  67. case n.nodetype of
  68. calln:
  69. result := foreachnode(tcallnode(n).methodpointer,f) or result;
  70. procinlinen:
  71. result := foreachnode(tprocinlinenode(n).inlinetree,f) or result;
  72. ifn, whilerepeatn, forn:
  73. begin
  74. { not in one statement, won't work because of b- }
  75. result := foreachnode(tloopnode(n).t1,f) or result;
  76. result := foreachnode(tloopnode(n).t2,f) or result;
  77. end;
  78. raisen:
  79. result := foreachnode(traisenode(n).frametree,f) or result;
  80. casen:
  81. result := foreachnode(tcasenode(n). elseblock,f) or result;
  82. end;
  83. if n.inheritsfrom(tbinarynode) then
  84. begin
  85. result := foreachnode(tbinarynode(n).right,f) or result;
  86. result := foreachnode(tbinarynode(n).left,f) or result;
  87. end
  88. else if n.inheritsfrom(tunarynode) then
  89. result := foreachnode(tunarynode(n).left,f) or result;
  90. end;
  91. function foreachnodestatic(var n: tnode; f: staticforeachnodefunction): boolean;
  92. begin
  93. result := false;
  94. if not assigned(n) then
  95. exit;
  96. case f(n) of
  97. fen_norecurse_false:
  98. exit;
  99. fen_norecurse_true:
  100. begin
  101. result := true;
  102. exit;
  103. end;
  104. fen_true:
  105. result := true;
  106. { result is already false
  107. fen_false:
  108. result := false; }
  109. end;
  110. case n.nodetype of
  111. calln:
  112. result := foreachnodestatic(tcallnode(n).methodpointer,f) or result;
  113. procinlinen:
  114. result := foreachnodestatic(tprocinlinenode(n).inlinetree,f) or result;
  115. ifn, whilerepeatn, forn:
  116. begin
  117. { not in one statement, won't work because of b- }
  118. result := foreachnodestatic(tloopnode(n).t1,f) or result;
  119. result := foreachnodestatic(tloopnode(n).t2,f) or result;
  120. end;
  121. raisen:
  122. result := foreachnodestatic(traisenode(n).frametree,f) or result;
  123. casen:
  124. result := foreachnodestatic(tcasenode(n). elseblock,f) or result;
  125. end;
  126. if n.inheritsfrom(tbinarynode) then
  127. begin
  128. result := foreachnodestatic(tbinarynode(n).right,f) or result;
  129. result := foreachnodestatic(tbinarynode(n).left,f) or result;
  130. end
  131. else if n.inheritsfrom(tunarynode) then
  132. result := foreachnodestatic(tunarynode(n).left,f) or result;
  133. end;
  134. function call_fail_node:tnode;
  135. var
  136. para : tcallparanode;
  137. newstatement : tstatementnode;
  138. srsym : tsym;
  139. begin
  140. result:=internalstatements(newstatement,true);
  141. { call fail helper and exit normal }
  142. if is_class(current_procdef._class) then
  143. begin
  144. srsym:=search_class_member(current_procdef._class,'FREEINSTANCE');
  145. if assigned(srsym) and
  146. (srsym.typ=procsym) then
  147. begin
  148. { if self<>0 and vmt=1 then freeinstance }
  149. addstatement(newstatement,cifnode.create(
  150. caddnode.create(andn,
  151. caddnode.create(unequaln,
  152. load_self_pointer_node,
  153. cnilnode.create),
  154. caddnode.create(equaln,
  155. ctypeconvnode.create(
  156. load_vmt_pointer_node,
  157. voidpointertype),
  158. cpointerconstnode.create(1,voidpointertype))),
  159. ccallnode.create(nil,tprocsym(srsym),srsym.owner,load_self_node),
  160. nil));
  161. end
  162. else
  163. internalerror(200305108);
  164. end
  165. else
  166. if is_object(current_procdef._class) then
  167. begin
  168. { parameter 3 : vmt_offset }
  169. { parameter 2 : pointer to vmt }
  170. { parameter 1 : self pointer }
  171. para:=ccallparanode.create(
  172. cordconstnode.create(current_procdef._class.vmt_offset,s32bittype,false),
  173. ccallparanode.create(
  174. ctypeconvnode.create_explicit(
  175. load_vmt_pointer_node,
  176. voidpointertype),
  177. ccallparanode.create(
  178. ctypeconvnode.create_explicit(
  179. load_self_pointer_node,
  180. voidpointertype),
  181. nil)));
  182. addstatement(newstatement,
  183. ccallnode.createintern('fpc_help_fail',para));
  184. end
  185. else
  186. internalerror(200305132);
  187. { self:=nil }
  188. addstatement(newstatement,cassignmentnode.create(
  189. load_self_pointer_node,
  190. cnilnode.create));
  191. { exit }
  192. addstatement(newstatement,cexitnode.create(nil));
  193. end;
  194. function initialize_data_node(p:tnode):tnode;
  195. begin
  196. if not assigned(p.resulttype.def) then
  197. resulttypepass(p);
  198. result:=ccallnode.createintern('fpc_initialize',
  199. ccallparanode.create(
  200. caddrnode.create(
  201. crttinode.create(
  202. tstoreddef(p.resulttype.def),initrtti)),
  203. ccallparanode.create(
  204. caddrnode.create(p),
  205. nil)));
  206. end;
  207. function finalize_data_node(p:tnode):tnode;
  208. begin
  209. if not assigned(p.resulttype.def) then
  210. resulttypepass(p);
  211. result:=ccallnode.createintern('fpc_finalize',
  212. ccallparanode.create(
  213. caddrnode.create(
  214. crttinode.create(
  215. tstoreddef(p.resulttype.def),initrtti)),
  216. ccallparanode.create(
  217. caddrnode.create(p),
  218. nil)));
  219. end;
  220. end.
  221. {
  222. $Log$
  223. Revision 1.4 2003-05-16 14:33:31 peter
  224. * regvar fixes
  225. Revision 1.3 2003/05/13 20:54:06 peter
  226. * fail checks vmt value before calling dispose
  227. Revision 1.2 2003/05/13 19:14:41 peter
  228. * failn removed
  229. * inherited result code check moven to pexpr
  230. Revision 1.1 2003/04/23 12:35:34 florian
  231. * fixed several issues with powerpc
  232. + applied a patch from Jonas for nested function calls (PowerPC only)
  233. * ...
  234. }