mapperCreate.c File Reference

#include "mapperInt.h"

Include dependency graph for mapperCreate.c:

Go to the source code of this file.

Functions
int	Map_ManReadInputNum (Map_Man_t *p)
	FUNCTION DEFINITIONS ///.
int	Map_ManReadOutputNum (Map_Man_t *p)
int	Map_ManReadBufNum (Map_Man_t *p)
Map_Node_t **	Map_ManReadInputs (Map_Man_t *p)
Map_Node_t **	Map_ManReadOutputs (Map_Man_t *p)
Map_Node_t **	Map_ManReadBufs (Map_Man_t *p)
Map_Node_t *	Map_ManReadBufDriver (Map_Man_t *p, int i)
Map_Node_t *	Map_ManReadConst1 (Map_Man_t *p)
Map_Time_t *	Map_ManReadInputArrivals (Map_Man_t *p)
Map_Time_t *	Map_ManReadOutputRequireds (Map_Man_t *p)
Mio_Library_t *	Map_ManReadGenLib (Map_Man_t *p)
int	Map_ManReadVerbose (Map_Man_t *p)
float	Map_ManReadAreaFinal (Map_Man_t *p)
float	Map_ManReadRequiredGlo (Map_Man_t *p)
void	Map_ManSetOutputNames (Map_Man_t *p, char **ppNames)
void	Map_ManSetAreaRecovery (Map_Man_t *p, int fAreaRecovery)
void	Map_ManSetDelayTarget (Map_Man_t *p, float DelayTarget)
void	Map_ManSetInputArrivals (Map_Man_t *p, Map_Time_t *pArrivals)
void	Map_ManSetOutputRequireds (Map_Man_t *p, Map_Time_t *pRequireds)
void	Map_ManSetObeyFanoutLimits (Map_Man_t *p, int fObeyFanoutLimits)
void	Map_ManSetNumIterations (Map_Man_t *p, int nIterations)
int	Map_ManReadFanoutViolations (Map_Man_t *p)
void	Map_ManSetFanoutViolations (Map_Man_t *p, int nVio)
void	Map_ManSetChoiceNodeNum (Map_Man_t *p, int nChoiceNodes)
void	Map_ManSetChoiceNum (Map_Man_t *p, int nChoices)
void	Map_ManSetVerbose (Map_Man_t *p, int fVerbose)
void	Map_ManSetSwitching (Map_Man_t *p, int fSwitching)
void	Map_ManSetSkipFanout (Map_Man_t *p, int fSkipFanout)
void	Map_ManSetUseProfile (Map_Man_t *p)
void	Map_ManCreateAigIds (Map_Man_t *p, int nObjs)
Map_Man_t *	Map_NodeReadMan (Map_Node_t *p)
char *	Map_NodeReadData (Map_Node_t *p, int fPhase)
int	Map_NodeReadNum (Map_Node_t *p)
int	Map_NodeReadLevel (Map_Node_t *p)
int	Map_NodeReadAigId (Map_Node_t *p)
Map_Cut_t *	Map_NodeReadCuts (Map_Node_t *p)
Map_Cut_t *	Map_NodeReadCutBest (Map_Node_t *p, int fPhase)
Map_Node_t *	Map_NodeReadOne (Map_Node_t *p)
Map_Node_t *	Map_NodeReadTwo (Map_Node_t *p)
void	Map_NodeSetData (Map_Node_t *p, int fPhase, char *pData)
void	Map_NodeSetNextE (Map_Node_t *p, Map_Node_t *pNextE)
void	Map_NodeSetRepr (Map_Node_t *p, Map_Node_t *pRepr)
void	Map_NodeSetSwitching (Map_Node_t *p, float Switching)
void	Map_NodeSetAigId (Map_Node_t *p, int Id)
int	Map_NodeIsConst (Map_Node_t *p)
int	Map_NodeIsVar (Map_Node_t *p)
int	Map_NodeIsBuf (Map_Node_t *p)
int	Map_NodeIsAnd (Map_Node_t *p)
int	Map_NodeComparePhase (Map_Node_t *p1, Map_Node_t *p2)
Map_Super_t *	Map_CutReadSuperBest (Map_Cut_t *p, int fPhase)
Map_Super_t *	Map_CutReadSuper0 (Map_Cut_t *p)
Map_Super_t *	Map_CutReadSuper1 (Map_Cut_t *p)
int	Map_CutReadLeavesNum (Map_Cut_t *p)
Map_Node_t **	Map_CutReadLeaves (Map_Cut_t *p)
unsigned	Map_CutReadPhaseBest (Map_Cut_t *p, int fPhase)
unsigned	Map_CutReadPhase0 (Map_Cut_t *p)
unsigned	Map_CutReadPhase1 (Map_Cut_t *p)
Map_Cut_t *	Map_CutReadNext (Map_Cut_t *p)
char *	Map_SuperReadFormula (Map_Super_t *p)
Mio_Gate_t *	Map_SuperReadRoot (Map_Super_t *p)
int	Map_SuperReadNum (Map_Super_t *p)
Map_Super_t **	Map_SuperReadFanins (Map_Super_t *p)
int	Map_SuperReadFaninNum (Map_Super_t *p)
Map_Super_t *	Map_SuperReadNext (Map_Super_t *p)
int	Map_SuperReadNumPhases (Map_Super_t *p)
unsigned char *	Map_SuperReadPhases (Map_Super_t *p)
int	Map_SuperReadFanoutLimit (Map_Super_t *p)
Mio_Library_t *	Map_SuperLibReadGenLib (Map_SuperLib_t *p)
float	Map_SuperLibReadAreaInv (Map_SuperLib_t *p)
Map_Time_t	Map_SuperLibReadDelayInv (Map_SuperLib_t *p)
int	Map_SuperLibReadVarsMax (Map_SuperLib_t *p)
Map_Man_t *	Map_ManCreate (int nInputs, int nOutputs, int fVerbose)
	FUNCTION DEFINITIONS ///.
void	Map_ManFree (Map_Man_t *p)
void	Map_ManCreateNodeDelays (Map_Man_t *p, int LogFan)
void	Map_ManPrintTimeStats (Map_Man_t *p)
void	Map_ManPrintStatsToFile (char *pName, float Area, float Delay, abctime Time)
Map_Node_t *	Map_NodeCreate (Map_Man_t *p, Map_Node_t *p1, Map_Node_t *p2)
Map_Node_t *	Map_NodeAnd (Map_Man_t *pMan, Map_Node_t *p1, Map_Node_t *p2)
Map_Node_t *	Map_NodeBuf (Map_Man_t *p, Map_Node_t *p1)
void	Map_NodeSetChoice (Map_Man_t *pMan, Map_Node_t *pNodeOld, Map_Node_t *pNodeNew)

Function Documentation

Map_CutReadLeaves()

Map_Node_t ** Map_CutReadLeaves

(

Map_Cut_t *

p

)

Definition at line 141 of file mapperCreate.c.

{ return p->ppLeaves; }

Map_CutReadLeavesNum()

int Map_CutReadLeavesNum

(

Map_Cut_t *

p

)

Definition at line 140 of file mapperCreate.c.

{ return p->nLeaves;  }

Map_CutReadNext()

Map_Cut_t * Map_CutReadNext

(

Map_Cut_t *

p

)

Definition at line 145 of file mapperCreate.c.

{ return p->pNext;          }

Map_CutReadPhase0()

unsigned Map_CutReadPhase0

(

Map_Cut_t *

p

)

Definition at line 143 of file mapperCreate.c.

{ return p->M[0].uPhaseBest;}

Map_CutReadPhase1()

unsigned Map_CutReadPhase1

(

Map_Cut_t *

p

)

Definition at line 144 of file mapperCreate.c.

{ return p->M[1].uPhaseBest;}

Map_CutReadPhaseBest()

unsigned Map_CutReadPhaseBest	(	Map_Cut_t *	p,
		int	fPhase )

Definition at line 142 of file mapperCreate.c.

{ return p->M[fPhase].uPhaseBest;}

Map_CutReadSuper0()

Map_Super_t * Map_CutReadSuper0

(

Map_Cut_t *

p

)

Definition at line 138 of file mapperCreate.c.

{ return p->M[0].pSuperBest;}

Map_CutReadSuper1()

Map_Super_t * Map_CutReadSuper1

(

Map_Cut_t *

p

)

Definition at line 139 of file mapperCreate.c.

{ return p->M[1].pSuperBest;}

Map_CutReadSuperBest()

Map_Super_t * Map_CutReadSuperBest	(	Map_Cut_t *	p,
		int	fPhase )

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

Synopsis [Reads parameters from the cut.]

Description []

SideEffects []

SeeAlso []

Definition at line 137 of file mapperCreate.c.

{ return p->M[fPhase].pSuperBest;}

Map_ManCreate()

Map_Man_t * Map_ManCreate	(	int	nInputs,
		int	nOutputs,
		int	fVerbose )

FUNCTION DEFINITIONS ///.

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

Synopsis [Create the mapping manager.]

Description [The number of inputs and outputs is assumed to be known is advance. It is much simpler to have them fixed upfront. When it comes to representing the object graph in the form of AIG, the resulting manager is similar to the regular AIG manager, except that it does not use reference counting (and therefore does not have garbage collections). It does have table resizing. The data structure is more flexible to represent additional information needed for mapping.]

SideEffects []

SeeAlso []

Definition at line 192 of file mapperCreate.c.

{
    Map_Man_t * p;
    int i;
 
    // derive the supergate library
    if ( Abc_FrameReadLibSuper() == NULL )
    {
        printf( "The supergate library is not specified. Use \"read_super\".\n" );
        return NULL;
    }
 
    // start the manager
    p = ABC_ALLOC( Map_Man_t, 1 );
    memset( p, 0, sizeof(Map_Man_t) );
    p->pSuperLib = (Map_SuperLib_t *)Abc_FrameReadLibSuper();
    p->nVarsMax  = p->pSuperLib->nVarsMax;
    p->fVerbose  = fVerbose;
    p->fEpsilon  = (float)0.001;
    assert( p->nVarsMax > 0 );
 
    if ( p->nVarsMax == 5 )
        Extra_Truth4VarN( &p->uCanons, &p->uPhases, &p->pCounters, 8 );
 
    // start various data structures
    Map_TableCreate( p );
    Map_MappingSetupTruthTables( p->uTruths );
    Map_MappingSetupTruthTablesLarge( p->uTruthsLarge );
//    printf( "Node = %d bytes. Cut = %d bytes. Super = %d bytes.\n", sizeof(Map_Node_t), sizeof(Map_Cut_t), sizeof(Map_Super_t) ); 
    p->mmNodes    = Extra_MmFixedStart( sizeof(Map_Node_t) );
    p->mmCuts     = Extra_MmFixedStart( sizeof(Map_Cut_t) );
 
    // make sure the constant node will get index -1
    p->nNodes = -1;
    // create the constant node
    p->pConst1    = Map_NodeCreate( p, NULL, NULL );
    p->vMapObjs   = Map_NodeVecAlloc( 100 );
    p->vMapBufs   = Map_NodeVecAlloc( 100 );
    p->vVisited   = Map_NodeVecAlloc( 100 );
 
    // create the PI nodes
    p->nInputs = nInputs;
    p->pInputs = ABC_ALLOC( Map_Node_t *, nInputs );
    for ( i = 0; i < nInputs; i++ )
        p->pInputs[i] = Map_NodeCreate( p, NULL, NULL );
 
    // create the place for the output nodes
    p->nOutputs = nOutputs;
    p->pOutputs = ABC_ALLOC( Map_Node_t *, nOutputs );
    memset( p->pOutputs, 0, sizeof(Map_Node_t *) * nOutputs );
    return p;
}

Here is the call graph for this function:

Here is the caller graph for this function:

Map_ManCreateAigIds()

void Map_ManCreateAigIds	(	Map_Man_t *	p,
		int	nObjs )

Definition at line 78 of file mapperCreate.c.

{ p->pAigNodeIDs = ABC_CALLOC( int, nObjs ); }   

Here is the caller graph for this function:

Map_ManCreateNodeDelays()

void Map_ManCreateNodeDelays	(	Map_Man_t *	p,
		int	LogFan )

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

Synopsis [Creates node delays.]

Description []

SideEffects []

SeeAlso []

Definition at line 293 of file mapperCreate.c.

{
    Map_Node_t * pNode;
    int k;
    assert( p->pNodeDelays == NULL );
    p->pNodeDelays = ABC_CALLOC( float, p->vMapObjs->nSize );
    for ( k = 0; k < p->vMapObjs->nSize; k++ )
    {
        pNode = p->vMapObjs->pArray[k];
        if ( pNode->nRefs == 0 )
            continue;
        p->pNodeDelays[k] = 0.014426 * LogFan * p->pSuperLib->tDelayInv.Worst * log( (double)pNode->nRefs ); // 1.4426 = 1/ln(2)
//        printf( "%d = %d (%.2f)  ", k, pNode->nRefs, p->pNodeDelays[k] );
    }
//    printf( "\n" );
}

Here is the caller graph for this function:

Map_ManFree()

void Map_ManFree

(

Map_Man_t *

p

)

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

Synopsis [Deallocates the mapping manager.]

Description []

SideEffects []

SeeAlso []

Definition at line 256 of file mapperCreate.c.

{
//    int i;
//    for ( i = 0; i < p->vMapObjs->nSize; i++ )
//        Map_NodeVecFree( p->vMapObjs->pArray[i]->vFanouts );
//    Map_NodeVecFree( p->pConst1->vFanouts );
    Map_NodeVecFree( p->vMapObjs );
    Map_NodeVecFree( p->vMapBufs );
    Map_NodeVecFree( p->vVisited );
    if ( p->uCanons )   ABC_FREE( p->uCanons );
    if ( p->uPhases )   ABC_FREE( p->uPhases );
    if ( p->pCounters ) ABC_FREE( p->pCounters );
    Extra_MmFixedStop( p->mmNodes );
    Extra_MmFixedStop( p->mmCuts );
    ABC_FREE( p->pAigNodeIDs );
    ABC_FREE( p->pNodeDelays );
    ABC_FREE( p->pInputArrivals );
    ABC_FREE( p->pOutputRequireds );
    ABC_FREE( p->pInputs );
    ABC_FREE( p->pOutputs );
    ABC_FREE( p->pBins );
    ABC_FREE( p->ppOutputNames );
    ABC_FREE( p );
}

Here is the call graph for this function:

Here is the caller graph for this function:

Map_ManPrintStatsToFile()

void Map_ManPrintStatsToFile	(	char *	pName,
		float	Area,
		float	Delay,
		abctime	Time )

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

Synopsis [Prints the mapping stats.]

Description []

SideEffects []

SeeAlso []

Definition at line 350 of file mapperCreate.c.

{
    FILE * pTable;
    pTable = fopen( "map_stats.txt", "a+" );
    fprintf( pTable, "%s ", pName );
    fprintf( pTable, "%4.2f ", Area );
    fprintf( pTable, "%4.2f ", Delay );
    fprintf( pTable, "%4.2f\n", (float)(Time)/(float)(CLOCKS_PER_SEC) );
    fclose( pTable );
}

Map_ManPrintTimeStats()

void Map_ManPrintTimeStats

(

Map_Man_t *

p

)

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

Synopsis [Deallocates the mapping manager.]

Description []

SideEffects []

SeeAlso []

Definition at line 322 of file mapperCreate.c.

{
    printf( "N-canonical = %d. Matchings = %d.  Phases = %d.  ", p->nCanons, p->nMatches, p->nPhases );
    printf( "Choice nodes = %d. Choices = %d.\n", p->nChoiceNodes, p->nChoices );
    ABC_PRT( "ToMap", p->timeToMap );
    ABC_PRT( "Cuts ", p->timeCuts  );
    ABC_PRT( "Truth", p->timeTruth );
    ABC_PRT( "Match", p->timeMatch );
    ABC_PRT( "Area ", p->timeArea  );
    ABC_PRT( "Sweep", p->timeSweep );
    ABC_PRT( "ToNet", p->timeToNet );
    ABC_PRT( "TOTAL", p->timeTotal );
    if ( p->time1 ) { ABC_PRT( "time1", p->time1 ); }
    if ( p->time2 ) { ABC_PRT( "time2", p->time2 ); }
    if ( p->time3 ) { ABC_PRT( "time3", p->time3 ); }
}

Map_ManReadAreaFinal()

float Map_ManReadAreaFinal

(

Map_Man_t *

p

)

Definition at line 61 of file mapperCreate.c.

{ return p->AreaFinal;  }

Map_ManReadBufDriver()

Map_Node_t * Map_ManReadBufDriver	(	Map_Man_t *	p,
		int	i )

Definition at line 55 of file mapperCreate.c.

{ return Map_ManReadBufs(p)[i]->p1;           }

Here is the call graph for this function:

Here is the caller graph for this function:

Map_ManReadBufNum()

int Map_ManReadBufNum

(

Map_Man_t *

p

)

Definition at line 51 of file mapperCreate.c.

{ return Map_NodeVecReadSize(p->vMapBufs);   }

Here is the call graph for this function:

Here is the caller graph for this function:

Map_ManReadBufs()

Map_Node_t ** Map_ManReadBufs

(

Map_Man_t *

p

)

Definition at line 54 of file mapperCreate.c.

{ return Map_NodeVecReadArray(p->vMapBufs);  }

Here is the call graph for this function:

Here is the caller graph for this function:

Map_ManReadConst1()

Map_Node_t * Map_ManReadConst1

(

Map_Man_t *

p

)

Definition at line 56 of file mapperCreate.c.

{ return p->pConst1;    }

Here is the caller graph for this function:

Map_ManReadFanoutViolations()

int Map_ManReadFanoutViolations

(

Map_Man_t *

p

)

Definition at line 70 of file mapperCreate.c.

{ return p->nFanoutViolations;   }  

Map_ManReadGenLib()

Mio_Library_t * Map_ManReadGenLib

(

Map_Man_t *

p

)

Definition at line 59 of file mapperCreate.c.

{ return p->pSuperLib->pGenlib; }

Map_ManReadInputArrivals()

Map_Time_t * Map_ManReadInputArrivals

(

Map_Man_t *

p

)

Definition at line 57 of file mapperCreate.c.

{ return p->pInputArrivals; }

Map_ManReadInputNum()

int Map_ManReadInputNum

(

Map_Man_t *

p

)

FUNCTION DEFINITIONS ///.

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

Synopsis [Reads parameters from the mapping manager.]

Description []

SideEffects []

SeeAlso []

Definition at line 49 of file mapperCreate.c.

{ return p->nInputs;    }

Map_ManReadInputs()

Map_Node_t ** Map_ManReadInputs

(

Map_Man_t *

p

)

Definition at line 52 of file mapperCreate.c.

{ return p->pInputs;    }

Here is the caller graph for this function:

Map_ManReadOutputNum()

int Map_ManReadOutputNum

(

Map_Man_t *

p

)

Definition at line 50 of file mapperCreate.c.

{ return p->nOutputs;   }

Map_ManReadOutputRequireds()

Map_Time_t * Map_ManReadOutputRequireds

(

Map_Man_t *

p

)

Definition at line 58 of file mapperCreate.c.

{ return p->pOutputRequireds; }

Map_ManReadOutputs()

Map_Node_t ** Map_ManReadOutputs

(

Map_Man_t *

p

)

Definition at line 53 of file mapperCreate.c.

{ return p->pOutputs;   }

Here is the caller graph for this function:

Map_ManReadRequiredGlo()

float Map_ManReadRequiredGlo

(

Map_Man_t *

p

)

Definition at line 62 of file mapperCreate.c.

{ return p->fRequiredGlo; }

Map_ManReadVerbose()

int Map_ManReadVerbose

(

Map_Man_t *

p

)

Definition at line 60 of file mapperCreate.c.

{ return p->fVerbose;   }

Map_ManSetAreaRecovery()

void Map_ManSetAreaRecovery	(	Map_Man_t *	p,
		int	fAreaRecovery )

Definition at line 64 of file mapperCreate.c.

{ p->fAreaRecovery = fAreaRecovery;}

Here is the caller graph for this function:

Map_ManSetChoiceNodeNum()

void Map_ManSetChoiceNodeNum	(	Map_Man_t *	p,
		int	nChoiceNodes )

Definition at line 72 of file mapperCreate.c.

{ p->nChoiceNodes = nChoiceNodes; }  

Map_ManSetChoiceNum()

void Map_ManSetChoiceNum	(	Map_Man_t *	p,
		int	nChoices )

Definition at line 73 of file mapperCreate.c.

{ p->nChoices = nChoices;     }   

Map_ManSetDelayTarget()

void Map_ManSetDelayTarget	(	Map_Man_t *	p,
		float	DelayTarget )

Definition at line 65 of file mapperCreate.c.

{ p->DelayTarget = DelayTarget;}

Here is the caller graph for this function:

Map_ManSetFanoutViolations()

void Map_ManSetFanoutViolations	(	Map_Man_t *	p,
		int	nVio )

Definition at line 71 of file mapperCreate.c.

{ p->nFanoutViolations = nVio;   }  

Map_ManSetInputArrivals()

void Map_ManSetInputArrivals	(	Map_Man_t *	p,
		Map_Time_t *	pArrivals )

Definition at line 66 of file mapperCreate.c.

{ p->pInputArrivals = pArrivals;    }

Here is the caller graph for this function:

Map_ManSetNumIterations()

void Map_ManSetNumIterations	(	Map_Man_t *	p,
		int	nIterations )

Definition at line 69 of file mapperCreate.c.

{ p->nIterations = nIterations;     }

Map_ManSetObeyFanoutLimits()

void Map_ManSetObeyFanoutLimits	(	Map_Man_t *	p,
		int	fObeyFanoutLimits )

Definition at line 68 of file mapperCreate.c.

{ p->fObeyFanoutLimits = fObeyFanoutLimits;     }

Map_ManSetOutputNames()

void Map_ManSetOutputNames	(	Map_Man_t *	p,
		char **	ppNames )

Definition at line 63 of file mapperCreate.c.

{ p->ppOutputNames = ppNames;}

Here is the caller graph for this function:

Map_ManSetOutputRequireds()

void Map_ManSetOutputRequireds	(	Map_Man_t *	p,
		Map_Time_t *	pRequireds )

Definition at line 67 of file mapperCreate.c.

{ p->pOutputRequireds = pRequireds; }

Here is the caller graph for this function:

Map_ManSetSkipFanout()

void Map_ManSetSkipFanout	(	Map_Man_t *	p,
		int	fSkipFanout )

Definition at line 76 of file mapperCreate.c.

{ p->fSkipFanout = fSkipFanout; }   

Here is the caller graph for this function:

Map_ManSetSwitching()

void Map_ManSetSwitching	(	Map_Man_t *	p,
		int	fSwitching )

Definition at line 75 of file mapperCreate.c.

{ p->fSwitching = fSwitching; }   

Here is the caller graph for this function:

Map_ManSetUseProfile()

void Map_ManSetUseProfile

(

Map_Man_t *

p

)

Definition at line 77 of file mapperCreate.c.

{ p->fUseProfile = 1;         }   

Here is the caller graph for this function:

Map_ManSetVerbose()

void Map_ManSetVerbose	(	Map_Man_t *	p,
		int	fVerbose )

Definition at line 74 of file mapperCreate.c.

{ p->fVerbose = fVerbose;     }   

Map_NodeAnd()

Map_Node_t * Map_NodeAnd	(	Map_Man_t *	pMan,
		Map_Node_t *	p1,
		Map_Node_t *	p2 )

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

Synopsis [Looks up the AND2 node in the unique table.]

Description [This procedure implements one-level hashing. All the nodes are hashed by their children. If the node with the same children was already created, it is returned by the call to this procedure. If it does not exist, this procedure creates a new node with these children. ]

SideEffects []

SeeAlso []

Definition at line 456 of file mapperCreate.c.

{
    Map_Node_t * pEnt;
    unsigned Key;
 
    if ( p1 == p2 )
        return p1;
    if ( p1 == Map_Not(p2) )
        return Map_Not(pMan->pConst1);
    if ( Map_NodeIsConst(p1) )
    {
        if ( p1 == pMan->pConst1 )
            return p2;
        return Map_Not(pMan->pConst1);
    }
    if ( Map_NodeIsConst(p2) )
    {
        if ( p2 == pMan->pConst1 )
            return p1;
        return Map_Not(pMan->pConst1);
    }
 
    if ( Map_Regular(p1)->Num > Map_Regular(p2)->Num )
        pEnt = p1, p1 = p2, p2 = pEnt;
 
    Key = Map_HashKey2( p1, p2, pMan->nBins );
    for ( pEnt = pMan->pBins[Key]; pEnt; pEnt = pEnt->pNext )
        if ( pEnt->p1 == p1 && pEnt->p2 == p2 )
            return pEnt;
    // resize the table
    if ( pMan->nNodes >= 2 * pMan->nBins )
    {
        Map_TableResize( pMan );
        Key = Map_HashKey2( p1, p2, pMan->nBins );
    }
    // create the new node
    pEnt = Map_NodeCreate( pMan, p1, p2 );
    // add the node to the corresponding linked list in the table
    pEnt->pNext = pMan->pBins[Key];
    pMan->pBins[Key] = pEnt;
    return pEnt;
}

Here is the call graph for this function:

Here is the caller graph for this function:

Map_NodeBuf()

Map_Node_t * Map_NodeBuf	(	Map_Man_t *	p,
		Map_Node_t *	p1 )

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

Synopsis []

Description []

SideEffects []

SeeAlso []

Definition at line 561 of file mapperCreate.c.

{
    Map_Node_t * pNode = Map_NodeCreate( p, p1, NULL );
    Map_NodeVecPush( p->vMapBufs, pNode );
    return pNode;
}

Here is the call graph for this function:

Here is the caller graph for this function:

Map_NodeComparePhase()

int Map_NodeComparePhase	(	Map_Node_t *	p1,
		Map_Node_t *	p2 )

Definition at line 124 of file mapperCreate.c.

{ assert( !Map_IsComplement(p1) ); assert( !Map_IsComplement(p2) ); return p1->fInv ^ p2->fInv; }

Map_NodeCreate()

Map_Node_t * Map_NodeCreate	(	Map_Man_t *	p,
		Map_Node_t *	p1,
		Map_Node_t *	p2 )

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

Synopsis [Creates a new node.]

Description [This procedure should be called to create the constant node and the PI nodes first.]

SideEffects []

SeeAlso []

Definition at line 373 of file mapperCreate.c.

{
    Map_Node_t * pNode;
    // create the node
    pNode = (Map_Node_t *)Extra_MmFixedEntryFetch( p->mmNodes );
    memset( pNode, 0, sizeof(Map_Node_t) );
    pNode->tRequired[0].Rise = pNode->tRequired[0].Fall = pNode->tRequired[0].Worst = MAP_FLOAT_LARGE;
    pNode->tRequired[1].Rise = pNode->tRequired[1].Fall = pNode->tRequired[1].Worst = MAP_FLOAT_LARGE;
    pNode->p1  = p1; 
    pNode->p2  = p2;
    pNode->p = p;
    // set the number of this node
    pNode->Num = p->nNodes++;
    // place to store the fanouts
//    pNode->vFanouts = Map_NodeVecAlloc( 5 );
    // store this node in the internal array
    if ( pNode->Num >= 0 )
        Map_NodeVecPush( p->vMapObjs, pNode );
    else
        pNode->fInv = 1;
    // set the level of this node
    if ( p1 ) 
    {
#ifdef MAP_ALLOCATE_FANOUT
        // create the fanout info
        Map_NodeAddFaninFanout( Map_Regular(p1), pNode );
        if ( p2 )
        Map_NodeAddFaninFanout( Map_Regular(p2), pNode );
#endif
 
        if ( p2 )
        {
            pNode->Level = 1 + MAP_MAX(Map_Regular(pNode->p1)->Level, Map_Regular(pNode->p2)->Level);
            pNode->fInv  = Map_NodeIsSimComplement(p1) & Map_NodeIsSimComplement(p2);
        }
        else
        {
            pNode->Level = Map_Regular(pNode->p1)->Level;
            pNode->fInv  = Map_NodeIsSimComplement(p1);
        }
    }
    // reference the inputs (will be used to compute the number of fanouts)
    if ( p1 ) Map_NodeRef(p1);
    if ( p2 ) Map_NodeRef(p2);
 
    pNode->nRefEst[0] = pNode->nRefEst[1] = -1;
    return pNode;
}

Here is the call graph for this function:

Here is the caller graph for this function:

Map_NodeIsAnd()

int Map_NodeIsAnd

(

Map_Node_t *

p

)

Definition at line 123 of file mapperCreate.c.

{  return (Map_Regular(p))->p1 != NULL && (Map_Regular(p))->p2 != NULL;  }

Here is the caller graph for this function:

Map_NodeIsBuf()

int Map_NodeIsBuf

(

Map_Node_t *

p

)

Definition at line 122 of file mapperCreate.c.

{  return (Map_Regular(p))->p1 != NULL && (Map_Regular(p))->p2 == NULL;  }

Here is the caller graph for this function:

Map_NodeIsConst()

int Map_NodeIsConst

(

Map_Node_t *

p

)

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

Synopsis [Checks the type of the node.]

Description []

SideEffects []

SeeAlso []

Definition at line 120 of file mapperCreate.c.

{  return (Map_Regular(p))->Num == -1;    }

Here is the caller graph for this function:

Map_NodeIsVar()

int Map_NodeIsVar

(

Map_Node_t *

p

)

Definition at line 121 of file mapperCreate.c.

{  return (Map_Regular(p))->p1 == NULL && (Map_Regular(p))->Num >= 0; }

Here is the caller graph for this function:

Map_NodeReadAigId()

int Map_NodeReadAigId

(

Map_Node_t *

p

)

Definition at line 95 of file mapperCreate.c.

{ return p->p->pAigNodeIDs[p->Num]; }

Map_NodeReadCutBest()

Map_Cut_t * Map_NodeReadCutBest	(	Map_Node_t *	p,
		int	fPhase )

Definition at line 97 of file mapperCreate.c.

{ return p->pCutBest[fPhase];   }

Map_NodeReadCuts()

Map_Cut_t * Map_NodeReadCuts

(

Map_Node_t *

p

)

Definition at line 96 of file mapperCreate.c.

{ return p->pCuts;              }

Map_NodeReadData()

char * Map_NodeReadData	(	Map_Node_t *	p,
		int	fPhase )

Definition at line 92 of file mapperCreate.c.

{ return fPhase? p->pData1 : p->pData0;  }

Map_NodeReadLevel()

int Map_NodeReadLevel

(

Map_Node_t *

p

)

Definition at line 94 of file mapperCreate.c.

{ return Map_Regular(p)->Level; }

Map_NodeReadMan()

Map_Man_t * Map_NodeReadMan

(

Map_Node_t *

p

)

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

Synopsis [Reads parameters from the mapping node.]

Description []

SideEffects []

SeeAlso []

Definition at line 91 of file mapperCreate.c.

{ return p->p;                  }

Map_NodeReadNum()

int Map_NodeReadNum

(

Map_Node_t *

p

)

Definition at line 93 of file mapperCreate.c.

{ return p->Num;                }

Map_NodeReadOne()

Map_Node_t * Map_NodeReadOne

(

Map_Node_t *

p

)

Definition at line 98 of file mapperCreate.c.

{ return p->p1;                 }

Map_NodeReadTwo()

Map_Node_t * Map_NodeReadTwo

(

Map_Node_t *

p

)

Definition at line 99 of file mapperCreate.c.

{ return p->p2;                 }

Map_NodeSetAigId()

void Map_NodeSetAigId	(	Map_Node_t *	p,
		int	Id )

Definition at line 104 of file mapperCreate.c.

{ p->p->pAigNodeIDs[p->Num] = Id; }

Here is the caller graph for this function:

Map_NodeSetChoice()

void Map_NodeSetChoice	(	Map_Man_t *	pMan,
		Map_Node_t *	pNodeOld,
		Map_Node_t *	pNodeNew )

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

Synopsis [Sets the node to be equivalent to the given one.]

Description [This procedure is a work-around for the equivalence check. Does not verify the equivalence. Use at the user's risk.]

SideEffects []

SeeAlso []

Definition at line 580 of file mapperCreate.c.

{
    pNodeNew->pNextE = pNodeOld->pNextE;
    pNodeOld->pNextE = pNodeNew;
    pNodeNew->pRepr  = pNodeOld;
}

Map_NodeSetData()

void Map_NodeSetData	(	Map_Node_t *	p,
		int	fPhase,
		char *	pData )

Definition at line 100 of file mapperCreate.c.

{ if (fPhase) p->pData1 = pData; else p->pData0 = pData; }

Here is the caller graph for this function:

Map_NodeSetNextE()

void Map_NodeSetNextE	(	Map_Node_t *	p,
		Map_Node_t *	pNextE )

Definition at line 101 of file mapperCreate.c.

{ p->pNextE = pNextE;       }

Here is the caller graph for this function:

Map_NodeSetRepr()

void Map_NodeSetRepr	(	Map_Node_t *	p,
		Map_Node_t *	pRepr )

Definition at line 102 of file mapperCreate.c.

{ p->pRepr = pRepr;         }

Here is the caller graph for this function:

Map_NodeSetSwitching()

void Map_NodeSetSwitching	(	Map_Node_t *	p,
		float	Switching )

Definition at line 103 of file mapperCreate.c.

{ p->Switching = Switching; }

Here is the caller graph for this function:

Map_SuperLibReadAreaInv()

float Map_SuperLibReadAreaInv

(

Map_SuperLib_t *

p

)

Definition at line 169 of file mapperCreate.c.

{  return p->AreaInv;  }

Map_SuperLibReadDelayInv()

Map_Time_t Map_SuperLibReadDelayInv

(

Map_SuperLib_t *

p

)

Definition at line 170 of file mapperCreate.c.

{  return p->tDelayInv;}

Map_SuperLibReadGenLib()

Mio_Library_t * Map_SuperLibReadGenLib

(

Map_SuperLib_t *

p

)

Definition at line 168 of file mapperCreate.c.

{  return p->pGenlib;  }

Map_SuperLibReadVarsMax()

int Map_SuperLibReadVarsMax

(

Map_SuperLib_t *

p

)

Definition at line 171 of file mapperCreate.c.

{  return p->nVarsMax; }

Map_SuperReadFaninNum()

int Map_SuperReadFaninNum

(

Map_Super_t *

p

)

Definition at line 162 of file mapperCreate.c.

{  return p->nFanins;  }

Here is the caller graph for this function:

Map_SuperReadFanins()

Map_Super_t ** Map_SuperReadFanins

(

Map_Super_t *

p

)

Definition at line 161 of file mapperCreate.c.

{  return p->pFanins;  }

Here is the caller graph for this function:

Map_SuperReadFanoutLimit()

int Map_SuperReadFanoutLimit

(

Map_Super_t *

p

)

Definition at line 166 of file mapperCreate.c.

{  return p->nFanLimit;}

Map_SuperReadFormula()

char * Map_SuperReadFormula

(

Map_Super_t *

p

)

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

Synopsis [Reads parameters from the supergate.]

Description []

SideEffects []

SeeAlso []

Definition at line 158 of file mapperCreate.c.

{  return p->pFormula; }

Map_SuperReadNext()

Map_Super_t * Map_SuperReadNext

(

Map_Super_t *

p

)

Definition at line 163 of file mapperCreate.c.

{  return p->pNext;    }

Map_SuperReadNum()

int Map_SuperReadNum

(

Map_Super_t *

p

)

Definition at line 160 of file mapperCreate.c.

{  return p->Num;      }

Here is the caller graph for this function:

Map_SuperReadNumPhases()

int Map_SuperReadNumPhases

(

Map_Super_t *

p

)

Definition at line 164 of file mapperCreate.c.

{  return p->nPhases;  }

Map_SuperReadPhases()

unsigned char * Map_SuperReadPhases

(

Map_Super_t *

p

)

Definition at line 165 of file mapperCreate.c.

{  return p->uPhases;  }

Map_SuperReadRoot()

Mio_Gate_t * Map_SuperReadRoot

(

Map_Super_t *

p

)

Definition at line 159 of file mapperCreate.c.

{  return p->pRoot;    }

Here is the caller graph for this function: