Annotation of mandoc/eqn.c, Revision 1.32
1.32 ! kristaps 1: /* $Id: eqn.c,v 1.31 2011/07/23 09:47:25 kristaps Exp $ */
1.1 kristaps 2: /*
3: * Copyright (c) 2011 Kristaps Dzonsons <kristaps@bsd.lv>
4: *
5: * Permission to use, copy, modify, and distribute this software for any
6: * purpose with or without fee is hereby granted, provided that the above
7: * copyright notice and this permission notice appear in all copies.
8: *
9: * THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES
10: * WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF
11: * MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR
12: * ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
13: * WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN
14: * ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF
15: * OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
16: */
17: #ifdef HAVE_CONFIG_H
18: #include "config.h"
19: #endif
20:
21: #include <assert.h>
1.19 kristaps 22: #include <limits.h>
1.1 kristaps 23: #include <stdio.h>
24: #include <stdlib.h>
25: #include <string.h>
26: #include <time.h>
27:
28: #include "mandoc.h"
29: #include "libmandoc.h"
30: #include "libroff.h"
31:
1.11 kristaps 32: #define EQN_NEST_MAX 128 /* maximum nesting of defines */
1.12 kristaps 33: #define EQN_MSG(t, x) mandoc_msg((t), (x)->parse, (x)->eqn.ln, (x)->eqn.pos, NULL)
1.8 kristaps 34:
1.20 kristaps 35: enum eqn_rest {
36: EQN_DESCOPE,
37: EQN_ERR,
38: EQN_OK,
39: EQN_EOF
40: };
41:
1.27 kristaps 42: enum eqn_symt {
43: EQNSYM_alpha,
44: EQNSYM_beta,
45: EQNSYM_chi,
46: EQNSYM_delta,
47: EQNSYM_epsilon,
48: EQNSYM_eta,
49: EQNSYM_gamma,
50: EQNSYM_iota,
51: EQNSYM_kappa,
52: EQNSYM_lambda,
53: EQNSYM_mu,
54: EQNSYM_nu,
55: EQNSYM_omega,
56: EQNSYM_omicron,
57: EQNSYM_phi,
58: EQNSYM_pi,
59: EQNSYM_ps,
60: EQNSYM_rho,
61: EQNSYM_sigma,
62: EQNSYM_tau,
63: EQNSYM_theta,
64: EQNSYM_upsilon,
65: EQNSYM_xi,
66: EQNSYM_zeta,
67: EQNSYM_DELTA,
68: EQNSYM_GAMMA,
69: EQNSYM_LAMBDA,
70: EQNSYM_OMEGA,
71: EQNSYM_PHI,
72: EQNSYM_PI,
73: EQNSYM_PSI,
74: EQNSYM_SIGMA,
75: EQNSYM_THETA,
76: EQNSYM_UPSILON,
77: EQNSYM_XI,
1.28 kristaps 78: EQNSYM_inter,
79: EQNSYM_union,
80: EQNSYM_prod,
81: EQNSYM_int,
82: EQNSYM_sum,
83: EQNSYM_grad,
84: EQNSYM_del,
85: EQNSYM_times,
86: EQNSYM_cdot,
87: EQNSYM_nothing,
88: EQNSYM_approx,
89: EQNSYM_prime,
90: EQNSYM_half,
91: EQNSYM_partial,
92: EQNSYM_inf,
93: EQNSYM_muchgreat,
94: EQNSYM_muchless,
95: EQNSYM_larrow,
96: EQNSYM_rarrow,
97: EQNSYM_pm,
98: EQNSYM_nequal,
99: EQNSYM_equiv,
100: EQNSYM_lessequal,
101: EQNSYM_moreequal,
1.27 kristaps 102: EQNSYM__MAX
103: };
104:
1.17 kristaps 105: struct eqnstr {
1.8 kristaps 106: const char *name;
107: size_t sz;
108: };
109:
1.24 kristaps 110: #define STRNEQ(p1, sz1, p2, sz2) \
1.25 kristaps 111: ((sz1) == (sz2) && 0 == strncmp((p1), (p2), (sz1)))
1.24 kristaps 112: #define EQNSTREQ(x, p, sz) \
113: STRNEQ((x)->name, (x)->sz, (p), (sz))
114:
1.17 kristaps 115: struct eqnpart {
116: struct eqnstr str;
117: int (*fp)(struct eqn_node *);
1.16 kristaps 118: };
119:
1.27 kristaps 120: struct eqnsym {
121: struct eqnstr str;
1.28 kristaps 122: const char *sym;
1.27 kristaps 123: };
124:
1.8 kristaps 125: enum eqnpartt {
126: EQN_DEFINE = 0,
127: EQN_SET,
128: EQN_UNDEF,
1.30 kristaps 129: EQN_GFONT,
1.29 kristaps 130: EQN_GSIZE,
1.8 kristaps 131: EQN__MAX
132: };
133:
1.23 kristaps 134: static enum eqn_rest eqn_box(struct eqn_node *, struct eqn_box *);
1.29 kristaps 135: static struct eqn_box *eqn_box_alloc(struct eqn_node *,
136: struct eqn_box *);
1.13 kristaps 137: static void eqn_box_free(struct eqn_box *);
1.12 kristaps 138: static struct eqn_def *eqn_def_find(struct eqn_node *,
139: const char *, size_t);
1.30 kristaps 140: static int eqn_do_gfont(struct eqn_node *);
1.29 kristaps 141: static int eqn_do_gsize(struct eqn_node *);
1.12 kristaps 142: static int eqn_do_define(struct eqn_node *);
1.14 kristaps 143: static int eqn_do_set(struct eqn_node *);
1.12 kristaps 144: static int eqn_do_undef(struct eqn_node *);
1.23 kristaps 145: static enum eqn_rest eqn_eqn(struct eqn_node *, struct eqn_box *);
146: static enum eqn_rest eqn_list(struct eqn_node *, struct eqn_box *);
1.32 ! kristaps 147: static enum eqn_rest eqn_matrix(struct eqn_node *, struct eqn_box *);
1.12 kristaps 148: static const char *eqn_nexttok(struct eqn_node *, size_t *);
1.14 kristaps 149: static const char *eqn_nextrawtok(struct eqn_node *, size_t *);
150: static const char *eqn_next(struct eqn_node *,
151: char, size_t *, int);
1.20 kristaps 152: static void eqn_rewind(struct eqn_node *);
1.6 kristaps 153:
1.8 kristaps 154: static const struct eqnpart eqnparts[EQN__MAX] = {
1.17 kristaps 155: { { "define", 6 }, eqn_do_define }, /* EQN_DEFINE */
156: { { "set", 3 }, eqn_do_set }, /* EQN_SET */
157: { { "undef", 5 }, eqn_do_undef }, /* EQN_UNDEF */
1.30 kristaps 158: { { "gfont", 5 }, eqn_do_gfont }, /* EQN_GFONT */
159: { { "gsize", 5 }, eqn_do_gsize }, /* EQN_GSIZE */
1.8 kristaps 160: };
161:
1.17 kristaps 162: static const struct eqnstr eqnmarks[EQNMARK__MAX] = {
1.16 kristaps 163: { "", 0 }, /* EQNMARK_NONE */
164: { "dot", 3 }, /* EQNMARK_DOT */
165: { "dotdot", 6 }, /* EQNMARK_DOTDOT */
166: { "hat", 3 }, /* EQNMARK_HAT */
167: { "tilde", 5 }, /* EQNMARK_TILDE */
168: { "vec", 3 }, /* EQNMARK_VEC */
169: { "dyad", 4 }, /* EQNMARK_DYAD */
170: { "bar", 3 }, /* EQNMARK_BAR */
171: { "under", 5 }, /* EQNMARK_UNDER */
172: };
173:
1.17 kristaps 174: static const struct eqnstr eqnfonts[EQNFONT__MAX] = {
1.20 kristaps 175: { "", 0 }, /* EQNFONT_NONE */
176: { "roman", 5 }, /* EQNFONT_ROMAN */
177: { "bold", 4 }, /* EQNFONT_BOLD */
178: { "italic", 6 }, /* EQNFONT_ITALIC */
1.17 kristaps 179: };
180:
1.18 kristaps 181: static const struct eqnstr eqnposs[EQNPOS__MAX] = {
1.20 kristaps 182: { "", 0 }, /* EQNPOS_NONE */
183: { "over", 4 }, /* EQNPOS_OVER */
184: { "sup", 3 }, /* EQNPOS_SUP */
185: { "sub", 3 }, /* EQNPOS_SUB */
186: { "to", 2 }, /* EQNPOS_TO */
187: { "from", 4 }, /* EQNPOS_FROM */
188: };
189:
190: static const struct eqnstr eqnpiles[EQNPILE__MAX] = {
191: { "", 0 }, /* EQNPILE_NONE */
192: { "cpile", 5 }, /* EQNPILE_CPILE */
193: { "rpile", 5 }, /* EQNPILE_RPILE */
194: { "lpile", 5 }, /* EQNPILE_LPILE */
1.32 ! kristaps 195: { "ccol", 4 }, /* EQNPILE_CCOL */
! 196: { "rcol", 4 }, /* EQNPILE_RCOL */
! 197: { "lcol", 4 }, /* EQNPILE_LCOL */
1.18 kristaps 198: };
199:
1.27 kristaps 200: static const struct eqnsym eqnsyms[EQNSYM__MAX] = {
1.28 kristaps 201: { { "alpha", 5 }, "*a" }, /* EQNSYM_alpha */
202: { { "beta", 4 }, "*b" }, /* EQNSYM_beta */
203: { { "chi", 3 }, "*x" }, /* EQNSYM_chi */
204: { { "delta", 5 }, "*d" }, /* EQNSYM_delta */
205: { { "epsilon", 7 }, "*e" }, /* EQNSYM_epsilon */
206: { { "eta", 3 }, "*y" }, /* EQNSYM_eta */
207: { { "gamma", 5 }, "*g" }, /* EQNSYM_gamma */
208: { { "iota", 4 }, "*i" }, /* EQNSYM_iota */
209: { { "kappa", 5 }, "*k" }, /* EQNSYM_kappa */
210: { { "lambda", 6 }, "*l" }, /* EQNSYM_lambda */
211: { { "mu", 2 }, "*m" }, /* EQNSYM_mu */
212: { { "nu", 2 }, "*n" }, /* EQNSYM_nu */
213: { { "omega", 5 }, "*w" }, /* EQNSYM_omega */
214: { { "omicron", 7 }, "*o" }, /* EQNSYM_omicron */
215: { { "phi", 3 }, "*f" }, /* EQNSYM_phi */
216: { { "pi", 2 }, "*p" }, /* EQNSYM_pi */
217: { { "psi", 2 }, "*q" }, /* EQNSYM_psi */
218: { { "rho", 3 }, "*r" }, /* EQNSYM_rho */
219: { { "sigma", 5 }, "*s" }, /* EQNSYM_sigma */
220: { { "tau", 3 }, "*t" }, /* EQNSYM_tau */
221: { { "theta", 5 }, "*h" }, /* EQNSYM_theta */
222: { { "upsilon", 7 }, "*u" }, /* EQNSYM_upsilon */
223: { { "xi", 2 }, "*c" }, /* EQNSYM_xi */
224: { { "zeta", 4 }, "*z" }, /* EQNSYM_zeta */
225: { { "DELTA", 5 }, "*D" }, /* EQNSYM_DELTA */
226: { { "GAMMA", 5 }, "*G" }, /* EQNSYM_GAMMA */
227: { { "LAMBDA", 6 }, "*L" }, /* EQNSYM_LAMBDA */
228: { { "OMEGA", 5 }, "*W" }, /* EQNSYM_OMEGA */
229: { { "PHI", 3 }, "*F" }, /* EQNSYM_PHI */
230: { { "PI", 2 }, "*P" }, /* EQNSYM_PI */
231: { { "PSI", 3 }, "*Q" }, /* EQNSYM_PSI */
232: { { "SIGMA", 5 }, "*S" }, /* EQNSYM_SIGMA */
233: { { "THETA", 5 }, "*H" }, /* EQNSYM_THETA */
234: { { "UPSILON", 7 }, "*U" }, /* EQNSYM_UPSILON */
235: { { "XI", 2 }, "*C" }, /* EQNSYM_XI */
236: { { "inter", 5 }, "ca" }, /* EQNSYM_inter */
237: { { "union", 5 }, "cu" }, /* EQNSYM_union */
238: { { "prod", 4 }, "product" }, /* EQNSYM_prod */
239: { { "int", 3 }, "integral" }, /* EQNSYM_int */
240: { { "sum", 3 }, "sum" }, /* EQNSYM_sum */
241: { { "grad", 4 }, "gr" }, /* EQNSYM_grad */
242: { { "del", 3 }, "gr" }, /* EQNSYM_del */
243: { { "times", 5 }, "mu" }, /* EQNSYM_times */
244: { { "cdot", 4 }, "pc" }, /* EQNSYM_cdot */
245: { { "nothing", 7 }, "&" }, /* EQNSYM_nothing */
246: { { "approx", 6 }, "~~" }, /* EQNSYM_approx */
247: { { "prime", 5 }, "aq" }, /* EQNSYM_prime */
248: { { "half", 4 }, "12" }, /* EQNSYM_half */
249: { { "partial", 7 }, "pd" }, /* EQNSYM_partial */
250: { { "inf", 3 }, "if" }, /* EQNSYM_inf */
251: { { ">>", 2 }, ">>" }, /* EQNSYM_muchgreat */
252: { { "<<", 2 }, "<<" }, /* EQNSYM_muchless */
253: { { "<-", 2 }, "<-" }, /* EQNSYM_larrow */
254: { { "->", 2 }, "->" }, /* EQNSYM_rarrow */
255: { { "+-", 2 }, "+-" }, /* EQNSYM_pm */
256: { { "!=", 2 }, "!=" }, /* EQNSYM_nequal */
257: { { "==", 2 }, "==" }, /* EQNSYM_equiv */
258: { { "<=", 2 }, "<=" }, /* EQNSYM_lessequal */
259: { { ">=", 2 }, ">=" }, /* EQNSYM_moreequal */
1.27 kristaps 260: };
261:
1.1 kristaps 262: /* ARGSUSED */
263: enum rofferr
1.6 kristaps 264: eqn_read(struct eqn_node **epp, int ln,
265: const char *p, int pos, int *offs)
1.1 kristaps 266: {
1.8 kristaps 267: size_t sz;
268: struct eqn_node *ep;
1.12 kristaps 269: enum rofferr er;
270:
271: ep = *epp;
272:
273: /*
274: * If we're the terminating mark, unset our equation status and
275: * validate the full equation.
276: */
1.1 kristaps 277:
278: if (0 == strcmp(p, ".EN")) {
1.12 kristaps 279: er = eqn_end(ep);
1.1 kristaps 280: *epp = NULL;
1.12 kristaps 281: return(er);
1.1 kristaps 282: }
283:
1.12 kristaps 284: /*
285: * Build up the full string, replacing all newlines with regular
286: * whitespace.
287: */
1.6 kristaps 288:
1.12 kristaps 289: sz = strlen(p + pos) + 1;
290: ep->data = mandoc_realloc(ep->data, ep->sz + sz + 1);
1.6 kristaps 291:
1.12 kristaps 292: /* First invocation: nil terminate the string. */
1.8 kristaps 293:
1.12 kristaps 294: if (0 == ep->sz)
295: *ep->data = '\0';
1.8 kristaps 296:
1.12 kristaps 297: ep->sz += sz;
298: strlcat(ep->data, p + pos, ep->sz + 1);
299: strlcat(ep->data, " ", ep->sz + 1);
1.11 kristaps 300: return(ROFF_IGN);
301: }
302:
1.1 kristaps 303: struct eqn_node *
1.5 kristaps 304: eqn_alloc(int pos, int line, struct mparse *parse)
1.1 kristaps 305: {
306: struct eqn_node *p;
307:
308: p = mandoc_calloc(1, sizeof(struct eqn_node));
1.5 kristaps 309: p->parse = parse;
1.12 kristaps 310: p->eqn.ln = line;
1.2 kristaps 311: p->eqn.pos = pos;
1.29 kristaps 312: p->gsize = EQN_DEFSIZE;
1.1 kristaps 313:
314: return(p);
315: }
316:
1.12 kristaps 317: enum rofferr
318: eqn_end(struct eqn_node *ep)
319: {
1.20 kristaps 320: struct eqn_box *root;
321: enum eqn_rest c;
322:
323: ep->eqn.root = mandoc_calloc(1, sizeof(struct eqn_box));
1.13 kristaps 324:
1.20 kristaps 325: root = ep->eqn.root;
1.13 kristaps 326: root->type = EQN_ROOT;
327:
328: if (0 == ep->sz)
329: return(ROFF_IGN);
1.12 kristaps 330:
1.20 kristaps 331: if (EQN_DESCOPE == (c = eqn_eqn(ep, root))) {
332: EQN_MSG(MANDOCERR_EQNNSCOPE, ep);
333: c = EQN_ERR;
334: }
335:
336: return(EQN_EOF == c ? ROFF_EQN : ROFF_IGN);
337: }
338:
339: static enum eqn_rest
340: eqn_eqn(struct eqn_node *ep, struct eqn_box *last)
341: {
342: struct eqn_box *bp;
343: enum eqn_rest c;
344:
1.29 kristaps 345: bp = eqn_box_alloc(ep, last);
1.20 kristaps 346: bp->type = EQN_SUBEXPR;
1.12 kristaps 347:
1.20 kristaps 348: while (EQN_OK == (c = eqn_box(ep, bp)))
349: /* Spin! */ ;
1.15 kristaps 350:
1.20 kristaps 351: return(c);
1.12 kristaps 352: }
353:
1.20 kristaps 354: static enum eqn_rest
1.32 ! kristaps 355: eqn_matrix(struct eqn_node *ep, struct eqn_box *last)
! 356: {
! 357: struct eqn_box *bp;
! 358: const char *start;
! 359: size_t sz;
! 360: enum eqn_rest c;
! 361:
! 362: bp = eqn_box_alloc(ep, last);
! 363: bp->type = EQN_MATRIX;
! 364:
! 365: if (NULL == (start = eqn_nexttok(ep, &sz))) {
! 366: EQN_MSG(MANDOCERR_EQNEOF, ep);
! 367: return(EQN_ERR);
! 368: }
! 369: if ( ! STRNEQ(start, sz, "{", 1)) {
! 370: EQN_MSG(MANDOCERR_EQNSYNT, ep);
! 371: return(EQN_ERR);
! 372: }
! 373:
! 374: while (EQN_OK == (c = eqn_box(ep, bp)))
! 375: switch (bp->last->pile) {
! 376: case (EQNPILE_LCOL):
! 377: /* FALLTHROUGH */
! 378: case (EQNPILE_CCOL):
! 379: /* FALLTHROUGH */
! 380: case (EQNPILE_RCOL):
! 381: continue;
! 382: default:
! 383: EQN_MSG(MANDOCERR_EQNSYNT, ep);
! 384: return(EQN_ERR);
! 385: };
! 386:
! 387: if (EQN_DESCOPE != c) {
! 388: if (EQN_EOF == c)
! 389: EQN_MSG(MANDOCERR_EQNEOF, ep);
! 390: return(EQN_ERR);
! 391: }
! 392:
! 393: eqn_rewind(ep);
! 394: start = eqn_nexttok(ep, &sz);
! 395: assert(start);
! 396: if (STRNEQ(start, sz, "}", 1))
! 397: return(EQN_OK);
! 398:
! 399: EQN_MSG(MANDOCERR_EQNBADSCOPE, ep);
! 400: return(EQN_ERR);
! 401: }
! 402:
! 403: static enum eqn_rest
1.23 kristaps 404: eqn_list(struct eqn_node *ep, struct eqn_box *last)
405: {
406: struct eqn_box *bp;
407: const char *start;
408: size_t sz;
409: enum eqn_rest c;
410:
1.29 kristaps 411: bp = eqn_box_alloc(ep, last);
1.23 kristaps 412: bp->type = EQN_LIST;
413:
414: if (NULL == (start = eqn_nexttok(ep, &sz))) {
415: EQN_MSG(MANDOCERR_EQNEOF, ep);
416: return(EQN_ERR);
417: }
1.24 kristaps 418: if ( ! STRNEQ(start, sz, "{", 1)) {
1.23 kristaps 419: EQN_MSG(MANDOCERR_EQNSYNT, ep);
420: return(EQN_ERR);
421: }
422:
423: while (EQN_DESCOPE == (c = eqn_eqn(ep, bp))) {
424: eqn_rewind(ep);
425: start = eqn_nexttok(ep, &sz);
426: assert(start);
1.24 kristaps 427: if ( ! STRNEQ(start, sz, "above", 5))
1.23 kristaps 428: break;
429: }
430:
431: if (EQN_DESCOPE != c) {
432: if (EQN_ERR != c)
433: EQN_MSG(MANDOCERR_EQNSCOPE, ep);
434: return(EQN_ERR);
435: }
436:
437: eqn_rewind(ep);
438: start = eqn_nexttok(ep, &sz);
439: assert(start);
1.24 kristaps 440: if (STRNEQ(start, sz, "}", 1))
1.23 kristaps 441: return(EQN_OK);
442:
443: EQN_MSG(MANDOCERR_EQNBADSCOPE, ep);
444: return(EQN_ERR);
445: }
446:
447: static enum eqn_rest
1.20 kristaps 448: eqn_box(struct eqn_node *ep, struct eqn_box *last)
1.1 kristaps 449: {
1.12 kristaps 450: size_t sz;
451: const char *start;
1.20 kristaps 452: char *left;
1.28 kristaps 453: char sym[64];
1.20 kristaps 454: enum eqn_rest c;
455: int i, size;
1.13 kristaps 456: struct eqn_box *bp;
1.12 kristaps 457:
1.20 kristaps 458: if (NULL == (start = eqn_nexttok(ep, &sz)))
459: return(EQN_EOF);
460:
1.24 kristaps 461: if (STRNEQ(start, sz, "}", 1))
1.20 kristaps 462: return(EQN_DESCOPE);
1.24 kristaps 463: else if (STRNEQ(start, sz, "right", 5))
1.20 kristaps 464: return(EQN_DESCOPE);
1.24 kristaps 465: else if (STRNEQ(start, sz, "above", 5))
1.20 kristaps 466: return(EQN_DESCOPE);
467:
468: for (i = 0; i < (int)EQN__MAX; i++) {
1.24 kristaps 469: if ( ! EQNSTREQ(&eqnparts[i].str, start, sz))
1.20 kristaps 470: continue;
471: return((*eqnparts[i].fp)(ep) ? EQN_OK : EQN_ERR);
472: }
1.15 kristaps 473:
1.24 kristaps 474: if (STRNEQ(start, sz, "{", 1)) {
1.20 kristaps 475: if (EQN_DESCOPE != (c = eqn_eqn(ep, last))) {
476: if (EQN_ERR != c)
477: EQN_MSG(MANDOCERR_EQNSCOPE, ep);
478: return(EQN_ERR);
479: }
480: eqn_rewind(ep);
481: start = eqn_nexttok(ep, &sz);
482: assert(start);
1.24 kristaps 483: if (STRNEQ(start, sz, "}", 1))
1.20 kristaps 484: return(EQN_OK);
485: EQN_MSG(MANDOCERR_EQNBADSCOPE, ep);
486: return(EQN_ERR);
487: }
1.12 kristaps 488:
1.20 kristaps 489: for (i = 0; i < (int)EQNPILE__MAX; i++) {
1.24 kristaps 490: if ( ! EQNSTREQ(&eqnpiles[i], start, sz))
1.17 kristaps 491: continue;
1.23 kristaps 492: if (EQN_OK == (c = eqn_list(ep, last)))
1.21 kristaps 493: last->last->pile = (enum eqn_pilet)i;
1.23 kristaps 494: return(c);
1.18 kristaps 495: }
1.32 ! kristaps 496:
! 497: if (STRNEQ(start, sz, "matrix", 6))
! 498: return(eqn_matrix(ep, last));
1.18 kristaps 499:
1.24 kristaps 500: if (STRNEQ(start, sz, "left", 4)) {
1.20 kristaps 501: if (NULL == (start = eqn_nexttok(ep, &sz))) {
502: EQN_MSG(MANDOCERR_EQNEOF, ep);
503: return(EQN_ERR);
504: }
505: left = mandoc_strndup(start, sz);
1.26 kristaps 506: c = eqn_eqn(ep, last);
507: if (last->last)
508: last->last->left = left;
509: else
510: free(left);
511: if (EQN_DESCOPE != c)
1.20 kristaps 512: return(c);
513: assert(last->last);
514: eqn_rewind(ep);
515: start = eqn_nexttok(ep, &sz);
516: assert(start);
1.26 kristaps 517: if ( ! STRNEQ(start, sz, "right", 5))
1.20 kristaps 518: return(EQN_DESCOPE);
519: if (NULL == (start = eqn_nexttok(ep, &sz))) {
520: EQN_MSG(MANDOCERR_EQNEOF, ep);
521: return(EQN_ERR);
522: }
523: last->last->right = mandoc_strndup(start, sz);
524: return(EQN_OK);
525: }
526:
527: for (i = 0; i < (int)EQNPOS__MAX; i++) {
1.24 kristaps 528: if ( ! EQNSTREQ(&eqnposs[i], start, sz))
1.18 kristaps 529: continue;
1.20 kristaps 530: if (NULL == last->last) {
531: EQN_MSG(MANDOCERR_EQNSYNT, ep);
532: return(EQN_ERR);
533: }
534: last->last->pos = (enum eqn_post)i;
535: if (EQN_EOF == (c = eqn_box(ep, last))) {
536: EQN_MSG(MANDOCERR_EQNEOF, ep);
537: return(EQN_ERR);
538: }
539: return(c);
1.17 kristaps 540: }
541:
1.16 kristaps 542: for (i = 0; i < (int)EQNMARK__MAX; i++) {
1.24 kristaps 543: if ( ! EQNSTREQ(&eqnmarks[i], start, sz))
1.16 kristaps 544: continue;
1.20 kristaps 545: if (NULL == last->last) {
546: EQN_MSG(MANDOCERR_EQNSYNT, ep);
547: return(EQN_ERR);
548: }
549: last->last->mark = (enum eqn_markt)i;
550: if (EQN_EOF == (c = eqn_box(ep, last))) {
551: EQN_MSG(MANDOCERR_EQNEOF, ep);
552: return(EQN_ERR);
553: }
554: return(c);
1.16 kristaps 555: }
1.12 kristaps 556:
1.20 kristaps 557: for (i = 0; i < (int)EQNFONT__MAX; i++) {
1.24 kristaps 558: if ( ! EQNSTREQ(&eqnfonts[i], start, sz))
1.20 kristaps 559: continue;
560: if (EQN_EOF == (c = eqn_box(ep, last))) {
561: EQN_MSG(MANDOCERR_EQNEOF, ep);
562: return(EQN_ERR);
563: } else if (EQN_OK == c)
564: last->last->font = (enum eqn_fontt)i;
565: return(c);
1.19 kristaps 566: }
1.15 kristaps 567:
1.24 kristaps 568: if (STRNEQ(start, sz, "size", 4)) {
1.20 kristaps 569: if (NULL == (start = eqn_nexttok(ep, &sz))) {
570: EQN_MSG(MANDOCERR_EQNEOF, ep);
571: return(EQN_ERR);
572: }
573: size = mandoc_strntoi(start, sz, 10);
574: if (EQN_EOF == (c = eqn_box(ep, last))) {
575: EQN_MSG(MANDOCERR_EQNEOF, ep);
576: return(EQN_ERR);
577: } else if (EQN_OK != c)
578: return(c);
579: last->last->size = size;
1.15 kristaps 580: }
581:
1.29 kristaps 582: bp = eqn_box_alloc(ep, last);
1.15 kristaps 583: bp->type = EQN_TEXT;
1.27 kristaps 584: for (i = 0; i < (int)EQNSYM__MAX; i++)
585: if (EQNSTREQ(&eqnsyms[i].str, start, sz)) {
1.28 kristaps 586: sym[63] = '\0';
587: snprintf(sym, 62, "\\[%s]", eqnsyms[i].sym);
1.27 kristaps 588: bp->text = mandoc_strdup(sym);
589: return(EQN_OK);
590: }
591:
1.20 kristaps 592: bp->text = mandoc_strndup(start, sz);
593: return(EQN_OK);
1.1 kristaps 594: }
595:
596: void
597: eqn_free(struct eqn_node *p)
598: {
1.6 kristaps 599: int i;
1.1 kristaps 600:
1.13 kristaps 601: eqn_box_free(p->eqn.root);
1.6 kristaps 602:
603: for (i = 0; i < (int)p->defsz; i++) {
604: free(p->defs[i].key);
605: free(p->defs[i].val);
606: }
607:
1.12 kristaps 608: free(p->data);
1.6 kristaps 609: free(p->defs);
1.1 kristaps 610: free(p);
1.6 kristaps 611: }
612:
1.20 kristaps 613: static struct eqn_box *
1.29 kristaps 614: eqn_box_alloc(struct eqn_node *ep, struct eqn_box *parent)
1.20 kristaps 615: {
616: struct eqn_box *bp;
617:
618: bp = mandoc_calloc(1, sizeof(struct eqn_box));
619: bp->parent = parent;
1.29 kristaps 620: bp->size = ep->gsize;
1.20 kristaps 621:
622: if (NULL == parent->first)
623: parent->first = bp;
624: else
625: parent->last->next = bp;
626:
627: parent->last = bp;
628: return(bp);
629: }
630:
1.13 kristaps 631: static void
632: eqn_box_free(struct eqn_box *bp)
633: {
634:
1.20 kristaps 635: if (bp->first)
636: eqn_box_free(bp->first);
1.13 kristaps 637: if (bp->next)
638: eqn_box_free(bp->next);
639:
640: free(bp->text);
1.20 kristaps 641: free(bp->left);
642: free(bp->right);
1.13 kristaps 643: free(bp);
644: }
645:
1.6 kristaps 646: static const char *
1.14 kristaps 647: eqn_nextrawtok(struct eqn_node *ep, size_t *sz)
648: {
649:
650: return(eqn_next(ep, '"', sz, 0));
651: }
652:
653: static const char *
1.12 kristaps 654: eqn_nexttok(struct eqn_node *ep, size_t *sz)
655: {
656:
1.14 kristaps 657: return(eqn_next(ep, '"', sz, 1));
1.12 kristaps 658: }
659:
1.20 kristaps 660: static void
661: eqn_rewind(struct eqn_node *ep)
662: {
663:
664: ep->cur = ep->rew;
665: }
666:
1.12 kristaps 667: static const char *
1.14 kristaps 668: eqn_next(struct eqn_node *ep, char quote, size_t *sz, int repl)
1.6 kristaps 669: {
1.12 kristaps 670: char *start, *next;
671: int q, diff, lim;
1.22 kristaps 672: size_t ssz, dummy;
1.12 kristaps 673: struct eqn_def *def;
674:
675: if (NULL == sz)
1.22 kristaps 676: sz = &dummy;
1.6 kristaps 677:
1.13 kristaps 678: lim = 0;
1.20 kristaps 679: ep->rew = ep->cur;
1.13 kristaps 680: again:
681: /* Prevent self-definitions. */
682:
683: if (lim >= EQN_NEST_MAX) {
684: EQN_MSG(MANDOCERR_EQNNEST, ep);
685: return(NULL);
686: }
687:
1.20 kristaps 688: ep->cur = ep->rew;
1.12 kristaps 689: start = &ep->data[(int)ep->cur];
1.6 kristaps 690: q = 0;
691:
692: if ('\0' == *start)
693: return(NULL);
694:
1.12 kristaps 695: if (quote == *start) {
696: ep->cur++;
1.6 kristaps 697: q = 1;
698: }
699:
1.12 kristaps 700: start = &ep->data[(int)ep->cur];
1.22 kristaps 701:
702: if ( ! q) {
703: if ('{' == *start || '}' == *start)
704: ssz = 1;
705: else
1.31 kristaps 706: ssz = strcspn(start + 1, " ^~\"{}\t") + 1;
1.22 kristaps 707: next = start + (int)ssz;
708: if ('\0' == *next)
709: next = NULL;
710: } else
711: next = strchr(start, quote);
1.12 kristaps 712:
713: if (NULL != next) {
714: *sz = (size_t)(next - start);
715: ep->cur += *sz;
1.6 kristaps 716: if (q)
1.12 kristaps 717: ep->cur++;
1.22 kristaps 718: while (' ' == ep->data[(int)ep->cur] ||
719: '\t' == ep->data[(int)ep->cur] ||
1.31 kristaps 720: '^' == ep->data[(int)ep->cur] ||
1.22 kristaps 721: '~' == ep->data[(int)ep->cur])
1.12 kristaps 722: ep->cur++;
1.6 kristaps 723: } else {
724: if (q)
1.12 kristaps 725: EQN_MSG(MANDOCERR_BADQUOTE, ep);
726: next = strchr(start, '\0');
727: *sz = (size_t)(next - start);
728: ep->cur += *sz;
729: }
730:
1.13 kristaps 731: /* Quotes aren't expanded for values. */
732:
1.14 kristaps 733: if (q || ! repl)
1.13 kristaps 734: return(start);
735:
1.12 kristaps 736: if (NULL != (def = eqn_def_find(ep, start, *sz))) {
737: diff = def->valsz - *sz;
738:
739: if (def->valsz > *sz) {
740: ep->sz += diff;
741: ep->data = mandoc_realloc(ep->data, ep->sz + 1);
742: ep->data[ep->sz] = '\0';
1.20 kristaps 743: start = &ep->data[(int)ep->rew];
1.12 kristaps 744: }
745:
746: diff = def->valsz - *sz;
747: memmove(start + *sz + diff, start + *sz,
748: (strlen(start) - *sz) + 1);
749: memcpy(start, def->val, def->valsz);
750: goto again;
1.6 kristaps 751: }
752:
753: return(start);
1.8 kristaps 754: }
755:
756: static int
1.14 kristaps 757: eqn_do_set(struct eqn_node *ep)
1.8 kristaps 758: {
759: const char *start;
760:
1.14 kristaps 761: if (NULL == (start = eqn_nextrawtok(ep, NULL)))
1.29 kristaps 762: EQN_MSG(MANDOCERR_EQNEOF, ep);
1.14 kristaps 763: else if (NULL == (start = eqn_nextrawtok(ep, NULL)))
1.29 kristaps 764: EQN_MSG(MANDOCERR_EQNEOF, ep);
1.12 kristaps 765: else
766: return(1);
1.8 kristaps 767:
1.12 kristaps 768: return(0);
1.8 kristaps 769: }
770:
771: static int
1.12 kristaps 772: eqn_do_define(struct eqn_node *ep)
1.8 kristaps 773: {
774: const char *start;
775: size_t sz;
1.12 kristaps 776: struct eqn_def *def;
1.8 kristaps 777: int i;
778:
1.14 kristaps 779: if (NULL == (start = eqn_nextrawtok(ep, &sz))) {
1.29 kristaps 780: EQN_MSG(MANDOCERR_EQNEOF, ep);
1.8 kristaps 781: return(0);
782: }
783:
784: /*
785: * Search for a key that already exists.
1.12 kristaps 786: * Create a new key if none is found.
1.8 kristaps 787: */
788:
1.12 kristaps 789: if (NULL == (def = eqn_def_find(ep, start, sz))) {
1.8 kristaps 790: /* Find holes in string array. */
791: for (i = 0; i < (int)ep->defsz; i++)
792: if (0 == ep->defs[i].keysz)
793: break;
794:
795: if (i == (int)ep->defsz) {
796: ep->defsz++;
797: ep->defs = mandoc_realloc
798: (ep->defs, ep->defsz *
799: sizeof(struct eqn_def));
1.9 kristaps 800: ep->defs[i].key = ep->defs[i].val = NULL;
1.8 kristaps 801: }
802:
803: ep->defs[i].keysz = sz;
804: ep->defs[i].key = mandoc_realloc
805: (ep->defs[i].key, sz + 1);
806:
807: memcpy(ep->defs[i].key, start, sz);
808: ep->defs[i].key[(int)sz] = '\0';
1.12 kristaps 809: def = &ep->defs[i];
1.8 kristaps 810: }
811:
1.14 kristaps 812: start = eqn_next(ep, ep->data[(int)ep->cur], &sz, 0);
1.8 kristaps 813:
1.12 kristaps 814: if (NULL == start) {
1.29 kristaps 815: EQN_MSG(MANDOCERR_EQNEOF, ep);
1.8 kristaps 816: return(0);
817: }
818:
1.12 kristaps 819: def->valsz = sz;
1.13 kristaps 820: def->val = mandoc_realloc(def->val, sz + 1);
1.12 kristaps 821: memcpy(def->val, start, sz);
822: def->val[(int)sz] = '\0';
1.30 kristaps 823: return(1);
824: }
825:
826: static int
827: eqn_do_gfont(struct eqn_node *ep)
828: {
829: const char *start;
830:
831: if (NULL == (start = eqn_nextrawtok(ep, NULL))) {
832: EQN_MSG(MANDOCERR_EQNEOF, ep);
833: return(0);
834: }
1.12 kristaps 835: return(1);
1.8 kristaps 836: }
837:
838: static int
1.29 kristaps 839: eqn_do_gsize(struct eqn_node *ep)
840: {
841: const char *start;
842: size_t sz;
843:
844: if (NULL == (start = eqn_nextrawtok(ep, &sz))) {
845: EQN_MSG(MANDOCERR_EQNEOF, ep);
846: return(0);
847: }
848:
849: ep->gsize = mandoc_strntoi(start, sz, 10);
850: return(1);
851: }
852:
853: static int
1.12 kristaps 854: eqn_do_undef(struct eqn_node *ep)
1.8 kristaps 855: {
856: const char *start;
1.12 kristaps 857: struct eqn_def *def;
1.8 kristaps 858: size_t sz;
859:
1.14 kristaps 860: if (NULL == (start = eqn_nextrawtok(ep, &sz))) {
1.29 kristaps 861: EQN_MSG(MANDOCERR_EQNEOF, ep);
1.12 kristaps 862: return(0);
863: } else if (NULL != (def = eqn_def_find(ep, start, sz)))
864: def->keysz = 0;
1.8 kristaps 865:
1.12 kristaps 866: return(1);
867: }
868:
869: static struct eqn_def *
870: eqn_def_find(struct eqn_node *ep, const char *key, size_t sz)
871: {
872: int i;
1.8 kristaps 873:
1.12 kristaps 874: for (i = 0; i < (int)ep->defsz; i++)
1.24 kristaps 875: if (ep->defs[i].keysz && STRNEQ(ep->defs[i].key,
876: ep->defs[i].keysz, key, sz))
1.12 kristaps 877: return(&ep->defs[i]);
1.8 kristaps 878:
1.12 kristaps 879: return(NULL);
1.1 kristaps 880: }
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