dejafu/hunit-dejafu/Test/HUnit/DejaFu.hs

199 lines
6.6 KiB
Haskell
Raw Normal View History

{-# LANGUAGE RankNTypes #-}
-- | This module allows using Deja Fu predicates with HUnit to test
-- the behaviour of concurrent systems.
module Test.HUnit.DejaFu
( -- * Testing
testAuto
, testDejafu
, testDejafus
, testAutoIO
, testDejafuIO
, testDejafusIO
-- * Testing under Alternative Memory Models
, MemType(..)
, testAuto'
, testAutoIO'
2015-10-08 17:45:05 +03:00
, testDejafu'
, testDejafus'
2015-10-08 17:45:05 +03:00
, testDejafuIO'
, testDejafusIO'
) where
import Test.DejaFu
import Test.DejaFu.Deterministic (Conc, showFail, showTrace)
import Test.DejaFu.Deterministic.IO (ConcIO)
import Test.DejaFu.SCT (sctPFBound, sctPFBoundIO)
2015-10-08 23:15:46 +03:00
import Test.HUnit (Test(..), assertString)
--------------------------------------------------------------------------------
-- Automated testing
-- | Automatically test a computation. In particular, look for
-- deadlocks, uncaught exceptions, and multiple return values.
--
-- This uses the 'Conc' monad for testing, which is an instance of
-- 'MonadConc'. If you need to test something which also uses
-- 'MonadIO', use 'testAutoIO'.
testAuto :: (Eq a, Show a)
=> (forall t. Conc t a)
-- ^ The computation to test
2015-10-08 23:09:48 +03:00
-> Test
testAuto = testAuto' TotalStoreOrder
-- | Variant of 'testAuto' which tests a computation under a given
-- memory model.
testAuto' :: (Eq a, Show a)
=> MemType
-- ^ The memory model to use for non-synchronised @CRef@ operations.
-> (forall t. Conc t a)
-- ^ The computation to test
2015-10-08 23:09:48 +03:00
-> Test
testAuto' memtype conc = testDejafus' memtype 2 5 conc autocheckCases
-- | Variant of 'testAuto' for computations which do 'IO'.
2015-10-08 23:09:48 +03:00
testAutoIO :: (Eq a, Show a) => (forall t. ConcIO t a) -> Test
testAutoIO = testAutoIO' TotalStoreOrder
-- | Variant of 'testAuto'' for computations which do 'IO'.
2015-10-08 23:09:48 +03:00
testAutoIO' :: (Eq a, Show a) => MemType -> (forall t. ConcIO t a) -> Test
testAutoIO' memtype concio = testDejafusIO' memtype 2 5 concio autocheckCases
-- | Predicates for the various autocheck functions.
autocheckCases :: Eq a => [(String, Predicate a)]
autocheckCases =
[("Never Deadlocks", deadlocksNever)
, ("No Exceptions", exceptionsNever)
, ("Consistent Result", alwaysSame)
]
--------------------------------------------------------------------------------
-- Manual testing
-- | Check that a predicate holds.
2015-10-25 20:05:40 +03:00
testDejafu :: Show a
=> (forall t. Conc t a)
-- ^ The computation to test
-> String
-- ^ The name of the test.
-> Predicate a
-- ^ The predicate to check
2015-10-08 23:09:48 +03:00
-> Test
testDejafu = testDejafu' TotalStoreOrder 2 5
2015-10-08 17:45:05 +03:00
-- | Variant of 'testDejafu' which takes a memory model and
-- pre-emption bound.
2015-10-25 20:05:40 +03:00
testDejafu' :: Show a
2015-10-08 17:45:05 +03:00
=> MemType
-- ^ The memory model to use for non-synchronised @CRef@ operations.
-> Int
-- ^ The maximum number of pre-emptions to allow in a single
-- execution
-> Int
-- ^ The maximum difference between the number of yield operations
-- across all threads.
2015-10-08 17:45:05 +03:00
-> (forall t. Conc t a)
-- ^ The computation to test
-> String
-- ^ The name of the test.
-> Predicate a
-- ^ The predicate to check
2015-10-08 23:09:48 +03:00
-> Test
testDejafu' memtype pb fb conc name p = testDejafus' memtype pb fb conc [(name, p)]
-- | Variant of 'testDejafu' which takes a collection of predicates to
-- test. This will share work between the predicates, rather than
-- running the concurrent computation many times for each predicate.
2015-10-25 20:05:40 +03:00
testDejafus :: Show a
=> (forall t. Conc t a)
-- ^ The computation to test
-> [(String, Predicate a)]
-- ^ The list of predicates (with names) to check
2015-10-08 23:09:48 +03:00
-> Test
testDejafus = testDejafus' TotalStoreOrder 2 5
-- | Variant of 'testDejafus' which takes a memory model and pre-emption
-- bound.
2015-10-25 20:05:40 +03:00
testDejafus' :: Show a
=> MemType
-- ^ The memory model to use for non-synchronised @CRef@ operations.
-> Int
-- ^ The maximum number of pre-emptions to allow in a single
-- execution
-> Int
-- ^ The maximum difference between the number of yield operations
-- across all threads.
-> (forall t. Conc t a)
-- ^ The computation to test
-> [(String, Predicate a)]
-- ^ The list of predicates (with names) to check
2015-10-08 23:09:48 +03:00
-> Test
2015-10-08 23:15:46 +03:00
testDejafus' = test
-- | Variant of 'testDejafu' for computations which do 'IO'.
2015-10-25 20:05:40 +03:00
testDejafuIO :: Show a => (forall t. ConcIO t a) -> String -> Predicate a -> Test
testDejafuIO = testDejafuIO' TotalStoreOrder 2 5
2015-10-08 17:45:05 +03:00
-- | Variant of 'testDejafu'' for computations which do 'IO'.
testDejafuIO' :: Show a => MemType -> Int -> Int -> (forall t. ConcIO t a) -> String -> Predicate a -> Test
testDejafuIO' memtype pb fb concio name p = testDejafusIO' memtype pb fb concio [(name, p)]
-- | Variant of 'testDejafus' for computations which do 'IO'.
2015-10-25 20:05:40 +03:00
testDejafusIO :: Show a => (forall t. ConcIO t a) -> [(String, Predicate a)] -> Test
testDejafusIO = testDejafusIO' TotalStoreOrder 2 5
-- | Variant of 'dejafus'' for computations which do 'IO'.
testDejafusIO' :: Show a => MemType -> Int -> Int -> (forall t. ConcIO t a) -> [(String, Predicate a)] -> Test
2015-10-08 23:15:46 +03:00
testDejafusIO' = testio
--------------------------------------------------------------------------------
-- HUnit integration
2015-10-08 23:15:46 +03:00
-- | Produce a HUnit 'Test' from a Deja Fu test.
test :: Show a => MemType -> Int -> Int -> (forall t. Conc t a) -> [(String, Predicate a)] -> Test
test memtype pb fb conc tests = case map toTest tests of
2015-10-08 23:15:46 +03:00
[t] -> t
ts -> TestList ts
where
toTest (name, p) = TestLabel name . TestCase $
assertString . showErr $ p traces
traces = sctPFBound memtype pb fb conc
2015-10-08 23:15:46 +03:00
-- | Produce a HUnit 'Test' from an IO-using Deja Fu test.
testio :: Show a => MemType -> Int -> Int -> (forall t. ConcIO t a) -> [(String, Predicate a)] -> Test
testio memtype pb fb concio tests = case map toTest tests of
2015-10-08 23:15:46 +03:00
[t] -> t
ts -> TestList ts
where
toTest (name, p) = TestLabel name . TestCase $ do
-- Sharing of traces probably not possible (without something
-- really unsafe) here, as 'test' doesn't allow side-effects
-- (eg, constructing an 'MVar' to share the traces after one
-- test computed them).
traces <- sctPFBoundIO memtype pb fb concio
2015-10-08 23:15:46 +03:00
assertString . showErr $ p traces
-- | Convert a test result into an error message on failure (empty
-- string on success).
showErr :: Show a => Result a -> String
showErr res
| _pass res = ""
| otherwise = "Failed after " ++ show (_casesChecked res) ++ " cases:\n" ++ msg ++ unlines failures ++ rest where
msg = if null (_failureMsg res) then "" else _failureMsg res ++ "\n"
failures = map (\(r, t) -> "\t" ++ either showFail show r ++ " " ++ showTrace t) . take 5 $ _failures res
rest = if moreThan (_failures res) 5 then "\n\t..." else ""
-- | Check if a list has more than some number of elements.
moreThan :: [a] -> Int -> Bool
moreThan [] n = n < 0
moreThan _ 0 = True
moreThan (_:xs) n = moreThan xs (n-1)