mapperCutUtils.c File Reference

#include "mapperInt.h"

Include dependency graph for mapperCutUtils.c:

Go to the source code of this file.

Functions
ABC_NAMESPACE_IMPL_START Map_Cut_t *	Map_CutAlloc (Map_Man_t *p)
	DECLARATIONS ///.
void	Map_CutFree (Map_Man_t *p, Map_Cut_t *pCut)
void	Map_CutPrint (Map_Man_t *p, Map_Node_t *pRoot, Map_Cut_t *pCut, int fPhase)
float	Map_CutGetRootArea (Map_Cut_t *pCut, int fPhase)
int	Map_CutGetLeafPhase (Map_Cut_t *pCut, int fPhase, int iLeaf)
int	Map_NodeGetLeafPhase (Map_Node_t *pNode, int fPhase, int iLeaf)
Map_Cut_t *	Map_CutListAppend (Map_Cut_t *pSetAll, Map_Cut_t *pSets)
void	Map_CutListRecycle (Map_Man_t *p, Map_Cut_t *pSetList, Map_Cut_t *pSave)
int	Map_CutListCount (Map_Cut_t *pSets)
void	Map_CutInternalNodes_rec (Map_Node_t *pObj, Vec_Ptr_t *vAnds)
Vec_Ptr_t *	Map_CutInternalNodes (Map_Node_t *pObj, Map_Cut_t *pCut)

Function Documentation

Map_CutAlloc()

ABC_NAMESPACE_IMPL_START Map_Cut_t * Map_CutAlloc

(

Map_Man_t *

p

)

DECLARATIONS ///.

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

FileName [mapperCutUtils.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

mapperCutUtils.h,v 1.0 2003/09/08 00:00:00 alanmi Exp

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

Synopsis [Allocates the cut.]

Description []

SideEffects []

SeeAlso []

Definition at line 43 of file mapperCutUtils.c.

{
    Map_Cut_t * pCut;
    Map_Match_t * pMatch;
    pCut = (Map_Cut_t *)Extra_MmFixedEntryFetch( p->mmCuts );
    memset( pCut, 0, sizeof(Map_Cut_t) );
 
    pMatch = pCut->M;
    pMatch->AreaFlow       = MAP_FLOAT_LARGE; // unassigned
    pMatch->tArrive.Rise   = MAP_FLOAT_LARGE; // unassigned
    pMatch->tArrive.Fall   = MAP_FLOAT_LARGE; // unassigned
    pMatch->tArrive.Worst  = MAP_FLOAT_LARGE; // unassigned
 
    pMatch = pCut->M + 1;
    pMatch->AreaFlow       = MAP_FLOAT_LARGE; // unassigned
    pMatch->tArrive.Rise   = MAP_FLOAT_LARGE; // unassigned
    pMatch->tArrive.Fall   = MAP_FLOAT_LARGE; // unassigned
    pMatch->tArrive.Worst  = MAP_FLOAT_LARGE; // unassigned
    return pCut;
}

Here is the call graph for this function:

Here is the caller graph for this function:

Map_CutFree()

void Map_CutFree	(	Map_Man_t *	p,
		Map_Cut_t *	pCut )

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

Synopsis [Deallocates the cut.]

Description []

SideEffects []

SeeAlso []

Definition at line 75 of file mapperCutUtils.c.

{
    if ( pCut )
    Extra_MmFixedEntryRecycle( p->mmCuts, (char *)pCut );
}

Here is the call graph for this function:

Map_CutGetLeafPhase()

int Map_CutGetLeafPhase	(	Map_Cut_t *	pCut,
		int	fPhase,
		int	iLeaf )

function*************************************************************

synopsis [Computes the exact area associated with the cut.]

description []

sideeffects []

seealso []

Definition at line 131 of file mapperCutUtils.c.

{
    assert( pCut->M[fPhase].pSuperBest );
    return (( pCut->M[fPhase].uPhaseBest & (1<<iLeaf) ) == 0);
}

Here is the caller graph for this function:

Map_CutGetRootArea()

float Map_CutGetRootArea	(	Map_Cut_t *	pCut,
		int	fPhase )

function*************************************************************

synopsis [Computes the exact area associated with the cut.]

description []

sideeffects []

seealso []

Definition at line 114 of file mapperCutUtils.c.

{
    assert( pCut->M[fPhase].pSuperBest );
    return pCut->M[fPhase].pSuperBest->Area;
}

Here is the caller graph for this function:

Map_CutInternalNodes()

Vec_Ptr_t * Map_CutInternalNodes	(	Map_Node_t *	pObj,
		Map_Cut_t *	pCut )

Definition at line 242 of file mapperCutUtils.c.

{
  Vec_Ptr_t * vAnds = Vec_PtrAlloc( 4 );
  Map_Node_t * pTemp; int i;
  pObj->p->nTravIds++;
  for ( i = 0; i < pCut->nLeaves; i++ )
    pCut->ppLeaves[i]->TravId = pObj->p->nTravIds;
  Map_CutInternalNodes_rec( pObj, vAnds );
  if ( 0 )
  {
    printf( "Leaves:\n" );
    for ( i = 0; i < pCut->nLeaves; i++ )
      printf( " %d", pCut->ppLeaves[i]->Num );
    printf( "\n" );
    printf( "Nodes:\n" );
    Vec_PtrForEachEntry( Map_Node_t *, vAnds, pTemp, i )
      printf( "%d = %s%d & %s%d\n", pTemp->Num, 
                                    Map_IsComplement(pTemp->p1) ? "~" : " ", Map_Regular(pTemp->p1)->Num, 
                                    Map_IsComplement(pTemp->p2) ? "~" : " ", Map_Regular(pTemp->p2)->Num );
    printf( "\n" );
  }
  return vAnds;
}

Here is the call graph for this function:

Map_CutInternalNodes_rec()

void Map_CutInternalNodes_rec	(	Map_Node_t *	pObj,
		Vec_Ptr_t *	vAnds )

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

Synopsis []

Description []

SideEffects []

SeeAlso []

Definition at line 233 of file mapperCutUtils.c.

{
  if ( pObj->TravId == pObj->p->nTravIds )
    return;
  pObj->TravId = pObj->p->nTravIds;
  Map_CutInternalNodes_rec( Map_Regular(pObj->p1), vAnds );
  Map_CutInternalNodes_rec( Map_Regular(pObj->p2), vAnds );
  Vec_PtrPush( vAnds, pObj );
}

Here is the call graph for this function:

Here is the caller graph for this function:

Map_CutListAppend()

Map_Cut_t * Map_CutListAppend	(	Map_Cut_t *	pSetAll,
		Map_Cut_t *	pSets )

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

Synopsis []

Description []

SideEffects []

SeeAlso []

Definition at line 165 of file mapperCutUtils.c.

{
    Map_Cut_t * pPrev = NULL; // Suppress "might be used uninitialized"
    Map_Cut_t * pTemp;
    if ( pSetAll == NULL )
        return pSets;
    if ( pSets == NULL )
        return pSetAll;
    // find the last one
    for ( pTemp = pSets; pTemp; pTemp = pTemp->pNext )
        pPrev = pTemp;
    // append all the end of the current set
    assert( pPrev->pNext == NULL );
    pPrev->pNext = pSetAll;
    return pSets;
}

Map_CutListCount()

int Map_CutListCount

(

Map_Cut_t *

pSets

)

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

Synopsis []

Description []

SideEffects []

SeeAlso []

Definition at line 214 of file mapperCutUtils.c.

{
    Map_Cut_t * pTemp;
    int i;
    for ( i = 0, pTemp = pSets; pTemp; pTemp = pTemp->pNext, i++ );
    return i;
}

Map_CutListRecycle()

void Map_CutListRecycle	(	Map_Man_t *	p,
		Map_Cut_t *	pSetList,
		Map_Cut_t *	pSave )

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

Synopsis []

Description []

SideEffects []

SeeAlso []

Definition at line 193 of file mapperCutUtils.c.

{
    Map_Cut_t * pNext, * pTemp;
    for ( pTemp = pSetList, pNext = pTemp? pTemp->pNext : NULL; 
          pTemp; 
          pTemp = pNext, pNext = pNext? pNext->pNext : NULL )
        if ( pTemp != pSave )
            Extra_MmFixedEntryRecycle( p->mmCuts, (char *)pTemp );
}

Here is the call graph for this function:

Map_CutPrint()

void Map_CutPrint	(	Map_Man_t *	p,
		Map_Node_t *	pRoot,
		Map_Cut_t *	pCut,
		int	fPhase )

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

Synopsis []

Description []

SideEffects []

SeeAlso []

Definition at line 92 of file mapperCutUtils.c.

{
    int i;
    printf( "CUT:  Delay = (%4.2f, %4.2f). Area = %4.2f. Nodes = %d -> {", 
        pCut->M[fPhase].tArrive.Rise, pCut->M[fPhase].tArrive.Fall, pCut->M[fPhase].AreaFlow, pRoot->Num );
    for ( i = 0; i < pCut->nLeaves; i++ )
        printf( " %d", pCut->ppLeaves[i]->Num );
    printf( " } \n" );
}

Map_NodeGetLeafPhase()

int Map_NodeGetLeafPhase	(	Map_Node_t *	pNode,
		int	fPhase,
		int	iLeaf )

function*************************************************************

synopsis [Computes the exact area associated with the cut.]

description []

sideeffects []

seealso []

Definition at line 148 of file mapperCutUtils.c.

{
    assert( pNode->pCutBest[fPhase]->M[fPhase].pSuperBest );
    return (( pNode->pCutBest[fPhase]->M[fPhase].uPhaseBest & (1<<iLeaf) ) == 0);
}