nld.pas 39 KB

12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364656667686970717273747576777879808182838485868788899091929394959697989910010110210310410510610710810911011111211311411511611711811912012112212312412512612712812913013113213313413513613713813914014114214314414514614714814915015115215315415515615715815916016116216316416516616716816917017117217317417517617717817918018118218318418518618718818919019119219319419519619719819920020120220320420520620720820921021121221321421521621721821922022122222322422522622722822923023123223323423523623723823924024124224324424524624724824925025125225325425525625725825926026126226326426526626726826927027127227327427527627727827928028128228328428528628728828929029129229329429529629729829930030130230330430530630730830931031131231331431531631731831932032132232332432532632732832933033133233333433533633733833934034134234334434534634734834935035135235335435535635735835936036136236336436536636736836937037137237337437537637737837938038138238338438538638738838939039139239339439539639739839940040140240340440540640740840941041141241341441541641741841942042142242342442542642742842943043143243343443543643743843944044144244344444544644744844945045145245345445545645745845946046146246346446546646746846947047147247347447547647747847948048148248348448548648748848949049149249349449549649749849950050150250350450550650750850951051151251351451551651751851952052152252352452552652752852953053153253353453553653753853954054154254354454554654754854955055155255355455555655755855956056156256356456556656756856957057157257357457557657757857958058158258358458558658758858959059159259359459559659759859960060160260360460560660760860961061161261361461561661761861962062162262362462562662762862963063163263363463563663763863964064164264364464564664764864965065165265365465565665765865966066166266366466566666766866967067167267367467567667767867968068168268368468568668768868969069169269369469569669769869970070170270370470570670770870971071171271371471571671771871972072172272372472572672772872973073173273373473573673773873974074174274374474574674774874975075175275375475575675775875976076176276376476576676776876977077177277377477577677777877978078178278378478578678778878979079179279379479579679779879980080180280380480580680780880981081181281381481581681781881982082182282382482582682782882983083183283383483583683783883984084184284384484584684784884985085185285385485585685785885986086186286386486586686786886987087187287387487587687787887988088188288388488588688788888989089189289389489589689789889990090190290390490590690790890991091191291391491591691791891992092192292392492592692792892993093193293393493593693793893994094194294394494594694794894995095195295395495595695795895996096196296396496596696796896997097197297397497597697797897998098198298398498598698798898999099199299399499599699799899910001001100210031004100510061007100810091010101110121013101410151016101710181019102010211022102310241025102610271028102910301031103210331034103510361037103810391040104110421043104410451046104710481049105010511052105310541055105610571058105910601061106210631064106510661067106810691070107110721073107410751076107710781079108010811082108310841085108610871088108910901091109210931094109510961097109810991100110111021103110411051106110711081109111011111112111311141115111611171118111911201121112211231124112511261127112811291130
  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. tloadnode = class(tunarynode)
  29. protected
  30. procdef : tprocdef;
  31. procdefderef : tderef;
  32. public
  33. symtableentry : tsym;
  34. symtableentryderef : tderef;
  35. symtable : TSymtable;
  36. constructor create(v : tsym;st : TSymtable);virtual;
  37. constructor create_procvar(v : tsym;d:tprocdef;st : TSymtable);virtual;
  38. constructor ppuload(t:tnodetype;ppufile:tcompilerppufile);override;
  39. procedure ppuwrite(ppufile:tcompilerppufile);override;
  40. procedure buildderefimpl;override;
  41. procedure derefimpl;override;
  42. procedure set_mp(p:tnode);
  43. function is_addr_param_load:boolean;
  44. function dogetcopy : tnode;override;
  45. function pass_1 : tnode;override;
  46. function pass_typecheck:tnode;override;
  47. procedure mark_write;override;
  48. function docompare(p: tnode): boolean; override;
  49. procedure printnodedata(var t:text);override;
  50. procedure setprocdef(p : tprocdef);
  51. end;
  52. tloadnodeclass = class of tloadnode;
  53. { different assignment types }
  54. tassigntype = (at_normal,at_plus,at_minus,at_star,at_slash);
  55. tassignmentnode = class(tbinarynode)
  56. assigntype : tassigntype;
  57. constructor create(l,r : tnode);virtual;
  58. constructor ppuload(t:tnodetype;ppufile:tcompilerppufile);override;
  59. procedure ppuwrite(ppufile:tcompilerppufile);override;
  60. function dogetcopy : tnode;override;
  61. function pass_1 : tnode;override;
  62. function pass_typecheck:tnode;override;
  63. {$ifdef state_tracking}
  64. function track_state_pass(exec_known:boolean):boolean;override;
  65. {$endif state_tracking}
  66. function docompare(p: tnode): boolean; override;
  67. end;
  68. tassignmentnodeclass = class of tassignmentnode;
  69. tarrayconstructorrangenode = class(tbinarynode)
  70. constructor create(l,r : tnode);virtual;
  71. function pass_1 : tnode;override;
  72. function pass_typecheck:tnode;override;
  73. end;
  74. tarrayconstructorrangenodeclass = class of tarrayconstructorrangenode;
  75. tarrayconstructornode = class(tbinarynode)
  76. constructor create(l,r : tnode);virtual;
  77. function dogetcopy : tnode;override;
  78. function pass_1 : tnode;override;
  79. function pass_typecheck:tnode;override;
  80. function docompare(p: tnode): boolean; override;
  81. procedure force_type(def:tdef);
  82. procedure insert_typeconvs;
  83. end;
  84. tarrayconstructornodeclass = class of tarrayconstructornode;
  85. ttypenode = class(tnode)
  86. allowed : boolean;
  87. typedef : tdef;
  88. typedefderef : tderef;
  89. constructor create(def:tdef);virtual;
  90. constructor ppuload(t:tnodetype;ppufile:tcompilerppufile);override;
  91. procedure ppuwrite(ppufile:tcompilerppufile);override;
  92. procedure buildderefimpl;override;
  93. procedure derefimpl;override;
  94. function pass_1 : tnode;override;
  95. function pass_typecheck:tnode;override;
  96. function dogetcopy : tnode;override;
  97. function docompare(p: tnode): boolean; override;
  98. end;
  99. ttypenodeclass = class of ttypenode;
  100. trttinode = class(tnode)
  101. l1,l2 : longint;
  102. rttitype : trttitype;
  103. rttidef : tstoreddef;
  104. rttidefderef : tderef;
  105. rttidatatype : Trttidatatype;
  106. constructor create(def:tstoreddef;rt:trttitype;dt:Trttidatatype);virtual;
  107. constructor ppuload(t:tnodetype;ppufile:tcompilerppufile);override;
  108. procedure ppuwrite(ppufile:tcompilerppufile);override;
  109. procedure buildderefimpl;override;
  110. procedure derefimpl;override;
  111. function dogetcopy : tnode;override;
  112. function pass_1 : tnode;override;
  113. function pass_typecheck:tnode;override;
  114. function docompare(p: tnode): boolean; override;
  115. end;
  116. trttinodeclass = class of trttinode;
  117. var
  118. cloadnode : tloadnodeclass;
  119. cassignmentnode : tassignmentnodeclass;
  120. carrayconstructorrangenode : tarrayconstructorrangenodeclass;
  121. carrayconstructornode : tarrayconstructornodeclass;
  122. ctypenode : ttypenodeclass;
  123. crttinode : trttinodeclass;
  124. { Current assignment node }
  125. aktassignmentnode : tassignmentnode;
  126. implementation
  127. uses
  128. cutils,verbose,globtype,globals,systems,
  129. symnot,
  130. defutil,defcmp,
  131. htypechk,pass_1,procinfo,paramgr,
  132. ncon,ninl,ncnv,nmem,ncal,nutils,nbas,
  133. cgobj,cgbase
  134. ;
  135. {*****************************************************************************
  136. TLOADNODE
  137. *****************************************************************************}
  138. constructor tloadnode.create(v : tsym;st : TSymtable);
  139. begin
  140. inherited create(loadn,nil);
  141. if not assigned(v) then
  142. internalerror(200108121);
  143. symtableentry:=v;
  144. symtable:=st;
  145. procdef:=nil;
  146. end;
  147. constructor tloadnode.create_procvar(v : tsym;d:tprocdef;st : TSymtable);
  148. begin
  149. inherited create(loadn,nil);
  150. if not assigned(v) then
  151. internalerror(200108121);
  152. symtableentry:=v;
  153. symtable:=st;
  154. procdef:=d;
  155. end;
  156. constructor tloadnode.ppuload(t:tnodetype;ppufile:tcompilerppufile);
  157. begin
  158. inherited ppuload(t,ppufile);
  159. ppufile.getderef(symtableentryderef);
  160. symtable:=nil;
  161. ppufile.getderef(procdefderef);
  162. end;
  163. procedure tloadnode.ppuwrite(ppufile:tcompilerppufile);
  164. begin
  165. inherited ppuwrite(ppufile);
  166. ppufile.putderef(symtableentryderef);
  167. ppufile.putderef(procdefderef);
  168. end;
  169. procedure tloadnode.buildderefimpl;
  170. begin
  171. inherited buildderefimpl;
  172. symtableentryderef.build(symtableentry);
  173. procdefderef.build(procdef);
  174. end;
  175. procedure tloadnode.derefimpl;
  176. begin
  177. inherited derefimpl;
  178. symtableentry:=tsym(symtableentryderef.resolve);
  179. symtable:=symtableentry.owner;
  180. procdef:=tprocdef(procdefderef.resolve);
  181. end;
  182. procedure tloadnode.set_mp(p:tnode);
  183. begin
  184. { typen nodes should not be set }
  185. if p.nodetype=typen then
  186. internalerror(200301042);
  187. left:=p;
  188. end;
  189. function tloadnode.dogetcopy : tnode;
  190. var
  191. n : tloadnode;
  192. begin
  193. n:=tloadnode(inherited dogetcopy);
  194. n.symtable:=symtable;
  195. n.symtableentry:=symtableentry;
  196. n.procdef:=procdef;
  197. result:=n;
  198. end;
  199. function tloadnode.is_addr_param_load:boolean;
  200. begin
  201. result:=(symtable.symtabletype=parasymtable) and
  202. (symtableentry.typ=paravarsym) and
  203. not(vo_has_local_copy in tparavarsym(symtableentry).varoptions) and
  204. not(nf_load_self_pointer in flags) and
  205. paramanager.push_addr_param(tparavarsym(symtableentry).varspez,tparavarsym(symtableentry).vardef,tprocdef(symtable.defowner).proccalloption);
  206. end;
  207. function tloadnode.pass_typecheck:tnode;
  208. begin
  209. result:=nil;
  210. case symtableentry.typ of
  211. absolutevarsym :
  212. resultdef:=tabsolutevarsym(symtableentry).vardef;
  213. constsym:
  214. begin
  215. if tconstsym(symtableentry).consttyp=constresourcestring then
  216. resultdef:=cansistringtype
  217. else
  218. internalerror(22799);
  219. end;
  220. staticvarsym :
  221. begin
  222. tabstractvarsym(symtableentry).IncRefCountBy(1);
  223. { static variables referenced in procedures or from finalization,
  224. variable needs to be in memory.
  225. It is too hard and the benefit is too small to detect whether a
  226. variable is only used in the finalization to add support for it (PFV) }
  227. if assigned(current_procinfo) and
  228. (symtable.symtabletype=staticsymtable) and
  229. (
  230. (symtable.symtablelevel<>current_procinfo.procdef.localst.symtablelevel) or
  231. (current_procinfo.procdef.proctypeoption=potype_unitfinalize)
  232. ) then
  233. make_not_regable(self,[ra_addr_taken]);
  234. resultdef:=tabstractvarsym(symtableentry).vardef;
  235. end;
  236. paravarsym,
  237. localvarsym :
  238. begin
  239. tabstractvarsym(symtableentry).IncRefCountBy(1);
  240. { Nested variable? The we need to load the framepointer of
  241. the parent procedure }
  242. if assigned(current_procinfo) and
  243. (symtable.symtabletype in [localsymtable,parasymtable]) and
  244. (symtable.symtablelevel<>current_procinfo.procdef.parast.symtablelevel) then
  245. begin
  246. if assigned(left) then
  247. internalerror(200309289);
  248. left:=cloadparentfpnode.create(tprocdef(symtable.defowner));
  249. { we can't inline the referenced parent procedure }
  250. exclude(tprocdef(symtable.defowner).procoptions,po_inline);
  251. { reference in nested procedures, variable needs to be in memory }
  252. { and behaves as if its address escapes its parent block }
  253. make_not_regable(self,[ra_addr_taken]);
  254. end;
  255. { fix self type which is declared as voidpointer in the
  256. definition }
  257. if vo_is_self in tabstractvarsym(symtableentry).varoptions then
  258. begin
  259. resultdef:=tprocdef(symtableentry.owner.defowner)._class;
  260. if (po_classmethod in tprocdef(symtableentry.owner.defowner).procoptions) or
  261. (po_staticmethod in tprocdef(symtableentry.owner.defowner).procoptions) then
  262. resultdef:=tclassrefdef.create(resultdef)
  263. else if is_object(resultdef) and
  264. (nf_load_self_pointer in flags) then
  265. resultdef:=tpointerdef.create(resultdef);
  266. end
  267. else if vo_is_vmt in tabstractvarsym(symtableentry).varoptions then
  268. begin
  269. resultdef:=tprocdef(symtableentry.owner.defowner)._class;
  270. resultdef:=tclassrefdef.create(resultdef);
  271. end
  272. else
  273. resultdef:=tabstractvarsym(symtableentry).vardef;
  274. end;
  275. procsym :
  276. begin
  277. { Return the first procdef. In case of overlaoded
  278. procdefs the matching procdef will be choosen
  279. when the expected procvardef is known, see get_information
  280. in htypechk.pas (PFV) }
  281. if not assigned(procdef) then
  282. procdef:=tprocdef(tprocsym(symtableentry).ProcdefList[0])
  283. else if po_kylixlocal in procdef.procoptions then
  284. CGMessage(type_e_cant_take_address_of_local_subroutine);
  285. { the result is a procdef, addrn and proc_to_procvar
  286. typeconvn need this as resultdef so they know
  287. that the address needs to be returned }
  288. resultdef:=procdef;
  289. { process methodpointer }
  290. if assigned(left) then
  291. typecheckpass(left);
  292. end;
  293. labelsym:
  294. resultdef:=voidtype;
  295. else
  296. internalerror(200104141);
  297. end;
  298. end;
  299. procedure Tloadnode.mark_write;
  300. begin
  301. include(flags,nf_write);
  302. end;
  303. function tloadnode.pass_1 : tnode;
  304. begin
  305. result:=nil;
  306. expectloc:=LOC_REFERENCE;
  307. if (cs_create_pic in current_settings.moduleswitches) and
  308. not(symtableentry.typ in [paravarsym,localvarsym]) then
  309. include(current_procinfo.flags,pi_needs_got);
  310. case symtableentry.typ of
  311. absolutevarsym :
  312. ;
  313. constsym:
  314. begin
  315. if tconstsym(symtableentry).consttyp=constresourcestring then
  316. expectloc:=LOC_CREFERENCE;
  317. end;
  318. staticvarsym,
  319. localvarsym,
  320. paravarsym :
  321. begin
  322. if assigned(left) then
  323. firstpass(left);
  324. if not is_addr_param_load and
  325. tabstractvarsym(symtableentry).is_regvar(is_addr_param_load) then
  326. expectloc:=tvarregable2tcgloc[tabstractvarsym(symtableentry).varregable]
  327. else
  328. if (tabstractvarsym(symtableentry).varspez=vs_const) then
  329. expectloc:=LOC_CREFERENCE;
  330. if (target_info.system=system_powerpc_darwin) and
  331. ([vo_is_dll_var,vo_is_external] * tabstractvarsym(symtableentry).varoptions <> []) then
  332. include(current_procinfo.flags,pi_needs_got);
  333. { call to get address of threadvar }
  334. if (vo_is_thread_var in tabstractvarsym(symtableentry).varoptions) then
  335. include(current_procinfo.flags,pi_do_call);
  336. if nf_write in flags then
  337. Tabstractvarsym(symtableentry).trigger_notifications(vn_onwrite)
  338. else
  339. Tabstractvarsym(symtableentry).trigger_notifications(vn_onread);
  340. end;
  341. procsym :
  342. begin
  343. { method pointer ? }
  344. if assigned(left) then
  345. begin
  346. expectloc:=LOC_CREFERENCE;
  347. firstpass(left);
  348. end;
  349. end;
  350. labelsym :
  351. ;
  352. else
  353. internalerror(200104143);
  354. end;
  355. end;
  356. function tloadnode.docompare(p: tnode): boolean;
  357. begin
  358. docompare :=
  359. inherited docompare(p) and
  360. (symtableentry = tloadnode(p).symtableentry) and
  361. (procdef = tloadnode(p).procdef) and
  362. (symtable = tloadnode(p).symtable);
  363. end;
  364. procedure tloadnode.printnodedata(var t:text);
  365. begin
  366. inherited printnodedata(t);
  367. write(t,printnodeindention,'symbol = ',symtableentry.name);
  368. if symtableentry.typ=procsym then
  369. write(t,printnodeindention,'procdef = ',procdef.mangledname);
  370. writeln(t,'');
  371. end;
  372. procedure tloadnode.setprocdef(p : tprocdef);
  373. begin
  374. procdef:=p;
  375. resultdef:=p;
  376. if po_local in p.procoptions then
  377. CGMessage(type_e_cant_take_address_of_local_subroutine);
  378. end;
  379. {*****************************************************************************
  380. TASSIGNMENTNODE
  381. *****************************************************************************}
  382. constructor tassignmentnode.create(l,r : tnode);
  383. begin
  384. inherited create(assignn,l,r);
  385. l.mark_write;
  386. assigntype:=at_normal;
  387. if r.nodetype = typeconvn then
  388. ttypeconvnode(r).warn_pointer_to_signed:=false;
  389. end;
  390. constructor tassignmentnode.ppuload(t:tnodetype;ppufile:tcompilerppufile);
  391. begin
  392. inherited ppuload(t,ppufile);
  393. assigntype:=tassigntype(ppufile.getbyte);
  394. end;
  395. procedure tassignmentnode.ppuwrite(ppufile:tcompilerppufile);
  396. begin
  397. inherited ppuwrite(ppufile);
  398. ppufile.putbyte(byte(assigntype));
  399. end;
  400. function tassignmentnode.dogetcopy : tnode;
  401. var
  402. n : tassignmentnode;
  403. begin
  404. n:=tassignmentnode(inherited dogetcopy);
  405. n.assigntype:=assigntype;
  406. result:=n;
  407. end;
  408. function tassignmentnode.pass_typecheck:tnode;
  409. var
  410. hp : tnode;
  411. useshelper : boolean;
  412. begin
  413. result:=nil;
  414. resultdef:=voidtype;
  415. { must be made unique }
  416. set_unique(left);
  417. typecheckpass(left);
  418. typecheckpass(right);
  419. set_varstate(right,vs_read,[vsf_must_be_valid]);
  420. set_varstate(left,vs_written,[]);
  421. if codegenerror then
  422. exit;
  423. { tp procvar support, when we don't expect a procvar
  424. then we need to call the procvar }
  425. if (left.resultdef.typ<>procvardef) then
  426. maybe_call_procvar(right,true);
  427. { assignments to formaldefs and open arrays aren't allowed }
  428. if (left.resultdef.typ=formaldef) or
  429. is_open_array(left.resultdef) then
  430. CGMessage(type_e_assignment_not_allowed);
  431. { test if node can be assigned, properties are allowed }
  432. valid_for_assignment(left,true);
  433. { assigning nil to a dynamic array clears the array }
  434. if is_dynamic_array(left.resultdef) and
  435. (right.nodetype=niln) then
  436. begin
  437. { remove property flag to avoid errors, see comments for }
  438. { tf_winlikewidestring assignments below }
  439. exclude(left.flags,nf_isproperty);
  440. hp:=ccallparanode.create(caddrnode.create_internal
  441. (crttinode.create(tstoreddef(left.resultdef),initrtti,rdt_normal)),
  442. ccallparanode.create(ctypeconvnode.create_internal(left,voidpointertype),nil));
  443. result := ccallnode.createintern('fpc_dynarray_clear',hp);
  444. left:=nil;
  445. exit;
  446. end;
  447. { shortstring helpers can do the conversion directly,
  448. so treat them separatly }
  449. if (is_shortstring(left.resultdef)) then
  450. begin
  451. { insert typeconv, except for chars that are handled in
  452. secondpass and except for ansi/wide string that can
  453. be converted immediatly }
  454. if not(is_char(right.resultdef) or
  455. (right.resultdef.typ=stringdef)) then
  456. inserttypeconv(right,left.resultdef);
  457. if right.resultdef.typ=stringdef then
  458. begin
  459. useshelper:=true;
  460. { convert constant strings to shortstrings. But
  461. skip empty constant strings, that will be handled
  462. in secondpass }
  463. if (right.nodetype=stringconstn) then
  464. begin
  465. { verify if range fits within shortstring }
  466. { just emit a warning, delphi gives an }
  467. { error, only if the type definition of }
  468. { of the string is less < 255 characters }
  469. if not is_open_string(left.resultdef) and
  470. (tstringconstnode(right).len > tstringdef(left.resultdef).len) then
  471. cgmessage(type_w_string_too_long);
  472. inserttypeconv(right,left.resultdef);
  473. if (right.nodetype=stringconstn) and
  474. (tstringconstnode(right).len=0) then
  475. useshelper:=false;
  476. end;
  477. { rest is done in pass 1 (JM) }
  478. if useshelper then
  479. exit;
  480. end
  481. end
  482. else
  483. begin
  484. { check if the assignment may cause a range check error }
  485. check_ranges(fileinfo,right,left.resultdef);
  486. inserttypeconv(right,left.resultdef);
  487. end;
  488. { call helpers for interface }
  489. if is_interfacecom(left.resultdef) then
  490. begin
  491. { Normal interface assignments are handled by the generic refcount incr/decr }
  492. if not right.resultdef.is_related(left.resultdef) then
  493. begin
  494. { remove property flag to avoid errors, see comments for }
  495. { tf_winlikewidestring assignments below }
  496. exclude(left.flags,nf_isproperty);
  497. hp:=
  498. ccallparanode.create(
  499. cguidconstnode.create(tobjectdef(left.resultdef).iidguid^),
  500. ccallparanode.create(
  501. ctypeconvnode.create_internal(right,voidpointertype),
  502. ccallparanode.create(
  503. ctypeconvnode.create_internal(left,voidpointertype),
  504. nil)));
  505. result:=ccallnode.createintern('fpc_intf_assign_by_iid',hp);
  506. left:=nil;
  507. right:=nil;
  508. exit;
  509. end;
  510. end;
  511. { check if local proc/func is assigned to procvar }
  512. if right.resultdef.typ=procvardef then
  513. test_local_to_procvar(tprocvardef(right.resultdef),left.resultdef);
  514. end;
  515. function tassignmentnode.pass_1 : tnode;
  516. var
  517. hp: tnode;
  518. oldassignmentnode : tassignmentnode;
  519. begin
  520. result:=nil;
  521. expectloc:=LOC_VOID;
  522. firstpass(left);
  523. { Optimize the reuse of the destination of the assingment in left.
  524. Allow the use of the left inside the tree generated on the right.
  525. This is especially usefull for string routines where the destination
  526. is pushed as a parameter. Using the final destination of left directly
  527. save a temp allocation and copy of data (PFV) }
  528. oldassignmentnode:=aktassignmentnode;
  529. aktassignmentnode:=self;
  530. firstpass(right);
  531. aktassignmentnode:=oldassignmentnode;
  532. if nf_assign_done_in_right in flags then
  533. begin
  534. result:=right;
  535. right:=nil;
  536. exit;
  537. end;
  538. if codegenerror then
  539. exit;
  540. { assignment to refcounted variable -> inc/decref }
  541. if (not is_class(left.resultdef) and
  542. left.resultdef.needs_inittable) then
  543. include(current_procinfo.flags,pi_do_call);
  544. if (is_shortstring(left.resultdef)) then
  545. begin
  546. if right.resultdef.typ=stringdef then
  547. begin
  548. if (right.nodetype<>stringconstn) or
  549. (tstringconstnode(right).len<>0) then
  550. begin
  551. hp:=ccallparanode.create
  552. (right,
  553. ccallparanode.create(left,nil));
  554. result:=ccallnode.createintern('fpc_'+tstringdef(right.resultdef).stringtypname+'_to_shortstr',hp);
  555. firstpass(result);
  556. left:=nil;
  557. right:=nil;
  558. exit;
  559. end;
  560. end;
  561. end
  562. { call helpers for composite types containing automated types }
  563. else if (left.resultdef.needs_inittable) and
  564. (left.resultdef.typ in [arraydef,objectdef,recorddef]) and
  565. not is_interfacecom(left.resultdef) and
  566. not is_dynamic_array(left.resultdef) then
  567. begin
  568. hp:=ccallparanode.create(caddrnode.create_internal(
  569. crttinode.create(tstoreddef(left.resultdef),initrtti,rdt_normal)),
  570. ccallparanode.create(ctypeconvnode.create_internal(
  571. caddrnode.create_internal(left),voidpointertype),
  572. ccallparanode.create(ctypeconvnode.create_internal(
  573. caddrnode.create_internal(right),voidpointertype),
  574. nil)));
  575. result:=ccallnode.createintern('fpc_copy_proc',hp);
  576. firstpass(result);
  577. left:=nil;
  578. right:=nil;
  579. exit;
  580. end
  581. { call helpers for variant, they can contain non ref. counted types like
  582. vararrays which must be really copied }
  583. else if left.resultdef.typ=variantdef then
  584. begin
  585. hp:=ccallparanode.create(ctypeconvnode.create_internal(
  586. caddrnode.create_internal(right),voidpointertype),
  587. ccallparanode.create(ctypeconvnode.create_internal(
  588. caddrnode.create_internal(left),voidpointertype),
  589. nil));
  590. result:=ccallnode.createintern('fpc_variant_copy',hp);
  591. firstpass(result);
  592. left:=nil;
  593. right:=nil;
  594. exit;
  595. end
  596. { call helpers for windows widestrings, they aren't ref. counted }
  597. else if (tf_winlikewidestring in target_info.flags) and is_widestring(left.resultdef) then
  598. begin
  599. { The first argument of fpc_widestr_assign is a var parameter. Properties cannot }
  600. { be passed to var or out parameters, because in that case setters/getters are not }
  601. { used. Further, if we would allow it in case there are no getters or setters, you }
  602. { would need source changes in case these are introduced later on, thus defeating }
  603. { part of the transparency advantages of properties. In this particular case, }
  604. { however: }
  605. { a) if there is a setter, this code will not be used since then the assignment }
  606. { will be converted to a procedure call }
  607. { b) the getter is irrelevant, because fpc_widestr_assign must always decrease }
  608. { the refcount of the field to which we are writing }
  609. { c) source code changes are not required if a setter is added/removed, because }
  610. { this transformation is handled at compile time }
  611. { -> we can remove the nf_isproperty flag (if any) from left, so that in case it }
  612. { is a property which refers to a field without a setter call, we will not get }
  613. { an error about trying to pass a property as a var parameter }
  614. exclude(left.flags,nf_isproperty);
  615. hp:=ccallparanode.create(ctypeconvnode.create_internal(right,voidpointertype),
  616. ccallparanode.create(ctypeconvnode.create_internal(left,voidpointertype),
  617. nil));
  618. result:=ccallnode.createintern('fpc_widestr_assign',hp);
  619. firstpass(result);
  620. left:=nil;
  621. right:=nil;
  622. exit;
  623. end;
  624. end;
  625. function tassignmentnode.docompare(p: tnode): boolean;
  626. begin
  627. docompare :=
  628. inherited docompare(p) and
  629. (assigntype = tassignmentnode(p).assigntype);
  630. end;
  631. {$ifdef state_tracking}
  632. function Tassignmentnode.track_state_pass(exec_known:boolean):boolean;
  633. var se:Tstate_entry;
  634. begin
  635. track_state_pass:=false;
  636. if exec_known then
  637. begin
  638. track_state_pass:=right.track_state_pass(exec_known);
  639. {Force a new resultdef pass.}
  640. right.resultdef:=nil;
  641. do_typecheckpass(right);
  642. typecheckpass(right);
  643. aktstate.store_fact(left.getcopy,right.getcopy);
  644. end
  645. else
  646. aktstate.delete_fact(left);
  647. end;
  648. {$endif}
  649. {*****************************************************************************
  650. TARRAYCONSTRUCTORRANGENODE
  651. *****************************************************************************}
  652. constructor tarrayconstructorrangenode.create(l,r : tnode);
  653. begin
  654. inherited create(arrayconstructorrangen,l,r);
  655. end;
  656. function tarrayconstructorrangenode.pass_typecheck:tnode;
  657. begin
  658. result:=nil;
  659. typecheckpass(left);
  660. typecheckpass(right);
  661. set_varstate(left,vs_read,[vsf_must_be_valid]);
  662. set_varstate(right,vs_read,[vsf_must_be_valid]);
  663. if codegenerror then
  664. exit;
  665. resultdef:=left.resultdef;
  666. end;
  667. function tarrayconstructorrangenode.pass_1 : tnode;
  668. begin
  669. firstpass(left);
  670. firstpass(right);
  671. expectloc:=LOC_CREFERENCE;
  672. result:=nil;
  673. end;
  674. {****************************************************************************
  675. TARRAYCONSTRUCTORNODE
  676. *****************************************************************************}
  677. constructor tarrayconstructornode.create(l,r : tnode);
  678. begin
  679. inherited create(arrayconstructorn,l,r);
  680. end;
  681. function tarrayconstructornode.dogetcopy : tnode;
  682. var
  683. n : tarrayconstructornode;
  684. begin
  685. n:=tarrayconstructornode(inherited dogetcopy);
  686. result:=n;
  687. end;
  688. function tarrayconstructornode.pass_typecheck:tnode;
  689. var
  690. hdef : tdef;
  691. hp : tarrayconstructornode;
  692. len : longint;
  693. varia : boolean;
  694. eq : tequaltype;
  695. hnodetype : tnodetype;
  696. begin
  697. result:=nil;
  698. { are we allowing array constructor? Then convert it to a set.
  699. Do this only if we didn't convert the arrayconstructor yet. This
  700. is needed for the cases where the resultdef is forced for a second
  701. run }
  702. if (not allow_array_constructor) then
  703. begin
  704. hp:=tarrayconstructornode(getcopy);
  705. arrayconstructor_to_set(tnode(hp));
  706. result:=hp;
  707. exit;
  708. end;
  709. { only pass left tree, right tree contains next construct if any }
  710. hdef:=nil;
  711. hnodetype:=errorn;
  712. len:=0;
  713. varia:=false;
  714. if assigned(left) then
  715. begin
  716. hp:=self;
  717. while assigned(hp) do
  718. begin
  719. typecheckpass(hp.left);
  720. set_varstate(hp.left,vs_read,[vsf_must_be_valid]);
  721. if (hdef=nil) then
  722. begin
  723. hdef:=hp.left.resultdef;
  724. hnodetype:=hp.left.nodetype;
  725. end
  726. else
  727. begin
  728. { If we got a niln we don't know the type yet and need to take the
  729. type of the next array element.
  730. This is to handle things like [nil,tclass,tclass], see also tw8371 (PFV) }
  731. if hnodetype=niln then
  732. begin
  733. eq:=compare_defs(hp.left.resultdef,hdef,hnodetype);
  734. if eq>te_incompatible then
  735. begin
  736. hdef:=hp.left.resultdef;
  737. hnodetype:=hp.left.nodetype;
  738. end;
  739. end
  740. else
  741. eq:=compare_defs(hdef,hp.left.resultdef,hp.left.nodetype);
  742. if (not varia) and (eq<te_equal) then
  743. begin
  744. { If both are integers we need to take the type that can hold both
  745. defs }
  746. if is_integer(hdef) and is_integer(hp.left.resultdef) then
  747. begin
  748. if is_in_limit(hdef,hp.left.resultdef) then
  749. hdef:=hp.left.resultdef;
  750. end
  751. else
  752. if (nf_novariaallowed in flags) then
  753. varia:=true;
  754. end;
  755. end;
  756. inc(len);
  757. hp:=tarrayconstructornode(hp.right);
  758. end;
  759. end;
  760. { Set the type of empty or varia arrays to void. Also
  761. do this if the type is array of const/open array
  762. because those can't be used with setelementdef }
  763. if not assigned(hdef) or
  764. varia or
  765. is_array_of_const(hdef) or
  766. is_open_array(hdef) then
  767. hdef:=voidtype;
  768. resultdef:=tarraydef.create(0,len-1,s32inttype);
  769. tarraydef(resultdef).elementdef:=hdef;
  770. include(tarraydef(resultdef).arrayoptions,ado_IsConstructor);
  771. if varia then
  772. include(tarraydef(resultdef).arrayoptions,ado_IsVariant);
  773. end;
  774. procedure tarrayconstructornode.force_type(def:tdef);
  775. var
  776. hp : tarrayconstructornode;
  777. begin
  778. tarraydef(resultdef).elementdef:=def;
  779. include(tarraydef(resultdef).arrayoptions,ado_IsConstructor);
  780. exclude(tarraydef(resultdef).arrayoptions,ado_IsVariant);
  781. if assigned(left) then
  782. begin
  783. hp:=self;
  784. while assigned(hp) do
  785. begin
  786. inserttypeconv(hp.left,def);
  787. hp:=tarrayconstructornode(hp.right);
  788. end;
  789. end;
  790. end;
  791. procedure tarrayconstructornode.insert_typeconvs;
  792. var
  793. hp : tarrayconstructornode;
  794. dovariant : boolean;
  795. begin
  796. dovariant:=(nf_forcevaria in flags) or (ado_isvariant in tarraydef(resultdef).arrayoptions);
  797. { only pass left tree, right tree contains next construct if any }
  798. if assigned(left) then
  799. begin
  800. hp:=self;
  801. while assigned(hp) do
  802. begin
  803. typecheckpass(hp.left);
  804. { Insert typeconvs for array of const }
  805. if dovariant then
  806. { at this time C varargs are no longer an arrayconstructornode }
  807. insert_varargstypeconv(hp.left,false);
  808. hp:=tarrayconstructornode(hp.right);
  809. end;
  810. end;
  811. end;
  812. function tarrayconstructornode.pass_1 : tnode;
  813. var
  814. hp : tarrayconstructornode;
  815. do_variant:boolean;
  816. begin
  817. do_variant:=(nf_forcevaria in flags) or (ado_isvariant in tarraydef(resultdef).arrayoptions);
  818. result:=nil;
  819. { Insert required type convs, this must be
  820. done in pass 1, because the call must be
  821. typecheckpassed already }
  822. if assigned(left) then
  823. begin
  824. insert_typeconvs;
  825. { call firstpass for all nodes }
  826. hp:=self;
  827. while assigned(hp) do
  828. begin
  829. if hp.left<>nil then
  830. begin
  831. {This check is pessimistic; a call will happen depending
  832. on the location in which the elements will be found in
  833. pass 2.}
  834. if not do_variant then
  835. include(current_procinfo.flags,pi_do_call);
  836. firstpass(hp.left);
  837. end;
  838. hp:=tarrayconstructornode(hp.right);
  839. end;
  840. end;
  841. expectloc:=LOC_CREFERENCE;
  842. end;
  843. function tarrayconstructornode.docompare(p: tnode): boolean;
  844. begin
  845. docompare:=inherited docompare(p);
  846. end;
  847. {*****************************************************************************
  848. TTYPENODE
  849. *****************************************************************************}
  850. constructor ttypenode.create(def:tdef);
  851. begin
  852. inherited create(typen);
  853. typedef:=def;
  854. allowed:=false;
  855. end;
  856. constructor ttypenode.ppuload(t:tnodetype;ppufile:tcompilerppufile);
  857. begin
  858. inherited ppuload(t,ppufile);
  859. ppufile.getderef(typedefderef);
  860. allowed:=boolean(ppufile.getbyte);
  861. end;
  862. procedure ttypenode.ppuwrite(ppufile:tcompilerppufile);
  863. begin
  864. inherited ppuwrite(ppufile);
  865. ppufile.putderef(typedefderef);
  866. ppufile.putbyte(byte(allowed));
  867. end;
  868. procedure ttypenode.buildderefimpl;
  869. begin
  870. inherited buildderefimpl;
  871. typedefderef.build(typedef);
  872. end;
  873. procedure ttypenode.derefimpl;
  874. begin
  875. inherited derefimpl;
  876. typedef:=tdef(typedefderef.resolve);
  877. end;
  878. function ttypenode.pass_typecheck:tnode;
  879. begin
  880. result:=nil;
  881. resultdef:=typedef;
  882. { check if it's valid }
  883. if typedef.typ = errordef then
  884. CGMessage(parser_e_illegal_expression);
  885. end;
  886. function ttypenode.pass_1 : tnode;
  887. begin
  888. result:=nil;
  889. expectloc:=LOC_VOID;
  890. { a typenode can't generate code, so we give here
  891. an error. Else it'll be an abstract error in pass_generate_code.
  892. Only when the allowed flag is set we don't generate
  893. an error }
  894. if not allowed then
  895. Message(parser_e_no_type_not_allowed_here);
  896. end;
  897. function ttypenode.dogetcopy : tnode;
  898. var
  899. n : ttypenode;
  900. begin
  901. n:=ttypenode(inherited dogetcopy);
  902. n.allowed:=allowed;
  903. n.typedef:=typedef;
  904. result:=n;
  905. end;
  906. function ttypenode.docompare(p: tnode): boolean;
  907. begin
  908. docompare :=
  909. inherited docompare(p);
  910. end;
  911. {*****************************************************************************
  912. TRTTINODE
  913. *****************************************************************************}
  914. constructor trttinode.create(def:tstoreddef;rt:trttitype;dt:Trttidatatype);
  915. begin
  916. inherited create(rttin);
  917. rttidef:=def;
  918. rttitype:=rt;
  919. rttidatatype:=dt;
  920. end;
  921. constructor trttinode.ppuload(t:tnodetype;ppufile:tcompilerppufile);
  922. begin
  923. inherited ppuload(t,ppufile);
  924. ppufile.getderef(rttidefderef);
  925. rttitype:=trttitype(ppufile.getbyte);
  926. end;
  927. procedure trttinode.ppuwrite(ppufile:tcompilerppufile);
  928. begin
  929. inherited ppuwrite(ppufile);
  930. ppufile.putderef(rttidefderef);
  931. ppufile.putbyte(byte(rttitype));
  932. end;
  933. procedure trttinode.buildderefimpl;
  934. begin
  935. inherited buildderefimpl;
  936. rttidefderef.build(rttidef);
  937. end;
  938. procedure trttinode.derefimpl;
  939. begin
  940. inherited derefimpl;
  941. rttidef:=tstoreddef(rttidefderef.resolve);
  942. end;
  943. function trttinode.dogetcopy : tnode;
  944. var
  945. n : trttinode;
  946. begin
  947. n:=trttinode(inherited dogetcopy);
  948. n.rttidef:=rttidef;
  949. n.rttitype:=rttitype;
  950. result:=n;
  951. end;
  952. function trttinode.pass_typecheck:tnode;
  953. begin
  954. { rtti information will be returned as a void pointer }
  955. result:=nil;
  956. resultdef:=voidpointertype;
  957. end;
  958. function trttinode.pass_1 : tnode;
  959. begin
  960. result:=nil;
  961. expectloc:=LOC_CREFERENCE;
  962. end;
  963. function trttinode.docompare(p: tnode): boolean;
  964. begin
  965. docompare :=
  966. inherited docompare(p) and
  967. (rttidef = trttinode(p).rttidef) and
  968. (rttitype = trttinode(p).rttitype);
  969. end;
  970. begin
  971. cloadnode:=tloadnode;
  972. cassignmentnode:=tassignmentnode;
  973. carrayconstructorrangenode:=tarrayconstructorrangenode;
  974. carrayconstructornode:=tarrayconstructornode;
  975. ctypenode:=ttypenode;
  976. crttinode:=trttinode;
  977. end.