diff options
author | Alan Mishchenko <alanmi@berkeley.edu> | 2011-08-01 12:35:34 +0700 |
---|---|---|
committer | Alan Mishchenko <alanmi@berkeley.edu> | 2011-08-01 12:35:34 +0700 |
commit | 820a147ef1e8ff307c3d4e675001372e8f636404 (patch) | |
tree | 00112747e075531f04a8326e2654791a75fddd9b /src/aig/fra/fraPart.c | |
parent | 957b9f0173d70a1b750f1ef09580065b9285761c (diff) | |
download | abc-820a147ef1e8ff307c3d4e675001372e8f636404.tar.gz abc-820a147ef1e8ff307c3d4e675001372e8f636404.tar.bz2 abc-820a147ef1e8ff307c3d4e675001372e8f636404.zip |
Removed useless typecasts related to changes in Vec_VecEntry().
Diffstat (limited to 'src/aig/fra/fraPart.c')
-rw-r--r-- | src/aig/fra/fraPart.c | 18 |
1 files changed, 9 insertions, 9 deletions
diff --git a/src/aig/fra/fraPart.c b/src/aig/fra/fraPart.c index 9556bb51..e9739f97 100644 --- a/src/aig/fra/fraPart.c +++ b/src/aig/fra/fraPart.c @@ -66,7 +66,7 @@ ABC_PRT( "Supports", clock() - clk ); // remove last entry Aig_ManForEachPo( p, pObj, i ) { - vSup = (Vec_Int_t *)Vec_VecEntry( vSupps, i ); + vSup = Vec_VecEntryInt( vSupps, i ); Vec_IntPop( vSup ); // remember support // pObj->pNext = (Aig_Obj_t *)vSup; @@ -77,7 +77,7 @@ clk = clock(); vSuppsIn = Vec_VecStart( Aig_ManPiNum(p) ); Aig_ManForEachPo( p, pObj, i ) { - vSup = (Vec_Int_t *)Vec_VecEntry( vSupps, i ); + vSup = Vec_VecEntryInt( vSupps, i ); Vec_IntForEachEntry( vSup, Entry, k ) Vec_VecPush( vSuppsIn, Entry, (void *)(ABC_PTRUINT_T)i ); } @@ -94,7 +94,7 @@ clk = clock(); { // Bar_ProgressUpdate( pProgress, i, NULL ); // get old supports - vSup = (Vec_Int_t *)Vec_VecEntry( vSupps, i ); + vSup = Vec_VecEntryInt( vSupps, i ); if ( Vec_IntSize(vSup) < 2 ) continue; // compute new supports @@ -109,7 +109,7 @@ clk = clock(); // pObj = Aig_ManObj( p, Entry ); // get support of this output // vSup2 = (Vec_Int_t *)pObj->pNext; - vSup2 = (Vec_Int_t *)Vec_VecEntry( vSupps, k ); + vSup2 = Vec_VecEntryInt( vSupps, k ); // count the number of common vars nCommon = Vec_IntTwoCountCommon(vSup, vSup2); if ( nCommon < 2 ) @@ -200,7 +200,7 @@ ABC_PRT( "Supports", clock() - clk ); // remove last entry Aig_ManForEachPo( p, pObj, i ) { - vSup = (Vec_Int_t *)Vec_VecEntry( vSupps, i ); + vSup = Vec_VecEntryInt( vSupps, i ); Vec_IntPop( vSup ); // remember support // pObj->pNext = (Aig_Obj_t *)vSup; @@ -213,7 +213,7 @@ clk = clock(); { if ( i == p->nAsserts ) break; - vSup = (Vec_Int_t *)Vec_VecEntry( vSupps, i ); + vSup = Vec_VecEntryInt( vSupps, i ); Vec_IntForEachEntry( vSup, Entry, k ) Vec_VecPush( vSuppsIn, Entry, (void *)(ABC_PTRUINT_T)i ); } @@ -226,17 +226,17 @@ clk = clock(); { if ( i % 50 != 0 ) continue; - vSup = (Vec_Int_t *)Vec_VecEntry( vSupps, i ); + vSup = Vec_VecEntryInt( 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_Int_t *)Vec_VecEntry( vSuppsIn, Entry ); + vSup2 = Vec_VecEntryInt( vSuppsIn, Entry ); // go though each assert of this input Vec_IntForEachEntry( vSup2, Entry2, m ) { - vSup3 = (Vec_Int_t *)Vec_VecEntry( vSupps, Entry2 ); + vSup3 = Vec_VecEntryInt( vSupps, Entry2 ); // go through each input of this assert Vec_IntForEachEntry( vSup3, Entry3, n ) { |