pass_2.pas 16 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440
  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 : pnode);
  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. symtable,types,aasm,scanner,
  36. pass_1,tgobj,cgbase,cgobj,tgcpu
  37. {$ifdef GDB}
  38. ,gdb
  39. {$endif}
  40. {$i cpuunit.inc}
  41. ;
  42. type
  43. perrornode = ^terrornode;
  44. terrornode = object(tnode)
  45. constructor init;
  46. procedure secondpass;virtual;
  47. end;
  48. tstatementnode = object(tbinarynode)
  49. procedure secondpass;virtual;
  50. end;
  51. tblocknode = object(tunarynode)
  52. procedure secondpass;virtual;
  53. end;
  54. tasmnode = object(tnode)
  55. p_asm : paasmoutput;
  56. object_preserved : boolean;
  57. procedure secondpass;virtual;
  58. end;
  59. {****************************************************************************
  60. TERRORNODE
  61. ****************************************************************************}
  62. constructor terrornode.init;
  63. begin
  64. inherited init;
  65. treetype:=errorn;
  66. end;
  67. procedure terrornode.secondpass;
  68. begin
  69. error:=true;
  70. codegenerror:=true;
  71. end;
  72. {****************************************************************************
  73. TSTATEMENTNODE
  74. ****************************************************************************}
  75. procedure tstatementnode.secondpass;
  76. var
  77. hp : pbinarynode;
  78. oldrl : plinkedlist;
  79. begin
  80. hp:=@self;
  81. while assigned(hp) do
  82. begin
  83. if assigned(hp^.right) then
  84. begin
  85. tg.cleartempgen;
  86. oldrl:=temptoremove;
  87. temptoremove:=new(plinkedlist,init);
  88. hp^.right^.secondpass;
  89. { release temp. ansi strings }
  90. cg^.g_removetemps(exprasmlist,temptoremove);
  91. dispose(temptoremove,done);
  92. temptoremove:=oldrl;
  93. end;
  94. hp:=pbinarynode(hp^.left);
  95. end;
  96. end;
  97. procedure tblocknode.secondpass;
  98. begin
  99. { do second pass on left node }
  100. if assigned(left) then
  101. left^.secondpass;
  102. end;
  103. procedure tasmnode.secondpass;
  104. begin
  105. exprasmlist^.concatlist(p_asm);
  106. if not object_preserved then
  107. cg^.g_maybe_loadself(exprasmlist);
  108. end;
  109. procedure secondpass(p : pnode);
  110. var
  111. oldcodegenerror : boolean;
  112. oldlocalswitches : tlocalswitches;
  113. oldpos : tfileposinfo;
  114. begin
  115. if not(p^.error) then
  116. begin
  117. oldcodegenerror:=codegenerror;
  118. oldlocalswitches:=aktlocalswitches;
  119. oldpos:=aktfilepos;
  120. aktfilepos:=p^.fileinfo;
  121. aktlocalswitches:=p^.localswitches;
  122. codegenerror:=false;
  123. p^.secondpass;
  124. p^.error:=codegenerror;
  125. codegenerror:=codegenerror or oldcodegenerror;
  126. aktlocalswitches:=oldlocalswitches;
  127. aktfilepos:=oldpos;
  128. end
  129. else
  130. codegenerror:=true;
  131. end;
  132. function do_secondpass(p : pnode) : boolean;
  133. begin
  134. codegenerror:=false;
  135. if not(p^.error) then
  136. secondpass(p);
  137. do_secondpass:=codegenerror;
  138. end;
  139. var
  140. regvars : array[1..maxvarregs] of pvarsym;
  141. regvars_para : array[1..maxvarregs] of boolean;
  142. regvars_refs : array[1..maxvarregs] of longint;
  143. parasym : boolean;
  144. procedure searchregvars(p : pnamedindexobject);
  145. var
  146. i,j,k : longint;
  147. begin
  148. if (pvarsym(p)^.typ=varsym) and ((pvarsym(p)^.var_options and vo_regable)<>0) then
  149. begin
  150. { walk through all momentary register variables }
  151. for i:=1 to maxvarregs do
  152. begin
  153. { free register ? }
  154. if regvars[i]=nil then
  155. begin
  156. regvars[i]:=pvarsym(p);
  157. regvars_para[i]:=parasym;
  158. break;
  159. end;
  160. { else throw out a variable ? }
  161. j:=pvarsym(p)^.refs;
  162. { parameter get a less value }
  163. if parasym then
  164. begin
  165. if cs_littlesize in aktglobalswitches then
  166. dec(j,1)
  167. else
  168. dec(j,100);
  169. end;
  170. if (j>regvars_refs[i]) and (j>0) then
  171. begin
  172. for k:=maxvarregs-1 downto i do
  173. begin
  174. regvars[k+1]:=regvars[k];
  175. regvars_para[k+1]:=regvars_para[k];
  176. end;
  177. { calc the new refs
  178. pvarsym(p)^.refs:=j; }
  179. regvars[i]:=pvarsym(p);
  180. regvars_para[i]:=parasym;
  181. regvars_refs[i]:=j;
  182. break;
  183. end;
  184. end;
  185. end;
  186. end;
  187. procedure generatecode(var p : pnode);
  188. var
  189. i : longint;
  190. hr : preference;
  191. {$ifdef i386}
  192. regsize : topsize;
  193. {$endif i386}
  194. label
  195. nextreg;
  196. begin
  197. temptoremove:=nil;
  198. tg.cleartempgen;
  199. { when size optimization only count occurrence }
  200. if cs_littlesize in aktglobalswitches then
  201. t_times:=1
  202. else
  203. { reference for repetition is 100 }
  204. t_times:=100;
  205. { clear register count }
  206. tg.clearregistercount;
  207. use_esp_stackframe:=false;
  208. if not(do_firstpassnode(p)) then
  209. begin
  210. { max. optimizations }
  211. { only if no asm is used }
  212. { and no try statement }
  213. if (cs_regalloc in aktglobalswitches) and
  214. ((procinfo.flags and (pi_uses_asm or pi_uses_exceptions))=0) then
  215. begin
  216. { can we omit the stack frame ? }
  217. { conditions:
  218. 1. procedure (not main block)
  219. 2. no constructor or destructor
  220. 3. no call to other procedures
  221. 4. no interrupt handler
  222. }
  223. if assigned(aktprocsym) then
  224. begin
  225. if (aktprocsym^.definition^.options and
  226. (poconstructor+podestructor{+poinline}+pointerrupt)=0) and
  227. ((procinfo.flags and pi_do_call)=0) and
  228. (lexlevel>=normal_function_level) then
  229. begin
  230. { use ESP as frame pointer }
  231. procinfo.framepointer:=stack_pointer;
  232. use_esp_stackframe:=true;
  233. { calc parameter distance new }
  234. dec(procinfo.framepointer_offset,pointersize);
  235. dec(procinfo.selfpointer_offset,pointersize);
  236. { is this correct ???}
  237. { retoffset can be negativ for results in eax !! }
  238. { the value should be decreased only if positive }
  239. if procinfo.retoffset>=0 then
  240. dec(procinfo.retoffset,4);
  241. dec(procinfo.call_offset,4);
  242. aktprocsym^.definition^.parast^.address_fixup:=procinfo.call_offset;
  243. end;
  244. end;
  245. if (p^.registersint<maxvarregs) then
  246. begin
  247. for i:=1 to maxvarregs do
  248. regvars[i]:=nil;
  249. parasym:=false;
  250. {$ifdef tp}
  251. symtablestack^.foreach(searchregvars);
  252. {$else}
  253. symtablestack^.foreach(@searchregvars);
  254. {$endif}
  255. { copy parameter into a register ? }
  256. parasym:=true;
  257. {$ifdef tp}
  258. symtablestack^.next^.foreach(searchregvars);
  259. {$else}
  260. symtablestack^.next^.foreach(@searchregvars);
  261. {$endif}
  262. { hold needed registers free }
  263. for i:=maxvarregs downto maxvarregs-p^.registersint+1 do
  264. regvars[i]:=nil;
  265. { now assign register }
  266. for i:=1 to maxvarregs-p^.registersint do
  267. begin
  268. if assigned(regvars[i]) then
  269. begin
  270. { it is nonsens, to copy the variable to }
  271. { a register because we need then much }
  272. { pushes ? }
  273. if tg.reg_pushes[varregs[i]]>=regvars[i]^.refs then
  274. begin
  275. regvars[i]:=nil;
  276. goto nextreg;
  277. end;
  278. { register is no longer available for }
  279. { expressions }
  280. { search the register which is the most }
  281. { unused }
  282. exclude(tg.availabletempregsint,varregs[i]);
  283. tg.is_reg_var[varregs[i]]:=true;
  284. dec(tg.c_countusableregsint);
  285. { possibly no 32 bit register are needed }
  286. { call by reference/const ? }
  287. {!!!!!!!!!!!!!!
  288. if (regvars[i]^.varspez=vs_var) or
  289. ((regvars[i]^.varspez=vs_const) and
  290. dont_copy_const_param(regvars[i]^.definition)) then
  291. begin
  292. regvars[i]^.reg:=varregs[i];
  293. regsize:=sizepostfix_pointer;
  294. end
  295. else
  296. if (regvars[i]^.definition^.deftype=orddef) and
  297. (porddef(regvars[i]^.definition)^.size=1) then
  298. begin
  299. regvars[i]^.reg:=regtoreg8(varregs[i]);
  300. regsize:=S_B;
  301. end
  302. else
  303. if (regvars[i]^.definition^.deftype=orddef) and
  304. (porddef(regvars[i]^.definition)^.size=2) then
  305. begin
  306. regvars[i]^.reg:=regtoreg16(varregs[i]);
  307. regsize:=S_W;
  308. end
  309. else
  310. if (regvars[i]^.definition^.deftype=orddef) and
  311. (porddef(regvars[i]^.definition)^.size=4) then
  312. begin
  313. regvars[i]^.reg:=regtoreg32(varregs[i]);
  314. regsize:=S_L;
  315. end
  316. else
  317. if (cf_registers64 in cpuflags) and
  318. (regvars[i]^.definition^.deftype=orddef) and
  319. (porddef(regvars[i]^.definition)^.size=8) then
  320. begin
  321. regvars[i]^.reg:=regtoreg64(varregs[i]);
  322. regsize:=S_Q;
  323. end;
  324. }
  325. { parameter must be load }
  326. if regvars_para[i] then
  327. begin
  328. { procinfo is there actual, }
  329. { because we can't never be in a }
  330. { nested procedure }
  331. { when loading parameter to reg }
  332. new(hr);
  333. reset_reference(hr^);
  334. hr^.offset:=pvarsym(regvars[i])^.address+procinfo.call_offset;
  335. hr^.base:=procinfo.framepointer;
  336. {$ifdef i386}
  337. procinfo.aktentrycode^.concat(new(pai386,op_ref_reg(A_MOV,regsize,
  338. hr,regvars[i]^.reg)));
  339. {$endif i386}
  340. {$ifdef m68k}
  341. procinfo.aktentrycode^.concat(new(pai68k,op_ref_reg(A_MOVE,regsize,
  342. hr,regvars[i]^.reg)));
  343. {$endif m68k}
  344. tg.unusedregsint:=tg.unusedregsint - [regvars[i]^.reg];
  345. end;
  346. { procedure uses this register }
  347. include(tg.usedinproc,varregs[i]);
  348. end;
  349. nextreg:
  350. {$ifdef i386}
  351. { dummy }
  352. regsize:=S_W;
  353. {$endif i386}
  354. end;
  355. if (status.verbosity and v_debug)=v_debug then
  356. begin
  357. for i:=1 to maxvarregs do
  358. begin
  359. if assigned(regvars[i]) then
  360. Message3(cg_d_register_weight,reg2str(regvars[i]^.reg),
  361. tostr(regvars[i]^.refs),regvars[i]^.name);
  362. end;
  363. end;
  364. end;
  365. end;
  366. if assigned(aktprocsym) and
  367. ((aktprocsym^.definition^.options and poinline)<>0) then
  368. make_const_global:=true;
  369. do_secondpass(p);
  370. if assigned(procinfo.def) then
  371. procinfo.def^.fpu_used:=p^.registersfpu;
  372. { all registers can be used again }
  373. tg.resetusableregisters;
  374. end;
  375. procinfo.aktproccode^.concatlist(exprasmlist);
  376. make_const_global:=false;
  377. end;
  378. end.
  379. {
  380. $Log$
  381. Revision 1.4 1999-08-03 17:09:46 florian
  382. * the alpha compiler can be compiled now
  383. Revision 1.3 1999/08/03 00:30:36 florian
  384. * again a fix for the alpha
  385. Revision 1.2 1999/08/03 00:28:03 florian
  386. * some updates to compile for the alpha
  387. Revision 1.1 1999/08/03 00:07:16 florian
  388. * initial revision
  389. }