RPCS3/llvm
1
0
Fork 0
mirror of https://github.com/RPCS3/llvm.git synced 2024-12-11 13:44:28 +00:00
Code Issues Actions Packages Projects Releases Wiki Activity

80 col / tabs fixes

Browse Source 
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@51021 91177308-0d34-0410-b5e6-96231b3b80d8
This commit is contained in:
Nate Begeman 2008-05-13 01:48:26 +00:00
parent c9bdb00683
commit a72acf9389
2 changed files with 7 additions and 6 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

9
lib/Transforms/IPO/ArgumentPromotion.cpp
View File

@ -66,7 +66,8 @@ namespace {
virtual bool runOnSCC(const std::vector<CallGraphNode *> &SCC);
static char ID; // Pass identification, replacement for typeid
ArgPromotion(unsigned maxElements = 3) : CallGraphSCCPass((intptr_t)&ID), maxElements(maxElements) {}
ArgPromotion(unsigned maxElements = 3) : CallGraphSCCPass((intptr_t)&ID),
maxElements(maxElements) {}
private:
bool PromoteArguments(CallGraphNode *CGN);
@ -74,8 +75,8 @@ namespace {
Function *DoPromotion(Function *F,
SmallPtrSet<Argument*, 8> &ArgsToPromote,
SmallPtrSet<Argument*, 8> &ByValArgsToTransform);
/// The maximum number of elements to expand, or 0 for unlimited.
unsigned maxElements;
/// The maximum number of elements to expand, or 0 for unlimited.
unsigned maxElements;
};
}
@ -290,7 +291,7 @@ bool ArgPromotion::isSafeToPromoteArgument(Argument *Arg, bool isByVal) const {
<< Arg->getName() << "' because it would require adding more "
<< "than " << maxElements << " arguments to the function.\n";
// We limit aggregate promotion to only promoting up to a fixed number
// of elements of the aggregate.
// of elements of the aggregate.
return false;
}
GEPIndices.push_back(Operands);

4
lib/Transforms/Scalar/DeadStoreElimination.cpp
View File

@ -327,8 +327,8 @@ bool DSE::handleEndBlock(BasicBlock& BB,
// If we encounter a use of the pointer, it is no longer considered dead
if (LoadInst* L = dyn_cast<LoadInst>(BBI)) {
// However, if this load is unused and not volatile, we can go ahead and remove it,
// and not have to worry about it making our pointer undead!
// However, if this load is unused and not volatile, we can go ahead and
// remove it, and not have to worry about it making our pointer undead!
if (L->use_empty() && !L->isVolatile()) {
MD.removeInstruction(L);