pstatmnt.pas 44 KB

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