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
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
|
#if defined(PERL_EXT_RE_DEBUG) && !defined(DEBUGGING)
# define DEBUGGING
#endif
#define PERL_NO_GET_CONTEXT
#include "EXTERN.h"
#include "perl.h"
#include "XSUB.h"
#include "re_comp.h"
START_EXTERN_C
extern regexp* my_re_compile (pTHX_ char* exp, char* xend, PMOP* pm);
extern I32 my_regexec (pTHX_ regexp* prog, char* stringarg, char* strend,
char* strbeg, I32 minend, SV* screamer,
void* data, U32 flags);
extern char* my_re_intuit_start (pTHX_ regexp *prog, SV *sv, char *strpos,
char *strend, U32 flags,
struct re_scream_pos_data_s *data);
extern SV* my_re_intuit_string (pTHX_ regexp *prog);
extern void my_regfree (pTHX_ struct regexp* r);
#if defined(USE_ITHREADS)
extern void* my_regdupe (pTHX_ const regexp *r, CLONE_PARAMS *param);
#endif
EXTERN_C const struct regexp_engine my_reg_engine;
END_EXTERN_C
const struct regexp_engine my_reg_engine = {
my_re_compile,
my_regexec,
my_re_intuit_start,
my_re_intuit_string,
my_regfree,
#if defined(USE_ITHREADS)
my_regdupe
#endif
};
regexp *
get_re_arg( pTHX_ SV *sv, U32 flags, MAGIC **mgp) {
MAGIC *mg;
if (sv) {
if (SvMAGICAL(sv))
mg_get(sv);
if (SvROK(sv) &&
(sv = (SV*)SvRV(sv)) && /* assign deliberate */
SvTYPE(sv) == SVt_PVMG &&
(mg = mg_find(sv, PERL_MAGIC_qr))) /* assign deliberate */
{
if (mgp) *mgp = mg;
return (regexp *)mg->mg_obj;
}
}
if (mgp) *mgp = NULL;
return ((flags && PL_curpm) ? PM_GETRE(PL_curpm) : NULL);
}
MODULE = re PACKAGE = re
void
install()
PPCODE:
PL_colorset = 0; /* Allow reinspection of ENV. */
/* PL_debug |= DEBUG_r_FLAG; */
XPUSHs(sv_2mortal(newSViv(PTR2IV(&my_reg_engine))));
void
is_regexp(sv)
SV * sv
PROTOTYPE: $
PPCODE:
{
if ( get_re_arg( aTHX_ sv, 0, NULL ) )
{
XSRETURN_YES;
} else {
XSRETURN_NO;
}
/* NOTREACHED */
}
void
regexp_pattern(sv)
SV * sv
PROTOTYPE: $
PREINIT:
MAGIC *mg;
regexp *re;
PPCODE:
{
/*
Checks if a reference is a regex or not. If the parameter is
not a ref, or is not the result of a qr// then returns false
in scalar context and an empty list in list context.
Otherwise in list context it returns the pattern and the
modifiers, in scalar context it returns the pattern just as it
would if the qr// was stringified normally, regardless as
to the class of the variable and any strigification overloads
on the object.
*/
if ( re = get_re_arg( aTHX_ sv, 0, &mg) ) /* assign deliberate */
{
/* Housten, we have a regex! */
SV *pattern;
STRLEN patlen = 0;
STRLEN left = 0;
char reflags[6];
if ( GIMME_V == G_ARRAY ) {
/*
we are in list context so stringify
the modifiers that apply. We ignore "negative
modifiers" in this scenario.
*/
char *fptr = INT_PAT_MODS;
char ch;
U16 match_flags = (U16)((re->extflags & PMf_COMPILETIME) >> 12);
while((ch = *fptr++)) {
if(match_flags & 1) {
reflags[left++] = ch;
}
match_flags >>= 1;
}
pattern = sv_2mortal(newSVpvn(re->precomp,re->prelen));
if (re->extflags & RXf_UTF8) SvUTF8_on(pattern);
/* return the pattern and the modifiers */
XPUSHs(pattern);
XPUSHs(sv_2mortal(newSVpvn(reflags,left)));
XSRETURN(2);
} else {
/* Scalar, so use the string that Perl would return */
/* return the pattern in (?msix:..) format */
pattern = sv_2mortal(newSVpvn(re->wrapped,re->wraplen));
if (re->extflags & RXf_UTF8)
SvUTF8_on(pattern);
XPUSHs(pattern);
XSRETURN(1);
}
} else {
/* It ain't a regexp folks */
if ( GIMME_V == G_ARRAY ) {
/* return the empty list */
XSRETURN_UNDEF;
} else {
/* Because of the (?:..) wrapping involved in a
stringified pattern it is impossible to get a
result for a real regexp that would evaluate to
false. Therefore we can return PL_sv_no to signify
that the object is not a regex, this means that one
can say
if (regex($might_be_a_regex) eq '(?:foo)') { }
and not worry about undefined values.
*/
XSRETURN_NO;
}
}
/* NOT-REACHED */
}
void
regmust(sv)
SV * sv
PROTOTYPE: $
PREINIT:
regexp *re;
PPCODE:
{
if ( re = get_re_arg( aTHX_ sv, 0, 0) ) /* assign deliberate */
{
SV *an = &PL_sv_no;
SV *fl = &PL_sv_no;
if (re->anchored_substr) {
an = newSVsv(re->anchored_substr);
} else if (re->anchored_utf8) {
an = newSVsv(re->anchored_utf8);
}
if (re->float_substr) {
fl = newSVsv(re->float_substr);
} else if (re->float_utf8) {
fl = newSVsv(re->float_utf8);
}
XPUSHs(an);
XPUSHs(fl);
XSRETURN(2);
}
XSRETURN_UNDEF;
}
void
regname(sv, qr = NULL, all = NULL)
SV * sv
SV * qr
SV * all
PROTOTYPE: ;$$$
PREINIT:
regexp *re = NULL;
SV *bufs = NULL;
PPCODE:
{
re = get_re_arg( aTHX_ qr, 1, NULL);
if (SvPOK(sv) && re && re->paren_names) {
bufs = Perl_reg_named_buff_get(aTHX_ sv, re ,all && SvTRUE(all));
if (bufs) {
if (all && SvTRUE(all))
XPUSHs(newRV(bufs));
else
XPUSHs(SvREFCNT_inc(bufs));
XSRETURN(1);
}
}
XSRETURN_UNDEF;
}
void
regnames(sv = NULL, all = NULL)
SV *sv
SV *all
PROTOTYPE: ;$$
PREINIT:
regexp *re = NULL;
IV count = 0;
PPCODE:
{
re = get_re_arg( aTHX_ sv, 1, NULL );
if (re && re->paren_names) {
HV *hv= re->paren_names;
(void)hv_iterinit(hv);
while (1) {
HE *temphe = hv_iternext_flags(hv,0);
if (temphe) {
IV i;
IV parno = 0;
SV* sv_dat = HeVAL(temphe);
I32 *nums = (I32*)SvPVX(sv_dat);
for ( i = 0; i < SvIVX(sv_dat); i++ ) {
if ((I32)(re->lastcloseparen) >= nums[i] &&
re->startp[nums[i]] != -1 &&
re->endp[nums[i]] != -1)
{
parno = nums[i];
break;
}
}
if (parno || (all && SvTRUE(all))) {
STRLEN len;
char *pv = HePV(temphe, len);
if ( GIMME_V == G_ARRAY )
XPUSHs(newSVpvn(pv,len));
count++;
}
} else {
break;
}
}
}
if ( GIMME_V == G_ARRAY )
XSRETURN(count);
else
XSRETURN_UNDEF;
}
void
regnames_iterinit(sv = NULL)
SV * sv
PROTOTYPE: ;$
PREINIT:
regexp *re = NULL;
PPCODE:
{
re = get_re_arg( aTHX_ sv, 1, NULL );
if (re && re->paren_names) {
(void)hv_iterinit(re->paren_names);
XPUSHs(newSViv(HvTOTALKEYS(re->paren_names)));
} else {
XSRETURN_UNDEF;
}
}
void
regnames_iternext(sv = NULL, all = NULL)
SV *sv
SV *all
PROTOTYPE: ;$$
PREINIT:
regexp *re;
PPCODE:
{
re = get_re_arg( aTHX_ sv, 1, NULL );
if (re && re->paren_names) {
HV *hv= re->paren_names;
while (1) {
HE *temphe = hv_iternext_flags(hv,0);
if (temphe) {
IV i;
IV parno = 0;
SV* sv_dat = HeVAL(temphe);
I32 *nums = (I32*)SvPVX(sv_dat);
for ( i = 0; i < SvIVX(sv_dat); i++ ) {
if ((I32)(re->lastcloseparen) >= nums[i] &&
re->startp[nums[i]] != -1 &&
re->endp[nums[i]] != -1)
{
parno = nums[i];
break;
}
}
if (parno || (all && SvTRUE(all))) {
STRLEN len;
char *pv = HePV(temphe, len);
XPUSHs(newSVpvn(pv,len));
XSRETURN(1);
}
} else {
break;
}
}
}
XSRETURN_UNDEF;
}
void
regnames_count(sv = NULL)
SV * sv
PROTOTYPE: ;$
PREINIT:
regexp *re = NULL;
PPCODE:
{
re = get_re_arg( aTHX_ sv, 1, NULL );
if (re && re->paren_names) {
XPUSHs(newSViv(HvTOTALKEYS(re->paren_names)));
} else {
XSRETURN_UNDEF;
}
}
|
