1 |
< |
/* Copyright (c) 1991 Regents of the University of California */ |
1 |
> |
/* Copyright (c) 1992 Regents of the University of California */ |
2 |
|
|
3 |
|
#ifndef lint |
4 |
|
static char SCCSid[] = "$SunId$ LBL"; |
30 |
|
|
31 |
|
#include "calcomp.h" |
32 |
|
|
33 |
< |
#ifndef NHASH |
34 |
< |
#define NHASH 521 /* hash size (a prime!) */ |
33 |
> |
#ifndef NHASH |
34 |
> |
#define NHASH 521 /* hash size (a prime!) */ |
35 |
|
#endif |
36 |
|
|
37 |
< |
#define newnode() (EPNODE *)ecalloc(1, sizeof(EPNODE)) |
37 |
> |
#define hash(s) (shash(s)%NHASH) |
38 |
|
|
39 |
< |
extern char *ecalloc(), *savestr(), *strcpy(); |
39 |
> |
#define newnode() (EPNODE *)ecalloc(1, sizeof(EPNODE)) |
40 |
|
|
41 |
+ |
extern char *ecalloc(), *emalloc(), *savestr(), *strcpy(); |
42 |
+ |
|
43 |
|
static double dvalue(); |
44 |
|
|
45 |
|
long eclock = -1; /* value storage timer */ |
49 |
|
static VARDEF *hashtbl[NHASH]; /* definition list */ |
50 |
|
static int htndx; /* index for */ |
51 |
|
static VARDEF *htpos; /* ...dfirst() and */ |
52 |
< |
#ifdef OUTCHAN |
52 |
> |
#ifdef OUTCHAN |
53 |
|
static EPNODE *ochpos; /* ...dnext */ |
54 |
|
static EPNODE *outchan; |
55 |
|
#endif |
56 |
|
|
57 |
< |
#ifdef FUNCTION |
58 |
< |
EPNODE *curfunc; |
59 |
< |
#define dname(ep) ((ep)->v.kid->type == SYM ? \ |
57 |
> |
#ifdef FUNCTION |
58 |
> |
EPNODE *curfunc; |
59 |
> |
#define dname(ep) ((ep)->v.kid->type == SYM ? \ |
60 |
|
(ep)->v.kid->v.name : \ |
61 |
|
(ep)->v.kid->v.kid->v.name) |
62 |
|
#else |
63 |
< |
#define dname(ep) ((ep)->v.kid->v.name) |
63 |
> |
#define dname(ep) ((ep)->v.kid->v.name) |
64 |
|
#endif |
65 |
|
|
66 |
|
|
105 |
|
|
106 |
|
double |
107 |
|
evariable(ep) /* evaluate a variable */ |
108 |
< |
EPNODE *ep; |
108 |
> |
EPNODE *ep; |
109 |
|
{ |
110 |
|
register VARDEF *dp = ep->v.ln; |
111 |
|
|
116 |
|
varset(vname, assign, val) /* set a variable's value */ |
117 |
|
char *vname; |
118 |
|
int assign; |
119 |
< |
double val; |
119 |
> |
double val; |
120 |
|
{ |
121 |
|
char *qname; |
122 |
|
register EPNODE *ep1, *ep2; |
189 |
|
|
190 |
|
if (ctx == NULL) |
191 |
|
return(context); /* just asking */ |
192 |
+ |
while (*ctx == CNTXMARK) |
193 |
+ |
ctx++; /* skip past marks */ |
194 |
|
if (!*ctx) { |
195 |
< |
context[0] = '\0'; /* clear context */ |
195 |
> |
context[0] = '\0'; /* empty means clear context */ |
196 |
|
return(context); |
197 |
|
} |
198 |
< |
cpp = context; /* else copy it (carefully!) */ |
199 |
< |
if (*ctx != CNTXMARK) |
200 |
< |
*cpp++ = CNTXMARK; /* make sure there's a mark */ |
197 |
< |
do { |
198 |
> |
cpp = context; /* start context with mark */ |
199 |
> |
*cpp++ = CNTXMARK; |
200 |
> |
do { /* carefully copy new context */ |
201 |
|
if (cpp >= context+MAXWORD) |
202 |
|
break; /* just copy what we can */ |
203 |
|
if (isid(*ctx)) |
206 |
|
*cpp++ = '_'; ctx++; |
207 |
|
} |
208 |
|
} while (*ctx); |
209 |
+ |
while (cpp[-1] == CNTXMARK) /* cannot end in context mark */ |
210 |
+ |
cpp--; |
211 |
|
*cpp = '\0'; |
212 |
|
return(context); |
213 |
|
} |
214 |
|
|
215 |
|
|
216 |
|
char * |
217 |
+ |
pushcontext(ctx) /* push on another context */ |
218 |
+ |
char *ctx; |
219 |
+ |
{ |
220 |
+ |
extern char *strncpy(), *strcpy(); |
221 |
+ |
char oldcontext[MAXWORD+1]; |
222 |
+ |
register int n; |
223 |
+ |
|
224 |
+ |
strcpy(oldcontext, context); /* save old context */ |
225 |
+ |
setcontext(ctx); /* set new context */ |
226 |
+ |
n = strlen(context); /* tack on old */ |
227 |
+ |
if (n+strlen(oldcontext) > MAXWORD) { |
228 |
+ |
strncpy(context+n, oldcontext, MAXWORD-n); |
229 |
+ |
context[MAXWORD] = '\0'; |
230 |
+ |
} else |
231 |
+ |
strcpy(context+n, oldcontext); |
232 |
+ |
return(context); |
233 |
+ |
} |
234 |
+ |
|
235 |
+ |
|
236 |
+ |
char * |
237 |
+ |
popcontext() /* pop off top context */ |
238 |
+ |
{ |
239 |
+ |
register char *cp1, *cp2; |
240 |
+ |
|
241 |
+ |
if (!context[0]) /* nothing left to pop */ |
242 |
+ |
return(context); |
243 |
+ |
cp2 = context; /* find mark */ |
244 |
+ |
while (*++cp2 && *cp2 != CNTXMARK) |
245 |
+ |
; |
246 |
+ |
cp1 = context; /* copy tail to front */ |
247 |
+ |
while (*cp1++ = *cp2++) |
248 |
+ |
; |
249 |
+ |
return(context); |
250 |
+ |
} |
251 |
+ |
|
252 |
+ |
|
253 |
+ |
char * |
254 |
|
qualname(nam, lvl) /* get qualified name */ |
255 |
|
register char *nam; |
256 |
|
int lvl; |
257 |
|
{ |
258 |
< |
static char nambuf[MAXWORD+1]; |
258 |
> |
static char nambuf[MAXWORD+1]; |
259 |
|
register char *cp = nambuf, *cpp; |
260 |
|
/* check for explicit local */ |
261 |
|
if (*nam == CNTXMARK) |
300 |
|
register char *qn; |
301 |
|
{ |
302 |
|
while (*qn && *qn != CNTXMARK) /* find context mark */ |
303 |
< |
; |
303 |
> |
qn++; |
304 |
|
return(!strcmp(qn, context)); |
305 |
|
} |
306 |
|
|
307 |
|
|
308 |
< |
#ifdef OUTCHAN |
308 |
> |
#ifdef OUTCHAN |
309 |
|
chanout(cs) /* set output channels */ |
310 |
|
int (*cs)(); |
311 |
|
{ |
332 |
|
dremove(vp->name); |
333 |
|
else |
334 |
|
dclear(vp->name); |
335 |
< |
#ifdef OUTCHAN |
335 |
> |
#ifdef OUTCHAN |
336 |
|
if (lvl >= 1) { |
337 |
|
for (ep = outchan; ep != NULL; ep = ep->sibling) |
338 |
|
epfree(ep); |
349 |
|
register VARDEF *vp; |
350 |
|
|
351 |
|
if ((vp = varlookup(name)) == NULL) |
352 |
< |
return(NULL); |
352 |
> |
return(NULL); |
353 |
|
return(vp->def); |
354 |
|
} |
355 |
|
|
358 |
|
varlookup(name) /* look up a variable */ |
359 |
|
char *name; |
360 |
|
{ |
361 |
< |
int lvl = 0; |
361 |
> |
int lvl = 0; |
362 |
|
register char *qname; |
363 |
|
register VARDEF *vp; |
364 |
< |
/* find most qualified match */ |
364 |
> |
/* find most qualified match */ |
365 |
|
while ((qname = qualname(name, lvl++)) != NULL) |
366 |
|
for (vp = hashtbl[hash(qname)]; vp != NULL; vp = vp->next) |
367 |
|
if (!strcmp(vp->name, qname)) |
375 |
|
char *name; |
376 |
|
{ |
377 |
|
register VARDEF *vp; |
378 |
< |
LIBR *libp; |
337 |
< |
int hv; |
378 |
> |
int hv; |
379 |
|
|
380 |
|
if ((vp = varlookup(name)) != NULL) { |
381 |
|
vp->nlinks++; |
382 |
|
return(vp); |
383 |
|
} |
384 |
< |
#ifdef FUNCTION |
385 |
< |
libp = liblookup(name); |
384 |
> |
vp = (VARDEF *)emalloc(sizeof(VARDEF)); |
385 |
> |
#ifdef FUNCTION |
386 |
> |
vp->lib = liblookup(name); |
387 |
|
#else |
388 |
< |
libp = NULL; |
388 |
> |
vp->lib = NULL; |
389 |
|
#endif |
390 |
< |
if (libp == NULL) /* if name not in library */ |
390 |
> |
if (vp->lib == NULL) /* if name not in library */ |
391 |
|
name = qualname(name, 0); /* use fully qualified version */ |
392 |
|
hv = hash(name); |
351 |
– |
vp = (VARDEF *)emalloc(sizeof(VARDEF)); |
393 |
|
vp->name = savestr(name); |
394 |
|
vp->nlinks = 1; |
395 |
|
vp->def = NULL; |
355 |
– |
vp->lib = libp; |
396 |
|
vp->next = hashtbl[hv]; |
397 |
|
hashtbl[hv] = vp; |
398 |
|
return(vp); |
399 |
|
} |
400 |
|
|
401 |
|
|
402 |
+ |
#ifdef FUNCTION |
403 |
+ |
libupdate(fn) /* update library links */ |
404 |
+ |
char *fn; |
405 |
+ |
{ |
406 |
+ |
register int i; |
407 |
+ |
register VARDEF *vp; |
408 |
+ |
/* if fn is NULL then relink all */ |
409 |
+ |
for (i = 0; i < NHASH; i++) |
410 |
+ |
for (vp = hashtbl[i]; vp != NULL; vp = vp->next) |
411 |
+ |
if (vp->lib != NULL || fn == NULL || !strcmp(fn, vp->name)) |
412 |
+ |
vp->lib = liblookup(vp->name); |
413 |
+ |
} |
414 |
+ |
#endif |
415 |
+ |
|
416 |
+ |
|
417 |
|
varfree(ln) /* release link to variable */ |
418 |
< |
register VARDEF *ln; |
418 |
> |
register VARDEF *ln; |
419 |
|
{ |
420 |
|
register VARDEF *vp; |
421 |
< |
int hv; |
421 |
> |
int hv; |
422 |
|
|
423 |
|
if (--ln->nlinks > 0) |
424 |
< |
return; /* still active */ |
424 |
> |
return; /* still active */ |
425 |
|
|
426 |
|
hv = hash(ln->name); |
427 |
|
vp = hashtbl[hv]; |
428 |
|
if (vp == ln) |
429 |
< |
hashtbl[hv] = vp->next; |
429 |
> |
hashtbl[hv] = vp->next; |
430 |
|
else { |
431 |
< |
while (vp->next != ln) /* must be in list */ |
432 |
< |
vp = vp->next; |
433 |
< |
vp->next = ln->next; |
431 |
> |
while (vp->next != ln) /* must be in list */ |
432 |
> |
vp = vp->next; |
433 |
> |
vp->next = ln->next; |
434 |
|
} |
435 |
|
freestr(ln->name); |
436 |
|
efree((char *)ln); |
442 |
|
{ |
443 |
|
htndx = 0; |
444 |
|
htpos = NULL; |
445 |
< |
#ifdef OUTCHAN |
445 |
> |
#ifdef OUTCHAN |
446 |
|
ochpos = outchan; |
447 |
|
#endif |
448 |
|
return(dnext()); |
453 |
|
dnext() /* return pointer to next definition */ |
454 |
|
{ |
455 |
|
register EPNODE *ep; |
456 |
+ |
register char *nm; |
457 |
|
|
458 |
|
while (htndx < NHASH) { |
459 |
< |
if (htpos == NULL) |
460 |
< |
htpos = hashtbl[htndx++]; |
461 |
< |
while (htpos != NULL) { |
462 |
< |
ep = htpos->def; |
463 |
< |
htpos = htpos->next; |
464 |
< |
if (ep != NULL) |
465 |
< |
return(ep); |
466 |
< |
} |
459 |
> |
if (htpos == NULL) |
460 |
> |
htpos = hashtbl[htndx++]; |
461 |
> |
while (htpos != NULL) { |
462 |
> |
ep = htpos->def; |
463 |
> |
nm = htpos->name; |
464 |
> |
htpos = htpos->next; |
465 |
> |
if (ep != NULL && incontext(nm)) |
466 |
> |
return(ep); |
467 |
> |
} |
468 |
|
} |
469 |
< |
#ifdef OUTCHAN |
469 |
> |
#ifdef OUTCHAN |
470 |
|
if ((ep = ochpos) != NULL) |
471 |
< |
ochpos = ep->sibling; |
471 |
> |
ochpos = ep->sibling; |
472 |
|
return(ep); |
473 |
|
#else |
474 |
|
return(NULL); |
484 |
|
register EPNODE *dp; |
485 |
|
|
486 |
|
if ((vp = varlookup(name)) == NULL || vp->def == NULL) |
487 |
< |
return(NULL); |
487 |
> |
return(NULL); |
488 |
|
dp = vp->def; |
489 |
|
vp->def = dp->sibling; |
490 |
|
varfree(vp); |
494 |
|
|
495 |
|
dpush(nm, ep) /* push on a definition */ |
496 |
|
char *nm; |
497 |
< |
register EPNODE *ep; |
497 |
> |
register EPNODE *ep; |
498 |
|
{ |
499 |
|
register VARDEF *vp; |
500 |
|
|
504 |
|
} |
505 |
|
|
506 |
|
|
507 |
< |
#ifdef OUTCHAN |
507 |
> |
#ifdef OUTCHAN |
508 |
|
addchan(sp) /* add an output channel assignment */ |
509 |
< |
EPNODE *sp; |
509 |
> |
EPNODE *sp; |
510 |
|
{ |
511 |
< |
int ch = sp->v.kid->v.chan; |
511 |
> |
int ch = sp->v.kid->v.chan; |
512 |
|
register EPNODE *ep, *epl; |
513 |
|
|
514 |
|
for (epl = NULL, ep = outchan; ep != NULL; epl = ep, ep = ep->sibling) |
545 |
|
scan(); |
546 |
|
return; |
547 |
|
} |
548 |
< |
#ifdef OUTCHAN |
548 |
> |
#ifdef OUTCHAN |
549 |
|
if (nextc == '$') { /* channel assignment */ |
550 |
|
ep = getchan(); |
551 |
|
addchan(ep); |
554 |
|
{ /* ordinary definition */ |
555 |
|
ep = getdefn(); |
556 |
|
qname = qualname(dname(ep), 0); |
557 |
< |
#ifdef REDEFW |
557 |
> |
#ifdef REDEFW |
558 |
|
if ((vdef = varlookup(qname)) != NULL) |
559 |
|
if (vdef->def != NULL) { |
560 |
|
wputs(qname); |
563 |
|
else |
564 |
|
wputs(": redefined\n"); |
565 |
|
} |
566 |
< |
#ifdef FUNCTION |
566 |
> |
#ifdef FUNCTION |
567 |
|
else if (ep->v.kid->type == FUNC && vdef->lib != NULL) { |
568 |
|
wputs(qname); |
569 |
|
wputs(": definition hides library function\n"); |
587 |
|
EPNODE * |
588 |
|
getdefn() /* A -> SYM = E1 */ |
589 |
|
/* SYM : E1 */ |
590 |
< |
/* FUNC(SYM,..) = E1 */ |
590 |
> |
/* FUNC(SYM,..) = E1 */ |
591 |
|
/* FUNC(SYM,..) : E1 */ |
592 |
|
{ |
593 |
|
register EPNODE *ep1, *ep2; |
599 |
|
ep1->type = SYM; |
600 |
|
ep1->v.name = savestr(getname()); |
601 |
|
|
602 |
< |
#ifdef FUNCTION |
602 |
> |
#ifdef FUNCTION |
603 |
|
if (nextc == '(') { |
604 |
|
ep2 = newnode(); |
605 |
|
ep2->type = FUNC; |
632 |
|
addekid(ep2, getE1()); |
633 |
|
|
634 |
|
if ( |
635 |
< |
#ifdef FUNCTION |
636 |
< |
ep1->type == SYM && |
635 |
> |
#ifdef FUNCTION |
636 |
> |
ep1->type == SYM && |
637 |
|
#endif |
638 |
|
ep1->sibling->type != NUM) { |
639 |
|
ep1 = newnode(); |
649 |
|
} |
650 |
|
|
651 |
|
|
652 |
< |
#ifdef OUTCHAN |
652 |
> |
#ifdef OUTCHAN |
653 |
|
EPNODE * |
654 |
|
getchan() /* A -> $N = E1 */ |
655 |
|
{ |
686 |
|
static double |
687 |
|
dvalue(name, d) /* evaluate a variable */ |
688 |
|
char *name; |
689 |
< |
EPNODE *d; |
689 |
> |
EPNODE *d; |
690 |
|
{ |
691 |
|
register EPNODE *ep1, *ep2; |
692 |
|
|
707 |
|
ep2 = ep2->sibling; /* else reuse old value */ |
708 |
|
|
709 |
|
return(ep2->v.num); |
653 |
– |
} |
654 |
– |
|
655 |
– |
|
656 |
– |
static int |
657 |
– |
hash(s) /* hash a string */ |
658 |
– |
register char *s; |
659 |
– |
{ |
660 |
– |
register int rval = 0; |
661 |
– |
|
662 |
– |
while (*s) |
663 |
– |
rval += *s++; |
664 |
– |
|
665 |
– |
return(rval % NHASH); |
710 |
|
} |