Commit 10c31c65 by Alan Mishchenko

Experiments with LUT structure mapping.

parent bc1eae79
...@@ -560,7 +560,7 @@ void Gia_ManPrintPackingStats( Gia_Man_t * p ) ...@@ -560,7 +560,7 @@ void Gia_ManPrintPackingStats( Gia_Man_t * p )
int fVerbose = 0; int fVerbose = 0;
int nObjToShow = 200; int nObjToShow = 200;
int nNumStr[5] = {0}; int nNumStr[5] = {0};
int i, k, Entry, nEntries, nEntries2, MaxSize = -1; int i, k, Entry, nEntries, nEntries2, MaxSize = -1, Count = 0;
if ( p->vPacking == NULL ) if ( p->vPacking == NULL )
return; return;
nEntries = Vec_IntEntry( p->vPacking, 0 ); nEntries = Vec_IntEntry( p->vPacking, 0 );
...@@ -586,8 +586,12 @@ void Gia_ManPrintPackingStats( Gia_Man_t * p ) ...@@ -586,8 +586,12 @@ void Gia_ManPrintPackingStats( Gia_Man_t * p )
MaxSize = 1; MaxSize = 1;
Abc_Print( 1, "Packing (N=%d) : ", MaxSize ); Abc_Print( 1, "Packing (N=%d) : ", MaxSize );
for ( i = 1; i <= MaxSize; i++ ) for ( i = 1; i <= MaxSize; i++ )
{
Abc_Print( 1, "%d x LUT = %d ", i, nNumStr[i] ); Abc_Print( 1, "%d x LUT = %d ", i, nNumStr[i] );
Abc_Print( 1, "Total = %d", nEntries2 ); Count += i * nNumStr[i];
}
Abc_Print( 1, "Total = %d ", nEntries2 );
Abc_Print( 1, "Total LUT = %d", Count );
Abc_Print( 1, "\n" ); Abc_Print( 1, "\n" );
} }
......
...@@ -34282,6 +34282,7 @@ int Abc_CommandAbc9Unmap( Abc_Frame_t * pAbc, int argc, char ** argv ) ...@@ -34282,6 +34282,7 @@ int Abc_CommandAbc9Unmap( Abc_Frame_t * pAbc, int argc, char ** argv )
} }
Vec_IntFreeP( &pAbc->pGia->vMapping ); Vec_IntFreeP( &pAbc->pGia->vMapping );
Vec_IntFreeP( &pAbc->pGia->vPacking ); Vec_IntFreeP( &pAbc->pGia->vPacking );
Vec_IntFreeP( &pAbc->pGia->vCellMapping );
return 0; return 0;
usage: usage:
Markdown is supported
0% or
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment