Annotation of src/usr.bin/mandoc/eqn.c, Revision 1.14
1.14 ! schwarze 1: /* $OpenBSD$
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;
! 657: enum eqn_tok tok;
! 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);
! 666: again:
1.4 schwarze 667:
1.14 ! schwarze 668: switch ((tok = eqn_tok_parse(ep, &p))) {
! 669: case (EQN_TOK_UNDEF):
! 670: if ((rc = eqn_undef(ep)) <= 0)
! 671: return(rc);
! 672: break;
! 673: case (EQN_TOK_NDEFINE):
! 674: case (EQN_TOK_DEFINE):
! 675: if ((rc = eqn_def(ep)) <= 0)
! 676: return(rc);
! 677: break;
! 678: case (EQN_TOK_TDEFINE):
! 679: if (NULL == eqn_nextrawtok(ep, NULL))
! 680: EQN_MSG(MANDOCERR_EQNEOF, ep);
! 681: else if (NULL == eqn_next(ep,
! 682: ep->data[(int)ep->cur], NULL, 0))
! 683: EQN_MSG(MANDOCERR_EQNEOF, ep);
! 684: break;
! 685: case (EQN_TOK_DELIM):
! 686: case (EQN_TOK_GFONT):
! 687: if (NULL == eqn_nextrawtok(ep, NULL)) {
! 688: EQN_MSG(MANDOCERR_EQNSYNT, ep);
! 689: return(-1);
! 690: }
! 691: break;
! 692: case (EQN_TOK_MARK):
! 693: case (EQN_TOK_LINEUP):
! 694: /* Ignore these. */
! 695: break;
! 696: case (EQN_TOK_DYAD):
! 697: case (EQN_TOK_VEC):
! 698: case (EQN_TOK_UNDER):
! 699: case (EQN_TOK_BAR):
! 700: case (EQN_TOK_TILDE):
! 701: case (EQN_TOK_HAT):
! 702: case (EQN_TOK_DOT):
! 703: case (EQN_TOK_DOTDOT):
! 704: if (NULL == parent->last) {
! 705: EQN_MSG(MANDOCERR_EQNSYNT, ep);
! 706: return(-1);
! 707: }
! 708: parent = eqn_box_makebinary(ep, EQNPOS_NONE, parent);
! 709: parent->type = EQN_LISTONE;
! 710: parent->expectargs = 1;
! 711: switch (tok) {
! 712: case (EQN_TOK_DOTDOT):
! 713: strlcpy(sym, "\\[ad]", sizeof(sym));
! 714: break;
! 715: case (EQN_TOK_VEC):
! 716: strlcpy(sym, "\\[->]", sizeof(sym));
! 717: break;
! 718: case (EQN_TOK_DYAD):
! 719: strlcpy(sym, "\\[<>]", sizeof(sym));
! 720: break;
! 721: case (EQN_TOK_TILDE):
! 722: strlcpy(sym, "\\[a~]", sizeof(sym));
! 723: break;
! 724: case (EQN_TOK_UNDER):
! 725: strlcpy(sym, "\\[ul]", sizeof(sym));
! 726: break;
! 727: case (EQN_TOK_BAR):
! 728: strlcpy(sym, "\\[rl]", sizeof(sym));
! 729: break;
! 730: case (EQN_TOK_DOT):
! 731: strlcpy(sym, "\\[a.]", sizeof(sym));
! 732: break;
! 733: case (EQN_TOK_HAT):
! 734: strlcpy(sym, "\\[ha]", sizeof(sym));
! 735: break;
! 736: default:
! 737: abort();
! 738: }
1.4 schwarze 739:
1.14 ! schwarze 740: switch (tok) {
! 741: case (EQN_TOK_DOTDOT):
! 742: case (EQN_TOK_VEC):
! 743: case (EQN_TOK_DYAD):
! 744: case (EQN_TOK_TILDE):
! 745: case (EQN_TOK_BAR):
! 746: case (EQN_TOK_DOT):
! 747: case (EQN_TOK_HAT):
! 748: parent->top = mandoc_strdup(sym);
! 749: break;
! 750: case (EQN_TOK_UNDER):
! 751: parent->bottom = mandoc_strdup(sym);
! 752: break;
! 753: default:
! 754: abort();
! 755: }
! 756: parent = parent->parent;
! 757: break;
! 758: case (EQN_TOK_FWD):
! 759: case (EQN_TOK_BACK):
! 760: case (EQN_TOK_DOWN):
! 761: case (EQN_TOK_UP):
! 762: tok = eqn_tok_parse(ep, NULL);
! 763: if (EQN_TOK__MAX != tok) {
! 764: EQN_MSG(MANDOCERR_EQNSYNT, ep);
! 765: return(-1);
! 766: }
! 767: break;
! 768: case (EQN_TOK_FAT):
! 769: case (EQN_TOK_ROMAN):
! 770: case (EQN_TOK_ITALIC):
! 771: case (EQN_TOK_BOLD):
! 772: while (parent->args == parent->expectargs)
! 773: if (NULL == (parent = parent->parent)) {
! 774: EQN_MSG(MANDOCERR_EQNSYNT, ep);
! 775: return(-1);
! 776: }
! 777: /*
! 778: * These values apply to the next word or sequence of
! 779: * words; thus, we mark that we'll have a child with
! 780: * exactly one of those.
! 781: */
! 782: parent = eqn_box_alloc(ep, parent);
! 783: parent->type = EQN_LISTONE;
! 784: parent->expectargs = 1;
! 785: switch (tok) {
! 786: case (EQN_TOK_FAT):
! 787: parent->font = EQNFONT_FAT;
! 788: break;
! 789: case (EQN_TOK_ROMAN):
! 790: parent->font = EQNFONT_ROMAN;
! 791: break;
! 792: case (EQN_TOK_ITALIC):
! 793: parent->font = EQNFONT_ITALIC;
! 794: break;
! 795: case (EQN_TOK_BOLD):
! 796: parent->font = EQNFONT_BOLD;
! 797: break;
! 798: default:
! 799: abort();
! 800: }
! 801: break;
! 802: case (EQN_TOK_SIZE):
! 803: case (EQN_TOK_GSIZE):
! 804: /* Accept two values: integral size and a single. */
! 805: if (NULL == (start = eqn_nexttok(ep, &sz))) {
! 806: EQN_MSG(MANDOCERR_EQNSYNT, ep);
! 807: return(-1);
! 808: }
! 809: size = mandoc_strntoi(start, sz, 10);
! 810: if (-1 == size) {
! 811: EQN_MSG(MANDOCERR_EQNSYNT, ep);
! 812: return(-1);
! 813: }
! 814: if (EQN_TOK_GSIZE == tok) {
! 815: ep->gsize = size;
! 816: break;
! 817: }
! 818: parent = eqn_box_alloc(ep, parent);
! 819: parent->type = EQN_LISTONE;
! 820: parent->expectargs = 1;
! 821: parent->size = size;
! 822: break;
! 823: case (EQN_TOK_FROM):
! 824: case (EQN_TOK_TO):
! 825: case (EQN_TOK_SUB):
! 826: case (EQN_TOK_SUP):
! 827: /*
! 828: * We have a left-right-associative expression.
! 829: * Repivot under a positional node, open a child scope
! 830: * and keep on reading.
! 831: */
! 832: if (NULL == parent->last) {
! 833: EQN_MSG(MANDOCERR_EQNSYNT, ep);
! 834: return(-1);
! 835: }
! 836: /* Handle the "subsup" and "fromto" positions. */
! 837: if (EQN_TOK_SUP == tok && parent->pos == EQNPOS_SUB) {
! 838: parent->expectargs = 3;
! 839: parent->pos = EQNPOS_SUBSUP;
! 840: break;
! 841: }
! 842: if (EQN_TOK_TO == tok && parent->pos == EQNPOS_FROM) {
! 843: parent->expectargs = 3;
! 844: parent->pos = EQNPOS_FROMTO;
! 845: break;
! 846: }
! 847: switch (tok) {
! 848: case (EQN_TOK_FROM):
! 849: pos = EQNPOS_FROM;
! 850: break;
! 851: case (EQN_TOK_TO):
! 852: pos = EQNPOS_TO;
! 853: break;
! 854: case (EQN_TOK_SUP):
! 855: pos = EQNPOS_SUP;
! 856: break;
! 857: case (EQN_TOK_SUB):
! 858: pos = EQNPOS_SUB;
! 859: break;
! 860: default:
! 861: abort();
! 862: }
! 863: parent = eqn_box_makebinary(ep, pos, parent);
! 864: break;
! 865: case (EQN_TOK_SQRT):
! 866: while (parent->args == parent->expectargs)
! 867: if (NULL == (parent = parent->parent)) {
! 868: EQN_MSG(MANDOCERR_EQNSYNT, ep);
! 869: return(-1);
! 870: }
! 871: /*
! 872: * Accept a left-right-associative set of arguments just
! 873: * like sub and sup and friends but without rebalancing
! 874: * under a pivot.
! 875: */
! 876: parent = eqn_box_alloc(ep, parent);
! 877: parent->type = EQN_SUBEXPR;
! 878: parent->pos = EQNPOS_SQRT;
! 879: parent->expectargs = 1;
! 880: break;
! 881: case (EQN_TOK_OVER):
! 882: /*
! 883: * We have a right-left-associative fraction.
! 884: * Close out anything that's currently open, then
! 885: * rebalance and continue reading.
! 886: */
! 887: if (NULL == parent->last) {
! 888: EQN_MSG(MANDOCERR_EQNSYNT, ep);
! 889: return(-1);
! 890: }
! 891: while (EQN_SUBEXPR == parent->type)
! 892: if (NULL == (parent = parent->parent)) {
! 893: EQN_MSG(MANDOCERR_EQNSYNT, ep);
! 894: return(-1);
! 895: }
! 896: parent = eqn_box_makebinary(ep, EQNPOS_OVER, parent);
! 897: break;
! 898: case (EQN_TOK_RIGHT):
! 899: case (EQN_TOK_BRACE_CLOSE):
! 900: /*
! 901: * Close out the existing brace.
! 902: * FIXME: this is a shitty sentinel: we should really
! 903: * have a native EQN_BRACE type or whatnot.
! 904: */
! 905: while (parent->type != EQN_LIST)
! 906: if (NULL == (parent = parent->parent)) {
! 907: EQN_MSG(MANDOCERR_EQNSYNT, ep);
! 908: return(-1);
! 909: }
! 910: if (EQN_TOK_RIGHT == tok) {
! 911: if (NULL == parent->left) {
! 912: EQN_MSG(MANDOCERR_EQNSYNT, ep);
! 913: return(-1);
! 914: }
! 915: if (NULL == (start = eqn_nexttok(ep, &sz))) {
! 916: EQN_MSG(MANDOCERR_EQNSYNT, ep);
! 917: return(-1);
! 918: }
! 919: /* Handling depends on right/left. */
! 920: if (STRNEQ(start, sz, "ceiling", 7)) {
! 921: strlcpy(sym, "\\[rc]", sizeof(sym));
! 922: parent->right = mandoc_strdup(sym);
! 923: } else if (STRNEQ(start, sz, "floor", 5)) {
! 924: strlcpy(sym, "\\[rf]", sizeof(sym));
! 925: parent->right = mandoc_strdup(sym);
! 926: } else
! 927: parent->right = mandoc_strndup(start, sz);
! 928: }
! 929: if (NULL == (parent = parent->parent)) {
! 930: EQN_MSG(MANDOCERR_EQNSYNT, ep);
! 931: return(-1);
! 932: }
! 933: if (EQN_TOK_BRACE_CLOSE == tok && parent &&
! 934: (parent->type == EQN_PILE ||
! 935: parent->type == EQN_MATRIX))
! 936: parent = parent->parent;
! 937: /* Close out any "singleton" lists. */
! 938: while (parent->type == EQN_LISTONE &&
! 939: parent->args == parent->expectargs)
! 940: if (NULL == (parent = parent->parent)) {
! 941: EQN_MSG(MANDOCERR_EQNSYNT, ep);
! 942: return(-1);
! 943: }
! 944: break;
! 945: case (EQN_TOK_BRACE_OPEN):
! 946: case (EQN_TOK_LEFT):
! 947: /*
! 948: * If we already have something in the stack and we're
! 949: * in an expression, then rewind til we're not any more
! 950: * (just like with the text node).
! 951: */
! 952: while (parent->args == parent->expectargs)
! 953: if (NULL == (parent = parent->parent)) {
! 954: EQN_MSG(MANDOCERR_EQNSYNT, ep);
! 955: return(-1);
! 956: }
! 957: parent = eqn_box_alloc(ep, parent);
! 958: parent->type = EQN_LIST;
! 959: if (EQN_TOK_LEFT == tok) {
! 960: if (NULL == (start = eqn_nexttok(ep, &sz))) {
! 961: EQN_MSG(MANDOCERR_EQNSYNT, ep);
! 962: return(-1);
! 963: }
! 964: /* Handling depends on right/left. */
! 965: if (STRNEQ(start, sz, "ceiling", 7)) {
! 966: strlcpy(sym, "\\[lc]", sizeof(sym));
! 967: parent->left = mandoc_strdup(sym);
! 968: } else if (STRNEQ(start, sz, "floor", 5)) {
! 969: strlcpy(sym, "\\[lf]", sizeof(sym));
! 970: parent->left = mandoc_strdup(sym);
! 971: } else
! 972: parent->left = mandoc_strndup(start, sz);
! 973: }
! 974: break;
! 975: case (EQN_TOK_PILE):
! 976: case (EQN_TOK_LPILE):
! 977: case (EQN_TOK_RPILE):
! 978: case (EQN_TOK_CPILE):
! 979: case (EQN_TOK_CCOL):
! 980: case (EQN_TOK_LCOL):
! 981: case (EQN_TOK_RCOL):
! 982: while (parent->args == parent->expectargs)
! 983: if (NULL == (parent = parent->parent)) {
! 984: EQN_MSG(MANDOCERR_EQNSYNT, ep);
! 985: return(-1);
! 986: }
! 987: if (EQN_TOK_BRACE_OPEN != eqn_tok_parse(ep, NULL)) {
! 988: EQN_MSG(MANDOCERR_EQNSYNT, ep);
! 989: return(-1);
! 990: }
! 991: parent = eqn_box_alloc(ep, parent);
! 992: parent->type = EQN_PILE;
! 993: parent = eqn_box_alloc(ep, parent);
! 994: parent->type = EQN_LIST;
! 995: break;
! 996: case (EQN_TOK_ABOVE):
! 997: while (parent->type != EQN_PILE)
! 998: if (NULL == (parent = parent->parent)) {
! 999: EQN_MSG(MANDOCERR_EQNSYNT, ep);
! 1000: return(-1);
! 1001: }
! 1002: parent = eqn_box_alloc(ep, parent);
! 1003: parent->type = EQN_LIST;
! 1004: break;
! 1005: case (EQN_TOK_MATRIX):
! 1006: while (parent->args == parent->expectargs)
! 1007: if (NULL == (parent = parent->parent)) {
! 1008: EQN_MSG(MANDOCERR_EQNSYNT, ep);
! 1009: return(-1);
! 1010: }
! 1011: if (EQN_TOK_BRACE_OPEN != eqn_tok_parse(ep, NULL)) {
! 1012: EQN_MSG(MANDOCERR_EQNSYNT, ep);
! 1013: return(-1);
! 1014: }
! 1015: parent = eqn_box_alloc(ep, parent);
! 1016: parent->type = EQN_MATRIX;
! 1017: parent = eqn_box_alloc(ep, parent);
! 1018: parent->type = EQN_LIST;
! 1019: break;
! 1020: case (EQN_TOK_EOF):
! 1021: /*
! 1022: * End of file!
! 1023: * TODO: make sure we're not in an open subexpression.
! 1024: */
1.4 schwarze 1025: return(0);
1.14 ! schwarze 1026: default:
! 1027: assert(tok == EQN_TOK__MAX);
! 1028: assert(NULL != p);
! 1029: /*
! 1030: * If we already have something in the stack and we're
! 1031: * in an expression, then rewind til we're not any more.
! 1032: */
! 1033: while (parent->args == parent->expectargs)
! 1034: if (NULL == (parent = parent->parent)) {
! 1035: EQN_MSG(MANDOCERR_EQNSYNT, ep);
! 1036: free(p);
! 1037: return(-1);
! 1038: }
! 1039: cur = eqn_box_alloc(ep, parent);
! 1040: cur->type = EQN_TEXT;
! 1041: for (i = 0; i < EQNSYM__MAX; i++)
! 1042: if (0 == strcmp(eqnsyms[i].str, p)) {
! 1043: (void)snprintf(sym, sizeof(sym),
! 1044: "\\[%s]", eqnsyms[i].sym);
! 1045: cur->text = mandoc_strdup(sym);
! 1046: free(p);
! 1047: break;
! 1048: }
! 1049:
! 1050: if (i == EQNSYM__MAX)
! 1051: cur->text = p;
! 1052: /*
! 1053: * Post-process list status.
! 1054: */
! 1055: while (parent->type == EQN_LISTONE &&
! 1056: parent->args == parent->expectargs)
! 1057: if (NULL == (parent = parent->parent)) {
! 1058: EQN_MSG(MANDOCERR_EQNSYNT, ep);
! 1059: return(-1);
! 1060: }
! 1061: break;
1.7 schwarze 1062: }
1.14 ! schwarze 1063: goto again;
1.4 schwarze 1064: }
1065:
1.14 ! schwarze 1066: enum rofferr
! 1067: eqn_end(struct eqn_node **epp)
1.4 schwarze 1068: {
1.14 ! schwarze 1069: struct eqn_node *ep;
1.4 schwarze 1070:
1.14 ! schwarze 1071: ep = *epp;
! 1072: *epp = NULL;
1.4 schwarze 1073:
1.14 ! schwarze 1074: ep->eqn.root = mandoc_calloc(1, sizeof(struct eqn_box));
! 1075: ep->eqn.root->expectargs = UINT_MAX;
! 1076: return(0 == eqn_parse(ep, ep->eqn.root) ? ROFF_EQN : ROFF_IGN);
1.4 schwarze 1077: }
1078:
1.14 ! schwarze 1079: void
! 1080: eqn_free(struct eqn_node *p)
1.4 schwarze 1081: {
1082: int i;
1083:
1.14 ! schwarze 1084: eqn_box_free(p->eqn.root);
! 1085:
! 1086: for (i = 0; i < (int)p->defsz; i++) {
! 1087: free(p->defs[i].key);
! 1088: free(p->defs[i].val);
! 1089: }
1.4 schwarze 1090:
1.14 ! schwarze 1091: free(p->eqn.name);
! 1092: free(p->data);
! 1093: free(p->defs);
! 1094: free(p);
1.1 schwarze 1095: }
![[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