1 files changed, 0 insertions, 102 deletions
diff --git a/src/base/abci/abcReorder.c b/src/base/abci/abcReorder.c
deleted file mode 100644
index 182780cd..00000000
--- a/src/base/abci/abcReorder.c
+++ /dev/null
@@ -1,102 +0,0 @@
-/**CFile****************************************************************
-
-  FileName    [abcReorder.c]
-
-  SystemName  [ABC: Logic synthesis and verification system.]
-
-  PackageName [Network and node package.]
-
-  Synopsis    [Reordering local BDDs of the nodes.]
-
-  Author      [Alan Mishchenko]
-  
-  Affiliation [UC Berkeley]
-
-  Date        [Ver. 1.0. Started - June 20, 2005.]
-
-  Revision    [$Id: abcReorder.c,v 1.00 2005/06/20 00:00:00 alanmi Exp $]
-
-***********************************************************************/
-
-#include "abc.h"
-#include "reo.h"
-
-////////////////////////////////////////////////////////////////////////
-///                        DECLARATIONS                              ///
-////////////////////////////////////////////////////////////////////////
-
-////////////////////////////////////////////////////////////////////////
-///                     FUNCTION DEFINITIONS                         ///
-////////////////////////////////////////////////////////////////////////
-
-/**Function*************************************************************
-
-  Synopsis    [Reorders BDD of the local function of the node.]
-
-  Description []
-               
-  SideEffects []
-
-  SeeAlso     []
-
-***********************************************************************/
-void Abc_NodeBddReorder( reo_man * p, Abc_Obj_t * pNode )
-{
-    Abc_Obj_t * pFanin;
-    DdNode * bFunc;
-    int * pOrder, i;
-    // create the temporary array for the variable order
-    pOrder = ALLOC( int, Abc_ObjFaninNum(pNode) );
-    for ( i = 0; i < Abc_ObjFaninNum(pNode); i++ )
-        pOrder[i] = -1;
-    // reorder the BDD
-    bFunc = Extra_Reorder( p, pNode->pNtk->pManFunc, pNode->pData, pOrder ); Cudd_Ref( bFunc );
-    Cudd_RecursiveDeref( pNode->pNtk->pManFunc, pNode->pData );
-    pNode->pData = bFunc;
-    // update the fanin order
-    Abc_ObjForEachFanin( pNode, pFanin, i )
-        pOrder[i] = pNode->vFanins.pArray[ pOrder[i] ];
-    Abc_ObjForEachFanin( pNode, pFanin, i )
-        pNode->vFanins.pArray[i] = pOrder[i];
-    free( pOrder );
-}
-
-/**Function*************************************************************
-
-  Synopsis    [Reorders BDDs of the local functions.]
-
-  Description []
-               
-  SideEffects []
-
-  SeeAlso     []
-
-***********************************************************************/
-void Abc_NtkBddReorder( Abc_Ntk_t * pNtk, int fVerbose )
-{
-    reo_man * p;
-    Abc_Obj_t * pNode;
-    int i;
-    Abc_NtkRemoveDupFanins( pNtk );
-    Abc_NtkMinimumBase( pNtk );
-    p = Extra_ReorderInit( Abc_NtkGetFaninMax(pNtk), 100 );
-    Abc_NtkForEachNode( pNtk, pNode, i )
-    {
-        if ( Abc_ObjFaninNum(pNode) < 3 )
-            continue;
-        if ( fVerbose )
-            fprintf( stdout, "%10s: ", Abc_ObjName(pNode) );
-        if ( fVerbose )
-            fprintf( stdout, "Before = %5d  BDD nodes.  ", Cudd_DagSize(pNode->pData) );
-        Abc_NodeBddReorder( p, pNode );
-        if ( fVerbose )
-            fprintf( stdout, "After = %5d  BDD nodes.\n", Cudd_DagSize(pNode->pData) );
-    }
-    Extra_ReorderQuit( p );
-}
-
-////////////////////////////////////////////////////////////////////////
-///                       END OF FILE                                ///
-////////////////////////////////////////////////////////////////////////
-
-