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