nmem.pas 33 KB

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