Alastair Houghton 5ece45a61f [Remangler] Improve performance by caching hashes. ...

The deepHash() function gets called repeatedly as we descend the
node tree, which results in O(n^2) behaviour because we're traversing
entire node subtree from each node we try substitution in, in order
to calculate the hash.

Fix by adding a hash table for hashes, so that we can look up hashes
we've already computed.

This appears to yield a 26.8% saving in local tests.

rdar://125739630

2024-04-04 16:09:12 +01:00

5.9 KiB

Raw Permalink Blame History

View Raw