version 1.33, 2020/04/07 22:56:02 |
version 1.37, 2022/04/26 11:38:38 |
|
|
/* $Id$ */ |
/* $Id$ */ |
/* |
/* |
* Copyright (c) 2015,2016,2018,2019,2020 Ingo Schwarze <schwarze@openbsd.org> |
* Copyright (c) 2015, 2016, 2018, 2019, 2020, 2022 |
|
* 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 |
|
|
#include "mandoc_ohash.h" |
#include "mandoc_ohash.h" |
#include "roff.h" |
#include "roff.h" |
#include "mdoc.h" |
#include "mdoc.h" |
|
#include "roff_int.h" |
#include "tag.h" |
#include "tag.h" |
|
|
struct tag_entry { |
struct tag_entry { |
Line 42 struct tag_entry { |
|
Line 44 struct tag_entry { |
|
char s[]; |
char s[]; |
}; |
}; |
|
|
|
static void tag_move_href(struct roff_man *, |
|
struct roff_node *, const char *); |
static void tag_move_id(struct roff_node *); |
static void tag_move_id(struct roff_node *); |
|
|
static struct ohash tag_data; |
static struct ohash tag_data; |
|
|
|
|
/* |
/* |
* Set a node where a term is defined, |
* Set a node where a term is defined, |
* unless it is already defined at a lower priority. |
* unless the term is already defined at a lower priority. |
*/ |
*/ |
void |
void |
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; |
|
|
assert(prio <= TAG_FALLBACK); |
assert(prio <= TAG_FALLBACK); |
|
|
|
/* |
|
* If the node is already tagged, the existing tag is |
|
* explicit and we are now about to add an implicit tag. |
|
* Don't do that; just skip implicit tagging if the author |
|
* specified an explicit tag. |
|
*/ |
|
|
|
if (n->flags & NODE_ID) |
|
return; |
|
|
|
/* Determine the implicit tag. */ |
|
|
if (s == NULL) { |
if (s == NULL) { |
if (n->child == NULL || n->child->type != ROFFT_TEXT) |
if (n->child == NULL || n->child->type != ROFFT_TEXT) |
return; |
return; |
Line 146 tag_put(const char *s, int prio, struct roff_node *n) |
|
Line 163 tag_put(const char *s, int prio, struct roff_node *n) |
|
*/ |
*/ |
|
|
else if (entry->prio < prio) |
else if (entry->prio < prio) |
return; |
return; |
|
|
/* |
/* |
* If the existing entry is worse, clear it. |
* If the existing entry is worse, clear it. |
Line 155 tag_put(const char *s, int prio, struct roff_node *n) |
|
Line 172 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 175 tag_put(const char *s, int prio, struct roff_node *n) |
|
Line 195 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); |
} |
} |
} |
} |
|
|
Line 222 tag_move_id(struct roff_node *n) |
|
Line 242 tag_move_id(struct roff_node *n) |
|
} |
} |
/* FALLTHROUGH */ |
/* FALLTHROUGH */ |
case MDOC_Pp: /* Target the ROFFT_ELEM = <p>. */ |
case MDOC_Pp: /* Target the ROFFT_ELEM = <p>. */ |
if (np->string == NULL) { |
if (np->tag == NULL) { |
np->string = mandoc_strdup(n->string == NULL ? |
np->tag = mandoc_strdup(n->tag == NULL ? |
n->child->string : n->string); |
n->child->string : n->tag); |
np->flags |= NODE_ID; |
np->flags |= NODE_ID; |
n->flags &= ~NODE_ID; |
n->flags &= ~NODE_ID; |
} |
} |
Line 249 tag_move_id(struct roff_node *n) |
|
Line 269 tag_move_id(struct roff_node *n) |
|
} |
} |
|
|
/* |
/* |
|
* When a paragraph is tagged and starts with text, |
|
* move the permalink to the first few words. |
|
*/ |
|
static void |
|
tag_move_href(struct roff_man *man, struct roff_node *n, const char *tag) |
|
{ |
|
char *cp; |
|
|
|
if (n == NULL || n->type != ROFFT_TEXT || |
|
*n->string == '\0' || *n->string == ' ') |
|
return; |
|
|
|
cp = n->string; |
|
while (cp != NULL && cp - n->string < 5) |
|
cp = strchr(cp + 1, ' '); |
|
|
|
/* If the first text node is longer, split it. */ |
|
|
|
if (cp != NULL && cp[1] != '\0') { |
|
man->last = n; |
|
man->next = ROFF_NEXT_SIBLING; |
|
roff_word_alloc(man, n->line, |
|
n->pos + (cp - n->string), cp + 1); |
|
man->last->flags = n->flags & ~NODE_LINE; |
|
*cp = '\0'; |
|
} |
|
|
|
assert(n->tag == NULL); |
|
n->tag = mandoc_strdup(tag); |
|
n->flags |= NODE_HREF; |
|
} |
|
|
|
/* |
* When all tags have been set, decide where to put |
* When all tags have been set, decide where to put |
* the associated permalinks, and maybe move some tags |
* the associated permalinks, and maybe move some tags |
* to the beginning of the respective paragraphs. |
* to the beginning of the respective paragraphs. |
*/ |
*/ |
void |
void |
tag_postprocess(struct roff_node *n) |
tag_postprocess(struct roff_man *man, struct roff_node *n) |
{ |
{ |
if (n->flags & NODE_ID) { |
if (n->flags & NODE_ID) { |
switch (n->tok) { |
switch (n->tok) { |
|
case MDOC_Pp: |
|
tag_move_href(man, n->next, n->tag); |
|
break; |
case MDOC_Bd: |
case MDOC_Bd: |
|
case MDOC_D1: |
|
case MDOC_Dl: |
|
tag_move_href(man, n->child, n->tag); |
|
break; |
case MDOC_Bl: |
case MDOC_Bl: |
case MDOC_Pp: |
|
/* XXX No permalink for now. */ |
/* XXX No permalink for now. */ |
break; |
break; |
default: |
default: |
Line 268 tag_postprocess(struct roff_node *n) |
|
Line 327 tag_postprocess(struct roff_node *n) |
|
tag_move_id(n); |
tag_move_id(n); |
if (n->tok != MDOC_Tg) |
if (n->tok != MDOC_Tg) |
n->flags |= NODE_HREF; |
n->flags |= NODE_HREF; |
else if ((n->flags & NODE_ID) == 0) |
else if ((n->flags & NODE_ID) == 0) { |
n->flags |= NODE_NOPRT; |
n->flags |= NODE_NOPRT; |
|
free(n->tag); |
|
n->tag = NULL; |
|
} |
break; |
break; |
} |
} |
} |
} |
for (n = n->child; n != NULL; n = n->next) |
for (n = n->child; n != NULL; n = n->next) |
tag_postprocess(n); |
tag_postprocess(man, n); |
} |
} |