Go to the source code of this file.
| char* Nwk_FileNameGeneric |
( |
char * |
FileName | ) |
|
Function*************************************************************
Synopsis []
Description []
SideEffects []
SeeAlso []
Definition at line 178 of file nwkMan.c.
182 if ( (pDot =
strrchr( pRes,
'.' )) )
char * Abc_UtilStrsav(char *s)
DECLARATIONS ///.
CFile****************************************************************
FileName [nwkMan.c]
SystemName [ABC: Logic synthesis and verification system.]
PackageName [Logic network representation.]
Synopsis [Network manager.]
Author [Alan Mishchenko]
Affiliation [UC Berkeley]
Date [Ver. 1.0. Started - June 20, 2005.]
Revision [
- Id:
- nwkMan.c,v 1.1 2008/10/10 14:09:30 mjarvin Exp
]FUNCTION DEFINITIONS /// Function*************************************************************
Synopsis [Allocates the manager.]
Description []
SideEffects []
SeeAlso []
Definition at line 45 of file nwkMan.c.
#define ABC_ALLOC(type, num)
Hop_Man_t * Hop_ManStart()
DECLARATIONS ///.
static Vec_Ptr_t * Vec_PtrAlloc(int nCap)
FUNCTION DEFINITIONS ///.
Aig_MmFlex_t * Aig_MmFlexStart()
| int Nwk_ManCompareAndSaveBest |
( |
Nwk_Man_t * |
pNtk, |
|
|
void * |
pNtl |
|
) |
| |
Function*************************************************************
Synopsis [If the network is best, saves it in "best.blif" and returns 1.]
Description [If the networks are incomparable, saves the new network, returns its parameters in the internal parameter structure, and returns 1. If the new network is not a logic network, quits without saving and returns 0.]
SideEffects []
SeeAlso []
Definition at line 121 of file nwkMan.c.
125 static struct ParStruct {
132 } ParsNew, ParsBest = { 0 };
146 if ( ParsBest.pName == NULL ||
148 ParsBest.Depth > ParsNew.Depth ||
149 (ParsBest.Depth == ParsNew.Depth && ParsBest.Flops > ParsNew.Flops) ||
150 (ParsBest.Depth == ParsNew.Depth && ParsBest.Flops == ParsNew.Flops && ParsBest.Nodes > ParsNew.Nodes) )
154 ParsBest.Depth = ParsNew.Depth;
155 ParsBest.Flops = ParsNew.Flops;
156 ParsBest.Nodes = ParsNew.Nodes;
157 ParsBest.nPis = ParsNew.nPis;
158 ParsBest.nPos = ParsNew.nPos;
typedefABC_NAMESPACE_HEADER_START struct Vec_Ptr_t_ Vec_Ptr_t
INCLUDES ///.
ABC_DLL int Nwk_ManLevel(Nwk_Man_t *pNtk)
ABC_DLL int Nwk_ManPoNum(Nwk_Man_t *pNtk)
static int Nwk_ManLatchNum(Nwk_Man_t *p)
ABC_DLL int Nwk_ManPiNum(Nwk_Man_t *pNtk)
ABC_DLL void Nwk_ManDumpBlif(Nwk_Man_t *p, char *pFileName, Vec_Ptr_t *vCiNames, Vec_Ptr_t *vCoNames)
static int Nwk_ManNodeNum(Nwk_Man_t *p)
char * Abc_UtilStrsav(char *s)
Function*************************************************************
Synopsis [Deallocates the manager.]
Description []
SideEffects []
SeeAlso []
Definition at line 71 of file nwkMan.c.
void Hop_ManStop(Hop_Man_t *p)
void Tim_ManStop(Tim_Man_t *p)
void Aig_MmFlexStop(Aig_MmFlex_t *p, int fVerbose)
static void Vec_PtrFree(Vec_Ptr_t *p)
Function*************************************************************
Synopsis [Prints stats of the manager.]
Description []
SideEffects []
SeeAlso []
Definition at line 97 of file nwkMan.c.
100 int i, Counters[256] = {0};
103 printf( "LUTs by
size: " );
104 for ( i = 0; i <= pLutLib->LutMax; i++ )
105 printf( "%d:%d ", i, Counters[i] );
typedefABC_NAMESPACE_HEADER_START struct Nwk_Obj_t_ Nwk_Obj_t
INCLUDES ///.
for(p=first;p->value< newval;p=p->next)
static int Nwk_ObjFaninNum(Nwk_Obj_t *p)
#define Nwk_ManForEachNode(p, pObj, i)
Function*************************************************************
Synopsis [Prints stats of the manager.]
Description []
SideEffects []
SeeAlso []
Definition at line 234 of file nwkMan.c.
242 char Buffer[1000] = {0};
244 sprintf( Buffer,
"%s_dump.blif", pNameGen );
252 printf(
"%-15s : ", pNtk->
pName );
ABC_DLL int Nwk_ManLevel(Nwk_Man_t *pNtk)
ABC_DLL int Nwk_ManPoNum(Nwk_Man_t *pNtk)
ABC_DLL int Nwk_ManGetAigNodeNum(Nwk_Man_t *pNtk)
char * Nwk_FileNameGeneric(char *FileName)
ABC_DLL int Nwk_ManPiNum(Nwk_Man_t *pNtk)
static int Nwk_ManCiNum(Nwk_Man_t *p)
MACRO DEFINITIONS ///.
int Nwk_ManCompareAndSaveBest(Nwk_Man_t *pNtk, void *pNtl)
ABC_DLL float Nwk_ManDelayTraceLut(Nwk_Man_t *pNtk)
float Nwl_ManComputeTotalSwitching(Nwk_Man_t *pNtk)
ABC_DLL int Nwk_ManGetTotalFanins(Nwk_Man_t *pNtk)
static int Nwk_ManNodeNum(Nwk_Man_t *p)
void Nwk_ManPrintLutSizes(Nwk_Man_t *p, If_LibLut_t *pLutLib)
static int Nwk_ManCoNum(Nwk_Man_t *p)
| float Nwl_ManComputeTotalSwitching |
( |
Nwk_Man_t * |
pNtk | ) |
|
Function*************************************************************
Synopsis [Marks nodes for power-optimization.]
Description []
SideEffects []
SeeAlso []
Definition at line 198 of file nwkMan.c.
206 float Result = (float)0;
212 pSwitching = (
float *)vSwitching->pArray;
static int Nwk_ObjFanoutNum(Nwk_Obj_t *p)
typedefABC_NAMESPACE_HEADER_START struct Aig_Man_t_ Aig_Man_t
INCLUDES ///.
typedefABC_NAMESPACE_HEADER_START struct Nwk_Obj_t_ Nwk_Obj_t
INCLUDES ///.
typedefABC_NAMESPACE_IMPL_START struct Vec_Int_t_ Vec_Int_t
DECLARATIONS ///.
void Aig_ManStop(Aig_Man_t *p)
static Aig_Obj_t * Aig_Regular(Aig_Obj_t *p)
ABC_DLL Aig_Man_t * Nwk_ManStrash(Nwk_Man_t *p)
Vec_Int_t * Saig_ManComputeSwitchProbs(Aig_Man_t *pAig, int nFrames, int nPref, int fProbOne)
#define Nwk_ManForEachObj(p, pObj, i)
static void Vec_IntFree(Vec_Int_t *p)