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