fpgaVec.c File Reference

#include "fpgaInt.h"

Include dependency graph for fpgaVec.c:

Go to the source code of this file.

Functions
Fpga_NodeVec_t *	Fpga_NodeVecAlloc (int nCap)
	FUNCTION DEFINITIONS ///.
void	Fpga_NodeVecFree (Fpga_NodeVec_t *p)
Fpga_Node_t **	Fpga_NodeVecReadArray (Fpga_NodeVec_t *p)
int	Fpga_NodeVecReadSize (Fpga_NodeVec_t *p)
void	Fpga_NodeVecGrow (Fpga_NodeVec_t *p, int nCapMin)
void	Fpga_NodeVecShrink (Fpga_NodeVec_t *p, int nSizeNew)
void	Fpga_NodeVecClear (Fpga_NodeVec_t *p)
void	Fpga_NodeVecPush (Fpga_NodeVec_t *p, Fpga_Node_t *Entry)
int	Fpga_NodeVecPushUnique (Fpga_NodeVec_t *p, Fpga_Node_t *Entry)
Fpga_Node_t *	Fpga_NodeVecPop (Fpga_NodeVec_t *p)
void	Fpga_NodeVecWriteEntry (Fpga_NodeVec_t *p, int i, Fpga_Node_t *Entry)
Fpga_Node_t *	Fpga_NodeVecReadEntry (Fpga_NodeVec_t *p, int i)
void	Fpga_NodeVecSortByLevel (Fpga_NodeVec_t *p)
int	Fpga_NodeVecCompareArrivals (Fpga_Node_t **ppS1, Fpga_Node_t **ppS2)
void	Fpga_SortNodesByArrivalTimes (Fpga_NodeVec_t *p)
void	Fpga_NodeVecUnion (Fpga_NodeVec_t *p, Fpga_NodeVec_t *p1, Fpga_NodeVec_t *p2)
void	Fpga_NodeVecPushOrder (Fpga_NodeVec_t *vNodes, Fpga_Node_t *pNode, int fIncreasing)
void	Fpga_NodeVecReverse (Fpga_NodeVec_t *vNodes)

Function Documentation

Fpga_NodeVecAlloc()

Fpga_NodeVec_t * Fpga_NodeVecAlloc

(

int

nCap

)

FUNCTION DEFINITIONS ///.

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

Synopsis [Allocates a vector with the given capacity.]

Description []

SideEffects []

SeeAlso []

Definition at line 45 of file fpgaVec.c.

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

Here is the caller graph for this function:

Fpga_NodeVecClear()

void Fpga_NodeVecClear

(

Fpga_NodeVec_t *

p

)

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

Synopsis []

Description []

SideEffects []

SeeAlso []

Definition at line 153 of file fpgaVec.c.

{
    p->nSize = 0;
}

Here is the caller graph for this function:

Fpga_NodeVecCompareArrivals()

int Fpga_NodeVecCompareArrivals	(	Fpga_Node_t **	ppS1,
		Fpga_Node_t **	ppS2 )

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

Synopsis [Compares the arrival times.]

Description []

SideEffects []

SeeAlso []

Definition at line 306 of file fpgaVec.c.

{
    if ( (*ppS1)->pCutBest->tArrival < (*ppS2)->pCutBest->tArrival )
        return -1;
    if ( (*ppS1)->pCutBest->tArrival > (*ppS2)->pCutBest->tArrival )
        return 1;
    return 0;
}

Here is the caller graph for this function:

Fpga_NodeVecFree()

void Fpga_NodeVecFree

(

Fpga_NodeVec_t *

p

)

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

Synopsis []

Description []

SideEffects []

SeeAlso []

Definition at line 68 of file fpgaVec.c.

{
    ABC_FREE( p->pArray );
    ABC_FREE( p );
}

Here is the caller graph for this function:

Fpga_NodeVecGrow()

void Fpga_NodeVecGrow	(	Fpga_NodeVec_t *	p,
		int	nCapMin )

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

Synopsis [Resizes the vector to the given capacity.]

Description []

SideEffects []

SeeAlso []

Definition at line 117 of file fpgaVec.c.

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

Here is the caller graph for this function:

Fpga_NodeVecPop()

Fpga_Node_t * Fpga_NodeVecPop

(

Fpga_NodeVec_t *

p

)

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

Synopsis []

Description []

SideEffects []

SeeAlso []

Definition at line 213 of file fpgaVec.c.

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

Fpga_NodeVecPush()

void Fpga_NodeVecPush	(	Fpga_NodeVec_t *	p,
		Fpga_Node_t *	Entry )

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

Synopsis []

Description []

SideEffects []

SeeAlso []

Definition at line 169 of file fpgaVec.c.

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

Here is the call graph for this function:

Here is the caller graph for this function:

Fpga_NodeVecPushOrder()

void Fpga_NodeVecPushOrder	(	Fpga_NodeVec_t *	vNodes,
		Fpga_Node_t *	pNode,
		int	fIncreasing )

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

Synopsis [Inserts a new node in the order by arrival times.]

Description []

SideEffects []

SeeAlso []

Definition at line 366 of file fpgaVec.c.

{
    Fpga_Node_t * pNode1, * pNode2;
    int i;
    Fpga_NodeVecPush( vNodes, pNode );
    // find the place of the node
    for ( i = vNodes->nSize-1; i > 0; i-- )
    {
        pNode1 = vNodes->pArray[i  ];
        pNode2 = vNodes->pArray[i-1];
        if (( fIncreasing && pNode1->pCutBest->tArrival >= pNode2->pCutBest->tArrival) ||
            (!fIncreasing && pNode1->pCutBest->tArrival <= pNode2->pCutBest->tArrival) )
            break;
        vNodes->pArray[i  ] = pNode2;
        vNodes->pArray[i-1] = pNode1;
    }
}

Here is the call graph for this function:

Fpga_NodeVecPushUnique()

int Fpga_NodeVecPushUnique	(	Fpga_NodeVec_t *	p,
		Fpga_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 192 of file fpgaVec.c.

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

Here is the call graph for this function:

Fpga_NodeVecReadArray()

Fpga_Node_t ** Fpga_NodeVecReadArray

(

Fpga_NodeVec_t *

p

)

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

Synopsis []

Description []

SideEffects []

SeeAlso []

Definition at line 85 of file fpgaVec.c.

{
    return p->pArray;
}

Fpga_NodeVecReadEntry()

Fpga_Node_t * Fpga_NodeVecReadEntry	(	Fpga_NodeVec_t *	p,
		int	i )

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

Synopsis []

Description []

SideEffects []

SeeAlso []

Definition at line 246 of file fpgaVec.c.

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

Here is the caller graph for this function:

Fpga_NodeVecReadSize()

int Fpga_NodeVecReadSize

(

Fpga_NodeVec_t *

p

)

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

Synopsis []

Description []

SideEffects []

SeeAlso []

Definition at line 101 of file fpgaVec.c.

{
    return p->nSize;
}

Fpga_NodeVecReverse()

void Fpga_NodeVecReverse

(

Fpga_NodeVec_t *

vNodes

)

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

Synopsis [Inserts a new node in the order by arrival times.]

Description []

SideEffects []

SeeAlso []

Definition at line 395 of file fpgaVec.c.

{
    Fpga_Node_t * pNode1, * pNode2;
    int i;
    for ( i = 0; i < vNodes->nSize/2; i++ )
    {
        pNode1 = vNodes->pArray[i];
        pNode2 = vNodes->pArray[vNodes->nSize-1-i];
        vNodes->pArray[i]                 = pNode2;
        vNodes->pArray[vNodes->nSize-1-i] = pNode1;
    }
}

Fpga_NodeVecShrink()

void Fpga_NodeVecShrink	(	Fpga_NodeVec_t *	p,
		int	nSizeNew )

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

Synopsis []

Description []

SideEffects []

SeeAlso []

Definition at line 136 of file fpgaVec.c.

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

Fpga_NodeVecSortByLevel()

void Fpga_NodeVecSortByLevel

(

Fpga_NodeVec_t *

p

)

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

Synopsis [Sorting the entries by their integer value.]

Description []

SideEffects []

SeeAlso []

Definition at line 289 of file fpgaVec.c.

{
    qsort( (void *)p->pArray, (size_t)p->nSize, sizeof(Fpga_Node_t *), 
            (int (*)(const void *, const void *)) Fpga_NodeVecCompareLevels );
}

Fpga_NodeVecUnion()

void Fpga_NodeVecUnion	(	Fpga_NodeVec_t *	p,
		Fpga_NodeVec_t *	p1,
		Fpga_NodeVec_t *	p2 )

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

Synopsis [Computes the union of nodes in two arrays.]

Description []

SideEffects []

SeeAlso []

Definition at line 345 of file fpgaVec.c.

{
    int i;
    Fpga_NodeVecClear( p );
    for ( i = 0; i < p1->nSize; i++ )
        Fpga_NodeVecPush( p, p1->pArray[i] );
    for ( i = 0; i < p2->nSize; i++ )
        Fpga_NodeVecPush( p, p2->pArray[i] );
}

Here is the call graph for this function:

Fpga_NodeVecWriteEntry()

void Fpga_NodeVecWriteEntry	(	Fpga_NodeVec_t *	p,
		int	i,
		Fpga_Node_t *	Entry )

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

Synopsis []

Description []

SideEffects []

SeeAlso []

Definition at line 229 of file fpgaVec.c.

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

Here is the caller graph for this function:

Fpga_SortNodesByArrivalTimes()

void Fpga_SortNodesByArrivalTimes

(

Fpga_NodeVec_t *

p

)

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

Synopsis [Orders the nodes in the increasing order of the arrival times.]

Description []

SideEffects []

SeeAlso []

Definition at line 326 of file fpgaVec.c.

{
    qsort( (void *)p->pArray, (size_t)p->nSize, sizeof(Fpga_Node_t *), 
            (int (*)(const void *, const void *)) Fpga_NodeVecCompareArrivals );
//    assert( Fpga_CompareNodesByLevel( p->pArray, p->pArray + p->nSize - 1 ) <= 0 );
}

Here is the call graph for this function: