pass_2.pas 17 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480
  1. {
  2. $Id$
  3. Copyright (c) 1998-2002 by Florian Klaempfl
  4. This unit handles the codegeneration pass
  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 pass_2;
  19. {$i fpcdefs.inc}
  20. interface
  21. uses
  22. node;
  23. type
  24. tenumflowcontrol = (fc_exit,fc_break,fc_continue);
  25. tflowcontrol = set of tenumflowcontrol;
  26. var
  27. allow_multi_pass2 : boolean;
  28. flowcontrol : tflowcontrol;
  29. { produces assembler for the expression in variable p }
  30. { and produces an assembler node at the end }
  31. procedure generatecode(var p : tnode);
  32. { produces the actual code }
  33. function do_secondpass(var p : tnode) : boolean;
  34. procedure secondpass(var p : tnode);
  35. implementation
  36. uses
  37. {$ifdef EXTDEBUG}
  38. cutils,
  39. {$endif}
  40. globtype,systems,verbose,
  41. cclasses,globals,
  42. symconst,symbase,symtype,symsym,paramgr,
  43. aasmbase,aasmtai,
  44. pass_1,cpubase,cginfo,cgbase,
  45. {$ifdef EXTDEBUG}
  46. cgobj,
  47. {$endif EXTDEBUG}
  48. regvars,nflw,rgobj;
  49. {*****************************************************************************
  50. SecondPass
  51. *****************************************************************************}
  52. {$ifdef EXTDEBUG}
  53. procedure logsecond(ht:tnodetype; entry: boolean);
  54. const
  55. secondnames: array[tnodetype] of string[13] =
  56. ('<emptynode>',
  57. 'add-addn', {addn}
  58. 'add-muln', {muln}
  59. 'add-subn', {subn}
  60. 'moddiv-divn', {divn}
  61. 'add-symdifn', {symdifn}
  62. 'moddiv-modn', {modn}
  63. 'assignment', {assignn}
  64. 'load', {loadn}
  65. 'nothing-range', {range}
  66. 'add-ltn', {ltn}
  67. 'add-lten', {lten}
  68. 'add-gtn', {gtn}
  69. 'add-gten', {gten}
  70. 'add-equaln', {equaln}
  71. 'add-unequaln', {unequaln}
  72. 'in', {inn}
  73. 'add-orn', {orn}
  74. 'add-xorn', {xorn}
  75. 'shlshr-shrn', {shrn}
  76. 'shlshr-shln', {shln}
  77. 'add-slashn', {slashn}
  78. 'add-andn', {andn}
  79. 'subscriptn', {subscriptn}
  80. 'dderef', {derefn}
  81. 'addr', {addrn}
  82. 'doubleaddr', {doubleaddrn}
  83. 'ordconst', {ordconstn}
  84. 'typeconv', {typeconvn}
  85. 'calln', {calln}
  86. 'noth-callpar',{callparan}
  87. 'realconst', {realconstn}
  88. 'unaryminus', {unaryminusn}
  89. 'asm', {asmn}
  90. 'vecn', {vecn}
  91. 'pointerconst',{pointerconstn}
  92. 'stringconst', {stringconstn}
  93. 'not', {notn}
  94. 'inline', {inlinen}
  95. 'niln', {niln}
  96. 'error', {errorn}
  97. 'nothing-typen', {typen}
  98. 'setelement', {setelementn}
  99. 'setconst', {setconstn}
  100. 'blockn', {blockn}
  101. 'statement', {statementn}
  102. 'ifn', {ifn}
  103. 'breakn', {breakn}
  104. 'continuen', {continuen}
  105. 'while_repeat', {whilerepeatn}
  106. 'for', {forn}
  107. 'exitn', {exitn}
  108. 'with', {withn}
  109. 'case', {casen}
  110. 'label', {labeln}
  111. 'goto', {goton}
  112. 'tryexcept', {tryexceptn}
  113. 'raise', {raisen}
  114. 'tryfinally', {tryfinallyn}
  115. 'on', {onn}
  116. 'is', {isn}
  117. 'as', {asn}
  118. 'error-caret', {caretn}
  119. 'add-starstar', {starstarn}
  120. 'procinline', {procinlinen}
  121. 'arrayconstruc', {arrayconstructn}
  122. 'noth-arrcnstr', {arrayconstructrangen}
  123. 'tempcreaten',
  124. 'temprefn',
  125. 'tempdeleten',
  126. 'addoptn',
  127. 'nothing-nothg', {nothingn}
  128. 'loadvmt', {loadvmtn}
  129. 'guidconstn',
  130. 'rttin'
  131. );
  132. var
  133. p: pchar;
  134. begin
  135. if entry then
  136. p := strpnew('second '+secondnames[ht]+' (entry)')
  137. else
  138. p := strpnew('second '+secondnames[ht]+' (exit)');
  139. exprasmlist.concat(tai_comment.create(p));
  140. end;
  141. {$endif EXTDEBUG}
  142. procedure secondpass(var p : tnode);
  143. var
  144. oldcodegenerror : boolean;
  145. oldlocalswitches : tlocalswitches;
  146. oldpos : tfileposinfo;
  147. {$ifdef TEMPREGDEBUG}
  148. prevp : pptree;
  149. {$endif TEMPREGDEBUG}
  150. {$ifdef EXTDEBUG}
  151. i : longint;
  152. {$endif EXTDEBUG}
  153. begin
  154. if not assigned(p) then
  155. internalerror(200208221);
  156. if not(nf_error in p.flags) then
  157. begin
  158. oldcodegenerror:=codegenerror;
  159. oldlocalswitches:=aktlocalswitches;
  160. oldpos:=aktfilepos;
  161. {$ifdef TEMPREGDEBUG}
  162. testregisters32;
  163. prevp:=curptree;
  164. curptree:=@p;
  165. p^.usableregs:=usablereg32;
  166. {$endif TEMPREGDEBUG}
  167. aktfilepos:=p.fileinfo;
  168. aktlocalswitches:=p.localswitches;
  169. codegenerror:=false;
  170. {$ifdef EXTDEBUG}
  171. if (p.expectloc=LOC_INVALID) then
  172. Comment(V_Warning,'ExpectLoc is not set before secondpass: '+nodetype2str[p.nodetype]);
  173. if (not allow_multi_pass2) and
  174. (p.location.loc<>LOC_INVALID) then
  175. Comment(V_Warning,'Location.Loc is already set before secondpass: '+nodetype2str[p.nodetype]);
  176. if (cs_asm_nodes in aktglobalswitches) then
  177. logsecond(p.nodetype,true);
  178. {$endif EXTDEBUG}
  179. p.pass_2;
  180. {$ifdef EXTDEBUG}
  181. if (cs_asm_nodes in aktglobalswitches) then
  182. logsecond(p.nodetype,false);
  183. if (not codegenerror) then
  184. begin
  185. if (p.location.loc=LOC_INVALID) then
  186. Comment(V_Warning,'Location not set in secondpass: '+nodetype2str[p.nodetype])
  187. else if (p.location.loc<>p.expectloc) then
  188. Comment(V_Warning,'Location is different in secondpass: '+nodetype2str[p.nodetype]);
  189. end;
  190. { check if all scratch registers are freed }
  191. for i:=1 to max_scratch_regs do
  192. if not(scratch_regs[i] in cg.unusedscratchregisters) then
  193. begin
  194. printnode(stdout,p);
  195. internalerror(2003042201);
  196. end;
  197. {$endif EXTDEBUG}
  198. if codegenerror then
  199. include(p.flags,nf_error);
  200. codegenerror:=codegenerror or oldcodegenerror;
  201. aktlocalswitches:=oldlocalswitches;
  202. aktfilepos:=oldpos;
  203. {$ifdef TEMPREGDEBUG}
  204. curptree:=prevp;
  205. {$endif TEMPREGDEBUG}
  206. {$ifdef EXTTEMPREGDEBUG}
  207. if p.usableregs-usablereg32>p.reallyusedregs then
  208. p.reallyusedregs:=p.usableregs-usablereg32;
  209. if p.reallyusedregs<p.registers32 then
  210. Comment(V_Debug,'registers32 overestimated '+tostr(p^.registers32)+
  211. '>'+tostr(p^.reallyusedregs));
  212. {$endif EXTTEMPREGDEBUG}
  213. end
  214. else
  215. codegenerror:=true;
  216. end;
  217. function do_secondpass(var p : tnode) : boolean;
  218. begin
  219. codegenerror:=false;
  220. if not(nf_error in p.flags) then
  221. secondpass(p);
  222. do_secondpass:=codegenerror;
  223. end;
  224. procedure clearrefs(p : tnamedindexitem;arg:pointer);
  225. begin
  226. if (tsym(p).typ=varsym) then
  227. if tvarsym(p).refs>1 then
  228. tvarsym(p).refs:=1;
  229. end;
  230. procedure generatecode(var p : tnode);
  231. begin
  232. rg.cleartempgen;
  233. flowcontrol:=[];
  234. { when size optimization only count occurrence }
  235. if cs_littlesize in aktglobalswitches then
  236. rg.t_times:=1
  237. else
  238. { reference for repetition is 100 }
  239. rg.t_times:=100;
  240. { clear register count }
  241. rg.clearregistercount;
  242. use_esp_stackframe:=false;
  243. symtablestack.foreach_static({$ifdef FPCPROCVAR}@{$endif}clearrefs,nil);
  244. symtablestack.next.foreach_static({$ifdef FPCPROCVAR}@{$endif}clearrefs,nil);
  245. { firstpass everything }
  246. do_firstpass(p);
  247. { only do secondpass if there are no errors }
  248. if ErrorCount=0 then
  249. begin
  250. { assign parameter locations }
  251. {$ifndef i386}
  252. setparalocs(current_procinfo.procdef);
  253. {$endif i386}
  254. current_procinfo.after_pass1;
  255. { process register variable stuff (JM) }
  256. assign_regvars(p);
  257. load_regvars(current_procinfo.aktentrycode,p);
  258. { for the i386 it must be done in genexitcode because it has }
  259. { to add 'fstp' instructions when using fpu regvars and those }
  260. { must come after the "exitlabel" (JM) }
  261. {$ifndef i386}
  262. cleanup_regvars(current_procinfo.aktexitcode);
  263. {$endif i386}
  264. do_secondpass(p);
  265. if assigned(current_procinfo.procdef) then
  266. current_procinfo.procdef.fpu_used:=p.registersfpu;
  267. end;
  268. current_procinfo.aktproccode.concatlist(exprasmlist);
  269. end;
  270. end.
  271. {
  272. $Log$
  273. Revision 1.51 2003-05-13 19:14:41 peter
  274. * failn removed
  275. * inherited result code check moven to pexpr
  276. Revision 1.50 2003/05/09 17:47:02 peter
  277. * self moved to hidden parameter
  278. * removed hdisposen,hnewn,selfn
  279. Revision 1.49 2003/04/27 11:21:33 peter
  280. * aktprocdef renamed to current_procdef
  281. * procinfo renamed to current_procinfo
  282. * procinfo will now be stored in current_module so it can be
  283. cleaned up properly
  284. * gen_main_procsym changed to create_main_proc and release_main_proc
  285. to also generate a tprocinfo structure
  286. * fixed unit implicit initfinal
  287. Revision 1.48 2003/04/27 07:29:50 peter
  288. * current_procdef cleanup, current_procdef is now always nil when parsing
  289. a new procdef declaration
  290. * aktprocsym removed
  291. * lexlevel removed, use symtable.symtablelevel instead
  292. * implicit init/final code uses the normal genentry/genexit
  293. * funcret state checking updated for new funcret handling
  294. Revision 1.47 2003/04/25 20:59:33 peter
  295. * removed funcretn,funcretsym, function result is now in varsym
  296. and aliases for result and function name are added using absolutesym
  297. * vs_hidden parameter for funcret passed in parameter
  298. * vs_hidden fixes
  299. * writenode changed to printnode and released from extdebug
  300. * -vp option added to generate a tree.log with the nodetree
  301. * nicer printnode for statements, callnode
  302. Revision 1.46 2003/04/23 10:12:14 peter
  303. * allow multi pass2 changed to global boolean instead of node flag
  304. Revision 1.45 2003/04/22 23:50:23 peter
  305. * firstpass uses expectloc
  306. * checks if there are differences between the expectloc and
  307. location.loc from secondpass in EXTDEBUG
  308. Revision 1.44 2003/04/22 12:45:58 florian
  309. * fixed generic in operator code
  310. + added debug code to check if all scratch registers are released
  311. Revision 1.43 2003/01/09 20:40:59 daniel
  312. * Converted some code in cgx86.pas to new register numbering
  313. Revision 1.42 2003/01/09 15:49:56 daniel
  314. * Added register conversion
  315. Revision 1.41 2002/12/22 14:35:39 peter
  316. * removed Writeln
  317. Revision 1.40 2002/12/21 23:21:47 mazen
  318. + added support for the shift nodes
  319. + added debug output on screen with -an command line option
  320. Revision 1.39 2002/08/23 16:14:49 peter
  321. * tempgen cleanup
  322. * tt_noreuse temp type added that will be used in genentrycode
  323. Revision 1.38 2002/08/20 16:55:38 peter
  324. * don't write (stabs)line info when inlining a procedure
  325. Revision 1.37 2002/08/19 19:36:44 peter
  326. * More fixes for cross unit inlining, all tnodes are now implemented
  327. * Moved pocall_internconst to po_internconst because it is not a
  328. calling type at all and it conflicted when inlining of these small
  329. functions was requested
  330. Revision 1.36 2002/08/18 20:06:24 peter
  331. * inlining is now also allowed in interface
  332. * renamed write/load to ppuwrite/ppuload
  333. * tnode storing in ppu
  334. * nld,ncon,nbas are already updated for storing in ppu
  335. Revision 1.35 2002/08/17 09:23:38 florian
  336. * first part of procinfo rewrite
  337. Revision 1.34 2002/08/15 19:10:35 peter
  338. * first things tai,tnode storing in ppu
  339. Revision 1.33 2002/07/30 20:50:44 florian
  340. * the code generator knows now if parameters are in registers
  341. Revision 1.32 2002/07/19 11:41:36 daniel
  342. * State tracker work
  343. * The whilen and repeatn are now completely unified into whilerepeatn. This
  344. allows the state tracker to change while nodes automatically into
  345. repeat nodes.
  346. * Resulttypepass improvements to the notn. 'not not a' is optimized away and
  347. 'not(a>b)' is optimized into 'a<=b'.
  348. * Resulttypepass improvements to the whilerepeatn. 'while not a' is optimized
  349. by removing the notn and later switchting the true and falselabels. The
  350. same is done with 'repeat until not a'.
  351. Revision 1.31 2002/07/01 18:46:25 peter
  352. * internal linker
  353. * reorganized aasm layer
  354. Revision 1.30 2002/05/18 13:34:11 peter
  355. * readded missing revisions
  356. Revision 1.29 2002/05/16 19:46:42 carl
  357. + defines.inc -> fpcdefs.inc to avoid conflicts if compiling by hand
  358. + try to fix temp allocation (still in ifdef)
  359. + generic constructor calls
  360. + start of tassembler / tmodulebase class cleanup
  361. Revision 1.27 2002/05/12 16:53:08 peter
  362. * moved entry and exitcode to ncgutil and cgobj
  363. * foreach gets extra argument for passing local data to the
  364. iterator function
  365. * -CR checks also class typecasts at runtime by changing them
  366. into as
  367. * fixed compiler to cycle with the -CR option
  368. * fixed stabs with elf writer, finally the global variables can
  369. be watched
  370. * removed a lot of routines from cga unit and replaced them by
  371. calls to cgobj
  372. * u32bit-s32bit updates for and,or,xor nodes. When one element is
  373. u32bit then the other is typecasted also to u32bit without giving
  374. a rangecheck warning/error.
  375. * fixed pascal calling method with reversing also the high tree in
  376. the parast, detected by tcalcst3 test
  377. Revision 1.26 2002/04/21 19:02:04 peter
  378. * removed newn and disposen nodes, the code is now directly
  379. inlined from pexpr
  380. * -an option that will write the secondpass nodes to the .s file, this
  381. requires EXTDEBUG define to actually write the info
  382. * fixed various internal errors and crashes due recent code changes
  383. Revision 1.25 2002/04/20 21:32:24 carl
  384. + generic FPC_CHECKPOINTER
  385. + first parameter offset in stack now portable
  386. * rename some constants
  387. + move some cpu stuff to other units
  388. - remove unused constents
  389. * fix stacksize for some targets
  390. * fix generic size problems which depend now on EXTEND_SIZE constant
  391. Revision 1.24 2002/04/07 13:30:13 carl
  392. - removed unused variable
  393. Revision 1.23 2002/04/02 17:11:29 peter
  394. * tlocation,treference update
  395. * LOC_CONSTANT added for better constant handling
  396. * secondadd splitted in multiple routines
  397. * location_force_reg added for loading a location to a register
  398. of a specified size
  399. * secondassignment parses now first the right and then the left node
  400. (this is compatible with Kylix). This saves a lot of push/pop especially
  401. with string operations
  402. * adapted some routines to use the new cg methods
  403. Revision 1.22 2002/03/31 20:26:35 jonas
  404. + a_loadfpu_* and a_loadmm_* methods in tcg
  405. * register allocation is now handled by a class and is mostly processor
  406. independent (+rgobj.pas and i386/rgcpu.pas)
  407. * temp allocation is now handled by a class (+tgobj.pas, -i386\tgcpu.pas)
  408. * some small improvements and fixes to the optimizer
  409. * some register allocation fixes
  410. * some fpuvaroffset fixes in the unary minus node
  411. * push/popusedregisters is now called rg.save/restoreusedregisters and
  412. (for i386) uses temps instead of push/pop's when using -Op3 (that code is
  413. also better optimizable)
  414. * fixed and optimized register saving/restoring for new/dispose nodes
  415. * LOC_FPU locations now also require their "register" field to be set to
  416. R_ST, not R_ST0 (the latter is used for LOC_CFPUREGISTER locations only)
  417. - list field removed of the tnode class because it's not used currently
  418. and can cause hard-to-find bugs
  419. }