Annotation of src/usr.bin/mandoc/eqn.c, Revision 1.38
1.38 ! schwarze 1: /* $OpenBSD: eqn.c,v 1.37 2017/07/06 00:08:52 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 {
1.34 schwarze 146: EQNSYM_alpha = 0,
1.4 schwarze 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.34 schwarze 277: enum parse_mode {
278: MODE_QUOTED,
279: MODE_NOSUB,
280: MODE_SUB,
281: MODE_TOK
282: };
283:
1.20 schwarze 284: static struct eqn_box *eqn_box_alloc(struct eqn_node *, struct eqn_box *);
285: static void eqn_box_free(struct eqn_box *);
286: static struct eqn_box *eqn_box_makebinary(struct eqn_node *,
1.38 ! schwarze 287: struct eqn_box *);
1.20 schwarze 288: static void eqn_def(struct eqn_node *);
1.34 schwarze 289: static struct eqn_def *eqn_def_find(struct eqn_node *);
1.20 schwarze 290: static void eqn_delim(struct eqn_node *);
1.34 schwarze 291: static enum eqn_tok eqn_next(struct eqn_node *, enum parse_mode);
1.20 schwarze 292: static enum rofferr eqn_parse(struct eqn_node *, struct eqn_box *);
293: static void eqn_undef(struct eqn_node *);
294:
295:
1.1 schwarze 296: enum rofferr
1.7 schwarze 297: eqn_read(struct eqn_node **epp, int ln,
1.4 schwarze 298: const char *p, int pos, int *offs)
1.1 schwarze 299: {
300: size_t sz;
301: struct eqn_node *ep;
1.4 schwarze 302: enum rofferr er;
1.1 schwarze 303:
304: ep = *epp;
305:
1.4 schwarze 306: /*
307: * If we're the terminating mark, unset our equation status and
308: * validate the full equation.
309: */
310:
311: if (0 == strncmp(p, ".EN", 3)) {
312: er = eqn_end(epp);
313: p += 3;
314: while (' ' == *p || '\t' == *p)
315: p++;
1.7 schwarze 316: if ('\0' == *p)
1.22 schwarze 317: return er;
1.10 schwarze 318: mandoc_vmsg(MANDOCERR_ARG_SKIP, ep->parse,
319: ln, pos, "EN %s", p);
1.22 schwarze 320: return er;
1.4 schwarze 321: }
1.1 schwarze 322:
1.4 schwarze 323: /*
324: * Build up the full string, replacing all newlines with regular
325: * whitespace.
326: */
327:
328: sz = strlen(p + pos) + 1;
329: ep->data = mandoc_realloc(ep->data, ep->sz + sz + 1);
330:
331: /* First invocation: nil terminate the string. */
332:
333: if (0 == ep->sz)
334: *ep->data = '\0';
335:
336: ep->sz += sz;
337: strlcat(ep->data, p + pos, ep->sz + 1);
338: strlcat(ep->data, " ", ep->sz + 1);
1.22 schwarze 339: return ROFF_IGN;
1.1 schwarze 340: }
341:
342: struct eqn_node *
1.18 schwarze 343: eqn_alloc(int pos, int line, struct mparse *parse)
1.1 schwarze 344: {
345: struct eqn_node *p;
346:
347: p = mandoc_calloc(1, sizeof(struct eqn_node));
1.4 schwarze 348:
349: p->parse = parse;
350: p->eqn.ln = line;
1.1 schwarze 351: p->eqn.pos = pos;
1.4 schwarze 352: p->gsize = EQN_DEFSIZE;
1.1 schwarze 353:
1.22 schwarze 354: return p;
1.1 schwarze 355: }
356:
1.14 schwarze 357: /*
358: * Find the key "key" of the give size within our eqn-defined values.
359: */
360: static struct eqn_def *
1.34 schwarze 361: eqn_def_find(struct eqn_node *ep)
1.1 schwarze 362: {
1.4 schwarze 363: int i;
364:
1.14 schwarze 365: for (i = 0; i < (int)ep->defsz; i++)
366: if (ep->defs[i].keysz && STRNEQ(ep->defs[i].key,
1.34 schwarze 367: ep->defs[i].keysz, ep->start, ep->toksz))
1.22 schwarze 368: return &ep->defs[i];
1.4 schwarze 369:
1.22 schwarze 370: return NULL;
1.4 schwarze 371: }
372:
1.14 schwarze 373: /*
1.34 schwarze 374: * Parse a token from the input text. The modes are:
375: * MODE_QUOTED: Use *ep->start as the delimiter; the token ends
376: * before its next occurence. Do not interpret the token in any
377: * way and return EQN_TOK_QUOTED. All other modes behave like
378: * MODE_QUOTED when *ep->start is '"'.
379: * MODE_NOSUB: If *ep->start is a curly brace, the token ends after it;
380: * otherwise, it ends before the next whitespace or brace.
381: * Do not interpret the token and return EQN_TOK__MAX.
382: * MODE_SUB: Like MODE_NOSUB, but try to interpret the token as an
383: * alias created with define. If it is an alias, replace it with
384: * its string value and reparse.
385: * MODE_TOK: Like MODE_SUB, but also check the token against the list
386: * of tokens, and if there is a match, return that token. Otherwise,
387: * if the token matches a symbol, return EQN_TOK_SYM; if it matches
388: * a function name, EQN_TOK_FUNC, or else EQN_TOK__MAX. Except for
389: * a token match, *ep->start is set to an allocated string that the
390: * caller is expected to free.
391: * All modes skip whitespace following the end of the token.
1.14 schwarze 392: */
1.34 schwarze 393: static enum eqn_tok
394: eqn_next(struct eqn_node *ep, enum parse_mode mode)
1.4 schwarze 395: {
1.34 schwarze 396: static int last_len, lim;
1.25 schwarze 397:
1.4 schwarze 398: struct eqn_def *def;
1.34 schwarze 399: size_t start;
400: int diff, i, quoted;
401: enum eqn_tok tok;
1.4 schwarze 402:
1.34 schwarze 403: /*
404: * Reset the recursion counter after advancing
405: * beyond the end of the previous substitution.
406: */
407: if (ep->end - ep->data >= last_len)
1.25 schwarze 408: lim = 0;
1.4 schwarze 409:
1.34 schwarze 410: ep->start = ep->end;
411: quoted = mode == MODE_QUOTED;
412: for (;;) {
413: switch (*ep->start) {
414: case '\0':
415: ep->toksz = 0;
416: return EQN_TOK_EOF;
417: case '"':
418: quoted = 1;
419: break;
420: default:
421: break;
422: }
423: if (quoted) {
424: ep->end = strchr(ep->start + 1, *ep->start);
425: ep->start++; /* Skip opening quote. */
426: if (ep->end == NULL) {
427: mandoc_msg(MANDOCERR_ARG_QUOTE, ep->parse,
428: ep->eqn.ln, ep->eqn.pos, NULL);
429: ep->end = strchr(ep->start, '\0');
430: }
431: } else {
432: ep->end = ep->start + 1;
433: if (*ep->start != '{' && *ep->start != '}')
434: ep->end += strcspn(ep->end, " ^~\"{}\t");
435: }
436: ep->toksz = ep->end - ep->start;
437: if (quoted && *ep->end != '\0')
438: ep->end++; /* Skip closing quote. */
439: while (*ep->end != '\0' && strchr(" \t^~", *ep->end) != NULL)
440: ep->end++;
441: if (quoted) /* Cannot return, may have to strndup. */
442: break;
443: if (mode == MODE_NOSUB)
444: return EQN_TOK__MAX;
445: if ((def = eqn_def_find(ep)) == NULL)
446: break;
447: if (++lim > EQN_NEST_MAX) {
448: mandoc_msg(MANDOCERR_ROFFLOOP, ep->parse,
1.20 schwarze 449: ep->eqn.ln, ep->eqn.pos, NULL);
1.34 schwarze 450: return EQN_TOK_EOF;
451: }
1.4 schwarze 452:
1.34 schwarze 453: /* Replace a defined name with its string value. */
454: if ((diff = def->valsz - ep->toksz) > 0) {
455: start = ep->start - ep->data;
1.4 schwarze 456: ep->sz += diff;
457: ep->data = mandoc_realloc(ep->data, ep->sz + 1);
1.34 schwarze 458: ep->start = ep->data + start;
1.4 schwarze 459: }
1.34 schwarze 460: if (diff)
461: memmove(ep->start + def->valsz, ep->start + ep->toksz,
462: strlen(ep->start + ep->toksz) + 1);
463: memcpy(ep->start, def->val, def->valsz);
464: last_len = ep->start - ep->data + def->valsz;
1.4 schwarze 465: }
1.34 schwarze 466: if (mode != MODE_TOK)
467: return quoted ? EQN_TOK_QUOTED : EQN_TOK__MAX;
1.16 schwarze 468: if (quoted) {
1.34 schwarze 469: ep->start = mandoc_strndup(ep->start, ep->toksz);
1.30 schwarze 470: return EQN_TOK_QUOTED;
1.16 schwarze 471: }
1.34 schwarze 472: for (tok = 0; tok < EQN_TOK__MAX; tok++)
473: if (STRNEQ(ep->start, ep->toksz,
474: eqn_toks[tok], strlen(eqn_toks[tok])))
475: return tok;
1.14 schwarze 476:
1.28 schwarze 477: for (i = 0; i < EQNSYM__MAX; i++) {
1.34 schwarze 478: if (STRNEQ(ep->start, ep->toksz,
1.28 schwarze 479: eqnsyms[i].str, strlen(eqnsyms[i].str))) {
1.34 schwarze 480: mandoc_asprintf(&ep->start,
481: "\\[%s]", eqnsyms[i].sym);
1.30 schwarze 482: return EQN_TOK_SYM;
1.28 schwarze 483: }
484: }
1.34 schwarze 485: ep->start = mandoc_strndup(ep->start, ep->toksz);
486: for (i = 0; i < (int)(sizeof(eqn_func)/sizeof(*eqn_func)); i++)
487: if (STRNEQ(ep->start, ep->toksz,
488: eqn_func[i], strlen(eqn_func[i])))
1.27 schwarze 489: return EQN_TOK_FUNC;
490: return EQN_TOK__MAX;
1.14 schwarze 491: }
492:
493: static void
494: eqn_box_free(struct eqn_box *bp)
1.4 schwarze 495: {
496:
1.14 schwarze 497: if (bp->first)
498: eqn_box_free(bp->first);
499: if (bp->next)
500: eqn_box_free(bp->next);
1.4 schwarze 501:
1.14 schwarze 502: free(bp->text);
503: free(bp->left);
504: free(bp->right);
505: free(bp->top);
506: free(bp->bottom);
507: free(bp);
1.4 schwarze 508: }
509:
1.14 schwarze 510: /*
511: * Allocate a box as the last child of the parent node.
512: */
513: static struct eqn_box *
514: eqn_box_alloc(struct eqn_node *ep, struct eqn_box *parent)
1.4 schwarze 515: {
1.14 schwarze 516: struct eqn_box *bp;
517:
518: bp = mandoc_calloc(1, sizeof(struct eqn_box));
519: bp->parent = parent;
520: bp->parent->args++;
521: bp->expectargs = UINT_MAX;
1.31 schwarze 522: bp->font = bp->parent->font;
1.14 schwarze 523: bp->size = ep->gsize;
524:
525: if (NULL != parent->first) {
526: parent->last->next = bp;
527: bp->prev = parent->last;
528: } else
529: parent->first = bp;
530:
531: parent->last = bp;
1.22 schwarze 532: return bp;
1.14 schwarze 533: }
1.4 schwarze 534:
1.14 schwarze 535: /*
536: * Reparent the current last node (of the current parent) under a new
537: * EQN_SUBEXPR as the first element.
538: * Then return the new parent.
539: * The new EQN_SUBEXPR will have a two-child limit.
540: */
541: static struct eqn_box *
1.38 ! schwarze 542: eqn_box_makebinary(struct eqn_node *ep, struct eqn_box *parent)
1.14 schwarze 543: {
544: struct eqn_box *b, *newb;
1.4 schwarze 545:
1.14 schwarze 546: assert(NULL != parent->last);
547: b = parent->last;
548: if (parent->last == parent->first)
549: parent->first = NULL;
550: parent->args--;
551: parent->last = b->prev;
552: b->prev = NULL;
553: newb = eqn_box_alloc(ep, parent);
554: newb->type = EQN_SUBEXPR;
555: newb->expectargs = 2;
556: newb->args = 1;
557: newb->first = newb->last = b;
558: newb->first->next = NULL;
559: b->parent = newb;
1.22 schwarze 560: return newb;
1.4 schwarze 561: }
562:
1.14 schwarze 563: /*
1.17 schwarze 564: * Parse the "delim" control statement.
565: */
566: static void
567: eqn_delim(struct eqn_node *ep)
568: {
1.34 schwarze 569: if (ep->end[0] == '\0' || ep->end[1] == '\0') {
1.17 schwarze 570: mandoc_msg(MANDOCERR_REQ_EMPTY, ep->parse,
571: ep->eqn.ln, ep->eqn.pos, "delim");
1.34 schwarze 572: if (ep->end[0] != '\0')
573: ep->end++;
574: } else if (strncmp(ep->end, "off", 3) == 0) {
1.17 schwarze 575: ep->delim = 0;
1.34 schwarze 576: ep->end += 3;
577: } else if (strncmp(ep->end, "on", 2) == 0) {
1.17 schwarze 578: if (ep->odelim && ep->cdelim)
579: ep->delim = 1;
1.34 schwarze 580: ep->end += 2;
581: } else {
582: ep->odelim = *ep->end++;
583: ep->cdelim = *ep->end++;
1.17 schwarze 584: ep->delim = 1;
585: }
586: }
587:
588: /*
1.14 schwarze 589: * Undefine a previously-defined string.
590: */
1.20 schwarze 591: static void
1.14 schwarze 592: eqn_undef(struct eqn_node *ep)
1.4 schwarze 593: {
1.14 schwarze 594: struct eqn_def *def;
1.4 schwarze 595:
1.34 schwarze 596: if (eqn_next(ep, MODE_NOSUB) == EQN_TOK_EOF) {
1.20 schwarze 597: mandoc_msg(MANDOCERR_REQ_EMPTY, ep->parse,
598: ep->eqn.ln, ep->eqn.pos, "undef");
599: return;
600: }
1.34 schwarze 601: if ((def = eqn_def_find(ep)) == NULL)
1.20 schwarze 602: return;
603: free(def->key);
604: free(def->val);
605: def->key = def->val = NULL;
606: def->keysz = def->valsz = 0;
1.4 schwarze 607: }
608:
1.20 schwarze 609: static void
1.14 schwarze 610: eqn_def(struct eqn_node *ep)
1.4 schwarze 611: {
612: struct eqn_def *def;
613: int i;
614:
1.34 schwarze 615: if (eqn_next(ep, MODE_NOSUB) == EQN_TOK_EOF) {
1.20 schwarze 616: mandoc_msg(MANDOCERR_REQ_EMPTY, ep->parse,
617: ep->eqn.ln, ep->eqn.pos, "define");
618: return;
1.4 schwarze 619: }
620:
1.7 schwarze 621: /*
622: * Search for a key that already exists.
1.4 schwarze 623: * Create a new key if none is found.
624: */
1.34 schwarze 625: if ((def = eqn_def_find(ep)) == NULL) {
1.4 schwarze 626: /* Find holes in string array. */
627: for (i = 0; i < (int)ep->defsz; i++)
628: if (0 == ep->defs[i].keysz)
629: break;
630:
631: if (i == (int)ep->defsz) {
632: ep->defsz++;
1.9 schwarze 633: ep->defs = mandoc_reallocarray(ep->defs,
634: ep->defsz, sizeof(struct eqn_def));
1.4 schwarze 635: ep->defs[i].key = ep->defs[i].val = NULL;
636: }
637:
1.20 schwarze 638: def = ep->defs + i;
639: free(def->key);
1.34 schwarze 640: def->key = mandoc_strndup(ep->start, ep->toksz);
641: def->keysz = ep->toksz;
1.4 schwarze 642: }
643:
1.34 schwarze 644: if (eqn_next(ep, MODE_QUOTED) == EQN_TOK_EOF) {
1.20 schwarze 645: mandoc_vmsg(MANDOCERR_REQ_EMPTY, ep->parse,
646: ep->eqn.ln, ep->eqn.pos, "define %s", def->key);
647: free(def->key);
648: free(def->val);
649: def->key = def->val = NULL;
650: def->keysz = def->valsz = 0;
651: return;
1.4 schwarze 652: }
1.20 schwarze 653: free(def->val);
1.34 schwarze 654: def->val = mandoc_strndup(ep->start, ep->toksz);
655: def->valsz = ep->toksz;
1.4 schwarze 656: }
657:
1.14 schwarze 658: /*
659: * Recursively parse an eqn(7) expression.
660: */
1.20 schwarze 661: static enum rofferr
1.14 schwarze 662: eqn_parse(struct eqn_node *ep, struct eqn_box *parent)
1.4 schwarze 663: {
1.33 schwarze 664: struct eqn_box *cur, *nbox, *split;
1.34 schwarze 665: const char *cp, *cpn;
1.14 schwarze 666: char *p;
1.34 schwarze 667: enum eqn_tok tok;
1.31 schwarze 668: enum { CCL_LET, CCL_DIG, CCL_PUN } ccl, ccln;
1.20 schwarze 669: int size;
1.4 schwarze 670:
1.19 schwarze 671: assert(parent != NULL);
1.20 schwarze 672:
673: /*
674: * Empty equation.
675: * Do not add it to the high-level syntax tree.
676: */
677:
1.19 schwarze 678: if (ep->data == NULL)
1.22 schwarze 679: return ROFF_IGN;
1.4 schwarze 680:
1.35 schwarze 681: ep->start = ep->end = ep->data + strspn(ep->data, " ^~");
1.34 schwarze 682:
1.15 schwarze 683: next_tok:
1.34 schwarze 684: tok = eqn_next(ep, MODE_TOK);
1.15 schwarze 685: switch (tok) {
1.26 schwarze 686: case EQN_TOK_UNDEF:
1.20 schwarze 687: eqn_undef(ep);
1.14 schwarze 688: break;
1.26 schwarze 689: case EQN_TOK_NDEFINE:
690: case EQN_TOK_DEFINE:
1.20 schwarze 691: eqn_def(ep);
1.14 schwarze 692: break;
1.26 schwarze 693: case EQN_TOK_TDEFINE:
1.34 schwarze 694: if (eqn_next(ep, MODE_NOSUB) == EQN_TOK_EOF ||
695: eqn_next(ep, MODE_QUOTED) == EQN_TOK_EOF)
1.20 schwarze 696: mandoc_msg(MANDOCERR_REQ_EMPTY, ep->parse,
697: ep->eqn.ln, ep->eqn.pos, "tdefine");
1.14 schwarze 698: break;
1.26 schwarze 699: case EQN_TOK_DELIM:
1.17 schwarze 700: eqn_delim(ep);
701: break;
1.26 schwarze 702: case EQN_TOK_GFONT:
1.34 schwarze 703: if (eqn_next(ep, MODE_SUB) == EQN_TOK_EOF)
1.15 schwarze 704: mandoc_msg(MANDOCERR_REQ_EMPTY, ep->parse,
705: ep->eqn.ln, ep->eqn.pos, eqn_toks[tok]);
1.14 schwarze 706: break;
1.26 schwarze 707: case EQN_TOK_MARK:
708: case EQN_TOK_LINEUP:
1.14 schwarze 709: /* Ignore these. */
710: break;
1.26 schwarze 711: case EQN_TOK_DYAD:
712: case EQN_TOK_VEC:
713: case EQN_TOK_UNDER:
714: case EQN_TOK_BAR:
715: case EQN_TOK_TILDE:
716: case EQN_TOK_HAT:
717: case EQN_TOK_DOT:
718: case EQN_TOK_DOTDOT:
1.15 schwarze 719: if (parent->last == NULL) {
720: mandoc_msg(MANDOCERR_EQN_NOBOX, ep->parse,
721: ep->eqn.ln, ep->eqn.pos, eqn_toks[tok]);
722: cur = eqn_box_alloc(ep, parent);
723: cur->type = EQN_TEXT;
724: cur->text = mandoc_strdup("");
1.14 schwarze 725: }
1.38 ! schwarze 726: parent = eqn_box_makebinary(ep, parent);
1.36 schwarze 727: parent->type = EQN_LIST;
1.14 schwarze 728: parent->expectargs = 1;
1.31 schwarze 729: parent->font = EQNFONT_ROMAN;
1.14 schwarze 730: switch (tok) {
1.26 schwarze 731: case EQN_TOK_DOTDOT:
1.34 schwarze 732: parent->top = mandoc_strdup("\\[ad]");
1.14 schwarze 733: break;
1.26 schwarze 734: case EQN_TOK_VEC:
1.34 schwarze 735: parent->top = mandoc_strdup("\\[->]");
1.14 schwarze 736: break;
1.26 schwarze 737: case EQN_TOK_DYAD:
1.34 schwarze 738: parent->top = mandoc_strdup("\\[<>]");
1.14 schwarze 739: break;
1.26 schwarze 740: case EQN_TOK_TILDE:
1.34 schwarze 741: parent->top = mandoc_strdup("\\[a~]");
1.14 schwarze 742: break;
1.26 schwarze 743: case EQN_TOK_UNDER:
1.34 schwarze 744: parent->bottom = mandoc_strdup("\\[ul]");
1.14 schwarze 745: break;
1.26 schwarze 746: case EQN_TOK_BAR:
1.34 schwarze 747: parent->top = mandoc_strdup("\\[rl]");
1.14 schwarze 748: break;
1.26 schwarze 749: case EQN_TOK_DOT:
1.34 schwarze 750: parent->top = mandoc_strdup("\\[a.]");
1.14 schwarze 751: break;
1.26 schwarze 752: case EQN_TOK_HAT:
1.34 schwarze 753: parent->top = mandoc_strdup("\\[ha]");
1.14 schwarze 754: break;
755: default:
756: abort();
757: }
758: parent = parent->parent;
759: break;
1.26 schwarze 760: case EQN_TOK_FWD:
761: case EQN_TOK_BACK:
762: case EQN_TOK_DOWN:
763: case EQN_TOK_UP:
1.34 schwarze 764: if (eqn_next(ep, MODE_SUB) == EQN_TOK_EOF)
1.15 schwarze 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_FAT:
769: case EQN_TOK_ROMAN:
770: case EQN_TOK_ITALIC:
771: case EQN_TOK_BOLD:
1.14 schwarze 772: while (parent->args == parent->expectargs)
1.15 schwarze 773: parent = parent->parent;
1.14 schwarze 774: /*
775: * These values apply to the next word or sequence of
776: * words; thus, we mark that we'll have a child with
777: * exactly one of those.
778: */
779: parent = eqn_box_alloc(ep, parent);
1.36 schwarze 780: parent->type = EQN_LIST;
1.14 schwarze 781: parent->expectargs = 1;
782: switch (tok) {
1.26 schwarze 783: case EQN_TOK_FAT:
1.14 schwarze 784: parent->font = EQNFONT_FAT;
785: break;
1.26 schwarze 786: case EQN_TOK_ROMAN:
1.14 schwarze 787: parent->font = EQNFONT_ROMAN;
788: break;
1.26 schwarze 789: case EQN_TOK_ITALIC:
1.14 schwarze 790: parent->font = EQNFONT_ITALIC;
791: break;
1.26 schwarze 792: case EQN_TOK_BOLD:
1.14 schwarze 793: parent->font = EQNFONT_BOLD;
794: break;
795: default:
796: abort();
797: }
798: break;
1.26 schwarze 799: case EQN_TOK_SIZE:
800: case EQN_TOK_GSIZE:
1.14 schwarze 801: /* Accept two values: integral size and a single. */
1.34 schwarze 802: if (eqn_next(ep, MODE_SUB) == EQN_TOK_EOF) {
1.15 schwarze 803: mandoc_msg(MANDOCERR_REQ_EMPTY, ep->parse,
804: ep->eqn.ln, ep->eqn.pos, eqn_toks[tok]);
805: break;
1.14 schwarze 806: }
1.34 schwarze 807: size = mandoc_strntoi(ep->start, ep->toksz, 10);
1.14 schwarze 808: if (-1 == size) {
1.15 schwarze 809: mandoc_msg(MANDOCERR_IT_NONUM, ep->parse,
810: ep->eqn.ln, ep->eqn.pos, eqn_toks[tok]);
811: break;
1.14 schwarze 812: }
813: if (EQN_TOK_GSIZE == tok) {
814: ep->gsize = size;
815: break;
816: }
1.37 schwarze 817: while (parent->args == parent->expectargs)
818: parent = parent->parent;
1.14 schwarze 819: parent = eqn_box_alloc(ep, parent);
1.36 schwarze 820: parent->type = EQN_LIST;
1.14 schwarze 821: parent->expectargs = 1;
822: parent->size = size;
823: break;
1.26 schwarze 824: case EQN_TOK_FROM:
825: case EQN_TOK_TO:
826: case EQN_TOK_SUB:
827: case EQN_TOK_SUP:
1.14 schwarze 828: /*
829: * We have a left-right-associative expression.
830: * Repivot under a positional node, open a child scope
831: * and keep on reading.
832: */
1.15 schwarze 833: if (parent->last == NULL) {
834: mandoc_msg(MANDOCERR_EQN_NOBOX, ep->parse,
835: ep->eqn.ln, ep->eqn.pos, eqn_toks[tok]);
836: cur = eqn_box_alloc(ep, parent);
837: cur->type = EQN_TEXT;
838: cur->text = mandoc_strdup("");
1.14 schwarze 839: }
1.37 schwarze 840: while (parent->expectargs == 1 && parent->args == 1)
841: parent = parent->parent;
842: if (tok == EQN_TOK_FROM || tok == EQN_TOK_TO) {
843: for (cur = parent; cur != NULL; cur = cur->parent)
844: if (cur->pos == EQNPOS_SUB ||
845: cur->pos == EQNPOS_SUP ||
846: cur->pos == EQNPOS_SUBSUP ||
847: cur->pos == EQNPOS_SQRT ||
848: cur->pos == EQNPOS_OVER)
849: break;
850: if (cur != NULL)
851: parent = cur->parent;
852: }
853: if (tok == EQN_TOK_SUP && parent->pos == EQNPOS_SUB) {
1.14 schwarze 854: parent->expectargs = 3;
855: parent->pos = EQNPOS_SUBSUP;
856: break;
857: }
1.37 schwarze 858: if (tok == EQN_TOK_TO && parent->pos == EQNPOS_FROM) {
1.14 schwarze 859: parent->expectargs = 3;
860: parent->pos = EQNPOS_FROMTO;
861: break;
862: }
1.38 ! schwarze 863: parent = eqn_box_makebinary(ep, parent);
1.14 schwarze 864: switch (tok) {
1.26 schwarze 865: case EQN_TOK_FROM:
1.38 ! schwarze 866: parent->pos = EQNPOS_FROM;
1.14 schwarze 867: break;
1.26 schwarze 868: case EQN_TOK_TO:
1.38 ! schwarze 869: parent->pos = EQNPOS_TO;
1.14 schwarze 870: break;
1.26 schwarze 871: case EQN_TOK_SUP:
1.38 ! schwarze 872: parent->pos = EQNPOS_SUP;
1.14 schwarze 873: break;
1.26 schwarze 874: case EQN_TOK_SUB:
1.38 ! schwarze 875: parent->pos = EQNPOS_SUB;
1.14 schwarze 876: break;
877: default:
878: abort();
879: }
880: break;
1.26 schwarze 881: case EQN_TOK_SQRT:
1.14 schwarze 882: while (parent->args == parent->expectargs)
1.15 schwarze 883: parent = parent->parent;
1.14 schwarze 884: /*
885: * Accept a left-right-associative set of arguments just
886: * like sub and sup and friends but without rebalancing
887: * under a pivot.
888: */
889: parent = eqn_box_alloc(ep, parent);
890: parent->type = EQN_SUBEXPR;
891: parent->pos = EQNPOS_SQRT;
892: parent->expectargs = 1;
893: break;
1.26 schwarze 894: case EQN_TOK_OVER:
1.14 schwarze 895: /*
896: * We have a right-left-associative fraction.
897: * Close out anything that's currently open, then
898: * rebalance and continue reading.
899: */
1.15 schwarze 900: if (parent->last == NULL) {
901: mandoc_msg(MANDOCERR_EQN_NOBOX, ep->parse,
902: ep->eqn.ln, ep->eqn.pos, eqn_toks[tok]);
903: cur = eqn_box_alloc(ep, parent);
904: cur->type = EQN_TEXT;
905: cur->text = mandoc_strdup("");
1.14 schwarze 906: }
1.37 schwarze 907: while (parent->args == parent->expectargs)
908: parent = parent->parent;
1.14 schwarze 909: while (EQN_SUBEXPR == parent->type)
1.15 schwarze 910: parent = parent->parent;
1.38 ! schwarze 911: parent = eqn_box_makebinary(ep, parent);
! 912: parent->pos = EQNPOS_OVER;
1.14 schwarze 913: break;
1.26 schwarze 914: case EQN_TOK_RIGHT:
915: case EQN_TOK_BRACE_CLOSE:
1.14 schwarze 916: /*
917: * Close out the existing brace.
918: * FIXME: this is a shitty sentinel: we should really
919: * have a native EQN_BRACE type or whatnot.
920: */
1.15 schwarze 921: for (cur = parent; cur != NULL; cur = cur->parent)
922: if (cur->type == EQN_LIST &&
1.36 schwarze 923: cur->expectargs > 1 &&
1.15 schwarze 924: (tok == EQN_TOK_BRACE_CLOSE ||
925: cur->left != NULL))
926: break;
927: if (cur == NULL) {
928: mandoc_msg(MANDOCERR_BLK_NOTOPEN, ep->parse,
929: ep->eqn.ln, ep->eqn.pos, eqn_toks[tok]);
930: break;
931: }
932: parent = cur;
1.14 schwarze 933: if (EQN_TOK_RIGHT == tok) {
1.34 schwarze 934: if (eqn_next(ep, MODE_SUB) == EQN_TOK_EOF) {
1.15 schwarze 935: mandoc_msg(MANDOCERR_REQ_EMPTY,
936: ep->parse, ep->eqn.ln,
937: ep->eqn.pos, eqn_toks[tok]);
938: break;
1.14 schwarze 939: }
940: /* Handling depends on right/left. */
1.34 schwarze 941: if (STRNEQ(ep->start, ep->toksz, "ceiling", 7))
942: parent->right = mandoc_strdup("\\[rc]");
943: else if (STRNEQ(ep->start, ep->toksz, "floor", 5))
944: parent->right = mandoc_strdup("\\[rf]");
945: else
946: parent->right =
947: mandoc_strndup(ep->start, ep->toksz);
1.14 schwarze 948: }
1.15 schwarze 949: parent = parent->parent;
1.24 schwarze 950: if (tok == EQN_TOK_BRACE_CLOSE &&
1.14 schwarze 951: (parent->type == EQN_PILE ||
952: parent->type == EQN_MATRIX))
953: parent = parent->parent;
954: /* Close out any "singleton" lists. */
1.36 schwarze 955: while (parent->type == EQN_LIST &&
956: parent->expectargs == 1 &&
957: parent->args == 1)
1.15 schwarze 958: parent = parent->parent;
1.14 schwarze 959: break;
1.26 schwarze 960: case EQN_TOK_BRACE_OPEN:
961: case EQN_TOK_LEFT:
1.14 schwarze 962: /*
963: * If we already have something in the stack and we're
964: * in an expression, then rewind til we're not any more
965: * (just like with the text node).
966: */
967: while (parent->args == parent->expectargs)
1.15 schwarze 968: parent = parent->parent;
969: if (EQN_TOK_LEFT == tok &&
1.34 schwarze 970: eqn_next(ep, MODE_SUB) == EQN_TOK_EOF) {
1.15 schwarze 971: mandoc_msg(MANDOCERR_REQ_EMPTY, ep->parse,
972: ep->eqn.ln, ep->eqn.pos, eqn_toks[tok]);
973: break;
974: }
1.14 schwarze 975: parent = eqn_box_alloc(ep, parent);
976: parent->type = EQN_LIST;
977: if (EQN_TOK_LEFT == tok) {
1.34 schwarze 978: if (STRNEQ(ep->start, ep->toksz, "ceiling", 7))
979: parent->left = mandoc_strdup("\\[lc]");
980: else if (STRNEQ(ep->start, ep->toksz, "floor", 5))
981: parent->left = mandoc_strdup("\\[lf]");
982: else
983: parent->left =
984: mandoc_strndup(ep->start, ep->toksz);
1.14 schwarze 985: }
986: break;
1.26 schwarze 987: case EQN_TOK_PILE:
988: case EQN_TOK_LPILE:
989: case EQN_TOK_RPILE:
990: case EQN_TOK_CPILE:
991: case EQN_TOK_CCOL:
992: case EQN_TOK_LCOL:
993: case EQN_TOK_RCOL:
1.14 schwarze 994: while (parent->args == parent->expectargs)
1.15 schwarze 995: parent = parent->parent;
1.14 schwarze 996: parent = eqn_box_alloc(ep, parent);
997: parent->type = EQN_PILE;
1.15 schwarze 998: parent->expectargs = 1;
1.14 schwarze 999: break;
1.26 schwarze 1000: case EQN_TOK_ABOVE:
1.15 schwarze 1001: for (cur = parent; cur != NULL; cur = cur->parent)
1002: if (cur->type == EQN_PILE)
1003: break;
1004: if (cur == NULL) {
1005: mandoc_msg(MANDOCERR_IT_STRAY, ep->parse,
1006: ep->eqn.ln, ep->eqn.pos, eqn_toks[tok]);
1007: break;
1008: }
1009: parent = eqn_box_alloc(ep, cur);
1.14 schwarze 1010: parent->type = EQN_LIST;
1011: break;
1.26 schwarze 1012: case EQN_TOK_MATRIX:
1.14 schwarze 1013: while (parent->args == parent->expectargs)
1.15 schwarze 1014: parent = parent->parent;
1.14 schwarze 1015: parent = eqn_box_alloc(ep, parent);
1016: parent->type = EQN_MATRIX;
1.15 schwarze 1017: parent->expectargs = 1;
1.14 schwarze 1018: break;
1.26 schwarze 1019: case EQN_TOK_EOF:
1.14 schwarze 1020: /*
1021: * End of file!
1022: * TODO: make sure we're not in an open subexpression.
1023: */
1.22 schwarze 1024: return ROFF_EQN;
1.30 schwarze 1025: case EQN_TOK__MAX:
1.27 schwarze 1026: case EQN_TOK_FUNC:
1.30 schwarze 1027: case EQN_TOK_QUOTED:
1028: case EQN_TOK_SYM:
1.34 schwarze 1029: p = ep->start;
1.27 schwarze 1030: assert(p != NULL);
1.14 schwarze 1031: /*
1032: * If we already have something in the stack and we're
1033: * in an expression, then rewind til we're not any more.
1034: */
1035: while (parent->args == parent->expectargs)
1.15 schwarze 1036: parent = parent->parent;
1.14 schwarze 1037: cur = eqn_box_alloc(ep, parent);
1038: cur->type = EQN_TEXT;
1.28 schwarze 1039: cur->text = p;
1.31 schwarze 1040: switch (tok) {
1041: case EQN_TOK_FUNC:
1042: cur->font = EQNFONT_ROMAN;
1043: break;
1044: case EQN_TOK_QUOTED:
1045: if (cur->font == EQNFONT_NONE)
1.30 schwarze 1046: cur->font = EQNFONT_ITALIC;
1.31 schwarze 1047: break;
1048: case EQN_TOK_SYM:
1049: break;
1050: default:
1051: if (cur->font != EQNFONT_NONE || *p == '\0')
1.30 schwarze 1052: break;
1.31 schwarze 1053: cpn = p - 1;
1054: ccln = CCL_LET;
1.33 schwarze 1055: split = NULL;
1.29 schwarze 1056: for (;;) {
1.31 schwarze 1057: /* Advance to next character. */
1058: cp = cpn++;
1059: ccl = ccln;
1060: ccln = isalpha((unsigned char)*cpn) ? CCL_LET :
1061: isdigit((unsigned char)*cpn) ||
1062: (*cpn == '.' && (ccl == CCL_DIG ||
1063: isdigit((unsigned char)cpn[1]))) ?
1064: CCL_DIG : CCL_PUN;
1065: /* No boundary before first character. */
1066: if (cp < p)
1067: continue;
1068: cur->font = ccl == CCL_LET ?
1069: EQNFONT_ITALIC : EQNFONT_ROMAN;
1.29 schwarze 1070: if (*cp == '\\')
1071: mandoc_escape(&cpn, NULL, NULL);
1.31 schwarze 1072: /* No boundary after last character. */
1.29 schwarze 1073: if (*cpn == '\0')
1074: break;
1.31 schwarze 1075: if (ccln == ccl)
1.29 schwarze 1076: continue;
1.32 schwarze 1077: /* Boundary found, split the text. */
1078: if (parent->args == parent->expectargs) {
1079: /* Remove the text from the tree. */
1080: if (cur->prev == NULL)
1081: parent->first = cur->next;
1082: else
1083: cur->prev->next = NULL;
1084: parent->last = cur->prev;
1085: parent->args--;
1086: /* Set up a list instead. */
1.33 schwarze 1087: split = eqn_box_alloc(ep, parent);
1088: split->type = EQN_LIST;
1.32 schwarze 1089: /* Insert the word into the list. */
1.33 schwarze 1090: split->first = split->last = cur;
1091: cur->parent = split;
1.32 schwarze 1092: cur->prev = NULL;
1.33 schwarze 1093: parent = split;
1.32 schwarze 1094: }
1095: /* Append a new text box. */
1.29 schwarze 1096: nbox = eqn_box_alloc(ep, parent);
1097: nbox->type = EQN_TEXT;
1098: nbox->text = mandoc_strdup(cpn);
1.31 schwarze 1099: /* Truncate the old box. */
1.29 schwarze 1100: p = mandoc_strndup(cur->text,
1101: cpn - cur->text);
1102: free(cur->text);
1103: cur->text = p;
1.31 schwarze 1104: /* Setup to process the new box. */
1.29 schwarze 1105: cur = nbox;
1.31 schwarze 1106: p = nbox->text;
1107: cpn = p - 1;
1108: ccln = CCL_LET;
1.29 schwarze 1109: }
1.33 schwarze 1110: if (split != NULL)
1111: parent = split->parent;
1.31 schwarze 1112: break;
1113: }
1.14 schwarze 1114: break;
1.27 schwarze 1115: default:
1116: abort();
1.7 schwarze 1117: }
1.15 schwarze 1118: goto next_tok;
1.4 schwarze 1119: }
1120:
1.14 schwarze 1121: enum rofferr
1122: eqn_end(struct eqn_node **epp)
1.4 schwarze 1123: {
1.14 schwarze 1124: struct eqn_node *ep;
1.4 schwarze 1125:
1.14 schwarze 1126: ep = *epp;
1127: *epp = NULL;
1.4 schwarze 1128:
1.14 schwarze 1129: ep->eqn.root = mandoc_calloc(1, sizeof(struct eqn_box));
1130: ep->eqn.root->expectargs = UINT_MAX;
1.22 schwarze 1131: return eqn_parse(ep, ep->eqn.root);
1.4 schwarze 1132: }
1133:
1.14 schwarze 1134: void
1135: eqn_free(struct eqn_node *p)
1.4 schwarze 1136: {
1137: int i;
1138:
1.14 schwarze 1139: eqn_box_free(p->eqn.root);
1140:
1141: for (i = 0; i < (int)p->defsz; i++) {
1142: free(p->defs[i].key);
1143: free(p->defs[i].val);
1144: }
1.4 schwarze 1145:
1.14 schwarze 1146: free(p->data);
1147: free(p->defs);
1148: free(p);
1.1 schwarze 1149: }
![[BACK]](/icons/back.gif){kind=icon}
Return to eqn.c CVS log ![[TXT]](/icons/text.gif){kind=icon}
![[DIR]](/icons/dir.gif){kind=icon}
Up to [local] / src / usr.bin / mandoc