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
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
|
/**CFile****************************************************************
FileName [vecHsh.h]
SystemName [ABC: Logic synthesis and verification system.]
PackageName [Resizable arrays.]
Synopsis [Hashing vector entries.]
Author [Alan Mishchenko]
Affiliation [UC Berkeley]
Date [Ver. 1.0. Started - June 20, 2005.]
Revision [$Id: vecHsh.h,v 1.00 2005/06/20 00:00:00 alanmi Exp $]
***********************************************************************/
#ifndef ABC__misc__vec__vecHsh_h
#define ABC__misc__vec__vecHsh_h
////////////////////////////////////////////////////////////////////////
/// INCLUDES ///
////////////////////////////////////////////////////////////////////////
#include <stdio.h>
ABC_NAMESPACE_HEADER_START
////////////////////////////////////////////////////////////////////////
/// PARAMETERS ///
////////////////////////////////////////////////////////////////////////
////////////////////////////////////////////////////////////////////////
/// BASIC TYPES ///
////////////////////////////////////////////////////////////////////////
typedef struct Hsh_IntObj_t_ Hsh_IntObj_t;
struct Hsh_IntObj_t_
{
int iData;
int iNext;
};
typedef union Hsh_IntObjWord_t_ Hsh_IntObjWord_t;
union Hsh_IntObjWord_t_
{
Hsh_IntObj_t wObj;
word wWord;
};
typedef struct Hsh_IntMan_t_ Hsh_IntMan_t;
struct Hsh_IntMan_t_
{
int nSize; // data size
Vec_Int_t * vData; // data storage
Vec_Int_t * vTable; // hash table
Vec_Wrd_t * vObjs; // hash objects
};
typedef struct Hsh_VecObj_t_ Hsh_VecObj_t;
struct Hsh_VecObj_t_
{
int nSize;
int iNext;
int pArray[0];
};
typedef struct Hsh_VecMan_t_ Hsh_VecMan_t;
struct Hsh_VecMan_t_
{
Vec_Int_t * vTable; // hash table
Vec_Int_t * vData; // data storage
Vec_Int_t * vMap; // mapping entries into data;
Vec_Int_t vTemp; // temporary array
Vec_Int_t vTemp1; // temporary array
Vec_Int_t vTemp2; // temporary array
};
////////////////////////////////////////////////////////////////////////
/// MACRO DEFINITIONS ///
////////////////////////////////////////////////////////////////////////
static inline unsigned * Hsh_IntData( Hsh_IntMan_t * p, int iData ) { return (unsigned *)Vec_IntEntryP( p->vData, p->nSize * iData ); }
static inline Hsh_IntObj_t * Hsh_IntObj( Hsh_IntMan_t * p, int iObj ) { return iObj == -1 ? NULL : (Hsh_IntObj_t *)Vec_WrdEntryP( p->vObjs, iObj ); }
static inline word Hsh_IntWord( int iData, int iNext ) { Hsh_IntObjWord_t Obj = { {iData, iNext} }; return Obj.wWord; }
static inline Hsh_VecObj_t * Hsh_VecObj( Hsh_VecMan_t * p, int i ) { return i == -1 ? NULL : (Hsh_VecObj_t *)Vec_IntEntryP(p->vData, Vec_IntEntry(p->vMap, i)); }
////////////////////////////////////////////////////////////////////////
/// FUNCTION DEFINITIONS ///
////////////////////////////////////////////////////////////////////////
/**Function*************************************************************
Synopsis [Hashing data entries composed of nSize integers.]
Description []
SideEffects []
SeeAlso []
***********************************************************************/
static inline Hsh_IntMan_t * Hsh_IntManStart( Vec_Int_t * vData, int nSize, int nEntries )
{
Hsh_IntMan_t * p;
p = ABC_CALLOC( Hsh_IntMan_t, 1 );
p->nSize = nSize;
p->vData = vData;
p->vTable = Vec_IntStartFull( Abc_PrimeCudd(nEntries) );
p->vObjs = Vec_WrdAlloc( nEntries );
return p;
}
static inline void Hsh_IntManStop( Hsh_IntMan_t * p )
{
Vec_IntFree( p->vTable );
Vec_WrdFree( p->vObjs );
ABC_FREE( p );
}
static inline int Hsh_IntManEntryNum( Hsh_IntMan_t * p )
{
return Vec_WrdSize(p->vObjs);
}
/**Function*************************************************************
Synopsis []
Description []
SideEffects []
SeeAlso []
***********************************************************************/
static inline int Hsh_IntManHash( unsigned * pData, int nSize, int nTableSize )
{
static int s_Primes[7] = { 4177, 5147, 5647, 6343, 7103, 7873, 8147 };
unsigned char * pDataC = (unsigned char *)pData;
int c, nChars = nSize * 4;
unsigned Key = 0;
for ( c = 0; c < nChars; c++ )
Key += pDataC[c] * s_Primes[c % 7];
return (int)(Key % nTableSize);
}
static inline int * Hsh_IntManLookup( Hsh_IntMan_t * p, unsigned * pData )
{
Hsh_IntObj_t * pObj;
int * pPlace = Vec_IntEntryP( p->vTable, Hsh_IntManHash(pData, p->nSize, Vec_IntSize(p->vTable)) );
for ( ; (pObj = Hsh_IntObj(p, *pPlace)); pPlace = &pObj->iNext )
if ( !memcmp( pData, Hsh_IntData(p, pObj->iData), sizeof(int) * p->nSize ) )
return pPlace;
assert( *pPlace == -1 );
return pPlace;
}
static inline int Hsh_IntManAdd( Hsh_IntMan_t * p, int iData )
{
int i, * pPlace;
if ( Vec_WrdSize(p->vObjs) > Vec_IntSize(p->vTable) )
{
Vec_IntFill( p->vTable, Abc_PrimeCudd(2*Vec_IntSize(p->vTable)), -1 );
for ( i = 0; i < Vec_WrdSize(p->vObjs); i++ )
{
pPlace = Vec_IntEntryP( p->vTable, Hsh_IntManHash(Hsh_IntData(p, Hsh_IntObj(p, i)->iData), p->nSize, Vec_IntSize(p->vTable)) );
Hsh_IntObj(p, i)->iNext = *pPlace; *pPlace = i;
}
}
pPlace = Hsh_IntManLookup( p, Hsh_IntData(p, iData) );
if ( *pPlace == -1 )
{
*pPlace = Vec_WrdSize(p->vObjs);
Vec_WrdPush( p->vObjs, Hsh_IntWord(iData, -1) );
return Vec_WrdSize(p->vObjs) - 1;
}
return (word *)Hsh_IntObj(p, *pPlace) - Vec_WrdArray(p->vObjs);
}
/**Function*************************************************************
Synopsis [Hashes data by value.]
Description [Array vData contains data entries, each of 'nSize' integers.
The resulting array contains the indexes of unique data entries.]
SideEffects []
SeeAlso []
***********************************************************************/
static inline Vec_Int_t * Hsh_IntManHashArray( Vec_Int_t * vData, int nSize )
{
Hsh_IntMan_t * p;
Vec_Int_t * vRes = Vec_IntAlloc( 100 );
int i, nEntries = Vec_IntSize(vData) / nSize;
assert( Vec_IntSize(vData) % nSize == 0 );
p = Hsh_IntManStart( vData, nSize, nEntries );
for ( i = 0; i < nEntries; i++ )
Vec_IntPush( vRes, Hsh_IntManAdd(p, i) );
Hsh_IntManStop( p );
return vRes;
}
static inline Vec_Int_t * Hsh_WrdManHashArray( Vec_Wrd_t * vDataW, int nSize )
{
Hsh_IntMan_t * p;
Vec_Int_t Data = { 2*Vec_WrdCap(vDataW), 2*Vec_WrdSize(vDataW), (int *)Vec_WrdArray(vDataW) };
Vec_Int_t * vData = &Data;
Vec_Int_t * vRes = Vec_IntAlloc( 100 );
int i, nEntries = Vec_IntSize(vData) / (2*nSize);
assert( Vec_IntSize(vData) % (2*nSize) == 0 );
p = Hsh_IntManStart( vData, (2*nSize), nEntries );
for ( i = 0; i < nEntries; i++ )
Vec_IntPush( vRes, Hsh_IntManAdd(p, i) );
Hsh_IntManStop( p );
return vRes;
}
static inline Hsh_IntMan_t * Hsh_WrdManHashArrayStart( Vec_Wrd_t * vDataW, int nSize )
{
Hsh_IntMan_t * p;
int i, nEntries = Vec_WrdSize(vDataW) / nSize;
Vec_Int_t * vData = Vec_IntAlloc( 2*Vec_WrdSize(vDataW) );
memcpy( Vec_IntArray(vData), Vec_WrdArray(vDataW), sizeof(word)*Vec_WrdSize(vDataW) );
vData->nSize = 2*Vec_WrdSize(vDataW);
/*
for ( i = 0; i < 30; i++ )
{
extern void Extra_PrintHex( FILE * pFile, unsigned * pTruth, int nVars );
Extra_PrintHex( stdout, (unsigned *) Vec_WrdEntryP(vDataW, i), 6 ); printf( " " );
Kit_DsdPrintFromTruth( (unsigned *) Vec_WrdEntryP(vDataW, i), 6 ); printf( "\n" );
}
*/
assert( Vec_IntSize(vData) % (2*nSize) == 0 );
p = Hsh_IntManStart( vData, (2*nSize), nEntries );
for ( i = 0; i < nEntries; i++ )
Hsh_IntManAdd( p, i );
assert( Vec_WrdSize(p->vObjs) == nEntries );
return p;
}
/**Function*************************************************************
Synopsis [Test procedure.]
Description []
SideEffects []
SeeAlso []
***********************************************************************/
static inline void Hsh_IntManHashArrayTest()
{
Vec_Int_t * vData = Vec_IntAlloc( 10 );
Vec_Int_t * vRes;
Vec_IntPush( vData, 12 );
Vec_IntPush( vData, 17 );
Vec_IntPush( vData, 13 );
Vec_IntPush( vData, 12 );
Vec_IntPush( vData, 15 );
Vec_IntPush( vData, 3 );
Vec_IntPush( vData, 16 );
Vec_IntPush( vData, 16 );
Vec_IntPush( vData, 12 );
Vec_IntPush( vData, 17 );
Vec_IntPush( vData, 12 );
Vec_IntPush( vData, 12 );
vRes = Hsh_IntManHashArray( vData, 2 );
Vec_IntPrint( vData );
Vec_IntPrint( vRes );
Vec_IntFree( vData );
Vec_IntFree( vRes );
}
/**Function*************************************************************
Synopsis [Hashing integer arrays.]
Description []
SideEffects []
SeeAlso []
***********************************************************************/
static inline Hsh_VecMan_t * Hsh_VecManStart( int nEntries )
{
Hsh_VecMan_t * p;
p = ABC_CALLOC( Hsh_VecMan_t, 1 );
p->vTable = Vec_IntStartFull( Abc_PrimeCudd(nEntries) );
p->vData = Vec_IntAlloc( nEntries * 4 );
p->vMap = Vec_IntAlloc( nEntries );
return p;
}
static inline void Hsh_VecManStop( Hsh_VecMan_t * p )
{
Vec_IntFree( p->vTable );
Vec_IntFree( p->vData );
Vec_IntFree( p->vMap );
ABC_FREE( p );
}
static inline int * Hsh_VecReadArray( Hsh_VecMan_t * p, int i )
{
return (int*)Hsh_VecObj(p, i) + 2;
}
static inline Vec_Int_t * Hsh_VecReadEntry( Hsh_VecMan_t * p, int i )
{
Hsh_VecObj_t * pObj = Hsh_VecObj( p, i );
p->vTemp.nSize = p->vTemp.nCap = pObj->nSize;
p->vTemp.pArray = (int*)pObj + 2;
return &p->vTemp;
}
static inline Vec_Int_t * Hsh_VecReadEntry1( Hsh_VecMan_t * p, int i )
{
Hsh_VecObj_t * pObj = Hsh_VecObj( p, i );
p->vTemp1.nSize = p->vTemp1.nCap = pObj->nSize;
p->vTemp1.pArray = (int*)pObj + 2;
return &p->vTemp1;
}
static inline Vec_Int_t * Hsh_VecReadEntry2( Hsh_VecMan_t * p, int i )
{
Hsh_VecObj_t * pObj = Hsh_VecObj( p, i );
p->vTemp2.nSize = p->vTemp2.nCap = pObj->nSize;
p->vTemp2.pArray = (int*)pObj + 2;
return &p->vTemp2;
}
static inline int Hsh_VecSize( Hsh_VecMan_t * p )
{
return Vec_IntSize(p->vMap);
}
/**Function*************************************************************
Synopsis []
Description []
SideEffects []
SeeAlso []
***********************************************************************/
static inline int Hsh_VecManHash( Vec_Int_t * vVec, int nTableSize )
{
static unsigned s_Primes[7] = {4177, 5147, 5647, 6343, 7103, 7873, 8147};
unsigned Key = 0;
int i, Entry;
Vec_IntForEachEntry( vVec, Entry, i )
Key += (unsigned)Entry * s_Primes[i % 7];
return (int)(Key % nTableSize);
}
static inline int Hsh_VecManAdd( Hsh_VecMan_t * p, Vec_Int_t * vVec )
{
Hsh_VecObj_t * pObj;
int i, Ent, * pPlace;
if ( Vec_IntSize(p->vMap) > Vec_IntSize(p->vTable) )
{
Vec_IntFill( p->vTable, Abc_PrimeCudd(2*Vec_IntSize(p->vTable)), -1 );
for ( i = 0; i < Vec_IntSize(p->vMap); i++ )
{
pPlace = Vec_IntEntryP( p->vTable, Hsh_VecManHash(Hsh_VecReadEntry(p, i), Vec_IntSize(p->vTable)) );
Hsh_VecObj(p, i)->iNext = *pPlace; *pPlace = i;
}
}
pPlace = Vec_IntEntryP( p->vTable, Hsh_VecManHash(vVec, Vec_IntSize(p->vTable)) );
for ( ; (pObj = Hsh_VecObj(p, *pPlace)); pPlace = &pObj->iNext )
if ( pObj->nSize == Vec_IntSize(vVec) && !memcmp( pObj->pArray, Vec_IntArray(vVec), sizeof(int) * pObj->nSize ) )
return *pPlace;
*pPlace = Vec_IntSize(p->vMap);
assert( Vec_IntSize(p->vData) % 2 == 0 );
Vec_IntPush( p->vMap, Vec_IntSize(p->vData) );
Vec_IntPush( p->vData, Vec_IntSize(vVec) );
Vec_IntPush( p->vData, -1 );
Vec_IntForEachEntry( vVec, Ent, i )
Vec_IntPush( p->vData, Ent );
if ( Vec_IntSize(vVec) & 1 )
Vec_IntPush( p->vData, -1 );
return Vec_IntSize(p->vMap) - 1;
}
/**Function*************************************************************
Synopsis [Test procedure.]
Description []
SideEffects []
SeeAlso []
***********************************************************************/
static inline void Hsh_VecManHashTest()
{
Hsh_VecMan_t * p;
Vec_Int_t * vTemp;
Vec_Int_t * vRes = Vec_IntAlloc( 1000 );
int i;
p = Hsh_VecManStart( 5 );
for ( i = 0; i < 20; i++ )
{
vTemp = Vec_IntStartNatural( i );
Vec_IntPush( vRes, Hsh_VecManAdd( p, vTemp ) );
Vec_IntFree( vTemp );
}
for ( ; i > 0; i-- )
{
vTemp = Vec_IntStartNatural( i );
Vec_IntPush( vRes, Hsh_VecManAdd( p, vTemp ) );
Vec_IntFree( vTemp );
}
Vec_IntPrint( vRes );
Vec_IntFree( vRes );
Hsh_VecManStop( p );
}
////////////////////////////////////////////////////////////////////////
/// END OF FILE ///
////////////////////////////////////////////////////////////////////////
ABC_NAMESPACE_HEADER_END
#endif
|
