pass_2.pas 17 KB

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