so it turns out that knuth hash is the same as not hashing at all. Because the input is a random number from a fixed range, and I'm getting the hash index by masking the lower bits nothing much is going to improve the distribution.
2 aesdecs is 8 cycles, but they overlap with everything else, too. So if you are doing something like just hashing a pointer, you can mov it into an xmm register, do the two aesdecs, and they _should_ overlap with other things you were doing if there's anything else to do.
-
-
So it can be _extremely_ efficient, almost negligible, and you get very good bit distribution.
Thanks. Twitter will use this to make your timeline better. UndoUndo
-
Loading seems to be taking a while.
Twitter may be over capacity or experiencing a momentary hiccup. Try again or visit Twitter Status for more information.