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