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
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
|
/**CFile****************************************************************
FileName [wlnNtk.c]
SystemName [ABC: Logic synthesis and verification system.]
PackageName [Word-level network.]
Synopsis [Network construction procedures.]
Author [Alan Mishchenko]
Affiliation [UC Berkeley]
Date [Ver. 1.0. Started - September 23, 2018.]
Revision [$Id: wlnNtk.c,v 1.00 2018/09/23 00:00:00 alanmi Exp $]
***********************************************************************/
#include "wln.h"
ABC_NAMESPACE_IMPL_START
////////////////////////////////////////////////////////////////////////
/// DECLARATIONS ///
////////////////////////////////////////////////////////////////////////
////////////////////////////////////////////////////////////////////////
/// FUNCTION DEFINITIONS ///
////////////////////////////////////////////////////////////////////////
/**Function*************************************************************
Synopsis [Creating networks.]
Description []
SideEffects []
SeeAlso []
***********************************************************************/
Wln_Ntk_t * Wln_NtkAlloc( char * pName, int nObjsMax )
{
Wln_Ntk_t * p; int i;
p = ABC_CALLOC( Wln_Ntk_t, 1 );
p->pName = pName ? Extra_FileNameGeneric( pName ) : NULL;
Vec_IntGrow( &p->vCis, 111 );
Vec_IntGrow( &p->vCos, 111 );
Vec_IntGrow( &p->vFfs, 111 );
Vec_IntGrow( &p->vTypes, nObjsMax+1 );
Vec_StrGrow( &p->vSigns, nObjsMax+1 );
Vec_IntGrow( &p->vRanges, nObjsMax+1 );
Vec_IntPush( &p->vTypes, -1 );
Vec_StrPush( &p->vSigns, -1 );
Vec_IntPush( &p->vRanges, -1 );
p->vFanins = ABC_CALLOC( Wln_Vec_t, nObjsMax+1 );
p->pRanges = Hash_IntManStart( 1000 );
for ( i = 0; i < 65; i++ )
Hash_Int2ManInsert( p->pRanges, i, i, 0 );
for ( i = 1; i < 64; i++ )
Hash_Int2ManInsert( p->pRanges, i, 0, 0 );
assert( Hash_IntManEntryNum(p->pRanges) == 128 );
return p;
}
void Wln_NtkFree( Wln_Ntk_t * p )
{
int i;
for ( i = 0; i < Wln_NtkObjNum(p); i++ )
if ( Wln_ObjFaninNum(p, i) > 2 )
ABC_FREE( p->vFanins[i].pArray[0] );
ABC_FREE( p->vFanins );
if ( p->pRanges ) Hash_IntManStop( p->pRanges );
if ( p->pManName ) Abc_NamStop( p->pManName );
ABC_FREE( p->vCis.pArray );
ABC_FREE( p->vCos.pArray );
ABC_FREE( p->vFfs.pArray );
ABC_FREE( p->vTypes.pArray );
ABC_FREE( p->vSigns.pArray );
ABC_FREE( p->vRanges.pArray );
ABC_FREE( p->vNameIds.pArray );
ABC_FREE( p->vInstIds.pArray );
ABC_FREE( p->vTravIds.pArray );
ABC_FREE( p->vCopies.pArray );
ABC_FREE( p->vBits.pArray );
ABC_FREE( p->vLevels.pArray );
ABC_FREE( p->vRefs.pArray );
ABC_FREE( p->vFanout.pArray );
ABC_FREE( p->vFaninAttrs.pArray );
ABC_FREE( p->vFaninLists.pArray );
ABC_FREE( p->pName );
ABC_FREE( p->pSpec );
ABC_FREE( p );
}
int Wln_NtkMemUsage( Wln_Ntk_t * p )
{
int Mem = sizeof(Wln_Ntk_t);
Mem += 4 * p->vCis.nCap;
Mem += 4 * p->vCos.nCap;
Mem += 4 * p->vFfs.nCap;
Mem += 1 * p->vTypes.nCap;
Mem += 4 * p->vRanges.nCap;
Mem += 4 * p->vNameIds.nCap;
Mem += 4 * p->vInstIds.nCap;
Mem += 4 * p->vTravIds.nCap;
Mem += 4 * p->vCopies.nCap;
Mem += 4 * p->vBits.nCap;
Mem += 4 * p->vLevels.nCap;
Mem += 4 * p->vRefs.nCap;
Mem += 4 * p->vFanout.nCap;
Mem += 4 * p->vFaninAttrs.nCap;
Mem += 4 * p->vFaninLists.nCap;
Mem += 20 * Hash_IntManEntryNum(p->pRanges);
Mem += Abc_NamMemUsed(p->pManName);
return Mem;
}
void Wln_NtkPrint( Wln_Ntk_t * p )
{
int iObj;
printf( "Printing %d objects of network \"%s\":\n", Wln_NtkObjNum(p), p->pName );
Wln_NtkForEachObj( p, iObj )
Wln_ObjPrint( p, iObj );
printf( "\n" );
}
/**Function*************************************************************
Synopsis [Detects combinational loops.]
Description [This procedure is based on the idea suggested by Donald Chai.
As we traverse the network and visit the nodes, we need to distinquish
three types of nodes: (1) those that are visited for the first time,
(2) those that have been visited in this traversal but are currently not
on the traversal path, (3) those that have been visited and are currently
on the travesal path. When the node of type (3) is encountered, it means
that there is a combinational loop. To mark the three types of nodes,
two new values of the traversal IDs are used.]
SideEffects []
SeeAlso []
***********************************************************************/
int Wln_NtkIsAcyclic_rec( Wln_Ntk_t * p, int iObj )
{
int i, iFanin;
//printf( "Visiting node %d\n", iObj );
if ( 43309 == iObj )
{
int s = 0;
}
// skip the node if it is already visited
if ( Wln_ObjIsTravIdPrevious(p, iObj) )
return 1;
// check if the node is part of the combinational loop
if ( Wln_ObjIsTravIdCurrent(p, iObj) )
{
fprintf( stdout, "Network contains combinational loop!\n" );
fprintf( stdout, "Node %16s is encountered twice on the following path:\n", Wln_ObjName(p, iObj) );
fprintf( stdout, "Node %16s (ID %6d) of type %5s (type ID %2d) ->\n",
Wln_ObjName(p, iObj), iObj, Abc_OperName(Wln_ObjType(p, iObj)), Wln_ObjType(p, iObj) );
return 0;
}
// mark this node as a node on the current path
Wln_ObjSetTravIdCurrent( p, iObj );
// quit if it is a CI or constant node
if ( Wln_ObjIsCi(p, iObj) || Wln_ObjIsFf(p, iObj) || Wln_ObjFaninNum(p, iObj) == 0 )
{
// mark this node as a visited node
Wln_ObjSetTravIdPrevious( p, iObj );
return 1;
}
// traverse the fanin's cone searching for the loop
Wln_ObjForEachFanin( p, iObj, iFanin, i )
{
if ( !Wln_NtkIsAcyclic_rec(p, iFanin) )
{
// return as soon as the loop is detected
fprintf( stdout, "Node %16s (ID %6d) of type %5s (type ID %2d) ->\n",
Wln_ObjName(p, iObj), iObj, Abc_OperName(Wln_ObjType(p, iObj)), Wln_ObjType(p, iObj) );
return 0;
}
}
// mark this node as a visited node
Wln_ObjSetTravIdPrevious( p, iObj );
return 1;
}
int Wln_NtkIsAcyclic( Wln_Ntk_t * p )
{
int fAcyclic, i, iObj, nUnvisited = 0 ;
// set the traversal ID for this DFS ordering
Wln_NtkIncrementTravId( p );
Wln_NtkIncrementTravId( p );
// iObj->TravId == pNet->nTravIds means "iObj is on the path"
// iObj->TravId == pNet->nTravIds - 1 means "iObj is visited but is not on the path"
// iObj->TravId < pNet->nTravIds - 1 means "iObj is not visited"
// traverse the network to detect cycles
fAcyclic = 1;
Wln_NtkForEachCo( p, iObj, i )
{
// traverse the output logic cone
if ( (fAcyclic = Wln_NtkIsAcyclic_rec(p, iObj)) )
continue;
// stop as soon as the first loop is detected
fprintf( stdout, "Primary output %16s (ID %6d)\n", Wln_ObjName(p, iObj), iObj );
break;
}
Wln_NtkForEachFf( p, iObj, i )
{
// traverse the output logic cone
if ( (fAcyclic = Wln_NtkIsAcyclic_rec(p, iObj)) )
continue;
// stop as soon as the first loop is detected
fprintf( stdout, "Flip-flop %16s (ID %6d)\n", Wln_ObjName(p, iObj), iObj );
break;
}
Wln_NtkForEachObj( p, iObj )
nUnvisited += !Wln_ObjIsTravIdPrevious(p, iObj) && !Wln_ObjIsCi(p, iObj);
if ( nUnvisited )
{
int nSinks = 0;
Wln_NtkCreateRefs(p);
printf( "The network has %d objects and %d (%6.2f %%) of them are not connected to the outputs.\n",
Wln_NtkObjNum(p), nUnvisited, 100.0*nUnvisited/Wln_NtkObjNum(p) );
Wln_NtkForEachObj( p, iObj )
if ( !Wln_ObjRefs(p, iObj) && !Wln_ObjIsCi(p, iObj) && !Wln_ObjIsFf(p, iObj) )
nSinks++;
if ( nSinks )
{
int nPrinted = 0;
printf( "These unconnected objects feed into %d sink objects without fanout:\n", nSinks );
Wln_NtkForEachObj( p, iObj )
if ( !Wln_ObjRefs(p, iObj) && !Wln_ObjIsCi(p, iObj) && !Wln_ObjIsFf(p, iObj) )
{
fprintf( stdout, "Node %16s (ID %6d) of type %5s (type ID %2d)\n",
Wln_ObjName(p, iObj), iObj, Abc_OperName(Wln_ObjType(p, iObj)), Wln_ObjType(p, iObj) );
if ( ++nPrinted == 5 )
break;
}
if ( nPrinted < nSinks )
printf( "...\n" );
}
Wln_NtkForEachObj( p, iObj )
if ( /*!Wln_ObjRefs(p, iObj) &&*/ !Wln_ObjIsTravIdPrevious(p, iObj) && !Wln_ObjIsCi(p, iObj) )
{
// traverse the output logic cone
if ( (fAcyclic = Wln_NtkIsAcyclic_rec(p, iObj)) )
continue;
// stop as soon as the first loop is detected
fprintf( stdout, "Unconnected object %s\n", Wln_ObjName(p, iObj) );
break;
}
}
return fAcyclic;
}
/**Function*************************************************************
Synopsis [Duplicating network.]
Description []
SideEffects []
SeeAlso []
***********************************************************************/
void Wln_NtkTransferNames( Wln_Ntk_t * pNew, Wln_Ntk_t * p )
{
assert( pNew->pManName == NULL && p->pManName != NULL );
pNew->pManName = p->pManName;
p->pManName = NULL;
assert( !Wln_NtkHasCopy(pNew) && Wln_NtkHasCopy(p) );
if ( Wln_NtkHasNameId(p) )
{
int i;
assert( !Wln_NtkHasNameId(pNew) && Wln_NtkHasNameId(p) );
Wln_NtkCleanNameId( pNew );
Wln_NtkForEachObj( p, i )
if ( Wln_ObjCopy(p, i) && i < Vec_IntSize(&p->vNameIds) && Wln_ObjNameId(p, i) )
Wln_ObjSetNameId( pNew, Wln_ObjCopy(p, i), Wln_ObjNameId(p, i) );
Vec_IntErase( &p->vNameIds );
}
if ( Wln_NtkHasInstId(p) )
{
int i;
assert( !Wln_NtkHasInstId(pNew) && Wln_NtkHasInstId(p) );
Wln_NtkCleanInstId( pNew );
Wln_NtkForEachObj( p, i )
if ( Wln_ObjCopy(p, i) && i < Vec_IntSize(&p->vInstIds) && Wln_ObjInstId(p, i) )
Wln_ObjSetInstId( pNew, Wln_ObjCopy(p, i), Wln_ObjInstId(p, i) );
Vec_IntErase( &p->vInstIds );
}
}
int Wln_ObjDup( Wln_Ntk_t * pNew, Wln_Ntk_t * p, int iObj )
{
int i, iFanin, iObjNew = Wln_ObjClone( pNew, p, iObj );
Wln_ObjForEachFanin( p, iObj, iFanin, i )
Wln_ObjAddFanin( pNew, iObjNew, Wln_ObjCopy(p, iFanin) );
if ( Wln_ObjIsConst(p, iObj) )
Wln_ObjSetConst( pNew, iObjNew, Wln_ObjFanin0(p, iObj) );
else if ( Wln_ObjIsSlice(p, iObj) || Wln_ObjIsRotate(p, iObj) || Wln_ObjIsTable(p, iObj) )
Wln_ObjSetFanin( pNew, iObjNew, 1, Wln_ObjFanin1(p, iObj) );
Wln_ObjSetCopy( p, iObj, iObjNew );
return iObjNew;
}
int Wln_NtkDupDfs_rec( Wln_Ntk_t * pNew, Wln_Ntk_t * p, int iObj )
{
int i, iFanin;
if ( iObj == 0 )
return 0;
if ( Wln_ObjCopy(p, iObj) )
return Wln_ObjCopy(p, iObj);
//printf( "Visiting node %16s (ID %6d) of type %5s (type ID %2d)\n", Wln_ObjName(p, iObj), iObj, Abc_OperName(Wln_ObjType(p, iObj)), Wln_ObjType(p, iObj) );
assert( !Wln_ObjIsFf(p, iObj) );
Wln_ObjForEachFanin( p, iObj, iFanin, i )
Wln_NtkDupDfs_rec( pNew, p, iFanin );
return Wln_ObjDup( pNew, p, iObj );
}
Wln_Ntk_t * Wln_NtkDupDfs( Wln_Ntk_t * p )
{
int i, k, iObj, iFanin;
Wln_Ntk_t * pNew = Wln_NtkAlloc( p->pName, Wln_NtkObjNum(p) );
pNew->fSmtLib = p->fSmtLib;
if ( p->pSpec ) pNew->pSpec = Abc_UtilStrsav( p->pSpec );
Wln_NtkCleanCopy( p );
Wln_NtkForEachCi( p, iObj, i )
Wln_ObjDup( pNew, p, iObj );
Wln_NtkForEachFf( p, iObj, i )
Wln_ObjSetCopy( p, iObj, Wln_ObjClone(pNew, p, iObj) );
Wln_NtkForEachCo( p, iObj, i )
Wln_NtkDupDfs_rec( pNew, p, iObj );
Wln_NtkForEachFf( p, iObj, i )
Wln_ObjForEachFanin( p, iObj, iFanin, k )
Wln_ObjAddFanin( pNew, Wln_ObjCopy(p, iObj), Wln_NtkDupDfs_rec(pNew, p, iFanin) );
if ( Wln_NtkHasNameId(p) )
Wln_NtkTransferNames( pNew, p );
return pNew;
}
/**Function*************************************************************
Synopsis [Create fanin/fanout map.]
Description []
SideEffects []
SeeAlso []
***********************************************************************/
void Wln_NtkCreateRefs( Wln_Ntk_t * p )
{
int k, iObj, iFanin;
Wln_NtkCleanRefs( p );
Wln_NtkForEachObj( p, iObj )
Wln_ObjForEachFanin( p, iObj, iFanin, k )
Wln_ObjRefsInc( p, iFanin );
}
int Wln_NtkFaninNum( Wln_Ntk_t * p )
{
int iObj, nEdges = 0;
Wln_NtkForEachObj( p, iObj )
nEdges += Wln_ObjFaninNum(p, iObj);
return nEdges;
}
void Wln_NtkStartFaninMap( Wln_Ntk_t * p, Vec_Int_t * vFaninMap, int nMulti )
{
int iObj, iOffset = Wln_NtkObjNum(p);
Vec_IntFill( vFaninMap, iOffset + nMulti * Wln_NtkFaninNum(p), 0 );
Wln_NtkForEachObj( p, iObj )
{
Vec_IntWriteEntry( vFaninMap, iObj, iOffset );
iOffset += nMulti * Wln_ObjFaninNum(p, iObj);
}
assert( iOffset == Vec_IntSize(vFaninMap) );
}
void Wln_NtkStartFanoutMap( Wln_Ntk_t * p, Vec_Int_t * vFanoutMap, Vec_Int_t * vFanoutNums, int nMulti )
{
int iObj, iOffset = Wln_NtkObjNum(p);
Vec_IntFill( vFanoutMap, iOffset + nMulti * Vec_IntSum(vFanoutNums), 0 );
Wln_NtkForEachObj( p, iObj )
{
Vec_IntWriteEntry( vFanoutMap, iObj, iOffset );
iOffset += nMulti * Wln_ObjRefs(p, iObj);
}
assert( iOffset == Vec_IntSize(vFanoutMap) );
}
/**Function*************************************************************
Synopsis [Static fanout.]
Description []
SideEffects []
SeeAlso []
***********************************************************************/
void Wln_NtkStaticFanoutStart( Wln_Ntk_t * p )
{
int k, iObj, iFanin;
Vec_Int_t * vRefsCopy = Vec_IntAlloc(0);
Wln_NtkCreateRefs( p );
Wln_NtkStartFanoutMap( p, &p->vFanout, &p->vRefs, 1 );
ABC_SWAP( Vec_Int_t, *vRefsCopy, p->vRefs );
// add fanouts
Wln_NtkCleanRefs( p );
Wln_NtkForEachObj( p, iObj )
Wln_ObjForEachFanin( p, iObj, iFanin, k )
Wln_ObjSetFanout( p, iFanin, Wln_ObjRefsInc(p, iFanin), iObj );
// double-check the current number of fanouts added
Wln_NtkForEachObj( p, iObj )
assert( Wln_ObjRefs(p, iObj) == Vec_IntEntry(vRefsCopy, iObj) );
Vec_IntFree( vRefsCopy );
}
void Wln_NtkStaticFanoutStop( Wln_Ntk_t * p )
{
Vec_IntErase( &p->vRefs );
Vec_IntErase( &p->vFanout );
}
void Wln_NtkStaticFanoutTest( Wln_Ntk_t * p )
{
int k, iObj, iFanout;
printf( "Printing fanouts of %d objects of network \"%s\":\n", Wln_NtkObjNum(p), p->pName );
Wln_NtkStaticFanoutStart( p );
Wln_NtkForEachObj( p, iObj )
{
Wln_ObjPrint( p, iObj );
printf( " Fanouts : " );
Wln_ObjForEachFanoutStatic( p, iObj, iFanout, k )
printf( "%5d ", iFanout );
printf( "\n" );
}
Wln_NtkStaticFanoutStop( p );
printf( "\n" );
}
////////////////////////////////////////////////////////////////////////
/// END OF FILE ///
////////////////////////////////////////////////////////////////////////
ABC_NAMESPACE_IMPL_END
|
