Standardize the names of include guards.

Fix typos in file header comment.


git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@8643 91177308-0d34-0410-b5e6-96231b3b80d8
This commit is contained in:
Brian Gaeke 2003-09-21 02:31:15 +00:00
parent 43ce8fe477
commit 6264fb70c1
2 changed files with 10 additions and 12 deletions

View File

@ -9,21 +9,20 @@
The removal of nodes from IG is simulated by decrementing the CurDegree.
If this node is put on stack (that is removed from IG), the CurDegree of all
the neighbors are decremented and this node is marked OnSack. Hence
the neighbors are decremented and this node is marked OnStack. Hence
the effective neighbors in the AdjList are the ones that do not have the
OnStack flag set (therefore, they are in the IG).
The methods that modify/use the CurDegree Must be called only
The methods that modify/use the CurDegree must be called only
after all modifications to the IG are over (i.e., all neighbors are fixed).
The vector representation is the most efficient one for adj list.
Though nodes are removed when coalsing is done, we access it in sequence
Though nodes are removed when coalescing is done, we access it in sequence
for far many times when coloring (colorNode()).
*/
#ifndef IG_NODE_H
#define IG_NODE_H
#ifndef IGNODE_H
#define IGNODE_H
#include "LiveRange.h"
class RegClass;

View File

@ -9,21 +9,20 @@
The removal of nodes from IG is simulated by decrementing the CurDegree.
If this node is put on stack (that is removed from IG), the CurDegree of all
the neighbors are decremented and this node is marked OnSack. Hence
the neighbors are decremented and this node is marked OnStack. Hence
the effective neighbors in the AdjList are the ones that do not have the
OnStack flag set (therefore, they are in the IG).
The methods that modify/use the CurDegree Must be called only
The methods that modify/use the CurDegree must be called only
after all modifications to the IG are over (i.e., all neighbors are fixed).
The vector representation is the most efficient one for adj list.
Though nodes are removed when coalsing is done, we access it in sequence
Though nodes are removed when coalescing is done, we access it in sequence
for far many times when coloring (colorNode()).
*/
#ifndef IG_NODE_H
#define IG_NODE_H
#ifndef IGNODE_H
#define IGNODE_H
#include "LiveRange.h"
class RegClass;