Annotation of OpenXM_contrib2/asir2000/builtin/strobj.c, Revision 1.123
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.123 ! fujimoto 48: * $OpenXM: OpenXM_contrib2/asir2000/builtin/strobj.c,v 1.122 2011/06/16 08:17:15 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
1.123 ! fujimoto 63: #elif defined(VISUAL) || defined(__MINGW32__) || defined(__MINGW64__)
1.89 noro 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.120 noro 1333: FUNC f;
1.1 noro 1334:
1335: p = BDY((STRING)ARG0(arg));
1336: #if 0
1337: if ( !islower(*p) )
1338: *rp = 0;
1339: else {
1340: for ( t = p+1; t && (isalnum(*t) || *t == '_'); t++ );
1341: if ( *t )
1342: *rp = 0;
1343: else
1344: makevar(p,rp);
1345: }
1346: #else
1.120 noro 1347: gen_searchf_searchonly(p,&f);
1348: if ( f )
1349: makesrvar(f,rp);
1350: else
1351: makevar(p,rp);
1.1 noro 1352: #endif
1.14 noro 1353: }
1354:
1.15 noro 1355: static struct TeXSymbol texsymbol[] = {
1356: {"sin","\\sin"},
1357: {"cos","\\cos"},
1358: {"tan","\\tan"},
1359: {"sinh","\\sinh"},
1360: {"cosh","\\cosh"},
1361: {"tanh","\\tanh"},
1362: {"exp","\\exp"},
1363: {"log","\\log"},
1364:
1365: /* Greek Letters (lower case) */
1366: {"alpha","\\alpha"},
1367: {"beta","\\beta"},
1368: {"gamma","\\gamma"},
1369: {"delta","\\delta"},
1370: {"epsilon","\\epsilon"},
1371: {"varepsilon","\\varepsilon"},
1372: {"zeta","\\zeta"},
1373: {"eta","\\eta"},
1374: {"theta","\\theta"},
1375: {"vartheta","\\vartheta"},
1376: {"iota","\\iota"},
1377: {"kappa","\\kappa"},
1378: {"lambda","\\lambda"},
1379: {"mu","\\mu"},
1380: {"nu","\\nu"},
1381: {"xi","\\xi"},
1382: {"pi","\\pi"},
1383: {"varpi","\\varpi"},
1384: {"rho","\\rho"},
1385: {"sigma","\\sigma"},
1386: {"varsigma","\\varsigma"},
1387: {"tau","\\tau"},
1388: {"upsilon","\\upsilon"},
1389: {"phi","\\phi"},
1390: {"varphi","\\varphi"},
1391: {"chi","\\chi"},
1392: {"omega","\\omega"},
1393:
1394: /* Greek Letters, (upper case) */
1395: {"ggamma","\\Gamma"},
1396: {"ddelta","\\Delta"},
1397: {"ttheta","\\Theta"},
1398: {"llambda","\\Lambda"},
1399: {"xxi","\\Xi"},
1400: {"ppi","\\Pi"},
1401: {"ssigma","\\Sigma"},
1402: {"uupsilon","\\Upsilon"},
1403: {"pphi","\\Phi"},
1404: {"ppsi","\\Psi"},
1405: {"oomega","\\Omega"},
1406:
1407: /* Our own mathematical functions */
1408: {"algebra_tensor","\\otimes"},
1409: {"base_where","{\\rm \\ where \\ }"},
1410: /* Mathematical constants */
1411: {"c_pi","\\pi"},
1412: {"c_i","\\sqrt{-1}"},
1413:
1414: /* Temporary */
1415: {0,0}
1416: };
1417:
1.14 noro 1418: char *symbol_name(char *name)
1419: {
1.15 noro 1420: int i;
1421:
1.41 noro 1422: if ( !name || strlen(name) == 0 )
1423: return "";
1.38 noro 1424: if ( !(conv_flag & CONV_TABLE) )
1425: return name;
1426:
1.18 noro 1427: if ( user_texsymbol )
1428: for ( i = 0; user_texsymbol[i].text; i++ )
1429: if ( !strcmp(user_texsymbol[i].text,name) )
1430: return user_texsymbol[i].symbol;
1.15 noro 1431: for ( i = 0; texsymbol[i].text; i++ )
1432: if ( !strcmp(texsymbol[i].text,name) )
1433: return texsymbol[i].symbol;
1.41 noro 1434: return 0;
1.52 noro 1435: }
1436:
1437: void Pget_function_name(NODE arg,STRING *rp)
1438: {
1.121 noro 1439: QUOTEARG qa;
1.52 noro 1440:
1.121 noro 1441: qa = (QUOTEARG)BDY(arg);
1442: if ( !qa || OID(qa) != O_QUOTEARG ) {
1443: *rp = 0; return;
1444: }
1445: switch ( qa->type ) {
1446: case A_arf:
1447: MKSTR(*rp,((ARF)BDY(qa))->name);
1448: break;
1449: case A_func:
1450: MKSTR(*rp,((FUNC)BDY(qa))->name);
1451: break;
1452: default:
1.52 noro 1453: *rp = 0;
1.121 noro 1454: break;
1455: }
1.14 noro 1456: }
1457:
1.51 noro 1458: FNODE strip_paren(FNODE);
1.111 noro 1459: void objtotex_tb(Obj obj,TB tb);
1.51 noro 1460:
1.14 noro 1461: void fnodetotex_tb(FNODE f,TB tb)
1462: {
1.91 noro 1463: NODE n,t,t0,args;
1.38 noro 1464: char vname[BUFSIZ],prefix[BUFSIZ];
1465: char *opname,*vname_conv,*prefix_conv;
1.14 noro 1466: Obj obj;
1.46 noro 1467: int i,len,allzero,elen,elen2,si;
1.40 noro 1468: char *r;
1.91 noro 1469: FNODE fi,f2,f1;
1.14 noro 1470:
1471: write_tb(" ",tb);
1472: if ( !f ) {
1473: write_tb("0",tb);
1474: return;
1475: }
1476: switch ( f->id ) {
1477: /* unary operators */
1.23 noro 1478: case I_NOT:
1479: write_tb("\\neg (",tb);
1480: fnodetotex_tb((FNODE)FA0(f),tb);
1481: write_tb(")",tb);
1482: break;
1483: case I_PAREN:
1484: write_tb("(",tb);
1485: fnodetotex_tb((FNODE)FA0(f),tb);
1486: write_tb(")",tb);
1487: break;
1488: case I_MINUS:
1489: write_tb("-",tb);
1490: fnodetotex_tb((FNODE)FA0(f),tb);
1491: break;
1492:
1493: /* binary operators */
1494: /* arg list */
1495: /* I_AND, I_OR => FA0(f), FA1(f) */
1496: /* otherwise => FA1(f), FA2(f) */
1497: case I_BOP:
1498: opname = ((ARF)FA0(f))->name;
1.70 noro 1499: switch ( opname[0] ) {
1500: case '+':
1501: fnodetotex_tb((FNODE)FA1(f),tb);
1502: if ( !top_is_minus((FNODE)FA2(f)) ) write_tb(opname,tb);
1503: fnodetotex_tb((FNODE)FA2(f),tb);
1504: break;
1505: case '-':
1506: if ( FA1(f) ) fnodetotex_tb((FNODE)FA1(f),tb);
1507: write_tb(opname,tb);
1508: fnodetotex_tb((FNODE)FA2(f),tb);
1509: break;
1510: case '*':
1511: fnodetotex_tb((FNODE)FA1(f),tb);
1512: write_tb(" ",tb);
1513: /* XXX special care for DP */
1514: f2 = (FNODE)FA2(f);
1515: if ( f2->id == I_EV ) {
1516: n = (NODE)FA0(f2);
1517: for ( i = 0; n; n = NEXT(n), i++ ) {
1518: fi = (FNODE)BDY(n);
1519: if ( fi->id != I_FORMULA || FA0(fi) )
1520: break;
1521: }
1522: if ( n )
1523: fnodetotex_tb((FNODE)FA2(f),tb);
1524: } else
1.23 noro 1525: fnodetotex_tb((FNODE)FA2(f),tb);
1.70 noro 1526: break;
1527: case '/':
1528: write_tb("\\frac{",tb);
1529: fnodetotex_tb((FNODE)FA1(f),tb);
1530: write_tb("} {",tb);
1531: fnodetotex_tb((FNODE)FA2(f),tb);
1532: write_tb("}",tb);
1533: break;
1534: case '^':
1.111 noro 1535: f1 = (FNODE)FA1(f);
1536: if ( fnode_is_var(f1) )
1537: fnodetotex_tb(f1,tb);
1538: else {
1539: write_tb("(",tb);
1540: fnodetotex_tb(f1,tb);
1541: write_tb(")",tb);
1542: }
1.70 noro 1543: write_tb("^{",tb);
1544: fnodetotex_tb(strip_paren((FNODE)FA2(f)),tb);
1545: write_tb("} ",tb);
1546: break;
1547: case '%':
1548: fnodetotex_tb((FNODE)FA1(f),tb);
1549: write_tb(" {\\rm mod}\\, ",tb);
1.23 noro 1550: fnodetotex_tb((FNODE)FA2(f),tb);
1.70 noro 1551: break;
1552: default:
1553: error("invalid binary operator");
1554: break;
1555: }
1.23 noro 1556: break;
1.91 noro 1557: case I_NARYOP:
1558: args = (NODE)FA1(f);
1559: switch ( OPNAME(f) ) {
1560: case '+':
1561: fnodetotex_tb((FNODE)BDY(args),tb);
1562: for ( args = NEXT(args); args; args = NEXT(args) ) {
1563: write_tb("+",tb);
1.111 noro 1564: f1 = (FNODE)BDY(args);
1.114 noro 1565: /* if ( fnode_is_var(f1) || IS_MUL(f1) )
1.111 noro 1566: fnodetotex_tb(f1,tb);
1.114 noro 1567: else */ {
1.111 noro 1568: write_tb("(",tb);
1569: fnodetotex_tb(f1,tb);
1570: write_tb(")",tb);
1571: }
1.91 noro 1572: }
1573: break;
1574: case '*':
1575: f1 = (FNODE)BDY(args);
1.111 noro 1576: if ( f1->id == I_FORMULA && MUNIQ(FA0(f1)) ) {
1577: write_tb("- ",tb); args = NEXT(args);
1578: }
1579: for ( ; args; args = NEXT(args) ) {
1.91 noro 1580: f2 = (FNODE)BDY(args);
1.111 noro 1581: if ( fnode_is_var(f2) || IS_BINARYPWR(f2) )
1582: fnodetotex_tb(f2,tb);
1583: else {
1584: write_tb("(",tb);
1.91 noro 1585: fnodetotex_tb(f2,tb);
1.111 noro 1586: write_tb(")",tb);
1587: }
1.91 noro 1588: }
1589: break;
1590: default:
1591: error("invalid nary op");
1592: break;
1593: }
1594: break;
1.23 noro 1595:
1596: case I_COP:
1597: switch( (cid)FA0(f) ) {
1598: case C_EQ:
1599: fnodetotex_tb((FNODE)FA1(f),tb);
1600: write_tb(" = ",tb);
1601: fnodetotex_tb((FNODE)FA2(f),tb);
1602: break;
1603: case C_NE:
1604: fnodetotex_tb((FNODE)FA1(f),tb);
1605: write_tb(" \\neq ",tb);
1606: fnodetotex_tb((FNODE)FA2(f),tb);
1607: break;
1608: case C_GT:
1609: fnodetotex_tb((FNODE)FA1(f),tb);
1.45 noro 1610: write_tb(" > ",tb);
1.23 noro 1611: fnodetotex_tb((FNODE)FA2(f),tb);
1612: break;
1613: case C_LT:
1614: fnodetotex_tb((FNODE)FA1(f),tb);
1.45 noro 1615: write_tb(" < ",tb);
1.23 noro 1616: fnodetotex_tb((FNODE)FA2(f),tb);
1.14 noro 1617: break;
1.23 noro 1618: case C_GE:
1619: fnodetotex_tb((FNODE)FA1(f),tb);
1620: write_tb(" \\geq ",tb);
1621: fnodetotex_tb((FNODE)FA2(f),tb);
1.14 noro 1622: break;
1.23 noro 1623: case C_LE:
1624: fnodetotex_tb((FNODE)FA1(f),tb);
1625: write_tb(" \\leq ",tb);
1626: fnodetotex_tb((FNODE)FA2(f),tb);
1.14 noro 1627: break;
1628: }
1629: break;
1630:
1.23 noro 1631: case I_LOP:
1632: switch( (lid)FA0(f) ) {
1633: case L_EQ:
1634: fnodetotex_tb((FNODE)FA1(f),tb);
1635: write_tb(" = ",tb);
1636: fnodetotex_tb((FNODE)FA2(f),tb);
1637: break;
1638: case L_NE:
1639: fnodetotex_tb((FNODE)FA1(f),tb);
1640: write_tb(" \\neq ",tb);
1641: fnodetotex_tb((FNODE)FA2(f),tb);
1642: break;
1643: case L_GT:
1644: fnodetotex_tb((FNODE)FA1(f),tb);
1.45 noro 1645: write_tb(" > ",tb);
1.23 noro 1646: fnodetotex_tb((FNODE)FA2(f),tb);
1647: break;
1648: case L_LT:
1649: fnodetotex_tb((FNODE)FA1(f),tb);
1.45 noro 1650: write_tb(" < ",tb);
1.23 noro 1651: fnodetotex_tb((FNODE)FA2(f),tb);
1652: break;
1653: case L_GE:
1654: fnodetotex_tb((FNODE)FA1(f),tb);
1655: write_tb(" \\geq ",tb);
1656: fnodetotex_tb((FNODE)FA2(f),tb);
1.14 noro 1657: break;
1.23 noro 1658: case L_LE:
1659: fnodetotex_tb((FNODE)FA1(f),tb);
1660: write_tb(" \\leq ",tb);
1661: fnodetotex_tb((FNODE)FA2(f),tb);
1.14 noro 1662: break;
1.23 noro 1663: case L_AND:
1664: fnodetotex_tb((FNODE)FA1(f),tb);
1.14 noro 1665: write_tb(" {\\rm \\ and\\ } ",tb);
1.23 noro 1666: fnodetotex_tb((FNODE)FA2(f),tb);
1667: break;
1668: case L_OR:
1.14 noro 1669: fnodetotex_tb((FNODE)FA1(f),tb);
1.23 noro 1670: write_tb(" {\\rm \\ or\\ } ",tb);
1671: fnodetotex_tb((FNODE)FA2(f),tb);
1.14 noro 1672: break;
1.23 noro 1673: case L_NOT:
1674: /* XXX : L_NOT is a unary operator */
1675: write_tb("\\neg (",tb);
1.14 noro 1676: fnodetotex_tb((FNODE)FA1(f),tb);
1.23 noro 1677: write_tb(")",tb);
1678: return;
1.14 noro 1679: }
1680: break;
1681:
1.23 noro 1682: case I_AND:
1683: fnodetotex_tb((FNODE)FA0(f),tb);
1684: write_tb(" {\\rm \\ and\\ } ",tb);
1685: fnodetotex_tb((FNODE)FA1(f),tb);
1686: break;
1687:
1688: case I_OR:
1689: fnodetotex_tb((FNODE)FA0(f),tb);
1690: write_tb(" {\\rm \\ or\\ } ",tb);
1691: fnodetotex_tb((FNODE)FA1(f),tb);
1692: break;
1693:
1.14 noro 1694: /* ternary operators */
1695: case I_CE:
1696: error("fnodetotex_tb : not implemented yet");
1697: break;
1698:
1699: /* lists */
1700: case I_LIST:
1701: write_tb(" [ ",tb);
1702: n = (NODE)FA0(f);
1703: fnodenodetotex_tb(n,tb);
1704: write_tb("]",tb);
1705: break;
1706:
1707: /* function */
1.23 noro 1708: case I_FUNC:
1.40 noro 1709: if ( !strcmp(((FUNC)FA0(f))->name,"@pi") )
1710: write_tb("\\pi",tb);
1711: else if ( !strcmp(((FUNC)FA0(f))->name,"@e") )
1712: write_tb("e",tb);
1713: else {
1714: opname = conv_rule(((FUNC)FA0(f))->name);
1715: write_tb(opname,tb);
1716: write_tb("(",tb);
1717: fargstotex_tb(opname,FA1(f),tb);
1718: write_tb(")",tb);
1719: }
1.23 noro 1720: break;
1721:
1722: /* XXX */
1723: case I_CAR:
1.28 noro 1724: opname = conv_rule("car");
1.23 noro 1725: write_tb(opname,tb);
1726: write_tb("(",tb);
1727: fargstotex_tb(opname,FA0(f),tb);
1728: write_tb(")",tb);
1729: break;
1730:
1731: case I_CDR:
1.28 noro 1732: opname = conv_rule("cdr");
1.23 noro 1733: write_tb(opname,tb);
1734: write_tb("(",tb);
1735: fargstotex_tb(opname,FA0(f),tb);
1736: write_tb(")",tb);
1737: break;
1738:
1739: /* exponent vector */
1740: case I_EV:
1741: n = (NODE)FA0(f);
1.31 noro 1742: if ( dp_vars_hweyl ) {
1743: elen = length(n);
1744: elen2 = elen>>1;
1745: elen = elen2<<1;
1746: }
1.23 noro 1747: allzero = 1;
1.27 noro 1748: if ( show_lt && is_lt )
1749: write_tb("\\underline{",tb);
1.23 noro 1750: for ( t0 = 0, i = 0; n; n = NEXT(n), i++ ) {
1751: fi = (FNODE)BDY(n);
1752: if ( fi->id == I_FORMULA && !FA0(fi) ) continue;
1753: allzero = 0;
1.38 noro 1754: if ( dp_vars && i < dp_vars_len ) {
1755: strcpy(vname,dp_vars[i]);
1756: vname_conv = conv_rule(vname);
1757: } else {
1758: if ( dp_vars_hweyl ) {
1.44 noro 1759: if ( i < elen2 ) {
1.38 noro 1760: strcpy(prefix,dp_vars_prefix?dp_vars_prefix:"x");
1.44 noro 1761: prefix_conv = conv_rule(prefix);
1762: vname_conv = (char *)ALLOCA(strlen(prefix_conv)+50);
1.46 noro 1763: si = i+dp_vars_origin;
1764: sprintf(vname_conv,(si>=0&&si<10)?"%s_%d":"%s_{%d}",
1765: prefix_conv,si);
1.44 noro 1766: } else if ( i < elen ) {
1.46 noro 1767: strcpy(prefix,
1768: dp_dvars_prefix?dp_dvars_prefix:"\\partial");
1.44 noro 1769: prefix_conv = conv_rule(prefix);
1770: vname_conv = (char *)ALLOCA(strlen(prefix_conv)+50);
1.46 noro 1771: si = i+dp_dvars_origin-elen2;
1772: sprintf(vname_conv,(si>=0&&si<10)?"%s_%d":"%s_{%d}",
1773: prefix_conv,si);
1.44 noro 1774: } else {
1.38 noro 1775: strcpy(prefix,"h");
1.44 noro 1776: vname_conv = conv_rule(prefix);
1777: }
1778: } else {
1.38 noro 1779: strcpy(prefix,dp_vars_prefix?dp_vars_prefix:"x");
1.44 noro 1780: prefix_conv = conv_rule(prefix);
1781: vname_conv = (char *)ALLOCA(strlen(prefix_conv)+50);
1.46 noro 1782: si = i+dp_vars_origin;
1783: sprintf(vname_conv,(si>=0&&si<10)?"%s_%d":"%s_{%d}",
1784: prefix_conv,si);
1.44 noro 1785: }
1.38 noro 1786: }
1.23 noro 1787: if ( fi->id == I_FORMULA && UNIQ(FA0(fi)) ) {
1788: len = strlen(vname_conv);
1789: opname = MALLOC_ATOMIC(len+2);
1790: sprintf(opname,"%s ",vname_conv);
1.14 noro 1791: write_tb(opname,tb);
1.23 noro 1792: } else {
1793: len = strlen(vname_conv);
1794: /* 2: ^{ */
1795: opname = MALLOC_ATOMIC(len+1+2);
1796: sprintf(opname,"%s^{",vname_conv);
1.14 noro 1797: write_tb(opname,tb);
1.23 noro 1798: fnodetotex_tb((FNODE)BDY(n),tb);
1799: write_tb("} ",tb);
1800: }
1.14 noro 1801: }
1.23 noro 1802: /* XXX */
1803: if ( allzero )
1804: write_tb(" 1 ",tb);
1.27 noro 1805: if ( show_lt && is_lt ) {
1806: write_tb("}",tb);
1807: is_lt = 0;
1808: }
1.14 noro 1809: break;
1810:
1.23 noro 1811: /* string */
1.14 noro 1812: case I_STR:
1813: write_tb((char *)FA0(f),tb);
1814: break;
1815:
1.23 noro 1816: /* internal object */
1.14 noro 1817: case I_FORMULA:
1.111 noro 1818: objtotex_tb((Obj)FA0(f),tb);
1.14 noro 1819: break;
1820:
1.23 noro 1821: /* program variable */
1.14 noro 1822: case I_PVAR:
1823: if ( FA1(f) )
1824: error("fnodetotex_tb : not implemented yet");
1825: GETPVNAME(FA0(f),opname);
1826: write_tb(opname,tb);
1827: break;
1828:
1829: default:
1830: error("fnodetotex_tb : not implemented yet");
1831: }
1.40 noro 1832: }
1833:
1.111 noro 1834: void objtotex_tb(Obj obj,TB tb)
1835: {
1836: C cplx;
1837: char *r;
1838: P t;
1839: DCP dc;
1840: char *v;
1841:
1842: if ( !obj ) {
1843: write_tb("0",tb);
1844: return;
1845: }
1846: switch ( OID(obj) ) {
1847: case O_N:
1848: switch ( NID(obj) ) {
1849: case N_C:
1850: cplx = (C)obj;
1851: write_tb("(",tb);
1852: if ( cplx->r ) {
1853: r = objtostr((Obj)cplx->r); write_tb(r,tb);
1854: }
1855: if ( cplx->i ) {
1856: if ( cplx->r && compnum(0,cplx->i,0) > 0 ) {
1857: write_tb("+",tb);
1858: if ( !UNIQ(cplx->i) ) {
1859: r = objtostr((Obj)cplx->i); write_tb(r,tb);
1860: }
1861: } else if ( MUNIQ(cplx->i) )
1862: write_tb("-",tb);
1863: else if ( !UNIQ(cplx->i) ) {
1864: r = objtostr((Obj)cplx->i); write_tb(r,tb);
1865: }
1866: write_tb("\\sqrt{-1}",tb);
1867: }
1868: write_tb(")",tb);
1869: break;
1870: default:
1871: write_tb(objtostr(obj),tb);
1872: break;
1873: }
1874: break;
1875: case O_P:
1876: v = conv_rule(VR((P)obj)->name);
1877: for ( dc = DC((P)obj); dc; dc = NEXT(dc) ) {
1878: if ( !DEG(dc) )
1879: objtotex_tb((Obj)COEF(dc),tb);
1880: else {
1881: if ( NUM(COEF(dc)) && UNIQ((Q)COEF(dc)) )
1882: ;
1883: else if ( NUM(COEF(dc)) && MUNIQ((Q)COEF(dc)) )
1884: write_tb("-",tb);
1885: else if ( NUM(COEF(dc)) || !NEXT(DC(COEF(dc))))
1886: objtotex_tb((Obj)COEF(dc),tb);
1887: else {
1888: write_tb("(",tb); objtotex_tb((Obj)COEF(dc),tb);
1889: write_tb(")",tb);
1890: }
1891: write_tb(v,tb);
1892: if ( cmpq(DEG(dc),ONE) ) {
1893: write_tb("^",tb);
1894: if ( INT(DEG(dc)) && SGN(DEG(dc))>0 ) {
1895: write_tb("{",tb);
1896: objtotex_tb((Obj)DEG(dc),tb);
1897: write_tb("}",tb);
1898: } else {
1899: write_tb("{",tb); objtotex_tb((Obj)DEG(dc),tb);
1900: write_tb("}",tb);
1901: }
1902: }
1903: }
1904: if ( NEXT(dc) ) {
1905: t = COEF(NEXT(dc));
1906: if ( !DEG(NEXT(dc)) ) {
1907: if ( NUM(t) ) {
1908: if ( !mmono(t) ) write_tb("+",tb);
1909: } else {
1910: if ( !mmono(COEF(DC(t))) ) write_tb("+",tb);
1911: }
1912: } else {
1913: if ( !mmono(t) ) write_tb("+",tb);
1914: }
1915: }
1916: }
1917: break;
1918: case O_R:
1919: write_tb("\\frac{",tb);
1920: objtotex_tb((Obj)NM((R)obj),tb);
1921: write_tb("}{",tb);
1922: objtotex_tb((Obj)DN((R)obj),tb);
1923: write_tb("}",tb);
1924: break;
1925: default:
1926: write_tb(objtostr(obj),tb);
1927: break;
1928: }
1929: }
1930:
1.40 noro 1931: char *objtostr(Obj obj)
1932: {
1933: int len;
1934: char *r;
1935:
1936: len = estimate_length(CO,obj);
1937: r = (char *)MALLOC_ATOMIC(len+1);
1938: soutput_init(r);
1939: sprintexpr(CO,obj);
1940: return r;
1.50 ohara 1941: }
1942:
1943: void Psprintf(NODE arg,STRING *rp)
1944: {
1945: STRING string;
1946: char *s,*t,*r;
1947: int argc,n,len;
1948: NODE node;
1949:
1950: string = (STRING)ARG0(arg);
1951: asir_assert(string,O_STR,"sprintf");
1952: s = BDY(string);
1953: for(n = 0, t = s; *t; t++) {
1954: if (*t=='%' && *(t+1)=='a') {
1955: n++;
1956: }
1957: }
1958: for(node = NEXT(arg), argc = 0, len = strlen(s); node; node = NEXT(node), argc++) {
1959: len += estimate_length(CO,BDY(node));
1960: }
1961: if (argc < n) {
1962: error("sprintf: invalid argument");
1963: }
1964: r = (char *)MALLOC_ATOMIC(len);
1965: for(node = NEXT(arg), t = r; *s; s++) {
1966: if (*s=='%' && *(s+1)=='a') {
1967: strcpy(t,objtostr(BDY(node)));
1968: node = NEXT(node);
1969: t = strchr(t,0);
1970: s++;
1971: }else {
1972: *t++ = *s;
1973: }
1974: }
1975: *t = 0;
1976: MKSTR(*rp,r);
1.14 noro 1977: }
1978:
1979: void fnodenodetotex_tb(NODE n,TB tb)
1980: {
1981: for ( ; n; n = NEXT(n) ) {
1.27 noro 1982: is_lt = 1;
1.14 noro 1983: fnodetotex_tb((FNODE)BDY(n),tb);
1984: if ( NEXT(n) ) write_tb(", ",tb);
1985: }
1986: }
1987:
1988: void fargstotex_tb(char *name,FNODE f,TB tb)
1989: {
1990: NODE n;
1991:
1992: if ( !strcmp(name,"matrix") ) {
1993: error("fargstotex_tb : not implemented yet");
1994: } else if ( !strcmp(name,"vector") ) {
1995: error("fargstotex_tb : not implemented yet");
1996: } else {
1997: if ( f->id == I_LIST ) {
1998: n = (NODE)FA0(f);
1999: fnodenodetotex_tb(n,tb);
2000: } else
2001: fnodetotex_tb(f,tb);
1.35 noro 2002: }
2003: }
2004:
2005: int top_is_minus(FNODE f)
2006: {
2007: char *opname;
2008: int len;
2009: Obj obj;
2010:
2011: if ( !f )
2012: return 0;
2013: switch ( f->id ) {
2014: case I_MINUS:
2015: return 1;
2016: case I_BOP:
2017: opname = ((ARF)FA0(f))->name;
2018: switch ( opname[0] ) {
2019: case '+': case '*': case '/': case '^': case '%':
2020: return top_is_minus((FNODE)FA1(f));
2021: case '-':
2022: if ( FA1(f) )
2023: return top_is_minus((FNODE)FA1(f));
2024: else
2025: return 1;
2026: default:
2027: return 0;
2028: }
2029: break;
2030: case I_COP:
2031: return top_is_minus((FNODE)FA1(f));
2032: case I_LOP:
2033: if ( (lid)FA0(f) == L_NOT ) return 0;
2034: else return top_is_minus((FNODE)FA1(f));
2035: case I_AND: case I_OR:
2036: return top_is_minus((FNODE)FA0(f));
2037: case I_FORMULA:
2038: obj = (Obj)FA0(f);
1.36 noro 2039: if ( !obj )
2040: return 0;
2041: else {
2042: switch ( OID(obj) ) {
2043: case O_N:
2044: return mmono((P)obj);
2045: case O_P:
1.111 noro 2046: #if 0
1.36 noro 2047: /* must be a variable */
2048: opname = conv_rule(VR((P)obj)->name);
2049: return opname[0]=='-';
1.111 noro 2050: #else
2051: return mmono((P)obj);
2052: #endif
1.36 noro 2053: default:
2054: /* ??? */
2055: len = estimate_length(CO,obj);
2056: opname = (char *)MALLOC_ATOMIC(len+1);
2057: soutput_init(opname);
2058: sprintexpr(CO,obj);
2059: return opname[0]=='-';
2060: }
1.35 noro 2061: }
1.91 noro 2062: case I_NARYOP:
2063: return top_is_minus((FNODE)BDY((NODE)FA1(f)));
2064:
1.35 noro 2065: default:
2066: return 0;
1.14 noro 2067: }
1.47 noro 2068: }
2069:
2070: FNODE flatten_fnode(FNODE,char *);
2071:
1.48 noro 2072: void Pflatten_quote(NODE arg,Obj *rp)
1.47 noro 2073: {
2074: FNODE f;
2075: QUOTE q;
2076:
1.48 noro 2077: if ( !ARG0(arg) || OID((Obj)ARG0(arg)) != O_QUOTE )
2078: *rp = (Obj)ARG0(arg);
1.65 noro 2079: else if ( argc(arg) == 1 ) {
2080: f = flatten_fnode(BDY((QUOTE)ARG0(arg)),"+");
2081: f = flatten_fnode(f,"*");
2082: MKQUOTE(q,f);
2083: *rp = (Obj)q;
2084: } else {
1.48 noro 2085: f = flatten_fnode(BDY((QUOTE)ARG0(arg)),BDY((STRING)ARG1(arg)));
2086: MKQUOTE(q,f);
2087: *rp = (Obj)q;
2088: }
1.63 noro 2089: }
2090:
2091: void Pget_quote_id(NODE arg,Q *rp)
2092: {
2093: FNODE f;
2094: QUOTE q;
2095:
2096: q = (QUOTE)ARG0(arg);
2097: if ( !q || OID(q) != O_QUOTE )
2098: error("get_quote_id : invalid argument");
2099: f = BDY(q);
2100: STOQ((int)f->id,*rp);
1.48 noro 2101: }
2102:
2103: void Pquote_to_funargs(NODE arg,LIST *rp)
2104: {
2105: fid_spec_p spec;
2106: QUOTE q;
2107: QUOTEARG qa;
2108: FNODE f;
2109: STRING s;
2110: QUOTE r;
2111: int i;
2112: Q id,a;
1.49 noro 2113: LIST l;
2114: NODE t0,t,w,u,u0;
1.48 noro 2115:
2116: q = (QUOTE)ARG0(arg);
2117: if ( !q || OID(q) != O_QUOTE )
2118: error("quote_to_funargs : invalid argument");
2119: f = BDY(q);
2120: if ( !f ) {
2121: MKLIST(*rp,0);
2122: return;
2123: }
2124: get_fid_spec(f->id,&spec);
2125: if ( !spec )
2126: error("quote_to_funargs : not supported yet");
2127: t0 = 0;
2128: STOQ((int)f->id,id);
2129: NEXTNODE(t0,t);
2130: BDY(t) = (pointer)id;
2131: for ( i = 0; spec->type[i] != A_end; i++ ) {
2132: NEXTNODE(t0,t);
2133: switch ( spec->type[i] ) {
2134: case A_fnode:
2135: MKQUOTE(r,(FNODE)f->arg[i]);
2136: BDY(t) = (pointer)r;
2137: break;
2138: case A_int:
2139: STOQ((int)f->arg[i],a);
2140: BDY(t) = (pointer)a;
2141: break;
2142: case A_str:
2143: MKSTR(s,(char *)f->arg[i]);
2144: BDY(t) = (pointer)s;
2145: break;
2146: case A_internal:
2147: BDY(t) = (pointer)f->arg[i];
2148: break;
1.49 noro 2149: case A_node:
2150: w = (NODE)f->arg[i];
2151: for ( u0 = 0; w; w = NEXT(w) ){
2152: NEXTNODE(u0,u);
2153: MKQUOTE(r,(FNODE)BDY(w));
2154: BDY(u) = (pointer)r;
2155: }
2156: if ( u0 ) NEXT(u) = 0;
2157: MKLIST(l,u0);
2158: BDY(t) = (pointer)l;
2159: break;
1.48 noro 2160: default:
2161: MKQUOTEARG(qa,spec->type[i],f->arg[i]);
2162: BDY(t) = (pointer)qa;
2163: break;
2164: }
2165: }
2166: if ( t0 ) NEXT(t) = 0;
2167: MKLIST(*rp,t0);
2168: }
2169:
2170: void Pfunargs_to_quote(NODE arg,QUOTE *rp)
2171: {
2172: fid_spec_p spec;
2173: QUOTE q;
2174: QUOTEARG qa;
2175: FNODE f;
2176: STRING s;
1.49 noro 2177: QUOTE r,b;
1.48 noro 2178: int i;
2179: LIST l;
2180: fid id;
2181: Obj a;
1.49 noro 2182: NODE t0,t,u0,u,w;
1.48 noro 2183:
2184: l = (LIST)ARG0(arg);
2185: if ( !l || OID(l) != O_LIST || !(t=BDY(l)) )
2186: error("funargs_to_quote : invalid argument");
2187: t = BDY(l);
2188: id = (fid)QTOS((Q)BDY(t)); t = NEXT(t);
2189: get_fid_spec(id,&spec);
2190: if ( !spec )
2191: error("funargs_to_quote : not supported yet");
2192: for ( i = 0; spec->type[i] != A_end; i++ );
2193: NEWFNODE(f,i);
2194: f->id = id;
2195: for ( i = 0; spec->type[i] != A_end; i++, t = NEXT(t) ) {
2196: if ( !t )
2197: error("funargs_to_quote : argument mismatch");
2198: a = (Obj)BDY(t);
2199: switch ( spec->type[i] ) {
2200: case A_fnode:
2201: if ( !a || OID(a) != O_QUOTE )
2202: error("funargs_to_quote : invalid argument");
2203: f->arg[i] = BDY((QUOTE)a);
2204: break;
2205: case A_int:
2206: if ( !INT(a) )
2207: error("funargs_to_quote : invalid argument");
2208: f->arg[i] = (pointer)QTOS((Q)a);
2209: break;
2210: case A_str:
2211: if ( !a || OID(a) != O_STR )
2212: error("funargs_to_quote : invalid argument");
2213: f->arg[i] = (pointer)BDY((STRING)a);
2214: break;
2215: case A_internal:
2216: f->arg[i] = (pointer)a;
1.49 noro 2217: break;
2218: case A_node:
2219: if ( !a || OID(a) != O_LIST )
2220: error("funargs_to_quote : invalid argument");
2221: u0 = 0;
2222: for ( w = BDY((LIST)a); w; w = NEXT(w) ) {
2223: NEXTNODE(u0,u);
2224: b = (QUOTE)BDY(w);
2225: if ( !b || OID(b) != O_QUOTE )
2226: error("funargs_to_quote : invalid argument");
2227: BDY(u) = BDY(b);
2228: }
2229: if ( u0 ) NEXT(u) = 0;
2230: f->arg[i] = (pointer)u0;
1.48 noro 2231: break;
2232: default:
2233: if ( !a || OID(a) != O_QUOTEARG ||
2234: ((QUOTEARG)a)->type != spec->type[i] )
2235: error("funargs_to_quote : invalid argument");
2236: f->arg[i] = BDY((QUOTEARG)a);
2237: break;
2238: }
2239: }
2240: MKQUOTE(*rp,f);
1.69 noro 2241: }
2242:
1.105 noro 2243: VL reordvars(VL vl0,NODE head)
2244: {
2245: VL vl,svl,tvl;
2246: int i,j;
2247: NODE n;
2248: P t;
2249: V *va;
2250: V v;
2251:
2252: for ( vl = 0, i = 0, n = head; n; n = NEXT(n), i++ ) {
2253: NEXTVL(vl,tvl);
2254: if ( !(t = (P)BDY(n)) || (OID(t) != O_P) )
2255: error("reordvars : invalid argument");
2256: VR(tvl) = VR(t);
2257: }
2258: va = (V *)ALLOCA(i*sizeof(V));
2259: for ( j = 0, svl = vl; j < i; j++, svl = NEXT(svl) )
2260: va[j] = VR(svl);
2261: for ( svl = vl0; svl; svl = NEXT(svl) ) {
2262: v = VR(svl);
2263: for ( j = 0; j < i; j++ )
2264: if ( v == va[j] )
2265: break;
2266: if ( j == i ) {
2267: NEXTVL(vl,tvl);
2268: VR(tvl) = v;
2269: }
2270: }
2271: if ( vl )
2272: NEXT(tvl) = 0;
2273: return vl;
2274: }
2275:
1.109 noro 2276: struct wtab {
2277: V v;
2278: int w;
2279: };
2280:
2281: struct wtab *qt_weight_tab;
1.108 noro 2282: VL qt_current_ord, qt_current_coef;
1.109 noro 2283: LIST qt_current_ord_obj,qt_current_coef_obj,qt_current_weight_obj;
2284: LIST qt_current_weight_obj;
1.105 noro 2285:
2286: void Pqt_set_ord(NODE arg,LIST *rp)
2287: {
2288: NODE r0,r;
2289: VL vl;
2290: P v;
2291:
2292: if ( !argc(arg) )
2293: *rp = qt_current_ord_obj;
1.109 noro 2294: else if ( !ARG0(arg) ) {
2295: qt_current_ord_obj = 0;
2296: qt_current_ord = 0;
2297: } else {
1.105 noro 2298: qt_current_ord = reordvars(CO,BDY((LIST)ARG0(arg)));
2299: for ( r0 = 0, vl = qt_current_ord; vl; vl = NEXT(vl) ) {
2300: NEXTNODE(r0,r); MKV(vl->v,v); BDY(r) = v;
2301: }
2302: if ( r0 ) NEXT(r) = 0;
2303: MKLIST(*rp,r0);
2304: qt_current_ord_obj = *rp;
2305: }
2306: }
2307:
1.109 noro 2308: void Pqt_set_weight(NODE arg,LIST *rp)
2309: {
2310: NODE n,pair;
2311: int l,i;
2312: struct wtab *tab;
2313:
2314: if ( !argc(arg) )
2315: *rp = qt_current_weight_obj;
2316: else if ( !ARG0(arg) ) {
2317: qt_current_weight_obj = 0;
2318: qt_weight_tab = 0;
2319: } else {
2320: n = BDY((LIST)ARG0(arg));
2321: l = length(n);
2322: tab = qt_weight_tab = (struct wtab *)MALLOC((l+1)*sizeof(struct wtab));
2323: for ( i = 0; i < l; i++, n = NEXT(n) ) {
2324: pair = BDY((LIST)BDY(n));
2325: tab[i].v = VR((P)ARG0(pair));
2326: tab[i].w = QTOS((Q)ARG1(pair));
2327: }
2328: tab[i].v = 0;
2329: qt_current_weight_obj = (LIST)ARG0(arg);
2330: *rp = qt_current_weight_obj;
2331: }
2332: }
2333:
1.108 noro 2334: void Pqt_set_coef(NODE arg,LIST *rp)
2335: {
2336: NODE r0,r,n;
2337: VL vl0,vl;
2338: P v;
2339:
2340: if ( !argc(arg) )
2341: *rp = qt_current_coef_obj;
1.109 noro 2342: else if ( !ARG0(arg) ) {
2343: qt_current_coef_obj = 0;
2344: qt_current_coef = 0;
2345: } else {
1.108 noro 2346: n = BDY((LIST)ARG0(arg));
2347: for ( vl0 = 0, r0 = 0; n; n = NEXT(n) ) {
2348: NEXTNODE(r0,r);
2349: NEXTVL(vl0,vl);
2350: vl->v = VR((P)BDY(n));
2351: MKV(vl->v,v); BDY(r) = v;
2352: }
2353: if ( r0 ) NEXT(r) = 0;
2354: if ( vl0 ) NEXT(vl) = 0;
2355: qt_current_coef = vl0;
2356: MKLIST(*rp,r0);
2357: qt_current_coef_obj = *rp;
2358: }
2359: }
2360:
1.105 noro 2361: void Pqt_normalize(NODE arg,QUOTE *rp)
1.70 noro 2362: {
2363: QUOTE q,r;
2364: FNODE f;
1.76 noro 2365: int expand,ac;
1.70 noro 2366:
1.76 noro 2367: ac = argc(arg);
1.105 noro 2368: if ( !ac ) error("qt_normalize : invalid argument");
1.70 noro 2369: q = (QUOTE)ARG0(arg);
1.103 noro 2370: if ( ac == 2 )
2371: expand = QTOS((Q)ARG1(arg));
1.97 noro 2372: if ( !q || OID(q) != O_QUOTE )
1.87 noro 2373: *rp = q;
2374: else {
1.76 noro 2375: f = fnode_normalize(BDY(q),expand);
1.70 noro 2376: MKQUOTE(r,f);
2377: *rp = r;
1.98 noro 2378: }
2379: }
2380:
2381: NBP fnode_to_nbp(FNODE f);
2382:
1.105 noro 2383: void Pqt_to_nbp(NODE arg,NBP *rp)
1.98 noro 2384: {
2385: QUOTE q;
2386: FNODE f;
2387:
2388: q = (QUOTE)ARG0(arg); f = (FNODE)BDY(q);
2389: f = fnode_normalize(f,0);
2390: *rp = fnode_to_nbp(f);
2391: }
2392:
1.101 noro 2393: void Pshuffle_mul(NODE arg,NBP *rp)
1.98 noro 2394: {
2395: NBP p1,p2;
2396:
2397: p1 = (NBP)ARG0(arg);
2398: p2 = (NBP)ARG1(arg);
2399: shuffle_mulnbp(CO,p1,p2,rp);
2400: }
1.99 noro 2401:
1.101 noro 2402: void Pharmonic_mul(NODE arg,NBP *rp)
1.99 noro 2403: {
2404: NBP p1,p2;
2405:
2406: p1 = (NBP)ARG0(arg);
2407: p2 = (NBP)ARG1(arg);
2408: harmonic_mulnbp(CO,p1,p2,rp);
2409: }
2410:
1.100 noro 2411: void Pnbp_hm(NODE arg, NBP *rp)
2412: {
2413: NBP p;
2414: NODE n;
2415: NBM m;
2416:
2417: p = (NBP)ARG0(arg);
2418: if ( !p ) *rp = 0;
2419: else {
2420: m = (NBM)BDY(BDY(p));
2421: MKNODE(n,m,0);
2422: MKNBP(*rp,n);
2423: }
2424: }
2425:
2426: void Pnbp_ht(NODE arg, NBP *rp)
2427: {
2428: NBP p;
2429: NODE n;
2430: NBM m,m1;
2431:
2432: p = (NBP)ARG0(arg);
2433: if ( !p ) *rp = 0;
2434: else {
2435: m = (NBM)BDY(BDY(p));
2436: NEWNBM(m1);
1.115 noro 2437: m1->d = m->d; m1->c = (P)ONE; m1->b = m->b;
1.100 noro 2438: MKNODE(n,m1,0);
2439: MKNBP(*rp,n);
2440: }
2441: }
2442:
1.115 noro 2443: void Pnbp_hc(NODE arg, P *rp)
1.100 noro 2444: {
2445: NBP p;
2446: NBM m;
2447:
2448: p = (NBP)ARG0(arg);
2449: if ( !p ) *rp = 0;
2450: else {
2451: m = (NBM)BDY(BDY(p));
2452: *rp = m->c;
2453: }
2454: }
2455:
2456: void Pnbp_rest(NODE arg, NBP *rp)
2457: {
2458: NBP p;
2459: NODE n;
2460:
2461: p = (NBP)ARG0(arg);
2462: if ( !p ) *rp = 0;
2463: else {
2464: n = BDY(p);
2465: if ( !NEXT(n) ) *rp = 0;
2466: else
2467: MKNBP(*rp,NEXT(n));
2468: }
2469: }
2470:
1.115 noro 2471: void Pnbp_tm(NODE arg, NBP *rp)
2472: {
2473: NBP p;
2474: NODE n;
2475: NBM m;
2476:
2477: p = (NBP)ARG0(arg);
2478: if ( !p ) *rp = 0;
2479: else {
2480: for ( n = BDY(p); NEXT(n); n = NEXT(n) );
2481: m = (NBM)BDY(n);
2482: MKNODE(n,m,0);
2483: MKNBP(*rp,n);
2484: }
2485: }
2486:
2487: void Pnbp_tt(NODE arg, NBP *rp)
2488: {
2489: NBP p;
2490: NODE n;
2491: NBM m,m1;
2492:
2493: p = (NBP)ARG0(arg);
2494: if ( !p ) *rp = 0;
2495: else {
2496: for ( n = BDY(p); NEXT(n); n = NEXT(n) );
2497: m = (NBM)BDY(n);
2498: NEWNBM(m1);
2499: m1->d = m->d; m1->c = (P)ONE; m1->b = m->b;
2500: MKNODE(n,m1,0);
2501: MKNBP(*rp,n);
2502: }
2503: }
2504:
2505: void Pnbp_tc(NODE arg, P *rp)
2506: {
2507: NBP p;
2508: NBM m;
2509: NODE n;
2510:
2511: p = (NBP)ARG0(arg);
2512: if ( !p ) *rp = 0;
2513: else {
2514: for ( n = BDY(p); NEXT(n); n = NEXT(n) );
2515: m = (NBM)BDY(n);
2516: *rp = m->c;
2517: }
2518: }
2519:
2520: void Pnbp_trest(NODE arg, NBP *rp)
2521: {
2522: NBP p;
2523: NODE n,r,r0;
2524:
2525: p = (NBP)ARG0(arg);
2526: if ( !p ) *rp = 0;
2527: else {
2528: n = BDY(p);
2529: for ( r0 = 0; NEXT(n); n = NEXT(n) ) {
2530: NEXTNODE(r0,r);
2531: BDY(r) = (pointer)BDY(n);
2532: }
2533: if ( r0 ) {
2534: NEXT(r) = 0;
2535: MKNBP(*rp,r0);
2536: } else
2537: *rp = 0;
2538: }
2539: }
2540:
1.102 noro 2541: void Pnbm_deg(NODE arg, Q *rp)
1.100 noro 2542: {
2543: NBP p;
2544: NBM m;
1.102 noro 2545:
2546: p = (NBP)ARG0(arg);
2547: if ( !p )
2548: STOQ(-1,*rp);
2549: else {
2550: m = (NBM)BDY(BDY(p));
2551: STOQ(m->d,*rp);
2552: }
2553: }
2554:
1.118 noro 2555: void Pnbm_index(NODE arg, Q *rp)
2556: {
2557: NBP p;
2558: NBM m;
2559: unsigned int *b;
2560: int d,i,r;
2561:
2562: p = (NBP)ARG0(arg);
2563: if ( !p )
2564: STOQ(0,*rp);
2565: else {
2566: m = (NBM)BDY(BDY(p));
2567: d = m->d;
2568: if ( d > 32 )
2569: error("nbm_index : weight too large");
2570: b = m->b;
2571: for ( r = 0, i = d-2; i > 0; i-- )
2572: if ( !NBM_GET(b,i) ) r |= (1<<(d-2-i));
2573: STOQ(r,*rp);
2574: }
2575: }
2576:
1.102 noro 2577: void Pnbm_hp_rest(NODE arg, LIST *rp)
2578: {
2579: NBP p,h,r;
2580: NBM m,m1;
1.100 noro 2581: NODE n;
1.102 noro 2582: int *b,*b1;
2583: int d,d1,v,i,j,k;
1.100 noro 2584:
2585: p = (NBP)ARG0(arg);
1.102 noro 2586: if ( !p )
1.100 noro 2587: MKLIST(*rp,0);
1.102 noro 2588: else {
2589: m = (NBM)BDY(BDY(p));
2590: b = m->b; d = m->d;
1.100 noro 2591: if ( !d )
2592: MKLIST(*rp,0);
2593: else {
1.102 noro 2594: v = NBM_GET(b,0);
1.100 noro 2595: for ( i = 1; i < d; i++ )
1.102 noro 2596: if ( NBM_GET(b,i) != v ) break;
2597: NEWNBM(m1); NEWNBMBDY(m1,i);
1.115 noro 2598: b1 = m1->b; m1->d = i; m1->c = (P)ONE;
1.102 noro 2599: if ( v ) for ( j = 0; j < i; j++ ) NBM_SET(b1,j);
2600: else for ( j = 0; j < i; j++ ) NBM_CLR(b1,j);
2601: MKNODE(n,m1,0); MKNBP(h,n);
2602:
2603: d1 = d-i;
2604: NEWNBM(m1); NEWNBMBDY(m1,d1);
1.115 noro 2605: b1 = m1->b; m1->d = d1; m1->c = (P)ONE;
1.102 noro 2606: for ( j = 0, k = i; j < d1; j++, k++ )
2607: if ( NBM_GET(b,k) ) NBM_SET(b1,j);
2608: else NBM_CLR(b1,j);
2609: MKNODE(n,m1,0); MKNBP(r,n);
2610: n = mknode(2,h,r);
1.100 noro 2611: MKLIST(*rp,n);
2612: }
2613: }
2614: }
2615:
1.102 noro 2616: void Pnbm_hxky(NODE arg, LIST *rp)
2617: {
2618: NBP p;
2619:
2620: p = (NBP)ARG0(arg);
2621: if ( !p )
2622: *rp = 0;
2623: else
2624: separate_xky_nbm((NBM)BDY(BDY(p)),0,rp,0);
2625: }
2626:
2627: void Pnbm_xky_rest(NODE arg,NBP *rp)
1.100 noro 2628: {
2629: NBP p;
2630:
2631: p = (NBP)ARG0(arg);
2632: if ( !p )
2633: *rp = 0;
1.102 noro 2634: else
2635: separate_xky_nbm((NBM)BDY(BDY(p)),0,0,rp);
2636: }
2637:
2638: void Pnbm_hv(NODE arg, NBP *rp)
2639: {
2640: NBP p;
2641:
2642: p = (NBP)ARG0(arg);
2643: if ( !p )
2644: *rp = 0;
2645: else
2646: separate_nbm((NBM)BDY(BDY(p)),0,rp,0);
1.116 noro 2647: }
2648:
1.117 noro 2649: void Pnbm_rest(NODE arg, NBP *rp)
2650: {
2651: NBP p;
2652:
2653: p = (NBP)ARG0(arg);
2654: if ( !p )
2655: *rp = 0;
2656: else
2657: separate_nbm((NBM)BDY(BDY(p)),0,0,rp);
2658: }
2659:
1.116 noro 2660: void Pnbm_tv(NODE arg, NBP *rp)
2661: {
2662: NBP p;
2663:
2664: p = (NBP)ARG0(arg);
2665: if ( !p )
2666: *rp = 0;
1.117 noro 2667: else
2668: separate_tail_nbm((NBM)BDY(BDY(p)),0,0,rp);
1.102 noro 2669: }
2670:
1.117 noro 2671: void Pnbm_trest(NODE arg, NBP *rp)
1.102 noro 2672: {
2673: NBP p;
2674:
2675: p = (NBP)ARG0(arg);
2676: if ( !p )
2677: *rp = 0;
2678: else
1.117 noro 2679: separate_tail_nbm((NBM)BDY(BDY(p)),0,rp,0);
1.100 noro 2680: }
1.98 noro 2681:
2682: NBP fnode_to_nbp(FNODE f)
2683: {
2684: Q r;
2685: int n,i;
2686: NBM m;
2687: V v;
2688: NBP u,u1,u2;
2689: NODE t,b;
2690:
2691: if ( f->id == I_FORMULA ) {
2692: r = eval(f);
2693: NEWNBM(m);
2694: if ( OID(r) == O_N ) {
1.115 noro 2695: m->d = 0; m->c = (P)r; m->b = 0;
1.98 noro 2696: } else {
2697: v = VR((P)r);
1.115 noro 2698: m->d = 1; m->c = (P)ONE; NEWNBMBDY(m,1);
1.98 noro 2699: if ( !strcmp(NAME(v),"x") ) NBM_SET(m->b,0);
2700: else NBM_CLR(m->b,0);
2701: }
2702: MKNODE(b,m,0); MKNBP(u,b);
2703: return u;
2704: } else if ( IS_NARYADD(f) ) {
2705: t = (NODE)FA1(f); u = fnode_to_nbp((FNODE)BDY(t));
2706: for ( t = NEXT(t); t; t = NEXT(t) ) {
2707: u1 = fnode_to_nbp((FNODE)BDY(t));
2708: addnbp(CO,u,u1,&u2); u = u2;
2709: }
2710: return u;
2711: } else if ( IS_NARYMUL(f) ) {
2712: t = (NODE)FA1(f); u = fnode_to_nbp((FNODE)BDY(t));
2713: for ( t = NEXT(t); t; t = NEXT(t) ) {
2714: u1 = fnode_to_nbp((FNODE)BDY(t));
2715: mulnbp(CO,u,u1,&u2); u = u2;
2716: }
2717: return u;
2718: } else if ( IS_BINARYPWR(f) ) {
2719: u = fnode_to_nbp((FNODE)FA1(f));
2720: r = eval((FNODE)FA2(f));
2721: pwrnbp(CO,u,r,&u1);
2722: return u1;
1.70 noro 2723: }
2724: }
2725:
1.111 noro 2726: void Pnqt_weight(NODE arg,Q *rp)
2727: {
2728: QUOTE q;
2729: FNODE f;
2730: int w;
2731:
2732: q = (QUOTE)ARG0(arg); f = (FNODE)BDY(q);
2733: f = fnode_normalize(f,0);
1.112 noro 2734: w = nfnode_weight(qt_weight_tab,f);
1.111 noro 2735: STOQ(w,*rp);
2736: }
2737:
1.105 noro 2738: void Pnqt_comp(NODE arg,Q *rp)
1.80 noro 2739: {
1.87 noro 2740: QUOTE q1,q2;
1.80 noro 2741: FNODE f1,f2;
2742: int r;
2743:
1.87 noro 2744: q1 = (QUOTE)ARG0(arg); f1 = (FNODE)BDY(q1);
2745: q2 = (QUOTE)ARG1(arg); f2 = (FNODE)BDY(q2);
1.97 noro 2746: f1 = fnode_normalize(f1,0);
2747: f2 = fnode_normalize(f2,0);
1.95 noro 2748: r = nfnode_comp(f1,f2);
1.80 noro 2749: STOQ(r,*rp);
2750: }
2751:
1.108 noro 2752: int fnode_is_var(FNODE f)
2753: {
2754: Obj obj;
2755: VL vl,t,s;
2756: DCP dc;
2757:
2758: if ( fnode_is_coef(f) ) return 0;
2759: switch ( f->id ) {
2760: case I_PAREN:
2761: return fnode_is_var(FA0(f));
2762:
2763: case I_FORMULA:
2764: obj = FA0(f);
2765: if ( obj && OID(obj) == O_P ) {
2766: dc = DC((P)obj);
2767: if ( !cmpq(DEG(dc),ONE) && !NEXT(dc)
2768: && !arf_comp(CO,(Obj)COEF(dc),(Obj)ONE) ) return 1;
2769: else return 0;
2770: } else return 0;
2771:
2772: default:
2773: return 0;
2774: }
2775: }
2776:
2777: int fnode_is_coef(FNODE f)
2778: {
2779: Obj obj;
2780: VL vl,t,s;
2781:
2782: switch ( f->id ) {
2783: case I_MINUS: case I_PAREN:
2784: return fnode_is_coef(FA0(f));
2785:
2786: case I_FORMULA:
2787: obj = FA0(f);
2788: if ( !obj ) return 1;
2789: else if ( OID(obj) == O_QUOTE )
2790: return fnode_is_coef(BDY((QUOTE)obj));
2791: else if ( NUM(obj) ) return 1;
2792: else if ( OID(obj) == O_P || OID(obj) == O_R) {
2793: get_vars_recursive(obj,&vl);
2794: for ( t = vl; t; t = NEXT(t) ) {
1.111 noro 2795: if ( t->v->attr == (pointer)V_PF ) continue;
1.108 noro 2796: for ( s = qt_current_coef; s; s = NEXT(s) )
2797: if ( t->v == s->v ) break;
1.111 noro 2798: if ( !s )
2799: return 0;
1.108 noro 2800: }
2801: return 1;
2802: } else return 0;
2803:
2804: case I_BOP:
2805: return fnode_is_coef(FA1(f)) && fnode_is_coef(FA2(f));
2806:
2807: default:
2808: return 0;
2809: }
2810: }
2811:
2812: int fnode_is_number(FNODE f)
1.69 noro 2813: {
2814: Obj obj;
2815:
2816: switch ( f->id ) {
2817: case I_MINUS: case I_PAREN:
2818: return fnode_is_number(FA0(f));
2819:
2820: case I_FORMULA:
2821: obj = FA0(f);
2822: if ( !obj ) return 1;
2823: else if ( OID(obj) == O_QUOTE )
2824: return fnode_is_number(BDY((QUOTE)obj));
2825: else if ( NUM(obj) ) return 1;
2826: else return 0;
2827:
2828: case I_BOP:
2829: return fnode_is_number(FA1(f)) && fnode_is_number(FA2(f));
2830:
2831: default:
2832: return 0;
2833: }
2834: }
2835:
2836: int fnode_is_rational(FNODE f)
2837: {
2838: Obj obj;
2839:
2840: switch ( f->id ) {
2841: case I_MINUS: case I_PAREN:
2842: return fnode_is_number(FA0(f));
2843:
2844: case I_FORMULA:
2845: obj = FA0(f);
2846: if ( !obj ) return 1;
2847: else if ( OID(obj) == O_QUOTE )
2848: return fnode_is_rational(BDY((QUOTE)obj));
2849: else if ( NUM(obj) && RATN(obj) ) return 1;
2850: else return 0;
2851:
2852: case I_BOP:
2853: if ( !strcmp(((ARF)FA0(f))->name,"^") )
2854: return fnode_is_rational(FA1(f)) && fnode_is_integer(FA2(f));
2855: else
2856: return fnode_is_rational(FA1(f)) && fnode_is_rational(FA2(f));
2857:
2858: default:
2859: return 0;
2860: }
2861: }
2862:
2863: int fnode_is_integer(FNODE f)
2864: {
2865: Obj obj;
2866:
2867: switch ( f->id ) {
2868: case I_MINUS: case I_PAREN:
2869: return fnode_is_integer(FA0(f));
2870:
2871: case I_FORMULA:
2872: obj = FA0(f);
2873: if ( !obj ) return 1;
2874: else if ( OID(obj) == O_QUOTE )
2875: return fnode_is_integer(BDY((QUOTE)obj));
2876: else if ( INT(obj)) return 1;
2877: else return 0;
2878:
2879: case I_BOP:
1.70 noro 2880: switch ( ((ARF)FA0(f))->name[0] ) {
2881: case '^':
2882: return fnode_is_integer(FA1(f))
2883: && fnode_is_nonnegative_integer(FA2(f));
2884: case '/':
2885: return fnode_is_integer(FA1(f)) &&
2886: ( fnode_is_one(FA2(f)) || fnode_is_minusone(FA2(f)) );
2887: default:
2888: return fnode_is_integer(FA1(f)) && fnode_is_integer(FA2(f));
2889: }
2890: break;
2891:
1.69 noro 2892: default:
2893: return 0;
2894: }
2895: }
2896:
2897: int fnode_is_nonnegative_integer(FNODE f)
2898: {
2899: Q n;
2900:
2901: n = eval(f);
2902: if ( !n || (INT(n) && SGN(n) > 0) ) return 1;
2903: else return 0;
2904: }
2905:
2906: int fnode_is_one(FNODE f)
2907: {
2908: Q n;
2909:
2910: n = eval(f);
2911: if ( UNIQ(n) ) return 1;
2912: else return 0;
2913: }
2914:
2915: int fnode_is_minusone(FNODE f)
2916: {
2917: Q n;
2918:
2919: n = eval(f);
2920: if ( MUNIQ(n) ) return 1;
2921: else return 0;
2922: }
2923:
2924: int fnode_is_dependent(FNODE f,V v)
2925: {
2926: Obj obj;
2927: FNODE arg;
2928: NODE t;
2929:
2930: switch ( f->id ) {
2931: case I_MINUS: case I_PAREN:
2932: return fnode_is_dependent(FA0(f),v);
2933:
2934: case I_FORMULA:
2935: obj = FA0(f);
2936: if ( !obj ) return 0;
2937: else if ( OID(obj) == O_QUOTE )
2938: return fnode_is_dependent(BDY((QUOTE)obj),v);
2939: else if ( obj_is_dependent(obj,v) ) return 1;
2940: else return 0;
2941:
2942: case I_BOP:
2943: return fnode_is_dependent(FA1(f),v) || fnode_is_dependent(FA2(f),v);
2944:
2945: case I_FUNC:
2946: arg = (FNODE)FA1(f);
2947: for ( t = FA0(arg); t; t = NEXT(t) )
2948: if ( fnode_is_dependent(BDY(t),v) ) return 1;
2949: return 0;
2950:
2951: default:
2952: return 0;
2953: }
1.1 noro 2954: }
1.70 noro 2955:
1.72 noro 2956:
1.76 noro 2957: FNODE fnode_normalize(FNODE f,int expand)
1.70 noro 2958: {
1.73 noro 2959: FNODE a1,a2,mone,r,b2;
1.72 noro 2960: NODE n;
1.70 noro 2961: Q q;
2962:
1.103 noro 2963: if ( f->normalized && (f->expanded == expand) ) return f;
1.72 noro 2964: STOQ(-1,q);
2965: mone = mkfnode(1,I_FORMULA,q);
1.70 noro 2966: switch ( f->id ) {
2967: case I_PAREN:
1.89 noro 2968: r = fnode_normalize(FA0(f),expand);
2969: break;
1.71 noro 2970:
2971: case I_MINUS:
1.108 noro 2972: r = nfnode_mul_coef((Obj)q,
1.76 noro 2973: fnode_normalize(FA0(f),expand),expand);
1.89 noro 2974: break;
1.71 noro 2975:
1.70 noro 2976: case I_BOP:
2977: /* arf fnode fnode */
1.76 noro 2978: a1 = fnode_normalize(FA1(f),expand);
2979: a2 = fnode_normalize(FA2(f),expand);
1.72 noro 2980: switch ( OPNAME(f) ) {
2981: case '+':
1.95 noro 2982: r = nfnode_add(a1,a2,expand);
1.89 noro 2983: break;
1.70 noro 2984: case '-':
1.108 noro 2985: a2 = nfnode_mul_coef((Obj)q,a2,expand);
1.95 noro 2986: r = nfnode_add(a1,a2,expand);
1.89 noro 2987: break;
1.72 noro 2988: case '*':
1.95 noro 2989: r = nfnode_mul(a1,a2,expand);
1.89 noro 2990: break;
1.70 noro 2991: case '/':
1.95 noro 2992: a2 = nfnode_pwr(a2,mone,expand);
2993: r = nfnode_mul(a1,a2,expand);
1.89 noro 2994: break;
1.73 noro 2995: case '^':
1.95 noro 2996: r = nfnode_pwr(a1,a2,expand);
1.89 noro 2997: break;
1.70 noro 2998: default:
1.89 noro 2999: r = mkfnode(3,I_BOP,FA0(f),a1,a2);
3000: break;
1.70 noro 3001: }
3002: break;
1.71 noro 3003:
1.70 noro 3004: case I_NARYOP:
1.72 noro 3005: switch ( OPNAME(f) ) {
1.71 noro 3006: case '+':
1.73 noro 3007: n = (NODE)FA1(f);
1.76 noro 3008: r = fnode_normalize(BDY(n),expand); n = NEXT(n);
1.72 noro 3009: for ( ; n; n = NEXT(n) ) {
1.76 noro 3010: a1 = fnode_normalize(BDY(n),expand);
1.95 noro 3011: r = nfnode_add(r,a1,expand);
1.72 noro 3012: }
1.89 noro 3013: break;
1.70 noro 3014: case '*':
1.73 noro 3015: n = (NODE)FA1(f);
1.76 noro 3016: r = fnode_normalize(BDY(n),expand); n = NEXT(n);
1.72 noro 3017: for ( ; n; n = NEXT(n) ) {
1.76 noro 3018: a1 = fnode_normalize(BDY(n),expand);
1.95 noro 3019: r = nfnode_mul(r,a1,expand);
1.72 noro 3020: }
1.89 noro 3021: break;
1.70 noro 3022: default:
1.72 noro 3023: error("fnode_normallize : cannot happen");
1.70 noro 3024: }
1.89 noro 3025: break;
1.72 noro 3026:
1.70 noro 3027: default:
1.76 noro 3028: return fnode_apply(f,fnode_normalize,expand);
1.70 noro 3029: }
1.89 noro 3030: r->normalized = 1;
3031: r->expanded = expand;
3032: return r;
1.70 noro 3033: }
3034:
1.76 noro 3035: FNODE fnode_apply(FNODE f,FNODE (*func)(),int expand)
1.70 noro 3036: {
3037: fid_spec_p spec;
3038: FNODE r;
3039: int i,n;
3040: NODE t,t0,s;
3041:
3042: get_fid_spec(f->id,&spec);
3043: for ( n = 0; spec->type[n] != A_end; n++ );
3044: NEWFNODE(r,n); r->id = f->id;
3045: for ( i = 0; i < n; i++ ) {
3046: switch ( spec->type[i] ) {
3047: case A_fnode:
1.78 noro 3048: r->arg[i] = func(f->arg[i],expand);
1.70 noro 3049: break;
3050: case A_node:
3051: s = (NODE)f->arg[i];
3052: for ( t0 = 0; s; s = NEXT(s) ) {
3053: NEXTNODE(t0,t);
1.76 noro 3054: BDY(t) = (pointer)func((FNODE)BDY(s),expand);
1.70 noro 3055: }
3056: if ( t0 ) NEXT(t) = 0;
3057: r->arg[i] = t0;
3058: break;
3059: default:
3060: r->arg[i] = f->arg[i];
3061: break;
3062: }
3063: }
3064: return r;
3065: }
3066:
1.95 noro 3067: FNODE nfnode_add(FNODE f1,FNODE f2,int expand)
1.71 noro 3068: {
1.72 noro 3069: NODE n1,n2,r0,r;
3070: FNODE b1,b2;
3071: int s;
1.108 noro 3072: Obj c1,c2,c;
1.72 noro 3073:
1.77 noro 3074: if ( IS_ZERO(f1) ) return f2;
3075: else if ( IS_ZERO(f2) ) return f1;
1.75 noro 3076: f1 = to_naryadd(f1); f2 = to_naryadd(f2);
3077: n1 = (NODE)FA1(f1); n2 = (NODE)FA1(f2);
1.72 noro 3078: r0 = 0;
3079: while ( n1 && n2 ) {
1.75 noro 3080: fnode_coef_body(BDY(n1),&c1,&b1); fnode_coef_body(BDY(n2),&c2,&b2);
1.95 noro 3081: if ( (s = nfnode_comp(b1,b2)) > 0 ) {
1.73 noro 3082: NEXTNODE(r0,r); BDY(r) = BDY(n1); n1 = NEXT(n1);
1.72 noro 3083: } else if ( s < 0 ) {
1.73 noro 3084: NEXTNODE(r0,r); BDY(r) = BDY(n2); n2 = NEXT(n2);
1.72 noro 3085: } else {
1.108 noro 3086: arf_add(CO,c1,c2,&c);
1.72 noro 3087: if ( c ) {
1.95 noro 3088: NEXTNODE(r0,r); BDY(r) = nfnode_mul_coef(c,b1,expand);
1.71 noro 3089: }
1.72 noro 3090: n1 = NEXT(n1); n2 = NEXT(n2);
1.71 noro 3091: }
3092: }
1.72 noro 3093: if ( n1 )
3094: if ( r0 ) NEXT(r) = n1;
3095: else r0 = n1;
3096: else if ( n2 )
3097: if ( r0 ) NEXT(r) = n2;
3098: else r0 = n2;
3099: else if ( r0 )
3100: NEXT(r) = 0;
3101:
1.106 noro 3102: return fnode_node_to_nary(addfs,r0);
1.75 noro 3103: }
3104:
1.106 noro 3105: FNODE fnode_node_to_nary(ARF op,NODE n)
1.75 noro 3106: {
1.106 noro 3107: if ( !n ) {
3108: if ( op->name[0] == '+' )
1.122 noro 3109: return mkfnode(1,I_FORMULA,NULLP);
1.106 noro 3110: else
3111: return mkfnode(1,I_FORMULA,ONE);
3112: } else if ( !NEXT(n) ) return BDY(n);
3113: else return mkfnode(2,I_NARYOP,op,n);
1.71 noro 3114: }
3115:
1.95 noro 3116: FNODE nfnode_mul(FNODE f1,FNODE f2,int expand)
1.71 noro 3117: {
1.72 noro 3118: NODE n1,n2,r0,r,r1;
1.76 noro 3119: FNODE b1,b2,e1,e2,cc,t,t1;
1.72 noro 3120: FNODE *m;
3121: int s;
1.109 noro 3122: Obj c1,c2,c,e;
1.75 noro 3123: int l1,l,i,j;
1.72 noro 3124:
1.122 noro 3125: if ( IS_ZERO(f1) || IS_ZERO(f2) ) return mkfnode(1,I_FORMULA,NULLP);
1.108 noro 3126: else if ( fnode_is_coef(f1) )
3127: return nfnode_mul_coef((Obj)eval(f1),f2,expand);
3128: else if ( fnode_is_coef(f2) )
3129: return nfnode_mul_coef((Obj)eval(f2),f1,expand);
1.76 noro 3130:
3131: if ( expand && IS_NARYADD(f1) ) {
1.122 noro 3132: t = mkfnode(1,I_FORMULA,NULLP);
1.76 noro 3133: for ( n1 = (NODE)FA1(f1); n1; n1 = NEXT(n1) ) {
1.95 noro 3134: t1 = nfnode_mul(BDY(n1),f2,expand);
3135: t = nfnode_add(t,t1,expand);
1.76 noro 3136: }
3137: return t;
3138: }
3139: if ( expand && IS_NARYADD(f2) ) {
1.122 noro 3140: t = mkfnode(1,I_FORMULA,NULLP);
1.76 noro 3141: for ( n2 = (NODE)FA1(f2); n2; n2 = NEXT(n2) ) {
1.95 noro 3142: t1 = nfnode_mul(f1,BDY(n2),expand);
3143: t = nfnode_add(t,t1,expand);
1.76 noro 3144: }
3145: return t;
3146: }
1.72 noro 3147:
1.75 noro 3148: fnode_coef_body(f1,&c1,&b1); fnode_coef_body(f2,&c2,&b2);
1.108 noro 3149: arf_mul(CO,c1,c2,&c);
1.122 noro 3150: if ( !c ) return mkfnode(1,I_FORMULA,NULLP);
1.71 noro 3151:
1.76 noro 3152:
1.75 noro 3153: n1 = (NODE)FA1(to_narymul(b1)); n2 = (NODE)FA1(to_narymul(b2));
3154: l1 = length(n1); l = l1+length(n2);
1.72 noro 3155: m = (FNODE *)ALLOCA(l*sizeof(FNODE));
3156: for ( r = n1, i = 0; i < l1; r = NEXT(r), i++ ) m[i] = BDY(r);
3157: for ( r = n2; r; r = NEXT(r) ) {
1.113 noro 3158: if ( i == 0 )
1.72 noro 3159: m[i++] = BDY(r);
3160: else {
1.75 noro 3161: fnode_base_exp(m[i-1],&b1,&e1); fnode_base_exp(BDY(r),&b2,&e2);
3162: if ( compfnode(b1,b2) ) break;
1.109 noro 3163: arf_add(CO,eval(e1),eval(e2),&e);
1.75 noro 3164: if ( !e ) i--;
1.113 noro 3165: else if ( expand == 2 ) {
3166: if ( INT(e) && SGN((Q)e) < 0 ) {
3167: t1 = mkfnode(3,I_BOP,pwrfs,b1,mkfnode(1,I_FORMULA,e));
3168: /* r=(r0|rest)->(r0,t1|rest) */
3169: t = BDY(r);
3170: MKNODE(r1,t1,NEXT(r));
3171: MKNODE(r,t,r1);
3172: i--;
3173: } else
3174: m[i++] = BDY(r);
3175: } else if ( UNIQ(e) )
1.75 noro 3176: m[i-1] = b1;
3177: else
3178: m[i-1] = mkfnode(3,I_BOP,pwrfs,b1,mkfnode(1,I_FORMULA,e));
1.71 noro 3179: }
3180: }
1.75 noro 3181: for ( j = i-1; j >= 0; j-- ) {
3182: MKNODE(r1,m[j],r); r = r1;
3183: }
3184: if ( !UNIQ(c) ) {
3185: cc = mkfnode(1,I_FORMULA,c); MKNODE(r1,cc,r); r = r1;
1.72 noro 3186: }
1.106 noro 3187: return fnode_node_to_nary(mulfs,r);
1.73 noro 3188: }
3189:
1.95 noro 3190: FNODE nfnode_pwr(FNODE f1,FNODE f2,int expand)
1.73 noro 3191: {
1.89 noro 3192: FNODE b,b1,e1,e,cc,r,mf2,mone,inv;
1.108 noro 3193: Obj c,c1;
3194: Num nf2;
1.89 noro 3195: int ee;
3196: NODE arg,n,t0,t1;
1.76 noro 3197: Q q;
1.73 noro 3198:
1.77 noro 3199: if ( IS_ZERO(f2) ) return mkfnode(1,I_FORMULA,ONE);
1.122 noro 3200: else if ( IS_ZERO(f1) ) return mkfnode(1,I_FORMULA,NULLP);
1.108 noro 3201: else if ( fnode_is_coef(f1) ) {
1.73 noro 3202: if ( fnode_is_integer(f2) ) {
1.92 noro 3203: if ( fnode_is_one(f2) ) return f1;
3204: else {
1.108 noro 3205: arf_pwr(CO,eval(f1),(Obj)eval(f2),&c);
1.92 noro 3206: return mkfnode(1,I_FORMULA,c);
3207: }
1.108 noro 3208: } else {
3209: f1 = mkfnode(1,I_FORMULA,eval(f1));
1.73 noro 3210: return mkfnode(3,I_BOP,pwrfs,f1,f2);
1.108 noro 3211: }
1.92 noro 3212: } else if ( IS_BINARYPWR(f1) ) {
1.73 noro 3213: b1 = FA1(f1); e1 = FA2(f1);
1.95 noro 3214: e = nfnode_mul(e1,f2,expand);
1.73 noro 3215: if ( fnode_is_one(e) )
3216: return b1;
3217: else
3218: return mkfnode(3,I_BOP,FA0(f1),b1,e);
1.92 noro 3219: } else if ( expand && IS_NARYMUL(f1) && fnode_is_number(f2)
3220: && fnode_is_integer(f2) ) {
1.73 noro 3221: fnode_coef_body(f1,&c1,&b1);
1.89 noro 3222: nf2 = (Num)eval(f2);
1.108 noro 3223: arf_pwr(CO,c1,(Obj)nf2,&c);
1.89 noro 3224: ee = QTOS((Q)nf2);
1.75 noro 3225: cc = mkfnode(1,I_FORMULA,c);
1.89 noro 3226: if ( fnode_is_nonnegative_integer(f2) )
1.103 noro 3227: b = fnode_expand_pwr(b1,ee,expand);
1.89 noro 3228: else {
3229: STOQ(-1,q);
3230: mone = mkfnode(1,I_FORMULA,q);
1.92 noro 3231: b1 = to_narymul(b1);
1.89 noro 3232: for ( t0 = 0, n = (NODE)FA1(b1); n; n = NEXT(n) ) {
3233: inv = mkfnode(3,I_BOP,pwrfs,BDY(n),mone);
3234: MKNODE(t1,inv,t0); t0 = t1;
3235: }
1.106 noro 3236: b1 = fnode_node_to_nary(mulfs,t0);
1.103 noro 3237: b = fnode_expand_pwr(b1,-ee,expand);
1.89 noro 3238: }
1.75 noro 3239: if ( fnode_is_one(cc) )
3240: return b;
3241: else
1.106 noro 3242: return fnode_node_to_nary(mulfs,mknode(2,cc,b));
1.82 noro 3243: } else if ( expand && fnode_is_integer(f2)
3244: && fnode_is_nonnegative_integer(f2) ) {
1.76 noro 3245: q = (Q)eval(f2);
1.95 noro 3246: if ( PL(NM(q)) > 1 ) error("nfnode_pwr : exponent too large");
1.103 noro 3247: return fnode_expand_pwr(f1,QTOS(q),expand);
1.73 noro 3248: } else
3249: return mkfnode(3,I_BOP,pwrfs,f1,f2);
1.72 noro 3250: }
3251:
1.103 noro 3252: FNODE fnode_expand_pwr(FNODE f,int n,int expand)
1.76 noro 3253: {
1.103 noro 3254: int n1,i;
3255: FNODE f1,f2,fn;
3256: Q q;
1.76 noro 3257:
3258: if ( !n ) return mkfnode(1,I_FORMULA,ONE);
1.122 noro 3259: else if ( IS_ZERO(f) ) return mkfnode(1,I_FORMULA,NULLP);
1.76 noro 3260: else if ( n == 1 ) return f;
3261: else {
1.103 noro 3262: switch ( expand ) {
3263: case 1:
3264: n1 = n/2;
3265: f1 = fnode_expand_pwr(f,n1,expand);
3266: f2 = nfnode_mul(f1,f1,expand);
3267: if ( n%2 ) f2 = nfnode_mul(f2,f,1);
3268: return f2;
3269: case 2:
3270: for ( i = 1, f1 = f; i < n; i++ )
3271: f1 = nfnode_mul(f1,f,expand);
3272: return f1;
3273: case 0: default:
3274: STOQ(n,q);
3275: fn = mkfnode(1,I_FORMULA,q);
3276: return mkfnode(3,I_BOP,pwrfs,f,fn);
3277: }
1.76 noro 3278: }
3279: }
3280:
1.72 noro 3281: /* f = b^e */
3282: void fnode_base_exp(FNODE f,FNODE *bp,FNODE *ep)
3283: {
1.75 noro 3284: if ( IS_BINARYPWR(f) ) {
1.72 noro 3285: *bp = FA1(f); *ep = FA2(f);
3286: } else {
3287: *bp = f; *ep = mkfnode(1,I_FORMULA,ONE);
3288: }
3289: }
3290:
3291: FNODE to_naryadd(FNODE f)
3292: {
3293: FNODE r;
3294: NODE n;
3295:
1.75 noro 3296: if ( IS_NARYADD(f) ) return f;
3297:
3298: NEWFNODE(r,2); r->id = I_NARYOP;
3299: FA0(r) = addfs; MKNODE(n,f,0); FA1(r) = n;
1.72 noro 3300: return r;
3301: }
3302:
3303: FNODE to_narymul(FNODE f)
3304: {
3305: FNODE r;
3306: NODE n;
3307:
1.75 noro 3308: if ( IS_NARYMUL(f) ) return f;
3309:
3310: NEWFNODE(r,2); r->id = I_NARYOP;
3311: FA0(r) = mulfs; MKNODE(n,f,0); FA1(r) = n;
1.72 noro 3312: return r;
3313: }
3314:
1.108 noro 3315: FNODE nfnode_mul_coef(Obj c,FNODE f,int expand)
1.72 noro 3316: {
1.76 noro 3317: FNODE b1,cc;
1.108 noro 3318: Obj c1,c2;
1.76 noro 3319: NODE n,r,r0;
1.72 noro 3320:
3321: if ( !c )
1.122 noro 3322: return mkfnode(1,I_FORMULA,NULLP);
1.75 noro 3323: else {
3324: fnode_coef_body(f,&c1,&b1);
1.108 noro 3325: arf_mul(CO,c,c1,&c2);
1.75 noro 3326: if ( UNIQ(c2) ) return b1;
3327: else {
3328: cc = mkfnode(1,I_FORMULA,c2);
3329: if ( fnode_is_number(b1) ) {
3330: if ( !fnode_is_one(b1) )
1.95 noro 3331: error("nfnode_mul_coef : cannot happen");
1.75 noro 3332: else
3333: return cc;
1.76 noro 3334: } else if ( IS_NARYMUL(b1) ) {
1.75 noro 3335: MKNODE(n,cc,FA1(b1));
1.106 noro 3336: return fnode_node_to_nary(mulfs,n);
1.76 noro 3337: } else if ( expand && IS_NARYADD(b1) ) {
3338: for ( r0 = 0, n = (NODE)FA1(b1); n; n = NEXT(n) ) {
3339: NEXTNODE(r0,r);
1.95 noro 3340: BDY(r) = nfnode_mul_coef(c2,BDY(n),expand);
1.76 noro 3341: }
3342: if ( r0 ) NEXT(r) = 0;
1.106 noro 3343: return fnode_node_to_nary(addfs,r0);
1.76 noro 3344: } else
1.106 noro 3345: return fnode_node_to_nary(mulfs,mknode(2,cc,b1));
1.72 noro 3346: }
1.71 noro 3347: }
3348: }
3349:
1.108 noro 3350: void fnode_coef_body(FNODE f,Obj *cp,FNODE *bp)
1.70 noro 3351: {
1.72 noro 3352: FNODE c;
1.70 noro 3353:
1.108 noro 3354: if ( fnode_is_coef(f) ) {
3355: *cp = (Obj)eval(f); *bp = mkfnode(1,I_FORMULA,ONE);
1.75 noro 3356: } else if ( IS_NARYMUL(f) ) {
3357: c=(FNODE)BDY((NODE)FA1(f));
1.108 noro 3358: if ( fnode_is_coef(c) ) {
3359: *cp = (Obj)eval(c);
1.106 noro 3360: *bp = fnode_node_to_nary(mulfs,NEXT((NODE)FA1(f)));
1.70 noro 3361: } else {
1.108 noro 3362: *cp = (Obj)ONE; *bp = f;
1.70 noro 3363: }
3364: } else {
1.108 noro 3365: *cp = (Obj)ONE; *bp = f;
1.70 noro 3366: }
1.80 noro 3367: }
3368:
1.109 noro 3369: int nfnode_weight(struct wtab *tab,FNODE f)
3370: {
3371: NODE n;
3372: int w,w1;
3373: int i;
3374: Q a2;
3375: V v;
3376:
3377: switch ( f->id ) {
3378: case I_FORMULA:
3379: if ( fnode_is_coef(f) ) return 0;
3380: else if ( fnode_is_var(f) ) {
1.113 noro 3381: if ( !tab ) return 0;
1.109 noro 3382: v = VR((P)FA0(f));
3383: for ( i = 0; tab[i].v; i++ )
3384: if ( v == tab[i].v ) return tab[i].w;
1.113 noro 3385: return 0;
1.109 noro 3386: } else return 0;
3387:
3388: /* XXX */
3389: case I_PVAR: return 1;
3390: /* XXX */
3391: case I_FUNC: I_FUNC: I_FUNC_QARG:
3392: /* w(f) = 1 */
3393: /* w(f(a1,...,an)=w(a1)+...+w(an) */
3394: n = FA0((FNODE)FA1(f));
3395: for ( w = 0; n; n = NEXT(n) )
3396: w += nfnode_weight(tab,BDY(n));
3397: return w;
3398: case I_NARYOP:
3399: n = (NODE)FA1(f);
3400: if ( IS_NARYADD(f) )
3401: for ( w = nfnode_weight(tab,BDY(n)),
3402: n = NEXT(n); n; n = NEXT(n) ) {
3403: w1 = nfnode_weight(tab,BDY(n));
3404: w = MAX(w,w1);
3405: }
3406: else
3407: for ( w = 0; n; n = NEXT(n) )
3408: w += nfnode_weight(tab,BDY(n));
3409: return w;
3410: case I_BOP:
3411: /* must be binary power */
3412: /* XXX w(2^x)=0 ? */
3413: if ( fnode_is_rational(FA2(f)) ) {
3414: a2 = (Q)eval(FA2(f));
3415: w = QTOS(a2);
3416: } else
3417: w = nfnode_weight(tab,FA2(f));
3418: return nfnode_weight(tab,FA1(f))*w;
3419: default:
3420: error("nfnode_weight : not_implemented");
3421: }
3422: }
3423:
1.95 noro 3424: int nfnode_comp(FNODE f1,FNODE f2)
1.80 noro 3425: {
1.109 noro 3426: int w1,w2;
3427:
3428: if ( qt_weight_tab ) {
3429: w1 = nfnode_weight(qt_weight_tab,f1);
3430: w2 = nfnode_weight(qt_weight_tab,f2);
3431: if ( w1 > w2 ) return 1;
3432: if ( w1 < w2 ) return -1;
3433: }
1.110 noro 3434: return nfnode_comp_lex(f1,f2);
3435: }
3436:
3437: int nfnode_comp_lex(FNODE f1,FNODE f2)
3438: {
3439: NODE n1,n2;
3440: int r,i1,i2,ret;
3441: char *nm1,*nm2;
1.114 noro 3442: FNODE b1,b2,e1,e2,g,a1,a2,fn1,fn2,h1,h2;
1.110 noro 3443: Num ee,ee1;
3444: Obj c1,c2;
3445: int w1,w2;
1.80 noro 3446:
3447: if ( IS_NARYADD(f1) || IS_NARYADD(f2) ) {
3448: f1 = to_naryadd(f1); f2 = to_naryadd(f2);
3449: n1 = (NODE)FA1(f1); n2 = (NODE)FA1(f2);
1.114 noro 3450: for ( ; n1 && n2; n1 = NEXT(n1), n2 = NEXT(n2) ) {
3451: r = nfnode_comp_lex(BDY(n1),BDY(n2));
3452: if ( r ) return r;
3453: }
3454: if ( !n1 && !n2 ) return 0;
1.122 noro 3455: h1 = n1 ? (FNODE)BDY(n1) : mkfnode(1,I_FORMULA,NULLP);
3456: h2 = n2 ? (FNODE)BDY(n2) : mkfnode(1,I_FORMULA,NULLP);
1.114 noro 3457: return nfnode_comp_lex(h1,h2);
1.80 noro 3458: }
3459: if ( IS_NARYMUL(f1) || IS_NARYMUL(f2) ) {
1.83 noro 3460: fnode_coef_body(f1,&c1,&b1);
3461: fnode_coef_body(f2,&c2,&b2);
1.108 noro 3462: if ( !compfnode(b1,b2) ) return arf_comp(CO,c1,c2);
1.83 noro 3463: b1 = to_narymul(b1); b2 = to_narymul(b2);
3464: n1 = (NODE)FA1(b1); n2 = (NODE)FA1(b2);
1.114 noro 3465: for ( ; n1 && n2; n1 = NEXT(n1), n2 = NEXT(n2) ) {
3466: r = nfnode_comp_lex(BDY(n1),BDY(n2));
3467: if ( r ) return r;
3468: }
3469: if ( !n1 && !n2 ) return 0;
3470: h1 = n1 ? (FNODE)BDY(n1) : mkfnode(1,I_FORMULA,ONE);
3471: h2 = n2 ? (FNODE)BDY(n2) : mkfnode(1,I_FORMULA,ONE);
3472: return nfnode_comp_lex(h1,h2);
1.80 noro 3473: }
1.110 noro 3474: if ( IS_BINARYPWR(f1) || IS_BINARYPWR(f2) ) {
3475: fnode_base_exp(f1,&b1,&e1);
3476: fnode_base_exp(f2,&b2,&e2);
3477: if ( r = nfnode_comp_lex(b1,b2) ) {
3478: if ( r > 0 )
1.122 noro 3479: return nfnode_comp_lex(e1,mkfnode(1,I_FORMULA,NULLP));
1.110 noro 3480: else if ( r < 0 )
1.122 noro 3481: return nfnode_comp_lex(mkfnode(1,I_FORMULA,NULLP),e2);
1.110 noro 3482: } else return nfnode_comp_lex(e1,e2);
3483: }
1.80 noro 3484:
1.95 noro 3485: /* now, IDs of f1 and f2 must be I_FORMULA, I_FUNC, I_IFUNC or I_PVAR */
1.106 noro 3486: /* I_IFUNC > I_PVAR > I_FUNC=I_FUNC_QARG > I_FORMULA */
1.80 noro 3487: switch ( f1->id ) {
3488: case I_FORMULA:
3489: switch ( f2->id ) {
3490: case I_FORMULA:
1.105 noro 3491: return arf_comp(qt_current_ord?qt_current_ord:CO,FA0(f1),FA0(f2));
1.95 noro 3492: case I_FUNC: case I_IFUNC: case I_PVAR:
1.80 noro 3493: return -1;
3494: default:
1.110 noro 3495: error("nfnode_comp_lex : undefined");
1.80 noro 3496: }
3497: break;
1.106 noro 3498: case I_FUNC: case I_FUNC_QARG:
1.80 noro 3499: switch ( f2->id ) {
3500: case I_FORMULA:
3501: return 1;
1.95 noro 3502: case I_PVAR: case I_IFUNC:
3503: return -1;
1.106 noro 3504: case I_FUNC: case I_FUNC_QARG:
1.82 noro 3505: nm1 = ((FUNC)FA0(f1))->name; nm2 = ((FUNC)FA0(f2))->name;
3506: r = strcmp(nm1,nm2);
3507: if ( r > 0 ) return 1;
3508: else if ( r < 0 ) return -1;
1.80 noro 3509: else {
3510: /* compare args */
3511: n1 = FA0((FNODE)FA1(f1)); n2 = FA0((FNODE)FA1(f2));
3512: while ( n1 && n2 )
1.110 noro 3513: if ( r = nfnode_comp_lex(BDY(n1),BDY(n2)) ) return r;
1.82 noro 3514: else {
3515: n1 = NEXT(n1); n2 = NEXT(n2);
3516: }
1.85 noro 3517: return n1?1:(n2?-1:0);
1.80 noro 3518: }
3519: break;
3520: default:
1.110 noro 3521: error("nfnode_comp_lex : undefined");
1.80 noro 3522: }
3523: case I_PVAR:
3524: switch ( f2->id ) {
1.106 noro 3525: case I_FORMULA: case I_FUNC: case I_FUNC_QARG:
1.80 noro 3526: return 1;
1.95 noro 3527: case I_IFUNC:
3528: return -1;
1.80 noro 3529: case I_PVAR:
3530: i1 = (int)FA0(f1); i2 = (int)FA0(f2);
3531: if ( i1 > i2 ) return 1;
3532: else if ( i1 < i2 ) return -1;
3533: else return 0;
3534: default:
1.110 noro 3535: error("nfnode_comp_lex : undefined");
1.95 noro 3536: }
3537: break;
3538: case I_IFUNC:
3539: switch ( f2->id ) {
1.106 noro 3540: case I_FORMULA: case I_FUNC: case I_FUNC_QARG: case I_PVAR:
1.95 noro 3541: return 1;
3542: case I_IFUNC:
3543: i1 = (int)FA0((FNODE)FA0(f1));
3544: i2 = (int)FA0((FNODE)FA0(f2));
3545: if ( i1 > i2 ) return 1;
3546: else if ( i1 < i2 ) return -1;
3547: else {
3548: /* compare args */
3549: n1 = FA0((FNODE)FA1(f1)); n2 = FA0((FNODE)FA1(f2));
3550: while ( n1 && n2 )
1.110 noro 3551: if ( r = nfnode_comp_lex(BDY(n1),BDY(n2)) ) return r;
1.95 noro 3552: else {
3553: n1 = NEXT(n1); n2 = NEXT(n2);
3554: }
3555: return n1?1:(n2?-1:0);
3556: }
3557: break;
3558:
3559: default:
1.110 noro 3560: error("nfnode_comp_lex : undefined");
1.80 noro 3561: }
3562: break;
3563: default:
1.110 noro 3564: error("nfnode_comp_lex : undefined");
1.80 noro 3565: }
1.70 noro 3566: }
1.87 noro 3567:
1.88 noro 3568: NODE append_node(NODE a1,NODE a2)
3569: {
3570: NODE t,t0;
3571:
3572: if ( !a1 )
3573: return a2;
3574: else {
3575: for ( t0 = 0; a1; a1 = NEXT(a1) ) {
3576: NEXTNODE(t0,t); BDY(t) = BDY(a1);
3577: }
3578: NEXT(t) = a2;
3579: return t0;
3580: }
3581: }
3582:
1.95 noro 3583: int nfnode_match(FNODE f,FNODE pat,NODE *rp)
1.87 noro 3584: {
3585: NODE m,m1,m2,base,exp,fa,pa,n;
3586: LIST l;
3587: QUOTE qp,qf;
1.96 noro 3588: FNODE fbase,fexp,a,fh;
1.87 noro 3589: FUNC ff,pf;
3590: int r;
3591:
1.97 noro 3592: if ( !pat )
3593: if ( !f ) {
3594: *rp = 0;
3595: return 1;
3596: } else
3597: return 0;
3598: else if ( !f )
3599: return 0;
1.87 noro 3600: switch ( pat->id ) {
3601: case I_PVAR:
3602: /* [[pat,f]] */
1.103 noro 3603: *rp = mknode(1,mknode(2,(int)FA0(pat),f));
1.87 noro 3604: return 1;
3605:
3606: case I_FORMULA:
1.93 noro 3607: if ( f->id == I_FORMULA && !arf_comp(CO,(Obj)FA0(f),(Obj)FA0(pat)) ) {
1.87 noro 3608: *rp = 0; return 1;
3609: } else
3610: return 0;
3611:
3612: case I_BOP:
3613: /* OPNAME should be "^" */
3614: if ( !IS_BINARYPWR(pat) )
1.95 noro 3615: error("nfnode_match : invalid BOP");
1.87 noro 3616: if ( IS_BINARYPWR(f) ) {
3617: fbase = FA1(f); fexp = FA2(f);
3618: } else {
3619: fbase = f; fexp = mkfnode(1,I_FORMULA,ONE);
3620: }
1.95 noro 3621: if ( !nfnode_match(fbase,FA1(pat),&base) ) return 0;
1.106 noro 3622: a = rewrite_fnode(FA2(pat),base,0);
1.95 noro 3623: if ( !nfnode_match(fexp,a,&exp) ) return 0;
1.88 noro 3624: else {
3625: *rp = append_node(base,exp);
3626: return 1;
3627: }
1.87 noro 3628: break;
3629:
1.95 noro 3630: case I_FUNC: case I_IFUNC:
1.87 noro 3631: if ( f->id != I_FUNC ) return 0;
1.95 noro 3632: ff = (FUNC)FA0(f);
3633: if ( pat->id == I_FUNC ) {
3634: pf = (FUNC)FA0(pat);
3635: if ( strcmp(ff->fullname,pf->fullname) ) return 0;
3636: m = 0;
3637: } else {
1.96 noro 3638: /* XXX : I_FUNC_HEAD is a dummy id to pass FUNC */
3639: fh = mkfnode(1,I_FUNC_HEAD,FA0(f));
1.122 noro 3640: m = mknode(1,mknode(2,FA0((FNODE)FA0(pat)),fh),NULLP);
1.95 noro 3641: }
1.87 noro 3642: /* FA1(f) and FA1(pat) are I_LIST */
3643: fa = (NODE)FA0((FNODE)FA1(f));
3644: pa = (NODE)FA0((FNODE)FA1(pat));
3645: while ( fa && pa ) {
1.106 noro 3646: a = rewrite_fnode(BDY(pa),m,0);
1.95 noro 3647: if ( !nfnode_match(BDY(fa),a,&m1) ) return 0;
1.88 noro 3648: m = append_node(m1,m);
3649: fa = NEXT(fa); pa = NEXT(pa);
1.87 noro 3650: }
3651: if ( fa || pa ) return 0;
3652: else {
3653: *rp = m;
3654: return 1;
3655: }
3656:
3657: case I_NARYOP:
3658: if ( IS_NARYADD(pat) )
1.95 noro 3659: return nfnode_match_naryadd(f,pat,rp);
1.87 noro 3660: else if ( IS_NARYMUL(pat) )
1.95 noro 3661: return nfnode_match_narymul(f,pat,rp);
1.87 noro 3662: else
1.95 noro 3663: error("nfnode_match : invalid NARYOP");
1.87 noro 3664: break;
3665:
3666: default:
1.95 noro 3667: error("nfnode_match : invalid pattern");
1.87 noro 3668: }
3669: }
3670:
1.88 noro 3671: /* remove i-th element */
1.87 noro 3672:
1.88 noro 3673: FNODE fnode_removeith_naryadd(FNODE p,int i)
3674: {
3675: int k,l;
3676: NODE t,r0,r,a;
3677:
3678: a = (NODE)FA1(p);
3679: l = length(a);
3680: if ( i < 0 || i >= l ) error("fnode_removeith_naryadd: invalid index");
3681: else if ( i == 0 )
1.106 noro 3682: return fnode_node_to_nary(addfs,NEXT(a));
1.88 noro 3683: else {
3684: for ( r0 = 0, k = 0, t = a; k < i; k++, t = NEXT(t) ) {
3685: NEXTNODE(r0,r);
3686: BDY(r) = BDY(t);
3687: }
1.94 noro 3688: NEXT(r) = NEXT(t);
1.106 noro 3689: return fnode_node_to_nary(addfs,r0);
1.88 noro 3690: }
3691:
3692: }
1.87 noro 3693:
1.88 noro 3694: /* a0,...,a(i-1) */
3695: FNODE fnode_left_narymul(FNODE p,int i)
1.87 noro 3696: {
1.88 noro 3697: int k,l;
3698: NODE t,r0,r,a;
3699:
3700: a = (NODE)FA1(p);
3701: l = length(a);
3702: if ( i < 0 || i >= l ) error("fnode_left_narymul : invalid index");
1.97 noro 3703: if ( i == 0 ) return 0;
1.88 noro 3704: else if ( i == 1 ) return (FNODE)BDY(a);
3705: else {
3706: for ( r0 = 0, k = 0, t = a; k < i; k++, t = NEXT(t) ) {
3707: NEXTNODE(r0,r);
3708: BDY(r) = BDY(t);
3709: }
3710: NEXT(r) = 0;
1.106 noro 3711: return fnode_node_to_nary(mulfs,r0);
1.88 noro 3712: }
3713: }
3714:
3715: /* a(i+1),...,a(l-1) */
3716: FNODE fnode_right_narymul(FNODE p,int i)
3717: {
3718: NODE a,t;
3719: int l,k;
3720:
3721: a = (NODE)FA1(p);
3722: l = length(a);
3723: if ( i < 0 || i >= l ) error("fnode_right_narymul : invalid index");
1.97 noro 3724: if ( i == l-1 ) return 0;
1.88 noro 3725: else {
3726: for ( k = 0, t = a; k <= i; k++, t = NEXT(t) );
1.106 noro 3727: return fnode_node_to_nary(mulfs,t);
1.88 noro 3728: }
3729: }
3730:
1.95 noro 3731: int nfnode_match_naryadd(FNODE f,FNODE p,NODE *rp)
1.88 noro 3732: {
3733: int fl,pl,fi,pi;
3734: NODE fa,pa,t,s,m,m1;
3735: FNODE fr,pr,prr,pivot;
1.87 noro 3736:
3737: f = to_naryadd(f);
1.88 noro 3738: fa = (NODE)FA1(f); fl = length(fa);
3739: pa = (NODE)FA1(p); pl = length(pa);
3740: if ( fl < pl ) return 0;
3741: else if ( pl == 1 ) {
3742: if ( fl == 1 )
1.95 noro 3743: return nfnode_match(BDY(fa),BDY(pa),rp);
1.87 noro 3744: else
3745: return 0;
3746: } else {
1.88 noro 3747: for ( t = pa, pi = 0; t; t = NEXT(t), pi++ )
3748: if ( ((FNODE)BDY(t))->id != I_PVAR ) break;
3749: if ( !t ) {
3750: /* all are I_PVAR */
3751: m = 0;
3752: for ( t = pa, s = fa; NEXT(t); t = NEXT(t), s = NEXT(s) ) {
1.95 noro 3753: nfnode_match(BDY(s),BDY(t),&m1);
1.88 noro 3754: m = append_node(m1,m);
3755: }
3756: if ( !NEXT(s) )
3757: fr = (FNODE)BDY(s);
3758: else
3759: fr = mkfnode(2,I_NARYOP,FA0(f),s);
1.95 noro 3760: nfnode_match(fr,BDY(t),&m1);
1.88 noro 3761: *rp = append_node(m1,m);
3762: return 1;
3763: } else {
3764: pivot = (FNODE)BDY(t);
3765: pr = fnode_removeith_naryadd(p,pi);
3766: for ( s = fa, fi = 0; s; s = NEXT(s), fi++ ) {
1.95 noro 3767: if ( nfnode_match(BDY(s),pivot,&m) ) {
1.88 noro 3768: fr = fnode_removeith_naryadd(f,fi);
1.106 noro 3769: prr = rewrite_fnode(pr,m,0);
1.95 noro 3770: if ( nfnode_match(fr,prr,&m1) ) {
1.88 noro 3771: *rp = append_node(m,m1);
3772: return 1;
3773: }
3774: }
3775: }
3776: return 0;
3777: }
1.87 noro 3778: }
3779: }
3780:
1.95 noro 3781: int nfnode_match_narymul(FNODE f,FNODE p,NODE *rp)
1.88 noro 3782: {
3783: int fl,pl,fi,pi;
3784: NODE fa,pa,t,s,m,m1;
3785: FNODE fr,pr,pleft,pleft1,pright,pright1,fleft,fright,pivot;
3786:
3787: f = to_narymul(f);
3788: fa = (NODE)FA1(f); fl = length(fa);
3789: pa = (NODE)FA1(p); pl = length(pa);
3790: if ( fl < pl ) return 0;
3791: else if ( pl == 1 ) {
3792: if ( fl == 1 )
1.95 noro 3793: return nfnode_match(BDY(fa),BDY(pa),rp);
1.88 noro 3794: else
3795: return 0;
3796: } else {
3797: for ( t = pa, pi = 0; t; t = NEXT(t), pi++ )
3798: if ( ((FNODE)BDY(t))->id != I_PVAR ) break;
3799: if ( !t ) {
3800: /* all are I_PVAR */
3801: m = 0;
3802: for ( t = pa, s = fa; NEXT(t); t = NEXT(t), s = NEXT(s) ) {
1.106 noro 3803: pr = rewrite_fnode(BDY(t),m,0);
1.95 noro 3804: if ( !nfnode_match(BDY(s),pr,&m1) ) return 0;
1.88 noro 3805: m = append_node(m1,m);
3806: }
3807: if ( !NEXT(s) )
3808: fr = (FNODE)BDY(s);
3809: else
3810: fr = mkfnode(2,I_NARYOP,FA0(f),s);
1.106 noro 3811: pr = rewrite_fnode(BDY(t),m,0);
1.95 noro 3812: if ( !nfnode_match(fr,pr,&m1) ) return 0;
1.88 noro 3813: *rp = append_node(m1,m);
3814: return 1;
3815: } else {
3816: pivot = (FNODE)BDY(t);
3817: pleft = fnode_left_narymul(p,pi);
3818: pright = fnode_right_narymul(p,pi);
3819: /* XXX : incomplete */
3820: for ( s = fa, fi = 0; s; s = NEXT(s), fi++ ) {
1.97 noro 3821: if ( fi < pi ) continue;
1.95 noro 3822: if ( nfnode_match(BDY(s),pivot,&m) ) {
1.88 noro 3823: fleft = fnode_left_narymul(f,fi);
1.106 noro 3824: pleft1 = rewrite_fnode(pleft,m,0);
1.95 noro 3825: if ( nfnode_match(fleft,pleft1,&m1) ) {
1.88 noro 3826: m = append_node(m1,m);
3827: fright = fnode_right_narymul(f,fi);
1.106 noro 3828: pright1 = rewrite_fnode(pright,m,0);
1.95 noro 3829: if ( nfnode_match(fright,pright1,&m1) ) {
1.88 noro 3830: *rp = append_node(m1,m);
3831: return 1;
3832: }
3833: }
3834: }
3835: }
3836: return 0;
3837: }
1.95 noro 3838: }
3839: }
3840:
3841: NODE nfnode_pvars(FNODE pat,NODE found)
3842: {
3843: int ind;
3844: NODE prev,t;
3845: int *pair;
3846:
3847: switch ( pat->id ) {
3848: case I_PVAR:
3849: ind = (int)FA0(pat);
3850: for ( prev = 0, t = found; t; prev = t, t = NEXT(t) ) {
3851: pair = (int *)BDY(t);
3852: if ( pair[0] == ind ) {
3853: pair[1]++;
3854: return found;
3855: }
3856: }
3857: pair = (int *)MALLOC_ATOMIC(sizeof(int)*2);
3858: pair[0] = ind; pair[1] = 1;
3859: if ( !prev )
3860: MKNODE(found,pair,0);
3861: else
3862: MKNODE(NEXT(prev),pair,0);
3863: return found;
3864:
3865: case I_FORMULA:
3866: return found;
3867:
3868: case I_BOP:
3869: /* OPNAME should be "^" */
3870: if ( !IS_BINARYPWR(pat) )
3871: error("nfnode_pvar : invalid BOP");
3872: found = nfnode_pvars(FA1(pat),found);
3873: found = nfnode_pvars(FA2(pat),found);
3874: return found;
3875:
3876: case I_FUNC:
3877: t = (NODE)FA0((FNODE)FA1(pat));
3878: for ( ; t; t = NEXT(t) )
3879: found = nfnode_pvars(BDY(t),found);
3880: return found;
3881:
3882: case I_NARYOP:
3883: t = (NODE)FA1(pat);
3884: for ( ; t; t = NEXT(t) )
3885: found = nfnode_pvars(BDY(t),found);
3886: return found;
3887:
3888: default:
3889: error("nfnode_match : invalid pattern");
1.88 noro 3890: }
3891: }
FreeBSD-CVSweb <freebsd-cvsweb@FreeBSD.org>