diff --git a/llvm/lib/Transforms/Scalar/ConstantProp.cpp b/llvm/lib/Transforms/Scalar/ConstantProp.cpp index 66e78960f78d2f9e7bb9a38ccf72e13bdd3bb60b..ba084b16ea4d8401e7a8e38a09babb3d1af66f18 100644 --- a/llvm/lib/Transforms/Scalar/ConstantProp.cpp +++ b/llvm/lib/Transforms/Scalar/ConstantProp.cpp @@ -26,8 +26,7 @@ #include "llvm/Support/InstIterator.h" #include "Support/Statistic.h" #include - -namespace llvm { +using namespace llvm; namespace { Statistic<> NumInstKilled("constprop", "Number of instructions killed"); @@ -43,7 +42,7 @@ namespace { RegisterOpt X("constprop","Simple constant propagation"); } -Pass *createConstantPropagationPass() { +Pass *llvm::createConstantPropagationPass() { return new ConstantPropagation(); } @@ -75,5 +74,3 @@ bool ConstantPropagation::runOnFunction(Function &F) { } return Changed; } - -} // End llvm namespace diff --git a/llvm/lib/Transforms/Scalar/CorrelatedExprs.cpp b/llvm/lib/Transforms/Scalar/CorrelatedExprs.cpp index a0358b54ad2dd5ad1350f91e215b1d6a12d6328d..f0c4071580d590b846eaba693082e9b5b571a2c8 100644 --- a/llvm/lib/Transforms/Scalar/CorrelatedExprs.cpp +++ b/llvm/lib/Transforms/Scalar/CorrelatedExprs.cpp @@ -41,8 +41,7 @@ #include "Support/PostOrderIterator.h" #include "Support/Statistic.h" #include - -namespace llvm { +using namespace llvm; namespace { Statistic<> NumSetCCRemoved("cee", "Number of setcc instruction eliminated"); @@ -285,7 +284,7 @@ namespace { RegisterOpt X("cee", "Correlated Expression Elimination"); } -Pass *createCorrelatedExpressionEliminationPass() { return new CEE(); } +Pass *llvm::createCorrelatedExpressionEliminationPass() { return new CEE(); } bool CEE::runOnFunction(Function &F) { @@ -1316,5 +1315,3 @@ void Relation::print(std::ostream &OS) const { void Relation::dump() const { print(std::cerr); } void ValueInfo::dump() const { print(std::cerr, 0); } void RegionInfo::dump() const { print(std::cerr); } - -} // End llvm namespace diff --git a/llvm/lib/Transforms/Scalar/DCE.cpp b/llvm/lib/Transforms/Scalar/DCE.cpp index 3e63cadd3e51b4aa897361ab19538f571f9c7406..8d0b1db650235edfe6fad30e6acfe3b39d0f848a 100644 --- a/llvm/lib/Transforms/Scalar/DCE.cpp +++ b/llvm/lib/Transforms/Scalar/DCE.cpp @@ -23,8 +23,7 @@ #include "llvm/Support/InstIterator.h" #include "Support/Statistic.h" #include - -namespace llvm { +using namespace llvm; namespace { Statistic<> DIEEliminated("die", "Number of insts removed"); @@ -54,7 +53,7 @@ namespace { RegisterOpt X("die", "Dead Instruction Elimination"); } -Pass *createDeadInstEliminationPass() { +Pass *llvm::createDeadInstEliminationPass() { return new DeadInstElimination(); } @@ -122,8 +121,7 @@ bool DCE::runOnFunction(Function &F) { return true; } -Pass *createDeadCodeEliminationPass() { +Pass *llvm::createDeadCodeEliminationPass() { return new DCE(); } -} // End llvm namespace diff --git a/llvm/lib/Transforms/Scalar/DecomposeMultiDimRefs.cpp b/llvm/lib/Transforms/Scalar/DecomposeMultiDimRefs.cpp index e110cdac8b7ff7b7c0212576a2fc21ddbddfd81c..8fe0152ab78e695f8fc08b796862e921702c039f 100644 --- a/llvm/lib/Transforms/Scalar/DecomposeMultiDimRefs.cpp +++ b/llvm/lib/Transforms/Scalar/DecomposeMultiDimRefs.cpp @@ -24,8 +24,7 @@ #include "llvm/BasicBlock.h" #include "llvm/Pass.h" #include "Support/Statistic.h" - -namespace llvm { +using namespace llvm; namespace { Statistic<> NumAdded("lowerrefs", "# of getelementptr instructions added"); @@ -33,17 +32,14 @@ namespace { struct DecomposePass : public BasicBlockPass { virtual bool runOnBasicBlock(BasicBlock &BB); }; + RegisterOpt X("lowerrefs", "Decompose multi-dimensional " + "structure/array references"); } -RegisterOpt X("lowerrefs", "Decompose multi-dimensional " - "structure/array references"); - // runOnBasicBlock - Entry point for array or structure references with multiple // indices. // -bool -DecomposePass::runOnBasicBlock(BasicBlock &BB) -{ +bool DecomposePass::runOnBasicBlock(BasicBlock &BB) { bool changed = false; for (BasicBlock::iterator II = BB.begin(); II != BB.end(); ) if (GetElementPtrInst *gep = dyn_cast(II++)) // pre-inc @@ -52,9 +48,7 @@ DecomposePass::runOnBasicBlock(BasicBlock &BB) return changed; } -FunctionPass -*createDecomposeMultiDimRefsPass() -{ +FunctionPass *llvm::createDecomposeMultiDimRefsPass() { return new DecomposePass(); } @@ -81,9 +75,7 @@ FunctionPass // // Return value: true if the instruction was replaced; false otherwise. // -bool -DecomposeArrayRef(GetElementPtrInst* GEP) -{ +bool llvm::DecomposeArrayRef(GetElementPtrInst* GEP) { if (GEP->getNumIndices() < 2) return false; @@ -135,4 +127,3 @@ DecomposeArrayRef(GetElementPtrInst* GEP) return true; } -} // End llvm namespace diff --git a/llvm/lib/Transforms/Scalar/GCSE.cpp b/llvm/lib/Transforms/Scalar/GCSE.cpp index b00d3005bfa6c6159b45f9e42f5ceb81f0c9b65e..3d700cb4da4fd10c87492d1b58c7e9ee130d8b57 100644 --- a/llvm/lib/Transforms/Scalar/GCSE.cpp +++ b/llvm/lib/Transforms/Scalar/GCSE.cpp @@ -22,8 +22,7 @@ #include "llvm/Support/InstIterator.h" #include "Support/Statistic.h" #include - -namespace llvm { +using namespace llvm; namespace { Statistic<> NumInstRemoved("gcse", "Number of instructions removed"); @@ -56,7 +55,7 @@ namespace { } // createGCSEPass - The public interface to this file... -FunctionPass *createGCSEPass() { return new GCSE(); } +FunctionPass *llvm::createGCSEPass() { return new GCSE(); } // GCSE::runOnFunction - This is the main transformation entry point for a // function. @@ -270,5 +269,3 @@ Instruction *GCSE::EliminateCSE(Instruction *I, Instruction *Other) { return Ret; } - -} // End llvm namespace diff --git a/llvm/lib/Transforms/Scalar/LowerAllocations.cpp b/llvm/lib/Transforms/Scalar/LowerAllocations.cpp index eea800ad54759f94390b9e0d6faf4129418332c8..222ca74ed164cb873764d1dd9ae70fefa9197b63 100644 --- a/llvm/lib/Transforms/Scalar/LowerAllocations.cpp +++ b/llvm/lib/Transforms/Scalar/LowerAllocations.cpp @@ -21,8 +21,7 @@ #include "llvm/Pass.h" #include "llvm/Target/TargetData.h" #include "Support/Statistic.h" - -namespace llvm { +using namespace llvm; namespace { Statistic<> NumLowered("lowerallocs", "Number of allocations lowered"); @@ -56,7 +55,7 @@ namespace { } // createLowerAllocationsPass - Interface to this file... -FunctionPass *createLowerAllocationsPass() { +FunctionPass *llvm::createLowerAllocationsPass() { return new LowerAllocations(); } @@ -134,4 +133,3 @@ bool LowerAllocations::runOnBasicBlock(BasicBlock &BB) { return Changed; } -} // End llvm namespace diff --git a/llvm/lib/Transforms/Scalar/LowerSwitch.cpp b/llvm/lib/Transforms/Scalar/LowerSwitch.cpp index 24e48d4c5d26d0901bd0a30140a5b3ca8136df7b..f6e6886bb50ed6e09673b804e518c98b953b7aab 100644 --- a/llvm/lib/Transforms/Scalar/LowerSwitch.cpp +++ b/llvm/lib/Transforms/Scalar/LowerSwitch.cpp @@ -22,8 +22,7 @@ #include "llvm/Pass.h" #include "Support/Debug.h" #include "Support/Statistic.h" - -namespace llvm { +using namespace llvm; namespace { Statistic<> NumLowered("lowerswitch", "Number of SwitchInst's replaced"); @@ -62,7 +61,7 @@ namespace { } // createLowerSwitchPass - Interface to this file... -FunctionPass *createLowerSwitchPass() { +FunctionPass *llvm::createLowerSwitchPass() { return new LowerSwitch(); } @@ -83,12 +82,12 @@ bool LowerSwitch::runOnFunction(Function &F) { // operator<< - Used for debugging purposes. // -std::ostream& operator << (std::ostream& O, std::vector& C) -{ +std::ostream& operator<<(std::ostream &O, + const std::vector &C) { O << "["; - for (std::vector::iterator B = C.begin(), E = C.end(); - B != E; ) { + for (std::vector::const_iterator B = C.begin(), + E = C.end(); B != E; ) { O << *B->first; if (++B != E) O << ", "; } @@ -224,5 +223,3 @@ void LowerSwitch::processSwitchInst(SwitchInst *SI) { // We are now done with the switch instruction, delete it. delete SI; } - -} // End llvm namespace diff --git a/llvm/lib/Transforms/Scalar/Mem2Reg.cpp b/llvm/lib/Transforms/Scalar/Mem2Reg.cpp index 4d99280805822c24d361513f160c056b31e4e414..0e411d2166048fd01761348ac85c0a898bfaeb87 100644 --- a/llvm/lib/Transforms/Scalar/Mem2Reg.cpp +++ b/llvm/lib/Transforms/Scalar/Mem2Reg.cpp @@ -19,8 +19,7 @@ #include "llvm/Function.h" #include "llvm/Target/TargetData.h" #include "Support/Statistic.h" - -namespace llvm { +using namespace llvm; namespace { Statistic<> NumPromoted("mem2reg", "Number of alloca's promoted"); @@ -77,8 +76,7 @@ bool PromotePass::runOnFunction(Function &F) { // createPromoteMemoryToRegister - Provide an entry point to create this pass. // -Pass *createPromoteMemoryToRegister() { +Pass *llvm::createPromoteMemoryToRegister() { return new PromotePass(); } -} // End llvm namespace diff --git a/llvm/lib/Transforms/Scalar/PRE.cpp b/llvm/lib/Transforms/Scalar/PRE.cpp index 770cd44d75f7e8a0b1220fb1a32203a055f6556e..88d9143d071b49808d96bf0511314c9c083cb802 100644 --- a/llvm/lib/Transforms/Scalar/PRE.cpp +++ b/llvm/lib/Transforms/Scalar/PRE.cpp @@ -35,13 +35,12 @@ #include "Support/PostOrderIterator.h" #include "Support/Statistic.h" #include "Support/hash_set" - -namespace llvm { +using namespace llvm; namespace { Statistic<> NumExprsEliminated("pre", "Number of expressions constantified"); Statistic<> NumRedundant ("pre", "Number of redundant exprs eliminated"); - static Statistic<> NumInserted ("pre", "Number of expressions inserted"); + Statistic<> NumInserted ("pre", "Number of expressions inserted"); struct PRE : public FunctionPass { virtual void getAnalysisUsage(AnalysisUsage &AU) const { @@ -633,4 +632,3 @@ bool PRE::ProcessExpression(Instruction *Expr) { return Changed; } -} // End llvm namespace diff --git a/llvm/lib/Transforms/Scalar/PiNodeInsertion.cpp b/llvm/lib/Transforms/Scalar/PiNodeInsertion.cpp index 89ec20e06900b6ee2843f69d8ac960fc83027f2a..d8fd554de44efdb7248d859770b9cb76ce48306a 100644 --- a/llvm/lib/Transforms/Scalar/PiNodeInsertion.cpp +++ b/llvm/lib/Transforms/Scalar/PiNodeInsertion.cpp @@ -41,8 +41,7 @@ #include "llvm/iPHINode.h" #include "llvm/Support/CFG.h" #include "Support/Statistic.h" - -namespace llvm { +using namespace llvm; namespace { Statistic<> NumInserted("pinodes", "Number of Pi nodes inserted"); @@ -66,7 +65,7 @@ namespace { RegisterOpt X("pinodes", "Pi Node Insertion"); } -Pass *createPiNodeInsertionPass() { return new PiNodeInserter(); } +Pass *llvm::createPiNodeInsertionPass() { return new PiNodeInserter(); } bool PiNodeInserter::runOnFunction(Function &F) { @@ -183,6 +182,3 @@ bool PiNodeInserter::insertPiNodeFor(Value *V, BasicBlock *Succ, Value *Rep) { ++NumInserted; return true; } - - -} // End llvm namespace diff --git a/llvm/lib/Transforms/Scalar/Reassociate.cpp b/llvm/lib/Transforms/Scalar/Reassociate.cpp index 9e22ec4e7e5cb302ef399816285bdee5c38aceb1..99cd7f31658f35f57d22bd6651291a859360231d 100644 --- a/llvm/lib/Transforms/Scalar/Reassociate.cpp +++ b/llvm/lib/Transforms/Scalar/Reassociate.cpp @@ -33,8 +33,7 @@ #include "Support/Debug.h" #include "Support/PostOrderIterator.h" #include "Support/Statistic.h" - -namespace llvm { +using namespace llvm; namespace { Statistic<> NumLinear ("reassociate","Number of insts linearized"); @@ -61,7 +60,7 @@ namespace { } // Public interface to the Reassociate pass -FunctionPass *createReassociatePass() { return new Reassociate(); } +FunctionPass *llvm::createReassociatePass() { return new Reassociate(); } void Reassociate::BuildRankMap(Function &F) { unsigned i = 2; @@ -295,4 +294,3 @@ bool Reassociate::runOnFunction(Function &F) { return Changed; } -} // End llvm namespace diff --git a/llvm/lib/Transforms/Scalar/SCCP.cpp b/llvm/lib/Transforms/Scalar/SCCP.cpp index 44a553a01bcd8fe29607f8dd27f45e388ec8d98a..ee6a175278e19a57e4124655dd1b13c78a2f7dcd 100644 --- a/llvm/lib/Transforms/Scalar/SCCP.cpp +++ b/llvm/lib/Transforms/Scalar/SCCP.cpp @@ -32,8 +32,7 @@ #include "Support/STLExtras.h" #include #include - -namespace llvm { +using namespace llvm; // InstVal class - This class represents the different lattice values that an // instruction may occupy. It is a simple class with value semantics. @@ -255,7 +254,7 @@ private: // createSCCPPass - This is the public interface to this file... -Pass *createSCCPPass() { +Pass *llvm::createSCCPPass() { return new SCCP(); } @@ -587,4 +586,3 @@ void SCCP::visitGetElementPtrInst(GetElementPtrInst &I) { markConstant(&I, ConstantExpr::getGetElementPtr(Ptr, Operands)); } -} // End llvm namespace diff --git a/llvm/lib/Transforms/Scalar/SimplifyCFG.cpp b/llvm/lib/Transforms/Scalar/SimplifyCFG.cpp index 5a8d428153821d25a8e96ad074f0b01b56f9d96a..8e0f7d33073644ef71717239760ff3ea6652156a 100644 --- a/llvm/lib/Transforms/Scalar/SimplifyCFG.cpp +++ b/llvm/lib/Transforms/Scalar/SimplifyCFG.cpp @@ -25,8 +25,7 @@ #include "llvm/Pass.h" #include "Support/Statistic.h" #include - -namespace llvm { +using namespace llvm; namespace { Statistic<> NumSimpl("cfgsimplify", "Number of blocks simplified"); @@ -38,7 +37,7 @@ namespace { } // Public interface to the CFGSimplification pass -FunctionPass *createCFGSimplificationPass() { +FunctionPass *llvm::createCFGSimplificationPass() { return new CFGSimplifyPass(); } @@ -103,5 +102,3 @@ bool CFGSimplifyPass::runOnFunction(Function &F) { return Changed; } - -} // End llvm namespace diff --git a/llvm/lib/Transforms/Scalar/TailDuplication.cpp b/llvm/lib/Transforms/Scalar/TailDuplication.cpp index 07a3b1e492af734a88db79ca4269b555b685e8d8..95226a2503effb58a5f9ed5693579120d1d8c3c9 100644 --- a/llvm/lib/Transforms/Scalar/TailDuplication.cpp +++ b/llvm/lib/Transforms/Scalar/TailDuplication.cpp @@ -30,8 +30,7 @@ #include "llvm/Transforms/Utils/Local.h" #include "Support/Debug.h" #include "Support/Statistic.h" - -namespace llvm { +using namespace llvm; namespace { Statistic<> NumEliminated("tailduplicate", @@ -56,7 +55,7 @@ namespace { } // Public interface to the Tail Duplication pass -Pass *createTailDuplicationPass() { return new TailDup(); } +Pass *llvm::createTailDuplicationPass() { return new TailDup(); } /// runOnFunction - Top level algorithm - Loop over each unconditional branch in /// the function, eliminating it if it looks attractive enough. @@ -342,5 +341,3 @@ Value *TailDup::GetValueOutBlock(BasicBlock *BB, Value *OrigVal, return GetValueInBlock(BB, OrigVal, ValueMap, OutValueMap); } - -} // End llvm namespace