Home
last modified time | relevance | path

Searched refs:vertexp (Results 1 – 25 of 220) sorted by relevance

123456789

/dports/cad/verilator/verilator-4.216/src/
H A DV3GraphAlg.cpp38 vertexp = vertexp->verticesNextp()) { in main()
140 vertexp = vertexp->verticesNextp()) { in main()
186 vertexp = vertexp->verticesNextp()) { in main()
192 vertexp = vertexp->verticesNextp()) { in main()
201 vertexp = vertexp->verticesNextp()) { in main()
268 vertexp = vertexp->verticesNextp()) { in main()
273 vertexp = vertexp->verticesNextp()) { in main()
433 for (V3GraphVertex* vertexp = verticesBeginp(); vertexp; vertexp = vertexp->verticesNextp()) { in sortVertices() local
444 for (V3GraphVertex* vertexp = verticesBeginp(); vertexp; vertexp = vertexp->verticesNextp()) { in sortEdges() local
482 for (V3GraphVertex* vertexp = verticesBeginp(); vertexp; vertexp = vertexp->verticesNextp()) { in orderPreRanked() local
[all …]
H A DV3Graph.cpp150 if (vertexp->rank()) os << " r" << vertexp->rank(); in operator <<()
152 if (vertexp->color()) os << " c" << vertexp->color(); in operator <<()
216 for (V3GraphVertex* vertexp = verticesBeginp(); vertexp; vertexp = vertexp->verticesNextp()) { in clear() local
227 VL_DO_DANGLING(delete vertexp, vertexp); in clear()
240 for (V3GraphVertex* vertexp = verticesBeginp(); vertexp; vertexp = vertexp->verticesNextp()) { in userClearVertices() local
248 for (V3GraphVertex* vertexp = verticesBeginp(); vertexp; vertexp = vertexp->verticesNextp()) { in userClearEdges() local
258 for (V3GraphVertex* vertexp = verticesBeginp(); vertexp; vertexp = vertexp->verticesNextp()) { in clearColors() local
279 for (V3GraphVertex* vertexp = verticesBeginp(); vertexp; vertexp = vertexp->verticesNextp()) { in dump() local
329 for (V3GraphVertex* vertexp = verticesBeginp(); vertexp; vertexp = vertexp->verticesNextp()) { in dumpDotFile() local
354 if (vertexp->rank()) *logp << " r" << vertexp->rank(); in dumpDotFile()
[all …]
H A DV3GraphAcyc.cpp243 for (V3GraphVertex* vertexp = m_breakGraph.verticesBeginp(); vertexp; in simplify() local
244 vertexp = vertexp->verticesNextp()) { in simplify()
245 workPush(vertexp); in simplify()
268 for (V3GraphVertex *nextp, *vertexp = m_breakGraph.verticesBeginp(); vertexp; in deleteMarked() local
451 for (V3GraphVertex* vertexp = m_breakGraph.verticesBeginp(); vertexp; in place() local
452 vertexp = vertexp->verticesNextp()) { in place()
462 for (V3GraphVertex* vertexp = m_breakGraph.verticesBeginp(); vertexp; in place() local
463 vertexp = vertexp->verticesNextp()) { in place()
504 vertexp->rank(vertexp->m_storedRank); in placeTryEdge()
519 vertexp->m_storedRank = vertexp->rank(); in placeIterate()
[all …]
H A DV3Cdc.cpp261 if (!vertexp) { in makeVarVertex()
264 varscp->user1p(vertexp); in makeVarVertex()
283 vertexp->cntAsyncRst(vertexp->cntAsyncRst() + 1); in makeVarVertex()
285 return vertexp; in makeVarVertex()
376 vertexp->user(m_userGeneration); in traceAsyncRecurse()
417 if (mark) vertexp->asyncPath(true); in traceAsyncRecurse()
450 vertexp->user(m_userGeneration); in dumpAsyncRecurse()
555 vertexp->user(m_userGeneration); in edgeDomainRecurse()
558 if (traceDests ? vertexp->dstDomainSet() : vertexp->srcDomainSet()) { in edgeDomainRecurse()
608 vertexp->dstDomainp(senoutp); in edgeDomainRecurse()
[all …]
H A DV3Order.cpp330 if (!vertexp) { in getVarVertex()
347 return vertexp; in getVarVertex()
1206 reportLoopVarsIterate(vertexp, vertexp->color()); in reportLoopVars()
1412 UASSERT_OBJ(vertexp->isFromInput(), vertexp, in processInputsOutIterate()
1705 for (OrderMoveVertex* vertexp = m_pomWaiting.begin(); vertexp;) { in processMovePrepReady() local
1707 if (vertexp->isWait() && vertexp->inEmpty()) processMoveReadyOne(vertexp); in processMovePrepReady()
1708 vertexp = nextp; in processMovePrepReady()
1717 vertexp->m_pomWaitingE.unlink(m_pomWaiting, vertexp); in processMoveReadyOne()
1720 vertexp->m_readyVerticesE.pushBack(vertexp->domScopep()->m_readyVertices, vertexp); in processMoveReadyOne()
1734 vertexp->m_readyVerticesE.unlink(vertexp->domScopep()->m_readyVertices, vertexp); in processMoveDoneOne()
[all …]
H A DV3GraphStream.h55 const V3GraphVertex* vertexp() const { return m_vxp; } in vertexp() function
59 UASSERT_OBJ(m_numBlockingEdges > 0, vertexp(), "Underflow of blocking edges"); in unblock()
74 if (m_lessThan.operator()(a.vertexp(), b.vertexp())) return true; in operator()
75 if (m_lessThan.operator()(b.vertexp(), a.vertexp())) return false; in operator()
181 resultp = curIt->vertexp(); in nextp()
194 void unblockDeps(const V3GraphVertex* vertexp) { in unblockDeps() argument
196 for (V3GraphEdge* edgep = vertexp->outBeginp(); edgep; edgep = edgep->outNextp()) { in unblockDeps()
208 for (V3GraphEdge* edgep = vertexp->inBeginp(); edgep; edgep = edgep->inNextp()) { in unblockDeps()
H A DV3Split.cpp300 m_stmtStackps.push_back(vertexp); in scoreboardPushStmt()
302 nodep->user3p(vertexp); in scoreboardPushStmt()
321 for (V3GraphVertex* vertexp = m_graph.verticesBeginp(); vertexp; in pruneDepsOnInputs() local
322 vertexp = vertexp->verticesNextp()) { in pruneDepsOnInputs()
323 if (!vertexp->outBeginp() && dynamic_cast<SplitVarStdVertex*>(vertexp)) { in pruneDepsOnInputs()
478 for (V3GraphVertex* vertexp = m_graph.verticesBeginp(); vertexp; in cleanupBlockGraph() local
479 vertexp = vertexp->verticesNextp()) { in cleanupBlockGraph()
654 const SplitLogicVertex* const vertexp in trackNode() local
656 const uint32_t color = vertexp->color(); in trackNode()
874 for (V3GraphVertex* vertexp = m_graph.verticesBeginp(); vertexp; in colorAlwaysGraph() local
[all …]
H A DV3Gate.cpp351 if (!vertexp) { in makeVarVertex()
354 varscp->user1p(vertexp); in makeVarVertex()
362 vertexp->setIsTop(); in makeVarVertex()
364 vertexp->setConsumed("isTop"); in makeVarVertex()
368 return vertexp; in makeVarVertex()
747 for (V3GraphVertex* vertexp = m_graph.verticesBeginp(); vertexp; in consumedMark() local
748 vertexp = vertexp->verticesNextp()) { in consumedMark()
756 vertexp->user(true); in consumedMarkRecurse()
757 if (!vertexp->consumed()) vertexp->setConsumed("propagated"); in consumedMarkRecurse()
768 for (V3GraphVertex* vertexp = m_graph.verticesBeginp(); vertexp; in consumedMove() local
[all …]
H A DV3GraphPathChecker.cpp77 while (const V3GraphVertex* const vertexp = order.nextp()) { in initHalfCriticalPaths() local
79 for (V3GraphEdge* edgep = vertexp->beginp(rev); edgep; edgep = edgep->nextp(rev)) { in initHalfCriticalPaths()
87 GraphPCNode* const ourUserp = static_cast<GraphPCNode*>(vertexp->userp()); in initHalfCriticalPaths()
89 UASSERT_OBJ(ourUserp->m_cp[way] == critPathCost, vertexp, in initHalfCriticalPaths()
H A DV3Graph.h91 double orderDFSIterate(V3GraphVertex* vertexp);
92 void dumpEdge(std::ostream& os, V3GraphVertex* vertexp, V3GraphEdge* edgep);
157 void reportLoops(V3EdgeFuncP edgeFuncp, V3GraphVertex* vertexp);
160 void subtreeLoops(V3EdgeFuncP edgeFuncp, V3GraphVertex* vertexp, V3Graph* loopGraphp);
172 virtual void loopsMessageCb(V3GraphVertex* vertexp);
173 virtual void loopsVertexCb(V3GraphVertex* vertexp);
262 std::ostream& operator<<(std::ostream& os, V3GraphVertex* vertexp);
H A DV3Active.cpp85 static LatchDetectGraphVertex* castVertexp(void* vertexp) { in castVertexp() argument
86 return reinterpret_cast<LatchDetectGraphVertex*>(vertexp); in castVertexp()
96 bool latchCheckInternal(LatchDetectGraphVertex* vertexp) { in latchCheckInternal() argument
98 switch (vertexp->type()) { in latchCheckInternal()
100 result = vertexp->user(); in latchCheckInternal()
103 for (V3GraphEdge* edgep = vertexp->outBeginp(); edgep; edgep = edgep->outNextp()) { in latchCheckInternal()
112 LatchDetectGraphVertex* const ifp = castVertexp(vertexp->outBeginp()->top()); in latchCheckInternal()
114 = castVertexp(vertexp->outBeginp()->outNextp()->top()); in latchCheckInternal()
118 vertexp->user(result); in latchCheckInternal()
H A DV3Trace.cpp771 TraceCFuncVertex* vertexp in getCFuncVertexp() local
773 if (!vertexp) { in getCFuncVertexp()
774 vertexp = new TraceCFuncVertex(&m_graph, nodep); in getCFuncVertexp()
775 nodep->user1p(vertexp); in getCFuncVertexp()
777 return vertexp; in getCFuncVertexp()
780 TraceActivityVertex* vertexp in getActivityVertexp() local
782 if (!vertexp) { in getActivityVertexp()
784 nodep->user3p(vertexp); in getActivityVertexp()
786 vertexp->slow(slow); in getActivityVertexp()
787 return vertexp; in getActivityVertexp()
[all …]
H A DV3Tristate.cpp143 TristateVertex* vertexp = reinterpret_cast<TristateVertex*>(nodep->user5p()); in makeVertex() local
144 if (!vertexp) { in makeVertex()
146 vertexp = new TristateVertex(&m_graph, nodep); in makeVertex()
147 nodep->user5p(vertexp); in makeVertex()
149 return vertexp; in makeVertex()
243 const TristateVertex* const vertexp = reinterpret_cast<TristateVertex*>(nodep->user5p()); in isTristate() local
244 return vertexp && vertexp->isTristate(); in isTristate()
248 return vertexp && vertexp->feedsTri(); in feedsTri()
251 TristateVertex* const vertexp = reinterpret_cast<TristateVertex*>(nodep->user5p()); in didProcess() local
252 if (!vertexp) { in didProcess()
[all …]
/dports/games/libretro-yabause/yabause-ea5b118/yabause/src/
H A Dyglshaderes.c161 glEnableVertexAttribArray(vertexp); in ShaderDrawTest()
1251 current->vertexp = 0; in YglProgramChange()
1262 current->vertexp = 0; in YglProgramChange()
1272 current->vertexp = 0; in YglProgramChange()
1283 current->vertexp = 0; in YglProgramChange()
1293 current->vertexp = 0; in YglProgramChange()
1303 current->vertexp = 0; in YglProgramChange()
1313 current->vertexp = 0; in YglProgramChange()
1324 current->vertexp = 0; in YglProgramChange()
1341 current->vertexp = 0; in YglProgramChange()
[all …]
/dports/math/octave/octave-6.4.0/libinterp/dldfcn/
H A Dconvhulln.cc234 vertexT *vertex, **vertexp;
245 vertexT *vertex, **vertexp;
252 vertexT *vertex, **vertexp;
/dports/devel/tokamak/tokamak_release/tools/adjacency/
H A Dadjacency.cpp224 vertexT *vertex, **vertexp; in main() local
417 vertexT * vertex, **vertexp; in main() local
469 vertexT * vertex, ** vertexp; in main() local
543 vertexT * vertex, ** vertexp; in main() local
572 vertexT * vertex, ** vertexp; in main() local
/dports/science/berkeleygw/BGW-2.0.0/Common/qhull/
H A Dmerge.c492 vertexT *vertex, **vertexp; in qh_checkzero() local
648 vertexT *vertex, **vertexp; in qh_degen_redundant_facet() local
704 vertexT *vertex, **vertexp; in qh_degen_redundant_neighbors() local
774 vertexT *vertex, **vertexp; in qh_find_newvertex() local
1584 vertexT *vertex, **vertexp; in qh_merge_degenredundant() local
2268 vertexT *vertex, **vertexp; in qh_mergefacet() local
2542 vertexT *vertex, **vertexp; in qh_mergeridges() local
2746 vertexT *vertex, **vertexp; in qh_mergevertex_neighbors() local
2883 vertexT *vertex, **vertexp; in qh_newvertices() local
2924 vertexT *vertex, **vertexp; in qh_reducevertices() local
[all …]
/dports/science/afni/afni-AFNI_21.3.16/src/qhulldir/
H A Dmerge.c492 vertexT *vertex, **vertexp; in qh_checkzero() local
648 vertexT *vertex, **vertexp; in qh_degen_redundant_facet() local
704 vertexT *vertex, **vertexp; in qh_degen_redundant_neighbors() local
774 vertexT *vertex, **vertexp; in qh_find_newvertex() local
1584 vertexT *vertex, **vertexp; in qh_merge_degenredundant() local
2268 vertexT *vertex, **vertexp; in qh_mergefacet() local
2542 vertexT *vertex, **vertexp; in qh_mergeridges() local
2746 vertexT *vertex, **vertexp; in qh_mergevertex_neighbors() local
2883 vertexT *vertex, **vertexp; in qh_newvertices() local
2924 vertexT *vertex, **vertexp; in qh_reducevertices() local
[all …]
/dports/math/py-matplotlib2/matplotlib-2.2.4/extern/libqhull/
H A Dmerge.c492 vertexT *vertex, **vertexp; in qh_checkzero() local
648 vertexT *vertex, **vertexp; in qh_degen_redundant_facet() local
704 vertexT *vertex, **vertexp; in qh_degen_redundant_neighbors() local
774 vertexT *vertex, **vertexp; in qh_find_newvertex() local
1589 vertexT *vertex, **vertexp; in qh_merge_degenredundant() local
2273 vertexT *vertex, **vertexp; in qh_mergefacet() local
2547 vertexT *vertex, **vertexp; in qh_mergeridges() local
2751 vertexT *vertex, **vertexp; in qh_mergevertex_neighbors() local
2888 vertexT *vertex, **vertexp; in qh_newvertices() local
2929 vertexT *vertex, **vertexp; in qh_reducevertices() local
[all …]
/dports/cad/meshlab/meshlab-Meshlab-2020.05/src/external/qhull-2003.1/src/
H A Dmerge.c490 vertexT *vertex, **vertexp; in qh_checkzero() local
646 vertexT *vertex, **vertexp; in qh_degen_redundant_facet() local
702 vertexT *vertex, **vertexp; in qh_degen_redundant_neighbors() local
772 vertexT *vertex, **vertexp; in qh_find_newvertex() local
1580 vertexT *vertex, **vertexp; in qh_merge_degenredundant() local
2264 vertexT *vertex, **vertexp; in qh_mergefacet() local
2538 vertexT *vertex, **vertexp; in qh_mergeridges() local
2742 vertexT *vertex, **vertexp; in qh_mergevertex_neighbors() local
2879 vertexT *vertex, **vertexp; in qh_newvertices() local
2920 vertexT *vertex, **vertexp; in qh_reducevertices() local
[all …]
/dports/math/libmesh/libmesh-1.6.2/contrib/qhull/2012.1/src/libqhull/
H A Dmerge.c492 vertexT *vertex, **vertexp; in qh_checkzero() local
648 vertexT *vertex, **vertexp; in qh_degen_redundant_facet() local
704 vertexT *vertex, **vertexp; in qh_degen_redundant_neighbors() local
774 vertexT *vertex, **vertexp; in qh_find_newvertex() local
1584 vertexT *vertex, **vertexp; in qh_merge_degenredundant() local
2268 vertexT *vertex, **vertexp; in qh_mergefacet() local
2542 vertexT *vertex, **vertexp; in qh_mergeridges() local
2746 vertexT *vertex, **vertexp; in qh_mergevertex_neighbors() local
2883 vertexT *vertex, **vertexp; in qh_newvertices() local
2924 vertexT *vertex, **vertexp; in qh_reducevertices() local
[all …]
/dports/graphics/py-gdal/gdal-3.3.3/alg/internal_libqhull/
H A Dmerge.c492 vertexT *vertex, **vertexp; in qh_checkzero() local
648 vertexT *vertex, **vertexp; in qh_degen_redundant_facet() local
704 vertexT *vertex, **vertexp; in qh_degen_redundant_neighbors() local
774 vertexT *vertex, **vertexp; in qh_find_newvertex() local
1584 vertexT *vertex, **vertexp; in qh_merge_degenredundant() local
2268 vertexT *vertex, **vertexp; in qh_mergefacet() local
2542 vertexT *vertex, **vertexp; in qh_mergeridges() local
2746 vertexT *vertex, **vertexp; in qh_mergevertex_neighbors() local
2883 vertexT *vertex, **vertexp; in qh_newvertices() local
2924 vertexT *vertex, **vertexp; in qh_reducevertices() local
[all …]
/dports/cad/PrusaSlicer/PrusaSlicer-version_2.3.3/src/qhull/src/libqhull/
H A Dmerge.c492 vertexT *vertex, **vertexp; in qh_checkzero() local
648 vertexT *vertex, **vertexp; in qh_degen_redundant_facet() local
704 vertexT *vertex, **vertexp; in qh_degen_redundant_neighbors() local
774 vertexT *vertex, **vertexp; in qh_find_newvertex() local
1589 vertexT *vertex, **vertexp; in qh_merge_degenredundant() local
2273 vertexT *vertex, **vertexp; in qh_mergefacet() local
2547 vertexT *vertex, **vertexp; in qh_mergeridges() local
2751 vertexT *vertex, **vertexp; in qh_mergevertex_neighbors() local
2888 vertexT *vertex, **vertexp; in qh_newvertices() local
2929 vertexT *vertex, **vertexp; in qh_reducevertices() local
[all …]
/dports/math/py-pyhull/pyhull-2015.2.1/src/libqhull/
H A Dmerge.c492 vertexT *vertex, **vertexp; in qh_checkzero() local
648 vertexT *vertex, **vertexp; in qh_degen_redundant_facet() local
704 vertexT *vertex, **vertexp; in qh_degen_redundant_neighbors() local
774 vertexT *vertex, **vertexp; in qh_find_newvertex() local
1589 vertexT *vertex, **vertexp; in qh_merge_degenredundant() local
2273 vertexT *vertex, **vertexp; in qh_mergefacet() local
2547 vertexT *vertex, **vertexp; in qh_mergeridges() local
2751 vertexT *vertex, **vertexp; in qh_mergevertex_neighbors() local
2888 vertexT *vertex, **vertexp; in qh_newvertices() local
2929 vertexT *vertex, **vertexp; in qh_reducevertices() local
[all …]
/dports/graphics/p5-Geo-GDAL/gdal-3.3.3/alg/internal_libqhull/
H A Dmerge.c492 vertexT *vertex, **vertexp; in qh_checkzero() local
648 vertexT *vertex, **vertexp; in qh_degen_redundant_facet() local
704 vertexT *vertex, **vertexp; in qh_degen_redundant_neighbors() local
774 vertexT *vertex, **vertexp; in qh_find_newvertex() local
1584 vertexT *vertex, **vertexp; in qh_merge_degenredundant() local
2268 vertexT *vertex, **vertexp; in qh_mergefacet() local
2542 vertexT *vertex, **vertexp; in qh_mergeridges() local
2746 vertexT *vertex, **vertexp; in qh_mergevertex_neighbors() local
2883 vertexT *vertex, **vertexp; in qh_newvertices() local
2924 vertexT *vertex, **vertexp; in qh_reducevertices() local
[all …]

123456789