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