Currently, our value hashing techniques are a bit ad-hoc, and special case for commutative instructions and so on. We can be clever by making the hash for addition be +, the hash for multiplication be *, and so on, and pick big, random constants so that we don't get very many collisions for hashes which aren't congruent. We have to be careful with things like bitops, which tend to fold everything down, but this gets use things like commutativity and associativity for free, without special-casing at all, and may be worthwhile to investigate.
Per policy at https://wiki.mozilla.org/Bug_Triage/Projects/Bug_Handling/Bug_Husbandry#Inactive_Bugs. If this bug is not an enhancement request or a bug not present in a supported release of Firefox, then it may be reopened.
Status: NEW → RESOLVED
Last Resolved: 4 days ago
Resolution: --- → INACTIVE
You need to log in before you can comment on or make changes to this bug.