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

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

  ViewVC Help
Powered by ViewVC 1.1.5