From 3b1b6e626e42eb22869a28b02a463de5597f9822 Mon Sep 17 00:00:00 2001 From: Misha Brukman Date: Fri, 22 Apr 2005 03:27:20 +0000 Subject: [PATCH] Convert tabs to spaces git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@21436 91177308-0d34-0410-b5e6-96231b3b80d8 --- include/llvm/ADT/PostOrderIterator.h | 4 +-- include/llvm/Analysis/ConstantsScanner.h | 8 ++--- include/llvm/Analysis/IntervalIterator.h | 40 ++++++++++++------------ include/llvm/Analysis/Verifier.h | 2 +- include/llvm/Assembly/Parser.h | 2 +- include/llvm/Assembly/Writer.h | 2 +- include/llvm/Bytecode/Reader.h | 2 +- 7 files changed, 30 insertions(+), 30 deletions(-) diff --git a/include/llvm/ADT/PostOrderIterator.h b/include/llvm/ADT/PostOrderIterator.h index 97831a232df..70abd5f366d 100644 --- a/include/llvm/ADT/PostOrderIterator.h +++ b/include/llvm/ADT/PostOrderIterator.h @@ -38,8 +38,8 @@ class po_iterator : public forward_iterator { while (VisitStack.top().second != GT::child_end(VisitStack.top().first)) { NodeType *BB = *VisitStack.top().second++; if (!Visited.count(BB)) { // If the block is not visited... - Visited.insert(BB); - VisitStack.push(std::make_pair(BB, GT::child_begin(BB))); + Visited.insert(BB); + VisitStack.push(std::make_pair(BB, GT::child_begin(BB))); } } } diff --git a/include/llvm/Analysis/ConstantsScanner.h b/include/llvm/Analysis/ConstantsScanner.h index bf0772dbf14..1f71f3900c9 100644 --- a/include/llvm/Analysis/ConstantsScanner.h +++ b/include/llvm/Analysis/ConstantsScanner.h @@ -32,7 +32,7 @@ class constant_iterator : public forward_iterator { inline bool isAtConstant() const { assert(!InstI.atEnd() && OpIdx < InstI->getNumOperands() && - "isAtConstant called with invalid arguments!"); + "isAtConstant called with invalid arguments!"); return isa(InstI->getOperand(OpIdx)); } @@ -40,7 +40,7 @@ public: inline constant_iterator(const Function *F) : InstI(inst_begin(F)), OpIdx(0) { // Advance to first constant... if we are not already at constant or end if (InstI != inst_end(F) && // InstI is valid? - (InstI->getNumOperands() == 0 || !isAtConstant())) // Not at constant? + (InstI->getNumOperands() == 0 || !isAtConstant())) // Not at constant? operator++(); } @@ -49,7 +49,7 @@ public: } inline bool operator==(const _Self& x) const { return OpIdx == x.OpIdx && - InstI == x.InstI; } + InstI == x.InstI; } inline bool operator!=(const _Self& x) const { return !operator==(x); } inline pointer operator*() const { @@ -63,7 +63,7 @@ public: do { unsigned NumOperands = InstI->getNumOperands(); while (OpIdx < NumOperands && !isAtConstant()) { - ++OpIdx; + ++OpIdx; } if (OpIdx < NumOperands) return *this; // Found a constant! diff --git a/include/llvm/Analysis/IntervalIterator.h b/include/llvm/Analysis/IntervalIterator.h index 3b1c6c92978..dfa983cc309 100644 --- a/include/llvm/Analysis/IntervalIterator.h +++ b/include/llvm/Analysis/IntervalIterator.h @@ -115,8 +115,8 @@ public: inline ~IntervalIterator() { if (IOwnMem) while (!IntStack.empty()) { - delete operator*(); - IntStack.pop(); + delete operator*(); + IntStack.pop(); } } @@ -134,11 +134,11 @@ public: // All of the intervals on the stack have been visited. Try visiting // their successors now. Interval::succ_iterator &SuccIt = IntStack.top().second, - EndIt = succ_end(IntStack.top().first); + EndIt = succ_end(IntStack.top().first); while (SuccIt != EndIt) { // Loop over all interval succs - bool Done = ProcessInterval(getSourceGraphNode(OrigContainer, *SuccIt)); - ++SuccIt; // Increment iterator - if (Done) return *this; // Found a new interval! Use it! + bool Done = ProcessInterval(getSourceGraphNode(OrigContainer, *SuccIt)); + ++SuccIt; // Increment iterator + if (Done) return *this; // Found a new interval! Use it! } // Free interval memory... if necessary @@ -196,19 +196,19 @@ private: if (Visited.count(NodeHeader)) { // Node already been visited? if (Int->contains(NodeHeader)) { // Already in this interval... - return; + return; } else { // In other interval, add as successor - if (!Int->isSuccessor(NodeHeader)) // Add only if not already in set - Int->Successors.push_back(NodeHeader); + if (!Int->isSuccessor(NodeHeader)) // Add only if not already in set + Int->Successors.push_back(NodeHeader); } } else { // Otherwise, not in interval yet for (typename IGT::ChildIteratorType I = IGT::child_begin(Node), E = IGT::child_end(Node); I != E; ++I) { - if (!Int->contains(*I)) { // If pred not in interval, we can't be - if (!Int->isSuccessor(NodeHeader)) // Add only if not already in set - Int->Successors.push_back(NodeHeader); - return; // See you later - } + if (!Int->contains(*I)) { // If pred not in interval, we can't be + if (!Int->isSuccessor(NodeHeader)) // Add only if not already in set + Int->Successors.push_back(NodeHeader); + return; // See you later + } } // If we get here, then all of the predecessors of BB are in the interval @@ -217,17 +217,17 @@ private: Visited.insert(NodeHeader); // The node has now been visited! if (Int->isSuccessor(NodeHeader)) { - // If we were in the successor list from before... remove from succ list - Int->Successors.erase(std::remove(Int->Successors.begin(), - Int->Successors.end(), NodeHeader), - Int->Successors.end()); + // If we were in the successor list from before... remove from succ list + Int->Successors.erase(std::remove(Int->Successors.begin(), + Int->Successors.end(), NodeHeader), + Int->Successors.end()); } // Now that we have discovered that Node is in the interval, perhaps some // of its successors are as well? for (typename GT::ChildIteratorType It = GT::child_begin(Node), - End = GT::child_end(Node); It != End; ++It) - ProcessNode(Int, getSourceGraphNode(OrigContainer, *It)); + End = GT::child_end(Node); It != End; ++It) + ProcessNode(Int, getSourceGraphNode(OrigContainer, *It)); } } }; diff --git a/include/llvm/Analysis/Verifier.h b/include/llvm/Analysis/Verifier.h index 82e7580037d..52b1fee7178 100644 --- a/include/llvm/Analysis/Verifier.h +++ b/include/llvm/Analysis/Verifier.h @@ -37,7 +37,7 @@ enum VerifierFailureAction { AbortProcessAction, ///< verifyModule will print to stderr and abort() ThrowExceptionAction, ///< verifyModule will throw errors as std::string PrintMessageAction, ///< verifyModule will print to stderr and return true - ReturnStatusAction ///< verifyModule will just return true + ReturnStatusAction ///< verifyModule will just return true }; /// @brief Create a verifier pass. diff --git a/include/llvm/Assembly/Parser.h b/include/llvm/Assembly/Parser.h index 1950b431cf6..d2edd665e36 100644 --- a/include/llvm/Assembly/Parser.h +++ b/include/llvm/Assembly/Parser.h @@ -39,7 +39,7 @@ Module *ParseAssemblyFile(const std::string &Filename);// throw (ParseException) class ParseException { public: ParseException(const std::string &filename, const std::string &message, - int LineNo = -1, int ColNo = -1); + int LineNo = -1, int ColNo = -1); ParseException(const ParseException &E); diff --git a/include/llvm/Assembly/Writer.h b/include/llvm/Assembly/Writer.h index 7c56f92f34e..c8c09e809eb 100644 --- a/include/llvm/Assembly/Writer.h +++ b/include/llvm/Assembly/Writer.h @@ -41,7 +41,7 @@ std::ostream &WriteAsOperand(std::ostream &, const Value *, bool PrintTy = true, bool PrintName = true, const Module *Context = 0); std::ostream &WriteAsOperand(std::ostream&, const Type*, bool PrintTy = true, - bool PrintName = true, const Module* Context = 0); + bool PrintName = true, const Module* Context = 0); } // End llvm namespace diff --git a/include/llvm/Bytecode/Reader.h b/include/llvm/Bytecode/Reader.h index a28a7881742..c691ed05444 100644 --- a/include/llvm/Bytecode/Reader.h +++ b/include/llvm/Bytecode/Reader.h @@ -42,7 +42,7 @@ ModuleProvider *getBytecodeModuleProvider( ModuleProvider *getBytecodeBufferModuleProvider(const unsigned char *Buffer, unsigned BufferSize, const std::string &ModuleID="", - BytecodeHandler* H = 0); + BytecodeHandler* H = 0); /// @brief Parse the given bytecode file Module* ParseBytecodeFile(const std::string &Filename,