OpenASIP 2.2
Loading...
Searching...
No Matches
DataDependenceGraph Member List

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

addNode(MoveNode &moveNode)DataDependenceGraphvirtual
addNode(MoveNode &moveNode, MoveNode &relatedNode)DataDependenceGraph
addNode(MoveNode &moveNode, BasicBlockNode &bblock)DataDependenceGraph
GraphBase::addNode(Node &node)=0GraphBase< GraphNode, GraphEdge >pure virtual
addProgramOperation(ProgramOperationPtr po)DataDependenceGraph
ALL_ANTIDEPS enum valueDataDependenceGraph
allowLoopEdges_BoostGraph< MoveNode, DataDependenceEdge >protected
allParamRegs_DataDependenceGraphprivate
AntidependenceLevel enum nameDataDependenceGraph
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() constBoostGraph< MoveNode, DataDependenceEdge >protected
calculatePathLengthsFast() constBoostGraph< 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) constBoostGraph< MoveNode, DataDependenceEdge >protected
calculateSourceDistances(const MoveNode *startNode=NULL, int startingLength=0, bool looping=false) constBoostGraph< 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) constBoostGraph< MoveNode, DataDependenceEdge >protected
connectingEdges(const Node &nTail, const Node &nHead) constBoostGraph< MoveNode, DataDependenceEdge >
GraphBase::connectingEdges(const Node &nTail, const Node &nHead) const =0GraphBase< GraphNode, GraphEdge >pure 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
GraphBase::connectNodes(const Node &nTail, const Node &nHead, Edge &e)=0GraphBase< GraphNode, GraphEdge >pure virtual
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_DataDependenceGraphprivate
DataDependenceGraph(std::set< TCEString > allParamRegs, const TCEString &name="", AntidependenceLevel antidependenceLevel=ALL_ANTIDEPS, BasicBlockNode *ownedBBN=NULL, bool containsProcedure=false, bool noLoopEdges=false)DataDependenceGraph
delaySlots_DataDependenceGraphprivate
deleteNode(MoveNode &node)DataDependenceGraph
descriptor(const Edge &e) constBoostGraph< MoveNode, DataDependenceEdge >protected
descriptor(const Node &n) constBoostGraph< MoveNode, DataDependenceEdge >protected
destRenamed(MoveNode &mn)DataDependenceGraph
detachSubgraph(BoostGraph &subGraph)BoostGraph< MoveNode, DataDependenceEdge >
detectIllegalCycles() constBoostGraph< MoveNode, DataDependenceEdge >
disconnectNodes(const Node &nTail, const Node &nHead)BoostGraph< MoveNode, DataDependenceEdge >virtual
GraphBase::disconnectNodes(const Node &nTail, const Node &nHead)=0GraphBase< GraphNode, GraphEdge >pure virtual
dotProgramOperationNodes_DataDependenceGraphprivate
dotString() constDataDependenceGraphvirtual
dropBackEdges()DataDependenceGraph
dropEdge(Edge &edge)BoostGraph< MoveNode, DataDependenceEdge >virtual
dropNode(Node &node)BoostGraph< MoveNode, DataDependenceEdge >virtual
dropProgramOperation(ProgramOperationPtr po)DataDependenceGraph
DUMP_DOT enum valueDataDependenceGraph
DUMP_XML enum valueDataDependenceGraph
DumpFileFormat enum nameDataDependenceGraph
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) constDataDependenceGraph
edge(const int index) constBoostGraph< MoveNode, DataDependenceEdge >virtual
Edge typedefBoostGraph< MoveNode, DataDependenceEdge >
edgeCount() constBoostGraph< MoveNode, DataDependenceEdge >virtual
EdgeDescMap typedefBoostGraph< MoveNode, DataDependenceEdge >protected
edgeDescriptor(const NodeDescriptor &tailNode, const Edge &e) constBoostGraph< MoveNode, DataDependenceEdge >protected
edgeDescriptor(const Edge &e, const NodeDescriptor &headNode) constBoostGraph< MoveNode, DataDependenceEdge >protected
EdgeDescriptor typedefBoostGraph< MoveNode, DataDependenceEdge >protected
edgeDescriptors_BoostGraph< MoveNode, DataDependenceEdge >mutableprotected
EdgeIter typedefBoostGraph< MoveNode, DataDependenceEdge >protected
edgeLatency(const DataDependenceEdge &edge, int ii, const MoveNode *tail, const MoveNode *head) constDataDependenceGraph
EdgeSet typedefBoostGraph< MoveNode, DataDependenceEdge >
edgeWeight(DataDependenceEdge &e, const MoveNode &hNode) constDataDependenceGraphvirtual
EdgeWeightHeuristics enum nameDataDependenceGraph
edgeWeightHeuristics_DataDependenceGraphprivate
EWH_DEFAULT enum valueDataDependenceGraph
EWH_HEURISTIC enum valueDataDependenceGraph
EWH_REAL enum valueDataDependenceGraph
exclusingGuards(const MoveNode &mn1, const MoveNode &mn2) constDataDependenceGraph
findAllPaths() constBoostGraph< MoveNode, DataDependenceEdge >
findBypassSource(const MoveNode &mn)DataDependenceGraph
findLimitingAntidependenceDestination(MoveNode &mn)DataDependenceGraph
findLimitingAntidependenceSource(MoveNode &mn)DataDependenceGraph
findLiveRange(MoveNode &lrNode, bool writingNode, bool guardUseNode) constDataDependenceGraph
findLoopIndexInit(MoveNode &updateMove)DataDependenceGraph
findLoopIndexUpdate(MoveNode *indexMove)DataDependenceGraph
findLoopLimitAndIndex(MoveNode &jumpMove)DataDependenceGraph
firstRegisterCycle(const TTAMachine::BaseRegisterFile &rf, int registerIndex) constDataDependenceGraph
firstScheduledRegisterKill(const TTAMachine::BaseRegisterFile &rf, int registerIndex) constDataDependenceGraph
firstScheduledRegisterRead(const TTAMachine::BaseRegisterFile &rf, int registerIndex, int firstCycleToTest=0) constDataDependenceGraph
firstScheduledRegisterReads(const TTAMachine::BaseRegisterFile &rf, int registerIndex) constDataDependenceGraph
firstScheduledRegisterWrite(const TTAMachine::BaseRegisterFile &rf, int registerIndex) constDataDependenceGraph
firstScheduledRegisterWrites(const TTAMachine::BaseRegisterFile &rf, int registerIndex) constDataDependenceGraph
fixAntidepsAfterLoopUnmergeUser(MoveNode &sourceNode, MoveNode &mergedNode, const TCEString &reg)DataDependenceGraph
fixInterBBAntiEdges(BasicBlockNode &bbn1, BasicBlockNode &bbn2, bool loopEdges)DataDependenceGraph
getBasicBlockNode(const MoveNode &mn) constDataDependenceGraph
getBasicBlockNode(MoveNode &mn)DataDependenceGraph
getOperationLatency(const TCEString &name) constDataDependenceGraphprivate
Graph typedefBoostGraph< MoveNode, DataDependenceEdge >protected
graph_BoostGraph< MoveNode, DataDependenceEdge >protected
GraphBase()GraphBase< GraphNode, GraphEdge >inline
GraphTraits typedefBoostGraph< MoveNode, DataDependenceEdge >protected
guardConverted(MoveNode &guardSrc, MoveNode &dst)DataDependenceGraph
guardDefMoves(const MoveNode &moveNode)DataDependenceGraph
guardRawPredecessors(const MoveNode &node) constDataDependenceGraph
guardRenamed(MoveNode &mn)DataDependenceGraph
guardRestored(MoveNode &guardSrc, MoveNode &dst)DataDependenceGraph
guardsAllowBypass(const MoveNode &defNode, const MoveNode &useNode, bool loopBypass=false)DataDependenceGraph
hasAllRegisterAntidependencies()DataDependenceGraphinline
hasEdge(const Node &nTail, const Node &nHead) constBoostGraph< MoveNode, DataDependenceEdge >virtual
hasEdge(const Node &nTail, const Node &nHead, const Edge &edge) constBoostGraph< MoveNode, DataDependenceEdge >protected
hasEdge(const Edge &edge, const Node *nTail=NULL, const Node *nHead=NULL) constBoostGraph< MoveNode, DataDependenceEdge >protected
GraphBase::hasEdge(const Node &nTail, const Node &nHead) const =0GraphBase< GraphNode, GraphEdge >pure virtual
hasEqualEdge(const MoveNode &tailNode, const MoveNode &headNode, const DataDependenceEdge &edge) constDataDependenceGraphprivate
hasIntraBBRegisterAntidependencies()DataDependenceGraphinline
hasNode(const Node &) constBoostGraph< MoveNode, DataDependenceEdge >
GraphBase::hasNode(const Node &) const =0GraphBase< GraphNode, GraphEdge >protectedpure virtual
hasOtherRegWawSources(const MoveNode &mn) constDataDependenceGraph
hasPath(MoveNode &src, const MoveNode &dest) constBoostGraph< MoveNode, DataDependenceEdge >
hasRegWaw(const MoveNodeUse &mnu, std::set< MoveNodeUse > targets) constDataDependenceGraph
hasSingleBBLoopRegisterAntidependencies()DataDependenceGraphinline
hasUnscheduledPredecessors(const MoveNode &mn) constDataDependenceGraph
hasUnscheduledSuccessors(const MoveNode &mn) constDataDependenceGraph
headNode(const Edge &edge) constBoostGraph< MoveNode, DataDependenceEdge >virtual
headNode(const Edge &edge, const NodeDescriptor &tailNode) constBoostGraph< MoveNode, DataDependenceEdge >protected
GraphBase::headNode(const Edge &edge) const =0GraphBase< GraphNode, GraphEdge >pure virtual
height() constBoostGraph< MoveNode, DataDependenceEdge >
height_BoostGraph< MoveNode, DataDependenceEdge >mutableprotected
inDegree(const Node &node) constBoostGraph< MoveNode, DataDependenceEdge >virtual
GraphBase::inDegree(const Node &node) const =0GraphBase< GraphNode, GraphEdge >pure virtual
inEdge(const Node &node, const int index) constBoostGraph< MoveNode, DataDependenceEdge >virtual
GraphBase::inEdge(const Node &node, const int index) const =0GraphBase< GraphNode, GraphEdge >pure virtual
InEdgeIter typedefBoostGraph< MoveNode, DataDependenceEdge >protected
inEdges(const Node &node) constBoostGraph< MoveNode, DataDependenceEdge >virtual
GraphBase::inEdges(const Node &node) const =0GraphBase< GraphNode, GraphEdge >pure virtual
INTRA_BB_ANTIDEPS enum valueDataDependenceGraph
isInCriticalPath(const MoveNode &node) constBoostGraph< MoveNode, DataDependenceEdge >inline
isLoopBypass(MoveNode &sourceNode, MoveNode &userNode)DataDependenceGraph
isLoopInvariant(const MoveNode &mn) constDataDependenceGraph
isNotAvoidable(const DataDependenceEdge &edge) constDataDependenceGraph
isRootGraphProcedureDDG()DataDependenceGraphprivate
largestCycle() constDataDependenceGraph
lastGuardDefMove(MoveNode &moveNode)DataDependenceGraph
lastRegisterCycle(const TTAMachine::BaseRegisterFile &rf, int registerIndex) constDataDependenceGraph
lastScheduledRegisterGuardReads(const TTAMachine::BaseRegisterFile &rf, int registerIndex) constDataDependenceGraph
lastScheduledRegisterKill(const TTAMachine::BaseRegisterFile &rf, int registerIndex) constDataDependenceGraph
lastScheduledRegisterRead(const TTAMachine::BaseRegisterFile &rf, int registerIndex, int lastCycleToTest=INT_MAX) constDataDependenceGraph
lastScheduledRegisterReads(const TTAMachine::BaseRegisterFile &rf, int registerIndex) constDataDependenceGraph
lastScheduledRegisterWrites(const TTAMachine::BaseRegisterFile &rf, int registerIndex) constDataDependenceGraph
latestCycle(const MoveNode &moveNode, unsigned int ii=UINT_MAX, bool ignoreRegAntideps=false, bool ignoreUnscheduledSuccessors=true, bool ignoreGuards=false, bool ignoreFUDeps=false, bool ignoreSameOperationEdges=false) constDataDependenceGraph
loopingSinkDistances_BoostGraph< MoveNode, DataDependenceEdge >mutableprotected
loopingSourceDistances_BoostGraph< MoveNode, DataDependenceEdge >mutableprotected
machine() constDataDependenceGraphinline
machine_DataDependenceGraphprivate
maxPathLength(const MoveNode &node) constBoostGraph< MoveNode, DataDependenceEdge >
maxSinkDistance(const MoveNode &node) constBoostGraph< MoveNode, DataDependenceEdge >
maxSourceDistance(const MoveNode &node) constBoostGraph< 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_DataDependenceGraphprivate
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) constDataDependenceGraph
name() constBoostGraph< MoveNode, DataDependenceEdge >virtual
name_BoostGraph< MoveNode, DataDependenceEdge >protected
NO_ANTIDEPS enum valueDataDependenceGraph
Node typedefBoostGraph< MoveNode, DataDependenceEdge >
node(const int index) constBoostGraph< MoveNode, DataDependenceEdge >virtual
node(const int index, bool cacheResult) constBoostGraph< MoveNode, DataDependenceEdge >
nodeCount() constBoostGraph< MoveNode, DataDependenceEdge >virtual
NodeDescMap typedefBoostGraph< MoveNode, DataDependenceEdge >protected
NodeDescriptor typedefBoostGraph< MoveNode, DataDependenceEdge >protected
nodeDescriptors_BoostGraph< MoveNode, DataDependenceEdge >mutableprotected
NodeIter typedefBoostGraph< MoveNode, DataDependenceEdge >protected
nodeOfMove(const TTAProgram::Move &move)DataDependenceGraph
NodeSet typedefBoostGraph< MoveNode, DataDependenceEdge >
nodesOfMoves_DataDependenceGraphprivate
onlyGuardDefOfMove(MoveNode &moveNode)DataDependenceGraph
onlyIncomingGuard(const MoveNode &mn) constDataDependenceGraph
onlyRegisterEdgeIn(MoveNode &mn) constDataDependenceGraph
onlyRegisterEdgeOut(MoveNode &mn) constDataDependenceGraph
onlyRegisterRawAncestor(const MoveNode &node, const std::string &sp) constDataDependenceGraph
onlyRegisterRawDestinations(const MoveNode &mn, bool allowGuardEdges=false, bool allowBackEdges=false) constDataDependenceGraph
onlyRegisterRawDestinationsWithEdges(const MoveNode &mn, bool allowBackEdges) constDataDependenceGraph
onlyRegisterRawSource(const MoveNode &mn, int allowGuardEdges=2, int backEdges=0) constDataDependenceGraph
operationInEdges(const MoveNode &node) constDataDependenceGraph
operationLatencies_DataDependenceGraphprivate
operator=(const BoostGraph &)BoostGraph< MoveNode, DataDependenceEdge >private
otherSuccessorsScheduled(MoveNode &node, const NodeSet &ignoredNodes) constDataDependenceGraph
outDegree(const Node &node) constBoostGraph< MoveNode, DataDependenceEdge >virtual
GraphBase::outDegree(const Node &node) const =0GraphBase< GraphNode, GraphEdge >pure virtual
outEdge(const Node &node, const int index) constBoostGraph< MoveNode, DataDependenceEdge >virtual
GraphBase::outEdge(const Node &node, const int index) const =0GraphBase< GraphNode, GraphEdge >pure virtual
OutEdgeIter typedefBoostGraph< MoveNode, DataDependenceEdge >protected
outEdges(const Node &node) constBoostGraph< MoveNode, DataDependenceEdge >virtual
GraphBase::outEdges(const Node &node) const =0GraphBase< GraphNode, GraphEdge >pure virtual
ownedBBN_DataDependenceGraphprivate
ownedEdges_BoostGraph< MoveNode, DataDependenceEdge >protected
parentGraph()BoostGraph< MoveNode, DataDependenceEdge >
parentGraph_BoostGraph< MoveNode, DataDependenceEdge >protected
PathCache typedefBoostGraph< MoveNode, DataDependenceEdge >protected
pathCache_BoostGraph< MoveNode, DataDependenceEdge >mutableprotected
predecessors(const Node &node, bool ignoreBackEdges=false, bool ignoreForwardEdges=false) constBoostGraph< MoveNode, DataDependenceEdge >virtual
predecessorsReady(MoveNode &node) constDataDependenceGraph
procedureDDG_DataDependenceGraphprivate
programOperation(int index)DataDependenceGraph
programOperation(int index) constDataDependenceGraph
programOperationCount() constDataDependenceGraph
programOperationPtr(int index)DataDependenceGraph
programOperations_DataDependenceGraphprivate
queueRawPredecessors(NodeSet &queue, NodeSet &finalDest, NodeSet &predQueue, NodeSet &predFinalDest, bool guard) constDataDependenceGraphprivate
rAntiEdgesIn(MoveNode &mn)DataDependenceGraphprivate
regDepSiblings(const MoveNode &mn) constDataDependenceGraph
registerAndRAInEdges(const MoveNode &node) constDataDependenceGraph
registerAntidependenceLevel_DataDependenceGraphprivate
regRawPredecessors(const MoveNode &node, int backedges=0) constDataDependenceGraph
regRawSuccessorCount(const MoveNode &mn, bool onlyScheduled)DataDependenceGraph
regRawSuccessors(const MoveNode &node) constDataDependenceGraph
regWarSuccessors(const MoveNode &node) constDataDependenceGraph
regWawSuccessors(const MoveNode &node) constDataDependenceGraph
RemovedEdgeMap typedefBoostGraph< 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
GraphBase::removeEdge(Edge &e)=0GraphBase< GraphNode, GraphEdge >pure virtual
removeIncomingGuardEdges(MoveNode &node)DataDependenceGraph
removeNode(MoveNode &node)DataDependenceGraphvirtual
BoostGraph< MoveNode, DataDependenceEdge >::removeNode(Node &node, BoostGraph *modifierGraph)BoostGraph< MoveNode, DataDependenceEdge >protectedvirtual
GraphBase::removeNode(Node &node)=0GraphBase< GraphNode, GraphEdge >pure virtual
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() constBoostGraph< MoveNode, DataDependenceEdge >
rootGraphInDegree(const Node &node) constBoostGraph< MoveNode, DataDependenceEdge >virtual
rootGraphInEdge(const Node &node, const int index) constBoostGraph< MoveNode, DataDependenceEdge >virtual
rootGraphInEdges(const Node &node) constBoostGraph< MoveNode, DataDependenceEdge >virtual
rootGraphOutDegree(const Node &node) constBoostGraph< MoveNode, DataDependenceEdge >virtual
rootGraphOutEdge(const Node &node, const int index) constBoostGraph< MoveNode, DataDependenceEdge >virtual
rootGraphOutEdges(const Node &node) constBoostGraph< MoveNode, DataDependenceEdge >virtual
rootNodes() constBoostGraph< MoveNode, DataDependenceEdge >virtual
rrCost_DataDependenceGraphprivate
rWarEdgesOut(MoveNode &mn)DataDependenceGraph
rWawRawEdgesOutUncond(MoveNode &mn)DataDependenceGraphprivate
sameGuards(const MoveNode &mn1, const MoveNode &mn2) constDataDependenceGraph
sanityCheck() constDataDependenceGraph
scheduledMoves() constDataDependenceGraph
scheduledNodeCount() constDataDependenceGraph
setBasicBlockNode(const MoveNode &mn, BasicBlockNode &bbn)DataDependenceGraph
setCycleGrouping(bool flag)DataDependenceGraphvirtual
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)DataDependenceGraphinlinevirtual
sgCounter_BoostGraph< MoveNode, DataDependenceEdge >protected
SINGLE_BB_LOOP_ANTIDEPS enum valueDataDependenceGraph
sinkDistances_BoostGraph< MoveNode, DataDependenceEdge >mutableprotected
sinkDistDecreased(const MoveNode &n) constBoostGraph< MoveNode, DataDependenceEdge >protected
sinkNodes() constBoostGraph< MoveNode, DataDependenceEdge >virtual
smallestCycle() constDataDependenceGraph
sourceDistances_BoostGraph< MoveNode, DataDependenceEdge >mutableprotected
sourceDistDecreased(const MoveNode &n) constBoostGraph< MoveNode, DataDependenceEdge >protected
sourceRenamed(MoveNode &mn)DataDependenceGraph
successors(const Node &node, bool ignoreBackEdges=false, bool ignoreForwardEdges=false) constBoostGraph< MoveNode, DataDependenceEdge >virtual
successorsReady(MoveNode &node) constDataDependenceGraph
tailNode(const Edge &edge) constBoostGraph< MoveNode, DataDependenceEdge >virtual
tailNode(const Edge &edge, const NodeDescriptor &headNode) constBoostGraph< MoveNode, DataDependenceEdge >protected
GraphBase::tailNode(const Edge &edge) const =0GraphBase< GraphNode, GraphEdge >pure virtual
trueDependenceGraph(bool removeMemAntideps=true, bool ignoreMemDeps=false)DataDependenceGraph
undo(UndoData &undoData)DataDependenceGraph
unMergeUser(MoveNode &resultNode, MoveNode &mergedNode, bool loopBypass=false)DataDependenceGraph
unscheduledMoves() constDataDependenceGraph
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) constGraphBase< GraphNode, GraphEdge >virtual
writeToXMLFile(std::string fileName) constDataDependenceGraph
~BoostGraph()BoostGraph< MoveNode, DataDependenceEdge >
~DataDependenceGraph()DataDependenceGraphvirtual
~GraphBase()GraphBase< GraphNode, GraphEdge >inlinevirtual
Generated by doxygen 1.9.8