nflw.pas 34 KB

12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364656667686970717273747576777879808182838485868788899091929394959697989910010110210310410510610710810911011111211311411511611711811912012112212312412512612712812913013113213313413513613713813914014114214314414514614714814915015115215315415515615715815916016116216316416516616716816917017117217317417517617717817918018118218318418518618718818919019119219319419519619719819920020120220320420520620720820921021121221321421521621721821922022122222322422522622722822923023123223323423523623723823924024124224324424524624724824925025125225325425525625725825926026126226326426526626726826927027127227327427527627727827928028128228328428528628728828929029129229329429529629729829930030130230330430530630730830931031131231331431531631731831932032132232332432532632732832933033133233333433533633733833934034134234334434534634734834935035135235335435535635735835936036136236336436536636736836937037137237337437537637737837938038138238338438538638738838939039139239339439539639739839940040140240340440540640740840941041141241341441541641741841942042142242342442542642742842943043143243343443543643743843944044144244344444544644744844945045145245345445545645745845946046146246346446546646746846947047147247347447547647747847948048148248348448548648748848949049149249349449549649749849950050150250350450550650750850951051151251351451551651751851952052152252352452552652752852953053153253353453553653753853954054154254354454554654754854955055155255355455555655755855956056156256356456556656756856957057157257357457557657757857958058158258358458558658758858959059159259359459559659759859960060160260360460560660760860961061161261361461561661761861962062162262362462562662762862963063163263363463563663763863964064164264364464564664764864965065165265365465565665765865966066166266366466566666766866967067167267367467567667767867968068168268368468568668768868969069169269369469569669769869970070170270370470570670770870971071171271371471571671771871972072172272372472572672772872973073173273373473573673773873974074174274374474574674774874975075175275375475575675775875976076176276376476576676776876977077177277377477577677777877978078178278378478578678778878979079179279379479579679779879980080180280380480580680780880981081181281381481581681781881982082182282382482582682782882983083183283383483583683783883984084184284384484584684784884985085185285385485585685785885986086186286386486586686786886987087187287387487587687787887988088188288388488588688788888989089189289389489589689789889990090190290390490590690790890991091191291391491591691791891992092192292392492592692792892993093193293393493593693793893994094194294394494594694794894995095195295395495595695795895996096196296396496596696796896997097197297397497597697797897998098198298398498598698798898999099199299399499599699799899910001001100210031004100510061007100810091010101110121013101410151016101710181019102010211022102310241025102610271028102910301031103210331034103510361037103810391040104110421043104410451046104710481049105010511052105310541055105610571058105910601061106210631064106510661067106810691070107110721073107410751076107710781079108010811082108310841085108610871088108910901091109210931094109510961097109810991100110111021103110411051106110711081109111011111112111311141115111611171118111911201121112211231124112511261127112811291130113111321133113411351136113711381139114011411142114311441145114611471148114911501151115211531154115511561157115811591160116111621163116411651166116711681169117011711172117311741175117611771178117911801181118211831184118511861187118811891190119111921193119411951196119711981199120012011202120312041205120612071208120912101211121212131214121512161217121812191220122112221223122412251226122712281229123012311232123312341235123612371238123912401241124212431244124512461247124812491250125112521253125412551256125712581259126012611262126312641265126612671268
  1. {
  2. $Id$
  3. Copyright (c) 1998-2000 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 defines.inc}
  21. interface
  22. uses
  23. node,aasm,cpubase,
  24. symbase,symdef,symsym;
  25. type
  26. tloopnode = class(tbinarynode)
  27. t1,t2 : tnode;
  28. constructor create(tt : tnodetype;l,r,_t1,_t2 : tnode);virtual;
  29. destructor destroy;override;
  30. function getcopy : tnode;override;
  31. procedure insertintolist(l : tnodelist);override;
  32. {$ifdef extdebug}
  33. procedure dowrite;override;
  34. {$endif extdebug}
  35. function docompare(p: tnode): boolean; override;
  36. end;
  37. twhilerepeatnode = class(tloopnode)
  38. function det_resulttype:tnode;override;
  39. function pass_1 : tnode;override;
  40. end;
  41. twhilerepeatnodeclass = class of twhilerepeatnode;
  42. tifnode = class(tloopnode)
  43. constructor create(l,r,_t1 : tnode);virtual;
  44. function det_resulttype:tnode;override;
  45. function pass_1 : tnode;override;
  46. end;
  47. tifnodeclass = class of tifnode;
  48. tfornode = class(tloopnode)
  49. constructor create(l,r,_t1,_t2 : tnode;back : boolean);virtual;
  50. function det_resulttype:tnode;override;
  51. function pass_1 : tnode;override;
  52. end;
  53. tfornodeclass = class of tfornode;
  54. texitnode = class(tunarynode)
  55. constructor create(l:tnode);virtual;
  56. function det_resulttype:tnode;override;
  57. function pass_1 : tnode;override;
  58. end;
  59. texitnodeclass = class of texitnode;
  60. tbreaknode = class(tnode)
  61. constructor create;virtual;
  62. function det_resulttype:tnode;override;
  63. function pass_1 : tnode;override;
  64. end;
  65. tbreaknodeclass = class of tbreaknode;
  66. tcontinuenode = class(tnode)
  67. constructor create;virtual;
  68. function det_resulttype:tnode;override;
  69. function pass_1 : tnode;override;
  70. end;
  71. tcontinuenodeclass = class of tcontinuenode;
  72. tgotonode = class(tnode)
  73. labelnr : tasmlabel;
  74. labsym : tlabelsym;
  75. exceptionblock : integer;
  76. constructor create(p : tlabelsym);virtual;
  77. function getcopy : tnode;override;
  78. function det_resulttype:tnode;override;
  79. function pass_1 : tnode;override;
  80. function docompare(p: tnode): boolean; override;
  81. end;
  82. tgotonodeclass = class of tgotonode;
  83. tlabelnode = class(tunarynode)
  84. labelnr : tasmlabel;
  85. labsym : tlabelsym;
  86. exceptionblock : integer;
  87. constructor createcase(p : tasmlabel;l:tnode);virtual;
  88. constructor create(p : tlabelsym;l:tnode);virtual;
  89. function getcopy : tnode;override;
  90. function det_resulttype:tnode;override;
  91. function pass_1 : tnode;override;
  92. function docompare(p: tnode): boolean; override;
  93. end;
  94. tlabelnodeclass = class of tlabelnode;
  95. traisenode = class(tbinarynode)
  96. frametree : tnode;
  97. constructor create(l,taddr,tframe:tnode);virtual;
  98. function getcopy : tnode;override;
  99. procedure insertintolist(l : tnodelist);override;
  100. function det_resulttype:tnode;override;
  101. function pass_1 : tnode;override;
  102. function docompare(p: tnode): boolean; override;
  103. end;
  104. traisenodeclass = class of traisenode;
  105. ttryexceptnode = class(tloopnode)
  106. constructor create(l,r,_t1 : tnode);virtual;
  107. function det_resulttype:tnode;override;
  108. function pass_1 : tnode;override;
  109. end;
  110. ttryexceptnodeclass = class of ttryexceptnode;
  111. ttryfinallynode = class(tbinarynode)
  112. constructor create(l,r:tnode);virtual;
  113. function det_resulttype:tnode;override;
  114. function pass_1 : tnode;override;
  115. end;
  116. ttryfinallynodeclass = class of ttryfinallynode;
  117. tonnode = class(tbinarynode)
  118. exceptsymtable : tsymtable;
  119. excepttype : tobjectdef;
  120. constructor create(l,r:tnode);virtual;
  121. destructor destroy;override;
  122. function det_resulttype:tnode;override;
  123. function pass_1 : tnode;override;
  124. function getcopy : tnode;override;
  125. function docompare(p: tnode): boolean; override;
  126. end;
  127. tonnodeclass = class of tonnode;
  128. tfailnode = class(tnode)
  129. constructor create;virtual;
  130. function det_resulttype:tnode;override;
  131. function pass_1: tnode;override;
  132. function docompare(p: tnode): boolean; override;
  133. end;
  134. tfailnodeclass = class of tfailnode;
  135. { for compatibilty }
  136. function genloopnode(t : tnodetype;l,r,n1 : tnode;back : boolean) : tnode;
  137. var
  138. cwhilerepeatnode : twhilerepeatnodeclass;
  139. cifnode : tifnodeclass;
  140. cfornode : tfornodeclass;
  141. cexitnode : texitnodeclass;
  142. cbreaknode : tbreaknodeclass;
  143. ccontinuenode : tcontinuenodeclass;
  144. cgotonode : tgotonodeclass;
  145. clabelnode : tlabelnodeclass;
  146. craisenode : traisenodeclass;
  147. ctryexceptnode : ttryexceptnodeclass;
  148. ctryfinallynode : ttryfinallynodeclass;
  149. connode : tonnodeclass;
  150. cfailnode : tfailnodeclass;
  151. implementation
  152. uses
  153. globtype,systems,
  154. cutils,verbose,globals,
  155. symconst,symtable,types,htypechk,pass_1,
  156. ncon,nmem,nld,ncnv,nbas,tgcpu,
  157. cgbase,temp_gen
  158. ;
  159. function genloopnode(t : tnodetype;l,r,n1 : tnode;back : boolean) : tnode;
  160. var
  161. p : tnode;
  162. begin
  163. case t of
  164. ifn:
  165. p:=cifnode.create(l,r,n1);
  166. repeatn:
  167. p:=cwhilerepeatnode.create(repeatn,l,r,n1,nil);
  168. whilen:
  169. p:=cwhilerepeatnode.create(whilen,l,r,n1,nil);
  170. forn:
  171. p:=cfornode.create(l,r,n1,nil,back);
  172. end;
  173. genloopnode:=p;
  174. end;
  175. {****************************************************************************
  176. TLOOPNODE
  177. *****************************************************************************}
  178. constructor tloopnode.create(tt : tnodetype;l,r,_t1,_t2 : tnode);
  179. begin
  180. inherited create(tt,l,r);
  181. t1:=_t1;
  182. t2:=_t2;
  183. set_file_line(l);
  184. end;
  185. destructor tloopnode.destroy;
  186. begin
  187. t1.free;
  188. t2.free;
  189. inherited destroy;
  190. end;
  191. function tloopnode.getcopy : tnode;
  192. var
  193. p : tloopnode;
  194. begin
  195. p:=tloopnode(inherited getcopy);
  196. if assigned(t1) then
  197. p.t1:=t1.getcopy
  198. else
  199. p.t1:=nil;
  200. if assigned(t2) then
  201. p.t2:=t2.getcopy
  202. else
  203. p.t2:=nil;
  204. getcopy:=p;
  205. end;
  206. procedure tloopnode.insertintolist(l : tnodelist);
  207. begin
  208. end;
  209. {$ifdef extdebug}
  210. procedure tloopnode.dowrite;
  211. begin
  212. inherited dowrite;
  213. writenodeindention:=writenodeindention+' ';
  214. writenode(t1);
  215. writenode(t2);
  216. delete(writenodeindention,1,4);
  217. end;
  218. {$endif extdebug}
  219. function tloopnode.docompare(p: tnode): boolean;
  220. begin
  221. docompare :=
  222. inherited docompare(p) and
  223. t1.isequal(tloopnode(p).t1) and
  224. t2.isequal(tloopnode(p).t2);
  225. end;
  226. {****************************************************************************
  227. TWHILEREPEATNODE
  228. *****************************************************************************}
  229. function twhilerepeatnode.det_resulttype:tnode;
  230. begin
  231. result:=nil;
  232. resulttype:=voidtype;
  233. resulttypepass(left);
  234. { loop instruction }
  235. if assigned(right) then
  236. resulttypepass(right);
  237. set_varstate(left,true);
  238. if codegenerror then
  239. exit;
  240. if not is_boolean(left.resulttype.def) then
  241. begin
  242. CGMessage(type_e_mismatch);
  243. exit;
  244. end;
  245. end;
  246. function twhilerepeatnode.pass_1 : tnode;
  247. var
  248. old_t_times : longint;
  249. begin
  250. result:=nil;
  251. old_t_times:=t_times;
  252. { calc register weight }
  253. if not(cs_littlesize in aktglobalswitches ) then
  254. t_times:=t_times*8;
  255. {$ifdef newcg}
  256. tg.cleartempgen;
  257. {$else newcg}
  258. cleartempgen;
  259. {$endif newcg}
  260. firstpass(left);
  261. if codegenerror then
  262. exit;
  263. registers32:=left.registers32;
  264. registersfpu:=left.registersfpu;
  265. {$ifdef SUPPORT_MMX}
  266. registersmmx:=left.registersmmx;
  267. {$endif SUPPORT_MMX}
  268. { loop instruction }
  269. if assigned(right) then
  270. begin
  271. {$ifdef newcg}
  272. tg.cleartempgen;
  273. {$else newcg}
  274. cleartempgen;
  275. {$endif newcg}
  276. firstpass(right);
  277. if codegenerror then
  278. exit;
  279. if registers32<right.registers32 then
  280. registers32:=right.registers32;
  281. if registersfpu<right.registersfpu then
  282. registersfpu:=right.registersfpu;
  283. {$ifdef SUPPORT_MMX}
  284. if registersmmx<right.registersmmx then
  285. registersmmx:=right.registersmmx;
  286. {$endif SUPPORT_MMX}
  287. end;
  288. t_times:=old_t_times;
  289. end;
  290. {*****************************************************************************
  291. TIFNODE
  292. *****************************************************************************}
  293. constructor tifnode.create(l,r,_t1 : tnode);
  294. begin
  295. inherited create(ifn,l,r,_t1,nil);
  296. end;
  297. function tifnode.det_resulttype:tnode;
  298. begin
  299. result:=nil;
  300. resulttype:=voidtype;
  301. resulttypepass(left);
  302. { if path }
  303. if assigned(right) then
  304. resulttypepass(right);
  305. { else path }
  306. if assigned(t1) then
  307. resulttypepass(t1);
  308. set_varstate(left,true);
  309. if codegenerror then
  310. exit;
  311. if not is_boolean(left.resulttype.def) then
  312. Message1(type_e_boolean_expr_expected,left.resulttype.def.typename);
  313. end;
  314. function tifnode.pass_1 : tnode;
  315. var
  316. old_t_times : longint;
  317. hp : tnode;
  318. begin
  319. result:=nil;
  320. old_t_times:=t_times;
  321. {$ifdef newcg}
  322. tg.cleartempgen;
  323. {$else newcg}
  324. cleartempgen;
  325. {$endif newcg}
  326. firstpass(left);
  327. registers32:=left.registers32;
  328. registersfpu:=left.registersfpu;
  329. {$ifdef SUPPORT_MMX}
  330. registersmmx:=left.registersmmx;
  331. {$endif SUPPORT_MMX}
  332. { determines registers weigths }
  333. if not(cs_littlesize in aktglobalswitches) then
  334. t_times:=t_times div 2;
  335. if t_times=0 then
  336. t_times:=1;
  337. { if path }
  338. if assigned(right) then
  339. begin
  340. {$ifdef newcg}
  341. tg.cleartempgen;
  342. {$else newcg}
  343. cleartempgen;
  344. {$endif newcg}
  345. firstpass(right);
  346. if registers32<right.registers32 then
  347. registers32:=right.registers32;
  348. if registersfpu<right.registersfpu then
  349. registersfpu:=right.registersfpu;
  350. {$ifdef SUPPORT_MMX}
  351. if registersmmx<right.registersmmx then
  352. registersmmx:=right.registersmmx;
  353. {$endif SUPPORT_MMX}
  354. end;
  355. { else path }
  356. if assigned(t1) then
  357. begin
  358. {$ifdef newcg}
  359. tg.cleartempgen;
  360. {$else newcg}
  361. cleartempgen;
  362. {$endif newcg}
  363. firstpass(t1);
  364. if registers32<t1.registers32 then
  365. registers32:=t1.registers32;
  366. if registersfpu<t1.registersfpu then
  367. registersfpu:=t1.registersfpu;
  368. {$ifdef SUPPORT_MMX}
  369. if registersmmx<t1.registersmmx then
  370. registersmmx:=t1.registersmmx;
  371. {$endif SUPPORT_MMX}
  372. end;
  373. { leave if we've got an error in one of the paths }
  374. if codegenerror then
  375. exit;
  376. if left.nodetype=ordconstn then
  377. begin
  378. { optimize }
  379. if tordconstnode(left).value=1 then
  380. begin
  381. hp:=right;
  382. right:=nil;
  383. { we cannot set p to nil !!! }
  384. if assigned(hp) then
  385. result:=hp
  386. else
  387. result:=cnothingnode.create;
  388. end
  389. else
  390. begin
  391. hp:=t1;
  392. t1:=nil;
  393. { we cannot set p to nil !!! }
  394. if assigned(hp) then
  395. result:=hp
  396. else
  397. result:=cnothingnode.create;
  398. end;
  399. end;
  400. t_times:=old_t_times;
  401. end;
  402. {*****************************************************************************
  403. TFORNODE
  404. *****************************************************************************}
  405. constructor tfornode.create(l,r,_t1,_t2 : tnode;back : boolean);
  406. begin
  407. inherited create(forn,l,r,_t1,_t2);
  408. if back then
  409. include(flags,nf_backward);
  410. end;
  411. function tfornode.det_resulttype:tnode;
  412. var
  413. hp : tnode;
  414. begin
  415. result:=nil;
  416. resulttype:=voidtype;
  417. if left.nodetype<>assignn then
  418. begin
  419. CGMessage(cg_e_illegal_expression);
  420. exit;
  421. end;
  422. { save counter var }
  423. t2:=tassignmentnode(left).left.getcopy;
  424. resulttypepass(left);
  425. set_varstate(left,false);
  426. if assigned(t1) then
  427. begin
  428. resulttypepass(t1);
  429. if codegenerror then
  430. exit;
  431. end;
  432. { process count var }
  433. resulttypepass(t2);
  434. set_varstate(t2,true);
  435. if codegenerror then
  436. exit;
  437. { Check count var, record fields are also allowed in tp7 }
  438. hp:=t2;
  439. while (hp.nodetype=subscriptn) or
  440. ((hp.nodetype=vecn) and
  441. is_constintnode(tvecnode(hp).right)) do
  442. hp:=tsubscriptnode(hp).left;
  443. { we need a simple loadn, but the load must be in a global symtable or
  444. in the same lexlevel }
  445. if (hp.nodetype=funcretn) or
  446. ((hp.nodetype=loadn) and
  447. ((tloadnode(hp).symtable.symtablelevel<=1) or
  448. (tloadnode(hp).symtable.symtablelevel=lexlevel))) then
  449. begin
  450. if (hp.nodetype=loadn) and
  451. (tloadnode(hp).symtableentry.typ=varsym) then
  452. tvarsym(tloadnode(hp).symtableentry).varstate:=vs_used;
  453. if (not(is_ordinal(t2.resulttype.def)) or is_64bitint(t2.resulttype.def)) then
  454. CGMessagePos(hp.fileinfo,type_e_ordinal_expr_expected);
  455. end
  456. else
  457. CGMessagePos(hp.fileinfo,cg_e_illegal_count_var);
  458. resulttypepass(right);
  459. set_varstate(right,true);
  460. if right.nodetype<>ordconstn then
  461. inserttypeconv(right,t2.resulttype);
  462. end;
  463. function tfornode.pass_1 : tnode;
  464. var
  465. old_t_times : longint;
  466. begin
  467. result:=nil;
  468. { Calc register weight }
  469. old_t_times:=t_times;
  470. if not(cs_littlesize in aktglobalswitches) then
  471. t_times:=t_times*8;
  472. {$ifdef newcg}
  473. tg.cleartempgen;
  474. {$else newcg}
  475. cleartempgen;
  476. {$endif newcg}
  477. firstpass(left);
  478. {$ifdef newcg}
  479. tg.cleartempgen;
  480. {$else newcg}
  481. cleartempgen;
  482. {$endif newcg}
  483. if assigned(t1) then
  484. begin
  485. firstpass(t1);
  486. if codegenerror then
  487. exit;
  488. end;
  489. registers32:=t1.registers32;
  490. registersfpu:=t1.registersfpu;
  491. {$ifdef SUPPORT_MMX}
  492. registersmmx:=left.registersmmx;
  493. {$endif SUPPORT_MMX}
  494. if left.registers32>registers32 then
  495. registers32:=left.registers32;
  496. if left.registersfpu>registersfpu then
  497. registersfpu:=left.registersfpu;
  498. {$ifdef SUPPORT_MMX}
  499. if left.registersmmx>registersmmx then
  500. registersmmx:=left.registersmmx;
  501. {$endif SUPPORT_MMX}
  502. { process count var }
  503. {$ifdef newcg}
  504. tg.cleartempgen;
  505. {$else newcg}
  506. cleartempgen;
  507. {$endif newcg}
  508. firstpass(t2);
  509. if codegenerror then
  510. exit;
  511. if t2.registers32>registers32 then
  512. registers32:=t2.registers32;
  513. if t2.registersfpu>registersfpu then
  514. registersfpu:=t2.registersfpu;
  515. {$ifdef SUPPORT_MMX}
  516. if t2.registersmmx>registersmmx then
  517. registersmmx:=t2.registersmmx;
  518. {$endif SUPPORT_MMX}
  519. {$ifdef newcg}
  520. tg.cleartempgen;
  521. {$else newcg}
  522. cleartempgen;
  523. {$endif newcg}
  524. firstpass(right);
  525. if right.registers32>registers32 then
  526. registers32:=right.registers32;
  527. if right.registersfpu>registersfpu then
  528. registersfpu:=right.registersfpu;
  529. {$ifdef SUPPORT_MMX}
  530. if right.registersmmx>registersmmx then
  531. registersmmx:=right.registersmmx;
  532. {$endif SUPPORT_MMX}
  533. { we need at least one register for comparisons PM }
  534. if registers32=0 then
  535. inc(registers32);
  536. t_times:=old_t_times;
  537. end;
  538. {*****************************************************************************
  539. TEXITNODE
  540. *****************************************************************************}
  541. constructor texitnode.create(l:tnode);
  542. begin
  543. inherited create(exitn,l);
  544. end;
  545. function texitnode.det_resulttype:tnode;
  546. var
  547. pt : tnode;
  548. begin
  549. result:=nil;
  550. { Check the 2 types }
  551. if not inlining_procedure then
  552. begin
  553. if assigned(left) then
  554. begin
  555. inserttypeconv(left,aktprocsym.definition.rettype);
  556. if ret_in_param(aktprocsym.definition.rettype.def) or
  557. (procinfo^.no_fast_exit) or
  558. ((procinfo^.flags and pi_uses_exceptions)<>0) then
  559. begin
  560. pt:=cfuncretnode.create(aktprocsym.definition.funcretsym);
  561. left:=cassignmentnode.create(pt,left);
  562. end;
  563. end;
  564. end;
  565. if assigned(left) then
  566. begin
  567. resulttypepass(left);
  568. set_varstate(left,true);
  569. end;
  570. resulttype:=voidtype;
  571. end;
  572. function texitnode.pass_1 : tnode;
  573. begin
  574. result:=nil;
  575. if assigned(left) then
  576. begin
  577. firstpass(left);
  578. if codegenerror then
  579. exit;
  580. registers32:=left.registers32;
  581. registersfpu:=left.registersfpu;
  582. {$ifdef SUPPORT_MMX}
  583. registersmmx:=left.registersmmx;
  584. {$endif SUPPORT_MMX}
  585. end;
  586. end;
  587. {*****************************************************************************
  588. TBREAKNODE
  589. *****************************************************************************}
  590. constructor tbreaknode.create;
  591. begin
  592. inherited create(breakn);
  593. end;
  594. function tbreaknode.det_resulttype:tnode;
  595. begin
  596. result:=nil;
  597. resulttype:=voidtype;
  598. end;
  599. function tbreaknode.pass_1 : tnode;
  600. begin
  601. result:=nil;
  602. end;
  603. {*****************************************************************************
  604. TCONTINUENODE
  605. *****************************************************************************}
  606. constructor tcontinuenode.create;
  607. begin
  608. inherited create(continuen);
  609. end;
  610. function tcontinuenode.det_resulttype:tnode;
  611. begin
  612. result:=nil;
  613. resulttype:=voidtype;
  614. end;
  615. function tcontinuenode.pass_1 : tnode;
  616. begin
  617. result:=nil;
  618. end;
  619. {*****************************************************************************
  620. TGOTONODE
  621. *****************************************************************************}
  622. constructor tgotonode.create(p : tlabelsym);
  623. begin
  624. inherited create(goton);
  625. if statement_level>1 then
  626. exceptionblock:=aktexceptblock
  627. else
  628. exceptionblock:=0;
  629. labsym:=p;
  630. labelnr:=p.lab;
  631. end;
  632. function tgotonode.det_resulttype:tnode;
  633. begin
  634. result:=nil;
  635. resulttype:=voidtype;
  636. end;
  637. function tgotonode.pass_1 : tnode;
  638. begin
  639. result:=nil;
  640. { check if }
  641. if assigned(labsym) and
  642. assigned(labsym.code) and
  643. (exceptionblock<>tlabelnode(labsym.code).exceptionblock) then
  644. CGMessage(cg_e_goto_inout_of_exception_block);
  645. end;
  646. function tgotonode.getcopy : tnode;
  647. var
  648. p : tgotonode;
  649. begin
  650. p:=tgotonode(inherited getcopy);
  651. p.labelnr:=labelnr;
  652. p.labsym:=labsym;
  653. p.exceptionblock:=exceptionblock;
  654. result:=p;
  655. end;
  656. function tgotonode.docompare(p: tnode): boolean;
  657. begin
  658. docompare := false;
  659. end;
  660. {*****************************************************************************
  661. TLABELNODE
  662. *****************************************************************************}
  663. constructor tlabelnode.createcase(p : tasmlabel;l:tnode);
  664. begin
  665. inherited create(labeln,l);
  666. { it shouldn't be possible to jump to case labels using goto }
  667. exceptionblock:=-1;
  668. labsym:=nil;
  669. labelnr:=p;
  670. end;
  671. constructor tlabelnode.create(p : tlabelsym;l:tnode);
  672. begin
  673. inherited create(labeln,l);
  674. if statement_level>1 then
  675. exceptionblock:=aktexceptblock
  676. else
  677. exceptionblock:=0;
  678. labsym:=p;
  679. labelnr:=p.lab;
  680. { save the current labelnode in the labelsym }
  681. p.code:=self;
  682. end;
  683. function tlabelnode.det_resulttype:tnode;
  684. begin
  685. result:=nil;
  686. { left could still be unassigned }
  687. if assigned(left) then
  688. resulttypepass(left);
  689. resulttype:=voidtype;
  690. end;
  691. function tlabelnode.pass_1 : tnode;
  692. begin
  693. result:=nil;
  694. if assigned(left) then
  695. begin
  696. {$ifdef newcg}
  697. tg.cleartempgen;
  698. {$else newcg}
  699. cleartempgen;
  700. {$endif newcg}
  701. firstpass(left);
  702. registers32:=left.registers32;
  703. registersfpu:=left.registersfpu;
  704. {$ifdef SUPPORT_MMX}
  705. registersmmx:=left.registersmmx;
  706. {$endif SUPPORT_MMX}
  707. end;
  708. end;
  709. function tlabelnode.getcopy : tnode;
  710. var
  711. p : tlabelnode;
  712. begin
  713. p:=tlabelnode(inherited getcopy);
  714. p.labelnr:=labelnr;
  715. p.exceptionblock:=exceptionblock;
  716. p.labsym:=labsym;
  717. result:=p;
  718. end;
  719. function tlabelnode.docompare(p: tnode): boolean;
  720. begin
  721. docompare := false;
  722. end;
  723. {*****************************************************************************
  724. TRAISENODE
  725. *****************************************************************************}
  726. constructor traisenode.create(l,taddr,tframe:tnode);
  727. begin
  728. inherited create(raisen,l,taddr);
  729. frametree:=tframe;
  730. end;
  731. function traisenode.getcopy : tnode;
  732. var
  733. n : traisenode;
  734. begin
  735. n:=traisenode(inherited getcopy);
  736. if assigned(frametree) then
  737. n.frametree:=frametree.getcopy
  738. else
  739. n.frametree:=nil;
  740. getcopy:=n;
  741. end;
  742. procedure traisenode.insertintolist(l : tnodelist);
  743. begin
  744. end;
  745. function traisenode.det_resulttype:tnode;
  746. begin
  747. result:=nil;
  748. resulttype:=voidtype;
  749. if assigned(left) then
  750. begin
  751. { first para must be a _class_ }
  752. resulttypepass(left);
  753. set_varstate(left,true);
  754. if codegenerror then
  755. exit;
  756. if not(is_class(left.resulttype.def)) then
  757. CGMessage(type_e_mismatch);
  758. { insert needed typeconvs for addr,frame }
  759. if assigned(right) then
  760. begin
  761. { addr }
  762. resulttypepass(right);
  763. inserttypeconv(right,s32bittype);
  764. { frame }
  765. if assigned(frametree) then
  766. begin
  767. resulttypepass(frametree);
  768. inserttypeconv(frametree,s32bittype);
  769. end;
  770. end;
  771. end;
  772. end;
  773. function traisenode.pass_1 : tnode;
  774. begin
  775. result:=nil;
  776. if assigned(left) then
  777. begin
  778. { first para must be a _class_ }
  779. firstpass(left);
  780. { insert needed typeconvs for addr,frame }
  781. if assigned(right) then
  782. begin
  783. { addr }
  784. firstpass(right);
  785. { frame }
  786. if assigned(frametree) then
  787. firstpass(frametree);
  788. end;
  789. left_right_max;
  790. end;
  791. end;
  792. function traisenode.docompare(p: tnode): boolean;
  793. begin
  794. docompare := false;
  795. end;
  796. {*****************************************************************************
  797. TTRYEXCEPTNODE
  798. *****************************************************************************}
  799. constructor ttryexceptnode.create(l,r,_t1 : tnode);
  800. begin
  801. inherited create(tryexceptn,l,r,_t1,nil);
  802. end;
  803. function ttryexceptnode.det_resulttype:tnode;
  804. begin
  805. result:=nil;
  806. resulttypepass(left);
  807. { on statements }
  808. if assigned(right) then
  809. resulttypepass(right);
  810. { else block }
  811. if assigned(t1) then
  812. resulttypepass(t1);
  813. resulttype:=voidtype;
  814. end;
  815. function ttryexceptnode.pass_1 : tnode;
  816. begin
  817. result:=nil;
  818. {$ifdef newcg}
  819. tg.cleartempgen;
  820. {$else newcg}
  821. cleartempgen;
  822. {$endif newcg}
  823. firstpass(left);
  824. { on statements }
  825. if assigned(right) then
  826. begin
  827. {$ifdef newcg}
  828. tg.cleartempgen;
  829. {$else newcg}
  830. cleartempgen;
  831. {$endif newcg}
  832. firstpass(right);
  833. registers32:=max(registers32,right.registers32);
  834. registersfpu:=max(registersfpu,right.registersfpu);
  835. {$ifdef SUPPORT_MMX}
  836. registersmmx:=max(registersmmx,right.registersmmx);
  837. {$endif SUPPORT_MMX}
  838. end;
  839. { else block }
  840. if assigned(t1) then
  841. begin
  842. firstpass(t1);
  843. registers32:=max(registers32,t1.registers32);
  844. registersfpu:=max(registersfpu,t1.registersfpu);
  845. {$ifdef SUPPORT_MMX}
  846. registersmmx:=max(registersmmx,t1.registersmmx);
  847. {$endif SUPPORT_MMX}
  848. end;
  849. end;
  850. {*****************************************************************************
  851. TTRYFINALLYNODE
  852. *****************************************************************************}
  853. constructor ttryfinallynode.create(l,r:tnode);
  854. begin
  855. inherited create(tryfinallyn,l,r);
  856. end;
  857. function ttryfinallynode.det_resulttype:tnode;
  858. begin
  859. result:=nil;
  860. resulttype:=voidtype;
  861. resulttypepass(left);
  862. set_varstate(left,true);
  863. resulttypepass(right);
  864. set_varstate(right,true);
  865. end;
  866. function ttryfinallynode.pass_1 : tnode;
  867. begin
  868. result:=nil;
  869. {$ifdef newcg}
  870. tg.cleartempgen;
  871. {$else newcg}
  872. cleartempgen;
  873. {$endif newcg}
  874. firstpass(left);
  875. {$ifdef newcg}
  876. tg.cleartempgen;
  877. {$else newcg}
  878. cleartempgen;
  879. {$endif newcg}
  880. firstpass(right);
  881. left_right_max;
  882. end;
  883. {*****************************************************************************
  884. TONNODE
  885. *****************************************************************************}
  886. constructor tonnode.create(l,r:tnode);
  887. begin
  888. inherited create(onn,l,r);
  889. exceptsymtable:=nil;
  890. excepttype:=nil;
  891. end;
  892. destructor tonnode.destroy;
  893. begin
  894. if assigned(exceptsymtable) then
  895. exceptsymtable.free;
  896. inherited destroy;
  897. end;
  898. function tonnode.getcopy : tnode;
  899. var
  900. n : tonnode;
  901. begin
  902. n:=tonnode(inherited getcopy);
  903. n.exceptsymtable:=exceptsymtable;
  904. n.excepttype:=excepttype;
  905. result:=n;
  906. end;
  907. function tonnode.det_resulttype:tnode;
  908. begin
  909. result:=nil;
  910. resulttype:=voidtype;
  911. if not(is_class(excepttype)) then
  912. CGMessage(type_e_mismatch);
  913. if assigned(left) then
  914. resulttypepass(left);
  915. if assigned(right) then
  916. resulttypepass(right);
  917. end;
  918. function tonnode.pass_1 : tnode;
  919. begin
  920. result:=nil;
  921. {$ifdef newcg}
  922. tg.cleartempgen;
  923. {$else newcg}
  924. cleartempgen;
  925. {$endif newcg}
  926. registers32:=0;
  927. registersfpu:=0;
  928. {$ifdef SUPPORT_MMX}
  929. registersmmx:=0;
  930. {$endif SUPPORT_MMX}
  931. if assigned(left) then
  932. begin
  933. firstpass(left);
  934. registers32:=left.registers32;
  935. registersfpu:=left.registersfpu;
  936. {$ifdef SUPPORT_MMX}
  937. registersmmx:=left.registersmmx;
  938. {$endif SUPPORT_MMX}
  939. end;
  940. {$ifdef newcg}
  941. tg.cleartempgen;
  942. {$else newcg}
  943. cleartempgen;
  944. {$endif newcg}
  945. if assigned(right) then
  946. begin
  947. firstpass(right);
  948. registers32:=max(registers32,right.registers32);
  949. registersfpu:=max(registersfpu,right.registersfpu);
  950. {$ifdef SUPPORT_MMX}
  951. registersmmx:=max(registersmmx,right.registersmmx);
  952. {$endif SUPPORT_MMX}
  953. end;
  954. end;
  955. function tonnode.docompare(p: tnode): boolean;
  956. begin
  957. docompare := false;
  958. end;
  959. {*****************************************************************************
  960. TFAILNODE
  961. *****************************************************************************}
  962. constructor tfailnode.create;
  963. begin
  964. inherited create(failn);
  965. end;
  966. function tfailnode.det_resulttype:tnode;
  967. begin
  968. result:=nil;
  969. resulttype:=voidtype;
  970. end;
  971. function tfailnode.pass_1 : tnode;
  972. begin
  973. result:=nil;
  974. end;
  975. function tfailnode.docompare(p: tnode): boolean;
  976. begin
  977. docompare := false;
  978. end;
  979. begin
  980. cwhilerepeatnode:=twhilerepeatnode;
  981. cifnode:=tifnode;
  982. cfornode:=tfornode;
  983. cexitnode:=texitnode;
  984. cgotonode:=tgotonode;
  985. clabelnode:=tlabelnode;
  986. craisenode:=traisenode;
  987. ctryexceptnode:=ttryexceptnode;
  988. ctryfinallynode:=ttryfinallynode;
  989. connode:=tonnode;
  990. cfailnode:=tfailnode;
  991. end.
  992. {
  993. $Log$
  994. Revision 1.24 2001-09-02 21:12:07 peter
  995. * move class of definitions into type section for delphi
  996. Revision 1.23 2001/08/30 20:56:38 peter
  997. * exit() with exceptions fix
  998. Revision 1.22 2001/08/26 13:36:40 florian
  999. * some cg reorganisation
  1000. * some PPC updates
  1001. Revision 1.21 2001/08/06 21:40:47 peter
  1002. * funcret moved from tprocinfo to tprocdef
  1003. Revision 1.20 2001/04/26 21:56:08 peter
  1004. * moved some code from exitnode.create to det_resulttype
  1005. Revision 1.19 2001/04/21 15:36:29 peter
  1006. * fixed crash with for counter
  1007. Revision 1.18 2001/04/15 09:48:30 peter
  1008. * fixed crash in labelnode
  1009. * easier detection of goto and label in try blocks
  1010. Revision 1.17 2001/04/14 14:07:10 peter
  1011. * moved more code from pass_1 to det_resulttype
  1012. Revision 1.16 2001/04/13 01:22:09 peter
  1013. * symtable change to classes
  1014. * range check generation and errors fixed, make cycle DEBUG=1 works
  1015. * memory leaks fixed
  1016. Revision 1.15 2001/04/02 21:20:30 peter
  1017. * resulttype rewrite
  1018. Revision 1.14 2001/03/25 12:27:59 peter
  1019. * set funcret to assigned (merged)
  1020. Revision 1.13 2001/02/26 19:44:53 peter
  1021. * merged generic m68k updates from fixes branch
  1022. Revision 1.12 2000/12/31 11:14:10 jonas
  1023. + implemented/fixed docompare() mathods for all nodes (not tested)
  1024. + nopt.pas, nadd.pas, i386/n386opt.pas: optimized nodes for adding strings
  1025. and constant strings/chars together
  1026. * n386add.pas: don't copy temp strings (of size 256) to another temp string
  1027. when adding
  1028. Revision 1.11 2000/11/29 00:30:33 florian
  1029. * unused units removed from uses clause
  1030. * some changes for widestrings
  1031. Revision 1.10 2000/11/04 14:25:20 florian
  1032. + merged Attila's changes for interfaces, not tested yet
  1033. Revision 1.9 2000/10/31 22:02:48 peter
  1034. * symtable splitted, no real code changes
  1035. Revision 1.8 2000/10/21 18:16:11 florian
  1036. * a lot of changes:
  1037. - basic dyn. array support
  1038. - basic C++ support
  1039. - some work for interfaces done
  1040. ....
  1041. Revision 1.7 2000/10/14 21:52:55 peter
  1042. * fixed memory leaks
  1043. Revision 1.6 2000/10/14 10:14:50 peter
  1044. * moehrendorf oct 2000 rewrite
  1045. Revision 1.5 2000/10/01 19:48:24 peter
  1046. * lot of compile updates for cg11
  1047. Revision 1.4 2000/09/28 19:49:52 florian
  1048. *** empty log message ***
  1049. Revision 1.3 2000/09/24 21:15:34 florian
  1050. * some errors fix to get more stuff compilable
  1051. Revision 1.2 2000/09/24 15:06:19 peter
  1052. * use defines.inc
  1053. Revision 1.1 2000/09/22 22:46:03 florian
  1054. + initial revision
  1055. }