pstatmnt.pas 42 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817818819820821822823824825826827828829830831832833834835836837838839840841842843844845846847848849850851852853854855856857858859860861862863864865866867868869870871872873874875876877878879880881882883884885886887888889890891892893894895896897898899900901902903904905906907908909910911912913914915916917918919920921922923924925926927928929930931932933934935936937938939940941942943944945946947948949950951952953954955956957958959960961962963964965966967968969970971972973974975976977978979980981982983984985986987988989990991992993994995996997998999100010011002100310041005100610071008100910101011101210131014101510161017101810191020102110221023102410251026102710281029103010311032103310341035103610371038103910401041104210431044104510461047104810491050105110521053105410551056105710581059106010611062106310641065106610671068106910701071107210731074107510761077107810791080108110821083108410851086108710881089109010911092109310941095109610971098109911001101110211031104110511061107110811091110111111121113111411151116111711181119112011211122112311241125112611271128112911301131113211331134113511361137113811391140114111421143114411451146114711481149115011511152115311541155115611571158115911601161116211631164116511661167116811691170117111721173117411751176117711781179118011811182118311841185118611871188118911901191119211931194119511961197119811991200120112021203
  1. {
  2. Copyright (c) 1998-2002 by Florian Klaempfl
  3. Does the parsing of the statements
  4. This program is free software; you can redistribute it and/or modify
  5. it under the terms of the GNU General Public License as published by
  6. the Free Software Foundation; either version 2 of the License, or
  7. (at your option) any later version.
  8. This program is distributed in the hope that it will be useful,
  9. but WITHOUT ANY WARRANTY; without even the implied warranty of
  10. MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
  11. GNU General Public License for more details.
  12. You should have received a copy of the GNU General Public License
  13. along with this program; if not, write to the Free Software
  14. Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
  15. ****************************************************************************
  16. }
  17. unit pstatmnt;
  18. {$i fpcdefs.inc}
  19. interface
  20. uses
  21. tokens,node;
  22. function statement_block(starttoken : ttoken) : tnode;
  23. { reads an assembler block }
  24. function assembler_block : tnode;
  25. implementation
  26. uses
  27. { common }
  28. cutils,cclasses,
  29. { global }
  30. globtype,globals,verbose,
  31. systems,
  32. { aasm }
  33. cpubase,aasmbase,aasmtai,aasmdata,
  34. { symtable }
  35. symconst,symbase,symtype,symdef,symsym,symtable,defutil,defcmp,
  36. paramgr,symutil,
  37. { pass 1 }
  38. pass_1,htypechk,
  39. nutils,nbas,nmat,nadd,ncal,nmem,nset,ncnv,ninl,ncon,nld,nflw,
  40. { parser }
  41. scanner,
  42. pbase,pexpr,
  43. { codegen }
  44. procinfo,cgbase,
  45. { assembler reader }
  46. rabase
  47. ;
  48. function statement : tnode;forward;
  49. function if_statement : tnode;
  50. var
  51. ex,if_a,else_a : tnode;
  52. begin
  53. consume(_IF);
  54. ex:=comp_expr(true);
  55. consume(_THEN);
  56. if token<>_ELSE then
  57. if_a:=statement
  58. else
  59. if_a:=nil;
  60. if try_to_consume(_ELSE) then
  61. else_a:=statement
  62. else
  63. else_a:=nil;
  64. result:=cifnode.create(ex,if_a,else_a);
  65. end;
  66. { creates a block (list) of statements, til the next END token }
  67. function statements_til_end : tnode;
  68. var
  69. first,last : tstatementnode;
  70. begin
  71. first:=nil;
  72. while token<>_END do
  73. begin
  74. if first=nil then
  75. begin
  76. last:=cstatementnode.create(statement,nil);
  77. first:=last;
  78. end
  79. else
  80. begin
  81. last.right:=cstatementnode.create(statement,nil);
  82. last:=tstatementnode(last.right);
  83. end;
  84. if not try_to_consume(_SEMICOLON) then
  85. break;
  86. consume_emptystats;
  87. end;
  88. consume(_END);
  89. statements_til_end:=cblocknode.create(first);
  90. end;
  91. function case_statement : tnode;
  92. var
  93. casedef : tdef;
  94. caseexpr,p : tnode;
  95. blockid : longint;
  96. hl1,hl2 : TConstExprInt;
  97. casedeferror : boolean;
  98. casenode : tcasenode;
  99. begin
  100. consume(_CASE);
  101. caseexpr:=comp_expr(true);
  102. { determines result type }
  103. do_typecheckpass(caseexpr);
  104. { variants must be accepted, but first they must be converted to integer }
  105. if caseexpr.resultdef.typ=variantdef then
  106. begin
  107. caseexpr:=ctypeconvnode.create_internal(caseexpr,sinttype);
  108. do_typecheckpass(caseexpr);
  109. end;
  110. set_varstate(caseexpr,vs_read,[vsf_must_be_valid]);
  111. casedeferror:=false;
  112. casedef:=caseexpr.resultdef;
  113. if (not assigned(casedef)) or
  114. not(is_ordinal(casedef)) then
  115. begin
  116. CGMessage(type_e_ordinal_expr_expected);
  117. { create a correct tree }
  118. caseexpr.free;
  119. caseexpr:=cordconstnode.create(0,u32inttype,false);
  120. { set error flag so no rangechecks are done }
  121. casedeferror:=true;
  122. end;
  123. { Create casenode }
  124. casenode:=ccasenode.create(caseexpr);
  125. consume(_OF);
  126. { Parse all case blocks }
  127. blockid:=0;
  128. repeat
  129. { maybe an instruction has more case labels }
  130. repeat
  131. p:=expr;
  132. if is_widechar(casedef) then
  133. begin
  134. if (p.nodetype=rangen) then
  135. begin
  136. trangenode(p).left:=ctypeconvnode.create(trangenode(p).left,cwidechartype);
  137. trangenode(p).right:=ctypeconvnode.create(trangenode(p).right,cwidechartype);
  138. do_typecheckpass(trangenode(p).left);
  139. do_typecheckpass(trangenode(p).right);
  140. end
  141. else
  142. begin
  143. p:=ctypeconvnode.create(p,cwidechartype);
  144. do_typecheckpass(p);
  145. end;
  146. end;
  147. hl1:=0;
  148. hl2:=0;
  149. if (p.nodetype=rangen) then
  150. begin
  151. { type checking for case statements }
  152. if is_subequal(casedef, trangenode(p).left.resultdef) and
  153. is_subequal(casedef, trangenode(p).right.resultdef) then
  154. begin
  155. hl1:=get_ordinal_value(trangenode(p).left);
  156. hl2:=get_ordinal_value(trangenode(p).right);
  157. if hl1>hl2 then
  158. CGMessage(parser_e_case_lower_less_than_upper_bound);
  159. if not casedeferror then
  160. begin
  161. testrange(casedef,hl1,false);
  162. testrange(casedef,hl2,false);
  163. end;
  164. end
  165. else
  166. CGMessage(parser_e_case_mismatch);
  167. casenode.addlabel(blockid,hl1,hl2);
  168. end
  169. else
  170. begin
  171. { type checking for case statements }
  172. if not is_subequal(casedef, p.resultdef) then
  173. CGMessage(parser_e_case_mismatch);
  174. hl1:=get_ordinal_value(p);
  175. if not casedeferror then
  176. testrange(casedef,hl1,false);
  177. casenode.addlabel(blockid,hl1,hl1);
  178. end;
  179. p.free;
  180. if token=_COMMA then
  181. consume(_COMMA)
  182. else
  183. break;
  184. until false;
  185. consume(_COLON);
  186. { add instruction block }
  187. casenode.addblock(blockid,statement);
  188. { next block }
  189. inc(blockid);
  190. if not(token in [_ELSE,_OTHERWISE,_END]) then
  191. consume(_SEMICOLON);
  192. until (token in [_ELSE,_OTHERWISE,_END]);
  193. if (token in [_ELSE,_OTHERWISE]) then
  194. begin
  195. if not try_to_consume(_ELSE) then
  196. consume(_OTHERWISE);
  197. casenode.addelseblock(statements_til_end);
  198. end
  199. else
  200. consume(_END);
  201. result:=casenode;
  202. end;
  203. function repeat_statement : tnode;
  204. var
  205. first,last,p_e : tnode;
  206. begin
  207. consume(_REPEAT);
  208. first:=nil;
  209. while token<>_UNTIL do
  210. begin
  211. if first=nil then
  212. begin
  213. last:=cstatementnode.create(statement,nil);
  214. first:=last;
  215. end
  216. else
  217. begin
  218. tstatementnode(last).right:=cstatementnode.create(statement,nil);
  219. last:=tstatementnode(last).right;
  220. end;
  221. if not try_to_consume(_SEMICOLON) then
  222. break;
  223. consume_emptystats;
  224. end;
  225. consume(_UNTIL);
  226. first:=cblocknode.create(first);
  227. p_e:=comp_expr(true);
  228. result:=cwhilerepeatnode.create(p_e,first,false,true);
  229. end;
  230. function while_statement : tnode;
  231. var
  232. p_e,p_a : tnode;
  233. begin
  234. consume(_WHILE);
  235. p_e:=comp_expr(true);
  236. consume(_DO);
  237. p_a:=statement;
  238. result:=cwhilerepeatnode.create(p_e,p_a,true,false);
  239. end;
  240. function for_statement : tnode;
  241. procedure check_range(hp:tnode);
  242. begin
  243. {$ifndef cpu64bit}
  244. if hp.nodetype=ordconstn then
  245. begin
  246. if (tordconstnode(hp).value<low(longint)) or
  247. (tordconstnode(hp).value>high(longint)) then
  248. begin
  249. CGMessage(parser_e_range_check_error);
  250. { recover, prevent more warnings/errors }
  251. tordconstnode(hp).value:=0;
  252. end;
  253. end;
  254. {$endif cpu64bit}
  255. end;
  256. var
  257. hp,
  258. hloopvar,
  259. hblock,
  260. hto,hfrom : tnode;
  261. backward : boolean;
  262. loopvarsym : tabstractvarsym;
  263. begin
  264. { parse loop header }
  265. consume(_FOR);
  266. hloopvar:=factor(false);
  267. valid_for_loopvar(hloopvar,true);
  268. { Check loop variable }
  269. loopvarsym:=nil;
  270. { variable must be an ordinal, int64 is not allowed for 32bit targets }
  271. if not(is_ordinal(hloopvar.resultdef))
  272. {$ifndef cpu64bit}
  273. or is_64bitint(hloopvar.resultdef)
  274. {$endif cpu64bit}
  275. then
  276. MessagePos(hloopvar.fileinfo,type_e_ordinal_expr_expected);
  277. hp:=hloopvar;
  278. while assigned(hp) and
  279. (
  280. { record/object fields are allowed in tp7 mode only }
  281. (
  282. (m_tp7 in current_settings.modeswitches) and
  283. (hp.nodetype=subscriptn) and
  284. ((tsubscriptnode(hp).left.resultdef.typ=recorddef) or
  285. is_object(tsubscriptnode(hp).left.resultdef))
  286. ) or
  287. { constant array index }
  288. (
  289. (hp.nodetype=vecn) and
  290. is_constintnode(tvecnode(hp).right)
  291. ) or
  292. { equal typeconversions }
  293. (
  294. (hp.nodetype=typeconvn) and
  295. (ttypeconvnode(hp).convtype=tc_equal)
  296. )
  297. ) do
  298. begin
  299. { Use the recordfield for loopvarsym }
  300. if not assigned(loopvarsym) and
  301. (hp.nodetype=subscriptn) then
  302. loopvarsym:=tsubscriptnode(hp).vs;
  303. hp:=tunarynode(hp).left;
  304. end;
  305. if assigned(hp) and
  306. (hp.nodetype=loadn) then
  307. begin
  308. case tloadnode(hp).symtableentry.typ of
  309. staticvarsym,
  310. localvarsym,
  311. paravarsym :
  312. begin
  313. { we need a simple loadn:
  314. 1. The load must be in a global symtable or
  315. in the same level as the para of the current proc.
  316. 2. value variables (no const,out or var)
  317. 3. No threadvar, readonly or typedconst
  318. }
  319. if (
  320. (tloadnode(hp).symtable.symtablelevel=main_program_level) or
  321. (tloadnode(hp).symtable.symtablelevel=current_procinfo.procdef.parast.symtablelevel)
  322. ) and
  323. (tabstractvarsym(tloadnode(hp).symtableentry).varspez=vs_value) and
  324. ([vo_is_thread_var,vo_is_typed_const] * tabstractvarsym(tloadnode(hp).symtableentry).varoptions=[]) then
  325. begin
  326. { Assigning for-loop variable is only allowed in tp7 and macpas }
  327. if ([m_tp7,m_mac] * current_settings.modeswitches = []) then
  328. begin
  329. if not assigned(loopvarsym) then
  330. loopvarsym:=tabstractvarsym(tloadnode(hp).symtableentry);
  331. include(loopvarsym.varoptions,vo_is_loop_counter);
  332. end;
  333. end
  334. else
  335. begin
  336. { Typed const is allowed in tp7 }
  337. if not(m_tp7 in current_settings.modeswitches) or
  338. not(vo_is_typed_const in tabstractvarsym(tloadnode(hp).symtableentry).varoptions) then
  339. MessagePos(hp.fileinfo,type_e_illegal_count_var);
  340. end;
  341. end;
  342. else
  343. MessagePos(hp.fileinfo,type_e_illegal_count_var);
  344. end;
  345. end
  346. else
  347. MessagePos(hloopvar.fileinfo,type_e_illegal_count_var);
  348. consume(_ASSIGNMENT);
  349. hfrom:=comp_expr(true);
  350. if try_to_consume(_DOWNTO) then
  351. backward:=true
  352. else
  353. begin
  354. consume(_TO);
  355. backward:=false;
  356. end;
  357. hto:=comp_expr(true);
  358. consume(_DO);
  359. { Check if the constants fit in the range }
  360. check_range(hfrom);
  361. check_range(hto);
  362. { first set the varstate for from and to, so
  363. uses of loopvar in those expressions will also
  364. trigger a warning when it is not used yet. This
  365. needs to be done before the instruction block is
  366. parsed to have a valid hloopvar }
  367. typecheckpass(hfrom);
  368. set_varstate(hfrom,vs_read,[vsf_must_be_valid]);
  369. typecheckpass(hto);
  370. set_varstate(hto,vs_read,[vsf_must_be_valid]);
  371. typecheckpass(hloopvar);
  372. set_varstate(hloopvar,vs_readwritten,[]);
  373. { ... now the instruction block }
  374. hblock:=statement;
  375. { variable is not used for loop counter anymore }
  376. if assigned(loopvarsym) then
  377. exclude(loopvarsym.varoptions,vo_is_loop_counter);
  378. result:=cfornode.create(hloopvar,hfrom,hto,hblock,backward);
  379. end;
  380. function _with_statement : tnode;
  381. var
  382. p : tnode;
  383. i : longint;
  384. st : TSymtable;
  385. newblock : tblocknode;
  386. newstatement : tstatementnode;
  387. calltempnode,
  388. tempnode : ttempcreatenode;
  389. valuenode,
  390. hp,
  391. refnode : tnode;
  392. hdef : tdef;
  393. hasimplicitderef : boolean;
  394. withsymtablelist : TFPObjectList;
  395. procedure pushobjchild(obj:tobjectdef);
  396. begin
  397. if not assigned(obj) then
  398. exit;
  399. pushobjchild(obj.childof);
  400. { keep the original tobjectdef as owner, because that is used for
  401. visibility of the symtable }
  402. st:=twithsymtable.create(tobjectdef(p.resultdef),obj.symtable.SymList,refnode.getcopy);
  403. symtablestack.push(st);
  404. withsymtablelist.add(st);
  405. end;
  406. begin
  407. p:=comp_expr(true);
  408. do_typecheckpass(p);
  409. if (p.nodetype=vecn) and
  410. (nf_memseg in p.flags) then
  411. CGMessage(parser_e_no_with_for_variable_in_other_segments);
  412. if (p.resultdef.typ in [objectdef,recorddef]) then
  413. begin
  414. newblock:=nil;
  415. valuenode:=nil;
  416. tempnode:=nil;
  417. { ignore nodes that don't add instructions in the tree }
  418. hp:=p;
  419. while { equal type conversions }
  420. (
  421. (hp.nodetype=typeconvn) and
  422. (ttypeconvnode(hp).convtype=tc_equal)
  423. ) or
  424. { constant array index }
  425. (
  426. (hp.nodetype=vecn) and
  427. (tvecnode(hp).right.nodetype=ordconstn)
  428. ) do
  429. hp:=tunarynode(hp).left;
  430. if (hp.nodetype=loadn) and
  431. (
  432. (tloadnode(hp).symtable=current_procinfo.procdef.localst) or
  433. (tloadnode(hp).symtable=current_procinfo.procdef.parast) or
  434. (tloadnode(hp).symtable.symtabletype in [staticsymtable,globalsymtable])
  435. ) then
  436. begin
  437. { simple load, we can reference direct }
  438. refnode:=p;
  439. end
  440. else
  441. begin
  442. calltempnode:=nil;
  443. { complex load, load in temp first }
  444. newblock:=internalstatements(newstatement);
  445. { when right is a call then load it first in a temp }
  446. if p.nodetype=calln then
  447. begin
  448. calltempnode:=ctempcreatenode.create(p.resultdef,p.resultdef.size,tt_persistent,true);
  449. addstatement(newstatement,calltempnode);
  450. addstatement(newstatement,cassignmentnode.create(
  451. ctemprefnode.create(calltempnode),
  452. p));
  453. p:=ctemprefnode.create(calltempnode);
  454. typecheckpass(p);
  455. end;
  456. { classes and interfaces have implicit dereferencing }
  457. hasimplicitderef:=is_class_or_interface(p.resultdef);
  458. if hasimplicitderef then
  459. hdef:=p.resultdef
  460. else
  461. hdef:=tpointerdef.create(p.resultdef);
  462. { load address of the value in a temp }
  463. tempnode:=ctempcreatenode.create(hdef,sizeof(aint),tt_persistent,true);
  464. typecheckpass(tempnode);
  465. valuenode:=p;
  466. refnode:=ctemprefnode.create(tempnode);
  467. fillchar(refnode.fileinfo,sizeof(tfileposinfo),0);
  468. { add address call for valuenode and deref for refnode if this
  469. is not done implicitly }
  470. if not hasimplicitderef then
  471. begin
  472. valuenode:=caddrnode.create_internal(valuenode);
  473. refnode:=cderefnode.create(refnode);
  474. fillchar(refnode.fileinfo,sizeof(tfileposinfo),0);
  475. end;
  476. addstatement(newstatement,tempnode);
  477. addstatement(newstatement,cassignmentnode.create(
  478. ctemprefnode.create(tempnode),
  479. valuenode));
  480. typecheckpass(refnode);
  481. end;
  482. withsymtablelist:=TFPObjectList.create(true);
  483. case p.resultdef.typ of
  484. objectdef :
  485. begin
  486. { push symtables of all parents in reverse order }
  487. pushobjchild(tobjectdef(p.resultdef).childof);
  488. { push object symtable }
  489. st:=twithsymtable.Create(tobjectdef(p.resultdef),tobjectdef(p.resultdef).symtable.SymList,refnode);
  490. symtablestack.push(st);
  491. withsymtablelist.add(st);
  492. end;
  493. recorddef :
  494. begin
  495. st:=twithsymtable.create(trecorddef(p.resultdef),trecorddef(p.resultdef).symtable.SymList,refnode);
  496. symtablestack.push(st);
  497. withsymtablelist.add(st);
  498. end;
  499. else
  500. internalerror(200601271);
  501. end;
  502. if try_to_consume(_COMMA) then
  503. p:=_with_statement()
  504. else
  505. begin
  506. consume(_DO);
  507. if token<>_SEMICOLON then
  508. p:=statement
  509. else
  510. p:=cerrornode.create;
  511. end;
  512. { remove symtables in reverse order from the stack }
  513. for i:=withsymtablelist.count-1 downto 0 do
  514. symtablestack.pop(TSymtable(withsymtablelist[i]));
  515. withsymtablelist.free;
  516. // p:=cwithnode.create(right,twithsymtable(withsymtable),levelcount,refnode);
  517. { Finalize complex withnode with destroy of temp }
  518. if assigned(newblock) then
  519. begin
  520. addstatement(newstatement,p);
  521. if assigned(tempnode) then
  522. addstatement(newstatement,ctempdeletenode.create(tempnode));
  523. if assigned(calltempnode) then
  524. addstatement(newstatement,ctempdeletenode.create(calltempnode));
  525. p:=newblock;
  526. end;
  527. result:=p;
  528. end
  529. else
  530. begin
  531. p.free;
  532. Message(parser_e_false_with_expr);
  533. { try to recover from error }
  534. if try_to_consume(_COMMA) then
  535. begin
  536. hp:=_with_statement();
  537. if (hp=nil) then; { remove warning about unused }
  538. end
  539. else
  540. begin
  541. consume(_DO);
  542. { ignore all }
  543. if token<>_SEMICOLON then
  544. statement;
  545. end;
  546. result:=nil;
  547. end;
  548. end;
  549. function with_statement : tnode;
  550. begin
  551. consume(_WITH);
  552. with_statement:=_with_statement();
  553. end;
  554. function raise_statement : tnode;
  555. var
  556. p,pobj,paddr,pframe : tnode;
  557. begin
  558. pobj:=nil;
  559. paddr:=nil;
  560. pframe:=nil;
  561. consume(_RAISE);
  562. if not(token in endtokens) then
  563. begin
  564. { object }
  565. pobj:=comp_expr(true);
  566. if try_to_consume(_AT) then
  567. begin
  568. paddr:=comp_expr(true);
  569. if try_to_consume(_COMMA) then
  570. pframe:=comp_expr(true);
  571. end;
  572. end
  573. else
  574. begin
  575. if (block_type<>bt_except) then
  576. Message(parser_e_no_reraise_possible);
  577. end;
  578. p:=craisenode.create(pobj,paddr,pframe);
  579. raise_statement:=p;
  580. end;
  581. function try_statement : tnode;
  582. var
  583. p_try_block,p_finally_block,first,last,
  584. p_default,p_specific,hp : tnode;
  585. ot : tDef;
  586. sym : tlocalvarsym;
  587. old_block_type : tblock_type;
  588. excepTSymtable : TSymtable;
  589. objname,objrealname : TIDString;
  590. srsym : tsym;
  591. srsymtable : TSymtable;
  592. oldaktexceptblock: integer;
  593. begin
  594. include(current_procinfo.flags,pi_uses_exceptions);
  595. p_default:=nil;
  596. p_specific:=nil;
  597. { read statements to try }
  598. consume(_TRY);
  599. first:=nil;
  600. inc(exceptblockcounter);
  601. oldaktexceptblock := aktexceptblock;
  602. aktexceptblock := exceptblockcounter;
  603. while (token<>_FINALLY) and (token<>_EXCEPT) do
  604. begin
  605. if first=nil then
  606. begin
  607. last:=cstatementnode.create(statement,nil);
  608. first:=last;
  609. end
  610. else
  611. begin
  612. tstatementnode(last).right:=cstatementnode.create(statement,nil);
  613. last:=tstatementnode(last).right;
  614. end;
  615. if not try_to_consume(_SEMICOLON) then
  616. break;
  617. consume_emptystats;
  618. end;
  619. p_try_block:=cblocknode.create(first);
  620. if try_to_consume(_FINALLY) then
  621. begin
  622. inc(exceptblockcounter);
  623. aktexceptblock := exceptblockcounter;
  624. p_finally_block:=statements_til_end;
  625. try_statement:=ctryfinallynode.create(p_try_block,p_finally_block);
  626. end
  627. else
  628. begin
  629. consume(_EXCEPT);
  630. old_block_type:=block_type;
  631. block_type:=bt_except;
  632. inc(exceptblockcounter);
  633. aktexceptblock := exceptblockcounter;
  634. ot:=generrordef;
  635. p_specific:=nil;
  636. if (idtoken=_ON) then
  637. { catch specific exceptions }
  638. begin
  639. repeat
  640. consume(_ON);
  641. if token=_ID then
  642. begin
  643. objname:=pattern;
  644. objrealname:=orgpattern;
  645. { can't use consume_sym here, because we need already
  646. to check for the colon }
  647. searchsym(objname,srsym,srsymtable);
  648. consume(_ID);
  649. { is a explicit name for the exception given ? }
  650. if try_to_consume(_COLON) then
  651. begin
  652. consume_sym(srsym,srsymtable);
  653. if (srsym.typ=typesym) and
  654. is_class(ttypesym(srsym).typedef) then
  655. begin
  656. ot:=ttypesym(srsym).typedef;
  657. sym:=tlocalvarsym.create(objrealname,vs_value,ot,[]);
  658. end
  659. else
  660. begin
  661. sym:=tlocalvarsym.create(objrealname,vs_value,generrordef,[]);
  662. if (srsym.typ=typesym) then
  663. Message1(type_e_class_type_expected,ttypesym(srsym).typedef.typename)
  664. else
  665. Message1(type_e_class_type_expected,ot.typename);
  666. end;
  667. excepTSymtable:=tstt_excepTSymtable.create;
  668. excepTSymtable.insert(sym);
  669. symtablestack.push(excepTSymtable);
  670. end
  671. else
  672. begin
  673. { check if type is valid, must be done here because
  674. with "e: Exception" the e is not necessary }
  675. if srsym=nil then
  676. begin
  677. identifier_not_found(objrealname);
  678. srsym:=generrorsym;
  679. end;
  680. { support unit.identifier }
  681. if srsym.typ=unitsym then
  682. begin
  683. consume(_POINT);
  684. searchsym_in_module(tunitsym(srsym).module,pattern,srsym,srsymtable);
  685. if srsym=nil then
  686. begin
  687. identifier_not_found(orgpattern);
  688. srsym:=generrorsym;
  689. end;
  690. consume(_ID);
  691. end;
  692. { check if type is valid, must be done here because
  693. with "e: Exception" the e is not necessary }
  694. if (srsym.typ=typesym) and
  695. is_class(ttypesym(srsym).typedef) then
  696. ot:=ttypesym(srsym).typedef
  697. else
  698. begin
  699. ot:=generrordef;
  700. if (srsym.typ=typesym) then
  701. Message1(type_e_class_type_expected,ttypesym(srsym).typedef.typename)
  702. else
  703. Message1(type_e_class_type_expected,ot.typename);
  704. end;
  705. excepTSymtable:=nil;
  706. end;
  707. end
  708. else
  709. consume(_ID);
  710. consume(_DO);
  711. hp:=connode.create(nil,statement);
  712. if ot.typ=errordef then
  713. begin
  714. hp.free;
  715. hp:=cerrornode.create;
  716. end;
  717. if p_specific=nil then
  718. begin
  719. last:=hp;
  720. p_specific:=last;
  721. end
  722. else
  723. begin
  724. tonnode(last).left:=hp;
  725. last:=tonnode(last).left;
  726. end;
  727. { set the informations }
  728. { only if the creation of the onnode was succesful, it's possible }
  729. { that last and hp are errornodes (JM) }
  730. if last.nodetype = onn then
  731. begin
  732. tonnode(last).excepttype:=tobjectdef(ot);
  733. tonnode(last).excepTSymtable:=excepTSymtable;
  734. end;
  735. { remove exception symtable }
  736. if assigned(excepTSymtable) then
  737. begin
  738. symtablestack.pop(excepTSymtable);
  739. if last.nodetype <> onn then
  740. excepTSymtable.free;
  741. end;
  742. if not try_to_consume(_SEMICOLON) then
  743. break;
  744. consume_emptystats;
  745. until (token in [_END,_ELSE]);
  746. if try_to_consume(_ELSE) then
  747. begin
  748. { catch the other exceptions }
  749. p_default:=statements_til_end;
  750. end
  751. else
  752. consume(_END);
  753. end
  754. else
  755. begin
  756. { catch all exceptions }
  757. p_default:=statements_til_end;
  758. end;
  759. block_type:=old_block_type;
  760. try_statement:=ctryexceptnode.create(p_try_block,p_specific,p_default);
  761. end;
  762. aktexceptblock := oldaktexceptblock;
  763. end;
  764. function _asm_statement : tnode;
  765. var
  766. asmstat : tasmnode;
  767. Marker : tai;
  768. reg : tregister;
  769. asmreader : tbaseasmreader;
  770. begin
  771. Inside_asm_statement:=true;
  772. if assigned(asmmodeinfos[current_settings.asmmode]) then
  773. begin
  774. asmreader:=asmmodeinfos[current_settings.asmmode]^.casmreader.create;
  775. asmstat:=casmnode.create(asmreader.assemble as TAsmList);
  776. asmreader.free;
  777. end
  778. else
  779. Message(parser_f_assembler_reader_not_supported);
  780. { Mark procedure that it has assembler blocks }
  781. include(current_procinfo.flags,pi_has_assembler_block);
  782. { Read first the _ASM statement }
  783. consume(_ASM);
  784. { END is read, got a list of changed registers? }
  785. if try_to_consume(_LECKKLAMMER) then
  786. begin
  787. asmstat.used_regs_fpu:=[0..first_fpu_imreg-1];
  788. if token<>_RECKKLAMMER then
  789. begin
  790. repeat
  791. { it's possible to specify the modified registers }
  792. reg:=std_regnum_search(lower(pattern));
  793. if reg<>NR_NO then
  794. begin
  795. if getregtype(reg)=R_INTREGISTER then
  796. include(asmstat.used_regs_int,getsupreg(reg));
  797. end
  798. else
  799. Message(asmr_e_invalid_register);
  800. consume(_CSTRING);
  801. if not try_to_consume(_COMMA) then
  802. break;
  803. until false;
  804. end;
  805. consume(_RECKKLAMMER);
  806. end
  807. else
  808. begin
  809. asmstat.used_regs_int:=paramanager.get_volatile_registers_int(current_procinfo.procdef.proccalloption);
  810. asmstat.used_regs_fpu:=paramanager.get_volatile_registers_fpu(current_procinfo.procdef.proccalloption);
  811. end;
  812. { mark the start and the end of the assembler block
  813. this is needed for the optimizer }
  814. If Assigned(AsmStat.p_asm) Then
  815. Begin
  816. Marker := Tai_Marker.Create(mark_AsmBlockStart);
  817. AsmStat.p_asm.Insert(Marker);
  818. Marker := Tai_Marker.Create(mark_AsmBlockEnd);
  819. AsmStat.p_asm.Concat(Marker);
  820. End;
  821. Inside_asm_statement:=false;
  822. _asm_statement:=asmstat;
  823. end;
  824. function statement : tnode;
  825. var
  826. p : tnode;
  827. code : tnode;
  828. filepos : tfileposinfo;
  829. srsym : tsym;
  830. srsymtable : TSymtable;
  831. s : TIDString;
  832. begin
  833. filepos:=current_tokenpos;
  834. case token of
  835. _GOTO :
  836. begin
  837. if not(cs_support_goto in current_settings.moduleswitches)then
  838. Message(sym_e_goto_and_label_not_supported);
  839. consume(_GOTO);
  840. if (token<>_INTCONST) and (token<>_ID) then
  841. begin
  842. Message(sym_e_label_not_found);
  843. code:=cerrornode.create;
  844. end
  845. else
  846. begin
  847. if token=_ID then
  848. consume_sym(srsym,srsymtable)
  849. else
  850. begin
  851. searchsym(pattern,srsym,srsymtable);
  852. if srsym=nil then
  853. begin
  854. identifier_not_found(pattern);
  855. srsym:=generrorsym;
  856. srsymtable:=nil;
  857. end;
  858. consume(token);
  859. end;
  860. if srsym.typ<>labelsym then
  861. begin
  862. Message(sym_e_id_is_no_label_id);
  863. code:=cerrornode.create;
  864. end
  865. else
  866. begin
  867. { goto is only allowed to labels within the current scope }
  868. if srsym.owner<>current_procinfo.procdef.localst then
  869. CGMessage(parser_e_goto_outside_proc);
  870. code:=cgotonode.create_sym(tlabelsym(srsym));
  871. tgotonode(code).labelsym:=tlabelsym(srsym);
  872. { set flag that this label is used }
  873. tlabelsym(srsym).used:=true;
  874. end;
  875. end;
  876. end;
  877. _BEGIN :
  878. code:=statement_block(_BEGIN);
  879. _IF :
  880. code:=if_statement;
  881. _CASE :
  882. code:=case_statement;
  883. _REPEAT :
  884. code:=repeat_statement;
  885. _WHILE :
  886. code:=while_statement;
  887. _FOR :
  888. code:=for_statement;
  889. _WITH :
  890. code:=with_statement;
  891. _TRY :
  892. code:=try_statement;
  893. _RAISE :
  894. code:=raise_statement;
  895. { semicolons,else until and end are ignored }
  896. _SEMICOLON,
  897. _ELSE,
  898. _UNTIL,
  899. _END:
  900. code:=cnothingnode.create;
  901. _FAIL :
  902. begin
  903. if (current_procinfo.procdef.proctypeoption<>potype_constructor) then
  904. Message(parser_e_fail_only_in_constructor);
  905. consume(_FAIL);
  906. code:=call_fail_node;
  907. end;
  908. _ASM :
  909. code:=_asm_statement;
  910. _EOF :
  911. Message(scan_f_end_of_file);
  912. else
  913. begin
  914. p:=expr;
  915. { save the pattern here for latter usage, the label could be "000",
  916. even if we read an expression, the pattern is still valid if it's really
  917. a label (FK)
  918. if you want to mess here, take care of
  919. tests/webtbs/tw3546.pp
  920. }
  921. s:=pattern;
  922. { When a colon follows a intconst then transform it into a label }
  923. if (p.nodetype=ordconstn) and
  924. try_to_consume(_COLON) then
  925. begin
  926. p.free;
  927. searchsym(s,srsym,srsymtable);
  928. if assigned(srsym) and
  929. (srsym.typ=labelsym) then
  930. begin
  931. if tlabelsym(srsym).defined then
  932. Message(sym_e_label_already_defined);
  933. tlabelsym(srsym).defined:=true;
  934. p:=clabelnode.create(nil);
  935. tlabelsym(srsym).code:=p;
  936. end
  937. else
  938. begin
  939. Message1(sym_e_label_used_and_not_defined,s);
  940. p:=cnothingnode.create;
  941. end;
  942. end;
  943. if p.nodetype=labeln then
  944. begin
  945. { the pointer to the following instruction }
  946. { isn't a very clean way }
  947. if token in endtokens then
  948. tlabelnode(p).left:=cnothingnode.create
  949. else
  950. tlabelnode(p).left:=statement();
  951. { be sure to have left also typecheckpass }
  952. typecheckpass(tlabelnode(p).left);
  953. end
  954. else
  955. { change a load of a procvar to a call. this is also
  956. supported in fpc mode }
  957. if p.nodetype in [vecn,derefn,typeconvn,subscriptn,loadn] then
  958. maybe_call_procvar(p,false);
  959. { blockn support because a read/write is changed into a blocknode }
  960. { with a separate statement for each read/write operation (JM) }
  961. { the same is true for val() if the third parameter is not 32 bit }
  962. if not(p.nodetype in [nothingn,calln,ifn,assignn,breakn,inlinen,
  963. continuen,labeln,blockn,exitn]) then
  964. Message(parser_e_illegal_expression);
  965. { Specify that we don't use the value returned by the call.
  966. This is used for :
  967. - dispose of temp stack space
  968. - dispose on FPU stack }
  969. if (p.nodetype=calln) then
  970. exclude(tcallnode(p).callnodeflags,cnf_return_value_used);
  971. code:=p;
  972. end;
  973. end;
  974. if assigned(code) then
  975. begin
  976. typecheckpass(code);
  977. code.fileinfo:=filepos;
  978. end;
  979. statement:=code;
  980. end;
  981. function statement_block(starttoken : ttoken) : tnode;
  982. var
  983. first,last : tnode;
  984. filepos : tfileposinfo;
  985. begin
  986. first:=nil;
  987. filepos:=current_tokenpos;
  988. consume(starttoken);
  989. while not(token in [_END,_FINALIZATION]) do
  990. begin
  991. if first=nil then
  992. begin
  993. last:=cstatementnode.create(statement,nil);
  994. first:=last;
  995. end
  996. else
  997. begin
  998. tstatementnode(last).right:=cstatementnode.create(statement,nil);
  999. last:=tstatementnode(last).right;
  1000. end;
  1001. if (token in [_END,_FINALIZATION]) then
  1002. break
  1003. else
  1004. begin
  1005. { if no semicolon, then error and go on }
  1006. if token<>_SEMICOLON then
  1007. begin
  1008. consume(_SEMICOLON);
  1009. consume_all_until(_SEMICOLON);
  1010. end;
  1011. consume(_SEMICOLON);
  1012. end;
  1013. consume_emptystats;
  1014. end;
  1015. { don't consume the finalization token, it is consumed when
  1016. reading the finalization block, but allow it only after
  1017. an initalization ! }
  1018. if (starttoken<>_INITIALIZATION) or (token<>_FINALIZATION) then
  1019. consume(_END);
  1020. last:=cblocknode.create(first);
  1021. last.fileinfo:=filepos;
  1022. statement_block:=last;
  1023. end;
  1024. function assembler_block : tnode;
  1025. var
  1026. p : tnode;
  1027. locals : longint;
  1028. srsym : tsym;
  1029. begin
  1030. { Rename the funcret so that recursive calls are possible }
  1031. if not is_void(current_procinfo.procdef.returndef) then
  1032. begin
  1033. srsym:=TSym(current_procinfo.procdef.localst.Find(current_procinfo.procdef.procsym.name));
  1034. if assigned(srsym) then
  1035. srsym.realname:='$hiddenresult';
  1036. end;
  1037. { delphi uses register calling for assembler methods }
  1038. if (m_delphi in current_settings.modeswitches) and
  1039. (po_assembler in current_procinfo.procdef.procoptions) and
  1040. not(po_hascallingconvention in current_procinfo.procdef.procoptions) then
  1041. current_procinfo.procdef.proccalloption:=pocall_register;
  1042. { force the asm statement }
  1043. if token<>_ASM then
  1044. consume(_ASM);
  1045. include(current_procinfo.flags,pi_is_assembler);
  1046. p:=_asm_statement;
  1047. {$ifndef sparc}
  1048. {$ifndef arm}
  1049. if (po_assembler in current_procinfo.procdef.procoptions) then
  1050. begin
  1051. { set the framepointer to esp for assembler functions when the
  1052. following conditions are met:
  1053. - if the are no local variables and parameters (except the allocated result)
  1054. - no reference to the result variable (refcount<=1)
  1055. - result is not stored as parameter
  1056. - target processor has optional frame pointer save
  1057. (vm, i386, vm only currently)
  1058. }
  1059. locals:=tabstractlocalsymtable(current_procinfo.procdef.parast).count_locals;
  1060. if (current_procinfo.procdef.localst.symtabletype=localsymtable) then
  1061. inc(locals,tabstractlocalsymtable(current_procinfo.procdef.localst).count_locals);
  1062. if (locals=0) and
  1063. (current_procinfo.procdef.owner.symtabletype<>ObjectSymtable) and
  1064. (not assigned(current_procinfo.procdef.funcretsym) or
  1065. (tabstractvarsym(current_procinfo.procdef.funcretsym).refs<=1)) and
  1066. not(paramanager.ret_in_param(current_procinfo.procdef.returndef,current_procinfo.procdef.proccalloption)) then
  1067. begin
  1068. { Only need to set the framepointer, the locals will
  1069. be inserted with the correct reference in tcgasmnode.pass_generate_code }
  1070. current_procinfo.framepointer:=NR_STACK_POINTER_REG;
  1071. end;
  1072. end;
  1073. {$endif arm}
  1074. {$endif sparc}
  1075. { Flag the result as assigned when it is returned in a
  1076. register.
  1077. }
  1078. if assigned(current_procinfo.procdef.funcretsym) and
  1079. (not paramanager.ret_in_param(current_procinfo.procdef.returndef,current_procinfo.procdef.proccalloption)) then
  1080. tabstractvarsym(current_procinfo.procdef.funcretsym).varstate:=vs_initialised;
  1081. { because the END is already read we need to get the
  1082. last_endtoken_filepos here (PFV) }
  1083. last_endtoken_filepos:=current_tokenpos;
  1084. assembler_block:=p;
  1085. end;
  1086. end.