27 |
|
|
28 |
|
#include "copyright.h" |
29 |
|
|
30 |
– |
#include <stdio.h> |
31 |
– |
#include <string.h> |
30 |
|
#include <ctype.h> |
31 |
|
|
32 |
|
#include "rterror.h" |
113 |
|
EPNODE *ep |
114 |
|
) |
115 |
|
{ |
116 |
< |
register VARDEF *dp = ep->v.ln; |
116 |
> |
VARDEF *dp = ep->v.ln; |
117 |
|
|
118 |
|
return(dvalue(dp->name, dp->def)); |
119 |
|
} |
127 |
|
) |
128 |
|
{ |
129 |
|
char *qname; |
130 |
< |
register EPNODE *ep1, *ep2; |
130 |
> |
EPNODE *ep1, *ep2; |
131 |
|
/* get qualified name */ |
132 |
|
qname = qualname(vname, 0); |
133 |
|
/* check for quick set */ |
134 |
< |
if ((ep1 = dlookup(qname)) != NULL && ep1->v.kid->type == SYM) { |
134 |
> |
if ((ep1 = dlookup(qname)) != NULL && ep1->v.kid->type == SYM && |
135 |
> |
(ep1->type == ':') <= (assign == ':')) { |
136 |
|
ep2 = ep1->v.kid->sibling; |
137 |
|
if (ep2->type == NUM) { |
138 |
|
ep2->v.num = val; |
140 |
|
return; |
141 |
|
} |
142 |
|
} |
143 |
+ |
if (ep1 != NULL && esupport&E_REDEFW) { |
144 |
+ |
wputs(qname); |
145 |
+ |
if (ep1->type == ':') |
146 |
+ |
wputs(": reset constant expression\n"); |
147 |
+ |
else |
148 |
+ |
wputs(": reset expression\n"); |
149 |
+ |
} |
150 |
|
/* hand build definition */ |
151 |
|
ep1 = newnode(); |
152 |
|
ep1->type = assign; |
158 |
|
ep2->type = NUM; |
159 |
|
ep2->v.num = val; |
160 |
|
addekid(ep1, ep2); |
161 |
< |
dremove(qname); |
161 |
> |
if (assign == ':') |
162 |
> |
dremove(qname); |
163 |
> |
else |
164 |
> |
dclear(qname); |
165 |
|
dpush(qname, ep1); |
166 |
|
} |
167 |
|
|
171 |
|
char *name |
172 |
|
) |
173 |
|
{ |
174 |
< |
register EPNODE *ep; |
174 |
> |
EPNODE *ep; |
175 |
|
|
176 |
|
while ((ep = dpop(name)) != NULL) { |
177 |
|
if (ep->type == ':') { |
188 |
|
char *name |
189 |
|
) |
190 |
|
{ |
191 |
< |
register EPNODE *ep; |
191 |
> |
EPNODE *ep; |
192 |
|
|
193 |
|
while ((ep = dpop(name)) != NULL) |
194 |
|
epfree(ep); |
200 |
|
char *name |
201 |
|
) |
202 |
|
{ |
203 |
< |
register EPNODE *dp; |
203 |
> |
EPNODE *dp; |
204 |
|
|
205 |
|
return((dp = dlookup(name)) != NULL && dp->v.kid->type == SYM); |
206 |
|
} |
208 |
|
|
209 |
|
char * |
210 |
|
setcontext( /* set a new context path */ |
211 |
< |
register char *ctx |
211 |
> |
char *ctx |
212 |
|
) |
213 |
|
{ |
214 |
< |
register char *cpp; |
214 |
> |
char *cpp; |
215 |
|
|
216 |
|
if (ctx == NULL) |
217 |
|
return(context); /* just asking */ |
245 |
|
) |
246 |
|
{ |
247 |
|
char oldcontext[MAXCNTX+1]; |
248 |
< |
register int n; |
248 |
> |
int n; |
249 |
|
|
250 |
|
strcpy(oldcontext, context); /* save old context */ |
251 |
|
setcontext(ctx); /* set new context */ |
262 |
|
char * |
263 |
|
popcontext(void) /* pop off top context */ |
264 |
|
{ |
265 |
< |
register char *cp1, *cp2; |
265 |
> |
char *cp1, *cp2; |
266 |
|
|
267 |
|
if (!context[0]) /* nothing left to pop */ |
268 |
|
return(context); |
278 |
|
|
279 |
|
char * |
280 |
|
qualname( /* get qualified name */ |
281 |
< |
register char *nam, |
281 |
> |
char *nam, |
282 |
|
int lvl |
283 |
|
) |
284 |
|
{ |
285 |
|
static char nambuf[RMAXWORD+1]; |
286 |
< |
register char *cp = nambuf, *cpp; |
286 |
> |
char *cp = nambuf, *cpp; |
287 |
|
/* check for explicit local */ |
288 |
|
if (*nam == CNTXMARK) |
289 |
|
if (lvl > 0) /* only action is to refuse search */ |
325 |
|
|
326 |
|
int |
327 |
|
incontext( /* is qualified name in current context? */ |
328 |
< |
register char *qn |
328 |
> |
char *qn |
329 |
|
) |
330 |
|
{ |
331 |
|
if (!context[0]) /* global context accepts all */ |
341 |
|
void (*cs)(int n, double v) |
342 |
|
) |
343 |
|
{ |
344 |
< |
register EPNODE *ep; |
344 |
> |
EPNODE *ep; |
345 |
|
|
346 |
|
for (ep = outchan; ep != NULL; ep = ep->sibling) |
347 |
|
(*cs)(ep->v.kid->v.chan, evalue(ep->v.kid->sibling)); |
354 |
|
int lvl |
355 |
|
) |
356 |
|
{ |
357 |
< |
register int i; |
358 |
< |
register VARDEF *vp; |
359 |
< |
register EPNODE *ep; |
357 |
> |
int i; |
358 |
> |
VARDEF *vp; |
359 |
> |
EPNODE *ep; |
360 |
|
/* if context is global, clear all */ |
361 |
|
for (i = 0; i < NHASH; i++) |
362 |
|
for (vp = hashtbl[i]; vp != NULL; vp = vp->next) |
379 |
|
char *name |
380 |
|
) |
381 |
|
{ |
382 |
< |
register VARDEF *vp; |
382 |
> |
VARDEF *vp; |
383 |
|
|
384 |
|
if ((vp = varlookup(name)) == NULL) |
385 |
|
return(NULL); |
393 |
|
) |
394 |
|
{ |
395 |
|
int lvl = 0; |
396 |
< |
register char *qname; |
397 |
< |
register VARDEF *vp; |
396 |
> |
char *qname; |
397 |
> |
VARDEF *vp; |
398 |
|
/* find most qualified match */ |
399 |
|
while ((qname = qualname(name, lvl++)) != NULL) |
400 |
|
for (vp = hashtbl[hash(qname)]; vp != NULL; vp = vp->next) |
409 |
|
char *name |
410 |
|
) |
411 |
|
{ |
412 |
< |
register VARDEF *vp; |
412 |
> |
VARDEF *vp; |
413 |
|
int hv; |
414 |
|
|
415 |
|
if ((vp = varlookup(name)) != NULL) { |
435 |
|
char *fn |
436 |
|
) |
437 |
|
{ |
438 |
< |
register int i; |
439 |
< |
register VARDEF *vp; |
438 |
> |
int i; |
439 |
> |
VARDEF *vp; |
440 |
|
/* if fn is NULL then relink all */ |
441 |
|
for (i = 0; i < NHASH; i++) |
442 |
|
for (vp = hashtbl[i]; vp != NULL; vp = vp->next) |
447 |
|
|
448 |
|
void |
449 |
|
varfree( /* release link to variable */ |
450 |
< |
register VARDEF *ln |
450 |
> |
VARDEF *ln |
451 |
|
) |
452 |
|
{ |
453 |
< |
register VARDEF *vp; |
453 |
> |
VARDEF *vp; |
454 |
|
int hv; |
455 |
|
|
456 |
|
if (--ln->nlinks > 0) |
483 |
|
EPNODE * |
484 |
|
dnext(void) /* return pointer to next definition */ |
485 |
|
{ |
486 |
< |
register EPNODE *ep; |
487 |
< |
register char *nm; |
486 |
> |
EPNODE *ep; |
487 |
> |
char *nm; |
488 |
|
|
489 |
|
while (htndx < NHASH) { |
490 |
|
if (htpos == NULL) |
508 |
|
char *name |
509 |
|
) |
510 |
|
{ |
511 |
< |
register VARDEF *vp; |
512 |
< |
register EPNODE *dp; |
511 |
> |
VARDEF *vp; |
512 |
> |
EPNODE *dp; |
513 |
|
|
514 |
|
if ((vp = varlookup(name)) == NULL || vp->def == NULL) |
515 |
|
return(NULL); |
523 |
|
void |
524 |
|
dpush( /* push on a definition */ |
525 |
|
char *nm, |
526 |
< |
register EPNODE *ep |
526 |
> |
EPNODE *ep |
527 |
|
) |
528 |
|
{ |
529 |
< |
register VARDEF *vp; |
529 |
> |
VARDEF *vp; |
530 |
|
|
531 |
|
vp = varinsert(nm); |
532 |
|
ep->sibling = vp->def; |
540 |
|
) |
541 |
|
{ |
542 |
|
int ch = sp->v.kid->v.chan; |
543 |
< |
register EPNODE *ep, *epl; |
543 |
> |
EPNODE *ep, *epl; |
544 |
|
|
545 |
|
for (epl = NULL, ep = outchan; ep != NULL; epl = ep, ep = ep->sibling) |
546 |
|
if (ep->v.kid->v.chan >= ch) { |
568 |
|
void |
569 |
|
getstatement(void) /* get next statement */ |
570 |
|
{ |
571 |
< |
register EPNODE *ep; |
571 |
> |
EPNODE *ep; |
572 |
|
char *qname; |
573 |
< |
register VARDEF *vdef; |
573 |
> |
VARDEF *vdef; |
574 |
|
|
575 |
|
if (nextc == ';') { /* empty statement */ |
576 |
|
scan(); |
616 |
|
/* FUNC(SYM,..) = E1 */ |
617 |
|
/* FUNC(SYM,..) : E1 */ |
618 |
|
{ |
619 |
< |
register EPNODE *ep1, *ep2; |
619 |
> |
EPNODE *ep1, *ep2; |
620 |
|
|
621 |
|
if (!isalpha(nextc) && nextc != CNTXMARK) |
622 |
|
syntax("illegal variable name"); |
637 |
|
ep2 = newnode(); |
638 |
|
ep2->type = SYM; |
639 |
|
ep2->v.name = savestr(getname()); |
640 |
+ |
if (strchr(ep2->v.name, CNTXMARK) != NULL) |
641 |
+ |
syntax("illegal parameter name"); |
642 |
|
addekid(ep1, ep2); |
643 |
|
} while (nextc == ','); |
644 |
|
if (nextc != ')') |
674 |
|
EPNODE * |
675 |
|
getchan(void) /* A -> $N = E1 */ |
676 |
|
{ |
677 |
< |
register EPNODE *ep1, *ep2; |
677 |
> |
EPNODE *ep1, *ep2; |
678 |
|
|
679 |
|
if (nextc != '$') |
680 |
|
syntax("missing '$'"); |
704 |
|
|
705 |
|
|
706 |
|
static double /* evaluate a variable */ |
707 |
< |
dvalue(char *name, EPNODE *d) |
707 |
> |
dvalue(char *name, EPNODE *d) |
708 |
|
{ |
709 |
< |
register EPNODE *ep1, *ep2; |
709 |
> |
EPNODE *ep1, *ep2; |
710 |
|
|
711 |
|
if (d == NULL || d->v.kid->type != SYM) { |
712 |
|
eputs(name); |
716 |
|
ep1 = d->v.kid->sibling; /* get expression */ |
717 |
|
if (ep1->type == NUM) |
718 |
|
return(ep1->v.num); /* return if number */ |
719 |
+ |
if (esupport&E_RCONST && d->type == ':') { |
720 |
+ |
wputs(name); |
721 |
+ |
wputs(": assigned non-constant value\n"); |
722 |
+ |
} |
723 |
|
ep2 = ep1->sibling; /* check time */ |
724 |
|
if (eclock >= MAXCLOCK) |
725 |
|
eclock = 1; /* wrap clock counter */ |