| Commit message (Collapse) | Author | Age | Files | Lines | |
|---|---|---|---|---|---|
| * | Don't fall back to heapsort() if we would otherwise switch to | millert | 2017-05-30 | 1 | -7/+7 |
| | | | | | insertion sort (when the number of elements is < 7). | ||||
| * | Randomize link-order of libcrypto as we do with libc. This library | deraadt | 2017-05-29 | 1 | -1/+2 |
| | | | | | | | | | | | | | | | has many small functions without significant local storage, therefore less tail protection from -fstack-protector-strong to prevent their use as ROP gadgets. It is used in security contexts. Also many functions dribble pointers onto the stack, allowing discovery of gadgets via the fixed relative addresses, so let's randomly bias those. ok tedu jsing The rc script will soon need a strategy for skipping this step on machines with poor IO performance. Or maybe do it less often? However, I don't see many more libraries we'll do this with, these are the two most important ones. | ||||
| * | Also test arrays of double and long long. | millert | 2017-05-27 | 1 | -142/+421 |
| | | |||||
| * | Synchronise chacha test cases with the referenced draft - this adds a | jsing | 2017-05-26 | 1 | -23/+23 |
| | | | | | | | | | missing test case, reassigns two of the labels and removes a test case that was from an earlier draft. Inconsistency noted by Steven Roberts <fenderq at gmail dot com>, some time ago... | ||||
| * | Avoid a potential NULL pointer dereference in d2i_ECPrivateKey(). | jsing | 2017-05-26 | 1 | -1/+7 |
| | | | | | | | Reported by Robert Swiecki, who found the issue using honggfuzz. ok bcook@ | ||||
| * | Fix gcc warnings triggered by WARNINGS=yes. | bluhm | 2017-05-26 | 1 | -9/+9 |
| | | | | | OK florian@ | ||||
| * | Add definitions for three OIDs used in EV certificates. | jsing | 2017-05-25 | 2 | -0/+9 |
| | | | | | From Kyle J. McKay <mackyle at gmail dot com> | ||||
| * | Support swapping 32-bit aligned elements on 64-bit platforms. | millert | 2017-05-24 | 1 | -22/+63 |
| | | | | | | Previously they would be swapped a byte at a time when sizeof(int) != sizeof(long). Idea from FreeBSD. | ||||
| * | Add timing and test name options. | millert | 2017-05-22 | 1 | -12/+83 |
| | | |||||
| * | Instead of embedding pre-generated tables from McIlroy's "A Killer | millert | 2017-05-22 | 3 | -1538/+315 |
| | | | | | | Adversary for Quicksort", just include the code to generate them. Also allow the number of elements to be specified on the command line. | ||||
| * | correct a return value test | jsg | 2017-05-21 | 1 | -1/+1 |
| | | | | | ok millert@ | ||||
| * | Document that qsort falls back to heapsort() if the recursion depth | millert | 2017-05-20 | 1 | -3/+13 |
| | | | | | exceeds 2 lg N and add a reference to the introsort paper. | ||||
| * | Use David Musser's introsort algorithm to fall back to heapsort(3) | millert | 2017-05-20 | 2 | -14/+45 |
| | | | | | | | when the recursion depth reaches 2*lg(n + 1). This avoids quicksort's quadratic behavior for pathological input without appreciably changing the average run time. | ||||
| * | Add input targeted at the Bentley and McIrlroy quicksort generated | millert | 2017-05-19 | 1 | -6/+1389 |
| | | | | | | by McIlroy's "A Killer Adversary for Quicksort". This results in quadratic behavior and the test aborts before completion. | ||||
| * | use mergesort instead of heapsort when comparing results | millert | 2017-05-18 | 1 | -9/+17 |
| | | |||||
| * | Avoid running the "killer" tests multiple times with the same | millert | 2017-05-17 | 1 | -10/+19 |
| | | | | | parameters. | ||||
| * | Add "median of three" killer, as seen in "Introspective Sorting and | millert | 2017-05-17 | 1 | -18/+44 |
| | | | | | Selection Algorithms" by David R Musser. | ||||
| * | Approximate nlgn instead of using libm. The same approximation may | millert | 2017-05-17 | 2 | -10/+8 |
| | | | | | be used in qsort.c in a later commit. | ||||
| * | Add "killer" input from "algorithmic complexity attacks and libc | millert | 2017-05-17 | 1 | -0/+12 |
| | | | | | | | | qsort()". This causes quadratic behavior with the 4.4BSD qsort's "switch to insertion sort" optimization when the input appears to be mostly sorted. That optimization was removed in qsort.c r1.12 but it is worth having in the regress test too. | ||||
| * | The BSD qsort() performs tail recursion elimination on the second | millert | 2017-05-17 | 1 | -10/+25 |
| | | | | | | | | | side of the array being partitioned to save on stack space. Greater savings can be gained by choosing recursion for the smaller side of the partition and eliminating recursion for the larger side. This also results in a small but measurable performance gain. OK otto@ schwarze@ | ||||
| * | There's no need to track the number of errors (and the counter might | millert | 2017-05-17 | 1 | -21/+30 |
| | | | | | wrap), make it a flag instead. Pointed out by schwarze@ | ||||
| * | Add qsort(3) regress based on Bentley & McIlroy's "Engineering a Sort Function" | millert | 2017-05-17 | 3 | -2/+278 |
| | | |||||
| * | Plug a memory leak. The main_cert needs to be X509_free()ed since | claudio | 2017-05-16 | 1 | -0/+2 |
| | | | | | | | SSL_get_peer_certificate() increases the ref count whereas extra_certs do not because SSL_get_peer_cert_chain() won't increase ref counts. OK beck@ | ||||
| * | typo: ket -> key. | tb | 2017-05-16 | 1 | -3/+3 |
| | | | | | from "fenderq" on freenode via tj | ||||
| * | Typo: freezeo -> freezero | tb | 2017-05-15 | 1 | -3/+3 |
| | | | | | From "fenderq" on freenode via tj@ | ||||
| * | - fix bug wrt posix_memalign(3) of blocks between half a page and a page | otto | 2017-05-13 | 2 | -8/+18 |
| | | | | | | - document posix_memalign() does not play nice with reacallocarray(3) and freezero(3) | ||||
| * | Fix a problem introduced in freezero() conversion and use | jsg | 2017-05-11 | 1 | -2/+2 |
| | | | | | | | | | | | sizeof(struct) not sizeof(pointer). otto@ points out that on OpenBSD currently freezero() would have still zeroed the entire allocation, but this is not documented behaviour and may change in future. ok tom@ | ||||
| * | Implement nc -W recvlimit to terminate netcat after receiving a | bluhm | 2017-05-10 | 2 | -8/+28 |
| | | | | | | | number of packets. This allows to send a UDP request, receive a reply and check the result on the command line. input jmc@; OK millert@ | ||||
| * | simplify startdate/enddate validation | beck | 2017-05-08 | 1 | -27/+5 |
| | | | | | ok jsing@ | ||||
| * | Print size_t's correctly. | beck | 2017-05-08 | 1 | -3/+3 |
| | | | | | Fix from Jonas 'Sortie' Termansen <sortie@maxsi.org> | ||||
| * | BUF_MEM_grow_clean() returns an int, not a size_t. Humourously, on success | jsing | 2017-05-08 | 1 | -3/+3 |
| | | | | | it returns "len", which is a size_t value, as an int... | ||||
| * | Revise cipher suites in regress to match DSS cipher suite removal. | jsing | 2017-05-07 | 1 | -96/+82 |
| | | |||||
| * | Drop cipher suites with DSS authentication - there is no good reason to | jsing | 2017-05-07 | 1 | -197/+1 |
| | | | | | | | keep these around. ok beck@ | ||||
| * | Instead of starting a 'zero-sized' CBB at the size of the first addition | jsing | 2017-05-07 | 1 | -5/+8 |
| | | | | | | | | | to the CBB, then doubling, start with an initial size of 64 bytes. Almost all uses will exceed this size and we avoid multiple small recallocarray() calls during the initial usage. ok beck@ | ||||
| * | Move state from ssl->internal to the handshake structure. | beck | 2017-05-07 | 15 | -256/+267 |
| | | | | | | | | while we are at it, convert SSLerror to use a function internally, so that we may later allocate the handshake structure and check for it ok jsing@ | ||||
| * | Limit -Werror to gcc4 as was done in libcrypto/libssl/libtls to avoid | jsg | 2017-05-07 | 2 | -6/+14 |
| | | | | | | | failed builds with different compilers. ok jsing@ | ||||
| * | Ensure that a client context has been connected before attempting to | jsing | 2017-05-07 | 2 | -4/+12 |
| | | | | | complete a TLS handshake. | ||||
| * | Add a (currently failing) call to tls_handshake() on a client context that | jsing | 2017-05-07 | 1 | -1/+8 |
| | | | | | | has not yet been connected. We expect this to fail, but it should fail gracefully. | ||||
| * | Also test calling tls_handshake() on a server connection context that has | jsing | 2017-05-07 | 1 | -1/+7 |
| | | | | | already completed a TLS handshake. | ||||
| * | Return an error if tls_handshake() is called on a TLS context that has | jsing | 2017-05-07 | 1 | -1/+6 |
| | | | | | already completed a TLS handshake. | ||||
| * | Add a test that calls tls_handshake() on a connection that has already | jsing | 2017-05-07 | 1 | -1/+7 |
| | | | | | | completed a TLS handshake. This should return a failure, but currently succeeds (hence the regress currently fails). | ||||
| * | An an initial sequencing/ordering test for libtls. | jsing | 2017-05-07 | 1 | -1/+61 |
| | | |||||
| * | Split TLS client/server handshake and close code into separate functions | jsing | 2017-05-06 | 1 | -4/+27 |
| | | | | | so that it can be reused. | ||||
| * | Bring in an SSL_HANDSHAKE structure and commence the great shovelling | beck | 2017-05-06 | 12 | -115/+121 |
| | | | | | ok jsing@, gcc@, regress@ | ||||
| * | Move TLS test code into a function that is called from main, making it | jsing | 2017-05-06 | 2 | -17/+33 |
| | | | | | easier for new tests to be added. | ||||
| * | Free tls_configs earlier now that we have refcounting. | jsing | 2017-05-06 | 1 | -4/+4 |
| | | |||||
| * | Use freezero() for the tls_load_file() failure case, since we're | jsing | 2017-05-06 | 1 | -4/+4 |
| | | | | | | | potentially dealing with key material. Also switch a calloc to malloc, since we immediately copy the same amount of data to the newly allocated buffer. | ||||
| * | BIO_free_all() and EVP_PKEY_free() can be called with NULL. | jsing | 2017-05-06 | 1 | -5/+3 |
| | | |||||
| * | Add more functions. | jsing | 2017-05-06 | 1 | -1/+5 |
| | | |||||
| * | Sort/group functions. | jsing | 2017-05-06 | 1 | -5/+10 |
| | | |||||
 |
index : openbsd | |
| A mirror of https://github.com/libressl/openbsd.git |
| summaryrefslogtreecommitdiff |