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