|
|
1.1 root 1: # include "e.h"
2: # include <ctype.h>
3:
4: setsize(p) /* set size as found in p */
5: char *p;
6: {
7: nszstack++;
8: szstack[nszstack] = 0; /* assume relative */
9: if (*p == '+') {
10: ps += atoi(p+1);
11: if (szstack[nszstack-1] != 0) /* propagate absolute size */
12: szstack[nszstack] = ps;
13: } else if (*p == '-') {
14: ps -= atoi(p+1);
15: if (szstack[nszstack-1] != 0)
16: szstack[nszstack] = ps;
17: } else if (isdigit(*p)) {
18: szstack[nszstack] = ps = atoi(p);
19: printf(".nr %d \\n(.s\n", 99-nszstack);
20: } else {
21: error(!FATAL, "illegal size %s ignored", p);
22: }
23: dprintf(".\tsetsize %s; ps = %d\n", p, ps);
24: }
25:
26: size(p1, p2)
27: int p1, p2;
28: {
29: /* old size in p1, new in ps */
30: yyval = p2;
31: dprintf(".\tS%d <- \\s%d %d \\s%d; b=%g, h=%g\n",
32: yyval, ps, p2, p1, ebase[yyval], eht[yyval]);
33: if (szstack[nszstack] != 0) {
34: /* sizes ought to be generated from macro as \s(dd */
35: printf(".ds %d \\s%d\\*(%d\\s\\n(%d\n", yyval, ps, p2, 99-nszstack);
36: } else
37: printf(".ds %d %s\\*(%d%s\n", yyval, DPS(p1,ps), p2, DPS(ps,p1));
38: nszstack--;
39: ps = p1;
40: }
41:
42: globsize()
43: {
44: char temp[20];
45:
46: getstr(temp, sizeof(temp));
47: if (temp[0] == '+') {
48: gsize += atoi(temp+1);
49: if (szstack[0] != 0)
50: szstack[0] = gsize;
51: } else if (temp[0] == '-') {
52: gsize -= atoi(temp+1);
53: if (szstack[0] != 0)
54: szstack[0] = gsize;
55: } else if (isdigit(temp[0])) {
56: gsize = atoi(temp);
57: szstack[0] = gsize;
58: printf(".nr 99 \\n(.s\n");
59: } else {
60: error(!FATAL, "illegal gsize %s ignored", temp);
61: }
62: yyval = eqnreg = 0;
63: ps = gsize;
64: if (gsize < 12 && !dps_set) /* sub and sup size change */
65: deltaps = gsize / 3;
66: else if (gsize < 20)
67: deltaps = gsize / 4;
68: else
69: deltaps = gsize / 5;
70: }
This archive runs on limited infrastructure. Preserving old code on modern bandwidth. Automated agents are requested to crawl responsibly.