version 1.15, 2011/07/21 12:30:44 |
version 1.26, 2011/07/22 12:55:02 |
|
|
#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> |
|
|
#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 { |
|
EQN_DESCOPE, |
|
EQN_ERR, |
|
EQN_OK, |
|
EQN_EOF |
|
}; |
|
|
|
struct eqnstr { |
const char *name; |
const char *name; |
size_t sz; |
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 *); |
int (*fp)(struct eqn_node *); |
}; |
}; |
|
|
|
|
EQN__MAX |
EQN__MAX |
}; |
}; |
|
|
|
static enum eqn_rest eqn_box(struct eqn_node *, struct eqn_box *); |
|
static struct eqn_box *eqn_box_alloc(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_define(struct eqn_node *); |
static int eqn_do_define(struct eqn_node *); |
static int eqn_do_set(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 enum eqn_rest eqn_eqn(struct eqn_node *, struct eqn_box *); |
|
static enum eqn_rest eqn_list(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 */ |
{ { "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] = { |
|
{ "", 0 }, /* EQNFONT_NONE */ |
|
{ "roman", 5 }, /* EQNFONT_ROMAN */ |
|
{ "bold", 4 }, /* EQNFONT_BOLD */ |
|
{ "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 */ |
|
{ "cpile", 5 }, /* EQNPILE_CPILE */ |
|
{ "rpile", 5 }, /* EQNPILE_RPILE */ |
|
{ "lpile", 5 }, /* EQNPILE_LPILE */ |
|
}; |
|
|
/* ARGSUSED */ |
/* ARGSUSED */ |
enum rofferr |
enum rofferr |
eqn_read(struct eqn_node **epp, int ln, |
eqn_read(struct eqn_node **epp, int ln, |
Line 120 eqn_alloc(int pos, int line, struct mparse *parse) |
|
Line 175 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; |
struct eqn_box *root; |
int c; |
enum eqn_rest c; |
|
|
ep->eqn.root = root = |
ep->eqn.root = mandoc_calloc(1, sizeof(struct eqn_box)); |
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) |
{ |
{ |
|
struct eqn_box *bp; |
|
enum eqn_rest c; |
|
|
|
bp = eqn_box_alloc(last); |
|
bp->type = EQN_SUBEXPR; |
|
|
|
while (EQN_OK == (c = eqn_box(ep, bp))) |
|
/* Spin! */ ; |
|
|
|
return(c); |
|
} |
|
|
|
static enum eqn_rest |
|
eqn_list(struct eqn_node *ep, struct eqn_box *last) |
|
{ |
|
struct eqn_box *bp; |
|
const char *start; |
size_t sz; |
size_t sz; |
|
enum eqn_rest c; |
|
|
|
bp = eqn_box_alloc(last); |
|
bp->type = EQN_LIST; |
|
|
|
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_DESCOPE == (c = eqn_eqn(ep, bp))) { |
|
eqn_rewind(ep); |
|
start = eqn_nexttok(ep, &sz); |
|
assert(start); |
|
if ( ! STRNEQ(start, sz, "above", 5)) |
|
break; |
|
bp->last->above = 1; |
|
} |
|
|
|
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; |
const char *start; |
int c, i, nextc; |
char *left; |
|
enum eqn_rest c; |
|
int i, size; |
struct eqn_box *bp; |
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; |
|
again: |
|
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); |
|
|
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, "left", 4)) { |
return(1); |
if (NULL == (start = eqn_nexttok(ep, &sz))) { |
|
EQN_MSG(MANDOCERR_EQNEOF, ep); |
|
return(EQN_ERR); |
|
} |
|
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); |
|
} |
|
|
bp = mandoc_calloc(1, sizeof(struct eqn_box)); |
for (i = 0; i < (int)EQNPOS__MAX; i++) { |
if (nextc) |
if ( ! EQNSTREQ(&eqnposs[i], start, sz)) |
last->child = bp; |
continue; |
else |
if (NULL == last->last) { |
last->next = bp; |
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); |
|
} |
|
|
last = bp; |
for (i = 0; i < (int)EQNMARK__MAX; i++) { |
|
if ( ! EQNSTREQ(&eqnmarks[i], start, sz)) |
|
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); |
|
} |
|
|
/* |
for (i = 0; i < (int)EQNFONT__MAX; i++) { |
* See if we're to open a new subexpression. |
if ( ! EQNSTREQ(&eqnfonts[i], start, sz)) |
* If so, mark our node as such and descend. |
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); |
|
} |
|
|
if (sz == 1 && 0 == strncmp("{", start, 1)) { |
if (STRNEQ(start, sz, "size", 4)) { |
bp->type = EQN_SUBEXPR; |
if (NULL == (start = eqn_nexttok(ep, &sz))) { |
c = eqn_box(ep, bp, sv); |
EQN_MSG(MANDOCERR_EQNEOF, ep); |
|
return(EQN_ERR); |
nextc = 0; |
} |
goto again; |
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(last); |
|
|
bp->type = EQN_TEXT; |
bp->type = EQN_TEXT; |
bp->text = mandoc_malloc(sz + 1); |
bp->text = mandoc_strndup(start, sz); |
*bp->text = '\0'; |
return(EQN_OK); |
strlcat(bp->text, start, sz + 1); |
|
|
|
nextc = 0; |
|
goto again; |
|
} |
} |
|
|
void |
void |
Line 233 eqn_free(struct eqn_node *p) |
|
Line 408 eqn_free(struct eqn_node *p) |
|
free(p); |
free(p); |
} |
} |
|
|
|
static struct eqn_box * |
|
eqn_box_alloc(struct eqn_box *parent) |
|
{ |
|
struct eqn_box *bp; |
|
|
|
bp = mandoc_calloc(1, sizeof(struct eqn_box)); |
|
bp->parent = parent; |
|
bp->size = EQN_DEFSIZE; |
|
|
|
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 455 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. */ |
|
|
|
|
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->cur++; |
ep->cur++; |
} else { |
} else { |
if (q) |
if (q) |
|
|
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; |
Line 428 eqn_def_find(struct eqn_node *ep, const char *key, siz |
|
Line 642 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); |