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