version 1.15, 2011/07/21 12:30:44 |
version 1.44, 2014/07/06 19:09:00 |
|
|
#endif |
#endif |
|
|
#include <assert.h> |
#include <assert.h> |
|
#include <limits.h> |
#include <stdio.h> |
#include <stdio.h> |
#include <stdlib.h> |
#include <stdlib.h> |
#include <string.h> |
#include <string.h> |
#include <time.h> |
#include <time.h> |
|
|
#include "mandoc.h" |
#include "mandoc.h" |
|
#include "mandoc_aux.h" |
#include "libmandoc.h" |
#include "libmandoc.h" |
#include "libroff.h" |
#include "libroff.h" |
|
|
#define EQN_NEST_MAX 128 /* maximum nesting of defines */ |
#define EQN_NEST_MAX 128 /* maximum nesting of defines */ |
#define EQN_MSG(t, x) mandoc_msg((t), (x)->parse, (x)->eqn.ln, (x)->eqn.pos, NULL) |
#define EQN_MSG(t, x) mandoc_msg((t), (x)->parse, (x)->eqn.ln, (x)->eqn.pos, NULL) |
|
|
struct eqnpart { |
enum eqn_rest { |
const char *name; |
EQN_DESCOPE, |
size_t sz; |
EQN_ERR, |
int (*fp)(struct eqn_node *); |
EQN_OK, |
|
EQN_EOF |
}; |
}; |
|
|
|
enum eqn_symt { |
|
EQNSYM_alpha, |
|
EQNSYM_beta, |
|
EQNSYM_chi, |
|
EQNSYM_delta, |
|
EQNSYM_epsilon, |
|
EQNSYM_eta, |
|
EQNSYM_gamma, |
|
EQNSYM_iota, |
|
EQNSYM_kappa, |
|
EQNSYM_lambda, |
|
EQNSYM_mu, |
|
EQNSYM_nu, |
|
EQNSYM_omega, |
|
EQNSYM_omicron, |
|
EQNSYM_phi, |
|
EQNSYM_pi, |
|
EQNSYM_ps, |
|
EQNSYM_rho, |
|
EQNSYM_sigma, |
|
EQNSYM_tau, |
|
EQNSYM_theta, |
|
EQNSYM_upsilon, |
|
EQNSYM_xi, |
|
EQNSYM_zeta, |
|
EQNSYM_DELTA, |
|
EQNSYM_GAMMA, |
|
EQNSYM_LAMBDA, |
|
EQNSYM_OMEGA, |
|
EQNSYM_PHI, |
|
EQNSYM_PI, |
|
EQNSYM_PSI, |
|
EQNSYM_SIGMA, |
|
EQNSYM_THETA, |
|
EQNSYM_UPSILON, |
|
EQNSYM_XI, |
|
EQNSYM_inter, |
|
EQNSYM_union, |
|
EQNSYM_prod, |
|
EQNSYM_int, |
|
EQNSYM_sum, |
|
EQNSYM_grad, |
|
EQNSYM_del, |
|
EQNSYM_times, |
|
EQNSYM_cdot, |
|
EQNSYM_nothing, |
|
EQNSYM_approx, |
|
EQNSYM_prime, |
|
EQNSYM_half, |
|
EQNSYM_partial, |
|
EQNSYM_inf, |
|
EQNSYM_muchgreat, |
|
EQNSYM_muchless, |
|
EQNSYM_larrow, |
|
EQNSYM_rarrow, |
|
EQNSYM_pm, |
|
EQNSYM_nequal, |
|
EQNSYM_equiv, |
|
EQNSYM_lessequal, |
|
EQNSYM_moreequal, |
|
EQNSYM__MAX |
|
}; |
|
|
enum eqnpartt { |
enum eqnpartt { |
EQN_DEFINE = 0, |
EQN_DEFINE = 0, |
|
EQN_NDEFINE, |
|
EQN_TDEFINE, |
EQN_SET, |
EQN_SET, |
EQN_UNDEF, |
EQN_UNDEF, |
|
EQN_GFONT, |
|
EQN_GSIZE, |
|
EQN_BACK, |
|
EQN_FWD, |
|
EQN_UP, |
|
EQN_DOWN, |
EQN__MAX |
EQN__MAX |
}; |
}; |
|
|
|
struct eqnstr { |
|
const char *name; |
|
size_t sz; |
|
}; |
|
|
|
#define STRNEQ(p1, sz1, p2, sz2) \ |
|
((sz1) == (sz2) && 0 == strncmp((p1), (p2), (sz1))) |
|
#define EQNSTREQ(x, p, sz) \ |
|
STRNEQ((x)->name, (x)->sz, (p), (sz)) |
|
|
|
struct eqnpart { |
|
struct eqnstr str; |
|
int (*fp)(struct eqn_node *); |
|
}; |
|
|
|
struct eqnsym { |
|
struct eqnstr str; |
|
const char *sym; |
|
}; |
|
|
|
static enum eqn_rest eqn_box(struct eqn_node *, struct eqn_box *); |
|
static struct eqn_box *eqn_box_alloc(struct eqn_node *, |
|
struct eqn_box *); |
static void eqn_box_free(struct eqn_box *); |
static void eqn_box_free(struct eqn_box *); |
static struct eqn_def *eqn_def_find(struct eqn_node *, |
static struct eqn_def *eqn_def_find(struct eqn_node *, |
const char *, size_t); |
const char *, size_t); |
|
static int eqn_do_gfont(struct eqn_node *); |
|
static int eqn_do_gsize(struct eqn_node *); |
static int eqn_do_define(struct eqn_node *); |
static int eqn_do_define(struct eqn_node *); |
static int eqn_do_set(struct eqn_node *); |
static int eqn_do_ign1(struct eqn_node *); |
|
static int eqn_do_ign2(struct eqn_node *); |
|
static int eqn_do_tdefine(struct eqn_node *); |
static int eqn_do_undef(struct eqn_node *); |
static int eqn_do_undef(struct eqn_node *); |
|
static enum eqn_rest eqn_eqn(struct eqn_node *, struct eqn_box *); |
|
static enum eqn_rest eqn_list(struct eqn_node *, struct eqn_box *); |
|
static enum eqn_rest eqn_matrix(struct eqn_node *, struct eqn_box *); |
static const char *eqn_nexttok(struct eqn_node *, size_t *); |
static const char *eqn_nexttok(struct eqn_node *, size_t *); |
static const char *eqn_nextrawtok(struct eqn_node *, size_t *); |
static const char *eqn_nextrawtok(struct eqn_node *, size_t *); |
static const char *eqn_next(struct eqn_node *, |
static const char *eqn_next(struct eqn_node *, |
char, size_t *, int); |
char, size_t *, int); |
static int eqn_box(struct eqn_node *, |
static void eqn_rewind(struct eqn_node *); |
struct eqn_box *, struct eqn_box **); |
|
|
|
static const struct eqnpart eqnparts[EQN__MAX] = { |
static const struct eqnpart eqnparts[EQN__MAX] = { |
{ "define", 6, eqn_do_define }, /* EQN_DEFINE */ |
{ { "define", 6 }, eqn_do_define }, /* EQN_DEFINE */ |
{ "set", 3, eqn_do_set }, /* EQN_SET */ |
{ { "ndefine", 7 }, eqn_do_define }, /* EQN_NDEFINE */ |
{ "undef", 5, eqn_do_undef }, /* EQN_UNDEF */ |
{ { "tdefine", 7 }, eqn_do_tdefine }, /* EQN_TDEFINE */ |
|
{ { "set", 3 }, eqn_do_ign2 }, /* EQN_SET */ |
|
{ { "undef", 5 }, eqn_do_undef }, /* EQN_UNDEF */ |
|
{ { "gfont", 5 }, eqn_do_gfont }, /* EQN_GFONT */ |
|
{ { "gsize", 5 }, eqn_do_gsize }, /* EQN_GSIZE */ |
|
{ { "back", 4 }, eqn_do_ign1 }, /* EQN_BACK */ |
|
{ { "fwd", 3 }, eqn_do_ign1 }, /* EQN_FWD */ |
|
{ { "up", 2 }, eqn_do_ign1 }, /* EQN_UP */ |
|
{ { "down", 4 }, eqn_do_ign1 }, /* EQN_DOWN */ |
}; |
}; |
|
|
/* ARGSUSED */ |
static const struct eqnstr eqnmarks[EQNMARK__MAX] = { |
|
{ "", 0 }, /* EQNMARK_NONE */ |
|
{ "dot", 3 }, /* EQNMARK_DOT */ |
|
{ "dotdot", 6 }, /* EQNMARK_DOTDOT */ |
|
{ "hat", 3 }, /* EQNMARK_HAT */ |
|
{ "tilde", 5 }, /* EQNMARK_TILDE */ |
|
{ "vec", 3 }, /* EQNMARK_VEC */ |
|
{ "dyad", 4 }, /* EQNMARK_DYAD */ |
|
{ "bar", 3 }, /* EQNMARK_BAR */ |
|
{ "under", 5 }, /* EQNMARK_UNDER */ |
|
}; |
|
|
|
static const struct eqnstr eqnfonts[EQNFONT__MAX] = { |
|
{ "", 0 }, /* EQNFONT_NONE */ |
|
{ "roman", 5 }, /* EQNFONT_ROMAN */ |
|
{ "bold", 4 }, /* EQNFONT_BOLD */ |
|
{ "fat", 3 }, /* EQNFONT_FAT */ |
|
{ "italic", 6 }, /* EQNFONT_ITALIC */ |
|
}; |
|
|
|
static const struct eqnstr eqnposs[EQNPOS__MAX] = { |
|
{ "", 0 }, /* EQNPOS_NONE */ |
|
{ "over", 4 }, /* EQNPOS_OVER */ |
|
{ "sup", 3 }, /* EQNPOS_SUP */ |
|
{ "sub", 3 }, /* EQNPOS_SUB */ |
|
{ "to", 2 }, /* EQNPOS_TO */ |
|
{ "from", 4 }, /* EQNPOS_FROM */ |
|
}; |
|
|
|
static const struct eqnstr eqnpiles[EQNPILE__MAX] = { |
|
{ "", 0 }, /* EQNPILE_NONE */ |
|
{ "pile", 4 }, /* EQNPILE_PILE */ |
|
{ "cpile", 5 }, /* EQNPILE_CPILE */ |
|
{ "rpile", 5 }, /* EQNPILE_RPILE */ |
|
{ "lpile", 5 }, /* EQNPILE_LPILE */ |
|
{ "col", 3 }, /* EQNPILE_COL */ |
|
{ "ccol", 4 }, /* EQNPILE_CCOL */ |
|
{ "rcol", 4 }, /* EQNPILE_RCOL */ |
|
{ "lcol", 4 }, /* EQNPILE_LCOL */ |
|
}; |
|
|
|
static const struct eqnsym eqnsyms[EQNSYM__MAX] = { |
|
{ { "alpha", 5 }, "*a" }, /* EQNSYM_alpha */ |
|
{ { "beta", 4 }, "*b" }, /* EQNSYM_beta */ |
|
{ { "chi", 3 }, "*x" }, /* EQNSYM_chi */ |
|
{ { "delta", 5 }, "*d" }, /* EQNSYM_delta */ |
|
{ { "epsilon", 7 }, "*e" }, /* EQNSYM_epsilon */ |
|
{ { "eta", 3 }, "*y" }, /* EQNSYM_eta */ |
|
{ { "gamma", 5 }, "*g" }, /* EQNSYM_gamma */ |
|
{ { "iota", 4 }, "*i" }, /* EQNSYM_iota */ |
|
{ { "kappa", 5 }, "*k" }, /* EQNSYM_kappa */ |
|
{ { "lambda", 6 }, "*l" }, /* EQNSYM_lambda */ |
|
{ { "mu", 2 }, "*m" }, /* EQNSYM_mu */ |
|
{ { "nu", 2 }, "*n" }, /* EQNSYM_nu */ |
|
{ { "omega", 5 }, "*w" }, /* EQNSYM_omega */ |
|
{ { "omicron", 7 }, "*o" }, /* EQNSYM_omicron */ |
|
{ { "phi", 3 }, "*f" }, /* EQNSYM_phi */ |
|
{ { "pi", 2 }, "*p" }, /* EQNSYM_pi */ |
|
{ { "psi", 2 }, "*q" }, /* EQNSYM_psi */ |
|
{ { "rho", 3 }, "*r" }, /* EQNSYM_rho */ |
|
{ { "sigma", 5 }, "*s" }, /* EQNSYM_sigma */ |
|
{ { "tau", 3 }, "*t" }, /* EQNSYM_tau */ |
|
{ { "theta", 5 }, "*h" }, /* EQNSYM_theta */ |
|
{ { "upsilon", 7 }, "*u" }, /* EQNSYM_upsilon */ |
|
{ { "xi", 2 }, "*c" }, /* EQNSYM_xi */ |
|
{ { "zeta", 4 }, "*z" }, /* EQNSYM_zeta */ |
|
{ { "DELTA", 5 }, "*D" }, /* EQNSYM_DELTA */ |
|
{ { "GAMMA", 5 }, "*G" }, /* EQNSYM_GAMMA */ |
|
{ { "LAMBDA", 6 }, "*L" }, /* EQNSYM_LAMBDA */ |
|
{ { "OMEGA", 5 }, "*W" }, /* EQNSYM_OMEGA */ |
|
{ { "PHI", 3 }, "*F" }, /* EQNSYM_PHI */ |
|
{ { "PI", 2 }, "*P" }, /* EQNSYM_PI */ |
|
{ { "PSI", 3 }, "*Q" }, /* EQNSYM_PSI */ |
|
{ { "SIGMA", 5 }, "*S" }, /* EQNSYM_SIGMA */ |
|
{ { "THETA", 5 }, "*H" }, /* EQNSYM_THETA */ |
|
{ { "UPSILON", 7 }, "*U" }, /* EQNSYM_UPSILON */ |
|
{ { "XI", 2 }, "*C" }, /* EQNSYM_XI */ |
|
{ { "inter", 5 }, "ca" }, /* EQNSYM_inter */ |
|
{ { "union", 5 }, "cu" }, /* EQNSYM_union */ |
|
{ { "prod", 4 }, "product" }, /* EQNSYM_prod */ |
|
{ { "int", 3 }, "integral" }, /* EQNSYM_int */ |
|
{ { "sum", 3 }, "sum" }, /* EQNSYM_sum */ |
|
{ { "grad", 4 }, "gr" }, /* EQNSYM_grad */ |
|
{ { "del", 3 }, "gr" }, /* EQNSYM_del */ |
|
{ { "times", 5 }, "mu" }, /* EQNSYM_times */ |
|
{ { "cdot", 4 }, "pc" }, /* EQNSYM_cdot */ |
|
{ { "nothing", 7 }, "&" }, /* EQNSYM_nothing */ |
|
{ { "approx", 6 }, "~~" }, /* EQNSYM_approx */ |
|
{ { "prime", 5 }, "aq" }, /* EQNSYM_prime */ |
|
{ { "half", 4 }, "12" }, /* EQNSYM_half */ |
|
{ { "partial", 7 }, "pd" }, /* EQNSYM_partial */ |
|
{ { "inf", 3 }, "if" }, /* EQNSYM_inf */ |
|
{ { ">>", 2 }, ">>" }, /* EQNSYM_muchgreat */ |
|
{ { "<<", 2 }, "<<" }, /* EQNSYM_muchless */ |
|
{ { "<-", 2 }, "<-" }, /* EQNSYM_larrow */ |
|
{ { "->", 2 }, "->" }, /* EQNSYM_rarrow */ |
|
{ { "+-", 2 }, "+-" }, /* EQNSYM_pm */ |
|
{ { "!=", 2 }, "!=" }, /* EQNSYM_nequal */ |
|
{ { "==", 2 }, "==" }, /* EQNSYM_equiv */ |
|
{ { "<=", 2 }, "<=" }, /* EQNSYM_lessequal */ |
|
{ { ">=", 2 }, ">=" }, /* EQNSYM_moreequal */ |
|
}; |
|
|
|
|
enum rofferr |
enum rofferr |
eqn_read(struct eqn_node **epp, int ln, |
eqn_read(struct eqn_node **epp, int ln, |
const char *p, int pos, int *offs) |
const char *p, int pos, int *offs) |
{ |
{ |
size_t sz; |
size_t sz; |
Line 79 eqn_read(struct eqn_node **epp, int ln, |
|
Line 293 eqn_read(struct eqn_node **epp, int ln, |
|
* validate the full equation. |
* validate the full equation. |
*/ |
*/ |
|
|
if (0 == strcmp(p, ".EN")) { |
if (0 == strncmp(p, ".EN", 3)) { |
er = eqn_end(ep); |
er = eqn_end(epp); |
*epp = NULL; |
p += 3; |
|
while (' ' == *p || '\t' == *p) |
|
p++; |
|
if ('\0' == *p) |
|
return(er); |
|
mandoc_vmsg(MANDOCERR_ARG_SKIP, ep->parse, |
|
ln, pos, "EN %s", p); |
return(er); |
return(er); |
} |
} |
|
|
Line 105 eqn_read(struct eqn_node **epp, int ln, |
|
Line 325 eqn_read(struct eqn_node **epp, int ln, |
|
} |
} |
|
|
struct eqn_node * |
struct eqn_node * |
eqn_alloc(int pos, int line, struct mparse *parse) |
eqn_alloc(const char *name, int pos, int line, struct mparse *parse) |
{ |
{ |
struct eqn_node *p; |
struct eqn_node *p; |
|
size_t sz; |
|
const char *end; |
|
|
p = mandoc_calloc(1, sizeof(struct eqn_node)); |
p = mandoc_calloc(1, sizeof(struct eqn_node)); |
|
|
|
if (name && '\0' != *name) { |
|
sz = strlen(name); |
|
assert(sz); |
|
do { |
|
sz--; |
|
end = name + (int)sz; |
|
} while (' ' == *end || '\t' == *end); |
|
p->eqn.name = mandoc_strndup(name, sz + 1); |
|
} |
|
|
p->parse = parse; |
p->parse = parse; |
p->eqn.ln = line; |
p->eqn.ln = line; |
p->eqn.pos = pos; |
p->eqn.pos = pos; |
|
p->gsize = EQN_DEFSIZE; |
|
|
return(p); |
return(p); |
} |
} |
|
|
enum rofferr |
enum rofferr |
eqn_end(struct eqn_node *ep) |
eqn_end(struct eqn_node **epp) |
{ |
{ |
struct eqn_box *root, *last; |
struct eqn_node *ep; |
int c; |
struct eqn_box *root; |
|
enum eqn_rest c; |
|
|
ep->eqn.root = root = |
ep = *epp; |
mandoc_calloc(1, sizeof(struct eqn_box)); |
*epp = NULL; |
|
|
|
ep->eqn.root = mandoc_calloc(1, sizeof(struct eqn_box)); |
|
|
|
root = ep->eqn.root; |
root->type = EQN_ROOT; |
root->type = EQN_ROOT; |
|
|
if (0 == ep->sz) |
if (0 == ep->sz) |
return(ROFF_IGN); |
return(ROFF_IGN); |
|
|
/* |
if (EQN_DESCOPE == (c = eqn_eqn(ep, root))) { |
* Run the parser. |
|
* If we return before reaching the end of our input, our scope |
|
* is still open somewhere. |
|
* If we return alright but don't have a symmetric scoping, then |
|
* something's not right either. |
|
* Otherwise, return the equation. |
|
*/ |
|
|
|
if ((c = eqn_box(ep, root, &last)) > 0) { |
|
EQN_MSG(MANDOCERR_EQNNSCOPE, ep); |
EQN_MSG(MANDOCERR_EQNNSCOPE, ep); |
c = 0; |
c = EQN_ERR; |
} else if (0 == c && last != root) |
} |
EQN_MSG(MANDOCERR_EQNSCOPE, ep); |
|
|
|
return(1 == c ? ROFF_EQN : ROFF_IGN); |
return(EQN_EOF == c ? ROFF_EQN : ROFF_IGN); |
} |
} |
|
|
static int |
static enum eqn_rest |
eqn_box(struct eqn_node *ep, struct eqn_box *last, struct eqn_box **sv) |
eqn_eqn(struct eqn_node *ep, struct eqn_box *last) |
{ |
{ |
size_t sz; |
struct eqn_box *bp; |
|
enum eqn_rest c; |
|
|
|
bp = eqn_box_alloc(ep, last); |
|
bp->type = EQN_SUBEXPR; |
|
|
|
while (EQN_OK == (c = eqn_box(ep, bp))) |
|
/* Spin! */ ; |
|
|
|
return(c); |
|
} |
|
|
|
static enum eqn_rest |
|
eqn_matrix(struct eqn_node *ep, struct eqn_box *last) |
|
{ |
|
struct eqn_box *bp; |
const char *start; |
const char *start; |
int c, i, nextc; |
size_t sz; |
|
enum eqn_rest c; |
|
|
|
bp = eqn_box_alloc(ep, last); |
|
bp->type = EQN_MATRIX; |
|
|
|
if (NULL == (start = eqn_nexttok(ep, &sz))) { |
|
EQN_MSG(MANDOCERR_EQNEOF, ep); |
|
return(EQN_ERR); |
|
} |
|
if ( ! STRNEQ(start, sz, "{", 1)) { |
|
EQN_MSG(MANDOCERR_EQNSYNT, ep); |
|
return(EQN_ERR); |
|
} |
|
|
|
while (EQN_OK == (c = eqn_box(ep, bp))) |
|
switch (bp->last->pile) { |
|
case EQNPILE_LCOL: |
|
/* FALLTHROUGH */ |
|
case EQNPILE_CCOL: |
|
/* FALLTHROUGH */ |
|
case EQNPILE_RCOL: |
|
continue; |
|
default: |
|
EQN_MSG(MANDOCERR_EQNSYNT, ep); |
|
return(EQN_ERR); |
|
}; |
|
|
|
if (EQN_DESCOPE != c) { |
|
if (EQN_EOF == c) |
|
EQN_MSG(MANDOCERR_EQNEOF, ep); |
|
return(EQN_ERR); |
|
} |
|
|
|
eqn_rewind(ep); |
|
start = eqn_nexttok(ep, &sz); |
|
assert(start); |
|
if (STRNEQ(start, sz, "}", 1)) |
|
return(EQN_OK); |
|
|
|
EQN_MSG(MANDOCERR_EQNBADSCOPE, ep); |
|
return(EQN_ERR); |
|
} |
|
|
|
static enum eqn_rest |
|
eqn_list(struct eqn_node *ep, struct eqn_box *last) |
|
{ |
struct eqn_box *bp; |
struct eqn_box *bp; |
|
const char *start; |
|
size_t sz; |
|
enum eqn_rest c; |
|
|
/* |
bp = eqn_box_alloc(ep, last); |
* Mark our last level of subexpression. |
bp->type = EQN_LIST; |
* Also mark whether that the next node should be a |
|
* subexpression node. |
|
*/ |
|
|
|
*sv = last; |
if (NULL == (start = eqn_nexttok(ep, &sz))) { |
nextc = 1; |
EQN_MSG(MANDOCERR_EQNEOF, ep); |
again: |
return(EQN_ERR); |
|
} |
|
if ( ! STRNEQ(start, sz, "{", 1)) { |
|
EQN_MSG(MANDOCERR_EQNSYNT, ep); |
|
return(EQN_ERR); |
|
} |
|
|
|
while (EQN_DESCOPE == (c = eqn_eqn(ep, bp))) { |
|
eqn_rewind(ep); |
|
start = eqn_nexttok(ep, &sz); |
|
assert(start); |
|
if ( ! STRNEQ(start, sz, "above", 5)) |
|
break; |
|
} |
|
|
|
if (EQN_DESCOPE != c) { |
|
if (EQN_ERR != c) |
|
EQN_MSG(MANDOCERR_EQNSCOPE, ep); |
|
return(EQN_ERR); |
|
} |
|
|
|
eqn_rewind(ep); |
|
start = eqn_nexttok(ep, &sz); |
|
assert(start); |
|
if (STRNEQ(start, sz, "}", 1)) |
|
return(EQN_OK); |
|
|
|
EQN_MSG(MANDOCERR_EQNBADSCOPE, ep); |
|
return(EQN_ERR); |
|
} |
|
|
|
static enum eqn_rest |
|
eqn_box(struct eqn_node *ep, struct eqn_box *last) |
|
{ |
|
size_t sz; |
|
const char *start; |
|
char *left; |
|
char sym[64]; |
|
enum eqn_rest c; |
|
int i, size; |
|
struct eqn_box *bp; |
|
|
if (NULL == (start = eqn_nexttok(ep, &sz))) |
if (NULL == (start = eqn_nexttok(ep, &sz))) |
return(0); |
return(EQN_EOF); |
|
|
|
if (STRNEQ(start, sz, "}", 1)) |
|
return(EQN_DESCOPE); |
|
else if (STRNEQ(start, sz, "right", 5)) |
|
return(EQN_DESCOPE); |
|
else if (STRNEQ(start, sz, "above", 5)) |
|
return(EQN_DESCOPE); |
|
else if (STRNEQ(start, sz, "mark", 4)) |
|
return(EQN_OK); |
|
else if (STRNEQ(start, sz, "lineup", 6)) |
|
return(EQN_OK); |
|
|
for (i = 0; i < (int)EQN__MAX; i++) { |
for (i = 0; i < (int)EQN__MAX; i++) { |
if (eqnparts[i].sz != sz) |
if ( ! EQNSTREQ(&eqnparts[i].str, start, sz)) |
continue; |
continue; |
if (strncmp(eqnparts[i].name, start, sz)) |
return((*eqnparts[i].fp)(ep) ? EQN_OK : EQN_ERR); |
continue; |
} |
if ( ! (*eqnparts[i].fp)(ep)) |
|
return(-1); |
|
|
|
goto again; |
if (STRNEQ(start, sz, "{", 1)) { |
} |
if (EQN_DESCOPE != (c = eqn_eqn(ep, last))) { |
|
if (EQN_ERR != c) |
|
EQN_MSG(MANDOCERR_EQNSCOPE, ep); |
|
return(EQN_ERR); |
|
} |
|
eqn_rewind(ep); |
|
start = eqn_nexttok(ep, &sz); |
|
assert(start); |
|
if (STRNEQ(start, sz, "}", 1)) |
|
return(EQN_OK); |
|
EQN_MSG(MANDOCERR_EQNBADSCOPE, ep); |
|
return(EQN_ERR); |
|
} |
|
|
/* Exit this [hopefully] subexpression. */ |
for (i = 0; i < (int)EQNPILE__MAX; i++) { |
|
if ( ! EQNSTREQ(&eqnpiles[i], start, sz)) |
|
continue; |
|
if (EQN_OK == (c = eqn_list(ep, last))) |
|
last->last->pile = (enum eqn_pilet)i; |
|
return(c); |
|
} |
|
|
if (sz == 1 && 0 == strncmp("}", start, 1)) |
if (STRNEQ(start, sz, "matrix", 6)) |
return(1); |
return(eqn_matrix(ep, last)); |
|
|
bp = mandoc_calloc(1, sizeof(struct eqn_box)); |
if (STRNEQ(start, sz, "left", 4)) { |
if (nextc) |
if (NULL == (start = eqn_nexttok(ep, &sz))) { |
last->child = bp; |
EQN_MSG(MANDOCERR_EQNEOF, ep); |
else |
return(EQN_ERR); |
last->next = bp; |
} |
|
left = mandoc_strndup(start, sz); |
|
c = eqn_eqn(ep, last); |
|
if (last->last) |
|
last->last->left = left; |
|
else |
|
free(left); |
|
if (EQN_DESCOPE != c) |
|
return(c); |
|
assert(last->last); |
|
eqn_rewind(ep); |
|
start = eqn_nexttok(ep, &sz); |
|
assert(start); |
|
if ( ! STRNEQ(start, sz, "right", 5)) |
|
return(EQN_DESCOPE); |
|
if (NULL == (start = eqn_nexttok(ep, &sz))) { |
|
EQN_MSG(MANDOCERR_EQNEOF, ep); |
|
return(EQN_ERR); |
|
} |
|
last->last->right = mandoc_strndup(start, sz); |
|
return(EQN_OK); |
|
} |
|
|
last = bp; |
for (i = 0; i < (int)EQNPOS__MAX; i++) { |
|
if ( ! EQNSTREQ(&eqnposs[i], start, sz)) |
|
continue; |
|
if (NULL == last->last) { |
|
EQN_MSG(MANDOCERR_EQNSYNT, ep); |
|
return(EQN_ERR); |
|
} |
|
last->last->pos = (enum eqn_post)i; |
|
if (EQN_EOF == (c = eqn_box(ep, last))) { |
|
EQN_MSG(MANDOCERR_EQNEOF, ep); |
|
return(EQN_ERR); |
|
} |
|
return(c); |
|
} |
|
|
/* |
for (i = 0; i < (int)EQNMARK__MAX; i++) { |
* See if we're to open a new subexpression. |
if ( ! EQNSTREQ(&eqnmarks[i], start, sz)) |
* If so, mark our node as such and descend. |
continue; |
*/ |
if (NULL == last->last) { |
|
EQN_MSG(MANDOCERR_EQNSYNT, ep); |
|
return(EQN_ERR); |
|
} |
|
last->last->mark = (enum eqn_markt)i; |
|
if (EQN_EOF == (c = eqn_box(ep, last))) { |
|
EQN_MSG(MANDOCERR_EQNEOF, ep); |
|
return(EQN_ERR); |
|
} |
|
return(c); |
|
} |
|
|
if (sz == 1 && 0 == strncmp("{", start, 1)) { |
for (i = 0; i < (int)EQNFONT__MAX; i++) { |
bp->type = EQN_SUBEXPR; |
if ( ! EQNSTREQ(&eqnfonts[i], start, sz)) |
c = eqn_box(ep, bp, sv); |
continue; |
|
if (EQN_EOF == (c = eqn_box(ep, last))) { |
|
EQN_MSG(MANDOCERR_EQNEOF, ep); |
|
return(EQN_ERR); |
|
} else if (EQN_OK == c) |
|
last->last->font = (enum eqn_fontt)i; |
|
return(c); |
|
} |
|
|
nextc = 0; |
if (STRNEQ(start, sz, "size", 4)) { |
goto again; |
if (NULL == (start = eqn_nexttok(ep, &sz))) { |
|
EQN_MSG(MANDOCERR_EQNEOF, ep); |
|
return(EQN_ERR); |
|
} |
|
size = mandoc_strntoi(start, sz, 10); |
|
if (EQN_EOF == (c = eqn_box(ep, last))) { |
|
EQN_MSG(MANDOCERR_EQNEOF, ep); |
|
return(EQN_ERR); |
|
} else if (EQN_OK != c) |
|
return(c); |
|
last->last->size = size; |
} |
} |
|
|
/* A regular text node. */ |
bp = eqn_box_alloc(ep, last); |
|
|
bp->type = EQN_TEXT; |
bp->type = EQN_TEXT; |
bp->text = mandoc_malloc(sz + 1); |
for (i = 0; i < (int)EQNSYM__MAX; i++) |
*bp->text = '\0'; |
if (EQNSTREQ(&eqnsyms[i].str, start, sz)) { |
strlcat(bp->text, start, sz + 1); |
sym[63] = '\0'; |
|
(void)snprintf(sym, 62, "\\[%s]", eqnsyms[i].sym); |
|
bp->text = mandoc_strdup(sym); |
|
return(EQN_OK); |
|
} |
|
|
nextc = 0; |
bp->text = mandoc_strndup(start, sz); |
goto again; |
return(EQN_OK); |
} |
} |
|
|
void |
void |
Line 228 eqn_free(struct eqn_node *p) |
|
Line 650 eqn_free(struct eqn_node *p) |
|
free(p->defs[i].val); |
free(p->defs[i].val); |
} |
} |
|
|
|
free(p->eqn.name); |
free(p->data); |
free(p->data); |
free(p->defs); |
free(p->defs); |
free(p); |
free(p); |
} |
} |
|
|
|
static struct eqn_box * |
|
eqn_box_alloc(struct eqn_node *ep, struct eqn_box *parent) |
|
{ |
|
struct eqn_box *bp; |
|
|
|
bp = mandoc_calloc(1, sizeof(struct eqn_box)); |
|
bp->parent = parent; |
|
bp->size = ep->gsize; |
|
|
|
if (NULL == parent->first) |
|
parent->first = bp; |
|
else |
|
parent->last->next = bp; |
|
|
|
parent->last = bp; |
|
return(bp); |
|
} |
|
|
static void |
static void |
eqn_box_free(struct eqn_box *bp) |
eqn_box_free(struct eqn_box *bp) |
{ |
{ |
|
|
if (bp->child) |
if (bp->first) |
eqn_box_free(bp->child); |
eqn_box_free(bp->first); |
if (bp->next) |
if (bp->next) |
eqn_box_free(bp->next); |
eqn_box_free(bp->next); |
|
|
free(bp->text); |
free(bp->text); |
|
free(bp->left); |
|
free(bp->right); |
free(bp); |
free(bp); |
} |
} |
|
|
Line 260 eqn_nexttok(struct eqn_node *ep, size_t *sz) |
|
Line 703 eqn_nexttok(struct eqn_node *ep, size_t *sz) |
|
return(eqn_next(ep, '"', sz, 1)); |
return(eqn_next(ep, '"', sz, 1)); |
} |
} |
|
|
|
static void |
|
eqn_rewind(struct eqn_node *ep) |
|
{ |
|
|
|
ep->cur = ep->rew; |
|
} |
|
|
static const char * |
static const char * |
eqn_next(struct eqn_node *ep, char quote, size_t *sz, int repl) |
eqn_next(struct eqn_node *ep, char quote, size_t *sz, int repl) |
{ |
{ |
char *start, *next; |
char *start, *next; |
int q, diff, lim; |
int q, diff, lim; |
size_t sv, ssz; |
size_t ssz, dummy; |
struct eqn_def *def; |
struct eqn_def *def; |
|
|
if (NULL == sz) |
if (NULL == sz) |
sz = &ssz; |
sz = &dummy; |
|
|
lim = 0; |
lim = 0; |
sv = ep->cur; |
ep->rew = ep->cur; |
again: |
again: |
/* Prevent self-definitions. */ |
/* Prevent self-definitions. */ |
|
|
if (lim >= EQN_NEST_MAX) { |
if (lim >= EQN_NEST_MAX) { |
EQN_MSG(MANDOCERR_EQNNEST, ep); |
EQN_MSG(MANDOCERR_ROFFLOOP, ep); |
return(NULL); |
return(NULL); |
} |
} |
|
|
ep->cur = sv; |
ep->cur = ep->rew; |
start = &ep->data[(int)ep->cur]; |
start = &ep->data[(int)ep->cur]; |
q = 0; |
q = 0; |
|
|
|
|
} |
} |
|
|
start = &ep->data[(int)ep->cur]; |
start = &ep->data[(int)ep->cur]; |
next = q ? strchr(start, quote) : strchr(start, ' '); |
|
|
|
|
if ( ! q) { |
|
if ('{' == *start || '}' == *start) |
|
ssz = 1; |
|
else |
|
ssz = strcspn(start + 1, " ^~\"{}\t") + 1; |
|
next = start + (int)ssz; |
|
if ('\0' == *next) |
|
next = NULL; |
|
} else |
|
next = strchr(start, quote); |
|
|
if (NULL != next) { |
if (NULL != next) { |
*sz = (size_t)(next - start); |
*sz = (size_t)(next - start); |
ep->cur += *sz; |
ep->cur += *sz; |
if (q) |
if (q) |
ep->cur++; |
ep->cur++; |
while (' ' == ep->data[(int)ep->cur]) |
while (' ' == ep->data[(int)ep->cur] || |
|
'\t' == ep->data[(int)ep->cur] || |
|
'^' == ep->data[(int)ep->cur] || |
|
'~' == ep->data[(int)ep->cur]) |
ep->cur++; |
ep->cur++; |
} else { |
} else { |
if (q) |
if (q) |
EQN_MSG(MANDOCERR_BADQUOTE, ep); |
EQN_MSG(MANDOCERR_ARG_QUOTE, ep); |
next = strchr(start, '\0'); |
next = strchr(start, '\0'); |
*sz = (size_t)(next - start); |
*sz = (size_t)(next - start); |
ep->cur += *sz; |
ep->cur += *sz; |
|
|
ep->sz += diff; |
ep->sz += diff; |
ep->data = mandoc_realloc(ep->data, ep->sz + 1); |
ep->data = mandoc_realloc(ep->data, ep->sz + 1); |
ep->data[ep->sz] = '\0'; |
ep->data[ep->sz] = '\0'; |
start = &ep->data[(int)sv]; |
start = &ep->data[(int)ep->rew]; |
} |
} |
|
|
diff = def->valsz - *sz; |
diff = def->valsz - *sz; |
memmove(start + *sz + diff, start + *sz, |
memmove(start + *sz + diff, start + *sz, |
(strlen(start) - *sz) + 1); |
(strlen(start) - *sz) + 1); |
memcpy(start, def->val, def->valsz); |
memcpy(start, def->val, def->valsz); |
goto again; |
goto again; |
} |
} |
|
|
} |
} |
|
|
static int |
static int |
eqn_do_set(struct eqn_node *ep) |
eqn_do_ign1(struct eqn_node *ep) |
{ |
{ |
const char *start; |
|
|
|
if (NULL == (start = eqn_nextrawtok(ep, NULL))) |
if (NULL == eqn_nextrawtok(ep, NULL)) |
EQN_MSG(MANDOCERR_EQNARGS, ep); |
EQN_MSG(MANDOCERR_EQNEOF, ep); |
else if (NULL == (start = eqn_nextrawtok(ep, NULL))) |
|
EQN_MSG(MANDOCERR_EQNARGS, ep); |
|
else |
else |
return(1); |
return(1); |
|
|
Line 352 eqn_do_set(struct eqn_node *ep) |
|
Line 812 eqn_do_set(struct eqn_node *ep) |
|
} |
} |
|
|
static int |
static int |
|
eqn_do_ign2(struct eqn_node *ep) |
|
{ |
|
|
|
if (NULL == eqn_nextrawtok(ep, NULL)) |
|
EQN_MSG(MANDOCERR_EQNEOF, ep); |
|
else if (NULL == eqn_nextrawtok(ep, NULL)) |
|
EQN_MSG(MANDOCERR_EQNEOF, ep); |
|
else |
|
return(1); |
|
|
|
return(0); |
|
} |
|
|
|
static int |
|
eqn_do_tdefine(struct eqn_node *ep) |
|
{ |
|
|
|
if (NULL == eqn_nextrawtok(ep, NULL)) |
|
EQN_MSG(MANDOCERR_EQNEOF, ep); |
|
else if (NULL == eqn_next(ep, ep->data[(int)ep->cur], NULL, 0)) |
|
EQN_MSG(MANDOCERR_EQNEOF, ep); |
|
else |
|
return(1); |
|
|
|
return(0); |
|
} |
|
|
|
static int |
eqn_do_define(struct eqn_node *ep) |
eqn_do_define(struct eqn_node *ep) |
{ |
{ |
const char *start; |
const char *start; |
Line 360 eqn_do_define(struct eqn_node *ep) |
|
Line 848 eqn_do_define(struct eqn_node *ep) |
|
int i; |
int i; |
|
|
if (NULL == (start = eqn_nextrawtok(ep, &sz))) { |
if (NULL == (start = eqn_nextrawtok(ep, &sz))) { |
EQN_MSG(MANDOCERR_EQNARGS, ep); |
EQN_MSG(MANDOCERR_EQNEOF, ep); |
return(0); |
return(0); |
} |
} |
|
|
/* |
/* |
* Search for a key that already exists. |
* Search for a key that already exists. |
* Create a new key if none is found. |
* Create a new key if none is found. |
*/ |
*/ |
|
|
Line 377 eqn_do_define(struct eqn_node *ep) |
|
Line 865 eqn_do_define(struct eqn_node *ep) |
|
|
|
if (i == (int)ep->defsz) { |
if (i == (int)ep->defsz) { |
ep->defsz++; |
ep->defsz++; |
ep->defs = mandoc_realloc |
ep->defs = mandoc_reallocarray(ep->defs, |
(ep->defs, ep->defsz * |
ep->defsz, sizeof(struct eqn_def)); |
sizeof(struct eqn_def)); |
|
ep->defs[i].key = ep->defs[i].val = NULL; |
ep->defs[i].key = ep->defs[i].val = NULL; |
} |
} |
|
|
ep->defs[i].keysz = sz; |
ep->defs[i].keysz = sz; |
ep->defs[i].key = mandoc_realloc |
ep->defs[i].key = mandoc_realloc( |
(ep->defs[i].key, sz + 1); |
ep->defs[i].key, sz + 1); |
|
|
memcpy(ep->defs[i].key, start, sz); |
memcpy(ep->defs[i].key, start, sz); |
ep->defs[i].key[(int)sz] = '\0'; |
ep->defs[i].key[(int)sz] = '\0'; |
Line 395 eqn_do_define(struct eqn_node *ep) |
|
Line 882 eqn_do_define(struct eqn_node *ep) |
|
start = eqn_next(ep, ep->data[(int)ep->cur], &sz, 0); |
start = eqn_next(ep, ep->data[(int)ep->cur], &sz, 0); |
|
|
if (NULL == start) { |
if (NULL == start) { |
EQN_MSG(MANDOCERR_EQNARGS, ep); |
EQN_MSG(MANDOCERR_EQNEOF, ep); |
return(0); |
return(0); |
} |
} |
|
|
Line 407 eqn_do_define(struct eqn_node *ep) |
|
Line 894 eqn_do_define(struct eqn_node *ep) |
|
} |
} |
|
|
static int |
static int |
|
eqn_do_gfont(struct eqn_node *ep) |
|
{ |
|
|
|
if (NULL == eqn_nextrawtok(ep, NULL)) { |
|
EQN_MSG(MANDOCERR_EQNEOF, ep); |
|
return(0); |
|
} |
|
return(1); |
|
} |
|
|
|
static int |
|
eqn_do_gsize(struct eqn_node *ep) |
|
{ |
|
const char *start; |
|
size_t sz; |
|
|
|
if (NULL == (start = eqn_nextrawtok(ep, &sz))) { |
|
EQN_MSG(MANDOCERR_EQNEOF, ep); |
|
return(0); |
|
} |
|
ep->gsize = mandoc_strntoi(start, sz, 10); |
|
return(1); |
|
} |
|
|
|
static int |
eqn_do_undef(struct eqn_node *ep) |
eqn_do_undef(struct eqn_node *ep) |
{ |
{ |
const char *start; |
const char *start; |
Line 414 eqn_do_undef(struct eqn_node *ep) |
|
Line 926 eqn_do_undef(struct eqn_node *ep) |
|
size_t sz; |
size_t sz; |
|
|
if (NULL == (start = eqn_nextrawtok(ep, &sz))) { |
if (NULL == (start = eqn_nextrawtok(ep, &sz))) { |
EQN_MSG(MANDOCERR_EQNARGS, ep); |
EQN_MSG(MANDOCERR_EQNEOF, ep); |
return(0); |
return(0); |
} else if (NULL != (def = eqn_def_find(ep, start, sz))) |
} else if (NULL != (def = eqn_def_find(ep, start, sz))) |
def->keysz = 0; |
def->keysz = 0; |
Line 427 eqn_def_find(struct eqn_node *ep, const char *key, siz |
|
Line 939 eqn_def_find(struct eqn_node *ep, const char *key, siz |
|
{ |
{ |
int i; |
int i; |
|
|
for (i = 0; i < (int)ep->defsz; i++) |
for (i = 0; i < (int)ep->defsz; i++) |
if (ep->defs[i].keysz && ep->defs[i].keysz == sz && |
if (ep->defs[i].keysz && STRNEQ(ep->defs[i].key, |
0 == strncmp(ep->defs[i].key, key, sz)) |
ep->defs[i].keysz, key, sz)) |
return(&ep->defs[i]); |
return(&ep->defs[i]); |
|
|
return(NULL); |
return(NULL); |