| 8 |
|
|
| 9 |
2. Two minor typos in pcre_internal.h have been fixed. |
2. Two minor typos in pcre_internal.h have been fixed. |
| 10 |
|
|
| 11 |
3. Added #include <string.h> to pcre_scanner_unittest.cc, pcrecpp.cc, and |
3. Added #include <string.h> to pcre_scanner_unittest.cc, pcrecpp.cc, and |
| 12 |
pcrecpp_unittest.cc. They are needed for strcmp(), memset(), and strchr() |
pcrecpp_unittest.cc. They are needed for strcmp(), memset(), and strchr() |
| 13 |
in some environments (e.g. Solaris 10/SPARC using Sun Studio 12U2). |
in some environments (e.g. Solaris 10/SPARC using Sun Studio 12U2). |
| 14 |
|
|
| 15 |
|
4. There were a number of related bugs in the code for matching backrefences |
| 16 |
|
caselessly in UTF-8 mode when codes for the characters concerned were |
| 17 |
|
different numbers of bytes. For example, U+023A and U+2C65 are an upper |
| 18 |
|
and lower case pair, using 2 and 3 bytes, respectively. The main bugs were: |
| 19 |
|
(a) A reference to 3 copies of a 2-byte code matched only 2 of a 3-byte |
| 20 |
|
code. (b) A reference to 2 copies of a 3-byte code would not match 2 of a |
| 21 |
|
2-byte code at the end of the subject (it thought there wasn't enough data |
| 22 |
|
left). |
| 23 |
|
|
| 24 |
|
5. Comprehensive information about what went wrong is now returned by |
| 25 |
|
pcre_exec() and pcre_dfa_exec() when the UTF-8 string check fails, as long |
| 26 |
|
as the output vector has at least 2 elements. The offset of the start of |
| 27 |
|
the failing character and a reason code are placed in the vector. |
| 28 |
|
|
| 29 |
|
6. When the UTF-8 string check fails for pcre_compile(), the offset that is |
| 30 |
|
now returned is for the first byte of the failing character, instead of the |
| 31 |
|
last byte inspected. This is an incompatible change, but I hope it is small |
| 32 |
|
enough not to be a problem. It makes the returned offset consistent with |
| 33 |
|
pcre_exec() and pcre_dfa_exec(). |
| 34 |
|
|
| 35 |
|
7. pcretest now gives a text phrase as well as the error number when |
| 36 |
|
pcre_exec() or pcre_dfa_exec() fails; if the error is a UTF-8 check |
| 37 |
|
failure, the offset and reason code are output. |
| 38 |
|
|
| 39 |
|
8. When \R was used with a maximizing quantifier it failed to skip backwards |
| 40 |
|
over a \r\n pair if the subsequent match failed. Instead, it just skipped |
| 41 |
|
back over a single character (\n). This seems wrong (because it treated the |
| 42 |
|
two characters as a single entity when going forwards), conflicts with the |
| 43 |
|
documentation that \R is equivalent to (?>\r\n|\n|...etc), and makes the |
| 44 |
|
behaviour of \R* different to (\R)*, which also seems wrong. The behaviour |
| 45 |
|
has been changed. |
| 46 |
|
|
| 47 |
|
9. Some internal refactoring has changed the processing so that the handling |
| 48 |
|
of the PCRE_CASELESS and PCRE_MULTILINE options is done entirely at compile |
| 49 |
|
time (the PCRE_DOTALL option was changed this way some time ago: version |
| 50 |
|
7.7 change 16). This has made it possible to abolish the OP_OPT op code, |
| 51 |
|
which was always a bit of a fudge. It also means that there is one less |
| 52 |
|
argument for the match() function, which reduces its stack requirements |
| 53 |
|
slightly. This change also fixes an incompatibility with Perl: the pattern |
| 54 |
|
(?i:([^b]))(?1) should not match "ab", but previously PCRE gave a match. |
| 55 |
|
|
| 56 |
|
10. More internal refactoring has drastically reduced the number of recursive |
| 57 |
|
calls to match() for possessively repeated groups such as (abc)++ when |
| 58 |
|
using pcre_exec(). |
| 59 |
|
|
| 60 |
|
11. While implementing 10, a number of bugs in the handling of groups were |
| 61 |
|
discovered and fixed: |
| 62 |
|
|
| 63 |
|
(?<=(a)+) was not diagnosed as invalid (non-fixed-length lookbehind). |
| 64 |
|
(a|)*(?1) gave a compile-time internal error. |
| 65 |
|
((a|)+)+ did not notice that the outer group could match an empty string. |
| 66 |
|
(^a|^)+ was not marked as anchored. |
| 67 |
|
(.*a|.*)+ was not marked as matching at start or after a newline. |
| 68 |
|
|
| 69 |
|
12. Yet more internal refactoring has removed another argument from the match() |
| 70 |
|
function. Special calls to this function are now indicated by setting a |
| 71 |
|
value in a variable in the "match data" data block. |
| 72 |
|
|
| 73 |
|
13. Be more explicit in pcre_study() instead of relying on "default" for |
| 74 |
|
opcodes that mean there is no starting character; this means that when new |
| 75 |
|
ones are added and accidentally left out of pcre_study(), testing should |
| 76 |
|
pick them up. |
| 77 |
|
|
| 78 |
|
14. The -s option of pcretest has been documented for ages as being an old |
| 79 |
|
synonym of -m (show memory usage). I have changed it to mean "force study |
| 80 |
|
for every regex", that is, assume /S for every regex. This is similar to -i |
| 81 |
|
and -d etc. It's slightly incompatible, but I'm hoping nobody is still |
| 82 |
|
using it. It makes it easier to run collections of tests with and without |
| 83 |
|
study enabled, and thereby test pcre_study() more easily. All the standard |
| 84 |
|
tests are now run with and without -s (but some patterns can be marked as |
| 85 |
|
"never study" - see 20 below). |
| 86 |
|
|
| 87 |
|
15. When (*ACCEPT) was used in a subpattern that was called recursively, the |
| 88 |
|
restoration of the capturing data to the outer values was not happening |
| 89 |
|
correctly. |
| 90 |
|
|
| 91 |
|
16. If a recursively called subpattern ended with (*ACCEPT) and matched an |
| 92 |
|
empty string, and PCRE_NOTEMPTY was set, pcre_exec() thought the whole |
| 93 |
|
pattern had matched an empty string, and so incorrectly returned a no |
| 94 |
|
match. |
| 95 |
|
|
| 96 |
|
17. There was optimizing code for the last branch of non-capturing parentheses, |
| 97 |
|
and also for the obeyed branch of a conditional subexpression, which used |
| 98 |
|
tail recursion to cut down on stack usage. Unfortunately, not that there is |
| 99 |
|
the possibility of (*THEN) occurring in these branches, tail recursion is |
| 100 |
|
no longer possible because the return has to be checked for (*THEN). These |
| 101 |
|
two optimizations have therefore been removed. |
| 102 |
|
|
| 103 |
|
18. If a pattern containing \R was studied, it was assumed that \R always |
| 104 |
|
matched two bytes, thus causing the minimum subject length to be |
| 105 |
|
incorrectly computed because \R can also match just one byte. |
| 106 |
|
|
| 107 |
|
19. If a pattern containing (*ACCEPT) was studied, the minimum subject length |
| 108 |
|
was incorrectly computed. |
| 109 |
|
|
| 110 |
|
20. If /S is present twice on a test pattern in pcretest input, it *disables* |
| 111 |
|
studying, thereby overriding the use of -s on the command line. This is |
| 112 |
|
necessary for one or two tests to keep the output identical in both cases. |
| 113 |
|
|
| 114 |
|
21. When (*ACCEPT) was used in an assertion that matched an empty string and |
| 115 |
|
PCRE_NOTEMPTY was set, PCRE applied the non-empty test to the assertion. |
| 116 |
|
|
| 117 |
|
22. When an atomic group that contained a capturing parenthesis was |
| 118 |
|
successfully matched, but the branch in which it appeared failed, the |
| 119 |
|
capturing was not being forgotten if a higher numbered group was later |
| 120 |
|
captured. For example, /(?>(a))b|(a)c/ when matching "ac" set capturing |
| 121 |
|
group 1 to "a", when in fact it should be unset. This applied to multi- |
| 122 |
|
branched capturing and non-capturing groups, repeated or not, and also to |
| 123 |
|
positive assertions (capturing in negative assertions is not well defined |
| 124 |
|
in PCRE) and also to nested atomic groups. |
| 125 |
|
|
| 126 |
|
23. Add the ++ qualifier feature to pcretest, to show the remainder of the |
| 127 |
|
subject after a captured substring (to make it easier to tell which of a |
| 128 |
|
number of identical substrings has been captured). |
| 129 |
|
|
| 130 |
|
|
| 131 |
Version 8.12 15-Jan-2011 |
Version 8.12 15-Jan-2011 |