1 files changed, 0 insertions, 117 deletions
diff --git a/src/aig/mfx/mfxWin.c b/src/aig/mfx/mfxWin.c
deleted file mode 100644
index 7cb3c53d..00000000
--- a/src/aig/mfx/mfxWin.c
+++ /dev/null
@@ -1,117 +0,0 @@
-/**CFile****************************************************************
-
-  FileName    [mfxWin.c]
-
-  SystemName  [ABC: Logic synthesis and verification system.]
-
-  PackageName [The good old minimization with complete don't-cares.]
-
-  Synopsis    [Procedures to compute windows stretching to the PIs.]
-
-  Author      [Alan Mishchenko]
-  
-  Affiliation [UC Berkeley]
-
-  Date        [Ver. 1.0. Started - June 20, 2005.]
-
-  Revision    [$Id: mfxWin.c,v 1.00 2005/06/20 00:00:00 alanmi Exp $]
-
-***********************************************************************/
-
-#include "mfxInt.h"
-
-ABC_NAMESPACE_IMPL_START
-
-
-////////////////////////////////////////////////////////////////////////
-///                        DECLARATIONS                              ///
-////////////////////////////////////////////////////////////////////////
-
-////////////////////////////////////////////////////////////////////////
-///                     FUNCTION DEFINITIONS                         ///
-////////////////////////////////////////////////////////////////////////
-
-/**Function*************************************************************
-
-  Synopsis    [Returns 1 if the node should be a root.]
-
-  Description []
-               
-  SideEffects []
-
-  SeeAlso     []
-
-***********************************************************************/
-static inline int Mfx_ComputeRootsCheck( Nwk_Obj_t * pNode, int nLevelMax, int nFanoutLimit )
-{
-    Nwk_Obj_t * pFanout;
-    int i;
-    // the node is the root if one of the following is true:
-    // (1) the node has more than fanouts than the limit
-    if ( Nwk_ObjFanoutNum(pNode) > nFanoutLimit )
-        return 1;
-    // (2) the node has CO fanouts
-    // (3) the node has fanouts above the cutoff level
-    Nwk_ObjForEachFanout( pNode, pFanout, i )
-        if ( Nwk_ObjIsCo(pFanout) || pFanout->Level > nLevelMax )
-            return 1;
-    return 0;
-}
-
-/**Function*************************************************************
-
-  Synopsis    [Recursively collects the root candidates.]
-
-  Description []
-               
-  SideEffects []
-
-  SeeAlso     []
-
-***********************************************************************/
-void Mfx_ComputeRoots_rec( Nwk_Obj_t * pNode, int nLevelMax, int nFanoutLimit, Vec_Ptr_t * vRoots )
-{
-    Nwk_Obj_t * pFanout;
-    int i;
-    assert( Nwk_ObjIsNode(pNode) );
-    if ( Nwk_ObjIsTravIdCurrent(pNode) )
-        return;
-    Nwk_ObjSetTravIdCurrent( pNode );
-    // check if the node should be the root
-    if ( Mfx_ComputeRootsCheck( pNode, nLevelMax, nFanoutLimit ) )
-        Vec_PtrPush( vRoots, pNode );
-    else // if not, explore its fanouts
-        Nwk_ObjForEachFanout( pNode, pFanout, i )
-            Mfx_ComputeRoots_rec( pFanout, nLevelMax, nFanoutLimit, vRoots );
-}
-
-/**Function*************************************************************
-
-  Synopsis    [Recursively collects the root candidates.]
-
-  Description [Returns 1 if the only root is this node.]
-               
-  SideEffects []
-
-  SeeAlso     []
-
-***********************************************************************/
-Vec_Ptr_t * Mfx_ComputeRoots( Nwk_Obj_t * pNode, int nWinTfoMax, int nFanoutLimit )
-{
-    Vec_Ptr_t * vRoots;
-    vRoots = Vec_PtrAlloc( 10 );
-    Nwk_ManIncrementTravId( pNode->pMan );
-    Mfx_ComputeRoots_rec( pNode, pNode->Level + nWinTfoMax, nFanoutLimit, vRoots );
-    assert( Vec_PtrSize(vRoots) > 0 );
-//    if ( Vec_PtrSize(vRoots) == 1 && Vec_PtrEntry(vRoots, 0) == pNode )
-//        return 0;
-    return vRoots;
-}
-
-////////////////////////////////////////////////////////////////////////
-///                       END OF FILE                                ///
-////////////////////////////////////////////////////////////////////////
-
-
-ABC_NAMESPACE_IMPL_END
-