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