diff options
| author | Sylvain Henry <sylvain@haskus.fr> | 2022-06-02 15:42:03 +0000 |
|---|---|---|
| committer | John Ericson <John.Ericson@Obsidian.Systems> | 2022-06-02 15:43:14 +0000 |
| commit | 1838c3d8ed53bdd6750037f5cbbce771369820d5 (patch) | |
| tree | e358c089b045f62a884f0bc41f25c73139726587 | |
| parent | 6520da955ec003b3f7ba931e81df4c4f9873f185 (diff) | |
| download | haskell-1838c3d8ed53bdd6750037f5cbbce771369820d5.tar.gz | |
GHC.HsToCore.Breakpoints: Slightly improve perf
We have the length already, so we might as well use that rather than
O(n) recomputing it.
| -rw-r--r-- | compiler/GHC/HsToCore/Breakpoints.hs | 2 |
1 files changed, 1 insertions, 1 deletions
diff --git a/compiler/GHC/HsToCore/Breakpoints.hs b/compiler/GHC/HsToCore/Breakpoints.hs index 98d302efe8..bbf88fa5ee 100644 --- a/compiler/GHC/HsToCore/Breakpoints.hs +++ b/compiler/GHC/HsToCore/Breakpoints.hs @@ -25,7 +25,7 @@ mkModBreaks interp mod extendedMixEntries let count = fromIntegral $ sizeSS extendedMixEntries entries = ssElts extendedMixEntries - breakArray <- GHCi.newBreakArray interp (length entries) + breakArray <- GHCi.newBreakArray interp count ccs <- mkCCSArray interp mod count entries let locsTicks = listArray (0,count-1) [ tick_loc t | t <- entries ] |