Skip to content

Commit

Permalink
Delete all #if 0 functions
Browse files Browse the repository at this point in the history
  • Loading branch information
@ArcaneNibble
ArcaneNibble committed Apr 4, 2018
1 parent a41a910 commit 5ede049
Show file tree
Hide file tree
Showing 33 changed files with 0 additions and 5,167 deletions.
108 changes: 0 additions & 108 deletions src/aig/gia/giaSpeedup.c
View file
Original file line number Diff line number Diff line change
Expand Up @@ -321,114 +321,6 @@ float Gia_ManDelayTraceLut( Gia_Man_t * p )
return tArrival;
}

#if 0

/**Function*************************************************************
Synopsis [Computes the required times for the given node.]
Description []
SideEffects []
SeeAlso []
***********************************************************************/
float Gia_ObjComputeRequired( Gia_Man_t * p, int iObj, int fUseSorting )
{
If_LibLut_t * pLutLib = p->pLutLib;
int pPinPerm[32];
float pPinDelays[32];
Gia_Obj_t * pFanout;
float tRequired, tDelay, * pDelays;
int k, iFanin;
if ( Gia_ObjIsCo(iObj) )
return Gia_ObjTimeRequired( p, iObj);
tRequired = TIM_ETERNITY;
if ( pLutLib == NULL )
{
Gia_ObjForEachFanout( iObj, pFanout, k )
{
tDelay = Gia_ObjIsCo(pFanout)? 0.0 : 1.0;
if ( tRequired > Gia_ObjTimeRequired( p, pFanout) - tDelay )
tRequired = Gia_ObjTimeRequired( p, pFanout) - tDelay;
}
}
else if ( !pLutLib->fVarPinDelays )
{
Gia_ObjForEachFanout( iObj, pFanout, k )
{
pDelays = pLutLib->pLutDelays[Gia_ObjLutSize(p, pFanout)];
tDelay = Gia_ObjIsCo(pFanout)? 0.0 : pDelays[0];
if ( tRequired > Gia_ObjTimeRequired( p, pFanout) - tDelay )
tRequired = Gia_ObjTimeRequired( p, pFanout) - tDelay;
}
}
else
{
if ( fUseSorting )
{
Gia_ObjForEachFanout( iObj, pFanout, k )
{
pDelays = pLutLib->pLutDelays[Gia_ObjLutSize(p, pFanout)];
Gia_LutDelayTraceSortPins( p, pFanout, pPinPerm, pPinDelays );
iFanin = Gia_LutWhereIsPin( p, pFanout, iObj, pPinPerm );
assert( Gia_ObjLutFanin( p, pFanout, pPinPerm[iFanin]) == iObj );
tDelay = Gia_ObjIsCo(pFanout)? 0.0 : pDelays[iFanin];
if ( tRequired > Gia_ObjTimeRequired( p, pFanout) - tDelay )
tRequired = Gia_ObjTimeRequired( p, pFanout) - tDelay;
}
}
else
{
Gia_ObjForEachFanout( iObj, pFanout, k )
{
pDelays = pLutLib->pLutDelays[Gia_ObjLutSize(p, pFanout)];
iFanin = Gia_ObjFindFanin( p, pFanout, iObj );
assert( Gia_ObjLutFanin(p, pFanout, iFanin) == iObj );
tDelay = Gia_ObjIsCo(pFanout)? 0.0 : pDelays[iFanin];
if ( tRequired > Gia_ObjTimeRequired( p, pFanout) - tDelay )
tRequired = Gia_ObjTimeRequired( p, pFanout) - tDelay;
}
}
}
return tRequired;
}

/**Function*************************************************************
Synopsis [Computes the arrival times for the given node.]
Description []
SideEffects []
SeeAlso []
***********************************************************************/
int Gia_LutVerifyTiming( Gia_Man_t * p )
{
int iObj;
float tArrival, tRequired;
int i;
Gia_LutForEachObj( p, iObj, i )
{
if ( Gia_ObjIsCi(iObj) && Gia_ObjFanoutNum(iObj) == 0 )
continue;
tArrival = Gia_ObjComputeArrival( p, iObj, 1 );
tRequired = Gia_ObjComputeRequired( p, iObj, 1 );
if ( !Gia_LutTimeEqual( tArrival, Gia_ObjTimeArrival( p, iObj), (float)0.01 ) )
printf( "Gia_LutVerifyTiming(): Object %d has different arrival time (%.2f) from computed (%.2f).\n",
iObj->Id, Gia_ObjTimeArrival( p, iObj), tArrival );
if ( !Gia_LutTimeEqual( tRequired, Gia_ObjTimeRequired( p, iObj), (float)0.01 ) )
printf( "Gia_LutVerifyTiming(): Object %d has different required time (%.2f) from computed (%.2f).\n",
iObj->Id, Gia_ObjTimeRequired( p, iObj), tRequired );
}
return 1;
}

#endif

/**Function*************************************************************
Synopsis [Prints the delay trace for the given network.]
Expand Down
99 changes: 0 additions & 99 deletions src/aig/ivy/ivyDsd.c
View file
Original file line number Diff line number Diff line change
Expand Up @@ -722,105 +722,6 @@ void Ivy_TruthTestOne( unsigned uTruth )
// Vec_IntFree( vTree );
}

#if 0

/**Function*************************************************************
Synopsis []
Description []
SideEffects []
SeeAlso []
***********************************************************************/
void Ivy_TruthTest()
{
FILE * pFile;
char Buffer[100];
unsigned uTruth;
int i;

pFile = fopen( "npn4.txt", "r" );
for ( i = 0; i < 222; i++ )
// pFile = fopen( "npn5.txt", "r" );
// for ( i = 0; i < 616126; i++ )
{
fscanf( pFile, "%s", Buffer );
Extra_ReadHexadecimal( &uTruth, Buffer+2, 4 );
// Extra_ReadHexadecimal( &uTruth, Buffer+2, 5 );
uTruth |= (uTruth << 16);
// uTruth = ~uTruth;
Ivy_TruthTestOne( uTruth );
}
fclose( pFile );
}

/**Function*************************************************************
Synopsis []
Description []
SideEffects []
SeeAlso []
***********************************************************************/
void Ivy_TruthTest3()
{
FILE * pFile;
char Buffer[100];
unsigned uTruth;
int i;

pFile = fopen( "npn3.txt", "r" );
for ( i = 0; i < 14; i++ )
{
fscanf( pFile, "%s", Buffer );
Extra_ReadHexadecimal( &uTruth, Buffer+2, 3 );
uTruth = uTruth | (uTruth << 8) | (uTruth << 16) | (uTruth << 24);
Ivy_TruthTestOne( uTruth );
}
fclose( pFile );
}

/**Function*************************************************************
Synopsis []
Description []
SideEffects []
SeeAlso []
***********************************************************************/
void Ivy_TruthTest5()
{
FILE * pFile;
char Buffer[100];
unsigned uTruth;
int i;

// pFile = fopen( "npn4.txt", "r" );
// for ( i = 0; i < 222; i++ )
pFile = fopen( "npn5.txt", "r" );
for ( i = 0; i < 616126; i++ )
{
fscanf( pFile, "%s", Buffer );
// Extra_ReadHexadecimal( &uTruth, Buffer+2, 4 );
Extra_ReadHexadecimal( &uTruth, Buffer+2, 5 );
// uTruth |= (uTruth << 16);
// uTruth = ~uTruth;
Ivy_TruthTestOne( uTruth );
}
fclose( pFile );
}

#endif


////////////////////////////////////////////////////////////////////////
/// END OF FILE ///
Expand Down

0 comments on commit 5ede049

Please sign in to comment.