summaryrefslogtreecommitdiffstats
path: root/src/aig/gia
diff options
context:
space:
mode:
Diffstat (limited to 'src/aig/gia')
-rw-r--r--src/aig/gia/giaIf.c163
1 files changed, 133 insertions, 30 deletions
diff --git a/src/aig/gia/giaIf.c b/src/aig/gia/giaIf.c
index 1b16c299..3afb07b7 100644
--- a/src/aig/gia/giaIf.c
+++ b/src/aig/gia/giaIf.c
@@ -368,28 +368,50 @@ void Gia_ManPrintGetMuxFanins( Gia_Man_t * p, Gia_Obj_t * pObj, int * pFanins )
}
int Gia_ManCountDupLut( Gia_Man_t * p )
{
- int i, nCountDup = 0, nCountPis = 0, nCountMux = 0;
+ Gia_Obj_t * pObj, * pFanin;
+ int i, pFanins[3], nCountDup = 0, nCountPis = 0, nCountMux = 0;
Gia_ManCleanMark01( p );
Gia_ManForEachLut( p, i )
if ( Gia_ObjLutIsMux(p, i) )
{
- Gia_Obj_t * pFanin;
- int pFanins[3];
- assert( Gia_ObjLutSize(p, i) == 2 || Gia_ObjLutSize(p, i) == 3 );
- Gia_ManPrintGetMuxFanins( p, Gia_ManObj(p, i), pFanins );
- Gia_ManObj(p, i)->fMark1 = 1;
-
- pFanin = Gia_ManObj(p, pFanins[1]);
- nCountPis += Gia_ObjIsCi(pFanin);
- nCountDup += pFanin->fMark0;
- nCountMux += pFanin->fMark1;
- pFanin->fMark0 = 1;
-
- pFanin = Gia_ManObj(p, pFanins[2]);
- nCountPis += Gia_ObjIsCi(pFanin);
- nCountDup += pFanin->fMark0;
- nCountMux += pFanin->fMark1;
- pFanin->fMark0 = 1;
+ pObj = Gia_ManObj( p, i );
+ pObj->fMark1 = 1;
+ if ( Gia_ObjLutSize(p, i) == 3 )
+ {
+ Gia_ManPrintGetMuxFanins( p, pObj, pFanins );
+
+ pFanin = Gia_ManObj(p, pFanins[1]);
+ nCountPis += Gia_ObjIsCi(pFanin);
+ nCountDup += pFanin->fMark0;
+ nCountMux += pFanin->fMark1;
+ pFanin->fMark0 = 1;
+
+ pFanin = Gia_ManObj(p, pFanins[2]);
+ nCountPis += Gia_ObjIsCi(pFanin);
+ nCountDup += pFanin->fMark0;
+ nCountMux += pFanin->fMark1;
+ pFanin->fMark0 = 1;
+ }
+ else if ( Gia_ObjLutSize(p, i) == 2 )
+ {
+ pFanin = Gia_ObjFanin0(pObj);
+ if ( pFanin->fMark0 || pFanin->fMark1 )
+ {
+ pFanin = Gia_ObjFanin1(pObj);
+ nCountPis += Gia_ObjIsCi(pFanin);
+ nCountDup += pFanin->fMark0;
+ nCountMux += pFanin->fMark1;
+ pFanin->fMark0 = 1;
+ }
+ else
+ {
+ nCountPis += Gia_ObjIsCi(pFanin);
+ nCountDup += pFanin->fMark0;
+ nCountMux += pFanin->fMark1;
+ pFanin->fMark0 = 1;
+ }
+ }
+ else assert( 0 );
}
Gia_ManCleanMark01( p );
if ( nCountDup + nCountPis + nCountMux )
@@ -411,14 +433,22 @@ void Gia_ManPrintMappingStats( Gia_Man_t * p, char * pDumpFile )
if ( Gia_ObjLutIsMux(p, i) )
{
int pFanins[3];
- assert( Gia_ObjLutSize(p, i) == 2 || Gia_ObjLutSize(p, i) == 3 );
- Gia_ManPrintGetMuxFanins( p, Gia_ManObj(p, i), pFanins );
- pLevels[i] = Abc_MaxInt( pLevels[i], pLevels[pFanins[0]]+1 );
- pLevels[i] = Abc_MaxInt( pLevels[i], pLevels[pFanins[1]] );
- pLevels[i] = Abc_MaxInt( pLevels[i], pLevels[pFanins[2]] );
+ if ( Gia_ObjLutSize(p, i) == 3 )
+ {
+ Gia_ManPrintGetMuxFanins( p, Gia_ManObj(p, i), pFanins );
+ pLevels[i] = Abc_MaxInt( pLevels[i], pLevels[pFanins[0]]+1 );
+ pLevels[i] = Abc_MaxInt( pLevels[i], pLevels[pFanins[1]] );
+ pLevels[i] = Abc_MaxInt( pLevels[i], pLevels[pFanins[2]] );
+ }
+ else if ( Gia_ObjLutSize(p, i) == 2 )
+ {
+ pObj = Gia_ManObj( p, i );
+ pLevels[i] = Abc_MaxInt( pLevels[i], pLevels[Gia_ObjFaninId0(pObj, i)] );
+ pLevels[i] = Abc_MaxInt( pLevels[i], pLevels[Gia_ObjFaninId1(pObj, i)] );
+ }
LevelMax = Abc_MaxInt( LevelMax, pLevels[i] );
- nMuxF++;
nFanins++;
+ nMuxF++;
continue;
}
nLuts++;
@@ -1435,10 +1465,14 @@ int Gia_ManFromIfLogicFindCell( If_Man_t * pIfMan, Gia_Man_t * pNew, Gia_Man_t *
else
{
Gia_Obj_t * pObj;
- int i, Id;
+ int i, Id, iLitTemp;
// extract variable permutation
- word Perm = If_DsdManGetFuncPerm( pIfMan->pIfDsdMan, If_CutDsdLit(pIfMan, pCutBest) );
+ char * pCutPerm = If_CutDsdPerm( pIfMan, pCutBest ); // DSD input -> cut input
+ word Perm = If_DsdManGetFuncPerm( pIfMan->pIfDsdMan, If_CutDsdLit(pIfMan, pCutBest) ); // cell input -> DSD input
assert( Perm > 0 );
+ // (extend storage for configuration bits)
+ // derive mapping from cell inputs into cut inputs
+ // retrieve config bits of the LUTs
// perform boolean matching
if ( !If_ManSatFindCofigBits( pSat, vPiVars, vPoVars, If_CutTruthW(pIfMan, pCutBest), Vec_IntSize(vLeaves), Perm, Ifn_NtkInputNum(pNtkCell), vLits ) )
{
@@ -1450,12 +1484,15 @@ int Gia_ManFromIfLogicFindCell( If_Man_t * pIfMan, Gia_Man_t * pNew, Gia_Man_t *
// copy GIA back into the manager
Vec_IntFillExtra( &pTemp->vCopies, Gia_ManObjNum(pTemp), -1 );
Gia_ObjSetCopyArray( pTemp, 0, 0 );
- Gia_ManForEachCiId( pTemp, Id, i )
- Gia_ObjSetCopyArray( pTemp, Id, Vec_IntEntry(vLeaves, i) );
+ Vec_IntForEachEntry( vLeaves, iLitTemp, i )
+ Gia_ObjSetCopyArray( pTemp, Gia_ManCiIdToId(pTemp, i), iLitTemp );
// collect nodes
Gia_ManIncrementTravId( pTemp );
Id = Abc_Lit2Var( iLit );
Gia_ManCollectAnds( pTemp, &Id, 1, vCover );
+ Vec_IntPrint( vCover );
+ Gia_ManForEachObjVec( vCover, pTemp, pObj, i )
+ Gia_ObjPrint( pTemp, pObj );
// copy GIA
Gia_ManForEachObjVec( vCover, pTemp, pObj, i )
{
@@ -1502,7 +1539,7 @@ Gia_Man_t * Gia_ManFromIfLogic( If_Man_t * pIfMan )
// start mapping and packing
vMapping = Vec_IntStart( If_ManObjNum(pIfMan) );
vMapping2 = Vec_IntStart( 1 );
- if ( pIfMan->pPars->fDeriveLuts && (pIfMan->pPars->pLutStruct || pIfMan->pPars->fEnableCheck75 || pIfMan->pPars->fEnableCheck75u || pIfMan->pPars->fEnableCheck07) )
+ if ( pIfMan->pPars->fDeriveLuts && (pIfMan->pPars->pLutStruct || pIfMan->pPars->fEnableCheck75 || pIfMan->pPars->fEnableCheck75u || pIfMan->pPars->fEnableCheck07 || pIfMan->pPars->fUseDsdTune) )
{
vPacking = Vec_IntAlloc( 1000 );
Vec_IntPush( vPacking, 0 );
@@ -1523,7 +1560,9 @@ Gia_Man_t * Gia_ManFromIfLogic( If_Man_t * pIfMan )
{
pCutBest = If_ObjCutBest( pIfObj );
// perform sorting of cut leaves by delay, so that the slowest pin drives the fastest input of the LUT
- if ( !pIfMan->pPars->fUseTtPerm && !pIfMan->pPars->fDelayOpt && !pIfMan->pPars->fDelayOptLut && !pIfMan->pPars->fDsdBalance && !pIfMan->pPars->pLutStruct && !pIfMan->pPars->fUserRecLib && !pIfMan->pPars->nGateSize && !pIfMan->pPars->fEnableCheck75 && !pIfMan->pPars->fEnableCheck75u && !pIfMan->pPars->fEnableCheck07 )
+ if ( !pIfMan->pPars->fUseTtPerm && !pIfMan->pPars->fDelayOpt && !pIfMan->pPars->fDelayOptLut && !pIfMan->pPars->fDsdBalance &&
+ !pIfMan->pPars->pLutStruct && !pIfMan->pPars->fUserRecLib && !pIfMan->pPars->nGateSize && !pIfMan->pPars->fEnableCheck75 &&
+ !pIfMan->pPars->fEnableCheck75u && !pIfMan->pPars->fEnableCheck07 && !pIfMan->pPars->fUseDsdTune && !pIfMan->pPars->fUseCofVars )
If_CutRotatePins( pIfMan, pCutBest );
// collect leaves of the best cut
Vec_IntClear( vLeaves );
@@ -1555,6 +1594,70 @@ Gia_Man_t * Gia_ManFromIfLogic( If_Man_t * pIfMan )
pIfObj->iCopy = Gia_ManFromIfLogicFindCell( pIfMan, pNew, pHashed, pCutBest, pSat, vPiVars, vPoVars, pNtkCell, nLutMax, vLeaves, vLits, vCover, vMapping, vMapping2, vPacking );
pIfObj->iCopy = Abc_LitNotCond( pIfObj->iCopy, pCutBest->fCompl );
}
+ else if ( pIfMan->pPars->fUseCofVars && pIfMan->pPars->fDeriveLuts && (int)pCutBest->nLeaves > pIfMan->pPars->nLutSize/2 )
+ {
+ word pTruthCof[128], * pTruth = If_CutTruthW(pIfMan, pCutBest);
+ int pVarsNew[16], nVarsNew, iLitCofs[3];
+ int LutSize = pIfMan->pPars->nLutSize;
+ int nWords = Abc_Truth6WordNum(LutSize);
+ int truthId = Abc_Lit2Var(pCutBest->iCutFunc);
+ int nLeaves = pCutBest->nLeaves;
+ int c, iVar = Vec_StrEntry(pIfMan->vTtVars[nLeaves], truthId), iTemp;
+ assert( iVar >= 0 && iVar < nLeaves && LutSize <= 13 );
+ for ( c = 0; c < 2; c++ )
+ {
+ for ( k = 0; k < nLeaves; k++ )
+ pVarsNew[k] = k;
+ if ( c )
+ Abc_TtCofactor1p( pTruthCof, pTruth, nWords, iVar );
+ else
+ Abc_TtCofactor0p( pTruthCof, pTruth, nWords, iVar );
+ nVarsNew = Abc_TtMinBase( pTruthCof, pVarsNew, pCutBest->nLeaves, LutSize );
+ // derive LUT
+ Vec_IntClear( vLeaves2 );
+ for ( k = 0; k < nVarsNew; k++ )
+ Vec_IntPush( vLeaves2, Vec_IntEntry(vLeaves, pVarsNew[k]) );
+ iLitCofs[c] = Kit_TruthToGia( pNew, (unsigned *)pTruthCof, nVarsNew, vCover, vLeaves2, 0 );
+ if ( nVarsNew < 2 )
+ continue;
+ // create mapping
+ Vec_IntSetEntry( vMapping, Abc_Lit2Var(iLitCofs[c]), Vec_IntSize(vMapping2) );
+ Vec_IntPush( vMapping2, Vec_IntSize(vLeaves2) );
+ Vec_IntForEachEntry( vLeaves2, iTemp, k )
+ Vec_IntPush( vMapping2, Abc_Lit2Var(iTemp) );
+ Vec_IntPush( vMapping2, Abc_Lit2Var(iLitCofs[c]) );
+ }
+ iLitCofs[2] = Vec_IntEntry(vLeaves, iVar);
+ // derive MUX
+ if ( iLitCofs[0] > 1 || iLitCofs[1] > 1 )
+ {
+ pTruthCof[0] = ABC_CONST(0xCACACACACACACACA);
+ Vec_IntClear( vLeaves2 );
+ Vec_IntPush( vLeaves2, iLitCofs[0] );
+ Vec_IntPush( vLeaves2, iLitCofs[1] );
+ Vec_IntPush( vLeaves2, iLitCofs[2] );
+ pIfObj->iCopy = Kit_TruthToGia( pNew, (unsigned *)pTruthCof, Vec_IntSize(vLeaves2), vCover, vLeaves2, 0 );
+ }
+ else
+ {
+ iLitCofs[0] = Abc_LitNot( Gia_ManAppendAnd2( pNew, iLitCofs[0], Abc_LitNot(iLitCofs[2]) ) );
+ iLitCofs[1] = Abc_LitNot( Gia_ManAppendAnd2( pNew, iLitCofs[1], iLitCofs[2] ) );
+ pIfObj->iCopy = Abc_LitNot( Gia_ManAppendAnd2( pNew, iLitCofs[0], iLitCofs[1] ) );
+ // collect leaves
+ Vec_IntClear( vLeaves2 );
+ for ( k = 0; k < 3; k++ )
+ if ( iLitCofs[k] > 1 )
+ Vec_IntPush( vLeaves2, iLitCofs[k] );
+ assert( Vec_IntSize(vLeaves2) > 1 );
+ }
+ // create mapping
+ Vec_IntSetEntry( vMapping, Abc_Lit2Var(pIfObj->iCopy), Vec_IntSize(vMapping2) );
+ Vec_IntPush( vMapping2, Vec_IntSize(vLeaves2) );
+ Vec_IntForEachEntry( vLeaves2, iTemp, k )
+ Vec_IntPush( vMapping2, Abc_Lit2Var(iTemp) );
+ Vec_IntPush( vMapping2, -Abc_Lit2Var(pIfObj->iCopy) );
+ pIfObj->iCopy = Abc_LitNotCond( pIfObj->iCopy, pCutBest->fCompl );
+ }
else if ( (pIfMan->pPars->fDeriveLuts && pIfMan->pPars->fTruth) || pIfMan->pPars->fUseDsd || pIfMan->pPars->fUseTtPerm )
{
word * pTruth = If_CutTruthW(pIfMan, pCutBest);
generated by cgit v1.2.3 (git 2.25.1) at 2024-07-05 01:41:07 +0000