diff options
| author | Misha Brukman <brukman+llvm@gmail.com> | 2005-04-21 23:30:14 +0000 |
|---|---|---|
| committer | Misha Brukman <brukman+llvm@gmail.com> | 2005-04-21 23:30:14 +0000 |
| commit | b5f662fa0314f7e7e690aae8ebff7136cc3a5ab0 (patch) | |
| tree | e7c0cbff032351446ce38058e84f6f6f9fd2300d /lib/Target/SparcV9/RegAlloc/IGNode.cpp | |
| parent | 4633f1cde84b1dbb05dfbdce17ca6b483596cee7 (diff) | |
Remove trailing whitespace
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@21425 91177308-0d34-0410-b5e6-96231b3b80d8
Diffstat (limited to 'lib/Target/SparcV9/RegAlloc/IGNode.cpp')
| -rw-r--r-- | lib/Target/SparcV9/RegAlloc/IGNode.cpp | 14 |
1 files changed, 7 insertions, 7 deletions
diff --git a/lib/Target/SparcV9/RegAlloc/IGNode.cpp b/lib/Target/SparcV9/RegAlloc/IGNode.cpp index a76fdeaa03..5b67fa34cf 100644 --- a/lib/Target/SparcV9/RegAlloc/IGNode.cpp +++ b/lib/Target/SparcV9/RegAlloc/IGNode.cpp @@ -1,15 +1,15 @@ //===-- IGNode.cpp --------------------------------------------------------===// -// +// // The LLVM Compiler Infrastructure // // This file was developed by the LLVM research group and is distributed under // the University of Illinois Open Source License. See LICENSE.TXT for details. -// +// //===----------------------------------------------------------------------===// -// +// // This file implements an Interference graph node for coloring-based register // allocation. -// +// //===----------------------------------------------------------------------===// #include "IGNode.h" @@ -19,11 +19,11 @@ namespace llvm { //----------------------------------------------------------------------------- -// Sets this IGNode on stack and reduce the degree of neighbors +// Sets this IGNode on stack and reduce the degree of neighbors //----------------------------------------------------------------------------- void IGNode::pushOnStack() { - OnStack = true; + OnStack = true; int neighs = AdjList.size(); if (neighs < 0) { @@ -34,7 +34,7 @@ void IGNode::pushOnStack() { for (int i=0; i < neighs; i++) AdjList[i]->decCurDegree(); } - + //----------------------------------------------------------------------------- // Deletes an adjacency node. IGNodes are deleted when coalescing merges // two IGNodes together. |