Home
last modified time | relevance | path

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

/dports/cad/abc/abc-a4518e6f833885c905964f1233d11e5b941ec24c/src/opt/lpk/
H A DlpkAbcDec.c154 assert( p->nLutK >= 3 && p->nLutK <= 6 ); in Lpk_Decompose_rec()
155 assert( p->nVars > p->nLutK ); in Lpk_Decompose_rec()
157 if ( Lpk_LutNumLuts(p->nVars, p->nLutK) > (int)p->nAreaLim ) in Lpk_Decompose_rec()
171 if ( pResDsd && (pResDsd->nBSVars == (int)p->nLutK || pResDsd->nBSVars == (int)p->nLutK - 1) && in Lpk_Decompose_rec()
177 assert( p2->nVars <= (int)p->nLutK ); in Lpk_Decompose_rec()
178 if ( p->nVars > p->nLutK && !Lpk_Decompose_rec( pMan, p ) ) in Lpk_Decompose_rec()
190 if ( pResMux && pResMux->nSuppSizeS <= (int)p->nLutK && pResMux->nSuppSizeL <= (int)p->nLutK ) in Lpk_Decompose_rec()
210 if ( p->nVars > p->nLutK && !Lpk_Decompose_rec( pMan, p ) ) in Lpk_Decompose_rec()
219 assert( p2->nVars <= (int)p->nLutK ); in Lpk_Decompose_rec()
220 if ( p->nVars > p->nLutK && !Lpk_Decompose_rec( pMan, p ) ) in Lpk_Decompose_rec()
[all …]
H A DlpkAbcMux.c64 if ( nSuppSize0 <= (int)p->nLutK - 2 && nSuppSize1 <= (int)p->nLutK - 2 ) in Lpk_MuxAnalize()
79 else if ( nSuppSize0 <= (int)p->nLutK - 2 ) in Lpk_MuxAnalize()
84 Area = 1 + Lpk_LutNumLuts( nSuppSize1, p->nLutK ); in Lpk_MuxAnalize()
87 else if ( nSuppSize1 <= (int)p->nLutK - 2 ) in Lpk_MuxAnalize()
92 Area = 1 + Lpk_LutNumLuts( nSuppSize0, p->nLutK ); in Lpk_MuxAnalize()
95 else if ( nSuppSize0 <= (int)p->nLutK ) in Lpk_MuxAnalize()
103 else if ( nSuppSize1 <= (int)p->nLutK ) in Lpk_MuxAnalize()
124 … Area = Lpk_LutNumLuts( nSuppSize0+2, p->nLutK ) + Lpk_LutNumLuts( nSuppSize1, p->nLutK ); in Lpk_MuxAnalize()
126 … Area = Lpk_LutNumLuts( nSuppSize1+2, p->nLutK ) + Lpk_LutNumLuts( nSuppSize0, p->nLutK ); in Lpk_MuxAnalize()
209 if ( pNew->nVars <= pNew->nLutK ) in Lpk_MuxSplit()
[all …]
H A DlpkAbcDsd.c379 assert( nCofDepth < (int)p->nLutK - 1 ); in Lpk_DsdAnalizeOne()
465 assert( p->nLutK >= 3 ); in Lpk_DsdAnalize()
478 if ( pRes0->nBSVars == (int)p->nLutK ) in Lpk_DsdAnalize()
480 if ( pRes0->nBSVars == (int)p->nLutK - 1 ) in Lpk_DsdAnalize()
491 assert( pRes1->nBSVars <= (int)p->nLutK - 1 ); in Lpk_DsdAnalize()
492 if ( pRes1->nBSVars == (int)p->nLutK - 1 ) in Lpk_DsdAnalize()
494 if ( pRes0->nBSVars == (int)p->nLutK - 2 ) in Lpk_DsdAnalize()
496 if ( pRes1->nBSVars == (int)p->nLutK - 2 ) in Lpk_DsdAnalize()
502 if ( p->nLutK >= 4 ) in Lpk_DsdAnalize()
507 if ( pRes2->nBSVars == (int)p->nLutK - 2 ) in Lpk_DsdAnalize()
[all …]
H A DlpkInt.h150 unsigned nLutK : 4; // the number of LUT inputs member
178 static inline int Lpk_LutNumVars( int nLutsLim, int nLutK ) { return nLutsLim * (nLutK - 1)… in Lpk_LutNumVars() argument
179 … Lpk_LutNumLuts( int nVarsMax, int nLutK ) { return (nVarsMax - 1) / (nLutK - 1) + (int)((nVars… in Lpk_LutNumLuts() argument
205 …t * pNtk, Vec_Ptr_t * vLeaves, unsigned * pTruth, unsigned * puSupps, int nLutK, int AreaLim, int …
215 …_FunCreate( Abc_Ntk_t * pNtk, Vec_Ptr_t * vLeaves, unsigned * pTruth, int nLutK, int AreaLim, int …
H A DlpkAbcUtil.c80 Lpk_Fun_t * Lpk_FunCreate( Abc_Ntk_t * pNtk, Vec_Ptr_t * vLeaves, unsigned * pTruth, int nLutK, int… in Lpk_FunCreate() argument
89 p->nLutK = nLutK; in Lpk_FunCreate()
121 pNew->nLutK = p->nLutK; in Lpk_FunDup()