diff options
| author | Max Kazantsev <max.kazantsev@azul.com> | 2017-11-28 08:26:43 +0000 |
|---|---|---|
| committer | Max Kazantsev <max.kazantsev@azul.com> | 2017-11-28 08:26:43 +0000 |
| commit | 6e78ad35cc155ad838ed9eda1d319b4eab5c454f (patch) | |
| tree | 298c49aa12b2cf0e3a9dcca5f6002139f02ef90e /llvm/lib/CodeGen/MachineBasicBlock.cpp | |
| parent | 2d614ced553bd9288959f8d5194e5463aa27d60e (diff) | |
| download | llvm-6e78ad35cc155ad838ed9eda1d319b4eab5c454f.zip llvm-6e78ad35cc155ad838ed9eda1d319b4eab5c454f.tar.gz llvm-6e78ad35cc155ad838ed9eda1d319b4eab5c454f.tar.bz2 | |
[SCEV][NFC] More efficient caching in CompareValueComplexity
Currently, we use a set of pairs to cache responces like `CompareValueComplexity(X, Y) == 0`. If we had
proved that `CompareValueComplexity(S1, S2) == 0` and `CompareValueComplexity(S2, S3) == 0`,
this cache does not allow us to prove that `CompareValueComplexity(S1, S3)` is also `0`.
This patch replaces this set with `EquivalenceClasses` that merges Values into equivalence sets so that
any two values from the same set are equal from point of `CompareValueComplexity`. This, in particular,
allows us to prove the fact from example above.
Differential Revision: https://reviews.llvm.org/D40429
llvm-svn: 319153
Diffstat (limited to 'llvm/lib/CodeGen/MachineBasicBlock.cpp')
0 files changed, 0 insertions, 0 deletions