Annotation of src/usr.bin/mandoc/eqn.c, Revision 1.15
1.15 ! schwarze 1: /* $OpenBSD: eqn.c,v 1.14 2014/10/10 15:25:06 schwarze Exp $ */
1.1 schwarze 2: /*
1.13 schwarze 3: * Copyright (c) 2011, 2014 Kristaps Dzonsons <kristaps@bsd.lv>
1.1 schwarze 4: *
5: * Permission to use, copy, modify, and distribute this software for any
6: * purpose with or without fee is hereby granted, provided that the above
7: * copyright notice and this permission notice appear in all copies.
8: *
9: * THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES
10: * WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF
11: * MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR
12: * ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
13: * WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN
14: * ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF
15: * OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
16: */
1.14 schwarze 17: #include <sys/types.h>
18:
1.1 schwarze 19: #include <assert.h>
1.4 schwarze 20: #include <limits.h>
21: #include <stdio.h>
1.1 schwarze 22: #include <stdlib.h>
23: #include <string.h>
1.5 schwarze 24: #include <time.h>
1.1 schwarze 25:
26: #include "mandoc.h"
1.6 schwarze 27: #include "mandoc_aux.h"
1.1 schwarze 28: #include "libmandoc.h"
29: #include "libroff.h"
30:
1.14 schwarze 31: #define EQN_MSG(t, x) \
32: mandoc_msg((t), (x)->parse, (x)->eqn.ln, (x)->eqn.pos, NULL)
1.4 schwarze 33: #define EQN_NEST_MAX 128 /* maximum nesting of defines */
1.14 schwarze 34: #define STRNEQ(p1, sz1, p2, sz2) \
35: ((sz1) == (sz2) && 0 == strncmp((p1), (p2), (sz1)))
36: #define EQNSTREQ(x, p, sz) \
37: STRNEQ((x)->name, (x)->sz, (p), (sz))
38:
39: enum eqn_tok {
40: EQN_TOK_DYAD = 0,
41: EQN_TOK_VEC,
42: EQN_TOK_UNDER,
43: EQN_TOK_BAR,
44: EQN_TOK_TILDE,
45: EQN_TOK_HAT,
46: EQN_TOK_DOT,
47: EQN_TOK_DOTDOT,
48: EQN_TOK_FWD,
49: EQN_TOK_BACK,
50: EQN_TOK_DOWN,
51: EQN_TOK_UP,
52: EQN_TOK_FAT,
53: EQN_TOK_ROMAN,
54: EQN_TOK_ITALIC,
55: EQN_TOK_BOLD,
56: EQN_TOK_SIZE,
57: EQN_TOK_SUB,
58: EQN_TOK_SUP,
59: EQN_TOK_SQRT,
60: EQN_TOK_OVER,
61: EQN_TOK_FROM,
62: EQN_TOK_TO,
63: EQN_TOK_BRACE_OPEN,
64: EQN_TOK_BRACE_CLOSE,
65: EQN_TOK_GSIZE,
66: EQN_TOK_GFONT,
67: EQN_TOK_MARK,
68: EQN_TOK_LINEUP,
69: EQN_TOK_LEFT,
70: EQN_TOK_RIGHT,
71: EQN_TOK_PILE,
72: EQN_TOK_LPILE,
73: EQN_TOK_RPILE,
74: EQN_TOK_CPILE,
75: EQN_TOK_MATRIX,
76: EQN_TOK_CCOL,
77: EQN_TOK_LCOL,
78: EQN_TOK_RCOL,
79: EQN_TOK_DELIM,
80: EQN_TOK_DEFINE,
81: EQN_TOK_TDEFINE,
82: EQN_TOK_NDEFINE,
83: EQN_TOK_UNDEF,
84: EQN_TOK_EOF,
85: EQN_TOK_ABOVE,
86: EQN_TOK__MAX
87: };
1.4 schwarze 88:
1.14 schwarze 89: static const char *eqn_toks[EQN_TOK__MAX] = {
90: "dyad", /* EQN_TOK_DYAD */
91: "vec", /* EQN_TOK_VEC */
92: "under", /* EQN_TOK_UNDER */
93: "bar", /* EQN_TOK_BAR */
94: "tilde", /* EQN_TOK_TILDE */
95: "hat", /* EQN_TOK_HAT */
96: "dot", /* EQN_TOK_DOT */
97: "dotdot", /* EQN_TOK_DOTDOT */
98: "fwd", /* EQN_TOK_FWD * */
99: "back", /* EQN_TOK_BACK */
100: "down", /* EQN_TOK_DOWN */
101: "up", /* EQN_TOK_UP */
102: "fat", /* EQN_TOK_FAT */
103: "roman", /* EQN_TOK_ROMAN */
104: "italic", /* EQN_TOK_ITALIC */
105: "bold", /* EQN_TOK_BOLD */
106: "size", /* EQN_TOK_SIZE */
107: "sub", /* EQN_TOK_SUB */
108: "sup", /* EQN_TOK_SUP */
109: "sqrt", /* EQN_TOK_SQRT */
110: "over", /* EQN_TOK_OVER */
111: "from", /* EQN_TOK_FROM */
112: "to", /* EQN_TOK_TO */
113: "{", /* EQN_TOK_BRACE_OPEN */
114: "}", /* EQN_TOK_BRACE_CLOSE */
115: "gsize", /* EQN_TOK_GSIZE */
116: "gfont", /* EQN_TOK_GFONT */
117: "mark", /* EQN_TOK_MARK */
118: "lineup", /* EQN_TOK_LINEUP */
119: "left", /* EQN_TOK_LEFT */
120: "right", /* EQN_TOK_RIGHT */
121: "pile", /* EQN_TOK_PILE */
122: "lpile", /* EQN_TOK_LPILE */
123: "rpile", /* EQN_TOK_RPILE */
124: "cpile", /* EQN_TOK_CPILE */
125: "matrix", /* EQN_TOK_MATRIX */
126: "ccol", /* EQN_TOK_CCOL */
127: "lcol", /* EQN_TOK_LCOL */
128: "rcol", /* EQN_TOK_RCOL */
129: "delim", /* EQN_TOK_DELIM */
130: "define", /* EQN_TOK_DEFINE */
131: "tdefine", /* EQN_TOK_TDEFINE */
132: "ndefine", /* EQN_TOK_NDEFINE */
133: "undef", /* EQN_TOK_UNDEF */
134: NULL, /* EQN_TOK_EOF */
135: "above", /* EQN_TOK_ABOVE */
1.4 schwarze 136: };
137:
138: enum eqn_symt {
139: EQNSYM_alpha,
140: EQNSYM_beta,
141: EQNSYM_chi,
142: EQNSYM_delta,
143: EQNSYM_epsilon,
144: EQNSYM_eta,
145: EQNSYM_gamma,
146: EQNSYM_iota,
147: EQNSYM_kappa,
148: EQNSYM_lambda,
149: EQNSYM_mu,
150: EQNSYM_nu,
151: EQNSYM_omega,
152: EQNSYM_omicron,
153: EQNSYM_phi,
154: EQNSYM_pi,
155: EQNSYM_ps,
156: EQNSYM_rho,
157: EQNSYM_sigma,
158: EQNSYM_tau,
159: EQNSYM_theta,
160: EQNSYM_upsilon,
161: EQNSYM_xi,
162: EQNSYM_zeta,
163: EQNSYM_DELTA,
164: EQNSYM_GAMMA,
165: EQNSYM_LAMBDA,
166: EQNSYM_OMEGA,
167: EQNSYM_PHI,
168: EQNSYM_PI,
169: EQNSYM_PSI,
170: EQNSYM_SIGMA,
171: EQNSYM_THETA,
172: EQNSYM_UPSILON,
173: EQNSYM_XI,
174: EQNSYM_inter,
175: EQNSYM_union,
176: EQNSYM_prod,
177: EQNSYM_int,
178: EQNSYM_sum,
179: EQNSYM_grad,
180: EQNSYM_del,
181: EQNSYM_times,
182: EQNSYM_cdot,
183: EQNSYM_nothing,
184: EQNSYM_approx,
185: EQNSYM_prime,
186: EQNSYM_half,
187: EQNSYM_partial,
188: EQNSYM_inf,
189: EQNSYM_muchgreat,
190: EQNSYM_muchless,
191: EQNSYM_larrow,
192: EQNSYM_rarrow,
193: EQNSYM_pm,
194: EQNSYM_nequal,
195: EQNSYM_equiv,
196: EQNSYM_lessequal,
197: EQNSYM_moreequal,
198: EQNSYM__MAX
199: };
200:
201: struct eqnsym {
1.14 schwarze 202: const char *str;
1.4 schwarze 203: const char *sym;
204: };
205:
206: static const struct eqnsym eqnsyms[EQNSYM__MAX] = {
1.14 schwarze 207: { "alpha", "*a" }, /* EQNSYM_alpha */
208: { "beta", "*b" }, /* EQNSYM_beta */
209: { "chi", "*x" }, /* EQNSYM_chi */
210: { "delta", "*d" }, /* EQNSYM_delta */
211: { "epsilon", "*e" }, /* EQNSYM_epsilon */
212: { "eta", "*y" }, /* EQNSYM_eta */
213: { "gamma", "*g" }, /* EQNSYM_gamma */
214: { "iota", "*i" }, /* EQNSYM_iota */
215: { "kappa", "*k" }, /* EQNSYM_kappa */
216: { "lambda", "*l" }, /* EQNSYM_lambda */
217: { "mu", "*m" }, /* EQNSYM_mu */
218: { "nu", "*n" }, /* EQNSYM_nu */
219: { "omega", "*w" }, /* EQNSYM_omega */
220: { "omicron", "*o" }, /* EQNSYM_omicron */
221: { "phi", "*f" }, /* EQNSYM_phi */
222: { "pi", "*p" }, /* EQNSYM_pi */
223: { "psi", "*q" }, /* EQNSYM_psi */
224: { "rho", "*r" }, /* EQNSYM_rho */
225: { "sigma", "*s" }, /* EQNSYM_sigma */
226: { "tau", "*t" }, /* EQNSYM_tau */
227: { "theta", "*h" }, /* EQNSYM_theta */
228: { "upsilon", "*u" }, /* EQNSYM_upsilon */
229: { "xi", "*c" }, /* EQNSYM_xi */
230: { "zeta", "*z" }, /* EQNSYM_zeta */
231: { "DELTA", "*D" }, /* EQNSYM_DELTA */
232: { "GAMMA", "*G" }, /* EQNSYM_GAMMA */
233: { "LAMBDA", "*L" }, /* EQNSYM_LAMBDA */
234: { "OMEGA", "*W" }, /* EQNSYM_OMEGA */
235: { "PHI", "*F" }, /* EQNSYM_PHI */
236: { "PI", "*P" }, /* EQNSYM_PI */
237: { "PSI", "*Q" }, /* EQNSYM_PSI */
238: { "SIGMA", "*S" }, /* EQNSYM_SIGMA */
239: { "THETA", "*H" }, /* EQNSYM_THETA */
240: { "UPSILON", "*U" }, /* EQNSYM_UPSILON */
241: { "XI", "*C" }, /* EQNSYM_XI */
242: { "inter", "ca" }, /* EQNSYM_inter */
243: { "union", "cu" }, /* EQNSYM_union */
244: { "prod", "product" }, /* EQNSYM_prod */
245: { "int", "integral" }, /* EQNSYM_int */
246: { "sum", "sum" }, /* EQNSYM_sum */
247: { "grad", "gr" }, /* EQNSYM_grad */
248: { "del", "gr" }, /* EQNSYM_del */
249: { "times", "mu" }, /* EQNSYM_times */
250: { "cdot", "pc" }, /* EQNSYM_cdot */
251: { "nothing", "&" }, /* EQNSYM_nothing */
252: { "approx", "~~" }, /* EQNSYM_approx */
253: { "prime", "aq" }, /* EQNSYM_prime */
254: { "half", "12" }, /* EQNSYM_half */
255: { "partial", "pd" }, /* EQNSYM_partial */
256: { "inf", "if" }, /* EQNSYM_inf */
257: { ">>", ">>" }, /* EQNSYM_muchgreat */
258: { "<<", "<<" }, /* EQNSYM_muchless */
259: { "<-", "<-" }, /* EQNSYM_larrow */
260: { "->", "->" }, /* EQNSYM_rarrow */
261: { "+-", "+-" }, /* EQNSYM_pm */
262: { "!=", "!=" }, /* EQNSYM_nequal */
263: { "==", "==" }, /* EQNSYM_equiv */
264: { "<=", "<=" }, /* EQNSYM_lessequal */
265: { ">=", ">=" }, /* EQNSYM_moreequal */
1.4 schwarze 266: };
267:
1.1 schwarze 268: enum rofferr
1.7 schwarze 269: eqn_read(struct eqn_node **epp, int ln,
1.4 schwarze 270: const char *p, int pos, int *offs)
1.1 schwarze 271: {
272: size_t sz;
273: struct eqn_node *ep;
1.4 schwarze 274: enum rofferr er;
1.1 schwarze 275:
276: ep = *epp;
277:
1.4 schwarze 278: /*
279: * If we're the terminating mark, unset our equation status and
280: * validate the full equation.
281: */
282:
283: if (0 == strncmp(p, ".EN", 3)) {
284: er = eqn_end(epp);
285: p += 3;
286: while (' ' == *p || '\t' == *p)
287: p++;
1.7 schwarze 288: if ('\0' == *p)
1.4 schwarze 289: return(er);
1.10 schwarze 290: mandoc_vmsg(MANDOCERR_ARG_SKIP, ep->parse,
291: ln, pos, "EN %s", p);
1.4 schwarze 292: return(er);
293: }
1.1 schwarze 294:
1.4 schwarze 295: /*
296: * Build up the full string, replacing all newlines with regular
297: * whitespace.
298: */
299:
300: sz = strlen(p + pos) + 1;
301: ep->data = mandoc_realloc(ep->data, ep->sz + sz + 1);
302:
303: /* First invocation: nil terminate the string. */
304:
305: if (0 == ep->sz)
306: *ep->data = '\0';
307:
308: ep->sz += sz;
309: strlcat(ep->data, p + pos, ep->sz + 1);
310: strlcat(ep->data, " ", ep->sz + 1);
1.1 schwarze 311: return(ROFF_IGN);
312: }
313:
314: struct eqn_node *
1.4 schwarze 315: eqn_alloc(const char *name, int pos, int line, struct mparse *parse)
1.1 schwarze 316: {
317: struct eqn_node *p;
1.4 schwarze 318: size_t sz;
319: const char *end;
1.1 schwarze 320:
321: p = mandoc_calloc(1, sizeof(struct eqn_node));
1.4 schwarze 322:
323: if (name && '\0' != *name) {
324: sz = strlen(name);
325: assert(sz);
326: do {
327: sz--;
328: end = name + (int)sz;
329: } while (' ' == *end || '\t' == *end);
330: p->eqn.name = mandoc_strndup(name, sz + 1);
331: }
332:
333: p->parse = parse;
334: p->eqn.ln = line;
1.1 schwarze 335: p->eqn.pos = pos;
1.4 schwarze 336: p->gsize = EQN_DEFSIZE;
1.1 schwarze 337:
338: return(p);
339: }
340:
1.14 schwarze 341: /*
342: * Find the key "key" of the give size within our eqn-defined values.
343: */
344: static struct eqn_def *
345: eqn_def_find(struct eqn_node *ep, const char *key, size_t sz)
1.1 schwarze 346: {
1.4 schwarze 347: int i;
348:
1.14 schwarze 349: for (i = 0; i < (int)ep->defsz; i++)
350: if (ep->defs[i].keysz && STRNEQ(ep->defs[i].key,
351: ep->defs[i].keysz, key, sz))
352: return(&ep->defs[i]);
1.4 schwarze 353:
1.14 schwarze 354: return(NULL);
1.4 schwarze 355: }
356:
1.14 schwarze 357: /*
358: * Get the next token from the input stream using the given quote
359: * character.
360: * Optionally make any replacements.
361: */
1.4 schwarze 362: static const char *
363: eqn_next(struct eqn_node *ep, char quote, size_t *sz, int repl)
364: {
365: char *start, *next;
366: int q, diff, lim;
367: size_t ssz, dummy;
368: struct eqn_def *def;
369:
370: if (NULL == sz)
371: sz = &dummy;
372:
373: lim = 0;
374: ep->rew = ep->cur;
375: again:
376: /* Prevent self-definitions. */
377:
378: if (lim >= EQN_NEST_MAX) {
379: EQN_MSG(MANDOCERR_ROFFLOOP, ep);
380: return(NULL);
381: }
382:
383: ep->cur = ep->rew;
384: start = &ep->data[(int)ep->cur];
385: q = 0;
386:
387: if ('\0' == *start)
388: return(NULL);
389:
390: if (quote == *start) {
391: ep->cur++;
392: q = 1;
393: }
394:
395: start = &ep->data[(int)ep->cur];
396:
397: if ( ! q) {
398: if ('{' == *start || '}' == *start)
399: ssz = 1;
400: else
401: ssz = strcspn(start + 1, " ^~\"{}\t") + 1;
402: next = start + (int)ssz;
403: if ('\0' == *next)
404: next = NULL;
405: } else
406: next = strchr(start, quote);
407:
408: if (NULL != next) {
409: *sz = (size_t)(next - start);
410: ep->cur += *sz;
411: if (q)
412: ep->cur++;
413: while (' ' == ep->data[(int)ep->cur] ||
1.7 schwarze 414: '\t' == ep->data[(int)ep->cur] ||
415: '^' == ep->data[(int)ep->cur] ||
416: '~' == ep->data[(int)ep->cur])
1.4 schwarze 417: ep->cur++;
418: } else {
419: if (q)
1.11 schwarze 420: EQN_MSG(MANDOCERR_ARG_QUOTE, ep);
1.4 schwarze 421: next = strchr(start, '\0');
422: *sz = (size_t)(next - start);
423: ep->cur += *sz;
424: }
425:
426: /* Quotes aren't expanded for values. */
427:
428: if (q || ! repl)
429: return(start);
430:
431: if (NULL != (def = eqn_def_find(ep, start, *sz))) {
432: diff = def->valsz - *sz;
433:
434: if (def->valsz > *sz) {
435: ep->sz += diff;
436: ep->data = mandoc_realloc(ep->data, ep->sz + 1);
437: ep->data[ep->sz] = '\0';
438: start = &ep->data[(int)ep->rew];
439: }
440:
441: diff = def->valsz - *sz;
1.7 schwarze 442: memmove(start + *sz + diff, start + *sz,
443: (strlen(start) - *sz) + 1);
1.4 schwarze 444: memcpy(start, def->val, def->valsz);
445: goto again;
446: }
447:
448: return(start);
449: }
450:
1.14 schwarze 451: /*
452: * Get the next delimited token using the default current quote
453: * character.
454: */
455: static const char *
456: eqn_nexttok(struct eqn_node *ep, size_t *sz)
457: {
458:
459: return(eqn_next(ep, '"', sz, 1));
460: }
461:
462: /*
463: * Get next token without replacement.
464: */
465: static const char *
466: eqn_nextrawtok(struct eqn_node *ep, size_t *sz)
467: {
468:
469: return(eqn_next(ep, '"', sz, 0));
470: }
471:
472: /*
473: * Parse a token from the stream of text.
474: * A token consists of one of the recognised eqn(7) strings.
475: * Strings are separated by delimiting marks.
476: * This returns EQN_TOK_EOF when there are no more tokens.
477: * If the token is an unrecognised string literal, then it returns
478: * EQN_TOK__MAX and sets the "p" pointer to an allocated, nil-terminated
479: * string.
480: * This must be later freed with free(3).
481: */
482: static enum eqn_tok
483: eqn_tok_parse(struct eqn_node *ep, char **p)
484: {
485: const char *start;
486: size_t i, sz;
487:
488: if (NULL != p)
489: *p = NULL;
490:
491: if (NULL == (start = eqn_nexttok(ep, &sz)))
492: return(EQN_TOK_EOF);
493:
494: for (i = 0; i < EQN_TOK__MAX; i++) {
495: if (NULL == eqn_toks[i])
496: continue;
497: if (STRNEQ(start, sz, eqn_toks[i], strlen(eqn_toks[i])))
498: break;
499: }
500:
501: if (i == EQN_TOK__MAX && NULL != p)
502: *p = mandoc_strndup(start, sz);
503:
504: return(i);
505: }
506:
507: static void
508: eqn_box_free(struct eqn_box *bp)
1.4 schwarze 509: {
510:
1.14 schwarze 511: if (bp->first)
512: eqn_box_free(bp->first);
513: if (bp->next)
514: eqn_box_free(bp->next);
1.4 schwarze 515:
1.14 schwarze 516: free(bp->text);
517: free(bp->left);
518: free(bp->right);
519: free(bp->top);
520: free(bp->bottom);
521: free(bp);
1.4 schwarze 522: }
523:
1.14 schwarze 524: /*
525: * Allocate a box as the last child of the parent node.
526: */
527: static struct eqn_box *
528: eqn_box_alloc(struct eqn_node *ep, struct eqn_box *parent)
1.4 schwarze 529: {
1.14 schwarze 530: struct eqn_box *bp;
531:
532: bp = mandoc_calloc(1, sizeof(struct eqn_box));
533: bp->parent = parent;
534: bp->parent->args++;
535: bp->expectargs = UINT_MAX;
536: bp->size = ep->gsize;
537:
538: if (NULL != parent->first) {
539: parent->last->next = bp;
540: bp->prev = parent->last;
541: } else
542: parent->first = bp;
543:
544: parent->last = bp;
545: return(bp);
546: }
1.4 schwarze 547:
1.14 schwarze 548: /*
549: * Reparent the current last node (of the current parent) under a new
550: * EQN_SUBEXPR as the first element.
551: * Then return the new parent.
552: * The new EQN_SUBEXPR will have a two-child limit.
553: */
554: static struct eqn_box *
555: eqn_box_makebinary(struct eqn_node *ep,
556: enum eqn_post pos, struct eqn_box *parent)
557: {
558: struct eqn_box *b, *newb;
1.4 schwarze 559:
1.14 schwarze 560: assert(NULL != parent->last);
561: b = parent->last;
562: if (parent->last == parent->first)
563: parent->first = NULL;
564: parent->args--;
565: parent->last = b->prev;
566: b->prev = NULL;
567: newb = eqn_box_alloc(ep, parent);
568: newb->pos = pos;
569: newb->type = EQN_SUBEXPR;
570: newb->expectargs = 2;
571: newb->args = 1;
572: newb->first = newb->last = b;
573: newb->first->next = NULL;
574: b->parent = newb;
575: return(newb);
1.4 schwarze 576: }
577:
1.14 schwarze 578: /*
579: * Undefine a previously-defined string.
580: */
1.4 schwarze 581: static int
1.14 schwarze 582: eqn_undef(struct eqn_node *ep)
1.4 schwarze 583: {
1.14 schwarze 584: const char *start;
585: struct eqn_def *def;
586: size_t sz;
1.4 schwarze 587:
1.14 schwarze 588: if (NULL == (start = eqn_nextrawtok(ep, &sz))) {
1.4 schwarze 589: EQN_MSG(MANDOCERR_EQNEOF, ep);
1.14 schwarze 590: return(0);
591: } else if (NULL != (def = eqn_def_find(ep, start, sz)))
592: def->keysz = 0;
1.4 schwarze 593:
1.14 schwarze 594: return(1);
1.4 schwarze 595: }
596:
597: static int
1.14 schwarze 598: eqn_def(struct eqn_node *ep)
1.4 schwarze 599: {
600: const char *start;
601: size_t sz;
602: struct eqn_def *def;
603: int i;
604:
605: if (NULL == (start = eqn_nextrawtok(ep, &sz))) {
606: EQN_MSG(MANDOCERR_EQNEOF, ep);
607: return(0);
608: }
609:
1.7 schwarze 610: /*
611: * Search for a key that already exists.
1.4 schwarze 612: * Create a new key if none is found.
613: */
614: if (NULL == (def = eqn_def_find(ep, start, sz))) {
615: /* Find holes in string array. */
616: for (i = 0; i < (int)ep->defsz; i++)
617: if (0 == ep->defs[i].keysz)
618: break;
619:
620: if (i == (int)ep->defsz) {
621: ep->defsz++;
1.9 schwarze 622: ep->defs = mandoc_reallocarray(ep->defs,
623: ep->defsz, sizeof(struct eqn_def));
1.4 schwarze 624: ep->defs[i].key = ep->defs[i].val = NULL;
625: }
626:
627: ep->defs[i].keysz = sz;
1.7 schwarze 628: ep->defs[i].key = mandoc_realloc(
629: ep->defs[i].key, sz + 1);
1.4 schwarze 630:
631: memcpy(ep->defs[i].key, start, sz);
632: ep->defs[i].key[(int)sz] = '\0';
633: def = &ep->defs[i];
634: }
635:
636: start = eqn_next(ep, ep->data[(int)ep->cur], &sz, 0);
637:
638: if (NULL == start) {
639: EQN_MSG(MANDOCERR_EQNEOF, ep);
1.14 schwarze 640: return(-1);
1.4 schwarze 641: }
642:
643: def->valsz = sz;
644: def->val = mandoc_realloc(def->val, sz + 1);
645: memcpy(def->val, start, sz);
646: def->val[(int)sz] = '\0';
647: return(1);
648: }
649:
1.14 schwarze 650: /*
651: * Recursively parse an eqn(7) expression.
652: */
1.4 schwarze 653: static int
1.14 schwarze 654: eqn_parse(struct eqn_node *ep, struct eqn_box *parent)
1.4 schwarze 655: {
1.14 schwarze 656: char *p;
1.15 ! schwarze 657: enum eqn_tok tok, subtok;
1.14 schwarze 658: enum eqn_post pos;
659: struct eqn_box *cur;
660: int rc, size;
661: size_t i, sz;
662: char sym[64];
663: const char *start;
1.4 schwarze 664:
1.14 schwarze 665: assert(NULL != parent);
1.4 schwarze 666:
1.15 ! schwarze 667: next_tok:
! 668: tok = eqn_tok_parse(ep, &p);
! 669:
! 670: this_tok:
! 671: switch (tok) {
1.14 schwarze 672: case (EQN_TOK_UNDEF):
673: if ((rc = eqn_undef(ep)) <= 0)
674: return(rc);
675: break;
676: case (EQN_TOK_NDEFINE):
677: case (EQN_TOK_DEFINE):
678: if ((rc = eqn_def(ep)) <= 0)
679: return(rc);
680: break;
681: case (EQN_TOK_TDEFINE):
682: if (NULL == eqn_nextrawtok(ep, NULL))
683: EQN_MSG(MANDOCERR_EQNEOF, ep);
684: else if (NULL == eqn_next(ep,
685: ep->data[(int)ep->cur], NULL, 0))
686: EQN_MSG(MANDOCERR_EQNEOF, ep);
687: break;
688: case (EQN_TOK_DELIM):
689: case (EQN_TOK_GFONT):
1.15 ! schwarze 690: if (eqn_nextrawtok(ep, NULL) == NULL)
! 691: mandoc_msg(MANDOCERR_REQ_EMPTY, ep->parse,
! 692: ep->eqn.ln, ep->eqn.pos, eqn_toks[tok]);
1.14 schwarze 693: break;
694: case (EQN_TOK_MARK):
695: case (EQN_TOK_LINEUP):
696: /* Ignore these. */
697: break;
698: case (EQN_TOK_DYAD):
699: case (EQN_TOK_VEC):
700: case (EQN_TOK_UNDER):
701: case (EQN_TOK_BAR):
702: case (EQN_TOK_TILDE):
703: case (EQN_TOK_HAT):
704: case (EQN_TOK_DOT):
705: case (EQN_TOK_DOTDOT):
1.15 ! schwarze 706: if (parent->last == NULL) {
! 707: mandoc_msg(MANDOCERR_EQN_NOBOX, ep->parse,
! 708: ep->eqn.ln, ep->eqn.pos, eqn_toks[tok]);
! 709: cur = eqn_box_alloc(ep, parent);
! 710: cur->type = EQN_TEXT;
! 711: cur->text = mandoc_strdup("");
1.14 schwarze 712: }
713: parent = eqn_box_makebinary(ep, EQNPOS_NONE, parent);
714: parent->type = EQN_LISTONE;
715: parent->expectargs = 1;
716: switch (tok) {
717: case (EQN_TOK_DOTDOT):
718: strlcpy(sym, "\\[ad]", sizeof(sym));
719: break;
720: case (EQN_TOK_VEC):
721: strlcpy(sym, "\\[->]", sizeof(sym));
722: break;
723: case (EQN_TOK_DYAD):
724: strlcpy(sym, "\\[<>]", sizeof(sym));
725: break;
726: case (EQN_TOK_TILDE):
727: strlcpy(sym, "\\[a~]", sizeof(sym));
728: break;
729: case (EQN_TOK_UNDER):
730: strlcpy(sym, "\\[ul]", sizeof(sym));
731: break;
732: case (EQN_TOK_BAR):
733: strlcpy(sym, "\\[rl]", sizeof(sym));
734: break;
735: case (EQN_TOK_DOT):
736: strlcpy(sym, "\\[a.]", sizeof(sym));
737: break;
738: case (EQN_TOK_HAT):
739: strlcpy(sym, "\\[ha]", sizeof(sym));
740: break;
741: default:
742: abort();
743: }
1.4 schwarze 744:
1.14 schwarze 745: switch (tok) {
746: case (EQN_TOK_DOTDOT):
747: case (EQN_TOK_VEC):
748: case (EQN_TOK_DYAD):
749: case (EQN_TOK_TILDE):
750: case (EQN_TOK_BAR):
751: case (EQN_TOK_DOT):
752: case (EQN_TOK_HAT):
753: parent->top = mandoc_strdup(sym);
754: break;
755: case (EQN_TOK_UNDER):
756: parent->bottom = mandoc_strdup(sym);
757: break;
758: default:
759: abort();
760: }
761: parent = parent->parent;
762: break;
763: case (EQN_TOK_FWD):
764: case (EQN_TOK_BACK):
765: case (EQN_TOK_DOWN):
766: case (EQN_TOK_UP):
1.15 ! schwarze 767: subtok = eqn_tok_parse(ep, NULL);
! 768: if (subtok != EQN_TOK__MAX) {
! 769: mandoc_msg(MANDOCERR_REQ_EMPTY, ep->parse,
! 770: ep->eqn.ln, ep->eqn.pos, eqn_toks[tok]);
! 771: tok = subtok;
! 772: goto this_tok;
1.14 schwarze 773: }
774: break;
775: case (EQN_TOK_FAT):
776: case (EQN_TOK_ROMAN):
777: case (EQN_TOK_ITALIC):
778: case (EQN_TOK_BOLD):
779: while (parent->args == parent->expectargs)
1.15 ! schwarze 780: parent = parent->parent;
1.14 schwarze 781: /*
782: * These values apply to the next word or sequence of
783: * words; thus, we mark that we'll have a child with
784: * exactly one of those.
785: */
786: parent = eqn_box_alloc(ep, parent);
787: parent->type = EQN_LISTONE;
788: parent->expectargs = 1;
789: switch (tok) {
790: case (EQN_TOK_FAT):
791: parent->font = EQNFONT_FAT;
792: break;
793: case (EQN_TOK_ROMAN):
794: parent->font = EQNFONT_ROMAN;
795: break;
796: case (EQN_TOK_ITALIC):
797: parent->font = EQNFONT_ITALIC;
798: break;
799: case (EQN_TOK_BOLD):
800: parent->font = EQNFONT_BOLD;
801: break;
802: default:
803: abort();
804: }
805: break;
806: case (EQN_TOK_SIZE):
807: case (EQN_TOK_GSIZE):
808: /* Accept two values: integral size and a single. */
809: if (NULL == (start = eqn_nexttok(ep, &sz))) {
1.15 ! schwarze 810: mandoc_msg(MANDOCERR_REQ_EMPTY, ep->parse,
! 811: ep->eqn.ln, ep->eqn.pos, eqn_toks[tok]);
! 812: break;
1.14 schwarze 813: }
814: size = mandoc_strntoi(start, sz, 10);
815: if (-1 == size) {
1.15 ! schwarze 816: mandoc_msg(MANDOCERR_IT_NONUM, ep->parse,
! 817: ep->eqn.ln, ep->eqn.pos, eqn_toks[tok]);
! 818: break;
1.14 schwarze 819: }
820: if (EQN_TOK_GSIZE == tok) {
821: ep->gsize = size;
822: break;
823: }
824: parent = eqn_box_alloc(ep, parent);
825: parent->type = EQN_LISTONE;
826: parent->expectargs = 1;
827: parent->size = size;
828: break;
829: case (EQN_TOK_FROM):
830: case (EQN_TOK_TO):
831: case (EQN_TOK_SUB):
832: case (EQN_TOK_SUP):
833: /*
834: * We have a left-right-associative expression.
835: * Repivot under a positional node, open a child scope
836: * and keep on reading.
837: */
1.15 ! schwarze 838: if (parent->last == NULL) {
! 839: mandoc_msg(MANDOCERR_EQN_NOBOX, ep->parse,
! 840: ep->eqn.ln, ep->eqn.pos, eqn_toks[tok]);
! 841: cur = eqn_box_alloc(ep, parent);
! 842: cur->type = EQN_TEXT;
! 843: cur->text = mandoc_strdup("");
1.14 schwarze 844: }
845: /* Handle the "subsup" and "fromto" positions. */
846: if (EQN_TOK_SUP == tok && parent->pos == EQNPOS_SUB) {
847: parent->expectargs = 3;
848: parent->pos = EQNPOS_SUBSUP;
849: break;
850: }
851: if (EQN_TOK_TO == tok && parent->pos == EQNPOS_FROM) {
852: parent->expectargs = 3;
853: parent->pos = EQNPOS_FROMTO;
854: break;
855: }
856: switch (tok) {
857: case (EQN_TOK_FROM):
858: pos = EQNPOS_FROM;
859: break;
860: case (EQN_TOK_TO):
861: pos = EQNPOS_TO;
862: break;
863: case (EQN_TOK_SUP):
864: pos = EQNPOS_SUP;
865: break;
866: case (EQN_TOK_SUB):
867: pos = EQNPOS_SUB;
868: break;
869: default:
870: abort();
871: }
872: parent = eqn_box_makebinary(ep, pos, parent);
873: break;
874: case (EQN_TOK_SQRT):
875: while (parent->args == parent->expectargs)
1.15 ! schwarze 876: parent = parent->parent;
1.14 schwarze 877: /*
878: * Accept a left-right-associative set of arguments just
879: * like sub and sup and friends but without rebalancing
880: * under a pivot.
881: */
882: parent = eqn_box_alloc(ep, parent);
883: parent->type = EQN_SUBEXPR;
884: parent->pos = EQNPOS_SQRT;
885: parent->expectargs = 1;
886: break;
887: case (EQN_TOK_OVER):
888: /*
889: * We have a right-left-associative fraction.
890: * Close out anything that's currently open, then
891: * rebalance and continue reading.
892: */
1.15 ! schwarze 893: if (parent->last == NULL) {
! 894: mandoc_msg(MANDOCERR_EQN_NOBOX, ep->parse,
! 895: ep->eqn.ln, ep->eqn.pos, eqn_toks[tok]);
! 896: cur = eqn_box_alloc(ep, parent);
! 897: cur->type = EQN_TEXT;
! 898: cur->text = mandoc_strdup("");
1.14 schwarze 899: }
900: while (EQN_SUBEXPR == parent->type)
1.15 ! schwarze 901: parent = parent->parent;
1.14 schwarze 902: parent = eqn_box_makebinary(ep, EQNPOS_OVER, parent);
903: break;
904: case (EQN_TOK_RIGHT):
905: case (EQN_TOK_BRACE_CLOSE):
906: /*
907: * Close out the existing brace.
908: * FIXME: this is a shitty sentinel: we should really
909: * have a native EQN_BRACE type or whatnot.
910: */
1.15 ! schwarze 911: for (cur = parent; cur != NULL; cur = cur->parent)
! 912: if (cur->type == EQN_LIST &&
! 913: (tok == EQN_TOK_BRACE_CLOSE ||
! 914: cur->left != NULL))
! 915: break;
! 916: if (cur == NULL) {
! 917: mandoc_msg(MANDOCERR_BLK_NOTOPEN, ep->parse,
! 918: ep->eqn.ln, ep->eqn.pos, eqn_toks[tok]);
! 919: break;
! 920: }
! 921: parent = cur;
1.14 schwarze 922: if (EQN_TOK_RIGHT == tok) {
923: if (NULL == (start = eqn_nexttok(ep, &sz))) {
1.15 ! schwarze 924: mandoc_msg(MANDOCERR_REQ_EMPTY,
! 925: ep->parse, ep->eqn.ln,
! 926: ep->eqn.pos, eqn_toks[tok]);
! 927: break;
1.14 schwarze 928: }
929: /* Handling depends on right/left. */
930: if (STRNEQ(start, sz, "ceiling", 7)) {
931: strlcpy(sym, "\\[rc]", sizeof(sym));
932: parent->right = mandoc_strdup(sym);
933: } else if (STRNEQ(start, sz, "floor", 5)) {
934: strlcpy(sym, "\\[rf]", sizeof(sym));
935: parent->right = mandoc_strdup(sym);
936: } else
937: parent->right = mandoc_strndup(start, sz);
938: }
1.15 ! schwarze 939: parent = parent->parent;
1.14 schwarze 940: if (EQN_TOK_BRACE_CLOSE == tok && parent &&
941: (parent->type == EQN_PILE ||
942: parent->type == EQN_MATRIX))
943: parent = parent->parent;
944: /* Close out any "singleton" lists. */
945: while (parent->type == EQN_LISTONE &&
946: parent->args == parent->expectargs)
1.15 ! schwarze 947: parent = parent->parent;
1.14 schwarze 948: break;
949: case (EQN_TOK_BRACE_OPEN):
950: case (EQN_TOK_LEFT):
951: /*
952: * If we already have something in the stack and we're
953: * in an expression, then rewind til we're not any more
954: * (just like with the text node).
955: */
956: while (parent->args == parent->expectargs)
1.15 ! schwarze 957: parent = parent->parent;
! 958: if (EQN_TOK_LEFT == tok &&
! 959: (start = eqn_nexttok(ep, &sz)) == NULL) {
! 960: mandoc_msg(MANDOCERR_REQ_EMPTY, ep->parse,
! 961: ep->eqn.ln, ep->eqn.pos, eqn_toks[tok]);
! 962: break;
! 963: }
1.14 schwarze 964: parent = eqn_box_alloc(ep, parent);
965: parent->type = EQN_LIST;
966: if (EQN_TOK_LEFT == tok) {
967: if (STRNEQ(start, sz, "ceiling", 7)) {
968: strlcpy(sym, "\\[lc]", sizeof(sym));
969: parent->left = mandoc_strdup(sym);
970: } else if (STRNEQ(start, sz, "floor", 5)) {
971: strlcpy(sym, "\\[lf]", sizeof(sym));
972: parent->left = mandoc_strdup(sym);
973: } else
974: parent->left = mandoc_strndup(start, sz);
975: }
976: break;
977: case (EQN_TOK_PILE):
978: case (EQN_TOK_LPILE):
979: case (EQN_TOK_RPILE):
980: case (EQN_TOK_CPILE):
981: case (EQN_TOK_CCOL):
982: case (EQN_TOK_LCOL):
983: case (EQN_TOK_RCOL):
984: while (parent->args == parent->expectargs)
1.15 ! schwarze 985: parent = parent->parent;
1.14 schwarze 986: parent = eqn_box_alloc(ep, parent);
987: parent->type = EQN_PILE;
1.15 ! schwarze 988: parent->expectargs = 1;
1.14 schwarze 989: break;
990: case (EQN_TOK_ABOVE):
1.15 ! schwarze 991: for (cur = parent; cur != NULL; cur = cur->parent)
! 992: if (cur->type == EQN_PILE)
! 993: break;
! 994: if (cur == NULL) {
! 995: mandoc_msg(MANDOCERR_IT_STRAY, ep->parse,
! 996: ep->eqn.ln, ep->eqn.pos, eqn_toks[tok]);
! 997: break;
! 998: }
! 999: parent = eqn_box_alloc(ep, cur);
1.14 schwarze 1000: parent->type = EQN_LIST;
1001: break;
1002: case (EQN_TOK_MATRIX):
1003: while (parent->args == parent->expectargs)
1.15 ! schwarze 1004: parent = parent->parent;
1.14 schwarze 1005: parent = eqn_box_alloc(ep, parent);
1006: parent->type = EQN_MATRIX;
1.15 ! schwarze 1007: parent->expectargs = 1;
1.14 schwarze 1008: break;
1009: case (EQN_TOK_EOF):
1010: /*
1011: * End of file!
1012: * TODO: make sure we're not in an open subexpression.
1013: */
1.4 schwarze 1014: return(0);
1.14 schwarze 1015: default:
1016: assert(tok == EQN_TOK__MAX);
1017: assert(NULL != p);
1018: /*
1019: * If we already have something in the stack and we're
1020: * in an expression, then rewind til we're not any more.
1021: */
1022: while (parent->args == parent->expectargs)
1.15 ! schwarze 1023: parent = parent->parent;
1.14 schwarze 1024: cur = eqn_box_alloc(ep, parent);
1025: cur->type = EQN_TEXT;
1026: for (i = 0; i < EQNSYM__MAX; i++)
1027: if (0 == strcmp(eqnsyms[i].str, p)) {
1028: (void)snprintf(sym, sizeof(sym),
1029: "\\[%s]", eqnsyms[i].sym);
1030: cur->text = mandoc_strdup(sym);
1031: free(p);
1032: break;
1033: }
1034:
1035: if (i == EQNSYM__MAX)
1036: cur->text = p;
1037: /*
1038: * Post-process list status.
1039: */
1040: while (parent->type == EQN_LISTONE &&
1.15 ! schwarze 1041: parent->args == parent->expectargs)
! 1042: parent = parent->parent;
1.14 schwarze 1043: break;
1.7 schwarze 1044: }
1.15 ! schwarze 1045: goto next_tok;
1.4 schwarze 1046: }
1047:
1.14 schwarze 1048: enum rofferr
1049: eqn_end(struct eqn_node **epp)
1.4 schwarze 1050: {
1.14 schwarze 1051: struct eqn_node *ep;
1.4 schwarze 1052:
1.14 schwarze 1053: ep = *epp;
1054: *epp = NULL;
1.4 schwarze 1055:
1.14 schwarze 1056: ep->eqn.root = mandoc_calloc(1, sizeof(struct eqn_box));
1057: ep->eqn.root->expectargs = UINT_MAX;
1058: return(0 == eqn_parse(ep, ep->eqn.root) ? ROFF_EQN : ROFF_IGN);
1.4 schwarze 1059: }
1060:
1.14 schwarze 1061: void
1062: eqn_free(struct eqn_node *p)
1.4 schwarze 1063: {
1064: int i;
1065:
1.14 schwarze 1066: eqn_box_free(p->eqn.root);
1067:
1068: for (i = 0; i < (int)p->defsz; i++) {
1069: free(p->defs[i].key);
1070: free(p->defs[i].val);
1071: }
1.4 schwarze 1072:
1.14 schwarze 1073: free(p->eqn.name);
1074: free(p->data);
1075: free(p->defs);
1076: free(p);
1.1 schwarze 1077: }
![[BACK]](/icons/back.gif){kind=icon}
Return to eqn.c CVS log ![[TXT]](/icons/text.gif){kind=icon}
![[DIR]](/icons/dir.gif){kind=icon}
Up to [local] / src / usr.bin / mandoc