nld.pas 55 KB

1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768697071727374757677787980818283848586878889909192939495969798991001011021031041051061071081091101111121131141151161171181191201211221231241251261271281291301311321331341351361371381391401411421431441451461471481491501511521531541551561571581591601611621631641651661671681691701711721731741751761771781791801811821831841851861871881891901911921931941951961971981992002012022032042052062072082092102112122132142152162172182192202212222232242252262272282292302312322332342352362372382392402412422432442452462472482492502512522532542552562572582592602612622632642652662672682692702712722732742752762772782792802812822832842852862872882892902912922932942952962972982993003013023033043053063073083093103113123133143153163173183193203213223233243253263273283293303313323333343353363373383393403413423433443453463473483493503513523533543553563573583593603613623633643653663673683693703713723733743753763773783793803813823833843853863873883893903913923933943953963973983994004014024034044054064074084094104114124134144154164174184194204214224234244254264274284294304314324334344354364374384394404414424434444454464474484494504514524534544554564574584594604614624634644654664674684694704714724734744754764774784794804814824834844854864874884894904914924934944954964974984995005015025035045055065075085095105115125135145155165175185195205215225235245255265275285295305315325335345355365375385395405415425435445455465475485495505515525535545555565575585595605615625635645655665675685695705715725735745755765775785795805815825835845855865875885895905915925935945955965975985996006016026036046056066076086096106116126136146156166176186196206216226236246256266276286296306316326336346356366376386396406416426436446456466476486496506516526536546556566576586596606616626636646656666676686696706716726736746756766776786796806816826836846856866876886896906916926936946956966976986997007017027037047057067077087097107117127137147157167177187197207217227237247257267277287297307317327337347357367377387397407417427437447457467477487497507517527537547557567577587597607617627637647657667677687697707717727737747757767777787797807817827837847857867877887897907917927937947957967977987998008018028038048058068078088098108118128138148158168178188198208218228238248258268278288298308318328338348358368378388398408418428438448458468478488498508518528538548558568578588598608618628638648658668678688698708718728738748758768778788798808818828838848858868878888898908918928938948958968978988999009019029039049059069079089099109119129139149159169179189199209219229239249259269279289299309319329339349359369379389399409419429439449459469479489499509519529539549559569579589599609619629639649659669679689699709719729739749759769779789799809819829839849859869879889899909919929939949959969979989991000100110021003100410051006100710081009101010111012101310141015101610171018101910201021102210231024102510261027102810291030103110321033103410351036103710381039104010411042104310441045104610471048104910501051105210531054105510561057105810591060106110621063106410651066106710681069107010711072107310741075107610771078107910801081108210831084108510861087108810891090109110921093109410951096109710981099110011011102110311041105110611071108110911101111111211131114111511161117111811191120112111221123112411251126112711281129113011311132113311341135113611371138113911401141114211431144114511461147114811491150115111521153115411551156115711581159116011611162116311641165116611671168116911701171117211731174117511761177117811791180118111821183118411851186118711881189119011911192119311941195119611971198119912001201120212031204120512061207120812091210121112121213121412151216121712181219122012211222122312241225122612271228122912301231123212331234123512361237123812391240124112421243124412451246124712481249125012511252125312541255125612571258125912601261126212631264126512661267126812691270127112721273127412751276127712781279128012811282128312841285128612871288128912901291129212931294129512961297129812991300130113021303130413051306130713081309131013111312131313141315131613171318131913201321132213231324132513261327132813291330133113321333133413351336133713381339134013411342134313441345134613471348134913501351135213531354135513561357135813591360136113621363136413651366136713681369137013711372137313741375137613771378137913801381138213831384138513861387138813891390139113921393139413951396139713981399140014011402140314041405140614071408140914101411141214131414141514161417141814191420142114221423142414251426142714281429143014311432143314341435143614371438143914401441144214431444144514461447144814491450145114521453145414551456145714581459146014611462146314641465146614671468146914701471147214731474147514761477147814791480148114821483148414851486148714881489149014911492149314941495149614971498149915001501150215031504150515061507150815091510151115121513151415151516151715181519152015211522152315241525152615271528152915301531153215331534153515361537153815391540154115421543154415451546154715481549155015511552155315541555155615571558155915601561156215631564156515661567156815691570157115721573157415751576157715781579158015811582158315841585158615871588158915901591159215931594
  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,symppu,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 derefimpl;override;
  39. procedure set_mp(p:tnode);
  40. function getcopy : tnode;override;
  41. function pass_1 : tnode;override;
  42. function det_resulttype:tnode;override;
  43. procedure mark_write;override;
  44. function docompare(p: tnode): boolean; override;
  45. procedure printnodedata(var t:text);override;
  46. end;
  47. tloadnodeclass = class of tloadnode;
  48. { different assignment types }
  49. tassigntype = (at_normal,at_plus,at_minus,at_star,at_slash);
  50. tassignmentnode = class(tbinarynode)
  51. assigntype : tassigntype;
  52. constructor create(l,r : tnode);virtual;
  53. constructor ppuload(t:tnodetype;ppufile:tcompilerppufile);override;
  54. procedure ppuwrite(ppufile:tcompilerppufile);override;
  55. function getcopy : tnode;override;
  56. function pass_1 : tnode;override;
  57. function det_resulttype:tnode;override;
  58. {$ifdef state_tracking}
  59. function track_state_pass(exec_known:boolean):boolean;override;
  60. {$endif state_tracking}
  61. function docompare(p: tnode): boolean; override;
  62. end;
  63. tassignmentnodeclass = class of tassignmentnode;
  64. tarrayconstructorrangenode = class(tbinarynode)
  65. constructor create(l,r : tnode);virtual;
  66. function pass_1 : tnode;override;
  67. function det_resulttype:tnode;override;
  68. end;
  69. tarrayconstructorrangenodeclass = class of tarrayconstructorrangenode;
  70. tarrayconstructornode = class(tbinarynode)
  71. constructor create(l,r : tnode);virtual;
  72. function getcopy : tnode;override;
  73. function pass_1 : tnode;override;
  74. function det_resulttype:tnode;override;
  75. function docompare(p: tnode): boolean; override;
  76. procedure force_type(tt:ttype);
  77. procedure insert_typeconvs;
  78. end;
  79. tarrayconstructornodeclass = class of tarrayconstructornode;
  80. ttypenode = class(tnode)
  81. allowed : boolean;
  82. restype : ttype;
  83. constructor create(t : ttype);virtual;
  84. constructor ppuload(t:tnodetype;ppufile:tcompilerppufile);override;
  85. procedure ppuwrite(ppufile:tcompilerppufile);override;
  86. procedure derefimpl;override;
  87. function pass_1 : tnode;override;
  88. function det_resulttype:tnode;override;
  89. function docompare(p: tnode): boolean; override;
  90. end;
  91. ttypenodeclass = class of ttypenode;
  92. trttinode = class(tnode)
  93. l1,l2 : longint;
  94. rttitype : trttitype;
  95. rttidef : tstoreddef;
  96. rttidefderef : tderef;
  97. constructor create(def:tstoreddef;rt:trttitype);virtual;
  98. constructor ppuload(t:tnodetype;ppufile:tcompilerppufile);override;
  99. procedure ppuwrite(ppufile:tcompilerppufile);override;
  100. procedure derefimpl;override;
  101. function getcopy : tnode;override;
  102. function pass_1 : tnode;override;
  103. procedure pass_2;override;
  104. function det_resulttype:tnode;override;
  105. function docompare(p: tnode): boolean; override;
  106. end;
  107. trttinodeclass = class of trttinode;
  108. var
  109. cloadnode : tloadnodeclass;
  110. cassignmentnode : tassignmentnodeclass;
  111. carrayconstructorrangenode : tarrayconstructorrangenodeclass;
  112. carrayconstructornode : tarrayconstructornodeclass;
  113. ctypenode : ttypenodeclass;
  114. crttinode : trttinodeclass;
  115. procedure load_procvar_from_calln(var p1:tnode);
  116. function load_high_value_node(vs:tvarsym):tnode;
  117. function load_self_node:tnode;
  118. function load_result_node:tnode;
  119. function load_self_pointer_node:tnode;
  120. function load_vmt_pointer_node:tnode;
  121. function is_self_node(p:tnode):boolean;
  122. implementation
  123. uses
  124. cutils,verbose,globtype,globals,systems,
  125. symtable,symnot,
  126. defutil,defcmp,
  127. htypechk,pass_1,
  128. ncon,ninl,ncnv,nmem,ncal,
  129. paramgr,cpubase,rgobj,cgbase,procinfo
  130. ;
  131. {*****************************************************************************
  132. Helpers
  133. *****************************************************************************}
  134. procedure load_procvar_from_calln(var p1:tnode);
  135. var
  136. p2 : tnode;
  137. begin
  138. if p1.nodetype<>calln then
  139. internalerror(200212251);
  140. { was it a procvar, then we simply remove the calln and
  141. reuse the right }
  142. if assigned(tcallnode(p1).right) then
  143. begin
  144. p2:=tcallnode(p1).right;
  145. tcallnode(p1).right:=nil;
  146. end
  147. else
  148. begin
  149. p2:=cloadnode.create_procvar(tcallnode(p1).symtableprocentry,
  150. tprocdef(tcallnode(p1).procdefinition),tcallnode(p1).symtableproc);
  151. { when the methodpointer is typen we've something like:
  152. tobject.create. Then only the address is needed of the
  153. method without a self pointer }
  154. if assigned(tcallnode(p1).methodpointer) and
  155. (tcallnode(p1).methodpointer.nodetype<>typen) then
  156. begin
  157. tloadnode(p2).set_mp(tcallnode(p1).methodpointer);
  158. tcallnode(p1).methodpointer:=nil;
  159. end;
  160. end;
  161. resulttypepass(p2);
  162. p1.free;
  163. p1:=p2;
  164. end;
  165. function load_high_value_node(vs:tvarsym):tnode;
  166. var
  167. srsym : tsym;
  168. srsymtable : tsymtable;
  169. begin
  170. result:=nil;
  171. srsymtable:=vs.owner;
  172. srsym:=searchsymonlyin(srsymtable,'high'+vs.name);
  173. if assigned(srsym) then
  174. begin
  175. result:=cloadnode.create(srsym,srsymtable);
  176. resulttypepass(result);
  177. end
  178. else
  179. CGMessage(cg_e_illegal_expression);
  180. end;
  181. function load_self_node:tnode;
  182. var
  183. srsym : tsym;
  184. srsymtable : tsymtable;
  185. begin
  186. result:=nil;
  187. searchsym('self',srsym,srsymtable);
  188. if assigned(srsym) then
  189. begin
  190. result:=cloadnode.create(srsym,srsymtable);
  191. resulttypepass(result);
  192. end
  193. else
  194. CGMessage(cg_e_illegal_expression);
  195. end;
  196. function load_result_node:tnode;
  197. var
  198. srsym : tsym;
  199. srsymtable : tsymtable;
  200. begin
  201. result:=nil;
  202. searchsym('result',srsym,srsymtable);
  203. if assigned(srsym) then
  204. begin
  205. result:=cloadnode.create(srsym,srsymtable);
  206. resulttypepass(result);
  207. end
  208. else
  209. CGMessage(cg_e_illegal_expression);
  210. end;
  211. function load_self_pointer_node:tnode;
  212. var
  213. srsym : tsym;
  214. srsymtable : tsymtable;
  215. begin
  216. result:=nil;
  217. searchsym('self',srsym,srsymtable);
  218. if assigned(srsym) then
  219. begin
  220. result:=cloadnode.create(srsym,srsymtable);
  221. include(result.flags,nf_load_self_pointer);
  222. resulttypepass(result);
  223. end
  224. else
  225. CGMessage(cg_e_illegal_expression);
  226. end;
  227. function load_vmt_pointer_node:tnode;
  228. var
  229. srsym : tsym;
  230. srsymtable : tsymtable;
  231. begin
  232. result:=nil;
  233. searchsym('vmt',srsym,srsymtable);
  234. if assigned(srsym) then
  235. begin
  236. result:=cloadnode.create(srsym,srsymtable);
  237. resulttypepass(result);
  238. end
  239. else
  240. CGMessage(cg_e_illegal_expression);
  241. end;
  242. function is_self_node(p:tnode):boolean;
  243. begin
  244. is_self_node:=(p.nodetype=loadn) and
  245. (tloadnode(p).symtableentry.typ=varsym) and
  246. (vo_is_self in tvarsym(tloadnode(p).symtableentry).varoptions);
  247. end;
  248. {*****************************************************************************
  249. TLOADNODE
  250. *****************************************************************************}
  251. constructor tloadnode.create(v : tsym;st : tsymtable);
  252. begin
  253. inherited create(loadn,nil);
  254. if not assigned(v) then
  255. internalerror(200108121);
  256. symtableentry:=v;
  257. symtable:=st;
  258. procdef:=nil;
  259. end;
  260. constructor tloadnode.create_procvar(v : tsym;d:tprocdef;st : tsymtable);
  261. begin
  262. inherited create(loadn,nil);
  263. if not assigned(v) then
  264. internalerror(200108121);
  265. symtableentry:=v;
  266. symtable:=st;
  267. procdef:=d;
  268. end;
  269. constructor tloadnode.ppuload(t:tnodetype;ppufile:tcompilerppufile);
  270. begin
  271. inherited ppuload(t,ppufile);
  272. ppufile.getderef(symtableentryderef);
  273. symtable:=nil;
  274. ppufile.getderef(procdefderef);
  275. end;
  276. procedure tloadnode.ppuwrite(ppufile:tcompilerppufile);
  277. begin
  278. inherited ppuwrite(ppufile);
  279. ppufile.putderef(symtableentry,symtableentryderef);
  280. ppufile.putderef(procdef,procdefderef);
  281. end;
  282. procedure tloadnode.derefimpl;
  283. begin
  284. inherited derefimpl;
  285. symtableentry:=tsym(symtableentryderef.resolve);
  286. symtable:=symtableentry.owner;
  287. procdef:=tprocdef(procdefderef.resolve);
  288. end;
  289. procedure tloadnode.set_mp(p:tnode);
  290. begin
  291. { typen nodes should not be set }
  292. if p.nodetype=typen then
  293. internalerror(200301042);
  294. left:=p;
  295. end;
  296. function tloadnode.getcopy : tnode;
  297. var
  298. n : tloadnode;
  299. begin
  300. n:=tloadnode(inherited getcopy);
  301. n.symtable:=symtable;
  302. n.symtableentry:=symtableentry;
  303. result:=n;
  304. end;
  305. function tloadnode.det_resulttype:tnode;
  306. begin
  307. result:=nil;
  308. { handle first absolute as it will replace the symtableentry }
  309. if symtableentry.typ=absolutesym then
  310. begin
  311. { force the resulttype to the type of the absolute }
  312. resulttype:=tabsolutesym(symtableentry).vartype;
  313. { replace the symtableentry when it points to a var, else
  314. we are finished }
  315. if (tabsolutesym(symtableentry).abstyp=tovar) then
  316. begin
  317. symtableentry:=tabsolutesym(symtableentry).ref;
  318. symtable:=symtableentry.owner;
  319. include(flags,nf_absolute);
  320. end
  321. else
  322. exit;
  323. end;
  324. case symtableentry.typ of
  325. constsym:
  326. begin
  327. if tconstsym(symtableentry).consttyp=constresourcestring then
  328. resulttype:=cansistringtype
  329. else
  330. internalerror(22799);
  331. end;
  332. varsym :
  333. begin
  334. inc(tvarsym(symtableentry).refs);
  335. { Nested variable? The we need to load the framepointer of
  336. the parent procedure }
  337. if (symtable.symtabletype in [localsymtable,parasymtable]) and
  338. (symtable.symtablelevel<>current_procinfo.procdef.parast.symtablelevel) then
  339. begin
  340. if assigned(left) then
  341. internalerror(200309289);
  342. left:=cloadparentfpnode.create(tprocdef(symtable.defowner));
  343. end;
  344. { if it's refered by absolute then it's used }
  345. if nf_absolute in flags then
  346. tvarsym(symtableentry).varstate:=vs_used
  347. else
  348. begin
  349. { fix self type which is declared as voidpointer in the
  350. definition }
  351. if vo_is_self in tvarsym(symtableentry).varoptions then
  352. begin
  353. resulttype.setdef(tprocdef(symtableentry.owner.defowner)._class);
  354. if (po_classmethod in tprocdef(symtableentry.owner.defowner).procoptions) or
  355. (po_staticmethod in tprocdef(symtableentry.owner.defowner).procoptions) then
  356. resulttype.setdef(tclassrefdef.create(resulttype))
  357. else if is_object(resulttype.def) and
  358. (nf_load_self_pointer in flags) then
  359. resulttype.setdef(tpointerdef.create(resulttype));
  360. end
  361. else if vo_is_vmt in tvarsym(symtableentry).varoptions then
  362. begin
  363. resulttype.setdef(tprocdef(symtableentry.owner.defowner)._class);
  364. resulttype.setdef(tclassrefdef.create(resulttype));
  365. end
  366. else
  367. resulttype:=tvarsym(symtableentry).vartype;
  368. end;
  369. end;
  370. typedconstsym :
  371. if not(nf_absolute in flags) then
  372. resulttype:=ttypedconstsym(symtableentry).typedconsttype;
  373. procsym :
  374. begin
  375. if not assigned(procdef) then
  376. begin
  377. if Tprocsym(symtableentry).procdef_count>1 then
  378. CGMessage(parser_e_no_overloaded_procvars);
  379. procdef:=tprocsym(symtableentry).first_procdef;
  380. end;
  381. { the result is a procdef, addrn and proc_to_procvar
  382. typeconvn need this as resulttype so they know
  383. that the address needs to be returned }
  384. resulttype.setdef(procdef);
  385. { process methodpointer }
  386. if assigned(left) then
  387. resulttypepass(left);
  388. end;
  389. else
  390. internalerror(200104141);
  391. end;
  392. end;
  393. procedure Tloadnode.mark_write;
  394. begin
  395. include(flags,nf_write);
  396. end;
  397. function tloadnode.pass_1 : tnode;
  398. begin
  399. result:=nil;
  400. expectloc:=LOC_REFERENCE;
  401. registers32:=0;
  402. registersfpu:=0;
  403. {$ifdef SUPPORT_MMX}
  404. registersmmx:=0;
  405. {$endif SUPPORT_MMX}
  406. case symtableentry.typ of
  407. absolutesym :
  408. ;
  409. constsym:
  410. begin
  411. if tconstsym(symtableentry).consttyp=constresourcestring then
  412. begin
  413. include(current_procinfo.flags,pi_needs_implicit_finally);
  414. expectloc:=LOC_CREFERENCE;
  415. end;
  416. end;
  417. varsym :
  418. begin
  419. if assigned(left) then
  420. firstpass(left);
  421. if (tvarsym(symtableentry).varspez=vs_const) then
  422. expectloc:=LOC_CREFERENCE;
  423. { we need a register for call by reference parameters }
  424. if paramanager.push_addr_param(tvarsym(symtableentry).varspez,tvarsym(symtableentry).vartype.def,pocall_default) then
  425. registers32:=1;
  426. if ([vo_is_thread_var,vo_is_dll_var]*tvarsym(symtableentry).varoptions)<>[] then
  427. registers32:=1;
  428. { call to get address of threadvar }
  429. if (vo_is_thread_var in tvarsym(symtableentry).varoptions) then
  430. include(current_procinfo.flags,pi_do_call);
  431. if nf_write in flags then
  432. Tvarsym(symtableentry).trigger_notifications(vn_onwrite)
  433. else
  434. Tvarsym(symtableentry).trigger_notifications(vn_onread);
  435. { count variable references }
  436. if rg.t_times>1 then
  437. inc(tvarsym(symtableentry).refs,rg.t_times-1);
  438. end;
  439. typedconstsym :
  440. ;
  441. procsym :
  442. begin
  443. { method pointer ? }
  444. if assigned(left) then
  445. begin
  446. expectloc:=LOC_CREFERENCE;
  447. firstpass(left);
  448. registers32:=max(registers32,left.registers32);
  449. registersfpu:=max(registersfpu,left.registersfpu);
  450. {$ifdef SUPPORT_MMX}
  451. registersmmx:=max(registersmmx,left.registersmmx);
  452. {$endif SUPPORT_MMX}
  453. end;
  454. end;
  455. else
  456. internalerror(200104143);
  457. end;
  458. end;
  459. function tloadnode.docompare(p: tnode): boolean;
  460. begin
  461. docompare :=
  462. inherited docompare(p) and
  463. (symtableentry = tloadnode(p).symtableentry) and
  464. (symtable = tloadnode(p).symtable);
  465. end;
  466. procedure Tloadnode.printnodedata(var t:text);
  467. begin
  468. inherited printnodedata(t);
  469. writeln(t,printnodeindention,'symbol = ',symtableentry.name);
  470. end;
  471. {*****************************************************************************
  472. TASSIGNMENTNODE
  473. *****************************************************************************}
  474. constructor tassignmentnode.create(l,r : tnode);
  475. begin
  476. inherited create(assignn,l,r);
  477. l.mark_write;
  478. assigntype:=at_normal;
  479. end;
  480. constructor tassignmentnode.ppuload(t:tnodetype;ppufile:tcompilerppufile);
  481. begin
  482. inherited ppuload(t,ppufile);
  483. assigntype:=tassigntype(ppufile.getbyte);
  484. end;
  485. procedure tassignmentnode.ppuwrite(ppufile:tcompilerppufile);
  486. begin
  487. inherited ppuwrite(ppufile);
  488. ppufile.putbyte(byte(assigntype));
  489. end;
  490. function tassignmentnode.getcopy : tnode;
  491. var
  492. n : tassignmentnode;
  493. begin
  494. n:=tassignmentnode(inherited getcopy);
  495. n.assigntype:=assigntype;
  496. getcopy:=n;
  497. end;
  498. function tassignmentnode.det_resulttype:tnode;
  499. var
  500. hp : tnode;
  501. useshelper : boolean;
  502. original_size : longint;
  503. begin
  504. result:=nil;
  505. resulttype:=voidtype;
  506. original_size := 0;
  507. { must be made unique }
  508. set_unique(left);
  509. resulttypepass(left);
  510. if is_ansistring(left.resulttype.def) then
  511. begin
  512. { fold <ansistring>:=<ansistring>+<char|shortstring|ansistring> }
  513. if (right.nodetype=addn) and
  514. left.isequal(tbinarynode(right).left) and
  515. { don't fold multiple concatenations else we could get trouble
  516. with multiple uses of s
  517. }
  518. (tbinarynode(right).left.nodetype<>addn) and
  519. (tbinarynode(right).right.nodetype<>addn) then
  520. begin
  521. { don't do a resulttypepass(right), since then the addnode }
  522. { may insert typeconversions that make this optimization }
  523. { opportunity quite difficult to detect (JM) }
  524. resulttypepass(tbinarynode(right).left);
  525. resulttypepass(tbinarynode(right).right);
  526. if (is_char(tbinarynode(right).right.resulttype.def) or
  527. is_shortstring(tbinarynode(right).right.resulttype.def) or
  528. is_ansistring(tbinarynode(right).right.resulttype.def)) then
  529. begin
  530. { remove property flag so it'll not trigger an error }
  531. exclude(left.flags,nf_isproperty);
  532. { generate call to helper }
  533. hp:=ccallparanode.create(tbinarynode(right).right,
  534. ccallparanode.create(left,nil));
  535. if is_char(tbinarynode(right).right.resulttype.def) then
  536. result:=ccallnode.createintern('fpc_ansistr_append_char',hp)
  537. else if is_shortstring(tbinarynode(right).right.resulttype.def) then
  538. result:=ccallnode.createintern('fpc_ansistr_append_shortstring',hp)
  539. else
  540. result:=ccallnode.createintern('fpc_ansistr_append_ansistring',hp);
  541. tbinarynode(right).right:=nil;
  542. left:=nil;
  543. exit;
  544. end;
  545. end;
  546. end
  547. else
  548. if is_shortstring(left.resulttype.def) then
  549. begin
  550. { fold <shortstring>:=<shortstring>+<shortstring>,
  551. <shortstring>+<char> is handled by an optimized node }
  552. if (right.nodetype=addn) and
  553. left.isequal(tbinarynode(right).left) and
  554. { don't fold multiple concatenations else we could get trouble
  555. with multiple uses of s }
  556. (tbinarynode(right).left.nodetype<>addn) and
  557. (tbinarynode(right).right.nodetype<>addn) then
  558. begin
  559. { don't do a resulttypepass(right), since then the addnode }
  560. { may insert typeconversions that make this optimization }
  561. { opportunity quite difficult to detect (JM) }
  562. resulttypepass(tbinarynode(right).left);
  563. resulttypepass(tbinarynode(right).right);
  564. if is_shortstring(tbinarynode(right).right.resulttype.def) then
  565. begin
  566. { remove property flag so it'll not trigger an error }
  567. exclude(left.flags,nf_isproperty);
  568. { generate call to helper }
  569. hp:=ccallparanode.create(tbinarynode(right).right,
  570. ccallparanode.create(left,nil));
  571. if is_shortstring(tbinarynode(right).right.resulttype.def) then
  572. result:=ccallnode.createintern('fpc_shortstr_append_shortstr',hp);
  573. tbinarynode(right).right:=nil;
  574. left:=nil;
  575. exit;
  576. end;
  577. end;
  578. end;
  579. resulttypepass(right);
  580. set_varstate(left,vs_assigned,false);
  581. set_varstate(right,vs_used,true);
  582. if codegenerror then
  583. exit;
  584. { assignments to formaldefs and open arrays aren't allowed }
  585. if (left.resulttype.def.deftype=formaldef) or
  586. is_open_array(left.resulttype.def) then
  587. CGMessage(type_e_operator_not_allowed);
  588. { test if node can be assigned, properties are allowed }
  589. valid_for_assignment(left);
  590. { assigning nil to a dynamic array clears the array }
  591. if is_dynamic_array(left.resulttype.def) and
  592. (right.nodetype=niln) then
  593. begin
  594. hp:=ccallparanode.create(caddrnode.create
  595. (crttinode.create(tstoreddef(left.resulttype.def),initrtti)),
  596. ccallparanode.create(ctypeconvnode.create_explicit(left,voidpointertype),nil));
  597. result := ccallnode.createintern('fpc_dynarray_clear',hp);
  598. left:=nil;
  599. exit;
  600. end;
  601. { shortstring helpers can do the conversion directly,
  602. so treat them separatly }
  603. if (is_shortstring(left.resulttype.def)) then
  604. begin
  605. { insert typeconv, except for chars that are handled in
  606. secondpass and except for ansi/wide string that can
  607. be converted immediatly }
  608. if not(is_char(right.resulttype.def) or
  609. (right.resulttype.def.deftype=stringdef)) then
  610. inserttypeconv(right,left.resulttype);
  611. if right.resulttype.def.deftype=stringdef then
  612. begin
  613. useshelper:=true;
  614. { convert constant strings to shortstrings. But
  615. skip empty constant strings, that will be handled
  616. in secondpass }
  617. if (right.nodetype=stringconstn) then
  618. begin
  619. { verify if range fits within shortstring }
  620. { just emit a warning, delphi gives an }
  621. { error, only if the type definition of }
  622. { of the string is less < 255 characters }
  623. if not is_open_string(left.resulttype.def) and
  624. (tstringconstnode(right).len > tstringdef(left.resulttype.def).len) then
  625. cgmessage(type_w_string_too_long);
  626. inserttypeconv(right,left.resulttype);
  627. if (tstringconstnode(right).len=0) then
  628. useshelper:=false;
  629. end;
  630. { rest is done in pass 1 (JM) }
  631. if useshelper then
  632. exit;
  633. end
  634. end
  635. else
  636. begin
  637. { get the size before the type conversion - check for all nodes }
  638. if assigned(right.resulttype.def) and (right.nodetype in [loadn,vecn,calln]) then
  639. original_size := right.resulttype.def.size;
  640. inserttypeconv(right,left.resulttype);
  641. end;
  642. { check if the assignment may cause a range check error }
  643. { if its not explicit, and only if the values are }
  644. { ordinals, enumdef and floatdef }
  645. if (right.nodetype = typeconvn) and
  646. not (nf_explicit in ttypeconvnode(right).flags) then
  647. begin
  648. if assigned(left.resulttype.def) and
  649. (left.resulttype.def.deftype in [enumdef,orddef,floatdef]) then
  650. begin
  651. if (original_size <> 0) and (left.resulttype.def.size < original_size) then
  652. begin
  653. if (cs_check_range in aktlocalswitches) then
  654. Message(type_w_smaller_possible_range_check)
  655. else
  656. Message(type_h_smaller_possible_range_check);
  657. end;
  658. end;
  659. end;
  660. { call helpers for interface }
  661. if is_interfacecom(left.resulttype.def) then
  662. begin
  663. hp:=ccallparanode.create(ctypeconvnode.create_explicit
  664. (right,voidpointertype),
  665. ccallparanode.create(ctypeconvnode.create_explicit
  666. (left,voidpointertype),nil));
  667. result:=ccallnode.createintern('fpc_intf_assign',hp);
  668. left:=nil;
  669. right:=nil;
  670. exit;
  671. end;
  672. { check if local proc/func is assigned to procvar }
  673. if right.resulttype.def.deftype=procvardef then
  674. test_local_to_procvar(tprocvardef(right.resulttype.def),left.resulttype.def);
  675. end;
  676. function tassignmentnode.pass_1 : tnode;
  677. var
  678. hp: tnode;
  679. begin
  680. result:=nil;
  681. expectloc:=LOC_VOID;
  682. firstpass(left);
  683. firstpass(right);
  684. { assignment to refcounted variable -> inc/decref }
  685. if (not is_class(left.resulttype.def) and
  686. left.resulttype.def.needs_inittable) then
  687. include(current_procinfo.flags,pi_do_call);
  688. if codegenerror then
  689. exit;
  690. if (is_shortstring(left.resulttype.def)) then
  691. begin
  692. if right.resulttype.def.deftype=stringdef then
  693. begin
  694. if (right.nodetype<>stringconstn) or
  695. (tstringconstnode(right).len<>0) then
  696. begin
  697. if (cs_optimize in aktglobalswitches) and
  698. (right.nodetype in [calln,blockn]) and
  699. (left.nodetype = temprefn) and
  700. is_shortstring(right.resulttype.def) and
  701. not is_open_string(left.resulttype.def) and
  702. (tstringdef(left.resulttype.def).len = 255) then
  703. begin
  704. { the blocknode case is handled in pass_2 at the temp }
  705. { reference level (mainly for callparatemp) (JM) }
  706. if (right.nodetype = calln) then
  707. begin
  708. tcallnode(right).funcretnode := left;
  709. result := right;
  710. end
  711. else
  712. exit;
  713. end
  714. else
  715. begin
  716. hp:=ccallparanode.create
  717. (right,
  718. ccallparanode.create(cinlinenode.create
  719. (in_high_x,false,left.getcopy),nil));
  720. result:=ccallnode.createinternreturn('fpc_'+tstringdef(right.resulttype.def).stringtypname+'_to_shortstr',hp,left);
  721. firstpass(result);
  722. end;
  723. left:=nil;
  724. right:=nil;
  725. exit;
  726. end;
  727. end;
  728. end;
  729. if (cs_optimize in aktglobalswitches) and
  730. (right.nodetype = calln) and
  731. { left must be a temp, since otherwise as soon as you modify the }
  732. { result, the current left node is modified and that one may }
  733. { still be an argument to the function or even accessed in the }
  734. { function }
  735. (((left.nodetype = temprefn) and
  736. paramanager.ret_in_param(right.resulttype.def,
  737. tcallnode(right).procdefinition.proccalloption)) or
  738. { there's special support for ansi/widestrings in the callnode }
  739. is_ansistring(right.resulttype.def) or
  740. is_widestring(right.resulttype.def)) then
  741. begin
  742. tcallnode(right).funcretnode := left;
  743. result := right;
  744. left := nil;
  745. right := nil;
  746. exit;
  747. end;
  748. registers32:=left.registers32+right.registers32;
  749. registersfpu:=max(left.registersfpu,right.registersfpu);
  750. {$ifdef SUPPORT_MMX}
  751. registersmmx:=max(left.registersmmx,right.registersmmx);
  752. {$endif SUPPORT_MMX}
  753. end;
  754. function tassignmentnode.docompare(p: tnode): boolean;
  755. begin
  756. docompare :=
  757. inherited docompare(p) and
  758. (assigntype = tassignmentnode(p).assigntype);
  759. end;
  760. {$ifdef state_tracking}
  761. function Tassignmentnode.track_state_pass(exec_known:boolean):boolean;
  762. var se:Tstate_entry;
  763. begin
  764. track_state_pass:=false;
  765. if exec_known then
  766. begin
  767. track_state_pass:=right.track_state_pass(exec_known);
  768. {Force a new resulttype pass.}
  769. right.resulttype.def:=nil;
  770. do_resulttypepass(right);
  771. resulttypepass(right);
  772. aktstate.store_fact(left.getcopy,right.getcopy);
  773. end
  774. else
  775. aktstate.delete_fact(left);
  776. end;
  777. {$endif}
  778. {*****************************************************************************
  779. TARRAYCONSTRUCTORRANGENODE
  780. *****************************************************************************}
  781. constructor tarrayconstructorrangenode.create(l,r : tnode);
  782. begin
  783. inherited create(arrayconstructorrangen,l,r);
  784. end;
  785. function tarrayconstructorrangenode.det_resulttype:tnode;
  786. begin
  787. result:=nil;
  788. resulttypepass(left);
  789. resulttypepass(right);
  790. set_varstate(left,vs_used,true);
  791. set_varstate(right,vs_used,true);
  792. if codegenerror then
  793. exit;
  794. resulttype:=left.resulttype;
  795. end;
  796. function tarrayconstructorrangenode.pass_1 : tnode;
  797. begin
  798. firstpass(left);
  799. firstpass(right);
  800. expectloc:=LOC_CREFERENCE;
  801. calcregisters(self,0,0,0);
  802. result:=nil;
  803. end;
  804. {****************************************************************************
  805. TARRAYCONSTRUCTORNODE
  806. *****************************************************************************}
  807. constructor tarrayconstructornode.create(l,r : tnode);
  808. begin
  809. inherited create(arrayconstructorn,l,r);
  810. end;
  811. function tarrayconstructornode.getcopy : tnode;
  812. var
  813. n : tarrayconstructornode;
  814. begin
  815. n:=tarrayconstructornode(inherited getcopy);
  816. result:=n;
  817. end;
  818. function tarrayconstructornode.det_resulttype:tnode;
  819. var
  820. htype : ttype;
  821. hp : tarrayconstructornode;
  822. len : longint;
  823. varia : boolean;
  824. begin
  825. result:=nil;
  826. { are we allowing array constructor? Then convert it to a set }
  827. if not allow_array_constructor then
  828. begin
  829. hp:=tarrayconstructornode(getcopy);
  830. arrayconstructor_to_set(tnode(hp));
  831. result:=hp;
  832. exit;
  833. end;
  834. { only pass left tree, right tree contains next construct if any }
  835. htype.reset;
  836. len:=0;
  837. varia:=false;
  838. if assigned(left) then
  839. begin
  840. hp:=self;
  841. while assigned(hp) do
  842. begin
  843. resulttypepass(hp.left);
  844. set_varstate(hp.left,vs_used,true);
  845. if (htype.def=nil) then
  846. htype:=hp.left.resulttype
  847. else
  848. begin
  849. if ((nf_novariaallowed in flags) or (not varia)) and
  850. (not equal_defs(htype.def,hp.left.resulttype.def)) then
  851. begin
  852. varia:=true;
  853. end;
  854. end;
  855. inc(len);
  856. hp:=tarrayconstructornode(hp.right);
  857. end;
  858. end;
  859. if not assigned(htype.def) then
  860. htype:=voidtype;
  861. resulttype.setdef(tarraydef.create(0,len-1,s32bittype));
  862. tarraydef(resulttype.def).setelementtype(htype);
  863. tarraydef(resulttype.def).IsConstructor:=true;
  864. tarraydef(resulttype.def).IsVariant:=varia;
  865. end;
  866. procedure tarrayconstructornode.force_type(tt:ttype);
  867. var
  868. hp : tarrayconstructornode;
  869. begin
  870. tarraydef(resulttype.def).setelementtype(tt);
  871. tarraydef(resulttype.def).IsConstructor:=true;
  872. tarraydef(resulttype.def).IsVariant:=false;
  873. if assigned(left) then
  874. begin
  875. hp:=self;
  876. while assigned(hp) do
  877. begin
  878. inserttypeconv(hp.left,tt);
  879. hp:=tarrayconstructornode(hp.right);
  880. end;
  881. end;
  882. end;
  883. procedure tarrayconstructornode.insert_typeconvs;
  884. var
  885. thp,
  886. chp,
  887. hp : tarrayconstructornode;
  888. dovariant : boolean;
  889. htype : ttype;
  890. orgflags : tnodeflags;
  891. begin
  892. dovariant:=(nf_forcevaria in flags) or tarraydef(resulttype.def).isvariant;
  893. { only pass left tree, right tree contains next construct if any }
  894. if assigned(left) then
  895. begin
  896. hp:=self;
  897. while assigned(hp) do
  898. begin
  899. resulttypepass(hp.left);
  900. { Insert typeconvs for array of const }
  901. if dovariant then
  902. begin
  903. case hp.left.resulttype.def.deftype of
  904. enumdef :
  905. hp.left:=ctypeconvnode.create_explicit(hp.left,s32bittype);
  906. arraydef :
  907. hp.left:=ctypeconvnode.create(hp.left,charpointertype);
  908. orddef :
  909. begin
  910. if is_integer(hp.left.resulttype.def) and
  911. not(is_64bitint(hp.left.resulttype.def)) then
  912. hp.left:=ctypeconvnode.create(hp.left,s32bittype);
  913. end;
  914. floatdef :
  915. begin
  916. { C uses 64bit floats }
  917. if nf_cargs in flags then
  918. hp.left:=ctypeconvnode.create(hp.left,s64floattype)
  919. else
  920. hp.left:=ctypeconvnode.create(hp.left,pbestrealtype^);
  921. end;
  922. stringdef :
  923. begin
  924. if nf_cargs in flags then
  925. hp.left:=ctypeconvnode.create(hp.left,charpointertype);
  926. end;
  927. procvardef :
  928. hp.left:=ctypeconvnode.create(hp.left,voidpointertype);
  929. variantdef,
  930. pointerdef,
  931. classrefdef,
  932. objectdef : ;
  933. else
  934. CGMessagePos1(hp.left.fileinfo,type_e_wrong_type_in_array_constructor,hp.left.resulttype.def.typename);
  935. end;
  936. end;
  937. resulttypepass(hp.left);
  938. hp:=tarrayconstructornode(hp.right);
  939. end;
  940. end;
  941. end;
  942. function tarrayconstructornode.pass_1 : tnode;
  943. var
  944. hp : tarrayconstructornode;
  945. begin
  946. result:=nil;
  947. { Insert required type convs, this must be
  948. done in pass 1, because the call must be
  949. resulttypepassed already }
  950. if assigned(left) then
  951. begin
  952. insert_typeconvs;
  953. { call firstpass for all nodes }
  954. hp:=self;
  955. while assigned(hp) do
  956. begin
  957. firstpass(hp.left);
  958. hp:=tarrayconstructornode(hp.right);
  959. end;
  960. end;
  961. expectloc:=LOC_CREFERENCE;
  962. calcregisters(self,0,0,0);
  963. end;
  964. function tarrayconstructornode.docompare(p: tnode): boolean;
  965. begin
  966. docompare :=
  967. inherited docompare(p);
  968. end;
  969. {*****************************************************************************
  970. TTYPENODE
  971. *****************************************************************************}
  972. constructor ttypenode.create(t : ttype);
  973. begin
  974. inherited create(typen);
  975. restype:=t;
  976. allowed:=false;
  977. end;
  978. constructor ttypenode.ppuload(t:tnodetype;ppufile:tcompilerppufile);
  979. begin
  980. inherited ppuload(t,ppufile);
  981. ppufile.gettype(restype);
  982. allowed:=boolean(ppufile.getbyte);
  983. end;
  984. procedure ttypenode.ppuwrite(ppufile:tcompilerppufile);
  985. begin
  986. inherited ppuwrite(ppufile);
  987. ppufile.puttype(restype);
  988. ppufile.putbyte(byte(allowed));
  989. end;
  990. procedure ttypenode.derefimpl;
  991. begin
  992. inherited derefimpl;
  993. restype.resolve;
  994. end;
  995. function ttypenode.det_resulttype:tnode;
  996. begin
  997. result:=nil;
  998. resulttype:=restype;
  999. { check if it's valid }
  1000. if restype.def.deftype = errordef then
  1001. CGMessage(cg_e_illegal_expression);
  1002. end;
  1003. function ttypenode.pass_1 : tnode;
  1004. begin
  1005. result:=nil;
  1006. expectloc:=LOC_VOID;
  1007. { a typenode can't generate code, so we give here
  1008. an error. Else it'll be an abstract error in pass_2.
  1009. Only when the allowed flag is set we don't generate
  1010. an error }
  1011. if not allowed then
  1012. Message(parser_e_no_type_not_allowed_here);
  1013. end;
  1014. function ttypenode.docompare(p: tnode): boolean;
  1015. begin
  1016. docompare :=
  1017. inherited docompare(p);
  1018. end;
  1019. {*****************************************************************************
  1020. TRTTINODE
  1021. *****************************************************************************}
  1022. constructor trttinode.create(def:tstoreddef;rt:trttitype);
  1023. begin
  1024. inherited create(rttin);
  1025. rttidef:=def;
  1026. rttitype:=rt;
  1027. end;
  1028. constructor trttinode.ppuload(t:tnodetype;ppufile:tcompilerppufile);
  1029. begin
  1030. inherited ppuload(t,ppufile);
  1031. ppufile.getderef(rttidefderef);
  1032. rttitype:=trttitype(ppufile.getbyte);
  1033. end;
  1034. procedure trttinode.ppuwrite(ppufile:tcompilerppufile);
  1035. begin
  1036. inherited ppuwrite(ppufile);
  1037. ppufile.putderef(rttidef,rttidefderef);
  1038. ppufile.putbyte(byte(rttitype));
  1039. end;
  1040. procedure trttinode.derefimpl;
  1041. begin
  1042. inherited derefimpl;
  1043. rttidef:=tstoreddef(rttidefderef.resolve);
  1044. end;
  1045. function trttinode.getcopy : tnode;
  1046. var
  1047. n : trttinode;
  1048. begin
  1049. n:=trttinode(inherited getcopy);
  1050. n.rttidef:=rttidef;
  1051. n.rttitype:=rttitype;
  1052. result:=n;
  1053. end;
  1054. function trttinode.det_resulttype:tnode;
  1055. begin
  1056. { rtti information will be returned as a void pointer }
  1057. result:=nil;
  1058. resulttype:=voidpointertype;
  1059. end;
  1060. function trttinode.pass_1 : tnode;
  1061. begin
  1062. result:=nil;
  1063. expectloc:=LOC_CREFERENCE;
  1064. end;
  1065. function trttinode.docompare(p: tnode): boolean;
  1066. begin
  1067. docompare :=
  1068. inherited docompare(p) and
  1069. (rttidef = trttinode(p).rttidef) and
  1070. (rttitype = trttinode(p).rttitype);
  1071. end;
  1072. procedure trttinode.pass_2;
  1073. begin
  1074. location_reset(location,LOC_CREFERENCE,OS_NO);
  1075. location.reference.symbol:=rttidef.get_rtti_label(rttitype);
  1076. end;
  1077. begin
  1078. cloadnode:=tloadnode;
  1079. cassignmentnode:=tassignmentnode;
  1080. carrayconstructorrangenode:=tarrayconstructorrangenode;
  1081. carrayconstructornode:=tarrayconstructornode;
  1082. ctypenode:=ttypenode;
  1083. crttinode:=trttinode;
  1084. end.
  1085. {
  1086. $Log$
  1087. Revision 1.110 2003-10-08 19:19:45 peter
  1088. * set_varstate cleanup
  1089. Revision 1.109 2003/10/05 21:21:52 peter
  1090. * c style array of const generates callparanodes
  1091. * varargs paraloc fixes
  1092. Revision 1.108 2003/10/01 20:34:48 peter
  1093. * procinfo unit contains tprocinfo
  1094. * cginfo renamed to cgbase
  1095. * moved cgmessage to verbose
  1096. * fixed ppc and sparc compiles
  1097. Revision 1.107 2003/09/28 17:55:03 peter
  1098. * parent framepointer changed to hidden parameter
  1099. * tloadparentfpnode added
  1100. Revision 1.106 2003/09/23 17:56:05 peter
  1101. * locals and paras are allocated in the code generation
  1102. * tvarsym.localloc contains the location of para/local when
  1103. generating code for the current procedure
  1104. Revision 1.105 2003/09/16 16:17:01 peter
  1105. * varspez in calls to push_addr_param
  1106. Revision 1.104 2003/09/07 22:09:35 peter
  1107. * preparations for different default calling conventions
  1108. * various RA fixes
  1109. Revision 1.103 2003/07/08 15:20:56 peter
  1110. * don't allow add/assignments for formaldef
  1111. * formaldef size changed to 0
  1112. Revision 1.102 2003/06/13 21:19:30 peter
  1113. * current_procdef removed, use current_procinfo.procdef instead
  1114. Revision 1.101 2003/06/08 20:01:53 jonas
  1115. * optimized assignments with on the right side a function that returns
  1116. an ansi- or widestring
  1117. Revision 1.100 2003/06/08 18:27:15 jonas
  1118. + ability to change the location of a ttempref node with changelocation()
  1119. method. Useful to use instead of copying the contents from one temp to
  1120. another
  1121. + some shortstring optimizations in tassignmentnode that avoid some
  1122. copying (required some shortstring optimizations to be moved from
  1123. resulttype to firstpass, because they work on callnodes and string
  1124. addnodes are only changed to callnodes in the firstpass)
  1125. * allow setting/changing the funcretnode of callnodes after the
  1126. resulttypepass has been done, funcretnode is now a property
  1127. (all of the above should have a quite big effect on callparatemp)
  1128. Revision 1.99 2003/06/07 20:26:32 peter
  1129. * re-resolving added instead of reloading from ppu
  1130. * tderef object added to store deref info for resolving
  1131. Revision 1.98 2003/06/07 18:57:04 jonas
  1132. + added freeintparaloc
  1133. * ppc get/freeintparaloc now check whether the parameter regs are
  1134. properly allocated/deallocated (and get an extra list para)
  1135. * ppc a_call_* now internalerrors if pi_do_call is not yet set
  1136. * fixed lot of missing pi_do_call's
  1137. Revision 1.97 2003/06/07 14:39:18 jonas
  1138. * set pi_do_call for accesses to threadvars
  1139. Revision 1.96 2003/05/26 19:38:28 peter
  1140. * generic fpc_shorstr_concat
  1141. + fpc_shortstr_append_shortstr optimization
  1142. Revision 1.95 2003/05/23 17:05:13 peter
  1143. * loadn procsym need to return procdef
  1144. Revision 1.94 2003/05/23 14:27:35 peter
  1145. * remove some unit dependencies
  1146. * current_procinfo changes to store more info
  1147. Revision 1.93 2003/05/11 21:37:03 peter
  1148. * moved implicit exception frame from ncgutil to psub
  1149. * constructor/destructor helpers moved from cobj/ncgutil to psub
  1150. Revision 1.92 2003/05/11 14:45:12 peter
  1151. * tloadnode does not support objectsymtable,withsymtable anymore
  1152. * withnode cleanup
  1153. * direct with rewritten to use temprefnode
  1154. Revision 1.91 2003/05/09 17:47:02 peter
  1155. * self moved to hidden parameter
  1156. * removed hdisposen,hnewn,selfn
  1157. Revision 1.90 2003/04/27 11:21:33 peter
  1158. * aktprocdef renamed to current_procinfo.procdef
  1159. * procinfo renamed to current_procinfo
  1160. * procinfo will now be stored in current_module so it can be
  1161. cleaned up properly
  1162. * gen_main_procsym changed to create_main_proc and release_main_proc
  1163. to also generate a tprocinfo structure
  1164. * fixed unit implicit initfinal
  1165. Revision 1.89 2003/04/27 07:29:50 peter
  1166. * current_procinfo.procdef cleanup, current_procdef is now always nil when parsing
  1167. a new procdef declaration
  1168. * aktprocsym removed
  1169. * lexlevel removed, use symtable.symtablelevel instead
  1170. * implicit init/final code uses the normal genentry/genexit
  1171. * funcret state checking updated for new funcret handling
  1172. Revision 1.88 2003/04/26 00:28:42 peter
  1173. * removed load_funcret
  1174. Revision 1.87 2003/04/25 20:59:33 peter
  1175. * removed funcretn,funcretsym, function result is now in varsym
  1176. and aliases for result and function name are added using absolutesym
  1177. * vs_hidden parameter for funcret passed in parameter
  1178. * vs_hidden fixes
  1179. * writenode changed to printnode and released from extdebug
  1180. * -vp option added to generate a tree.log with the nodetree
  1181. * nicer printnode for statements, callnode
  1182. Revision 1.86 2003/04/23 20:16:04 peter
  1183. + added currency support based on int64
  1184. + is_64bit for use in cg units instead of is_64bitint
  1185. * removed cgmessage from n386add, replace with internalerrors
  1186. Revision 1.85 2003/04/23 10:10:54 peter
  1187. * procvar is not compared in addrn
  1188. Revision 1.84 2003/04/22 23:50:23 peter
  1189. * firstpass uses expectloc
  1190. * checks if there are differences between the expectloc and
  1191. location.loc from secondpass in EXTDEBUG
  1192. Revision 1.83 2003/04/11 15:01:23 peter
  1193. * fix bug 2438
  1194. Revision 1.82 2003/03/28 19:16:56 peter
  1195. * generic constructor working for i386
  1196. * remove fixed self register
  1197. * esi added as address register for i386
  1198. Revision 1.81 2003/03/11 21:46:24 jonas
  1199. * lots of new regallocator fixes, both in generic and ppc-specific code
  1200. (ppc compiler still can't compile the linux system unit though)
  1201. Revision 1.80 2003/01/07 16:52:58 jonas
  1202. * fixed ansistring+char and ansistring+shortstring optimizations (those
  1203. cases were always handled as ansistring+ansistring due to
  1204. typeconversions inserted by the add-node)
  1205. Revision 1.79 2003/01/05 22:44:14 peter
  1206. * remove a lot of code to support typen in loadn-procsym
  1207. Revision 1.78 2003/01/03 12:15:56 daniel
  1208. * Removed ifdefs around notifications
  1209. ifdefs around for loop optimizations remain
  1210. Revision 1.77 2002/12/31 09:55:58 daniel
  1211. + Notification implementation complete
  1212. + Add for loop code optimization using notifications
  1213. results in 1.5-1.9% speed improvement in nestloop benchmark
  1214. Optimization incomplete, compiler does not cycle yet with
  1215. notifications enabled.
  1216. Revision 1.76 2002/12/30 22:44:53 daniel
  1217. * Some work on notifications
  1218. Revision 1.75 2002/12/27 15:27:25 peter
  1219. * remove property indicator when calling internal helpers
  1220. Revision 1.74 2002/12/24 16:53:19 peter
  1221. * fix for tb0438
  1222. Revision 1.73 2002/12/20 18:14:53 peter
  1223. * fix result of high_tree when high was not available
  1224. Revision 1.72 2002/12/17 22:19:33 peter
  1225. * fixed pushing of records>8 bytes with stdcall
  1226. * simplified hightree loading
  1227. Revision 1.71 2002/12/07 14:27:07 carl
  1228. * 3% memory optimization
  1229. * changed some types
  1230. + added type checking with different size for call node and for
  1231. parameters
  1232. Revision 1.70 2002/12/02 19:38:06 carl
  1233. * fix some errors
  1234. Revision 1.69 2002/11/29 20:02:44 carl
  1235. * warning / hint for possible loss of data in assignment
  1236. Revision 1.68 2002/11/27 20:04:39 peter
  1237. * cdecl array of const fixes
  1238. Revision 1.67 2002/11/27 15:33:47 peter
  1239. * the never ending story of tp procvar hacks
  1240. Revision 1.66 2002/11/25 17:43:20 peter
  1241. * splitted defbase in defutil,symutil,defcmp
  1242. * merged isconvertable and is_equal into compare_defs(_ext)
  1243. * made operator search faster by walking the list only once
  1244. Revision 1.65 2002/11/18 17:31:57 peter
  1245. * pass proccalloption to ret_in_xxx and push_xxx functions
  1246. Revision 1.64 2002/11/15 01:58:52 peter
  1247. * merged changes from 1.0.7 up to 04-11
  1248. - -V option for generating bug report tracing
  1249. - more tracing for option parsing
  1250. - errors for cdecl and high()
  1251. - win32 import stabs
  1252. - win32 records<=8 are returned in eax:edx (turned off by default)
  1253. - heaptrc update
  1254. - more info for temp management in .s file with EXTDEBUG
  1255. Revision 1.63 2002/10/17 12:44:09 florian
  1256. + s:=s+<string type> where s is an ansistring is done via calls to append_ansistring_*
  1257. Revision 1.62 2002/10/05 12:43:25 carl
  1258. * fixes for Delphi 6 compilation
  1259. (warning : Some features do not work under Delphi)
  1260. Revision 1.61 2002/10/03 21:26:08 carl
  1261. + compile-time range checking for strings
  1262. Revision 1.60 2002/09/27 21:13:28 carl
  1263. * low-highval always checked if limit ober 2GB is reached (to avoid overflow)
  1264. Revision 1.59 2002/09/26 15:02:05 florian
  1265. + support of passing variants to "array of const"
  1266. Revision 1.58 2002/09/07 15:25:03 peter
  1267. * old logs removed and tabs fixed
  1268. Revision 1.57 2002/09/03 16:26:26 daniel
  1269. * Make Tprocdef.defs protected
  1270. Revision 1.56 2002/09/01 13:28:37 daniel
  1271. - write_access fields removed in favor of a flag
  1272. Revision 1.55 2002/09/01 08:01:16 daniel
  1273. * Removed sets from Tcallnode.det_resulttype
  1274. + Added read/write notifications of variables. These will be usefull
  1275. for providing information for several optimizations. For example
  1276. the value of the loop variable of a for loop does matter is the
  1277. variable is read after the for loop, but if it's no longer used
  1278. or written, it doesn't matter and this can be used to optimize
  1279. the loop code generation.
  1280. Revision 1.54 2002/08/25 19:25:19 peter
  1281. * sym.insert_in_data removed
  1282. * symtable.insertvardata/insertconstdata added
  1283. * removed insert_in_data call from symtable.insert, it needs to be
  1284. called separatly. This allows to deref the address calculation
  1285. * procedures now calculate the parast addresses after the procedure
  1286. directives are parsed. This fixes the cdecl parast problem
  1287. * push_addr_param has an extra argument that specifies if cdecl is used
  1288. or not
  1289. Revision 1.53 2002/08/19 19:36:43 peter
  1290. * More fixes for cross unit inlining, all tnodes are now implemented
  1291. * Moved pocall_internconst to po_internconst because it is not a
  1292. calling type at all and it conflicted when inlining of these small
  1293. functions was requested
  1294. Revision 1.52 2002/08/18 20:06:23 peter
  1295. * inlining is now also allowed in interface
  1296. * renamed write/load to ppuwrite/ppuload
  1297. * tnode storing in ppu
  1298. * nld,ncon,nbas are already updated for storing in ppu
  1299. Revision 1.51 2002/08/17 22:09:46 florian
  1300. * result type handling in tcgcal.pass_2 overhauled
  1301. * better tnode.dowrite
  1302. * some ppc stuff fixed
  1303. Revision 1.50 2002/08/17 09:23:37 florian
  1304. * first part of procinfo rewrite
  1305. Revision 1.49 2002/07/20 11:57:54 florian
  1306. * types.pas renamed to defbase.pas because D6 contains a types
  1307. unit so this would conflicts if D6 programms are compiled
  1308. + Willamette/SSE2 instructions to assembler added
  1309. Revision 1.48 2002/07/20 07:44:37 daniel
  1310. * Forgot to add a $ifdef extdebug
  1311. Revision 1.47 2002/07/19 12:55:27 daniel
  1312. * Further developed state tracking in whilerepeatn
  1313. Revision 1.46 2002/07/19 11:41:36 daniel
  1314. * State tracker work
  1315. * The whilen and repeatn are now completely unified into whilerepeatn. This
  1316. allows the state tracker to change while nodes automatically into
  1317. repeat nodes.
  1318. * Resulttypepass improvements to the notn. 'not not a' is optimized away and
  1319. 'not(a>b)' is optimized into 'a<=b'.
  1320. * Resulttypepass improvements to the whilerepeatn. 'while not a' is optimized
  1321. by removing the notn and later switchting the true and falselabels. The
  1322. same is done with 'repeat until not a'.
  1323. Revision 1.45 2002/07/15 18:03:15 florian
  1324. * readded removed changes
  1325. Revision 1.43 2002/07/11 14:41:28 florian
  1326. * start of the new generic parameter handling
  1327. Revision 1.44 2002/07/14 18:00:44 daniel
  1328. + Added the beginning of a state tracker. This will track the values of
  1329. variables through procedures and optimize things away.
  1330. Revision 1.42 2002/05/18 13:34:10 peter
  1331. * readded missing revisions
  1332. Revision 1.41 2002/05/16 19:46:38 carl
  1333. + defines.inc -> fpcdefs.inc to avoid conflicts if compiling by hand
  1334. + try to fix temp allocation (still in ifdef)
  1335. + generic constructor calls
  1336. + start of tassembler / tmodulebase class cleanup
  1337. Revision 1.39 2002/05/12 16:53:07 peter
  1338. * moved entry and exitcode to ncgutil and cgobj
  1339. * foreach gets extra argument for passing local data to the
  1340. iterator function
  1341. * -CR checks also class typecasts at runtime by changing them
  1342. into as
  1343. * fixed compiler to cycle with the -CR option
  1344. * fixed stabs with elf writer, finally the global variables can
  1345. be watched
  1346. * removed a lot of routines from cga unit and replaced them by
  1347. calls to cgobj
  1348. * u32bit-s32bit updates for and,or,xor nodes. When one element is
  1349. u32bit then the other is typecasted also to u32bit without giving
  1350. a rangecheck warning/error.
  1351. * fixed pascal calling method with reversing also the high tree in
  1352. the parast, detected by tcalcst3 test
  1353. Revision 1.38 2002/04/25 20:16:39 peter
  1354. * moved more routines from cga/n386util
  1355. Revision 1.37 2002/04/23 19:16:34 peter
  1356. * add pinline unit that inserts compiler supported functions using
  1357. one or more statements
  1358. * moved finalize and setlength from ninl to pinline
  1359. }