1 files changed, 0 insertions, 91 deletions
diff --git a/src/aig/gia/giaUtil.c b/src/aig/gia/giaUtil.c
index 5f443dc8..e4a4dd09 100644
--- a/src/aig/gia/giaUtil.c
+++ b/src/aig/gia/giaUtil.c
@@ -890,97 +890,6 @@ int Gia_NodeMffcSize( Gia_Man_t * p, Gia_Obj_t * pNode )
 
 /**Function*************************************************************
 
-  Synopsis    [Returns 1 if AIG has choices.]
-
-  Description []
-               
-  SideEffects []
-
-  SeeAlso     []
-
-***********************************************************************/
-int Gia_ManHasChoices( Gia_Man_t * p )
-{
-    Gia_Obj_t * pObj;
-    int i, Counter1 = 0, Counter2 = 0;
-    int nFailNoRepr = 0;
-    int nFailHaveRepr = 0;
-    int nChoiceNodes = 0;
-    int nChoices = 0;
-    if ( p->pReprs == NULL || p->pNexts == NULL )
-        return 0;
-    // check if there are any representatives
-    Gia_ManForEachObj( p, pObj, i )
-    {
-        if ( Gia_ObjReprObj( p, Gia_ObjId(p, pObj) ) )
-        {
-//            printf( "%d ", i );
-            Counter1++;
-        }
-//        if ( Gia_ObjNext( p, Gia_ObjId(p, pObj) ) )
-//            Counter2++;
-    }
-//    printf( "\n" );
-    Gia_ManForEachObj( p, pObj, i )
-    {
-//        if ( Gia_ObjReprObj( p, Gia_ObjId(p, pObj) ) )
-//            Counter1++;
-        if ( Gia_ObjNext( p, Gia_ObjId(p, pObj) ) )
-        {
-//            printf( "%d ", i );
-            Counter2++;
-        }
-    }
-//    printf( "\n" );
-    if ( Counter1 == 0 )
-    {
-        printf( "Warning: AIG has repr data-strucure but not reprs.\n" );
-        return 0;
-    }
-    printf( "%d nodes have reprs.\n", Counter1 );
-    printf( "%d nodes have nexts.\n", Counter2 );
-    // check if there are any internal nodes without fanout
-    // make sure all nodes without fanout have representatives
-    // make sure all nodes with fanout have no representatives
-    ABC_FREE( p->pRefs );
-    Gia_ManCreateRefs( p );
-    Gia_ManForEachAnd( p, pObj, i )
-    {
-        if ( Gia_ObjRefs(p, pObj) == 0 )
-        {
-            if ( Gia_ObjReprObj( p, Gia_ObjId(p, pObj) ) == NULL )
-                nFailNoRepr++;
-            else
-                nChoices++;
-        }
-        else
-        {
-            if ( Gia_ObjReprObj( p, Gia_ObjId(p, pObj) ) != NULL )
-                nFailHaveRepr++;
-            if ( Gia_ObjNextObj( p, Gia_ObjId(p, pObj) ) != NULL )
-                nChoiceNodes++;
-        }
-        if ( Gia_ObjReprObj( p, i ) )
-            assert( Gia_ObjRepr(p, i) < i );
-    }
-    if ( nChoices == 0 )
-        return 0;
-    if ( nFailNoRepr )
-    {
-        printf( "Gia_ManHasChoices(): Error: %d internal nodes have no fanout and no repr.\n", nFailNoRepr );
-//        return 0;
-    }
-    if ( nFailHaveRepr )
-    {
-        printf( "Gia_ManHasChoices(): Error: %d internal nodes have both fanout and repr.\n", nFailHaveRepr );
-//        return 0;
-    }
-//    printf( "Gia_ManHasChoices(): AIG has %d choice nodes with %d choices.\n", nChoiceNodes, nChoices );
-    return 1;
-}
-
-/**Function*************************************************************
-
   Synopsis    [Returns 1 if AIG has dangling nodes.]
 
   Description []