Annotation of OpenXM_contrib2/asir2000/include/ca.h, Revision 1.61
1.4 noro 1: /*
2: * Copyright (c) 1994-2000 FUJITSU LABORATORIES LIMITED
3: * All rights reserved.
4: *
5: * FUJITSU LABORATORIES LIMITED ("FLL") hereby grants you a limited,
6: * non-exclusive and royalty-free license to use, copy, modify and
7: * redistribute, solely for non-commercial and non-profit purposes, the
8: * computer program, "Risa/Asir" ("SOFTWARE"), subject to the terms and
9: * conditions of this Agreement. For the avoidance of doubt, you acquire
10: * only a limited right to use the SOFTWARE hereunder, and FLL or any
11: * third party developer retains all rights, including but not limited to
12: * copyrights, in and to the SOFTWARE.
13: *
14: * (1) FLL does not grant you a license in any way for commercial
15: * purposes. You may use the SOFTWARE only for non-commercial and
16: * non-profit purposes only, such as academic, research and internal
17: * business use.
18: * (2) The SOFTWARE is protected by the Copyright Law of Japan and
19: * international copyright treaties. If you make copies of the SOFTWARE,
20: * with or without modification, as permitted hereunder, you shall affix
21: * to all such copies of the SOFTWARE the above copyright notice.
22: * (3) An explicit reference to this SOFTWARE and its copyright owner
23: * shall be made on your publication or presentation in any form of the
24: * results obtained by use of the SOFTWARE.
25: * (4) In the event that you modify the SOFTWARE, you shall notify FLL by
1.5 noro 26: * e-mail at risa-admin@sec.flab.fujitsu.co.jp of the detailed specification
1.4 noro 27: * for such modification or the source code of the modified part of the
28: * SOFTWARE.
29: *
30: * THE SOFTWARE IS PROVIDED AS IS WITHOUT ANY WARRANTY OF ANY KIND. FLL
31: * MAKES ABSOLUTELY NO WARRANTIES, EXPRESSED, IMPLIED OR STATUTORY, AND
32: * EXPRESSLY DISCLAIMS ANY IMPLIED WARRANTY OF MERCHANTABILITY, FITNESS
33: * FOR A PARTICULAR PURPOSE OR NONINFRINGEMENT OF THIRD PARTIES'
34: * RIGHTS. NO FLL DEALER, AGENT, EMPLOYEES IS AUTHORIZED TO MAKE ANY
35: * MODIFICATIONS, EXTENSIONS, OR ADDITIONS TO THIS WARRANTY.
36: * UNDER NO CIRCUMSTANCES AND UNDER NO LEGAL THEORY, TORT, CONTRACT,
37: * OR OTHERWISE, SHALL FLL BE LIABLE TO YOU OR ANY OTHER PERSON FOR ANY
38: * DIRECT, INDIRECT, SPECIAL, INCIDENTAL, PUNITIVE OR CONSEQUENTIAL
39: * DAMAGES OF ANY CHARACTER, INCLUDING, WITHOUT LIMITATION, DAMAGES
40: * ARISING OUT OF OR RELATING TO THE SOFTWARE OR THIS AGREEMENT, DAMAGES
41: * FOR LOSS OF GOODWILL, WORK STOPPAGE, OR LOSS OF DATA, OR FOR ANY
42: * DAMAGES, EVEN IF FLL SHALL HAVE BEEN INFORMED OF THE POSSIBILITY OF
43: * SUCH DAMAGES, OR FOR ANY CLAIM BY ANY OTHER PARTY. EVEN IF A PART
44: * OF THE SOFTWARE HAS BEEN DEVELOPED BY A THIRD PARTY, THE THIRD PARTY
45: * DEVELOPER SHALL HAVE NO LIABILITY IN CONNECTION WITH THE USE,
46: * PERFORMANCE OR NON-PERFORMANCE OF THE SOFTWARE.
47: *
1.61 ! noro 48: * $OpenXM: OpenXM_contrib2/asir2000/include/ca.h,v 1.60 2005/11/12 08:10:56 noro Exp $
1.4 noro 49: */
1.1 noro 50: #include <stdio.h>
1.36 ohara 51: #include <stdlib.h>
1.1 noro 52:
53: #if defined(hpux)
54: #include <netinet/in.h>
55: # define setbuffer(FP,buf,siz) setvbuf(FP,buf,_IOFBF,siz)
56: #endif
57:
1.36 ohara 58: #if !defined(VISUAL)
59: #include <unistd.h>
1.1 noro 60: #endif
61:
1.28 noro 62: #if !defined(VISUAL)
63: #include <sys/param.h>
64: #endif
65:
1.1 noro 66: #if defined(linux) || (defined(sun) && !defined(SYSV)) || defined(news5000) || (defined(mips) && defined(ultrix))
67: #include <alloca.h>
68: #endif
69:
70: #if (defined(sun) && defined(SYSV))
71: #define alloca(x) __builtin_alloca(x)
72: #endif
73:
74: #if defined(VISUAL)
75: #include <malloc.h>
76: #endif
77:
78: #if 0
79: #include <sys/types.h>
80: typedef caddr_t pointer;
81: #endif
82:
83: typedef void * pointer;
84:
1.36 ohara 85: #if defined(sun)
86: #include <strings.h>
87: #else
88: #include <string.h>
1.1 noro 89: #if defined(VISUAL)
90: #define index(s,c) strchr(s,c)
91: #define bzero(s,len) memset(s,0,len)
92: #define bcopy(x,y,len) memcpy(y,x,len)
1.36 ohara 93: #endif
1.1 noro 94: #endif
95:
96: #define COPY(a,b) ((b)=(a))
97: #define FREEN(p)
98: #define FREEQ(p)
99: #define FREE(p)
100: #define INITRC(p)
101:
102: /* data structures */
103:
104: #define O_N 1
105: #define O_P 2
106: #define O_R 3
107: #define O_LIST 4
108: #define O_VECT 5
109: #define O_MAT 6
110: #define O_STR 7
111: #define O_COMP 8
112: #define O_DP 9
113: #define O_USINT 10
114: #define O_ERR 11
115: #define O_GF2MAT 12
116: #define O_MATHCAP 13
117: #define O_F 14
118: #define O_GFMMAT 15
1.6 noro 119: #define O_BYTEARRAY 16
1.13 noro 120: #define O_QUOTE 17
1.39 noro 121: #define O_OPTLIST 18
1.43 noro 122: #define O_SYMBOL 19
1.45 noro 123: #define O_RANGE 20
1.46 noro 124: #define O_TB 21
1.49 noro 125: #define O_DPV 22
1.50 noro 126: #define O_QUOTEARG 23
1.1 noro 127: #define O_VOID -1
1.55 saito 128: /* IMAT */
129: #define O_IMAT 24
130: /* IMAT */
1.61 ! noro 131: #define O_NBP 25
1.1 noro 132:
133: #define N_Q 0
134: #define N_R 1
135: #define N_A 2
136: #define N_B 3
137: #define N_C 4
138: #define N_M 5
139: #define N_LM 6
140: #define N_GF2N 7
141: #define N_GFPN 8
1.12 noro 142: #define N_GFS 9
1.21 noro 143: #define N_GFSN 10
1.53 noro 144: #define N_DA 11
1.1 noro 145:
146: #define ORD_REVGRADLEX 0
147: #define ORD_GRADLEX 1
148: #define ORD_LEX 2
149:
1.50 noro 150: typedef enum {
151: A_end=0,A_fnode,A_arf,A_int,A_str,A_internal,A_node,A_notimpl,A_func
152: } farg_type;
153:
1.35 ohara 154: #if defined(LONG_IS_32BIT)
1.1 noro 155: #if defined(VISUAL)
156: typedef _int64 L;
157: typedef unsigned _int64 UL;
158: #else
159: typedef long long L;
160: typedef unsigned long long UL;
161: #endif
162: #else
163: typedef long L;
164: typedef unsigned long UL;
165: #endif
166:
167: typedef struct oN {
168: int p;
169: unsigned int b[1];
170: } *N;
171:
1.52 noro 172: typedef struct oZ {
173: int p;
174: unsigned int b[1];
175: } *Z;
176:
1.1 noro 177: typedef struct oUP2 {
178: int w;
179: unsigned int b[1];
180: } *UP2;
181:
182: typedef struct _oUP2 {
183: int w;
184: unsigned int *b;
185: } *_UP2;
186:
187: #define UP2_DENSE 0
188: #define UP2_SPARSE 1
189:
190: typedef struct oGEN_UP2 {
191: int id;
192: UP2 dense;
193: UP2 sparse;
194: } *GEN_UP2;
195:
196: typedef struct oV {
197: char *name;
198: pointer attr;
199: pointer priv;
200: } *V;
201:
202: typedef struct oQ {
203: short id;
204: char nid;
205: char sgn;
206: N nm;
207: N dn;
208: } *Q;
209:
210: typedef struct oReal {
211: short id;
212: char nid;
213: char pad;
214: double body;
215: } *Real;
216:
217: typedef struct oAlg {
218: short id;
219: char nid;
220: char pad;
221: struct oObj *body;
222: } *Alg;
223:
224: typedef struct oBF {
225: short id;
226: char nid;
227: char pad;
228: long body[1];
229: } *BF;
230:
231: typedef struct oC {
232: short id;
233: char nid;
234: char pad;
235: struct oNum *r,*i;
236: } *C;
237:
238: typedef struct oLM {
239: short id;
240: char nid;
241: char pad;
242: struct oN *body;
243: } *LM;
244:
245: typedef struct oGF2N {
246: short id;
247: char nid;
248: char pad;
249: struct oUP2 *body;
250: } *GF2N;
251:
252: typedef struct oGFPN {
253: short id;
254: char nid;
255: char pad;
256: struct oUP *body;
257: } *GFPN;
258:
1.53 noro 259: typedef struct oDAlg {
260: short id;
261: char nid;
262: char pad;
263: struct oDP *nm;
264: struct oQ *dn;
265: } *DAlg;
266:
267:
1.1 noro 268: typedef struct oNum {
269: short id;
270: char nid;
271: char pad;
272: } *Num;
273:
274: typedef struct oMQ {
275: short id;
276: char nid;
277: char pad;
278: int cont;
279: } *MQ;
280:
1.12 noro 281: typedef struct oGFS {
282: short id;
283: char nid;
284: char pad;
285: int cont;
286: } *GFS;
287:
1.21 noro 288: typedef struct oGFSN {
1.20 noro 289: short id;
290: char nid;
291: char pad;
292: struct oUM *body;
1.21 noro 293: } *GFSN;
1.12 noro 294:
1.1 noro 295: typedef struct oP {
296: short id;
297: short pad;
298: V v;
299: struct oDCP *dc;
300: } *P;
301:
302: typedef struct oR {
303: short id;
304: short reduced;
305: P nm;
306: P dn;
307: } *R;
308:
309: typedef struct oVECT {
310: short id;
311: short pad;
312: int len;
313: pointer *body;
314: } *VECT;
315:
316: typedef struct oMAT {
317: short id;
318: short pad;
319: int row,col;
320: pointer **body;
321: } *MAT;
322:
323: typedef struct oGF2MAT {
324: short id;
325: short pad;
326: int row,col;
327: unsigned int **body;
328: } *GF2MAT, *GFMMAT;
329:
1.55 saito 330: /* IMAT */
331: #define IMATCH 64
332:
333: typedef struct oIENT {
334: int cr;
335: int row, col;
336: pointer *body;
337: } IENT;
338:
339: typedef struct oIMATC {
340: pointer *fore;
341: pointer *next;
342: IENT ient[IMATCH];
343: } *IMATC;
344:
345: typedef struct oIMAT {
346: short id;
347: int row, col, clen;
348: pointer *root;
349: pointer *toor;
350: } *IMAT;
351: /* IMAT */
1.1 noro 352: typedef struct oLIST {
353: short id;
354: short pad;
355: struct oNODE *body;
356: } *LIST;
357:
358: typedef struct oSTRING {
359: short id;
360: short pad;
361: char *body;
362: } *STRING;
363:
364: typedef struct oCOMP {
365: short id;
366: short type;
367: struct oObj *member[1];
368: } *COMP;
369:
370: typedef struct oDP {
371: short id;
372: short nv;
373: int sugar;
374: struct oMP *body;
375: } *DP;
376:
1.49 noro 377: typedef struct oDPV {
378: short id;
379: int len;
380: int sugar;
381: struct oDP **body;
382: } *DPV;
383:
1.1 noro 384: typedef struct oUSINT {
385: short id;
386: short pad;
387: unsigned body;
388: } *USINT;
389:
390: typedef struct oERR {
391: short id;
392: short pad;
393: struct oObj *body;
394: } *ERR;
395:
396: typedef struct oMATHCAP {
397: short id;
398: short pad;
399: struct oLIST *body;
400: } *MATHCAP;
401:
1.6 noro 402: typedef struct oBYTEARRAY {
403: short id;
404: short pad;
405: int len;
406: unsigned char *body;
407: } *BYTEARRAY;
408:
1.13 noro 409: typedef struct oQUOTE {
410: short id;
1.59 noro 411: short pad;
1.13 noro 412: pointer body;
413: } *QUOTE;
414:
1.50 noro 415: typedef struct oQUOTEARG {
416: short id;
417: short pad;
418: farg_type type;
419: pointer body;
420: } *QUOTEARG;
421:
1.39 noro 422: typedef struct oOPTLIST {
423: short id;
424: short pad;
425: struct oNODE *body;
426: } *OPTLIST;
427:
1.45 noro 428: typedef struct oSYMBOL {
1.43 noro 429: short id;
430: short pad;
431: char *name;
432: int value;
1.45 noro 433: } *SYMBOL;
434:
435: typedef struct oRANGE {
436: short id;
437: short pad;
438: struct oObj *start,*end;
439: } *RANGE;
440:
1.46 noro 441: typedef struct oTB {
442: short id;
443: short pad;
444: int size,next;
445: char **body;
446: } *TB;
1.43 noro 447:
1.61 ! noro 448: typedef struct oNBP {
! 449: short id;
! 450: short pad;
! 451: struct oNODE *body;
! 452: } *NBP;
! 453:
! 454: /* non-commutative bivariate monomial */
! 455:
! 456: typedef struct oNBM {
! 457: int d;
! 458: Q c;
! 459: unsigned int *b;
! 460: } *NBM;
! 461:
! 462: #define NEWNBM(p) ((p)=(NBM)MALLOC(sizeof(struct oNBM)))
! 463: #define NEWNBMBDY(p,d) \
! 464: ((p)->b=(unsigned int *)MALLOC((((d)+31)/32)*sizeof(unsigned int)))
! 465: #define NEWNBP(p) ((p)=(NBP)MALLOC(sizeof(struct oNBP)),OID(p)=O_NBP)
! 466: #define MKNBP(p,b) (NEWNBP(p),BDY(p)=(b))
! 467:
! 468: #define NBM_GET(a,j) (((a)[(j)>>5]&(1<<((j)&31)))?1:0)
! 469: #define NBM_SET(a,j) ((a)[(j)>>5]|=(1<<((j)&31)))
! 470: #define NBM_CLR(a,j) ((a)[(j)>>5]&=(~(1<<((j)&31))))
! 471:
1.1 noro 472: typedef struct oObj {
473: short id;
474: short pad;
475: } *Obj;
476:
477: typedef struct oDCP {
478: Q d;
479: P c;
480: struct oDCP *next;
481: } *DCP;
482:
483: typedef struct oMP {
484: struct oDL *dl;
485: P c;
486: struct oMP *next;
487: } *MP;
488:
489: typedef struct oDL {
490: int td;
491: int d[1];
492: } *DL;
1.23 noro 493:
1.29 noro 494: struct dp_pairs {
495: int dp1, dp2;
496: DL lcm;
497: int sugar;
498: struct dp_pairs *next;
499: };
500:
501: typedef struct dp_pairs *DP_pairs;
502:
503: struct p_pair {
504: struct oUM *p0;
505: struct oUM *p1;
506: struct p_pair *next;
507: };
508:
509: struct oMF {
510: int m;
511: P f;
512: };
513:
1.23 noro 514: /*
515: * compressed DP
516: */
517:
518: typedef struct oCDP {
519: int len;
1.26 noro 520: int psindex;
1.27 noro 521: unsigned int *body;
1.23 noro 522: } *CDP;
523:
1.24 noro 524: typedef struct oCM {
1.23 noro 525: int index;
526: int c;
1.24 noro 527: } *CM;
1.1 noro 528:
1.25 noro 529: /* bucket list for DL */
530:
531: typedef struct oDLBUCKET {
532: int td;
533: struct oNODE *body;
534: struct oDLBUCKET *next;
535: } *DLBUCKET;
1.37 noro 536:
537: typedef struct oGeoBucket {
538: int m;
539: struct oNODE *body[32];
540: } *GeoBucket;
1.25 noro 541:
1.1 noro 542: typedef struct oVL {
543: V v;
544: struct oVL *next;
545: } *VL;
546:
547: typedef struct oNODE {
548: pointer body;
549: struct oNODE *next;
550: } *NODE;
551:
1.16 noro 552: /* univariate poly over small finite field; dense */
1.1 noro 553: typedef struct oUM {
554: int d;
555: int c[1];
556: } *UM;
557:
1.16 noro 558: /* univariate poly with padic coeff */
1.1 noro 559: typedef struct oLUM {
560: int d;
561: int *c[1];
562: } *LUM;
563:
1.16 noro 564: /* bivariate poly over small finite field; dense */
565:
566: typedef struct oBM {
567: int d;
568: UM c[1];
569: } *BM;
570:
1.1 noro 571: typedef struct oML {
572: int n;
573: int mod;
574: int bound;
575: pointer c[1];
576: } *ML;
577:
578: typedef struct oUB {
579: int d;
580: N c[1];
581: } *UB;
582:
583: typedef struct oVN {
584: V v;
585: int n;
586: } *VN;
587:
588: typedef struct oUP {
589: int d;
590: Num c[1];
591: } *UP;
592:
593: typedef struct oDUM {
594: int n;
595: UM f;
596: } *DUM;
597:
598: struct order_pair {
599: int order, length;
600: };
601:
1.42 noro 602: struct sparse_weight {
603: int pos, value;
604: };
605:
606: #define IS_DENSE_WEIGHT 0
607: #define IS_SPARSE_WEIGHT 1
608: #define IS_BLOCK 2
609:
610: struct weight_or_block {
611: int type;
612: int length;
613: union {
614: int *dense_weight;
615: struct sparse_weight *sparse_weight;
616: struct {
617: int order, start;
618: } block;
619: } body;
620: };
621:
1.1 noro 622: struct order_spec {
623: int id;
624: Obj obj;
625: int nv;
626: union {
627: int simple;
628: struct {
629: int length;
630: struct order_pair *order_pair;
631: } block;
632: struct {
633: int row;
634: int **matrix;
635: } matrix;
1.42 noro 636: struct {
637: int length;
638: struct weight_or_block *w_or_b;
639: } composite;
1.1 noro 640: } ord;
641: };
642:
1.49 noro 643: struct modorder_spec {
644: /* id : ORD_REVGRADLEX, ORD_GRADLEX, ORD_LEX */
645: int id;
646: Obj obj;
647: int len;
648: int *degree_shift;
649: };
650:
1.53 noro 651: typedef struct oNumberField {
652: int n;
1.57 noro 653: int psn;
1.53 noro 654: int dim;
655: VL vl;
656: P *defpoly;
657: DP *mb;
658: DP *ps;
659: struct oDAlg *one;
660: NODE ind;
661: struct order_spec *spec;
662: } *NumberField;
663:
1.1 noro 664: /* structure for cputime */
665:
666: struct oEGT {
667: double exectime,gctime;
668: };
669:
670: /* constant */
671:
672: /* ground finite field specification */
673: #define FF_NOT_SET 0
674: #define FF_GFP 1
675: #define FF_GF2N 2
676: #define FF_GFPN 3
1.12 noro 677: #define FF_GFS 4
1.21 noro 678: #define FF_GFSN 5
1.11 saito 679:
680: /* include interval.h */
681: #include "interval.h"
1.1 noro 682:
683: #define INDEX 100
684:
1.35 ohara 685: #if defined(USE_FLOAT)
1.1 noro 686: typedef float ModNum;
687: #define NPrimes 536
688: #else
689: typedef unsigned int ModNum;
690: #define NPrimes 13681
691: #endif
692:
693: /* general macros */
1.28 noro 694: #if defined(MAX)
695: #undef MAX
696: #endif
697: #if defined(MIN)
698: #undef MIN
699: #endif
1.1 noro 700: #define MAX(a,b) ((a) > (b) ? (a) : (b) )
701: #define MIN(a,b) ((a) > (b) ? (b) : (a) )
702: #ifdef ABS
703: #undef ABS
704: #endif
705: #define ABS(a) ((a)>0?(a):-(a))
706: #define ID(p) ((p)->id)
707: #define OID(p) (((Obj)(p))->id)
708: #define NID(p) (((Num)(p))->nid)
709: #define BDY(p) ((p)->body)
710: #define VR(p) ((p)->v)
711: #define NAME(p) ((p)->name)
712: #define NEXT(p) ((p)->next)
713: #define NM(q) ((q)->nm)
714: #define DN(q) ((q)->dn)
715: #define SGN(q) ((q)->sgn)
716: #define DC(p) ((p)->dc)
717: #define COEF(p) ((p)->c)
718: #define DEG(p) ((p)->d)
719: #define PL(n) ((n)->p)
720: #define BD(n) ((n)->b)
721: #define CONT(a) ((a)->cont)
722: #define UDEG(f) BD(NM(DEG(DC(f))))[0]
723: #define UCOEF(f) (COEF(DC(f)))
724: #define LC(f) (NUM(f)?(f):COEF(DC(f)))
725:
726: /* memory allocators (W_... : uses alloca) */
727:
728: #if 0
729: #define MALLOC(d) Risa_GC_malloc(d)
730: #define MALLOC_ATOMIC(d) Risa_GC_malloc_atomic(d)
731: #define REALLOC(p,d) Risa_GC_realloc(p,d)
732: #else
733: #define MALLOC(d) GC_malloc(d)
734: #define MALLOC_ATOMIC(d) GC_malloc_atomic(d)
735: #define REALLOC(p,d) GC_realloc(p,d)
736: #endif
737: #define CALLOC(d,e) MALLOC((d)*(e))
738:
1.32 noro 739: #if !defined(__CYGWIN__) && (defined(__GNUC__) || defined(vax) || defined(apollo) || defined(alloca) || defined(VISUAL))
1.1 noro 740: #define ALLOCA(d) alloca(d)
741: #else
742: #define ALLOCA(d) MALLOC(d)
1.32 noro 743: #endif
744:
745: /* for setjmp/longjmp compatibility */
1.40 noro 746: #if defined(__CYGWIN__) || defined(__x86_64)
1.32 noro 747: #define JMP_BUF sigjmp_buf
748: #define SETJMP(x) sigsetjmp(x,~0)
749: #define LONGJMP(x,y) siglongjmp(x,y)
750: #else
751: #define JMP_BUF jmp_buf
752: #define SETJMP(x) setjmp(x)
753: #define LONGJMP(x,y) longjmp(x,y)
1.1 noro 754: #endif
755:
756: #define TRUESIZE(type,n,atype) (sizeof(struct type)+MAX((n),0)*sizeof(atype))
757: #define NALLOC(d) ((N)MALLOC_ATOMIC(TRUESIZE(oN,(d)-1,int)))
758: #define UMALLOC(d) ((UM)MALLOC(TRUESIZE(oUM,d,int)))
759: #define UPALLOC(d) ((UP)MALLOC(TRUESIZE(oUP,(d),Num)))
760: #define C_UMALLOC(d) ((UM)MALLOC(TRUESIZE(oUM,d,int)))
761: #define MLALLOC(d) ((ML)MALLOC(TRUESIZE(oML,d,pointer)))
762:
763: #define W_ALLOC(d) ((int *)ALLOCA(((d)+1)*sizeof(int)))
764: #define W_CALLOC(n,type,p) \
765: ((p)=(type *)ALLOCA(((n)+1)*sizeof(type)),\
766: bzero((char *)(p),(int)(((n)+1)*sizeof(type))))
767: #define W_UMALLOC(d) ((UM)ALLOCA(TRUESIZE(oUM,d,int)))
768: #define W_UPALLOC(d) ((UP)ALLOCA(TRUESIZE(oUP,(d),Num)))
769: #define W_MLALLOC(d) ((ML)ALLOCA(TRUESIZE(oML,d,pointer)))
770: #define W_LUMALLOC(n,bound,p)\
771: {\
772: LUM ___q___;\
773: int ___i___,**___c___;\
774: (___q___) = (LUM)ALLOCA(TRUESIZE(oLUM,(n),int *));\
775: DEG(___q___) = n;\
776: for ( ___i___ = 0, ___c___ = (int **)COEF(___q___); ___i___ <= n; ___i___++ ) {\
777: ___c___[___i___] = (int *)ALLOCA(((bound)+1)*sizeof(int));\
778: bzero((char *)___c___[___i___],((bound)+1)*sizeof(int));\
779: }\
780: (p) = ___q___;\
781: }
782:
1.18 noro 783: #define W_BMALLOC(dx,dy,p)\
1.16 noro 784: {\
785: BM ___q___;\
786: int ___i___;\
787: UM *___c___;\
1.18 noro 788: (___q___) = (BM)ALLOCA(TRUESIZE(oBM,(dy),UM));\
789: DEG(___q___) = dy;\
1.16 noro 790: ___c___ = (UM *)COEF(___q___);\
1.18 noro 791: for ( ___i___ = 0; ___i___ <= dy; ___i___++ ) {\
792: ___c___[___i___] = W_UMALLOC(dx);\
793: clearum(___c___[___i___],dx);\
1.16 noro 794: }\
795: (p) = ___q___;\
796: }
797:
1.1 noro 798: #define NEWUP2(q,w)\
799: ((q)=(UP2)MALLOC_ATOMIC(TRUESIZE(oUP2,(w)-1,unsigned int)),\
800: bzero((char *)(q)->b,(w)*sizeof(unsigned int)))
801: #define W_NEWUP2(q,w)\
802: ((q)=(UP2)ALLOCA(TRUESIZE(oUP2,(w)-1,unsigned int)),\
803: bzero((char *)(q)->b,(w)*sizeof(unsigned int)))
804: #define W_NEW_UP2(q,w)\
805: ((q).b=(unsigned int *)ALLOCA((w)*sizeof(unsigned int)))
806:
807: /* cell allocators */
808: #define NEWQ(q) ((q)=(Q)MALLOC(sizeof(struct oQ)),OID(q)=O_N,NID(q)=N_Q)
809: #define NEWMQ(q) ((q)=(MQ)MALLOC_ATOMIC(sizeof(struct oMQ)),OID(q)=O_N,NID(q)=N_M)
1.12 noro 810: #define NEWGFS(q) ((q)=(GFS)MALLOC_ATOMIC(sizeof(struct oGFS)),OID(q)=O_N,NID(q)=N_GFS)
1.21 noro 811: #define NEWGFSN(q) ((q)=(GFSN)MALLOC(sizeof(struct oGFSN)),OID(q)=O_N,NID(q)=N_GFSN)
1.1 noro 812: #define NEWP(p) ((p)=(P)MALLOC(sizeof(struct oP)),OID(p)=O_P)
813: #define NEWR(r) ((r)=(R)MALLOC(sizeof(struct oR)),OID(r)=O_R,(r)->reduced=0)
814: #define NEWLIST(l) ((l)=(LIST)MALLOC(sizeof(struct oLIST)),OID(l)=O_LIST)
815: #define NEWVECT(l) ((l)=(VECT)MALLOC(sizeof(struct oVECT)),OID(l)=O_VECT)
816: #define NEWSTR(l) ((l)=(STRING)MALLOC(sizeof(struct oSTRING)),OID(l)=O_STR)
817: #define NEWCOMP(c,n) ((c)=(COMP)MALLOC(sizeof(struct oCOMP)+((n)-1)*sizeof(Obj)),OID(c)=O_COMP)
818: #define NEWDP(d) ((d)=(DP)MALLOC(sizeof(struct oDP)),OID(d)=O_DP)
1.49 noro 819: #define NEWDPV(d) ((d)=(DPV)MALLOC(sizeof(struct oDPV)),OID(d)=O_DPV)
1.1 noro 820: #define NEWUSINT(u) ((u)=(USINT)MALLOC_ATOMIC(sizeof(struct oUSINT)),OID(u)=O_USINT)
821: #define NEWERR(e) ((e)=(ERR)MALLOC(sizeof(struct oERR)),OID(e)=O_ERR)
822: #define NEWMATHCAP(e) ((e)=(MATHCAP)MALLOC(sizeof(struct oMATHCAP)),OID(e)=O_MATHCAP)
1.6 noro 823: #define NEWBYTEARRAY(e) ((e)=(BYTEARRAY)MALLOC(sizeof(struct oBYTEARRAY)),OID(e)=O_BYTEARRAY)
1.13 noro 824: #define NEWQUOTE(e) ((e)=(QUOTE)MALLOC(sizeof(struct oQUOTE)),OID(e)=O_QUOTE)
1.50 noro 825: #define NEWQUOTEARG(e) ((e)=(QUOTEARG)MALLOC(sizeof(struct oQUOTEARG)),OID(e)=O_QUOTEARG)
1.39 noro 826: #define NEWOPTLIST(l) ((l)=(OPTLIST)MALLOC(sizeof(struct oOPTLIST)),OID(l)=O_OPTLIST)
1.43 noro 827: #define NEWSYMBOL(l) ((l)=(SYMBOL)MALLOC(sizeof(struct oSYMBOL)),OID(l)=O_SYMBOL)
1.45 noro 828: #define NEWRANGE(l) ((l)=(RANGE)MALLOC(sizeof(struct oRANGE)),OID(l)=O_RANGE)
1.46 noro 829: #define NEWTB(l) ((l)=(TB)MALLOC(sizeof(struct oTB)),OID(l)=O_TB,(l)->size=256,(l)->next=0,(l)->body=(char **)MALLOC((l)->size*sizeof(char *)))
1.1 noro 830:
831: #define NEWNODE(a) ((a)=(NODE)MALLOC(sizeof(struct oNODE)))
832: #define NEWDC(dc) ((dc)=(DCP)MALLOC(sizeof(struct oDCP)))
833: #define NEWV(v) ((v)=(V)MALLOC(sizeof(struct oV)))
834: #define NEWVL(vl) ((vl)=(VL)MALLOC(sizeof(struct oVL)))
835: #define NEWMP(m) ((m)=(MP)MALLOC(sizeof(struct oMP)))
1.25 noro 836: #define NEWDLBUCKET(a) ((a)=(DLBUCKET)MALLOC(sizeof(struct oDLBUCKET)))
1.29 noro 837: #define NEWDPP(a) ((a)=(DP_pairs)MALLOC(sizeof(struct dp_pairs)))
1.1 noro 838:
839: #define NEWMAT(l) ((l)=(MAT)MALLOC(sizeof(struct oMAT)),OID(l)=O_MAT)
840: #define NEWGF2MAT(l) ((l)=(GF2MAT)MALLOC(sizeof(struct oGF2MAT)),OID(l)=O_GF2MAT)
841: #define NEWGFMMAT(l) ((l)=(GFMMAT)MALLOC(sizeof(struct oGF2MAT)),OID(l)=O_GFMMAT)
1.55 saito 842: /* IMAT */
843: #define NEWIMAT(l) ((l)=(IMAT)MALLOC(sizeof(struct oIMAT)),OID(l)=O_IMAT,l->clen=0,l->root=0,l->toor=0)
844: #define NEWIENT(l) ((l)=(IMATC)MALLOC(sizeof(struct oIMATC)),l->fore=0,l->next=0)
845: /* IMAT */
1.1 noro 846: #define NEWReal(q) ((q)=(Real)MALLOC_ATOMIC(sizeof(struct oReal)),OID(q)=O_N,NID(q)=N_R)
847: #define NEWAlg(r) ((r)=(Alg)MALLOC(sizeof(struct oAlg)),OID(r)=O_N,NID(r)=N_A)
1.53 noro 848: #define NEWDAlg(r) ((r)=(DAlg)MALLOC(sizeof(struct oDAlg)),OID(r)=O_N,NID(r)=N_DA)
1.1 noro 849: #define NEWBF(q,l) ((q)=(BF)MALLOC_ATOMIC(TRUESIZE(oBF,(l)-1,long)),OID(q)=O_N,NID(q)=N_B)
850: #define NEWC(r) ((r)=(C)MALLOC(sizeof(struct oC)),OID(r)=O_N,NID(r)=N_C)
851: #define NEWLM(r) ((r)=(LM)MALLOC(sizeof(struct oLM)),OID(r)=O_N,NID(r)=N_LM)
852: #define NEWGF2N(r) ((r)=(GF2N)MALLOC(sizeof(struct oGF2N)),OID(r)=O_N,NID(r)=N_GF2N)
853: #define NEWGFPN(r) ((r)=(GFPN)MALLOC(sizeof(struct oGFPN)),OID(r)=O_N,NID(r)=N_GFPN)
854: #define NEWDL(d,n) \
855: ((d)=(DL)MALLOC_ATOMIC(TRUESIZE(oDL,(n)-1,int)),bzero((char *)(d),TRUESIZE(oDL,(n)-1,int)))
1.9 noro 856: #define NEWDL_NOINIT(d,n) \
857: ((d)=(DL)MALLOC_ATOMIC(TRUESIZE(oDL,(n)-1,int)))
1.1 noro 858:
859: #define MKP(v,dc,p) \
1.51 noro 860: ((!DEG(dc)&&!NEXT(dc))?((p)=COEF(dc)):(NEWP(p),VR(p)=(v),DC(p)=(dc),(p)))
1.1 noro 861: #define MKV(v,p) \
862: (NEWP(p),VR(p)=(v),NEWDC(DC(p)),\
863: DEG(DC(p))=ONE,COEF(DC(p))=(P)ONE,NEXT(DC(p))=0)
864: #define MKRAT(n,d,r,p) \
865: (NEWR(p),NM(p)=(n),DN(p)=(d),(p)->reduced=(r))
866: #define MKMV(v,p) \
867: (NEWP(p),VR(p)=(v),NEWDC(DC(p)),\
868: DEG(DC(p))=ONE,COEF(DC(p))=(P)ONEM,NEXT(DC(p))=0)
869: #define MKNODE(a,b,c) \
870: (NEWNODE(a),(a)->body=(pointer)b,NEXT(a)=(NODE)(c))
871: #define MKLIST(a,b) (NEWLIST(a),(a)->body=(NODE)(b))
872: #define MKVECT(m,l) \
873: (NEWVECT(m),(m)->len=(l),(m)->body=(pointer *)CALLOC((l),sizeof(pointer)))
874: #define MKMAT(m,r,c) \
875: (NEWMAT(m),(m)->row=(r),(m)->col=(c),(m)->body=(pointer **)almat_pointer((r),(c)))
876: #define TOGF2MAT(r,c,b,m) (NEWGF2MAT(m),(m)->row=(r),(m)->col=(c),(m)->body=(b))
877: #define TOGFMMAT(r,c,b,m) (NEWGFMMAT(m),(m)->row=(r),(m)->col=(c),(m)->body=(b))
878: #define MKSTR(a,b) (NEWSTR(a),(a)->body=(char *)(b))
879: #define MKDP(n,m,d) (NEWDP(d),(d)->nv=(n),BDY(d)=(m))
1.49 noro 880: #define MKDPV(len,m,d) (NEWDPV(d),(d)->len=(len),BDY(d)=(m))
1.1 noro 881: #define MKLM(b,l) (!(b)?(l)=0:(NEWLM(l),(l)->body=(b),(l)))
882: #define MKGF2N(b,l) (!(b)?(l)=0:(NEWGF2N(l),(l)->body=(b),(l)))
883: #define MKGFPN(b,l) (!(b)?(l)=0:(NEWGFPN(l),(l)->body=(b),(l)))
884: #define MKUSINT(u,b) (NEWUSINT(u),(u)->body=(unsigned)(b))
885: #define MKERR(e,b) (NEWERR(e),(e)->body=(Obj)(b))
886: #define MKMATHCAP(e,b) (NEWMATHCAP(e),(e)->body=(LIST)(b))
1.6 noro 887: #define MKBYTEARRAY(m,l) \
888: (NEWBYTEARRAY(m),(m)->len=(l),(m)->body=(char *)MALLOC_ATOMIC((l)),bzero((m)->body,(l)))
1.48 noro 889: #define MKQUOTE(q,b) (NEWQUOTE(q),(q)->body=(pointer)(b))
1.50 noro 890: #define MKQUOTEARG(q,t,b) (NEWQUOTEARG(q),(q)->type=(t),(q)->body=(pointer)(b))
1.1 noro 891:
892: #define NEXTDC(r,c) \
893: if(!(r)){NEWDC(r);(c)=(r);}else{NEWDC(NEXT(c));(c)=NEXT(c);}
894: #define NEXTNODE(r,c) \
895: if(!(r)){NEWNODE(r);(c)=(r);}else{NEWNODE(NEXT(c));(c)=NEXT(c);}
896: #define NEXTMP(r,c) \
897: if(!(r)){NEWMP(r);(c)=(r);}else{NEWMP(NEXT(c));(c)=NEXT(c);}
1.9 noro 898: #define NEXTMP2(r,c,s) \
899: if(!(r)){(c)=(r)=(s);}else{NEXT(c)=(s);(c)=(s);}
1.25 noro 900: #define NEXTDLBUCKET(r,c) \
901: if(!(r)){NEWDLBUCKET(r);(c)=(r);}else{NEWDLBUCKET(NEXT(c));(c)=NEXT(c);}
1.29 noro 902: #define NEXTVL(r,c) \
903: if(!(r)){NEWVL(r);(c)=(r);}else{NEWVL(NEXT(c));(c)=NEXT(c);}
904: #define NEXTDPP(r,c) \
905: if(!(r)){NEWDPP(r);(c)=(r);}else{NEWDPP(NEXT(c));(c)=NEXT(c);}
1.1 noro 906:
907: /* convertors */
908: #define NTOQ(n,s,q) \
909: (!(n)?((q)=0):(NEWQ(q),SGN(q)=(s),NM(q)=(n),DN(q)=0,(q)))
910: #define NDTOQ(n,d,s,q) \
911: ((!(d)||UNIN(d))?NTOQ(n,s,q):(NEWQ(q),SGN(q)=(s),NM(q)=(n),DN(q)=(d),(q)))
912: #define DUPQ(p,q) \
913: (NEWQ(q),SGN(q)=SGN(p),NM(q)=NM(p),DN(q)=DN(p))
914: #define STOQ(n,q) \
915: ((!(n))?((q)=(Q)NULL):(NEWQ(q),\
916: SGN(q)=((n)>0?1:-1),NM(q)=NALLOC(1),\
917: PL(NM(q))=1,BD(NM(q))[0]=ABS(n),DN(q)=0,(q)))
918: #define UTOMQ(a,b) \
919: ((a)?(NEWMQ(b),CONT(b)=(unsigned int)(a),(b)):((b)=0))
1.12 noro 920: #define MKGFS(a,b) \
921: ((NEWGFS(b),CONT(b)=(a),(b)))
1.21 noro 922: #define MKGFSN(a,b) \
923: ((DEG(a)>=0)?(NEWGFSN(b),BDY(b)=(a),(b)):((b)=0))
1.1 noro 924: #define STOMQ(a,b) \
925: ((a)?(NEWMQ(b),CONT(b)=(a),(b)):((b)=0))
926: #define UTON(u,n) \
927: ((!(u))?((n)=(N)NULL):((n)=NALLOC(1),PL(n)=1,BD(n)[0]=(unsigned int)(u),(n)))
928: #define UTOQ(n,q) \
929: ((!(n))?((q)=(Q)NULL):(NEWQ(q),\
930: SGN(q)=1,NM(q)=NALLOC(1),\
931: PL(NM(q))=1,BD(NM(q))[0]=(unsigned int)(n),DN(q)=0,(q)))
932: #define QTOS(q) (!(q)?0:SGN(q)*((int)BD(NM(q))[0]))
933: #define STON(i,n)\
934: (i?((n)=NALLOC(1),PL(n)=1,BD(n)[0]=(i),(n)):((n)=(N)0))
935: #define PTOR(a,b) \
936: (!(a)?((b)=0):(NEWR(b),NM(b)=(a),DN(b)=(P)ONE,(b)->reduced=1,(b)))
937: #define RTOS(a) (!(a)?0:QTOS((Q)NM((R)a)))
938: #define MKReal(a,b) (!(a)?((b)=0):(NEWReal(b),BDY(b)=(a),(b)))
939: #define MKAlg(b,r) \
940: (!(b)?((r)=0):NUM(b)?((r)=(Alg)(b)):(NEWAlg(r),BDY(r)=(Obj)(b),(r)))
1.53 noro 941: #define MKDAlg(dp,den,r) (NEWDAlg(r),(r)->nm = (dp),(r)->dn=(den))
1.1 noro 942:
1.52 noro 943: #define IMM_MAX 1073741823
944: #define IMM_MIN -1073741823
945:
946: #define SL(n) ((n)->p)
947: #define ZALLOC(d) ((Z)MALLOC_ATOMIC(TRUESIZE(oZ,(d)-1,int)))
948:
1.35 ohara 949: #if defined(PARI)
1.3 noro 950: #define ToReal(a) (!(a)?(double)0.0:REAL(a)?BDY((Real)a):RATN(a)?RatnToReal((Q)a):BIGFLOAT(a)?rtodbl(BDY((BF)a)):0)
951: #else
952: #define ToReal(a) (!(a)?(double)0.0:REAL(a)?BDY((Real)a):RATN(a)?RatnToReal((Q)a):0.0)
953: #endif
1.1 noro 954:
955: /* predicates */
956: #define NUM(p) (OID(p)==O_N)
957: #define RAT(p) (OID(p)==O_R)
958: #define RATN(a) (NID(a)==N_Q)
1.22 noro 959: #define INT(q) (!(q)||(NUM(q)&&RATN((Num)q)&&!DN((Q)q)))
1.1 noro 960: #define REAL(a) (NID(a)==N_R)
1.3 noro 961: #define BIGFLOAT(a) (NID(a)==N_B)
1.1 noro 962: #define SFF(a) (NID(a)==N_M)
963: #define UNIQ(q) ((q)&&NUM(q)&&RATN(q)&&(SGN((Q)q)==1)&&UNIN(NM((Q)q))&&(!DN((Q)q)))
964: #define UNIMQ(q) ((q)&&NUM(q)&&SFF(q)&&(CONT((MQ)q)==1))
965: #define MUNIQ(q) ((q)&&NUM(q)&&RATN(q)&&(SGN((Q)q)==-1)&&UNIN(NM((Q)q))&&(!DN((Q)q)))
966: #define MUNIMQ(q) ((q)&&NUM(q)&&SFF(q)&&(CONT((MQ)q)==-1))
967: #define UNIN(n) ((n)&&(PL(n)==1)&&(BD(n)[0]==1))
968: #define EVENN(n) ((!(n))||(!(BD(n)[0]%2)))
969:
1.8 noro 970: /* special macros for private memory management */
971:
972: #define NV(p) ((p)->nv)
973: #define C(p) ((p)->c)
1.28 noro 974: #if 0
1.8 noro 975: #define ITOS(p) (((unsigned int)(p))&0x7fffffff)
976: #define STOI(i) ((P)((unsigned int)(i)|0x80000000))
1.28 noro 977: #else
978: #define ITOS(p) (((unsigned int)(p)))
979: #define STOI(i) ((P)((unsigned int)(i)))
980: #endif
1.15 noro 981:
982: /* immediate GFS representation */
983:
984: #define IFTOF(p) ((int)(((unsigned int)(p))&0x7fffffff))
985: #define FTOIF(i) ((int)(((unsigned int)(i)|0x80000000)))
1.8 noro 986:
987: struct cdl {
988: P c;
989: DL d;
990: };
991:
992: struct cdlm {
993: int c;
994: DL d;
995: };
996:
997: extern MP _mp_free_list;
998: extern DP _dp_free_list;
999: extern DL _dl_free_list;
1000: extern int current_dl_length;
1001:
1002: #define _NEWDL_NOINIT(d,n) if ((n)!= current_dl_length){_dl_free_list=0; current_dl_length=(n);} if(!_dl_free_list)_DL_alloc(); (d)=_dl_free_list; _dl_free_list = *((DL *)_dl_free_list)
1003: #define _NEWDL(d,n) if ((n)!= current_dl_length){_dl_free_list=0; current_dl_length=(n);} if(!_dl_free_list)_DL_alloc(); (d)=_dl_free_list; _dl_free_list = *((DL *)_dl_free_list); bzero((d),(((n)+1)*sizeof(int)))
1004: #define _NEWMP(m) if(!_mp_free_list)_MP_alloc(); (m)=_mp_free_list; _mp_free_list = NEXT(_mp_free_list)
1.10 noro 1005: #define _MKDP(n,m,d) if(!_dp_free_list)_DP_alloc(); (d)=_dp_free_list; _dp_free_list = (DP)BDY(_dp_free_list); (d)->id = O_DP; (d)->nv=(n); BDY(d)=(m)
1.8 noro 1006:
1007: #define _NEXTMP(r,c) \
1008: if(!(r)){_NEWMP(r);(c)=(r);}else{_NEWMP(NEXT(c));(c)=NEXT(c);}
1009:
1010: #define _NEXTMP2(r,c,s) \
1011: if(!(r)){(c)=(r)=(s);}else{NEXT(c)=(s);(c)=(s);}
1012:
1013: #define _FREEDL(m) *((DL *)m)=_dl_free_list; _dl_free_list=(m)
1014: #define _FREEMP(m) NEXT(m)=_mp_free_list; _mp_free_list=(m)
1015: #define _FREEDP(m) BDY(m)=(MP)_dp_free_list; _dp_free_list=(m)
1.1 noro 1016:
1.33 noro 1017: #define MUL_WEIGHT(a,i) (current_dl_weight_vector?(a)*current_dl_weight_vector[i]:(a))
1018:
1.1 noro 1019: /* externals */
1020: #if 0
1021: double NatToReal();
1022: double RatnToReal();
1023: #endif
1024:
1025: extern struct oR oUNIR;
1026: extern struct oQ oUNIQ;
1027: extern struct oMQ oUNIMQ;
1028: extern struct oN oUNIN;
1029: extern struct oUP2 oONEUP2;
1030: extern struct oV oVAR[];
1031: extern struct oV oPVAR[];
1032: extern struct oVL oVLIST[];
1033: extern struct oVL oPVLIST[];
1034: extern VL CO,ALG;
1035: extern VL PVL;
1036: extern R ONER;
1037: extern Q ONE;
1.38 saito 1038: extern Q TWO;
1.1 noro 1039: extern MQ ONEM;
1040: extern LM ONELM;
1041: extern N ONEN;
1042: extern UP2 ONEUP2;
1043:
1044: extern FILE *asir_out;
1.7 noro 1045: #if defined(__GNUC__)
1.1 noro 1046: extern const int sprime[];
1047: #else
1048: extern int sprime[];
1049: #endif
1050:
1051: extern void (*addnumt[])();
1052: extern void (*subnumt[])();
1053: extern void (*mulnumt[])();
1054: extern void (*divnumt[])();
1055: extern void (*pwrnumt[])();
1056: extern int (*cmpnumt[])();
1057: extern void (*chsgnnumt[])();
1058:
1.29 noro 1059: extern int current_mod;
1060: extern GEN_UP2 current_mod_gf2n;
1061: extern int lm_lazy;
1062: extern int current_ff;
1063: extern V up_var;
1064: extern V up2_var;
1065: extern P current_gfs_ext;
1066: extern int current_gfs_p;
1067: extern int current_gfs_q;
1068: extern int current_gfs_q1;
1069: extern int *current_gfs_plus1;
1070: extern int *current_gfs_ntoi;
1071: extern int *current_gfs_iton;
1.33 noro 1072:
1073: extern int *current_dl_weight_vector;
1.29 noro 1074:
1.1 noro 1075: /* prototypes */
1076: int compui(VL,USINT,USINT);
1.6 noro 1077: int compbytearray(VL,BYTEARRAY,BYTEARRAY);
1.1 noro 1078:
1079: void powermodup(UP,UP *);
1080: void hybrid_powermodup(UP,UP *);
1081:
1082: void powertabup(UP,UP,UP *);
1083: void hybrid_powertabup(UP,UP,UP *);
1084:
1085: void generic_powermodup(UP,UP,Q,UP *);
1086: void hybrid_generic_powermodup(UP,UP,Q,UP *);
1087:
1088: void powermod1up(UP,UP *);
1089: void hybrid_rembymulup_special(int,UP,UP,UP,UP *);
1090: void hybrid_tmulup(int,UP,UP,int,UP *);
1091: void hybrid_squareup(int,UP,UP *);
1092: void hybrid_mulup(int,UP,UP,UP *);
1093:
1094: void getmod_lm(N *);
1095:
1096: int maxblenup(UP);
1097: void monicup(UP,UP *);
1098: void simpup(UP,UP *);
1099: void simpnum(Num,Num *);
1100: void decompp(P,Q,P *,P *);
1101: void truncp(P,Q,P *);
1102: void uremp(P,P,P *);
1103: void ugcdp(P,P,P *);
1104: void reversep(P,Q,P *);
1105: void invmodp(P,Q,P *);
1106: void addup(UP,UP,UP *);
1107: void subup(UP,UP,UP *);
1108: void chsgnup(UP,UP *);
1109: void mulup(UP,UP,UP *);
1110: void tmulup(UP,UP,int,UP *);
1111: void squareup(UP,UP *);
1112: void remup(UP,UP,UP *);
1113: void remup_destructive(UP,UP);
1114: void qrup(UP,UP,UP *,UP *);
1115: void qrup_destructive(UP,UP);
1116: void gcdup(UP,UP,UP *);
1117: void reverseup(UP,int,UP *);
1118: void invmodup(UP,int,UP *);
1119: void pwrup(UP,Q,UP *);
1120: void squarep_gf2n(VL,P,P *);
1121: void kmulp(VL,P,P,P *);
1122: void ksquarep(VL,P,P *);
1123: void kmulup(UP,UP,UP *);
1124: void ksquareup(UP,UP *);
1125: void extractup(UP,int,int,UP *);
1126: void copyup(UP,UP);
1127: void c_copyup(UP,int,pointer *);
1128: void kmulupmain(UP,UP,UP *);
1129: void ksquareupmain(UP,UP *);
1130: void rembymulup(UP,UP,UP *);
1131: void rembymulup_special(UP,UP,UP,UP *);
1132: void tkmulup(UP,UP,int,UP *);
1133: void shiftup(UP,int,UP *);
1134: void set_degreeup(UP,int);
1135: void decompup(UP,int,UP *,UP *);
1136: void truncup(UP,int,UP *);
1137: void uptofmarray(int,UP,ModNum *);
1138: void fmarraytoup(ModNum *,int,UP *);
1139: void uiarraytoup(unsigned int **,int,int,UP *);
1140: void adj_coefup(UP,N,N,UP *);
1141: void uptolmup(UP,UP *);
1142: void remcup(UP,N,UP *);
1143: void fft_mulup(UP,UP,UP *);
1144: void fft_squareup(UP,UP *);
1145: void trunc_fft_mulup(UP,UP,int,UP *);
1146: void shoup_fft_mulup(UP,UP,UP *);
1147: void shoup_fft_squareup(UP,UP *);
1148: void shoup_trunc_fft_mulup(UP,UP,int,UP *);
1149: void crup(ModNum **,int,int *,int,N,UP *);
1150: void shoup_crup(ModNum **,int,int *,int,N,N,UP *);
1151: void squareup_gf2n(UP,UP *);
1152: void powermodup_gf2n(UP,UP *);
1153: void generic_powermodup_gf2n(UP,UP,Q,UP *);
1154: void tracemodup_gf2n(UP,UP,Q,UP *);
1155: void tracemodup_gf2n_slow(UP,UP,Q,UP *);
1156: void tracemodup_gf2n_tab(UP,UP,Q,UP *);
1157: void square_rem_tab_up_gf2n(UP,UP *,UP *);
1158: void powertabup_gf2n(UP,UP,UP *);
1159: void find_root_gf2n(UP,GF2N *);
1160:
1.44 noro 1161: int cmpdl_composite(int,DL,DL);
1.1 noro 1162: int cmpdl_matrix(int,DL,DL);
1163: int cmpdl_order_pair(int,DL,DL);
1164: int cmpdl_elim(int,DL,DL);
1165: int cmpdl_blexrev(int,DL,DL);
1166: int cmpdl_bgradrev(int,DL,DL);
1167: int cmpdl_brevrev(int,DL,DL);
1168: int cmpdl_brevgradlex(int,DL,DL);
1169: int cmpdl_bgradlex(int,DL,DL);
1170: int cmpdl_blex(int,DL,DL);
1171: int cmpdl_revgradlex(int,DL,DL);
1172: int cmpdl_gradlex(int,DL,DL);
1173: int cmpdl_revlex(int,DL,DL);
1174: int cmpdl_lex(int,DL,DL);
1175: int compd(VL,DP,DP);
1176: void adddl(int,DL,DL,DL *);
1177: void divsdc(VL,DP,P,DP *);
1178: void muldc(VL,DP,P,DP *);
1179: void muldm(VL,DP,MP,DP *);
1180: void muld(VL,DP,DP,DP *);
1181: void chsgnd(DP,DP *);
1182: void subd(VL,DP,DP,DP *);
1183: void addd(VL,DP,DP,DP *);
1184: int sugard(MP);
1185: void nodetod(NODE,DP *);
1186: void dtop(VL,VL,DP,P *);
1187: void ptod(VL,VL,P,DP *);
1188: void initd(struct order_spec *);
1.49 noro 1189:
1190: void adddv(VL,DPV,DPV,DPV *);
1191: void subdv(VL,DPV,DPV,DPV *);
1192: void muldv(VL,DP,DPV,DPV *);
1193: void chsgndv(DPV,DPV *);
1194: int compdv(VL,DPV,DPV);
1.1 noro 1195:
1196: void _printdp(DP);
1197: void _dp_sp_mod(DP,DP,int,DP *);
1198: void _dp_mod(DP,int,NODE,DP *);
1199: void _dp_red_mod(DP,DP,int,DP *);
1200: void _dtop_mod(VL,VL,DP,P *);
1201: void _mulmdm(VL,int,DP,MP,DP *);
1202: void _mulmd(VL,int,DP,DP,DP *);
1203: void _chsgnmd(int,DP,DP *);
1204: void _submd(VL,int,DP,DP,DP *);
1205: void _addmd(VL,int,DP,DP,DP *);
1206: void _mdtop(VL,int,VL,DP,P *);
1207: void divsmdc(VL,int,DP,P,DP *);
1208: void mulmdc(VL,int,DP,P,DP *);
1209: void mulmdm(VL,int,DP,MP,DP *);
1210: void mulmd(VL,int,DP,DP,DP *);
1211: void chsgnmd(int,DP,DP *);
1212: void submd(VL,int,DP,DP,DP *);
1213: void addmd(VL,int,DP,DP,DP *);
1214: void mdtop(VL,int,VL,DP,P *);
1215: void mptomd(VL,int,VL,P,DP *);
1216: void ptomd(VL,int,VL,P,DP *);
1217: int p_mag(P);
1218: int n_bits(N);
1219: void gcdBinary_27n(N,N,N *);
1220: void rtime_init(void);
1221: void setmod_gf2n(P);
1222: void mt_sgenrand(unsigned long);
1223: unsigned long mt_genrand(void);
1224: #if defined(VISUAL)
1225: void srandom(unsigned int);
1226: unsigned int random(void);
1227: #endif
1228: void gcdbmodn(N,N,N *);
1229: void gcdbinn(N,N,N *);
1230: void gcdmodn(N,N,N *);
1231: void gcdaccn(N,N,N *);
1232: void gcdEuclidn(N,N,N *);
1233: void GC_free(void *);
1234: void FFT_primes(int,int *,int *,int *);
1235: int FFT_pol_product(unsigned int,unsigned int *, unsigned int,unsigned int *,
1236: unsigned int *,int,unsigned int *);
1237: int FFT_pol_square(unsigned int,unsigned int *,
1238: unsigned int *,int,unsigned int *);
1239: void dcptolist(DCP,LIST *);
1240: void gcdprsmp(VL,int,P,P,P *);
1241: void mult_mod_tab(UM,int,UM *,UM,int);
1242: int nfctr_mod(UM,int);
1243: int irred_check(UM,int);
1244: void modfctrp(P,int,int,DCP *);
1245: void pf_init(void);
1246: void binaryton(char *,N *);
1247: void hexton(char *,N *);
1248: void ptolmp(P,P *);
1249: void lmptop(P,P *);
1250: void ulmptoum(int,UP,UM);
1251: void objtobobj(int,Obj,Obj *);
1252: void bobjtoobj(int,Obj,Obj *);
1253: void numtobnum(int,Num,Num *);
1254: void bnumtonum(int,Num,Num *);
1255: void ptobp(int,P,P *);
1256: void bptop(int,P,P *);
1257: void listtoblist(int,LIST,LIST *);
1258: void blisttolist(int,LIST,LIST *);
1259: void vecttobvect(int,VECT,VECT *);
1260: void bvecttovect(int,VECT,VECT *);
1261: void mattobmat(int,MAT,MAT *);
1262: void bmattomat(int,MAT,MAT *);
1263: void n32ton27(N,N *);
1264: void n27ton32(N,N *);
1265: void kmulum(int,UM,UM,UM);
1266: void saveobj(FILE *,Obj);
1267: void endian_init(void);
1268: void write_char(FILE *,unsigned char *);
1269: void write_short(FILE *,unsigned short *);
1270: void write_int(FILE *,unsigned int *);
1271: void write_double(FILE *,double *);
1272: void write_intarray(FILE *,unsigned int *,int);
1273: void write_string(FILE *,unsigned char *,int);
1274: void savestr(FILE *,char *);
1275: void loadstr(FILE *,char **);
1276: void savevl(FILE *,VL);
1277: void loadvl(FILE *);
1278: void skipvl(FILE *);
1279: void savev(FILE *,V);
1280: void loadv(FILE *,V *);
1281: int save_convv(V);
1282: V load_convv(int);
1283: void swap_bytes(char *,int,int);
1284: void read_char(FILE *,unsigned char *);
1285: void read_short(FILE *,unsigned short *);
1286: void read_int(FILE *,unsigned int *);
1287: void read_double(FILE *,double *);
1288: void read_intarray(FILE *,unsigned int *,int);
1289: void read_string(FILE *,unsigned char *,int);
1290: void loadobj(FILE *,Obj *);
1291: void invum(int,UM,UM,UM);
1292: void addarray_to(unsigned int *,int,unsigned int *,int);
1293: void muln_1(unsigned int *,int,unsigned int,unsigned int *);
1294: unsigned int divn_1(unsigned int *,int,unsigned int,unsigned int *);
1295: void ptoup(P,UP *);
1296: void uptop(UP,P *);
1297: void printnum(Num);
1298: void printv(VL,V);
1299: void kmulq(Q,Q,Q *);
1300: void bshiftn(N,int,N *);
1301: void remn(N,N,N*);
1302: void simplm(LM,LM *);
1303: void qtolm(Q,LM *);
1304: int qpcheck(Obj);
1305: int headsgn(P);
1306: void adjsgn(P,DCP);
1307: void setmod_g2n(P);
1308: void simpgf2n(GF2N,GF2N *);
1309: void ptogf2n(Obj,GF2N *);
1310: void gf2ntop(GF2N,P *);
1311: void gf2ntovect(GF2N,VECT *);
1312: void squaregf2n(GF2N,GF2N *);
1313: void randomgf2n(GF2N *);
1314: void invgf2n(GF2N,GF2N *);
1315: void kmuln(N,N,N *);
1316: void extractn(N,int,int,N *);
1317: void copyn(N,int,int *);
1318: void kmulnmain(N,N,N *);
1319: int qcoefp(Obj);
1320: int qcoefr(Obj);
1.60 noro 1321: long get_allocwords(void);
1.1 noro 1322: double get_clock(void);
1323: void get_eg(struct oEGT *);
1324: void printtime(struct oEGT *,struct oEGT *,double);
1325: void init_eg(struct oEGT *);
1326: void add_eg(struct oEGT *,struct oEGT *,struct oEGT *);
1327: void print_eg(char *,struct oEGT *);
1328: void print_split_eg(struct oEGT *,struct oEGT *);
1329: void print_split_e(struct oEGT *,struct oEGT *);
1330: void suspend_timer(void);
1331: void resume_timer(void);
1332: void reset_engine(void);
1333: void notdef(VL,Obj,Obj,Obj *);
1334: void error(char *);
1335: void ptoup2(P,UP2 *);
1336: void ptoup2_sparse(P,UP2 *);
1337: void up2top(UP2,P *);
1338: void up2tovect(UP2,VECT *);
1339: void up2ton(UP2,Q *);
1340: void ntoup2(Q,UP2 *);
1341: void gen_simpup2(UP2,GEN_UP2,UP2 *);
1342: void gen_simpup2_destructive(UP2,GEN_UP2);
1343: void gen_invup2(UP2,GEN_UP2,UP2 *);
1344: void gen_pwrmodup2(UP2,Q,GEN_UP2,UP2 *);
1345: void simpup2(UP2,UP2,UP2 *);
1346: int degup2(UP2);
1347: int degup2_sparse(UP2);
1348: int degup2_1(unsigned int);
1349: void addup2(UP2,UP2,UP2 *);
1350: void subup2(UP2,UP2,UP2 *);
1351: void mulup2_n1(unsigned int *,int,unsigned int,unsigned int *);
1352: void mulup2_nh(unsigned int *,int,unsigned int,unsigned int *);
1353: void _mulup2_1(UP2,unsigned int,UP2);
1354: void _mulup2_h(UP2,unsigned int,UP2);
1355: void mulup2(UP2,UP2,UP2 *);
1356: void _kmulup2_(unsigned int *,unsigned int *,int,unsigned int *);
1357: void _mulup2_nn(unsigned int *,unsigned int *,int,unsigned int *);
1358: void _mulup2(UP2,UP2,UP2);
1359: void _mulup2_(_UP2,_UP2,_UP2);
1360: void squareup2(UP2,UP2 *);
1361: void _adjup2(UP2);
1362: void _adjup2_(_UP2);
1363: void _addup2(UP2,UP2,UP2);
1364: void _addup2_destructive(UP2,UP2);
1365: void _addup2_(_UP2,_UP2,_UP2);
1366: void _addtoup2_(_UP2,_UP2);
1367: unsigned int mulup2_bb(unsigned int,unsigned int);
1368: void init_up2_tab(void);
1369: unsigned int quoup2_11(unsigned int,unsigned int);
1370: void divup2_1(unsigned int,unsigned int,int,int,unsigned int *,unsigned int *);
1371: void qrup2(UP2,UP2,UP2 *,UP2 *);
1372: void _qrup2(UP2,UP2,UP2,UP2);
1373: void remup2(UP2,UP2,UP2 *);
1374: void _remup2(UP2,UP2,UP2);
1375: void remup2_sparse(UP2,UP2,UP2 *);
1376: void remup2_sparse_destructive(UP2,UP2);
1377: void remup2_type1_destructive(UP2,int);
1378: void remup2_3_destructive(UP2,UP2);
1379: void remup2_5_destructive(UP2,UP2);
1380: void _invup2_1(unsigned int,unsigned int,unsigned int *,unsigned int *);
1381: void _gcdup2_1(unsigned int,unsigned int,unsigned int *);
1382: void up2_init_eg(void);
1383: void up2_show_eg(void);
1384: void invup2(UP2,UP2,UP2 *);
1385: void gcdup2(UP2,UP2,UP2 *);
1386: void chsgnup2(UP2,UP2 *);
1387: void pwrmodup2(UP2,Q,UP2,UP2 *);
1388: void pwrmodup2_sparse(UP2,Q,UP2,UP2 *);
1389: int compup2(UP2,UP2);
1390: void printup2(UP2);
1391: void _copyup2(UP2,UP2);
1392: void _bshiftup2(UP2,int,UP2);
1393: void _bshiftup2_destructive(UP2,int);
1394: void diffup2(UP2,UP2 *);
1395: int sqfrcheckup2(UP2);
1396: int irredcheckup2(UP2);
1397: int irredcheck_dddup2(UP2);
1398: void _copy_up2bits(UP2,unsigned int **,int);
1399: void _print_frobmat(unsigned int **,int,int);
1400: int compute_multiplication_matrix(P,GF2MAT *);
1401: void compute_change_of_basis_matrix(P,P,int,GF2MAT *,GF2MAT *);
1402: int compute_representation_conversion_matrix(P,GF2MAT *,GF2MAT *);
1403: void mul_nb(GF2MAT,unsigned int *,unsigned int *,unsigned int *);
1404: void leftshift(unsigned int *,int);
1405: void mat_to_gf2mat(MAT,unsigned int ***);
1406: void gf2mat_to_mat(unsigned int **,int,MAT *);
1407: void mulgf2mat(int,unsigned int **,unsigned int **,unsigned int **);
1408: void mulgf2vectmat(int,unsigned int *,unsigned int **,unsigned int *);
1409: int mulgf2vectvect(int,unsigned int *,unsigned int *);
1410: int invgf2mat(int,unsigned int **,unsigned int **);
1411: void _mulup2_11(unsigned int,unsigned int,unsigned int *);
1412: void _mulup2_22(unsigned int *,unsigned int *,unsigned int *);
1413: void _mulup2_33(unsigned int *,unsigned int *,unsigned int *);
1414: void _mulup2_44(unsigned int *,unsigned int *,unsigned int *);
1415: void _mulup2_55(unsigned int *,unsigned int *,unsigned int *);
1416: void _mulup2_66(unsigned int *,unsigned int *,unsigned int *);
1417: void printup2_(unsigned int *,int);
1418: void type1_bin_invup2(UP2,int,UP2 *);
1419: int int_bits(int);
1420:
1421:
1422: LUM LUMALLOC(int, int);
1.16 noro 1423: BM BMALLOC(int, int);
1.1 noro 1424: Obj ToAlg(Num);
1425: UM *berlemain(register int, UM, UM *);
1426: void *Risa_GC_malloc(size_t);
1427: void *Risa_GC_malloc_atomic(size_t);
1428: void *Risa_GC_realloc(void *,size_t);
1429: void *GC_malloc(size_t);
1430: void *GC_malloc_atomic(size_t);
1431: void *GC_realloc(void *,size_t);
1432: double NatToReal(N,int *);
1433: double RatnToReal(Q);
1434: double pwrreal0(double,int);
1.3 noro 1435: double rtodbl(); /* XXX */
1.1 noro 1436: int **almat(int,int);
1437: pointer **almat_pointer(int,int);
1438: int berlecnt(register int,UM);
1439: int berlecntmain(register int,int,int,register int **);
1440: int cmpalg(Num,Num);
1441: int cmpbf(Num,Num);
1442: int cmpcplx(Num,Num);
1443: int cmpn(N,N);
1444: int cmpq(Q,Q);
1445: int cmpreal(Real,Real);
1446: int cmpmi(MQ,MQ);
1447: int cmplm(LM,LM);
1448: int compmat(VL,MAT,MAT);
1449: int compnum(VL,Num,Num);
1450: int compp(VL,P,P);
1451: int compr(VL,Obj,Obj);
1452: int compstr(VL,STRING,STRING);
1453: int compvect(VL,VECT,VECT);
1454: int ctest(P,ML,int,int *);
1455: int cycchk(P);
1456: int dbound(V,P);
1457: int dcomp(P,P);
1458: int deg(V,P);
1459: int degtest(int,int *,ML,int);
1460: int divcheck(VL,P *,int,P,P);
1461: unsigned int divin(N,unsigned int,N *);
1462: int divtdcpz(VL,P,P,P *);
1463: int divtpz(VL,P,P,P *);
1464: int divum(register int,UM,UM,UM);
1465: int dm(int,int,int *);
1466: int dmb(int,int,int,int *);
1467: int dma(int,int,int,int *);
1468: int dmab(int,int,int,int,int *);
1469: int dmar(int,int,int,int);
1470: int dtestmain(P,Q,ML,int,int *,P *,P *);
1471: int geldb(VL,P);
1472: int getchomdeg(V,P);
1473: int getdeg(V,P);
1474: int getlchomdeg(V,P,int *);
1.29 noro 1475: int get_lprime(int);
1.1 noro 1476: int homdeg(P);
1477: unsigned int invm(unsigned int,int);
1478: int iscycm(P);
1479: int iscycp(P);
1480: int lengthp(P);
1481: int mig(int,int,P);
1482: int mignotte(int,P);
1483: int minimain(register int,int,int,register int **);
1484: int ncombi(int,int,int,int *);
1485: int nextbin(VN,int);
1486: int nmonop(P);
1487: int pcoef(VL,VL,P,P *);
1488: int pcoef0(VL,VL,P,P *);
1489: unsigned int pwrm(register int,register int,int);
1.29 noro 1490: unsigned int rem(N,int);
1.1 noro 1491: int sqfrchk(P);
1492: int subn(N,N,N *);
1493: int ucmpp(P,P);
1494: int valideval(VL,DCP,VN);
1495: int zerovpchk(VL,P,VN);
1496:
1497: void addgf2n(GF2N,GF2N,GF2N *);
1498: void subgf2n(GF2N,GF2N,GF2N *);
1499: void mulgf2n(GF2N,GF2N,GF2N *);
1500: void divgf2n(GF2N,GF2N,GF2N *);
1501: void chsgngf2n(GF2N,GF2N *);
1502: void pwrgf2n(GF2N,Q, GF2N *);
1503: int cmpgf2n(GF2N,GF2N);
1504:
1505: void addgfpn(GFPN,GFPN,GFPN *);
1506: void subgfpn(GFPN,GFPN,GFPN *);
1507: void mulgfpn(GFPN,GFPN,GFPN *);
1508: void divgfpn(GFPN,GFPN,GFPN *);
1509: void chsgngfpn(GFPN,GFPN *);
1510: void pwrgfpn(GFPN,Q, GFPN *);
1511: int cmpgfpn(GFPN,GFPN);
1.12 noro 1512:
1513: void addgfs(GFS,GFS,GFS *);
1514: void subgfs(GFS,GFS,GFS *);
1515: void mulgfs(GFS,GFS,GFS *);
1516: void divgfs(GFS,GFS,GFS *);
1517: void chsgngfs(GFS,GFS *);
1518: void pwrgfs(GFS,Q, GFS *);
1519: int cmpgfs(GFS,GFS);
1.20 noro 1520:
1.21 noro 1521: void addgfsn(GFSN,GFSN,GFSN *);
1522: void subgfsn(GFSN,GFSN,GFSN *);
1523: void mulgfsn(GFSN,GFSN,GFSN *);
1524: void divgfsn(GFSN,GFSN,GFSN *);
1525: void chsgngfsn(GFSN,GFSN *);
1526: void pwrgfsn(GFSN,Q, GFSN *);
1527: int cmpgfsn(GFSN,GFSN);
1.53 noro 1528:
1529: void adddalg(DAlg,DAlg,DAlg *);
1530: void subdalg(DAlg,DAlg,DAlg *);
1531: void muldalg(DAlg,DAlg,DAlg *);
1532: void divdalg(DAlg,DAlg,DAlg *);
1533: void chsgndalg(DAlg,DAlg *);
1534: void pwrdalg(DAlg,Q, DAlg *);
1535: int cmpdalg(DAlg,DAlg);
1.1 noro 1536:
1537: void addalg(Num,Num,Num *);
1538: void addbf(Num,Num,Num *);
1539: void addcplx(Num,Num,Num *);
1540: void addm2p(VL,Q,Q,P,P,P *);
1541: void addm2q(Q,Q,Q,Q,Q *);
1542: void addmat(VL,MAT,MAT,MAT *);
1543: void addmp(VL,int,P,P,P *);
1544: void addmpq(int,P,P,P *);
1545: void addmptoc(VL,int,P,P,P *);
1546: void addmq(int,MQ,MQ,MQ *);
1547: void addn(N,N,N *);
1548: void addnum(VL,Num,Num,Num *);
1549: void addp(VL,P,P,P *);
1550: void addpadic(int,int,unsigned int *,unsigned int *);
1551: void addpq(P,P,P *);
1552: void addptoc(VL,P,P,P *);
1553: void addq(Q,Q,Q *);
1554: void addr(VL,Obj,Obj,Obj *);
1555: void addreal(Num,Num,Real *);
1556: void addmi(MQ,MQ,MQ *);
1557: void addlm(LM,LM,LM *);
1558: void addstr(VL,STRING,STRING,STRING *);
1559: void addum(int,UM,UM,UM);
1560: void addvect(VL,VECT,VECT,VECT *);
1.19 noro 1561: void addquote(VL,QUOTE,QUOTE,QUOTE *);
1.1 noro 1562: void adjc(VL,P,P,P,Q,P *,P *);
1563: void afctr(VL,P,P,DCP *);
1564: void afctrmain(VL,P,P,int,DCP *);
1565: void affine(VL,P,VN,P *);
1566: void affinemain(VL,P,V,int,P *,P *);
1567: void berle(int,int,P,ML *);
1568: void bnton(register int,N,N *);
1569: void cbound(VL,P,Q *);
1570: void chnrem(int,V,P,Q,UM,P *,Q *);
1571: void chnremp(VL,int,P,Q,P,P *);
1572: void chsgnalg(Num,Num *);
1573: void chsgnbf(Num a,Num *);
1574: void chsgncplx(Num,Num *);
1575: void chsgnmat(MAT,MAT *);
1576: void chsgnmp(int,P,P *);
1577: void chsgnnum(Num,Num *);
1578: void chsgnp(P,P *);
1579: void chsgnq(Q,Q *);
1580: void chsgnr(Obj,Obj *);
1581: void chsgnreal(Num,Num *);
1582: void chsgnmi(MQ,MQ *);
1583: void chsgnlm(LM,LM *);
1584: void chsgnvect(VECT,VECT *);
1.19 noro 1585: void chsgnquote(QUOTE,QUOTE *);
1.1 noro 1586: void clctv(VL,P,VL *);
1587: void clctvr(VL,Obj,VL *);
1588: void cm2p(Q,Q,P,P *);
1589: void cmax(P,Q *);
1590: void cmp(Q,P,P *);
1591: void coefp(P,int,P *);
1592: void cpylum(int,LUM,LUM);
1593: void cpyum(UM,UM);
1594: void csump(VL,P,Q *);
1595: void cycm(V,register int,DCP *);
1596: void cycp(V,register int,DCP *);
1597: void degp(V,P,Q *);
1598: void degum(UM,int);
1599: void detmp(VL,int,P **,int,P *);
1600: void detp(VL,P **,int,P *);
1601: void diffp(VL,P,V,P *);
1602: void diffum(register int,UM,UM);
1603: void divalg(Num,Num,Num *);
1604: void divbf(Num,Num,Num *);
1605: void divcp(P,Q,P *);
1606: void divcplx(Num,Num,Num *);
1607: void divmat(VL,Obj,Obj,Obj *);
1608: void divmq(int,MQ,MQ,MQ *);
1609: void divn(N,N,N *,N *);
1610: void divnmain(int,int,unsigned int *,unsigned int *,unsigned int *);
1611: void divnum(VL,Num,Num,Num *);
1612: void divq(Q,Q,Q *);
1613: void divr(VL,Obj,Obj,Obj *);
1614: void divreal(Num,Num,Real *);
1615: void divmi(MQ,MQ,MQ *);
1616: void divlm(LM,LM,LM *);
1617: void divsdcmp(VL,int,P,P,P *);
1618: void divsdcp(VL,P,P,P *);
1619: void divsmp(VL,int,P,P,P *);
1620: void divsn(N,N,N *);
1621: void divsp(VL,P,P,P *);
1622: void divsrdcmp(VL,int,P,P,P *,P *);
1623: void divsrdcp(VL,P,P,P *,P *);
1624: void divsrmp(VL,int,P,P,P *,P *);
1625: void divsrp(VL,P,P,P *,P *);
1626: void divvect(VL,Obj,Obj,Obj *);
1.19 noro 1627: void divquote(VL,QUOTE,QUOTE,QUOTE *);
1.1 noro 1628: void dtest(P,ML,int,DCP *);
1629: void dtestroot(int,int,P,LUM,struct oDUM *,DCP *);
1630: void dtestroot1(int,int,P,LUM,P *);
1631: void dtestsq(int,int,P,LUM,P *);
1632: void dtestsql(P,ML,struct oDUM *,DCP *);
1.41 ohara 1633: void ediffp(VL,P,V,P *);
1.1 noro 1634: void estimatelc(VL,Q,DCP,VN,P *);
1635: void eucum(register int,UM,UM,UM,UM);
1636: void exthp(VL,P,int,P *);
1637: void exthpc(VL,V,P,int,P *);
1638: void ezgcd1p(VL,P,P,P *);
1639: void ezgcdhensel(P,int,UM,UM,ML *);
1640: void ezgcdnp(VL,P,P *,int,P *);
1641: void ezgcdnpp(VL,DCP,P *,int,P *);
1642: void ezgcdnpz(VL,P *,int,P *);
1643: void ezgcdp(VL,P,P,P *);
1644: void ezgcdpp(VL,DCP,P,P *);
1645: void ezgcdpz(VL,P,P,P *);
1646: void factorial(int,Q *);
1647: void fctrp(VL,P,DCP *);
1648: void fctrwithmvp(VL,P,V,DCP *);
1649: void gcda(VL,P,P,P,P *);
1650: void gcdcp(VL,P,P *);
1651: void gcdgen(P,ML,ML *);
1652: void gcdmonomial(VL,DCP *,int,P *);
1653: void gcdn(N,N,N *);
1654: void gcdprsp(VL,P,P,P *);
1655: void gcdum(register int,UM,UM,UM);
1656: void getmindeg(V,P,Q *);
1657: void henmain(LUM,ML,ML,ML *);
1658: void henmv(VL,VN,P,P,P,P,P,P,P,P,P,Q,int,P *,P *);
1659: void henmvmain(VL,VN,P,P,P,P,P,P,P,Q,Q,int,P *,P *);
1660: void henprep(P,ML,ML,ML *,ML *);
1661: void hensel(int,int,P,ML *);
1662: void henzq(P,P,UM,P,UM,int,int,P *,P *,P *,P *,Q *);
1663: void henzq1(P,P,Q,P *,P *,Q *);
1664: void hsq(int,int,P,int *,DCP *);
1665: void intersectv(VL,VL,VL *);
1666: void invl(Q,Q,Q *);
1667: void invmq(int,MQ,MQ *);
1668: void invq(Q,Q *);
1669: void lgp(P,N *,N *);
1670: void lumtop(V,int,int,LUM,P *);
1671: void markv(VN,int,P);
1672: void maxdegp(VL,P,VL *,P *);
1673: void mergev(VL,VL,VL,VL *);
1674: void mfctr(VL,P,DCP *);
1675: void mfctrhen2(VL,VN,P,P,P,P,P,P,P *);
1676: void mfctrmain(VL,P,DCP *);
1677: void mfctrwithmv(VL,P,V,DCP *);
1678: void min_common_vars_in_coefp(VL,P,VL *,P *);
1679: void minchdegp(VL,P,VL *,P *);
1680: void mindegp(VL,P,VL *,P *);
1681: void mini(register int,UM,UM);
1682: void minlcdegp(VL,P,VL *,P *);
1683: void mkbc(int,Q *);
1684: void mkbcm(int,int,MQ *);
1685: void mkssum(V,int,int,int,P *);
1686: void monomialfctr(VL,P,P *,DCP *);
1687: void mptop(P,P *);
1688: void mptoum(P,UM);
1689: void msqfr(VL,P,DCP *);
1690: void msqfrmain(VL,P,DCP *);
1691: void msqfrmainmain(VL,P,VN,P,DCP,DCP *,P *);
1692: void mulalg(Num,Num,Num *);
1693: void mulbf(Num,Num,Num *);
1694: void mulcplx(Num,Num,Num *);
1695: void mulin(N,unsigned int,unsigned int *);
1696: void mullum(int,int,LUM,LUM,LUM);
1697: void mullumarray(P,ML,int,int *,P *);
1698: void mulm2p(VL,Q,Q,P,P,P *);
1699: void mulm2q(Q,Q,Q,Q,Q *);
1700: void mulmat(VL,Obj,Obj,Obj *);
1701: void mulmatmat(VL,MAT,MAT,MAT *);
1702: void mulmatvect(VL,MAT,VECT,VECT *);
1703: void mulmp(VL,int,P,P,P *);
1704: void mulmpc(VL,int,P,P,P *);
1705: void mulmpq(int,P,P,P *);
1706: void mulmq(int,MQ,MQ,MQ *);
1707: void muln(N,N,N *);
1708: void mulnum(VL,Num,Num,Num *);
1709: void mulp(VL,P,P,P *);
1710: void mulpadic(int,int,unsigned int *,unsigned int *,unsigned int *);
1711: void mulpc(VL,P,P,P *);
1712: void mulpq(P,P,P *);
1713: void mulq(Q,Q,Q *);
1714: void mulr(VL,Obj,Obj,Obj *);
1715: void mulreal(Num,Num,Real *);
1716: void mulmi(MQ,MQ,MQ *);
1717: void mullm(LM,LM,LM *);
1718: void mulrmat(VL,Obj,MAT,MAT *);
1719: void mulrvect(VL,Obj,VECT,VECT *);
1720: void mulsgn(VN,VN,int,VN);
1721: void mulsum(register int,UM,register int,UM);
1722: void mulum(register int,UM,UM,UM);
1723: void mulvect(VL,Obj,Obj,Obj *);
1.19 noro 1724: void mulquote(VL,QUOTE,QUOTE,QUOTE *);
1.1 noro 1725: void mulvectmat(VL,VECT,MAT,VECT *);
1726: void next(VN);
1727: void nezgcdnp_sqfr_primitive(VL,P,P *,int,P *);
1728: void nezgcdnpp(VL,DCP,P *,int,P *);
1729: void nezgcdnpz(VL,P *,int,P *);
1730: void nezgcdnpzmain(VL,P *,int,P *);
1731: void nglob_init(void);
1732: void norm(P,Q *);
1733: void norm1(P,P *);
1734: void norm1c(P,Q *);
1735: void normalizemp(int,P);
1736: void nthrootchk(P,struct oDUM *,ML,DCP *);
1737: void nthrootn(N,int,N *);
1738: void ntobn(register int,N,N *);
1739: void nuezgcdnpzmain(VL,P *,int,P *);
1740: void padictoq(int,int,int *,Q *);
1741: void risa_pari_init(void);
1742: void pcp(VL,P,P *,P *);
1743: void pderivr(VL,Obj,V,Obj *);
1744: void pdiva(VL,P,P,P,P *);
1745: void pinva(P,P,P *);
1746: void plisttop(P *,V,int,P *);
1747: void pmonic(VL,P,P,P *);
1748: void pqra(VL,P,P,P,P *,P *);
1749: void premmp(VL,int,P,P,P *);
1750: void premp(VL,P,P,P *);
1751: void ptolum(int,int,P,LUM);
1752: void ptomp(int,P,P *);
1753: void ptoum(int,P,UM);
1754: void ptozp(P,int,Q *,P *);
1755: void ptozp0(P,P *);
1756: void pwralg(Num,Num,Num *);
1757: void pwrbf(Num,Num,Num *);
1758: void pwrcplx(Num,Num,Num *);
1759: void pwrcplx0(Num,int,Num *);
1760: void pwrlum(int,int,LUM,int,LUM);
1761: void pwrmat(VL,MAT,Obj,MAT *);
1762: void pwrmatmain(VL,MAT,int,MAT *);
1763: void pwrmp(VL,int,P,Q,P *);
1764: void pwrmq(int,MQ,Q,MQ *);
1765: void pwrn(N,int,N *);
1766: void pwrnum(VL,Num,Num,Num *);
1767: void pwrp(VL,P,Q,P *);
1768: void pwrq(Q,Q,Q *);
1769: void pwrr(VL,Obj,Obj,Obj *);
1.19 noro 1770: void pwrquote(VL,QUOTE,QUOTE,QUOTE *);
1.1 noro 1771: void pwrreal(Num,Num,Real *);
1772: void pwrmi(MQ,Q,MQ *);
1773: void pwrlm(LM,Q,LM *);
1774: void pwrum(int,UM,int,UM);
1775: void reallocarray(char **,int *,int *,int);
1776: void reductr(VL,Obj,Obj *);
1777: void reimtocplx(Num,Num,Num *);
1778: void rem2q(Q,Q,Q,Q *);
1779: void rema(VL,P,P,P,P *);
1780: void remq(Q,Q,Q *);
1781: void remsdcp(VL,P,P,P *);
1782: void reordermp(VL,int,VL,P,P *);
1783: void reorderp(VL,VL,P,P *);
1784: void reordvar(VL,V,VL *);
1785: void res_ch_det(VL,V,P,P,P *);
1786: void res_detmp(VL,int,V,P,P,P *);
1787: void restore(VL,P,VN,P *);
1788: void resultmp(VL,int,V,P,P,P *);
1789: void resultp(VL,V,P,P,P *);
1790: void setlum(int,int,LUM);
1791: void sort_by_deg(int,P *,P *);
1792: void sort_by_deg_rev(int,P *,P *);
1793: void sortfs(DCP *);
1794: void sortfsrev(DCP *);
1795: void sortplist(P *,int);
1796: void sortplistbyhomdeg(P *,int);
1797: void sprs(VL,V,P,P,P *);
1798: void sqa(VL,P,P,DCP *);
1799: void sqad(unsigned int,int);
1800: void sqfrp(VL,P,DCP *);
1801: void sqfrum(int,int,P,int *,struct oDUM **,ML *);
1802: void sqfrummain(int,UM,UM,struct oDUM **);
1803: void sqrtn(N,N *);
1804: void srch2(VL,V,P,P,P *);
1805: void srchmp(VL,int,V,P,P,P *);
1806: void srchump(int,P,P,P *);
1807: void srcr(VL,V,P,P,P *);
1808: void strtobf(char *,BF *);
1809: void subalg(Num,Num,Num *);
1810: void subbf(Num,Num,Num *);
1811: void subcplx(Num,Num,Num *);
1812: void subm2p(VL,Q,Q,P,P,P *);
1813: void subm2q(Q,Q,Q,Q,Q *);
1814: void submat(VL,MAT,MAT,MAT *);
1815: void submp(VL,int,P,P,P *);
1816: void submq(int,MQ,MQ,MQ *);
1817: void subnum(VL,Num,Num,Num *);
1818: void subp(VL,P,P,P *);
1819: void subq(Q,Q,Q *);
1820: void subr(VL,Obj,Obj,Obj *);
1821: void subreal(Num,Num,Real *);
1822: void submi(MQ,MQ,MQ *);
1823: void sublm(LM,LM,LM *);
1824: void substmp(VL,int,P,V,P,P *);
1825: void substp(VL,P,V,P,P *);
1826: void substvp(VL,P,VN,P *);
1827: void subum(int,UM,UM,UM);
1828: void subvect(VL,VECT,VECT,VECT *);
1.19 noro 1829: void subquote(VL,QUOTE,QUOTE,QUOTE *);
1.1 noro 1830: void toreim(Num,Num *,Num *);
1831: void ucsump(P,Q *);
1832: void udivpwm(Q,P,P,P *,P *);
1833: void udivpz(P,P,P *,P *);
1834: void udivpzwm(Q,P,P,P *,P *);
1835: void uexgcdnp(VL,P,P *,int,VN,Q,P *,P *,P *,P *,Q *);
1836: void uezgcd1p(P,P,P *);
1837: void uezgcdpp(DCP,P,P *);
1838: void uezgcdpz(VL,P,P,P *);
1839: void ufctr(P,int,DCP *);
1840: void ufctrmain(P,int,DCP *);
1841: void umtomp(V,UM,P *);
1842: void umtop(V,UM,P *);
1843: void usqp(P,DCP *);
1844: void vntovl(VN,int,VL *);
1.29 noro 1845:
1846: void saveerror(FILE *,ERR);
1847: void saveui(FILE *,USINT);
1848: void savedp(FILE *,DP);
1849: void savestring(FILE *,STRING);
1850: void savemat(FILE *,MAT);
1851: void savevect(FILE *,VECT);
1852: void savelist(FILE *,LIST);
1853: void saver(FILE *,R);
1854: void savep(FILE *,P);
1855: void savegf2n(FILE *,GF2N);
1856: void savegfpn(FILE *,GFPN);
1857: void savegfs(FILE *,GFS);
1.54 noro 1858: void savedalg(FILE *,DAlg);
1.29 noro 1859: void savelm(FILE *,LM);
1860: void savemi(FILE *,MQ);
1861: void savecplx(FILE *,C);
1862: void savebf(FILE *,BF);
1863: void savereal(FILE *,Real);
1864: void saveq(FILE *,Q);
1865: void savenum(FILE *,Num);
1866: void savepfins(FILE *,V);
1867: void savegfmmat(FILE *,GFMMAT);
1868: void savebytearray(FILE *,BYTEARRAY);
1869: void savegfsn(FILE *,GFSN);
1870:
1871: void loaderror(FILE *,ERR *);
1872: void loadui(FILE *,USINT *);
1873: void loaddp(FILE *,DP *);
1874: void loadstring(FILE *,STRING *);
1875: void loadmat(FILE *,MAT *);
1876: void loadvect(FILE *,VECT *);
1877: void loadlist(FILE *,LIST *);
1878: void loadr(FILE *,R *);
1879: void loadp(FILE *,P *);
1880: void loadgf2n(FILE *,GF2N *);
1881: void loadgfpn(FILE *,GFPN *);
1882: void loadgfs(FILE *,GFS *);
1883: void loadgfsn(FILE *,GFSN *);
1.54 noro 1884: void loaddalg(FILE *,DAlg *);
1.29 noro 1885: void loadlm(FILE *,LM *);
1886: void loadmi(FILE *,MQ *);
1887: void loadcplx(FILE *,C *);
1888: void loadbf(FILE *,BF *);
1889: void loadreal(FILE *,Real *);
1890: void loadq(FILE *,Q *);
1891: void loadnum(FILE *,Num *);
1892: void loadgfmmat(FILE *,GFMMAT *);
1893: void loadbytearray(FILE *,BYTEARRAY *);
1894: V loadpfins(FILE *);
1895: void eucum2(int mod,UM f1,UM f2,UM a,UM b);
1896: void clearum(UM p,int n);
1897: BM BMALLOC(int dx,int dy);
1898: int isequalum(UM f1,UM f2);
1899: void dec_um(int p,int a,UM u);
1900: void setmod_sf(int p,int n);
1901: int search_defpoly_and_primitive_root(int p,int n,UM dp);
1902: void generate_defpoly_um(int p,int n,UM dp);
1903: int generate_primitive_root_enc(int p,int n,UM dp);
1904: int mulremum_enc(int p,int n,UM dp,int a,int b);
1905: void gfs_galois_action(GFS a,Q e,GFS *c);
1906: void gfs_embed(GFS z,int k,int pm,GFS *c);
1907: void qtogfs(Q a,GFS *c);
1908: void mqtogfs(MQ a,GFS *c);
1909: void gfstomq(GFS a,MQ *c);
1910: void ntogfs(Obj a,GFS *b);
1911: void addgfs(GFS a,GFS b,GFS *c);
1912: void subgfs(GFS a,GFS b,GFS *c);
1913: void mulgfs(GFS a,GFS b,GFS *c);
1914: void divgfs(GFS a,GFS b,GFS *c);
1915: void chsgngfs(GFS a,GFS *c);
1916: void pwrgfs(GFS a,Q b,GFS *c);
1917: int cmpgfs(GFS a,GFS b);
1918: void randomgfs(GFS *r);
1919: int _addsf(int a,int b);
1920: int _chsgnsf(int a);
1921: int _subsf(int a,int b);
1922: int _mulsf(int a,int b);
1923: int _invsf(int a);
1924: int _divsf(int a,int b);
1925: int _pwrsf(int a,int b);
1926: int _onesf();
1927: int _itosf(int n);
1928: int _isonesf(int a);
1929: int _randomsf();
1930: int field_order_sf();
1931: int characteristic_sf();
1932: int extdeg_sf();
1933: void addsfum(UM p1,UM p2,UM pr);
1934: void subsfum(UM p1,UM p2,UM pr);
1935: void gcdsfum(UM p1,UM p2,UM pr);
1936: void mulsfum(UM p1,UM p2,UM pr);
1937: void mulssfum(UM p,int n,UM pr);
1938: void kmulsfum(UM n1,UM n2,UM nr);
1939: void kmulsfummain(UM n1,UM n2,UM nr);
1940: int divsfum(UM p1,UM p2,UM pq);
1941: void diffsfum(UM f,UM fd);
1942: void monicsfum(UM f);
1943: int compsfum(UM a,UM b);
1944: void mulsfbm(BM f1,BM f2,BM fr);
1945: int degbm(BM f);
1946: void addtosfbm(BM f,BM g);
1947: void eucsfum(UM f1,UM f2,UM a,UM b);
1948: void shiftsfum(UM f,int a,UM g);
1949: void shiftsflum(int n,LUM f,int ev);
1950: void shiftsfbm(BM f,int a);
1951: void clearbm(int n,BM f);
1952:
1953: void ksquareum(int mod,UM n1,UM nr);
1954: void extractum(UM n,int index,int len,UM nr);
1955: void copyum(UM n1,UM n2);
1956: void c_copyum(UM n,int len,int *p);
1957: void kmulummain(int mod,UM n1,UM n2,UM nr);
1958: void ksquareummain(int mod,UM n1,UM nr);
1959:
1960: void simp_ff(Obj p,Obj *rp);
1961: void field_order_ff(N *order);
1962:
1963: void random_lm(LM *r);
1964: void ntosparsen(N p,N *bits);
1965: void setmod_lm(N p);
1966: void getmod_lm(N *p);
1967: void simplm(LM n,LM *r);
1968: void qtolm(Q q,LM *l);
1969: void addlm(LM a,LM b,LM *c);
1970: void sublm(LM a,LM b,LM *c);
1971: void mullm(LM a,LM b,LM *c);
1972: void divlm(LM a,LM b,LM *c);
1973: void chsgnlm(LM a,LM *c);
1974: void pwrlm(LM a,Q b,LM *c);
1975: void pwrlm0(N a,N n,N *c);
1976: int cmplm(LM a,LM b);
1977: void remn_special(N,N,int,unsigned int ,N *);;
1978: void gen_simpn(N a,N *b);
1979: void gen_simpn_force(N a,N *b);
1980: void setmod_gfpn(P p);
1981: void getmod_gfpn(UP *up);
1982: void ptogfpn(Obj q,GFPN *l);
1983: void gfpntop(GFPN q,P *l);
1984: void simpgfpn(GFPN n,GFPN *r);
1985: void ntogfpn(Obj a,GFPN *b);
1986: void addgfpn(GFPN a,GFPN b,GFPN *c);
1987: void subgfpn(GFPN a,GFPN b,GFPN *c);
1988: void mulgfpn(GFPN a,GFPN b,GFPN *c);
1989: void squaregfpn(GFPN a,GFPN *c);
1990: void divgfpn(GFPN a,GFPN b,GFPN *c);
1991: void invgfpn(GFPN b,GFPN *c);
1992: void chsgngfpn(GFPN a,GFPN *c);
1993: void pwrgfpn(GFPN a,Q b,GFPN *c);
1994: int cmpgfpn(GFPN a,GFPN b);
1995: void randomgfpn(GFPN *r);
1996: void setmod_gfsn(UM p);
1997: void getmod_gfsn(UM *up);
1998: void simpgfsn(GFSN n,GFSN *r);
1999: void ntogfsn(Obj a,GFSN *b);
2000: void addgfsn(GFSN a,GFSN b,GFSN *c);
2001: void subgfsn(GFSN a,GFSN b,GFSN *c);
2002: void mulgfsn(GFSN a,GFSN b,GFSN *c);
2003: void divgfsn(GFSN a,GFSN b,GFSN *c);
2004: void invgfsn(GFSN b,GFSN *c);
2005: void chsgngfsn(GFSN a,GFSN *c);
2006: void pwrgfsn(GFSN a,Q b,GFSN *c);
2007: int cmpgfsn(GFSN a,GFSN b);
2008: void randomgfsn(GFSN *r);
2009: void setmod_gf2n(P p);
2010: void getmod_gf2n(UP2 *p);
2011: void simpgf2n(GF2N n,GF2N *r);
2012: void ptogf2n(Obj q,GF2N *l);
2013: void gf2ntop(GF2N q,P *l);
2014: void gf2ntovect(GF2N q,VECT *l);
2015: void addgf2n(GF2N a,GF2N b,GF2N *c);
2016: void subgf2n(GF2N a,GF2N b,GF2N *c);
2017: void mulgf2n(GF2N a,GF2N b,GF2N *c);
2018: void squaregf2n(GF2N a,GF2N *c);
2019: void divgf2n(GF2N a,GF2N b,GF2N *c);
2020: void invgf2n(GF2N b,GF2N *c);
2021: void chsgngf2n(GF2N a,GF2N *c);
2022: void pwrgf2n(GF2N a,Q b,GF2N *c);
2023: int cmpgf2n(GF2N a,GF2N b);
2024: void randomgf2n(GF2N *r);
2025: void binaryton(char *binary,N *np);
2026: void hexton(char *hex,N *np);
2027: void ntobn(int base,N n,N *nrp);
2028: void bnton(int base,N n,N *nrp);
2029: void ptomp(int m,P p,P *pr);
2030: void mptop(P f,P *gp);
2031: void ptosfp(P p,P *pr);
2032: void sfptop(P f,P *gp);
2033: void sf_galois_action(P p,Q e,P *pr);
2034: void sf_embed(P p,int k,int pm,P *pr);
2035: void ptolmp(P p,P *pr);
2036: void lmptop(P f,P *gp);
2037: void ptoum(int m,P f,UM wf);
2038: void umtop(V v,UM w,P *f);
2039: void ptosfum(P f,UM wf);
2040: void sfumtop(V v,UM w,P *f);
2041: void ptoup(P n,UP *nr);
2042: void uptop(UP n,P *nr);
2043: void ulmptoum(int m,UP f,UM wf);
2044: void objtobobj(int base,Obj p,Obj *rp);
2045: void bobjtoobj(int base,Obj p,Obj *rp);
2046: void numtobnum(int base,Num p,Num *rp);
2047: void bnumtonum(int base,Num p,Num *rp);
2048: void ptobp(int base,P p,P *rp);
2049: void bptop(int base,P p,P *rp);
2050: void listtoblist(int base,LIST p,LIST *rp);
2051: void blisttolist(int base,LIST p,LIST *rp);
2052: void vecttobvect(int base,VECT p,VECT *rp);
2053: void bvecttovect(int base,VECT p,VECT *rp);
2054: void mattobmat(int base,MAT p,MAT *rp);
2055: void bmattomat(int base,MAT p,MAT *rp);
2056: void n32ton27(N g,N *rp);
2057: void n27ton32(N a,N *rp);
2058: void mptoum(P p,UM pr);
2059: void umtomp(V v,UM p,P *pr);
2060: void enc_to_p(int p,int a,V v,P *pr);
2061: int comp_dum(DUM a,DUM b);
2062: void fctrsf(P p,DCP *dcp);
2063: void gensqfrsfum(UM p,struct oDUM *dc);
2064: void randsfum(int d,UM p);
2065: void pwrmodsfum(UM p,int e,UM f,UM pr);
2066: void spwrsfum(UM m,UM f,N e,UM r);
2067: void tracemodsfum(UM m,UM f,int e,UM r);
2068: void make_qmatsf(UM p,UM *tab,int ***mp);
2069: void nullsf(int **mat,int n,int *ind);
2070: void null_to_solsf(int **mat,int *ind,int n,UM *r);
2071: void czsfum(UM f,UM *r);
2072: int berlekampsf(UM p,int df,UM *tab,UM *r);
2073: void minipolysf(UM f,UM p,UM mp);
2074: int find_rootsf(UM p,int *root);
2075: void canzassf(UM f,int d,UM *r);
1.34 noro 2076: void sfhensel(int count,P f,V x,V y,int degbound,GFS *evp,P *sfp,ML *listp);
2077: int sfberle(V x,V y,P f,int count,GFS *ev,DCP *dcp);
1.29 noro 2078: void sfgcdgen(P f,ML blist,ML *clistp);
2079: void sfhenmain2(BM f,UM g0,UM h0,int dy,BM *gp);
2080: void ptosfbm(int dy,P f,BM fl);
2081: void sfbmtop(BM f,V x,V y,P *fp);
2082: void sfsqfr(P f,DCP *dcp);
2083: void sfusqfr(P f,DCP *dcp);
2084: void sfbsqfr(P f,V x,V y,DCP *dcp);
1.30 noro 2085: void sfbfctr(P f,V x,V y,int degbound,DCP *dcp);
1.29 noro 2086: void sfdtest(P f,ML list,V x,V y,DCP *dcp);
2087: int sfdtestmain(VL vl,P lcg,UM lcg0,BM lcy,P csum,ML list,
2088: int k,int *in,P *fp,P *cofp);
2089: void const_term(P f,UM c);
2090: void const_term_sfbm(BM f,UM c);
2091: int sfctest(UM lcg0,BM lcy,ML list,int k,int *in);
2092: void mulsfbmarray(int dx,BM lcy,ML list,int k,int *in,V x,V y,P *g);
2093: void sfcsump(VL vl,P f,P *s);
2094: void cont_pp_sfp(VL vl,P f,P *cp,P *fp);
2095: int divtp_by_sfbm(VL vl,P f,P g,P *qp);
2096: void generate_defpoly_sfum(int n,UM *dp);
2097: NODE symb_merge(NODE,NODE,int);
2098: void _free_private_storage();
2099: void _DL_alloc();
2100: void _MP_alloc();
2101: void _DP_alloc();
2102: void _addmd_destructive(int mod,DP p1,DP p2,DP *pr);
2103: void _mulmd_dup(int mod,DP p1,DP p2,DP *pr);
2104: void _comm_mulmd_dup(int mod,DP p1,DP p2,DP *pr);
2105: void _weyl_mulmd_dup(int mod,DP p1,DP p2,DP *pr);
2106: void _mulmdm_dup(int mod,DP p,MP m0,DP *pr);
2107: void _weyl_mulmdm_dup(int mod,MP m0,DP p,DP *pr);
2108: void _weyl_mulmmm_dup(int mod,MP m0,MP m1,int n,struct cdlm *rtab,int rtablen);
2109: void _comm_mulmd_tab(int mod,int nv,struct cdlm *t,int n,struct cdlm *t1,int n1,struct cdlm *rt);
2110: void _comm_mulmd_tab_destructive(int mod,int nv,struct cdlm *t,int n,struct cdlm *t1,int n1);
2111: void dlto_dl(DL d,DL *dr);
2112: void _dltodl(DL d,DL *dr);
2113: void _adddl_dup(int n,DL d1,DL d2,DL *dr);
2114: void _free_dlarray(DL *a,int n);
2115: void _free_dp(DP f);
2116: void dpto_dp(DP p,DP *r);
2117: void _dptodp(DP p,DP *r);
2118: NODE _symb_merge(NODE m1,NODE m2,int n);
2119: void _addd_destructive(VL vl,DP p1,DP p2,DP *pr);
2120: void _muld_dup(VL vl,DP p1,DP p2,DP *pr);
2121: void _comm_muld_dup(VL vl,DP p1,DP p2,DP *pr);
2122: void _weyl_muld_dup(VL vl,DP p1,DP p2,DP *pr);
2123: void _muldm_dup(VL vl,DP p,MP m0,DP *pr);
2124: void _weyl_muldm_dup(VL vl,MP m0,DP p,DP *pr);
2125: void _weyl_mulmm_dup(VL vl,MP m0,MP m1,int n,struct cdl *rtab,int rtablen);
2126: void _comm_muld_tab(VL vl,int nv,struct cdl *t,int n,struct cdl *t1,int n1,struct cdl *rt);
2127: void _comm_muld_tab_destructive(VL vl,int nv,struct cdl *t,int n,struct cdl *t1,int n1);
2128:
2129: int has_fcoef(DP f);
2130: int has_fcoef_p(P f);
2131: void initd(struct order_spec *spec);
2132: void ptod(VL vl,VL dvl,P p,DP *pr);
2133: void dtop(VL vl,VL dvl,DP p,P *pr);
2134: void nodetod(NODE node,DP *dp);
2135: int sugard(MP m);
2136: void addd(VL vl,DP p1,DP p2,DP *pr);
2137: void symb_addd(DP p1,DP p2,DP *pr);
2138: NODE symb_merge(NODE m1,NODE m2,int n);
2139: DLBUCKET symb_merge_bucket(DLBUCKET m1,DLBUCKET m2,int n);
2140: void subd(VL vl,DP p1,DP p2,DP *pr);
2141: void chsgnd(DP p,DP *pr);
2142: void muld(VL vl,DP p1,DP p2,DP *pr);
2143: void comm_muld(VL vl,DP p1,DP p2,DP *pr);
2144: void muldm(VL vl,DP p,MP m0,DP *pr);
2145: void weyl_muld(VL vl,DP p1,DP p2,DP *pr);
2146: void weyl_muldm(VL vl,MP m0,DP p,DP *pr);
2147: void weyl_mulmm(VL vl,MP m0,MP m1,int n,struct cdl *rtab,int rtablen);
2148: void comm_muld_tab(VL vl,int nv,struct cdl *t,int n,struct cdl *t1,int n1,struct cdl *rt);
2149: void muldc(VL vl,DP p,P c,DP *pr);
2150: void divsdc(VL vl,DP p,P c,DP *pr);
2151: void adddl(int n,DL d1,DL d2,DL *dr);
2152: void adddl_destructive(int n,DL d1,DL d2);
2153: int compd(VL vl,DP p1,DP p2);
2154: int cmpdl_lex(int n,DL d1,DL d2);
2155: int cmpdl_revlex(int n,DL d1,DL d2);
2156: int cmpdl_gradlex(int n,DL d1,DL d2);
2157: int cmpdl_revgradlex(int n,DL d1,DL d2);
2158: int cmpdl_blex(int n,DL d1,DL d2);
2159: int cmpdl_bgradlex(int n,DL d1,DL d2);
2160: int cmpdl_brevgradlex(int n,DL d1,DL d2);
2161: int cmpdl_brevrev(int n,DL d1,DL d2);
2162: int cmpdl_bgradrev(int n,DL d1,DL d2);
2163: int cmpdl_blexrev(int n,DL d1,DL d2);
2164: int cmpdl_elim(int n,DL d1,DL d2);
2165: int cmpdl_weyl_elim(int n,DL d1,DL d2);
2166: int cmpdl_homo_ww_drl(int n,DL d1,DL d2);
2167: int cmpdl_order_pair(int n,DL d1,DL d2);
2168: int cmpdl_matrix(int n,DL d1,DL d2);
2169: void ptomd(VL vl,int mod,VL dvl,P p,DP *pr);
2170: void mptomd(VL vl,int mod,VL dvl,P p,DP *pr);
2171: void mdtop(VL vl,int mod,VL dvl,DP p,P *pr);
2172: void addmd(VL vl,int mod,DP p1,DP p2,DP *pr);
2173: void submd(VL vl,int mod,DP p1,DP p2,DP *pr);
2174: void chsgnmd(int mod,DP p,DP *pr);
2175: void mulmd(VL vl,int mod,DP p1,DP p2,DP *pr);
2176: void comm_mulmd(VL vl,int mod,DP p1,DP p2,DP *pr);
2177: void weyl_mulmd(VL vl,int mod,DP p1,DP p2,DP *pr);
2178: void mulmdm(VL vl,int mod,DP p,MP m0,DP *pr);
2179: void weyl_mulmdm(VL vl,int mod,DP p,MP m0,DP *pr);
2180: void weyl_mulmmm(VL vl,int mod,MP m0,MP m1,int n,DP *pr);
2181: void mulmdc(VL vl,int mod,DP p,P c,DP *pr);
2182: void divsmdc(VL vl,int mod,DP p,P c,DP *pr);
2183: void _dtop_mod(VL vl,VL dvl,DP p,P *pr);
2184: void _dp_mod(DP p,int mod,NODE subst,DP *rp);
2185: void _dp_monic(DP p,int mod,DP *rp);
2186: void _printdp(DP d);
2187: void addmd_destructive(int mod,DP p1,DP p2,DP *pr);
2188: void mulmd_dup(int mod,DP p1,DP p2,DP *pr);
2189: void comm_mulmd_dup(int mod,DP p1,DP p2,DP *pr);
2190: void weyl_mulmd_dup(int mod,DP p1,DP p2,DP *pr);
2191: void mulmdm_dup(int mod,DP p,MP m0,DP *pr);
2192: void weyl_mulmdm_dup(int mod,MP m0,DP p,DP *pr);
2193: void weyl_mulmmm_dup(int mod,MP m0,MP m1,int n,struct cdlm *rtab,int rtablen);
2194: void comm_mulmd_tab_destructive(int mod,int nv,struct cdlm *t,int n,struct cdlm *t1,int n1);
2195: void adddl_dup(int n,DL d1,DL d2,DL *dr);
2196: void monicup(UP a,UP *b);
2197: void simpup(UP a,UP *b);
2198: void simpnum(Num a,Num *b);
2199: void uremp(P p1,P p2,P *rp);
2200: void ugcdp(P p1,P p2,P *rp);
2201: void reversep(P p1,Q d,P *rp);
2202: void invmodp(P p1,Q d,P *rp);
2203: void addup(UP n1,UP n2,UP *nr);
2204: void subup(UP n1,UP n2,UP *nr);
2205: void chsgnup(UP n1,UP *nr);
2206: void hybrid_mulup(int ff,UP n1,UP n2,UP *nr);
2207: void hybrid_squareup(int ff,UP n1,UP *nr);
2208: void hybrid_tmulup(int ff,UP n1,UP n2,int d,UP *nr);
2209: void mulup(UP n1,UP n2,UP *nr);
2210: void mulcup(Num c,UP n1,UP *nr);
2211: void tmulup(UP n1,UP n2,int d,UP *nr);
2212: void squareup(UP n1,UP *nr);
2213: void remup(UP n1,UP n2,UP *nr);
2214: void remup_destructive(UP n1,UP n2);
2215: void qrup(UP n1,UP n2,UP *nq,UP *nr);
2216: void qrup_destructive(UP n1,UP n2);
2217: void gcdup(UP n1,UP n2,UP *nr);
2218: void extended_gcdup(UP a,UP m,UP *r);
2219: void reverseup(UP n1,int d,UP *nr);
2220: void invmodup(UP n1,int d,UP *nr);
2221: void pwrup(UP n,Q e,UP *nr);
2222: int compup(UP n1,UP n2);
2223: void kmulp(VL vl,P n1,P n2,P *nr);
2224: void ksquarep(VL vl,P n1,P *nr);
2225: void kmulup(UP n1,UP n2,UP *nr);
2226: void ksquareup(UP n1,UP *nr);
2227: void copyup(UP n1,UP n2);
2228: void c_copyup(UP n,int len,pointer *p);
2229: void kmulupmain(UP n1,UP n2,UP *nr);
2230: void ksquareupmain(UP n1,UP *nr);
2231: void rembymulup(UP n1,UP n2,UP *nr);
2232: void hybrid_rembymulup_special(int ff,UP n1,UP n2,UP inv2,UP *nr);
2233: void rembymulup_special(UP n1,UP n2,UP inv2,UP *nr);
2234: void tkmulup(UP n1,UP n2,int d,UP *nr);
2235: void shiftup(UP n,int d,UP *nr);
2236: void fft_rembymulup_special(UP n1,UP n2,UP inv2,UP *nr);
2237: void set_degreeup(UP n,int d);
2238: void decompup(UP n,int d,UP *n0,UP *n1);
2239: void truncup(UP n1,int d,UP *nr);
2240: int int_bits(int t);
2241: int maxblenup(UP n);
2242: void uptofmarray(int mod,UP n,ModNum *f);
2243: void fmarraytoup(ModNum *f,int d,UP *nr);
2244: void uiarraytoup(unsigned int **f,int n,int d,UP *nr);
2245: void adj_coefup(UP n,N m,N m2,UP *nr);
2246: void remcup(UP n,N mod,UP *nr);
2247: void fft_mulup(UP n1,UP n2,UP *nr);
2248: void trunc_fft_mulup(UP n1,UP n2,int dbd,UP *nr);
2249: void fft_squareup(UP n1,UP *nr);
2250: void fft_mulup_main(UP n1,UP n2,int dbd,UP *nr);
2251: void crup(ModNum **f,int d,int *mod,int index,N m,UP *r);
2252: void fft_mulup_specialmod_main(UP n1,UP n2,int dbd,int *modind,int nmod,UP *nr);
2253: void divn(N n1,N n2,N *nq,N *nr);
2254: void divsn(N n1,N n2,N *nq);
2255: void remn(N n1,N n2,N *nr);
2256: void remn_special(N a,N d,int bits,unsigned int lower,N *b);
2257: void mulin(N n,unsigned int d,unsigned int *p);
2258: unsigned int divin(N n,unsigned int dvr,N *q);
2259: void bprintn(N n);
2260: void bxprintn(N n);
2261: void muln(N n1,N n2,N *nr);
2262: void _muln(N n1,N n2,N nr);
2263: void muln_1(unsigned int *p,int s,unsigned int d,unsigned int *r);
2264: void divnmain(int d1,int d2,unsigned int *m1,unsigned int *m2,unsigned int *q);
2265: void divnmain_special(int d1,int d2,unsigned int *m1,unsigned int *m2,unsigned int *q);
2266: unsigned int divn_1(unsigned int *p,int s,unsigned int d,unsigned int *r);
2267: void addn(N n1,N n2,N *nr);
2268: int subn(N n1,N n2,N *nr);
2269: void _addn(N n1,N n2,N nr);
2270: int _subn(N n1,N n2,N nr);
2271: void addarray_to(unsigned int *a1,int n1,unsigned int *a2,int n2);
2272: void pwrn(N n,int e,N *nr);
2273: void gcdn(N n1,N n2,N *nr);
2274: void gcdEuclidn(N n1,N n2,N *nr);
2275: int cmpn(N n1,N n2);
2276: void bshiftn(N n,int b,N *r);
2277: void shiftn(N n,int w,N *r);
2278: void randomn(int bits,N *r);
2279: void freen(N n);
2280: int n_bits(N n);
2281: void fft_mulup_lm(UP n1,UP n2,UP *nr);
2282: void fft_squareup_lm(UP n1,UP *nr);
2283: void trunc_fft_mulup_lm(UP n1,UP n2,int dbd,UP *nr);
2284: void crup_lm(ModNum **f,int d,int *mod,int index,N m,N lm_mod,UP *r);
2285: void fft_rembymulup_special_lm(UP n1,UP n2,UP inv2,UP *nr);
2286: void uptolmup(UP n,UP *nr);
2287: void save_up(UP obj,char *name);
2288: void hybrid_powermodup(UP f,UP *xp);
2289: void powermodup(UP f,UP *xp);
2290: void hybrid_generic_powermodup(UP g,UP f,Q d,UP *xp);
2291: void generic_powermodup(UP g,UP f,Q d,UP *xp);
2292: void hybrid_powertabup(UP f,UP xp,UP *tab);
2293: void powertabup(UP f,UP xp,UP *tab);
2294: void squarep_gf2n(VL vl,P n1,P *nr);
2295: void squareup_gf2n(UP n1,UP *nr);
2296: void powermodup_gf2n(UP f,UP *xp);
2297: void generic_powermodup_gf2n(UP g,UP f,Q d,UP *xp);
2298: void tracemodup_gf2n(UP g,UP f,Q d,UP *xp);
2299: void tracemodup_gf2n_slow(UP g,UP f,Q d,UP *xp);
2300: void tracemodup_gf2n_tab(UP g,UP f,Q d,UP *xp);
2301: void square_rem_tab_up_gf2n(UP f,UP *tab,UP *rp);
2302: void powertabup_gf2n(UP f,UP xp,UP *tab);
2303: void find_root_gf2n(UP f,GF2N *r);
2304: void ptoup2(P n,UP2 *nr);
2305: void ptoup2_sparse(P n,UP2 *nr);
2306: void up2top(UP2 n,P *nr);
2307: void up2tovect(UP2 n,VECT *nr);
2308: void up2ton(UP2 p,Q *n);
2309: void ntoup2(Q n,UP2 *p);
2310: void gen_simpup2(UP2 p,GEN_UP2 m,UP2 *r);
2311: void gen_simpup2_destructive(UP2 p,GEN_UP2 m);
2312: void gen_invup2(UP2 p,GEN_UP2 m,UP2 *r);
2313: void gen_pwrmodup2(UP2 a,Q b,GEN_UP2 m,UP2 *c);
2314: void simpup2(UP2 p,UP2 m,UP2 *r);
2315: int degup2(UP2 a);
2316: int degup2_sparse(UP2 a);
2317: int degup2_1(unsigned int a);
2318: void addup2(UP2 a,UP2 b,UP2 *c);
2319: void subup2(UP2 a,UP2 b,UP2 *c);
2320: void _mulup2_1(UP2 a,unsigned int b,UP2 c);
2321: void _mulup2_h(UP2 a,unsigned int b,UP2 c);
2322: void mulup2(UP2 a,UP2 b,UP2 *c);
2323: void _kmulup2_(unsigned int *a,unsigned int *b,int w,unsigned int *c);
2324: void _mulup2_nn(unsigned int *a,unsigned int *b,int w,unsigned int *c);
2325: void _mulup2(UP2 a,UP2 b,UP2 c);
2326: void _mulup2_(_UP2 a,_UP2 b,_UP2 c);
2327: void squareup2(UP2 n,UP2 *nr);
2328: void _squareup2(UP2 n,UP2 nr);
2329: void _adjup2(UP2 n);
2330: void _adjup2_(_UP2 n);
2331: void _addup2(UP2 a,UP2 b,UP2 c);
2332: void _addup2_destructive(UP2 a,UP2 b);
2333: void _addup2_(_UP2 a,_UP2 b,_UP2 c);
2334: void _addtoup2_(_UP2 a,_UP2 b);
2335: unsigned int mulup2_bb(unsigned int a,unsigned int b);
2336: void init_up2_tab();
2337: void divup2_1(unsigned int a1,unsigned int a2,int e1,int e2,unsigned int *qp,unsigned int *rp);
2338: void qrup2(UP2 a,UP2 b,UP2 *q,UP2 *r);
2339: void _qrup2(UP2 a,UP2 b,UP2 q,UP2 r);
2340: void remup2(UP2 a,UP2 b,UP2 *c);
2341: void _remup2(UP2 a,UP2 b,UP2 c);
2342: void remup2_sparse(UP2 a,UP2 b,UP2 *c);
2343: void remup2_sparse_destructive(UP2 a,UP2 b);
2344: void remup2_type1_destructive(UP2 a,int d);
2345: void remup2_3_destructive(UP2 a,UP2 b);
2346: void remup2_5_destructive(UP2 a,UP2 b);
2347: void _invup2_1(unsigned int f1,unsigned int f2,unsigned int *a1,unsigned int *b1);
2348: void _gcdup2_1(unsigned int f1,unsigned int f2,unsigned int *gcd);
2349: void up2_init_eg();
2350: void up2_show_eg();
2351: void invup2(UP2 a,UP2 m,UP2 *inv);
2352: void gcdup2(UP2 a,UP2 m,UP2 *gcd);
2353: void chsgnup2(UP2 a,UP2 *c);
2354: void pwrmodup2(UP2 a,Q b,UP2 m,UP2 *c);
2355: void pwrmodup2_sparse(UP2 a,Q b,UP2 m,UP2 *c);
2356: int compup2(UP2 n1,UP2 n2);
2357: void _copyup2(UP2 n,UP2 r);
2358: void _bshiftup2(UP2 n,int b,UP2 r);
2359: void _bshiftup2_destructive(UP2 n,int b);
2360: void diffup2(UP2 f,UP2 *r);
2361: int sqfrcheckup2(UP2 f);
2362: int irredcheckup2(UP2 f);
2363: int irredcheck_dddup2(UP2 f);
2364: void _copy_up2bits(UP2 p,unsigned int **mat,int pos);
2365: int compute_multiplication_matrix(P p0,GF2MAT *mp);
2366: void compute_change_of_basis_matrix(P p0,P p1,int to,GF2MAT *m01,GF2MAT *m10);
2367: void compute_change_of_basis_matrix_with_root(P p0,P p1,int to,GF2N root,GF2MAT *m01,GF2MAT *m10);
2368: int compute_representation_conversion_matrix(P p0,GF2MAT *np,GF2MAT *pn);
2369: void mul_nb(GF2MAT mat,unsigned int *a,unsigned int *b,unsigned int *c);
2370: void leftshift(unsigned int *a,int n);
2371: void mat_to_gf2mat(MAT a,unsigned int ***b);
2372: void gf2mat_to_mat(unsigned int **a,int n,MAT *b);
2373: void mulgf2mat(int n,unsigned int **a,unsigned int **b,unsigned int **c);
2374: void mulgf2vectmat(int n,unsigned int *a,unsigned int **b,unsigned int *c);
2375: int mulgf2vectvect(int n,unsigned int *a,unsigned int *b);
2376: int invgf2mat(int n,unsigned int **a,unsigned int **b);
2377: void _mulup2_22(unsigned int *a1,unsigned int *a2,unsigned int *ar);
2378: void _mulup2_33(unsigned int *a1,unsigned int *a2,unsigned int *ar);
2379: void _mulup2_44(unsigned int *a1,unsigned int *a2,unsigned int *ar);
2380: void _mulup2_55(unsigned int *a1,unsigned int *a2,unsigned int *ar);
2381: void _mulup2_66(unsigned int *a1,unsigned int *a2,unsigned int *ar);
2382: void type1_bin_invup2(UP2 a,int n,UP2 *inv);
2383: UP2 *compute_tab_gf2n(UP2 f);
2384: UP compute_trace_gf2n(UP2 *tab,GF2N c,int n);
2385: void up2toup(UP2 f,UP *r);
2386: void find_root_up2(UP2 f,GF2N *r);
2387: void addq(Q n1,Q n2,Q *nr);
2388: void subq(Q n1,Q n2,Q *nr);
2389: void mulq(Q n1,Q n2,Q *nr);
2390: void divq(Q n1,Q n2,Q *nq);
2391: void divsq(Q n1,Q n2,Q *nq);
2392: void invq(Q n,Q *nr);
2393: void chsgnq(Q n,Q *nr);
2394: void pwrq(Q n1,Q n,Q *nr);
2395: int cmpq(Q q1,Q q2);
2396: void remq(Q n,Q m,Q *nr);
2397: void mkbc(int n,Q *t);
2398: void mkwc(int k,int l,Q *t);
2399: void mkwcm(int k,int l,int m,int *t);
2400: void factorial(int n,Q *r);
2401: void invl(Q a,Q mod,Q *ar);
2402: void kmuln(N n1,N n2,N *nr);
2403: void extractn(N n,int index,int len,N *nr);
2404: void copyn(N n,int len,int *p);
2405: void dupn(N n,N p);
2406: void kmulnmain(N n1,N n2,N *nr);
2407: void plisttop(P *f,V v,int n,P *gp);
2408: int divtp(VL vl,P p1,P p2,P *q);
2409: int divtdcp(VL vl,P p1,P p2,P *q);
2410: int divtpz(VL vl,P p1,P p2,P *q);
2411: int divtdcpz(VL vl,P p1,P p2,P *q);
2412: void udivpz(P f1,P f2,P *fqp,P *frp);
2413: void udivpwm(Q mod,P p1,P p2,P *q,P *r);
2414: void udivpzwm(Q mod,P f1,P f2,P *fqp,P *frp);
2415: void henmv(VL vl,VN vn,P f,P g0,P h0,P a0,P b0,P lg,P lh,P lg0,P lh0,Q q,int k,P *gp,P *hp);
2416: void henmvmain(VL vl,VN vn,P f,P fi0,P fi1,P gi0,P gi1,P l0,P l1,Q mod,Q mod2,int k,P *fr0,P *fr1);
2417: void henzq(P f,P i0,UM fi0,P i1,UM fi1,int p,int k,P *fr0p,P *fr1p,P *gr0p,P *gr1p,Q *qrp);
2418: void henzq1(P g,P h,Q bound,P *gcp,P *hcp,Q *qp);
2419: void addm2p(VL vl,Q mod,Q mod2,P n1,P n2,P *nr);
2420: void subm2p(VL vl,Q mod,Q mod2,P n1,P n2,P *nr);
2421: void mulm2p(VL vl,Q mod,Q mod2,P n1,P n2,P *nr);
2422: void cmp(Q mod,P p,P *pr);
2423: void cm2p(Q mod,Q m,P p,P *pr);
2424: void addm2q(Q mod,Q mod2,Q n1,Q n2,Q *nr);
2425: void subm2q(Q mod,Q mod2,Q n1,Q n2,Q *nr);
2426: void mulm2q(Q mod,Q mod2,Q n1,Q n2,Q *nr);
2427: void rem2q(Q n,Q m,Q m2,Q *nr);
2428: void exthpc_generic(VL vl,P p,int d,V v,P *pr);
2429: void exthp(VL vl,P p,int d,P *pr);
2430: void exthpc(VL vl,V v,P p,int d,P *pr);
2431: void cbound(VL vl,P p,Q *b);
2432: int geldb(VL vl,P p);
2433: int getdeg(V v,P p);
2434: void cmax(P p,Q *b);
2435: int nextbin(VN vn,int n);
2436: void mulsgn(VN vn,VN vnt,int n,VN vn1);
2437: void next(VN vn);
2438: void clctv(VL vl,P p,VL *nvlp);
2439: void markv(VN vn,int n,P p);
2440: void vntovl(VN vn,int n,VL *vlp);
2441: int dbound(V v,P f);
2442: int homdeg(P f);
2443: int minhomdeg(P f);
2444: void adjc(VL vl,P f,P a,P lc0,Q q,P *fr,P *ar);
2445: void affinemain(VL vl,P p,V v0,int n,P *pl,P *pr);
2446: void restore(VL vl,P f,VN vn,P *fr);
2447: void mergev(VL vl,VL vl1,VL vl2,VL *nvlp);
2448: void substvp(VL vl,P f,VN vn,P *g);
2449: void affine(VL vl,P f,VN vn,P *fr);
2450: void addnum(VL vl,Num a,Num b,Num *c);
2451: void subnum(VL vl,Num a,Num b,Num *c);
2452: void mulnum(VL vl,Num a,Num b,Num *c);
2453: void divnum(VL vl,Num a,Num b,Num *c);
2454: void pwrnum(VL vl,Num a,Num b,Num *c);
2455: void chsgnnum(Num a,Num *c);
2456: int compnum(VL vl,Num a,Num b);
2457: void one_ff(Num *c);
2458: int negative_number(Num c);
2459: void simp_ff(Obj p,Obj *rp);
2460: void field_order_ff(N *order);
2461: int fft_available(int d1,int n1,int d2,int n2);
2462: void get_fft_prime(int index,int *p,int *d);
2463: void nglob_init();
2464: void get_eg(struct oEGT *p);
2465: void init_eg(struct oEGT *eg);
2466: void add_eg(struct oEGT *base,struct oEGT *start,struct oEGT *end);
2467: void print_eg(char *item,struct oEGT *eg);
2468: void print_split_eg(struct oEGT *start,struct oEGT *end);
2469: void print_split_e(struct oEGT *start,struct oEGT *end);
2470: void suspend_timer() ;
2471: void resume_timer() ;
2472: void reset_engine() ;
2473: unsigned int get_asir_version() ;
2474: char *get_asir_distribution();
2475: void create_error(ERR *err,unsigned int serial,char *msg);
2476: void init_lprime();
2477: int get_lprime(int index);
2478: void create_new_lprimes(int index);
2479: void reorderp(VL nvl,VL ovl,P p,P *pr);
2480: void substp(VL vl,P p,V v0,P p0,P *pr);
2481: void detp(VL vl,P **rmat,int n,P *dp);
2482: void invmatp(VL vl,P **rmat,int n,P ***imatp,P *dnp);
2483: void reordvar(VL vl,V v,VL *nvlp);
2484: void gcdprsp(VL vl,P p1,P p2,P *pr);
2485: void gcdcp(VL vl,P p,P *pr);
2486: void sprs(VL vl,V v,P p1,P p2,P *pr);
2487: void resultp(VL vl,V v,P p1,P p2,P *pr);
2488: void srch2(VL vl,V v,P p1,P p2,P *pr);
2489: void srcr(VL vl,V v,P p1,P p2,P *pr);
2490: void res_ch_det(VL vl,V v,P p1,P p2,P *pr);
2491: void res_detmp(VL vl,int mod,V v,P p1,P p2,P *dp);
2492: void premp(VL vl,P p1,P p2,P *pr);
2493: void ptozp0(P p,P *pr);
2494: void mindegp(VL vl,P p,VL *mvlp,P *pr);
2495: void maxdegp(VL vl,P p,VL *mvlp,P *pr);
2496: void min_common_vars_in_coefp(VL vl,P p,VL *mvlp,P *pr);
2497: void minlcdegp(VL vl,P p,VL *mvlp,P *pr);
2498: void sort_by_deg(int n,P *p,P *pr);
2499: void sort_by_deg_rev(int n,P *p,P *pr);
2500: void getmindeg(V v,P p,Q *dp);
2501: void minchdegp(VL vl,P p,VL *mvlp,P *pr);
2502: int getchomdeg(V v,P p);
2503: int getlchomdeg(V v,P p,int *d);
2504: int nmonop(P p);
2505: int qpcheck(Obj p);
2506: int uzpcheck(Obj p);
2507: int p_mag(P p);
2508: int maxblenp(P p);
2509: void berle(int index,int count,P f,ML *listp);
2510: int berlecnt(int mod,UM f);
2511: int berlecntmain(int mod,int n,int m,int **c);
2512: UM *berlemain(int mod,UM f,UM *fp);
2513: void hensel(int index,int count,P f,ML *listp);
2514: void hensel2(int index,int count,P f,ML *listp);
2515: void henmain2(LUM f,UM g0,UM h0,UM a0,UM b0,int m,int bound,LUM *gp);
2516: void clearlum(int n,int bound,LUM f);
2517: void addtolum(int m,int bound,LUM f,LUM g);
2518: void hsq(int index,int count,P f,int *nindex,DCP *dcp);
2519: void gcdgen(P f,ML blist,ML *clistp);
2520: void henprep2(int mod,int q,int k,UM f,UM g,UM h,UM qg,UM qh,UM qa,UM qb);
2521: void henprep(P f,ML blist,ML clist,ML *bqlistp,ML *cqlistp);
2522: void henmain(LUM f,ML bqlist,ML cqlist,ML *listp);
2523: int mignotte(int q,P f);
2524: int mig(int q,int d,P f);
2525: void sqad(unsigned int man,int exp);
2526: void ptolum(int q,int bound,P f,LUM fl);
2527: void modfctrp(P p,int mod,int flag,DCP *dcp);
2528: void gensqfrum(int mod,UM p,struct oDUM *dc);
2529: void ddd(int mod,UM f,UM *r);
2530: void canzas(int mod,UM f,int d,UM *base,UM *r);
2531: void randum(int mod,int d,UM p);
2532: void pwrmodum(int mod,UM p,int e,UM f,UM pr);
2533: void spwrum(int mod,UM m,UM *base,UM f,N e,UM r);
2534: void spwrum0(int mod,UM m,UM f,N e,UM r);
2535: void mult_mod_tab(UM p,int mod,UM *tab,UM r,int d);
2536: void make_qmat(UM p,int mod,UM *tab,int ***mp);
2537: void null_mod(int **mat,int mod,int n,int *ind);
2538: void null_to_sol(int **mat,int *ind,int mod,int n,UM *r);
2539: void newddd(int mod,UM f,UM *r);
2540: int nfctr_mod(UM f,int mod);
2541: int irred_check(UM f,int mod);
2542: int berlekamp(UM p,int mod,int df,UM *tab,UM *r);
2543: void minipoly_mod(int mod,UM f,UM p,UM mp);
2544: void lnf_mod(int mod,int n,UM p0,UM p1,struct p_pair *list,UM np0,UM np1);
2545: void showum(UM p);
2546: void showumat(int **mat,int n);
2547: int find_root(int mod,UM p,int *root);
2548: void fctrp(VL vl,P f,DCP *dcp);
2549: void fctr_wrt_v_p(VL vl,P f,V v,DCP *dcp);
2550: void homfctr(VL vl,P g,DCP *dcp);
2551: void mfctr(VL vl,P f,DCP *dcp);
2552: void mfctr_wrt_v(VL vl,P f,V v,DCP *dcp);
2553: void adjsgn(P p,DCP dc);
2554: int headsgn(P p);
2555: void fctrwithmvp(VL vl,P f,V v,DCP *dcp);
2556: void mfctrwithmv(VL vl,P f,V v,DCP *dcp);
2557: void ufctr(P f,int hint,DCP *dcp);
2558: void mfctrmain(VL vl,P p,DCP *dcp);
2559: void ufctrmain(P p,int hint,DCP *dcp);
2560: void cycm(V v,int n,DCP *dcp);
2561: void cycp(V v,int n,DCP *dcp);
2562: void calcphi(V v,int n,struct oMF *mfp);
2563: void mkssum(V v,int e,int s,int sgn,P *r);
2564: int iscycp(P f);
2565: int iscycm(P f);
2566: void sortfs(DCP *dcp);
2567: void sortfsrev(DCP *dcp);
2568: void nthrootchk(P f,struct oDUM *dc,ML fp,DCP *dcp);
2569: void sqfrp(VL vl,P f,DCP *dcp);
2570: void msqfr(VL vl,P f,DCP *dcp);
2571: void usqp(P f,DCP *dcp);
2572: void msqfrmain(VL vl,P p,DCP *dcp);
2573: void msqfrmainmain(VL vl,P p,VN vn,P p0,DCP dc0,DCP *dcp,P *pp);
2574: void mfctrhen2(VL vl,VN vn,P f,P f0,P g0,P h0,P lcg,P lch,P *gp);
2575: int sqfrchk(P p);
2576: int cycchk(P p);
2577: int zerovpchk(VL vl,P p,VN vn);
2578: int valideval(VL vl,DCP dc,VN vn);
2579: void estimatelc(VL vl,Q c,DCP dc,VN vn,P *lcp);
2580: void monomialfctr(VL vl,P p,P *pr,DCP *dcp);
2581: void afctr(VL vl,P p0,P p,DCP *dcp);
2582: void afctrmain(VL vl,P p0,P p,int init,DCP *dcp);
2583: int divtmp(VL vl,int mod,P p1,P p2,P *q);
2584: int divtdcmp(VL vl,int mod,P p1,P p2,P *q);
2585: void GC_gcollect();
1.55 saito 2586:
2587: /* IMAT */
2588: void Pnewimat(NODE, IMAT *);
2589: void PChsgnI(NODE, IMAT *);
2590: void Pm2Im(NODE, IMAT *);
2591: void PIm2m(NODE, MAT *);
2592:
2593: void AddMatI(VL, IMAT, IMAT, IMAT *);
2594: void MulMatI(VL, IMAT, IMAT, IMAT *);
2595: void MulMatG(VL, Obj, Obj, Obj *);
2596: void MulrMatI(VL, Obj, Obj, Obj *);
2597: void MulMatS(VL, IMAT, IMAT, IMAT *);
2598: void PutIent(IMAT, int, int, Obj);
2599: void GetIent(IMAT, int, int, Obj);
2600: void GetIbody(IMAT, int, int, Obj *);
2601: void ChsgnI(IMAT, IMAT *c);
2602: void AppendIent(IMAT, int, int, Obj);
2603: void MEnt(int, int, int, Obj, IENT *);
2604: void GetForeIent(IMATC *, IENT *, int *);
2605: void GetNextIent(IMATC *, IENT *, int *);
2606: void SubMatI(VL, IMAT, IMAT, IMAT *);
2607: /* IMAT */
1.52 noro 2608:
2609: Z stoz(int c);
2610: Z utoz(unsigned int c);
2611: Z qtoz(Q n);
2612: Q ztoq(Z n);
2613: Z chsgnz(Z n);
2614: Z simpz(Z n);
2615: Z dupz(Z n);
2616: Z absz(Z n);
2617: Z addz(Z n1,Z n2);
2618: Z subz(Z n1,Z n2);
2619: Z mulz(Z n1,Z n2);
2620: Z divsz(Z n1,Z n2);
2621: Z divz(Z n1,Z n2,Z *rem);
2622: Z gcdz(Z n1,Z n2);
2623: Z gcdz_cofactor(Z n1,Z n2,Z *c1,Z *c2);
2624: Z estimate_array_gcdz(Z *a,int n);
2625: Z array_gcdz(Z *a,int n);
2626: void mkwcz(int k,int l,Z *t);
2627: int remzi(Z n,int m);
2628:
1.1 noro 2629:
2630: #if 0 && !defined(VISUAL)
2631: void bzero(const void *,int);
2632: void bcopy(const void *,void *,int);
2633: char *index(char *,int);
2634: #endif
1.61 ! noro 2635:
! 2636: void chsgnnbp(NBP p,NBP *rp);
! 2637: void subnbp(VL vl,NBP p1,NBP p2, NBP *rp);
! 2638: void addnbp(VL vl,NBP p1,NBP p2, NBP *rp);
! 2639: void mulnbp(VL vl,NBP p1,NBP p2, NBP *rp);
! 2640: void pwrnbp(VL vl,NBP p1,Q n, NBP *rp);
FreeBSD-CVSweb <freebsd-cvsweb@FreeBSD.org>
![[BACK]](/icons/cvsweb/back.gif){kind=icon}
Return to ca.h CVS log ![[TXT]](/icons/cvsweb/text.gif){kind=icon}
![[DIR]](/icons/cvsweb/dir.gif){kind=icon}
Up to [local] / OpenXM_contrib2 / asir2000 / include