nld.pas 42 KB

1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768697071727374757677787980818283848586878889909192939495969798991001011021031041051061071081091101111121131141151161171181191201211221231241251261271281291301311321331341351361371381391401411421431441451461471481491501511521531541551561571581591601611621631641651661671681691701711721731741751761771781791801811821831841851861871881891901911921931941951961971981992002012022032042052062072082092102112122132142152162172182192202212222232242252262272282292302312322332342352362372382392402412422432442452462472482492502512522532542552562572582592602612622632642652662672682692702712722732742752762772782792802812822832842852862872882892902912922932942952962972982993003013023033043053063073083093103113123133143153163173183193203213223233243253263273283293303313323333343353363373383393403413423433443453463473483493503513523533543553563573583593603613623633643653663673683693703713723733743753763773783793803813823833843853863873883893903913923933943953963973983994004014024034044054064074084094104114124134144154164174184194204214224234244254264274284294304314324334344354364374384394404414424434444454464474484494504514524534544554564574584594604614624634644654664674684694704714724734744754764774784794804814824834844854864874884894904914924934944954964974984995005015025035045055065075085095105115125135145155165175185195205215225235245255265275285295305315325335345355365375385395405415425435445455465475485495505515525535545555565575585595605615625635645655665675685695705715725735745755765775785795805815825835845855865875885895905915925935945955965975985996006016026036046056066076086096106116126136146156166176186196206216226236246256266276286296306316326336346356366376386396406416426436446456466476486496506516526536546556566576586596606616626636646656666676686696706716726736746756766776786796806816826836846856866876886896906916926936946956966976986997007017027037047057067077087097107117127137147157167177187197207217227237247257267277287297307317327337347357367377387397407417427437447457467477487497507517527537547557567577587597607617627637647657667677687697707717727737747757767777787797807817827837847857867877887897907917927937947957967977987998008018028038048058068078088098108118128138148158168178188198208218228238248258268278288298308318328338348358368378388398408418428438448458468478488498508518528538548558568578588598608618628638648658668678688698708718728738748758768778788798808818828838848858868878888898908918928938948958968978988999009019029039049059069079089099109119129139149159169179189199209219229239249259269279289299309319329339349359369379389399409419429439449459469479489499509519529539549559569579589599609619629639649659669679689699709719729739749759769779789799809819829839849859869879889899909919929939949959969979989991000100110021003100410051006100710081009101010111012101310141015101610171018101910201021102210231024102510261027102810291030103110321033103410351036103710381039104010411042104310441045104610471048104910501051105210531054105510561057105810591060106110621063106410651066106710681069107010711072107310741075107610771078107910801081108210831084108510861087108810891090109110921093109410951096109710981099110011011102110311041105110611071108110911101111111211131114111511161117111811191120112111221123112411251126112711281129113011311132113311341135113611371138113911401141114211431144114511461147114811491150115111521153115411551156115711581159116011611162116311641165116611671168116911701171117211731174117511761177117811791180118111821183118411851186118711881189119011911192119311941195119611971198119912001201120212031204120512061207120812091210121112121213121412151216121712181219122012211222122312241225
  1. {
  2. $Id$
  3. Copyright (c) 2000-2002 by Florian Klaempfl
  4. Type checking and register allocation for load/assignment nodes
  5. This program is free software; you can redistribute it and/or modify
  6. it under the terms of the GNU General Public License as published by
  7. the Free Software Foundation; either version 2 of the License, or
  8. (at your option) any later version.
  9. This program is distributed in the hope that it will be useful,
  10. but WITHOUT ANY WARRANTY; without even the implied warranty of
  11. MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
  12. GNU General Public License for more details.
  13. You should have received a copy of the GNU General Public License
  14. along with this program; if not, write to the Free Software
  15. Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
  16. ****************************************************************************
  17. }
  18. unit nld;
  19. {$i fpcdefs.inc}
  20. interface
  21. uses
  22. node,
  23. {$ifdef state_tracking}
  24. nstate,
  25. {$endif}
  26. symconst,symbase,symtype,symsym,symdef;
  27. type
  28. tloadnode = class(tunarynode)
  29. symtableentry : tsym;
  30. symtableentryderef : tderef;
  31. symtable : tsymtable;
  32. procdef : tprocdef;
  33. procdefderef : tderef;
  34. constructor create(v : tsym;st : tsymtable);virtual;
  35. constructor create_procvar(v : tsym;d:tprocdef;st : tsymtable);virtual;
  36. constructor ppuload(t:tnodetype;ppufile:tcompilerppufile);override;
  37. procedure ppuwrite(ppufile:tcompilerppufile);override;
  38. procedure buildderefimpl;override;
  39. procedure derefimpl;override;
  40. procedure set_mp(p:tnode);
  41. function is_addr_param_load:boolean;
  42. function getcopy : tnode;override;
  43. function pass_1 : tnode;override;
  44. function det_resulttype:tnode;override;
  45. procedure mark_write;override;
  46. function docompare(p: tnode): boolean; override;
  47. procedure printnodedata(var t:text);override;
  48. end;
  49. tloadnodeclass = class of tloadnode;
  50. { different assignment types }
  51. tassigntype = (at_normal,at_plus,at_minus,at_star,at_slash);
  52. tassignmentnode = class(tbinarynode)
  53. assigntype : tassigntype;
  54. constructor create(l,r : tnode);virtual;
  55. constructor ppuload(t:tnodetype;ppufile:tcompilerppufile);override;
  56. procedure ppuwrite(ppufile:tcompilerppufile);override;
  57. function getcopy : tnode;override;
  58. function pass_1 : tnode;override;
  59. function det_resulttype:tnode;override;
  60. {$ifdef state_tracking}
  61. function track_state_pass(exec_known:boolean):boolean;override;
  62. {$endif state_tracking}
  63. function docompare(p: tnode): boolean; override;
  64. end;
  65. tassignmentnodeclass = class of tassignmentnode;
  66. tarrayconstructorrangenode = class(tbinarynode)
  67. constructor create(l,r : tnode);virtual;
  68. function pass_1 : tnode;override;
  69. function det_resulttype:tnode;override;
  70. end;
  71. tarrayconstructorrangenodeclass = class of tarrayconstructorrangenode;
  72. tarrayconstructornode = class(tbinarynode)
  73. constructor create(l,r : tnode);virtual;
  74. function getcopy : tnode;override;
  75. function pass_1 : tnode;override;
  76. function det_resulttype:tnode;override;
  77. function docompare(p: tnode): boolean; override;
  78. procedure force_type(tt:ttype);
  79. procedure insert_typeconvs;
  80. end;
  81. tarrayconstructornodeclass = class of tarrayconstructornode;
  82. ttypenode = class(tnode)
  83. allowed : boolean;
  84. restype : ttype;
  85. constructor create(t : ttype);virtual;
  86. constructor ppuload(t:tnodetype;ppufile:tcompilerppufile);override;
  87. procedure ppuwrite(ppufile:tcompilerppufile);override;
  88. procedure buildderefimpl;override;
  89. procedure derefimpl;override;
  90. function pass_1 : tnode;override;
  91. function det_resulttype:tnode;override;
  92. function docompare(p: tnode): boolean; override;
  93. end;
  94. ttypenodeclass = class of ttypenode;
  95. trttinode = class(tnode)
  96. l1,l2 : longint;
  97. rttitype : trttitype;
  98. rttidef : tstoreddef;
  99. rttidefderef : tderef;
  100. constructor create(def:tstoreddef;rt:trttitype);virtual;
  101. constructor ppuload(t:tnodetype;ppufile:tcompilerppufile);override;
  102. procedure ppuwrite(ppufile:tcompilerppufile);override;
  103. procedure buildderefimpl;override;
  104. procedure derefimpl;override;
  105. function getcopy : tnode;override;
  106. function pass_1 : tnode;override;
  107. function det_resulttype:tnode;override;
  108. function docompare(p: tnode): boolean; override;
  109. end;
  110. trttinodeclass = class of trttinode;
  111. var
  112. cloadnode : tloadnodeclass;
  113. cassignmentnode : tassignmentnodeclass;
  114. carrayconstructorrangenode : tarrayconstructorrangenodeclass;
  115. carrayconstructornode : tarrayconstructornodeclass;
  116. ctypenode : ttypenodeclass;
  117. crttinode : trttinodeclass;
  118. implementation
  119. uses
  120. cutils,verbose,globtype,globals,systems,
  121. symnot,
  122. defutil,defcmp,
  123. htypechk,pass_1,procinfo,paramgr,
  124. ncon,ninl,ncnv,nmem,ncal,nutils,
  125. cgobj,cgbase
  126. ;
  127. {*****************************************************************************
  128. TLOADNODE
  129. *****************************************************************************}
  130. constructor tloadnode.create(v : tsym;st : tsymtable);
  131. begin
  132. inherited create(loadn,nil);
  133. if not assigned(v) then
  134. internalerror(200108121);
  135. symtableentry:=v;
  136. symtable:=st;
  137. procdef:=nil;
  138. end;
  139. constructor tloadnode.create_procvar(v : tsym;d:tprocdef;st : tsymtable);
  140. begin
  141. inherited create(loadn,nil);
  142. if not assigned(v) then
  143. internalerror(200108121);
  144. symtableentry:=v;
  145. symtable:=st;
  146. procdef:=d;
  147. end;
  148. constructor tloadnode.ppuload(t:tnodetype;ppufile:tcompilerppufile);
  149. begin
  150. inherited ppuload(t,ppufile);
  151. ppufile.getderef(symtableentryderef);
  152. symtable:=nil;
  153. ppufile.getderef(procdefderef);
  154. end;
  155. procedure tloadnode.ppuwrite(ppufile:tcompilerppufile);
  156. begin
  157. inherited ppuwrite(ppufile);
  158. ppufile.putderef(symtableentryderef);
  159. ppufile.putderef(procdefderef);
  160. end;
  161. procedure tloadnode.buildderefimpl;
  162. begin
  163. inherited buildderefimpl;
  164. symtableentryderef.build(symtableentry);
  165. procdefderef.build(procdef);
  166. end;
  167. procedure tloadnode.derefimpl;
  168. begin
  169. inherited derefimpl;
  170. symtableentry:=tsym(symtableentryderef.resolve);
  171. symtable:=symtableentry.owner;
  172. procdef:=tprocdef(procdefderef.resolve);
  173. end;
  174. procedure tloadnode.set_mp(p:tnode);
  175. begin
  176. { typen nodes should not be set }
  177. if p.nodetype=typen then
  178. internalerror(200301042);
  179. left:=p;
  180. end;
  181. function tloadnode.getcopy : tnode;
  182. var
  183. n : tloadnode;
  184. begin
  185. n:=tloadnode(inherited getcopy);
  186. n.symtable:=symtable;
  187. n.symtableentry:=symtableentry;
  188. n.procdef:=procdef;
  189. result:=n;
  190. end;
  191. function tloadnode.is_addr_param_load:boolean;
  192. begin
  193. result:=(symtable.symtabletype=parasymtable) and
  194. (symtableentry.typ=paravarsym) and
  195. not(vo_has_local_copy in tparavarsym(symtableentry).varoptions) and
  196. not(nf_load_self_pointer in flags) and
  197. paramanager.push_addr_param(tparavarsym(symtableentry).varspez,tparavarsym(symtableentry).vartype.def,tprocdef(symtable.defowner).proccalloption);
  198. end;
  199. function tloadnode.det_resulttype:tnode;
  200. begin
  201. result:=nil;
  202. case symtableentry.typ of
  203. absolutevarsym :
  204. resulttype:=tabsolutevarsym(symtableentry).vartype;
  205. constsym:
  206. begin
  207. if tconstsym(symtableentry).consttyp=constresourcestring then
  208. begin
  209. {$ifdef ansistring_bits}
  210. case aktansistring_bits of
  211. sb_16:
  212. resulttype:=cansistringtype16;
  213. sb_32:
  214. resulttype:=cansistringtype32;
  215. sb_64:
  216. resulttype:=cansistringtype64;
  217. end;
  218. {$else}
  219. resulttype:=cansistringtype
  220. {$endif}
  221. end
  222. else
  223. internalerror(22799);
  224. end;
  225. globalvarsym,
  226. paravarsym,
  227. localvarsym :
  228. begin
  229. inc(tabstractvarsym(symtableentry).refs);
  230. { Nested variable? The we need to load the framepointer of
  231. the parent procedure }
  232. if assigned(current_procinfo) then
  233. begin
  234. if (symtable.symtabletype in [localsymtable,parasymtable]) and
  235. (symtable.symtablelevel<>current_procinfo.procdef.parast.symtablelevel) then
  236. begin
  237. if assigned(left) then
  238. internalerror(200309289);
  239. left:=cloadparentfpnode.create(tprocdef(symtable.defowner));
  240. { reference in nested procedures, variable needs to be in memory }
  241. make_not_regable(self);
  242. end;
  243. { static variables referenced in procedures or from finalization,
  244. variable needs to be in memory.
  245. It is too hard and the benefit is too small to detect whether a
  246. variable is only used in the finalization to add support for it (PFV) }
  247. if (symtable.symtabletype=staticsymtable) and
  248. (
  249. (symtable.symtablelevel<>current_procinfo.procdef.localst.symtablelevel) or
  250. (current_procinfo.procdef.proctypeoption=potype_unitfinalize)
  251. ) then
  252. make_not_regable(self);
  253. end;
  254. { fix self type which is declared as voidpointer in the
  255. definition }
  256. if vo_is_self in tabstractvarsym(symtableentry).varoptions then
  257. begin
  258. resulttype.setdef(tprocdef(symtableentry.owner.defowner)._class);
  259. if (po_classmethod in tprocdef(symtableentry.owner.defowner).procoptions) or
  260. (po_staticmethod in tprocdef(symtableentry.owner.defowner).procoptions) then
  261. resulttype.setdef(tclassrefdef.create(resulttype))
  262. else if is_object(resulttype.def) and
  263. (nf_load_self_pointer in flags) then
  264. resulttype.setdef(tpointerdef.create(resulttype));
  265. end
  266. else if vo_is_vmt in tabstractvarsym(symtableentry).varoptions then
  267. begin
  268. resulttype.setdef(tprocdef(symtableentry.owner.defowner)._class);
  269. resulttype.setdef(tclassrefdef.create(resulttype));
  270. end
  271. else
  272. resulttype:=tabstractvarsym(symtableentry).vartype;
  273. end;
  274. typedconstsym :
  275. resulttype:=ttypedconstsym(symtableentry).typedconsttype;
  276. procsym :
  277. begin
  278. if not assigned(procdef) then
  279. begin
  280. if Tprocsym(symtableentry).procdef_count>1 then
  281. CGMessage(parser_e_no_overloaded_procvars);
  282. procdef:=tprocsym(symtableentry).first_procdef;
  283. end;
  284. { the result is a procdef, addrn and proc_to_procvar
  285. typeconvn need this as resulttype so they know
  286. that the address needs to be returned }
  287. resulttype.setdef(procdef);
  288. { process methodpointer }
  289. if assigned(left) then
  290. resulttypepass(left);
  291. end;
  292. labelsym:
  293. resulttype:=voidtype;
  294. else
  295. internalerror(200104141);
  296. end;
  297. end;
  298. procedure Tloadnode.mark_write;
  299. begin
  300. include(flags,nf_write);
  301. end;
  302. function tloadnode.pass_1 : tnode;
  303. begin
  304. result:=nil;
  305. expectloc:=LOC_REFERENCE;
  306. registersint:=0;
  307. registersfpu:=0;
  308. {$ifdef SUPPORT_MMX}
  309. registersmmx:=0;
  310. {$endif SUPPORT_MMX}
  311. if (cs_create_pic in aktmoduleswitches) and
  312. not(symtableentry.typ in [paravarsym,localvarsym]) then
  313. include(current_procinfo.flags,pi_needs_got);
  314. case symtableentry.typ of
  315. absolutevarsym :
  316. ;
  317. constsym:
  318. begin
  319. if tconstsym(symtableentry).consttyp=constresourcestring then
  320. expectloc:=LOC_CREFERENCE;
  321. end;
  322. globalvarsym,
  323. localvarsym,
  324. paravarsym :
  325. begin
  326. if assigned(left) then
  327. firstpass(left);
  328. if not is_addr_param_load and
  329. tabstractvarsym(symtableentry).is_regvar then
  330. begin
  331. case tabstractvarsym(symtableentry).varregable of
  332. vr_intreg :
  333. expectloc:=LOC_CREGISTER;
  334. vr_fpureg :
  335. expectloc:=LOC_CFPUREGISTER;
  336. vr_mmreg :
  337. expectloc:=LOC_CMMREGISTER;
  338. end
  339. end
  340. else
  341. if (tabstractvarsym(symtableentry).varspez=vs_const) then
  342. expectloc:=LOC_CREFERENCE;
  343. { we need a register for call by reference parameters }
  344. if paramanager.push_addr_param(tabstractvarsym(symtableentry).varspez,tabstractvarsym(symtableentry).vartype.def,pocall_default) then
  345. registersint:=1;
  346. if ([vo_is_thread_var,vo_is_dll_var]*tabstractvarsym(symtableentry).varoptions)<>[] then
  347. registersint:=1;
  348. if (target_info.system=system_powerpc_darwin) and (vo_is_dll_var in tabstractvarsym(symtableentry).varoptions) then
  349. include(current_procinfo.flags,pi_needs_got);
  350. { call to get address of threadvar }
  351. if (vo_is_thread_var in tabstractvarsym(symtableentry).varoptions) then
  352. include(current_procinfo.flags,pi_do_call);
  353. if nf_write in flags then
  354. Tabstractvarsym(symtableentry).trigger_notifications(vn_onwrite)
  355. else
  356. Tabstractvarsym(symtableentry).trigger_notifications(vn_onread);
  357. { count variable references }
  358. if cg.t_times>1 then
  359. inc(tabstractvarsym(symtableentry).refs,cg.t_times-1);
  360. end;
  361. typedconstsym :
  362. ;
  363. procsym :
  364. begin
  365. { method pointer ? }
  366. if assigned(left) then
  367. begin
  368. expectloc:=LOC_CREFERENCE;
  369. firstpass(left);
  370. registersint:=max(registersint,left.registersint);
  371. registersfpu:=max(registersfpu,left.registersfpu);
  372. {$ifdef SUPPORT_MMX}
  373. registersmmx:=max(registersmmx,left.registersmmx);
  374. {$endif SUPPORT_MMX}
  375. end;
  376. end;
  377. labelsym :
  378. ;
  379. else
  380. internalerror(200104143);
  381. end;
  382. end;
  383. function tloadnode.docompare(p: tnode): boolean;
  384. begin
  385. docompare :=
  386. inherited docompare(p) and
  387. (symtableentry = tloadnode(p).symtableentry) and
  388. (procdef = tloadnode(p).procdef) and
  389. (symtable = tloadnode(p).symtable);
  390. end;
  391. procedure Tloadnode.printnodedata(var t:text);
  392. begin
  393. inherited printnodedata(t);
  394. write(t,printnodeindention,'symbol = ',symtableentry.name);
  395. if symtableentry.typ=procsym then
  396. write(t,printnodeindention,'procdef = ',procdef.mangledname);
  397. writeln(t,'');
  398. end;
  399. {*****************************************************************************
  400. TASSIGNMENTNODE
  401. *****************************************************************************}
  402. constructor tassignmentnode.create(l,r : tnode);
  403. begin
  404. inherited create(assignn,l,r);
  405. l.mark_write;
  406. assigntype:=at_normal;
  407. end;
  408. constructor tassignmentnode.ppuload(t:tnodetype;ppufile:tcompilerppufile);
  409. begin
  410. inherited ppuload(t,ppufile);
  411. assigntype:=tassigntype(ppufile.getbyte);
  412. end;
  413. procedure tassignmentnode.ppuwrite(ppufile:tcompilerppufile);
  414. begin
  415. inherited ppuwrite(ppufile);
  416. ppufile.putbyte(byte(assigntype));
  417. end;
  418. function tassignmentnode.getcopy : tnode;
  419. var
  420. n : tassignmentnode;
  421. begin
  422. n:=tassignmentnode(inherited getcopy);
  423. n.assigntype:=assigntype;
  424. getcopy:=n;
  425. end;
  426. function tassignmentnode.det_resulttype:tnode;
  427. var
  428. hp : tnode;
  429. useshelper : boolean;
  430. original_size : longint;
  431. begin
  432. result:=nil;
  433. resulttype:=voidtype;
  434. original_size := 0;
  435. { must be made unique }
  436. set_unique(left);
  437. resulttypepass(left);
  438. if is_ansistring(left.resulttype.def) then
  439. begin
  440. { fold <ansistring>:=<ansistring>+<char|shortstring|ansistring> }
  441. if (right.nodetype=addn) and
  442. left.isequal(tbinarynode(right).left) and
  443. { don't fold multiple concatenations else we could get trouble
  444. with multiple uses of s
  445. }
  446. (tbinarynode(right).left.nodetype<>addn) and
  447. (tbinarynode(right).right.nodetype<>addn) then
  448. begin
  449. { don't do a resulttypepass(right), since then the addnode }
  450. { may insert typeconversions that make this optimization }
  451. { opportunity quite difficult to detect (JM) }
  452. resulttypepass(tbinarynode(right).left);
  453. resulttypepass(tbinarynode(right).right);
  454. if (is_char(tbinarynode(right).right.resulttype.def) or
  455. is_shortstring(tbinarynode(right).right.resulttype.def) or
  456. is_ansistring(tbinarynode(right).right.resulttype.def)) then
  457. begin
  458. { remove property flag so it'll not trigger an error }
  459. exclude(left.flags,nf_isproperty);
  460. { generate call to helper }
  461. hp:=ccallparanode.create(tbinarynode(right).right,
  462. ccallparanode.create(left,nil));
  463. if is_char(tbinarynode(right).right.resulttype.def) then
  464. result:=ccallnode.createintern('fpc_'+Tstringdef(left.resulttype.def).stringtypname+'_append_char',hp)
  465. else if is_shortstring(tbinarynode(right).right.resulttype.def) then
  466. result:=ccallnode.createintern('fpc_'+Tstringdef(left.resulttype.def).stringtypname+'_append_shortstring',hp)
  467. else
  468. result:=ccallnode.createintern('fpc_'+Tstringdef(left.resulttype.def).stringtypname+'_append_ansistring',hp);
  469. tbinarynode(right).right:=nil;
  470. left:=nil;
  471. exit;
  472. end;
  473. end;
  474. end
  475. else
  476. if is_shortstring(left.resulttype.def) then
  477. begin
  478. { fold <shortstring>:=<shortstring>+<shortstring>,
  479. <shortstring>+<char> is handled by an optimized node }
  480. if (right.nodetype=addn) and
  481. left.isequal(tbinarynode(right).left) and
  482. { don't fold multiple concatenations else we could get trouble
  483. with multiple uses of s }
  484. (tbinarynode(right).left.nodetype<>addn) and
  485. (tbinarynode(right).right.nodetype<>addn) then
  486. begin
  487. { don't do a resulttypepass(right), since then the addnode }
  488. { may insert typeconversions that make this optimization }
  489. { opportunity quite difficult to detect (JM) }
  490. resulttypepass(tbinarynode(right).left);
  491. resulttypepass(tbinarynode(right).right);
  492. if is_shortstring(tbinarynode(right).right.resulttype.def) then
  493. begin
  494. { remove property flag so it'll not trigger an error }
  495. exclude(left.flags,nf_isproperty);
  496. { generate call to helper }
  497. hp:=ccallparanode.create(tbinarynode(right).right,
  498. ccallparanode.create(left,nil));
  499. if is_shortstring(tbinarynode(right).right.resulttype.def) then
  500. result:=ccallnode.createintern('fpc_shortstr_append_shortstr',hp);
  501. tbinarynode(right).right:=nil;
  502. left:=nil;
  503. exit;
  504. end;
  505. end;
  506. end;
  507. resulttypepass(right);
  508. set_varstate(left,vs_assigned,[]);
  509. set_varstate(right,vs_used,[vsf_must_be_valid]);
  510. if codegenerror then
  511. exit;
  512. { tp procvar support, when we don't expect a procvar
  513. then we need to call the procvar }
  514. if (left.resulttype.def.deftype<>procvardef) then
  515. maybe_call_procvar(right,true);
  516. { assignments to formaldefs and open arrays aren't allowed }
  517. if (left.resulttype.def.deftype=formaldef) or
  518. is_open_array(left.resulttype.def) then
  519. CGMessage(type_e_operator_not_allowed);
  520. { test if node can be assigned, properties are allowed }
  521. valid_for_assignment(left);
  522. { assigning nil to a dynamic array clears the array }
  523. if is_dynamic_array(left.resulttype.def) and
  524. (right.nodetype=niln) then
  525. begin
  526. hp:=ccallparanode.create(caddrnode.create_internal
  527. (crttinode.create(tstoreddef(left.resulttype.def),initrtti)),
  528. ccallparanode.create(ctypeconvnode.create_internal(left,voidpointertype),nil));
  529. result := ccallnode.createintern('fpc_dynarray_clear',hp);
  530. left:=nil;
  531. exit;
  532. end;
  533. { shortstring helpers can do the conversion directly,
  534. so treat them separatly }
  535. if (is_shortstring(left.resulttype.def)) then
  536. begin
  537. { insert typeconv, except for chars that are handled in
  538. secondpass and except for ansi/wide string that can
  539. be converted immediatly }
  540. if not(is_char(right.resulttype.def) or
  541. (right.resulttype.def.deftype=stringdef)) then
  542. inserttypeconv(right,left.resulttype);
  543. if right.resulttype.def.deftype=stringdef then
  544. begin
  545. useshelper:=true;
  546. { convert constant strings to shortstrings. But
  547. skip empty constant strings, that will be handled
  548. in secondpass }
  549. if (right.nodetype=stringconstn) then
  550. begin
  551. { verify if range fits within shortstring }
  552. { just emit a warning, delphi gives an }
  553. { error, only if the type definition of }
  554. { of the string is less < 255 characters }
  555. if not is_open_string(left.resulttype.def) and
  556. (tstringconstnode(right).len > tstringdef(left.resulttype.def).len) then
  557. cgmessage(type_w_string_too_long);
  558. inserttypeconv(right,left.resulttype);
  559. if (tstringconstnode(right).len=0) then
  560. useshelper:=false;
  561. end;
  562. { rest is done in pass 1 (JM) }
  563. if useshelper then
  564. exit;
  565. end
  566. end
  567. else
  568. begin
  569. { get the size before the type conversion - check for all nodes }
  570. if assigned(right.resulttype.def) and
  571. (right.resulttype.def.deftype in [enumdef,orddef,floatdef]) and
  572. (right.nodetype in [loadn,vecn,calln]) then
  573. original_size := right.resulttype.def.size;
  574. inserttypeconv(right,left.resulttype);
  575. end;
  576. { check if the assignment may cause a range check error }
  577. { if its not explicit, and only if the values are }
  578. { ordinals, enumdef and floatdef }
  579. if (right.nodetype = typeconvn) and
  580. not (nf_explicit in ttypeconvnode(right).flags) then
  581. begin
  582. if assigned(left.resulttype.def) and
  583. (left.resulttype.def.deftype in [enumdef,orddef,floatdef]) and
  584. not is_boolean(left.resulttype.def) then
  585. begin
  586. if (original_size <> 0) and
  587. (left.resulttype.def.size < original_size) then
  588. begin
  589. if (cs_check_range in aktlocalswitches) then
  590. Message(type_w_smaller_possible_range_check)
  591. else
  592. Message(type_h_smaller_possible_range_check);
  593. end;
  594. end;
  595. end;
  596. { call helpers for interface }
  597. if is_interfacecom(left.resulttype.def) then
  598. begin
  599. hp:=ccallparanode.create(ctypeconvnode.create_internal
  600. (right,voidpointertype),
  601. ccallparanode.create(ctypeconvnode.create_internal
  602. (left,voidpointertype),nil));
  603. result:=ccallnode.createintern('fpc_intf_assign',hp);
  604. left:=nil;
  605. right:=nil;
  606. exit;
  607. end;
  608. { call helpers for variant, they can contain non ref. counted types like
  609. vararrays which must be really copied }
  610. if left.resulttype.def.deftype=variantdef then
  611. begin
  612. hp:=ccallparanode.create(ctypeconvnode.create_internal(
  613. caddrnode.create_internal(right),voidpointertype),
  614. ccallparanode.create(ctypeconvnode.create_internal(
  615. caddrnode.create_internal(left),voidpointertype),
  616. nil));
  617. result:=ccallnode.createintern('fpc_variant_copy',hp);
  618. left:=nil;
  619. right:=nil;
  620. exit;
  621. end;
  622. { check if local proc/func is assigned to procvar }
  623. if right.resulttype.def.deftype=procvardef then
  624. test_local_to_procvar(tprocvardef(right.resulttype.def),left.resulttype.def);
  625. end;
  626. function tassignmentnode.pass_1 : tnode;
  627. var
  628. hp: tnode;
  629. begin
  630. result:=nil;
  631. expectloc:=LOC_VOID;
  632. firstpass(left);
  633. firstpass(right);
  634. { assignment to refcounted variable -> inc/decref }
  635. if (not is_class(left.resulttype.def) and
  636. left.resulttype.def.needs_inittable) then
  637. include(current_procinfo.flags,pi_do_call);
  638. if codegenerror then
  639. exit;
  640. if (is_shortstring(left.resulttype.def)) then
  641. begin
  642. if right.resulttype.def.deftype=stringdef then
  643. begin
  644. if (right.nodetype<>stringconstn) or
  645. (tstringconstnode(right).len<>0) then
  646. begin
  647. if (cs_optimize in aktglobalswitches) and
  648. (right.nodetype in [calln,blockn]) and
  649. (left.nodetype = temprefn) and
  650. is_shortstring(right.resulttype.def) and
  651. not is_open_string(left.resulttype.def) and
  652. (tstringdef(left.resulttype.def).len = 255) then
  653. begin
  654. { the blocknode case is handled in pass_2 at the temp }
  655. { reference level (mainly for callparatemp) (JM) }
  656. if (right.nodetype = calln) then
  657. begin
  658. tcallnode(right).funcretnode := left;
  659. result := right;
  660. end
  661. else
  662. exit;
  663. end
  664. else
  665. begin
  666. hp:=ccallparanode.create
  667. (right,
  668. ccallparanode.create(cinlinenode.create
  669. (in_high_x,false,left.getcopy),nil));
  670. result:=ccallnode.createinternreturn('fpc_'+tstringdef(right.resulttype.def).stringtypname+'_to_shortstr',hp,left);
  671. firstpass(result);
  672. end;
  673. left:=nil;
  674. right:=nil;
  675. exit;
  676. end;
  677. end;
  678. end;
  679. if (cs_optimize in aktglobalswitches) and
  680. (right.nodetype = calln) and
  681. { left must be a temp, since otherwise as soon as you modify the }
  682. { result, the current left node is modified and that one may }
  683. { still be an argument to the function or even accessed in the }
  684. { function }
  685. (((left.nodetype = temprefn) and
  686. paramanager.ret_in_param(right.resulttype.def,
  687. tcallnode(right).procdefinition.proccalloption)) or
  688. { there's special support for ansi/widestrings in the callnode }
  689. is_ansistring(right.resulttype.def) or
  690. is_widestring(right.resulttype.def)) then
  691. begin
  692. tcallnode(right).funcretnode := left;
  693. result := right;
  694. left := nil;
  695. right := nil;
  696. exit;
  697. end;
  698. registersint:=left.registersint+right.registersint;
  699. registersfpu:=max(left.registersfpu,right.registersfpu);
  700. {$ifdef SUPPORT_MMX}
  701. registersmmx:=max(left.registersmmx,right.registersmmx);
  702. {$endif SUPPORT_MMX}
  703. end;
  704. function tassignmentnode.docompare(p: tnode): boolean;
  705. begin
  706. docompare :=
  707. inherited docompare(p) and
  708. (assigntype = tassignmentnode(p).assigntype);
  709. end;
  710. {$ifdef state_tracking}
  711. function Tassignmentnode.track_state_pass(exec_known:boolean):boolean;
  712. var se:Tstate_entry;
  713. begin
  714. track_state_pass:=false;
  715. if exec_known then
  716. begin
  717. track_state_pass:=right.track_state_pass(exec_known);
  718. {Force a new resulttype pass.}
  719. right.resulttype.def:=nil;
  720. do_resulttypepass(right);
  721. resulttypepass(right);
  722. aktstate.store_fact(left.getcopy,right.getcopy);
  723. end
  724. else
  725. aktstate.delete_fact(left);
  726. end;
  727. {$endif}
  728. {*****************************************************************************
  729. TARRAYCONSTRUCTORRANGENODE
  730. *****************************************************************************}
  731. constructor tarrayconstructorrangenode.create(l,r : tnode);
  732. begin
  733. inherited create(arrayconstructorrangen,l,r);
  734. end;
  735. function tarrayconstructorrangenode.det_resulttype:tnode;
  736. begin
  737. result:=nil;
  738. resulttypepass(left);
  739. resulttypepass(right);
  740. set_varstate(left,vs_used,[vsf_must_be_valid]);
  741. set_varstate(right,vs_used,[vsf_must_be_valid]);
  742. if codegenerror then
  743. exit;
  744. resulttype:=left.resulttype;
  745. end;
  746. function tarrayconstructorrangenode.pass_1 : tnode;
  747. begin
  748. firstpass(left);
  749. firstpass(right);
  750. expectloc:=LOC_CREFERENCE;
  751. calcregisters(self,0,0,0);
  752. result:=nil;
  753. end;
  754. {****************************************************************************
  755. TARRAYCONSTRUCTORNODE
  756. *****************************************************************************}
  757. constructor tarrayconstructornode.create(l,r : tnode);
  758. begin
  759. inherited create(arrayconstructorn,l,r);
  760. end;
  761. function tarrayconstructornode.getcopy : tnode;
  762. var
  763. n : tarrayconstructornode;
  764. begin
  765. n:=tarrayconstructornode(inherited getcopy);
  766. result:=n;
  767. end;
  768. function tarrayconstructornode.det_resulttype:tnode;
  769. var
  770. htype : ttype;
  771. hp : tarrayconstructornode;
  772. len : longint;
  773. varia : boolean;
  774. begin
  775. result:=nil;
  776. { are we allowing array constructor? Then convert it to a set }
  777. if not allow_array_constructor then
  778. begin
  779. hp:=tarrayconstructornode(getcopy);
  780. arrayconstructor_to_set(tnode(hp));
  781. result:=hp;
  782. exit;
  783. end;
  784. { only pass left tree, right tree contains next construct if any }
  785. htype.reset;
  786. len:=0;
  787. varia:=false;
  788. if assigned(left) then
  789. begin
  790. hp:=self;
  791. while assigned(hp) do
  792. begin
  793. resulttypepass(hp.left);
  794. set_varstate(hp.left,vs_used,[vsf_must_be_valid]);
  795. if (htype.def=nil) then
  796. htype:=hp.left.resulttype
  797. else
  798. begin
  799. if ((nf_novariaallowed in flags) or (not varia)) and
  800. (not equal_defs(htype.def,hp.left.resulttype.def)) then
  801. begin
  802. varia:=true;
  803. end;
  804. end;
  805. inc(len);
  806. hp:=tarrayconstructornode(hp.right);
  807. end;
  808. end;
  809. { Set the type of empty or varia arrays to void. Also
  810. do this if the type is array of const/open array
  811. because those can't be used with setelementtype }
  812. if not assigned(htype.def) or
  813. varia or
  814. is_array_of_const(htype.def) or
  815. is_open_array(htype.def) then
  816. htype:=voidtype;
  817. resulttype.setdef(tarraydef.create(0,len-1,s32inttype));
  818. tarraydef(resulttype.def).setelementtype(htype);
  819. tarraydef(resulttype.def).IsConstructor:=true;
  820. tarraydef(resulttype.def).IsVariant:=varia;
  821. end;
  822. procedure tarrayconstructornode.force_type(tt:ttype);
  823. var
  824. hp : tarrayconstructornode;
  825. begin
  826. tarraydef(resulttype.def).setelementtype(tt);
  827. tarraydef(resulttype.def).IsConstructor:=true;
  828. tarraydef(resulttype.def).IsVariant:=false;
  829. if assigned(left) then
  830. begin
  831. hp:=self;
  832. while assigned(hp) do
  833. begin
  834. inserttypeconv(hp.left,tt);
  835. hp:=tarrayconstructornode(hp.right);
  836. end;
  837. end;
  838. end;
  839. procedure tarrayconstructornode.insert_typeconvs;
  840. var
  841. hp : tarrayconstructornode;
  842. dovariant : boolean;
  843. begin
  844. dovariant:=(nf_forcevaria in flags) or tarraydef(resulttype.def).isvariant;
  845. { only pass left tree, right tree contains next construct if any }
  846. if assigned(left) then
  847. begin
  848. hp:=self;
  849. while assigned(hp) do
  850. begin
  851. resulttypepass(hp.left);
  852. { Insert typeconvs for array of const }
  853. if dovariant then
  854. begin
  855. case hp.left.resulttype.def.deftype of
  856. enumdef :
  857. hp.left:=ctypeconvnode.create_internal(hp.left,s32inttype);
  858. arraydef :
  859. begin
  860. if is_chararray(hp.left.resulttype.def) then
  861. hp.left:=ctypeconvnode.create_internal(hp.left,charpointertype)
  862. else
  863. if is_widechararray(hp.left.resulttype.def) then
  864. hp.left:=ctypeconvnode.create_internal(hp.left,widecharpointertype)
  865. else
  866. CGMessagePos1(hp.left.fileinfo,type_e_wrong_type_in_array_constructor,hp.left.resulttype.def.typename);
  867. end;
  868. orddef :
  869. begin
  870. if is_integer(hp.left.resulttype.def) and
  871. not(is_64bitint(hp.left.resulttype.def)) then
  872. hp.left:=ctypeconvnode.create(hp.left,s32inttype);
  873. end;
  874. floatdef :
  875. hp.left:=ctypeconvnode.create(hp.left,pbestrealtype^);
  876. procvardef :
  877. hp.left:=ctypeconvnode.create(hp.left,voidpointertype);
  878. stringdef,
  879. variantdef,
  880. pointerdef,
  881. classrefdef,
  882. objectdef : ;
  883. else
  884. CGMessagePos1(hp.left.fileinfo,type_e_wrong_type_in_array_constructor,hp.left.resulttype.def.typename);
  885. end;
  886. end;
  887. resulttypepass(hp.left);
  888. hp:=tarrayconstructornode(hp.right);
  889. end;
  890. end;
  891. end;
  892. function tarrayconstructornode.pass_1 : tnode;
  893. var
  894. hp : tarrayconstructornode;
  895. do_variant:boolean;
  896. begin
  897. do_variant:=(nf_forcevaria in flags) or tarraydef(resulttype.def).isvariant;
  898. result:=nil;
  899. { Insert required type convs, this must be
  900. done in pass 1, because the call must be
  901. resulttypepassed already }
  902. if assigned(left) then
  903. begin
  904. insert_typeconvs;
  905. { call firstpass for all nodes }
  906. hp:=self;
  907. while assigned(hp) do
  908. begin
  909. if hp.left<>nil then
  910. begin
  911. {This check is pessimistic; a call will happen depending
  912. on the location in which the elements will be found in
  913. pass 2.}
  914. if not do_variant then
  915. include(current_procinfo.flags,pi_do_call);
  916. firstpass(hp.left);
  917. end;
  918. hp:=tarrayconstructornode(hp.right);
  919. end;
  920. end;
  921. expectloc:=LOC_CREFERENCE;
  922. calcregisters(self,0,0,0);
  923. end;
  924. function tarrayconstructornode.docompare(p: tnode): boolean;
  925. begin
  926. docompare:=inherited docompare(p);
  927. end;
  928. {*****************************************************************************
  929. TTYPENODE
  930. *****************************************************************************}
  931. constructor ttypenode.create(t : ttype);
  932. begin
  933. inherited create(typen);
  934. restype:=t;
  935. allowed:=false;
  936. end;
  937. constructor ttypenode.ppuload(t:tnodetype;ppufile:tcompilerppufile);
  938. begin
  939. inherited ppuload(t,ppufile);
  940. ppufile.gettype(restype);
  941. allowed:=boolean(ppufile.getbyte);
  942. end;
  943. procedure ttypenode.ppuwrite(ppufile:tcompilerppufile);
  944. begin
  945. inherited ppuwrite(ppufile);
  946. ppufile.puttype(restype);
  947. ppufile.putbyte(byte(allowed));
  948. end;
  949. procedure ttypenode.buildderefimpl;
  950. begin
  951. inherited buildderefimpl;
  952. restype.buildderef;
  953. end;
  954. procedure ttypenode.derefimpl;
  955. begin
  956. inherited derefimpl;
  957. restype.resolve;
  958. end;
  959. function ttypenode.det_resulttype:tnode;
  960. begin
  961. result:=nil;
  962. resulttype:=restype;
  963. { check if it's valid }
  964. if restype.def.deftype = errordef then
  965. CGMessage(parser_e_illegal_expression);
  966. end;
  967. function ttypenode.pass_1 : tnode;
  968. begin
  969. result:=nil;
  970. expectloc:=LOC_VOID;
  971. { a typenode can't generate code, so we give here
  972. an error. Else it'll be an abstract error in pass_2.
  973. Only when the allowed flag is set we don't generate
  974. an error }
  975. if not allowed then
  976. Message(parser_e_no_type_not_allowed_here);
  977. end;
  978. function ttypenode.docompare(p: tnode): boolean;
  979. begin
  980. docompare :=
  981. inherited docompare(p);
  982. end;
  983. {*****************************************************************************
  984. TRTTINODE
  985. *****************************************************************************}
  986. constructor trttinode.create(def:tstoreddef;rt:trttitype);
  987. begin
  988. inherited create(rttin);
  989. rttidef:=def;
  990. rttitype:=rt;
  991. end;
  992. constructor trttinode.ppuload(t:tnodetype;ppufile:tcompilerppufile);
  993. begin
  994. inherited ppuload(t,ppufile);
  995. ppufile.getderef(rttidefderef);
  996. rttitype:=trttitype(ppufile.getbyte);
  997. end;
  998. procedure trttinode.ppuwrite(ppufile:tcompilerppufile);
  999. begin
  1000. inherited ppuwrite(ppufile);
  1001. ppufile.putderef(rttidefderef);
  1002. ppufile.putbyte(byte(rttitype));
  1003. end;
  1004. procedure trttinode.buildderefimpl;
  1005. begin
  1006. inherited buildderefimpl;
  1007. rttidefderef.build(rttidef);
  1008. end;
  1009. procedure trttinode.derefimpl;
  1010. begin
  1011. inherited derefimpl;
  1012. rttidef:=tstoreddef(rttidefderef.resolve);
  1013. end;
  1014. function trttinode.getcopy : tnode;
  1015. var
  1016. n : trttinode;
  1017. begin
  1018. n:=trttinode(inherited getcopy);
  1019. n.rttidef:=rttidef;
  1020. n.rttitype:=rttitype;
  1021. result:=n;
  1022. end;
  1023. function trttinode.det_resulttype:tnode;
  1024. begin
  1025. { rtti information will be returned as a void pointer }
  1026. result:=nil;
  1027. resulttype:=voidpointertype;
  1028. end;
  1029. function trttinode.pass_1 : tnode;
  1030. begin
  1031. result:=nil;
  1032. expectloc:=LOC_CREFERENCE;
  1033. end;
  1034. function trttinode.docompare(p: tnode): boolean;
  1035. begin
  1036. docompare :=
  1037. inherited docompare(p) and
  1038. (rttidef = trttinode(p).rttidef) and
  1039. (rttitype = trttinode(p).rttitype);
  1040. end;
  1041. begin
  1042. cloadnode:=tloadnode;
  1043. cassignmentnode:=tassignmentnode;
  1044. carrayconstructorrangenode:=tarrayconstructorrangenode;
  1045. carrayconstructornode:=tarrayconstructornode;
  1046. ctypenode:=ttypenode;
  1047. crttinode:=trttinode;
  1048. end.
  1049. {
  1050. $Log$
  1051. Revision 1.148 2005-03-28 13:36:15 florian
  1052. + variants are now assigned using fpc_variant_copy
  1053. Revision 1.147 2005/03/25 22:20:19 peter
  1054. * add hint when passing an uninitialized variable to a var parameter
  1055. Revision 1.146 2005/03/18 16:41:27 peter
  1056. don't check size differences for booleans
  1057. Revision 1.145 2005/02/14 17:13:06 peter
  1058. * truncate log
  1059. Revision 1.144 2005/02/11 16:25:26 peter
  1060. * fix IE with array of const in array of conts
  1061. Revision 1.143 2005/01/23 17:14:21 florian
  1062. + optimized code generation on sparc
  1063. + some stuff for pic code on sparc added
  1064. }