aboutsummaryrefslogtreecommitdiffstatshomepage
path: root/src/selftest (follow)
Commit message (Collapse)AuthorAgeFilesLines
* selftest: allowedips: randomized test mutex updateJason A. Donenfeld2017-11-131-5/+6
|
* allowedips: rename from routingtableJason A. Donenfeld2017-11-101-61/+61
| | | | Makes it more clear that this _not_ a routing table replacement.
* global: infuriating kernel iterator styleJason A. Donenfeld2017-10-311-4/+4
| | | | | | | | | | | | | | | | | One types: for (i = 0 ... So one should also type: for_each_obj (obj ... But the upstream kernel style guidelines are insane, and so we must instead do: for_each_obj(obj ... Ugly, but one must choose his battles wisely.
* selftest: initialize mutex in routingtable selftestJason A. Donenfeld2017-10-311-0/+2
|
* selftest: better test index for rate limiterJason A. Donenfeld2017-10-171-2/+13
|
* routingtable: only use device's mutex, not a special rt oneJason A. Donenfeld2017-10-091-6/+10
|
* Makefile: clang now builds the kernel, so use scan-buildJason A. Donenfeld2017-10-051-3/+3
| | | | | Also add little stub for coccinelle and clean up semicolon issue it found.
* selftest: more checking in ratelimiterJason A. Donenfeld2017-08-021-10/+16
|
* selftests: ensure that there isnt CPU lag when testing rate limiterJason A. Donenfeld2017-07-201-1/+25
|
* ratelimiter: consistently use non-bh rcuJason A. Donenfeld2017-07-071-1/+1
|
* ratelimiter: add self-testJason A. Donenfeld2017-07-061-0/+113
|
* selftest: remove antique siphash self testJason A. Donenfeld2017-06-241-89/+0
|
* main: annotate init/exit functions to save memoryJason A. Donenfeld2017-06-245-29/+29
|
* style: spaces after for loopsJason A. Donenfeld2017-05-301-4/+4
|
* routingtable: rewrite core functionsJason A. Donenfeld2017-04-212-133/+504
| | | | | | | | | | | | | | | | | | | | | When removing by peer, prev needs to be set to *nptr in order to traverse that part of the trie. The other remove by IP function can simply be removed, as it's not in use. The root freeing function can use pre-order traversal instead of post-order. The pre-order traversal code in general is now a nice iterator macro. The common bits function can use the fast fls instructions and the match function can be rewritten to simply compare common bits. While we're at it, let's add tons of new tests, randomized checking against a dumb implementation, and graphviz output. And in general, it's nice to clean things up.
* chacha20poly1305: enforce authtag checking with compilerJason A. Donenfeld2017-03-301-7/+7
|
* curve25519: protect against potential invalid point attacksJason A. Donenfeld2017-03-301-10/+18
|
* Update copyrightJason A. Donenfeld2017-01-106-6/+6
|
* cookies: use xchacha20poly1305 instead of chacha20poly1305Jason A. Donenfeld2016-12-231-0/+35
| | | | | This allows us to precompute the blake2s calls and save cycles, since hchacha is fast.
* siphash: update against upstream submissionJason A. Donenfeld2016-12-167-91/+99
|
* blake2s: move self tests to correct directoryJason A. Donenfeld2016-12-111-0/+554
|
* global: move to consistent use of uN instead of uintN_t for kernel codeJason A. Donenfeld2016-12-114-15/+15
|
* selftest: add routing table tests for small subnetsJason A. Donenfeld2016-11-071-0/+12
|
* selftest: move to subfolderJason A. Donenfeld2016-08-025-0/+413