/dports/cad/verilator/verilator-4.216/src/ |
H A D | V3Graph.h | 30 class V3GraphVertex; variable 87 friend class V3GraphVertex; 178 class V3GraphVertex VL_NOT_FINAL { 203 V3GraphVertex(V3Graph* graphp, const V3GraphVertex& old); 206 explicit V3GraphVertex(V3Graph* graphp); 211 virtual ~V3GraphVertex() = default; 273 friend class V3GraphVertex; variable 288 void init(V3Graph* graphp, V3GraphVertex* fromp, V3GraphVertex* top, int weight, 295 V3GraphEdge(V3Graph* graphp, V3GraphVertex* fromp, V3GraphVertex* top, in V3GraphEdge() 302 V3GraphEdge(V3Graph* graphp, V3GraphVertex* fromp, V3GraphVertex* top, int weight, [all …]
|
H A D | V3Graph.cpp | 35 V3GraphVertex::V3GraphVertex(V3Graph* graphp, const V3GraphVertex& old) in V3GraphVertex() function in V3GraphVertex 43 V3GraphVertex::V3GraphVertex(V3Graph* graphp) in V3GraphVertex() function in V3GraphVertex 51 void V3GraphVertex::verticesPushBack(V3Graph* graphp) { in verticesPushBack() 55 void V3GraphVertex::unlinkEdges(V3Graph*) { in unlinkEdges() 68 void V3GraphVertex::unlinkDelete(V3Graph* graphp) { in unlinkDelete() 77 void V3GraphVertex::rerouteEdges(V3Graph* graphp) { in rerouteEdges() 93 uint32_t V3GraphVertex::inHash() const { in inHash() 105 uint32_t V3GraphVertex::outHash() const { in outHash() 113 V3GraphEdge* V3GraphVertex::findConnectingEdgep(GraphWay way, const V3GraphVertex* waywardp) { in findConnectingEdgep() 160 void V3GraphEdge::init(V3Graph* graphp, V3GraphVertex* fromp, V3GraphVertex* top, int weight, in init() [all …]
|
H A D | V3GraphAlg.cpp | 42 void vertexIterate(V3GraphVertex* vertexp) { in vertexIterate() 51 V3GraphVertex* outVertexp = edgep->top(); in vertexIterate() 215 void vertexIterate(V3GraphVertex* vertexp) { in vertexIterate() 221 V3GraphVertex* top = edgep->top(); in vertexIterate() 321 void main(V3GraphVertex* vertexp) { in main() 375 V3GraphVertex* vertexIterateAll(V3GraphVertex* vertexp) { in vertexIterateAll() 376 if (V3GraphVertex* newVertexp = static_cast<V3GraphVertex*>(vertexp->userp())) { in vertexIterateAll() 398 V3GraphVertex* vertexp) in GraphAlgSubtrees() 420 bool operator()(const V3GraphVertex* lhsp, const V3GraphVertex* rhsp) const { in operator ()() 432 std::vector<V3GraphVertex*> vertices; in sortVertices() [all …]
|
H A D | V3OrderGraph.h | 136 : V3GraphVertex{graphp} in OrderEitherVertex() 323 : V3GraphVertex{graphp} in OrderMoveVertex() 390 : V3GraphVertex{graphp} in MTaskMoveVertex() 435 OrderEdge(V3Graph* graphp, V3GraphVertex* fromp, V3GraphVertex* top, const OrderEdge& old) in OrderEdge() 439 OrderEdge(V3Graph* graphp, V3GraphVertex* fromp, V3GraphVertex* top, int weight, 462 OrderComboCutEdge(V3Graph* graphp, V3GraphVertex* fromp, V3GraphVertex* top, in OrderComboCutEdge() 467 OrderComboCutEdge(V3Graph* graphp, V3GraphVertex* fromp, V3GraphVertex* top) in OrderComboCutEdge() 483 OrderPostCutEdge(V3Graph* graphp, V3GraphVertex* fromp, V3GraphVertex* top, in OrderPostCutEdge() 488 OrderPostCutEdge(V3Graph* graphp, V3GraphVertex* fromp, V3GraphVertex* top) in OrderPostCutEdge() 504 OrderPreCutEdge(V3Graph* graphp, V3GraphVertex* fromp, V3GraphVertex* top, in OrderPreCutEdge() [all …]
|
H A D | V3GraphPathChecker.cpp | 55 for (V3GraphVertex* vxp = graphp->verticesBeginp(); vxp; vxp = vxp->verticesNextp()) { 67 for (V3GraphVertex* vxp = m_graphp->verticesBeginp(); vxp; vxp = vxp->verticesNextp()) { in ~GraphPathChecker() 77 while (const V3GraphVertex* const vertexp = order.nextp()) { in initHalfCriticalPaths() 82 const V3GraphVertex* wrelativep = edgep->furtherp(rev); in initHalfCriticalPaths() 97 bool GraphPathChecker::pathExistsInternal(const V3GraphVertex* ap, const V3GraphVertex* bp, in pathExistsInternal() 132 bool GraphPathChecker::pathExistsFrom(const V3GraphVertex* fromp, const V3GraphVertex* top) { in pathExistsFrom() 138 const V3GraphVertex* fromp = edgep->fromp(); in isTransitiveEdge() 139 const V3GraphVertex* top = edgep->top(); in isTransitiveEdge()
|
H A D | V3GraphAcyc.cpp | 32 class GraphAcycVertex final : public V3GraphVertex { 43 : V3GraphVertex{graphp} in GraphAcycVertex() 67 GraphAcycEdge(V3Graph* graphp, V3GraphVertex* fromp, V3GraphVertex* top, int weight, in GraphAcycEdge() 129 V3GraphEdge* edgeFromEdge(V3GraphEdge* oldedgep, V3GraphVertex* fromp, V3GraphVertex* top) { in edgeFromEdge() 169 void workPush(V3GraphVertex* vertexp) { in workPush() 287 V3GraphVertex* otherVertexp = edgep->top(); in simplifyNone() 293 V3GraphVertex* otherVertexp = edgep->fromp(); in simplifyNone() 307 V3GraphVertex* inVertexp = inEdgep->fromp(); in simplifyOne() 308 V3GraphVertex* outVertexp = outEdgep->top(); in simplifyOne() 343 V3GraphVertex* outVertexp = outEdgep->top(); in simplifyOut() [all …]
|
H A D | V3GraphStream.h | 46 const V3GraphVertex* m_vxp; // [mtask] Vertex 50 VxHolder(const V3GraphVertex* vxp, uint32_t pos, uint32_t numBlockingEdges) in VxHolder() 55 const V3GraphVertex* vertexp() const { return m_vxp; } in vertexp() 88 std::map<const V3GraphVertex*, VxHolder> m_waitingVertices; // List of waiting vertices 104 for (const V3GraphVertex* vxp = graphp->verticesBeginp(); vxp; 161 const V3GraphVertex* nextp() { in nextp() 162 const V3GraphVertex* resultp = nullptr; in nextp() 194 void unblockDeps(const V3GraphVertex* vertexp) { in unblockDeps() 197 const V3GraphVertex* const toVertexp = edgep->top(); in unblockDeps() 209 const V3GraphVertex* const fromVertexp = edgep->fromp(); in unblockDeps() [all …]
|
H A D | V3Trace.cpp | 55 class TraceActivityVertex final : public V3GraphVertex { 64 : V3GraphVertex{graphp} in TraceActivityVertex() 70 : V3GraphVertex{graphp} in TraceActivityVertex() 99 class TraceCFuncVertex final : public V3GraphVertex { 104 : V3GraphVertex{graphp} in TraceCFuncVertex() 114 class TraceTraceVertex final : public V3GraphVertex { 121 : V3GraphVertex{graphp} in TraceTraceVertex() 136 class TraceVarVertex final : public V3GraphVertex { 141 : V3GraphVertex{graphp} in TraceVarVertex() 199 for (const V3GraphVertex* itp = m_graph.verticesBeginp(); itp; in detectDuplicates() [all …]
|
H A D | V3GraphPathChecker.h | 46 bool pathExistsFrom(const V3GraphVertex* fromp, const V3GraphVertex* top); 54 bool pathExistsInternal(const V3GraphVertex* ap, const V3GraphVertex* bp,
|
H A D | V3Partition.cpp | 227 V3GraphVertex* const updateMep = (*it).key(); in go() 263 void notifyEdgeCp(V3GraphVertex* vxp, GraphWay way, V3GraphVertex* throughp, in notifyEdgeCp() 288 static uint32_t cost(const V3GraphVertex*) { return 1; } in cost() argument 295 V3GraphVertex* const vxp = const_cast<V3GraphVertex*>(cvxp); in partInitCriticalPaths() 313 for (auto& i : m_vx) i = new V3GraphVertex(&m_graph); in go() 376 uint32_t cost(const V3GraphVertex* vxp) const { in cost() 393 void notifyEdgeCp(V3GraphVertex* vxp, GraphWay way, V3GraphVertex* throuvhVxp, in notifyEdgeCp() 968 std::unordered_set<V3GraphVertex*> relatives; in partInitHalfCriticalPaths() 1973 const V3GraphVertex* vertexp; in go() 2519 const V3GraphVertex* const top = edgep->top(); in hashGraphDebug() [all …]
|
H A D | V3Split.cpp | 98 class SplitNodeVertex VL_NOT_FINAL : public V3GraphVertex { 103 : V3GraphVertex{graphp} in SplitNodeVertex() 160 SplitEdge(V3Graph* graphp, V3GraphVertex* fromp, V3GraphVertex* top, int weight, in SplitEdge() 190 SplitPostEdge(V3Graph* graphp, V3GraphVertex* fromp, V3GraphVertex* top) in SplitPostEdge() 199 SplitLVEdge(V3Graph* graphp, V3GraphVertex* fromp, V3GraphVertex* top) in SplitLVEdge() 208 SplitRVEdge(V3Graph* graphp, V3GraphVertex* fromp, V3GraphVertex* top) in SplitRVEdge() 217 SplitScorebdEdge(V3Graph* graphp, V3GraphVertex* fromp, V3GraphVertex* top) in SplitScorebdEdge() 228 SplitStrictEdge(V3Graph* graphp, V3GraphVertex* fromp, V3GraphVertex* top) in SplitStrictEdge() 321 for (V3GraphVertex* vertexp = m_graph.verticesBeginp(); vertexp; in pruneDepsOnInputs() 478 for (V3GraphVertex* vertexp = m_graph.verticesBeginp(); vertexp; in cleanupBlockGraph() [all …]
|
H A D | V3LinkCells.cpp | 48 virtual void loopsMessageCb(V3GraphVertex* vertexp) override; 51 class LinkCellsVertex final : public V3GraphVertex { 56 : V3GraphVertex{graphp} in LinkCellsVertex() 68 class LibraryVertex final : public V3GraphVertex { 71 : V3GraphVertex{graphp} {} in LibraryVertex() 76 void LinkCellsGraph::loopsMessageCb(V3GraphVertex* vertexp) { in loopsMessageCb() 116 const V3GraphVertex* m_topVertexp = nullptr; // Vertex of top module 123 V3GraphVertex* vertex(AstNodeModule* nodep) { in vertex() 171 for (V3GraphVertex* itp = m_graph.verticesBeginp(); itp; itp = itp->verticesNextp()) { in visit()
|
H A D | V3Order.cpp | 180 void OrderGraph::loopsVertexCb(V3GraphVertex* vertexp) { in loopsVertexCb() 823 using VxDomPair = std::pair<const V3GraphVertex*, const AstSenTree*>; 918 const V3GraphVertex* nonLogicVxp = edgep->top(); in iterate() 1007 virtual bool operator()(const V3GraphVertex* lhsp, const V3GraphVertex* rhsp) const { in operator ()() 1027 virtual bool operator()(const V3GraphVertex* lhsp, const V3GraphVertex* rhsp) const { in operator ()() 1261 void reportLoopVarsIterate(V3GraphVertex* vertexp, uint32_t color) { in reportLoopVarsIterate() 1438 for (V3GraphVertex* itp = m_graph.verticesBeginp(); itp; itp = itp->verticesNextp()) { in processCircular() 1849 for (V3GraphVertex* initVxp = m_graph.verticesBeginp(); initVxp; in processMTasksInitial() 1902 const V3GraphVertex* moveVxp; in processMTasks() 1947 const V3GraphVertex* mtaskVxp; in processMTasks() [all …]
|
H A D | V3TSP.cpp | 54 template <typename T_Key> class TspVertexTmpl : public V3GraphVertex { 60 : V3GraphVertex{graphp} in TspVertexTmpl() 143 static Vertex* castVertexp(V3GraphVertex* vxp) { return dynamic_cast<Vertex*>(vxp); } in castVertexp() 160 for (V3GraphVertex* vxp = verticesBeginp(); vxp; vxp = vxp->verticesNextp()) { in makeMinSpanningTree() 277 for (V3GraphVertex* vxp = g.verticesBeginp(); vxp; vxp = vxp->verticesNextp()) { in combineGraph() 346 for (V3GraphVertex* vxp = verticesBeginp(); vxp; vxp = vxp->verticesNextp()) { in dumpGraph() 375 for (V3GraphVertex* vxp = verticesBeginp(); vxp; vxp = vxp->verticesNextp()) { in getOddDegreeKeys()
|
H A D | V3PartitionGraph.h | 31 class AbstractMTask VL_NOT_FINAL : public V3GraphVertex { 34 : V3GraphVertex{graphp} {} in AbstractMTask()
|
H A D | V3Gate.cpp | 69 class GateEitherVertex VL_NOT_FINAL : public V3GraphVertex { 76 : V3GraphVertex{graphp} in GateEitherVertex() 539 for (V3GraphVertex* itp = m_graph.verticesBeginp(); itp; itp = itp->verticesNextp()) { in optimizeSignals() 704 for (V3GraphVertex* itp = m_graph.verticesBeginp(); itp; itp = itp->verticesNextp()) { in replaceAssigns() 747 for (V3GraphVertex* vertexp = m_graph.verticesBeginp(); vertexp; in consumedMark() 768 for (V3GraphVertex* vertexp = m_graph.verticesBeginp(); vertexp; in consumedMove() 793 for (V3GraphVertex* itp = m_graph.verticesBeginp(); itp; itp = itp->verticesNextp()) { in warnSignals() 1233 for (V3GraphVertex* itp = m_graph.verticesBeginp(); itp; itp = itp->verticesNextp()) { in dedupe() 1240 for (V3GraphVertex* itp = m_graph.verticesBeginp(); itp; itp = itp->verticesNextp()) { in dedupe() 1373 for (V3GraphVertex* itp = m_graph.verticesBeginp(); itp; itp = itp->verticesNextp()) { in mergeAssigns() [all …]
|
H A D | V3Cdc.cpp | 52 class CdcEitherVertex VL_NOT_FINAL : public V3GraphVertex { 63 : V3GraphVertex{graphp} in CdcEitherVertex() 353 for (V3GraphVertex* itp = m_graph.verticesBeginp(); itp; itp = itp->verticesNextp()) { in analyzeReset() 503 for (V3GraphVertex* itp = m_graph.verticesBeginp(); itp; itp = itp->verticesNextp()) { in edgeReport() 518 for (V3GraphVertex* itp = m_graph.verticesBeginp(); itp; itp = itp->verticesNextp()) { in edgeReport()
|
H A D | V3GraphTest.cpp | 52 class V3GraphTestVertex VL_NOT_FINAL : public V3GraphVertex { 57 : V3GraphVertex{graphp} in V3GraphTestVertex()
|
H A D | V3Tristate.cpp | 81 class TristateVertex final : public V3GraphVertex { 88 : V3GraphVertex{graphp} in TristateVertex() 215 for (V3GraphVertex* itp = m_graph.verticesBeginp(); itp; itp = itp->verticesNextp()) { in clear() 230 for (V3GraphVertex* itp = m_graph.verticesBeginp(); itp; itp = itp->verticesNextp()) { in graphWalk() 233 for (V3GraphVertex* itp = m_graph.verticesBeginp(); itp; itp = itp->verticesNextp()) { in graphWalk() 266 for (V3GraphVertex* itp = m_graph.verticesBeginp(); itp; itp = itp->verticesNextp()) { in tristateVars()
|
H A D | V3EmitCSyms.cpp | 484 for (const V3GraphVertex* vxp in emitSymHdr() 488 = dynamic_cast<ExecMTask*>(const_cast<V3GraphVertex*>(vxp)); in emitSymHdr() 747 for (const V3GraphVertex* vxp in emitSymImp() 750 ExecMTask* const mtp = dynamic_cast<ExecMTask*>(const_cast<V3GraphVertex*>(vxp)); in emitSymImp()
|
H A D | V3Active.cpp | 48 class LatchDetectGraphVertex final : public V3GraphVertex { 67 : V3GraphVertex{graphp} in LatchDetectGraphVertex()
|
H A D | V3LifePost.cpp | 319 for (V3GraphVertex* mtaskVxp = m_mtasksGraphp->verticesBeginp(); mtaskVxp; in visit()
|
H A D | V3Task.cpp | 43 class TaskBaseVertex VL_NOT_FINAL : public V3GraphVertex { 48 : V3GraphVertex{graphp} {} in TaskBaseVertex()
|
H A D | V3Ast.h | 1117 class V3GraphVertex; variable 1144 V3GraphVertex* toGraphVertex() const { return to<V3GraphVertex*>(); } in toGraphVertex()
|
/dports/cad/verilator/verilator-4.216/docs/ |
H A D | internals.rst | 136 ``V3GraphVertex`` 139 ``V3GraphVertex`` is the base class for vertices in a graph. Vertices have 146 ``V3GraphVertex`` which will reimplement these methods.
|