void
casesp(int a)
{
register int i, j, savlss;
tbreak();
if (dip->nls || trap)
return;
i = findt1();
if (!a) {
skip(0);
j = vnumb((int *)0);
if (nonumb)
j = lss;
} else
j = a;
if (j == 0)
return;
if (i < j)
j = i;
savlss = lss;
if (dip != d)
i = dip->dnl;
else
i = numtab[NL].val;
if ((i + j) < 0)
j = -i;
lss = j;
newline(0);
lss = savlss;
}
static void
_casewh(struct d *dp)
{
register int i, j, k;
lgf++;
skip(1);
i = vnumb((int *)0);
if (nonumb)
return;
skip(0);
j = getrq(1);
if ((k = findn(dp, i)) != NTRAP) {
dp->mlist[k] = j;
return;
}
for (k = 0; k < NTRAP; k++)
if (dp->mlist[k] == 0)
break;
if (k == NTRAP) {
flusho();
errprint("cannot plant trap.");
return;
}
dp->mlist[k] = j;
dp->nlist[k] = i;
chkt(dp, i);
}
void casedt(void)
{
lgf++;
dip->dimac = dip->ditrap = dip->ditf = 0;
skip();
dip->ditrap = vnumb((int *)0);
if (nonumb)
return;
skip();
dip->dimac = getrq();
}
void
casesv(void)
{
register int i;
skip(0);
if ((i = vnumb((int *)0)) < 0)
return;
if (nonumb)
i = 1;
sv += i;
caseos();
}
void
casepl(void)
{
register int i;
skip(0);
if ((i = vnumb(&pl)) == 0)
pl = defaultpl ? defaultpl : 11 * INCH; /*11in*/
else
pl = i;
if (numtab[NL].val > pl) {
numtab[NL].val = pl;
prwatchn(&numtab[NL]);
}
}
void
casene(void)
{
register int i, j;
skip(0);
i = vnumb((int *)0);
if (nonumb)
i = lss;
if (i > (j = findt1())) {
i = lss;
lss = j;
dip->nls = 0;
newline(0);
lss = i;
}
}
void
casert(void)
{
register int a, *p;
skip(0);
if (dip != d)
p = &dip->dnl;
else
p = &numtab[NL].val;
a = vnumb(p);
if (nonumb)
a = dip->mkline;
if ((a < 0) || (a >= *p))
return;
nb++;
casesp(a - *p);
}
static void
_casech(struct d *dp)
{
register int i, j, k;
lgf++;
skip(1);
if (!(j = getrq(0)))
return;
else {
for (k = 0; k < NTRAP; k++)
if (dp->mlist[k] == j)
break;
}
if (k == NTRAP)
return;
skip(0);
i = vnumb((int *)0);
if (nonumb)
dp->mlist[k] = 0;
dp->nlist[k] = i;
chkt(dp, i);
}
