nmem.pas 32 KB

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