debug.c revision 1.1 1 1.1 pgoyette /* $NetBSD: debug.c,v 1.1 2011/01/08 18:10:31 pgoyette Exp $ */
2 1.1 pgoyette
3 1.1 pgoyette /*-
4 1.1 pgoyette * Copyright (c) 1993 The NetBSD Foundation, Inc.
5 1.1 pgoyette * All rights reserved.
6 1.1 pgoyette *
7 1.1 pgoyette * Redistribution and use in source and binary forms, with or without
8 1.1 pgoyette * modification, are permitted provided that the following conditions
9 1.1 pgoyette * are met:
10 1.1 pgoyette * 1. Redistributions of source code must retain the above copyright
11 1.1 pgoyette * notice, this list of conditions and the following disclaimer.
12 1.1 pgoyette * 2. Redistributions in binary form must reproduce the above copyright
13 1.1 pgoyette * notice, this list of conditions and the following disclaimer in the
14 1.1 pgoyette * documentation and/or other materials provided with the distribution.
15 1.1 pgoyette *
16 1.1 pgoyette * THIS SOFTWARE IS PROVIDED BY THE NETBSD FOUNDATION, INC. AND CONTRIBUTORS
17 1.1 pgoyette * ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED
18 1.1 pgoyette * TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
19 1.1 pgoyette * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE FOUNDATION OR CONTRIBUTORS
20 1.1 pgoyette * BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
21 1.1 pgoyette * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
22 1.1 pgoyette * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
23 1.1 pgoyette * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
24 1.1 pgoyette * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
25 1.1 pgoyette * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
26 1.1 pgoyette * POSSIBILITY OF SUCH DAMAGE.
27 1.1 pgoyette */
28 1.1 pgoyette
29 1.1 pgoyette #include <ctype.h>
30 1.1 pgoyette #include <limits.h>
31 1.1 pgoyette #include <regex.h>
32 1.1 pgoyette #include <stdio.h>
33 1.1 pgoyette #include <stdlib.h>
34 1.1 pgoyette #include <string.h>
35 1.1 pgoyette
36 1.1 pgoyette #include <sys/types.h>
37 1.1 pgoyette
38 1.1 pgoyette /* Don't sort these! */
39 1.1 pgoyette #include "utils.h"
40 1.1 pgoyette #include "regex2.h"
41 1.1 pgoyette
42 1.1 pgoyette #include "test_regex.h"
43 1.1 pgoyette
44 1.1 pgoyette static void s_print(struct re_guts *, FILE *);
45 1.1 pgoyette static char *regchar(int);
46 1.1 pgoyette
47 1.1 pgoyette /*
48 1.1 pgoyette * regprint - print a regexp for debugging
49 1.1 pgoyette */
50 1.1 pgoyette void
51 1.1 pgoyette regprint(regex_t *r, FILE *d)
52 1.1 pgoyette {
53 1.1 pgoyette struct re_guts *g = r->re_g;
54 1.1 pgoyette int i;
55 1.1 pgoyette int c;
56 1.1 pgoyette int last;
57 1.1 pgoyette int nincat[NC];
58 1.1 pgoyette
59 1.1 pgoyette fprintf(d, "%ld states, %d categories", (long)g->nstates,
60 1.1 pgoyette g->ncategories);
61 1.1 pgoyette fprintf(d, ", first %ld last %ld", (long)g->firststate,
62 1.1 pgoyette (long)g->laststate);
63 1.1 pgoyette if (g->iflags&USEBOL)
64 1.1 pgoyette fprintf(d, ", USEBOL");
65 1.1 pgoyette if (g->iflags&USEEOL)
66 1.1 pgoyette fprintf(d, ", USEEOL");
67 1.1 pgoyette if (g->iflags&BAD)
68 1.1 pgoyette fprintf(d, ", BAD");
69 1.1 pgoyette if (g->nsub > 0)
70 1.1 pgoyette fprintf(d, ", nsub=%ld", (long)g->nsub);
71 1.1 pgoyette if (g->must != NULL)
72 1.1 pgoyette fprintf(d, ", must(%ld) `%*s'", (long)g->mlen, (int)g->mlen,
73 1.1 pgoyette g->must);
74 1.1 pgoyette if (g->backrefs)
75 1.1 pgoyette fprintf(d, ", backrefs");
76 1.1 pgoyette if (g->nplus > 0)
77 1.1 pgoyette fprintf(d, ", nplus %ld", (long)g->nplus);
78 1.1 pgoyette fprintf(d, "\n");
79 1.1 pgoyette s_print(g, d);
80 1.1 pgoyette for (i = 0; i < g->ncategories; i++) {
81 1.1 pgoyette nincat[i] = 0;
82 1.1 pgoyette for (c = CHAR_MIN; c <= CHAR_MAX; c++)
83 1.1 pgoyette if (g->categories[c] == i)
84 1.1 pgoyette nincat[i]++;
85 1.1 pgoyette }
86 1.1 pgoyette fprintf(d, "cc0#%d", nincat[0]);
87 1.1 pgoyette for (i = 1; i < g->ncategories; i++)
88 1.1 pgoyette if (nincat[i] == 1) {
89 1.1 pgoyette for (c = CHAR_MIN; c <= CHAR_MAX; c++)
90 1.1 pgoyette if (g->categories[c] == i)
91 1.1 pgoyette break;
92 1.1 pgoyette fprintf(d, ", %d=%s", i, regchar(c));
93 1.1 pgoyette }
94 1.1 pgoyette fprintf(d, "\n");
95 1.1 pgoyette for (i = 1; i < g->ncategories; i++)
96 1.1 pgoyette if (nincat[i] != 1) {
97 1.1 pgoyette fprintf(d, "cc%d\t", i);
98 1.1 pgoyette last = -1;
99 1.1 pgoyette for (c = CHAR_MIN; c <= CHAR_MAX+1; c++) /* +1 does flush */
100 1.1 pgoyette if (c <= CHAR_MAX && g->categories[c] == i) {
101 1.1 pgoyette if (last < 0) {
102 1.1 pgoyette fprintf(d, "%s", regchar(c));
103 1.1 pgoyette last = c;
104 1.1 pgoyette }
105 1.1 pgoyette } else {
106 1.1 pgoyette if (last >= 0) {
107 1.1 pgoyette if (last != c-1)
108 1.1 pgoyette fprintf(d, "-%s",
109 1.1 pgoyette regchar(c-1));
110 1.1 pgoyette last = -1;
111 1.1 pgoyette }
112 1.1 pgoyette }
113 1.1 pgoyette fprintf(d, "\n");
114 1.1 pgoyette }
115 1.1 pgoyette }
116 1.1 pgoyette
117 1.1 pgoyette /*
118 1.1 pgoyette * s_print - print the strip for debugging
119 1.1 pgoyette */
120 1.1 pgoyette static void
121 1.1 pgoyette s_print(struct re_guts *g, FILE *d)
122 1.1 pgoyette {
123 1.1 pgoyette sop *s;
124 1.1 pgoyette cset *cs;
125 1.1 pgoyette int i;
126 1.1 pgoyette int done = 0;
127 1.1 pgoyette sop opnd;
128 1.1 pgoyette int col = 0;
129 1.1 pgoyette int last;
130 1.1 pgoyette sopno offset = 2;
131 1.1 pgoyette # define GAP() { if (offset % 5 == 0) { \
132 1.1 pgoyette if (col > 40) { \
133 1.1 pgoyette fprintf(d, "\n\t"); \
134 1.1 pgoyette col = 0; \
135 1.1 pgoyette } else { \
136 1.1 pgoyette fprintf(d, " "); \
137 1.1 pgoyette col++; \
138 1.1 pgoyette } \
139 1.1 pgoyette } else \
140 1.1 pgoyette col++; \
141 1.1 pgoyette offset++; \
142 1.1 pgoyette }
143 1.1 pgoyette
144 1.1 pgoyette if (OP(g->strip[0]) != OEND)
145 1.1 pgoyette fprintf(d, "missing initial OEND!\n");
146 1.1 pgoyette for (s = &g->strip[1]; !done; s++) {
147 1.1 pgoyette opnd = OPND(*s);
148 1.1 pgoyette switch (OP(*s)) {
149 1.1 pgoyette case OEND:
150 1.1 pgoyette fprintf(d, "\n");
151 1.1 pgoyette done = 1;
152 1.1 pgoyette break;
153 1.1 pgoyette case OCHAR:
154 1.1 pgoyette if (strchr("\\|()^$.[+*?{}!<> ", (char)opnd) != NULL)
155 1.1 pgoyette fprintf(d, "\\%c", (char)opnd);
156 1.1 pgoyette else
157 1.1 pgoyette fprintf(d, "%s", regchar((char)opnd));
158 1.1 pgoyette break;
159 1.1 pgoyette case OBOL:
160 1.1 pgoyette fprintf(d, "^");
161 1.1 pgoyette break;
162 1.1 pgoyette case OEOL:
163 1.1 pgoyette fprintf(d, "$");
164 1.1 pgoyette break;
165 1.1 pgoyette case OBOW:
166 1.1 pgoyette fprintf(d, "\\{");
167 1.1 pgoyette break;
168 1.1 pgoyette case OEOW:
169 1.1 pgoyette fprintf(d, "\\}");
170 1.1 pgoyette break;
171 1.1 pgoyette case OANY:
172 1.1 pgoyette fprintf(d, ".");
173 1.1 pgoyette break;
174 1.1 pgoyette case OANYOF:
175 1.1 pgoyette fprintf(d, "[(%ld)", (long)opnd);
176 1.1 pgoyette cs = &g->sets[opnd];
177 1.1 pgoyette last = -1;
178 1.1 pgoyette for (i = 0; i < g->csetsize+1; i++) /* +1 flushes */
179 1.1 pgoyette if (CHIN(cs, i) && i < g->csetsize) {
180 1.1 pgoyette if (last < 0) {
181 1.1 pgoyette fprintf(d, "%s", regchar(i));
182 1.1 pgoyette last = i;
183 1.1 pgoyette }
184 1.1 pgoyette } else {
185 1.1 pgoyette if (last >= 0) {
186 1.1 pgoyette if (last != i-1)
187 1.1 pgoyette fprintf(d, "-%s",
188 1.1 pgoyette regchar(i-1));
189 1.1 pgoyette last = -1;
190 1.1 pgoyette }
191 1.1 pgoyette }
192 1.1 pgoyette fprintf(d, "]");
193 1.1 pgoyette break;
194 1.1 pgoyette case OBACK_:
195 1.1 pgoyette fprintf(d, "(\\<%ld>", (long)opnd);
196 1.1 pgoyette break;
197 1.1 pgoyette case O_BACK:
198 1.1 pgoyette fprintf(d, "<%ld>\\)", (long)opnd);
199 1.1 pgoyette break;
200 1.1 pgoyette case OPLUS_:
201 1.1 pgoyette fprintf(d, "(+");
202 1.1 pgoyette if (OP(*(s+opnd)) != O_PLUS)
203 1.1 pgoyette fprintf(d, "<%ld>", (long)opnd);
204 1.1 pgoyette break;
205 1.1 pgoyette case O_PLUS:
206 1.1 pgoyette if (OP(*(s-opnd)) != OPLUS_)
207 1.1 pgoyette fprintf(d, "<%ld>", (long)opnd);
208 1.1 pgoyette fprintf(d, "+)");
209 1.1 pgoyette break;
210 1.1 pgoyette case OQUEST_:
211 1.1 pgoyette fprintf(d, "(?");
212 1.1 pgoyette if (OP(*(s+opnd)) != O_QUEST)
213 1.1 pgoyette fprintf(d, "<%ld>", (long)opnd);
214 1.1 pgoyette break;
215 1.1 pgoyette case O_QUEST:
216 1.1 pgoyette if (OP(*(s-opnd)) != OQUEST_)
217 1.1 pgoyette fprintf(d, "<%ld>", (long)opnd);
218 1.1 pgoyette fprintf(d, "?)");
219 1.1 pgoyette break;
220 1.1 pgoyette case OLPAREN:
221 1.1 pgoyette fprintf(d, "((<%ld>", (long)opnd);
222 1.1 pgoyette break;
223 1.1 pgoyette case ORPAREN:
224 1.1 pgoyette fprintf(d, "<%ld>))", (long)opnd);
225 1.1 pgoyette break;
226 1.1 pgoyette case OCH_:
227 1.1 pgoyette fprintf(d, "<");
228 1.1 pgoyette if (OP(*(s+opnd)) != OOR2)
229 1.1 pgoyette fprintf(d, "<%ld>", (long)opnd);
230 1.1 pgoyette break;
231 1.1 pgoyette case OOR1:
232 1.1 pgoyette if (OP(*(s-opnd)) != OOR1 && OP(*(s-opnd)) != OCH_)
233 1.1 pgoyette fprintf(d, "<%ld>", (long)opnd);
234 1.1 pgoyette fprintf(d, "|");
235 1.1 pgoyette break;
236 1.1 pgoyette case OOR2:
237 1.1 pgoyette fprintf(d, "|");
238 1.1 pgoyette if (OP(*(s+opnd)) != OOR2 && OP(*(s+opnd)) != O_CH)
239 1.1 pgoyette fprintf(d, "<%ld>", (long)opnd);
240 1.1 pgoyette break;
241 1.1 pgoyette case O_CH:
242 1.1 pgoyette if (OP(*(s-opnd)) != OOR1)
243 1.1 pgoyette fprintf(d, "<%ld>", (long)opnd);
244 1.1 pgoyette fprintf(d, ">");
245 1.1 pgoyette break;
246 1.1 pgoyette default:
247 1.1 pgoyette fprintf(d, "!%d(%d)!", OP(*s), opnd);
248 1.1 pgoyette break;
249 1.1 pgoyette }
250 1.1 pgoyette if (!done)
251 1.1 pgoyette GAP();
252 1.1 pgoyette }
253 1.1 pgoyette }
254 1.1 pgoyette
255 1.1 pgoyette /*
256 1.1 pgoyette * regchar - make a character printable
257 1.1 pgoyette */
258 1.1 pgoyette static char * /* -> representation */
259 1.1 pgoyette regchar(int ch)
260 1.1 pgoyette {
261 1.1 pgoyette static char buf[10];
262 1.1 pgoyette
263 1.1 pgoyette if (isprint(ch) || ch == ' ')
264 1.1 pgoyette sprintf(buf, "%c", ch);
265 1.1 pgoyette else
266 1.1 pgoyette sprintf(buf, "\\%o", ch);
267 1.1 pgoyette return(buf);
268 1.1 pgoyette }
269