Displaying 2 results from an estimated 2 matches for "245b0127".
2012 Feb 09
0
[LLVMdev] We need better hashing
...overhead (usually in the form of a final mixing step) and
> thus only make sense for larger key sizes.
>
> --
> -- Talin
>
--
-- Talin
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://lists.llvm.org/pipermail/llvm-dev/attachments/20120209/245b0127/attachment.html>
2012 Feb 08
2
[LLVMdev] We need better hashing
LLVM currently has a bunch of different hashing algorithms scattered
throughout the code base.
There's also a number of places in the code where a FoldingSetNodeID is
created for the purpose of calculating a hash, and then discarded. From an
efficiency standpoint, this isn't all that bad unless the number of
individual items being hashed > 32, at which point the SmallVector
overflows