main.c 7.0 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332
  1. #include "e.h"
  2. #define MAXLINE 3600 /* maximum input line */
  3. char *version = "version Oct 24, 1991";
  4. char in[MAXLINE+1]; /* input buffer */
  5. int noeqn;
  6. char *cmdname;
  7. int yyparse(void);
  8. void settype(char *);
  9. int getdata(void);
  10. int getline(char *);
  11. void inlineeq(void);
  12. void init(void);
  13. void init_tbl(void);
  14. void
  15. main(int argc, char *argv[])
  16. {
  17. char *p, buf[20];
  18. cmdname = argv[0];
  19. if (p = getenv("TYPESETTER"))
  20. typesetter = p;
  21. while (argc > 1 && argv[1][0] == '-') {
  22. switch (argv[1][1]) {
  23. case 'd':
  24. if (argv[1][2] == '\0') {
  25. dbg++;
  26. printf("...\teqn %s\n", version);
  27. } else {
  28. lefteq = argv[1][2];
  29. righteq = argv[1][3];
  30. }
  31. break;
  32. case 's': szstack[0] = gsize = atoi(&argv[1][2]); break;
  33. case 'p': deltaps = atoi(&argv[1][2]); dps_set = 1; break;
  34. case 'm': minsize = atoi(&argv[1][2]); break;
  35. case 'f': strcpy(ftstack[0].name,&argv[1][2]); break;
  36. case 'e': noeqn++; break;
  37. case 'T': typesetter = &argv[1][2]; break;
  38. default:
  39. fprintf(stderr, "%s: unknown option %s\n", cmdname, argv[1]);
  40. break;
  41. }
  42. argc--;
  43. argv++;
  44. }
  45. settype(typesetter);
  46. sprintf(buf, "\"%s\"", typesetter);
  47. install(deftbl, strsave(typesetter), strsave(buf), 0);
  48. init_tbl(); /* install other keywords in tables */
  49. curfile = infile;
  50. pushsrc(File, curfile->fname);
  51. if (argc <= 1) {
  52. curfile->fin = stdin;
  53. curfile->fname = strsave("-");
  54. getdata();
  55. } else
  56. while (argc-- > 1) {
  57. if (strcmp(*++argv, "-") == 0)
  58. curfile->fin = stdin;
  59. else if ((curfile->fin = fopen(*argv, "r")) == NULL)
  60. ERROR "can't open file %s", *argv FATAL;
  61. curfile->fname = strsave(*argv);
  62. getdata();
  63. if (curfile->fin != stdin)
  64. fclose(curfile->fin);
  65. }
  66. exit(0);
  67. }
  68. void settype(char *s) /* initialize data for particular typesetter */
  69. /* the minsize could profitably come from the */
  70. { /* troff description file /usr/lib/font/dev.../DESC.out */
  71. if (strcmp(s, "202") == 0)
  72. { minsize = 5; ttype = DEV202; }
  73. else if (strcmp(s, "aps") == 0)
  74. { minsize = 5; ttype = DEVAPS; }
  75. else if (strcmp(s, "cat") == 0)
  76. { minsize = 6; ttype = DEVCAT; }
  77. else if (strcmp(s, "post") == 0)
  78. { minsize = 4; ttype = DEVPOST; }
  79. else
  80. { minsize = 5; ttype = DEV202; }
  81. }
  82. getdata(void)
  83. {
  84. int i, type, ln;
  85. char fname[100];
  86. extern int errno;
  87. errno = 0;
  88. curfile->lineno = 0;
  89. printf(".lf 1 %s\n", curfile->fname);
  90. while ((type = getline(in)) != EOF) {
  91. if (in[0] == '.' && in[1] == 'E' && in[2] == 'Q') {
  92. for (i = 11; i < 100; i++)
  93. used[i] = 0;
  94. printf("%s", in);
  95. if (markline) { /* turn off from last time */
  96. printf(".nr MK 0\n");
  97. markline = 0;
  98. }
  99. display = 1;
  100. init();
  101. yyparse();
  102. if (eqnreg > 0) {
  103. if (markline)
  104. printf(".nr MK %d\n", markline); /* for -ms macros */
  105. printf(".if %gm>\\n(.v .ne %gm\n", eqnht, eqnht);
  106. printf(".rn %d 10\n", eqnreg);
  107. if (!noeqn)
  108. printf("\\&\\*(10\n");
  109. }
  110. printf(".EN");
  111. while (putchar(input()) != '\n')
  112. ;
  113. printf(".lf %d\n", curfile->lineno+1);
  114. }
  115. else if (type == lefteq)
  116. inlineeq();
  117. else if (in[0] == '.' && in[1] == 'l' && in[2] == 'f') {
  118. if (sscanf(in+3, "%d %s", &ln, fname) == 2) {
  119. free(curfile->fname);
  120. printf(".lf %d %s\n", curfile->lineno = ln, curfile->fname = strsave(fname));
  121. } else
  122. printf(".lf %d\n", curfile->lineno = ln);
  123. } else
  124. printf("%s", in);
  125. }
  126. return(0);
  127. }
  128. getline(char *s)
  129. {
  130. register c;
  131. while ((c=input()) != '\n' && c != EOF && c != lefteq) {
  132. if (s >= in+MAXLINE) {
  133. ERROR "input line too long: %.20s\n", in WARNING;
  134. in[MAXLINE] = '\0';
  135. break;
  136. }
  137. *s++ = c;
  138. }
  139. if (c != lefteq)
  140. *s++ = c;
  141. *s = '\0';
  142. return(c);
  143. }
  144. void inlineeq(void)
  145. {
  146. int ds, n, sz1 = 0;
  147. n = curfile->lineno;
  148. if (szstack[0] != 0)
  149. printf(".nr %d \\n(.s\n", sz1 = salloc());
  150. ds = salloc();
  151. printf(".rm %d \n", ds);
  152. display = 0;
  153. do {
  154. if (*in)
  155. printf(".as %d \"%s\n", ds, in);
  156. init();
  157. yyparse();
  158. if (eqnreg > 0) {
  159. printf(".as %d \\*(%d\n", ds, eqnreg);
  160. sfree(eqnreg);
  161. printf(".lf %d\n", curfile->lineno+1);
  162. }
  163. } while (getline(in) == lefteq);
  164. if (*in)
  165. printf(".as %d \"%s", ds, in);
  166. if (sz1)
  167. printf("\\s\\n(%d", sz1);
  168. printf("\\*(%d\n", ds);
  169. printf(".lf %d\n", curfile->lineno+1);
  170. if (curfile->lineno > n+3)
  171. fprintf(stderr, "eqn warning: multi-line %c...%c, file %s:%d,%d\n",
  172. lefteq, righteq, curfile->fname, n, curfile->lineno);
  173. sfree(ds);
  174. if (sz1) sfree(sz1);
  175. }
  176. void putout(int p1)
  177. {
  178. double before, after;
  179. extern double BeforeSub, AfterSub;
  180. dprintf(".\tanswer <- S%d, h=%g,b=%g\n",p1, eht[p1], ebase[p1]);
  181. eqnht = eht[p1];
  182. before = eht[p1] - ebase[p1] - BeforeSub; /* leave room for sub or superscript */
  183. after = ebase[p1] - AfterSub;
  184. if (spaceval || before > 0.01 || after > 0.01) {
  185. printf(".ds %d ", p1); /* used to be \\x'0' here: why? */
  186. if (spaceval != NULL)
  187. printf("\\x'0-%s'", spaceval);
  188. else if (before > 0.01)
  189. printf("\\x'0-%gm'", before);
  190. printf("\\*(%d", p1);
  191. if (spaceval == NULL && after > 0.01)
  192. printf("\\x'%gm'", after);
  193. putchar('\n');
  194. }
  195. if (szstack[0] != 0)
  196. printf(".ds %d %s\\*(%d\\s\\n(99\n", p1, DPS(gsize,gsize), p1);
  197. eqnreg = p1;
  198. if (spaceval != NULL) {
  199. free(spaceval);
  200. spaceval = NULL;
  201. }
  202. }
  203. void init(void)
  204. {
  205. synerr = 0;
  206. ct = 0;
  207. ps = gsize;
  208. ftp = ftstack;
  209. ft = ftp->ft;
  210. nszstack = 0;
  211. if (szstack[0] != 0) /* absolute gsize in effect */
  212. printf(".nr 99 \\n(.s\n");
  213. }
  214. salloc(void)
  215. {
  216. int i;
  217. for (i = 11; i < 100; i++)
  218. if (used[i] == 0) {
  219. used[i]++;
  220. return(i);
  221. }
  222. ERROR "no eqn strings left (%d)", i FATAL;
  223. return(0);
  224. }
  225. void sfree(int n)
  226. {
  227. used[n] = 0;
  228. }
  229. void nrwid(int n1, int p, int n2)
  230. {
  231. printf(".nr %d 0\\w'%s\\*(%d'\n", n1, DPS(gsize,p), n2); /* 0 defends against - width */
  232. }
  233. char *ABSPS(int dn) /* absolute size dn in printable form \sd or \s(dd (dd >= 40) */
  234. {
  235. static char buf[100], *lb = buf;
  236. char *p;
  237. if (lb > buf + sizeof(buf) - 10)
  238. lb = buf;
  239. p = lb;
  240. *lb++ = '\\';
  241. *lb++ = 's';
  242. if (dn >= 10) { /* \s(dd only works in new troff */
  243. if (dn >= 40)
  244. *lb++ = '(';
  245. *lb++ = dn/10 + '0';
  246. *lb++ = dn%10 + '0';
  247. } else {
  248. *lb++ = dn + '0';
  249. }
  250. *lb++ = '\0';
  251. return p;
  252. }
  253. char *DPS(int f, int t) /* delta ps (t-f) in printable form \s+d or \s-d or \s+-(dd */
  254. {
  255. static char buf[100], *lb = buf;
  256. char *p;
  257. int dn;
  258. if (lb > buf + sizeof(buf) - 10)
  259. lb = buf;
  260. p = lb;
  261. *lb++ = '\\';
  262. *lb++ = 's';
  263. dn = EFFPS(t) - EFFPS(f);
  264. if (szstack[nszstack] != 0) /* absolute */
  265. dn = EFFPS(t); /* should do proper \s(dd */
  266. else if (dn >= 0)
  267. *lb++ = '+';
  268. else {
  269. *lb++ = '-';
  270. dn = -dn;
  271. }
  272. if (dn >= 10) { /* \s+(dd only works in new troff */
  273. *lb++ = '(';
  274. *lb++ = dn/10 + '0';
  275. *lb++ = dn%10 + '0';
  276. } else {
  277. *lb++ = dn + '0';
  278. }
  279. *lb++ = '\0';
  280. return p;
  281. }
  282. EFFPS(int n) /* effective value of n */
  283. {
  284. if (n >= minsize)
  285. return n;
  286. else
  287. return minsize;
  288. }
  289. double EM(double m, int ps) /* convert m to ems in gsize */
  290. {
  291. m *= (double) EFFPS(ps) / gsize;
  292. if (m <= 0.001 && m >= -0.001)
  293. return 0;
  294. else
  295. return m;
  296. }
  297. double REL(double m, int ps) /* convert m to ems in ps */
  298. {
  299. m *= (double) gsize / EFFPS(ps);
  300. if (m <= 0.001 && m >= -0.001)
  301. return 0;
  302. else
  303. return m;
  304. }