1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
|
/**CFile****************************************************************
FileName [giaCone.c]
SystemName [ABC: Logic synthesis and verification system.]
PackageName [Scalable AIG package.]
Synopsis []
Author [Alan Mishchenko]
Affiliation [UC Berkeley]
Date [Ver. 1.0. Started - June 20, 2005.]
Revision [$Id: giaCone.c,v 1.00 2005/06/20 00:00:00 alanmi Exp $]
***********************************************************************/
#include "gia.h"
ABC_NAMESPACE_IMPL_START
////////////////////////////////////////////////////////////////////////
/// DECLARATIONS ///
////////////////////////////////////////////////////////////////////////
typedef struct Opa_Man_t_ Opa_Man_t;
struct Opa_Man_t_
{
Gia_Man_t * pGia;
Vec_Int_t * vFront;
Vec_Int_t * pvParts;
int * pId2Part;
int nParts;
};
////////////////////////////////////////////////////////////////////////
/// FUNCTION DEFINITIONS ///
////////////////////////////////////////////////////////////////////////
/**Function*************************************************************
Synopsis []
Description []
SideEffects []
SeeAlso []
***********************************************************************/
static inline Opa_Man_t * Opa_ManStart( Gia_Man_t * pGia)
{
Opa_Man_t * p;
Gia_Obj_t * pObj;
int i;
p = ABC_CALLOC( Opa_Man_t, 1 );
p->pGia = pGia;
p->pvParts = ABC_CALLOC( Vec_Int_t, Gia_ManPoNum(pGia) );
p->pId2Part = ABC_FALLOC( int, Gia_ManObjNum(pGia) );
p->vFront = Vec_IntAlloc( 100 );
Gia_ManForEachPo( pGia, pObj, i )
{
Vec_IntPush( p->pvParts + i, Gia_ObjId(pGia, pObj) );
p->pId2Part[Gia_ObjId(pGia, pObj)] = i;
Vec_IntPush( p->vFront, Gia_ObjId(pGia, pObj) );
}
p->nParts = Gia_ManPoNum(pGia);
return p;
}
static inline void Opa_ManStop( Opa_Man_t * p )
{
int i;
Vec_IntFree( p->vFront );
for ( i = 0; i < Gia_ManPoNum(p->pGia); i++ )
ABC_FREE( p->pvParts[i].pArray );
ABC_FREE( p->pvParts );
ABC_FREE( p->pId2Part );
ABC_FREE( p );
}
static inline void Opa_ManPrint( Opa_Man_t * p )
{
int i, k;
printf( "Groups:\n" );
for ( i = 0; i < Gia_ManPoNum(p->pGia); i++ )
{
if ( p->pvParts[i].nSize == 0 )
continue;
printf( "%3d : ", i );
for ( k = 0; k < p->pvParts[i].nSize; k++ )
printf( "%d ", p->pvParts[i].pArray[k] );
printf( "\n" );
}
}
static inline void Opa_ManPrint2( Opa_Man_t * p )
{
Gia_Obj_t * pObj;
int i, k, Count;
printf( "Groups %d: ", p->nParts );
for ( i = 0; i < Gia_ManPoNum(p->pGia); i++ )
{
if ( p->pvParts[i].nSize == 0 )
continue;
// count POs in this group
Count = 0;
Gia_ManForEachObjVec( p->pvParts + i, p->pGia, pObj, k )
Count += Gia_ObjIsPo(p->pGia, pObj);
printf( "%d ", Count );
}
printf( "\n" );
}
/**Function*************************************************************
Synopsis []
Description []
SideEffects []
SeeAlso []
***********************************************************************/
void Opa_ManMoveOne( Opa_Man_t * p, Gia_Obj_t * pObj, Gia_Obj_t * pFanin )
{
int iObj = Gia_ObjId(p->pGia, pObj);
int iFanin = Gia_ObjId(p->pGia, pFanin);
if ( iFanin == 0 )
return;
assert( p->pId2Part[ iObj ] >= 0 );
if ( p->pId2Part[ iFanin ] == -1 )
{
p->pId2Part[ iFanin ] = p->pId2Part[ iObj ];
Vec_IntPush( p->pvParts + p->pId2Part[ iObj ], iFanin );
assert( Gia_ObjIsCi(pFanin) || Gia_ObjIsAnd(pFanin) );
if ( Gia_ObjIsAnd(pFanin) )
Vec_IntPush( p->vFront, iFanin );
else if ( Gia_ObjIsRo(p->pGia, pFanin) )
{
pFanin = Gia_ObjRoToRi(p->pGia, pFanin);
iFanin = Gia_ObjId(p->pGia, pFanin);
assert( p->pId2Part[ iFanin ] == -1 );
p->pId2Part[ iFanin ] = p->pId2Part[ iObj ];
Vec_IntPush( p->pvParts + p->pId2Part[ iObj ], iFanin );
Vec_IntPush( p->vFront, iFanin );
}
}
else if ( p->pId2Part[ iObj ] != p->pId2Part[ iFanin ] )
{
Vec_Int_t * vPartObj = p->pvParts + p->pId2Part[ iObj ];
Vec_Int_t * vPartFan = p->pvParts + p->pId2Part[ iFanin ];
int iTemp, i;
// printf( "Moving %d to %d (%d -> %d)\n", iObj, iFanin, Vec_IntSize(vPartObj), Vec_IntSize(vPartFan) );
// add group of iObj to group of iFanin
assert( Vec_IntSize(vPartObj) > 0 );
Vec_IntForEachEntry( vPartObj, iTemp, i )
{
Vec_IntPush( vPartFan, iTemp );
p->pId2Part[ iTemp ] = p->pId2Part[ iFanin ];
}
Vec_IntShrink( vPartObj, 0 );
p->nParts--;
}
}
void Opa_ManPerform( Gia_Man_t * pGia )
{
Opa_Man_t * p;
Gia_Obj_t * pObj;
int i;
p = Opa_ManStart( pGia );
//Opa_ManPrint2( p );
Gia_ManForEachObjVec( p->vFront, pGia, pObj, i )
{
// printf( "*** Object %d ", Gia_ObjId(pGia, pObj) );
if ( Gia_ObjIsAnd(pObj) )
{
Opa_ManMoveOne( p, pObj, Gia_ObjFanin0(pObj) );
Opa_ManMoveOne( p, pObj, Gia_ObjFanin1(pObj) );
}
else if ( Gia_ObjIsCo(pObj) )
Opa_ManMoveOne( p, pObj, Gia_ObjFanin0(pObj) );
else assert( 0 );
if ( i % 10 == 0 )
printf( "%d ", p->nParts );
//Opa_ManPrint2( p );
if ( p->nParts == 1 )
break;
}
printf( "\n" );
Opa_ManStop( p );
}
/**Function*************************************************************
Synopsis []
Description []
SideEffects []
SeeAlso []
***********************************************************************/
int Gia_ManConeMark_rec( Gia_Man_t * p, Gia_Obj_t * pObj, Vec_Int_t * vRoots, int nLimit )
{
if ( Gia_ObjIsTravIdCurrent(p, pObj) )
return 0;
Gia_ObjSetTravIdCurrent(p, pObj);
if ( Gia_ObjIsAnd(pObj) )
{
if ( Gia_ManConeMark_rec( p, Gia_ObjFanin0(pObj), vRoots, nLimit ) )
return 1;
if ( Gia_ManConeMark_rec( p, Gia_ObjFanin1(pObj), vRoots, nLimit ) )
return 1;
}
else if ( Gia_ObjIsCo(pObj) )
{
if ( Gia_ManConeMark_rec( p, Gia_ObjFanin0(pObj), vRoots, nLimit ) )
return 1;
}
else if ( Gia_ObjIsRo(p, pObj) )
Vec_IntPush( vRoots, Gia_ObjId(p, Gia_ObjRoToRi(p, pObj)) );
else if ( Gia_ObjIsPi(p, pObj) )
{}
else assert( 0 );
return (int)(Vec_IntSize(vRoots) > nLimit);
}
int Gia_ManConeMark( Gia_Man_t * p, int iOut, int Limit )
{
Vec_Int_t * vRoots;
Gia_Obj_t * pObj;
int i, RetValue;
// start the outputs
pObj = Gia_ManPo( p, iOut );
vRoots = Vec_IntAlloc( 100 );
Vec_IntPush( vRoots, Gia_ObjId(p, pObj) );
// mark internal nodes
Gia_ManIncrementTravId( p );
Gia_ObjSetTravIdCurrent( p, Gia_ManConst0(p) );
Gia_ManForEachObjVec( vRoots, p, pObj, i )
if ( Gia_ManConeMark_rec( p, pObj, vRoots, Limit ) )
break;
RetValue = Vec_IntSize( vRoots ) - 1;
Vec_IntFree( vRoots );
return RetValue;
}
/**Function*************************************************************
Synopsis []
Description []
SideEffects []
SeeAlso []
***********************************************************************/
Gia_Man_t * Gia_ManConeExtract( Gia_Man_t * p, int iOut, int nDelta, int nOutsMin, int nOutsMax )
{
/*
int i, Count = 0;
// mark nodes belonging to output 'iOut'
for ( i = 0; i < Gia_ManPoNum(p); i++ )
Count += (Gia_ManConeMark(p, i, 10000) < 10000);
// printf( "%d ", Gia_ManConeMark(p, i, 1000) );
printf( "%d out of %d\n", Count, Gia_ManPoNum(p) );
// add other outputs as long as they are nDelta away
*/
Opa_ManPerform( p );
return NULL;
}
////////////////////////////////////////////////////////////////////////
/// END OF FILE ///
////////////////////////////////////////////////////////////////////////
ABC_NAMESPACE_IMPL_END
|
