pstatmnt.pas 44 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817818819820821822823824825826827828829830831832833834835836837838839840841842843844845846847848849850851852853854855856857858859860861862863864865866867868869870871872873874875876877878879880881882883884885886887888889890891892893894895896897898899900901902903904905906907908909910911912913914915916917918919920921922923924925926927928929930931932933934935936937938939940941942943944945946947948949950951952953954955956957958959960961962963964965966967968969970971972973974975976977978979980981982983984985986987988989990991992993994995996997998999100010011002100310041005100610071008100910101011101210131014101510161017101810191020102110221023102410251026102710281029103010311032103310341035103610371038103910401041104210431044104510461047104810491050105110521053105410551056105710581059106010611062106310641065106610671068106910701071107210731074107510761077107810791080108110821083108410851086108710881089109010911092109310941095109610971098109911001101110211031104110511061107110811091110111111121113111411151116111711181119112011211122112311241125112611271128112911301131113211331134113511361137113811391140114111421143114411451146114711481149115011511152115311541155115611571158115911601161116211631164116511661167116811691170117111721173117411751176117711781179118011811182118311841185118611871188118911901191119211931194119511961197119811991200120112021203120412051206120712081209121012111212121312141215121612171218121912201221122212231224122512261227122812291230123112321233123412351236123712381239124012411242124312441245124612471248124912501251125212531254125512561257125812591260126112621263126412651266126712681269127012711272127312741275127612771278127912801281128212831284128512861287128812891290129112921293129412951296129712981299130013011302130313041305130613071308
  1. {
  2. $Id$
  3. Copyright (c) 1998-2000 by Florian Klaempfl
  4. Does the parsing of the statements
  5. This program is free software; you can redistribute it and/or modify
  6. it under the terms of the GNU General Public License as published by
  7. the Free Software Foundation; either version 2 of the License, or
  8. (at your option) any later version.
  9. This program is distributed in the hope that it will be useful,
  10. but WITHOUT ANY WARRANTY; without even the implied warranty of
  11. MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
  12. GNU General Public License for more details.
  13. You should have received a copy of the GNU General Public License
  14. along with this program; if not, write to the Free Software
  15. Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
  16. ****************************************************************************
  17. }
  18. unit pstatmnt;
  19. {$i defines.inc}
  20. interface
  21. uses
  22. tokens,node;
  23. function statement_block(starttoken : ttoken) : tnode;
  24. { reads an assembler block }
  25. function assembler_block : tnode;
  26. implementation
  27. uses
  28. { common }
  29. cutils,
  30. { global }
  31. globtype,globals,verbose,
  32. systems,cpuinfo,
  33. { aasm }
  34. cpubase,aasm,
  35. { symtable }
  36. symconst,symbase,symtype,symdef,symsym,symtable,types,
  37. { pass 1 }
  38. pass_1,htypechk,
  39. nbas,nmat,nadd,ncal,nmem,nset,ncnv,ninl,ncon,nld,nflw,
  40. { parser }
  41. scanner,
  42. pbase,pexpr,
  43. { codegen }
  44. tgcpu,hcodegen
  45. {$ifdef i386}
  46. {$ifndef NoRa386Int}
  47. ,ra386int
  48. {$endif NoRa386Int}
  49. {$ifndef NoRa386Att}
  50. ,ra386att
  51. {$endif NoRa386Att}
  52. {$ifndef NoRa386Dir}
  53. ,ra386dir
  54. {$endif NoRa386Dir}
  55. {$endif i386}
  56. {$ifdef m68k}
  57. {$ifndef NoRa68kMot}
  58. ,ra68kmot
  59. {$endif NoRa68kMot}
  60. {$endif m68k}
  61. { codegen }
  62. {$ifdef newcg}
  63. ,cgbase
  64. {$endif newcg}
  65. ;
  66. function statement : tnode;forward;
  67. function if_statement : tnode;
  68. var
  69. ex,if_a,else_a : tnode;
  70. begin
  71. consume(_IF);
  72. ex:=comp_expr(true);
  73. consume(_THEN);
  74. if token<>_ELSE then
  75. if_a:=statement
  76. else
  77. if_a:=nil;
  78. if try_to_consume(_ELSE) then
  79. else_a:=statement
  80. else
  81. else_a:=nil;
  82. if_statement:=genloopnode(ifn,ex,if_a,else_a,false);
  83. end;
  84. { creates a block (list) of statements, til the next END token }
  85. function statements_til_end : tnode;
  86. var
  87. first,last : tstatementnode;
  88. begin
  89. first:=nil;
  90. while token<>_END do
  91. begin
  92. if first=nil then
  93. begin
  94. last:=cstatementnode.create(nil,statement);
  95. first:=last;
  96. end
  97. else
  98. begin
  99. last.left:=cstatementnode.create(nil,statement);
  100. last:=tstatementnode(last.left);
  101. end;
  102. if not try_to_consume(_SEMICOLON) then
  103. break;
  104. emptystats;
  105. end;
  106. consume(_END);
  107. statements_til_end:=cblocknode.create(first);
  108. end;
  109. function case_statement : tnode;
  110. var
  111. { contains the label number of currently parsed case block }
  112. aktcaselabel : tasmlabel;
  113. firstlabel : boolean;
  114. root : pcaserecord;
  115. { the typ of the case expression }
  116. casedef : tdef;
  117. procedure newcaselabel(l,h : TConstExprInt;first:boolean);
  118. var
  119. hcaselabel : pcaserecord;
  120. procedure insertlabel(var p : pcaserecord);
  121. begin
  122. if p=nil then p:=hcaselabel
  123. else
  124. if (p^._low>hcaselabel^._low) and
  125. (p^._low>hcaselabel^._high) then
  126. if (hcaselabel^.statement = p^.statement) and
  127. (p^._low = hcaselabel^._high + 1) then
  128. begin
  129. p^._low := hcaselabel^._low;
  130. dispose(hcaselabel);
  131. end
  132. else
  133. insertlabel(p^.less)
  134. else
  135. if (p^._high<hcaselabel^._low) and
  136. (p^._high<hcaselabel^._high) then
  137. if (hcaselabel^.statement = p^.statement) and
  138. (p^._high+1 = hcaselabel^._low) then
  139. begin
  140. p^._high := hcaselabel^._high;
  141. dispose(hcaselabel);
  142. end
  143. else
  144. insertlabel(p^.greater)
  145. else Message(parser_e_double_caselabel);
  146. end;
  147. begin
  148. new(hcaselabel);
  149. hcaselabel^.less:=nil;
  150. hcaselabel^.greater:=nil;
  151. hcaselabel^.statement:=aktcaselabel;
  152. hcaselabel^.firstlabel:=first;
  153. getlabel(hcaselabel^._at);
  154. hcaselabel^._low:=l;
  155. hcaselabel^._high:=h;
  156. insertlabel(root);
  157. end;
  158. var
  159. code,caseexpr,p,instruc,elseblock : tnode;
  160. hl1,hl2 : TConstExprInt;
  161. casedeferror : boolean;
  162. begin
  163. consume(_CASE);
  164. caseexpr:=comp_expr(true);
  165. { determines result type }
  166. cleartempgen;
  167. do_resulttypepass(caseexpr);
  168. casedeferror:=false;
  169. casedef:=caseexpr.resulttype.def;
  170. if (not assigned(casedef)) or
  171. not(is_ordinal(casedef)) then
  172. begin
  173. CGMessage(type_e_ordinal_expr_expected);
  174. { create a correct tree }
  175. caseexpr.free;
  176. caseexpr:=cordconstnode.create(0,u32bittype);
  177. { set error flag so no rangechecks are done }
  178. casedeferror:=true;
  179. end;
  180. consume(_OF);
  181. inc(statement_level);
  182. root:=nil;
  183. instruc:=nil;
  184. repeat
  185. getlabel(aktcaselabel);
  186. firstlabel:=true;
  187. { may be an instruction has more case labels }
  188. repeat
  189. p:=expr;
  190. hl1:=0;
  191. hl2:=0;
  192. if (p.nodetype=rangen) then
  193. begin
  194. { type checking for case statements }
  195. if is_subequal(casedef, trangenode(p).left.resulttype.def) and
  196. is_subequal(casedef, trangenode(p).right.resulttype.def) then
  197. begin
  198. hl1:=get_ordinal_value(trangenode(p).left);
  199. hl2:=get_ordinal_value(trangenode(p).right);
  200. if hl1>hl2 then
  201. CGMessage(parser_e_case_lower_less_than_upper_bound);
  202. if not casedeferror then
  203. begin
  204. testrange(casedef,hl1,false);
  205. testrange(casedef,hl2,false);
  206. end;
  207. end
  208. else
  209. CGMessage(parser_e_case_mismatch);
  210. newcaselabel(hl1,hl2,firstlabel);
  211. end
  212. else
  213. begin
  214. { type checking for case statements }
  215. if not is_subequal(casedef, p.resulttype.def) then
  216. CGMessage(parser_e_case_mismatch);
  217. hl1:=get_ordinal_value(p);
  218. if not casedeferror then
  219. testrange(casedef,hl1,false);
  220. newcaselabel(hl1,hl1,firstlabel);
  221. end;
  222. p.free;
  223. if token=_COMMA then
  224. consume(_COMMA)
  225. else
  226. break;
  227. firstlabel:=false;
  228. until false;
  229. consume(_COLON);
  230. { handles instruction block }
  231. p:=clabelnode.createcase(aktcaselabel,statement);
  232. { concats instruction }
  233. instruc:=cstatementnode.create(instruc,p);
  234. if not((token=_ELSE) or (token=_OTHERWISE) or (token=_END)) then
  235. consume(_SEMICOLON);
  236. until (token=_ELSE) or (token=_OTHERWISE) or (token=_END);
  237. if (token=_ELSE) or (token=_OTHERWISE) then
  238. begin
  239. if not try_to_consume(_ELSE) then
  240. consume(_OTHERWISE);
  241. elseblock:=statements_til_end;
  242. end
  243. else
  244. begin
  245. elseblock:=nil;
  246. consume(_END);
  247. end;
  248. dec(statement_level);
  249. code:=ccasenode.create(caseexpr,instruc,root);
  250. tcasenode(code).elseblock:=elseblock;
  251. case_statement:=code;
  252. end;
  253. function repeat_statement : tnode;
  254. var
  255. first,last,p_e : tnode;
  256. begin
  257. consume(_REPEAT);
  258. first:=nil;
  259. inc(statement_level);
  260. while token<>_UNTIL do
  261. begin
  262. if first=nil then
  263. begin
  264. last:=cstatementnode.create(nil,statement);
  265. first:=last;
  266. end
  267. else
  268. begin
  269. tstatementnode(last).left:=cstatementnode.create(nil,statement);
  270. last:=tstatementnode(last).left;
  271. end;
  272. if not try_to_consume(_SEMICOLON) then
  273. break;
  274. emptystats;
  275. end;
  276. consume(_UNTIL);
  277. dec(statement_level);
  278. first:=cblocknode.create(first);
  279. p_e:=comp_expr(true);
  280. repeat_statement:=genloopnode(repeatn,p_e,first,nil,false);
  281. end;
  282. function while_statement : tnode;
  283. var
  284. p_e,p_a : tnode;
  285. begin
  286. consume(_WHILE);
  287. p_e:=comp_expr(true);
  288. consume(_DO);
  289. p_a:=statement;
  290. while_statement:=genloopnode(whilen,p_e,p_a,nil,false);
  291. end;
  292. function for_statement : tnode;
  293. var
  294. p_e,tovalue,p_a : tnode;
  295. backward : boolean;
  296. begin
  297. { parse loop header }
  298. consume(_FOR);
  299. p_e:=expr;
  300. if token=_DOWNTO then
  301. begin
  302. consume(_DOWNTO);
  303. backward:=true;
  304. end
  305. else
  306. begin
  307. consume(_TO);
  308. backward:=false;
  309. end;
  310. tovalue:=comp_expr(true);
  311. consume(_DO);
  312. { ... now the instruction }
  313. p_a:=statement;
  314. for_statement:=genloopnode(forn,p_e,tovalue,p_a,backward);
  315. end;
  316. function _with_statement : tnode;
  317. var
  318. right,p : tnode;
  319. i,levelcount : longint;
  320. withsymtable,symtab : tsymtable;
  321. obj : tobjectdef;
  322. hp : tnode;
  323. begin
  324. p:=comp_expr(true);
  325. do_resulttypepass(p);
  326. set_varstate(p,false);
  327. right:=nil;
  328. if (not codegenerror) and
  329. (p.resulttype.def.deftype in [objectdef,recorddef]) then
  330. begin
  331. case p.resulttype.def.deftype of
  332. objectdef : begin
  333. obj:=tobjectdef(p.resulttype.def);
  334. symtab:=twithsymtable.Create(obj,obj.symtable.symsearch);
  335. withsymtable:=symtab;
  336. if (p.nodetype=loadn) and
  337. (tloadnode(p).symtable=aktprocsym.definition.localst) then
  338. twithsymtable(symtab).direct_with:=true;
  339. twithsymtable(symtab).withrefnode:=p;
  340. levelcount:=1;
  341. obj:=obj.childof;
  342. while assigned(obj) do
  343. begin
  344. symtab.next:=twithsymtable.create(obj,obj.symtable.symsearch);
  345. symtab:=symtab.next;
  346. if (p.nodetype=loadn) and
  347. (tloadnode(p).symtable=aktprocsym.definition.localst) then
  348. twithsymtable(symtab).direct_with:=true;
  349. twithsymtable(symtab).withrefnode:=p;
  350. obj:=obj.childof;
  351. inc(levelcount);
  352. end;
  353. symtab.next:=symtablestack;
  354. symtablestack:=withsymtable;
  355. end;
  356. recorddef : begin
  357. symtab:=trecorddef(p.resulttype.def).symtable;
  358. levelcount:=1;
  359. withsymtable:=twithsymtable.create(trecorddef(p.resulttype.def),symtab.symsearch);
  360. if (p.nodetype=loadn) and
  361. (tloadnode(p).symtable=aktprocsym.definition.localst) then
  362. twithsymtable(withsymtable).direct_with:=true;
  363. twithsymtable(withsymtable).withrefnode:=p;
  364. withsymtable.next:=symtablestack;
  365. symtablestack:=withsymtable;
  366. end;
  367. end;
  368. if token=_COMMA then
  369. begin
  370. consume(_COMMA);
  371. right:=_with_statement{$ifdef FPCPROCVAR}(){$endif};
  372. end
  373. else
  374. begin
  375. consume(_DO);
  376. if token<>_SEMICOLON then
  377. right:=statement
  378. else
  379. right:=nil;
  380. end;
  381. for i:=1 to levelcount do
  382. symtablestack:=symtablestack.next;
  383. _with_statement:=cwithnode.create(twithsymtable(withsymtable),p,right,levelcount);
  384. end
  385. else
  386. begin
  387. Message(parser_e_false_with_expr);
  388. { try to recover from error }
  389. if token=_COMMA then
  390. begin
  391. consume(_COMMA);
  392. hp:=_with_statement{$ifdef FPCPROCVAR}(){$endif};
  393. if (hp=nil) then; { remove warning about unused }
  394. end
  395. else
  396. begin
  397. consume(_DO);
  398. { ignore all }
  399. if token<>_SEMICOLON then
  400. statement;
  401. end;
  402. _with_statement:=nil;
  403. end;
  404. end;
  405. function with_statement : tnode;
  406. begin
  407. consume(_WITH);
  408. with_statement:=_with_statement;
  409. end;
  410. function raise_statement : tnode;
  411. var
  412. p,pobj,paddr,pframe : tnode;
  413. begin
  414. pobj:=nil;
  415. paddr:=nil;
  416. pframe:=nil;
  417. consume(_RAISE);
  418. if not(token in [_SEMICOLON,_END]) then
  419. begin
  420. { object }
  421. pobj:=comp_expr(true);
  422. if try_to_consume(_AT) then
  423. begin
  424. paddr:=comp_expr(true);
  425. if try_to_consume(_COMMA) then
  426. pframe:=comp_expr(true);
  427. end;
  428. end
  429. else
  430. begin
  431. if (block_type<>bt_except) then
  432. Message(parser_e_no_reraise_possible);
  433. end;
  434. p:=craisenode.create(pobj,paddr,pframe);
  435. raise_statement:=p;
  436. end;
  437. function try_statement : tnode;
  438. var
  439. p_try_block,p_finally_block,first,last,
  440. p_default,p_specific,hp : tnode;
  441. ot : ttype;
  442. sym : tvarsym;
  443. old_block_type : tblock_type;
  444. exceptsymtable : tsymtable;
  445. objname,objrealname : stringid;
  446. srsym : tsym;
  447. srsymtable : tsymtable;
  448. begin
  449. procinfo^.flags:=procinfo^.flags or pi_uses_exceptions;
  450. p_default:=nil;
  451. p_specific:=nil;
  452. { read statements to try }
  453. consume(_TRY);
  454. first:=nil;
  455. inc(aktexceptblock);
  456. inc(statement_level);
  457. while (token<>_FINALLY) and (token<>_EXCEPT) do
  458. begin
  459. if first=nil then
  460. begin
  461. last:=cstatementnode.create(nil,statement);
  462. first:=last;
  463. end
  464. else
  465. begin
  466. tstatementnode(last).left:=cstatementnode.create(nil,statement);
  467. last:=tstatementnode(last).left;
  468. end;
  469. if not try_to_consume(_SEMICOLON) then
  470. break;
  471. emptystats;
  472. end;
  473. p_try_block:=cblocknode.create(first);
  474. if try_to_consume(_FINALLY) then
  475. begin
  476. inc(aktexceptblock);
  477. p_finally_block:=statements_til_end;
  478. try_statement:=ctryfinallynode.create(p_try_block,p_finally_block);
  479. dec(statement_level);
  480. end
  481. else
  482. begin
  483. consume(_EXCEPT);
  484. old_block_type:=block_type;
  485. block_type:=bt_except;
  486. inc(aktexceptblock);
  487. ot:=generrortype;
  488. p_specific:=nil;
  489. if (idtoken=_ON) then
  490. { catch specific exceptions }
  491. begin
  492. repeat
  493. consume(_ID);
  494. if token=_ID then
  495. begin
  496. objname:=pattern;
  497. objrealname:=orgpattern;
  498. { can't use consume_sym here, because we need already
  499. to check for the colon }
  500. searchsym(objname,srsym,srsymtable);
  501. consume(_ID);
  502. { is a explicit name for the exception given ? }
  503. if try_to_consume(_COLON) then
  504. begin
  505. consume_sym(srsym,srsymtable);
  506. if (srsym.typ=typesym) and
  507. is_class(ttypesym(srsym).restype.def) then
  508. begin
  509. ot:=ttypesym(srsym).restype;
  510. sym:=tvarsym.create(objrealname,ot);
  511. end
  512. else
  513. begin
  514. sym:=tvarsym.create(objrealname,generrortype);
  515. if (srsym.typ=typesym) then
  516. Message1(type_e_class_type_expected,ttypesym(srsym).restype.def.typename)
  517. else
  518. Message1(type_e_class_type_expected,ot.def.typename);
  519. end;
  520. exceptsymtable:=tstt_exceptsymtable.create;
  521. exceptsymtable.insert(sym);
  522. { insert the exception symtable stack }
  523. exceptsymtable.next:=symtablestack;
  524. symtablestack:=exceptsymtable;
  525. end
  526. else
  527. begin
  528. { check if type is valid, must be done here because
  529. with "e: Exception" the e is not necessary }
  530. if srsym=nil then
  531. begin
  532. identifier_not_found(objrealname);
  533. srsym:=generrorsym;
  534. end;
  535. { support unit.identifier }
  536. if srsym.typ=unitsym then
  537. begin
  538. consume(_POINT);
  539. srsym:=searchsymonlyin(tunitsym(srsym).unitsymtable,pattern);
  540. if srsym=nil then
  541. begin
  542. identifier_not_found(orgpattern);
  543. srsym:=generrorsym;
  544. end;
  545. consume(_ID);
  546. end;
  547. { check if type is valid, must be done here because
  548. with "e: Exception" the e is not necessary }
  549. if (srsym.typ=typesym) and
  550. is_class(ttypesym(srsym).restype.def) then
  551. ot:=ttypesym(srsym).restype
  552. else
  553. begin
  554. ot:=generrortype;
  555. if (srsym.typ=typesym) then
  556. Message1(type_e_class_type_expected,ttypesym(srsym).restype.def.typename)
  557. else
  558. Message1(type_e_class_type_expected,ot.def.typename);
  559. end;
  560. exceptsymtable:=nil;
  561. end;
  562. end
  563. else
  564. consume(_ID);
  565. consume(_DO);
  566. hp:=connode.create(nil,statement);
  567. if ot.def.deftype=errordef then
  568. begin
  569. hp.free;
  570. hp:=cerrornode.create;
  571. end;
  572. if p_specific=nil then
  573. begin
  574. last:=hp;
  575. p_specific:=last;
  576. end
  577. else
  578. begin
  579. tonnode(last).left:=hp;
  580. last:=tonnode(last).left;
  581. end;
  582. { set the informations }
  583. { only if the creation of the onnode was succesful, it's possible }
  584. { that last and hp are errornodes (JM) }
  585. if last.nodetype = onn then
  586. begin
  587. tonnode(last).excepttype:=tobjectdef(ot.def);
  588. tonnode(last).exceptsymtable:=exceptsymtable;
  589. end;
  590. { remove exception symtable }
  591. if assigned(exceptsymtable) then
  592. begin
  593. dellexlevel;
  594. if last.nodetype <> onn then
  595. exceptsymtable.free;
  596. end;
  597. if not try_to_consume(_SEMICOLON) then
  598. break;
  599. emptystats;
  600. until (token=_END) or (token=_ELSE);
  601. if token=_ELSE then
  602. { catch the other exceptions }
  603. begin
  604. consume(_ELSE);
  605. p_default:=statements_til_end;
  606. end
  607. else
  608. consume(_END);
  609. end
  610. else
  611. { catch all exceptions }
  612. begin
  613. p_default:=statements_til_end;
  614. end;
  615. dec(statement_level);
  616. block_type:=old_block_type;
  617. try_statement:=ctryexceptnode.create(p_try_block,p_specific,p_default);
  618. end;
  619. end;
  620. function exit_statement : tnode;
  621. var
  622. p : tnode;
  623. begin
  624. consume(_EXIT);
  625. if try_to_consume(_LKLAMMER) then
  626. begin
  627. p:=comp_expr(true);
  628. consume(_RKLAMMER);
  629. if (block_type=bt_except) then
  630. Message(parser_e_exit_with_argument_not__possible);
  631. if is_void(procinfo^.returntype.def) then
  632. Message(parser_e_void_function);
  633. end
  634. else
  635. p:=nil;
  636. p:=cexitnode.create(p);
  637. p.resulttype:=voidtype;
  638. exit_statement:=p;
  639. end;
  640. function _asm_statement : tnode;
  641. var
  642. asmstat : tasmnode;
  643. Marker : tai;
  644. begin
  645. Inside_asm_statement:=true;
  646. case aktasmmode of
  647. asmmode_none : ; { just be there to allow to a compile without
  648. any assembler readers }
  649. {$ifdef i386}
  650. {$ifndef NoRA386Att}
  651. asmmode_i386_att:
  652. asmstat:=tasmnode(ra386att.assemble);
  653. {$endif NoRA386Att}
  654. {$ifndef NoRA386Int}
  655. asmmode_i386_intel:
  656. asmstat:=tasmnode(ra386int.assemble);
  657. {$endif NoRA386Int}
  658. {$ifndef NoRA386Dir}
  659. asmmode_i386_direct:
  660. begin
  661. if not target_asm.allowdirect then
  662. Message(parser_f_direct_assembler_not_allowed);
  663. if (pocall_inline in aktprocsym.definition.proccalloptions) then
  664. Begin
  665. Message1(parser_w_not_supported_for_inline,'direct asm');
  666. Message(parser_w_inlining_disabled);
  667. exclude(aktprocsym.definition.proccalloptions,pocall_inline);
  668. End;
  669. asmstat:=tasmnode(ra386dir.assemble);
  670. end;
  671. {$endif NoRA386Dir}
  672. {$endif}
  673. {$ifdef m68k}
  674. {$ifndef NoRA68kMot}
  675. asmmode_m68k_mot:
  676. asmstat:=tasmnode(ra68kmot.assemble);
  677. {$endif NoRA68kMot}
  678. {$endif}
  679. else
  680. Message(parser_f_assembler_reader_not_supported);
  681. end;
  682. { Read first the _ASM statement }
  683. consume(_ASM);
  684. {$ifndef newcg}
  685. { END is read }
  686. if try_to_consume(_LECKKLAMMER) then
  687. begin
  688. { it's possible to specify the modified registers }
  689. include(asmstat.flags,nf_object_preserved);
  690. if token<>_RECKKLAMMER then
  691. repeat
  692. { uppercase, because it's a CSTRING }
  693. uppervar(pattern);
  694. {$ifdef i386}
  695. if pattern='EAX' then
  696. usedinproc:=usedinproc or ($80 shr byte(R_EAX))
  697. else if pattern='EBX' then
  698. usedinproc:=usedinproc or ($80 shr byte(R_EBX))
  699. else if pattern='ECX' then
  700. usedinproc:=usedinproc or ($80 shr byte(R_ECX))
  701. else if pattern='EDX' then
  702. usedinproc:=usedinproc or ($80 shr byte(R_EDX))
  703. else if pattern='ESI' then
  704. begin
  705. usedinproc:=usedinproc or ($80 shr byte(R_ESI));
  706. exclude(asmstat.flags,nf_object_preserved);
  707. end
  708. else if pattern='EDI' then
  709. usedinproc:=usedinproc or ($80 shr byte(R_EDI))
  710. {$endif i386}
  711. {$ifdef m68k}
  712. if pattern='D0' then
  713. usedinproc:=usedinproc or ($800 shr word(R_D0))
  714. else if pattern='D1' then
  715. usedinproc:=usedinproc or ($800 shr word(R_D1))
  716. else if pattern='D6' then
  717. usedinproc:=usedinproc or ($800 shr word(R_D6))
  718. else if pattern='A0' then
  719. usedinproc:=usedinproc or ($800 shr word(R_A0))
  720. else if pattern='A1' then
  721. usedinproc:=usedinproc or ($800 shr word(R_A1))
  722. {$endif m68k}
  723. else consume(_RECKKLAMMER);
  724. consume(_CSTRING);
  725. if not try_to_consume(_COMMA) then
  726. break;
  727. until false;
  728. consume(_RECKKLAMMER);
  729. end
  730. else usedinproc:=$ff;
  731. {$endif newcg}
  732. { mark the start and the end of the assembler block
  733. this is needed for the optimizer }
  734. If Assigned(AsmStat.p_asm) Then
  735. Begin
  736. Marker := Tai_Marker.Create(AsmBlockStart);
  737. AsmStat.p_asm.Insert(Marker);
  738. Marker := Tai_Marker.Create(AsmBlockEnd);
  739. AsmStat.p_asm.Concat(Marker);
  740. End;
  741. Inside_asm_statement:=false;
  742. _asm_statement:=asmstat;
  743. end;
  744. function new_dispose_statement : tnode;
  745. var
  746. p,p2 : tnode;
  747. again : boolean; { dummy for do_proc_call }
  748. destructorname : stringid;
  749. sym : tsym;
  750. classh : tobjectdef;
  751. destructorpos,
  752. storepos : tfileposinfo;
  753. is_new : boolean;
  754. begin
  755. if try_to_consume(_NEW) then
  756. is_new:=true
  757. else
  758. begin
  759. consume(_DISPOSE);
  760. is_new:=false;
  761. end;
  762. consume(_LKLAMMER);
  763. p:=comp_expr(true);
  764. { calc return type }
  765. cleartempgen;
  766. set_varstate(p,(not is_new));
  767. { constructor,destructor specified }
  768. if try_to_consume(_COMMA) then
  769. begin
  770. { extended syntax of new and dispose }
  771. { function styled new is handled in factor }
  772. { destructors have no parameters }
  773. destructorname:=pattern;
  774. destructorpos:=akttokenpos;
  775. consume(_ID);
  776. if (p.resulttype.def.deftype<>pointerdef) then
  777. begin
  778. Message1(type_e_pointer_type_expected,p.resulttype.def.typename);
  779. p.free;
  780. p:=factor(false);
  781. p.free;
  782. consume(_RKLAMMER);
  783. new_dispose_statement:=cerrornode.create;
  784. exit;
  785. end;
  786. { first parameter must be an object or class }
  787. if tpointerdef(p.resulttype.def).pointertype.def.deftype<>objectdef then
  788. begin
  789. Message(parser_e_pointer_to_class_expected);
  790. p.free;
  791. new_dispose_statement:=factor(false);
  792. consume_all_until(_RKLAMMER);
  793. consume(_RKLAMMER);
  794. exit;
  795. end;
  796. { check, if the first parameter is a pointer to a _class_ }
  797. classh:=tobjectdef(tpointerdef(p.resulttype.def).pointertype.def);
  798. if is_class(classh) then
  799. begin
  800. Message(parser_e_no_new_or_dispose_for_classes);
  801. new_dispose_statement:=factor(false);
  802. consume_all_until(_RKLAMMER);
  803. consume(_RKLAMMER);
  804. exit;
  805. end;
  806. { search cons-/destructor, also in parent classes }
  807. storepos:=akttokenpos;
  808. akttokenpos:=destructorpos;
  809. sym:=search_class_member(classh,destructorname);
  810. akttokenpos:=storepos;
  811. { the second parameter of new/dispose must be a call }
  812. { to a cons-/destructor }
  813. if (not assigned(sym)) or (sym.typ<>procsym) then
  814. begin
  815. if is_new then
  816. Message(parser_e_expr_have_to_be_constructor_call)
  817. else
  818. Message(parser_e_expr_have_to_be_destructor_call);
  819. p.free;
  820. new_dispose_statement:=cerrornode.create;
  821. end
  822. else
  823. begin
  824. if is_new then
  825. p2:=chnewnode.create
  826. else
  827. p2:=chdisposenode.create(p);
  828. do_resulttypepass(p2);
  829. p2.resulttype:=tpointerdef(p.resulttype.def).pointertype;
  830. if is_new then
  831. do_member_read(false,sym,p2,again)
  832. else
  833. begin
  834. if (m_tp in aktmodeswitches) then
  835. do_member_read(false,sym,p2,again)
  836. else
  837. begin
  838. p2:=ccallnode.create(nil,tprocsym(sym),sym.owner,p2);
  839. { support dispose(p,done()); }
  840. if try_to_consume(_LKLAMMER) then
  841. begin
  842. if not try_to_consume(_RKLAMMER) then
  843. begin
  844. Message(parser_e_no_paras_for_destructor);
  845. consume_all_until(_RKLAMMER);
  846. consume(_RKLAMMER);
  847. end;
  848. end;
  849. end;
  850. end;
  851. { we need the real called method }
  852. cleartempgen;
  853. do_resulttypepass(p2);
  854. if not codegenerror then
  855. begin
  856. if is_new then
  857. begin
  858. if (tcallnode(p2).procdefinition.proctypeoption<>potype_constructor) then
  859. Message(parser_e_expr_have_to_be_constructor_call);
  860. p2:=cnewnode.create(p2);
  861. do_resulttypepass(p2);
  862. p2.resulttype:=p.resulttype;
  863. p2:=cassignmentnode.create(p,p2);
  864. end
  865. else
  866. begin
  867. if (tcallnode(p2).procdefinition.proctypeoption<>potype_destructor) then
  868. Message(parser_e_expr_have_to_be_destructor_call);
  869. end;
  870. end;
  871. new_dispose_statement:=p2;
  872. end;
  873. end
  874. else
  875. begin
  876. if (p.resulttype.def.deftype<>pointerdef) then
  877. Begin
  878. Message1(type_e_pointer_type_expected,p.resulttype.def.typename);
  879. new_dispose_statement:=cerrornode.create;
  880. end
  881. else
  882. begin
  883. if (tpointerdef(p.resulttype.def).pointertype.def.deftype=objectdef) and
  884. (oo_has_vmt in tobjectdef(tpointerdef(p.resulttype.def).pointertype.def).objectoptions) then
  885. Message(parser_w_use_extended_syntax_for_objects);
  886. if (tpointerdef(p.resulttype.def).pointertype.def.deftype=orddef) and
  887. (torddef(tpointerdef(p.resulttype.def).pointertype.def).typ=uvoid) then
  888. begin
  889. if (m_tp in aktmodeswitches) or
  890. (m_delphi in aktmodeswitches) then
  891. Message(parser_w_no_new_dispose_on_void_pointers)
  892. else
  893. Message(parser_e_no_new_dispose_on_void_pointers);
  894. end;
  895. if is_new then
  896. new_dispose_statement:=csimplenewdisposenode.create(simplenewn,p)
  897. else
  898. new_dispose_statement:=csimplenewdisposenode.create(simpledisposen,p);
  899. end;
  900. end;
  901. consume(_RKLAMMER);
  902. end;
  903. function statement : tnode;
  904. var
  905. p : tnode;
  906. code : tnode;
  907. filepos : tfileposinfo;
  908. srsym : tsym;
  909. srsymtable : tsymtable;
  910. begin
  911. filepos:=akttokenpos;
  912. case token of
  913. _GOTO :
  914. begin
  915. if not(cs_support_goto in aktmoduleswitches)then
  916. Message(sym_e_goto_and_label_not_supported);
  917. consume(_GOTO);
  918. if (token<>_INTCONST) and (token<>_ID) then
  919. begin
  920. Message(sym_e_label_not_found);
  921. code:=cerrornode.create;
  922. end
  923. else
  924. begin
  925. consume_sym(srsym,srsymtable);
  926. if srsym.typ<>labelsym then
  927. begin
  928. Message(sym_e_id_is_no_label_id);
  929. code:=cerrornode.create;
  930. end
  931. else
  932. begin
  933. code:=cgotonode.create(tlabelsym(srsym));
  934. tgotonode(code).labsym:=tlabelsym(srsym);
  935. { set flag that this label is used }
  936. tlabelsym(srsym).used:=true;
  937. end;
  938. end;
  939. end;
  940. _BEGIN :
  941. code:=statement_block(_BEGIN);
  942. _IF :
  943. code:=if_statement;
  944. _CASE :
  945. code:=case_statement;
  946. _REPEAT :
  947. code:=repeat_statement;
  948. _WHILE :
  949. code:=while_statement;
  950. _FOR :
  951. code:=for_statement;
  952. _NEW,
  953. _DISPOSE :
  954. code:=new_dispose_statement;
  955. _WITH :
  956. code:=with_statement;
  957. _TRY :
  958. code:=try_statement;
  959. _RAISE :
  960. code:=raise_statement;
  961. { semicolons,else until and end are ignored }
  962. _SEMICOLON,
  963. _ELSE,
  964. _UNTIL,
  965. _END:
  966. code:=cnothingnode.create;
  967. _FAIL :
  968. begin
  969. if (aktprocsym.definition.proctypeoption<>potype_constructor) then
  970. Message(parser_e_fail_only_in_constructor);
  971. consume(_FAIL);
  972. code:=cfailnode.create;
  973. end;
  974. _EXIT :
  975. code:=exit_statement;
  976. _ASM :
  977. code:=_asm_statement;
  978. _EOF :
  979. Message(scan_f_end_of_file);
  980. else
  981. begin
  982. p:=expr;
  983. if p.nodetype=labeln then
  984. begin
  985. { the pointer to the following instruction }
  986. { isn't a very clean way }
  987. tlabelnode(p).left:=statement{$ifdef FPCPROCVAR}(){$endif};
  988. { be sure to have left also resulttypepass }
  989. resulttypepass(tlabelnode(p).left);
  990. end;
  991. if not(p.nodetype in [calln,assignn,breakn,inlinen,continuen,labeln]) then
  992. Message(cg_e_illegal_expression);
  993. { specify that we don't use the value returned by the call }
  994. { Question : can this be also improtant
  995. for inlinen ??
  996. it is used for :
  997. - dispose of temp stack space
  998. - dispose on FPU stack }
  999. if p.nodetype=calln then
  1000. exclude(p.flags,nf_return_value_used);
  1001. code:=p;
  1002. end;
  1003. end;
  1004. if assigned(code) then
  1005. code.set_tree_filepos(filepos);
  1006. statement:=code;
  1007. end;
  1008. function statement_block(starttoken : ttoken) : tnode;
  1009. var
  1010. first,last : tnode;
  1011. filepos : tfileposinfo;
  1012. begin
  1013. first:=nil;
  1014. filepos:=akttokenpos;
  1015. consume(starttoken);
  1016. inc(statement_level);
  1017. while not(token in [_END,_FINALIZATION]) do
  1018. begin
  1019. if first=nil then
  1020. begin
  1021. last:=cstatementnode.create(nil,statement);
  1022. first:=last;
  1023. end
  1024. else
  1025. begin
  1026. tstatementnode(last).left:=cstatementnode.create(nil,statement);
  1027. last:=tstatementnode(last).left;
  1028. end;
  1029. if (token in [_END,_FINALIZATION]) then
  1030. break
  1031. else
  1032. begin
  1033. { if no semicolon, then error and go on }
  1034. if token<>_SEMICOLON then
  1035. begin
  1036. consume(_SEMICOLON);
  1037. consume_all_until(_SEMICOLON);
  1038. end;
  1039. consume(_SEMICOLON);
  1040. end;
  1041. emptystats;
  1042. end;
  1043. { don't consume the finalization token, it is consumed when
  1044. reading the finalization block, but allow it only after
  1045. an initalization ! }
  1046. if (starttoken<>_INITIALIZATION) or (token<>_FINALIZATION) then
  1047. consume(_END);
  1048. dec(statement_level);
  1049. last:=cblocknode.create(first);
  1050. last.set_tree_filepos(filepos);
  1051. statement_block:=last;
  1052. end;
  1053. function assembler_block : tnode;
  1054. begin
  1055. { temporary space is set, while the BEGIN of the procedure }
  1056. if symtablestack.symtabletype=localsymtable then
  1057. procinfo^.firsttemp_offset := -symtablestack.datasize
  1058. else
  1059. procinfo^.firsttemp_offset := 0;
  1060. { assembler code does not allocate }
  1061. { space for the return value }
  1062. if not is_void(procinfo^.returntype.def) then
  1063. begin
  1064. if ret_in_acc(procinfo^.returntype.def) then
  1065. begin
  1066. { in assembler code the result should be directly in %eax
  1067. procinfo^.retoffset:=procinfo^.firsttemp-procinfo^.retdef.size;
  1068. procinfo^.firsttemp:=procinfo^.retoffset; }
  1069. {$ifndef newcg}
  1070. {$ifdef i386}
  1071. usedinproc:=usedinproc or ($80 shr byte(R_EAX))
  1072. {$endif}
  1073. {$ifdef m68k}
  1074. usedinproc:=usedinproc or ($800 shr word(R_D0))
  1075. {$endif}
  1076. {$endif newcg}
  1077. end
  1078. {
  1079. else if not is_fpu(procinfo^.retdef) then
  1080. should we allow assembler functions of big elements ?
  1081. YES (FK)!!
  1082. Message(parser_e_asm_incomp_with_function_return);
  1083. }
  1084. end;
  1085. { set the framepointer to esp for assembler functions }
  1086. { but only if the are no local variables }
  1087. { added no parameter also (PM) }
  1088. { disable for methods, because self pointer is expected }
  1089. { at -8(%ebp) (JM) }
  1090. { why if se use %esp then self is still at the correct address PM }
  1091. if {not(assigned(procinfo^._class)) and}
  1092. (po_assembler in aktprocsym.definition.procoptions) and
  1093. (aktprocsym.definition.localst.datasize=0) and
  1094. (aktprocsym.definition.parast.datasize=0) and
  1095. not(ret_in_param(aktprocsym.definition.rettype.def)) then
  1096. begin
  1097. procinfo^.framepointer:=stack_pointer;
  1098. { set the right value for parameters }
  1099. dec(aktprocsym.definition.parast.address_fixup,target_info.size_of_pointer);
  1100. dec(procinfo^.para_offset,target_info.size_of_pointer);
  1101. end;
  1102. { force the asm statement }
  1103. if token<>_ASM then
  1104. consume(_ASM);
  1105. procinfo^.Flags := procinfo^.Flags Or pi_is_assembler;
  1106. assembler_block:=_asm_statement;
  1107. { becuase the END is already read we need to get the
  1108. last_endtoken_filepos here (PFV) }
  1109. last_endtoken_filepos:=akttokenpos;
  1110. end;
  1111. end.
  1112. {
  1113. $Log$
  1114. Revision 1.27 2001-04-18 22:01:57 peter
  1115. * registration of targets and assemblers
  1116. Revision 1.26 2001/04/15 09:48:30 peter
  1117. * fixed crash in labelnode
  1118. * easier detection of goto and label in try blocks
  1119. Revision 1.25 2001/04/14 14:07:11 peter
  1120. * moved more code from pass_1 to det_resulttype
  1121. Revision 1.24 2001/04/13 01:22:13 peter
  1122. * symtable change to classes
  1123. * range check generation and errors fixed, make cycle DEBUG=1 works
  1124. * memory leaks fixed
  1125. Revision 1.23 2001/04/04 22:43:52 peter
  1126. * remove unnecessary calls to firstpass
  1127. Revision 1.22 2001/04/02 21:20:34 peter
  1128. * resulttype rewrite
  1129. Revision 1.21 2001/03/22 22:35:42 florian
  1130. + support for type a = (a=1); in Delphi mode added
  1131. + procedure p(); in Delphi mode supported
  1132. + on isn't keyword anymore, it can be used as
  1133. id etc. now
  1134. Revision 1.20 2001/03/11 22:58:50 peter
  1135. * getsym redesign, removed the globals srsym,srsymtable
  1136. Revision 1.19 2000/12/25 00:07:27 peter
  1137. + new tlinkedlist class (merge of old tstringqueue,tcontainer and
  1138. tlinkedlist objects)
  1139. Revision 1.18 2000/12/23 19:59:35 peter
  1140. * object to class for ow/og objects
  1141. * split objectdata from objectoutput
  1142. Revision 1.17 2000/12/16 22:45:55 jonas
  1143. * fixed case statements with int64 values
  1144. Revision 1.16 2000/11/29 00:30:37 florian
  1145. * unused units removed from uses clause
  1146. * some changes for widestrings
  1147. Revision 1.15 2000/11/27 15:47:19 jonas
  1148. * fix for web bug 1251 (example 1)
  1149. Revision 1.14 2000/11/22 22:43:34 peter
  1150. * fixed crash with exception without sysutils (merged)
  1151. Revision 1.13 2000/11/04 14:25:21 florian
  1152. + merged Attila's changes for interfaces, not tested yet
  1153. Revision 1.12 2000/10/31 22:02:50 peter
  1154. * symtable splitted, no real code changes
  1155. Revision 1.11 2000/10/14 21:52:56 peter
  1156. * fixed memory leaks
  1157. Revision 1.10 2000/10/14 10:14:52 peter
  1158. * moehrendorf oct 2000 rewrite
  1159. Revision 1.9 2000/10/01 19:48:25 peter
  1160. * lot of compile updates for cg11
  1161. Revision 1.8 2000/09/24 21:19:50 peter
  1162. * delphi compile fixes
  1163. Revision 1.7 2000/09/24 15:06:24 peter
  1164. * use defines.inc
  1165. Revision 1.6 2000/08/27 16:11:52 peter
  1166. * moved some util functions from globals,cobjects to cutils
  1167. * splitted files into finput,fmodule
  1168. Revision 1.5 2000/08/12 15:41:15 peter
  1169. * fixed bug 1096 (merged)
  1170. Revision 1.4 2000/08/12 06:46:06 florian
  1171. + case statement for int64/qword implemented
  1172. Revision 1.3 2000/07/13 12:08:27 michael
  1173. + patched to 1.1.0 with former 1.09patch from peter
  1174. Revision 1.2 2000/07/13 11:32:45 michael
  1175. + removed logs
  1176. }