nflw.pas 41 KB

12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364656667686970717273747576777879808182838485868788899091929394959697989910010110210310410510610710810911011111211311411511611711811912012112212312412512612712812913013113213313413513613713813914014114214314414514614714814915015115215315415515615715815916016116216316416516616716816917017117217317417517617717817918018118218318418518618718818919019119219319419519619719819920020120220320420520620720820921021121221321421521621721821922022122222322422522622722822923023123223323423523623723823924024124224324424524624724824925025125225325425525625725825926026126226326426526626726826927027127227327427527627727827928028128228328428528628728828929029129229329429529629729829930030130230330430530630730830931031131231331431531631731831932032132232332432532632732832933033133233333433533633733833934034134234334434534634734834935035135235335435535635735835936036136236336436536636736836937037137237337437537637737837938038138238338438538638738838939039139239339439539639739839940040140240340440540640740840941041141241341441541641741841942042142242342442542642742842943043143243343443543643743843944044144244344444544644744844945045145245345445545645745845946046146246346446546646746846947047147247347447547647747847948048148248348448548648748848949049149249349449549649749849950050150250350450550650750850951051151251351451551651751851952052152252352452552652752852953053153253353453553653753853954054154254354454554654754854955055155255355455555655755855956056156256356456556656756856957057157257357457557657757857958058158258358458558658758858959059159259359459559659759859960060160260360460560660760860961061161261361461561661761861962062162262362462562662762862963063163263363463563663763863964064164264364464564664764864965065165265365465565665765865966066166266366466566666766866967067167267367467567667767867968068168268368468568668768868969069169269369469569669769869970070170270370470570670770870971071171271371471571671771871972072172272372472572672772872973073173273373473573673773873974074174274374474574674774874975075175275375475575675775875976076176276376476576676776876977077177277377477577677777877978078178278378478578678778878979079179279379479579679779879980080180280380480580680780880981081181281381481581681781881982082182282382482582682782882983083183283383483583683783883984084184284384484584684784884985085185285385485585685785885986086186286386486586686786886987087187287387487587687787887988088188288388488588688788888989089189289389489589689789889990090190290390490590690790890991091191291391491591691791891992092192292392492592692792892993093193293393493593693793893994094194294394494594694794894995095195295395495595695795895996096196296396496596696796896997097197297397497597697797897998098198298398498598698798898999099199299399499599699799899910001001100210031004100510061007100810091010101110121013101410151016101710181019102010211022102310241025102610271028102910301031103210331034103510361037103810391040104110421043104410451046104710481049105010511052105310541055105610571058105910601061106210631064106510661067106810691070107110721073107410751076107710781079108010811082108310841085108610871088108910901091109210931094109510961097109810991100110111021103110411051106110711081109111011111112111311141115111611171118111911201121112211231124112511261127112811291130113111321133113411351136113711381139114011411142114311441145114611471148114911501151115211531154115511561157115811591160116111621163116411651166116711681169117011711172117311741175117611771178117911801181118211831184118511861187118811891190119111921193119411951196119711981199120012011202120312041205120612071208120912101211121212131214121512161217121812191220122112221223122412251226122712281229123012311232123312341235123612371238123912401241124212431244124512461247124812491250125112521253125412551256125712581259126012611262126312641265126612671268126912701271127212731274127512761277127812791280128112821283128412851286128712881289129012911292129312941295129612971298129913001301130213031304130513061307130813091310131113121313131413151316131713181319132013211322132313241325132613271328132913301331133213331334133513361337133813391340134113421343134413451346134713481349135013511352135313541355135613571358135913601361136213631364136513661367136813691370137113721373137413751376137713781379138013811382138313841385138613871388138913901391139213931394139513961397139813991400140114021403140414051406140714081409141014111412141314141415141614171418141914201421142214231424142514261427142814291430143114321433143414351436143714381439144014411442144314441445144614471448144914501451145214531454145514561457
  1. {
  2. $Id$
  3. Copyright (c) 1998-2002 by Florian Klaempfl
  4. Type checking and register allocation for nodes that influence
  5. the flow
  6. This program is free software; you can redistribute it and/or modify
  7. it under the terms of the GNU General Public License as published by
  8. the Free Software Foundation; either version 2 of the License, or
  9. (at your option) any later version.
  10. This program is distributed in the hope that it will be useful,
  11. but WITHOUT ANY WARRANTY; without even the implied warranty of
  12. MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
  13. GNU General Public License for more details.
  14. You should have received a copy of the GNU General Public License
  15. along with this program; if not, write to the Free Software
  16. Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
  17. ****************************************************************************
  18. }
  19. unit nflw;
  20. {$i fpcdefs.inc}
  21. interface
  22. uses
  23. node,cpubase,
  24. aasmbase,aasmtai,aasmcpu,symnot,
  25. symtype,symbase,symdef,symsym;
  26. type
  27. { flags used by loop nodes }
  28. tloopflag = (
  29. { set if it is a for ... downto ... do loop }
  30. lnf_backward,
  31. { Do we need to parse childs to set var state? }
  32. lnf_varstate,
  33. { Do a test at the begin of the loop?}
  34. lnf_testatbegin,
  35. { Negate the loop test? }
  36. lnf_checknegate,
  37. { Should the value of the loop variable on exit be correct. }
  38. lnf_dont_mind_loopvar_on_exit);
  39. tloopflags = set of tloopflag;
  40. const
  41. { loop flags which must match to consider loop nodes equal regarding the flags }
  42. loopflagsequal = [lnf_backward];
  43. type
  44. tloopnode = class(tbinarynode)
  45. t1,t2 : tnode;
  46. loopflags : tloopflags;
  47. constructor create(tt : tnodetype;l,r,_t1,_t2 : tnode);virtual;
  48. destructor destroy;override;
  49. function getcopy : tnode;override;
  50. constructor ppuload(t:tnodetype;ppufile:tcompilerppufile);override;
  51. procedure ppuwrite(ppufile:tcompilerppufile);override;
  52. procedure buildderefimpl;override;
  53. procedure derefimpl;override;
  54. procedure insertintolist(l : tnodelist);override;
  55. procedure printnodetree(var t:text);override;
  56. function docompare(p: tnode): boolean; override;
  57. end;
  58. twhilerepeatnode = class(tloopnode)
  59. constructor create(l,r,_t1:Tnode;tab,cn:boolean);virtual;
  60. function det_resulttype:tnode;override;
  61. function pass_1 : tnode;override;
  62. {$ifdef state_tracking}
  63. function track_state_pass(exec_known:boolean):boolean;override;
  64. {$endif}
  65. end;
  66. twhilerepeatnodeclass = class of twhilerepeatnode;
  67. tifnode = class(tloopnode)
  68. constructor create(l,r,_t1 : tnode);virtual;
  69. function det_resulttype:tnode;override;
  70. function pass_1 : tnode;override;
  71. end;
  72. tifnodeclass = class of tifnode;
  73. tfornode = class(tloopnode)
  74. loopvar_notid:cardinal;
  75. constructor create(l,r,_t1,_t2 : tnode;back : boolean);virtual;
  76. procedure loop_var_access(not_type:Tnotification_flag;symbol:Tsym);
  77. function det_resulttype:tnode;override;
  78. function pass_1 : tnode;override;
  79. end;
  80. tfornodeclass = class of tfornode;
  81. texitnode = class(tunarynode)
  82. constructor create(l:tnode);virtual;
  83. constructor ppuload(t:tnodetype;ppufile:tcompilerppufile);override;
  84. procedure ppuwrite(ppufile:tcompilerppufile);override;
  85. function det_resulttype:tnode;override;
  86. function pass_1 : tnode;override;
  87. end;
  88. texitnodeclass = class of texitnode;
  89. tbreaknode = class(tnode)
  90. constructor create;virtual;
  91. function det_resulttype:tnode;override;
  92. function pass_1 : tnode;override;
  93. end;
  94. tbreaknodeclass = class of tbreaknode;
  95. tcontinuenode = class(tnode)
  96. constructor create;virtual;
  97. function det_resulttype:tnode;override;
  98. function pass_1 : tnode;override;
  99. end;
  100. tcontinuenodeclass = class of tcontinuenode;
  101. tgotonode = class(tnode)
  102. labsym : tlabelsym;
  103. labsymderef : tderef;
  104. exceptionblock : integer;
  105. { internlab : tinterngotolabel;}
  106. constructor create(p : tlabelsym);virtual;
  107. { constructor createintern(g:tinterngotolabel);}
  108. constructor ppuload(t:tnodetype;ppufile:tcompilerppufile);override;
  109. procedure ppuwrite(ppufile:tcompilerppufile);override;
  110. procedure buildderefimpl;override;
  111. procedure derefimpl;override;
  112. function getcopy : tnode;override;
  113. function det_resulttype:tnode;override;
  114. function pass_1 : tnode;override;
  115. function docompare(p: tnode): boolean; override;
  116. end;
  117. tgotonodeclass = class of tgotonode;
  118. tlabelnode = class(tunarynode)
  119. labelnr : tasmlabel;
  120. labsym : tlabelsym;
  121. labsymderef : tderef;
  122. exceptionblock : integer;
  123. constructor createcase(p : tasmlabel;l:tnode);virtual;
  124. constructor create(p : tlabelsym;l:tnode);virtual;
  125. constructor ppuload(t:tnodetype;ppufile:tcompilerppufile);override;
  126. procedure ppuwrite(ppufile:tcompilerppufile);override;
  127. procedure buildderefimpl;override;
  128. procedure derefimpl;override;
  129. function getcopy : tnode;override;
  130. function det_resulttype:tnode;override;
  131. function pass_1 : tnode;override;
  132. function docompare(p: tnode): boolean; override;
  133. end;
  134. tlabelnodeclass = class of tlabelnode;
  135. traisenode = class(tbinarynode)
  136. frametree : tnode;
  137. constructor create(l,taddr,tframe:tnode);virtual;
  138. constructor ppuload(t:tnodetype;ppufile:tcompilerppufile);override;
  139. procedure ppuwrite(ppufile:tcompilerppufile);override;
  140. procedure buildderefimpl;override;
  141. procedure derefimpl;override;
  142. function getcopy : tnode;override;
  143. procedure insertintolist(l : tnodelist);override;
  144. function det_resulttype:tnode;override;
  145. function pass_1 : tnode;override;
  146. function docompare(p: tnode): boolean; override;
  147. end;
  148. traisenodeclass = class of traisenode;
  149. ttryexceptnode = class(tloopnode)
  150. constructor create(l,r,_t1 : tnode);virtual;
  151. function det_resulttype:tnode;override;
  152. function pass_1 : tnode;override;
  153. end;
  154. ttryexceptnodeclass = class of ttryexceptnode;
  155. ttryfinallynode = class(tloopnode)
  156. implicitframe : boolean;
  157. constructor create(l,r:tnode);virtual;
  158. constructor create_implicit(l,r,_t1:tnode);virtual;
  159. function det_resulttype:tnode;override;
  160. function pass_1 : tnode;override;
  161. end;
  162. ttryfinallynodeclass = class of ttryfinallynode;
  163. tonnode = class(tbinarynode)
  164. exceptsymtable : tsymtable;
  165. excepttype : tobjectdef;
  166. constructor create(l,r:tnode);virtual;
  167. destructor destroy;override;
  168. constructor ppuload(t:tnodetype;ppufile:tcompilerppufile);override;
  169. function det_resulttype:tnode;override;
  170. function pass_1 : tnode;override;
  171. function getcopy : tnode;override;
  172. function docompare(p: tnode): boolean; override;
  173. end;
  174. tonnodeclass = class of tonnode;
  175. { for compatibilty }
  176. function genloopnode(t : tnodetype;l,r,n1 : tnode;back : boolean) : tnode;
  177. var
  178. cwhilerepeatnode : twhilerepeatnodeclass;
  179. cifnode : tifnodeclass;
  180. cfornode : tfornodeclass;
  181. cexitnode : texitnodeclass;
  182. cbreaknode : tbreaknodeclass;
  183. ccontinuenode : tcontinuenodeclass;
  184. cgotonode : tgotonodeclass;
  185. clabelnode : tlabelnodeclass;
  186. craisenode : traisenodeclass;
  187. ctryexceptnode : ttryexceptnodeclass;
  188. ctryfinallynode : ttryfinallynodeclass;
  189. connode : tonnodeclass;
  190. implementation
  191. uses
  192. globtype,systems,
  193. cutils,verbose,globals,
  194. symconst,paramgr,defcmp,defutil,htypechk,pass_1,
  195. ncal,nadd,ncon,nmem,nld,ncnv,nbas,cgobj,
  196. {$ifdef state_tracking}
  197. nstate,
  198. {$endif}
  199. cgbase,procinfo
  200. ;
  201. function genloopnode(t : tnodetype;l,r,n1 : tnode;back : boolean) : tnode;
  202. var
  203. p : tnode;
  204. begin
  205. case t of
  206. ifn:
  207. p:=cifnode.create(l,r,n1);
  208. whilerepeatn:
  209. if back then
  210. {Repeat until.}
  211. p:=cwhilerepeatnode.create(l,r,n1,false,true)
  212. else
  213. {While do.}
  214. p:=cwhilerepeatnode.create(l,r,n1,true,false);
  215. forn:
  216. p:=cfornode.create(l,r,n1,nil,back);
  217. end;
  218. resulttypepass(p);
  219. genloopnode:=p;
  220. end;
  221. {****************************************************************************
  222. TLOOPNODE
  223. *****************************************************************************}
  224. constructor tloopnode.create(tt : tnodetype;l,r,_t1,_t2 : tnode);
  225. begin
  226. inherited create(tt,l,r);
  227. t1:=_t1;
  228. t2:=_t2;
  229. set_file_line(l);
  230. end;
  231. destructor tloopnode.destroy;
  232. begin
  233. t1.free;
  234. t2.free;
  235. inherited destroy;
  236. end;
  237. constructor tloopnode.ppuload(t:tnodetype;ppufile:tcompilerppufile);
  238. begin
  239. inherited ppuload(t,ppufile);
  240. t1:=ppuloadnode(ppufile);
  241. t2:=ppuloadnode(ppufile);
  242. end;
  243. procedure tloopnode.ppuwrite(ppufile:tcompilerppufile);
  244. begin
  245. inherited ppuwrite(ppufile);
  246. ppuwritenode(ppufile,t1);
  247. ppuwritenode(ppufile,t2);
  248. end;
  249. procedure tloopnode.buildderefimpl;
  250. begin
  251. inherited buildderefimpl;
  252. if assigned(t1) then
  253. t1.buildderefimpl;
  254. if assigned(t2) then
  255. t2.buildderefimpl;
  256. end;
  257. procedure tloopnode.derefimpl;
  258. begin
  259. inherited derefimpl;
  260. if assigned(t1) then
  261. t1.derefimpl;
  262. if assigned(t2) then
  263. t2.derefimpl;
  264. end;
  265. function tloopnode.getcopy : tnode;
  266. var
  267. p : tloopnode;
  268. begin
  269. p:=tloopnode(inherited getcopy);
  270. if assigned(t1) then
  271. p.t1:=t1.getcopy
  272. else
  273. p.t1:=nil;
  274. if assigned(t2) then
  275. p.t2:=t2.getcopy
  276. else
  277. p.t2:=nil;
  278. p.loopflags:=loopflags;
  279. getcopy:=p;
  280. end;
  281. procedure tloopnode.insertintolist(l : tnodelist);
  282. begin
  283. end;
  284. procedure tloopnode.printnodetree(var t:text);
  285. begin
  286. write(t,printnodeindention,'(');
  287. printnodeindent;
  288. printnodeinfo(t);
  289. printnode(t,left);
  290. printnode(t,right);
  291. printnode(t,t1);
  292. printnode(t,t2);
  293. printnodeunindent;
  294. writeln(t,printnodeindention,')');
  295. end;
  296. function tloopnode.docompare(p: tnode): boolean;
  297. begin
  298. docompare :=
  299. inherited docompare(p) and
  300. (loopflags*loopflagsequal=tloopnode(p).loopflags*loopflagsequal) and
  301. t1.isequal(tloopnode(p).t1) and
  302. t2.isequal(tloopnode(p).t2);
  303. end;
  304. {****************************************************************************
  305. TWHILEREPEATNODE
  306. *****************************************************************************}
  307. constructor Twhilerepeatnode.create(l,r,_t1:Tnode;tab,cn:boolean);
  308. begin
  309. inherited create(whilerepeatn,l,r,_t1,nil);
  310. if tab then
  311. include(loopflags, lnf_testatbegin);
  312. if cn then
  313. include(loopflags,lnf_checknegate);
  314. end;
  315. function twhilerepeatnode.det_resulttype:tnode;
  316. var
  317. t:Tunarynode;
  318. begin
  319. result:=nil;
  320. resulttype:=voidtype;
  321. resulttypepass(left);
  322. {A not node can be removed.}
  323. if left.nodetype=notn then
  324. begin
  325. t:=Tunarynode(left);
  326. left:=Tunarynode(left).left;
  327. t.left:=nil;
  328. t.destroy;
  329. {Symdif operator, in case you are wondering:}
  330. loopflags:=loopflags >< [lnf_checknegate];
  331. end;
  332. { loop instruction }
  333. if assigned(right) then
  334. resulttypepass(right);
  335. set_varstate(left,vs_used,true);
  336. if codegenerror then
  337. exit;
  338. if not is_boolean(left.resulttype.def) then
  339. begin
  340. CGMessage1(type_e_boolean_expr_expected,left.resulttype.def.typename);
  341. exit;
  342. end;
  343. end;
  344. function twhilerepeatnode.pass_1 : tnode;
  345. var
  346. old_t_times : longint;
  347. begin
  348. result:=nil;
  349. expectloc:=LOC_VOID;
  350. old_t_times:=cg.t_times;
  351. { calc register weight }
  352. if not(cs_littlesize in aktglobalswitches ) then
  353. cg.t_times:=cg.t_times*8;
  354. firstpass(left);
  355. if codegenerror then
  356. exit;
  357. registersint:=left.registersint;
  358. registersfpu:=left.registersfpu;
  359. {$ifdef SUPPORT_MMX}
  360. registersmmx:=left.registersmmx;
  361. {$endif SUPPORT_MMX}
  362. { loop instruction }
  363. if assigned(right) then
  364. begin
  365. firstpass(right);
  366. if codegenerror then
  367. exit;
  368. if registersint<right.registersint then
  369. registersint:=right.registersint;
  370. if registersfpu<right.registersfpu then
  371. registersfpu:=right.registersfpu;
  372. {$ifdef SUPPORT_MMX}
  373. if registersmmx<right.registersmmx then
  374. registersmmx:=right.registersmmx;
  375. {$endif SUPPORT_MMX}
  376. end;
  377. cg.t_times:=old_t_times;
  378. end;
  379. {$ifdef state_tracking}
  380. function Twhilerepeatnode.track_state_pass(exec_known:boolean):boolean;
  381. var condition:Tnode;
  382. code:Tnode;
  383. done:boolean;
  384. value:boolean;
  385. change:boolean;
  386. firsttest:boolean;
  387. factval:Tnode;
  388. begin
  389. track_state_pass:=false;
  390. done:=false;
  391. firsttest:=true;
  392. {For repeat until statements, first do a pass through the code.}
  393. if not(lnf_testatbegin in flags) then
  394. begin
  395. code:=right.getcopy;
  396. if code.track_state_pass(exec_known) then
  397. track_state_pass:=true;
  398. code.destroy;
  399. end;
  400. repeat
  401. condition:=left.getcopy;
  402. code:=right.getcopy;
  403. change:=condition.track_state_pass(exec_known);
  404. factval:=aktstate.find_fact(left);
  405. if factval<>nil then
  406. begin
  407. condition.destroy;
  408. condition:=factval.getcopy;
  409. change:=true;
  410. end;
  411. if change then
  412. begin
  413. track_state_pass:=true;
  414. {Force new resulttype pass.}
  415. condition.resulttype.def:=nil;
  416. do_resulttypepass(condition);
  417. end;
  418. if is_constboolnode(condition) then
  419. begin
  420. {Try to turn a while loop into a repeat loop.}
  421. if firsttest then
  422. exclude(flags,testatbegin);
  423. value:=(Tordconstnode(condition).value<>0) xor checknegate;
  424. if value then
  425. begin
  426. if code.track_state_pass(exec_known) then
  427. track_state_pass:=true;
  428. end
  429. else
  430. done:=true;
  431. end
  432. else
  433. begin
  434. {Remove any modified variables from the state.}
  435. code.track_state_pass(false);
  436. done:=true;
  437. end;
  438. code.destroy;
  439. condition.destroy;
  440. firsttest:=false;
  441. until done;
  442. {The loop condition is also known, for example:
  443. while i<10 do
  444. begin
  445. ...
  446. end;
  447. When the loop is done, we do know that i<10 = false.
  448. }
  449. condition:=left.getcopy;
  450. if condition.track_state_pass(exec_known) then
  451. begin
  452. track_state_pass:=true;
  453. {Force new resulttype pass.}
  454. condition.resulttype.def:=nil;
  455. do_resulttypepass(condition);
  456. end;
  457. if not is_constboolnode(condition) then
  458. aktstate.store_fact(condition,
  459. cordconstnode.create(byte(checknegate),booltype,true))
  460. else
  461. condition.destroy;
  462. end;
  463. {$endif}
  464. {*****************************************************************************
  465. TIFNODE
  466. *****************************************************************************}
  467. constructor tifnode.create(l,r,_t1 : tnode);
  468. begin
  469. inherited create(ifn,l,r,_t1,nil);
  470. end;
  471. function tifnode.det_resulttype:tnode;
  472. begin
  473. result:=nil;
  474. resulttype:=voidtype;
  475. resulttypepass(left);
  476. { if path }
  477. if assigned(right) then
  478. resulttypepass(right);
  479. { else path }
  480. if assigned(t1) then
  481. resulttypepass(t1);
  482. set_varstate(left,vs_used,true);
  483. if codegenerror then
  484. exit;
  485. if not is_boolean(left.resulttype.def) then
  486. Message1(type_e_boolean_expr_expected,left.resulttype.def.typename);
  487. end;
  488. function tifnode.pass_1 : tnode;
  489. var
  490. old_t_times : longint;
  491. hp : tnode;
  492. begin
  493. result:=nil;
  494. expectloc:=LOC_VOID;
  495. old_t_times:=cg.t_times;
  496. firstpass(left);
  497. registersint:=left.registersint;
  498. registersfpu:=left.registersfpu;
  499. {$ifdef SUPPORT_MMX}
  500. registersmmx:=left.registersmmx;
  501. {$endif SUPPORT_MMX}
  502. { determines registers weigths }
  503. if not(cs_littlesize in aktglobalswitches) then
  504. cg.t_times:=cg.t_times div 2;
  505. if cg.t_times=0 then
  506. cg.t_times:=1;
  507. { if path }
  508. if assigned(right) then
  509. begin
  510. firstpass(right);
  511. if registersint<right.registersint then
  512. registersint:=right.registersint;
  513. if registersfpu<right.registersfpu then
  514. registersfpu:=right.registersfpu;
  515. {$ifdef SUPPORT_MMX}
  516. if registersmmx<right.registersmmx then
  517. registersmmx:=right.registersmmx;
  518. {$endif SUPPORT_MMX}
  519. end;
  520. { else path }
  521. if assigned(t1) then
  522. begin
  523. firstpass(t1);
  524. if registersint<t1.registersint then
  525. registersint:=t1.registersint;
  526. if registersfpu<t1.registersfpu then
  527. registersfpu:=t1.registersfpu;
  528. {$ifdef SUPPORT_MMX}
  529. if registersmmx<t1.registersmmx then
  530. registersmmx:=t1.registersmmx;
  531. {$endif SUPPORT_MMX}
  532. end;
  533. { leave if we've got an error in one of the paths }
  534. if codegenerror then
  535. exit;
  536. if left.nodetype=ordconstn then
  537. begin
  538. { optimize }
  539. if tordconstnode(left).value=1 then
  540. begin
  541. hp:=right;
  542. right:=nil;
  543. { we cannot set p to nil !!! }
  544. if assigned(hp) then
  545. result:=hp
  546. else
  547. result:=cnothingnode.create;
  548. end
  549. else
  550. begin
  551. hp:=t1;
  552. t1:=nil;
  553. { we cannot set p to nil !!! }
  554. if assigned(hp) then
  555. result:=hp
  556. else
  557. result:=cnothingnode.create;
  558. end;
  559. end;
  560. cg.t_times:=old_t_times;
  561. end;
  562. {*****************************************************************************
  563. TFORNODE
  564. *****************************************************************************}
  565. constructor tfornode.create(l,r,_t1,_t2 : tnode;back : boolean);
  566. begin
  567. inherited create(forn,l,r,_t1,_t2);
  568. if back then
  569. include(loopflags,lnf_backward);
  570. include(loopflags,lnf_testatbegin);
  571. end;
  572. procedure Tfornode.loop_var_access(not_type:Tnotification_flag;
  573. symbol:Tsym);
  574. begin
  575. {If there is a read access, the value of the loop counter is important;
  576. at the end of the loop the loop variable should contain the value it
  577. had in the last iteration.}
  578. if not_type=vn_onwrite then
  579. begin
  580. writeln('Loopvar does not matter on exit');
  581. end
  582. else
  583. begin
  584. exclude(loopflags,lnf_dont_mind_loopvar_on_exit);
  585. writeln('Loopvar does matter on exit');
  586. end;
  587. Tvarsym(symbol).unregister_notification(loopvar_notid);
  588. end;
  589. function tfornode.det_resulttype:tnode;
  590. var
  591. hp : tnode;
  592. begin
  593. result:=nil;
  594. resulttype:=voidtype;
  595. {Can we spare the first comparision?}
  596. if (right.nodetype=ordconstn) and
  597. (Tassignmentnode(left).right.nodetype=ordconstn) and
  598. (
  599. (
  600. (lnf_backward in loopflags) and
  601. (Tordconstnode(Tassignmentnode(left).right).value>=Tordconstnode(right).value)
  602. ) or
  603. (
  604. not(lnf_backward in loopflags) and
  605. (Tordconstnode(Tassignmentnode(left).right).value<=Tordconstnode(right).value)
  606. )
  607. ) then
  608. exclude(loopflags,lnf_testatbegin);
  609. { save counter var }
  610. t2:=tassignmentnode(left).left.getcopy;
  611. resulttypepass(left);
  612. set_varstate(left,vs_used,true);
  613. if assigned(t1) then
  614. begin
  615. resulttypepass(t1);
  616. if codegenerror then
  617. exit;
  618. end;
  619. { process count var }
  620. resulttypepass(t2);
  621. set_varstate(t2,vs_used,false);
  622. if codegenerror then
  623. exit;
  624. resulttypepass(right);
  625. set_varstate(right,vs_used,true);
  626. inserttypeconv(right,t2.resulttype);
  627. end;
  628. function tfornode.pass_1 : tnode;
  629. var
  630. old_t_times : longint;
  631. begin
  632. result:=nil;
  633. expectloc:=LOC_VOID;
  634. { Calc register weight }
  635. old_t_times:=cg.t_times;
  636. if not(cs_littlesize in aktglobalswitches) then
  637. cg.t_times:=cg.t_times*8;
  638. firstpass(left);
  639. if assigned(t1) then
  640. begin
  641. firstpass(t1);
  642. if codegenerror then
  643. exit;
  644. end;
  645. registersint:=t1.registersint;
  646. registersfpu:=t1.registersfpu;
  647. {$ifdef SUPPORT_MMX}
  648. registersmmx:=left.registersmmx;
  649. {$endif SUPPORT_MMX}
  650. if left.registersint>registersint then
  651. registersint:=left.registersint;
  652. if left.registersfpu>registersfpu then
  653. registersfpu:=left.registersfpu;
  654. {$ifdef SUPPORT_MMX}
  655. if left.registersmmx>registersmmx then
  656. registersmmx:=left.registersmmx;
  657. {$endif SUPPORT_MMX}
  658. { process count var }
  659. firstpass(t2);
  660. if codegenerror then
  661. exit;
  662. if t2.registersint>registersint then
  663. registersint:=t2.registersint;
  664. if t2.registersfpu>registersfpu then
  665. registersfpu:=t2.registersfpu;
  666. {$ifdef SUPPORT_MMX}
  667. if t2.registersmmx>registersmmx then
  668. registersmmx:=t2.registersmmx;
  669. {$endif SUPPORT_MMX}
  670. firstpass(right);
  671. {$ifdef loopvar_dont_mind}
  672. { Check count var, record fields are also allowed in tp7 }
  673. include(loopflags,lnf_dont_mind_loopvar_on_exit);
  674. hp:=t2;
  675. while (hp.nodetype=subscriptn) or
  676. ((hp.nodetype=vecn) and
  677. is_constintnode(tvecnode(hp).right)) do
  678. hp:=tunarynode(hp).left;
  679. if (hp.nodetype=loadn) and (Tloadnode(hp).symtableentry.typ=varsym) then
  680. loopvar_notid:=Tvarsym(Tloadnode(hp).symtableentry).
  681. register_notification([vn_onread,vn_onwrite],@loop_var_access);
  682. {$endif}
  683. if right.registersint>registersint then
  684. registersint:=right.registersint;
  685. if right.registersfpu>registersfpu then
  686. registersfpu:=right.registersfpu;
  687. {$ifdef SUPPORT_MMX}
  688. if right.registersmmx>registersmmx then
  689. registersmmx:=right.registersmmx;
  690. {$endif SUPPORT_MMX}
  691. { we need at least one register for comparisons PM }
  692. if registersint=0 then
  693. inc(registersint);
  694. cg.t_times:=old_t_times;
  695. end;
  696. {*****************************************************************************
  697. TEXITNODE
  698. *****************************************************************************}
  699. constructor texitnode.create(l:tnode);
  700. begin
  701. inherited create(exitn,l);
  702. end;
  703. constructor texitnode.ppuload(t:tnodetype;ppufile:tcompilerppufile);
  704. begin
  705. inherited ppuload(t,ppufile);
  706. end;
  707. procedure texitnode.ppuwrite(ppufile:tcompilerppufile);
  708. begin
  709. inherited ppuwrite(ppufile);
  710. end;
  711. function texitnode.det_resulttype:tnode;
  712. begin
  713. result:=nil;
  714. if assigned(left) then
  715. begin
  716. { add assignment to funcretsym }
  717. inserttypeconv(left,current_procinfo.procdef.rettype);
  718. left:=cassignmentnode.create(
  719. cloadnode.create(current_procinfo.procdef.funcretsym,current_procinfo.procdef.funcretsym.owner),
  720. left);
  721. resulttypepass(left);
  722. set_varstate(left,vs_used,true);
  723. end;
  724. resulttype:=voidtype;
  725. end;
  726. function texitnode.pass_1 : tnode;
  727. begin
  728. result:=nil;
  729. expectloc:=LOC_VOID;
  730. if assigned(left) then
  731. begin
  732. firstpass(left);
  733. if codegenerror then
  734. exit;
  735. registersint:=left.registersint;
  736. registersfpu:=left.registersfpu;
  737. {$ifdef SUPPORT_MMX}
  738. registersmmx:=left.registersmmx;
  739. {$endif SUPPORT_MMX}
  740. end;
  741. end;
  742. {*****************************************************************************
  743. TBREAKNODE
  744. *****************************************************************************}
  745. constructor tbreaknode.create;
  746. begin
  747. inherited create(breakn);
  748. end;
  749. function tbreaknode.det_resulttype:tnode;
  750. begin
  751. result:=nil;
  752. resulttype:=voidtype;
  753. end;
  754. function tbreaknode.pass_1 : tnode;
  755. begin
  756. result:=nil;
  757. expectloc:=LOC_VOID;
  758. end;
  759. {*****************************************************************************
  760. TCONTINUENODE
  761. *****************************************************************************}
  762. constructor tcontinuenode.create;
  763. begin
  764. inherited create(continuen);
  765. end;
  766. function tcontinuenode.det_resulttype:tnode;
  767. begin
  768. result:=nil;
  769. resulttype:=voidtype;
  770. end;
  771. function tcontinuenode.pass_1 : tnode;
  772. begin
  773. result:=nil;
  774. expectloc:=LOC_VOID;
  775. end;
  776. {*****************************************************************************
  777. TGOTONODE
  778. *****************************************************************************}
  779. constructor tgotonode.create(p : tlabelsym);
  780. begin
  781. inherited create(goton);
  782. exceptionblock:=aktexceptblock;
  783. labsym:=p;
  784. end;
  785. constructor tgotonode.ppuload(t:tnodetype;ppufile:tcompilerppufile);
  786. begin
  787. inherited ppuload(t,ppufile);
  788. ppufile.getderef(labsymderef);
  789. exceptionblock:=ppufile.getbyte;
  790. end;
  791. procedure tgotonode.ppuwrite(ppufile:tcompilerppufile);
  792. begin
  793. inherited ppuwrite(ppufile);
  794. ppufile.putderef(labsymderef);
  795. ppufile.putbyte(exceptionblock);
  796. end;
  797. procedure tgotonode.buildderefimpl;
  798. begin
  799. inherited buildderefimpl;
  800. labsymderef.build(labsym);
  801. end;
  802. procedure tgotonode.derefimpl;
  803. begin
  804. inherited derefimpl;
  805. labsym:=tlabelsym(labsymderef.resolve);
  806. end;
  807. function tgotonode.det_resulttype:tnode;
  808. begin
  809. result:=nil;
  810. resulttype:=voidtype;
  811. end;
  812. function tgotonode.pass_1 : tnode;
  813. begin
  814. result:=nil;
  815. expectloc:=LOC_VOID;
  816. { check if }
  817. if assigned(labsym) and
  818. assigned(labsym.code) and
  819. (exceptionblock<>tlabelnode(labsym.code).exceptionblock) then
  820. CGMessage(cg_e_goto_inout_of_exception_block);
  821. end;
  822. function tgotonode.getcopy : tnode;
  823. var
  824. p : tgotonode;
  825. begin
  826. p:=tgotonode(inherited getcopy);
  827. p.labsym:=labsym;
  828. p.exceptionblock:=exceptionblock;
  829. result:=p;
  830. end;
  831. function tgotonode.docompare(p: tnode): boolean;
  832. begin
  833. docompare := false;
  834. end;
  835. {*****************************************************************************
  836. TLABELNODE
  837. *****************************************************************************}
  838. constructor tlabelnode.createcase(p : tasmlabel;l:tnode);
  839. begin
  840. inherited create(labeln,l);
  841. { it shouldn't be possible to jump to case labels using goto }
  842. exceptionblock:=-1;
  843. labsym:=nil;
  844. labelnr:=p;
  845. end;
  846. constructor tlabelnode.create(p : tlabelsym;l:tnode);
  847. begin
  848. inherited create(labeln,l);
  849. exceptionblock:=aktexceptblock;
  850. labsym:=p;
  851. labelnr:=p.lab;
  852. { save the current labelnode in the labelsym }
  853. p.code:=self;
  854. end;
  855. constructor tlabelnode.ppuload(t:tnodetype;ppufile:tcompilerppufile);
  856. begin
  857. inherited ppuload(t,ppufile);
  858. ppufile.getderef(labsymderef);
  859. labelnr:=tasmlabel(ppufile.getasmsymbol);
  860. exceptionblock:=ppufile.getbyte;
  861. end;
  862. procedure tlabelnode.ppuwrite(ppufile:tcompilerppufile);
  863. begin
  864. inherited ppuwrite(ppufile);
  865. ppufile.putderef(labsymderef);
  866. ppufile.putasmsymbol(labelnr);
  867. ppufile.putbyte(exceptionblock);
  868. end;
  869. procedure tlabelnode.buildderefimpl;
  870. begin
  871. inherited buildderefimpl;
  872. labsymderef.build(labsym);
  873. end;
  874. procedure tlabelnode.derefimpl;
  875. begin
  876. inherited derefimpl;
  877. labsym:=tlabelsym(labsymderef.resolve);
  878. objectlibrary.derefasmsymbol(tasmsymbol(labelnr));
  879. end;
  880. function tlabelnode.det_resulttype:tnode;
  881. begin
  882. result:=nil;
  883. { left could still be unassigned }
  884. if assigned(left) then
  885. resulttypepass(left);
  886. resulttype:=voidtype;
  887. end;
  888. function tlabelnode.pass_1 : tnode;
  889. begin
  890. result:=nil;
  891. expectloc:=LOC_VOID;
  892. if assigned(left) then
  893. begin
  894. firstpass(left);
  895. registersint:=left.registersint;
  896. registersfpu:=left.registersfpu;
  897. {$ifdef SUPPORT_MMX}
  898. registersmmx:=left.registersmmx;
  899. {$endif SUPPORT_MMX}
  900. end;
  901. end;
  902. function tlabelnode.getcopy : tnode;
  903. var
  904. p : tlabelnode;
  905. begin
  906. p:=tlabelnode(inherited getcopy);
  907. p.labelnr:=labelnr;
  908. p.exceptionblock:=exceptionblock;
  909. p.labsym:=labsym;
  910. result:=p;
  911. end;
  912. function tlabelnode.docompare(p: tnode): boolean;
  913. begin
  914. docompare := false;
  915. end;
  916. {*****************************************************************************
  917. TRAISENODE
  918. *****************************************************************************}
  919. constructor traisenode.create(l,taddr,tframe:tnode);
  920. begin
  921. inherited create(raisen,l,taddr);
  922. frametree:=tframe;
  923. end;
  924. constructor traisenode.ppuload(t:tnodetype;ppufile:tcompilerppufile);
  925. begin
  926. inherited ppuload(t,ppufile);
  927. frametree:=ppuloadnode(ppufile);
  928. end;
  929. procedure traisenode.ppuwrite(ppufile:tcompilerppufile);
  930. begin
  931. inherited ppuwrite(ppufile);
  932. ppuwritenode(ppufile,frametree);
  933. end;
  934. procedure traisenode.buildderefimpl;
  935. begin
  936. inherited buildderefimpl;
  937. if assigned(frametree) then
  938. frametree.buildderefimpl;
  939. end;
  940. procedure traisenode.derefimpl;
  941. begin
  942. inherited derefimpl;
  943. if assigned(frametree) then
  944. frametree.derefimpl;
  945. end;
  946. function traisenode.getcopy : tnode;
  947. var
  948. n : traisenode;
  949. begin
  950. n:=traisenode(inherited getcopy);
  951. if assigned(frametree) then
  952. n.frametree:=frametree.getcopy
  953. else
  954. n.frametree:=nil;
  955. getcopy:=n;
  956. end;
  957. procedure traisenode.insertintolist(l : tnodelist);
  958. begin
  959. end;
  960. function traisenode.det_resulttype:tnode;
  961. begin
  962. result:=nil;
  963. resulttype:=voidtype;
  964. if assigned(left) then
  965. begin
  966. { first para must be a _class_ }
  967. resulttypepass(left);
  968. set_varstate(left,vs_used,true);
  969. if codegenerror then
  970. exit;
  971. if not(is_class(left.resulttype.def)) then
  972. CGMessage1(type_e_class_type_expected,left.resulttype.def.typename);
  973. { insert needed typeconvs for addr,frame }
  974. if assigned(right) then
  975. begin
  976. { addr }
  977. resulttypepass(right);
  978. inserttypeconv(right,voidpointertype);
  979. { frame }
  980. if assigned(frametree) then
  981. begin
  982. resulttypepass(frametree);
  983. inserttypeconv(frametree,voidpointertype);
  984. end;
  985. end;
  986. end;
  987. end;
  988. function traisenode.pass_1 : tnode;
  989. begin
  990. result:=nil;
  991. include(current_procinfo.flags,pi_do_call);
  992. expectloc:=LOC_VOID;
  993. if assigned(left) then
  994. begin
  995. { first para must be a _class_ }
  996. firstpass(left);
  997. { insert needed typeconvs for addr,frame }
  998. if assigned(right) then
  999. begin
  1000. { addr }
  1001. firstpass(right);
  1002. { frame }
  1003. if assigned(frametree) then
  1004. firstpass(frametree);
  1005. end;
  1006. left_right_max;
  1007. end;
  1008. end;
  1009. function traisenode.docompare(p: tnode): boolean;
  1010. begin
  1011. docompare := false;
  1012. end;
  1013. {*****************************************************************************
  1014. TTRYEXCEPTNODE
  1015. *****************************************************************************}
  1016. constructor ttryexceptnode.create(l,r,_t1 : tnode);
  1017. begin
  1018. inherited create(tryexceptn,l,r,_t1,nil);
  1019. end;
  1020. function ttryexceptnode.det_resulttype:tnode;
  1021. begin
  1022. result:=nil;
  1023. resulttypepass(left);
  1024. { on statements }
  1025. if assigned(right) then
  1026. resulttypepass(right);
  1027. { else block }
  1028. if assigned(t1) then
  1029. resulttypepass(t1);
  1030. resulttype:=voidtype;
  1031. end;
  1032. function ttryexceptnode.pass_1 : tnode;
  1033. begin
  1034. result:=nil;
  1035. include(current_procinfo.flags,pi_do_call);
  1036. expectloc:=LOC_VOID;
  1037. firstpass(left);
  1038. { on statements }
  1039. if assigned(right) then
  1040. begin
  1041. firstpass(right);
  1042. registersint:=max(registersint,right.registersint);
  1043. registersfpu:=max(registersfpu,right.registersfpu);
  1044. {$ifdef SUPPORT_MMX}
  1045. registersmmx:=max(registersmmx,right.registersmmx);
  1046. {$endif SUPPORT_MMX}
  1047. end;
  1048. { else block }
  1049. if assigned(t1) then
  1050. begin
  1051. firstpass(t1);
  1052. registersint:=max(registersint,t1.registersint);
  1053. registersfpu:=max(registersfpu,t1.registersfpu);
  1054. {$ifdef SUPPORT_MMX}
  1055. registersmmx:=max(registersmmx,t1.registersmmx);
  1056. {$endif SUPPORT_MMX}
  1057. end;
  1058. end;
  1059. {*****************************************************************************
  1060. TTRYFINALLYNODE
  1061. *****************************************************************************}
  1062. constructor ttryfinallynode.create(l,r:tnode);
  1063. begin
  1064. inherited create(tryfinallyn,l,r,nil,nil);
  1065. implicitframe:=false;
  1066. end;
  1067. constructor ttryfinallynode.create_implicit(l,r,_t1:tnode);
  1068. begin
  1069. inherited create(tryfinallyn,l,r,_t1,nil);
  1070. implicitframe:=true;
  1071. end;
  1072. function ttryfinallynode.det_resulttype:tnode;
  1073. begin
  1074. result:=nil;
  1075. include(current_procinfo.flags,pi_do_call);
  1076. resulttype:=voidtype;
  1077. resulttypepass(left);
  1078. set_varstate(left,vs_used,true);
  1079. resulttypepass(right);
  1080. set_varstate(right,vs_used,true);
  1081. { special finally block only executed when there was an exception }
  1082. if assigned(t1) then
  1083. begin
  1084. resulttypepass(t1);
  1085. set_varstate(t1,vs_used,true);
  1086. end;
  1087. end;
  1088. function ttryfinallynode.pass_1 : tnode;
  1089. begin
  1090. result:=nil;
  1091. expectloc:=LOC_VOID;
  1092. firstpass(left);
  1093. firstpass(right);
  1094. left_right_max;
  1095. if assigned(t1) then
  1096. begin
  1097. firstpass(t1);
  1098. registersint:=max(registersint,t1.registersint);
  1099. registersfpu:=max(registersfpu,t1.registersfpu);
  1100. {$ifdef SUPPORT_MMX}
  1101. registersmmx:=max(registersmmx,t1.registersmmx);
  1102. {$endif SUPPORT_MMX}
  1103. end;
  1104. end;
  1105. {*****************************************************************************
  1106. TONNODE
  1107. *****************************************************************************}
  1108. constructor tonnode.create(l,r:tnode);
  1109. begin
  1110. inherited create(onn,l,r);
  1111. exceptsymtable:=nil;
  1112. excepttype:=nil;
  1113. end;
  1114. destructor tonnode.destroy;
  1115. begin
  1116. { copied nodes don't need to release the symtable }
  1117. if assigned(exceptsymtable) then
  1118. exceptsymtable.free;
  1119. inherited destroy;
  1120. end;
  1121. constructor tonnode.ppuload(t:tnodetype;ppufile:tcompilerppufile);
  1122. begin
  1123. inherited ppuload(t,ppufile);
  1124. exceptsymtable:=nil;
  1125. excepttype:=nil;
  1126. end;
  1127. function tonnode.getcopy : tnode;
  1128. var
  1129. n : tonnode;
  1130. begin
  1131. n:=tonnode(inherited getcopy);
  1132. n.exceptsymtable:=exceptsymtable.getcopy;
  1133. n.excepttype:=excepttype;
  1134. result:=n;
  1135. end;
  1136. function tonnode.det_resulttype:tnode;
  1137. begin
  1138. result:=nil;
  1139. resulttype:=voidtype;
  1140. if not(is_class(excepttype)) then
  1141. CGMessage1(type_e_class_type_expected,excepttype.typename);
  1142. if assigned(left) then
  1143. resulttypepass(left);
  1144. if assigned(right) then
  1145. resulttypepass(right);
  1146. end;
  1147. function tonnode.pass_1 : tnode;
  1148. begin
  1149. result:=nil;
  1150. include(current_procinfo.flags,pi_do_call);
  1151. expectloc:=LOC_VOID;
  1152. registersint:=0;
  1153. registersfpu:=0;
  1154. {$ifdef SUPPORT_MMX}
  1155. registersmmx:=0;
  1156. {$endif SUPPORT_MMX}
  1157. if assigned(left) then
  1158. begin
  1159. firstpass(left);
  1160. registersint:=left.registersint;
  1161. registersfpu:=left.registersfpu;
  1162. {$ifdef SUPPORT_MMX}
  1163. registersmmx:=left.registersmmx;
  1164. {$endif SUPPORT_MMX}
  1165. end;
  1166. if assigned(right) then
  1167. begin
  1168. firstpass(right);
  1169. registersint:=max(registersint,right.registersint);
  1170. registersfpu:=max(registersfpu,right.registersfpu);
  1171. {$ifdef SUPPORT_MMX}
  1172. registersmmx:=max(registersmmx,right.registersmmx);
  1173. {$endif SUPPORT_MMX}
  1174. end;
  1175. end;
  1176. function tonnode.docompare(p: tnode): boolean;
  1177. begin
  1178. docompare := false;
  1179. end;
  1180. begin
  1181. cwhilerepeatnode:=twhilerepeatnode;
  1182. cifnode:=tifnode;
  1183. cfornode:=tfornode;
  1184. cexitnode:=texitnode;
  1185. cgotonode:=tgotonode;
  1186. clabelnode:=tlabelnode;
  1187. craisenode:=traisenode;
  1188. ctryexceptnode:=ttryexceptnode;
  1189. ctryfinallynode:=ttryfinallynode;
  1190. connode:=tonnode;
  1191. end.
  1192. {
  1193. $Log$
  1194. Revision 1.101 2004-10-15 09:14:17 mazen
  1195. - remove $IFDEF DELPHI and related code
  1196. - remove $IFDEF FPCPROCVAR and related code
  1197. Revision 1.100 2004/09/13 20:28:26 peter
  1198. * for loop variable assignment is not allowed anymore
  1199. Revision 1.99 2004/08/30 12:09:45 michael
  1200. + Patch from peter to fix bug 3272
  1201. Revision 1.98 2004/06/20 08:55:29 florian
  1202. * logs truncated
  1203. Revision 1.97 2004/06/16 20:07:08 florian
  1204. * dwarf branch merged
  1205. Revision 1.96 2004/05/23 15:04:13 peter
  1206. * remvoe writeln
  1207. Revision 1.95.2.1 2004/04/28 19:55:51 peter
  1208. * new warning for ordinal-pointer when size is different
  1209. * fixed some cg_e_ messages to the correct section type_e_ or parser_e_
  1210. Revision 1.95 2004/03/18 16:19:03 peter
  1211. * fixed operator overload allowing for pointer-string
  1212. * replaced some type_e_mismatch with more informational messages
  1213. Revision 1.94 2004/02/05 01:24:08 florian
  1214. * several fixes to compile x86-64 system
  1215. }