diff options
Diffstat (limited to 'src/base/abci')
-rw-r--r-- | src/base/abci/abcDar.c | 4 | ||||
-rw-r--r-- | src/base/abci/abcPrint.c | 5 |
2 files changed, 6 insertions, 3 deletions
diff --git a/src/base/abci/abcDar.c b/src/base/abci/abcDar.c index 60911e59..6072a9db 100644 --- a/src/base/abci/abcDar.c +++ b/src/base/abci/abcDar.c @@ -3926,7 +3926,7 @@ Abc_Ntk_t * Amap_ManProduceNetwork( Abc_Ntk_t * pNtk, Vec_Ptr_t * vMapping ) int i, k, iPis, iPos, nDupGates; // make sure gates exist in the current library Vec_PtrForEachEntry( Amap_Out_t *, vMapping, pRes, i ) - if ( pRes->pName && Mio_LibraryReadGateByName( pLib, pRes->pName ) == NULL ) + if ( pRes->pName && Mio_LibraryReadGateByName( pLib, pRes->pName, NULL ) == NULL ) { Abc_Print( 1, "Current library does not contain gate \"%s\".\n", pRes->pName ); return NULL; @@ -3945,7 +3945,7 @@ Abc_Ntk_t * Amap_ManProduceNetwork( Abc_Ntk_t * pNtk, Vec_Ptr_t * vMapping ) else { pNodeNew = Abc_NtkCreateNode( pNtkNew ); - pNodeNew->pData = Mio_LibraryReadGateByName( pLib, pRes->pName ); + pNodeNew->pData = Mio_LibraryReadGateByName( pLib, pRes->pName, NULL ); } for ( k = 0; k < pRes->nFans; k++ ) { diff --git a/src/base/abci/abcPrint.c b/src/base/abci/abcPrint.c index 3244a196..5f151b49 100644 --- a/src/base/abci/abcPrint.c +++ b/src/base/abci/abcPrint.c @@ -1013,7 +1013,7 @@ void Abc_NtkPrintGates( Abc_Ntk_t * pNtk, int fUseLibrary ) // clean value of all gates nGates = Mio_LibraryReadGateNum( (Mio_Library_t *)pNtk->pManFunc ); - ppGates = Mio_LibraryReadGatesByName( (Mio_Library_t *)pNtk->pManFunc ); + ppGates = Mio_LibraryReadGateArray( (Mio_Library_t *)pNtk->pManFunc ); for ( i = 0; i < nGates; i++ ) Mio_GateSetValue( ppGates[i], 0 ); @@ -1024,6 +1024,9 @@ void Abc_NtkPrintGates( Abc_Ntk_t * pNtk, int fUseLibrary ) if ( i == 0 ) continue; Mio_GateSetValue( (Mio_Gate_t *)pObj->pData, 1 + Mio_GateReadValue((Mio_Gate_t *)pObj->pData) ); CounterTotal++; + // assuming that twin gates follow each other + if ( Mio_GateReadTwin(((Mio_Gate_t *)pObj->pData)) != NULL ) + i++; } // determine the longest gate name |