tcmem.pas 24 KB

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