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