pass_2.pas 19 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507
  1. {
  2. $Id$
  3. Copyright (c) 1998-2000 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. {$ifdef TP}
  19. {$E+,F+,N+}
  20. {$endif}
  21. unit pass_2;
  22. interface
  23. uses
  24. tree;
  25. { produces assembler for the expression in variable p }
  26. { and produces an assembler node at the end }
  27. procedure generatecode(var _p : ptree);
  28. { produces the actual code }
  29. function do_secondpass(p : pnode) : boolean;
  30. procedure secondpass(p : pnode);
  31. implementation
  32. uses
  33. globtype,systems,
  34. cobjects,verbose,comphook,globals,files,
  35. symconst,symtable,types,aasm,scanner,
  36. pass_1,tgobj,cgbase,cgobj,tgcpu,cpuasm,cpubase,convtree
  37. {$ifdef GDB}
  38. ,gdb
  39. {$endif}
  40. ;
  41. type
  42. perrornode = ^terrornode;
  43. terrornode = object(tnode)
  44. constructor init;
  45. procedure secondpass;virtual;
  46. end;
  47. tstatementnode = object(tbinarynode)
  48. procedure secondpass;virtual;
  49. end;
  50. tblocknode = object(tunarynode)
  51. procedure secondpass;virtual;
  52. end;
  53. tasmnode = object(tnode)
  54. p_asm : paasmoutput;
  55. object_preserved : boolean;
  56. procedure secondpass;virtual;
  57. end;
  58. {****************************************************************************
  59. TERRORNODE
  60. ****************************************************************************}
  61. constructor terrornode.init;
  62. begin
  63. inherited init;
  64. treetype:=errorn;
  65. end;
  66. procedure terrornode.secondpass;
  67. begin
  68. error:=true;
  69. codegenerror:=true;
  70. end;
  71. {****************************************************************************
  72. TSTATEMENTNODE
  73. ****************************************************************************}
  74. procedure tstatementnode.secondpass;
  75. var
  76. hp : pbinarynode;
  77. oldrl : plinkedlist;
  78. begin
  79. hp:=@self;
  80. while assigned(hp) do
  81. begin
  82. if assigned(hp^.right) then
  83. begin
  84. tg.cleartempgen;
  85. oldrl:=temptoremove;
  86. temptoremove:=new(plinkedlist,init);
  87. hp^.right^.secondpass;
  88. { release temp. ansi strings }
  89. cg^.g_removetemps(exprasmlist,temptoremove);
  90. dispose(temptoremove,done);
  91. temptoremove:=oldrl;
  92. end;
  93. hp:=pbinarynode(hp^.left);
  94. end;
  95. end;
  96. procedure tblocknode.secondpass;
  97. begin
  98. { do second pass on left node }
  99. if assigned(left) then
  100. left^.secondpass;
  101. end;
  102. procedure tasmnode.secondpass;
  103. begin
  104. exprasmlist^.concatlist(p_asm);
  105. if not object_preserved then
  106. cg^.g_maybe_loadself(exprasmlist);
  107. end;
  108. function generateexprlist(p : pnode) : plinkedlist;
  109. var
  110. l : plinkedlist;
  111. begin
  112. l:=new(plinkedlist,init);
  113. p^.concattolist(l);
  114. generateexprlist:=l;
  115. end;
  116. procedure secondpass(p : pnode);
  117. var
  118. oldcodegenerror : boolean;
  119. oldlocalswitches : tlocalswitches;
  120. oldpos : tfileposinfo;
  121. l : plinkedlist;
  122. hp : pnode;
  123. begin
  124. if not(p^.error) then
  125. begin
  126. oldcodegenerror:=codegenerror;
  127. oldlocalswitches:=aktlocalswitches;
  128. oldpos:=aktfilepos;
  129. aktfilepos:=p^.fileinfo;
  130. aktlocalswitches:=p^.localswitches;
  131. codegenerror:=false;
  132. { do we have a list of statements? }
  133. if p^.treetype=statementn then
  134. begin
  135. l:=generateexprlist(p);
  136. { here we should do CSE and node reordering }
  137. hp:=pnode(l^.first);
  138. while assigned(hp) do
  139. begin
  140. if assigned(hp^.parent) then
  141. begin
  142. if nf_needs_truefalselabel in hp^.parent^.flags then
  143. begin
  144. if not(assigned(punarynode(hp^.parent)^.truelabel)) then
  145. getlabel(punarynode(hp^.parent)^.truelabel);
  146. if not(assigned(punarynode(hp^.parent)^.falselabel)) then
  147. getlabel(punarynode(hp^.parent)^.falselabel);
  148. truelabel:=punarynode(hp^.parent)^.truelabel;
  149. falselabel:=punarynode(hp^.parent)^.falselabel;
  150. end;
  151. end;
  152. hp^.secondpass;
  153. hp:=pnode(hp^.next);
  154. end;
  155. end
  156. else
  157. p^.secondpass;
  158. p^.error:=codegenerror;
  159. codegenerror:=codegenerror or oldcodegenerror;
  160. aktlocalswitches:=oldlocalswitches;
  161. aktfilepos:=oldpos;
  162. end
  163. else
  164. codegenerror:=true;
  165. end;
  166. function do_secondpass(p : pnode) : boolean;
  167. begin
  168. codegenerror:=false;
  169. if not(p^.error) then
  170. secondpass(p);
  171. do_secondpass:=codegenerror;
  172. end;
  173. var
  174. regvars : array[1..maxvarregs] of pvarsym;
  175. regvars_para : array[1..maxvarregs] of boolean;
  176. regvars_refs : array[1..maxvarregs] of longint;
  177. parasym : boolean;
  178. procedure searchregvars(p : pnamedindexobject);
  179. var
  180. i,j,k : longint;
  181. begin
  182. if (pvarsym(p)^.typ=varsym) and (vo_regable in pvarsym(p)^.varoptions) then
  183. begin
  184. { walk through all momentary register variables }
  185. for i:=1 to maxvarregs do
  186. begin
  187. { free register ? }
  188. if regvars[i]=nil then
  189. begin
  190. regvars[i]:=pvarsym(p);
  191. regvars_para[i]:=parasym;
  192. break;
  193. end;
  194. { else throw out a variable ? }
  195. j:=pvarsym(p)^.refs;
  196. { parameter get a less value }
  197. if parasym then
  198. begin
  199. if cs_littlesize in aktglobalswitches then
  200. dec(j,1)
  201. else
  202. dec(j,100);
  203. end;
  204. if (j>regvars_refs[i]) and (j>0) then
  205. begin
  206. for k:=maxvarregs-1 downto i do
  207. begin
  208. regvars[k+1]:=regvars[k];
  209. regvars_para[k+1]:=regvars_para[k];
  210. end;
  211. { calc the new refs
  212. pvarsym(p)^.refs:=j; }
  213. regvars[i]:=pvarsym(p);
  214. regvars_para[i]:=parasym;
  215. regvars_refs[i]:=j;
  216. break;
  217. end;
  218. end;
  219. end;
  220. end;
  221. procedure generatecode(var _p : ptree);
  222. var
  223. i : longint;
  224. hr : preference;
  225. {$ifdef i386}
  226. regsize : topsize;
  227. {$endif i386}
  228. p : pnode;
  229. label
  230. nextreg;
  231. begin
  232. temptoremove:=nil;
  233. tg.cleartempgen;
  234. { when size optimization only count occurrence }
  235. if cs_littlesize in aktglobalswitches then
  236. t_times:=1
  237. else
  238. { reference for repetition is 100 }
  239. t_times:=100;
  240. { clear register count }
  241. tg.clearregistercount;
  242. use_esp_stackframe:=false;
  243. if not(do_firstpass(_p)) then
  244. begin
  245. p:=convtree2node(_p);
  246. { max. optimizations }
  247. { only if no asm is used }
  248. { and no try statement }
  249. if (cs_regalloc in aktglobalswitches) and
  250. ((procinfo^.flags and (pi_uses_asm or pi_uses_exceptions))=0) then
  251. begin
  252. { can we omit the stack frame ? }
  253. { conditions:
  254. 1. procedure (not main block)
  255. 2. no constructor or destructor
  256. 3. no call to other procedures
  257. 4. no interrupt handler
  258. }
  259. if assigned(aktprocsym) then
  260. begin
  261. if not(aktprocsym^.definition^.proctypeoption in [potype_constructor,potype_destructor]) and
  262. not(po_interrupt in aktprocsym^.definition^.procoptions) and
  263. ((procinfo^.flags and pi_do_call)=0) and
  264. (lexlevel>=normal_function_level) then
  265. begin
  266. { use ESP as frame pointer }
  267. procinfo^.framepointer:=stack_pointer;
  268. use_esp_stackframe:=true;
  269. { calc parameter distance new }
  270. dec(procinfo^.framepointer_offset,pointersize);
  271. dec(procinfo^.selfpointer_offset,pointersize);
  272. { is this correct ???}
  273. { retoffset can be negativ for results in eax !! }
  274. { the value should be decreased only if positive }
  275. if procinfo^.return_offset>=0 then
  276. dec(procinfo^.return_offset,4);
  277. dec(procinfo^.para_offset,4);
  278. aktprocsym^.definition^.parast^.address_fixup:=procinfo^.para_offset;
  279. end;
  280. end;
  281. if (p^.registersint<maxvarregs) then
  282. begin
  283. for i:=1 to maxvarregs do
  284. regvars[i]:=nil;
  285. parasym:=false;
  286. {$ifdef tp}
  287. symtablestack^.foreach(searchregvars);
  288. {$else}
  289. symtablestack^.foreach(@searchregvars);
  290. {$endif}
  291. { copy parameter into a register ? }
  292. parasym:=true;
  293. {$ifdef tp}
  294. symtablestack^.next^.foreach(searchregvars);
  295. {$else}
  296. symtablestack^.next^.foreach(@searchregvars);
  297. {$endif}
  298. { hold needed registers free }
  299. for i:=maxvarregs downto maxvarregs-p^.registersint+1 do
  300. regvars[i]:=nil;
  301. { now assign register }
  302. for i:=1 to maxvarregs-p^.registersint do
  303. begin
  304. if assigned(regvars[i]) then
  305. begin
  306. { it is nonsens, to copy the variable to }
  307. { a register because we need then much }
  308. { pushes ? }
  309. if tg.reg_pushes[varregs[i]]>=regvars[i]^.refs then
  310. begin
  311. regvars[i]:=nil;
  312. goto nextreg;
  313. end;
  314. { register is no longer available for }
  315. { expressions }
  316. { search the register which is the most }
  317. { unused }
  318. exclude(tg.availabletempregsint,varregs[i]);
  319. tg.is_reg_var[varregs[i]]:=true;
  320. dec(tg.c_countusableregsint);
  321. { possibly no 32 bit register are needed }
  322. { call by reference/const ? }
  323. {!!!!!!!!!!!!!!
  324. if (regvars[i]^.varspez=vs_var) or
  325. ((regvars[i]^.varspez=vs_const) and
  326. dont_copy_const_param(regvars[i]^.definition)) then
  327. begin
  328. regvars[i]^.reg:=varregs[i];
  329. regsize:=sizepostfix_pointer;
  330. end
  331. else
  332. if (regvars[i]^.definition^.deftype=orddef) and
  333. (porddef(regvars[i]^.definition)^.size=1) then
  334. begin
  335. regvars[i]^.reg:=regtoreg8(varregs[i]);
  336. regsize:=S_B;
  337. end
  338. else
  339. if (regvars[i]^.definition^.deftype=orddef) and
  340. (porddef(regvars[i]^.definition)^.size=2) then
  341. begin
  342. regvars[i]^.reg:=regtoreg16(varregs[i]);
  343. regsize:=S_W;
  344. end
  345. else
  346. if (regvars[i]^.definition^.deftype=orddef) and
  347. (porddef(regvars[i]^.definition)^.size=4) then
  348. begin
  349. regvars[i]^.reg:=regtoreg32(varregs[i]);
  350. regsize:=S_L;
  351. end
  352. else
  353. if (cf_registers64 in cpuflags) and
  354. (regvars[i]^.definition^.deftype=orddef) and
  355. (porddef(regvars[i]^.definition)^.size=8) then
  356. begin
  357. regvars[i]^.reg:=regtoreg64(varregs[i]);
  358. regsize:=S_Q;
  359. end;
  360. }
  361. { parameter must be load }
  362. if regvars_para[i] then
  363. begin
  364. { procinfo is there actual, }
  365. { because we can't never be in a }
  366. { nested procedure }
  367. { when loading parameter to reg }
  368. new(hr);
  369. reset_reference(hr^);
  370. hr^.offset:=pvarsym(regvars[i])^.address+procinfo^.para_offset;
  371. hr^.base:=procinfo^.framepointer;
  372. {$ifdef i386}
  373. procinfo^.aktentrycode^.concat(new(paicpu,op_ref_reg(A_MOV,regsize,
  374. hr,regvars[i]^.reg)));
  375. {$endif i386}
  376. {$ifdef m68k}
  377. procinfo.aktentrycode^.concat(new(pai68k,op_ref_reg(A_MOVE,regsize,
  378. hr,regvars[i]^.reg)));
  379. {$endif m68k}
  380. tg.unusedregsint:=tg.unusedregsint - [regvars[i]^.reg];
  381. end;
  382. { procedure uses this register }
  383. include(tg.usedinproc,varregs[i]);
  384. end;
  385. nextreg:
  386. {$ifdef i386}
  387. { dummy }
  388. regsize:=S_W;
  389. {$endif i386}
  390. end;
  391. if (status.verbosity and v_debug)=v_debug then
  392. begin
  393. for i:=1 to maxvarregs do
  394. begin
  395. if assigned(regvars[i]) then
  396. Message3(cg_d_register_weight,reg2str(regvars[i]^.reg),
  397. tostr(regvars[i]^.refs),regvars[i]^.name);
  398. end;
  399. end;
  400. end;
  401. end;
  402. if assigned(aktprocsym) and
  403. (pocall_inline in aktprocsym^.definition^.proccalloptions) then
  404. make_const_global:=true;
  405. do_secondpass(p);
  406. if assigned(procinfo^.def) then
  407. procinfo^.def^.fpu_used:=p^.registersfpu;
  408. { all registers can be used again }
  409. tg.resetusableregisters;
  410. end;
  411. procinfo^.aktproccode^.concatlist(exprasmlist);
  412. make_const_global:=false;
  413. end;
  414. end.
  415. {
  416. $Log$
  417. Revision 1.1 2000-07-13 06:30:08 michael
  418. + Initial import
  419. Revision 1.11 2000/02/20 20:49:46 florian
  420. * newcg is compiling
  421. * fixed the dup id problem reported by Paul Y.
  422. Revision 1.10 2000/01/07 01:14:54 peter
  423. * updated copyright to 2000
  424. Revision 1.9 1999/12/06 18:17:10 peter
  425. * newcg compiler compiles again
  426. Revision 1.8 1999/10/12 21:20:47 florian
  427. * new codegenerator compiles again
  428. Revision 1.7 1999/08/25 12:00:13 jonas
  429. * changed pai386, paippc and paiapha (same for tai*) to paicpu (taicpu)
  430. Revision 1.6 1999/08/05 14:58:15 florian
  431. * some fixes for the floating point registers
  432. * more things for the new code generator
  433. Revision 1.5 1999/08/04 00:23:58 florian
  434. * renamed i386asm and i386base to cpuasm and cpubase
  435. Revision 1.4 1999/08/03 17:09:46 florian
  436. * the alpha compiler can be compiled now
  437. Revision 1.3 1999/08/03 00:30:36 florian
  438. * again a fix for the alpha
  439. Revision 1.2 1999/08/03 00:28:03 florian
  440. * some updates to compile for the alpha
  441. Revision 1.1 1999/08/03 00:07:16 florian
  442. * initial revision
  443. }