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
|
/**CFile****************************************************************
FileName [mvcLits.c]
PackageName [MVSIS 2.0: Multi-valued logic synthesis system.]
Synopsis [Literal counting/updating procedures.]
Author [MVSIS Group]
Affiliation [UC Berkeley]
Date [Ver. 1.0. Started - February 1, 2003.]
Revision [$Id: mvcLits.c,v 1.4 2003/04/03 06:31:50 alanmi Exp $]
***********************************************************************/
#include "mvc.h"
////////////////////////////////////////////////////////////////////////
/// DECLARATIONS ///
////////////////////////////////////////////////////////////////////////
////////////////////////////////////////////////////////////////////////
/// FUNCTION DEFINITIONS ///
////////////////////////////////////////////////////////////////////////
/**Function*************************************************************
Synopsis [Find the any literal that occurs more than once.]
Description []
SideEffects []
SeeAlso []
***********************************************************************/
int Mvc_CoverAnyLiteral( Mvc_Cover_t * pCover, Mvc_Cube_t * pMask )
{
Mvc_Cube_t * pCube;
int nWord, nBit, i;
int nLitsCur;
int fUseFirst = 0;
// go through each literal
if ( fUseFirst )
{
for ( i = 0; i < pCover->nBits; i++ )
if ( !pMask || Mvc_CubeBitValue(pMask,i) )
{
// get the word and bit of this literal
nWord = Mvc_CubeWhichWord(i);
nBit = Mvc_CubeWhichBit(i);
// go through all the cubes
nLitsCur = 0;
Mvc_CoverForEachCube( pCover, pCube )
if ( pCube->pData[nWord] & (1<<nBit) )
{
nLitsCur++;
if ( nLitsCur > 1 )
return i;
}
}
}
else
{
for ( i = pCover->nBits - 1; i >=0; i-- )
if ( !pMask || Mvc_CubeBitValue(pMask,i) )
{
// get the word and bit of this literal
nWord = Mvc_CubeWhichWord(i);
nBit = Mvc_CubeWhichBit(i);
// go through all the cubes
nLitsCur = 0;
Mvc_CoverForEachCube( pCover, pCube )
if ( pCube->pData[nWord] & (1<<nBit) )
{
nLitsCur++;
if ( nLitsCur > 1 )
return i;
}
}
}
return -1;
}
/**Function*************************************************************
Synopsis [Find the most often occurring literal.]
Description [Find the most often occurring literal among those
that occur more than once.]
SideEffects []
SeeAlso []
***********************************************************************/
int Mvc_CoverBestLiteral( Mvc_Cover_t * pCover, Mvc_Cube_t * pMask )
{
Mvc_Cube_t * pCube;
int nWord, nBit;
int i, iMax, nLitsMax, nLitsCur;
int fUseFirst = 1;
// go through each literal
iMax = -1;
nLitsMax = -1;
for ( i = 0; i < pCover->nBits; i++ )
if ( !pMask || Mvc_CubeBitValue(pMask,i) )
{
// get the word and bit of this literal
nWord = Mvc_CubeWhichWord(i);
nBit = Mvc_CubeWhichBit(i);
// go through all the cubes
nLitsCur = 0;
Mvc_CoverForEachCube( pCover, pCube )
if ( pCube->pData[nWord] & (1<<nBit) )
nLitsCur++;
// check if this is the best literal
if ( fUseFirst )
{
if ( nLitsMax < nLitsCur )
{
nLitsMax = nLitsCur;
iMax = i;
}
}
else
{
if ( nLitsMax <= nLitsCur )
{
nLitsMax = nLitsCur;
iMax = i;
}
}
}
if ( nLitsMax > 1 )
return iMax;
return -1;
}
/**Function*************************************************************
Synopsis [Find the most often occurring literal.]
Description [Find the most often occurring literal among those
that occur more than once.]
SideEffects []
SeeAlso []
***********************************************************************/
int Mvc_CoverWorstLiteral( Mvc_Cover_t * pCover, Mvc_Cube_t * pMask )
{
Mvc_Cube_t * pCube;
int nWord, nBit;
int i, iMin, nLitsMin, nLitsCur;
int fUseFirst = 1;
// go through each literal
iMin = -1;
nLitsMin = 1000000;
for ( i = 0; i < pCover->nBits; i++ )
if ( !pMask || Mvc_CubeBitValue(pMask,i) )
{
// get the word and bit of this literal
nWord = Mvc_CubeWhichWord(i);
nBit = Mvc_CubeWhichBit(i);
// go through all the cubes
nLitsCur = 0;
Mvc_CoverForEachCube( pCover, pCube )
if ( pCube->pData[nWord] & (1<<nBit) )
nLitsCur++;
// skip the literal that does not occur or occurs once
if ( nLitsCur < 2 )
continue;
// check if this is the best literal
if ( fUseFirst )
{
if ( nLitsMin > nLitsCur )
{
nLitsMin = nLitsCur;
iMin = i;
}
}
else
{
if ( nLitsMin >= nLitsCur )
{
nLitsMin = nLitsCur;
iMin = i;
}
}
}
if ( nLitsMin < 1000000 )
return iMin;
return -1;
}
/**Function*************************************************************
Synopsis []
Description []
SideEffects []
SeeAlso []
***********************************************************************/
Mvc_Cover_t * Mvc_CoverBestLiteralCover( Mvc_Cover_t * pCover, Mvc_Cover_t * pSimple )
{
Mvc_Cover_t * pCoverNew;
Mvc_Cube_t * pCubeNew;
Mvc_Cube_t * pCubeS;
int iLitBest;
// create the new cover
pCoverNew = Mvc_CoverClone( pCover );
// get the new cube
pCubeNew = Mvc_CubeAlloc( pCoverNew );
// clean the cube
Mvc_CubeBitClean( pCubeNew );
// get the first cube of pSimple
assert( Mvc_CoverReadCubeNum(pSimple) == 1 );
pCubeS = Mvc_CoverReadCubeHead( pSimple );
// find the best literal among those of pCubeS
iLitBest = Mvc_CoverBestLiteral( pCover, pCubeS );
// insert this literal into the cube
Mvc_CubeBitInsert( pCubeNew, iLitBest );
// add the cube to the cover
Mvc_CoverAddCubeTail( pCoverNew, pCubeNew );
return pCoverNew;
}
/**Function*************************************************************
Synopsis []
Description []
SideEffects []
SeeAlso []
***********************************************************************/
int Mvc_CoverFirstCubeFirstLit( Mvc_Cover_t * pCover )
{
Mvc_Cube_t * pCube;
int iBit, Value;
// get the first cube
pCube = Mvc_CoverReadCubeHead( pCover );
// get the first literal
Mvc_CubeForEachBit( pCover, pCube, iBit, Value )
if ( Value )
return iBit;
return -1;
}
/**Function*************************************************************
Synopsis [Returns the number of literals in the cover.]
Description [Allocates storage for literal counters and fills it up
using the current information.]
SideEffects []
SeeAlso []
***********************************************************************/
int Mvc_CoverCountLiterals( Mvc_Cover_t * pCover )
{
Mvc_Cube_t * pCube;
int nWord, nBit;
int i, CounterTot, CounterCur;
// allocate/clean the storage for literals
// Mvc_CoverAllocateArrayLits( pCover );
// memset( pCover->pLits, 0, pCover->nBits * sizeof(int) );
// go through each literal
CounterTot = 0;
for ( i = 0; i < pCover->nBits; i++ )
{
// get the word and bit of this literal
nWord = Mvc_CubeWhichWord(i);
nBit = Mvc_CubeWhichBit(i);
// go through all the cubes
CounterCur = 0;
Mvc_CoverForEachCube( pCover, pCube )
if ( pCube->pData[nWord] & (1<<nBit) )
CounterCur++;
CounterTot += CounterCur;
}
return CounterTot;
}
/**Function*************************************************************
Synopsis [Returns the number of literals in the cover.]
Description []
SideEffects []
SeeAlso []
***********************************************************************/
int Mvc_CoverIsOneLiteral( Mvc_Cover_t * pCover )
{
Mvc_Cube_t * pCube;
int iBit, Counter, Value;
if ( Mvc_CoverReadCubeNum(pCover) != 1 )
return 0;
pCube = Mvc_CoverReadCubeHead(pCover);
// count literals
Counter = 0;
Mvc_CubeForEachBit( pCover, pCube, iBit, Value )
{
if ( Value )
{
if ( Counter++ )
return 0;
}
}
return 1;
}
////////////////////////////////////////////////////////////////////////
/// END OF FILE ///
////////////////////////////////////////////////////////////////////////
|
