Home
last modified time | relevance | path

Searched refs:nCutSize (Results 1 – 19 of 19) sorted by relevance

/dports/cad/abc/abc-a4518e6f833885c905964f1233d11e5b941ec24c/src/aig/gia/
H A DgiaCut.c52 int nCutSize; member
161 if ( nSize0 == nCutSize && nSize1 == nCutSize ) in Gia_CutMergeOrder()
168 pCut->nLeaves = nCutSize; in Gia_CutMergeOrder()
179 if ( c == nCutSize ) return 0; in Gia_CutMergeOrder()
227 if ( c == nCutSize ) return 0; in Gia_CutMergeOrder2()
362 if ( p->nCutSize <= 6 ) in Gia_CutComputeTruth()
367 int nCutSize = p->nCutSize, fCompl; in Gia_CutComputeTruth() local
486 int nCutSize = p->nCutSize; in Gia_StoMergeCuts() local
553 assert( nCutSize > 1 && nCutSize <= GIA_MAX_CUTSIZE ); in Gia_StoAlloc()
557 p->nCutSize = nCutSize; in Gia_StoAlloc()
[all …]
H A DgiaFx.c139 Vec_Wrd_t * Gia_ManComputeTruths( Gia_Man_t * p, int nCutSize, int nLutNum, int fReverse ) in Gia_ManComputeTruths() argument
145 nWords = Abc_Truth6WordNum( nCutSize ); in Gia_ManComputeTruths()
147 Gia_ObjComputeTruthTableStart( p, nCutSize ); in Gia_ManComputeTruths()
195 int nItems, nCutSize, nWords; in Gia_ManFxRetrieve() local
200 nCutSize = Gia_ManLutSizeMax( p ); in Gia_ManFxRetrieve()
201 nWords = Abc_Truth6WordNum( nCutSize ); in Gia_ManFxRetrieve()
202 vTruths = Gia_ManComputeTruths( p, nCutSize, nItems - Gia_ManCiNum(p), fReverse ); in Gia_ManFxRetrieve()
/dports/cad/abc/abc-a4518e6f833885c905964f1233d11e5b941ec24c/src/opt/sbd/
H A DsbdCut2.c52 int nCutSize; member
89 assert( nLutSize <= nCutSize ); in Sbd_ManCutServerStart()
90 assert( nCutSize < SBD_CUT_NO_LEAF ); in Sbd_ManCutServerStart()
91 assert( nCutSize > 1 && nCutSize <= SBD_MAX_CUTSIZE ); in Sbd_ManCutServerStart()
96 p->nCutSize = nCutSize; in Sbd_ManCutServerStart()
342 …_IntSize(p->vCut) < p->nCutSize && Sbd_ManCutReduceTop( p->pGia, p->vMirrors, iObj, p->vLutLevs, p… in Sbd_ManCutServerFirst()
346 assert( Vec_IntSize(p->vCut) <= p->nCutSize ); in Sbd_ManCutServerFirst()
354 …_IntSize(p->vCut) < p->nCutSize && Sbd_ManCutReduceTop( p->pGia, p->vMirrors, iObj, p->vLutLevs, p… in Sbd_ManCutServerFirst()
358 assert( Vec_IntSize(p->vCut) <= p->nCutSize ); in Sbd_ManCutServerFirst()
366 …_IntSize(p->vCut) < p->nCutSize && Sbd_ManCutReduceTop( p->pGia, p->vMirrors, iObj, p->vLutLevs, p… in Sbd_ManCutServerFirst()
[all …]
H A DsbdCut.c53 int nCutSize; member
166 if ( nSize0 == nCutSize && nSize1 == nCutSize ) in Sbd_CutMergeOrder()
173 pCut->nLeaves = nCutSize; in Sbd_CutMergeOrder()
184 if ( c == nCutSize ) return 0; in Sbd_CutMergeOrder()
232 if ( c == nCutSize ) return 0; in Sbd_CutMergeOrder2()
402 if ( p->nCutSize <= 6 ) in Sbd_CutComputeTruth()
407 int nCutSize = p->nCutSize, fCompl; in Sbd_CutComputeTruth() local
598 int nCutSize = p->nCutSize; in Sbd_StoMergeCuts() local
670 assert( nLutSize <= nCutSize ); in Sbd_StoAlloc()
672 assert( nCutSize > 1 && nCutSize <= SBD_MAX_CUTSIZE ); in Sbd_StoAlloc()
[all …]
H A DsbdInt.h86 …Sbd_StoAlloc( Gia_Man_t * pGia, Vec_Int_t * vMirrors, int nLutSize, int nCutSize, int nCutNum, int…
100 int nLutSize, int nCutSize, int nCutNum, int fVerbose );
H A Dsbd.h43 int nCutSize; // target cut size member
H A DsbdCore.c105 pPars->nCutSize = (pPars->nLutSize - 1) * pPars->nLutNum + 1; // target cut size in Sbd_ParSetDefault()
241 …p->pSto = Sbd_StoAlloc( pGia, p->vMirrors, pPars->nLutSize, pPars->nCutSize, pPars->nCutNum, !pPar… in Sbd_ManStart()
245 …rt( pGia, p->vMirrors, p->vLutLevs, NULL, NULL, pPars->nLutSize, pPars->nCutSize, pPars->nCutNum, … in Sbd_ManStart()
1579 assert( nLeaves <= p->pPars->nCutSize ); in Sbd_ManExplore3()
1585 for ( nSize = p->pPars->nLutSize + 1; nSize <= p->pPars->nCutSize; nSize++ ) in Sbd_ManExplore3()
2200 p->pPars->nLutSize, p->pPars->nLutNum, p->pPars->nCutSize, p->pPars->nCutNum ); in Sbd_NtkPerform()
/dports/cad/abc/abc-a4518e6f833885c905964f1233d11e5b941ec24c/src/proof/acec/
H A Dacec2Mult.c296 int nCutSize; member
405 if ( nSize0 == nCutSize && nSize1 == nCutSize ) in Sdb_CutMergeOrder()
412 pCut->nLeaves = nCutSize; in Sdb_CutMergeOrder()
423 if ( c == nCutSize ) return 0; in Sdb_CutMergeOrder()
471 if ( c == nCutSize ) return 0; in Sdb_CutMergeOrder2()
606 if ( p->nCutSize <= 6 ) in Sdb_CutComputeTruth()
611 int nCutSize = p->nCutSize, fCompl; in Sdb_CutComputeTruth() local
720 for ( ; i < (int)p->nCutSize; i++ ) in Sdb_CutPrint()
730 int nCutSize = p->nCutSize; in Sdb_StoMergeCuts() local
1118 assert( nCutSize > 1 && nCutSize <= SDB_MAX_CUTSIZE ); in Sdb_StoAlloc()
[all …]
/dports/cad/abc/abc-a4518e6f833885c905964f1233d11e5b941ec24c/src/bdd/llb/
H A Dllb1Matrix.c238 int iVar, iGrp, iGrp1, iGrp2, Span = 0, nCutSize = 0, nCutSizeMax = 0; in Llb_MtrPrintMatrixStats() local
261 nCutSize++; in Llb_MtrPrintMatrixStats()
262 if ( nCutSizeMax < nCutSize ) in Llb_MtrPrintMatrixStats()
263 nCutSizeMax = nCutSize; in Llb_MtrPrintMatrixStats()
266 nCutSize--; in Llb_MtrPrintMatrixStats()
272 if ( nCutSize ) in Llb_MtrPrintMatrixStats()
273 Abc_Print( -1, "Cut size is not zero (%d).\n", nCutSize ); in Llb_MtrPrintMatrixStats()
/dports/cad/abc/abc-a4518e6f833885c905964f1233d11e5b941ec24c/src/map/if/
H A DifUtil.c319 int i, nCutSize = 0, nCutSizeMax = 0; in If_ManCrossCut() local
325 if ( nCutSizeMax < ++nCutSize ) in If_ManCrossCut()
326 nCutSizeMax = nCutSize; in If_ManCrossCut()
328 nCutSize--; in If_ManCrossCut()
332 nCutSize--; in If_ManCrossCut()
335 nCutSize--; in If_ManCrossCut()
340 nCutSize--; in If_ManCrossCut()
347 assert( nCutSize == 0 ); in If_ManCrossCut()
/dports/cad/abc/abc-a4518e6f833885c905964f1233d11e5b941ec24c/src/opt/csw/
H A DcswInt.h63 short nCutSize; // the number of bytes in the cut member
86 int nCutSize; // the number of bytes needed to store one cut member
105 …utNext( Csw_Cut_t * pCut ) { return (Csw_Cut_t *)(((char *)pCut) + pCut->nCutSize); } in Csw_CutNext()
H A DcswMan.c70 p->nCutSize = sizeof(Csw_Cut_t) + sizeof(int) * nLeafMax + sizeof(unsigned) * p->nTruthWords; in Csw_ManStart()
71 p->pMemCuts = Aig_MmFixedStart( p->nCutSize * p->nCutsMax, 512 ); in Csw_ManStart()
H A DcswCut.c464 pCut->nCutSize = p->nCutSize; in Csw_ObjPrepareCuts()
/dports/cad/abc/abc-a4518e6f833885c905964f1233d11e5b941ec24c/src/aig/aig/
H A DaigCuts.c62 …p->nCutSize = sizeof(Aig_Cut_t) + sizeof(int) * nLeafMax + fTruth * sizeof(unsigned) * p->nTruthWo… in Aig_ManCutStart()
63 p->pMemCuts = Aig_MmFixedStart( p->nCutSize * p->nCutsMax, 512 ); in Aig_ManCutStart()
547 pCut->nCutSize = p->nCutSize; in Aig_ObjPrepareCuts()
654 p->nCutSize, 4*p->nTruthWords, 1.0*Aig_MmFixedReadMemUsage(p->pMemCuts)/(1<<20) ); in Aig_ComputeCuts()
H A Daig.h185 short nCutSize; // the number of bytes in the cut member
203 int nCutSize; // the number of bytes needed to store one cut member
215 …tNext( Aig_Cut_t * pCut ) { return (Aig_Cut_t *)(((char *)pCut) + pCut->nCutSize); } in Aig_CutNext()
/dports/math/minizinc/libminizinc-2.5.5/solvers/MIP/
H A DMIP_solverinstance.cpp175 int nCutSize = 0; in generate() local
180 ++nCutSize; in generate()
/dports/cad/abc/abc-a4518e6f833885c905964f1233d11e5b941ec24c/src/base/abc/
H A DabcUtil.c2051 int nCutSize = 0, nCutSizeMax = 0; in Abc_NtkCrossCut() local
2057 Abc_NtkCrossCut_rec( pObj, &nCutSize, &nCutSizeMax ); in Abc_NtkCrossCut()
2058 nCutSize--; in Abc_NtkCrossCut()
2060 assert( nCutSize == 0 ); in Abc_NtkCrossCut()
/dports/cad/abc/abc-a4518e6f833885c905964f1233d11e5b941ec24c/src/misc/util/
H A DutilTruth.h1685 static inline word Abc_Tt6Expand( word t, int * pCut0, int nCutSize0, int * pCut, int nCutSize ) in Abc_Tt6Expand() argument
1688 for ( i = nCutSize - 1, k = nCutSize0 - 1; i >= 0 && k >= 0; i-- ) in Abc_Tt6Expand()
1700 …oid Abc_TtExpand( word * pTruth0, int nVars, int * pCut0, int nCutSize0, int * pCut, int nCutSize ) in Abc_TtExpand() argument
1703 for ( i = nCutSize - 1, k = nCutSize0 - 1; i >= 0 && k >= 0; i-- ) in Abc_TtExpand()
/dports/cad/abc/abc-a4518e6f833885c905964f1233d11e5b941ec24c/src/base/abci/
H A Dabc.c45625 pPars->nCutSize = atoi(argv[globalUtilOptind]); in Abc_CommandAbc9Mfsd()
45627 if ( pPars->nCutSize < 0 ) in Abc_CommandAbc9Mfsd()
45730 …: the cut size considered for optimization (2 <= num <= 10) [default = %d]\n", pPars->nCutSize ); in Abc_CommandAbc9Mfsd()