mapperVec.c File Reference

#include "mapperInt.h"

Go to the source code of this file.

Functions
static ABC_NAMESPACE_IMPL_START int	Map_NodeVecCompareLevels (Map_Node_t **pp1, Map_Node_t **pp2)
	DECLARATIONS ///. More...
Map_NodeVec_t *	Map_NodeVecAlloc (int nCap)
	FUNCTION DEFINITIONS ///. More...
void	Map_NodeVecFree (Map_NodeVec_t *p)
Map_NodeVec_t *	Map_NodeVecDup (Map_NodeVec_t *p)
Map_Node_t **	Map_NodeVecReadArray (Map_NodeVec_t *p)
int	Map_NodeVecReadSize (Map_NodeVec_t *p)
void	Map_NodeVecGrow (Map_NodeVec_t *p, int nCapMin)
void	Map_NodeVecShrink (Map_NodeVec_t *p, int nSizeNew)
void	Map_NodeVecClear (Map_NodeVec_t *p)
void	Map_NodeVecPush (Map_NodeVec_t *p, Map_Node_t *Entry)
int	Map_NodeVecPushUnique (Map_NodeVec_t *p, Map_Node_t *Entry)
Map_Node_t *	Map_NodeVecPop (Map_NodeVec_t *p)
void	Map_NodeVecRemove (Map_NodeVec_t *p, Map_Node_t *Entry)
void	Map_NodeVecWriteEntry (Map_NodeVec_t *p, int i, Map_Node_t *Entry)
Map_Node_t *	Map_NodeVecReadEntry (Map_NodeVec_t *p, int i)
void	Map_NodeVecSortByLevel (Map_NodeVec_t *p)

Function Documentation

Map_NodeVec_t* Map_NodeVecAlloc

(

int

nCap

)

FUNCTION DEFINITIONS ///.

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

Synopsis [Allocates a vector with the given capacity.]

Description []

SideEffects []

SeeAlso []

Definition at line 45 of file mapperVec.c.

{
    Map_NodeVec_t * p;
    p = ABC_ALLOC( Map_NodeVec_t, 1 );
    if ( nCap > 0 && nCap < 16 )
        nCap = 16;
    p->nSize  = 0;
    p->nCap   = nCap;
    p->pArray = p->nCap? ABC_ALLOC( Map_Node_t *, p->nCap ) : NULL;
    return p;
}

void Map_NodeVecClear

(

Map_NodeVec_t *

p

)

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

Synopsis []

Description []

SideEffects []

SeeAlso []

Definition at line 174 of file mapperVec.c.

{
    p->nSize = 0;
}

int Map_NodeVecCompareLevels ( Map_Node_t **  pp1, Map_Node_t **  pp2  )

static

DECLARATIONS ///.

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

FileName [mapperVec.c]

PackageName [MVSIS 1.3: Multi-valued logic synthesis system.]

Synopsis [Generic technology mapping engine.]

Author [MVSIS Group]

Affiliation [UC Berkeley]

Date [Ver. 2.0. Started - June 1, 2004.]

Revision [

Id:

mapperVec.c,v 1.3 2005/01/23 06:59:45 alanmi Exp

]

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

Synopsis [Comparison procedure for two clauses.]

Description []

SideEffects []

SeeAlso []

Definition at line 324 of file mapperVec.c.

{
    int Level1 = Map_Regular(*pp1)->Level;
    int Level2 = Map_Regular(*pp2)->Level;
    if ( Level1 < Level2 )
        return -1;
    if ( Level1 > Level2 )
        return 1;
    if ( Map_Regular(*pp1)->Num < Map_Regular(*pp2)->Num )
        return -1;
    if ( Map_Regular(*pp1)->Num > Map_Regular(*pp2)->Num )
        return 1;
    return 0; 
}

Map_NodeVec_t* Map_NodeVecDup

(

Map_NodeVec_t *

p

)

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

Synopsis []

Description []

SideEffects []

SeeAlso []

Definition at line 87 of file mapperVec.c.

{
    Map_NodeVec_t * pNew = Map_NodeVecAlloc( p->nSize );
    memcpy( pNew->pArray, p->pArray, sizeof(int) * p->nSize );
    pNew->nSize = p->nSize;
    return pNew;
}

void Map_NodeVecFree

(

Map_NodeVec_t *

p

)

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

Synopsis []

Description []

SideEffects []

SeeAlso []

Definition at line 68 of file mapperVec.c.

{
    if ( p == NULL )
        return;
    ABC_FREE( p->pArray );
    ABC_FREE( p );
}

void Map_NodeVecGrow	(	Map_NodeVec_t *	p,
		int	nCapMin
	)

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

Synopsis [Resizes the vector to the given capacity.]

Description []

SideEffects []

SeeAlso []

Definition at line 138 of file mapperVec.c.

{
    if ( p->nCap >= nCapMin )
        return;
    p->pArray = ABC_REALLOC( Map_Node_t *, p->pArray, nCapMin ); 
    p->nCap   = nCapMin;
}

Map_Node_t* Map_NodeVecPop

(

Map_NodeVec_t *

p

)

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

Synopsis []

Description []

SideEffects []

SeeAlso []

Definition at line 234 of file mapperVec.c.

{
    return p->pArray[--p->nSize];
}

void Map_NodeVecPush	(	Map_NodeVec_t *	p,
		Map_Node_t *	Entry
	)

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

Synopsis []

Description []

SideEffects []

SeeAlso []

Definition at line 190 of file mapperVec.c.

{
    if ( p->nSize == p->nCap )
    {
        if ( p->nCap < 16 )
            Map_NodeVecGrow( p, 16 );
        else
            Map_NodeVecGrow( p, 2 * p->nCap );
    }
    p->pArray[p->nSize++] = Entry;
}

int Map_NodeVecPushUnique	(	Map_NodeVec_t *	p,
		Map_Node_t *	Entry
	)

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

Synopsis [Add the element while ensuring uniqueness.]

Description [Returns 1 if the element was found, and 0 if it was new. ]

SideEffects []

SeeAlso []

Definition at line 213 of file mapperVec.c.

{
    int i;
    for ( i = 0; i < p->nSize; i++ )
        if ( p->pArray[i] == Entry )
            return 1;
    Map_NodeVecPush( p, Entry );
    return 0;
}

Map_Node_t** Map_NodeVecReadArray

(

Map_NodeVec_t *

p

)

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

Synopsis []

Description []

SideEffects []

SeeAlso []

Definition at line 106 of file mapperVec.c.

{
    return p->pArray;
}

Map_Node_t* Map_NodeVecReadEntry	(	Map_NodeVec_t *	p,
		int	i
	)

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

Synopsis []

Description []

SideEffects []

SeeAlso []

Definition at line 290 of file mapperVec.c.

{
    assert( i >= 0 && i < p->nSize );
    return p->pArray[i];
}

int Map_NodeVecReadSize

(

Map_NodeVec_t *

p

)

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

Synopsis []

Description []

SideEffects []

SeeAlso []

Definition at line 122 of file mapperVec.c.

{
    return p->nSize;
}

void Map_NodeVecRemove	(	Map_NodeVec_t *	p,
		Map_Node_t *	Entry
	)

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

Synopsis []

Description []

SideEffects []

SeeAlso []

Definition at line 250 of file mapperVec.c.

{
    int i;
    for ( i = 0; i < p->nSize; i++ )
        if ( p->pArray[i] == Entry )
            break;
    assert( i < p->nSize );
    for ( i++; i < p->nSize; i++ )
        p->pArray[i-1] = p->pArray[i];
    p->nSize--;
}

void Map_NodeVecShrink	(	Map_NodeVec_t *	p,
		int	nSizeNew
	)

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

Synopsis []

Description []

SideEffects []

SeeAlso []

Definition at line 157 of file mapperVec.c.

{
    assert( p->nSize >= nSizeNew );
    p->nSize = nSizeNew;
}

void Map_NodeVecSortByLevel

(

Map_NodeVec_t *

p

)

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

Synopsis [Sorting the entries by their integer value.]

Description []

SideEffects []

SeeAlso []

Definition at line 307 of file mapperVec.c.

{
    qsort( (void *)p->pArray, p->nSize, sizeof(Map_Node_t *), 
            (int (*)(const void *, const void *)) Map_NodeVecCompareLevels );
}

void Map_NodeVecWriteEntry	(	Map_NodeVec_t *	p,
		int	i,
		Map_Node_t *	Entry
	)

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

Synopsis []

Description []

SideEffects []

SeeAlso []

Definition at line 273 of file mapperVec.c.

{
    assert( i >= 0 && i < p->nSize );
    p->pArray[i] = Entry;
}