Futhark.Pass.ExtractKernels.Distribution

Documentation

type Target = (PatternT Type, Result)

data Targets

First pair element is the very innermost ("current") target. In the list, the outermost target comes first. Invariant: Every element of a pattern must be present as the result of the immediately enclosing target. This is ensured by pushInnerTarget by removing unused pattern elements.

ppTargets :: Targets -> String

singleTarget :: Target -> Targets

outerTarget :: Targets -> Target

innerTarget :: Targets -> Target

pushInnerTarget :: Target -> Targets -> Targets

popInnerTarget :: Targets -> Maybe (Target, Targets)

targetsScope :: DistLore lore => Targets -> Scope lore

data LoopNesting

Constructors

MapNesting

Fields

• loopNestingPattern :: PatternT Type
• loopNestingAux :: StmAux ()
• loopNestingWidth :: SubExp
• loopNestingParamsAndArrs :: [(Param Type, VName)]

Instances

Show LoopNesting

Defined in Futhark.Pass.ExtractKernels.Distribution

Methods

showsPrec :: Int -> LoopNesting -> ShowS

show :: LoopNesting -> String

showList :: [LoopNesting] -> ShowS

FreeIn LoopNesting

Defined in Futhark.Pass.ExtractKernels.Distribution

Methods

freeIn' :: LoopNesting -> FV

ppLoopNesting :: LoopNesting -> String

scopeOfLoopNesting :: DistLore lore => LoopNesting -> Scope lore

data Nesting

Constructors

Nesting

Fields

• nestingLetBound :: Names
• nestingLoop :: LoopNesting

Instances

Show Nesting

Defined in Futhark.Pass.ExtractKernels.Distribution

Methods

showsPrec :: Int -> Nesting -> ShowS

show :: Nesting -> String

showList :: [Nesting] -> ShowS

type Nestings = (Nesting, [Nesting])

ppNestings :: Nestings -> String

letBindInInnerNesting :: Names -> Nestings -> Nestings

singleNesting :: Nesting -> Nestings

pushInnerNesting :: Nesting -> Nestings -> Nestings

type KernelNest = (LoopNesting, [LoopNesting])

Note: first element is *outermost* nesting. This is different from the similar types elsewhere!

ppKernelNest :: KernelNest -> String

newKernel :: LoopNesting -> KernelNest

innermostKernelNesting :: KernelNest -> LoopNesting

Retrieve the innermost kernel nesting.

pushKernelNesting :: Target -> LoopNesting -> KernelNest -> KernelNest

Add new outermost nesting, pushing the current outermost to the list, also taking care to swap patterns if necessary.

pushInnerKernelNesting :: Target -> LoopNesting -> KernelNest -> KernelNest

Add new innermost nesting, pushing the current outermost to the list. It is important that the Target has the right order (non-permuted compared to what is expected by the outer nests).

kernelNestLoops :: KernelNest -> [LoopNesting]

kernelNestWidths :: KernelNest -> [SubExp]

boundInKernelNest :: KernelNest -> Names

boundInKernelNests :: KernelNest -> [Names]

flatKernel :: MonadFreshNames m => KernelNest -> m ([(VName, SubExp)], [KernelInput])

Flatten a kernel nesting to:

1. The index space.
2. The kernel inputs - note that some of these may be unused.

constructKernel :: (DistLore lore, MonadFreshNames m, LocalScope lore m) => MkSegLevel lore m -> KernelNest -> Body lore -> m (Stm lore, Stms lore)

tryDistribute :: (DistLore lore, MonadFreshNames m, LocalScope lore m, MonadLogger m) => MkSegLevel lore m -> Nestings -> Targets -> Stms lore -> m (Maybe (Targets, Stms lore))

tryDistributeStm :: (MonadFreshNames m, HasScope t m, ASTLore lore) => Nestings -> Targets -> Stm lore -> m (Maybe (Result, Targets, KernelNest))