perlreapi.1

视频监控网络部分的协议ddns,的模块的实现代码,请大家大胆指正.

\&    {
\&        PERL_UNUSED_ARG(rx);
\&        return newSVpvs("re::engine::Example");
\&    }
.Ve
.PP
Any method calls on an object created with \f(CW\*(C`qr//\*(C'\fR will be dispatched to the
package as a normal object.
.PP
.Vb 3
\&    use re::engine::Example;
\&    my $re = qr//;
\&    $re\->meth; # dispatched to re::engine::Example::meth()
.Ve
.PP
To retrieve the \f(CW\*(C`REGEXP\*(C'\fR object from the scalar in an \s-1XS\s0 function use
the \f(CW\*(C`SvRX\*(C'\fR macro, see \*(L"\s-1REGEXP\s0 Functions\*(R" in perlapi.
.PP
.Vb 3
\&    void meth(SV * rv)
\&    PPCODE:
\&        REGEXP * re = SvRX(sv);
.Ve
.Sh "dupe"
.IX Subsection "dupe"
.Vb 1
\&    void* dupe(pTHX_ REGEXP * const rx, CLONE_PARAMS *param);
.Ve
.PP
On threaded builds a regexp may need to be duplicated so that the pattern
can be used by multiple threads. This routine is expected to handle the
duplication of any private data pointed to by the \f(CW\*(C`pprivate\*(C'\fR member of
the regexp structure.  It will be called with the preconstructed new
regexp structure as an argument, the \f(CW\*(C`pprivate\*(C'\fR member will point at
the \fBold\fR private structure, and it is this routine's responsibility to
construct a copy and return a pointer to it (which perl will then use to
overwrite the field as passed to this routine.)
.PP
This allows the engine to dupe its private data but also if necessary
modify the final structure if it really must.
.PP
On unthreaded builds this field doesn't exist.
.SH "The REGEXP structure"
.IX Header "The REGEXP structure"
The \s-1REGEXP\s0 struct is defined in \fIregexp.h\fR. All regex engines must be able to
correctly build such a structure in their \*(L"comp\*(R" routine.
.PP
The \s-1REGEXP\s0 structure contains all the data that perl needs to be aware of
to properly work with the regular expression. It includes data about
optimisations that perl can use to determine if the regex engine should
really be used, and various other control info that is needed to properly
execute patterns in various contexts such as is the pattern anchored in
some way, or what flags were used during the compile, or whether the
program contains special constructs that perl needs to be aware of.
.PP
In addition it contains two fields that are intended for the private
use of the regex engine that compiled the pattern. These are the
\&\f(CW\*(C`intflags\*(C'\fR and \f(CW\*(C`pprivate\*(C'\fR members. \f(CW\*(C`pprivate\*(C'\fR is a void pointer to
an arbitrary structure whose use and management is the responsibility
of the compiling engine. perl will never modify either of these
values.
.PP
.Vb 3
\&    typedef struct regexp {
\&        /* what engine created this regexp? */
\&        const struct regexp_engine* engine;
\&
\&        /* what re is this a lightweight copy of? */
\&        struct regexp* mother_re;
\&
\&        /* Information about the match that the perl core uses to manage things */
\&        U32 extflags;   /* Flags used both externally and internally */
\&        I32 minlen;     /* mininum possible length of string to match */
\&        I32 minlenret;  /* mininum possible length of $& */
\&        U32 gofs;       /* chars left of pos that we search from */
\&
\&        /* substring data about strings that must appear
\&           in the final match, used for optimisations */
\&        struct reg_substr_data *substrs;
\&
\&        U32 nparens;  /* number of capture buffers */
\&
\&        /* private engine specific data */
\&        U32 intflags;   /* Engine Specific Internal flags */
\&        void *pprivate; /* Data private to the regex engine which 
\&                           created this object. */
\&
\&        /* Data about the last/current match. These are modified during matching*/
\&        U32 lastparen;            /* last open paren matched */
\&        U32 lastcloseparen;       /* last close paren matched */
\&        regexp_paren_pair *swap;  /* Swap copy of *offs */
\&        regexp_paren_pair *offs;  /* Array of offsets for (@\-) and (@+) */
\&
\&        char *subbeg;  /* saved or original string so \edigit works forever. */
\&        SV_SAVED_COPY  /* If non\-NULL, SV which is COW from original */
\&        I32 sublen;    /* Length of string pointed by subbeg */
\&
\&        /* Information about the match that isn\*(Aqt often used */
\&        I32 prelen;           /* length of precomp */
\&        const char *precomp;  /* pre\-compilation regular expression */
\&
\&        char *wrapped;  /* wrapped version of the pattern */
\&        I32 wraplen;    /* length of wrapped */
\&
\&        I32 seen_evals;   /* number of eval groups in the pattern \- for security checks */
\&        HV *paren_names;  /* Optional hash of paren names */
\&
\&        /* Refcount of this regexp */
\&        I32 refcnt;             /* Refcount of this regexp */
\&    } regexp;
.Ve
.PP
The fields are discussed in more detail below:
.ie n .Sh """engine"""
.el .Sh "\f(CWengine\fP"
.IX Subsection "engine"
This field points at a regexp_engine structure which contains pointers
to the subroutines that are to be used for performing a match. It
is the compiling routine's responsibility to populate this field before
returning the regexp object.
.PP
Internally this is set to \f(CW\*(C`NULL\*(C'\fR unless a custom engine is specified in
\&\f(CW$^H{regcomp}\fR, perl's own set of callbacks can be accessed in the struct
pointed to by \f(CW\*(C`RE_ENGINE_PTR\*(C'\fR.
.ie n .Sh """mother_re"""
.el .Sh "\f(CWmother_re\fP"
.IX Subsection "mother_re"
\&\s-1TODO\s0, see <http://www.mail\-archive.com/perl5\[e-mail]/msg17328.html>
.ie n .Sh """extflags"""
.el .Sh "\f(CWextflags\fP"
.IX Subsection "extflags"
This will be used by perl to see what flags the regexp was compiled
with, this will normally be set to the value of the flags parameter by
the comp callback. See the comp documentation for
valid flags.
.ie n .Sh """minlen""\fP \f(CW""minlenret"""
.el .Sh "\f(CWminlen\fP \f(CWminlenret\fP"
.IX Subsection "minlen minlenret"
The minimum string length required for the pattern to match.  This is used to
prune the search space by not bothering to match any closer to the end of a
string than would allow a match. For instance there is no point in even
starting the regex engine if the minlen is 10 but the string is only 5
characters long. There is no way that the pattern can match.
.PP
\&\f(CW\*(C`minlenret\*(C'\fR is the minimum length of the string that would be found
in $& after a match.
.PP
The difference between \f(CW\*(C`minlen\*(C'\fR and \f(CW\*(C`minlenret\*(C'\fR can be seen in the
following pattern:
.PP
.Vb 1
\&    /ns(?=\ed)/
.Ve
.PP
where the \f(CW\*(C`minlen\*(C'\fR would be 3 but \f(CW\*(C`minlenret\*(C'\fR would only be 2 as the \ed is
required to match but is not actually included in the matched content. This
distinction is particularly important as the substitution logic uses the
\&\f(CW\*(C`minlenret\*(C'\fR to tell whether it can do in-place substitution which can result in
considerable speedup.
.ie n .Sh """gofs"""
.el .Sh "\f(CWgofs\fP"
.IX Subsection "gofs"
Left offset from \fIpos()\fR to start match at.
.ie n .Sh """substrs"""
.el .Sh "\f(CWsubstrs\fP"
.IX Subsection "substrs"
Substring data about strings that must appear in the final match. This
is currently only used internally by perl's engine for but might be
used in the future for all engines for optimisations.
.ie n .Sh """nparens""\fP, \f(CW""lasparen""\fP, and \f(CW""lastcloseparen"""
.el .Sh "\f(CWnparens\fP, \f(CWlasparen\fP, and \f(CWlastcloseparen\fP"
.IX Subsection "nparens, lasparen, and lastcloseparen"
These fields are used to keep track of how many paren groups could be matched
in the pattern, which was the last open paren to be entered, and which was
the last close paren to be entered.
.ie n .Sh """intflags"""
.el .Sh "\f(CWintflags\fP"
.IX Subsection "intflags"
The engine's private copy of the flags the pattern was compiled with. Usually
this is the same as \f(CW\*(C`extflags\*(C'\fR unless the engine chose to modify one of them.
.ie n .Sh """pprivate"""
.el .Sh "\f(CWpprivate\fP"
.IX Subsection "pprivate"
A void* pointing to an engine-defined data structure. The perl engine uses the
\&\f(CW\*(C`regexp_internal\*(C'\fR structure (see \*(L"Base Structures\*(R" in perlreguts) but a custom
engine should use something else.
.ie n .Sh """swap"""
.el .Sh "\f(CWswap\fP"
.IX Subsection "swap"
\&\s-1TODO:\s0 document
.ie n .Sh """offs"""
.el .Sh "\f(CWoffs\fP"
.IX Subsection "offs"
A \f(CW\*(C`regexp_paren_pair\*(C'\fR structure which defines offsets into the string being
matched which correspond to the \f(CW$&\fR and \f(CW$1\fR, \f(CW$2\fR etc. captures, the
\&\f(CW\*(C`regexp_paren_pair\*(C'\fR struct is defined as follows:
.PP
.Vb 4
\&    typedef struct regexp_paren_pair {
\&        I32 start;
\&        I32 end;
\&    } regexp_paren_pair;
.Ve
.PP
If \f(CW\*(C`\->offs[num].start\*(C'\fR or \f(CW\*(C`\->offs[num].end\*(C'\fR is \f(CW\*(C`\-1\*(C'\fR then that
capture buffer did not match. \f(CW\*(C`\->offs[0].start/end\*(C'\fR represents \f(CW$&\fR (or
\&\f(CW\*(C`${^MATCH\*(C'\fR under \f(CW\*(C`//p\*(C'\fR) and \f(CW\*(C`\->offs[paren].end\*(C'\fR matches \f(CW$$paren\fR where
\&\f(CW$paren \fR= 1>.
.ie n .Sh """precomp""\fP \f(CW""prelen"""
.el .Sh "\f(CWprecomp\fP \f(CWprelen\fP"
.IX Subsection "precomp prelen"
Used for optimisations. \f(CW\*(C`precomp\*(C'\fR holds a copy of the pattern that
was compiled and \f(CW\*(C`prelen\*(C'\fR its length. When a new pattern is to be
compiled (such as inside a loop) the internal \f(CW\*(C`regcomp\*(C'\fR operator
checks whether the last compiled \f(CW\*(C`REGEXP\*(C'\fR's \f(CW\*(C`precomp\*(C'\fR and \f(CW\*(C`prelen\*(C'\fR
are equivalent to the new one, and if so uses the old pattern instead
of compiling a new one.
.PP
The relevant snippet from \f(CW\*(C`Perl_pp_regcomp\*(C'\fR:
.PP
.Vb 3
\&        if (!re || !re\->precomp || re\->prelen != (I32)len ||
\&            memNE(re\->precomp, t, len))
\&        /* Compile a new pattern */
.Ve
.ie n .Sh """paren_names"""
.el .Sh "\f(CWparen_names\fP"
.IX Subsection "paren_names"
This is a hash used internally to track named capture buffers and their
offsets. The keys are the names of the buffers the values are dualvars,
with the \s-1IV\s0 slot holding the number of buffers with the given name and the
pv being an embedded array of I32.  The values may also be contained
independently in the data array in cases where named backreferences are
used.
.ie n .Sh """substrs"""
.el .Sh "\f(CWsubstrs\fP"
.IX Subsection "substrs"
Holds information on the longest string that must occur at a fixed
offset from the start of the pattern, and the longest string that must
occur at a floating offset from the start of the pattern. Used to do
Fast-Boyer-Moore searches on the string to find out if its worth using
the regex engine at all, and if so where in the string to search.
.ie n .Sh """subbeg""\fP \f(CW""sublen""\fP \f(CW""saved_copy"""
.el .Sh "\f(CWsubbeg\fP \f(CWsublen\fP \f(CWsaved_copy\fP"
.IX Subsection "subbeg sublen saved_copy"
Used during execution phase for managing search and replace patterns.
.ie n .Sh """wrapped""\fP \f(CW""wraplen"""
.el .Sh "\f(CWwrapped\fP \f(CWwraplen\fP"
.IX Subsection "wrapped wraplen"
Stores the string \f(CW\*(C`qr//\*(C'\fR stringifies to. The perl engine for example
stores \f(CW\*(C`(?\-xism:eek)\*(C'\fR in the case of \f(CW\*(C`qr/eek/\*(C'\fR.
.PP
When using a custom engine that doesn't support the \f(CW\*(C`(?:)\*(C'\fR construct
for inline modifiers, it's probably best to have \f(CW\*(C`qr//\*(C'\fR stringify to
the supplied pattern, note that this will create undesired patterns in
cases such as:
.PP
.Vb 3
\&    my $x = qr/a|b/;  # "a|b"
\&    my $y = qr/c/i;   # "c"
\&    my $z = qr/$x$y/; # "a|bc"
.Ve
.PP
There's no solution for this problem other than making the custom
engine understand a construct like \f(CW\*(C`(?:)\*(C'\fR.
.ie n .Sh """seen_evals"""
.el .Sh "\f(CWseen_evals\fP"
.IX Subsection "seen_evals"
This stores the number of eval groups in the pattern. This is used for security
purposes when embedding compiled regexes into larger patterns with \f(CW\*(C`qr//\*(C'\fR.
.ie n .Sh """refcnt"""
.el .Sh "\f(CWrefcnt\fP"
.IX Subsection "refcnt"
The number of times the structure is referenced. When this falls to 0 the
regexp is automatically freed by a call to pregfree. This should be set to 1 in
each engine's \*(L"comp\*(R" routine.
.SH "HISTORY"
.IX Header "HISTORY"
Originally part of perlreguts.
.SH "AUTHORS"
.IX Header "AUTHORS"
Originally written by Yves Orton, expanded by \*(AEvar Arnfjo\*:r\*(d\-
Bjarmason.
.SH "LICENSE"
.IX Header "LICENSE"
Copyright 2006 Yves Orton and 2007 \*(AEvar Arnfjo\*:r\*(d\- Bjarmason.
.PP
This program is free software; you can redistribute it and/or modify it under
the same terms as Perl itself.