version 1.34, 2009/10/07 12:19:39 |
version 1.35, 2009/10/08 23:00:15 |
|
|
|
|
static int pre_B(DECL_ARGS); |
static int pre_B(DECL_ARGS); |
static int pre_BI(DECL_ARGS); |
static int pre_BI(DECL_ARGS); |
static int pre_BR(DECL_ARGS); |
|
static int pre_HP(DECL_ARGS); |
static int pre_HP(DECL_ARGS); |
static int pre_I(DECL_ARGS); |
static int pre_I(DECL_ARGS); |
static int pre_IB(DECL_ARGS); |
|
static int pre_IP(DECL_ARGS); |
static int pre_IP(DECL_ARGS); |
static int pre_IR(DECL_ARGS); |
static int pre_IR(DECL_ARGS); |
static int pre_PP(DECL_ARGS); |
static int pre_PP(DECL_ARGS); |
Line 105 static const struct termact termacts[MAN_MAX] = { |
|
Line 103 static const struct termact termacts[MAN_MAX] = { |
|
{ NULL, NULL }, /* SM */ |
{ NULL, NULL }, /* SM */ |
{ pre_B, post_B }, /* SB */ |
{ pre_B, post_B }, /* SB */ |
{ pre_BI, NULL }, /* BI */ |
{ pre_BI, NULL }, /* BI */ |
{ pre_IB, NULL }, /* IB */ |
{ pre_BI, NULL }, /* IB */ |
{ pre_BR, NULL }, /* BR */ |
{ pre_RB, NULL }, /* BR */ |
{ pre_RB, NULL }, /* RB */ |
{ pre_RB, NULL }, /* RB */ |
{ NULL, NULL }, /* R */ |
{ NULL, NULL }, /* R */ |
{ pre_B, post_B }, /* B */ |
{ pre_B, post_B }, /* B */ |
Line 295 pre_IR(DECL_ARGS) |
|
Line 293 pre_IR(DECL_ARGS) |
|
|
|
/* ARGSUSED */ |
/* ARGSUSED */ |
static int |
static int |
pre_IB(DECL_ARGS) |
|
{ |
|
const struct man_node *nn; |
|
int i; |
|
|
|
for (i = 0, nn = n->child; nn; nn = nn->next, i++) { |
|
if (i % 2) |
|
p->bold++; |
|
else |
|
p->under++; |
|
if (i > 0) |
|
p->flags |= TERMP_NOSPACE; |
|
print_node(p, mt, nn, m); |
|
if (i % 2) |
|
p->bold--; |
|
else |
|
p->under--; |
|
} |
|
return(0); |
|
} |
|
|
|
|
|
/* ARGSUSED */ |
|
static int |
|
pre_RB(DECL_ARGS) |
pre_RB(DECL_ARGS) |
{ |
{ |
const struct man_node *nn; |
const struct man_node *nn; |
int i; |
int i; |
|
|
for (i = 0, nn = n->child; nn; nn = nn->next, i++) { |
for (i = 0, nn = n->child; nn; nn = nn->next, i++) { |
if (i % 2) |
if (i % 2 && MAN_RB == n->tok) |
p->bold++; |
p->bold++; |
|
else if ( ! (i % 2) && MAN_RB != n->tok) |
|
p->bold++; |
|
|
if (i > 0) |
if (i > 0) |
p->flags |= TERMP_NOSPACE; |
p->flags |= TERMP_NOSPACE; |
|
|
print_node(p, mt, nn, m); |
print_node(p, mt, nn, m); |
if (i % 2) |
|
|
if (i % 2 && MAN_RB == n->tok) |
p->bold--; |
p->bold--; |
|
else if ( ! (i % 2) && MAN_RB != n->tok) |
|
p->bold--; |
} |
} |
return(0); |
return(0); |
} |
} |
Line 359 pre_RI(DECL_ARGS) |
|
Line 340 pre_RI(DECL_ARGS) |
|
|
|
/* ARGSUSED */ |
/* ARGSUSED */ |
static int |
static int |
pre_BR(DECL_ARGS) |
|
{ |
|
const struct man_node *nn; |
|
int i; |
|
|
|
for (i = 0, nn = n->child; nn; nn = nn->next, i++) { |
|
if ( ! (i % 2)) |
|
p->bold++; |
|
if (i > 0) |
|
p->flags |= TERMP_NOSPACE; |
|
print_node(p, mt, nn, m); |
|
if ( ! (i % 2)) |
|
p->bold--; |
|
} |
|
return(0); |
|
} |
|
|
|
|
|
/* ARGSUSED */ |
|
static int |
|
pre_BI(DECL_ARGS) |
pre_BI(DECL_ARGS) |
{ |
{ |
const struct man_node *nn; |
const struct man_node *nn; |
int i; |
int i; |
|
|
for (i = 0, nn = n->child; nn; nn = nn->next, i++) { |
for (i = 0, nn = n->child; nn; nn = nn->next, i++) { |
if (i % 2) |
if (i % 2 && MAN_BI == n->tok) |
p->under++; |
p->under++; |
else |
else if (i % 2) |
p->bold++; |
p->bold++; |
if (i > 0) |
else if (MAN_BI == n->tok) |
|
p->bold++; |
|
else |
|
p->under++; |
|
|
|
if (i) |
p->flags |= TERMP_NOSPACE; |
p->flags |= TERMP_NOSPACE; |
print_node(p, mt, nn, m); |
print_node(p, mt, nn, m); |
if (i % 2) |
|
|
if (i % 2 && MAN_BI == n->tok) |
p->under--; |
p->under--; |
else |
else if (i % 2) |
p->bold--; |
p->bold--; |
|
else if (MAN_BI == n->tok) |
|
p->bold--; |
|
else |
|
p->under--; |
} |
} |
return(0); |
return(0); |
} |
} |