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