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
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
|
/*
XXX support translate table
XXX support range parameter on search
XXX support mstop parameter on search
*/
/***********************************************************
Copyright 1991 by Stichting Mathematisch Centrum, Amsterdam, The
Netherlands.
All Rights Reserved
Permission to use, copy, modify, and distribute this software and its
documentation for any purpose and without fee is hereby granted,
provided that the above copyright notice appear in all copies and that
both that copyright notice and this permission notice appear in
supporting documentation, and that the names of Stichting Mathematisch
Centrum or CWI not be used in advertising or publicity pertaining to
distribution of the software without specific, written prior permission.
STICHTING MATHEMATISCH CENTRUM DISCLAIMS ALL WARRANTIES WITH REGARD TO
THIS SOFTWARE, INCLUDING ALL IMPLIED WARRANTIES OF MERCHANTABILITY AND
FITNESS, IN NO EVENT SHALL STICHTING MATHEMATISCH CENTRUM BE LIABLE
FOR ANY SPECIAL, 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.
******************************************************************/
/* Regular expression objects */
/* This uses Tatu Ylonen's copyleft-free reimplementation of
GNU regular expressions */
#include "allobjects.h"
#include "modsupport.h"
#include "regexpr.h"
static object *RegexError; /* Exception */
typedef struct {
OB_HEAD
struct re_pattern_buffer re_patbuf; /* The compiled expression */
struct re_registers re_regs; /* The registers from the last match */
int re_regs_valid; /* Nonzero if the registers are valid */
char re_fastmap[256]; /* Storage for fastmap */
} regexobject;
/* Regex object methods */
static void
reg_dealloc(re)
regexobject *re;
{
XDEL(re->re_patbuf.buffer);
XDEL(re->re_patbuf.translate);
DEL(re);
}
static object *
makeresult(regs)
struct re_registers *regs;
{
object *v = newtupleobject(RE_NREGS);
if (v != NULL) {
int i;
for (i = 0; i < RE_NREGS; i++) {
object *w, *u;
if ( (w = newtupleobject(2)) == NULL ||
(u = newintobject(regs->start[i])) == NULL ||
settupleitem(w, 0, u) != 0 ||
(u = newintobject(regs->end[i])) == NULL ||
settupleitem(w, 1, u) != 0) {
XDECREF(w);
DECREF(v);
return NULL;
}
settupleitem(v, i, w);
}
}
return v;
}
static object *
reg_match(re, args)
regexobject *re;
object *args;
{
object *v;
char *buffer;
int size;
int offset;
int result;
if (getargs(args, "s#", &buffer, &size)) {
offset = 0;
}
else {
err_clear();
if (!getargs(args, "(s#i)", &buffer, &size, &offset))
return NULL;
}
re->re_regs_valid = 0;
result = re_match(&re->re_patbuf, buffer, size, offset, &re->re_regs);
if (result < -1) {
/* Failure like stack overflow */
err_setstr(RegexError, "match failure");
return NULL;
}
re->re_regs_valid = result >= 0;
return newintobject((long)result); /* Length of the match or -1 */
}
static object *
reg_search(re, args)
regexobject *re;
object *args;
{
object *v;
char *buffer;
int size;
int offset;
int range;
int result;
if (getargs(args, "s#", &buffer, &size)) {
offset = 0;
}
else {
err_clear();
if (!getargs(args, "(s#i)", &buffer, &size, &offset))
return NULL;
}
if (offset < 0 || offset > size) {
err_setstr(RegexError, "search offset out of range");
return NULL;
}
/* NB: In Emacs 18.57, the documentation for re_search[_2] and
the implementation don't match: the documentation states that
|range| positions are tried, while the code tries |range|+1
positions. It seems more productive to believe the code! */
range = size - offset;
re->re_regs_valid = 0;
result = re_search(&re->re_patbuf, buffer, size, offset, range,
&re->re_regs);
if (result < -1) {
/* Failure like stack overflow */
err_setstr(RegexError, "match failure");
return NULL;
}
re->re_regs_valid = result >= 0;
return newintobject((long)result); /* Position of the match or -1 */
}
static struct methodlist reg_methods[] = {
{"match", reg_match},
{"search", reg_search},
{NULL, NULL} /* sentinel */
};
static object *
reg_getattr(re, name)
regexobject *re;
char *name;
{
if (strcmp(name, "regs") == 0) {
if (!re->re_regs_valid) {
err_setstr(RegexError,
"regs only valid after successful match/search");
return NULL;
}
return makeresult(&re->re_regs);
}
return findmethod(reg_methods, (object *)re, name);
}
static typeobject Regextype = {
OB_HEAD_INIT(&Typetype)
0, /*ob_size*/
"regex", /*tp_name*/
sizeof(regexobject), /*tp_size*/
0, /*tp_itemsize*/
/* methods */
reg_dealloc, /*tp_dealloc*/
0, /*tp_print*/
reg_getattr, /*tp_getattr*/
0, /*tp_setattr*/
0, /*tp_compare*/
0, /*tp_repr*/
};
static object *
newregexobject(pat, size)
char *pat;
int size;
{
regexobject *re;
re = NEWOBJ(regexobject, &Regextype);
if (re != NULL) {
char *error;
re->re_patbuf.buffer = NULL;
re->re_patbuf.allocated = 0;
re->re_patbuf.fastmap = re->re_fastmap;
re->re_patbuf.translate = NULL;
re->re_regs_valid = 0;
error = re_compile_pattern(pat, size, &re->re_patbuf);
if (error != NULL) {
err_setstr(RegexError, error);
DECREF(re);
re = NULL;
}
}
return (object *)re;
}
static object *
regex_compile(self, args)
object *self;
object *args;
{
char *pat;
int size;
if (!getargs(args, "s#", &pat, &size))
return NULL;
return newregexobject(pat, size);
}
static object *cache_pat;
static object *cache_prog;
static int
update_cache(pat)
object *pat;
{
if (pat != cache_pat) {
XDECREF(cache_pat);
cache_pat = NULL;
XDECREF(cache_prog);
cache_prog = regex_compile((object *)NULL, pat);
if (cache_prog == NULL)
return -1;
cache_pat = pat;
INCREF(cache_pat);
}
return 0;
}
static object *
regex_match(self, args)
object *self;
object *args;
{
object *pat, *string;
if (!getStrStrarg(args, &pat, &string))
return NULL;
if (update_cache(pat) < 0)
return NULL;
return reg_match((regexobject *)cache_prog, string);
}
static object *
regex_search(self, args)
object *self;
object *args;
{
object *pat, *string;
if (!getStrStrarg(args, &pat, &string))
return NULL;
if (update_cache(pat) < 0)
return NULL;
return reg_search((regexobject *)cache_prog, string);
}
static object *
regex_set_syntax(self, args)
object *self, *args;
{
int syntax;
if (!getintarg(args, &syntax))
return NULL;
syntax = re_set_syntax(syntax);
return newintobject((long)syntax);
}
static struct methodlist regex_global_methods[] = {
{"compile", regex_compile},
{"match", regex_match},
{"search", regex_search},
{"set_syntax", regex_set_syntax},
{NULL, NULL} /* sentinel */
};
initregex()
{
object *m, *d;
m = initmodule("regex", regex_global_methods);
d = getmoduledict(m);
/* Initialize regex.error exception */
RegexError = newstringobject("regex.error");
if (RegexError == NULL || dictinsert(d, "error", RegexError) != 0)
fatal("can't define regex.error");
}
|