nm.h File Reference

This graph shows which files directly or indirectly include this file:

Go to the source code of this file.

Typedefs
typedef typedefABC_NAMESPACE_HEADER_START struct Nm_Man_t_	Nm_Man_t
	INCLUDES ///.

Functions
Nm_Man_t *	Nm_ManCreate (int nSize)
	MACRO DEFINITIONS ///.
void	Nm_ManFree (Nm_Man_t *p)
int	Nm_ManNumEntries (Nm_Man_t *p)
char *	Nm_ManStoreIdName (Nm_Man_t *p, int ObjId, int Type, char *pName, char *pSuffix)
void	Nm_ManDeleteIdName (Nm_Man_t *p, int ObjId)
char *	Nm_ManCreateUniqueName (Nm_Man_t *p, int ObjId)
char *	Nm_ManFindNameById (Nm_Man_t *p, int ObjId)
int	Nm_ManFindIdByName (Nm_Man_t *p, char *pName, int Type)
int	Nm_ManFindIdByNameTwoTypes (Nm_Man_t *p, char *pName, int Type1, int Type2)
Vec_Int_t *	Nm_ManReturnNameIds (Nm_Man_t *p)

Typedef Documentation

Nm_Man_t

typedef typedefABC_NAMESPACE_HEADER_START struct Nm_Man_t_ Nm_Man_t

INCLUDES ///.

CFilextern e****************************************************************

FileName [nm.h]

SystemName [ABC: Logic synthesis and verification system.]

PackageName [Name manager.]

Synopsis [External declarations.]

Author [Alan Mishchenko]

Affiliation [UC Berkeley]

Date [Ver. 1.0. Started - June 20, 2005.]

Revision [

Id

nm.h,v 1.00 2005/06/20 00:00:00 alanmi Exp

] PARAMETERS /// BASIC TYPES ///

Definition at line 63 of file nm.h.

Function Documentation

Nm_ManCreate()

Nm_Man_t * Nm_ManCreate ( int nSize )

extern

MACRO DEFINITIONS ///.

FUNCTION DECLARATIONS ///

MACRO DEFINITIONS ///.

CFile****************************************************************

FileName [nmApi.c]

SystemName [ABC: Logic synthesis and verification system.]

PackageName [Name manager.]

Synopsis [APIs of the name manager.]

Author [Alan Mishchenko]

Affiliation [UC Berkeley]

Date [Ver. 1.0. Started - June 20, 2005.]

Revision [

Id

nmApi.c,v 1.00 2005/06/20 00:00:00 alanmi Exp

] FUNCTION DEFINITIONS /// Function*************************************************************

Synopsis [Allocates the name manager.]

Description []

SideEffects []

SeeAlso []

Definition at line 45 of file nmApi.c.

{
    Nm_Man_t * p;
    // allocate the table
    p = ABC_ALLOC( Nm_Man_t, 1 );
    memset( p, 0, sizeof(Nm_Man_t) );
    // set the parameters
    p->nSizeFactor   = 2; // determined the limit on the grow of data before the table resizes
    p->nGrowthFactor = 3; // determined how much the table grows after resizing
    // allocate and clean the bins
    p->nBins = Abc_PrimeCudd(nSize);
    p->pBinsI2N = ABC_ALLOC( Nm_Entry_t *, p->nBins );
    p->pBinsN2I = ABC_ALLOC( Nm_Entry_t *, p->nBins );
    memset( p->pBinsI2N, 0, sizeof(Nm_Entry_t *) * p->nBins );
    memset( p->pBinsN2I, 0, sizeof(Nm_Entry_t *) * p->nBins );
    // start the memory manager
    p->pMem = Extra_MmFlexStart();
    return p;
}

Here is the call graph for this function:

Here is the caller graph for this function:

Nm_ManCreateUniqueName()

char * Nm_ManCreateUniqueName ( Nm_Man_t * p, int ObjId )

extern

Function*************************************************************

Synopsis [Finds a unique name for the node.]

Description [If the name exists, tries appending numbers to it until it becomes unique. The name is not added to the table.]

SideEffects []

SeeAlso []

Definition at line 175 of file nmApi.c.

{
    static char NameStr[1000];
    Nm_Entry_t * pEntry;
    int i;
    if ( (pEntry = Nm_ManTableLookupId(p, ObjId)) )
        return pEntry->Name;
    sprintf( NameStr, "n%d", ObjId );
    for ( i = 1; Nm_ManTableLookupName(p, NameStr, -1); i++ )
        sprintf( NameStr, "n%d_%d", ObjId, i );
    return NameStr;
}

Here is the call graph for this function:

Here is the caller graph for this function:

Nm_ManDeleteIdName()

void Nm_ManDeleteIdName ( Nm_Man_t * p, int ObjId )

extern

Function*************************************************************

Synopsis [Creates a new entry in the name manager.]

Description [Returns 1 if the entry with the given object ID already exists in the name manager.]

SideEffects []

SeeAlso []

Definition at line 149 of file nmApi.c.

{
    Nm_Entry_t * pEntry;
    pEntry = Nm_ManTableLookupId(p, ObjId);
    if ( pEntry == NULL )
    {
        printf( "Nm_ManDeleteIdName(): Entry with ID %d is not in the table.\n", ObjId );
        return;
    }
    // remove entry from the table
    Nm_ManTableDelete( p, ObjId );
}

Here is the call graph for this function:

Here is the caller graph for this function:

Nm_ManFindIdByName()

int Nm_ManFindIdByName ( Nm_Man_t * p, char * pName, int Type )

extern

Function*************************************************************

Synopsis [Returns ID of the object if its name is known.]

Description [This procedure may return two IDs because POs and latches may have the same name (the only allowed case of name duplication).]

SideEffects []

SeeAlso []

Definition at line 219 of file nmApi.c.

{
    Nm_Entry_t * pEntry;
    if ( (pEntry = Nm_ManTableLookupName(p, pName, Type)) )
        return pEntry->ObjId;
    return -1;
}

Here is the call graph for this function:

Here is the caller graph for this function:

Nm_ManFindIdByNameTwoTypes()

int Nm_ManFindIdByNameTwoTypes ( Nm_Man_t * p, char * pName, int Type1, int Type2 )

extern

Function*************************************************************

Synopsis [Returns ID of the object if its name is known.]

Description [This procedure may return two IDs because POs and latches may have the same name (the only allowed case of name duplication).]

SideEffects []

SeeAlso []

Definition at line 239 of file nmApi.c.

{
    int iNodeId;
    iNodeId = Nm_ManFindIdByName( p, pName, Type1 );
    if ( iNodeId == -1 )
        iNodeId = Nm_ManFindIdByName( p, pName, Type2 );
    if ( iNodeId == -1 )
        return -1;
    return iNodeId;
}

Here is the call graph for this function:

Here is the caller graph for this function:

Nm_ManFindNameById()

char * Nm_ManFindNameById ( Nm_Man_t * p, int ObjId )

extern

Function*************************************************************

Synopsis [Returns name of the object if the ID is known.]

Description []

SideEffects []

SeeAlso []

Definition at line 199 of file nmApi.c.

{
    Nm_Entry_t * pEntry;
    if ( (pEntry = Nm_ManTableLookupId(p, ObjId)) )
        return pEntry->Name;
    return NULL;
}

Here is the call graph for this function:

Here is the caller graph for this function:

Nm_ManFree()

void Nm_ManFree ( Nm_Man_t * p )

extern

Function*************************************************************

Synopsis [Deallocates the name manager.]

Description []

SideEffects []

SeeAlso []

Definition at line 76 of file nmApi.c.

{
    Extra_MmFlexStop( p->pMem );
    ABC_FREE( p->pBinsI2N );
    ABC_FREE( p->pBinsN2I );
    ABC_FREE( p );
}

Here is the call graph for this function:

Here is the caller graph for this function:

Nm_ManNumEntries()

int Nm_ManNumEntries ( Nm_Man_t * p )

extern

Function*************************************************************

Synopsis [Returns the number of objects with names.]

Description []

SideEffects []

SeeAlso []

Definition at line 95 of file nmApi.c.

{
    return p->nEntries;
}

Here is the caller graph for this function:

Nm_ManReturnNameIds()

Vec_Int_t * Nm_ManReturnNameIds ( Nm_Man_t * p )

extern

Function*************************************************************

Synopsis [Return the IDs of objects with names.]

Description []

SideEffects []

SeeAlso []

Definition at line 261 of file nmApi.c.

{
    Vec_Int_t * vNameIds;
    int i;
    vNameIds = Vec_IntAlloc( p->nEntries );
    for ( i = 0; i < p->nBins; i++ )
        if ( p->pBinsI2N[i] )
            Vec_IntPush( vNameIds, p->pBinsI2N[i]->ObjId );
    return vNameIds;
}

Nm_ManStoreIdName()

char * Nm_ManStoreIdName ( Nm_Man_t * p, int ObjId, int Type, char * pName, char * pSuffix )

extern

Function*************************************************************

Synopsis [Creates a new entry in the name manager.]

Description [Returns 1 if the entry with the given object ID already exists in the name manager.]

SideEffects []

SeeAlso []

Definition at line 112 of file nmApi.c.

{
    Nm_Entry_t * pEntry;
    int RetValue, nEntrySize;
    // check if the object with this ID is already stored
    if ( (pEntry = Nm_ManTableLookupId(p, ObjId)) )
    {
        printf( "Nm_ManStoreIdName(): Entry with ID %d already exists.\n", ObjId );
        return NULL;
    }
    // create a new entry
    nEntrySize = sizeof(Nm_Entry_t) + strlen(pName) + (pSuffix?strlen(pSuffix):0) + 1;
//    nEntrySize = (nEntrySize / 4 + ((nEntrySize % 4) > 0)) * 4;
    nEntrySize = (nEntrySize / sizeof(char*) + ((nEntrySize % sizeof(char*)) > 0)) * sizeof(char*); // added by Saurabh on Sep 3, 2009
    pEntry = (Nm_Entry_t *)Extra_MmFlexEntryFetch( p->pMem, nEntrySize );
    pEntry->pNextI2N = pEntry->pNextN2I = pEntry->pNameSake = NULL;
    pEntry->ObjId = ObjId;
    pEntry->Type = Type;
    sprintf( pEntry->Name, "%s%s", pName, pSuffix? pSuffix : "" );
    // add the entry to the hash table
    RetValue = Nm_ManTableAdd( p, pEntry );
    assert( RetValue == 1 );
    return pEntry->Name;
}

Here is the call graph for this function:

Here is the caller graph for this function: