]> git.vpit.fr Git - perl/modules/re-engine-Hooks.git/blob - Hooks.xs
Correct the return value from reh_private_map_store()
[perl/modules/re-engine-Hooks.git] / Hooks.xs
1 /* This file is part of the re::engine::Hooks Perl module.
2  * See http://search.cpan.org/dist/re-engine-Hooks/ */
3
4 #define PERL_NO_GET_CONTEXT
5 #include "EXTERN.h"
6 #include "perl.h"
7 #include "XSUB.h"
8
9 #define __PACKAGE__     "re::engine::Hooks"
10 #define __PACKAGE_LEN__ (sizeof(__PACKAGE__)-1)
11
12 /* --- Compatibility wrappers ---------------------------------------------- */
13
14 #define REH_HAS_PERL(R, V, S) (PERL_REVISION > (R) || (PERL_REVISION == (R) && (PERL_VERSION > (V) || (PERL_VERSION == (V) && (PERL_SUBVERSION >= (S))))))
15
16 #ifndef SvPV_const
17 # define SvPV_const(S, L) SvPV(S, L)
18 #endif
19
20 /* ... Thread safety and multiplicity ...................................... */
21
22 #ifndef REH_MULTIPLICITY
23 # if defined(MULTIPLICITY) || defined(PERL_IMPLICIT_CONTEXT)
24 #  define REH_MULTIPLICITY 1
25 # else
26 #  define REH_MULTIPLICITY 0
27 # endif
28 #endif
29
30 #ifdef USE_ITHREADS
31 # define REH_LOCK(M)   MUTEX_LOCK(M)
32 # define REH_UNLOCK(M) MUTEX_UNLOCK(M)
33 #else
34 # define REH_LOCK(M)   NOOP
35 # define REH_UNLOCK(M) NOOP
36 #endif
37
38 /* --- Lexical hints ------------------------------------------------------- */
39
40 STATIC U32 reh_hash = 0;
41
42 STATIC SV *reh_hint(pTHX) {
43 #define reh_hint() reh_hint(aTHX)
44  SV *hint;
45
46 #ifdef cop_hints_fetch_pvn
47  hint = cop_hints_fetch_pvn(PL_curcop, __PACKAGE__, __PACKAGE_LEN__,
48                                        reh_hash, 0);
49 #elif REH_HAS_PERL(5, 9, 5)
50  hint = Perl_refcounted_he_fetch(aTHX_ PL_curcop->cop_hints_hash,
51                                        NULL,
52                                        __PACKAGE__, __PACKAGE_LEN__,
53                                        0,
54                                        reh_hash);
55 #else
56  SV **val = hv_fetch(GvHV(PL_hintgv), __PACKAGE__, __PACKAGE_LEN__, 0);
57  if (!val)
58   return 0;
59  hint = *val;
60 #endif
61
62  return hint;
63 }
64
65 /* --- Public API ---------------------------------------------------------- */
66
67 #include "re_engine_hooks.h"
68
69 typedef struct reh_action {
70  struct reh_action *next;
71  reh_config         cbs;
72  const char        *key;
73  STRLEN             klen;
74 } reh_action;
75
76 STATIC reh_action *reh_action_list = 0;
77
78 #ifdef USE_ITHREADS
79
80 STATIC perl_mutex reh_action_list_mutex;
81
82 #endif /* USE_ITHREADS */
83
84 #undef reh_register
85 void reh_register(pTHX_ const char *key, reh_config *cfg) {
86  reh_action *a;
87  char       *key_dup;
88  STRLEN      i, len;
89
90  len = strlen(key);
91  for (i = 0; i < len; ++i)
92   if (!isALNUM(key[i]) && key[i] != ':')
93    croak("Invalid key");
94  key_dup = PerlMemShared_malloc(len + 1);
95  memcpy(key_dup, key, len);
96  key_dup[len] = '\0';
97
98  a       = PerlMemShared_malloc(sizeof *a);
99  a->cbs  = *cfg;
100  a->key  = key_dup;
101  a->klen = len;
102
103  REH_LOCK(&reh_action_list_mutex);
104  a->next         = reh_action_list;
105  reh_action_list = a;
106  REH_UNLOCK(&reh_action_list_mutex);
107
108  return;
109 }
110
111 /* --- Custom regexp engine ------------------------------------------------ */
112
113 #if PERL_VERSION <= 10
114 # define rxREGEXP(RX)  (RX)
115 #else
116 # define rxREGEXP(RX)  (SvANY(RX))
117 #endif
118
119 #if PERL_VERSION <= 10
120 EXTERN_C REGEXP *reh_regcomp(pTHX_ const SV * const, const U32);
121 #else
122 EXTERN_C REGEXP *reh_regcomp(pTHX_ SV * const, U32);
123 #endif
124 EXTERN_C I32     reh_regexec(pTHX_ REGEXP * const, char *, char *,
125                                    char *, I32, SV *, void *, U32);
126 EXTERN_C char *  reh_re_intuit_start(pTHX_ REGEXP * const, SV *, char *,
127                                            char *, U32, re_scream_pos_data *);
128 EXTERN_C SV *    reh_re_intuit_string(pTHX_ REGEXP * const);
129 EXTERN_C void    reh_regfree(pTHX_ REGEXP * const);
130 EXTERN_C void    reh_re_free(pTHX_ REGEXP * const);
131 EXTERN_C void    reh_reg_numbered_buff_fetch(pTHX_ REGEXP * const,
132                                                    const I32, SV * const);
133 EXTERN_C void    reh_reg_numbered_buff_store(pTHX_ REGEXP * const,
134                                                    const I32, SV const * const);
135 EXTERN_C I32     reh_reg_numbered_buff_length(pTHX_ REGEXP * const,
136                                                    const SV * const, const I32);
137 EXTERN_C SV *    reh_reg_named_buff(pTHX_ REGEXP * const, SV * const,
138                                           SV * const, const U32);
139 EXTERN_C SV *    reh_reg_named_buff_iter(pTHX_ REGEXP * const,
140                                                const SV * const, const U32);
141 EXTERN_C SV *    reh_reg_qr_package(pTHX_ REGEXP * const);
142 #ifdef USE_ITHREADS
143 EXTERN_C void *  reh_regdupe(pTHX_ REGEXP * const, CLONE_PARAMS *);
144 EXTERN_C void *  reh_re_dupe(pTHX_ REGEXP * const, CLONE_PARAMS *);
145 #endif
146 #if REH_HAS_PERL(5, 17, 1)
147 EXTERN_C REGEXP *reh_op_compile(pTHX_ SV ** const patternp, int pat_count, OP *expr, const regexp_engine* eng, REGEXP *VOL old_re, bool *is_bare_re, U32 orig_rx_flags, U32 pm_flags);
148 #endif
149
150 const struct regexp_engine reh_regexp_engine = {
151  reh_regcomp,
152  reh_regexec,
153  reh_re_intuit_start,
154  reh_re_intuit_string,
155  reh_re_free,
156  reh_reg_numbered_buff_fetch,
157  reh_reg_numbered_buff_store,
158  reh_reg_numbered_buff_length,
159  reh_reg_named_buff,
160  reh_reg_named_buff_iter,
161  reh_reg_qr_package
162 #if defined(USE_ITHREADS)
163  , reh_re_dupe
164 #endif
165 #if REH_HAS_PERL(5, 17, 1)
166  , reh_op_compile
167 #endif
168 };
169
170 /* --- Internal regexp structure -> hook list inside-out mapping ----------- */
171
172 typedef struct {
173  size_t            count;
174  const reh_config *cbs;
175  U32               refcount;
176 } reh_private;
177
178 STATIC void reh_private_free(pTHX_ reh_private *priv) {
179 #define reh_private_free(P) reh_private_free(aTHX_ (P))
180  if (priv->refcount <= 1) {
181   PerlMemShared_free((void *) priv->cbs);
182   PerlMemShared_free(priv);
183  } else {
184   --priv->refcount;
185  }
186 }
187
188 #define PTABLE_NAME        ptable_private
189 #define PTABLE_VAL_FREE(V) reh_private_free(V)
190
191 #define pPTBL  pTHX
192 #define pPTBL_ pTHX_
193 #define aPTBL  aTHX
194 #define aPTBL_ aTHX_
195
196 #include "ptable.h"
197
198 #define ptable_private_store(T, K, V) ptable_private_store(aTHX_ (T), (K), (V))
199 #define ptable_private_delete(T, K)   ptable_private_delete(aTHX_ (T), (K))
200 #define ptable_private_clear(T)       ptable_private_clear(aTHX_ (T))
201 #define ptable_private_free(T)        ptable_private_free(aTHX_ (T))
202
203 STATIC ptable *reh_private_map;
204
205 #ifdef USE_ITHREADS
206
207 STATIC perl_mutex reh_private_map_mutex;
208
209 #endif /* USE_ITHREADS */
210
211 #define REH_PRIVATE_MAP_FOREACH(C) STMT_START {      \
212  reh_private *priv;                                  \
213  REH_LOCK(&reh_private_map_mutex);                   \
214  priv = ptable_fetch(reh_private_map, rx->pprivate); \
215  if (priv) {                                         \
216   const reh_config *cbs = priv->cbs;                 \
217   if (cbs) {                                         \
218    const reh_config *end = cbs + priv->count;        \
219    for (; cbs < end; ++cbs) {                        \
220     (C);                                             \
221    }                                                 \
222   }                                                  \
223  }                                                   \
224  REH_UNLOCK(&reh_private_map_mutex);                 \
225 } STMT_END
226
227 STATIC void reh_private_map_store(pTHX_ void *ri, reh_private *priv) {
228 #define reh_private_map_store(R, P) reh_private_map_store(aTHX_ (R), (P))
229  REH_LOCK(&reh_private_map_mutex);
230  ptable_private_store(reh_private_map, ri, priv);
231  REH_UNLOCK(&reh_private_map_mutex);
232
233  return;
234 }
235
236 STATIC void reh_private_map_copy(pTHX_ void *ri_from, void *ri_to) {
237 #define reh_private_map_copy(F, T) reh_private_map_copy(aTHX_ (F), (T))
238  reh_private *priv;
239
240  REH_LOCK(&reh_private_map_mutex);
241  priv = ptable_fetch(reh_private_map, ri_from);
242  if (priv) {
243   ++priv->refcount;
244   ptable_private_store(reh_private_map, ri_to, priv);
245  }
246  REH_UNLOCK(&reh_private_map_mutex);
247 }
248
249 STATIC void reh_private_map_delete(pTHX_ void *ri) {
250 #define reh_private_map_delete(R) reh_private_map_delete(aTHX_ (R))
251  REH_LOCK(&reh_private_map_mutex);
252  ptable_private_delete(reh_private_map, ri);
253  REH_UNLOCK(&reh_private_map_mutex);
254
255  return;
256 }
257
258 /* --- Private API --------------------------------------------------------- */
259
260 void reh_call_comp_begin_hook(pTHX_ regexp *rx) {
261  SV *hint = reh_hint();
262
263  if (hint && SvPOK(hint)) {
264   STRLEN      len;
265   const char *keys  = SvPV_const(hint, len);
266   size_t      count = 0;
267
268   reh_private *priv;
269   reh_config  *cbs = NULL;
270   reh_action  *a, *root;
271
272   REH_LOCK(&reh_action_list_mutex);
273   root = reh_action_list;
274   REH_UNLOCK(&reh_action_list_mutex);
275
276   for (a = root; a; a = a->next) {
277    char *p = strstr(keys, a->key);
278
279    if (p && (p + a->klen <= keys + len) && p[a->klen] == ' ')
280     ++count;
281   }
282
283   if (count) {
284    size_t i = 0;
285
286    cbs = PerlMemShared_malloc(count * sizeof *cbs);
287
288    for (a = root; a; a = a->next) {
289     char *p = strstr(keys, a->key);
290
291     if (p && (p + a->klen <= keys + len) && p[a->klen] == ' ')
292      cbs[i++] = a->cbs;
293    }
294   }
295
296   priv = PerlMemShared_malloc(sizeof *priv);
297   priv->count    = count;
298   priv->cbs      = cbs;
299   priv->refcount = 1;
300
301   rx->engine = &reh_regexp_engine;
302
303   reh_private_map_store(rx->pprivate, priv);
304  }
305 }
306
307 void reh_call_comp_node_hook(pTHX_ regexp *rx, regnode *node) {
308  REH_PRIVATE_MAP_FOREACH(cbs->comp_node(aTHX_ rx, node));
309 }
310
311 void reh_call_exec_node_hook(pTHX_ regexp *rx, regnode *node, regmatch_info *reginfo, regmatch_state *st) {
312  REH_PRIVATE_MAP_FOREACH(cbs->exec_node(aTHX_ rx, node, reginfo, st));
313 }
314
315 void reh_re_free(pTHX_ REGEXP * const RX) {
316  regexp *rx = rxREGEXP(RX);
317
318  reh_private_map_delete(rx->pprivate);
319
320  reh_regfree(aTHX_ RX);
321 }
322
323 #ifdef USE_ITHREADS
324
325 void *reh_re_dupe(pTHX_ REGEXP * const RX, CLONE_PARAMS *param) {
326  regexp *rx = rxREGEXP(RX);
327  void   *new_ri;
328
329  new_ri = reh_regdupe(aTHX_ RX, param);
330
331  reh_private_map_copy(rx->pprivate, new_ri);
332
333  return new_ri;
334 }
335
336 #endif
337
338 STATIC void reh_teardown(pTHX_ void *root) {
339 #if REH_MULTIPLICITY
340  if (aTHX != root)
341   return;
342 #endif
343
344  ptable_private_free(reh_private_map);
345 }
346
347 /* --- XS ------------------------------------------------------------------ */
348
349 MODULE = re::engine::Hooks          PACKAGE = re::engine::Hooks
350
351 PROTOTYPES: ENABLE
352
353 BOOT:
354 {
355  reh_private_map = ptable_new();
356 #ifdef USE_ITHREADS
357  MUTEX_INIT(&reh_action_list_mutex);
358  MUTEX_INIT(&reh_private_map_mutex);
359 #endif
360  PERL_HASH(reh_hash, __PACKAGE__, __PACKAGE_LEN__);
361 #if REH_MULTIPLICITY
362  call_atexit(reh_teardown, aTHX);
363 #else
364  call_atexit(reh_teardown, NULL);
365 #endif
366 }
367
368 void
369 _ENGINE()
370 PROTOTYPE:
371 PPCODE:
372  XPUSHs(sv_2mortal(newSViv(PTR2IV(&reh_regexp_engine))));
373
374 void
375 _registered(SV *key)
376 PROTOTYPE: $
377 PREINIT:
378  SV         *ret = NULL;
379  reh_action *a;
380  STRLEN      len;
381  const char *s;
382 PPCODE:
383  REH_LOCK(&reh_action_list_mutex);
384  a = reh_action_list;
385  REH_UNLOCK(&reh_action_list_mutex);
386  s = SvPV_const(key, len);
387  while (a && !ret) {
388   if (a->klen == len && memcmp(a->key, s, len) == 0)
389    ret = &PL_sv_yes;
390   a = a->next;
391  }
392  if (!ret)
393   ret = &PL_sv_no;
394  EXTEND(SP, 1);
395  PUSHs(ret);
396  XSRETURN(1);