RPCSX/llvm
1
0
Fork 0
mirror of https://github.com/RPCSX/llvm.git synced 2024-12-11 21:57:55 +00:00
Code Issues Actions Packages Projects Releases Wiki Activity

Refactor: Simplify boolean conditional return statements in lib/Transforms/Vectorize (NFC).

Browse Source 
Summary: Use clang-tidy to simplify boolean conditional return statements

Differential Revision: http://reviews.llvm.org/D10003

Patch by Richard<legalize@xmission.com>

git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@251206 91177308-0d34-0410-b5e6-96231b3b80d8
This commit is contained in:
Michael Zolotukhin 2015-10-24 20:16:42 +00:00
parent 5dbc03472b
commit df43fcd565
2 changed files with 5 additions and 11 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

5
lib/Transforms/Vectorize/LoopVectorize.cpp
View File

@ -5215,9 +5215,8 @@ static bool isLikelyComplexAddressComputation(Value *Ptr,
}
static bool isStrideMul(Instruction *I, LoopVectorizationLegality *Legal) {
if (Legal->hasStride(I->getOperand(0)) || Legal->hasStride(I->getOperand(1)))
return true;
return false;
return Legal->hasStride(I->getOperand(0)) ||
Legal->hasStride(I->getOperand(1));
}
unsigned

11
lib/Transforms/Vectorize/SLPVectorizer.cpp
View File

@ -168,10 +168,8 @@ static unsigned getAltOpcode(unsigned Op) {
/// of an alternate sequence which can later be merged as
/// a ShuffleVector instruction.
static bool canCombineAsAltInst(unsigned Op) {
if (Op == Instruction::FAdd || Op == Instruction::FSub ||
Op == Instruction::Sub || Op == Instruction::Add)
return true;
return false;
return Op == Instruction::FAdd || Op == Instruction::FSub ||
Op == Instruction::Sub || Op == Instruction::Add;
}
/// \returns ShuffleVector instruction if instructions in \p VL have
@ -1990,10 +1988,7 @@ static bool shouldReorderOperands(int i, Instruction &I,
return false;
}
// One opcode, put the instruction on the right.
if (ILeft) {
return true;
}
return false;
return ILeft != nullptr;
}
void BoUpSLP::reorderInputsAccordingToOpcode(ArrayRef<Value *> VL,