1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
|
/* $Id$ */
/*
* Copyright (c) 2008 Kristaps Dzonsons <kristaps@kth.se>
*
* Permission to use, copy, modify, and distribute this software for any
* purpose with or without fee is hereby granted, provided that the
* above copyright notice and this permission notice appear in all
* copies.
*
* THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL
* WARRANTIES WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED
* WARRANTIES OF MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE
* AUTHOR BE LIABLE FOR ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL
* DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR
* PROFITS, WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR OTHER
* TORTIOUS ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE OR
* PERFORMANCE OF THIS SOFTWARE.
*/
#include <assert.h>
#include <err.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include "libmdocml.h"
#include "private.h"
#ifdef __linux__
#define strlcat strncat
#endif
static int md_dummy_blk_in(int);
static int md_dummy_blk_out(int);
static int md_dummy_text_in(int, int *, char **);
static int md_dummy_text_out(int);
static void dbg_prologue(const char *);
static void dbg_epilogue(void);
static int dbg_lvl = 0;
static char dbg_line[72];
struct md_dummy {
struct rofftree *tree;
};
static void
dbg_prologue(const char *p)
{
int i;
(void)snprintf(dbg_line, sizeof(dbg_line) - 1, "%6s", p);
(void)strlcat(dbg_line, ": ", sizeof(dbg_line) - 1);
/* LINTED */
for (i = 0; i < dbg_lvl; i++)
(void)strlcat(dbg_line, " ", sizeof(dbg_line) - 1);
}
static void
dbg_epilogue(void)
{
assert(0 != dbg_line[0]);
(void)printf("%s\n", dbg_line);
}
static int
md_dummy_blk_in(int tok)
{
dbg_prologue("blk");
(void)strlcat(dbg_line, toknames[tok], sizeof(dbg_line) - 1);
dbg_epilogue();
dbg_lvl++;
return(1);
}
static int
md_dummy_blk_out(int tok)
{
dbg_lvl--;
return(1);
}
/* ARGSUSED */
static int
md_dummy_text_in(int tok, int *argcp, char **argvp)
{
dbg_prologue("text");
(void)strlcat(dbg_line, toknames[tok], sizeof(dbg_line) - 1);
(void)strlcat(dbg_line, " ", sizeof(dbg_line) - 1);
while (ROFF_ARGMAX != *argcp) {
(void)strlcat(dbg_line, "[", sizeof(dbg_line) - 1);
(void)strlcat(dbg_line, tokargnames[*argcp],
sizeof(dbg_line) - 1);
if (*argvp) {
(void)strlcat(dbg_line, " [",
sizeof(dbg_line) - 1);
(void)strlcat(dbg_line, *argvp,
sizeof(dbg_line) - 1);
(void)strlcat(dbg_line, "]",
sizeof(dbg_line) - 1);
}
(void)strlcat(dbg_line, "]", sizeof(dbg_line) - 1);
argcp++;
argvp++;
}
dbg_epilogue();
return(1);
}
static int
md_dummy_text_out(int tok)
{
return(1);
}
int
md_line_dummy(void *arg, char *buf, size_t sz)
{
struct md_dummy *p;
p = (struct md_dummy *)arg;
return(roff_engine(p->tree, buf, sz));
}
int
md_exit_dummy(void *data, int flush)
{
int c;
struct md_dummy *p;
p = (struct md_dummy *)data;
c = roff_free(p->tree, flush);
free(p);
return(c);
}
void *
md_init_dummy(const struct md_args *args,
struct md_mbuf *mbuf, const struct md_rbuf *rbuf)
{
struct md_dummy *p;
if (NULL == (p = malloc(sizeof(struct md_dummy)))) {
warn("malloc");
return(NULL);
}
p->tree = roff_alloc(args, mbuf, rbuf,
md_dummy_text_in, md_dummy_text_out,
md_dummy_blk_in, md_dummy_blk_out);
if (NULL == p->tree) {
free(p);
return(NULL);
}
return(p);
}
|
