Home
last modified time | relevance | path

Searched refs:pGraph (Results 1 – 25 of 466) sorted by relevance

12345678910>>...19

/dports/cad/abc/abc-a4518e6f833885c905964f1233d11e5b941ec24c/src/bool/dec/
H A Ddec.h102 …for ( i = (pGraph)->nLeaves; (i < (pGraph)->nSize) && (((pAnd) = Dec_GraphNode(pGraph, i)), 1); i+…
229 pGraph->pNodes = ABC_ALLOC( Dec_Node_t, pGraph->nCap ); in Dec_GraphCreate()
342 return pGraph->fConst && pGraph->eRoot.fCompl; in Dec_GraphIsConst0()
358 return pGraph->fConst && !pGraph->eRoot.fCompl; in Dec_GraphIsConst1()
423 return pGraph->nSize - pGraph->nLeaves; in Dec_GraphNodeNum()
455 return pGraph->pNodes + pGraph->nSize - 1; in Dec_GraphNodeLast()
520 return Dec_GraphNode( pGraph, pGraph->eRoot.Node ); in Dec_GraphVar()
570 if ( pGraph->nSize == pGraph->nCap ) in Dec_GraphAppendNode()
572 pGraph->pNodes = ABC_REALLOC( Dec_Node_t, pGraph->pNodes, 2 * pGraph->nCap ); in Dec_GraphAppendNode()
573 pGraph->nCap = 2 * pGraph->nCap; in Dec_GraphAppendNode()
[all …]
H A DdecUtil.c57 assert( Dec_GraphLeaveNum(pGraph) >= 0 ); in Dec_GraphDeriveBdd()
58 assert( Dec_GraphLeaveNum(pGraph) <= pGraph->nSize ); in Dec_GraphDeriveBdd()
61 if ( Dec_GraphIsConst(pGraph) ) in Dec_GraphDeriveBdd()
64 if ( Dec_GraphIsVar(pGraph) ) in Dec_GraphDeriveBdd()
65 … return Cudd_NotCond( Cudd_bddIthVar(dd, Dec_GraphVarInt(pGraph)), Dec_GraphIsComplement(pGraph) ); in Dec_GraphDeriveBdd()
68 Dec_GraphForEachLeaf( pGraph, pNode, i ) in Dec_GraphDeriveBdd()
72 Dec_GraphForEachNode( pGraph, pNode, i ) in Dec_GraphDeriveBdd()
112 assert( Dec_GraphLeaveNum(pGraph) <= pGraph->nSize ); in Dec_GraphDeriveTruth()
116 if ( Dec_GraphIsConst(pGraph) ) in Dec_GraphDeriveTruth()
119 if ( Dec_GraphIsVar(pGraph) ) in Dec_GraphDeriveTruth()
[all …]
H A DdecAbc.c52 if ( Dec_GraphIsConst(pGraph) ) in Dec_GraphToNetwork()
55 if ( Dec_GraphIsVar(pGraph) ) in Dec_GraphToNetwork()
56 … return Abc_ObjNotCond( (Abc_Obj_t *)Dec_GraphVar(pGraph)->pFunc, Dec_GraphIsComplement(pGraph) ); in Dec_GraphToNetwork()
133 if ( Dec_GraphIsConst(pGraph) ) in Dec_GraphToNetworkNoStrash()
136 if ( Dec_GraphIsVar(pGraph) ) in Dec_GraphToNetworkNoStrash()
174 if ( Dec_GraphIsConst(pGraph) || Dec_GraphIsVar(pGraph) ) in Dec_GraphToNetworkCount()
274 if ( Dec_GraphIsConst(pGraph) ) in Dec_GraphToNetworkAig()
277 if ( Dec_GraphIsVar(pGraph) ) in Dec_GraphToNetworkAig()
278 … return Hop_NotCond( (Hop_Obj_t *)Dec_GraphVar(pGraph)->pFunc, Dec_GraphIsComplement(pGraph) ); in Dec_GraphToNetworkAig()
335 if ( Dec_GraphIsConst(pGraph) ) in Dec_GraphToNetworkIvy()
[all …]
H A DdecPrint.c65 for ( i = 0; i < Dec_GraphLeaveNum(pGraph); i++ ) in Dec_GraphPrint()
75 if ( Dec_GraphIsConst(pGraph) ) // constant in Dec_GraphPrint()
80 else if ( Dec_GraphIsVar(pGraph) ) // literal in Dec_GraphPrint()
83 …Dec_GraphPrintGetLeafName( pFile, Dec_GraphVarInt(pGraph), Dec_GraphIsComplement(pGraph), pNamesIn… in Dec_GraphPrint()
88 …Dec_GraphPrint_rec( pFile, pGraph, Dec_GraphNodeLast(pGraph), Dec_GraphIsComplement(pGraph), pName… in Dec_GraphPrint()
110 pNode0 = Dec_GraphNode(pGraph, pNode->eEdge0.Node); in Dec_GraphPrint2_rec()
111 pNode1 = Dec_GraphNode(pGraph, pNode->eEdge1.Node); in Dec_GraphPrint2_rec()
112 if ( Dec_GraphNodeIsVar(pGraph, pNode) ) // FT_NODE_LEAF ) in Dec_GraphPrint2_rec()
175 pNode0 = Dec_GraphNode(pGraph, pNode->eEdge0.Node); in Dec_GraphPrint_rec()
176 pNode1 = Dec_GraphNode(pGraph, pNode->eEdge1.Node); in Dec_GraphPrint_rec()
[all …]
/dports/cad/abc/abc-a4518e6f833885c905964f1233d11e5b941ec24c/src/bool/deco/
H A Ddeco.h102 …for ( i = (pGraph)->nLeaves; (i < (pGraph)->nSize) && (((pAnd) = Dec_GraphNode(pGraph, i)), 1); i+…
218 pGraph->pNodes = ABC_ALLOC( Dec_Node_t, pGraph->nCap ); in Dec_GraphCreate()
331 return pGraph->fConst && pGraph->eRoot.fCompl; in Dec_GraphIsConst0()
347 return pGraph->fConst && !pGraph->eRoot.fCompl; in Dec_GraphIsConst1()
412 return pGraph->nSize - pGraph->nLeaves; in Dec_GraphNodeNum()
444 return pGraph->pNodes + pGraph->nSize - 1; in Dec_GraphNodeLast()
509 return Dec_GraphNode( pGraph, pGraph->eRoot.Node ); in Dec_GraphVar()
559 if ( pGraph->nSize == pGraph->nCap ) in Dec_GraphAppendNode()
561 pGraph->pNodes = ABC_REALLOC( Dec_Node_t, pGraph->pNodes, 2 * pGraph->nCap ); in Dec_GraphAppendNode()
562 pGraph->nCap = 2 * pGraph->nCap; in Dec_GraphAppendNode()
[all …]
/dports/math/stp/stp-2.3.3/lib/extlib-abc/aig/kit/
H A DkitGraph.c68 pGraph->pNodes = ALLOC( Kit_Node_t, pGraph->nCap ); in Kit_GraphCreate()
69 memset( pGraph->pNodes, 0, sizeof(Kit_Node_t) * pGraph->nSize ); in Kit_GraphCreate()
70 return pGraph; in Kit_GraphCreate()
91 return pGraph; in Kit_GraphCreateConst0()
111 return pGraph; in Kit_GraphCreateConst1()
132 return pGraph; in Kit_GraphCreateLeaf()
166 if ( pGraph->nSize == pGraph->nCap ) in Kit_GraphAppendNode()
168 pGraph->pNodes = REALLOC( Kit_Node_t, pGraph->pNodes, 2 * pGraph->nCap ); in Kit_GraphAppendNode()
169 pGraph->nCap = 2 * pGraph->nCap; in Kit_GraphAppendNode()
171 pNode = pGraph->pNodes + pGraph->nSize++; in Kit_GraphAppendNode()
[all …]
H A DkitAig.c67 if ( Kit_GraphIsConst(pGraph) ) in Kit_GraphToAigInternal()
70 if ( Kit_GraphIsVar(pGraph) ) in Kit_GraphToAigInternal()
71 return Aig_NotCond( Kit_GraphVar(pGraph)->pFunc, Kit_GraphIsComplement(pGraph) ); in Kit_GraphToAigInternal()
73 Kit_GraphForEachNode( pGraph, pNode, i ) in Kit_GraphToAigInternal()
99 Kit_GraphForEachLeaf( pGraph, pNode, i ) in Kit_GraphToAig()
102 return Kit_GraphToAigInternal( pMan, pGraph ); in Kit_GraphToAig()
120 Kit_Graph_t * pGraph;
125 pGraph = Kit_TruthToGraph( pTruth, nVars, vMemory );
129 pGraph = Kit_TruthToGraph( pTruth, nVars, vMemory );
131 pObj = Kit_GraphToAig( pMan, pFanins, pGraph );
[all …]
/dports/cad/abc/abc-a4518e6f833885c905964f1233d11e5b941ec24c/src/bool/kit/
H A DkitGraph.c53 pGraph->pNodes = ABC_ALLOC( Kit_Node_t, pGraph->nCap ); in Kit_GraphCreate()
54 memset( pGraph->pNodes, 0, sizeof(Kit_Node_t) * pGraph->nSize ); in Kit_GraphCreate()
55 return pGraph; in Kit_GraphCreate()
76 return pGraph; in Kit_GraphCreateConst0()
96 return pGraph; in Kit_GraphCreateConst1()
117 return pGraph; in Kit_GraphCreateLeaf()
151 if ( pGraph->nSize == pGraph->nCap ) in Kit_GraphAppendNode()
153 pGraph->pNodes = ABC_REALLOC( Kit_Node_t, pGraph->pNodes, 2 * pGraph->nCap ); in Kit_GraphAppendNode()
154 pGraph->nCap = 2 * pGraph->nCap; in Kit_GraphAppendNode()
156 pNode = pGraph->pNodes + pGraph->nSize++; in Kit_GraphAppendNode()
[all …]
H A DkitHop.c56 return Abc_LitNotCond( Kit_GraphVar(pGraph)->iFunc, Kit_GraphIsComplement(pGraph) ); in Kit_GraphToGiaInternal()
83 Kit_Graph_t * pGraph; in Kit_TruthToGia() local
93 if ( pGraph == NULL ) in Kit_TruthToGia()
100 Kit_GraphFree( pGraph ); in Kit_TruthToGia()
106 Kit_Graph_t * pGraph; in Kit_TruthToGia2() local
116 if ( pGraph == NULL ) in Kit_TruthToGia2()
124 Kit_GraphFree( pGraph ); in Kit_TruthToGia2()
173 Kit_Graph_t * pGraph; in Kit_TruthToHop() local
183 if ( pGraph == NULL ) in Kit_TruthToHop()
190 Kit_GraphFree( pGraph ); in Kit_TruthToHop()
[all …]
H A DkitAig.c52 if ( Kit_GraphIsConst(pGraph) ) in Kit_GraphToAigInternal()
55 if ( Kit_GraphIsVar(pGraph) ) in Kit_GraphToAigInternal()
56 … return Aig_NotCond( (Aig_Obj_t *)Kit_GraphVar(pGraph)->pFunc, Kit_GraphIsComplement(pGraph) ); in Kit_GraphToAigInternal()
58 Kit_GraphForEachNode( pGraph, pNode, i ) in Kit_GraphToAigInternal()
84 Kit_GraphForEachLeaf( pGraph, pNode, i ) in Kit_GraphToAig()
87 return Kit_GraphToAigInternal( pMan, pGraph ); in Kit_GraphToAig()
104 Kit_Graph_t * pGraph; in Kit_TruthToAig() local
109 pGraph = Kit_TruthToGraph( pTruth, nVars, vMemory ); in Kit_TruthToAig()
113 pGraph = Kit_TruthToGraph( pTruth, nVars, vMemory ); in Kit_TruthToAig()
115 pObj = Kit_GraphToAig( pMan, pFanins, pGraph ); in Kit_TruthToAig()
[all …]
H A Dkit.h206 …nt Kit_GraphIsConst0( Kit_Graph_t * pGraph ) { return pGraph->fConst… in Kit_GraphIsConst0() argument
207 …t Kit_GraphIsConst1( Kit_Graph_t * pGraph ) { return pGraph->fConst … in Kit_GraphIsConst1() argument
209 … Kit_GraphIsVar( Kit_Graph_t * pGraph ) { return pGraph->eRoot.Node … in Kit_GraphIsVar() argument
213 …int Kit_GraphNodeNum( Kit_Graph_t * pGraph ) { return pGraph->nSize… in Kit_GraphNodeNum() argument
215 …it_Node_t * Kit_GraphNodeLast( Kit_Graph_t * pGraph ) { return pGraph->pNodes… in Kit_GraphNodeLast() argument
217 … Kit_GraphNodeIsVar( Kit_Graph_t * pGraph, Kit_Node_t * pNode ) { return Kit_GraphNodeInt(pGrap… in Kit_GraphNodeIsVar() argument
218 …hVar( Kit_Graph_t * pGraph ) { assert( Kit_GraphIsVar( pGraph ) ); re… in Kit_GraphVar() argument
219 …Kit_Graph_t * pGraph ) { assert( Kit_GraphIsVar( pGraph ) ); return Kit_… in Kit_GraphVarInt() argument
220 …hNodeFanin0( Kit_Graph_t * pGraph, Kit_Node_t * pNode ){ return Kit_GraphNodeIsVar(pGraph, pNode)?… in Kit_GraphNodeFanin0() argument
506 for ( i = 0; (i < (pGraph)->nLeaves) && (((pLeaf) = Kit_GraphNode(pGraph, i)), 1); i++ )
[all …]
H A DkitBdd.c96 DdNode * Kit_GraphToBdd( DdManager * dd, Kit_Graph_t * pGraph ) in Kit_GraphToBdd() argument
103 assert( Kit_GraphLeaveNum(pGraph) >= 0 ); in Kit_GraphToBdd()
104 assert( Kit_GraphLeaveNum(pGraph) <= pGraph->nSize ); in Kit_GraphToBdd()
107 if ( Kit_GraphIsConst(pGraph) ) in Kit_GraphToBdd()
108 return Cudd_NotCond( b1, Kit_GraphIsComplement(pGraph) ); in Kit_GraphToBdd()
110 if ( Kit_GraphIsVar(pGraph) ) in Kit_GraphToBdd()
111 … return Cudd_NotCond( Cudd_bddIthVar(dd, Kit_GraphVarInt(pGraph)), Kit_GraphIsComplement(pGraph) ); in Kit_GraphToBdd()
114 Kit_GraphForEachLeaf( pGraph, pNode, i ) in Kit_GraphToBdd()
118 Kit_GraphForEachNode( pGraph, pNode, i ) in Kit_GraphToBdd()
127 Kit_GraphForEachNode( pGraph, pNode, i ) in Kit_GraphToBdd()
[all …]
/dports/databases/grass7/grass-7.8.6/lib/vector/dglib/
H A Dgraph.c57 if (pGraph == NULL) { in dglInitialize()
215 pGraph->iErrno = 0; in dglNodeGet_Id()
236 pGraph->iErrno = 0; in dglNodeGet_Status()
303 pGraph->iErrno = 0; in dglNodeGet_InDegree()
333 pGraph->iErrno = 0; in dglNodeGet_OutDegree()
371 pGraph->iErrno = 0; in dglNodeGet_Valence()
400 pGraph->iErrno = 0; in dglEdgesetGet_EdgeCount()
420 pGraph->iErrno = 0; in dglEdgeGet_Cost()
440 pGraph->iErrno = 0; in dglEdgeGet_Id()
460 pGraph->iErrno = 0; in dglEdgeGet_Head()
[all …]
H A Dgraph.h250 dglGraph_s *pGraph; member
260 dglGraph_s *pGraph; member
271 dglGraph_s *pGraph; member
313 int dglRelease(dglGraph_s * pGraph);
314 int dglUnflatten(dglGraph_s * pGraph);
315 int dglFlatten(dglGraph_s * pGraph);
322 int dglAddNode(dglGraph_s * pGraph,
354 int dglAddEdge(dglGraph_s * pGraph,
358 int dglAddEdgeX(dglGraph_s * pGraph,
483 dglGraph_s * pGraph);
[all …]
H A Dmisc-template.c31 return -pGraph->iErrno; in DGL_EDGE_T_INITIALIZE_FUNC()
37 return -pGraph->iErrno; in DGL_EDGE_T_INITIALIZE_FUNC()
52 return -pGraph->iErrno; in DGL_EDGE_T_INITIALIZE_FUNC()
65 pT->pGraph = pGraph; in DGL_EDGE_T_INITIALIZE_FUNC()
89 dglGraph_s *pG = pT->pGraph; in DGL_EDGE_T_FIRST_FUNC()
137 dglGraph_s *pG = pT->pGraph; in DGL_EDGE_T_NEXT_FUNC()
192 return -pGraph->iErrno; in DGL_NODE_T_INITIALIZE_FUNC()
197 pT->pGraph = pGraph; in DGL_NODE_T_INITIALIZE_FUNC()
221 if (pT->pGraph->cNode > 0) in DGL_NODE_T_FIRST_FUNC()
243 pT->pGraph->iNodeBuffer)) in DGL_NODE_T_NEXT_FUNC()
[all …]
/dports/deskutils/cairo-dock/cairo-dock-core-3.4.1/src/implementations/
H A Dcairo-dock-graph.c85 if (! pGraph->bMixGraphs) in render()
105 pGraph->fLowColor[3*i+0], in render()
109 switch (pGraph->iType) in render()
346 …) (((pGraph->fLowColor[i] < pGraph->fHighColor[i] && pGraph->fLowColor[i] > dc) || pGraph->fLowCol…
402 if (pGraph->bMixGraphs) in _set_overlay_zones()
414 if (pGraph->fBackGroundColor[3] > .2 && pGraph->fBackGroundColor[3] < .7) in _set_overlay_zones()
458 pGraph->pGradationPatterns[i] = _cairo_dock_create_graph_pattern (pGraph, in load()
470 pGraph->iMargin, in load()
472 pGraph->iType, in load()
490 …pGraph->pBackgroundSurface = _cairo_dock_create_graph_background (iWidth, iHeight, pGraph->iMargin… in reload()
[all …]
/dports/cad/abc/abc-a4518e6f833885c905964f1233d11e5b941ec24c/src/base/abci/
H A DabcRestruct.c113 Dec_Graph_t * pGraph; in Abc_NtkRestructure() local
431 pGraph = NULL; in Abc_NodeRestructureCut()
441 if ( pGraph ) Dec_GraphFree( pGraph ); in Abc_NodeRestructureCut()
472 return pGraph; in Abc_NodeRestructureCut()
945 return pGraph; in Abc_NodeEvaluateDsd()
1266 assert(pGraph); in Abc_NodeMffcConstants()
1268 return pGraph; in Abc_NodeMffcConstants()
1402 if ( pGraph ) in Abc_NodeResubEval()
1411 if ( pGraph ) in Abc_NodeResubEval()
1422 if ( pGraph ) in Abc_NodeResubEval()
[all …]
/dports/math/stp/stp-2.3.3/lib/extlib-abc/
H A Dkit.h234 …nt Kit_GraphIsConst0( Kit_Graph_t * pGraph ) { return pGraph->fConst… in Kit_GraphIsConst0() argument
235 …t Kit_GraphIsConst1( Kit_Graph_t * pGraph ) { return pGraph->fConst … in Kit_GraphIsConst1() argument
237 … Kit_GraphIsVar( Kit_Graph_t * pGraph ) { return pGraph->eRoot.bits.Nod… in Kit_GraphIsVar() argument
241 …int Kit_GraphNodeNum( Kit_Graph_t * pGraph ) { return pGraph->nSize… in Kit_GraphNodeNum() argument
243 …it_Node_t * Kit_GraphNodeLast( Kit_Graph_t * pGraph ) { return pGraph->pNodes… in Kit_GraphNodeLast() argument
245 … Kit_GraphNodeIsVar( Kit_Graph_t * pGraph, Kit_Node_t * pNode ) { return Kit_GraphNodeInt(pGrap… in Kit_GraphNodeIsVar() argument
246 …hVar( Kit_Graph_t * pGraph ) { assert( Kit_GraphIsVar( pGraph ) ); re… in Kit_GraphVar() argument
247 …Kit_Graph_t * pGraph ) { assert( Kit_GraphIsVar( pGraph ) ); return Kit_… in Kit_GraphVarInt() argument
250 … Kit_GraphRootLevel( Kit_Graph_t * pGraph ) { return Kit_GraphNode(pGr… in Kit_GraphRootLevel() argument
500 for ( i = 0; (i < (pGraph)->nLeaves) && (((pLeaf) = Kit_GraphNode(pGraph, i)), 1); i++ )
[all …]
/dports/cad/abc/abc-a4518e6f833885c905964f1233d11e5b941ec24c/src/opt/rwr/
H A DrwrDec.c51 Dec_Graph_t * pGraph; in Rwr_ManPreprocess() local
74 pGraph = Rwr_NodePreprocess( p, pNode ); in Rwr_ManPreprocess()
75 pNode->pNext = (Rwr_Node_t *)pGraph; in Rwr_ManPreprocess()
93 Dec_Graph_t * pGraph; in Rwr_NodePreprocess() local
103 pGraph = Dec_GraphCreate( 4 ); in Rwr_NodePreprocess()
106 eRoot = Rwr_TravCollect_rec( p, pNode, pGraph ); in Rwr_NodePreprocess()
107 Dec_GraphSetRoot( pGraph, eRoot ); in Rwr_NodePreprocess()
108 return pGraph; in Rwr_NodePreprocess()
133 eNode0 = Rwr_TravCollect_rec( p, Rwr_Regular(pNode->p0), pGraph ); in Rwr_TravCollect_rec()
141 eNode = Dec_GraphAddNodeXor( pGraph, eNode0, eNode1, 0 ); in Rwr_TravCollect_rec()
[all …]
/dports/cad/abc/abc-a4518e6f833885c905964f1233d11e5b941ec24c/src/aig/ivy/
H A DivyRwr.c156 Dec_Graph_t * pGraph; in Ivy_NodeRewrite() local
240 p->pGraph = pGraph; in Ivy_NodeRewrite()
294 printf( "Cone = %d. ", p->pGraph? Dec_GraphNodeNum((Dec_Graph_t *)p->pGraph) : 0 ); in Ivy_NodeRewrite()
419 if ( Dec_GraphIsConst(pGraph) || Dec_GraphIsVar(pGraph) ) in Ivy_GraphToNetworkCount()
422 Dec_GraphForEachLeaf( pGraph, pNode, i ) in Ivy_GraphToNetworkCount()
426 Dec_GraphForEachNode( pGraph, pNode, i ) in Ivy_GraphToNetworkCount()
491 if ( Dec_GraphIsConst(pGraph) ) in Ivy_GraphToNetwork()
494 if ( Dec_GraphIsVar(pGraph) ) in Ivy_GraphToNetwork()
495 … return Ivy_NotCond( (Ivy_Obj_t *)Dec_GraphVar(pGraph)->pFunc, Dec_GraphIsComplement(pGraph) ); in Ivy_GraphToNetwork()
497 Dec_GraphForEachNode( pGraph, pNode, i ) in Ivy_GraphToNetwork()
[all …]
H A DivySeq.c148 Dec_Graph_t * pGraph; in Ivy_NodeRewriteSeq() local
230 p->pGraph = pGraph; in Ivy_NodeRewriteSeq()
292 printf( "Cone = %d. ", p->pGraph? Dec_GraphNodeNum((Dec_Graph_t *)p->pGraph) : 0 ); in Ivy_NodeRewriteSeq()
371 Dec_GraphForEachLeaf( pGraph, pNode, i ) in Ivy_GraphPrepare()
377 Dec_GraphForEachNode( pGraph, pNode, i ) in Ivy_GraphPrepare()
409 if ( Dec_GraphIsConst(pGraph) || Dec_GraphIsVar(pGraph) ) in Ivy_GraphToNetworkSeqCountSeq()
413 Dec_GraphForEachNode( pGraph, pNode, i ) in Ivy_GraphToNetworkSeqCountSeq()
483 if ( Dec_GraphIsConst(pGraph) ) in Ivy_GraphToNetworkSeq()
486 if ( Dec_GraphIsVar(pGraph) ) in Ivy_GraphToNetworkSeq()
489 pNode = Dec_GraphVar(pGraph); in Ivy_GraphToNetworkSeq()
[all …]
/dports/cad/abc/abc-a4518e6f833885c905964f1233d11e5b941ec24c/src/opt/rwt/
H A DrwtDec.c51 Dec_Graph_t * pGraph; in Rwt_ManPreprocess() local
74 pGraph = Rwt_NodePreprocess( p, pNode ); in Rwt_ManPreprocess()
75 pNode->pNext = (Rwt_Node_t *)pGraph; in Rwt_ManPreprocess()
93 Dec_Graph_t * pGraph; in Rwt_NodePreprocess() local
103 pGraph = Dec_GraphCreate( 4 ); in Rwt_NodePreprocess()
106 eRoot = Rwt_TravCollect_rec( p, pNode, pGraph ); in Rwt_NodePreprocess()
107 Dec_GraphSetRoot( pGraph, eRoot ); in Rwt_NodePreprocess()
108 return pGraph; in Rwt_NodePreprocess()
133 eNode0 = Rwt_TravCollect_rec( p, Rwt_Regular(pNode->p0), pGraph ); in Rwt_TravCollect_rec()
141 eNode = Dec_GraphAddNodeXor( pGraph, eNode0, eNode1, 0 ); in Rwt_TravCollect_rec()
[all …]
/dports/audio/lsp-plugins-lv2/lsp-plugins-1.1.31/src/ui/tk/widgets/
H A DLSPAudioSample.cpp55 pGraph = NULL; in LSPAudioSample()
118 if (pGraph != NULL) in destroy_data()
120 pGraph->destroy(); in destroy_data()
121 delete pGraph; in destroy_data()
122 pGraph = NULL; in destroy_data()
543 delete pGraph; in render_graph()
548 if (pGraph != NULL) in render_graph()
550 if ((w != ssize_t(pGraph->width())) || (h != ssize_t(pGraph->height()))) in render_graph()
559 if (pGraph == NULL) in render_graph()
575 pGraph->clear(color); in render_graph()
[all …]
H A DLSPAudioFile.cpp91 pGraph = NULL; in LSPAudioFile()
252 if (pGraph != NULL) in destroy_data()
255 delete pGraph; in destroy_data()
256 pGraph = NULL; in destroy_data()
569 if (pGraph != NULL) in render_graph()
571 if ((w != ssize_t(pGraph->width())) || (h != ssize_t(pGraph->height()))) in render_graph()
580 if (pGraph == NULL) in render_graph()
691 return pGraph; in render_graph()
761 if (pGraph != NULL) in hide()
764 delete pGraph; in hide()
[all …]
/dports/cad/abc/abc-a4518e6f833885c905964f1233d11e5b941ec24c/src/opt/lpk/
H A DlpkMap.c51 if ( Kit_GraphIsConst(pGraph) ) in Lpk_MapPrimeInternal()
54 if ( Kit_GraphIsVar(pGraph) ) in Lpk_MapPrimeInternal()
55 return (If_Obj_t *)Kit_GraphVar(pGraph)->pFunc; in Lpk_MapPrimeInternal()
57 Kit_GraphForEachNode( pGraph, pNode, i ) in Lpk_MapPrimeInternal()
81 Kit_Graph_t * pGraph; in Lpk_MapPrime() local
86 pGraph = Kit_TruthToGraph( pTruth, nVars, p->vCover ); in Lpk_MapPrime()
87 if ( pGraph == NULL ) in Lpk_MapPrime()
90 Kit_GraphForEachLeaf( pGraph, pNode, i ) in Lpk_MapPrime()
93 pRes = Lpk_MapPrimeInternal( p->pIfMan, pGraph ); in Lpk_MapPrime()
94 pRes = If_NotCond( pRes, Kit_GraphIsComplement(pGraph) ); in Lpk_MapPrime()
[all …]

12345678910>>...19