/[pcre]/code/trunk/ChangeLog
ViewVC logotype

Diff of /code/trunk/ChangeLog

Parent Directory Parent Directory | Revision Log Revision Log | View Patch Patch

revision 1414 by zherczeg, Sun Dec 22 16:27:35 2013 UTC revision 1642 by ph10, Tue Mar 1 12:48:35 2016 UTC
# Line 1  Line 1 
1  ChangeLog for PCRE  ChangeLog for PCRE
2  ------------------  ------------------
3    
4  Version 8.35-RC1 xx-xxxx-201x  Note that the PCRE 8.xx series (PCRE1) is now in a bugfix-only state. All
5    development is happening in the PCRE2 10.xx series.
6    
7    Version 8.39 xx-xxxxxx-201x
8    ---------------------------
9    
10    1.  If PCRE_AUTO_CALLOUT was set on a pattern that had a (?# comment between
11        an item and its qualifier (for example, A(?#comment)?B) pcre_compile()
12        misbehaved. This bug was found by the LLVM fuzzer.
13    
14    2.  Similar to the above, if an isolated \E was present between an item and its
15        qualifier when PCRE_AUTO_CALLOUT was set, pcre_compile() misbehaved. This
16        bug was found by the LLVM fuzzer.
17    
18    3.  Further to 8.38/46, negated classes such as [^[:^ascii:]\d] were also not
19        working correctly in UCP mode.
20    
21    4.  The POSIX wrapper function regexec() crashed if the option REG_STARTEND
22        was set when the pmatch argument was NULL. It now returns REG_INVARG.
23    
24    5.  Allow for up to 32-bit numbers in the ordin() function in pcregrep.
25    
26    6.  An empty \Q\E sequence between an item and its qualifier caused
27        pcre_compile() to misbehave when auto callouts were enabled. This bug was
28        found by the LLVM fuzzer.
29    
30    7.  If a pattern that was compiled with PCRE_EXTENDED started with white
31        space or a #-type comment that was followed by (?-x), which turns off
32        PCRE_EXTENDED, and there was no subsequent (?x) to turn it on again,
33        pcre_compile() assumed that (?-x) applied to the whole pattern and
34        consequently mis-compiled it. This bug was found by the LLVM fuzzer.
35    
36    8.  An call of pcre_copy_named_substring() for a named substring whose number
37        was greater than the space in the ovector could cause a crash.
38    
39    9.  Yet another buffer overflow bug involved duplicate named groups with a
40        group that reset capture numbers (compare 8.38/7 below). Once again, I have
41        just allowed for more memory, even if not needed. (A proper fix is
42        implemented in PCRE2, but it involves a lot of refactoring.)
43    
44    10. pcre_get_substring_list() crashed if the use of \K in a match caused the
45        start of the match to be earlier than the end.
46    
47    11. Migrating appropriate PCRE2 JIT improvements to PCRE.
48    
49    12. A pattern such as /(?<=((?C)0))/, which has a callout inside a lookbehind
50        assertion, caused pcretest to generate incorrect output, and also to read
51        uninitialized memory (detected by ASAN or valgrind).
52    
53    13. A pattern that included (*ACCEPT) in the middle of a sufficiently deeply
54        nested set of parentheses of sufficient size caused an overflow of the
55        compiling workspace (which was diagnosed, but of course is not desirable).
56    
57    14. And yet another buffer overflow bug involving duplicate named groups, this
58        time nested, with a nested back reference. Yet again, I have just allowed
59        for more memory, because anything more needs all the refactoring that has
60        been done for PCRE2. An example pattern that provoked this bug is:
61        /((?J)(?'R'(?'R'(?'R'(?'R'(?'R'(?|(\k'R'))))))))/ and the bug was
62        registered as CVE-2016-1283.
63    
64    15. pcretest went into a loop if global matching was requested with an ovector
65        size less than 2. It now gives an error message. This bug was found by
66        afl-fuzz.
67    
68    16. An invalid pattern fragment such as (?(?C)0 was not diagnosing an error
69        ("assertion expected") when (?(?C) was not followed by an opening
70        parenthesis.
71    
72    17. Fixed typo ("&&" for "&") in pcre_study(). Fortunately, this could not
73        actually affect anything, by sheer luck.
74    
75    18. Applied Chris Wilson's patch (Bugzilla #1681) to CMakeLists.txt for MSVC
76        static compilation.
77    
78    19. Modified the RunTest script to incorporate a valgrind suppressions file so
79        that certain errors, provoked by the SSE2 instruction set when JIT is used,
80        are ignored.
81    
82    
83    Version 8.38 23-November-2015
84  -----------------------------  -----------------------------
85    
86    1.  If a group that contained a recursive back reference also contained a
87        forward reference subroutine call followed by a non-forward-reference
88        subroutine call, for example /.((?2)(?R)\1)()/, pcre_compile() failed to
89        compile correct code, leading to undefined behaviour or an internally
90        detected error. This bug was discovered by the LLVM fuzzer.
91    
92    2.  Quantification of certain items (e.g. atomic back references) could cause
93        incorrect code to be compiled when recursive forward references were
94        involved. For example, in this pattern: /(?1)()((((((\1++))\x85)+)|))/.
95        This bug was discovered by the LLVM fuzzer.
96    
97    3.  A repeated conditional group whose condition was a reference by name caused
98        a buffer overflow if there was more than one group with the given name.
99        This bug was discovered by the LLVM fuzzer.
100    
101    4.  A recursive back reference by name within a group that had the same name as
102        another group caused a buffer overflow. For example:
103        /(?J)(?'d'(?'d'\g{d}))/. This bug was discovered by the LLVM fuzzer.
104    
105    5.  A forward reference by name to a group whose number is the same as the
106        current group, for example in this pattern: /(?|(\k'Pm')|(?'Pm'))/, caused
107        a buffer overflow at compile time. This bug was discovered by the LLVM
108        fuzzer.
109    
110    6.  A lookbehind assertion within a set of mutually recursive subpatterns could
111        provoke a buffer overflow. This bug was discovered by the LLVM fuzzer.
112    
113    7.  Another buffer overflow bug involved duplicate named groups with a
114        reference between their definition, with a group that reset capture
115        numbers, for example: /(?J:(?|(?'R')(\k'R')|((?'R'))))/. This has been
116        fixed by always allowing for more memory, even if not needed. (A proper fix
117        is implemented in PCRE2, but it involves more refactoring.)
118    
119    8.  There was no check for integer overflow in subroutine calls such as (?123).
120    
121    9.  The table entry for \l in EBCDIC environments was incorrect, leading to its
122        being treated as a literal 'l' instead of causing an error.
123    
124    10. There was a buffer overflow if pcre_exec() was called with an ovector of
125        size 1. This bug was found by american fuzzy lop.
126    
127    11. If a non-capturing group containing a conditional group that could match
128        an empty string was repeated, it was not identified as matching an empty
129        string itself. For example: /^(?:(?(1)x|)+)+$()/.
130    
131    12. In an EBCDIC environment, pcretest was mishandling the escape sequences
132        \a and \e in test subject lines.
133    
134    13. In an EBCDIC environment, \a in a pattern was converted to the ASCII
135        instead of the EBCDIC value.
136    
137    14. The handling of \c in an EBCDIC environment has been revised so that it is
138        now compatible with the specification in Perl's perlebcdic page.
139    
140    15. The EBCDIC character 0x41 is a non-breaking space, equivalent to 0xa0 in
141        ASCII/Unicode. This has now been added to the list of characters that are
142        recognized as white space in EBCDIC.
143    
144    16. When PCRE was compiled without UCP support, the use of \p and \P gave an
145        error (correctly) when used outside a class, but did not give an error
146        within a class.
147    
148    17. \h within a class was incorrectly compiled in EBCDIC environments.
149    
150    18. A pattern with an unmatched closing parenthesis that contained a backward
151        assertion which itself contained a forward reference caused buffer
152        overflow. And example pattern is: /(?=di(?<=(?1))|(?=(.))))/.
153    
154    19. JIT should return with error when the compiled pattern requires more stack
155        space than the maximum.
156    
157    20. A possessively repeated conditional group that could match an empty string,
158        for example, /(?(R))*+/, was incorrectly compiled.
159    
160    21. Fix infinite recursion in the JIT compiler when certain patterns such as
161        /(?:|a|){100}x/ are analysed.
162    
163    22. Some patterns with character classes involving [: and \\ were incorrectly
164        compiled and could cause reading from uninitialized memory or an incorrect
165        error diagnosis.
166    
167    23. Pathological patterns containing many nested occurrences of [: caused
168        pcre_compile() to run for a very long time.
169    
170    24. A conditional group with only one branch has an implicit empty alternative
171        branch and must therefore be treated as potentially matching an empty
172        string.
173    
174    25. If (?R was followed by - or + incorrect behaviour happened instead of a
175        diagnostic.
176    
177    26. Arrange to give up on finding the minimum matching length for overly
178        complex patterns.
179    
180    27. Similar to (4) above: in a pattern with duplicated named groups and an
181        occurrence of (?| it is possible for an apparently non-recursive back
182        reference to become recursive if a later named group with the relevant
183        number is encountered. This could lead to a buffer overflow. Wen Guanxing
184        from Venustech ADLAB discovered this bug.
185    
186    28. If pcregrep was given the -q option with -c or -l, or when handling a
187        binary file, it incorrectly wrote output to stdout.
188    
189    29. The JIT compiler did not restore the control verb head in case of *THEN
190        control verbs. This issue was found by Karl Skomski with a custom LLVM
191        fuzzer.
192    
193    30. Error messages for syntax errors following \g and \k were giving inaccurate
194        offsets in the pattern.
195    
196    31. Added a check for integer overflow in conditions (?(<digits>) and
197        (?(R<digits>). This omission was discovered by Karl Skomski with the LLVM
198        fuzzer.
199    
200    32. Handling recursive references such as (?2) when the reference is to a group
201        later in the pattern uses code that is very hacked about and error-prone.
202        It has been re-written for PCRE2. Here in PCRE1, a check has been added to
203        give an internal error if it is obvious that compiling has gone wrong.
204    
205    33. The JIT compiler should not check repeats after a {0,1} repeat byte code.
206        This issue was found by Karl Skomski with a custom LLVM fuzzer.
207    
208    34. The JIT compiler should restore the control chain for empty possessive
209        repeats. This issue was found by Karl Skomski with a custom LLVM fuzzer.
210    
211    35. Match limit check added to JIT recursion. This issue was found by Karl
212        Skomski with a custom LLVM fuzzer.
213    
214    36. Yet another case similar to 27 above has been circumvented by an
215        unconditional allocation of extra memory. This issue is fixed "properly" in
216        PCRE2 by refactoring the way references are handled. Wen Guanxing
217        from Venustech ADLAB discovered this bug.
218    
219    37. Fix two assertion fails in JIT. These issues were found by Karl Skomski
220        with a custom LLVM fuzzer.
221    
222    38. Fixed a corner case of range optimization in JIT.
223    
224    39. An incorrect error "overran compiling workspace" was given if there were
225        exactly enough group forward references such that the last one extended
226        into the workspace safety margin. The next one would have expanded the
227        workspace. The test for overflow was not including the safety margin.
228    
229    40. A match limit issue is fixed in JIT which was found by Karl Skomski
230        with a custom LLVM fuzzer.
231    
232    41. Remove the use of /dev/null in testdata/testinput2, because it doesn't
233        work under Windows. (Why has it taken so long for anyone to notice?)
234    
235    42. In a character class such as [\W\p{Any}] where both a negative-type escape
236        ("not a word character") and a property escape were present, the property
237        escape was being ignored.
238    
239    43. Fix crash caused by very long (*MARK) or (*THEN) names.
240    
241    44. A sequence such as [[:punct:]b] that is, a POSIX character class followed
242        by a single ASCII character in a class item, was incorrectly compiled in
243        UCP mode. The POSIX class got lost, but only if the single character
244        followed it.
245    
246    45. [:punct:] in UCP mode was matching some characters in the range 128-255
247        that should not have been matched.
248    
249    46. If [:^ascii:] or [:^xdigit:] or [:^cntrl:] are present in a non-negated
250        class, all characters with code points greater than 255 are in the class.
251        When a Unicode property was also in the class (if PCRE_UCP is set, escapes
252        such as \w are turned into Unicode properties), wide characters were not
253        correctly handled, and could fail to match.
254    
255    
256    Version 8.37 28-April-2015
257    --------------------------
258    
259    1.  When an (*ACCEPT) is triggered inside capturing parentheses, it arranges
260        for those parentheses to be closed with whatever has been captured so far.
261        However, it was failing to mark any other groups between the hightest
262        capture so far and the currrent group as "unset". Thus, the ovector for
263        those groups contained whatever was previously there. An example is the
264        pattern /(x)|((*ACCEPT))/ when matched against "abcd".
265    
266    2.  If an assertion condition was quantified with a minimum of zero (an odd
267        thing to do, but it happened), SIGSEGV or other misbehaviour could occur.
268    
269    3.  If a pattern in pcretest input had the P (POSIX) modifier followed by an
270        unrecognized modifier, a crash could occur.
271    
272    4.  An attempt to do global matching in pcretest with a zero-length ovector
273        caused a crash.
274    
275    5.  Fixed a memory leak during matching that could occur for a subpattern
276        subroutine call (recursive or otherwise) if the number of captured groups
277        that had to be saved was greater than ten.
278    
279    6.  Catch a bad opcode during auto-possessification after compiling a bad UTF
280        string with NO_UTF_CHECK. This is a tidyup, not a bug fix, as passing bad
281        UTF with NO_UTF_CHECK is documented as having an undefined outcome.
282    
283    7.  A UTF pattern containing a "not" match of a non-ASCII character and a
284        subroutine reference could loop at compile time. Example: /[^\xff]((?1))/.
285    
286    8. When a pattern is compiled, it remembers the highest back reference so that
287       when matching, if the ovector is too small, extra memory can be obtained to
288       use instead. A conditional subpattern whose condition is a check on a
289       capture having happened, such as, for example in the pattern
290       /^(?:(a)|b)(?(1)A|B)/, is another kind of back reference, but it was not
291       setting the highest backreference number. This mattered only if pcre_exec()
292       was called with an ovector that was too small to hold the capture, and there
293       was no other kind of back reference (a situation which is probably quite
294       rare). The effect of the bug was that the condition was always treated as
295       FALSE when the capture could not be consulted, leading to a incorrect
296       behaviour by pcre_exec(). This bug has been fixed.
297    
298    9. A reference to a duplicated named group (either a back reference or a test
299       for being set in a conditional) that occurred in a part of the pattern where
300       PCRE_DUPNAMES was not set caused the amount of memory needed for the pattern
301       to be incorrectly calculated, leading to overwriting.
302    
303    10. A mutually recursive set of back references such as (\2)(\1) caused a
304        segfault at study time (while trying to find the minimum matching length).
305        The infinite loop is now broken (with the minimum length unset, that is,
306        zero).
307    
308    11. If an assertion that was used as a condition was quantified with a minimum
309        of zero, matching went wrong. In particular, if the whole group had
310        unlimited repetition and could match an empty string, a segfault was
311        likely. The pattern (?(?=0)?)+ is an example that caused this. Perl allows
312        assertions to be quantified, but not if they are being used as conditions,
313        so the above pattern is faulted by Perl. PCRE has now been changed so that
314        it also rejects such patterns.
315    
316    12. A possessive capturing group such as (a)*+ with a minimum repeat of zero
317        failed to allow the zero-repeat case if pcre2_exec() was called with an
318        ovector too small to capture the group.
319    
320    13. Fixed two bugs in pcretest that were discovered by fuzzing and reported by
321        Red Hat Product Security:
322    
323        (a) A crash if /K and /F were both set with the option to save the compiled
324        pattern.
325    
326        (b) Another crash if the option to print captured substrings in a callout
327        was combined with setting a null ovector, for example \O\C+ as a subject
328        string.
329    
330    14. A pattern such as "((?2){0,1999}())?", which has a group containing a
331        forward reference repeated a large (but limited) number of times within a
332        repeated outer group that has a zero minimum quantifier, caused incorrect
333        code to be compiled, leading to the error "internal error:
334        previously-checked referenced subpattern not found" when an incorrect
335        memory address was read. This bug was reported as "heap overflow",
336        discovered by Kai Lu of Fortinet's FortiGuard Labs and given the CVE number
337        CVE-2015-2325.
338    
339    23. A pattern such as "((?+1)(\1))/" containing a forward reference subroutine
340        call within a group that also contained a recursive back reference caused
341        incorrect code to be compiled. This bug was reported as "heap overflow",
342        discovered by Kai Lu of Fortinet's FortiGuard Labs, and given the CVE
343        number CVE-2015-2326.
344    
345    24. Computing the size of the JIT read-only data in advance has been a source
346        of various issues, and new ones are still appear unfortunately. To fix
347        existing and future issues, size computation is eliminated from the code,
348        and replaced by on-demand memory allocation.
349    
350    25. A pattern such as /(?i)[A-`]/, where characters in the other case are
351        adjacent to the end of the range, and the range contained characters with
352        more than one other case, caused incorrect behaviour when compiled in UTF
353        mode. In that example, the range a-j was left out of the class.
354    
355    26. Fix JIT compilation of conditional blocks, which assertion
356        is converted to (*FAIL). E.g: /(?(?!))/.
357    
358    27. The pattern /(?(?!)^)/ caused references to random memory. This bug was
359        discovered by the LLVM fuzzer.
360    
361    28. The assertion (?!) is optimized to (*FAIL). This was not handled correctly
362        when this assertion was used as a condition, for example (?(?!)a|b). In
363        pcre2_match() it worked by luck; in pcre2_dfa_match() it gave an incorrect
364        error about an unsupported item.
365    
366    29. For some types of pattern, for example /Z*(|d*){216}/, the auto-
367        possessification code could take exponential time to complete. A recursion
368        depth limit of 1000 has been imposed to limit the resources used by this
369        optimization.
370    
371    30. A pattern such as /(*UTF)[\S\V\H]/, which contains a negated special class
372        such as \S in non-UCP mode, explicit wide characters (> 255) can be ignored
373        because \S ensures they are all in the class. The code for doing this was
374        interacting badly with the code for computing the amount of space needed to
375        compile the pattern, leading to a buffer overflow. This bug was discovered
376        by the LLVM fuzzer.
377    
378    31. A pattern such as /((?2)+)((?1))/ which has mutual recursion nested inside
379        other kinds of group caused stack overflow at compile time. This bug was
380        discovered by the LLVM fuzzer.
381    
382    32. A pattern such as /(?1)(?#?'){8}(a)/ which had a parenthesized comment
383        between a subroutine call and its quantifier was incorrectly compiled,
384        leading to buffer overflow or other errors. This bug was discovered by the
385        LLVM fuzzer.
386    
387    33. The illegal pattern /(?(?<E>.*!.*)?)/ was not being diagnosed as missing an
388        assertion after (?(. The code was failing to check the character after
389        (?(?< for the ! or = that would indicate a lookbehind assertion. This bug
390        was discovered by the LLVM fuzzer.
391    
392    34. A pattern such as /X((?2)()*+){2}+/ which has a possessive quantifier with
393        a fixed maximum following a group that contains a subroutine reference was
394        incorrectly compiled and could trigger buffer overflow. This bug was
395        discovered by the LLVM fuzzer.
396    
397    35. A mutual recursion within a lookbehind assertion such as (?<=((?2))((?1)))
398        caused a stack overflow instead of the diagnosis of a non-fixed length
399        lookbehind assertion. This bug was discovered by the LLVM fuzzer.
400    
401    36. The use of \K in a positive lookbehind assertion in a non-anchored pattern
402        (e.g. /(?<=\Ka)/) could make pcregrep loop.
403    
404    37. There was a similar problem to 36 in pcretest for global matches.
405    
406    38. If a greedy quantified \X was preceded by \C in UTF mode (e.g. \C\X*),
407        and a subsequent item in the pattern caused a non-match, backtracking over
408        the repeated \X did not stop, but carried on past the start of the subject,
409        causing reference to random memory and/or a segfault. There were also some
410        other cases where backtracking after \C could crash. This set of bugs was
411        discovered by the LLVM fuzzer.
412    
413    39. The function for finding the minimum length of a matching string could take
414        a very long time if mutual recursion was present many times in a pattern,
415        for example, /((?2){73}(?2))((?1))/. A better mutual recursion detection
416        method has been implemented. This infelicity was discovered by the LLVM
417        fuzzer.
418    
419    40. Static linking against the PCRE library using the pkg-config module was
420        failing on missing pthread symbols.
421    
422    
423    Version 8.36 26-September-2014
424    ------------------------------
425    
426    1.  Got rid of some compiler warnings in the C++ modules that were shown up by
427        -Wmissing-field-initializers and -Wunused-parameter.
428    
429    2.  The tests for quantifiers being too big (greater than 65535) were being
430        applied after reading the number, and stupidly assuming that integer
431        overflow would give a negative number. The tests are now applied as the
432        numbers are read.
433    
434    3.  Tidy code in pcre_exec.c where two branches that used to be different are
435        now the same.
436    
437    4.  The JIT compiler did not generate match limit checks for certain
438        bracketed expressions with quantifiers. This may lead to exponential
439        backtracking, instead of returning with PCRE_ERROR_MATCHLIMIT. This
440        issue should be resolved now.
441    
442    5.  Fixed an issue, which occures when nested alternatives are optimized
443        with table jumps.
444    
445    6.  Inserted two casts and changed some ints to size_t in the light of some
446        reported 64-bit compiler warnings (Bugzilla 1477).
447    
448    7.  Fixed a bug concerned with zero-minimum possessive groups that could match
449        an empty string, which sometimes were behaving incorrectly in the
450        interpreter (though correctly in the JIT matcher). This pcretest input is
451        an example:
452    
453          '\A(?:[^"]++|"(?:[^"]*+|"")*+")++'
454          NON QUOTED "QUOT""ED" AFTER "NOT MATCHED
455    
456        the interpreter was reporting a match of 'NON QUOTED ' only, whereas the
457        JIT matcher and Perl both matched 'NON QUOTED "QUOT""ED" AFTER '. The test
458        for an empty string was breaking the inner loop and carrying on at a lower
459        level, when possessive repeated groups should always return to a higher
460        level as they have no backtrack points in them. The empty string test now
461        occurs at the outer level.
462    
463    8.  Fixed a bug that was incorrectly auto-possessifying \w+ in the pattern
464        ^\w+(?>\s*)(?<=\w) which caused it not to match "test test".
465    
466    9.  Give a compile-time error for \o{} (as Perl does) and for \x{} (which Perl
467        doesn't).
468    
469    10. Change 8.34/15 introduced a bug that caused the amount of memory needed
470        to hold a pattern to be incorrectly computed (too small) when there were
471        named back references to duplicated names. This could cause "internal
472        error: code overflow" or "double free or corruption" or other memory
473        handling errors.
474    
475    11. When named subpatterns had the same prefixes, back references could be
476        confused. For example, in this pattern:
477    
478          /(?P<Name>a)?(?P<Name2>b)?(?(<Name>)c|d)*l/
479    
480        the reference to 'Name' was incorrectly treated as a reference to a
481        duplicate name.
482    
483    12. A pattern such as /^s?c/mi8 where the optional character has more than
484        one "other case" was incorrectly compiled such that it would only try to
485        match starting at "c".
486    
487    13. When a pattern starting with \s was studied, VT was not included in the
488        list of possible starting characters; this should have been part of the
489        8.34/18 patch.
490    
491    14. If a character class started [\Qx]... where x is any character, the class
492        was incorrectly terminated at the ].
493    
494    15. If a pattern that started with a caseless match for a character with more
495        than one "other case" was studied, PCRE did not set up the starting code
496        unit bit map for the list of possible characters. Now it does. This is an
497        optimization improvement, not a bug fix.
498    
499    16. The Unicode data tables have been updated to Unicode 7.0.0.
500    
501    17. Fixed a number of memory leaks in pcregrep.
502    
503    18. Avoid a compiler warning (from some compilers) for a function call with
504        a cast that removes "const" from an lvalue by using an intermediate
505        variable (to which the compiler does not object).
506    
507    19. Incorrect code was compiled if a group that contained an internal recursive
508        back reference was optional (had quantifier with a minimum of zero). This
509        example compiled incorrect code: /(((a\2)|(a*)\g<-1>))*/ and other examples
510        caused segmentation faults because of stack overflows at compile time.
511    
512    20. A pattern such as /((?(R)a|(?1)))+/, which contains a recursion within a
513        group that is quantified with an indefinite repeat, caused a compile-time
514        loop which used up all the system stack and provoked a segmentation fault.
515        This was not the same bug as 19 above.
516    
517    21. Add PCRECPP_EXP_DECL declaration to operator<< in pcre_stringpiece.h.
518        Patch by Mike Frysinger.
519    
520    
521    Version 8.35 04-April-2014
522    --------------------------
523    
524  1.  A new flag is set, when property checks are present in an XCLASS.  1.  A new flag is set, when property checks are present in an XCLASS.
525      When this flag is not set, PCRE can perform certain optimizations      When this flag is not set, PCRE can perform certain optimizations
526      such as studying these XCLASS-es.      such as studying these XCLASS-es.
527    
528    2.  The auto-possessification of character sets were improved: a normal
529        and an extended character set can be compared now. Furthermore
530        the JIT compiler optimizes more character set checks.
531    
532    3.  Got rid of some compiler warnings for potentially uninitialized variables
533        that show up only when compiled with -O2.
534    
535    4.  A pattern such as (?=ab\K) that uses \K in an assertion can set the start
536        of a match later then the end of the match. The pcretest program was not
537        handling the case sensibly - it was outputting from the start to the next
538        binary zero. It now reports this situation in a message, and outputs the
539        text from the end to the start.
540    
541    5.  Fast forward search is improved in JIT. Instead of the first three
542        characters, any three characters with fixed position can be searched.
543        Search order: first, last, middle.
544    
545    6.  Improve character range checks in JIT. Characters are read by an inprecise
546        function now, which returns with an unknown value if the character code is
547        above a certain threshold (e.g: 256). The only limitation is that the value
548        must be bigger than the threshold as well. This function is useful when
549        the characters above the threshold are handled in the same way.
550    
551    7.  The macros whose names start with RAWUCHAR are placeholders for a future
552        mode in which only the bottom 21 bits of 32-bit data items are used. To
553        make this more memorable for those maintaining the code, the names have
554        been changed to start with UCHAR21, and an extensive comment has been added
555        to their definition.
556    
557    8.  Add missing (new) files sljitNativeTILEGX.c and sljitNativeTILEGX-encoder.c
558        to the export list in Makefile.am (they were accidentally omitted from the
559        8.34 tarball).
560    
561    9.  The informational output from pcretest used the phrase "starting byte set"
562        which is inappropriate for the 16-bit and 32-bit libraries. As the output
563        for "first char" and "need char" really means "non-UTF-char", I've changed
564        "byte" to "char", and slightly reworded the output. The documentation about
565        these values has also been (I hope) clarified.
566    
567    10. Another JIT related optimization: use table jumps for selecting the correct
568        backtracking path, when more than four alternatives are present inside a
569        bracket.
570    
571    11. Empty match is not possible, when the minimum length is greater than zero,
572        and there is no \K in the pattern. JIT should avoid empty match checks in
573        such cases.
574    
575    12. In a caseless character class with UCP support, when a character with more
576        than one alternative case was not the first character of a range, not all
577        the alternative cases were added to the class. For example, s and \x{17f}
578        are both alternative cases for S: the class [RST] was handled correctly,
579        but [R-T] was not.
580    
581    13. The configure.ac file always checked for pthread support when JIT was
582        enabled. This is not used in Windows, so I have put this test inside a
583        check for the presence of windows.h (which was already tested for).
584    
585    14. Improve pattern prefix search by a simplified Boyer-Moore algorithm in JIT.
586        The algorithm provides a way to skip certain starting offsets, and usually
587        faster than linear prefix searches.
588    
589    15. Change 13 for 8.20 updated RunTest to check for the 'fr' locale as well
590        as for 'fr_FR' and 'french'. For some reason, however, it then used the
591        Windows-specific input and output files, which have 'french' screwed in.
592        So this could never have worked. One of the problems with locales is that
593        they aren't always the same. I have now updated RunTest so that it checks
594        the output of the locale test (test 3) against three different output
595        files, and it allows the test to pass if any one of them matches. With luck
596        this should make the test pass on some versions of Solaris where it was
597        failing. Because of the uncertainty, the script did not used to stop if
598        test 3 failed; it now does. If further versions of a French locale ever
599        come to light, they can now easily be added.
600    
601    16. If --with-pcregrep-bufsize was given a non-integer value such as "50K",
602        there was a message during ./configure, but it did not stop. This now
603        provokes an error. The invalid example in README has been corrected.
604        If a value less than the minimum is given, the minimum value has always
605        been used, but now a warning is given.
606    
607    17. If --enable-bsr-anycrlf was set, the special 16/32-bit test failed. This
608        was a bug in the test system, which is now fixed. Also, the list of various
609        configurations that are tested for each release did not have one with both
610        16/32 bits and --enable-bar-anycrlf. It now does.
611    
612    18. pcretest was missing "-C bsr" for displaying the \R default setting.
613    
614    19. Little endian PowerPC systems are supported now by the JIT compiler.
615    
616    20. The fast forward newline mechanism could enter to an infinite loop on
617        certain invalid UTF-8 input. Although we don't support these cases
618        this issue can be fixed by a performance optimization.
619    
620    21. Change 33 of 8.34 is not sufficient to ensure stack safety because it does
621        not take account if existing stack usage. There is now a new global
622        variable called pcre_stack_guard that can be set to point to an external
623        function to check stack availability. It is called at the start of
624        processing every parenthesized group.
625    
626    22. A typo in the code meant that in ungreedy mode the max/min qualifier
627        behaved like a min-possessive qualifier, and, for example, /a{1,3}b/U did
628        not match "ab".
629    
630    23. When UTF was disabled, the JIT program reported some incorrect compile
631        errors. These messages are silenced now.
632    
633    24. Experimental support for ARM-64 and MIPS-64 has been added to the JIT
634        compiler.
635    
636    25. Change all the temporary files used in RunGrepTest to be different to those
637        used by RunTest so that the tests can be run simultaneously, for example by
638        "make -j check".
639    
640    
641  Version 8.34 15-December-2013  Version 8.34 15-December-2013
642  -----------------------------  -----------------------------

Legend:
Removed from v.1414  
changed lines
  Added in v.1642

  ViewVC Help
Powered by ViewVC 1.1.5