src/bdd/reo/reoApi.c

Go to the documentation of this file.

#include "reo.h"



reo_man * Extra_ReorderInit( int nDdVarsMax, int nNodesMax )
{
        reo_man * p;
        // allocate and clean the data structure
        p = ALLOC( reo_man, 1 );
        memset( p, 0, sizeof(reo_man) );
        // resize the manager to meet user's needs      
        reoResizeStructures( p, nDdVarsMax, nNodesMax, 100 );
        // set the defaults
        p->fMinApl   = 0;
        p->fMinWidth = 0;
        p->fRemapUp  = 0;
        p->fVerbose  = 0;
        p->fVerify   = 0;
        p->nIters    = 1;
        return p;
}

void Extra_ReorderQuit( reo_man * p )
{
        free( p->pTops );
        free( p->pSupp );
        free( p->pOrderInt );
        free( p->pWidthCofs );
        free( p->pMapToPlanes );
        free( p->pMapToDdVarsOrig );
        free( p->pMapToDdVarsFinal );
        free( p->pPlanes );
        free( p->pVarCosts );
        free( p->pLevelOrder );
        free( p->HTable );
        free( p->pRefNodes );
        reoUnitsStopDispenser( p );
        free( p->pMemChunks );
        free( p );
}

void Extra_ReorderSetMinimizationType( reo_man * p, reo_min_type fMinType )
{
        if ( fMinType == REO_MINIMIZE_NODES ) 
        {
                p->fMinWidth = 0;
                p->fMinApl   = 0;
        }
        else if ( fMinType == REO_MINIMIZE_WIDTH )
        {
                p->fMinWidth = 1;
                p->fMinApl   = 0;
        }
        else if ( fMinType == REO_MINIMIZE_APL )
        {
                p->fMinWidth = 0;
                p->fMinApl   = 1;
        }
        else 
        {
                assert( 0 );
        }
}

void Extra_ReorderSetRemapping( reo_man * p, int fRemapUp )
{
        p->fRemapUp = fRemapUp;
}

void Extra_ReorderSetIterations( reo_man * p, int nIters )
{
        p->nIters = nIters;
}

void Extra_ReorderSetVerification( reo_man * p, int fVerify )
{
        p->fVerify = fVerify;
}

void Extra_ReorderSetVerbosity( reo_man * p, int fVerbose )
{
        p->fVerbose = fVerbose;
}

DdNode * Extra_Reorder( reo_man * p, DdManager * dd, DdNode * Func, int * pOrder )
{
        DdNode * FuncRes;
        Extra_ReorderArray( p, dd, &Func, &FuncRes, 1, pOrder );
        Cudd_Deref( FuncRes );
        return FuncRes;
}

void Extra_ReorderArray( reo_man * p, DdManager * dd, DdNode * Funcs[], DdNode * FuncsRes[], int nFuncs, int * pOrder )
{
        reoReorderArray( p, dd, Funcs, FuncsRes, nFuncs, pOrder );
}

---