![[BACK]](/icons/cvsweb/back.gif){kind=icon}
Return to eval.c CVS log ![[TXT]](/icons/cvsweb/text.gif){kind=icon}
![[DIR]](/icons/cvsweb/dir.gif){kind=icon}
Up to [local] / OpenXM_contrib2 / asir2000 / parse|
Return to eval.c CVS log | Up to [local] / OpenXM_contrib2 / asir2000 / parse |
1.3 ! noro 1: /* $OpenXM: OpenXM_contrib2/asir2000/parse/eval.c,v 1.2 2000/02/08 04:47:12 noro Exp $ */
1.1 noro 2: #include <ctype.h>
3: #include "ca.h"
4: #include "al.h"
5: #include "base.h"
6: #include "parse.h"
7: #if !defined(THINK_C)
8: #include <sys/types.h>
9: #include <sys/stat.h>
10: #endif
1.2 noro 11: #if PARI
1.1 noro 12: #include "genpari.h"
1.2 noro 13: #endif
1.1 noro 14:
15: extern jmp_buf timer_env;
16:
17: int f_break,f_return,f_continue;
18: int evalstatline;
19: int recv_intr;
20:
21: pointer bevalf(), evalmapf(), evall();
22: Obj getopt_from_cpvs();
23:
24: pointer eval(f)
25: FNODE f;
26: {
27: LIST t;
28: STRING str;
29: pointer val = 0;
30: pointer a,a1,a2;
31: NODE tn,ind;
32: R u;
33: DP dp;
34: int pv,c;
35: FNODE f1;
36: UP2 up2;
37: UP up;
38: GF2N gf2n;
39: GFPN gfpn;
40:
41: #if defined(VISUAL)
42: if ( recv_intr ) {
43: #include <signal.h>
44: if ( recv_intr == 1 ) {
45: recv_intr = 0;
46: int_handler(SIGINT);
47: } else {
48: recv_intr = 0;
49: ox_usr1_handler(0);
50: }
51: }
52: #endif
53: if ( !f )
54: return ( 0 );
55: switch ( f->id ) {
56: case I_BOP:
57: a1 = eval((FNODE)FA1(f)); a2 = eval((FNODE)FA2(f));
58: (*((ARF)FA0(f))->fp)(CO,a1,a2,&val);
59: break;
60: case I_COP:
61: a1 = eval((FNODE)FA1(f)); a2 = eval((FNODE)FA2(f));
62: c = arf_comp(CO,a1,a2);
63: switch ( (cid)FA0(f) ) {
64: case C_EQ:
65: c = (c == 0); break;
66: case C_NE:
67: c = (c != 0); break;
68: case C_GT:
69: c = (c > 0); break;
70: case C_LT:
71: c = (c < 0); break;
72: case C_GE:
73: c = (c >= 0); break;
74: case C_LE:
75: c = (c <= 0); break;
76: default:
77: c = 0; break;
78: }
79: if ( c )
80: val = (pointer)ONE;
81: break;
82: case I_AND:
83: if ( eval((FNODE)FA0(f)) && eval((FNODE)FA1(f)) )
84: val = (pointer)ONE;
85: break;
86: case I_OR:
87: if ( eval((FNODE)FA0(f)) || eval((FNODE)FA1(f)) )
88: val = (pointer)ONE;
89: break;
90: case I_NOT:
91: if ( eval((FNODE)FA0(f)) )
92: val = 0;
93: else
94: val = (pointer)ONE;
95: break;
96: case I_LOP:
97: a1 = eval((FNODE)FA1(f)); a2 = eval((FNODE)FA2(f));
98: val = evall((lid)FA0(f),a1,a2);
99: break;
100: case I_CE:
101: if ( eval((FNODE)FA0(f)) )
102: val = eval((FNODE)FA1(f));
103: else
104: val = eval((FNODE)FA2(f));
105: break;
106: case I_EV:
107: evalnodebody((NODE)FA0(f),&tn); nodetod(tn,&dp); val = (pointer)dp;
108: break;
109: case I_FUNC:
110: val = evalf((FUNC)FA0(f),(FNODE)FA1(f),0); break;
111: case I_FUNC_OPT:
112: val = evalf((FUNC)FA0(f),(FNODE)FA1(f),(FNODE)FA2(f)); break;
113: case I_PFDERIV:
114: error("eval : not implemented yet");
115: break;
116: case I_MAP:
117: val = evalmapf((FUNC)FA0(f),(FNODE)FA1(f)); break;
118: case I_IFUNC:
119: val = evalif((FNODE)FA0(f),(FNODE)FA1(f)); break;
120: #if !defined(VISUAL)
121: case I_TIMER:
122: {
123: int interval;
124: Obj expired;
125:
126: interval = QTOS((Q)eval((FNODE)FA0(f)));
127: expired = (Obj)eval((FNODE)FA2(f));
128: set_timer(interval);
129: savepvs();
130: if ( !setjmp(timer_env) )
131: val = eval((FNODE)FA1(f));
132: else {
133: val = (pointer)expired;
134: restorepvs();
135: }
136: reset_timer();
137: }
138: break;
139: #endif
140: #if 0
141: case I_PRESELF: case I_POSTSELF:
142: val = evalpv(f->id,FA1(f),FA0(f)); break;
143: case I_PVAR:
144: val = evalpv(f->id,FA0(f),0); break;
145: case I_ASSPVAR:
146: val = evalpv(f->id,FA0(f),FA1(f)); break;
147: #endif
148: #if 1
149: case I_PRESELF:
150: f1 = (FNODE)FA1(f);
151: if ( ID(f1) == I_PVAR ) {
152: pv = (int)FA0(f1); ind = (NODE)FA1(f1); GETPV(pv,a);
153: if ( !ind ) {
154: (*((ARF)FA0(f))->fp)(CO,a,ONE,&val); ASSPV(pv,val);
155: } else if ( a ) {
156: evalnodebody(ind,&tn); getarray(a,tn,(pointer *)&u);
157: (*((ARF)FA0(f))->fp)(CO,u,ONE,&val); putarray(a,tn,val);
158: }
159: } else
160: val = evalpv(f->id,(FNODE)FA1(f),FA0(f));
161: break;
162: case I_POSTSELF:
163: f1 = (FNODE)FA1(f);
164: if ( ID(f1) == I_PVAR ) {
165: pv = (int)FA0(f1); ind = (NODE)FA1(f1); GETPV(pv,val);
166: if ( !ind ) {
167: (*((ARF)FA0(f))->fp)(CO,val,ONE,&u); ASSPV(pv,u);
168: } else if ( val ) {
169: evalnodebody(ind,&tn); getarray(val,tn,&a);
170: (*((ARF)FA0(f))->fp)(CO,a,ONE,&u); putarray(val,tn,(pointer)u);
171: val = a;
172: }
173: } else
174: val = evalpv(f->id,(FNODE)FA1(f),FA0(f));
175: break;
176: case I_CAST:
177: getmember((FNODE)f,(Obj *)&val); break;
178: case I_PVAR:
179: pv = (int)FA0(f); ind = (NODE)FA1(f); GETPV(pv,a);
180: if ( !ind )
181: val = a;
182: else {
183: evalnodebody(ind,&tn); getarray(a,tn,&val);
184: }
185: break;
186: case I_ASSPVAR:
187: f1 = (FNODE)FA0(f);
188: if ( ID(f1) == I_PVAR ) {
189: pv = (int)FA0(f1); ind = (NODE)FA1(f1);
190: if ( !ind ) {
191: val = eval((FNODE)FA1(f)); ASSPV(pv,val);
192: } else {
193: GETPV(pv,a);
194: evalnodebody(ind,&tn);
195: putarray(a,tn,val = eval((FNODE)FA1(f)));
196: }
197: } else
198: val = evalpv(ID(f),(FNODE)FA0(f),FA1(f));
199: break;
200: #endif
201: case I_ANS:
202: if ( (pv =(int)FA0(f)) < (int)APVS->n )
203: val = APVS->va[pv].priv;
204: break;
205: case I_GF2NGEN:
206: NEWUP2(up2,1);
207: up2->w=1;
208: up2->b[0] = 2; /* @ */
209: MKGF2N(up2,gf2n);
210: val = (pointer)gf2n;
211: break;
212: case I_GFPNGEN:
213: up = UPALLOC(1);
214: up->d=1;
215: up->c[0] = 0;
216: up->c[1] = (Num)ONELM;
217: MKGFPN(up,gfpn);
218: val = (pointer)gfpn;
219: break;
220: case I_STR:
221: MKSTR(str,FA0(f)); val = (pointer)str; break;
222: case I_FORMULA:
223: val = FA0(f); break;
224: case I_LIST:
225: evalnodebody((NODE)FA0(f),&tn); MKLIST(t,tn); val = (pointer)t; break;
226: case I_NEWCOMP:
227: newstruct((int)FA0(f),(struct oCOMP **)&val); break;
228: case I_CAR:
229: if ( !(a = eval((FNODE)FA0(f))) || (OID(a) != O_LIST) )
230: val = 0;
231: else if ( !BDY((LIST)a) )
232: val = a;
233: else
234: val = (pointer)BDY(BDY((LIST)a));
235: break;
236: case I_CDR:
237: if ( !(a = eval((FNODE)FA0(f))) || (OID(a) != O_LIST) )
238: val = 0;
239: else if ( !BDY((LIST)a) )
240: val = a;
241: else {
242: MKLIST(t,NEXT(BDY((LIST)a))); val = (pointer)t;
243: }
244: break;
245: case I_PROC:
246: val = (pointer)FA0(f); break;
247: case I_INDEX:
248: a = eval((FNODE)FA0(f)); ind = (NODE)FA1(f);
249: evalnodebody(ind,&tn); getarray(a,tn,&val);
250: break;
251: case I_OPT:
252: MKSTR(str,(char *)FA0(f));
253: a = (pointer)eval(FA1(f));
254: tn = mknode(2,str,a);
255: MKLIST(t,tn); val = (pointer)t;
256: break;
257: case I_GETOPT:
258: val = (pointer)getopt_from_cpvs((char *)FA0(f));
259: break;
260: default:
261: error("eval : unknown id");
262: break;
263: }
264: return ( val );
265: }
266:
267: pointer evalstat(f)
268: SNODE f;
269: {
270: pointer val = 0,t,s,s1;
271: P u;
272: NODE tn;
273: int i,ac;
274: V *a;
275: char *buf;
276:
277: if ( !f )
278: return ( 0 );
279: if ( nextbp && nextbplevel <= 0 && f->id != S_CPLX ) {
280: nextbp = 0;
281: bp(f);
282: }
283: evalstatline = f->ln;
284:
285: switch ( f->id ) {
286: case S_BP:
287: if ( !nextbp && (!FA1(f) || eval((FNODE)FA1(f))) ) {
288: if ( (FNODE)FA2(f) ) {
289: #if PARI
290: pari_outfile = stderr;
291: #endif
292: asir_out = stderr;
293: printexpr(CO,eval((FNODE)FA2(f)));
294: putc('\n',asir_out); fflush(asir_out);
295: #if PARI
296: pari_outfile = stdout;
297: #endif
298: asir_out = stdout;
299: } else {
300: nextbp = 1; nextbplevel = 0;
301: }
302: }
303: val = evalstat((SNODE)FA0(f));
304: break;
305: case S_PFDEF:
306: ac = argc(FA1(f)); a = (V *)MALLOC(ac*sizeof(V));
307: s = eval((FNODE)FA2(f));
308: buf = (char *)ALLOCA(BUFSIZ);
309: for ( i = 0, tn = (NODE)FA1(f); tn; tn = NEXT(tn), i++ ) {
310: t = eval((FNODE)tn->body); sprintf(buf,"_%s",NAME(VR((P)t)));
311: makevar(buf,&u); a[i] = VR(u);
312: substr(CO,0,(Obj)s,VR((P)t),(Obj)u,(Obj *)&s1); s = s1;
313: }
314: mkpf((char *)FA0(f),(Obj)s,ac,a,0,0,0,(PF *)&val); val = 0; break;
315: case S_SINGLE:
316: val = eval((FNODE)FA0(f)); break;
317: case S_CPLX:
318: for ( tn = (NODE)FA0(f); tn; tn = NEXT(tn) ) {
319: if ( BDY(tn) )
320: val = evalstat((SNODE)BDY(tn));
321: if ( f_break || f_return || f_continue )
322: break;
323: }
324: break;
325: case S_BREAK:
326: if ( GPVS != CPVS )
327: f_break = 1;
328: break;
329: case S_CONTINUE:
330: if ( GPVS != CPVS )
331: f_continue = 1;
332: break;
333: case S_RETURN:
334: if ( GPVS != CPVS ) {
335: val = eval((FNODE)FA0(f)); f_return = 1;
336: }
337: break;
338: case S_IFELSE:
339: if ( evalnode((NODE)FA1(f)) )
340: val = evalstat((SNODE)FA2(f));
341: else if ( FA3(f) )
342: val = evalstat((SNODE)FA3(f));
343: break;
344: case S_FOR:
345: evalnode((NODE)FA1(f));
346: while ( 1 ) {
347: if ( !evalnode((NODE)FA2(f)) )
348: break;
349: val = evalstat((SNODE)FA4(f));
350: if ( f_break || f_return )
351: break;
352: f_continue = 0;
353: evalnode((NODE)FA3(f));
354: }
355: f_break = 0; break;
356: case S_DO:
357: while ( 1 ) {
358: val = evalstat((SNODE)FA1(f));
359: if ( f_break || f_return )
360: break;
361: f_continue = 0;
362: if ( !evalnode((NODE)FA2(f)) )
363: break;
364: }
365: f_break = 0; break;
366: default:
367: error("evalstat : unknown id");
368: break;
369: }
370: return ( val );
371: }
372:
373: pointer evalnode(node)
374: NODE node;
375: {
376: NODE tn;
377: pointer val;
378:
379: for ( tn = node, val = 0; tn; tn = NEXT(tn) )
380: if ( BDY(tn) )
381: val = eval((FNODE)BDY(tn));
382: return ( val );
383: }
384:
385: extern FUNC cur_binf;
386: extern NODE PVSS;
387:
388: pointer evalf(f,a,opt)
389: FUNC f;
390: FNODE a;
391: FNODE opt;
392: {
393: LIST args;
394: pointer val;
395: int i,n,level;
396: NODE tn,sn,opts;
397: VS pvs;
398: char errbuf[BUFSIZ];
399:
400: if ( f->id == A_UNDEF ) {
401: sprintf(errbuf,"evalf : %s undefined",NAME(f));
402: error(errbuf);
403: }
404: if ( f->id != A_PARI ) {
405: for ( i = 0, tn = a?(NODE)FA0(a):0; tn; i++, tn = NEXT(tn) );
406: if ( ((n = f->argc)>= 0 && i != n) || (n < 0 && i > -n) ) {
407: sprintf(errbuf,"evalf : argument mismatch in %s()",NAME(f));
408: error(errbuf);
409: }
410: }
411: switch ( f->id ) {
412: case A_BIN:
413: if ( !n ) {
414: cur_binf = f;
415: (*f->f.binf)(&val);
416: } else {
417: args = (LIST)eval(a);
418: cur_binf = f;
419: (*f->f.binf)(args?BDY(args):0,&val);
420: }
421: cur_binf = 0;
422: break;
423: case A_PARI:
424: args = (LIST)eval(a);
425: cur_binf = f;
426: val = evalparif(f,args?BDY(args):0);
427: cur_binf = 0;
428: break;
429: case A_USR:
430: args = (LIST)eval(a);
431: if ( opt )
432: opts = BDY((LIST)eval(opt));
433: else
434: opts = 0;
435: pvs = f->f.usrf->pvs;
436: if ( PVSS ) {
437: ((VS)BDY(PVSS))->at = evalstatline;
438: level = ((VS)BDY(PVSS))->level+1;
439: } else
440: level = 1;
441: MKNODE(tn,pvs,PVSS); PVSS = tn;
442: CPVS = (VS)ALLOCA(sizeof(struct oVS)); BDY(PVSS) = (pointer)CPVS;
443: CPVS->usrf = f; CPVS->n = CPVS->asize = pvs->n;
444: CPVS->level = level;
445: CPVS->opt = opts;
446: if ( CPVS->n ) {
447: CPVS->va = (struct oPV *)ALLOCA(CPVS->n*sizeof(struct oPV));
448: bcopy((char *)pvs->va,(char *)CPVS->va,
449: (int)(pvs->n*sizeof(struct oPV)));
450: }
451: if ( nextbp )
452: nextbplevel++;
453: for ( tn = f->f.usrf->args, sn = BDY(args);
454: sn; tn = NEXT(tn), sn = NEXT(sn) )
455: ASSPV((int)FA0((FNODE)BDY(tn)),BDY(sn));
456: val = evalstat((SNODE)BDY(f->f.usrf));
457: f_return = f_break = f_continue = 0; poppvs();
458: break;
459: case A_PURE:
460: args = (LIST)eval(a);
461: val = evalpf(f->f.puref,args?BDY(args):0);
462: break;
463: default:
464: sprintf(errbuf,"evalf : %s undefined",NAME(f));
465: error(errbuf);
466: break;
467: }
468: return val;
469: }
470:
471: pointer evalmapf(f,a)
472: FUNC f;
473: FNODE a;
474: {
475: LIST args;
476: NODE node,rest,t,n,r,r0;
477: Obj head;
478: VECT v,rv;
479: MAT m,rm;
480: LIST rl;
481: int len,row,col,i,j;
482: pointer val;
483:
484: args = (LIST)eval(a);
485: node = BDY(args); head = (Obj)BDY(node); rest = NEXT(node);
1.3 ! noro 486: if ( !head ) {
! 487: val = bevalf(f,node);
! 488: return val;
! 489: }
1.1 noro 490: switch ( OID(head) ) {
491: case O_VECT:
492: v = (VECT)head; len = v->len; MKVECT(rv,len);
493: for ( i = 0; i < len; i++ ) {
494: MKNODE(t,BDY(v)[i],rest); BDY(rv)[i] = bevalf(f,t);
495: }
496: val = (pointer)rv;
497: break;
498: case O_MAT:
499: m = (MAT)head; row = m->row; col = m->col; MKMAT(rm,row,col);
500: for ( i = 0; i < row; i++ )
501: for ( j = 0; j < col; j++ ) {
502: MKNODE(t,BDY(m)[i][j],rest); BDY(rm)[i][j] = bevalf(f,t);
503: }
504: val = (pointer)rm;
505: break;
506: case O_LIST:
507: n = BDY((LIST)head);
508: for ( r0 = r = 0; n; n = NEXT(n) ) {
509: NEXTNODE(r0,r); MKNODE(t,BDY(n),rest); BDY(r) = bevalf(f,t);
510: }
511: if ( r0 )
512: NEXT(r) = 0;
513: MKLIST(rl,r0);
514: val = (pointer)rl;
515: break;
516: default:
517: val = bevalf(f,node);
518: break;
519: }
520: return val;
521: }
522:
523: pointer bevalf(f,a)
524: FUNC f;
525: NODE a;
526: {
527: pointer val;
528: int i,n;
529: NODE tn,sn;
530: VS pvs;
531: struct oLIST list;
532: struct oFNODE fnode;
533: char errbuf[BUFSIZ];
534:
535: if ( f->id == A_UNDEF ) {
536: sprintf(errbuf,"bevalf : %s undefined",NAME(f));
537: error(errbuf);
538: }
539: if ( f->id != A_PARI ) {
540: for ( i = 0, tn = a; tn; i++, tn = NEXT(tn) );
541: if ( ((n = f->argc)>= 0 && i != n) || (n < 0 && i > -n) ) {
542: sprintf(errbuf,"bevalf : argument mismatch in %s()",NAME(f));
543: error(errbuf);
544: }
545: }
546: switch ( f->id ) {
547: case A_BIN:
548: if ( !n ) {
549: cur_binf = f;
550: (*f->f.binf)(&val);
551: } else {
552: cur_binf = f;
553: (*f->f.binf)(a,&val);
554: }
555: cur_binf = 0;
556: break;
557: case A_PARI:
558: cur_binf = f;
559: val = evalparif(f,a);
560: cur_binf = 0;
561: break;
562: case A_USR:
563: pvs = f->f.usrf->pvs;
564: if ( PVSS )
565: ((VS)BDY(PVSS))->at = evalstatline;
566: MKNODE(tn,pvs,PVSS); PVSS = tn;
567: CPVS = (VS)ALLOCA(sizeof(struct oVS)); BDY(PVSS) = (pointer)CPVS;
568: CPVS->usrf = f; CPVS->n = CPVS->asize = pvs->n;
569: CPVS->opt = 0;
570: if ( CPVS->n ) {
571: CPVS->va = (struct oPV *)ALLOCA(CPVS->n*sizeof(struct oPV));
572: bcopy((char *)pvs->va,(char *)CPVS->va,
573: (int)(pvs->n*sizeof(struct oPV)));
574: }
575: if ( nextbp )
576: nextbplevel++;
577: for ( tn = f->f.usrf->args, sn = a;
578: sn; tn = NEXT(tn), sn = NEXT(sn) )
579: ASSPV((int)FA0((FNODE)BDY(tn)),BDY(sn));
580: val = evalstat((SNODE)BDY(f->f.usrf));
581: f_return = f_break = f_continue = 0; poppvs();
582: break;
583: case A_PURE:
584: val = evalpf(f->f.puref,a);
585: break;
586: default:
587: sprintf(errbuf,"bevalf : %s undefined",NAME(f));
588: error(errbuf);
589: break;
590: }
591: return val;
592: }
593:
594: pointer evalif(f,a)
595: FNODE f,a;
596: {
597: Obj g;
598:
599: g = (Obj)eval(f);
600: if ( g && (OID(g) == O_P) && (VR((P)g)->attr == (pointer)V_SR) )
601: return evalf((FUNC)VR((P)g)->priv,a,0);
602: else {
603: error("invalid function pointer");
604: }
605: }
606:
607: pointer evalpf(pf,args)
608: PF pf;
609: NODE args;
610: {
611: Obj s,s1;
612: int i;
613: NODE node;
614: PFINS ins;
615: PFAD ad;
616: char errbuf[BUFSIZ];
617:
618: if ( !pf->body ) {
619: ins = (PFINS)CALLOC(1,sizeof(PF)+pf->argc*sizeof(struct oPFAD));
620: ins->pf = pf;
621: for ( i = 0, node = args, ad = ins->ad;
622: node; node = NEXT(node), i++ ) {
623: ad[i].d = 0; ad[i].arg = (Obj)node->body;
624: }
625: simplify_ins(ins,&s);
626: } else {
627: for ( i = 0, s = pf->body, node = args;
628: node; node = NEXT(node), i++ ) {
629: substr(CO,0,s,pf->args[i],(Obj)node->body,&s1); s = s1;
630: }
631: }
632: return (pointer)s;
633: }
634:
635: void evalnodebody(sn,dnp)
636: NODE sn;
637: NODE *dnp;
638: {
639: NODE n,n0,tn;
640: int line;
641:
642: if ( !sn ) {
643: *dnp = 0;
644: return;
645: }
646: line = evalstatline;
647: for ( tn = sn, n0 = 0; tn; tn = NEXT(tn) ) {
648: NEXTNODE(n0,n);
649: BDY(n) = eval((FNODE)BDY(tn));
650: evalstatline = line;
651: }
652: NEXT(n) = 0; *dnp = n0;
653: }
654:
655: void searchf(fn,name,r)
656: NODE fn;
657: char *name;
658: FUNC *r;
659: {
660: NODE tn;
661:
662: for ( tn = fn;
663: tn && strcmp(NAME((FUNC)BDY(tn)),name); tn = NEXT(tn) );
664: if ( tn ) {
665: *r = (FUNC)BDY(tn);
666: return;
667: }
668: *r = 0;
669: }
670:
671: void appenduf(name,r)
672: char *name;
673: FUNC *r;
674: {
675: NODE tn;
676: FUNC f;
677:
678: f=(FUNC)MALLOC(sizeof(struct oFUNC));
679: f->name = name; f->id = A_UNDEF; f->argc = 0; f->f.binf = 0;
680: MKNODE(tn,f,usrf); usrf = tn;
681: *r = f;
682: }
683:
684: void mkparif(name,r)
685: char *name;
686: FUNC *r;
687: {
688: FUNC f;
689:
690: *r = f =(FUNC)MALLOC(sizeof(struct oFUNC));
691: f->name = name; f->id = A_PARI; f->argc = 0; f->f.binf = 0;
692: }
693:
694: void mkuf(name,fname,args,body,startl,endl,desc)
695: char *name,*fname;
696: NODE args;
697: SNODE body;
698: int startl,endl;
699: char *desc;
700: {
701: FUNC f;
702: USRF t;
703: NODE sn,tn;
704: FNODE fn;
705: int argc;
706:
707: searchf(sysf,name,&f);
708: if ( f ) {
709: fprintf(stderr,"def : builtin function %s() cannot be redefined.\n",name);
710: CPVS = GPVS; return;
711: }
712: for ( argc = 0, sn = args; sn; argc++, sn = NEXT(sn) ) {
713: fn = (FNODE)BDY(sn);
714: if ( !fn || ID(fn) != I_PVAR ) {
715: fprintf(stderr,"illegal argument in %s()\n",name);
716: CPVS = GPVS; return;
717: }
718: }
719: for ( sn = usrf; sn && strcmp(NAME((FUNC)BDY(sn)),name); sn = NEXT(sn) );
720: if ( sn )
721: f = (FUNC)BDY(sn);
722: else {
723: f=(FUNC)MALLOC(sizeof(struct oFUNC));
724: f->name = name;
725: MKNODE(tn,f,usrf); usrf = tn;
726: }
727: if ( Verbose && f->id != A_UNDEF )
728: fprintf(stderr,"Warning : %s() redefined.\n",name);
729: /* else
730: fprintf(stderr,"%s() defined.\n",name); */
731: t=(USRF)MALLOC(sizeof(struct oUSRF));
732: t->args=args; BDY(t)=body; t->pvs = CPVS; t->fname = fname;
733: t->startl = startl; t->endl = endl; t->vol = asir_infile->vol;
734: t->desc = desc;
735: f->id = A_USR; f->argc = argc; f->f.usrf = t;
736: CPVS = GPVS;
737: clearbp(f);
738: }
739:
740: /*
741: retrieve value of an option whose key matches 'key'
742: CVS->opt is a list(node) of key-value pair (list)
743: CVS->opt = BDY([[key,value],[key,value],...])
744: */
745:
746: Obj getopt_from_cpvs(key)
747: char *key;
748: {
749: NODE opts,opt;
750: Obj value;
751: extern Obj VOIDobj;
752:
753: opts = CPVS->opt;
754: for ( ; opts; opts = NEXT(opts) ) {
755: opt = BDY((LIST)BDY(opts));
756: if ( !strcmp(key,BDY((STRING)BDY(opt))) )
757: return (Obj)BDY(NEXT(opt));
758: }
759: return VOIDobj;
760:
761: }