summaryrefslogtreecommitdiff
path: root/src/test/test_crypto.c
diff options
context:
space:
mode:
authorNick Mathewson <nickm@torproject.org>2016-09-09 10:08:27 -0400
committerNick Mathewson <nickm@torproject.org>2016-09-09 10:08:27 -0400
commit373bfd963090d412ff0a97cd9804c4e2a507f29e (patch)
tree10d08db3229a77ccdabf36ffb83b86871f54a144 /src/test/test_crypto.c
parent7c521096410b23f234d299e344efe879ceae7643 (diff)
downloadtor-373bfd963090d412ff0a97cd9804c4e2a507f29e.tar.gz
tor-373bfd963090d412ff0a97cd9804c4e2a507f29e.zip
Make a couple more tests run faster.
The point of diminishing returns has been reached.
Diffstat (limited to 'src/test/test_crypto.c')
-rw-r--r--src/test/test_crypto.c4
1 files changed, 2 insertions, 2 deletions
diff --git a/src/test/test_crypto.c b/src/test/test_crypto.c
index 3756fd047b..d83b93be58 100644
--- a/src/test/test_crypto.c
+++ b/src/test/test_crypto.c
@@ -999,11 +999,11 @@ test_crypto_sha3(void *arg)
crypto_digest_free(d1);
/* Attempt to exercise the incremental hashing code by creating a randomized
- * 100 KiB buffer, and hashing rand[1, 5 * Rate] bytes at a time. SHA3-512
+ * 30 KiB buffer, and hashing rand[1, 5 * Rate] bytes at a time. SHA3-512
* is used because it has a lowest rate of the family (the code is common,
* but the slower rate exercises more of it).
*/
- const size_t bufsz = 100 * 1024;
+ const size_t bufsz = 30 * 1024;
size_t j = 0;
large = tor_malloc(bufsz);
crypto_rand(large, bufsz);