summaryrefslogtreecommitdiff
path: root/src/regress/lib/libcrypto (follow)
Commit message (Collapse)AuthorAgeFilesLines
...
* Add regress coverage for BN_{add,sub,mul,div,mod}_word().jsing2023-03-112-1/+619
| | | | | | | This also provides some indirect coverage for BN_hex2bn(), BN_bn2hex() and BN_get_word(). Two of these tests are currently failing and will be fixed shortly.
* Mark test table as static const.jsing2023-03-111-2/+2
|
* Use BN_free() instead of BN_clear_free()tb2023-03-081-2/+2
|
* reduce number of tests in bn_rand_interval.tb2023-03-081-2/+2
| | | | | This is only testing basic functionality anyway, so 10000 tests are more than enough.
* bn_isqrt: reduce number of tests to 100.tb2023-03-081-2/+2
| | | | | | The runtime is roughly quadratic in N_TESTS. While it only takes 1-2s on modern machines, this test takes a long time on slow machines. A reduction of runtime by a factor of ~16 is significant.
* Process up to four test vector files concurrently.jsing2023-03-081-4/+30
| | | | | | | | | This avoids having a slow down when processing test vector files that only have a single group. Note that the processing of test vector files is in turn going to be rate limited by the number of concurrent test groups, which means we do not need variable limits for vectors. Reduces a Wycheproof regress run down to ~8 seconds on an Apple M1.
* Run test groups concurrently.jsing2023-03-081-144/+151
| | | | | | | Add a basic test coordinator, that allows for Wycheproof test groups to be run concurrently. This can be further improved (especially for vectors that have limited test groups), however it already reduces the regress duration by about half on an Apple M1.
* zap more audit remnantstb2023-03-081-6/+1
|
* Remove acceptable audit.jsing2023-03-081-94/+1
| | | | | | | This code would need changes to be safe to use concurrently - remove it since it is somewhat incomplete and needs reworking. Requested by tb@
* bio_chain test: fix error messagetb2023-03-041-2/+2
|
* Simplify the ct Makefile slightlytb2023-03-021-7/+3
|
* Clean up the x509 regress make file a littletb2023-03-021-27/+10
|
* Remove a few more unnecessary line continuationstb2023-03-021-4/+4
|
* Nitpick error checks of BN_get_mem_data()tb2023-03-021-15/+27
| | | | | BN_get_mem_data() returns a non-positive long on error, so assigning it to a size_t and displaying that in error messages is incorrect.
* Some more Makefile cosmeticstb2023-03-021-10/+15
| | | | | The verbose evp test actually depends on the evptest binary. Use consistent spacing and indentation.
* The evp_ecx_test no longer needs static linkingtb2023-03-021-3/+1
|
* Hide the hexdumps behind a verbose flags. Should have been part oftb2023-03-021-26/+45
| | | | the previous commit.
* Simplify evp test Makefile.tb2023-03-021-18/+5
| | | | | Make evptest silent by default: these pages of hexdumps are useless noise. Add a verbose target for debugging.
* evp_pkey_check: make this test silent on successtb2023-03-021-18/+13
|
* Remove a few unnecessary line continuationstb2023-03-021-7/+7
|
* Comment out glob for JSON webcrypto tests for nowtb2023-03-011-2/+3
| | | | | Allows test to pass with the old version of the wycheproof-testvectors package.
* Explicitly skip the json_web* tests now.tb2023-02-281-1/+2
|
* Add a few missing NIDs for new Wycheproof tests.tb2023-02-281-1/+12
|
* Skip FRP256v1 curve in ECDH tests. We do not support it.tb2023-02-281-1/+6
|
* Add regress coverage for BN_num_bits_word()tb2023-02-141-1/+25
|
* asn1x509 test: Remove unnecessary line continuationstb2023-02-131-24/+24
|
* Revise for negative zero changes.jsing2023-02-131-2/+2
|
* Add currently failing negative zero check to BN_rshift() regress.jsing2023-02-131-1/+5
|
* Add bn/arch/${MACHINE_CPU} to the include path.jsing2023-01-311-1/+2
| | | | This will be needed once headers pull in bn_arch.h.
* Add more regress tests for BN_usub().jsing2023-01-311-1/+22
| | | | | | This adds more tests for BN_usub(), particularly where b > a, which should be an error condition. One of these currently succeeds and produces incorrect results.
* Use utime in order to make benchmarks less noisy and more consistent.jsing2023-01-291-5/+14
|
* Set BN_FLG_CONSTTIME on benchmark inputs.jsing2023-01-291-1/+4
| | | | | The public APIs still change behaviour based on BN_FLG_CONSTTIME - set it to avoid benchmark noise.
* Add benchmarks for BN_div()jsing2023-01-291-10/+147
|
* Correct setup for BN_mul/BN_sqr benchmarks.jsing2023-01-291-4/+4
| | | | BN_rand() takes a bit length, not the top bit.
* Rename bn_mul.c regress to bn_mul_div.c.jsing2023-01-292-5/+5
|
* Switch regress to using x509_verify.h from libcrypto instead of thetb2023-01-284-8/+12
| | | | one in /usr/include/openssl.
* Provide basic benchmarks for BN_mul() and BN_sqr().jsing2023-01-212-2/+275
|
* Fix previous.jsing2023-01-071-3/+9
|
* Add additional shift benchmarks that are useful on BN_BITS2 == 32 platformsjsing2023-01-051-2/+56
|
* Add explicit LL suffixes to large constants to appease some compilers onmiod2023-01-011-6/+6
| | | | 32-bit systems.
* Add regress coverage for shifts of zero bits.jsing2022-12-231-1/+38
|
* Do similar setup for lshift and rshift benchmarks.jsing2022-12-231-1/+13
| | | | This prevents realloc from unnecessarily impacting the lshift benchmarks.
* Use volatile sig_atomic_t for flag set in signal handlertb2022-12-181-2/+2
|
* Switch to using BN_zero() instead of BN_zero_ex()tb2022-12-171-2/+2
|
* Move benchmark target up a bit and mark it phonytb2022-12-171-4/+5
|
* Zap some whitespacetb2022-12-171-2/+2
|
* Provide regress coverage for BN shift functions.jsing2022-12-172-1/+543
| | | | | | Provide regress coverage for BN_lshift1(), BN_rshift1(), BN_lshift() and BN_rshift(), along with basic benchmarking functionality (run via 'make benchmark').
* bio chain test: compress some error printingtb2022-12-101-5/+4
|
* bio chain test: deduplicate chain walking codetb2022-12-101-52/+40
|
* bio chain test: handle walking of empty chainstb2022-12-101-27/+15
| | | | | | Rework the loops walking the chains to be correct for empty chains as well. This simplifies the checking at the cost of slightly more initialization and will allow further refactoring in a subsequent check.