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

Diff of /code/trunk/ChangeLog

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

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

Legend:
Removed from v.1462  
changed lines
  Added in v.1617

  ViewVC Help
Powered by ViewVC 1.1.5