nmem.pas 31 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817818819820821822823824825826827828829830831832833834835836837838839840841842843844845846847848849850851852853854855856857858859860861862863864865866867868869870871872873874875876877878879880881882883884885886887888889890891892893894895896897898899900901902903904905906907908909910911912913914915916917918919920921922923924925926927928929930931932933934935936937938939940941942943944945946947948
  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 pass_typecheck: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 pass_typecheck:tnode;override;
  40. function docompare(p: tnode): boolean; override;
  41. function dogetcopy : tnode;override;
  42. end;
  43. tloadparentfpnodeclass = class of tloadparentfpnode;
  44. taddrnode = class(tunarynode)
  45. getprocvardef : tprocvardef;
  46. getprocvardefderef : tderef;
  47. constructor create(l : tnode);virtual;
  48. constructor create_internal(l : tnode); virtual;
  49. constructor create_internal_nomark(l : tnode); virtual;
  50. constructor ppuload(t:tnodetype;ppufile:tcompilerppufile);override;
  51. procedure ppuwrite(ppufile:tcompilerppufile);override;
  52. procedure mark_write;override;
  53. procedure buildderefimpl;override;
  54. procedure derefimpl;override;
  55. function docompare(p: tnode): boolean; override;
  56. function dogetcopy : tnode;override;
  57. function pass_1 : tnode;override;
  58. function pass_typecheck:tnode;override;
  59. private
  60. mark_read_written: boolean;
  61. end;
  62. taddrnodeclass = class of taddrnode;
  63. tderefnode = class(tunarynode)
  64. constructor create(l : tnode);virtual;
  65. function pass_1 : tnode;override;
  66. function pass_typecheck:tnode;override;
  67. procedure mark_write;override;
  68. end;
  69. tderefnodeclass = class of tderefnode;
  70. tsubscriptnode = class(tunarynode)
  71. vs : tfieldvarsym;
  72. vsderef : tderef;
  73. constructor create(varsym : tsym;l : tnode);virtual;
  74. constructor ppuload(t:tnodetype;ppufile:tcompilerppufile);override;
  75. procedure ppuwrite(ppufile:tcompilerppufile);override;
  76. procedure buildderefimpl;override;
  77. procedure derefimpl;override;
  78. function dogetcopy : tnode;override;
  79. function pass_1 : tnode;override;
  80. function docompare(p: tnode): boolean; override;
  81. function pass_typecheck:tnode;override;
  82. procedure mark_write;override;
  83. end;
  84. tsubscriptnodeclass = class of tsubscriptnode;
  85. tvecnode = class(tbinarynode)
  86. constructor create(l,r : tnode);virtual;
  87. function pass_1 : tnode;override;
  88. function pass_typecheck:tnode;override;
  89. procedure mark_write;override;
  90. end;
  91. tvecnodeclass = class of tvecnode;
  92. twithnode = class(tunarynode)
  93. constructor create(l:tnode);
  94. destructor destroy;override;
  95. constructor ppuload(t:tnodetype;ppufile:tcompilerppufile);override;
  96. procedure ppuwrite(ppufile:tcompilerppufile);override;
  97. function dogetcopy : tnode;override;
  98. function pass_1 : tnode;override;
  99. function docompare(p: tnode): boolean; override;
  100. function pass_typecheck:tnode;override;
  101. end;
  102. twithnodeclass = class of twithnode;
  103. var
  104. cloadvmtaddrnode : tloadvmtaddrnodeclass;
  105. cloadparentfpnode : tloadparentfpnodeclass;
  106. caddrnode : taddrnodeclass;
  107. cderefnode : tderefnodeclass;
  108. csubscriptnode : tsubscriptnodeclass;
  109. cvecnode : tvecnodeclass;
  110. cwithnode : twithnodeclass;
  111. function is_big_untyped_addrnode(p: tnode): boolean;
  112. implementation
  113. uses
  114. globtype,systems,constexp,
  115. cutils,verbose,globals,
  116. symconst,symbase,defutil,defcmp,
  117. nbas,nutils,
  118. htypechk,pass_1,ncal,nld,ncon,ncnv,cgbase,procinfo
  119. ;
  120. {*****************************************************************************
  121. TLOADVMTADDRNODE
  122. *****************************************************************************}
  123. constructor tloadvmtaddrnode.create(l : tnode);
  124. begin
  125. inherited create(loadvmtaddrn,l);
  126. end;
  127. function tloadvmtaddrnode.pass_typecheck:tnode;
  128. begin
  129. result:=nil;
  130. typecheckpass(left);
  131. if codegenerror then
  132. exit;
  133. case left.resultdef.typ of
  134. classrefdef :
  135. resultdef:=left.resultdef;
  136. objectdef :
  137. resultdef:=tclassrefdef.create(left.resultdef);
  138. else
  139. Message(parser_e_pointer_to_class_expected);
  140. end;
  141. end;
  142. function tloadvmtaddrnode.pass_1 : tnode;
  143. begin
  144. result:=nil;
  145. expectloc:=LOC_REGISTER;
  146. if left.nodetype<>typen then
  147. firstpass(left);
  148. end;
  149. {*****************************************************************************
  150. TLOADPARENTFPNODE
  151. *****************************************************************************}
  152. constructor tloadparentfpnode.create(pd:tprocdef);
  153. begin
  154. inherited create(loadparentfpn,nil);
  155. if not assigned(pd) then
  156. internalerror(200309288);
  157. if (pd.parast.symtablelevel>current_procinfo.procdef.parast.symtablelevel) then
  158. internalerror(200309284);
  159. parentpd:=pd;
  160. end;
  161. constructor tloadparentfpnode.ppuload(t:tnodetype;ppufile:tcompilerppufile);
  162. begin
  163. inherited ppuload(t,ppufile);
  164. ppufile.getderef(parentpdderef);
  165. end;
  166. procedure tloadparentfpnode.ppuwrite(ppufile:tcompilerppufile);
  167. begin
  168. inherited ppuwrite(ppufile);
  169. ppufile.putderef(parentpdderef);
  170. end;
  171. procedure tloadparentfpnode.buildderefimpl;
  172. begin
  173. inherited buildderefimpl;
  174. parentpdderef.build(parentpd);
  175. end;
  176. procedure tloadparentfpnode.derefimpl;
  177. begin
  178. inherited derefimpl;
  179. parentpd:=tprocdef(parentpdderef.resolve);
  180. end;
  181. function tloadparentfpnode.docompare(p: tnode): boolean;
  182. begin
  183. result:=
  184. inherited docompare(p) and
  185. (tloadparentfpnode(p).parentpd=parentpd);
  186. end;
  187. function tloadparentfpnode.dogetcopy : tnode;
  188. var
  189. p : tloadparentfpnode;
  190. begin
  191. p:=tloadparentfpnode(inherited dogetcopy);
  192. p.parentpd:=parentpd;
  193. dogetcopy:=p;
  194. end;
  195. function tloadparentfpnode.pass_typecheck:tnode;
  196. {$ifdef dummy}
  197. var
  198. currpi : tprocinfo;
  199. hsym : tparavarsym;
  200. {$endif dummy}
  201. begin
  202. result:=nil;
  203. resultdef:=voidpointertype;
  204. {$ifdef dummy}
  205. { currently parentfps are never loaded in registers (FK) }
  206. if (current_procinfo.procdef.parast.symtablelevel<>parentpd.parast.symtablelevel) then
  207. begin
  208. currpi:=current_procinfo;
  209. { walk parents }
  210. while (currpi.procdef.owner.symtablelevel>parentpd.parast.symtablelevel) do
  211. begin
  212. currpi:=currpi.parent;
  213. if not assigned(currpi) then
  214. internalerror(2005040602);
  215. hsym:=tparavarsym(currpi.procdef.parast.Find('parentfp'));
  216. if not assigned(hsym) then
  217. internalerror(2005040601);
  218. hsym.varregable:=vr_none;
  219. end;
  220. end;
  221. {$endif dummy}
  222. end;
  223. function tloadparentfpnode.pass_1 : tnode;
  224. begin
  225. result:=nil;
  226. expectloc:=LOC_REGISTER;
  227. end;
  228. {*****************************************************************************
  229. TADDRNODE
  230. *****************************************************************************}
  231. constructor taddrnode.create(l : tnode);
  232. begin
  233. inherited create(addrn,l);
  234. getprocvardef:=nil;
  235. mark_read_written := true;
  236. end;
  237. constructor taddrnode.create_internal(l : tnode);
  238. begin
  239. self.create(l);
  240. include(flags,nf_internal);
  241. end;
  242. constructor taddrnode.create_internal_nomark(l : tnode);
  243. begin
  244. self.create_internal(l);
  245. mark_read_written := false;
  246. end;
  247. constructor taddrnode.ppuload(t:tnodetype;ppufile:tcompilerppufile);
  248. begin
  249. inherited ppuload(t,ppufile);
  250. ppufile.getderef(getprocvardefderef);
  251. end;
  252. procedure taddrnode.ppuwrite(ppufile:tcompilerppufile);
  253. begin
  254. inherited ppuwrite(ppufile);
  255. ppufile.putderef(getprocvardefderef);
  256. end;
  257. procedure Taddrnode.mark_write;
  258. begin
  259. {@procvar:=nil is legal in Delphi mode.}
  260. left.mark_write;
  261. end;
  262. procedure taddrnode.buildderefimpl;
  263. begin
  264. inherited buildderefimpl;
  265. getprocvardefderef.build(getprocvardef);
  266. end;
  267. procedure taddrnode.derefimpl;
  268. begin
  269. inherited derefimpl;
  270. getprocvardef:=tprocvardef(getprocvardefderef.resolve);
  271. end;
  272. function taddrnode.docompare(p: tnode): boolean;
  273. begin
  274. result:=
  275. inherited docompare(p) and
  276. (taddrnode(p).getprocvardef=getprocvardef);
  277. end;
  278. function taddrnode.dogetcopy : tnode;
  279. var
  280. p : taddrnode;
  281. begin
  282. p:=taddrnode(inherited dogetcopy);
  283. p.getprocvardef:=getprocvardef;
  284. dogetcopy:=p;
  285. end;
  286. function taddrnode.pass_typecheck:tnode;
  287. var
  288. hp : tnode;
  289. hsym : tfieldvarsym;
  290. isprocvar : boolean;
  291. begin
  292. result:=nil;
  293. typecheckpass(left);
  294. if codegenerror then
  295. exit;
  296. make_not_regable(left,[ra_addr_regable,ra_addr_taken]);
  297. { don't allow constants, for internal use we also
  298. allow taking the address of strings }
  299. if is_constnode(left) and
  300. not(
  301. (nf_internal in flags) and
  302. (left.nodetype in [stringconstn])
  303. ) then
  304. begin
  305. current_filepos:=left.fileinfo;
  306. CGMessage(type_e_no_addr_of_constant);
  307. exit;
  308. end;
  309. { Handle @proc special, also @procvar in tp-mode needs
  310. special handling }
  311. if (left.resultdef.typ=procdef) or
  312. (
  313. (left.resultdef.typ=procvardef) and
  314. ((m_tp_procvar in current_settings.modeswitches) or
  315. (m_mac_procvar in current_settings.modeswitches))
  316. ) then
  317. begin
  318. isprocvar:=(left.resultdef.typ=procvardef);
  319. if not isprocvar then
  320. begin
  321. left:=ctypeconvnode.create_proc_to_procvar(left);
  322. typecheckpass(left);
  323. end;
  324. { In tp procvar mode the result is always a voidpointer. Insert
  325. a typeconversion to voidpointer. For methodpointers we need
  326. to load the proc field }
  327. if (m_tp_procvar in current_settings.modeswitches) or
  328. (m_mac_procvar in current_settings.modeswitches) then
  329. begin
  330. if tabstractprocdef(left.resultdef).is_addressonly then
  331. begin
  332. result:=ctypeconvnode.create_internal(left,voidpointertype);
  333. include(result.flags,nf_load_procvar);
  334. left:=nil;
  335. end
  336. else
  337. begin
  338. { For procvars we need to return the proc field of the
  339. methodpointer }
  340. if isprocvar then
  341. begin
  342. { find proc field in methodpointer record }
  343. hsym:=tfieldvarsym(trecorddef(methodpointertype).symtable.Find('proc'));
  344. if not assigned(hsym) then
  345. internalerror(200412041);
  346. { Load tmehodpointer(left).proc }
  347. result:=csubscriptnode.create(
  348. hsym,
  349. ctypeconvnode.create_internal(left,methodpointertype));
  350. left:=nil;
  351. end
  352. else
  353. CGMessage(type_e_variable_id_expected);
  354. end;
  355. end
  356. else
  357. begin
  358. { Return the typeconvn only }
  359. result:=left;
  360. left:=nil;
  361. end;
  362. end
  363. else
  364. begin
  365. { what are we getting the address from an absolute sym? }
  366. hp:=left;
  367. while assigned(hp) and (hp.nodetype in [typeconvn,vecn,derefn,subscriptn]) do
  368. hp:=tunarynode(hp).left;
  369. if not assigned(hp) then
  370. internalerror(200412042);
  371. {$ifdef i386}
  372. if (hp.nodetype=loadn) and
  373. ((tloadnode(hp).symtableentry.typ=absolutevarsym) and
  374. tabsolutevarsym(tloadnode(hp).symtableentry).absseg) then
  375. begin
  376. if not(nf_typedaddr in flags) then
  377. resultdef:=voidfarpointertype
  378. else
  379. resultdef:=tpointerdef.createfar(left.resultdef);
  380. end
  381. else
  382. {$endif i386}
  383. if (nf_internal in flags) or
  384. valid_for_addr(left,true) then
  385. begin
  386. if not(nf_typedaddr in flags) then
  387. resultdef:=voidpointertype
  388. else
  389. resultdef:=tpointerdef.create(left.resultdef);
  390. end
  391. else
  392. CGMessage(type_e_variable_id_expected);
  393. end;
  394. if mark_read_written then
  395. begin
  396. { This is actually only "read", but treat it nevertheless as }
  397. { modified due to the possible use of pointers }
  398. { To avoid false positives regarding "uninitialised" }
  399. { warnings when using arrays, perform it in two steps }
  400. set_varstate(left,vs_written,[]);
  401. { vsf_must_be_valid so it doesn't get changed into }
  402. { vsf_referred_not_inited }
  403. set_varstate(left,vs_read,[vsf_must_be_valid]);
  404. end;
  405. end;
  406. function taddrnode.pass_1 : tnode;
  407. begin
  408. result:=nil;
  409. firstpass(left);
  410. if codegenerror then
  411. exit;
  412. { is this right for object of methods ?? }
  413. expectloc:=LOC_REGISTER;
  414. end;
  415. {*****************************************************************************
  416. TDEREFNODE
  417. *****************************************************************************}
  418. constructor tderefnode.create(l : tnode);
  419. begin
  420. inherited create(derefn,l);
  421. end;
  422. function tderefnode.pass_typecheck:tnode;
  423. begin
  424. result:=nil;
  425. typecheckpass(left);
  426. set_varstate(left,vs_read,[vsf_must_be_valid]);
  427. if codegenerror then
  428. exit;
  429. { tp procvar support }
  430. maybe_call_procvar(left,true);
  431. if left.resultdef.typ=pointerdef then
  432. resultdef:=tpointerdef(left.resultdef).pointeddef
  433. else
  434. CGMessage(parser_e_invalid_qualifier);
  435. end;
  436. procedure Tderefnode.mark_write;
  437. begin
  438. include(flags,nf_write);
  439. end;
  440. function tderefnode.pass_1 : tnode;
  441. begin
  442. result:=nil;
  443. firstpass(left);
  444. if codegenerror then
  445. exit;
  446. expectloc:=LOC_REFERENCE;
  447. end;
  448. {*****************************************************************************
  449. TSUBSCRIPTNODE
  450. *****************************************************************************}
  451. constructor tsubscriptnode.create(varsym : tsym;l : tnode);
  452. begin
  453. inherited create(subscriptn,l);
  454. { vs should be changed to tsym! }
  455. vs:=tfieldvarsym(varsym);
  456. end;
  457. constructor tsubscriptnode.ppuload(t:tnodetype;ppufile:tcompilerppufile);
  458. begin
  459. inherited ppuload(t,ppufile);
  460. ppufile.getderef(vsderef);
  461. end;
  462. procedure tsubscriptnode.ppuwrite(ppufile:tcompilerppufile);
  463. begin
  464. inherited ppuwrite(ppufile);
  465. ppufile.putderef(vsderef);
  466. end;
  467. procedure tsubscriptnode.buildderefimpl;
  468. begin
  469. inherited buildderefimpl;
  470. vsderef.build(vs);
  471. end;
  472. procedure tsubscriptnode.derefimpl;
  473. begin
  474. inherited derefimpl;
  475. vs:=tfieldvarsym(vsderef.resolve);
  476. end;
  477. function tsubscriptnode.dogetcopy : tnode;
  478. var
  479. p : tsubscriptnode;
  480. begin
  481. p:=tsubscriptnode(inherited dogetcopy);
  482. p.vs:=vs;
  483. dogetcopy:=p;
  484. end;
  485. function tsubscriptnode.pass_typecheck:tnode;
  486. begin
  487. result:=nil;
  488. typecheckpass(left);
  489. { tp procvar support }
  490. maybe_call_procvar(left,true);
  491. resultdef:=vs.vardef;
  492. // don't put records from which we load fields which aren't regable in integer registers
  493. if (left.resultdef.typ = recorddef) and
  494. not(tstoreddef(resultdef).is_intregable) then
  495. make_not_regable(left,[ra_addr_regable]);
  496. end;
  497. procedure Tsubscriptnode.mark_write;
  498. begin
  499. include(flags,nf_write);
  500. end;
  501. function tsubscriptnode.pass_1 : tnode;
  502. begin
  503. result:=nil;
  504. firstpass(left);
  505. if codegenerror then
  506. exit;
  507. { classes must be dereferenced implicit }
  508. if is_class_or_interface(left.resultdef) then
  509. expectloc:=LOC_REFERENCE
  510. else
  511. begin
  512. case left.expectloc of
  513. LOC_REGISTER,
  514. LOC_SUBSETREG:
  515. // can happen for function results on win32 and darwin/x86
  516. if (left.resultdef.size > sizeof(pint)) then
  517. expectloc:=LOC_REFERENCE
  518. else
  519. expectloc:=LOC_SUBSETREG;
  520. LOC_CREGISTER,
  521. LOC_CSUBSETREG:
  522. expectloc:=LOC_CSUBSETREG;
  523. LOC_REFERENCE,
  524. LOC_CREFERENCE:
  525. expectloc:=left.expectloc;
  526. else internalerror(20060521);
  527. end;
  528. end;
  529. end;
  530. function tsubscriptnode.docompare(p: tnode): boolean;
  531. begin
  532. docompare :=
  533. inherited docompare(p) and
  534. (vs = tsubscriptnode(p).vs);
  535. end;
  536. {*****************************************************************************
  537. TVECNODE
  538. *****************************************************************************}
  539. constructor tvecnode.create(l,r : tnode);
  540. begin
  541. inherited create(vecn,l,r);
  542. end;
  543. function tvecnode.pass_typecheck:tnode;
  544. var
  545. hightree: tnode;
  546. htype,elementdef : tdef;
  547. valid : boolean;
  548. begin
  549. result:=nil;
  550. typecheckpass(left);
  551. typecheckpass(right);
  552. { implicitly convert stringconstant to stringdef,
  553. see tbs/tb0476.pp for a test }
  554. if (left.nodetype=stringconstn) and
  555. (tstringconstnode(left).cst_type=cst_conststring) then
  556. begin
  557. if tstringconstnode(left).len>255 then
  558. inserttypeconv(left,cansistringtype)
  559. else
  560. inserttypeconv(left,cshortstringtype);
  561. end;
  562. { In p[1] p is always valid, it is not possible to
  563. declared a shortstring or normal array that has
  564. undefined number of elements. Dynamic array and
  565. ansi/widestring needs to be valid }
  566. valid:=is_dynamic_array(left.resultdef) or
  567. is_ansistring(left.resultdef) or
  568. is_wide_or_unicode_string(left.resultdef) or
  569. { implicit pointer dereference -> pointer is read }
  570. (left.resultdef.typ = pointerdef);
  571. if valid then
  572. set_varstate(left,vs_read,[vsf_must_be_valid]);
  573. {
  574. A vecn is, just like a loadn, always part of an expression with its
  575. own read/write and must_be_valid semantics. Therefore we don't have
  576. to do anything else here, just like for loadn's
  577. }
  578. set_varstate(right,vs_read,[vsf_must_be_valid]);
  579. if codegenerror then
  580. exit;
  581. { maybe type conversion for the index value, but
  582. do not convert enums,booleans,char
  583. and do not convert range nodes }
  584. if (right.nodetype<>rangen) and (is_integer(right.resultdef) or (left.resultdef.typ<>arraydef)) then
  585. case left.resultdef.typ of
  586. arraydef:
  587. if ado_isvariant in Tarraydef(left.resultdef).arrayoptions then
  588. {Variant arrays are a special array, can have negative indexes and would therefore
  589. need s32bit. However, they should not appear in a vecn, as they are handled in
  590. handle_variantarray in pexpr.pas. Therefore, encountering a variant array is an
  591. internal error... }
  592. internalerror(200707031)
  593. else if is_special_array(left.resultdef) then
  594. {Arrays without a high bound (dynamic arrays, open arrays) are zero based,
  595. convert indexes into these arrays to aword.}
  596. inserttypeconv(right,uinttype)
  597. else
  598. {Convert array indexes to low_bound..high_bound.}
  599. inserttypeconv(right,Torddef.create(Torddef(sinttype).ordtype,
  600. int64(Tarraydef(left.resultdef).lowrange),
  601. int64(Tarraydef(left.resultdef).highrange)
  602. ));
  603. stringdef:
  604. if is_open_string(left.resultdef) then
  605. inserttypeconv(right,u8inttype)
  606. else if is_shortstring(left.resultdef) then
  607. {Convert shortstring indexes to 0..length.}
  608. inserttypeconv(right,Torddef.create(u8bit,0,int64(Tstringdef(left.resultdef).len)))
  609. else
  610. {Convert indexes into dynamically allocated strings to aword.}
  611. inserttypeconv(right,uinttype);
  612. else
  613. {Others, i.e. pointer indexes to aint.}
  614. inserttypeconv(right,sinttype);
  615. end;
  616. case left.resultdef.typ of
  617. arraydef :
  618. begin
  619. { check type of the index value }
  620. if (compare_defs(right.resultdef,tarraydef(left.resultdef).rangedef,right.nodetype)=te_incompatible) then
  621. IncompatibleTypes(right.resultdef,tarraydef(left.resultdef).rangedef);
  622. if right.nodetype=rangen then
  623. resultdef:=left.resultdef
  624. else
  625. resultdef:=Tarraydef(left.resultdef).elementdef;
  626. { if we are range checking an open array or array of const, we }
  627. { need to load the high parameter. If the current procedure is }
  628. { nested inside the procedure to which the open array/of const }
  629. { was passed, then the high parameter must not be a regvar. }
  630. { So create a loadnode for the high parameter here and }
  631. { typecheck it, then the loadnode will make the high parameter }
  632. { not regable. Otherwise this would only happen inside pass_2, }
  633. { which is too late since by then the regvars are already }
  634. { assigned (pass_1 is also already too late, because then the }
  635. { regvars of the parent are also already assigned). }
  636. { webtbs/tw8975 }
  637. if (cs_check_range in current_settings.localswitches) and
  638. (is_open_array(left.resultdef) or
  639. is_array_of_const(left.resultdef)) and
  640. { cdecl functions don't have high() so we can not check the range }
  641. { (can't use current_procdef, since it may be a nested procedure) }
  642. not(tprocdef(tparasymtable(tparavarsym(tloadnode(left).symtableentry).owner).defowner).proccalloption in [pocall_cdecl,pocall_cppdecl]) then
  643. begin
  644. { load_high_value_node already typechecks }
  645. hightree:=load_high_value_node(tparavarsym(tloadnode(left).symtableentry));
  646. hightree.free;
  647. end;
  648. end;
  649. pointerdef :
  650. begin
  651. { are we accessing a pointer[], then convert the pointer to
  652. an array first, in FPC this is allowed for all pointers
  653. (except voidpointer) in delphi/tp7 it's only allowed for pchars. }
  654. if not is_voidpointer(left.resultdef) and
  655. (
  656. (m_fpc in current_settings.modeswitches) or
  657. is_pchar(left.resultdef) or
  658. is_pwidechar(left.resultdef)
  659. ) then
  660. begin
  661. { convert pointer to array }
  662. htype:=tarraydef.create_from_pointer(tpointerdef(left.resultdef).pointeddef);
  663. inserttypeconv(left,htype);
  664. if right.nodetype=rangen then
  665. resultdef:=htype
  666. else
  667. resultdef:=tarraydef(htype).elementdef;
  668. end
  669. else
  670. CGMessage(type_e_array_required);
  671. end;
  672. stringdef :
  673. begin
  674. case tstringdef(left.resultdef).stringtype of
  675. st_unicodestring,
  676. st_widestring :
  677. elementdef:=cwidechartype;
  678. st_ansistring :
  679. elementdef:=cchartype;
  680. st_longstring :
  681. elementdef:=cchartype;
  682. st_shortstring :
  683. elementdef:=cchartype;
  684. end;
  685. if right.nodetype=rangen then
  686. begin
  687. htype:=Tarraydef.create_from_pointer(elementdef);
  688. resultdef:=htype;
  689. end
  690. else
  691. begin
  692. { indexed access to 0 element is only allowed for shortstrings }
  693. if (right.nodetype=ordconstn) and
  694. (Tordconstnode(right).value.svalue=0) and
  695. not is_shortstring(left.resultdef) then
  696. CGMessage(cg_e_can_access_element_zero);
  697. resultdef:=elementdef;
  698. end;
  699. end;
  700. variantdef :
  701. resultdef:=cvarianttype;
  702. else
  703. CGMessage(type_e_array_required);
  704. end;
  705. end;
  706. procedure Tvecnode.mark_write;
  707. begin
  708. include(flags,nf_write);
  709. end;
  710. function tvecnode.pass_1 : tnode;
  711. begin
  712. result:=nil;
  713. firstpass(left);
  714. firstpass(right);
  715. if codegenerror then
  716. exit;
  717. if (nf_callunique in flags) and
  718. (is_ansistring(left.resultdef) or
  719. is_unicodestring(left.resultdef) or
  720. (is_widestring(left.resultdef) and not(tf_winlikewidestring in target_info.flags))) then
  721. begin
  722. left := ctypeconvnode.create_internal(ccallnode.createintern('fpc_'+tstringdef(left.resultdef).stringtypname+'_unique',
  723. ccallparanode.create(
  724. ctypeconvnode.create_internal(left,voidpointertype),nil)),
  725. left.resultdef);
  726. firstpass(left);
  727. { double resultdef passes somwhere else may cause this to be }
  728. { reset though :/ }
  729. exclude(flags,nf_callunique);
  730. end
  731. else if is_widestring(left.resultdef) and (tf_winlikewidestring in target_info.flags) then
  732. exclude(flags,nf_callunique);
  733. if (not is_packed_array(left.resultdef)) or
  734. ((tarraydef(left.resultdef).elepackedbitsize mod 8) = 0) then
  735. if left.expectloc=LOC_CREFERENCE then
  736. expectloc:=LOC_CREFERENCE
  737. else
  738. expectloc:=LOC_REFERENCE
  739. else
  740. if left.expectloc=LOC_CREFERENCE then
  741. expectloc:=LOC_CSUBSETREF
  742. else
  743. expectloc:=LOC_SUBSETREF;
  744. end;
  745. {*****************************************************************************
  746. TWITHNODE
  747. *****************************************************************************}
  748. constructor twithnode.create(l:tnode);
  749. begin
  750. inherited create(withn,l);
  751. fileinfo:=l.fileinfo;
  752. end;
  753. destructor twithnode.destroy;
  754. begin
  755. inherited destroy;
  756. end;
  757. constructor twithnode.ppuload(t:tnodetype;ppufile:tcompilerppufile);
  758. begin
  759. inherited ppuload(t,ppufile);
  760. end;
  761. procedure twithnode.ppuwrite(ppufile:tcompilerppufile);
  762. begin
  763. inherited ppuwrite(ppufile);
  764. end;
  765. function twithnode.dogetcopy : tnode;
  766. var
  767. p : twithnode;
  768. begin
  769. p:=twithnode(inherited dogetcopy);
  770. result:=p;
  771. end;
  772. function twithnode.pass_typecheck:tnode;
  773. begin
  774. result:=nil;
  775. resultdef:=voidtype;
  776. if assigned(left) then
  777. typecheckpass(left);
  778. end;
  779. function twithnode.pass_1 : tnode;
  780. begin
  781. result:=nil;
  782. expectloc:=LOC_VOID;
  783. end;
  784. function twithnode.docompare(p: tnode): boolean;
  785. begin
  786. docompare :=
  787. inherited docompare(p);
  788. end;
  789. function is_big_untyped_addrnode(p: tnode): boolean;
  790. begin
  791. is_big_untyped_addrnode:=(p.nodetype=addrn) and
  792. not (nf_typedaddr in p.flags) and (taddrnode(p).left.resultdef.size > 1);
  793. end;
  794. begin
  795. cloadvmtaddrnode := tloadvmtaddrnode;
  796. caddrnode := taddrnode;
  797. cderefnode := tderefnode;
  798. csubscriptnode := tsubscriptnode;
  799. cvecnode := tvecnode;
  800. cwithnode := twithnode;
  801. end.