Annotation of mandoc/eqn.c, Revision 1.31
1.31 ! kristaps 1: /* $Id: eqn.c,v 1.30 2011/07/22 14:59:02 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.12 kristaps 147: static const char *eqn_nexttok(struct eqn_node *, size_t *);
1.14 kristaps 148: static const char *eqn_nextrawtok(struct eqn_node *, size_t *);
149: static const char *eqn_next(struct eqn_node *,
150: char, size_t *, int);
1.20 kristaps 151: static void eqn_rewind(struct eqn_node *);
1.6 kristaps 152:
1.8 kristaps 153: static const struct eqnpart eqnparts[EQN__MAX] = {
1.17 kristaps 154: { { "define", 6 }, eqn_do_define }, /* EQN_DEFINE */
155: { { "set", 3 }, eqn_do_set }, /* EQN_SET */
156: { { "undef", 5 }, eqn_do_undef }, /* EQN_UNDEF */
1.30 kristaps 157: { { "gfont", 5 }, eqn_do_gfont }, /* EQN_GFONT */
158: { { "gsize", 5 }, eqn_do_gsize }, /* EQN_GSIZE */
1.8 kristaps 159: };
160:
1.17 kristaps 161: static const struct eqnstr eqnmarks[EQNMARK__MAX] = {
1.16 kristaps 162: { "", 0 }, /* EQNMARK_NONE */
163: { "dot", 3 }, /* EQNMARK_DOT */
164: { "dotdot", 6 }, /* EQNMARK_DOTDOT */
165: { "hat", 3 }, /* EQNMARK_HAT */
166: { "tilde", 5 }, /* EQNMARK_TILDE */
167: { "vec", 3 }, /* EQNMARK_VEC */
168: { "dyad", 4 }, /* EQNMARK_DYAD */
169: { "bar", 3 }, /* EQNMARK_BAR */
170: { "under", 5 }, /* EQNMARK_UNDER */
171: };
172:
1.17 kristaps 173: static const struct eqnstr eqnfonts[EQNFONT__MAX] = {
1.20 kristaps 174: { "", 0 }, /* EQNFONT_NONE */
175: { "roman", 5 }, /* EQNFONT_ROMAN */
176: { "bold", 4 }, /* EQNFONT_BOLD */
177: { "italic", 6 }, /* EQNFONT_ITALIC */
1.17 kristaps 178: };
179:
1.18 kristaps 180: static const struct eqnstr eqnposs[EQNPOS__MAX] = {
1.20 kristaps 181: { "", 0 }, /* EQNPOS_NONE */
182: { "over", 4 }, /* EQNPOS_OVER */
183: { "sup", 3 }, /* EQNPOS_SUP */
184: { "sub", 3 }, /* EQNPOS_SUB */
185: { "to", 2 }, /* EQNPOS_TO */
186: { "from", 4 }, /* EQNPOS_FROM */
187: };
188:
189: static const struct eqnstr eqnpiles[EQNPILE__MAX] = {
190: { "", 0 }, /* EQNPILE_NONE */
191: { "cpile", 5 }, /* EQNPILE_CPILE */
192: { "rpile", 5 }, /* EQNPILE_RPILE */
193: { "lpile", 5 }, /* EQNPILE_LPILE */
1.18 kristaps 194: };
195:
1.27 kristaps 196: static const struct eqnsym eqnsyms[EQNSYM__MAX] = {
1.28 kristaps 197: { { "alpha", 5 }, "*a" }, /* EQNSYM_alpha */
198: { { "beta", 4 }, "*b" }, /* EQNSYM_beta */
199: { { "chi", 3 }, "*x" }, /* EQNSYM_chi */
200: { { "delta", 5 }, "*d" }, /* EQNSYM_delta */
201: { { "epsilon", 7 }, "*e" }, /* EQNSYM_epsilon */
202: { { "eta", 3 }, "*y" }, /* EQNSYM_eta */
203: { { "gamma", 5 }, "*g" }, /* EQNSYM_gamma */
204: { { "iota", 4 }, "*i" }, /* EQNSYM_iota */
205: { { "kappa", 5 }, "*k" }, /* EQNSYM_kappa */
206: { { "lambda", 6 }, "*l" }, /* EQNSYM_lambda */
207: { { "mu", 2 }, "*m" }, /* EQNSYM_mu */
208: { { "nu", 2 }, "*n" }, /* EQNSYM_nu */
209: { { "omega", 5 }, "*w" }, /* EQNSYM_omega */
210: { { "omicron", 7 }, "*o" }, /* EQNSYM_omicron */
211: { { "phi", 3 }, "*f" }, /* EQNSYM_phi */
212: { { "pi", 2 }, "*p" }, /* EQNSYM_pi */
213: { { "psi", 2 }, "*q" }, /* EQNSYM_psi */
214: { { "rho", 3 }, "*r" }, /* EQNSYM_rho */
215: { { "sigma", 5 }, "*s" }, /* EQNSYM_sigma */
216: { { "tau", 3 }, "*t" }, /* EQNSYM_tau */
217: { { "theta", 5 }, "*h" }, /* EQNSYM_theta */
218: { { "upsilon", 7 }, "*u" }, /* EQNSYM_upsilon */
219: { { "xi", 2 }, "*c" }, /* EQNSYM_xi */
220: { { "zeta", 4 }, "*z" }, /* EQNSYM_zeta */
221: { { "DELTA", 5 }, "*D" }, /* EQNSYM_DELTA */
222: { { "GAMMA", 5 }, "*G" }, /* EQNSYM_GAMMA */
223: { { "LAMBDA", 6 }, "*L" }, /* EQNSYM_LAMBDA */
224: { { "OMEGA", 5 }, "*W" }, /* EQNSYM_OMEGA */
225: { { "PHI", 3 }, "*F" }, /* EQNSYM_PHI */
226: { { "PI", 2 }, "*P" }, /* EQNSYM_PI */
227: { { "PSI", 3 }, "*Q" }, /* EQNSYM_PSI */
228: { { "SIGMA", 5 }, "*S" }, /* EQNSYM_SIGMA */
229: { { "THETA", 5 }, "*H" }, /* EQNSYM_THETA */
230: { { "UPSILON", 7 }, "*U" }, /* EQNSYM_UPSILON */
231: { { "XI", 2 }, "*C" }, /* EQNSYM_XI */
232: { { "inter", 5 }, "ca" }, /* EQNSYM_inter */
233: { { "union", 5 }, "cu" }, /* EQNSYM_union */
234: { { "prod", 4 }, "product" }, /* EQNSYM_prod */
235: { { "int", 3 }, "integral" }, /* EQNSYM_int */
236: { { "sum", 3 }, "sum" }, /* EQNSYM_sum */
237: { { "grad", 4 }, "gr" }, /* EQNSYM_grad */
238: { { "del", 3 }, "gr" }, /* EQNSYM_del */
239: { { "times", 5 }, "mu" }, /* EQNSYM_times */
240: { { "cdot", 4 }, "pc" }, /* EQNSYM_cdot */
241: { { "nothing", 7 }, "&" }, /* EQNSYM_nothing */
242: { { "approx", 6 }, "~~" }, /* EQNSYM_approx */
243: { { "prime", 5 }, "aq" }, /* EQNSYM_prime */
244: { { "half", 4 }, "12" }, /* EQNSYM_half */
245: { { "partial", 7 }, "pd" }, /* EQNSYM_partial */
246: { { "inf", 3 }, "if" }, /* EQNSYM_inf */
247: { { ">>", 2 }, ">>" }, /* EQNSYM_muchgreat */
248: { { "<<", 2 }, "<<" }, /* EQNSYM_muchless */
249: { { "<-", 2 }, "<-" }, /* EQNSYM_larrow */
250: { { "->", 2 }, "->" }, /* EQNSYM_rarrow */
251: { { "+-", 2 }, "+-" }, /* EQNSYM_pm */
252: { { "!=", 2 }, "!=" }, /* EQNSYM_nequal */
253: { { "==", 2 }, "==" }, /* EQNSYM_equiv */
254: { { "<=", 2 }, "<=" }, /* EQNSYM_lessequal */
255: { { ">=", 2 }, ">=" }, /* EQNSYM_moreequal */
1.27 kristaps 256: };
257:
1.1 kristaps 258: /* ARGSUSED */
259: enum rofferr
1.6 kristaps 260: eqn_read(struct eqn_node **epp, int ln,
261: const char *p, int pos, int *offs)
1.1 kristaps 262: {
1.8 kristaps 263: size_t sz;
264: struct eqn_node *ep;
1.12 kristaps 265: enum rofferr er;
266:
267: ep = *epp;
268:
269: /*
270: * If we're the terminating mark, unset our equation status and
271: * validate the full equation.
272: */
1.1 kristaps 273:
274: if (0 == strcmp(p, ".EN")) {
1.12 kristaps 275: er = eqn_end(ep);
1.1 kristaps 276: *epp = NULL;
1.12 kristaps 277: return(er);
1.1 kristaps 278: }
279:
1.12 kristaps 280: /*
281: * Build up the full string, replacing all newlines with regular
282: * whitespace.
283: */
1.6 kristaps 284:
1.12 kristaps 285: sz = strlen(p + pos) + 1;
286: ep->data = mandoc_realloc(ep->data, ep->sz + sz + 1);
1.6 kristaps 287:
1.12 kristaps 288: /* First invocation: nil terminate the string. */
1.8 kristaps 289:
1.12 kristaps 290: if (0 == ep->sz)
291: *ep->data = '\0';
1.8 kristaps 292:
1.12 kristaps 293: ep->sz += sz;
294: strlcat(ep->data, p + pos, ep->sz + 1);
295: strlcat(ep->data, " ", ep->sz + 1);
1.11 kristaps 296: return(ROFF_IGN);
297: }
298:
1.1 kristaps 299: struct eqn_node *
1.5 kristaps 300: eqn_alloc(int pos, int line, struct mparse *parse)
1.1 kristaps 301: {
302: struct eqn_node *p;
303:
304: p = mandoc_calloc(1, sizeof(struct eqn_node));
1.5 kristaps 305: p->parse = parse;
1.12 kristaps 306: p->eqn.ln = line;
1.2 kristaps 307: p->eqn.pos = pos;
1.29 kristaps 308: p->gsize = EQN_DEFSIZE;
1.1 kristaps 309:
310: return(p);
311: }
312:
1.12 kristaps 313: enum rofferr
314: eqn_end(struct eqn_node *ep)
315: {
1.20 kristaps 316: struct eqn_box *root;
317: enum eqn_rest c;
318:
319: ep->eqn.root = mandoc_calloc(1, sizeof(struct eqn_box));
1.13 kristaps 320:
1.20 kristaps 321: root = ep->eqn.root;
1.13 kristaps 322: root->type = EQN_ROOT;
323:
324: if (0 == ep->sz)
325: return(ROFF_IGN);
1.12 kristaps 326:
1.20 kristaps 327: if (EQN_DESCOPE == (c = eqn_eqn(ep, root))) {
328: EQN_MSG(MANDOCERR_EQNNSCOPE, ep);
329: c = EQN_ERR;
330: }
331:
332: return(EQN_EOF == c ? ROFF_EQN : ROFF_IGN);
333: }
334:
335: static enum eqn_rest
336: eqn_eqn(struct eqn_node *ep, struct eqn_box *last)
337: {
338: struct eqn_box *bp;
339: enum eqn_rest c;
340:
1.29 kristaps 341: bp = eqn_box_alloc(ep, last);
1.20 kristaps 342: bp->type = EQN_SUBEXPR;
1.12 kristaps 343:
1.20 kristaps 344: while (EQN_OK == (c = eqn_box(ep, bp)))
345: /* Spin! */ ;
1.15 kristaps 346:
1.20 kristaps 347: return(c);
1.12 kristaps 348: }
349:
1.20 kristaps 350: static enum eqn_rest
1.23 kristaps 351: eqn_list(struct eqn_node *ep, struct eqn_box *last)
352: {
353: struct eqn_box *bp;
354: const char *start;
355: size_t sz;
356: enum eqn_rest c;
357:
1.29 kristaps 358: bp = eqn_box_alloc(ep, last);
1.23 kristaps 359: bp->type = EQN_LIST;
360:
361: if (NULL == (start = eqn_nexttok(ep, &sz))) {
362: EQN_MSG(MANDOCERR_EQNEOF, ep);
363: return(EQN_ERR);
364: }
1.24 kristaps 365: if ( ! STRNEQ(start, sz, "{", 1)) {
1.23 kristaps 366: EQN_MSG(MANDOCERR_EQNSYNT, ep);
367: return(EQN_ERR);
368: }
369:
370: while (EQN_DESCOPE == (c = eqn_eqn(ep, bp))) {
371: eqn_rewind(ep);
372: start = eqn_nexttok(ep, &sz);
373: assert(start);
1.24 kristaps 374: if ( ! STRNEQ(start, sz, "above", 5))
1.23 kristaps 375: break;
376: bp->last->above = 1;
377: }
378:
379: if (EQN_DESCOPE != c) {
380: if (EQN_ERR != c)
381: EQN_MSG(MANDOCERR_EQNSCOPE, ep);
382: return(EQN_ERR);
383: }
384:
385: eqn_rewind(ep);
386: start = eqn_nexttok(ep, &sz);
387: assert(start);
1.24 kristaps 388: if (STRNEQ(start, sz, "}", 1))
1.23 kristaps 389: return(EQN_OK);
390:
391: EQN_MSG(MANDOCERR_EQNBADSCOPE, ep);
392: return(EQN_ERR);
393: }
394:
395: static enum eqn_rest
1.20 kristaps 396: eqn_box(struct eqn_node *ep, struct eqn_box *last)
1.1 kristaps 397: {
1.12 kristaps 398: size_t sz;
399: const char *start;
1.20 kristaps 400: char *left;
1.28 kristaps 401: char sym[64];
1.20 kristaps 402: enum eqn_rest c;
403: int i, size;
1.13 kristaps 404: struct eqn_box *bp;
1.12 kristaps 405:
1.20 kristaps 406: if (NULL == (start = eqn_nexttok(ep, &sz)))
407: return(EQN_EOF);
408:
1.24 kristaps 409: if (STRNEQ(start, sz, "}", 1))
1.20 kristaps 410: return(EQN_DESCOPE);
1.24 kristaps 411: else if (STRNEQ(start, sz, "right", 5))
1.20 kristaps 412: return(EQN_DESCOPE);
1.24 kristaps 413: else if (STRNEQ(start, sz, "above", 5))
1.20 kristaps 414: return(EQN_DESCOPE);
415:
416: for (i = 0; i < (int)EQN__MAX; i++) {
1.24 kristaps 417: if ( ! EQNSTREQ(&eqnparts[i].str, start, sz))
1.20 kristaps 418: continue;
419: return((*eqnparts[i].fp)(ep) ? EQN_OK : EQN_ERR);
420: }
1.15 kristaps 421:
1.24 kristaps 422: if (STRNEQ(start, sz, "{", 1)) {
1.20 kristaps 423: if (EQN_DESCOPE != (c = eqn_eqn(ep, last))) {
424: if (EQN_ERR != c)
425: EQN_MSG(MANDOCERR_EQNSCOPE, ep);
426: return(EQN_ERR);
427: }
428: eqn_rewind(ep);
429: start = eqn_nexttok(ep, &sz);
430: assert(start);
1.24 kristaps 431: if (STRNEQ(start, sz, "}", 1))
1.20 kristaps 432: return(EQN_OK);
433: EQN_MSG(MANDOCERR_EQNBADSCOPE, ep);
434: return(EQN_ERR);
435: }
1.12 kristaps 436:
1.20 kristaps 437: for (i = 0; i < (int)EQNPILE__MAX; i++) {
1.24 kristaps 438: if ( ! EQNSTREQ(&eqnpiles[i], start, sz))
1.17 kristaps 439: continue;
1.23 kristaps 440: if (EQN_OK == (c = eqn_list(ep, last)))
1.21 kristaps 441: last->last->pile = (enum eqn_pilet)i;
1.23 kristaps 442: return(c);
1.18 kristaps 443: }
444:
1.24 kristaps 445: if (STRNEQ(start, sz, "left", 4)) {
1.20 kristaps 446: if (NULL == (start = eqn_nexttok(ep, &sz))) {
447: EQN_MSG(MANDOCERR_EQNEOF, ep);
448: return(EQN_ERR);
449: }
450: left = mandoc_strndup(start, sz);
1.26 kristaps 451: c = eqn_eqn(ep, last);
452: if (last->last)
453: last->last->left = left;
454: else
455: free(left);
456: if (EQN_DESCOPE != c)
1.20 kristaps 457: return(c);
458: assert(last->last);
459: eqn_rewind(ep);
460: start = eqn_nexttok(ep, &sz);
461: assert(start);
1.26 kristaps 462: if ( ! STRNEQ(start, sz, "right", 5))
1.20 kristaps 463: return(EQN_DESCOPE);
464: if (NULL == (start = eqn_nexttok(ep, &sz))) {
465: EQN_MSG(MANDOCERR_EQNEOF, ep);
466: return(EQN_ERR);
467: }
468: last->last->right = mandoc_strndup(start, sz);
469: return(EQN_OK);
470: }
471:
472: for (i = 0; i < (int)EQNPOS__MAX; i++) {
1.24 kristaps 473: if ( ! EQNSTREQ(&eqnposs[i], start, sz))
1.18 kristaps 474: continue;
1.20 kristaps 475: if (NULL == last->last) {
476: EQN_MSG(MANDOCERR_EQNSYNT, ep);
477: return(EQN_ERR);
478: }
479: last->last->pos = (enum eqn_post)i;
480: if (EQN_EOF == (c = eqn_box(ep, last))) {
481: EQN_MSG(MANDOCERR_EQNEOF, ep);
482: return(EQN_ERR);
483: }
484: return(c);
1.17 kristaps 485: }
486:
1.16 kristaps 487: for (i = 0; i < (int)EQNMARK__MAX; i++) {
1.24 kristaps 488: if ( ! EQNSTREQ(&eqnmarks[i], start, sz))
1.16 kristaps 489: continue;
1.20 kristaps 490: if (NULL == last->last) {
491: EQN_MSG(MANDOCERR_EQNSYNT, ep);
492: return(EQN_ERR);
493: }
494: last->last->mark = (enum eqn_markt)i;
495: if (EQN_EOF == (c = eqn_box(ep, last))) {
496: EQN_MSG(MANDOCERR_EQNEOF, ep);
497: return(EQN_ERR);
498: }
499: return(c);
1.16 kristaps 500: }
1.12 kristaps 501:
1.20 kristaps 502: for (i = 0; i < (int)EQNFONT__MAX; i++) {
1.24 kristaps 503: if ( ! EQNSTREQ(&eqnfonts[i], start, sz))
1.20 kristaps 504: continue;
505: if (EQN_EOF == (c = eqn_box(ep, last))) {
506: EQN_MSG(MANDOCERR_EQNEOF, ep);
507: return(EQN_ERR);
508: } else if (EQN_OK == c)
509: last->last->font = (enum eqn_fontt)i;
510: return(c);
1.19 kristaps 511: }
1.15 kristaps 512:
1.24 kristaps 513: if (STRNEQ(start, sz, "size", 4)) {
1.20 kristaps 514: if (NULL == (start = eqn_nexttok(ep, &sz))) {
515: EQN_MSG(MANDOCERR_EQNEOF, ep);
516: return(EQN_ERR);
517: }
518: size = mandoc_strntoi(start, sz, 10);
519: if (EQN_EOF == (c = eqn_box(ep, last))) {
520: EQN_MSG(MANDOCERR_EQNEOF, ep);
521: return(EQN_ERR);
522: } else if (EQN_OK != c)
523: return(c);
524: last->last->size = size;
1.15 kristaps 525: }
526:
1.29 kristaps 527: bp = eqn_box_alloc(ep, last);
1.15 kristaps 528: bp->type = EQN_TEXT;
1.27 kristaps 529: for (i = 0; i < (int)EQNSYM__MAX; i++)
530: if (EQNSTREQ(&eqnsyms[i].str, start, sz)) {
1.28 kristaps 531: sym[63] = '\0';
532: snprintf(sym, 62, "\\[%s]", eqnsyms[i].sym);
1.27 kristaps 533: bp->text = mandoc_strdup(sym);
534: return(EQN_OK);
535: }
536:
1.20 kristaps 537: bp->text = mandoc_strndup(start, sz);
538: return(EQN_OK);
1.1 kristaps 539: }
540:
541: void
542: eqn_free(struct eqn_node *p)
543: {
1.6 kristaps 544: int i;
1.1 kristaps 545:
1.13 kristaps 546: eqn_box_free(p->eqn.root);
1.6 kristaps 547:
548: for (i = 0; i < (int)p->defsz; i++) {
549: free(p->defs[i].key);
550: free(p->defs[i].val);
551: }
552:
1.12 kristaps 553: free(p->data);
1.6 kristaps 554: free(p->defs);
1.1 kristaps 555: free(p);
1.6 kristaps 556: }
557:
1.20 kristaps 558: static struct eqn_box *
1.29 kristaps 559: eqn_box_alloc(struct eqn_node *ep, struct eqn_box *parent)
1.20 kristaps 560: {
561: struct eqn_box *bp;
562:
563: bp = mandoc_calloc(1, sizeof(struct eqn_box));
564: bp->parent = parent;
1.29 kristaps 565: bp->size = ep->gsize;
1.20 kristaps 566:
567: if (NULL == parent->first)
568: parent->first = bp;
569: else
570: parent->last->next = bp;
571:
572: parent->last = bp;
573: return(bp);
574: }
575:
1.13 kristaps 576: static void
577: eqn_box_free(struct eqn_box *bp)
578: {
579:
1.20 kristaps 580: if (bp->first)
581: eqn_box_free(bp->first);
1.13 kristaps 582: if (bp->next)
583: eqn_box_free(bp->next);
584:
585: free(bp->text);
1.20 kristaps 586: free(bp->left);
587: free(bp->right);
1.13 kristaps 588: free(bp);
589: }
590:
1.6 kristaps 591: static const char *
1.14 kristaps 592: eqn_nextrawtok(struct eqn_node *ep, size_t *sz)
593: {
594:
595: return(eqn_next(ep, '"', sz, 0));
596: }
597:
598: static const char *
1.12 kristaps 599: eqn_nexttok(struct eqn_node *ep, size_t *sz)
600: {
601:
1.14 kristaps 602: return(eqn_next(ep, '"', sz, 1));
1.12 kristaps 603: }
604:
1.20 kristaps 605: static void
606: eqn_rewind(struct eqn_node *ep)
607: {
608:
609: ep->cur = ep->rew;
610: }
611:
1.12 kristaps 612: static const char *
1.14 kristaps 613: eqn_next(struct eqn_node *ep, char quote, size_t *sz, int repl)
1.6 kristaps 614: {
1.12 kristaps 615: char *start, *next;
616: int q, diff, lim;
1.22 kristaps 617: size_t ssz, dummy;
1.12 kristaps 618: struct eqn_def *def;
619:
620: if (NULL == sz)
1.22 kristaps 621: sz = &dummy;
1.6 kristaps 622:
1.13 kristaps 623: lim = 0;
1.20 kristaps 624: ep->rew = ep->cur;
1.13 kristaps 625: again:
626: /* Prevent self-definitions. */
627:
628: if (lim >= EQN_NEST_MAX) {
629: EQN_MSG(MANDOCERR_EQNNEST, ep);
630: return(NULL);
631: }
632:
1.20 kristaps 633: ep->cur = ep->rew;
1.12 kristaps 634: start = &ep->data[(int)ep->cur];
1.6 kristaps 635: q = 0;
636:
637: if ('\0' == *start)
638: return(NULL);
639:
1.12 kristaps 640: if (quote == *start) {
641: ep->cur++;
1.6 kristaps 642: q = 1;
643: }
644:
1.12 kristaps 645: start = &ep->data[(int)ep->cur];
1.22 kristaps 646:
647: if ( ! q) {
648: if ('{' == *start || '}' == *start)
649: ssz = 1;
650: else
1.31 ! kristaps 651: ssz = strcspn(start + 1, " ^~\"{}\t") + 1;
1.22 kristaps 652: next = start + (int)ssz;
653: if ('\0' == *next)
654: next = NULL;
655: } else
656: next = strchr(start, quote);
1.12 kristaps 657:
658: if (NULL != next) {
659: *sz = (size_t)(next - start);
660: ep->cur += *sz;
1.6 kristaps 661: if (q)
1.12 kristaps 662: ep->cur++;
1.22 kristaps 663: while (' ' == ep->data[(int)ep->cur] ||
664: '\t' == ep->data[(int)ep->cur] ||
1.31 ! kristaps 665: '^' == ep->data[(int)ep->cur] ||
1.22 kristaps 666: '~' == ep->data[(int)ep->cur])
1.12 kristaps 667: ep->cur++;
1.6 kristaps 668: } else {
669: if (q)
1.12 kristaps 670: EQN_MSG(MANDOCERR_BADQUOTE, ep);
671: next = strchr(start, '\0');
672: *sz = (size_t)(next - start);
673: ep->cur += *sz;
674: }
675:
1.13 kristaps 676: /* Quotes aren't expanded for values. */
677:
1.14 kristaps 678: if (q || ! repl)
1.13 kristaps 679: return(start);
680:
1.12 kristaps 681: if (NULL != (def = eqn_def_find(ep, start, *sz))) {
682: diff = def->valsz - *sz;
683:
684: if (def->valsz > *sz) {
685: ep->sz += diff;
686: ep->data = mandoc_realloc(ep->data, ep->sz + 1);
687: ep->data[ep->sz] = '\0';
1.20 kristaps 688: start = &ep->data[(int)ep->rew];
1.12 kristaps 689: }
690:
691: diff = def->valsz - *sz;
692: memmove(start + *sz + diff, start + *sz,
693: (strlen(start) - *sz) + 1);
694: memcpy(start, def->val, def->valsz);
695: goto again;
1.6 kristaps 696: }
697:
698: return(start);
1.8 kristaps 699: }
700:
701: static int
1.14 kristaps 702: eqn_do_set(struct eqn_node *ep)
1.8 kristaps 703: {
704: const char *start;
705:
1.14 kristaps 706: if (NULL == (start = eqn_nextrawtok(ep, NULL)))
1.29 kristaps 707: EQN_MSG(MANDOCERR_EQNEOF, ep);
1.14 kristaps 708: else if (NULL == (start = eqn_nextrawtok(ep, NULL)))
1.29 kristaps 709: EQN_MSG(MANDOCERR_EQNEOF, ep);
1.12 kristaps 710: else
711: return(1);
1.8 kristaps 712:
1.12 kristaps 713: return(0);
1.8 kristaps 714: }
715:
716: static int
1.12 kristaps 717: eqn_do_define(struct eqn_node *ep)
1.8 kristaps 718: {
719: const char *start;
720: size_t sz;
1.12 kristaps 721: struct eqn_def *def;
1.8 kristaps 722: int i;
723:
1.14 kristaps 724: if (NULL == (start = eqn_nextrawtok(ep, &sz))) {
1.29 kristaps 725: EQN_MSG(MANDOCERR_EQNEOF, ep);
1.8 kristaps 726: return(0);
727: }
728:
729: /*
730: * Search for a key that already exists.
1.12 kristaps 731: * Create a new key if none is found.
1.8 kristaps 732: */
733:
1.12 kristaps 734: if (NULL == (def = eqn_def_find(ep, start, sz))) {
1.8 kristaps 735: /* Find holes in string array. */
736: for (i = 0; i < (int)ep->defsz; i++)
737: if (0 == ep->defs[i].keysz)
738: break;
739:
740: if (i == (int)ep->defsz) {
741: ep->defsz++;
742: ep->defs = mandoc_realloc
743: (ep->defs, ep->defsz *
744: sizeof(struct eqn_def));
1.9 kristaps 745: ep->defs[i].key = ep->defs[i].val = NULL;
1.8 kristaps 746: }
747:
748: ep->defs[i].keysz = sz;
749: ep->defs[i].key = mandoc_realloc
750: (ep->defs[i].key, sz + 1);
751:
752: memcpy(ep->defs[i].key, start, sz);
753: ep->defs[i].key[(int)sz] = '\0';
1.12 kristaps 754: def = &ep->defs[i];
1.8 kristaps 755: }
756:
1.14 kristaps 757: start = eqn_next(ep, ep->data[(int)ep->cur], &sz, 0);
1.8 kristaps 758:
1.12 kristaps 759: if (NULL == start) {
1.29 kristaps 760: EQN_MSG(MANDOCERR_EQNEOF, ep);
1.8 kristaps 761: return(0);
762: }
763:
1.12 kristaps 764: def->valsz = sz;
1.13 kristaps 765: def->val = mandoc_realloc(def->val, sz + 1);
1.12 kristaps 766: memcpy(def->val, start, sz);
767: def->val[(int)sz] = '\0';
1.30 kristaps 768: return(1);
769: }
770:
771: static int
772: eqn_do_gfont(struct eqn_node *ep)
773: {
774: const char *start;
775:
776: if (NULL == (start = eqn_nextrawtok(ep, NULL))) {
777: EQN_MSG(MANDOCERR_EQNEOF, ep);
778: return(0);
779: }
1.12 kristaps 780: return(1);
1.8 kristaps 781: }
782:
783: static int
1.29 kristaps 784: eqn_do_gsize(struct eqn_node *ep)
785: {
786: const char *start;
787: size_t sz;
788:
789: if (NULL == (start = eqn_nextrawtok(ep, &sz))) {
790: EQN_MSG(MANDOCERR_EQNEOF, ep);
791: return(0);
792: }
793:
794: ep->gsize = mandoc_strntoi(start, sz, 10);
795: return(1);
796: }
797:
798: static int
1.12 kristaps 799: eqn_do_undef(struct eqn_node *ep)
1.8 kristaps 800: {
801: const char *start;
1.12 kristaps 802: struct eqn_def *def;
1.8 kristaps 803: size_t sz;
804:
1.14 kristaps 805: if (NULL == (start = eqn_nextrawtok(ep, &sz))) {
1.29 kristaps 806: EQN_MSG(MANDOCERR_EQNEOF, ep);
1.12 kristaps 807: return(0);
808: } else if (NULL != (def = eqn_def_find(ep, start, sz)))
809: def->keysz = 0;
1.8 kristaps 810:
1.12 kristaps 811: return(1);
812: }
813:
814: static struct eqn_def *
815: eqn_def_find(struct eqn_node *ep, const char *key, size_t sz)
816: {
817: int i;
1.8 kristaps 818:
1.12 kristaps 819: for (i = 0; i < (int)ep->defsz; i++)
1.24 kristaps 820: if (ep->defs[i].keysz && STRNEQ(ep->defs[i].key,
821: ep->defs[i].keysz, key, sz))
1.12 kristaps 822: return(&ep->defs[i]);
1.8 kristaps 823:
1.12 kristaps 824: return(NULL);
1.1 kristaps 825: }
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