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
|
/**CFile****************************************************************
FileName [fraigTrans.c]
PackageName [MVSIS 1.3: Multi-valued logic synthesis system.]
Synopsis [Adds the additive and distributive choices to the AIG.]
Author [MVSIS Group]
Affiliation [UC Berkeley]
Date [Ver. 1.0. Started - February 1, 2003.]
Revision [$Id: fraigTrans.c,v 1.1 2005/02/28 05:34:34 alanmi Exp $]
***********************************************************************/
#include "fraigInt.h"
ABC_NAMESPACE_IMPL_START
////////////////////////////////////////////////////////////////////////
/// DECLARATIONS ///
////////////////////////////////////////////////////////////////////////
////////////////////////////////////////////////////////////////////////
/// FUNCTION DEFITIONS ///
////////////////////////////////////////////////////////////////////////
/**Function*************************************************************
Synopsis [Adds choice nodes based on associativity.]
Description [Make nLimit big AND gates and add all decompositions
to the Fraig.]
SideEffects []
SeeAlso []
***********************************************************************/
void Fraig_ManAddChoices( Fraig_Man_t * pMan, int fVerbose, int nLimit )
{
// ProgressBar * pProgress;
char Buffer[100];
abctime clkTotal = Abc_Clock();
int i, nNodesBefore, nNodesAfter, nInputs, nMaxNodes;
int /*nMaxLevel,*/ nDistributive;
Fraig_Node_t *pNode, *pRepr;
Fraig_Node_t *pX, *pA, *pB, *pC, /* *pD,*/ *pN, /* *pQ, *pR,*/ *pT;
int fShortCut = 0;
nDistributive = 0;
// Fraig_ManSetApprox( pMan, 1 );
// NO functional reduction
if (fShortCut) Fraig_ManSetFuncRed( pMan, 0 );
// First we mark critical functions i.e. compute those
// nodes which lie on the critical path. Note that this
// doesn't update the required times on any choice nodes
// which are not the representatives
/*
nMaxLevel = Fraig_GetMaxLevel( pMan );
for ( i = 0; i < pMan->nOutputs; i++ )
{
Fraig_SetNodeRequired( pMan, pMan->pOutputs[i], nMaxLevel );
}
*/
nNodesBefore = Fraig_ManReadNodeNum( pMan );
nInputs = Fraig_ManReadInputNum( pMan );
nMaxNodes = nInputs + nLimit * ( nNodesBefore - nInputs );
printf ("Limit = %d, Before = %d\n", nMaxNodes, nNodesBefore );
if (0)
{
char buffer[128];
sprintf (buffer, "test" );
// Fraig_MappingShow( pMan, buffer );
}
// pProgress = Extra_ProgressBarStart( stdout, nMaxNodes );
Fraig_ManCheckConsistency( pMan );
for ( i = nInputs+1; (i < Fraig_ManReadNodeNum( pMan ))
&& (nMaxNodes > Fraig_ManReadNodeNum( pMan )); ++i )
{
// if ( i == nNodesBefore )
// break;
pNode = Fraig_ManReadIthNode( pMan, i );
assert ( pNode );
pRepr = pNode->pRepr ? pNode->pRepr : pNode;
//printf ("Slack: %d\n", Fraig_NodeReadSlack( pRepr ));
// All the new associative choices we add will have huge slack
// since we do not redo timing, and timing doesnt handle choices
// well anyway. However every newly added node is a choice of an
// existing critical node, so they are considered critical.
// if ( (Fraig_NodeReadSlack( pRepr ) > 3) && (i < nNodesBefore) )
// continue;
// if ( pNode->pRepr )
// continue;
// Try ((ab)c), x = ab -> (a(bc)) and (b(ac))
pX = Fraig_NodeReadOne(pNode);
pC = Fraig_NodeReadTwo(pNode);
if (Fraig_NodeIsAnd(pX) && !Fraig_IsComplement(pX))
{
pA = Fraig_NodeReadOne(Fraig_Regular(pX));
pB = Fraig_NodeReadTwo(Fraig_Regular(pX));
// pA = Fraig_NodeGetRepr( pA );
// pB = Fraig_NodeGetRepr( pB );
// pC = Fraig_NodeGetRepr( pC );
if (fShortCut)
{
pT = Fraig_NodeAnd(pMan, pB, pC);
if ( !pT->pRepr )
{
pN = Fraig_NodeAnd(pMan, pA, pT);
// Fraig_NodeAddChoice( pMan, pNode, pN );
}
}
else
pN = Fraig_NodeAnd(pMan, pA, Fraig_NodeAnd(pMan, pB, pC));
// assert ( Fraig_NodesEqual(pN, pNode) );
if (fShortCut)
{
pT = Fraig_NodeAnd(pMan, pA, pC);
if ( !pT->pRepr )
{
pN = Fraig_NodeAnd(pMan, pB, pT);
// Fraig_NodeAddChoice( pMan, pNode, pN );
}
}
else
pN = Fraig_NodeAnd(pMan, pB, Fraig_NodeAnd(pMan, pA, pC));
// assert ( Fraig_NodesEqual(pN, pNode) );
}
// Try (a(bc)), x = bc -> ((ab)c) and ((ac)b)
pA = Fraig_NodeReadOne(pNode);
pX = Fraig_NodeReadTwo(pNode);
if (Fraig_NodeIsAnd(pX) && !Fraig_IsComplement(pX))
{
pB = Fraig_NodeReadOne(Fraig_Regular(pX));
pC = Fraig_NodeReadTwo(Fraig_Regular(pX));
// pA = Fraig_NodeGetRepr( pA );
// pB = Fraig_NodeGetRepr( pB );
// pC = Fraig_NodeGetRepr( pC );
if (fShortCut)
{
pT = Fraig_NodeAnd(pMan, pA, pB);
if ( !pT->pRepr )
{
pN = Fraig_NodeAnd(pMan, pC, pT);
// Fraig_NodeAddChoice( pMan, pNode, pN );
}
}
else
pN = Fraig_NodeAnd(pMan, Fraig_NodeAnd(pMan, pA, pB), pC);
// assert ( Fraig_NodesEqual(pN, pNode) );
if (fShortCut)
{
pT = Fraig_NodeAnd(pMan, pA, pC);
if ( !pT->pRepr )
{
pN = Fraig_NodeAnd(pMan, pB, pT);
// Fraig_NodeAddChoice( pMan, pNode, pN );
}
}
else
pN = Fraig_NodeAnd(pMan, Fraig_NodeAnd(pMan, pA, pC), pB);
// assert ( Fraig_NodesEqual(pN, pNode) );
}
/*
// Try distributive transform
pQ = Fraig_NodeReadOne(pNode);
pR = Fraig_NodeReadTwo(pNode);
if ( (Fraig_IsComplement(pQ) && Fraig_NodeIsAnd(pQ))
&& (Fraig_IsComplement(pR) && Fraig_NodeIsAnd(pR)) )
{
pA = Fraig_NodeReadOne(Fraig_Regular(pQ));
pB = Fraig_NodeReadTwo(Fraig_Regular(pQ));
pC = Fraig_NodeReadOne(Fraig_Regular(pR));
pD = Fraig_NodeReadTwo(Fraig_Regular(pR));
// Now detect the !(xy + xz) pattern, store
// x in pA, y in pB and z in pC and set pD = 0 to indicate
// pattern was found
assert (pD != 0);
if (pA == pC) { pC = pD; pD = 0; }
if (pA == pD) { pD = 0; }
if (pB == pC) { pB = pA; pA = pC; pC = pD; pD = 0; }
if (pB == pD) { pB = pA; pA = pD; pD = 0; }
if (pD == 0)
{
nDistributive++;
pN = Fraig_Not(Fraig_NodeAnd(pMan, pA,
Fraig_NodeOr(pMan, pB, pC)));
if (fShortCut) Fraig_NodeAddChoice( pMan, pNode, pN );
// assert ( Fraig_NodesEqual(pN, pNode) );
}
}
*/
if ( i % 1000 == 0 )
{
sprintf( Buffer, "Adding choice %6d...", i - nNodesBefore );
// Extra_ProgressBarUpdate( pProgress, i, Buffer );
}
}
// Extra_ProgressBarStop( pProgress );
Fraig_ManCheckConsistency( pMan );
nNodesAfter = Fraig_ManReadNodeNum( pMan );
printf ( "Nodes before = %6d. Nodes with associative choices = %6d. Increase = %4.2f %%.\n",
nNodesBefore, nNodesAfter, ((float)(nNodesAfter - nNodesBefore)) * 100.0/(nNodesBefore - nInputs) );
printf ( "Distributive = %d\n", nDistributive );
}
////////////////////////////////////////////////////////////////////////
/// END OF FILE ///
////////////////////////////////////////////////////////////////////////
ABC_NAMESPACE_IMPL_END
|
