version 1.23, 2011/07/22 09:57:04 |
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 *); |
Line 219 eqn_list(struct eqn_node *ep, struct eqn_box *last) |
|
Line 224 eqn_list(struct eqn_node *ep, struct eqn_box *last) |
|
EQN_MSG(MANDOCERR_EQNEOF, ep); |
EQN_MSG(MANDOCERR_EQNEOF, ep); |
return(EQN_ERR); |
return(EQN_ERR); |
} |
} |
if (1 != sz || strncmp("{", start, 1)) { |
if ( ! STRNEQ(start, sz, "{", 1)) { |
EQN_MSG(MANDOCERR_EQNSYNT, ep); |
EQN_MSG(MANDOCERR_EQNSYNT, ep); |
return(EQN_ERR); |
return(EQN_ERR); |
} |
} |
Line 228 eqn_list(struct eqn_node *ep, struct eqn_box *last) |
|
Line 233 eqn_list(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("above", start, 5)) |
if ( ! STRNEQ(start, sz, "above", 5)) |
break; |
break; |
bp->last->above = 1; |
bp->last->above = 1; |
} |
} |
Line 242 eqn_list(struct eqn_node *ep, struct eqn_box *last) |
|
Line 247 eqn_list(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); |
Line 262 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 286 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)) |
|
continue; |
|
if (EQN_OK == (c = eqn_list(ep, last))) |
if (EQN_OK == (c = eqn_list(ep, last))) |
last->last->pile = (enum eqn_pilet)i; |
last->last->pile = (enum eqn_pilet)i; |
return(c); |
return(c); |
} |
} |
|
|
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 315 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 326 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 343 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 360 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 372 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 643 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); |