DataDependenceGraph Member List

This is the complete list of members for DataDependenceGraph, including all inherited members.

addNode(MoveNode &moveNode)	DataDependenceGraph	virtual
addNode(MoveNode &moveNode, MoveNode &relatedNode)	DataDependenceGraph
addNode(MoveNode &moveNode, BasicBlockNode &bblock)	DataDependenceGraph
addProgramOperation(ProgramOperationPtr po)	DataDependenceGraph
ALL_ANTIDEPS enum value	DataDependenceGraph
allowLoopEdges_	BoostGraph< MoveNode, DataDependenceEdge >	protected
allParamRegs_	DataDependenceGraph	private
AntidependenceLevel enum name	DataDependenceGraph
BoostGraph(bool allowLoopEdges=true)	BoostGraph< MoveNode, DataDependenceEdge >
BoostGraph(const TCEString &name, bool allowLoopEdges=true)	BoostGraph< MoveNode, DataDependenceEdge >
BoostGraph(const BoostGraph &other, bool allowLoopEdges=true)	BoostGraph< MoveNode, DataDependenceEdge >
calculatePathLengths() const	BoostGraph< MoveNode, DataDependenceEdge >	protected
calculatePathLengthsFast() const	BoostGraph< MoveNode, DataDependenceEdge >	protected
calculatePathLengthsOnConnect(const MoveNode &nTail, const MoveNode &nHead, DataDependenceEdge &e)	BoostGraph< MoveNode, DataDependenceEdge >	protected
calculateSinkDistance(const MoveNode &node, int len, bool looping=false) const	BoostGraph< MoveNode, DataDependenceEdge >	protected
calculateSourceDistances(const MoveNode *startNode=NULL, int startingLength=0, bool looping=false) const	BoostGraph< MoveNode, DataDependenceEdge >	protected
childGraphs_	BoostGraph< MoveNode, DataDependenceEdge >	protected
clearDescriptorCache(EdgeSet edges)	BoostGraph< MoveNode, DataDependenceEdge >	protected
combineNodes(MoveNode &node1, MoveNode &node2, MoveNode &destination)	DataDependenceGraph
connectingEdge(const Node &nTail, const Node &nHead) const	BoostGraph< MoveNode, DataDependenceEdge >	protected
connectingEdges(const Node &nTail, const Node &nHead) const	BoostGraph< MoveNode, DataDependenceEdge >	virtual
connectNodes(const Node &nTail, const Node &nHead, Edge &e)	BoostGraph< MoveNode, DataDependenceEdge >	virtual
connectNodes(const Node &nTail, const Node &nHead, Edge &e, GraphBase< MoveNode, DataDependenceEdge > *modifier, bool creatingSG=false)	BoostGraph< MoveNode, DataDependenceEdge >	protectedvirtual
connectOrDeleteEdge(const MoveNode &tailNode, const MoveNode &headNode, DataDependenceEdge *edge)	DataDependenceGraph
constructSubGraph(BoostGraph &subGraph, NodeSet &nodes)	BoostGraph< MoveNode, DataDependenceEdge >	protected
copyDependencies(const MoveNode &src, MoveNode &dst, bool ignoreSameBBBackedges, bool moveOverLoopEdge=true)	DataDependenceGraph
copyDepsOver(MoveNode &node, bool anti, bool raw)	DataDependenceGraph
copyDepsOver(MoveNode &node1, MoveNode &node2, bool anti, bool raw)	DataDependenceGraph
copyExternalInEdges(MoveNode &nodeCopy, const MoveNode &source)	DataDependenceGraph
copyExternalOutEdges(MoveNode &nodeCopy, const MoveNode &source)	DataDependenceGraph
copyIncomingGuardEdges(const MoveNode &src, MoveNode &dst)	DataDependenceGraph
copyIncomingRawEdges(const MoveNode &src, MoveNode &dst)	DataDependenceGraph
copyInEdge(const Node &destination, Edge &edge, const Node *tail=NULL)	BoostGraph< MoveNode, DataDependenceEdge >	virtual
copyOutEdge(const Node &destination, Edge &edge, const Node *head=NULL)	BoostGraph< MoveNode, DataDependenceEdge >	virtual
copyOutgoingGuardWarEdges(const MoveNode &src, MoveNode &dst)	DataDependenceGraph
createRegisterAntiDependenciesBetweenNodes(NodeSet &nodes)	DataDependenceGraph
createSubgraph(NodeSet &nodes, bool includeLoops=false)	DataDependenceGraph
createSubgraph(TTAProgram::CodeSnippet &cs, bool includeLoops=false)	DataDependenceGraph
createSubgraph(std::list< TTAProgram::CodeSnippet * > &codeSnippets, bool includeLoops=false)	DataDependenceGraph
criticalPathGraph()	DataDependenceGraph
cycleGrouping_	DataDependenceGraph	private
DataDependenceGraph(std::set< TCEString > allParamRegs, const TCEString &name="", AntidependenceLevel antidependenceLevel=ALL_ANTIDEPS, BasicBlockNode *ownedBBN=NULL, bool containsProcedure=false, bool noLoopEdges=false)	DataDependenceGraph
delaySlots_	DataDependenceGraph	private
deleteNode(MoveNode &node)	DataDependenceGraph
descriptor(const Edge &e) const	BoostGraph< MoveNode, DataDependenceEdge >	protected
descriptor(const Node &n) const	BoostGraph< MoveNode, DataDependenceEdge >	protected
destRenamed(MoveNode &mn)	DataDependenceGraph
detachSubgraph(BoostGraph &subGraph)	BoostGraph< MoveNode, DataDependenceEdge >
detectIllegalCycles() const	BoostGraph< MoveNode, DataDependenceEdge >
disconnectNodes(const Node &nTail, const Node &nHead)	BoostGraph< MoveNode, DataDependenceEdge >	virtual
dotProgramOperationNodes_	DataDependenceGraph	private
dotString() const	DataDependenceGraph	virtual
BoostGraph< MoveNode, DataDependenceEdge >::dotString() const	GraphBase< MoveNode, DataDependenceEdge >	virtual
dropBackEdges()	DataDependenceGraph
dropEdge(Edge &edge)	BoostGraph< MoveNode, DataDependenceEdge >	virtual
dropNode(Node &node)	BoostGraph< MoveNode, DataDependenceEdge >	virtual
dropProgramOperation(ProgramOperationPtr po)	DataDependenceGraph
DUMP_DOT enum value	DataDependenceGraph
DUMP_XML enum value	DataDependenceGraph
DumpFileFormat enum name	DataDependenceGraph
earliestCycle(const MoveNode &moveNode, unsigned int ii=UINT_MAX, bool ignoreRegWaRs=false, bool ignoreRegWaWs=false, bool ignoreGuards=false, bool ignoreFUDeps=false, bool ignoreSameOperationEdges=false, bool assumeBypassing=false) const	DataDependenceGraph
Edge typedef	BoostGraph< MoveNode, DataDependenceEdge >
edge(const int index) const	BoostGraph< MoveNode, DataDependenceEdge >	virtual
edgeCount() const	BoostGraph< MoveNode, DataDependenceEdge >	virtual
EdgeDescMap typedef	BoostGraph< MoveNode, DataDependenceEdge >	protected
EdgeDescriptor typedef	BoostGraph< MoveNode, DataDependenceEdge >	protected
edgeDescriptor(const NodeDescriptor &tailNode, const Edge &e) const	BoostGraph< MoveNode, DataDependenceEdge >	protected
edgeDescriptor(const Edge &e, const NodeDescriptor &headNode) const	BoostGraph< MoveNode, DataDependenceEdge >	protected
edgeDescriptors_	BoostGraph< MoveNode, DataDependenceEdge >	mutableprotected
EdgeIter typedef	BoostGraph< MoveNode, DataDependenceEdge >	protected
edgeLatency(const DataDependenceEdge &edge, int ii, const MoveNode *tail, const MoveNode *head) const	DataDependenceGraph
EdgeSet typedef	BoostGraph< MoveNode, DataDependenceEdge >
edgeWeight(DataDependenceEdge &e, const MoveNode &hNode) const	DataDependenceGraph	virtual
EdgeWeightHeuristics enum name	DataDependenceGraph
edgeWeightHeuristics_	DataDependenceGraph	private
EWH_DEFAULT enum value	DataDependenceGraph
EWH_HEURISTIC enum value	DataDependenceGraph
EWH_REAL enum value	DataDependenceGraph
exclusingGuards(const MoveNode &mn1, const MoveNode &mn2) const	DataDependenceGraph
findAllPaths() const	BoostGraph< MoveNode, DataDependenceEdge >
findBypassSource(const MoveNode &mn)	DataDependenceGraph
findLimitingAntidependenceDestination(MoveNode &mn)	DataDependenceGraph
findLimitingAntidependenceSource(MoveNode &mn)	DataDependenceGraph
findLiveRange(MoveNode &lrNode, bool writingNode, bool guardUseNode) const	DataDependenceGraph
findLoopIndexInit(MoveNode &updateMove)	DataDependenceGraph
findLoopIndexUpdate(MoveNode *indexMove)	DataDependenceGraph
findLoopLimitAndIndex(MoveNode &jumpMove)	DataDependenceGraph
firstRegisterCycle(const TTAMachine::BaseRegisterFile &rf, int registerIndex) const	DataDependenceGraph
firstScheduledRegisterKill(const TTAMachine::BaseRegisterFile &rf, int registerIndex) const	DataDependenceGraph
firstScheduledRegisterRead(const TTAMachine::BaseRegisterFile &rf, int registerIndex, int firstCycleToTest=0) const	DataDependenceGraph
firstScheduledRegisterReads(const TTAMachine::BaseRegisterFile &rf, int registerIndex) const	DataDependenceGraph
firstScheduledRegisterWrite(const TTAMachine::BaseRegisterFile &rf, int registerIndex) const	DataDependenceGraph
firstScheduledRegisterWrites(const TTAMachine::BaseRegisterFile &rf, int registerIndex) const	DataDependenceGraph
fixAntidepsAfterLoopUnmergeUser(MoveNode &sourceNode, MoveNode &mergedNode, const TCEString &reg)	DataDependenceGraph
fixInterBBAntiEdges(BasicBlockNode &bbn1, BasicBlockNode &bbn2, bool loopEdges)	DataDependenceGraph
getBasicBlockNode(const MoveNode &mn) const	DataDependenceGraph
getBasicBlockNode(MoveNode &mn)	DataDependenceGraph
getOperationLatency(const TCEString &name) const	DataDependenceGraph	private
Graph typedef	BoostGraph< MoveNode, DataDependenceEdge >	protected
graph_	BoostGraph< MoveNode, DataDependenceEdge >	protected
GraphBase()	GraphBase< MoveNode, DataDependenceEdge >	inline
GraphTraits typedef	BoostGraph< MoveNode, DataDependenceEdge >	protected
guardConverted(MoveNode &guardSrc, MoveNode &dst)	DataDependenceGraph
guardDefMoves(const MoveNode &moveNode)	DataDependenceGraph
guardRawPredecessors(const MoveNode &node) const	DataDependenceGraph
guardRenamed(MoveNode &mn)	DataDependenceGraph
guardRestored(MoveNode &guardSrc, MoveNode &dst)	DataDependenceGraph
guardsAllowBypass(const MoveNode &defNode, const MoveNode &useNode, bool loopBypass=false)	DataDependenceGraph
hasAllRegisterAntidependencies()	DataDependenceGraph	inline
hasEdge(const Node &nTail, const Node &nHead) const	BoostGraph< MoveNode, DataDependenceEdge >	virtual
hasEdge(const Node &nTail, const Node &nHead, const Edge &edge) const	BoostGraph< MoveNode, DataDependenceEdge >	protected
hasEdge(const Edge &edge, const Node *nTail=NULL, const Node *nHead=NULL) const	BoostGraph< MoveNode, DataDependenceEdge >	protected
hasEqualEdge(const MoveNode &tailNode, const MoveNode &headNode, const DataDependenceEdge &edge) const	DataDependenceGraph	private
hasIntraBBRegisterAntidependencies()	DataDependenceGraph	inline
hasNode(const Node &) const	BoostGraph< MoveNode, DataDependenceEdge >	virtual
hasOtherRegWawSources(const MoveNode &mn) const	DataDependenceGraph
hasPath(MoveNode &src, const MoveNode &dest) const	BoostGraph< MoveNode, DataDependenceEdge >
hasRegWaw(const MoveNodeUse &mnu, std::set< MoveNodeUse > targets) const	DataDependenceGraph
hasSingleBBLoopRegisterAntidependencies()	DataDependenceGraph	inline
hasUnscheduledPredecessors(const MoveNode &mn) const	DataDependenceGraph
hasUnscheduledSuccessors(const MoveNode &mn) const	DataDependenceGraph
headNode(const Edge &edge) const	BoostGraph< MoveNode, DataDependenceEdge >	virtual
headNode(const Edge &edge, const NodeDescriptor &tailNode) const	BoostGraph< MoveNode, DataDependenceEdge >	protected
height() const	BoostGraph< MoveNode, DataDependenceEdge >
height_	BoostGraph< MoveNode, DataDependenceEdge >	mutableprotected
inDegree(const Node &node) const	BoostGraph< MoveNode, DataDependenceEdge >	virtual
inEdge(const Node &node, const int index) const	BoostGraph< MoveNode, DataDependenceEdge >	virtual
InEdgeIter typedef	BoostGraph< MoveNode, DataDependenceEdge >	protected
inEdges(const Node &node) const	BoostGraph< MoveNode, DataDependenceEdge >	virtual
INTRA_BB_ANTIDEPS enum value	DataDependenceGraph
isInCriticalPath(const MoveNode &node) const	BoostGraph< MoveNode, DataDependenceEdge >	inline
isLoopBypass(MoveNode &sourceNode, MoveNode &userNode)	DataDependenceGraph
isLoopInvariant(const MoveNode &mn) const	DataDependenceGraph
isNotAvoidable(const DataDependenceEdge &edge) const	DataDependenceGraph
isRootGraphProcedureDDG()	DataDependenceGraph	private
largestCycle() const	DataDependenceGraph
lastGuardDefMove(MoveNode &moveNode)	DataDependenceGraph
lastRegisterCycle(const TTAMachine::BaseRegisterFile &rf, int registerIndex) const	DataDependenceGraph
lastScheduledRegisterGuardReads(const TTAMachine::BaseRegisterFile &rf, int registerIndex) const	DataDependenceGraph
lastScheduledRegisterKill(const TTAMachine::BaseRegisterFile &rf, int registerIndex) const	DataDependenceGraph
lastScheduledRegisterRead(const TTAMachine::BaseRegisterFile &rf, int registerIndex, int lastCycleToTest=INT_MAX) const	DataDependenceGraph
lastScheduledRegisterReads(const TTAMachine::BaseRegisterFile &rf, int registerIndex) const	DataDependenceGraph
lastScheduledRegisterWrites(const TTAMachine::BaseRegisterFile &rf, int registerIndex) const	DataDependenceGraph
latestCycle(const MoveNode &moveNode, unsigned int ii=UINT_MAX, bool ignoreRegAntideps=false, bool ignoreUnscheduledSuccessors=true, bool ignoreGuards=false, bool ignoreFUDeps=false, bool ignoreSameOperationEdges=false) const	DataDependenceGraph
loopingSinkDistances_	BoostGraph< MoveNode, DataDependenceEdge >	mutableprotected
loopingSourceDistances_	BoostGraph< MoveNode, DataDependenceEdge >	mutableprotected
machine() const	DataDependenceGraph	inline
machine_	DataDependenceGraph	private
maxPathLength(const MoveNode &node) const	BoostGraph< MoveNode, DataDependenceEdge >
maxSinkDistance(const MoveNode &node) const	BoostGraph< MoveNode, DataDependenceEdge >
maxSourceDistance(const MoveNode &node) const	BoostGraph< MoveNode, DataDependenceEdge >
memoryDependenceGraph()	DataDependenceGraph
mergeAndKeepAllowed(MoveNode &sourceNode, MoveNode &userNode)	DataDependenceGraph
mergeAndKeepSource(MoveNode &resultNode, MoveNode &userNode, bool force=false)	DataDependenceGraph
mergeAndKeepUser(MoveNode &resultNode, MoveNode &userNode, bool force=false)	DataDependenceGraph
moveFUDependenciesToTrigger(MoveNode &trigger)	DataDependenceGraph
moveInEdge(const Node &source, const Node &destination, Edge &edge, const Node *tail=NULL, bool childs=false)	BoostGraph< MoveNode, DataDependenceEdge >	virtual
moveInEdges(const Node &source, const Node &destination)	BoostGraph< MoveNode, DataDependenceEdge >	virtual
moveInEdges(const Node &source, const Node &destination, BoostGraph *modifierGraph)	BoostGraph< MoveNode, DataDependenceEdge >	protected
moveNodeBlocks_	DataDependenceGraph	private
moveOutEdge(const Node &source, const Node &destination, Edge &edge, const Node *head=NULL, bool childs=false)	BoostGraph< MoveNode, DataDependenceEdge >	virtual
moveOutEdges(const Node &source, const Node &destination)	BoostGraph< MoveNode, DataDependenceEdge >	virtual
moveOutEdges(const Node &source, const Node &destination, BoostGraph *modifierGraph)	BoostGraph< MoveNode, DataDependenceEdge >	protectedvirtual
movesAtCycle(int cycle) const	DataDependenceGraph
name() const	BoostGraph< MoveNode, DataDependenceEdge >	virtual
name_	BoostGraph< MoveNode, DataDependenceEdge >	protected
NO_ANTIDEPS enum value	DataDependenceGraph
Node typedef	BoostGraph< MoveNode, DataDependenceEdge >
node(const int index) const	BoostGraph< MoveNode, DataDependenceEdge >	virtual
node(const int index, bool cacheResult) const	BoostGraph< MoveNode, DataDependenceEdge >
nodeCount() const	BoostGraph< MoveNode, DataDependenceEdge >	virtual
NodeDescMap typedef	BoostGraph< MoveNode, DataDependenceEdge >	protected
NodeDescriptor typedef	BoostGraph< MoveNode, DataDependenceEdge >	protected
nodeDescriptors_	BoostGraph< MoveNode, DataDependenceEdge >	mutableprotected
NodeIter typedef	BoostGraph< MoveNode, DataDependenceEdge >	protected
nodeOfMove(const TTAProgram::Move &move)	DataDependenceGraph
NodeSet typedef	BoostGraph< MoveNode, DataDependenceEdge >
nodesOfMoves_	DataDependenceGraph	private
onlyGuardDefOfMove(MoveNode &moveNode)	DataDependenceGraph
onlyIncomingGuard(const MoveNode &mn) const	DataDependenceGraph
onlyRegisterEdgeIn(MoveNode &mn) const	DataDependenceGraph
onlyRegisterEdgeOut(MoveNode &mn) const	DataDependenceGraph
onlyRegisterRawAncestor(const MoveNode &node, const std::string &sp) const	DataDependenceGraph
onlyRegisterRawDestinations(const MoveNode &mn, bool allowGuardEdges=false, bool allowBackEdges=false) const	DataDependenceGraph
onlyRegisterRawDestinationsWithEdges(const MoveNode &mn, bool allowBackEdges) const	DataDependenceGraph
onlyRegisterRawSource(const MoveNode &mn, int allowGuardEdges=2, int backEdges=0) const	DataDependenceGraph
operationInEdges(const MoveNode &node) const	DataDependenceGraph
operationLatencies_	DataDependenceGraph	private
operator=(const BoostGraph &)	BoostGraph< MoveNode, DataDependenceEdge >	private
otherSuccessorsScheduled(MoveNode &node, const NodeSet &ignoredNodes) const	DataDependenceGraph
outDegree(const Node &node) const	BoostGraph< MoveNode, DataDependenceEdge >	virtual
outEdge(const Node &node, const int index) const	BoostGraph< MoveNode, DataDependenceEdge >	virtual
OutEdgeIter typedef	BoostGraph< MoveNode, DataDependenceEdge >	protected
outEdges(const Node &node) const	BoostGraph< MoveNode, DataDependenceEdge >	virtual
ownedBBN_	DataDependenceGraph	private
ownedEdges_	BoostGraph< MoveNode, DataDependenceEdge >	protected
parentGraph()	BoostGraph< MoveNode, DataDependenceEdge >
parentGraph_	BoostGraph< MoveNode, DataDependenceEdge >	protected
PathCache typedef	BoostGraph< MoveNode, DataDependenceEdge >	protected
pathCache_	BoostGraph< MoveNode, DataDependenceEdge >	mutableprotected
predecessors(const Node &node, bool ignoreBackEdges=false, bool ignoreForwardEdges=false) const	BoostGraph< MoveNode, DataDependenceEdge >	virtual
predecessorsReady(MoveNode &node) const	DataDependenceGraph
procedureDDG_	DataDependenceGraph	private
programOperation(int index)	DataDependenceGraph
programOperation(int index) const	DataDependenceGraph
programOperationCount() const	DataDependenceGraph
programOperationPtr(int index)	DataDependenceGraph
programOperations_	DataDependenceGraph	private
queueRawPredecessors(NodeSet &queue, NodeSet &finalDest, NodeSet &predQueue, NodeSet &predFinalDest, bool guard) const	DataDependenceGraph	private
rAntiEdgesIn(MoveNode &mn)	DataDependenceGraph	private
regDepSiblings(const MoveNode &mn) const	DataDependenceGraph
registerAndRAInEdges(const MoveNode &node) const	DataDependenceGraph
registerAntidependenceLevel_	DataDependenceGraph	private
regRawPredecessors(const MoveNode &node, int backedges=0) const	DataDependenceGraph
regRawSuccessorCount(const MoveNode &mn, bool onlyScheduled)	DataDependenceGraph
regRawSuccessors(const MoveNode &node) const	DataDependenceGraph
regWarSuccessors(const MoveNode &node) const	DataDependenceGraph
regWawSuccessors(const MoveNode &node) const	DataDependenceGraph
RemovedEdgeMap typedef	BoostGraph< MoveNode, DataDependenceEdge >	protected
removeEdge(Edge &e)	BoostGraph< MoveNode, DataDependenceEdge >	virtual
removeEdge(Edge &e, const MoveNode *tailNode, const MoveNode *headNode, BoostGraph *modifierGraph=NULL)	BoostGraph< MoveNode, DataDependenceEdge >	protectedvirtual
removeIncomingGuardEdges(MoveNode &node)	DataDependenceGraph
removeNode(MoveNode &node)	DataDependenceGraph	virtual
BoostGraph< MoveNode, DataDependenceEdge >::removeNode(Node &node, BoostGraph *modifierGraph)	BoostGraph< MoveNode, DataDependenceEdge >	protectedvirtual
removeOutgoingGuardWarEdges(MoveNode &node)	DataDependenceGraph
removeRAWEdges(MoveNode &sourceNode, MoveNode &userNode)	DataDependenceGraph
renamedSimpleLiveRange(MoveNode &src, MoveNode &dest, MoveNode &antidepPoint, DataDependenceEdge &lrEdge, const TCEString &oldReg, const TCEString &newReg)	DataDependenceGraph
replaceNodeWithLastNode(MoveNode &dest)	BoostGraph< MoveNode, DataDependenceEdge >	protected
restoreNodeFromParent(MoveNode &node)	BoostGraph< MoveNode, DataDependenceEdge >
restoreRemovedEdges(RemovedEdgeMap removedEdges)	BoostGraph< MoveNode, DataDependenceEdge >	protected
resultUsed(MoveNode &resultNode)	DataDependenceGraph
resultUsed(MoveNode &resultNode, MoveNode *regCopy)	DataDependenceGraph
rootGraph()	BoostGraph< MoveNode, DataDependenceEdge >
rootGraph() const	BoostGraph< MoveNode, DataDependenceEdge >
rootGraphInDegree(const Node &node) const	BoostGraph< MoveNode, DataDependenceEdge >	virtual
rootGraphInEdge(const Node &node, const int index) const	BoostGraph< MoveNode, DataDependenceEdge >	virtual
rootGraphInEdges(const Node &node) const	BoostGraph< MoveNode, DataDependenceEdge >	virtual
rootGraphOutDegree(const Node &node) const	BoostGraph< MoveNode, DataDependenceEdge >	virtual
rootGraphOutEdge(const Node &node, const int index) const	BoostGraph< MoveNode, DataDependenceEdge >	virtual
rootGraphOutEdges(const Node &node) const	BoostGraph< MoveNode, DataDependenceEdge >	virtual
rootNodes() const	BoostGraph< MoveNode, DataDependenceEdge >	virtual
rrCost_	DataDependenceGraph	private
rWarEdgesOut(MoveNode &mn)	DataDependenceGraph
rWawRawEdgesOutUncond(MoveNode &mn)	DataDependenceGraph	private
sameGuards(const MoveNode &mn1, const MoveNode &mn2) const	DataDependenceGraph
sanityCheck() const	DataDependenceGraph
scheduledMoves() const	DataDependenceGraph
scheduledNodeCount() const	DataDependenceGraph
setBasicBlockNode(const MoveNode &mn, BasicBlockNode &bbn)	DataDependenceGraph
setCycleGrouping(bool flag)	DataDependenceGraph	virtual
setEdgeWeightHeuristics(EdgeWeightHeuristics ewh)	DataDependenceGraph
setMachine(const TTAMachine::Machine &machine)	DataDependenceGraph
setName(const TCEString &newName)	BoostGraph< MoveNode, DataDependenceEdge >	inline
setNodeBB(MoveNode &mn, BasicBlockNode &bblock, DataDependenceGraph *updater)	DataDependenceGraph
setProgramOperationNodes(bool flag)	DataDependenceGraph	inlinevirtual
sgCounter_	BoostGraph< MoveNode, DataDependenceEdge >	protected
SINGLE_BB_LOOP_ANTIDEPS enum value	DataDependenceGraph
sinkDistances_	BoostGraph< MoveNode, DataDependenceEdge >	mutableprotected
sinkDistDecreased(const MoveNode &n) const	BoostGraph< MoveNode, DataDependenceEdge >	protected
sinkNodes() const	BoostGraph< MoveNode, DataDependenceEdge >	virtual
smallestCycle() const	DataDependenceGraph
sourceDistances_	BoostGraph< MoveNode, DataDependenceEdge >	mutableprotected
sourceDistDecreased(const MoveNode &n) const	BoostGraph< MoveNode, DataDependenceEdge >	protected
sourceRenamed(MoveNode &mn)	DataDependenceGraph
successors(const Node &node, bool ignoreBackEdges=false, bool ignoreForwardEdges=false) const	BoostGraph< MoveNode, DataDependenceEdge >	virtual
successorsReady(MoveNode &node) const	DataDependenceGraph
tailNode(const Edge &edge) const	BoostGraph< MoveNode, DataDependenceEdge >	virtual
tailNode(const Edge &edge, const NodeDescriptor &headNode) const	BoostGraph< MoveNode, DataDependenceEdge >	protected
trueDependenceGraph(bool removeMemAntideps=true, bool ignoreMemDeps=false)	DataDependenceGraph
undo(UndoData &undoData)	DataDependenceGraph
unMergeUser(MoveNode &resultNode, MoveNode &mergedNode, bool loopBypass=false)	DataDependenceGraph
unscheduledMoves() const	DataDependenceGraph
updateRegUse(const MoveNodeUse &mnd, const TCEString &reg, TTAProgram::BasicBlock &bb)	DataDependenceGraph
updateRegWrite(const MoveNodeUse &mnd, const TCEString &reg, TTAProgram::BasicBlock &bb)	DataDependenceGraph
writesJumpGuard(const MoveNode &moveNode)	DataDependenceGraph
writeToDotFile(const TCEString &fileName) const	GraphBase< MoveNode, DataDependenceEdge >	virtual
writeToXMLFile(std::string fileName) const	DataDependenceGraph
~BoostGraph()	BoostGraph< MoveNode, DataDependenceEdge >
~DataDependenceGraph()	DataDependenceGraph	virtual
~GraphBase()	GraphBase< MoveNode, DataDependenceEdge >	inlinevirtual