mueval-0.4.5: tests.sh

#!/bin/sh
# tests

# Save typing
m () { mueval --expression "$@"; }
# Redefine a failed command to be successful
mf () { m "$@" || return 0; }

# Abort if any commands aren't successful
set -e
# Test on valid expressions. Note we conditionalize - all of these should return successfully.
echo "Test some valid expressions \n"
## Does anything work?
m '1*100+1'
## OK, let's try some simple math.
m '(1*100) +1+1' --module Control.Monad
## String processing
m "filter (\`notElem\` ['A'..'Z']) \"abcXsdzWEE\""
## see whether we gave it enough resources to do reasonably long stuff
m "(last \"nebbish\") : (head $ reverse \"fooo bar baz booooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooreally long strong, you must confess, at least relative to the usual string, I suppose\") : []"
m 'let return a k = k a ; m >>= f = m . flip f ; foldM f z [] = return z ; foldM f z (x:xs) = f z x >>= \fzx -> foldM f fzx xs ; control e k = e (\a -> const (k a)) id in foldM (\p n -> if n == 0 then control (const $ return 0) else return (p * n)) 1 [-10..] id'
## Test whether we can import multiple modules
m 'join [[1]]' --module Data.List --module Control.Monad --module Data.Char
m 'join ["baz"]' --module Data.List --module Data.Char --module Control.Monad
m 'map toUpper "foobar"' --module Data.List --module Data.Char --module Control.Monad
m 'tail $ take 50 $ repeat "foo"' --module Data.List --timelimit 3
## This tests whether the SimpleReflect stuff is working. Output should be: "(f 1 (f 2 (f 3 (f 4 (f 5 z)))))\"
m 'foldr (\x y -> concat ["(f ",x," ",y,")"]) "z" (map show [1..5])'

# Test on bad or outright evil expressions
echo "\n Now let's test various misbehaved expressions \n" &&
## test infinite loop
mf 'let x = x in x'
mf 'let x y = x 1 in x 1' --timelimit 3
mf 'let x = x + 1 in x'
## Similarly, but with a strict twist
mf 'let f :: Int -> Int; f x = f $! (x+1) in f 0'
## test stack limits
mf 'let x = 1 + x in x'
## Let's stress the time limits
mf 'let {p x y f = f x y; f x = p x x} in f (f (f (f (f (f (f (f (f (f (f (f (f (f (f (f (f (f (f f)))))))))))))))))) f'
## Now let's test the module whitelisting
mf 1+1 --module Data.List --module System.IO.Unsafe --module Control.Monad
mf "let foo = unsafePerformIO readFile \"/etc/passwd\" in foo" --module System.IO.Unsafe
mf "head [1..]" --module Data.List --module Text.HTML.Download
### Can we bypass the whitelisting by fully qualified module names?
mf "Foreign.unsafePerformIO $ readFile \"/etc/passwd\""
mf "Data.ByteString.Internal.inlinePerformIO $ readFile \"/etc/passwd\""
## We need a bunch of IO tests, but I guess this will do for now.
mf "let foo = readFile \"/etc/passwd\" >>= print in foo"
mf "writeFile \"tmp.txt\" \"foo bar\""
## Evil array code, should fail (but not with a segfault!)
mf  "array (0::Int, maxBound) [(1000000,'x')]" --module Data.Array
echo "Done, apparently successfully"