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