311 int Table[256], Classes[16], Map[256];
312 int i, k, nClasses = 0;
313 for ( i = 0; i < 256; i++ )
315 for ( i = 0; i < 256; i++ )
321 for ( k = 0; k < nClasses; k++ )
322 if ( Table[i] == Classes[k] )
325 Classes[nClasses++] = Table[i];
328 printf(
"%2d}, // ", k );
330 printf(
" = %3d\n", i );
352 Vec_Wrd_t * vTruths = Vec_WrdStart( Gia_ManObjNum(
p) );
353 Vec_Wrd_t * vTemp = Vec_WrdStart( Gia_ManObjNum(
p) );
356 int iFan, iLut, i, k, Class;
357 assert( Gia_ManHasMapping(
p) );
363 Vec_WrdWriteEntry( vTruths, iLut, Truth );
365 Vec_WrdFree( vTemp );
369 Truth = Vec_WrdEntry( vTruths, iLut ) & 0xFF;
374 TruthF = Vec_WrdEntry( vTruths, iFan ) & 0xFF;
377 Map[(iTruthF << 4) + iTruth]++;
382 TruthF = Vec_WrdEntry( vTruths, iFan );
385 Map[(iTruthF << 4)]++;
387 Vec_WrdFree( vTruths );
390 for ( i = 0; i < 14; i++ )
393 for ( i = 0; i < 14; i++ )
396 for ( k = 0; k < 14; k++ )
397 if ( Map[(i << 4) | k] )
398 printf(
"%6d ", Map[(i << 4) | k] );
400 printf(
"%6s ",
"." );
404 printf(
"\nClasses:\n" );
405 for ( i = 0; i < 14; i++ )
407 for ( k = 0; k < 256; k++ )
412 printf(
"%2d : %s\n", i, pNames[Class] );
#define ABC_NAMESPACE_IMPL_START
#define ABC_NAMESPACE_IMPL_END
void Acec_StatsCollect(Gia_Man_t *p, int fVerbose)
ABC_NAMESPACE_IMPL_START int Npn3Table[256][2]
DECLARATIONS ///.
void Acec_GenerateNpnTable()
FUNCTION DEFINITIONS ///.
int Dar_LibReturnClass(unsigned uTruth)
void Extra_PrintHex(FILE *pFile, unsigned *pTruth, int nVars)
#define Gia_ManForEachCoDriverId(p, DriverId, i)
#define Gia_ManForEachLut(p, i)
#define Gia_LutForEachFanin(p, i, iFan, k)
struct Gia_Man_t_ Gia_Man_t
int Gia_ManLutSizeMax(Gia_Man_t *p)
word Gia_ObjComputeTruthTable6Lut(Gia_Man_t *p, int iObj, Vec_Wrd_t *vTemp)
char ** Kit_DsdNpn4ClassNames()
unsigned __int64 word
DECLARATIONS ///.
typedefABC_NAMESPACE_HEADER_START struct Vec_Wrd_t_ Vec_Wrd_t
INCLUDES ///.