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

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

addNode(Node &node)BoostGraph< OperationDAGNode, OperationDAGEdge >virtual
GraphBase::addNode(Node &node)=0GraphBase< GraphNode, GraphEdge >pure virtual
allowLoopEdges_BoostGraph< OperationDAGNode, OperationDAGEdge >protected
BoostGraph(bool allowLoopEdges=true)BoostGraph< OperationDAGNode, OperationDAGEdge >
BoostGraph(const TCEString &name, bool allowLoopEdges=true)BoostGraph< OperationDAGNode, OperationDAGEdge >
BoostGraph(const BoostGraph &other, bool allowLoopEdges=true)BoostGraph< OperationDAGNode, OperationDAGEdge >
calculatePathLengths() constBoostGraph< OperationDAGNode, OperationDAGEdge >protected
calculatePathLengthsFast() constBoostGraph< OperationDAGNode, OperationDAGEdge >protected
calculatePathLengthsOnConnect(const OperationDAGNode &nTail, const OperationDAGNode &nHead, OperationDAGEdge &e)BoostGraph< OperationDAGNode, OperationDAGEdge >protected
calculateSinkDistance(const OperationDAGNode &node, int len, bool looping=false) constBoostGraph< OperationDAGNode, OperationDAGEdge >protected
calculateSourceDistances(const OperationDAGNode *startNode=NULL, int startingLength=0, bool looping=false) constBoostGraph< OperationDAGNode, OperationDAGEdge >protected
childGraphs_BoostGraph< OperationDAGNode, OperationDAGEdge >protected
clearDescriptorCache(EdgeSet edges)BoostGraph< OperationDAGNode, OperationDAGEdge >protected
connectingEdge(const Node &nTail, const Node &nHead) constBoostGraph< OperationDAGNode, OperationDAGEdge >protected
connectingEdges(const Node &nTail, const Node &nHead) constBoostGraph< OperationDAGNode, OperationDAGEdge >
GraphBase::connectingEdges(const Node &nTail, const Node &nHead) const =0GraphBase< GraphNode, GraphEdge >pure virtual
connectNodes(const Node &nTail, const Node &nHead, Edge &e)BoostGraph< OperationDAGNode, OperationDAGEdge >virtual
connectNodes(const Node &nTail, const Node &nHead, Edge &e, GraphBase< OperationDAGNode, OperationDAGEdge > *modifier, bool creatingSG=false)BoostGraph< OperationDAGNode, OperationDAGEdge >protectedvirtual
GraphBase::connectNodes(const Node &nTail, const Node &nHead, Edge &e)=0GraphBase< GraphNode, GraphEdge >pure virtual
constructSubGraph(BoostGraph &subGraph, NodeSet &nodes)BoostGraph< OperationDAGNode, OperationDAGEdge >protected
copyInEdge(const Node &destination, Edge &edge, const Node *tail=NULL)BoostGraph< OperationDAGNode, OperationDAGEdge >virtual
copyOutEdge(const Node &destination, Edge &edge, const Node *head=NULL)BoostGraph< OperationDAGNode, OperationDAGEdge >virtual
descriptor(const Edge &e) constBoostGraph< OperationDAGNode, OperationDAGEdge >protected
descriptor(const Node &n) constBoostGraph< OperationDAGNode, OperationDAGEdge >protected
detachSubgraph(BoostGraph &subGraph)BoostGraph< OperationDAGNode, OperationDAGEdge >
detectIllegalCycles() constBoostGraph< OperationDAGNode, OperationDAGEdge >
disconnectNodes(const Node &nTail, const Node &nHead)BoostGraph< OperationDAGNode, OperationDAGEdge >virtual
GraphBase::disconnectNodes(const Node &nTail, const Node &nHead)=0GraphBase< GraphNode, GraphEdge >pure virtual
dotString() constGraphBase< GraphNode, GraphEdge >virtual
dropEdge(Edge &edge)BoostGraph< OperationDAGNode, OperationDAGEdge >virtual
dropNode(Node &node)BoostGraph< OperationDAGNode, OperationDAGEdge >virtual
Edge typedefBoostGraph< OperationDAGNode, OperationDAGEdge >
edge(const int index) constBoostGraph< OperationDAGNode, OperationDAGEdge >virtual
edgeCount() constBoostGraph< OperationDAGNode, OperationDAGEdge >virtual
EdgeDescMap typedefBoostGraph< OperationDAGNode, OperationDAGEdge >protected
EdgeDescriptor typedefBoostGraph< OperationDAGNode, OperationDAGEdge >protected
edgeDescriptor(const NodeDescriptor &tailNode, const Edge &e) constBoostGraph< OperationDAGNode, OperationDAGEdge >protected
edgeDescriptor(const Edge &e, const NodeDescriptor &headNode) constBoostGraph< OperationDAGNode, OperationDAGEdge >protected
edgeDescriptors_BoostGraph< OperationDAGNode, OperationDAGEdge >mutableprotected
EdgeIter typedefBoostGraph< OperationDAGNode, OperationDAGEdge >protected
EdgeSet typedefBoostGraph< OperationDAGNode, OperationDAGEdge >
edgeWeight(OperationDAGEdge &e, const OperationDAGNode &n) constBoostGraph< OperationDAGNode, OperationDAGEdge >protectedvirtual
endNodes() constOperationDAG
endNodes_OperationDAGmutableprivate
findAllPaths() constBoostGraph< OperationDAGNode, OperationDAGEdge >
Graph typedefBoostGraph< OperationDAGNode, OperationDAGEdge >protected
graph_BoostGraph< OperationDAGNode, OperationDAGEdge >protected
GraphBase()GraphBase< GraphNode, GraphEdge >inline
GraphTraits typedefBoostGraph< OperationDAGNode, OperationDAGEdge >protected
hasEdge(const Node &nTail, const Node &nHead) constBoostGraph< OperationDAGNode, OperationDAGEdge >virtual
hasEdge(const Node &nTail, const Node &nHead, const Edge &edge) constBoostGraph< OperationDAGNode, OperationDAGEdge >protected
hasEdge(const Edge &edge, const Node *nTail=NULL, const Node *nHead=NULL) constBoostGraph< OperationDAGNode, OperationDAGEdge >protected
GraphBase::hasEdge(const Node &nTail, const Node &nHead) const =0GraphBase< GraphNode, GraphEdge >pure virtual
hasNode(const Node &) constBoostGraph< OperationDAGNode, OperationDAGEdge >
GraphBase::hasNode(const Node &) const =0GraphBase< GraphNode, GraphEdge >protectedpure virtual
hasPath(OperationDAGNode &src, const OperationDAGNode &dest) constBoostGraph< OperationDAGNode, OperationDAGEdge >
headNode(const Edge &edge) constBoostGraph< OperationDAGNode, OperationDAGEdge >virtual
headNode(const Edge &edge, const NodeDescriptor &tailNode) constBoostGraph< OperationDAGNode, OperationDAGEdge >protected
GraphBase::headNode(const Edge &edge) const =0GraphBase< GraphNode, GraphEdge >pure virtual
height() constBoostGraph< OperationDAGNode, OperationDAGEdge >
height_BoostGraph< OperationDAGNode, OperationDAGEdge >mutableprotected
inDegree(const Node &node) constBoostGraph< OperationDAGNode, OperationDAGEdge >virtual
GraphBase::inDegree(const Node &node) const =0GraphBase< GraphNode, GraphEdge >pure virtual
inEdge(const Node &node, const int index) constBoostGraph< OperationDAGNode, OperationDAGEdge >virtual
GraphBase::inEdge(const Node &node, const int index) const =0GraphBase< GraphNode, GraphEdge >pure virtual
InEdgeIter typedefBoostGraph< OperationDAGNode, OperationDAGEdge >protected
inEdges(const Node &node) constBoostGraph< OperationDAGNode, OperationDAGEdge >virtual
GraphBase::inEdges(const Node &node) const =0GraphBase< GraphNode, GraphEdge >pure virtual
isInCriticalPath(const OperationDAGNode &node) constBoostGraph< OperationDAGNode, OperationDAGEdge >inline
isNull() constOperationDAGinline
isTrivial() constOperationDAG
loopingSinkDistances_BoostGraph< OperationDAGNode, OperationDAGEdge >mutableprotected
loopingSourceDistances_BoostGraph< OperationDAGNode, OperationDAGEdge >mutableprotected
maxPathLength(const OperationDAGNode &node) constBoostGraph< OperationDAGNode, OperationDAGEdge >
maxSinkDistance(const OperationDAGNode &node) constBoostGraph< OperationDAGNode, OperationDAGEdge >
maxSourceDistance(const OperationDAGNode &node) constBoostGraph< OperationDAGNode, OperationDAGEdge >
moveInEdge(const Node &source, const Node &destination, Edge &edge, const Node *tail=NULL, bool childs=false)BoostGraph< OperationDAGNode, OperationDAGEdge >virtual
moveInEdges(const Node &source, const Node &destination)BoostGraph< OperationDAGNode, OperationDAGEdge >virtual
moveInEdges(const Node &source, const Node &destination, BoostGraph *modifierGraph)BoostGraph< OperationDAGNode, OperationDAGEdge >protected
moveOutEdge(const Node &source, const Node &destination, Edge &edge, const Node *head=NULL, bool childs=false)BoostGraph< OperationDAGNode, OperationDAGEdge >virtual
moveOutEdges(const Node &source, const Node &destination)BoostGraph< OperationDAGNode, OperationDAGEdge >virtual
moveOutEdges(const Node &source, const Node &destination, BoostGraph *modifierGraph)BoostGraph< OperationDAGNode, OperationDAGEdge >protectedvirtual
name() constBoostGraph< OperationDAGNode, OperationDAGEdge >virtual
name_BoostGraph< OperationDAGNode, OperationDAGEdge >protected
Node typedefBoostGraph< OperationDAGNode, OperationDAGEdge >
node(const int index) constBoostGraph< OperationDAGNode, OperationDAGEdge >virtual
node(const int index, bool cacheResult) constBoostGraph< OperationDAGNode, OperationDAGEdge >
nodeCount() constBoostGraph< OperationDAGNode, OperationDAGEdge >virtual
NodeDescMap typedefBoostGraph< OperationDAGNode, OperationDAGEdge >protected
NodeDescriptor typedefBoostGraph< OperationDAGNode, OperationDAGEdge >protected
nodeDescriptors_BoostGraph< OperationDAGNode, OperationDAGEdge >mutableprotected
NodeIter typedefBoostGraph< OperationDAGNode, OperationDAGEdge >protected
NodeSet typedefBoostGraph< OperationDAGNode, OperationDAGEdge >
nullOperationDAGstatic
op_OperationDAGprivate
operation() constOperationDAGinline
OperationDAG()OperationDAG
OperationDAG(const class OperationPimpl &op)OperationDAG
OperationDAG(const OperationDAG &other)OperationDAG
operator=(const BoostGraph &)BoostGraph< OperationDAGNode, OperationDAGEdge >private
outDegree(const Node &node) constBoostGraph< OperationDAGNode, OperationDAGEdge >virtual
GraphBase::outDegree(const Node &node) const =0GraphBase< GraphNode, GraphEdge >pure virtual
outEdge(const Node &node, const int index) constBoostGraph< OperationDAGNode, OperationDAGEdge >virtual
GraphBase::outEdge(const Node &node, const int index) const =0GraphBase< GraphNode, GraphEdge >pure virtual
OutEdgeIter typedefBoostGraph< OperationDAGNode, OperationDAGEdge >protected
outEdges(const Node &node) constBoostGraph< OperationDAGNode, OperationDAGEdge >virtual
GraphBase::outEdges(const Node &node) const =0GraphBase< GraphNode, GraphEdge >pure virtual
ownedEdges_BoostGraph< OperationDAGNode, OperationDAGEdge >protected
parentGraph()BoostGraph< OperationDAGNode, OperationDAGEdge >
parentGraph_BoostGraph< OperationDAGNode, OperationDAGEdge >protected
PathCache typedefBoostGraph< OperationDAGNode, OperationDAGEdge >protected
pathCache_BoostGraph< OperationDAGNode, OperationDAGEdge >mutableprotected
predecessors(const Node &node, bool ignoreBackEdges=false, bool ignoreForwardEdges=false) constBoostGraph< OperationDAGNode, OperationDAGEdge >virtual
RemovedEdgeMap typedefBoostGraph< OperationDAGNode, OperationDAGEdge >protected
removeEdge(Edge &e)BoostGraph< OperationDAGNode, OperationDAGEdge >virtual
removeEdge(Edge &e, const OperationDAGNode *tailNode, const OperationDAGNode *headNode, BoostGraph *modifierGraph=NULL)BoostGraph< OperationDAGNode, OperationDAGEdge >protectedvirtual
GraphBase::removeEdge(Edge &e)=0GraphBase< GraphNode, GraphEdge >pure virtual
removeNode(Node &node)BoostGraph< OperationDAGNode, OperationDAGEdge >virtual
removeNode(Node &node, BoostGraph *modifierGraph)BoostGraph< OperationDAGNode, OperationDAGEdge >protectedvirtual
GraphBase::removeNode(Node &node)=0GraphBase< GraphNode, GraphEdge >pure virtual
replaceNodeWithLastNode(OperationDAGNode &dest)BoostGraph< OperationDAGNode, OperationDAGEdge >protected
restoreNodeFromParent(OperationDAGNode &node)BoostGraph< OperationDAGNode, OperationDAGEdge >
restoreRemovedEdges(RemovedEdgeMap removedEdges)BoostGraph< OperationDAGNode, OperationDAGEdge >protected
rootGraph()BoostGraph< OperationDAGNode, OperationDAGEdge >
rootGraph() constBoostGraph< OperationDAGNode, OperationDAGEdge >
rootGraphInDegree(const Node &node) constBoostGraph< OperationDAGNode, OperationDAGEdge >virtual
rootGraphInEdge(const Node &node, const int index) constBoostGraph< OperationDAGNode, OperationDAGEdge >virtual
rootGraphInEdges(const Node &node) constBoostGraph< OperationDAGNode, OperationDAGEdge >virtual
rootGraphOutDegree(const Node &node) constBoostGraph< OperationDAGNode, OperationDAGEdge >virtual
rootGraphOutEdge(const Node &node, const int index) constBoostGraph< OperationDAGNode, OperationDAGEdge >virtual
rootGraphOutEdges(const Node &node) constBoostGraph< OperationDAGNode, OperationDAGEdge >virtual
rootNodes() constBoostGraph< OperationDAGNode, OperationDAGEdge >virtual
setName(const TCEString &newName)BoostGraph< OperationDAGNode, OperationDAGEdge >inline
setOperation(const class OperationPimpl &op)OperationDAGinline
sgCounter_BoostGraph< OperationDAGNode, OperationDAGEdge >protected
sinkDistances_BoostGraph< OperationDAGNode, OperationDAGEdge >mutableprotected
sinkDistDecreased(const OperationDAGNode &n) constBoostGraph< OperationDAGNode, OperationDAGEdge >protected
sinkNodes() constBoostGraph< OperationDAGNode, OperationDAGEdge >virtual
sourceDistances_BoostGraph< OperationDAGNode, OperationDAGEdge >mutableprotected
sourceDistDecreased(const OperationDAGNode &n) constBoostGraph< OperationDAGNode, OperationDAGEdge >protected
stepMap_OperationDAGmutableprivate
stepsToRoot(const OperationDAGNode &node) constOperationDAG
successors(const Node &node, bool ignoreBackEdges=false, bool ignoreForwardEdges=false) constBoostGraph< OperationDAGNode, OperationDAGEdge >virtual
tailNode(const Edge &edge) constBoostGraph< OperationDAGNode, OperationDAGEdge >virtual
tailNode(const Edge &edge, const NodeDescriptor &headNode) constBoostGraph< OperationDAGNode, OperationDAGEdge >protected
GraphBase::tailNode(const Edge &edge) const =0GraphBase< GraphNode, GraphEdge >pure virtual
writeToDotFile(const TCEString &fileName) constGraphBase< GraphNode, GraphEdge >virtual
~BoostGraph()BoostGraph< OperationDAGNode, OperationDAGEdge >
~GraphBase()GraphBase< GraphNode, GraphEdge >inlinevirtual
~OperationDAG()OperationDAGvirtual