diff options
| author | John Ericson <John.Ericson@Obsidian.Systems> | 2022-06-01 00:04:26 +0000 |
|---|---|---|
| committer | John Ericson <John.Ericson@Obsidian.Systems> | 2022-06-02 15:42:59 +0000 |
| commit | 6520da955ec003b3f7ba931e81df4c4f9873f185 (patch) | |
| tree | 4530a1a0be48fffa1eb648be988aca57c5bb91d2 /rts/win32 | |
| parent | d550d9079d6518938a2e41622b1c3ebf1fb24f59 (diff) | |
| download | haskell-6520da955ec003b3f7ba931e81df4c4f9873f185.tar.gz | |
Split out `GHC.HsToCore.{Breakpoints,Coverage}` and use `SizedSeq`
As proposed in
https://gitlab.haskell.org/ghc/ghc/-/merge_requests/7508#note_432877 and
https://gitlab.haskell.org/ghc/ghc/-/merge_requests/7508#note_434676,
`GHC.HsToCore.Ticks` is about ticks, breakpoints are separate and
backend-specific (only for the bytecode interpreter), and mix entry
writing is just for HPC.
With this split we separate out those interpreter- and HPC-specific
its, and keep the main `GHC.HsToCore.Ticks` agnostic.
Also, instead of passing the reversed list and count around, we use
`SizedSeq` which abstracts over the algorithm. This is much nicer to
avoid noise and prevents bugs.
(The bugs are not just hypothetical! I missed up the reverses on an
earlier draft of this commit.)
Diffstat (limited to 'rts/win32')
0 files changed, 0 insertions, 0 deletions