Commits

Nadav Rotem committed 422764545c7
[Runtime] Improve the metadata hashing function. The inputs to the hash function is pointers that have a predictable patten. The hashes that we were generating and using for the metadata caches were not very good, and as a result we generated very deep search trees. A small change that improved the utilization of the 'length' field and another bit-rotate round improved the quality of the hash function. I am going to attach to the github commit two pictures. The first picture is the binary with the old hash. The first tree is very deep and sparse. The second picture is with the new hash function and the tree is very wide and uniform. I used the benchmark 'TypeFlood' in debug mode to generate huge amounts of metadata.