version 1.36, 2020/04/19 16:36:16 |
version 1.38, 2023/11/24 05:02:18 |
|
|
/* $Id$ */ |
/* $Id$ */ |
/* |
/* |
* Copyright (c) 2015,2016,2018,2019,2020 Ingo Schwarze <schwarze@openbsd.org> |
* Copyright (c) 2015, 2016, 2018, 2019, 2020, 2022, 2023 |
|
* 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 <limits.h> |
#include <limits.h> |
#include <stddef.h> |
#include <stddef.h> |
#include <stdint.h> |
#include <stdint.h> |
|
#include <stdio.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 "mandoc.h" |
#include "roff.h" |
#include "roff.h" |
#include "mdoc.h" |
#include "mdoc.h" |
#include "roff_int.h" |
#include "roff_int.h" |
|
|
|
|
/* |
/* |
* 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; |
struct roff_node *nold; |
const char *se; |
const char *se, *src; |
|
char *cpy; |
size_t len; |
size_t len; |
unsigned int slot; |
unsigned int slot; |
|
int changed; |
|
|
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. */ |
|
|
|
changed = 1; |
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 109 tag_put(const char *s, int prio, struct roff_node *n) |
|
Line 127 tag_put(const char *s, int prio, struct roff_node *n) |
|
s += 2; |
s += 2; |
break; |
break; |
default: |
default: |
break; |
return; |
} |
} |
break; |
break; |
default: |
default: |
|
changed = 0; |
break; |
break; |
} |
} |
} |
} |
|
|
/* |
/* |
|
* Translate \- and ASCII_HYPH to plain '-'. |
* Skip whitespace and escapes and whatever follows, |
* Skip whitespace and escapes and whatever follows, |
* and if there is any, downgrade the priority. |
* and if there is any, downgrade the priority. |
*/ |
*/ |
|
|
len = strcspn(s, " \t\\"); |
cpy = mandoc_malloc(strlen(s) + 1); |
|
for (src = s, len = 0; *src != '\0'; src++, len++) { |
|
switch (*src) { |
|
case '\t': |
|
case ' ': |
|
changed = 1; |
|
break; |
|
case ASCII_HYPH: |
|
cpy[len] = '-'; |
|
changed = 1; |
|
continue; |
|
case '\\': |
|
if (src[1] != '-') |
|
break; |
|
src++; |
|
changed = 1; |
|
/* FALLTHROUGH */ |
|
default: |
|
cpy[len] = *src; |
|
continue; |
|
} |
|
break; |
|
} |
if (len == 0) |
if (len == 0) |
return; |
goto out; |
|
cpy[len] = '\0'; |
|
|
se = s + len; |
if (*src != '\0' && prio < TAG_WEAK) |
if (*se != '\0' && prio < TAG_WEAK) |
|
prio = TAG_WEAK; |
prio = TAG_WEAK; |
|
|
|
s = cpy; |
|
se = cpy + len; |
slot = ohash_qlookupi(&tag_data, s, &se); |
slot = ohash_qlookupi(&tag_data, s, &se); |
entry = ohash_find(&tag_data, slot); |
entry = ohash_find(&tag_data, slot); |
|
|
Line 137 tag_put(const char *s, int prio, struct roff_node *n) |
|
Line 181 tag_put(const char *s, int prio, struct roff_node *n) |
|
|
|
if (entry == NULL) { |
if (entry == NULL) { |
entry = mandoc_malloc(sizeof(*entry) + len + 1); |
entry = mandoc_malloc(sizeof(*entry) + len + 1); |
memcpy(entry->s, s, len); |
memcpy(entry->s, s, len + 1); |
entry->s[len] = '\0'; |
|
entry->nodes = NULL; |
entry->nodes = NULL; |
entry->maxnodes = entry->nnodes = 0; |
entry->maxnodes = entry->nnodes = 0; |
ohash_insert(&tag_data, slot, entry); |
ohash_insert(&tag_data, slot, entry); |
Line 150 tag_put(const char *s, int prio, struct roff_node *n) |
|
Line 193 tag_put(const char *s, int prio, struct roff_node *n) |
|
*/ |
*/ |
|
|
else if (entry->prio < prio) |
else if (entry->prio < prio) |
return; |
goto out; |
|
|
/* |
/* |
* If the existing entry is worse, clear it. |
* If the existing entry is worse, clear it. |
Line 167 tag_put(const char *s, int prio, struct roff_node *n) |
|
Line 210 tag_put(const char *s, int prio, struct roff_node *n) |
|
} |
} |
if (prio == TAG_FALLBACK) { |
if (prio == TAG_FALLBACK) { |
entry->prio = TAG_DELETE; |
entry->prio = TAG_DELETE; |
return; |
goto out; |
} |
} |
} |
} |
|
|
Line 181 tag_put(const char *s, int prio, struct roff_node *n) |
|
Line 224 tag_put(const char *s, int prio, struct roff_node *n) |
|
entry->nodes[entry->nnodes++] = n; |
entry->nodes[entry->nnodes++] = 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 (changed) { |
assert(n->tag == NULL); |
assert(n->tag == NULL); |
n->tag = mandoc_strndup(s, len); |
n->tag = mandoc_strndup(s, len); |
} |
} |
|
|
|
out: |
|
free(cpy); |
} |
} |
|
|
int |
int |