diff options
author | Alan Mishchenko <alanmi@berkeley.edu> | 2012-05-15 15:28:42 +0700 |
---|---|---|
committer | Alan Mishchenko <alanmi@berkeley.edu> | 2012-05-15 15:28:42 +0700 |
commit | 54670783e02ef93796d2d4b7bab9ab93ce22b25f (patch) | |
tree | 1ccdd905d7979731f32f097e1189057ac84c69a5 /src/base/abci | |
parent | 76539c1956b1d694dba2700326a915b0c64a3117 (diff) | |
download | abc-54670783e02ef93796d2d4b7bab9ab93ce22b25f.tar.gz abc-54670783e02ef93796d2d4b7bab9ab93ce22b25f.tar.bz2 abc-54670783e02ef93796d2d4b7bab9ab93ce22b25f.zip |
Better resolution of CO drivers. Should impact the QoR after 'if'.
Diffstat (limited to 'src/base/abci')
-rw-r--r-- | src/base/abci/abcSweep.c | 34 |
1 files changed, 0 insertions, 34 deletions
diff --git a/src/base/abci/abcSweep.c b/src/base/abci/abcSweep.c index 2670939b..453dd9ba 100644 --- a/src/base/abci/abcSweep.c +++ b/src/base/abci/abcSweep.c @@ -39,7 +39,6 @@ static int Abc_NodeDroppingCost( Abc_Obj_t * pNode ); static int Abc_NtkReduceNodes( Abc_Ntk_t * pNtk, Vec_Ptr_t * vNodes ); static void Abc_NodeSweep( Abc_Obj_t * pNode, int fVerbose ); static void Abc_NodeConstantInput( Abc_Obj_t * pNode, Abc_Obj_t * pFanin, int fConst0 ); -static void Abc_NodeComplementInput( Abc_Obj_t * pNode, Abc_Obj_t * pFanin ); //////////////////////////////////////////////////////////////////////// /// FUNCTION DEFINITIONS /// @@ -684,39 +683,6 @@ void Abc_NodeConstantInput( Abc_Obj_t * pNode, Abc_Obj_t * pFanin, int fConst0 ) Cudd_RecursiveDeref( dd, bTemp ); } -/**Function************************************************************* - - Synopsis [Changes the polarity of one fanin.] - - Description [] - - SideEffects [] - - SeeAlso [] - -***********************************************************************/ -void Abc_NodeComplementInput( Abc_Obj_t * pNode, Abc_Obj_t * pFanin ) -{ - DdManager * dd = (DdManager *)pNode->pNtk->pManFunc; - DdNode * bVar, * bCof0, * bCof1; - int iFanin; - assert( Abc_NtkIsBddLogic(pNode->pNtk) ); - if ( (iFanin = Vec_IntFind( &pNode->vFanins, pFanin->Id )) == -1 ) - { - printf( "Node %s should be among", Abc_ObjName(pFanin) ); - printf( " the fanins of node %s...\n", Abc_ObjName(pNode) ); - return; - } - bVar = Cudd_bddIthVar( dd, iFanin ); - bCof0 = Cudd_Cofactor( dd, (DdNode *)pNode->pData, Cudd_Not(bVar) ); Cudd_Ref( bCof0 ); - bCof1 = Cudd_Cofactor( dd, (DdNode *)pNode->pData, bVar ); Cudd_Ref( bCof1 ); - Cudd_RecursiveDeref( dd, (DdNode *)pNode->pData ); - pNode->pData = Cudd_bddIte( dd, bVar, bCof0, bCof1 ); Cudd_Ref( (DdNode *)pNode->pData ); - Cudd_RecursiveDeref( dd, bCof0 ); - Cudd_RecursiveDeref( dd, bCof1 ); -} - - /**Function************************************************************* |