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/mdoc.c b/mdoc.c
index 26788b0a..e7f7a378 100644
--- a/mdoc.c
+++ b/mdoc.c
@@ -570,7 +570,7 @@ mdoc_word_alloc(struct mdoc *m, int line, int pos, const char *p)
 	struct mdoc_node *n;
 
 	n = node_alloc(m, line, pos, MDOC_MAX, MDOC_TEXT);
-	n->string = mandoc_strdup(p);
+	n->string = roff_strdup(m->roff, p);
 
 	if ( ! node_append(m, n))
 		return(0);