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