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