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