Annotation of OpenXM_contrib2/asir2000/parse/parse.h, Revision 1.37
1.3 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.4 noro 26: * e-mail at risa-admin@sec.flab.fujitsu.co.jp of the detailed specification
1.3 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.37 ! noro 48: * $OpenXM: OpenXM_contrib2/asir2000/parse/parse.h,v 1.36 2005/08/25 18:59:11 ohara Exp $
1.3 noro 49: */
1.6 noro 50: # if defined(VISUAL)
1.1 noro 51: #include <time.h>
52: #else
53: #include <sys/time.h>
54: #include <sys/resource.h>
55: #endif
56: #include <setjmp.h>
57: #ifdef ABS
58: #undef ABS
59: #define ABS(a) ((a)>0?(a):-(a))
60: #endif
61:
62: /* identifiers for expressions */
63:
64: typedef enum {
65: I_BOP, I_COP, I_AND, I_OR, I_NOT, I_CE,
66: I_PRESELF, I_POSTSELF,
1.10 noro 67: I_FUNC, I_FUNC_OPT, I_IFUNC, I_MAP, I_RECMAP, I_PFDERIV,
1.1 noro 68: I_ANS, I_PVAR, I_ASSPVAR,
69: I_FORMULA, I_LIST, I_STR, I_NEWCOMP, I_CAR, I_CDR, I_CAST,
1.31 noro 70: I_INDEX, I_EV, I_TIMER, I_GF2NGEN, I_GFPNGEN, I_GFSNGEN,
71: I_LOP, I_OPT, I_GETOPT, I_POINT, I_PAREN, I_MINUS,
1.37 ! noro 72: I_NARYOP, I_UNIFY
1.1 noro 73: } fid;
74:
75: /* identifiers for statements */
76:
77: typedef enum {
78: S_BP, S_PFDEF,
79: S_SINGLE, S_CPLX,
80: S_IFELSE, S_FOR, S_DO,
1.35 noro 81: S_BREAK, S_RETURN, S_CONTINUE,
82: S_MODULE
1.1 noro 83: } sid;
84:
85: /* identifiers for comparison operators */
86:
87: typedef enum { C_LT, C_GT, C_LE, C_GE, C_EQ, C_NE } cid;
88:
89: /* identifiers for logical operators */
90:
91: typedef enum { L_LT, L_GT, L_LE, L_GE, L_EQ, L_NE, L_AND, L_OR, L_NOT, L_IMPL, L_REPL, L_EQUIV } lid;
92:
93: /* identifiers for functions */
94:
95: typedef enum { A_UNDEF, A_BIN, A_USR, A_PURE, A_PARI } aid;
96:
97: /* identifiers for indeterminates */
98:
99: typedef enum { V_IND, V_UC, V_PF, V_SR } vid;
100:
1.18 noro 101: typedef struct oVS {
1.1 noro 102: unsigned int n;
103: unsigned int asize;
104: unsigned int at;
105: unsigned int level;
106: struct oFUNC *usrf;
107: struct oPV *va;
108: NODE opt;
1.18 noro 109: } *VS;
1.1 noro 110:
1.18 noro 111: typedef struct oMODULE {
112: char *name;
113: VS pvs;
1.20 noro 114: NODE usrf_list;
1.18 noro 115: } *MODULE;
1.1 noro 116:
1.18 noro 117: typedef struct oPV {
1.1 noro 118: char *name;
119: short attr,type;
120: pointer priv;
1.18 noro 121: } *PV;
1.1 noro 122:
1.18 noro 123: typedef struct oINFILE {
1.1 noro 124: char *name;
125: FILE *fp;
126: int ln;
1.15 noro 127: struct oINFILE *next;
1.1 noro 128: char *tname;
129: int encoded;
130: short vol;
1.18 noro 131: } *INFILE;
1.1 noro 132:
133: struct oTKWD {
134: char *name;
135: int token;
136: };
1.32 noro 137:
138: typedef struct fid_spec {
139: fid id;
140: farg_type type[10];
141: } *fid_spec_p;
1.1 noro 142:
1.18 noro 143: typedef struct oARF {
1.1 noro 144: char *name;
145: void (*fp)();
1.18 noro 146: } *ARF;
1.1 noro 147:
1.18 noro 148: typedef struct oFUNC {
1.20 noro 149: char *name,*fullname;
1.1 noro 150: int argc;
151: int type;
1.33 noro 152: int secure;
1.1 noro 153: aid id;
154: union {
155: void (*binf)();
156: struct oUSRF *usrf;
157: struct oPF *puref;
158: } f;
1.18 noro 159: } *FUNC;
1.1 noro 160:
1.18 noro 161: typedef struct oUSRF {
1.1 noro 162: char *fname;
1.18 noro 163: MODULE module;
1.1 noro 164: int startl,endl;
165: NODE args;
166: VS pvs;
167: char *desc;
168: struct oSNODE *body;
1.18 noro 169: } *USRF;
1.1 noro 170:
1.18 noro 171: typedef struct oPF {
1.1 noro 172: char *name;
173: int argc;
174: Obj body;
175: V *args;
176: Obj *deriv;
177: NODE ins;
178: int (*pari)();
179: double (*libm)();
180: int (*simplify)();
1.18 noro 181: } *PF;
1.1 noro 182:
1.18 noro 183: typedef struct oPFAD {
1.1 noro 184: Obj arg;
185: int d;
1.18 noro 186: } *PFAD;
1.1 noro 187:
1.18 noro 188: typedef struct oPFINS {
1.1 noro 189: struct oPF *pf;
190: struct oPFAD ad[1];
1.18 noro 191: } *PFINS;
1.1 noro 192:
193: #define NEWPF(p) ((p)=(PF)MALLOC(sizeof(struct oPF)))
194:
1.18 noro 195: typedef struct oFNODE {
1.1 noro 196: fid id;
197: pointer arg[1];
1.18 noro 198: } *FNODE;
1.1 noro 199:
200: #define NEWFNODE(a,b) \
201: ((a)=(FNODE)MALLOC(sizeof(struct oFNODE)+sizeof(pointer)*(b-1)))
202:
1.18 noro 203: typedef struct oSNODE {
1.1 noro 204: sid id;
205: int ln;
206: pointer arg[1];
1.18 noro 207: } *SNODE;
1.1 noro 208:
209: #define NEWSNODE(a,b) \
210: ((a)=(SNODE)MALLOC(sizeof(struct oSNODE)+sizeof(pointer)*(b-1)),(a)->ln=asir_infile->ln)
211:
1.18 noro 212: typedef struct oPVI {
1.1 noro 213: int pv;
214: NODE index;
1.18 noro 215: } *PVI;
1.1 noro 216:
1.18 noro 217: typedef struct oNODE2 {
1.1 noro 218: pointer body1,body2;
219: struct oNODE2 *next;
1.18 noro 220: } *NODE2;
1.1 noro 221:
222: struct ftab {
223: char *name;
224: void (*f)();
225: int argc;
226: };
227:
228: #define MKPVI(a,b,c)\
229: ((a)=(pointer)MALLOC(sizeof(struct oPVI)),((PVI)(a))->pv=(b),((PVI)(a))->index=(c))
230:
231: #define FA0(f) ((f)->arg[0])
232: #define FA1(f) ((f)->arg[1])
233: #define FA2(f) ((f)->arg[2])
234: #define FA3(f) ((f)->arg[3])
235: #define FA4(f) ((f)->arg[4])
236: #define FA5(f) ((f)->arg[5])
237: #define FA6(f) ((f)->arg[6])
238:
239: #define ARG0(a) ((a)->body)
240: #define ARG1(a) (NEXT(a)->body)
241: #define ARG2(a) (NEXT(NEXT(a))->body)
242: #define ARG3(a) (NEXT(NEXT(NEXT(a)))->body)
243: #define ARG4(a) (NEXT(NEXT(NEXT(NEXT((a)))))->body)
244: #define ARG5(a) (NEXT(NEXT(NEXT(NEXT(NEXT((a))))))->body)
245: #define ARG6(a) (NEXT(NEXT(NEXT(NEXT(NEXT(NEXT((a)))))))->body)
246: #define ARG7(a) (NEXT(NEXT(NEXT(NEXT(NEXT(NEXT(NEXT((a))))))))->body)
247: #define ARG8(a) (NEXT(NEXT(NEXT(NEXT(NEXT(NEXT(NEXT(NEXT((a)))))))))->body)
248: #define ARG9(a) (NEXT(NEXT(NEXT(NEXT(NEXT(NEXT(NEXT(NEXT(NEXT((a))))))))))->body)
249: #define ARG10(a) (NEXT(NEXT(NEXT(NEXT(NEXT(NEXT(NEXT(NEXT(NEXT(NEXT((a)))))))))))->body)
250:
251: #define asir_assert(ptr,id,message)\
252: switch ( id ) {\
253: case O_N: case O_P: case O_R:\
254: if( (ptr) && (OID(ptr) > (id)) ) {\
255: fprintf(stderr,message);\
256: error(" : invalid argument");\
257: }\
258: break;\
259: case O_DP:\
260: if( (ptr) && (OID(ptr) != (id)) ) {\
261: fprintf(stderr,message);\
262: error(" : invalid argument");\
263: }\
264: break;\
265: default:\
266: if( !(ptr) || (OID(ptr) != (id)) ) {\
267: fprintf(stderr,message);\
268: error(" : invalid argument");\
269: }\
270: break;\
271: }
272:
273: #define DEFSIZE 32
1.18 noro 274: #define PVGLOBAL(i) (((unsigned int)(i))|(1<<30))
275: #define PVMGLOBAL(i) (((unsigned int)(i))|(3<<30))
276: #define PVATTR(i) (((unsigned int)(i))>>30)
277: #define PVIND(i) (((unsigned int)(i))&0x3fffffff)
1.1 noro 278: #define GETPV(i,p) \
1.18 noro 279: (PVATTR(i)==0?(int)((p)=CPVS->va[(unsigned int)(i)].priv)\
280: :PVATTR(i)==1?(int)((p)=GPVS->va[PVIND(i)].priv)\
281: :(int)((p)=MPVS->va[PVIND(i)].priv))
282: #define GETPVREF(i,p) \
283: (PVATTR(i)==0?(int)((p)=&(CPVS->va[(unsigned int)(i)].priv))\
284: :PVATTR(i)==1?(int)((p)=&(GPVS->va[PVIND(i)].priv))\
285: :(int)((p)=&(MPVS->va[PVIND(i)].priv)))
1.13 noro 286: #define GETPVNAME(i,p) \
1.18 noro 287: (PVATTR(i)==0?(int)((p)=CPVS->va[(unsigned int)(i)].name)\
288: :PVATTR(i)==1?(int)((p)=GPVS->va[PVIND(i)].name)\
289: :(int)((p)=MPVS->va[PVIND(i)].name))
1.1 noro 290: #define ASSPV(i,p) \
1.18 noro 291: (PVATTR(i)==0?(int)(CPVS->va[(unsigned int)(i)].priv=(pointer)(p))\
292: :PVATTR(i)==1?(int)(GPVS->va[PVIND(i)].priv=(pointer)(p))\
293: :(int)(MPVS->va[PVIND(i)].priv=(pointer)(p)))
1.1 noro 294:
295: #define NEWNODE2(a) ((a)=(NODE2)MALLOC(sizeof(struct oNODE2)))
296: #define MKNODE2(a,b,c,d) \
297: (NEWNODE2(a),(a)->body1=(pointer)b,(a)->body2=(pointer)c,NEXT(a)=(NODE2)(d))
298: #define BDY1(a) ((a)->body1)
299: #define BDY2(a) ((a)->body2)
300:
1.18 noro 301: extern VS GPVS,CPVS,EPVS,APVS,MPVS;
302: extern MODULE CUR_MODULE;
303: extern NODE MODULE_LIST;
1.19 noro 304: extern char *CUR_FUNC;
1.1 noro 305: extern ARF addfs, subfs, mulfs, divfs, remfs, pwrfs;
1.15 noro 306: extern INFILE asir_infile;
1.1 noro 307: extern NODE usrf,sysf,noargsysf,ubinf,parif,ONENODE;
308: extern int nextbp,nextbplevel;
309: extern int Verbose;
1.23 ohara 310: extern int do_quiet;
1.27 noro 311: extern SYMBOL Symbol_grlex, Symbol_glex, Symbol_lex;
1.30 noro 312: extern NODE current_option;
1.1 noro 313:
314: #if defined(VISUAL_LIB)
315: #include <w_stdio.h>
316: #undef getc
317: #define getc w_fgetc
318: #undef putc
319: #define putc w_fputc
320: #define fputc w_fputc
321: #define ungetc w_ungetc
322: #define fgets w_fgets
323: #define fputs w_fputs
324: #define printf w_printf
325: #define fprintf w_fprintf
326: #define fflush w_fflush
327: #endif
328:
1.22 noro 329: #if defined(__GNUC__) || defined(VISUAL) || (defined(__MACH__) && defined(__ppc__)) || defined(__FreeBSD__)
1.1 noro 330: NODE mknode(int,...);
331: FNODE mkfnode(int,fid,...);
332: SNODE mksnode(int,sid,...);
333: void call_usrf(FUNC f,...);
334: #else
335: NODE mknode();
336: FNODE mkfnode();
337: SNODE mksnode();
338: void call_usrf();
339: #endif
340:
341: /* prototypes */
342:
1.7 noro 343: void dp_ptozp2_d(DP,DP,DP *,DP *);
344: void dp_ptozp_d(DP,DP *);
1.1 noro 345: void dp_vtod(Q *,DP,DP *);
346: void dp_idivv_hist(Q,DP *);
347: void dp_igcdv_hist(DP,Q *);
1.36 ohara 348: void dp_ptozp3(DP,Q *,DP *);
1.1 noro 349: void dp_ptozp2(DP,DP,DP *,DP *);
350: void dp_ptozp(DP,DP *);
351: void dp_nf_tab_mod(DP,LIST *,int,DP *);
352: void dp_lnf_mod(DP,DP,NODE,int,DP *,DP *);
353: void insert_to_node(DL,NODE *,int);
354: int _dl_redble(DL,DL,int);
355: void dp_mbase(NODE,NODE *);
356: void dp_dtov(DP,VECT *);
357: void dp_cont(DP,Q *);
358: void dp_idiv(DP,Q,DP *);
359:
360: int dp_nt(DP);
361: void dp_dehomo(DP,DP *);
362: void dp_homo(DP,DP *);
363: DL lcm_of_DL(int,DL,DL,DL);
364: void dp_rest(DP,DP *);
365: void dp_hm(DP,DP *);
366: void dp_sp_mod(DP,DP,int,DP *);
367: void dp_sp(DP,DP,DP *);
1.2 noro 368: void dp_red(DP,DP,DP,DP *,DP *,P *,DP *);
1.1 noro 369: void dp_subd(DP,DP,DP *);
370: void dp_red_mod(DP,DP,DP,int,DP *,DP *,P *);
371: int dp_redble(DP,DP);
372: int comp_nm(Q *,Q *);
373: void dp_true_nf_mod(NODE,DP,DP *,int,int,DP *,P *);
374: void dp_nf_mod(NODE,DP,DP *,int,int,DP *);
375: void dp_nf_mod_qindex(NODE,DP,DP *,int,int,DP *);
376: void dp_nf_ptozp(NODE,DP,DP *,int,int,DP *);
377: void dp_true_nf(NODE,DP,DP *,int,DP *,P *);
378: void dp_nf(NODE,DP,DP *,int,DP *);
379: void dp_rat(DP,DP *);
380: void dp_mod(DP,int,NODE,DP *);
381: void dp_prim_mod(DP,int,DP *);
382: void dp_prim(DP,DP *);
383: void heu_nezgcdnpz(VL,P *,int,P *);
1.24 noro 384: void homogenize_order(struct order_spec *,int,struct order_spec **);
385: int create_order_spec(VL,Obj,struct order_spec **);
1.1 noro 386:
387: int dl_equal(int,DL,DL);
388: void qltozl(Q *,int,Q *);
389: int cmpdl_matrix(int,DL,DL);
390: int cmpdl_order_pair(int,DL,DL);
391: int cmpdl_elim(int,DL,DL);
392: int cmpdl_blexrev(int,DL,DL);
393: int cmpdl_bgradrev(int,DL,DL);
394: int cmpdl_brevrev(int,DL,DL);
395: int cmpdl_brevgradlex(int,DL,DL);
396: int cmpdl_bgradlex(int,DL,DL);
397: int cmpdl_blex(int,DL,DL);
398: int cmpdl_revgradlex(int,DL,DL);
399: int cmpdl_gradlex(int,DL,DL);
400: int cmpdl_revlex(int,DL,DL);
401: int cmpdl_lex(int,DL,DL);
402: int compd(VL,DP,DP);
403: void adddl(int,DL,DL,DL *);
404: void divsdc(VL,DP,P,DP *);
405: void muldc(VL,DP,P,DP *);
406: void muldm(VL,DP,MP,DP *);
407: void muld(VL,DP,DP,DP *);
408: void chsgnd(DP,DP *);
409: void subd(VL,DP,DP,DP *);
410: void addd(VL,DP,DP,DP *);
411: int sugard(MP);
412: void nodetod(NODE,DP *);
413: void dtop(VL,VL,DP,P *);
414: void ptod(VL,VL,P,DP *);
415: void initd(struct order_spec *);
416:
417: int mainparse(SNODE *);
418: int exprparse(FUNC,char *,FNODE *);
419: void output_init(void);
420: void GC_init(void);
421: void env_init(void);
422: void soutput_init(char *);
423: void appendparif(NODE *,char *,int (*)(),int);
424: int mmono(P);
425: void mkpow(VL,Obj,Obj,Obj *);
426: void _printdp(DP);
427: int mt_save(char *);
428: int mt_load(char *);
429: void sortbynm(Q *,int);
430: void iqrv(VECT,Q,LIST *);
431: void igcdv(VECT,Q *);
432: void igcdv_estimate(VECT,Q *);
433: void cpp_main(int,char **);
434: int afternl(void);
435: void glob_init();
436: void input_init(FILE *,char *);
437: void asir_terminate(int);
438: void param_init(void);
439: void sprompt(char *);
1.17 ohara 440: void cppname_init();
1.1 noro 441: void process_args(int,char **);
442: void sig_init(void);
443: void asir_save_handler(void);
444: void asir_set_handler(void);
445: void asir_reset_handler(void);
446: void resetenv(char *);
447: void fatal(int);
448: void restore_handler(void);
449: void resize_buffer(void);
450: void tty_init(void);
451: void tty_reset(void);
452: void set_timer(int);
453: void reset_timer(void);
454: void int_handler(int);
455: void int_handler(int);
456: void segv_handler(int);
457: void bus_handler(int);
458: void fpe_handler(int);
459: void ill_handler(int);
460: void winch_handler(int);
461: void pipe_handler(int);
462: void usr1_handler(int);
463: void alrm_handler(int);
464: void copyright(void);
465: void kan_init(void);
466: void pushpvs(FUNC);
467: void read_eval_loop(void);
468: void prompt(void);
469: void storeans(pointer);
470: int yyparse(void);
471: void nodetod(NODE,DP *);
472: void poppvs(void);
473: int length(NODE);
474: int get_heapsize(void);
475: int searchpvar(char *);
476: void mkparif(char *,FUNC *);
477: void makevar(char *,P *);
1.19 noro 478: void mkpvs(char *);
479: MODULE mkmodule(char *);
1.1 noro 480: void stoarg(char *,int *,char **);
481: void yyerror(char *);
482: void closecurrentinput(void);
483: void asir_terminate(int);
484: void searchasirpath(char *,char **);
485: void get_vars(Obj,VL *);
486: void appendbinf(NODE *,char *,void(*)(),int);
487: void appendubinf(char *,void(*)(),int);
488: void parif_init(void);
489: void sysf_init(void);
490: void makesrvar(FUNC, P *);
491: void sprintexpr(VL,Obj);
492: void printexpr(VL,Obj);
493: void appendvar(VL,V);
494: void change_mvar(VL,P,V,P *);
495: void restore_mvar(VL,P,V,P *);
496: int argc(NODE);
497: void printn(N);
498: void sprintn(N);
499: void printv(VL,V);
500: void sprintv(VL,V);
501: int arf_comp(VL, Obj, Obj);
502: int complist(VL, LIST, LIST);
503: int complist(VL, LIST, LIST);
504: int getcompsize(int);
505: int getpvar(VS,char *,int);
506: int getpvar(VS,char *,int);
507: int gettype(unsigned int);
508: int indextotype(int,int);
509: int loadfile(char *);
510: int loadfiles(NODE);
1.18 noro 511: unsigned int makepvar(char *);
1.1 noro 512: int membertoindex(int,char *);
513: int qcoefp(Obj);
514: int qcoefr(Obj);
515: int rangecheck(Obj,int);
516: int structtoindex(char *);
517: pointer eval(FNODE);
518: pointer evalf(FUNC,FNODE,FNODE);
1.15 noro 519: pointer bevalf(FUNC,NODE);
1.1 noro 520: pointer evalif(FNODE,FNODE);
521: pointer evalnode(NODE node);
522: pointer evalpf(PF,NODE);
523: pointer evalparif(FUNC,NODE);
524: pointer evalpv(int,FNODE,pointer);
525: pointer evalstat(SNODE f);
526: void _mkpfins(PF ,Obj *,V *);
527: void appendpfins(V ,V *);
528: void appenduf(char *,FUNC *);
529: void arf_add(VL, Obj, Obj, Obj *);
530: void arf_chsgn(Obj, Obj *);
531: void arf_div(VL, Obj, Obj, Obj *);
532: void arf_init(void);
533: void arf_mul(VL, Obj, Obj, Obj *);
534: void arf_pwr(VL, Obj, Obj, Obj *);
535: void arf_remain(VL, Obj, Obj, Obj *);
536: void arf_sub(VL, Obj, Obj, Obj *);
537: void bp(SNODE);
538: void clearbp(FUNC);
539: void debug(SNODE);
540: void debug_init(void);
541: void delbp(int, char **);
542: void derivr(VL ,Obj ,V ,Obj *);
543: void derivvar(VL ,V ,V ,Obj *);
544: void duppfins(V ,V *);
545: void error(char *);
546: void evalins(PFINS ,int ,Obj *);
547: void evalnodebody(NODE,NODE *);
548: void evalp(VL ,P ,int ,P *);
549: void evalr(VL ,Obj ,int ,Obj *);
550: void evalv(VL ,V ,int ,Obj *);
551: void getarrayp(Obj,NODE,Obj **);
552: void getmember(FNODE,Obj *);
553: void getmemberp(FNODE,Obj **);
554: void help(char *);
555: void instov(PFINS ,V *);
1.5 noro 556: Obj memberofstruct(COMP,char *);
1.1 noro 557: void mkpf(char *,Obj ,int ,V *,int (*)(),double (*)(),int (*)(),PF *);
558: void mkpfins(PF ,V *,V *);
1.18 noro 559: void mkuf(char *,char *,NODE,SNODE,int,int,char *,MODULE);
1.1 noro 560: void newstruct(int,struct oCOMP **);
561: void optobj(Obj *);
562: void println(int, char **, int);
563: void printvars(char *,VS);
564: void resetpvs(void);
565: void searchc(char *,FUNC *);
566: void searchf(NODE,char *,FUNC *);
567: void searchpf(char *,FUNC *);
568: void searchsn(SNODE *, int, SNODE **);
569: void setbp(char *);
570: void setf(int, char **);
571: void setstruct(char *,NODE);
572: void showbp(int);
573: void showbps(void);
574: void showpos(void);
575: void simplify_ins(PFINS ,Obj *);
576: void sprintvars(char *,VS);
1.5 noro 577: int structdef(char *,NODE);
1.1 noro 578: void substfp(VL ,Obj ,PF ,PF ,Obj *);
579: void substfr(VL ,Obj ,PF ,PF ,Obj *);
580: void substfv(VL ,V ,PF ,PF ,Obj *);
581: void substpr(VL ,int ,Obj ,V ,Obj ,Obj *);
582: void substr(VL ,int ,Obj ,V ,Obj ,Obj *);
583: void appendtonode(NODE,pointer, NODE *);
584: void getarray(pointer,NODE,pointer *);
585: void putarray(pointer,NODE,pointer);
586:
587: void addcomp(VL,COMP,COMP,COMP *);
588: void subcomp(VL,COMP,COMP,COMP *);
589: void mulcomp(VL,COMP,COMP,COMP *);
590: void divcomp(VL,COMP,COMP,COMP *);
591: void chsgncomp(COMP,COMP *);
592: void pwrcomp(VL,COMP,Obj,COMP *);
593: int compcomp(VL,COMP,COMP);
1.15 noro 594:
595: void mergedeglist(NODE d0,NODE d1,NODE *dr);
596: void getdeglist(P p,V v,NODE *d);
597: void restore_mvar(VL vl,P p,V v,P *r);
598: void change_mvar(VL vl,P p,V v,P *r);
599: void getcoef(VL vl,P p,V v,Q d,P *r);
600: void ranp(int n,UP *nr);
601:
602: void _print_mp(int nv,MP m);
603: int dp_homogeneous(DP p);
604: int dp_nt(DP p);
605: int dl_equal(int nv,DL dl1,DL dl2);
606: DL lcm_of_DL(int nv,DL dl1,DL dl2,DL dl);
607: void dp_rest(DP p,DP *rp);
608: void dp_hm(DP p,DP *rp);
609: void dltod(DL d,int n,DP *rp);
610: void dp_subd(DP p1,DP p2,DP *rp);
611: int dp_redble(DP p1,DP p2);
612: void sortbynm(Q *w,int n);
613: int comp_nm(Q *a,Q *b);
614: void qltozl(Q *w,int n,Q *dvr);
615: void dp_rat(DP p,DP *rp);
616: void dp_mod(DP p,int mod,NODE subst,DP *rp);
617: void dp_dehomo(DP p,DP *rp);
618: void dp_homo(DP p,DP *rp);
619: void dp_nf_tab_mod(DP p,LIST *tab,int mod,DP *rp);
620: void dp_lnf_mod(DP p1,DP p2,NODE g,int mod,DP *r1p,DP *r2p);
621: void dp_lnf_f(DP p1,DP p2,NODE g,DP *r1p,DP *r2p);
622: void _dp_nf_mod_destructive(NODE b,DP g,DP *ps,int mod,int full,DP *rp);
623: void dp_true_nf_mod(NODE b,DP g,DP *ps,int mod,int full,DP *rp,P *dnp);
624: void dp_nf_mod(NODE b,DP g,DP *ps,int mod,int full,DP *rp);
625: void dp_nf_f(NODE b,DP g,DP *ps,int full,DP *rp);
626: void dp_nf_z(NODE b,DP g,DP *ps,int full,int multiple,DP *rp);
627: void dp_true_nf(NODE b,DP g,DP *ps,int full,DP *rp,P *dnp);
628: void _dp_red_mod_destructive(DP p1,DP p2,int mod,DP *rp);
629: void dp_red_mod(DP p0,DP p1,DP p2,int mod,DP *head,DP *rest,P *dnp);
630: void dp_red_f(DP p1,DP p2,DP *rest);
631: void dp_red(DP p0,DP p1,DP p2,DP *head,DP *rest,P *dnp,DP *multp);
632: void _dp_sp_mod(DP p1,DP p2,int mod,DP *rp);
633: void _dp_sp_mod_dup(DP p1,DP p2,int mod,DP *rp);
634: void dp_sp_mod(DP p1,DP p2,int mod,DP *rp);
635: void _dp_sp_dup(DP p1,DP p2,DP *rp);
636: void dp_sp(DP p1,DP p2,DP *rp);
637: void dp_dtov(DP dp,VECT *rp);
638: void dp_cont(DP p,Q *rp);
639: void dp_prim_mod(DP p,int mod,DP *rp);
640: void heu_nezgcdnpz(VL vl,P *pl,int m,P *pr);
641: void dp_prim(DP p,DP *rp);
642: void dp_ptozp2_d(DP p0,DP p1,DP *hp,DP *rp);
643: void dp_ptozp_d(DP p,DP *rp);
644: void dp_vtod(Q *c,DP p,DP *rp);
645: void insert_to_node(DL d,NODE *n,int nvar);
646: int _dl_redble(DL d1,DL d2,int nvar);
647: void dp_mbase(NODE hlist,NODE *mbase);
648: void dp_idiv(DP p,Q c,DP *rp);
649: void dp_ptozp2(DP p0,DP p1,DP *hp,DP *rp);
650: void dp_ptozp(DP p,DP *rp);
651: int eqdl(int nv,DL dl1,DL dl2);
652: void _dpmod_to_vect(DP f,DL *at,int *b);
653: void _tf_to_vect_compress(NODE tf,DL *at,CDP *b);
654: void dp_to_vect(DP f,DL *at,Q *b);
655: NODE dp_dllist(DP f);
656: NODE mul_dllist(DL d,DP f);
657: void pdl(NODE f);
658: void dp_gr_main(LIST f,LIST v,Num homo,int modular,int field,struct order_spec *ord,LIST *rp);
659: void dp_gr_mod_main(LIST f,LIST v,Num homo,int m,struct order_spec *ord,LIST *rp);
660: void dp_f4_main(LIST f,LIST v,struct order_spec *ord,LIST *rp);
661: void dp_f4_mod_main(LIST f,LIST v,int m,struct order_spec *ord,LIST *rp);
662: NODE gb_f4(NODE f);
663: NODE gb_f4_mod(NODE f,int m);
664: NODE gb_f4_mod_old(NODE f,int m);
665: int DPPlength(DP_pairs n);
666: void printdl(DL dl);
667: void pltovl(LIST l,VL *vl);
668: void makesubst(VL v,NODE *s);
669: void printsubst(NODE s);
670: void vlminus(VL v,VL w,VL *d);
671: int validhc(P a,int m,NODE s);
672: void setup_arrays(NODE f,int m,NODE *r);
673: void prim_part(DP f,int m,DP *r);
674: NODE /* of DP */ NODE_sortb_insert( DP newdp, NODE /* of DP */ nd, int dec );
675: NODE NODE_sortb( NODE node, int dec );
676: NODE /* of index */ NODE_sortbi_insert( int newdpi, NODE /* of index */ nd, int dec );
677: NODE NODE_sortbi( NODE node, int dec );
678: void reduceall(NODE in,NODE *h);
679: void reduceall_mod(NODE in,int m,NODE *h);
680: int newps(DP a,int m,NODE subst);
681: int newps_nosave(DP a,int m,NODE subst);
682: int newps_mod(DP a,int m);
683: void reducebase_dehomo(NODE f,NODE *g);
684: NODE append_one(NODE f,int n);
685: DP_pairs minp( DP_pairs d, DP_pairs *prest );
686: void minsugar(DP_pairs d,DP_pairs *dm,DP_pairs *dr);
687: NODE gb(NODE f,int m,NODE subst);
688: NODE gb_mod(NODE f,int m);
689: DP_pairs updpairs( DP_pairs d, NODE /* of index */ g, int t);
690: DP_pairs newpairs( NODE /* of index */ g, int t );
691: DP_pairs criterion_B( DP_pairs d, int s );
692: DP_pairs criterion_M( DP_pairs d1 );
693: int criterion_2( int dp1, int dp2 );
694: DP_pairs criterion_F( DP_pairs d1 );
695: NODE updbase(NODE g,int t);
696: NODE /* of index */ remove_reducibles(NODE /* of index */ nd, int newdp );
697: int dl_redble(DL dl1,DL dl2);
1.16 noro 698: int dl_weyl_weight(DL dl);
1.15 noro 699: int gbcheck(NODE f);
700: int membercheck(NODE f,NODE x);
701: void dp_set_flag(Obj name,Obj value);
702: void dp_make_flaglist(LIST *list);
703: void dp_save(int index,Obj p,char *prefix);
704: void dp_load(int index,DP *p);
705: int dp_load_t(int index,DP *p);
706: void init_stat();
707: void print_stat();
708: void dp_mulc_d(DP p,P c,DP *r);
709: void _dp_nf(NODE b,DP g,DP *ps,int full,DP *rp);
710: void _dp_nf_z(NODE b,DP g,DP *ps,int full,int multiple,DP *r);
711: void dp_imul_d(DP p,Q q,DP *rp);
712: void imulv(VECT w,Q c,VECT *rp);
713: void dptoca(DP p,unsigned int **rp);
714: int yylex();
715: void purge_stdin();
716: int afternl();
717: int aftercomment();
718: int myatoi(char *s);
719: void yyerror(char *s);
720: int Egetc(FILE *fp);
721: void Eungetc(int c,FILE *fp);
722: int readline_getc();
723: void readline_ungetc();
724: char *readline_console(char *prompt);
725: void ox_usr1_handler(int sig);
726: void env_init();
727: void loadasirfile(char *name0);
728: void execasirfile(char *name);
729: void load_and_execfile(char *name);
730: int loadfile(char *s);
731: int loadfiles(NODE node);
732: unsigned char encrypt_char(unsigned char c);
733: unsigned char decrypt_char(unsigned char c);
734: void encrypt_file(char *in,char *out);
735: void decrypt_file(char *in,char *out);
736: void get_vars(Obj t,VL *vlp);
737: void get_vars_recursive(Obj obj,VL *vlp);
738: int comp_obj(Obj *a,Obj *b);
739: int generic_comp_obj(Obj *a,Obj *b);
740: void sepvect(VECT v,int d,VECT *rp);
741: int gauss_elim_mod(int **mat,int row,int col,int md);
742: int generic_gauss_elim(MAT mat,MAT *nm,Q *dn,int **rindp,int **cindp);
743: int generic_gauss_elim_hensel(MAT mat,MAT *nmmat,Q *dn,int **rindp,int **cindp);
744: int gensolve_check(MAT mat,MAT nm,Q dn,int *rind,int *cind);
745: int inttorat(N c,N m,N b,int *sgnp,N *nmp,N *dnp);
746: int intmtoratm(MAT mat,N md,MAT nm,Q *dn);
747: int intmtoratm_q(MAT mat,N md,MAT nm,Q *dn);
748: void reduce_reducers_mod(int **mat,int row,int col,int md);
749: void pre_reduce_mod(int **mat,int row,int col,int nred,int md);
750: void reduce_sp_by_red_mod(int *sp,int **redmat,int *ind,int nred,int col,int md);
751: void red_by_compress(int m,unsigned int *p,unsigned int *r,
752: unsigned int *ri,unsigned int hc,int len);
753: void red_by_vect(int m,unsigned int *p,unsigned int *r,unsigned int hc,int len);
754: void reduce_sp_by_red_mod_compress (int *sp,CDP *redmat,int *ind,
755: int nred,int col,int md);
756: int generic_gauss_elim_mod(int **mat0,int row,int col,int md,int *colstat);
757: int lu_gfmmat(GFMMAT mat,unsigned int md,int *perm);
758: int find_lhs_and_lu_mod(unsigned int **a,int row,int col,
759: unsigned int md,int **rinfo,int **cinfo);
1.34 noro 760: void solve_by_lu_mod(int **a,int n,int md,int **b,int l,int normalize);
1.15 noro 761: int gauss_elim_mod1(int **mat,int row,int col,int md);
762: int gauss_elim_geninv_mod(unsigned int **mat,int row,int col,int md);
763: void solve_by_lu_gfmmat(GFMMAT lu,unsigned int md,unsigned int *b,unsigned int *x);
764: void mat_to_gfmmat(MAT m,unsigned int md,GFMMAT *rp);
765: int gauss_elim_geninv_mod_swap(unsigned int **mat,int row,int col,
766: unsigned int md,unsigned int ***invmatp,int **indexp);
767: void inner_product_int(Q *a,Q *b,int n,Q *r);
768: void inner_product_mat_int_mod(Q **a,int **b,int n,int k,int l,Q *r);
769: int generate_ONB_polynomial(UP2 *rp,int m,int type);
770: int _generate_irreducible_polynomial(UP2 f,int d);
771: int _generate_good_irreducible_polynomial(UP2 f,int d);
772: void printqmat(Q **mat,int row,int col);
773: void printimat(int **mat,int row,int col);
774: void ixor(N n1,N n2,N *r);
775: void ior(N n1,N n2,N *r);
776: void iand(N n1,N n2,N *r);
777: void isqrt(N a,N *r);
778: void igcd_cofactor(Q a,Q b,Q *gcd,Q *ca,Q *cb);
779: int comp_n(N *a,N *b);
780: int TypeT_NB_check(unsigned int m, unsigned int t);
781: int small_jacobi(int a,int m);
782: void pushpvs(FUNC f);
783: void poppvs();
1.18 noro 784: unsigned int makepvar(char *str);
1.15 noro 785: int searchpvar(char *str);
786: int getpvar(VS pvs,char *str,int searchonly);
787: void closecurrentinput();
788: void resetpvs();
789: void savepvs();
790: void restorepvs();
791: void storeans(pointer p);
792: void get_rootdir(char *name,int len);
793: void set_rootdir(char *name);
794: int process_id();
795: void call_exe(char *name,char **av);
796: void addquote(VL vl,QUOTE a,QUOTE b,QUOTE *c);
797: void subquote(VL vl,QUOTE a,QUOTE b,QUOTE *c);
798: void mulquote(VL vl,QUOTE a,QUOTE b,QUOTE *c);
799: void divquote(VL vl,QUOTE a,QUOTE b,QUOTE *c);
800: void pwrquote(VL vl,QUOTE a,QUOTE b,QUOTE *c);
801: void chsgnquote(QUOTE a,QUOTE *c);
802: void objtoquote(Obj a,QUOTE *c);
803: void polytoquote(P a,QUOTE *c);
804: void dptoquote(DP a,QUOTE *c);
1.28 noro 805: void dctoquote(DCP dc,QUOTE v,QUOTE *c,int *sgn);
1.29 noro 806: void mptoquote(MP m,int n,QUOTE *c,int *sgn);
1.15 noro 807: void vartoquote(V v,QUOTE *c);
808: void fnodetotree(FNODE f,LIST *rp);
809: FNODE eval_pvar_in_fnode(FNODE f);
810: FNODE subst_in_fnode(FNODE f,V v,FNODE g);
811: char *get_attribute(char *key,LIST attr);
812: void treetofnode(Obj obj,FNODE *f);
813: void glob_init() ;
814: void input_init(FILE *fp,char *name);
815: void notdef(VL vl,Obj a,Obj b,Obj *c);
816: void ExitAsir() ;
817: void asir_terminate(int status);
818: void param_init() ;
819: void prompt() ;
820: void sprompt(char *ptr);
821: void process_args(int ac,char **av);
822: void sig_init() ;
823: static void (*old_int)(int);;
824: void asir_save_handler() ;
825: void asir_set_handler() ;
826: void asir_reset_handler() ;
827: void resetenv(char *s);
828: void fatal(int n);
829: void int_handler(int sig);
830: void restore_handler() ;
831: void segv_handler(int sig);
832: void ill_handler(int sig);
833: void alrm_handler(int sig);
834: void bus_handler(int sig);
835: void fpe_handler(int sig);
836: void pipe_handler(int sig);
837: void resize_buffer();
838: void tty_init() ;
839: void tty_reset() ;
840: void set_lasterror(char *s);
841: void error(char *s);
842: void set_timer(int interval);
843: void reset_timer();
844: void copyright() ;
845: void show_debug_window(int on);
846: void init_cmdwin();
847: void searchpf(char *name,FUNC *fp);
848: void searchc(char *name,FUNC *fp);
849: void mkpf(char *name,Obj body,int argc,V *args,
850: int (*parif)(),double (*libmf)(), int (*simp)(),PF *pfp);
851: void mkpfins(PF pf,V *args,V *vp);
852: void _mkpfins(PF pf,Obj *args,V *vp);
853: void _mkpfins_with_darray(PF pf,Obj *args,int *darray,V *vp);
854: void appendpfins(V v,V *vp);
855: void duppfins(V v,V *vp);
856: void derivvar(VL vl,V pf,V v,Obj *a);
857: void derivr(VL vl,Obj a,V v,Obj *b);
858: void substr(VL vl,int partial,Obj a,V v,Obj b,Obj *c);
859: void substpr(VL vl,int partial,Obj p,V v0,Obj p0,Obj *pr);
860: void evalr(VL vl,Obj a,int prec,Obj *c);
861: void evalp(VL vl,P p,int prec,P *pr);
862: void evalv(VL vl,V v,int prec,Obj *rp);
863: void evalins(PFINS ins,int prec,Obj *rp);
864: void devalr(VL vl,Obj a,Obj *c);
865: void devalp(VL vl,P p,P *pr);
866: void devalv(VL vl,V v,Obj *rp);
867: void devalins(PFINS ins,Obj *rp);
868: void simplify_ins(PFINS ins,Obj *rp);
869: void instov(PFINS ins,V *vp);
870: void substfr(VL vl,Obj a,PF u,PF f,Obj *c);
871: void substfp(VL vl,Obj p,PF u,PF f,Obj *pr);
872: void substfv(VL vl,V v,PF u,PF f,Obj *c);
873: int structdef(char *name,NODE member);
874: void newstruct(int type,COMP *rp);
875: int structtoindex(char *name);
876: int membertoindex(int type,char *name);
877: int getcompsize(int type);
878: Obj memberofstruct(COMP a,char *name);
879: void assign_to_member(COMP a,char *name,Obj obj);
880: void node_concat_dup(NODE n1,NODE n2,NODE *nr);
881: pointer evall(lid id,Obj a1,Obj a2);
882: pointer eval(FNODE f);
883: pointer evalstat(SNODE f);
884: pointer evalnode(NODE node);
885: pointer evalf(FUNC f,FNODE a,FNODE opt);
886: pointer evalmapf(FUNC f,FNODE a);
887: pointer eval_rec_mapf(FUNC f,FNODE a);
888: pointer beval_rec_mapf(FUNC f,NODE node);
889: pointer bevalf(FUNC f,NODE a);
890: pointer evalif(FNODE f,FNODE a);
891: pointer evalpf(PF pf,NODE args);
892: void evalnodebody(NODE sn,NODE *dnp);
893: void gen_searchf(char *name,FUNC *r);
894: void searchf(NODE fn,char *name,FUNC *r);
895: void appenduf(char *name,FUNC *r);
896: void mkparif(char *name,FUNC *r);
1.18 noro 897: void mkuf(char *name,char *fname,NODE args,SNODE body,int startl,int endl,char *desc,MODULE module);
1.15 noro 898: Obj getopt_from_cpvs(char *key);
899: void des_enc(unsigned long *, unsigned char *, unsigned long *);
900: unsigned long round_func(unsigned long , unsigned char *);
901: unsigned long s_box_func(unsigned char *);
902: void des_dec(unsigned long *, unsigned char *, unsigned long *);
903: void key_schedule(unsigned char *,unsigned char *);
904: void debug_init();
905: void add_alias(char *com,char *alias);
906: void show_alias(char *alias);
907: void debug(SNODE f);
908: void setf(int ac,char **av);
909: void setbp(char *p);
910: void settp(char *p);
911: void clearbp(FUNC f);
912: int searchbp();
913: void delbp(int ac,char **av);
914: void showbps();
915: void showbp(int n);
916: void searchsn(SNODE *fp,int n,SNODE **fpp);
917: void bp(SNODE f);
918: void println(int ac,char **av,int l);
919: void printvars(char *s,VS vs);
920: void showpos();
921: void showpos_to_string(char *buf);
922: void change_stack(int level,NODE *pvss);
923: void show_stack(VS vs);
924: int estimate_length(VL vl,pointer p);
925: void send_progress(short per,char *msg);
926: void set_error(int code,char *reason,char *action);
927: double get_current_time();
FreeBSD-CVSweb <freebsd-cvsweb@FreeBSD.org>