summaryrefslogtreecommitdiff
path: root/testsuite/tests/numeric/should_run/all.T
diff options
context:
space:
mode:
authorSebastian Graf <sebastian.graf@kit.edu>2018-05-15 13:12:56 -0400
committerBen Gamari <ben@smart-cactus.org>2018-05-15 13:12:57 -0400
commitbb338f2eb706a3137bf6675e3ddbf96d4fe4f4aa (patch)
treed45b57439ca4d1d8dc0a7e820acd8366b11135c7 /testsuite/tests/numeric/should_run/all.T
parent01b15b88639443bec12415b6b0d906261bd6c047 (diff)
downloadhaskell-bb338f2eb706a3137bf6675e3ddbf96d4fe4f4aa.tar.gz
Algebraically simplify add/sub with carry/overflow
Previously, the `{add,sub}{Int,Word}C#` PrimOps weren't handled in PrelRules (constant folding and algebraic simplification) at all. This implements the necessary logic, so that using these primitives isn't too punishing compared to their well-optimised, overflow-unaware counterparts. This is so that using these primitives in `enumFromThenTo @Int` can be optimized by constant folding, reducing closure sizes. Reviewers: bgamari, simonpj, hsyl20 Reviewed By: bgamari, simonpj Subscribers: AndreasK, thomie, carter GHC Trac Issues: #8763 Differential Revision: https://phabricator.haskell.org/D4605
Diffstat (limited to 'testsuite/tests/numeric/should_run/all.T')
-rw-r--r--testsuite/tests/numeric/should_run/all.T2
1 files changed, 1 insertions, 1 deletions
diff --git a/testsuite/tests/numeric/should_run/all.T b/testsuite/tests/numeric/should_run/all.T
index 37fff44bde..691fc26f7a 100644
--- a/testsuite/tests/numeric/should_run/all.T
+++ b/testsuite/tests/numeric/should_run/all.T
@@ -62,6 +62,6 @@ test('CarryOverflow', omit_ways(['ghci']), compile_and_run, [''])
test('T9407', normal, compile_and_run, [''])
test('T9810', normal, compile_and_run, [''])
test('T10011', normal, compile_and_run, [''])
-test('T10962', omit_ways(['ghci']), compile_and_run, [''])
+test('T10962', omit_ways(['ghci']), compile_and_run, ['-O2'])
test('T11702', extra_ways(['optasm']), compile_and_run, [''])
test('T12136', normal, compile_and_run, [''])