nppcmat.pas 24 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632
  1. {
  2. $Id$
  3. Copyright (c) 1998-2002 by Florian Klaempfl
  4. Generate PowerPC assembler for math 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 nppcmat;
  19. {$i fpcdefs.inc}
  20. interface
  21. uses
  22. node,nmat;
  23. type
  24. tppcmoddivnode = class(tmoddivnode)
  25. procedure pass_2;override;
  26. end;
  27. tppcshlshrnode = class(tshlshrnode)
  28. procedure pass_2;override;
  29. { everything will be handled in pass_2 }
  30. function first_shlshr64bitint: tnode; override;
  31. end;
  32. tppcunaryminusnode = class(tunaryminusnode)
  33. procedure pass_2;override;
  34. end;
  35. tppcnotnode = class(tnotnode)
  36. procedure pass_2;override;
  37. end;
  38. implementation
  39. uses
  40. globtype,systems,
  41. cutils,verbose,globals,
  42. symconst,symdef,
  43. aasmbase,aasmcpu,aasmtai,
  44. defutil,
  45. cgbase,cgobj,pass_1,pass_2,
  46. ncon,
  47. cpubase,cpuinfo,
  48. ncgutil,cgcpu,cg64f32,rgobj;
  49. {*****************************************************************************
  50. TPPCMODDIVNODE
  51. *****************************************************************************}
  52. procedure tppcmoddivnode.pass_2;
  53. const
  54. { signed overflow }
  55. divops: array[boolean, boolean] of tasmop =
  56. ((A_DIVWU,A_DIVWUO_),(A_DIVW,A_DIVWO_));
  57. var
  58. power : longint;
  59. op : tasmop;
  60. numerator,
  61. divider,
  62. resultreg : tregister;
  63. size : Tcgsize;
  64. begin
  65. secondpass(left);
  66. secondpass(right);
  67. location_copy(location,left.location);
  68. { put numerator in register }
  69. size:=def_cgsize(left.resulttype.def);
  70. location_force_reg(exprasmlist,left.location,
  71. size,true);
  72. location_copy(location,left.location);
  73. numerator := location.register;
  74. resultreg := location.register;
  75. if (location.loc = LOC_CREGISTER) then
  76. begin
  77. location.loc := LOC_REGISTER;
  78. location.register := cg.getintregister(exprasmlist,size);
  79. resultreg := location.register;
  80. end;
  81. if (nodetype = modn) then
  82. begin
  83. resultreg := cg.getintregister(exprasmlist,size);
  84. end;
  85. if (nodetype = divn) and
  86. (right.nodetype = ordconstn) and
  87. ispowerof2(tordconstnode(right).value,power) then
  88. begin
  89. { From "The PowerPC Compiler Writer's Guide": }
  90. { This code uses the fact that, in the PowerPC architecture, }
  91. { the shift right algebraic instructions set the Carry bit if }
  92. { the source register contains a negative number and one or }
  93. { more 1-bits are shifted out. Otherwise, the carry bit is }
  94. { cleared. The addze instruction corrects the quotient, if }
  95. { necessary, when the dividend is negative. For example, if }
  96. { n = -13, (0xFFFF_FFF3), and k = 2, after executing the srawi }
  97. { instruction, q = -4 (0xFFFF_FFFC) and CA = 1. After executing }
  98. { the addze instruction, q = -3, the correct quotient. }
  99. cg.a_op_const_reg_reg(exprasmlist,OP_SAR,OS_32,aword(power),
  100. numerator,resultreg);
  101. exprasmlist.concat(taicpu.op_reg_reg(A_ADDZE,resultreg,resultreg));
  102. end
  103. else
  104. begin
  105. { load divider in a register if necessary }
  106. location_force_reg(exprasmlist,right.location,
  107. def_cgsize(right.resulttype.def),true);
  108. divider := right.location.register;
  109. { needs overflow checking, (-maxlongint-1) div (-1) overflows! }
  110. { And on PPC, the only way to catch a div-by-0 is by checking }
  111. { the overflow flag (JM) }
  112. op := divops[is_signed(right.resulttype.def),
  113. cs_check_overflow in aktlocalswitches];
  114. exprasmlist.concat(taicpu.op_reg_reg_reg(op,resultreg,numerator,
  115. divider));
  116. if (nodetype = modn) then
  117. begin
  118. exprasmlist.concat(taicpu.op_reg_reg_reg(A_MULLW,resultreg,
  119. divider,resultreg));
  120. cg.ungetregister(exprasmlist,divider);
  121. exprasmlist.concat(taicpu.op_reg_reg_reg(A_SUB,location.register,
  122. numerator,resultreg));
  123. cg.ungetregister(exprasmlist,resultreg);
  124. resultreg := location.register;
  125. end
  126. else
  127. cg.ungetregister(exprasmlist,divider);
  128. end;
  129. { free used registers }
  130. if numerator <> resultreg then
  131. cg.ungetregister(exprasmlist,numerator);
  132. { set result location }
  133. location.loc:=LOC_REGISTER;
  134. location.register:=resultreg;
  135. cg.g_overflowcheck(exprasmlist,location,resulttype.def);
  136. end;
  137. {*****************************************************************************
  138. TPPCSHLRSHRNODE
  139. *****************************************************************************}
  140. function tppcshlshrnode.first_shlshr64bitint: tnode;
  141. begin
  142. result := nil;
  143. end;
  144. procedure tppcshlshrnode.pass_2;
  145. var
  146. resultreg, hregister1,hregister2,
  147. hregisterhigh,hregisterlow : tregister;
  148. op : topcg;
  149. asmop1, asmop2: tasmop;
  150. shiftval: aword;
  151. r : Tregister;
  152. begin
  153. secondpass(left);
  154. secondpass(right);
  155. if is_64bitint(left.resulttype.def) then
  156. begin
  157. location_force_reg(exprasmlist,left.location,
  158. def_cgsize(left.resulttype.def),true);
  159. location_copy(location,left.location);
  160. hregisterhigh := location.registerhigh;
  161. hregisterlow := location.registerlow;
  162. if (location.loc = LOC_CREGISTER) then
  163. begin
  164. location.loc := LOC_REGISTER;
  165. location.registerhigh := cg.getintregister(exprasmlist,OS_32);
  166. location.registerlow := cg.getintregister(exprasmlist,OS_32);
  167. end;
  168. if (right.nodetype = ordconstn) then
  169. begin
  170. shiftval := tordconstnode(right).value;
  171. if tordconstnode(right).value > 31 then
  172. begin
  173. if nodetype = shln then
  174. begin
  175. cg.a_op_const_reg_reg(exprasmlist,OP_SHL,OS_32,
  176. shiftval and 31,hregisterlow,location.registerhigh);
  177. cg.a_load_const_reg(exprasmlist,OS_32,0,location.registerlow);
  178. end
  179. else
  180. begin
  181. cg.a_op_const_reg_reg(exprasmlist,OP_SHR,OS_32,
  182. shiftval and 31,hregisterhigh,location.registerlow);
  183. cg.a_load_const_reg(exprasmlist,OS_32,0,location.registerhigh);
  184. end;
  185. end
  186. else
  187. begin
  188. if nodetype = shln then
  189. begin
  190. exprasmlist.concat(taicpu.op_reg_reg_const_const_const(
  191. A_RLWINM,location.registerhigh,hregisterhigh,shiftval,
  192. 0,31-shiftval));
  193. exprasmlist.concat(taicpu.op_reg_reg_const_const_const(
  194. A_RLWIMI,location.registerhigh,hregisterlow,shiftval,
  195. 32-shiftval,31));
  196. exprasmlist.concat(taicpu.op_reg_reg_const_const_const(
  197. A_RLWINM,location.registerlow,hregisterlow,shiftval,
  198. 0,31-shiftval));
  199. end
  200. else
  201. begin
  202. exprasmlist.concat(taicpu.op_reg_reg_const_const_const(
  203. A_RLWINM,location.registerlow,hregisterlow,32-shiftval,
  204. shiftval,31));
  205. exprasmlist.concat(taicpu.op_reg_reg_const_const_const(
  206. A_RLWIMI,location.registerlow,hregisterhigh,32-shiftval,
  207. 0,shiftval-1));
  208. exprasmlist.concat(taicpu.op_reg_reg_const_const_const(
  209. A_RLWINM,location.registerhigh,hregisterhigh,32-shiftval,
  210. shiftval,31));
  211. end;
  212. end;
  213. end
  214. else
  215. { no constant shiftcount }
  216. begin
  217. location_force_reg(exprasmlist,right.location,OS_S32,true);
  218. hregister1 := right.location.register;
  219. if nodetype = shln then
  220. begin
  221. asmop1 := A_SLW;
  222. asmop2 := A_SRW;
  223. end
  224. else
  225. begin
  226. asmop1 := A_SRW;
  227. asmop2 := A_SLW;
  228. resultreg := hregisterhigh;
  229. hregisterhigh := hregisterlow;
  230. hregisterlow := resultreg;
  231. resultreg := location.registerhigh;
  232. location.registerhigh := location.registerlow;
  233. location.registerlow := resultreg;
  234. end;
  235. cg.getexplicitregister(exprasmlist,NR_R0);
  236. exprasmlist.concat(taicpu.op_reg_reg_const(A_SUBFIC,
  237. NR_R0,hregister1,32));
  238. exprasmlist.concat(taicpu.op_reg_reg_reg(asmop1,
  239. location.registerhigh,hregisterhigh,hregister1));
  240. exprasmlist.concat(taicpu.op_reg_reg_reg(asmop2,
  241. NR_R0,hregisterlow,NR_R0));
  242. exprasmlist.concat(taicpu.op_reg_reg_reg(A_OR,
  243. location.registerhigh,location.registerhigh,NR_R0));
  244. exprasmlist.concat(taicpu.op_reg_reg_const(A_SUBI,
  245. NR_R0,hregister1,32));
  246. exprasmlist.concat(taicpu.op_reg_reg_reg(asmop1,
  247. NR_R0,hregisterlow,NR_R0));
  248. exprasmlist.concat(taicpu.op_reg_reg_reg(A_OR,
  249. location.registerhigh,location.registerhigh,NR_R0));
  250. exprasmlist.concat(taicpu.op_reg_reg_reg(asmop1,
  251. location.registerlow,hregisterlow,hregister1));
  252. cg.ungetregister(exprasmlist,NR_R0);
  253. if nodetype = shrn then
  254. begin
  255. resultreg := location.registerhigh;
  256. location.registerhigh := location.registerlow;
  257. location.registerlow := resultreg;
  258. end;
  259. cg.ungetregister(exprasmlist,hregister1);
  260. end
  261. end
  262. else
  263. begin
  264. { load left operators in a register }
  265. location_force_reg(exprasmlist,left.location,def_cgsize(left.resulttype.def),true);
  266. location_copy(location,left.location);
  267. resultreg := location.register;
  268. hregister1 := location.register;
  269. if (location.loc = LOC_CREGISTER) then
  270. begin
  271. location.loc := LOC_REGISTER;
  272. resultreg := cg.getintregister(exprasmlist,OS_32);
  273. location.register := resultreg;
  274. end;
  275. { determine operator }
  276. if nodetype=shln then
  277. op:=OP_SHL
  278. else
  279. op:=OP_SHR;
  280. { shifting by a constant directly coded: }
  281. if (right.nodetype=ordconstn) then
  282. cg.a_op_const_reg_reg(exprasmlist,op,OS_32,
  283. tordconstnode(right).value and 31,hregister1,resultreg)
  284. else
  285. begin
  286. { load shift count in a register if necessary }
  287. location_force_reg(exprasmlist,right.location,def_cgsize(right.resulttype.def),true);
  288. hregister2 := right.location.register;
  289. cg.a_op_reg_reg_reg(exprasmlist,op,OS_32,hregister2,
  290. hregister1,resultreg);
  291. cg.ungetregister(exprasmlist,hregister2);
  292. end;
  293. end;
  294. end;
  295. {*****************************************************************************
  296. TPPCUNARYMINUSNODE
  297. *****************************************************************************}
  298. procedure tppcunaryminusnode.pass_2;
  299. var
  300. src1, src2, tmp: tregister;
  301. op: tasmop;
  302. begin
  303. secondpass(left);
  304. if is_64bitint(left.resulttype.def) then
  305. begin
  306. location_force_reg(exprasmlist,left.location,def_cgsize(left.resulttype.def),true);
  307. location_copy(location,left.location);
  308. if (location.loc = LOC_CREGISTER) then
  309. begin
  310. location.registerlow := cg.getintregister(exprasmlist,OS_INT);
  311. location.registerhigh := cg.getintregister(exprasmlist,OS_INT);
  312. location.loc := LOC_REGISTER;
  313. end;
  314. exprasmlist.concat(taicpu.op_reg_reg_const(A_SUBFIC,
  315. location.registerlow,left.location.registerlow,0));
  316. if not(cs_check_overflow in aktlocalswitches) then
  317. exprasmlist.concat(taicpu.op_reg_reg(A_SUBFZE,
  318. location.registerhigh,left.location.registerhigh))
  319. else
  320. exprasmlist.concat(taicpu.op_reg_reg(A_SUBFZEO_,
  321. location.registerhigh,left.location.registerhigh));
  322. end
  323. else
  324. begin
  325. location_copy(location,left.location);
  326. location.loc:=LOC_REGISTER;
  327. case left.location.loc of
  328. LOC_FPUREGISTER, LOC_REGISTER:
  329. begin
  330. src1 := left.location.register;
  331. location.register := src1;
  332. end;
  333. LOC_CFPUREGISTER, LOC_CREGISTER:
  334. begin
  335. src1 := left.location.register;
  336. if left.location.loc = LOC_CREGISTER then
  337. location.register := cg.getintregister(exprasmlist,OS_INT)
  338. else
  339. location.register := cg.getfpuregister(exprasmlist,location.size);
  340. end;
  341. LOC_REFERENCE,LOC_CREFERENCE:
  342. begin
  343. if (left.resulttype.def.deftype=floatdef) then
  344. begin
  345. src1 := cg.getfpuregister(exprasmlist,def_cgsize(left.resulttype.def));
  346. location.register := src1;
  347. cg.a_loadfpu_ref_reg(exprasmlist,
  348. def_cgsize(left.resulttype.def),
  349. left.location.reference,src1);
  350. end
  351. else
  352. begin
  353. src1 := cg.getintregister(exprasmlist,OS_32);
  354. location.register:= src1;
  355. cg.a_load_ref_reg(exprasmlist,OS_32,OS_32,
  356. left.location.reference,src1);
  357. end;
  358. reference_release(exprasmlist,left.location.reference);
  359. end;
  360. end;
  361. { choose appropriate operand }
  362. if left.resulttype.def.deftype <> floatdef then
  363. begin
  364. if not(cs_check_overflow in aktlocalswitches) then
  365. op := A_NEG
  366. else
  367. op := A_NEGO_;
  368. location.loc := LOC_REGISTER;
  369. end
  370. else
  371. begin
  372. op := A_FNEG;
  373. location.loc := LOC_FPUREGISTER;
  374. end;
  375. { emit operation }
  376. exprasmlist.concat(taicpu.op_reg_reg(op,location.register,src1));
  377. end;
  378. { Here was a problem... }
  379. { Operand to be negated always }
  380. { seems to be converted to signed }
  381. { 32-bit before doing neg!! }
  382. { So this is useless... }
  383. { that's not true: -2^31 gives an overflow error if it is negated (FK) }
  384. cg.g_overflowcheck(exprasmlist,location,resulttype.def);
  385. end;
  386. {*****************************************************************************
  387. TPPCNOTNODE
  388. *****************************************************************************}
  389. procedure tppcnotnode.pass_2;
  390. var
  391. hl : tasmlabel;
  392. regl, regh: tregister;
  393. begin
  394. if is_boolean(resulttype.def) then
  395. begin
  396. { if the location is LOC_JUMP, we do the secondpass after the
  397. labels are allocated
  398. }
  399. if left.expectloc=LOC_JUMP then
  400. begin
  401. hl:=truelabel;
  402. truelabel:=falselabel;
  403. falselabel:=hl;
  404. secondpass(left);
  405. maketojumpbool(exprasmlist,left,lr_load_regvars);
  406. hl:=truelabel;
  407. truelabel:=falselabel;
  408. falselabel:=hl;
  409. location.loc:=LOC_JUMP;
  410. end
  411. else
  412. begin
  413. secondpass(left);
  414. case left.location.loc of
  415. LOC_FLAGS :
  416. begin
  417. location_copy(location,left.location);
  418. inverse_flags(location.resflags);
  419. end;
  420. LOC_REGISTER, LOC_CREGISTER, LOC_REFERENCE, LOC_CREFERENCE :
  421. begin
  422. location_force_reg(exprasmlist,left.location,def_cgsize(left.resulttype.def),true);
  423. exprasmlist.concat(taicpu.op_reg_const(A_CMPWI,left.location.register,0));
  424. location_release(exprasmlist,left.location);
  425. location_reset(location,LOC_FLAGS,OS_NO);
  426. location.resflags.cr:=RS_CR0;
  427. location.resflags.flag:=F_EQ;
  428. end;
  429. else
  430. internalerror(2003042401);
  431. end;
  432. end;
  433. end
  434. else if is_64bitint(left.resulttype.def) then
  435. begin
  436. secondpass(left);
  437. location_force_reg(exprasmlist,left.location,def_cgsize(left.resulttype.def),false);
  438. location_copy(location,left.location);
  439. { perform the NOT operation }
  440. exprasmlist.concat(taicpu.op_reg_reg(A_NOT,location.registerhigh,
  441. location.registerhigh));
  442. exprasmlist.concat(taicpu.op_reg_reg(A_NOT,location.registerlow,
  443. location.registerlow));
  444. end
  445. else
  446. begin
  447. secondpass(left);
  448. location_force_reg(exprasmlist,left.location,def_cgsize(left.resulttype.def),false);
  449. location_copy(location,left.location);
  450. if location.loc=LOC_CREGISTER then
  451. location.register := cg.getintregister(exprasmlist,OS_INT);
  452. { perform the NOT operation }
  453. exprasmlist.concat(taicpu.op_reg_reg(A_NOT,location.register,
  454. left.location.register));
  455. end;
  456. end;
  457. begin
  458. cmoddivnode:=tppcmoddivnode;
  459. cshlshrnode:=tppcshlshrnode;
  460. cunaryminusnode:=tppcunaryminusnode;
  461. cnotnode:=tppcnotnode;
  462. end.
  463. {
  464. $Log$
  465. Revision 1.35 2003-10-17 01:22:08 florian
  466. * compilation of the powerpc compiler fixed
  467. Revision 1.34 2003/10/01 20:34:49 peter
  468. * procinfo unit contains tprocinfo
  469. * cginfo renamed to cgbase
  470. * moved cgmessage to verbose
  471. * fixed ppc and sparc compiles
  472. Revision 1.33 2003/09/03 19:39:16 peter
  473. * removed empty cga unit
  474. Revision 1.32 2003/09/03 19:35:24 peter
  475. * powerpc compiles again
  476. Revision 1.31 2003/06/14 22:32:43 jonas
  477. * ppc compiles with -dnewra, haven't tried to compile anything with it
  478. yet though
  479. Revision 1.30 2003/06/08 18:20:02 jonas
  480. * fixed small bug where a location was set to LOC_CREGISTER instead of
  481. LOC_REGISTER
  482. Revision 1.29 2003/06/04 11:58:58 jonas
  483. * calculate localsize also in g_return_from_proc since it's now called
  484. before g_stackframe_entry (still have to fix macos)
  485. * compilation fixes (cycle doesn't work yet though)
  486. Revision 1.28 2003/06/01 21:38:06 peter
  487. * getregisterfpu size parameter added
  488. * op_const_reg size parameter added
  489. * sparc updates
  490. Revision 1.27 2003/05/24 19:15:29 jonas
  491. * fixed shr of 64 bit values by non-immediate value
  492. Revision 1.26 2003/05/11 11:45:08 jonas
  493. * fixed shifts
  494. Revision 1.25 2003/04/24 12:57:32 florian
  495. * fixed not node
  496. Revision 1.24 2003/03/11 21:46:24 jonas
  497. * lots of new regallocator fixes, both in generic and ppc-specific code
  498. (ppc compiler still can't compile the linux system unit though)
  499. Revision 1.23 2003/02/19 22:00:16 daniel
  500. * Code generator converted to new register notation
  501. - Horribily outdated todo.txt removed
  502. Revision 1.22 2003/01/09 20:41:10 florian
  503. * fixed broken PowerPC compiler
  504. Revision 1.21 2003/01/08 18:43:58 daniel
  505. * Tregister changed into a record
  506. Revision 1.20 2002/11/25 17:43:28 peter
  507. * splitted defbase in defutil,symutil,defcmp
  508. * merged isconvertable and is_equal into compare_defs(_ext)
  509. * made operator search faster by walking the list only once
  510. Revision 1.19 2002/09/10 21:21:29 jonas
  511. * fixed unary minus of 64bit values
  512. Revision 1.18 2002/09/07 15:25:14 peter
  513. * old logs removed and tabs fixed
  514. Revision 1.17 2002/08/15 15:15:55 carl
  515. * jmpbuf size allocation for exceptions is now cpu specific (as it should)
  516. * more generic nodes for maths
  517. * several fixes for better m68k support
  518. Revision 1.16 2002/08/10 17:15:31 jonas
  519. * various fixes and optimizations
  520. Revision 1.15 2002/07/26 10:48:34 jonas
  521. * fixed bug in shl/shr code
  522. Revision 1.14 2002/07/20 11:58:05 florian
  523. * types.pas renamed to defbase.pas because D6 contains a types
  524. unit so this would conflicts if D6 programms are compiled
  525. + Willamette/SSE2 instructions to assembler added
  526. Revision 1.13 2002/07/11 07:41:27 jonas
  527. * fixed tppcmoddivnode
  528. * fixed 64bit parts of tppcshlshrnode
  529. Revision 1.12 2002/07/09 19:45:01 jonas
  530. * unarynminus and shlshr node fixed for 32bit and smaller ordinals
  531. * small fixes in the assembler writer
  532. * changed scratch registers, because they were used by the linker (r11
  533. and r12) and by the abi under linux (r31)
  534. Revision 1.11 2002/07/07 09:44:32 florian
  535. * powerpc target fixed, very simple units can be compiled
  536. Revision 1.10 2002/05/20 13:30:42 carl
  537. * bugfix of hdisponen (base must be set, not index)
  538. * more portability fixes
  539. Revision 1.9 2002/05/18 13:34:26 peter
  540. * readded missing revisions
  541. Revision 1.8 2002/05/16 19:46:53 carl
  542. + defines.inc -> fpcdefs.inc to avoid conflicts if compiling by hand
  543. + try to fix temp allocation (still in ifdef)
  544. + generic constructor calls
  545. + start of tassembler / tmodulebase class cleanup
  546. Revision 1.5 2002/05/13 19:52:46 peter
  547. * a ppcppc can be build again
  548. Revision 1.4 2002/04/21 15:48:39 carl
  549. * some small updates according to i386 version
  550. Revision 1.3 2002/04/06 18:13:02 jonas
  551. * several powerpc-related additions and fixes
  552. Revision 1.2 2002/01/03 14:57:52 jonas
  553. * completed (not compilale yet though)
  554. }