version 1.28, 2020/03/13 15:32:29 |
version 1.35, 2020/04/18 20:40:10 |
|
|
#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 "roff_int.h" |
#include "tag.h" |
#include "tag.h" |
|
|
struct tag_entry { |
struct tag_entry { |
Line 40 struct tag_entry { |
|
Line 43 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; |
|
|
|
|
|
|
struct tag_entry *entry; |
struct tag_entry *entry; |
unsigned int slot; |
unsigned int slot; |
|
|
|
if (tag_data.info.free == NULL) |
|
return; |
entry = ohash_first(&tag_data, &slot); |
entry = ohash_first(&tag_data, &slot); |
while (entry != NULL) { |
while (entry != NULL) { |
free(entry->nodes); |
free(entry->nodes); |
|
|
entry = ohash_next(&tag_data, &slot); |
entry = ohash_next(&tag_data, &slot); |
} |
} |
ohash_delete(&tag_data); |
ohash_delete(&tag_data); |
|
tag_data.info.free = NULL; |
} |
} |
|
|
/* |
/* |
|
|
tag_put(const char *s, int prio, struct roff_node *n) |
tag_put(const char *s, int prio, struct roff_node *n) |
{ |
{ |
struct tag_entry *entry; |
struct tag_entry *entry; |
|
struct roff_node *nold; |
const char *se; |
const char *se; |
size_t len; |
size_t len; |
unsigned int slot; |
unsigned int slot; |
Line 86 tag_put(const char *s, int prio, struct roff_node *n) |
|
Line 95 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 132 tag_put(const char *s, int prio, struct roff_node *n) |
|
Line 157 tag_put(const char *s, int prio, struct roff_node *n) |
|
*/ |
*/ |
|
|
else if (entry->prio > prio || prio == TAG_FALLBACK) { |
else if (entry->prio > prio || prio == TAG_FALLBACK) { |
while (entry->nnodes > 0) |
while (entry->nnodes > 0) { |
entry->nodes[--entry->nnodes]->flags &= ~NODE_ID; |
nold = entry->nodes[--entry->nnodes]; |
|
nold->flags &= ~NODE_ID; |
|
free(nold->tag); |
|
nold->tag = NULL; |
|
} |
if (prio == TAG_FALLBACK) { |
if (prio == TAG_FALLBACK) { |
entry->prio = TAG_DELETE; |
entry->prio = TAG_DELETE; |
return; |
return; |
Line 152 tag_put(const char *s, int prio, struct roff_node *n) |
|
Line 180 tag_put(const char *s, int prio, struct roff_node *n) |
|
entry->prio = prio; |
entry->prio = prio; |
n->flags |= NODE_ID; |
n->flags |= NODE_ID; |
if (n->child == NULL || n->child->string != s || *se != '\0') { |
if (n->child == NULL || n->child->string != s || *se != '\0') { |
assert(n->string == NULL); |
assert(n->tag == NULL); |
n->string = mandoc_strndup(s, len); |
n->tag = mandoc_strndup(s, len); |
} |
} |
} |
} |
|
|
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->tag == NULL) { |
|
np->tag = mandoc_strdup(n->tag == NULL ? |
|
n->child->string : n->tag); |
|
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_man *man, struct roff_node *n) |
|
{ |
|
struct roff_node *nn; |
|
char *cp; |
|
|
|
if (n->flags & NODE_ID) { |
|
switch (n->tok) { |
|
case MDOC_Pp: |
|
nn = n->next; |
|
if (nn == NULL || nn->type != ROFFT_TEXT || |
|
*nn->string == '\0' || *nn->string == ' ') |
|
break; |
|
/* Use the first few letters for the permalink. */ |
|
cp = nn->string; |
|
while (cp != NULL && cp - nn->string < 5) |
|
cp = strchr(cp + 1, ' '); |
|
if (cp != NULL && cp[1] != '\0') { |
|
/* Split a longer text node. */ |
|
man->last = nn; |
|
man->next = ROFF_NEXT_SIBLING; |
|
roff_word_alloc(man, nn->line, |
|
nn->pos + (cp - nn->string), cp + 1); |
|
man->last->flags = nn->flags; |
|
*cp = '\0'; |
|
} |
|
assert(nn->tag == NULL); |
|
nn->tag = mandoc_strdup(n->tag); |
|
nn->flags |= NODE_HREF; |
|
break; |
|
case MDOC_Bd: |
|
case MDOC_Bl: |
|
/* 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; |
|
free(n->tag); |
|
n->tag = NULL; |
|
} |
|
break; |
|
} |
|
} |
|
for (n = n->child; n != NULL; n = n->next) |
|
tag_postprocess(man, n); |
} |
} |