pstatmnt.pas 56 KB

1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768697071727374757677787980818283848586878889909192939495969798991001011021031041051061071081091101111121131141151161171181191201211221231241251261271281291301311321331341351361371381391401411421431441451461471481491501511521531541551561571581591601611621631641651661671681691701711721731741751761771781791801811821831841851861871881891901911921931941951961971981992002012022032042052062072082092102112122132142152162172182192202212222232242252262272282292302312322332342352362372382392402412422432442452462472482492502512522532542552562572582592602612622632642652662672682692702712722732742752762772782792802812822832842852862872882892902912922932942952962972982993003013023033043053063073083093103113123133143153163173183193203213223233243253263273283293303313323333343353363373383393403413423433443453463473483493503513523533543553563573583593603613623633643653663673683693703713723733743753763773783793803813823833843853863873883893903913923933943953963973983994004014024034044054064074084094104114124134144154164174184194204214224234244254264274284294304314324334344354364374384394404414424434444454464474484494504514524534544554564574584594604614624634644654664674684694704714724734744754764774784794804814824834844854864874884894904914924934944954964974984995005015025035045055065075085095105115125135145155165175185195205215225235245255265275285295305315325335345355365375385395405415425435445455465475485495505515525535545555565575585595605615625635645655665675685695705715725735745755765775785795805815825835845855865875885895905915925935945955965975985996006016026036046056066076086096106116126136146156166176186196206216226236246256266276286296306316326336346356366376386396406416426436446456466476486496506516526536546556566576586596606616626636646656666676686696706716726736746756766776786796806816826836846856866876886896906916926936946956966976986997007017027037047057067077087097107117127137147157167177187197207217227237247257267277287297307317327337347357367377387397407417427437447457467477487497507517527537547557567577587597607617627637647657667677687697707717727737747757767777787797807817827837847857867877887897907917927937947957967977987998008018028038048058068078088098108118128138148158168178188198208218228238248258268278288298308318328338348358368378388398408418428438448458468478488498508518528538548558568578588598608618628638648658668678688698708718728738748758768778788798808818828838848858868878888898908918928938948958968978988999009019029039049059069079089099109119129139149159169179189199209219229239249259269279289299309319329339349359369379389399409419429439449459469479489499509519529539549559569579589599609619629639649659669679689699709719729739749759769779789799809819829839849859869879889899909919929939949959969979989991000100110021003100410051006100710081009101010111012101310141015101610171018101910201021102210231024102510261027102810291030103110321033103410351036103710381039104010411042104310441045104610471048104910501051105210531054105510561057105810591060106110621063106410651066106710681069107010711072107310741075107610771078107910801081108210831084108510861087108810891090109110921093109410951096109710981099110011011102110311041105110611071108110911101111111211131114111511161117111811191120112111221123112411251126112711281129113011311132113311341135113611371138113911401141114211431144114511461147114811491150115111521153115411551156115711581159116011611162116311641165116611671168116911701171117211731174117511761177117811791180118111821183118411851186118711881189119011911192119311941195119611971198119912001201120212031204120512061207120812091210121112121213121412151216121712181219122012211222122312241225122612271228122912301231123212331234123512361237123812391240124112421243124412451246124712481249125012511252125312541255125612571258125912601261126212631264126512661267126812691270127112721273127412751276127712781279128012811282128312841285128612871288128912901291129212931294129512961297129812991300130113021303130413051306130713081309131013111312131313141315131613171318131913201321132213231324132513261327132813291330133113321333133413351336133713381339134013411342134313441345134613471348134913501351135213531354135513561357135813591360136113621363136413651366136713681369137013711372137313741375137613771378137913801381138213831384138513861387138813891390139113921393139413951396139713981399140014011402140314041405140614071408140914101411141214131414141514161417141814191420142114221423142414251426142714281429143014311432143314341435143614371438143914401441144214431444144514461447144814491450145114521453145414551456145714581459146014611462146314641465146614671468146914701471147214731474147514761477
  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,constexp,
  31. systems,
  32. { aasm }
  33. cpubase,aasmtai,aasmdata,
  34. { symtable }
  35. symconst,symbase,symtype,symdef,symsym,symtable,defutil,defcmp,
  36. paramgr,
  37. { pass 1 }
  38. pass_1,htypechk,
  39. nutils,ngenutil,nbas,ncal,nmem,nset,ncnv,ncon,nld,nflw,
  40. { parser }
  41. scanner,
  42. pbase,ptype,pexpr,
  43. { codegen }
  44. procinfo,cgbase,
  45. { assembler reader }
  46. rabase;
  47. function statement : tnode;forward;
  48. function if_statement : tnode;
  49. var
  50. ex,if_a,else_a : tnode;
  51. begin
  52. consume(_IF);
  53. ex:=comp_expr([ef_accept_equal]);
  54. consume(_THEN);
  55. if not(token in endtokens) then
  56. if_a:=statement
  57. else
  58. if_a:=nil;
  59. if try_to_consume(_ELSE) then
  60. else_a:=statement
  61. else
  62. else_a:=nil;
  63. result:=cifnode.create(ex,if_a,else_a);
  64. end;
  65. { creates a block (list) of statements, til the next END token }
  66. function statements_til_end : tnode;
  67. var
  68. first,last : tstatementnode;
  69. begin
  70. first:=nil;
  71. last:=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. sl1,sl2 : tstringconstnode;
  98. casedeferror, caseofstring : boolean;
  99. casenode : tcasenode;
  100. begin
  101. consume(_CASE);
  102. caseexpr:=comp_expr([ef_accept_equal]);
  103. { determines result type }
  104. do_typecheckpass(caseexpr);
  105. { variants must be accepted, but first they must be converted to integer }
  106. if caseexpr.resultdef.typ=variantdef then
  107. begin
  108. caseexpr:=ctypeconvnode.create_internal(caseexpr,sinttype);
  109. do_typecheckpass(caseexpr);
  110. end;
  111. set_varstate(caseexpr,vs_read,[vsf_must_be_valid]);
  112. casedeferror:=false;
  113. casedef:=caseexpr.resultdef;
  114. { case of string must be rejected in delphi-, }
  115. { tp7/bp7-, mac-compatibility modes. }
  116. caseofstring :=
  117. ([m_delphi, m_mac, m_tp7] * current_settings.modeswitches = []) and
  118. is_string(casedef);
  119. if (not assigned(casedef)) or
  120. ( not(is_ordinal(casedef)) and (not caseofstring) ) then
  121. begin
  122. CGMessage(type_e_ordinal_or_string_expr_expected);
  123. { create a correct tree }
  124. caseexpr.free;
  125. caseexpr:=cordconstnode.create(0,u32inttype,false);
  126. { set error flag so no rangechecks are done }
  127. casedeferror:=true;
  128. end;
  129. { Create casenode }
  130. casenode:=ccasenode.create(caseexpr);
  131. consume(_OF);
  132. { Parse all case blocks }
  133. blockid:=0;
  134. repeat
  135. { maybe an instruction has more case labels }
  136. repeat
  137. p:=expr(true);
  138. if is_widechar(casedef) then
  139. begin
  140. if (p.nodetype=rangen) then
  141. begin
  142. trangenode(p).left:=ctypeconvnode.create(trangenode(p).left,cwidechartype);
  143. trangenode(p).right:=ctypeconvnode.create(trangenode(p).right,cwidechartype);
  144. do_typecheckpass(trangenode(p).left);
  145. do_typecheckpass(trangenode(p).right);
  146. end
  147. else
  148. begin
  149. p:=ctypeconvnode.create(p,cwidechartype);
  150. do_typecheckpass(p);
  151. end;
  152. end
  153. else
  154. begin
  155. if is_char(casedef) and is_widechar(p.resultdef) then
  156. begin
  157. if (p.nodetype=ordconstn) then
  158. begin
  159. p:=ctypeconvnode.create(p,cansichartype);
  160. do_typecheckpass(p);
  161. end
  162. else if (p.nodetype=rangen) then
  163. begin
  164. trangenode(p).left:=ctypeconvnode.create(trangenode(p).left,cansichartype);
  165. trangenode(p).right:=ctypeconvnode.create(trangenode(p).right,cansichartype);
  166. do_typecheckpass(trangenode(p).left);
  167. do_typecheckpass(trangenode(p).right);
  168. end;
  169. end;
  170. end;
  171. hl1:=0;
  172. hl2:=0;
  173. sl1:=nil;
  174. sl2:=nil;
  175. if (p.nodetype=rangen) then
  176. begin
  177. { type check for string case statements }
  178. if caseofstring and
  179. is_conststring_or_constcharnode(trangenode(p).left) and
  180. is_conststring_or_constcharnode(trangenode(p).right) then
  181. begin
  182. { we need stringconstnodes, even if expression contains single chars }
  183. sl1 := get_string_value(trangenode(p).left, tstringdef(casedef));
  184. sl2 := get_string_value(trangenode(p).right, tstringdef(casedef));
  185. if sl1.fullcompare(sl2) > 0 then
  186. CGMessage(parser_e_case_lower_less_than_upper_bound);
  187. end
  188. { type checking for ordinal case statements }
  189. else if (not caseofstring) and
  190. is_subequal(casedef, trangenode(p).left.resultdef) and
  191. is_subequal(casedef, trangenode(p).right.resultdef) then
  192. begin
  193. hl1:=get_ordinal_value(trangenode(p).left);
  194. hl2:=get_ordinal_value(trangenode(p).right);
  195. if hl1>hl2 then
  196. CGMessage(parser_e_case_lower_less_than_upper_bound);
  197. if not casedeferror then
  198. begin
  199. testrange(casedef,hl1,false,false);
  200. testrange(casedef,hl2,false,false);
  201. end;
  202. end
  203. else
  204. CGMessage(parser_e_case_mismatch);
  205. if caseofstring then
  206. casenode.addlabel(blockid,sl1,sl2)
  207. else
  208. casenode.addlabel(blockid,hl1,hl2);
  209. end
  210. else
  211. begin
  212. { type check for string case statements }
  213. if (caseofstring and (not is_conststring_or_constcharnode(p))) or
  214. { type checking for ordinal case statements }
  215. ((not caseofstring) and (not is_subequal(casedef, p.resultdef))) then
  216. CGMessage(parser_e_case_mismatch);
  217. if caseofstring then
  218. begin
  219. sl1:=get_string_value(p, tstringdef(casedef));
  220. casenode.addlabel(blockid,sl1,sl1);
  221. end
  222. else
  223. begin
  224. hl1:=get_ordinal_value(p);
  225. if not casedeferror then
  226. testrange(casedef,hl1,false,false);
  227. casenode.addlabel(blockid,hl1,hl1);
  228. end;
  229. end;
  230. p.free;
  231. sl1.free;
  232. sl2.free;
  233. if token=_COMMA then
  234. consume(_COMMA)
  235. else
  236. break;
  237. until false;
  238. consume(_COLON);
  239. { add instruction block }
  240. casenode.addblock(blockid,statement);
  241. { next block }
  242. inc(blockid);
  243. if not(token in [_ELSE,_OTHERWISE,_END]) then
  244. consume(_SEMICOLON);
  245. until (token in [_ELSE,_OTHERWISE,_END]);
  246. if (token in [_ELSE,_OTHERWISE]) then
  247. begin
  248. if not try_to_consume(_ELSE) then
  249. consume(_OTHERWISE);
  250. casenode.addelseblock(statements_til_end);
  251. end
  252. else
  253. consume(_END);
  254. result:=casenode;
  255. end;
  256. function repeat_statement : tnode;
  257. var
  258. first,last,p_e : tnode;
  259. begin
  260. consume(_REPEAT);
  261. first:=nil;
  262. last:=nil;
  263. while token<>_UNTIL do
  264. begin
  265. if first=nil then
  266. begin
  267. last:=cstatementnode.create(statement,nil);
  268. first:=last;
  269. end
  270. else
  271. begin
  272. tstatementnode(last).right:=cstatementnode.create(statement,nil);
  273. last:=tstatementnode(last).right;
  274. end;
  275. if not try_to_consume(_SEMICOLON) then
  276. break;
  277. consume_emptystats;
  278. end;
  279. consume(_UNTIL);
  280. first:=cblocknode.create(first);
  281. p_e:=comp_expr([ef_accept_equal]);
  282. result:=cwhilerepeatnode.create(p_e,first,false,true);
  283. end;
  284. function while_statement : tnode;
  285. var
  286. p_e,p_a : tnode;
  287. begin
  288. consume(_WHILE);
  289. p_e:=comp_expr([ef_accept_equal]);
  290. consume(_DO);
  291. p_a:=statement;
  292. result:=cwhilerepeatnode.create(p_e,p_a,true,false);
  293. end;
  294. { a helper function which is used both by "with" and "for-in loop" nodes }
  295. function skip_nodes_before_load(p: tnode): tnode;
  296. begin
  297. { ignore nodes that don't add instructions in the tree }
  298. while assigned(p) and
  299. { equal type conversions }
  300. (
  301. (p.nodetype=typeconvn) and
  302. (ttypeconvnode(p).convtype=tc_equal)
  303. ) or
  304. { constant array index }
  305. (
  306. (p.nodetype=vecn) and
  307. (tvecnode(p).right.nodetype=ordconstn)
  308. ) do
  309. p:=tunarynode(p).left;
  310. result:=p;
  311. end;
  312. function for_statement : tnode;
  313. procedure check_range(hp:tnode; fordef: tdef);
  314. begin
  315. if (hp.nodetype=ordconstn) and
  316. (fordef.typ<>errordef) then
  317. testrange(fordef,tordconstnode(hp).value,false,true);
  318. end;
  319. function for_loop_create(hloopvar: tnode): tnode;
  320. var
  321. hp,
  322. hblock,
  323. hto,hfrom : tnode;
  324. backward : boolean;
  325. loopvarsym : tabstractvarsym;
  326. begin
  327. { Check loop variable }
  328. loopvarsym:=nil;
  329. { variable must be an ordinal, int64 is not allowed for 32bit targets }
  330. if (
  331. not(is_ordinal(hloopvar.resultdef))
  332. {$ifndef cpu64bitaddr}
  333. or is_64bitint(hloopvar.resultdef)
  334. {$endif not cpu64bitaddr}
  335. ) and
  336. (hloopvar.resultdef.typ<>undefineddef)
  337. then
  338. MessagePos(hloopvar.fileinfo,type_e_ordinal_expr_expected);
  339. hp:=hloopvar;
  340. while assigned(hp) and
  341. (
  342. { record/object fields and array elements are allowed }
  343. { in tp7 mode only }
  344. (
  345. (m_tp7 in current_settings.modeswitches) and
  346. (
  347. ((hp.nodetype=subscriptn) and
  348. ((tsubscriptnode(hp).left.resultdef.typ=recorddef) or
  349. is_object(tsubscriptnode(hp).left.resultdef))
  350. ) or
  351. { constant array index }
  352. (
  353. (hp.nodetype=vecn) and
  354. is_constintnode(tvecnode(hp).right)
  355. )
  356. )
  357. ) or
  358. { equal typeconversions }
  359. (
  360. (hp.nodetype=typeconvn) and
  361. (ttypeconvnode(hp).convtype=tc_equal)
  362. )
  363. ) do
  364. begin
  365. { Use the recordfield for loopvarsym }
  366. if not assigned(loopvarsym) and
  367. (hp.nodetype=subscriptn) then
  368. loopvarsym:=tsubscriptnode(hp).vs;
  369. hp:=tunarynode(hp).left;
  370. end;
  371. if assigned(hp) and
  372. (hp.nodetype=loadn) then
  373. begin
  374. case tloadnode(hp).symtableentry.typ of
  375. staticvarsym,
  376. localvarsym,
  377. paravarsym :
  378. begin
  379. { we need a simple loadn:
  380. 1. The load must be in a global symtable or
  381. in the same level as the para of the current proc.
  382. 2. value variables (no const,out or var)
  383. 3. No threadvar, readonly or typedconst
  384. }
  385. if (
  386. (tloadnode(hp).symtable.symtablelevel=main_program_level) or
  387. (tloadnode(hp).symtable.symtablelevel=current_procinfo.procdef.parast.symtablelevel)
  388. ) and
  389. (tabstractvarsym(tloadnode(hp).symtableentry).varspez=vs_value) and
  390. ([vo_is_thread_var,vo_is_typed_const] * tabstractvarsym(tloadnode(hp).symtableentry).varoptions=[]) then
  391. begin
  392. { Assigning for-loop variable is only allowed in tp7 and macpas }
  393. if ([m_tp7,m_mac] * current_settings.modeswitches = []) then
  394. begin
  395. if not assigned(loopvarsym) then
  396. loopvarsym:=tabstractvarsym(tloadnode(hp).symtableentry);
  397. include(loopvarsym.varoptions,vo_is_loop_counter);
  398. end;
  399. end
  400. else
  401. begin
  402. { Typed const is allowed in tp7 }
  403. if not(m_tp7 in current_settings.modeswitches) or
  404. not(vo_is_typed_const in tabstractvarsym(tloadnode(hp).symtableentry).varoptions) then
  405. MessagePos(hp.fileinfo,type_e_illegal_count_var);
  406. end;
  407. end;
  408. else
  409. MessagePos(hp.fileinfo,type_e_illegal_count_var);
  410. end;
  411. end
  412. else
  413. MessagePos(hloopvar.fileinfo,type_e_illegal_count_var);
  414. hfrom:=comp_expr([ef_accept_equal]);
  415. if try_to_consume(_DOWNTO) then
  416. backward:=true
  417. else
  418. begin
  419. consume(_TO);
  420. backward:=false;
  421. end;
  422. hto:=comp_expr([ef_accept_equal]);
  423. consume(_DO);
  424. { Check if the constants fit in the range }
  425. check_range(hfrom,hloopvar.resultdef);
  426. check_range(hto,hloopvar.resultdef);
  427. { first set the varstate for from and to, so
  428. uses of loopvar in those expressions will also
  429. trigger a warning when it is not used yet. This
  430. needs to be done before the instruction block is
  431. parsed to have a valid hloopvar }
  432. typecheckpass(hfrom);
  433. set_varstate(hfrom,vs_read,[vsf_must_be_valid]);
  434. typecheckpass(hto);
  435. set_varstate(hto,vs_read,[vsf_must_be_valid]);
  436. typecheckpass(hloopvar);
  437. { in two steps, because vs_readwritten may turn on vsf_must_be_valid }
  438. { for some subnodes }
  439. set_varstate(hloopvar,vs_written,[]);
  440. set_varstate(hloopvar,vs_read,[vsf_must_be_valid]);
  441. { ... now the instruction block }
  442. hblock:=statement;
  443. { variable is not used for loop counter anymore }
  444. if assigned(loopvarsym) then
  445. exclude(loopvarsym.varoptions,vo_is_loop_counter);
  446. result:=cfornode.create(hloopvar,hfrom,hto,hblock,backward);
  447. end;
  448. function for_in_loop_create(hloopvar: tnode): tnode;
  449. var
  450. expr,hloopbody,hp: tnode;
  451. loopvarsym: tabstractvarsym;
  452. begin
  453. hp:=skip_nodes_before_load(hloopvar);
  454. if assigned(hp)and(hp.nodetype=loadn) then
  455. begin
  456. loopvarsym:=tabstractvarsym(tloadnode(hp).symtableentry);
  457. include(loopvarsym.varoptions,vo_is_loop_counter);
  458. end
  459. else
  460. loopvarsym:=nil;
  461. expr:=comp_expr([ef_accept_equal]);
  462. consume(_DO);
  463. set_varstate(hloopvar,vs_written,[]);
  464. set_varstate(hloopvar,vs_read,[vsf_must_be_valid]);
  465. hloopbody:=statement;
  466. if assigned(loopvarsym) then
  467. exclude(loopvarsym.varoptions,vo_is_loop_counter);
  468. result:=create_for_in_loop(hloopvar,hloopbody,expr);
  469. expr.free;
  470. end;
  471. var
  472. hloopvar: tnode;
  473. begin
  474. { parse loop header }
  475. consume(_FOR);
  476. hloopvar:=factor(false,[]);
  477. valid_for_loopvar(hloopvar,true);
  478. if try_to_consume(_ASSIGNMENT) then
  479. result:=for_loop_create(hloopvar)
  480. else if try_to_consume(_IN) then
  481. result:=for_in_loop_create(hloopvar)
  482. else
  483. begin
  484. consume(_ASSIGNMENT); // fail
  485. result:=cerrornode.create;
  486. end;
  487. end;
  488. function _with_statement : tnode;
  489. var
  490. p : tnode;
  491. i : longint;
  492. st : TSymtable;
  493. newblock : tblocknode;
  494. newstatement : tstatementnode;
  495. calltempnode,
  496. tempnode : ttempcreatenode;
  497. valuenode,
  498. hp,
  499. refnode : tnode;
  500. hdef : tdef;
  501. helperdef : tobjectdef;
  502. hasimplicitderef : boolean;
  503. withsymtablelist : TFPObjectList;
  504. procedure pushobjchild(withdef,obj:tobjectdef);
  505. var
  506. parenthelperdef : tobjectdef;
  507. begin
  508. if not assigned(obj) then
  509. exit;
  510. pushobjchild(withdef,obj.childof);
  511. { we need to look for helpers that were defined for the parent
  512. class as well }
  513. search_last_objectpascal_helper(obj,current_structdef,parenthelperdef);
  514. { push the symtables of the helper's parents in reverse order }
  515. if assigned(parenthelperdef) then
  516. pushobjchild(withdef,parenthelperdef.childof);
  517. { keep the original tobjectdef as owner, because that is used for
  518. visibility of the symtable }
  519. st:=twithsymtable.create(withdef,obj.symtable.SymList,refnode.getcopy);
  520. symtablestack.push(st);
  521. withsymtablelist.add(st);
  522. { push the symtable of the helper }
  523. if assigned(parenthelperdef) then
  524. begin
  525. st:=twithsymtable.create(withdef,parenthelperdef.symtable.SymList,refnode.getcopy);
  526. symtablestack.push(st);
  527. withsymtablelist.add(st);
  528. end;
  529. end;
  530. begin
  531. calltempnode:=nil;
  532. p:=comp_expr([ef_accept_equal]);
  533. do_typecheckpass(p);
  534. if (p.nodetype=vecn) and
  535. (nf_memseg in p.flags) then
  536. CGMessage(parser_e_no_with_for_variable_in_other_segments);
  537. { "with procvar" can never mean anything, so always try
  538. to call it in case it returns a record/object/... }
  539. maybe_call_procvar(p,false);
  540. if (p.resultdef.typ in [objectdef,recorddef,classrefdef]) or
  541. ((p.resultdef.typ=undefineddef) and (df_generic in current_procinfo.procdef.defoptions)) then
  542. begin
  543. newblock:=nil;
  544. valuenode:=nil;
  545. tempnode:=nil;
  546. hp:=skip_nodes_before_load(p);
  547. if (hp.nodetype=loadn) and
  548. (
  549. (tloadnode(hp).symtable=current_procinfo.procdef.localst) or
  550. (tloadnode(hp).symtable=current_procinfo.procdef.parast) or
  551. (tloadnode(hp).symtable.symtabletype in [staticsymtable,globalsymtable])
  552. ) and
  553. { MacPas objects are mapped to classes, and the MacPas compilers
  554. interpret with-statements with MacPas objects the same way
  555. as records (the object referenced by the with-statement
  556. must remain constant)
  557. }
  558. not(is_class(hp.resultdef) and
  559. (m_mac in current_settings.modeswitches)) then
  560. begin
  561. { simple load, we can reference direct }
  562. refnode:=p;
  563. end
  564. else
  565. begin
  566. { complex load, load in temp first }
  567. newblock:=internalstatements(newstatement);
  568. { when we can't take the address of p, load it in a temp }
  569. { since we may need its address later on }
  570. if not valid_for_addr(p,false) then
  571. begin
  572. calltempnode:=ctempcreatenode.create(p.resultdef,p.resultdef.size,tt_persistent,true);
  573. addstatement(newstatement,calltempnode);
  574. addstatement(newstatement,cassignmentnode.create(
  575. ctemprefnode.create(calltempnode),
  576. p));
  577. p:=ctemprefnode.create(calltempnode);
  578. typecheckpass(p);
  579. end;
  580. { several object types have implicit dereferencing }
  581. { is_implicit_pointer_object_type() returns true for records
  582. on the JVM target because they are implemented as classes
  583. there, but we definitely have to take their address here
  584. since otherwise a deep copy is made and changes are made to
  585. this copy rather than to the original one }
  586. hasimplicitderef:=
  587. (is_implicit_pointer_object_type(p.resultdef) or
  588. (p.resultdef.typ=classrefdef)) and
  589. not((target_info.system in systems_jvm) and
  590. ((p.resultdef.typ=recorddef) or
  591. is_object(p.resultdef)));
  592. if hasimplicitderef then
  593. hdef:=p.resultdef
  594. else
  595. hdef:=cpointerdef.create(p.resultdef);
  596. { load address of the value in a temp }
  597. tempnode:=ctempcreatenode.create_withnode(hdef,sizeof(pint),tt_persistent,true,p);
  598. typecheckpass(tnode(tempnode));
  599. valuenode:=p;
  600. refnode:=ctemprefnode.create(tempnode);
  601. fillchar(refnode.fileinfo,sizeof(tfileposinfo),0);
  602. { add address call for valuenode and deref for refnode if this
  603. is not done implicitly }
  604. if not hasimplicitderef then
  605. begin
  606. valuenode:=caddrnode.create_internal_nomark(valuenode);
  607. include(taddrnode(valuenode).addrnodeflags,anf_typedaddr);
  608. refnode:=cderefnode.create(refnode);
  609. fillchar(refnode.fileinfo,sizeof(tfileposinfo),0);
  610. end;
  611. addstatement(newstatement,tempnode);
  612. addstatement(newstatement,cassignmentnode.create(
  613. ctemprefnode.create(tempnode),
  614. valuenode));
  615. typecheckpass(refnode);
  616. end;
  617. { Note: the symtable of the helper is pushed after the following
  618. "case", the symtables of the helper's parents are passed in
  619. the "case" branches }
  620. withsymtablelist:=TFPObjectList.create(true);
  621. case p.resultdef.typ of
  622. objectdef :
  623. begin
  624. { do we have a helper for this type? }
  625. search_last_objectpascal_helper(tabstractrecorddef(p.resultdef),current_structdef,helperdef);
  626. { push symtables of all parents in reverse order }
  627. pushobjchild(tobjectdef(p.resultdef),tobjectdef(p.resultdef).childof);
  628. { push symtables of all parents of the helper in reverse order }
  629. if assigned(helperdef) then
  630. pushobjchild(helperdef,helperdef.childof);
  631. { push object symtable }
  632. st:=twithsymtable.Create(tobjectdef(p.resultdef),tobjectdef(p.resultdef).symtable.SymList,refnode);
  633. symtablestack.push(st);
  634. withsymtablelist.add(st);
  635. end;
  636. classrefdef :
  637. begin
  638. { do we have a helper for this type? }
  639. search_last_objectpascal_helper(tobjectdef(tclassrefdef(p.resultdef).pointeddef),current_structdef,helperdef);
  640. { push symtables of all parents in reverse order }
  641. pushobjchild(tobjectdef(tclassrefdef(p.resultdef).pointeddef),tobjectdef(tclassrefdef(p.resultdef).pointeddef).childof);
  642. { push symtables of all parents of the helper in reverse order }
  643. if assigned(helperdef) then
  644. pushobjchild(helperdef,helperdef.childof);
  645. { push object symtable }
  646. st:=twithsymtable.Create(tobjectdef(tclassrefdef(p.resultdef).pointeddef),tobjectdef(tclassrefdef(p.resultdef).pointeddef).symtable.SymList,refnode);
  647. symtablestack.push(st);
  648. withsymtablelist.add(st);
  649. end;
  650. recorddef :
  651. begin
  652. { do we have a helper for this type? }
  653. search_last_objectpascal_helper(tabstractrecorddef(p.resultdef),current_structdef,helperdef);
  654. { push symtables of all parents of the helper in reverse order }
  655. if assigned(helperdef) then
  656. pushobjchild(helperdef,helperdef.childof);
  657. { push record symtable }
  658. st:=twithsymtable.create(trecorddef(p.resultdef),trecorddef(p.resultdef).symtable.SymList,refnode);
  659. symtablestack.push(st);
  660. withsymtablelist.add(st);
  661. end;
  662. undefineddef :
  663. begin
  664. if not(df_generic in current_procinfo.procdef.defoptions) then
  665. internalerror(2012122802);
  666. helperdef:=nil;
  667. { push record symtable }
  668. st:=twithsymtable.create(p.resultdef,nil,refnode);
  669. symtablestack.push(st);
  670. withsymtablelist.add(st);
  671. end;
  672. else
  673. internalerror(200601271);
  674. end;
  675. { push helper symtable }
  676. if assigned(helperdef) then
  677. begin
  678. st:=twithsymtable.Create(helperdef,helperdef.symtable.SymList,refnode.getcopy);
  679. symtablestack.push(st);
  680. withsymtablelist.add(st);
  681. end;
  682. if try_to_consume(_COMMA) then
  683. p:=_with_statement()
  684. else
  685. begin
  686. consume(_DO);
  687. if token<>_SEMICOLON then
  688. p:=statement
  689. else
  690. p:=cnothingnode.create;
  691. end;
  692. { remove symtables in reverse order from the stack }
  693. for i:=withsymtablelist.count-1 downto 0 do
  694. symtablestack.pop(TSymtable(withsymtablelist[i]));
  695. withsymtablelist.free;
  696. { Finalize complex withnode with destroy of temp }
  697. if assigned(newblock) then
  698. begin
  699. addstatement(newstatement,p);
  700. if assigned(tempnode) then
  701. addstatement(newstatement,ctempdeletenode.create(tempnode));
  702. if assigned(calltempnode) then
  703. addstatement(newstatement,ctempdeletenode.create(calltempnode));
  704. p:=newblock;
  705. end;
  706. result:=p;
  707. end
  708. else
  709. begin
  710. p.free;
  711. Message1(parser_e_false_with_expr,p.resultdef.GetTypeName);
  712. { try to recover from error }
  713. if try_to_consume(_COMMA) then
  714. begin
  715. hp:=_with_statement();
  716. if (hp=nil) then; { remove warning about unused }
  717. end
  718. else
  719. begin
  720. consume(_DO);
  721. { ignore all }
  722. if token<>_SEMICOLON then
  723. statement;
  724. end;
  725. result:=nil;
  726. end;
  727. end;
  728. function with_statement : tnode;
  729. begin
  730. consume(_WITH);
  731. with_statement:=_with_statement();
  732. end;
  733. function raise_statement : tnode;
  734. var
  735. p,pobj,paddr,pframe : tnode;
  736. begin
  737. pobj:=nil;
  738. paddr:=nil;
  739. pframe:=nil;
  740. consume(_RAISE);
  741. if not(token in endtokens) then
  742. begin
  743. { object }
  744. pobj:=comp_expr([ef_accept_equal]);
  745. if try_to_consume(_AT) then
  746. begin
  747. paddr:=comp_expr([ef_accept_equal]);
  748. if try_to_consume(_COMMA) then
  749. pframe:=comp_expr([ef_accept_equal]);
  750. end;
  751. end
  752. else
  753. begin
  754. if (block_type<>bt_except) then
  755. Message(parser_e_no_reraise_possible);
  756. end;
  757. p:=craisenode.create(pobj,paddr,pframe);
  758. raise_statement:=p;
  759. end;
  760. function try_statement : tnode;
  761. procedure check_type_valid(var def: tdef);
  762. begin
  763. if not (is_class(def) or is_javaclass(def) or
  764. { skip showing error message the second time }
  765. (def.typ=errordef)) then
  766. begin
  767. Message1(type_e_class_type_expected,def.typename);
  768. def:=generrordef;
  769. end;
  770. end;
  771. var
  772. p_try_block,p_finally_block,first,last,
  773. p_default,p_specific,hp : tnode;
  774. ot : tDef;
  775. sym : tlocalvarsym;
  776. old_block_type : tblock_type;
  777. excepTSymtable : TSymtable;
  778. objname,objrealname : TIDString;
  779. srsym : tsym;
  780. srsymtable : TSymtable;
  781. t:ttoken;
  782. unit_found:boolean;
  783. oldcurrent_exceptblock: integer;
  784. filepostry : tfileposinfo;
  785. begin
  786. p_default:=nil;
  787. p_specific:=nil;
  788. excepTSymtable:=nil;
  789. last:=nil;
  790. { read statements to try }
  791. consume(_TRY);
  792. filepostry:=current_filepos;
  793. first:=nil;
  794. inc(exceptblockcounter);
  795. oldcurrent_exceptblock := current_exceptblock;
  796. current_exceptblock := exceptblockcounter;
  797. old_block_type := block_type;
  798. block_type := bt_body;
  799. while (token<>_FINALLY) and (token<>_EXCEPT) do
  800. begin
  801. if first=nil then
  802. begin
  803. last:=cstatementnode.create(statement,nil);
  804. first:=last;
  805. end
  806. else
  807. begin
  808. tstatementnode(last).right:=cstatementnode.create(statement,nil);
  809. last:=tstatementnode(last).right;
  810. end;
  811. if not try_to_consume(_SEMICOLON) then
  812. break;
  813. consume_emptystats;
  814. end;
  815. p_try_block:=cblocknode.create(first);
  816. if try_to_consume(_FINALLY) then
  817. begin
  818. inc(exceptblockcounter);
  819. current_exceptblock := exceptblockcounter;
  820. p_finally_block:=statements_til_end;
  821. try_statement:=ctryfinallynode.create(p_try_block,p_finally_block);
  822. try_statement.fileinfo:=filepostry;
  823. end
  824. else
  825. begin
  826. consume(_EXCEPT);
  827. block_type:=bt_except;
  828. inc(exceptblockcounter);
  829. current_exceptblock := exceptblockcounter;
  830. ot:=generrordef;
  831. p_specific:=nil;
  832. if (idtoken=_ON) then
  833. { catch specific exceptions }
  834. begin
  835. repeat
  836. consume(_ON);
  837. if token=_ID then
  838. begin
  839. objname:=pattern;
  840. objrealname:=orgpattern;
  841. { can't use consume_sym here, because we need already
  842. to check for the colon }
  843. searchsym(objname,srsym,srsymtable);
  844. consume(_ID);
  845. { is a explicit name for the exception given ? }
  846. if try_to_consume(_COLON) then
  847. begin
  848. single_type(ot,[]);
  849. check_type_valid(ot);
  850. sym:=clocalvarsym.create(objrealname,vs_value,ot,[],true);
  851. end
  852. else
  853. begin
  854. { check if type is valid, must be done here because
  855. with "e: Exception" the e is not necessary }
  856. { support unit.identifier }
  857. unit_found:=try_consume_unitsym_no_specialize(srsym,srsymtable,t,false,objname);
  858. if srsym=nil then
  859. begin
  860. identifier_not_found(orgpattern);
  861. srsym:=generrorsym;
  862. end;
  863. if unit_found then
  864. consume(t);
  865. { check if type is valid, must be done here because
  866. with "e: Exception" the e is not necessary }
  867. if (srsym.typ=typesym) then
  868. begin
  869. ot:=ttypesym(srsym).typedef;
  870. parse_nested_types(ot,false,false,nil);
  871. check_type_valid(ot);
  872. end
  873. else
  874. begin
  875. Message(type_e_type_id_expected);
  876. ot:=generrordef;
  877. end;
  878. { create dummy symbol so we don't need a special
  879. case in ncgflw, and so that we always know the
  880. type }
  881. sym:=clocalvarsym.create('$exceptsym',vs_value,ot,[],true);
  882. end;
  883. excepTSymtable:=tstt_excepTSymtable.create;
  884. excepTSymtable.insert(sym);
  885. symtablestack.push(excepTSymtable);
  886. end
  887. else
  888. consume(_ID);
  889. consume(_DO);
  890. hp:=connode.create(nil,statement);
  891. if ot.typ=errordef then
  892. begin
  893. hp.free;
  894. hp:=cerrornode.create;
  895. end;
  896. if p_specific=nil then
  897. begin
  898. last:=hp;
  899. p_specific:=last;
  900. end
  901. else
  902. begin
  903. tonnode(last).left:=hp;
  904. last:=tonnode(last).left;
  905. end;
  906. { set the informations }
  907. { only if the creation of the onnode was succesful, it's possible }
  908. { that last and hp are errornodes (JM) }
  909. if last.nodetype = onn then
  910. begin
  911. tonnode(last).excepttype:=tobjectdef(ot);
  912. tonnode(last).excepTSymtable:=excepTSymtable;
  913. end;
  914. { remove exception symtable }
  915. if assigned(excepTSymtable) then
  916. begin
  917. symtablestack.pop(excepTSymtable);
  918. if last.nodetype <> onn then
  919. excepTSymtable.free;
  920. end;
  921. if not try_to_consume(_SEMICOLON) then
  922. break;
  923. consume_emptystats;
  924. until (token in [_END,_ELSE]);
  925. if try_to_consume(_ELSE) then
  926. begin
  927. { catch the other exceptions }
  928. p_default:=statements_til_end;
  929. end
  930. else
  931. consume(_END);
  932. end
  933. else
  934. begin
  935. { catch all exceptions }
  936. p_default:=statements_til_end;
  937. end;
  938. try_statement:=ctryexceptnode.create(p_try_block,p_specific,p_default);
  939. end;
  940. block_type:=old_block_type;
  941. current_exceptblock := oldcurrent_exceptblock;
  942. end;
  943. function _asm_statement : tnode;
  944. var
  945. asmstat : tasmnode;
  946. reg : tregister;
  947. asmreader : tbaseasmreader;
  948. entrypos : tfileposinfo;
  949. hl : TAsmList;
  950. begin
  951. Inside_asm_statement:=true;
  952. asmstat:=nil;
  953. hl:=nil;
  954. if assigned(asmmodeinfos[current_settings.asmmode]) then
  955. begin
  956. asmreader:=asmmodeinfos[current_settings.asmmode]^.casmreader.create;
  957. entrypos:=current_filepos;
  958. hl:=asmreader.assemble as TAsmList;
  959. if (not hl.empty) then
  960. begin
  961. { mark boundaries of assembler block, this is necessary for optimizer }
  962. hl.insert(tai_marker.create(mark_asmblockstart));
  963. hl.concat(tai_marker.create(mark_asmblockend));
  964. end;
  965. asmstat:=casmnode.create(hl);
  966. asmstat.fileinfo:=entrypos;
  967. asmreader.free;
  968. end
  969. else
  970. Message(parser_f_assembler_reader_not_supported);
  971. { Mark procedure that it has assembler blocks }
  972. include(current_procinfo.flags,pi_has_assembler_block);
  973. { Read first the _ASM statement }
  974. consume(_ASM);
  975. { Force an empty register list for pure assembler routines,
  976. so that pass2 won't allocate volatile registers for them. }
  977. asmstat.has_registerlist:=(po_assembler in current_procinfo.procdef.procoptions);
  978. { END is read, got a list of changed registers? }
  979. if try_to_consume(_LECKKLAMMER) then
  980. begin
  981. if token<>_RECKKLAMMER then
  982. begin
  983. if po_assembler in current_procinfo.procdef.procoptions then
  984. Message(parser_w_register_list_ignored);
  985. repeat
  986. { it's possible to specify the modified registers }
  987. reg:=std_regnum_search(lower(cstringpattern));
  988. if reg<>NR_NO then
  989. begin
  990. if not(po_assembler in current_procinfo.procdef.procoptions) and assigned(hl) then
  991. begin
  992. hl.Insert(tai_regalloc.alloc(reg,nil));
  993. hl.Insert(tai_regalloc.markused(reg));
  994. hl.Concat(tai_regalloc.dealloc(reg,nil));
  995. end;
  996. end
  997. else
  998. Message(asmr_e_invalid_register);
  999. consume(_CSTRING);
  1000. if not try_to_consume(_COMMA) then
  1001. break;
  1002. until false;
  1003. asmstat.has_registerlist:=true;
  1004. end;
  1005. consume(_RECKKLAMMER);
  1006. end;
  1007. Inside_asm_statement:=false;
  1008. _asm_statement:=asmstat;
  1009. end;
  1010. function statement : tnode;
  1011. var
  1012. p,
  1013. code : tnode;
  1014. filepos : tfileposinfo;
  1015. srsym : tsym;
  1016. srsymtable : TSymtable;
  1017. s : TIDString;
  1018. begin
  1019. filepos:=current_tokenpos;
  1020. code:=nil;
  1021. case token of
  1022. _GOTO :
  1023. begin
  1024. if not(cs_support_goto in current_settings.moduleswitches) then
  1025. Message(sym_e_goto_and_label_not_supported);
  1026. consume(_GOTO);
  1027. if (token<>_INTCONST) and (token<>_ID) then
  1028. begin
  1029. Message(sym_e_label_not_found);
  1030. code:=cerrornode.create;
  1031. end
  1032. else
  1033. begin
  1034. if token=_ID then
  1035. consume_sym(srsym,srsymtable)
  1036. else
  1037. begin
  1038. if token<>_INTCONST then
  1039. internalerror(201008021);
  1040. { strip leading 0's in iso mode }
  1041. if (([m_iso,m_extpas]*current_settings.modeswitches)<>[]) then
  1042. while pattern[1]='0' do
  1043. delete(pattern,1,1);
  1044. searchsym(pattern,srsym,srsymtable);
  1045. if srsym=nil then
  1046. begin
  1047. identifier_not_found(pattern);
  1048. srsym:=generrorsym;
  1049. srsymtable:=nil;
  1050. end;
  1051. consume(token);
  1052. end;
  1053. if srsym.typ<>labelsym then
  1054. begin
  1055. Message(sym_e_id_is_no_label_id);
  1056. code:=cerrornode.create;
  1057. end
  1058. else
  1059. begin
  1060. { goto outside the current scope? }
  1061. if srsym.owner<>current_procinfo.procdef.localst then
  1062. begin
  1063. { allowed? }
  1064. if not(m_non_local_goto in current_settings.modeswitches) then
  1065. Message(parser_e_goto_outside_proc);
  1066. include(current_procinfo.flags,pi_has_global_goto);
  1067. end;
  1068. code:=cgotonode.create(tlabelsym(srsym));
  1069. tgotonode(code).labelsym:=tlabelsym(srsym);
  1070. { set flag that this label is used }
  1071. tlabelsym(srsym).used:=true;
  1072. end;
  1073. end;
  1074. end;
  1075. _BEGIN :
  1076. code:=statement_block(_BEGIN);
  1077. _IF :
  1078. code:=if_statement;
  1079. _CASE :
  1080. code:=case_statement;
  1081. _REPEAT :
  1082. code:=repeat_statement;
  1083. _WHILE :
  1084. code:=while_statement;
  1085. _FOR :
  1086. code:=for_statement;
  1087. _WITH :
  1088. code:=with_statement;
  1089. _TRY :
  1090. code:=try_statement;
  1091. _RAISE :
  1092. code:=raise_statement;
  1093. { semicolons,else until and end are ignored }
  1094. _SEMICOLON,
  1095. _ELSE,
  1096. _UNTIL,
  1097. _END:
  1098. code:=cnothingnode.create;
  1099. _FAIL :
  1100. begin
  1101. if (current_procinfo.procdef.proctypeoption<>potype_constructor) then
  1102. Message(parser_e_fail_only_in_constructor);
  1103. consume(_FAIL);
  1104. code:=cnodeutils.call_fail_node;
  1105. end;
  1106. _ASM :
  1107. begin
  1108. if parse_generic then
  1109. Message(parser_e_no_assembler_in_generic);
  1110. code:=_asm_statement;
  1111. end;
  1112. _PLUS:
  1113. begin
  1114. Message(parser_e_syntax_error);
  1115. consume(_PLUS);
  1116. end;
  1117. _EOF :
  1118. Message(scan_f_end_of_file);
  1119. else
  1120. begin
  1121. { don't typecheck yet, because that will also simplify, which may
  1122. result in not detecting certain kinds of syntax errors --
  1123. see mantis #15594 }
  1124. p:=expr(false);
  1125. { save the pattern here for latter usage, the label could be "000",
  1126. even if we read an expression, the pattern is still valid if it's really
  1127. a label (FK)
  1128. if you want to mess here, take care of
  1129. tests/webtbs/tw3546.pp
  1130. }
  1131. s:=pattern;
  1132. { When a colon follows a intconst then transform it into a label }
  1133. if (p.nodetype=ordconstn) and
  1134. try_to_consume(_COLON) then
  1135. begin
  1136. { in iso mode, 0003: is equal to 3: }
  1137. if (([m_iso,m_extpas]*current_settings.modeswitches)<>[]) then
  1138. searchsym(tostr(tordconstnode(p).value),srsym,srsymtable)
  1139. else
  1140. searchsym(s,srsym,srsymtable);
  1141. p.free;
  1142. if assigned(srsym) and
  1143. (srsym.typ=labelsym) then
  1144. begin
  1145. if tlabelsym(srsym).defined then
  1146. Message(sym_e_label_already_defined);
  1147. if symtablestack.top.symtablelevel<>srsymtable.symtablelevel then
  1148. begin
  1149. tlabelsym(srsym).nonlocal:=true;
  1150. include(current_procinfo.flags,pi_has_interproclabel);
  1151. end;
  1152. if tlabelsym(srsym).nonlocal and
  1153. (current_procinfo.procdef.proctypeoption in [potype_unitinit,potype_unitfinalize]) then
  1154. Message(sym_e_interprocgoto_into_init_final_code_not_allowed);
  1155. tlabelsym(srsym).defined:=true;
  1156. p:=clabelnode.create(nil,tlabelsym(srsym));
  1157. tlabelsym(srsym).code:=p;
  1158. end
  1159. else
  1160. begin
  1161. Message1(sym_e_label_used_and_not_defined,s);
  1162. p:=cnothingnode.create;
  1163. end;
  1164. end;
  1165. if p.nodetype=labeln then
  1166. begin
  1167. { the pointer to the following instruction }
  1168. { isn't a very clean way }
  1169. if token in endtokens then
  1170. tlabelnode(p).left:=cnothingnode.create
  1171. else
  1172. tlabelnode(p).left:=statement();
  1173. { be sure to have left also typecheckpass }
  1174. typecheckpass(tlabelnode(p).left);
  1175. end
  1176. else
  1177. { change a load of a procvar to a call. this is also
  1178. supported in fpc mode }
  1179. if p.nodetype in [vecn,derefn,typeconvn,subscriptn,loadn] then
  1180. maybe_call_procvar(p,false);
  1181. { blockn support because a read/write is changed into a blocknode
  1182. with a separate statement for each read/write operation (JM)
  1183. the same is true for val() if the third parameter is not 32 bit
  1184. goto nodes are created by the compiler for non local exit statements, so
  1185. include them as well
  1186. }
  1187. if not(p.nodetype in [nothingn,errorn,calln,ifn,assignn,breakn,inlinen,
  1188. continuen,labeln,blockn,exitn,goton]) or
  1189. ((p.nodetype=inlinen) and
  1190. not is_void(p.resultdef)) or
  1191. ((p.nodetype=calln) and
  1192. (assigned(tcallnode(p).procdefinition)) and
  1193. (tcallnode(p).procdefinition.proctypeoption=potype_operator)) then
  1194. Message(parser_e_illegal_expression);
  1195. if not assigned(p.resultdef) then
  1196. do_typecheckpass(p);
  1197. { Specify that we don't use the value returned by the call.
  1198. This is used for :
  1199. - dispose of temp stack space
  1200. - dispose on FPU stack
  1201. - extended syntax checking }
  1202. if (p.nodetype=calln) then
  1203. begin
  1204. exclude(tcallnode(p).callnodeflags,cnf_return_value_used);
  1205. { in $x- state, the function result must not be ignored }
  1206. if not(cs_extsyntax in current_settings.moduleswitches) and
  1207. not(is_void(p.resultdef)) and
  1208. { can be nil in case there was an error in the expression }
  1209. assigned(tcallnode(p).procdefinition) and
  1210. { allow constructor calls to drop the result if they are
  1211. called as instance methods instead of class methods }
  1212. not(
  1213. (tcallnode(p).procdefinition.proctypeoption=potype_constructor) and
  1214. is_class_or_object(tprocdef(tcallnode(p).procdefinition).struct) and
  1215. assigned(tcallnode(p).methodpointer) and
  1216. (tnode(tcallnode(p).methodpointer).resultdef.typ=objectdef)
  1217. ) then
  1218. Message(parser_e_illegal_expression);
  1219. end;
  1220. code:=p;
  1221. end;
  1222. end;
  1223. if assigned(code) then
  1224. begin
  1225. typecheckpass(code);
  1226. code.fileinfo:=filepos;
  1227. end;
  1228. statement:=code;
  1229. end;
  1230. function statement_block(starttoken : ttoken) : tnode;
  1231. var
  1232. first,last : tnode;
  1233. filepos : tfileposinfo;
  1234. begin
  1235. first:=nil;
  1236. last:=nil;
  1237. filepos:=current_tokenpos;
  1238. consume(starttoken);
  1239. while not((token=_END) or (token=_FINALIZATION)) do
  1240. begin
  1241. if first=nil then
  1242. begin
  1243. last:=cstatementnode.create(statement,nil);
  1244. first:=last;
  1245. end
  1246. else
  1247. begin
  1248. tstatementnode(last).right:=cstatementnode.create(statement,nil);
  1249. last:=tstatementnode(last).right;
  1250. end;
  1251. if ((token=_END) or (token=_FINALIZATION)) then
  1252. break
  1253. else
  1254. begin
  1255. { if no semicolon, then error and go on }
  1256. if token<>_SEMICOLON then
  1257. begin
  1258. consume(_SEMICOLON);
  1259. consume_all_until(_SEMICOLON);
  1260. end;
  1261. consume(_SEMICOLON);
  1262. end;
  1263. consume_emptystats;
  1264. end;
  1265. { don't consume the finalization token, it is consumed when
  1266. reading the finalization block, but allow it only after
  1267. an initalization ! }
  1268. if (starttoken<>_INITIALIZATION) or (token<>_FINALIZATION) then
  1269. consume(_END);
  1270. last:=cblocknode.create(first);
  1271. last.fileinfo:=filepos;
  1272. statement_block:=last;
  1273. end;
  1274. function assembler_block : tnode;
  1275. var
  1276. p : tnode;
  1277. {$if not(defined(sparcgen)) and not(defined(arm)) and not(defined(avr)) and not(defined(mips))}
  1278. locals : longint;
  1279. {$endif not(defined(sparcgen)) and not(defined(arm)) and not(defined(avr)) and not(defined(mips))}
  1280. srsym : tsym;
  1281. begin
  1282. if parse_generic then
  1283. message(parser_e_no_assembler_in_generic);
  1284. { Rename the funcret so that recursive calls are possible }
  1285. if not is_void(current_procinfo.procdef.returndef) then
  1286. begin
  1287. srsym:=TSym(current_procinfo.procdef.localst.Find(current_procinfo.procdef.procsym.name));
  1288. if assigned(srsym) then
  1289. srsym.realname:='$hiddenresult';
  1290. end;
  1291. { delphi uses register calling for assembler methods }
  1292. if (m_delphi in current_settings.modeswitches) and
  1293. (po_assembler in current_procinfo.procdef.procoptions) and
  1294. not(po_hascallingconvention in current_procinfo.procdef.procoptions) then
  1295. current_procinfo.procdef.proccalloption:=pocall_register;
  1296. { force the asm statement }
  1297. if token<>_ASM then
  1298. consume(_ASM);
  1299. include(current_procinfo.flags,pi_is_assembler);
  1300. p:=_asm_statement;
  1301. {$if not(defined(sparcgen)) and not(defined(arm)) and not(defined(avr)) and not(defined(mips))}
  1302. if (po_assembler in current_procinfo.procdef.procoptions) then
  1303. begin
  1304. { set the framepointer to esp for assembler functions when the
  1305. following conditions are met:
  1306. - if the are no local variables and parameters (except the allocated result)
  1307. - no reference to the result variable (refcount<=1)
  1308. - result is not stored as parameter
  1309. - target processor has optional frame pointer save
  1310. (vm, i386, vm only currently)
  1311. }
  1312. locals:=tabstractlocalsymtable(current_procinfo.procdef.parast).count_locals;
  1313. if (current_procinfo.procdef.localst.symtabletype=localsymtable) then
  1314. inc(locals,tabstractlocalsymtable(current_procinfo.procdef.localst).count_locals);
  1315. if (locals=0) and
  1316. not (current_procinfo.procdef.owner.symtabletype in [ObjectSymtable,recordsymtable]) and
  1317. (not assigned(current_procinfo.procdef.funcretsym) or
  1318. (tabstractvarsym(current_procinfo.procdef.funcretsym).refs<=1)) and
  1319. not (df_generic in current_procinfo.procdef.defoptions) and
  1320. not(paramanager.ret_in_param(current_procinfo.procdef.returndef,current_procinfo.procdef)) then
  1321. begin
  1322. { Only need to set the framepointer, the locals will
  1323. be inserted with the correct reference in tcgasmnode.pass_generate_code }
  1324. current_procinfo.framepointer:=NR_STACK_POINTER_REG;
  1325. end;
  1326. end;
  1327. {$endif not(defined(sparcgen)) and not(defined(arm)) and not(defined(avr)) not(defined(mipsel))}
  1328. { Flag the result as assigned when it is returned in a
  1329. register.
  1330. }
  1331. if assigned(current_procinfo.procdef.funcretsym) and
  1332. not (df_generic in current_procinfo.procdef.defoptions) and
  1333. (not paramanager.ret_in_param(current_procinfo.procdef.returndef,current_procinfo.procdef)) then
  1334. tabstractvarsym(current_procinfo.procdef.funcretsym).varstate:=vs_initialised;
  1335. { because the END is already read we need to get the
  1336. last_endtoken_filepos here (PFV) }
  1337. last_endtoken_filepos:=current_tokenpos;
  1338. assembler_block:=p;
  1339. end;
  1340. end.