aboutsummaryrefslogtreecommitdiff
path: root/clang/lib/Frontend/ASTMerge.cpp
diff options
context:
space:
mode:
authorRoman Lebedev <lebedev.ri@gmail.com>2019-07-01 14:28:24 +0000
committerRoman Lebedev <lebedev.ri@gmail.com>2019-07-01 14:28:24 +0000
commit34a0b16e290e5de95692a5b2c14c7807a02a0920 (patch)
treedc3560da780677e01cede69f4218749cb4a2a1f7 /clang/lib/Frontend/ASTMerge.cpp
parent1ad4b99d9482edacc4a2a54f1f11c2c3f8660353 (diff)
downloadllvm-34a0b16e290e5de95692a5b2c14c7807a02a0920.zip
llvm-34a0b16e290e5de95692a5b2c14c7807a02a0920.tar.gz
llvm-34a0b16e290e5de95692a5b2c14c7807a02a0920.tar.bz2
[NFC][InstCombine] Better commutative tests for "shift amount reassociation in bittest" pattern.
As discussed in https://reviews.llvm.org/D63829 *if* *both* shifts are one-use, we'd most likely want to produce `lshr`, and not rely on ordering. Also, there should likely be a *separate* fold to do this reordering. llvm-svn: 364772
Diffstat (limited to 'clang/lib/Frontend/ASTMerge.cpp')
0 files changed, 0 insertions, 0 deletions