nld.pas 41 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817818819820821822823824825826827828829830831832833834835836837838839840841842843844845846847848849850851852853854855856857858859860861862863864865866867868869870871872873874875876877878879880881882883884885886887888889890891892893894895896897898899900901902903904905906907908909910911912913914915916917918919920921922923924925926927928929930931932933934935936937938939940941942943944945946947948949950951952953954955956957958959960961962963964965966967968969970971972973974975976977978979980981982983984985986987988989990991992993994995996997998999100010011002100310041005100610071008100910101011101210131014101510161017101810191020102110221023102410251026102710281029103010311032103310341035103610371038103910401041104210431044104510461047104810491050105110521053105410551056105710581059106010611062106310641065106610671068106910701071107210731074107510761077107810791080108110821083108410851086108710881089109010911092109310941095109610971098109911001101110211031104110511061107110811091110111111121113111411151116111711181119112011211122112311241125112611271128112911301131113211331134113511361137113811391140114111421143114411451146114711481149115011511152115311541155115611571158115911601161116211631164116511661167116811691170117111721173117411751176117711781179118011811182118311841185118611871188118911901191119211931194119511961197119811991200
  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,false);
  509. set_varstate(right,vs_used,true);
  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]) then
  584. begin
  585. if (original_size <> 0) and (left.resulttype.def.size < original_size) then
  586. begin
  587. if (cs_check_range in aktlocalswitches) then
  588. Message(type_w_smaller_possible_range_check)
  589. else
  590. Message(type_h_smaller_possible_range_check);
  591. end;
  592. end;
  593. end;
  594. { call helpers for interface }
  595. if is_interfacecom(left.resulttype.def) then
  596. begin
  597. hp:=ccallparanode.create(ctypeconvnode.create_internal
  598. (right,voidpointertype),
  599. ccallparanode.create(ctypeconvnode.create_internal
  600. (left,voidpointertype),nil));
  601. result:=ccallnode.createintern('fpc_intf_assign',hp);
  602. left:=nil;
  603. right:=nil;
  604. exit;
  605. end;
  606. { check if local proc/func is assigned to procvar }
  607. if right.resulttype.def.deftype=procvardef then
  608. test_local_to_procvar(tprocvardef(right.resulttype.def),left.resulttype.def);
  609. end;
  610. function tassignmentnode.pass_1 : tnode;
  611. var
  612. hp: tnode;
  613. begin
  614. result:=nil;
  615. expectloc:=LOC_VOID;
  616. firstpass(left);
  617. firstpass(right);
  618. { assignment to refcounted variable -> inc/decref }
  619. if (not is_class(left.resulttype.def) and
  620. left.resulttype.def.needs_inittable) then
  621. include(current_procinfo.flags,pi_do_call);
  622. if codegenerror then
  623. exit;
  624. if (is_shortstring(left.resulttype.def)) then
  625. begin
  626. if right.resulttype.def.deftype=stringdef then
  627. begin
  628. if (right.nodetype<>stringconstn) or
  629. (tstringconstnode(right).len<>0) then
  630. begin
  631. if (cs_optimize in aktglobalswitches) and
  632. (right.nodetype in [calln,blockn]) and
  633. (left.nodetype = temprefn) and
  634. is_shortstring(right.resulttype.def) and
  635. not is_open_string(left.resulttype.def) and
  636. (tstringdef(left.resulttype.def).len = 255) then
  637. begin
  638. { the blocknode case is handled in pass_2 at the temp }
  639. { reference level (mainly for callparatemp) (JM) }
  640. if (right.nodetype = calln) then
  641. begin
  642. tcallnode(right).funcretnode := left;
  643. result := right;
  644. end
  645. else
  646. exit;
  647. end
  648. else
  649. begin
  650. hp:=ccallparanode.create
  651. (right,
  652. ccallparanode.create(cinlinenode.create
  653. (in_high_x,false,left.getcopy),nil));
  654. result:=ccallnode.createinternreturn('fpc_'+tstringdef(right.resulttype.def).stringtypname+'_to_shortstr',hp,left);
  655. firstpass(result);
  656. end;
  657. left:=nil;
  658. right:=nil;
  659. exit;
  660. end;
  661. end;
  662. end;
  663. if (cs_optimize in aktglobalswitches) and
  664. (right.nodetype = calln) and
  665. { left must be a temp, since otherwise as soon as you modify the }
  666. { result, the current left node is modified and that one may }
  667. { still be an argument to the function or even accessed in the }
  668. { function }
  669. (((left.nodetype = temprefn) and
  670. paramanager.ret_in_param(right.resulttype.def,
  671. tcallnode(right).procdefinition.proccalloption)) or
  672. { there's special support for ansi/widestrings in the callnode }
  673. is_ansistring(right.resulttype.def) or
  674. is_widestring(right.resulttype.def)) then
  675. begin
  676. tcallnode(right).funcretnode := left;
  677. result := right;
  678. left := nil;
  679. right := nil;
  680. exit;
  681. end;
  682. registersint:=left.registersint+right.registersint;
  683. registersfpu:=max(left.registersfpu,right.registersfpu);
  684. {$ifdef SUPPORT_MMX}
  685. registersmmx:=max(left.registersmmx,right.registersmmx);
  686. {$endif SUPPORT_MMX}
  687. end;
  688. function tassignmentnode.docompare(p: tnode): boolean;
  689. begin
  690. docompare :=
  691. inherited docompare(p) and
  692. (assigntype = tassignmentnode(p).assigntype);
  693. end;
  694. {$ifdef state_tracking}
  695. function Tassignmentnode.track_state_pass(exec_known:boolean):boolean;
  696. var se:Tstate_entry;
  697. begin
  698. track_state_pass:=false;
  699. if exec_known then
  700. begin
  701. track_state_pass:=right.track_state_pass(exec_known);
  702. {Force a new resulttype pass.}
  703. right.resulttype.def:=nil;
  704. do_resulttypepass(right);
  705. resulttypepass(right);
  706. aktstate.store_fact(left.getcopy,right.getcopy);
  707. end
  708. else
  709. aktstate.delete_fact(left);
  710. end;
  711. {$endif}
  712. {*****************************************************************************
  713. TARRAYCONSTRUCTORRANGENODE
  714. *****************************************************************************}
  715. constructor tarrayconstructorrangenode.create(l,r : tnode);
  716. begin
  717. inherited create(arrayconstructorrangen,l,r);
  718. end;
  719. function tarrayconstructorrangenode.det_resulttype:tnode;
  720. begin
  721. result:=nil;
  722. resulttypepass(left);
  723. resulttypepass(right);
  724. set_varstate(left,vs_used,true);
  725. set_varstate(right,vs_used,true);
  726. if codegenerror then
  727. exit;
  728. resulttype:=left.resulttype;
  729. end;
  730. function tarrayconstructorrangenode.pass_1 : tnode;
  731. begin
  732. firstpass(left);
  733. firstpass(right);
  734. expectloc:=LOC_CREFERENCE;
  735. calcregisters(self,0,0,0);
  736. result:=nil;
  737. end;
  738. {****************************************************************************
  739. TARRAYCONSTRUCTORNODE
  740. *****************************************************************************}
  741. constructor tarrayconstructornode.create(l,r : tnode);
  742. begin
  743. inherited create(arrayconstructorn,l,r);
  744. end;
  745. function tarrayconstructornode.getcopy : tnode;
  746. var
  747. n : tarrayconstructornode;
  748. begin
  749. n:=tarrayconstructornode(inherited getcopy);
  750. result:=n;
  751. end;
  752. function tarrayconstructornode.det_resulttype:tnode;
  753. var
  754. htype : ttype;
  755. hp : tarrayconstructornode;
  756. len : longint;
  757. varia : boolean;
  758. begin
  759. result:=nil;
  760. { are we allowing array constructor? Then convert it to a set }
  761. if not allow_array_constructor then
  762. begin
  763. hp:=tarrayconstructornode(getcopy);
  764. arrayconstructor_to_set(tnode(hp));
  765. result:=hp;
  766. exit;
  767. end;
  768. { only pass left tree, right tree contains next construct if any }
  769. htype.reset;
  770. len:=0;
  771. varia:=false;
  772. if assigned(left) then
  773. begin
  774. hp:=self;
  775. while assigned(hp) do
  776. begin
  777. resulttypepass(hp.left);
  778. set_varstate(hp.left,vs_used,true);
  779. if (htype.def=nil) then
  780. htype:=hp.left.resulttype
  781. else
  782. begin
  783. if ((nf_novariaallowed in flags) or (not varia)) and
  784. (not equal_defs(htype.def,hp.left.resulttype.def)) then
  785. begin
  786. varia:=true;
  787. end;
  788. end;
  789. inc(len);
  790. hp:=tarrayconstructornode(hp.right);
  791. end;
  792. end;
  793. { Set the type of empty or varia arrays to void. Also
  794. do this if the type is array of const/open array
  795. because those can't be used with setelementtype }
  796. if not assigned(htype.def) or
  797. varia or
  798. is_array_of_const(htype.def) or
  799. is_open_array(htype.def) then
  800. htype:=voidtype;
  801. resulttype.setdef(tarraydef.create(0,len-1,s32inttype));
  802. tarraydef(resulttype.def).setelementtype(htype);
  803. tarraydef(resulttype.def).IsConstructor:=true;
  804. tarraydef(resulttype.def).IsVariant:=varia;
  805. end;
  806. procedure tarrayconstructornode.force_type(tt:ttype);
  807. var
  808. hp : tarrayconstructornode;
  809. begin
  810. tarraydef(resulttype.def).setelementtype(tt);
  811. tarraydef(resulttype.def).IsConstructor:=true;
  812. tarraydef(resulttype.def).IsVariant:=false;
  813. if assigned(left) then
  814. begin
  815. hp:=self;
  816. while assigned(hp) do
  817. begin
  818. inserttypeconv(hp.left,tt);
  819. hp:=tarrayconstructornode(hp.right);
  820. end;
  821. end;
  822. end;
  823. procedure tarrayconstructornode.insert_typeconvs;
  824. var
  825. hp : tarrayconstructornode;
  826. dovariant : boolean;
  827. begin
  828. dovariant:=(nf_forcevaria in flags) or tarraydef(resulttype.def).isvariant;
  829. { only pass left tree, right tree contains next construct if any }
  830. if assigned(left) then
  831. begin
  832. hp:=self;
  833. while assigned(hp) do
  834. begin
  835. resulttypepass(hp.left);
  836. { Insert typeconvs for array of const }
  837. if dovariant then
  838. begin
  839. case hp.left.resulttype.def.deftype of
  840. enumdef :
  841. hp.left:=ctypeconvnode.create_internal(hp.left,s32inttype);
  842. arraydef :
  843. begin
  844. if is_chararray(hp.left.resulttype.def) then
  845. hp.left:=ctypeconvnode.create_internal(hp.left,charpointertype)
  846. else
  847. if is_widechararray(hp.left.resulttype.def) then
  848. hp.left:=ctypeconvnode.create_internal(hp.left,widecharpointertype)
  849. else
  850. CGMessagePos1(hp.left.fileinfo,type_e_wrong_type_in_array_constructor,hp.left.resulttype.def.typename);
  851. end;
  852. orddef :
  853. begin
  854. if is_integer(hp.left.resulttype.def) and
  855. not(is_64bitint(hp.left.resulttype.def)) then
  856. hp.left:=ctypeconvnode.create(hp.left,s32inttype);
  857. end;
  858. floatdef :
  859. hp.left:=ctypeconvnode.create(hp.left,pbestrealtype^);
  860. procvardef :
  861. hp.left:=ctypeconvnode.create(hp.left,voidpointertype);
  862. stringdef,
  863. variantdef,
  864. pointerdef,
  865. classrefdef,
  866. objectdef : ;
  867. else
  868. CGMessagePos1(hp.left.fileinfo,type_e_wrong_type_in_array_constructor,hp.left.resulttype.def.typename);
  869. end;
  870. end;
  871. resulttypepass(hp.left);
  872. hp:=tarrayconstructornode(hp.right);
  873. end;
  874. end;
  875. end;
  876. function tarrayconstructornode.pass_1 : tnode;
  877. var
  878. hp : tarrayconstructornode;
  879. do_variant:boolean;
  880. begin
  881. do_variant:=(nf_forcevaria in flags) or tarraydef(resulttype.def).isvariant;
  882. result:=nil;
  883. { Insert required type convs, this must be
  884. done in pass 1, because the call must be
  885. resulttypepassed already }
  886. if assigned(left) then
  887. begin
  888. insert_typeconvs;
  889. { call firstpass for all nodes }
  890. hp:=self;
  891. while assigned(hp) do
  892. begin
  893. if hp.left<>nil then
  894. begin
  895. {This check is pessimistic; a call will happen depending
  896. on the location in which the elements will be found in
  897. pass 2.}
  898. if not do_variant then
  899. include(current_procinfo.flags,pi_do_call);
  900. firstpass(hp.left);
  901. end;
  902. hp:=tarrayconstructornode(hp.right);
  903. end;
  904. end;
  905. expectloc:=LOC_CREFERENCE;
  906. calcregisters(self,0,0,0);
  907. end;
  908. function tarrayconstructornode.docompare(p: tnode): boolean;
  909. begin
  910. docompare:=inherited docompare(p);
  911. end;
  912. {*****************************************************************************
  913. TTYPENODE
  914. *****************************************************************************}
  915. constructor ttypenode.create(t : ttype);
  916. begin
  917. inherited create(typen);
  918. restype:=t;
  919. allowed:=false;
  920. end;
  921. constructor ttypenode.ppuload(t:tnodetype;ppufile:tcompilerppufile);
  922. begin
  923. inherited ppuload(t,ppufile);
  924. ppufile.gettype(restype);
  925. allowed:=boolean(ppufile.getbyte);
  926. end;
  927. procedure ttypenode.ppuwrite(ppufile:tcompilerppufile);
  928. begin
  929. inherited ppuwrite(ppufile);
  930. ppufile.puttype(restype);
  931. ppufile.putbyte(byte(allowed));
  932. end;
  933. procedure ttypenode.buildderefimpl;
  934. begin
  935. inherited buildderefimpl;
  936. restype.buildderef;
  937. end;
  938. procedure ttypenode.derefimpl;
  939. begin
  940. inherited derefimpl;
  941. restype.resolve;
  942. end;
  943. function ttypenode.det_resulttype:tnode;
  944. begin
  945. result:=nil;
  946. resulttype:=restype;
  947. { check if it's valid }
  948. if restype.def.deftype = errordef then
  949. CGMessage(parser_e_illegal_expression);
  950. end;
  951. function ttypenode.pass_1 : tnode;
  952. begin
  953. result:=nil;
  954. expectloc:=LOC_VOID;
  955. { a typenode can't generate code, so we give here
  956. an error. Else it'll be an abstract error in pass_2.
  957. Only when the allowed flag is set we don't generate
  958. an error }
  959. if not allowed then
  960. Message(parser_e_no_type_not_allowed_here);
  961. end;
  962. function ttypenode.docompare(p: tnode): boolean;
  963. begin
  964. docompare :=
  965. inherited docompare(p);
  966. end;
  967. {*****************************************************************************
  968. TRTTINODE
  969. *****************************************************************************}
  970. constructor trttinode.create(def:tstoreddef;rt:trttitype);
  971. begin
  972. inherited create(rttin);
  973. rttidef:=def;
  974. rttitype:=rt;
  975. end;
  976. constructor trttinode.ppuload(t:tnodetype;ppufile:tcompilerppufile);
  977. begin
  978. inherited ppuload(t,ppufile);
  979. ppufile.getderef(rttidefderef);
  980. rttitype:=trttitype(ppufile.getbyte);
  981. end;
  982. procedure trttinode.ppuwrite(ppufile:tcompilerppufile);
  983. begin
  984. inherited ppuwrite(ppufile);
  985. ppufile.putderef(rttidefderef);
  986. ppufile.putbyte(byte(rttitype));
  987. end;
  988. procedure trttinode.buildderefimpl;
  989. begin
  990. inherited buildderefimpl;
  991. rttidefderef.build(rttidef);
  992. end;
  993. procedure trttinode.derefimpl;
  994. begin
  995. inherited derefimpl;
  996. rttidef:=tstoreddef(rttidefderef.resolve);
  997. end;
  998. function trttinode.getcopy : tnode;
  999. var
  1000. n : trttinode;
  1001. begin
  1002. n:=trttinode(inherited getcopy);
  1003. n.rttidef:=rttidef;
  1004. n.rttitype:=rttitype;
  1005. result:=n;
  1006. end;
  1007. function trttinode.det_resulttype:tnode;
  1008. begin
  1009. { rtti information will be returned as a void pointer }
  1010. result:=nil;
  1011. resulttype:=voidpointertype;
  1012. end;
  1013. function trttinode.pass_1 : tnode;
  1014. begin
  1015. result:=nil;
  1016. expectloc:=LOC_CREFERENCE;
  1017. end;
  1018. function trttinode.docompare(p: tnode): boolean;
  1019. begin
  1020. docompare :=
  1021. inherited docompare(p) and
  1022. (rttidef = trttinode(p).rttidef) and
  1023. (rttitype = trttinode(p).rttitype);
  1024. end;
  1025. begin
  1026. cloadnode:=tloadnode;
  1027. cassignmentnode:=tassignmentnode;
  1028. carrayconstructorrangenode:=tarrayconstructorrangenode;
  1029. carrayconstructornode:=tarrayconstructornode;
  1030. ctypenode:=ttypenode;
  1031. crttinode:=trttinode;
  1032. end.
  1033. {
  1034. $Log$
  1035. Revision 1.145 2005-02-14 17:13:06 peter
  1036. * truncate log
  1037. Revision 1.144 2005/02/11 16:25:26 peter
  1038. * fix IE with array of const in array of conts
  1039. Revision 1.143 2005/01/23 17:14:21 florian
  1040. + optimized code generation on sparc
  1041. + some stuff for pic code on sparc added
  1042. }