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