cgi386.pas 25 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701
  1. {
  2. $Id$
  3. Copyright (c) 1993-98 by Florian Klaempfl
  4. This unit generates i386 (or better) assembler from the parse tree
  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. {$ifdef TP}
  19. {$E+,F+,N+,D+,L+,Y+}
  20. {$endif}
  21. unit cgi386;
  22. interface
  23. uses
  24. tree;
  25. { produces assembler for the expression in variable p }
  26. { and produces an assembler node at the end }
  27. procedure generatecode(var p : ptree);
  28. { produces the actual code }
  29. function do_secondpass(var p : ptree) : boolean;
  30. procedure secondpass(var p : ptree);
  31. {$ifdef test_dest_loc}
  32. const
  33. { used to avoid temporary assignments }
  34. dest_loc_known : boolean = false;
  35. in_dest_loc : boolean = false;
  36. dest_loc_tree : ptree = nil;
  37. var
  38. dest_loc : tlocation;
  39. procedure mov_reg_to_dest(p : ptree; s : topsize; reg : tregister);
  40. {$endif test_dest_loc}
  41. implementation
  42. uses
  43. verbose,cobjects,systems,globals,files,
  44. symtable,types,aasm,scanner,
  45. pass_1,hcodegen,temp_gen
  46. {$ifdef GDB}
  47. ,gdb
  48. {$endif}
  49. {$ifdef i386}
  50. ,i386,tgeni386,cgai386
  51. ,cg386con,cg386mat,cg386cnv,cg386set,cg386add
  52. ,cg386mem,cg386cal,cg386ld,cg386flw
  53. {$endif}
  54. ;
  55. {$ifdef test_dest_loc}
  56. procedure mov_reg_to_dest(p : ptree; s : topsize; reg : tregister);
  57. begin
  58. if (dest_loc.loc=LOC_CREGISTER) or (dest_loc.loc=LOC_REGISTER) then
  59. begin
  60. emit_reg_reg(A_MOV,s,reg,dest_loc.register);
  61. p^.location:=dest_loc;
  62. in_dest_loc:=true;
  63. end
  64. else
  65. if (dest_loc.loc=LOC_REFERENCE) or (dest_loc.loc=LOC_MEM) then
  66. begin
  67. exprasmlist^.concat(new(pai386,op_reg_ref(A_MOV,s,reg,newreference(dest_loc.reference))));
  68. p^.location:=dest_loc;
  69. in_dest_loc:=true;
  70. end
  71. else
  72. internalerror(20080);
  73. end;
  74. {$endif test_dest_loc}
  75. procedure message(const t : tmsgconst);
  76. var
  77. olderrorcount : longint;
  78. begin
  79. if not(codegenerror) then
  80. begin
  81. olderrorcount:=status.errorcount;
  82. verbose.Message(t);
  83. codegenerror:=olderrorcount<>status.errorcount;
  84. end;
  85. end;
  86. procedure message1(const t : tmsgconst;const s : string);
  87. var
  88. olderrorcount : longint;
  89. begin
  90. if not(codegenerror) then
  91. begin
  92. olderrorcount:=status.errorcount;
  93. verbose.Message1(t,s);
  94. codegenerror:=olderrorcount<>status.errorcount;
  95. end;
  96. end;
  97. procedure message2(const t : tmsgconst;const s1,s2 : string);
  98. var
  99. olderrorcount : longint;
  100. begin
  101. if not(codegenerror) then
  102. begin
  103. olderrorcount:=status.errorcount;
  104. verbose.Message2(t,s1,s2);
  105. codegenerror:=olderrorcount<>status.errorcount;
  106. end;
  107. end;
  108. procedure message3(const t : tmsgconst;const s1,s2,s3 : string);
  109. var
  110. olderrorcount : longint;
  111. begin
  112. if not(codegenerror) then
  113. begin
  114. olderrorcount:=status.errorcount;
  115. verbose.Message3(t,s1,s2,s3);
  116. codegenerror:=olderrorcount<>status.errorcount;
  117. end;
  118. end;
  119. {*****************************************************************************
  120. SecondPass
  121. *****************************************************************************}
  122. type
  123. secondpassproc = procedure(var p : ptree);
  124. procedure secondnothing(var p : ptree);
  125. begin
  126. end;
  127. procedure seconderror(var p : ptree);
  128. begin
  129. p^.error:=true;
  130. codegenerror:=true;
  131. end;
  132. procedure secondstatement(var p : ptree);
  133. var
  134. hp : ptree;
  135. begin
  136. hp:=p;
  137. while assigned(hp) do
  138. begin
  139. if assigned(hp^.right) then
  140. begin
  141. cleartempgen;
  142. secondpass(hp^.right);
  143. end;
  144. hp:=hp^.left;
  145. end;
  146. end;
  147. procedure secondblockn(var p : ptree);
  148. begin
  149. { do second pass on left node }
  150. if assigned(p^.left) then
  151. secondpass(p^.left);
  152. end;
  153. procedure secondasm(var p : ptree);
  154. begin
  155. exprasmlist^.concatlist(p^.p_asm);
  156. if not p^.object_preserved then
  157. maybe_loadesi;
  158. end;
  159. procedure secondpass(var p : ptree);
  160. const
  161. procedures : array[ttreetyp] of secondpassproc =
  162. (secondadd,secondadd,secondadd,secondmoddiv,secondadd,
  163. secondmoddiv,secondassignment,secondload,secondnothing,
  164. secondadd,secondadd,secondadd,secondadd,
  165. secondadd,secondadd,secondin,secondadd,
  166. secondadd,secondshlshr,secondshlshr,secondadd,
  167. secondadd,secondsubscriptn,secondderef,secondaddr,
  168. seconddoubleaddr,
  169. secondordconst,secondtypeconv,secondcalln,secondnothing,
  170. secondrealconst,secondfixconst,secondumminus,
  171. secondasm,secondvecn,
  172. secondstringconst,secondfuncret,secondselfn,
  173. secondnot,secondinline,secondniln,seconderror,
  174. secondnothing,secondhnewn,secondhdisposen,secondnewn,
  175. secondsimplenewdispose,secondnothing,secondsetcons,secondblockn,
  176. secondstatement,secondnothing,secondifn,secondbreakn,
  177. secondcontinuen,second_while_repeatn,second_while_repeatn,secondfor,
  178. secondexitn,secondwith,secondcase,secondlabel,
  179. secondgoto,secondsimplenewdispose,secondtryexcept,secondraise,
  180. secondnothing,secondtryfinally,secondis,secondas,seconderror,
  181. secondfail,secondadd,secondprocinline,
  182. secondnothing,secondloadvmt);
  183. var
  184. oldcodegenerror : boolean;
  185. oldswitches : Tcswitches;
  186. oldpos : tfileposinfo;
  187. begin
  188. oldcodegenerror:=codegenerror;
  189. oldswitches:=aktswitches;
  190. get_cur_file_pos(oldpos);
  191. codegenerror:=false;
  192. set_cur_file_pos(p^.fileinfo);
  193. aktswitches:=p^.pragmas;
  194. if not(p^.error) then
  195. begin
  196. procedures[p^.treetype](p);
  197. p^.error:=codegenerror;
  198. codegenerror:=codegenerror or oldcodegenerror;
  199. end
  200. else
  201. codegenerror:=true;
  202. aktswitches:=oldswitches;
  203. set_cur_file_pos(oldpos);
  204. end;
  205. function do_secondpass(var p : ptree) : boolean;
  206. begin
  207. codegenerror:=false;
  208. if not(p^.error) then
  209. secondpass(p);
  210. do_secondpass:=codegenerror;
  211. end;
  212. var
  213. regvars : array[1..maxvarregs] of pvarsym;
  214. regvars_para : array[1..maxvarregs] of boolean;
  215. regvars_refs : array[1..maxvarregs] of longint;
  216. parasym : boolean;
  217. procedure searchregvars(p : psym);
  218. var
  219. i,j,k : longint;
  220. begin
  221. if (p^.typ=varsym) and ((pvarsym(p)^.var_options and vo_regable)<>0) then
  222. begin
  223. { walk through all momentary register variables }
  224. for i:=1 to maxvarregs do
  225. begin
  226. { free register ? }
  227. if regvars[i]=nil then
  228. begin
  229. regvars[i]:=pvarsym(p);
  230. regvars_para[i]:=parasym;
  231. break;
  232. end;
  233. { else throw out a variable ? }
  234. j:=pvarsym(p)^.refs;
  235. { parameter get a less value }
  236. if parasym then
  237. begin
  238. if cs_littlesize in aktswitches then
  239. dec(j,1)
  240. else
  241. dec(j,100);
  242. end;
  243. if (j>regvars_refs[i]) and (j>0) then
  244. begin
  245. for k:=maxvarregs-1 downto i do
  246. begin
  247. regvars[k+1]:=regvars[k];
  248. regvars_para[k+1]:=regvars_para[k];
  249. end;
  250. { calc the new refs
  251. pvarsym(p)^.refs:=j; }
  252. regvars[i]:=pvarsym(p);
  253. regvars_para[i]:=parasym;
  254. regvars_refs[i]:=j;
  255. break;
  256. end;
  257. end;
  258. end;
  259. end;
  260. procedure generatecode(var p : ptree);
  261. var
  262. { *pass modifies with every node aktlinenr and current_module^.current_inputfile, }
  263. { to constantly contain the right line numbers }
  264. oldis : pinputfile;
  265. oldnr,i : longint;
  266. regsize : topsize;
  267. regi : tregister;
  268. hr : preference;
  269. label
  270. nextreg;
  271. begin
  272. cleartempgen;
  273. oldis:=current_module^.current_inputfile;
  274. oldnr:=current_module^.current_inputfile^.line_no;
  275. { when size optimization only count occurrence }
  276. if cs_littlesize in aktswitches then
  277. t_times:=1
  278. else
  279. { reference for repetition is 100 }
  280. t_times:=100;
  281. { clear register count }
  282. {$ifdef SUPPORT_MMX}
  283. for regi:=R_EAX to R_MM6 do
  284. begin
  285. reg_pushes[regi]:=0;
  286. is_reg_var[regi]:=false;
  287. end;
  288. {$else SUPPORT_MMX}
  289. for regi:=R_EAX to R_EDI do
  290. begin
  291. reg_pushes[regi]:=0;
  292. is_reg_var[regi]:=false;
  293. end;
  294. {$endif SUPPORT_MMX}
  295. use_esp_stackframe:=false;
  296. if not(do_firstpass(p)) then
  297. begin
  298. { max. optimizations }
  299. { only if no asm is used }
  300. if (cs_maxoptimieren in aktswitches) and
  301. ((procinfo.flags and pi_uses_asm)=0) then
  302. begin
  303. { can we omit the stack frame ? }
  304. { conditions:
  305. 1. procedure (not main block)
  306. 2. no constructor or destructor
  307. 3. no call to other procedures
  308. 4. no interrupt handler
  309. }
  310. if assigned(aktprocsym) then
  311. begin
  312. if (aktprocsym^.definition^.options and
  313. poconstructor+podestructor{+poinline}+pointerrupt=0) and
  314. ((procinfo.flags and pi_do_call)=0) and (lexlevel>1) then
  315. begin
  316. { use ESP as frame pointer }
  317. procinfo.framepointer:=R_ESP;
  318. use_esp_stackframe:=true;
  319. { calc parameter distance new }
  320. dec(procinfo.framepointer_offset,4);
  321. dec(procinfo.ESI_offset,4);
  322. { is this correct ???}
  323. { retoffset can be negativ for results in eax !! }
  324. { the value should be decreased only if positive }
  325. if procinfo.retoffset>=0 then
  326. dec(procinfo.retoffset,4);
  327. dec(procinfo.call_offset,4);
  328. aktprocsym^.definition^.parast^.call_offset:=procinfo.call_offset;
  329. end;
  330. end;
  331. if (p^.registers32<4) then
  332. begin
  333. for i:=1 to maxvarregs do
  334. regvars[i]:=nil;
  335. parasym:=false;
  336. {$ifdef tp}
  337. symtablestack^.foreach(searchregvars);
  338. {$else}
  339. symtablestack^.foreach(@searchregvars);
  340. {$endif}
  341. { copy parameter into a register ? }
  342. parasym:=true;
  343. {$ifdef tp}
  344. symtablestack^.next^.foreach(searchregvars);
  345. {$else}
  346. symtablestack^.next^.foreach(@searchregvars);
  347. {$endif}
  348. { hold needed registers free }
  349. for i:=maxvarregs downto maxvarregs-p^.registers32+1 do
  350. regvars[i]:=nil;
  351. { now assign register }
  352. for i:=1 to maxvarregs-p^.registers32 do
  353. begin
  354. if assigned(regvars[i]) then
  355. begin
  356. { it is nonsens, to copy the variable to }
  357. { a register because we need then much }
  358. { pushes ? }
  359. if reg_pushes[varregs[i]]>=regvars[i]^.refs then
  360. begin
  361. regvars[i]:=nil;
  362. goto nextreg;
  363. end;
  364. { register is no longer available for }
  365. { expressions }
  366. { search the register which is the most }
  367. { unused }
  368. usableregs:=usableregs-[varregs[i]];
  369. is_reg_var[varregs[i]]:=true;
  370. dec(c_usableregs);
  371. { possibly no 32 bit register are needed }
  372. if (regvars[i]^.definition^.deftype=orddef) and
  373. (porddef(regvars[i]^.definition)^.typ in [bool8bit,uchar,u8bit,s8bit]) then
  374. begin
  375. regvars[i]^.reg:=reg32toreg8(varregs[i]);
  376. regsize:=S_B;
  377. end
  378. else if (regvars[i]^.definition^.deftype=orddef) and
  379. (porddef(regvars[i]^.definition)^.typ in [bool16bit,u16bit,s16bit]) then
  380. begin
  381. regvars[i]^.reg:=reg32toreg16(varregs[i]);
  382. regsize:=S_W;
  383. end
  384. else
  385. begin
  386. regvars[i]^.reg:=varregs[i];
  387. regsize:=S_L;
  388. end;
  389. { parameter must be load }
  390. if regvars_para[i] then
  391. begin
  392. { procinfo is there actual, }
  393. { because we can't never be in a }
  394. { nested procedure }
  395. { when loading parameter to reg }
  396. new(hr);
  397. reset_reference(hr^);
  398. hr^.offset:=pvarsym(regvars[i])^.address+procinfo.call_offset;
  399. hr^.base:=procinfo.framepointer;
  400. procinfo.aktentrycode^.concat(new(pai386,op_ref_reg(A_MOV,regsize,
  401. hr,regvars[i]^.reg)));
  402. unused:=unused - [regvars[i]^.reg];
  403. end;
  404. { procedure uses this register }
  405. usedinproc:=usedinproc or ($80 shr byte(varregs[i]));
  406. end;
  407. nextreg:
  408. { dummy }
  409. regsize:=S_W;
  410. end;
  411. if (verbosity and v_debug)=v_debug then
  412. begin
  413. for i:=1 to maxvarregs do
  414. begin
  415. if assigned(regvars[i]) then
  416. Message3(cg_d_register_weight,reg2str(regvars[i]^.reg),
  417. tostr(regvars[i]^.refs),regvars[i]^.name);
  418. end;
  419. end;
  420. end;
  421. end;
  422. if assigned(aktprocsym) and
  423. ((aktprocsym^.definition^.options and poinline)<>0) then
  424. make_const_global:=true;
  425. do_secondpass(p);
  426. {$ifdef StoreFPULevel}
  427. procinfo.def^.fpu_used:=p^.registersfpu;
  428. {$endif StoreFPULevel}
  429. { all registers can be used again }
  430. usableregs:=[R_EAX,R_EBX,R_ECX,R_EDX];
  431. {$ifdef SUPPORT_MMX}
  432. usableregs:=usableregs+[R_MM0..R_MM6];
  433. {$endif SUPPORT_MMX}
  434. c_usableregs:=4;
  435. end;
  436. procinfo.aktproccode^.concatlist(exprasmlist);
  437. make_const_global:=false;
  438. current_module^.current_inputfile:=oldis;
  439. current_module^.current_inputfile^.line_no:=oldnr;
  440. end;
  441. end.
  442. {
  443. $Log$
  444. Revision 1.39 1998-06-12 10:32:23 pierre
  445. * column problem hopefully solved
  446. + C vars declaration changed
  447. Revision 1.38 1998/06/09 16:01:37 pierre
  448. + added procedure directive parsing for procvars
  449. (accepted are popstack cdecl and pascal)
  450. + added C vars with the following syntax
  451. var C calias 'true_c_name';(can be followed by external)
  452. reason is that you must add the Cprefix
  453. which is target dependent
  454. Revision 1.37 1998/06/08 13:13:41 pierre
  455. + temporary variables now in temp_gen.pas unit
  456. because it is processor independent
  457. * mppc68k.bat modified to undefine i386 and support_mmx
  458. (which are defaults for i386)
  459. Revision 1.36 1998/06/05 17:49:54 peter
  460. * cleanup of cgai386
  461. Revision 1.35 1998/06/05 16:13:32 pierre
  462. * fix for real and string consts inside inlined procs
  463. Revision 1.34 1998/06/05 14:37:27 pierre
  464. * fixes for inline for operators
  465. * inline procedure more correctly restricted
  466. Revision 1.33 1998/06/04 23:51:37 peter
  467. * m68k compiles
  468. + .def file creation moved to gendef.pas so it could also be used
  469. for win32
  470. Revision 1.32 1998/06/04 09:55:35 pierre
  471. * demangled name of procsym reworked to become independant of the mangling scheme
  472. Come test_funcret improvements (not yet working)S: ----------------------------------------------------------------------
  473. Revision 1.31 1998/06/03 22:48:52 peter
  474. + wordbool,longbool
  475. * rename bis,von -> high,low
  476. * moved some systemunit loading/creating to psystem.pas
  477. Revision 1.30 1998/06/02 17:03:00 pierre
  478. * with node corrected for objects
  479. * small bugs for SUPPORT_MMX fixed
  480. Revision 1.29 1998/06/01 16:50:18 peter
  481. + boolean -> ord conversion
  482. * fixed ord -> boolean conversion
  483. Revision 1.28 1998/05/28 17:26:47 peter
  484. * fixed -R switch, it didn't work after my previous akt/init patch
  485. * fixed bugs 110,130,136
  486. Revision 1.27 1998/05/25 17:11:38 pierre
  487. * firstpasscount bug fixed
  488. now all is already set correctly the first time
  489. under EXTDEBUG try -gp to skip all other firstpasses
  490. it works !!
  491. * small bug fixes
  492. - for smallsets with -dTESTSMALLSET
  493. - some warnings removed (by correcting code !)
  494. Revision 1.26 1998/05/23 01:21:03 peter
  495. + aktasmmode, aktoptprocessor, aktoutputformat
  496. + smartlink per module $SMARTLINK-/+ (like MMX) and moved to aktswitches
  497. + $LIBNAME to set the library name where the unit will be put in
  498. * splitted cgi386 a bit (codeseg to large for bp7)
  499. * nasm, tasm works again. nasm moved to ag386nsm.pas
  500. Revision 1.25 1998/05/21 19:33:31 peter
  501. + better procedure directive handling and only one table
  502. Revision 1.24 1998/05/20 09:42:33 pierre
  503. + UseTokenInfo now default
  504. * unit in interface uses and implementation uses gives error now
  505. * only one error for unknown symbol (uses lastsymknown boolean)
  506. the problem came from the label code !
  507. + first inlined procedures and function work
  508. (warning there might be allowed cases were the result is still wrong !!)
  509. * UseBrower updated gives a global list of all position of all used symbols
  510. with switch -gb
  511. Revision 1.23 1998/05/12 10:46:58 peter
  512. * moved printstatus to verb_def
  513. + V_Normal which is between V_Error and V_Warning and doesn't have a
  514. prefix like error: warning: and is included in V_Default
  515. * fixed some messages
  516. * first time parameter scan is only for -v and -T
  517. - removed old style messages
  518. Revision 1.22 1998/05/07 00:17:00 peter
  519. * smartlinking for sets
  520. + consts labels are now concated/generated in hcodegen
  521. * moved some cpu code to cga and some none cpu depended code from cga
  522. to tree and hcodegen and cleanup of hcodegen
  523. * assembling .. output reduced for smartlinking ;)
  524. Revision 1.21 1998/05/06 08:38:36 pierre
  525. * better position info with UseTokenInfo
  526. UseTokenInfo greatly simplified
  527. + added check for changed tree after first time firstpass
  528. (if we could remove all the cases were it happen
  529. we could skip all firstpass if firstpasscount > 1)
  530. Only with ExtDebug
  531. Revision 1.20 1998/05/01 16:38:44 florian
  532. * handling of private and protected fixed
  533. + change_keywords_to_tp implemented to remove
  534. keywords which aren't supported by tp
  535. * break and continue are now symbols of the system unit
  536. + widestring, longstring and ansistring type released
  537. Revision 1.19 1998/04/30 15:59:39 pierre
  538. * GDB works again better :
  539. correct type info in one pass
  540. + UseTokenInfo for better source position
  541. * fixed one remaining bug in scanner for line counts
  542. * several little fixes
  543. Revision 1.18 1998/04/29 10:33:48 pierre
  544. + added some code for ansistring (not complete nor working yet)
  545. * corrected operator overloading
  546. * corrected nasm output
  547. + started inline procedures
  548. + added starstarn : use ** for exponentiation (^ gave problems)
  549. + started UseTokenInfo cond to get accurate positions
  550. Revision 1.17 1998/04/27 23:10:27 peter
  551. + new scanner
  552. * $makelib -> if smartlink
  553. * small filename fixes pmodule.setfilename
  554. * moved import from files.pas -> import.pas
  555. Revision 1.16 1998/04/23 21:52:08 florian
  556. * fixes of Jonas applied
  557. Revision 1.15 1998/04/22 21:06:49 florian
  558. * last fixes before the release:
  559. - veryyyy slow firstcall fixed
  560. Revision 1.14 1998/04/21 10:16:47 peter
  561. * patches from strasbourg
  562. * objects is not used anymore in the fpc compiled version
  563. Revision 1.13 1998/04/14 23:27:02 florian
  564. + exclude/include with constant second parameter added
  565. Revision 1.12 1998/04/13 21:15:41 florian
  566. * error handling of pass_1 and cgi386 fixed
  567. * the following bugs fixed: 0117, 0118, 0119 and 0129, 0122 was already
  568. fixed, verified
  569. Revision 1.11 1998/04/13 08:42:51 florian
  570. * call by reference and call by value open arrays fixed
  571. Revision 1.10 1998/04/12 22:39:43 florian
  572. * problem with read access to properties solved
  573. * correct handling of hidding methods via virtual (COM)
  574. * correct result type of constructor calls (COM), the resulttype
  575. depends now on the type of the class reference
  576. Revision 1.9 1998/04/10 21:36:55 florian
  577. + some stuff to support method pointers (procedure of object) added
  578. (declaration, parameter handling)
  579. Revision 1.8 1998/04/09 22:16:33 florian
  580. * problem with previous REGALLOC solved
  581. * improved property support
  582. Revision 1.7 1998/04/09 14:28:05 jonas
  583. + basic k6 and 6x86 optimizing support (-O7 and -O8)
  584. Revision 1.6 1998/04/08 11:34:20 peter
  585. * nasm works (linux only tested)
  586. Revision 1.5 1998/04/07 22:45:04 florian
  587. * bug0092, bug0115 and bug0121 fixed
  588. + packed object/class/array
  589. Revision 1.4 1998/04/07 13:19:42 pierre
  590. * bugfixes for reset_gdb_info
  591. in MEM parsing for go32v2
  592. better external symbol creation
  593. support for rhgdb.exe (lowercase file names)
  594. }