summaryrefslogtreecommitdiffstats
path: root/src/aig/gia/giaSweep.c
diff options
context:
space:
mode:
authorAlan Mishchenko <alanmi@berkeley.edu>2014-11-24 20:02:51 -0800
committerAlan Mishchenko <alanmi@berkeley.edu>2014-11-24 20:02:51 -0800
commit8d5fa2c290e857d11901e5bb8dc14dcfdf469b61 (patch)
tree99c29ece4ed90f1c938dc95d3307300a9e65ab3a /src/aig/gia/giaSweep.c
parent6ed334d41baf90f73b2c3278853ce4b08c8fb08e (diff)
downloadabc-8d5fa2c290e857d11901e5bb8dc14dcfdf469b61.tar.gz
abc-8d5fa2c290e857d11901e5bb8dc14dcfdf469b61.tar.bz2
abc-8d5fa2c290e857d11901e5bb8dc14dcfdf469b61.zip
Improvements to handling boxes and flops.
Diffstat (limited to 'src/aig/gia/giaSweep.c')
-rw-r--r--src/aig/gia/giaSweep.c15
1 files changed, 1 insertions, 14 deletions
diff --git a/src/aig/gia/giaSweep.c b/src/aig/gia/giaSweep.c
index 8c5405e4..76176d80 100644
--- a/src/aig/gia/giaSweep.c
+++ b/src/aig/gia/giaSweep.c
@@ -129,9 +129,7 @@ Gia_Man_t * Gia_ManDupWithBoxes( Gia_Man_t * p, int fSeq )
Vec_Int_t * vBoxesLeft;
int curCi, curCo, nBoxIns, nBoxOuts;
int i, k, iShift, nMarked;
- int CiLeft = 0, CoLeft = 0;
assert( Gia_ManBoxNum(p) > 0 );
- assert( Gia_ManRegBoxNum(p) > 0 );
// mark useful boxes
Gia_ManMarkSeqGiaWithBoxes( p, fSeq );
// duplicate marked entries
@@ -181,29 +179,18 @@ Gia_Man_t * Gia_ManDupWithBoxes( Gia_Man_t * p, int fSeq )
// check presence
assert( nMarked == 0 || nMarked == nBoxIns + nBoxOuts );
if ( nMarked )
- {
Vec_IntPush( vBoxesLeft, i );
-
- CoLeft += nBoxIns;
- CiLeft += nBoxOuts;
- }
}
curCo += Tim_ManPoNum(pManTime);
assert( curCi == Gia_ManCiNum(p) );
assert( curCo == Gia_ManCoNum(p) );
// update timing manager
- pNew->pManTime = Gia_ManUpdateTimMan2( p, vBoxesLeft, Vec_IntSize(p->vRegClasses) - Vec_IntSize(pNew->vRegClasses) );
+ pNew->pManTime = Gia_ManUpdateTimMan2( p, vBoxesLeft, Gia_ManRegBoxNum(p) - Gia_ManRegBoxNum(pNew) );
// update extra STG
assert( p->pAigExtra != NULL );
assert( pNew->pAigExtra == NULL );
pNew->pAigExtra = Gia_ManUpdateExtraAig2( p->pManTime, p->pAigExtra, vBoxesLeft );
- {
- int a = Gia_ManCiNum(pNew);
- int b = Tim_ManPiNum(pNew->pManTime);
- int c = Gia_ManCoNum(pNew->pAigExtra);
- int d = b + c;
assert( Gia_ManCiNum(pNew) == Tim_ManPiNum(pNew->pManTime) + Gia_ManCoNum(pNew->pAigExtra) );
- }
Vec_IntFree( vBoxesLeft );
return pNew;
}