diff options
| author | Daniel Stenberg <daniel@haxx.se> | 2019-12-10 14:29:48 +0100 |
|---|---|---|
| committer | Daniel Stenberg <daniel@haxx.se> | 2019-12-11 09:55:15 +0100 |
| commit | 7c1bd035760faa5ad6d81b6280dffbdd7feb6302 (patch) | |
| tree | 27f2ac04d28f4133bb033afb3f206f5ea67573fb /tests/runtests.1 | |
| parent | 1d5c427d7fd6c206de4b010f618659a7a9b38cff (diff) | |
runtests: introduce --shallow to reduce huge torture tests
When set, shallow mode limits runtests -t to make no more than NUM fails
per test case. If more are found, it will randomly discard entries until
the number is right. The random seed can also be set.
This is particularly useful when running MANY tests as then most torture
failures will already fail the same functions over and over and make the
total operation painfully tedious.
Closes #4699
Diffstat (limited to 'tests/runtests.1')
| -rw-r--r-- | tests/runtests.1 | 7 |
1 files changed, 6 insertions, 1 deletions
diff --git a/tests/runtests.1 b/tests/runtests.1 index 18ddce483..bb36a8b44 100644 --- a/tests/runtests.1 +++ b/tests/runtests.1 @@ -5,7 +5,7 @@ .\" * | (__| |_| | _ <| |___ .\" * \___|\___/|_| \_\_____| .\" * -.\" * Copyright (C) 1998 - 2017, Daniel Stenberg, <daniel@haxx.se>, et al. +.\" * Copyright (C) 1998 - 2019, Daniel Stenberg, <daniel@haxx.se>, et al. .\" * .\" * This software is licensed as described in the file COPYING, which .\" * you should have received as part of this distribution. The terms @@ -84,6 +84,11 @@ Display run time statistics. (Requires Perl Time::HiRes module) Display full run time statistics. (Requires Perl Time::HiRes module) .IP "-s" Shorter output. Speaks less than default. +.IP "--shallow=[num](,seed)" +Used together with \fB-t\fP. This limits the number of tests to fail in +torture mode to no more than 'num' per test case. If this reduces the amount, +the given 'seed' will be used to randomly discard entries to fail until the +amount is 'num'. .IP "-t[num]" Selects a \fBtorture\fP test for the given tests. This makes runtests.pl first run the tests once and count the number of memory allocations made. It then |