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