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