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
|
/**CFile****************************************************************
FileName [abcIfif.c]
SystemName [ABC: Logic synthesis and verification system.]
PackageName [Network and node package.]
Synopsis [Experiment with technology mapping.]
Author [Alan Mishchenko]
Affiliation [UC Berkeley]
Date [Ver. 1.0. Started - June 20, 2005.]
Revision [$Id: abcIfif.c,v 1.00 2005/06/20 00:00:00 alanmi Exp $]
***********************************************************************/
#include "base/abc/abc.h"
#include "map/if/if.h"
ABC_NAMESPACE_IMPL_START
////////////////////////////////////////////////////////////////////////
/// DECLARATIONS ///
////////////////////////////////////////////////////////////////////////
#define IFIF_MAX_LEAVES 6
typedef struct Abc_IffObj_t_ Abc_IffObj_t;
struct Abc_IffObj_t_
{
float Delay[IFIF_MAX_LEAVES+1]; // separate delay
// int nLeaves;
// int pLeaves[IFIF_MAX_LEAVES];
};
typedef struct Abc_IffMan_t_ Abc_IffMan_t;
struct Abc_IffMan_t_
{
Abc_Ntk_t * pNtk;
Ifif_Par_t * pPars;
// internal data
int nObjs;
Abc_IffObj_t * pObjs;
};
static inline Abc_IffObj_t * Abc_IffObj( Abc_IffMan_t * p, int i ) { assert( i >= 0 && i < p->nObjs ); return p->pObjs + i; }
static inline float Abc_IffDelay( Abc_IffMan_t * p, Abc_Obj_t * pObj, int fDelay1 ) { return Abc_IffObj(p, Abc_ObjId(pObj))->Delay[fDelay1]; }
////////////////////////////////////////////////////////////////////////
/// FUNCTION DEFINITIONS ///
////////////////////////////////////////////////////////////////////////
/**Function*************************************************************
Synopsis []
Description []
SideEffects []
SeeAlso []
***********************************************************************/
Abc_IffMan_t * Abc_NtkIfifStart( Abc_Ntk_t * pNtk, Ifif_Par_t * pPars )
{
Abc_IffMan_t * p;
p = ABC_CALLOC( Abc_IffMan_t, 1 );
p->pNtk = pNtk;
p->pPars = pPars;
// internal data
p->nObjs = Abc_NtkObjNumMax( pNtk );
p->pObjs = ABC_CALLOC( Abc_IffObj_t, p->nObjs );
return p;
}
void Abc_NtkIfifStop( Abc_IffMan_t * p )
{
// internal data
ABC_FREE( p->pObjs );
ABC_FREE( p );
}
/**Function*************************************************************
Synopsis [Collects fanins into ppNodes in decreasing order.]
Description []
SideEffects []
SeeAlso []
***********************************************************************/
void Abc_ObjSortByDelay( Abc_IffMan_t * p, Abc_Obj_t * pObj, int fDelay1, Abc_Obj_t ** ppNodes )
{
Abc_Obj_t * pFanin;
int i, a, k = 0;
Abc_ObjForEachFanin( pObj, pFanin, i )
{
ppNodes[k++] = pFanin;
if ( Abc_ObjIsCi(pFanin) )
continue;
for ( a = k-1; a > 0; a-- )
if ( Abc_IffDelay(p, ppNodes[a-1], fDelay1) + p->pPars->pLutDelays[a-1] < Abc_IffDelay(p, ppNodes[a], fDelay1) + p->pPars->pLutDelays[a] )
ABC_SWAP( Abc_Obj_t *, ppNodes[a-1], ppNodes[a] );
}
/*
for ( a = 1; a < k; a++ )
{
float D1 = Abc_IffDelay(p, ppNodes[a-1], fDelay1);
float D2 = Abc_IffDelay(p, ppNodes[a], fDelay1);
if ( Abc_ObjIsCi(ppNodes[a-1]) || Abc_ObjIsCi(ppNodes[a]) )
continue;
assert( Abc_IffDelay(p, ppNodes[a-1], fDelay1) + p->pPars->pLutDelays[a-1] >= Abc_IffDelay(p, ppNodes[a], fDelay1) + p->pPars->pLutDelays[a] - 0.01 );
}
*/
}
/**Function*************************************************************
Synopsis [This is the delay which object has all by itself.]
Description [This delay is stored in Delay0.]
SideEffects []
SeeAlso []
***********************************************************************/
float Abc_ObjDelay0( Abc_IffMan_t * p, Abc_Obj_t * pObj )
{
int i;
float Delay0 = 0;
Abc_Obj_t * ppNodes[6];
Abc_ObjSortByDelay( p, pObj, 1, ppNodes );
for ( i = 0; i < Abc_ObjFaninNum(pObj); i++ )
Delay0 = Abc_MaxFloat( Delay0, Abc_IffDelay(p, ppNodes[i], 1) + p->pPars->pLutDelays[i] );
return Delay0;
}
/**Function*************************************************************
Synopsis [This is the delay object has in the structure.]
Description [This delay is stored in Delay1.]
SideEffects []
SeeAlso []
***********************************************************************/
float Abc_ObjDelay1( Abc_IffMan_t * p, Abc_Obj_t * pObj )
{
int i, fVeryVerbose = 0;
// Abc_IffObj_t * pIfif = Abc_IffObj( p, Abc_ObjId(pObj) );
Abc_Obj_t * ppNodes[6];
float Delay1, DelayNew;
if ( Abc_ObjFaninNum(pObj) == 0 )
return 0;
// sort fanins by delay1+LutDelay
Abc_ObjSortByDelay( p, pObj, 1, ppNodes );
// print verbose results
if ( fVeryVerbose )
{
printf( "Object %d Level %d\n", Abc_ObjId(pObj), Abc_ObjLevel(pObj) );
for ( i = 0; i < Abc_ObjFaninNum(pObj); i++ )
{
printf( "Fanin %d : ", i );
printf( "D0 %3.2f ", Abc_IffDelay(p, ppNodes[i], 0) );
printf( "D0* %3.2f ", Abc_IffDelay(p, ppNodes[i], 0) + p->pPars->pLutDelays[i] - p->pPars->DelayWire );
printf( "D1 %3.2f", Abc_IffDelay(p, ppNodes[i], 1) + p->pPars->pLutDelays[i] );
printf( "\n" );
}
printf( "\n" );
}
/*
// for the first nDegree delays, sort them by the minimum Delay1+LutDelay and Delay0-Wire+LutDelay
Delay1 = 0;
pIfif->nLeaves = 0;
for ( i = 0; i < Abc_ObjFaninNum(pObj); i++ )
{
if ( Abc_ObjIsNode(ppNodes[i]) && pIfif->nLeaves < p->pPars->nDegree )
{
DelayNew = Abc_MinFloat( Abc_IffDelay(p, ppNodes[i], 1) + p->pPars->pLutDelays[i],
Abc_IffDelay(p, ppNodes[i], 0) + p->pPars->pLutDelays[i] - p->pPars->DelayWire );
pIfif->pLeaves[pIfif->nLeaves++] = Abc_ObjId(ppNodes[i]);
}
else
DelayNew = Abc_IffDelay(p, ppNodes[i], 1) + p->pPars->pLutDelays[i];
Delay1 = Abc_MaxFloat( Delay1, DelayNew );
}
*/
// for the first nDegree delays, sort them by the minimum Delay1+LutDelay and Delay0-Wire+LutDelay
Delay1 = 0;
for ( i = 0; i < Abc_ObjFaninNum(pObj); i++ )
{
if ( i < p->pPars->nDegree )
DelayNew = Abc_MinFloat( Abc_IffDelay(p, ppNodes[i], 1) + p->pPars->pLutDelays[i],
Abc_IffDelay(p, ppNodes[i], 0) + p->pPars->pLutDelays[i] - p->pPars->DelayWire );
else
DelayNew = Abc_IffDelay(p, ppNodes[i], 1) + p->pPars->pLutDelays[i];
Delay1 = Abc_MaxFloat( Delay1, DelayNew );
}
assert( Delay1 > 0 );
return Delay1;
}
/**Function*************************************************************
Synopsis [This is the delay which object has all by itself.]
Description [This delay is stored in Delay0.]
SideEffects []
SeeAlso []
***********************************************************************/
float Abc_ObjDelayDegree( Abc_IffMan_t * p, Abc_Obj_t * pObj, int d )
{
int i;
float Delay0 = 0, DelayNew;
Abc_Obj_t * ppNodes[6];
assert( d >= 0 && d <= p->pPars->nDegree );
Abc_ObjSortByDelay( p, pObj, p->pPars->nDegree, ppNodes );
for ( i = 0; i < Abc_ObjFaninNum(pObj); i++ )
{
DelayNew = Abc_IffDelay(p, ppNodes[i], p->pPars->nDegree) + p->pPars->pLutDelays[i];
if ( i == 0 && d > 0 )
DelayNew = Abc_MinFloat(DelayNew, Abc_IffDelay(p, ppNodes[i], d-1) + p->pPars->pLutDelays[i] - p->pPars->DelayWire );
Delay0 = Abc_MaxFloat( Delay0, DelayNew );
}
return Delay0;
}
/**Function*************************************************************
Synopsis []
Description []
SideEffects []
SeeAlso []
***********************************************************************/
void Abc_NtkPerformIfif( Abc_Ntk_t * pNtk, Ifif_Par_t * pPars )
{
Abc_IffMan_t * p;
Abc_IffObj_t * pIffObj;
Vec_Ptr_t * vNodes;
Abc_Obj_t * pObj;
float Delay, Delay10, DegreeFinal;
int i, d, Count10;
assert( pPars->pLutLib->LutMax >= 0 && pPars->pLutLib->LutMax <= IFIF_MAX_LEAVES );
assert( pPars->nLutSize >= 0 && pPars->nLutSize <= IFIF_MAX_LEAVES );
assert( pPars->nDegree >= 0 && pPars->nDegree <= IFIF_MAX_LEAVES );
// convert to AIGs
Abc_NtkToAig( pNtk );
Abc_NtkLevel( pNtk );
// print parameters
if ( pPars->fVerbose )
{
printf( "Running mapper into LUT structures with the following parameters:\n" );
printf( "Pin+Wire: {" );
for ( i = 0; i < pPars->pLutLib->LutMax; i++ )
printf( " %3.2f", pPars->pLutDelays[i] );
printf( " } " );
printf( "Wire %3.2f Degree %d Type: %s\n",
pPars->DelayWire, pPars->nDegree, pPars->fCascade? "Cascade" : "Cluster" );
}
// start manager
p = Abc_NtkIfifStart( pNtk, pPars );
// printf( "Running experiment with LUT delay %d and degree %d (LUT size is %d).\n", DelayWire, nDegree, nLutSize );
// compute the delay
vNodes = Abc_NtkDfs( pNtk, 0 );
Vec_PtrForEachEntry( Abc_Obj_t *, vNodes, pObj, i )
{
assert( Abc_ObjIsNode(pObj) );
pIffObj = Abc_IffObj( p, Abc_ObjId(pObj) );
if ( pPars->fCascade )
{
for ( d = 0; d <= pPars->nDegree; d++ )
pIffObj->Delay[d] = Abc_ObjDelayDegree( p, pObj, d );
}
else
{
pIffObj->Delay[0] = Abc_ObjDelay0( p, pObj );
pIffObj->Delay[1] = Abc_ObjDelay1( p, pObj );
}
}
// get final degree number
if ( pPars->fCascade )
DegreeFinal = pPars->nDegree;
else
DegreeFinal = 1;
if ( p->pPars->fVeryVerbose )
Vec_PtrForEachEntry( Abc_Obj_t *, vNodes, pObj, i )
{
printf( "Node %3d : Lev =%3d ", Abc_ObjId(pObj), Abc_ObjLevel(pObj) );
for ( d = 0; d <= DegreeFinal; d++ )
printf( "Del%d =%4.2f ", d, Abc_IffDelay(p, pObj, d) );
printf( "\n" );
}
Vec_PtrFree( vNodes );
// consider delay at the outputs
Delay = 0;
Abc_NtkForEachCo( pNtk, pObj, i )
Delay = Abc_MaxFloat( Delay, Abc_IffDelay(p, Abc_ObjFanin0(pObj), DegreeFinal) );
Delay10 = 0.9 * Delay;
// consider delay at the outputs
Count10 = 0;
Abc_NtkForEachCo( pNtk, pObj, i )
if ( Abc_IffDelay(p, Abc_ObjFanin0(pObj), DegreeFinal) >= Delay10 )
Count10++;
printf( "Critical delay %5.2f. Critical outputs %5.2f %%\n", Delay, 100.0 * Count10 / Abc_NtkCoNum(pNtk) );
// printf( "%.2f %.2f\n", Delay, 100.0 * Count10 / Abc_NtkCoNum(pNtk) );
// derive a new network
// stop manager
Abc_NtkIfifStop( p );
}
////////////////////////////////////////////////////////////////////////
/// END OF FILE ///
////////////////////////////////////////////////////////////////////////
ABC_NAMESPACE_IMPL_END
|
