summaryrefslogtreecommitdiff
diff options
context:
space:
mode:
authorBen Gamari <ben@smart-cactus.org>2019-11-17 11:43:54 -0500
committerMarge Bot <ben+marge-bot@smart-cactus.org>2019-11-19 11:57:36 -0500
commita7571a74df15585a48318267a3f8e995fa1270b2 (patch)
treec4d090a066d7f0fe8252e7dd70c4d40c362b4254
parenteb7b233a3db9f3958bdf8d8eb6c76c6d9f00f5b9 (diff)
downloadhaskell-a7571a74df15585a48318267a3f8e995fa1270b2.tar.gz
testsuite: Increase width of stack003 test
Previously the returned tuple seemed to fit in registers on amd64. This meant that non-moving collector bug would cause the test to fail on i386 yet not amd64.
-rw-r--r--testsuite/tests/rts/stack003.hs16
1 files changed, 11 insertions, 5 deletions
diff --git a/testsuite/tests/rts/stack003.hs b/testsuite/tests/rts/stack003.hs
index 4b6b29fa8d..2ca5745f5e 100644
--- a/testsuite/tests/rts/stack003.hs
+++ b/testsuite/tests/rts/stack003.hs
@@ -6,12 +6,18 @@ import System.Environment
main = do
[n] <- fmap (fmap read) getArgs
case g n of
- (# a, b, c, d, e, f, g, h, i #) -> print a
+ (# a, b, c, d, e, f, g, h, i, j, k, l #) -> print a
-- a deep stack in which each frame is an unboxed tuple-return, to exercise
-- the stack underflow machinery.
-g :: Int -> (# Int,Float,Double,Int#,Float#,Double#,Int,Float,Double #)
-g 0 = (# 1, 2.0, 3.0, 1#, 2.0#, 3.0##, 1, 2.0, 3.0 #)
+g :: Int -> (# Int,Float,Double,
+ Int#,Float#,Double#,
+ Int,Float,Double,
+ Int#,Float#,Double# #)
+g 0 = (# 1, 2.0, 3.0,
+ 1#, 2.0#, 3.0##,
+ 1, 2.0, 3.0,
+ 1#, 2.0#, 3.0## #)
g x = case g (x-1) of
- (# a, b, c, d, e, f, g, h, i #) ->
- (# a+1, b, c, d, e, f, g, h, i #)
+ (# a, b, c, d, e, f, g, h, i, j, k, l #) ->
+ (# a+1, b, c, d, e, f, g, h, i, j, k, l #)