diff options
| author | Johan Tibell <johan.tibell@gmail.com> | 2014-03-23 12:06:56 +0100 |
|---|---|---|
| committer | Johan Tibell <johan.tibell@gmail.com> | 2014-03-29 11:24:07 +0100 |
| commit | 90329b6cc183b3cd05956ae6bdeb6ac6951549c2 (patch) | |
| tree | ba7d31656fe75fad2555c8a66b7ebd13dd9ebeb1 /rts/ProfHeap.c | |
| parent | 4c8edfd2c722504baaa6896d194fd3a8c3f9b652 (diff) | |
| download | haskell-90329b6cc183b3cd05956ae6bdeb6ac6951549c2.tar.gz | |
Add SmallArray# and SmallMutableArray# types
These array types are smaller than Array# and MutableArray# and are
faster when the array size is small, as they don't have the overhead
of a card table. Having no card table reduces the closure size with 2
words in the typical small array case and leads to less work when
updating or GC:ing the array.
Reduces both the runtime and memory allocation by 8.8% on my insert
benchmark for the HashMap type in the unordered-containers package,
which makes use of lots of small arrays. With tuned GC settings
(i.e. `+RTS -A6M`) the runtime reduction is 15%.
Fixes #8923.
Diffstat (limited to 'rts/ProfHeap.c')
| -rw-r--r-- | rts/ProfHeap.c | 8 |
1 files changed, 8 insertions, 0 deletions
diff --git a/rts/ProfHeap.c b/rts/ProfHeap.c index 6d78886e39..d21b14a26d 100644 --- a/rts/ProfHeap.c +++ b/rts/ProfHeap.c @@ -1025,6 +1025,14 @@ heapCensusChain( Census *census, bdescr *bd ) prim = rtsTrue; size = mut_arr_ptrs_sizeW((StgMutArrPtrs *)p); break; + + case SMALL_MUT_ARR_PTRS_CLEAN: + case SMALL_MUT_ARR_PTRS_DIRTY: + case SMALL_MUT_ARR_PTRS_FROZEN: + case SMALL_MUT_ARR_PTRS_FROZEN0: + prim = rtsTrue; + size = small_mut_arr_ptrs_sizeW((StgSmallMutArrPtrs *)p); + break; case TSO: prim = rtsTrue; |