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
|
/**CFile****************************************************************
FileName [fraigCanon.c]
PackageName [FRAIG: Functionally reduced AND-INV graphs.]
Synopsis [AND-node creation and elementary AND-operation.]
Author [Alan Mishchenko <alanmi@eecs.berkeley.edu>]
Affiliation [UC Berkeley]
Date [Ver. 2.0. Started - October 1, 2004]
Revision [$Id: fraigCanon.c,v 1.4 2005/07/08 01:01:31 alanmi Exp $]
***********************************************************************/
#include <limits.h>
#include "fraigInt.h"
////////////////////////////////////////////////////////////////////////
/// DECLARATIONS ///
////////////////////////////////////////////////////////////////////////
////////////////////////////////////////////////////////////////////////
/// FUNCTION DEFINITIONS ///
////////////////////////////////////////////////////////////////////////
/**Function*************************************************************
Synopsis [The internal AND operation for the two FRAIG nodes.]
Description [This procedure is the core of the FRAIG package, because
it performs the two-step canonicization of FRAIG nodes. The first step
involves the lookup in the structural hash table (which hashes two ANDs
into a node that has them as fanins, if such a node exists). If the node
is not found in the structural hash table, an attempt is made to find a
functionally equivalent node in another hash table (which hashes the
simulation info into the nodes, which has this simulation info). Some
tricks used on the way are described in the comments to the code and
in the paper "FRAIGs: Functionally reduced AND-INV graphs".]
SideEffects []
SeeAlso []
***********************************************************************/
Fraig_Node_t * Fraig_NodeAndCanon( Fraig_Man_t * pMan, Fraig_Node_t * p1, Fraig_Node_t * p2 )
{
Fraig_Node_t * pNodeNew, * pNodeOld, * pNodeRepr;
int fUseSatCheck;
// int RetValue;
// check for trivial cases
if ( p1 == p2 )
return p1;
if ( p1 == Fraig_Not(p2) )
return Fraig_Not(pMan->pConst1);
if ( Fraig_NodeIsConst(p1) )
{
if ( p1 == pMan->pConst1 )
return p2;
return Fraig_Not(pMan->pConst1);
}
if ( Fraig_NodeIsConst(p2) )
{
if ( p2 == pMan->pConst1 )
return p1;
return Fraig_Not(pMan->pConst1);
}
/*
// check for less trivial cases
if ( Fraig_IsComplement(p1) )
{
if ( RetValue = Fraig_NodeIsInSupergate( Fraig_Regular(p1), p2 ) )
{
if ( RetValue == -1 )
pMan->nImplies0++;
else
pMan->nImplies1++;
if ( RetValue == -1 )
return p2;
}
}
else
{
if ( RetValue = Fraig_NodeIsInSupergate( p1, p2 ) )
{
if ( RetValue == 1 )
pMan->nSimplifies1++;
else
pMan->nSimplifies0++;
if ( RetValue == 1 )
return p1;
return Fraig_Not(pMan->pConst1);
}
}
if ( Fraig_IsComplement(p2) )
{
if ( RetValue = Fraig_NodeIsInSupergate( Fraig_Regular(p2), p1 ) )
{
if ( RetValue == -1 )
pMan->nImplies0++;
else
pMan->nImplies1++;
if ( RetValue == -1 )
return p1;
}
}
else
{
if ( RetValue = Fraig_NodeIsInSupergate( p2, p1 ) )
{
if ( RetValue == 1 )
pMan->nSimplifies1++;
else
pMan->nSimplifies0++;
if ( RetValue == 1 )
return p2;
return Fraig_Not(pMan->pConst1);
}
}
*/
// perform level-one structural hashing
if ( Fraig_HashTableLookupS( pMan, p1, p2, &pNodeNew ) ) // the node with these children is found
{
// if the existent node is part of the cone of unused logic
// (that is logic feeding the node which is equivalent to the given node)
// return the canonical representative of this node
// determine the phase of the given node, with respect to its canonical form
pNodeRepr = Fraig_Regular(pNodeNew)->pRepr;
if ( pMan->fFuncRed && pNodeRepr )
return Fraig_NotCond( pNodeRepr, Fraig_IsComplement(pNodeNew) ^ Fraig_NodeComparePhase(Fraig_Regular(pNodeNew), pNodeRepr) );
// otherwise, the node is itself a canonical representative, return it
return pNodeNew;
}
// the same node is not found, but the new one is created
// if one level hashing is requested (without functionality hashing), return
if ( !pMan->fFuncRed )
return pNodeNew;
// check if the new node is unique using the simulation info
if ( pNodeNew->nOnes == 0 || pNodeNew->nOnes == (unsigned)pMan->nWordsRand * 32 )
{
pMan->nSatZeros++;
if ( !pMan->fDoSparse ) // if we do not do sparse functions, skip
return pNodeNew;
// check the sparse function simulation hash table
pNodeOld = Fraig_HashTableLookupF0( pMan, pNodeNew );
if ( pNodeOld == NULL ) // the node is unique (it is added to the table)
return pNodeNew;
}
else
{
// check the simulation hash table
pNodeOld = Fraig_HashTableLookupF( pMan, pNodeNew );
if ( pNodeOld == NULL ) // the node is unique
return pNodeNew;
}
assert( pNodeOld->pRepr == 0 );
// there is another node which looks the same according to simulation
// use SAT to resolve the ambiguity
fUseSatCheck = (pMan->nInspLimit == 0 || Fraig_ManReadInspects(pMan) < pMan->nInspLimit);
if ( fUseSatCheck && Fraig_NodeIsEquivalent( pMan, pNodeOld, pNodeNew, pMan->nBTLimit, 1000000 ) )
{
// set the node to be equivalent with this node
// to prevent loops, only set if the old node is not in the TFI of the new node
// the loop may happen in the following case: suppose
// NodeC = AND(NodeA, NodeB) and at the same time NodeA => NodeB
// in this case, NodeA and NodeC are functionally equivalent
// however, NodeA is a fanin of node NodeC (this leads to the loop)
// add the node to the list of equivalent nodes or dereference it
if ( pMan->fChoicing && !Fraig_CheckTfi( pMan, pNodeOld, pNodeNew ) )
{
// if the old node is not in the TFI of the new node and choicing
// is enabled, add the new node to the list of equivalent ones
pNodeNew->pNextE = pNodeOld->pNextE;
pNodeOld->pNextE = pNodeNew;
}
// set the canonical representative of this node
pNodeNew->pRepr = pNodeOld;
// return the equivalent node
return Fraig_NotCond( pNodeOld, Fraig_NodeComparePhase(pNodeOld, pNodeNew) );
}
// now we add another member to this simulation class
if ( pNodeNew->nOnes == 0 || pNodeNew->nOnes == (unsigned)pMan->nWordsRand * 32 )
{
Fraig_Node_t * pNodeTemp;
assert( pMan->fDoSparse );
pNodeTemp = Fraig_HashTableLookupF0( pMan, pNodeNew );
// assert( pNodeTemp == NULL );
// Fraig_HashTableInsertF0( pMan, pNodeNew );
}
else
{
pNodeNew->pNextD = pNodeOld->pNextD;
pNodeOld->pNextD = pNodeNew;
}
// return the new node
assert( pNodeNew->pRepr == 0 );
return pNodeNew;
}
////////////////////////////////////////////////////////////////////////
/// END OF FILE ///
////////////////////////////////////////////////////////////////////////
|
