nmem.pas 39 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817818819820821822823824825826827828829830831832833834835836837838839840841842843844845846847848849850851852853854855856857858859860861862863864865866867868869870871872873874875876877878879880881882883884885886887888889890891892893894895896897898899900901902903904905906907908909910911912913914915916917918919920921922923924925926927928929930931932933934935936937938939940941942943944945946947948949950951952953954955956957958959960961962963964965966967968969970971972973974975976977978979980981982983984985986987988989990991992993994995996997998999100010011002100310041005100610071008100910101011101210131014101510161017101810191020102110221023102410251026102710281029103010311032103310341035103610371038103910401041104210431044104510461047104810491050105110521053105410551056105710581059106010611062106310641065106610671068106910701071107210731074107510761077107810791080108110821083108410851086108710881089109010911092109310941095109610971098109911001101110211031104110511061107110811091110111111121113111411151116111711181119112011211122112311241125112611271128112911301131113211331134113511361137113811391140114111421143114411451146114711481149115011511152115311541155115611571158115911601161116211631164116511661167116811691170117111721173117411751176117711781179118011811182118311841185118611871188118911901191119211931194119511961197119811991200120112021203120412051206120712081209121012111212121312141215121612171218121912201221122212231224122512261227122812291230
  1. {
  2. $Id$
  3. Copyright (c) 2000-2002 by Florian Klaempfl
  4. Type checking and register allocation for memory related nodes
  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 nmem;
  19. {$i fpcdefs.inc}
  20. interface
  21. uses
  22. node,
  23. symdef,symsym,symtable,symtype,
  24. cpubase;
  25. type
  26. tloadvmtaddrnode = class(tunarynode)
  27. constructor create(l : tnode);virtual;
  28. function pass_1 : tnode;override;
  29. function det_resulttype:tnode;override;
  30. end;
  31. tloadvmtaddrnodeclass = class of tloadvmtaddrnode;
  32. tloadparentfpnode = class(tunarynode)
  33. parentpd : tprocdef;
  34. parentpdderef : tderef;
  35. constructor create(pd:tprocdef);virtual;
  36. constructor ppuload(t:tnodetype;ppufile:tcompilerppufile);override;
  37. procedure ppuwrite(ppufile:tcompilerppufile);override;
  38. procedure buildderefimpl;override;
  39. procedure derefimpl;override;
  40. function pass_1 : tnode;override;
  41. function det_resulttype:tnode;override;
  42. function getcopy : tnode;override;
  43. end;
  44. tloadparentfpnodeclass = class of tloadparentfpnode;
  45. taddrnode = class(tunarynode)
  46. getprocvardef : tprocvardef;
  47. getprocvardefderef : tderef;
  48. constructor create(l : tnode);virtual;
  49. constructor ppuload(t:tnodetype;ppufile:tcompilerppufile);override;
  50. procedure ppuwrite(ppufile:tcompilerppufile);override;
  51. procedure mark_write;override;
  52. procedure buildderefimpl;override;
  53. procedure derefimpl;override;
  54. function getcopy : tnode;override;
  55. function pass_1 : tnode;override;
  56. function det_resulttype:tnode;override;
  57. end;
  58. taddrnodeclass = class of taddrnode;
  59. tderefnode = class(tunarynode)
  60. constructor create(l : tnode);virtual;
  61. function pass_1 : tnode;override;
  62. function det_resulttype:tnode;override;
  63. procedure mark_write;override;
  64. end;
  65. tderefnodeclass = class of tderefnode;
  66. tsubscriptnode = class(tunarynode)
  67. vs : tvarsym;
  68. vsderef : tderef;
  69. constructor create(varsym : tsym;l : tnode);virtual;
  70. constructor ppuload(t:tnodetype;ppufile:tcompilerppufile);override;
  71. procedure ppuwrite(ppufile:tcompilerppufile);override;
  72. procedure buildderefimpl;override;
  73. procedure derefimpl;override;
  74. function getcopy : tnode;override;
  75. function pass_1 : tnode;override;
  76. function docompare(p: tnode): boolean; override;
  77. function det_resulttype:tnode;override;
  78. procedure mark_write;override;
  79. end;
  80. tsubscriptnodeclass = class of tsubscriptnode;
  81. tvecnode = class(tbinarynode)
  82. constructor create(l,r : tnode);virtual;
  83. function pass_1 : tnode;override;
  84. function det_resulttype:tnode;override;
  85. procedure mark_write;override;
  86. end;
  87. tvecnodeclass = class of tvecnode;
  88. twithnode = class(tunarynode)
  89. withsymtable : twithsymtable;
  90. tablecount : longint;
  91. withrefnode : tnode;
  92. constructor create(l:tnode;symtable:twithsymtable;count:longint;r:tnode);
  93. destructor destroy;override;
  94. constructor ppuload(t:tnodetype;ppufile:tcompilerppufile);override;
  95. procedure ppuwrite(ppufile:tcompilerppufile);override;
  96. function getcopy : tnode;override;
  97. function pass_1 : tnode;override;
  98. function docompare(p: tnode): boolean; override;
  99. function det_resulttype:tnode;override;
  100. end;
  101. twithnodeclass = class of twithnode;
  102. var
  103. cloadvmtaddrnode : tloadvmtaddrnodeclass;
  104. cloadparentfpnode : tloadparentfpnodeclass;
  105. caddrnode : taddrnodeclass;
  106. cderefnode : tderefnodeclass;
  107. csubscriptnode : tsubscriptnodeclass;
  108. cvecnode : tvecnodeclass;
  109. cwithnode : twithnodeclass;
  110. implementation
  111. uses
  112. globtype,systems,
  113. cutils,verbose,globals,
  114. symconst,symbase,defutil,defcmp,
  115. nbas,
  116. htypechk,pass_1,ncal,nld,ncon,ncnv,cgbase,procinfo
  117. ;
  118. {*****************************************************************************
  119. TLOADVMTADDRNODE
  120. *****************************************************************************}
  121. constructor tloadvmtaddrnode.create(l : tnode);
  122. begin
  123. inherited create(loadvmtaddrn,l);
  124. end;
  125. function tloadvmtaddrnode.det_resulttype:tnode;
  126. begin
  127. result:=nil;
  128. resulttypepass(left);
  129. if codegenerror then
  130. exit;
  131. case left.resulttype.def.deftype of
  132. classrefdef :
  133. resulttype:=left.resulttype;
  134. objectdef :
  135. resulttype.setdef(tclassrefdef.create(left.resulttype));
  136. else
  137. Message(parser_e_pointer_to_class_expected);
  138. end;
  139. end;
  140. function tloadvmtaddrnode.pass_1 : tnode;
  141. begin
  142. result:=nil;
  143. expectloc:=LOC_REGISTER;
  144. if left.nodetype<>typen then
  145. begin
  146. firstpass(left);
  147. registersint:=left.registersint;
  148. end;
  149. if registersint<1 then
  150. registersint:=1;
  151. end;
  152. {*****************************************************************************
  153. TLOADPARENTFPNODE
  154. *****************************************************************************}
  155. constructor tloadparentfpnode.create(pd:tprocdef);
  156. begin
  157. inherited create(loadparentfpn,nil);
  158. if not assigned(pd) then
  159. internalerror(200309288);
  160. if (pd.parast.symtablelevel>current_procinfo.procdef.parast.symtablelevel) then
  161. internalerror(200309284);
  162. parentpd:=pd;
  163. end;
  164. constructor tloadparentfpnode.ppuload(t:tnodetype;ppufile:tcompilerppufile);
  165. begin
  166. inherited ppuload(t,ppufile);
  167. ppufile.getderef(parentpdderef);
  168. end;
  169. procedure tloadparentfpnode.ppuwrite(ppufile:tcompilerppufile);
  170. begin
  171. inherited ppuwrite(ppufile);
  172. ppufile.putderef(parentpdderef);
  173. end;
  174. procedure tloadparentfpnode.buildderefimpl;
  175. begin
  176. inherited buildderefimpl;
  177. parentpdderef.build(parentpd);
  178. end;
  179. procedure tloadparentfpnode.derefimpl;
  180. begin
  181. inherited derefimpl;
  182. parentpd:=tprocdef(parentpdderef.resolve);
  183. end;
  184. function tloadparentfpnode.getcopy : tnode;
  185. var
  186. p : tloadparentfpnode;
  187. begin
  188. p:=tloadparentfpnode(inherited getcopy);
  189. p.parentpd:=parentpd;
  190. getcopy:=p;
  191. end;
  192. function tloadparentfpnode.det_resulttype:tnode;
  193. begin
  194. result:=nil;
  195. resulttype:=voidpointertype;
  196. end;
  197. function tloadparentfpnode.pass_1 : tnode;
  198. begin
  199. result:=nil;
  200. expectloc:=LOC_REGISTER;
  201. registersint:=1;
  202. end;
  203. {*****************************************************************************
  204. TADDRNODE
  205. *****************************************************************************}
  206. constructor taddrnode.create(l : tnode);
  207. begin
  208. inherited create(addrn,l);
  209. getprocvardef:=nil;
  210. end;
  211. constructor taddrnode.ppuload(t:tnodetype;ppufile:tcompilerppufile);
  212. begin
  213. inherited ppuload(t,ppufile);
  214. ppufile.getderef(getprocvardefderef);
  215. end;
  216. procedure taddrnode.ppuwrite(ppufile:tcompilerppufile);
  217. begin
  218. inherited ppuwrite(ppufile);
  219. ppufile.putderef(getprocvardefderef);
  220. end;
  221. procedure Taddrnode.mark_write;
  222. begin
  223. {@procvar:=nil is legal in Delphi mode.}
  224. left.mark_write;
  225. end;
  226. procedure taddrnode.buildderefimpl;
  227. begin
  228. inherited buildderefimpl;
  229. getprocvardefderef.build(getprocvardef);
  230. end;
  231. procedure taddrnode.derefimpl;
  232. begin
  233. inherited derefimpl;
  234. getprocvardef:=tprocvardef(getprocvardefderef.resolve);
  235. end;
  236. function taddrnode.getcopy : tnode;
  237. var
  238. p : taddrnode;
  239. begin
  240. p:=taddrnode(inherited getcopy);
  241. p.getprocvardef:=getprocvardef;
  242. getcopy:=p;
  243. end;
  244. function taddrnode.det_resulttype:tnode;
  245. var
  246. hp : tnode;
  247. hp2 : TParaItem;
  248. hp3 : tabstractprocdef;
  249. begin
  250. result:=nil;
  251. resulttypepass(left);
  252. if codegenerror then
  253. exit;
  254. { don't allow constants }
  255. if is_constnode(left) then
  256. begin
  257. aktfilepos:=left.fileinfo;
  258. CGMessage(type_e_no_addr_of_constant);
  259. exit;
  260. end;
  261. { tp @procvar support (type of @procvar is a void pointer)
  262. Note: we need to leave the addrn in the tree,
  263. else we can't see the difference between @procvar and procvar.
  264. we set the procvarload flag so a secondpass does nothing for
  265. this node (PFV) }
  266. if (m_tp_procvar in aktmodeswitches) then
  267. begin
  268. case left.nodetype of
  269. calln :
  270. begin
  271. { a load of a procvar can't have parameters }
  272. if assigned(tcallnode(left).left) then
  273. CGMessage(cg_e_illegal_expression);
  274. { is it a procvar? }
  275. hp:=tcallnode(left).right;
  276. if assigned(hp) then
  277. begin
  278. { remove calln node }
  279. tcallnode(left).right:=nil;
  280. left.free;
  281. left:=hp;
  282. include(flags,nf_procvarload);
  283. end;
  284. end;
  285. loadn,
  286. subscriptn,
  287. typeconvn,
  288. vecn,
  289. derefn :
  290. begin
  291. if left.resulttype.def.deftype=procvardef then
  292. include(flags,nf_procvarload);
  293. end;
  294. end;
  295. if nf_procvarload in flags then
  296. begin
  297. resulttype:=voidpointertype;
  298. exit;
  299. end;
  300. end;
  301. { proc 2 procvar ? }
  302. if left.nodetype=calln then
  303. { if it were a valid construct, the addr node would already have }
  304. { been removed in the parser. This happens for (in FPC mode) }
  305. { procvar1 := @procvar2(parameters); }
  306. CGMessage(cg_e_illegal_expression)
  307. else
  308. if (left.nodetype=loadn) and (tloadnode(left).symtableentry.typ=procsym) then
  309. begin
  310. { the address is already available when loading a procedure of object }
  311. if assigned(tloadnode(left).left) then
  312. include(flags,nf_procvarload);
  313. { result is a procedure variable }
  314. { No, to be TP compatible, you must return a voidpointer to
  315. the procedure that is stored in the procvar.}
  316. if not(m_tp_procvar in aktmodeswitches) then
  317. begin
  318. if assigned(getprocvardef) and
  319. (tprocsym(tloadnode(left).symtableentry).procdef_count>1) then
  320. begin
  321. hp3:=tprocsym(tloadnode(left).symtableentry).search_procdef_byprocvardef(getprocvardef);
  322. if not assigned(hp3) then
  323. begin
  324. IncompatibleTypes(tprocsym(tloadnode(left).symtableentry).first_procdef,getprocvardef);
  325. exit;
  326. end;
  327. end
  328. else
  329. hp3:=tabstractprocdef(tprocsym(tloadnode(left).symtableentry).first_procdef);
  330. { create procvardef }
  331. resulttype.setdef(tprocvardef.create(hp3.parast.symtablelevel));
  332. tprocvardef(resulttype.def).proctypeoption:=hp3.proctypeoption;
  333. tprocvardef(resulttype.def).proccalloption:=hp3.proccalloption;
  334. tprocvardef(resulttype.def).procoptions:=hp3.procoptions;
  335. tprocvardef(resulttype.def).rettype:=hp3.rettype;
  336. { method ? then set the methodpointer flag }
  337. if (hp3.owner.symtabletype=objectsymtable) then
  338. include(tprocvardef(resulttype.def).procoptions,po_methodpointer);
  339. { only need the address of the method? this is needed
  340. for @tobject.create }
  341. if not assigned(tloadnode(left).left) then
  342. include(tprocvardef(resulttype.def).procoptions,po_addressonly);
  343. { Add parameters in left to right order }
  344. hp2:=TParaItem(hp3.Para.first);
  345. while assigned(hp2) do
  346. begin
  347. tprocvardef(resulttype.def).concatpara(nil,hp2.paratype,hp2.parasym,
  348. hp2.defaultvalue,hp2.is_hidden);
  349. hp2:=TParaItem(hp2.next);
  350. end;
  351. end
  352. else
  353. resulttype:=voidpointertype;
  354. end
  355. else
  356. begin
  357. { what are we getting the address from an absolute sym? }
  358. hp:=left;
  359. while assigned(hp) and (hp.nodetype in [vecn,derefn,subscriptn]) do
  360. hp:=tunarynode(hp).left;
  361. {$ifdef i386}
  362. if assigned(hp) and
  363. (hp.nodetype=loadn) and
  364. ((tloadnode(hp).symtableentry.typ=absolutesym) and
  365. tabsolutesym(tloadnode(hp).symtableentry).absseg) then
  366. begin
  367. if not(nf_typedaddr in flags) then
  368. resulttype:=voidfarpointertype
  369. else
  370. resulttype.setdef(tpointerdef.createfar(left.resulttype));
  371. end
  372. else
  373. {$endif i386}
  374. begin
  375. if not(nf_typedaddr in flags) then
  376. resulttype:=voidpointertype
  377. else
  378. resulttype.setdef(tpointerdef.create(left.resulttype));
  379. end;
  380. end;
  381. { this is like the function addr }
  382. inc(parsing_para_level);
  383. set_varstate(left,vs_used,false);
  384. dec(parsing_para_level);
  385. end;
  386. function taddrnode.pass_1 : tnode;
  387. begin
  388. result:=nil;
  389. firstpass(left);
  390. if codegenerror then
  391. exit;
  392. make_not_regable(left);
  393. if nf_procvarload in flags then
  394. begin
  395. registersint:=left.registersint;
  396. registersfpu:=left.registersfpu;
  397. {$ifdef SUPPORT_MMX}
  398. registersmmx:=left.registersmmx;
  399. {$endif SUPPORT_MMX}
  400. if registersint<1 then
  401. registersint:=1;
  402. expectloc:=left.expectloc;
  403. exit;
  404. end;
  405. { we should allow loc_mem for @string }
  406. if not(left.expectloc in [LOC_CREFERENCE,LOC_REFERENCE]) then
  407. begin
  408. aktfilepos:=left.fileinfo;
  409. CGMessage(cg_e_illegal_expression);
  410. end;
  411. registersint:=left.registersint;
  412. registersfpu:=left.registersfpu;
  413. {$ifdef SUPPORT_MMX}
  414. registersmmx:=left.registersmmx;
  415. {$endif SUPPORT_MMX}
  416. if registersint<1 then
  417. registersint:=1;
  418. { is this right for object of methods ?? }
  419. expectloc:=LOC_REGISTER;
  420. end;
  421. {*****************************************************************************
  422. TDEREFNODE
  423. *****************************************************************************}
  424. constructor tderefnode.create(l : tnode);
  425. begin
  426. inherited create(derefn,l);
  427. end;
  428. function tderefnode.det_resulttype:tnode;
  429. begin
  430. result:=nil;
  431. resulttypepass(left);
  432. set_varstate(left,vs_used,true);
  433. if codegenerror then
  434. exit;
  435. if left.resulttype.def.deftype=pointerdef then
  436. resulttype:=tpointerdef(left.resulttype.def).pointertype
  437. else
  438. CGMessage(cg_e_invalid_qualifier);
  439. end;
  440. procedure Tderefnode.mark_write;
  441. begin
  442. include(flags,nf_write);
  443. end;
  444. function tderefnode.pass_1 : tnode;
  445. begin
  446. result:=nil;
  447. firstpass(left);
  448. if codegenerror then
  449. exit;
  450. registersint:=max(left.registersint,1);
  451. registersfpu:=left.registersfpu;
  452. {$ifdef SUPPORT_MMX}
  453. registersmmx:=left.registersmmx;
  454. {$endif SUPPORT_MMX}
  455. expectloc:=LOC_REFERENCE;
  456. end;
  457. {*****************************************************************************
  458. TSUBSCRIPTNODE
  459. *****************************************************************************}
  460. constructor tsubscriptnode.create(varsym : tsym;l : tnode);
  461. begin
  462. inherited create(subscriptn,l);
  463. { vs should be changed to tsym! }
  464. vs:=tvarsym(varsym);
  465. end;
  466. constructor tsubscriptnode.ppuload(t:tnodetype;ppufile:tcompilerppufile);
  467. begin
  468. inherited ppuload(t,ppufile);
  469. ppufile.getderef(vsderef);
  470. end;
  471. procedure tsubscriptnode.ppuwrite(ppufile:tcompilerppufile);
  472. begin
  473. inherited ppuwrite(ppufile);
  474. ppufile.putderef(vsderef);
  475. end;
  476. procedure tsubscriptnode.buildderefimpl;
  477. begin
  478. inherited buildderefimpl;
  479. vsderef.build(vs);
  480. end;
  481. procedure tsubscriptnode.derefimpl;
  482. begin
  483. inherited derefimpl;
  484. vs:=tvarsym(vsderef.resolve);
  485. end;
  486. function tsubscriptnode.getcopy : tnode;
  487. var
  488. p : tsubscriptnode;
  489. begin
  490. p:=tsubscriptnode(inherited getcopy);
  491. p.vs:=vs;
  492. getcopy:=p;
  493. end;
  494. function tsubscriptnode.det_resulttype:tnode;
  495. begin
  496. result:=nil;
  497. resulttypepass(left);
  498. resulttype:=vs.vartype;
  499. end;
  500. procedure Tsubscriptnode.mark_write;
  501. begin
  502. include(flags,nf_write);
  503. end;
  504. function tsubscriptnode.pass_1 : tnode;
  505. begin
  506. result:=nil;
  507. firstpass(left);
  508. if codegenerror then
  509. exit;
  510. registersint:=left.registersint;
  511. registersfpu:=left.registersfpu;
  512. {$ifdef SUPPORT_MMX}
  513. registersmmx:=left.registersmmx;
  514. {$endif SUPPORT_MMX}
  515. { classes must be dereferenced implicit }
  516. if is_class_or_interface(left.resulttype.def) then
  517. begin
  518. if registersint=0 then
  519. registersint:=1;
  520. expectloc:=LOC_REFERENCE;
  521. end
  522. else
  523. begin
  524. if (left.expectloc<>LOC_CREFERENCE) and
  525. (left.expectloc<>LOC_REFERENCE) then
  526. CGMessage(cg_e_illegal_expression);
  527. expectloc:=left.expectloc;
  528. end;
  529. end;
  530. function tsubscriptnode.docompare(p: tnode): boolean;
  531. begin
  532. docompare :=
  533. inherited docompare(p) and
  534. (vs = tsubscriptnode(p).vs);
  535. end;
  536. {*****************************************************************************
  537. TVECNODE
  538. *****************************************************************************}
  539. constructor tvecnode.create(l,r : tnode);
  540. begin
  541. inherited create(vecn,l,r);
  542. end;
  543. function tvecnode.det_resulttype:tnode;
  544. var
  545. htype : ttype;
  546. valid : boolean;
  547. begin
  548. result:=nil;
  549. resulttypepass(left);
  550. resulttypepass(right);
  551. { In p[1] p is always valid, it is not possible to
  552. declared a shortstring or normal array that has
  553. undefined number of elements. Dynamic array and
  554. ansi/widestring needs to be valid }
  555. valid:=is_dynamic_array(left.resulttype.def) or
  556. is_ansistring(left.resulttype.def) or
  557. is_widestring(left.resulttype.def);
  558. set_varstate(left,vs_used,valid);
  559. set_varstate(right,vs_used,true);
  560. if codegenerror then
  561. exit;
  562. { maybe type conversion for the index value, but
  563. do not convert enums,booleans,char }
  564. if (right.resulttype.def.deftype<>enumdef) and
  565. not(is_char(right.resulttype.def)) and
  566. not(is_boolean(right.resulttype.def)) then
  567. begin
  568. inserttypeconv(right,s32inttype);
  569. end;
  570. case left.resulttype.def.deftype of
  571. arraydef :
  572. begin
  573. { check type of the index value }
  574. if (compare_defs(right.resulttype.def,tarraydef(left.resulttype.def).rangetype.def,right.nodetype)=te_incompatible) then
  575. CGMessage(type_e_mismatch);
  576. resulttype:=tarraydef(left.resulttype.def).elementtype;
  577. end;
  578. pointerdef :
  579. begin
  580. { are we accessing a pointer[], then convert the pointer to
  581. an array first, in FPC this is allowed for all pointers in
  582. delphi/tp7 it's only allowed for pchars }
  583. if (m_fpc in aktmodeswitches) or
  584. is_pchar(left.resulttype.def) or
  585. is_pwidechar(left.resulttype.def) then
  586. begin
  587. { convert pointer to array }
  588. htype.setdef(tarraydef.create_from_pointer(tpointerdef(left.resulttype.def).pointertype));
  589. inserttypeconv(left,htype);
  590. resulttype:=tarraydef(htype.def).elementtype;
  591. end
  592. else
  593. CGMessage(type_e_array_required);
  594. end;
  595. stringdef :
  596. begin
  597. { indexed access to 0 element is only allowed for shortstrings }
  598. if (right.nodetype=ordconstn) and
  599. (tordconstnode(right).value=0) and
  600. not(is_shortstring(left.resulttype.def)) then
  601. CGMessage(cg_e_can_access_element_zero);
  602. case tstringdef(left.resulttype.def).string_typ of
  603. st_widestring :
  604. resulttype:=cwidechartype;
  605. st_ansistring :
  606. resulttype:=cchartype;
  607. st_longstring :
  608. resulttype:=cchartype;
  609. st_shortstring :
  610. resulttype:=cchartype;
  611. end;
  612. end
  613. else
  614. CGMessage(type_e_array_required);
  615. end;
  616. end;
  617. procedure Tvecnode.mark_write;
  618. begin
  619. include(flags,nf_write);
  620. end;
  621. function tvecnode.pass_1 : tnode;
  622. {$ifdef consteval}
  623. var
  624. tcsym : ttypedconstsym;
  625. {$endif}
  626. begin
  627. result:=nil;
  628. firstpass(left);
  629. firstpass(right);
  630. if codegenerror then
  631. exit;
  632. if (nf_callunique in flags) and
  633. (is_ansistring(left.resulttype.def) or
  634. is_widestring(left.resulttype.def)) then
  635. begin
  636. left := ctypeconvnode.create_explicit(ccallnode.createintern('fpc_'+tstringdef(left.resulttype.def).stringtypname+'_unique',
  637. ccallparanode.create(
  638. ctypeconvnode.create_explicit(left,voidpointertype),nil)),
  639. left.resulttype);
  640. firstpass(left);
  641. { double resulttype passes somwhere else may cause this to be }
  642. { reset though :/ }
  643. exclude(flags,nf_callunique);
  644. end;
  645. { the register calculation is easy if a const index is used }
  646. if right.nodetype=ordconstn then
  647. begin
  648. {$ifdef consteval}
  649. { constant evaluation }
  650. if (left.nodetype=loadn) and
  651. (left.symtableentry.typ=typedconstsym) then
  652. begin
  653. tcsym:=ttypedconstsym(left.symtableentry);
  654. if tcsym.defintion^.typ=stringdef then
  655. begin
  656. end;
  657. end;
  658. {$endif}
  659. registersint:=left.registersint;
  660. { for ansi/wide strings, we need at least one register }
  661. if is_ansistring(left.resulttype.def) or
  662. is_widestring(left.resulttype.def) or
  663. { ... as well as for dynamic arrays }
  664. is_dynamic_array(left.resulttype.def) then
  665. registersint:=max(registersint,1);
  666. end
  667. else
  668. begin
  669. { this rules are suboptimal, but they should give }
  670. { good results }
  671. registersint:=max(left.registersint,right.registersint);
  672. { for ansi/wide strings, we need at least one register }
  673. if is_ansistring(left.resulttype.def) or
  674. is_widestring(left.resulttype.def) or
  675. { ... as well as for dynamic arrays }
  676. is_dynamic_array(left.resulttype.def) then
  677. registersint:=max(registersint,1);
  678. { need we an extra register when doing the restore ? }
  679. if (left.registersint<=right.registersint) and
  680. { only if the node needs less than 3 registers }
  681. { two for the right node and one for the }
  682. { left address }
  683. (registersint<3) then
  684. inc(registersint);
  685. { need we an extra register for the index ? }
  686. if (right.expectloc<>LOC_REGISTER)
  687. { only if the right node doesn't need a register }
  688. and (right.registersint<1) then
  689. inc(registersint);
  690. { not correct, but what works better ?
  691. if left.registersint>0 then
  692. registersint:=max(registersint,2)
  693. else
  694. min. one register
  695. registersint:=max(registersint,1);
  696. }
  697. end;
  698. registersfpu:=max(left.registersfpu,right.registersfpu);
  699. {$ifdef SUPPORT_MMX}
  700. registersmmx:=max(left.registersmmx,right.registersmmx);
  701. {$endif SUPPORT_MMX}
  702. if left.expectloc=LOC_CREFERENCE then
  703. expectloc:=LOC_CREFERENCE
  704. else
  705. expectloc:=LOC_REFERENCE;
  706. end;
  707. {*****************************************************************************
  708. TWITHNODE
  709. *****************************************************************************}
  710. constructor twithnode.create(l:tnode;symtable:twithsymtable;count:longint;r:tnode);
  711. begin
  712. inherited create(withn,l);
  713. withrefnode:=r;
  714. withsymtable:=symtable;
  715. tablecount:=count;
  716. set_file_line(l);
  717. end;
  718. destructor twithnode.destroy;
  719. var
  720. hsymt,
  721. symt : tsymtable;
  722. i : longint;
  723. begin
  724. symt:=withsymtable;
  725. for i:=1 to tablecount do
  726. begin
  727. if assigned(symt) then
  728. begin
  729. hsymt:=symt.next;
  730. symt.free;
  731. symt:=hsymt;
  732. end;
  733. end;
  734. inherited destroy;
  735. end;
  736. constructor twithnode.ppuload(t:tnodetype;ppufile:tcompilerppufile);
  737. begin
  738. inherited ppuload(t,ppufile);
  739. internalerror(200208192);
  740. end;
  741. procedure twithnode.ppuwrite(ppufile:tcompilerppufile);
  742. begin
  743. inherited ppuwrite(ppufile);
  744. internalerror(200208193);
  745. end;
  746. function twithnode.getcopy : tnode;
  747. var
  748. p : twithnode;
  749. begin
  750. p:=twithnode(inherited getcopy);
  751. p.withsymtable:=withsymtable;
  752. p.tablecount:=tablecount;
  753. if assigned(p.withrefnode) then
  754. p.withrefnode:=withrefnode.getcopy
  755. else
  756. p.withrefnode:=nil;
  757. result:=p;
  758. end;
  759. function twithnode.det_resulttype:tnode;
  760. begin
  761. result:=nil;
  762. resulttype:=voidtype;
  763. resulttypepass(withrefnode);
  764. //unset_varstate(withrefnode);
  765. set_varstate(withrefnode,vs_used,true);
  766. if codegenerror then
  767. exit;
  768. if (withrefnode.nodetype=vecn) and
  769. (nf_memseg in withrefnode.flags) then
  770. CGMessage(parser_e_no_with_for_variable_in_other_segments);
  771. if assigned(left) then
  772. resulttypepass(left);
  773. end;
  774. function twithnode.pass_1 : tnode;
  775. begin
  776. result:=nil;
  777. expectloc:=LOC_VOID;
  778. if assigned(left) then
  779. begin
  780. firstpass(left);
  781. registersint:=left.registersint;
  782. registersfpu:=left.registersfpu;
  783. {$ifdef SUPPORT_MMX}
  784. registersmmx:=left.registersmmx;
  785. {$endif SUPPORT_MMX}
  786. end;
  787. if assigned(withrefnode) then
  788. begin
  789. firstpass(withrefnode);
  790. if withrefnode.registersint > registersint then
  791. registersint:=withrefnode.registersint;
  792. if withrefnode.registersfpu > registersfpu then
  793. registersint:=withrefnode.registersfpu;
  794. {$ifdef SUPPORT_MMX}
  795. if withrefnode.registersmmx > registersmmx then
  796. registersmmx:=withrefnode.registersmmx;
  797. {$endif SUPPORT_MMX}
  798. end;
  799. end;
  800. function twithnode.docompare(p: tnode): boolean;
  801. begin
  802. docompare :=
  803. inherited docompare(p) and
  804. (withsymtable = twithnode(p).withsymtable) and
  805. (tablecount = twithnode(p).tablecount) and
  806. (withrefnode.isequal(twithnode(p).withrefnode));
  807. end;
  808. begin
  809. cloadvmtaddrnode := tloadvmtaddrnode;
  810. caddrnode := taddrnode;
  811. cderefnode := tderefnode;
  812. csubscriptnode := tsubscriptnode;
  813. cvecnode := tvecnode;
  814. cwithnode := twithnode;
  815. end.
  816. {
  817. $Log$
  818. Revision 1.79 2004-02-03 22:32:54 peter
  819. * renamed xNNbittype to xNNinttype
  820. * renamed registers32 to registersint
  821. * replace some s32bit,u32bit with torddef([su]inttype).def.typ
  822. Revision 1.78 2004/01/31 17:45:17 peter
  823. * Change several $ifdef i386 to x86
  824. * Change several OS_32 to OS_INT/OS_ADDR
  825. Revision 1.77 2004/01/26 16:12:28 daniel
  826. * reginfo now also only allocated during register allocation
  827. * third round of gdb cleanups: kick out most of concatstabto
  828. Revision 1.76 2003/12/12 15:42:53 peter
  829. * don't give warnings for shortstring vecnodes
  830. Revision 1.75 2003/12/08 22:35:06 peter
  831. * don't check varstate for left of vecnode for normal arrays
  832. Revision 1.74 2003/12/01 18:44:15 peter
  833. * fixed some crashes
  834. * fixed varargs and register calling probs
  835. Revision 1.73 2003/11/29 14:33:13 peter
  836. * typed address only used for @ and addr() that are parsed
  837. Revision 1.72 2003/11/10 22:02:52 peter
  838. * cross unit inlining fixed
  839. Revision 1.71 2003/11/05 14:18:03 marco
  840. * fix from Peter arraysize warning (nav Newsgroup msg)
  841. Revision 1.70 2003/10/31 18:44:18 peter
  842. * don't search for compatible procvars when the proc is not
  843. overloaded
  844. Revision 1.69 2003/10/31 15:52:58 peter
  845. * support creating classes using <class of tobject>.create
  846. Revision 1.68 2003/10/23 14:44:07 peter
  847. * splitted buildderef and buildderefimpl to fix interface crc
  848. calculation
  849. Revision 1.67 2003/10/22 20:40:00 peter
  850. * write derefdata in a separate ppu entry
  851. Revision 1.66 2003/10/21 18:16:13 peter
  852. * IncompatibleTypes() added that will include unit names when
  853. the typenames are the same
  854. Revision 1.65 2003/10/08 19:19:45 peter
  855. * set_varstate cleanup
  856. Revision 1.64 2003/10/01 20:34:49 peter
  857. * procinfo unit contains tprocinfo
  858. * cginfo renamed to cgbase
  859. * moved cgmessage to verbose
  860. * fixed ppc and sparc compiles
  861. Revision 1.63 2003/09/28 17:55:04 peter
  862. * parent framepointer changed to hidden parameter
  863. * tloadparentfpnode added
  864. Revision 1.62 2003/09/06 22:27:08 florian
  865. * fixed web bug 2669
  866. * cosmetic fix in printnode
  867. * tobjectdef.gettypename implemented
  868. Revision 1.61 2003/09/03 11:18:37 florian
  869. * fixed arm concatcopy
  870. + arm support in the common compiler sources added
  871. * moved some generic cg code around
  872. + tfputype added
  873. * ...
  874. Revision 1.60 2003/08/10 17:25:23 peter
  875. * fixed some reported bugs
  876. Revision 1.59 2003/06/17 19:24:08 jonas
  877. * fixed conversion of fpc_*str_unique to compilerproc
  878. Revision 1.58 2003/06/17 16:34:44 jonas
  879. * lots of newra fixes (need getfuncretparaloc implementation for i386)!
  880. * renamed all_intregisters to volatile_intregisters and made it
  881. processor dependent
  882. Revision 1.57 2003/06/07 20:26:32 peter
  883. * re-resolving added instead of reloading from ppu
  884. * tderef object added to store deref info for resolving
  885. Revision 1.56 2003/06/07 18:57:04 jonas
  886. + added freeintparaloc
  887. * ppc get/freeintparaloc now check whether the parameter regs are
  888. properly allocated/deallocated (and get an extra list para)
  889. * ppc a_call_* now internalerrors if pi_do_call is not yet set
  890. * fixed lot of missing pi_do_call's
  891. Revision 1.55 2003/05/24 17:15:24 jonas
  892. * added missing firstpass for withrefnode
  893. Revision 1.54 2003/05/11 14:45:12 peter
  894. * tloadnode does not support objectsymtable,withsymtable anymore
  895. * withnode cleanup
  896. * direct with rewritten to use temprefnode
  897. Revision 1.53 2003/05/09 17:47:02 peter
  898. * self moved to hidden parameter
  899. * removed hdisposen,hnewn,selfn
  900. Revision 1.52 2003/05/05 14:53:16 peter
  901. * vs_hidden replaced by is_hidden boolean
  902. Revision 1.51 2003/04/27 11:21:33 peter
  903. * aktprocdef renamed to current_procdef
  904. * procinfo renamed to current_procinfo
  905. * procinfo will now be stored in current_module so it can be
  906. cleaned up properly
  907. * gen_main_procsym changed to create_main_proc and release_main_proc
  908. to also generate a tprocinfo structure
  909. * fixed unit implicit initfinal
  910. Revision 1.50 2003/04/27 07:29:50 peter
  911. * current_procdef cleanup, current_procdef is now always nil when parsing
  912. a new procdef declaration
  913. * aktprocsym removed
  914. * lexlevel removed, use symtable.symtablelevel instead
  915. * implicit init/final code uses the normal genentry/genexit
  916. * funcret state checking updated for new funcret handling
  917. Revision 1.49 2003/04/23 10:10:54 peter
  918. * procvar is not compared in addrn
  919. Revision 1.48 2003/04/22 23:50:23 peter
  920. * firstpass uses expectloc
  921. * checks if there are differences between the expectloc and
  922. location.loc from secondpass in EXTDEBUG
  923. Revision 1.47 2003/04/10 17:57:52 peter
  924. * vs_hidden released
  925. Revision 1.46 2003/01/30 21:46:57 peter
  926. * self fixes for static methods (merged)
  927. Revision 1.45 2003/01/09 21:52:37 peter
  928. * merged some verbosity options.
  929. * V_LineInfo is a verbosity flag to include line info
  930. Revision 1.44 2003/01/06 21:16:52 peter
  931. * po_addressonly added to retrieve the address of a methodpointer
  932. only, this is used for @tclass.method which has no self pointer
  933. Revision 1.43 2003/01/04 15:54:03 daniel
  934. * Fixed mark_write for @ operator
  935. (can happen when compiling @procvar:=nil (Delphi mode construction))
  936. Revision 1.42 2003/01/03 12:15:56 daniel
  937. * Removed ifdefs around notifications
  938. ifdefs around for loop optimizations remain
  939. Revision 1.41 2002/11/25 17:43:20 peter
  940. * splitted defbase in defutil,symutil,defcmp
  941. * merged isconvertable and is_equal into compare_defs(_ext)
  942. * made operator search faster by walking the list only once
  943. Revision 1.40 2002/09/27 21:13:28 carl
  944. * low-highval always checked if limit ober 2GB is reached (to avoid overflow)
  945. Revision 1.39 2002/09/01 18:44:17 peter
  946. * cleanup of tvecnode.det_resulttype
  947. * move 0 element of string access check to resulttype
  948. Revision 1.38 2002/09/01 13:28:38 daniel
  949. - write_access fields removed in favor of a flag
  950. Revision 1.37 2002/09/01 08:01:16 daniel
  951. * Removed sets from Tcallnode.det_resulttype
  952. + Added read/write notifications of variables. These will be usefull
  953. for providing information for several optimizations. For example
  954. the value of the loop variable of a for loop does matter is the
  955. variable is read after the for loop, but if it's no longer used
  956. or written, it doesn't matter and this can be used to optimize
  957. the loop code generation.
  958. Revision 1.36 2002/08/19 19:36:43 peter
  959. * More fixes for cross unit inlining, all tnodes are now implemented
  960. * Moved pocall_internconst to po_internconst because it is not a
  961. calling type at all and it conflicted when inlining of these small
  962. functions was requested
  963. Revision 1.35 2002/07/23 09:51:23 daniel
  964. * Tried to make Tprocsym.defs protected. I didn't succeed but the cleanups
  965. are worth comitting.
  966. Revision 1.34 2002/07/20 11:57:54 florian
  967. * types.pas renamed to defbase.pas because D6 contains a types
  968. unit so this would conflicts if D6 programms are compiled
  969. + Willamette/SSE2 instructions to assembler added
  970. Revision 1.33 2002/05/18 13:34:10 peter
  971. * readded missing revisions
  972. Revision 1.32 2002/05/16 19:46:39 carl
  973. + defines.inc -> fpcdefs.inc to avoid conflicts if compiling by hand
  974. + try to fix temp allocation (still in ifdef)
  975. + generic constructor calls
  976. + start of tassembler / tmodulebase class cleanup
  977. Revision 1.30 2002/05/12 16:53:07 peter
  978. * moved entry and exitcode to ncgutil and cgobj
  979. * foreach gets extra argument for passing local data to the
  980. iterator function
  981. * -CR checks also class typecasts at runtime by changing them
  982. into as
  983. * fixed compiler to cycle with the -CR option
  984. * fixed stabs with elf writer, finally the global variables can
  985. be watched
  986. * removed a lot of routines from cga unit and replaced them by
  987. calls to cgobj
  988. * u32bit-s32bit updates for and,or,xor nodes. When one element is
  989. u32bit then the other is typecasted also to u32bit without giving
  990. a rangecheck warning/error.
  991. * fixed pascal calling method with reversing also the high tree in
  992. the parast, detected by tcalcst3 test
  993. Revision 1.29 2002/04/21 19:02:04 peter
  994. * removed newn and disposen nodes, the code is now directly
  995. inlined from pexpr
  996. * -an option that will write the secondpass nodes to the .s file, this
  997. requires EXTDEBUG define to actually write the info
  998. * fixed various internal errors and crashes due recent code changes
  999. Revision 1.28 2002/04/20 21:32:23 carl
  1000. + generic FPC_CHECKPOINTER
  1001. + first parameter offset in stack now portable
  1002. * rename some constants
  1003. + move some cpu stuff to other units
  1004. - remove unused constents
  1005. * fix stacksize for some targets
  1006. * fix generic size problems which depend now on EXTEND_SIZE constant
  1007. Revision 1.27 2002/04/02 17:11:29 peter
  1008. * tlocation,treference update
  1009. * LOC_CONSTANT added for better constant handling
  1010. * secondadd splitted in multiple routines
  1011. * location_force_reg added for loading a location to a register
  1012. of a specified size
  1013. * secondassignment parses now first the right and then the left node
  1014. (this is compatible with Kylix). This saves a lot of push/pop especially
  1015. with string operations
  1016. * adapted some routines to use the new cg methods
  1017. Revision 1.26 2002/04/01 20:57:13 jonas
  1018. * fixed web bug 1907
  1019. * fixed some other procvar related bugs (all related to accepting procvar
  1020. constructs with either too many or too little parameters)
  1021. (both merged, includes second typo fix of pexpr.pas)
  1022. }