Main Page | Class Hierarchy | Alphabetical List | Compound List | File List | Compound Members | File Members

BigListElement.C File Reference

#include <iostream.h>
#include <fstream.h>
#include "SmallListElement.H"
#include "BigListElement.H"

Go to the source code of this file.

Defines

#define derr(s)
#define AddEntry(E, D, O, I, L, P)
#define AddEntryBeginning(E, D, O, I, L, P)

Functions

int CompareIds (SmallListElement NodeOne, SmallListElement NodeTwo)
int CompareWeights (SmallListElement NodeOne, SmallListElement NodeTwo)
int CompareHeights (SmallListElement NodeOne, SmallListElement NodeTwo)
int CompareDepths (SmallListElement NodeOne, SmallListElement NodeTwo)
int CompareValues (SmallListElement NodeOne, SmallListElement NodeTwo)
void FreeSmallVector (vector< SmallListElement >::iterator Front, vector< SmallListElement >::iterator Back)
void DestructBigVector (vector< BigListElement > *Vector)
void DestructBigList (list< BigListElement > *List)
int CopyBigVector (vector< BigListElement > *Src, vector< BigListElement > *Target)
int FindOpInList (vector< BigListElement > *V, int OpId)
vector< BigListElement
>::iterator 		FindNode (int OpId, vector< BigListElement > *V)

Define Documentation

#define AddEntry (  E,
D,
O,
I,
L,
P   ) 
 

Value:

;       { (E).SetDependencyType((D));   \
                                  (E).SetOp((O));               \
                                  (E).SetDagEntry((I));         \
                                  (L)->push_back((E));          \
                                  (P) = (L)->back(); }

Definition at line 25 of file BigListElement.C.

Referenced by BigListElement::AddPredecessor(), and BigListElement::AddSuccessor().

#define AddEntryBeginning (  E,
D,
O,
I,
L,
P   ) 
 

Value:

;       { (E).SetDependencyType((D));   \
                                  (E).SetOp((O));               \
                                  (E).SetDagEntry((I));         \
                                  (L)->insert((L)->begin(),(E));                \
                                  (P) = (L)->back(); }

Definition at line 31 of file BigListElement.C.

Referenced by BigListElement::AddPredecessorBeginning().

#define derr (  s   ) 
 

Definition at line 22 of file BigListElement.C.

Function Documentation

int CompareDepths (  SmallListElement  NodeOne,
SmallListElement  NodeTwo
)  [static]
 

Definition at line 283 of file BigListElement.C.

References SmallListElement::GetDagEntry(), and DagNode::GetDepth().

Referenced by BigListElement::SortPredecessorsByDepth(), and BigListElement::SortSuccessorsByDepth().

int CompareHeights (  SmallListElement  NodeOne,
SmallListElement  NodeTwo
)  [static]
 

Definition at line 275 of file BigListElement.C.

References SmallListElement::GetDagEntry(), and DagNode::GetHeight().

Referenced by BigListElement::SortPredecessorsByHeight(), and BigListElement::SortSuccessorsByHeight().

int CompareIds (  SmallListElement  NodeOne,
SmallListElement  NodeTwo
)  [static]
 

Definition at line 240 of file BigListElement.C.

References derr, SmallListElement::GetDagEntry(), DagNode::GetOp(), SmallListNode::GetOp(), and legoOp::GetOpId().

Referenced by BigListElement::SortPredecessorsByOpId(), and BigListElement::SortSuccessorsByOpId().

int CompareValues (  SmallListElement  NodeOne,
SmallListElement  NodeTwo
)  [static]
 

Definition at line 291 of file BigListElement.C.

References SmallListElement::GetDagEntry(), and BigListElement::Value.

Referenced by BigListElement::SortPredecessorsByValue(), and BigListElement::SortSuccessorsByValue().

int CompareWeights (  SmallListElement  NodeOne,
SmallListElement  NodeTwo
)  [static]
 

Definition at line 267 of file BigListElement.C.

References SmallListElement::GetDagEntry(), and DagNode::GetWeight().

Referenced by BigListElement::SortPredecessorsByWeight(), and BigListElement::SortSuccessorsByWeight().

int CopyBigVector (  vector< BigListElement > *  Src,
vector< BigListElement > *  Target
) 
 

Definition at line 711 of file BigListElement.C.

References Back, and Front.

Referenced by dag::CopyGraph().

void DestructBigList (  list< BigListElement > *  List  ) 
 

Definition at line 702 of file BigListElement.C.

Referenced by dag::ConstructDag(), and dag::DeleteGraphNodes().

void DestructBigVector (  vector< BigListElement > *  Vector  ) 
 

Definition at line 693 of file BigListElement.C.

Referenced by dag::DeleteGraphNodes().

vector< BigListElement >::iterator FindNode (  int  OpId,
vector< BigListElement > *  V
) 
 

Definition at line 743 of file BigListElement.C.

References Back, and Front.

Referenced by dag::ListIntegrity(), and op_scheduler::ScheduleBlock().

int FindOpInList (  vector< BigListElement > *  V,
int  OpId
) 
 

Definition at line 727 of file BigListElement.C.

References i, and size.

Referenced by dag::SetVectorPtrs().

void FreeSmallVector (  vector< SmallListElement >::iterator  Front,
vector< SmallListElement >::iterator  Back
) 
 

Definition at line 431 of file BigListElement.C.

Generated on Mon Jul 21 20:29:38 2003 for TINKER LEGO DOC by doxygen 1.3.2