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