version 1.13, 2011/07/21 11:34:53 |
version 1.22, 2011/07/22 00:16:37 |
|
|
#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; |
|
}; |
|
|
|
struct eqnpart { |
|
struct eqnstr str; |
int (*fp)(struct eqn_node *); |
int (*fp)(struct eqn_node *); |
}; |
}; |
|
|
|
|
EQN__MAX |
EQN__MAX |
}; |
}; |
|
|
|
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_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 *, struct eqn_box *); |
static const char *eqn_next(struct eqn_node *, |
|
char, size_t *, int); |
|
static void eqn_rewind(struct eqn_node *); |
|
static enum eqn_rest eqn_eqn(struct eqn_node *, struct eqn_box *); |
|
static enum eqn_rest eqn_box(struct eqn_node *, 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] = { |
|
{ "", 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, |
|
|
eqn_end(struct eqn_node *ep) |
eqn_end(struct eqn_node *ep) |
{ |
{ |
struct eqn_box *root; |
struct eqn_box *root; |
|
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))) { |
* Validate the expression. |
EQN_MSG(MANDOCERR_EQNNSCOPE, ep); |
* Use the grammar found in the literature. |
c = EQN_ERR; |
*/ |
} |
|
|
return(eqn_box(ep, root) < 0 ? ROFF_IGN : ROFF_EQN); |
return(EQN_EOF == c ? ROFF_EQN : ROFF_IGN); |
} |
} |
|
|
static int |
static enum eqn_rest |
|
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_box(struct eqn_node *ep, struct eqn_box *last) |
eqn_box(struct eqn_node *ep, struct eqn_box *last) |
{ |
{ |
size_t sz; |
size_t sz; |
const char *start; |
const char *start; |
int i, nextc; |
char *left; |
|
enum eqn_rest c; |
|
int i, size; |
struct eqn_box *bp; |
struct eqn_box *bp; |
|
|
nextc = 1; |
|
again: |
|
if (NULL == (start = eqn_nexttok(ep, &sz))) |
if (NULL == (start = eqn_nexttok(ep, &sz))) |
return(0); |
return(EQN_EOF); |
|
|
|
if (1 == sz && 0 == strncmp("}", start, 1)) |
|
return(EQN_DESCOPE); |
|
else if (5 == sz && 0 == strncmp("right", start, 5)) |
|
return(EQN_DESCOPE); |
|
else if (5 == sz && 0 == strncmp("above", start, 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 (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)) |
return((*eqnparts[i].fp)(ep) ? EQN_OK : EQN_ERR); |
return(-1); |
} |
|
|
goto again; |
if (1 == sz && 0 == strncmp("{", start, 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 (1 == sz && 0 == strncmp("}", start, 1)) |
|
return(EQN_OK); |
|
EQN_MSG(MANDOCERR_EQNBADSCOPE, ep); |
|
return(EQN_ERR); |
} |
} |
|
|
bp = mandoc_calloc(1, sizeof(struct eqn_box)); |
for (i = 0; i < (int)EQNPILE__MAX; i++) { |
bp->type = EQN_TEXT; |
if (eqnpiles[i].sz != sz) |
|
continue; |
|
if (strncmp(eqnpiles[i].name, start, sz)) |
|
continue; |
|
if (NULL == (start = eqn_nexttok(ep, &sz))) { |
|
EQN_MSG(MANDOCERR_EQNEOF, ep); |
|
return(EQN_ERR); |
|
} |
|
if (1 != sz || strncmp("{", start, 1)) { |
|
EQN_MSG(MANDOCERR_EQNSYNT, ep); |
|
return(EQN_ERR); |
|
} |
|
|
if (nextc) |
while (EQN_DESCOPE == (c = eqn_eqn(ep, last))) { |
last->child = bp; |
assert(last->last); |
else |
last->last->pile = (enum eqn_pilet)i; |
last->next = bp; |
eqn_rewind(ep); |
|
start = eqn_nexttok(ep, &sz); |
|
assert(start); |
|
if (5 != sz || strncmp("above", start, 5)) |
|
break; |
|
last->last->above = 1; |
|
} |
|
|
bp->text = mandoc_malloc(sz + 1); |
if (EQN_DESCOPE != c) { |
*bp->text = '\0'; |
if (EQN_ERR != c) |
strlcat(bp->text, start, sz + 1); |
EQN_MSG(MANDOCERR_EQNSCOPE, ep); |
|
return(EQN_ERR); |
|
} |
|
|
last = bp; |
eqn_rewind(ep); |
nextc = 0; |
start = eqn_nexttok(ep, &sz); |
goto again; |
assert(start); |
|
if (1 == sz && 0 == strncmp("}", start, 1)) |
|
return(EQN_OK); |
|
|
|
EQN_MSG(MANDOCERR_EQNBADSCOPE, ep); |
|
return(EQN_ERR); |
|
} |
|
|
|
if (4 == sz && 0 == strncmp("left", start, 4)) { |
|
if (NULL == (start = eqn_nexttok(ep, &sz))) { |
|
EQN_MSG(MANDOCERR_EQNEOF, ep); |
|
return(EQN_ERR); |
|
} |
|
left = mandoc_strndup(start, sz); |
|
if (EQN_DESCOPE != (c = eqn_eqn(ep, last))) |
|
return(c); |
|
assert(last->last); |
|
last->last->left = left; |
|
eqn_rewind(ep); |
|
start = eqn_nexttok(ep, &sz); |
|
assert(start); |
|
if (5 != sz || strncmp("right", start, 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); |
|
} |
|
|
|
for (i = 0; i < (int)EQNPOS__MAX; i++) { |
|
if (eqnposs[i].sz != sz) |
|
continue; |
|
if (strncmp(eqnposs[i].name, 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++) { |
|
if (eqnmarks[i].sz != sz) |
|
continue; |
|
if (strncmp(eqnmarks[i].name, 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++) { |
|
if (eqnfonts[i].sz != sz) |
|
continue; |
|
if (strncmp(eqnfonts[i].name, start, sz)) |
|
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 (4 == sz && 0 == strncmp("size", start, 4)) { |
|
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; |
|
} |
|
|
|
bp = eqn_box_alloc(last); |
|
bp->type = EQN_TEXT; |
|
bp->text = mandoc_strndup(start, sz); |
|
return(EQN_OK); |
} |
} |
|
|
void |
void |
Line 192 eqn_free(struct eqn_node *p) |
|
Line 394 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); |
} |
} |
|
|
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 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) |
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) |
|
|
|
|
/* Quotes aren't expanded for values. */ |
/* Quotes aren't expanded for values. */ |
|
|
if (q) |
if (q || ! repl) |
return(start); |
return(start); |
|
|
if (NULL != (def = eqn_def_find(ep, start, *sz))) { |
if (NULL != (def = eqn_def_find(ep, start, *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; |
|
|
} |
} |
|
|
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 311 eqn_do_define(struct eqn_node *ep) |
|
Line 559 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 344 eqn_do_define(struct eqn_node *ep) |
|
Line 592 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 355 eqn_do_define(struct eqn_node *ep) |
|
Line 603 eqn_do_define(struct eqn_node *ep) |
|
def->val = mandoc_realloc(def->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'; |
|
|
/*fprintf(stderr, "Defining: [%s], [%s]\n", |
|
def->key, def->val);*/ |
|
return(1); |
return(1); |
} |
} |
|
|
Line 368 eqn_do_undef(struct eqn_node *ep) |
|
Line 613 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))) |