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