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
|
/**CFile****************************************************************
FileName [mvcProc.c]
PackageName [MVSIS 2.0: Multi-valued logic synthesis system.]
Synopsis [Various boolean procedures working with covers.]
Author [MVSIS Group]
Affiliation [UC Berkeley]
Date [Ver. 1.0. Started - February 1, 2003.]
Revision [$Id: mvcOpBool.c,v 1.4 2003/04/16 01:55:37 alanmi Exp $]
***********************************************************************/
#include "mvc.h"
////////////////////////////////////////////////////////////////////////
/// DECLARATIONS ///
////////////////////////////////////////////////////////////////////////
////////////////////////////////////////////////////////////////////////
/// FUNCTION DEFITIONS ///
////////////////////////////////////////////////////////////////////////
/**Function*************************************************************
Synopsis []
Description []
SideEffects []
SeeAlso []
***********************************************************************/
Mvc_Cover_t * Mvc_CoverBooleanOr( Mvc_Cover_t * pCover1, Mvc_Cover_t * pCover2 )
{
Mvc_Cover_t * pCover;
Mvc_Cube_t * pCube, * pCubeCopy;
// make sure the covers are compatible
assert( pCover1->nBits == pCover2->nBits );
// clone the cover
pCover = Mvc_CoverClone( pCover1 );
// create the cubes by making pair-wise products
// of cubes in pCover1 and pCover2
Mvc_CoverForEachCube( pCover1, pCube )
{
pCubeCopy = Mvc_CubeDup( pCover, pCube );
Mvc_CoverAddCubeTail( pCover, pCubeCopy );
}
Mvc_CoverForEachCube( pCover2, pCube )
{
pCubeCopy = Mvc_CubeDup( pCover, pCube );
Mvc_CoverAddCubeTail( pCover, pCubeCopy );
}
return pCover;
}
#if 0
/**Function*************************************************************
Synopsis []
Description []
SideEffects []
SeeAlso []
***********************************************************************/
Mvc_Cover_t * Mvc_CoverBooleanAnd( Mvc_Data_t * p, Mvc_Cover_t * pCover1, Mvc_Cover_t * pCover2 )
{
Mvc_Cover_t * pCover;
Mvc_Cube_t * pCube1, * pCube2, * pCubeCopy;
// make sure the covers are compatible
assert( pCover1->nBits == pCover2->nBits );
// clone the cover
pCover = Mvc_CoverClone( pCover1 );
// create the cubes by making pair-wise products
// of cubes in pCover1 and pCover2
Mvc_CoverForEachCube( pCover1, pCube1 )
{
Mvc_CoverForEachCube( pCover2, pCube2 )
{
if ( Mvc_CoverDist0Cubes( p, pCube1, pCube2 ) )
{
pCubeCopy = Mvc_CubeAlloc( pCover );
Mvc_CubeBitAnd( pCubeCopy, pCube1, pCube2 );
Mvc_CoverAddCubeTail( pCover, pCubeCopy );
}
}
// if the number of cubes in the new cover is too large
// try compressing them
if ( Mvc_CoverReadCubeNum( pCover ) > 500 )
Mvc_CoverContain( pCover );
}
return pCover;
}
/**Function*************************************************************
Synopsis [Returns 1 if the two covers are equal.]
Description []
SideEffects []
SeeAlso []
***********************************************************************/
int Mvc_CoverBooleanEqual( Mvc_Data_t * p, Mvc_Cover_t * pCover1, Mvc_Cover_t * pCover2 )
{
Mvc_Cover_t * pSharp;
pSharp = Mvc_CoverSharp( p, pCover1, pCover2 );
if ( Mvc_CoverReadCubeNum( pSharp ) )
{
Mvc_CoverContain( pSharp );
printf( "Sharp \n" );
Mvc_CoverPrint( pSharp );
Mvc_CoverFree( pSharp );
return 0;
}
Mvc_CoverFree( pSharp );
pSharp = Mvc_CoverSharp( p, pCover2, pCover1 );
if ( Mvc_CoverReadCubeNum( pSharp ) )
{
Mvc_CoverContain( pSharp );
printf( "Sharp \n" );
Mvc_CoverPrint( pSharp );
Mvc_CoverFree( pSharp );
return 0;
}
Mvc_CoverFree( pSharp );
return 1;
}
#endif
////////////////////////////////////////////////////////////////////////
/// END OF FILE ///
////////////////////////////////////////////////////////////////////////
|
