diff options
| author | Facundo Domínguez <facundo.dominguez@tweag.io> | 2014-12-09 18:10:18 -0600 |
|---|---|---|
| committer | Austin Seipp <austin@well-typed.com> | 2014-12-09 19:59:27 -0600 |
| commit | fc45f32491313d2a44e72d8d59cdf95b1660189d (patch) | |
| tree | 853de68ce9feca6a61d2b540ef13fc03162740de /rts/Hash.c | |
| parent | e5974f8f53de4c97cfaad228eedfca8b31b53887 (diff) | |
| download | haskell-fc45f32491313d2a44e72d8d59cdf95b1660189d.tar.gz | |
Implement -XStaticValues
Summary:
As proposed in [1], this extension introduces a new syntactic form
`static e`, where `e :: a` can be any closed expression. The static form
produces a value of type `StaticPtr a`, which works as a reference that
programs can "dereference" to get the value of `e` back. References are
like `Ptr`s, except that they are stable across invocations of a
program.
The relevant wiki pages are [2, 3], which describe the motivation/ideas
and implementation plan respectively.
[1] Jeff Epstein, Andrew P. Black, and Simon Peyton-Jones. Towards
Haskell in the cloud. SIGPLAN Not., 46(12):118–129, September 2011. ISSN
0362-1340.
[2] https://ghc.haskell.org/trac/ghc/wiki/StaticPointers
[3] https://ghc.haskell.org/trac/ghc/wiki/StaticPointers/ImplementationPlan
Authored-by: Facundo Domínguez <facundo.dominguez@tweag.io>
Authored-by: Mathieu Boespflug <m@tweag.io>
Authored-by: Alexander Vershilov <alexander.vershilov@tweag.io>
Test Plan: `./validate`
Reviewers: hvr, simonmar, simonpj, austin
Reviewed By: simonpj, austin
Subscribers: qnikst, bgamari, mboes, carter, thomie, goldfire
Differential Revision: https://phabricator.haskell.org/D550
GHC Trac Issues: #7015
Diffstat (limited to 'rts/Hash.c')
| -rw-r--r-- | rts/Hash.c | 23 |
1 files changed, 23 insertions, 0 deletions
diff --git a/rts/Hash.c b/rts/Hash.c index b91d70c219..1881092851 100644 --- a/rts/Hash.c +++ b/rts/Hash.c @@ -206,6 +206,29 @@ lookupHashTable(HashTable *table, StgWord key) return NULL; } +// Puts up to keys_sz keys of the hash table into the given array. Returns the +// actual amount of keys that have been retrieved. +// +// If the table is modified concurrently, the function behavior is undefined. +// +int keysHashTable(HashTable *table, StgWord keys[], int szKeys) { + int segment; + int k = 0; + for(segment=0;segment<HDIRSIZE && table->dir[segment];segment+=1) { + int index; + for(index=0;index<HSEGSIZE;index+=1) { + HashList *hl; + for(hl=table->dir[segment][index];hl;hl=hl->next) { + if (k == szKeys) + return k; + keys[k] = hl->key; + k += 1; + } + } + } + return k; +} + /* ----------------------------------------------------------------------------- * We allocate the hashlist cells in large chunks to cut down on malloc * overhead. Although we keep a free list of hashlist cells, we make |