summaryrefslogtreecommitdiffstats
path: root/src/aig/gia/giaJf.c
diff options
context:
space:
mode:
authorAlan Mishchenko <alanmi@berkeley.edu>2013-09-09 10:31:21 -0700
committerAlan Mishchenko <alanmi@berkeley.edu>2013-09-09 10:31:21 -0700
commitc05e141d1f7e3ad8f491fe0a4e185137f95fea5e (patch)
tree013328bf485c294ba0304d7a35987b09c0654e87 /src/aig/gia/giaJf.c
parentfba43b50655b41f3a12dc910a475e4e3568e4de7 (diff)
downloadabc-c05e141d1f7e3ad8f491fe0a4e185137f95fea5e.tar.gz
abc-c05e141d1f7e3ad8f491fe0a4e185137f95fea5e.tar.bz2
abc-c05e141d1f7e3ad8f491fe0a4e185137f95fea5e.zip
Improvements to the new technology mapper.
Diffstat (limited to 'src/aig/gia/giaJf.c')
-rw-r--r--src/aig/gia/giaJf.c39
1 files changed, 31 insertions, 8 deletions
diff --git a/src/aig/gia/giaJf.c b/src/aig/gia/giaJf.c
index 8779c9b8..7e48efd2 100644
--- a/src/aig/gia/giaJf.c
+++ b/src/aig/gia/giaJf.c
@@ -35,7 +35,7 @@ ABC_NAMESPACE_IMPL_START
typedef struct Jf_Cut_t_ Jf_Cut_t;
struct Jf_Cut_t_
{
- unsigned Sign;
+ word Sign;
float Flow;
int Time;
int iFunc;
@@ -231,18 +231,40 @@ static inline void Jf_CutCheck( int * pCut )
for ( k = 1; k < i; k++ )
assert( Jf_CutLit(pCut, i) != Jf_CutLit(pCut, k) );
}
-static inline unsigned Jf_CutGetSign( int * pCut )
+static inline int Jf_CountBitsSimple( unsigned n )
+{
+ int i, Count = 0;
+ for ( i = 0; i < 32; i++ )
+ Count += ((n >> i) & 1);
+ return Count;
+}
+static inline int Jf_CountBits32( unsigned i )
+{
+ i = i - ((i >> 1) & 0x55555555);
+ i = (i & 0x33333333) + ((i >> 2) & 0x33333333);
+ i = ((i + (i >> 4)) & 0x0F0F0F0F);
+ return (i*(0x01010101))>>24;
+}
+static inline int Jf_CountBits( word i )
+{
+ i = i - ((i >> 1) & 0x5555555555555555);
+ i = (i & 0x3333333333333333) + ((i >> 2) & 0x3333333333333333);
+ i = ((i + (i >> 4)) & 0x0F0F0F0F0F0F0F0F);
+ return (i*(0x0101010101010101))>>56;
+}
+static inline unsigned Jf_CutGetSign32( int * pCut )
{
unsigned Sign = 0; int i;
for ( i = 1; i <= Jf_CutSize(pCut); i++ )
Sign |= 1 << (Jf_CutVar(pCut, i) & 0x1F);
return Sign;
}
-static inline int Jf_CountBits( unsigned i )
+static inline word Jf_CutGetSign( int * pCut )
{
- i = i - ((i >> 1) & 0x55555555);
- i = (i & 0x33333333) + ((i >> 2) & 0x33333333);
- return (((i + (i >> 4)) & 0x0F0F0F0F) * 0x01010101) >> 24;
+ word Sign = 0; int i;
+ for ( i = 1; i <= Jf_CutSize(pCut); i++ )
+ Sign |= ((word)1) << (Jf_CutVar(pCut, i) & 0x3F);
+ return Sign;
}
static inline int Jf_CutArr( Jf_Man_t * p, int * pCut )
{
@@ -251,6 +273,7 @@ static inline int Jf_CutArr( Jf_Man_t * p, int * pCut )
Time = Abc_MaxInt( Time, Jf_ObjArr(p, Jf_CutVar(pCut, i)) );
return Time + 1;
}
+
static inline void Jf_ObjSetBestCut( int * pCuts, int * pCut, Vec_Int_t * vTemp )
{
assert( pCuts < pCut );
@@ -738,8 +761,8 @@ void Jf_ObjComputeCuts( Jf_Man_t * p, Gia_Obj_t * pObj )
int LutSize = p->pPars->nLutSize;
int CutNum = p->pPars->nCutNum;
int iObj = Gia_ObjId(p->pGia, pObj);
- unsigned Sign0[JF_CUT_MAX+1]; // signatures of the first cut
- unsigned Sign1[JF_CUT_MAX+1]; // signatures of the second cut
+ word Sign0[JF_CUT_MAX+1]; // signatures of the first cut
+ word Sign1[JF_CUT_MAX+1]; // signatures of the second cut
Jf_Cut_t Sto[JF_CUT_MAX+1]; // cut storage
Jf_Cut_t * pSto[JF_CUT_MAX+1]; // pointers to cut storage
int * pCut0, * pCut1, * pCuts0, * pCuts1;