nppcmat.pas 25 KB

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