nflw.pas 31 KB

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