minhngoc25a
/
freetype2
mirror of git://git.savannah.gnu.org/freetype/freetype2.git
2
1
Fork 2
Code Issues 4 Releases Wiki Activity

Fixing the fixes :-) More formatting.

This commit is contained in:
Werner Lemberg 2000-05-29 22:40:57 +00:00
parent 4f99c3c423
commit c3c344c76e
1 changed files with 41 additions and 29 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

38
src/base/ftcalc.c
View File

@ -64,7 +64,7 @@
/* */
/* <Description> */
/* Computes the square root of an Int32 integer (which will be */
/* as an unsigned long value). */
/* handled as an unsigned long value). */
/* */
/* <Input> */
/* x :: The value to compute the root for. */
@ -132,13 +132,14 @@
{
FT_Int s;
s = 1;
if ( a < 0 ) { a = -a; s = -s; }
if ( b < 0 ) { b = -b; s = -s; }
if ( c < 0 ) { c = -c; s = -s; }
return s * ( c > 0 ? ( ( (FT_Int64)a * b + ( c >> 1 ) ) / c )
: 0x7FFFFFFF );
return s * ( c > 0 ? ( (FT_Int64)a * b + ( c >> 1 ) ) / c
: 0x7FFFFFFFL );
}
@ -219,7 +220,7 @@
s ^= b; b = ABS(b);
if ( b == 0 )
/* check for divide by 0 */
/* check for division by 0 */
q = 0x7FFFFFFFL;
else
/* compute result directly */
@ -346,12 +347,13 @@
if ( a <= 46340 && b <= 46340 && c <= 176095L && c > 0 )
{
a = a*b + (c >> 1) ) / c;
a = ( a * b + ( c >> 1 ) ) / c;
}
else if ( c > 0 )
{
FT_Int64 temp, temp2;
FT_MulTo64( a, b, &temp );
temp2.hi = (FT_Int32)( c >> 31 );
temp2.lo = (FT_Word32)( c / 2 );
@ -359,7 +361,7 @@
a = FT_Div64by32( &temp, c );
}
else
a = 0x7FFFFFFF;
a = 0x7FFFFFFFL;
return ( s < 0 ) ? -a : a;
}
@ -421,7 +423,9 @@
FT_ULong al = ua & 0xFFFF;
ua = (ua >> 16)*ub + al*(ub >> 16) + ( al*(ub & 0xFFFF) >> 16 );
ua = ( ua >> 16 ) * ub +
al * ( ub >> 16 ) +
( al * ( ub & 0xFFFF ) >> 16 );
}
return ( s < 0 ? -(FT_Long)ua : ua );
@ -447,7 +451,7 @@
/* The result of `(a*0x10000)/b'. */
/* */
/* <Note> */
/* The optimization for FT_DivFix() is simple: If (a << 16) fits in */
/* The optimization for FT_DivFix() is simple: If (a << 16) fits into */
/* 32 bits, then the division is computed directly. Otherwise, we */
/* use a specialized version of the old FT_MulDiv64(). */
/* */
@ -462,8 +466,10 @@
s ^= b; b = ABS(b);
if ( b == 0 )
/* check for divide by 0 */
{
/* check for division by 0 */
q = 0x7FFFFFFFL;
}
else if ( ( a >> 16 ) == 0 )
{
/* compute result directly */
@ -615,6 +621,7 @@
FT_Int32 s;
FT_Word32 q, r, i, lo;
s = x->hi;
if ( s < 0 )
{
@ -626,8 +633,10 @@
/* Shortcut */
if ( x->hi == 0 )
{
if (y > 0) q = x->lo / y;
else q = 0x7FFFFFFF;
if ( y > 0 )
q = x->lo / y;
else
q = 0x7FFFFFFFL;
return ( s < 0 ) ? -(FT_Int32)q : (FT_Int32)q;
}
@ -637,7 +646,7 @@
if ( r >= (FT_Word32)y ) /* we know y is to be treated as unsigned here */
return ( s < 0 ) ? 0x80000001L : 0x7FFFFFFFL;
/* Return Max/Min Int32 if divide overflow. */
/* Return Max/Min Int32 if division overflow. */
/* This includes division by zero! */
q = 0;
for ( i = 0; i < 32; i++ )
@ -678,6 +687,7 @@
z->hi = hi;
}
static
int ft_order64( FT_Int64* z )
{
@ -701,6 +711,7 @@
return j - 1;
}
/*************************************************************************/
/* */
/* <Function> */
@ -728,7 +739,8 @@
return 0;
s = ft_order64( l );
if ( s == 0 ) return 1;
if ( s == 0 )
return 1;
r = ft_square_roots[s];
do