| Safe Haskell | Safe-Inferred |
|---|---|
| Language | GHC2021 |
Futhark.Optimise.ArrayLayout.Layout
Contents
Synopsis
- layoutTableFromIndexTable :: Layout rep => PrimExpTable -> IndexTable rep -> LayoutTable
- class Layout rep
- type Permutation = [Int]
- type LayoutTable = Map SegOpName (Map ArrayName (Map IndexExprName Permutation))
- commonPermutationEliminators :: [Int] -> [BodyType] -> Bool
Documentation
layoutTableFromIndexTable :: Layout rep => PrimExpTable -> IndexTable rep -> LayoutTable Source #
Given an ordering function for DimAccess, and an IndexTable,
return a LayoutTable. We remove entries with no results after
permutationFromDimAccess
Minimal complete definition
permutationFromDimAccess
Instances
| Layout GPU Source # | |
Defined in Futhark.Optimise.ArrayLayout.Layout Methods permutationFromDimAccess :: PrimExpTable -> SegOpName -> ArrayName -> IndexExprName -> [DimAccess GPU] -> Maybe Permutation | |
| Layout MC Source # | |
Defined in Futhark.Optimise.ArrayLayout.Layout Methods permutationFromDimAccess :: PrimExpTable -> SegOpName -> ArrayName -> IndexExprName -> [DimAccess MC] -> Maybe Permutation | |
type Permutation = [Int] Source #
type LayoutTable = Map SegOpName (Map ArrayName (Map IndexExprName Permutation)) Source #