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