Set_Node_Offset_Length(convert,mjd_offset,mjd_nodelen);
});
} /* end node insert */
+ REH_CALL_COMP_NODE_HOOK(pRExC_state->rx, convert);
/* Finish populating the prev field of the wordinfo array. Walk back
* from each accept state until we find another accept state, and if
#ifndef PERL_IN_XSUB_RE
-#define RE_ENGINE_PTR &PL_core_reg_engine
+#define RE_ENGINE_PTR &reh_regexp_engine
#else
extern const struct regexp_engine my_reg_engine;
#define RE_ENGINE_PTR &my_reg_engine
NODE_ALIGN_FILL(ret);
ptr = ret;
FILL_ADVANCE_NODE(ptr, op);
- REH_CALL_REGCOMP_HOOK(pRExC_state->rx, (ptr) - 1);
+ REH_CALL_COMP_NODE_HOOK(pRExC_state->rx, (ptr) - 1);
#ifdef RE_TRACK_PATTERN_OFFSETS
if (RExC_offsets) { /* MJD */
MJD_OFFSET_DEBUG(("%s:%d: (op %s) %s %"UVuf" (len %"UVuf") (max %"UVuf").\n",
NODE_ALIGN_FILL(ret);
ptr = ret;
FILL_ADVANCE_NODE_ARG(ptr, op, arg);
- REH_CALL_REGCOMP_HOOK(pRExC_state->rx, (ptr) - 2);
+ REH_CALL_COMP_NODE_HOOK(pRExC_state->rx, (ptr) - 2);
#ifdef RE_TRACK_PATTERN_OFFSETS
if (RExC_offsets) { /* MJD */
MJD_OFFSET_DEBUG(("%s(%d): (op %s) %s %"UVuf" <- %"UVuf" (max %"UVuf").\n",
#endif
src = NEXTOPER(place);
FILL_ADVANCE_NODE(place, op);
- REH_CALL_REGCOMP_HOOK(pRExC_state->rx, (place) - 1);
+ REH_CALL_COMP_NODE_HOOK(pRExC_state->rx, (place) - 1);
Zero(src, offset, regnode);
}