RPCS3/llvm-mirror
1
0
Fork 0
mirror of https://github.com/RPCS3/llvm-mirror.git synced 2024-11-22 02:33:06 +01:00
Code Issues Projects Releases Wiki Activity

Format AggresiveInstCombine.cpp. NFC

Browse Source 
llvm-svn: 350255
This commit is contained in:
Pawel Bylica 2019-01-02 19:51:46 +00:00
parent 3e94a5b005
commit 97c9140db9
1 changed files with 11 additions and 11 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

22
lib/Transforms/AggressiveInstCombine/AggressiveInstCombine.cpp
View File

@ -81,8 +81,8 @@ static bool foldGuardedRotateToFunnelShift(Instruction &I) {
auto Sub = m_Sub(m_SpecificInt(Width), m_Value(R1));
// rotate_left(X, Y) == (X << Y) | (X >> (Width - Y))
auto RotL = m_OneUse(m_c_Or(m_Shl(m_Value(L0), m_Value(L1)),
m_LShr(m_Value(R0), Sub)));
auto RotL = m_OneUse(
m_c_Or(m_Shl(m_Value(L0), m_Value(L1)), m_LShr(m_Value(R0), Sub)));
if (RotL.match(V) && L0 == R0 && L1 == R1) {
X = L0;
Y = L1;
@ -90,8 +90,8 @@ static bool foldGuardedRotateToFunnelShift(Instruction &I) {
}
// rotate_right(X, Y) == (X >> Y) | (X << (Width - Y))
auto RotR = m_OneUse(m_c_Or(m_LShr(m_Value(L0), m_Value(L1)),
m_Shl(m_Value(R0), Sub)));
auto RotR = m_OneUse(
m_c_Or(m_LShr(m_Value(L0), m_Value(L1)), m_Shl(m_Value(R0), Sub)));
if (RotR.match(V) && L0 == R0 && L1 == R1) {
X = L0;
Y = L1;
@ -124,8 +124,8 @@ static bool foldGuardedRotateToFunnelShift(Instruction &I) {
Instruction *TermI = GuardBB->getTerminator();
BasicBlock *TrueBB, *FalseBB;
ICmpInst::Predicate Pred;
if (!match(TermI, m_Br(m_ICmp(Pred, m_Specific(RotAmt), m_ZeroInt()),
TrueBB, FalseBB)))
if (!match(TermI, m_Br(m_ICmp(Pred, m_Specific(RotAmt), m_ZeroInt()), TrueBB,
FalseBB)))
return false;
BasicBlock *PhiBB = Phi.getParent();
@ -162,9 +162,9 @@ struct MaskOps {
bool MatchAndChain;
bool FoundAnd1;
MaskOps(unsigned BitWidth, bool MatchAnds) :
Root(nullptr), Mask(APInt::getNullValue(BitWidth)),
MatchAndChain(MatchAnds), FoundAnd1(false) {}
MaskOps(unsigned BitWidth, bool MatchAnds)
: Root(nullptr), Mask(APInt::getNullValue(BitWidth)),
MatchAndChain(MatchAnds), FoundAnd1(false) {}
};
/// This is a recursive helper for foldAnyOrAllBitsSet() that walks through a
@ -245,8 +245,8 @@ static bool foldAnyOrAllBitsSet(Instruction &I) {
IRBuilder<> Builder(&I);
Constant *Mask = ConstantInt::get(I.getType(), MOps.Mask);
Value *And = Builder.CreateAnd(MOps.Root, Mask);
Value *Cmp = MatchAllBitsSet ? Builder.CreateICmpEQ(And, Mask) :
Builder.CreateIsNotNull(And);
Value *Cmp = MatchAllBitsSet ? Builder.CreateICmpEQ(And, Mask)
: Builder.CreateIsNotNull(And);
Value *Zext = Builder.CreateZExt(Cmp, I.getType());
I.replaceAllUsesWith(Zext);
return true;