version 1.6, 2001/03/13 01:10:24 |
version 1.13, 2001/07/13 08:25:21 |
|
|
* 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/builtin/poly.c,v 1.5 2000/08/22 05:03:59 noro Exp $ |
* $OpenXM: OpenXM_contrib2/asir2000/builtin/poly.c,v 1.12 2001/06/29 09:08:52 noro Exp $ |
*/ |
*/ |
#include "ca.h" |
#include "ca.h" |
#include "parse.h" |
#include "parse.h" |
Line 63 void Pp_mag(),Pmaxblen(); |
|
Line 63 void Pp_mag(),Pmaxblen(); |
|
void Pmergelist(), Pch_mv(), Pre_mv(), Pdeglist(); |
void Pmergelist(), Pch_mv(), Pre_mv(), Pdeglist(); |
void Pptomp(),Pmptop(); |
void Pptomp(),Pmptop(); |
void Pptolmp(),Plmptop(); |
void Pptolmp(),Plmptop(); |
void Psfptop(); |
void Pptosfp(),Psfptop(),Psf_galois_action(),Psf_embed(),Psf_find_root(); |
|
void Psf_minipoly(),Psf_log(); |
void Pptogf2n(),Pgf2ntop(),Pgf2ntovect(); |
void Pptogf2n(),Pgf2ntop(),Pgf2ntovect(); |
void Pptogfpn(),Pgfpntop(); |
void Pptogfpn(),Pgfpntop(); |
void Pfind_root_gf2n(); |
void Pfind_root_gf2n(); |
Line 100 void Pis_irred_gf2(); |
|
Line 101 void Pis_irred_gf2(); |
|
void Pis_irred_ddd_gf2(); |
void Pis_irred_ddd_gf2(); |
void Pget_next_fft_prime(); |
void Pget_next_fft_prime(); |
void Puadj_coef(); |
void Puadj_coef(); |
|
void Preorder(); |
|
void Phomogeneous_part(); |
|
void Phomogeneous_deg(); |
void simp_ff(Obj,Obj *); |
void simp_ff(Obj,Obj *); |
void ranp(int,UP *); |
void ranp(int,UP *); |
void field_order_ff(N *); |
void field_order_ff(N *); |
Line 111 extern int lm_lazy; |
|
Line 115 extern int lm_lazy; |
|
int current_ff; |
int current_ff; |
|
|
struct ftab poly_tab[] = { |
struct ftab poly_tab[] = { |
|
{"homogeneous_deg",Phomogeneous_deg,-2}, |
|
{"homogeneous_part",Phomogeneous_part,-3}, |
|
{"reorder",Preorder,3}, |
{"uadj_coef",Puadj_coef,3}, |
{"uadj_coef",Puadj_coef,3}, |
{"ranp",Pranp,2}, |
{"ranp",Pranp,2}, |
{"p_mag",Pp_mag,1}, |
{"p_mag",Pp_mag,1}, |
Line 144 struct ftab poly_tab[] = { |
|
Line 151 struct ftab poly_tab[] = { |
|
{"ptolmp",Pptolmp,1}, |
{"ptolmp",Pptolmp,1}, |
{"lmptop",Plmptop,1}, |
{"lmptop",Plmptop,1}, |
|
|
{"sfptop",Psfptop,1}, |
{"sf_galois_action",Psf_galois_action,2}, |
|
{"sf_find_root",Psf_find_root,1}, |
|
{"sf_minipoly",Psf_minipoly,2}, |
|
{"sf_embed",Psf_embed,3}, |
|
{"sf_log",Psf_log,1}, |
|
|
|
{"ptosfp",Pptosfp,1}, |
|
{"sfptop",Psfptop,1}, |
{"ptogf2n",Pptogf2n,1}, |
{"ptogf2n",Pptogf2n,1}, |
{"gf2ntop",Pgf2ntop,-2}, |
{"gf2ntop",Pgf2ntop,-2}, |
{"gf2ntovect",Pgf2ntovect,1}, |
{"gf2ntovect",Pgf2ntovect,1}, |
Line 215 struct ftab poly_tab[] = { |
|
Line 228 struct ftab poly_tab[] = { |
|
|
|
extern V up_var; |
extern V up_var; |
|
|
|
void Phomogeneous_part(arg,rp) |
|
NODE arg; |
|
P *rp; |
|
{ |
|
if ( argc(arg) == 2 ) |
|
exthp(CO,(P)ARG0(arg),QTOS((Q)ARG1(arg)),rp); |
|
else |
|
exthpc_generic(CO,(P)ARG0(arg),QTOS((Q)ARG2(arg)), |
|
VR((P)ARG1(arg)),rp); |
|
} |
|
|
|
void Phomogeneous_deg(arg,rp) |
|
NODE arg; |
|
Q *rp; |
|
{ |
|
int d; |
|
|
|
if ( argc(arg) == 1 ) |
|
d = homdeg((P)ARG0(arg)); |
|
else |
|
d = getchomdeg(VR((P)ARG1(arg)),(P)ARG0(arg)); |
|
STOQ(d,*rp); |
|
} |
|
|
|
/* |
|
p1 = reorder(p,ovl,nvl) => p1 is 'sorted accoding to nvl. |
|
*/ |
|
|
|
void Preorder(arg,rp) |
|
NODE arg; |
|
P *rp; |
|
{ |
|
VL ovl,nvl,tvl; |
|
NODE n; |
|
|
|
for ( ovl = 0, n = BDY((LIST)ARG1(arg)); n; n = NEXT(n) ) { |
|
if ( !ovl ) { |
|
NEWVL(ovl); tvl = ovl; |
|
} else { |
|
NEWVL(NEXT(tvl)); tvl = NEXT(tvl); |
|
} |
|
VR(tvl) = VR((P)BDY(n)); |
|
} |
|
for ( nvl = 0, n = BDY((LIST)ARG2(arg)); n; n = NEXT(n) ) { |
|
if ( !nvl ) { |
|
NEWVL(nvl); tvl = nvl; |
|
} else { |
|
NEWVL(NEXT(tvl)); tvl = NEXT(tvl); |
|
} |
|
VR(tvl) = VR((P)BDY(n)); |
|
} |
|
reorderp(nvl,ovl,(P)ARG0(arg),rp); |
|
} |
|
|
/* |
/* |
uadj_coef(F,M,M2) |
uadj_coef(F,M,M2) |
if ( F is a non-negative integer ) |
if ( F is a non-negative integer ) |
|
|
STOQ(ret,*rp); |
STOQ(ret,*rp); |
} |
} |
|
|
extern int current_gfs_ext; |
extern P current_gfs_ext; |
|
extern int current_gfs_p; |
extern int current_gfs_q; |
extern int current_gfs_q; |
extern int current_gfs_q1; |
extern int current_gfs_q1; |
extern int *current_gfs_plus1; |
extern int *current_gfs_plus1; |
|
|
Obj *rp; |
Obj *rp; |
{ |
{ |
int ac; |
int ac; |
|
int d; |
Obj mod,defpoly; |
Obj mod,defpoly; |
N n; |
N n; |
UP up; |
UP up; |
|
|
error("setmod_ff : invalid argument"); |
error("setmod_ff : invalid argument"); |
switch ( OID(mod) ) { |
switch ( OID(mod) ) { |
case O_N: |
case O_N: |
if ( SGN((Q)mod) < 0 ) { |
current_ff = FF_GFP; |
/* small finite field; primitive root representation */ |
setmod_lm(NM((Q)mod)); |
current_ff = FF_GFS; |
|
setmod_sf(BD(NM((Q)mod))[0],1); |
|
} else { |
|
current_ff = FF_GFP; |
|
setmod_lm(NM((Q)mod)); |
|
} |
|
break; |
break; |
case O_P: |
case O_P: |
current_ff = FF_GF2N; |
current_ff = FF_GF2N; |
|
|
error("setmod_ff : invalid argument"); |
error("setmod_ff : invalid argument"); |
} |
} |
} else if ( ac == 2 ) { |
} else if ( ac == 2 ) { |
mod = (Obj)ARG1(arg); |
if ( OID(ARG0(arg)) == O_N ) { |
if ( SGN((Q)mod) < 0 ) { |
/* small finite field; primitive root representation */ |
error("setmod_ff : not implemented yet"); |
current_ff = FF_GFS; |
|
setmod_sf(QTOS((Q)ARG0(arg)),QTOS((Q)ARG1(arg))); |
} else { |
} else { |
|
mod = (Obj)ARG1(arg); |
current_ff = FF_GFPN; |
current_ff = FF_GFPN; |
defpoly = (Obj)ARG0(arg); |
defpoly = (Obj)ARG0(arg); |
if ( !mod || !defpoly ) |
if ( !mod || !defpoly ) |
|
|
MKLIST(list,n0); |
MKLIST(list,n0); |
*rp = (Obj)list; break; |
*rp = (Obj)list; break; |
case FF_GFS: |
case FF_GFS: |
STOQ(current_gfs_q,q); |
STOQ(current_gfs_p,q); |
STOQ(current_gfs_iton[1],r); |
if ( current_gfs_ext ) { |
n0 = mknode(3,ONE,q,r); |
enc_to_p(current_gfs_p,current_gfs_iton[1], |
|
VR(current_gfs_ext),&p); |
|
n0 = mknode(3,q,current_gfs_ext,p); |
|
} else { |
|
if ( current_gfs_p == 2 ) |
|
r = ONE; |
|
else |
|
STOQ(current_gfs_iton[1],r); |
|
n0 = mknode(3,q,current_gfs_ext,r); |
|
} |
MKLIST(list,n0); |
MKLIST(list,n0); |
*rp = (Obj)list; break; |
*rp = (Obj)list; break; |
default: |
default: |
|
|
getmod_gf2n(&up2); d = degup2(up2); STOQ(d,*rp); break; |
getmod_gf2n(&up2); d = degup2(up2); STOQ(d,*rp); break; |
case FF_GFPN: |
case FF_GFPN: |
getmod_gfpn(&up); STOQ(up->d,*rp); break; |
getmod_gfpn(&up); STOQ(up->d,*rp); break; |
|
case FF_GFS: |
|
if ( !current_gfs_ext ) |
|
*rp = ONE; |
|
else |
|
*rp = DEG(DC(current_gfs_ext)); |
|
break; |
default: |
default: |
error("extdeg_ff : current_ff is not set"); |
error("extdeg_ff : current_ff is not set"); |
} |
} |
|
|
getmod_lm(&lm); NTOQ(lm,1,*rp); break; |
getmod_lm(&lm); NTOQ(lm,1,*rp); break; |
case FF_GF2N: |
case FF_GF2N: |
STOQ(2,*rp); break; |
STOQ(2,*rp); break; |
|
case FF_GFS: |
|
STOQ(current_gfs_p,*rp); break; |
default: |
default: |
error("characteristic_ff : current_ff is not set"); |
error("characteristic_ff : current_ff is not set"); |
} |
} |
|
|
case FF_GFPN: |
case FF_GFPN: |
getmod_lm(&m); |
getmod_lm(&m); |
getmod_gfpn(&up); pwrn(m,up->d,order); break; |
getmod_gfpn(&up); pwrn(m,up->d,order); break; |
|
case FF_GFS: |
|
STON(current_gfs_q,*order); break; |
default: |
default: |
error("field_order_ff : current_ff is not set"); |
error("field_order_ff : current_ff is not set"); |
} |
} |
|
|
LM l; |
LM l; |
GF2N g; |
GF2N g; |
GFPN p; |
GFPN p; |
|
GFS s; |
|
|
switch ( current_ff ) { |
switch ( current_ff ) { |
case FF_GFP: |
case FF_GFP: |
|
|
randomgf2n(&g); *rp = (Obj)g; break; |
randomgf2n(&g); *rp = (Obj)g; break; |
case FF_GFPN: |
case FF_GFPN: |
randomgfpn(&p); *rp = (Obj)p; break; |
randomgfpn(&p); *rp = (Obj)p; break; |
|
case FF_GFS: |
|
randomgfs(&s); *rp = (Obj)s; break; |
default: |
default: |
error("random_ff : current_ff is not set"); |
error("random_ff : current_ff is not set"); |
} |
} |
|
|
ntogfpn((Obj)p,&rpn); simpgfpn((GFPN)rpn,&spn); *rp = (Obj)spn; |
ntogfpn((Obj)p,&rpn); simpgfpn((GFPN)rpn,&spn); *rp = (Obj)spn; |
break; |
break; |
case FF_GFS: |
case FF_GFS: |
if ( current_gfs_ext > 1 ) { |
if ( NID((Num)p) == N_GFS ) |
error("simp_ff : not implemented yet"); |
*rp = p; |
} else { |
else { |
ptomp(current_gfs_q,(P)p,&t); mqtogfs(t,&rs); |
ptomp(current_gfs_p,(P)p,&t); mqtogfs(t,&rs); |
*rp = (Obj)rs; |
*rp = (Obj)rs; |
} |
} |
break; |
break; |
default: |
default: |
*rp = (Obj)p; |
*rp = (Obj)p; |
|
|
lmptop((P)ARG0(arg),rp); |
lmptop((P)ARG0(arg),rp); |
} |
} |
|
|
|
void Psf_galois_action(arg,rp) |
|
NODE arg; |
|
P *rp; |
|
{ |
|
sf_galois_action(ARG0(arg),ARG1(arg),rp); |
|
} |
|
|
|
/* |
|
sf_embed(F,B,PM) |
|
F : an element of GF(pn) |
|
B : the image of the primitive root of GF(pn) |
|
PM : order of GF(pm) |
|
*/ |
|
|
|
void Psf_embed(arg,rp) |
|
NODE arg; |
|
P *rp; |
|
{ |
|
int k,pm; |
|
|
|
/* GF(pn)={0,1,a,a^2,...}->GF(pm)={0,1,b,b^2,...}; a->b^k */ |
|
k = CONT((GFS)ARG1(arg)); |
|
pm = QTOS((Q)ARG2(arg)); |
|
sf_embed((P)ARG0(arg),k,pm,rp); |
|
} |
|
|
|
void Psf_log(arg,rp) |
|
NODE arg; |
|
Q *rp; |
|
{ |
|
int k; |
|
|
|
if ( !ARG0(arg) ) |
|
error("sf_log : invalid armument"); |
|
k = CONT((GFS)ARG0(arg)); |
|
STOQ(k,*rp); |
|
} |
|
|
|
void Psf_find_root(arg,rp) |
|
NODE arg; |
|
GFS *rp; |
|
{ |
|
P p; |
|
Obj t; |
|
int d; |
|
UM u; |
|
int *root; |
|
|
|
p = (P)ARG0(arg); |
|
simp_ff((Obj)p,&t); p = (P)t; |
|
d = getdeg(VR(p),p); |
|
u = W_UMALLOC(d); |
|
ptosfum(p,u); |
|
root = (int *)ALLOCA(d*sizeof(int)); |
|
find_rootsf(u,root); |
|
MKGFS(IFTOF(root[0]),*rp); |
|
} |
|
|
|
void Psf_minipoly(arg,rp) |
|
NODE arg; |
|
P *rp; |
|
{ |
|
Obj t; |
|
P p1,p2; |
|
int d1,d2; |
|
UM up1,up2,m; |
|
|
|
p1 = (P)ARG0(arg); simp_ff((Obj)p1,&t); p1 = (P)t; |
|
p2 = (P)ARG1(arg); simp_ff((Obj)p2,&t); p2 = (P)t; |
|
d1 = getdeg(VR(p1),p1); up1 = W_UMALLOC(d1); ptosfum(p1,up1); |
|
d2 = getdeg(VR(p2),p2); up2 = W_UMALLOC(d2); ptosfum(p2,up2); |
|
m = W_UMALLOC(d2); |
|
minipolysf(up1,up2,m); |
|
sfumtop(VR(p2),m,&p1); |
|
sfptop(p1,rp); |
|
} |
|
|
|
void Pptosfp(arg,rp) |
|
NODE arg; |
|
P *rp; |
|
{ |
|
ptosfp(ARG0(arg),rp); |
|
} |
|
|
void Psfptop(arg,rp) |
void Psfptop(arg,rp) |
NODE arg; |
NODE arg; |
P *rp; |
P *rp; |
|
|
case FF_GF2N: |
case FF_GF2N: |
powermodup_gf2n(p1,&p2); break; |
powermodup_gf2n(p1,&p2); break; |
case FF_GFPN: |
case FF_GFPN: |
|
case FF_GFS: |
powermodup(p1,&p2); break; |
powermodup(p1,&p2); break; |
default: |
default: |
error("pwrmod_ff : current_ff is not set"); |
error("pwrmod_ff : current_ff is not set"); |
|
|
case FF_GF2N: |
case FF_GF2N: |
generic_powermodup_gf2n(g,f,(Q)ARG2(arg),&r); break; |
generic_powermodup_gf2n(g,f,(Q)ARG2(arg),&r); break; |
case FF_GFPN: |
case FF_GFPN: |
|
case FF_GFS: |
generic_powermodup(g,f,(Q)ARG2(arg),&r); break; |
generic_powermodup(g,f,(Q)ARG2(arg),&r); break; |
default: |
default: |
error("generic_pwrmod_ff : current_ff is not set"); |
error("generic_pwrmod_ff : current_ff is not set"); |
|
|
case FF_GF2N: |
case FF_GF2N: |
powertabup_gf2n(f,xp,tab); break; |
powertabup_gf2n(f,xp,tab); break; |
case FF_GFPN: |
case FF_GFPN: |
|
case FF_GFS: |
powertabup(f,xp,tab); break; |
powertabup(f,xp,tab); break; |
default: |
default: |
error("pwrtab_ff : current_ff is not set"); |
error("pwrtab_ff : current_ff is not set"); |