ABC: A System for Sequential Synthesis and Verification
 
Loading...
Searching...
No Matches
pdrClass.c
Go to the documentation of this file.
1
20
21#include "pdrInt.h"
22
24
25
29
33
46{
47 Aig_Man_t * pFrames;
48 Aig_Obj_t * pObj;
49 int i, iReg;
50 assert( Vec_IntSize(vMap) == Aig_ManRegNum(pAig) );
51 // start the fraig package
52 pFrames = Aig_ManStart( Aig_ManObjNumMax(pAig) );
53 pFrames->pName = Abc_UtilStrsav( pAig->pName );
54 pFrames->pSpec = Abc_UtilStrsav( pAig->pSpec );
55 // create CI mapping
56 Aig_ManCleanData( pAig );
57 Aig_ManConst1(pAig)->pData = Aig_ManConst1(pFrames);
58 Aig_ManForEachCi( pAig, pObj, i )
59 pObj->pData = Aig_ObjCreateCi(pFrames);
60 Saig_ManForEachLo( pAig, pObj, i )
61 {
62 iReg = Vec_IntEntry(vMap, i);
63 if ( iReg == -1 )
64 pObj->pData = Aig_ManConst0(pFrames);
65 else
66 pObj->pData = Saig_ManLo(pAig, iReg)->pData;
67 }
68 // add internal nodes of this frame
69 Aig_ManForEachNode( pAig, pObj, i )
70 pObj->pData = Aig_And( pFrames, Aig_ObjChild0Copy(pObj), Aig_ObjChild1Copy(pObj) );
71 // add output nodes
72 Aig_ManForEachCo( pAig, pObj, i )
73 pObj->pData = Aig_ObjCreateCo( pFrames, Aig_ObjChild0Copy(pObj) );
74 // finish off
75 Aig_ManCleanup( pFrames );
76 Aig_ManSetRegNum( pFrames, Aig_ManRegNum(pAig) );
77 return pFrames;
78}
79
92{
93 Aig_Obj_t * pObj;
94 Vec_Int_t * vMap;
95 int * pLit2Id, Lit, i;
96 pLit2Id = ABC_ALLOC( int, Aig_ManObjNumMax(p) * 2 );
97 for ( i = 0; i < Aig_ManObjNumMax(p) * 2; i++ )
98 pLit2Id[i] = -1;
99 vMap = Vec_IntAlloc( Aig_ManRegNum(p) );
100 Saig_ManForEachLi( p, pObj, i )
101 {
102 if ( Aig_ObjChild0(pObj) == Aig_ManConst0(p) )
103 {
104 Vec_IntPush( vMap, -1 );
105 continue;
106 }
107 Lit = 2 * Aig_ObjFaninId0(pObj) + Aig_ObjFaninC0(pObj);
108 if ( pLit2Id[Lit] < 0 ) // the first time
109 pLit2Id[Lit] = i;
110 Vec_IntPush( vMap, pLit2Id[Lit] );
111 }
112 ABC_FREE( pLit2Id );
113 return vMap;
114}
115
128{
129 int i, Entry, Counter = 0;
130 Vec_IntForEachEntry( vMap, Entry, i )
131 if ( Entry != i )
132 Counter++;
133 return Counter;
134}
135
148{
149 Vec_Int_t * vMarks;
150 int f, i, iClass, Entry, Counter = 0;
151 Abc_Print( 1, " Consts: " );
152 Vec_IntForEachEntry( vMap, Entry, i )
153 if ( Entry == -1 )
154 Abc_Print( 1, "%d ", i );
155 Abc_Print( 1, "\n" );
156 vMarks = Vec_IntAlloc( 100 );
157 Vec_IntForEachEntry( vMap, iClass, f )
158 {
159 if ( iClass == -1 )
160 continue;
161 if ( iClass == f )
162 continue;
163 // check previous classes
164 if ( Vec_IntFind( vMarks, iClass ) >= 0 )
165 continue;
166 Vec_IntPush( vMarks, iClass );
167 // print class
168 Abc_Print( 1, " Class %d : ", iClass );
169 Vec_IntForEachEntry( vMap, Entry, i )
170 if ( Entry == iClass )
171 Abc_Print( 1, "%d ", i );
172 Abc_Print( 1, "\n" );
173 }
174 Vec_IntFree( vMarks );
175}
176
189{
190 Vec_Int_t * vMap;
191 Aig_Man_t * pTemp;
192 int f, nFrames = 100;
193 assert( Saig_ManRegNum(pAig) > 0 );
194 // start the map
195 vMap = Vec_IntAlloc( 0 );
196 Vec_IntFill( vMap, Aig_ManRegNum(pAig), -1 );
197 // iterate and print changes
198 for ( f = 0; f < nFrames; f++ )
199 {
200 // implement variable map
201 pTemp = Pdr_ManRehashWithMap( pAig, vMap );
202 // report the result
203 Abc_Print( 1, "F =%4d : Total = %6d. Nodes = %6d. RedRegs = %6d. Prop = %s\n",
204 f+1, Aig_ManNodeNum(pAig), Aig_ManNodeNum(pTemp), Pdr_ManCountMap(vMap),
205 Aig_ObjChild0(Aig_ManCo(pTemp,0)) == Aig_ManConst0(pTemp) ? "proof" : "unknown" );
206 // recreate the map
207 Pdr_ManPrintMap( vMap );
208 Vec_IntFree( vMap );
209 vMap = Pdr_ManCreateMap( pTemp );
210 Aig_ManStop( pTemp );
211 if ( Pdr_ManCountMap(vMap) == 0 )
212 break;
213 }
214 Vec_IntFree( vMap );
215}
216
220
221
223
#define ABC_ALLOC(type, num)
Definition abc_global.h:264
#define ABC_FREE(obj)
Definition abc_global.h:267
#define ABC_NAMESPACE_IMPL_START
#define ABC_NAMESPACE_IMPL_END
void Aig_ManSetRegNum(Aig_Man_t *p, int nRegs)
Definition aigMan.c:438
void Aig_ManStop(Aig_Man_t *p)
Definition aigMan.c:187
#define Aig_ManForEachCi(p, pObj, i)
ITERATORS ///.
Definition aig.h:393
Aig_Obj_t * Aig_And(Aig_Man_t *p, Aig_Obj_t *p0, Aig_Obj_t *p1)
Definition aigOper.c:104
Aig_Obj_t * Aig_ObjCreateCo(Aig_Man_t *p, Aig_Obj_t *pDriver)
Definition aigObj.c:66
struct Aig_Obj_t_ Aig_Obj_t
Definition aig.h:51
Aig_Man_t * Aig_ManStart(int nNodesMax)
DECLARATIONS ///.
Definition aigMan.c:47
#define Aig_ManForEachNode(p, pObj, i)
Definition aig.h:413
typedefABC_NAMESPACE_HEADER_START struct Aig_Man_t_ Aig_Man_t
INCLUDES ///.
Definition aig.h:50
int Aig_ManCleanup(Aig_Man_t *p)
Definition aigMan.c:265
#define Aig_ManForEachCo(p, pObj, i)
Definition aig.h:398
Aig_Obj_t * Aig_ObjCreateCi(Aig_Man_t *p)
DECLARATIONS ///.
Definition aigObj.c:45
void Aig_ManCleanData(Aig_Man_t *p)
Definition aigUtil.c:205
typedefABC_NAMESPACE_IMPL_START struct Vec_Int_t_ Vec_Int_t
DECLARATIONS ///.
Definition bblif.c:37
Cube * p
Definition exorList.c:222
void Pdr_ManEquivClasses(Aig_Man_t *pAig)
Definition pdrClass.c:188
void Pdr_ManPrintMap(Vec_Int_t *vMap)
Definition pdrClass.c:147
ABC_NAMESPACE_IMPL_START Aig_Man_t * Pdr_ManRehashWithMap(Aig_Man_t *pAig, Vec_Int_t *vMap)
DECLARATIONS ///.
Definition pdrClass.c:45
int Pdr_ManCountMap(Vec_Int_t *vMap)
Definition pdrClass.c:127
Vec_Int_t * Pdr_ManCreateMap(Aig_Man_t *p)
Definition pdrClass.c:91
#define Saig_ManForEachLi(p, pObj, i)
Definition saig.h:98
#define Saig_ManForEachLo(p, pObj, i)
Definition saig.h:96
void * pData
Definition aig.h:87
#define assert(ex)
Definition util_old.h:213
#define Vec_IntForEachEntry(vVec, Entry, i)
MACRO DEFINITIONS ///.
Definition vecInt.h:54