version 1.3, 2000/08/22 05:04:05 |
version 1.6, 2018/03/29 01:32:52 |
|
|
* DEVELOPER SHALL HAVE NO LIABILITY IN CONNECTION WITH THE USE, |
* DEVELOPER SHALL HAVE NO LIABILITY IN CONNECTION WITH THE USE, |
* PERFORMANCE OR NON-PERFORMANCE OF THE SOFTWARE. |
* PERFORMANCE OR NON-PERFORMANCE OF THE SOFTWARE. |
* |
* |
* $OpenXM: OpenXM_contrib2/asir2000/engine/igcdhack.c,v 1.2 2000/08/21 08:31:27 noro Exp $ |
* $OpenXM: OpenXM_contrib2/asir2000/engine/igcdhack.c,v 1.5 2005/07/03 10:19:22 ohara Exp $ |
*/ |
*/ |
#if 0 |
#if 0 |
#include "base.h" |
#include "base.h" |
|
|
#define SIGNED_VAL(a,s) ((s)>0?(a): -(a)) |
#define SIGNED_VAL(a,s) ((s)>0?(a): -(a)) |
#endif |
#endif |
|
|
#undef FULLSET |
|
|
|
|
|
static int negate_nbd( b, l ) |
static int negate_nbd( b, l ) |
int *b, l; |
int *b, l; |
/* It is assumed that l > 0 and b[0] != 0 */ |
/* It is assumed that l > 0 and b[0] != 0 */ |
{ |
{ |
int i, nz; |
int i, nz; |
|
|
|
#if BSH == BIT_WIDTH_OF_INT |
|
*b = - *b; |
|
for ( nz = i = 1 ; i < l; ) { |
|
b++, i++; |
|
if ( (*b ^= BMask) != 0 ) nz = i; |
|
} |
|
#else |
*b = BASE - *b; |
*b = BASE - *b; |
for ( nz = i = 1 ; i < l; ) { |
for ( nz = i = 1 ; i < l; ) { |
b++, i++; |
b++, i++; |
if ( (*b ^= BMASK) != 0 ) nz = i; |
if ( (*b ^= BMASK) != 0 ) nz = i; |
} |
} |
|
#endif |
return nz; |
return nz; |
} |
} |
|
|
|
|
/****************/ |
/****************/ |
|
|
static int abs_U_V_maxrshift( u, lu, v, lv, a ) |
static int abs_U_V_maxrshift( u, lu, v, lv, a ) |
|
#if BSH == BIT_WIDTH_OF_INT |
|
unsigned |
|
#endif |
int *u, lu, *v, lv, *a; |
int *u, lu, *v, lv, *a; |
/* |
/* |
* Compute | U - V | >> (as much as possible) in a[], where U = u[0:lu-1] |
* Compute | U - V | >> (as much as possible) in a[], where U = u[0:lu-1] |
Line 82 int *u, lu, *v, lv, *a; |
|
Line 90 int *u, lu, *v, lv, *a; |
|
* multiplied by the sign of (U-V). |
* multiplied by the sign of (U-V). |
*/ |
*/ |
{ |
{ |
int sign, rsh, t, b, i, i_1, l, *p = a; |
int sign; |
|
#if BSH == BIT_WIDTH_OF_INT |
|
unsigned |
|
#endif |
|
int rsh, t, b, i, i_1, l, *p = a; |
|
|
/* first, determine U <, ==, > V */ |
/* first, determine U <, ==, > V */ |
sign = 1; |
sign = 1; |
Line 100 int *u, lu, *v, lv, *a; |
|
Line 112 int *u, lu, *v, lv, *a; |
|
swap: |
swap: |
SWAP( lu, lv, int ); SWAP( u, v, int * ); |
SWAP( lu, lv, int ); SWAP( u, v, int * ); |
sign = -1; |
sign = -1; |
U_V: /* U > V, i.e., (lu > lv) || (lu == lv && u[lu-1] > v[lv-1]) */ |
U_V: /* U > V, i.e., (lu > lv) || (lu == lv && u[lu-1] > v[lv-1]) */ |
for ( i = 0; i < lv; i++ ) if ( u[i] != v[i] ) break; |
for ( i = 0; i < lv; i++ ) if ( u[i] != v[i] ) break; |
if ( i != 0 ) u += i, lu -= i, v += i, lv -= i; |
if ( i != 0 ) u += i, lu -= i, v += i, lv -= i; |
if ( lv == 0 ) { /* no more pv[], and lu > 0 */ |
if ( lv == 0 ) { /* no more pv[], and lu > 0 */ |
i = trailingzeros_nbd( u, &rsh ); |
i = trailingzeros_nbd( u, &rsh ); |
i = rshift_nbd( u, lu, rsh, i, a ); |
i = rshift_nbd( u, lu, rsh, i, a ); |
return SIGNED_VAL( i, sign ); |
return SIGNED_VAL( i, sign ); |
} |
} |
/**/ |
/**/ |
|
#if BSH == BIT_WIDTH_OF_INT |
|
t = u[0] - v[0]; |
|
b = u[0] >= v[0] ? 0 : 1; |
|
#else |
if ( (t = u[0] - v[0]) >= 0 ) b = 0; |
if ( (t = u[0] - v[0]) >= 0 ) b = 0; |
else b = 1, t += BASE; |
else b = 1, t += BASE; |
|
#endif |
TRAILINGZEROS( t, rsh ); |
TRAILINGZEROS( t, rsh ); |
/**/ |
/**/ |
if ( rsh != 0 ) { |
if ( rsh != 0 ) { |
|
#if BSH == BIT_WIDTH_OF_INT |
|
unsigned |
|
#endif |
int w, lsh = BSH - rsh; |
int w, lsh = BSH - rsh; |
|
|
/* subtract v[*] from u[*] */ |
/* subtract v[*] from u[*] */ |
for ( i = 1, l = 0; i < lv; i++, t = w >> rsh ) { |
for ( i = 1, l = 0; i < lv; i++, t = w >> rsh ) { |
|
#if BSH == BIT_WIDTH_OF_INT |
|
w = u[i] - v[i] - b; |
|
b = (u[i] > v[i]) || (u[i] == v[i] && b == 0) ? 0 : 1; |
|
if ( (*p++ = t | (w << lsh)) != 0 ) l = i; |
|
#else |
if ( (w = u[i] - v[i] - b) >= 0 ) b = 0; |
if ( (w = u[i] - v[i] - b) >= 0 ) b = 0; |
else b = 1, w += BASE; |
else b = 1, w += BASE; |
if ( (*p++ = t | ((w << lsh) & BMASK)) != 0 ) l = i; |
if ( (*p++ = t | ((w << lsh) & BMASK)) != 0 ) l = i; |
|
#endif |
} |
} |
/* subtraction of V completed. Note there may exist non-0 borrow b */ |
/* subtraction of V completed. Note there may exist non-0 borrow b */ |
if ( i >= lu ) /* lu == lv, and b==0 is implied */ goto chk_nz; |
if ( i >= lu ) /* lu == lv, and b==0 is implied */ goto chk_nz; |
/* we still have (lu-i) elms in U */ |
/* we still have (lu-i) elms in U */ |
if ( b != 0 ) { /* non-zero borrow */ |
#if BSH == BIT_WIDTH_OF_INT |
|
if ( b != 0 ) { /* non-zero borrow */ |
|
if ( (w = u[i++] -1) != 0 ) t |= (w << lsh); |
|
if ( i >= lu ) { /* lu == lv+1. The M.S. word w may become 0 */ |
|
if ( w != 0 ) { |
|
*p++ = t; |
|
l = lv; |
|
t = w >> rsh; |
|
} else lu--; |
|
goto chk_nz; |
|
} |
|
/**/ |
|
*p++ = t; |
|
if ( w == BMask ) { |
|
while ( (w = u[i++]) == 0 ) *p++ = BMask; |
|
w -= 1; |
|
*p++ = (BMask >> rsh) | (w << lsh); |
|
} |
|
t = w >> rsh; |
|
} |
|
for ( ; i < lu; i++, t = w >> rsh ) *p++ = t | ((w = u[i]) << lsh); |
|
#else |
|
if ( b != 0 ) { /* non-zero borrow */ |
if ( (w = u[i++] -1) != 0 ) t |= ((w << lsh) & BMASK); |
if ( (w = u[i++] -1) != 0 ) t |= ((w << lsh) & BMASK); |
if ( i >= lu ) { /* lu == lv+1. The M.S. word w may beome 0 */ |
if ( i >= lu ) { /* lu == lv+1. The M.S. word w may become 0 */ |
if ( w != 0 ) { |
if ( w != 0 ) { |
*p++ = t; |
*p++ = t; |
l = lv; |
l = lv; |
t = w >> rsh; |
t = w >> rsh; |
} else lu--; |
} else lu--; |
goto chk_nz; |
goto chk_nz; |
} |
} |
*p++ = t; |
*p++ = t; |
if ( w < 0 ) { |
if ( w < 0 ) { |
while ( (w = u[i++]) == 0 ) *p++ = BMASK; |
while ( (w = u[i++]) == 0 ) *p++ = BMASK; |
w -= 1; |
w -= 1; |
*p++ = (BMASK >> rsh) | ((w << lsh) & BMASK); |
*p++ = (BMASK >> rsh) | ((w << lsh) & BMASK); |
} |
} |
t = w >> rsh; |
t = w >> rsh; |
} |
} |
for ( ; i < lu; i++, t = w >> rsh ) *p++ = t | (((w = u[i]) << lsh) & BMASK); |
for ( ; i < lu; i++, t = w >> rsh ) *p++ = t | (((w = u[i]) << lsh) & BMASK); |
|
#endif |
l = i -1; |
l = i -1; |
chk_nz: |
chk_nz: |
if ( t != 0 ) *p = t, l = /*1 + (p - a)*/ lu; |
if ( t != 0 ) *p = t, l = /*1 + (p - a)*/ lu; |
Line 152 int *u, lu, *v, lv, *a; |
|
Line 201 int *u, lu, *v, lv, *a; |
|
/* rsh == 0 : need not be right-shifted */ |
/* rsh == 0 : need not be right-shifted */ |
*p++ = t, l = 1; |
*p++ = t, l = 1; |
for ( i = 1; i < lv; ) { |
for ( i = 1; i < lv; ) { |
|
#if BSH == BIT_WIDTH_OF_INT |
|
t = u[i] - v[i] - b; |
|
b = (u[i] > v[i]) || (u[i] == v[i] && b == 0) ? 0 : 1; |
|
i++; |
|
if ( (*p++ = t) != 0 ) l = i; |
|
#else |
if ( (t = u[i] - v[i] - b) >= 0 ) b = 0; |
if ( (t = u[i] - v[i] - b) >= 0 ) b = 0; |
else b = 1, t += BASE; |
else b = 1, t += BASE; |
i++; |
i++; |
if ( (*p++ = t) != 0 ) l = i; |
if ( (*p++ = t) != 0 ) l = i; |
|
#endif |
} |
} |
if ( i >= lu ) /* lu == lv, and b==0 is implied */ goto ret_nz; |
if ( i >= lu ) /* lu == lv, and b==0 is implied */ goto ret_nz; |
if ( b != 0 ) { /* non-zero borrow */ |
if ( b != 0 ) { /* non-zero borrow */ |
t = u[i++] -1; |
t = u[i++] -1; |
if ( i >= lu ) /* lu == lv+1. The M.S. word w may beome 0 */ goto chk_nz; |
if ( i >= lu ) /* lu == lv+1. The M.S. word w may beome 0 */ goto chk_nz; |
|
#if BSH == BIT_WIDTH_OF_INT |
|
if ( t == BMask ) { |
|
do *p++ = BMask; while ( (t = u[i++]) == 0 ); |
|
t -= 1; |
|
if ( i >= lu ) { |
|
l = lu; |
|
if ( t == 0 ) l--; |
|
else *p = t; |
|
goto ret_nz; |
|
} |
|
} |
|
#else |
if ( t < 0 ) { |
if ( t < 0 ) { |
do *p++ = BMASK; while ( (t = u[i++]) == 0 ); |
do *p++ = BMASK; while ( (t = u[i++]) == 0 ); |
t -= 1; |
t -= 1; |
if ( i >= lu ) { |
if ( i >= lu ) { |
l = lu; |
l = lu; |
if ( t == 0 ) l--; |
if ( t == 0 ) l--; |
else *p = t; |
else *p = t; |
goto ret_nz; |
goto ret_nz; |
} |
} |
} |
} |
|
#endif |
*p++ = t; |
*p++ = t; |
} |
} |
for ( ; i < lu; i++ ) *p++ = u[i]; |
for ( ; i < lu; i++ ) *p++ = u[i]; |
Line 190 static int abs_U_aV_c(), abs_U_aV_c_sh(); |
|
Line 259 static int abs_U_aV_c(), abs_U_aV_c_sh(); |
|
static int abs_aVplusc_U(), abs_aVplusc_U_sh(); |
static int abs_aVplusc_U(), abs_aVplusc_U_sh(); |
|
|
static int abs_U_aV_maxrshift( u, lu, a, v, lv, ans ) |
static int abs_U_aV_maxrshift( u, lu, a, v, lv, ans ) |
|
#if BSH == BIT_WIDTH_OF_INT |
|
unsigned |
|
#endif |
int *u, lu, a, *v, lv, *ans; |
int *u, lu, a, *v, lv, *ans; |
{ |
{ |
int i, t, c, rsh, l, *p = ans, w, lsh; |
#if BSH == BIT_WIDTH_OF_INT |
int hi; |
unsigned int i, t, c, rsh, *p = ans, w, lsh, b, hi; |
|
int l; |
|
#else |
|
int i, t, c, rsh, l, *p = ans, w, lsh, hi; |
|
#endif |
|
|
if ( a == 1 ) return( (l = abs_U_V_maxrshift( u, lu, v, lv, ans )) >= 0 ? l : -l ); |
if ( a == 1 ) return( (l = abs_U_V_maxrshift( u, lu, v, lv, ans )) >= 0 ? l : -l ); |
/**/ |
/**/ |
for ( l = lu <= lv ? lu : lv, i = c = 0; i < l; ) { |
for ( l = lu <= lv ? lu : lv, i = c = 0; i < l; ) { |
DMA( a, v[i], c, hi, t, not_used ); |
DMA( a, v[i], c, hi, t ); |
c = hi; |
c = hi; |
if ( (t -= u[i++]) != 0 ) goto non0w; |
if ( (w = u[i++]) == t ) continue; |
|
/******/ |
|
u += i, lu -= i, v += i, lv -= i; |
|
/* | t + BASE*(c + a*v[0:lv-1] - u[0:lu-1] | */ |
|
if ( lv < lu ) { /* a*V < U if lv<lu-1, and very likely if lv==lu-1 */ |
|
#if BSH == BIT_WIDTH_OF_INT |
|
if ( w < t ) c++; |
|
t = w - t; |
|
#else |
|
t = w - t; /* We shall compute U - a*V */ |
|
if ( t < 0 ) t += BASE, c++; |
|
#endif |
|
} else { /* a*V > U if lv>lu, and very likely even if lv==lu */ |
|
b = 0; |
|
if ( t >= w ) t -= w; |
|
else { |
|
t -= w; |
|
#if BSH != BIT_WIDTH_OF_INT |
|
t += BASE; |
|
#endif |
|
if ( c != 0 ) c--; |
|
else b = 1; |
|
} |
|
} |
|
TRAILINGZEROS( t, rsh ); |
|
return( lv < lu ? ( rsh == 0 ? abs_U_aV_c( t, u, lu, a, v, lv, c, ans ) : |
|
abs_U_aV_c_sh( t, u, lu, a, v, lv, c, rsh, ans ) ) : |
|
rsh == 0 ? abs_aVplusc_U( t, a, v, lv, c, b, u, lu, ans ) : |
|
abs_aVplusc_U_sh( t, a, v, lv, c, b, u, lu, rsh, ans ) ); |
} |
} |
/**/ |
/**/ |
if ( i < lv ) { /* no more u[] elm.'s, and we still have non-zero v[] elm's */ |
if ( i < lv ) { /* no more u[] elm.'s, and we still have non-zero v[] elm's */ |
do { |
do { |
DMA( a, v[i], c, hi, t, not_used ); |
DMA( a, v[i], c, hi, t ); |
i++, c = hi; |
i++, c = hi; |
} while ( t == 0 ); |
} while ( t == 0 ); |
TRAILINGZEROS( t, rsh ); |
TRAILINGZEROS( t, rsh ); |
Line 219 int *u, lu, a, *v, lv, *ans; |
|
Line 323 int *u, lu, a, *v, lv, *ans; |
|
i = 0; |
i = 0; |
if ( rsh == 0 ) { |
if ( rsh == 0 ) { |
*p++ = t; |
*p++ = t; |
for ( ; i < lv; i++, c = hi, *p++ = t ) { DMA( a, v[i], c, hi, t, not_used ); } |
for ( ; i < lv; i++, c = hi, *p++ = t ) { DMA( a, v[i], c, hi, t ); } |
if ( c == 0 ) return( i + 1 ); |
if ( c == 0 ) return( i + 1 ); |
*p = c; |
*p = c; |
return( i + 2 ); |
return( i + 2 ); |
} else { |
} else { |
for ( lsh = BSH - rsh; i < lv; i++, c = hi, t = w >> rsh ) { |
for ( lsh = BSH - rsh; i < lv; i++, c = hi, t = w >> rsh ) { |
DMA( a, v[i], c, hi, w, not_used ); |
DMA( a, v[i], c, hi, w ); |
*p++ = t | ((w << lsh) & BMASK); |
#if BSH == BIT_WIDTH_OF_INT |
|
*p++ = t | (w << lsh); |
|
#else |
|
*p++ = t | ((w << lsh) & BMASK); |
|
#endif |
} |
} |
if ( c != 0 ) { |
if ( c != 0 ) { |
*p++ = t | ((c << lsh) & BMASK); |
#if BSH == BIT_WIDTH_OF_INT |
i++; |
*p++ = t | (c << lsh); |
t = c >> rsh; |
#else |
|
*p++ = t | ((c << lsh) & BMASK); |
|
#endif |
|
i++; |
|
t = c >> rsh; |
} |
} |
if ( t == 0 ) return i; |
if ( t == 0 ) return i; |
*p = t; |
*p = t; |
Line 247 int *u, lu, a, *v, lv, *ans; |
|
Line 359 int *u, lu, a, *v, lv, *ans; |
|
*p = c; |
*p = c; |
return 1; |
return 1; |
} |
} |
t = u[i++] - c; |
t = u[i++]; |
if ( i >= lu ) { |
if ( i >= lu ) { |
if ( t == 0 ) return 0; |
if ( t == c ) return 0; |
c = t < 0 ? -t : t; |
c = t < c ? c - t : t - c; |
goto c_sh; |
goto c_sh; |
} else if ( t == 0 ) { |
} else if ( t == c ) { |
while ( (t = u[i++]) == 0 ) ; |
while ( (t = u[i++]) == 0 ) ; |
c = 0; |
c = 0; |
} else if ( t < 0 ) t += BASE, c = 1; |
} else if ( t < c ) { |
else c = 0; |
#if BSH == BIT_WIDTH_OF_INT |
|
t = t - c; |
|
#else |
|
t = t + (BASE - c); |
|
#endif |
|
c = 1; |
|
} else { t -= c; c = 0; } |
/* diff turned out to be > 0 */ |
/* diff turned out to be > 0 */ |
u += i, lu -= i; |
u += i, lu -= i; |
TRAILINGZEROS( t, rsh ); |
TRAILINGZEROS( t, rsh ); |
Line 274 int *u, lu, a, *v, lv, *ans; |
|
Line 392 int *u, lu, a, *v, lv, *ans; |
|
lsh = BSH - rsh; |
lsh = BSH - rsh; |
if ( c != 0 ) { /* there still exists u[] elms.'s because diff is known to be > 0 */ |
if ( c != 0 ) { /* there still exists u[] elms.'s because diff is known to be > 0 */ |
if ( (w = u[i++]) == 0 ) { |
if ( (w = u[i++]) == 0 ) { |
*p++ = t | ((BMASK << lsh) & BMASK); |
#if BSH == BIT_WIDTH_OF_INT |
for ( ; (w = u[i++]) == 0; *p++ = BMASK ) ; |
*p++ = t | (BMask << lsh); |
t = BMASK >> rsh; |
#else |
|
*p++ = t | ((BMASK << lsh) & BMASK); |
|
#endif |
|
for ( ; (w = u[i++]) == 0; *p++ = BMASK ) ; |
|
t = BMASK >> rsh; |
} |
} |
w--; |
w--; |
|
#if BSH == BIT_WIDTH_OF_INT |
|
*p++ = t | (w << lsh); |
|
#else |
*p++ = t | ((w << lsh) & BMASK); |
*p++ = t | ((w << lsh) & BMASK); |
|
#endif |
t = w >> rsh; |
t = w >> rsh; |
} |
} |
|
#if BSH == BIT_WIDTH_OF_INT |
|
for ( ; i < lu; i++, t = w >> rsh ) *p++ = t | ((w = u[i]) << lsh); |
|
#else |
for ( ; i < lu; i++, t = w >> rsh ) *p++ = t | (((w = u[i]) << lsh) & BMASK); |
for ( ; i < lu; i++, t = w >> rsh ) *p++ = t | (((w = u[i]) << lsh) & BMASK); |
|
#endif |
if ( t == 0 ) return( i ); |
if ( t == 0 ) return( i ); |
*p = t; |
*p = t; |
} |
} |
return( i + 1 ); |
return( i + 1 ); |
/**/ |
|
non0w: |
|
u += i, lu -= i, v += i, lv -= i; |
|
/* | t + BASE*(c + a*v[0:lv-1] - u[0:lu-1] | */ |
|
if ( lv < lu ) { /* a*V < U if lv<lu-1, and very likely if lv==lu-1 */ |
|
t = -t; /* We shall compute U - a*V */ |
|
if ( t < 0 ) t += BASE, c++; |
|
} else /* a*V > U if lv>lu, and very likely even if lv==lu */ |
|
if ( t < 0 ) t += BASE, c--; |
|
TRAILINGZEROS( t, rsh ); |
|
return( rsh == 0 ? (lv < lu ? abs_U_aV_c( t, u, lu, a, v, lv, c, ans ) : |
|
abs_aVplusc_U( t, a, v, lv, c, u, lu, ans )) : |
|
lv < lu ? abs_U_aV_c_sh( t, u, lu, a, v, lv, c, rsh, ans ) : |
|
abs_aVplusc_U_sh( t, a, v, lv, c, u, lu, rsh, ans ) ); |
|
} |
} |
|
|
/*********/ |
/*********/ |
Line 314 int a, *v, lv, c, *p; |
|
Line 430 int a, *v, lv, c, *p; |
|
int i, t; |
int i, t; |
int hi; |
int hi; |
|
|
for ( i = 0; i < lv; i++, *p++ = t, c = hi ) { DMA( a, v[i], c, hi, t, not_used); } |
for ( i = 0; i < lv; i++, *p++ = t, c = hi ) { DMA( a, v[i], c, hi, t ); } |
if ( c == 0 ) return i; |
if ( c == 0 ) return i; |
*p = c; |
*p = c; |
return( i + 1 ); |
return( i + 1 ); |
Line 330 int a, *v, lv, c, rsh, *p; |
|
Line 446 int a, *v, lv, c, rsh, *p; |
|
int hi; |
int hi; |
|
|
for ( i = 0; i < lv; i++, c = hi, t = w >> rsh ) { |
for ( i = 0; i < lv; i++, c = hi, t = w >> rsh ) { |
DMA( a, v[i], c, hi, w, not_used ); |
DMA( a, v[i], c, hi, w ); |
|
#if BSH == BIT_WIDTH_OF_INT |
|
*p++ = t | (w << lsh); |
|
#else |
*p++ = t | ((w << lsh) & BMASK); |
*p++ = t | ((w << lsh) & BMASK); |
|
#endif |
} |
} |
if ( c != 0 ) { |
if ( c != 0 ) { |
|
#if BSH == BIT_WIDTH_OF_INT |
|
*p++ = t | (c << lsh); |
|
#else |
*p++ = t | ((c << lsh) & BMASK); |
*p++ = t | ((c << lsh) & BMASK); |
|
#endif |
i++; |
i++; |
t = c >> rsh; |
t = c >> rsh; |
} |
} |
Line 345 int a, *v, lv, c, rsh, *p; |
|
Line 469 int a, *v, lv, c, rsh, *p; |
|
|
|
/*********/ |
/*********/ |
|
|
static int abs_aVplusc_U( t, a, v, lv, c, u, lu, ans ) |
static int abs_aVplusc_U( t, a, v, lv, c, b, u, lu, ans ) |
int t, a, *v, lv, c, *u, lu, *ans; |
#if BSH == BIT_WIDTH_OF_INT |
|
unsigned |
|
#endif |
|
int t, a, *v, lv, c, b, *u, lu, *ans; |
/* compute | t + BASE*(a*V+c - U) | in ans[], where V=v[0:lv-1], U=u[0:lu-1], |
/* compute | t + BASE*(a*V+c - U) | in ans[], where V=v[0:lv-1], U=u[0:lu-1], |
* and a > 1, -1 <= c < BASE, lv >= lu >=0 && t != 0 are assumed. |
* and a > 1, -1 <= c < BASE, lv >= lu >=0 && t != 0 are assumed. |
*/ |
*/ |
{ |
{ |
int i, l, b, *p = ans; |
#if BSH == BIT_WIDTH_OF_INT |
int hi; |
unsigned |
|
#endif |
|
int i, l, *p = ans, hi, w; |
|
|
*p++ = t, l = 1; |
*p++ = t, l = 1; |
if ( c < 0 ) c = 0, b = 1; |
|
else b = 0; |
|
for ( i = 0; i < lu; *p++ = t ) { |
for ( i = 0; i < lu; *p++ = t ) { |
DMA( a, v[i], c, hi, t, not_used ); |
DMA( a, v[i], c, hi, t ); |
t -= u[i++], c = hi; |
c = hi; |
if ( b != 0 ) t--; |
if ( t > (w = u[i++]) ) { |
b = 0; |
t = (t - w) - b; |
if ( t > 0 ) l = i + 1; |
b = 0; |
else if ( t < 0 ) { |
} else if ( t < w ) { |
t += BASE, l = i + 1; |
t = (t - w) - b; |
if ( c != 0 ) c--; |
#if BSH != BIT_WIDTH_OF_INT |
|
t += BASE; |
|
#endif |
|
if ( c != 0 ) c--, b = 0; |
else b = 1; |
else b = 1; |
|
} else if ( b == 0 ) t = 0; |
|
else { |
|
t = BMASK; |
|
if ( c != 0 ) c--, b = 0; |
} |
} |
|
if ( t != 0 ) l = i + 1; |
} |
} |
/* at this point, i == lu and we have written (i+1) entries in ans[] */ |
/* at this point, i == lu and we have written (i+1) entries in ans[] */ |
if ( i >= lv ) { /* no more elms in v[] */ |
if ( i >= lv ) { /* no more elms in v[] */ |
if ( b != 0 ) { |
if ( b != 0 ) { |
|
#if BSH == BIT_WIDTH_OF_INT |
|
if ( i == 0 ) { ans[i] = - t; return 1; } |
|
#else |
if ( i == 0 ) { ans[i] = BASE - t; return 1; } |
if ( i == 0 ) { ans[i] = BASE - t; return 1; } |
l = negate_nbd( ans, i ); /* <================ */ |
#endif |
|
l = negate_nbd( ans, i ); /* <================ */ |
/* if ( (t = BMASK ^ ans[i]) == 0 ) return l;*/ |
/* if ( (t = BMASK ^ ans[i]) == 0 ) return l;*/ |
if ( (t ^= BMASK) == 0 ) return l; |
if ( (t ^= BMASK) == 0 ) return l; |
ans[i] = t; |
ans[i] = t; |
Line 389 int t, a, *v, lv, c, *u, lu, *ans; |
|
Line 528 int t, a, *v, lv, c, *u, lu, *ans; |
|
DM( a, b, hi, t ); |
DM( a, b, hi, t ); |
if ( t != 0 ) t--, c = hi; |
if ( t != 0 ) t--, c = hi; |
else t = BMASK, c = hi - 1; |
else t = BMASK, c = hi - 1; |
*p++ - t; |
*p++ = t; |
} |
} |
#ifdef CALL |
#ifdef CALL |
return( aV_plus_c( a, &v[i], lv - i, c, p ) + i +1 ); |
return( aV_plus_c( a, &v[i], lv - i, c, p ) + i +1 ); |
#else |
#else |
for ( ; i < lv; i++, *p++ = t, c = hi ) { DMA( a, v[i], c, hi, t, not_used );} |
for ( ; i < lv; i++, *p++ = t, c = hi ) { DMA( a, v[i], c, hi, t ); } |
if ( c == 0 ) return( i + 1 ); |
if ( c == 0 ) return( i + 1 ); |
*p = c; |
*p = c; |
return( i + 2 ); |
return( i + 2 ); |
#endif |
#endif |
} |
} |
|
|
static int abs_aVplusc_U_sh( t, a, v, lv, c, u, lu, rsh, ans ) |
static int abs_aVplusc_U_sh( t, a, v, lv, c, b, u, lu, rsh, ans ) |
int t, a, *v, lv, c, *u, lu, rsh, *ans; |
#if BSH == BIT_WIDTH_OF_INT |
|
unsigned |
|
#endif |
|
int t, a, *v, lv, c, b, *u, lu, rsh, *ans; |
{ |
{ |
int i, l, w, b, lsh = BSH - rsh, *p = ans; |
#if BSH == BIT_WIDTH_OF_INT |
int hi; |
unsigned |
|
#endif |
|
int i, l, w, lsh = BSH - rsh, *p = ans, hi, x; |
|
|
if ( c < 0 ) c = 0, b = 1; |
|
else b = 0; |
|
for ( i = 0; i < lu; t = w >> rsh ) { |
for ( i = 0; i < lu; t = w >> rsh ) { |
DMA( a, v[i], c, hi, w, not_used ); |
DMA( a, v[i], c, hi, w ); |
w -= u[i++], c = hi; |
c = hi; |
if ( b != 0 ) w--; |
if ( w > (x = u[i++]) ) { |
b = 0; |
w = (w - x) - b; |
if ( w < 0 ) { |
b = 0; |
|
} else if ( w < x ) { |
|
w = (w - x) - b; |
|
#if BSH != BIT_WIDTH_OF_INT |
w += BASE; |
w += BASE; |
if ( c != 0 ) c--; |
#endif |
|
if ( c != 0 ) c--, b = 0; |
else b = 1; |
else b = 1; |
|
} else if ( b == 0 ) w = 0; |
|
else { |
|
w = BMASK; |
|
if ( c != 0 ) c--, b = 0; |
} |
} |
|
#if BSH == BIT_WIDTH_OF_INT |
|
if ( (*p++ = t | (w << lsh)) != 0 ) l = i; |
|
#else |
if ( (*p++ = t | ((w << lsh) & BMASK)) != 0 ) l = i; |
if ( (*p++ = t | ((w << lsh) & BMASK)) != 0 ) l = i; |
|
#endif |
} |
} |
/* at this point, i == lu and we have written i entries in ans[] */ |
/* at this point, i == lu and we have written i entries in ans[] */ |
if ( i >= lv ) { |
if ( i >= lv ) { |
if ( b != 0 ) { /* diff turned out to be < 0 */ |
if ( b != 0 ) { /* diff turned out to be < 0 */ |
if ( i == 0 ) { |
if ( i == 0 ) { |
*p = (BASE >> rsh) - t; |
#if BSH == BIT_WIDTH_OF_INT |
return 1; |
*p = (1 << lsh) - t; |
|
#else |
|
*p = (BASE >> rsh) - t; |
|
#endif |
|
return 1; |
} |
} |
l = negate_nbd( ans, i ); /* <================ */ |
l = negate_nbd( ans, i ); /* <================ */ |
if ( (t ^= (BMASK >> rsh)) == 0 ) return l; |
if ( (t ^= (BMASK >> rsh)) == 0 ) return l; |
*p = t; |
*p = t; |
return( i + 1 ); |
return( i + 1 ); |
Line 438 int t, a, *v, lv, c, *u, lu, rsh, *ans; |
|
Line 596 int t, a, *v, lv, c, *u, lu, rsh, *ans; |
|
*p = t; |
*p = t; |
return( i + 1 ); |
return( i + 1 ); |
} |
} |
|
#if BSH == BIT_WIDTH_OF_INT |
|
*p++ = t | (c << lsh); |
|
#else |
*p++ = t | ((c << lsh) & BMASK); |
*p++ = t | ((c << lsh) & BMASK); |
|
#endif |
if ( (t = c >> rsh) == 0 ) return( i + 1 ); |
if ( (t = c >> rsh) == 0 ) return( i + 1 ); |
*p = t; |
*p = t; |
return( i + 2 ); |
return( i + 2 ); |
Line 446 int t, a, *v, lv, c, *u, lu, rsh, *ans; |
|
Line 608 int t, a, *v, lv, c, *u, lu, rsh, *ans; |
|
/* lv >= lu+1 = i+1, and diff is > 0 */ |
/* lv >= lu+1 = i+1, and diff is > 0 */ |
if ( b != 0 ) { /* c == 0 */ |
if ( b != 0 ) { /* c == 0 */ |
if ( (w = v[i++]) == 0 ) { |
if ( (w = v[i++]) == 0 ) { |
|
#if BSH == BIT_WIDTH_OF_INT |
|
*p++ = t | (BMASK << lsh); |
|
#else |
*p++ = t | ((BMASK << lsh) & BMASK); |
*p++ = t | ((BMASK << lsh) & BMASK); |
|
#endif |
while ( (w = v[i++]) == 0 ) *p++ = BMASK; |
while ( (w = v[i++]) == 0 ) *p++ = BMASK; |
t = BMASK >> rsh; |
t = BMASK >> rsh; |
} else { |
} else { |
DM( a, w, c, b ); |
DM( a, w, c, b ); |
if ( b != 0 ) b--; |
if ( b != 0 ) b--; |
else b = BMASK, c--; |
else b = BMASK, c--; |
|
#if BSH == BIT_WIDTH_OF_INT |
|
*p++ = t | (b << lsh); |
|
#else |
*p++ = t | ((b << lsh) & BMASK); |
*p++ = t | ((b << lsh) & BMASK); |
|
#endif |
t = b >> rsh; |
t = b >> rsh; |
} |
} |
} |
} |
Line 462 int t, a, *v, lv, c, *u, lu, rsh, *ans; |
|
Line 632 int t, a, *v, lv, c, *u, lu, rsh, *ans; |
|
return( aV_plus_c_sh( a, &v[i], lv - i, c, rsh, t, p ) + i ); |
return( aV_plus_c_sh( a, &v[i], lv - i, c, rsh, t, p ) + i ); |
#else |
#else |
for ( ; i < lv; i++, t = w >> rsh, c = hi ) { |
for ( ; i < lv; i++, t = w >> rsh, c = hi ) { |
DMA( a, v[i], c, hi, w, not_used ); |
DMA( a, v[i], c, hi, w ); |
|
#if BSH == BIT_WIDTH_OF_INT |
|
*p++ = t | (w << lsh); |
|
#else |
*p++ = t | ((w << lsh) & BMASK); |
*p++ = t | ((w << lsh) & BMASK); |
|
#endif |
} |
} |
if ( c != 0 ) { |
if ( c != 0 ) { |
|
#if BSH == BIT_WIDTH_OF_INT |
|
*p++ = t | (c << lsh); |
|
#else |
*p++ = t | ((c << lsh) & BMASK); |
*p++ = t | ((c << lsh) & BMASK); |
|
#endif |
i++, t = c >> rsh; |
i++, t = c >> rsh; |
} |
} |
if ( t == 0 ) return i; |
if ( t == 0 ) return i; |
Line 478 int t, a, *v, lv, c, *u, lu, rsh, *ans; |
|
Line 656 int t, a, *v, lv, c, *u, lu, rsh, *ans; |
|
/*********/ |
/*********/ |
|
|
static int abs_U_aV_c( t, u, lu, a, v, lv, c, ans ) |
static int abs_U_aV_c( t, u, lu, a, v, lv, c, ans ) |
|
#if BSH == BIT_WIDTH_OF_INT |
|
unsigned |
|
#endif |
int t, *u, lu, a, *v, lv, c, *ans; |
int t, *u, lu, a, *v, lv, c, *ans; |
/* compute | t + BASE*(U - a*V - c) | in ans[], where U = u[0:lu-1], V = v[0:lv-1], |
/* compute | t + BASE*(U - a*V - c) | in ans[], where U = u[0:lu-1], V = v[0:lv-1], |
* c is <= BASE-1, and lu >= lv+1 && t != 0 assumed. |
* c is <= BASE-1, and lu >= lv+1 && t != 0 assumed. |
*/ |
*/ |
{ |
{ |
int i, w, l, *p = ans; |
#if BSH == BIT_WIDTH_OF_INT |
int hi; |
unsigned |
|
#endif |
|
int i, w, l, *p = ans, hi, b; |
|
|
*p++ = t, l = 1; |
*p++ = t, l = 1, b = 0; |
for ( i = 0; i < lv; *p++ = t ) { |
for ( i = 0; i < lv; *p++ = t ) { |
DMA( a, v[i], c, hi, w, not_used ); |
DMA( a, v[i], c, hi, w ); |
t = u[i] - w; |
c = hi; |
i++, c = hi; |
if ( (t = u[i++]) > w ) { |
|
t = (t - w) - b; |
|
b = 0; |
|
} else if ( t == w && b == 0 ) { |
|
t = 0; |
|
continue; |
|
} else { |
|
t = (t - w) - b; |
|
#if BSH != BIT_WIDTH_OF_INT |
|
t += BASE; |
|
#endif |
|
if ( c == BMASK ) b = 1; |
|
else b = 0, c++; |
|
} |
if ( t != 0 ) l = i + 1; |
if ( t != 0 ) l = i + 1; |
if ( t < 0 ) t += BASE, c++; |
|
} |
} |
/* at this point, i == lv */ |
/* at this point, i == lv */ |
if ( lu == lv+1 ) { |
if ( lu == lv+1 ) { |
if ( (t = u[i]) == c ) return l; |
t = u[i] - b; |
|
if ( t == c ) return l; |
else if ( t > c ) { *p = t - c; return( lu + 1 ); } |
else if ( t > c ) { *p = t - c; return( lu + 1 ); } |
l = negate_nbd( ans, lu ); /* <================ */ |
l = negate_nbd( ans, lu ); /* <================ */ |
if ( (c -= (t + 1)) == 0 ) return l; |
if ( (c -= (t + 1)) == 0 ) return l; |
*p = c; |
*p = c; |
return( lu + 1 ); |
return( lu + 1 ); |
} |
} |
/* lu >= lv+2 and the diff turned out to be >= 0 */ |
/* lu >= lv+2 and therfore, the diff turned out to be >= 0 */ |
if ( c != 0 ) { |
if ( c != 0 ) { |
/* note c <= BASE. If c == BASE, we must care about the length of the result |
/* note c+b <= BASE. If c == BASE, we must care about the length of the result |
of the case when lu == lv+2 && u[lu-2:lu-1]=u[i:i+1] == BASE */ |
of the case when lu == lv+2 && u[lu-2:lu-1]=u[i:i+1] == BASE */ |
if ( c >= BASE && i+2 == lu && u[i+1] == 1 ) { |
if ( /* c == BMASK && */ b != 0 ) { |
/* m.s. word of the diff becomes 0 */ |
if ( i+2 == lu && u[i+1] == 1 ) { |
if ( (t = u[i] - (c & BMASK)) == 0 ) return l; |
/* m.s. word of the diff becomes 0 */ |
*p = t; |
if ( (t = u[i]) == 0 ) return l; |
return lu; |
*p = t; |
|
return lu; |
|
} |
|
*p++ = u[i++]; |
|
c = 1; |
} |
} |
|
#if BSH == BIT_WIDTH_OF_INT |
|
do { |
|
if ( (t = u[i++]) >= c ) break; |
|
else *p++ = t - c; |
|
} while ( c = 1 ); |
|
if ( (t -= c) == 0 && i >= lu ) return lu; |
|
#else |
for ( ; 1; c = 1, *p++ = t + BASE ) if ( (t = u[i++] - c) >= 0 ) break; |
for ( ; 1; c = 1, *p++ = t + BASE ) if ( (t = u[i++] - c) >= 0 ) break; |
if ( t == 0 && i >= lu ) return lu; |
if ( t == 0 && i >= lu ) return lu; |
|
#endif |
*p++ = t; |
*p++ = t; |
} |
} |
for ( ; i < lu; i++ ) *p++ = u[i]; |
for ( ; i < lu; i++ ) *p++ = u[i]; |
Line 522 int t, *u, lu, a, *v, lv, c, *ans; |
|
Line 730 int t, *u, lu, a, *v, lv, c, *ans; |
|
} |
} |
|
|
static int abs_U_aV_c_sh( t, u, lu, a, v, lv, c, rsh, ans ) |
static int abs_U_aV_c_sh( t, u, lu, a, v, lv, c, rsh, ans ) |
|
#if BSH == BIT_WIDTH_OF_INT |
|
unsigned |
|
#endif |
int t, *u, lu, a, *v, lv, c, rsh, *ans; |
int t, *u, lu, a, *v, lv, c, rsh, *ans; |
/* r-shift version of the above */ |
/* r-shift version of the above */ |
{ |
{ |
int i, w, l, lsh = BSH - rsh, *p = ans; |
#if BSH == BIT_WIDTH_OF_INT |
int hi; |
unsigned |
|
#endif |
|
int i, w, l, lsh = BSH - rsh, *p = ans, hi, b, x; |
|
|
for ( l = i = 0; i < lv; t = w >> rsh ) { |
for ( b = l = i = 0; i < lv; t = w >> rsh ) { |
DMA( a, v[i], c, hi, w, not_used ); |
DMA( a, v[i], c, hi, w ); |
w = u[i] - w, c = hi; |
c = hi; |
i++; |
if ( (x = u[i++]) > w ) { |
if ( w < 0 ) w += BASE, c++; |
w = (x - w) - b; |
if ( (*p++ = t | ((w << lsh) & BMASK)) != 0 ) l = i; |
b = 0; |
|
} else if ( x == w && b == 0 ) w = 0; |
|
else { |
|
w = (x - w) - b; |
|
#if BSH != BIT_WIDTH_OF_INT |
|
w += BASE; |
|
#endif |
|
if ( c == BMASK ) b = 1; |
|
else b = 0, c++; |
|
} |
|
#if BSH == BIT_WIDTH_OF_INT |
|
x = t | (w << lsh); |
|
#else |
|
x = t | ((w << lsh) & BMASK); |
|
#endif |
|
if ( (*p++ = x) != 0 ) l = i; |
} |
} |
/* at this point, i == lv, and we have written lv elm.s in ans[] */ |
/* at this point, i == lv, and we have written lv elm.s in ans[] */ |
if ( lu == lv+1 ) { |
if ( lu == lv+1 ) { |
if ( (w = u[i] - c) == 0 ) { |
x = u[i] - b; |
|
if ( x == c ) { |
if ( t == 0 ) return l; |
if ( t == 0 ) return l; |
*p = t; |
*p = t; |
return lu; /* == lv+1 */ |
return lu; /* == lv+1 */ |
} else if ( w > 0 ) { |
} else if ( x > c ) { |
l0: *p++ = t | ((w << lsh) & BMASK); |
w = x - c; |
|
l0: |
|
#if BSH == BIT_WIDTH_OF_INT |
|
*p++ = t | (w << lsh); |
|
#else |
|
*p++ = t | ((w << lsh) & BMASK); |
|
#endif |
if ( (w >>= rsh) == 0 ) return lu; /* == lv+1 */ |
if ( (w >>= rsh) == 0 ) return lu; /* == lv+1 */ |
*p = w; |
*p = w; |
return( lu + 1 ); |
return( lu + 1 ); |
} |
} |
/* diff turned out to be < 0 */ |
/* diff turned out to be < 0 */ |
w = - w - 1; |
w = c - x - 1; |
if ( lv == 0 ) { /* lu == 1 */ |
if ( lv == 0 ) { /* lu == 1 */ |
|
#if BSH == BIT_WIDTH_OF_INT |
|
t = (1 << lsh) - t; |
|
#else |
t = (BASE >> rsh) - t; |
t = (BASE >> rsh) - t; |
|
#endif |
if ( w != 0 ) goto l0; |
if ( w != 0 ) goto l0; |
*p = t; |
*p = t; |
return 1; |
return 1; |
} |
} |
l = negate_nbd( ans, lv ); /* <================ */ |
l = negate_nbd( ans, lv ); /* <================ */ |
t ^= (BMASK >> rsh); |
t ^= (BMASK >> rsh); |
if ( w != 0 ) goto l0; |
if ( w != 0 ) goto l0; |
if ( t == 0 ) return l; |
if ( t == 0 ) return l; |
Line 566 int t, *u, lu, a, *v, lv, c, rsh, *ans; |
|
Line 805 int t, *u, lu, a, *v, lv, c, rsh, *ans; |
|
if ( c != 0 ) { |
if ( c != 0 ) { |
/* note c <= BASE. If c == BASE, we must care about the length of the result |
/* note c <= BASE. If c == BASE, we must care about the length of the result |
of the case when lu == lv+2 && u[lu-2:lu-1]=u[i:i+1] == BASE */ |
of the case when lu == lv+2 && u[lu-2:lu-1]=u[i:i+1] == BASE */ |
if ( c >= BASE && i+2 == lu && t == 0 && u[i] == 0 && u[i+1] == 1 ) |
if ( /* c == BMASK && */ b != 0 ) { |
return l; /* m.s. word of the diff has become 0 */ |
if ( i+2 == lu && u[i+1] == 1 && t == 0 && u[i] == 0 ) |
|
return l; /* m.s. word of the diff has become 0 */ |
|
w = u[i++]; |
|
#if BSH == BIT_WIDTH_OF_INT |
|
*p++ = t | (w << lsh); |
|
#else |
|
*p++ = t | ((w << lsh) & BMASK); |
|
#endif |
|
c = 1, t = w >> rsh; |
|
} |
for ( ; 1; t = w >> rsh, c = 1 ) { |
for ( ; 1; t = w >> rsh, c = 1 ) { |
if ( (w = u[i++] - c) >= 0 ) break; |
w = (x = u[i++]) - c; |
|
if ( x >= c ) break; |
|
#if BSH == BIT_WIDTH_OF_INT |
|
*p++ = t | (w << lsh); |
|
#else |
w += BASE; |
w += BASE; |
*p++ = t | ((w << lsh) & BMASK); |
*p++ = t | ((w << lsh) & BMASK); |
|
#endif |
} |
} |
|
#if BSH == BIT_WIDTH_OF_INT |
|
t |= (w << lsh); |
|
#else |
t |= ((w << lsh) & BMASK); |
t |= ((w << lsh) & BMASK); |
|
#endif |
w >>= rsh; |
w >>= rsh; |
if ( i >= lu ) { |
if ( i >= lu ) { |
if ( w != 0 ) { |
if ( w != 0 ) { |
*p++ = t; |
*p++ = t; |
*p = w; |
*p = w; |
return( lu + 1 ); |
return( lu + 1 ); |
} else if ( t == 0 ) return( i - 1 ); |
} else if ( t == 0 ) return( i - 1 ); |
else { *p = t; return i; } |
else { *p = t; return i; } |
} |
} |
*p++ = t; |
*p++ = t; |
t = w; |
t = w; |
} |
} |
|
#if BSH == BIT_WIDTH_OF_INT |
|
for ( ; i < lu; i++, t = w >> rsh ) *p++ = t | ((w = u[i]) << lsh); |
|
#else |
for ( ; i < lu; i++, t = w >> rsh ) *p++ = t | (((w = u[i]) << lsh) & BMASK); |
for ( ; i < lu; i++, t = w >> rsh ) *p++ = t | (((w = u[i]) << lsh) & BMASK); |
|
#endif |
if ( t == 0 ) return i; |
if ( t == 0 ) return i; |
*p = t; |
*p = t; |
return( i + 1 ); |
return( i + 1 ); |
} |
} |
|
|
/****************/ |
/****************//****************//****************//****************/ |
/****************/ |
/****************//****************//****************//****************/ |
#ifdef FULLSET |
|
static int abs_axU_V_maxrshift(), abs_axU_bxV_maxrshift(); |
|
|
|
static int abs_aU_bV_maxrshift( a, u, lu, b, v, lv, ans ) |
|
int a, *u, lu, b, *v, lv, *ans; |
|
/* |
|
* Compute | a*U - b*V | >> (as much as possible) in ans[], where U=u[0:lu-1] |
|
* and V=v[0:lv-1]. |
|
*/ |
|
{ |
|
if ( a == 1 ) return abs_U_aV_maxrshift( u, lu, b, v, lv, ans ); |
|
else if ( b == 1 ) return abs_U_aV_maxrshift( v, lv, a, u, lu, ans ); |
|
else if ( a == b ) return abs_axU_V_maxrshift( a, u, lu, v, lv, ans ); |
|
return abs_axU_bxV_maxrshift( a, u, lu, b, v, lv, ans ); |
|
} |
|
|
|
static int abs_axU_V_maxrshift( a, u, lu, v, lv, ans ) |
|
int a, *u, lu, *v, lv, *ans; |
|
/* |
|
* Compute a*| U - V | >> (as much as possible) in ans[], where U=u[0:lu-1] |
|
* and V=v[0:lv-1], 0 < a < 2^BASE. |
|
*/ |
|
{ |
|
int i, l, b, c, t, rsh, *p = ans, lsh, w, x; |
|
int hi; |
|
|
|
if ( lu > lv ) goto U_V; |
|
else if ( lu < lv ) goto swap; |
|
else { |
|
for ( i = lu; i-- > 0; ) { |
|
if ( u[i] == v[i] ) continue; |
|
lu = lv = i + 1; |
|
if ( u[i] > v[i] ) goto U_V; |
|
else goto swap; |
|
} |
|
return 0; |
|
} |
|
swap: |
|
SWAP( lu, lv, int ); SWAP( u, v, int * ); |
|
U_V: |
|
for ( b = c = i = 0; i < lv; ) { |
|
if ( (w = u[i] - v[i] - b) < 0 ) w += BASE, b = 1; |
|
else b = 0; |
|
DMA( a, w, c, hi, t, not_used ); |
|
i++, c = hi; |
|
if ( t != 0 ) goto non0w; |
|
} |
|
while ( i < lu ) { |
|
if ( (w = u[i] - b) < 0 ) w += BASE, b = 1; |
|
else b = 0; |
|
DMA( a, w, c, hi, t, not_used ); |
|
i++, c = hi; |
|
if ( t != 0 ) goto non0w; |
|
} |
|
if ( b != 0 ) c -= a; |
|
else if ( c == 0 ) return 0; |
|
while ( (c&1) == 0 ) c >>= 1; |
|
*p = c; |
|
return 1; |
|
/**/ |
|
non0w: |
|
u += i, lu -= i, v += i, lv -= i; |
|
TRAILINGZEROS( t, rsh ); |
|
i = 0; |
|
if ( rsh == 0 ) { |
|
*p++ = t, l = 0; |
|
for ( ; i < lv; c = hi ) { |
|
if ( (w = u[i] - v[i] - b) < 0 ) w += BASE, b = 1; |
|
else b = 0; |
|
DMA( a, w, c, hi, t, not_used ); |
|
i++; |
|
if ( (*p++ = t) != 0 ) l = i; |
|
} |
|
for ( ; i < lu; c = hi ) { |
|
if ( (w = u[i] - b) < 0 ) w += BASE, b = 1; |
|
else b = 1; |
|
DMA( a, w, c, hi, t, not_used ); |
|
i++; |
|
if ( (*p++ = t) != 0 ) l = i; |
|
} |
|
if ( b != 0 ) c -= a; |
|
if ( c == 0 ) return( l + 1 ); |
|
*p = c; |
|
return( i + 2 ); |
|
} else { |
|
for ( lsh = BSH - rsh, l = 0; i < lv; c = hi, t = x >> rsh ) { |
|
if ( (w = u[i] - v[i] - b) < 0 ) w += BASE, b = 1; |
|
else b = 0; |
|
DMA( a, w, c, hi, x, not_used ); |
|
i++; |
|
if ( (*p++ = t | ((x << lsh) & BMASK)) != 0 ) l = i; |
|
} |
|
for ( ; i < lu; i++, c = hi, t = x >> rsh ) { |
|
if ( (w = u[i] - b) < 0 ) w += BASE, b = 1; |
|
else b = 0; |
|
DMA( a, w, c, hi, x, not_used ); |
|
i++; |
|
if ( (*p++ = t | ((x << lsh) & BMASK)) != 0 ) l = i; |
|
} |
|
if ( b != 0 ) c -= a; |
|
if ( c != 0 ) { |
|
*p++ = t | ((c << lsh) & BMASK); |
|
i++, t = c >> rsh; |
|
} else if ( t == 0 ) return l; |
|
if ( t == 0 ) return( i ); |
|
*p = t; |
|
return( i + 1 ); |
|
} |
|
} |
|
#endif /* FULLSET */ |
|
|
|
static int abs_axU_bxV_maxrshift( a, u, lu, b, v, lv, ans ) |
static int abs_axU_bxV_maxrshift( a, u, lu, b, v, lv, ans ) |
|
#if BSH == BIT_WIDTH_OF_INT |
|
unsigned |
|
#endif |
int a, *u, lu, b, *v, lv, *ans; |
int a, *u, lu, b, *v, lv, *ans; |
/* |
/* |
* Compute | a*U - b*V | >> (as much as possible) in ans[], where U=u[0:lu-1] |
* Compute | a*U - b*V | >> (as much as possible) in ans[], where U=u[0:lu-1] |
* and V=v[0:lv-1], 0 < a, b < 2^BASE. |
* and V=v[0:lv-1], 0 < a, b < 2^BASE. |
*/ |
*/ |
{ |
{ |
int i, l, c, d, s, t, w, rsh, *p = ans, lsh; |
#if BSH == BIT_WIDTH_OF_INT |
int hi; |
unsigned |
static int bw_int32(); |
#endif |
|
int i, l, c, d, s, t, w, rsh, *p = ans, lsh, hi; |
|
extern int bw_int32(); |
|
|
BitWidth( a, c ); BitWidth( u[lu -1], s ); |
BitWidth( a, c ); BitWidth( u[lu -1], s ); |
BitWidth( b, d ); BitWidth( v[lv -1], t ); |
BitWidth( b, d ); BitWidth( v[lv -1], t ); |
Line 722 int a, *u, lu, b, *v, lv, *ans; |
|
Line 877 int a, *u, lu, b, *v, lv, *ans; |
|
SWAP( a, b, int ); SWAP( lu, lv, int ); SWAP( u, v, int * ); |
SWAP( a, b, int ); SWAP( lu, lv, int ); SWAP( u, v, int * ); |
} |
} |
for ( i = c = d = 0; i < lv; ) { |
for ( i = c = d = 0; i < lv; ) { |
DMA( a, u[i], c, hi, t, not_used ); /* 0 <= c <= 2^BSH -2 */ |
DMA( a, u[i], c, hi, t ); /* 0 <= c <= 2^BSH -2 */ c = hi; |
c = hi; |
DMA( b, v[i], d, hi, s ); /* 0 <= d <= 2^BSH -1 */ d = hi; |
DMA( b, v[i], d, hi, s, not_used ); /* 0 <= d <= 2^BSH -1 */ |
i++; |
i++, d = hi; |
if ( t == s ) continue; |
if ( (t -= s) == 0 ) continue; |
else if ( t > s ) t -= s; |
else if ( t < 0 ) { |
else { |
|
t -= s; |
|
#if BSH != BIT_WIDTH_OF_INT |
t += BASE; |
t += BASE; |
|
#endif |
if ( c != 0 ) c--; |
if ( c != 0 ) c--; |
else d++; |
else d++; |
} |
} |
goto non0w; |
goto non0w; |
} |
} |
|
/******/ |
if ( i >= lu ) { /* no more elm.'s in u[] and v[] */ |
if ( i >= lu ) { /* no more elm.'s in u[] and v[] */ |
only_c: |
only_c: |
if ( (c -= d) == 0 ) return 0; |
if ( c == d ) return 0; |
else if ( c < 0 ) c = -c; |
c = c > d ? c - d : d - c; |
sh_onlyc: |
sh_onlyc: |
/* TRAILINGZEROS( c, rsh ); */ |
/* TRAILINGZEROS( c, rsh ); */ |
while ( (c&1) == 0 ) c >>= 1; |
while ( (c&1) == 0 ) c >>= 1; |
Line 745 int a, *u, lu, b, *v, lv, *ans; |
|
Line 904 int a, *u, lu, b, *v, lv, *ans; |
|
return 1; |
return 1; |
} |
} |
/* there is at least one more elm. in u[] */ |
/* there is at least one more elm. in u[] */ |
DMA( a, u[i], c, hi, t, not_used ); |
DMA( a, u[i], c, hi, t ); |
i++, c = hi; |
i++, c = hi; |
if ( i >= lu ) { /* in this case, diff still can be <= 0 */ |
if ( i >= lu ) { /* in this case, diff still can be <= 0 */ |
if ( hi == 0 ) { c = t; goto only_c; } |
if ( hi == 0 ) { c = t; goto only_c; } |
if ( (t -= d) == 0 ) { c = hi; goto sh_onlyc; } |
if ( t == d ) { c = hi; goto sh_onlyc; } |
else if ( t < 0 ) t += BASE, hi--; |
else if ( t > d ) t -= d; |
|
else { |
|
t -= d, hi--; |
|
#if BSH != BIT_WIDTH_OF_INT |
|
t += BASE; |
|
#endif |
|
} |
TRAILINGZEROS( t, rsh ); |
TRAILINGZEROS( t, rsh ); |
if ( rsh == 0 ) *p++ = t; |
if ( rsh == 0 ) *p++ = t; |
else { |
else { |
|
#if BSH == BIT_WIDTH_OF_INT |
|
*p++ = t | (hi << (BSH - rsh)); |
|
#else |
*p++ = t | ((hi << (BSH - rsh)) & BMASK); |
*p++ = t | ((hi << (BSH - rsh)) & BMASK); |
|
#endif |
hi >>= rsh; |
hi >>= rsh; |
} |
} |
if ( hi == 0 ) return 1; |
if ( hi == 0 ) return 1; |
*p = hi; |
*p = hi; |
return 2; |
return 2; |
} /* diff turned out to be > 0 */ else if ( (t -= d) > 0 ) d = 0; |
} /* diff turned out to be > 0 */ else if ( t > d ) { |
else if ( t < 0 ) t += BASE, d = 1; |
t -= d; |
else { |
d = 0; |
|
} else if ( t < d ) { |
|
t -= d; |
|
#if BSH != BIT_WIDTH_OF_INT |
|
t += BASE; |
|
#endif |
|
d = 1; |
|
} else { |
while ( i < lu ) { |
while ( i < lu ) { |
DMA( a, u[i], c, hi, t, not_used ); |
DMA( a, u[i], c, hi, t ); |
i++, c = hi; |
i++, c = hi; |
if ( t != 0 ) break; |
if ( t != 0 ) break; |
} |
} |
Line 776 int a, *u, lu, b, *v, lv, *ans; |
|
Line 952 int a, *u, lu, b, *v, lv, *ans; |
|
*p++ = t; |
*p++ = t; |
goto no_more_v; |
goto no_more_v; |
} else goto no_more_v_sh; |
} else goto no_more_v_sh; |
/**/ |
/******/ |
non0w: |
non0w: |
u += i, lu -= i, v += i, lv -= i; |
u += i, lu -= i, v += i, lv -= i; |
TRAILINGZEROS( t, rsh ); |
TRAILINGZEROS( t, rsh ); |
Line 784 int a, *u, lu, b, *v, lv, *ans; |
|
Line 960 int a, *u, lu, b, *v, lv, *ans; |
|
if ( rsh == 0 ) { |
if ( rsh == 0 ) { |
*p++ = t, l = 0; |
*p++ = t, l = 0; |
for ( ; i < lv; *p++ = t ) { |
for ( ; i < lv; *p++ = t ) { |
DMA( a, u[i], c, hi, t, not_used ); |
DMA( a, u[i], c, hi, t ); c = hi; |
c = hi; |
DMA( b, v[i], d, hi, s ); d = hi; |
DMA( b, v[i], d, hi, s, not_used ); |
i++; |
i++, d = hi; |
if ( t == s ) continue; |
if ( (t -= s) == 0 ) continue; |
else if ( t > s ) t -= s; |
else if ( t < 0 ) { |
else { |
t += BASE; |
t -= s; |
if ( c != 0 ) c--; |
#if BSH != BIT_WIDTH_OF_INT |
else d++; |
t += BASE; |
|
#endif |
|
if ( c != 0 ) c--; |
|
else d++; |
} |
} |
l = i; |
l = i; |
} |
} |
no_more_v: |
no_more_v: |
if ( i >= lu ) { |
if ( i >= lu ) { |
final_c_d: |
final_c_d: |
if ( (c -= d) == 0 ) return( l + 1 ); |
if ( c == d ) return( l + 1 ); |
else if ( c < 0 ) { |
else if ( c > d ) c -= d; |
l = negate_nbd( ans, i + 1 ); /* <================ */ |
else { |
if ( (c = -c - 1) == 0 ) return l; |
l = negate_nbd( ans, i + 1 ); /* <================ */ |
|
if ( (c = d-c - 1) == 0 ) return l; |
} |
} |
*p = c; |
*p = c; |
return( i + 2 ); |
return( i + 2 ); |
Line 810 int a, *u, lu, b, *v, lv, *ans; |
|
Line 990 int a, *u, lu, b, *v, lv, *ans; |
|
/* a*u[i:lu-1] + c - d */ |
/* a*u[i:lu-1] + c - d */ |
if ( c >= d ) c -= d; |
if ( c >= d ) c -= d; |
else { |
else { |
DMA( a, u[i], c, hi, t, not_used ); |
DMA( a, u[i], c, hi, t ); |
if ( i+1 >= lu ) { |
if ( i+1 >= lu ) { |
if ( hi == 0 ) { c = t; goto final_c_d; } |
if ( hi == 0 ) { c = t; goto final_c_d; } |
if ( (t -= d) < 0 ) t += BASE, c = hi - 1; |
c = hi; |
else c = hi; |
if ( t >= d ) t -= d; |
i++, *p++ = t; |
else { |
goto final_c; |
t -= d; |
|
#if BSH != BIT_WIDTH_OF_INT |
|
t += BASE; |
|
#endif |
|
c--; |
|
} |
|
i++, *p++ = t; |
|
goto final_c; |
} |
} |
i++, c = hi; |
i++, c = hi; |
if ( (t -= d) >= 0 ) *p++ = t; |
if ( t >= d ) *p++ = t - d; |
else { |
else { |
*p++ = t + BASE; |
t -= d; |
if ( c != 0 ) c--; |
#if BSH != BIT_WIDTH_OF_INT |
else { |
t += BASE; |
for ( ; i < lu; *p++ = BMASK ) { |
#endif |
DMA( a, u[i], c, hi, t, not_used ); |
*p++ = t; |
i++, c = hi; |
if ( c != 0 ) c--; |
if ( t == 0 ) continue; |
else { |
*p++ = t - 1; |
for ( ; i < lu; *p++ = BMASK ) { |
goto aU; |
DMA( a, u[i], c, hi, t ); |
} |
i++, c = hi; |
c--; |
if ( t == 0 ) continue; |
goto final_c; |
*p++ = t - 1; |
} |
goto aU; |
|
} |
|
c--; |
|
goto final_c; |
|
} |
} |
} |
} |
} |
/*** return( aV_plus_c( a, &u[i], lu - i, c, p ) + i + 1 ); ***/ |
/*** return( aV_plus_c( a, &u[i], lu - i, c, p ) + i + 1 ); ***/ |
aU: |
aU: |
for ( ; i < lu; i++, c = hi, *p++ = t ) { DMA( a, u[i], c, hi, t, not_used ); } |
for ( ; i < lu; i++, c = hi, *p++ = t ) { DMA( a, u[i], c, hi, t ); } |
final_c: |
final_c: |
if ( c == 0 ) return( i + 1 ); |
if ( c == 0 ) return( i + 1 ); |
*p = c; |
*p = c; |
return( i + 2 ); |
return( i + 2 ); |
} else { /* rsh != 0 */ |
} else { /* rsh != 0 */ |
for ( lsh = BSH - rsh; i < lv; t = w >> rsh ) { |
for ( lsh = BSH - rsh; i < lv; t = w >> rsh ) { |
DMA( a, u[i], c, hi, w, not_used ); |
DMA( a, u[i], c, hi, w ); c = hi; |
c = hi; |
DMA( b, v[i], d, hi, s ); d = hi; |
DMA( b, v[i], d, hi, s, not_used ); |
i++; |
i++, d = hi; |
if ( w >= s ) w -= s; |
if ( (w -= s) < 0 ) { |
else { |
w += BASE; |
w -= s; |
if ( c != 0 ) c--; |
#if BSH != BIT_WIDTH_OF_INT |
else d++; |
w += BASE; |
|
#endif |
|
if ( c != 0 ) c--; |
|
else d++; |
} |
} |
|
#if BSH == BIT_WIDTH_OF_INT |
|
if ( (*p++ = t | (w << lsh)) != 0 ) l = i; |
|
#else |
if ( (*p++ = t | ((w << lsh) & BMASK)) != 0 ) l = i; |
if ( (*p++ = t | ((w << lsh) & BMASK)) != 0 ) l = i; |
|
#endif |
} |
} |
no_more_v_sh: |
no_more_v_sh: |
if ( i >= lu ) { |
if ( i >= lu ) { |
final_c_d_sh: |
final_c_d_sh: |
if ( (c -= d) == 0 ) |
if ( c == d ) |
if ( t == 0 ) return l; |
if ( t == 0 ) return l; |
else { *p = t; return( i + 1 ); } |
else { *p = t; return( i + 1 ); } |
else if ( c < 0 ) { |
else if ( c > d ) c -= d; |
if ( i == 0 ) t = (BASE >> rsh) - t; |
else { |
else { |
#if BSH == BIT_WIDTH_OF_INT |
l = negate_nbd( ans, i ); /* <================ */ |
if ( i == 0 ) t = (1 << lsh) - t; |
/* t = (BASE >> rsh) - t;*/ |
#else |
t ^= ((BMASK >> rsh)); |
if ( i == 0 ) t = (BASE >> rsh) - t; |
} |
#endif |
c = -c -1; |
else { |
|
l = negate_nbd( ans, i ); /* <================ */ |
|
/* t = (BASE >> rsh) - t;*/ |
|
t ^= ((BMASK >> rsh)); |
|
} |
|
c = d-c -1; |
} |
} |
|
#if BSH == BIT_WIDTH_OF_INT |
|
*p++ = t | (c << lsh); |
|
#else |
*p++ = t | ((c << lsh) & BMASK); |
*p++ = t | ((c << lsh) & BMASK); |
|
#endif |
if ( (c >>= rsh) == 0 ) return( i + 1 ); |
if ( (c >>= rsh) == 0 ) return( i + 1 ); |
*p = c; |
*p = c; |
return( i + 2 ); |
return( i + 2 ); |
} else if ( c >= d ) c -= d; |
} else if ( c >= d ) c -= d; |
else { |
else { |
DMA( a, u[i], c, hi, w, not_used ); |
DMA( a, u[i], c, hi, w ); |
if ( i+1 >= lu ) { |
if ( i+1 >= lu ) { |
if ( hi == 0 ) { c = w; goto final_c_d_sh; } |
if ( hi == 0 ) { c = w; goto final_c_d_sh; } |
if ( (w -= d) < 0 ) w += BASE, c = hi - 1; |
c = hi; |
else c = hi; |
if ( w >= d ) w -= d; |
i++, *p++ = t | ((w << lsh) & BMASK); |
else { |
t = w >> rsh; |
w -= d; |
goto final_c_sh; |
#if BSH != BIT_WIDTH_OF_INT |
|
w += BASE; |
|
#endif |
|
c--; |
|
} |
|
#if BSH == BIT_WIDTH_OF_INT |
|
i++, *p++ = t | (w << lsh); |
|
#else |
|
i++, *p++ = t | ((w << lsh) & BMASK); |
|
#endif |
|
t = w >> rsh; |
|
goto final_c_sh; |
} |
} |
i++, c = hi; |
i++, c = hi; |
if ( (w -= d) >= 0 ) { *p++ = t | ((w << lsh) & BMASK); t = w >> rsh; } |
if ( w >= d ) { |
else { |
w -= d; |
w += BASE; |
#if BSH == BIT_WIDTH_OF_INT |
*p++ = t | ((w << lsh) & BMASK); |
*p++ = t | (w << lsh); |
t = w >> rsh; |
#else |
if ( c != 0 ) c--; |
*p++ = t | ((w << lsh) & BMASK); |
else { |
#endif |
while ( i < lu ) { |
t = w >> rsh; |
DMA( a, u[i], c, hi, w, not_used ); |
} else { |
i++, c = hi; |
w -= d; |
if ( w == 0 ) { |
#if BSH == BIT_WIDTH_OF_INT |
*p++ = t | ((BMASK << lsh) & BMASK); |
*p++ = t | (w << lsh); |
t = BMASK >> rsh; |
#else |
continue; |
w += BASE; |
} else { |
*p++ = t | ((w << lsh) & BMASK); |
w--; |
#endif |
*p++ = t | ((w << lsh) & BMASK); |
t = w >> rsh; |
t = w >> rsh; |
if ( c != 0 ) c--; |
goto aU_sh; |
else { |
} |
while ( i < lu ) { |
} |
DMA( a, u[i], c, hi, w ); |
c--; |
c = hi; |
goto final_c_sh; |
i++; |
} |
if ( w == 0 ) { |
|
#if BSH == BIT_WIDTH_OF_INT |
|
*p++ = t | (BMASK << lsh); |
|
t = BMASK >> rsh; |
|
#else |
|
*p++ = t | ((BMASK << lsh) & BMASK); |
|
t = BMASK >> rsh; |
|
#endif |
|
continue; |
|
} else { |
|
w--; |
|
#if BSH == BIT_WIDTH_OF_INT |
|
*p++ = t | (w << lsh); |
|
#else |
|
*p++ = t | ((w << lsh) & BMASK); |
|
#endif |
|
t = w >> rsh; |
|
goto aU_sh; |
} |
} |
} |
} |
|
c--; |
|
goto final_c_sh; |
|
} |
|
} |
|
} |
/*** return( aV_plus_c_sh( a, &u[i], lu - i, c, rsh, t ) + i ); ***/ |
/*** return( aV_plus_c_sh( a, &u[i], lu - i, c, rsh, t ) + i ); ***/ |
aU_sh: |
aU_sh: |
for ( ; i < lu; i++, c = hi, t = w >> rsh ) { |
for ( ; i < lu; i++, c = hi, t = w >> rsh ) { |
DMA( a, u[i], c, hi, w, not_used ); |
DMA( a, u[i], c, hi, w ); |
|
#if BSH == BIT_WIDTH_OF_INT |
|
*p++ = t | (w << lsh); |
|
#else |
*p++ = t | ((w << lsh) & BMASK); |
*p++ = t | ((w << lsh) & BMASK); |
|
#endif |
} |
} |
final_c_sh: |
final_c_sh: |
if ( c != 0 ) { |
if ( c != 0 ) { |
|
#if BSH == BIT_WIDTH_OF_INT |
|
*p++ = t | (c << lsh); |
|
#else |
*p++ = t | ((c << lsh) & BMASK); |
*p++ = t | ((c << lsh) & BMASK); |
|
#endif |
i++, t = c >> rsh; |
i++, t = c >> rsh; |
} |
} |
if ( t == 0 ) return i; |
if ( t == 0 ) return i; |
Line 931 int a, *u, lu, b, *v, lv, *ans; |
|
Line 1179 int a, *u, lu, b, *v, lv, *ans; |
|
} |
} |
/****************/ |
/****************/ |
/****************/ |
/****************/ |
#ifdef FULLSET |
|
static int UplusV_maxrshift(), aUplusV_maxrshift(), axUplusV_maxrshift(), aUplusbV_maxrshift(); |
|
|
|
static int aU_plus_bV_maxrshift( a, u, lu, b, v, lv, ans ) |
static int aUplusbV_maxrshift( a, u, lu, b, v, lv, ans ) |
|
#if BSH == BIT_WIDTH_OF_INT |
|
unsigned |
|
#endif |
int a, *u, lu, b, *v, lv, *ans; |
int a, *u, lu, b, *v, lv, *ans; |
{ |
|
if ( a == 1 ) |
|
return( b == 1 ? UplusV_maxrshift( u, lu, v, lv, ans ) : |
|
aUplusV_maxrshift( b, v, lv, u, lu, ans ) ); |
|
else if ( b == 1 ) return aUplusV_maxrshift( a, u, lu, v, lv, ans ); |
|
else if ( a == b ) return axUplusV_maxrshift( a, u, lu, v, lv, ans ); |
|
return aUplusbV_maxrshift( a, u, lu, b, v, lv, ans ); |
|
} |
|
|
|
static int UplusV_maxrshift( u, lu, v, lv, ans ) |
|
int *u, lu, *v, lv, *ans; |
|
/* |
/* |
* Compute ( (U + V) >> (as much as possible) ) in ans[], where U=u[0:lu-1], |
* Compute ( (a*U + b*V) >> (as much as possible) ) in ans[], where U=u[0:lu-1], |
* V=v[0:lv-1], and 0 < a < BASE. |
* V=v[0:lv-1], and 0 < a,b < BASE. |
*/ |
*/ |
{ |
{ |
int i, t, c, rsh, *p = ans; |
#if BSH == BIT_WIDTH_OF_INT |
int hi; |
unsigned |
|
#endif |
|
int i, c, d, s, t, w, rsh, *p = ans, lsh, hi; |
|
|
if ( lu < lv ) { SWAP( lu, lv, int ); SWAP( u, v, int * ); } |
if ( lu < lv ) { SWAP( a, b, int ); SWAP( lu, lv, int ); SWAP( u, v, int * ); } |
for ( c = i = 0; i < lv; ) { |
for ( c = d = i = 0; i < lv; ) { |
t = (c += (u[i] + v[i])) & BMASK; |
DMA( a, u[i], c, hi, t ); /* 0 <= c <= 2^BSH -1 */ c = hi; |
/* 0 <= c <= 2*(2^BSH -1) + 1 = 2^BSH + (2^BSH -1) */ |
DMA( b, v[i], d, hi, s ); /* 0 <= d <= 2^BSH -2 */ d = hi; |
i++, c >>= BSH; |
i++; |
if ( t != 0 ) goto non0w; |
#if BSH == BIT_WIDTH_OF_INT |
} |
t += s; |
while ( i < lu ) { |
if ( t < s ) c++; |
t = (c += u[i]) & BMASK; |
|
i++, c >>= BSH; |
|
if ( t != 0 ) goto non0w; |
|
} |
|
*p = c; |
|
return 1; |
|
/**/ |
|
non0w: |
|
u += i, lu -= i, v += i, lv -= i; |
|
TRAILINGZEROS( t, rsh ); |
|
i = 0; |
|
if ( rsh == 0 ) { |
|
*p++ = t; |
|
for ( ; i < lv; i++, c >>= BSH ) *p++ = (c += (u[i] + v[i])) & BMASK; |
|
if ( c != 0 ) { |
|
while ( i < lu ) |
|
if ( (c = u[i++] + 1) >= BASE ) *p++ = c & BMASK; |
|
else { |
|
*p++ = c; |
|
goto cpu; |
|
} |
|
*p = 1; /* == c */ |
|
return( lu + 2 ); |
|
} |
|
cpu: |
|
for ( ; i < lu; i++ ) *p++ = u[i]; |
|
return( lu + 1 ); |
|
} else { |
|
int lsh = BSH - rsh; |
|
|
|
for ( ; i < lv; i++, c >>= BSH ) { |
|
c += (u[i] + v[i]); |
|
*p++ = t | ((c << lsh) & BMASK); |
|
t = (c & BMASK) >> rsh; |
|
} |
|
if ( c != 0 ) { |
|
while ( i < lu ) { |
|
c = u[i++] + 1; |
|
*p++ = t | ((c << lsh) & BMASK); |
|
t = (c & BMASK) >> rsh; |
|
if ( (c >>= BSH) == 0 ) goto cpu_sh; |
|
} |
|
*p = t | (1 << lsh); |
|
return( lu + 1 ); |
|
} |
|
cpu_sh: |
|
for ( ; i < lu; t = c >> rsh ) *p++ = t | (((c = u[i++]) << lsh) & BMASK); |
|
if ( t == 0 ) return( lu ); |
|
*p = t; |
|
return( lu + 1 ); |
|
} |
|
} |
|
|
|
static int aUplusV_maxrshift( a, u, lu, v, lv, ans ) |
|
int a, *u, lu, *v, lv, *ans; |
|
/* |
|
* Compute ( (a*U + V) >> (as much as possible) ) in ans[], where U=u[0:lu-1], |
|
* V=v[0:lv-1], and 1 < a < BASE. |
|
*/ |
|
{ |
|
int i, l, t, c, rsh, *p = ans, w, lsh; |
|
int hi; |
|
|
|
for ( l = lu < lv ? lu : lv, c = i = 0; i < l; ) { |
|
/* Note that (carry in a*U[*]) <= 2^BSH-2 because {(2^j-1)}^2 + (2^j-2) |
|
* = 2^j*(2^j -2)+(2^j -1), and the following c is <= 2^j -1 because |
|
* {(2^j -1)}^2 + (2^j -1) + (2^j -1) = 2^j*(2^j -1) + (2^j -1). |
|
* ^^^^^^carry^^^^^^ pv[?]. |
|
*/ |
|
c += v[i]; |
|
DMA( a, u[i], c, hi, t, not_used ); |
|
i++, c = hi; |
|
if ( t != 0 ) goto non0sum; |
|
} |
|
if ( i >= lu ) { /* compute (c + v[i:lv-1]) */ |
|
while ( i < lv ) { |
|
t = (c += v[i++]) & BMASK; |
|
c >>= BSH; |
|
if ( t != 0 ) goto non0w_v; |
|
} |
|
*p = 1; |
|
return 1; |
|
non0w_v: |
|
v += i, lv -= i; |
|
i = 0; |
|
TRAILINGZEROS( t, rsh ); |
|
if ( rsh == 0 ) { |
|
*p++ = t; |
|
L_addv: |
|
if ( c != 0 ) { |
|
while ( i < lv ) |
|
if ( (c = u[i++] + 1) >= BASE ) *p++ = c & BMASK; |
|
else { |
|
*p++ = c; |
|
goto cpv; |
|
} |
|
*p = 1; /* == c */ |
|
return( lv + 2 ); |
|
} |
|
cpv: |
|
for ( ; i < lv; i++ ) *p++ = v[i]; |
|
return( lv + 1 ); |
|
} else { |
|
lsh = BSH - rsh; |
|
L_addv_sh: |
|
if ( c != 0 ) { |
|
while ( i < lv ) { |
|
c += v[i++]; |
|
*p++ = t | ((c << lsh) & BMASK); |
|
t = (c & BMASK) >> rsh; |
|
if ( (c >>= BSH) == 0 ) goto cpv_sh; |
|
} |
|
*p = t | (1 << lsh); |
|
return( lv + 1 ); |
|
} |
|
cpv_sh: |
|
for ( ; i < lv; t = c >> rsh ) *p++ = t | (((c = v[i++]) << lsh) & BMASK); |
|
if ( t == 0 ) return( lv ); |
|
*p = t; |
|
return( lv + 1 ); |
|
} |
|
} else { /* i >= lv, and compute (c + a*u[i:lu-1]) */ |
|
while ( i < lu ) { |
|
DMA( a, u[i], c, hi, t, not_used ); |
|
i++, c = hi; |
|
if ( t != 0 ) goto non0w_u; |
|
} |
|
TRAILINGZEROS( c, rsh ); |
|
*p = c; |
|
return 1; |
|
/**/ |
|
non0w_u: |
|
u += i, lu -= i; |
|
TRAILINGZEROS( t, rsh ); |
|
i = 0; |
|
if ( rsh == 0 ) { |
|
*p++ = t; |
|
L_addu: |
|
#ifdef CALL |
|
return( aV_plus_c( a, u, lv, c, p ) + 1 ); |
|
#else |
#else |
for ( ; i < lu; i++, *p++ = t, c = hi ) { DMA( a, u[i], c, hi, t, not_used ); } |
t += s; |
if ( c == 0 ) return( lu + 1 ); |
if ( t > BMASK ) c++, t &= BMASK; |
*p = c; |
|
return( lu + 2 ); |
|
#endif |
#endif |
} else { |
|
lsh = BSH - rsh; |
|
L_addu_sh: |
|
#ifdef CALL |
|
return aV_plus_c_sh( a, u, lu, c, rsh, t, p ); |
|
#else |
|
for ( ; i < lu; i++, c = hi, t = w >> rsh ) { |
|
DMA( a, u[i], c, hi, w, not_used ); |
|
*p++ = t | ((w << lsh) & BMASK); |
|
} |
|
if ( c != 0 ) { |
|
*p++ = t | ((c << lsh) & BMASK); |
|
i++, t = c >> rsh; |
|
} |
|
if ( t == 0 ) return i; |
|
*p = t; |
|
return( i + 1 ); |
|
#endif |
|
} |
|
} |
|
/**/ |
|
non0sum: |
|
u += i, lu -= i, v += i, lv -= i, l -= i; |
|
TRAILINGZEROS( t, rsh ); |
|
i = 0; |
|
if ( rsh == 0 ) { |
|
*p++ = t; |
|
for ( ; i < l; i++, *p++ = t, c = hi ) { |
|
c += v[i]; |
|
DMA( a, u[i], c, hi, t, not_used ); |
|
} |
|
if ( i >= lu ) /* compute (c + v[i:lv-1]). note i may be >= lv */ goto L_addv; |
|
else /* i >= lv, and compute (c + u[i:lu-1]) */ goto L_addu; |
|
} else { |
|
lsh = BSH - rsh; |
|
for ( ; i < l; i++, c = hi, t = w >> rsh ) { |
|
c += v[i]; |
|
DMA( a, u[i], c, hi, w, not_used ); |
|
*p++ = t | ((w << lsh) & BMASK); |
|
} |
|
if ( i >= lu ) /* compute (c + v[i:lv-1]) >> rsh. note i may be >= lv */ goto L_addv_sh; |
|
else /* i >= lv, and compute (c + u[i:lu-1]) >> rsh */ goto L_addu_sh; |
|
} |
|
} |
|
|
|
|
|
static int axUplusV_maxrshift( a, u, lu, v, lv, ans ) |
|
int a, *u, lu, *v, lv, *ans; |
|
/* |
|
* Compute ( a*(U + V) >> (as much as possible) ) in ans[], where U=u[0:lu-1], |
|
* V=v[0:lv-1], and 1 < a < BASE. |
|
*/ |
|
{ |
|
int i, t, c, d, rsh, w, *p = ans, lsh, x; |
|
int hi; |
|
|
|
if ( lu < lv ) { SWAP( lu, lv, int ); SWAP( u, v, int * ); } |
|
for ( i = c = d = 0; i < lv; ) { |
|
w = (d += (u[i] + v[i])) & BMASK; |
|
DMA( a, w, c, hi, t, not_used ); |
|
i++, d >>= BSH, c = hi; |
|
if ( t != 0 ) goto non0w; |
if ( t != 0 ) goto non0w; |
} |
} |
while ( i < lu ) { |
#if BSH == BIT_WIDTH_OF_INT |
w = (d += u[i++]) & BMASK; |
c += d; |
DMA( a, w, c, hi, t, not_used ); |
if ( c < d ) { /* overflow, and c can never be >= 2^BSH - 1 */ |
d >>= BSH, c = hi; |
if ( i >= lu ) { d = 1; goto only_cd; } |
if ( t != 0 ) goto non0w; |
DMA( a, u[i], c, hi, t ); |
|
c = hi + 1; |
|
i++; |
|
if ( t != 0 ) goto non0t_u; |
} |
} |
if ( d != 0 ) c += a; |
for ( d = 0; i < lu; ) { |
|
DMA( a, u[i], c, hi, t ); |
|
c = hi; |
|
i++; |
|
if ( t != 0 ) goto non0t_u; |
|
} |
|
only_cd: |
TRAILINGZEROS( c, rsh ); |
TRAILINGZEROS( c, rsh ); |
if ( rsh != 0 || c <= BMASK ) { *p = c; return 1; } |
if ( d != 0 ) |
*p++ = c & BMASK; |
if ( rsh == 0 ) { *p++ = c; *p = 1; return 2; } |
*p = c >> BSH; |
else c |= (1 << (BSH - rsh)); |
return 2; |
*p = c; |
|
return 1; |
/**/ |
/**/ |
non0w: |
non0t_u: |
u += i, lu -= i, v += i, lv -= i; |
|
TRAILINGZEROS( t, rsh ); |
TRAILINGZEROS( t, rsh ); |
|
u += i, lu -= i; |
i = 0; |
i = 0; |
if ( rsh == 0 ) { |
if ( rsh == 0 ) { *p++ = t; goto u_rest; } |
*p++ = t; |
lsh = BSH - rsh; |
for ( ; i < lv; i++, d >>= BSH, *p++ = t, c = hi ) { |
goto u_rest_sh; |
w = (d += (u[i] + v[i])) & BMASK; |
#else |
DMA( a, w, c, hi, t, not_used ); |
|
} |
|
for ( ; i < lu; d >>= BSH, *p++ = t, c = hi ) { |
|
w = (d += u[i++]) & BMASK; |
|
DMA( a, w, c, hi, t, not_used ); |
|
} |
|
if ( d != 0 ) c += a; |
|
if ( c == 0 ) return( lu + 1 ); |
|
*p++ = c & BMASK; |
|
if ( (c >>= BSH) == 0 ) return( lu + 2 ); |
|
*p = c; |
|
return( lu + 3 ); |
|
} else { |
|
for ( lsh = BSH - rsh; i < lv; i++, d >>= BSH, t = x >> rsh, c = hi ) { |
|
w = (d += (u[i] + v[i])) & BMASK; |
|
DMA( a, w, c, hi, x, not_used ); |
|
*p++ = t | ((x << lsh) & BMASK); |
|
} |
|
for ( ; i < lu; d >>= BSH, t = x >> rsh, c = hi ) { |
|
w = (d += u[i++]) & BMASK; |
|
DMA( a, w, c, hi, x, not_used ); |
|
*p++ = t | ((x << lsh) & BMASK); |
|
} |
|
if ( d != 0 ) c += a; |
|
t |= ((c << lsh) & BMASK); |
|
c >>= rsh; |
|
if ( c != 0 ) { |
|
*p++ = t; |
|
*p = c; |
|
return( lu + 2 ); |
|
} else if ( t == 0 ) return lu; |
|
*p = t; |
|
return( lu + 1 ); |
|
} |
|
} |
|
#endif /* FULLSET */ |
|
|
|
static int aUplusbV_maxrshift( a, u, lu, b, v, lv, ans ) |
|
int a, *u, lu, b, *v, lv, *ans; |
|
/* |
|
* Compute ( (a*U + b*V) >> (as much as possible) ) in ans[], where U=u[0:lu-1], |
|
* V=v[0:lv-1], and 0 < a,b < BASE. |
|
*/ |
|
{ |
|
int i, c, d, s, t, w, rsh, *p = ans, lsh; |
|
int hi; |
|
|
|
if ( lu < lv ) { SWAP( a, b, int ); SWAP( lu, lv, int ); SWAP( u, v, int * ); } |
|
for ( c = d = i = 0; i < lv; ) { |
|
DMA( a, u[i], c, hi, t, not_used ); /* 0 <= c <= 2^BSH -1 */ |
|
c = hi; |
|
DMA( b, v[i], d, hi, s, not_used ); /* 0 <= d <= 2^BSH -2 */ |
|
i++, d = hi, t += s; |
|
if ( t > BMASK ) c++, t &= BMASK; |
|
if ( t != 0 ) goto non0w; |
|
} |
|
c += d; |
c += d; |
for ( d = 0; i < lu; ) { |
for ( d = 0; i < lu; ) { |
DMA( a, u[i], c, hi, t, not_used ); |
DMA( a, u[i], c, hi, t ); |
i++, c = hi; |
c = hi; |
|
i++; |
if ( t != 0 ) goto non0w; |
if ( t != 0 ) goto non0w; |
} |
} |
TRAILINGZEROS( c, rsh ); |
TRAILINGZEROS( c, rsh ); |
Line 1260 int a, *u, lu, b, *v, lv, *ans; |
|
Line 1252 int a, *u, lu, b, *v, lv, *ans; |
|
*p++ = c & BMASK; |
*p++ = c & BMASK; |
*p = 1; |
*p = 1; |
return 2; |
return 2; |
|
#endif |
/**/ |
/**/ |
non0w: |
non0w: |
u += i, lu -= i, v += i, lv -= i; |
u += i, lu -= i, v += i, lv -= i; |
Line 1268 int a, *u, lu, b, *v, lv, *ans; |
|
Line 1261 int a, *u, lu, b, *v, lv, *ans; |
|
if ( rsh == 0 ) { |
if ( rsh == 0 ) { |
*p++ = t; |
*p++ = t; |
for ( ; i < lv; i++, *p++ = t ) { |
for ( ; i < lv; i++, *p++ = t ) { |
DMA( a, u[i], c, hi, t, not_used ); |
DMA( a, u[i], c, hi, t ); c = hi; |
c = hi; |
DMA( b, v[i], d, hi, s ); d = hi; |
DMA( b, v[i], d, hi, s, not_used ); |
t += s; |
d = hi, t += s; |
#if BSH == BIT_WIDTH_OF_INT |
|
if ( t < s ) c++; |
|
#else |
if ( t > BMASK ) c++, t &= BMASK; |
if ( t > BMASK ) c++, t &= BMASK; |
|
#endif |
} |
} |
c += d; |
c += d; |
|
#if BSH == BIT_WIDTH_OF_INT |
|
if ( c < d ) { |
|
if ( i >= lu ) { *p++ = c; *p = 1; return( lu + 3 ); } |
|
DMA( a, u[i], c, hi, t ); |
|
c = hi + 1; |
|
i++; |
|
*p++ = t; |
|
} |
|
u_rest: |
for ( ; i < lu; i++, *p++ = t, c = hi ) { |
for ( ; i < lu; i++, *p++ = t, c = hi ) { |
DMA( a, u[i], c, hi, t, not_used ); |
DMA( a, u[i], c, hi, t ); |
} |
} |
if ( c == 0 ) return( lu + 1 ); |
if ( c == 0 ) return( lu + 1 ); |
|
*p = c; |
|
return( lu + 2 ); |
|
#else |
|
u_rest: |
|
for ( ; i < lu; i++, *p++ = t, c = hi ) { |
|
DMA( a, u[i], c, hi, t ); |
|
} |
|
if ( c == 0 ) return( lu + 1 ); |
else if ( c <= BMASK ) { *p = c; return( lu + 2 ); } |
else if ( c <= BMASK ) { *p = c; return( lu + 2 ); } |
*p++ = c & BMASK; |
*p++ = c & BMASK; |
*p = 1; |
*p = 1; |
return( lu + 3 ); |
return( lu + 3 ); |
|
#endif |
} else { |
} else { |
for ( lsh = BSH - rsh; i < lv; i++, t = w >> rsh ) { |
for ( lsh = BSH - rsh; i < lv; i++, t = w >> rsh ) { |
DMA( a, u[i], c, hi, w, not_used ); |
DMA( a, u[i], c, hi, w ); c = hi; |
c = hi; |
DMA( b, v[i], d, hi, s ); d = hi; |
DMA( b, v[i], d, hi, s, not_used ); |
w += s; |
d = hi, w += s; |
#if BSH == BIT_WIDTH_OF_INT |
|
if ( w < s ) c++; |
|
*p++ = t | (w << lsh); |
|
#else |
if ( w > BMASK ) c++, w &= BMASK; |
if ( w > BMASK ) c++, w &= BMASK; |
*p++ = t | ((w << lsh) & BMASK); |
*p++ = t | ((w << lsh) & BMASK); |
|
#endif |
} |
} |
c += d; /* <= 2^BSH + (2^BSH - 3) */ |
c += d; /* <= 2^BSH + (2^BSH - 3) */ |
|
#if BSH == BIT_WIDTH_OF_INT |
|
if ( c < d ) { |
|
if ( i >= lu ) { |
|
*p++ = t | (c << lsh); |
|
*p = (c >> rsh) | (1 << lsh); |
|
return( lu + 2 ); |
|
} |
|
DMA( a, u[i], c, hi, w ); |
|
c = hi + 1; |
|
i++; |
|
*p++ = t | (w << lsh); |
|
t = w >> rsh; |
|
} |
|
u_rest_sh: |
|
for ( ; i < lu; i++, t = w >> rsh ) { |
|
DMA( a, u[i], c, hi, w ); |
|
c = hi; |
|
*p++ = t | (w << lsh); |
|
} |
|
#else |
|
u_rest_sh: |
for ( ; i < lu; i++, c = hi, t = w >> rsh ) { |
for ( ; i < lu; i++, c = hi, t = w >> rsh ) { |
DMA( a, u[i], c, hi, w, not_used ); |
DMA( a, u[i], c, hi, w ); |
*p++ = t | ((w << lsh) & BMASK); |
*p++ = t | ((w << lsh) & BMASK); |
} |
} |
|
#endif |
if ( c == 0 ) { |
if ( c == 0 ) { |
if ( t == 0 ) return lu; |
if ( t == 0 ) return lu; |
*p = t; |
*p = t; |
return( lu + 1 ); |
return( lu + 1 ); |
} |
} |
|
#if BSH == BIT_WIDTH_OF_INT |
|
*p++ = t | (c << lsh); |
|
#else |
*p++ = t | ((c << lsh) & BMASK); |
*p++ = t | ((c << lsh) & BMASK); |
|
#endif |
if ( (c >>= rsh) == 0 ) return( lu + 1 ); |
if ( (c >>= rsh) == 0 ) return( lu + 1 ); |
*p = c; |
*p = c; |
return( lu + 2 ); |
return( lu + 2 ); |