nmem.pas 44 KB

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