version 1.231, 2019/07/22 03:21:49 |
version 1.233, 2020/01/20 10:37:15 |
|
|
/* $Id$ */ |
/* $Id$ */ |
/* |
/* |
* Copyright (c) 2008-2012 Kristaps Dzonsons <kristaps@bsd.lv> |
* Copyright (c) 2008-2012 Kristaps Dzonsons <kristaps@bsd.lv> |
* Copyright (c) 2010-2015, 2017-2019 Ingo Schwarze <schwarze@openbsd.org> |
* Copyright (c) 2010-2015, 2017-2020 Ingo Schwarze <schwarze@openbsd.org> |
* |
* |
* Permission to use, copy, modify, and distribute this software for any |
* Permission to use, copy, modify, and distribute this software for any |
* purpose with or without fee is hereby granted, provided that the above |
* purpose with or without fee is hereby granted, provided that the above |
Line 621 pre_TP(DECL_ARGS) |
|
Line 621 pre_TP(DECL_ARGS) |
|
while (nn != NULL && (nn->flags & NODE_LINE) == 0) |
while (nn != NULL && (nn->flags & NODE_LINE) == 0) |
nn = nn->next; |
nn = nn->next; |
|
|
|
if (nn == NULL) |
|
return 0; |
|
|
|
if (nn->type == ROFFT_TEXT) |
|
tag_man(p, nn); |
|
else if (nn->child != NULL && |
|
nn->child->type == ROFFT_TEXT && |
|
(nn->tok == MAN_B || nn->tok == MAN_BI || |
|
nn->tok == MAN_BR || nn->tok == MAN_I || |
|
nn->tok == MAN_IB || nn->tok == MAN_IR)) |
|
tag_man(p, nn->child); |
|
|
while (nn != NULL) { |
while (nn != NULL) { |
print_man_node(p, mt, nn, meta); |
print_man_node(p, mt, nn, meta); |
nn = nn->next; |
nn = nn->next; |
Line 1168 tag_man(struct termp *p, struct roff_node *n) |
|
Line 1180 tag_man(struct termp *p, struct roff_node *n) |
|
|
|
assert(n->type == ROFFT_TEXT); |
assert(n->type == ROFFT_TEXT); |
cp = n->string; |
cp = n->string; |
prio = 1; |
prio = TAG_STRONG; |
for (;;) { |
for (;;) { |
switch (*cp) { |
switch (*cp) { |
case ' ': |
case ' ': |
case '\t': |
case '\t': |
prio = INT_MAX; |
prio = TAG_WEAK; |
/* FALLTHROUGH */ |
/* FALLTHROUGH */ |
case '-': |
case '-': |
cp++; |
cp++; |