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