nld.pas 48 KB

12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364656667686970717273747576777879808182838485868788899091929394959697989910010110210310410510610710810911011111211311411511611711811912012112212312412512612712812913013113213313413513613713813914014114214314414514614714814915015115215315415515615715815916016116216316416516616716816917017117217317417517617717817918018118218318418518618718818919019119219319419519619719819920020120220320420520620720820921021121221321421521621721821922022122222322422522622722822923023123223323423523623723823924024124224324424524624724824925025125225325425525625725825926026126226326426526626726826927027127227327427527627727827928028128228328428528628728828929029129229329429529629729829930030130230330430530630730830931031131231331431531631731831932032132232332432532632732832933033133233333433533633733833934034134234334434534634734834935035135235335435535635735835936036136236336436536636736836937037137237337437537637737837938038138238338438538638738838939039139239339439539639739839940040140240340440540640740840941041141241341441541641741841942042142242342442542642742842943043143243343443543643743843944044144244344444544644744844945045145245345445545645745845946046146246346446546646746846947047147247347447547647747847948048148248348448548648748848949049149249349449549649749849950050150250350450550650750850951051151251351451551651751851952052152252352452552652752852953053153253353453553653753853954054154254354454554654754854955055155255355455555655755855956056156256356456556656756856957057157257357457557657757857958058158258358458558658758858959059159259359459559659759859960060160260360460560660760860961061161261361461561661761861962062162262362462562662762862963063163263363463563663763863964064164264364464564664764864965065165265365465565665765865966066166266366466566666766866967067167267367467567667767867968068168268368468568668768868969069169269369469569669769869970070170270370470570670770870971071171271371471571671771871972072172272372472572672772872973073173273373473573673773873974074174274374474574674774874975075175275375475575675775875976076176276376476576676776876977077177277377477577677777877978078178278378478578678778878979079179279379479579679779879980080180280380480580680780880981081181281381481581681781881982082182282382482582682782882983083183283383483583683783883984084184284384484584684784884985085185285385485585685785885986086186286386486586686786886987087187287387487587687787887988088188288388488588688788888989089189289389489589689789889990090190290390490590690790890991091191291391491591691791891992092192292392492592692792892993093193293393493593693793893994094194294394494594694794894995095195295395495595695795895996096196296396496596696796896997097197297397497597697797897998098198298398498598698798898999099199299399499599699799899910001001100210031004100510061007100810091010101110121013101410151016101710181019102010211022102310241025102610271028102910301031103210331034103510361037103810391040104110421043104410451046104710481049105010511052105310541055105610571058105910601061106210631064106510661067106810691070107110721073107410751076107710781079108010811082108310841085108610871088108910901091109210931094109510961097109810991100110111021103110411051106110711081109111011111112111311141115111611171118111911201121112211231124112511261127112811291130113111321133113411351136113711381139114011411142114311441145114611471148114911501151115211531154115511561157115811591160116111621163116411651166116711681169117011711172117311741175117611771178117911801181118211831184118511861187118811891190119111921193119411951196119711981199120012011202120312041205120612071208120912101211121212131214121512161217121812191220122112221223122412251226122712281229123012311232123312341235123612371238123912401241124212431244124512461247124812491250125112521253125412551256125712581259126012611262126312641265126612671268126912701271127212731274127512761277127812791280128112821283128412851286128712881289129012911292129312941295129612971298129913001301130213031304130513061307130813091310131113121313131413151316131713181319132013211322132313241325132613271328132913301331133213331334133513361337133813391340134113421343134413451346134713481349135013511352
  1. {
  2. Copyright (c) 2000-2002 by Florian Klaempfl
  3. Type checking and register allocation for load/assignment 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 nld;
  18. {$i fpcdefs.inc}
  19. interface
  20. uses
  21. node,
  22. {$ifdef state_tracking}
  23. nstate,
  24. {$endif}
  25. symconst,symbase,symtype,symsym,symdef;
  26. type
  27. Trttidatatype = (rdt_normal,rdt_ord2str,rdt_str2ord);
  28. tloadnodeflags = (
  29. loadnf_is_self,
  30. loadnf_load_self_pointer,
  31. loadnf_inherited,
  32. { the loadnode is generated internally and a varspez=vs_const should be ignore,
  33. this requires that the parameter is actually passed by value
  34. Be really carefull when using this flag! }
  35. loadnf_isinternal_ignoreconst,
  36. loadnf_only_uninitialized_hint
  37. );
  38. tloadnode = class(tunarynode)
  39. protected
  40. fprocdef : tprocdef;
  41. fprocdefderef : tderef;
  42. function handle_threadvar_access: tnode; virtual;
  43. public
  44. loadnodeflags : set of tloadnodeflags;
  45. symtableentry : tsym;
  46. symtableentryderef : tderef;
  47. symtable : TSymtable;
  48. constructor create(v : tsym;st : TSymtable);virtual;
  49. constructor create_procvar(v : tsym;d:tprocdef;st : TSymtable);virtual;
  50. constructor ppuload(t:tnodetype;ppufile:tcompilerppufile);override;
  51. procedure ppuwrite(ppufile:tcompilerppufile);override;
  52. procedure buildderefimpl;override;
  53. procedure derefimpl;override;
  54. procedure set_mp(p:tnode);
  55. function is_addr_param_load:boolean;virtual;
  56. function dogetcopy : tnode;override;
  57. function pass_1 : tnode;override;
  58. function pass_typecheck:tnode;override;
  59. procedure mark_write;override;
  60. function docompare(p: tnode): boolean; override;
  61. procedure printnodedata(var t:text);override;
  62. procedure setprocdef(p : tprocdef);
  63. property procdef: tprocdef read fprocdef write setprocdef;
  64. end;
  65. tloadnodeclass = class of tloadnode;
  66. { different assignment types }
  67. tassigntype = (at_normal,at_plus,at_minus,at_star,at_slash);
  68. tassignmentnode = class(tbinarynode)
  69. protected
  70. function direct_shortstring_assignment: boolean; virtual;
  71. public
  72. assigntype : tassigntype;
  73. constructor create(l,r : tnode);virtual;
  74. { no checks for validity of assignment }
  75. constructor create_internal(l,r : tnode);virtual;
  76. constructor ppuload(t:tnodetype;ppufile:tcompilerppufile);override;
  77. procedure ppuwrite(ppufile:tcompilerppufile);override;
  78. function dogetcopy : tnode;override;
  79. function pass_1 : tnode;override;
  80. function pass_typecheck:tnode;override;
  81. function simplify(forinline : boolean) : tnode;override;
  82. {$ifdef state_tracking}
  83. function track_state_pass(exec_known:boolean):boolean;override;
  84. {$endif state_tracking}
  85. function docompare(p: tnode): boolean; override;
  86. end;
  87. tassignmentnodeclass = class of tassignmentnode;
  88. tarrayconstructorrangenode = class(tbinarynode)
  89. constructor create(l,r : tnode);virtual;
  90. function pass_1 : tnode;override;
  91. function pass_typecheck:tnode;override;
  92. end;
  93. tarrayconstructorrangenodeclass = class of tarrayconstructorrangenode;
  94. tarrayconstructornode = class(tbinarynode)
  95. protected
  96. procedure wrapmanagedvarrec(var n: tnode);virtual;abstract;
  97. public
  98. constructor create(l,r : tnode);virtual;
  99. function dogetcopy : tnode;override;
  100. function pass_1 : tnode;override;
  101. function pass_typecheck:tnode;override;
  102. function docompare(p: tnode): boolean; override;
  103. procedure force_type(def:tdef);
  104. procedure insert_typeconvs;
  105. end;
  106. tarrayconstructornodeclass = class of tarrayconstructornode;
  107. ttypenode = class(tnode)
  108. allowed : boolean;
  109. helperallowed : boolean;
  110. typedef : tdef;
  111. typedefderef : tderef;
  112. typesym : tsym;
  113. typesymderef : tderef;
  114. constructor create(def:tdef);virtual;
  115. constructor ppuload(t:tnodetype;ppufile:tcompilerppufile);override;
  116. procedure ppuwrite(ppufile:tcompilerppufile);override;
  117. procedure buildderefimpl;override;
  118. procedure derefimpl;override;
  119. function pass_1 : tnode;override;
  120. function pass_typecheck:tnode;override;
  121. function dogetcopy : tnode;override;
  122. function docompare(p: tnode): boolean; override;
  123. end;
  124. ttypenodeclass = class of ttypenode;
  125. trttinode = class(tnode)
  126. l1,l2 : longint;
  127. rttitype : trttitype;
  128. rttidef : tstoreddef;
  129. rttidefderef : tderef;
  130. rttidatatype : Trttidatatype;
  131. constructor create(def:tstoreddef;rt:trttitype;dt:Trttidatatype);virtual;
  132. constructor ppuload(t:tnodetype;ppufile:tcompilerppufile);override;
  133. procedure ppuwrite(ppufile:tcompilerppufile);override;
  134. procedure buildderefimpl;override;
  135. procedure derefimpl;override;
  136. function dogetcopy : tnode;override;
  137. function pass_1 : tnode;override;
  138. function pass_typecheck:tnode;override;
  139. function docompare(p: tnode): boolean; override;
  140. end;
  141. trttinodeclass = class of trttinode;
  142. var
  143. cloadnode : tloadnodeclass = tloadnode;
  144. cassignmentnode : tassignmentnodeclass = tassignmentnode;
  145. carrayconstructorrangenode : tarrayconstructorrangenodeclass = tarrayconstructorrangenode;
  146. carrayconstructornode : tarrayconstructornodeclass = tarrayconstructornode;
  147. ctypenode : ttypenodeclass = ttypenode;
  148. crttinode : trttinodeclass = trttinode;
  149. { Current assignment node }
  150. aktassignmentnode : tassignmentnode;
  151. implementation
  152. uses
  153. verbose,globtype,globals,systems,constexp,
  154. symtable,
  155. defutil,defcmp,
  156. htypechk,pass_1,procinfo,paramgr,
  157. cpuinfo,
  158. ncon,ninl,ncnv,nmem,ncal,nadd,nutils,
  159. cgbase
  160. ;
  161. {*****************************************************************************
  162. TLOADNODE
  163. *****************************************************************************}
  164. function tloadnode.handle_threadvar_access: tnode;
  165. begin
  166. { nothing special by default }
  167. result:=nil;
  168. end;
  169. constructor tloadnode.create(v : tsym;st : TSymtable);
  170. begin
  171. inherited create(loadn,nil);
  172. if not assigned(v) then
  173. internalerror(200108121);
  174. symtableentry:=v;
  175. symtable:=st;
  176. fprocdef:=nil;
  177. end;
  178. constructor tloadnode.create_procvar(v : tsym;d:tprocdef;st : TSymtable);
  179. begin
  180. inherited create(loadn,nil);
  181. if not assigned(v) then
  182. internalerror(200108122);
  183. symtableentry:=v;
  184. symtable:=st;
  185. fprocdef:=d;
  186. end;
  187. constructor tloadnode.ppuload(t:tnodetype;ppufile:tcompilerppufile);
  188. begin
  189. inherited ppuload(t,ppufile);
  190. ppufile.getderef(symtableentryderef);
  191. symtable:=nil;
  192. ppufile.getderef(fprocdefderef);
  193. ppufile.getsmallset(loadnodeflags);
  194. end;
  195. procedure tloadnode.ppuwrite(ppufile:tcompilerppufile);
  196. begin
  197. inherited ppuwrite(ppufile);
  198. ppufile.putderef(symtableentryderef);
  199. ppufile.putderef(fprocdefderef);
  200. ppufile.putsmallset(loadnodeflags);
  201. end;
  202. procedure tloadnode.buildderefimpl;
  203. begin
  204. inherited buildderefimpl;
  205. symtableentryderef.build(symtableentry);
  206. fprocdefderef.build(fprocdef);
  207. end;
  208. procedure tloadnode.derefimpl;
  209. begin
  210. inherited derefimpl;
  211. symtableentry:=tsym(symtableentryderef.resolve);
  212. symtable:=symtableentry.owner;
  213. fprocdef:=tprocdef(fprocdefderef.resolve);
  214. end;
  215. procedure tloadnode.set_mp(p:tnode);
  216. begin
  217. { typen nodes should not be set }
  218. if p.nodetype=typen then
  219. internalerror(200301042);
  220. left:=p;
  221. end;
  222. function tloadnode.dogetcopy : tnode;
  223. var
  224. n : tloadnode;
  225. begin
  226. n:=tloadnode(inherited dogetcopy);
  227. n.symtable:=symtable;
  228. n.symtableentry:=symtableentry;
  229. n.fprocdef:=fprocdef;
  230. n.loadnodeflags:=loadnodeflags;
  231. result:=n;
  232. end;
  233. function tloadnode.is_addr_param_load:boolean;
  234. begin
  235. result:=(symtable.symtabletype=parasymtable) and
  236. (symtableentry.typ=paravarsym) and
  237. not(vo_has_local_copy in tparavarsym(symtableentry).varoptions) and
  238. not(loadnf_load_self_pointer in loadnodeflags) and
  239. paramanager.push_addr_param(tparavarsym(symtableentry).varspez,tparavarsym(symtableentry).vardef,tprocdef(symtable.defowner).proccalloption);
  240. end;
  241. function tloadnode.pass_typecheck:tnode;
  242. begin
  243. result:=nil;
  244. case symtableentry.typ of
  245. absolutevarsym :
  246. resultdef:=tabsolutevarsym(symtableentry).vardef;
  247. constsym:
  248. begin
  249. if tconstsym(symtableentry).consttyp=constresourcestring then
  250. resultdef:=getansistringdef
  251. else
  252. internalerror(22799);
  253. end;
  254. staticvarsym :
  255. begin
  256. tabstractvarsym(symtableentry).IncRefCountBy(1);
  257. { static variables referenced in procedures or from finalization,
  258. variable needs to be in memory.
  259. It is too hard and the benefit is too small to detect whether a
  260. variable is only used in the finalization to add support for it (PFV) }
  261. if assigned(current_procinfo) and
  262. (symtable.symtabletype=staticsymtable) and
  263. (
  264. (symtable.symtablelevel<>current_procinfo.procdef.localst.symtablelevel) or
  265. (current_procinfo.procdef.proctypeoption=potype_unitfinalize)
  266. ) then
  267. make_not_regable(self,[ra_addr_taken]);
  268. resultdef:=tabstractvarsym(symtableentry).vardef;
  269. if vo_is_thread_var in tstaticvarsym(symtableentry).varoptions then
  270. result:=handle_threadvar_access;
  271. end;
  272. paravarsym,
  273. localvarsym :
  274. begin
  275. tabstractvarsym(symtableentry).IncRefCountBy(1);
  276. { Nested variable? The we need to load the framepointer of
  277. the parent procedure }
  278. if assigned(current_procinfo) and
  279. (symtable.symtabletype in [localsymtable,parasymtable]) and
  280. (symtable.symtablelevel<>current_procinfo.procdef.parast.symtablelevel) then
  281. begin
  282. if assigned(left) then
  283. internalerror(200309289);
  284. left:=cloadparentfpnode.create(tprocdef(symtable.defowner),lpf_forload);
  285. { we can't inline the referenced parent procedure }
  286. exclude(tprocdef(symtable.defowner).procoptions,po_inline);
  287. { reference in nested procedures, variable needs to be in memory }
  288. { and behaves as if its address escapes its parent block }
  289. make_not_regable(self,[ra_addr_taken]);
  290. end;
  291. resultdef:=tabstractvarsym(symtableentry).vardef;
  292. { self for objects is passed as var-parameter on the caller
  293. side, but on the callee-side we use it as a pointer ->
  294. adjust }
  295. if (vo_is_self in tabstractvarsym(symtableentry).varoptions) then
  296. begin
  297. if (is_object(resultdef) or is_record(resultdef)) and
  298. (loadnf_load_self_pointer in loadnodeflags) then
  299. resultdef:=cpointerdef.getreusable(resultdef)
  300. else if (resultdef=objc_idtype) and
  301. (po_classmethod in tprocdef(symtableentry.owner.defowner).procoptions) then
  302. resultdef:=cclassrefdef.create(tprocdef(symtableentry.owner.defowner).struct)
  303. end
  304. end;
  305. procsym :
  306. begin
  307. { Return the first procdef. In case of overloaded
  308. procdefs the matching procdef will be choosen
  309. when the expected procvardef is known, see get_information
  310. in htypechk.pas (PFV) }
  311. if not assigned(fprocdef) then
  312. fprocdef:=tprocdef(tprocsym(symtableentry).ProcdefList[0])
  313. else if po_kylixlocal in fprocdef.procoptions then
  314. CGMessage(type_e_cant_take_address_of_local_subroutine);
  315. { the result is a fprocdef, addrn and proc_to_procvar
  316. typeconvn need this as resultdef so they know
  317. that the address needs to be returned }
  318. resultdef:=fprocdef;
  319. { process methodpointer/framepointer }
  320. if assigned(left) then
  321. begin
  322. typecheckpass(left);
  323. if (po_classmethod in fprocdef.procoptions) and
  324. is_class(left.resultdef) and
  325. (left.nodetype<>niln) then
  326. begin
  327. left:=cloadvmtaddrnode.create(left);
  328. typecheckpass(left);
  329. end
  330. end;
  331. end;
  332. labelsym:
  333. begin
  334. tlabelsym(symtableentry).used:=true;
  335. resultdef:=voidtype;
  336. end;
  337. else
  338. internalerror(200104141);
  339. end;
  340. end;
  341. procedure Tloadnode.mark_write;
  342. begin
  343. include(flags,nf_write);
  344. end;
  345. function tloadnode.pass_1 : tnode;
  346. begin
  347. result:=nil;
  348. expectloc:=LOC_REFERENCE;
  349. if (cs_create_pic in current_settings.moduleswitches) and
  350. not(symtableentry.typ in [paravarsym,localvarsym]) then
  351. include(current_procinfo.flags,pi_needs_got);
  352. case symtableentry.typ of
  353. absolutevarsym :
  354. ;
  355. constsym:
  356. begin
  357. if tconstsym(symtableentry).consttyp=constresourcestring then
  358. expectloc:=LOC_CREFERENCE;
  359. end;
  360. staticvarsym,
  361. localvarsym,
  362. paravarsym :
  363. begin
  364. if assigned(left) then
  365. firstpass(left);
  366. if not is_addr_param_load and
  367. tabstractvarsym(symtableentry).is_regvar(is_addr_param_load) then
  368. expectloc:=tvarregable2tcgloc[tabstractvarsym(symtableentry).varregable]
  369. else
  370. if (tabstractvarsym(symtableentry).varspez=vs_const) then
  371. expectloc:=LOC_CREFERENCE;
  372. if (target_info.system=system_powerpc_darwin) and
  373. ([vo_is_dll_var,vo_is_external] * tabstractvarsym(symtableentry).varoptions <> []) then
  374. include(current_procinfo.flags,pi_needs_got);
  375. { call to get address of threadvar }
  376. if (vo_is_thread_var in tabstractvarsym(symtableentry).varoptions) then
  377. include(current_procinfo.flags,pi_do_call);
  378. end;
  379. procsym :
  380. begin
  381. { initialise left for nested procs if necessary }
  382. if (m_nested_procvars in current_settings.modeswitches) then
  383. setprocdef(fprocdef);
  384. { method pointer or nested proc ? }
  385. if assigned(left) then
  386. begin
  387. expectloc:=LOC_CREGISTER;
  388. firstpass(left);
  389. end;
  390. end;
  391. labelsym :
  392. begin
  393. if not assigned(tlabelsym(symtableentry).asmblocklabel) and
  394. not assigned(tlabelsym(symtableentry).code) then
  395. Message(parser_e_label_outside_proc);
  396. end
  397. else
  398. internalerror(200104143);
  399. end;
  400. end;
  401. function tloadnode.docompare(p: tnode): boolean;
  402. begin
  403. docompare :=
  404. inherited docompare(p) and
  405. (symtableentry = tloadnode(p).symtableentry) and
  406. (fprocdef = tloadnode(p).fprocdef) and
  407. (symtable = tloadnode(p).symtable);
  408. end;
  409. procedure tloadnode.printnodedata(var t:text);
  410. begin
  411. inherited printnodedata(t);
  412. write(t,printnodeindention,'symbol = ',symtableentry.name);
  413. if symtableentry.typ=procsym then
  414. write(t,printnodeindention,'procdef = ',fprocdef.mangledname);
  415. writeln(t,'');
  416. end;
  417. procedure tloadnode.setprocdef(p : tprocdef);
  418. begin
  419. fprocdef:=p;
  420. resultdef:=p;
  421. { nested procedure? }
  422. if assigned(p) and
  423. is_nested_pd(p) then
  424. begin
  425. if not(m_nested_procvars in current_settings.modeswitches) then
  426. CGMessage(type_e_cant_take_address_of_local_subroutine)
  427. else
  428. begin
  429. { parent frame pointer pointer as "self" }
  430. left.free;
  431. left:=cloadparentfpnode.create(tprocdef(p.owner.defowner),lpf_forpara);
  432. end;
  433. end
  434. { we should never go from nested to non-nested }
  435. else if assigned(left) and
  436. (left.nodetype=loadparentfpn) then
  437. internalerror(2010072201);
  438. end;
  439. {*****************************************************************************
  440. TASSIGNMENTNODE
  441. *****************************************************************************}
  442. function tassignmentnode.direct_shortstring_assignment: boolean;
  443. begin
  444. result:=
  445. is_char(right.resultdef) or
  446. (right.resultdef.typ=stringdef);
  447. end;
  448. constructor tassignmentnode.create(l,r : tnode);
  449. begin
  450. inherited create(assignn,l,r);
  451. l.mark_write;
  452. assigntype:=at_normal;
  453. if r.nodetype = typeconvn then
  454. ttypeconvnode(r).warn_pointer_to_signed:=false;
  455. end;
  456. constructor tassignmentnode.create_internal(l, r: tnode);
  457. begin
  458. create(l,r);
  459. include(flags,nf_internal);
  460. end;
  461. constructor tassignmentnode.ppuload(t:tnodetype;ppufile:tcompilerppufile);
  462. begin
  463. inherited ppuload(t,ppufile);
  464. assigntype:=tassigntype(ppufile.getbyte);
  465. end;
  466. procedure tassignmentnode.ppuwrite(ppufile:tcompilerppufile);
  467. begin
  468. inherited ppuwrite(ppufile);
  469. ppufile.putbyte(byte(assigntype));
  470. end;
  471. function tassignmentnode.dogetcopy : tnode;
  472. var
  473. n : tassignmentnode;
  474. begin
  475. n:=tassignmentnode(inherited dogetcopy);
  476. n.assigntype:=assigntype;
  477. result:=n;
  478. end;
  479. function tassignmentnode.simplify(forinline : boolean) : tnode;
  480. begin
  481. result:=nil;
  482. { assignment nodes can perform several floating point }
  483. { type conversions directly, so no typeconversions }
  484. { are inserted in those cases. When inlining, a }
  485. { variable may be replaced by a constant which can be }
  486. { converted at compile time, so check for this case }
  487. if is_real(left.resultdef) and
  488. is_real(right.resultdef) and
  489. is_constrealnode(right) and
  490. not equal_defs(right.resultdef,left.resultdef) then
  491. inserttypeconv(right,left.resultdef);
  492. end;
  493. function tassignmentnode.pass_typecheck:tnode;
  494. var
  495. hp : tnode;
  496. useshelper : boolean;
  497. oldassignmentnode : tassignmentnode;
  498. begin
  499. result:=nil;
  500. resultdef:=voidtype;
  501. { must be made unique }
  502. set_unique(left);
  503. typecheckpass(left);
  504. { PI. This is needed to return correct resultdef of add nodes for ansistrings
  505. rawbytestring return needs to be replaced by left.resultdef }
  506. oldassignmentnode:=aktassignmentnode;
  507. aktassignmentnode:=self;
  508. typecheckpass(right);
  509. aktassignmentnode:=oldassignmentnode;
  510. set_varstate(right,vs_read,[vsf_must_be_valid]);
  511. set_varstate(left,vs_written,[]);
  512. if codegenerror then
  513. exit;
  514. { tp procvar support, when we don't expect a procvar
  515. then we need to call the procvar }
  516. if (left.resultdef.typ<>procvardef) then
  517. maybe_call_procvar(right,true);
  518. { assignments to formaldefs and open arrays aren't allowed }
  519. if is_open_array(left.resultdef) then
  520. CGMessage(type_e_assignment_not_allowed)
  521. else if (left.resultdef.typ=formaldef) then
  522. if not(target_info.system in systems_managed_vm) then
  523. CGMessage(type_e_assignment_not_allowed)
  524. else
  525. begin
  526. { on managed platforms, assigning to formaldefs is allowed (but
  527. typecasting them on the left hand side isn't), but primitive
  528. values need to be boxed first }
  529. if (right.resultdef.typ in [orddef,floatdef]) then
  530. begin
  531. right:=cinlinenode.create(in_box_x,false,ccallparanode.create(right,nil));
  532. typecheckpass(right);
  533. end;
  534. end;
  535. { test if node can be assigned, properties are allowed }
  536. if not(nf_internal in flags) then
  537. if not valid_for_assignment(left,true) then
  538. { errors can in situations that cause the compiler to run out of
  539. memory, such as assigning to an implicit pointer-to-array
  540. converted node (that array is 2^31 or 2^63 bytes large) }
  541. exit;
  542. { assigning nil to a dynamic array clears the array }
  543. if is_dynamic_array(left.resultdef) and
  544. (right.nodetype=niln) then
  545. begin
  546. { remove property flag to avoid errors, see comments for }
  547. { tf_winlikewidestring assignments below }
  548. exclude(left.flags,nf_isproperty);
  549. { generate a setlength node so it can be intercepted by
  550. target-specific code }
  551. result:=cinlinenode.create(in_setlength_x,false,
  552. ccallparanode.create(genintconstnode(0),
  553. ccallparanode.create(left,nil)));
  554. left:=nil;
  555. exit;
  556. end;
  557. { shortstring helpers can do the conversion directly,
  558. so treat them separatly }
  559. if (is_shortstring(left.resultdef)) then
  560. begin
  561. { insert typeconv, except for chars that are handled in
  562. secondpass and except for ansi/wide string that can
  563. be converted immediatly }
  564. if not direct_shortstring_assignment then
  565. inserttypeconv(right,left.resultdef);
  566. if right.resultdef.typ=stringdef then
  567. begin
  568. useshelper:=true;
  569. { convert constant strings to shortstrings. But
  570. skip empty constant strings, that will be handled
  571. in secondpass }
  572. if (right.nodetype=stringconstn) then
  573. begin
  574. { verify if range fits within shortstring }
  575. { just emit a warning, delphi gives an }
  576. { error, only if the type definition of }
  577. { of the string is less < 255 characters }
  578. if not is_open_string(left.resultdef) and
  579. (tstringconstnode(right).len > tstringdef(left.resultdef).len) then
  580. cgmessage(type_w_string_too_long);
  581. inserttypeconv(right,left.resultdef);
  582. if (right.nodetype=stringconstn) and
  583. (tstringconstnode(right).len=0) then
  584. useshelper:=false;
  585. end
  586. else if (tstringdef(right.resultdef).stringtype in [st_unicodestring,st_widestring]) then
  587. Message2(type_w_implicit_string_cast_loss,right.resultdef.typename,left.resultdef.typename);
  588. { rest is done in pass 1 (JM) }
  589. if useshelper then
  590. exit;
  591. end
  592. end
  593. { floating point assignments can also perform the conversion directly }
  594. else if is_real(left.resultdef) and is_real(right.resultdef) and
  595. not is_constrealnode(right)
  596. {$ifdef cpufpemu}
  597. { the emulator can't do this obviously }
  598. and not(current_settings.fputype in [fpu_libgcc,fpu_soft])
  599. {$endif cpufpemu}
  600. {$ifdef x86}
  601. { the assignment node code can't convert a double in an }
  602. { sse register to an extended value in memory more }
  603. { efficiently than a type conversion node, so don't }
  604. { bother implementing support for that }
  605. and (use_vectorfpu(left.resultdef) or not(use_vectorfpu(right.resultdef)))
  606. {$endif}
  607. {$ifdef arm}
  608. { the assignment node code can't convert a single in
  609. an interger register to a double in an mmregister or
  610. vice versa }
  611. and (use_vectorfpu(left.resultdef) and
  612. use_vectorfpu(right.resultdef) and
  613. (tfloatdef(left.resultdef).floattype=tfloatdef(right.resultdef).floattype))
  614. {$endif}
  615. then
  616. begin
  617. if not(nf_internal in flags) then
  618. check_ranges(fileinfo,right,left.resultdef);
  619. end
  620. else
  621. begin
  622. { check if the assignment may cause a range check error }
  623. if not(nf_internal in flags) then
  624. check_ranges(fileinfo,right,left.resultdef);
  625. { beginners might be confused about an error message like
  626. Incompatible types: got "untyped" expected "LongInt"
  627. when trying to assign the result of a procedure, so give
  628. a better error message, see also #19122 }
  629. if (left.resultdef.typ<>procvardef) and
  630. (right.nodetype=calln) and is_void(right.resultdef) then
  631. CGMessage(type_e_procedures_return_no_value)
  632. else if nf_internal in flags then
  633. inserttypeconv_internal(right,left.resultdef)
  634. else
  635. inserttypeconv(right,left.resultdef);
  636. end;
  637. { call helpers for interface }
  638. if is_interfacecom_or_dispinterface(left.resultdef) then
  639. begin
  640. { Normal interface assignments are handled by the generic refcount incr/decr }
  641. if not def_is_related(right.resultdef,left.resultdef) then
  642. begin
  643. { remove property flag to avoid errors, see comments for }
  644. { tf_winlikewidestring assignments below }
  645. exclude(left.flags,nf_isproperty);
  646. hp:=
  647. ccallparanode.create(
  648. cguidconstnode.create(tobjectdef(left.resultdef).iidguid^),
  649. ccallparanode.create(
  650. ctypeconvnode.create_internal(right,voidpointertype),
  651. ccallparanode.create(
  652. ctypeconvnode.create_internal(left,voidpointertype),
  653. nil)));
  654. result:=ccallnode.createintern('fpc_intf_assign_by_iid',hp);
  655. left:=nil;
  656. right:=nil;
  657. exit;
  658. end;
  659. end;
  660. { check if local proc/func is assigned to procvar }
  661. if right.resultdef.typ=procvardef then
  662. test_local_to_procvar(tprocvardef(right.resultdef),left.resultdef);
  663. end;
  664. function tassignmentnode.pass_1 : tnode;
  665. var
  666. hp: tnode;
  667. oldassignmentnode : tassignmentnode;
  668. hdef: tdef;
  669. hs: string;
  670. needrtti: boolean;
  671. begin
  672. result:=nil;
  673. expectloc:=LOC_VOID;
  674. firstpass(left);
  675. { Optimize the reuse of the destination of the assingment in left.
  676. Allow the use of the left inside the tree generated on the right.
  677. This is especially useful for string routines where the destination
  678. is pushed as a parameter. Using the final destination of left directly
  679. save a temp allocation and copy of data (PFV) }
  680. oldassignmentnode:=aktassignmentnode;
  681. aktassignmentnode:=self;
  682. firstpass(right);
  683. aktassignmentnode:=oldassignmentnode;
  684. if nf_assign_done_in_right in flags then
  685. begin
  686. result:=right;
  687. right:=nil;
  688. exit;
  689. end;
  690. if codegenerror then
  691. exit;
  692. { assignment to refcounted variable -> inc/decref }
  693. if is_managed_type(left.resultdef) then
  694. include(current_procinfo.flags,pi_do_call);
  695. needrtti:=false;
  696. if (is_shortstring(left.resultdef)) then
  697. begin
  698. if right.resultdef.typ=stringdef then
  699. begin
  700. if (right.nodetype<>stringconstn) or
  701. (tstringconstnode(right).len<>0) then
  702. begin
  703. { remove property flag to avoid errors, see comments for }
  704. { tf_winlikewidestring assignments below }
  705. exclude(left.flags, nf_isproperty);
  706. hp:=ccallparanode.create
  707. (right,
  708. ccallparanode.create(left,nil));
  709. result:=ccallnode.createintern('fpc_'+tstringdef(right.resultdef).stringtypname+'_to_shortstr',hp);
  710. firstpass(result);
  711. left:=nil;
  712. right:=nil;
  713. end;
  714. end;
  715. exit;
  716. end
  717. { call helpers for composite types containing automated types }
  718. else if is_managed_type(left.resultdef) and
  719. (left.resultdef.typ in [arraydef,objectdef,recorddef]) and
  720. not is_interfacecom_or_dispinterface(left.resultdef) and
  721. not is_dynamic_array(left.resultdef) and
  722. not is_const(left) and
  723. not(target_info.system in systems_garbage_collected_managed_types) then
  724. begin
  725. hp:=ccallparanode.create(caddrnode.create_internal(
  726. crttinode.create(tstoreddef(left.resultdef),initrtti,rdt_normal)),
  727. ccallparanode.create(ctypeconvnode.create_internal(
  728. caddrnode.create_internal(left),voidpointertype),
  729. ccallparanode.create(ctypeconvnode.create_internal(
  730. caddrnode.create_internal(right),voidpointertype),
  731. nil)));
  732. result:=ccallnode.createintern('fpc_copy_proc',hp);
  733. firstpass(result);
  734. left:=nil;
  735. right:=nil;
  736. exit;
  737. end
  738. { call helpers for variant, they can contain non ref. counted types like
  739. vararrays which must be really copied }
  740. else if (left.resultdef.typ=variantdef) and
  741. not(is_const(left)) and
  742. not(target_info.system in systems_garbage_collected_managed_types) then
  743. begin
  744. { remove property flag to avoid errors, see comments for }
  745. { tf_winlikewidestring assignments below }
  746. exclude(left.flags,nf_isproperty);
  747. hdef:=search_system_type('TVARDATA').typedef;
  748. hp:=ccallparanode.create(ctypeconvnode.create_internal(
  749. right,hdef),
  750. ccallparanode.create(ctypeconvnode.create_internal(
  751. left,hdef),
  752. nil));
  753. result:=ccallnode.createintern('fpc_variant_copy',hp);
  754. firstpass(result);
  755. left:=nil;
  756. right:=nil;
  757. exit;
  758. end
  759. else if not(target_info.system in systems_garbage_collected_managed_types) and
  760. not(is_const(left)) then
  761. begin
  762. { call helpers for pointer-sized managed types }
  763. if is_widestring(left.resultdef) then
  764. hs:='fpc_widestr_assign'
  765. else if is_ansistring(left.resultdef) then
  766. hs:='fpc_ansistr_assign'
  767. else if is_unicodestring(left.resultdef) then
  768. hs:='fpc_unicodestr_assign'
  769. else if is_interfacecom_or_dispinterface(left.resultdef) then
  770. hs:='fpc_intf_assign'
  771. else if is_dynamic_array(left.resultdef) then
  772. begin
  773. hs:='fpc_dynarray_assign';
  774. needrtti:=true;
  775. end
  776. else
  777. exit;
  778. end
  779. else
  780. exit;
  781. { The first argument of these procedures is a var parameter. Properties cannot }
  782. { be passed to var or out parameters, because in that case setters/getters are not }
  783. { used. Further, if we would allow it in case there are no getters or setters, you }
  784. { would need source changes in case these are introduced later on, thus defeating }
  785. { part of the transparency advantages of properties. In this particular case, }
  786. { however: }
  787. { a) if there is a setter, this code will not be used since then the assignment }
  788. { will be converted to a procedure call }
  789. { b) the getter is irrelevant, because fpc_widestr_assign must always decrease }
  790. { the refcount of the field to which we are writing }
  791. { c) source code changes are not required if a setter is added/removed, because }
  792. { this transformation is handled at compile time }
  793. { -> we can remove the nf_isproperty flag (if any) from left, so that in case it }
  794. { is a property which refers to a field without a setter call, we will not get }
  795. { an error about trying to pass a property as a var parameter }
  796. exclude(left.flags,nf_isproperty);
  797. hp:=ccallparanode.create(ctypeconvnode.create_internal(right,voidpointertype),
  798. ccallparanode.create(ctypeconvnode.create_internal(left,voidpointertype),
  799. nil));
  800. if needrtti then
  801. hp:=ccallparanode.create(
  802. caddrnode.create_internal(
  803. crttinode.create(tstoreddef(left.resultdef),initrtti,rdt_normal)),
  804. hp);
  805. result:=ccallnode.createintern(hs,hp);
  806. firstpass(result);
  807. left:=nil;
  808. right:=nil;
  809. end;
  810. function tassignmentnode.docompare(p: tnode): boolean;
  811. begin
  812. docompare :=
  813. inherited docompare(p) and
  814. (assigntype = tassignmentnode(p).assigntype);
  815. end;
  816. {$ifdef state_tracking}
  817. function Tassignmentnode.track_state_pass(exec_known:boolean):boolean;
  818. var se:Tstate_entry;
  819. begin
  820. track_state_pass:=false;
  821. if exec_known then
  822. begin
  823. track_state_pass:=right.track_state_pass(exec_known);
  824. {Force a new resultdef pass.}
  825. right.resultdef:=nil;
  826. do_typecheckpass(right);
  827. typecheckpass(right);
  828. aktstate.store_fact(left.getcopy,right.getcopy);
  829. end
  830. else
  831. aktstate.delete_fact(left);
  832. end;
  833. {$endif}
  834. {*****************************************************************************
  835. TARRAYCONSTRUCTORRANGENODE
  836. *****************************************************************************}
  837. constructor tarrayconstructorrangenode.create(l,r : tnode);
  838. begin
  839. inherited create(arrayconstructorrangen,l,r);
  840. end;
  841. function tarrayconstructorrangenode.pass_typecheck:tnode;
  842. begin
  843. result:=nil;
  844. typecheckpass(left);
  845. typecheckpass(right);
  846. set_varstate(left,vs_read,[vsf_must_be_valid]);
  847. set_varstate(right,vs_read,[vsf_must_be_valid]);
  848. if codegenerror then
  849. exit;
  850. resultdef:=left.resultdef;
  851. end;
  852. function tarrayconstructorrangenode.pass_1 : tnode;
  853. begin
  854. result:=nil;
  855. CGMessage(parser_e_illegal_expression);
  856. end;
  857. {****************************************************************************
  858. TARRAYCONSTRUCTORNODE
  859. *****************************************************************************}
  860. constructor tarrayconstructornode.create(l,r : tnode);
  861. begin
  862. inherited create(arrayconstructorn,l,r);
  863. end;
  864. function tarrayconstructornode.dogetcopy : tnode;
  865. var
  866. n : tarrayconstructornode;
  867. begin
  868. n:=tarrayconstructornode(inherited dogetcopy);
  869. result:=n;
  870. end;
  871. function tarrayconstructornode.pass_typecheck:tnode;
  872. var
  873. hdef : tdef;
  874. hp : tarrayconstructornode;
  875. len : longint;
  876. varia : boolean;
  877. eq : tequaltype;
  878. hnodetype : tnodetype;
  879. begin
  880. result:=nil;
  881. { are we allowing array constructor? Then convert it to a set.
  882. Do this only if we didn't convert the arrayconstructor yet. This
  883. is needed for the cases where the resultdef is forced for a second
  884. run }
  885. if not(allow_array_constructor) then
  886. begin
  887. hp:=tarrayconstructornode(getcopy);
  888. arrayconstructor_to_set(tnode(hp));
  889. result:=hp;
  890. exit;
  891. end;
  892. { only pass left tree, right tree contains next construct if any }
  893. hdef:=nil;
  894. hnodetype:=errorn;
  895. len:=0;
  896. varia:=false;
  897. if assigned(left) then
  898. begin
  899. hp:=self;
  900. while assigned(hp) do
  901. begin
  902. typecheckpass(hp.left);
  903. set_varstate(hp.left,vs_read,[vsf_must_be_valid]);
  904. if (hdef=nil) then
  905. begin
  906. hdef:=hp.left.resultdef;
  907. hnodetype:=hp.left.nodetype;
  908. end
  909. else
  910. begin
  911. { If we got a niln we don't know the type yet and need to take the
  912. type of the next array element.
  913. This is to handle things like [nil,tclass,tclass], see also tw8371 (PFV) }
  914. if hnodetype=niln then
  915. begin
  916. eq:=compare_defs(hp.left.resultdef,hdef,hnodetype);
  917. if eq>te_incompatible then
  918. begin
  919. hdef:=hp.left.resultdef;
  920. hnodetype:=hp.left.nodetype;
  921. end;
  922. end
  923. else
  924. eq:=compare_defs(hdef,hp.left.resultdef,hp.left.nodetype);
  925. if (not varia) and (eq<te_equal) then
  926. begin
  927. { If both are integers we need to take the type that can hold both
  928. defs }
  929. if is_integer(hdef) and is_integer(hp.left.resultdef) then
  930. begin
  931. if is_in_limit(hdef,hp.left.resultdef) then
  932. hdef:=hp.left.resultdef;
  933. end
  934. else
  935. if (nf_novariaallowed in flags) then
  936. varia:=true;
  937. end;
  938. end;
  939. inc(len);
  940. hp:=tarrayconstructornode(hp.right);
  941. end;
  942. end;
  943. { Set the type of empty or varia arrays to void. Also
  944. do this if the type is array of const/open array
  945. because those can't be used with setelementdef }
  946. if not assigned(hdef) or
  947. varia or
  948. is_array_of_const(hdef) or
  949. is_open_array(hdef) then
  950. hdef:=voidtype;
  951. resultdef:=carraydef.create(0,len-1,s32inttype);
  952. tarraydef(resultdef).elementdef:=hdef;
  953. include(tarraydef(resultdef).arrayoptions,ado_IsConstructor);
  954. if varia then
  955. include(tarraydef(resultdef).arrayoptions,ado_IsVariant);
  956. end;
  957. procedure tarrayconstructornode.force_type(def:tdef);
  958. var
  959. hp : tarrayconstructornode;
  960. begin
  961. tarraydef(resultdef).elementdef:=def;
  962. include(tarraydef(resultdef).arrayoptions,ado_IsConstructor);
  963. exclude(tarraydef(resultdef).arrayoptions,ado_IsVariant);
  964. if assigned(left) then
  965. begin
  966. hp:=self;
  967. while assigned(hp) do
  968. begin
  969. inserttypeconv(hp.left,def);
  970. hp:=tarrayconstructornode(hp.right);
  971. end;
  972. end;
  973. end;
  974. procedure tarrayconstructornode.insert_typeconvs;
  975. var
  976. hp : tarrayconstructornode;
  977. dovariant : boolean;
  978. begin
  979. dovariant:=(nf_forcevaria in flags) or (ado_isvariant in tarraydef(resultdef).arrayoptions);
  980. { only pass left tree, right tree contains next construct if any }
  981. if assigned(left) then
  982. begin
  983. hp:=self;
  984. while assigned(hp) do
  985. begin
  986. typecheckpass(hp.left);
  987. { Insert typeconvs for array of const }
  988. if dovariant then
  989. { at this time C varargs are no longer an arrayconstructornode }
  990. insert_varargstypeconv(hp.left,false);
  991. hp:=tarrayconstructornode(hp.right);
  992. end;
  993. end;
  994. end;
  995. function tarrayconstructornode.pass_1 : tnode;
  996. var
  997. hp : tarrayconstructornode;
  998. do_variant,
  999. do_managed_variant:boolean;
  1000. begin
  1001. do_variant:=(nf_forcevaria in flags) or (ado_isvariant in tarraydef(resultdef).arrayoptions);
  1002. do_managed_variant:=
  1003. do_variant and
  1004. (target_info.system in systems_managed_vm);
  1005. result:=nil;
  1006. { Insert required type convs, this must be
  1007. done in pass 1, because the call must be
  1008. typecheckpassed already }
  1009. if assigned(left) then
  1010. begin
  1011. insert_typeconvs;
  1012. { call firstpass for all nodes }
  1013. hp:=self;
  1014. while assigned(hp) do
  1015. begin
  1016. if hp.left<>nil then
  1017. begin
  1018. {This check is pessimistic; a call will happen depending
  1019. on the location in which the elements will be found in
  1020. pass 2.}
  1021. if not do_variant then
  1022. include(current_procinfo.flags,pi_do_call);
  1023. firstpass(hp.left);
  1024. if do_managed_variant then
  1025. wrapmanagedvarrec(hp.left);
  1026. end;
  1027. hp:=tarrayconstructornode(hp.right);
  1028. end;
  1029. end;
  1030. { set the elementdef to the correct type in case of a variant array }
  1031. if do_variant then
  1032. tarraydef(resultdef).elementdef:=search_system_type('TVARREC').typedef;
  1033. expectloc:=LOC_CREFERENCE;
  1034. end;
  1035. function tarrayconstructornode.docompare(p: tnode): boolean;
  1036. begin
  1037. docompare:=inherited docompare(p);
  1038. end;
  1039. {*****************************************************************************
  1040. TTYPENODE
  1041. *****************************************************************************}
  1042. constructor ttypenode.create(def:tdef);
  1043. begin
  1044. inherited create(typen);
  1045. typedef:=def;
  1046. typesym:=def.typesym;
  1047. allowed:=false;
  1048. helperallowed:=false;
  1049. end;
  1050. constructor ttypenode.ppuload(t:tnodetype;ppufile:tcompilerppufile);
  1051. begin
  1052. inherited ppuload(t,ppufile);
  1053. ppufile.getderef(typedefderef);
  1054. ppufile.getderef(typesymderef);
  1055. allowed:=boolean(ppufile.getbyte);
  1056. helperallowed:=boolean(ppufile.getbyte);
  1057. end;
  1058. procedure ttypenode.ppuwrite(ppufile:tcompilerppufile);
  1059. begin
  1060. inherited ppuwrite(ppufile);
  1061. ppufile.putderef(typedefderef);
  1062. ppufile.putderef(typesymderef);
  1063. ppufile.putbyte(byte(allowed));
  1064. ppufile.putbyte(byte(helperallowed));
  1065. end;
  1066. procedure ttypenode.buildderefimpl;
  1067. begin
  1068. inherited buildderefimpl;
  1069. typedefderef.build(typedef);
  1070. typesymderef.build(typesym);
  1071. end;
  1072. procedure ttypenode.derefimpl;
  1073. begin
  1074. inherited derefimpl;
  1075. typedef:=tdef(typedefderef.resolve);
  1076. typesym:=tsym(typesymderef.resolve);
  1077. end;
  1078. function ttypenode.pass_typecheck:tnode;
  1079. begin
  1080. result:=nil;
  1081. resultdef:=typedef;
  1082. { check if it's valid }
  1083. if typedef.typ = errordef then
  1084. CGMessage(parser_e_illegal_expression);
  1085. end;
  1086. function ttypenode.pass_1 : tnode;
  1087. begin
  1088. result:=nil;
  1089. expectloc:=LOC_VOID;
  1090. { a typenode can't generate code, so we give here
  1091. an error. Else it'll be an abstract error in pass_generate_code.
  1092. Only when the allowed flag is set we don't generate
  1093. an error }
  1094. if not allowed then
  1095. CGMessage(parser_e_no_type_not_allowed_here);
  1096. if not helperallowed and is_objectpascal_helper(typedef) then
  1097. CGMessage(parser_e_no_category_as_types);
  1098. end;
  1099. function ttypenode.dogetcopy : tnode;
  1100. var
  1101. n : ttypenode;
  1102. begin
  1103. n:=ttypenode(inherited dogetcopy);
  1104. n.allowed:=allowed;
  1105. n.typedef:=typedef;
  1106. n.helperallowed:=helperallowed;
  1107. result:=n;
  1108. end;
  1109. function ttypenode.docompare(p: tnode): boolean;
  1110. begin
  1111. docompare :=
  1112. inherited docompare(p) and
  1113. (typedef=ttypenode(p).typedef) and
  1114. (allowed=ttypenode(p).allowed) and
  1115. (helperallowed=ttypenode(p).helperallowed);
  1116. end;
  1117. {*****************************************************************************
  1118. TRTTINODE
  1119. *****************************************************************************}
  1120. constructor trttinode.create(def:tstoreddef;rt:trttitype;dt:Trttidatatype);
  1121. begin
  1122. inherited create(rttin);
  1123. rttidef:=def;
  1124. rttitype:=rt;
  1125. rttidatatype:=dt;
  1126. end;
  1127. constructor trttinode.ppuload(t:tnodetype;ppufile:tcompilerppufile);
  1128. begin
  1129. inherited ppuload(t,ppufile);
  1130. ppufile.getderef(rttidefderef);
  1131. rttitype:=trttitype(ppufile.getbyte);
  1132. rttidatatype:=trttidatatype(ppufile.getbyte);
  1133. end;
  1134. procedure trttinode.ppuwrite(ppufile:tcompilerppufile);
  1135. begin
  1136. inherited ppuwrite(ppufile);
  1137. ppufile.putderef(rttidefderef);
  1138. ppufile.putbyte(byte(rttitype));
  1139. ppufile.putbyte(byte(rttidatatype));
  1140. end;
  1141. procedure trttinode.buildderefimpl;
  1142. begin
  1143. inherited buildderefimpl;
  1144. rttidefderef.build(rttidef);
  1145. end;
  1146. procedure trttinode.derefimpl;
  1147. begin
  1148. inherited derefimpl;
  1149. rttidef:=tstoreddef(rttidefderef.resolve);
  1150. end;
  1151. function trttinode.dogetcopy : tnode;
  1152. var
  1153. n : trttinode;
  1154. begin
  1155. n:=trttinode(inherited dogetcopy);
  1156. n.rttidef:=rttidef;
  1157. n.rttitype:=rttitype;
  1158. n.rttidatatype:=rttidatatype;
  1159. result:=n;
  1160. end;
  1161. function trttinode.pass_typecheck:tnode;
  1162. begin
  1163. { rtti information will be returned as a void pointer }
  1164. result:=nil;
  1165. resultdef:=voidpointertype;
  1166. end;
  1167. function trttinode.pass_1 : tnode;
  1168. begin
  1169. result:=nil;
  1170. expectloc:=LOC_CREFERENCE;
  1171. if (cs_create_pic in current_settings.moduleswitches) and
  1172. (tf_pic_uses_got in target_info.flags) then
  1173. include(current_procinfo.flags,pi_needs_got);
  1174. end;
  1175. function trttinode.docompare(p: tnode): boolean;
  1176. begin
  1177. docompare :=
  1178. inherited docompare(p) and
  1179. (rttidef = trttinode(p).rttidef) and
  1180. (rttitype = trttinode(p).rttitype) and
  1181. (rttidatatype = trttinode(p).rttidatatype);
  1182. end;
  1183. end.