version 1.31, 2009/07/12 19:13:12 |
version 1.34, 2009/07/12 20:07:04 |
Line 1070 termp_rv_pre(DECL_ARGS) |
|
Line 1070 termp_rv_pre(DECL_ARGS) |
|
{ |
{ |
int i; |
int i; |
|
|
/* FIXME: mandated by parser. */ |
i = arg_getattr(MDOC_Std, node); |
|
assert(-1 != i); |
|
assert(node->args->argv[i].sz); |
|
|
if (-1 == (i = arg_getattr(MDOC_Std, node))) |
|
errx(1, "expected -std argument"); |
|
if (1 != node->args->argv[i].sz) |
|
errx(1, "expected -std argument"); |
|
|
|
term_newln(p); |
term_newln(p); |
term_word(p, "The"); |
term_word(p, "The"); |
|
|
Line 1105 termp_ex_pre(DECL_ARGS) |
|
Line 1102 termp_ex_pre(DECL_ARGS) |
|
{ |
{ |
int i; |
int i; |
|
|
/* FIXME: mandated by parser? */ |
i = arg_getattr(MDOC_Std, node); |
|
assert(-1 != i); |
|
assert(node->args->argv[i].sz); |
|
|
if (-1 == (i = arg_getattr(MDOC_Std, node))) |
|
errx(1, "expected -std argument"); |
|
if (1 != node->args->argv[i].sz) |
|
errx(1, "expected -std argument"); |
|
|
|
term_word(p, "The"); |
term_word(p, "The"); |
p->flags |= ttypes[TTYPE_PROG]; |
p->flags |= ttypes[TTYPE_PROG]; |
term_word(p, *node->args->argv[i].value); |
term_word(p, *node->args->argv[i].value); |
|
|
termp_vt_post(DECL_ARGS) |
termp_vt_post(DECL_ARGS) |
{ |
{ |
|
|
if (node->sec == SEC_SYNOPSIS) |
if (node->sec != SEC_SYNOPSIS) |
|
return; |
|
if (node->next && MDOC_Vt == node->next->tok) |
|
term_newln(p); |
|
else if (node->next) |
term_vspace(p); |
term_vspace(p); |
} |
} |
|
|
Line 1937 termp_fo_pre(DECL_ARGS) |
|
Line 1935 termp_fo_pre(DECL_ARGS) |
|
const struct mdoc_node *n; |
const struct mdoc_node *n; |
|
|
if (MDOC_BODY == node->type) { |
if (MDOC_BODY == node->type) { |
|
p->flags |= TERMP_NOSPACE; |
term_word(p, "("); |
term_word(p, "("); |
p->flags |= TERMP_NOSPACE; |
p->flags |= TERMP_NOSPACE; |
return(1); |
return(1); |
} else if (MDOC_HEAD != node->type) |
} else if (MDOC_HEAD != node->type) |
return(1); |
return(1); |
|
|
/* XXX - groff shows only first parameter */ |
|
|
|
p->flags |= ttypes[TTYPE_FUNC_NAME]; |
p->flags |= ttypes[TTYPE_FUNC_NAME]; |
for (n = node->child; n; n = n->next) { |
for (n = node->child; n; n = n->next) { |