38 |
|
|
39 |
|
extern char *ecalloc(), *savestr(), *strcpy(); |
40 |
|
|
41 |
+ |
static int hash(); |
42 |
+ |
|
43 |
|
static double dvalue(); |
44 |
|
|
45 |
|
long eclock = -1; /* 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 */ |
197 |
|
if (*ctx != CNTXMARK) |
198 |
|
*cpp++ = CNTXMARK; /* make sure there's a mark */ |
199 |
|
do { |
200 |
< |
if (cpp >= context+MAXWORD-1) { |
201 |
< |
*cpp = '\0'; |
200 |
< |
wputs(context); |
201 |
< |
wputs(": context path too long\n"); |
202 |
< |
return(NULL); |
203 |
< |
} |
200 |
> |
if (cpp >= context+MAXWORD) |
201 |
> |
break; /* just copy what we can */ |
202 |
|
if (isid(*ctx)) |
203 |
|
*cpp++ = *ctx++; |
204 |
|
else { |
215 |
|
register char *nam; |
216 |
|
int lvl; |
217 |
|
{ |
218 |
< |
static char nambuf[MAXWORD]; |
218 |
> |
static char nambuf[MAXWORD+1]; |
219 |
|
register char *cp = nambuf, *cpp; |
220 |
|
/* check for explicit local */ |
221 |
|
if (*nam == CNTXMARK) |
227 |
|
return(lvl > 0 ? NULL : nam); |
228 |
|
/* copy name to static buffer */ |
229 |
|
while (*nam) { |
230 |
< |
if (cp >= nambuf+MAXWORD-1) |
230 |
> |
if (cp >= nambuf+MAXWORD) |
231 |
|
goto toolong; |
232 |
|
*cp++ = *nam++; |
233 |
|
} |
246 |
|
; |
247 |
|
} |
248 |
|
while (*cpp) { /* copy context to static buffer */ |
249 |
< |
if (cp >= nambuf+MAXWORD-1) |
249 |
> |
if (cp >= nambuf+MAXWORD) |
250 |
|
goto toolong; |
251 |
|
*cp++ = *cpp++; |
252 |
|
} |
255 |
– |
*cp = '\0'; |
256 |
– |
return(nambuf); /* return qualified name */ |
253 |
|
toolong: |
254 |
|
*cp = '\0'; |
255 |
< |
eputs(nambuf); |
260 |
< |
eputs(": name too long\n"); |
261 |
< |
quit(1); |
255 |
> |
return(nambuf); /* return qualified name */ |
256 |
|
} |
257 |
|
|
258 |
|
|
260 |
|
register char *qn; |
261 |
|
{ |
262 |
|
while (*qn && *qn != CNTXMARK) /* find context mark */ |
263 |
< |
; |
263 |
> |
qn++; |
264 |
|
return(!strcmp(qn, context)); |
265 |
|
} |
266 |
|
|
335 |
|
char *name; |
336 |
|
{ |
337 |
|
register VARDEF *vp; |
338 |
< |
LIBR *libp; |
338 |
> |
register LIBR *libp; |
339 |
|
int hv; |
340 |
|
|
341 |
|
if ((vp = varlookup(name)) != NULL) { |
361 |
|
} |
362 |
|
|
363 |
|
|
364 |
+ |
#ifdef FUNCTION |
365 |
+ |
libupdate(fn) /* update library links */ |
366 |
+ |
char *fn; |
367 |
+ |
{ |
368 |
+ |
register int i; |
369 |
+ |
register VARDEF *vp; |
370 |
+ |
/* if fn is NULL then relink all */ |
371 |
+ |
for (i = 0; i < NHASH; i++) |
372 |
+ |
for (vp = hashtbl[i]; vp != NULL; vp = vp->next) |
373 |
+ |
if (vp->lib != NULL || fn == NULL || !strcmp(fn, vp->name)) |
374 |
+ |
vp->lib = liblookup(vp->name); |
375 |
+ |
} |
376 |
+ |
#endif |
377 |
+ |
|
378 |
+ |
|
379 |
|
varfree(ln) /* release link to variable */ |
380 |
|
register VARDEF *ln; |
381 |
|
{ |
415 |
|
dnext() /* return pointer to next definition */ |
416 |
|
{ |
417 |
|
register EPNODE *ep; |
418 |
+ |
register char *nm; |
419 |
|
|
420 |
|
while (htndx < NHASH) { |
421 |
|
if (htpos == NULL) |
422 |
|
htpos = hashtbl[htndx++]; |
423 |
|
while (htpos != NULL) { |
424 |
|
ep = htpos->def; |
425 |
+ |
nm = htpos->name; |
426 |
|
htpos = htpos->next; |
427 |
< |
if (ep != NULL) |
427 |
> |
if (ep != NULL && incontext(nm)) |
428 |
|
return(ep); |
429 |
|
} |
430 |
|
} |
554 |
|
{ |
555 |
|
register EPNODE *ep1, *ep2; |
556 |
|
|
557 |
< |
if (!isalpha(nextc)) |
557 |
> |
if (!isalpha(nextc) && nextc != CNTXMARK) |
558 |
|
syntax("illegal variable name"); |
559 |
|
|
560 |
|
ep1 = newnode(); |