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
|
/**CFile****************************************************************
FileName [kitCloud.c]
SystemName [ABC: Logic synthesis and verification system.]
PackageName [Computation kit.]
Synopsis [Procedures using BDD package CLOUD.]
Author [Alan Mishchenko]
Affiliation [UC Berkeley]
Date [Ver. 1.0. Started - Dec 6, 2006.]
Revision [$Id: kitCloud.c,v 1.00 2006/12/06 00:00:00 alanmi Exp $]
***********************************************************************/
#include "kit.h"
////////////////////////////////////////////////////////////////////////
/// DECLARATIONS ///
////////////////////////////////////////////////////////////////////////
// internal representation of the function to be decomposed
typedef struct Kit_Mux_t_ Kit_Mux_t;
struct Kit_Mux_t_
{
unsigned v : 5; // variable
unsigned t : 12; // then edge
unsigned e : 12; // else edge
unsigned c : 1; // complemented attr of else edge
unsigned i : 1; // complemented attr of top node
};
////////////////////////////////////////////////////////////////////////
/// FUNCTION DEFINITIONS ///
////////////////////////////////////////////////////////////////////////
/**Function*************************************************************
Synopsis [Derive BDD from the truth table for 5 variable functions.]
Description []
SideEffects []
SeeAlso []
***********************************************************************/
CloudNode * Kit_TruthToCloud5_rec( CloudManager * dd, unsigned uTruth, int nVars, int nVarsAll )
{
static unsigned uVars[5] = { 0xAAAAAAAA, 0xCCCCCCCC, 0xF0F0F0F0, 0xFF00FF00, 0xFFFF0000 };
CloudNode * pCof0, * pCof1;
unsigned uCof0, uCof1;
assert( nVars <= 5 );
if ( uTruth == 0 )
return dd->zero;
if ( uTruth == ~0 )
return dd->one;
if ( nVars == 1 )
{
if ( uTruth == uVars[0] )
return dd->vars[nVarsAll-1];
if ( uTruth == ~uVars[0] )
return Cloud_Not(dd->vars[nVarsAll-1]);
assert( 0 );
}
// Count++;
assert( nVars > 1 );
uCof0 = uTruth & ~uVars[nVars-1];
uCof1 = uTruth & uVars[nVars-1];
uCof0 |= uCof0 << (1<<(nVars-1));
uCof1 |= uCof1 >> (1<<(nVars-1));
if ( uCof0 == uCof1 )
return Kit_TruthToCloud5_rec( dd, uCof0, nVars - 1, nVarsAll );
if ( uCof0 == ~uCof1 )
{
pCof0 = Kit_TruthToCloud5_rec( dd, uCof0, nVars - 1, nVarsAll );
pCof1 = Cloud_Not( pCof0 );
}
else
{
pCof0 = Kit_TruthToCloud5_rec( dd, uCof0, nVars - 1, nVarsAll );
pCof1 = Kit_TruthToCloud5_rec( dd, uCof1, nVars - 1, nVarsAll );
}
return Cloud_MakeNode( dd, nVarsAll - nVars, pCof1, pCof0 );
}
/**Function********************************************************************
Synopsis [Compute BDD for the truth table.]
Description []
SideEffects []
SeeAlso []
******************************************************************************/
CloudNode * Kit_TruthToCloud_rec( CloudManager * dd, unsigned * pTruth, int nVars, int nVarsAll )
{
CloudNode * pCof0, * pCof1;
unsigned * pTruth0, * pTruth1;
if ( nVars <= 5 )
return Kit_TruthToCloud5_rec( dd, pTruth[0], nVars, nVarsAll );
if ( Kit_TruthIsConst0(pTruth, nVars) )
return dd->zero;
if ( Kit_TruthIsConst1(pTruth, nVars) )
return dd->one;
// Count++;
pTruth0 = pTruth;
pTruth1 = pTruth + Kit_TruthWordNum(nVars-1);
if ( Kit_TruthIsEqual( pTruth0, pTruth1, nVars - 1 ) )
return Kit_TruthToCloud_rec( dd, pTruth0, nVars - 1, nVarsAll );
if ( Kit_TruthIsOpposite( pTruth0, pTruth1, nVars - 1 ) )
{
pCof0 = Kit_TruthToCloud_rec( dd, pTruth0, nVars - 1, nVarsAll );
pCof1 = Cloud_Not( pCof0 );
}
else
{
pCof0 = Kit_TruthToCloud_rec( dd, pTruth0, nVars - 1, nVarsAll );
pCof1 = Kit_TruthToCloud_rec( dd, pTruth1, nVars - 1, nVarsAll );
}
return Cloud_MakeNode( dd, nVarsAll - nVars, pCof1, pCof0 );
}
/**Function********************************************************************
Synopsis [Compute BDD for the truth table.]
Description []
SideEffects []
SeeAlso []
******************************************************************************/
CloudNode * Kit_TruthToCloud( CloudManager * dd, unsigned * pTruth, int nVars )
{
CloudNode * pRes;
pRes = Kit_TruthToCloud_rec( dd, pTruth, nVars, nVars );
// printf( "%d/%d ", Count, Cloud_DagSize(dd, pRes) );
return pRes;
}
/**Function********************************************************************
Synopsis [Transforms the array of BDDs into the integer array.]
Description []
SideEffects []
SeeAlso []
******************************************************************************/
int Kit_CreateCloud( CloudManager * dd, CloudNode * pFunc, Vec_Int_t * vNodes )
{
Kit_Mux_t Mux;
int nNodes, i;
// collect BDD nodes
nNodes = Cloud_DagCollect( dd, pFunc );
if ( nNodes >= (1<<12) ) // because in Kit_Mux_t edge is 12 bit
return 0;
assert( nNodes == Cloud_DagSize( dd, pFunc ) );
assert( nNodes < dd->nNodesLimit );
Vec_IntClear( vNodes );
Vec_IntPush( vNodes, 0 ); // const1 node
dd->ppNodes[0]->s = 0;
for ( i = 1; i < nNodes; i++ )
{
dd->ppNodes[i]->s = i;
Mux.v = dd->ppNodes[i]->v;
Mux.t = dd->ppNodes[i]->t->s;
Mux.e = Cloud_Regular(dd->ppNodes[i]->e)->s;
Mux.c = Cloud_IsComplement(dd->ppNodes[i]->e);
Mux.i = (i == nNodes - 1)? Cloud_IsComplement(pFunc) : 0;
// put the MUX into the array
Vec_IntPush( vNodes, *((int *)&Mux) );
}
assert( Vec_IntSize(vNodes) == nNodes );
// reset signatures
for ( i = 0; i < nNodes; i++ )
dd->ppNodes[i]->s = dd->nSignCur;
return 1;
}
/**Function********************************************************************
Synopsis [Transforms the array of BDDs into the integer array.]
Description []
SideEffects []
SeeAlso []
******************************************************************************/
int Kit_CreateCloudFromTruth( CloudManager * dd, unsigned * pTruth, int nVars, Vec_Int_t * vNodes )
{
CloudNode * pFunc;
Cloud_Restart( dd );
pFunc = Kit_TruthToCloud( dd, pTruth, nVars );
Vec_IntClear( vNodes );
return Kit_CreateCloud( dd, pFunc, vNodes );
}
/**Function*************************************************************
Synopsis [Computes composition of truth tables.]
Description []
SideEffects []
SeeAlso []
***********************************************************************/
unsigned * Kit_CloudToTruth( Vec_Int_t * vNodes, int nVars, Vec_Ptr_t * vStore, int fInv )
{
unsigned * pThis, * pFan0, * pFan1;
Kit_Mux_t Mux;
int i, Entry;
assert( Vec_IntSize(vNodes) <= Vec_PtrSize(vStore) );
pThis = Vec_PtrEntry( vStore, 0 );
Kit_TruthFill( pThis, nVars );
Vec_IntForEachEntryStart( vNodes, Entry, i, 1 )
{
Mux = *((Kit_Mux_t *)&Entry);
assert( (int)Mux.e < i && (int)Mux.t < i && (int)Mux.v < nVars );
pFan0 = Vec_PtrEntry( vStore, Mux.e );
pFan1 = Vec_PtrEntry( vStore, Mux.t );
pThis = Vec_PtrEntry( vStore, i );
Kit_TruthMuxVarPhase( pThis, pFan0, pFan1, nVars, fInv? Mux.v : nVars-1-Mux.v, Mux.c );
}
// complement the result
if ( Mux.i )
Kit_TruthNot( pThis, pThis, nVars );
return pThis;
}
/**Function*************************************************************
Synopsis [Computes composition of truth tables.]
Description []
SideEffects []
SeeAlso []
***********************************************************************/
unsigned * Kit_TruthCompose( CloudManager * dd, unsigned * pTruth, int nVars,
unsigned ** pInputs, int nVarsAll, Vec_Ptr_t * vStore, Vec_Int_t * vNodes )
{
CloudNode * pFunc;
unsigned * pThis, * pFan0, * pFan1;
Kit_Mux_t Mux;
int i, Entry, RetValue;
// derive BDD from truth table
Cloud_Restart( dd );
pFunc = Kit_TruthToCloud( dd, pTruth, nVars );
// convert it into nodes
RetValue = Kit_CreateCloud( dd, pFunc, vNodes );
if ( RetValue == 0 )
printf( "Kit_TruthCompose(): Internal failure!!!\n" );
// verify the result
// pFan0 = Kit_CloudToTruth( vNodes, nVars, vStore, 0 );
// if ( !Kit_TruthIsEqual( pTruth, pFan0, nVars ) )
// printf( "Failed!\n" );
// compute truth table from the BDD
assert( Vec_IntSize(vNodes) <= Vec_PtrSize(vStore) );
pThis = Vec_PtrEntry( vStore, 0 );
Kit_TruthFill( pThis, nVarsAll );
Vec_IntForEachEntryStart( vNodes, Entry, i, 1 )
{
Mux = *((Kit_Mux_t *)&Entry);
pFan0 = Vec_PtrEntry( vStore, Mux.e );
pFan1 = Vec_PtrEntry( vStore, Mux.t );
pThis = Vec_PtrEntry( vStore, i );
Kit_TruthMuxPhase( pThis, pFan0, pFan1, pInputs[nVars-1-Mux.v], nVarsAll, Mux.c );
}
// complement the result
if ( Mux.i )
Kit_TruthNot( pThis, pThis, nVarsAll );
return pThis;
}
/**Function********************************************************************
Synopsis [Compute BDD for the truth table.]
Description []
SideEffects []
SeeAlso []
******************************************************************************/
void Kit_TruthCofSupports( Vec_Int_t * vBddDir, Vec_Int_t * vBddInv, int nVars, Vec_Int_t * vMemory, unsigned * puSupps )
{
Kit_Mux_t Mux;
unsigned * puSuppAll, * pThis, * pFan0, * pFan1;
int i, v, Var, Entry, nSupps;
nSupps = 2 * nVars;
// extend storage
if ( Vec_IntSize( vMemory ) < nSupps * Vec_IntSize(vBddDir) )
Vec_IntGrow( vMemory, nSupps * Vec_IntSize(vBddDir) );
puSuppAll = Vec_IntArray( vMemory );
// clear storage for the const node
memset( puSuppAll, 0, sizeof(unsigned) * nSupps );
// compute supports from nodes
Vec_IntForEachEntryStart( vBddDir, Entry, i, 1 )
{
Mux = *((Kit_Mux_t *)&Entry);
Var = nVars - 1 - Mux.v;
pFan0 = puSuppAll + nSupps * Mux.e;
pFan1 = puSuppAll + nSupps * Mux.t;
pThis = puSuppAll + nSupps * i;
for ( v = 0; v < nSupps; v++ )
pThis[v] = pFan0[v] | pFan1[v] | (1<<Var);
assert( pFan0[2*Var + 0] == pFan0[2*Var + 1] );
assert( pFan1[2*Var + 0] == pFan1[2*Var + 1] );
pThis[2*Var + 0] = pFan0[2*Var + 0];// | pFan0[2*Var + 1];
pThis[2*Var + 1] = pFan1[2*Var + 0];// | pFan1[2*Var + 1];
}
// copy the result
memcpy( puSupps, pThis, sizeof(unsigned) * nSupps );
// compute the inverse
// extend storage
if ( Vec_IntSize( vMemory ) < nSupps * Vec_IntSize(vBddInv) )
Vec_IntGrow( vMemory, nSupps * Vec_IntSize(vBddInv) );
puSuppAll = Vec_IntArray( vMemory );
// clear storage for the const node
memset( puSuppAll, 0, sizeof(unsigned) * nSupps );
// compute supports from nodes
Vec_IntForEachEntryStart( vBddInv, Entry, i, 1 )
{
Mux = *((Kit_Mux_t *)&Entry);
// Var = nVars - 1 - Mux.v;
Var = Mux.v;
pFan0 = puSuppAll + nSupps * Mux.e;
pFan1 = puSuppAll + nSupps * Mux.t;
pThis = puSuppAll + nSupps * i;
for ( v = 0; v < nSupps; v++ )
pThis[v] = pFan0[v] | pFan1[v] | (1<<Var);
assert( pFan0[2*Var + 0] == pFan0[2*Var + 1] );
assert( pFan1[2*Var + 0] == pFan1[2*Var + 1] );
pThis[2*Var + 0] = pFan0[2*Var + 0];// | pFan0[2*Var + 1];
pThis[2*Var + 1] = pFan1[2*Var + 0];// | pFan1[2*Var + 1];
}
// merge supports
for ( Var = 0; Var < nSupps; Var++ )
puSupps[Var] = (puSupps[Var] & Kit_BitMask(Var/2)) | (pThis[Var] & ~Kit_BitMask(Var/2));
}
////////////////////////////////////////////////////////////////////////
/// END OF FILE ///
////////////////////////////////////////////////////////////////////////
|
