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