Final source file tidies for 10.10-RC1
This commit is contained in:
parent
8fe95cf804
commit
49a7eada2d
|
@ -1,8 +1,8 @@
|
||||||
Change Log for PCRE2
|
Change Log for PCRE2
|
||||||
--------------------
|
--------------------
|
||||||
|
|
||||||
Version 10.10 xx-xxx-2015
|
Version 10.10 20-February-2015
|
||||||
-------------------------
|
------------------------------
|
||||||
|
|
||||||
1. When a pattern is compiled, it remembers the highest back reference so that
|
1. When a pattern is compiled, it remembers the highest back reference so that
|
||||||
when matching, if the ovector is too small, extra memory can be obtained to
|
when matching, if the ovector is too small, extra memory can be obtained to
|
||||||
|
|
13
NEWS
13
NEWS
|
@ -1,6 +1,19 @@
|
||||||
News about PCRE2 releases
|
News about PCRE2 releases
|
||||||
-------------------------
|
-------------------------
|
||||||
|
|
||||||
|
Version 10.10 20-February-2015
|
||||||
|
------------------------------
|
||||||
|
|
||||||
|
1. Serialization and de-serialization functions have been added to the API,
|
||||||
|
making it possible to save and restore sets of compiled patterns, though
|
||||||
|
restoration must be done in the same environment that was used for compilation.
|
||||||
|
|
||||||
|
2. The (*NO_JIT) feature has been added; this makes it possible for a pattern
|
||||||
|
creator to specify that JIT is not to be used.
|
||||||
|
|
||||||
|
3. A number of bugs have been fixed.
|
||||||
|
|
||||||
|
|
||||||
Version 10.00 05-January-2015
|
Version 10.00 05-January-2015
|
||||||
-----------------------------
|
-----------------------------
|
||||||
|
|
||||||
|
|
|
@ -11,15 +11,15 @@ dnl be defined as -RC2, for example. For real releases, it should be empty.
|
||||||
m4_define(pcre2_major, [10])
|
m4_define(pcre2_major, [10])
|
||||||
m4_define(pcre2_minor, [10])
|
m4_define(pcre2_minor, [10])
|
||||||
m4_define(pcre2_prerelease, [-RC1])
|
m4_define(pcre2_prerelease, [-RC1])
|
||||||
m4_define(pcre2_date, [2014-01-13])
|
m4_define(pcre2_date, [2015-02-20])
|
||||||
|
|
||||||
# NOTE: The CMakeLists.txt file searches for the above variables in the first
|
# NOTE: The CMakeLists.txt file searches for the above variables in the first
|
||||||
# 50 lines of this file. Please update that if the variables above are moved.
|
# 50 lines of this file. Please update that if the variables above are moved.
|
||||||
|
|
||||||
# Libtool shared library interface versions (current:revision:age)
|
# Libtool shared library interface versions (current:revision:age)
|
||||||
m4_define(libpcre2_8_version, [0:0:0])
|
m4_define(libpcre2_8_version, [1:0:1])
|
||||||
m4_define(libpcre2_16_version, [0:0:0])
|
m4_define(libpcre2_16_version, [1:0:1])
|
||||||
m4_define(libpcre2_32_version, [0:0:0])
|
m4_define(libpcre2_32_version, [1:0:1])
|
||||||
m4_define(libpcre2_posix_version, [0:0:0])
|
m4_define(libpcre2_posix_version, [0:0:0])
|
||||||
|
|
||||||
AC_PREREQ(2.57)
|
AC_PREREQ(2.57)
|
||||||
|
|
|
@ -162,6 +162,14 @@ of arbitrary characters). For more details, see the
|
||||||
documentation.
|
documentation.
|
||||||
</P>
|
</P>
|
||||||
<br><b>
|
<br><b>
|
||||||
|
Disabling JIT compilation
|
||||||
|
</b><br>
|
||||||
|
<P>
|
||||||
|
If a pattern that starts with (*NO_JIT) is successfully compiled, an attempt by
|
||||||
|
the application to apply the JIT optimization by calling
|
||||||
|
<b>pcre2_jit_compile()</b> is ignored.
|
||||||
|
</P>
|
||||||
|
<br><b>
|
||||||
Setting match and recursion limits
|
Setting match and recursion limits
|
||||||
</b><br>
|
</b><br>
|
||||||
<P>
|
<P>
|
||||||
|
@ -1715,8 +1723,8 @@ items:
|
||||||
the \R escape sequence
|
the \R escape sequence
|
||||||
an escape such as \d or \pL that matches a single character
|
an escape such as \d or \pL that matches a single character
|
||||||
a character class
|
a character class
|
||||||
a back reference (see next section)
|
a back reference
|
||||||
a parenthesized subpattern (including assertions)
|
a parenthesized subpattern (including most assertions)
|
||||||
a subroutine call to a subpattern (recursive or otherwise)
|
a subroutine call to a subpattern (recursive or otherwise)
|
||||||
</pre>
|
</pre>
|
||||||
The general repetition quantifier specifies a minimum and maximum number of
|
The general repetition quantifier specifies a minimum and maximum number of
|
||||||
|
@ -2126,10 +2134,11 @@ capturing is carried out only for positive assertions. (Perl sometimes, but not
|
||||||
always, does do capturing in negative assertions.)
|
always, does do capturing in negative assertions.)
|
||||||
</P>
|
</P>
|
||||||
<P>
|
<P>
|
||||||
For compatibility with Perl, assertion subpatterns may be repeated; though
|
For compatibility with Perl, most assertion subpatterns may be repeated; though
|
||||||
it makes no sense to assert the same thing several times, the side effect of
|
it makes no sense to assert the same thing several times, the side effect of
|
||||||
capturing parentheses may occasionally be useful. In practice, there only three
|
capturing parentheses may occasionally be useful. However, an assertion that
|
||||||
cases:
|
forms the condition for a conditional subpattern may not be quantified. In
|
||||||
|
practice, for other assertions, there only three cases:
|
||||||
<br>
|
<br>
|
||||||
<br>
|
<br>
|
||||||
(1) If the quantifier is {0}, the assertion is never obeyed during matching.
|
(1) If the quantifier is {0}, the assertion is never obeyed during matching.
|
||||||
|
@ -3249,7 +3258,7 @@ Cambridge, England.
|
||||||
</P>
|
</P>
|
||||||
<br><a name="SEC30" href="#TOC1">REVISION</a><br>
|
<br><a name="SEC30" href="#TOC1">REVISION</a><br>
|
||||||
<P>
|
<P>
|
||||||
Last updated: 26 January 2015
|
Last updated: 28 January 2015
|
||||||
<br>
|
<br>
|
||||||
Copyright © 1997-2015 University of Cambridge.
|
Copyright © 1997-2015 University of Cambridge.
|
||||||
<br>
|
<br>
|
||||||
|
|
|
@ -417,6 +417,7 @@ appear.
|
||||||
(*NOTEMPTY_ATSTART) set PCRE2_NOTEMPTY_ATSTART when matching
|
(*NOTEMPTY_ATSTART) set PCRE2_NOTEMPTY_ATSTART when matching
|
||||||
(*NO_AUTO_POSSESS) no auto-possessification (PCRE2_NO_AUTO_POSSESS)
|
(*NO_AUTO_POSSESS) no auto-possessification (PCRE2_NO_AUTO_POSSESS)
|
||||||
(*NO_DOTSTAR_ANCHOR) no .* anchoring (PCRE2_NO_DOTSTAR_ANCHOR)
|
(*NO_DOTSTAR_ANCHOR) no .* anchoring (PCRE2_NO_DOTSTAR_ANCHOR)
|
||||||
|
(*NO_JIT) disable JIT optimization
|
||||||
(*NO_START_OPT) no start-match optimization (PCRE2_NO_START_OPTIMIZE)
|
(*NO_START_OPT) no start-match optimization (PCRE2_NO_START_OPTIMIZE)
|
||||||
(*UTF) set appropriate UTF mode for the library in use
|
(*UTF) set appropriate UTF mode for the library in use
|
||||||
(*UCP) set PCRE2_UCP (use Unicode properties for \d etc)
|
(*UCP) set PCRE2_UCP (use Unicode properties for \d etc)
|
||||||
|
@ -554,7 +555,7 @@ Cambridge, England.
|
||||||
</P>
|
</P>
|
||||||
<br><a name="SEC27" href="#TOC1">REVISION</a><br>
|
<br><a name="SEC27" href="#TOC1">REVISION</a><br>
|
||||||
<P>
|
<P>
|
||||||
Last updated: 02 January 2015
|
Last updated: 26 January 2015
|
||||||
<br>
|
<br>
|
||||||
Copyright © 1997-2015 University of Cambridge.
|
Copyright © 1997-2015 University of Cambridge.
|
||||||
<br>
|
<br>
|
||||||
|
|
|
@ -44,7 +44,7 @@ POSSIBILITY OF SUCH DAMAGE.
|
||||||
#define PCRE2_MAJOR 10
|
#define PCRE2_MAJOR 10
|
||||||
#define PCRE2_MINOR 10
|
#define PCRE2_MINOR 10
|
||||||
#define PCRE2_PRERELEASE -RC1
|
#define PCRE2_PRERELEASE -RC1
|
||||||
#define PCRE2_DATE 2014-01-13
|
#define PCRE2_DATE 2015-02-20
|
||||||
|
|
||||||
/* When an application links to a PCRE DLL in Windows, the symbols that are
|
/* When an application links to a PCRE DLL in Windows, the symbols that are
|
||||||
imported have to be identified as such. When building PCRE2, the appropriate
|
imported have to be identified as such. When building PCRE2, the appropriate
|
||||||
|
@ -198,11 +198,13 @@ greater than zero. */
|
||||||
#define PCRE2_ERROR_UTF32_ERR1 (-27)
|
#define PCRE2_ERROR_UTF32_ERR1 (-27)
|
||||||
#define PCRE2_ERROR_UTF32_ERR2 (-28)
|
#define PCRE2_ERROR_UTF32_ERR2 (-28)
|
||||||
|
|
||||||
/* Error codes for pcre2[_dfa]_match(), substring extraction functions, and
|
/* Error codes for pcre2[_dfa]_match(), substring extraction functions, context
|
||||||
context functions. */
|
functions, and serializing functions. They are in numerical order. Originally
|
||||||
|
they were in alphabetical order too, but now that PCRE2 is released, the
|
||||||
|
numbers must not be changed. */
|
||||||
|
|
||||||
#define PCRE2_ERROR_BADDATA (-29)
|
#define PCRE2_ERROR_BADDATA (-29)
|
||||||
#define PCRE2_ERROR_BADLENGTH (-30)
|
#define PCRE2_ERROR_MIXEDTABLES (-30) /* Name was changed */
|
||||||
#define PCRE2_ERROR_BADMAGIC (-31)
|
#define PCRE2_ERROR_BADMAGIC (-31)
|
||||||
#define PCRE2_ERROR_BADMODE (-32)
|
#define PCRE2_ERROR_BADMODE (-32)
|
||||||
#define PCRE2_ERROR_BADOFFSET (-33)
|
#define PCRE2_ERROR_BADOFFSET (-33)
|
||||||
|
@ -458,13 +460,12 @@ PCRE2_EXP_DECL int pcre2_substring_list_get(pcre2_match_data *, \
|
||||||
/* Functions for serializing / deserializing compiled patterns. */
|
/* Functions for serializing / deserializing compiled patterns. */
|
||||||
|
|
||||||
#define PCRE2_SERIALIZE_FUNCTIONS \
|
#define PCRE2_SERIALIZE_FUNCTIONS \
|
||||||
PCRE2_EXP_DECL int pcre2_serialize_encode(const pcre2_code **, \
|
PCRE2_EXP_DECL int32_t pcre2_serialize_encode(const pcre2_code **, \
|
||||||
PCRE2_SIZE, uint8_t **, PCRE2_SIZE *, \
|
int32_t, uint8_t **, PCRE2_SIZE *, \
|
||||||
pcre2_general_context *); \
|
pcre2_general_context *); \
|
||||||
PCRE2_EXP_DECL int pcre2_serialize_decode(pcre2_code **, PCRE2_SIZE, \
|
PCRE2_EXP_DECL int32_t pcre2_serialize_decode(pcre2_code **, int32_t, \
|
||||||
const uint8_t *, pcre2_general_context *); \
|
const uint8_t *, pcre2_general_context *); \
|
||||||
PCRE2_EXP_DECL int pcre2_serialize_get_number_of_codes(const uint8_t *, \
|
PCRE2_EXP_DECL int32_t pcre2_serialize_get_number_of_codes(const uint8_t *); \
|
||||||
PCRE2_SIZE *); \
|
|
||||||
PCRE2_EXP_DECL void pcre2_serialize_free(uint8_t *);
|
PCRE2_EXP_DECL void pcre2_serialize_free(uint8_t *);
|
||||||
|
|
||||||
|
|
||||||
|
|
Loading…
Reference in New Issue