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 */ |
45 |
> |
unsigned long eclock = 0; /* value storage timer */ |
46 |
|
|
47 |
< |
static char context[MAXWORD]; /* current context path */ |
47 |
> |
static char context[MAXWORD+1]; /* current context path */ |
48 |
|
|
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 = NULL; |
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 */ |
201 |
< |
do { |
202 |
< |
if (cpp >= context+MAXWORD-1) { |
199 |
< |
*cpp = '\0'; |
200 |
< |
wputs(context); |
201 |
< |
wputs(": context path too long\n"); |
202 |
< |
return(NULL); |
203 |
< |
} |
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)) |
204 |
|
*cpp++ = *ctx++; |
205 |
|
else { |
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]; |
258 |
> |
static char nambuf[MAXWORD+1]; |
259 |
|
register char *cp = nambuf, *cpp; |
260 |
|
/* check for explicit local */ |
261 |
|
if (*nam == CNTXMARK) |
267 |
|
return(lvl > 0 ? NULL : nam); |
268 |
|
/* copy name to static buffer */ |
269 |
|
while (*nam) { |
270 |
< |
if (cp >= nambuf+MAXWORD-1) |
270 |
> |
if (cp >= nambuf+MAXWORD) |
271 |
|
goto toolong; |
272 |
|
*cp++ = *nam++; |
273 |
|
} |
286 |
|
; |
287 |
|
} |
288 |
|
while (*cpp) { /* copy context to static buffer */ |
289 |
< |
if (cp >= nambuf+MAXWORD-1) |
289 |
> |
if (cp >= nambuf+MAXWORD) |
290 |
|
goto toolong; |
291 |
|
*cp++ = *cpp++; |
292 |
|
} |
255 |
– |
*cp = '\0'; |
256 |
– |
return(nambuf); /* return qualified name */ |
293 |
|
toolong: |
294 |
|
*cp = '\0'; |
295 |
< |
eputs(nambuf); |
260 |
< |
eputs(": name too long\n"); |
261 |
< |
quit(1); |
295 |
> |
return(nambuf); /* return qualified name */ |
296 |
|
} |
297 |
|
|
298 |
|
|
299 |
|
incontext(qn) /* is qualified name in current context? */ |
300 |
|
register char *qn; |
301 |
|
{ |
302 |
+ |
if (!context[0]) /* global context accepts all */ |
303 |
+ |
return(1); |
304 |
|
while (*qn && *qn != CNTXMARK) /* find context mark */ |
305 |
< |
; |
305 |
> |
qn++; |
306 |
|
return(!strcmp(qn, context)); |
307 |
|
} |
308 |
|
|
309 |
|
|
310 |
< |
#ifdef OUTCHAN |
310 |
> |
#ifdef OUTCHAN |
311 |
|
chanout(cs) /* set output channels */ |
312 |
|
int (*cs)(); |
313 |
|
{ |
329 |
|
/* if context is global, clear all */ |
330 |
|
for (i = 0; i < NHASH; i++) |
331 |
|
for (vp = hashtbl[i]; vp != NULL; vp = vp->next) |
332 |
< |
if (!context[0] || incontext(vp->name)) |
332 |
> |
if (incontext(vp->name)) |
333 |
|
if (lvl >= 2) |
334 |
|
dremove(vp->name); |
335 |
|
else |
336 |
|
dclear(vp->name); |
337 |
< |
#ifdef OUTCHAN |
337 |
> |
#ifdef OUTCHAN |
338 |
|
if (lvl >= 1) { |
339 |
|
for (ep = outchan; ep != NULL; ep = ep->sibling) |
340 |
|
epfree(ep); |
351 |
|
register VARDEF *vp; |
352 |
|
|
353 |
|
if ((vp = varlookup(name)) == NULL) |
354 |
< |
return(NULL); |
354 |
> |
return(NULL); |
355 |
|
return(vp->def); |
356 |
|
} |
357 |
|
|
360 |
|
varlookup(name) /* look up a variable */ |
361 |
|
char *name; |
362 |
|
{ |
363 |
< |
int lvl = 0; |
363 |
> |
int lvl = 0; |
364 |
|
register char *qname; |
365 |
|
register VARDEF *vp; |
366 |
< |
/* find most qualified match */ |
366 |
> |
/* find most qualified match */ |
367 |
|
while ((qname = qualname(name, lvl++)) != NULL) |
368 |
|
for (vp = hashtbl[hash(qname)]; vp != NULL; vp = vp->next) |
369 |
|
if (!strcmp(vp->name, qname)) |
377 |
|
char *name; |
378 |
|
{ |
379 |
|
register VARDEF *vp; |
380 |
< |
LIBR *libp; |
345 |
< |
int hv; |
380 |
> |
int hv; |
381 |
|
|
382 |
|
if ((vp = varlookup(name)) != NULL) { |
383 |
|
vp->nlinks++; |
384 |
|
return(vp); |
385 |
|
} |
386 |
< |
#ifdef FUNCTION |
387 |
< |
libp = liblookup(name); |
386 |
> |
vp = (VARDEF *)emalloc(sizeof(VARDEF)); |
387 |
> |
#ifdef FUNCTION |
388 |
> |
vp->lib = liblookup(name); |
389 |
|
#else |
390 |
< |
libp = NULL; |
390 |
> |
vp->lib = NULL; |
391 |
|
#endif |
392 |
< |
if (libp == NULL) /* if name not in library */ |
392 |
> |
if (vp->lib == NULL) /* if name not in library */ |
393 |
|
name = qualname(name, 0); /* use fully qualified version */ |
394 |
|
hv = hash(name); |
359 |
– |
vp = (VARDEF *)emalloc(sizeof(VARDEF)); |
395 |
|
vp->name = savestr(name); |
396 |
|
vp->nlinks = 1; |
397 |
|
vp->def = NULL; |
363 |
– |
vp->lib = libp; |
398 |
|
vp->next = hashtbl[hv]; |
399 |
|
hashtbl[hv] = vp; |
400 |
|
return(vp); |
401 |
|
} |
402 |
|
|
403 |
|
|
404 |
+ |
#ifdef FUNCTION |
405 |
+ |
libupdate(fn) /* update library links */ |
406 |
+ |
char *fn; |
407 |
+ |
{ |
408 |
+ |
register int i; |
409 |
+ |
register VARDEF *vp; |
410 |
+ |
/* if fn is NULL then relink all */ |
411 |
+ |
for (i = 0; i < NHASH; i++) |
412 |
+ |
for (vp = hashtbl[i]; vp != NULL; vp = vp->next) |
413 |
+ |
if (vp->lib != NULL || fn == NULL || !strcmp(fn, vp->name)) |
414 |
+ |
vp->lib = liblookup(vp->name); |
415 |
+ |
} |
416 |
+ |
#endif |
417 |
+ |
|
418 |
+ |
|
419 |
|
varfree(ln) /* release link to variable */ |
420 |
< |
register VARDEF *ln; |
420 |
> |
register VARDEF *ln; |
421 |
|
{ |
422 |
|
register VARDEF *vp; |
423 |
< |
int hv; |
423 |
> |
int hv; |
424 |
|
|
425 |
|
if (--ln->nlinks > 0) |
426 |
< |
return; /* still active */ |
426 |
> |
return; /* still active */ |
427 |
|
|
428 |
|
hv = hash(ln->name); |
429 |
|
vp = hashtbl[hv]; |
430 |
|
if (vp == ln) |
431 |
< |
hashtbl[hv] = vp->next; |
431 |
> |
hashtbl[hv] = vp->next; |
432 |
|
else { |
433 |
< |
while (vp->next != ln) /* must be in list */ |
434 |
< |
vp = vp->next; |
435 |
< |
vp->next = ln->next; |
433 |
> |
while (vp->next != ln) /* must be in list */ |
434 |
> |
vp = vp->next; |
435 |
> |
vp->next = ln->next; |
436 |
|
} |
437 |
|
freestr(ln->name); |
438 |
|
efree((char *)ln); |
444 |
|
{ |
445 |
|
htndx = 0; |
446 |
|
htpos = NULL; |
447 |
< |
#ifdef OUTCHAN |
447 |
> |
#ifdef OUTCHAN |
448 |
|
ochpos = outchan; |
449 |
|
#endif |
450 |
|
return(dnext()); |
455 |
|
dnext() /* return pointer to next definition */ |
456 |
|
{ |
457 |
|
register EPNODE *ep; |
458 |
+ |
register char *nm; |
459 |
|
|
460 |
|
while (htndx < NHASH) { |
461 |
< |
if (htpos == NULL) |
462 |
< |
htpos = hashtbl[htndx++]; |
463 |
< |
while (htpos != NULL) { |
464 |
< |
ep = htpos->def; |
465 |
< |
htpos = htpos->next; |
466 |
< |
if (ep != NULL) |
467 |
< |
return(ep); |
468 |
< |
} |
461 |
> |
if (htpos == NULL) |
462 |
> |
htpos = hashtbl[htndx++]; |
463 |
> |
while (htpos != NULL) { |
464 |
> |
ep = htpos->def; |
465 |
> |
nm = htpos->name; |
466 |
> |
htpos = htpos->next; |
467 |
> |
if (ep != NULL && incontext(nm)) |
468 |
> |
return(ep); |
469 |
> |
} |
470 |
|
} |
471 |
< |
#ifdef OUTCHAN |
471 |
> |
#ifdef OUTCHAN |
472 |
|
if ((ep = ochpos) != NULL) |
473 |
< |
ochpos = ep->sibling; |
473 |
> |
ochpos = ep->sibling; |
474 |
|
return(ep); |
475 |
|
#else |
476 |
|
return(NULL); |
486 |
|
register EPNODE *dp; |
487 |
|
|
488 |
|
if ((vp = varlookup(name)) == NULL || vp->def == NULL) |
489 |
< |
return(NULL); |
489 |
> |
return(NULL); |
490 |
|
dp = vp->def; |
491 |
|
vp->def = dp->sibling; |
492 |
|
varfree(vp); |
496 |
|
|
497 |
|
dpush(nm, ep) /* push on a definition */ |
498 |
|
char *nm; |
499 |
< |
register EPNODE *ep; |
499 |
> |
register EPNODE *ep; |
500 |
|
{ |
501 |
|
register VARDEF *vp; |
502 |
|
|
506 |
|
} |
507 |
|
|
508 |
|
|
509 |
< |
#ifdef OUTCHAN |
509 |
> |
#ifdef OUTCHAN |
510 |
|
addchan(sp) /* add an output channel assignment */ |
511 |
< |
EPNODE *sp; |
511 |
> |
EPNODE *sp; |
512 |
|
{ |
513 |
< |
int ch = sp->v.kid->v.chan; |
513 |
> |
int ch = sp->v.kid->v.chan; |
514 |
|
register EPNODE *ep, *epl; |
515 |
|
|
516 |
|
for (epl = NULL, ep = outchan; ep != NULL; epl = ep, ep = ep->sibling) |
547 |
|
scan(); |
548 |
|
return; |
549 |
|
} |
550 |
< |
#ifdef OUTCHAN |
550 |
> |
#ifdef OUTCHAN |
551 |
|
if (nextc == '$') { /* channel assignment */ |
552 |
|
ep = getchan(); |
553 |
|
addchan(ep); |
556 |
|
{ /* ordinary definition */ |
557 |
|
ep = getdefn(); |
558 |
|
qname = qualname(dname(ep), 0); |
559 |
< |
#ifdef REDEFW |
559 |
> |
#ifdef REDEFW |
560 |
|
if ((vdef = varlookup(qname)) != NULL) |
561 |
< |
if (vdef->def != NULL) { |
561 |
> |
if (vdef->def != NULL && epcmp(ep, vdef->def)) { |
562 |
|
wputs(qname); |
563 |
|
if (vdef->def->type == ':') |
564 |
|
wputs(": redefined constant expression\n"); |
565 |
|
else |
566 |
|
wputs(": redefined\n"); |
567 |
|
} |
568 |
< |
#ifdef FUNCTION |
568 |
> |
#ifdef FUNCTION |
569 |
|
else if (ep->v.kid->type == FUNC && vdef->lib != NULL) { |
570 |
|
wputs(qname); |
571 |
|
wputs(": definition hides library function\n"); |
589 |
|
EPNODE * |
590 |
|
getdefn() /* A -> SYM = E1 */ |
591 |
|
/* SYM : E1 */ |
592 |
< |
/* FUNC(SYM,..) = E1 */ |
592 |
> |
/* FUNC(SYM,..) = E1 */ |
593 |
|
/* FUNC(SYM,..) : E1 */ |
594 |
|
{ |
595 |
|
register EPNODE *ep1, *ep2; |
596 |
|
|
597 |
< |
if (!isalpha(nextc)) |
597 |
> |
if (!isalpha(nextc) && nextc != CNTXMARK) |
598 |
|
syntax("illegal variable name"); |
599 |
|
|
600 |
|
ep1 = newnode(); |
601 |
|
ep1->type = SYM; |
602 |
|
ep1->v.name = savestr(getname()); |
603 |
|
|
604 |
< |
#ifdef FUNCTION |
604 |
> |
#ifdef FUNCTION |
605 |
|
if (nextc == '(') { |
606 |
|
ep2 = newnode(); |
607 |
|
ep2->type = FUNC; |
620 |
|
syntax("')' expected"); |
621 |
|
scan(); |
622 |
|
curfunc = ep1; |
623 |
< |
} else |
573 |
< |
curfunc = NULL; |
623 |
> |
} |
624 |
|
#endif |
625 |
|
|
626 |
|
if (nextc != '=' && nextc != ':') |
633 |
|
addekid(ep2, getE1()); |
634 |
|
|
635 |
|
if ( |
636 |
< |
#ifdef FUNCTION |
637 |
< |
ep1->type == SYM && |
636 |
> |
#ifdef FUNCTION |
637 |
> |
ep1->type == SYM && |
638 |
|
#endif |
639 |
|
ep1->sibling->type != NUM) { |
640 |
|
ep1 = newnode(); |
641 |
|
ep1->type = TICK; |
642 |
< |
ep1->v.tick = -1; |
642 |
> |
ep1->v.tick = 0; |
643 |
|
addekid(ep2, ep1); |
644 |
|
ep1 = newnode(); |
645 |
|
ep1->type = NUM; |
646 |
|
addekid(ep2, ep1); |
647 |
|
} |
648 |
|
|
649 |
+ |
#ifdef FUNCTION |
650 |
+ |
curfunc = NULL; |
651 |
+ |
#endif |
652 |
+ |
|
653 |
|
return(ep2); |
654 |
|
} |
655 |
|
|
656 |
|
|
657 |
< |
#ifdef OUTCHAN |
657 |
> |
#ifdef OUTCHAN |
658 |
|
EPNODE * |
659 |
|
getchan() /* A -> $N = E1 */ |
660 |
|
{ |
691 |
|
static double |
692 |
|
dvalue(name, d) /* evaluate a variable */ |
693 |
|
char *name; |
694 |
< |
EPNODE *d; |
694 |
> |
EPNODE *d; |
695 |
|
{ |
696 |
|
register EPNODE *ep1, *ep2; |
697 |
|
|
704 |
|
if (ep1->type == NUM) |
705 |
|
return(ep1->v.num); /* return if number */ |
706 |
|
ep2 = ep1->sibling; /* check time */ |
707 |
< |
if (ep2->v.tick < 0 || ep2->v.tick < eclock) { |
708 |
< |
ep2->v.tick = d->type == ':' ? 1L<<30 : eclock; |
707 |
> |
if (ep2->v.tick == 0 || ep2->v.tick < eclock) { |
708 |
> |
ep2->v.tick = d->type == ':' ? ~0L : eclock; |
709 |
|
ep2 = ep2->sibling; |
710 |
|
ep2->v.num = evalue(ep1); /* needs new value */ |
711 |
|
} else |
712 |
|
ep2 = ep2->sibling; /* else reuse old value */ |
713 |
|
|
714 |
|
return(ep2->v.num); |
661 |
– |
} |
662 |
– |
|
663 |
– |
|
664 |
– |
static int |
665 |
– |
hash(s) /* hash a string */ |
666 |
– |
register char *s; |
667 |
– |
{ |
668 |
– |
register int rval = 0; |
669 |
– |
|
670 |
– |
while (*s) |
671 |
– |
rval += *s++; |
672 |
– |
|
673 |
– |
return(rval % NHASH); |
715 |
|
} |