| version 1.86, 2014/01/07 06:22:08 |
version 1.88, 2015/03/15 19:30:46 |
|
|
| * 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/include/ca.h,v 1.85 2013/12/20 02:02:24 noro Exp $ |
* $OpenXM: OpenXM_contrib2/asir2000/include/ca.h,v 1.87 2014/08/19 06:35:01 noro Exp $ |
| */ |
*/ |
| #include <stdio.h> |
#include <stdio.h> |
| #include <stdlib.h> |
#include <stdlib.h> |
|
|
| void addgz(GZ n1,GZ n2,GZ *nr); |
void addgz(GZ n1,GZ n2,GZ *nr); |
| void subgz(GZ n1,GZ n2,GZ *nr); |
void subgz(GZ n1,GZ n2,GZ *nr); |
| void mulgz(GZ n1,GZ n2,GZ *nr); |
void mulgz(GZ n1,GZ n2,GZ *nr); |
| |
void mul1gz(GZ n1,int n2,GZ *nr); |
| void divgz(GZ n1,GZ n2,GZ *nq); |
void divgz(GZ n1,GZ n2,GZ *nq); |
| void chsgngz(GZ n,GZ *nr); |
void chsgngz(GZ n,GZ *nr); |
| void pwrgz(GZ n1,Q n,GZ *nr); |
void pwrgz(GZ n1,Q n,GZ *nr); |
| Line 2729 void mkgwc(int k,int l,GZ *t); |
|
| Line 2730 void mkgwc(int k,int l,GZ *t); |
|
| void gz_ptozp(P p,int sgn,GQ *c,P *pr); |
void gz_ptozp(P p,int sgn,GQ *c,P *pr); |
| void gz_lgp(P p,GZ *g,GZ *l); |
void gz_lgp(P p,GZ *g,GZ *l); |
| void gz_qltozl(GQ *w,int n,GZ *dvr); |
void gz_qltozl(GQ *w,int n,GZ *dvr); |
| |
|
| |
void _mdtodp(DP p,DP *pr); |
| |
void add_denomlist(P f); |
| |
void algobjtorat(Obj f,Obj *r); |
| |
void algtodalg(Alg a,DAlg *r); |
| |
void appenduflist(NODE n); |
| |
void arf_add(VL,Obj,Obj,Obj *); |
| |
void arf_chsgn(Obj,Obj *); |
| |
void arf_div(VL,Obj,Obj,Obj *); |
| |
void arf_mul(VL,Obj,Obj,Obj *); |
| |
void arf_sub(VL,Obj,Obj,Obj *); |
| |
void asir_terminate(int); |
| |
void check_intr(); |
| |
void clctalg(P,VL *); |
| |
void comm_muld_trunc(VL vl,DP p1,DP p2,DL dl,DP *pr); |
| |
void comm_quod(VL vl,DP p1,DP p2,DP *pr); |
| |
void create_modorder_spec(int id,LIST shift,struct modorder_spec **s); |
| |
void dalgtoalg(DAlg da,Alg *r); |
| |
void divsgz(GZ n1,GZ n2,GZ *nq); |
| |
void dp_ht(DP p,DP *rp); |
| |
void dp_interreduce(LIST f,LIST v,int field,struct order_spec *ord,LIST *rp); |
| |
void dp_mbase(NODE,NODE *); |
| |
void dp_nf_tab_f(DP p,LIST *tab,DP *rp); |
| |
void dp_ptozp(DP,DP *); |
| |
void dp_sort(DP p,DP *rp); |
| |
void dp_subd(DP,DP,DP *); |
| |
void dp_true_nf(NODE,DP,DP *,int,DP *,P *); |
| |
void dp_true_nf_marked(NODE b,DP g,DP *ps,DP *hps,DP *rp,P *nmp,P *dnp); |
| |
void dp_true_nf_marked_mod(NODE b,DP g,DP *ps,DP *hps,int mod,DP *rp,P *dnp); |
| |
void gbcheck_list(NODE f,int n,VECT *gp,LIST *pp); |
| |
void gcdsf(VL vl,P *pa,int k,P *r); |
| |
void get_algtree(Obj f,VL *r); |
| |
void get_vars(Obj,VL *); |
| |
void gfstopgfs(GFS a,V v,P *c); |
| |
void henmain_incremental(LUM f,LUM *bqlist,ML cqlist, int np, int mod, int start, int bound); |
| |
void iftogfs(int n,GFS *c); |
| |
void indextogfs(int index,GFS *c); |
| |
void init_denomlist(); |
| |
void inva_chrem(P p0,P p,NODE *pr); |
| |
void itogfs(int n,GFS *c); |
| |
void lcmn(N n1,N n2,N *nr); |
| |
void makevar(char *,P *); |
| |
void mdtodp(DP p,DP *pr); |
| |
void mfctrsf(VL vl,P f,DCP *dcp); |
| |
void mulp_trunc(VL vl,P p1,P p2,VN vn,P *pr); |
| |
void nd_det(int mod,MAT f,P *rp); |
| |
void nd_gr(LIST f,LIST v,int m,int homo,int retdp,int f4,struct order_spec *ord,LIST *rp); |
| |
void nd_gr_postproc(LIST f,LIST v,int m,struct order_spec *ord,int do_check,LIST *rp); |
| |
void nd_gr_recompute_trace(LIST f,LIST v,int m,struct order_spec *ord,LIST tlist,LIST *rp); |
| |
void nd_gr_trace(LIST f,LIST v,int trace,int homo,int f4,struct order_spec *ord,LIST *rp); |
| |
void nd_nf_p(Obj f,LIST g,LIST v,int m,struct order_spec *ord,Obj *rp); |
| |
void obj_algtodalg(Obj obj,Obj *r); |
| |
void obj_dalgtoalg(Obj obj,Obj *r); |
| |
void ox_bcast_102(int root); |
| |
void ox_reduce_102(int root,void (*func)()); |
| |
void print_to_wfep(Obj obj); |
| |
void printn(N); |
| |
void printz(Z n); |
| |
void pthrootgfs(GFS a,GFS *b); |
| |
void quop_trunc(VL vl,P p1,P p2,VN vn,P *pr); |
| |
void red_by_vect_sf(int m,unsigned int *p,unsigned int *r,unsigned int hc,int len); |
| |
void removecont_array(P *c,int n,int full); |
| |
void reset_top_weight(); |
| |
void setfield_dalg(NODE alist); |
| |
void setfield_gb(NODE gb,VL vl,struct order_spec *spec); |
| |
void setsecuremode(int value); |
| |
void sfbfctr_shift(P f,V x,V y,int degbound,GFS *evp,P *sfp,DCP *dcp); |
| |
void sfexgcd_by_hensel(BM g,BM h,int dy,BM *ap,BM *bp); |
| |
void sfptopsfp(P f,V v,P *gp); |
| |
void simpdalg(DAlg da,DAlg *r); |
| |
void simple_derivr(VL vl,Obj a,V v,Obj *b); |
| |
void substpp(VL vl,P p,V *vvect,P *svect,int nv,P *pr); |
| |
void ufctrsf(P p,DCP *dcp); |
| |
void vltopl(VL vl,LIST *l); |
| |
|
| |
int arf_comp(VL, Obj, Obj); |
| |
int available_mcindex(int ind); |
| |
int compare_zero(int n,int *u,int row,int **w); |
| |
int create_composite_order_spec(VL vl,LIST order,struct order_spec **specp); |
| |
int create_order_spec(VL,Obj,struct order_spec **); |
| |
int dalgtoup(DAlg da,P *up,Q *dn); |
| |
int dl_equal(int nv,DL dl1,DL dl2); |
| |
int dp_redble(DP,DP); |
| |
int dpv_hp(DPV p); |
| |
int generic_gauss_elim_hensel(MAT mat,MAT *nmmat,Q *dn,int **rindp,int **cindp); |
| |
int generic_gauss_elim_hensel_dalg(MAT mat,DP *mb,MAT *nmmat,Q *dn,int **rindp,int **cindp); |
| |
int generic_gauss_elim_mod(int **mat0,int row,int col,int md,int *colstat); |
| |
int generic_gauss_elim_mod2(int **mat0,int row,int col,int md,int *colstat,int *rowstat); |
| |
int get_field_type(P p); |
| |
int get_ox_server_id(int index); |
| |
int getsecuremode(); |
| |
int gz_generic_gauss_elim(MAT mat,MAT *nm,GZ *dn,int **rindp,int **cindp); |
| |
int gz_generic_gauss_elim_full(MAT mat,MAT *nm,GZ *dn,int **rindp,int **cindp); |
| |
int gz_gensolve_check(MAT mat,MAT nm,GZ dn,int *rind,int *cind); |
| |
int gz_gensolve_check2(MAT mat,MAT nm,GZ *dn,int *rind,int *cind); |
| |
int gz_intmtoratm(MAT mat,GZ md,MAT nm,GZ *dn); |
| |
int gz_intmtoratm2(MAT mat,GZ md,MAT nm,GZ *dn,int *stat); |
| |
int gz_inttorat(GZ c,GZ m,GZ b,int *sgnp,GZ *nmp,GZ *dnp); |
| |
int gz_intvtoratv(GZ *v,int n,GZ md,GZ b,GZ *nm,GZ *dn); |
| |
int invdalg(DAlg a,DAlg *c); |
| |
int is_eq(Obj a0,Obj a1); |
| |
int length(NODE); |
| |
int lu_mod(unsigned int **a,int n,unsigned int md,int **rinfo); |
| |
int n_bits_gz(GZ a); |
| |
int nd_gauss_elim_gz(GZ **mat0,int *sugar,int row,int col,int *colstat); |
| |
int poly_is_dependent(P p,V v); |
| |
int setsecureflag(char *name,int value); |
| |
int sfdegtest(int dy,int bound,UM *d1c,int k,int *in); |
| |
int sgnz(Z n); |