tcmem.pas 24 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697
  1. {
  2. $Id$
  3. Copyright (c) 1993-98 by Florian Klaempfl
  4. Type checking and register allocation for memory related 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 tcmem;
  19. interface
  20. uses
  21. tree;
  22. procedure firstloadvmt(var p : ptree);
  23. procedure firsthnew(var p : ptree);
  24. procedure firstnew(var p : ptree);
  25. procedure firsthdispose(var p : ptree);
  26. procedure firstsimplenewdispose(var p : ptree);
  27. procedure firstaddr(var p : ptree);
  28. procedure firstdoubleaddr(var p : ptree);
  29. procedure firstderef(var p : ptree);
  30. procedure firstsubscript(var p : ptree);
  31. procedure firstvec(var p : ptree);
  32. procedure firstself(var p : ptree);
  33. procedure firstwith(var p : ptree);
  34. implementation
  35. uses
  36. globtype,systems,
  37. cobjects,verbose,globals,
  38. symconst,symtable,aasm,types,
  39. hcodegen,htypechk,pass_1,cpubase;
  40. {*****************************************************************************
  41. FirstLoadVMT
  42. *****************************************************************************}
  43. procedure firstloadvmt(var p : ptree);
  44. begin
  45. p^.registers32:=1;
  46. p^.location.loc:=LOC_REGISTER;
  47. end;
  48. {*****************************************************************************
  49. FirstHNew
  50. *****************************************************************************}
  51. procedure firsthnew(var p : ptree);
  52. begin
  53. end;
  54. {*****************************************************************************
  55. FirstNewN
  56. *****************************************************************************}
  57. procedure firstnew(var p : ptree);
  58. begin
  59. { Standardeinleitung }
  60. if assigned(p^.left) then
  61. firstpass(p^.left);
  62. if codegenerror then
  63. exit;
  64. if assigned(p^.left) then
  65. begin
  66. p^.registers32:=p^.left^.registers32;
  67. p^.registersfpu:=p^.left^.registersfpu;
  68. {$ifdef SUPPORT_MMX}
  69. p^.registersmmx:=p^.left^.registersmmx;
  70. {$endif SUPPORT_MMX}
  71. end;
  72. { result type is already set }
  73. procinfo.flags:=procinfo.flags or pi_do_call;
  74. if assigned(p^.left) then
  75. p^.location.loc:=LOC_REGISTER
  76. else
  77. p^.location.loc:=LOC_REFERENCE;
  78. end;
  79. {*****************************************************************************
  80. FirstDispose
  81. *****************************************************************************}
  82. procedure firsthdispose(var p : ptree);
  83. begin
  84. firstpass(p^.left);
  85. if codegenerror then
  86. exit;
  87. p^.registers32:=p^.left^.registers32;
  88. p^.registersfpu:=p^.left^.registersfpu;
  89. {$ifdef SUPPORT_MMX}
  90. p^.registersmmx:=p^.left^.registersmmx;
  91. {$endif SUPPORT_MMX}
  92. if p^.registers32<1 then
  93. p^.registers32:=1;
  94. {
  95. if p^.left^.location.loc<>LOC_REFERENCE then
  96. CGMessage(cg_e_illegal_expression);
  97. }
  98. p^.location.loc:=LOC_REFERENCE;
  99. p^.resulttype:=ppointerdef(p^.left^.resulttype)^.definition;
  100. end;
  101. {*****************************************************************************
  102. FirstSimpleNewDispose
  103. *****************************************************************************}
  104. procedure firstsimplenewdispose(var p : ptree);
  105. begin
  106. { this cannot be in a register !! }
  107. make_not_regable(p^.left);
  108. firstpass(p^.left);
  109. if codegenerror then
  110. exit;
  111. { check the type }
  112. if p^.left^.resulttype=nil then
  113. p^.left^.resulttype:=generrordef;
  114. if (p^.left^.resulttype^.deftype<>pointerdef) then
  115. CGMessage1(type_e_pointer_type_expected,p^.left^.resulttype^.typename);
  116. if (p^.left^.location.loc<>LOC_REFERENCE) {and
  117. (p^.left^.location.loc<>LOC_CREGISTER)} then
  118. CGMessage(cg_e_illegal_expression);
  119. p^.registers32:=p^.left^.registers32;
  120. p^.registersfpu:=p^.left^.registersfpu;
  121. {$ifdef SUPPORT_MMX}
  122. p^.registersmmx:=p^.left^.registersmmx;
  123. {$endif SUPPORT_MMX}
  124. p^.resulttype:=voiddef;
  125. procinfo.flags:=procinfo.flags or pi_do_call;
  126. end;
  127. {*****************************************************************************
  128. FirstAddr
  129. *****************************************************************************}
  130. procedure firstaddr(var p : ptree);
  131. var
  132. hp : ptree;
  133. hp2 : pdefcoll;
  134. store_valid : boolean;
  135. hp3 : pabstractprocdef;
  136. begin
  137. make_not_regable(p^.left);
  138. if not(assigned(p^.resulttype)) then
  139. begin
  140. { proc/procvar 2 procvar ? }
  141. if p^.left^.treetype=calln then
  142. begin
  143. { is it a procvar, this is needed for @procvar in tp mode ! }
  144. if assigned(p^.left^.right) then
  145. begin
  146. { just return the load of the procvar, remove the
  147. addrn and calln nodes }
  148. hp:=p^.left^.right;
  149. putnode(p^.left);
  150. putnode(p);
  151. firstpass(hp);
  152. p:=hp;
  153. exit;
  154. end
  155. else
  156. begin
  157. { generate a methodcallnode or proccallnode }
  158. if (p^.left^.symtableprocentry^.owner^.symtabletype=objectsymtable) and
  159. (pobjectdef(p^.left^.symtableprocentry^.owner^.defowner)^.is_class) then
  160. begin
  161. hp:=genloadmethodcallnode(pprocsym(p^.left^.symtableprocentry),p^.left^.symtableproc,
  162. getcopy(p^.left^.methodpointer));
  163. disposetree(p);
  164. firstpass(hp);
  165. p:=hp;
  166. exit;
  167. end
  168. else
  169. hp:=genloadcallnode(pprocsym(p^.left^.symtableprocentry),p^.left^.symtableproc);
  170. end;
  171. { result is a procedure variable }
  172. { No, to be TP compatible, you must return a pointer to
  173. the procedure that is stored in the procvar.}
  174. if not(m_tp_procvar in aktmodeswitches) then
  175. begin
  176. p^.resulttype:=new(pprocvardef,init);
  177. { it could also be a procvar, not only pprocsym ! }
  178. if p^.left^.symtableprocentry^.typ=varsym then
  179. hp3:=pabstractprocdef(pvarsym(p^.left^.symtableentry)^.definition)
  180. else
  181. hp3:=pabstractprocdef(pprocsym(p^.left^.symtableprocentry)^.definition);
  182. pprocvardef(p^.resulttype)^.proctypeoption:=hp3^.proctypeoption;
  183. pprocvardef(p^.resulttype)^.proccalloptions:=hp3^.proccalloptions;
  184. pprocvardef(p^.resulttype)^.procoptions:=hp3^.procoptions;
  185. pprocvardef(p^.resulttype)^.retdef:=hp3^.retdef;
  186. pprocvardef(p^.resulttype)^.symtablelevel:=hp3^.symtablelevel;
  187. { method ? then set the methodpointer flag }
  188. if (hp3^.owner^.symtabletype=objectsymtable) and
  189. (pobjectdef(hp3^.owner^.defowner)^.is_class) then
  190. {$ifdef INCLUDEOK}
  191. include(pprocvardef(p^.resulttype)^.procoptions,po_methodpointer);
  192. {$else}
  193. pprocvardef(p^.resulttype)^.procoptions:=pprocvardef(p^.resulttype)^.procoptions+[po_methodpointer];
  194. {$endif}
  195. hp2:=hp3^.para1;
  196. while assigned(hp2) do
  197. begin
  198. pprocvardef(p^.resulttype)^.concatdef(hp2^.data,hp2^.paratyp);
  199. hp2:=hp2^.next;
  200. end;
  201. end
  202. else
  203. p^.resulttype:=voidpointerdef;
  204. disposetree(p^.left);
  205. p^.left:=hp;
  206. end
  207. else
  208. begin
  209. { what are we getting the address from an absolute sym? }
  210. hp:=p^.left;
  211. while assigned(hp) and (hp^.treetype in [vecn,subscriptn]) do
  212. hp:=hp^.left;
  213. if assigned(hp) and (hp^.treetype=loadn) and
  214. ((hp^.symtableentry^.typ=absolutesym) and
  215. pabsolutesym(hp^.symtableentry)^.absseg) then
  216. begin
  217. if not(cs_typed_addresses in aktlocalswitches) then
  218. p^.resulttype:=voidfarpointerdef
  219. else
  220. p^.resulttype:=new(ppointerdef,initfar(p^.left^.resulttype));
  221. end
  222. else
  223. begin
  224. if not(cs_typed_addresses in aktlocalswitches) then
  225. p^.resulttype:=voidpointerdef
  226. else
  227. p^.resulttype:=new(ppointerdef,init(p^.left^.resulttype));
  228. end;
  229. end;
  230. end;
  231. store_valid:=must_be_valid;
  232. must_be_valid:=false;
  233. firstpass(p^.left);
  234. must_be_valid:=store_valid;
  235. if codegenerror then
  236. exit;
  237. { don't allow constants }
  238. if is_constnode(p^.left) then
  239. begin
  240. aktfilepos:=p^.left^.fileinfo;
  241. CGMessage(type_e_no_addr_of_constant);
  242. end
  243. else
  244. begin
  245. { we should allow loc_mem for @string }
  246. if not(p^.left^.location.loc in [LOC_MEM,LOC_REFERENCE]) then
  247. begin
  248. aktfilepos:=p^.left^.fileinfo;
  249. CGMessage(cg_e_illegal_expression);
  250. end;
  251. end;
  252. p^.registers32:=p^.left^.registers32;
  253. p^.registersfpu:=p^.left^.registersfpu;
  254. {$ifdef SUPPORT_MMX}
  255. p^.registersmmx:=p^.left^.registersmmx;
  256. {$endif SUPPORT_MMX}
  257. if p^.registers32<1 then
  258. p^.registers32:=1;
  259. p^.location.loc:=LOC_REGISTER;
  260. end;
  261. {*****************************************************************************
  262. FirstDoubleAddr
  263. *****************************************************************************}
  264. procedure firstdoubleaddr(var p : ptree);
  265. begin
  266. make_not_regable(p^.left);
  267. firstpass(p^.left);
  268. if p^.resulttype=nil then
  269. p^.resulttype:=voidpointerdef;
  270. if codegenerror then
  271. exit;
  272. if (p^.left^.resulttype^.deftype)<>procvardef then
  273. CGMessage(cg_e_illegal_expression);
  274. if (p^.left^.location.loc<>LOC_REFERENCE) then
  275. CGMessage(cg_e_illegal_expression);
  276. p^.registers32:=p^.left^.registers32;
  277. p^.registersfpu:=p^.left^.registersfpu;
  278. {$ifdef SUPPORT_MMX}
  279. p^.registersmmx:=p^.left^.registersmmx;
  280. {$endif SUPPORT_MMX}
  281. if p^.registers32<1 then
  282. p^.registers32:=1;
  283. p^.location.loc:=LOC_REGISTER;
  284. end;
  285. {*****************************************************************************
  286. FirstDeRef
  287. *****************************************************************************}
  288. procedure firstderef(var p : ptree);
  289. begin
  290. firstpass(p^.left);
  291. if codegenerror then
  292. begin
  293. p^.resulttype:=generrordef;
  294. exit;
  295. end;
  296. p^.registers32:=max(p^.left^.registers32,1);
  297. p^.registersfpu:=p^.left^.registersfpu;
  298. {$ifdef SUPPORT_MMX}
  299. p^.registersmmx:=p^.left^.registersmmx;
  300. {$endif SUPPORT_MMX}
  301. if p^.left^.resulttype^.deftype<>pointerdef then
  302. CGMessage(cg_e_invalid_qualifier);
  303. p^.resulttype:=ppointerdef(p^.left^.resulttype)^.definition;
  304. p^.location.loc:=LOC_REFERENCE;
  305. end;
  306. {*****************************************************************************
  307. FirstSubScript
  308. *****************************************************************************}
  309. procedure firstsubscript(var p : ptree);
  310. begin
  311. firstpass(p^.left);
  312. if codegenerror then
  313. begin
  314. p^.resulttype:=generrordef;
  315. exit;
  316. end;
  317. p^.resulttype:=p^.vs^.definition;
  318. { this must be done in the parser
  319. if count_ref and not must_be_valid then
  320. if (p^.vs^.properties and sp_protected)<>0 then
  321. CGMessage(parser_e_cant_write_protected_member);
  322. }
  323. p^.registers32:=p^.left^.registers32;
  324. p^.registersfpu:=p^.left^.registersfpu;
  325. {$ifdef SUPPORT_MMX}
  326. p^.registersmmx:=p^.left^.registersmmx;
  327. {$endif SUPPORT_MMX}
  328. { classes must be dereferenced implicit }
  329. if (p^.left^.resulttype^.deftype=objectdef) and
  330. pobjectdef(p^.left^.resulttype)^.is_class then
  331. begin
  332. if p^.registers32=0 then
  333. p^.registers32:=1;
  334. p^.location.loc:=LOC_REFERENCE;
  335. end
  336. else
  337. begin
  338. if (p^.left^.location.loc<>LOC_MEM) and
  339. (p^.left^.location.loc<>LOC_REFERENCE) then
  340. CGMessage(cg_e_illegal_expression);
  341. set_location(p^.location,p^.left^.location);
  342. end;
  343. end;
  344. {*****************************************************************************
  345. FirstVec
  346. *****************************************************************************}
  347. procedure firstvec(var p : ptree);
  348. var
  349. harr : pdef;
  350. ct : tconverttype;
  351. {$ifdef consteval}
  352. tcsym : ptypedconstsym;
  353. {$endif}
  354. begin
  355. firstpass(p^.left);
  356. firstpass(p^.right);
  357. if codegenerror then
  358. exit;
  359. { range check only for arrays }
  360. if (p^.left^.resulttype^.deftype=arraydef) then
  361. begin
  362. if (isconvertable(p^.right^.resulttype,parraydef(p^.left^.resulttype)^.rangedef,
  363. ct,ordconstn,false)=0) and
  364. not(is_equal(p^.right^.resulttype,parraydef(p^.left^.resulttype)^.rangedef)) then
  365. CGMessage(type_e_mismatch);
  366. end;
  367. { Never convert a boolean or a char !}
  368. { maybe type conversion }
  369. if (p^.right^.resulttype^.deftype<>enumdef) and
  370. not(is_char(p^.right^.resulttype)) and
  371. not(is_boolean(p^.right^.resulttype)) then
  372. begin
  373. p^.right:=gentypeconvnode(p^.right,s32bitdef);
  374. firstpass(p^.right);
  375. if codegenerror then
  376. exit;
  377. end;
  378. { determine return type }
  379. if not assigned(p^.resulttype) then
  380. if p^.left^.resulttype^.deftype=arraydef then
  381. p^.resulttype:=parraydef(p^.left^.resulttype)^.definition
  382. else if (p^.left^.resulttype^.deftype=pointerdef) then
  383. begin
  384. { convert pointer to array }
  385. harr:=new(parraydef,init(0,$7fffffff,s32bitdef));
  386. parraydef(harr)^.definition:=ppointerdef(p^.left^.resulttype)^.definition;
  387. p^.left:=gentypeconvnode(p^.left,harr);
  388. firstpass(p^.left);
  389. if codegenerror then
  390. exit;
  391. p^.resulttype:=parraydef(harr)^.definition
  392. end
  393. else if p^.left^.resulttype^.deftype=stringdef then
  394. begin
  395. { indexed access to strings }
  396. case pstringdef(p^.left^.resulttype)^.string_typ of
  397. {
  398. st_widestring : p^.resulttype:=cwchardef;
  399. }
  400. st_ansistring : p^.resulttype:=cchardef;
  401. st_longstring : p^.resulttype:=cchardef;
  402. st_shortstring : p^.resulttype:=cchardef;
  403. end;
  404. end
  405. else
  406. CGMessage(type_e_mismatch);
  407. { the register calculation is easy if a const index is used }
  408. if p^.right^.treetype=ordconstn then
  409. begin
  410. {$ifdef consteval}
  411. { constant evaluation }
  412. if (p^.left^.treetype=loadn) and
  413. (p^.left^.symtableentry^.typ=typedconstsym) then
  414. begin
  415. tcsym:=ptypedconstsym(p^.left^.symtableentry);
  416. if tcsym^.defintion^.typ=stringdef then
  417. begin
  418. end;
  419. end;
  420. {$endif}
  421. p^.registers32:=p^.left^.registers32;
  422. { for ansi/wide strings, we need at least one register }
  423. if is_ansistring(p^.left^.resulttype) or
  424. is_widestring(p^.left^.resulttype) then
  425. p^.registers32:=max(p^.registers32,1);
  426. end
  427. else
  428. begin
  429. { this rules are suboptimal, but they should give }
  430. { good results }
  431. p^.registers32:=max(p^.left^.registers32,p^.right^.registers32);
  432. { for ansi/wide strings, we need at least one register }
  433. if is_ansistring(p^.left^.resulttype) or
  434. is_widestring(p^.left^.resulttype) then
  435. p^.registers32:=max(p^.registers32,1);
  436. { need we an extra register when doing the restore ? }
  437. if (p^.left^.registers32<=p^.right^.registers32) and
  438. { only if the node needs less than 3 registers }
  439. { two for the right node and one for the }
  440. { left address }
  441. (p^.registers32<3) then
  442. inc(p^.registers32);
  443. { need we an extra register for the index ? }
  444. if (p^.right^.location.loc<>LOC_REGISTER)
  445. { only if the right node doesn't need a register }
  446. and (p^.right^.registers32<1) then
  447. inc(p^.registers32);
  448. { not correct, but what works better ?
  449. if p^.left^.registers32>0 then
  450. p^.registers32:=max(p^.registers32,2)
  451. else
  452. min. one register
  453. p^.registers32:=max(p^.registers32,1);
  454. }
  455. end;
  456. p^.registersfpu:=max(p^.left^.registersfpu,p^.right^.registersfpu);
  457. {$ifdef SUPPORT_MMX}
  458. p^.registersmmx:=max(p^.left^.registersmmx,p^.right^.registersmmx);
  459. {$endif SUPPORT_MMX}
  460. if p^.left^.location.loc in [LOC_CREGISTER,LOC_REFERENCE] then
  461. p^.location.loc:=LOC_REFERENCE
  462. else
  463. p^.location.loc:=LOC_MEM;
  464. end;
  465. {*****************************************************************************
  466. FirstSelf
  467. *****************************************************************************}
  468. procedure firstself(var p : ptree);
  469. begin
  470. if (p^.resulttype^.deftype=classrefdef) or
  471. ((p^.resulttype^.deftype=objectdef)
  472. and pobjectdef(p^.resulttype)^.is_class
  473. ) then
  474. p^.location.loc:=LOC_CREGISTER
  475. else
  476. p^.location.loc:=LOC_REFERENCE;
  477. end;
  478. {*****************************************************************************
  479. FirstWithN
  480. *****************************************************************************}
  481. procedure firstwith(var p : ptree);
  482. var
  483. symtable : pwithsymtable;
  484. i : longint;
  485. begin
  486. if assigned(p^.left) and assigned(p^.right) then
  487. begin
  488. firstpass(p^.left);
  489. if codegenerror then
  490. exit;
  491. symtable:=p^.withsymtable;
  492. for i:=1 to p^.tablecount do
  493. begin
  494. if (p^.left^.treetype=loadn) and
  495. (p^.left^.symtable=aktprocsym^.definition^.localst) then
  496. symtable^.direct_with:=true;
  497. symtable^.withnode:=p;
  498. symtable:=pwithsymtable(symtable^.next);
  499. end;
  500. firstpass(p^.right);
  501. if codegenerror then
  502. exit;
  503. left_right_max(p);
  504. p^.resulttype:=voiddef;
  505. end
  506. else
  507. begin
  508. { optimization }
  509. disposetree(p);
  510. p:=nil;
  511. end;
  512. end;
  513. end.
  514. {
  515. $Log$
  516. Revision 1.24 1999-08-05 16:53:25 peter
  517. * V_Fatal=1, all other V_ are also increased
  518. * Check for local procedure when assigning procvar
  519. * fixed comment parsing because directives
  520. * oldtp mode directives better supported
  521. * added some messages to errore.msg
  522. Revision 1.23 1999/08/04 00:23:44 florian
  523. * renamed i386asm and i386base to cpuasm and cpubase
  524. Revision 1.22 1999/08/03 22:03:35 peter
  525. * moved bitmask constants to sets
  526. * some other type/const renamings
  527. Revision 1.21 1999/07/16 10:04:39 peter
  528. * merged
  529. Revision 1.20 1999/07/05 20:25:41 peter
  530. * merged
  531. Revision 1.19 1999/07/05 16:24:17 peter
  532. * merged
  533. Revision 1.18.2.4 1999/07/16 09:54:59 peter
  534. * @procvar support in tp7 mode works again
  535. Revision 1.18.2.3 1999/07/05 20:06:47 peter
  536. * give error instead of warning for ln(0) and sqrt(0)
  537. Revision 1.18.2.2 1999/07/05 16:22:56 peter
  538. * error if @constant
  539. Revision 1.18.2.1 1999/06/28 00:33:53 pierre
  540. * better error position bug0269
  541. Revision 1.18 1999/06/03 09:34:12 peter
  542. * better methodpointer check for proc->procvar
  543. Revision 1.17 1999/05/27 19:45:24 peter
  544. * removed oldasm
  545. * plabel -> pasmlabel
  546. * -a switches to source writing automaticly
  547. * assembler readers OOPed
  548. * asmsymbol automaticly external
  549. * jumptables and other label fixes for asm readers
  550. Revision 1.16 1999/05/18 09:52:21 peter
  551. * procedure of object and addrn fixes
  552. Revision 1.15 1999/05/17 23:51:46 peter
  553. * with temp vars now use a reference with a persistant temp instead
  554. of setting datasize
  555. Revision 1.14 1999/05/01 13:24:57 peter
  556. * merged nasm compiler
  557. * old asm moved to oldasm/
  558. Revision 1.13 1999/04/26 18:30:05 peter
  559. * farpointerdef moved into pointerdef.is_far
  560. Revision 1.12 1999/03/02 18:24:24 peter
  561. * fixed overloading of array of char
  562. Revision 1.11 1999/02/22 02:15:54 peter
  563. * updates for ag386bin
  564. Revision 1.10 1999/02/04 11:44:47 florian
  565. * fixed indexed access of ansistrings to temp. ansistring, i.e.
  566. c:=(s1+s2)[i], the temp is now correctly remove and the generated
  567. code is also fixed
  568. Revision 1.9 1999/01/22 12:18:34 pierre
  569. * with bug introduced with DIRECTWITH removed
  570. Revision 1.8 1999/01/21 16:41:08 pierre
  571. * fix for constructor inside with statements
  572. Revision 1.7 1998/12/30 22:15:59 peter
  573. + farpointer type
  574. * absolutesym now also stores if its far
  575. Revision 1.6 1998/12/15 17:16:02 peter
  576. * fixed const s : ^string
  577. * first things for const pchar : @string[1]
  578. Revision 1.5 1998/12/11 00:03:57 peter
  579. + globtype,tokens,version unit splitted from globals
  580. Revision 1.4 1998/11/25 19:12:53 pierre
  581. * var:=new(pointer_type) support added
  582. Revision 1.3 1998/09/26 15:03:05 florian
  583. * small problems with DOM and excpetions fixed (code generation
  584. of raise was wrong and self was sometimes destroyed :()
  585. Revision 1.2 1998/09/24 23:49:24 peter
  586. + aktmodeswitches
  587. Revision 1.1 1998/09/23 20:42:24 peter
  588. * splitted pass_1
  589. }