version 1.32, 2009/07/24 13:18:15 |
version 1.40, 2009/09/24 15:08:41 |
|
|
|
|
#include "libmdoc.h" |
#include "libmdoc.h" |
|
|
|
#define POST_ARGS struct mdoc *m, struct mdoc_node *n |
#define PRE_ARGS struct mdoc *m, const struct mdoc_node *n |
#define PRE_ARGS struct mdoc *m, const struct mdoc_node *n |
#define POST_ARGS struct mdoc *m |
|
|
|
struct actions { |
struct actions { |
int (*pre)(PRE_ARGS); |
int (*pre)(PRE_ARGS); |
int (*post)(POST_ARGS); |
int (*post)(POST_ARGS); |
}; |
}; |
|
|
|
static int concat(struct mdoc *, |
|
const struct mdoc_node *, |
|
char *, size_t); |
|
static inline int order_rs(int); |
|
|
|
#ifdef __linux__ |
|
extern size_t strlcat(char *, const char *, size_t); |
|
#endif |
|
|
static int post_ar(POST_ARGS); |
static int post_ar(POST_ARGS); |
static int post_at(POST_ARGS); |
static int post_at(POST_ARGS); |
static int post_bl(POST_ARGS); |
static int post_bl(POST_ARGS); |
Line 45 static int post_lb(POST_ARGS); |
|
Line 54 static int post_lb(POST_ARGS); |
|
static int post_nm(POST_ARGS); |
static int post_nm(POST_ARGS); |
static int post_os(POST_ARGS); |
static int post_os(POST_ARGS); |
static int post_prol(POST_ARGS); |
static int post_prol(POST_ARGS); |
|
static int post_rs(POST_ARGS); |
static int post_sh(POST_ARGS); |
static int post_sh(POST_ARGS); |
static int post_st(POST_ARGS); |
static int post_st(POST_ARGS); |
static int post_std(POST_ARGS); |
static int post_std(POST_ARGS); |
static int post_tilde(POST_ARGS); |
static int post_tilde(POST_ARGS); |
|
|
static int pre_bd(PRE_ARGS); |
static int pre_bd(PRE_ARGS); |
|
static int pre_bl(PRE_ARGS); |
static int pre_dl(PRE_ARGS); |
static int pre_dl(PRE_ARGS); |
|
static int pre_offset(PRE_ARGS); |
|
|
const struct actions mdoc_actions[MDOC_MAX] = { |
static const struct actions mdoc_actions[MDOC_MAX] = { |
{ NULL, NULL }, /* Ap */ |
{ NULL, NULL }, /* Ap */ |
{ NULL, post_dd }, /* Dd */ |
{ NULL, post_dd }, /* Dd */ |
{ NULL, post_dt }, /* Dt */ |
{ NULL, post_dt }, /* Dt */ |
Line 65 const struct actions mdoc_actions[MDOC_MAX] = { |
|
Line 77 const struct actions mdoc_actions[MDOC_MAX] = { |
|
{ pre_dl, post_display }, /* Dl */ |
{ pre_dl, post_display }, /* Dl */ |
{ pre_bd, post_display }, /* Bd */ |
{ pre_bd, post_display }, /* Bd */ |
{ NULL, NULL }, /* Ed */ |
{ NULL, NULL }, /* Ed */ |
{ NULL, post_bl }, /* Bl */ |
{ pre_bl, post_bl }, /* Bl */ |
{ NULL, NULL }, /* El */ |
{ NULL, NULL }, /* El */ |
{ NULL, NULL }, /* It */ |
{ NULL, NULL }, /* It */ |
{ NULL, NULL }, /* Ad */ |
{ NULL, NULL }, /* Ad */ |
{ NULL, NULL }, /* An */ |
{ NULL, NULL }, /* An */ |
{ NULL, post_ar }, /* Ar */ |
{ NULL, post_ar }, /* Ar */ |
{ NULL, NULL }, /* Cd */ /* FIXME: tabs are accepted! */ |
{ NULL, NULL }, /* Cd */ |
{ NULL, NULL }, /* Cm */ |
{ NULL, NULL }, /* Cm */ |
{ NULL, NULL }, /* Dv */ |
{ NULL, NULL }, /* Dv */ |
{ NULL, NULL }, /* Er */ |
{ NULL, NULL }, /* Er */ |
Line 139 const struct actions mdoc_actions[MDOC_MAX] = { |
|
Line 151 const struct actions mdoc_actions[MDOC_MAX] = { |
|
{ NULL, NULL }, /* Qo */ |
{ NULL, NULL }, /* Qo */ |
{ NULL, NULL }, /* Qq */ |
{ NULL, NULL }, /* Qq */ |
{ NULL, NULL }, /* Re */ |
{ NULL, NULL }, /* Re */ |
{ NULL, NULL }, /* Rs */ |
{ NULL, post_rs }, /* Rs */ |
{ NULL, NULL }, /* Sc */ |
{ NULL, NULL }, /* Sc */ |
{ NULL, NULL }, /* So */ |
{ NULL, NULL }, /* So */ |
{ NULL, NULL }, /* Sq */ |
{ NULL, NULL }, /* Sq */ |
Line 176 const struct actions mdoc_actions[MDOC_MAX] = { |
|
Line 188 const struct actions mdoc_actions[MDOC_MAX] = { |
|
{ NULL, NULL }, /* sp */ |
{ NULL, NULL }, /* sp */ |
}; |
}; |
|
|
static int concat(struct mdoc *, const struct mdoc_node *, |
#define RSORD_MAX 13 |
char *, size_t); |
|
|
|
#ifdef __linux__ |
static const int rsord[RSORD_MAX] = { |
extern size_t strlcat(char *, const char *, size_t); |
MDOC__A, |
#endif |
MDOC__T, |
|
MDOC__B, |
|
MDOC__I, |
|
MDOC__J, |
|
MDOC__R, |
|
MDOC__N, |
|
MDOC__V, |
|
MDOC__P, |
|
MDOC__Q, |
|
MDOC__D, |
|
MDOC__O, |
|
MDOC__C |
|
}; |
|
|
|
|
int |
int |
Line 222 mdoc_action_post(struct mdoc *m) |
|
Line 245 mdoc_action_post(struct mdoc *m) |
|
|
|
if (NULL == mdoc_actions[m->last->tok].post) |
if (NULL == mdoc_actions[m->last->tok].post) |
return(1); |
return(1); |
return((*mdoc_actions[m->last->tok].post)(m)); |
return((*mdoc_actions[m->last->tok].post)(m, m->last)); |
} |
} |
|
|
|
|
Line 248 concat(struct mdoc *m, const struct mdoc_node *n, |
|
Line 271 concat(struct mdoc *m, const struct mdoc_node *n, |
|
static int |
static int |
post_std(POST_ARGS) |
post_std(POST_ARGS) |
{ |
{ |
|
struct mdoc_node *nn; |
|
|
/* |
if (n->child) |
* If '-std' is invoked without an argument, fill it in with our |
|
* name (if it's been set). |
|
*/ |
|
|
|
if (NULL == m->last->args) |
|
return(1); |
return(1); |
if (m->last->args->argv[0].sz) |
|
return(1); |
nn = n; |
|
m->next = MDOC_NEXT_CHILD; |
assert(m->meta.name); |
assert(m->meta.name); |
|
if ( ! mdoc_word_alloc(m, n->line, n->pos, m->meta.name)) |
|
return(0); |
|
m->last = nn; |
|
|
m->last->args->argv[0].value = calloc(1, sizeof(char *)); |
|
if (NULL == m->last->args->argv[0].value) |
|
return(mdoc_nerr(m, m->last, EMALLOC)); |
|
|
|
m->last->args->argv[0].sz = 1; |
|
m->last->args->argv[0].value[0] = strdup(m->meta.name); |
|
if (NULL == m->last->args->argv[0].value[0]) |
|
return(mdoc_nerr(m, m->last, EMALLOC)); |
|
|
|
return(1); |
return(1); |
} |
} |
|
|
Line 283 post_nm(POST_ARGS) |
|
Line 296 post_nm(POST_ARGS) |
|
return(1); |
return(1); |
|
|
buf[0] = 0; |
buf[0] = 0; |
if ( ! concat(m, m->last->child, buf, sizeof(buf))) |
if ( ! concat(m, n->child, buf, sizeof(buf))) |
return(0); |
return(0); |
|
|
if (NULL == (m->meta.name = strdup(buf))) |
if (NULL == (m->meta.name = strdup(buf))) |
return(mdoc_nerr(m, m->last, EMALLOC)); |
return(mdoc_nerr(m, n, EMALLOC)); |
|
|
return(1); |
return(1); |
} |
} |
Line 300 post_lb(POST_ARGS) |
|
Line 312 post_lb(POST_ARGS) |
|
char *buf; |
char *buf; |
size_t sz; |
size_t sz; |
|
|
assert(MDOC_TEXT == m->last->child->type); |
assert(MDOC_TEXT == n->child->type); |
p = mdoc_a2lib(m->last->child->string); |
p = mdoc_a2lib(n->child->string); |
if (NULL == p) { |
if (NULL == p) { |
sz = strlen(m->last->child->string) + |
sz = strlen(n->child->string) + |
2 + strlen("\\(lqlibrary\\(rq"); |
2 + strlen("\\(lqlibrary\\(rq"); |
buf = malloc(sz); |
buf = malloc(sz); |
if (NULL == buf) |
if (NULL == buf) |
return(mdoc_nerr(m, m->last, EMALLOC)); |
return(mdoc_nerr(m, n, EMALLOC)); |
(void)snprintf(buf, sz, "library \\(lq%s\\(rq", |
(void)snprintf(buf, sz, "library \\(lq%s\\(rq", |
m->last->child->string); |
n->child->string); |
free(m->last->child->string); |
free(n->child->string); |
m->last->child->string = buf; |
n->child->string = buf; |
return(1); |
return(1); |
} |
} |
|
|
free(m->last->child->string); |
free(n->child->string); |
m->last->child->string = strdup(p); |
n->child->string = strdup(p); |
if (NULL == m->last->child->string) |
if (NULL == n->child->string) |
return(mdoc_nerr(m, m->last, EMALLOC)); |
return(mdoc_nerr(m, n, EMALLOC)); |
|
|
return(1); |
return(1); |
} |
} |
|
|
Line 328 post_st(POST_ARGS) |
|
Line 341 post_st(POST_ARGS) |
|
{ |
{ |
const char *p; |
const char *p; |
|
|
assert(MDOC_TEXT == m->last->child->type); |
assert(MDOC_TEXT == n->child->type); |
p = mdoc_a2st(m->last->child->string); |
p = mdoc_a2st(n->child->string); |
assert(p); |
assert(p); |
free(m->last->child->string); |
free(n->child->string); |
m->last->child->string = strdup(p); |
n->child->string = strdup(p); |
if (NULL == m->last->child->string) |
if (NULL == n->child->string) |
return(mdoc_nerr(m, m->last, EMALLOC)); |
return(mdoc_nerr(m, n, EMALLOC)); |
|
|
return(1); |
return(1); |
} |
} |
|
|
Line 342 post_st(POST_ARGS) |
|
Line 356 post_st(POST_ARGS) |
|
static int |
static int |
post_at(POST_ARGS) |
post_at(POST_ARGS) |
{ |
{ |
struct mdoc_node *n; |
struct mdoc_node *nn; |
const char *p; |
const char *p; |
|
|
if (m->last->child) { |
if (n->child) { |
assert(MDOC_TEXT == m->last->child->type); |
assert(MDOC_TEXT == n->child->type); |
p = mdoc_a2att(m->last->child->string); |
p = mdoc_a2att(n->child->string); |
assert(p); |
assert(p); |
free(m->last->child->string); |
free(n->child->string); |
m->last->child->string = strdup(p); |
n->child->string = strdup(p); |
if (NULL == m->last->child->string) |
if (NULL == n->child->string) |
return(mdoc_nerr(m, m->last, EMALLOC)); |
return(mdoc_nerr(m, n, EMALLOC)); |
return(1); |
return(1); |
} |
} |
|
|
n = m->last; |
nn = n; |
m->next = MDOC_NEXT_CHILD; |
m->next = MDOC_NEXT_CHILD; |
|
|
if ( ! mdoc_word_alloc(m, n->line, n->pos, "AT&T UNIX")) |
if ( ! mdoc_word_alloc(m, nn->line, nn->pos, "AT&T UNIX")) |
return(0); |
return(0); |
|
m->last = nn; |
|
|
m->last = n; |
|
m->next = MDOC_NEXT_SIBLING; |
|
return(1); |
return(1); |
} |
} |
|
|
Line 380 post_sh(POST_ARGS) |
|
Line 393 post_sh(POST_ARGS) |
|
* check ordering. |
* check ordering. |
*/ |
*/ |
|
|
if (MDOC_HEAD != m->last->type) |
if (MDOC_HEAD != n->type) |
return(1); |
return(1); |
|
|
buf[0] = 0; |
buf[0] = 0; |
if ( ! concat(m, m->last->child, buf, sizeof(buf))) |
if ( ! concat(m, n->child, buf, sizeof(buf))) |
return(0); |
return(0); |
if (SEC_CUSTOM != (sec = mdoc_atosec(buf))) |
if (SEC_CUSTOM != (sec = mdoc_atosec(buf))) |
m->lastnamed = sec; |
m->lastnamed = sec; |
Line 401 post_sh(POST_ARGS) |
|
Line 414 post_sh(POST_ARGS) |
|
case (9): |
case (9): |
break; |
break; |
default: |
default: |
return(mdoc_nwarn(m, m->last, EBADSEC)); |
return(mdoc_nwarn(m, n, EBADSEC)); |
} |
} |
break; |
break; |
default: |
default: |
Line 414 post_sh(POST_ARGS) |
|
Line 427 post_sh(POST_ARGS) |
|
static int |
static int |
post_dt(POST_ARGS) |
post_dt(POST_ARGS) |
{ |
{ |
struct mdoc_node *n; |
struct mdoc_node *nn; |
const char *cp; |
const char *cp; |
char *ep; |
char *ep; |
long lval; |
long lval; |
Line 433 post_dt(POST_ARGS) |
|
Line 446 post_dt(POST_ARGS) |
|
* --> title = unknown, volume = local, msec = 0, arch = NULL |
* --> title = unknown, volume = local, msec = 0, arch = NULL |
*/ |
*/ |
|
|
if (NULL == (n = m->last->child)) { |
if (NULL == (nn = n->child)) { |
if (NULL == (m->meta.title = strdup("unknown"))) |
if (NULL == (m->meta.title = strdup("unknown"))) |
return(mdoc_nerr(m, m->last, EMALLOC)); |
return(mdoc_nerr(m, n, EMALLOC)); |
if (NULL == (m->meta.vol = strdup("local"))) |
if (NULL == (m->meta.vol = strdup("local"))) |
return(mdoc_nerr(m, m->last, EMALLOC)); |
return(mdoc_nerr(m, n, EMALLOC)); |
return(post_prol(m)); |
return(post_prol(m, n)); |
} |
} |
|
|
/* Handles: `.Dt TITLE' |
/* Handles: `.Dt TITLE' |
* --> title = TITLE, volume = local, msec = 0, arch = NULL |
* --> title = TITLE, volume = local, msec = 0, arch = NULL |
*/ |
*/ |
|
|
if (NULL == (m->meta.title = strdup(n->string))) |
if (NULL == (m->meta.title = strdup(nn->string))) |
return(mdoc_nerr(m, m->last, EMALLOC)); |
return(mdoc_nerr(m, n, EMALLOC)); |
|
|
if (NULL == (n = n->next)) { |
if (NULL == (nn = nn->next)) { |
if (NULL == (m->meta.vol = strdup("local"))) |
if (NULL == (m->meta.vol = strdup("local"))) |
return(mdoc_nerr(m, m->last, EMALLOC)); |
return(mdoc_nerr(m, n, EMALLOC)); |
return(post_prol(m)); |
return(post_prol(m, n)); |
} |
} |
|
|
/* Handles: `.Dt TITLE SEC' |
/* Handles: `.Dt TITLE SEC' |
Line 461 post_dt(POST_ARGS) |
|
Line 474 post_dt(POST_ARGS) |
|
* arch = NULL |
* arch = NULL |
*/ |
*/ |
|
|
cp = mdoc_a2msec(n->string); |
cp = mdoc_a2msec(nn->string); |
if (cp) { |
if (cp) { |
if (NULL == (m->meta.vol = strdup(cp))) |
if (NULL == (m->meta.vol = strdup(cp))) |
return(mdoc_nerr(m, m->last, EMALLOC)); |
return(mdoc_nerr(m, n, EMALLOC)); |
errno = 0; |
errno = 0; |
lval = strtol(n->string, &ep, 10); |
lval = strtol(nn->string, &ep, 10); |
if (n->string[0] != '\0' && *ep == '\0') |
if (nn->string[0] != '\0' && *ep == '\0') |
m->meta.msec = (int)lval; |
m->meta.msec = (int)lval; |
} else if (NULL == (m->meta.vol = strdup(n->string))) |
} else if (NULL == (m->meta.vol = strdup(nn->string))) |
return(mdoc_nerr(m, m->last, EMALLOC)); |
return(mdoc_nerr(m, n, EMALLOC)); |
|
|
if (NULL == (n = n->next)) |
if (NULL == (nn = nn->next)) |
return(post_prol(m)); |
return(post_prol(m, n)); |
|
|
/* Handles: `.Dt TITLE SEC VOL' |
/* Handles: `.Dt TITLE SEC VOL' |
* --> title = TITLE, volume = VOL is vol ? |
* --> title = TITLE, volume = VOL is vol ? |
Line 482 post_dt(POST_ARGS) |
|
Line 495 post_dt(POST_ARGS) |
|
* VOL |
* VOL |
*/ |
*/ |
|
|
cp = mdoc_a2vol(n->string); |
cp = mdoc_a2vol(nn->string); |
if (cp) { |
if (cp) { |
free(m->meta.vol); |
free(m->meta.vol); |
if (NULL == (m->meta.vol = strdup(cp))) |
if (NULL == (m->meta.vol = strdup(cp))) |
return(mdoc_nerr(m, m->last, EMALLOC)); |
return(mdoc_nerr(m, n, EMALLOC)); |
n = n->next; |
|
} else { |
} else { |
cp = mdoc_a2arch(n->string); |
cp = mdoc_a2arch(nn->string); |
if (NULL == cp) { |
if (NULL == cp) { |
free(m->meta.vol); |
free(m->meta.vol); |
if (NULL == (m->meta.vol = strdup(n->string))) |
if (NULL == (m->meta.vol = strdup(nn->string))) |
return(mdoc_nerr(m, m->last, EMALLOC)); |
return(mdoc_nerr(m, n, EMALLOC)); |
} else if (NULL == (m->meta.arch = strdup(cp))) |
} else if (NULL == (m->meta.arch = strdup(cp))) |
return(mdoc_nerr(m, m->last, EMALLOC)); |
return(mdoc_nerr(m, n, EMALLOC)); |
} |
} |
|
|
/* Ignore any subsequent parameters... */ |
/* Ignore any subsequent parameters... */ |
|
|
return(post_prol(m)); |
return(post_prol(m, n)); |
} |
} |
|
|
|
|
Line 514 post_os(POST_ARGS) |
|
Line 526 post_os(POST_ARGS) |
|
free(m->meta.os); |
free(m->meta.os); |
|
|
buf[0] = 0; |
buf[0] = 0; |
if ( ! concat(m, m->last->child, buf, sizeof(buf))) |
if ( ! concat(m, n->child, buf, sizeof(buf))) |
return(0); |
return(0); |
|
|
if (0 == buf[0]) { |
if (0 == buf[0]) { |
if (-1 == uname(&utsname)) |
if (-1 == uname(&utsname)) |
return(mdoc_nerr(m, m->last, EUTSNAME)); |
return(mdoc_nerr(m, n, EUTSNAME)); |
if (strlcat(buf, utsname.sysname, 64) >= 64) |
if (strlcat(buf, utsname.sysname, 64) >= 64) |
return(mdoc_nerr(m, m->last, ETOOLONG)); |
return(mdoc_nerr(m, n, ETOOLONG)); |
if (strlcat(buf, " ", 64) >= 64) |
if (strlcat(buf, " ", 64) >= 64) |
return(mdoc_nerr(m, m->last, ETOOLONG)); |
return(mdoc_nerr(m, n, ETOOLONG)); |
if (strlcat(buf, utsname.release, 64) >= 64) |
if (strlcat(buf, utsname.release, 64) >= 64) |
return(mdoc_nerr(m, m->last, ETOOLONG)); |
return(mdoc_nerr(m, n, ETOOLONG)); |
} |
} |
|
|
if (NULL == (m->meta.os = strdup(buf))) |
if (NULL == (m->meta.os = strdup(buf))) |
return(mdoc_nerr(m, m->last, EMALLOC)); |
return(mdoc_nerr(m, n, EMALLOC)); |
|
|
m->flags |= MDOC_PBODY; |
return(post_prol(m, n)); |
return(post_prol(m)); |
|
} |
} |
|
|
|
|
Line 541 post_os(POST_ARGS) |
|
Line 552 post_os(POST_ARGS) |
|
* Uses the first head macro. |
* Uses the first head macro. |
*/ |
*/ |
static int |
static int |
post_bl_tagwidth(struct mdoc *m) |
post_bl_tagwidth(POST_ARGS) |
{ |
{ |
struct mdoc_node *n; |
struct mdoc_node *nn; |
int sz; |
int sz; |
char buf[32]; |
char buf[32]; |
|
|
Line 552 post_bl_tagwidth(struct mdoc *m) |
|
Line 563 post_bl_tagwidth(struct mdoc *m) |
|
* width if a macro. |
* width if a macro. |
*/ |
*/ |
|
|
n = m->last->body->child; |
nn = n->body->child; |
if (n) { |
if (nn) { |
assert(MDOC_BLOCK == n->type); |
assert(MDOC_BLOCK == nn->type); |
assert(MDOC_It == n->tok); |
assert(MDOC_It == nn->tok); |
n = n->head->child; |
nn = nn->head->child; |
} |
} |
|
|
sz = 10; /* Default size. */ |
sz = 10; /* Default size. */ |
|
|
if (n) { |
if (nn) { |
if (MDOC_TEXT != n->type) { |
if (MDOC_TEXT != nn->type) { |
if (0 == (sz = (int)mdoc_macro2len(n->tok))) |
if (0 == (sz = (int)mdoc_macro2len(nn->tok))) |
if ( ! mdoc_nwarn(m, m->last, ENOWIDTH)) |
if ( ! mdoc_nwarn(m, n, ENOWIDTH)) |
return(0); |
return(0); |
} else |
} else |
sz = (int)strlen(n->string) + 1; |
sz = (int)strlen(nn->string) + 1; |
} |
} |
|
|
if (-1 == snprintf(buf, sizeof(buf), "%dn", sz)) |
if (-1 == snprintf(buf, sizeof(buf), "%dn", sz)) |
return(mdoc_nerr(m, m->last, ENUMFMT)); |
return(mdoc_nerr(m, n, ENUMFMT)); |
|
|
/* |
/* |
* We have to dynamically add this to the macro's argument list. |
* We have to dynamically add this to the macro's argument list. |
* We're guaranteed that a MDOC_Width doesn't already exist. |
* We're guaranteed that a MDOC_Width doesn't already exist. |
*/ |
*/ |
|
|
n = m->last; |
nn = n; |
assert(n->args); |
assert(nn->args); |
sz = (int)(n->args->argc)++; |
sz = (int)(nn->args->argc)++; |
|
|
n->args->argv = realloc(n->args->argv, |
nn->args->argv = realloc(nn->args->argv, |
n->args->argc * sizeof(struct mdoc_argv)); |
nn->args->argc * sizeof(struct mdoc_argv)); |
|
|
if (NULL == n->args->argv) |
if (NULL == nn->args->argv) |
return(mdoc_nerr(m, m->last, EMALLOC)); |
return(mdoc_nerr(m, n, EMALLOC)); |
|
|
n->args->argv[sz].arg = MDOC_Width; |
nn->args->argv[sz].arg = MDOC_Width; |
n->args->argv[sz].line = m->last->line; |
nn->args->argv[sz].line = n->line; |
n->args->argv[sz].pos = m->last->pos; |
nn->args->argv[sz].pos = n->pos; |
n->args->argv[sz].sz = 1; |
nn->args->argv[sz].sz = 1; |
n->args->argv[sz].value = calloc(1, sizeof(char *)); |
nn->args->argv[sz].value = calloc(1, sizeof(char *)); |
|
|
if (NULL == n->args->argv[sz].value) |
if (NULL == nn->args->argv[sz].value) |
return(mdoc_nerr(m, m->last, EMALLOC)); |
return(mdoc_nerr(m, n, EMALLOC)); |
if (NULL == (n->args->argv[sz].value[0] = strdup(buf))) |
if (NULL == (nn->args->argv[sz].value[0] = strdup(buf))) |
return(mdoc_nerr(m, m->last, EMALLOC)); |
return(mdoc_nerr(m, n, EMALLOC)); |
|
|
return(1); |
return(1); |
} |
} |
|
|
|
|
static int |
static int |
post_bl_width(struct mdoc *m) |
post_bl_width(POST_ARGS) |
{ |
{ |
size_t width; |
size_t width; |
int i, tok; |
int i, tok; |
char buf[32]; |
char buf[32]; |
char *p; |
char *p; |
|
|
if (NULL == m->last->args) |
if (NULL == n->args) |
return(1); |
return(1); |
|
|
for (i = 0; i < (int)m->last->args->argc; i++) |
for (i = 0; i < (int)n->args->argc; i++) |
if (MDOC_Width == m->last->args->argv[i].arg) |
if (MDOC_Width == n->args->argv[i].arg) |
break; |
break; |
|
|
if (i == (int)m->last->args->argc) |
if (i == (int)n->args->argc) |
return(1); |
return(1); |
p = m->last->args->argv[i].value[0]; |
p = n->args->argv[i].value[0]; |
|
|
/* |
/* |
* If the value to -width is a macro, then we re-write it to be |
* If the value to -width is a macro, then we re-write it to be |
Line 629 post_bl_width(struct mdoc *m) |
|
Line 640 post_bl_width(struct mdoc *m) |
|
|
|
if (0 == strcmp(p, "Ds")) |
if (0 == strcmp(p, "Ds")) |
width = 6; |
width = 6; |
else if (MDOC_MAX == (tok = mdoc_hash_find(m->htab, p))) |
else if (MDOC_MAX == (tok = mdoc_hash_find(p))) |
return(1); |
return(1); |
else if (0 == (width = mdoc_macro2len(tok))) |
else if (0 == (width = mdoc_macro2len(tok))) |
return(mdoc_nwarn(m, m->last, ENOWIDTH)); |
return(mdoc_nwarn(m, n, ENOWIDTH)); |
|
|
/* The value already exists: free and reallocate it. */ |
/* The value already exists: free and reallocate it. */ |
|
|
if (-1 == snprintf(buf, sizeof(buf), "%zun", width)) |
if (-1 == snprintf(buf, sizeof(buf), "%zun", width)) |
return(mdoc_nerr(m, m->last, ENUMFMT)); |
return(mdoc_nerr(m, n, ENUMFMT)); |
|
|
free(m->last->args->argv[i].value[0]); |
free(n->args->argv[i].value[0]); |
m->last->args->argv[i].value[0] = strdup(buf); |
n->args->argv[i].value[0] = strdup(buf); |
if (NULL == m->last->args->argv[i].value[0]) |
if (NULL == n->args->argv[i].value[0]) |
return(mdoc_nerr(m, m->last, EMALLOC)); |
return(mdoc_nerr(m, n, EMALLOC)); |
|
|
return(1); |
return(1); |
} |
} |
|
|
|
|
|
/* ARGSUSED */ |
static int |
static int |
post_bl_head(POST_ARGS) |
post_bl_head(POST_ARGS) |
{ |
{ |
int i, c; |
int i, c; |
struct mdoc_node *n, *nn, *nnp; |
struct mdoc_node *np, *nn, *nnp; |
|
|
if (NULL == m->last->child) |
if (NULL == n->child) |
return(1); |
return(1); |
|
|
n = m->last->parent; |
np = n->parent; |
assert(n->args); |
assert(np->args); |
|
|
for (c = 0; c < (int)n->args->argc; c++) |
for (c = 0; c < (int)np->args->argc; c++) |
if (MDOC_Column == n->args->argv[c].arg) |
if (MDOC_Column == np->args->argv[c].arg) |
break; |
break; |
|
|
/* Only process -column. */ |
/* Only process -column. */ |
|
|
if (c == (int)n->args->argc) |
if (c == (int)np->args->argc) |
return(1); |
return(1); |
|
|
assert(0 == n->args->argv[c].sz); |
assert(0 == np->args->argv[c].sz); |
|
|
/* |
/* |
* Accomodate for new-style groff column syntax. Shuffle the |
* Accomodate for new-style groff column syntax. Shuffle the |
Line 677 post_bl_head(POST_ARGS) |
|
Line 689 post_bl_head(POST_ARGS) |
|
* column field. Then, delete the head children. |
* column field. Then, delete the head children. |
*/ |
*/ |
|
|
n->args->argv[c].sz = (size_t)m->last->nchild; |
np->args->argv[c].sz = (size_t)n->nchild; |
n->args->argv[c].value = malloc |
np->args->argv[c].value = malloc |
((size_t)m->last->nchild * sizeof(char *)); |
((size_t)n->nchild * sizeof(char *)); |
|
|
for (i = 0, nn = m->last->child; nn; i++) { |
for (i = 0, nn = n->child; nn; i++) { |
n->args->argv[c].value[i] = nn->string; |
np->args->argv[c].value[i] = nn->string; |
nn->string = NULL; |
nn->string = NULL; |
nnp = nn; |
nnp = nn; |
nn = nn->next; |
nn = nn->next; |
mdoc_node_free(nnp); |
mdoc_node_free(nnp); |
} |
} |
|
|
m->last->nchild = 0; |
n->nchild = 0; |
m->last->child = NULL; |
n->child = NULL; |
|
|
return(1); |
return(1); |
} |
} |
Line 701 post_bl(POST_ARGS) |
|
Line 713 post_bl(POST_ARGS) |
|
{ |
{ |
int i, r, len; |
int i, r, len; |
|
|
if (MDOC_HEAD == m->last->type) |
if (MDOC_HEAD == n->type) |
return(post_bl_head(m)); |
return(post_bl_head(m, n)); |
if (MDOC_BLOCK != m->last->type) |
if (MDOC_BLOCK != n->type) |
return(1); |
return(1); |
|
|
/* |
/* |
Line 714 post_bl(POST_ARGS) |
|
Line 726 post_bl(POST_ARGS) |
|
* rewritten into real lengths). |
* rewritten into real lengths). |
*/ |
*/ |
|
|
len = (int)(m->last->args ? m->last->args->argc : 0); |
len = (int)(n->args ? n->args->argc : 0); |
|
|
for (r = i = 0; i < len; i++) { |
for (r = i = 0; i < len; i++) { |
if (MDOC_Tag == m->last->args->argv[i].arg) |
if (MDOC_Tag == n->args->argv[i].arg) |
r |= 1 << 0; |
r |= 1 << 0; |
if (MDOC_Width == m->last->args->argv[i].arg) |
if (MDOC_Width == n->args->argv[i].arg) |
r |= 1 << 1; |
r |= 1 << 1; |
} |
} |
|
|
if (r & (1 << 0) && ! (r & (1 << 1))) { |
if (r & (1 << 0) && ! (r & (1 << 1))) { |
if ( ! post_bl_tagwidth(m)) |
if ( ! post_bl_tagwidth(m, n)) |
return(0); |
return(0); |
} else if (r & (1 << 1)) |
} else if (r & (1 << 1)) |
if ( ! post_bl_width(m)) |
if ( ! post_bl_width(m, n)) |
return(0); |
return(0); |
|
|
return(1); |
return(1); |
Line 737 post_bl(POST_ARGS) |
|
Line 749 post_bl(POST_ARGS) |
|
static int |
static int |
post_tilde(POST_ARGS) |
post_tilde(POST_ARGS) |
{ |
{ |
struct mdoc_node *n; |
struct mdoc_node *np; |
|
|
if (m->last->child) |
if (n->child) |
return(1); |
return(1); |
|
|
n = m->last; |
np = n; |
m->next = MDOC_NEXT_CHILD; |
m->next = MDOC_NEXT_CHILD; |
|
|
/* XXX: not documented for `Lk'. */ |
/* XXX: not documented for `Lk'. */ |
if ( ! mdoc_word_alloc(m, m->last->line, m->last->pos, "~")) |
if ( ! mdoc_word_alloc(m, n->line, n->pos, "~")) |
return(0); |
return(0); |
|
m->last = np; |
|
|
m->last = n; |
|
m->next = MDOC_NEXT_SIBLING; |
|
return(1); |
return(1); |
} |
} |
|
|
Line 758 post_tilde(POST_ARGS) |
|
Line 769 post_tilde(POST_ARGS) |
|
static int |
static int |
post_ar(POST_ARGS) |
post_ar(POST_ARGS) |
{ |
{ |
struct mdoc_node *n; |
struct mdoc_node *np; |
|
|
if (m->last->child) |
if (n->child) |
return(1); |
return(1); |
|
|
n = m->last; |
np = n; |
m->next = MDOC_NEXT_CHILD; |
m->next = MDOC_NEXT_CHILD; |
if ( ! mdoc_word_alloc(m, m->last->line, m->last->pos, "file")) |
if ( ! mdoc_word_alloc(m, n->line, n->pos, "file")) |
return(0); |
return(0); |
m->next = MDOC_NEXT_SIBLING; |
if ( ! mdoc_word_alloc(m, n->line, n->pos, "...")) |
if ( ! mdoc_word_alloc(m, m->last->line, m->last->pos, "...")) |
|
return(0); |
return(0); |
|
m->last = np; |
|
|
m->last = n; |
|
m->next = MDOC_NEXT_SIBLING; |
|
return(1); |
return(1); |
} |
} |
|
|
Line 783 post_dd(POST_ARGS) |
|
Line 792 post_dd(POST_ARGS) |
|
char buf[64]; |
char buf[64]; |
|
|
buf[0] = 0; |
buf[0] = 0; |
if ( ! concat(m, m->last->child, buf, sizeof(buf))) |
if ( ! concat(m, n->child, buf, sizeof(buf))) |
return(0); |
return(0); |
|
|
if (0 == (m->meta.date = mdoc_atotime(buf))) { |
if (0 == (m->meta.date = mdoc_atotime(buf))) { |
if ( ! mdoc_nwarn(m, m->last, EBADDATE)) |
if ( ! mdoc_nwarn(m, n, EBADDATE)) |
return(0); |
return(0); |
m->meta.date = time(NULL); |
m->meta.date = time(NULL); |
} |
} |
|
|
return(post_prol(m)); |
return(post_prol(m, n)); |
} |
} |
|
|
|
|
static int |
static int |
post_prol(POST_ARGS) |
post_prol(POST_ARGS) |
{ |
{ |
struct mdoc_node *n; |
struct mdoc_node *np; |
|
|
/* |
/* Remove prologue macros from AST. */ |
* The end document shouldn't have the prologue macros as part |
|
* of the syntax tree (they encompass only meta-data). |
|
*/ |
|
|
|
if (m->last->parent->child == m->last) |
if (n->parent->child == n) |
m->last->parent->child = m->last->prev; |
n->parent->child = n->prev; |
if (m->last->prev) |
if (n->prev) |
m->last->prev->next = NULL; |
n->prev->next = NULL; |
|
|
n = m->last; |
np = n; |
assert(NULL == m->last->next); |
assert(NULL == n->next); |
|
|
if (m->last->prev) { |
if (n->prev) { |
m->last = m->last->prev; |
m->last = n->prev; |
m->next = MDOC_NEXT_SIBLING; |
m->next = MDOC_NEXT_SIBLING; |
} else { |
} else { |
m->last = m->last->parent; |
m->last = n->parent; |
m->next = MDOC_NEXT_CHILD; |
m->next = MDOC_NEXT_CHILD; |
} |
} |
|
|
mdoc_node_freelist(n); |
mdoc_node_freelist(np); |
|
|
|
if (m->meta.title && m->meta.date && m->meta.os) |
|
m->flags |= MDOC_PBODY; |
|
|
return(1); |
return(1); |
} |
} |
|
|
Line 838 pre_dl(PRE_ARGS) |
|
Line 848 pre_dl(PRE_ARGS) |
|
|
|
|
|
static int |
static int |
|
pre_offset(PRE_ARGS) |
|
{ |
|
int i; |
|
|
|
/* |
|
* Make sure that an empty offset produces an 8n length space as |
|
* stipulated by mdoc.samples. |
|
*/ |
|
|
|
assert(n->args); |
|
for (i = 0; i < (int)n->args->argc; i++) { |
|
if (MDOC_Offset != n->args->argv[i].arg) |
|
continue; |
|
if (n->args->argv[i].sz) |
|
break; |
|
assert(1 == n->args->refcnt); |
|
/* If no value set, length of <string>. */ |
|
n->args->argv[i].value = |
|
calloc(1, sizeof(char *)); |
|
if (NULL == n->args->argv[i].value) |
|
return(mdoc_nerr(m, n, EMALLOC)); |
|
n->args->argv[i].sz++; |
|
n->args->argv[i].value[0] = strdup("8n"); |
|
if (NULL == n->args->argv[i].value[0]) |
|
return(mdoc_nerr(m, n, EMALLOC)); |
|
break; |
|
} |
|
|
|
return(1); |
|
} |
|
|
|
|
|
static int |
|
pre_bl(PRE_ARGS) |
|
{ |
|
|
|
return(MDOC_BLOCK == n->type ? pre_offset(m, n) : 1); |
|
} |
|
|
|
|
|
static int |
pre_bd(PRE_ARGS) |
pre_bd(PRE_ARGS) |
{ |
{ |
int i; |
int i; |
|
|
|
if (MDOC_BLOCK == n->type) |
|
return(pre_offset(m, n)); |
if (MDOC_BODY != n->type) |
if (MDOC_BODY != n->type) |
return(1); |
return(1); |
|
|
/* Enter literal context if `Bd -literal' or `-unfilled'. */ |
/* Enter literal context if `Bd -literal' or `-unfilled'. */ |
|
|
/* |
|
* TODO: `-offset' without an argument should be the width of |
|
* the literal "<string>". |
|
*/ |
|
|
|
for (n = n->parent, i = 0; i < (int)n->args->argc; i++) |
for (n = n->parent, i = 0; i < (int)n->args->argc; i++) |
if (MDOC_Literal == n->args->argv[i].arg) |
if (MDOC_Literal == n->args->argv[i].arg) |
break; |
m->flags |= MDOC_LITERAL; |
else if (MDOC_Unfilled == n->args->argv[i].arg) |
else if (MDOC_Unfilled == n->args->argv[i].arg) |
break; |
m->flags |= MDOC_LITERAL; |
|
|
if (i < (int)n->args->argc) |
|
m->flags |= MDOC_LITERAL; |
|
|
|
return(1); |
return(1); |
} |
} |
|
|
|
|
post_display(POST_ARGS) |
post_display(POST_ARGS) |
{ |
{ |
|
|
if (MDOC_BODY == m->last->type) |
if (MDOC_BODY == n->type) |
m->flags &= ~MDOC_LITERAL; |
m->flags &= ~MDOC_LITERAL; |
return(1); |
return(1); |
} |
} |
|
|
|
|
|
static inline int |
|
order_rs(int t) |
|
{ |
|
int i; |
|
|
|
for (i = 0; i < RSORD_MAX; i++) |
|
if (rsord[i] == t) |
|
return(i); |
|
|
|
abort(); |
|
/* NOTREACHED */ |
|
} |
|
|
|
|
|
static int |
|
post_rs(POST_ARGS) |
|
{ |
|
struct mdoc_node *nn, *next, *prev; |
|
int o; |
|
|
|
if (MDOC_BLOCK != n->type) |
|
return(1); |
|
|
|
assert(n->body->child); |
|
for (next = NULL, nn = n->body->child->next; nn; nn = next) { |
|
o = order_rs(nn->tok); |
|
|
|
/* Remove `nn' from the chain. */ |
|
next = nn->next; |
|
if (next) |
|
next->prev = nn->prev; |
|
|
|
prev = nn->prev; |
|
if (prev) |
|
prev->next = nn->next; |
|
|
|
nn->prev = nn->next = NULL; |
|
|
|
/* |
|
* Scan back until we reach a node that's ordered before |
|
* us, then set ourselves as being the next. |
|
*/ |
|
for ( ; prev; prev = prev->prev) |
|
if (order_rs(prev->tok) <= o) |
|
break; |
|
|
|
nn->prev = prev; |
|
if (prev) { |
|
if (prev->next) |
|
prev->next->prev = nn; |
|
nn->next = prev->next; |
|
prev->next = nn; |
|
continue; |
|
} |
|
|
|
n->body->child->prev = nn; |
|
nn->next = n->body->child; |
|
n->body->child = nn; |
|
} |
|
return(1); |
|
} |