/**CFile**************************************************************** FileName [wlcBlast.c] SystemName [ABC: Logic synthesis and verification system.] PackageName [Verilog parser.] Synopsis [Bit-blasting.] Author [Alan Mishchenko] Affiliation [UC Berkeley] Date [Ver. 1.0. Started - August 22, 2014.] Revision [$Id: wlcBlast.c,v 1.00 2014/09/12 00:00:00 alanmi Exp $] ***********************************************************************/ #include "wlc.h" #include "misc/tim/tim.h" ABC_NAMESPACE_IMPL_START //////////////////////////////////////////////////////////////////////// /// DECLARATIONS /// //////////////////////////////////////////////////////////////////////// //////////////////////////////////////////////////////////////////////// /// FUNCTION DEFINITIONS /// //////////////////////////////////////////////////////////////////////// /**Function************************************************************* Synopsis [Counts constant bits.] Description [] SideEffects [] SeeAlso [] ***********************************************************************/ int Wlc_NtkCountConstBits( int * pArray, int nSize ) { int i, Counter = 0; for ( i = 0; i < nSize; i++ ) Counter += (pArray[i] == 0 || pArray[i] == 1); return Counter; } /**Function************************************************************* Synopsis [Helper functions.] Description [] SideEffects [] SeeAlso [] ***********************************************************************/ int Wlc_NtkPrepareBits( Wlc_Ntk_t * p ) { Wlc_Obj_t * pObj; int i, nBits = 0; Wlc_NtkCleanCopy( p ); Wlc_NtkForEachObj( p, pObj, i ) { Wlc_ObjSetCopy( p, i, nBits ); nBits += Wlc_ObjRange(pObj); } return nBits; } int * Wlc_VecCopy( Vec_Int_t * vOut, int * pArray, int nSize ) { int i; Vec_IntClear( vOut ); for( i = 0; i < nSize; i++) Vec_IntPush( vOut, pArray[i] ); return Vec_IntArray( vOut ); } int * Wlc_VecLoadFanins( Vec_Int_t * vOut, int * pFanins, int nFanins, int nTotal, int fSigned ) { int Fill = fSigned ? pFanins[nFanins-1] : 0; int i; Vec_IntClear( vOut ); assert( nFanins <= nTotal ); for( i = 0; i < nTotal; i++) Vec_IntPush( vOut, i < nFanins ? pFanins[i] : Fill ); return Vec_IntArray( vOut ); } int Wlc_BlastGetConst( int * pNum, int nNum ) { int i, Res = 0; for ( i = 0; i < nNum; i++ ) if ( pNum[i] == 1 ) Res |= (1 << i); else if ( pNum[i] != 0 ) return -1; return Res; } int Wlc_NtkMuxTree_rec( Gia_Man_t * pNew, int * pCtrl, int nCtrl, Vec_Int_t * vData, int Shift ) { int iLit0, iLit1; if ( nCtrl == 0 ) return Vec_IntEntry( vData, Shift ); iLit0 = Wlc_NtkMuxTree_rec( pNew, pCtrl, nCtrl-1, vData, Shift ); iLit1 = Wlc_NtkMuxTree_rec( pNew, pCtrl, nCtrl-1, vData, Shift + (1<<(nCtrl-1)) ); return Gia_ManHashMux( pNew, pCtrl[nCtrl-1], iLit1, iLit0 ); } /**Function************************************************************* Synopsis [Bit blasting for specific operations.] Description [] SideEffects [] SeeAlso [] ***********************************************************************/ void Wlc_BlastShiftRight( 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++ ) { if( fShort || j + (1<= nNum ) { pRes[j] = Gia_ManHashMux( pNew, pShift[i], Fill, pRes[j] ); if ( (1< nNum ) fShort = 1; } else pRes[j] = Gia_ManHashMux( pNew, pShift[i], pRes[j+(1< 32 ) nShift = 32; assert( nShift <= 32 ); for( i = 0; i < nShift; i++ ) for( j = nNum-1; j >= fSticky; j-- ) { if( fShort || (1< j ) { pRes[j] = Gia_ManHashMux( pNew, pShift[i], Fill, pRes[j] ); if ( (1< nNum ) fShort = 1; } else pRes[j] = Gia_ManHashMux( pNew, pShift[i], pRes[j-(1<= (1<= 0; k-- ) { iRes = Gia_ManHashMux( pNew, iKnown, iRes, Gia_ManHashAnd(pNew, Abc_LitNot(pArg0[k]), pArg1[k]) ); iKnown = Gia_ManHashOr( pNew, iKnown, Gia_ManHashXor(pNew, pArg0[k], pArg1[k]) ); if ( iKnown == 1 ) break; } return iRes; } void Wlc_BlastLess_rec( Gia_Man_t * pNew, int * pArg0, int * pArg1, int nBits, int * pYes, int * pNo ) { if ( nBits > 1 ) { int Yes = Gia_ManHashAnd( pNew, Abc_LitNot(pArg0[nBits-1]), pArg1[nBits-1] ), YesR; int No = Gia_ManHashAnd( pNew, Abc_LitNot(pArg1[nBits-1]), pArg0[nBits-1] ), NoR; if ( Yes == 1 || No == 1 ) { *pYes = Yes; *pNo = No; return; } Wlc_BlastLess_rec( pNew, pArg0, pArg1, nBits-1, &YesR, &NoR ); *pYes = Gia_ManHashOr( pNew, Yes, Gia_ManHashAnd(pNew, Abc_LitNot(No), YesR) ); *pNo = Gia_ManHashOr( pNew, No, Gia_ManHashAnd(pNew, Abc_LitNot(Yes), NoR ) ); return; } assert( nBits == 1 ); *pYes = Gia_ManHashAnd( pNew, Abc_LitNot(pArg0[0]), pArg1[0] ); *pNo = Gia_ManHashAnd( pNew, Abc_LitNot(pArg1[0]), pArg0[0] ); } int Wlc_BlastLess( Gia_Man_t * pNew, int * pArg0, int * pArg1, int nBits ) { int Yes, No; if ( nBits == 0 ) return 0; Wlc_BlastLess_rec( pNew, pArg0, pArg1, nBits, &Yes, &No ); return Yes; } int Wlc_BlastLessSigned( Gia_Man_t * pNew, int * pArg0, int * pArg1, int nBits ) { int iDiffSign = Gia_ManHashXor( pNew, pArg0[nBits-1], pArg1[nBits-1] ); return Gia_ManHashMux( pNew, iDiffSign, pArg0[nBits-1], Wlc_BlastLess(pNew, pArg0, pArg1, nBits-1) ); } void Wlc_BlastFullAdder( Gia_Man_t * pNew, int a, int b, int c, int * pc, int * ps ) { int fUseXor = 0; if ( fUseXor ) { int Xor = Gia_ManHashXor(pNew, a, b); int And1 = Gia_ManHashAnd(pNew, a, b); int And2 = Gia_ManHashAnd(pNew, c, Xor); *ps = Gia_ManHashXor(pNew, c, Xor); *pc = Gia_ManHashOr (pNew, And1, And2); } else { int And1 = Gia_ManHashAnd(pNew, a, b); int And1_= Gia_ManHashAnd(pNew, Abc_LitNot(a), Abc_LitNot(b)); int Xor = Abc_LitNot(Gia_ManHashOr(pNew, And1, And1_)); int And2 = Gia_ManHashAnd(pNew, c, Xor); int And2_= Gia_ManHashAnd(pNew, Abc_LitNot(c), Abc_LitNot(Xor)); *ps = Abc_LitNot(Gia_ManHashOr(pNew, And2, And2_)); *pc = Gia_ManHashOr (pNew, And1, And2); } } void Wlc_BlastAdder( Gia_Man_t * pNew, int * pAdd0, int * pAdd1, int nBits ) // result is in pAdd0 { int b, Carry = 0; for ( b = 0; b < nBits; b++ ) Wlc_BlastFullAdder( pNew, pAdd0[b], pAdd1[b], Carry, &Carry, &pAdd0[b] ); } void Wlc_BlastSubtract( Gia_Man_t * pNew, int * pAdd0, int * pAdd1, int nBits ) // result is in pAdd0 { int b, Carry = 1; for ( b = 0; b < nBits; b++ ) Wlc_BlastFullAdder( pNew, pAdd0[b], Abc_LitNot(pAdd1[b]), Carry, &Carry, &pAdd0[b] ); } void Wlc_BlastAdderCLA_one( Gia_Man_t * pNew, int * pGen, int * pPro, int * pCar, int * pGen1, int * pPro1, int * pCar1 ) { int Temp = Gia_ManHashAnd( pNew, pGen[0], pPro[1] ); *pPro1 = Gia_ManHashAnd( pNew, pPro[0], pPro[1] ); *pGen1 = Gia_ManHashOr( pNew, Gia_ManHashOr(pNew, pGen[1], Temp), Gia_ManHashAnd(pNew, *pPro1, pCar[0]) ); *pCar1 = Gia_ManHashOr( pNew, pGen[0], Gia_ManHashAnd(pNew, pPro[0], pCar[0]) ); } void Wlc_BlastAdderCLA_rec( Gia_Man_t * pNew, int * pGen, int * pPro, int * pCar, int nBits, int * pGen1, int * pPro1 ) { if ( nBits == 2 ) Wlc_BlastAdderCLA_one( pNew, pGen, pPro, pCar, pGen1, pPro1, pCar+1 ); // returns *pGen1, *pPro1, pCar[1] else { int pGen2[2], pPro2[2]; assert( nBits % 2 == 0 ); // call recursively Wlc_BlastAdderCLA_rec( pNew, pGen, pPro, pCar, nBits/2, pGen2, pPro2 ); pCar[nBits/2] = *pGen2; Wlc_BlastAdderCLA_rec( pNew, pGen+nBits/2, pPro+nBits/2, pCar+nBits/2, nBits/2, pGen2+1, pPro2+1 ); // create structure Wlc_BlastAdderCLA_one( pNew, pGen2, pPro2, pCar, pGen1, pPro1, pCar+nBits/2 ); // returns *pGen1, *pPro1, pCar[nBits/2] } } void Wlc_BlastAdderCLA( Gia_Man_t * pNew, int * pAdd0, int * pAdd1, int nBits ) // result is in pAdd0 { int * pGen = ABC_CALLOC( int, nBits ); int * pPro = ABC_CALLOC( int, nBits ); int * pCar = ABC_CALLOC( int, nBits+1 ); int b, Gen, Pro; if ( nBits == 1 ) { int Carry = 0; Wlc_BlastFullAdder( pNew, pAdd0[0], pAdd1[0], Carry, &Carry, &pAdd0[0] ); return; } assert( nBits >= 2 ); pCar[0] = 0; for ( b = 0; b < nBits; b++ ) { pGen[b] = Gia_ManHashAnd(pNew, pAdd0[b], pAdd1[b]); pPro[b] = Gia_ManHashXor(pNew, pAdd0[b], pAdd1[b]); } Wlc_BlastAdderCLA_rec( pNew, pGen, pPro, pCar, nBits, &Gen, &Pro ); for ( b = 0; b < nBits; b++ ) pAdd0[b] = Gia_ManHashXor(pNew, pPro[b], pCar[b]); ABC_FREE(pGen); ABC_FREE(pPro); ABC_FREE(pCar); } void Wlc_BlastMinus( Gia_Man_t * pNew, int * pNum, int nNum, Vec_Int_t * vRes ) { int * pRes = Wlc_VecCopy( vRes, pNum, nNum ); int i, invert = 0; for ( i = 0; i < nNum; i++ ) { pRes[i] = Gia_ManHashMux( pNew, invert, Abc_LitNot(pRes[i]), pRes[i] ); invert = Gia_ManHashOr( pNew, invert, pNum[i] ); } } void Wlc_BlastMultiplier2( Gia_Man_t * pNew, int * pArg0, int * pArg1, int nBits, Vec_Int_t * vTemp, Vec_Int_t * vRes ) { int i, j; Vec_IntFill( vRes, nBits, 0 ); for ( i = 0; i < nBits; i++ ) { Vec_IntFill( vTemp, i, 0 ); for ( j = 0; Vec_IntSize(vTemp) < nBits; j++ ) Vec_IntPush( vTemp, Gia_ManHashAnd(pNew, pArg0[j], pArg1[i]) ); assert( Vec_IntSize(vTemp) == nBits ); Wlc_BlastAdder( pNew, Vec_IntArray(vRes), Vec_IntArray(vTemp), nBits ); } } void Wlc_BlastFullAdderCtrl( Gia_Man_t * pNew, int a, int ac, int b, int c, int * pc, int * ps, int fNeg ) { int And = Abc_LitNotCond( Gia_ManHashAnd(pNew, a, ac), fNeg ); Wlc_BlastFullAdder( pNew, And, b, c, pc, ps ); } void Wlc_BlastFullAdderSubtr( Gia_Man_t * pNew, int a, int b, int c, int * pc, int * ps, int fSub ) { Wlc_BlastFullAdder( pNew, Gia_ManHashXor(pNew, a, fSub), b, c, pc, ps ); } void Wlc_BlastMultiplier( Gia_Man_t * pNew, int * pArgA, int * pArgB, int nArgA, int nArgB, Vec_Int_t * vTemp, Vec_Int_t * vRes, int fSigned ) { int * pRes, * pArgC, * pArgS, a, b, Carry = fSigned; assert( nArgA > 0 && nArgB > 0 ); assert( fSigned == 0 || fSigned == 1 ); // prepare result Vec_IntFill( vRes, nArgA + nArgB, 0 ); pRes = Vec_IntArray( vRes ); // prepare intermediate storage Vec_IntFill( vTemp, 2 * nArgA, 0 ); pArgC = Vec_IntArray( vTemp ); pArgS = pArgC + nArgA; // create matrix for ( b = 0; b < nArgB; b++ ) for ( a = 0; a < nArgA; a++ ) Wlc_BlastFullAdderCtrl( pNew, pArgA[a], pArgB[b], pArgS[a], pArgC[a], &pArgC[a], a ? &pArgS[a-1] : &pRes[b], fSigned && ((a+1 == nArgA) ^ (b+1 == nArgB)) ); // final addition pArgS[nArgA-1] = fSigned; for ( a = 0; a < nArgA; a++ ) Wlc_BlastFullAdderCtrl( pNew, 1, pArgC[a], pArgS[a], Carry, &Carry, &pRes[nArgB+a], 0 ); } void Wlc_BlastDivider( Gia_Man_t * pNew, int * pNum, int nNum, int * pDiv, int nDiv, int fQuo, Vec_Int_t * vRes ) { int * pRes = Wlc_VecCopy( vRes, pNum, nNum ); int * pQuo = ABC_ALLOC( int, nNum ); int * pTemp = ABC_ALLOC( int, nNum ); int i, j, known, borrow, y_bit, top_bit; assert( nNum == nDiv ); for ( j = nNum - 1; j >= 0; j-- ) { known = 0; for ( i = nNum - 1; i > nNum - 1 - j; i-- ) { known = Gia_ManHashOr( pNew, known, pDiv[i] ); if( known == 1 ) break; } pQuo[j] = known; for ( i = nNum - 1; i >= 0; i-- ) { if ( known == 1 ) break; y_bit = (i >= j) ? pDiv[i-j] : 0; pQuo[j] = Gia_ManHashMux( pNew, known, pQuo[j], Gia_ManHashAnd( pNew, y_bit, Abc_LitNot(pRes[i]) ) ); known = Gia_ManHashOr( pNew, known, Gia_ManHashXor(pNew, y_bit, pRes[i])); } pQuo[j] = Abc_LitNot(pQuo[j]); if ( pQuo[j] == 0 ) continue; borrow = 0; for ( i = 0; i < nNum; i++ ) { top_bit = Gia_ManHashMux( pNew, borrow, Abc_LitNot(pRes[i]), pRes[i] ); y_bit = (i >= j) ? pDiv[i-j] : 0; borrow = Gia_ManHashMux( pNew, pRes[i], Gia_ManHashAnd(pNew, borrow, y_bit), Gia_ManHashOr(pNew, borrow, y_bit) ); pTemp[i] = Gia_ManHashXor( pNew, top_bit, y_bit ); } if ( pQuo[j] == 1 ) Wlc_VecCopy( vRes, pTemp, nNum ); else for( i = 0; i < nNum; i++ ) pRes[i] = Gia_ManHashMux( pNew, pQuo[j], pTemp[i], pRes[i] ); } ABC_FREE( pTemp ); if ( fQuo ) Wlc_VecCopy( vRes, pQuo, nNum ); ABC_FREE( pQuo ); } // non-restoring divider void Wlc_BlastDivider2( Gia_Man_t * pNew, int * pNum, int nNum, int * pDiv, int nDiv, int fQuo, Vec_Int_t * vRes ) { int i, * pRes = Vec_IntArray(vRes); int k, * pQuo = ABC_ALLOC( int, nNum ); assert( nNum > 0 && nDiv > 0 ); assert( Vec_IntSize(vRes) < nNum + nDiv ); for ( i = 0; i < nNum + nDiv; i++ ) pRes[i] = i < nNum ? pNum[i] : 0; for ( i = nNum-1; i >= 0; i-- ) { int Cntrl = i == nNum-1 ? 1 : pQuo[i+1]; int Carry = Cntrl; for ( k = 0; k <= nDiv; k++ ) Wlc_BlastFullAdderSubtr( pNew, k < nDiv ? pDiv[k] : 0, pRes[i+k], Carry, &Carry, &pRes[i+k], Cntrl ); pQuo[i] = Abc_LitNot(pRes[i+nDiv]); } if ( fQuo ) Wlc_VecCopy( vRes, pQuo, nNum ); else { int Carry = 0, Temp; for ( k = 0; k < nDiv; k++ ) { Wlc_BlastFullAdder( pNew, pDiv[k], pRes[k], Carry, &Carry, &Temp ); pRes[k] = Gia_ManHashMux( pNew, pQuo[0], pRes[k], Temp ); } Vec_IntShrink( vRes, nDiv ); } ABC_FREE( pQuo ); } void Wlc_BlastDividerSigned( Gia_Man_t * pNew, int * pNum, int nNum, int * pDiv, int nDiv, int fQuo, Vec_Int_t * vRes ) { Vec_Int_t * vNum = Vec_IntAlloc( nNum ); Vec_Int_t * vDiv = Vec_IntAlloc( nDiv ); Vec_Int_t * vRes00 = Vec_IntAlloc( nNum + nDiv ); Vec_Int_t * vRes01 = Vec_IntAlloc( nNum + nDiv ); Vec_Int_t * vRes10 = Vec_IntAlloc( nNum + nDiv ); Vec_Int_t * vRes11 = Vec_IntAlloc( nNum + nDiv ); Vec_Int_t * vRes2 = Vec_IntAlloc( nNum ); int k, iDiffSign = Gia_ManHashXor( pNew, pNum[nNum-1], pDiv[nDiv-1] ); Wlc_BlastMinus( pNew, pNum, nNum, vNum ); Wlc_BlastMinus( pNew, pDiv, nDiv, vDiv ); Wlc_BlastDivider( pNew, pNum, nNum, pDiv, nDiv, fQuo, vRes00 ); Wlc_BlastDivider( pNew, pNum, nNum, Vec_IntArray(vDiv), nDiv, fQuo, vRes01 ); Wlc_BlastDivider( pNew, Vec_IntArray(vNum), nNum, pDiv, nDiv, fQuo, vRes10 ); Wlc_BlastDivider( pNew, Vec_IntArray(vNum), nNum, Vec_IntArray(vDiv), nDiv, fQuo, vRes11 ); Vec_IntClear( vRes ); for ( k = 0; k < nNum; k++ ) { int Data0 = Gia_ManHashMux( pNew, pDiv[nDiv-1], Vec_IntEntry(vRes01,k), Vec_IntEntry(vRes00,k) ); int Data1 = Gia_ManHashMux( pNew, pDiv[nDiv-1], Vec_IntEntry(vRes11,k), Vec_IntEntry(vRes10,k) ); Vec_IntPush( vRes, Gia_ManHashMux(pNew, pNum[nNum-1], Data1, Data0) ); } Wlc_BlastMinus( pNew, Vec_IntArray(vRes), nNum, vRes2 ); for ( k = 0; k < nNum; k++ ) Vec_IntWriteEntry( vRes, k, Gia_ManHashMux(pNew, fQuo ? iDiffSign : pNum[nNum-1], Vec_IntEntry(vRes2,k), Vec_IntEntry(vRes,k)) ); Vec_IntFree( vNum ); Vec_IntFree( vDiv ); Vec_IntFree( vRes00 ); Vec_IntFree( vRes01 ); Vec_IntFree( vRes10 ); Vec_IntFree( vRes11 ); Vec_IntFree( vRes2 ); assert( Vec_IntSize(vRes) == nNum ); } void Wlc_BlastZeroCondition( Gia_Man_t * pNew, int * pDiv, int nDiv, Vec_Int_t * vRes ) { int i, Entry, iLit = Wlc_BlastReduction( pNew, pDiv, nDiv, WLC_OBJ_REDUCT_OR ); Vec_IntForEachEntry( vRes, Entry, i ) Vec_IntWriteEntry( vRes, i, Gia_ManHashAnd(pNew, iLit, Entry) ); } void Wlc_BlastTable( Gia_Man_t * pNew, word * pTable, int * pFans, int nFans, int nOuts, Vec_Int_t * vRes ) { extern int Kit_TruthToGia( Gia_Man_t * pMan, unsigned * pTruth, int nVars, Vec_Int_t * vMemory, Vec_Int_t * vLeaves, int fHash ); Vec_Int_t * vMemory = Vec_IntAlloc( 0 ); Vec_Int_t vLeaves = { nFans, nFans, pFans }; word * pTruth = ABC_ALLOC( word, Abc_TtWordNum(nFans) ); int o, i, m, iLit, nMints = (1 << nFans); Vec_IntClear( vRes ); for ( o = 0; o < nOuts; o++ ) { // derive truth table memset( pTruth, 0, sizeof(word) * Abc_TtWordNum(nFans) ); for ( m = 0; m < nMints; m++ ) for ( i = 0; i < nFans; i++ ) if ( Abc_TtGetBit( pTable, m * nFans + i ) ) Abc_TtSetBit( pTruth, m ); // implement truth table if ( nFans < 6 ) pTruth[0] = Abc_Tt6Stretch( pTruth[0], nFans ); iLit = Kit_TruthToGia( pNew, (unsigned *)pTruth, nFans, vMemory, &vLeaves, 1 ); Vec_IntPush( vRes, iLit ); } Vec_IntFree( vMemory ); ABC_FREE( pTruth ); } void Wlc_BlastPower( Gia_Man_t * pNew, int * pNum, int nNum, int * pExp, int nExp, Vec_Int_t * vTemp, Vec_Int_t * vRes ) { Vec_Int_t * vDegrees = Vec_IntAlloc( 2*nNum ); Vec_Int_t * vResTemp = Vec_IntAlloc( 2*nNum ); int i, * pDegrees = NULL, * pRes = Vec_IntArray(vRes); int k, * pResTemp = Vec_IntArray(vResTemp); Vec_IntFill( vRes, nNum, 0 ); Vec_IntWriteEntry( vRes, 0, 1 ); for ( i = 0; i < nExp; i++ ) { if ( i == 0 ) pDegrees = Wlc_VecCopy( vDegrees, pNum, nNum ); else { Wlc_BlastMultiplier2( pNew, pDegrees, pDegrees, nNum, vTemp, vResTemp ); pDegrees = Wlc_VecCopy( vDegrees, pResTemp, nNum ); } Wlc_BlastMultiplier2( pNew, pRes, pDegrees, nNum, vTemp, vResTemp ); for ( k = 0; k < nNum; k++ ) pRes[k] = Gia_ManHashMux( pNew, pExp[i], pResTemp[k], pRes[k] ); } Vec_IntFree( vResTemp ); Vec_IntFree( vDegrees ); } void Wlc_BlastSqrt( Gia_Man_t * pNew, int * pNum, int nNum, Vec_Int_t * vTmp, Vec_Int_t * vRes ) { int * pRes, * pSum, * pSumP; int i, k, Carry = -1; assert( nNum % 2 == 0 ); Vec_IntFill( vRes, nNum/2, 0 ); Vec_IntFill( vTmp, 2*nNum, 0 ); pRes = Vec_IntArray( vRes ); pSum = Vec_IntArray( vTmp ); pSumP = pSum + nNum; for ( i = 0; i < nNum/2; i++ ) { pSumP[0] = pNum[nNum-2*i-2]; pSumP[1] = pNum[nNum-2*i-1]; for ( k = 0; k < i+1; k++ ) pSumP[k+2] = pSum[k]; for ( k = 0; k < i + 3; k++ ) { if ( k >= 2 && k < i + 2 ) // middle ones Wlc_BlastFullAdder( pNew, pSumP[k], Abc_LitNot(pRes[i-k+1]), Carry, &Carry, &pSum[k] ); else Wlc_BlastFullAdder( pNew, pSumP[k], Abc_LitNot(k ? Carry:1), 1, &Carry, &pSum[k] ); if ( k == 0 || k > i ) Carry = Abc_LitNot(Carry); } pRes[i] = Abc_LitNot(Carry); for ( k = 0; k < i + 3; k++ ) pSum[k] = Gia_ManHashMux( pNew, pRes[i], pSum[k], pSumP[k] ); } Vec_IntReverseOrder( vRes ); } void Wlc_IntInsert( Vec_Int_t * vProd, Vec_Int_t * vLevel, int Node, int Level ) { int i; for ( i = Vec_IntSize(vLevel) - 1; i >= 0; i-- ) if ( Vec_IntEntry(vLevel, i) >= Level ) break; Vec_IntInsert( vProd, i + 1, Node ); Vec_IntInsert( vLevel, i + 1, Level ); } void Wlc_BlastReduceMatrix( Gia_Man_t * pNew, Vec_Wec_t * vProds, Vec_Wec_t * vLevels, Vec_Int_t * vRes ) { Vec_Int_t * vLevel, * vProd; int i, NodeS, NodeC, LevelS, LevelC, Node1, Node2, Node3, Level1, Level2, Level3; int nSize = Vec_WecSize(vProds); assert( nSize == Vec_WecSize(vLevels) ); for ( i = 0; i < nSize; i++ ) { while ( 1 ) { vProd = Vec_WecEntry( vProds, i ); if ( Vec_IntSize(vProd) < 3 ) break; Node1 = Vec_IntPop( vProd ); Node2 = Vec_IntPop( vProd ); Node3 = Vec_IntPop( vProd ); vLevel = Vec_WecEntry( vLevels, i ); Level1 = Vec_IntPop( vLevel ); Level2 = Vec_IntPop( vLevel ); Level3 = Vec_IntPop( vLevel ); Wlc_BlastFullAdder( pNew, Node1, Node2, Node3, &NodeC, &NodeS ); LevelS = Abc_MaxInt( Abc_MaxInt(Level1, Level2), Level3 ) + 2; LevelC = LevelS - 1; Wlc_IntInsert( vProd, vLevel, NodeS, LevelS ); vProd = Vec_WecEntry( vProds, i+1 ); vLevel = Vec_WecEntry( vLevels, i+1 ); Wlc_IntInsert( vProd, vLevel, NodeC, LevelC ); } } // make all ranks have two products for ( i = 0; i < nSize; i++ ) { vProd = Vec_WecEntry( vProds, i ); while ( Vec_IntSize(vProd) < 2 ) Vec_IntPush( vProd, 0 ); assert( Vec_IntSize(vProd) == 2 ); } vLevel = Vec_WecEntry( vLevels, 0 ); Vec_IntClear( vRes ); Vec_IntClear( vLevel ); for ( i = 0; i < nSize; i++ ) { vProd = Vec_WecEntry( vProds, i ); Vec_IntPush( vRes, Vec_IntEntry(vProd, 0) ); Vec_IntPush( vLevel, Vec_IntEntry(vProd, 1) ); } Wlc_BlastAdder( pNew, Vec_IntArray(vRes), Vec_IntArray(vLevel), nSize ); } void Wlc_BlastMultiplier3( Gia_Man_t * pNew, int * pArgA, int * pArgB, int nArgA, int nArgB, Vec_Int_t * vRes ) { Vec_Wec_t * vProds = Vec_WecStart( nArgA + nArgB ); Vec_Wec_t * vLevels = Vec_WecStart( nArgA + nArgB ); int i, k; for ( i = 0; i < nArgA; i++ ) for ( k = 0; k < nArgB; k++ ) { Vec_WecPush( vProds, i+k, Gia_ManHashAnd(pNew, pArgA[i], pArgB[k]) ); Vec_WecPush( vLevels, i+k, 0 ); } Wlc_BlastReduceMatrix( pNew, vProds, vLevels, vRes ); Vec_WecFree( vProds ); Vec_WecFree( vLevels ); } void Wlc_BlastSquare( Gia_Man_t * pNew, int * pNum, int nNum, Vec_Int_t * vTmp, Vec_Int_t * vRes ) { Vec_Wec_t * vProds = Vec_WecStart( 2*nNum ); Vec_Wec_t * vLevels = Vec_WecStart( 2*nNum ); int i, k; for ( i = 0; i < nNum; i++ ) for ( k = 0; k < nNum; k++ ) { if ( i == k ) { Vec_WecPush( vProds, i+k, pNum[i] ); Vec_WecPush( vLevels, i+k, 0 ); } else if ( i < k ) { Vec_WecPush( vProds, i+k+1, Gia_ManHashAnd(pNew, pNum[i], pNum[k]) ); Vec_WecPush( vLevels, i+k+1, 0 ); } } Wlc_BlastReduceMatrix( pNew, vProds, vLevels, vRes ); Vec_WecFree( vProds ); Vec_WecFree( vLevels ); } /**Function************************************************************* Synopsis [] Description [] SideEffects [] SeeAlso [] ***********************************************************************/ Gia_Man_t * Wlc_NtkBitBlast( Wlc_Ntk_t * p, Vec_Int_t * vBoxIds ) { int fVerbose = 0; int fUseOldMultiplierBlasting = 0; Tim_Man_t * pManTime = NULL; Gia_Man_t * pTemp, * pNew, * pExtra = NULL; Wlc_Obj_t * pObj; Vec_Int_t * vBits = &p->vBits, * vTemp0, * vTemp1, * vTemp2, * vRes; int nBits = Wlc_NtkPrepareBits( p ); int nRange, nRange0, nRange1, nRange2; int i, k, b, iFanin, iLit, nAndPrev, * pFans0, * pFans1, * pFans2; int nFFins = 0, nFFouts = 0, curPi = 0, curPo = 0; int nBitCis = 0, nBitCos = 0, fAdded = 0; Vec_IntClear( vBits ); Vec_IntGrow( vBits, nBits ); vTemp0 = Vec_IntAlloc( 1000 ); vTemp1 = Vec_IntAlloc( 1000 ); vTemp2 = Vec_IntAlloc( 1000 ); vRes = Vec_IntAlloc( 1000 ); // clean AND-gate counters memset( p->nAnds, 0, sizeof(int) * WLC_OBJ_NUMBER ); // create AIG manager pNew = Gia_ManStart( 5 * Wlc_NtkObjNum(p) + 1000 ); pNew->pName = Abc_UtilStrsav( p->pName ); Gia_ManHashAlloc( pNew ); // prepare for AIG with boxes if ( vBoxIds ) { int nNewCis = 0, nNewCos = 0; Wlc_NtkForEachObj( p, pObj, i ) pObj->Mark = 0; // count bit-width of regular CIs/COs Wlc_NtkForEachCi( p, pObj, i ) nBitCis += Wlc_ObjRange( pObj ); Wlc_NtkForEachCo( p, pObj, i ) nBitCos += Wlc_ObjRange( pObj ); // count bit-width of additional CIs/COs due to selected multipliers assert( Vec_IntSize(vBoxIds) > 0 ); Wlc_NtkForEachObjVec( vBoxIds, p, pObj, i ) { // currently works only for multipliers assert( pObj->Type == WLC_OBJ_ARI_MULTI ); nNewCis += Wlc_ObjRange( pObj ); nNewCos += Wlc_ObjRange( Wlc_ObjFanin0(p, pObj) ); nNewCos += Wlc_ObjRange( Wlc_ObjFanin1(p, pObj) ); pObj->Mark = 1; } // create hierarchy manager pManTime = Tim_ManStart( nBitCis + nNewCis, nBitCos + nNewCos ); curPi = nBitCis; curPo = 0; // create AIG manager for logic of the boxes pExtra = Gia_ManStart( Wlc_NtkObjNum(p) ); Gia_ManHashAlloc( pExtra ); } // blast in the topological order Wlc_NtkForEachObj( p, pObj, i ) { // char * pName = Wlc_ObjName(p, i); nAndPrev = Gia_ManAndNum(pNew); nRange = Wlc_ObjRange( pObj ); nRange0 = Wlc_ObjFaninNum(pObj) > 0 ? Wlc_ObjRange( Wlc_ObjFanin0(p, pObj) ) : -1; nRange1 = Wlc_ObjFaninNum(pObj) > 1 ? Wlc_ObjRange( Wlc_ObjFanin1(p, pObj) ) : -1; nRange2 = Wlc_ObjFaninNum(pObj) > 2 ? Wlc_ObjRange( Wlc_ObjFanin2(p, pObj) ) : -1; pFans0 = Wlc_ObjFaninNum(pObj) > 0 ? Vec_IntEntryP( vBits, Wlc_ObjCopy(p, Wlc_ObjFaninId0(pObj)) ) : NULL; pFans1 = Wlc_ObjFaninNum(pObj) > 1 ? Vec_IntEntryP( vBits, Wlc_ObjCopy(p, Wlc_ObjFaninId1(pObj)) ) : NULL; pFans2 = Wlc_ObjFaninNum(pObj) > 2 ? Vec_IntEntryP( vBits, Wlc_ObjCopy(p, Wlc_ObjFaninId2(pObj)) ) : NULL; Vec_IntClear( vRes ); assert( nRange > 0 ); if ( vBoxIds && pObj->Mark ) { pObj->Mark = 0; // create new box Tim_ManCreateBox( pManTime, curPo, nRange0 + nRange1, curPi, nRange, -1, 0 ); curPi += nRange; curPo += nRange0 + nRange1; // create combinational outputs in the normal manager for ( k = 0; k < nRange0; k++ ) Gia_ManAppendCo( pNew, pFans0[k] ); for ( k = 0; k < nRange1; k++ ) Gia_ManAppendCo( pNew, pFans1[k] ); // make sure there is enough primary inputs in the manager for ( k = Gia_ManPiNum(pExtra); k < nRange0 + nRange1; k++ ) Gia_ManAppendCi( pExtra ); // create combinational inputs Vec_IntClear( vTemp0 ); for ( k = 0; k < nRange0; k++ ) Vec_IntPush( vTemp0, Gia_Obj2Lit(pExtra, Gia_ManPi(pExtra, k)) ); Vec_IntClear( vTemp1 ); for ( k = 0; k < nRange1; k++ ) Vec_IntPush( vTemp1, Gia_Obj2Lit(pExtra, Gia_ManPi(pExtra, nRange0+k)) ); // get new fanin arrays pFans0 = Vec_IntArray( vTemp0 ); pFans1 = Vec_IntArray( vTemp1 ); // bit-blast the multiplier in the external manager if ( fUseOldMultiplierBlasting ) { int nRangeMax = Abc_MaxInt( nRange, Abc_MaxInt(nRange0, nRange1) ); int * pArg0 = Wlc_VecLoadFanins( vTemp0, pFans0, nRange0, nRangeMax, Wlc_ObjIsSignedFanin01(p, pObj) ); int * pArg1 = Wlc_VecLoadFanins( vTemp1, pFans1, nRange1, nRangeMax, Wlc_ObjIsSignedFanin01(p, pObj) ); Wlc_BlastMultiplier2( pExtra, pArg0, pArg1, nRange, vTemp2, vRes ); Vec_IntShrink( vRes, nRange ); } else { int fSigned = Wlc_ObjIsSignedFanin01(p, pObj); int nRangeMax = Abc_MaxInt(nRange0, nRange1); int * pArg0 = Wlc_VecLoadFanins( vTemp0, pFans0, nRange0, nRangeMax, fSigned ); int * pArg1 = Wlc_VecLoadFanins( vTemp1, pFans1, nRange1, nRangeMax, fSigned ); Wlc_BlastMultiplier( pNew, pArg0, pArg1, nRangeMax, nRangeMax, vTemp2, vRes, fSigned ); if ( nRange > nRangeMax + nRangeMax ) Vec_IntFillExtra( vRes, nRange, fSigned ? Vec_IntEntryLast(vRes) : 0 ); else Vec_IntShrink( vRes, nRange ); assert( Vec_IntSize(vRes) == nRange ); } // create outputs in the external manager for ( k = 0; k < nRange; k++ ) Gia_ManAppendCo( pExtra, Vec_IntEntry(vRes, k) ); // create combinational inputs in the normal manager Vec_IntClear( vRes ); for ( k = 0; k < nRange; k++ ) Vec_IntPush( vRes, Gia_ManAppendCi(pNew) ); } else if ( Wlc_ObjIsCi(pObj) ) { if ( Wlc_ObjRangeIsReversed(pObj) ) { for ( k = 0; k < nRange; k++ ) Vec_IntPush( vRes, -1 ); for ( k = 0; k < nRange; k++ ) Vec_IntWriteEntry( vRes, Vec_IntSize(vRes)-1-k, Gia_ManAppendCi(pNew) ); } else { for ( k = 0; k < nRange; k++ ) Vec_IntPush( vRes, Gia_ManAppendCi(pNew) ); } if ( pObj->Type == WLC_OBJ_FO ) nFFouts += Vec_IntSize(vRes); } else if ( pObj->Type == WLC_OBJ_BUF ) { int nRangeMax = Abc_MaxInt( nRange0, nRange ); int * pArg0 = Wlc_VecLoadFanins( vTemp0, pFans0, nRange0, nRangeMax, Wlc_ObjFanin0(p, pObj)->Signed ); for ( k = 0; k < nRange; k++ ) Vec_IntPush( vRes, pArg0[k] ); } else if ( pObj->Type == WLC_OBJ_CONST ) { word * pTruth = (word *)Wlc_ObjFanins(pObj); for ( k = 0; k < nRange; k++ ) Vec_IntPush( vRes, Abc_TtGetBit(pTruth, k) ); } else if ( pObj->Type == WLC_OBJ_MUX ) { // It is strange and disturbing that Verilog standard treats these statements differently: // Statement 1: // assign o = i ? b : a; // Statement 2: // always @( i or a or b ) // begin // case ( i ) // 0 : o = a ; // 1 : o = b ; // endcase // end // If a is signed and b is unsigned, Statement 1 does not sign-extend a, while Statement 2 does. // The signedness of o does not matter. // // Below we (somewhat arbitrarily) distinguish these two by assuming that // Statement 1 has three fanins, while Statement 2 has more than three fanins. // int fSigned = 1; assert( nRange0 >= 1 && Wlc_ObjFaninNum(pObj) >= 3 ); assert( 1 + (1 << nRange0) == Wlc_ObjFaninNum(pObj) ); Wlc_ObjForEachFanin( pObj, iFanin, k ) if ( k > 0 ) fSigned &= Wlc_NtkObj(p, iFanin)->Signed; for ( b = 0; b < nRange; b++ ) { Vec_IntClear( vTemp0 ); Wlc_ObjForEachFanin( pObj, iFanin, k ) if ( k > 0 ) { nRange1 = Wlc_ObjRange( Wlc_NtkObj(p, iFanin) ); pFans1 = Vec_IntEntryP( vBits, Wlc_ObjCopy(p, iFanin) ); if ( Wlc_ObjFaninNum(pObj) == 3 ) // Statement 1 Vec_IntPush( vTemp0, b < nRange1 ? pFans1[b] : (fSigned? pFans1[nRange1-1] : 0) ); else // Statement 2 Vec_IntPush( vTemp0, b < nRange1 ? pFans1[b] : (Wlc_NtkObj(p, iFanin)->Signed? pFans1[nRange1-1] : 0) ); } Vec_IntPush( vRes, Wlc_NtkMuxTree_rec(pNew, pFans0, nRange0, vTemp0, 0) ); } } else if ( pObj->Type == WLC_OBJ_SHIFT_R || pObj->Type == WLC_OBJ_SHIFT_RA || pObj->Type == WLC_OBJ_SHIFT_L || pObj->Type == WLC_OBJ_SHIFT_LA ) { int nRangeMax = Abc_MaxInt( nRange, nRange0 ); int * pArg0 = Wlc_VecLoadFanins( vTemp0, pFans0, nRange0, nRangeMax, Wlc_ObjFanin0(p, pObj)->Signed ); if ( pObj->Type == WLC_OBJ_SHIFT_R || pObj->Type == WLC_OBJ_SHIFT_RA ) Wlc_BlastShiftRight( pNew, pArg0, nRangeMax, pFans1, nRange1, Wlc_ObjFanin0(p, pObj)->Signed && pObj->Type == WLC_OBJ_SHIFT_RA, vRes ); else Wlc_BlastShiftLeft( pNew, pArg0, nRangeMax, pFans1, nRange1, 0, vRes ); Vec_IntShrink( vRes, nRange ); } else if ( pObj->Type == WLC_OBJ_ROTATE_R ) { assert( nRange0 == nRange ); Wlc_BlastRotateRight( pNew, pFans0, nRange0, pFans1, nRange1, vRes ); } else if ( pObj->Type == WLC_OBJ_ROTATE_L ) { assert( nRange0 == nRange ); Wlc_BlastRotateLeft( pNew, pFans0, nRange0, pFans1, nRange1, vRes ); } else if ( pObj->Type == WLC_OBJ_BIT_NOT ) { int nRangeMax = Abc_MaxInt( nRange, nRange0 ); int * pArg0 = Wlc_VecLoadFanins( vTemp0, pFans0, nRange0, nRangeMax, Wlc_ObjFanin0(p, pObj)->Signed ); for ( k = 0; k < nRange; k++ ) Vec_IntPush( vRes, Abc_LitNot(pArg0[k]) ); } else if ( pObj->Type == WLC_OBJ_BIT_AND ) { int nRangeMax = Abc_MaxInt( nRange, Abc_MaxInt(nRange0, nRange1) ); int * pArg0 = Wlc_VecLoadFanins( vTemp0, pFans0, nRange0, nRangeMax, Wlc_ObjIsSignedFanin01(p, pObj) ); int * pArg1 = Wlc_VecLoadFanins( vTemp1, pFans1, nRange1, nRangeMax, Wlc_ObjIsSignedFanin01(p, pObj) ); for ( k = 0; k < nRange; k++ ) Vec_IntPush( vRes, Gia_ManHashAnd(pNew, pArg0[k], pArg1[k]) ); } else if ( pObj->Type == WLC_OBJ_BIT_OR ) { int nRangeMax = Abc_MaxInt( nRange, Abc_MaxInt(nRange0, nRange1) ); int * pArg0 = Wlc_VecLoadFanins( vTemp0, pFans0, nRange0, nRangeMax, Wlc_ObjIsSignedFanin01(p, pObj) ); int * pArg1 = Wlc_VecLoadFanins( vTemp1, pFans1, nRange1, nRangeMax, Wlc_ObjIsSignedFanin01(p, pObj) ); for ( k = 0; k < nRange; k++ ) Vec_IntPush( vRes, Gia_ManHashOr(pNew, pArg0[k], pArg1[k]) ); } else if ( pObj->Type == WLC_OBJ_BIT_XOR || pObj->Type == WLC_OBJ_BIT_NXOR ) { int nRangeMax = Abc_MaxInt( nRange, Abc_MaxInt(nRange0, nRange1) ); int * pArg0 = Wlc_VecLoadFanins( vTemp0, pFans0, nRange0, nRangeMax, Wlc_ObjIsSignedFanin01(p, pObj) ); int * pArg1 = Wlc_VecLoadFanins( vTemp1, pFans1, nRange1, nRangeMax, Wlc_ObjIsSignedFanin01(p, pObj) ); for ( k = 0; k < nRange; k++ ) Vec_IntPush( vRes, Abc_LitNotCond(Gia_ManHashXor(pNew, pArg0[k], pArg1[k]), pObj->Type == WLC_OBJ_BIT_NXOR) ); } else if ( pObj->Type == WLC_OBJ_BIT_SELECT ) { Wlc_Obj_t * pFanin = Wlc_ObjFanin0(p, pObj); int End = Wlc_ObjRangeEnd(pObj); int Beg = Wlc_ObjRangeBeg(pObj); if ( End >= Beg ) { assert( nRange == End - Beg + 1 ); assert( pFanin->Beg <= Beg && End <= pFanin->End ); for ( k = Beg; k <= End; k++ ) Vec_IntPush( vRes, pFans0[k - pFanin->Beg] ); } else { assert( nRange == Beg - End + 1 ); assert( pFanin->End <= End && Beg <= pFanin->Beg ); for ( k = End; k <= Beg; k++ ) Vec_IntPush( vRes, pFans0[k - pFanin->End] ); } } else if ( pObj->Type == WLC_OBJ_BIT_CONCAT ) { int iFanin, nTotal = 0; Wlc_ObjForEachFanin( pObj, iFanin, k ) nTotal += Wlc_ObjRange( Wlc_NtkObj(p, iFanin) ); assert( nRange == nTotal ); Wlc_ObjForEachFaninReverse( pObj, iFanin, k ) { nRange0 = Wlc_ObjRange( Wlc_NtkObj(p, iFanin) ); pFans0 = Vec_IntEntryP( vBits, Wlc_ObjCopy(p, iFanin) ); for ( b = 0; b < nRange0; b++ ) Vec_IntPush( vRes, pFans0[b] ); } } else if ( pObj->Type == WLC_OBJ_BIT_ZEROPAD || pObj->Type == WLC_OBJ_BIT_SIGNEXT ) { int Pad = pObj->Type == WLC_OBJ_BIT_ZEROPAD ? 0 : pFans0[nRange0-1]; assert( nRange0 < nRange ); for ( k = 0; k < nRange0; k++ ) Vec_IntPush( vRes, pFans0[k] ); for ( ; k < nRange; k++ ) Vec_IntPush( vRes, Pad ); } else if ( pObj->Type == WLC_OBJ_LOGIC_NOT ) { iLit = Wlc_BlastReduction( pNew, pFans0, nRange0, WLC_OBJ_REDUCT_OR ); Vec_IntFill( vRes, 1, Abc_LitNot(iLit) ); for ( k = 1; k < nRange; k++ ) Vec_IntPush( vRes, 0 ); } else if ( pObj->Type == WLC_OBJ_LOGIC_AND ) { int iLit0 = Wlc_BlastReduction( pNew, pFans0, nRange0, WLC_OBJ_REDUCT_OR ); int iLit1 = Wlc_BlastReduction( pNew, pFans1, nRange1, WLC_OBJ_REDUCT_OR ); Vec_IntFill( vRes, 1, Gia_ManHashAnd(pNew, iLit0, iLit1) ); for ( k = 1; k < nRange; k++ ) Vec_IntPush( vRes, 0 ); } else if ( pObj->Type == WLC_OBJ_LOGIC_OR ) { int iLit0 = Wlc_BlastReduction( pNew, pFans0, nRange0, WLC_OBJ_REDUCT_OR ); int iLit1 = Wlc_BlastReduction( pNew, pFans1, nRange1, WLC_OBJ_REDUCT_OR ); Vec_IntFill( vRes, 1, Gia_ManHashOr(pNew, iLit0, iLit1) ); for ( k = 1; k < nRange; k++ ) Vec_IntPush( vRes, 0 ); } else if ( pObj->Type == WLC_OBJ_LOGIC_XOR ) { int iLit0 = Wlc_BlastReduction( pNew, pFans0, nRange0, WLC_OBJ_REDUCT_OR ); int iLit1 = Wlc_BlastReduction( pNew, pFans1, nRange1, WLC_OBJ_REDUCT_OR ); Vec_IntFill( vRes, 1, Gia_ManHashXor(pNew, iLit0, iLit1) ); for ( k = 1; k < nRange; k++ ) Vec_IntPush( vRes, 0 ); } else if ( pObj->Type == WLC_OBJ_COMP_EQU || pObj->Type == WLC_OBJ_COMP_NOTEQU ) { int iLit = 0, nRangeMax = Abc_MaxInt( nRange0, nRange1 ); int * pArg0 = Wlc_VecLoadFanins( vTemp0, pFans0, nRange0, nRangeMax, Wlc_ObjIsSignedFanin01(p, pObj) ); int * pArg1 = Wlc_VecLoadFanins( vTemp1, pFans1, nRange1, nRangeMax, Wlc_ObjIsSignedFanin01(p, pObj) ); for ( k = 0; k < nRangeMax; k++ ) iLit = Gia_ManHashOr( pNew, iLit, Gia_ManHashXor(pNew, pArg0[k], pArg1[k]) ); Vec_IntFill( vRes, 1, Abc_LitNotCond(iLit, pObj->Type == WLC_OBJ_COMP_EQU) ); for ( k = 1; k < nRange; k++ ) Vec_IntPush( vRes, 0 ); } else if ( pObj->Type == WLC_OBJ_COMP_LESS || pObj->Type == WLC_OBJ_COMP_MOREEQU || pObj->Type == WLC_OBJ_COMP_MORE || pObj->Type == WLC_OBJ_COMP_LESSEQU ) { int nRangeMax = Abc_MaxInt( nRange0, nRange1 ); int fSigned = Wlc_ObjIsSignedFanin01(p, pObj); int * pArg0 = Wlc_VecLoadFanins( vTemp0, pFans0, nRange0, nRangeMax, fSigned ); int * pArg1 = Wlc_VecLoadFanins( vTemp1, pFans1, nRange1, nRangeMax, fSigned ); int fSwap = (pObj->Type == WLC_OBJ_COMP_MORE || pObj->Type == WLC_OBJ_COMP_LESSEQU); int fCompl = (pObj->Type == WLC_OBJ_COMP_MOREEQU || pObj->Type == WLC_OBJ_COMP_LESSEQU); if ( fSwap ) ABC_SWAP( int *, pArg0, pArg1 ); if ( fSigned ) iLit = Wlc_BlastLessSigned( pNew, pArg0, pArg1, nRangeMax ); else iLit = Wlc_BlastLess( pNew, pArg0, pArg1, nRangeMax ); iLit = Abc_LitNotCond( iLit, fCompl ); Vec_IntFill( vRes, 1, iLit ); for ( k = 1; k < nRange; k++ ) Vec_IntPush( vRes, 0 ); } else if ( pObj->Type == WLC_OBJ_REDUCT_AND || pObj->Type == WLC_OBJ_REDUCT_OR || pObj->Type == WLC_OBJ_REDUCT_XOR || pObj->Type == WLC_OBJ_REDUCT_NAND || pObj->Type == WLC_OBJ_REDUCT_NOR || pObj->Type == WLC_OBJ_REDUCT_NXOR ) { Vec_IntPush( vRes, Wlc_BlastReduction( pNew, pFans0, nRange0, pObj->Type ) ); for ( k = 1; k < nRange; k++ ) Vec_IntPush( vRes, 0 ); } else if ( pObj->Type == WLC_OBJ_ARI_ADD || pObj->Type == WLC_OBJ_ARI_SUB ) { int nRangeMax = Abc_MaxInt( nRange, Abc_MaxInt(nRange0, nRange1) ); int * pArg0 = Wlc_VecLoadFanins( vRes, pFans0, nRange0, nRangeMax, Wlc_ObjIsSignedFanin01(p, pObj) ); int * pArg1 = Wlc_VecLoadFanins( vTemp1, pFans1, nRange1, nRangeMax, Wlc_ObjIsSignedFanin01(p, pObj) ); if ( pObj->Type == WLC_OBJ_ARI_ADD ) Wlc_BlastAdder( pNew, pArg0, pArg1, nRange ); // result is in pFan0 (vRes) // Wlc_BlastAdderCLA( pNew, pArg0, pArg1, nRange ); // result is in pFan0 (vRes) else Wlc_BlastSubtract( pNew, pArg0, pArg1, nRange ); // result is in pFan0 (vRes) Vec_IntShrink( vRes, nRange ); } else if ( pObj->Type == WLC_OBJ_ARI_MULTI ) { if ( fUseOldMultiplierBlasting ) { int nRangeMax = Abc_MaxInt( nRange, Abc_MaxInt(nRange0, nRange1) ); int * pArg0 = Wlc_VecLoadFanins( vTemp0, pFans0, nRange0, nRangeMax, Wlc_ObjIsSignedFanin01(p, pObj) ); int * pArg1 = Wlc_VecLoadFanins( vTemp1, pFans1, nRange1, nRangeMax, Wlc_ObjIsSignedFanin01(p, pObj) ); Wlc_BlastMultiplier2( pNew, pArg0, pArg1, nRange, vTemp2, vRes ); Vec_IntShrink( vRes, nRange ); } else { int fSigned = Wlc_ObjIsSignedFanin01(p, pObj); int nRangeMax = Abc_MaxInt(nRange0, nRange1); int * pArg0 = Wlc_VecLoadFanins( vTemp0, pFans0, nRange0, nRangeMax, fSigned ); int * pArg1 = Wlc_VecLoadFanins( vTemp1, pFans1, nRange1, nRangeMax, fSigned ); if ( Wlc_NtkCountConstBits(pArg0, nRangeMax) < Wlc_NtkCountConstBits(pArg1, nRangeMax) ) ABC_SWAP( int *, pArg0, pArg1 ); Wlc_BlastMultiplier( pNew, pArg0, pArg1, nRangeMax, nRangeMax, vTemp2, vRes, fSigned ); //Wlc_BlastMultiplier3( pNew, pArg0, pArg1, nRange0, nRange1, vRes ); if ( nRange > nRangeMax + nRangeMax ) Vec_IntFillExtra( vRes, nRange, fSigned ? Vec_IntEntryLast(vRes) : 0 ); else Vec_IntShrink( vRes, nRange ); assert( Vec_IntSize(vRes) == nRange ); } } else if ( pObj->Type == WLC_OBJ_ARI_DIVIDE || pObj->Type == WLC_OBJ_ARI_MODULUS ) { int nRangeMax = Abc_MaxInt( nRange, Abc_MaxInt(nRange0, nRange1) ); int fSigned = Wlc_ObjIsSignedFanin01(p, pObj); int * pArg0 = Wlc_VecLoadFanins( vTemp0, pFans0, nRange0, nRangeMax, fSigned ); int * pArg1 = Wlc_VecLoadFanins( vTemp1, pFans1, nRange1, nRangeMax, fSigned ); if ( fSigned ) Wlc_BlastDividerSigned( pNew, pArg0, nRangeMax, pArg1, nRangeMax, pObj->Type == WLC_OBJ_ARI_DIVIDE, vRes ); else Wlc_BlastDivider( pNew, pArg0, nRangeMax, pArg1, nRangeMax, pObj->Type == WLC_OBJ_ARI_DIVIDE, vRes ); Vec_IntShrink( vRes, nRange ); //if ( pObj->Type == WLC_OBJ_ARI_DIVIDE ) Wlc_BlastZeroCondition( pNew, pFans1, nRange1, vRes ); } else if ( pObj->Type == WLC_OBJ_ARI_MINUS ) { int nRangeMax = Abc_MaxInt( nRange0, nRange ); int * pArg0 = Wlc_VecLoadFanins( vTemp0, pFans0, nRange0, nRangeMax, Wlc_ObjFanin0(p, pObj)->Signed ); Wlc_BlastMinus( pNew, pArg0, nRangeMax, vRes ); Vec_IntShrink( vRes, nRange ); } else if ( pObj->Type == WLC_OBJ_ARI_POWER ) { int nRangeMax = Abc_MaxInt(nRange0, nRange); int * pArg0 = Wlc_VecLoadFanins( vTemp0, pFans0, nRange0, nRangeMax, Wlc_ObjFanin0(p, pObj)->Signed ); int * pArg1 = Wlc_VecLoadFanins( vTemp1, pFans1, nRange1, nRange1, Wlc_ObjFanin1(p, pObj)->Signed ); Wlc_BlastPower( pNew, pArg0, nRangeMax, pArg1, nRange1, vTemp2, vRes ); Vec_IntShrink( vRes, nRange ); } else if ( pObj->Type == WLC_OBJ_ARI_SQRT ) { int * pArg0 = Wlc_VecLoadFanins( vTemp0, pFans0, nRange0, nRange0 + (nRange0 & 1), 0 ); nRange0 += (nRange0 & 1); Wlc_BlastSqrt( pNew, pArg0, nRange0, vTemp2, vRes ); if ( nRange > Vec_IntSize(vRes) ) Vec_IntFillExtra( vRes, nRange, 0 ); else Vec_IntShrink( vRes, nRange ); } else if ( pObj->Type == WLC_OBJ_ARI_SQUARE ) { int * pArg0 = Wlc_VecLoadFanins( vTemp0, pFans0, nRange0, nRange0, 0 ); Wlc_BlastSquare( pNew, pArg0, nRange0, vTemp2, vRes ); if ( nRange > Vec_IntSize(vRes) ) Vec_IntFillExtra( vRes, nRange, 0 ); else Vec_IntShrink( vRes, nRange ); } else if ( pObj->Type == WLC_OBJ_TABLE ) Wlc_BlastTable( pNew, Wlc_ObjTable(p, pObj), pFans0, nRange0, nRange, vRes ); else assert( 0 ); assert( Vec_IntSize(vBits) == Wlc_ObjCopy(p, i) ); Vec_IntAppend( vBits, vRes ); p->nAnds[pObj->Type] += Gia_ManAndNum(pNew) - nAndPrev; } p->nAnds[0] = Gia_ManAndNum(pNew); assert( nBits == Vec_IntSize(vBits) ); Vec_IntFree( vTemp0 ); Vec_IntFree( vTemp1 ); Vec_IntFree( vTemp2 ); Vec_IntFree( vRes ); // create COs Wlc_NtkForEachCo( p, pObj, i ) { nRange = Wlc_ObjRange( pObj ); pFans0 = Vec_IntEntryP( vBits, Wlc_ObjCopy(p, Wlc_ObjId(p, pObj)) ); if ( fVerbose ) printf( "%s(%d) ", Wlc_ObjName(p, Wlc_ObjId(p, pObj)), Gia_ManCoNum(pNew) ); if ( Wlc_ObjRangeIsReversed(pObj) ) { for ( k = 0; k < nRange; k++ ) Gia_ManAppendCo( pNew, pFans0[nRange-1-k] ); } else { for ( k = 0; k < nRange; k++ ) Gia_ManAppendCo( pNew, pFans0[k] ); } if ( pObj->fIsFi ) nFFins += nRange; } if ( fVerbose ) printf( "\n" ); //Vec_IntErase( vBits ); //Vec_IntErase( &p->vCopies ); // set the number of registers assert( nFFins == nFFouts ); Gia_ManSetRegNum( pNew, nFFins ); // finalize AIG pNew = Gia_ManCleanup( pTemp = pNew ); Gia_ManDupRemapLiterals( vBits, pTemp ); Gia_ManStop( pTemp ); // transform AIG with init state if ( p->pInits ) { if ( (int)strlen(p->pInits) != Gia_ManRegNum(pNew) ) { printf( "The number of init values (%d) does not match the number of flops (%d).\n", (int)strlen(p->pInits), Gia_ManRegNum(pNew) ); printf( "It is assumed that the AIG has constant 0 initial state.\n" ); } else { pNew = Gia_ManDupZeroUndc( pTemp = pNew, p->pInits, 1 ); Gia_ManDupRemapLiterals( vBits, pTemp ); Gia_ManStop( pTemp ); } } // finalize AIG with boxes if ( vBoxIds ) { curPo += nBitCos; assert( curPi == Tim_ManCiNum(pManTime) ); assert( curPo == Tim_ManCoNum(pManTime) ); // finalize the extra AIG pExtra = Gia_ManCleanup( pTemp = pExtra ); Gia_ManStop( pTemp ); assert( Gia_ManPoNum(pExtra) == Gia_ManCiNum(pNew) - nBitCis ); // attach pNew->pAigExtra = pExtra; pNew->pManTime = pManTime; // normalize AIG pNew = Gia_ManDupNormalize( pTemp = pNew ); Gia_ManTransferTiming( pNew, pTemp ); Gia_ManStop( pTemp ); //Tim_ManPrint( pManTime ); } // create input names pNew->vNamesIn = Vec_PtrAlloc( Gia_ManCiNum(pNew) ); Wlc_NtkForEachCi( p, pObj, i ) if ( Wlc_ObjIsPi(pObj) ) { char * pName = Wlc_ObjName(p, Wlc_ObjId(p, pObj)); nRange = Wlc_ObjRange( pObj ); if ( nRange == 1 ) Vec_PtrPush( pNew->vNamesIn, Abc_UtilStrsav(pName) ); else for ( k = 0; k < nRange; k++ ) { char Buffer[1000]; sprintf( Buffer, "%s[%d]", pName, k ); Vec_PtrPush( pNew->vNamesIn, Abc_UtilStrsav(Buffer) ); } } if ( p->pInits ) { int Length = strlen(p->pInits); for ( i = 0; i < Length; i++ ) if ( p->pInits[i] == 'x' || p->pInits[i] == 'X' ) { char Buffer[100]; sprintf( Buffer, "%s%d", "init", i ); Vec_PtrPush( pNew->vNamesIn, Abc_UtilStrsav(Buffer) ); fAdded = 1; } } Wlc_NtkForEachCi( p, pObj, i ) if ( !Wlc_ObjIsPi(pObj) ) { char * pName = Wlc_ObjName(p, Wlc_ObjId(p, pObj)); nRange = Wlc_ObjRange( pObj ); if ( nRange == 1 ) Vec_PtrPush( pNew->vNamesIn, Abc_UtilStrsav(pName) ); else for ( k = 0; k < nRange; k++ ) { char Buffer[1000]; sprintf( Buffer, "%s[%d]", pName, k ); Vec_PtrPush( pNew->vNamesIn, Abc_UtilStrsav(Buffer) ); } } if ( p->pInits && fAdded ) Vec_PtrPush( pNew->vNamesIn, Abc_UtilStrsav("abc_reset_flop") ); assert( Vec_PtrSize(pNew->vNamesIn) == Gia_ManCiNum(pNew) ); // create output names /* pNew->vNamesOut = Vec_PtrAlloc( Gia_ManCoNum(pNew) ); Wlc_NtkForEachCo( p, pObj, i ) if ( Wlc_ObjIsPo(pObj) ) { char * pName = Wlc_ObjName(p, Wlc_ObjId(p, pObj)); nRange = Wlc_ObjRange( pObj ); if ( nRange == 1 ) Vec_PtrPush( pNew->vNamesOut, Abc_UtilStrsav(pName) ); else for ( k = 0; k < nRange; k++ ) { char Buffer[1000]; sprintf( Buffer, "%s[%d]", pName, k ); Vec_PtrPush( pNew->vNamesOut, Abc_UtilStrsav(Buffer) ); } } if ( fAdded ) Vec_PtrPush( pNew->vNamesOut, Abc_UtilStrsav("abc_reset_flop_in") ); Wlc_NtkForEachCo( p, pObj, i ) if ( !Wlc_ObjIsPo(pObj) ) { char * pName = Wlc_ObjName(p, Wlc_ObjId(p, pObj)); nRange = Wlc_ObjRange( pObj ); if ( nRange == 1 ) Vec_PtrPush( pNew->vNamesOut, Abc_UtilStrsav(pName) ); else for ( k = 0; k < nRange; k++ ) { char Buffer[1000]; sprintf( Buffer, "%s[%d]", pName, k ); Vec_PtrPush( pNew->vNamesOut, Abc_UtilStrsav(Buffer) ); } } assert( Vec_PtrSize(pNew->vNamesOut) == Gia_ManCoNum(pNew) ); */ return pNew; } //////////////////////////////////////////////////////////////////////// /// END OF FILE /// //////////////////////////////////////////////////////////////////////// ABC_NAMESPACE_IMPL_END