nmem.pas 31 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817818819820821822823824825826827828829830831832833834835836837838839840841842843844845846847848849850851852853854855856857858859860861862863864865866867868869870871872873874875876877878879880881882883884885886887888889890891892893894895896897898899900901902903904905906907908909910911912913914915916917918919920921922923924925926927928929930931932933934935936937938939940941942943944945946947948949950951952953954955956957958959960961962963964965966967968969970971972973974975976977978979980981982983984985986987988989990991992993994995996997998999100010011002100310041005100610071008
  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,nutils,
  116. htypechk,pass_1,ncal,nld,ncon,ncnv,cgbase,procinfo
  117. ;
  118. {*****************************************************************************
  119. TLOADVMTADDRNODE
  120. *****************************************************************************}
  121. constructor tloadvmtaddrnode.create(l : tnode);
  122. begin
  123. inherited create(loadvmtaddrn,l);
  124. end;
  125. function tloadvmtaddrnode.det_resulttype:tnode;
  126. begin
  127. result:=nil;
  128. resulttypepass(left);
  129. if codegenerror then
  130. exit;
  131. case left.resulttype.def.deftype of
  132. classrefdef :
  133. resulttype:=left.resulttype;
  134. objectdef :
  135. resulttype.setdef(tclassrefdef.create(left.resulttype));
  136. else
  137. Message(parser_e_pointer_to_class_expected);
  138. end;
  139. end;
  140. function tloadvmtaddrnode.pass_1 : tnode;
  141. begin
  142. result:=nil;
  143. expectloc:=LOC_REGISTER;
  144. if left.nodetype<>typen then
  145. begin
  146. firstpass(left);
  147. registersint:=left.registersint;
  148. end;
  149. if registersint<1 then
  150. registersint:=1;
  151. end;
  152. {*****************************************************************************
  153. TLOADPARENTFPNODE
  154. *****************************************************************************}
  155. constructor tloadparentfpnode.create(pd:tprocdef);
  156. begin
  157. inherited create(loadparentfpn,nil);
  158. if not assigned(pd) then
  159. internalerror(200309288);
  160. if (pd.parast.symtablelevel>current_procinfo.procdef.parast.symtablelevel) then
  161. internalerror(200309284);
  162. parentpd:=pd;
  163. end;
  164. constructor tloadparentfpnode.ppuload(t:tnodetype;ppufile:tcompilerppufile);
  165. begin
  166. inherited ppuload(t,ppufile);
  167. ppufile.getderef(parentpdderef);
  168. end;
  169. procedure tloadparentfpnode.ppuwrite(ppufile:tcompilerppufile);
  170. begin
  171. inherited ppuwrite(ppufile);
  172. ppufile.putderef(parentpdderef);
  173. end;
  174. procedure tloadparentfpnode.buildderefimpl;
  175. begin
  176. inherited buildderefimpl;
  177. parentpdderef.build(parentpd);
  178. end;
  179. procedure tloadparentfpnode.derefimpl;
  180. begin
  181. inherited derefimpl;
  182. parentpd:=tprocdef(parentpdderef.resolve);
  183. end;
  184. function tloadparentfpnode.getcopy : tnode;
  185. var
  186. p : tloadparentfpnode;
  187. begin
  188. p:=tloadparentfpnode(inherited getcopy);
  189. p.parentpd:=parentpd;
  190. getcopy:=p;
  191. end;
  192. function tloadparentfpnode.det_resulttype:tnode;
  193. begin
  194. result:=nil;
  195. resulttype:=voidpointertype;
  196. end;
  197. function tloadparentfpnode.pass_1 : tnode;
  198. begin
  199. result:=nil;
  200. expectloc:=LOC_REGISTER;
  201. registersint:=1;
  202. end;
  203. {*****************************************************************************
  204. TADDRNODE
  205. *****************************************************************************}
  206. constructor taddrnode.create(l : tnode);
  207. begin
  208. inherited create(addrn,l);
  209. getprocvardef:=nil;
  210. end;
  211. constructor taddrnode.ppuload(t:tnodetype;ppufile:tcompilerppufile);
  212. begin
  213. inherited ppuload(t,ppufile);
  214. ppufile.getderef(getprocvardefderef);
  215. end;
  216. procedure taddrnode.ppuwrite(ppufile:tcompilerppufile);
  217. begin
  218. inherited ppuwrite(ppufile);
  219. ppufile.putderef(getprocvardefderef);
  220. end;
  221. procedure Taddrnode.mark_write;
  222. begin
  223. {@procvar:=nil is legal in Delphi mode.}
  224. left.mark_write;
  225. end;
  226. procedure taddrnode.buildderefimpl;
  227. begin
  228. inherited buildderefimpl;
  229. getprocvardefderef.build(getprocvardef);
  230. end;
  231. procedure taddrnode.derefimpl;
  232. begin
  233. inherited derefimpl;
  234. getprocvardef:=tprocvardef(getprocvardefderef.resolve);
  235. end;
  236. function taddrnode.getcopy : tnode;
  237. var
  238. p : taddrnode;
  239. begin
  240. p:=taddrnode(inherited getcopy);
  241. p.getprocvardef:=getprocvardef;
  242. getcopy:=p;
  243. end;
  244. function taddrnode.det_resulttype:tnode;
  245. var
  246. hp : tnode;
  247. hp2 : TParaItem;
  248. hp3 : tabstractprocdef;
  249. begin
  250. result:=nil;
  251. resulttypepass(left);
  252. if codegenerror then
  253. exit;
  254. make_not_regable(left);
  255. { don't allow constants }
  256. if is_constnode(left) then
  257. begin
  258. aktfilepos:=left.fileinfo;
  259. CGMessage(type_e_no_addr_of_constant);
  260. exit;
  261. end;
  262. { tp @procvar support (type of @procvar is a void pointer)
  263. Note: we need to leave the addrn in the tree,
  264. else we can't see the difference between @procvar and procvar.
  265. we set the procvarload flag so a secondpass does nothing for
  266. this node (PFV) }
  267. if (m_tp_procvar in aktmodeswitches) then
  268. begin
  269. case left.nodetype of
  270. calln :
  271. begin
  272. { a load of a procvar can't have parameters }
  273. if assigned(tcallnode(left).left) then
  274. CGMessage(parser_e_illegal_expression);
  275. { is it a procvar? }
  276. hp:=tcallnode(left).right;
  277. if assigned(hp) then
  278. begin
  279. { remove calln node }
  280. tcallnode(left).right:=nil;
  281. left.free;
  282. left:=hp;
  283. include(flags,nf_procvarload);
  284. end;
  285. end;
  286. loadn,
  287. subscriptn,
  288. typeconvn,
  289. vecn,
  290. derefn :
  291. begin
  292. if left.resulttype.def.deftype=procvardef then
  293. include(flags,nf_procvarload);
  294. end;
  295. end;
  296. if nf_procvarload in flags then
  297. begin
  298. resulttype:=voidpointertype;
  299. exit;
  300. end;
  301. end;
  302. { proc 2 procvar ? }
  303. if left.nodetype=calln then
  304. { if it were a valid construct, the addr node would already have }
  305. { been removed in the parser. This happens for (in FPC mode) }
  306. { procvar1 := @procvar2(parameters); }
  307. CGMessage(parser_e_illegal_expression)
  308. else
  309. if (left.nodetype=loadn) and (tloadnode(left).symtableentry.typ=procsym) then
  310. begin
  311. { the address is already available when loading a procedure of object }
  312. if assigned(tloadnode(left).left) then
  313. include(flags,nf_procvarload);
  314. { result is a procedure variable }
  315. { No, to be TP compatible, you must return a voidpointer to
  316. the procedure that is stored in the procvar.}
  317. if not(m_tp_procvar in aktmodeswitches) then
  318. begin
  319. if assigned(getprocvardef) and
  320. (tprocsym(tloadnode(left).symtableentry).procdef_count>1) then
  321. begin
  322. hp3:=tprocsym(tloadnode(left).symtableentry).search_procdef_byprocvardef(getprocvardef);
  323. if not assigned(hp3) then
  324. begin
  325. IncompatibleTypes(tprocsym(tloadnode(left).symtableentry).first_procdef,getprocvardef);
  326. exit;
  327. end;
  328. end
  329. else
  330. hp3:=tabstractprocdef(tprocsym(tloadnode(left).symtableentry).first_procdef);
  331. { create procvardef }
  332. resulttype.setdef(tprocvardef.create(hp3.parast.symtablelevel));
  333. tprocvardef(resulttype.def).proctypeoption:=hp3.proctypeoption;
  334. tprocvardef(resulttype.def).proccalloption:=hp3.proccalloption;
  335. tprocvardef(resulttype.def).procoptions:=hp3.procoptions;
  336. tprocvardef(resulttype.def).rettype:=hp3.rettype;
  337. { method ? then set the methodpointer flag }
  338. if (hp3.owner.symtabletype=objectsymtable) then
  339. include(tprocvardef(resulttype.def).procoptions,po_methodpointer);
  340. { only need the address of the method? this is needed
  341. for @tobject.create }
  342. if not assigned(tloadnode(left).left) then
  343. include(tprocvardef(resulttype.def).procoptions,po_addressonly);
  344. { Add parameters in left to right order }
  345. hp2:=TParaItem(hp3.Para.first);
  346. while assigned(hp2) do
  347. begin
  348. tprocvardef(resulttype.def).concatpara(nil,hp2.paratype,hp2.parasym,
  349. hp2.defaultvalue,hp2.is_hidden);
  350. hp2:=TParaItem(hp2.next);
  351. end;
  352. end
  353. else
  354. resulttype:=voidpointertype;
  355. end
  356. else
  357. begin
  358. { what are we getting the address from an absolute sym? }
  359. hp:=left;
  360. while assigned(hp) and (hp.nodetype in [vecn,derefn,subscriptn]) do
  361. hp:=tunarynode(hp).left;
  362. {$ifdef i386}
  363. if assigned(hp) and
  364. (hp.nodetype=loadn) and
  365. ((tloadnode(hp).symtableentry.typ=absolutesym) and
  366. tabsolutesym(tloadnode(hp).symtableentry).absseg) then
  367. begin
  368. if not(nf_typedaddr in flags) then
  369. resulttype:=voidfarpointertype
  370. else
  371. resulttype.setdef(tpointerdef.createfar(left.resulttype));
  372. end
  373. else
  374. {$endif i386}
  375. begin
  376. if not(nf_typedaddr in flags) then
  377. resulttype:=voidpointertype
  378. else
  379. resulttype.setdef(tpointerdef.create(left.resulttype));
  380. end;
  381. end;
  382. { this is like the function addr }
  383. inc(parsing_para_level);
  384. set_varstate(left,vs_used,false);
  385. dec(parsing_para_level);
  386. end;
  387. function taddrnode.pass_1 : tnode;
  388. begin
  389. result:=nil;
  390. firstpass(left);
  391. if codegenerror then
  392. exit;
  393. if nf_procvarload in flags then
  394. begin
  395. registersint:=left.registersint;
  396. registersfpu:=left.registersfpu;
  397. {$ifdef SUPPORT_MMX}
  398. registersmmx:=left.registersmmx;
  399. {$endif SUPPORT_MMX}
  400. if registersint<1 then
  401. registersint:=1;
  402. expectloc:=left.expectloc;
  403. exit;
  404. end;
  405. { we should allow loc_mem for @string }
  406. if not(left.expectloc in [LOC_CREFERENCE,LOC_REFERENCE]) then
  407. begin
  408. aktfilepos:=left.fileinfo;
  409. CGMessage(parser_e_illegal_expression);
  410. end;
  411. registersint:=left.registersint;
  412. registersfpu:=left.registersfpu;
  413. {$ifdef SUPPORT_MMX}
  414. registersmmx:=left.registersmmx;
  415. {$endif SUPPORT_MMX}
  416. if registersint<1 then
  417. registersint:=1;
  418. { is this right for object of methods ?? }
  419. expectloc:=LOC_REGISTER;
  420. end;
  421. {*****************************************************************************
  422. TDEREFNODE
  423. *****************************************************************************}
  424. constructor tderefnode.create(l : tnode);
  425. begin
  426. inherited create(derefn,l);
  427. end;
  428. function tderefnode.det_resulttype:tnode;
  429. begin
  430. result:=nil;
  431. resulttypepass(left);
  432. set_varstate(left,vs_used,true);
  433. if codegenerror then
  434. exit;
  435. { tp procvar support }
  436. maybe_call_procvar(left,true);
  437. if left.resulttype.def.deftype=pointerdef then
  438. resulttype:=tpointerdef(left.resulttype.def).pointertype
  439. else
  440. CGMessage(parser_e_invalid_qualifier);
  441. end;
  442. procedure Tderefnode.mark_write;
  443. begin
  444. include(flags,nf_write);
  445. end;
  446. function tderefnode.pass_1 : tnode;
  447. begin
  448. result:=nil;
  449. firstpass(left);
  450. if codegenerror then
  451. exit;
  452. registersint:=max(left.registersint,1);
  453. registersfpu:=left.registersfpu;
  454. {$ifdef SUPPORT_MMX}
  455. registersmmx:=left.registersmmx;
  456. {$endif SUPPORT_MMX}
  457. expectloc:=LOC_REFERENCE;
  458. end;
  459. {*****************************************************************************
  460. TSUBSCRIPTNODE
  461. *****************************************************************************}
  462. constructor tsubscriptnode.create(varsym : tsym;l : tnode);
  463. begin
  464. inherited create(subscriptn,l);
  465. { vs should be changed to tsym! }
  466. vs:=tvarsym(varsym);
  467. end;
  468. constructor tsubscriptnode.ppuload(t:tnodetype;ppufile:tcompilerppufile);
  469. begin
  470. inherited ppuload(t,ppufile);
  471. ppufile.getderef(vsderef);
  472. end;
  473. procedure tsubscriptnode.ppuwrite(ppufile:tcompilerppufile);
  474. begin
  475. inherited ppuwrite(ppufile);
  476. ppufile.putderef(vsderef);
  477. end;
  478. procedure tsubscriptnode.buildderefimpl;
  479. begin
  480. inherited buildderefimpl;
  481. vsderef.build(vs);
  482. end;
  483. procedure tsubscriptnode.derefimpl;
  484. begin
  485. inherited derefimpl;
  486. vs:=tvarsym(vsderef.resolve);
  487. end;
  488. function tsubscriptnode.getcopy : tnode;
  489. var
  490. p : tsubscriptnode;
  491. begin
  492. p:=tsubscriptnode(inherited getcopy);
  493. p.vs:=vs;
  494. getcopy:=p;
  495. end;
  496. function tsubscriptnode.det_resulttype:tnode;
  497. begin
  498. result:=nil;
  499. resulttypepass(left);
  500. { tp procvar support }
  501. maybe_call_procvar(left,true);
  502. resulttype:=vs.vartype;
  503. end;
  504. procedure Tsubscriptnode.mark_write;
  505. begin
  506. include(flags,nf_write);
  507. end;
  508. function tsubscriptnode.pass_1 : tnode;
  509. begin
  510. result:=nil;
  511. firstpass(left);
  512. if codegenerror then
  513. exit;
  514. registersint:=left.registersint;
  515. registersfpu:=left.registersfpu;
  516. {$ifdef SUPPORT_MMX}
  517. registersmmx:=left.registersmmx;
  518. {$endif SUPPORT_MMX}
  519. { classes must be dereferenced implicit }
  520. if is_class_or_interface(left.resulttype.def) then
  521. begin
  522. if registersint=0 then
  523. registersint:=1;
  524. expectloc:=LOC_REFERENCE;
  525. end
  526. else
  527. begin
  528. if (left.expectloc<>LOC_CREFERENCE) and
  529. (left.expectloc<>LOC_REFERENCE) then
  530. CGMessage(parser_e_illegal_expression);
  531. expectloc:=left.expectloc;
  532. end;
  533. end;
  534. function tsubscriptnode.docompare(p: tnode): boolean;
  535. begin
  536. docompare :=
  537. inherited docompare(p) and
  538. (vs = tsubscriptnode(p).vs);
  539. end;
  540. {*****************************************************************************
  541. TVECNODE
  542. *****************************************************************************}
  543. constructor tvecnode.create(l,r : tnode);
  544. begin
  545. inherited create(vecn,l,r);
  546. end;
  547. function tvecnode.det_resulttype:tnode;
  548. var
  549. htype : ttype;
  550. valid : boolean;
  551. begin
  552. result:=nil;
  553. resulttypepass(left);
  554. resulttypepass(right);
  555. { In p[1] p is always valid, it is not possible to
  556. declared a shortstring or normal array that has
  557. undefined number of elements. Dynamic array and
  558. ansi/widestring needs to be valid }
  559. valid:=is_dynamic_array(left.resulttype.def) or
  560. is_ansistring(left.resulttype.def) or
  561. is_widestring(left.resulttype.def);
  562. set_varstate(left,vs_used,valid);
  563. set_varstate(right,vs_used,true);
  564. if codegenerror then
  565. exit;
  566. { maybe type conversion for the index value, but
  567. do not convert enums,booleans,char }
  568. if (right.resulttype.def.deftype<>enumdef) and
  569. not(is_char(right.resulttype.def)) and
  570. not(is_boolean(right.resulttype.def)) then
  571. begin
  572. inserttypeconv(right,s32inttype);
  573. end;
  574. case left.resulttype.def.deftype of
  575. arraydef :
  576. begin
  577. { check type of the index value }
  578. if (compare_defs(right.resulttype.def,tarraydef(left.resulttype.def).rangetype.def,right.nodetype)=te_incompatible) then
  579. IncompatibleTypes(right.resulttype.def,tarraydef(left.resulttype.def).rangetype.def);
  580. resulttype:=tarraydef(left.resulttype.def).elementtype;
  581. end;
  582. pointerdef :
  583. begin
  584. { are we accessing a pointer[], then convert the pointer to
  585. an array first, in FPC this is allowed for all pointers in
  586. delphi/tp7 it's only allowed for pchars }
  587. if (m_fpc in aktmodeswitches) or
  588. is_pchar(left.resulttype.def) or
  589. is_pwidechar(left.resulttype.def) then
  590. begin
  591. { convert pointer to array }
  592. htype.setdef(tarraydef.create_from_pointer(tpointerdef(left.resulttype.def).pointertype));
  593. inserttypeconv(left,htype);
  594. resulttype:=tarraydef(htype.def).elementtype;
  595. end
  596. else
  597. CGMessage(type_e_array_required);
  598. end;
  599. stringdef :
  600. begin
  601. { indexed access to 0 element is only allowed for shortstrings }
  602. if (right.nodetype=ordconstn) and
  603. (tordconstnode(right).value=0) and
  604. not(is_shortstring(left.resulttype.def)) then
  605. CGMessage(cg_e_can_access_element_zero);
  606. case tstringdef(left.resulttype.def).string_typ of
  607. st_widestring :
  608. resulttype:=cwidechartype;
  609. {$ifdef ansistring_bits}
  610. st_ansistring16,st_ansistring32,st_ansistring64 :
  611. {$else}
  612. st_ansistring :
  613. {$endif}
  614. resulttype:=cchartype;
  615. st_longstring :
  616. resulttype:=cchartype;
  617. st_shortstring :
  618. resulttype:=cchartype;
  619. end;
  620. end;
  621. variantdef :
  622. resulttype:=cvarianttype;
  623. else
  624. CGMessage(type_e_array_required);
  625. end;
  626. end;
  627. procedure Tvecnode.mark_write;
  628. begin
  629. include(flags,nf_write);
  630. end;
  631. function tvecnode.pass_1 : tnode;
  632. {$ifdef consteval}
  633. var
  634. tcsym : ttypedconstsym;
  635. {$endif}
  636. begin
  637. result:=nil;
  638. firstpass(left);
  639. firstpass(right);
  640. if codegenerror then
  641. exit;
  642. if (nf_callunique in flags) and
  643. (is_ansistring(left.resulttype.def) or
  644. is_widestring(left.resulttype.def)) then
  645. begin
  646. left := ctypeconvnode.create_explicit(ccallnode.createintern('fpc_'+tstringdef(left.resulttype.def).stringtypname+'_unique',
  647. ccallparanode.create(
  648. ctypeconvnode.create_explicit(left,voidpointertype),nil)),
  649. left.resulttype);
  650. firstpass(left);
  651. { double resulttype passes somwhere else may cause this to be }
  652. { reset though :/ }
  653. exclude(flags,nf_callunique);
  654. end;
  655. { the register calculation is easy if a const index is used }
  656. if right.nodetype=ordconstn then
  657. begin
  658. {$ifdef consteval}
  659. { constant evaluation }
  660. if (left.nodetype=loadn) and
  661. (left.symtableentry.typ=typedconstsym) then
  662. begin
  663. tcsym:=ttypedconstsym(left.symtableentry);
  664. if tcsym.defintion^.typ=stringdef then
  665. begin
  666. end;
  667. end;
  668. {$endif}
  669. registersint:=left.registersint;
  670. { for ansi/wide strings, we need at least one register }
  671. if is_ansistring(left.resulttype.def) or
  672. is_widestring(left.resulttype.def) or
  673. { ... as well as for dynamic arrays }
  674. is_dynamic_array(left.resulttype.def) then
  675. registersint:=max(registersint,1);
  676. end
  677. else
  678. begin
  679. { this rules are suboptimal, but they should give }
  680. { good results }
  681. registersint:=max(left.registersint,right.registersint);
  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. registersint:=max(registersint,1);
  688. { need we an extra register when doing the restore ? }
  689. if (left.registersint<=right.registersint) and
  690. { only if the node needs less than 3 registers }
  691. { two for the right node and one for the }
  692. { left address }
  693. (registersint<3) then
  694. inc(registersint);
  695. { need we an extra register for the index ? }
  696. if (right.expectloc<>LOC_REGISTER)
  697. { only if the right node doesn't need a register }
  698. and (right.registersint<1) then
  699. inc(registersint);
  700. { not correct, but what works better ?
  701. if left.registersint>0 then
  702. registersint:=max(registersint,2)
  703. else
  704. min. one register
  705. registersint:=max(registersint,1);
  706. }
  707. end;
  708. registersfpu:=max(left.registersfpu,right.registersfpu);
  709. {$ifdef SUPPORT_MMX}
  710. registersmmx:=max(left.registersmmx,right.registersmmx);
  711. {$endif SUPPORT_MMX}
  712. if left.expectloc=LOC_CREFERENCE then
  713. expectloc:=LOC_CREFERENCE
  714. else
  715. expectloc:=LOC_REFERENCE;
  716. end;
  717. {*****************************************************************************
  718. TWITHNODE
  719. *****************************************************************************}
  720. constructor twithnode.create(l:tnode;symtable:twithsymtable;count:longint;r:tnode);
  721. begin
  722. inherited create(withn,l);
  723. withrefnode:=r;
  724. withsymtable:=symtable;
  725. tablecount:=count;
  726. set_file_line(l);
  727. end;
  728. destructor twithnode.destroy;
  729. var
  730. hsymt,
  731. symt : tsymtable;
  732. i : longint;
  733. begin
  734. symt:=withsymtable;
  735. for i:=1 to tablecount do
  736. begin
  737. if assigned(symt) then
  738. begin
  739. hsymt:=symt.next;
  740. symt.free;
  741. symt:=hsymt;
  742. end;
  743. end;
  744. inherited destroy;
  745. end;
  746. constructor twithnode.ppuload(t:tnodetype;ppufile:tcompilerppufile);
  747. begin
  748. inherited ppuload(t,ppufile);
  749. internalerror(200208192);
  750. end;
  751. procedure twithnode.ppuwrite(ppufile:tcompilerppufile);
  752. begin
  753. inherited ppuwrite(ppufile);
  754. internalerror(200208193);
  755. end;
  756. function twithnode.getcopy : tnode;
  757. var
  758. p : twithnode;
  759. begin
  760. p:=twithnode(inherited getcopy);
  761. p.withsymtable:=withsymtable;
  762. p.tablecount:=tablecount;
  763. if assigned(p.withrefnode) then
  764. p.withrefnode:=withrefnode.getcopy
  765. else
  766. p.withrefnode:=nil;
  767. result:=p;
  768. end;
  769. function twithnode.det_resulttype:tnode;
  770. begin
  771. result:=nil;
  772. resulttype:=voidtype;
  773. resulttypepass(withrefnode);
  774. //unset_varstate(withrefnode);
  775. set_varstate(withrefnode,vs_used,true);
  776. if codegenerror then
  777. exit;
  778. if (withrefnode.nodetype=vecn) and
  779. (nf_memseg in withrefnode.flags) then
  780. CGMessage(parser_e_no_with_for_variable_in_other_segments);
  781. if assigned(left) then
  782. resulttypepass(left);
  783. end;
  784. function twithnode.pass_1 : tnode;
  785. begin
  786. result:=nil;
  787. expectloc:=LOC_VOID;
  788. if assigned(left) then
  789. begin
  790. firstpass(left);
  791. registersint:=left.registersint;
  792. registersfpu:=left.registersfpu;
  793. {$ifdef SUPPORT_MMX}
  794. registersmmx:=left.registersmmx;
  795. {$endif SUPPORT_MMX}
  796. end;
  797. if assigned(withrefnode) then
  798. begin
  799. firstpass(withrefnode);
  800. if withrefnode.registersint > registersint then
  801. registersint:=withrefnode.registersint;
  802. if withrefnode.registersfpu > registersfpu then
  803. registersint:=withrefnode.registersfpu;
  804. {$ifdef SUPPORT_MMX}
  805. if withrefnode.registersmmx > registersmmx then
  806. registersmmx:=withrefnode.registersmmx;
  807. {$endif SUPPORT_MMX}
  808. end;
  809. end;
  810. function twithnode.docompare(p: tnode): boolean;
  811. begin
  812. docompare :=
  813. inherited docompare(p) and
  814. (withsymtable = twithnode(p).withsymtable) and
  815. (tablecount = twithnode(p).tablecount) and
  816. (withrefnode.isequal(twithnode(p).withrefnode));
  817. end;
  818. begin
  819. cloadvmtaddrnode := tloadvmtaddrnode;
  820. caddrnode := taddrnode;
  821. cderefnode := tderefnode;
  822. csubscriptnode := tsubscriptnode;
  823. cvecnode := tvecnode;
  824. cwithnode := twithnode;
  825. end.
  826. {
  827. $Log$
  828. Revision 1.86 2004-09-26 17:45:30 peter
  829. * simple regvar support, not yet finished
  830. Revision 1.85 2004/06/20 08:55:29 florian
  831. * logs truncated
  832. Revision 1.84 2004/06/16 20:07:09 florian
  833. * dwarf branch merged
  834. Revision 1.83 2004/04/29 19:56:37 daniel
  835. * Prepare compiler infrastructure for multiple ansistring types
  836. Revision 1.82.2.1 2004/04/28 19:55:51 peter
  837. * new warning for ordinal-pointer when size is different
  838. * fixed some cg_e_ messages to the correct section type_e_ or parser_e_
  839. Revision 1.82 2004/03/29 14:42:52 peter
  840. * variant array support
  841. Revision 1.81 2004/03/18 16:19:03 peter
  842. * fixed operator overload allowing for pointer-string
  843. * replaced some type_e_mismatch with more informational messages
  844. }