version 1.21, 2011/07/21 23:42:28 |
version 1.25, 2011/07/22 10:36:58 |
|
|
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 eqnpart { |
struct eqnstr str; |
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 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 *, |
Line 63 static struct eqn_def *eqn_def_find(struct eqn_node *, |
|
Line 69 static struct eqn_def *eqn_def_find(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_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 void eqn_rewind(struct eqn_node *); |
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 */ |
Line 204 eqn_eqn(struct eqn_node *ep, struct eqn_box *last) |
|
Line 210 eqn_eqn(struct eqn_node *ep, struct eqn_box *last) |
|
} |
} |
|
|
static enum eqn_rest |
static enum eqn_rest |
|
eqn_list(struct eqn_node *ep, struct eqn_box *last) |
|
{ |
|
struct eqn_box *bp; |
|
const char *start; |
|
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) |
eqn_box(struct eqn_node *ep, struct eqn_box *last) |
{ |
{ |
size_t sz; |
size_t sz; |
Line 216 eqn_box(struct eqn_node *ep, struct eqn_box *last) |
|
Line 267 eqn_box(struct eqn_node *ep, struct eqn_box *last) |
|
if (NULL == (start = eqn_nexttok(ep, &sz))) |
if (NULL == (start = eqn_nexttok(ep, &sz))) |
return(EQN_EOF); |
return(EQN_EOF); |
|
|
if (1 == sz && 0 == strncmp("}", start, 1)) |
if (STRNEQ(start, sz, "}", 1)) |
return(EQN_DESCOPE); |
return(EQN_DESCOPE); |
else if (5 == sz && 0 == strncmp("right", start, 5)) |
else if (STRNEQ(start, sz, "right", 5)) |
return(EQN_DESCOPE); |
return(EQN_DESCOPE); |
else if (5 == sz && 0 == strncmp("above", start, 5)) |
else if (STRNEQ(start, sz, "above", 5)) |
return(EQN_DESCOPE); |
return(EQN_DESCOPE); |
|
|
for (i = 0; i < (int)EQN__MAX; i++) { |
for (i = 0; i < (int)EQN__MAX; i++) { |
if (eqnparts[i].str.sz != sz) |
if ( ! EQNSTREQ(&eqnparts[i].str, start, sz)) |
continue; |
continue; |
if (strncmp(eqnparts[i].str.name, start, sz)) |
|
continue; |
|
return((*eqnparts[i].fp)(ep) ? EQN_OK : EQN_ERR); |
return((*eqnparts[i].fp)(ep) ? EQN_OK : EQN_ERR); |
} |
} |
|
|
if (1 == sz && 0 == strncmp("{", start, 1)) { |
if (STRNEQ(start, sz, "{", 1)) { |
if (EQN_DESCOPE != (c = eqn_eqn(ep, last))) { |
if (EQN_DESCOPE != (c = eqn_eqn(ep, last))) { |
if (EQN_ERR != c) |
if (EQN_ERR != c) |
EQN_MSG(MANDOCERR_EQNSCOPE, ep); |
EQN_MSG(MANDOCERR_EQNSCOPE, ep); |
Line 240 eqn_box(struct eqn_node *ep, struct eqn_box *last) |
|
Line 289 eqn_box(struct eqn_node *ep, struct eqn_box *last) |
|
eqn_rewind(ep); |
eqn_rewind(ep); |
start = eqn_nexttok(ep, &sz); |
start = eqn_nexttok(ep, &sz); |
assert(start); |
assert(start); |
if (1 == sz && 0 == strncmp("}", start, 1)) |
if (STRNEQ(start, sz, "}", 1)) |
return(EQN_OK); |
return(EQN_OK); |
EQN_MSG(MANDOCERR_EQNBADSCOPE, ep); |
EQN_MSG(MANDOCERR_EQNBADSCOPE, ep); |
return(EQN_ERR); |
return(EQN_ERR); |
} |
} |
|
|
for (i = 0; i < (int)EQNPILE__MAX; i++) { |
for (i = 0; i < (int)EQNPILE__MAX; i++) { |
if (eqnpiles[i].sz != sz) |
if ( ! EQNSTREQ(&eqnpiles[i], start, sz)) |
continue; |
continue; |
if (strncmp(eqnpiles[i].name, start, sz)) |
if (EQN_OK == (c = eqn_list(ep, last))) |
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); |
|
} |
|
|
|
while (EQN_DESCOPE == (c = eqn_eqn(ep, last))) { |
|
assert(last->last); |
|
last->last->pile = (enum eqn_pilet)i; |
last->last->pile = (enum eqn_pilet)i; |
eqn_rewind(ep); |
return(c); |
start = eqn_nexttok(ep, &sz); |
|
assert(start); |
|
if (5 != sz || strncmp("above", start, 5)) |
|
break; |
|
last->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 (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 (STRNEQ(start, sz, "left", 4)) { |
if (NULL == (start = eqn_nexttok(ep, &sz))) { |
if (NULL == (start = eqn_nexttok(ep, &sz))) { |
EQN_MSG(MANDOCERR_EQNEOF, ep); |
EQN_MSG(MANDOCERR_EQNEOF, ep); |
return(EQN_ERR); |
return(EQN_ERR); |
Line 300 eqn_box(struct eqn_node *ep, struct eqn_box *last) |
|
Line 316 eqn_box(struct eqn_node *ep, struct eqn_box *last) |
|
eqn_rewind(ep); |
eqn_rewind(ep); |
start = eqn_nexttok(ep, &sz); |
start = eqn_nexttok(ep, &sz); |
assert(start); |
assert(start); |
if (5 != sz || strncmp("right", start, 5)) |
if (STRNEQ(start, sz, "right", 5)) |
return(EQN_DESCOPE); |
return(EQN_DESCOPE); |
if (NULL == (start = eqn_nexttok(ep, &sz))) { |
if (NULL == (start = eqn_nexttok(ep, &sz))) { |
EQN_MSG(MANDOCERR_EQNEOF, ep); |
EQN_MSG(MANDOCERR_EQNEOF, ep); |
Line 311 eqn_box(struct eqn_node *ep, struct eqn_box *last) |
|
Line 327 eqn_box(struct eqn_node *ep, struct eqn_box *last) |
|
} |
} |
|
|
for (i = 0; i < (int)EQNPOS__MAX; i++) { |
for (i = 0; i < (int)EQNPOS__MAX; i++) { |
if (eqnposs[i].sz != sz) |
if ( ! EQNSTREQ(&eqnposs[i], start, sz)) |
continue; |
continue; |
if (strncmp(eqnposs[i].name, start, sz)) |
|
continue; |
|
if (NULL == last->last) { |
if (NULL == last->last) { |
EQN_MSG(MANDOCERR_EQNSYNT, ep); |
EQN_MSG(MANDOCERR_EQNSYNT, ep); |
return(EQN_ERR); |
return(EQN_ERR); |
Line 328 eqn_box(struct eqn_node *ep, struct eqn_box *last) |
|
Line 342 eqn_box(struct eqn_node *ep, struct eqn_box *last) |
|
} |
} |
|
|
for (i = 0; i < (int)EQNMARK__MAX; i++) { |
for (i = 0; i < (int)EQNMARK__MAX; i++) { |
if (eqnmarks[i].sz != sz) |
if ( ! EQNSTREQ(&eqnmarks[i], start, sz)) |
continue; |
continue; |
if (strncmp(eqnmarks[i].name, start, sz)) |
|
continue; |
|
if (NULL == last->last) { |
if (NULL == last->last) { |
EQN_MSG(MANDOCERR_EQNSYNT, ep); |
EQN_MSG(MANDOCERR_EQNSYNT, ep); |
return(EQN_ERR); |
return(EQN_ERR); |
Line 345 eqn_box(struct eqn_node *ep, struct eqn_box *last) |
|
Line 357 eqn_box(struct eqn_node *ep, struct eqn_box *last) |
|
} |
} |
|
|
for (i = 0; i < (int)EQNFONT__MAX; i++) { |
for (i = 0; i < (int)EQNFONT__MAX; i++) { |
if (eqnfonts[i].sz != sz) |
if ( ! EQNSTREQ(&eqnfonts[i], start, sz)) |
continue; |
continue; |
if (strncmp(eqnfonts[i].name, start, sz)) |
|
continue; |
|
if (EQN_EOF == (c = eqn_box(ep, last))) { |
if (EQN_EOF == (c = eqn_box(ep, last))) { |
EQN_MSG(MANDOCERR_EQNEOF, ep); |
EQN_MSG(MANDOCERR_EQNEOF, ep); |
return(EQN_ERR); |
return(EQN_ERR); |
Line 357 eqn_box(struct eqn_node *ep, struct eqn_box *last) |
|
Line 367 eqn_box(struct eqn_node *ep, struct eqn_box *last) |
|
return(c); |
return(c); |
} |
} |
|
|
if (4 == sz && 0 == strncmp("size", start, 4)) { |
if (STRNEQ(start, sz, "size", 4)) { |
if (NULL == (start = eqn_nexttok(ep, &sz))) { |
if (NULL == (start = eqn_nexttok(ep, &sz))) { |
EQN_MSG(MANDOCERR_EQNEOF, ep); |
EQN_MSG(MANDOCERR_EQNEOF, ep); |
return(EQN_ERR); |
return(EQN_ERR); |
Line 453 eqn_next(struct eqn_node *ep, char quote, size_t *sz, |
|
Line 463 eqn_next(struct eqn_node *ep, char quote, size_t *sz, |
|
{ |
{ |
char *start, *next; |
char *start, *next; |
int q, diff, lim; |
int q, diff, lim; |
size_t 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; |
ep->rew = ep->cur; |
ep->rew = ep->cur; |
|
|
} |
} |
|
|
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) |
Line 616 eqn_def_find(struct eqn_node *ep, const char *key, siz |
|
Line 638 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); |