futhark-0.22.2: unittests/Futhark/IR/Mem/IxFunTests.hs
{-# OPTIONS_GHC -fno-warn-orphans #-}
module Futhark.IR.Mem.IxFunTests
( tests,
)
where
import Data.List qualified as L
import Futhark.IR.Mem.IxFun qualified as IxFunLMAD
import Futhark.IR.Mem.IxFun.Alg qualified as IxFunAlg
import Futhark.IR.Mem.IxFunWrapper
import Futhark.IR.Mem.IxFunWrapper qualified as IxFunWrap
import Futhark.IR.Syntax
import Futhark.IR.Syntax.Core ()
import Futhark.Util.IntegralExp qualified as IE
import Futhark.Util.Pretty qualified as PR
import Test.Tasty
import Test.Tasty.HUnit
import Prelude hiding (span)
import Prelude qualified as P
instance IE.IntegralExp Int where
quot = P.quot
rem = P.rem
div = P.div
mod = P.mod
pow = (P.^)
sgn = Just . P.signum
allPoints :: [Int] -> [[Int]]
allPoints dims =
let total = product dims
strides = drop 1 $ L.reverse $ scanl (*) 1 $ L.reverse dims
in map (unflatInd strides) [0 .. total - 1]
where
unflatInd :: [Int] -> Int -> [Int]
unflatInd strides x =
fst $
foldl
( \(res, acc) span ->
(res ++ [acc `P.div` span], acc `P.mod` span)
)
([], x)
strides
compareIxFuns :: IxFunLMAD.IxFun Int -> IxFunAlg.IxFun Int -> Assertion
compareIxFuns ixfunLMAD ixfunAlg =
let lmadShape = IxFunLMAD.shape ixfunLMAD
algShape = IxFunAlg.shape ixfunAlg
points = allPoints lmadShape
resLMAD = map (IxFunLMAD.index ixfunLMAD) points
resAlg = map (IxFunAlg.index ixfunAlg) points
errorMessage =
"lmad ixfun: "
++ PR.prettyString ixfunLMAD
++ "\n"
++ "alg ixfun: "
++ PR.prettyString ixfunAlg
++ "\n"
++ "lmad shape: "
++ show lmadShape
++ "\n"
++ "alg shape: "
++ show algShape
++ "\n"
++ "lmad points length: "
++ show (length resLMAD)
++ "\n"
++ "alg points length: "
++ show (length resAlg)
++ "\n"
++ "lmad points: "
++ show resLMAD
++ "\n"
++ "alg points: "
++ show resAlg
in (lmadShape == algShape && resLMAD == resAlg) @? errorMessage
compareOps :: IxFunWrap.IxFun Int -> Assertion
compareOps (ixfunLMAD, ixfunAlg) = compareIxFuns ixfunLMAD ixfunAlg
-- XXX: Clean this up.
n :: Int
n = 19
slice3 :: Slice Int
slice3 =
Slice
[ DimSlice 2 (n `P.div` 3) 3,
DimFix (n `P.div` 2),
DimSlice 1 (n `P.div` 2) 2
]
-- Actual tests.
tests :: TestTree
tests =
testGroup "IxFunTests" $
concat
[ test_iota,
test_slice_iota,
test_reshape_slice_iota1,
test_permute_slice_iota,
test_reshape_permute_iota,
test_reshape_slice_iota2,
test_reshape_slice_iota3,
test_complex1,
test_complex2,
test_rebase1,
test_rebase2,
test_rebase3,
test_rebase4_5,
test_flatSlice_iota,
test_slice_flatSlice_iota,
test_flatSlice_flatSlice_iota,
test_flatSlice_slice_iota,
test_flatSlice_transpose_slice_iota
]
singleton :: TestTree -> [TestTree]
singleton = (: [])
test_iota :: [TestTree]
test_iota =
singleton $
testCase "iota" $
compareOps $
iota [n]
test_slice_iota :: [TestTree]
test_slice_iota =
singleton $
testCase "slice . iota" $
compareOps $
slice (iota [n, n, n]) slice3
test_reshape_slice_iota1 :: [TestTree]
test_reshape_slice_iota1 =
singleton $
testCase "reshape . slice . iota 1" $
compareOps $
reshape
(slice (iota [n, n, n]) slice3)
[n `P.div` 2, n `P.div` 3]
test_permute_slice_iota :: [TestTree]
test_permute_slice_iota =
singleton $
testCase "permute . slice . iota" $
compareOps $
permute (slice (iota [n, n, n]) slice3) [1, 0]
test_reshape_permute_iota :: [TestTree]
test_reshape_permute_iota =
-- negative reshape test
singleton $
testCase "reshape . permute . iota" $
compareOps $
let newdims = [n * n, n]
in reshape (permute (iota [n, n, n]) [1, 2, 0]) newdims
test_reshape_slice_iota2 :: [TestTree]
test_reshape_slice_iota2 =
-- negative reshape test
singleton $
testCase "reshape . slice . iota 2" $
compareOps $
let newdims = [n * n, n]
slc =
Slice
[ DimFix (n `P.div` 2),
DimSlice (n - 1) n (-1),
DimSlice 0 n 1,
DimSlice (n - 1) n (-1)
]
in reshape (slice (iota [n, n, n, n]) slc) newdims
test_reshape_slice_iota3 :: [TestTree]
test_reshape_slice_iota3 =
-- negative reshape test
singleton $
testCase "reshape . slice . iota 3" $
compareOps $
let newdims = [n * n, n]
slc =
Slice
[ DimFix (n `P.div` 2),
DimSlice 0 n 1,
DimSlice 0 (n `P.div` 2) 1,
DimSlice 0 n 1
]
in reshape (slice (iota [n, n, n, n]) slc) newdims
test_complex1 :: [TestTree]
test_complex1 =
singleton $
testCase "reshape . permute . slice . permute . slice . iota 1" $
compareOps $
let newdims =
[ n,
n,
n,
(n `P.div` 3) - 2
]
slice33 =
Slice
[ DimSlice (n - 1) (n `P.div` 3) (-1),
DimSlice (n - 1) n (-1),
DimSlice (n - 1) n (-1),
DimSlice 0 n 1
]
ixfun = permute (slice (iota [n, n, n, n, n]) slice33) [3, 1, 2, 0]
m = n `P.div` 3
slice1 =
Slice
[ DimSlice 0 n 1,
DimSlice (n - 1) n (-1),
DimSlice (n - 1) n (-1),
DimSlice 1 (m - 2) (-1)
]
ixfun' = reshape (slice ixfun slice1) newdims
in ixfun'
test_complex2 :: [TestTree]
test_complex2 =
singleton $
testCase "reshape . permute . slice . permute . slice . iota 2" $
compareOps $
let newdims =
[ n,
n * n,
(n `P.div` 3) - 2
]
slc2 =
Slice
[ DimFix (n `P.div` 2),
DimSlice (n - 1) (n `P.div` 3) (-1),
DimSlice (n - 1) n (-1),
DimSlice (n - 1) n (-1),
DimSlice 0 n 1
]
ixfun = permute (slice (iota [n, n, n, n, n]) slc2) [3, 1, 2, 0]
m = n `P.div` 3
slice1 =
Slice
[ DimSlice 0 n 1,
DimSlice (n - 1) n (-1),
DimSlice (n - 1) n (-1),
DimSlice 1 (m - 2) (-1)
]
ixfun' = reshape (slice ixfun slice1) newdims
in ixfun'
test_rebase1 :: [TestTree]
test_rebase1 =
singleton $
testCase "rebase 1" $
compareOps $
let slice_base =
Slice
[ DimFix (n `P.div` 2),
DimSlice 2 (n - 2) 1,
DimSlice 3 (n - 3) 1
]
ixfn_base = permute (slice (iota [n, n, n]) slice_base) [1, 0]
ixfn_orig = permute (iota [n - 3, n - 2]) [1, 0]
ixfn_rebase = rebase ixfn_base ixfn_orig
in ixfn_rebase
test_rebase2 :: [TestTree]
test_rebase2 =
singleton $
testCase "rebase 2" $
compareOps $
let slice_base =
Slice
[ DimFix (n `P.div` 2),
DimSlice (n - 1) (n - 2) (-1),
DimSlice (n - 1) (n - 3) (-1)
]
slice_orig =
Slice
[ DimSlice (n - 4) (n - 3) (-1),
DimSlice (n - 3) (n - 2) (-1)
]
ixfn_base = permute (slice (iota [n, n, n]) slice_base) [1, 0]
ixfn_orig = permute (slice (iota [n - 3, n - 2]) slice_orig) [1, 0]
ixfn_rebase = rebase ixfn_base ixfn_orig
in ixfn_rebase
test_rebase3 :: [TestTree]
test_rebase3 =
singleton $
testCase "rebase full orig but not monotonic" $
compareOps $
let n2 = (n - 2) `P.div` 3
n3 = (n - 3) `P.div` 2
slice_base =
Slice
[ DimFix (n `P.div` 2),
DimSlice (n - 1) n2 (-3),
DimSlice (n - 1) n3 (-2)
]
slice_orig =
Slice
[ DimSlice (n3 - 1) n3 (-1),
DimSlice (n2 - 1) n2 (-1)
]
ixfn_base = permute (slice (iota [n, n, n]) slice_base) [1, 0]
ixfn_orig = permute (slice (iota [n3, n2]) slice_orig) [1, 0]
ixfn_rebase = rebase ixfn_base ixfn_orig
in ixfn_rebase
test_rebase4_5 :: [TestTree]
test_rebase4_5 =
let n2 = (n - 2) `P.div` 3
n3 = (n - 3) `P.div` 2
slice_base =
Slice
[ DimFix (n `P.div` 2),
DimSlice (n - 1) n2 (-3),
DimSlice 3 n3 2
]
slice_orig =
Slice
[ DimSlice (n3 - 1) n3 (-1),
DimSlice 0 n2 1
]
ixfn_base = permute (slice (iota [n, n, n]) slice_base) [1, 0]
ixfn_orig = permute (slice (iota [n3, n2]) slice_orig) [1, 0]
in [ testCase "rebase mixed monotonicities" $
compareOps $
rebase ixfn_base ixfn_orig
]
test_flatSlice_iota :: [TestTree]
test_flatSlice_iota =
singleton $
testCase "flatSlice . iota" $
compareOps $
flatSlice (iota [n * n * n * n]) $
FlatSlice 2 [FlatDimIndex (n * 2) 4, FlatDimIndex n 3, FlatDimIndex 1 2]
test_slice_flatSlice_iota :: [TestTree]
test_slice_flatSlice_iota =
singleton $
testCase "slice . flatSlice . iota " $
compareOps $
slice (flatSlice (iota [2 + n * n * n]) flat_slice) $
Slice [DimFix 2, DimSlice 0 n 1, DimFix 0]
where
flat_slice = FlatSlice 2 [FlatDimIndex (n * n) 1, FlatDimIndex n 1, FlatDimIndex 1 1]
test_flatSlice_flatSlice_iota :: [TestTree]
test_flatSlice_flatSlice_iota =
singleton $
testCase "flatSlice . flatSlice . iota " $
compareOps $
flatSlice (flatSlice (iota [10 * 10]) flat_slice_1) flat_slice_2
where
flat_slice_1 = FlatSlice 17 [FlatDimIndex 3 27, FlatDimIndex 3 10, FlatDimIndex 3 1]
flat_slice_2 = FlatSlice 2 [FlatDimIndex 2 (-2)]
test_flatSlice_slice_iota :: [TestTree]
test_flatSlice_slice_iota =
singleton $
testCase "flatSlice . slice . iota " $
compareOps $
flatSlice (slice (iota [210, 100]) $ Slice [DimSlice 10 100 2, DimFix 10]) flat_slice_1
where
flat_slice_1 = FlatSlice 17 [FlatDimIndex 3 27, FlatDimIndex 3 10, FlatDimIndex 3 1]
test_flatSlice_transpose_slice_iota :: [TestTree]
test_flatSlice_transpose_slice_iota =
singleton $
testCase "flatSlice . transpose . slice . iota " $
compareOps $
flatSlice (permute (slice (iota [20, 20]) $ Slice [DimSlice 1 5 2, DimSlice 0 5 2]) [1, 0]) flat_slice_1
where
flat_slice_1 = FlatSlice 1 [FlatDimIndex 2 2]