|
|
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: if (szstack[nszstack-1] == 0) ! 19: printf(".nr %d \\n(.s\n", 99-nszstack); ! 20: else ! 21: printf(".nr %d %d\n", 99-nszstack, ps); ! 22: szstack[nszstack] = ps = atoi(p); ! 23: } else { ! 24: error(!FATAL, "illegal size %s ignored", p); ! 25: } ! 26: dprintf(".\tsetsize %s; ps = %d\n", p, ps); ! 27: } ! 28: ! 29: size(p1, p2) ! 30: int p1, p2; ! 31: { ! 32: /* old size in p1, new in ps */ ! 33: yyval = p2; ! 34: dprintf(".\tS%d <- \\s%d %d \\s%d; b=%g, h=%g\n", ! 35: yyval, ps, p2, p1, ebase[yyval], eht[yyval]); ! 36: if (szstack[nszstack] != 0) { ! 37: printf(".ds %d %s\\*(%d\\s\\n(%d\n", yyval, ABSPS(ps), p2, 99-nszstack); ! 38: } else ! 39: printf(".ds %d %s\\*(%d%s\n", yyval, DPS(p1,ps), p2, DPS(ps,p1)); ! 40: nszstack--; ! 41: ps = p1; ! 42: } ! 43: ! 44: globsize() ! 45: { ! 46: char temp[20]; ! 47: ! 48: getstr(temp, sizeof(temp)); ! 49: if (temp[0] == '+') { ! 50: gsize += atoi(temp+1); ! 51: if (szstack[0] != 0) ! 52: szstack[0] = gsize; ! 53: } else if (temp[0] == '-') { ! 54: gsize -= atoi(temp+1); ! 55: if (szstack[0] != 0) ! 56: szstack[0] = gsize; ! 57: } else if (isdigit(temp[0])) { ! 58: gsize = atoi(temp); ! 59: szstack[0] = gsize; ! 60: printf(".nr 99 \\n(.s\n"); ! 61: } else { ! 62: error(!FATAL, "illegal gsize %s ignored", temp); ! 63: } ! 64: yyval = eqnreg = 0; ! 65: ps = gsize; ! 66: if (gsize < 12 && !dps_set) /* sub and sup size change */ ! 67: deltaps = gsize / 3; ! 68: else if (gsize < 20) ! 69: deltaps = gsize / 4; ! 70: else ! 71: deltaps = gsize / 5; ! 72: }
This archive runs on limited infrastructure. Preserving old code on modern bandwidth. Automated agents are requested to crawl responsibly.