void copys(void)
{
Tchar i;
copyf++;
if (skip())
goto c0;
if (cbits(i = getch()) != '"')
wbf(i);
while (cbits(i = getch()) != '\n')
wbf(i);
c0:
wbf((Tchar)0);
copyf--;
}
void casedi(void)
{
int i, j, *k;
lgf++;
if (skip() || (i = getrq()) == 0) {
if (dip != d) {
FINDDIV(savslot);
wbf((Tchar)0);
}
if (dilev > 0) {
numtabp[DN].val = dip->dnl;
numtabp[DL].val = dip->maxl;
FINDDIV(j);
if ((contabp[j].divsiz = (Divsiz *) malloc(sizeof(Divsiz))) == NULL) {
ERROR "Cannot alloc diversion size" WARN;
done2(1);
} else {
contabp[j].divsiz->dix = numtabp[DN].val;
contabp[j].divsiz->diy = numtabp[DL].val;
}
dip = &d[--dilev];
offset = dip->op;
}
goto rtn;
}
if (++dilev == NDI) {
--dilev;
ERROR "Diversions nested too deep" WARN;
edone(02);
}
if (dip != d) {
FINDDIV(j);
savslot = j;
wbf((Tchar)0);
}
diflg++;
dip = &d[dilev];
dip->op = finds(i);
dip->curd = i;
clrmn(oldmn);
k = (int *) & dip->dnl;
for (j = 0; j < 10; j++)
k[j] = 0; /*not op and curd*/
rtn:
app = 0;
diflg = 0;
}
void
casewhile(void)
{
tchar c;
int k, level, nl;
filep newip;
if (dip != d)
wbfl();
if ((nextb = alloc()) == 0) {
errprint("out of space");
edone(04);
return;
}
newip = offset = nextb;
wbf(mkxfunc(CC, 0));
wbf(XFUNC); /* caseif */
wbf(' ');
copyf++, clonef++;
nl = level = 0;
do {
nlflg = 0;
k = cbits(c = getch());
switch (k) {
case LEFT:
level++;
break;
case RIGHT:
level--;
break;
}
wbf(c);
} while (!nlflg || level > 0);
if (level < 0 && warn & WARN_DELIM)
errprint("%d excess delimiter(s)", -level);
wbt(0);
copyf--, clonef--;
pushi(newip, LOOP, 0);
offset = dip->op;
}
void casede(void)
{
int i, req;
Offset savoff;
req = '.';
lgf++;
skip();
if ((i = getrq()) == 0)
goto de1;
if ((offset = finds(i)) == 0)
goto de1;
if (newmn)
savslot = newmn;
else
savslot = findmn(i);
savname = i;
if (ds)
copys();
else
req = copyb();
clrmn(oldmn);
if (newmn) {
if (contabp[newmn].rq)
munhash(&contabp[newmn]);
contabp[newmn].rq = i;
maddhash(&contabp[newmn]);
}
if (apptr) {
savoff = offset;
offset = apptr;
wbf((Tchar) IMP);
offset = savoff;
}
offset = dip->op;
if (req != '.')
control(req, 1);
de1:
ds = app = 0;
}
void
pchar1(register tchar i)
{
static int _olt;
tchar _olp[1];
register int j;
filep savip;
extern void ptout(tchar);
j = cbits(i);
if (dip != &d[0]) {
if (i == FLSS)
dip->flss++;
else if (dip->flss > 0)
dip->flss--;
else if (!ismot(i) && (cbits(i) > 32 || cbits(i) == XFUNC) &&
!tflg)
i |= DIBIT;
wbf(i);
dip->op = offset;
return;
}
if (!tflg && !print) {
if (j == '\n')
dip->alss = dip->blss = 0;
return;
}
if (no_out)
return;
if (tflg) { /* transparent mode, undiverted */
outtp(i);
return;
}
if (cbits(i) == XFUNC) {
switch (fbits(i)) {
case OLT:
olt = realloc(olt, (nolt + 1) * sizeof *olt);
_olt = 1;
return;
case CHAR:
#ifndef NROFF
if (!ascii)
break;
#endif /* !NROFF */
savip = ip;
ip = charout[sbits(i)].op;
app++;
fmtchar++;
while ((i = rbf()) != 0 && cbits(i) != '\n' &&
cbits(i) != FLSS)
pchar(i);
fmtchar--;
app--;
ip = savip;
return;
}
}
if (cbits(i) == 'x')
fmtchar = fmtchar;
if (_olt) {
_olp[0] = i;
olt[nolt++] = fetchrq(_olp);
_olt = 0;
}
#ifndef NROFF
if (ascii)
outascii(i);
else
#endif
ptout(i);
}
int copyb(void)
{
int i, j, state;
Tchar ii;
int req, k;
Offset savoff;
Uchar *p;
if (skip() || !(j = getrq()))
j = '.';
req = j;
p = unpair(j);
/* was: k = j >> BYTE; j &= BYTEMASK; */
j = p[0];
k = p[1];
copyf++;
flushi();
nlflg = 0;
state = 1;
/* state 0 eat up
* state 1 look for .
* state 2 look for first char of end macro
* state 3 look for second char of end macro
*/
while (1) {
i = cbits(ii = getch());
if (state == 3) {
if (i == k)
break;
if (!k) {
ch = ii;
i = getach();
ch = ii;
if (!i)
break;
}
state = 0;
goto c0;
}
if (i == '\n') {
state = 1;
nlflg = 0;
goto c0;
}
if (state == 1 && i == '.') {
state++;
savoff = offset;
goto c0;
}
if (state == 2 && i == j) {
state++;
goto c0;
}
state = 0;
c0:
if (offset)
wbf(ii);
}
if (offset) {
offset = savoff;
wbf((Tchar)0);
}
copyf--;
return(req);
}
