summaryrefslogtreecommitdiff
path: root/testsuite/tests/perf/should_run/T15226.hs
diff options
context:
space:
mode:
Diffstat (limited to 'testsuite/tests/perf/should_run/T15226.hs')
-rw-r--r--testsuite/tests/perf/should_run/T15226.hs30
1 files changed, 30 insertions, 0 deletions
diff --git a/testsuite/tests/perf/should_run/T15226.hs b/testsuite/tests/perf/should_run/T15226.hs
new file mode 100644
index 0000000000..4c09114b89
--- /dev/null
+++ b/testsuite/tests/perf/should_run/T15226.hs
@@ -0,0 +1,30 @@
+-- T15226
+import Control.Exception (evaluate)
+
+-- Just in case Prelude.repeat changes for some reason.
+import Prelude hiding (repeat)
+
+-- We want to be sure that the compiler *doesn't* know that
+-- all the elements of the list are in WHNF, because if it
+-- does, PrelRules may erase the seq#'s altogether.
+repeat :: a -> [a]
+repeat a = res
+ where res = a : res
+{-# NOINLINE repeat #-} -- Belt *and* suspenders
+
+silly :: [Int] -> IO ()
+silly = foldr go (pure ())
+ where
+ go x r = do
+ x' <- evaluate x
+ evaluate (x' + 3) -- GHC should know that x' has been evaluated,
+ -- so this calculation will be erased entirely.
+ -- Otherwise, we'll create a thunk to pass to
+ -- evaluate.
+ r
+
+main :: IO ()
+-- 10,000,000 repetitions take only a twentieth of a second,
+-- but allocations go up dramatically if the result is not
+-- known evaluated.
+main = silly $ take 10000000 $ repeat 1