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