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
|
/**CFile****************************************************************
FileName [giaRex.c]
SystemName [ABC: Logic synthesis and verification system.]
PackageName [Scalable AIG package.]
Synopsis [Regular expressions.]
Author [Alan Mishchenko]
Affiliation [UC Berkeley]
Date [Ver. 1.0. Started - June 20, 2005.]
Revision [$Id: giaRex.c,v 1.00 2005/06/20 00:00:00 alanmi Exp $]
***********************************************************************/
#include "gia.h"
ABC_NAMESPACE_IMPL_START
////////////////////////////////////////////////////////////////////////
/// DECLARATIONS ///
////////////////////////////////////////////////////////////////////////
////////////////////////////////////////////////////////////////////////
/// FUNCTION DEFINITIONS ///
////////////////////////////////////////////////////////////////////////
/**Function*************************************************************
Synopsis [Simulate AIG with the given sequence.]
Description []
SideEffects []
SeeAlso []
***********************************************************************/
void Gia_ManAutomSimulate( Gia_Man_t * p, Vec_Int_t * vAlpha, char * pSim )
{
Gia_Obj_t * pObj, * pObjRi, * pObjRo;
int nInputs = Vec_IntSize(vAlpha);
int nFrames = strlen(pSim);
int i, k;
assert( Gia_ManPiNum(p) == nInputs );
printf( "Simulating string \"%s\":\n", pSim );
Gia_ManCleanMark0(p);
Gia_ManForEachRo( p, pObj, i )
pObj->fMark0 = 0;
for ( i = 0; i < nFrames; i++ )
{
Gia_ManForEachPi( p, pObj, k )
pObj->fMark0 = (int)(Vec_IntFind(vAlpha, pSim[i]) == k);
Gia_ManForEachAnd( p, pObj, k )
pObj->fMark0 = (Gia_ObjFanin0(pObj)->fMark0 ^ Gia_ObjFaninC0(pObj)) &
(Gia_ObjFanin1(pObj)->fMark0 ^ Gia_ObjFaninC1(pObj));
Gia_ManForEachCo( p, pObj, k )
pObj->fMark0 = Gia_ObjFanin0(pObj)->fMark0 ^ Gia_ObjFaninC0(pObj);
Gia_ManForEachRiRo( p, pObjRi, pObjRo, k )
pObjRo->fMark0 = pObjRi->fMark0;
printf( "Frame %d : %c %d\n", i, pSim[i], Gia_ManPo(p, 0)->fMark0 );
}
Gia_ManCleanMark0(p);
}
/**Function*************************************************************
Synopsis [Builds 1-hotness contraint.]
Description []
SideEffects []
SeeAlso []
***********************************************************************/
void Gia_ManBuild1Hot_rec( Gia_Man_t * p, int * pLits, int nLits, int * pZero, int * pOne )
{
int Zero0, One0, Zero1, One1;
if ( nLits == 1 )
{
*pZero = Abc_LitNot(pLits[0]);
*pOne = pLits[0];
return;
}
Gia_ManBuild1Hot_rec( p, pLits, nLits/2, &Zero0, &One0 );
Gia_ManBuild1Hot_rec( p, pLits + nLits/2, nLits - nLits/2, &Zero1, &One1 );
*pZero = Gia_ManHashAnd( p, Zero0, Zero1 );
*pOne = Gia_ManHashOr( p, Gia_ManHashAnd(p, Zero0, One1), Gia_ManHashAnd(p, Zero1, One0) );
}
int Gia_ManBuild1Hot( Gia_Man_t * p, Vec_Int_t * vLits )
{
int Zero, One;
assert( Vec_IntSize(vLits) > 0 );
Gia_ManBuild1Hot_rec( p, Vec_IntArray(vLits), Vec_IntSize(vLits), &Zero, &One );
return One;
}
/**Function*************************************************************
Synopsis [Converting regular expressions into sequential AIGs.]
Description [http://algs4.cs.princeton.edu/lectures/54RegularExpressions.pdf]
SideEffects []
SeeAlso []
***********************************************************************/
static inline int Gia_SymbSpecial( char c ) { return c == '(' || c == ')' || c == '*' || c == '|'; }
// collects info about input alphabet and state of the automaton
int Gia_ManRexNumInputs( char * pStr, Vec_Int_t ** pvAlphas, Vec_Int_t ** pvStr2Sta )
{
int i, nStates = 0, Length = strlen(pStr);
Vec_Int_t * vAlphas = Vec_IntAlloc( 100 ); // alphabet
Vec_Int_t * vStr2Sta = Vec_IntStartFull( Length + 1 ); // symbol to state
for ( i = 0; i < Length; i++ )
{
if ( Gia_SymbSpecial(pStr[i]) )
continue;
if ( Vec_IntFind(vAlphas, pStr[i]) == -1 )
Vec_IntPush( vAlphas, pStr[i] );
Vec_IntWriteEntry( vStr2Sta, i, nStates++ );
}
Vec_IntWriteEntry( vStr2Sta, i, nStates );
*pvAlphas = vAlphas;
*pvStr2Sta = vStr2Sta;
return nStates;
}
// prints automaton
void Gia_ManPrintAutom( char * pStr, Vec_Int_t * vStaTrans )
{
int i = 0, nLength = strlen(pStr);
for ( i = 0; i < nLength; i++ )
{
printf( "%d \'%c\' ", i, pStr[i] );
if ( Vec_IntEntry(vStaTrans, i) >= 0 )
printf( "-> %d \'%c\' ", Vec_IntEntry(vStaTrans, i), pStr[Vec_IntEntry(vStaTrans, i)] );
printf( "\n" );
}
}
// prints states reachable through e-transitions
void Gia_ManPrintReached( char * pStr, int iState, Vec_Int_t * vReached )
{
int i, Entry;
printf( "Reached from state %d \'%c\': ", iState, pStr[iState] );
Vec_IntForEachEntry( vReached, Entry, i )
printf( "%d \'%c\' ", Entry, pStr[Entry] );
printf( "\n" );
}
// collect states reachable from the given one by e-transitions
void Gia_ManPrintReached_rec( char * pStr, Vec_Int_t * vStaTrans, int iState, Vec_Int_t * vReached, Vec_Int_t * vVisited, int TravId )
{
if ( Vec_IntEntry(vVisited, iState) == TravId )
return;
Vec_IntWriteEntry( vVisited, iState, TravId );
if ( !Gia_SymbSpecial(pStr[iState]) ) // read state
Vec_IntPush( vReached, iState );
if ( pStr[iState] == '\0' )
return;
if ( Gia_SymbSpecial(pStr[iState]) && pStr[iState] != '|' ) // regular e-transition
Gia_ManPrintReached_rec( pStr, vStaTrans, iState + 1, vReached, vVisited, TravId );
if ( Vec_IntEntry(vStaTrans, iState) >= 0 ) // additional e-transition
Gia_ManPrintReached_rec( pStr, vStaTrans, Vec_IntEntry(vStaTrans, iState), vReached, vVisited, TravId );
}
void Gia_ManCollectReached( char * pStr, Vec_Int_t * vStaTrans, int iState, Vec_Int_t * vReached, Vec_Int_t * vVisited, int TravId )
{
assert( iState == 0 || !Gia_SymbSpecial(pStr[iState]) );
assert( Vec_IntEntry(vVisited, iState) != TravId );
Vec_IntClear( vReached );
Gia_ManPrintReached_rec( pStr, vStaTrans, iState + 1, vReached, vVisited, TravId );
}
// preprocesses the regular expression
char * Gia_ManRexPreprocess( char * pStr )
{
char * pCopy = ABC_CALLOC( char, strlen(pStr) * 2 + 10 );
int i, k = 0;
pCopy[k++] = '(';
pCopy[k++] = '(';
for ( i = 0; pStr[i]; i++ )
{
if ( pStr[i] == '(' )
pCopy[k++] = '(';
else if ( pStr[i] == ')' )
pCopy[k++] = ')';
if ( pStr[i] != ' ' && pStr[i] != '\t' && pStr[i] != '\n' && pStr[i] != '\r' )
pCopy[k++] = pStr[i];
}
pCopy[k++] = ')';
pCopy[k++] = ')';
pCopy[k++] = '\0';
return pCopy;
}
// construct sequential AIG for the automaton
Gia_Man_t * Gia_ManRex2Gia( char * pStrInit, int fOrder, int fVerbose )
{
Gia_Man_t * pNew = NULL, * pTemp;
Vec_Int_t * vAlphas, * vStr2Sta, * vStaLits;
Vec_Int_t * vStaTrans, * vStack, * vVisited;
Vec_Str_t * vInit;
char * pStr = Gia_ManRexPreprocess( pStrInit );
int nStates = Gia_ManRexNumInputs( pStr, &vAlphas, &vStr2Sta );
int i, k, iLit, Entry, nLength = strlen(pStr), nTravId = 1;
if ( fOrder )
Vec_IntSort( vAlphas, 0 );
// if ( fVerbose )
{
printf( "Input variable order: " );
Vec_IntForEachEntry( vAlphas, Entry, k )
printf( "%c", (char)Entry );
printf( "\n" );
}
// start AIG
pNew = Gia_ManStart( 1000 );
pNew->pName = Abc_UtilStrsav( pStrInit );
for ( i = 0; i < Vec_IntSize(vAlphas) + nStates; i++ )
Gia_ManAppendCi( pNew );
// prepare automaton
vStaLits = Vec_IntStart( nStates + 1 );
vStaTrans = Vec_IntStartFull( nLength );
vStack = Vec_IntAlloc( nLength );
vVisited = Vec_IntStartFull( nLength + 1 );
for ( i = 0; i < nLength; i++ )
{
int Lp = i;
if ( pStr[i] == '(' || pStr[i] == '|' )
Vec_IntPush( vStack, i );
else if ( pStr[i] == ')' )
{
int Or = Vec_IntPop( vStack );
if ( pStr[Or] == '|' )
{
Lp = Vec_IntPop( vStack );
Vec_IntWriteEntry( vStaTrans, Lp, Or + 1 );
Vec_IntWriteEntry( vStaTrans, Or, i );
}
else
Lp = Or;
}
if ( i < nLength - 1 && pStr[i+1] == '*' )
{
Vec_IntWriteEntry( vStaTrans, Lp, i+1 );
Vec_IntWriteEntry( vStaTrans, i+1, Lp );
}
}
assert( Vec_IntSize(vStack) == 0 );
if ( fVerbose )
Gia_ManPrintAutom( pStr, vStaTrans );
// create next-state functions for each state
Gia_ManHashAlloc( pNew );
for ( i = 1; i < nLength; i++ )
{
int iThis, iThat, iThisLit, iInputLit;
if ( Gia_SymbSpecial(pStr[i]) )
continue;
Gia_ManCollectReached( pStr, vStaTrans, i, vStack, vVisited, nTravId++ );
if ( fVerbose )
Gia_ManPrintReached( pStr, i, vStack );
// create transitions from this state under this input
iThis = Vec_IntEntry(vStr2Sta, i);
iThisLit = Gia_Obj2Lit(pNew, Gia_ManPi(pNew, Vec_IntSize(vAlphas) + iThis));
iInputLit = Gia_Obj2Lit(pNew, Gia_ManPi(pNew, Vec_IntFind(vAlphas, pStr[i])));
iLit = Gia_ManHashAnd( pNew, iThisLit, iInputLit );
Vec_IntForEachEntry( vStack, Entry, k )
{
iThat = Vec_IntEntry(vStr2Sta, Entry);
iLit = Gia_ManHashOr( pNew, iLit, Vec_IntEntry(vStaLits, iThat) );
Vec_IntWriteEntry( vStaLits, iThat, iLit );
}
}
// create one-hotness
Vec_IntClear( vStack );
for ( i = 0; i < Vec_IntSize(vAlphas); i++ )
Vec_IntPush( vStack, Gia_Obj2Lit(pNew, Gia_ManPi(pNew, i)) );
iLit = Gia_ManBuild1Hot( pNew, vStack );
// combine with outputs
Vec_IntForEachEntry( vStaLits, Entry, k )
Vec_IntWriteEntry( vStaLits, k, Gia_ManHashAnd(pNew, iLit, Entry) );
Gia_ManHashStop( pNew );
// collect initial state
Gia_ManCollectReached( pStr, vStaTrans, 0, vStack, vVisited, nTravId++ );
if ( fVerbose )
Gia_ManPrintReached( pStr, 0, vStack );
vInit = Vec_StrStart( nStates + 1 );
Vec_StrFill( vInit, nStates, '0' );
Vec_IntForEachEntry( vStack, Entry, k )
if ( pStr[Entry] != '\0' )
Vec_StrWriteEntry( vInit, Vec_IntEntry(vStr2Sta, Entry), '1' );
if ( fVerbose )
printf( "Init state = %s\n", Vec_StrArray(vInit) );
// add outputs
Vec_IntPushFirst( vStaLits, Vec_IntPop(vStaLits) );
assert( Vec_IntSize(vStaLits) == nStates + 1 );
Vec_IntForEachEntry( vStaLits, iLit, i )
Gia_ManAppendCo( pNew, iLit );
Gia_ManSetRegNum( pNew, nStates );
pNew = Gia_ManCleanup( pTemp = pNew );
Gia_ManStop( pTemp );
// add initial state
pNew = Gia_ManDupZeroUndc( pTemp = pNew, Vec_StrArray(vInit), 0 );
Gia_ManStop( pTemp );
Vec_StrFree( vInit );
/*
Gia_ManAutomSimulate( pNew, vAlphas, "0" );
Gia_ManAutomSimulate( pNew, vAlphas, "01" );
Gia_ManAutomSimulate( pNew, vAlphas, "110" );
Gia_ManAutomSimulate( pNew, vAlphas, "011" );
Gia_ManAutomSimulate( pNew, vAlphas, "111" );
Gia_ManAutomSimulate( pNew, vAlphas, "1111" );
Gia_ManAutomSimulate( pNew, vAlphas, "1010" );
Gia_ManAutomSimulate( pNew, vAlphas, "A" );
Gia_ManAutomSimulate( pNew, vAlphas, "AD" );
Gia_ManAutomSimulate( pNew, vAlphas, "ABCD" );
Gia_ManAutomSimulate( pNew, vAlphas, "BCD" );
Gia_ManAutomSimulate( pNew, vAlphas, "CD" );
*/
// cleanup
Vec_IntFree( vAlphas );
Vec_IntFree( vStr2Sta );
Vec_IntFree( vStaLits );
Vec_IntFree( vStaTrans );
Vec_IntFree( vStack );
Vec_IntFree( vVisited );
ABC_FREE( pStr );
return pNew;
}
////////////////////////////////////////////////////////////////////////
/// END OF FILE ///
////////////////////////////////////////////////////////////////////////
ABC_NAMESPACE_IMPL_END
|
