![[BACK]](/icons/cvsweb/back.gif){kind=icon}
Return to strobj.c CVS log ![[TXT]](/icons/cvsweb/text.gif){kind=icon}
![[DIR]](/icons/cvsweb/dir.gif){kind=icon}
Up to [local] / OpenXM_contrib2 / asir2000 / builtin|
Return to strobj.c CVS log | Up to [local] / OpenXM_contrib2 / asir2000 / builtin |
1.6 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.7 noro 26: * e-mail at risa-admin@sec.flab.fujitsu.co.jp of the detailed specification
1.6 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.107 ! noro 48: * $OpenXM: OpenXM_contrib2/asir2000/builtin/strobj.c,v 1.106 2005/12/10 14:14:15 noro Exp $
1.6 noro 49: */
1.1 noro 50: #include "ca.h"
51: #include "parse.h"
52: #include "ctype.h"
1.10 ohara 53: #if defined(PARI)
1.1 noro 54: #include "genpari.h"
1.11 saito 55: # if !(PARI_VERSION_CODE > 131588)
1.1 noro 56: extern jmp_buf environnement;
1.11 saito 57: # endif
1.1 noro 58: #endif
1.5 noro 59: #include <string.h>
60:
1.89 noro 61: #if defined(__GNUC__)
62: #define INLINE inline
63: #elif defined(VISUAL)
64: #define INLINE __inline
65: #else
66: #define INLINE
67: #endif
68:
1.18 noro 69: struct TeXSymbol {
70: char *text;
71: char *symbol;
72: };
73:
1.71 noro 74: #define OPNAME(f) (((ARF)FA0(f))->name[0])
1.77 noro 75: #define IS_ZERO(f) (((f)->id==I_FORMULA) && FA0(f)==0 )
1.75 noro 76: #define IS_BINARYPWR(f) (((f)->id==I_BOP) &&(OPNAME(f)=='^'))
77: #define IS_NARYADD(f) (((f)->id==I_NARYOP) &&(OPNAME(f)=='+'))
78: #define IS_NARYMUL(f) (((f)->id==I_NARYOP) &&(OPNAME(f)=='*'))
1.71 noro 79:
1.1 noro 80: extern char *parse_strp;
81:
1.50 ohara 82: void Psprintf();
1.1 noro 83: void Prtostr(), Pstrtov(), Peval_str();
1.3 noro 84: void Pstrtoascii(), Pasciitostr();
1.5 noro 85: void Pstr_len(), Pstr_chr(), Psub_str();
1.14 noro 86: void Pwrite_to_tb();
87: void Ptb_to_string();
88: void Pclear_tb();
89: void Pstring_to_tb();
90: void Pquotetotex_tb();
91: void Pquotetotex();
1.24 noro 92: void Pquotetotex_env();
1.47 noro 93: void Pflatten_quote();
1.69 noro 94:
1.105 noro 95: void Pqt_is_integer(),Pqt_is_rational(),Pqt_is_number();
96: void Pqt_is_dependent(),Pqt_is_function();
97: void Pqt_set_ord();
98: void Pqt_normalize();
99: void Pnqt_comp();
100: void Pnqt_match();
1.106 noro 101: void Pnqt_match_rewrite();
1.69 noro 102:
1.105 noro 103: void Pqt_to_nbp();
1.101 noro 104: void Pshuffle_mul(), Pharmonic_mul();
1.102 noro 105: void Pnbp_hm(), Pnbp_ht(), Pnbp_hc(), Pnbp_rest();
106: void Pnbm_deg();
107: void Pnbm_hp_rest();
108: void Pnbm_hxky(), Pnbm_xky_rest();
109: void Pnbm_hv(), Pnbm_rest();
1.98 noro 110:
1.52 noro 111: void Pquote_to_funargs(),Pfunargs_to_quote(),Pget_function_name();
1.107 ! noro 112: void Pqt_match(),Pget_quote_id();
1.105 noro 113: void Pqt_to_nary(),Pqt_to_bin();
1.88 noro 114: void fnode_do_assign(NODE arg);
1.58 ohara 115: void do_assign(NODE arg);
1.14 noro 116: void fnodetotex_tb(FNODE f,TB tb);
117: char *symbol_name(char *name);
1.28 noro 118: char *conv_rule(char *name);
1.38 noro 119: char *conv_subs(char *name);
1.28 noro 120: char *call_convfunc(char *name);
1.14 noro 121: void tb_to_string(TB tb,STRING *rp);
122: void fnodenodetotex_tb(NODE n,TB tb);
123: void fargstotex_tb(char *opname,FNODE f,TB tb);
1.35 noro 124: int top_is_minus(FNODE f);
1.105 noro 125: int qt_match(Obj f,Obj pat,NODE *rp);
1.106 noro 126: FNODE partial_eval(FNODE), fnode_to_nary(FNODE), fnode_to_bin(FNODE,int);
127: FNODE nfnode_add(FNODE a1,FNODE a2,int expand);
128: FNODE nfnode_mul(FNODE a1,FNODE a2,int expand);
129: FNODE nfnode_pwr(FNODE a1,FNODE a2,int expand);
130: FNODE nfnode_mul_coef(Num c,FNODE f,int expand);
131: FNODE fnode_expand_pwr(FNODE f,int n,int expand);
132: FNODE to_narymul(FNODE f);
133: FNODE to_naryadd(FNODE f);
134: FNODE fnode_node_to_nary(ARF op,NODE n);
135: void fnode_base_exp(FNODE f,FNODE *bp,FNODE *ep);
136: void fnode_coef_body(FNODE f,Num *cp,FNODE *bp);
137: FNODE nfnode_match_rewrite(FNODE f,FNODE p,FNODE c,FNODE a,int mode);
138: FNODE fnode_apply(FNODE f,FNODE (*func)(),int expand);
139: FNODE fnode_normalize(FNODE f,int expand);
1.107 ! noro 140: FNODE rewrite_fnode(FNODE f,NODE arg,int qarg);
1.1 noro 141:
142: struct ftab str_tab[] = {
1.50 ohara 143: {"sprintf",Psprintf,-99999999},
1.1 noro 144: {"rtostr",Prtostr,1},
145: {"strtov",Pstrtov,1},
146: {"eval_str",Peval_str,1},
1.3 noro 147: {"strtoascii",Pstrtoascii,1},
148: {"asciitostr",Pasciitostr,1},
1.5 noro 149: {"str_len",Pstr_len,1},
150: {"str_chr",Pstr_chr,3},
151: {"sub_str",Psub_str,3},
1.14 noro 152: {"write_to_tb",Pwrite_to_tb,2},
153: {"clear_tb",Pclear_tb,1},
154: {"tb_to_string",Ptb_to_string,1},
155: {"string_to_tb",Pstring_to_tb,1},
1.63 noro 156: {"get_quote_id",Pget_quote_id,1},
1.69 noro 157:
1.105 noro 158: {"qt_is_number",Pqt_is_number,1},
159: {"qt_is_rational",Pqt_is_rational,1},
160: {"qt_is_integer",Pqt_is_integer,1},
161: {"qt_is_function",Pqt_is_function,1},
162: {"qt_is_dependent",Pqt_is_dependent,2},
163:
164: {"qt_set_ord",Pqt_set_ord,-1},
165: {"qt_normalize",Pqt_normalize,-2},
166: {"qt_match",Pqt_match,2},
1.106 noro 167: {"nqt_match_rewrite",Pnqt_match_rewrite,3},
1.105 noro 168:
169: {"nqt_comp",Pnqt_comp,2},
170: {"nqt_match",Pnqt_match,-3},
171: {"qt_to_nbp",Pqt_to_nbp,1},
1.101 noro 172: {"shuffle_mul",Pshuffle_mul,2},
173: {"harmonic_mul",Pharmonic_mul,2},
1.70 noro 174:
1.100 noro 175: {"nbp_hm", Pnbp_hm,1},
176: {"nbp_ht", Pnbp_ht,1},
177: {"nbp_hc", Pnbp_hc,1},
178: {"nbp_rest", Pnbp_rest,1},
1.102 noro 179: {"nbm_deg", Pnbm_deg,1},
180: {"nbm_hxky", Pnbm_hxky,1},
181: {"nbm_xky_rest", Pnbm_xky_rest,1},
182: {"nbm_hp_rest", Pnbm_hp_rest,1},
183: {"nbm_hv", Pnbm_hv,1},
1.100 noro 184: {"nbm_rest", Pnbm_rest,1},
185:
1.105 noro 186: {"qt_to_nary",Pqt_to_nary,1},
187: {"qt_to_bin",Pqt_to_bin,2},
1.95 noro 188:
1.60 noro 189: {"quotetotex_tb",Pquotetotex_tb,2},
190: {"quotetotex",Pquotetotex,1},
191: {"quotetotex_env",Pquotetotex_env,-99999999},
1.65 noro 192: {"flatten_quote",Pflatten_quote,-2},
1.60 noro 193: {"quote_to_funargs",Pquote_to_funargs,1},
1.48 noro 194: {"funargs_to_quote",Pfunargs_to_quote,1},
1.52 noro 195: {"get_function_name",Pget_function_name,1},
1.1 noro 196: {0,0,0},
197: };
1.13 noro 198:
1.14 noro 199: void write_tb(char *s,TB tb)
200: {
201: if ( tb->next == tb->size ) {
202: tb->size *= 2;
203: tb->body = (char **)REALLOC(tb->body,tb->size*sizeof(char *));
204: }
205: tb->body[tb->next] = s;
206: tb->next++;
207: }
1.13 noro 208:
1.18 noro 209: int register_symbol_table(Obj arg);
210: int register_conv_rule(Obj arg);
1.38 noro 211: int register_conv_func(Obj arg);
1.23 noro 212: int register_dp_vars(Obj arg);
1.46 noro 213: int register_dp_vars_origin(Obj arg);
214: int register_dp_dvars_origin(Obj arg);
215: int register_dp_dvars_prefix(Obj arg);
1.25 noro 216: int register_dp_vars_prefix(Obj arg);
1.31 noro 217: int register_dp_vars_hweyl(Obj arg);
1.27 noro 218: int register_show_lt(Obj arg);
1.40 noro 219: char *objtostr(Obj obj);
1.18 noro 220: static struct TeXSymbol *user_texsymbol;
1.23 noro 221: static char **dp_vars;
1.25 noro 222: static int dp_vars_len;
223: static char *dp_vars_prefix;
1.46 noro 224: static char *dp_dvars_prefix;
225: static int dp_vars_origin;
226: static int dp_dvars_origin;
1.27 noro 227: static int show_lt;
1.26 noro 228: static FUNC convfunc;
1.27 noro 229: static int is_lt;
1.28 noro 230: static int conv_flag;
1.31 noro 231: static int dp_vars_hweyl;
1.28 noro 232:
1.38 noro 233: #define CONV_TABLE (1U<<0)
234: #define CONV_SUBS (1U<<1)
235: #define CONV_DMODE (1U<<2)
1.18 noro 236:
237: static struct {
238: char *name;
239: Obj value;
240: int (*reg)();
241: } qtot_env[] = {
242: {"symbol_table",0,register_symbol_table},
243: {"conv_rule",0,register_conv_rule},
1.38 noro 244: {"conv_func",0,register_conv_func},
1.23 noro 245: {"dp_vars",0,register_dp_vars},
1.25 noro 246: {"dp_vars_prefix",0,register_dp_vars_prefix},
1.46 noro 247: {"dp_dvars_prefix",0,register_dp_dvars_prefix},
248: {"dp_vars_origin",0,register_dp_vars_origin},
249: {"dp_dvars_origin",0,register_dp_dvars_origin},
1.31 noro 250: {"dp_vars_hweyl",0,register_dp_vars_hweyl},
1.27 noro 251: {"show_lt",0,register_show_lt},
1.18 noro 252: {0,0,0},
253: };
254:
1.20 noro 255: #define PARTIAL "\\partial"
1.28 noro 256:
257: char *conv_rule(char *name)
258: {
259: char *body,*r;
1.41 noro 260: int len;
1.28 noro 261:
1.38 noro 262: if ( convfunc )
263: name = call_convfunc(name);
1.41 noro 264: if ( conv_flag & CONV_TABLE ) {
265: r = symbol_name(name);
266: if ( r ) return r;
267: }
268: if ( (conv_flag & CONV_DMODE) && *name == 'd' ) {
269: body = conv_rule(name+1);
270: r = MALLOC_ATOMIC((strlen(PARTIAL)+strlen(body)+5)*sizeof(char));
271: if ( !body || !(len=strlen(body)) )
272: strcpy(r,PARTIAL);
273: else if ( len == 1 )
274: sprintf(r,"%s_%s",PARTIAL,body);
275: else
276: sprintf(r,"%s_{%s}",PARTIAL,body);
277: return r;
278: } else
279: return conv_subs(name);
1.28 noro 280: }
281:
1.40 noro 282: int _is_delimiter(char c)
283: {
284: if ( (c == ' ' || c == '_' || c == ',') ) return 1;
285: else return 0;
286: }
287:
288: int _is_alpha(char c)
289: {
290: if ( isdigit(c) || c == '{' || _is_delimiter(c) ) return 0;
291: else return 1;
292: }
293:
1.38 noro 294: char *conv_subs(char *name)
1.19 noro 295: {
1.29 noro 296: int i,j,k,len,clen,slen,start,level;
1.41 noro 297: char *buf,*head,*r,*h,*brace,*buf_conv;
1.28 noro 298: char **subs;
299:
1.41 noro 300: if ( !name || !(len=strlen(name)) ) return "";
301: if ( !(conv_flag&CONV_SUBS) ) return name;
1.28 noro 302: subs = (char **)ALLOCA(len*sizeof(char* ));
1.32 noro 303: for ( i = 0, j = 0, start = i; ; j++ ) {
1.40 noro 304: while ( (i < len) && _is_delimiter(name[i]) ) i++;
1.32 noro 305: start = i;
1.28 noro 306: if ( i == len ) break;
1.29 noro 307: if ( name[i] == '{' ) {
308: for ( level = 1, i++; i < len && level; i++ ) {
309: if ( name[i] == '{' ) level++;
310: else if ( name[i] == '}' ) level--;
311: }
1.32 noro 312: slen = i-start;
1.37 noro 313: if ( slen >= 3 ) {
314: brace = (char *)ALLOCA((slen+1)*sizeof(char));
315: strncpy(brace,name+start+1,slen-2);
316: brace[slen-2] = 0;
1.38 noro 317: buf = conv_subs(brace);
1.37 noro 318: subs[j] = (char *)ALLOCA((strlen(buf)+3)*sizeof(char));
1.38 noro 319: if ( strlen(buf) == 1 )
320: strcpy(subs[j],buf);
321: else
322: sprintf(subs[j],"{%s}",buf);
1.37 noro 323: } else
324: subs[j] = "{}";
1.32 noro 325: } else {
326: if ( isdigit(name[i]) )
327: while ( i < len && isdigit(name[i]) ) i++;
328: else
1.40 noro 329: while ( i < len && _is_alpha(name[i]) ) i++;
1.32 noro 330: slen = i-start;
331: buf = (char *)ALLOCA((slen+1)*sizeof(char));
332: strncpy(buf,name+start,slen); buf[slen] = 0;
1.41 noro 333: buf_conv = symbol_name(buf);
334: subs[j] = buf_conv?buf_conv:buf;
1.32 noro 335: }
1.28 noro 336: }
1.32 noro 337: for ( k = 0, clen = 0; k < j; k++ ) clen += strlen(subs[k]);
338: /* {subs(0)}_{{subs(1)},...,{subs(j-1)}} => {}:j+1 _:1 ,:j-2 */
339: h = r = MALLOC_ATOMIC((clen+(j+1)*2+1+(j-2)+1)*sizeof(char));
340: if ( j == 1 )
341: sprintf(h,"{%s}",subs[0]);
1.28 noro 342: else {
1.38 noro 343: sprintf(h,"{%s}_{%s",subs[0],subs[1]);
1.28 noro 344: h += strlen(h);
1.32 noro 345: for ( k = 2; k < j; k++ ) {
1.38 noro 346: sprintf(h,",%s",subs[k]);
1.28 noro 347: h += strlen(h);
1.19 noro 348: }
1.28 noro 349: strcpy(h,"}");
1.20 noro 350: }
351: return r;
1.19 noro 352: }
353:
1.26 noro 354: char *call_convfunc(char *name)
355: {
356: STRING str,r;
357: NODE arg;
358:
359: MKSTR(str,name);
360: arg = mknode(1,str);
361: r = (STRING)bevalf(convfunc,arg);
362: if ( !r || OID(r) != O_STR )
363: error("call_convfunc : invalid result");
364: return BDY(r);
365: }
366:
1.18 noro 367: int register_symbol_table(Obj arg)
368: {
369: NODE n,t;
370: Obj b;
371: STRING a0,a1;
372: struct TeXSymbol *uts;
373: int i,len;
374:
375: /* check */
376: if ( !arg ) {
377: user_texsymbol = 0;
378: return 1;
379: }
380: if ( OID(arg) != O_LIST ) return 0;
381:
382: n = BDY((LIST)arg);
383: len = length(n);
384: uts = (struct TeXSymbol *)MALLOC((len+1)*sizeof(struct TeXSymbol));
385: for ( i = 0; n; n = NEXT(n), i++ ) {
386: b = (Obj)BDY(n);
387: if ( !b || OID(b) != O_LIST ) return 0;
388: t = BDY((LIST)b);
389: if ( !t || !NEXT(t) ) return 0;
390: a0 = (STRING)BDY(t);
391: a1 = (STRING)BDY(NEXT(t));
1.23 noro 392: if ( !a0 ) return 0;
393: if ( OID(a0) == O_STR )
394: uts[i].text = BDY(a0);
395: else if ( OID(a0) == O_P )
396: uts[i].text = NAME(VR((P)a0));
397: else
398: return 0;
399: if ( !a1 ) return 0;
400: if ( OID(a1) == O_STR )
401: uts[i].symbol = BDY(a1);
402: else if ( OID(a1) == O_P )
403: uts[i].symbol = NAME(VR((P)a1));
404: else
405: return 0;
1.18 noro 406: }
407: uts[i].text = 0;
408: uts[i].symbol = 0;
409: user_texsymbol = uts;
410: return 1;
411: }
412:
1.46 noro 413: int register_dp_vars_origin(Obj arg)
414: {
415: if ( INT(arg) ) {
416: dp_vars_origin = QTOS((Q)arg);
417: return 1;
418: } else return 0;
419: }
420:
421: int register_dp_dvars_origin(Obj arg)
422: {
423: if ( INT(arg) ) {
424: dp_dvars_origin = QTOS((Q)arg);
425: return 1;
426: } else return 0;
427: }
428:
1.31 noro 429: int register_dp_vars_hweyl(Obj arg)
430: {
431: if ( INT(arg) ) {
432: dp_vars_hweyl = QTOS((Q)arg);
433: return 1;
434: } else return 0;
435: }
436:
1.27 noro 437: int register_show_lt(Obj arg)
438: {
439: if ( INT(arg) ) {
440: show_lt = QTOS((Q)arg);
441: return 1;
442: } else return 0;
443: }
1.26 noro 444:
1.18 noro 445: int register_conv_rule(Obj arg)
446: {
1.19 noro 447: if ( INT(arg) ) {
1.28 noro 448: conv_flag = QTOS((Q)arg);
449: convfunc = 0;
450: return 1;
1.38 noro 451: } else return 0;
452: }
453:
454: int register_conv_func(Obj arg)
455: {
1.43 noro 456: if ( !arg ) {
457: convfunc = 0;
458: return 1;
459: } else if ( OID(arg) == O_P && (int)(VR((P)arg))->attr == V_SR ) {
1.26 noro 460: convfunc = (FUNC)(VR((P)arg)->priv);
461: /* f must be a function which takes single argument */
462: return 1;
1.19 noro 463: } else return 0;
1.18 noro 464: }
465:
1.23 noro 466: int register_dp_vars(Obj arg)
467: {
468: int l,i;
469: char **r;
470: NODE n;
471: STRING a;
472:
473: if ( !arg ) {
474: dp_vars = 0;
475: dp_vars_len = 0;
1.25 noro 476: return 1;
1.23 noro 477: } else if ( OID(arg) != O_LIST )
478: return 0;
479: else {
480: n = BDY((LIST)arg);
481: l = length(n);
482: r = (char **)MALLOC_ATOMIC(l*sizeof(char *));
483: for ( i = 0; i < l; i++, n = NEXT(n) ) {
484: a = (STRING)BDY(n);
485: if ( !a ) return 0;
486: if ( OID(a) == O_STR )
487: r[i] = BDY(a);
488: else if ( OID(a) == O_P )
489: r[i] = NAME(VR((P)a));
490: else
491: return 0;
492: }
493: dp_vars = r;
494: dp_vars_len = l;
495: return 1;
496: }
497: }
498:
1.25 noro 499: int register_dp_vars_prefix(Obj arg)
500: {
501: if ( !arg ) {
502: dp_vars_prefix = 0;
503: return 1;
504: } else if ( OID(arg) == O_STR ) {
505: dp_vars_prefix = BDY((STRING)arg);
506: return 1;
507: } else if ( OID(arg) == O_P ) {
508: dp_vars_prefix = NAME(VR((P)arg));
509: return 1;
510: } else return 0;
511: }
512:
1.46 noro 513: int register_dp_dvars_prefix(Obj arg)
514: {
515: if ( !arg ) {
516: dp_dvars_prefix = 0;
517: return 1;
518: } else if ( OID(arg) == O_STR ) {
519: dp_dvars_prefix = BDY((STRING)arg);
520: return 1;
521: } else if ( OID(arg) == O_P ) {
522: dp_dvars_prefix = NAME(VR((P)arg));
523: return 1;
524: } else return 0;
525: }
526:
1.24 noro 527: void Pquotetotex_env(NODE arg,Obj *rp)
1.18 noro 528: {
529: int ac,i;
530: char *name;
531: NODE n,n0;
532: STRING s;
533: LIST l;
534:
535: ac = argc(arg);
536: if ( !ac ) {
537: n0 = 0;
538: for ( i = 0; qtot_env[i].name; i++ ) {
539: NEXTNODE(n0,n); MKSTR(s,qtot_env[i].name); BDY(n) = (pointer)s;
540: NEXTNODE(n0,n); BDY(n) = (Q)qtot_env[i].value;
541: }
542: NEXT(n) = 0;
543: MKLIST(l,n0);
544: *rp = (Obj)l;
1.34 noro 545: } else if ( ac == 1 && !ARG0(arg) ) {
546: /* set to default */
1.43 noro 547: for ( i = 0; qtot_env[i].name; i++ ) {
548: (qtot_env[i].reg)(0);
1.34 noro 549: qtot_env[i].value = 0;
1.43 noro 550: }
1.34 noro 551: *rp = 0;
1.18 noro 552: } else if ( ac == 1 || ac == 2 ) {
1.24 noro 553: asir_assert(ARG0(arg),O_STR,"quotetotex_env");
1.18 noro 554: name = BDY((STRING)ARG0(arg));
555: for ( i = 0; qtot_env[i].name; i++ )
556: if ( !strcmp(qtot_env[i].name,name) ) {
557: if ( ac == 2 ) {
558: if ( (qtot_env[i].reg)((Obj)ARG1(arg)) )
559: qtot_env[i].value = (Obj)ARG1(arg);
560: else
1.24 noro 561: error("quotetotex_env : invalid argument");
1.18 noro 562: }
563: *rp = qtot_env[i].value;
564: return;
565: }
566: *rp = 0;
567: } else
568: *rp = 0;
569: }
570:
1.14 noro 571: void Pwrite_to_tb(NODE arg,Q *rp)
1.13 noro 572: {
573: int i;
1.16 noro 574: Obj obj;
575: TB tb;
1.13 noro 576:
1.14 noro 577: asir_assert(ARG1(arg),O_TB,"write_to_tb");
1.16 noro 578: obj = ARG0(arg);
579: if ( !obj )
580: write_tb("",ARG1(arg));
581: else if ( OID(obj) == O_STR )
582: write_tb(BDY((STRING)obj),ARG1(arg));
583: else if ( OID(obj) == O_TB ) {
584: tb = (TB)obj;
585: for ( i = 0; i < tb->next; i++ )
586: write_tb(tb->body[i],ARG1(arg));
587: }
1.14 noro 588: *rp = 0;
1.53 noro 589: }
590:
1.105 noro 591: void Pqt_to_nary(NODE arg,QUOTE *rp)
1.63 noro 592: {
593: FNODE f;
594:
1.70 noro 595: f = fnode_to_nary(BDY((QUOTE)ARG0(arg)));
1.63 noro 596: MKQUOTE(*rp,f);
597: }
598:
1.105 noro 599: void Pqt_to_bin(NODE arg,QUOTE *rp)
1.63 noro 600: {
601: FNODE f;
602: int direction;
603:
604: direction = QTOS((Q)ARG1(arg));
1.70 noro 605: f = fnode_to_bin(BDY((QUOTE)ARG0(arg)),direction);
1.63 noro 606:
607: MKQUOTE(*rp,f);
608: }
1.61 noro 609:
1.105 noro 610: void Pqt_is_number(NODE arg,Q *rp)
1.69 noro 611: {
612: QUOTE q;
613: int ret;
614:
615: q = (QUOTE)ARG0(arg);
1.105 noro 616: asir_assert(q,O_QUOTE,"qt_is_number");
1.69 noro 617: ret = fnode_is_number(BDY(q));
618: STOQ(ret,*rp);
619: }
620:
1.105 noro 621: void Pqt_is_rational(NODE arg,Q *rp)
1.69 noro 622: {
623: QUOTE q;
624: int ret;
625:
626: q = (QUOTE)ARG0(arg);
1.105 noro 627: asir_assert(q,O_QUOTE,"qt_is_rational");
1.69 noro 628: ret = fnode_is_rational(BDY(q));
629: STOQ(ret,*rp);
630: }
631:
1.105 noro 632: void Pqt_is_integer(NODE arg,Q *rp)
1.69 noro 633: {
634: QUOTE q;
635: int ret;
636:
637: q = (QUOTE)ARG0(arg);
1.105 noro 638: asir_assert(q,O_QUOTE,"qt_is_integer");
1.69 noro 639: ret = fnode_is_integer(BDY(q));
640: STOQ(ret,*rp);
641: }
642:
1.105 noro 643: void Pqt_is_function(NODE arg,Q *rp)
1.69 noro 644: {
645: QUOTE q;
646: int ret;
647:
648: q = (QUOTE)ARG0(arg);
1.105 noro 649: asir_assert(q,O_QUOTE,"qt_is_function");
1.69 noro 650: if ( q->id == I_FUNC || q->id == I_IFUNC )
651: ret = 1;
652: else
653: ret = 0;
654: STOQ(ret,*rp);
655: }
656:
1.105 noro 657: void Pqt_is_dependent(NODE arg,Q *rp)
1.69 noro 658: {
659: P x;
660: QUOTE q,v;
661: int ret;
662: V var;
663:
664: q = (QUOTE)ARG0(arg);
665: v = (QUOTE)ARG1(arg);
1.105 noro 666: asir_assert(q,O_QUOTE,"qt_is_dependent");
667: asir_assert(v,O_QUOTE,"qt_is_dependent");
1.69 noro 668: x = (P)eval(BDY(v));
669: if ( !x || OID(x) != O_P )
670: *rp = 0;
671: var = VR(x);
672: ret = fnode_is_dependent(BDY(q),var);
673: STOQ(ret,*rp);
674: }
675:
676:
1.105 noro 677: void Pqt_match(NODE arg,Q *rp)
1.53 noro 678: {
1.61 noro 679: FNODE f,g;
1.65 noro 680: Obj obj;
1.61 noro 681: QUOTE q;
1.53 noro 682: NODE r;
1.56 noro 683: int ret;
1.53 noro 684:
1.65 noro 685: obj = (Obj)ARG0(arg);
1.105 noro 686: ret = qt_match(obj,(Obj)ARG1(arg),&r);
1.57 noro 687: if ( ret ) {
688: do_assign(r);
689: *rp = ONE;
690: } else
1.56 noro 691: *rp = 0;
1.68 noro 692: }
693:
1.105 noro 694: void Pnqt_match(NODE arg,Q *rp)
1.88 noro 695: {
696: QUOTE fq,pq;
697: FNODE f,p;
698: int ret;
1.104 noro 699: Q mode;
1.88 noro 700: NODE r;
701:
1.104 noro 702: mode = argc(arg)==3 ? (Q)ARG2(arg) : 0;
1.105 noro 703: fq = (QUOTE)ARG0(arg); Pqt_normalize(mknode(2,fq,mode),&fq); f = (FNODE)BDY(fq);
704: pq = (QUOTE)ARG1(arg); Pqt_normalize(mknode(2,pq,mode),&pq); p = (FNODE)BDY(pq);
1.95 noro 705: ret = nfnode_match(f,p,&r);
1.88 noro 706: if ( ret ) {
707: fnode_do_assign(r);
708: *rp = ONE;
709: } else
710: *rp = 0;
711: }
712:
1.106 noro 713: void Pnqt_match_rewrite(NODE arg,Obj *rp)
714: {
715: FNODE f,p,c,a,r;
716: Obj obj,pat,cond,action;
717: NODE rule;
718: QUOTE q;
719: Q mode;
720: int m;
721:
722: obj = (Obj)ARG0(arg);
723: rule = BDY((LIST)ARG1(arg));
724: mode = (Q)ARG2(arg);
725: if ( length(rule) == 2 ) {
726: pat = ARG0(rule);
727: cond = (Obj)ONE;
728: action = (Obj)ARG1(rule);
729: } else {
730: pat = ARG0(rule);
731: cond = ARG1(rule);
732: action = (Obj)ARG2(rule);
733: }
734: Pqt_normalize(mknode(2,obj,mode),&q); f = (FNODE)BDY(q);
735: Pqt_normalize(mknode(2,pat,mode),&q); p = (FNODE)BDY(q);
736: Pqt_normalize(mknode(2,action,mode),&q);
737: a = (FNODE)BDY(q);
738: if ( OID(cond) == O_QUOTE ) c = BDY((QUOTE)cond);
739: else c = mkfnode(1,I_FORMULA,ONE);
740:
741: m = QTOS(mode);
742: r = nfnode_match_rewrite(f,p,c,a,m);
743: if ( r ) {
744: MKQUOTE(q,r);
745: *rp = (Obj)q;
746: } else
747: *rp = obj;
748: }
749:
750: /* f is NARYOP => do submatch */
751:
752: #define PV_ANY 99999999
753:
754: FNODE nfnode_match_rewrite(FNODE f,FNODE p,FNODE c,FNODE a,int mode)
755: {
756: ARF op;
757: NODE arg,h0,t,h,valuen;
758: NODE r,s0,s,pair;
1.107 ! noro 759: FNODE any,pany,head,tail,a1,a2;
1.106 noro 760: QUOTE q;
761: int ret;
762: FNODE value;
763: int ind;
764:
765: if ( f->id == I_NARYOP ) {
766: op = (ARF)FA0(f);
767: arg = (NODE)FA1(f);
768: pany = 0;
769: for ( h0 = 0, t = arg; t; t = NEXT(t) ) {
770: tail = fnode_node_to_nary(op,t);
771: ret = nfnode_match(tail,p,&r) && eval(rewrite_fnode(c,r,1));
772: if ( ret ) break;
773:
774: /* append a variable to the pattern */
775: if ( !pany ) {
776: any = mkfnode(1,I_PVAR,PV_ANY);
777: pany = mkfnode(3,I_BOP,op,p,any);
778: pany = fnode_normalize(pany,mode);
779: }
780: ret = nfnode_match(tail,pany,&r) && eval(rewrite_fnode(c,r,1));
781: if ( ret ) {
782: a = fnode_normalize(mkfnode(3,I_BOP,op,a,any),mode);
783: break;
784: }
785:
786: NEXTNODE(h0,h);
787: BDY(h) = BDY(t);
788: }
789: if ( t ) {
790: if ( h0 ) NEXT(h) = 0;
791: head = fnode_node_to_nary(op,h0);
792: a = fnode_normalize(mkfnode(3,I_BOP,op,head,a),mode);
793: ret = 1;
794: } else
795: ret = 0;
796: } else
797: ret = nfnode_match(f,p,&r) && eval(rewrite_fnode(c,r,1));
798:
799: if ( ret ) {
1.107 ! noro 800: a1 = rewrite_fnode(a,r,0);
! 801: a2 = partial_eval(a1);
! 802: return fnode_normalize(a2,mode);
1.106 noro 803: } else
804: return 0;
805: }
806:
1.56 noro 807: void do_assign(NODE arg)
808: {
809: NODE t,pair;
810: int pv;
811:
812: QUOTE value;
813:
814: for ( t = arg; t; t = NEXT(t) ) {
815: pair = BDY((LIST)BDY(t));
816: pv = (int)FA0((FNODE)BDY((QUOTE)BDY(pair)));
817: value = (QUOTE)(BDY(NEXT(pair)));
818: ASSPV(pv,value);
819: }
1.53 noro 820: }
821:
1.88 noro 822: /* [[index,fnode],...] */
823:
824: void fnode_do_assign(NODE arg)
825: {
826: NODE t,pair;
827: int pv;
828: FNODE f;
829: QUOTE value;
1.95 noro 830: QUOTEARG qa;
1.88 noro 831:
832: for ( t = arg; t; t = NEXT(t) ) {
833: pair = (NODE)BDY(t);
834: pv = (int)BDY(pair);
835: f = (FNODE)(BDY(NEXT(pair)));
1.96 noro 836: if ( f->id == I_FUNC_HEAD ) {
837: /* XXX : I_FUNC_HEAD is a dummy id to pass FUNC */
1.95 noro 838: MKQUOTEARG(qa,A_func,FA0(f));
839: value = (QUOTE)qa;
840: } else
841: MKQUOTE(value,f);
1.88 noro 842: ASSPV(pv,value);
843: }
844: }
845:
1.53 noro 846: /*
1.56 noro 847: /* consistency check and merge
848: */
1.53 noro 849:
1.56 noro 850: int merge_matching_node(NODE n,NODE a,NODE *rp)
1.53 noro 851: {
852: NODE ta,ba,tn,bn;
853: QUOTE pa,va,pn,vn;
854:
1.56 noro 855: if ( !n ) {
856: *rp = a;
857: return 1;
858: }
1.53 noro 859: for ( ta = a; ta; ta = NEXT(ta) ) {
860: ba = BDY((LIST)BDY(ta));
1.55 noro 861: if ( !ba ) continue;
1.53 noro 862: pa = (QUOTE)BDY(ba); va = (QUOTE)BDY(NEXT(ba));
863: for ( tn = n; tn; tn = NEXT(tn) ) {
864: bn = BDY((LIST)BDY(tn));
1.55 noro 865: if ( !bn ) continue;
1.53 noro 866: pn = (QUOTE)BDY(bn); vn = (QUOTE)BDY(NEXT(bn));
1.55 noro 867: if ( !compquote(CO,pa,pn) ) {
868: if ( !compquote(CO,va,vn) ) break;
869: else return 0;
870: }
1.53 noro 871: }
872: if ( !tn ) {
873: MKNODE(tn,(pointer)BDY(ta),n);
874: n = tn;
875: }
876: }
1.56 noro 877: *rp = n;
878: return 1;
1.53 noro 879: }
880:
1.105 noro 881: int qt_match_node(NODE f,NODE pat,NODE *rp) {
1.56 noro 882: NODE r,a,tf,tp,r1;
883: int ret;
1.53 noro 884:
885: if ( length(f) != length(pat) ) return 0;
886: r = 0;
887: for ( tf = f, tp = pat; tf; tf = NEXT(tf), tp = NEXT(tp) ) {
1.105 noro 888: ret = qt_match((Obj)BDY(tf),(Obj)BDY(tp),&a);
1.56 noro 889: if ( !ret ) return 0;
890: ret = merge_matching_node(r,a,&r1);
891: if ( !ret ) return 0;
892: else r = r1;
1.53 noro 893: }
1.56 noro 894: *rp = r;
895: return 1;
1.53 noro 896: }
897:
1.66 noro 898: /* f = [a,b,c,...] pat = [X,Y,...] rpat matches the rest of f */
899:
1.105 noro 900: int qt_match_cons(NODE f,NODE pat,Obj rpat,NODE *rp) {
1.66 noro 901: QUOTE q;
902: Q id;
903: FNODE fn;
904: NODE r,a,tf,tp,r1,arg;
905: int ret;
906: LIST list,alist;
907:
908: /* matching of the head part */
909: if ( length(f) < length(pat) ) return 0;
910: r = 0;
911: for ( tf = f, tp = pat; tp; tf = NEXT(tf), tp = NEXT(tp) ) {
1.105 noro 912: ret = qt_match((Obj)BDY(tf),(Obj)BDY(tp),&a);
1.66 noro 913: if ( !ret ) return 0;
914: ret = merge_matching_node(r,a,&r1);
915: if ( !ret ) return 0;
916: else r = r1;
917: }
918: /* matching of the rest */
919: MKLIST(list,tf);
920: STOQ(I_LIST,id); a = mknode(2,id,list);
921: MKLIST(alist,a);
922: arg = mknode(1,alist);
923: Pfunargs_to_quote(arg,&q);
1.105 noro 924: ret = qt_match((Obj)q,rpat,&a);
1.66 noro 925: if ( !ret ) return 0;
926: ret = merge_matching_node(r,a,&r1);
927: if ( !ret ) return 0;
928: *rp = r1;
929: return 1;
930: }
931:
1.53 noro 932: void get_quote_id_arg(QUOTE f,int *id,NODE *r)
933: {
934: LIST fa;
935: NODE arg,fab;
936:
937: arg = mknode(1,f); Pquote_to_funargs(arg,&fa); fab = BDY((LIST)fa);
938: *id = QTOS((Q)BDY(fab)); *r = NEXT(fab);
939: }
940:
1.56 noro 941: /* *rp : [[quote(A),quote(1)],...] */
1.53 noro 942:
1.105 noro 943: int qt_match(Obj f, Obj pat, NODE *rp)
1.53 noro 944: {
945: NODE tf,tp,head,body;
946: NODE parg,farg,r;
1.66 noro 947: Obj rpat;
1.53 noro 948: LIST fa,l;
949: int pid,id;
1.55 noro 950: FUNC ff,pf;
1.56 noro 951: int ret;
1.64 noro 952: QUOTE q;
953: FNODE g;
1.53 noro 954:
1.67 noro 955: if ( !f )
956: if ( !pat ) {
957: *rp = 0; return 1;
958: } else
959: return 0;
960: else if ( OID(pat) == O_LIST ) {
1.53 noro 961: if ( OID(f) == O_LIST )
1.105 noro 962: return qt_match_node(BDY((LIST)f),BDY((LIST)pat),rp);
1.53 noro 963: else
964: return 0;
965: } else if ( OID(pat) == O_QUOTE ) {
1.67 noro 966: pid = ((FNODE)BDY((QUOTE)pat))->id;
1.53 noro 967: switch ( pid ) {
1.55 noro 968: case I_FORMULA:
969: if ( compquote(CO,f,pat) )
970: return 0;
971: else {
1.67 noro 972: *rp = 0; return 1;
1.55 noro 973: }
974: break;
1.67 noro 975:
976: case I_LIST: case I_CONS:
977: get_quote_id_arg((QUOTE)pat,&pid,&parg);
978: if ( OID(f) == O_LIST )
979: tf = BDY((LIST)f);
980: else if ( OID(f) == O_QUOTE
981: && ((FNODE)BDY((QUOTE)f))->id == pid ) {
982: get_quote_id_arg((QUOTE)f,&id,&farg);
983: tf = BDY((LIST)BDY(farg));
984: } else
985: return 0;
986:
1.66 noro 987: tp = BDY((LIST)BDY(parg));
1.67 noro 988: if ( pid == I_LIST )
1.105 noro 989: return qt_match_node(tf,tp,rp);
1.67 noro 990: else {
991: rpat = (Obj)BDY(NEXT(parg));
1.105 noro 992: return qt_match_cons(tf,tp,rpat,rp);
1.67 noro 993: }
994:
1.53 noro 995: case I_PVAR:
996: /* [[pat,f]] */
997: r = mknode(2,pat,f); MKLIST(l,r);
1.56 noro 998: *rp = mknode(1,l);
999: return 1;
1.67 noro 1000:
1.53 noro 1001: case I_IFUNC:
1002: /* F(X,Y,...) = ... */
1.67 noro 1003: get_quote_id_arg((QUOTE)f,&id,&farg);
1004: get_quote_id_arg((QUOTE)pat,&pid,&parg);
1.53 noro 1005: if ( id == I_FUNC ) {
1.54 noro 1006: r = mknode(2,BDY(parg),BDY(farg)); MKLIST(l,r);
1007: head = mknode(1,l);
1.105 noro 1008: ret = qt_match(BDY(NEXT(farg)),
1.56 noro 1009: BDY(NEXT(parg)),&body);
1010: if ( !ret ) return 0;
1011: else return merge_matching_node(head,body,rp);
1.53 noro 1012: } else
1013: return 0;
1.64 noro 1014:
1.67 noro 1015: case I_NARYOP: case I_BOP: case I_FUNC:
1.64 noro 1016: /* X+Y = ... */
1.67 noro 1017: /* f(...) = ... */
1018: if ( OID(f) != O_QUOTE ) return 0;
1019: id = ((FNODE)BDY((QUOTE)f))->id;
1020: if ( pid == I_FUNC )
1021: ;
1022: else {
1023: /* XXX converting to I_BOP */
1024: if ( pid == I_NARYOP ) {
1.70 noro 1025: g = fnode_to_bin(BDY((QUOTE)pat),1);
1.67 noro 1026: MKQUOTE(q,g); pat = (Obj)q;
1027: }
1028: if ( id == I_NARYOP ) {
1.70 noro 1029: g = fnode_to_bin(BDY((QUOTE)f),1);
1.67 noro 1030: MKQUOTE(q,g); f = (Obj)q;
1031: }
1032: }
1033: get_quote_id_arg((QUOTE)pat,&pid,&parg);
1034: get_quote_id_arg((QUOTE)f,&id,&farg);
1.64 noro 1035: if ( compqa(CO,BDY(farg),BDY(parg)) ) return 0;
1.105 noro 1036: return qt_match_node(NEXT(farg),NEXT(parg),rp);
1.64 noro 1037:
1.53 noro 1038: default:
1.67 noro 1039: if ( OID(f) != O_QUOTE ) return 0;
1040: id = ((FNODE)BDY((QUOTE)f))->id;
1041: if ( id != pid ) return 0;
1042: get_quote_id_arg((QUOTE)pat,&pid,&parg);
1043: get_quote_id_arg((QUOTE)f,&id,&farg);
1.105 noro 1044: return qt_match_node(farg,parg,rp);
1.53 noro 1045: }
1046: }
1.13 noro 1047: }
1048:
1.14 noro 1049: void Pquotetotex(NODE arg,STRING *rp)
1.13 noro 1050: {
1.14 noro 1051: TB tb;
1.13 noro 1052:
1.14 noro 1053: NEWTB(tb);
1.27 noro 1054: /* XXX for DP */
1055: is_lt = 1;
1.14 noro 1056: fnodetotex_tb(BDY((QUOTE)ARG0(arg)),tb);
1057: tb_to_string(tb,rp);
1.13 noro 1058: }
1059:
1.14 noro 1060: void Pquotetotex_tb(NODE arg,Q *rp)
1.13 noro 1061: {
1062: int i;
1.14 noro 1063: TB tb;
1.13 noro 1064:
1.14 noro 1065: asir_assert(ARG1(arg),O_TB,"quotetotex_tb");
1.27 noro 1066: /* XXX for DP */
1067: is_lt = 1;
1.14 noro 1068: fnodetotex_tb(BDY((QUOTE)ARG0(arg)),ARG1(arg));
1.13 noro 1069: *rp = 0;
1070: }
1071:
1.14 noro 1072: void Pstring_to_tb(NODE arg,TB *rp)
1073: {
1074: TB tb;
1075:
1076: asir_assert(ARG0(arg),O_STR,"string_to_tb");
1077: NEWTB(tb);
1078: tb->body[0] = BDY((STRING)ARG0(arg));
1079: tb->next++;
1080: *rp = tb;
1081: }
1082:
1083: void Ptb_to_string(NODE arg,STRING *rp)
1084: {
1085: TB tb;
1086:
1087: asir_assert(ARG0(arg),O_TB,"tb_to_string");
1088: tb = (TB)ARG0(arg);
1089: tb_to_string(tb,rp);
1090: }
1091:
1092: void tb_to_string(TB tb,STRING *rp)
1.13 noro 1093: {
1.14 noro 1094: int j,len;
1.13 noro 1095: char *all,*p,*q;
1096:
1.14 noro 1097: for ( j = 0, len = 0; j < tb->next; j++ )
1098: len += strlen(tb->body[j]);
1099: all = (char *)MALLOC_ATOMIC((len+1)*sizeof(char));
1100: for ( j = 0, p = all; j < tb->next; j++ )
1101: for ( q = tb->body[j]; *q; *p++ = *q++ );
1102: *p = 0;
1103: MKSTR(*rp,all);
1104: }
1105:
1106: void Pclear_tb(NODE arg,Q *rp)
1107: {
1108: TB tb;
1109: int j;
1110:
1111: asir_assert(ARG0(arg),O_TB,"clear_tb");
1112: tb = (TB)ARG0(arg);
1113: for ( j = 0; j < tb->next; j++ )
1114: tb->body[j] = 0;
1115: tb->next = 0;
1116: *rp = 0;
1.13 noro 1117: }
1.5 noro 1118:
1119: void Pstr_len(arg,rp)
1120: NODE arg;
1121: Q *rp;
1122: {
1.16 noro 1123: Obj obj;
1124: TB tb;
1125: int r,i;
1.5 noro 1126:
1.16 noro 1127: obj = (Obj)ARG0(arg);
1128: if ( !obj || (OID(obj) != O_STR && OID(obj) != O_TB) )
1129: error("str_len : invalid argument");
1130: if ( OID(obj) == O_STR)
1131: r = strlen(BDY((STRING)obj));
1132: else if ( OID(obj) == O_TB ) {
1133: tb = (TB)obj;
1134: for ( r = i = 0; i < tb->next; i++ )
1135: r += strlen(tb->body[i]);
1136: }
1.5 noro 1137: STOQ(r,*rp);
1138: }
1139:
1140: void Pstr_chr(arg,rp)
1141: NODE arg;
1142: Q *rp;
1143: {
1144: STRING str,terminator;
1145: Q start;
1146: char *p,*ind;
1147: int chr,spos,r;
1148:
1149: str = (STRING)ARG0(arg);
1150: start = (Q)ARG1(arg);
1151: terminator = (STRING)ARG2(arg);
1152: asir_assert(str,O_STR,"str_chr");
1153: asir_assert(start,O_N,"str_chr");
1154: asir_assert(terminator,O_STR,"str_chr");
1155: p = BDY(str);
1156: spos = QTOS(start);
1157: chr = BDY(terminator)[0];
1.8 noro 1158: if ( spos > (int)strlen(p) )
1.5 noro 1159: r = -1;
1160: else {
1161: ind = strchr(p+spos,chr);
1162: if ( ind )
1163: r = ind-p;
1164: else
1165: r = -1;
1166: }
1167: STOQ(r,*rp);
1168: }
1169:
1170: void Psub_str(arg,rp)
1171: NODE arg;
1172: STRING *rp;
1173: {
1174: STRING str;
1175: Q head,tail;
1176: char *p,*r;
1177: int spos,epos,len;
1178:
1179: str = (STRING)ARG0(arg);
1180: head = (Q)ARG1(arg);
1181: tail = (Q)ARG2(arg);
1182: asir_assert(str,O_STR,"sub_str");
1183: asir_assert(head,O_N,"sub_str");
1184: asir_assert(tail,O_N,"sub_str");
1185: p = BDY(str);
1186: spos = QTOS(head);
1187: epos = QTOS(tail);
1188: len = strlen(p);
1189: if ( (spos >= len) || (epos < spos) ) {
1190: *rp = 0; return;
1191: }
1192: if ( epos >= len )
1193: epos = len-1;
1194: len = epos-spos+1;
1195: r = (char *)MALLOC(len+1);
1196: strncpy(r,p+spos,len);
1197: r[len] = 0;
1198: MKSTR(*rp,r);
1199: }
1.3 noro 1200:
1201: void Pstrtoascii(arg,rp)
1202: NODE arg;
1203: LIST *rp;
1204: {
1205: STRING str;
1206: unsigned char *p;
1207: int len,i;
1208: NODE n,n1;
1209: Q q;
1210:
1211: str = (STRING)ARG0(arg);
1212: asir_assert(str,O_STR,"strtoascii");
1213: p = BDY(str);
1214: len = strlen(p);
1215: for ( i = len-1, n = 0; i >= 0; i-- ) {
1216: UTOQ((unsigned int)p[i],q);
1217: MKNODE(n1,q,n);
1218: n = n1;
1219: }
1220: MKLIST(*rp,n);
1221: }
1222:
1223: void Pasciitostr(arg,rp)
1224: NODE arg;
1225: STRING *rp;
1226: {
1227: LIST list;
1228: unsigned char *p;
1229: int len,i,j;
1230: NODE n;
1231: Q q;
1232:
1233: list = (LIST)ARG0(arg);
1234: asir_assert(list,O_LIST,"asciitostr");
1235: n = BDY(list);
1236: len = length(n);
1237: p = MALLOC_ATOMIC(len+1);
1238: for ( i = 0; i < len; i++, n = NEXT(n) ) {
1239: q = (Q)BDY(n);
1240: asir_assert(q,O_N,"asciitostr");
1241: j = QTOS(q);
1.4 noro 1242: if ( j >= 256 || j <= 0 )
1.3 noro 1243: error("asciitostr : argument out of range");
1244: p[i] = j;
1245: }
1246: p[i] = 0;
1247: MKSTR(*rp,(char *)p);
1248: }
1.1 noro 1249:
1250: void Peval_str(arg,rp)
1251: NODE arg;
1252: Obj *rp;
1253: {
1254: FNODE fnode;
1255: char *cmd;
1.10 ohara 1256: #if defined(PARI)
1.8 noro 1257: void recover(int);
1258:
1.1 noro 1259: recover(0);
1.11 saito 1260: # if !(PARI_VERSION_CODE > 131588)
1.1 noro 1261: if ( setjmp(environnement) ) {
1262: avma = top; recover(1);
1263: resetenv("");
1264: }
1.11 saito 1265: # endif
1.1 noro 1266: #endif
1267: cmd = BDY((STRING)ARG0(arg));
1.9 noro 1268: exprparse_create_var(0,cmd,&fnode);
1.1 noro 1269: *rp = eval(fnode);
1270: }
1271:
1272: void Prtostr(arg,rp)
1273: NODE arg;
1274: STRING *rp;
1275: {
1276: char *b;
1277: int len;
1278:
1.2 noro 1279: len = estimate_length(CO,ARG0(arg));
1.12 noro 1280: b = (char *)MALLOC_ATOMIC(len+1);
1.1 noro 1281: soutput_init(b);
1282: sprintexpr(CO,ARG0(arg));
1283: MKSTR(*rp,b);
1284: }
1285:
1286: void Pstrtov(arg,rp)
1287: NODE arg;
1288: P *rp;
1289: {
1.8 noro 1290: char *p;
1.1 noro 1291:
1292: p = BDY((STRING)ARG0(arg));
1293: #if 0
1294: if ( !islower(*p) )
1295: *rp = 0;
1296: else {
1297: for ( t = p+1; t && (isalnum(*t) || *t == '_'); t++ );
1298: if ( *t )
1299: *rp = 0;
1300: else
1301: makevar(p,rp);
1302: }
1303: #else
1304: makevar(p,rp);
1305: #endif
1.14 noro 1306: }
1307:
1.15 noro 1308: static struct TeXSymbol texsymbol[] = {
1309: {"sin","\\sin"},
1310: {"cos","\\cos"},
1311: {"tan","\\tan"},
1312: {"sinh","\\sinh"},
1313: {"cosh","\\cosh"},
1314: {"tanh","\\tanh"},
1315: {"exp","\\exp"},
1316: {"log","\\log"},
1317:
1318: /* Greek Letters (lower case) */
1319: {"alpha","\\alpha"},
1320: {"beta","\\beta"},
1321: {"gamma","\\gamma"},
1322: {"delta","\\delta"},
1323: {"epsilon","\\epsilon"},
1324: {"varepsilon","\\varepsilon"},
1325: {"zeta","\\zeta"},
1326: {"eta","\\eta"},
1327: {"theta","\\theta"},
1328: {"vartheta","\\vartheta"},
1329: {"iota","\\iota"},
1330: {"kappa","\\kappa"},
1331: {"lambda","\\lambda"},
1332: {"mu","\\mu"},
1333: {"nu","\\nu"},
1334: {"xi","\\xi"},
1335: {"pi","\\pi"},
1336: {"varpi","\\varpi"},
1337: {"rho","\\rho"},
1338: {"sigma","\\sigma"},
1339: {"varsigma","\\varsigma"},
1340: {"tau","\\tau"},
1341: {"upsilon","\\upsilon"},
1342: {"phi","\\phi"},
1343: {"varphi","\\varphi"},
1344: {"chi","\\chi"},
1345: {"omega","\\omega"},
1346:
1347: /* Greek Letters, (upper case) */
1348: {"ggamma","\\Gamma"},
1349: {"ddelta","\\Delta"},
1350: {"ttheta","\\Theta"},
1351: {"llambda","\\Lambda"},
1352: {"xxi","\\Xi"},
1353: {"ppi","\\Pi"},
1354: {"ssigma","\\Sigma"},
1355: {"uupsilon","\\Upsilon"},
1356: {"pphi","\\Phi"},
1357: {"ppsi","\\Psi"},
1358: {"oomega","\\Omega"},
1359:
1360: /* Our own mathematical functions */
1361: {"algebra_tensor","\\otimes"},
1362: {"base_where","{\\rm \\ where \\ }"},
1363: /* Mathematical constants */
1364: {"c_pi","\\pi"},
1365: {"c_i","\\sqrt{-1}"},
1366:
1367: /* Temporary */
1368: {0,0}
1369: };
1370:
1.14 noro 1371: char *symbol_name(char *name)
1372: {
1.15 noro 1373: int i;
1374:
1.41 noro 1375: if ( !name || strlen(name) == 0 )
1376: return "";
1.38 noro 1377: if ( !(conv_flag & CONV_TABLE) )
1378: return name;
1379:
1.18 noro 1380: if ( user_texsymbol )
1381: for ( i = 0; user_texsymbol[i].text; i++ )
1382: if ( !strcmp(user_texsymbol[i].text,name) )
1383: return user_texsymbol[i].symbol;
1.15 noro 1384: for ( i = 0; texsymbol[i].text; i++ )
1385: if ( !strcmp(texsymbol[i].text,name) )
1386: return texsymbol[i].symbol;
1.41 noro 1387: return 0;
1.52 noro 1388: }
1389:
1390: void Pget_function_name(NODE arg,STRING *rp)
1391: {
1392: QUOTEARG qa;
1393: ARF f;
1394: char *opname;
1395:
1396: qa = (QUOTEARG)BDY(arg);
1397: if ( !qa || OID(qa) != O_QUOTEARG || qa->type != A_arf )
1398: *rp = 0;
1399: else {
1400: f = (ARF)BDY(qa);
1401: opname = f->name;
1402: MKSTR(*rp,opname);
1403: }
1.14 noro 1404: }
1405:
1.51 noro 1406: FNODE strip_paren(FNODE);
1407:
1.14 noro 1408: void fnodetotex_tb(FNODE f,TB tb)
1409: {
1.91 noro 1410: NODE n,t,t0,args;
1.38 noro 1411: char vname[BUFSIZ],prefix[BUFSIZ];
1412: char *opname,*vname_conv,*prefix_conv;
1.14 noro 1413: Obj obj;
1.46 noro 1414: int i,len,allzero,elen,elen2,si;
1.40 noro 1415: C cplx;
1416: char *r;
1.91 noro 1417: FNODE fi,f2,f1;
1.14 noro 1418:
1419: write_tb(" ",tb);
1420: if ( !f ) {
1421: write_tb("0",tb);
1422: return;
1423: }
1424: switch ( f->id ) {
1425: /* unary operators */
1.23 noro 1426: case I_NOT:
1427: write_tb("\\neg (",tb);
1428: fnodetotex_tb((FNODE)FA0(f),tb);
1429: write_tb(")",tb);
1430: break;
1431: case I_PAREN:
1432: write_tb("(",tb);
1433: fnodetotex_tb((FNODE)FA0(f),tb);
1434: write_tb(")",tb);
1435: break;
1436: case I_MINUS:
1437: write_tb("-",tb);
1438: fnodetotex_tb((FNODE)FA0(f),tb);
1439: break;
1440:
1441: /* binary operators */
1442: /* arg list */
1443: /* I_AND, I_OR => FA0(f), FA1(f) */
1444: /* otherwise => FA1(f), FA2(f) */
1445: case I_BOP:
1446: opname = ((ARF)FA0(f))->name;
1.70 noro 1447: switch ( opname[0] ) {
1448: case '+':
1449: fnodetotex_tb((FNODE)FA1(f),tb);
1450: if ( !top_is_minus((FNODE)FA2(f)) ) write_tb(opname,tb);
1451: fnodetotex_tb((FNODE)FA2(f),tb);
1452: break;
1453: case '-':
1454: if ( FA1(f) ) fnodetotex_tb((FNODE)FA1(f),tb);
1455: write_tb(opname,tb);
1456: fnodetotex_tb((FNODE)FA2(f),tb);
1457: break;
1458: case '*':
1459: fnodetotex_tb((FNODE)FA1(f),tb);
1460: write_tb(" ",tb);
1461: /* XXX special care for DP */
1462: f2 = (FNODE)FA2(f);
1463: if ( f2->id == I_EV ) {
1464: n = (NODE)FA0(f2);
1465: for ( i = 0; n; n = NEXT(n), i++ ) {
1466: fi = (FNODE)BDY(n);
1467: if ( fi->id != I_FORMULA || FA0(fi) )
1468: break;
1469: }
1470: if ( n )
1471: fnodetotex_tb((FNODE)FA2(f),tb);
1472: } else
1.23 noro 1473: fnodetotex_tb((FNODE)FA2(f),tb);
1.70 noro 1474: break;
1475: case '/':
1476: write_tb("\\frac{",tb);
1477: fnodetotex_tb((FNODE)FA1(f),tb);
1478: write_tb("} {",tb);
1479: fnodetotex_tb((FNODE)FA2(f),tb);
1480: write_tb("}",tb);
1481: break;
1482: case '^':
1483: fnodetotex_tb((FNODE)FA1(f),tb);
1484: write_tb("^{",tb);
1485: fnodetotex_tb(strip_paren((FNODE)FA2(f)),tb);
1486: write_tb("} ",tb);
1487: break;
1488: case '%':
1489: fnodetotex_tb((FNODE)FA1(f),tb);
1490: write_tb(" {\\rm mod}\\, ",tb);
1.23 noro 1491: fnodetotex_tb((FNODE)FA2(f),tb);
1.70 noro 1492: break;
1493: default:
1494: error("invalid binary operator");
1495: break;
1496: }
1.23 noro 1497: break;
1.91 noro 1498: case I_NARYOP:
1499: args = (NODE)FA1(f);
1500: write_tb("(",tb);
1501: switch ( OPNAME(f) ) {
1502: case '+':
1503: fnodetotex_tb((FNODE)BDY(args),tb);
1504: for ( args = NEXT(args); args; args = NEXT(args) ) {
1505: write_tb("+",tb);
1506: fnodetotex_tb((FNODE)BDY(args),tb);
1507: }
1508: break;
1509: case '*':
1510: f1 = (FNODE)BDY(args);
1511: if ( f1->id == I_FORMULA && MUNIQ(FA0(f1)) )
1512: write_tb("-",tb);
1513: else
1514: fnodetotex_tb(f1,tb);
1515: write_tb(" ",tb);
1516: for ( args = NEXT(args); args; args = NEXT(args) ) {
1517: /* XXX special care for DP */
1518: f2 = (FNODE)BDY(args);
1519: if ( f2->id == I_EV ) {
1520: n = (NODE)FA0(f2);
1521: for ( i = 0; n; n = NEXT(n), i++ ) {
1522: fi = (FNODE)BDY(n);
1523: if ( fi->id != I_FORMULA || FA0(fi) )
1524: break;
1525: }
1526: if ( n )
1527: fnodetotex_tb(f2,tb);
1528: } else
1529: fnodetotex_tb(f2,tb);
1530: }
1531: break;
1532: default:
1533: error("invalid nary op");
1534: break;
1535: }
1536: write_tb(")",tb);
1537: break;
1.23 noro 1538:
1539: case I_COP:
1540: switch( (cid)FA0(f) ) {
1541: case C_EQ:
1542: fnodetotex_tb((FNODE)FA1(f),tb);
1543: write_tb(" = ",tb);
1544: fnodetotex_tb((FNODE)FA2(f),tb);
1545: break;
1546: case C_NE:
1547: fnodetotex_tb((FNODE)FA1(f),tb);
1548: write_tb(" \\neq ",tb);
1549: fnodetotex_tb((FNODE)FA2(f),tb);
1550: break;
1551: case C_GT:
1552: fnodetotex_tb((FNODE)FA1(f),tb);
1.45 noro 1553: write_tb(" > ",tb);
1.23 noro 1554: fnodetotex_tb((FNODE)FA2(f),tb);
1555: break;
1556: case C_LT:
1557: fnodetotex_tb((FNODE)FA1(f),tb);
1.45 noro 1558: write_tb(" < ",tb);
1.23 noro 1559: fnodetotex_tb((FNODE)FA2(f),tb);
1.14 noro 1560: break;
1.23 noro 1561: case C_GE:
1562: fnodetotex_tb((FNODE)FA1(f),tb);
1563: write_tb(" \\geq ",tb);
1564: fnodetotex_tb((FNODE)FA2(f),tb);
1.14 noro 1565: break;
1.23 noro 1566: case C_LE:
1567: fnodetotex_tb((FNODE)FA1(f),tb);
1568: write_tb(" \\leq ",tb);
1569: fnodetotex_tb((FNODE)FA2(f),tb);
1.14 noro 1570: break;
1571: }
1572: break;
1573:
1.23 noro 1574: case I_LOP:
1575: switch( (lid)FA0(f) ) {
1576: case L_EQ:
1577: fnodetotex_tb((FNODE)FA1(f),tb);
1578: write_tb(" = ",tb);
1579: fnodetotex_tb((FNODE)FA2(f),tb);
1580: break;
1581: case L_NE:
1582: fnodetotex_tb((FNODE)FA1(f),tb);
1583: write_tb(" \\neq ",tb);
1584: fnodetotex_tb((FNODE)FA2(f),tb);
1585: break;
1586: case L_GT:
1587: fnodetotex_tb((FNODE)FA1(f),tb);
1.45 noro 1588: write_tb(" > ",tb);
1.23 noro 1589: fnodetotex_tb((FNODE)FA2(f),tb);
1590: break;
1591: case L_LT:
1592: fnodetotex_tb((FNODE)FA1(f),tb);
1.45 noro 1593: write_tb(" < ",tb);
1.23 noro 1594: fnodetotex_tb((FNODE)FA2(f),tb);
1595: break;
1596: case L_GE:
1597: fnodetotex_tb((FNODE)FA1(f),tb);
1598: write_tb(" \\geq ",tb);
1599: fnodetotex_tb((FNODE)FA2(f),tb);
1.14 noro 1600: break;
1.23 noro 1601: case L_LE:
1602: fnodetotex_tb((FNODE)FA1(f),tb);
1603: write_tb(" \\leq ",tb);
1604: fnodetotex_tb((FNODE)FA2(f),tb);
1.14 noro 1605: break;
1.23 noro 1606: case L_AND:
1607: fnodetotex_tb((FNODE)FA1(f),tb);
1.14 noro 1608: write_tb(" {\\rm \\ and\\ } ",tb);
1.23 noro 1609: fnodetotex_tb((FNODE)FA2(f),tb);
1610: break;
1611: case L_OR:
1.14 noro 1612: fnodetotex_tb((FNODE)FA1(f),tb);
1.23 noro 1613: write_tb(" {\\rm \\ or\\ } ",tb);
1614: fnodetotex_tb((FNODE)FA2(f),tb);
1.14 noro 1615: break;
1.23 noro 1616: case L_NOT:
1617: /* XXX : L_NOT is a unary operator */
1618: write_tb("\\neg (",tb);
1.14 noro 1619: fnodetotex_tb((FNODE)FA1(f),tb);
1.23 noro 1620: write_tb(")",tb);
1621: return;
1.14 noro 1622: }
1623: break;
1624:
1.23 noro 1625: case I_AND:
1626: fnodetotex_tb((FNODE)FA0(f),tb);
1627: write_tb(" {\\rm \\ and\\ } ",tb);
1628: fnodetotex_tb((FNODE)FA1(f),tb);
1629: break;
1630:
1631: case I_OR:
1632: fnodetotex_tb((FNODE)FA0(f),tb);
1633: write_tb(" {\\rm \\ or\\ } ",tb);
1634: fnodetotex_tb((FNODE)FA1(f),tb);
1635: break;
1636:
1.14 noro 1637: /* ternary operators */
1638: case I_CE:
1639: error("fnodetotex_tb : not implemented yet");
1640: break;
1641:
1642: /* lists */
1643: case I_LIST:
1644: write_tb(" [ ",tb);
1645: n = (NODE)FA0(f);
1646: fnodenodetotex_tb(n,tb);
1647: write_tb("]",tb);
1648: break;
1649:
1650: /* function */
1.23 noro 1651: case I_FUNC:
1.40 noro 1652: if ( !strcmp(((FUNC)FA0(f))->name,"@pi") )
1653: write_tb("\\pi",tb);
1654: else if ( !strcmp(((FUNC)FA0(f))->name,"@e") )
1655: write_tb("e",tb);
1656: else {
1657: opname = conv_rule(((FUNC)FA0(f))->name);
1658: write_tb(opname,tb);
1659: write_tb("(",tb);
1660: fargstotex_tb(opname,FA1(f),tb);
1661: write_tb(")",tb);
1662: }
1.23 noro 1663: break;
1664:
1665: /* XXX */
1666: case I_CAR:
1.28 noro 1667: opname = conv_rule("car");
1.23 noro 1668: write_tb(opname,tb);
1669: write_tb("(",tb);
1670: fargstotex_tb(opname,FA0(f),tb);
1671: write_tb(")",tb);
1672: break;
1673:
1674: case I_CDR:
1.28 noro 1675: opname = conv_rule("cdr");
1.23 noro 1676: write_tb(opname,tb);
1677: write_tb("(",tb);
1678: fargstotex_tb(opname,FA0(f),tb);
1679: write_tb(")",tb);
1680: break;
1681:
1682: /* exponent vector */
1683: case I_EV:
1684: n = (NODE)FA0(f);
1.31 noro 1685: if ( dp_vars_hweyl ) {
1686: elen = length(n);
1687: elen2 = elen>>1;
1688: elen = elen2<<1;
1689: }
1.23 noro 1690: allzero = 1;
1.27 noro 1691: if ( show_lt && is_lt )
1692: write_tb("\\underline{",tb);
1.23 noro 1693: for ( t0 = 0, i = 0; n; n = NEXT(n), i++ ) {
1694: fi = (FNODE)BDY(n);
1695: if ( fi->id == I_FORMULA && !FA0(fi) ) continue;
1696: allzero = 0;
1.38 noro 1697: if ( dp_vars && i < dp_vars_len ) {
1698: strcpy(vname,dp_vars[i]);
1699: vname_conv = conv_rule(vname);
1700: } else {
1701: if ( dp_vars_hweyl ) {
1.44 noro 1702: if ( i < elen2 ) {
1.38 noro 1703: strcpy(prefix,dp_vars_prefix?dp_vars_prefix:"x");
1.44 noro 1704: prefix_conv = conv_rule(prefix);
1705: vname_conv = (char *)ALLOCA(strlen(prefix_conv)+50);
1.46 noro 1706: si = i+dp_vars_origin;
1707: sprintf(vname_conv,(si>=0&&si<10)?"%s_%d":"%s_{%d}",
1708: prefix_conv,si);
1.44 noro 1709: } else if ( i < elen ) {
1.46 noro 1710: strcpy(prefix,
1711: dp_dvars_prefix?dp_dvars_prefix:"\\partial");
1.44 noro 1712: prefix_conv = conv_rule(prefix);
1713: vname_conv = (char *)ALLOCA(strlen(prefix_conv)+50);
1.46 noro 1714: si = i+dp_dvars_origin-elen2;
1715: sprintf(vname_conv,(si>=0&&si<10)?"%s_%d":"%s_{%d}",
1716: prefix_conv,si);
1.44 noro 1717: } else {
1.38 noro 1718: strcpy(prefix,"h");
1.44 noro 1719: vname_conv = conv_rule(prefix);
1720: }
1721: } else {
1.38 noro 1722: strcpy(prefix,dp_vars_prefix?dp_vars_prefix:"x");
1.44 noro 1723: prefix_conv = conv_rule(prefix);
1724: vname_conv = (char *)ALLOCA(strlen(prefix_conv)+50);
1.46 noro 1725: si = i+dp_vars_origin;
1726: sprintf(vname_conv,(si>=0&&si<10)?"%s_%d":"%s_{%d}",
1727: prefix_conv,si);
1.44 noro 1728: }
1.38 noro 1729: }
1.23 noro 1730: if ( fi->id == I_FORMULA && UNIQ(FA0(fi)) ) {
1731: len = strlen(vname_conv);
1732: opname = MALLOC_ATOMIC(len+2);
1733: sprintf(opname,"%s ",vname_conv);
1.14 noro 1734: write_tb(opname,tb);
1.23 noro 1735: } else {
1736: len = strlen(vname_conv);
1737: /* 2: ^{ */
1738: opname = MALLOC_ATOMIC(len+1+2);
1739: sprintf(opname,"%s^{",vname_conv);
1.14 noro 1740: write_tb(opname,tb);
1.23 noro 1741: fnodetotex_tb((FNODE)BDY(n),tb);
1742: write_tb("} ",tb);
1743: }
1.14 noro 1744: }
1.23 noro 1745: /* XXX */
1746: if ( allzero )
1747: write_tb(" 1 ",tb);
1.27 noro 1748: if ( show_lt && is_lt ) {
1749: write_tb("}",tb);
1750: is_lt = 0;
1751: }
1.14 noro 1752: break;
1753:
1.23 noro 1754: /* string */
1.14 noro 1755: case I_STR:
1756: write_tb((char *)FA0(f),tb);
1757: break;
1758:
1.23 noro 1759: /* internal object */
1.14 noro 1760: case I_FORMULA:
1761: obj = (Obj)FA0(f);
1.40 noro 1762: if ( !obj )
1.42 noro 1763: write_tb("0",tb);
1.40 noro 1764: else if ( OID(obj) == O_N && NID(obj) == N_C ) {
1765: cplx = (C)obj;
1766: write_tb("(",tb);
1767: if ( cplx->r ) {
1768: r = objtostr((Obj)cplx->r); write_tb(r,tb);
1769: }
1770: if ( cplx->i ) {
1771: if ( cplx->r && compnum(0,cplx->i,0) > 0 ) {
1772: write_tb("+",tb);
1773: if ( !UNIQ(cplx->i) ) {
1774: r = objtostr((Obj)cplx->i); write_tb(r,tb);
1775: }
1776: } else if ( MUNIQ(cplx->i) )
1777: write_tb("-",tb);
1778: else if ( !UNIQ(cplx->i) ) {
1779: r = objtostr((Obj)cplx->i); write_tb(r,tb);
1780: }
1781: write_tb("\\sqrt{-1}",tb);
1782: }
1783: write_tb(")",tb);
1784: } else if ( OID(obj) == O_P )
1785: write_tb(conv_rule(VR((P)obj)->name),tb);
1786: else
1787: write_tb(objtostr(obj),tb);
1.14 noro 1788: break;
1789:
1.23 noro 1790: /* program variable */
1.14 noro 1791: case I_PVAR:
1792: if ( FA1(f) )
1793: error("fnodetotex_tb : not implemented yet");
1794: GETPVNAME(FA0(f),opname);
1795: write_tb(opname,tb);
1796: break;
1797:
1798: default:
1799: error("fnodetotex_tb : not implemented yet");
1800: }
1.40 noro 1801: }
1802:
1803: char *objtostr(Obj obj)
1804: {
1805: int len;
1806: char *r;
1807:
1808: len = estimate_length(CO,obj);
1809: r = (char *)MALLOC_ATOMIC(len+1);
1810: soutput_init(r);
1811: sprintexpr(CO,obj);
1812: return r;
1.50 ohara 1813: }
1814:
1815: void Psprintf(NODE arg,STRING *rp)
1816: {
1817: STRING string;
1818: char *s,*t,*r;
1819: int argc,n,len;
1820: NODE node;
1821:
1822: string = (STRING)ARG0(arg);
1823: asir_assert(string,O_STR,"sprintf");
1824: s = BDY(string);
1825: for(n = 0, t = s; *t; t++) {
1826: if (*t=='%' && *(t+1)=='a') {
1827: n++;
1828: }
1829: }
1830: for(node = NEXT(arg), argc = 0, len = strlen(s); node; node = NEXT(node), argc++) {
1831: len += estimate_length(CO,BDY(node));
1832: }
1833: if (argc < n) {
1834: error("sprintf: invalid argument");
1835: }
1836: r = (char *)MALLOC_ATOMIC(len);
1837: for(node = NEXT(arg), t = r; *s; s++) {
1838: if (*s=='%' && *(s+1)=='a') {
1839: strcpy(t,objtostr(BDY(node)));
1840: node = NEXT(node);
1841: t = strchr(t,0);
1842: s++;
1843: }else {
1844: *t++ = *s;
1845: }
1846: }
1847: *t = 0;
1848: MKSTR(*rp,r);
1.14 noro 1849: }
1850:
1851: void fnodenodetotex_tb(NODE n,TB tb)
1852: {
1853: for ( ; n; n = NEXT(n) ) {
1.27 noro 1854: is_lt = 1;
1.14 noro 1855: fnodetotex_tb((FNODE)BDY(n),tb);
1856: if ( NEXT(n) ) write_tb(", ",tb);
1857: }
1858: }
1859:
1860: void fargstotex_tb(char *name,FNODE f,TB tb)
1861: {
1862: NODE n;
1863:
1864: if ( !strcmp(name,"matrix") ) {
1865: error("fargstotex_tb : not implemented yet");
1866: } else if ( !strcmp(name,"vector") ) {
1867: error("fargstotex_tb : not implemented yet");
1868: } else {
1869: if ( f->id == I_LIST ) {
1870: n = (NODE)FA0(f);
1871: fnodenodetotex_tb(n,tb);
1872: } else
1873: fnodetotex_tb(f,tb);
1.35 noro 1874: }
1875: }
1876:
1877: int top_is_minus(FNODE f)
1878: {
1879: char *opname;
1880: int len;
1881: Obj obj;
1882:
1883: if ( !f )
1884: return 0;
1885: switch ( f->id ) {
1886: case I_MINUS:
1887: return 1;
1888: case I_BOP:
1889: opname = ((ARF)FA0(f))->name;
1890: switch ( opname[0] ) {
1891: case '+': case '*': case '/': case '^': case '%':
1892: return top_is_minus((FNODE)FA1(f));
1893: case '-':
1894: if ( FA1(f) )
1895: return top_is_minus((FNODE)FA1(f));
1896: else
1897: return 1;
1898: default:
1899: return 0;
1900: }
1901: break;
1902: case I_COP:
1903: return top_is_minus((FNODE)FA1(f));
1904: case I_LOP:
1905: if ( (lid)FA0(f) == L_NOT ) return 0;
1906: else return top_is_minus((FNODE)FA1(f));
1907: case I_AND: case I_OR:
1908: return top_is_minus((FNODE)FA0(f));
1909: case I_FORMULA:
1910: obj = (Obj)FA0(f);
1.36 noro 1911: if ( !obj )
1912: return 0;
1913: else {
1914: switch ( OID(obj) ) {
1915: case O_N:
1916: return mmono((P)obj);
1917: case O_P:
1918: /* must be a variable */
1919: opname = conv_rule(VR((P)obj)->name);
1920: return opname[0]=='-';
1921: default:
1922: /* ??? */
1923: len = estimate_length(CO,obj);
1924: opname = (char *)MALLOC_ATOMIC(len+1);
1925: soutput_init(opname);
1926: sprintexpr(CO,obj);
1927: return opname[0]=='-';
1928: }
1.35 noro 1929: }
1.91 noro 1930: case I_NARYOP:
1931: return top_is_minus((FNODE)BDY((NODE)FA1(f)));
1932:
1.35 noro 1933: default:
1934: return 0;
1.14 noro 1935: }
1.47 noro 1936: }
1937:
1938: FNODE flatten_fnode(FNODE,char *);
1939:
1.48 noro 1940: void Pflatten_quote(NODE arg,Obj *rp)
1.47 noro 1941: {
1942: FNODE f;
1943: QUOTE q;
1944:
1.48 noro 1945: if ( !ARG0(arg) || OID((Obj)ARG0(arg)) != O_QUOTE )
1946: *rp = (Obj)ARG0(arg);
1.65 noro 1947: else if ( argc(arg) == 1 ) {
1948: f = flatten_fnode(BDY((QUOTE)ARG0(arg)),"+");
1949: f = flatten_fnode(f,"*");
1950: MKQUOTE(q,f);
1951: *rp = (Obj)q;
1952: } else {
1.48 noro 1953: f = flatten_fnode(BDY((QUOTE)ARG0(arg)),BDY((STRING)ARG1(arg)));
1954: MKQUOTE(q,f);
1955: *rp = (Obj)q;
1956: }
1.63 noro 1957: }
1958:
1959: void Pget_quote_id(NODE arg,Q *rp)
1960: {
1961: FNODE f;
1962: QUOTE q;
1963:
1964: q = (QUOTE)ARG0(arg);
1965: if ( !q || OID(q) != O_QUOTE )
1966: error("get_quote_id : invalid argument");
1967: f = BDY(q);
1968: STOQ((int)f->id,*rp);
1.48 noro 1969: }
1970:
1971: void Pquote_to_funargs(NODE arg,LIST *rp)
1972: {
1973: fid_spec_p spec;
1974: QUOTE q;
1975: QUOTEARG qa;
1976: FNODE f;
1977: STRING s;
1978: QUOTE r;
1979: int i;
1980: Q id,a;
1.49 noro 1981: LIST l;
1982: NODE t0,t,w,u,u0;
1.48 noro 1983:
1984: q = (QUOTE)ARG0(arg);
1985: if ( !q || OID(q) != O_QUOTE )
1986: error("quote_to_funargs : invalid argument");
1987: f = BDY(q);
1988: if ( !f ) {
1989: MKLIST(*rp,0);
1990: return;
1991: }
1992: get_fid_spec(f->id,&spec);
1993: if ( !spec )
1994: error("quote_to_funargs : not supported yet");
1995: t0 = 0;
1996: STOQ((int)f->id,id);
1997: NEXTNODE(t0,t);
1998: BDY(t) = (pointer)id;
1999: for ( i = 0; spec->type[i] != A_end; i++ ) {
2000: NEXTNODE(t0,t);
2001: switch ( spec->type[i] ) {
2002: case A_fnode:
2003: MKQUOTE(r,(FNODE)f->arg[i]);
2004: BDY(t) = (pointer)r;
2005: break;
2006: case A_int:
2007: STOQ((int)f->arg[i],a);
2008: BDY(t) = (pointer)a;
2009: break;
2010: case A_str:
2011: MKSTR(s,(char *)f->arg[i]);
2012: BDY(t) = (pointer)s;
2013: break;
2014: case A_internal:
2015: BDY(t) = (pointer)f->arg[i];
2016: break;
1.49 noro 2017: case A_node:
2018: w = (NODE)f->arg[i];
2019: for ( u0 = 0; w; w = NEXT(w) ){
2020: NEXTNODE(u0,u);
2021: MKQUOTE(r,(FNODE)BDY(w));
2022: BDY(u) = (pointer)r;
2023: }
2024: if ( u0 ) NEXT(u) = 0;
2025: MKLIST(l,u0);
2026: BDY(t) = (pointer)l;
2027: break;
1.48 noro 2028: default:
2029: MKQUOTEARG(qa,spec->type[i],f->arg[i]);
2030: BDY(t) = (pointer)qa;
2031: break;
2032: }
2033: }
2034: if ( t0 ) NEXT(t) = 0;
2035: MKLIST(*rp,t0);
2036: }
2037:
2038: void Pfunargs_to_quote(NODE arg,QUOTE *rp)
2039: {
2040: fid_spec_p spec;
2041: QUOTE q;
2042: QUOTEARG qa;
2043: FNODE f;
2044: STRING s;
1.49 noro 2045: QUOTE r,b;
1.48 noro 2046: int i;
2047: LIST l;
2048: fid id;
2049: Obj a;
1.49 noro 2050: NODE t0,t,u0,u,w;
1.48 noro 2051:
2052: l = (LIST)ARG0(arg);
2053: if ( !l || OID(l) != O_LIST || !(t=BDY(l)) )
2054: error("funargs_to_quote : invalid argument");
2055: t = BDY(l);
2056: id = (fid)QTOS((Q)BDY(t)); t = NEXT(t);
2057: get_fid_spec(id,&spec);
2058: if ( !spec )
2059: error("funargs_to_quote : not supported yet");
2060: for ( i = 0; spec->type[i] != A_end; i++ );
2061: NEWFNODE(f,i);
2062: f->id = id;
2063: for ( i = 0; spec->type[i] != A_end; i++, t = NEXT(t) ) {
2064: if ( !t )
2065: error("funargs_to_quote : argument mismatch");
2066: a = (Obj)BDY(t);
2067: switch ( spec->type[i] ) {
2068: case A_fnode:
2069: if ( !a || OID(a) != O_QUOTE )
2070: error("funargs_to_quote : invalid argument");
2071: f->arg[i] = BDY((QUOTE)a);
2072: break;
2073: case A_int:
2074: if ( !INT(a) )
2075: error("funargs_to_quote : invalid argument");
2076: f->arg[i] = (pointer)QTOS((Q)a);
2077: break;
2078: case A_str:
2079: if ( !a || OID(a) != O_STR )
2080: error("funargs_to_quote : invalid argument");
2081: f->arg[i] = (pointer)BDY((STRING)a);
2082: break;
2083: case A_internal:
2084: f->arg[i] = (pointer)a;
1.49 noro 2085: break;
2086: case A_node:
2087: if ( !a || OID(a) != O_LIST )
2088: error("funargs_to_quote : invalid argument");
2089: u0 = 0;
2090: for ( w = BDY((LIST)a); w; w = NEXT(w) ) {
2091: NEXTNODE(u0,u);
2092: b = (QUOTE)BDY(w);
2093: if ( !b || OID(b) != O_QUOTE )
2094: error("funargs_to_quote : invalid argument");
2095: BDY(u) = BDY(b);
2096: }
2097: if ( u0 ) NEXT(u) = 0;
2098: f->arg[i] = (pointer)u0;
1.48 noro 2099: break;
2100: default:
2101: if ( !a || OID(a) != O_QUOTEARG ||
2102: ((QUOTEARG)a)->type != spec->type[i] )
2103: error("funargs_to_quote : invalid argument");
2104: f->arg[i] = BDY((QUOTEARG)a);
2105: break;
2106: }
2107: }
2108: MKQUOTE(*rp,f);
1.69 noro 2109: }
2110:
1.105 noro 2111: VL reordvars(VL vl0,NODE head)
2112: {
2113: VL vl,svl,tvl;
2114: int i,j;
2115: NODE n;
2116: P t;
2117: V *va;
2118: V v;
2119:
2120: for ( vl = 0, i = 0, n = head; n; n = NEXT(n), i++ ) {
2121: NEXTVL(vl,tvl);
2122: if ( !(t = (P)BDY(n)) || (OID(t) != O_P) )
2123: error("reordvars : invalid argument");
2124: VR(tvl) = VR(t);
2125: }
2126: va = (V *)ALLOCA(i*sizeof(V));
2127: for ( j = 0, svl = vl; j < i; j++, svl = NEXT(svl) )
2128: va[j] = VR(svl);
2129: for ( svl = vl0; svl; svl = NEXT(svl) ) {
2130: v = VR(svl);
2131: for ( j = 0; j < i; j++ )
2132: if ( v == va[j] )
2133: break;
2134: if ( j == i ) {
2135: NEXTVL(vl,tvl);
2136: VR(tvl) = v;
2137: }
2138: }
2139: if ( vl )
2140: NEXT(tvl) = 0;
2141: return vl;
2142: }
2143:
2144: VL qt_current_ord;
2145: LIST qt_current_ord_obj;
2146:
2147: void Pqt_set_ord(NODE arg,LIST *rp)
2148: {
2149: NODE r0,r;
2150: VL vl;
2151: P v;
2152:
2153: if ( !argc(arg) )
2154: *rp = qt_current_ord_obj;
2155: else {
2156: qt_current_ord = reordvars(CO,BDY((LIST)ARG0(arg)));
2157: for ( r0 = 0, vl = qt_current_ord; vl; vl = NEXT(vl) ) {
2158: NEXTNODE(r0,r); MKV(vl->v,v); BDY(r) = v;
2159: }
2160: if ( r0 ) NEXT(r) = 0;
2161: MKLIST(*rp,r0);
2162: qt_current_ord_obj = *rp;
2163: }
2164: }
2165:
2166: void Pqt_normalize(NODE arg,QUOTE *rp)
1.70 noro 2167: {
2168: QUOTE q,r;
2169: FNODE f;
1.76 noro 2170: int expand,ac;
1.70 noro 2171:
1.76 noro 2172: ac = argc(arg);
1.105 noro 2173: if ( !ac ) error("qt_normalize : invalid argument");
1.70 noro 2174: q = (QUOTE)ARG0(arg);
1.103 noro 2175: if ( ac == 2 )
2176: expand = QTOS((Q)ARG1(arg));
1.97 noro 2177: if ( !q || OID(q) != O_QUOTE )
1.87 noro 2178: *rp = q;
2179: else {
1.76 noro 2180: f = fnode_normalize(BDY(q),expand);
1.70 noro 2181: MKQUOTE(r,f);
2182: *rp = r;
1.98 noro 2183: }
2184: }
2185:
2186: NBP fnode_to_nbp(FNODE f);
2187:
1.105 noro 2188: void Pqt_to_nbp(NODE arg,NBP *rp)
1.98 noro 2189: {
2190: QUOTE q;
2191: FNODE f;
2192:
2193: q = (QUOTE)ARG0(arg); f = (FNODE)BDY(q);
2194: f = fnode_normalize(f,0);
2195: *rp = fnode_to_nbp(f);
2196: }
2197:
1.101 noro 2198: void Pshuffle_mul(NODE arg,NBP *rp)
1.98 noro 2199: {
2200: NBP p1,p2;
2201:
2202: p1 = (NBP)ARG0(arg);
2203: p2 = (NBP)ARG1(arg);
2204: shuffle_mulnbp(CO,p1,p2,rp);
2205: }
1.99 noro 2206:
1.101 noro 2207: void Pharmonic_mul(NODE arg,NBP *rp)
1.99 noro 2208: {
2209: NBP p1,p2;
2210:
2211: p1 = (NBP)ARG0(arg);
2212: p2 = (NBP)ARG1(arg);
2213: harmonic_mulnbp(CO,p1,p2,rp);
2214: }
2215:
1.100 noro 2216: void Pnbp_hm(NODE arg, NBP *rp)
2217: {
2218: NBP p;
2219: NODE n;
2220: NBM m;
2221:
2222: p = (NBP)ARG0(arg);
2223: if ( !p ) *rp = 0;
2224: else {
2225: m = (NBM)BDY(BDY(p));
2226: MKNODE(n,m,0);
2227: MKNBP(*rp,n);
2228: }
2229: }
2230:
2231: void Pnbp_ht(NODE arg, NBP *rp)
2232: {
2233: NBP p;
2234: NODE n;
2235: NBM m,m1;
2236:
2237: p = (NBP)ARG0(arg);
2238: if ( !p ) *rp = 0;
2239: else {
2240: m = (NBM)BDY(BDY(p));
2241: NEWNBM(m1);
2242: m1->d = m->d; m1->c = ONE; m1->b = m->b;
2243: MKNODE(n,m1,0);
2244: MKNBP(*rp,n);
2245: }
2246: }
2247:
2248: void Pnbp_hc(NODE arg, Q *rp)
2249: {
2250: NBP p;
2251: NBM m;
2252:
2253: p = (NBP)ARG0(arg);
2254: if ( !p ) *rp = 0;
2255: else {
2256: m = (NBM)BDY(BDY(p));
2257: *rp = m->c;
2258: }
2259: }
2260:
2261: void Pnbp_rest(NODE arg, NBP *rp)
2262: {
2263: NBP p;
2264: NODE n;
2265:
2266: p = (NBP)ARG0(arg);
2267: if ( !p ) *rp = 0;
2268: else {
2269: n = BDY(p);
2270: if ( !NEXT(n) ) *rp = 0;
2271: else
2272: MKNBP(*rp,NEXT(n));
2273: }
2274: }
2275:
1.102 noro 2276: void Pnbm_deg(NODE arg, Q *rp)
1.100 noro 2277: {
2278: NBP p;
2279: NBM m;
1.102 noro 2280:
2281: p = (NBP)ARG0(arg);
2282: if ( !p )
2283: STOQ(-1,*rp);
2284: else {
2285: m = (NBM)BDY(BDY(p));
2286: STOQ(m->d,*rp);
2287: }
2288: }
2289:
2290: void Pnbm_hp_rest(NODE arg, LIST *rp)
2291: {
2292: NBP p,h,r;
2293: NBM m,m1;
1.100 noro 2294: NODE n;
1.102 noro 2295: int *b,*b1;
2296: int d,d1,v,i,j,k;
1.100 noro 2297:
2298: p = (NBP)ARG0(arg);
1.102 noro 2299: if ( !p )
1.100 noro 2300: MKLIST(*rp,0);
1.102 noro 2301: else {
2302: m = (NBM)BDY(BDY(p));
2303: b = m->b; d = m->d;
1.100 noro 2304: if ( !d )
2305: MKLIST(*rp,0);
2306: else {
1.102 noro 2307: v = NBM_GET(b,0);
1.100 noro 2308: for ( i = 1; i < d; i++ )
1.102 noro 2309: if ( NBM_GET(b,i) != v ) break;
2310: NEWNBM(m1); NEWNBMBDY(m1,i);
2311: b1 = m1->b; m1->d = i; m1->c = ONE;
2312: if ( v ) for ( j = 0; j < i; j++ ) NBM_SET(b1,j);
2313: else for ( j = 0; j < i; j++ ) NBM_CLR(b1,j);
2314: MKNODE(n,m1,0); MKNBP(h,n);
2315:
2316: d1 = d-i;
2317: NEWNBM(m1); NEWNBMBDY(m1,d1);
2318: b1 = m1->b; m1->d = d1; m1->c = ONE;
2319: for ( j = 0, k = i; j < d1; j++, k++ )
2320: if ( NBM_GET(b,k) ) NBM_SET(b1,j);
2321: else NBM_CLR(b1,j);
2322: MKNODE(n,m1,0); MKNBP(r,n);
2323: n = mknode(2,h,r);
1.100 noro 2324: MKLIST(*rp,n);
2325: }
2326: }
2327: }
2328:
1.102 noro 2329: void Pnbm_hxky(NODE arg, LIST *rp)
2330: {
2331: NBP p;
2332:
2333: p = (NBP)ARG0(arg);
2334: if ( !p )
2335: *rp = 0;
2336: else
2337: separate_xky_nbm((NBM)BDY(BDY(p)),0,rp,0);
2338: }
2339:
2340: void Pnbm_xky_rest(NODE arg,NBP *rp)
1.100 noro 2341: {
2342: NBP p;
2343:
2344: p = (NBP)ARG0(arg);
2345: if ( !p )
2346: *rp = 0;
1.102 noro 2347: else
2348: separate_xky_nbm((NBM)BDY(BDY(p)),0,0,rp);
2349: }
2350:
2351: void Pnbm_hv(NODE arg, NBP *rp)
2352: {
2353: NBP p;
2354:
2355: p = (NBP)ARG0(arg);
2356: if ( !p )
2357: *rp = 0;
2358: else
2359: separate_nbm((NBM)BDY(BDY(p)),0,rp,0);
2360: }
2361:
2362: void Pnbm_rest(NODE arg, NBP *rp)
2363: {
2364: NBP p;
2365:
2366: p = (NBP)ARG0(arg);
2367: if ( !p )
2368: *rp = 0;
2369: else
2370: separate_nbm((NBM)BDY(BDY(p)),0,0,rp);
1.100 noro 2371: }
1.98 noro 2372:
2373: NBP fnode_to_nbp(FNODE f)
2374: {
2375: Q r;
2376: int n,i;
2377: NBM m;
2378: V v;
2379: NBP u,u1,u2;
2380: NODE t,b;
2381:
2382: if ( f->id == I_FORMULA ) {
2383: r = eval(f);
2384: NEWNBM(m);
2385: if ( OID(r) == O_N ) {
2386: m->d = 0; m->c = (Q)r; m->b = 0;
2387: } else {
2388: v = VR((P)r);
2389: m->d = 1; m->c = ONE; NEWNBMBDY(m,1);
2390: if ( !strcmp(NAME(v),"x") ) NBM_SET(m->b,0);
2391: else NBM_CLR(m->b,0);
2392: }
2393: MKNODE(b,m,0); MKNBP(u,b);
2394: return u;
2395: } else if ( IS_NARYADD(f) ) {
2396: t = (NODE)FA1(f); u = fnode_to_nbp((FNODE)BDY(t));
2397: for ( t = NEXT(t); t; t = NEXT(t) ) {
2398: u1 = fnode_to_nbp((FNODE)BDY(t));
2399: addnbp(CO,u,u1,&u2); u = u2;
2400: }
2401: return u;
2402: } else if ( IS_NARYMUL(f) ) {
2403: t = (NODE)FA1(f); u = fnode_to_nbp((FNODE)BDY(t));
2404: for ( t = NEXT(t); t; t = NEXT(t) ) {
2405: u1 = fnode_to_nbp((FNODE)BDY(t));
2406: mulnbp(CO,u,u1,&u2); u = u2;
2407: }
2408: return u;
2409: } else if ( IS_BINARYPWR(f) ) {
2410: u = fnode_to_nbp((FNODE)FA1(f));
2411: r = eval((FNODE)FA2(f));
2412: pwrnbp(CO,u,r,&u1);
2413: return u1;
1.70 noro 2414: }
2415: }
2416:
1.105 noro 2417: void Pnqt_comp(NODE arg,Q *rp)
1.80 noro 2418: {
1.87 noro 2419: QUOTE q1,q2;
1.80 noro 2420: FNODE f1,f2;
2421: int r;
2422:
1.87 noro 2423: q1 = (QUOTE)ARG0(arg); f1 = (FNODE)BDY(q1);
2424: q2 = (QUOTE)ARG1(arg); f2 = (FNODE)BDY(q2);
1.97 noro 2425: f1 = fnode_normalize(f1,0);
2426: f2 = fnode_normalize(f2,0);
1.95 noro 2427: r = nfnode_comp(f1,f2);
1.80 noro 2428: STOQ(r,*rp);
2429: }
2430:
1.89 noro 2431: INLINE int fnode_is_number(FNODE f)
1.69 noro 2432: {
2433: Obj obj;
2434:
2435: switch ( f->id ) {
2436: case I_MINUS: case I_PAREN:
2437: return fnode_is_number(FA0(f));
2438:
2439: case I_FORMULA:
2440: obj = FA0(f);
2441: if ( !obj ) return 1;
2442: else if ( OID(obj) == O_QUOTE )
2443: return fnode_is_number(BDY((QUOTE)obj));
2444: else if ( NUM(obj) ) return 1;
2445: else return 0;
2446:
2447: case I_BOP:
2448: return fnode_is_number(FA1(f)) && fnode_is_number(FA2(f));
2449:
2450: default:
2451: return 0;
2452: }
2453: }
2454:
2455: int fnode_is_rational(FNODE f)
2456: {
2457: Obj obj;
2458:
2459: switch ( f->id ) {
2460: case I_MINUS: case I_PAREN:
2461: return fnode_is_number(FA0(f));
2462:
2463: case I_FORMULA:
2464: obj = FA0(f);
2465: if ( !obj ) return 1;
2466: else if ( OID(obj) == O_QUOTE )
2467: return fnode_is_rational(BDY((QUOTE)obj));
2468: else if ( NUM(obj) && RATN(obj) ) return 1;
2469: else return 0;
2470:
2471: case I_BOP:
2472: if ( !strcmp(((ARF)FA0(f))->name,"^") )
2473: return fnode_is_rational(FA1(f)) && fnode_is_integer(FA2(f));
2474: else
2475: return fnode_is_rational(FA1(f)) && fnode_is_rational(FA2(f));
2476:
2477: default:
2478: return 0;
2479: }
2480: }
2481:
2482: int fnode_is_integer(FNODE f)
2483: {
2484: Obj obj;
2485:
2486: switch ( f->id ) {
2487: case I_MINUS: case I_PAREN:
2488: return fnode_is_integer(FA0(f));
2489:
2490: case I_FORMULA:
2491: obj = FA0(f);
2492: if ( !obj ) return 1;
2493: else if ( OID(obj) == O_QUOTE )
2494: return fnode_is_integer(BDY((QUOTE)obj));
2495: else if ( INT(obj)) return 1;
2496: else return 0;
2497:
2498: case I_BOP:
1.70 noro 2499: switch ( ((ARF)FA0(f))->name[0] ) {
2500: case '^':
2501: return fnode_is_integer(FA1(f))
2502: && fnode_is_nonnegative_integer(FA2(f));
2503: case '/':
2504: return fnode_is_integer(FA1(f)) &&
2505: ( fnode_is_one(FA2(f)) || fnode_is_minusone(FA2(f)) );
2506: default:
2507: return fnode_is_integer(FA1(f)) && fnode_is_integer(FA2(f));
2508: }
2509: break;
2510:
1.69 noro 2511: default:
2512: return 0;
2513: }
2514: }
2515:
2516: int fnode_is_nonnegative_integer(FNODE f)
2517: {
2518: Q n;
2519:
2520: n = eval(f);
2521: if ( !n || (INT(n) && SGN(n) > 0) ) return 1;
2522: else return 0;
2523: }
2524:
2525: int fnode_is_one(FNODE f)
2526: {
2527: Q n;
2528:
2529: n = eval(f);
2530: if ( UNIQ(n) ) return 1;
2531: else return 0;
2532: }
2533:
2534: int fnode_is_minusone(FNODE f)
2535: {
2536: Q n;
2537:
2538: n = eval(f);
2539: if ( MUNIQ(n) ) return 1;
2540: else return 0;
2541: }
2542:
2543: int fnode_is_dependent(FNODE f,V v)
2544: {
2545: Obj obj;
2546: FNODE arg;
2547: NODE t;
2548:
2549: switch ( f->id ) {
2550: case I_MINUS: case I_PAREN:
2551: return fnode_is_dependent(FA0(f),v);
2552:
2553: case I_FORMULA:
2554: obj = FA0(f);
2555: if ( !obj ) return 0;
2556: else if ( OID(obj) == O_QUOTE )
2557: return fnode_is_dependent(BDY((QUOTE)obj),v);
2558: else if ( obj_is_dependent(obj,v) ) return 1;
2559: else return 0;
2560:
2561: case I_BOP:
2562: return fnode_is_dependent(FA1(f),v) || fnode_is_dependent(FA2(f),v);
2563:
2564: case I_FUNC:
2565: arg = (FNODE)FA1(f);
2566: for ( t = FA0(arg); t; t = NEXT(t) )
2567: if ( fnode_is_dependent(BDY(t),v) ) return 1;
2568: return 0;
2569:
2570: default:
2571: return 0;
2572: }
1.1 noro 2573: }
1.70 noro 2574:
1.72 noro 2575:
1.76 noro 2576: FNODE fnode_normalize(FNODE f,int expand)
1.70 noro 2577: {
1.73 noro 2578: FNODE a1,a2,mone,r,b2;
1.72 noro 2579: NODE n;
1.70 noro 2580: Q q;
2581:
1.103 noro 2582: if ( f->normalized && (f->expanded == expand) ) return f;
1.72 noro 2583: STOQ(-1,q);
2584: mone = mkfnode(1,I_FORMULA,q);
1.70 noro 2585: switch ( f->id ) {
2586: case I_PAREN:
1.89 noro 2587: r = fnode_normalize(FA0(f),expand);
2588: break;
1.71 noro 2589:
2590: case I_MINUS:
1.95 noro 2591: r = nfnode_mul_coef((Num)q,
1.76 noro 2592: fnode_normalize(FA0(f),expand),expand);
1.89 noro 2593: break;
1.71 noro 2594:
1.70 noro 2595: case I_BOP:
2596: /* arf fnode fnode */
1.76 noro 2597: a1 = fnode_normalize(FA1(f),expand);
2598: a2 = fnode_normalize(FA2(f),expand);
1.72 noro 2599: switch ( OPNAME(f) ) {
2600: case '+':
1.95 noro 2601: r = nfnode_add(a1,a2,expand);
1.89 noro 2602: break;
1.70 noro 2603: case '-':
1.95 noro 2604: a2 = nfnode_mul_coef((Num)q,a2,expand);
2605: r = nfnode_add(a1,a2,expand);
1.89 noro 2606: break;
1.72 noro 2607: case '*':
1.95 noro 2608: r = nfnode_mul(a1,a2,expand);
1.89 noro 2609: break;
1.70 noro 2610: case '/':
1.95 noro 2611: a2 = nfnode_pwr(a2,mone,expand);
2612: r = nfnode_mul(a1,a2,expand);
1.89 noro 2613: break;
1.73 noro 2614: case '^':
1.95 noro 2615: r = nfnode_pwr(a1,a2,expand);
1.89 noro 2616: break;
1.70 noro 2617: default:
1.89 noro 2618: r = mkfnode(3,I_BOP,FA0(f),a1,a2);
2619: break;
1.70 noro 2620: }
2621: break;
1.71 noro 2622:
1.70 noro 2623: case I_NARYOP:
1.72 noro 2624: switch ( OPNAME(f) ) {
1.71 noro 2625: case '+':
1.73 noro 2626: n = (NODE)FA1(f);
1.76 noro 2627: r = fnode_normalize(BDY(n),expand); n = NEXT(n);
1.72 noro 2628: for ( ; n; n = NEXT(n) ) {
1.76 noro 2629: a1 = fnode_normalize(BDY(n),expand);
1.95 noro 2630: r = nfnode_add(r,a1,expand);
1.72 noro 2631: }
1.89 noro 2632: break;
1.70 noro 2633: case '*':
1.73 noro 2634: n = (NODE)FA1(f);
1.76 noro 2635: r = fnode_normalize(BDY(n),expand); n = NEXT(n);
1.72 noro 2636: for ( ; n; n = NEXT(n) ) {
1.76 noro 2637: a1 = fnode_normalize(BDY(n),expand);
1.95 noro 2638: r = nfnode_mul(r,a1,expand);
1.72 noro 2639: }
1.89 noro 2640: break;
1.70 noro 2641: default:
1.72 noro 2642: error("fnode_normallize : cannot happen");
1.70 noro 2643: }
1.89 noro 2644: break;
1.72 noro 2645:
1.70 noro 2646: default:
1.76 noro 2647: return fnode_apply(f,fnode_normalize,expand);
1.70 noro 2648: }
1.89 noro 2649: r->normalized = 1;
2650: r->expanded = expand;
2651: return r;
1.70 noro 2652: }
2653:
1.76 noro 2654: FNODE fnode_apply(FNODE f,FNODE (*func)(),int expand)
1.70 noro 2655: {
2656: fid_spec_p spec;
2657: FNODE r;
2658: int i,n;
2659: NODE t,t0,s;
2660:
2661: get_fid_spec(f->id,&spec);
2662: for ( n = 0; spec->type[n] != A_end; n++ );
2663: NEWFNODE(r,n); r->id = f->id;
2664: for ( i = 0; i < n; i++ ) {
2665: switch ( spec->type[i] ) {
2666: case A_fnode:
1.78 noro 2667: r->arg[i] = func(f->arg[i],expand);
1.70 noro 2668: break;
2669: case A_node:
2670: s = (NODE)f->arg[i];
2671: for ( t0 = 0; s; s = NEXT(s) ) {
2672: NEXTNODE(t0,t);
1.76 noro 2673: BDY(t) = (pointer)func((FNODE)BDY(s),expand);
1.70 noro 2674: }
2675: if ( t0 ) NEXT(t) = 0;
2676: r->arg[i] = t0;
2677: break;
2678: default:
2679: r->arg[i] = f->arg[i];
2680: break;
2681: }
2682: }
2683: return r;
2684: }
2685:
1.95 noro 2686: FNODE nfnode_add(FNODE f1,FNODE f2,int expand)
1.71 noro 2687: {
1.72 noro 2688: NODE n1,n2,r0,r;
2689: FNODE b1,b2;
2690: int s;
2691: Num c1,c2,c;
2692:
1.77 noro 2693: if ( IS_ZERO(f1) ) return f2;
2694: else if ( IS_ZERO(f2) ) return f1;
1.75 noro 2695: f1 = to_naryadd(f1); f2 = to_naryadd(f2);
2696: n1 = (NODE)FA1(f1); n2 = (NODE)FA1(f2);
1.72 noro 2697: r0 = 0;
2698: while ( n1 && n2 ) {
1.75 noro 2699: fnode_coef_body(BDY(n1),&c1,&b1); fnode_coef_body(BDY(n2),&c2,&b2);
1.95 noro 2700: if ( (s = nfnode_comp(b1,b2)) > 0 ) {
1.73 noro 2701: NEXTNODE(r0,r); BDY(r) = BDY(n1); n1 = NEXT(n1);
1.72 noro 2702: } else if ( s < 0 ) {
1.73 noro 2703: NEXTNODE(r0,r); BDY(r) = BDY(n2); n2 = NEXT(n2);
1.72 noro 2704: } else {
2705: addnum(0,c1,c2,&c);
2706: if ( c ) {
1.95 noro 2707: NEXTNODE(r0,r); BDY(r) = nfnode_mul_coef(c,b1,expand);
1.71 noro 2708: }
1.72 noro 2709: n1 = NEXT(n1); n2 = NEXT(n2);
1.71 noro 2710: }
2711: }
1.72 noro 2712: if ( n1 )
2713: if ( r0 ) NEXT(r) = n1;
2714: else r0 = n1;
2715: else if ( n2 )
2716: if ( r0 ) NEXT(r) = n2;
2717: else r0 = n2;
2718: else if ( r0 )
2719: NEXT(r) = 0;
2720:
1.106 noro 2721: return fnode_node_to_nary(addfs,r0);
1.75 noro 2722: }
2723:
1.106 noro 2724: FNODE fnode_node_to_nary(ARF op,NODE n)
1.75 noro 2725: {
1.106 noro 2726: if ( !n ) {
2727: if ( op->name[0] == '+' )
2728: return mkfnode(1,I_FORMULA,0);
2729: else
2730: return mkfnode(1,I_FORMULA,ONE);
2731: } else if ( !NEXT(n) ) return BDY(n);
2732: else return mkfnode(2,I_NARYOP,op,n);
1.71 noro 2733: }
2734:
1.95 noro 2735: FNODE nfnode_mul(FNODE f1,FNODE f2,int expand)
1.71 noro 2736: {
1.72 noro 2737: NODE n1,n2,r0,r,r1;
1.76 noro 2738: FNODE b1,b2,e1,e2,cc,t,t1;
1.72 noro 2739: FNODE *m;
2740: int s;
2741: Num c1,c2,c,e;
1.75 noro 2742: int l1,l,i,j;
1.72 noro 2743:
1.77 noro 2744: if ( IS_ZERO(f1) || IS_ZERO(f2) ) return mkfnode(1,I_FORMULA,0);
1.75 noro 2745: else if ( fnode_is_number(f1) )
1.95 noro 2746: return nfnode_mul_coef((Num)eval(f1),f2,expand);
1.75 noro 2747: else if ( fnode_is_number(f2) )
1.95 noro 2748: return nfnode_mul_coef((Num)eval(f2),f1,expand);
1.76 noro 2749:
2750: if ( expand && IS_NARYADD(f1) ) {
2751: t = mkfnode(1,I_FORMULA,0);
2752: for ( n1 = (NODE)FA1(f1); n1; n1 = NEXT(n1) ) {
1.95 noro 2753: t1 = nfnode_mul(BDY(n1),f2,expand);
2754: t = nfnode_add(t,t1,expand);
1.76 noro 2755: }
2756: return t;
2757: }
2758: if ( expand && IS_NARYADD(f2) ) {
2759: t = mkfnode(1,I_FORMULA,0);
2760: for ( n2 = (NODE)FA1(f2); n2; n2 = NEXT(n2) ) {
1.95 noro 2761: t1 = nfnode_mul(f1,BDY(n2),expand);
2762: t = nfnode_add(t,t1,expand);
1.76 noro 2763: }
2764: return t;
2765: }
1.72 noro 2766:
1.75 noro 2767: fnode_coef_body(f1,&c1,&b1); fnode_coef_body(f2,&c2,&b2);
2768: mulnum(0,c1,c2,&c);
1.72 noro 2769: if ( !c ) return mkfnode(1,I_FORMULA,0);
1.71 noro 2770:
1.76 noro 2771:
1.75 noro 2772: n1 = (NODE)FA1(to_narymul(b1)); n2 = (NODE)FA1(to_narymul(b2));
2773: l1 = length(n1); l = l1+length(n2);
1.72 noro 2774: m = (FNODE *)ALLOCA(l*sizeof(FNODE));
2775: for ( r = n1, i = 0; i < l1; r = NEXT(r), i++ ) m[i] = BDY(r);
2776: for ( r = n2; r; r = NEXT(r) ) {
1.103 noro 2777: if ( i == 0 || (expand == 2) )
1.72 noro 2778: m[i++] = BDY(r);
2779: else {
1.75 noro 2780: fnode_base_exp(m[i-1],&b1,&e1); fnode_base_exp(BDY(r),&b2,&e2);
2781: if ( compfnode(b1,b2) ) break;
2782: addnum(0,eval(e1),eval(e2),&e);
2783: if ( !e ) i--;
2784: else if ( UNIQ(e) )
2785: m[i-1] = b1;
2786: else
2787: m[i-1] = mkfnode(3,I_BOP,pwrfs,b1,mkfnode(1,I_FORMULA,e));
1.71 noro 2788: }
2789: }
1.75 noro 2790: for ( j = i-1; j >= 0; j-- ) {
2791: MKNODE(r1,m[j],r); r = r1;
2792: }
2793: if ( !UNIQ(c) ) {
2794: cc = mkfnode(1,I_FORMULA,c); MKNODE(r1,cc,r); r = r1;
1.72 noro 2795: }
1.106 noro 2796: return fnode_node_to_nary(mulfs,r);
1.73 noro 2797: }
2798:
1.95 noro 2799: FNODE nfnode_pwr(FNODE f1,FNODE f2,int expand)
1.73 noro 2800: {
1.89 noro 2801: FNODE b,b1,e1,e,cc,r,mf2,mone,inv;
2802: Num c,c1,nf2;
2803: int ee;
2804: NODE arg,n,t0,t1;
1.76 noro 2805: Q q;
1.73 noro 2806:
1.77 noro 2807: if ( IS_ZERO(f2) ) return mkfnode(1,I_FORMULA,ONE);
2808: else if ( IS_ZERO(f1) ) return mkfnode(1,I_FORMULA,0);
1.92 noro 2809: else if ( fnode_is_number(f1) ) {
1.73 noro 2810: if ( fnode_is_integer(f2) ) {
1.92 noro 2811: if ( fnode_is_one(f2) ) return f1;
2812: else {
2813: pwrnum(0,(Num)eval(f1),(Num)eval(f2),&c);
2814: return mkfnode(1,I_FORMULA,c);
2815: }
1.73 noro 2816: } else
2817: return mkfnode(3,I_BOP,pwrfs,f1,f2);
1.92 noro 2818: } else if ( IS_BINARYPWR(f1) ) {
1.73 noro 2819: b1 = FA1(f1); e1 = FA2(f1);
1.95 noro 2820: e = nfnode_mul(e1,f2,expand);
1.73 noro 2821: if ( fnode_is_one(e) )
2822: return b1;
2823: else
2824: return mkfnode(3,I_BOP,FA0(f1),b1,e);
1.92 noro 2825: } else if ( expand && IS_NARYMUL(f1) && fnode_is_number(f2)
2826: && fnode_is_integer(f2) ) {
1.73 noro 2827: fnode_coef_body(f1,&c1,&b1);
1.89 noro 2828: nf2 = (Num)eval(f2);
2829: pwrnum(0,(Num)c1,nf2,&c);
2830: ee = QTOS((Q)nf2);
1.75 noro 2831: cc = mkfnode(1,I_FORMULA,c);
1.89 noro 2832: if ( fnode_is_nonnegative_integer(f2) )
1.103 noro 2833: b = fnode_expand_pwr(b1,ee,expand);
1.89 noro 2834: else {
2835: STOQ(-1,q);
2836: mone = mkfnode(1,I_FORMULA,q);
1.92 noro 2837: b1 = to_narymul(b1);
1.89 noro 2838: for ( t0 = 0, n = (NODE)FA1(b1); n; n = NEXT(n) ) {
2839: inv = mkfnode(3,I_BOP,pwrfs,BDY(n),mone);
2840: MKNODE(t1,inv,t0); t0 = t1;
2841: }
1.106 noro 2842: b1 = fnode_node_to_nary(mulfs,t0);
1.103 noro 2843: b = fnode_expand_pwr(b1,-ee,expand);
1.89 noro 2844: }
1.75 noro 2845: if ( fnode_is_one(cc) )
2846: return b;
2847: else
1.106 noro 2848: return fnode_node_to_nary(mulfs,mknode(2,cc,b));
1.82 noro 2849: } else if ( expand && fnode_is_integer(f2)
2850: && fnode_is_nonnegative_integer(f2) ) {
1.76 noro 2851: q = (Q)eval(f2);
1.95 noro 2852: if ( PL(NM(q)) > 1 ) error("nfnode_pwr : exponent too large");
1.103 noro 2853: return fnode_expand_pwr(f1,QTOS(q),expand);
1.73 noro 2854: } else
2855: return mkfnode(3,I_BOP,pwrfs,f1,f2);
1.72 noro 2856: }
2857:
1.103 noro 2858: FNODE fnode_expand_pwr(FNODE f,int n,int expand)
1.76 noro 2859: {
1.103 noro 2860: int n1,i;
2861: FNODE f1,f2,fn;
2862: Q q;
1.76 noro 2863:
2864: if ( !n ) return mkfnode(1,I_FORMULA,ONE);
1.77 noro 2865: else if ( IS_ZERO(f) ) return mkfnode(1,I_FORMULA,0);
1.76 noro 2866: else if ( n == 1 ) return f;
2867: else {
1.103 noro 2868: switch ( expand ) {
2869: case 1:
2870: n1 = n/2;
2871: f1 = fnode_expand_pwr(f,n1,expand);
2872: f2 = nfnode_mul(f1,f1,expand);
2873: if ( n%2 ) f2 = nfnode_mul(f2,f,1);
2874: return f2;
2875: case 2:
2876: for ( i = 1, f1 = f; i < n; i++ )
2877: f1 = nfnode_mul(f1,f,expand);
2878: return f1;
2879: case 0: default:
2880: STOQ(n,q);
2881: fn = mkfnode(1,I_FORMULA,q);
2882: return mkfnode(3,I_BOP,pwrfs,f,fn);
2883: }
1.76 noro 2884: }
2885: }
2886:
1.72 noro 2887: /* f = b^e */
2888: void fnode_base_exp(FNODE f,FNODE *bp,FNODE *ep)
2889: {
1.75 noro 2890: if ( IS_BINARYPWR(f) ) {
1.72 noro 2891: *bp = FA1(f); *ep = FA2(f);
2892: } else {
2893: *bp = f; *ep = mkfnode(1,I_FORMULA,ONE);
2894: }
2895: }
2896:
2897: FNODE to_naryadd(FNODE f)
2898: {
2899: FNODE r;
2900: NODE n;
2901:
1.75 noro 2902: if ( IS_NARYADD(f) ) return f;
2903:
2904: NEWFNODE(r,2); r->id = I_NARYOP;
2905: FA0(r) = addfs; MKNODE(n,f,0); FA1(r) = n;
1.72 noro 2906: return r;
2907: }
2908:
2909: FNODE to_narymul(FNODE f)
2910: {
2911: FNODE r;
2912: NODE n;
2913:
1.75 noro 2914: if ( IS_NARYMUL(f) ) return f;
2915:
2916: NEWFNODE(r,2); r->id = I_NARYOP;
2917: FA0(r) = mulfs; MKNODE(n,f,0); FA1(r) = n;
1.72 noro 2918: return r;
2919: }
2920:
1.95 noro 2921: FNODE nfnode_mul_coef(Num c,FNODE f,int expand)
1.72 noro 2922: {
1.76 noro 2923: FNODE b1,cc;
1.72 noro 2924: Num c1,c2;
1.76 noro 2925: NODE n,r,r0;
1.72 noro 2926:
2927: if ( !c )
2928: return mkfnode(I_FORMULA,0);
1.75 noro 2929: else {
2930: fnode_coef_body(f,&c1,&b1);
2931: mulnum(0,c,c1,&c2);
2932: if ( UNIQ(c2) ) return b1;
2933: else {
2934: cc = mkfnode(1,I_FORMULA,c2);
2935: if ( fnode_is_number(b1) ) {
2936: if ( !fnode_is_one(b1) )
1.95 noro 2937: error("nfnode_mul_coef : cannot happen");
1.75 noro 2938: else
2939: return cc;
1.76 noro 2940: } else if ( IS_NARYMUL(b1) ) {
1.75 noro 2941: MKNODE(n,cc,FA1(b1));
1.106 noro 2942: return fnode_node_to_nary(mulfs,n);
1.76 noro 2943: } else if ( expand && IS_NARYADD(b1) ) {
2944: for ( r0 = 0, n = (NODE)FA1(b1); n; n = NEXT(n) ) {
2945: NEXTNODE(r0,r);
1.95 noro 2946: BDY(r) = nfnode_mul_coef(c2,BDY(n),expand);
1.76 noro 2947: }
2948: if ( r0 ) NEXT(r) = 0;
1.106 noro 2949: return fnode_node_to_nary(addfs,r0);
1.76 noro 2950: } else
1.106 noro 2951: return fnode_node_to_nary(mulfs,mknode(2,cc,b1));
1.72 noro 2952: }
1.71 noro 2953: }
2954: }
2955:
1.72 noro 2956: void fnode_coef_body(FNODE f,Num *cp,FNODE *bp)
1.70 noro 2957: {
1.72 noro 2958: FNODE c;
1.70 noro 2959:
1.72 noro 2960: if ( fnode_is_number(f) ) {
2961: *cp = eval(f); *bp = mkfnode(1,I_FORMULA,ONE);
1.75 noro 2962: } else if ( IS_NARYMUL(f) ) {
2963: c=(FNODE)BDY((NODE)FA1(f));
1.72 noro 2964: if ( fnode_is_number(c) ) {
2965: *cp = eval(c);
1.106 noro 2966: *bp = fnode_node_to_nary(mulfs,NEXT((NODE)FA1(f)));
1.70 noro 2967: } else {
1.72 noro 2968: *cp = (Num)ONE; *bp = f;
1.70 noro 2969: }
2970: } else {
1.72 noro 2971: *cp = (Num)ONE; *bp = f;
1.70 noro 2972: }
1.80 noro 2973: }
2974:
1.95 noro 2975: int nfnode_comp_pwr(FNODE f1,FNODE f2);
1.80 noro 2976:
1.95 noro 2977: int nfnode_comp(FNODE f1,FNODE f2)
1.80 noro 2978: {
2979: NODE n1,n2;
1.95 noro 2980: int r,i1,i2,ret;
1.82 noro 2981: char *nm1,*nm2;
1.95 noro 2982: FNODE b1,b2,e1,e2,g,a1,a2,fn1,fn2;
1.83 noro 2983: Num ee,ee1,c1,c2;
1.80 noro 2984:
2985: if ( IS_NARYADD(f1) || IS_NARYADD(f2) ) {
2986: f1 = to_naryadd(f1); f2 = to_naryadd(f2);
2987: n1 = (NODE)FA1(f1); n2 = (NODE)FA1(f2);
2988: while ( n1 && n2 )
1.95 noro 2989: if ( r = nfnode_comp(BDY(n1),BDY(n2)) ) return r;
1.80 noro 2990: else {
2991: n1 = NEXT(n1); n2 = NEXT(n2);
2992: }
1.85 noro 2993: return n1?1:(n2?-1:0);
1.80 noro 2994: }
2995: if ( IS_NARYMUL(f1) || IS_NARYMUL(f2) ) {
1.83 noro 2996: fnode_coef_body(f1,&c1,&b1);
2997: fnode_coef_body(f2,&c2,&b2);
2998: if ( !compfnode(b1,b2) ) return compnum(0,c1,c2);
2999: b1 = to_narymul(b1); b2 = to_narymul(b2);
3000: n1 = (NODE)FA1(b1); n2 = (NODE)FA1(b2);
1.80 noro 3001: while ( 1 ) {
3002: while ( n1 && n2 && !compfnode(BDY(n1),BDY(n2)) ) {
3003: n1 = NEXT(n1); n2 = NEXT(n2);
3004: }
3005: if ( !n1 || !n2 ) {
1.85 noro 3006: return n1?1:(n2?-1:0);
1.80 noro 3007: }
3008: fnode_base_exp(BDY(n1),&b1,&e1);
3009: fnode_base_exp(BDY(n2),&b2,&e2);
3010:
1.95 noro 3011: if ( r = nfnode_comp(b1,b2) ) {
1.83 noro 3012: if ( r > 0 )
1.95 noro 3013: return nfnode_comp(e1,mkfnode(1,I_FORMULA,0));
1.83 noro 3014: else if ( r < 0 )
1.95 noro 3015: return nfnode_comp(mkfnode(1,I_FORMULA,0),e2);
1.83 noro 3016: } else {
3017: n1 = NEXT(n1); n2 = NEXT(n2);
3018: if ( fnode_is_number(e1) && fnode_is_number(e2) ) {
3019: /* f1 = t b^e1 ... , f2 = t b^e2 ... */
3020: subnum(0,eval(e1),eval(e2),&ee);
1.86 noro 3021: r = compnum(0,ee,0);
3022: if ( r > 0 ) {
1.83 noro 3023: g = mkfnode(3,I_BOP,pwrfs,b1,mkfnode(1,I_FORMULA,ee));
3024: MKNODE(n1,g,n1);
1.86 noro 3025: } else if ( r < 0 ) {
3026: chsgnnum(ee,&ee1);
3027: g = mkfnode(3,I_BOP,pwrfs,b1,mkfnode(1,I_FORMULA,ee1));
3028: MKNODE(n2,g,n2);
1.83 noro 3029: }
3030: } else {
1.95 noro 3031: r = nfnode_comp(e1,e2);
1.83 noro 3032: if ( r > 0 ) return 1;
3033: else if ( r < 0 ) return -1;
1.80 noro 3034: }
3035: }
3036: }
3037: }
3038: if ( IS_BINARYPWR(f1) || IS_BINARYPWR(f2) )
1.95 noro 3039: return nfnode_comp_pwr(f1,f2);
1.80 noro 3040:
1.95 noro 3041: /* now, IDs of f1 and f2 must be I_FORMULA, I_FUNC, I_IFUNC or I_PVAR */
1.106 noro 3042: /* I_IFUNC > I_PVAR > I_FUNC=I_FUNC_QARG > I_FORMULA */
1.80 noro 3043: switch ( f1->id ) {
3044: case I_FORMULA:
3045: switch ( f2->id ) {
3046: case I_FORMULA:
1.105 noro 3047: return arf_comp(qt_current_ord?qt_current_ord:CO,FA0(f1),FA0(f2));
1.95 noro 3048: case I_FUNC: case I_IFUNC: case I_PVAR:
1.80 noro 3049: return -1;
3050: default:
1.95 noro 3051: error("nfnode_comp : undefined");
1.80 noro 3052: }
3053: break;
1.106 noro 3054: case I_FUNC: case I_FUNC_QARG:
1.80 noro 3055: switch ( f2->id ) {
3056: case I_FORMULA:
3057: return 1;
1.95 noro 3058: case I_PVAR: case I_IFUNC:
3059: return -1;
1.106 noro 3060: case I_FUNC: case I_FUNC_QARG:
1.82 noro 3061: nm1 = ((FUNC)FA0(f1))->name; nm2 = ((FUNC)FA0(f2))->name;
3062: r = strcmp(nm1,nm2);
3063: if ( r > 0 ) return 1;
3064: else if ( r < 0 ) return -1;
1.80 noro 3065: else {
3066: /* compare args */
3067: n1 = FA0((FNODE)FA1(f1)); n2 = FA0((FNODE)FA1(f2));
3068: while ( n1 && n2 )
1.95 noro 3069: if ( r = nfnode_comp(BDY(n1),BDY(n2)) ) return r;
1.82 noro 3070: else {
3071: n1 = NEXT(n1); n2 = NEXT(n2);
3072: }
1.85 noro 3073: return n1?1:(n2?-1:0);
1.80 noro 3074: }
3075: break;
3076: default:
1.95 noro 3077: error("nfnode_comp : undefined");
1.80 noro 3078: }
3079: case I_PVAR:
3080: switch ( f2->id ) {
1.106 noro 3081: case I_FORMULA: case I_FUNC: case I_FUNC_QARG:
1.80 noro 3082: return 1;
1.95 noro 3083: case I_IFUNC:
3084: return -1;
1.80 noro 3085: case I_PVAR:
3086: i1 = (int)FA0(f1); i2 = (int)FA0(f2);
3087: if ( i1 > i2 ) return 1;
3088: else if ( i1 < i2 ) return -1;
3089: else return 0;
3090: default:
1.95 noro 3091: error("nfnode_comp : undefined");
3092: }
3093: break;
3094: case I_IFUNC:
3095: switch ( f2->id ) {
1.106 noro 3096: case I_FORMULA: case I_FUNC: case I_FUNC_QARG: case I_PVAR:
1.95 noro 3097: return 1;
3098: case I_IFUNC:
3099: i1 = (int)FA0((FNODE)FA0(f1));
3100: i2 = (int)FA0((FNODE)FA0(f2));
3101: if ( i1 > i2 ) return 1;
3102: else if ( i1 < i2 ) return -1;
3103: else {
3104: /* compare args */
3105: n1 = FA0((FNODE)FA1(f1)); n2 = FA0((FNODE)FA1(f2));
3106: while ( n1 && n2 )
3107: if ( r = nfnode_comp(BDY(n1),BDY(n2)) ) return r;
3108: else {
3109: n1 = NEXT(n1); n2 = NEXT(n2);
3110: }
3111: return n1?1:(n2?-1:0);
3112: }
3113: break;
3114:
3115: default:
3116: error("nfnode_comp : undefined");
1.80 noro 3117: }
3118: break;
3119: default:
1.95 noro 3120: error("nfnode_comp : undefined");
1.80 noro 3121: }
3122: }
3123:
1.95 noro 3124: int nfnode_comp_pwr(FNODE f1,FNODE f2)
1.80 noro 3125: {
3126: FNODE b1,b2,e1,e2;
3127: int r;
3128:
3129: fnode_base_exp(f1,&b1,&e1);
3130: fnode_base_exp(f2,&b2,&e2);
1.95 noro 3131: if ( r = nfnode_comp(b1,b2) ) {
1.83 noro 3132: if ( r > 0 )
1.95 noro 3133: return nfnode_comp(e1,mkfnode(1,I_FORMULA,0));
1.83 noro 3134: else if ( r < 0 )
1.95 noro 3135: return nfnode_comp(mkfnode(1,I_FORMULA,0),e2);
3136: } else return nfnode_comp(e1,e2);
1.70 noro 3137: }
1.87 noro 3138:
1.88 noro 3139: NODE append_node(NODE a1,NODE a2)
3140: {
3141: NODE t,t0;
3142:
3143: if ( !a1 )
3144: return a2;
3145: else {
3146: for ( t0 = 0; a1; a1 = NEXT(a1) ) {
3147: NEXTNODE(t0,t); BDY(t) = BDY(a1);
3148: }
3149: NEXT(t) = a2;
3150: return t0;
3151: }
3152: }
3153:
1.95 noro 3154: int nfnode_match(FNODE f,FNODE pat,NODE *rp)
1.87 noro 3155: {
3156: NODE m,m1,m2,base,exp,fa,pa,n;
3157: LIST l;
3158: QUOTE qp,qf;
1.96 noro 3159: FNODE fbase,fexp,a,fh;
1.87 noro 3160: FUNC ff,pf;
3161: int r;
3162:
1.97 noro 3163: if ( !pat )
3164: if ( !f ) {
3165: *rp = 0;
3166: return 1;
3167: } else
3168: return 0;
3169: else if ( !f )
3170: return 0;
1.87 noro 3171: switch ( pat->id ) {
3172: case I_PVAR:
3173: /* [[pat,f]] */
1.103 noro 3174: *rp = mknode(1,mknode(2,(int)FA0(pat),f));
1.87 noro 3175: return 1;
3176:
3177: case I_FORMULA:
1.93 noro 3178: if ( f->id == I_FORMULA && !arf_comp(CO,(Obj)FA0(f),(Obj)FA0(pat)) ) {
1.87 noro 3179: *rp = 0; return 1;
3180: } else
3181: return 0;
3182:
3183: case I_BOP:
3184: /* OPNAME should be "^" */
3185: if ( !IS_BINARYPWR(pat) )
1.95 noro 3186: error("nfnode_match : invalid BOP");
1.87 noro 3187: if ( IS_BINARYPWR(f) ) {
3188: fbase = FA1(f); fexp = FA2(f);
3189: } else {
3190: fbase = f; fexp = mkfnode(1,I_FORMULA,ONE);
3191: }
1.95 noro 3192: if ( !nfnode_match(fbase,FA1(pat),&base) ) return 0;
1.106 noro 3193: a = rewrite_fnode(FA2(pat),base,0);
1.95 noro 3194: if ( !nfnode_match(fexp,a,&exp) ) return 0;
1.88 noro 3195: else {
3196: *rp = append_node(base,exp);
3197: return 1;
3198: }
1.87 noro 3199: break;
3200:
1.95 noro 3201: case I_FUNC: case I_IFUNC:
1.87 noro 3202: if ( f->id != I_FUNC ) return 0;
1.95 noro 3203: ff = (FUNC)FA0(f);
3204: if ( pat->id == I_FUNC ) {
3205: pf = (FUNC)FA0(pat);
3206: if ( strcmp(ff->fullname,pf->fullname) ) return 0;
3207: m = 0;
3208: } else {
1.96 noro 3209: /* XXX : I_FUNC_HEAD is a dummy id to pass FUNC */
3210: fh = mkfnode(1,I_FUNC_HEAD,FA0(f));
3211: m = mknode(1,mknode(2,FA0((FNODE)FA0(pat)),fh),0);
1.95 noro 3212: }
1.87 noro 3213: /* FA1(f) and FA1(pat) are I_LIST */
3214: fa = (NODE)FA0((FNODE)FA1(f));
3215: pa = (NODE)FA0((FNODE)FA1(pat));
3216: while ( fa && pa ) {
1.106 noro 3217: a = rewrite_fnode(BDY(pa),m,0);
1.95 noro 3218: if ( !nfnode_match(BDY(fa),a,&m1) ) return 0;
1.88 noro 3219: m = append_node(m1,m);
3220: fa = NEXT(fa); pa = NEXT(pa);
1.87 noro 3221: }
3222: if ( fa || pa ) return 0;
3223: else {
3224: *rp = m;
3225: return 1;
3226: }
3227:
3228: case I_NARYOP:
3229: if ( IS_NARYADD(pat) )
1.95 noro 3230: return nfnode_match_naryadd(f,pat,rp);
1.87 noro 3231: else if ( IS_NARYMUL(pat) )
1.95 noro 3232: return nfnode_match_narymul(f,pat,rp);
1.87 noro 3233: else
1.95 noro 3234: error("nfnode_match : invalid NARYOP");
1.87 noro 3235: break;
3236:
3237: default:
1.95 noro 3238: error("nfnode_match : invalid pattern");
1.87 noro 3239: }
3240: }
3241:
1.88 noro 3242: /* remove i-th element */
1.87 noro 3243:
1.88 noro 3244: FNODE fnode_removeith_naryadd(FNODE p,int i)
3245: {
3246: int k,l;
3247: NODE t,r0,r,a;
3248:
3249: a = (NODE)FA1(p);
3250: l = length(a);
3251: if ( i < 0 || i >= l ) error("fnode_removeith_naryadd: invalid index");
3252: else if ( i == 0 )
1.106 noro 3253: return fnode_node_to_nary(addfs,NEXT(a));
1.88 noro 3254: else {
3255: for ( r0 = 0, k = 0, t = a; k < i; k++, t = NEXT(t) ) {
3256: NEXTNODE(r0,r);
3257: BDY(r) = BDY(t);
3258: }
1.94 noro 3259: NEXT(r) = NEXT(t);
1.106 noro 3260: return fnode_node_to_nary(addfs,r0);
1.88 noro 3261: }
3262:
3263: }
1.87 noro 3264:
1.88 noro 3265: /* a0,...,a(i-1) */
3266: FNODE fnode_left_narymul(FNODE p,int i)
1.87 noro 3267: {
1.88 noro 3268: int k,l;
3269: NODE t,r0,r,a;
3270:
3271: a = (NODE)FA1(p);
3272: l = length(a);
3273: if ( i < 0 || i >= l ) error("fnode_left_narymul : invalid index");
1.97 noro 3274: if ( i == 0 ) return 0;
1.88 noro 3275: else if ( i == 1 ) return (FNODE)BDY(a);
3276: else {
3277: for ( r0 = 0, k = 0, t = a; k < i; k++, t = NEXT(t) ) {
3278: NEXTNODE(r0,r);
3279: BDY(r) = BDY(t);
3280: }
3281: NEXT(r) = 0;
1.106 noro 3282: return fnode_node_to_nary(mulfs,r0);
1.88 noro 3283: }
3284: }
3285:
3286: /* a(i+1),...,a(l-1) */
3287: FNODE fnode_right_narymul(FNODE p,int i)
3288: {
3289: NODE a,t;
3290: int l,k;
3291:
3292: a = (NODE)FA1(p);
3293: l = length(a);
3294: if ( i < 0 || i >= l ) error("fnode_right_narymul : invalid index");
1.97 noro 3295: if ( i == l-1 ) return 0;
1.88 noro 3296: else {
3297: for ( k = 0, t = a; k <= i; k++, t = NEXT(t) );
1.106 noro 3298: return fnode_node_to_nary(mulfs,t);
1.88 noro 3299: }
3300: }
3301:
1.95 noro 3302: int nfnode_match_naryadd(FNODE f,FNODE p,NODE *rp)
1.88 noro 3303: {
3304: int fl,pl,fi,pi;
3305: NODE fa,pa,t,s,m,m1;
3306: FNODE fr,pr,prr,pivot;
1.87 noro 3307:
3308: f = to_naryadd(f);
1.88 noro 3309: fa = (NODE)FA1(f); fl = length(fa);
3310: pa = (NODE)FA1(p); pl = length(pa);
3311: if ( fl < pl ) return 0;
3312: else if ( pl == 1 ) {
3313: if ( fl == 1 )
1.95 noro 3314: return nfnode_match(BDY(fa),BDY(pa),rp);
1.87 noro 3315: else
3316: return 0;
3317: } else {
1.88 noro 3318: for ( t = pa, pi = 0; t; t = NEXT(t), pi++ )
3319: if ( ((FNODE)BDY(t))->id != I_PVAR ) break;
3320: if ( !t ) {
3321: /* all are I_PVAR */
3322: m = 0;
3323: for ( t = pa, s = fa; NEXT(t); t = NEXT(t), s = NEXT(s) ) {
1.95 noro 3324: nfnode_match(BDY(s),BDY(t),&m1);
1.88 noro 3325: m = append_node(m1,m);
3326: }
3327: if ( !NEXT(s) )
3328: fr = (FNODE)BDY(s);
3329: else
3330: fr = mkfnode(2,I_NARYOP,FA0(f),s);
1.95 noro 3331: nfnode_match(fr,BDY(t),&m1);
1.88 noro 3332: *rp = append_node(m1,m);
3333: return 1;
3334: } else {
3335: pivot = (FNODE)BDY(t);
3336: pr = fnode_removeith_naryadd(p,pi);
3337: for ( s = fa, fi = 0; s; s = NEXT(s), fi++ ) {
1.95 noro 3338: if ( nfnode_match(BDY(s),pivot,&m) ) {
1.88 noro 3339: fr = fnode_removeith_naryadd(f,fi);
1.106 noro 3340: prr = rewrite_fnode(pr,m,0);
1.95 noro 3341: if ( nfnode_match(fr,prr,&m1) ) {
1.88 noro 3342: *rp = append_node(m,m1);
3343: return 1;
3344: }
3345: }
3346: }
3347: return 0;
3348: }
1.87 noro 3349: }
3350: }
3351:
1.95 noro 3352: int nfnode_match_narymul(FNODE f,FNODE p,NODE *rp)
1.88 noro 3353: {
3354: int fl,pl,fi,pi;
3355: NODE fa,pa,t,s,m,m1;
3356: FNODE fr,pr,pleft,pleft1,pright,pright1,fleft,fright,pivot;
3357:
3358: f = to_narymul(f);
3359: fa = (NODE)FA1(f); fl = length(fa);
3360: pa = (NODE)FA1(p); pl = length(pa);
3361: if ( fl < pl ) return 0;
3362: else if ( pl == 1 ) {
3363: if ( fl == 1 )
1.95 noro 3364: return nfnode_match(BDY(fa),BDY(pa),rp);
1.88 noro 3365: else
3366: return 0;
3367: } else {
3368: for ( t = pa, pi = 0; t; t = NEXT(t), pi++ )
3369: if ( ((FNODE)BDY(t))->id != I_PVAR ) break;
3370: if ( !t ) {
3371: /* all are I_PVAR */
3372: m = 0;
3373: for ( t = pa, s = fa; NEXT(t); t = NEXT(t), s = NEXT(s) ) {
1.106 noro 3374: pr = rewrite_fnode(BDY(t),m,0);
1.95 noro 3375: if ( !nfnode_match(BDY(s),pr,&m1) ) return 0;
1.88 noro 3376: m = append_node(m1,m);
3377: }
3378: if ( !NEXT(s) )
3379: fr = (FNODE)BDY(s);
3380: else
3381: fr = mkfnode(2,I_NARYOP,FA0(f),s);
1.106 noro 3382: pr = rewrite_fnode(BDY(t),m,0);
1.95 noro 3383: if ( !nfnode_match(fr,pr,&m1) ) return 0;
1.88 noro 3384: *rp = append_node(m1,m);
3385: return 1;
3386: } else {
3387: pivot = (FNODE)BDY(t);
3388: pleft = fnode_left_narymul(p,pi);
3389: pright = fnode_right_narymul(p,pi);
3390: /* XXX : incomplete */
3391: for ( s = fa, fi = 0; s; s = NEXT(s), fi++ ) {
1.97 noro 3392: if ( fi < pi ) continue;
1.95 noro 3393: if ( nfnode_match(BDY(s),pivot,&m) ) {
1.88 noro 3394: fleft = fnode_left_narymul(f,fi);
1.106 noro 3395: pleft1 = rewrite_fnode(pleft,m,0);
1.95 noro 3396: if ( nfnode_match(fleft,pleft1,&m1) ) {
1.88 noro 3397: m = append_node(m1,m);
3398: fright = fnode_right_narymul(f,fi);
1.106 noro 3399: pright1 = rewrite_fnode(pright,m,0);
1.95 noro 3400: if ( nfnode_match(fright,pright1,&m1) ) {
1.88 noro 3401: *rp = append_node(m1,m);
3402: return 1;
3403: }
3404: }
3405: }
3406: }
3407: return 0;
3408: }
1.95 noro 3409: }
3410: }
3411:
3412: NODE nfnode_pvars(FNODE pat,NODE found)
3413: {
3414: int ind;
3415: NODE prev,t;
3416: int *pair;
3417:
3418: switch ( pat->id ) {
3419: case I_PVAR:
3420: ind = (int)FA0(pat);
3421: for ( prev = 0, t = found; t; prev = t, t = NEXT(t) ) {
3422: pair = (int *)BDY(t);
3423: if ( pair[0] == ind ) {
3424: pair[1]++;
3425: return found;
3426: }
3427: }
3428: pair = (int *)MALLOC_ATOMIC(sizeof(int)*2);
3429: pair[0] = ind; pair[1] = 1;
3430: if ( !prev )
3431: MKNODE(found,pair,0);
3432: else
3433: MKNODE(NEXT(prev),pair,0);
3434: return found;
3435:
3436: case I_FORMULA:
3437: return found;
3438:
3439: case I_BOP:
3440: /* OPNAME should be "^" */
3441: if ( !IS_BINARYPWR(pat) )
3442: error("nfnode_pvar : invalid BOP");
3443: found = nfnode_pvars(FA1(pat),found);
3444: found = nfnode_pvars(FA2(pat),found);
3445: return found;
3446:
3447: case I_FUNC:
3448: t = (NODE)FA0((FNODE)FA1(pat));
3449: for ( ; t; t = NEXT(t) )
3450: found = nfnode_pvars(BDY(t),found);
3451: return found;
3452:
3453: case I_NARYOP:
3454: t = (NODE)FA1(pat);
3455: for ( ; t; t = NEXT(t) )
3456: found = nfnode_pvars(BDY(t),found);
3457: return found;
3458:
3459: default:
3460: error("nfnode_match : invalid pattern");
1.88 noro 3461: }
3462: }