OSchip
/
llvm-project
mirror of https://github.com/THU-DSP-LAB/llvm-project.git
13
0
Fork 6
Code Issues Packages Projects Releases Wiki Activity

[PM] Reformat this code with clang-format so that subsequent changes 

don't get muddied up by formatting changes.

Some of these don't really seem like improvements to me, but they also
don't seem any worse and I care much more about not formatting them
manually than I do about the particular formatting. =]

llvm-svn: 226610
This commit is contained in:
Chandler Carruth 2015-01-20 21:10:35 +00:00
parent e6fbdcedf9
commit b3d03df3ac
1 changed files with 9 additions and 9 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

14
llvm/lib/Transforms/InstCombine/InstCombine.h
View File

@ -340,7 +340,7 @@ public:
V = UndefValue::get(I.getType()); V = UndefValue::get(I.getType());
DEBUG(dbgs() << "IC: Replacing " << I << "\n" DEBUG(dbgs() << "IC: Replacing " << I << "\n"
" with " << *V << '\n'); << " with " << *V << '\n');
I.replaceAllUsesWith(V); I.replaceAllUsesWith(V);
return &I; return &I;
@ -350,11 +350,11 @@ public:
/// \p Result and a constant \p Overflow value. If \p ReUseName is true the /// \p Result and a constant \p Overflow value. If \p ReUseName is true the
/// \p Result's name is taken from \p II. /// \p Result's name is taken from \p II.
Instruction *CreateOverflowTuple(IntrinsicInst *II, Value *Result, Instruction *CreateOverflowTuple(IntrinsicInst *II, Value *Result,
bool Overflow, bool ReUseName = true) { bool Overflow, bool ReUseName = true) {
if (ReUseName) if (ReUseName)
Result->takeName(II); Result->takeName(II);
Constant *V[] = { UndefValue::get(Result->getType()), Constant *V[] = {UndefValue::get(Result->getType()),
Overflow ? Builder->getTrue() : Builder->getFalse() }; Overflow ? Builder->getTrue() : Builder->getFalse()};
StructType *ST = cast<StructType>(II->getType()); StructType *ST = cast<StructType>(II->getType());
Constant *Struct = ConstantStruct::get(ST, V); Constant *Struct = ConstantStruct::get(ST, V);
return InsertValueInst::Create(Struct, Result, 0); return InsertValueInst::Create(Struct, Result, 0);
@ -388,8 +388,7 @@ public:
DT); DT);
} }
bool MaskedValueIsZero(Value *V, const APInt &Mask, bool MaskedValueIsZero(Value *V, const APInt &Mask, unsigned Depth = 0,
unsigned Depth = 0,
Instruction *CxtI = nullptr) const { Instruction *CxtI = nullptr) const {
return llvm::MaskedValueIsZero(V, Mask, DL, Depth, AC, CxtI, DT); return llvm::MaskedValueIsZero(V, Mask, DL, Depth, AC, CxtI, DT);
} }
@ -416,7 +415,8 @@ private:
/// or commutative. /// or commutative.
bool SimplifyAssociativeOrCommutative(BinaryOperator &I); bool SimplifyAssociativeOrCommutative(BinaryOperator &I);
/// \brief Tries to simplify binary operations which some other binary operation distributes over. /// \brief Tries to simplify binary operations which some other binary
/// operation distributes over.
/// ///
/// It does this by either by factorizing out common terms (eg "(A*B)+(A*C)" /// It does this by either by factorizing out common terms (eg "(A*B)+(A*C)"
/// -> "A*(B+C)") or expanding out if this results in simplifications (eg: "A /// -> "A*(B+C)") or expanding out if this results in simplifications (eg: "A