version 1.4, 2000/12/21 02:51:45 |
version 1.8, 2007/02/18 05:36:27 |
|
|
* 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/N.c,v 1.3 2000/08/22 05:04:04 noro Exp $ |
* $OpenXM: OpenXM_contrib2/asir2000/engine/N.c,v 1.7 2004/12/04 09:39:27 noro Exp $ |
*/ |
*/ |
#include "ca.h" |
#include "ca.h" |
#include "base.h" |
#include "base.h" |
|
|
void addn(); |
#if defined(VISUAL) || ( defined(i386) && !defined(__DARWIN__) ) |
int subn(); |
void addn(N n1,N n2,N *nr) |
void _bshiftn(); |
|
void dupn(); |
|
|
|
#if defined(VISUAL) || defined(i386) |
|
void addn(n1,n2,nr) |
|
N n1,n2,*nr; |
|
{ |
{ |
unsigned int *m1,*m2,*mr; |
unsigned int *m1,*m2,*mr; |
unsigned int c; |
unsigned int c; |
|
|
} |
} |
} |
} |
|
|
int subn(n1,n2,nr) |
int subn(N n1,N n2,N *nr) |
N n1,n2,*nr; |
|
{ |
{ |
N r; |
N r; |
unsigned int *m1,*m2,*mr,br; |
unsigned int *m1,*m2,*mr,br; |
|
|
} |
} |
} |
} |
|
|
void _addn(n1,n2,nr) |
void _addn(N n1,N n2,N nr) |
N n1,n2,nr; |
|
{ |
{ |
unsigned int *m1,*m2,*mr; |
unsigned int *m1,*m2,*mr; |
unsigned int c; |
unsigned int c; |
|
|
} |
} |
} |
} |
|
|
int _subn(n1,n2,nr) |
int _subn(N n1,N n2,N nr) |
N n1,n2,nr; |
|
{ |
{ |
unsigned int *m1,*m2,*mr,br; |
unsigned int *m1,*m2,*mr,br; |
unsigned int tmp,t; |
unsigned int tmp,t; |
|
|
} |
} |
#else |
#else |
|
|
void addn(n1,n2,nr) |
void addn(N n1,N n2,N *nr) |
N n1,n2,*nr; |
|
{ |
{ |
unsigned int *m1,*m2,*mr,i,c; |
unsigned int *m1,*m2,*mr,i,c; |
N r; |
N r; |
|
|
} |
} |
} |
} |
|
|
int subn(n1,n2,nr) |
int subn(N n1,N n2,N *nr) |
N n1,n2,*nr; |
|
{ |
{ |
N r; |
N r; |
unsigned int *m1,*m2,*mr,i,br; |
unsigned int *m1,*m2,*mr,i,br; |
|
|
} |
} |
} |
} |
|
|
void _addn(n1,n2,nr) |
void _addn(N n1,N n2,N nr) |
N n1,n2,nr; |
|
{ |
{ |
unsigned int *m1,*m2,*mr,i,c; |
unsigned int *m1,*m2,*mr,i,c; |
int d1,d2; |
int d1,d2; |
|
|
} |
} |
} |
} |
|
|
int _subn(n1,n2,nr) |
int _subn(N n1,N n2,N nr) |
N n1,n2,nr; |
|
{ |
{ |
N r; |
N r; |
unsigned int *m1,*m2,*mr,i,br; |
unsigned int *m1,*m2,*mr,i,br; |
|
|
|
|
/* a2 += a1; n2 >= n1 */ |
/* a2 += a1; n2 >= n1 */ |
|
|
void addarray_to(a1,n1,a2,n2) |
void addarray_to(unsigned int *a1,int n1,unsigned int *a2,int n2) |
unsigned int *a1; |
|
int n1; |
|
unsigned int *a2; |
|
int n2; |
|
{ |
{ |
int i; |
int i; |
unsigned int c,tmp; |
unsigned int c,tmp; |
|
|
*a2 = c; |
*a2 = c; |
} |
} |
|
|
void pwrn(n,e,nr) |
void pwrn(N n,int e,N *nr) |
N n,*nr; |
|
int e; |
|
{ |
{ |
N nw,nw1; |
N nw,nw1; |
|
|
Line 689 extern int igcd_algorithm; |
|
Line 670 extern int igcd_algorithm; |
|
|
|
void gcdEuclidn(), gcdn_HMEXT(); |
void gcdEuclidn(), gcdn_HMEXT(); |
|
|
void gcdn(n1,n2,nr) |
void lcmn(N n1,N n2,N *nr) |
N n1,n2,*nr; |
|
{ |
{ |
N m1,m2,g; |
N g,t; |
|
|
|
gcdn(n1,n2,&g); |
|
divsn(n1,g,&t); |
|
muln(t,n2,nr); |
|
} |
|
|
|
void gcdn(N n1,N n2,N *nr) |
|
{ |
if ( !igcd_algorithm ) |
if ( !igcd_algorithm ) |
gcdEuclidn(n1,n2,nr); |
gcdEuclidn(n1,n2,nr); |
else { |
else { |
|
|
|
|
#include "Ngcd.c" |
#include "Ngcd.c" |
|
|
void gcdEuclidn(n1,n2,nr) |
void gcdEuclidn(N n1,N n2,N *nr) |
N n1,n2,*nr; |
|
{ |
{ |
N m1,m2,q,r; |
N m1,m2,q,r; |
unsigned int i1,i2,ir; |
unsigned int i1,i2,ir; |
|
|
} |
} |
} |
} |
|
|
int cmpn(n1,n2) |
int cmpn(N n1,N n2) |
N n1,n2; |
|
{ |
{ |
int i; |
int i; |
unsigned int *m1,*m2; |
unsigned int *m1,*m2; |
|
|
} |
} |
} |
} |
|
|
void bshiftn(n,b,r) |
void bshiftn(N n,int b,N *r) |
N n; |
|
int b; |
|
N *r; |
|
{ |
{ |
int w,l,nl,i,j; |
int w,l,nl,i,j; |
N z; |
N z; |
|
|
} |
} |
|
|
#if 0 |
#if 0 |
void _bshiftn(n,b,z) |
void _bshiftn(N n,int b,N z) |
N n; |
|
int b; |
|
N z; |
|
{ |
{ |
int w,l,nl,i,j; |
int w,l,nl,i,j; |
unsigned int msw; |
unsigned int msw; |
|
|
} |
} |
#endif |
#endif |
|
|
void shiftn(n,w,r) |
void shiftn(N n,int w,N *r) |
N n; |
|
int w; |
|
N *r; |
|
{ |
{ |
int l,nl; |
int l,nl; |
N z; |
N z; |
|
|
} |
} |
} |
} |
|
|
void randomn(bits,r) |
void randomn(int bits,N *r) |
int bits; |
|
N *r; |
|
{ |
{ |
int l,i; |
int l,i; |
unsigned int *tb; |
unsigned int *tb; |
|
|
PL(t) = i+1; |
PL(t) = i+1; |
} |
} |
|
|
void freen(n) |
void freen(N n) |
N n; |
|
{ |
{ |
if ( n && (n != ONEN) ) |
if ( n && (n != ONEN) ) |
free(n); |
free(n); |
} |
} |
|
|
int n_bits(n) |
/* accepts Z */ |
N n; |
int n_bits(N n) |
{ |
{ |
unsigned int l,i,t; |
unsigned int i,t; |
|
int l; |
|
|
if ( !n ) |
if ( !n ) |
return 0; |
return 0; |
l = PL(n); t = BD(n)[l-1]; |
l = PL(n); |
|
if ( l < 0 ) l = -l; |
|
t = BD(n)[l-1]; |
for ( i = 0; t; t>>=1, i++); |
for ( i = 0; t; t>>=1, i++); |
return i + (l-1)*BSH; |
return i + (l-1)*BSH; |
} |
} |