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
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
|
/**CFile****************************************************************
FileName [giaSplit.c]
SystemName [ABC: Logic synthesis and verification system.]
PackageName [Scalable AIG package.]
Synopsis [Structural AIG splitting.]
Author [Alan Mishchenko]
Affiliation [UC Berkeley]
Date [Ver. 1.0. Started - June 20, 2005.]
Revision [$Id: giaSplit.c,v 1.00 2005/06/20 00:00:00 alanmi Exp $]
***********************************************************************/
#include "gia.h"
#include "misc/extra/extra.h"
ABC_NAMESPACE_IMPL_START
////////////////////////////////////////////////////////////////////////
/// DECLARATIONS ///
////////////////////////////////////////////////////////////////////////
typedef struct Spl_Man_t_ Spl_Man_t;
struct Spl_Man_t_
{
// input data
Gia_Man_t * pGia; // user AIG with nodes marked
int iObj; // object ID
int Limit; // limit on AIG nodes
int Count; // count of AIG nodes
// intermediate
Vec_Bit_t * vMarksCIO; // CI/CO marks
Vec_Bit_t * vMarksIn; // input marks
Vec_Bit_t * vMarksNo; // node marks
Vec_Int_t * vNodes; // nodes used in the window
Vec_Int_t * vRoots; // nodes pointing to Nodes
Vec_Int_t * vLeaves; // nodes pointed by Nodes
// temporary
Vec_Int_t * vFanouts; // fanouts of the node
Vec_Int_t * vCands; // candidate nodes
Vec_Int_t * vInputs; // non-trivial inputs
};
////////////////////////////////////////////////////////////////////////
/// FUNCTION DEFINITIONS ///
////////////////////////////////////////////////////////////////////////
/**Function*************************************************************
Synopsis []
Description []
SideEffects []
SeeAlso []
***********************************************************************/
Spl_Man_t * Spl_ManAlloc( Gia_Man_t * pGia, int Limit )
{
int i, iObj;
Spl_Man_t * p = ABC_CALLOC( Spl_Man_t, 1 );
assert( Gia_ManHasMapping(pGia) );
p->pGia = pGia;
p->Limit = Limit;
// intermediate
p->vMarksCIO = Vec_BitStart( Gia_ManObjNum(pGia) );
p->vMarksIn = Vec_BitStart( Gia_ManObjNum(pGia) );
p->vMarksNo = Vec_BitStart( Gia_ManObjNum(pGia) );
p->vRoots = Vec_IntAlloc( 100 );
p->vNodes = Vec_IntAlloc( 100 );
p->vLeaves = Vec_IntAlloc( 100 );
// temporary
p->vFanouts = Vec_IntAlloc( 100 );
p->vCands = Vec_IntAlloc( 100 );
p->vInputs = Vec_IntAlloc( 100 );
// mark CIs/COs
Gia_ManForEachCiId( pGia, iObj, i )
Vec_BitWriteEntry( p->vMarksCIO, iObj, 1 );
Gia_ManForEachCoId( pGia, iObj, i )
Vec_BitWriteEntry( p->vMarksCIO, iObj, 1 );
// prepare AIG
Gia_ManStaticFanoutStart( pGia );
Gia_ManSetLutRefs( pGia );
Gia_ManCreateRefs( pGia );
return p;
}
void Spl_ManStop( Spl_Man_t * p )
{
Gia_ManStaticFanoutStop( p->pGia );
// intermediate
Vec_BitFree( p->vMarksCIO );
Vec_BitFree( p->vMarksIn );
Vec_BitFree( p->vMarksNo );
Vec_IntFree( p->vRoots );
Vec_IntFree( p->vNodes );
Vec_IntFree( p->vLeaves );
// temporary
Vec_IntFree( p->vFanouts );
Vec_IntFree( p->vCands );
Vec_IntFree( p->vInputs );
ABC_FREE( p );
}
/**Function*************************************************************
Synopsis [Takes Nodes and Marks. Returns Leaves and Roots.]
Description []
SideEffects []
SeeAlso []
***********************************************************************/
void Spl_ManWinFindLeavesRoots( Spl_Man_t * p )
{
int iObj, iFan, i, k;
// collect leaves
Vec_IntClear( p->vLeaves );
Vec_IntForEachEntry( p->vNodes, iObj, i )
{
assert( Vec_BitEntry(p->vMarksNo, iObj) );
Gia_LutForEachFanin( p->pGia, iObj, iFan, k )
if ( !Vec_BitEntry(p->vMarksNo, iFan) )
{
Vec_BitWriteEntry(p->vMarksNo, iFan, 1);
Vec_IntPush( p->vLeaves, iFan );
}
}
Vec_IntForEachEntry( p->vLeaves, iObj, i )
Vec_BitWriteEntry(p->vMarksNo, iObj, 0);
// collect roots
Vec_IntClear( p->vRoots );
Vec_IntForEachEntry( p->vNodes, iObj, i )
Gia_LutForEachFanin( p->pGia, iObj, iFan, k )
Gia_ObjLutRefDecId( p->pGia, iFan );
Vec_IntForEachEntry( p->vNodes, iObj, i )
if ( Gia_ObjLutRefNumId(p->pGia, iObj) )
Vec_IntPush( p->vRoots, iObj );
Vec_IntForEachEntry( p->vNodes, iObj, i )
Gia_LutForEachFanin( p->pGia, iObj, iFan, k )
Gia_ObjLutRefIncId( p->pGia, iFan );
}
/**Function*************************************************************
Synopsis [Computes LUTs that are fanouts of the node outside of the cone.]
Description []
SideEffects []
SeeAlso []
***********************************************************************/
void Spl_ManLutFanouts_rec( Gia_Man_t * p, int iObj, Vec_Int_t * vFanouts, Vec_Bit_t * vMarksNo, Vec_Bit_t * vMarksCIO )
{
int iFanout, i;
if ( Vec_BitEntry(vMarksNo, iObj) || Vec_BitEntry(vMarksCIO, iObj) )
return;
if ( Gia_ObjIsLut(p, iObj) )
{
Vec_BitWriteEntry( vMarksCIO, iObj, 1 );
Vec_IntPush( vFanouts, iObj );
return;
}
Gia_ObjForEachFanoutStaticId( p, iObj, iFanout, i )
Spl_ManLutFanouts_rec( p, iFanout, vFanouts, vMarksNo, vMarksCIO );
}
int Spl_ManLutFanouts( Gia_Man_t * p, int iObj, Vec_Int_t * vFanouts, Vec_Bit_t * vMarksNo, Vec_Bit_t * vMarksCIO )
{
int i, iFanout;
assert( Gia_ObjIsLut(p, iObj) );
Vec_IntClear( vFanouts );
Gia_ObjForEachFanoutStaticId( p, iObj, iFanout, i )
Spl_ManLutFanouts_rec( p, iFanout, vFanouts, vMarksNo, vMarksCIO );
// clean up
Vec_IntForEachEntry( vFanouts, iFanout, i )
Vec_BitWriteEntry( vMarksCIO, iFanout, 0 );
return Vec_IntSize(vFanouts);
}
/**Function*************************************************************
Synopsis [Compute MFFC size of one node.]
Description []
SideEffects []
SeeAlso []
***********************************************************************/
int Spl_ManLutMffcSize( Gia_Man_t * p, int iObj )
{
int Res, iFan, i;
assert( Gia_ObjIsLut(p, iObj) );
Gia_LutForEachFanin( p, iObj, iFan, i )
Gia_ObjRefIncId( p, iFan );
Res = Gia_NodeMffcSize( p, Gia_ManObj(p, iObj) );
Gia_LutForEachFanin( p, iObj, iFan, i )
Gia_ObjRefDecId( p, iFan );
return Res;
}
/**Function*************************************************************
Synopsis [Returns the number of fanins not beloning to the set.]
Description []
SideEffects []
SeeAlso []
***********************************************************************/
int Spl_ManCountMarkedFanins( Gia_Man_t * p, int iObj, Vec_Bit_t * vMarks )
{
int k, iFan, Count = 0;
Gia_LutForEachFanin( p, iObj, iFan, k )
if ( Vec_BitEntry(vMarks, iFan) )
Count++;
return Count;
}
/**Function*************************************************************
Synopsis []
Description []
SideEffects []
SeeAlso []
***********************************************************************/
int Spl_ManFindOne( Spl_Man_t * p )
{
int nFanouts, iObj, iFan, i, k;
int Res = 0, InCount, InCountMax = -1;
Vec_IntClear( p->vCands );
Vec_IntClear( p->vInputs );
// deref
Vec_IntForEachEntry( p->vNodes, iObj, i )
Gia_LutForEachFanin( p->pGia, iObj, iFan, k )
Gia_ObjLutRefDecId( p->pGia, iFan );
// consider LUT inputs - get one that has no refs
Vec_IntForEachEntry( p->vNodes, iObj, i )
Gia_LutForEachFanin( p->pGia, iObj, iFan, k )
if ( !Vec_BitEntry(p->vMarksNo, iFan) && !Vec_BitEntry(p->vMarksCIO, iFan) )
{
if ( !Gia_ObjLutRefNumId(p->pGia, iFan) )
{
Res = iFan;
goto finish;
}
Vec_IntPush( p->vCands, iFan );
Vec_IntPush( p->vInputs, iFan );
}
// all inputs have refs - collect external nodes
Vec_IntForEachEntry( p->vNodes, iObj, i )
{
if ( Gia_ObjLutRefNumId(p->pGia, iObj) == 0 )
continue;
assert( Gia_ObjLutRefNumId(p->pGia, iObj) > 0 );
if ( Gia_ObjLutRefNumId(p->pGia, iObj) >= 5 )
continue;
nFanouts = Spl_ManLutFanouts( p->pGia, iObj, p->vFanouts, p->vMarksNo, p->vMarksCIO );
if ( Gia_ObjLutRefNumId(p->pGia, iObj) == 1 && nFanouts == 1 )
{
Res = Vec_IntEntry(p->vFanouts, 0);
goto finish;
}
Vec_IntAppend( p->vCands, p->vFanouts );
}
// mark leaves
Vec_IntForEachEntry( p->vInputs, iObj, i )
Vec_BitWriteEntry( p->vMarksIn, iObj, 1 );
// find candidate with maximum input overlap
Vec_IntForEachEntry( p->vCands, iObj, i )
{
InCount = Spl_ManCountMarkedFanins( p->pGia, iObj, p->vMarksIn );
if ( InCountMax < InCount )
{
InCountMax = InCount;
Res = iObj;
}
}
// unmark leaves
Vec_IntForEachEntry( p->vInputs, iObj, i )
Vec_BitWriteEntry( p->vMarksIn, iObj, 0 );
// get the first candidate
if ( Res == 0 && Vec_IntSize(p->vCands) > 0 )
Res = Vec_IntEntry( p->vCands, 0 );
finish:
// deref
Vec_IntForEachEntry( p->vNodes, iObj, i )
Gia_LutForEachFanin( p->pGia, iObj, iFan, k )
Gia_ObjLutRefIncId( p->pGia, iFan );
return Res;
}
/**Function*************************************************************
Synopsis []
Description []
SideEffects []
SeeAlso []
***********************************************************************/
void Spl_ManComputeOne( Spl_Man_t * p, int iPivot )
{
int CountAdd, iObj, i;
assert( Gia_ObjIsLut(p->pGia, iPivot) );
// assume it was previously filled in
Vec_IntForEachEntry( p->vNodes, iObj, i )
Vec_BitWriteEntry( p->vMarksNo, iObj, 0 );
// double check that it is empty
//Gia_ManForEachLut( p->pGia, iObj )
// assert( !Vec_BitEntry(p->vMarksNo, iObj) );
// add root node
Vec_IntFill( p->vNodes, 1, iPivot );
Vec_BitWriteEntry( p->vMarksNo, iPivot, 1 );
//printf( "%d ", iPivot );
// add one node at a time
p->Count = Spl_ManLutMffcSize( p->pGia, iPivot );
while ( (iObj = Spl_ManFindOne(p)) )
{
assert( Gia_ObjIsLut(p->pGia, iObj) );
CountAdd = Spl_ManLutMffcSize( p->pGia, iObj );
if ( p->Count + CountAdd > p->Limit )
break;
p->Count += CountAdd;
Vec_IntPush( p->vNodes, iObj );
Vec_BitWriteEntry( p->vMarksNo, iObj, 1 );
//printf( "+%d ", iObj );
}
//printf( "\n" );
Vec_IntSort( p->vNodes, 0 );
}
void Spl_ManComputeOneTest( Gia_Man_t * pGia )
{
int iLut;
Spl_Man_t * p = Spl_ManAlloc( pGia, 64 );
Gia_ManForEachLut( pGia, iLut )
{
Spl_ManComputeOne( p, iLut );
Spl_ManWinFindLeavesRoots( p );
// Vec_IntPrint( p->vNodes );
printf( "Obj = %6d : Leaf = %2d. Node = %2d. Root = %2d. AND = %3d.\n",
iLut, Vec_IntSize(p->vLeaves), Vec_IntSize(p->vNodes), Vec_IntSize(p->vRoots), p->Count );
}
Spl_ManStop( p );
}
////////////////////////////////////////////////////////////////////////
/// END OF FILE ///
////////////////////////////////////////////////////////////////////////
ABC_NAMESPACE_IMPL_END
|
