nmem.pas 39 KB

1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768697071727374757677787980818283848586878889909192939495969798991001011021031041051061071081091101111121131141151161171181191201211221231241251261271281291301311321331341351361371381391401411421431441451461471481491501511521531541551561571581591601611621631641651661671681691701711721731741751761771781791801811821831841851861871881891901911921931941951961971981992002012022032042052062072082092102112122132142152162172182192202212222232242252262272282292302312322332342352362372382392402412422432442452462472482492502512522532542552562572582592602612622632642652662672682692702712722732742752762772782792802812822832842852862872882892902912922932942952962972982993003013023033043053063073083093103113123133143153163173183193203213223233243253263273283293303313323333343353363373383393403413423433443453463473483493503513523533543553563573583593603613623633643653663673683693703713723733743753763773783793803813823833843853863873883893903913923933943953963973983994004014024034044054064074084094104114124134144154164174184194204214224234244254264274284294304314324334344354364374384394404414424434444454464474484494504514524534544554564574584594604614624634644654664674684694704714724734744754764774784794804814824834844854864874884894904914924934944954964974984995005015025035045055065075085095105115125135145155165175185195205215225235245255265275285295305315325335345355365375385395405415425435445455465475485495505515525535545555565575585595605615625635645655665675685695705715725735745755765775785795805815825835845855865875885895905915925935945955965975985996006016026036046056066076086096106116126136146156166176186196206216226236246256266276286296306316326336346356366376386396406416426436446456466476486496506516526536546556566576586596606616626636646656666676686696706716726736746756766776786796806816826836846856866876886896906916926936946956966976986997007017027037047057067077087097107117127137147157167177187197207217227237247257267277287297307317327337347357367377387397407417427437447457467477487497507517527537547557567577587597607617627637647657667677687697707717727737747757767777787797807817827837847857867877887897907917927937947957967977987998008018028038048058068078088098108118128138148158168178188198208218228238248258268278288298308318328338348358368378388398408418428438448458468478488498508518528538548558568578588598608618628638648658668678688698708718728738748758768778788798808818828838848858868878888898908918928938948958968978988999009019029039049059069079089099109119129139149159169179189199209219229239249259269279289299309319329339349359369379389399409419429439449459469479489499509519529539549559569579589599609619629639649659669679689699709719729739749759769779789799809819829839849859869879889899909919929939949959969979989991000100110021003100410051006100710081009101010111012101310141015101610171018101910201021102210231024102510261027102810291030103110321033103410351036103710381039104010411042104310441045104610471048104910501051105210531054105510561057105810591060106110621063106410651066106710681069107010711072107310741075107610771078107910801081108210831084108510861087108810891090109110921093109410951096109710981099110011011102110311041105110611071108110911101111111211131114111511161117111811191120112111221123112411251126112711281129113011311132113311341135113611371138113911401141114211431144114511461147114811491150115111521153115411551156115711581159116011611162116311641165116611671168116911701171117211731174117511761177117811791180118111821183118411851186118711881189119011911192119311941195119611971198119912001201120212031204120512061207120812091210121112121213121412151216121712181219122012211222122312241225
  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. registers32:=left.registers32;
  148. end;
  149. if registers32<1 then
  150. registers32:=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. registers32:=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. registers32:=left.registers32;
  396. registersfpu:=left.registersfpu;
  397. {$ifdef SUPPORT_MMX}
  398. registersmmx:=left.registersmmx;
  399. {$endif SUPPORT_MMX}
  400. if registers32<1 then
  401. registers32:=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. registers32:=left.registers32;
  412. registersfpu:=left.registersfpu;
  413. {$ifdef SUPPORT_MMX}
  414. registersmmx:=left.registersmmx;
  415. {$endif SUPPORT_MMX}
  416. if registers32<1 then
  417. registers32:=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. registers32:=max(left.registers32,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. registers32:=left.registers32;
  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 registers32=0 then
  519. registers32:=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,s32bittype);
  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. registers32:=left.registers32;
  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. registers32:=max(registers32,1);
  666. end
  667. else
  668. begin
  669. { this rules are suboptimal, but they should give }
  670. { good results }
  671. registers32:=max(left.registers32,right.registers32);
  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. registers32:=max(registers32,1);
  678. { need we an extra register when doing the restore ? }
  679. if (left.registers32<=right.registers32) 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. (registers32<3) then
  684. inc(registers32);
  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.registers32<1) then
  689. inc(registers32);
  690. { not correct, but what works better ?
  691. if left.registers32>0 then
  692. registers32:=max(registers32,2)
  693. else
  694. min. one register
  695. registers32:=max(registers32,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. registers32:=left.registers32;
  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.registers32 > registers32 then
  791. registers32:=withrefnode.registers32;
  792. if withrefnode.registersfpu > registersfpu then
  793. registers32:=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.78 2004-01-31 17:45:17 peter
  819. * Change several $ifdef i386 to x86
  820. * Change several OS_32 to OS_INT/OS_ADDR
  821. Revision 1.77 2004/01/26 16:12:28 daniel
  822. * reginfo now also only allocated during register allocation
  823. * third round of gdb cleanups: kick out most of concatstabto
  824. Revision 1.76 2003/12/12 15:42:53 peter
  825. * don't give warnings for shortstring vecnodes
  826. Revision 1.75 2003/12/08 22:35:06 peter
  827. * don't check varstate for left of vecnode for normal arrays
  828. Revision 1.74 2003/12/01 18:44:15 peter
  829. * fixed some crashes
  830. * fixed varargs and register calling probs
  831. Revision 1.73 2003/11/29 14:33:13 peter
  832. * typed address only used for @ and addr() that are parsed
  833. Revision 1.72 2003/11/10 22:02:52 peter
  834. * cross unit inlining fixed
  835. Revision 1.71 2003/11/05 14:18:03 marco
  836. * fix from Peter arraysize warning (nav Newsgroup msg)
  837. Revision 1.70 2003/10/31 18:44:18 peter
  838. * don't search for compatible procvars when the proc is not
  839. overloaded
  840. Revision 1.69 2003/10/31 15:52:58 peter
  841. * support creating classes using <class of tobject>.create
  842. Revision 1.68 2003/10/23 14:44:07 peter
  843. * splitted buildderef and buildderefimpl to fix interface crc
  844. calculation
  845. Revision 1.67 2003/10/22 20:40:00 peter
  846. * write derefdata in a separate ppu entry
  847. Revision 1.66 2003/10/21 18:16:13 peter
  848. * IncompatibleTypes() added that will include unit names when
  849. the typenames are the same
  850. Revision 1.65 2003/10/08 19:19:45 peter
  851. * set_varstate cleanup
  852. Revision 1.64 2003/10/01 20:34:49 peter
  853. * procinfo unit contains tprocinfo
  854. * cginfo renamed to cgbase
  855. * moved cgmessage to verbose
  856. * fixed ppc and sparc compiles
  857. Revision 1.63 2003/09/28 17:55:04 peter
  858. * parent framepointer changed to hidden parameter
  859. * tloadparentfpnode added
  860. Revision 1.62 2003/09/06 22:27:08 florian
  861. * fixed web bug 2669
  862. * cosmetic fix in printnode
  863. * tobjectdef.gettypename implemented
  864. Revision 1.61 2003/09/03 11:18:37 florian
  865. * fixed arm concatcopy
  866. + arm support in the common compiler sources added
  867. * moved some generic cg code around
  868. + tfputype added
  869. * ...
  870. Revision 1.60 2003/08/10 17:25:23 peter
  871. * fixed some reported bugs
  872. Revision 1.59 2003/06/17 19:24:08 jonas
  873. * fixed conversion of fpc_*str_unique to compilerproc
  874. Revision 1.58 2003/06/17 16:34:44 jonas
  875. * lots of newra fixes (need getfuncretparaloc implementation for i386)!
  876. * renamed all_intregisters to volatile_intregisters and made it
  877. processor dependent
  878. Revision 1.57 2003/06/07 20:26:32 peter
  879. * re-resolving added instead of reloading from ppu
  880. * tderef object added to store deref info for resolving
  881. Revision 1.56 2003/06/07 18:57:04 jonas
  882. + added freeintparaloc
  883. * ppc get/freeintparaloc now check whether the parameter regs are
  884. properly allocated/deallocated (and get an extra list para)
  885. * ppc a_call_* now internalerrors if pi_do_call is not yet set
  886. * fixed lot of missing pi_do_call's
  887. Revision 1.55 2003/05/24 17:15:24 jonas
  888. * added missing firstpass for withrefnode
  889. Revision 1.54 2003/05/11 14:45:12 peter
  890. * tloadnode does not support objectsymtable,withsymtable anymore
  891. * withnode cleanup
  892. * direct with rewritten to use temprefnode
  893. Revision 1.53 2003/05/09 17:47:02 peter
  894. * self moved to hidden parameter
  895. * removed hdisposen,hnewn,selfn
  896. Revision 1.52 2003/05/05 14:53:16 peter
  897. * vs_hidden replaced by is_hidden boolean
  898. Revision 1.51 2003/04/27 11:21:33 peter
  899. * aktprocdef renamed to current_procdef
  900. * procinfo renamed to current_procinfo
  901. * procinfo will now be stored in current_module so it can be
  902. cleaned up properly
  903. * gen_main_procsym changed to create_main_proc and release_main_proc
  904. to also generate a tprocinfo structure
  905. * fixed unit implicit initfinal
  906. Revision 1.50 2003/04/27 07:29:50 peter
  907. * current_procdef cleanup, current_procdef is now always nil when parsing
  908. a new procdef declaration
  909. * aktprocsym removed
  910. * lexlevel removed, use symtable.symtablelevel instead
  911. * implicit init/final code uses the normal genentry/genexit
  912. * funcret state checking updated for new funcret handling
  913. Revision 1.49 2003/04/23 10:10:54 peter
  914. * procvar is not compared in addrn
  915. Revision 1.48 2003/04/22 23:50:23 peter
  916. * firstpass uses expectloc
  917. * checks if there are differences between the expectloc and
  918. location.loc from secondpass in EXTDEBUG
  919. Revision 1.47 2003/04/10 17:57:52 peter
  920. * vs_hidden released
  921. Revision 1.46 2003/01/30 21:46:57 peter
  922. * self fixes for static methods (merged)
  923. Revision 1.45 2003/01/09 21:52:37 peter
  924. * merged some verbosity options.
  925. * V_LineInfo is a verbosity flag to include line info
  926. Revision 1.44 2003/01/06 21:16:52 peter
  927. * po_addressonly added to retrieve the address of a methodpointer
  928. only, this is used for @tclass.method which has no self pointer
  929. Revision 1.43 2003/01/04 15:54:03 daniel
  930. * Fixed mark_write for @ operator
  931. (can happen when compiling @procvar:=nil (Delphi mode construction))
  932. Revision 1.42 2003/01/03 12:15:56 daniel
  933. * Removed ifdefs around notifications
  934. ifdefs around for loop optimizations remain
  935. Revision 1.41 2002/11/25 17:43:20 peter
  936. * splitted defbase in defutil,symutil,defcmp
  937. * merged isconvertable and is_equal into compare_defs(_ext)
  938. * made operator search faster by walking the list only once
  939. Revision 1.40 2002/09/27 21:13:28 carl
  940. * low-highval always checked if limit ober 2GB is reached (to avoid overflow)
  941. Revision 1.39 2002/09/01 18:44:17 peter
  942. * cleanup of tvecnode.det_resulttype
  943. * move 0 element of string access check to resulttype
  944. Revision 1.38 2002/09/01 13:28:38 daniel
  945. - write_access fields removed in favor of a flag
  946. Revision 1.37 2002/09/01 08:01:16 daniel
  947. * Removed sets from Tcallnode.det_resulttype
  948. + Added read/write notifications of variables. These will be usefull
  949. for providing information for several optimizations. For example
  950. the value of the loop variable of a for loop does matter is the
  951. variable is read after the for loop, but if it's no longer used
  952. or written, it doesn't matter and this can be used to optimize
  953. the loop code generation.
  954. Revision 1.36 2002/08/19 19:36:43 peter
  955. * More fixes for cross unit inlining, all tnodes are now implemented
  956. * Moved pocall_internconst to po_internconst because it is not a
  957. calling type at all and it conflicted when inlining of these small
  958. functions was requested
  959. Revision 1.35 2002/07/23 09:51:23 daniel
  960. * Tried to make Tprocsym.defs protected. I didn't succeed but the cleanups
  961. are worth comitting.
  962. Revision 1.34 2002/07/20 11:57:54 florian
  963. * types.pas renamed to defbase.pas because D6 contains a types
  964. unit so this would conflicts if D6 programms are compiled
  965. + Willamette/SSE2 instructions to assembler added
  966. Revision 1.33 2002/05/18 13:34:10 peter
  967. * readded missing revisions
  968. Revision 1.32 2002/05/16 19:46:39 carl
  969. + defines.inc -> fpcdefs.inc to avoid conflicts if compiling by hand
  970. + try to fix temp allocation (still in ifdef)
  971. + generic constructor calls
  972. + start of tassembler / tmodulebase class cleanup
  973. Revision 1.30 2002/05/12 16:53:07 peter
  974. * moved entry and exitcode to ncgutil and cgobj
  975. * foreach gets extra argument for passing local data to the
  976. iterator function
  977. * -CR checks also class typecasts at runtime by changing them
  978. into as
  979. * fixed compiler to cycle with the -CR option
  980. * fixed stabs with elf writer, finally the global variables can
  981. be watched
  982. * removed a lot of routines from cga unit and replaced them by
  983. calls to cgobj
  984. * u32bit-s32bit updates for and,or,xor nodes. When one element is
  985. u32bit then the other is typecasted also to u32bit without giving
  986. a rangecheck warning/error.
  987. * fixed pascal calling method with reversing also the high tree in
  988. the parast, detected by tcalcst3 test
  989. Revision 1.29 2002/04/21 19:02:04 peter
  990. * removed newn and disposen nodes, the code is now directly
  991. inlined from pexpr
  992. * -an option that will write the secondpass nodes to the .s file, this
  993. requires EXTDEBUG define to actually write the info
  994. * fixed various internal errors and crashes due recent code changes
  995. Revision 1.28 2002/04/20 21:32:23 carl
  996. + generic FPC_CHECKPOINTER
  997. + first parameter offset in stack now portable
  998. * rename some constants
  999. + move some cpu stuff to other units
  1000. - remove unused constents
  1001. * fix stacksize for some targets
  1002. * fix generic size problems which depend now on EXTEND_SIZE constant
  1003. Revision 1.27 2002/04/02 17:11:29 peter
  1004. * tlocation,treference update
  1005. * LOC_CONSTANT added for better constant handling
  1006. * secondadd splitted in multiple routines
  1007. * location_force_reg added for loading a location to a register
  1008. of a specified size
  1009. * secondassignment parses now first the right and then the left node
  1010. (this is compatible with Kylix). This saves a lot of push/pop especially
  1011. with string operations
  1012. * adapted some routines to use the new cg methods
  1013. Revision 1.26 2002/04/01 20:57:13 jonas
  1014. * fixed web bug 1907
  1015. * fixed some other procvar related bugs (all related to accepting procvar
  1016. constructs with either too many or too little parameters)
  1017. (both merged, includes second typo fix of pexpr.pas)
  1018. }