nppcmat.pas 25 KB

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