diff options
| author | Alan Mishchenko <alanmi@berkeley.edu> | 2010-11-01 01:35:04 -0700 |
|---|---|---|
| committer | Alan Mishchenko <alanmi@berkeley.edu> | 2010-11-01 01:35:04 -0700 |
| commit | 6130e39b18b5f53902e4eab14f6d5cdde5219563 (patch) | |
| tree | 0db0628479a1b750e9af1f66cb8379ebd0913d31 /src/aig/fra/fraPart.c | |
| parent | f0e77f6797c0504b0da25a56152b707d3357f386 (diff) | |
| download | abc-6130e39b18b5f53902e4eab14f6d5cdde5219563.tar.gz abc-6130e39b18b5f53902e4eab14f6d5cdde5219563.tar.bz2 abc-6130e39b18b5f53902e4eab14f6d5cdde5219563.zip | |
initial commit of public abc
Diffstat (limited to 'src/aig/fra/fraPart.c')
| -rw-r--r-- | src/aig/fra/fraPart.c | 23 |
1 files changed, 14 insertions, 9 deletions
diff --git a/src/aig/fra/fraPart.c b/src/aig/fra/fraPart.c index 6dfbd2e9..9556bb51 100644 --- a/src/aig/fra/fraPart.c +++ b/src/aig/fra/fraPart.c @@ -20,6 +20,9 @@ #include "fra.h" +ABC_NAMESPACE_IMPL_START + + //////////////////////////////////////////////////////////////////////// /// DECLARATIONS /// //////////////////////////////////////////////////////////////////////// @@ -63,7 +66,7 @@ ABC_PRT( "Supports", clock() - clk ); // remove last entry Aig_ManForEachPo( p, pObj, i ) { - vSup = Vec_VecEntry( vSupps, i ); + vSup = (Vec_Int_t *)Vec_VecEntry( vSupps, i ); Vec_IntPop( vSup ); // remember support // pObj->pNext = (Aig_Obj_t *)vSup; @@ -74,7 +77,7 @@ clk = clock(); vSuppsIn = Vec_VecStart( Aig_ManPiNum(p) ); Aig_ManForEachPo( p, pObj, i ) { - vSup = Vec_VecEntry( vSupps, i ); + vSup = (Vec_Int_t *)Vec_VecEntry( vSupps, i ); Vec_IntForEachEntry( vSup, Entry, k ) Vec_VecPush( vSuppsIn, Entry, (void *)(ABC_PTRUINT_T)i ); } @@ -91,7 +94,7 @@ clk = clock(); { // Bar_ProgressUpdate( pProgress, i, NULL ); // get old supports - vSup = Vec_VecEntry( vSupps, i ); + vSup = (Vec_Int_t *)Vec_VecEntry( vSupps, i ); if ( Vec_IntSize(vSup) < 2 ) continue; // compute new supports @@ -106,7 +109,7 @@ clk = clock(); // pObj = Aig_ManObj( p, Entry ); // get support of this output // vSup2 = (Vec_Int_t *)pObj->pNext; - vSup2 = Vec_VecEntry( vSupps, k ); + vSup2 = (Vec_Int_t *)Vec_VecEntry( vSupps, k ); // count the number of common vars nCommon = Vec_IntTwoCountCommon(vSup, vSup2); if ( nCommon < 2 ) @@ -197,7 +200,7 @@ ABC_PRT( "Supports", clock() - clk ); // remove last entry Aig_ManForEachPo( p, pObj, i ) { - vSup = Vec_VecEntry( vSupps, i ); + vSup = (Vec_Int_t *)Vec_VecEntry( vSupps, i ); Vec_IntPop( vSup ); // remember support // pObj->pNext = (Aig_Obj_t *)vSup; @@ -210,7 +213,7 @@ clk = clock(); { if ( i == p->nAsserts ) break; - vSup = Vec_VecEntry( vSupps, i ); + vSup = (Vec_Int_t *)Vec_VecEntry( vSupps, i ); Vec_IntForEachEntry( vSup, Entry, k ) Vec_VecPush( vSuppsIn, Entry, (void *)(ABC_PTRUINT_T)i ); } @@ -223,17 +226,17 @@ clk = clock(); { if ( i % 50 != 0 ) continue; - vSup = Vec_VecEntry( vSupps, i ); + vSup = (Vec_Int_t *)Vec_VecEntry( vSupps, i ); memset( pSupp, 0, sizeof(char) * Aig_ManPiNum(p) ); // go through each input of this output Vec_IntForEachEntry( vSup, Entry, k ) { pSupp[Entry] = 1; - vSup2 = Vec_VecEntry( vSuppsIn, Entry ); + vSup2 = (Vec_Int_t *)Vec_VecEntry( vSuppsIn, Entry ); // go though each assert of this input Vec_IntForEachEntry( vSup2, Entry2, m ) { - vSup3 = Vec_VecEntry( vSupps, Entry2 ); + vSup3 = (Vec_Int_t *)Vec_VecEntry( vSupps, Entry2 ); // go through each input of this assert Vec_IntForEachEntry( vSup3, Entry3, n ) { @@ -261,3 +264,5 @@ ABC_PRT( "Extension ", clock() - clk ); //////////////////////////////////////////////////////////////////////// +ABC_NAMESPACE_IMPL_END + |