diff options
| author | Anton Korobeynikov <asl@math.spbu.ru> | 2008-02-20 12:07:57 +0000 |
|---|---|---|
| committer | Anton Korobeynikov <asl@math.spbu.ru> | 2008-02-20 12:07:57 +0000 |
| commit | 6a4a93397215f7c1b10885726431fde515edde77 (patch) | |
| tree | b6cea47a8fde646984abfe138325ccc046923420 /lib/Transforms | |
| parent | 87ab838945609a74bd4757a87dbd2718ed2061ae (diff) | |
| download | external_llvm-6a4a93397215f7c1b10885726431fde515edde77.tar.gz external_llvm-6a4a93397215f7c1b10885726431fde515edde77.tar.bz2 external_llvm-6a4a93397215f7c1b10885726431fde515edde77.zip | |
Fix newly-introduced 4.3 warnings
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@47375 91177308-0d34-0410-b5e6-96231b3b80d8
Diffstat (limited to 'lib/Transforms')
| -rw-r--r-- | lib/Transforms/Scalar/InstructionCombining.cpp | 4 | ||||
| -rw-r--r-- | lib/Transforms/Utils/LCSSA.cpp | 2 |
2 files changed, 3 insertions, 3 deletions
diff --git a/lib/Transforms/Scalar/InstructionCombining.cpp b/lib/Transforms/Scalar/InstructionCombining.cpp index 1200895615..d6d8781354 100644 --- a/lib/Transforms/Scalar/InstructionCombining.cpp +++ b/lib/Transforms/Scalar/InstructionCombining.cpp @@ -5481,8 +5481,8 @@ Instruction *InstCombiner::visitICmpInstWithInstAndIntCst(ICmpInst &ICI, // Extending a relational comparison when we're checking the sign // bit would not work. if (Cast->hasOneUse() && - (ICI.isEquality() || AndCST->getValue().isNonNegative() && - RHSV.isNonNegative())) { + (ICI.isEquality() || + (AndCST->getValue().isNonNegative() && RHSV.isNonNegative()))) { uint32_t BitWidth = cast<IntegerType>(Cast->getOperand(0)->getType())->getBitWidth(); APInt NewCST = AndCST->getValue(); diff --git a/lib/Transforms/Utils/LCSSA.cpp b/lib/Transforms/Utils/LCSSA.cpp index 770ce736da..567b23e6ff 100644 --- a/lib/Transforms/Utils/LCSSA.cpp +++ b/lib/Transforms/Utils/LCSSA.cpp @@ -90,7 +90,7 @@ namespace { std::map<DomTreeNode*, Value*> &Phis); /// inLoop - returns true if the given block is within the current loop - const bool inLoop(BasicBlock* B) { + bool inLoop(BasicBlock* B) { return std::binary_search(LoopBlocks.begin(), LoopBlocks.end(), B); } }; |