version 1.36, 2009/08/21 13:18:32 |
version 1.39, 2009/08/22 09:10:38 |
Line 54 const char *const __man_macronames[MAN_MAX] = { |
|
Line 54 const char *const __man_macronames[MAN_MAX] = { |
|
"R", "B", "I", "IR", |
"R", "B", "I", "IR", |
"RI", "na", "i", "sp", |
"RI", "na", "i", "sp", |
"nf", "fi", "r", "RE", |
"nf", "fi", "r", "RE", |
"RS", "DT" |
"RS", "DT", "UC" |
}; |
}; |
|
|
const char * const *man_macronames = __man_macronames; |
const char * const *man_macronames = __man_macronames; |
Line 378 man_node_free(struct man_node *p) |
|
Line 378 man_node_free(struct man_node *p) |
|
void |
void |
man_node_freelist(struct man_node *p) |
man_node_freelist(struct man_node *p) |
{ |
{ |
|
struct man_node *n; |
|
|
if (p->child) |
if (p->child) |
man_node_freelist(p->child); |
man_node_freelist(p->child); |
if (p->next) |
|
man_node_freelist(p->next); |
|
|
|
assert(0 == p->nchild); |
assert(0 == p->nchild); |
|
n = p->next; |
man_node_free(p); |
man_node_free(p); |
|
if (n) |
|
man_node_freelist(n); |
} |
} |
|
|
|
|
Line 492 man_pmacro(struct man *m, int ln, char *buf) |
|
Line 493 man_pmacro(struct man *m, int ln, char *buf) |
|
break; |
break; |
else if (' ' == buf[i]) |
else if (' ' == buf[i]) |
break; |
break; |
|
|
|
/* Check for invalid characters. */ |
|
|
|
if (isgraph((u_char)buf[i])) |
|
continue; |
|
return(man_perr(m, ln, i, WNPRINT)); |
} |
} |
|
|
mac[j] = 0; |
mac[j] = 0; |
Line 526 man_pmacro(struct man *m, int ln, char *buf) |
|
Line 533 man_pmacro(struct man *m, int ln, char *buf) |
|
if (m->flags & MAN_ELINE) { |
if (m->flags & MAN_ELINE) { |
n = m->last; |
n = m->last; |
assert(NULL == n->child); |
assert(NULL == n->child); |
|
assert(0 == n->nchild); |
if ( ! man_nwarn(m, n, WLNSCOPE)) |
if ( ! man_nwarn(m, n, WLNSCOPE)) |
return(0); |
return(0); |
|
|
Line 534 man_pmacro(struct man *m, int ln, char *buf) |
|
Line 542 man_pmacro(struct man *m, int ln, char *buf) |
|
assert(n == n->prev->next); |
assert(n == n->prev->next); |
n->prev->next = NULL; |
n->prev->next = NULL; |
m->last = n->prev; |
m->last = n->prev; |
|
m->next = MAN_NEXT_SIBLING; |
} else { |
} else { |
assert(n == n->parent->child); |
assert(n == n->parent->child); |
n->parent->child = NULL; |
n->parent->child = NULL; |
m->last = n->parent; |
m->last = n->parent; |
|
m->next = MAN_NEXT_CHILD; |
} |
} |
|
|
man_node_free(n); |
man_node_free(n); |