blob: bd450809d0b0387c8d644d2c9a3cfc3ff9c8978c (
plain)
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
|
/*
* (c)2014 Tweag I/O
*
* The Static Pointer Table implementation.
*
* https://ghc.haskell.org/trac/ghc/wiki/StaticPointers
* https://ghc.haskell.org/trac/ghc/wiki/StaticPointers/ImplementationPlan
*
*/
#include "Rts.h"
#include "StaticPtrTable.h"
#include "Hash.h"
static HashTable * spt = NULL;
/// Hash function for the SPT.
static int hashFingerprint(HashTable *table, StgWord64 key[2]) {
// Take half of the key to compute the hash.
return hashWord(table, (StgWord)key[1]);
}
/// Comparison function for the SPT.
static int compareFingerprint(StgWord64 ptra[2], StgWord64 ptrb[2]) {
return ptra[0] == ptrb[0] && ptra[1] == ptrb[1];
}
void hs_spt_insert(StgWord64 key[2],void *spe_closure) {
// hs_spt_insert is called from constructor functions, so
// the SPT needs to be initialized here.
if (spt == NULL)
spt = allocHashTable_( (HashFunction *)hashFingerprint
, (CompareFunction *)compareFingerprint
);
getStablePtr(spe_closure);
insertHashTable(spt, (StgWord)key, spe_closure);
}
StgPtr hs_spt_lookup(StgWord64 key[2]) {
return spt ? lookupHashTable(spt, (StgWord)key) : NULL;
}
int hs_spt_keys(StgPtr keys[], int szKeys) {
return spt ? keysHashTable(spt, (StgWord*)keys, szKeys) : 0;
}
int hs_spt_key_count() {
return spt ? keyCountHashTable(spt) : 0;
}
void exitStaticPtrTable() {
if (spt) {
freeHashTable(spt, NULL);
spt = NULL;
}
}
|
