nmem.pas 28 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817818819820821822823824825826827828829830831832833834835836837838839840841842843844845846847848849850851852853854855856857858859860861862863864865866867868869870871872873874875876877878879880881882883884885886887888889890891892893894895896897898899900901902903904905906907908909910911912913914
  1. {
  2. Copyright (c) 2000-2002 by Florian Klaempfl
  3. Type checking and register allocation for memory related nodes
  4. This program is free software; you can redistribute it and/or modify
  5. it under the terms of the GNU General Public License as published by
  6. the Free Software Foundation; either version 2 of the License, or
  7. (at your option) any later version.
  8. This program is distributed in the hope that it will be useful,
  9. but WITHOUT ANY WARRANTY; without even the implied warranty of
  10. MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
  11. GNU General Public License for more details.
  12. You should have received a copy of the GNU General Public License
  13. along with this program; if not, write to the Free Software
  14. Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
  15. ****************************************************************************
  16. }
  17. unit nmem;
  18. {$i fpcdefs.inc}
  19. interface
  20. uses
  21. node,
  22. symdef,symsym,symtable,symtype;
  23. type
  24. tloadvmtaddrnode = class(tunarynode)
  25. constructor create(l : tnode);virtual;
  26. function pass_1 : tnode;override;
  27. function det_resulttype:tnode;override;
  28. end;
  29. tloadvmtaddrnodeclass = class of tloadvmtaddrnode;
  30. tloadparentfpnode = class(tunarynode)
  31. parentpd : tprocdef;
  32. parentpdderef : tderef;
  33. constructor create(pd:tprocdef);virtual;
  34. constructor ppuload(t:tnodetype;ppufile:tcompilerppufile);override;
  35. procedure ppuwrite(ppufile:tcompilerppufile);override;
  36. procedure buildderefimpl;override;
  37. procedure derefimpl;override;
  38. function pass_1 : tnode;override;
  39. function det_resulttype:tnode;override;
  40. function _getcopy : tnode;override;
  41. end;
  42. tloadparentfpnodeclass = class of tloadparentfpnode;
  43. taddrnode = class(tunarynode)
  44. getprocvardef : tprocvardef;
  45. getprocvardefderef : tderef;
  46. constructor create(l : tnode);virtual;
  47. constructor create_internal(l : tnode); virtual;
  48. constructor ppuload(t:tnodetype;ppufile:tcompilerppufile);override;
  49. procedure ppuwrite(ppufile:tcompilerppufile);override;
  50. procedure mark_write;override;
  51. procedure buildderefimpl;override;
  52. procedure derefimpl;override;
  53. function _getcopy : tnode;override;
  54. function pass_1 : tnode;override;
  55. function det_resulttype:tnode;override;
  56. end;
  57. taddrnodeclass = class of taddrnode;
  58. tderefnode = class(tunarynode)
  59. constructor create(l : tnode);virtual;
  60. function pass_1 : tnode;override;
  61. function det_resulttype:tnode;override;
  62. procedure mark_write;override;
  63. end;
  64. tderefnodeclass = class of tderefnode;
  65. tsubscriptnode = class(tunarynode)
  66. vs : tfieldvarsym;
  67. vsderef : tderef;
  68. constructor create(varsym : tsym;l : tnode);virtual;
  69. constructor ppuload(t:tnodetype;ppufile:tcompilerppufile);override;
  70. procedure ppuwrite(ppufile:tcompilerppufile);override;
  71. procedure buildderefimpl;override;
  72. procedure derefimpl;override;
  73. function _getcopy : tnode;override;
  74. function pass_1 : tnode;override;
  75. function docompare(p: tnode): boolean; override;
  76. function det_resulttype:tnode;override;
  77. procedure mark_write;override;
  78. end;
  79. tsubscriptnodeclass = class of tsubscriptnode;
  80. tvecnode = class(tbinarynode)
  81. constructor create(l,r : tnode);virtual;
  82. function pass_1 : tnode;override;
  83. function det_resulttype:tnode;override;
  84. procedure mark_write;override;
  85. end;
  86. tvecnodeclass = class of tvecnode;
  87. twithnode = class(tunarynode)
  88. constructor create(l:tnode);
  89. destructor destroy;override;
  90. constructor ppuload(t:tnodetype;ppufile:tcompilerppufile);override;
  91. procedure ppuwrite(ppufile:tcompilerppufile);override;
  92. function _getcopy : tnode;override;
  93. function pass_1 : tnode;override;
  94. function docompare(p: tnode): boolean; override;
  95. function det_resulttype:tnode;override;
  96. end;
  97. twithnodeclass = class of twithnode;
  98. var
  99. cloadvmtaddrnode : tloadvmtaddrnodeclass;
  100. cloadparentfpnode : tloadparentfpnodeclass;
  101. caddrnode : taddrnodeclass;
  102. cderefnode : tderefnodeclass;
  103. csubscriptnode : tsubscriptnodeclass;
  104. cvecnode : tvecnodeclass;
  105. cwithnode : twithnodeclass;
  106. implementation
  107. uses
  108. globtype,systems,
  109. cutils,verbose,globals,
  110. symconst,symbase,defutil,defcmp,
  111. nbas,nutils,
  112. htypechk,pass_1,ncal,nld,ncon,ncnv,cgbase,procinfo
  113. ;
  114. {*****************************************************************************
  115. TLOADVMTADDRNODE
  116. *****************************************************************************}
  117. constructor tloadvmtaddrnode.create(l : tnode);
  118. begin
  119. inherited create(loadvmtaddrn,l);
  120. end;
  121. function tloadvmtaddrnode.det_resulttype:tnode;
  122. begin
  123. result:=nil;
  124. resulttypepass(left);
  125. if codegenerror then
  126. exit;
  127. case left.resulttype.def.deftype of
  128. classrefdef :
  129. resulttype:=left.resulttype;
  130. objectdef :
  131. resulttype.setdef(tclassrefdef.create(left.resulttype));
  132. else
  133. Message(parser_e_pointer_to_class_expected);
  134. end;
  135. end;
  136. function tloadvmtaddrnode.pass_1 : tnode;
  137. begin
  138. result:=nil;
  139. expectloc:=LOC_REGISTER;
  140. if left.nodetype<>typen then
  141. begin
  142. firstpass(left);
  143. registersint:=left.registersint;
  144. end;
  145. if registersint<1 then
  146. registersint:=1;
  147. end;
  148. {*****************************************************************************
  149. TLOADPARENTFPNODE
  150. *****************************************************************************}
  151. constructor tloadparentfpnode.create(pd:tprocdef);
  152. begin
  153. inherited create(loadparentfpn,nil);
  154. if not assigned(pd) then
  155. internalerror(200309288);
  156. if (pd.parast.symtablelevel>current_procinfo.procdef.parast.symtablelevel) then
  157. internalerror(200309284);
  158. parentpd:=pd;
  159. end;
  160. constructor tloadparentfpnode.ppuload(t:tnodetype;ppufile:tcompilerppufile);
  161. begin
  162. inherited ppuload(t,ppufile);
  163. ppufile.getderef(parentpdderef);
  164. end;
  165. procedure tloadparentfpnode.ppuwrite(ppufile:tcompilerppufile);
  166. begin
  167. inherited ppuwrite(ppufile);
  168. ppufile.putderef(parentpdderef);
  169. end;
  170. procedure tloadparentfpnode.buildderefimpl;
  171. begin
  172. inherited buildderefimpl;
  173. parentpdderef.build(parentpd);
  174. end;
  175. procedure tloadparentfpnode.derefimpl;
  176. begin
  177. inherited derefimpl;
  178. parentpd:=tprocdef(parentpdderef.resolve);
  179. end;
  180. function tloadparentfpnode._getcopy : tnode;
  181. var
  182. p : tloadparentfpnode;
  183. begin
  184. p:=tloadparentfpnode(inherited _getcopy);
  185. p.parentpd:=parentpd;
  186. _getcopy:=p;
  187. end;
  188. function tloadparentfpnode.det_resulttype:tnode;
  189. {$ifdef dummy}
  190. var
  191. currpi : tprocinfo;
  192. hsym : tparavarsym;
  193. {$endif dummy}
  194. begin
  195. result:=nil;
  196. resulttype:=voidpointertype;
  197. {$ifdef dummy}
  198. { currently parentfps are never loaded in registers (FK) }
  199. if (current_procinfo.procdef.parast.symtablelevel<>parentpd.parast.symtablelevel) then
  200. begin
  201. currpi:=current_procinfo;
  202. { walk parents }
  203. while (currpi.procdef.owner.symtablelevel>parentpd.parast.symtablelevel) do
  204. begin
  205. currpi:=currpi.parent;
  206. if not assigned(currpi) then
  207. internalerror(2005040602);
  208. hsym:=tparavarsym(currpi.procdef.parast.search('parentfp'));
  209. if not assigned(hsym) then
  210. internalerror(2005040601);
  211. hsym.varregable:=vr_none;
  212. end;
  213. end;
  214. {$endif dummy}
  215. end;
  216. function tloadparentfpnode.pass_1 : tnode;
  217. begin
  218. result:=nil;
  219. expectloc:=LOC_REGISTER;
  220. registersint:=1;
  221. end;
  222. {*****************************************************************************
  223. TADDRNODE
  224. *****************************************************************************}
  225. constructor taddrnode.create(l : tnode);
  226. begin
  227. inherited create(addrn,l);
  228. getprocvardef:=nil;
  229. end;
  230. constructor taddrnode.create_internal(l : tnode);
  231. begin
  232. self.create(l);
  233. include(flags,nf_internal);
  234. end;
  235. constructor taddrnode.ppuload(t:tnodetype;ppufile:tcompilerppufile);
  236. begin
  237. inherited ppuload(t,ppufile);
  238. ppufile.getderef(getprocvardefderef);
  239. end;
  240. procedure taddrnode.ppuwrite(ppufile:tcompilerppufile);
  241. begin
  242. inherited ppuwrite(ppufile);
  243. ppufile.putderef(getprocvardefderef);
  244. end;
  245. procedure Taddrnode.mark_write;
  246. begin
  247. {@procvar:=nil is legal in Delphi mode.}
  248. left.mark_write;
  249. end;
  250. procedure taddrnode.buildderefimpl;
  251. begin
  252. inherited buildderefimpl;
  253. getprocvardefderef.build(getprocvardef);
  254. end;
  255. procedure taddrnode.derefimpl;
  256. begin
  257. inherited derefimpl;
  258. getprocvardef:=tprocvardef(getprocvardefderef.resolve);
  259. end;
  260. function taddrnode._getcopy : tnode;
  261. var
  262. p : taddrnode;
  263. begin
  264. p:=taddrnode(inherited _getcopy);
  265. p.getprocvardef:=getprocvardef;
  266. _getcopy:=p;
  267. end;
  268. function taddrnode.det_resulttype:tnode;
  269. var
  270. hp : tnode;
  271. hsym : tfieldvarsym;
  272. isprocvar : boolean;
  273. begin
  274. result:=nil;
  275. resulttypepass(left);
  276. if codegenerror then
  277. exit;
  278. make_not_regable(left);
  279. { don't allow constants }
  280. if is_constnode(left) then
  281. begin
  282. aktfilepos:=left.fileinfo;
  283. CGMessage(type_e_no_addr_of_constant);
  284. exit;
  285. end;
  286. { Handle @proc special, also @procvar in tp-mode needs
  287. special handling }
  288. if (left.resulttype.def.deftype=procdef) or
  289. (
  290. (left.resulttype.def.deftype=procvardef) and
  291. ((m_tp_procvar in aktmodeswitches) or
  292. (m_mac_procvar in aktmodeswitches))
  293. ) then
  294. begin
  295. isprocvar:=(left.resulttype.def.deftype=procvardef);
  296. if not isprocvar then
  297. begin
  298. left:=ctypeconvnode.create_proc_to_procvar(left);
  299. resulttypepass(left);
  300. end;
  301. { In tp procvar mode the result is always a voidpointer. Insert
  302. a typeconversion to voidpointer. For methodpointers we need
  303. to load the proc field }
  304. if (m_tp_procvar in aktmodeswitches) or
  305. (m_mac_procvar in aktmodeswitches) then
  306. begin
  307. if tabstractprocdef(left.resulttype.def).is_addressonly then
  308. begin
  309. result:=ctypeconvnode.create_internal(left,voidpointertype);
  310. include(result.flags,nf_load_procvar);
  311. left:=nil;
  312. end
  313. else
  314. begin
  315. { For procvars we need to return the proc field of the
  316. methodpointer }
  317. if isprocvar then
  318. begin
  319. { find proc field in methodpointer record }
  320. hsym:=tfieldvarsym(trecorddef(methodpointertype.def).symtable.search('proc'));
  321. if not assigned(hsym) then
  322. internalerror(200412041);
  323. { Load tmehodpointer(left).proc }
  324. result:=csubscriptnode.create(
  325. hsym,
  326. ctypeconvnode.create_internal(left,methodpointertype));
  327. left:=nil;
  328. end
  329. else
  330. CGMessage(type_e_variable_id_expected);
  331. end;
  332. end
  333. else
  334. begin
  335. { Return the typeconvn only }
  336. result:=left;
  337. left:=nil;
  338. end;
  339. end
  340. else
  341. begin
  342. { what are we getting the address from an absolute sym? }
  343. hp:=left;
  344. while assigned(hp) and (hp.nodetype in [typeconvn,vecn,derefn,subscriptn]) do
  345. hp:=tunarynode(hp).left;
  346. if not assigned(hp) then
  347. internalerror(200412042);
  348. {$ifdef i386}
  349. if (hp.nodetype=loadn) and
  350. ((tloadnode(hp).symtableentry.typ=absolutevarsym) and
  351. tabsolutevarsym(tloadnode(hp).symtableentry).absseg) then
  352. begin
  353. if not(nf_typedaddr in flags) then
  354. resulttype:=voidfarpointertype
  355. else
  356. resulttype.setdef(tpointerdef.createfar(left.resulttype));
  357. end
  358. else
  359. {$endif i386}
  360. if (nf_internal in flags) or
  361. valid_for_addr(left,true) then
  362. begin
  363. if not(nf_typedaddr in flags) then
  364. resulttype:=voidpointertype
  365. else
  366. resulttype.setdef(tpointerdef.create(left.resulttype));
  367. end
  368. else
  369. CGMessage(type_e_variable_id_expected);
  370. end;
  371. { this is like the function addr }
  372. inc(parsing_para_level);
  373. { This is actually only "read", but treat it nevertheless as }
  374. { modified due to the possible use of pointers }
  375. { To avoid false positives regarding "uninitialised" }
  376. { warnings when using arrays, perform it in two steps }
  377. set_varstate(left,vs_written,[]);
  378. set_varstate(left,vs_read,[]);
  379. dec(parsing_para_level);
  380. end;
  381. function taddrnode.pass_1 : tnode;
  382. begin
  383. result:=nil;
  384. firstpass(left);
  385. if codegenerror then
  386. exit;
  387. registersint:=left.registersint;
  388. registersfpu:=left.registersfpu;
  389. {$ifdef SUPPORT_MMX}
  390. registersmmx:=left.registersmmx;
  391. {$endif SUPPORT_MMX}
  392. if registersint<1 then
  393. registersint:=1;
  394. { is this right for object of methods ?? }
  395. expectloc:=LOC_REGISTER;
  396. end;
  397. {*****************************************************************************
  398. TDEREFNODE
  399. *****************************************************************************}
  400. constructor tderefnode.create(l : tnode);
  401. begin
  402. inherited create(derefn,l);
  403. end;
  404. function tderefnode.det_resulttype:tnode;
  405. begin
  406. result:=nil;
  407. resulttypepass(left);
  408. set_varstate(left,vs_read,[vsf_must_be_valid]);
  409. if codegenerror then
  410. exit;
  411. { tp procvar support }
  412. maybe_call_procvar(left,true);
  413. if left.resulttype.def.deftype=pointerdef then
  414. resulttype:=tpointerdef(left.resulttype.def).pointertype
  415. else
  416. CGMessage(parser_e_invalid_qualifier);
  417. end;
  418. procedure Tderefnode.mark_write;
  419. begin
  420. include(flags,nf_write);
  421. end;
  422. function tderefnode.pass_1 : tnode;
  423. begin
  424. result:=nil;
  425. firstpass(left);
  426. if codegenerror then
  427. exit;
  428. registersint:=max(left.registersint,1);
  429. registersfpu:=left.registersfpu;
  430. {$ifdef SUPPORT_MMX}
  431. registersmmx:=left.registersmmx;
  432. {$endif SUPPORT_MMX}
  433. expectloc:=LOC_REFERENCE;
  434. end;
  435. {*****************************************************************************
  436. TSUBSCRIPTNODE
  437. *****************************************************************************}
  438. constructor tsubscriptnode.create(varsym : tsym;l : tnode);
  439. begin
  440. inherited create(subscriptn,l);
  441. { vs should be changed to tsym! }
  442. vs:=tfieldvarsym(varsym);
  443. end;
  444. constructor tsubscriptnode.ppuload(t:tnodetype;ppufile:tcompilerppufile);
  445. begin
  446. inherited ppuload(t,ppufile);
  447. ppufile.getderef(vsderef);
  448. end;
  449. procedure tsubscriptnode.ppuwrite(ppufile:tcompilerppufile);
  450. begin
  451. inherited ppuwrite(ppufile);
  452. ppufile.putderef(vsderef);
  453. end;
  454. procedure tsubscriptnode.buildderefimpl;
  455. begin
  456. inherited buildderefimpl;
  457. vsderef.build(vs);
  458. end;
  459. procedure tsubscriptnode.derefimpl;
  460. begin
  461. inherited derefimpl;
  462. vs:=tfieldvarsym(vsderef.resolve);
  463. end;
  464. function tsubscriptnode._getcopy : tnode;
  465. var
  466. p : tsubscriptnode;
  467. begin
  468. p:=tsubscriptnode(inherited _getcopy);
  469. p.vs:=vs;
  470. _getcopy:=p;
  471. end;
  472. function tsubscriptnode.det_resulttype:tnode;
  473. begin
  474. result:=nil;
  475. resulttypepass(left);
  476. { tp procvar support }
  477. maybe_call_procvar(left,true);
  478. resulttype:=vs.vartype;
  479. end;
  480. procedure Tsubscriptnode.mark_write;
  481. begin
  482. include(flags,nf_write);
  483. end;
  484. function tsubscriptnode.pass_1 : tnode;
  485. begin
  486. result:=nil;
  487. firstpass(left);
  488. if codegenerror then
  489. exit;
  490. registersint:=left.registersint;
  491. registersfpu:=left.registersfpu;
  492. {$ifdef SUPPORT_MMX}
  493. registersmmx:=left.registersmmx;
  494. {$endif SUPPORT_MMX}
  495. { classes must be dereferenced implicit }
  496. if is_class_or_interface(left.resulttype.def) then
  497. begin
  498. if registersint=0 then
  499. registersint:=1;
  500. expectloc:=LOC_REFERENCE;
  501. end
  502. else
  503. begin
  504. if (left.expectloc<>LOC_CREFERENCE) and
  505. (left.expectloc<>LOC_REFERENCE) then
  506. CGMessage(parser_e_illegal_expression);
  507. expectloc:=left.expectloc;
  508. end;
  509. end;
  510. function tsubscriptnode.docompare(p: tnode): boolean;
  511. begin
  512. docompare :=
  513. inherited docompare(p) and
  514. (vs = tsubscriptnode(p).vs);
  515. end;
  516. {*****************************************************************************
  517. TVECNODE
  518. *****************************************************************************}
  519. constructor tvecnode.create(l,r : tnode);
  520. begin
  521. inherited create(vecn,l,r);
  522. end;
  523. function tvecnode.det_resulttype:tnode;
  524. var
  525. htype : ttype;
  526. valid : boolean;
  527. begin
  528. result:=nil;
  529. resulttypepass(left);
  530. resulttypepass(right);
  531. { implicitly convert stringconstant to stringdef,
  532. see tbs/tb0476.pp for a test }
  533. if (left.nodetype=stringconstn) and
  534. (tstringconstnode(left).cst_type=cst_conststring) then
  535. begin
  536. if tstringconstnode(left).len>255 then
  537. inserttypeconv(left,cansistringtype)
  538. else
  539. inserttypeconv(left,cshortstringtype);
  540. end;
  541. { In p[1] p is always valid, it is not possible to
  542. declared a shortstring or normal array that has
  543. undefined number of elements. Dynamic array and
  544. ansi/widestring needs to be valid }
  545. valid:=is_dynamic_array(left.resulttype.def) or
  546. is_ansistring(left.resulttype.def) or
  547. is_widestring(left.resulttype.def) or
  548. { implicit pointer dereference -> pointer is read }
  549. (left.resulttype.def.deftype = pointerdef);
  550. if valid then
  551. set_varstate(left,vs_read,[vsf_must_be_valid]);
  552. {
  553. A vecn is, just like a loadn, always part of an expression with its
  554. own read/write and must_be_valid semantics. Therefore we don't have
  555. to do anything else here, just like for loadn's
  556. }
  557. set_varstate(right,vs_read,[vsf_must_be_valid]);
  558. if codegenerror then
  559. exit;
  560. { maybe type conversion for the index value, but
  561. do not convert enums,booleans,char }
  562. if ((right.resulttype.def.deftype<>enumdef) and
  563. not(is_char(right.resulttype.def) or is_widechar(right.resulttype.def)) and
  564. not(is_boolean(right.resulttype.def))) or
  565. (left.resulttype.def.deftype <> arraydef) then
  566. begin
  567. inserttypeconv(right,sinttype);
  568. end;
  569. case left.resulttype.def.deftype of
  570. arraydef :
  571. begin
  572. { check type of the index value }
  573. if (compare_defs(right.resulttype.def,tarraydef(left.resulttype.def).rangetype.def,right.nodetype)=te_incompatible) then
  574. IncompatibleTypes(right.resulttype.def,tarraydef(left.resulttype.def).rangetype.def);
  575. resulttype:=tarraydef(left.resulttype.def).elementtype;
  576. end;
  577. pointerdef :
  578. begin
  579. { are we accessing a pointer[], then convert the pointer to
  580. an array first, in FPC this is allowed for all pointers
  581. (except voidpointer) in delphi/tp7 it's only allowed for pchars. }
  582. if not is_voidpointer(left.resulttype.def) and
  583. (
  584. (m_fpc in aktmodeswitches) or
  585. is_pchar(left.resulttype.def) or
  586. is_pwidechar(left.resulttype.def)
  587. ) then
  588. begin
  589. { convert pointer to array }
  590. htype.setdef(tarraydef.create_from_pointer(tpointerdef(left.resulttype.def).pointertype));
  591. inserttypeconv(left,htype);
  592. resulttype:=tarraydef(htype.def).elementtype;
  593. end
  594. else
  595. CGMessage(type_e_array_required);
  596. end;
  597. stringdef :
  598. begin
  599. { indexed access to 0 element is only allowed for shortstrings }
  600. if (right.nodetype=ordconstn) and
  601. (tordconstnode(right).value=0) and
  602. not(is_shortstring(left.resulttype.def)) then
  603. CGMessage(cg_e_can_access_element_zero);
  604. case tstringdef(left.resulttype.def).string_typ of
  605. st_widestring :
  606. resulttype:=cwidechartype;
  607. st_ansistring :
  608. resulttype:=cchartype;
  609. st_longstring :
  610. resulttype:=cchartype;
  611. st_shortstring :
  612. resulttype:=cchartype;
  613. end;
  614. end;
  615. variantdef :
  616. resulttype:=cvarianttype;
  617. else
  618. CGMessage(type_e_array_required);
  619. end;
  620. end;
  621. procedure Tvecnode.mark_write;
  622. begin
  623. include(flags,nf_write);
  624. end;
  625. function tvecnode.pass_1 : tnode;
  626. {$ifdef consteval}
  627. var
  628. tcsym : ttypedconstsym;
  629. {$endif}
  630. begin
  631. result:=nil;
  632. firstpass(left);
  633. firstpass(right);
  634. if codegenerror then
  635. exit;
  636. if (nf_callunique in flags) and
  637. (is_ansistring(left.resulttype.def) or
  638. is_widestring(left.resulttype.def)) then
  639. begin
  640. left := ctypeconvnode.create_internal(ccallnode.createintern('fpc_'+tstringdef(left.resulttype.def).stringtypname+'_unique',
  641. ccallparanode.create(
  642. ctypeconvnode.create_internal(left,voidpointertype),nil)),
  643. left.resulttype);
  644. firstpass(left);
  645. { double resulttype passes somwhere else may cause this to be }
  646. { reset though :/ }
  647. exclude(flags,nf_callunique);
  648. end;
  649. { the register calculation is easy if a const index is used }
  650. if right.nodetype=ordconstn then
  651. begin
  652. {$ifdef consteval}
  653. { constant evaluation }
  654. if (left.nodetype=loadn) and
  655. (left.symtableentry.typ=typedconstsym) then
  656. begin
  657. tcsym:=ttypedconstsym(left.symtableentry);
  658. if tcsym.defintion^.typ=stringdef then
  659. begin
  660. end;
  661. end;
  662. {$endif}
  663. registersint:=left.registersint;
  664. { for ansi/wide strings, we need at least one register }
  665. if is_ansistring(left.resulttype.def) or
  666. is_widestring(left.resulttype.def) or
  667. { ... as well as for dynamic arrays }
  668. is_dynamic_array(left.resulttype.def) then
  669. registersint:=max(registersint,1);
  670. end
  671. else
  672. begin
  673. { this rules are suboptimal, but they should give }
  674. { good results }
  675. registersint:=max(left.registersint,right.registersint);
  676. { for ansi/wide strings, we need at least one register }
  677. if is_ansistring(left.resulttype.def) or
  678. is_widestring(left.resulttype.def) or
  679. { ... as well as for dynamic arrays }
  680. is_dynamic_array(left.resulttype.def) then
  681. registersint:=max(registersint,1);
  682. { need we an extra register when doing the restore ? }
  683. if (left.registersint<=right.registersint) and
  684. { only if the node needs less than 3 registers }
  685. { two for the right node and one for the }
  686. { left address }
  687. (registersint<3) then
  688. inc(registersint);
  689. { need we an extra register for the index ? }
  690. if (right.expectloc<>LOC_REGISTER)
  691. { only if the right node doesn't need a register }
  692. and (right.registersint<1) then
  693. inc(registersint);
  694. { not correct, but what works better ?
  695. if left.registersint>0 then
  696. registersint:=max(registersint,2)
  697. else
  698. min. one register
  699. registersint:=max(registersint,1);
  700. }
  701. end;
  702. registersfpu:=max(left.registersfpu,right.registersfpu);
  703. {$ifdef SUPPORT_MMX}
  704. registersmmx:=max(left.registersmmx,right.registersmmx);
  705. {$endif SUPPORT_MMX}
  706. if left.expectloc=LOC_CREFERENCE then
  707. expectloc:=LOC_CREFERENCE
  708. else
  709. expectloc:=LOC_REFERENCE;
  710. end;
  711. {*****************************************************************************
  712. TWITHNODE
  713. *****************************************************************************}
  714. constructor twithnode.create(l:tnode);
  715. begin
  716. inherited create(withn,l);
  717. fileinfo:=l.fileinfo;
  718. end;
  719. destructor twithnode.destroy;
  720. begin
  721. inherited destroy;
  722. end;
  723. constructor twithnode.ppuload(t:tnodetype;ppufile:tcompilerppufile);
  724. begin
  725. inherited ppuload(t,ppufile);
  726. end;
  727. procedure twithnode.ppuwrite(ppufile:tcompilerppufile);
  728. begin
  729. inherited ppuwrite(ppufile);
  730. end;
  731. function twithnode._getcopy : tnode;
  732. var
  733. p : twithnode;
  734. begin
  735. p:=twithnode(inherited _getcopy);
  736. result:=p;
  737. end;
  738. function twithnode.det_resulttype:tnode;
  739. begin
  740. result:=nil;
  741. resulttype:=voidtype;
  742. if assigned(left) then
  743. resulttypepass(left);
  744. end;
  745. function twithnode.pass_1 : tnode;
  746. begin
  747. result:=nil;
  748. expectloc:=LOC_VOID;
  749. registersint:=left.registersint;
  750. registersfpu:=left.registersfpu;
  751. {$ifdef SUPPORT_MMX}
  752. registersmmx:=left.registersmmx;
  753. {$endif SUPPORT_MMX}
  754. end;
  755. function twithnode.docompare(p: tnode): boolean;
  756. begin
  757. docompare :=
  758. inherited docompare(p);
  759. end;
  760. begin
  761. cloadvmtaddrnode := tloadvmtaddrnode;
  762. caddrnode := taddrnode;
  763. cderefnode := tderefnode;
  764. csubscriptnode := tsubscriptnode;
  765. cvecnode := tvecnode;
  766. cwithnode := twithnode;
  767. end.