An implementation of `tr'. This routes allocations of TEXT nodes

through libroff, which does the appropriate translations of `tr'.  This
is SLOW: it uses the backend of `ds' and `de', which is a simple linear
list.  However, unlike `ds' and `de', it iterates over EACH CHARACTER of
the entire file looking for replacements.

1 files changed, 1 insertions, 1 deletions

diff --git a/man.c b/man.c
index b13039e8..3321bf63 100644
--- a/man.c
+++ b/man.c
@@ -322,7 +322,7 @@ man_word_alloc(struct man *m, int line, int pos, const char *word)
 	struct man_node	*n;
 
 	n = man_node_alloc(m, line, pos, MAN_TEXT, MAN_MAX);
-	n->string = mandoc_strdup(word);
+	n->string = roff_strdup(m->roff, word);
 
 	if ( ! man_node_append(m, n))
 		return(0);