nmem.pas 36 KB

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