abc-master
 All Data Structures Namespaces Files Functions Variables Typedefs Enumerations Enumerator Friends Macros
Functions
retInit.c File Reference
#include "retInt.h"

Go to the source code of this file.

Functions

static ABC_NAMESPACE_IMPL_START int Abc_NtkRetimeVerifyModel (Abc_Ntk_t *pNtkCone, Vec_Int_t *vValues, int *pModel)
 DECLARATIONS ///. More...
 
Vec_Int_t * Abc_NtkRetimeInitialValues (Abc_Ntk_t *pNtkCone, Vec_Int_t *vValues, int fVerbose)
 FUNCTION DEFINITIONS ///. More...
 
int Abc_ObjSopSimulate (Abc_Obj_t *pObj)
 
void Abc_NtkRetimeTranferToCopy (Abc_Ntk_t *pNtk)
 
void Abc_NtkRetimeTranferFromCopy (Abc_Ntk_t *pNtk)
 
Vec_Int_t * Abc_NtkRetimeCollectLatchValues (Abc_Ntk_t *pNtk)
 
void Abc_NtkRetimeInsertLatchValues (Abc_Ntk_t *pNtk, Vec_Int_t *vValues)
 
Abc_Ntk_t * Abc_NtkRetimeBackwardInitialStart (Abc_Ntk_t *pNtk)
 
void Abc_NtkRetimeBackwardInitialFinish (Abc_Ntk_t *pNtk, Abc_Ntk_t *pNtkNew, Vec_Int_t *vValuesOld, int fVerbose)
 
void Abc_NtkCycleInitStateSop (Abc_Ntk_t *pNtk, int nFrames, int fVerbose)
 

Function Documentation

void Abc_NtkCycleInitStateSop ( Abc_Ntk_t *  pNtk,
int  nFrames,
int  fVerbose 
)

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

Synopsis [Cycles the circuit to create a new initial state.]

Description [Simulates the circuit with random input for the given number of timeframes to get a better initial state.]

SideEffects []

SeeAlso []

Definition at line 314 of file retInit.c.

315 {
316  Vec_Ptr_t * vNodes;
317  Abc_Obj_t * pObj;
318  int i, f;
319  assert( Abc_NtkIsSopLogic(pNtk) );
320  srand( 0x12341234 );
321  // initialize the values
322  Abc_NtkForEachPi( pNtk, pObj, i )
323  pObj->pCopy = (Abc_Obj_t *)(ABC_PTRUINT_T)(rand() & 1);
324  Abc_NtkForEachLatch( pNtk, pObj, i )
325  pObj->pCopy = (Abc_Obj_t *)(ABC_PTRUINT_T)Abc_LatchIsInit1(pObj);
326  // simulate for the given number of timeframes
327  vNodes = Abc_NtkDfs( pNtk, 0 );
328  for ( f = 0; f < nFrames; f++ )
329  {
330  // simulate internal nodes
331  Vec_PtrForEachEntry( Abc_Obj_t *, vNodes, pObj, i )
332  pObj->pCopy = (Abc_Obj_t *)(ABC_PTRUINT_T)Abc_ObjSopSimulate( pObj );
333  // bring the results to the COs
334  Abc_NtkForEachCo( pNtk, pObj, i )
335  pObj->pCopy = Abc_ObjFanin0(pObj)->pCopy;
336  // assign PI values
337  Abc_NtkForEachPi( pNtk, pObj, i )
338  pObj->pCopy = (Abc_Obj_t *)(ABC_PTRUINT_T)(rand() & 1);
339  // transfer the latch values
340  Abc_NtkForEachLatch( pNtk, pObj, i )
341  Abc_ObjFanout0(pObj)->pCopy = Abc_ObjFanin0(pObj)->pCopy;
342  }
343  Vec_PtrFree( vNodes );
344  // set the final values
345  Abc_NtkForEachLatch( pNtk, pObj, i )
346  pObj->pData = (void *)(ABC_PTRUINT_T)(Abc_ObjFanout0(pObj)->pCopy ? ABC_INIT_ONE : ABC_INIT_ZERO);
347 }
Vec_Ptr_t
typedefABC_NAMESPACE_HEADER_START struct Vec_Ptr_t_ Vec_Ptr_t
INCLUDES ///.
Definition: vecPtr.h:42
Abc_NtkForEachCo
#define Abc_NtkForEachCo(pNtk, pCo, i)
Definition: abc.h:519
Abc_NtkIsSopLogic
static int Abc_NtkIsSopLogic(Abc_Ntk_t *pNtk)
Definition: abc.h:264
Abc_NtkDfs
ABC_DLL Vec_Ptr_t * Abc_NtkDfs(Abc_Ntk_t *pNtk, int fCollectAll)
Definition: abcDfs.c:81
Abc_ObjFanin0
static Abc_Obj_t * Abc_ObjFanin0(Abc_Obj_t *pObj)
Definition: abc.h:373
for
for(p=first;p->value< newval;p=p->next)
Abc_Obj_t_
Definition: abc.h:128
Abc_ObjSopSimulate
int Abc_ObjSopSimulate(Abc_Obj_t *pObj)
Definition: retInit.c:93
Abc_NtkForEachLatch
#define Abc_NtkForEachLatch(pNtk, pObj, i)
Definition: abc.h:497
Abc_LatchIsInit1
static int Abc_LatchIsInit1(Abc_Obj_t *pLatch)
Definition: abc.h:423
assert
#define assert(ex)
Definition: util_old.h:213
Vec_PtrForEachEntry
#define Vec_PtrForEachEntry(Type, vVec, pEntry, i)
MACRO DEFINITIONS ///.
Definition: vecPtr.h:55
Abc_ObjFanout0
static Abc_Obj_t * Abc_ObjFanout0(Abc_Obj_t *pObj)
Definition: abc.h:371
Abc_NtkForEachPi
#define Abc_NtkForEachPi(pNtk, pPi, i)
Definition: abc.h:513
Vec_PtrFree
static void Vec_PtrFree(Vec_Ptr_t *p)
Definition: vecPtr.h:223
void Abc_NtkRetimeBackwardInitialFinish ( Abc_Ntk_t *  pNtk,
Abc_Ntk_t *  pNtkNew,
Vec_Int_t *  vValuesOld,
int  fVerbose 
)

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

Synopsis [Transfer latch initial values to pCopy.]

Description []

SideEffects []

SeeAlso []

Definition at line 279 of file retInit.c.

280 {
281  Vec_Int_t * vValuesNew;
282  Abc_Obj_t * pObj;
283  int i;
284  // create PIs corresponding to the initial values
285  Abc_NtkForEachObj( pNtk, pObj, i )
286  if ( Abc_ObjIsLatch(pObj) )
287  Abc_ObjAddFanin( pObj->pCopy, Abc_NtkCreatePi(pNtkNew) );
288  // assign dummy node names
289  Abc_NtkAddDummyPiNames( pNtkNew );
290  Abc_NtkAddDummyPoNames( pNtkNew );
291  // check the network
292  if ( !Abc_NtkCheck( pNtkNew ) )
293  fprintf( stdout, "Abc_NtkRetimeBackwardInitialFinish(): Network check has failed.\n" );
294  // derive new initial values
295  vValuesNew = Abc_NtkRetimeInitialValues( pNtkNew, vValuesOld, fVerbose );
296  // insert new initial values
297  Abc_NtkRetimeInsertLatchValues( pNtk, vValuesNew );
298  if ( vValuesNew ) Vec_IntFree( vValuesNew );
299 }
Abc_NtkRetimeInsertLatchValues
void Abc_NtkRetimeInsertLatchValues(Abc_Ntk_t *pNtk, Vec_Int_t *vValues)
Definition: retInit.c:231
Vec_Int_t
typedefABC_NAMESPACE_IMPL_START struct Vec_Int_t_ Vec_Int_t
DECLARATIONS ///.
Definition: bblif.c:37
Abc_ObjIsLatch
static int Abc_ObjIsLatch(Abc_Obj_t *pObj)
Definition: abc.h:356
Abc_NtkCheck
ABC_DLL int Abc_NtkCheck(Abc_Ntk_t *pNtk)
FUNCTION DEFINITIONS ///.
Definition: abcCheck.c:61
Abc_ObjAddFanin
ABC_DLL void Abc_ObjAddFanin(Abc_Obj_t *pObj, Abc_Obj_t *pFanin)
Definition: abcFanio.c:84
check
static void check(int expr)
Definition: satSolver.c:46
Abc_Obj_t_
Definition: abc.h:128
Abc_NtkAddDummyPoNames
ABC_DLL void Abc_NtkAddDummyPoNames(Abc_Ntk_t *pNtk)
Definition: abcNames.c:398
Abc_NtkRetimeInitialValues
Vec_Int_t * Abc_NtkRetimeInitialValues(Abc_Ntk_t *pNtkCone, Vec_Int_t *vValues, int fVerbose)
FUNCTION DEFINITIONS ///.
Definition: retInit.c:47
if
if(last==0)
Definition: sparse_int.h:34
Abc_NtkCreatePi
static Abc_Obj_t * Abc_NtkCreatePi(Abc_Ntk_t *pNtk)
Definition: abc.h:303
Abc_NtkRetimeBackwardInitialFinish
void Abc_NtkRetimeBackwardInitialFinish(Abc_Ntk_t *pNtk, Abc_Ntk_t *pNtkNew, Vec_Int_t *vValuesOld, int fVerbose)
Definition: retInit.c:279
Vec_IntFree
static void Vec_IntFree(Vec_Int_t *p)
Definition: bblif.c:235
Abc_NtkForEachObj
#define Abc_NtkForEachObj(pNtk, pObj, i)
ITERATORS ///.
Definition: abc.h:446
Abc_NtkAddDummyPiNames
ABC_DLL void Abc_NtkAddDummyPiNames(Abc_Ntk_t *pNtk)
Definition: abcNames.c:378
Abc_Ntk_t* Abc_NtkRetimeBackwardInitialStart ( Abc_Ntk_t *  pNtk)

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

Synopsis [Transfer latch initial values to pCopy.]

Description []

SideEffects []

SeeAlso []

Definition at line 254 of file retInit.c.

255 {
256  Abc_Ntk_t * pNtkNew;
257  Abc_Obj_t * pObj;
258  int i;
259  // create the network used for the initial state computation
260  pNtkNew = Abc_NtkAlloc( ABC_NTK_LOGIC, ABC_FUNC_SOP, 1 );
261  // create POs corresponding to the initial values
262  Abc_NtkForEachObj( pNtk, pObj, i )
263  if ( Abc_ObjIsLatch(pObj) )
264  pObj->pCopy = Abc_NtkCreatePo(pNtkNew);
265  return pNtkNew;
266 }
Abc_ObjIsLatch
static int Abc_ObjIsLatch(Abc_Obj_t *pObj)
Definition: abc.h:356
Abc_Ntk_t_
Definition: abc.h:153
Abc_NtkAlloc
ABC_DLL Abc_Ntk_t * Abc_NtkAlloc(Abc_NtkType_t Type, Abc_NtkFunc_t Func, int fUseMemMan)
DECLARATIONS ///.
Definition: abcNtk.c:50
Abc_Obj_t_
Definition: abc.h:128
if
if(last==0)
Definition: sparse_int.h:34
Abc_NtkForEachObj
#define Abc_NtkForEachObj(pNtk, pObj, i)
ITERATORS ///.
Definition: abc.h:446
Abc_NtkCreatePo
static Abc_Obj_t * Abc_NtkCreatePo(Abc_Ntk_t *pNtk)
Definition: abc.h:304
Vec_Int_t* Abc_NtkRetimeCollectLatchValues ( Abc_Ntk_t *  pNtk)

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

Synopsis [Transfer latch initial values to pCopy.]

Description []

SideEffects []

SeeAlso []

Definition at line 208 of file retInit.c.

209 {
210  Vec_Int_t * vValues;
211  Abc_Obj_t * pObj;
212  int i;
213  vValues = Vec_IntAlloc( Abc_NtkLatchNum(pNtk) );
214  Abc_NtkForEachObj( pNtk, pObj, i )
215  if ( Abc_ObjIsLatch(pObj) )
216  Vec_IntPush( vValues, Abc_LatchIsInit1(pObj) );
217  return vValues;
218 }
Vec_Int_t
typedefABC_NAMESPACE_IMPL_START struct Vec_Int_t_ Vec_Int_t
DECLARATIONS ///.
Definition: bblif.c:37
Abc_ObjIsLatch
static int Abc_ObjIsLatch(Abc_Obj_t *pObj)
Definition: abc.h:356
Abc_NtkLatchNum
static int Abc_NtkLatchNum(Abc_Ntk_t *pNtk)
Definition: abc.h:294
Abc_Obj_t_
Definition: abc.h:128
Vec_IntAlloc
static Vec_Int_t * Vec_IntAlloc(int nCap)
FUNCTION DEFINITIONS ///.
Definition: bblif.c:149
if
if(last==0)
Definition: sparse_int.h:34
Vec_IntPush
static void Vec_IntPush(Vec_Int_t *p, int Entry)
Definition: bblif.c:468
Abc_LatchIsInit1
static int Abc_LatchIsInit1(Abc_Obj_t *pLatch)
Definition: abc.h:423
Abc_NtkForEachObj
#define Abc_NtkForEachObj(pNtk, pObj, i)
ITERATORS ///.
Definition: abc.h:446
Vec_Int_t* Abc_NtkRetimeInitialValues ( Abc_Ntk_t *  pNtkCone,
Vec_Int_t *  vValues,
int  fVerbose 
)

FUNCTION DEFINITIONS ///.

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

Synopsis [Computes initial values of the new latches.]

Description []

SideEffects []

SeeAlso []

Definition at line 47 of file retInit.c.

48 {
49  Vec_Int_t * vSolution;
50  Abc_Ntk_t * pNtkMiter, * pNtkLogic;
51  int RetValue;
52  abctime clk;
53  if ( pNtkCone == NULL )
54  return Vec_IntDup( vValues );
55  // convert the target network to AIG
56  pNtkLogic = Abc_NtkDup( pNtkCone );
57  Abc_NtkToAig( pNtkLogic );
58  // get the miter
59  pNtkMiter = Abc_NtkCreateTarget( pNtkLogic, pNtkLogic->vCos, vValues );
60  if ( fVerbose )
61  printf( "The miter for initial state computation has %d AIG nodes. ", Abc_NtkNodeNum(pNtkMiter) );
62  // solve the miter
63  clk = Abc_Clock();
64  RetValue = Abc_NtkMiterSat( pNtkMiter, (ABC_INT64_T)500000, (ABC_INT64_T)50000000, 0, NULL, NULL );
65  if ( fVerbose )
66  { ABC_PRT( "SAT solving time", Abc_Clock() - clk ); }
67  // analyze the result
68  if ( RetValue == 1 )
69  printf( "Abc_NtkRetimeInitialValues(): The problem is unsatisfiable. DC latch values are used.\n" );
70  else if ( RetValue == -1 )
71  printf( "Abc_NtkRetimeInitialValues(): The SAT problem timed out. DC latch values are used.\n" );
72  else if ( !Abc_NtkRetimeVerifyModel( pNtkCone, vValues, pNtkMiter->pModel ) )
73  printf( "Abc_NtkRetimeInitialValues(): The computed counter-example is incorrect.\n" );
74  // set the values of the latches
75  vSolution = RetValue? NULL : Vec_IntAllocArray( pNtkMiter->pModel, Abc_NtkPiNum(pNtkLogic) );
76  pNtkMiter->pModel = NULL;
77  Abc_NtkDelete( pNtkMiter );
78  Abc_NtkDelete( pNtkLogic );
79  return vSolution;
80 }
Vec_IntDup
static Vec_Int_t * Vec_IntDup(Vec_Int_t *pVec)
Definition: vecInt.h:214
Vec_Int_t
typedefABC_NAMESPACE_IMPL_START struct Vec_Int_t_ Vec_Int_t
DECLARATIONS ///.
Definition: bblif.c:37
Vec_IntAllocArray
static Vec_Int_t * Vec_IntAllocArray(int *pArray, int nSize)
Definition: bblif.c:214
Abc_Ntk_t_
Definition: abc.h:153
Abc_NtkDup
ABC_DLL Abc_Ntk_t * Abc_NtkDup(Abc_Ntk_t *pNtk)
Definition: abcNtk.c:419
Abc_Clock
static abctime Abc_Clock()
Definition: abc_global.h:279
Abc_NtkDelete
ABC_DLL void Abc_NtkDelete(Abc_Ntk_t *pNtk)
Definition: abcNtk.c:1233
Abc_Ntk_t_::pModel
int * pModel
Definition: abc.h:198
Abc_NtkNodeNum
static int Abc_NtkNodeNum(Abc_Ntk_t *pNtk)
Definition: abc.h:293
Abc_NtkCreateTarget
ABC_DLL Abc_Ntk_t * Abc_NtkCreateTarget(Abc_Ntk_t *pNtk, Vec_Ptr_t *vRoots, Vec_Int_t *vValues)
Definition: abcNtk.c:1094
Abc_Ntk_t_::vCos
Vec_Ptr_t * vCos
Definition: abc.h:166
Abc_NtkMiterSat
ABC_DLL int Abc_NtkMiterSat(Abc_Ntk_t *pNtk, ABC_INT64_T nConfLimit, ABC_INT64_T nInsLimit, int fVerbose, ABC_INT64_T *pNumConfs, ABC_INT64_T *pNumInspects)
FUNCTION DEFINITIONS ///.
Definition: abcSat.c:53
Abc_NtkRetimeVerifyModel
static ABC_NAMESPACE_IMPL_START int Abc_NtkRetimeVerifyModel(Abc_Ntk_t *pNtkCone, Vec_Int_t *vValues, int *pModel)
DECLARATIONS ///.
Definition: retInit.c:133
Abc_NtkPiNum
static int Abc_NtkPiNum(Abc_Ntk_t *pNtk)
Definition: abc.h:285
ABC_PRT
#define ABC_PRT(a, t)
Definition: abc_global.h:220
Abc_NtkToAig
ABC_DLL int Abc_NtkToAig(Abc_Ntk_t *pNtk)
Definition: abcFunc.c:1192
abctime
ABC_INT64_T abctime
Definition: abc_global.h:278
void Abc_NtkRetimeInsertLatchValues ( Abc_Ntk_t *  pNtk,
Vec_Int_t *  vValues 
)

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

Synopsis [Transfer latch initial values from pCopy.]

Description []

SideEffects []

SeeAlso []

Definition at line 231 of file retInit.c.

232 {
233  Abc_Obj_t * pObj;
234  int i, Counter = 0;
235  Abc_NtkForEachObj( pNtk, pObj, i )
236  if ( Abc_ObjIsLatch(pObj) )
237  pObj->pCopy = (Abc_Obj_t *)(ABC_PTRUINT_T)Counter++;
238  Abc_NtkForEachObj( pNtk, pObj, i )
239  if ( Abc_ObjIsLatch(pObj) )
240  pObj->pData = (Abc_Obj_t *)(ABC_PTRUINT_T)(vValues? (Vec_IntEntry(vValues,(int)(ABC_PTRUINT_T)pObj->pCopy)? ABC_INIT_ONE : ABC_INIT_ZERO) : ABC_INIT_DC);
241 }
Abc_ObjIsLatch
static int Abc_ObjIsLatch(Abc_Obj_t *pObj)
Definition: abc.h:356
Abc_Obj_t_
Definition: abc.h:128
Vec_IntEntry
static int Vec_IntEntry(Vec_Int_t *p, int i)
Definition: bblif.c:268
if
if(last==0)
Definition: sparse_int.h:34
Counter
static int Counter
Definition: extraBddMisc.c:1877
Abc_NtkForEachObj
#define Abc_NtkForEachObj(pNtk, pObj, i)
ITERATORS ///.
Definition: abc.h:446
void Abc_NtkRetimeTranferFromCopy ( Abc_Ntk_t *  pNtk)

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

Synopsis [Transfer latch initial values from pCopy.]

Description []

SideEffects []

SeeAlso []

Definition at line 188 of file retInit.c.

189 {
190  Abc_Obj_t * pObj;
191  int i;
192  Abc_NtkForEachObj( pNtk, pObj, i )
193  if ( Abc_ObjIsLatch(pObj) )
194  pObj->pData = (void *)(ABC_PTRUINT_T)(pObj->pCopy? ABC_INIT_ONE : ABC_INIT_ZERO);
195 }
Abc_ObjIsLatch
static int Abc_ObjIsLatch(Abc_Obj_t *pObj)
Definition: abc.h:356
Abc_Obj_t_
Definition: abc.h:128
if
if(last==0)
Definition: sparse_int.h:34
Abc_NtkForEachObj
#define Abc_NtkForEachObj(pNtk, pObj, i)
ITERATORS ///.
Definition: abc.h:446
void Abc_NtkRetimeTranferToCopy ( Abc_Ntk_t *  pNtk)

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

Synopsis [Transfer latch initial values to pCopy.]

Description []

SideEffects []

SeeAlso []

Definition at line 168 of file retInit.c.

169 {
170  Abc_Obj_t * pObj;
171  int i;
172  Abc_NtkForEachObj( pNtk, pObj, i )
173  if ( Abc_ObjIsLatch(pObj) )
174  pObj->pCopy = (Abc_Obj_t *)(ABC_PTRUINT_T)Abc_LatchIsInit1(pObj);
175 }
Abc_ObjIsLatch
static int Abc_ObjIsLatch(Abc_Obj_t *pObj)
Definition: abc.h:356
Abc_Obj_t_
Definition: abc.h:128
if
if(last==0)
Definition: sparse_int.h:34
Abc_LatchIsInit1
static int Abc_LatchIsInit1(Abc_Obj_t *pLatch)
Definition: abc.h:423
Abc_NtkForEachObj
#define Abc_NtkForEachObj(pNtk, pObj, i)
ITERATORS ///.
Definition: abc.h:446
int Abc_NtkRetimeVerifyModel ( Abc_Ntk_t *  pNtkCone,
Vec_Int_t *  vValues,
int *  pModel 
)
static

DECLARATIONS ///.

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

FileName [retInit.c]

SystemName [ABC: Logic synthesis and verification system.]

PackageName [Retiming package.]

Synopsis [Initial state computation for backward retiming.]

Author [Alan Mishchenko]

Affiliation [UC Berkeley]

Date [Ver. 1.0. Started - Oct 31, 2006.]

Revision [

Id:
retInit.c,v 1.00 2006/10/31 00:00:00 alanmi Exp

]

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

Synopsis [Verifies the counter-example.]

Description []

SideEffects []

SeeAlso []

Definition at line 133 of file retInit.c.

134 {
135  Vec_Ptr_t * vNodes;
136  Abc_Obj_t * pObj;
137  int i, Counter = 0;
138  assert( Abc_NtkIsSopLogic(pNtkCone) );
139  // set the PIs
140  Abc_NtkForEachPi( pNtkCone, pObj, i )
141  pObj->pCopy = (Abc_Obj_t *)(ABC_PTRUINT_T)pModel[i];
142  // simulate the internal nodes
143  vNodes = Abc_NtkDfs( pNtkCone, 0 );
144  Vec_PtrForEachEntry( Abc_Obj_t *, vNodes, pObj, i )
145  pObj->pCopy = (Abc_Obj_t *)(ABC_PTRUINT_T)Abc_ObjSopSimulate( pObj );
146  Vec_PtrFree( vNodes );
147  // compare the outputs
148  Abc_NtkForEachPo( pNtkCone, pObj, i )
149  pObj->pCopy = Abc_ObjFanin0(pObj)->pCopy;
150  Abc_NtkForEachPo( pNtkCone, pObj, i )
151  Counter += (Vec_IntEntry(vValues, i) != (int)(ABC_PTRUINT_T)pObj->pCopy);
152  if ( Counter > 0 )
153  printf( "%d outputs (out of %d) have a value mismatch.\n", Counter, Abc_NtkPoNum(pNtkCone) );
154  return 1;
155 }
Vec_Ptr_t
typedefABC_NAMESPACE_HEADER_START struct Vec_Ptr_t_ Vec_Ptr_t
INCLUDES ///.
Definition: vecPtr.h:42
Abc_NtkIsSopLogic
static int Abc_NtkIsSopLogic(Abc_Ntk_t *pNtk)
Definition: abc.h:264
Abc_NtkDfs
ABC_DLL Vec_Ptr_t * Abc_NtkDfs(Abc_Ntk_t *pNtk, int fCollectAll)
Definition: abcDfs.c:81
Abc_ObjFanin0
static Abc_Obj_t * Abc_ObjFanin0(Abc_Obj_t *pObj)
Definition: abc.h:373
Abc_Obj_t_
Definition: abc.h:128
Abc_ObjSopSimulate
int Abc_ObjSopSimulate(Abc_Obj_t *pObj)
Definition: retInit.c:93
Vec_IntEntry
static int Vec_IntEntry(Vec_Int_t *p, int i)
Definition: bblif.c:268
if
if(last==0)
Definition: sparse_int.h:34
Counter
static int Counter
Definition: extraBddMisc.c:1877
Abc_NtkPoNum
static int Abc_NtkPoNum(Abc_Ntk_t *pNtk)
Definition: abc.h:286
value
int value
Definition: misc/espresso/main.h:90
assert
#define assert(ex)
Definition: util_old.h:213
Abc_NtkForEachPo
#define Abc_NtkForEachPo(pNtk, pPo, i)
Definition: abc.h:517
Vec_PtrForEachEntry
#define Vec_PtrForEachEntry(Type, vVec, pEntry, i)
MACRO DEFINITIONS ///.
Definition: vecPtr.h:55
Abc_NtkForEachPi
#define Abc_NtkForEachPi(pNtk, pPi, i)
Definition: abc.h:513
Vec_PtrFree
static void Vec_PtrFree(Vec_Ptr_t *p)
Definition: vecPtr.h:223
int Abc_ObjSopSimulate ( Abc_Obj_t *  pObj)

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

Synopsis [Computes the results of simulating one node.]

Description [Assumes that fanins have pCopy set to the input values.]

SideEffects []

SeeAlso []

Definition at line 93 of file retInit.c.

94 {
95  char * pCube, * pSop = (char *)pObj->pData;
96  int nVars, Value, v, ResOr, ResAnd, ResVar;
97  assert( pSop && !Abc_SopIsExorType(pSop) );
98  // simulate the SOP of the node
99  ResOr = 0;
100  nVars = Abc_SopGetVarNum(pSop);
101  Abc_SopForEachCube( pSop, nVars, pCube )
102  {
103  ResAnd = 1;
104  Abc_CubeForEachVar( pCube, Value, v )
105  {
106  if ( Value == '0' )
107  ResVar = 1 ^ ((int)(ABC_PTRUINT_T)Abc_ObjFanin(pObj, v)->pCopy);
108  else if ( Value == '1' )
109  ResVar = (int)(ABC_PTRUINT_T)Abc_ObjFanin(pObj, v)->pCopy;
110  else
111  continue;
112  ResAnd &= ResVar;
113  }
114  ResOr |= ResAnd;
115  }
116  // complement the result if necessary
117  if ( !Abc_SopGetPhase(pSop) )
118  ResOr ^= 1;
119  return ResOr;
120 }
Abc_SopForEachCube
#define Abc_SopForEachCube(pSop, nFanins, pCube)
Definition: abc.h:531
Abc_CubeForEachVar
#define Abc_CubeForEachVar(pCube, Value, i)
Definition: abc.h:529
Abc_SopIsExorType
ABC_DLL int Abc_SopIsExorType(char *pSop)
Definition: abcSop.c:802
Abc_Obj_t_::pCopy
Abc_Obj_t * pCopy
Definition: abc.h:148
Abc_SopGetVarNum
ABC_DLL int Abc_SopGetVarNum(char *pSop)
Definition: abcSop.c:536
assert
#define assert(ex)
Definition: util_old.h:213
Abc_Obj_t_::pData
void * pData
Definition: abc.h:145
Abc_ObjFanin
static Abc_Obj_t * Abc_ObjFanin(Abc_Obj_t *pObj, int i)
Definition: abc.h:372
Abc_SopGetPhase
ABC_DLL int Abc_SopGetPhase(char *pSop)
Definition: abcSop.c:556