Annotation of src/usr.bin/mandoc/eqn.c, Revision 1.28
1.28 ! schwarze 1: /* $OpenBSD: eqn.c,v 1.27 2017/06/21 18:03:50 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.28 ! schwarze 524: for (i = 0; i < EQNSYM__MAX; i++) {
! 525: if (STRNEQ(start, sz,
! 526: eqnsyms[i].str, strlen(eqnsyms[i].str))) {
! 527: mandoc_asprintf(p, "\\[%s]", eqnsyms[i].sym);
! 528: return EQN_TOK__MAX;
! 529: }
! 530: }
! 531:
1.27 schwarze 532: if (p != NULL)
1.14 schwarze 533: *p = mandoc_strndup(start, sz);
534:
1.27 schwarze 535: for (i = 0; i < sizeof(eqn_func)/sizeof(*eqn_func); i++)
536: if (STRNEQ(start, sz, eqn_func[i], strlen(eqn_func[i])))
537: return EQN_TOK_FUNC;
538:
539: return EQN_TOK__MAX;
1.14 schwarze 540: }
541:
542: static void
543: eqn_box_free(struct eqn_box *bp)
1.4 schwarze 544: {
545:
1.14 schwarze 546: if (bp->first)
547: eqn_box_free(bp->first);
548: if (bp->next)
549: eqn_box_free(bp->next);
1.4 schwarze 550:
1.14 schwarze 551: free(bp->text);
552: free(bp->left);
553: free(bp->right);
554: free(bp->top);
555: free(bp->bottom);
556: free(bp);
1.4 schwarze 557: }
558:
1.14 schwarze 559: /*
560: * Allocate a box as the last child of the parent node.
561: */
562: static struct eqn_box *
563: eqn_box_alloc(struct eqn_node *ep, struct eqn_box *parent)
1.4 schwarze 564: {
1.14 schwarze 565: struct eqn_box *bp;
566:
567: bp = mandoc_calloc(1, sizeof(struct eqn_box));
568: bp->parent = parent;
569: bp->parent->args++;
570: bp->expectargs = UINT_MAX;
571: bp->size = ep->gsize;
572:
573: if (NULL != parent->first) {
574: parent->last->next = bp;
575: bp->prev = parent->last;
576: } else
577: parent->first = bp;
578:
579: parent->last = bp;
1.22 schwarze 580: return bp;
1.14 schwarze 581: }
1.4 schwarze 582:
1.14 schwarze 583: /*
584: * Reparent the current last node (of the current parent) under a new
585: * EQN_SUBEXPR as the first element.
586: * Then return the new parent.
587: * The new EQN_SUBEXPR will have a two-child limit.
588: */
589: static struct eqn_box *
590: eqn_box_makebinary(struct eqn_node *ep,
591: enum eqn_post pos, struct eqn_box *parent)
592: {
593: struct eqn_box *b, *newb;
1.4 schwarze 594:
1.14 schwarze 595: assert(NULL != parent->last);
596: b = parent->last;
597: if (parent->last == parent->first)
598: parent->first = NULL;
599: parent->args--;
600: parent->last = b->prev;
601: b->prev = NULL;
602: newb = eqn_box_alloc(ep, parent);
603: newb->pos = pos;
604: newb->type = EQN_SUBEXPR;
605: newb->expectargs = 2;
606: newb->args = 1;
607: newb->first = newb->last = b;
608: newb->first->next = NULL;
609: b->parent = newb;
1.22 schwarze 610: return newb;
1.4 schwarze 611: }
612:
1.14 schwarze 613: /*
1.17 schwarze 614: * Parse the "delim" control statement.
615: */
616: static void
617: eqn_delim(struct eqn_node *ep)
618: {
619: const char *start;
620: size_t sz;
621:
622: if ((start = eqn_nextrawtok(ep, &sz)) == NULL)
623: mandoc_msg(MANDOCERR_REQ_EMPTY, ep->parse,
624: ep->eqn.ln, ep->eqn.pos, "delim");
625: else if (strncmp(start, "off", 3) == 0)
626: ep->delim = 0;
627: else if (strncmp(start, "on", 2) == 0) {
628: if (ep->odelim && ep->cdelim)
629: ep->delim = 1;
630: } else if (start[1] != '\0') {
631: ep->odelim = start[0];
632: ep->cdelim = start[1];
633: ep->delim = 1;
634: }
635: }
636:
637: /*
1.14 schwarze 638: * Undefine a previously-defined string.
639: */
1.20 schwarze 640: static void
1.14 schwarze 641: eqn_undef(struct eqn_node *ep)
1.4 schwarze 642: {
1.14 schwarze 643: const char *start;
644: struct eqn_def *def;
645: size_t sz;
1.4 schwarze 646:
1.20 schwarze 647: if ((start = eqn_nextrawtok(ep, &sz)) == NULL) {
648: mandoc_msg(MANDOCERR_REQ_EMPTY, ep->parse,
649: ep->eqn.ln, ep->eqn.pos, "undef");
650: return;
651: }
652: if ((def = eqn_def_find(ep, start, sz)) == NULL)
653: return;
654: free(def->key);
655: free(def->val);
656: def->key = def->val = NULL;
657: def->keysz = def->valsz = 0;
1.4 schwarze 658: }
659:
1.20 schwarze 660: static void
1.14 schwarze 661: eqn_def(struct eqn_node *ep)
1.4 schwarze 662: {
663: const char *start;
664: size_t sz;
665: struct eqn_def *def;
666: int i;
667:
1.20 schwarze 668: if ((start = eqn_nextrawtok(ep, &sz)) == NULL) {
669: mandoc_msg(MANDOCERR_REQ_EMPTY, ep->parse,
670: ep->eqn.ln, ep->eqn.pos, "define");
671: return;
1.4 schwarze 672: }
673:
1.7 schwarze 674: /*
675: * Search for a key that already exists.
1.4 schwarze 676: * Create a new key if none is found.
677: */
678: if (NULL == (def = eqn_def_find(ep, start, sz))) {
679: /* Find holes in string array. */
680: for (i = 0; i < (int)ep->defsz; i++)
681: if (0 == ep->defs[i].keysz)
682: break;
683:
684: if (i == (int)ep->defsz) {
685: ep->defsz++;
1.9 schwarze 686: ep->defs = mandoc_reallocarray(ep->defs,
687: ep->defsz, sizeof(struct eqn_def));
1.4 schwarze 688: ep->defs[i].key = ep->defs[i].val = NULL;
689: }
690:
1.20 schwarze 691: def = ep->defs + i;
692: free(def->key);
693: def->key = mandoc_strndup(start, sz);
694: def->keysz = sz;
1.4 schwarze 695: }
696:
697: start = eqn_next(ep, ep->data[(int)ep->cur], &sz, 0);
1.20 schwarze 698: if (start == NULL) {
699: mandoc_vmsg(MANDOCERR_REQ_EMPTY, ep->parse,
700: ep->eqn.ln, ep->eqn.pos, "define %s", def->key);
701: free(def->key);
702: free(def->val);
703: def->key = def->val = NULL;
704: def->keysz = def->valsz = 0;
705: return;
1.4 schwarze 706: }
1.20 schwarze 707: free(def->val);
708: def->val = mandoc_strndup(start, sz);
1.4 schwarze 709: def->valsz = sz;
710: }
711:
1.14 schwarze 712: /*
713: * Recursively parse an eqn(7) expression.
714: */
1.20 schwarze 715: static enum rofferr
1.14 schwarze 716: eqn_parse(struct eqn_node *ep, struct eqn_box *parent)
1.4 schwarze 717: {
1.20 schwarze 718: char sym[64];
719: struct eqn_box *cur;
720: const char *start;
1.14 schwarze 721: char *p;
1.28 ! schwarze 722: size_t sz;
1.15 schwarze 723: enum eqn_tok tok, subtok;
1.14 schwarze 724: enum eqn_post pos;
1.20 schwarze 725: int size;
1.4 schwarze 726:
1.19 schwarze 727: assert(parent != NULL);
1.20 schwarze 728:
729: /*
730: * Empty equation.
731: * Do not add it to the high-level syntax tree.
732: */
733:
1.19 schwarze 734: if (ep->data == NULL)
1.22 schwarze 735: return ROFF_IGN;
1.4 schwarze 736:
1.15 schwarze 737: next_tok:
738: tok = eqn_tok_parse(ep, &p);
739:
740: this_tok:
741: switch (tok) {
1.26 schwarze 742: case EQN_TOK_UNDEF:
1.20 schwarze 743: eqn_undef(ep);
1.14 schwarze 744: break;
1.26 schwarze 745: case EQN_TOK_NDEFINE:
746: case EQN_TOK_DEFINE:
1.20 schwarze 747: eqn_def(ep);
1.14 schwarze 748: break;
1.26 schwarze 749: case EQN_TOK_TDEFINE:
1.20 schwarze 750: if (eqn_nextrawtok(ep, NULL) == NULL ||
751: eqn_next(ep, ep->data[(int)ep->cur], NULL, 0) == NULL)
752: mandoc_msg(MANDOCERR_REQ_EMPTY, ep->parse,
753: ep->eqn.ln, ep->eqn.pos, "tdefine");
1.14 schwarze 754: break;
1.26 schwarze 755: case EQN_TOK_DELIM:
1.17 schwarze 756: eqn_delim(ep);
757: break;
1.26 schwarze 758: case EQN_TOK_GFONT:
1.15 schwarze 759: if (eqn_nextrawtok(ep, NULL) == NULL)
760: mandoc_msg(MANDOCERR_REQ_EMPTY, ep->parse,
761: ep->eqn.ln, ep->eqn.pos, eqn_toks[tok]);
1.14 schwarze 762: break;
1.26 schwarze 763: case EQN_TOK_MARK:
764: case EQN_TOK_LINEUP:
1.14 schwarze 765: /* Ignore these. */
766: break;
1.26 schwarze 767: case EQN_TOK_DYAD:
768: case EQN_TOK_VEC:
769: case EQN_TOK_UNDER:
770: case EQN_TOK_BAR:
771: case EQN_TOK_TILDE:
772: case EQN_TOK_HAT:
773: case EQN_TOK_DOT:
774: case EQN_TOK_DOTDOT:
1.15 schwarze 775: if (parent->last == NULL) {
776: mandoc_msg(MANDOCERR_EQN_NOBOX, ep->parse,
777: ep->eqn.ln, ep->eqn.pos, eqn_toks[tok]);
778: cur = eqn_box_alloc(ep, parent);
779: cur->type = EQN_TEXT;
780: cur->text = mandoc_strdup("");
1.14 schwarze 781: }
782: parent = eqn_box_makebinary(ep, EQNPOS_NONE, parent);
783: parent->type = EQN_LISTONE;
784: parent->expectargs = 1;
785: switch (tok) {
1.26 schwarze 786: case EQN_TOK_DOTDOT:
1.14 schwarze 787: strlcpy(sym, "\\[ad]", sizeof(sym));
788: break;
1.26 schwarze 789: case EQN_TOK_VEC:
1.14 schwarze 790: strlcpy(sym, "\\[->]", sizeof(sym));
791: break;
1.26 schwarze 792: case EQN_TOK_DYAD:
1.14 schwarze 793: strlcpy(sym, "\\[<>]", sizeof(sym));
794: break;
1.26 schwarze 795: case EQN_TOK_TILDE:
1.14 schwarze 796: strlcpy(sym, "\\[a~]", sizeof(sym));
797: break;
1.26 schwarze 798: case EQN_TOK_UNDER:
1.14 schwarze 799: strlcpy(sym, "\\[ul]", sizeof(sym));
800: break;
1.26 schwarze 801: case EQN_TOK_BAR:
1.14 schwarze 802: strlcpy(sym, "\\[rl]", sizeof(sym));
803: break;
1.26 schwarze 804: case EQN_TOK_DOT:
1.14 schwarze 805: strlcpy(sym, "\\[a.]", sizeof(sym));
806: break;
1.26 schwarze 807: case EQN_TOK_HAT:
1.14 schwarze 808: strlcpy(sym, "\\[ha]", sizeof(sym));
809: break;
810: default:
811: abort();
812: }
1.4 schwarze 813:
1.14 schwarze 814: switch (tok) {
1.26 schwarze 815: case EQN_TOK_DOTDOT:
816: case EQN_TOK_VEC:
817: case EQN_TOK_DYAD:
818: case EQN_TOK_TILDE:
819: case EQN_TOK_BAR:
820: case EQN_TOK_DOT:
821: case EQN_TOK_HAT:
1.14 schwarze 822: parent->top = mandoc_strdup(sym);
823: break;
1.26 schwarze 824: case EQN_TOK_UNDER:
1.14 schwarze 825: parent->bottom = mandoc_strdup(sym);
826: break;
827: default:
828: abort();
829: }
830: parent = parent->parent;
831: break;
1.26 schwarze 832: case EQN_TOK_FWD:
833: case EQN_TOK_BACK:
834: case EQN_TOK_DOWN:
835: case EQN_TOK_UP:
1.15 schwarze 836: subtok = eqn_tok_parse(ep, NULL);
837: if (subtok != EQN_TOK__MAX) {
838: mandoc_msg(MANDOCERR_REQ_EMPTY, ep->parse,
839: ep->eqn.ln, ep->eqn.pos, eqn_toks[tok]);
840: tok = subtok;
841: goto this_tok;
1.14 schwarze 842: }
843: break;
1.26 schwarze 844: case EQN_TOK_FAT:
845: case EQN_TOK_ROMAN:
846: case EQN_TOK_ITALIC:
847: case EQN_TOK_BOLD:
1.14 schwarze 848: while (parent->args == parent->expectargs)
1.15 schwarze 849: parent = parent->parent;
1.14 schwarze 850: /*
851: * These values apply to the next word or sequence of
852: * words; thus, we mark that we'll have a child with
853: * exactly one of those.
854: */
855: parent = eqn_box_alloc(ep, parent);
856: parent->type = EQN_LISTONE;
857: parent->expectargs = 1;
858: switch (tok) {
1.26 schwarze 859: case EQN_TOK_FAT:
1.14 schwarze 860: parent->font = EQNFONT_FAT;
861: break;
1.26 schwarze 862: case EQN_TOK_ROMAN:
1.14 schwarze 863: parent->font = EQNFONT_ROMAN;
864: break;
1.26 schwarze 865: case EQN_TOK_ITALIC:
1.14 schwarze 866: parent->font = EQNFONT_ITALIC;
867: break;
1.26 schwarze 868: case EQN_TOK_BOLD:
1.14 schwarze 869: parent->font = EQNFONT_BOLD;
870: break;
871: default:
872: abort();
873: }
874: break;
1.26 schwarze 875: case EQN_TOK_SIZE:
876: case EQN_TOK_GSIZE:
1.14 schwarze 877: /* Accept two values: integral size and a single. */
878: if (NULL == (start = eqn_nexttok(ep, &sz))) {
1.15 schwarze 879: mandoc_msg(MANDOCERR_REQ_EMPTY, ep->parse,
880: ep->eqn.ln, ep->eqn.pos, eqn_toks[tok]);
881: break;
1.14 schwarze 882: }
883: size = mandoc_strntoi(start, sz, 10);
884: if (-1 == size) {
1.15 schwarze 885: mandoc_msg(MANDOCERR_IT_NONUM, ep->parse,
886: ep->eqn.ln, ep->eqn.pos, eqn_toks[tok]);
887: break;
1.14 schwarze 888: }
889: if (EQN_TOK_GSIZE == tok) {
890: ep->gsize = size;
891: break;
892: }
893: parent = eqn_box_alloc(ep, parent);
894: parent->type = EQN_LISTONE;
895: parent->expectargs = 1;
896: parent->size = size;
897: break;
1.26 schwarze 898: case EQN_TOK_FROM:
899: case EQN_TOK_TO:
900: case EQN_TOK_SUB:
901: case EQN_TOK_SUP:
1.14 schwarze 902: /*
903: * We have a left-right-associative expression.
904: * Repivot under a positional node, open a child scope
905: * and keep on reading.
906: */
1.15 schwarze 907: if (parent->last == NULL) {
908: mandoc_msg(MANDOCERR_EQN_NOBOX, ep->parse,
909: ep->eqn.ln, ep->eqn.pos, eqn_toks[tok]);
910: cur = eqn_box_alloc(ep, parent);
911: cur->type = EQN_TEXT;
912: cur->text = mandoc_strdup("");
1.14 schwarze 913: }
914: /* Handle the "subsup" and "fromto" positions. */
915: if (EQN_TOK_SUP == tok && parent->pos == EQNPOS_SUB) {
916: parent->expectargs = 3;
917: parent->pos = EQNPOS_SUBSUP;
918: break;
919: }
920: if (EQN_TOK_TO == tok && parent->pos == EQNPOS_FROM) {
921: parent->expectargs = 3;
922: parent->pos = EQNPOS_FROMTO;
923: break;
924: }
925: switch (tok) {
1.26 schwarze 926: case EQN_TOK_FROM:
1.14 schwarze 927: pos = EQNPOS_FROM;
928: break;
1.26 schwarze 929: case EQN_TOK_TO:
1.14 schwarze 930: pos = EQNPOS_TO;
931: break;
1.26 schwarze 932: case EQN_TOK_SUP:
1.14 schwarze 933: pos = EQNPOS_SUP;
934: break;
1.26 schwarze 935: case EQN_TOK_SUB:
1.14 schwarze 936: pos = EQNPOS_SUB;
937: break;
938: default:
939: abort();
940: }
941: parent = eqn_box_makebinary(ep, pos, parent);
942: break;
1.26 schwarze 943: case EQN_TOK_SQRT:
1.14 schwarze 944: while (parent->args == parent->expectargs)
1.15 schwarze 945: parent = parent->parent;
1.14 schwarze 946: /*
947: * Accept a left-right-associative set of arguments just
948: * like sub and sup and friends but without rebalancing
949: * under a pivot.
950: */
951: parent = eqn_box_alloc(ep, parent);
952: parent->type = EQN_SUBEXPR;
953: parent->pos = EQNPOS_SQRT;
954: parent->expectargs = 1;
955: break;
1.26 schwarze 956: case EQN_TOK_OVER:
1.14 schwarze 957: /*
958: * We have a right-left-associative fraction.
959: * Close out anything that's currently open, then
960: * rebalance and continue reading.
961: */
1.15 schwarze 962: if (parent->last == NULL) {
963: mandoc_msg(MANDOCERR_EQN_NOBOX, ep->parse,
964: ep->eqn.ln, ep->eqn.pos, eqn_toks[tok]);
965: cur = eqn_box_alloc(ep, parent);
966: cur->type = EQN_TEXT;
967: cur->text = mandoc_strdup("");
1.14 schwarze 968: }
969: while (EQN_SUBEXPR == parent->type)
1.15 schwarze 970: parent = parent->parent;
1.14 schwarze 971: parent = eqn_box_makebinary(ep, EQNPOS_OVER, parent);
972: break;
1.26 schwarze 973: case EQN_TOK_RIGHT:
974: case EQN_TOK_BRACE_CLOSE:
1.14 schwarze 975: /*
976: * Close out the existing brace.
977: * FIXME: this is a shitty sentinel: we should really
978: * have a native EQN_BRACE type or whatnot.
979: */
1.15 schwarze 980: for (cur = parent; cur != NULL; cur = cur->parent)
981: if (cur->type == EQN_LIST &&
982: (tok == EQN_TOK_BRACE_CLOSE ||
983: cur->left != NULL))
984: break;
985: if (cur == NULL) {
986: mandoc_msg(MANDOCERR_BLK_NOTOPEN, ep->parse,
987: ep->eqn.ln, ep->eqn.pos, eqn_toks[tok]);
988: break;
989: }
990: parent = cur;
1.14 schwarze 991: if (EQN_TOK_RIGHT == tok) {
992: if (NULL == (start = eqn_nexttok(ep, &sz))) {
1.15 schwarze 993: mandoc_msg(MANDOCERR_REQ_EMPTY,
994: ep->parse, ep->eqn.ln,
995: ep->eqn.pos, eqn_toks[tok]);
996: break;
1.14 schwarze 997: }
998: /* Handling depends on right/left. */
999: if (STRNEQ(start, sz, "ceiling", 7)) {
1000: strlcpy(sym, "\\[rc]", sizeof(sym));
1001: parent->right = mandoc_strdup(sym);
1002: } else if (STRNEQ(start, sz, "floor", 5)) {
1003: strlcpy(sym, "\\[rf]", sizeof(sym));
1004: parent->right = mandoc_strdup(sym);
1005: } else
1006: parent->right = mandoc_strndup(start, sz);
1007: }
1.15 schwarze 1008: parent = parent->parent;
1.24 schwarze 1009: if (tok == EQN_TOK_BRACE_CLOSE &&
1.14 schwarze 1010: (parent->type == EQN_PILE ||
1011: parent->type == EQN_MATRIX))
1012: parent = parent->parent;
1013: /* Close out any "singleton" lists. */
1014: while (parent->type == EQN_LISTONE &&
1015: parent->args == parent->expectargs)
1.15 schwarze 1016: parent = parent->parent;
1.14 schwarze 1017: break;
1.26 schwarze 1018: case EQN_TOK_BRACE_OPEN:
1019: case EQN_TOK_LEFT:
1.14 schwarze 1020: /*
1021: * If we already have something in the stack and we're
1022: * in an expression, then rewind til we're not any more
1023: * (just like with the text node).
1024: */
1025: while (parent->args == parent->expectargs)
1.15 schwarze 1026: parent = parent->parent;
1027: if (EQN_TOK_LEFT == tok &&
1028: (start = eqn_nexttok(ep, &sz)) == NULL) {
1029: mandoc_msg(MANDOCERR_REQ_EMPTY, ep->parse,
1030: ep->eqn.ln, ep->eqn.pos, eqn_toks[tok]);
1031: break;
1032: }
1.14 schwarze 1033: parent = eqn_box_alloc(ep, parent);
1034: parent->type = EQN_LIST;
1035: if (EQN_TOK_LEFT == tok) {
1036: if (STRNEQ(start, sz, "ceiling", 7)) {
1037: strlcpy(sym, "\\[lc]", sizeof(sym));
1038: parent->left = mandoc_strdup(sym);
1039: } else if (STRNEQ(start, sz, "floor", 5)) {
1040: strlcpy(sym, "\\[lf]", sizeof(sym));
1041: parent->left = mandoc_strdup(sym);
1042: } else
1043: parent->left = mandoc_strndup(start, sz);
1044: }
1045: break;
1.26 schwarze 1046: case EQN_TOK_PILE:
1047: case EQN_TOK_LPILE:
1048: case EQN_TOK_RPILE:
1049: case EQN_TOK_CPILE:
1050: case EQN_TOK_CCOL:
1051: case EQN_TOK_LCOL:
1052: case EQN_TOK_RCOL:
1.14 schwarze 1053: while (parent->args == parent->expectargs)
1.15 schwarze 1054: parent = parent->parent;
1.14 schwarze 1055: parent = eqn_box_alloc(ep, parent);
1056: parent->type = EQN_PILE;
1.15 schwarze 1057: parent->expectargs = 1;
1.14 schwarze 1058: break;
1.26 schwarze 1059: case EQN_TOK_ABOVE:
1.15 schwarze 1060: for (cur = parent; cur != NULL; cur = cur->parent)
1061: if (cur->type == EQN_PILE)
1062: break;
1063: if (cur == NULL) {
1064: mandoc_msg(MANDOCERR_IT_STRAY, ep->parse,
1065: ep->eqn.ln, ep->eqn.pos, eqn_toks[tok]);
1066: break;
1067: }
1068: parent = eqn_box_alloc(ep, cur);
1.14 schwarze 1069: parent->type = EQN_LIST;
1070: break;
1.26 schwarze 1071: case EQN_TOK_MATRIX:
1.14 schwarze 1072: while (parent->args == parent->expectargs)
1.15 schwarze 1073: parent = parent->parent;
1.14 schwarze 1074: parent = eqn_box_alloc(ep, parent);
1075: parent->type = EQN_MATRIX;
1.15 schwarze 1076: parent->expectargs = 1;
1.14 schwarze 1077: break;
1.26 schwarze 1078: case EQN_TOK_EOF:
1.14 schwarze 1079: /*
1080: * End of file!
1081: * TODO: make sure we're not in an open subexpression.
1082: */
1.22 schwarze 1083: return ROFF_EQN;
1.27 schwarze 1084: case EQN_TOK_FUNC:
1085: case EQN_TOK__MAX:
1086: assert(p != NULL);
1.14 schwarze 1087: /*
1088: * If we already have something in the stack and we're
1089: * in an expression, then rewind til we're not any more.
1090: */
1091: while (parent->args == parent->expectargs)
1.15 schwarze 1092: parent = parent->parent;
1.27 schwarze 1093: if (tok == EQN_TOK_FUNC) {
1094: for (cur = parent; cur != NULL; cur = cur->parent)
1095: if (cur->font != EQNFONT_NONE)
1096: break;
1097: if (cur == NULL || cur->font != EQNFONT_ROMAN) {
1098: parent = eqn_box_alloc(ep, parent);
1099: parent->type = EQN_LISTONE;
1100: parent->font = EQNFONT_ROMAN;
1101: parent->expectargs = 1;
1102: }
1103: }
1.14 schwarze 1104: cur = eqn_box_alloc(ep, parent);
1105: cur->type = EQN_TEXT;
1.28 ! schwarze 1106: cur->text = p;
1.14 schwarze 1107:
1108: /*
1109: * Post-process list status.
1110: */
1111: while (parent->type == EQN_LISTONE &&
1.15 schwarze 1112: parent->args == parent->expectargs)
1113: parent = parent->parent;
1.14 schwarze 1114: break;
1.27 schwarze 1115: default:
1116: abort();
1.7 schwarze 1117: }
1.15 schwarze 1118: goto next_tok;
1.4 schwarze 1119: }
1120:
1.14 schwarze 1121: enum rofferr
1122: eqn_end(struct eqn_node **epp)
1.4 schwarze 1123: {
1.14 schwarze 1124: struct eqn_node *ep;
1.4 schwarze 1125:
1.14 schwarze 1126: ep = *epp;
1127: *epp = NULL;
1.4 schwarze 1128:
1.14 schwarze 1129: ep->eqn.root = mandoc_calloc(1, sizeof(struct eqn_box));
1130: ep->eqn.root->expectargs = UINT_MAX;
1.22 schwarze 1131: return eqn_parse(ep, ep->eqn.root);
1.4 schwarze 1132: }
1133:
1.14 schwarze 1134: void
1135: eqn_free(struct eqn_node *p)
1.4 schwarze 1136: {
1137: int i;
1138:
1.14 schwarze 1139: eqn_box_free(p->eqn.root);
1140:
1141: for (i = 0; i < (int)p->defsz; i++) {
1142: free(p->defs[i].key);
1143: free(p->defs[i].val);
1144: }
1.4 schwarze 1145:
1.14 schwarze 1146: free(p->data);
1147: free(p->defs);
1148: free(p);
1.1 schwarze 1149: }
![[BACK]](/icons/back.gif){kind=icon}
Return to eqn.c CVS log ![[TXT]](/icons/text.gif){kind=icon}
![[DIR]](/icons/dir.gif){kind=icon}
Up to [local] / src / usr.bin / mandoc