cg386mem.pas 26 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690
  1. {
  2. $Id$
  3. Copyright (c) 1993-98 by Florian Klaempfl
  4. Generate i386 assembler for in 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 cg386mem;
  19. interface
  20. uses
  21. tree;
  22. procedure secondloadvmt(var p : ptree);
  23. procedure secondhnewn(var p : ptree);
  24. procedure secondnewn(var p : ptree);
  25. procedure secondhdisposen(var p : ptree);
  26. procedure secondsimplenewdispose(var p : ptree);
  27. procedure secondaddr(var p : ptree);
  28. procedure seconddoubleaddr(var p : ptree);
  29. procedure secondderef(var p : ptree);
  30. procedure secondsubscriptn(var p : ptree);
  31. procedure secondvecn(var p : ptree);
  32. procedure secondselfn(var p : ptree);
  33. procedure secondwith(var p : ptree);
  34. implementation
  35. uses
  36. cobjects,verbose,globals,systems,
  37. symtable,aasm,types,
  38. hcodegen,temp_gen,pass_2,
  39. i386,cgai386,tgeni386;
  40. {*****************************************************************************
  41. SecondLoadVMT
  42. *****************************************************************************}
  43. procedure secondloadvmt(var p : ptree);
  44. begin
  45. p^.location.register:=getregister32;
  46. exprasmlist^.concat(new(pai386,op_csymbol_reg(A_MOV,
  47. S_L,newcsymbol(pobjectdef(pclassrefdef(p^.resulttype)^.definition)^.vmt_mangledname,0),
  48. p^.location.register)));
  49. end;
  50. {*****************************************************************************
  51. SecondHNewN
  52. *****************************************************************************}
  53. procedure secondhnewn(var p : ptree);
  54. begin
  55. end;
  56. {*****************************************************************************
  57. SecondNewN
  58. *****************************************************************************}
  59. procedure secondnewn(var p : ptree);
  60. begin
  61. secondpass(p^.left);
  62. if codegenerror then
  63. exit;
  64. p^.location.register:=p^.left^.location.register;
  65. end;
  66. {*****************************************************************************
  67. SecondDisposeN
  68. *****************************************************************************}
  69. procedure secondhdisposen(var p : ptree);
  70. begin
  71. secondpass(p^.left);
  72. if codegenerror then
  73. exit;
  74. clear_reference(p^.location.reference);
  75. case p^.left^.location.loc of
  76. LOC_REGISTER,
  77. LOC_CREGISTER:
  78. begin
  79. p^.location.reference.index:=getregister32;
  80. exprasmlist^.concat(new(pai386,op_reg_reg(A_MOV,S_L,
  81. p^.left^.location.register,
  82. p^.location.reference.index)));
  83. end;
  84. LOC_MEM,LOC_REFERENCE :
  85. begin
  86. del_reference(p^.left^.location.reference);
  87. p^.location.reference.index:=getregister32;
  88. exprasmlist^.concat(new(pai386,op_ref_reg(A_MOV,S_L,newreference(p^.left^.location.reference),
  89. p^.location.reference.index)));
  90. end;
  91. end;
  92. end;
  93. {*****************************************************************************
  94. SecondNewDispose
  95. *****************************************************************************}
  96. procedure secondsimplenewdispose(var p : ptree);
  97. var
  98. pushed : tpushed;
  99. r : preference;
  100. begin
  101. secondpass(p^.left);
  102. if codegenerror then
  103. exit;
  104. pushusedregisters(pushed,$ff);
  105. { determines the size of the mem block }
  106. push_int(ppointerdef(p^.left^.resulttype)^.definition^.size);
  107. { push pointer adress }
  108. case p^.left^.location.loc of
  109. LOC_CREGISTER : exprasmlist^.concat(new(pai386,op_reg(A_PUSH,S_L,
  110. p^.left^.location.register)));
  111. LOC_REFERENCE:
  112. emitpushreferenceaddr(exprasmlist,p^.left^.location.reference);
  113. end;
  114. { call the mem handling procedures }
  115. case p^.treetype of
  116. simpledisposen:
  117. begin
  118. if ppointerdef(p^.left^.resulttype)^.definition^.needs_inittable then
  119. begin
  120. new(r);
  121. reset_reference(r^);
  122. r^.symbol:=stringdup(lab2str(ppointerdef(p^.left^.resulttype)^.definition^.get_rtti_label));
  123. emitpushreferenceaddr(exprasmlist,r^);
  124. { push pointer adress }
  125. case p^.left^.location.loc of
  126. LOC_CREGISTER : exprasmlist^.concat(new(pai386,op_reg(A_PUSH,S_L,
  127. p^.left^.location.register)));
  128. LOC_REFERENCE:
  129. emitpushreferenceaddr(exprasmlist,p^.left^.location.reference);
  130. end;
  131. emitcall('FPC_FINALIZE',true);
  132. end;
  133. emitcall('FPC_FREEMEM',true);
  134. end;
  135. simplenewn:
  136. begin
  137. emitcall('FPC_GETMEM',true);
  138. if ppointerdef(p^.left^.resulttype)^.definition^.needs_inittable then
  139. begin
  140. new(r);
  141. reset_reference(r^);
  142. r^.symbol:=stringdup(lab2str(ppointerdef(p^.left^.resulttype)^.definition^.get_rtti_label));
  143. emitpushreferenceaddr(exprasmlist,r^);
  144. { push pointer adress }
  145. case p^.left^.location.loc of
  146. LOC_CREGISTER : exprasmlist^.concat(new(pai386,op_reg(A_PUSH,S_L,
  147. p^.left^.location.register)));
  148. LOC_REFERENCE:
  149. emitpushreferenceaddr(exprasmlist,p^.left^.location.reference);
  150. end;
  151. emitcall('FPC_INITIALIZE',true);
  152. end;
  153. end;
  154. end;
  155. popusedregisters(pushed);
  156. { may be load ESI }
  157. maybe_loadesi;
  158. end;
  159. {*****************************************************************************
  160. SecondAddr
  161. *****************************************************************************}
  162. procedure secondaddr(var p : ptree);
  163. begin
  164. secondpass(p^.left);
  165. p^.location.loc:=LOC_REGISTER;
  166. del_reference(p^.left^.location.reference);
  167. p^.location.register:=getregister32;
  168. {@ on a procvar means returning an address to the procedure that
  169. is stored in it.}
  170. { yes but p^.left^.symtableentry can be nil
  171. for example on @self !! }
  172. { symtableentry can be also invalid, if left is no tree node }
  173. if (p^.left^.treetype=loadn) and
  174. assigned(p^.left^.symtableentry) and
  175. (p^.left^.symtableentry^.typ=varsym) and
  176. (pvarsym(p^.left^.symtableentry)^.definition^.deftype=procvardef) then
  177. exprasmlist^.concat(new(pai386,op_ref_reg(A_MOV,S_L,
  178. newreference(p^.left^.location.reference),
  179. p^.location.register)))
  180. else
  181. exprasmlist^.concat(new(pai386,op_ref_reg(A_LEA,S_L,
  182. newreference(p^.left^.location.reference),
  183. p^.location.register)));
  184. { for use of other segments }
  185. if p^.left^.location.reference.segment<>R_DEFAULT_SEG then
  186. p^.location.segment:=p^.left^.location.reference.segment;
  187. end;
  188. {*****************************************************************************
  189. SecondDoubleAddr
  190. *****************************************************************************}
  191. procedure seconddoubleaddr(var p : ptree);
  192. begin
  193. secondpass(p^.left);
  194. p^.location.loc:=LOC_REGISTER;
  195. del_reference(p^.left^.location.reference);
  196. p^.location.register:=getregister32;
  197. exprasmlist^.concat(new(pai386,op_ref_reg(A_LEA,S_L,
  198. newreference(p^.left^.location.reference),
  199. p^.location.register)));
  200. end;
  201. {*****************************************************************************
  202. SecondDeRef
  203. *****************************************************************************}
  204. procedure secondderef(var p : ptree);
  205. var
  206. hr : tregister;
  207. begin
  208. secondpass(p^.left);
  209. clear_reference(p^.location.reference);
  210. case p^.left^.location.loc of
  211. LOC_REGISTER:
  212. p^.location.reference.base:=p^.left^.location.register;
  213. LOC_CREGISTER:
  214. begin
  215. { ... and reserve one for the pointer }
  216. hr:=getregister32;
  217. emit_reg_reg(A_MOV,S_L,p^.left^.location.register,hr);
  218. p^.location.reference.base:=hr;
  219. end;
  220. else
  221. begin
  222. { free register }
  223. del_reference(p^.left^.location.reference);
  224. { ...and reserve one for the pointer }
  225. hr:=getregister32;
  226. exprasmlist^.concat(new(pai386,op_ref_reg(
  227. A_MOV,S_L,newreference(p^.left^.location.reference),
  228. hr)));
  229. p^.location.reference.base:=hr;
  230. end;
  231. end;
  232. end;
  233. {*****************************************************************************
  234. SecondSubScriptN
  235. *****************************************************************************}
  236. procedure secondsubscriptn(var p : ptree);
  237. var
  238. hr : tregister;
  239. begin
  240. secondpass(p^.left);
  241. if codegenerror then
  242. exit;
  243. { classes must be dereferenced implicit }
  244. if (p^.left^.resulttype^.deftype=objectdef) and
  245. pobjectdef(p^.left^.resulttype)^.isclass then
  246. begin
  247. clear_reference(p^.location.reference);
  248. case p^.left^.location.loc of
  249. LOC_REGISTER:
  250. p^.location.reference.base:=p^.left^.location.register;
  251. LOC_CREGISTER:
  252. begin
  253. { ... and reserve one for the pointer }
  254. hr:=getregister32;
  255. emit_reg_reg(A_MOV,S_L,p^.left^.location.register,hr);
  256. p^.location.reference.base:=hr;
  257. end;
  258. else
  259. begin
  260. { free register }
  261. del_reference(p^.left^.location.reference);
  262. { ... and reserve one for the pointer }
  263. hr:=getregister32;
  264. exprasmlist^.concat(new(pai386,op_ref_reg(
  265. A_MOV,S_L,newreference(p^.left^.location.reference),
  266. hr)));
  267. p^.location.reference.base:=hr;
  268. end;
  269. end;
  270. end
  271. else
  272. set_location(p^.location,p^.left^.location);
  273. inc(p^.location.reference.offset,p^.vs^.address);
  274. end;
  275. {*****************************************************************************
  276. SecondVecN
  277. *****************************************************************************}
  278. procedure secondvecn(var p : ptree);
  279. var
  280. pushed : boolean;
  281. ind,hr : tregister;
  282. _p : ptree;
  283. function get_mul_size:longint;
  284. begin
  285. if p^.memindex then
  286. get_mul_size:=1
  287. else
  288. get_mul_size:=p^.resulttype^.size;
  289. end;
  290. procedure calc_emit_mul;
  291. var
  292. l1,l2 : longint;
  293. begin
  294. l1:=get_mul_size;
  295. case l1 of
  296. 1,2,4,8 : p^.location.reference.scalefactor:=l1;
  297. else
  298. begin
  299. if ispowerof2(l1,l2) then
  300. exprasmlist^.concat(new(pai386,op_const_reg(A_SHL,S_L,l2,ind)))
  301. else
  302. exprasmlist^.concat(new(pai386,op_const_reg(A_IMUL,S_L,l1,ind)));
  303. end;
  304. end;
  305. end;
  306. var
  307. extraoffset : longint;
  308. t : ptree;
  309. hp : preference;
  310. tai : Pai386;
  311. begin
  312. secondpass(p^.left);
  313. { we load the array reference to p^.location }
  314. { an ansistring needs to be dereferenced }
  315. if is_ansistring(p^.left^.resulttype) or
  316. is_widestring(p^.left^.resulttype) then
  317. begin
  318. reset_reference(p^.location.reference);
  319. p^.location.loc:=LOC_REFERENCE;
  320. del_reference(p^.left^.location.reference);
  321. p^.location.reference.base:=getregister32;
  322. exprasmlist^.concat(new(pai386,op_ref_reg(A_MOV,S_L,
  323. newreference(p^.left^.location.reference),
  324. p^.location.reference.base)));
  325. if is_ansistring(p^.left^.resulttype) then
  326. begin
  327. { in ansistrings S[1] is pchar(S)[0] !! }
  328. dec(p^.location.reference.offset);
  329. { this is necessary for ansistrings with constant index }
  330. dec(p^.left^.location.reference.offset);
  331. end
  332. else
  333. begin
  334. { in widestrings S[1] is pwchar(S)[0] !! }
  335. dec(p^.location.reference.offset,2);
  336. { this is necessary for ansistrings with constant index }
  337. dec(p^.left^.location.reference.offset,2);
  338. exprasmlist^.concat(new(pai386,op_const_reg(A_SHL,S_L,
  339. 2,p^.location.reference.base)));
  340. end;
  341. end
  342. else
  343. set_location(p^.location,p^.left^.location);
  344. { offset can only differ from 0 if arraydef }
  345. if p^.left^.resulttype^.deftype=arraydef then
  346. dec(p^.location.reference.offset,
  347. get_mul_size*parraydef(p^.left^.resulttype)^.lowrange);
  348. if p^.right^.treetype=ordconstn then
  349. begin
  350. { offset can only differ from 0 if arraydef }
  351. if (p^.left^.resulttype^.deftype=arraydef) then
  352. begin
  353. if not(is_open_array(p^.left^.resulttype)) then
  354. begin
  355. if (p^.right^.value>parraydef(p^.left^.resulttype)^.highrange) or
  356. (p^.right^.value<parraydef(p^.left^.resulttype)^.lowrange) then
  357. CGMessage(parser_e_range_check_error);
  358. dec(p^.left^.location.reference.offset,
  359. get_mul_size*parraydef(p^.left^.resulttype)^.lowrange);
  360. end
  361. else
  362. begin
  363. { range checking for open arrays }
  364. end;
  365. end;
  366. inc(p^.left^.location.reference.offset,
  367. get_mul_size*p^.right^.value);
  368. if p^.memseg then
  369. p^.left^.location.reference.segment:=R_FS;
  370. p^.left^.resulttype:=p^.resulttype;
  371. disposetree(p^.right);
  372. _p:=p^.left;
  373. putnode(p);
  374. p:=_p;
  375. end
  376. else
  377. begin
  378. { quick hack, to overcome Delphi 2 }
  379. if (cs_regalloc in aktglobalswitches) and
  380. (p^.left^.resulttype^.deftype=arraydef) then
  381. begin
  382. extraoffset:=0;
  383. if (p^.right^.treetype=addn) then
  384. begin
  385. if p^.right^.right^.treetype=ordconstn then
  386. begin
  387. extraoffset:=p^.right^.right^.value;
  388. t:=p^.right^.left;
  389. putnode(p^.right);
  390. putnode(p^.right^.right);
  391. p^.right:=t
  392. end
  393. else if p^.right^.left^.treetype=ordconstn then
  394. begin
  395. extraoffset:=p^.right^.left^.value;
  396. t:=p^.right^.right;
  397. putnode(p^.right);
  398. putnode(p^.right^.left);
  399. p^.right:=t
  400. end;
  401. end
  402. else if (p^.right^.treetype=subn) then
  403. begin
  404. if p^.right^.right^.treetype=ordconstn then
  405. begin
  406. extraoffset:=p^.right^.right^.value;
  407. t:=p^.right^.left;
  408. putnode(p^.right);
  409. putnode(p^.right^.right);
  410. p^.right:=t
  411. end
  412. else if p^.right^.left^.treetype=ordconstn then
  413. begin
  414. extraoffset:=p^.right^.left^.value;
  415. t:=p^.right^.right;
  416. putnode(p^.right);
  417. putnode(p^.right^.left);
  418. p^.right:=t
  419. end;
  420. end;
  421. inc(p^.location.reference.offset,
  422. get_mul_size*extraoffset);
  423. end;
  424. { calculate from left to right }
  425. if (p^.location.loc<>LOC_REFERENCE) and
  426. (p^.location.loc<>LOC_MEM) then
  427. CGMessage(cg_e_illegal_expression);
  428. pushed:=maybe_push(p^.right^.registers32,p);
  429. secondpass(p^.right);
  430. if pushed then restore(p);
  431. case p^.right^.location.loc of
  432. LOC_REGISTER:
  433. begin
  434. ind:=p^.right^.location.register;
  435. case p^.right^.resulttype^.size of
  436. 1:
  437. begin
  438. hr:=reg8toreg32(ind);
  439. emit_reg_reg(A_MOVZX,S_BL,ind,hr);
  440. ind:=hr;
  441. end;
  442. 2:
  443. begin
  444. hr:=reg16toreg32(ind);
  445. emit_reg_reg(A_MOVZX,S_WL,ind,hr);
  446. ind:=hr;
  447. end;
  448. end;
  449. end;
  450. LOC_CREGISTER:
  451. begin
  452. ind:=getregister32;
  453. case p^.right^.resulttype^.size of
  454. 1:
  455. emit_reg_reg(A_MOVZX,S_BL,p^.right^.location.register,ind);
  456. 2:
  457. emit_reg_reg(A_MOVZX,S_WL,p^.right^.location.register,ind);
  458. 4:
  459. emit_reg_reg(A_MOV,S_L,p^.right^.location.register,ind);
  460. end;
  461. end;
  462. LOC_FLAGS:
  463. begin
  464. ind:=getregister32;
  465. exprasmlist^.concat(new(pai386,op_reg(flag_2_set[p^.right^.location.resflags],S_B,reg32toreg8(ind))));
  466. emit_reg_reg(A_MOVZX,S_BL,reg32toreg8(ind),ind);
  467. end
  468. else
  469. begin
  470. del_reference(p^.right^.location.reference);
  471. ind:=getregister32;
  472. { Booleans are stored in an 8 bit memory location, so
  473. the use of MOVL is not correct }
  474. case p^.right^.resulttype^.size of
  475. 1:
  476. tai:=new(pai386,op_ref_reg(A_MOVZX,S_BL,newreference(p^.right^.location.reference),ind));
  477. 2:
  478. tai:=new(Pai386,op_ref_reg(A_MOVZX,S_WL,newreference(p^.right^.location.reference),ind));
  479. 4:
  480. tai:=new(Pai386,op_ref_reg(A_MOV,S_L,newreference(p^.right^.location.reference),ind));
  481. end;
  482. exprasmlist^.concat(tai);
  483. end;
  484. end;
  485. { produce possible range check code: }
  486. if cs_check_range in aktlocalswitches then
  487. begin
  488. if p^.left^.resulttype^.deftype=arraydef then
  489. begin
  490. hp:=new_reference(R_NO,0);
  491. parraydef(p^.left^.resulttype)^.genrangecheck;
  492. hp^.symbol:=stringdup('R_'+tostr(parraydef(p^.left^.resulttype)^.rangenr));
  493. exprasmlist^.concat(new(pai386,op_reg_ref(A_BOUND,S_L,ind,hp)));
  494. end;
  495. end;
  496. if p^.location.reference.index=R_NO then
  497. begin
  498. p^.location.reference.index:=ind;
  499. calc_emit_mul;
  500. end
  501. else
  502. begin
  503. if p^.location.reference.base=R_NO then
  504. begin
  505. case p^.location.reference.scalefactor of
  506. 2 : exprasmlist^.concat(new(pai386,op_const_reg(A_SHL,S_L,1,p^.location.reference.index)));
  507. 4 : exprasmlist^.concat(new(pai386,op_const_reg(A_SHL,S_L,2,p^.location.reference.index)));
  508. 8 : exprasmlist^.concat(new(pai386,op_const_reg(A_SHL,S_L,3,p^.location.reference.index)));
  509. end;
  510. calc_emit_mul;
  511. p^.location.reference.base:=p^.location.reference.index;
  512. p^.location.reference.index:=ind;
  513. end
  514. else
  515. begin
  516. exprasmlist^.concat(new(pai386,op_ref_reg(
  517. A_LEA,S_L,newreference(p^.location.reference),
  518. p^.location.reference.index)));
  519. ungetregister32(p^.location.reference.base);
  520. { the symbol offset is loaded, }
  521. { so release the symbol name and set symbol }
  522. { to nil }
  523. stringdispose(p^.location.reference.symbol);
  524. p^.location.reference.offset:=0;
  525. calc_emit_mul;
  526. p^.location.reference.base:=p^.location.reference.index;
  527. p^.location.reference.index:=ind;
  528. end;
  529. end;
  530. if p^.memseg then
  531. p^.location.reference.segment:=R_FS;
  532. end;
  533. end;
  534. {*****************************************************************************
  535. SecondSelfN
  536. *****************************************************************************}
  537. procedure secondselfn(var p : ptree);
  538. begin
  539. clear_reference(p^.location.reference);
  540. if (p^.resulttype^.deftype=classrefdef) or
  541. ((p^.resulttype^.deftype=objectdef)
  542. and pobjectdef(p^.resulttype)^.isclass
  543. ) then
  544. p^.location.register:=R_ESI
  545. else
  546. p^.location.reference.base:=R_ESI;
  547. end;
  548. {*****************************************************************************
  549. SecondWithN
  550. *****************************************************************************}
  551. procedure secondwith(var p : ptree);
  552. var
  553. ref : treference;
  554. symtable : psymtable;
  555. i : longint;
  556. begin
  557. if assigned(p^.left) then
  558. begin
  559. secondpass(p^.left);
  560. ref.symbol:=nil;
  561. gettempofsizereference(4,ref);
  562. exprasmlist^.concat(new(pai386,op_ref_reg(A_LEA,S_L,
  563. newreference(p^.left^.location.reference),R_EDI)));
  564. exprasmlist^.concat(new(pai386,op_reg_ref(A_MOV,S_L,
  565. R_EDI,newreference(ref))));
  566. del_reference(p^.left^.location.reference);
  567. { the offset relative to (%ebp) is only needed here! }
  568. symtable:=p^.withsymtable;
  569. for i:=1 to p^.tablecount do
  570. begin
  571. symtable^.datasize:=ref.offset;
  572. symtable:=symtable^.next;
  573. end;
  574. { p^.right can be optimize out !!! }
  575. if p^.right<>nil then
  576. secondpass(p^.right);
  577. { clear some stuff }
  578. ungetiftemp(ref);
  579. end;
  580. end;
  581. end.
  582. {
  583. $Log$
  584. Revision 1.11 1998-09-17 09:42:18 peter
  585. + pass_2 for cg386
  586. * Message() -> CGMessage() for pass_1/pass_2
  587. Revision 1.10 1998/09/14 10:43:52 peter
  588. * all internal RTL functions start with FPC_
  589. Revision 1.9 1998/09/03 16:03:15 florian
  590. + rtti generation
  591. * init table generation changed
  592. Revision 1.8 1998/08/23 21:04:34 florian
  593. + rtti generation for classes added
  594. + new/dispose do now also a call to INITIALIZE/FINALIZE, if necessaray
  595. Revision 1.7 1998/08/20 11:27:40 michael
  596. * Applied Peters Fix
  597. Revision 1.6 1998/08/10 14:49:49 peter
  598. + localswitches, moduleswitches, globalswitches splitting
  599. Revision 1.5 1998/07/26 21:58:58 florian
  600. + better support for switch $H
  601. + index access to ansi strings added
  602. + assigment of data (records/arrays) containing ansi strings
  603. Revision 1.4 1998/07/24 22:16:55 florian
  604. * internal error 10 together with array access fixed. I hope
  605. that's the final fix.
  606. Revision 1.3 1998/06/25 08:48:09 florian
  607. * first version of rtti support
  608. Revision 1.2 1998/06/08 13:13:35 pierre
  609. + temporary variables now in temp_gen.pas unit
  610. because it is processor independent
  611. * mppc68k.bat modified to undefine i386 and support_mmx
  612. (which are defaults for i386)
  613. Revision 1.1 1998/06/05 17:44:13 peter
  614. * splitted cgi386
  615. }