pass_2.pas 18 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485
  1. {
  2. $Id$
  3. Copyright (c) 1993-98 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(var p : ptree) : boolean;
  30. procedure secondpass(var p : ptree);
  31. implementation
  32. uses
  33. cobjects,verbose,comphook,systems,globals,files,
  34. symtable,types,aasm,scanner,
  35. pass_1,hcodegen,temp_gen
  36. {$ifdef GDB}
  37. ,gdb
  38. {$endif}
  39. {$ifdef i386}
  40. ,i386,tgeni386,cgai386
  41. ,cg386con,cg386mat,cg386cnv,cg386set,cg386add
  42. ,cg386mem,cg386cal,cg386ld,cg386flw,cg386inl
  43. {$endif}
  44. {$ifdef m68k}
  45. ,m68k,tgen68k,cga68k
  46. ,cg68kcon,cg68kmat,cg68kcnv,cg68kset,cg68kadd
  47. ,cg68kmem,cg68kcal,cg68kld,cg68kflw,cg68kinl
  48. {$endif}
  49. ;
  50. {*****************************************************************************
  51. SecondPass
  52. *****************************************************************************}
  53. type
  54. secondpassproc = procedure(var p : ptree);
  55. procedure secondnothing(var p : ptree);
  56. begin
  57. end;
  58. procedure seconderror(var p : ptree);
  59. begin
  60. p^.error:=true;
  61. codegenerror:=true;
  62. end;
  63. procedure secondstatement(var p : ptree);
  64. var
  65. hp : ptree;
  66. begin
  67. hp:=p;
  68. while assigned(hp) do
  69. begin
  70. if assigned(hp^.right) then
  71. begin
  72. cleartempgen;
  73. secondpass(hp^.right);
  74. end;
  75. hp:=hp^.left;
  76. end;
  77. end;
  78. procedure secondblockn(var p : ptree);
  79. begin
  80. { do second pass on left node }
  81. if assigned(p^.left) then
  82. secondpass(p^.left);
  83. end;
  84. procedure secondasm(var p : ptree);
  85. begin
  86. exprasmlist^.concatlist(p^.p_asm);
  87. if not p^.object_preserved then
  88. begin
  89. {$ifdef i386}
  90. maybe_loadesi;
  91. {$endif}
  92. {$ifdef m68k}
  93. maybe_loada5;
  94. {$endif}
  95. end;
  96. end;
  97. procedure secondpass(var p : ptree);
  98. const
  99. procedures : array[ttreetyp] of secondpassproc =
  100. (secondadd, {addn}
  101. secondadd, {muln}
  102. secondadd, {subn}
  103. secondmoddiv, {divn}
  104. secondadd, {symdifn}
  105. secondmoddiv, {modn}
  106. secondassignment, {assignn}
  107. secondload, {loadn}
  108. secondnothing, {range}
  109. secondadd, {ltn}
  110. secondadd, {lten}
  111. secondadd, {gtn}
  112. secondadd, {gten}
  113. secondadd, {equaln}
  114. secondadd, {unequaln}
  115. secondin, {inn}
  116. secondadd, {orn}
  117. secondadd, {xorn}
  118. secondshlshr, {shrn}
  119. secondshlshr, {shln}
  120. secondadd, {slashn}
  121. secondadd, {andn}
  122. secondsubscriptn, {subscriptn}
  123. secondderef, {derefn}
  124. secondaddr, {addrn}
  125. seconddoubleaddr, {doubleaddrn}
  126. secondordconst, {ordconstn}
  127. secondtypeconv, {typeconvn}
  128. secondcalln, {calln}
  129. secondnothing, {callparan}
  130. secondrealconst, {realconstn}
  131. secondfixconst, {fixconstn}
  132. secondumminus, {umminusn}
  133. secondasm, {asmn}
  134. secondvecn, {vecn}
  135. secondstringconst, {stringconstn}
  136. secondfuncret, {funcretn}
  137. secondselfn, {selfn}
  138. secondnot, {notn}
  139. secondinline, {inlinen}
  140. secondniln, {niln}
  141. seconderror, {errorn}
  142. secondnothing, {typen}
  143. secondhnewn, {hnewn}
  144. secondhdisposen, {hdisposen}
  145. secondnewn, {newn}
  146. secondsimplenewdispose, {simpledisposen}
  147. secondsetelement, {setelementn}
  148. secondsetconst, {setconstn}
  149. secondblockn, {blockn}
  150. secondstatement, {statementn}
  151. secondnothing, {loopn}
  152. secondifn, {ifn}
  153. secondbreakn, {breakn}
  154. secondcontinuen, {continuen}
  155. second_while_repeatn, {repeatn}
  156. second_while_repeatn, {whilen}
  157. secondfor, {forn}
  158. secondexitn, {exitn}
  159. secondwith, {withn}
  160. secondcase, {casen}
  161. secondlabel, {labeln}
  162. secondgoto, {goton}
  163. secondsimplenewdispose, {simplenewn}
  164. secondtryexcept, {tryexceptn}
  165. secondraise, {raisen}
  166. secondnothing, {switchesn}
  167. secondtryfinally, {tryfinallyn}
  168. secondon, {onn}
  169. secondis, {isn}
  170. secondas, {asn}
  171. seconderror, {caretn}
  172. secondfail, {failn}
  173. secondadd, {starstarn}
  174. secondprocinline, {procinlinen}
  175. secondnothing, {nothingn}
  176. secondloadvmt {loadvmtn}
  177. );
  178. var
  179. oldcodegenerror : boolean;
  180. oldlocalswitches : tlocalswitches;
  181. oldpos : tfileposinfo;
  182. begin
  183. if not(p^.error) then
  184. begin
  185. oldcodegenerror:=codegenerror;
  186. oldlocalswitches:=aktlocalswitches;
  187. oldpos:=aktfilepos;
  188. aktfilepos:=p^.fileinfo;
  189. aktlocalswitches:=p^.localswitches;
  190. codegenerror:=false;
  191. procedures[p^.treetype](p);
  192. p^.error:=codegenerror;
  193. codegenerror:=codegenerror or oldcodegenerror;
  194. aktlocalswitches:=oldlocalswitches;
  195. aktfilepos:=oldpos;
  196. end
  197. else
  198. codegenerror:=true;
  199. end;
  200. function do_secondpass(var p : ptree) : boolean;
  201. begin
  202. codegenerror:=false;
  203. if not(p^.error) then
  204. secondpass(p);
  205. do_secondpass:=codegenerror;
  206. end;
  207. var
  208. regvars : array[1..maxvarregs] of pvarsym;
  209. regvars_para : array[1..maxvarregs] of boolean;
  210. regvars_refs : array[1..maxvarregs] of longint;
  211. parasym : boolean;
  212. procedure searchregvars(p : psym);
  213. var
  214. i,j,k : longint;
  215. begin
  216. if (p^.typ=varsym) and ((pvarsym(p)^.var_options and vo_regable)<>0) then
  217. begin
  218. { walk through all momentary register variables }
  219. for i:=1 to maxvarregs do
  220. begin
  221. { free register ? }
  222. if regvars[i]=nil then
  223. begin
  224. regvars[i]:=pvarsym(p);
  225. regvars_para[i]:=parasym;
  226. break;
  227. end;
  228. { else throw out a variable ? }
  229. j:=pvarsym(p)^.refs;
  230. { parameter get a less value }
  231. if parasym then
  232. begin
  233. if cs_littlesize in aktglobalswitches then
  234. dec(j,1)
  235. else
  236. dec(j,100);
  237. end;
  238. if (j>regvars_refs[i]) and (j>0) then
  239. begin
  240. for k:=maxvarregs-1 downto i do
  241. begin
  242. regvars[k+1]:=regvars[k];
  243. regvars_para[k+1]:=regvars_para[k];
  244. end;
  245. { calc the new refs
  246. pvarsym(p)^.refs:=j; }
  247. regvars[i]:=pvarsym(p);
  248. regvars_para[i]:=parasym;
  249. regvars_refs[i]:=j;
  250. break;
  251. end;
  252. end;
  253. end;
  254. end;
  255. procedure generatecode(var p : ptree);
  256. var
  257. i : longint;
  258. regsize : topsize;
  259. regi : tregister;
  260. hr : preference;
  261. label
  262. nextreg;
  263. begin
  264. cleartempgen;
  265. { when size optimization only count occurrence }
  266. if cs_littlesize in aktglobalswitches then
  267. t_times:=1
  268. else
  269. { reference for repetition is 100 }
  270. t_times:=100;
  271. { clear register count }
  272. clearregistercount;
  273. use_esp_stackframe:=false;
  274. if not(do_firstpass(p)) then
  275. begin
  276. { max. optimizations }
  277. { only if no asm is used }
  278. { and no try statement }
  279. if (cs_regalloc in aktglobalswitches) and
  280. ((procinfo.flags and (pi_uses_asm or pi_uses_exceptions))=0) then
  281. begin
  282. { can we omit the stack frame ? }
  283. { conditions:
  284. 1. procedure (not main block)
  285. 2. no constructor or destructor
  286. 3. no call to other procedures
  287. 4. no interrupt handler
  288. }
  289. if assigned(aktprocsym) then
  290. begin
  291. if (aktprocsym^.definition^.options and
  292. (poconstructor+podestructor{+poinline}+pointerrupt)=0) and
  293. ((procinfo.flags and pi_do_call)=0) and (lexlevel>1) then
  294. begin
  295. { use ESP as frame pointer }
  296. procinfo.framepointer:=stack_pointer;
  297. use_esp_stackframe:=true;
  298. { calc parameter distance new }
  299. dec(procinfo.framepointer_offset,4);
  300. dec(procinfo.ESI_offset,4);
  301. { is this correct ???}
  302. { retoffset can be negativ for results in eax !! }
  303. { the value should be decreased only if positive }
  304. if procinfo.retoffset>=0 then
  305. dec(procinfo.retoffset,4);
  306. dec(procinfo.call_offset,4);
  307. aktprocsym^.definition^.parast^.call_offset:=procinfo.call_offset;
  308. end;
  309. end;
  310. if (p^.registers32<4) then
  311. begin
  312. for i:=1 to maxvarregs do
  313. regvars[i]:=nil;
  314. parasym:=false;
  315. {$ifdef tp}
  316. symtablestack^.foreach(searchregvars);
  317. {$else}
  318. symtablestack^.foreach(@searchregvars);
  319. {$endif}
  320. { copy parameter into a register ? }
  321. parasym:=true;
  322. {$ifdef tp}
  323. symtablestack^.next^.foreach(searchregvars);
  324. {$else}
  325. symtablestack^.next^.foreach(@searchregvars);
  326. {$endif}
  327. { hold needed registers free }
  328. for i:=maxvarregs downto maxvarregs-p^.registers32+1 do
  329. regvars[i]:=nil;
  330. { now assign register }
  331. for i:=1 to maxvarregs-p^.registers32 do
  332. begin
  333. if assigned(regvars[i]) then
  334. begin
  335. { it is nonsens, to copy the variable to }
  336. { a register because we need then much }
  337. { pushes ? }
  338. if reg_pushes[varregs[i]]>=regvars[i]^.refs then
  339. begin
  340. regvars[i]:=nil;
  341. goto nextreg;
  342. end;
  343. { register is no longer available for }
  344. { expressions }
  345. { search the register which is the most }
  346. { unused }
  347. usableregs:=usableregs-[varregs[i]];
  348. is_reg_var[varregs[i]]:=true;
  349. dec(c_usableregs);
  350. { possibly no 32 bit register are needed }
  351. if (regvars[i]^.definition^.deftype=orddef) and
  352. (porddef(regvars[i]^.definition)^.typ in [bool8bit,uchar,u8bit,s8bit]) then
  353. begin
  354. {$ifdef i386}
  355. regvars[i]^.reg:=reg32toreg8(varregs[i]);
  356. {$endif}
  357. regsize:=S_B;
  358. end
  359. else if (regvars[i]^.definition^.deftype=orddef) and
  360. (porddef(regvars[i]^.definition)^.typ in [bool16bit,u16bit,s16bit]) then
  361. begin
  362. {$ifdef i386}
  363. regvars[i]^.reg:=reg32toreg16(varregs[i]);
  364. {$endif}
  365. regsize:=S_W;
  366. end
  367. else
  368. begin
  369. regvars[i]^.reg:=varregs[i];
  370. regsize:=S_L;
  371. end;
  372. { parameter must be load }
  373. if regvars_para[i] then
  374. begin
  375. { procinfo is there actual, }
  376. { because we can't never be in a }
  377. { nested procedure }
  378. { when loading parameter to reg }
  379. new(hr);
  380. reset_reference(hr^);
  381. hr^.offset:=pvarsym(regvars[i])^.address+procinfo.call_offset;
  382. hr^.base:=procinfo.framepointer;
  383. {$ifdef i386}
  384. procinfo.aktentrycode^.concat(new(pai386,op_ref_reg(A_MOV,regsize,
  385. hr,regvars[i]^.reg)));
  386. {$endif i386}
  387. {$ifdef m68k}
  388. procinfo.aktentrycode^.concat(new(pai68k,op_ref_reg(A_MOVE,regsize,
  389. hr,regvars[i]^.reg)));
  390. {$endif m68k}
  391. unused:=unused - [regvars[i]^.reg];
  392. end;
  393. { procedure uses this register }
  394. {$ifdef i386}
  395. usedinproc:=usedinproc or ($80 shr byte(varregs[i]));
  396. {$endif i386}
  397. {$ifdef m68k}
  398. usedinproc:=usedinproc or ($800 shr word(varregs[i]));
  399. {$endif m68k}
  400. end;
  401. nextreg:
  402. { dummy }
  403. regsize:=S_W;
  404. end;
  405. if (status.verbosity and v_debug)=v_debug then
  406. begin
  407. for i:=1 to maxvarregs do
  408. begin
  409. if assigned(regvars[i]) then
  410. Message3(cg_d_register_weight,reg2str(regvars[i]^.reg),
  411. tostr(regvars[i]^.refs),regvars[i]^.name);
  412. end;
  413. end;
  414. end;
  415. end;
  416. if assigned(aktprocsym) and
  417. ((aktprocsym^.definition^.options and poinline)<>0) then
  418. make_const_global:=true;
  419. do_secondpass(p);
  420. {$ifdef StoreFPULevel}
  421. procinfo.def^.fpu_used:=p^.registersfpu;
  422. {$endif StoreFPULevel}
  423. { all registers can be used again }
  424. resetusableregisters;
  425. end;
  426. procinfo.aktproccode^.concatlist(exprasmlist);
  427. make_const_global:=false;
  428. end;
  429. end.
  430. {
  431. $Log$
  432. Revision 1.2 1998-09-07 18:46:07 peter
  433. * update smartlinking, uses getdatalabel
  434. * renamed ptree.value vars to value_str,value_real,value_set
  435. Revision 1.1 1998/09/01 09:07:12 peter
  436. * m68k fixes, splitted cg68k like cgi386
  437. }