48 static int s_Truth[3] = { 0xAA, 0xCC, 0xF0 };
49 return 0xff & ((t & ~s_Truth[v]) | ((t & ~s_Truth[v]) << (1<<v)));
65 static int s_Truth[3] = { 0xAA, 0xCC, 0xF0 };
66 return 0xff & ((t & s_Truth[v]) | ((t & s_Truth[v]) >> (1<<v)));
82 static int s_Truth[3] = { 0xAA, 0xCC, 0xF0 };
83 return ((t & s_Truth[v]) >> (1<<v)) != (t & ~s_Truth[v]);
117 for ( i = 0; i < 256; i++ )
132 printf(
"%d, // %3d 0x%02X\n", Value, i, i );
134 printf(
"Total number of MUXes = %d.\n", CounterM );
150 static char uLookup[256] = {
412 return (1 << pCut->
nLeaves) - 1;
static ABC_NAMESPACE_IMPL_START int Abc_NtkFuncCof0(int t, int v)
DECLARATIONS ///.
static int Abc_NtkFuncSuppSize(int t)
int Abc_NtkCutCostMux(If_Man_t *p, If_Cut_t *pCut)
void Abc_NtkCutCostMuxPrecompute()
#define ABC_NAMESPACE_IMPL_END
static unsigned * If_CutTruth(If_Man_t *p, If_Cut_t *pCut)
#define ABC_NAMESPACE_IMPL_START
static int Abc_NtkFuncHasVar(int t, int v)
static int Abc_NtkFuncCof1(int t, int v)