From cad3d8d4199b861db1044a485ee4f53712ccb1bc Mon Sep 17 00:00:00 2001
From: Alan Mishchenko <alanmi@berkeley.edu>
Date: Tue, 7 Jun 2016 15:20:38 -0700
Subject: Support bit-blasting of shifts with more than 32 bits.

---
 src/base/wlc/wlcBlast.c | 36 ++++++++++++++++++++++++++++++------
 1 file changed, 30 insertions(+), 6 deletions(-)

(limited to 'src/base/wlc')

diff --git a/src/base/wlc/wlcBlast.c b/src/base/wlc/wlcBlast.c
index 59562432..fbace4ab 100644
--- a/src/base/wlc/wlcBlast.c
+++ b/src/base/wlc/wlcBlast.c
@@ -121,13 +121,11 @@ int Wlc_NtkMuxTree_rec( Gia_Man_t * pNew, int * pCtrl, int nCtrl, Vec_Int_t * vD
   SeeAlso     []
 
 ***********************************************************************/
-void Wlc_BlastShiftRight( Gia_Man_t * pNew, int * pNum, int nNum, int * pShift, int nShift, int fSticky, Vec_Int_t * vRes )
+void Wlc_BlastShiftRightInt( Gia_Man_t * pNew, int * pNum, int nNum, int * pShift, int nShift, int fSticky, Vec_Int_t * vRes )
 {
     int * pRes = Wlc_VecCopy( vRes, pNum, nNum );
     int Fill = fSticky ? pNum[nNum-1] : 0;
     int i, j, fShort = 0;
-    if ( nShift > 32 )
-        nShift = 32;
     assert( nShift <= 32 );
     for( i = 0; i < nShift; i++ ) 
         for( j = 0; j < nNum - fSticky; j++ ) 
@@ -142,13 +140,25 @@ void Wlc_BlastShiftRight( Gia_Man_t * pNew, int * pNum, int nNum, int * pShift,
                 pRes[j] = Gia_ManHashMux( pNew, pShift[i], pRes[j+(1<<i)], pRes[j] );
         }
 }
-void Wlc_BlastShiftLeft( Gia_Man_t * pNew, int * pNum, int nNum, int * pShift, int nShift, int fSticky, Vec_Int_t * vRes )
+void Wlc_BlastShiftRight( Gia_Man_t * pNew, int * pNum, int nNum, int * pShift, int nShift, int fSticky, Vec_Int_t * vRes )
+{
+    int nShiftMax = Abc_Base2Log(nNum);
+    if ( nShiftMax < nShift )
+    {
+        int i, iRes = pShift[nShiftMax];
+        for ( i = nShiftMax + 1; i < nShift; i++ )
+            iRes = Gia_ManHashOr( pNew, iRes, pShift[i] );
+        pShift[nShiftMax] = iRes;
+    }
+    else 
+        nShiftMax = nShift;
+    Wlc_BlastShiftRightInt( pNew, pNum, nNum, pShift, nShiftMax, fSticky, vRes );
+}
+void Wlc_BlastShiftLeftInt( Gia_Man_t * pNew, int * pNum, int nNum, int * pShift, int nShift, int fSticky, Vec_Int_t * vRes )
 {
     int * pRes = Wlc_VecCopy( vRes, pNum, nNum );
     int Fill = fSticky ? pNum[0] : 0;
     int i, j, fShort = 0;
-    if ( nShift > 32 )
-        nShift = 32;
     assert( nShift <= 32 );
     for( i = 0; i < nShift; i++ ) 
         for( j = nNum-1; j >= fSticky; j-- ) 
@@ -163,6 +173,20 @@ void Wlc_BlastShiftLeft( Gia_Man_t * pNew, int * pNum, int nNum, int * pShift, i
                 pRes[j] = Gia_ManHashMux( pNew, pShift[i], pRes[j-(1<<i)], pRes[j] );
         }
 }
+void Wlc_BlastShiftLeft( Gia_Man_t * pNew, int * pNum, int nNum, int * pShift, int nShift, int fSticky, Vec_Int_t * vRes )
+{
+    int nShiftMax = Abc_Base2Log(nNum);
+    if ( nShiftMax < nShift )
+    {
+        int i, iRes = pShift[nShiftMax];
+        for ( i = nShiftMax + 1; i < nShift; i++ )
+            iRes = Gia_ManHashOr( pNew, iRes, pShift[i] );
+        pShift[nShiftMax] = iRes;
+    }
+    else 
+        nShiftMax = nShift;
+    Wlc_BlastShiftLeftInt( pNew, pNum, nNum, pShift, nShiftMax, fSticky, vRes );
+}
 void Wlc_BlastRotateRight( Gia_Man_t * pNew, int * pNum, int nNum, int * pShift, int nShift, Vec_Int_t * vRes )
 {
     int * pRes = Wlc_VecCopy( vRes, pNum, nNum );
-- 
cgit v1.2.3