Home
last modified time | relevance | path

Searched refs:nCubes (Results 1 – 25 of 92) sorted by relevance

1234

/dports/cad/abc/abc-a4518e6f833885c905964f1233d11e5b941ec24c/src/bool/kit/
H A DkitIsop.c78 if ( pcRes->nCubes == 0 || (pcRes->nCubes == 1 && pcRes->pCubes[0] == 0) ) in Kit_TruthIsop2()
96 …if ( pcRes->nCubes > pcRes2->nCubes || (pcRes->nCubes == pcRes2->nCubes && pcRes->nLits > pcRes2->… in Kit_TruthIsop2()
146 if ( pcRes->nCubes == 0 || (pcRes->nCubes == 1 && pcRes->pCubes[0] == 0) ) in Kit_TruthIsop()
160 …if ( pcRes->nCubes > pcRes2->nCubes || (pcRes->nCubes == pcRes2->nCubes && pcRes->nLits > pcRes2->… in Kit_TruthIsop()
228 pcRes->nCubes = -1; in Kit_TruthIsop_rec()
235 pcRes->nCubes = 0; in Kit_TruthIsop_rec()
243 pcRes->nCubes = 1; in Kit_TruthIsop_rec()
302 pcRes->nCubes = pcRes0->nCubes + pcRes1->nCubes + pcRes2->nCubes; in Kit_TruthIsop_rec()
354 pcRes->nCubes = 0; in Kit_TruthIsop5_rec()
361 pcRes->nCubes = 1; in Kit_TruthIsop5_rec()
[all …]
H A DkitSop.c50 cResult->nCubes = 0; in Kit_SopCreate()
71 int i, nCubes = Vec_IntSize(vInput); in Kit_SopCreateInverse() local
73 cResult->nCubes = 0; in Kit_SopCreateInverse()
77 for ( i = 0; i < nCubes; i++ ) in Kit_SopCreateInverse()
102 cResult->nCubes = 0; in Kit_SopDup()
153 vQuo->nCubes = 0; in Kit_SopDivideByCube()
155 vRem->nCubes = 0; in Kit_SopDivideByCube()
192 vQuo->nCubes = 0; in Kit_SopDivideInternal()
263 vRem->nCubes = 0; in Kit_SopDivideInternal()
353 cResult->nCubes = 0; in Kit_SopCommonCubeCover()
[all …]
H A DkitPla.c141 int nCubes = 0; in Kit_PlaGetCubeNum() local
145 nCubes += (*pCur == '\n'); in Kit_PlaGetCubeNum()
146 return nCubes; in Kit_PlaGetCubeNum()
211 char * Kit_PlaStart( void * p, int nCubes, int nVars ) in Kit_PlaStart() argument
217 Length = nCubes * (nVars + 3); in Kit_PlaStart()
222 for ( i = 0; i < nCubes; i++ ) in Kit_PlaStart()
498 int v, c, nCubes, fCompl = 0; in Kit_PlaToTruth() local
508 nCubes = strlen(pSop) / (nVars + 3); in Kit_PlaToTruth()
509 for ( c = 0; c < nCubes; c++ ) in Kit_PlaToTruth()
/dports/math/stp/stp-2.3.3/lib/extlib-abc/aig/kit/
H A DkitIsop.c91 if ( pcRes->nCubes == 0 || (pcRes->nCubes == 1 && pcRes->pCubes[0] == 0) ) in Kit_TruthIsop()
105 if ( pcRes->nCubes > pcRes2->nCubes ) in Kit_TruthIsop()
144 pcRes->nCubes = -1; in Kit_TruthIsop_rec()
150 pcRes->nCubes = 0; in Kit_TruthIsop_rec()
157 pcRes->nCubes = 1; in Kit_TruthIsop_rec()
194 pcRes->nCubes = -1; in Kit_TruthIsop_rec()
201 pcRes->nCubes = -1; in Kit_TruthIsop_rec()
215 pcRes->nCubes = pcRes0->nCubes + pcRes1->nCubes + pcRes2->nCubes; in Kit_TruthIsop_rec()
266 pcRes->nCubes = 0; in Kit_TruthIsop5_rec()
272 pcRes->nCubes = 1; in Kit_TruthIsop5_rec()
[all …]
H A DkitSop.c65 cResult->nCubes = 0; in Kit_SopCreate()
86 int i, nCubes = Vec_IntSize(vInput); in Kit_SopCreateInverse() local
88 cResult->nCubes = 0; in Kit_SopCreateInverse()
92 for ( i = 0; i < nCubes; i++ ) in Kit_SopCreateInverse()
117 cResult->nCubes = 0; in Kit_SopDup()
168 vQuo->nCubes = 0; in Kit_SopDivideByCube()
170 vRem->nCubes = 0; in Kit_SopDivideByCube()
205 vQuo->nCubes = 0; in Kit_SopDivideInternal()
276 vRem->nCubes = 0; in Kit_SopDivideInternal()
366 cResult->nCubes = 0; in Kit_SopCommonCubeCover()
[all …]
/dports/cad/abc/abc-a4518e6f833885c905964f1233d11e5b941ec24c/src/base/io/
H A DioReadPla.c119 Vec_BitFill( vMarks, nCubes, 0 ); in Io_ReadPlaMarkIdentical()
120 for ( c1 = 0; c1 < nCubes; c1++ ) in Io_ReadPlaMarkIdentical()
130 Vec_BitFill( vMarks, nCubes, 0 ); in Io_ReadPlaMarkContained()
131 for ( c1 = 0; c1 < nCubes; c1++ ) in Io_ReadPlaMarkContained()
248 for ( c = 1; c < nCubes; c++ ) in Io_ReadPlaCubeSetup()
260 assert( c == nCubes ); in Io_ReadPlaCubeSetup()
267 for ( c = 0; c < nCubes; c++ ) in Io_ReadPlaCubeSetdown()
296 nCubes = nCubesNew; in Io_ReadPlaCubePreprocess()
382 nCubes = 0; in Io_ReadPlaNetwork()
562 nCubes++; in Io_ReadPlaNetwork()
[all …]
H A DioReadPlaMo.c73 p->vCubes = Vec_IntAlloc( 2 * nCubes ); in Mop_ManAlloc()
74 p->vFree = Vec_IntAlloc( 2 * nCubes ); in Mop_ManAlloc()
138 char * pStr = pBuffer; int nCubes = 0; in Mop_ManReadParams() local
144 nCubes += (*pStr++ == '\n'); in Mop_ManReadParams()
145 return nCubes; in Mop_ManReadParams()
150 int nIns, nOuts, nCubes, iCube; in Mop_ManRead() local
155 if ( nCubes == -1 ) in Mop_ManRead()
157 p = Mop_ManAlloc( nIns, nOuts, nCubes ); in Mop_ManRead()
198 assert( iCube < nCubes ); in Mop_ManRead()
202 for ( ; iCube < 2 * nCubes; iCube++ ) in Mop_ManRead()
[all …]
/dports/cad/abc/abc-a4518e6f833885c905964f1233d11e5b941ec24c/src/opt/fxu/
H A DfxuCreate.c66 int nCubes; in Fxu_CreateMatrix() local
83 nPairsTotal += nCubes * (nCubes - 1) / 2; in Fxu_CreateMatrix()
84 nPairsStore += nCubes * nCubes; in Fxu_CreateMatrix()
121 pVar->nCubes = nCubes; in Fxu_CreateMatrix()
130 iCube += nCubes; in Fxu_CreateMatrix()
131 iPair += nCubes * nCubes; in Fxu_CreateMatrix()
337 int iNum, nCubes, v; in Fxu_CreateCoversNode() local
367 nCubes = 0; in Fxu_CreateCoversNode()
370 nCubes++; in Fxu_CreateCoversNode()
379 nCubes = 0; in Fxu_CreateCoversNode()
[all …]
H A DfxuPair.c452 void Fxu_PairAllocStorage( Fxu_Var * pVar, int nCubes ) in Fxu_PairAllocStorage() argument
456 pVar->nCubes = nCubes; in Fxu_PairAllocStorage()
458 pVar->ppPairs = ABC_ALLOC( Fxu_Pair **, nCubes ); in Fxu_PairAllocStorage()
459 pVar->ppPairs[0] = ABC_ALLOC( Fxu_Pair *, nCubes * nCubes ); in Fxu_PairAllocStorage()
460 memset( pVar->ppPairs[0], 0, sizeof(Fxu_Pair *) * nCubes * nCubes ); in Fxu_PairAllocStorage()
461 for ( k = 1; k < nCubes; k++ ) in Fxu_PairAllocStorage()
462 pVar->ppPairs[k] = pVar->ppPairs[k-1] + nCubes; in Fxu_PairAllocStorage()
481 for ( i = 0; i < pVar->nCubes; i++ ) in Fxu_PairClearStorage()
H A DfxuReduce.c60 int nCubes, nBitsMax, nSum; in Fxu_PreprocessCubePairs() local
81 nCubes = Abc_SopGetCubeNum( pSopCover ); in Fxu_PreprocessCubePairs()
82 iPair += nCubes * (nCubes - 1) / 2; in Fxu_PreprocessCubePairs()
153 for ( k = 0; k < pVar->nCubes; k++ ) in Fxu_PreprocessCubePairs()
/dports/graphics/py-pyqtgraph/pyqtgraph-0.12.3/pyqtgraph/opengl/items/
H A DGLBarGraphItem.py11 nCubes = np.prod(pos.shape[:-1])
20 size = size.reshape((nCubes, 1, 3))
21 pos = pos.reshape((nCubes, 1, 3))
23 faces = cubeFaces + (np.arange(nCubes) * 8).reshape(nCubes,1,1)
24 md = MeshData(verts.reshape(nCubes*8,3), faces.reshape(nCubes*12,3))
/dports/cad/abc/abc-a4518e6f833885c905964f1233d11e5b941ec24c/src/map/cov/
H A DcovTest.c121 int i, nCubes, fCompl0, fCompl1; in Abc_NodeDeriveSops() local
184 return nCubes; in Abc_NodeDeriveSops()
203 int i, nCubes; in Abc_NtkTestSop() local
225 printf( "Cubes = %5d. ", nCubes ); in Abc_NtkTestSop()
286 if ( p->nCubes > 10 ) in Abc_NodeDeriveCover()
330 if ( p->nCubes > 3000 ) in Abc_NodeDeriveEsops()
342 p->nCubes--; in Abc_NodeDeriveEsops()
348 p->nCubes++; in Abc_NodeDeriveEsops()
364 return p->nCubes; in Abc_NodeDeriveEsops()
383 int i, nCubes; in Abc_NtkTestEsop() local
[all …]
H A DcovMinEsop.c50 if ( p->nCubes < 3 ) in Min_EsopMinimize()
53 nCubesInit = p->nCubes; in Min_EsopMinimize()
55 nCubesOld = p->nCubes; in Min_EsopMinimize()
146 p->nCubes -= 2; in Min_EsopRewrite()
171 nCubesOld = p->nCubes; in Min_EsopRewrite()
183 p->nCubes -= 2; in Min_EsopRewrite()
231 p->nCubes--; in Min_EsopAddCubeInt()
245 p->nCubes--; in Min_EsopAddCubeInt()
257 p->nCubes--; in Min_EsopAddCubeInt()
269 p->nCubes--; in Min_EsopAddCubeInt()
[all …]
H A DcovBuild.c108 int Entry, nCubes, i; in Abc_NtkCovDeriveNode_rec() local
143 nCubes = Min_CoverCountCubes( pCover ); in Abc_NtkCovDeriveNode_rec()
144 if ( nCubes == 0 ) in Abc_NtkCovDeriveNode_rec()
146 else if ( nCubes == 1 ) in Abc_NtkCovDeriveNode_rec()
305 int Entry, nCubes, i; in Abc_NtkCovDeriveNodeInv_rec() local
325 nCubes = Min_CoverCountCubes( pCover ); in Abc_NtkCovDeriveNodeInv_rec()
326 if ( nCubes == 0 ) in Abc_NtkCovDeriveNodeInv_rec()
328 else if ( nCubes == 1 ) in Abc_NtkCovDeriveNodeInv_rec()
403 int i, Entry, nCubes, Type = 0; in Abc_NtkCovDerive_rec() local
459 if ( nCubes == 0 ) in Abc_NtkCovDerive_rec()
[all …]
H A DcovMinSop.c50 if ( p->nCubes < 3 ) in Min_SopMinimize()
53 nCubesInit = p->nCubes; in Min_SopMinimize()
55 nCubesOld = p->nCubes; in Min_SopMinimize()
153 p->nCubes -= 2; in Min_SopRewrite()
295 p->nCubes--; in Min_SopRewrite()
393 p->nCubes--; in Min_SopAddCubeInt()
408 p->nCubes--; in Min_SopAddCubeInt()
418 p->nCubes++; in Min_SopAddCubeInt()
469 p->nCubes--; in Min_SopContain()
478 p->nCubes--; in Min_SopContain()
[all …]
/dports/cad/abc/abc-a4518e6f833885c905964f1233d11e5b941ec24c/src/base/exor/
H A DexorCubes.c64 int AllocateCover( int nCubes, int nWordsIn, int nWordsOut );
90 int AllocateCover( int nCubes, int nWordsIn, int nWordsOut ) in AllocateCover() argument
106 pp = (Cube **)ABC_ALLOC( Cube *, nCubes ); in AllocateCover()
111 TotalSize = nCubes*OneCubeSize; in AllocateCover()
121 for ( i = 1; i < nCubes; i++ ) in AllocateCover()
129 for ( k = 0; k < nCubes-1; k++ ) in AllocateCover()
137 g_CoverInfo.nCubesFree = nCubes; in AllocateCover()
144 return nCubes*sizeof(Cube *) + TotalSize; in AllocateCover()
/dports/cad/abc/abc-a4518e6f833885c905964f1233d11e5b941ec24c/src/misc/mvc/
H A DmvcContain.c49 int nCubes; in Mvc_CoverContain() local
50 nCubes = Mvc_CoverReadCubeNum( pCover ); in Mvc_CoverContain()
51 if ( nCubes < 2 ) in Mvc_CoverContain()
56 if ( nCubes > 1 ) in Mvc_CoverContain()
58 return (nCubes != Mvc_CoverReadCubeNum(pCover)); in Mvc_CoverContain()
H A DmvcList.c313 int nCubes, i; in Mvc_CoverArray2List() local
317 nCubes = Mvc_CoverReadCubeNum(pCover); in Mvc_CoverArray2List()
318 if ( nCubes == 0 ) in Mvc_CoverArray2List()
320 if ( nCubes == 1 ) in Mvc_CoverArray2List()
331 pCube = pCover->pCubes[nCubes-1]; in Mvc_CoverArray2List()
336 for ( i = 0; i < nCubes - 1; i++ ) in Mvc_CoverArray2List()
H A DmvcSort.c50 int nCubes; in Mvc_CoverSort() local
52 nCubes = Mvc_CoverReadCubeNum(pCover); in Mvc_CoverSort()
53 if ( nCubes <= 1 ) in Mvc_CoverSort()
56 pHead = Mvc_CoverSort_rec( Mvc_CoverReadCubeHead(pCover), nCubes, pMask, pCompareFunc ); in Mvc_CoverSort()
/dports/cad/abc/abc-a4518e6f833885c905964f1233d11e5b941ec24c/src/base/abci/
H A DabcEspresso.c119 int nCubes, nVars, Value, v; in Abc_SopToEspresso() local
125 nCubes = Abc_SopGetCubeNum(pSop); in Abc_SopToEspresso()
142 Cover = sf_new(nCubes, cube.size); in Abc_SopToEspresso()
174 int Lit, nVars, nCubes, i, k; in Abc_SopFromEspresso() local
177 nCubes = Cover->count; in Abc_SopFromEspresso()
179 pSop = Abc_SopStart( pMan, nCubes, nVars ); in Abc_SopFromEspresso()
/dports/science/py-avogadrolibs/avogadrolibs-1.94.0/avogadro/quantumio/
H A Dgaussiancube.cpp100 unsigned int nCubes = 1; in read() local
102 in >> nCubes; in read()
103 std::vector<unsigned int> moList(nCubes); in read()
104 for (unsigned int i = 0; i < nCubes; ++i) in read()
120 for (unsigned int i = 0; i < nCubes; ++i) { in read()
/dports/science/avogadrolibs/avogadrolibs-1.94.0/avogadro/quantumio/
H A Dgaussiancube.cpp100 unsigned int nCubes = 1; in read() local
102 in >> nCubes; in read()
103 std::vector<unsigned int> moList(nCubes); in read()
104 for (unsigned int i = 0; i < nCubes; ++i) in read()
120 for (unsigned int i = 0; i < nCubes; ++i) { in read()
/dports/cad/abc/abc-a4518e6f833885c905964f1233d11e5b941ec24c/src/misc/extra/
H A DextraUtilPrime.c174 int nCubes; member
281 for ( c = 0; c < p->nCubes && (pCube = Tab_ManCube(p, c)); c++ ) \
285 for ( c = p->nCubes - 1; c >= 0 && (pCube = Tab_ManCube(p, c)); c-- ) \
300 Tab_Man_t * Tab_ManAlloc( int nVars, int nCubes ) in Tab_ManAlloc() argument
304 p->nCubes = nCubes; in Tab_ManAlloc()
305 p->Degree = Abc_Base2Log((p->nVars + 1) * p->nCubes + 1) + 3; in Tab_ManAlloc()
308 p->pCubes = ABC_CALLOC( int, p->nCubes * (p->nVars + 1) ); in Tab_ManAlloc()
309 p->pValues = ABC_CALLOC( word, p->nCubes ); in Tab_ManAlloc()
432 Vec_Int_t * vStarts = Vec_IntAlloc( p->nCubes ); in Tab_ManCountItems()
441 assert( Vec_IntSize(vStarts) == p->nCubes ); in Tab_ManCountItems()
[all …]
/dports/cad/abc/abc-a4518e6f833885c905964f1233d11e5b941ec24c/src/misc/bbl/
H A Dbblif.c843 for ( i = 0; i < nCubes-1; i++ ) in Bbl_ManSortCubes()
867 int c, Length, nCubes; in Bbl_ManSortSop() local
870 nCubes = Length / (nVars + 3); in Bbl_ManSortSop()
871 if ( nCubes < 2 ) in Bbl_ManSortSop()
878 for ( c = 0; c < nCubes; c++ ) in Bbl_ManSortSop()
880 if ( nCubes < 300 ) in Bbl_ManSortSop()
883 for ( c = 0; c < nCubes; c++ ) in Bbl_ManSortSop()
928 if ( nCubes > 16 ) nCubes = 16; in Bbl_ManSopCheckUnique()
939 p->SopMap[nVars][nCubes] = Bbl_ManCreateEntry( p, iFunc, p->SopMap[nVars][nCubes] ); in Bbl_ManSopCheckUnique()
1366 int v, c, w, nCubes, fCompl = 0; in Bbl_ManSopToTruth() local
[all …]
/dports/cad/abc/abc-a4518e6f833885c905964f1233d11e5b941ec24c/src/opt/sfm/
H A DsfmCnf.c109 int i, k, c, RetValue, Literal, Cube, nCubes = 0; in Sfm_TruthToCnf() local
129 nCubes += Vec_IntSize( vCover ); in Sfm_TruthToCnf()
146 return nCubes; in Sfm_TruthToCnf()
166 int i, nCubes; in Sfm_CreateCnf() local
173 nCubes = Sfm_TruthToCnf( uTruth, pRes, Sfm_ObjFaninNum(p, i), p->vCover, vCnf ); in Sfm_CreateCnf()

1234