OpenSolaris_b135/cmd/troff/n4.c
/*
* CDDL HEADER START
*
* The contents of this file are subject to the terms of the
* Common Development and Distribution License, Version 1.0 only
* (the "License"). You may not use this file except in compliance
* with the License.
*
* You can obtain a copy of the license at usr/src/OPENSOLARIS.LICENSE
* or http://www.opensolaris.org/os/licensing.
* See the License for the specific language governing permissions
* and limitations under the License.
*
* When distributing Covered Code, include this CDDL HEADER in each
* file and include the License file at usr/src/OPENSOLARIS.LICENSE.
* If applicable, add the following below this CDDL HEADER, with the
* fields enclosed by brackets "[]" replaced with your own identifying
* information: Portions Copyright [yyyy] [name of copyright owner]
*
* CDDL HEADER END
*/
/*
* Copyright 2003 Sun Microsystems, Inc. All rights reserved.
* Use is subject to license terms.
*/
/* Copyright (c) 1984, 1986, 1987, 1988, 1989 AT&T */
/* All Rights Reserved */
/*
* University Copyright- Copyright (c) 1982, 1986, 1988
* The Regents of the University of California
* All Rights Reserved
*
* University Acknowledgment- Portions of this document are derived from
* software developed by the University of California, Berkeley, and its
* contributors.
*/
#pragma ident "%Z%%M% %I% %E% SMI"
#include <ctype.h>
#include "tdef.h"
#ifdef NROFF
#include "tw.h"
#endif
#include "ext.h"
/*
* troff4.c
*
* number registers, conversion, arithmetic
*/
int regcnt = NNAMES;
int falsef = 0; /* on if inside false branch of if */
#define NHASH(i) ((i>>6)^i)&0177
struct numtab *nhash[128]; /* 128 == the 0177 on line above */
int
setn()
{
int i, j;
tchar ii;
int f;
f = nform = 0;
if ((i = cbits(ii = getach())) == '+')
f = 1;
else if (i == '-')
f = -1;
else
ch = ii;
if (falsef)
f = 0;
if ((i = getsn()) == 0)
return (0);
if ((i & 0177) == '.')
switch (i >> BYTE) {
case 's':
i = pts;
break;
case 'v':
i = lss;
break;
case 'f':
i = font;
break;
case 'p':
i = pl;
break;
case 't':
i = findt1();
break;
case 'o':
i = po;
break;
case 'l':
i = ll;
break;
case 'i':
i = in;
break;
case '$':
i = frame->nargs;
break;
case 'A':
i = ascii;
break;
case 'c':
i = numtab[CD].val;
break;
case 'n':
i = lastl;
break;
case 'a':
i = ralss;
break;
case 'h':
i = dip->hnl;
break;
case 'd':
if (dip != d)
i = dip->dnl;
else
i = numtab[NL].val;
break;
case 'u':
i = fi;
break;
case 'j':
i = ad + 2 * admod;
break;
case 'w':
i = widthp;
break;
case 'x':
i = nel;
break;
case 'y':
i = un;
break;
case 'T':
i = dotT;
break; /*-Tterm used in nroff*/
case 'V':
i = VERT;
break;
case 'H':
i = HOR;
break;
case 'k':
i = ne;
break;
case 'P':
i = print;
break;
case 'L':
i = ls;
break;
case 'R':
i = NN - regcnt;
break;
case 'z':
i = dip->curd;
*pbp++ = (i >> BYTE) & BYTEMASK;
*pbp++ = i & BYTEMASK;
return (0);
case 'b':
i = bdtab[font];
break;
case 'F':
cpushback(cfname[ifi]);
return (0);
default:
goto s0;
}
else {
s0:
if ((j = findr(i)) == -1)
i = 0;
else {
i = numtab[j].val = (numtab[j].val+numtab[j].inc*f);
nform = numtab[j].fmt;
}
}
setn1(i, nform, (tchar) 0);
return (0);
}
tchar numbuf[17];
tchar *numbufp;
int
wrc(i)
tchar i;
{
if (numbufp >= &numbuf[16])
return(0);
*numbufp++ = i;
return(1);
}
/* insert into input number i, in format form, with size-font bits bits */
int
setn1(i, form, bits)
int i;
tchar bits;
{
extern int wrc();
numbufp = numbuf;
nrbits = bits;
nform = form;
fnumb(i, wrc);
*numbufp = 0;
pushback(numbuf);
return (0);
}
int
nrehash()
{
struct numtab *p;
int i;
for (i=0; i<128; i++)
nhash[i] = 0;
for (p=numtab; p < &numtab[NN]; p++)
p->link = 0;
for (p=numtab; p < &numtab[NN]; p++) {
if (p->r == 0)
continue;
i = NHASH(p->r);
p->link = nhash[i];
nhash[i] = p;
}
return (0);
}
int
nunhash(rp)
struct numtab *rp;
{
struct numtab *p;
struct numtab **lp;
if (rp->r == 0)
return (0);
lp = &nhash[NHASH(rp->r)];
p = *lp;
while (p) {
if (p == rp) {
*lp = p->link;
p->link = 0;
return (0);
}
lp = &p->link;
p = p->link;
}
return (0);
}
int
findr(i)
int i;
{
struct numtab *p;
int h = NHASH(i);
if (i == 0)
return(-1);
for (p = nhash[h]; p; p = p->link)
if (i == p->r)
return(p - numtab);
for (p = numtab; p < &numtab[NN]; p++) {
if (p->r == 0) {
p->r = i;
p->link = nhash[h];
nhash[h] = p;
regcnt++;
return(p - numtab);
}
}
errprint(gettext("too many number registers (%d)."), NN);
done2(04);
/* NOTREACHED */
return (0);
}
int
usedr(i) /* returns -1 if nr i has never been used */
int i;
{
struct numtab *p;
if (i == 0)
return(-1);
for (p = nhash[NHASH(i)]; p; p = p->link)
if (i == p->r)
return(p - numtab);
return -1;
}
int
fnumb(i, f)
int i, (*f)();
{
int j;
j = 0;
if (i < 0) {
j = (*f)('-' | nrbits);
i = -i;
}
switch (nform) {
default:
case '1':
case 0:
return decml(i, f) + j;
break;
case 'i':
case 'I':
return roman(i, f) + j;
break;
case 'a':
case 'A':
return abc(i, f) + j;
break;
}
return (0);
}
int
decml(i, f)
int i, (*f)();
{
int j, k;
k = 0;
nform--;
if ((j = i / 10) || (nform > 0))
k = decml(j, f);
return(k + (*f)((i % 10 + '0') | nrbits));
}
int
roman(i, f)
int i, (*f)();
{
if (!i)
return((*f)('0' | nrbits));
if (nform == 'i')
return(roman0(i, f, "ixcmz", "vldw"));
else
return(roman0(i, f, "IXCMZ", "VLDW"));
}
int
roman0(i, f, onesp, fivesp)
int i, (*f)();
char *onesp, *fivesp;
{
int q, rem, k;
k = 0;
if (!i)
return(0);
k = roman0(i / 10, f, onesp + 1, fivesp + 1);
q = (i = i % 10) / 5;
rem = i % 5;
if (rem == 4) {
k += (*f)(*onesp | nrbits);
if (q)
i = *(onesp + 1);
else
i = *fivesp;
return(k += (*f)(i | nrbits));
}
if (q)
k += (*f)(*fivesp | nrbits);
while (--rem >= 0)
k += (*f)(*onesp | nrbits);
return(k);
}
int
abc(i, f)
int i, (*f)();
{
if (!i)
return((*f)('0' | nrbits));
else
return(abc0(i - 1, f));
}
int
abc0(i, f)
int i, (*f)();
{
int j, k;
k = 0;
if (j = i / 26)
k = abc0(j - 1, f);
return(k + (*f)((i % 26 + nform) | nrbits));
}
long atoi0()
{
int c, k, cnt;
tchar ii;
long i, acc;
extern long ckph();
i = 0;
acc = 0;
nonumb = 0;
cnt = -1;
a0:
cnt++;
ii = getch();
c = cbits(ii);
switch (c) {
default:
ch = ii;
if (cnt)
break;
case '+':
i = ckph();
if (nonumb)
break;
acc += i;
goto a0;
case '-':
i = ckph();
if (nonumb)
break;
acc -= i;
goto a0;
case '*':
i = ckph();
if (nonumb)
break;
acc *= i;
goto a0;
case '/':
i = ckph();
if (nonumb)
break;
if (i == 0) {
flusho();
errprint(gettext("divide by zero."));
acc = 0;
} else
acc /= i;
goto a0;
case '%':
i = ckph();
if (nonumb)
break;
acc %= i;
goto a0;
case '&': /*and*/
i = ckph();
if (nonumb)
break;
if ((acc > 0) && (i > 0))
acc = 1;
else
acc = 0;
goto a0;
case ':': /*or*/
i = ckph();
if (nonumb)
break;
if ((acc > 0) || (i > 0))
acc = 1;
else
acc = 0;
goto a0;
case '=':
if (cbits(ii = getch()) != '=')
ch = ii;
i = ckph();
if (nonumb) {
acc = 0;
break;
}
if (i == acc)
acc = 1;
else
acc = 0;
goto a0;
case '>':
k = 0;
if (cbits(ii = getch()) == '=')
k++;
else
ch = ii;
i = ckph();
if (nonumb) {
acc = 0;
break;
}
if (acc > (i - k))
acc = 1;
else
acc = 0;
goto a0;
case '<':
k = 0;
if (cbits(ii = getch()) == '=')
k++;
else
ch = ii;
i = ckph();
if (nonumb) {
acc = 0;
break;
}
if (acc < (i + k))
acc = 1;
else
acc = 0;
goto a0;
case ')':
break;
case '(':
acc = atoi0();
goto a0;
}
return(acc);
}
long ckph()
{
tchar i;
long j;
extern long atoi0();
extern long atoi1();
if (cbits(i = getch()) == '(')
j = atoi0();
else {
j = atoi1(i);
}
return(j);
}
long atoi1(ii)
tchar ii;
{
int i, j, digits;
long acc;
int neg, abs, field;
neg = abs = field = digits = 0;
acc = 0;
for (;;) {
i = cbits(ii);
switch (i) {
default:
break;
case '+':
ii = getch();
continue;
case '-':
neg = 1;
ii = getch();
continue;
case '|':
abs = 1 + neg;
neg = 0;
ii = getch();
continue;
}
break;
}
a1:
while (i >= '0' && i <= '9') {
field++;
digits++;
acc = 10 * acc + i - '0';
ii = getch();
i = cbits(ii);
}
if (i == '.') {
field++;
digits = 0;
ii = getch();
i = cbits(ii);
goto a1;
}
if (!field) {
ch = ii;
goto a2;
}
switch (i) {
case 'u':
i = j = 1; /* should this be related to HOR?? */
break;
case 'v': /*VSs - vert spacing*/
j = lss;
i = 1;
break;
case 'm': /*Ems*/
j = EM;
i = 1;
break;
case 'n': /*Ens*/
j = EM;
#ifndef NROFF
i = 2;
#endif
#ifdef NROFF
i = 1; /*Same as Ems in NROFF*/
#endif
break;
case 'p': /*Points*/
j = INCH;
i = 72;
break;
case 'i': /*Inches*/
j = INCH;
i = 1;
break;
case 'c': /*Centimeters*/
/* if INCH is too big, this will overflow */
j = INCH * 50;
i = 127;
break;
case 'P': /*Picas*/
j = INCH;
i = 6;
break;
default:
j = dfact;
ch = ii;
i = dfactd;
}
if (neg)
acc = -acc;
if (!noscale) {
acc = (acc * j) / i;
}
if ((field != digits) && (digits > 0))
while (digits--)
acc /= 10;
if (abs) {
if (dip != d)
j = dip->dnl;
else
j = numtab[NL].val;
if (!vflag) {
j = numtab[HP].val;
}
if (abs == 2)
j = -j;
acc -= j;
}
a2:
nonumb = !field;
return(acc);
}
int
caserr()
{
int i, j;
struct numtab *p;
lgf++;
while (!skip() && (i = getrq()) ) {
j = usedr(i);
if (j < 0)
continue;
p = &numtab[j];
nunhash(p);
p->r = p->val = p->inc = p->fmt = 0;
regcnt--;
}
return (0);
}
int
casenr()
{
int i, j;
lgf++;
skip();
if ((i = findr(getrq())) == -1)
goto rtn;
skip();
j = inumb(&numtab[i].val);
if (nonumb)
goto rtn;
numtab[i].val = j;
skip();
j = atoi();
if (nonumb)
goto rtn;
numtab[i].inc = j;
rtn:
return (0);
}
int
caseaf()
{
int i, k;
tchar j, jj;
lgf++;
if (skip() || !(i = getrq()) || skip())
return (0);
k = 0;
j = getch();
if (!ischar(jj = cbits(j)) || !isalpha(jj)) {
ch = j;
while ((j = cbits(getch())) >= '0' && j <= '9')
k++;
}
if (!k)
k = j;
numtab[findr(i)].fmt = k & BYTEMASK;
return (0);
}
int
setaf() /* return format of number register */
{
int i, j;
i = usedr(getsn());
if (i == -1)
return (0);
if (numtab[i].fmt > 20) /* it was probably a, A, i or I */
*pbp++ = numtab[i].fmt;
else
for (j = (numtab[i].fmt ? numtab[i].fmt : 1); j; j--)
*pbp++ = '0';
return (0);
}
int
vnumb(i)
int *i;
{
vflag++;
dfact = lss;
res = VERT;
return(inumb(i));
}
int
hnumb(i)
int *i;
{
dfact = EM;
res = HOR;
return(inumb(i));
}
int
inumb(n)
int *n;
{
int i, j, f;
tchar ii;
f = 0;
if (n) {
if ((j = cbits(ii = getch())) == '+')
f = 1;
else if (j == '-')
f = -1;
else
ch = ii;
}
i = atoi();
if (n && f)
i = *n + f * i;
i = quant(i, res);
vflag = 0;
res = dfactd = dfact = 1;
if (nonumb)
i = 0;
return(i);
}
int
quant(n, m)
int n, m;
{
int i, neg;
neg = 0;
if (n < 0) {
neg++;
n = -n;
}
/* better as i = ((n + (m/2))/m)*m */
i = n / m;
if ((n - m * i) > (m / 2))
i += 1;
i *= m;
if (neg)
i = -i;
return(i);
}