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