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
|
/**CFile****************************************************************
FileName [abcAttach.c]
SystemName [ABC: Logic synthesis and verification system.]
PackageName [Network and node package.]
Synopsis [Attaches the library gates to the current network.]
Author [Alan Mishchenko]
Affiliation [UC Berkeley]
Date [Ver. 1.0. Started - June 20, 2005.]
Revision [$Id: abcAttach.c,v 1.00 2005/06/20 00:00:00 alanmi Exp $]
***********************************************************************/
#include "base/abc/abc.h"
#include "base/main/main.h"
#include "map/mio/mio.h"
ABC_NAMESPACE_IMPL_START
////////////////////////////////////////////////////////////////////////
/// DECLARATIONS ///
////////////////////////////////////////////////////////////////////////
#define ATTACH_FULL (~((unsigned)0))
#define ATTACH_MASK(n) ((~((unsigned)0)) >> (32-(n)))
static void Abc_AttachSetupTruthTables( unsigned uTruths[][2] );
static void Abc_AttachComputeTruth( char * pSop, unsigned uTruthsIn[][2], unsigned * uTruthNode );
static Mio_Gate_t * Abc_AttachFind( Mio_Gate_t ** ppGates, unsigned ** puTruthGates, int nGates, unsigned * uTruthNode, int * Perm );
static int Abc_AttachCompare( unsigned ** puTruthGates, int nGates, unsigned * uTruthNode );
static int Abc_NodeAttach( Abc_Obj_t * pNode, Mio_Gate_t ** ppGates, unsigned ** puTruthGates, int nGates, unsigned uTruths[][2] );
static void Abc_TruthPermute( char * pPerm, int nVars, unsigned * uTruthNode, unsigned * uTruthPerm );
static char ** s_pPerms = NULL;
static int s_nPerms;
////////////////////////////////////////////////////////////////////////
/// FUNCTION DEFINITIONS ///
////////////////////////////////////////////////////////////////////////
/**Function*************************************************************
Synopsis [Attaches gates from the current library to the internal nodes.]
Description []
SideEffects []
SeeAlso []
***********************************************************************/
int Abc_NtkAttach( Abc_Ntk_t * pNtk )
{
Mio_Library_t * pGenlib;
unsigned ** puTruthGates;
unsigned uTruths[6][2];
Abc_Obj_t * pNode;
Mio_Gate_t ** ppGates;
int nGates, nFanins, i;
assert( Abc_NtkIsSopLogic(pNtk) );
// check that the library is available
pGenlib = (Mio_Library_t *)Abc_FrameReadLibGen();
if ( pGenlib == NULL )
{
printf( "The current library is not available.\n" );
return 0;
}
// start the truth tables
Abc_AttachSetupTruthTables( uTruths );
// collect all the gates
ppGates = Mio_CollectRoots( pGenlib, 6, (float)1.0e+20, 1, &nGates, 0 );
// derive the gate truth tables
puTruthGates = ABC_ALLOC( unsigned *, nGates );
puTruthGates[0] = ABC_ALLOC( unsigned, 2 * nGates );
for ( i = 1; i < nGates; i++ )
puTruthGates[i] = puTruthGates[i-1] + 2;
for ( i = 0; i < nGates; i++ )
Mio_DeriveTruthTable( ppGates[i], uTruths, Mio_GateReadPinNum(ppGates[i]), 6, puTruthGates[i] );
// assign the gates to pNode->pCopy
Abc_NtkCleanCopy( pNtk );
Abc_NtkForEachNode( pNtk, pNode, i )
{
nFanins = Abc_ObjFaninNum(pNode);
if ( nFanins == 0 )
{
if ( Abc_SopIsConst1((char *)pNode->pData) )
pNode->pCopy = (Abc_Obj_t *)Mio_LibraryReadConst1(pGenlib);
else
pNode->pCopy = (Abc_Obj_t *)Mio_LibraryReadConst0(pGenlib);
}
else if ( nFanins == 1 )
{
if ( Abc_SopIsBuf((char *)pNode->pData) )
pNode->pCopy = (Abc_Obj_t *)Mio_LibraryReadBuf(pGenlib);
else
pNode->pCopy = (Abc_Obj_t *)Mio_LibraryReadInv(pGenlib);
}
else if ( nFanins > 6 )
{
printf( "Cannot attach gate with more than 6 inputs to node %s.\n", Abc_ObjName(pNode) );
ABC_FREE( puTruthGates[0] );
ABC_FREE( puTruthGates );
ABC_FREE( ppGates );
return 0;
}
else if ( !Abc_NodeAttach( pNode, ppGates, puTruthGates, nGates, uTruths ) )
{
printf( "Could not attach the library gate to node %s.\n", Abc_ObjName(pNode) );
ABC_FREE( puTruthGates[0] );
ABC_FREE( puTruthGates );
ABC_FREE( ppGates );
return 0;
}
}
ABC_FREE( puTruthGates[0] );
ABC_FREE( puTruthGates );
ABC_FREE( ppGates );
ABC_FREE( s_pPerms );
// perform the final transformation
Abc_NtkForEachNode( pNtk, pNode, i )
{
if ( pNode->pCopy == NULL )
{
printf( "Some elementary gates (constant, buffer, or inverter) are missing in the library.\n" );
return 0;
}
}
// replace SOP representation by the gate representation
Abc_NtkForEachNode( pNtk, pNode, i )
pNode->pData = pNode->pCopy, pNode->pCopy = NULL;
pNtk->ntkFunc = ABC_FUNC_MAP;
Extra_MmFlexStop( (Extra_MmFlex_t *)pNtk->pManFunc );
pNtk->pManFunc = pGenlib;
printf( "Library gates are successfully attached to the nodes.\n" );
// make sure that everything is okay
if ( !Abc_NtkCheck( pNtk ) )
{
printf( "Abc_NtkAttach: The network check has failed.\n" );
return 0;
}
return 1;
}
/**Function*************************************************************
Synopsis []
Description []
SideEffects []
SeeAlso []
***********************************************************************/
int Abc_NodeAttach( Abc_Obj_t * pNode, Mio_Gate_t ** ppGates, unsigned ** puTruthGates, int nGates, unsigned uTruths[][2] )
{
int Perm[10];
int pTempInts[10];
unsigned uTruthNode[2];
Abc_Obj_t * pFanin;
Mio_Gate_t * pGate;
int nFanins, i;
// compute the node's truth table
Abc_AttachComputeTruth( (char *)pNode->pData, uTruths, uTruthNode );
// find the matching gate and permutation
pGate = Abc_AttachFind( ppGates, puTruthGates, nGates, uTruthNode, Perm );
if ( pGate == NULL )
return 0;
// permute the fanins
nFanins = Abc_ObjFaninNum(pNode);
Abc_ObjForEachFanin( pNode, pFanin, i )
pTempInts[i] = pFanin->Id;
for ( i = 0; i < nFanins; i++ )
pNode->vFanins.pArray[Perm[i]] = pTempInts[i];
// set the gate
pNode->pCopy = (Abc_Obj_t *)pGate;
return 1;
}
/**Function*************************************************************
Synopsis [Sets up the truth tables.]
Description []
SideEffects []
SeeAlso []
***********************************************************************/
void Abc_AttachSetupTruthTables( unsigned uTruths[][2] )
{
int m, v;
for ( v = 0; v < 5; v++ )
uTruths[v][0] = 0;
// set up the truth tables
for ( m = 0; m < 32; m++ )
for ( v = 0; v < 5; v++ )
if ( m & (1 << v) )
uTruths[v][0] |= (1 << m);
// make adjustments for the case of 6 variables
for ( v = 0; v < 5; v++ )
uTruths[v][1] = uTruths[v][0];
uTruths[5][0] = 0;
uTruths[5][1] = ATTACH_FULL;
}
/**Function*************************************************************
Synopsis [Compute the truth table of the node's cover.]
Description []
SideEffects []
SeeAlso []
***********************************************************************/
void Abc_AttachComputeTruth( char * pSop, unsigned uTruthsIn[][2], unsigned * uTruthRes )
{
// Mvc_Cube_t * pCube;
unsigned uSignCube[2];
int Value;
// int nInputs = pCover->nBits/2;
int nInputs = 6;
int nFanins = Abc_SopGetVarNum(pSop);
char * pCube;
int k;
// make sure that the number of input truth tables in equal to the number of gate inputs
assert( nInputs < 7 );
// clean the resulting truth table
uTruthRes[0] = 0;
uTruthRes[1] = 0;
if ( nInputs < 6 )
{
// consider the case when only one unsigned can be used
// Mvc_CoverForEachCube( pCover, pCube )
Abc_SopForEachCube( pSop, nFanins, pCube )
{
uSignCube[0] = ATTACH_FULL;
// Mvc_CubeForEachVarValue( pCover, pCube, Var, Value )
Abc_CubeForEachVar( pCube, Value, k )
{
if ( Value == '0' )
uSignCube[0] &= ~uTruthsIn[k][0];
else if ( Value == '1' )
uSignCube[0] &= uTruthsIn[k][0];
}
uTruthRes[0] |= uSignCube[0];
}
if ( Abc_SopGetPhase(pSop) == 0 )
uTruthRes[0] = ~uTruthRes[0];
if ( nInputs < 5 )
uTruthRes[0] &= ATTACH_MASK(1<<nInputs);
}
else
{
// consider the case when two unsigneds should be used
// Mvc_CoverForEachCube( pCover, pCube )
Abc_SopForEachCube( pSop, nFanins, pCube )
{
uSignCube[0] = ATTACH_FULL;
uSignCube[1] = ATTACH_FULL;
// Mvc_CubeForEachVarValue( pCover, pCube, Var, Value )
Abc_CubeForEachVar( pCube, Value, k )
{
if ( Value == '0' )
{
uSignCube[0] &= ~uTruthsIn[k][0];
uSignCube[1] &= ~uTruthsIn[k][1];
}
else if ( Value == '1' )
{
uSignCube[0] &= uTruthsIn[k][0];
uSignCube[1] &= uTruthsIn[k][1];
}
}
uTruthRes[0] |= uSignCube[0];
uTruthRes[1] |= uSignCube[1];
}
// complement if the SOP is complemented
if ( Abc_SopGetPhase(pSop) == 0 )
{
uTruthRes[0] = ~uTruthRes[0];
uTruthRes[1] = ~uTruthRes[1];
}
}
}
/**Function*************************************************************
Synopsis [Find the gate by truth table.]
Description []
SideEffects []
SeeAlso []
***********************************************************************/
Mio_Gate_t * Abc_AttachFind( Mio_Gate_t ** ppGates, unsigned ** puTruthGates, int nGates, unsigned * uTruthNode, int * Perm )
{
unsigned uTruthPerm[2];
int i, v, iNum;
// try the gates without permutation
if ( (iNum = Abc_AttachCompare( puTruthGates, nGates, uTruthNode )) >= 0 )
{
for ( v = 0; v < 6; v++ )
Perm[v] = v;
return ppGates[iNum];
}
// get permutations
if ( s_pPerms == NULL )
{
s_pPerms = Extra_Permutations( 6 );
s_nPerms = Extra_Factorial( 6 );
}
// try permutations
for ( i = 0; i < s_nPerms; i++ )
{
Abc_TruthPermute( s_pPerms[i], 6, uTruthNode, uTruthPerm );
if ( (iNum = Abc_AttachCompare( puTruthGates, nGates, uTruthPerm )) >= 0 )
{
for ( v = 0; v < 6; v++ )
Perm[v] = (int)s_pPerms[i][v];
return ppGates[iNum];
}
}
return NULL;
}
/**Function*************************************************************
Synopsis [Find the gate by truth table.]
Description []
SideEffects []
SeeAlso []
***********************************************************************/
int Abc_AttachCompare( unsigned ** puTruthGates, int nGates, unsigned * uTruthNode )
{
int i;
for ( i = 0; i < nGates; i++ )
if ( puTruthGates[i][0] == uTruthNode[0] && puTruthGates[i][1] == uTruthNode[1] )
return i;
return -1;
}
/**Function*************************************************************
Synopsis [Permutes the 6-input truth table.]
Description []
SideEffects []
SeeAlso []
***********************************************************************/
void Abc_TruthPermute( char * pPerm, int nVars, unsigned * uTruthNode, unsigned * uTruthPerm )
{
int nMints, iMintPerm, iMint, v;
uTruthPerm[0] = uTruthPerm[1] = 0;
nMints = (1 << nVars);
for ( iMint = 0; iMint < nMints; iMint++ )
{
if ( (uTruthNode[iMint>>5] & (1 << (iMint&31))) == 0 )
continue;
iMintPerm = 0;
for ( v = 0; v < nVars; v++ )
if ( iMint & (1 << v) )
iMintPerm |= (1 << pPerm[v]);
uTruthPerm[iMintPerm>>5] |= (1 << (iMintPerm&31));
}
}
////////////////////////////////////////////////////////////////////////
/// END OF FILE ///
////////////////////////////////////////////////////////////////////////
ABC_NAMESPACE_IMPL_END
|
