blob: c8fca7a23b6d380645299d6d0fa8a47324b0c186 [file] [log] [blame]
Vikram S. Adve39c94e12002-09-14 23:05:33 +00001//===-- IGNode.cpp -------------------------------------------------------===//
2//
3// class IGNode for coloring-based register allocation for LLVM.
4//
5//===----------------------------------------------------------------------===//
6
Ruchira Sasanka8e604792001-09-14 21:18:34 +00007#include "llvm/CodeGen/IGNode.h"
Chris Lattner697954c2002-01-20 22:54:45 +00008#include <algorithm>
9#include <iostream>
10using std::cerr;
Ruchira Sasanka8e604792001-09-14 21:18:34 +000011
Ruchira Sasanka4f3eb222002-01-07 19:19:18 +000012//-----------------------------------------------------------------------------
Ruchira Sasanka4f3eb222002-01-07 19:19:18 +000013// Sets this IGNode on stack and reduce the degree of neighbors
14//-----------------------------------------------------------------------------
Chris Lattner748697d2002-02-05 04:20:12 +000015
16void IGNode::pushOnStack() {
Ruchira Sasanka8e604792001-09-14 21:18:34 +000017 OnStack = true;
Ruchira Sasankaa9e45c82001-11-03 22:01:09 +000018 int neighs = AdjList.size();
Ruchira Sasanka8e604792001-09-14 21:18:34 +000019
Chris Lattner748697d2002-02-05 04:20:12 +000020 if (neighs < 0) {
Chris Lattner697954c2002-01-20 22:54:45 +000021 cerr << "\nAdj List size = " << neighs;
Ruchira Sasankaa9e45c82001-11-03 22:01:09 +000022 assert(0 && "Invalid adj list size");
23 }
24
Chris Lattner697954c2002-01-20 22:54:45 +000025 for(int i=0; i < neighs; i++)
26 AdjList[i]->decCurDegree();
Ruchira Sasanka8e604792001-09-14 21:18:34 +000027}
28
Ruchira Sasanka4f3eb222002-01-07 19:19:18 +000029//-----------------------------------------------------------------------------
30// Deletes an adjacency node. IGNodes are deleted when coalescing merges
31// two IGNodes together.
32//-----------------------------------------------------------------------------
Chris Lattner748697d2002-02-05 04:20:12 +000033
34void IGNode::delAdjIGNode(const IGNode *Node) {
35 std::vector<IGNode *>::iterator It=find(AdjList.begin(), AdjList.end(), Node);
Ruchira Sasanka8e604792001-09-14 21:18:34 +000036 assert( It != AdjList.end() ); // the node must be there
Chris Lattner697954c2002-01-20 22:54:45 +000037 AdjList.erase(It);
Ruchira Sasanka8e604792001-09-14 21:18:34 +000038}