diff options
| author | Jeff Cohen <jeffc@jolt-lang.org> | 2005-04-23 21:38:35 +0000 |
|---|---|---|
| committer | Jeff Cohen <jeffc@jolt-lang.org> | 2005-04-23 21:38:35 +0000 |
| commit | 82639853c07c0119fdf38bed29fc4db55f893d5f (patch) | |
| tree | 7e42f4bec2b385bce91d30a93055fece1256f074 /llvm/lib/VMCore | |
| parent | 8047f13a888189189f1efde5509462b80a967bd1 (diff) | |
| download | bcm5719-llvm-82639853c07c0119fdf38bed29fc4db55f893d5f.tar.gz bcm5719-llvm-82639853c07c0119fdf38bed29fc4db55f893d5f.zip | |
Eliminate tabs and trailing spaces
llvm-svn: 21480
Diffstat (limited to 'llvm/lib/VMCore')
| -rw-r--r-- | llvm/lib/VMCore/BasicBlock.cpp | 4 | ||||
| -rw-r--r-- | llvm/lib/VMCore/Dominators.cpp | 4 |
2 files changed, 4 insertions, 4 deletions
diff --git a/llvm/lib/VMCore/BasicBlock.cpp b/llvm/lib/VMCore/BasicBlock.cpp index a9fb9247c1f..98d12d8f138 100644 --- a/llvm/lib/VMCore/BasicBlock.cpp +++ b/llvm/lib/VMCore/BasicBlock.cpp @@ -138,7 +138,7 @@ void BasicBlock::removePredecessor(BasicBlock *Pred, bool DontDeleteUselessPHIs) { assert((hasNUsesOrMore(16)||// Reduce cost of this assertion for complex CFGs. find(pred_begin(this), pred_end(this), Pred) != pred_end(this)) && - "removePredecessor: BB is not a predecessor!"); + "removePredecessor: BB is not a predecessor!"); if (InstList.empty()) return; PHINode *APN = dyn_cast<PHINode>(&front()); @@ -209,7 +209,7 @@ void BasicBlock::removePredecessor(BasicBlock *Pred, BasicBlock *BasicBlock::splitBasicBlock(iterator I, const std::string &BBName) { assert(getTerminator() && "Can't use splitBasicBlock on degenerate BB!"); assert(I != InstList.end() && - "Trying to get me to create degenerate basic block!"); + "Trying to get me to create degenerate basic block!"); BasicBlock *New = new BasicBlock(BBName, getParent(), getNext()); diff --git a/llvm/lib/VMCore/Dominators.cpp b/llvm/lib/VMCore/Dominators.cpp index 220c7d9997b..a59bd4eb065 100644 --- a/llvm/lib/VMCore/Dominators.cpp +++ b/llvm/lib/VMCore/Dominators.cpp @@ -258,7 +258,7 @@ bool DominatorSet::runOnFunction(Function &F) { Roots.clear(); Roots.push_back(Root); assert(pred_begin(Root) == pred_end(Root) && - "Root node has predecessors in function!"); + "Root node has predecessors in function!"); ImmediateDominators &ID = getAnalysis<ImmediateDominators>(); Doms.clear(); @@ -448,7 +448,7 @@ DominanceFrontier::calculate(const DominatorTree &DT, DomSetType::const_iterator CDFI = ChildDF.begin(), CDFE = ChildDF.end(); for (; CDFI != CDFE; ++CDFI) { if (!Node->dominates(DT[*CDFI])) - S.insert(*CDFI); + S.insert(*CDFI); } } |

