diff options
Diffstat (limited to 'src/map/mio/exp.h')
| -rw-r--r-- | src/map/mio/exp.h | 218 |
1 files changed, 218 insertions, 0 deletions
diff --git a/src/map/mio/exp.h b/src/map/mio/exp.h new file mode 100644 index 00000000..fa643325 --- /dev/null +++ b/src/map/mio/exp.h @@ -0,0 +1,218 @@ +/**CFile**************************************************************** + + FileName [exp.h] + + SystemName [ABC: Logic synthesis and verification system.] + + PackageName [Boolean expression.] + + Synopsis [External declarations.] + + Author [Alan Mishchenko] + + Affiliation [UC Berkeley] + + Date [Ver. 1.0. Started - June 20, 2005.] + + Revision [$Id: exp.h,v 1.00 2005/06/20 00:00:00 alanmi Exp $] + +***********************************************************************/ + +#ifndef __EXP_H__ +#define __EXP_H__ + +//////////////////////////////////////////////////////////////////////// +/// INCLUDES /// +//////////////////////////////////////////////////////////////////////// + +//////////////////////////////////////////////////////////////////////// +/// PARAMETERS /// +//////////////////////////////////////////////////////////////////////// + + +ABC_NAMESPACE_HEADER_START + +//////////////////////////////////////////////////////////////////////// +/// BASIC TYPES /// +//////////////////////////////////////////////////////////////////////// + +//////////////////////////////////////////////////////////////////////// +/// MACRO DEFINITIONS /// +//////////////////////////////////////////////////////////////////////// + +#define EXP_CONST0 -1 +#define EXP_CONST1 -2 + +static inline Vec_Int_t * Exp_Const0() +{ + Vec_Int_t * vExp; + vExp = Vec_IntAlloc( 1 ); + Vec_IntPush( vExp, EXP_CONST0 ); + return vExp; +} +static inline Vec_Int_t * Exp_Const1() +{ + Vec_Int_t * vExp; + vExp = Vec_IntAlloc( 1 ); + Vec_IntPush( vExp, EXP_CONST1 ); + return vExp; +} +static inline int Exp_IsConst( Vec_Int_t * p ) +{ + return Vec_IntEntry(p,0) == EXP_CONST0 || Vec_IntEntry(p,0) == EXP_CONST1; +} +static inline int Exp_IsConst0( Vec_Int_t * p ) +{ + return Vec_IntEntry(p,0) == EXP_CONST0; +} +static inline int Exp_IsConst1( Vec_Int_t * p ) +{ + return Vec_IntEntry(p,0) == EXP_CONST1; +} +static inline Vec_Int_t * Exp_Var( int iVar ) +{ + Vec_Int_t * vExp; + vExp = Vec_IntAlloc( 1 ); + Vec_IntPush( vExp, 2 * iVar ); + return vExp; +} +static inline int Exp_LitShift( int nVars, int Lit, int Shift ) +{ + if ( Lit < 2 * nVars ) + return Lit; + return Lit + 2 * Shift; +} +static inline int Exp_IsLit( Vec_Int_t * p ) +{ + return Vec_IntSize(p) == 1 && !Exp_IsConst(p); +} +static inline int Exp_NodeNum( Vec_Int_t * p ) +{ + return Vec_IntSize(p)/2; +} +static inline Vec_Int_t * Exp_Not( Vec_Int_t * p ) +{ + Vec_IntWriteEntry( p, 0, Vec_IntEntry(p,0) ^ 1 ); + return p; +} +static inline void Exp_PrintLit( int nVars, int Lit ) +{ + if ( Lit == EXP_CONST0 ) + Abc_Print( 1, "Const0" ); + else if ( Lit == EXP_CONST1 ) + Abc_Print( 1, "Const1" ); + else if ( Lit < 2 * nVars ) + Abc_Print( 1, "%s%c", (Lit&1) ? "!" : " ", 'a' + Lit/2 ); + else + Abc_Print( 1, "%s%d", (Lit&1) ? "!" : " ", Lit/2 ); +} +static inline void Exp_Print( int nVars, Vec_Int_t * p ) +{ + int i; + for ( i = 0; i < Exp_NodeNum(p); i++ ) + { + Abc_Print( 1, "%2d = ", nVars + i ); + Exp_PrintLit( nVars, Vec_IntEntry(p, 2*i+0) ); + Abc_Print( 1, " & " ); + Exp_PrintLit( nVars, Vec_IntEntry(p, 2*i+1) ); + Abc_Print( 1, "\n" ); + } + Abc_Print( 1, " F = " ); + Exp_PrintLit( nVars, Vec_IntEntryLast(p) ); + Abc_Print( 1, "\n" ); +} +static inline Vec_Int_t * Exp_Reverse( Vec_Int_t * p ) +{ + Vec_IntReverseOrder( p ); + return p; +} +static inline void Exp_PrintReverse( int nVars, Vec_Int_t * p ) +{ + Exp_Reverse( p ); + Exp_Print( nVars, p ); + Exp_Reverse( p ); +} +static inline Vec_Int_t * Exp_And( int * pMan, int nVars, Vec_Int_t * p0, Vec_Int_t * p1, int fCompl0, int fCompl1 ) +{ + int i, Len0 = Vec_IntSize(p0), Len1 = Vec_IntSize(p1); + Vec_Int_t * r = Vec_IntAlloc( Len0 + Len1 + 1 ); + assert( (Len0 & 1) && (Len1 & 1) ); + Vec_IntPush( r, 2 * (nVars + Len0/2 + Len1/2) ); + Vec_IntPush( r, Exp_LitShift( nVars, Vec_IntEntry(p0, 0) ^ fCompl0, Len1/2 ) ); + Vec_IntPush( r, Vec_IntEntry(p1, 0) ^ fCompl1 ); + for ( i = 1; i < Len0; i++ ) + Vec_IntPush( r, Exp_LitShift( nVars, Vec_IntEntry(p0, i), Len1/2 ) ); + for ( i = 1; i < Len1; i++ ) + Vec_IntPush( r, Vec_IntEntry(p1, i) ); + assert( Vec_IntSize(r) == Len0 + Len1 + 1 ); + return r; +} +static inline Vec_Int_t * Exp_Or( int * pMan, int nVars, Vec_Int_t * p0, Vec_Int_t * p1 ) +{ + return Exp_Not( Exp_And(pMan, nVars, p0, p1, 1, 1) ); +} +static inline Vec_Int_t * Exp_Xor( int * pMan, int nVars, Vec_Int_t * p0, Vec_Int_t * p1 ) +{ + int i, v = 0, Len0 = Vec_IntSize(p0), Len1 = Vec_IntSize(p1); + Vec_Int_t * r = Vec_IntAlloc( Len0 + Len1 + 5 ); + assert( (Len0 & 1) && (Len1 & 1) ); + Vec_IntPush( r, 2 * (nVars + Len0/2 + Len1/2 + 2) ); + Vec_IntPush( r, 2 * (nVars + Len0/2 + Len1/2 + 1) + 1 ); + Vec_IntPush( r, 2 * (nVars + Len0/2 + Len1/2 + 0) + 1 ); + Vec_IntPush( r, Exp_LitShift( nVars, Vec_IntEntry(p0, 0) ^ 1, Len1/2 ) ); + Vec_IntPush( r, Vec_IntEntry(p1, 0) ); + Vec_IntPush( r, Exp_LitShift( nVars, Vec_IntEntry(p0, 0), Len1/2 ) ); + Vec_IntPush( r, Vec_IntEntry(p1, 0) ^ 1 ); + for ( i = 1; i < Len0; i++ ) + Vec_IntPush( r, Exp_LitShift( nVars, Vec_IntEntry(p0, i), Len1/2 ) ); + for ( i = 1; i < Len1; i++ ) + Vec_IntPush( r, Vec_IntEntry(p1, i) ); + assert( Vec_IntSize(r) == Len0 + Len1 + 5 ); + return Exp_Not( r ); +} +static inline word Exp_Truth6Lit( int nVars, int Lit, word * puFanins, word * puNodes ) +{ + if ( Lit == EXP_CONST0 ) + return 0; + if ( Lit == EXP_CONST1 ) + return ~0; + if ( Lit < 2 * nVars ) + return (Lit&1) ? ~puFanins[Lit/2] : puFanins[Lit/2]; + return (Lit&1) ? ~puNodes[Lit/2-nVars] : puNodes[Lit/2-nVars]; +} +static inline word Exp_Truth6( int nVars, Vec_Int_t * p, word * puFanins ) +{ + static word Truth6[6] = { + 0xAAAAAAAAAAAAAAAA, + 0xCCCCCCCCCCCCCCCC, + 0xF0F0F0F0F0F0F0F0, + 0xFF00FF00FF00FF00, + 0xFFFF0000FFFF0000, + 0xFFFFFFFF00000000 + }; + word * puNodes, Res; + int i; + if ( puFanins == NULL ) + puFanins = (word *)Truth6; + puNodes = ABC_CALLOC( word, Exp_NodeNum(p) ); + for ( i = 0; i < Exp_NodeNum(p); i++ ) + puNodes[i] = Exp_Truth6Lit( nVars, Vec_IntEntry(p, 2*i+0), puFanins, puNodes ) & + Exp_Truth6Lit( nVars, Vec_IntEntry(p, 2*i+1), puFanins, puNodes ); + Res = Exp_Truth6Lit( nVars, Vec_IntEntryLast(p), puFanins, puNodes ); + ABC_FREE( puNodes ); + return Res; +} + +//////////////////////////////////////////////////////////////////////// +/// FUNCTION DECLARATIONS /// +//////////////////////////////////////////////////////////////////////// + +ABC_NAMESPACE_HEADER_END + + +#endif + +//////////////////////////////////////////////////////////////////////// +/// END OF FILE /// +//////////////////////////////////////////////////////////////////////// + |