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
|
/**CFile****************************************************************
FileName [seqLatch.c]
SystemName [ABC: Logic synthesis and verification system.]
PackageName [Construction and manipulation of sequential AIGs.]
Synopsis [Manipulation of latch data structures representing initial states.]
Author [Alan Mishchenko]
Affiliation [UC Berkeley]
Date [Ver. 1.0. Started - June 20, 2005.]
Revision [$Id: seqLatch.c,v 1.00 2005/06/20 00:00:00 alanmi Exp $]
***********************************************************************/
#include "seqInt.h"
////////////////////////////////////////////////////////////////////////
/// DECLARATIONS ///
////////////////////////////////////////////////////////////////////////
////////////////////////////////////////////////////////////////////////
/// FUNCTION DEFINITIONS ///
////////////////////////////////////////////////////////////////////////
/**Function*************************************************************
Synopsis [Insert the first Lat on the edge.]
Description []
SideEffects []
SeeAlso []
***********************************************************************/
void Seq_NodeInsertFirst( Abc_Obj_t * pObj, int Edge, Abc_InitType_t Init )
{
Seq_Lat_t * pLat, * pRing, * pPrev;
pRing = Seq_NodeGetRing( pObj, Edge );
pLat = Seq_NodeCreateLat( pObj );
if ( pRing == NULL )
{
Seq_LatSetPrev( pLat, pLat );
Seq_LatSetNext( pLat, pLat );
Seq_NodeSetRing( pObj, Edge, pLat );
}
else
{
pPrev = Seq_LatPrev( pRing );
Seq_LatSetPrev( pLat, pPrev );
Seq_LatSetNext( pPrev, pLat );
Seq_LatSetPrev( pRing, pLat );
Seq_LatSetNext( pLat, pRing );
Seq_NodeSetRing( pObj, Edge, pLat ); // rotate the ring to make pLat the first
}
Seq_LatSetInit( pLat, Init );
Seq_ObjAddFaninL( pObj, Edge, 1 );
assert( pLat->pLatch == NULL );
}
/**Function*************************************************************
Synopsis [Insert the last Lat on the edge.]
Description []
SideEffects []
SeeAlso []
***********************************************************************/
void Seq_NodeInsertLast( Abc_Obj_t * pObj, int Edge, Abc_InitType_t Init )
{
Seq_Lat_t * pLat, * pRing, * pPrev;
pRing = Seq_NodeGetRing( pObj, Edge );
pLat = Seq_NodeCreateLat( pObj );
if ( pRing == NULL )
{
Seq_LatSetPrev( pLat, pLat );
Seq_LatSetNext( pLat, pLat );
Seq_NodeSetRing( pObj, Edge, pLat );
}
else
{
pPrev = Seq_LatPrev( pRing );
Seq_LatSetPrev( pLat, pPrev );
Seq_LatSetNext( pPrev, pLat );
Seq_LatSetPrev( pRing, pLat );
Seq_LatSetNext( pLat, pRing );
}
Seq_LatSetInit( pLat, Init );
Seq_ObjAddFaninL( pObj, Edge, 1 );
}
/**Function*************************************************************
Synopsis [Delete the first Lat on the edge.]
Description []
SideEffects []
SeeAlso []
***********************************************************************/
Abc_InitType_t Seq_NodeDeleteFirst( Abc_Obj_t * pObj, int Edge )
{
Abc_InitType_t Init;
Seq_Lat_t * pLat, * pRing, * pPrev, * pNext;
pRing = Seq_NodeGetRing( pObj, Edge );
pLat = pRing; // consider the first latch
if ( pLat->pNext == pLat )
Seq_NodeSetRing( pObj, Edge, NULL );
else
{
pPrev = Seq_LatPrev( pLat );
pNext = Seq_LatNext( pLat );
Seq_LatSetPrev( pNext, pPrev );
Seq_LatSetNext( pPrev, pNext );
Seq_NodeSetRing( pObj, Edge, pNext ); // rotate the ring
}
Init = Seq_LatInit( pLat );
Seq_NodeRecycleLat( pObj, pLat );
Seq_ObjAddFaninL( pObj, Edge, -1 );
return Init;
}
/**Function*************************************************************
Synopsis [Delete the last Lat on the edge.]
Description []
SideEffects []
SeeAlso []
***********************************************************************/
Abc_InitType_t Seq_NodeDeleteLast( Abc_Obj_t * pObj, int Edge )
{
Abc_InitType_t Init;
Seq_Lat_t * pLat, * pRing, * pPrev, * pNext;
pRing = Seq_NodeGetRing( pObj, Edge );
pLat = Seq_LatPrev( pRing ); // consider the last latch
if ( pLat->pNext == pLat )
Seq_NodeSetRing( pObj, Edge, NULL );
else
{
pPrev = Seq_LatPrev( pLat );
pNext = Seq_LatNext( pLat );
Seq_LatSetPrev( pNext, pPrev );
Seq_LatSetNext( pPrev, pNext );
}
Init = Seq_LatInit( pLat );
Seq_NodeRecycleLat( pObj, pLat );
Seq_ObjAddFaninL( pObj, Edge, -1 );
return Init;
}
/**Function*************************************************************
Synopsis [Insert the last Lat on the edge.]
Description []
SideEffects []
SeeAlso []
***********************************************************************/
void Seq_NodeDupLats( Abc_Obj_t * pObjNew, Abc_Obj_t * pObj, int Edge )
{
Seq_Lat_t * pRing, * pLat;
int i, nLatches;
pRing = Seq_NodeGetRing( pObj, Edge );
if ( pRing == NULL )
return;
nLatches = Seq_NodeCountLats( pObj, Edge );
for ( i = 0, pLat = pRing; i < nLatches; i++, pLat = pLat->pNext )
Seq_NodeInsertLast( pObjNew, Edge, Seq_LatInit(pLat) );
}
/**Function*************************************************************
Synopsis [Insert the last Lat on the edge.]
Description []
SideEffects []
SeeAlso []
***********************************************************************/
int Seq_NodeCompareLats( Abc_Obj_t * pObj1, int Edge1, Abc_Obj_t * pObj2, int Edge2 )
{
Seq_Lat_t * pRing1, * pRing2, * pLat1, * pLat2;
int i, nLatches1, nLatches2;
nLatches1 = Seq_NodeCountLats( pObj1, Edge1 );
nLatches2 = Seq_NodeCountLats( pObj2, Edge2 );
if ( nLatches1 != nLatches2 )
return 0;
pRing1 = Seq_NodeGetRing( pObj1, Edge1 );
pRing2 = Seq_NodeGetRing( pObj2, Edge2 );
for ( i = 0, pLat1 = pRing1, pLat2 = pRing2; i < nLatches1; i++, pLat1 = pLat1->pNext, pLat2 = pLat2->pNext )
if ( Seq_LatInit(pLat1) != Seq_LatInit(pLat2) )
return 0;
return 1;
}
////////////////////////////////////////////////////////////////////////
/// END OF FILE ///
////////////////////////////////////////////////////////////////////////
|
