Jakob Stoklund Olesen b95fd2d5fd Tweak hash function and compress hash tables. ... Make the hash tables as small as possible while ensuring that all lookups can be done in less than 8 probes. Cut the aliases hash table in half by only storing a < b pairs - it is a symmetric relation. Use larger multipliers on the initial hash function to ensure that it properly covers the whole table, and to resolve some clustering in the very regular ARM register bank. This reduces the size of most of these tables by 4x - 8x. For instance, the ARM tables shrink from 48 KB to 8 KB. git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@132888 91177308-0d34-0410-b5e6-96231b3b80d8		2011-06-12 07:04:32 +00:00
..
llvm	Tweak hash function and compress hash tables.	2011-06-12 07:04:32 +00:00
llvm-c	Cast unused parameter to void.	2011-06-04 16:00:19 +00:00