![[BACK]](/icons/cvsweb/back.gif){kind=icon}
Return to strobj.c CVS log ![[TXT]](/icons/cvsweb/text.gif){kind=icon}
![[DIR]](/icons/cvsweb/dir.gif){kind=icon}
Up to [local] / OpenXM_contrib2 / asir2000 / builtin|
Return to strobj.c CVS log | Up to [local] / OpenXM_contrib2 / asir2000 / builtin |
1.6 noro 1: /*
2: * Copyright (c) 1994-2000 FUJITSU LABORATORIES LIMITED
3: * All rights reserved.
4: *
5: * FUJITSU LABORATORIES LIMITED ("FLL") hereby grants you a limited,
6: * non-exclusive and royalty-free license to use, copy, modify and
7: * redistribute, solely for non-commercial and non-profit purposes, the
8: * computer program, "Risa/Asir" ("SOFTWARE"), subject to the terms and
9: * conditions of this Agreement. For the avoidance of doubt, you acquire
10: * only a limited right to use the SOFTWARE hereunder, and FLL or any
11: * third party developer retains all rights, including but not limited to
12: * copyrights, in and to the SOFTWARE.
13: *
14: * (1) FLL does not grant you a license in any way for commercial
15: * purposes. You may use the SOFTWARE only for non-commercial and
16: * non-profit purposes only, such as academic, research and internal
17: * business use.
18: * (2) The SOFTWARE is protected by the Copyright Law of Japan and
19: * international copyright treaties. If you make copies of the SOFTWARE,
20: * with or without modification, as permitted hereunder, you shall affix
21: * to all such copies of the SOFTWARE the above copyright notice.
22: * (3) An explicit reference to this SOFTWARE and its copyright owner
23: * shall be made on your publication or presentation in any form of the
24: * results obtained by use of the SOFTWARE.
25: * (4) In the event that you modify the SOFTWARE, you shall notify FLL by
1.7 noro 26: * e-mail at risa-admin@sec.flab.fujitsu.co.jp of the detailed specification
1.6 noro 27: * for such modification or the source code of the modified part of the
28: * SOFTWARE.
29: *
30: * THE SOFTWARE IS PROVIDED AS IS WITHOUT ANY WARRANTY OF ANY KIND. FLL
31: * MAKES ABSOLUTELY NO WARRANTIES, EXPRESSED, IMPLIED OR STATUTORY, AND
32: * EXPRESSLY DISCLAIMS ANY IMPLIED WARRANTY OF MERCHANTABILITY, FITNESS
33: * FOR A PARTICULAR PURPOSE OR NONINFRINGEMENT OF THIRD PARTIES'
34: * RIGHTS. NO FLL DEALER, AGENT, EMPLOYEES IS AUTHORIZED TO MAKE ANY
35: * MODIFICATIONS, EXTENSIONS, OR ADDITIONS TO THIS WARRANTY.
36: * UNDER NO CIRCUMSTANCES AND UNDER NO LEGAL THEORY, TORT, CONTRACT,
37: * OR OTHERWISE, SHALL FLL BE LIABLE TO YOU OR ANY OTHER PERSON FOR ANY
38: * DIRECT, INDIRECT, SPECIAL, INCIDENTAL, PUNITIVE OR CONSEQUENTIAL
39: * DAMAGES OF ANY CHARACTER, INCLUDING, WITHOUT LIMITATION, DAMAGES
40: * ARISING OUT OF OR RELATING TO THE SOFTWARE OR THIS AGREEMENT, DAMAGES
41: * FOR LOSS OF GOODWILL, WORK STOPPAGE, OR LOSS OF DATA, OR FOR ANY
42: * DAMAGES, EVEN IF FLL SHALL HAVE BEEN INFORMED OF THE POSSIBILITY OF
43: * SUCH DAMAGES, OR FOR ANY CLAIM BY ANY OTHER PARTY. EVEN IF A PART
44: * OF THE SOFTWARE HAS BEEN DEVELOPED BY A THIRD PARTY, THE THIRD PARTY
45: * DEVELOPER SHALL HAVE NO LIABILITY IN CONNECTION WITH THE USE,
46: * PERFORMANCE OR NON-PERFORMANCE OF THE SOFTWARE.
47: *
1.88 ! noro 48: * $OpenXM: OpenXM_contrib2/asir2000/builtin/strobj.c,v 1.87 2005/10/31 10:03:48 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.18 noro 61: struct TeXSymbol {
62: char *text;
63: char *symbol;
64: };
65:
1.71 noro 66: #define OPNAME(f) (((ARF)FA0(f))->name[0])
1.77 noro 67: #define IS_ZERO(f) (((f)->id==I_FORMULA) && FA0(f)==0 )
1.75 noro 68: #define IS_BINARYPWR(f) (((f)->id==I_BOP) &&(OPNAME(f)=='^'))
69: #define IS_NARYADD(f) (((f)->id==I_NARYOP) &&(OPNAME(f)=='+'))
70: #define IS_NARYMUL(f) (((f)->id==I_NARYOP) &&(OPNAME(f)=='*'))
1.71 noro 71:
1.1 noro 72: extern char *parse_strp;
73:
1.50 ohara 74: void Psprintf();
1.1 noro 75: void Prtostr(), Pstrtov(), Peval_str();
1.3 noro 76: void Pstrtoascii(), Pasciitostr();
1.5 noro 77: void Pstr_len(), Pstr_chr(), Psub_str();
1.14 noro 78: void Pwrite_to_tb();
79: void Ptb_to_string();
80: void Pclear_tb();
81: void Pstring_to_tb();
82: void Pquotetotex_tb();
83: void Pquotetotex();
1.24 noro 84: void Pquotetotex_env();
1.47 noro 85: void Pflatten_quote();
1.69 noro 86:
87: void Pquote_is_integer(),Pquote_is_rational(),Pquote_is_number();
88: void Pquote_is_dependent(),Pquote_is_function();
1.70 noro 89: void Pquote_normalize();
1.80 noro 90: void Pquote_normalize_comp();
1.88 ! noro 91: void Pquote_normalize_unify();
1.69 noro 92:
1.52 noro 93: void Pquote_to_funargs(),Pfunargs_to_quote(),Pget_function_name();
1.68 noro 94: void Pquote_unify(),Pget_quote_id(),Pquote_match_rewrite();
1.64 noro 95: void Pquote_to_nary(),Pquote_to_bin();
1.88 ! noro 96: void fnode_do_assign(NODE arg);
1.58 ohara 97: void do_assign(NODE arg);
1.14 noro 98: void fnodetotex_tb(FNODE f,TB tb);
99: char *symbol_name(char *name);
1.28 noro 100: char *conv_rule(char *name);
1.38 noro 101: char *conv_subs(char *name);
1.28 noro 102: char *call_convfunc(char *name);
1.14 noro 103: void tb_to_string(TB tb,STRING *rp);
104: void fnodenodetotex_tb(NODE n,TB tb);
105: void fargstotex_tb(char *opname,FNODE f,TB tb);
1.35 noro 106: int top_is_minus(FNODE f);
1.56 noro 107: int quote_unify(Obj f,Obj pat,NODE *rp);
1.1 noro 108:
109: struct ftab str_tab[] = {
1.50 ohara 110: {"sprintf",Psprintf,-99999999},
1.1 noro 111: {"rtostr",Prtostr,1},
112: {"strtov",Pstrtov,1},
113: {"eval_str",Peval_str,1},
1.3 noro 114: {"strtoascii",Pstrtoascii,1},
115: {"asciitostr",Pasciitostr,1},
1.5 noro 116: {"str_len",Pstr_len,1},
117: {"str_chr",Pstr_chr,3},
118: {"sub_str",Psub_str,3},
1.14 noro 119: {"write_to_tb",Pwrite_to_tb,2},
120: {"clear_tb",Pclear_tb,1},
121: {"tb_to_string",Ptb_to_string,1},
122: {"string_to_tb",Pstring_to_tb,1},
1.63 noro 123: {"get_quote_id",Pget_quote_id,1},
1.69 noro 124:
125: {"quote_is_number",Pquote_is_number,1},
126: {"quote_is_rational",Pquote_is_rational,1},
127: {"quote_is_integer",Pquote_is_integer,1},
128: {"quote_is_function",Pquote_is_function,1},
129: {"quote_is_dependent",Pquote_is_dependent,2},
130:
1.76 noro 131: {"quote_normalize",Pquote_normalize,-2},
1.86 noro 132: {"quote_normalize_comp",Pquote_normalize_comp,2},
1.70 noro 133:
1.64 noro 134: {"quote_to_nary",Pquote_to_nary,1},
135: {"quote_to_bin",Pquote_to_bin,2},
1.60 noro 136: {"quotetotex_tb",Pquotetotex_tb,2},
137: {"quotetotex",Pquotetotex,1},
138: {"quotetotex_env",Pquotetotex_env,-99999999},
1.65 noro 139: {"flatten_quote",Pflatten_quote,-2},
1.60 noro 140: {"quote_to_funargs",Pquote_to_funargs,1},
1.62 noro 141: {"quote_unify",Pquote_unify,2},
1.88 ! noro 142: {"quote_normalize_unify",Pquote_normalize_unify,2},
1.68 noro 143: {"quote_match_rewrite",Pquote_match_rewrite,-4},
1.48 noro 144: {"funargs_to_quote",Pfunargs_to_quote,1},
1.52 noro 145: {"get_function_name",Pget_function_name,1},
1.1 noro 146: {0,0,0},
147: };
1.13 noro 148:
1.14 noro 149: void write_tb(char *s,TB tb)
150: {
151: if ( tb->next == tb->size ) {
152: tb->size *= 2;
153: tb->body = (char **)REALLOC(tb->body,tb->size*sizeof(char *));
154: }
155: tb->body[tb->next] = s;
156: tb->next++;
157: }
1.13 noro 158:
1.18 noro 159: int register_symbol_table(Obj arg);
160: int register_conv_rule(Obj arg);
1.38 noro 161: int register_conv_func(Obj arg);
1.23 noro 162: int register_dp_vars(Obj arg);
1.46 noro 163: int register_dp_vars_origin(Obj arg);
164: int register_dp_dvars_origin(Obj arg);
165: int register_dp_dvars_prefix(Obj arg);
1.25 noro 166: int register_dp_vars_prefix(Obj arg);
1.31 noro 167: int register_dp_vars_hweyl(Obj arg);
1.27 noro 168: int register_show_lt(Obj arg);
1.40 noro 169: char *objtostr(Obj obj);
1.18 noro 170: static struct TeXSymbol *user_texsymbol;
1.23 noro 171: static char **dp_vars;
1.25 noro 172: static int dp_vars_len;
173: static char *dp_vars_prefix;
1.46 noro 174: static char *dp_dvars_prefix;
175: static int dp_vars_origin;
176: static int dp_dvars_origin;
1.27 noro 177: static int show_lt;
1.26 noro 178: static FUNC convfunc;
1.27 noro 179: static int is_lt;
1.28 noro 180: static int conv_flag;
1.31 noro 181: static int dp_vars_hweyl;
1.28 noro 182:
1.38 noro 183: #define CONV_TABLE (1U<<0)
184: #define CONV_SUBS (1U<<1)
185: #define CONV_DMODE (1U<<2)
1.18 noro 186:
187: static struct {
188: char *name;
189: Obj value;
190: int (*reg)();
191: } qtot_env[] = {
192: {"symbol_table",0,register_symbol_table},
193: {"conv_rule",0,register_conv_rule},
1.38 noro 194: {"conv_func",0,register_conv_func},
1.23 noro 195: {"dp_vars",0,register_dp_vars},
1.25 noro 196: {"dp_vars_prefix",0,register_dp_vars_prefix},
1.46 noro 197: {"dp_dvars_prefix",0,register_dp_dvars_prefix},
198: {"dp_vars_origin",0,register_dp_vars_origin},
199: {"dp_dvars_origin",0,register_dp_dvars_origin},
1.31 noro 200: {"dp_vars_hweyl",0,register_dp_vars_hweyl},
1.27 noro 201: {"show_lt",0,register_show_lt},
1.18 noro 202: {0,0,0},
203: };
204:
1.20 noro 205: #define PARTIAL "\\partial"
1.28 noro 206:
207: char *conv_rule(char *name)
208: {
209: char *body,*r;
1.41 noro 210: int len;
1.28 noro 211:
1.38 noro 212: if ( convfunc )
213: name = call_convfunc(name);
1.41 noro 214: if ( conv_flag & CONV_TABLE ) {
215: r = symbol_name(name);
216: if ( r ) return r;
217: }
218: if ( (conv_flag & CONV_DMODE) && *name == 'd' ) {
219: body = conv_rule(name+1);
220: r = MALLOC_ATOMIC((strlen(PARTIAL)+strlen(body)+5)*sizeof(char));
221: if ( !body || !(len=strlen(body)) )
222: strcpy(r,PARTIAL);
223: else if ( len == 1 )
224: sprintf(r,"%s_%s",PARTIAL,body);
225: else
226: sprintf(r,"%s_{%s}",PARTIAL,body);
227: return r;
228: } else
229: return conv_subs(name);
1.28 noro 230: }
231:
1.40 noro 232: int _is_delimiter(char c)
233: {
234: if ( (c == ' ' || c == '_' || c == ',') ) return 1;
235: else return 0;
236: }
237:
238: int _is_alpha(char c)
239: {
240: if ( isdigit(c) || c == '{' || _is_delimiter(c) ) return 0;
241: else return 1;
242: }
243:
1.38 noro 244: char *conv_subs(char *name)
1.19 noro 245: {
1.29 noro 246: int i,j,k,len,clen,slen,start,level;
1.41 noro 247: char *buf,*head,*r,*h,*brace,*buf_conv;
1.28 noro 248: char **subs;
249:
1.41 noro 250: if ( !name || !(len=strlen(name)) ) return "";
251: if ( !(conv_flag&CONV_SUBS) ) return name;
1.28 noro 252: subs = (char **)ALLOCA(len*sizeof(char* ));
1.32 noro 253: for ( i = 0, j = 0, start = i; ; j++ ) {
1.40 noro 254: while ( (i < len) && _is_delimiter(name[i]) ) i++;
1.32 noro 255: start = i;
1.28 noro 256: if ( i == len ) break;
1.29 noro 257: if ( name[i] == '{' ) {
258: for ( level = 1, i++; i < len && level; i++ ) {
259: if ( name[i] == '{' ) level++;
260: else if ( name[i] == '}' ) level--;
261: }
1.32 noro 262: slen = i-start;
1.37 noro 263: if ( slen >= 3 ) {
264: brace = (char *)ALLOCA((slen+1)*sizeof(char));
265: strncpy(brace,name+start+1,slen-2);
266: brace[slen-2] = 0;
1.38 noro 267: buf = conv_subs(brace);
1.37 noro 268: subs[j] = (char *)ALLOCA((strlen(buf)+3)*sizeof(char));
1.38 noro 269: if ( strlen(buf) == 1 )
270: strcpy(subs[j],buf);
271: else
272: sprintf(subs[j],"{%s}",buf);
1.37 noro 273: } else
274: subs[j] = "{}";
1.32 noro 275: } else {
276: if ( isdigit(name[i]) )
277: while ( i < len && isdigit(name[i]) ) i++;
278: else
1.40 noro 279: while ( i < len && _is_alpha(name[i]) ) i++;
1.32 noro 280: slen = i-start;
281: buf = (char *)ALLOCA((slen+1)*sizeof(char));
282: strncpy(buf,name+start,slen); buf[slen] = 0;
1.41 noro 283: buf_conv = symbol_name(buf);
284: subs[j] = buf_conv?buf_conv:buf;
1.32 noro 285: }
1.28 noro 286: }
1.32 noro 287: for ( k = 0, clen = 0; k < j; k++ ) clen += strlen(subs[k]);
288: /* {subs(0)}_{{subs(1)},...,{subs(j-1)}} => {}:j+1 _:1 ,:j-2 */
289: h = r = MALLOC_ATOMIC((clen+(j+1)*2+1+(j-2)+1)*sizeof(char));
290: if ( j == 1 )
291: sprintf(h,"{%s}",subs[0]);
1.28 noro 292: else {
1.38 noro 293: sprintf(h,"{%s}_{%s",subs[0],subs[1]);
1.28 noro 294: h += strlen(h);
1.32 noro 295: for ( k = 2; k < j; k++ ) {
1.38 noro 296: sprintf(h,",%s",subs[k]);
1.28 noro 297: h += strlen(h);
1.19 noro 298: }
1.28 noro 299: strcpy(h,"}");
1.20 noro 300: }
301: return r;
1.19 noro 302: }
303:
1.26 noro 304: char *call_convfunc(char *name)
305: {
306: STRING str,r;
307: NODE arg;
308:
309: MKSTR(str,name);
310: arg = mknode(1,str);
311: r = (STRING)bevalf(convfunc,arg);
312: if ( !r || OID(r) != O_STR )
313: error("call_convfunc : invalid result");
314: return BDY(r);
315: }
316:
1.18 noro 317: int register_symbol_table(Obj arg)
318: {
319: NODE n,t;
320: Obj b;
321: STRING a0,a1;
322: struct TeXSymbol *uts;
323: int i,len;
324:
325: /* check */
326: if ( !arg ) {
327: user_texsymbol = 0;
328: return 1;
329: }
330: if ( OID(arg) != O_LIST ) return 0;
331:
332: n = BDY((LIST)arg);
333: len = length(n);
334: uts = (struct TeXSymbol *)MALLOC((len+1)*sizeof(struct TeXSymbol));
335: for ( i = 0; n; n = NEXT(n), i++ ) {
336: b = (Obj)BDY(n);
337: if ( !b || OID(b) != O_LIST ) return 0;
338: t = BDY((LIST)b);
339: if ( !t || !NEXT(t) ) return 0;
340: a0 = (STRING)BDY(t);
341: a1 = (STRING)BDY(NEXT(t));
1.23 noro 342: if ( !a0 ) return 0;
343: if ( OID(a0) == O_STR )
344: uts[i].text = BDY(a0);
345: else if ( OID(a0) == O_P )
346: uts[i].text = NAME(VR((P)a0));
347: else
348: return 0;
349: if ( !a1 ) return 0;
350: if ( OID(a1) == O_STR )
351: uts[i].symbol = BDY(a1);
352: else if ( OID(a1) == O_P )
353: uts[i].symbol = NAME(VR((P)a1));
354: else
355: return 0;
1.18 noro 356: }
357: uts[i].text = 0;
358: uts[i].symbol = 0;
359: user_texsymbol = uts;
360: return 1;
361: }
362:
1.46 noro 363: int register_dp_vars_origin(Obj arg)
364: {
365: if ( INT(arg) ) {
366: dp_vars_origin = QTOS((Q)arg);
367: return 1;
368: } else return 0;
369: }
370:
371: int register_dp_dvars_origin(Obj arg)
372: {
373: if ( INT(arg) ) {
374: dp_dvars_origin = QTOS((Q)arg);
375: return 1;
376: } else return 0;
377: }
378:
1.31 noro 379: int register_dp_vars_hweyl(Obj arg)
380: {
381: if ( INT(arg) ) {
382: dp_vars_hweyl = QTOS((Q)arg);
383: return 1;
384: } else return 0;
385: }
386:
1.27 noro 387: int register_show_lt(Obj arg)
388: {
389: if ( INT(arg) ) {
390: show_lt = QTOS((Q)arg);
391: return 1;
392: } else return 0;
393: }
1.26 noro 394:
1.18 noro 395: int register_conv_rule(Obj arg)
396: {
1.19 noro 397: if ( INT(arg) ) {
1.28 noro 398: conv_flag = QTOS((Q)arg);
399: convfunc = 0;
400: return 1;
1.38 noro 401: } else return 0;
402: }
403:
404: int register_conv_func(Obj arg)
405: {
1.43 noro 406: if ( !arg ) {
407: convfunc = 0;
408: return 1;
409: } else if ( OID(arg) == O_P && (int)(VR((P)arg))->attr == V_SR ) {
1.26 noro 410: convfunc = (FUNC)(VR((P)arg)->priv);
411: /* f must be a function which takes single argument */
412: return 1;
1.19 noro 413: } else return 0;
1.18 noro 414: }
415:
1.23 noro 416: int register_dp_vars(Obj arg)
417: {
418: int l,i;
419: char **r;
420: NODE n;
421: STRING a;
422:
423: if ( !arg ) {
424: dp_vars = 0;
425: dp_vars_len = 0;
1.25 noro 426: return 1;
1.23 noro 427: } else if ( OID(arg) != O_LIST )
428: return 0;
429: else {
430: n = BDY((LIST)arg);
431: l = length(n);
432: r = (char **)MALLOC_ATOMIC(l*sizeof(char *));
433: for ( i = 0; i < l; i++, n = NEXT(n) ) {
434: a = (STRING)BDY(n);
435: if ( !a ) return 0;
436: if ( OID(a) == O_STR )
437: r[i] = BDY(a);
438: else if ( OID(a) == O_P )
439: r[i] = NAME(VR((P)a));
440: else
441: return 0;
442: }
443: dp_vars = r;
444: dp_vars_len = l;
445: return 1;
446: }
447: }
448:
1.25 noro 449: int register_dp_vars_prefix(Obj arg)
450: {
451: if ( !arg ) {
452: dp_vars_prefix = 0;
453: return 1;
454: } else if ( OID(arg) == O_STR ) {
455: dp_vars_prefix = BDY((STRING)arg);
456: return 1;
457: } else if ( OID(arg) == O_P ) {
458: dp_vars_prefix = NAME(VR((P)arg));
459: return 1;
460: } else return 0;
461: }
462:
1.46 noro 463: int register_dp_dvars_prefix(Obj arg)
464: {
465: if ( !arg ) {
466: dp_dvars_prefix = 0;
467: return 1;
468: } else if ( OID(arg) == O_STR ) {
469: dp_dvars_prefix = BDY((STRING)arg);
470: return 1;
471: } else if ( OID(arg) == O_P ) {
472: dp_dvars_prefix = NAME(VR((P)arg));
473: return 1;
474: } else return 0;
475: }
476:
1.24 noro 477: void Pquotetotex_env(NODE arg,Obj *rp)
1.18 noro 478: {
479: int ac,i;
480: char *name;
481: NODE n,n0;
482: STRING s;
483: LIST l;
484:
485: ac = argc(arg);
486: if ( !ac ) {
487: n0 = 0;
488: for ( i = 0; qtot_env[i].name; i++ ) {
489: NEXTNODE(n0,n); MKSTR(s,qtot_env[i].name); BDY(n) = (pointer)s;
490: NEXTNODE(n0,n); BDY(n) = (Q)qtot_env[i].value;
491: }
492: NEXT(n) = 0;
493: MKLIST(l,n0);
494: *rp = (Obj)l;
1.34 noro 495: } else if ( ac == 1 && !ARG0(arg) ) {
496: /* set to default */
1.43 noro 497: for ( i = 0; qtot_env[i].name; i++ ) {
498: (qtot_env[i].reg)(0);
1.34 noro 499: qtot_env[i].value = 0;
1.43 noro 500: }
1.34 noro 501: *rp = 0;
1.18 noro 502: } else if ( ac == 1 || ac == 2 ) {
1.24 noro 503: asir_assert(ARG0(arg),O_STR,"quotetotex_env");
1.18 noro 504: name = BDY((STRING)ARG0(arg));
505: for ( i = 0; qtot_env[i].name; i++ )
506: if ( !strcmp(qtot_env[i].name,name) ) {
507: if ( ac == 2 ) {
508: if ( (qtot_env[i].reg)((Obj)ARG1(arg)) )
509: qtot_env[i].value = (Obj)ARG1(arg);
510: else
1.24 noro 511: error("quotetotex_env : invalid argument");
1.18 noro 512: }
513: *rp = qtot_env[i].value;
514: return;
515: }
516: *rp = 0;
517: } else
518: *rp = 0;
519: }
520:
1.14 noro 521: void Pwrite_to_tb(NODE arg,Q *rp)
1.13 noro 522: {
523: int i;
1.16 noro 524: Obj obj;
525: TB tb;
1.13 noro 526:
1.14 noro 527: asir_assert(ARG1(arg),O_TB,"write_to_tb");
1.16 noro 528: obj = ARG0(arg);
529: if ( !obj )
530: write_tb("",ARG1(arg));
531: else if ( OID(obj) == O_STR )
532: write_tb(BDY((STRING)obj),ARG1(arg));
533: else if ( OID(obj) == O_TB ) {
534: tb = (TB)obj;
535: for ( i = 0; i < tb->next; i++ )
536: write_tb(tb->body[i],ARG1(arg));
537: }
1.14 noro 538: *rp = 0;
1.53 noro 539: }
540:
1.70 noro 541: FNODE partial_eval(FNODE), fnode_to_nary(FNODE), fnode_to_bin(FNODE,int);
1.63 noro 542:
1.64 noro 543: void Pquote_to_nary(NODE arg,QUOTE *rp)
1.63 noro 544: {
545: FNODE f;
546:
1.70 noro 547: f = fnode_to_nary(BDY((QUOTE)ARG0(arg)));
1.63 noro 548: MKQUOTE(*rp,f);
549: }
550:
1.64 noro 551: void Pquote_to_bin(NODE arg,QUOTE *rp)
1.63 noro 552: {
553: FNODE f;
554: int direction;
555:
556: direction = QTOS((Q)ARG1(arg));
1.70 noro 557: f = fnode_to_bin(BDY((QUOTE)ARG0(arg)),direction);
1.63 noro 558:
559: MKQUOTE(*rp,f);
560: }
1.61 noro 561:
1.69 noro 562: void Pquote_is_number(NODE arg,Q *rp)
563: {
564: QUOTE q;
565: int ret;
566:
567: q = (QUOTE)ARG0(arg);
568: asir_assert(q,O_QUOTE,"quote_is_number");
569: ret = fnode_is_number(BDY(q));
570: STOQ(ret,*rp);
571: }
572:
573: void Pquote_is_rational(NODE arg,Q *rp)
574: {
575: QUOTE q;
576: int ret;
577:
578: q = (QUOTE)ARG0(arg);
579: asir_assert(q,O_QUOTE,"quote_is_rational");
580: ret = fnode_is_rational(BDY(q));
581: STOQ(ret,*rp);
582: }
583:
584: void Pquote_is_integer(NODE arg,Q *rp)
585: {
586: QUOTE q;
587: int ret;
588:
589: q = (QUOTE)ARG0(arg);
590: asir_assert(q,O_QUOTE,"quote_is_integer");
591: ret = fnode_is_integer(BDY(q));
592: STOQ(ret,*rp);
593: }
594:
595: void Pquote_is_function(NODE arg,Q *rp)
596: {
597: QUOTE q;
598: int ret;
599:
600: q = (QUOTE)ARG0(arg);
601: asir_assert(q,O_QUOTE,"quote_is_function");
602: if ( q->id == I_FUNC || q->id == I_IFUNC )
603: ret = 1;
604: else
605: ret = 0;
606: STOQ(ret,*rp);
607: }
608:
609: void Pquote_is_dependent(NODE arg,Q *rp)
610: {
611: P x;
612: QUOTE q,v;
613: int ret;
614: V var;
615:
616: q = (QUOTE)ARG0(arg);
617: v = (QUOTE)ARG1(arg);
618: asir_assert(q,O_QUOTE,"quote_is_dependent");
619: asir_assert(v,O_QUOTE,"quote_is_dependent");
620: x = (P)eval(BDY(v));
621: if ( !x || OID(x) != O_P )
622: *rp = 0;
623: var = VR(x);
624: ret = fnode_is_dependent(BDY(q),var);
625: STOQ(ret,*rp);
626: }
627:
628:
1.57 noro 629: void Pquote_unify(NODE arg,Q *rp)
1.53 noro 630: {
1.61 noro 631: FNODE f,g;
1.65 noro 632: Obj obj;
1.61 noro 633: QUOTE q;
1.53 noro 634: NODE r;
1.56 noro 635: int ret;
1.53 noro 636:
1.62 noro 637: #if 0
1.61 noro 638: g = partial_eval(BDY(((QUOTE)ARG0(arg))));
639: MKQUOTE(q,g);
640: ret = quote_unify((Obj)q,(Obj)ARG1(arg),&r);
1.62 noro 641: #else
1.65 noro 642: obj = (Obj)ARG0(arg);
643: ret = quote_unify(obj,(Obj)ARG1(arg),&r);
1.62 noro 644: #endif
1.57 noro 645: if ( ret ) {
646: do_assign(r);
647: *rp = ONE;
648: } else
1.56 noro 649: *rp = 0;
1.68 noro 650: }
651:
1.88 ! noro 652: void Pquote_normalize_unify(NODE arg,Q *rp)
! 653: {
! 654: QUOTE fq,pq;
! 655: FNODE f,p;
! 656: int ret;
! 657: NODE r;
! 658:
! 659: fq = (QUOTE)ARG0(arg); Pquote_normalize(mknode(2,fq,0),&fq); f = (FNODE)BDY(fq);
! 660: pq = (QUOTE)ARG1(arg); Pquote_normalize(mknode(2,pq,0),&pq); p = (FNODE)BDY(pq);
! 661: ret = fnode_normalize_unify(f,p,&r);
! 662: if ( ret ) {
! 663: fnode_do_assign(r);
! 664: *rp = ONE;
! 665: } else
! 666: *rp = 0;
! 667: }
! 668:
1.68 noro 669: FNODE rewrite_fnode(FNODE,NODE);
670:
671: extern Obj VOIDobj;
672:
673: void Pquote_match_rewrite(NODE arg,Obj *rp)
674: {
675: FNODE f,g,h,c,value;
676: Obj obj;
677: QUOTE q;
678: NODE r,t,s,s0,pair;
679: int ret,ind,ac;
680:
681: obj = (Obj)ARG0(arg);
682: ret = quote_unify(obj,(Obj)ARG1(arg),&r);
683: if ( ret ) {
684: for ( t = r, s0 = 0; t; t = NEXT(t) ) {
685: NEXTNODE(s0,s);
686: pair = BDY((LIST)BDY(t));
687: ind = (int)FA0((FNODE)BDY((QUOTE)BDY(pair)));
1.79 noro 688: value = BDY((QUOTE)(BDY(NEXT(pair))));
1.68 noro 689: BDY(s) = mknode(2,ind,value);
690: }
691: if ( s0 ) NEXT(s) = 0;
692: switch ( ac = argc(arg) ) {
693: case 3:
694: h = rewrite_fnode(BDY((QUOTE)ARG2(arg)),s0);
1.79 noro 695: MKQUOTE(q,h); *rp = (Obj)q;
1.68 noro 696: break;
697: case 4:
698: c = rewrite_fnode(BDY((QUOTE)ARG2(arg)),s0);
699: if ( eval(c) ) {
700: h = rewrite_fnode(BDY((QUOTE)ARG3(arg)),s0);
1.79 noro 701: MKQUOTE(q,h); *rp = (Obj)q;
1.68 noro 702: } else
703: *rp = VOIDobj;
704: break;
705: default:
706: error("quote_match_rewrite : invalid argument");
707: }
708: } else
709: *rp = VOIDobj;
1.56 noro 710: }
711:
712: void do_assign(NODE arg)
713: {
714: NODE t,pair;
715: int pv;
716:
717: QUOTE value;
718:
719: for ( t = arg; t; t = NEXT(t) ) {
720: pair = BDY((LIST)BDY(t));
721: pv = (int)FA0((FNODE)BDY((QUOTE)BDY(pair)));
722: value = (QUOTE)(BDY(NEXT(pair)));
723: ASSPV(pv,value);
724: }
1.53 noro 725: }
726:
1.88 ! noro 727: /* [[index,fnode],...] */
! 728:
! 729: void fnode_do_assign(NODE arg)
! 730: {
! 731: NODE t,pair;
! 732: int pv;
! 733: FNODE f;
! 734: QUOTE value;
! 735:
! 736: for ( t = arg; t; t = NEXT(t) ) {
! 737: pair = (NODE)BDY(t);
! 738: pv = (int)BDY(pair);
! 739: f = (FNODE)(BDY(NEXT(pair)));
! 740: MKQUOTE(value,f);
! 741: ASSPV(pv,value);
! 742: }
! 743: }
! 744:
1.53 noro 745: /*
1.56 noro 746: /* consistency check and merge
747: */
1.53 noro 748:
1.56 noro 749: int merge_matching_node(NODE n,NODE a,NODE *rp)
1.53 noro 750: {
751: NODE ta,ba,tn,bn;
752: QUOTE pa,va,pn,vn;
753:
1.56 noro 754: if ( !n ) {
755: *rp = a;
756: return 1;
757: }
1.53 noro 758: for ( ta = a; ta; ta = NEXT(ta) ) {
759: ba = BDY((LIST)BDY(ta));
1.55 noro 760: if ( !ba ) continue;
1.53 noro 761: pa = (QUOTE)BDY(ba); va = (QUOTE)BDY(NEXT(ba));
762: for ( tn = n; tn; tn = NEXT(tn) ) {
763: bn = BDY((LIST)BDY(tn));
1.55 noro 764: if ( !bn ) continue;
1.53 noro 765: pn = (QUOTE)BDY(bn); vn = (QUOTE)BDY(NEXT(bn));
1.55 noro 766: if ( !compquote(CO,pa,pn) ) {
767: if ( !compquote(CO,va,vn) ) break;
768: else return 0;
769: }
1.53 noro 770: }
771: if ( !tn ) {
772: MKNODE(tn,(pointer)BDY(ta),n);
773: n = tn;
774: }
775: }
1.56 noro 776: *rp = n;
777: return 1;
1.53 noro 778: }
779:
1.56 noro 780: int quote_unify_node(NODE f,NODE pat,NODE *rp) {
781: NODE r,a,tf,tp,r1;
782: int ret;
1.53 noro 783:
784: if ( length(f) != length(pat) ) return 0;
785: r = 0;
786: for ( tf = f, tp = pat; tf; tf = NEXT(tf), tp = NEXT(tp) ) {
1.56 noro 787: ret = quote_unify((Obj)BDY(tf),(Obj)BDY(tp),&a);
788: if ( !ret ) return 0;
789: ret = merge_matching_node(r,a,&r1);
790: if ( !ret ) return 0;
791: else r = r1;
1.53 noro 792: }
1.56 noro 793: *rp = r;
794: return 1;
1.53 noro 795: }
796:
1.66 noro 797: /* f = [a,b,c,...] pat = [X,Y,...] rpat matches the rest of f */
798:
799: int quote_unify_cons(NODE f,NODE pat,Obj rpat,NODE *rp) {
800: QUOTE q;
801: Q id;
802: FNODE fn;
803: NODE r,a,tf,tp,r1,arg;
804: int ret;
805: LIST list,alist;
806:
807: /* matching of the head part */
808: if ( length(f) < length(pat) ) return 0;
809: r = 0;
810: for ( tf = f, tp = pat; tp; tf = NEXT(tf), tp = NEXT(tp) ) {
811: ret = quote_unify((Obj)BDY(tf),(Obj)BDY(tp),&a);
812: if ( !ret ) return 0;
813: ret = merge_matching_node(r,a,&r1);
814: if ( !ret ) return 0;
815: else r = r1;
816: }
817: /* matching of the rest */
818: MKLIST(list,tf);
819: STOQ(I_LIST,id); a = mknode(2,id,list);
820: MKLIST(alist,a);
821: arg = mknode(1,alist);
822: Pfunargs_to_quote(arg,&q);
823: ret = quote_unify((Obj)q,rpat,&a);
824: if ( !ret ) return 0;
825: ret = merge_matching_node(r,a,&r1);
826: if ( !ret ) return 0;
827: *rp = r1;
828: return 1;
829: }
830:
1.53 noro 831: void get_quote_id_arg(QUOTE f,int *id,NODE *r)
832: {
833: LIST fa;
834: NODE arg,fab;
835:
836: arg = mknode(1,f); Pquote_to_funargs(arg,&fa); fab = BDY((LIST)fa);
837: *id = QTOS((Q)BDY(fab)); *r = NEXT(fab);
838: }
839:
1.56 noro 840: /* *rp : [[quote(A),quote(1)],...] */
1.53 noro 841:
1.56 noro 842: int quote_unify(Obj f, Obj pat, NODE *rp)
1.53 noro 843: {
844: NODE tf,tp,head,body;
845: NODE parg,farg,r;
1.66 noro 846: Obj rpat;
1.53 noro 847: LIST fa,l;
848: int pid,id;
1.55 noro 849: FUNC ff,pf;
1.56 noro 850: int ret;
1.64 noro 851: QUOTE q;
852: FNODE g;
1.53 noro 853:
1.67 noro 854: if ( !f )
855: if ( !pat ) {
856: *rp = 0; return 1;
857: } else
858: return 0;
859: else if ( OID(pat) == O_LIST ) {
1.53 noro 860: if ( OID(f) == O_LIST )
1.56 noro 861: return quote_unify_node(BDY((LIST)f),BDY((LIST)pat),rp);
1.53 noro 862: else
863: return 0;
864: } else if ( OID(pat) == O_QUOTE ) {
1.67 noro 865: pid = ((FNODE)BDY((QUOTE)pat))->id;
1.53 noro 866: switch ( pid ) {
1.55 noro 867: case I_FORMULA:
868: if ( compquote(CO,f,pat) )
869: return 0;
870: else {
1.67 noro 871: *rp = 0; return 1;
1.55 noro 872: }
873: break;
1.67 noro 874:
875: case I_LIST: case I_CONS:
876: get_quote_id_arg((QUOTE)pat,&pid,&parg);
877: if ( OID(f) == O_LIST )
878: tf = BDY((LIST)f);
879: else if ( OID(f) == O_QUOTE
880: && ((FNODE)BDY((QUOTE)f))->id == pid ) {
881: get_quote_id_arg((QUOTE)f,&id,&farg);
882: tf = BDY((LIST)BDY(farg));
883: } else
884: return 0;
885:
1.66 noro 886: tp = BDY((LIST)BDY(parg));
1.67 noro 887: if ( pid == I_LIST )
888: return quote_unify_node(tf,tp,rp);
889: else {
890: rpat = (Obj)BDY(NEXT(parg));
891: return quote_unify_cons(tf,tp,rpat,rp);
892: }
893:
1.53 noro 894: case I_PVAR:
895: /* [[pat,f]] */
896: r = mknode(2,pat,f); MKLIST(l,r);
1.56 noro 897: *rp = mknode(1,l);
898: return 1;
1.67 noro 899:
1.53 noro 900: case I_IFUNC:
901: /* F(X,Y,...) = ... */
1.67 noro 902: get_quote_id_arg((QUOTE)f,&id,&farg);
903: get_quote_id_arg((QUOTE)pat,&pid,&parg);
1.53 noro 904: if ( id == I_FUNC ) {
1.54 noro 905: r = mknode(2,BDY(parg),BDY(farg)); MKLIST(l,r);
906: head = mknode(1,l);
1.56 noro 907: ret = quote_unify(BDY(NEXT(farg)),
908: BDY(NEXT(parg)),&body);
909: if ( !ret ) return 0;
910: else return merge_matching_node(head,body,rp);
1.53 noro 911: } else
912: return 0;
1.64 noro 913:
1.67 noro 914: case I_NARYOP: case I_BOP: case I_FUNC:
1.64 noro 915: /* X+Y = ... */
1.67 noro 916: /* f(...) = ... */
917: if ( OID(f) != O_QUOTE ) return 0;
918: id = ((FNODE)BDY((QUOTE)f))->id;
919: if ( pid == I_FUNC )
920: ;
921: else {
922: /* XXX converting to I_BOP */
923: if ( pid == I_NARYOP ) {
1.70 noro 924: g = fnode_to_bin(BDY((QUOTE)pat),1);
1.67 noro 925: MKQUOTE(q,g); pat = (Obj)q;
926: }
927: if ( id == I_NARYOP ) {
1.70 noro 928: g = fnode_to_bin(BDY((QUOTE)f),1);
1.67 noro 929: MKQUOTE(q,g); f = (Obj)q;
930: }
931: }
932: get_quote_id_arg((QUOTE)pat,&pid,&parg);
933: get_quote_id_arg((QUOTE)f,&id,&farg);
1.64 noro 934: if ( compqa(CO,BDY(farg),BDY(parg)) ) return 0;
935: return quote_unify_node(NEXT(farg),NEXT(parg),rp);
936:
1.53 noro 937: default:
1.67 noro 938: if ( OID(f) != O_QUOTE ) return 0;
939: id = ((FNODE)BDY((QUOTE)f))->id;
940: if ( id != pid ) return 0;
941: get_quote_id_arg((QUOTE)pat,&pid,&parg);
942: get_quote_id_arg((QUOTE)f,&id,&farg);
943: return quote_unify_node(farg,parg,rp);
1.53 noro 944: }
945: }
1.13 noro 946: }
947:
1.14 noro 948: void Pquotetotex(NODE arg,STRING *rp)
1.13 noro 949: {
1.14 noro 950: TB tb;
1.13 noro 951:
1.14 noro 952: NEWTB(tb);
1.27 noro 953: /* XXX for DP */
954: is_lt = 1;
1.14 noro 955: fnodetotex_tb(BDY((QUOTE)ARG0(arg)),tb);
956: tb_to_string(tb,rp);
1.13 noro 957: }
958:
1.14 noro 959: void Pquotetotex_tb(NODE arg,Q *rp)
1.13 noro 960: {
961: int i;
1.14 noro 962: TB tb;
1.13 noro 963:
1.14 noro 964: asir_assert(ARG1(arg),O_TB,"quotetotex_tb");
1.27 noro 965: /* XXX for DP */
966: is_lt = 1;
1.14 noro 967: fnodetotex_tb(BDY((QUOTE)ARG0(arg)),ARG1(arg));
1.13 noro 968: *rp = 0;
969: }
970:
1.14 noro 971: void Pstring_to_tb(NODE arg,TB *rp)
972: {
973: TB tb;
974:
975: asir_assert(ARG0(arg),O_STR,"string_to_tb");
976: NEWTB(tb);
977: tb->body[0] = BDY((STRING)ARG0(arg));
978: tb->next++;
979: *rp = tb;
980: }
981:
982: void Ptb_to_string(NODE arg,STRING *rp)
983: {
984: TB tb;
985:
986: asir_assert(ARG0(arg),O_TB,"tb_to_string");
987: tb = (TB)ARG0(arg);
988: tb_to_string(tb,rp);
989: }
990:
991: void tb_to_string(TB tb,STRING *rp)
1.13 noro 992: {
1.14 noro 993: int j,len;
1.13 noro 994: char *all,*p,*q;
995:
1.14 noro 996: for ( j = 0, len = 0; j < tb->next; j++ )
997: len += strlen(tb->body[j]);
998: all = (char *)MALLOC_ATOMIC((len+1)*sizeof(char));
999: for ( j = 0, p = all; j < tb->next; j++ )
1000: for ( q = tb->body[j]; *q; *p++ = *q++ );
1001: *p = 0;
1002: MKSTR(*rp,all);
1003: }
1004:
1005: void Pclear_tb(NODE arg,Q *rp)
1006: {
1007: TB tb;
1008: int j;
1009:
1010: asir_assert(ARG0(arg),O_TB,"clear_tb");
1011: tb = (TB)ARG0(arg);
1012: for ( j = 0; j < tb->next; j++ )
1013: tb->body[j] = 0;
1014: tb->next = 0;
1015: *rp = 0;
1.13 noro 1016: }
1.5 noro 1017:
1018: void Pstr_len(arg,rp)
1019: NODE arg;
1020: Q *rp;
1021: {
1.16 noro 1022: Obj obj;
1023: TB tb;
1024: int r,i;
1.5 noro 1025:
1.16 noro 1026: obj = (Obj)ARG0(arg);
1027: if ( !obj || (OID(obj) != O_STR && OID(obj) != O_TB) )
1028: error("str_len : invalid argument");
1029: if ( OID(obj) == O_STR)
1030: r = strlen(BDY((STRING)obj));
1031: else if ( OID(obj) == O_TB ) {
1032: tb = (TB)obj;
1033: for ( r = i = 0; i < tb->next; i++ )
1034: r += strlen(tb->body[i]);
1035: }
1.5 noro 1036: STOQ(r,*rp);
1037: }
1038:
1039: void Pstr_chr(arg,rp)
1040: NODE arg;
1041: Q *rp;
1042: {
1043: STRING str,terminator;
1044: Q start;
1045: char *p,*ind;
1046: int chr,spos,r;
1047:
1048: str = (STRING)ARG0(arg);
1049: start = (Q)ARG1(arg);
1050: terminator = (STRING)ARG2(arg);
1051: asir_assert(str,O_STR,"str_chr");
1052: asir_assert(start,O_N,"str_chr");
1053: asir_assert(terminator,O_STR,"str_chr");
1054: p = BDY(str);
1055: spos = QTOS(start);
1056: chr = BDY(terminator)[0];
1.8 noro 1057: if ( spos > (int)strlen(p) )
1.5 noro 1058: r = -1;
1059: else {
1060: ind = strchr(p+spos,chr);
1061: if ( ind )
1062: r = ind-p;
1063: else
1064: r = -1;
1065: }
1066: STOQ(r,*rp);
1067: }
1068:
1069: void Psub_str(arg,rp)
1070: NODE arg;
1071: STRING *rp;
1072: {
1073: STRING str;
1074: Q head,tail;
1075: char *p,*r;
1076: int spos,epos,len;
1077:
1078: str = (STRING)ARG0(arg);
1079: head = (Q)ARG1(arg);
1080: tail = (Q)ARG2(arg);
1081: asir_assert(str,O_STR,"sub_str");
1082: asir_assert(head,O_N,"sub_str");
1083: asir_assert(tail,O_N,"sub_str");
1084: p = BDY(str);
1085: spos = QTOS(head);
1086: epos = QTOS(tail);
1087: len = strlen(p);
1088: if ( (spos >= len) || (epos < spos) ) {
1089: *rp = 0; return;
1090: }
1091: if ( epos >= len )
1092: epos = len-1;
1093: len = epos-spos+1;
1094: r = (char *)MALLOC(len+1);
1095: strncpy(r,p+spos,len);
1096: r[len] = 0;
1097: MKSTR(*rp,r);
1098: }
1.3 noro 1099:
1100: void Pstrtoascii(arg,rp)
1101: NODE arg;
1102: LIST *rp;
1103: {
1104: STRING str;
1105: unsigned char *p;
1106: int len,i;
1107: NODE n,n1;
1108: Q q;
1109:
1110: str = (STRING)ARG0(arg);
1111: asir_assert(str,O_STR,"strtoascii");
1112: p = BDY(str);
1113: len = strlen(p);
1114: for ( i = len-1, n = 0; i >= 0; i-- ) {
1115: UTOQ((unsigned int)p[i],q);
1116: MKNODE(n1,q,n);
1117: n = n1;
1118: }
1119: MKLIST(*rp,n);
1120: }
1121:
1122: void Pasciitostr(arg,rp)
1123: NODE arg;
1124: STRING *rp;
1125: {
1126: LIST list;
1127: unsigned char *p;
1128: int len,i,j;
1129: NODE n;
1130: Q q;
1131:
1132: list = (LIST)ARG0(arg);
1133: asir_assert(list,O_LIST,"asciitostr");
1134: n = BDY(list);
1135: len = length(n);
1136: p = MALLOC_ATOMIC(len+1);
1137: for ( i = 0; i < len; i++, n = NEXT(n) ) {
1138: q = (Q)BDY(n);
1139: asir_assert(q,O_N,"asciitostr");
1140: j = QTOS(q);
1.4 noro 1141: if ( j >= 256 || j <= 0 )
1.3 noro 1142: error("asciitostr : argument out of range");
1143: p[i] = j;
1144: }
1145: p[i] = 0;
1146: MKSTR(*rp,(char *)p);
1147: }
1.1 noro 1148:
1149: void Peval_str(arg,rp)
1150: NODE arg;
1151: Obj *rp;
1152: {
1153: FNODE fnode;
1154: char *cmd;
1.10 ohara 1155: #if defined(PARI)
1.8 noro 1156: void recover(int);
1157:
1.1 noro 1158: recover(0);
1.11 saito 1159: # if !(PARI_VERSION_CODE > 131588)
1.1 noro 1160: if ( setjmp(environnement) ) {
1161: avma = top; recover(1);
1162: resetenv("");
1163: }
1.11 saito 1164: # endif
1.1 noro 1165: #endif
1166: cmd = BDY((STRING)ARG0(arg));
1.9 noro 1167: exprparse_create_var(0,cmd,&fnode);
1.1 noro 1168: *rp = eval(fnode);
1169: }
1170:
1171: void Prtostr(arg,rp)
1172: NODE arg;
1173: STRING *rp;
1174: {
1175: char *b;
1176: int len;
1177:
1.2 noro 1178: len = estimate_length(CO,ARG0(arg));
1.12 noro 1179: b = (char *)MALLOC_ATOMIC(len+1);
1.1 noro 1180: soutput_init(b);
1181: sprintexpr(CO,ARG0(arg));
1182: MKSTR(*rp,b);
1183: }
1184:
1185: void Pstrtov(arg,rp)
1186: NODE arg;
1187: P *rp;
1188: {
1.8 noro 1189: char *p;
1.1 noro 1190:
1191: p = BDY((STRING)ARG0(arg));
1192: #if 0
1193: if ( !islower(*p) )
1194: *rp = 0;
1195: else {
1196: for ( t = p+1; t && (isalnum(*t) || *t == '_'); t++ );
1197: if ( *t )
1198: *rp = 0;
1199: else
1200: makevar(p,rp);
1201: }
1202: #else
1203: makevar(p,rp);
1204: #endif
1.14 noro 1205: }
1206:
1.15 noro 1207: static struct TeXSymbol texsymbol[] = {
1208: {"sin","\\sin"},
1209: {"cos","\\cos"},
1210: {"tan","\\tan"},
1211: {"sinh","\\sinh"},
1212: {"cosh","\\cosh"},
1213: {"tanh","\\tanh"},
1214: {"exp","\\exp"},
1215: {"log","\\log"},
1216:
1217: /* Greek Letters (lower case) */
1218: {"alpha","\\alpha"},
1219: {"beta","\\beta"},
1220: {"gamma","\\gamma"},
1221: {"delta","\\delta"},
1222: {"epsilon","\\epsilon"},
1223: {"varepsilon","\\varepsilon"},
1224: {"zeta","\\zeta"},
1225: {"eta","\\eta"},
1226: {"theta","\\theta"},
1227: {"vartheta","\\vartheta"},
1228: {"iota","\\iota"},
1229: {"kappa","\\kappa"},
1230: {"lambda","\\lambda"},
1231: {"mu","\\mu"},
1232: {"nu","\\nu"},
1233: {"xi","\\xi"},
1234: {"pi","\\pi"},
1235: {"varpi","\\varpi"},
1236: {"rho","\\rho"},
1237: {"sigma","\\sigma"},
1238: {"varsigma","\\varsigma"},
1239: {"tau","\\tau"},
1240: {"upsilon","\\upsilon"},
1241: {"phi","\\phi"},
1242: {"varphi","\\varphi"},
1243: {"chi","\\chi"},
1244: {"omega","\\omega"},
1245:
1246: /* Greek Letters, (upper case) */
1247: {"ggamma","\\Gamma"},
1248: {"ddelta","\\Delta"},
1249: {"ttheta","\\Theta"},
1250: {"llambda","\\Lambda"},
1251: {"xxi","\\Xi"},
1252: {"ppi","\\Pi"},
1253: {"ssigma","\\Sigma"},
1254: {"uupsilon","\\Upsilon"},
1255: {"pphi","\\Phi"},
1256: {"ppsi","\\Psi"},
1257: {"oomega","\\Omega"},
1258:
1259: /* Our own mathematical functions */
1260: {"algebra_tensor","\\otimes"},
1261: {"base_where","{\\rm \\ where \\ }"},
1262: /* Mathematical constants */
1263: {"c_pi","\\pi"},
1264: {"c_i","\\sqrt{-1}"},
1265:
1266: /* Temporary */
1267: {0,0}
1268: };
1269:
1.14 noro 1270: char *symbol_name(char *name)
1271: {
1.15 noro 1272: int i;
1273:
1.41 noro 1274: if ( !name || strlen(name) == 0 )
1275: return "";
1.38 noro 1276: if ( !(conv_flag & CONV_TABLE) )
1277: return name;
1278:
1.18 noro 1279: if ( user_texsymbol )
1280: for ( i = 0; user_texsymbol[i].text; i++ )
1281: if ( !strcmp(user_texsymbol[i].text,name) )
1282: return user_texsymbol[i].symbol;
1.15 noro 1283: for ( i = 0; texsymbol[i].text; i++ )
1284: if ( !strcmp(texsymbol[i].text,name) )
1285: return texsymbol[i].symbol;
1.41 noro 1286: return 0;
1.52 noro 1287: }
1288:
1289: void Pget_function_name(NODE arg,STRING *rp)
1290: {
1291: QUOTEARG qa;
1292: ARF f;
1293: char *opname;
1294:
1295: qa = (QUOTEARG)BDY(arg);
1296: if ( !qa || OID(qa) != O_QUOTEARG || qa->type != A_arf )
1297: *rp = 0;
1298: else {
1299: f = (ARF)BDY(qa);
1300: opname = f->name;
1301: MKSTR(*rp,opname);
1302: }
1.14 noro 1303: }
1304:
1.51 noro 1305: FNODE strip_paren(FNODE);
1306:
1.14 noro 1307: void fnodetotex_tb(FNODE f,TB tb)
1308: {
1309: NODE n,t,t0;
1.38 noro 1310: char vname[BUFSIZ],prefix[BUFSIZ];
1311: char *opname,*vname_conv,*prefix_conv;
1.14 noro 1312: Obj obj;
1.46 noro 1313: int i,len,allzero,elen,elen2,si;
1.40 noro 1314: C cplx;
1315: char *r;
1.17 noro 1316: FNODE fi,f2;
1.14 noro 1317:
1318: write_tb(" ",tb);
1319: if ( !f ) {
1320: write_tb("0",tb);
1321: return;
1322: }
1323: switch ( f->id ) {
1324: /* unary operators */
1.23 noro 1325: case I_NOT:
1326: write_tb("\\neg (",tb);
1327: fnodetotex_tb((FNODE)FA0(f),tb);
1328: write_tb(")",tb);
1329: break;
1330: case I_PAREN:
1331: write_tb("(",tb);
1332: fnodetotex_tb((FNODE)FA0(f),tb);
1333: write_tb(")",tb);
1334: break;
1335: case I_MINUS:
1336: write_tb("-",tb);
1337: fnodetotex_tb((FNODE)FA0(f),tb);
1338: break;
1339:
1340: /* binary operators */
1341: /* arg list */
1342: /* I_AND, I_OR => FA0(f), FA1(f) */
1343: /* otherwise => FA1(f), FA2(f) */
1344: case I_BOP:
1345: opname = ((ARF)FA0(f))->name;
1.70 noro 1346: switch ( opname[0] ) {
1347: case '+':
1348: fnodetotex_tb((FNODE)FA1(f),tb);
1349: if ( !top_is_minus((FNODE)FA2(f)) ) write_tb(opname,tb);
1350: fnodetotex_tb((FNODE)FA2(f),tb);
1351: break;
1352: case '-':
1353: if ( FA1(f) ) fnodetotex_tb((FNODE)FA1(f),tb);
1354: write_tb(opname,tb);
1355: fnodetotex_tb((FNODE)FA2(f),tb);
1356: break;
1357: case '*':
1358: fnodetotex_tb((FNODE)FA1(f),tb);
1359: write_tb(" ",tb);
1360: /* XXX special care for DP */
1361: f2 = (FNODE)FA2(f);
1362: if ( f2->id == I_EV ) {
1363: n = (NODE)FA0(f2);
1364: for ( i = 0; n; n = NEXT(n), i++ ) {
1365: fi = (FNODE)BDY(n);
1366: if ( fi->id != I_FORMULA || FA0(fi) )
1367: break;
1368: }
1369: if ( n )
1370: fnodetotex_tb((FNODE)FA2(f),tb);
1371: } else
1.23 noro 1372: fnodetotex_tb((FNODE)FA2(f),tb);
1.70 noro 1373: break;
1374: case '/':
1375: write_tb("\\frac{",tb);
1376: fnodetotex_tb((FNODE)FA1(f),tb);
1377: write_tb("} {",tb);
1378: fnodetotex_tb((FNODE)FA2(f),tb);
1379: write_tb("}",tb);
1380: break;
1381: case '^':
1382: fnodetotex_tb((FNODE)FA1(f),tb);
1383: write_tb("^{",tb);
1384: fnodetotex_tb(strip_paren((FNODE)FA2(f)),tb);
1385: write_tb("} ",tb);
1386: break;
1387: case '%':
1388: fnodetotex_tb((FNODE)FA1(f),tb);
1389: write_tb(" {\\rm mod}\\, ",tb);
1.23 noro 1390: fnodetotex_tb((FNODE)FA2(f),tb);
1.70 noro 1391: break;
1392: default:
1393: error("invalid binary operator");
1394: break;
1395: }
1.23 noro 1396: break;
1397:
1398: case I_COP:
1399: switch( (cid)FA0(f) ) {
1400: case C_EQ:
1401: fnodetotex_tb((FNODE)FA1(f),tb);
1402: write_tb(" = ",tb);
1403: fnodetotex_tb((FNODE)FA2(f),tb);
1404: break;
1405: case C_NE:
1406: fnodetotex_tb((FNODE)FA1(f),tb);
1407: write_tb(" \\neq ",tb);
1408: fnodetotex_tb((FNODE)FA2(f),tb);
1409: break;
1410: case C_GT:
1411: fnodetotex_tb((FNODE)FA1(f),tb);
1.45 noro 1412: write_tb(" > ",tb);
1.23 noro 1413: fnodetotex_tb((FNODE)FA2(f),tb);
1414: break;
1415: case C_LT:
1416: fnodetotex_tb((FNODE)FA1(f),tb);
1.45 noro 1417: write_tb(" < ",tb);
1.23 noro 1418: fnodetotex_tb((FNODE)FA2(f),tb);
1.14 noro 1419: break;
1.23 noro 1420: case C_GE:
1421: fnodetotex_tb((FNODE)FA1(f),tb);
1422: write_tb(" \\geq ",tb);
1423: fnodetotex_tb((FNODE)FA2(f),tb);
1.14 noro 1424: break;
1.23 noro 1425: case C_LE:
1426: fnodetotex_tb((FNODE)FA1(f),tb);
1427: write_tb(" \\leq ",tb);
1428: fnodetotex_tb((FNODE)FA2(f),tb);
1.14 noro 1429: break;
1430: }
1431: break;
1432:
1.23 noro 1433: case I_LOP:
1434: switch( (lid)FA0(f) ) {
1435: case L_EQ:
1436: fnodetotex_tb((FNODE)FA1(f),tb);
1437: write_tb(" = ",tb);
1438: fnodetotex_tb((FNODE)FA2(f),tb);
1439: break;
1440: case L_NE:
1441: fnodetotex_tb((FNODE)FA1(f),tb);
1442: write_tb(" \\neq ",tb);
1443: fnodetotex_tb((FNODE)FA2(f),tb);
1444: break;
1445: case L_GT:
1446: fnodetotex_tb((FNODE)FA1(f),tb);
1.45 noro 1447: write_tb(" > ",tb);
1.23 noro 1448: fnodetotex_tb((FNODE)FA2(f),tb);
1449: break;
1450: case L_LT:
1451: fnodetotex_tb((FNODE)FA1(f),tb);
1.45 noro 1452: write_tb(" < ",tb);
1.23 noro 1453: fnodetotex_tb((FNODE)FA2(f),tb);
1454: break;
1455: case L_GE:
1456: fnodetotex_tb((FNODE)FA1(f),tb);
1457: write_tb(" \\geq ",tb);
1458: fnodetotex_tb((FNODE)FA2(f),tb);
1.14 noro 1459: break;
1.23 noro 1460: case L_LE:
1461: fnodetotex_tb((FNODE)FA1(f),tb);
1462: write_tb(" \\leq ",tb);
1463: fnodetotex_tb((FNODE)FA2(f),tb);
1.14 noro 1464: break;
1.23 noro 1465: case L_AND:
1466: fnodetotex_tb((FNODE)FA1(f),tb);
1.14 noro 1467: write_tb(" {\\rm \\ and\\ } ",tb);
1.23 noro 1468: fnodetotex_tb((FNODE)FA2(f),tb);
1469: break;
1470: case L_OR:
1.14 noro 1471: fnodetotex_tb((FNODE)FA1(f),tb);
1.23 noro 1472: write_tb(" {\\rm \\ or\\ } ",tb);
1473: fnodetotex_tb((FNODE)FA2(f),tb);
1.14 noro 1474: break;
1.23 noro 1475: case L_NOT:
1476: /* XXX : L_NOT is a unary operator */
1477: write_tb("\\neg (",tb);
1.14 noro 1478: fnodetotex_tb((FNODE)FA1(f),tb);
1.23 noro 1479: write_tb(")",tb);
1480: return;
1.14 noro 1481: }
1482: break;
1483:
1.23 noro 1484: case I_AND:
1485: fnodetotex_tb((FNODE)FA0(f),tb);
1486: write_tb(" {\\rm \\ and\\ } ",tb);
1487: fnodetotex_tb((FNODE)FA1(f),tb);
1488: break;
1489:
1490: case I_OR:
1491: fnodetotex_tb((FNODE)FA0(f),tb);
1492: write_tb(" {\\rm \\ or\\ } ",tb);
1493: fnodetotex_tb((FNODE)FA1(f),tb);
1494: break;
1495:
1.14 noro 1496: /* ternary operators */
1497: case I_CE:
1498: error("fnodetotex_tb : not implemented yet");
1499: break;
1500:
1501: /* lists */
1502: case I_LIST:
1503: write_tb(" [ ",tb);
1504: n = (NODE)FA0(f);
1505: fnodenodetotex_tb(n,tb);
1506: write_tb("]",tb);
1507: break;
1508:
1509: /* function */
1.23 noro 1510: case I_FUNC:
1.40 noro 1511: if ( !strcmp(((FUNC)FA0(f))->name,"@pi") )
1512: write_tb("\\pi",tb);
1513: else if ( !strcmp(((FUNC)FA0(f))->name,"@e") )
1514: write_tb("e",tb);
1515: else {
1516: opname = conv_rule(((FUNC)FA0(f))->name);
1517: write_tb(opname,tb);
1518: write_tb("(",tb);
1519: fargstotex_tb(opname,FA1(f),tb);
1520: write_tb(")",tb);
1521: }
1.23 noro 1522: break;
1523:
1524: /* XXX */
1525: case I_CAR:
1.28 noro 1526: opname = conv_rule("car");
1.23 noro 1527: write_tb(opname,tb);
1528: write_tb("(",tb);
1529: fargstotex_tb(opname,FA0(f),tb);
1530: write_tb(")",tb);
1531: break;
1532:
1533: case I_CDR:
1.28 noro 1534: opname = conv_rule("cdr");
1.23 noro 1535: write_tb(opname,tb);
1536: write_tb("(",tb);
1537: fargstotex_tb(opname,FA0(f),tb);
1538: write_tb(")",tb);
1539: break;
1540:
1541: /* exponent vector */
1542: case I_EV:
1543: n = (NODE)FA0(f);
1.31 noro 1544: if ( dp_vars_hweyl ) {
1545: elen = length(n);
1546: elen2 = elen>>1;
1547: elen = elen2<<1;
1548: }
1.23 noro 1549: allzero = 1;
1.27 noro 1550: if ( show_lt && is_lt )
1551: write_tb("\\underline{",tb);
1.23 noro 1552: for ( t0 = 0, i = 0; n; n = NEXT(n), i++ ) {
1553: fi = (FNODE)BDY(n);
1554: if ( fi->id == I_FORMULA && !FA0(fi) ) continue;
1555: allzero = 0;
1.38 noro 1556: if ( dp_vars && i < dp_vars_len ) {
1557: strcpy(vname,dp_vars[i]);
1558: vname_conv = conv_rule(vname);
1559: } else {
1560: if ( dp_vars_hweyl ) {
1.44 noro 1561: if ( i < elen2 ) {
1.38 noro 1562: strcpy(prefix,dp_vars_prefix?dp_vars_prefix:"x");
1.44 noro 1563: prefix_conv = conv_rule(prefix);
1564: vname_conv = (char *)ALLOCA(strlen(prefix_conv)+50);
1.46 noro 1565: si = i+dp_vars_origin;
1566: sprintf(vname_conv,(si>=0&&si<10)?"%s_%d":"%s_{%d}",
1567: prefix_conv,si);
1.44 noro 1568: } else if ( i < elen ) {
1.46 noro 1569: strcpy(prefix,
1570: dp_dvars_prefix?dp_dvars_prefix:"\\partial");
1.44 noro 1571: prefix_conv = conv_rule(prefix);
1572: vname_conv = (char *)ALLOCA(strlen(prefix_conv)+50);
1.46 noro 1573: si = i+dp_dvars_origin-elen2;
1574: sprintf(vname_conv,(si>=0&&si<10)?"%s_%d":"%s_{%d}",
1575: prefix_conv,si);
1.44 noro 1576: } else {
1.38 noro 1577: strcpy(prefix,"h");
1.44 noro 1578: vname_conv = conv_rule(prefix);
1579: }
1580: } else {
1.38 noro 1581: strcpy(prefix,dp_vars_prefix?dp_vars_prefix:"x");
1.44 noro 1582: prefix_conv = conv_rule(prefix);
1583: vname_conv = (char *)ALLOCA(strlen(prefix_conv)+50);
1.46 noro 1584: si = i+dp_vars_origin;
1585: sprintf(vname_conv,(si>=0&&si<10)?"%s_%d":"%s_{%d}",
1586: prefix_conv,si);
1.44 noro 1587: }
1.38 noro 1588: }
1.23 noro 1589: if ( fi->id == I_FORMULA && UNIQ(FA0(fi)) ) {
1590: len = strlen(vname_conv);
1591: opname = MALLOC_ATOMIC(len+2);
1592: sprintf(opname,"%s ",vname_conv);
1.14 noro 1593: write_tb(opname,tb);
1.23 noro 1594: } else {
1595: len = strlen(vname_conv);
1596: /* 2: ^{ */
1597: opname = MALLOC_ATOMIC(len+1+2);
1598: sprintf(opname,"%s^{",vname_conv);
1.14 noro 1599: write_tb(opname,tb);
1.23 noro 1600: fnodetotex_tb((FNODE)BDY(n),tb);
1601: write_tb("} ",tb);
1602: }
1.14 noro 1603: }
1.23 noro 1604: /* XXX */
1605: if ( allzero )
1606: write_tb(" 1 ",tb);
1.27 noro 1607: if ( show_lt && is_lt ) {
1608: write_tb("}",tb);
1609: is_lt = 0;
1610: }
1.14 noro 1611: break;
1612:
1.23 noro 1613: /* string */
1.14 noro 1614: case I_STR:
1615: write_tb((char *)FA0(f),tb);
1616: break;
1617:
1.23 noro 1618: /* internal object */
1.14 noro 1619: case I_FORMULA:
1620: obj = (Obj)FA0(f);
1.40 noro 1621: if ( !obj )
1.42 noro 1622: write_tb("0",tb);
1.40 noro 1623: else if ( OID(obj) == O_N && NID(obj) == N_C ) {
1624: cplx = (C)obj;
1625: write_tb("(",tb);
1626: if ( cplx->r ) {
1627: r = objtostr((Obj)cplx->r); write_tb(r,tb);
1628: }
1629: if ( cplx->i ) {
1630: if ( cplx->r && compnum(0,cplx->i,0) > 0 ) {
1631: write_tb("+",tb);
1632: if ( !UNIQ(cplx->i) ) {
1633: r = objtostr((Obj)cplx->i); write_tb(r,tb);
1634: }
1635: } else if ( MUNIQ(cplx->i) )
1636: write_tb("-",tb);
1637: else if ( !UNIQ(cplx->i) ) {
1638: r = objtostr((Obj)cplx->i); write_tb(r,tb);
1639: }
1640: write_tb("\\sqrt{-1}",tb);
1641: }
1642: write_tb(")",tb);
1643: } else if ( OID(obj) == O_P )
1644: write_tb(conv_rule(VR((P)obj)->name),tb);
1645: else
1646: write_tb(objtostr(obj),tb);
1.14 noro 1647: break;
1648:
1.23 noro 1649: /* program variable */
1.14 noro 1650: case I_PVAR:
1651: if ( FA1(f) )
1652: error("fnodetotex_tb : not implemented yet");
1653: GETPVNAME(FA0(f),opname);
1654: write_tb(opname,tb);
1655: break;
1656:
1657: default:
1658: error("fnodetotex_tb : not implemented yet");
1659: }
1.40 noro 1660: }
1661:
1662: char *objtostr(Obj obj)
1663: {
1664: int len;
1665: char *r;
1666:
1667: len = estimate_length(CO,obj);
1668: r = (char *)MALLOC_ATOMIC(len+1);
1669: soutput_init(r);
1670: sprintexpr(CO,obj);
1671: return r;
1.50 ohara 1672: }
1673:
1674: void Psprintf(NODE arg,STRING *rp)
1675: {
1676: STRING string;
1677: char *s,*t,*r;
1678: int argc,n,len;
1679: NODE node;
1680:
1681: string = (STRING)ARG0(arg);
1682: asir_assert(string,O_STR,"sprintf");
1683: s = BDY(string);
1684: for(n = 0, t = s; *t; t++) {
1685: if (*t=='%' && *(t+1)=='a') {
1686: n++;
1687: }
1688: }
1689: for(node = NEXT(arg), argc = 0, len = strlen(s); node; node = NEXT(node), argc++) {
1690: len += estimate_length(CO,BDY(node));
1691: }
1692: if (argc < n) {
1693: error("sprintf: invalid argument");
1694: }
1695: r = (char *)MALLOC_ATOMIC(len);
1696: for(node = NEXT(arg), t = r; *s; s++) {
1697: if (*s=='%' && *(s+1)=='a') {
1698: strcpy(t,objtostr(BDY(node)));
1699: node = NEXT(node);
1700: t = strchr(t,0);
1701: s++;
1702: }else {
1703: *t++ = *s;
1704: }
1705: }
1706: *t = 0;
1707: MKSTR(*rp,r);
1.14 noro 1708: }
1709:
1710: void fnodenodetotex_tb(NODE n,TB tb)
1711: {
1712: for ( ; n; n = NEXT(n) ) {
1.27 noro 1713: is_lt = 1;
1.14 noro 1714: fnodetotex_tb((FNODE)BDY(n),tb);
1715: if ( NEXT(n) ) write_tb(", ",tb);
1716: }
1717: }
1718:
1719: void fargstotex_tb(char *name,FNODE f,TB tb)
1720: {
1721: NODE n;
1722:
1723: if ( !strcmp(name,"matrix") ) {
1724: error("fargstotex_tb : not implemented yet");
1725: } else if ( !strcmp(name,"vector") ) {
1726: error("fargstotex_tb : not implemented yet");
1727: } else {
1728: if ( f->id == I_LIST ) {
1729: n = (NODE)FA0(f);
1730: fnodenodetotex_tb(n,tb);
1731: } else
1732: fnodetotex_tb(f,tb);
1.35 noro 1733: }
1734: }
1735:
1736: int top_is_minus(FNODE f)
1737: {
1738: char *opname;
1739: int len;
1740: Obj obj;
1741:
1742: if ( !f )
1743: return 0;
1744: switch ( f->id ) {
1745: case I_MINUS:
1746: return 1;
1747: case I_BOP:
1748: opname = ((ARF)FA0(f))->name;
1749: switch ( opname[0] ) {
1750: case '+': case '*': case '/': case '^': case '%':
1751: return top_is_minus((FNODE)FA1(f));
1752: case '-':
1753: if ( FA1(f) )
1754: return top_is_minus((FNODE)FA1(f));
1755: else
1756: return 1;
1757: default:
1758: return 0;
1759: }
1760: break;
1761: case I_COP:
1762: return top_is_minus((FNODE)FA1(f));
1763: case I_LOP:
1764: if ( (lid)FA0(f) == L_NOT ) return 0;
1765: else return top_is_minus((FNODE)FA1(f));
1766: case I_AND: case I_OR:
1767: return top_is_minus((FNODE)FA0(f));
1768: case I_FORMULA:
1769: obj = (Obj)FA0(f);
1.36 noro 1770: if ( !obj )
1771: return 0;
1772: else {
1773: switch ( OID(obj) ) {
1774: case O_N:
1775: return mmono((P)obj);
1776: case O_P:
1777: /* must be a variable */
1778: opname = conv_rule(VR((P)obj)->name);
1779: return opname[0]=='-';
1780: default:
1781: /* ??? */
1782: len = estimate_length(CO,obj);
1783: opname = (char *)MALLOC_ATOMIC(len+1);
1784: soutput_init(opname);
1785: sprintexpr(CO,obj);
1786: return opname[0]=='-';
1787: }
1.35 noro 1788: }
1789: default:
1790: return 0;
1.14 noro 1791: }
1.47 noro 1792: }
1793:
1794: FNODE flatten_fnode(FNODE,char *);
1795:
1.48 noro 1796: void Pflatten_quote(NODE arg,Obj *rp)
1.47 noro 1797: {
1798: FNODE f;
1799: QUOTE q;
1800:
1.48 noro 1801: if ( !ARG0(arg) || OID((Obj)ARG0(arg)) != O_QUOTE )
1802: *rp = (Obj)ARG0(arg);
1.65 noro 1803: else if ( argc(arg) == 1 ) {
1804: f = flatten_fnode(BDY((QUOTE)ARG0(arg)),"+");
1805: f = flatten_fnode(f,"*");
1806: MKQUOTE(q,f);
1807: *rp = (Obj)q;
1808: } else {
1.48 noro 1809: f = flatten_fnode(BDY((QUOTE)ARG0(arg)),BDY((STRING)ARG1(arg)));
1810: MKQUOTE(q,f);
1811: *rp = (Obj)q;
1812: }
1.63 noro 1813: }
1814:
1815: void Pget_quote_id(NODE arg,Q *rp)
1816: {
1817: FNODE f;
1818: QUOTE q;
1819:
1820: q = (QUOTE)ARG0(arg);
1821: if ( !q || OID(q) != O_QUOTE )
1822: error("get_quote_id : invalid argument");
1823: f = BDY(q);
1824: STOQ((int)f->id,*rp);
1.48 noro 1825: }
1826:
1827: void Pquote_to_funargs(NODE arg,LIST *rp)
1828: {
1829: fid_spec_p spec;
1830: QUOTE q;
1831: QUOTEARG qa;
1832: FNODE f;
1833: STRING s;
1834: QUOTE r;
1835: int i;
1836: Q id,a;
1.49 noro 1837: LIST l;
1838: NODE t0,t,w,u,u0;
1.48 noro 1839:
1840: q = (QUOTE)ARG0(arg);
1841: if ( !q || OID(q) != O_QUOTE )
1842: error("quote_to_funargs : invalid argument");
1843: f = BDY(q);
1844: if ( !f ) {
1845: MKLIST(*rp,0);
1846: return;
1847: }
1848: get_fid_spec(f->id,&spec);
1849: if ( !spec )
1850: error("quote_to_funargs : not supported yet");
1851: t0 = 0;
1852: STOQ((int)f->id,id);
1853: NEXTNODE(t0,t);
1854: BDY(t) = (pointer)id;
1855: for ( i = 0; spec->type[i] != A_end; i++ ) {
1856: NEXTNODE(t0,t);
1857: switch ( spec->type[i] ) {
1858: case A_fnode:
1859: MKQUOTE(r,(FNODE)f->arg[i]);
1860: BDY(t) = (pointer)r;
1861: break;
1862: case A_int:
1863: STOQ((int)f->arg[i],a);
1864: BDY(t) = (pointer)a;
1865: break;
1866: case A_str:
1867: MKSTR(s,(char *)f->arg[i]);
1868: BDY(t) = (pointer)s;
1869: break;
1870: case A_internal:
1871: BDY(t) = (pointer)f->arg[i];
1872: break;
1.49 noro 1873: case A_node:
1874: w = (NODE)f->arg[i];
1875: for ( u0 = 0; w; w = NEXT(w) ){
1876: NEXTNODE(u0,u);
1877: MKQUOTE(r,(FNODE)BDY(w));
1878: BDY(u) = (pointer)r;
1879: }
1880: if ( u0 ) NEXT(u) = 0;
1881: MKLIST(l,u0);
1882: BDY(t) = (pointer)l;
1883: break;
1.48 noro 1884: default:
1885: MKQUOTEARG(qa,spec->type[i],f->arg[i]);
1886: BDY(t) = (pointer)qa;
1887: break;
1888: }
1889: }
1890: if ( t0 ) NEXT(t) = 0;
1891: MKLIST(*rp,t0);
1892: }
1893:
1894: void Pfunargs_to_quote(NODE arg,QUOTE *rp)
1895: {
1896: fid_spec_p spec;
1897: QUOTE q;
1898: QUOTEARG qa;
1899: FNODE f;
1900: STRING s;
1.49 noro 1901: QUOTE r,b;
1.48 noro 1902: int i;
1903: LIST l;
1904: fid id;
1905: Obj a;
1.49 noro 1906: NODE t0,t,u0,u,w;
1.48 noro 1907:
1908: l = (LIST)ARG0(arg);
1909: if ( !l || OID(l) != O_LIST || !(t=BDY(l)) )
1910: error("funargs_to_quote : invalid argument");
1911: t = BDY(l);
1912: id = (fid)QTOS((Q)BDY(t)); t = NEXT(t);
1913: get_fid_spec(id,&spec);
1914: if ( !spec )
1915: error("funargs_to_quote : not supported yet");
1916: for ( i = 0; spec->type[i] != A_end; i++ );
1917: NEWFNODE(f,i);
1918: f->id = id;
1919: for ( i = 0; spec->type[i] != A_end; i++, t = NEXT(t) ) {
1920: if ( !t )
1921: error("funargs_to_quote : argument mismatch");
1922: a = (Obj)BDY(t);
1923: switch ( spec->type[i] ) {
1924: case A_fnode:
1925: if ( !a || OID(a) != O_QUOTE )
1926: error("funargs_to_quote : invalid argument");
1927: f->arg[i] = BDY((QUOTE)a);
1928: break;
1929: case A_int:
1930: if ( !INT(a) )
1931: error("funargs_to_quote : invalid argument");
1932: f->arg[i] = (pointer)QTOS((Q)a);
1933: break;
1934: case A_str:
1935: if ( !a || OID(a) != O_STR )
1936: error("funargs_to_quote : invalid argument");
1937: f->arg[i] = (pointer)BDY((STRING)a);
1938: break;
1939: case A_internal:
1940: f->arg[i] = (pointer)a;
1.49 noro 1941: break;
1942: case A_node:
1943: if ( !a || OID(a) != O_LIST )
1944: error("funargs_to_quote : invalid argument");
1945: u0 = 0;
1946: for ( w = BDY((LIST)a); w; w = NEXT(w) ) {
1947: NEXTNODE(u0,u);
1948: b = (QUOTE)BDY(w);
1949: if ( !b || OID(b) != O_QUOTE )
1950: error("funargs_to_quote : invalid argument");
1951: BDY(u) = BDY(b);
1952: }
1953: if ( u0 ) NEXT(u) = 0;
1954: f->arg[i] = (pointer)u0;
1.48 noro 1955: break;
1956: default:
1957: if ( !a || OID(a) != O_QUOTEARG ||
1958: ((QUOTEARG)a)->type != spec->type[i] )
1959: error("funargs_to_quote : invalid argument");
1960: f->arg[i] = BDY((QUOTEARG)a);
1961: break;
1962: }
1963: }
1964: MKQUOTE(*rp,f);
1.69 noro 1965: }
1966:
1.76 noro 1967: FNODE fnode_apply(FNODE f,FNODE (*func)(),int expand);
1968: FNODE fnode_normalize(FNODE f,int expand);
1.70 noro 1969:
1970: void Pquote_normalize(NODE arg,QUOTE *rp)
1971: {
1972: QUOTE q,r;
1973: FNODE f;
1.76 noro 1974: int expand,ac;
1.70 noro 1975:
1.76 noro 1976: ac = argc(arg);
1977: if ( !ac ) error("quote_normalize : invalid argument");
1.70 noro 1978: q = (QUOTE)ARG0(arg);
1.76 noro 1979: expand = ac==2 && ARG1(arg);
1.70 noro 1980: if ( !q || OID(q) != O_QUOTE ) {
1981: *rp = q;
1982: return;
1.87 noro 1983: } else if ( q->normalized && (q->expanded || !expand) )
1984: *rp = q;
1985: else {
1.76 noro 1986: f = fnode_normalize(BDY(q),expand);
1.70 noro 1987: MKQUOTE(r,f);
1.87 noro 1988: r->normalized = 1;
1989: if ( expand ) r->expanded = 1;
1.70 noro 1990: *rp = r;
1991: }
1992: }
1993:
1.80 noro 1994: void Pquote_normalize_comp(NODE arg,Q *rp)
1995: {
1.87 noro 1996: QUOTE q1,q2;
1.80 noro 1997: FNODE f1,f2;
1998: int r;
1999:
1.87 noro 2000: q1 = (QUOTE)ARG0(arg); f1 = (FNODE)BDY(q1);
2001: q2 = (QUOTE)ARG1(arg); f2 = (FNODE)BDY(q2);
2002: if ( !q1->normalized ) f1 = fnode_normalize(f1,0);
2003: if ( !q2->normalized ) f2 = fnode_normalize(f2,0);
1.80 noro 2004: r = fnode_normalize_comp(f1,f2);
2005: STOQ(r,*rp);
2006: }
2007:
1.69 noro 2008: int fnode_is_number(FNODE f)
2009: {
2010: Obj obj;
2011:
2012: switch ( f->id ) {
2013: case I_MINUS: case I_PAREN:
2014: return fnode_is_number(FA0(f));
2015:
2016: case I_FORMULA:
2017: obj = FA0(f);
2018: if ( !obj ) return 1;
2019: else if ( OID(obj) == O_QUOTE )
2020: return fnode_is_number(BDY((QUOTE)obj));
2021: else if ( NUM(obj) ) return 1;
2022: else return 0;
2023:
2024: case I_BOP:
2025: return fnode_is_number(FA1(f)) && fnode_is_number(FA2(f));
2026:
2027: default:
2028: return 0;
2029: }
2030: }
2031:
2032: int fnode_is_rational(FNODE f)
2033: {
2034: Obj obj;
2035:
2036: switch ( f->id ) {
2037: case I_MINUS: case I_PAREN:
2038: return fnode_is_number(FA0(f));
2039:
2040: case I_FORMULA:
2041: obj = FA0(f);
2042: if ( !obj ) return 1;
2043: else if ( OID(obj) == O_QUOTE )
2044: return fnode_is_rational(BDY((QUOTE)obj));
2045: else if ( NUM(obj) && RATN(obj) ) return 1;
2046: else return 0;
2047:
2048: case I_BOP:
2049: if ( !strcmp(((ARF)FA0(f))->name,"^") )
2050: return fnode_is_rational(FA1(f)) && fnode_is_integer(FA2(f));
2051: else
2052: return fnode_is_rational(FA1(f)) && fnode_is_rational(FA2(f));
2053:
2054: default:
2055: return 0;
2056: }
2057: }
2058:
2059: int fnode_is_integer(FNODE f)
2060: {
2061: Obj obj;
2062:
2063: switch ( f->id ) {
2064: case I_MINUS: case I_PAREN:
2065: return fnode_is_integer(FA0(f));
2066:
2067: case I_FORMULA:
2068: obj = FA0(f);
2069: if ( !obj ) return 1;
2070: else if ( OID(obj) == O_QUOTE )
2071: return fnode_is_integer(BDY((QUOTE)obj));
2072: else if ( INT(obj)) return 1;
2073: else return 0;
2074:
2075: case I_BOP:
1.70 noro 2076: switch ( ((ARF)FA0(f))->name[0] ) {
2077: case '^':
2078: return fnode_is_integer(FA1(f))
2079: && fnode_is_nonnegative_integer(FA2(f));
2080: case '/':
2081: return fnode_is_integer(FA1(f)) &&
2082: ( fnode_is_one(FA2(f)) || fnode_is_minusone(FA2(f)) );
2083: default:
2084: return fnode_is_integer(FA1(f)) && fnode_is_integer(FA2(f));
2085: }
2086: break;
2087:
1.69 noro 2088: default:
2089: return 0;
2090: }
2091: }
2092:
2093: int fnode_is_nonnegative_integer(FNODE f)
2094: {
2095: Q n;
2096:
2097: n = eval(f);
2098: if ( !n || (INT(n) && SGN(n) > 0) ) return 1;
2099: else return 0;
2100: }
2101:
2102: int fnode_is_one(FNODE f)
2103: {
2104: Q n;
2105:
2106: n = eval(f);
2107: if ( UNIQ(n) ) return 1;
2108: else return 0;
2109: }
2110:
2111: int fnode_is_minusone(FNODE f)
2112: {
2113: Q n;
2114:
2115: n = eval(f);
2116: if ( MUNIQ(n) ) return 1;
2117: else return 0;
2118: }
2119:
2120: int fnode_is_dependent(FNODE f,V v)
2121: {
2122: Obj obj;
2123: FNODE arg;
2124: NODE t;
2125:
2126: switch ( f->id ) {
2127: case I_MINUS: case I_PAREN:
2128: return fnode_is_dependent(FA0(f),v);
2129:
2130: case I_FORMULA:
2131: obj = FA0(f);
2132: if ( !obj ) return 0;
2133: else if ( OID(obj) == O_QUOTE )
2134: return fnode_is_dependent(BDY((QUOTE)obj),v);
2135: else if ( obj_is_dependent(obj,v) ) return 1;
2136: else return 0;
2137:
2138: case I_BOP:
2139: return fnode_is_dependent(FA1(f),v) || fnode_is_dependent(FA2(f),v);
2140:
2141: case I_FUNC:
2142: arg = (FNODE)FA1(f);
2143: for ( t = FA0(arg); t; t = NEXT(t) )
2144: if ( fnode_is_dependent(BDY(t),v) ) return 1;
2145: return 0;
2146:
2147: default:
2148: return 0;
2149: }
1.1 noro 2150: }
1.70 noro 2151:
1.76 noro 2152: FNODE fnode_normalize_add(FNODE a1,FNODE a2,int expand);
2153: FNODE fnode_normalize_mul(FNODE a1,FNODE a2,int expand);
2154: FNODE fnode_normalize_pwr(FNODE a1,FNODE a2,int expand);
2155: FNODE fnode_normalize_mul_coef(Num c,FNODE f,int expand);
2156: FNODE fnode_expand_pwr(FNODE f,int n);
1.72 noro 2157: FNODE to_narymul(FNODE f);
2158: FNODE to_naryadd(FNODE f);
1.75 noro 2159: FNODE fnode_node_to_naryadd(NODE n);
2160: FNODE fnode_node_to_narymul(NODE n);
1.72 noro 2161: void fnode_base_exp(FNODE f,FNODE *bp,FNODE *ep);
2162: void fnode_coef_body(FNODE f,Num *cp,FNODE *bp);
2163:
2164:
1.76 noro 2165: FNODE fnode_normalize(FNODE f,int expand)
1.70 noro 2166: {
1.73 noro 2167: FNODE a1,a2,mone,r,b2;
1.72 noro 2168: NODE n;
1.70 noro 2169: Q q;
2170:
1.72 noro 2171: STOQ(-1,q);
2172: mone = mkfnode(1,I_FORMULA,q);
1.70 noro 2173: switch ( f->id ) {
2174: case I_PAREN:
1.76 noro 2175: return fnode_normalize(FA0(f),expand);
1.71 noro 2176:
2177: case I_MINUS:
1.76 noro 2178: return fnode_normalize_mul_coef((Num)q,
2179: fnode_normalize(FA0(f),expand),expand);
1.71 noro 2180:
1.70 noro 2181: case I_BOP:
2182: /* arf fnode fnode */
1.76 noro 2183: a1 = fnode_normalize(FA1(f),expand);
2184: a2 = fnode_normalize(FA2(f),expand);
1.72 noro 2185: switch ( OPNAME(f) ) {
2186: case '+':
1.76 noro 2187: return fnode_normalize_add(a1,a2,expand);
1.70 noro 2188: case '-':
1.76 noro 2189: a2 = fnode_normalize_mul_coef((Num)q,a2,expand);
2190: return fnode_normalize_add(a1,a2,expand);
1.72 noro 2191: case '*':
1.76 noro 2192: return fnode_normalize_mul(a1,a2,expand);
1.70 noro 2193: case '/':
1.76 noro 2194: a2 = fnode_normalize_pwr(a2,mone,expand);
2195: return fnode_normalize_mul(a1,a2,expand);
1.73 noro 2196: case '^':
1.76 noro 2197: return fnode_normalize_pwr(a1,a2,expand);
1.70 noro 2198: default:
1.72 noro 2199: return mkfnode(3,I_BOP,FA0(f),a1,a2);
1.70 noro 2200: }
2201: break;
1.71 noro 2202:
1.70 noro 2203: case I_NARYOP:
1.72 noro 2204: switch ( OPNAME(f) ) {
1.71 noro 2205: case '+':
1.73 noro 2206: n = (NODE)FA1(f);
1.76 noro 2207: r = fnode_normalize(BDY(n),expand); n = NEXT(n);
1.72 noro 2208: for ( ; n; n = NEXT(n) ) {
1.76 noro 2209: a1 = fnode_normalize(BDY(n),expand);
2210: r = fnode_normalize_add(r,a1,expand);
1.72 noro 2211: }
2212: return r;
1.70 noro 2213: case '*':
1.73 noro 2214: n = (NODE)FA1(f);
1.76 noro 2215: r = fnode_normalize(BDY(n),expand); n = NEXT(n);
1.72 noro 2216: for ( ; n; n = NEXT(n) ) {
1.76 noro 2217: a1 = fnode_normalize(BDY(n),expand);
2218: r = fnode_normalize_mul(r,a1,expand);
1.72 noro 2219: }
2220: return r;
1.70 noro 2221: default:
1.72 noro 2222: error("fnode_normallize : cannot happen");
1.70 noro 2223: }
1.72 noro 2224:
1.70 noro 2225: default:
1.76 noro 2226: return fnode_apply(f,fnode_normalize,expand);
1.70 noro 2227: }
2228: }
2229:
1.76 noro 2230: FNODE fnode_apply(FNODE f,FNODE (*func)(),int expand)
1.70 noro 2231: {
2232: fid_spec_p spec;
2233: FNODE r;
2234: int i,n;
2235: NODE t,t0,s;
2236:
2237: get_fid_spec(f->id,&spec);
2238: for ( n = 0; spec->type[n] != A_end; n++ );
2239: NEWFNODE(r,n); r->id = f->id;
2240: for ( i = 0; i < n; i++ ) {
2241: switch ( spec->type[i] ) {
2242: case A_fnode:
1.78 noro 2243: r->arg[i] = func(f->arg[i],expand);
1.70 noro 2244: break;
2245: case A_node:
2246: s = (NODE)f->arg[i];
2247: for ( t0 = 0; s; s = NEXT(s) ) {
2248: NEXTNODE(t0,t);
1.76 noro 2249: BDY(t) = (pointer)func((FNODE)BDY(s),expand);
1.70 noro 2250: }
2251: if ( t0 ) NEXT(t) = 0;
2252: r->arg[i] = t0;
2253: break;
2254: default:
2255: r->arg[i] = f->arg[i];
2256: break;
2257: }
2258: }
2259: return r;
2260: }
2261:
1.76 noro 2262: FNODE fnode_normalize_add(FNODE f1,FNODE f2,int expand)
1.71 noro 2263: {
1.72 noro 2264: NODE n1,n2,r0,r;
2265: FNODE b1,b2;
2266: int s;
2267: Num c1,c2,c;
2268:
1.77 noro 2269: if ( IS_ZERO(f1) ) return f2;
2270: else if ( IS_ZERO(f2) ) return f1;
1.75 noro 2271: f1 = to_naryadd(f1); f2 = to_naryadd(f2);
2272: n1 = (NODE)FA1(f1); n2 = (NODE)FA1(f2);
1.72 noro 2273: r0 = 0;
2274: while ( n1 && n2 ) {
1.75 noro 2275: fnode_coef_body(BDY(n1),&c1,&b1); fnode_coef_body(BDY(n2),&c2,&b2);
1.80 noro 2276: if ( (s = fnode_normalize_comp(b1,b2)) > 0 ) {
1.73 noro 2277: NEXTNODE(r0,r); BDY(r) = BDY(n1); n1 = NEXT(n1);
1.72 noro 2278: } else if ( s < 0 ) {
1.73 noro 2279: NEXTNODE(r0,r); BDY(r) = BDY(n2); n2 = NEXT(n2);
1.72 noro 2280: } else {
2281: addnum(0,c1,c2,&c);
2282: if ( c ) {
1.76 noro 2283: NEXTNODE(r0,r); BDY(r) = fnode_normalize_mul_coef(c,b1,expand);
1.71 noro 2284: }
1.72 noro 2285: n1 = NEXT(n1); n2 = NEXT(n2);
1.71 noro 2286: }
2287: }
1.72 noro 2288: if ( n1 )
2289: if ( r0 ) NEXT(r) = n1;
2290: else r0 = n1;
2291: else if ( n2 )
2292: if ( r0 ) NEXT(r) = n2;
2293: else r0 = n2;
2294: else if ( r0 )
2295: NEXT(r) = 0;
2296:
1.75 noro 2297: return fnode_node_to_naryadd(r0);
2298: }
2299:
2300: FNODE fnode_node_to_naryadd(NODE n)
2301: {
2302: if ( !n ) return mkfnode(1,I_FORMULA,0);
2303: else if ( !NEXT(n) ) return BDY(n);
2304: else return mkfnode(2,I_NARYOP,addfs,n);
2305: }
2306:
2307: FNODE fnode_node_to_narymul(NODE n)
2308: {
2309: if ( !n ) return mkfnode(1,I_FORMULA,ONE);
2310: else if ( !NEXT(n) ) return BDY(n);
2311: else return mkfnode(2,I_NARYOP,mulfs,n);
1.71 noro 2312: }
2313:
1.76 noro 2314: FNODE fnode_normalize_mul(FNODE f1,FNODE f2,int expand)
1.71 noro 2315: {
1.72 noro 2316: NODE n1,n2,r0,r,r1;
1.76 noro 2317: FNODE b1,b2,e1,e2,cc,t,t1;
1.72 noro 2318: FNODE *m;
2319: int s;
2320: Num c1,c2,c,e;
1.75 noro 2321: int l1,l,i,j;
1.72 noro 2322:
1.77 noro 2323: if ( IS_ZERO(f1) || IS_ZERO(f2) ) return mkfnode(1,I_FORMULA,0);
1.75 noro 2324: else if ( fnode_is_number(f1) )
1.76 noro 2325: return fnode_normalize_mul_coef((Num)eval(f1),f2,expand);
1.75 noro 2326: else if ( fnode_is_number(f2) )
1.76 noro 2327: return fnode_normalize_mul_coef((Num)eval(f2),f1,expand);
2328:
2329: if ( expand && IS_NARYADD(f1) ) {
2330: t = mkfnode(1,I_FORMULA,0);
2331: for ( n1 = (NODE)FA1(f1); n1; n1 = NEXT(n1) ) {
2332: t1 = fnode_normalize_mul(BDY(n1),f2,expand);
2333: t = fnode_normalize_add(t,t1,expand);
2334: }
2335: return t;
2336: }
2337: if ( expand && IS_NARYADD(f2) ) {
2338: t = mkfnode(1,I_FORMULA,0);
2339: for ( n2 = (NODE)FA1(f2); n2; n2 = NEXT(n2) ) {
2340: t1 = fnode_normalize_mul(f1,BDY(n2),expand);
2341: t = fnode_normalize_add(t,t1,expand);
2342: }
2343: return t;
2344: }
1.72 noro 2345:
1.75 noro 2346: fnode_coef_body(f1,&c1,&b1); fnode_coef_body(f2,&c2,&b2);
2347: mulnum(0,c1,c2,&c);
1.72 noro 2348: if ( !c ) return mkfnode(1,I_FORMULA,0);
1.71 noro 2349:
1.76 noro 2350:
1.75 noro 2351: n1 = (NODE)FA1(to_narymul(b1)); n2 = (NODE)FA1(to_narymul(b2));
2352: l1 = length(n1); l = l1+length(n2);
1.72 noro 2353: m = (FNODE *)ALLOCA(l*sizeof(FNODE));
2354: for ( r = n1, i = 0; i < l1; r = NEXT(r), i++ ) m[i] = BDY(r);
2355: for ( r = n2; r; r = NEXT(r) ) {
2356: if ( i == 0 )
2357: m[i++] = BDY(r);
2358: else {
1.75 noro 2359: fnode_base_exp(m[i-1],&b1,&e1); fnode_base_exp(BDY(r),&b2,&e2);
2360: if ( compfnode(b1,b2) ) break;
2361: addnum(0,eval(e1),eval(e2),&e);
2362: if ( !e ) i--;
2363: else if ( UNIQ(e) )
2364: m[i-1] = b1;
2365: else
2366: m[i-1] = mkfnode(3,I_BOP,pwrfs,b1,mkfnode(1,I_FORMULA,e));
1.71 noro 2367: }
2368: }
1.75 noro 2369: for ( j = i-1; j >= 0; j-- ) {
2370: MKNODE(r1,m[j],r); r = r1;
2371: }
2372: if ( !UNIQ(c) ) {
2373: cc = mkfnode(1,I_FORMULA,c); MKNODE(r1,cc,r); r = r1;
1.72 noro 2374: }
1.75 noro 2375: return fnode_node_to_narymul(r);
1.73 noro 2376: }
2377:
1.76 noro 2378: FNODE fnode_normalize_pwr(FNODE f1,FNODE f2,int expand)
1.73 noro 2379: {
2380: FNODE b,b1,e1,e,cc,r;
2381: Num c,c1;
2382: NODE arg,n;
1.76 noro 2383: Q q;
1.73 noro 2384:
1.77 noro 2385: if ( IS_ZERO(f2) ) return mkfnode(1,I_FORMULA,ONE);
2386: else if ( IS_ZERO(f1) ) return mkfnode(1,I_FORMULA,0);
1.73 noro 2387: else if ( fnode_is_one(f2) ) return f1;
2388: else if ( fnode_is_number(f1) )
2389: if ( fnode_is_integer(f2) ) {
2390: pwrnum(0,(Num)eval(f1),(Num)eval(f2),&c);
2391: return mkfnode(1,I_FORMULA,c);
2392: } else
2393: return mkfnode(3,I_BOP,pwrfs,f1,f2);
1.75 noro 2394: else if ( IS_BINARYPWR(f1) ) {
1.73 noro 2395: b1 = FA1(f1); e1 = FA2(f1);
1.76 noro 2396: e = fnode_normalize_mul(e1,f2,expand);
1.73 noro 2397: if ( fnode_is_one(e) )
2398: return b1;
2399: else
2400: return mkfnode(3,I_BOP,FA0(f1),b1,e);
1.75 noro 2401: } else if ( IS_NARYMUL(f1) && fnode_is_integer(f2) ) {
1.73 noro 2402: fnode_coef_body(f1,&c1,&b1);
1.75 noro 2403: pwrnum(0,(Num)c1,(Num)eval(f2),&c);
2404: cc = mkfnode(1,I_FORMULA,c);
1.76 noro 2405: b = fnode_normalize_pwr(b1,f2,expand);
1.75 noro 2406: if ( fnode_is_one(cc) )
2407: return b;
2408: else
2409: return fnode_node_to_narymul(mknode(2,cc,b));
1.82 noro 2410: } else if ( expand && fnode_is_integer(f2)
2411: && fnode_is_nonnegative_integer(f2) ) {
1.76 noro 2412: q = (Q)eval(f2);
2413: if ( PL(NM(q)) > 1 ) error("fnode_normalize_pwr : exponent too large");
2414: return fnode_expand_pwr(f1,QTOS(q));
1.73 noro 2415: } else
2416: return mkfnode(3,I_BOP,pwrfs,f1,f2);
1.72 noro 2417: }
2418:
1.76 noro 2419: FNODE fnode_expand_pwr(FNODE f,int n)
2420: {
2421: int n1;
2422: FNODE f1,f2;
2423:
2424: if ( !n ) return mkfnode(1,I_FORMULA,ONE);
1.77 noro 2425: else if ( IS_ZERO(f) ) return mkfnode(1,I_FORMULA,0);
1.76 noro 2426: else if ( n == 1 ) return f;
2427: else {
2428: n1 = n/2;
2429: f1 = fnode_expand_pwr(f,n1);
2430: f2 = fnode_normalize_mul(f1,f1,1);
2431: if ( n%2 ) f2 = fnode_normalize_mul(f2,f,1);
2432: return f2;
2433: }
2434: }
2435:
1.72 noro 2436: /* f = b^e */
2437: void fnode_base_exp(FNODE f,FNODE *bp,FNODE *ep)
2438: {
1.75 noro 2439: if ( IS_BINARYPWR(f) ) {
1.72 noro 2440: *bp = FA1(f); *ep = FA2(f);
2441: } else {
2442: *bp = f; *ep = mkfnode(1,I_FORMULA,ONE);
2443: }
2444: }
2445:
2446: FNODE to_naryadd(FNODE f)
2447: {
2448: FNODE r;
2449: NODE n;
2450:
1.75 noro 2451: if ( IS_NARYADD(f) ) return f;
2452:
2453: NEWFNODE(r,2); r->id = I_NARYOP;
2454: FA0(r) = addfs; MKNODE(n,f,0); FA1(r) = n;
1.72 noro 2455: return r;
2456: }
2457:
2458: FNODE to_narymul(FNODE f)
2459: {
2460: FNODE r;
2461: NODE n;
2462:
1.75 noro 2463: if ( IS_NARYMUL(f) ) return f;
2464:
2465: NEWFNODE(r,2); r->id = I_NARYOP;
2466: FA0(r) = mulfs; MKNODE(n,f,0); FA1(r) = n;
1.72 noro 2467: return r;
2468: }
2469:
1.76 noro 2470: FNODE fnode_normalize_mul_coef(Num c,FNODE f,int expand)
1.72 noro 2471: {
1.76 noro 2472: FNODE b1,cc;
1.72 noro 2473: Num c1,c2;
1.76 noro 2474: NODE n,r,r0;
1.72 noro 2475:
2476: if ( !c )
2477: return mkfnode(I_FORMULA,0);
1.75 noro 2478: else {
2479: fnode_coef_body(f,&c1,&b1);
2480: mulnum(0,c,c1,&c2);
2481: if ( UNIQ(c2) ) return b1;
2482: else {
2483: cc = mkfnode(1,I_FORMULA,c2);
2484: if ( fnode_is_number(b1) ) {
2485: if ( !fnode_is_one(b1) )
2486: error("fnode_normalize_mul_coef : cannot happen");
2487: else
2488: return cc;
1.76 noro 2489: } else if ( IS_NARYMUL(b1) ) {
1.75 noro 2490: MKNODE(n,cc,FA1(b1));
1.76 noro 2491: return fnode_node_to_narymul(n);
2492: } else if ( expand && IS_NARYADD(b1) ) {
2493: for ( r0 = 0, n = (NODE)FA1(b1); n; n = NEXT(n) ) {
2494: NEXTNODE(r0,r);
2495: BDY(r) = fnode_normalize_mul_coef(c2,BDY(n),expand);
2496: }
2497: if ( r0 ) NEXT(r) = 0;
2498: return fnode_node_to_naryadd(r0);
2499: } else
2500: return fnode_node_to_narymul(mknode(2,cc,b1));
1.72 noro 2501: }
1.71 noro 2502: }
2503: }
2504:
1.72 noro 2505: void fnode_coef_body(FNODE f,Num *cp,FNODE *bp)
1.70 noro 2506: {
1.72 noro 2507: FNODE c;
1.70 noro 2508:
1.72 noro 2509: if ( fnode_is_number(f) ) {
2510: *cp = eval(f); *bp = mkfnode(1,I_FORMULA,ONE);
1.75 noro 2511: } else if ( IS_NARYMUL(f) ) {
2512: c=(FNODE)BDY((NODE)FA1(f));
1.72 noro 2513: if ( fnode_is_number(c) ) {
2514: *cp = eval(c);
1.75 noro 2515: *bp = fnode_node_to_narymul(NEXT((NODE)FA1(f)));
1.70 noro 2516: } else {
1.72 noro 2517: *cp = (Num)ONE; *bp = f;
1.70 noro 2518: }
2519: } else {
1.72 noro 2520: *cp = (Num)ONE; *bp = f;
1.70 noro 2521: }
1.80 noro 2522: }
2523:
2524: int fnode_normalize_comp_pwr(FNODE f1,FNODE f2);
2525:
2526: int fnode_normalize_comp(FNODE f1,FNODE f2)
2527: {
2528: NODE n1,n2;
2529: int r,i1,i2;
1.82 noro 2530: char *nm1,*nm2;
1.80 noro 2531: FNODE b1,b2,e1,e2,g;
1.83 noro 2532: Num ee,ee1,c1,c2;
1.80 noro 2533:
2534: if ( IS_NARYADD(f1) || IS_NARYADD(f2) ) {
2535: f1 = to_naryadd(f1); f2 = to_naryadd(f2);
2536: n1 = (NODE)FA1(f1); n2 = (NODE)FA1(f2);
2537: while ( n1 && n2 )
2538: if ( r = fnode_normalize_comp(BDY(n1),BDY(n2)) ) return r;
2539: else {
2540: n1 = NEXT(n1); n2 = NEXT(n2);
2541: }
1.85 noro 2542: return n1?1:(n2?-1:0);
1.80 noro 2543: }
2544: if ( IS_NARYMUL(f1) || IS_NARYMUL(f2) ) {
1.83 noro 2545: fnode_coef_body(f1,&c1,&b1);
2546: fnode_coef_body(f2,&c2,&b2);
2547: if ( !compfnode(b1,b2) ) return compnum(0,c1,c2);
2548: b1 = to_narymul(b1); b2 = to_narymul(b2);
2549: n1 = (NODE)FA1(b1); n2 = (NODE)FA1(b2);
1.80 noro 2550: while ( 1 ) {
2551: while ( n1 && n2 && !compfnode(BDY(n1),BDY(n2)) ) {
2552: n1 = NEXT(n1); n2 = NEXT(n2);
2553: }
2554: if ( !n1 || !n2 ) {
1.85 noro 2555: return n1?1:(n2?-1:0);
1.80 noro 2556: }
2557: fnode_base_exp(BDY(n1),&b1,&e1);
2558: fnode_base_exp(BDY(n2),&b2,&e2);
2559:
1.83 noro 2560: if ( r = fnode_normalize_comp(b1,b2) ) {
2561: if ( r > 0 )
2562: return fnode_normalize_comp(e1,mkfnode(1,I_FORMULA,0));
2563: else if ( r < 0 )
2564: return fnode_normalize_comp(mkfnode(1,I_FORMULA,0),e2);
2565: } else {
2566: n1 = NEXT(n1); n2 = NEXT(n2);
2567: if ( fnode_is_number(e1) && fnode_is_number(e2) ) {
2568: /* f1 = t b^e1 ... , f2 = t b^e2 ... */
2569: subnum(0,eval(e1),eval(e2),&ee);
1.86 noro 2570: r = compnum(0,ee,0);
2571: if ( r > 0 ) {
1.83 noro 2572: g = mkfnode(3,I_BOP,pwrfs,b1,mkfnode(1,I_FORMULA,ee));
2573: MKNODE(n1,g,n1);
1.86 noro 2574: } else if ( r < 0 ) {
2575: chsgnnum(ee,&ee1);
2576: g = mkfnode(3,I_BOP,pwrfs,b1,mkfnode(1,I_FORMULA,ee1));
2577: MKNODE(n2,g,n2);
1.83 noro 2578: }
2579: } else {
2580: r = fnode_normalize_comp(e1,e2);
2581: if ( r > 0 ) return 1;
2582: else if ( r < 0 ) return -1;
1.80 noro 2583: }
2584: }
2585: }
2586: }
2587: if ( IS_BINARYPWR(f1) || IS_BINARYPWR(f2) )
2588: return fnode_normalize_comp_pwr(f1,f2);
2589:
2590: /* now, IDs of f1 and f2 must be I_FORMULA, I_FUNC, or I_PVAR */
2591: switch ( f1->id ) {
2592: case I_FORMULA:
2593: switch ( f2->id ) {
2594: case I_FORMULA:
2595: return arf_comp(CO,FA0(f1),FA0(f2));
2596: case I_FUNC: case I_PVAR:
2597: return -1;
2598: default:
2599: error("fnode_normalize_comp : undefined");
2600: }
2601: break;
2602: case I_FUNC:
2603: switch ( f2->id ) {
2604: case I_FORMULA:
2605: return 1;
2606: case I_FUNC:
1.82 noro 2607: nm1 = ((FUNC)FA0(f1))->name; nm2 = ((FUNC)FA0(f2))->name;
2608: r = strcmp(nm1,nm2);
2609: if ( r > 0 ) return 1;
2610: else if ( r < 0 ) return -1;
1.80 noro 2611: else {
2612: /* compare args */
2613: n1 = FA0((FNODE)FA1(f1)); n2 = FA0((FNODE)FA1(f2));
2614: while ( n1 && n2 )
1.82 noro 2615: if ( r = fnode_normalize_comp(BDY(n1),BDY(n2)) ) return r;
2616: else {
2617: n1 = NEXT(n1); n2 = NEXT(n2);
2618: }
1.85 noro 2619: return n1?1:(n2?-1:0);
1.80 noro 2620: }
2621: break;
2622: case I_PVAR:
2623: return -1;
2624: default:
2625: error("fnode_normalize_comp : undefined");
2626: }
2627: case I_PVAR:
2628: switch ( f2->id ) {
2629: case I_FORMULA: case I_FUNC:
2630: return 1;
2631: case I_PVAR:
2632: i1 = (int)FA0(f1); i2 = (int)FA0(f2);
2633: if ( i1 > i2 ) return 1;
2634: else if ( i1 < i2 ) return -1;
2635: else return 0;
2636: default:
2637: error("fnode_normalize_comp : undefined");
2638: }
2639: break;
2640: default:
2641: error("fnode_normalize_comp : undefined");
2642: }
2643: }
2644:
2645: int fnode_normalize_comp_pwr(FNODE f1,FNODE f2)
2646: {
2647: FNODE b1,b2,e1,e2;
2648: int r;
2649:
2650: fnode_base_exp(f1,&b1,&e1);
2651: fnode_base_exp(f2,&b2,&e2);
1.83 noro 2652: if ( r = fnode_normalize_comp(b1,b2) ) {
2653: if ( r > 0 )
2654: return fnode_normalize_comp(e1,mkfnode(1,I_FORMULA,0));
2655: else if ( r < 0 )
2656: return fnode_normalize_comp(mkfnode(1,I_FORMULA,0),e2);
2657: } else return fnode_normalize_comp(e1,e2);
1.70 noro 2658: }
1.87 noro 2659:
1.88 ! noro 2660: NODE append_node(NODE a1,NODE a2)
! 2661: {
! 2662: NODE t,t0;
! 2663:
! 2664: if ( !a1 )
! 2665: return a2;
! 2666: else {
! 2667: for ( t0 = 0; a1; a1 = NEXT(a1) ) {
! 2668: NEXTNODE(t0,t); BDY(t) = BDY(a1);
! 2669: }
! 2670: NEXT(t) = a2;
! 2671: return t0;
! 2672: }
! 2673: }
! 2674:
1.87 noro 2675: int fnode_normalize_unify(FNODE f,FNODE pat,NODE *rp)
2676: {
2677: NODE m,m1,m2,base,exp,fa,pa,n;
2678: LIST l;
2679: QUOTE qp,qf;
1.88 ! noro 2680: FNODE fbase,fexp,a;
1.87 noro 2681: FUNC ff,pf;
2682: int r;
2683:
2684: switch ( pat->id ) {
2685: case I_PVAR:
2686: /* [[pat,f]] */
1.88 ! noro 2687: *rp = mknode(1,mknode(2,(int)FA0(pat),f),0);
1.87 noro 2688: return 1;
2689:
2690: case I_FORMULA:
2691: if ( !arf_comp(CO,(Obj)FA0(f),(Obj)FA0(pat)) ) {
2692: *rp = 0; return 1;
2693: } else
2694: return 0;
2695:
2696: case I_BOP:
2697: /* OPNAME should be "^" */
2698: if ( !IS_BINARYPWR(pat) )
2699: error("fnode_normalize_unify : invalid BOP");
2700: if ( IS_BINARYPWR(f) ) {
2701: fbase = FA1(f); fexp = FA2(f);
2702: } else {
2703: fbase = f; fexp = mkfnode(1,I_FORMULA,ONE);
2704: }
1.88 ! noro 2705: if ( !fnode_normalize_unify(fbase,FA1(pat),&base) ) return 0;
! 2706: a = rewrite_fnode(FA2(pat),base);
! 2707: if ( !fnode_normalize_unify(fexp,a,&exp) ) return 0;
! 2708: else {
! 2709: *rp = append_node(base,exp);
! 2710: return 1;
! 2711: }
1.87 noro 2712: break;
2713:
2714: case I_FUNC:
2715: if ( f->id != I_FUNC ) return 0;
2716: ff = (FUNC)FA0(f); pf = (FUNC)FA0(pat);
2717: if ( strcmp(ff->fullname,pf->fullname) ) return 0;
2718: /* FA1(f) and FA1(pat) are I_LIST */
2719: fa = (NODE)FA0((FNODE)FA1(f));
2720: pa = (NODE)FA0((FNODE)FA1(pat));
2721: m = 0;
2722: while ( fa && pa ) {
1.88 ! noro 2723: a = rewrite_fnode(BDY(pa),m);
! 2724: if ( !fnode_normalize_unify(BDY(fa),a,&m1) ) return 0;
! 2725: m = append_node(m1,m);
! 2726: fa = NEXT(fa); pa = NEXT(pa);
1.87 noro 2727: }
2728: if ( fa || pa ) return 0;
2729: else {
2730: *rp = m;
2731: return 1;
2732: }
2733:
2734: case I_NARYOP:
2735: if ( IS_NARYADD(pat) )
2736: return fnode_normalize_unify_naryadd(f,pat,rp);
2737: else if ( IS_NARYMUL(pat) )
2738: return fnode_normalize_unify_narymul(f,pat,rp);
2739: else
2740: error("fnode_normalize_unify : invalid NARYOP");
2741: break;
2742:
2743: default:
2744: error("fnode_normalize_unify : invalid pattern");
2745: }
2746: }
2747:
1.88 ! noro 2748: /* remove i-th element */
1.87 noro 2749:
1.88 ! noro 2750: FNODE fnode_removeith_naryadd(FNODE p,int i)
! 2751: {
! 2752: int k,l;
! 2753: NODE t,r0,r,a;
! 2754:
! 2755: a = (NODE)FA1(p);
! 2756: l = length(a);
! 2757: if ( i < 0 || i >= l ) error("fnode_removeith_naryadd: invalid index");
! 2758: else if ( i == 0 )
! 2759: return fnode_node_to_naryadd(NEXT(a));
! 2760: else {
! 2761: for ( r0 = 0, k = 0, t = a; k < i; k++, t = NEXT(t) ) {
! 2762: NEXTNODE(r0,r);
! 2763: BDY(r) = BDY(t);
! 2764: }
! 2765: t = NEXT(t);
! 2766: NEXT(r) = 0;
! 2767: return fnode_node_to_naryadd(r0);
! 2768: }
! 2769:
! 2770: }
1.87 noro 2771:
1.88 ! noro 2772: /* a0,...,a(i-1) */
! 2773: FNODE fnode_left_narymul(FNODE p,int i)
1.87 noro 2774: {
1.88 ! noro 2775: int k,l;
! 2776: NODE t,r0,r,a;
! 2777:
! 2778: a = (NODE)FA1(p);
! 2779: l = length(a);
! 2780: if ( i < 0 || i >= l ) error("fnode_left_narymul : invalid index");
! 2781: if ( i == 0 ) return mkfnode(1,I_FORMULA,ONE);
! 2782: else if ( i == 1 ) return (FNODE)BDY(a);
! 2783: else {
! 2784: for ( r0 = 0, k = 0, t = a; k < i; k++, t = NEXT(t) ) {
! 2785: NEXTNODE(r0,r);
! 2786: BDY(r) = BDY(t);
! 2787: }
! 2788: NEXT(r) = 0;
! 2789: return fnode_node_to_narymul(r0);
! 2790: }
! 2791: }
! 2792:
! 2793: /* a(i+1),...,a(l-1) */
! 2794: FNODE fnode_right_narymul(FNODE p,int i)
! 2795: {
! 2796: NODE a,t;
! 2797: int l,k;
! 2798:
! 2799: a = (NODE)FA1(p);
! 2800: l = length(a);
! 2801: if ( i < 0 || i >= l ) error("fnode_right_narymul : invalid index");
! 2802: if ( i == l-1 ) return mkfnode(1,I_FORMULA,ONE);
! 2803: else {
! 2804: for ( k = 0, t = a; k <= i; k++, t = NEXT(t) );
! 2805: return fnode_node_to_narymul(t);
! 2806: }
! 2807: }
! 2808:
! 2809: int fnode_normalize_unify_naryadd(FNODE f,FNODE p,NODE *rp)
! 2810: {
! 2811: int fl,pl,fi,pi;
! 2812: NODE fa,pa,t,s,m,m1;
! 2813: FNODE fr,pr,prr,pivot;
1.87 noro 2814:
2815: f = to_naryadd(f);
1.88 ! noro 2816: fa = (NODE)FA1(f); fl = length(fa);
! 2817: pa = (NODE)FA1(p); pl = length(pa);
! 2818: if ( fl < pl ) return 0;
! 2819: else if ( pl == 1 ) {
! 2820: if ( fl == 1 )
! 2821: return fnode_normalize_unify(BDY(fa),BDY(pa),rp);
1.87 noro 2822: else
2823: return 0;
2824: } else {
1.88 ! noro 2825: for ( t = pa, pi = 0; t; t = NEXT(t), pi++ )
! 2826: if ( ((FNODE)BDY(t))->id != I_PVAR ) break;
! 2827: if ( !t ) {
! 2828: /* all are I_PVAR */
! 2829: m = 0;
! 2830: for ( t = pa, s = fa; NEXT(t); t = NEXT(t), s = NEXT(s) ) {
! 2831: fnode_normalize_unify(BDY(s),BDY(t),&m1);
! 2832: m = append_node(m1,m);
! 2833: }
! 2834: if ( !NEXT(s) )
! 2835: fr = (FNODE)BDY(s);
! 2836: else
! 2837: fr = mkfnode(2,I_NARYOP,FA0(f),s);
! 2838: fnode_normalize_unify(fr,BDY(t),&m1);
! 2839: *rp = append_node(m1,m);
! 2840: return 1;
! 2841: } else {
! 2842: pivot = (FNODE)BDY(t);
! 2843: pr = fnode_removeith_naryadd(p,pi);
! 2844: for ( s = fa, fi = 0; s; s = NEXT(s), fi++ ) {
! 2845: if ( fnode_normalize_unify(BDY(s),pivot,&m) ) {
! 2846: fr = fnode_removeith_naryadd(f,fi);
! 2847: prr = rewrite_fnode(pr,m);
! 2848: if ( fnode_normalize_unify(fr,prr,&m1) ) {
! 2849: *rp = append_node(m,m1);
! 2850: return 1;
! 2851: }
! 2852: }
! 2853: }
! 2854: return 0;
! 2855: }
1.87 noro 2856: }
2857: }
2858:
1.88 ! noro 2859: int fnode_normalize_unify_narymul(FNODE f,FNODE p,NODE *rp)
! 2860: {
! 2861: int fl,pl,fi,pi;
! 2862: NODE fa,pa,t,s,m,m1;
! 2863: FNODE fr,pr,pleft,pleft1,pright,pright1,fleft,fright,pivot;
! 2864:
! 2865: f = to_narymul(f);
! 2866: fa = (NODE)FA1(f); fl = length(fa);
! 2867: pa = (NODE)FA1(p); pl = length(pa);
! 2868: if ( fl < pl ) return 0;
! 2869: else if ( pl == 1 ) {
! 2870: if ( fl == 1 )
! 2871: return fnode_normalize_unify(BDY(fa),BDY(pa),rp);
! 2872: else
! 2873: return 0;
! 2874: } else {
! 2875: for ( t = pa, pi = 0; t; t = NEXT(t), pi++ )
! 2876: if ( ((FNODE)BDY(t))->id != I_PVAR ) break;
! 2877: if ( !t ) {
! 2878: /* all are I_PVAR */
! 2879: m = 0;
! 2880: for ( t = pa, s = fa; NEXT(t); t = NEXT(t), s = NEXT(s) ) {
! 2881: pr = rewrite_fnode(BDY(t),m);
! 2882: if ( !fnode_normalize_unify(BDY(s),pr,&m1) ) return 0;
! 2883: m = append_node(m1,m);
! 2884: }
! 2885: if ( !NEXT(s) )
! 2886: fr = (FNODE)BDY(s);
! 2887: else
! 2888: fr = mkfnode(2,I_NARYOP,FA0(f),s);
! 2889: pr = rewrite_fnode(BDY(t),m);
! 2890: if ( !fnode_normalize_unify(fr,pr,&m1) ) return 0;
! 2891: *rp = append_node(m1,m);
! 2892: return 1;
! 2893: } else {
! 2894: pivot = (FNODE)BDY(t);
! 2895: pleft = fnode_left_narymul(p,pi);
! 2896: pright = fnode_right_narymul(p,pi);
! 2897: /* XXX : incomplete */
! 2898: for ( s = fa, fi = 0; s; s = NEXT(s), fi++ ) {
! 2899: if ( fnode_normalize_unify(BDY(s),pivot,&m) ) {
! 2900: fleft = fnode_left_narymul(f,fi);
! 2901: pleft1 = rewrite_fnode(pleft,m);
! 2902: if ( fnode_normalize_unify(fleft,pleft1,&m1) ) {
! 2903: m = append_node(m1,m);
! 2904: fright = fnode_right_narymul(f,fi);
! 2905: pright1 = rewrite_fnode(pright,m);
! 2906: if ( fnode_normalize_unify(fright,pright1,&m1) ) {
! 2907: *rp = append_node(m1,m);
! 2908: return 1;
! 2909: }
! 2910: }
! 2911: }
! 2912: }
! 2913: return 0;
! 2914: }
! 2915: }
! 2916: }