version 1.12, 2011/07/21 10:24:35 |
version 1.17, 2011/07/21 13:37:04 |
|
|
#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 { |
struct eqnstr { |
const char *name; |
const char *name; |
size_t sz; |
size_t sz; |
|
}; |
|
|
|
struct eqnpart { |
|
struct eqnstr str; |
int (*fp)(struct eqn_node *); |
int (*fp)(struct eqn_node *); |
}; |
}; |
|
|
|
|
EQN__MAX |
EQN__MAX |
}; |
}; |
|
|
|
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_define(struct eqn_node *); |
static int eqn_do_define(struct eqn_node *); |
static int eqn_do_ign2(struct eqn_node *); |
static int eqn_do_set(struct eqn_node *); |
static int eqn_do_undef(struct eqn_node *); |
static int eqn_do_undef(struct eqn_node *); |
static const char *eqn_nexttok(struct eqn_node *, size_t *); |
static const char *eqn_nexttok(struct eqn_node *, size_t *); |
static const char *eqn_next(struct eqn_node *, char, size_t *); |
static const char *eqn_nextrawtok(struct eqn_node *, size_t *); |
static int eqn_box(struct eqn_node *); |
static const char *eqn_next(struct eqn_node *, |
|
char, size_t *, int); |
|
static int eqn_box(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_ign2 }, /* EQN_SET */ |
{ { "set", 3 }, eqn_do_set }, /* EQN_SET */ |
{ "undef", 5, eqn_do_undef }, /* EQN_UNDEF */ |
{ { "undef", 5 }, eqn_do_undef }, /* EQN_UNDEF */ |
}; |
}; |
|
|
|
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] = { |
|
{ "roman", 5 }, |
|
{ "bold", 4 }, |
|
{ "italic", 6 }, |
|
}; |
|
|
/* ARGSUSED */ |
/* ARGSUSED */ |
enum rofferr |
enum rofferr |
eqn_read(struct eqn_node **epp, int ln, |
eqn_read(struct eqn_node **epp, int ln, |
Line 116 eqn_alloc(int pos, int line, struct mparse *parse) |
|
Line 142 eqn_alloc(int pos, int line, struct mparse *parse) |
|
enum rofferr |
enum rofferr |
eqn_end(struct eqn_node *ep) |
eqn_end(struct eqn_node *ep) |
{ |
{ |
|
struct eqn_box *root, *last; |
int c; |
int c; |
|
|
/* |
ep->eqn.root = root = |
* Validate the expression. |
mandoc_calloc(1, sizeof(struct eqn_box)); |
* Use the grammar found in the literature. |
root->type = EQN_ROOT; |
*/ |
|
|
|
if (0 == ep->sz) |
if (0 == ep->sz) |
return(ROFF_IGN); |
return(ROFF_IGN); |
|
|
while (1 == (c = eqn_box(ep))) |
/* |
/* Keep parsing. */ ; |
* 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. |
|
*/ |
|
|
return(c < 0 ? ROFF_IGN : ROFF_EQN); |
if (0 == (c = eqn_box(ep, root, &last))) { |
|
if (last != root) { |
|
EQN_MSG(MANDOCERR_EQNSCOPE, ep); |
|
c = 0; |
|
} |
|
} else if (c > 0) |
|
EQN_MSG(MANDOCERR_EQNNSCOPE, ep); |
|
|
|
return(0 == c ? ROFF_EQN : ROFF_IGN); |
} |
} |
|
|
static int |
static int |
eqn_box(struct eqn_node *ep) |
eqn_box(struct eqn_node *ep, struct eqn_box *last, struct eqn_box **sv) |
{ |
{ |
size_t sz; |
size_t sz; |
const char *start; |
const char *start; |
int i; |
int c, i, nextc; |
|
enum eqn_fontt font; |
|
struct eqn_box *bp; |
|
|
|
/* |
|
* Mark our last level of subexpression. |
|
* Also mark whether that the next node should be a |
|
* subexpression node. |
|
*/ |
|
|
|
*sv = last; |
|
nextc = 1; |
|
font = EQNFONT_NONE; |
|
|
|
again: |
if (NULL == (start = eqn_nexttok(ep, &sz))) |
if (NULL == (start = eqn_nexttok(ep, &sz))) |
return(0); |
return(0); |
|
|
|
for (i = 0; i < (int)EQNFONT__MAX; i++) { |
|
if (eqnfonts[i].sz != sz) |
|
continue; |
|
if (strncmp(eqnfonts[i].name, start, sz)) |
|
continue; |
|
font = (enum eqn_fontt)i; |
|
goto again; |
|
} |
|
|
for (i = 0; i < (int)EQN__MAX; i++) { |
for (i = 0; i < (int)EQN__MAX; i++) { |
if (eqnparts[i].sz != sz) |
if (eqnparts[i].str.sz != sz) |
continue; |
continue; |
if (strncmp(eqnparts[i].name, start, sz)) |
if (strncmp(eqnparts[i].str.name, start, sz)) |
continue; |
continue; |
if ( ! (*eqnparts[i].fp)(ep)) |
if ( ! (*eqnparts[i].fp)(ep)) |
return(-1); |
return(-1); |
|
goto again; |
|
} |
|
|
|
for (i = 0; i < (int)EQNMARK__MAX; i++) { |
|
if (eqnmarks[i].sz != sz) |
|
continue; |
|
if (strncmp(eqnmarks[i].name, start, sz)) |
|
continue; |
|
last->mark = (enum eqn_markt)i; |
|
goto again; |
|
} |
|
|
|
/* Exit this [hopefully] subexpression. */ |
|
|
|
if (sz == 1 && 0 == strncmp("}", start, 1)) |
return(1); |
return(1); |
} |
|
|
|
ep->eqn.data = mandoc_realloc |
bp = mandoc_calloc(1, sizeof(struct eqn_box)); |
(ep->eqn.data, ep->eqn.sz + sz + 1); |
bp->font = font; |
|
font = EQNFONT_NONE; |
|
|
if (0 == ep->eqn.sz) |
if (nextc) |
*ep->eqn.data = '\0'; |
last->child = bp; |
|
else |
|
last->next = bp; |
|
|
ep->eqn.sz += sz; |
last = bp; |
strlcat(ep->eqn.data, start, ep->eqn.sz + 1); |
|
return(1); |
/* |
|
* See if we're to open a new subexpression. |
|
* If so, mark our node as such and descend. |
|
*/ |
|
|
|
if (sz == 1 && 0 == strncmp("{", start, 1)) { |
|
bp->type = EQN_SUBEXPR; |
|
c = eqn_box(ep, bp, sv); |
|
|
|
nextc = 0; |
|
goto again; |
|
} |
|
|
|
/* A regular text node. */ |
|
|
|
bp->type = EQN_TEXT; |
|
bp->text = mandoc_malloc(sz + 1); |
|
*bp->text = '\0'; |
|
strlcat(bp->text, start, sz + 1); |
|
|
|
nextc = 0; |
|
goto again; |
} |
} |
|
|
void |
void |
Line 169 eqn_free(struct eqn_node *p) |
|
Line 268 eqn_free(struct eqn_node *p) |
|
{ |
{ |
int i; |
int i; |
|
|
free(p->eqn.data); |
eqn_box_free(p->eqn.root); |
|
|
for (i = 0; i < (int)p->defsz; i++) { |
for (i = 0; i < (int)p->defsz; i++) { |
free(p->defs[i].key); |
free(p->defs[i].key); |
Line 181 eqn_free(struct eqn_node *p) |
|
Line 280 eqn_free(struct eqn_node *p) |
|
free(p); |
free(p); |
} |
} |
|
|
|
static void |
|
eqn_box_free(struct eqn_box *bp) |
|
{ |
|
|
|
if (bp->child) |
|
eqn_box_free(bp->child); |
|
if (bp->next) |
|
eqn_box_free(bp->next); |
|
|
|
free(bp->text); |
|
free(bp); |
|
} |
|
|
static const char * |
static const char * |
|
eqn_nextrawtok(struct eqn_node *ep, size_t *sz) |
|
{ |
|
|
|
return(eqn_next(ep, '"', sz, 0)); |
|
} |
|
|
|
static const char * |
eqn_nexttok(struct eqn_node *ep, size_t *sz) |
eqn_nexttok(struct eqn_node *ep, size_t *sz) |
{ |
{ |
|
|
return(eqn_next(ep, '"', sz)); |
return(eqn_next(ep, '"', sz, 1)); |
} |
} |
|
|
static const char * |
static const char * |
eqn_next(struct eqn_node *ep, char quote, size_t *sz) |
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; |
Line 199 eqn_next(struct eqn_node *ep, char quote, size_t *sz) |
|
Line 318 eqn_next(struct eqn_node *ep, char quote, size_t *sz) |
|
if (NULL == sz) |
if (NULL == sz) |
sz = &ssz; |
sz = &ssz; |
|
|
|
lim = 0; |
|
sv = ep->cur; |
|
again: |
|
/* Prevent self-definitions. */ |
|
|
|
if (lim >= EQN_NEST_MAX) { |
|
EQN_MSG(MANDOCERR_EQNNEST, ep); |
|
return(NULL); |
|
} |
|
|
|
ep->cur = sv; |
start = &ep->data[(int)ep->cur]; |
start = &ep->data[(int)ep->cur]; |
q = 0; |
q = 0; |
|
|
Line 210 eqn_next(struct eqn_node *ep, char quote, size_t *sz) |
|
Line 340 eqn_next(struct eqn_node *ep, char quote, size_t *sz) |
|
q = 1; |
q = 1; |
} |
} |
|
|
lim = 0; |
|
|
|
sv = ep->cur; |
|
again: |
|
if (lim >= EQN_NEST_MAX) { |
|
EQN_MSG(MANDOCERR_EQNNEST, ep); |
|
return(NULL); |
|
} |
|
|
|
ep->cur = sv; |
|
start = &ep->data[(int)ep->cur]; |
start = &ep->data[(int)ep->cur]; |
next = q ? strchr(start, quote) : strchr(start, ' '); |
next = q ? strchr(start, quote) : strchr(start, ' '); |
|
|
|
|
ep->cur += *sz; |
ep->cur += *sz; |
} |
} |
|
|
|
/* Quotes aren't expanded for values. */ |
|
|
|
if (q || ! repl) |
|
return(start); |
|
|
if (NULL != (def = eqn_def_find(ep, start, *sz))) { |
if (NULL != (def = eqn_def_find(ep, start, *sz))) { |
diff = def->valsz - *sz; |
diff = def->valsz - *sz; |
|
|
|
|
} |
} |
|
|
static int |
static int |
eqn_do_ign2(struct eqn_node *ep) |
eqn_do_set(struct eqn_node *ep) |
{ |
{ |
const char *start; |
const char *start; |
|
|
if (NULL == (start = eqn_nexttok(ep, NULL))) |
if (NULL == (start = eqn_nextrawtok(ep, NULL))) |
EQN_MSG(MANDOCERR_EQNARGS, ep); |
EQN_MSG(MANDOCERR_EQNARGS, ep); |
else if (NULL == (start = eqn_nexttok(ep, NULL))) |
else if (NULL == (start = eqn_nextrawtok(ep, NULL))) |
EQN_MSG(MANDOCERR_EQNARGS, ep); |
EQN_MSG(MANDOCERR_EQNARGS, ep); |
else |
else |
return(1); |
return(1); |
Line 281 eqn_do_define(struct eqn_node *ep) |
|
Line 406 eqn_do_define(struct eqn_node *ep) |
|
struct eqn_def *def; |
struct eqn_def *def; |
int i; |
int i; |
|
|
if (NULL == (start = eqn_nexttok(ep, &sz))) { |
if (NULL == (start = eqn_nextrawtok(ep, &sz))) { |
EQN_MSG(MANDOCERR_EQNARGS, ep); |
EQN_MSG(MANDOCERR_EQNARGS, ep); |
return(0); |
return(0); |
} |
} |
Line 314 eqn_do_define(struct eqn_node *ep) |
|
Line 439 eqn_do_define(struct eqn_node *ep) |
|
def = &ep->defs[i]; |
def = &ep->defs[i]; |
} |
} |
|
|
start = eqn_next(ep, ep->data[(int)ep->cur], &sz); |
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_EQNARGS, ep); |
Line 322 eqn_do_define(struct eqn_node *ep) |
|
Line 447 eqn_do_define(struct eqn_node *ep) |
|
} |
} |
|
|
def->valsz = sz; |
def->valsz = sz; |
def->val = mandoc_realloc(ep->defs[i].val, sz + 1); |
def->val = mandoc_realloc(def->val, sz + 1); |
memcpy(def->val, start, sz); |
memcpy(def->val, start, sz); |
def->val[(int)sz] = '\0'; |
def->val[(int)sz] = '\0'; |
return(1); |
return(1); |
Line 335 eqn_do_undef(struct eqn_node *ep) |
|
Line 460 eqn_do_undef(struct eqn_node *ep) |
|
struct eqn_def *def; |
struct eqn_def *def; |
size_t sz; |
size_t sz; |
|
|
if (NULL == (start = eqn_nexttok(ep, &sz))) { |
if (NULL == (start = eqn_nextrawtok(ep, &sz))) { |
EQN_MSG(MANDOCERR_EQNARGS, ep); |
EQN_MSG(MANDOCERR_EQNARGS, 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))) |