Home
last modified time | relevance | path

Searched refs:Kit_Edge_t (Results 1 – 5 of 5) sorted by relevance

/dports/cad/abc/abc-a4518e6f833885c905964f1233d11e5b941ec24c/src/bool/kit/
H A DkitFactor.c35 static Kit_Edge_t Kit_SopFactorTrivial( Kit_Graph_t * pFForm, Kit_Sop_t * cSop, int nLits );
36 static Kit_Edge_t Kit_SopFactorTrivialCube( Kit_Graph_t * pFForm, unsigned uCube, int nLits );
59 Kit_Edge_t eRoot; in Kit_SopFactor()
108 Kit_Edge_t Kit_SopFactor_rec( Kit_Graph_t * pFForm, Kit_Sop_t * cSop, int nLits, Vec_Int_t * vMemor… in Kit_SopFactor_rec()
112 Kit_Edge_t eNodeDiv, eNodeQuo, eNodeRem, eNodeAnd; in Kit_SopFactor_rec()
170 Kit_Edge_t eNodeDiv, eNodeQuo, eNodeRem, eNodeAnd; in Kit_SopFactorLF_rec()
201 Kit_Edge_t eNode1, eNode2; in Kit_SopFactorTrivialCube_rec()
247 Kit_Edge_t Kit_SopFactorTrivialCube( Kit_Graph_t * pFForm, unsigned uCube, int nLits ) in Kit_SopFactorTrivialCube()
263 Kit_Edge_t Kit_SopFactorTrivial_rec( Kit_Graph_t * pFForm, unsigned * pCubes, int nCubes, int nLits… in Kit_SopFactorTrivial_rec()
265 Kit_Edge_t eNode1, eNode2; in Kit_SopFactorTrivial_rec()
[all …]
H A DkitGraph.c172 Kit_Edge_t Kit_GraphAddNodeAnd( Kit_Graph_t * pGraph, Kit_Edge_t eEdge0, Kit_Edge_t eEdge1 ) in Kit_GraphAddNodeAnd()
196 Kit_Edge_t Kit_GraphAddNodeOr( Kit_Graph_t * pGraph, Kit_Edge_t eEdge0, Kit_Edge_t eEdge1 ) in Kit_GraphAddNodeOr()
224 Kit_Edge_t Kit_GraphAddNodeXor( Kit_Graph_t * pGraph, Kit_Edge_t eEdge0, Kit_Edge_t eEdge1, int Typ… in Kit_GraphAddNodeXor()
226 Kit_Edge_t eNode0, eNode1, eNode; in Kit_GraphAddNodeXor()
265 Kit_Edge_t Kit_GraphAddNodeMux( Kit_Graph_t * pGraph, Kit_Edge_t eEdgeC, Kit_Edge_t eEdgeT, Kit_Edg… in Kit_GraphAddNodeMux()
267 Kit_Edge_t eNode0, eNode1, eNode; in Kit_GraphAddNodeMux()
H A Dkit.h62 typedef struct Kit_Edge_t_ Kit_Edge_t; typedef
72 Kit_Edge_t eEdge0; // the left child of the node
73 Kit_Edge_t eEdge1; // the right child of the node
96 Kit_Edge_t eRoot; // the pointer to the topmost node
197 static inline Kit_Edge_t Kit_EdgeCreate( int Node, int fCompl ) { Kit_Edg… in Kit_EdgeCreate()
202 static inline unsigned Kit_EdgeToInt_( Kit_Edge_t m ) { union {… in Kit_EdgeToInt_()
203 static inline Kit_Edge_t Kit_IntToEdge_( unsigned m ) { union {… in Kit_IntToEdge_()
563 extern Kit_Edge_t Kit_GraphAddNodeAnd( Kit_Graph_t * pGraph, Kit_Edge_t eEdge0, Kit_Edge_t eEd…
564 extern Kit_Edge_t Kit_GraphAddNodeOr( Kit_Graph_t * pGraph, Kit_Edge_t eEdge0, Kit_Edge_t eEdg…
565 extern Kit_Edge_t Kit_GraphAddNodeXor( Kit_Graph_t * pGraph, Kit_Edge_t eEdge0, Kit_Edge_t eEd…
[all …]
/dports/math/stp/stp-2.3.3/lib/extlib-abc/aig/kit/
H A DkitGraph.c187 Kit_Edge_t Kit_GraphAddNodeAnd( Kit_Graph_t * pGraph, Kit_Edge_t eEdge0, Kit_Edge_t eEdge1 ) in Kit_GraphAddNodeAnd()
211 Kit_Edge_t Kit_GraphAddNodeOr( Kit_Graph_t * pGraph, Kit_Edge_t eEdge0, Kit_Edge_t eEdge1 ) in Kit_GraphAddNodeOr()
239 Kit_Edge_t Kit_GraphAddNodeXor( Kit_Graph_t * pGraph, Kit_Edge_t eEdge0, Kit_Edge_t eEdge1, int Typ… in Kit_GraphAddNodeXor()
241 Kit_Edge_t eNode0, eNode1, eNode; in Kit_GraphAddNodeXor()
280 Kit_Edge_t Kit_GraphAddNodeMux( Kit_Graph_t * pGraph, Kit_Edge_t eEdgeC, Kit_Edge_t eEdgeT, Kit_Edg… in Kit_GraphAddNodeMux()
282 Kit_Edge_t eNode0, eNode1, eNode; in Kit_GraphAddNodeMux()
/dports/math/stp/stp-2.3.3/lib/extlib-abc/
H A Dkit.h74 typedef union Kit_Edge_t_ Kit_Edge_t; typedef
87 Kit_Edge_t eEdge0; // the left child of the node
88 Kit_Edge_t eEdge1; // the right child of the node
110 Kit_Edge_t eRoot; // the pointer to the topmost node
227 static inline Kit_Edge_t Kit_EdgeCreate( int Node, int fCompl ) { Kit_Edg… in Kit_EdgeCreate()
228 static inline unsigned Kit_EdgeToInt( Kit_Edge_t eEdge ) { return … in Kit_EdgeToInt()
231 static inline Kit_Edge_t Kit_IntToEdge_( unsigned Edge ) { Kit_Edg… in Kit_IntToEdge_()
569 extern Kit_Edge_t Kit_GraphAddNodeAnd( Kit_Graph_t * pGraph, Kit_Edge_t eEdge0, Kit_Edge_t eEd…
570 extern Kit_Edge_t Kit_GraphAddNodeOr( Kit_Graph_t * pGraph, Kit_Edge_t eEdge0, Kit_Edge_t eEdg…
571 extern Kit_Edge_t Kit_GraphAddNodeXor( Kit_Graph_t * pGraph, Kit_Edge_t eEdge0, Kit_Edge_t eEd…
[all …]