abc/src/bdd/reo/reoTest.c
/**Function*************************************************************

  Synopsis    [Reorders the DD using REO and CUDD.]

  Description [This function can be used to test the performance of the reordering package.]

  SideEffects []

  SeeAlso     []

***********************************************************************/
Function
Synopsis    [Reorders the DD using REO and CUDD.]

Description [This function can be used to test the performance of the reordering package.]




Function Synopsis [ Reorders the DD using REO and CUDD . ] Description [ This function can be used to test the performance of the reordering package . ]
void Extra_ReorderTestArray( DdManager * dd, DdNode * Funcs[], int nFuncs )
{
    reo_man * pReo;
    DdNode * FuncsRes[1000];
    int pOrder[1000];
    int i;
    pReo = Extra_ReorderInit( 100, 100 );
    Extra_ReorderArray( pReo, dd, Funcs, FuncsRes, nFuncs, pOrder );  
    Extra_ReorderQuit( pReo );
printf( "Initial = %d. Final = %d.\n", Cudd_SharingSize(Funcs,nFuncs), Cudd_SharingSize(FuncsRes,nFuncs) );
    for ( i = 0; i < nFuncs; i++ )
        Cudd_RecursiveDeref( dd, FuncsRes[i] );
}
void Extra_ReorderTestArray ( DdManager * dd , DdNode * Funcs [ ] , int nFuncs ) { reo_man * pReo ; DdNode * FuncsRes [ 1000 ] ; int pOrder [ 1000 ] ; int i ; pReo = Extra_ReorderInit ( 100 , 100 ) ; Extra_ReorderArray ( pReo , dd , Funcs , FuncsRes , nFuncs , pOrder ) ; Extra_ReorderQuit ( pReo ) ; printf ( " \n " , Cudd_SharingSize ( Funcs , nFuncs ) , Cudd_SharingSize ( FuncsRes , nFuncs ) ) ; for ( i = 0 ; i < nFuncs ; i ++ ) Cudd_RecursiveDeref ( dd , FuncsRes [ i ] ) ; }
Function
Synopsis    [Reorders the DD using REO and CUDD.]
Function Synopsis [ Reorders the DD using REO and CUDD . ]