2 THE COMPUTER CODE CONTAINED HEREIN IS THE SOLE PROPERTY OF PARALLAX
3 SOFTWARE CORPORATION ("PARALLAX"). PARALLAX, IN DISTRIBUTING THE CODE TO
4 END-USERS, AND SUBJECT TO ALL OF THE TERMS AND CONDITIONS HEREIN, GRANTS A
5 ROYALTY-FREE, PERPETUAL LICENSE TO SUCH END-USERS FOR USE BY SUCH END-USERS
6 IN USING, DISPLAYING, AND CREATING DERIVATIVE WORKS THEREOF, SO LONG AS
7 SUCH USE, DISPLAY OR CREATION IS FOR NON-COMMERCIAL, ROYALTY OR REVENUE
8 FREE PURPOSES. IN NO EVENT SHALL THE END-USER USE THE COMPUTER CODE
9 CONTAINED HEREIN FOR REVENUE-BEARING PURPOSES. THE END-USER UNDERSTANDS
10 AND AGREES TO THE TERMS HEREIN AND ACCEPTS THE SAME BY USE OF THIS FILE.
11 COPYRIGHT 1993-1998 PARALLAX SOFTWARE CORPORATION. ALL RIGHTS RESERVED.
14 * $Source: /cvs/cvsroot/d2x/maths/fixc.c,v $
17 * $Date: 2002-10-28 19:49:15 $
19 * C version of fixed point library
21 * $Log: not supported by cvs2svn $
22 * Revision 1.3 2001/10/31 07:41:54 bradleyb
25 * Revision 1.2 2001/01/31 15:18:04 bradleyb
26 * Makefile and conf.h fixes
28 * Revision 1.1.1.1 2001/01/19 03:29:58 bradleyb
31 * Revision 1.3 1999/10/18 00:31:01 donut
32 * more alpha fixes from Falk Hueffner
34 * Revision 1.2 1999/08/05 22:53:41 sekmu
36 * D3D patch(es) from ADB
38 * Revision 1.1.1.1 1999/06/14 22:13:35 donut
39 * Import of d1x 1.37 source.
41 * Revision 1.7 1995/09/22 14:08:16 allender
42 * fixed fix_atan2 to work correctly with doubles
44 * Revision 1.6 1995/08/31 15:43:49 allender
45 * *** empty log message ***
47 * Revision 1.5 1995/07/05 16:15:15 allender
48 * make fixmuldiv use doubles for PPC implementation
50 * Revision 1.4 1995/05/15 13:57:36 allender
51 * make fixmuldiv compile when compiling under 68k
53 * Revision 1.3 1995/05/11 13:02:59 allender
54 * some routines are now in assembly
56 * Revision 1.2 1995/05/04 20:04:45 allender
57 * use MPW fixdiv if compiling with MPW (why did I do this?)
59 * Revision 1.1 1995/04/17 11:37:54 allender
64 * Revision 1.1 1995/03/08 18:55:09 matt
75 static char rcsid[] = "$Id: fixc.c,v 1.4 2002-10-28 19:49:15 btb Exp $";
86 #pragma message ("warning: FIX NOT INLINED")
88 #warning "FIX NOT INLINED"
92 extern ubyte guess_table[];
93 extern short sincos_table[];
94 extern ushort asin_table[];
95 extern ushort acos_table[];
96 extern fix isqrt_guess_table[];
99 void fixquadnegate(quadint *q)
102 q->high = 0 - q->high - (q->low != 0);
105 //multiply two ints & add 64-bit result to 64-bit sum
106 void fixmulaccum(quadint *q,fix a,fix b)
109 u_int32_t ah,al,bh,bl;
115 aa = labs(a); bb = labs(b);
117 ah = aa>>16; al = aa&0xffff;
118 bh = bb>>16; bl = bb&0xffff;
127 if (q->low < old) q->high++;
131 if (q->low < old) q->high++;
133 q->high += ah*bh + (t>>16) + c;
140 //extract a fix from a quad product
141 fix fixquadadjust(quadint *q)
143 return (q->high<<16) + (q->low>>16);
147 #define EPSILON (F1_0/100)
150 #define QLONG __int64
152 #define QLONG long long
156 fix fixmul(fix a, fix b) {
157 /* return (fix)(((double)a*(double)b)/65536.0);*/
159 asm("imul %%edx; shrd $16,%%edx,%%eax" : "=a" (ret) : "a" (a), "d" (b) : "%edx");
161 return (fix)((((QLONG)a)*b) >> 16);
164 fix fixdiv(fix a, fix b)
166 /* return (fix)(((double)a * 65536.0) / (double)b);*/
167 return (fix)((((QLONG)a) << 16)/b);
169 asm("mov %%eax,%%edx; sar $16,%%edx; shl $16,%%eax; idiv %%ebx" : "=a" (ret) : "a" (a), "b" (b) : "%edx");
173 fix fixmuldiv(fix a, fix b, fix c)
176 asm("imul %%edx; idiv %%ebx" : "=a" (ret) : "a" (a), "d" (b), "b" (c) : "%edx");
181 d = (double)a * (double) b;
182 return (fix)(d / (double) c);
184 return (fix)((((QLONG)a)*b)/c);
188 //given cos & sin of an angle, return that angle.
189 //parms need not be normalized, that is, the ratio of the parms cos/sin must
190 //equal the ratio of the actual cos & sin for the result angle, but the parms
191 //need not be the actual cos & sin.
192 //NOTE: this is different from the standard C atan2, since it is left-handed.
194 fixang fix_atan2(fix cos,fix sin)
196 double d, dsin, dcos;
199 //Assert(!(cos==0 && sin==0));
201 //find smaller of two
205 d = sqrt((dsin * dsin) + (dcos * dcos));
210 if (labs(sin) < labs(cos)) { //sin is smaller, use arcsin
211 t = fix_asin((fix)((dsin / d) * 65536.0));
217 t = fix_acos((fix)((dcos / d) * 65536.0));
225 //divide a quadint by a fix, returning a fix
226 int32_t fixdivquadlong(u_int32_t nl,u_int32_t nh,u_int32_t d)
236 Q = ((nh&0x80000000)!=0);
237 M = ((d&0x80000000)!=0);
242 for (i=0; i<32; i++ ) {
246 T = ((nl&0x80000000L)!=0);
252 Q = (unsigned char)((0x80000000L & nh) != 0 );
253 nh = (nh << 1) | (u_int32_t)T;
261 Q = (unsigned char)(tmp1 == 0);
264 Q = (unsigned char)((0x80000000L & nh) != 0 );
265 nh = (nh << 1) | (u_int32_t)T;
273 Q = (unsigned char)(tmp1 == 0);
281 for (i=0; i<32; i++ ) {
285 T = ((nl&0x80000000L)!=0);
291 Q = (unsigned char)((0x80000000L & nh) != 0 );
292 nh = (nh << 1) | (u_int32_t)T;
300 Q = (unsigned char)(tmp1 == 0);
303 Q = (unsigned char)((0x80000000L & nh) != 0 );
304 nh = (nh << 1) | (u_int32_t)T;
312 Q = (unsigned char)(tmp1 == 0);
324 unsigned int fixdivquadlongu(uint nl, uint nh, uint d)
326 return fixdivquadlong((u_int32_t) nl,(u_int32_t) nh,(u_int32_t) d);
329 int32_t fixdivquadlong(u_int32_t nl,u_int32_t nh,u_int32_t d) {
333 :"a" (nl), "d" (nh), "r" (d)
338 static inline u_int32_t fixdivquadlongu(u_int32_t nl,u_int32_t nh,u_int32_t d) {
342 :"a" (nl), "d" (nh), "r" (d)
349 u_int32_t quad_sqrt(u_int32_t low,int32_t high)
358 if (high==0 && (int32_t)low>=0)
359 return long_sqrt((int32_t)low);
361 if (high & 0xff000000) {
362 cnt=12+16; i = high >> 24;
363 } else if (high & 0xff0000) {
364 cnt=8+16; i = high >> 16;
365 } else if (high & 0xff00) {
366 cnt=4+16; i = high >> 8;
371 r = guess_table[i]<<cnt;
373 //quad loop usually executed 4 times
375 r = (fixdivquadlongu(low,high,r)+r)/2;
376 r = (fixdivquadlongu(low,high,r)+r)/2;
377 r = (fixdivquadlongu(low,high,r)+r)/2;
382 t = fixdivquadlongu(low,high,r);
389 } while (!(r==t || r==old_r));
391 t = fixdivquadlongu(low,high,r);
392 //edited 05/17/99 Matt Mueller - tq.high is undefined here.. so set them to = 0
395 fixmulaccum(&tq,r,t);
396 if (tq.low!=low || tq.high!=high)
402 //computes the square root of a long, returning a short
403 ushort long_sqrt(int32_t a)
412 else if (a & 0xff0000)
419 r = guess_table[(a>>cnt)&0xff]<<cnt;
421 //the loop nearly always executes 3 times, so we'll unroll it 2 times and
422 //not do any checking until after the third time. By my calcutations, the
423 //loop is executed 2 times in 99.97% of cases, 3 times in 93.65% of cases,
424 //four times in 16.18% of cases, and five times in 0.44% of cases. It never
425 //executes more than five times. By timing, I determined that is is faster
426 //to always execute three times and not check for termination the first two
427 //times through. This means that in 93.65% of cases, we save 6 cmp/jcc pairs,
428 //and in 6.35% of cases we do an extra divide. In real life, these numbers
429 //might not be the same.
444 } while (!(r==t || r==old_r));
452 //computes the square root of a fix, returning a fix
455 return ((fix) long_sqrt(a)) << 8;
459 //compute sine and cosine of an angle, filling in the variables
460 //either of the pointers can be NULL
462 void fix_sincos(fix a,fix *s,fix *c)
470 ss = sincos_table[i];
471 if (s) *s = (ss + (((sincos_table[i+1] - ss) * f)>>8))<<2;
473 cc = sincos_table[i+64];
474 if (c) *c = (cc + (((sincos_table[i+64+1] - cc) * f)>>8))<<2;
477 //compute sine and cosine of an angle, filling in the variables
478 //either of the pointers can be NULL
480 void fix_fastsincos(fix a,fix *s,fix *c)
486 if (s) *s = sincos_table[i] << 2;
487 if (c) *c = sincos_table[i+64] << 2;
490 //compute inverse sine
491 fixang fix_asin(fix v)
498 if (vv >= f1_0) //check for out of range
505 aa = aa + (((asin_table[i+1] - aa) * f)>>8);
513 //compute inverse cosine
514 fixang fix_acos(fix v)
521 if (vv >= f1_0) //check for out of range
528 aa = aa + (((acos_table[i+1] - aa) * f)>>8);
536 #define TABLE_SIZE 1024
538 //for passed value a, returns 1/sqrt(a)
539 fix fix_isqrt( fix a )
545 if ( a == 0 ) return 0;
547 while( b >= TABLE_SIZE ) {
552 //printf( "Count = %d (%d>>%d)\n", cnt, b, (cnt+1)/2 );
553 r = isqrt_guess_table[b] >> ((cnt+1)/2);
555 //printf( "Initial r = %d\n", r );
557 for (i=0; i<3; i++ ) {
559 r = fixmul( ( (3*65536) - fixmul(fixmul(r,r),a) ), r) / 2;
560 //printf( "r %d = %d\n", i, r );
561 if ( old_r >= r ) return (r+old_r)/2;