ifCount.h File Reference

Go to the source code of this file.

Functions
static ABC_NAMESPACE_HEADER_START int	If_LogCreateAnd (Vec_Int_t *vAig, int iLit0, int iLit1, int nSuppAll)
	INCLUDES ///. More...
static int	If_LogCreateMux (Vec_Int_t *vAig, int iLitC, int iLit1, int iLit0, int nSuppAll)
static int	If_LogCreateXor (Vec_Int_t *vAig, int iLit0, int iLit1, int nSuppAll)
static int	If_LogCreateAndXor (Vec_Int_t *vAig, int iLit0, int iLit1, int nSuppAll, int fXor)
static int	If_LogCreateAndXorMulti (Vec_Int_t *vAig, int *pFaninLits, int nFanins, int nSuppAll, int fXor)
static int	If_LogCounterAddAig (int *pTimes, int *pnTimes, int *pFaninLits, int Num, int iLit, Vec_Int_t *vAig, int nSuppAll, int fXor, int fXorFunc)
static int	If_LogCounterDelayXor (int *pTimes, int nTimes)
static int	If_CutPinDelayGet (word D, int v)
static void	If_CutPinDelaySet (word *pD, int v, int d)
static word	If_CutPinDelayInit (int v)
static word	If_CutPinDelayMax (word D1, word D2, int nVars, int AddOn)
static word	If_CutPinDelayDecrement (word D1, int nVars)
static int	If_CutPinDelayEqual (word D1, word D2, int nVars)
static int	If_CutPinDelayDom (word D1, word D2, int nVars)
static void	If_CutPinDelayTranslate (word D, int nVars, char *pPerm)
static void	If_CutPinDelayPrint (word D, int nVars)
static int	If_LogCounterPinDelays (int *pTimes, int *pnTimes, word *pPinDels, int Num, word PinDel, int nSuppAll, int fXor)
static word	If_LogPinDelaysMulti (word *pPinDels, int nFanins, int nSuppAll, int fXor)
static word	If_AigVerifyArray (Vec_Int_t *vAig, int nLeaves)
static void	If_AigPrintArray (Vec_Int_t *vAig, int nLeaves)
static int	If_LogCounter64Eval (word Count)
static word	If_LogCounter64Add (word Count, int Num)
static int	If_LogCounter32Eval (unsigned Count, int Start)
static unsigned	If_LogCounter32Add (unsigned Count, int *pStart, int Num)
static int	If_LogCounterAdd (int *pTimes, int *pnTimes, int Num, int fXor)

Function Documentation

static void If_AigPrintArray ( Vec_Int_t *  vAig, int  nLeaves  )

inlinestatic

Function*************************************************************

Synopsis []

Description []

SideEffects []

SeeAlso []

Definition at line 300 of file ifCount.h.

{
    assert( Vec_IntSize(vAig) > 0 );
    assert( Vec_IntEntryLast(vAig) < 2 );
    if ( Vec_IntSize(vAig) == 1 ) // const
        printf( "Const %d\n", Vec_IntEntry(vAig, 0) );
    else if ( Vec_IntSize(vAig) == 2 ) // variable
        printf( "Variable %s\n", Vec_IntEntry(vAig, 1) ? "Compl" : "" );
    else
    {
        int i, iLit0, iLit1;
        assert( Vec_IntSize(vAig) & 1 );
        Vec_IntForEachEntryDouble( vAig, iLit0, iLit1, i )
            printf( "%d %d\n", iLit0, iLit1 );
        assert( i == Vec_IntSize(vAig) - 1 );
        printf( "%s\n", Vec_IntEntry(vAig, i) ? "Compl" : "" );
    }
}

static word If_AigVerifyArray ( Vec_Int_t *  vAig, int  nLeaves  )

inlinestatic

Function*************************************************************

Synopsis []

Description []

SideEffects []

SeeAlso []

Definition at line 251 of file ifCount.h.

{
    assert( Vec_IntSize(vAig) > 0 );
    assert( Vec_IntEntryLast(vAig) < 2 );
    if ( Vec_IntSize(vAig) == 1 ) // const
        return Vec_IntEntry(vAig, 0) ? ~((word)0) : 0;
    if ( Vec_IntSize(vAig) == 2 ) // variable
    {
        assert( Vec_IntEntry(vAig, 0) == 0 );
        return Vec_IntEntry(vAig, 1) ? ~s_Truths6[0] : s_Truths6[0];
    }
    else
    {
        word Truth0 = 0, Truth1 = 0, TruthR;
        int i, iVar0, iVar1, iLit0, iLit1;
        assert( Vec_IntSize(vAig) & 1 );
        Vec_IntForEachEntryDouble( vAig, iLit0, iLit1, i )
        {
            iVar0 = Abc_Lit2Var( iLit0 );
            iVar1 = Abc_Lit2Var( iLit1 );
            Truth0 = iVar0 < nLeaves ? s_Truths6[iVar0] : Vec_WrdEntry( (Vec_Wrd_t *)vAig, iVar0 - nLeaves );
            Truth1 = iVar1 < nLeaves ? s_Truths6[iVar1] : Vec_WrdEntry( (Vec_Wrd_t *)vAig, iVar1 - nLeaves );
            if ( Abc_LitIsCompl(iLit0) )
                Truth0 = ~Truth0;
            if ( Abc_LitIsCompl(iLit1) )
                Truth1 = ~Truth1;
            assert( (i & 1) == 0 );
            Vec_WrdWriteEntry( (Vec_Wrd_t *)vAig, Abc_Lit2Var(i), Truth0 & Truth1 );  // overwriting entries
        }
        assert( i == Vec_IntSize(vAig) - 1 );
        TruthR = Truth0 & Truth1;
        if ( Vec_IntEntry(vAig, i) )
            TruthR = ~TruthR;
        Vec_IntClear( vAig ); // useless
        return TruthR;
    }
}

static word If_CutPinDelayDecrement ( word  D1, int  nVars  )

inlinestatic

Definition at line 156 of file ifCount.h.

{
    int v;
    word D = 0;
    for ( v = 0; v < nVars; v++ )
        if ( If_CutPinDelayGet(D1, v) )
            If_CutPinDelaySet( &D, v, If_CutPinDelayGet(D1, v) - 1 );
    return D;
}

static int If_CutPinDelayDom ( word  D1, word  D2, int  nVars  )

inlinestatic

Definition at line 173 of file ifCount.h.

{
    int v;
    for ( v = 0; v < nVars; v++ )
        if ( If_CutPinDelayGet(D1, v) > If_CutPinDelayGet(D2, v) )
            return 0;
    return 1;
}

static int If_CutPinDelayEqual ( word  D1, word  D2, int  nVars  )

inlinestatic

Definition at line 165 of file ifCount.h.

{
    int v;
    for ( v = 0; v < nVars; v++ )
        if ( If_CutPinDelayGet(D1, v) != If_CutPinDelayGet(D2, v) )
            return 0;
    return 1;
}

static int If_CutPinDelayGet ( word  D, int  v  )

inlinestatic

Function*************************************************************

Synopsis [Compute delay/area profile of the structure.]

Description []

SideEffects []

SeeAlso []

Definition at line 144 of file ifCount.h.

{ assert(v >= 0 && v < IF_MAX_FUNC_LUTSIZE); return (int)((D >> (v << 2)) & 0xF);                             }

static word If_CutPinDelayInit ( int  v )

inlinestatic

Definition at line 146 of file ifCount.h.

{ assert(v >= 0 && v < IF_MAX_FUNC_LUTSIZE); return (word)1 << (v << 2);                                      }

static word If_CutPinDelayMax ( word  D1, word  D2, int  nVars, int  AddOn  )

inlinestatic

Definition at line 147 of file ifCount.h.

{
    int v, Max;
    word D = 0;
    for ( v = 0; v < nVars; v++ )
        if ( (Max = Abc_MaxInt(If_CutPinDelayGet(D1, v), If_CutPinDelayGet(D2, v))) )
            If_CutPinDelaySet( &D, v, Abc_MinInt(Max + AddOn, 15) );
    return D;
}

static void If_CutPinDelayPrint ( word  D, int  nVars  )

inlinestatic

Definition at line 191 of file ifCount.h.

{
    int v;
    printf( "Delay profile = {" );
    for ( v = 0; v < nVars; v++ )
        printf( " %d", If_CutPinDelayGet(D, v) );
    printf( " }\n" );
}

static void If_CutPinDelaySet ( word *  pD, int  v, int  d  )

inlinestatic

Definition at line 145 of file ifCount.h.

{ assert(v >= 0 && v < IF_MAX_FUNC_LUTSIZE); assert(d >= 0 && d < IF_MAX_FUNC_LUTSIZE); *pD |= ((word)d << (v << 2)); }

static void If_CutPinDelayTranslate ( word  D, int  nVars, char *  pPerm  )

inlinestatic

Definition at line 181 of file ifCount.h.

{
    int v, Delay;
    for ( v = 0; v < nVars; v++ )
    {
        Delay = If_CutPinDelayGet(D, v);
        assert( Delay > 1 );
        pPerm[v] = Delay - 1;
    }
}

static unsigned If_LogCounter32Add ( unsigned  Count, int *  pStart, int  Num  )

static

Definition at line 372 of file ifCount.h.

{
    int Start = Abc_Lit2Var(*pStart);
    if ( Num < Start )
    {
        *pStart |= 1;
        return Count;
    }
    if ( Num > Start + 16 )
    {
        int Shift = Num - (Start + 16);
        if ( !Abc_LitIsCompl(*pStart) && (Shift >= 32 ? Count : Count & ~(~0 << Shift)) > 0 )
            *pStart |= 1;
        Count >>= Shift;
        Start += Shift;
        *pStart = Abc_Var2Lit( Start, Abc_LitIsCompl(*pStart) );
        assert( Num <= Start + 16 );
    }
    return Count + (1 << (Num-Start));
}

static int If_LogCounter32Eval ( unsigned  Count, int  Start  )

static

Function*************************************************************

Synopsis [Implementation of log-counter.]

Description [Incrementally computes [log2(SUMi(2^di)). Supposed to work correctly up to 16 entries.]

SideEffects []

SeeAlso []

Definition at line 361 of file ifCount.h.

{
    int n = (Abc_LitIsCompl(Start) || (Count & (Count - 1)) > 0) ? -1 : 0;
    assert( Count > 0 );
    if ( (Count & 0xFFFF0000) == 0 ) { n += 16; Count <<= 16; }
    if ( (Count & 0xFF000000) == 0 ) { n +=  8; Count <<=  8; }
    if ( (Count & 0xF0000000) == 0 ) { n +=  4; Count <<=  4; }
    if ( (Count & 0xC0000000) == 0 ) { n +=  2; Count <<=  2; }
    if ( (Count & 0x80000000) == 0 ) { n++; }
    return Abc_Lit2Var(Start) + 31 - n;
}

static word If_LogCounter64Add ( word  Count, int  Num  )

static

Definition at line 343 of file ifCount.h.

{
    assert( Num < 48 );
    return Count + (((word)1) << Num);
}

static int If_LogCounter64Eval ( word  Count )

inlinestatic

Function*************************************************************

Synopsis [Naive implementation of log-counter.]

Description [Incrementally computes [log2(SUMi(2^di)).]

SideEffects []

SeeAlso []

Definition at line 331 of file ifCount.h.

{
    int n = ((Count & (Count - 1)) > 0) ? -1 : 0;
    assert( Count > 0 );
    if ( (Count & ABC_CONST(0xFFFFFFFF00000000)) == 0 ) { n += 32; Count <<= 32; }
    if ( (Count & ABC_CONST(0xFFFF000000000000)) == 0 ) { n += 16; Count <<= 16; }
    if ( (Count & ABC_CONST(0xFF00000000000000)) == 0 ) { n +=  8; Count <<=  8; }
    if ( (Count & ABC_CONST(0xF000000000000000)) == 0 ) { n +=  4; Count <<=  4; }
    if ( (Count & ABC_CONST(0xC000000000000000)) == 0 ) { n +=  2; Count <<=  2; }
    if ( (Count & ABC_CONST(0x8000000000000000)) == 0 ) { n++; }
    return 63 - n;
}

static int If_LogCounterAdd ( int *  pTimes, int *  pnTimes, int  Num, int  fXor  )

inlinestatic

Function*************************************************************

Synopsis [Testing of the counter]

Description []

SideEffects []

SeeAlso [] Function*************************************************************

Synopsis [Adds the number to the numbers stored.]

Description []

SideEffects []

SeeAlso []

Definition at line 454 of file ifCount.h.

{
    int nTimes = *pnTimes;
    pTimes[nTimes++] = Num;
    if ( nTimes > 1 )
    {
        int i, k;
        for ( k = nTimes-1; k > 0; k-- )
        {
            if ( pTimes[k] < pTimes[k-1] )
                break;
            if ( pTimes[k] > pTimes[k-1] )
            { 
                ABC_SWAP( int, pTimes[k], pTimes[k-1] ); 
                continue; 
            }
            pTimes[k-1] += 1 + fXor;
            for ( nTimes--, i = k; i < nTimes; i++ )
                pTimes[i] = pTimes[i+1];
        }
    }
    assert( nTimes > 0 );
    *pnTimes = nTimes;
    return pTimes[0] + (nTimes > 1 ? 1 + fXor : 0);
}

static int If_LogCounterAddAig ( int *  pTimes, int *  pnTimes, int *  pFaninLits, int  Num, int  iLit, Vec_Int_t *  vAig, int  nSuppAll, int  fXor, int  fXorFunc  )

inlinestatic

Definition at line 88 of file ifCount.h.

{
    int nTimes = *pnTimes;
    if ( vAig )
        pFaninLits[nTimes] = iLit;
    pTimes[nTimes++] = Num;
    if ( nTimes > 1 )
    {
        int i, k;
        for ( k = nTimes-1; k > 0; k-- )
        {
            if ( pTimes[k] < pTimes[k-1] )
                break;
            if ( pTimes[k] > pTimes[k-1] )
            { 
                ABC_SWAP( int, pTimes[k], pTimes[k-1] ); 
                if ( vAig )
                    ABC_SWAP( int, pFaninLits[k], pFaninLits[k-1] ); 
                continue; 
            }
            pTimes[k-1] += 1 + fXor;
            if ( vAig )
                pFaninLits[k-1] = If_LogCreateAndXor( vAig, pFaninLits[k], pFaninLits[k-1], nSuppAll, fXorFunc );
            for ( nTimes--, i = k; i < nTimes; i++ )
            {
                pTimes[i] = pTimes[i+1];
                if ( vAig )
                    pFaninLits[i] = pFaninLits[i+1];
            }
        }
    }
    assert( nTimes > 0 );
    *pnTimes = nTimes;
    return pTimes[0] + (nTimes > 1 ? 1 + fXor : 0);
}

static int If_LogCounterDelayXor ( int *  pTimes, int  nTimes  )

inlinestatic

Definition at line 123 of file ifCount.h.

{
    int i;
    assert( nTimes > 0 );
    for ( i = nTimes - 1; i > 0; i-- )
        pTimes[i-1] = 2 + Abc_MaxInt( pTimes[i], pTimes[i-1] );
    return pTimes[0];
}

static int If_LogCounterPinDelays ( int *  pTimes, int *  pnTimes, word *  pPinDels, int  Num, word  PinDel, int  nSuppAll, int  fXor  )

inlinestatic

Definition at line 199 of file ifCount.h.

{
    int nTimes = *pnTimes;
    pPinDels[nTimes] = PinDel;
    pTimes[nTimes++] = Num;
    if ( nTimes > 1 )
    {
        int i, k;
        for ( k = nTimes-1; k > 0; k-- )
        {
            if ( pTimes[k] < pTimes[k-1] )
                break;
            if ( pTimes[k] > pTimes[k-1] )
            { 
                ABC_SWAP( int, pTimes[k], pTimes[k-1] ); 
                ABC_SWAP( word, pPinDels[k], pPinDels[k-1] ); 
                continue; 
            }
            pTimes[k-1] += 1 + fXor;
            pPinDels[k-1] = If_CutPinDelayMax( pPinDels[k], pPinDels[k-1], nSuppAll, 1 + fXor );
            for ( nTimes--, i = k; i < nTimes; i++ )
            {
                pTimes[i] = pTimes[i+1];
                pPinDels[i] = pPinDels[i+1];
            }
        }
    }
    assert( nTimes > 0 );
    *pnTimes = nTimes;
    return pTimes[0] + (nTimes > 1 ? 1 + fXor : 0);
}

static ABC_NAMESPACE_HEADER_START int If_LogCreateAnd ( Vec_Int_t *  vAig, int  iLit0, int  iLit1, int  nSuppAll  )

inlinestatic

INCLUDES ///.

CFile****************************************************************

FileName [ifCount.h]

SystemName [ABC: Logic synthesis and verification system.]

PackageName [FPGA mapping based on priority cuts.]

Synopsis [External declarations.]

Author [Alan Mishchenko]

Affiliation [UC Berkeley]

Date [Ver. 1.0. Started - November 21, 2006.]

Revision [

Id:

ifCount.h,v 1.00 2006/11/21 00:00:00 alanmi Exp

]PARAMETERS ///BASIC TYPES ///MACRO DEFINITIONS ///FUNCTION DECLARATIONS /// Function*************************************************************

Synopsis []

Description []

SideEffects []

SeeAlso []

Definition at line 57 of file ifCount.h.

{
    int iObjId = Vec_IntSize(vAig)/2 + nSuppAll;
    assert( Abc_Lit2Var(iLit0) != Abc_Lit2Var(iLit1) );
    Vec_IntPush( vAig, iLit0 );
    Vec_IntPush( vAig, iLit1 );
    return Abc_Var2Lit( iObjId, 0 );
}

static int If_LogCreateAndXor ( Vec_Int_t *  vAig, int  iLit0, int  iLit1, int  nSuppAll, int  fXor  )

inlinestatic

Definition at line 76 of file ifCount.h.

{
    return fXor ? If_LogCreateXor(vAig, iLit0, iLit1, nSuppAll) : If_LogCreateAnd(vAig, iLit0, iLit1, nSuppAll);
}

static int If_LogCreateAndXorMulti ( Vec_Int_t *  vAig, int *  pFaninLits, int  nFanins, int  nSuppAll, int  fXor  )

inlinestatic

Definition at line 80 of file ifCount.h.

{
    int i;
    assert( nFanins > 0 );
    for ( i = nFanins - 1; i > 0; i-- )
        pFaninLits[i-1] = If_LogCreateAndXor( vAig, pFaninLits[i], pFaninLits[i-1], nSuppAll, fXor );
    return pFaninLits[0];
}

static int If_LogCreateMux ( Vec_Int_t *  vAig, int  iLitC, int  iLit1, int  iLit0, int  nSuppAll  )

inlinestatic

Definition at line 65 of file ifCount.h.

{
    int iFanLit0 = If_LogCreateAnd( vAig, iLitC, iLit1, nSuppAll );
    int iFanLit1 = If_LogCreateAnd( vAig, Abc_LitNot(iLitC), iLit0, nSuppAll );
    int iResLit  = If_LogCreateAnd( vAig, Abc_LitNot(iFanLit0), Abc_LitNot(iFanLit1), nSuppAll );
    return Abc_LitNot(iResLit);
}

static int If_LogCreateXor ( Vec_Int_t *  vAig, int  iLit0, int  iLit1, int  nSuppAll  )

inlinestatic

Definition at line 72 of file ifCount.h.

{
    return If_LogCreateMux( vAig, iLit0, Abc_LitNot(iLit1), iLit1, nSuppAll );
}

static word If_LogPinDelaysMulti ( word *  pPinDels, int  nFanins, int  nSuppAll, int  fXor  )

inlinestatic

Definition at line 230 of file ifCount.h.

{
    int i;
    assert( nFanins > 0 );
    for ( i = nFanins - 1; i > 0; i-- )
        pPinDels[i-1] = If_CutPinDelayMax( pPinDels[i], pPinDels[i-1], nSuppAll, 1 + fXor );
    return pPinDels[0];
}