nld.pas 51 KB

12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364656667686970717273747576777879808182838485868788899091929394959697989910010110210310410510610710810911011111211311411511611711811912012112212312412512612712812913013113213313413513613713813914014114214314414514614714814915015115215315415515615715815916016116216316416516616716816917017117217317417517617717817918018118218318418518618718818919019119219319419519619719819920020120220320420520620720820921021121221321421521621721821922022122222322422522622722822923023123223323423523623723823924024124224324424524624724824925025125225325425525625725825926026126226326426526626726826927027127227327427527627727827928028128228328428528628728828929029129229329429529629729829930030130230330430530630730830931031131231331431531631731831932032132232332432532632732832933033133233333433533633733833934034134234334434534634734834935035135235335435535635735835936036136236336436536636736836937037137237337437537637737837938038138238338438538638738838939039139239339439539639739839940040140240340440540640740840941041141241341441541641741841942042142242342442542642742842943043143243343443543643743843944044144244344444544644744844945045145245345445545645745845946046146246346446546646746846947047147247347447547647747847948048148248348448548648748848949049149249349449549649749849950050150250350450550650750850951051151251351451551651751851952052152252352452552652752852953053153253353453553653753853954054154254354454554654754854955055155255355455555655755855956056156256356456556656756856957057157257357457557657757857958058158258358458558658758858959059159259359459559659759859960060160260360460560660760860961061161261361461561661761861962062162262362462562662762862963063163263363463563663763863964064164264364464564664764864965065165265365465565665765865966066166266366466566666766866967067167267367467567667767867968068168268368468568668768868969069169269369469569669769869970070170270370470570670770870971071171271371471571671771871972072172272372472572672772872973073173273373473573673773873974074174274374474574674774874975075175275375475575675775875976076176276376476576676776876977077177277377477577677777877978078178278378478578678778878979079179279379479579679779879980080180280380480580680780880981081181281381481581681781881982082182282382482582682782882983083183283383483583683783883984084184284384484584684784884985085185285385485585685785885986086186286386486586686786886987087187287387487587687787887988088188288388488588688788888989089189289389489589689789889990090190290390490590690790890991091191291391491591691791891992092192292392492592692792892993093193293393493593693793893994094194294394494594694794894995095195295395495595695795895996096196296396496596696796896997097197297397497597697797897998098198298398498598698798898999099199299399499599699799899910001001100210031004100510061007100810091010101110121013101410151016101710181019102010211022102310241025102610271028102910301031103210331034103510361037103810391040104110421043104410451046104710481049105010511052105310541055105610571058105910601061106210631064106510661067106810691070107110721073107410751076107710781079108010811082108310841085108610871088108910901091109210931094109510961097109810991100110111021103110411051106110711081109111011111112111311141115111611171118111911201121112211231124112511261127112811291130113111321133113411351136113711381139114011411142114311441145114611471148114911501151115211531154115511561157115811591160116111621163116411651166116711681169117011711172117311741175117611771178117911801181118211831184118511861187118811891190119111921193119411951196119711981199120012011202120312041205120612071208120912101211121212131214121512161217121812191220122112221223122412251226122712281229123012311232123312341235123612371238123912401241124212431244124512461247124812491250125112521253125412551256125712581259126012611262126312641265126612671268126912701271127212731274127512761277127812791280128112821283128412851286128712881289129012911292129312941295129612971298129913001301130213031304130513061307130813091310131113121313131413151316131713181319132013211322132313241325132613271328132913301331133213331334133513361337133813391340134113421343134413451346134713481349135013511352135313541355135613571358135913601361136213631364136513661367136813691370137113721373137413751376137713781379138013811382138313841385138613871388138913901391139213931394139513961397139813991400140114021403140414051406140714081409141014111412141314141415141614171418
  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. var
  481. newinlinenodetype : byte;
  482. begin
  483. result:=nil;
  484. { assignment nodes can perform several floating point }
  485. { type conversions directly, so no typeconversions }
  486. { are inserted in those cases. When inlining, a }
  487. { variable may be replaced by a constant which can be }
  488. { converted at compile time, so check for this case }
  489. if is_real(left.resultdef) and
  490. is_real(right.resultdef) and
  491. is_constrealnode(right) and
  492. not equal_defs(right.resultdef,left.resultdef) then
  493. inserttypeconv(right,left.resultdef);
  494. if cs_opt_level2 in current_settings.optimizerswitches then
  495. begin
  496. { replace i:=succ/pred(i) by inc/dec(i)? }
  497. if (right.nodetype=inlinen) and
  498. ((tinlinenode(right).inlinenumber=in_succ_x) or (tinlinenode(right).inlinenumber=in_pred_x)) and
  499. (tinlinenode(right).left.isequal(left)) and
  500. ((localswitches*[cs_check_overflow,cs_check_range])=[]) and
  501. ((right.localswitches*[cs_check_overflow,cs_check_range])=[]) and
  502. valid_for_var(tinlinenode(right).left,false) and
  503. not(might_have_sideeffects(tinlinenode(right).left)) then
  504. begin
  505. if tinlinenode(right).inlinenumber=in_succ_x then
  506. newinlinenodetype:=in_inc_x
  507. else
  508. newinlinenodetype:=in_dec_x;
  509. result:=cinlinenode.createintern(
  510. newinlinenodetype,false,ccallparanode.create(
  511. left,nil));
  512. left:=nil;
  513. exit;
  514. end;
  515. if cs_opt_level3 in current_settings.optimizerswitches then
  516. begin
  517. { replace i:=i+k/i:=i-k by inc/dec(i,k)? }
  518. if (right.nodetype in [addn,subn]) and
  519. (taddnode(right).left.isequal(left)) and
  520. is_integer(taddnode(right).left.resultdef) and
  521. is_integer(taddnode(right).right.resultdef) and
  522. ((localswitches*[cs_check_overflow,cs_check_range])=[]) and
  523. ((right.localswitches*[cs_check_overflow,cs_check_range])=[]) and
  524. valid_for_var(taddnode(right).left,false) and
  525. not(might_have_sideeffects(taddnode(right).left)) then
  526. begin
  527. if right.nodetype=addn then
  528. newinlinenodetype:=in_inc_x
  529. else
  530. newinlinenodetype:=in_dec_x;
  531. result:=cinlinenode.createintern(
  532. newinlinenodetype,false,ccallparanode.create(
  533. left,ccallparanode.create(taddnode(right).right,nil)));
  534. left:=nil;
  535. taddnode(right).right:=nil;
  536. exit;
  537. end;
  538. { replace i:=k+i by inc(i,k)? }
  539. if (right.nodetype=addn) and
  540. (taddnode(right).right.isequal(left)) and
  541. is_integer(taddnode(right).left.resultdef) and
  542. is_integer(taddnode(right).right.resultdef) and
  543. ((localswitches*[cs_check_overflow,cs_check_range])=[]) and
  544. ((right.localswitches*[cs_check_overflow,cs_check_range])=[]) and
  545. valid_for_var(taddnode(right).right,false) and
  546. not(might_have_sideeffects(taddnode(right).right)) then
  547. begin
  548. result:=cinlinenode.createintern(
  549. in_inc_x,false,ccallparanode.create(
  550. left,ccallparanode.create(taddnode(right).left,nil)));
  551. left:=nil;
  552. taddnode(right).left:=nil;
  553. exit;
  554. end;
  555. end;
  556. end;
  557. end;
  558. function tassignmentnode.pass_typecheck:tnode;
  559. var
  560. hp : tnode;
  561. useshelper : boolean;
  562. oldassignmentnode : tassignmentnode;
  563. begin
  564. result:=nil;
  565. resultdef:=voidtype;
  566. { must be made unique }
  567. set_unique(left);
  568. typecheckpass(left);
  569. { PI. This is needed to return correct resultdef of add nodes for ansistrings
  570. rawbytestring return needs to be replaced by left.resultdef }
  571. oldassignmentnode:=aktassignmentnode;
  572. aktassignmentnode:=self;
  573. typecheckpass(right);
  574. aktassignmentnode:=oldassignmentnode;
  575. set_varstate(right,vs_read,[vsf_must_be_valid]);
  576. set_varstate(left,vs_written,[]);
  577. if codegenerror then
  578. exit;
  579. { tp procvar support, when we don't expect a procvar
  580. then we need to call the procvar }
  581. if (left.resultdef.typ<>procvardef) then
  582. maybe_call_procvar(right,true);
  583. { assignments to formaldefs and open arrays aren't allowed }
  584. if is_open_array(left.resultdef) then
  585. CGMessage(type_e_assignment_not_allowed)
  586. else if (left.resultdef.typ=formaldef) then
  587. if not(target_info.system in systems_managed_vm) then
  588. CGMessage(type_e_assignment_not_allowed)
  589. else
  590. begin
  591. { on managed platforms, assigning to formaldefs is allowed (but
  592. typecasting them on the left hand side isn't), but primitive
  593. values need to be boxed first }
  594. if (right.resultdef.typ in [orddef,floatdef]) then
  595. begin
  596. right:=cinlinenode.create(in_box_x,false,ccallparanode.create(right,nil));
  597. typecheckpass(right);
  598. end;
  599. end;
  600. { test if node can be assigned, properties are allowed }
  601. if not(nf_internal in flags) then
  602. if not valid_for_assignment(left,true) then
  603. { errors can in situations that cause the compiler to run out of
  604. memory, such as assigning to an implicit pointer-to-array
  605. converted node (that array is 2^31 or 2^63 bytes large) }
  606. exit;
  607. { assigning nil to a dynamic array clears the array }
  608. if is_dynamic_array(left.resultdef) and
  609. (right.nodetype=niln) then
  610. begin
  611. { remove property flag to avoid errors, see comments for }
  612. { tf_winlikewidestring assignments below }
  613. exclude(left.flags,nf_isproperty);
  614. { generate a setlength node so it can be intercepted by
  615. target-specific code }
  616. result:=cinlinenode.create(in_setlength_x,false,
  617. ccallparanode.create(genintconstnode(0),
  618. ccallparanode.create(left,nil)));
  619. left:=nil;
  620. exit;
  621. end;
  622. { shortstring helpers can do the conversion directly,
  623. so treat them separatly }
  624. if (is_shortstring(left.resultdef)) then
  625. begin
  626. { insert typeconv, except for chars that are handled in
  627. secondpass and except for ansi/wide string that can
  628. be converted immediatly }
  629. if not direct_shortstring_assignment then
  630. inserttypeconv(right,left.resultdef);
  631. if right.resultdef.typ=stringdef then
  632. begin
  633. useshelper:=true;
  634. { convert constant strings to shortstrings. But
  635. skip empty constant strings, that will be handled
  636. in secondpass }
  637. if (right.nodetype=stringconstn) then
  638. begin
  639. { verify if range fits within shortstring }
  640. { just emit a warning, delphi gives an }
  641. { error, only if the type definition of }
  642. { of the string is less < 255 characters }
  643. if not is_open_string(left.resultdef) and
  644. (tstringconstnode(right).len > tstringdef(left.resultdef).len) then
  645. cgmessage(type_w_string_too_long);
  646. inserttypeconv(right,left.resultdef);
  647. if (right.nodetype=stringconstn) and
  648. (tstringconstnode(right).len=0) then
  649. useshelper:=false;
  650. end
  651. else if (tstringdef(right.resultdef).stringtype in [st_unicodestring,st_widestring]) then
  652. Message2(type_w_implicit_string_cast_loss,right.resultdef.typename,left.resultdef.typename);
  653. { rest is done in pass 1 (JM) }
  654. if useshelper then
  655. exit;
  656. end
  657. end
  658. { floating point assignments can also perform the conversion directly }
  659. else if is_real(left.resultdef) and is_real(right.resultdef) and
  660. not is_constrealnode(right)
  661. {$ifdef cpufpemu}
  662. { the emulator can't do this obviously }
  663. and not(current_settings.fputype in [fpu_libgcc,fpu_soft])
  664. {$endif cpufpemu}
  665. {$ifdef x86}
  666. { the assignment node code can't convert a double in an }
  667. { sse register to an extended value in memory more }
  668. { efficiently than a type conversion node, so don't }
  669. { bother implementing support for that }
  670. and (use_vectorfpu(left.resultdef) or not(use_vectorfpu(right.resultdef)))
  671. {$endif}
  672. {$ifdef arm}
  673. { the assignment node code can't convert a single in
  674. an interger register to a double in an mmregister or
  675. vice versa }
  676. and (use_vectorfpu(left.resultdef) and
  677. use_vectorfpu(right.resultdef) and
  678. (tfloatdef(left.resultdef).floattype=tfloatdef(right.resultdef).floattype))
  679. {$endif}
  680. then
  681. begin
  682. if not(nf_internal in flags) then
  683. check_ranges(fileinfo,right,left.resultdef);
  684. end
  685. else
  686. begin
  687. { check if the assignment may cause a range check error }
  688. if not(nf_internal in flags) then
  689. check_ranges(fileinfo,right,left.resultdef);
  690. { beginners might be confused about an error message like
  691. Incompatible types: got "untyped" expected "LongInt"
  692. when trying to assign the result of a procedure, so give
  693. a better error message, see also #19122 }
  694. if (left.resultdef.typ<>procvardef) and
  695. (right.nodetype=calln) and is_void(right.resultdef) then
  696. CGMessage(type_e_procedures_return_no_value)
  697. else if nf_internal in flags then
  698. inserttypeconv_internal(right,left.resultdef)
  699. else
  700. inserttypeconv(right,left.resultdef);
  701. end;
  702. { call helpers for interface }
  703. if is_interfacecom_or_dispinterface(left.resultdef) then
  704. begin
  705. { Normal interface assignments are handled by the generic refcount incr/decr }
  706. if not def_is_related(right.resultdef,left.resultdef) then
  707. begin
  708. { remove property flag to avoid errors, see comments for }
  709. { tf_winlikewidestring assignments below }
  710. exclude(left.flags,nf_isproperty);
  711. hp:=
  712. ccallparanode.create(
  713. cguidconstnode.create(tobjectdef(left.resultdef).iidguid^),
  714. ccallparanode.create(
  715. ctypeconvnode.create_internal(right,voidpointertype),
  716. ccallparanode.create(
  717. ctypeconvnode.create_internal(left,voidpointertype),
  718. nil)));
  719. result:=ccallnode.createintern('fpc_intf_assign_by_iid',hp);
  720. left:=nil;
  721. right:=nil;
  722. exit;
  723. end;
  724. end;
  725. { check if local proc/func is assigned to procvar }
  726. if right.resultdef.typ=procvardef then
  727. test_local_to_procvar(tprocvardef(right.resultdef),left.resultdef);
  728. end;
  729. function tassignmentnode.pass_1 : tnode;
  730. var
  731. hp: tnode;
  732. oldassignmentnode : tassignmentnode;
  733. hdef: tdef;
  734. hs: string;
  735. needrtti: boolean;
  736. begin
  737. result:=nil;
  738. expectloc:=LOC_VOID;
  739. firstpass(left);
  740. { Optimize the reuse of the destination of the assingment in left.
  741. Allow the use of the left inside the tree generated on the right.
  742. This is especially useful for string routines where the destination
  743. is pushed as a parameter. Using the final destination of left directly
  744. save a temp allocation and copy of data (PFV) }
  745. oldassignmentnode:=aktassignmentnode;
  746. aktassignmentnode:=self;
  747. firstpass(right);
  748. aktassignmentnode:=oldassignmentnode;
  749. if nf_assign_done_in_right in flags then
  750. begin
  751. result:=right;
  752. right:=nil;
  753. exit;
  754. end;
  755. if codegenerror then
  756. exit;
  757. { assignment to refcounted variable -> inc/decref }
  758. if is_managed_type(left.resultdef) then
  759. include(current_procinfo.flags,pi_do_call);
  760. needrtti:=false;
  761. if (is_shortstring(left.resultdef)) then
  762. begin
  763. if right.resultdef.typ=stringdef then
  764. begin
  765. if (right.nodetype<>stringconstn) or
  766. (tstringconstnode(right).len<>0) then
  767. begin
  768. { remove property flag to avoid errors, see comments for }
  769. { tf_winlikewidestring assignments below }
  770. exclude(left.flags, nf_isproperty);
  771. hp:=ccallparanode.create
  772. (right,
  773. ccallparanode.create(left,nil));
  774. result:=ccallnode.createintern('fpc_'+tstringdef(right.resultdef).stringtypname+'_to_shortstr',hp);
  775. firstpass(result);
  776. left:=nil;
  777. right:=nil;
  778. end;
  779. end;
  780. exit;
  781. end
  782. { call helpers for composite types containing automated types }
  783. else if is_managed_type(left.resultdef) and
  784. (left.resultdef.typ in [arraydef,objectdef,recorddef]) and
  785. not is_interfacecom_or_dispinterface(left.resultdef) and
  786. not is_dynamic_array(left.resultdef) and
  787. not is_const(left) and
  788. not(target_info.system in systems_garbage_collected_managed_types) then
  789. begin
  790. hp:=ccallparanode.create(caddrnode.create_internal(
  791. crttinode.create(tstoreddef(left.resultdef),initrtti,rdt_normal)),
  792. ccallparanode.create(ctypeconvnode.create_internal(
  793. caddrnode.create_internal(left),voidpointertype),
  794. ccallparanode.create(ctypeconvnode.create_internal(
  795. caddrnode.create_internal(right),voidpointertype),
  796. nil)));
  797. result:=ccallnode.createintern('fpc_copy_proc',hp);
  798. firstpass(result);
  799. left:=nil;
  800. right:=nil;
  801. exit;
  802. end
  803. { call helpers for variant, they can contain non ref. counted types like
  804. vararrays which must be really copied }
  805. else if (left.resultdef.typ=variantdef) and
  806. not(is_const(left)) and
  807. not(target_info.system in systems_garbage_collected_managed_types) then
  808. begin
  809. { remove property flag to avoid errors, see comments for }
  810. { tf_winlikewidestring assignments below }
  811. exclude(left.flags,nf_isproperty);
  812. hdef:=search_system_type('TVARDATA').typedef;
  813. hp:=ccallparanode.create(ctypeconvnode.create_internal(
  814. right,hdef),
  815. ccallparanode.create(ctypeconvnode.create_internal(
  816. left,hdef),
  817. nil));
  818. result:=ccallnode.createintern('fpc_variant_copy',hp);
  819. firstpass(result);
  820. left:=nil;
  821. right:=nil;
  822. exit;
  823. end
  824. else if not(target_info.system in systems_garbage_collected_managed_types) and
  825. not(is_const(left)) then
  826. begin
  827. { call helpers for pointer-sized managed types }
  828. if is_widestring(left.resultdef) then
  829. hs:='fpc_widestr_assign'
  830. else if is_ansistring(left.resultdef) then
  831. hs:='fpc_ansistr_assign'
  832. else if is_unicodestring(left.resultdef) then
  833. hs:='fpc_unicodestr_assign'
  834. else if is_interfacecom_or_dispinterface(left.resultdef) then
  835. hs:='fpc_intf_assign'
  836. else if is_dynamic_array(left.resultdef) then
  837. begin
  838. hs:='fpc_dynarray_assign';
  839. needrtti:=true;
  840. end
  841. else
  842. exit;
  843. end
  844. else
  845. exit;
  846. { The first argument of these procedures is a var parameter. Properties cannot }
  847. { be passed to var or out parameters, because in that case setters/getters are not }
  848. { used. Further, if we would allow it in case there are no getters or setters, you }
  849. { would need source changes in case these are introduced later on, thus defeating }
  850. { part of the transparency advantages of properties. In this particular case, }
  851. { however: }
  852. { a) if there is a setter, this code will not be used since then the assignment }
  853. { will be converted to a procedure call }
  854. { b) the getter is irrelevant, because fpc_widestr_assign must always decrease }
  855. { the refcount of the field to which we are writing }
  856. { c) source code changes are not required if a setter is added/removed, because }
  857. { this transformation is handled at compile time }
  858. { -> we can remove the nf_isproperty flag (if any) from left, so that in case it }
  859. { is a property which refers to a field without a setter call, we will not get }
  860. { an error about trying to pass a property as a var parameter }
  861. exclude(left.flags,nf_isproperty);
  862. hp:=ccallparanode.create(ctypeconvnode.create_internal(right,voidpointertype),
  863. ccallparanode.create(ctypeconvnode.create_internal(left,voidpointertype),
  864. nil));
  865. if needrtti then
  866. hp:=ccallparanode.create(
  867. caddrnode.create_internal(
  868. crttinode.create(tstoreddef(left.resultdef),initrtti,rdt_normal)),
  869. hp);
  870. result:=ccallnode.createintern(hs,hp);
  871. firstpass(result);
  872. left:=nil;
  873. right:=nil;
  874. end;
  875. function tassignmentnode.docompare(p: tnode): boolean;
  876. begin
  877. docompare :=
  878. inherited docompare(p) and
  879. (assigntype = tassignmentnode(p).assigntype);
  880. end;
  881. {$ifdef state_tracking}
  882. function Tassignmentnode.track_state_pass(exec_known:boolean):boolean;
  883. var se:Tstate_entry;
  884. begin
  885. track_state_pass:=false;
  886. if exec_known then
  887. begin
  888. track_state_pass:=right.track_state_pass(exec_known);
  889. {Force a new resultdef pass.}
  890. right.resultdef:=nil;
  891. do_typecheckpass(right);
  892. typecheckpass(right);
  893. aktstate.store_fact(left.getcopy,right.getcopy);
  894. end
  895. else
  896. aktstate.delete_fact(left);
  897. end;
  898. {$endif}
  899. {*****************************************************************************
  900. TARRAYCONSTRUCTORRANGENODE
  901. *****************************************************************************}
  902. constructor tarrayconstructorrangenode.create(l,r : tnode);
  903. begin
  904. inherited create(arrayconstructorrangen,l,r);
  905. end;
  906. function tarrayconstructorrangenode.pass_typecheck:tnode;
  907. begin
  908. result:=nil;
  909. typecheckpass(left);
  910. typecheckpass(right);
  911. set_varstate(left,vs_read,[vsf_must_be_valid]);
  912. set_varstate(right,vs_read,[vsf_must_be_valid]);
  913. if codegenerror then
  914. exit;
  915. resultdef:=left.resultdef;
  916. end;
  917. function tarrayconstructorrangenode.pass_1 : tnode;
  918. begin
  919. result:=nil;
  920. CGMessage(parser_e_illegal_expression);
  921. end;
  922. {****************************************************************************
  923. TARRAYCONSTRUCTORNODE
  924. *****************************************************************************}
  925. constructor tarrayconstructornode.create(l,r : tnode);
  926. begin
  927. inherited create(arrayconstructorn,l,r);
  928. end;
  929. function tarrayconstructornode.dogetcopy : tnode;
  930. var
  931. n : tarrayconstructornode;
  932. begin
  933. n:=tarrayconstructornode(inherited dogetcopy);
  934. result:=n;
  935. end;
  936. function tarrayconstructornode.pass_typecheck:tnode;
  937. var
  938. hdef : tdef;
  939. hp : tarrayconstructornode;
  940. len : longint;
  941. varia : boolean;
  942. eq : tequaltype;
  943. hnodetype : tnodetype;
  944. begin
  945. result:=nil;
  946. { are we allowing array constructor? Then convert it to a set.
  947. Do this only if we didn't convert the arrayconstructor yet. This
  948. is needed for the cases where the resultdef is forced for a second
  949. run }
  950. if not(allow_array_constructor) then
  951. begin
  952. hp:=tarrayconstructornode(getcopy);
  953. arrayconstructor_to_set(tnode(hp));
  954. result:=hp;
  955. exit;
  956. end;
  957. { only pass left tree, right tree contains next construct if any }
  958. hdef:=nil;
  959. hnodetype:=errorn;
  960. len:=0;
  961. varia:=false;
  962. if assigned(left) then
  963. begin
  964. hp:=self;
  965. while assigned(hp) do
  966. begin
  967. typecheckpass(hp.left);
  968. set_varstate(hp.left,vs_read,[vsf_must_be_valid]);
  969. if (hdef=nil) then
  970. begin
  971. hdef:=hp.left.resultdef;
  972. hnodetype:=hp.left.nodetype;
  973. end
  974. else
  975. begin
  976. { If we got a niln we don't know the type yet and need to take the
  977. type of the next array element.
  978. This is to handle things like [nil,tclass,tclass], see also tw8371 (PFV) }
  979. if hnodetype=niln then
  980. begin
  981. eq:=compare_defs(hp.left.resultdef,hdef,hnodetype);
  982. if eq>te_incompatible then
  983. begin
  984. hdef:=hp.left.resultdef;
  985. hnodetype:=hp.left.nodetype;
  986. end;
  987. end
  988. else
  989. eq:=compare_defs(hdef,hp.left.resultdef,hp.left.nodetype);
  990. if (not varia) and (eq<te_equal) then
  991. begin
  992. { If both are integers we need to take the type that can hold both
  993. defs }
  994. if is_integer(hdef) and is_integer(hp.left.resultdef) then
  995. begin
  996. if is_in_limit(hdef,hp.left.resultdef) then
  997. hdef:=hp.left.resultdef;
  998. end
  999. else
  1000. if (nf_novariaallowed in flags) then
  1001. varia:=true;
  1002. end;
  1003. end;
  1004. inc(len);
  1005. hp:=tarrayconstructornode(hp.right);
  1006. end;
  1007. end;
  1008. { Set the type of empty or varia arrays to void. Also
  1009. do this if the type is array of const/open array
  1010. because those can't be used with setelementdef }
  1011. if not assigned(hdef) or
  1012. varia or
  1013. is_array_of_const(hdef) or
  1014. is_open_array(hdef) then
  1015. hdef:=voidtype;
  1016. resultdef:=carraydef.create(0,len-1,s32inttype);
  1017. tarraydef(resultdef).elementdef:=hdef;
  1018. include(tarraydef(resultdef).arrayoptions,ado_IsConstructor);
  1019. if varia then
  1020. include(tarraydef(resultdef).arrayoptions,ado_IsVariant);
  1021. end;
  1022. procedure tarrayconstructornode.force_type(def:tdef);
  1023. var
  1024. hp : tarrayconstructornode;
  1025. begin
  1026. tarraydef(resultdef).elementdef:=def;
  1027. include(tarraydef(resultdef).arrayoptions,ado_IsConstructor);
  1028. exclude(tarraydef(resultdef).arrayoptions,ado_IsVariant);
  1029. if assigned(left) then
  1030. begin
  1031. hp:=self;
  1032. while assigned(hp) do
  1033. begin
  1034. inserttypeconv(hp.left,def);
  1035. hp:=tarrayconstructornode(hp.right);
  1036. end;
  1037. end;
  1038. end;
  1039. procedure tarrayconstructornode.insert_typeconvs;
  1040. var
  1041. hp : tarrayconstructornode;
  1042. dovariant : boolean;
  1043. begin
  1044. dovariant:=(nf_forcevaria in flags) or (ado_isvariant in tarraydef(resultdef).arrayoptions);
  1045. { only pass left tree, right tree contains next construct if any }
  1046. if assigned(left) then
  1047. begin
  1048. hp:=self;
  1049. while assigned(hp) do
  1050. begin
  1051. typecheckpass(hp.left);
  1052. { Insert typeconvs for array of const }
  1053. if dovariant then
  1054. { at this time C varargs are no longer an arrayconstructornode }
  1055. insert_varargstypeconv(hp.left,false);
  1056. hp:=tarrayconstructornode(hp.right);
  1057. end;
  1058. end;
  1059. end;
  1060. function tarrayconstructornode.pass_1 : tnode;
  1061. var
  1062. hp : tarrayconstructornode;
  1063. do_variant,
  1064. do_managed_variant:boolean;
  1065. begin
  1066. do_variant:=(nf_forcevaria in flags) or (ado_isvariant in tarraydef(resultdef).arrayoptions);
  1067. do_managed_variant:=
  1068. do_variant and
  1069. (target_info.system in systems_managed_vm);
  1070. result:=nil;
  1071. { Insert required type convs, this must be
  1072. done in pass 1, because the call must be
  1073. typecheckpassed already }
  1074. if assigned(left) then
  1075. begin
  1076. insert_typeconvs;
  1077. { call firstpass for all nodes }
  1078. hp:=self;
  1079. while assigned(hp) do
  1080. begin
  1081. if hp.left<>nil then
  1082. begin
  1083. {This check is pessimistic; a call will happen depending
  1084. on the location in which the elements will be found in
  1085. pass 2.}
  1086. if not do_variant then
  1087. include(current_procinfo.flags,pi_do_call);
  1088. firstpass(hp.left);
  1089. if do_managed_variant then
  1090. wrapmanagedvarrec(hp.left);
  1091. end;
  1092. hp:=tarrayconstructornode(hp.right);
  1093. end;
  1094. end;
  1095. { set the elementdef to the correct type in case of a variant array }
  1096. if do_variant then
  1097. tarraydef(resultdef).elementdef:=search_system_type('TVARREC').typedef;
  1098. expectloc:=LOC_CREFERENCE;
  1099. end;
  1100. function tarrayconstructornode.docompare(p: tnode): boolean;
  1101. begin
  1102. docompare:=inherited docompare(p);
  1103. end;
  1104. {*****************************************************************************
  1105. TTYPENODE
  1106. *****************************************************************************}
  1107. constructor ttypenode.create(def:tdef);
  1108. begin
  1109. inherited create(typen);
  1110. typedef:=def;
  1111. typesym:=def.typesym;
  1112. allowed:=false;
  1113. helperallowed:=false;
  1114. end;
  1115. constructor ttypenode.ppuload(t:tnodetype;ppufile:tcompilerppufile);
  1116. begin
  1117. inherited ppuload(t,ppufile);
  1118. ppufile.getderef(typedefderef);
  1119. ppufile.getderef(typesymderef);
  1120. allowed:=boolean(ppufile.getbyte);
  1121. helperallowed:=boolean(ppufile.getbyte);
  1122. end;
  1123. procedure ttypenode.ppuwrite(ppufile:tcompilerppufile);
  1124. begin
  1125. inherited ppuwrite(ppufile);
  1126. ppufile.putderef(typedefderef);
  1127. ppufile.putderef(typesymderef);
  1128. ppufile.putbyte(byte(allowed));
  1129. ppufile.putbyte(byte(helperallowed));
  1130. end;
  1131. procedure ttypenode.buildderefimpl;
  1132. begin
  1133. inherited buildderefimpl;
  1134. typedefderef.build(typedef);
  1135. typesymderef.build(typesym);
  1136. end;
  1137. procedure ttypenode.derefimpl;
  1138. begin
  1139. inherited derefimpl;
  1140. typedef:=tdef(typedefderef.resolve);
  1141. typesym:=tsym(typesymderef.resolve);
  1142. end;
  1143. function ttypenode.pass_typecheck:tnode;
  1144. begin
  1145. result:=nil;
  1146. resultdef:=typedef;
  1147. { check if it's valid }
  1148. if typedef.typ = errordef then
  1149. CGMessage(parser_e_illegal_expression);
  1150. end;
  1151. function ttypenode.pass_1 : tnode;
  1152. begin
  1153. result:=nil;
  1154. expectloc:=LOC_VOID;
  1155. { a typenode can't generate code, so we give here
  1156. an error. Else it'll be an abstract error in pass_generate_code.
  1157. Only when the allowed flag is set we don't generate
  1158. an error }
  1159. if not allowed then
  1160. CGMessage(parser_e_no_type_not_allowed_here);
  1161. if not helperallowed and is_objectpascal_helper(typedef) then
  1162. CGMessage(parser_e_no_category_as_types);
  1163. end;
  1164. function ttypenode.dogetcopy : tnode;
  1165. var
  1166. n : ttypenode;
  1167. begin
  1168. n:=ttypenode(inherited dogetcopy);
  1169. n.allowed:=allowed;
  1170. n.typedef:=typedef;
  1171. n.helperallowed:=helperallowed;
  1172. result:=n;
  1173. end;
  1174. function ttypenode.docompare(p: tnode): boolean;
  1175. begin
  1176. docompare :=
  1177. inherited docompare(p) and
  1178. (typedef=ttypenode(p).typedef) and
  1179. (allowed=ttypenode(p).allowed) and
  1180. (helperallowed=ttypenode(p).helperallowed);
  1181. end;
  1182. {*****************************************************************************
  1183. TRTTINODE
  1184. *****************************************************************************}
  1185. constructor trttinode.create(def:tstoreddef;rt:trttitype;dt:Trttidatatype);
  1186. begin
  1187. inherited create(rttin);
  1188. rttidef:=def;
  1189. rttitype:=rt;
  1190. rttidatatype:=dt;
  1191. end;
  1192. constructor trttinode.ppuload(t:tnodetype;ppufile:tcompilerppufile);
  1193. begin
  1194. inherited ppuload(t,ppufile);
  1195. ppufile.getderef(rttidefderef);
  1196. rttitype:=trttitype(ppufile.getbyte);
  1197. rttidatatype:=trttidatatype(ppufile.getbyte);
  1198. end;
  1199. procedure trttinode.ppuwrite(ppufile:tcompilerppufile);
  1200. begin
  1201. inherited ppuwrite(ppufile);
  1202. ppufile.putderef(rttidefderef);
  1203. ppufile.putbyte(byte(rttitype));
  1204. ppufile.putbyte(byte(rttidatatype));
  1205. end;
  1206. procedure trttinode.buildderefimpl;
  1207. begin
  1208. inherited buildderefimpl;
  1209. rttidefderef.build(rttidef);
  1210. end;
  1211. procedure trttinode.derefimpl;
  1212. begin
  1213. inherited derefimpl;
  1214. rttidef:=tstoreddef(rttidefderef.resolve);
  1215. end;
  1216. function trttinode.dogetcopy : tnode;
  1217. var
  1218. n : trttinode;
  1219. begin
  1220. n:=trttinode(inherited dogetcopy);
  1221. n.rttidef:=rttidef;
  1222. n.rttitype:=rttitype;
  1223. n.rttidatatype:=rttidatatype;
  1224. result:=n;
  1225. end;
  1226. function trttinode.pass_typecheck:tnode;
  1227. begin
  1228. { rtti information will be returned as a void pointer }
  1229. result:=nil;
  1230. resultdef:=voidpointertype;
  1231. end;
  1232. function trttinode.pass_1 : tnode;
  1233. begin
  1234. result:=nil;
  1235. expectloc:=LOC_CREFERENCE;
  1236. if (cs_create_pic in current_settings.moduleswitches) and
  1237. (tf_pic_uses_got in target_info.flags) then
  1238. include(current_procinfo.flags,pi_needs_got);
  1239. end;
  1240. function trttinode.docompare(p: tnode): boolean;
  1241. begin
  1242. docompare :=
  1243. inherited docompare(p) and
  1244. (rttidef = trttinode(p).rttidef) and
  1245. (rttitype = trttinode(p).rttitype) and
  1246. (rttidatatype = trttinode(p).rttidatatype);
  1247. end;
  1248. end.