nmem.pas 51 KB

1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768697071727374757677787980818283848586878889909192939495969798991001011021031041051061071081091101111121131141151161171181191201211221231241251261271281291301311321331341351361371381391401411421431441451461471481491501511521531541551561571581591601611621631641651661671681691701711721731741751761771781791801811821831841851861871881891901911921931941951961971981992002012022032042052062072082092102112122132142152162172182192202212222232242252262272282292302312322332342352362372382392402412422432442452462472482492502512522532542552562572582592602612622632642652662672682692702712722732742752762772782792802812822832842852862872882892902912922932942952962972982993003013023033043053063073083093103113123133143153163173183193203213223233243253263273283293303313323333343353363373383393403413423433443453463473483493503513523533543553563573583593603613623633643653663673683693703713723733743753763773783793803813823833843853863873883893903913923933943953963973983994004014024034044054064074084094104114124134144154164174184194204214224234244254264274284294304314324334344354364374384394404414424434444454464474484494504514524534544554564574584594604614624634644654664674684694704714724734744754764774784794804814824834844854864874884894904914924934944954964974984995005015025035045055065075085095105115125135145155165175185195205215225235245255265275285295305315325335345355365375385395405415425435445455465475485495505515525535545555565575585595605615625635645655665675685695705715725735745755765775785795805815825835845855865875885895905915925935945955965975985996006016026036046056066076086096106116126136146156166176186196206216226236246256266276286296306316326336346356366376386396406416426436446456466476486496506516526536546556566576586596606616626636646656666676686696706716726736746756766776786796806816826836846856866876886896906916926936946956966976986997007017027037047057067077087097107117127137147157167177187197207217227237247257267277287297307317327337347357367377387397407417427437447457467477487497507517527537547557567577587597607617627637647657667677687697707717727737747757767777787797807817827837847857867877887897907917927937947957967977987998008018028038048058068078088098108118128138148158168178188198208218228238248258268278288298308318328338348358368378388398408418428438448458468478488498508518528538548558568578588598608618628638648658668678688698708718728738748758768778788798808818828838848858868878888898908918928938948958968978988999009019029039049059069079089099109119129139149159169179189199209219229239249259269279289299309319329339349359369379389399409419429439449459469479489499509519529539549559569579589599609619629639649659669679689699709719729739749759769779789799809819829839849859869879889899909919929939949959969979989991000100110021003100410051006100710081009101010111012101310141015101610171018101910201021102210231024102510261027102810291030103110321033103410351036103710381039104010411042104310441045104610471048104910501051105210531054105510561057105810591060106110621063106410651066106710681069107010711072107310741075107610771078107910801081108210831084108510861087108810891090109110921093109410951096109710981099110011011102110311041105110611071108110911101111111211131114111511161117111811191120112111221123112411251126112711281129113011311132113311341135113611371138113911401141114211431144114511461147114811491150115111521153115411551156115711581159116011611162116311641165116611671168116911701171117211731174117511761177117811791180118111821183118411851186118711881189119011911192119311941195119611971198119912001201120212031204120512061207120812091210121112121213121412151216121712181219122012211222122312241225122612271228122912301231123212331234123512361237123812391240124112421243124412451246124712481249125012511252125312541255125612571258125912601261126212631264126512661267126812691270127112721273127412751276127712781279128012811282128312841285128612871288128912901291129212931294129512961297129812991300130113021303130413051306130713081309131013111312131313141315131613171318131913201321132213231324132513261327132813291330133113321333133413351336133713381339134013411342134313441345134613471348134913501351135213531354135513561357135813591360136113621363136413651366136713681369137013711372137313741375137613771378137913801381
  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. { unless this is for a call, we have to send the "class" message to
  26. the objctype because the type information only gets initialized
  27. after the first message has been sent -> crash if you pass an
  28. uninitialized type to e.g. class_getInstanceSize() or so. No need
  29. to save to/restore from ppu. }
  30. forcall: boolean;
  31. constructor create(l : tnode);virtual;
  32. function pass_1 : tnode;override;
  33. function pass_typecheck:tnode;override;
  34. function docompare(p: tnode): boolean; override;
  35. function dogetcopy: tnode; override;
  36. end;
  37. tloadvmtaddrnodeclass = class of tloadvmtaddrnode;
  38. tloadparentfpkind = (
  39. { as parameter to a nested routine (current routine's frame) }
  40. lpf_forpara,
  41. { to load a local from a parent routine in the current nested routine
  42. (some parent routine's frame) }
  43. lpf_forload
  44. );
  45. tloadparentfpnode = class(tunarynode)
  46. parentpd : tprocdef;
  47. parentpdderef : tderef;
  48. kind: tloadparentfpkind;
  49. constructor create(pd: tprocdef; fpkind: tloadparentfpkind);virtual;
  50. constructor ppuload(t:tnodetype;ppufile:tcompilerppufile);override;
  51. procedure ppuwrite(ppufile:tcompilerppufile);override;
  52. procedure buildderefimpl;override;
  53. procedure derefimpl;override;
  54. function pass_1 : tnode;override;
  55. function pass_typecheck:tnode;override;
  56. function docompare(p: tnode): boolean; override;
  57. function dogetcopy : tnode;override;
  58. end;
  59. tloadparentfpnodeclass = class of tloadparentfpnode;
  60. taddrnodeflag = (
  61. { generated by the Ofs() internal function }
  62. anf_ofs,
  63. anf_typedaddr
  64. );
  65. taddrnodeflags = set of taddrnodeflag;
  66. taddrnode = class(tunarynode)
  67. getprocvardef : tprocvardef;
  68. getprocvardefderef : tderef;
  69. addrnodeflags : taddrnodeflags;
  70. constructor create(l : tnode);virtual;
  71. constructor create_internal(l : tnode); virtual;
  72. constructor create_internal_nomark(l : tnode); virtual;
  73. constructor ppuload(t:tnodetype;ppufile:tcompilerppufile);override;
  74. procedure ppuwrite(ppufile:tcompilerppufile);override;
  75. procedure mark_write;override;
  76. procedure buildderefimpl;override;
  77. procedure derefimpl;override;
  78. procedure printnodeinfo(var t: text); override;
  79. {$ifdef DEBUG_NODE_XML}
  80. procedure XMLPrintNodeInfo(var T: Text); override;
  81. {$endif DEBUG_NODE_XML}
  82. function docompare(p: tnode): boolean; override;
  83. function dogetcopy : tnode;override;
  84. function pass_1 : tnode;override;
  85. function pass_typecheck:tnode;override;
  86. function simplify(forinline : boolean) : tnode; override;
  87. protected
  88. mark_read_written: boolean;
  89. procedure set_labelsym_resultdef; virtual;
  90. function typecheck_non_proc(realsource: tnode; out res: tnode): boolean; virtual;
  91. end;
  92. taddrnodeclass = class of taddrnode;
  93. tderefnode = class(tunarynode)
  94. constructor create(l : tnode);virtual;
  95. function pass_1 : tnode;override;
  96. function pass_typecheck:tnode;override;
  97. procedure mark_write;override;
  98. end;
  99. tderefnodeclass = class of tderefnode;
  100. tsubscriptnode = class(tunarynode)
  101. vs : tfieldvarsym;
  102. vsderef : tderef;
  103. constructor create(varsym : tsym;l : tnode);virtual;
  104. constructor ppuload(t:tnodetype;ppufile:tcompilerppufile);override;
  105. procedure ppuwrite(ppufile:tcompilerppufile);override;
  106. procedure buildderefimpl;override;
  107. procedure derefimpl;override;
  108. function dogetcopy : tnode;override;
  109. function pass_1 : tnode;override;
  110. function docompare(p: tnode): boolean; override;
  111. function pass_typecheck:tnode;override;
  112. procedure mark_write;override;
  113. {$ifdef DEBUG_NODE_XML}
  114. procedure XMLPrintNodeData(var T: Text); override;
  115. {$endif DEBUG_NODE_XML}
  116. end;
  117. tsubscriptnodeclass = class of tsubscriptnode;
  118. tvecnode = class(tbinarynode)
  119. protected
  120. function first_arraydef: tnode; virtual;
  121. function gen_array_rangecheck: tnode; virtual;
  122. public
  123. constructor create(l,r : tnode);virtual;
  124. function pass_1 : tnode;override;
  125. function pass_typecheck:tnode;override;
  126. procedure mark_write;override;
  127. {$ifdef DEBUG_NODE_XML}
  128. procedure XMLPrintNodeData(var T: Text); override;
  129. {$endif DEBUG_NODE_XML}
  130. end;
  131. tvecnodeclass = class of tvecnode;
  132. var
  133. cloadvmtaddrnode : tloadvmtaddrnodeclass= tloadvmtaddrnode;
  134. caddrnode : taddrnodeclass= taddrnode;
  135. cderefnode : tderefnodeclass= tderefnode;
  136. csubscriptnode : tsubscriptnodeclass= tsubscriptnode;
  137. cvecnode : tvecnodeclass= tvecnode;
  138. cloadparentfpnode : tloadparentfpnodeclass = tloadparentfpnode;
  139. function is_big_untyped_addrnode(p: tnode): boolean;
  140. implementation
  141. uses
  142. globtype,systems,constexp,
  143. cutils,verbose,globals,ppu,
  144. symconst,defutil,defcmp,
  145. nadd,nbas,nflw,nutils,objcutil,
  146. wpobase,
  147. {$ifdef i8086}
  148. cpuinfo,
  149. {$endif i8086}
  150. htypechk,pass_1,ncal,nld,ncon,ncnv,cgbase,procinfo
  151. ;
  152. {*****************************************************************************
  153. TLOADVMTADDRNODE
  154. *****************************************************************************}
  155. constructor tloadvmtaddrnode.create(l : tnode);
  156. begin
  157. inherited create(loadvmtaddrn,l);
  158. end;
  159. function tloadvmtaddrnode.pass_typecheck:tnode;
  160. var
  161. defaultresultdef : boolean;
  162. begin
  163. result:=nil;
  164. typecheckpass(left);
  165. if codegenerror then
  166. exit;
  167. case left.resultdef.typ of
  168. classrefdef :
  169. resultdef:=left.resultdef;
  170. recorddef,
  171. objectdef:
  172. begin
  173. if (left.resultdef.typ=objectdef) or
  174. ((target_info.system in systems_jvm) and
  175. (left.resultdef.typ=recorddef)) then
  176. begin
  177. { access to the classtype while specializing? }
  178. if tstoreddef(left.resultdef).is_generic then
  179. begin
  180. defaultresultdef:=true;
  181. if assigned(current_structdef) then
  182. begin
  183. if assigned(current_structdef.genericdef) then
  184. if current_structdef.genericdef=left.resultdef then
  185. begin
  186. resultdef:=cclassrefdef.create(current_structdef);
  187. defaultresultdef:=false;
  188. end
  189. else
  190. CGMessage(parser_e_cant_create_generics_of_this_type);
  191. end
  192. else
  193. message(parser_e_cant_create_generics_of_this_type);
  194. if defaultresultdef then
  195. resultdef:=cclassrefdef.create(left.resultdef);
  196. end
  197. else
  198. resultdef:=cclassrefdef.create(left.resultdef);
  199. end
  200. else
  201. CGMessage(parser_e_pointer_to_class_expected);
  202. end
  203. else
  204. CGMessage(parser_e_pointer_to_class_expected);
  205. end;
  206. end;
  207. function tloadvmtaddrnode.docompare(p: tnode): boolean;
  208. begin
  209. result:=inherited docompare(p);
  210. if result then
  211. result:=forcall=tloadvmtaddrnode(p).forcall;
  212. end;
  213. function tloadvmtaddrnode.dogetcopy: tnode;
  214. begin
  215. result:=inherited dogetcopy;
  216. tloadvmtaddrnode(result).forcall:=forcall;
  217. end;
  218. function tloadvmtaddrnode.pass_1 : tnode;
  219. var
  220. vs: tsym;
  221. begin
  222. result:=nil;
  223. expectloc:=LOC_REGISTER;
  224. if left.nodetype<>typen then
  225. begin
  226. if (is_objc_class_or_protocol(left.resultdef) or
  227. is_objcclassref(left.resultdef)) then
  228. begin
  229. { on non-fragile ABI platforms, the ISA pointer may be opaque
  230. and we must call Object_getClass to obtain the real ISA
  231. pointer }
  232. if target_info.system in systems_objc_nfabi then
  233. begin
  234. result:=ccallnode.createinternfromunit('OBJC','OBJECT_GETCLASS',ccallparanode.create(left,nil));
  235. inserttypeconv_explicit(result,resultdef);
  236. end
  237. else
  238. result:=objcloadbasefield(left,'ISA');
  239. end
  240. else
  241. result:=ctypeconvnode.create_internal(load_vmt_for_self_node(left),resultdef);
  242. { reused }
  243. left:=nil;
  244. end
  245. else if not is_objcclass(left.resultdef) and
  246. not is_objcclassref(left.resultdef) then
  247. begin
  248. if not(nf_ignore_for_wpo in flags) and
  249. (not assigned(current_procinfo) or
  250. (po_inline in current_procinfo.procdef.procoptions) or
  251. wpoinfomanager.symbol_live(current_procinfo.procdef.mangledname)) then
  252. begin
  253. { keep track of which classes might be instantiated via a classrefdef }
  254. if (left.resultdef.typ=classrefdef) then
  255. tobjectdef(tclassrefdef(left.resultdef).pointeddef).register_maybe_created_object_type
  256. else if (left.resultdef.typ=objectdef) then
  257. tobjectdef(left.resultdef).register_maybe_created_object_type
  258. end
  259. end
  260. else if is_objcclass(left.resultdef) and
  261. not(forcall) then
  262. begin
  263. { call "class" method (= "classclass" in FPC), because otherwise
  264. we may use the class information before it has been
  265. initialized }
  266. vs:=search_struct_member(tobjectdef(left.resultdef),'CLASSCLASS');
  267. if not assigned(vs) or
  268. (vs.typ<>procsym) then
  269. internalerror(2011080601);
  270. { can't reuse "self", because it will be freed when we return }
  271. result:=ccallnode.create(nil,tprocsym(vs),vs.owner,self.getcopy,[],nil);
  272. end;
  273. end;
  274. {*****************************************************************************
  275. TLOADPARENTFPNODE
  276. *****************************************************************************}
  277. constructor tloadparentfpnode.create(pd: tprocdef; fpkind: tloadparentfpkind);
  278. begin
  279. inherited create(loadparentfpn,nil);
  280. if not assigned(pd) then
  281. internalerror(200309288);
  282. if (pd.parast.symtablelevel>current_procinfo.procdef.parast.symtablelevel) then
  283. internalerror(200309284);
  284. parentpd:=pd;
  285. kind:=fpkind;
  286. end;
  287. constructor tloadparentfpnode.ppuload(t:tnodetype;ppufile:tcompilerppufile);
  288. begin
  289. inherited ppuload(t,ppufile);
  290. ppufile.getderef(parentpdderef);
  291. kind:=tloadparentfpkind(ppufile.getbyte);
  292. end;
  293. procedure tloadparentfpnode.ppuwrite(ppufile:tcompilerppufile);
  294. begin
  295. inherited ppuwrite(ppufile);
  296. ppufile.putderef(parentpdderef);
  297. ppufile.putbyte(byte(kind));
  298. end;
  299. procedure tloadparentfpnode.buildderefimpl;
  300. begin
  301. inherited buildderefimpl;
  302. parentpdderef.build(parentpd);
  303. end;
  304. procedure tloadparentfpnode.derefimpl;
  305. begin
  306. inherited derefimpl;
  307. parentpd:=tprocdef(parentpdderef.resolve);
  308. end;
  309. function tloadparentfpnode.docompare(p: tnode): boolean;
  310. begin
  311. result:=
  312. inherited docompare(p) and
  313. (tloadparentfpnode(p).parentpd=parentpd) and
  314. (tloadparentfpnode(p).kind=kind);
  315. end;
  316. function tloadparentfpnode.dogetcopy : tnode;
  317. var
  318. p : tloadparentfpnode;
  319. begin
  320. p:=tloadparentfpnode(inherited dogetcopy);
  321. p.parentpd:=parentpd;
  322. p.kind:=kind;
  323. dogetcopy:=p;
  324. end;
  325. function tloadparentfpnode.pass_typecheck:tnode;
  326. begin
  327. result:=nil;
  328. resultdef:=parentfpvoidpointertype;
  329. end;
  330. function tloadparentfpnode.pass_1 : tnode;
  331. begin
  332. result:=nil;
  333. expectloc:=LOC_REGISTER;
  334. end;
  335. {*****************************************************************************
  336. TADDRNODE
  337. *****************************************************************************}
  338. constructor taddrnode.create(l : tnode);
  339. begin
  340. inherited create(addrn,l);
  341. getprocvardef:=nil;
  342. addrnodeflags:=[];
  343. mark_read_written := true;
  344. end;
  345. constructor taddrnode.create_internal(l : tnode);
  346. begin
  347. self.create(l);
  348. include(flags,nf_internal);
  349. end;
  350. constructor taddrnode.create_internal_nomark(l : tnode);
  351. begin
  352. self.create_internal(l);
  353. mark_read_written := false;
  354. end;
  355. constructor taddrnode.ppuload(t:tnodetype;ppufile:tcompilerppufile);
  356. begin
  357. inherited ppuload(t,ppufile);
  358. ppufile.getderef(getprocvardefderef);
  359. ppufile.getset(tppuset1(addrnodeflags));
  360. end;
  361. procedure taddrnode.ppuwrite(ppufile:tcompilerppufile);
  362. begin
  363. inherited ppuwrite(ppufile);
  364. ppufile.putderef(getprocvardefderef);
  365. ppufile.putset(tppuset1(addrnodeflags));
  366. end;
  367. procedure Taddrnode.mark_write;
  368. begin
  369. {@procvar:=nil is legal in Delphi mode.}
  370. left.mark_write;
  371. end;
  372. procedure taddrnode.buildderefimpl;
  373. begin
  374. inherited buildderefimpl;
  375. getprocvardefderef.build(getprocvardef);
  376. end;
  377. procedure taddrnode.derefimpl;
  378. begin
  379. inherited derefimpl;
  380. getprocvardef:=tprocvardef(getprocvardefderef.resolve);
  381. end;
  382. procedure taddrnode.printnodeinfo(var t: text);
  383. var
  384. first: Boolean;
  385. i: taddrnodeflag;
  386. begin
  387. inherited printnodeinfo(t);
  388. write(t,', addrnodeflags = [');
  389. first:=true;
  390. for i:=low(taddrnodeflag) to high(taddrnodeflag) do
  391. if i in addrnodeflags then
  392. begin
  393. if not first then
  394. write(t,',')
  395. else
  396. first:=false;
  397. write(t,i);
  398. end;
  399. write(t,']');
  400. end;
  401. {$ifdef DEBUG_NODE_XML}
  402. procedure TAddrNode.XMLPrintNodeInfo(var T: Text);
  403. var
  404. First: Boolean;
  405. i: TAddrNodeFlag;
  406. begin
  407. inherited XMLPrintNodeInfo(t);
  408. First := True;
  409. for i := Low(TAddrNodeFlag) to High(TAddrNodeFlag) do
  410. if i in addrnodeflags then
  411. begin
  412. if First then
  413. begin
  414. Write(T, ' addrnodeflags="', i);
  415. First := False;
  416. end
  417. else
  418. Write(T, ',', i);
  419. end;
  420. if not First then
  421. Write(T, '"');
  422. end;
  423. {$endif DEBUG_NODE_XML}
  424. function taddrnode.docompare(p: tnode): boolean;
  425. begin
  426. result:=
  427. inherited docompare(p) and
  428. (taddrnode(p).getprocvardef=getprocvardef) and
  429. (taddrnode(p).addrnodeflags=addrnodeflags);
  430. end;
  431. function taddrnode.dogetcopy : tnode;
  432. var
  433. p : taddrnode;
  434. begin
  435. p:=taddrnode(inherited dogetcopy);
  436. p.getprocvardef:=getprocvardef;
  437. p.addrnodeflags:=addrnodeflags;
  438. dogetcopy:=p;
  439. end;
  440. function taddrnode.pass_typecheck:tnode;
  441. procedure check_mark_read_written;
  442. begin
  443. if mark_read_written then
  444. begin
  445. { This is actually only "read", but treat it nevertheless as
  446. modified due to the possible use of pointers
  447. To avoid false positives regarding "uninitialised"
  448. warnings when using arrays, perform it in two steps }
  449. set_varstate(left,vs_written,[]);
  450. { vsf_must_be_valid so it doesn't get changed into
  451. vsf_referred_not_inited }
  452. set_varstate(left,vs_read,[vsf_must_be_valid]);
  453. end;
  454. end;
  455. var
  456. hp : tnode;
  457. hsym : tfieldvarsym;
  458. isprocvar,need_conv_to_voidptr: boolean;
  459. procpointertype: tdef;
  460. begin
  461. result:=nil;
  462. typecheckpass(left);
  463. if codegenerror then
  464. exit;
  465. make_not_regable(left,[ra_addr_regable,ra_addr_taken]);
  466. { don't allow constants, for internal use we also
  467. allow taking the address of strings and sets }
  468. if is_constnode(left) and
  469. not(
  470. (nf_internal in flags) and
  471. (left.nodetype in [stringconstn,setconstn])
  472. ) then
  473. begin
  474. CGMessagePos(left.fileinfo,type_e_no_addr_of_constant);
  475. exit;
  476. end;
  477. { Handle @proc special, also @procvar in tp-mode needs
  478. special handling }
  479. if (left.resultdef.typ=procdef) or
  480. (
  481. { in case of nf_internal, follow the normal FPC semantics so that
  482. we can easily get the actual address of a procvar }
  483. not(nf_internal in flags) and
  484. (left.resultdef.typ=procvardef) and
  485. ((m_tp_procvar in current_settings.modeswitches) or
  486. (m_mac_procvar in current_settings.modeswitches))
  487. ) then
  488. begin
  489. isprocvar:=(left.resultdef.typ=procvardef);
  490. need_conv_to_voidptr:=
  491. (m_tp_procvar in current_settings.modeswitches) or
  492. (m_mac_procvar in current_settings.modeswitches);
  493. if not isprocvar then
  494. begin
  495. left:=ctypeconvnode.create_proc_to_procvar(left);
  496. if need_conv_to_voidptr then
  497. include(ttypeconvnode(left).convnodeflags,tcnf_proc_2_procvar_2_voidpointer);
  498. if anf_ofs in addrnodeflags then
  499. include(ttypeconvnode(left).convnodeflags,tcnf_proc_2_procvar_get_offset_only);
  500. left.fileinfo:=fileinfo;
  501. typecheckpass(left);
  502. end;
  503. { In tp procvar mode the result is always a voidpointer. Insert
  504. a typeconversion to voidpointer. For methodpointers we need
  505. to load the proc field }
  506. if need_conv_to_voidptr then
  507. begin
  508. if tabstractprocdef(left.resultdef).is_addressonly then
  509. begin
  510. if anf_ofs in addrnodeflags then
  511. result:=ctypeconvnode.create_internal(left,tabstractprocdef(left.resultdef).ofs_address_type)
  512. else
  513. result:=ctypeconvnode.create_internal(left,voidcodepointertype);
  514. include(result.flags,nf_load_procvar);
  515. left:=nil;
  516. end
  517. else
  518. begin
  519. { For procvars and for nested routines we need to return
  520. the proc field of the methodpointer }
  521. if isprocvar or
  522. is_nested_pd(tabstractprocdef(left.resultdef)) then
  523. begin
  524. if tabstractprocdef(left.resultdef).is_methodpointer then
  525. procpointertype:=methodpointertype
  526. else
  527. procpointertype:=nestedprocpointertype;
  528. { find proc field in methodpointer record }
  529. hsym:=tfieldvarsym(trecorddef(procpointertype).symtable.Find('proc'));
  530. if not assigned(hsym) then
  531. internalerror(200412041);
  532. { Load tmehodpointer(left).proc }
  533. result:=csubscriptnode.create(
  534. hsym,
  535. ctypeconvnode.create_internal(left,procpointertype));
  536. left:=nil;
  537. end
  538. else
  539. CGMessage(type_e_variable_id_expected);
  540. end;
  541. end
  542. else
  543. begin
  544. check_mark_read_written;
  545. { Return the typeconvn only }
  546. result:=left;
  547. left:=nil;
  548. exit;
  549. end;
  550. end
  551. else
  552. begin
  553. hp:=left;
  554. while assigned(hp) and (hp.nodetype in [typeconvn,derefn,subscriptn]) do
  555. hp:=tunarynode(hp).left;
  556. if not assigned(hp) then
  557. internalerror(200412042);
  558. if typecheck_non_proc(hp,result) then
  559. begin
  560. if assigned(result) then
  561. exit;
  562. end
  563. else
  564. CGMessage(type_e_variable_id_expected);
  565. end;
  566. check_mark_read_written;
  567. if not(assigned(result)) then
  568. result:=simplify(false);
  569. end;
  570. function taddrnode.simplify(forinline : boolean) : tnode;
  571. var
  572. hsym : tfieldvarsym;
  573. begin
  574. result:=nil;
  575. if ((left.nodetype=subscriptn) and
  576. (tsubscriptnode(left).left.nodetype=derefn) and
  577. (tsubscriptnode(left).left.resultdef.typ=recorddef) and
  578. (tderefnode(tsubscriptnode(left).left).left.nodetype=niln)) or
  579. ((left.nodetype=subscriptn) and
  580. (tsubscriptnode(left).left.nodetype=typeconvn) and
  581. (tsubscriptnode(left).left.resultdef.typ=recorddef) and
  582. (ttypeconvnode(tsubscriptnode(left).left).left.nodetype=derefn) and
  583. (tderefnode(ttypeconvnode(tsubscriptnode(left).left).left).left.nodetype=niln)) then
  584. begin
  585. hsym:=tsubscriptnode(left).vs;
  586. if tabstractrecordsymtable(hsym.owner).is_packed then
  587. result:=cpointerconstnode.create(hsym.fieldoffset div 8,resultdef)
  588. else
  589. result:=cpointerconstnode.create(hsym.fieldoffset,resultdef);
  590. end;
  591. end;
  592. procedure taddrnode.set_labelsym_resultdef;
  593. begin
  594. resultdef:=voidcodepointertype;
  595. end;
  596. function taddrnode.typecheck_non_proc(realsource: tnode; out res: tnode): boolean;
  597. var
  598. hp : tnode;
  599. hsym : tfieldvarsym;
  600. offset: asizeint;
  601. begin
  602. result:=false;
  603. res:=nil;
  604. if (realsource.nodetype=loadn) and
  605. (tloadnode(realsource).symtableentry.typ=labelsym) then
  606. begin
  607. set_labelsym_resultdef;
  608. result:=true;
  609. end
  610. else if (realsource.nodetype=loadn) and
  611. (tloadnode(realsource).symtableentry.typ=absolutevarsym) and
  612. (tabsolutevarsym(tloadnode(realsource).symtableentry).abstyp=toaddr) then
  613. begin
  614. offset:=tabsolutevarsym(tloadnode(realsource).symtableentry).addroffset;
  615. hp:=left;
  616. while assigned(hp)and(hp.nodetype=subscriptn) do
  617. begin
  618. hsym:=tsubscriptnode(hp).vs;
  619. if tabstractrecordsymtable(hsym.owner).is_packed then
  620. begin
  621. { can't calculate the address of a non-byte aligned field }
  622. if (hsym.fieldoffset mod 8)<>0 then
  623. begin
  624. CGMessagePos(hp.fileinfo,parser_e_packed_element_no_var_addr);
  625. exit
  626. end;
  627. inc(offset,hsym.fieldoffset div 8)
  628. end
  629. else
  630. inc(offset,hsym.fieldoffset);
  631. hp:=tunarynode(hp).left;
  632. end;
  633. if anf_typedaddr in addrnodeflags then
  634. res:=cpointerconstnode.create(offset,cpointerdef.getreusable(left.resultdef))
  635. else
  636. res:=cpointerconstnode.create(offset,voidpointertype);
  637. result:=true;
  638. end
  639. else if (nf_internal in flags) or
  640. valid_for_addr(left,true) then
  641. begin
  642. if not(anf_typedaddr in addrnodeflags) then
  643. resultdef:=voidpointertype
  644. else
  645. resultdef:=cpointerdef.getreusable(left.resultdef);
  646. result:=true;
  647. end
  648. end;
  649. function taddrnode.pass_1 : tnode;
  650. begin
  651. result:=nil;
  652. firstpass(left);
  653. if codegenerror then
  654. exit;
  655. { is this right for object of methods ?? }
  656. expectloc:=LOC_REGISTER;
  657. end;
  658. {*****************************************************************************
  659. TDEREFNODE
  660. *****************************************************************************}
  661. constructor tderefnode.create(l : tnode);
  662. begin
  663. inherited create(derefn,l);
  664. end;
  665. function tderefnode.pass_typecheck:tnode;
  666. begin
  667. result:=nil;
  668. typecheckpass(left);
  669. set_varstate(left,vs_read,[vsf_must_be_valid]);
  670. if codegenerror then
  671. exit;
  672. { tp procvar support }
  673. maybe_call_procvar(left,true);
  674. if left.resultdef.typ=pointerdef then
  675. resultdef:=tpointerdef(left.resultdef).pointeddef
  676. else if left.resultdef.typ=undefineddef then
  677. resultdef:=cundefineddef.create(true)
  678. else
  679. CGMessage(parser_e_invalid_qualifier);
  680. end;
  681. procedure Tderefnode.mark_write;
  682. begin
  683. include(flags,nf_write);
  684. end;
  685. function tderefnode.pass_1 : tnode;
  686. begin
  687. result:=nil;
  688. firstpass(left);
  689. if codegenerror then
  690. exit;
  691. expectloc:=LOC_REFERENCE;
  692. end;
  693. {*****************************************************************************
  694. TSUBSCRIPTNODE
  695. *****************************************************************************}
  696. constructor tsubscriptnode.create(varsym : tsym;l : tnode);
  697. begin
  698. inherited create(subscriptn,l);
  699. { vs should be changed to tsym! }
  700. vs:=tfieldvarsym(varsym);
  701. end;
  702. constructor tsubscriptnode.ppuload(t:tnodetype;ppufile:tcompilerppufile);
  703. begin
  704. inherited ppuload(t,ppufile);
  705. ppufile.getderef(vsderef);
  706. end;
  707. procedure tsubscriptnode.ppuwrite(ppufile:tcompilerppufile);
  708. begin
  709. inherited ppuwrite(ppufile);
  710. ppufile.putderef(vsderef);
  711. end;
  712. procedure tsubscriptnode.buildderefimpl;
  713. begin
  714. inherited buildderefimpl;
  715. vsderef.build(vs);
  716. end;
  717. procedure tsubscriptnode.derefimpl;
  718. begin
  719. inherited derefimpl;
  720. vs:=tfieldvarsym(vsderef.resolve);
  721. end;
  722. function tsubscriptnode.dogetcopy : tnode;
  723. var
  724. p : tsubscriptnode;
  725. begin
  726. p:=tsubscriptnode(inherited dogetcopy);
  727. p.vs:=vs;
  728. dogetcopy:=p;
  729. end;
  730. function tsubscriptnode.pass_typecheck:tnode;
  731. begin
  732. result:=nil;
  733. typecheckpass(left);
  734. { tp procvar support }
  735. maybe_call_procvar(left,true);
  736. resultdef:=vs.vardef;
  737. // don't put records from which we load float fields
  738. // in integer registers
  739. if (left.resultdef.typ=recorddef) and
  740. (resultdef.typ=floatdef) then
  741. make_not_regable(left,[ra_addr_regable]);
  742. end;
  743. procedure Tsubscriptnode.mark_write;
  744. begin
  745. include(flags,nf_write);
  746. { if an element of a record is written, then the whole record is changed/it is written to it,
  747. for data types being implicit pointers this does not apply as the object itself does not change }
  748. if not(is_implicit_pointer_object_type(left.resultdef)) then
  749. left.mark_write;
  750. end;
  751. function tsubscriptnode.pass_1 : tnode;
  752. begin
  753. result:=nil;
  754. firstpass(left);
  755. if codegenerror then
  756. exit;
  757. { several object types must be dereferenced implicitly }
  758. if is_implicit_pointer_object_type(left.resultdef) then
  759. expectloc:=LOC_REFERENCE
  760. else
  761. begin
  762. case left.expectloc of
  763. { if a floating point value is casted into a record, it
  764. can happen that we get here an fpu or mm register }
  765. LOC_CMMREGISTER,
  766. LOC_CFPUREGISTER,
  767. LOC_MMREGISTER,
  768. LOC_FPUREGISTER,
  769. LOC_CONSTANT,
  770. LOC_REGISTER,
  771. LOC_SUBSETREG:
  772. // can happen for function results on win32 and darwin/x86
  773. if (left.resultdef.size > sizeof(pint)) then
  774. expectloc:=LOC_REFERENCE
  775. else
  776. expectloc:=LOC_SUBSETREG;
  777. LOC_CREGISTER,
  778. LOC_CSUBSETREG:
  779. expectloc:=LOC_CSUBSETREG;
  780. LOC_REFERENCE,
  781. LOC_CREFERENCE:
  782. expectloc:=left.expectloc;
  783. else internalerror(20060521);
  784. end;
  785. end;
  786. end;
  787. function tsubscriptnode.docompare(p: tnode): boolean;
  788. begin
  789. docompare :=
  790. inherited docompare(p) and
  791. (vs = tsubscriptnode(p).vs);
  792. end;
  793. {$ifdef DEBUG_NODE_XML}
  794. procedure TSubscriptNode.XMLPrintNodeData(var T: Text);
  795. begin
  796. inherited XMLPrintNodeData(T);
  797. WriteLn(T, PrintNodeIndention, '<field>', vs.Name, '</field>');
  798. end;
  799. {$endif DEBUG_NODE_XML}
  800. {*****************************************************************************
  801. TVECNODE
  802. *****************************************************************************}
  803. constructor tvecnode.create(l,r : tnode);
  804. begin
  805. inherited create(vecn,l,r);
  806. end;
  807. function tvecnode.pass_typecheck:tnode;
  808. var
  809. htype,elementdef,elementptrdef : tdef;
  810. newordtyp: tordtype;
  811. valid : boolean;
  812. minvalue, maxvalue: Tconstexprint;
  813. begin
  814. result:=nil;
  815. typecheckpass(left);
  816. typecheckpass(right);
  817. { implicitly convert stringconstant to stringdef,
  818. see tbs/tb0476.pp for a test }
  819. if (left.nodetype=stringconstn) and
  820. (tstringconstnode(left).cst_type=cst_conststring) then
  821. begin
  822. if tstringconstnode(left).len>255 then
  823. inserttypeconv(left,getansistringdef)
  824. else
  825. inserttypeconv(left,cshortstringtype);
  826. end;
  827. { In p[1] p is always valid, it is not possible to
  828. declared a shortstring or normal array that has
  829. undefined number of elements. Dynamic array and
  830. ansi/widestring needs to be valid }
  831. valid:=is_dynamic_array(left.resultdef) or
  832. is_ansistring(left.resultdef) or
  833. is_wide_or_unicode_string(left.resultdef) or
  834. { implicit pointer dereference -> pointer is read }
  835. (left.resultdef.typ = pointerdef);
  836. if valid then
  837. set_varstate(left,vs_read,[vsf_must_be_valid]);
  838. {
  839. A vecn is, just like a loadn, always part of an expression with its
  840. own read/write and must_be_valid semantics. Therefore we don't have
  841. to do anything else here, just like for loadn's
  842. }
  843. set_varstate(right,vs_read,[vsf_must_be_valid]);
  844. if codegenerror then
  845. exit;
  846. { maybe type conversion for the index value, but
  847. do not convert range nodes }
  848. if (right.nodetype<>rangen) then
  849. case left.resultdef.typ of
  850. arraydef:
  851. begin
  852. htype:=Tarraydef(left.resultdef).rangedef;
  853. if ado_isvariant in Tarraydef(left.resultdef).arrayoptions then
  854. {Variant arrays are a special array, can have negative indexes and would therefore
  855. need s32bit. However, they should not appear in a vecn, as they are handled in
  856. handle_variantarray in pexpr.pas. Therefore, encountering a variant array is an
  857. internal error... }
  858. internalerror(200707031)
  859. { open array and array constructor range checking is handled
  860. below at the node level, where the validity of the index
  861. will be checked -> use a regular type conversion to either
  862. the signed or unsigned native int type to prevent another
  863. range check from getting inserted here (unless the type is
  864. larger than the int type). Exception: if it's an ordinal
  865. constant, because then this check should be performed at
  866. compile time }
  867. else if is_open_array(left.resultdef) or
  868. is_array_constructor(left.resultdef) then
  869. begin
  870. if is_signed(right.resultdef) and
  871. not is_constnode(right) then
  872. inserttypeconv(right,sizesinttype)
  873. else
  874. inserttypeconv(right,sizeuinttype)
  875. end
  876. else if is_special_array(left.resultdef) then
  877. {Arrays without a high bound (dynamic arrays, open arrays) are zero based,
  878. convert indexes into these arrays to aword.}
  879. inserttypeconv(right,uinttype)
  880. { note: <> rather than </>, because indexing e.g. an array 0..0
  881. must not result in truncating the indexing value from 2/4/8
  882. bytes to 1 byte (with range checking off, the full index
  883. value must be used) }
  884. else if (htype.typ=enumdef) and
  885. (right.resultdef.typ=enumdef) and
  886. (tenumdef(htype).basedef=tenumdef(right.resultdef).basedef) and
  887. ((tarraydef(left.resultdef).lowrange<>tenumdef(htype).min) or
  888. (tarraydef(left.resultdef).highrange<>tenumdef(htype).max) or
  889. { while we could assume that the value might not be out of range,
  890. memory corruption could have resulted in an illegal value,
  891. so do not skip the type conversion in case of range checking
  892. After all, range checking is a safety mean }
  893. (cs_check_range in current_settings.localswitches)) then
  894. {Convert array indexes to low_bound..high_bound.}
  895. inserttypeconv(right,cenumdef.create_subrange(tenumdef(right.resultdef),
  896. asizeint(Tarraydef(left.resultdef).lowrange),
  897. asizeint(Tarraydef(left.resultdef).highrange)
  898. ))
  899. else if (htype.typ=orddef) and
  900. { right can also be a variant or another type with
  901. overloaded assignment }
  902. (right.resultdef.typ=orddef) and
  903. { don't try to create boolean types with custom ranges }
  904. not is_boolean(right.resultdef) and
  905. { ordtype determines the size of the loaded value -> make
  906. sure we don't truncate }
  907. ((Torddef(right.resultdef).ordtype<>torddef(htype).ordtype) or
  908. (tarraydef(left.resultdef).lowrange<>torddef(htype).low) or
  909. (tarraydef(left.resultdef).highrange<>torddef(htype).high)) then
  910. {Convert array indexes to low_bound..high_bound.}
  911. begin
  912. if (right.resultdef.typ=orddef)
  913. {$ifndef cpu64bitaddr}
  914. { do truncate 64 bit values on 32 bit cpus, since
  915. a) the arrays cannot be > 32 bit anyway
  916. b) their code generators can't directly handle 64 bit
  917. loads
  918. }
  919. and not is_64bit(right.resultdef)
  920. {$endif not cpu64bitaddr}
  921. then
  922. begin
  923. { in case of an integer type, we need a new type which covers declaration range and index range,
  924. see tests/webtbs/tw38413.pp
  925. This matters only if we sign extend, if the type exceeds the sint range, we can fall back only
  926. to the index type
  927. }
  928. if is_integer(right.resultdef) and ((torddef(right.resultdef).low<0) or (TConstExprInt(Tarraydef(left.resultdef).lowrange)<0)) then
  929. begin
  930. minvalue:=min(TConstExprInt(Tarraydef(left.resultdef).lowrange),torddef(right.resultdef).low);
  931. maxvalue:=max(TConstExprInt(Tarraydef(left.resultdef).highrange),torddef(right.resultdef).high);
  932. if maxvalue>torddef(sinttype).high then
  933. newordtyp:=Torddef(right.resultdef).ordtype
  934. else
  935. newordtyp:=range_to_basetype(minvalue,maxvalue);
  936. end
  937. else
  938. newordtyp:=Torddef(right.resultdef).ordtype;
  939. end
  940. else
  941. newordtyp:=torddef(sizesinttype).ordtype;
  942. inserttypeconv(right,corddef.create(newordtyp,
  943. int64(Tarraydef(left.resultdef).lowrange),
  944. int64(Tarraydef(left.resultdef).highrange),
  945. true
  946. ));
  947. end
  948. else
  949. begin
  950. inserttypeconv(right,htype);
  951. { insert type conversion so cse can pick it up }
  952. if (htype.size<ptrsinttype.size) and is_integer(htype) and not(cs_check_range in current_settings.localswitches) then
  953. inserttypeconv_internal(right,ptrsinttype);
  954. end;
  955. end;
  956. stringdef:
  957. if is_open_string(left.resultdef) then
  958. inserttypeconv(right,u8inttype)
  959. else if is_shortstring(left.resultdef) then
  960. {Convert shortstring indexes to 0..length.}
  961. inserttypeconv(right,corddef.create(u8bit,0,int64(Tstringdef(left.resultdef).len),true))
  962. else
  963. {Convert indexes into dynamically allocated strings to aword.}
  964. inserttypeconv(right,uinttype);
  965. pointerdef:
  966. inserttypeconv(right,tpointerdef(left.resultdef).pointer_arithmetic_int_type);
  967. else
  968. {Others, (are there any?) indexes to aint.}
  969. inserttypeconv(right,sinttype);
  970. end;
  971. { although we never put regular arrays or shortstrings in registers,
  972. it's possible that another type was typecasted to a small record
  973. that has a field of one of these types -> in that case the record
  974. can't be a regvar either }
  975. if ((left.resultdef.typ=arraydef) and
  976. not is_special_array(left.resultdef) and
  977. { arrays with elements equal to the alu size and with a constant index can be kept in register }
  978. not(is_constnode(right) and (tarraydef(left.resultdef).elementdef.size=alusinttype.size))) or
  979. ((left.resultdef.typ=stringdef) and
  980. (tstringdef(left.resultdef).stringtype in [st_shortstring,st_longstring])) then
  981. make_not_regable(left,[ra_addr_regable]);
  982. case left.resultdef.typ of
  983. arraydef :
  984. begin
  985. { check type of the index value }
  986. if (compare_defs(right.resultdef,tarraydef(left.resultdef).rangedef,right.nodetype)=te_incompatible) then
  987. IncompatibleTypes(right.resultdef,tarraydef(left.resultdef).rangedef);
  988. if right.nodetype=rangen then
  989. resultdef:=left.resultdef
  990. else
  991. resultdef:=Tarraydef(left.resultdef).elementdef;
  992. result:=gen_array_rangecheck;
  993. if assigned(result) then
  994. exit;
  995. { in case of a bitpacked array of enums that are size 2 (due to
  996. packenum 2) but whose values all fit in one byte, the size of
  997. bitpacked array elements will be 1 byte while the resultdef of
  998. will currently say it's two bytes) -> create a temp enumdef
  999. with packenum=1 for the resultdef as subtype of the main
  1000. enumdef }
  1001. if is_enum(resultdef) and
  1002. is_packed_array(left.resultdef) and
  1003. ((tarraydef(left.resultdef).elepackedbitsize div 8) <> resultdef.size) then
  1004. begin
  1005. resultdef:=cenumdef.create_subrange(tenumdef(resultdef),tenumdef(resultdef).min,tenumdef(resultdef).max);
  1006. tenumdef(resultdef).calcsavesize(1);
  1007. end
  1008. end;
  1009. pointerdef :
  1010. begin
  1011. { are we accessing a pointer[], then convert the pointer to
  1012. an array first, in FPC this is allowed for all pointers
  1013. (except voidpointer) in delphi/tp7 it's only allowed for pchars. }
  1014. if not is_voidpointer(left.resultdef) and
  1015. (
  1016. (cs_pointermath in current_settings.localswitches) or
  1017. tpointerdef(left.resultdef).has_pointer_math or
  1018. is_pchar(left.resultdef) or
  1019. is_pwidechar(left.resultdef)
  1020. ) then
  1021. begin
  1022. { convert pointer to array }
  1023. htype:=carraydef.create_from_pointer(tpointerdef(left.resultdef));
  1024. inserttypeconv(left,htype);
  1025. if right.nodetype=rangen then
  1026. resultdef:=htype
  1027. else
  1028. resultdef:=tarraydef(htype).elementdef;
  1029. end
  1030. else
  1031. CGMessage(type_e_array_required);
  1032. end;
  1033. stringdef :
  1034. begin
  1035. case tstringdef(left.resultdef).stringtype of
  1036. st_unicodestring,
  1037. st_widestring :
  1038. begin
  1039. elementdef:=cwidechartype;
  1040. elementptrdef:=widecharpointertype;
  1041. end;
  1042. st_ansistring,
  1043. st_longstring,
  1044. st_shortstring :
  1045. begin
  1046. elementdef:=cansichartype;
  1047. elementptrdef:=charpointertype;
  1048. end;
  1049. end;
  1050. if right.nodetype=rangen then
  1051. begin
  1052. htype:=carraydef.create_from_pointer(tpointerdef(elementptrdef));
  1053. resultdef:=htype;
  1054. end
  1055. else
  1056. begin
  1057. { indexed access to 0 element is only allowed for shortstrings or if
  1058. zero based strings is turned on }
  1059. if (right.nodetype=ordconstn) and
  1060. (Tordconstnode(right).value.svalue=0) and
  1061. not is_shortstring(left.resultdef) and
  1062. not(cs_zerobasedstrings in current_settings.localswitches) then
  1063. CGMessage(cg_e_can_access_element_zero);
  1064. resultdef:=elementdef;
  1065. end;
  1066. end;
  1067. variantdef :
  1068. resultdef:=cvarianttype;
  1069. else
  1070. CGMessage(type_e_array_required);
  1071. end;
  1072. end;
  1073. procedure Tvecnode.mark_write;
  1074. begin
  1075. include(flags,nf_write);
  1076. { see comment in tsubscriptnode.mark_write }
  1077. if not(is_implicit_array_pointer(left.resultdef)) then
  1078. left.mark_write;
  1079. end;
  1080. function tvecnode.pass_1 : tnode;
  1081. begin
  1082. result:=nil;
  1083. firstpass(left);
  1084. firstpass(right);
  1085. if codegenerror then
  1086. exit;
  1087. if (nf_callunique in flags) and
  1088. (is_ansistring(left.resultdef) or
  1089. is_unicodestring(left.resultdef) or
  1090. (is_widestring(left.resultdef) and not(tf_winlikewidestring in target_info.flags))) then
  1091. begin
  1092. left := ctypeconvnode.create_internal(ccallnode.createintern('fpc_'+tstringdef(left.resultdef).stringtypname+'_unique',
  1093. ccallparanode.create(
  1094. ctypeconvnode.create_internal(left,voidpointertype),nil)),
  1095. left.resultdef);
  1096. firstpass(left);
  1097. { double resultdef passes somwhere else may cause this to be }
  1098. { reset though :/ }
  1099. exclude(flags,nf_callunique);
  1100. end
  1101. else if is_widestring(left.resultdef) and (tf_winlikewidestring in target_info.flags) then
  1102. exclude(flags,nf_callunique);
  1103. { a range node as array index can only appear in function calls, and
  1104. those convert the range node into something else in
  1105. tcallnode.gen_high_tree }
  1106. if (right.nodetype=rangen) then
  1107. CGMessagePos(right.fileinfo,parser_e_illegal_expression)
  1108. else if left.resultdef.typ=arraydef then
  1109. result:=first_arraydef
  1110. else
  1111. begin
  1112. if left.expectloc=LOC_CREFERENCE then
  1113. expectloc:=LOC_CREFERENCE
  1114. else
  1115. expectloc:=LOC_REFERENCE
  1116. end;
  1117. end;
  1118. function tvecnode.first_arraydef: tnode;
  1119. begin
  1120. result:=nil;
  1121. if (not is_packed_array(left.resultdef)) or
  1122. ((tarraydef(left.resultdef).elepackedbitsize mod 8) = 0) then
  1123. if left.expectloc=LOC_CREFERENCE then
  1124. expectloc:=LOC_CREFERENCE
  1125. else
  1126. expectloc:=LOC_REFERENCE
  1127. else
  1128. if left.expectloc=LOC_CREFERENCE then
  1129. expectloc:=LOC_CSUBSETREF
  1130. else
  1131. expectloc:=LOC_SUBSETREF;
  1132. end;
  1133. function tvecnode.gen_array_rangecheck: tnode;
  1134. var
  1135. htype: tdef;
  1136. temp: ttempcreatenode;
  1137. stat: tstatementnode;
  1138. indextree: tnode;
  1139. hightree: tnode;
  1140. begin
  1141. result:=nil;
  1142. { Range checking an array of const/open array/dynamic array is
  1143. more complicated than regular arrays, because the bounds must
  1144. be checked dynamically. Additionally, in case of array of const
  1145. and open array we need the high parameter, which must not be
  1146. made a regvar in case this is a nested rountine relative to the
  1147. array parameter -> generate te check at the node tree level
  1148. rather than in the code generator }
  1149. if (cs_check_range in current_settings.localswitches) and
  1150. (is_open_array(left.resultdef) or
  1151. is_array_of_const(left.resultdef)) and
  1152. (right.nodetype<>rangen) then
  1153. begin
  1154. { expect to find the load node }
  1155. if get_open_const_array(left).nodetype<>loadn then
  1156. internalerror(2014040601);
  1157. { cdecl functions don't have high() so we can not check the range }
  1158. { (can't use current_procdef, since it may be a nested procedure) }
  1159. if not(tprocdef(tparasymtable(tparavarsym(tloadnode(get_open_const_array(left)).symtableentry).owner).defowner).proccalloption in cdecl_pocalls) then
  1160. begin
  1161. temp:=nil;
  1162. result:=internalstatements(stat);
  1163. { can't use node_complexity here, assumes that the code has
  1164. already been firstpassed }
  1165. if not is_const(right) then
  1166. begin
  1167. temp:=ctempcreatenode.create(right.resultdef,right.resultdef.size,tt_persistent,true);
  1168. addstatement(stat,temp);
  1169. { needed so we can typecheck its temprefnodes }
  1170. typecheckpass(tnode(temp));
  1171. addstatement(stat,cassignmentnode.create(
  1172. ctemprefnode.create(temp),right)
  1173. );
  1174. right:=ctemprefnode.create(temp);
  1175. { right.resultdef is used below }
  1176. typecheckpass(right);
  1177. end;
  1178. { range check will be made explicit here }
  1179. exclude(localswitches,cs_check_range);
  1180. hightree:=load_high_value_node(tparavarsym(tloadnode(
  1181. get_open_const_array(left)).symtableentry));
  1182. { make index unsigned so we only need one comparison;
  1183. lower bound is always zero for these arrays, but
  1184. hightree can be -1 in case the array was empty ->
  1185. add 1 before comparing (ignoring overflows) }
  1186. htype:=get_unsigned_inttype(right.resultdef);
  1187. inserttypeconv_explicit(hightree,htype);
  1188. hightree:=caddnode.create(addn,hightree,genintconstnode(1));
  1189. hightree.localswitches:=hightree.localswitches-[cs_check_range,
  1190. cs_check_overflow];
  1191. indextree:=ctypeconvnode.create_explicit(right.getcopy,htype);
  1192. { range error if index >= hightree+1 }
  1193. addstatement(stat,
  1194. cifnode.create_internal(
  1195. caddnode.create_internal(gten,indextree,hightree),
  1196. ccallnode.createintern('fpc_rangeerror',nil),
  1197. nil
  1198. )
  1199. );
  1200. if assigned(temp) then
  1201. addstatement(stat,ctempdeletenode.create_normal_temp(temp));
  1202. addstatement(stat,self.getcopy);
  1203. end;
  1204. end;
  1205. end;
  1206. {$ifdef DEBUG_NODE_XML}
  1207. procedure TVecNode.XMLPrintNodeData(var T: Text);
  1208. begin
  1209. XMLPrintNode(T, Left);
  1210. { The right node is the index }
  1211. WriteLn(T, PrintNodeIndention, '<index>');
  1212. PrintNodeIndent;
  1213. XMLPrintNode(T, Right);
  1214. PrintNodeUnindent;
  1215. WriteLn(T, PrintNodeIndention, '</index>');
  1216. PrintNodeUnindent;
  1217. WriteLn(T, PrintNodeIndention, '</', nodetype2str[nodetype], '>');
  1218. end;
  1219. {$endif DEBUG_NODE_XML}
  1220. function is_big_untyped_addrnode(p: tnode): boolean;
  1221. begin
  1222. is_big_untyped_addrnode:=(p.nodetype=addrn) and
  1223. not (anf_typedaddr in taddrnode(p).addrnodeflags) and
  1224. (taddrnode(p).left.resultdef.size > 1);
  1225. end;
  1226. end.