version 1.29, 2020/03/13 16:16:58 |
version 1.33, 2020/04/07 22:56:02 |
|
|
#include <assert.h> |
#include <assert.h> |
#include <limits.h> |
#include <limits.h> |
#include <stddef.h> |
#include <stddef.h> |
|
#include <stdint.h> |
#include <stdlib.h> |
#include <stdlib.h> |
#include <string.h> |
#include <string.h> |
|
|
#include "mandoc_aux.h" |
#include "mandoc_aux.h" |
#include "mandoc_ohash.h" |
#include "mandoc_ohash.h" |
#include "roff.h" |
#include "roff.h" |
|
#include "mdoc.h" |
#include "tag.h" |
#include "tag.h" |
|
|
struct tag_entry { |
struct tag_entry { |
Line 40 struct tag_entry { |
|
Line 42 struct tag_entry { |
|
char s[]; |
char s[]; |
}; |
}; |
|
|
|
static void tag_move_id(struct roff_node *); |
|
|
static struct ohash tag_data; |
static struct ohash tag_data; |
|
|
|
|
Line 89 tag_put(const char *s, int prio, struct roff_node *n) |
|
Line 93 tag_put(const char *s, int prio, struct roff_node *n) |
|
if (n->child == NULL || n->child->type != ROFFT_TEXT) |
if (n->child == NULL || n->child->type != ROFFT_TEXT) |
return; |
return; |
s = n->child->string; |
s = n->child->string; |
if (s[0] == '\\' && (s[1] == '&' || s[1] == 'e')) |
switch (s[0]) { |
s += 2; |
case '-': |
|
s++; |
|
break; |
|
case '\\': |
|
switch (s[1]) { |
|
case '&': |
|
case '-': |
|
case 'e': |
|
s += 2; |
|
break; |
|
default: |
|
break; |
|
} |
|
break; |
|
default: |
|
break; |
|
} |
} |
} |
|
|
/* |
/* |
Line 160 tag_put(const char *s, int prio, struct roff_node *n) |
|
Line 180 tag_put(const char *s, int prio, struct roff_node *n) |
|
} |
} |
} |
} |
|
|
enum tag_result |
int |
tag_check(const char *test_tag) |
tag_exists(const char *tag) |
{ |
{ |
unsigned int slot; |
return ohash_find(&tag_data, ohash_qlookup(&tag_data, tag)) != NULL; |
|
} |
|
|
if (ohash_first(&tag_data, &slot) == NULL) |
/* |
return TAG_EMPTY; |
* For in-line elements, move the link target |
else if (test_tag != NULL && ohash_find(&tag_data, |
* to the enclosing paragraph when appropriate. |
ohash_qlookup(&tag_data, test_tag)) == NULL) |
*/ |
return TAG_MISS; |
static void |
else |
tag_move_id(struct roff_node *n) |
return TAG_OK; |
{ |
|
struct roff_node *np; |
|
|
|
np = n; |
|
for (;;) { |
|
if (np->prev != NULL) |
|
np = np->prev; |
|
else if ((np = np->parent) == NULL) |
|
return; |
|
switch (np->tok) { |
|
case MDOC_It: |
|
switch (np->parent->parent->norm->Bl.type) { |
|
case LIST_column: |
|
/* Target the ROFFT_BLOCK = <tr>. */ |
|
np = np->parent; |
|
break; |
|
case LIST_diag: |
|
case LIST_hang: |
|
case LIST_inset: |
|
case LIST_ohang: |
|
case LIST_tag: |
|
/* Target the ROFFT_HEAD = <dt>. */ |
|
np = np->parent->head; |
|
break; |
|
default: |
|
/* Target the ROFF_BODY = <li>. */ |
|
break; |
|
} |
|
/* FALLTHROUGH */ |
|
case MDOC_Pp: /* Target the ROFFT_ELEM = <p>. */ |
|
if (np->string == NULL) { |
|
np->string = mandoc_strdup(n->string == NULL ? |
|
n->child->string : n->string); |
|
np->flags |= NODE_ID; |
|
n->flags &= ~NODE_ID; |
|
} |
|
return; |
|
case MDOC_Sh: |
|
case MDOC_Ss: |
|
case MDOC_Bd: |
|
case MDOC_Bl: |
|
case MDOC_D1: |
|
case MDOC_Dl: |
|
case MDOC_Rs: |
|
/* Do not move past major blocks. */ |
|
return; |
|
default: |
|
/* |
|
* Move past in-line content and partial |
|
* blocks, for example .It Xo or .It Bq Er. |
|
*/ |
|
break; |
|
} |
|
} |
|
} |
|
|
|
/* |
|
* When all tags have been set, decide where to put |
|
* the associated permalinks, and maybe move some tags |
|
* to the beginning of the respective paragraphs. |
|
*/ |
|
void |
|
tag_postprocess(struct roff_node *n) |
|
{ |
|
if (n->flags & NODE_ID) { |
|
switch (n->tok) { |
|
case MDOC_Bd: |
|
case MDOC_Bl: |
|
case MDOC_Pp: |
|
/* XXX No permalink for now. */ |
|
break; |
|
default: |
|
if (n->type == ROFFT_ELEM || n->tok == MDOC_Fo) |
|
tag_move_id(n); |
|
if (n->tok != MDOC_Tg) |
|
n->flags |= NODE_HREF; |
|
else if ((n->flags & NODE_ID) == 0) |
|
n->flags |= NODE_NOPRT; |
|
break; |
|
} |
|
} |
|
for (n = n->child; n != NULL; n = n->next) |
|
tag_postprocess(n); |
} |
} |