8000 minix/commands/sh/sh1.c at v3.1.6 · booklin/minix · GitHub
[go: up one dir, main page]

Skip to content

Latest commit

 

History

History
952 lines (858 loc) · 14.5 KB

sh1.c

File metadata and controls

952 lines (858 loc) · 14.5 KB
{
if (!letter((int)*s))
return(0);
for (; *s != '='; s++)
if (*s == 0 || !letnum(*s))
return(0);
return(1);
}
int
assign(s, cf)
register char *s;
int cf;
{
register char *cp;
struct var *vp;
if (!letter(*s))
return(0);
for (cp = s; *cp != '='; cp++)
if (*cp == 0 || !letnum(*cp))
return(0);
vp = lookup(s);
nameval(vp, ++cp, cf == COPYV? (char *)NULL: s);
if (cf != COPYV)
vp->status &= ~GETCELL;
return(1);
}
int
checkname(cp)
register char *cp;
{
if (!letter(*cp++))
return(0);
while (*cp)
if (!letnum(*cp++))
return(0);
return(1);
}
void
putvlist(f, out)
register int f, out;
{
register struct var *vp;
for (vp = vlist; vp; vp = vp->next)
if (vp->status & f && letter(*vp->name)) {
if (vp->status & EXPORT)
write(out, "export ", 7);
if (vp->status & RONLY)
write(out, "readonly ", 9);
write(out, vp->name, (int)(findeq(vp->name) - vp->name));
write(out, "\n", 1);
}
}
int
eqname(n1, n2)
register char *n1, *n2;
{
for (; *n1 != '=' && *n1 != 0; n1++)
if (*n2++ != *n1)
return(0);
return(*n2 == 0 || *n2 == '=');
}
static char *
findeq(cp)
register char *cp;
{
while (*cp != '\0' && *cp != '=')
cp++;
return(cp);
}
/* -------- gmatch.c -------- */
/*
* int gmatch(string, pattern)
* char *string, *pattern;
*
* Match a pattern as in sh(1).
*/
#define CMASK 0377
#define QUOTE 0200
#define QMASK (CMASK&~QUOTE)
#define NOT '!' /* might use ^ */
int
gmatch(s, p)
register char *s, *p;
{
register int sc, pc;
if (s == NULL || p == NULL)
return(0);
while ((pc = *p++ & CMASK) != '\0') {
sc = *s++ & QMASK;
switch (pc) {
case '[':
if ((p = cclass(p, sc)) == NULL)
return(0);
break;
case '?':
if (sc == 0)
return(0);
break;
case '*':
s--;
do {
if (*p == '\0' || gmatch(s, p))
return(1);
} while (*s++ != '\0');
return(0);
default:
if (sc != (pc&~QUOTE))
return(0);
}
}
return(*s == 0);
}
static char *
cclass(p, sub)
register char *p;
register int sub;
{
register int c, d, not, found;
if ((not = *p == NOT) != 0)
p++;
found = not;
do {
if (*p == '\0')
return((char *)NULL);
c = *p & CMASK;
if (p[1] == '-' && p[2] != ']') {
d = p[2] & CMASK;
p++;
} else
d = c;
if (c == sub || (c <= sub && sub <= d))
found = !not;
} while (*++p != ']');
return(found? p+1: (char *)NULL);
}
/* -------- area.c -------- */
#define REGSIZE sizeof(struct region)
#define GROWBY 256
#undef SHRINKBY 64
#define FREE 32767
#define BUSY 0
#define ALIGN (sizeof(int)-1)
/* #include "area.h" */
struct region {
struct region *next;
int area;
};
/*
* All memory between (char *)areabot and (char *)(areatop+1) is
* exclusively administered by the area management routines.
* It is assumed that sbrk() and brk() manipulate the high end.
*/
static struct region *areabot; /* bottom of area */
static struct region *areatop; /* top of area */
static struct region *areanxt; /* starting point of scan */
void
initarea()
{
while ((int)sbrk(0) & ALIGN)
sbrk(1);
areabot = (struct region *)sbrk(REGSIZE);
areabot->next = areabot;
areabot->area = BUSY;
areatop = areabot;
areanxt = areabot;
}
char *
getcell(nbytes)
unsigned nbytes;
{
register int nregio;
register struct region *p, *q;
register i;
if (nbytes == 0)
abort(); /* silly and defeats the algorithm */
/*
* round upwards and add administration area
*/
nregio = (nbytes+(REGSIZE-1))/REGSIZE + 1;
for (p = areanxt;;) {
if (p->area > areanum) {
/*
* merge free cells
*/
while ((q = p->next)->area > areanum && q != areanxt)
p->next = q->next;
/*
* exit loop if cell big enough
*/
if (q >= p + nregio)
goto found;
}
p = p->next;
if (p == areanxt)
break;
}
i = nregio >= GROWBY ? nregio : GROWBY;
p = (struct region *)sbrk(i * REGSIZE);
if (p == (struct region *)-1)
return((char *)NULL);
p--;
if (p != areatop)
abort(); /* allocated areas are contiguous */
q = p + i;
p->next = q;
p->area = FREE;
q->next = areabot;
q->area = BUSY;
areatop = q;
found:
/*
* we found a FREE area big enough, pointed to by 'p', and up to 'q'
*/
areanxt = p + nregio;
if (areanxt < q) {
/*
* split into requested area and rest
*/
if (areanxt+1 > q)
abort(); /* insufficient space left for admin */
areanxt->next = q;
areanxt->area = FREE;
p->next = areanxt;
}
p->area = areanum;
return((char *)(p+1));
}
void
freecell(cp)
char *cp;
{
register struct region *p;
if ((p = (struct region *)cp) != NULL) {
p--;
if (p < areanxt)
areanxt = p;
p->area = FREE;
}
}
void
freearea(a)
register int a;
{
register struct region *p, *top;
top = areatop;
for (p = areabot; p != top; p = p->next)
if (p->area >= a)
p->area = FREE;
}
void
setarea(cp,a)
char *cp;
int a;
{
register struct region *p;
if ((p = (struct region *)cp) != NULL)
(p-1)->area = a;
}
int
getarea(cp)
char *cp;
{
return ((struct region*)cp-1)->area;
}
void
garbage()
{
register struct region *p, *q, *top;
top = areatop;
for (p = areabot; p != top; p = p->next) {
if (p->area > areanum) {
while ((q = p->next)->area > areanum)
p->next = q->next;
areanxt = p;
}
}
#ifdef SHRINKBY
if (areatop >= q + SHRINKBY && q->area > areanum) {
brk((char *)(q+1));
q->next = areabot;
q->area = BUSY;
areatop = q;
}
#endif
}
0