| Commit message (Collapse) | Author | Age | Files | Lines |
| | |
|
| |
|
|
|
|
|
|
|
|
|
| |
* decrease instruction level parallelism
it turns out doing 2 things was too much. perf annotate showed spilling.
* more trickery with latency hiding
* work-stealing, lookp tables, credits
* do not assume gender
|
| |
|
|
|
| |
* another shameless copycat from thomas: less safepoints
* I have no idea what I am doing
|
| |
|
|
|
|
|
|
|
|
| |
* some random changes with minimal, if any, effect
* use munmap() trick
credit: thomaswue
* some smaller tweaks
* use native image
|
| |
|
|
|
|
|
|
|
|
|
| |
* fast-path for keys<16 bytes
* fix off by one error
the mask is wrong for he 2nd word when len == 16
* less chunks per thread
seems like compact code wins. on my test box anyway.
|
| |
|
|
|
|
|
| |
* refactoring
* segregated heap for names
also a different hashing function. turns out hashing just first word is good enough
|
| |
|
| |
also a bunch of smaller improvements
|
|
|
* initial version
let's exploit that superscalar beauty!
* give credits where credits is due
also: added ideas I don't want to forget
|