pstatmnt.pas 43 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817818819820821822823824825826827828829830831832833834835836837838839840841842843844845846847848849850851852853854855856857858859860861862863864865866867868869870871872873874875876877878879880881882883884885886887888889890891892893894895896897898899900901902903904905906907908909910911912913914915916917918919920921922923924925926927928929930931932933934935936937938939940941942943944945946947948949950951952953954955956957958959960961962963964965966967968969970971972973974975976977978979980981982983984985986987988989990991992993994995996997998999100010011002100310041005100610071008100910101011101210131014101510161017101810191020102110221023102410251026102710281029103010311032103310341035103610371038103910401041104210431044104510461047104810491050105110521053105410551056105710581059106010611062106310641065106610671068106910701071107210731074107510761077107810791080108110821083108410851086108710881089109010911092109310941095109610971098109911001101110211031104110511061107110811091110111111121113111411151116111711181119112011211122112311241125112611271128112911301131113211331134113511361137113811391140114111421143114411451146114711481149115011511152115311541155115611571158115911601161116211631164116511661167116811691170117111721173117411751176117711781179118011811182118311841185118611871188118911901191119211931194119511961197119811991200120112021203120412051206120712081209121012111212121312141215121612171218121912201221122212231224122512261227122812291230123112321233123412351236123712381239124012411242124312441245124612471248124912501251125212531254125512561257125812591260126112621263126412651266
  1. {
  2. $Id$
  3. Copyright (c) 1998-2002 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 fpcdefs.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,aasmbase,aasmtai,aasmcpu,
  35. { symtable }
  36. symconst,symbase,symtype,symdef,symsym,symtable,defutil,defcmp,
  37. paramgr,
  38. { pass 1 }
  39. pass_1,htypechk,
  40. nbas,nmat,nadd,ncal,nmem,nset,ncnv,ninl,ncon,nld,nflw,
  41. { parser }
  42. scanner,
  43. pbase,pexpr,
  44. { codegen }
  45. tgobj,rgobj,cgbase
  46. ,ncgutil
  47. ,radirect
  48. {$ifdef i386}
  49. {$ifndef NoRa386Int}
  50. ,ra386int
  51. {$endif NoRa386Int}
  52. {$ifndef NoRa386Att}
  53. ,ra386att
  54. {$endif NoRa386Att}
  55. {$else}
  56. ,rasm
  57. {$endif i386}
  58. ;
  59. function statement : tnode;forward;
  60. function if_statement : tnode;
  61. var
  62. ex,if_a,else_a : tnode;
  63. begin
  64. consume(_IF);
  65. ex:=comp_expr(true);
  66. consume(_THEN);
  67. if token<>_ELSE then
  68. if_a:=statement
  69. else
  70. if_a:=nil;
  71. if try_to_consume(_ELSE) then
  72. else_a:=statement
  73. else
  74. else_a:=nil;
  75. if_statement:=genloopnode(ifn,ex,if_a,else_a,false);
  76. end;
  77. { creates a block (list) of statements, til the next END token }
  78. function statements_til_end : tnode;
  79. var
  80. first,last : tstatementnode;
  81. begin
  82. first:=nil;
  83. while token<>_END do
  84. begin
  85. if first=nil then
  86. begin
  87. last:=cstatementnode.create(statement,nil);
  88. first:=last;
  89. end
  90. else
  91. begin
  92. last.right:=cstatementnode.create(statement,nil);
  93. last:=tstatementnode(last.right);
  94. end;
  95. if not try_to_consume(_SEMICOLON) then
  96. break;
  97. consume_emptystats;
  98. end;
  99. consume(_END);
  100. statements_til_end:=cblocknode.create(first);
  101. end;
  102. function case_statement : tnode;
  103. var
  104. { contains the label number of currently parsed case block }
  105. aktcaselabel : tasmlabel;
  106. firstlabel : boolean;
  107. root : pcaserecord;
  108. { the typ of the case expression }
  109. casedef : tdef;
  110. procedure newcaselabel(l,h : TConstExprInt;first:boolean);
  111. var
  112. hcaselabel : pcaserecord;
  113. procedure insertlabel(var p : pcaserecord);
  114. begin
  115. if p=nil then p:=hcaselabel
  116. else
  117. if (p^._low>hcaselabel^._low) and
  118. (p^._low>hcaselabel^._high) then
  119. if (hcaselabel^.statement = p^.statement) and
  120. (p^._low = hcaselabel^._high + 1) then
  121. begin
  122. p^._low := hcaselabel^._low;
  123. dispose(hcaselabel);
  124. end
  125. else
  126. insertlabel(p^.less)
  127. else
  128. if (p^._high<hcaselabel^._low) and
  129. (p^._high<hcaselabel^._high) then
  130. if (hcaselabel^.statement = p^.statement) and
  131. (p^._high+1 = hcaselabel^._low) then
  132. begin
  133. p^._high := hcaselabel^._high;
  134. dispose(hcaselabel);
  135. end
  136. else
  137. insertlabel(p^.greater)
  138. else Message(parser_e_double_caselabel);
  139. end;
  140. begin
  141. new(hcaselabel);
  142. hcaselabel^.less:=nil;
  143. hcaselabel^.greater:=nil;
  144. hcaselabel^.statement:=aktcaselabel;
  145. hcaselabel^.firstlabel:=first;
  146. objectlibrary.getlabel(hcaselabel^._at);
  147. hcaselabel^._low:=l;
  148. hcaselabel^._high:=h;
  149. insertlabel(root);
  150. end;
  151. var
  152. code,caseexpr,p,instruc,elseblock : tnode;
  153. hl1,hl2 : TConstExprInt;
  154. casedeferror : boolean;
  155. begin
  156. consume(_CASE);
  157. caseexpr:=comp_expr(true);
  158. { determines result type }
  159. rg.cleartempgen;
  160. do_resulttypepass(caseexpr);
  161. casedeferror:=false;
  162. casedef:=caseexpr.resulttype.def;
  163. if (not assigned(casedef)) or
  164. not(is_ordinal(casedef)) then
  165. begin
  166. CGMessage(type_e_ordinal_expr_expected);
  167. { create a correct tree }
  168. caseexpr.free;
  169. caseexpr:=cordconstnode.create(0,u32bittype,false);
  170. { set error flag so no rangechecks are done }
  171. casedeferror:=true;
  172. end;
  173. consume(_OF);
  174. inc(statement_level);
  175. root:=nil;
  176. instruc:=nil;
  177. repeat
  178. objectlibrary.getlabel(aktcaselabel);
  179. firstlabel:=true;
  180. { maybe an instruction has more case labels }
  181. repeat
  182. p:=expr;
  183. if is_widechar(casedef) then
  184. begin
  185. if (p.nodetype=rangen) then
  186. begin
  187. trangenode(p).left:=ctypeconvnode.create(trangenode(p).left,cwidechartype);
  188. trangenode(p).right:=ctypeconvnode.create(trangenode(p).right,cwidechartype);
  189. do_resulttypepass(trangenode(p).left);
  190. do_resulttypepass(trangenode(p).right);
  191. end
  192. else
  193. begin
  194. p:=ctypeconvnode.create(p,cwidechartype);
  195. do_resulttypepass(p);
  196. end;
  197. end;
  198. hl1:=0;
  199. hl2:=0;
  200. if (p.nodetype=rangen) then
  201. begin
  202. { type checking for case statements }
  203. if is_subequal(casedef, trangenode(p).left.resulttype.def) and
  204. is_subequal(casedef, trangenode(p).right.resulttype.def) then
  205. begin
  206. hl1:=get_ordinal_value(trangenode(p).left);
  207. hl2:=get_ordinal_value(trangenode(p).right);
  208. if hl1>hl2 then
  209. CGMessage(parser_e_case_lower_less_than_upper_bound);
  210. if not casedeferror then
  211. begin
  212. testrange(casedef,hl1,false);
  213. testrange(casedef,hl2,false);
  214. end;
  215. end
  216. else
  217. CGMessage(parser_e_case_mismatch);
  218. newcaselabel(hl1,hl2,firstlabel);
  219. end
  220. else
  221. begin
  222. { type checking for case statements }
  223. if not is_subequal(casedef, p.resulttype.def) then
  224. CGMessage(parser_e_case_mismatch);
  225. hl1:=get_ordinal_value(p);
  226. if not casedeferror then
  227. testrange(casedef,hl1,false);
  228. newcaselabel(hl1,hl1,firstlabel);
  229. end;
  230. p.free;
  231. if token=_COMMA then
  232. consume(_COMMA)
  233. else
  234. break;
  235. firstlabel:=false;
  236. until false;
  237. consume(_COLON);
  238. { handles instruction block }
  239. p:=clabelnode.createcase(aktcaselabel,statement);
  240. { concats instruction }
  241. instruc:=cstatementnode.create(p,instruc);
  242. if not(token in [_ELSE,_OTHERWISE,_END]) then
  243. consume(_SEMICOLON);
  244. until (token in [_ELSE,_OTHERWISE,_END]);
  245. if (token in [_ELSE,_OTHERWISE]) then
  246. begin
  247. if not try_to_consume(_ELSE) then
  248. consume(_OTHERWISE);
  249. elseblock:=statements_til_end;
  250. end
  251. else
  252. begin
  253. elseblock:=nil;
  254. consume(_END);
  255. end;
  256. dec(statement_level);
  257. code:=ccasenode.create(caseexpr,instruc,root);
  258. tcasenode(code).elseblock:=elseblock;
  259. case_statement:=code;
  260. end;
  261. function repeat_statement : tnode;
  262. var
  263. first,last,p_e : tnode;
  264. begin
  265. consume(_REPEAT);
  266. first:=nil;
  267. inc(statement_level);
  268. while token<>_UNTIL do
  269. begin
  270. if first=nil then
  271. begin
  272. last:=cstatementnode.create(statement,nil);
  273. first:=last;
  274. end
  275. else
  276. begin
  277. tstatementnode(last).right:=cstatementnode.create(statement,nil);
  278. last:=tstatementnode(last).right;
  279. end;
  280. if not try_to_consume(_SEMICOLON) then
  281. break;
  282. consume_emptystats;
  283. end;
  284. consume(_UNTIL);
  285. dec(statement_level);
  286. first:=cblocknode.create(first);
  287. p_e:=comp_expr(true);
  288. repeat_statement:=genloopnode(whilerepeatn,p_e,first,nil,true);
  289. end;
  290. function while_statement : tnode;
  291. var
  292. p_e,p_a : tnode;
  293. begin
  294. consume(_WHILE);
  295. p_e:=comp_expr(true);
  296. consume(_DO);
  297. p_a:=statement;
  298. while_statement:=genloopnode(whilerepeatn,p_e,p_a,nil,false);
  299. end;
  300. function for_statement : tnode;
  301. var
  302. p_e,tovalue,p_a : tnode;
  303. backward : boolean;
  304. begin
  305. { parse loop header }
  306. consume(_FOR);
  307. p_e:=expr;
  308. if token=_DOWNTO then
  309. begin
  310. consume(_DOWNTO);
  311. backward:=true;
  312. end
  313. else
  314. begin
  315. consume(_TO);
  316. backward:=false;
  317. end;
  318. tovalue:=comp_expr(true);
  319. consume(_DO);
  320. { ... now the instruction }
  321. p_a:=statement;
  322. for_statement:=genloopnode(forn,p_e,tovalue,p_a,backward);
  323. end;
  324. function _with_statement : tnode;
  325. var
  326. right,p : tnode;
  327. i,levelcount : longint;
  328. withsymtable,symtab : tsymtable;
  329. obj : tobjectdef;
  330. hp : tnode;
  331. begin
  332. p:=comp_expr(true);
  333. do_resulttypepass(p);
  334. set_varstate(p,false);
  335. right:=nil;
  336. if (not codegenerror) and
  337. (p.resulttype.def.deftype in [objectdef,recorddef]) then
  338. begin
  339. case p.resulttype.def.deftype of
  340. objectdef : begin
  341. obj:=tobjectdef(p.resulttype.def);
  342. symtab:=twithsymtable.Create(obj,obj.symtable.symsearch);
  343. withsymtable:=symtab;
  344. if (p.nodetype=loadn) and
  345. (tloadnode(p).symtable=aktprocdef.localst) then
  346. twithsymtable(symtab).direct_with:=true;
  347. twithsymtable(symtab).withrefnode:=p;
  348. levelcount:=1;
  349. obj:=obj.childof;
  350. while assigned(obj) do
  351. begin
  352. symtab.next:=twithsymtable.create(obj,obj.symtable.symsearch);
  353. symtab:=symtab.next;
  354. if (p.nodetype=loadn) and
  355. (tloadnode(p).symtable=aktprocdef.localst) then
  356. twithsymtable(symtab).direct_with:=true;
  357. twithsymtable(symtab).withrefnode:=p;
  358. obj:=obj.childof;
  359. inc(levelcount);
  360. end;
  361. symtab.next:=symtablestack;
  362. symtablestack:=withsymtable;
  363. end;
  364. recorddef : begin
  365. symtab:=trecorddef(p.resulttype.def).symtable;
  366. levelcount:=1;
  367. withsymtable:=twithsymtable.create(trecorddef(p.resulttype.def),symtab.symsearch);
  368. if (p.nodetype=loadn) and
  369. (tloadnode(p).symtable=aktprocdef.localst) then
  370. twithsymtable(withsymtable).direct_with:=true;
  371. twithsymtable(withsymtable).withrefnode:=p;
  372. withsymtable.next:=symtablestack;
  373. symtablestack:=withsymtable;
  374. end;
  375. end;
  376. if token=_COMMA then
  377. begin
  378. consume(_COMMA);
  379. right:=_with_statement{$ifdef FPCPROCVAR}(){$endif};
  380. end
  381. else
  382. begin
  383. consume(_DO);
  384. if token<>_SEMICOLON then
  385. right:=statement
  386. else
  387. right:=cerrornode.create;
  388. end;
  389. for i:=1 to levelcount do
  390. symtablestack:=symtablestack.next;
  391. _with_statement:=cwithnode.create(twithsymtable(withsymtable),p,right,levelcount);
  392. end
  393. else
  394. begin
  395. Message(parser_e_false_with_expr);
  396. { try to recover from error }
  397. if token=_COMMA then
  398. begin
  399. consume(_COMMA);
  400. hp:=_with_statement{$ifdef FPCPROCVAR}(){$endif};
  401. if (hp=nil) then; { remove warning about unused }
  402. end
  403. else
  404. begin
  405. consume(_DO);
  406. { ignore all }
  407. if token<>_SEMICOLON then
  408. statement;
  409. end;
  410. _with_statement:=nil;
  411. end;
  412. end;
  413. function with_statement : tnode;
  414. begin
  415. consume(_WITH);
  416. with_statement:=_with_statement;
  417. end;
  418. function raise_statement : tnode;
  419. var
  420. p,pobj,paddr,pframe : tnode;
  421. begin
  422. pobj:=nil;
  423. paddr:=nil;
  424. pframe:=nil;
  425. consume(_RAISE);
  426. if not(token in endtokens) then
  427. begin
  428. { object }
  429. pobj:=comp_expr(true);
  430. if try_to_consume(_AT) then
  431. begin
  432. paddr:=comp_expr(true);
  433. if try_to_consume(_COMMA) then
  434. pframe:=comp_expr(true);
  435. end;
  436. end
  437. else
  438. begin
  439. if (block_type<>bt_except) then
  440. Message(parser_e_no_reraise_possible);
  441. end;
  442. p:=craisenode.create(pobj,paddr,pframe);
  443. raise_statement:=p;
  444. end;
  445. function try_statement : tnode;
  446. var
  447. p_try_block,p_finally_block,first,last,
  448. p_default,p_specific,hp : tnode;
  449. ot : ttype;
  450. sym : tvarsym;
  451. old_block_type : tblock_type;
  452. exceptsymtable : tsymtable;
  453. objname,objrealname : stringid;
  454. srsym : tsym;
  455. srsymtable : tsymtable;
  456. oldaktexceptblock: integer;
  457. begin
  458. procinfo.flags:=procinfo.flags or pi_uses_exceptions;
  459. p_default:=nil;
  460. p_specific:=nil;
  461. { read statements to try }
  462. consume(_TRY);
  463. first:=nil;
  464. inc(exceptblockcounter);
  465. oldaktexceptblock := aktexceptblock;
  466. aktexceptblock := exceptblockcounter;
  467. inc(statement_level);
  468. while (token<>_FINALLY) and (token<>_EXCEPT) do
  469. begin
  470. if first=nil then
  471. begin
  472. last:=cstatementnode.create(statement,nil);
  473. first:=last;
  474. end
  475. else
  476. begin
  477. tstatementnode(last).right:=cstatementnode.create(statement,nil);
  478. last:=tstatementnode(last).right;
  479. end;
  480. if not try_to_consume(_SEMICOLON) then
  481. break;
  482. consume_emptystats;
  483. end;
  484. p_try_block:=cblocknode.create(first);
  485. if try_to_consume(_FINALLY) then
  486. begin
  487. inc(exceptblockcounter);
  488. aktexceptblock := exceptblockcounter;
  489. p_finally_block:=statements_til_end;
  490. try_statement:=ctryfinallynode.create(p_try_block,p_finally_block);
  491. dec(statement_level);
  492. end
  493. else
  494. begin
  495. consume(_EXCEPT);
  496. old_block_type:=block_type;
  497. block_type:=bt_except;
  498. inc(exceptblockcounter);
  499. aktexceptblock := exceptblockcounter;
  500. ot:=generrortype;
  501. p_specific:=nil;
  502. if (idtoken=_ON) then
  503. { catch specific exceptions }
  504. begin
  505. repeat
  506. consume(_ID);
  507. if token=_ID then
  508. begin
  509. objname:=pattern;
  510. objrealname:=orgpattern;
  511. { can't use consume_sym here, because we need already
  512. to check for the colon }
  513. searchsym(objname,srsym,srsymtable);
  514. consume(_ID);
  515. { is a explicit name for the exception given ? }
  516. if try_to_consume(_COLON) then
  517. begin
  518. consume_sym(srsym,srsymtable);
  519. if (srsym.typ=typesym) and
  520. is_class(ttypesym(srsym).restype.def) then
  521. begin
  522. ot:=ttypesym(srsym).restype;
  523. sym:=tvarsym.create(objrealname,ot);
  524. end
  525. else
  526. begin
  527. sym:=tvarsym.create(objrealname,generrortype);
  528. if (srsym.typ=typesym) then
  529. Message1(type_e_class_type_expected,ttypesym(srsym).restype.def.typename)
  530. else
  531. Message1(type_e_class_type_expected,ot.def.typename);
  532. end;
  533. exceptsymtable:=tstt_exceptsymtable.create;
  534. exceptsymtable.insert(sym);
  535. { insert the exception symtable stack }
  536. exceptsymtable.next:=symtablestack;
  537. symtablestack:=exceptsymtable;
  538. end
  539. else
  540. begin
  541. { check if type is valid, must be done here because
  542. with "e: Exception" the e is not necessary }
  543. if srsym=nil then
  544. begin
  545. identifier_not_found(objrealname);
  546. srsym:=generrorsym;
  547. end;
  548. { support unit.identifier }
  549. if srsym.typ=unitsym then
  550. begin
  551. consume(_POINT);
  552. srsym:=searchsymonlyin(tunitsym(srsym).unitsymtable,pattern);
  553. if srsym=nil then
  554. begin
  555. identifier_not_found(orgpattern);
  556. srsym:=generrorsym;
  557. end;
  558. consume(_ID);
  559. end;
  560. { check if type is valid, must be done here because
  561. with "e: Exception" the e is not necessary }
  562. if (srsym.typ=typesym) and
  563. is_class(ttypesym(srsym).restype.def) then
  564. ot:=ttypesym(srsym).restype
  565. else
  566. begin
  567. ot:=generrortype;
  568. if (srsym.typ=typesym) then
  569. Message1(type_e_class_type_expected,ttypesym(srsym).restype.def.typename)
  570. else
  571. Message1(type_e_class_type_expected,ot.def.typename);
  572. end;
  573. exceptsymtable:=nil;
  574. end;
  575. end
  576. else
  577. consume(_ID);
  578. consume(_DO);
  579. hp:=connode.create(nil,statement);
  580. if ot.def.deftype=errordef then
  581. begin
  582. hp.free;
  583. hp:=cerrornode.create;
  584. end;
  585. if p_specific=nil then
  586. begin
  587. last:=hp;
  588. p_specific:=last;
  589. end
  590. else
  591. begin
  592. tonnode(last).left:=hp;
  593. last:=tonnode(last).left;
  594. end;
  595. { set the informations }
  596. { only if the creation of the onnode was succesful, it's possible }
  597. { that last and hp are errornodes (JM) }
  598. if last.nodetype = onn then
  599. begin
  600. tonnode(last).excepttype:=tobjectdef(ot.def);
  601. tonnode(last).exceptsymtable:=exceptsymtable;
  602. end;
  603. { remove exception symtable }
  604. if assigned(exceptsymtable) then
  605. begin
  606. dellexlevel;
  607. if last.nodetype <> onn then
  608. exceptsymtable.free;
  609. end;
  610. if not try_to_consume(_SEMICOLON) then
  611. break;
  612. consume_emptystats;
  613. until (token in [_END,_ELSE]);
  614. if try_to_consume(_ELSE) then
  615. begin
  616. { catch the other exceptions }
  617. p_default:=statements_til_end;
  618. end
  619. else
  620. consume(_END);
  621. end
  622. else
  623. begin
  624. { catch all exceptions }
  625. p_default:=statements_til_end;
  626. end;
  627. dec(statement_level);
  628. block_type:=old_block_type;
  629. try_statement:=ctryexceptnode.create(p_try_block,p_specific,p_default);
  630. end;
  631. aktexceptblock := oldaktexceptblock;
  632. end;
  633. function _asm_statement : tnode;
  634. var
  635. asmstat : tasmnode;
  636. Marker : tai;
  637. r : tregister;
  638. found : boolean;
  639. hs : string;
  640. begin
  641. Inside_asm_statement:=true;
  642. case aktasmmode of
  643. asmmode_none : ; { just be there to allow to a compile without
  644. any assembler readers }
  645. {$ifdef i386}
  646. {$ifndef NoRA386Att}
  647. asmmode_i386_att:
  648. asmstat:=tasmnode(ra386att.assemble);
  649. {$endif NoRA386Att}
  650. {$ifndef NoRA386Int}
  651. asmmode_i386_intel:
  652. asmstat:=tasmnode(ra386int.assemble);
  653. {$endif NoRA386Int}
  654. {$else not i386}
  655. asmmode_standard:
  656. asmstat:=tasmnode(rasm.assemble);
  657. {$endif i386}
  658. asmmode_direct:
  659. begin
  660. if not target_asm.allowdirect then
  661. Message(parser_f_direct_assembler_not_allowed);
  662. if (aktprocdef.proccalloption=pocall_inline) then
  663. Begin
  664. Message1(parser_w_not_supported_for_inline,'direct asm');
  665. Message(parser_w_inlining_disabled);
  666. aktprocdef.proccalloption:=pocall_fpccall;
  667. End;
  668. asmstat:=tasmnode(radirect.assemble);
  669. end;
  670. else
  671. Message(parser_f_assembler_reader_not_supported);
  672. end;
  673. { Read first the _ASM statement }
  674. consume(_ASM);
  675. { END is read }
  676. if try_to_consume(_LECKKLAMMER) then
  677. begin
  678. if token<>_RECKKLAMMER then
  679. begin
  680. repeat
  681. { it's possible to specify the modified registers }
  682. include(asmstat.flags,nf_object_preserved);
  683. hs:=upper(pattern);
  684. found:=false;
  685. for r.enum:=firstreg to lastreg do
  686. if hs=upper(std_reg2str[r.enum]) then
  687. begin
  688. if r.enum = SELF_POINTER_REG then
  689. exclude(asmstat.flags,nf_object_preserved);
  690. include(rg.usedinproc,r.enum);
  691. include(rg.usedbyproc,r.enum);
  692. found:=true;
  693. break;
  694. end;
  695. if not(found) then
  696. Message(asmr_e_invalid_register);
  697. consume(_CSTRING);
  698. if not try_to_consume(_COMMA) then
  699. break;
  700. until false;
  701. end;
  702. consume(_RECKKLAMMER);
  703. end
  704. else
  705. begin
  706. rg.usedbyproc := ALL_REGISTERS;
  707. rg.usedinproc := ALL_REGISTERS;
  708. end;
  709. { mark the start and the end of the assembler block
  710. this is needed for the optimizer }
  711. If Assigned(AsmStat.p_asm) Then
  712. Begin
  713. Marker := Tai_Marker.Create(AsmBlockStart);
  714. AsmStat.p_asm.Insert(Marker);
  715. Marker := Tai_Marker.Create(AsmBlockEnd);
  716. AsmStat.p_asm.Concat(Marker);
  717. End;
  718. Inside_asm_statement:=false;
  719. _asm_statement:=asmstat;
  720. end;
  721. function statement : tnode;
  722. var
  723. p : tnode;
  724. code : tnode;
  725. filepos : tfileposinfo;
  726. srsym : tsym;
  727. srsymtable : tsymtable;
  728. s : stringid;
  729. begin
  730. filepos:=akttokenpos;
  731. case token of
  732. _GOTO :
  733. begin
  734. if not(cs_support_goto in aktmoduleswitches)then
  735. Message(sym_e_goto_and_label_not_supported);
  736. consume(_GOTO);
  737. if (token<>_INTCONST) and (token<>_ID) then
  738. begin
  739. Message(sym_e_label_not_found);
  740. code:=cerrornode.create;
  741. end
  742. else
  743. begin
  744. if token=_ID then
  745. consume_sym(srsym,srsymtable)
  746. else
  747. begin
  748. searchsym(pattern,srsym,srsymtable);
  749. if srsym=nil then
  750. begin
  751. identifier_not_found(pattern);
  752. srsym:=generrorsym;
  753. srsymtable:=nil;
  754. end;
  755. consume(token);
  756. end;
  757. if srsym.typ<>labelsym then
  758. begin
  759. Message(sym_e_id_is_no_label_id);
  760. code:=cerrornode.create;
  761. end
  762. else
  763. begin
  764. code:=cgotonode.create(tlabelsym(srsym));
  765. tgotonode(code).labsym:=tlabelsym(srsym);
  766. { set flag that this label is used }
  767. tlabelsym(srsym).used:=true;
  768. end;
  769. end;
  770. end;
  771. _BEGIN :
  772. code:=statement_block(_BEGIN);
  773. _IF :
  774. code:=if_statement;
  775. _CASE :
  776. code:=case_statement;
  777. _REPEAT :
  778. code:=repeat_statement;
  779. _WHILE :
  780. code:=while_statement;
  781. _FOR :
  782. code:=for_statement;
  783. _WITH :
  784. code:=with_statement;
  785. _TRY :
  786. code:=try_statement;
  787. _RAISE :
  788. code:=raise_statement;
  789. { semicolons,else until and end are ignored }
  790. _SEMICOLON,
  791. _ELSE,
  792. _UNTIL,
  793. _END:
  794. code:=cnothingnode.create;
  795. _FAIL :
  796. begin
  797. if (aktprocdef.proctypeoption<>potype_constructor) then
  798. Message(parser_e_fail_only_in_constructor);
  799. consume(_FAIL);
  800. code:=cfailnode.create;
  801. end;
  802. _ASM :
  803. code:=_asm_statement;
  804. _EOF :
  805. Message(scan_f_end_of_file);
  806. else
  807. begin
  808. p:=expr;
  809. { When a colon follows a intconst then transform it into a label }
  810. if try_to_consume(_COLON) then
  811. begin
  812. s:=tostr(tordconstnode(p).value);
  813. p.free;
  814. searchsym(s,srsym,srsymtable);
  815. if assigned(srsym) then
  816. begin
  817. if tlabelsym(srsym).defined then
  818. Message(sym_e_label_already_defined);
  819. tlabelsym(srsym).defined:=true;
  820. p:=clabelnode.create(tlabelsym(srsym),nil);
  821. end
  822. else
  823. begin
  824. identifier_not_found(s);
  825. p:=cnothingnode.create;
  826. end;
  827. end;
  828. if p.nodetype=labeln then
  829. begin
  830. { the pointer to the following instruction }
  831. { isn't a very clean way }
  832. tlabelnode(p).left:=statement{$ifdef FPCPROCVAR}(){$endif};
  833. { be sure to have left also resulttypepass }
  834. resulttypepass(tlabelnode(p).left);
  835. end;
  836. { blockn support because a read/write is changed into a blocknode }
  837. { with a separate statement for each read/write operation (JM) }
  838. { the same is true for val() if the third parameter is not 32 bit }
  839. if not(p.nodetype in [nothingn,calln,assignn,breakn,inlinen,
  840. continuen,labeln,blockn,exitn]) then
  841. Message(cg_e_illegal_expression);
  842. { specify that we don't use the value returned by the call }
  843. { Question : can this be also improtant
  844. for inlinen ??
  845. it is used for :
  846. - dispose of temp stack space
  847. - dispose on FPU stack }
  848. if p.nodetype=calln then
  849. exclude(p.flags,nf_return_value_used);
  850. code:=p;
  851. end;
  852. end;
  853. if assigned(code) then
  854. code.set_tree_filepos(filepos);
  855. statement:=code;
  856. end;
  857. function statement_block(starttoken : ttoken) : tnode;
  858. var
  859. first,last : tnode;
  860. filepos : tfileposinfo;
  861. begin
  862. first:=nil;
  863. filepos:=akttokenpos;
  864. consume(starttoken);
  865. inc(statement_level);
  866. while not(token in [_END,_FINALIZATION]) do
  867. begin
  868. if first=nil then
  869. begin
  870. last:=cstatementnode.create(statement,nil);
  871. first:=last;
  872. end
  873. else
  874. begin
  875. tstatementnode(last).right:=cstatementnode.create(statement,nil);
  876. last:=tstatementnode(last).right;
  877. end;
  878. if (token in [_END,_FINALIZATION]) then
  879. break
  880. else
  881. begin
  882. { if no semicolon, then error and go on }
  883. if token<>_SEMICOLON then
  884. begin
  885. consume(_SEMICOLON);
  886. consume_all_until(_SEMICOLON);
  887. end;
  888. consume(_SEMICOLON);
  889. end;
  890. consume_emptystats;
  891. end;
  892. { don't consume the finalization token, it is consumed when
  893. reading the finalization block, but allow it only after
  894. an initalization ! }
  895. if (starttoken<>_INITIALIZATION) or (token<>_FINALIZATION) then
  896. consume(_END);
  897. dec(statement_level);
  898. last:=cblocknode.create(first);
  899. last.set_tree_filepos(filepos);
  900. statement_block:=last;
  901. end;
  902. function assembler_block : tnode;
  903. {# Optimize the assembler block by removing all references
  904. which are via the frame pointer by replacing them with
  905. references via the stack pointer.
  906. This is only available to certain cpu targets where
  907. the frame pointer saving must be done explicitly.
  908. }
  909. procedure OptimizeFramePointer(p:tasmnode);
  910. var
  911. hp : tai;
  912. parafixup,
  913. i : longint;
  914. begin
  915. { we don't need to allocate space for the locals }
  916. aktprocdef.localst.datasize:=0;
  917. procinfo.firsttemp_offset:=0;
  918. { replace framepointer with stackpointer }
  919. procinfo.framepointer.enum:=R_INTREGISTER;
  920. procinfo.framepointer.number:=NR_STACK_POINTER_REG;
  921. { set the right value for parameters }
  922. dec(aktprocdef.parast.address_fixup,pointer_size);
  923. dec(procinfo.para_offset,pointer_size);
  924. { replace all references to parameters in the instructions,
  925. the parameters can be identified by the parafixup option
  926. that is set. For normal user coded [ebp+4] this field is not
  927. set }
  928. parafixup:=aktprocdef.parast.address_fixup;
  929. hp:=tai(p.p_asm.first);
  930. while assigned(hp) do
  931. begin
  932. if hp.typ=ait_instruction then
  933. begin
  934. { fixup the references }
  935. for i:=1 to taicpu(hp).ops do
  936. begin
  937. with taicpu(hp).oper[i-1] do
  938. if typ=top_ref then
  939. begin
  940. case ref^.options of
  941. ref_parafixup :
  942. begin
  943. ref^.offsetfixup:=parafixup;
  944. ref^.base.enum:=R_INTREGISTER;
  945. ref^.base.number:=NR_STACK_POINTER_REG;
  946. end;
  947. end;
  948. end;
  949. end;
  950. end;
  951. hp:=tai(hp.next);
  952. end;
  953. end;
  954. {$ifdef CHECKFORPUSH}
  955. function UsesPush(p:tasmnode):boolean;
  956. var
  957. hp : tai;
  958. begin
  959. hp:=tai(p.p_asm.first);
  960. while assigned(hp) do
  961. begin
  962. if (hp.typ=ait_instruction) and
  963. (taicpu(hp).opcode=A_PUSH) then
  964. begin
  965. UsesPush:=true;
  966. exit;
  967. end;
  968. hp:=tai(hp.next);
  969. end;
  970. UsesPush:=false;
  971. end;
  972. {$endif CHECKFORPUSH}
  973. var
  974. p : tnode;
  975. begin
  976. { Rename the funcret so that recursive calls are possible }
  977. if not is_void(aktprocdef.rettype.def) then
  978. symtablestack.rename(aktprocdef.funcretsym.name,'$result');
  979. { force the asm statement }
  980. if token<>_ASM then
  981. consume(_ASM);
  982. procinfo.Flags := procinfo.Flags Or pi_is_assembler;
  983. p:=_asm_statement;
  984. { set the framepointer to esp for assembler functions when the
  985. following conditions are met:
  986. - if the are no local variables (except the allocated result)
  987. - if the are no parameters
  988. - no reference to the result variable (refcount<=1)
  989. - result is not stored as parameter
  990. - target processor has optional frame pointer save
  991. (vm, i386, vm only currently)
  992. }
  993. if (po_assembler in aktprocdef.procoptions) and
  994. (aktprocdef.parast.datasize=0) and
  995. (aktprocdef.localst.datasize=aktprocdef.rettype.def.size) and
  996. (aktprocdef.owner.symtabletype<>objectsymtable) and
  997. (not assigned(aktprocdef.funcretsym) or
  998. (tfuncretsym(aktprocdef.funcretsym).refcount<=1)) and
  999. not(paramanager.ret_in_param(aktprocdef.rettype.def,aktprocdef.proccalloption)) and
  1000. (target_cpu in [cpu_i386,cpu_m68k,cpu_vm])
  1001. {$ifdef CHECKFORPUSH}
  1002. and not(UsesPush(tasmnode(p)))
  1003. {$endif CHECKFORPUSH}
  1004. then
  1005. OptimizeFramePointer(tasmnode(p));
  1006. { Flag the result as assigned when it is returned in a
  1007. register.
  1008. }
  1009. if assigned(aktprocdef.funcretsym) and
  1010. paramanager.ret_in_reg(aktprocdef.rettype.def,aktprocdef.proccalloption) then
  1011. tfuncretsym(aktprocdef.funcretsym).funcretstate:=vs_assigned;
  1012. { because the END is already read we need to get the
  1013. last_endtoken_filepos here (PFV) }
  1014. last_endtoken_filepos:=akttokenpos;
  1015. assembler_block:=p;
  1016. end;
  1017. end.
  1018. {
  1019. $Log$
  1020. Revision 1.87 2003-03-17 18:55:30 peter
  1021. * allow more tokens instead of only semicolon after inherited
  1022. Revision 1.86 2003/02/19 22:00:14 daniel
  1023. * Code generator converted to new register notation
  1024. - Horribily outdated todo.txt removed
  1025. Revision 1.85 2003/01/08 18:43:56 daniel
  1026. * Tregister changed into a record
  1027. Revision 1.84 2003/01/01 21:05:24 peter
  1028. * fixed assembler methods stackpointer optimization that was
  1029. broken after the previous change
  1030. Revision 1.83 2002/12/29 18:59:34 peter
  1031. * fixed parsing of declarations before asm statement
  1032. Revision 1.82 2002/12/27 18:18:56 peter
  1033. * check for else after empty raise statement
  1034. Revision 1.81 2002/11/27 02:37:14 peter
  1035. * case statement inlining added
  1036. * fixed inlining of write()
  1037. * switched statementnode left and right parts so the statements are
  1038. processed in the correct order when getcopy is used. This is
  1039. required for tempnodes
  1040. Revision 1.80 2002/11/25 17:43:22 peter
  1041. * splitted defbase in defutil,symutil,defcmp
  1042. * merged isconvertable and is_equal into compare_defs(_ext)
  1043. * made operator search faster by walking the list only once
  1044. Revision 1.79 2002/11/18 17:31:58 peter
  1045. * pass proccalloption to ret_in_xxx and push_xxx functions
  1046. Revision 1.78 2002/09/07 19:34:08 florian
  1047. + tcg.direction is used now
  1048. Revision 1.77 2002/09/07 15:25:07 peter
  1049. * old logs removed and tabs fixed
  1050. Revision 1.76 2002/09/07 12:16:03 carl
  1051. * second part bug report 1996 fix, testrange in cordconstnode
  1052. only called if option is set (also make parsing a tiny faster)
  1053. Revision 1.75 2002/09/02 18:40:52 peter
  1054. * fixed parsing of register names with lowercase
  1055. Revision 1.74 2002/09/01 14:43:12 peter
  1056. * fixed direct assembler for i386
  1057. Revision 1.73 2002/08/25 19:25:20 peter
  1058. * sym.insert_in_data removed
  1059. * symtable.insertvardata/insertconstdata added
  1060. * removed insert_in_data call from symtable.insert, it needs to be
  1061. called separatly. This allows to deref the address calculation
  1062. * procedures now calculate the parast addresses after the procedure
  1063. directives are parsed. This fixes the cdecl parast problem
  1064. * push_addr_param has an extra argument that specifies if cdecl is used
  1065. or not
  1066. Revision 1.72 2002/08/17 09:23:40 florian
  1067. * first part of procinfo rewrite
  1068. Revision 1.71 2002/08/16 14:24:58 carl
  1069. * issameref() to test if two references are the same (then emit no opcodes)
  1070. + ret_in_reg to replace ret_in_acc
  1071. (fix some register allocation bugs at the same time)
  1072. + save_std_register now has an extra parameter which is the
  1073. usedinproc registers
  1074. Revision 1.70 2002/08/11 14:32:27 peter
  1075. * renamed current_library to objectlibrary
  1076. Revision 1.69 2002/08/11 13:24:12 peter
  1077. * saving of asmsymbols in ppu supported
  1078. * asmsymbollist global is removed and moved into a new class
  1079. tasmlibrarydata that will hold the info of a .a file which
  1080. corresponds with a single module. Added librarydata to tmodule
  1081. to keep the library info stored for the module. In the future the
  1082. objectfiles will also be stored to the tasmlibrarydata class
  1083. * all getlabel/newasmsymbol and friends are moved to the new class
  1084. Revision 1.68 2002/08/10 14:46:30 carl
  1085. + moved target_cpu_string to cpuinfo
  1086. * renamed asmmode enum.
  1087. * assembler reader has now less ifdef's
  1088. * move from nppcmem.pas -> ncgmem.pas vec. node.
  1089. Revision 1.67 2002/08/09 19:11:44 carl
  1090. + reading of used registers in assembler routines is now
  1091. cpu-independent
  1092. Revision 1.66 2002/08/06 20:55:22 florian
  1093. * first part of ppc calling conventions fix
  1094. Revision 1.65 2002/07/28 20:45:22 florian
  1095. + added direct assembler reader for PowerPC
  1096. Revision 1.64 2002/07/20 11:57:56 florian
  1097. * types.pas renamed to defbase.pas because D6 contains a types
  1098. unit so this would conflicts if D6 programms are compiled
  1099. + Willamette/SSE2 instructions to assembler added
  1100. Revision 1.63 2002/07/19 11:41:36 daniel
  1101. * State tracker work
  1102. * The whilen and repeatn are now completely unified into whilerepeatn. This
  1103. allows the state tracker to change while nodes automatically into
  1104. repeat nodes.
  1105. * Resulttypepass improvements to the notn. 'not not a' is optimized away and
  1106. 'not(a>b)' is optimized into 'a<=b'.
  1107. * Resulttypepass improvements to the whilerepeatn. 'while not a' is optimized
  1108. by removing the notn and later switchting the true and falselabels. The
  1109. same is done with 'repeat until not a'.
  1110. Revision 1.62 2002/07/16 15:34:20 florian
  1111. * exit is now a syssym instead of a keyword
  1112. Revision 1.61 2002/07/11 14:41:28 florian
  1113. * start of the new generic parameter handling
  1114. Revision 1.60 2002/07/04 20:43:01 florian
  1115. * first x86-64 patches
  1116. Revision 1.59 2002/07/01 18:46:25 peter
  1117. * internal linker
  1118. * reorganized aasm layer
  1119. Revision 1.58 2002/05/18 13:34:13 peter
  1120. * readded missing revisions
  1121. Revision 1.57 2002/05/16 19:46:44 carl
  1122. + defines.inc -> fpcdefs.inc to avoid conflicts if compiling by hand
  1123. + try to fix temp allocation (still in ifdef)
  1124. + generic constructor calls
  1125. + start of tassembler / tmodulebase class cleanup
  1126. }