{-# LANGUAGE Strict #-}
{-# LANGUAGE TypeFamilies #-}
{-# LANGUAGE UndecidableInstances #-}

-- |
--
-- Perform general rule-based simplification based on data dependency
-- information.  This module will:
--
--    * Perform common-subexpression elimination (CSE).
--
--    * Hoist expressions out of loops (including lambdas) and
--    branches.  This is done as aggressively as possible.
--
--    * Apply simplification rules (see
--    "Futhark.Optimise.Simplification.Rules").
--
-- If you just want to run the simplifier as simply as possible, you
-- may prefer to use the "Futhark.Optimise.Simplify" module.
module Futhark.Optimise.Simplify.Engine
  ( -- * Monadic interface
    SimpleM,
    runSimpleM,
    SimpleOps (..),
    SimplifyOp,
    bindableSimpleOps,
    Env (envHoistBlockers, envRules),
    emptyEnv,
    HoistBlockers (..),
    neverBlocks,
    noExtraHoistBlockers,
    neverHoist,
    BlockPred,
    orIf,
    hasFree,
    isConsumed,
    isConsuming,
    isFalse,
    isOp,
    isNotSafe,
    isDeviceMigrated,
    asksEngineEnv,
    askVtable,
    localVtable,

    -- * Building blocks
    SimplifiableRep,
    Simplifiable (..),
    simplifyFun,
    simplifyStms,
    simplifyStmsWithUsage,
    simplifyLambda,
    simplifyLambdaNoHoisting,
    bindLParams,
    simplifyBody,
    ST.SymbolTable,
    hoistStms,
    blockIf,
    blockMigrated,
    enterLoop,
    constructBody,
    module Futhark.Optimise.Simplify.Rep,
  )
where

import Control.Monad
import Control.Monad.Reader
import Control.Monad.State.Strict
import Data.Bitraversable
import Data.Either
import Data.List (find, foldl', inits, mapAccumL)
import Data.Map qualified as M
import Data.Maybe
import Futhark.Analysis.SymbolTable qualified as ST
import Futhark.Analysis.UsageTable qualified as UT
import Futhark.Construct
import Futhark.IR
import Futhark.IR.Prop.Aliases
import Futhark.Optimise.Simplify.Rep
import Futhark.Optimise.Simplify.Rule
import Futhark.Util (nubOrd)

data HoistBlockers rep = HoistBlockers
  { -- | Blocker for hoisting out of parallel loops.
    forall {k} (rep :: k). HoistBlockers rep -> BlockPred (Wise rep)
blockHoistPar :: BlockPred (Wise rep),
    -- | Blocker for hoisting out of sequential loops.
    forall {k} (rep :: k). HoistBlockers rep -> BlockPred (Wise rep)
blockHoistSeq :: BlockPred (Wise rep),
    -- | Blocker for hoisting out of branches.
    forall {k} (rep :: k). HoistBlockers rep -> BlockPred (Wise rep)
blockHoistBranch :: BlockPred (Wise rep),
    forall {k} (rep :: k). HoistBlockers rep -> Stm (Wise rep) -> Bool
isAllocation :: Stm (Wise rep) -> Bool
  }

noExtraHoistBlockers :: HoistBlockers rep
noExtraHoistBlockers :: forall {k} (rep :: k). HoistBlockers rep
noExtraHoistBlockers =
  BlockPred (Wise rep)
-> BlockPred (Wise rep)
-> BlockPred (Wise rep)
-> (Stm (Wise rep) -> Bool)
-> HoistBlockers rep
forall {k} (rep :: k).
BlockPred (Wise rep)
-> BlockPred (Wise rep)
-> BlockPred (Wise rep)
-> (Stm (Wise rep) -> Bool)
-> HoistBlockers rep
HoistBlockers BlockPred (Wise rep)
forall rep. BlockPred rep
neverBlocks BlockPred (Wise rep)
forall rep. BlockPred rep
neverBlocks BlockPred (Wise rep)
forall rep. BlockPred rep
neverBlocks (Bool -> Stm (Wise rep) -> Bool
forall a b. a -> b -> a
const Bool
False)

neverHoist :: HoistBlockers rep
neverHoist :: forall {k} (rep :: k). HoistBlockers rep
neverHoist =
  BlockPred (Wise rep)
-> BlockPred (Wise rep)
-> BlockPred (Wise rep)
-> (Stm (Wise rep) -> Bool)
-> HoistBlockers rep
forall {k} (rep :: k).
BlockPred (Wise rep)
-> BlockPred (Wise rep)
-> BlockPred (Wise rep)
-> (Stm (Wise rep) -> Bool)
-> HoistBlockers rep
HoistBlockers BlockPred (Wise rep)
forall rep. BlockPred rep
alwaysBlocks BlockPred (Wise rep)
forall rep. BlockPred rep
alwaysBlocks BlockPred (Wise rep)
forall rep. BlockPred rep
alwaysBlocks (Bool -> Stm (Wise rep) -> Bool
forall a b. a -> b -> a
const Bool
False)

data Env rep = Env
  { forall {k} (rep :: k). Env rep -> RuleBook (Wise rep)
envRules :: RuleBook (Wise rep),
    forall {k} (rep :: k). Env rep -> HoistBlockers rep
envHoistBlockers :: HoistBlockers rep,
    forall {k} (rep :: k). Env rep -> SymbolTable (Wise rep)
envVtable :: ST.SymbolTable (Wise rep)
  }

emptyEnv :: RuleBook (Wise rep) -> HoistBlockers rep -> Env rep
emptyEnv :: forall {k} (rep :: k).
RuleBook (Wise rep) -> HoistBlockers rep -> Env rep
emptyEnv RuleBook (Wise rep)
rules HoistBlockers rep
blockers =
  Env
    { envRules :: RuleBook (Wise rep)
envRules = RuleBook (Wise rep)
rules,
      envHoistBlockers :: HoistBlockers rep
envHoistBlockers = HoistBlockers rep
blockers,
      envVtable :: SymbolTable (Wise rep)
envVtable = SymbolTable (Wise rep)
forall a. Monoid a => a
mempty
    }

-- | A function that protects a hoisted operation (if possible).  The
-- first operand is the condition of the 'Case' we have hoisted out of
-- (or equivalently, a boolean indicating whether a loop has nonzero
-- trip count).
type Protect m = SubExp -> Pat (LetDec (Rep m)) -> Op (Rep m) -> Maybe (m ())

type SimplifyOp rep op = op -> SimpleM rep (op, Stms (Wise rep))

data SimpleOps rep = SimpleOps
  { forall rep.
SimpleOps rep
-> SymbolTable (Wise rep)
-> Pat (LetDec (Wise rep))
-> Exp (Wise rep)
-> SimpleM rep (ExpDec (Wise rep))
mkExpDecS ::
      ST.SymbolTable (Wise rep) ->
      Pat (LetDec (Wise rep)) ->
      Exp (Wise rep) ->
      SimpleM rep (ExpDec (Wise rep)),
    forall rep.
SimpleOps rep
-> SymbolTable (Wise rep)
-> Stms (Wise rep)
-> Result
-> SimpleM rep (Body (Wise rep))
mkBodyS ::
      ST.SymbolTable (Wise rep) ->
      Stms (Wise rep) ->
      Result ->
      SimpleM rep (Body (Wise rep)),
    -- | Make a hoisted Op safe.  The SubExp is a boolean
    -- that is true when the value of the statement will
    -- actually be used.
    forall rep. SimpleOps rep -> Protect (Builder (Wise rep))
protectHoistedOpS :: Protect (Builder (Wise rep)),
    forall rep. SimpleOps rep -> Op (Wise rep) -> UsageTable
opUsageS :: Op (Wise rep) -> UT.UsageTable,
    forall rep.
SimpleOps rep
-> Pat (LetDec rep)
-> Exp (Wise rep)
-> SimpleM rep (Pat (LetDec rep))
simplifyPatFromExpS ::
      Pat (LetDec rep) ->
      Exp (Wise rep) ->
      SimpleM rep (Pat (LetDec rep)),
    forall rep. SimpleOps rep -> SimplifyOp rep (Op (Wise rep))
simplifyOpS :: SimplifyOp rep (Op (Wise rep))
  }

bindableSimpleOps ::
  (SimplifiableRep rep, Buildable rep) =>
  SimplifyOp rep (Op (Wise rep)) ->
  SimpleOps rep
bindableSimpleOps :: forall rep.
(SimplifiableRep rep, Buildable rep) =>
SimplifyOp rep (Op (Wise rep)) -> SimpleOps rep
bindableSimpleOps =
  (SymbolTable (Wise rep)
 -> Pat (LetDec (Wise rep))
 -> Exp (Wise rep)
 -> SimpleM rep (ExpDec (Wise rep)))
-> (SymbolTable (Wise rep)
    -> Seq (Stm (Wise rep)) -> Result -> SimpleM rep (Body (Wise rep)))
-> Protect (Builder (Wise rep))
-> (Op (Wise rep) -> UsageTable)
-> (Pat (LetDec rep)
    -> Exp (Wise rep) -> SimpleM rep (Pat (LetDec rep)))
-> (Op (Wise rep)
    -> SimpleM rep (Op (Wise rep), Seq (Stm (Wise rep))))
-> SimpleOps rep
forall rep.
(SymbolTable (Wise rep)
 -> Pat (LetDec (Wise rep))
 -> Exp (Wise rep)
 -> SimpleM rep (ExpDec (Wise rep)))
-> (SymbolTable (Wise rep)
    -> Stms (Wise rep) -> Result -> SimpleM rep (Body (Wise rep)))
-> Protect (Builder (Wise rep))
-> (Op (Wise rep) -> UsageTable)
-> (Pat (LetDec rep)
    -> Exp (Wise rep) -> SimpleM rep (Pat (LetDec rep)))
-> SimplifyOp rep (Op (Wise rep))
-> SimpleOps rep
SimpleOps SymbolTable (Wise rep)
-> Pat (LetDec (Wise rep))
-> Exp (Wise rep)
-> SimpleM rep (ExpDec (Wise rep))
forall {rep} {f :: * -> *} {p}.
(Applicative f, Buildable rep) =>
p -> Pat (LetDec rep) -> Exp rep -> f (ExpDec rep)
mkExpDecS' SymbolTable (Wise rep)
-> Seq (Stm (Wise rep)) -> Result -> SimpleM rep (Body (Wise rep))
forall {rep} {f :: * -> *} {p}.
(Applicative f, Buildable rep) =>
p -> Stms rep -> Result -> f (Body rep)
mkBodyS' SubExp
-> Pat (VarWisdom, LetDec rep)
-> OpC rep (Wise rep)
-> Maybe (Builder (Wise rep) ())
Protect (Builder (Wise rep))
forall {p} {p} {p} {a}. p -> p -> p -> Maybe a
protectHoistedOpS' (UsageTable -> OpC rep (Wise rep) -> UsageTable
forall a b. a -> b -> a
const UsageTable
forall a. Monoid a => a
mempty) Pat (LetDec rep)
-> Exp (Wise rep) -> SimpleM rep (Pat (LetDec rep))
forall {t :: * -> *} {rep} {b} {p}.
(Traversable t, ASTRep rep, Simplifiable b,
 Simplifiable (LetDec rep), Simplifiable (FParamInfo rep),
 Simplifiable (LParamInfo rep), Simplifiable (RetType rep),
 Simplifiable (BranchType rep), TraverseOpStms (Wise rep),
 CanBeWise (OpC rep), IndexOp (OpC rep (Wise rep)),
 AliasedOp (OpC rep (Wise rep)), BuilderOps (Wise rep)) =>
t b -> p -> SimpleM rep (t b)
simplifyPatFromExp
  where
    mkExpDecS' :: p -> Pat (LetDec rep) -> Exp rep -> f (ExpDec rep)
mkExpDecS' p
_ Pat (LetDec rep)
pat Exp rep
e = ExpDec rep -> f (ExpDec rep)
forall a. a -> f a
forall (f :: * -> *) a. Applicative f => a -> f a
pure (ExpDec rep -> f (ExpDec rep)) -> ExpDec rep -> f (ExpDec rep)
forall a b. (a -> b) -> a -> b
$ Pat (LetDec rep) -> Exp rep -> ExpDec rep
forall rep.
Buildable rep =>
Pat (LetDec rep) -> Exp rep -> ExpDec rep
mkExpDec Pat (LetDec rep)
pat Exp rep
e
    mkBodyS' :: p -> Stms rep -> Result -> f (Body rep)
mkBodyS' p
_ Stms rep
stms Result
res = Body rep -> f (Body rep)
forall a. a -> f a
forall (f :: * -> *) a. Applicative f => a -> f a
pure (Body rep -> f (Body rep)) -> Body rep -> f (Body rep)
forall a b. (a -> b) -> a -> b
$ Stms rep -> Result -> Body rep
forall rep. Buildable rep => Stms rep -> Result -> Body rep
mkBody Stms rep
stms Result
res
    protectHoistedOpS' :: p -> p -> p -> Maybe a
protectHoistedOpS' p
_ p
_ p
_ = Maybe a
forall a. Maybe a
Nothing
    simplifyPatFromExp :: t b -> p -> SimpleM rep (t b)
simplifyPatFromExp t b
pat p
_ = (b -> SimpleM rep b) -> t b -> SimpleM rep (t b)
forall (t :: * -> *) (f :: * -> *) a b.
(Traversable t, Applicative f) =>
(a -> f b) -> t a -> f (t b)
forall (f :: * -> *) a b.
Applicative f =>
(a -> f b) -> t a -> f (t b)
traverse b -> SimpleM rep b
forall rep. SimplifiableRep rep => b -> SimpleM rep b
forall e rep.
(Simplifiable e, SimplifiableRep rep) =>
e -> SimpleM rep e
simplify t b
pat

newtype SimpleM rep a
  = SimpleM
      ( ReaderT
          (SimpleOps rep, Env rep)
          (State (VNameSource, Bool, Certs))
          a
      )
  deriving
    ( Functor (SimpleM rep)
Functor (SimpleM rep)
-> (forall a. a -> SimpleM rep a)
-> (forall a b.
    SimpleM rep (a -> b) -> SimpleM rep a -> SimpleM rep b)
-> (forall a b c.
    (a -> b -> c) -> SimpleM rep a -> SimpleM rep b -> SimpleM rep c)
-> (forall a b. SimpleM rep a -> SimpleM rep b -> SimpleM rep b)
-> (forall a b. SimpleM rep a -> SimpleM rep b -> SimpleM rep a)
-> Applicative (SimpleM rep)
forall {rep}. Functor (SimpleM rep)
forall a. a -> SimpleM rep a
forall rep a. a -> SimpleM rep a
forall a b. SimpleM rep a -> SimpleM rep b -> SimpleM rep a
forall a b. SimpleM rep a -> SimpleM rep b -> SimpleM rep b
forall a b. SimpleM rep (a -> b) -> SimpleM rep a -> SimpleM rep b
forall rep a b. SimpleM rep a -> SimpleM rep b -> SimpleM rep a
forall rep a b. SimpleM rep a -> SimpleM rep b -> SimpleM rep b
forall rep a b.
SimpleM rep (a -> b) -> SimpleM rep a -> SimpleM rep b
forall a b c.
(a -> b -> c) -> SimpleM rep a -> SimpleM rep b -> SimpleM rep c
forall rep a b c.
(a -> b -> c) -> SimpleM rep a -> SimpleM rep b -> SimpleM rep c
forall (f :: * -> *).
Functor f
-> (forall a. a -> f a)
-> (forall a b. f (a -> b) -> f a -> f b)
-> (forall a b c. (a -> b -> c) -> f a -> f b -> f c)
-> (forall a b. f a -> f b -> f b)
-> (forall a b. f a -> f b -> f a)
-> Applicative f
$cpure :: forall rep a. a -> SimpleM rep a
pure :: forall a. a -> SimpleM rep a
$c<*> :: forall rep a b.
SimpleM rep (a -> b) -> SimpleM rep a -> SimpleM rep b
<*> :: forall a b. SimpleM rep (a -> b) -> SimpleM rep a -> SimpleM rep b
$cliftA2 :: forall rep a b c.
(a -> b -> c) -> SimpleM rep a -> SimpleM rep b -> SimpleM rep c
liftA2 :: forall a b c.
(a -> b -> c) -> SimpleM rep a -> SimpleM rep b -> SimpleM rep c
$c*> :: forall rep a b. SimpleM rep a -> SimpleM rep b -> SimpleM rep b
*> :: forall a b. SimpleM rep a -> SimpleM rep b -> SimpleM rep b
$c<* :: forall rep a b. SimpleM rep a -> SimpleM rep b -> SimpleM rep a
<* :: forall a b. SimpleM rep a -> SimpleM rep b -> SimpleM rep a
Applicative,
      (forall a b. (a -> b) -> SimpleM rep a -> SimpleM rep b)
-> (forall a b. a -> SimpleM rep b -> SimpleM rep a)
-> Functor (SimpleM rep)
forall a b. a -> SimpleM rep b -> SimpleM rep a
forall a b. (a -> b) -> SimpleM rep a -> SimpleM rep b
forall rep a b. a -> SimpleM rep b -> SimpleM rep a
forall rep a b. (a -> b) -> SimpleM rep a -> SimpleM rep b
forall (f :: * -> *).
(forall a b. (a -> b) -> f a -> f b)
-> (forall a b. a -> f b -> f a) -> Functor f
$cfmap :: forall rep a b. (a -> b) -> SimpleM rep a -> SimpleM rep b
fmap :: forall a b. (a -> b) -> SimpleM rep a -> SimpleM rep b
$c<$ :: forall rep a b. a -> SimpleM rep b -> SimpleM rep a
<$ :: forall a b. a -> SimpleM rep b -> SimpleM rep a
Functor,
      Applicative (SimpleM rep)
Applicative (SimpleM rep)
-> (forall a b.
    SimpleM rep a -> (a -> SimpleM rep b) -> SimpleM rep b)
-> (forall a b. SimpleM rep a -> SimpleM rep b -> SimpleM rep b)
-> (forall a. a -> SimpleM rep a)
-> Monad (SimpleM rep)
forall rep. Applicative (SimpleM rep)
forall a. a -> SimpleM rep a
forall rep a. a -> SimpleM rep a
forall a b. SimpleM rep a -> SimpleM rep b -> SimpleM rep b
forall a b. SimpleM rep a -> (a -> SimpleM rep b) -> SimpleM rep b
forall rep a b. SimpleM rep a -> SimpleM rep b -> SimpleM rep b
forall rep a b.
SimpleM rep a -> (a -> SimpleM rep b) -> SimpleM rep b
forall (m :: * -> *).
Applicative m
-> (forall a b. m a -> (a -> m b) -> m b)
-> (forall a b. m a -> m b -> m b)
-> (forall a. a -> m a)
-> Monad m
$c>>= :: forall rep a b.
SimpleM rep a -> (a -> SimpleM rep b) -> SimpleM rep b
>>= :: forall a b. SimpleM rep a -> (a -> SimpleM rep b) -> SimpleM rep b
$c>> :: forall rep a b. SimpleM rep a -> SimpleM rep b -> SimpleM rep b
>> :: forall a b. SimpleM rep a -> SimpleM rep b -> SimpleM rep b
$creturn :: forall rep a. a -> SimpleM rep a
return :: forall a. a -> SimpleM rep a
Monad,
      MonadReader (SimpleOps rep, Env rep),
      MonadState (VNameSource, Bool, Certs)
    )

instance MonadFreshNames (SimpleM rep) where
  putNameSource :: VNameSource -> SimpleM rep ()
putNameSource VNameSource
src = ((VNameSource, Bool, Certs) -> (VNameSource, Bool, Certs))
-> SimpleM rep ()
forall s (m :: * -> *). MonadState s m => (s -> s) -> m ()
modify (((VNameSource, Bool, Certs) -> (VNameSource, Bool, Certs))
 -> SimpleM rep ())
-> ((VNameSource, Bool, Certs) -> (VNameSource, Bool, Certs))
-> SimpleM rep ()
forall a b. (a -> b) -> a -> b
$ \(VNameSource
_, Bool
b, Certs
c) -> (VNameSource
src, Bool
b, Certs
c)
  getNameSource :: SimpleM rep VNameSource
getNameSource = ((VNameSource, Bool, Certs) -> VNameSource)
-> SimpleM rep VNameSource
forall s (m :: * -> *) a. MonadState s m => (s -> a) -> m a
gets (((VNameSource, Bool, Certs) -> VNameSource)
 -> SimpleM rep VNameSource)
-> ((VNameSource, Bool, Certs) -> VNameSource)
-> SimpleM rep VNameSource
forall a b. (a -> b) -> a -> b
$ \(VNameSource
a, Bool
_, Certs
_) -> VNameSource
a

instance SimplifiableRep rep => HasScope (Wise rep) (SimpleM rep) where
  askScope :: SimpleM rep (Scope (Wise rep))
askScope = SymbolTable (Wise rep) -> Scope (Wise rep)
forall rep. SymbolTable rep -> Scope rep
ST.toScope (SymbolTable (Wise rep) -> Scope (Wise rep))
-> SimpleM rep (SymbolTable (Wise rep))
-> SimpleM rep (Scope (Wise rep))
forall (f :: * -> *) a b. Functor f => (a -> b) -> f a -> f b
<$> SimpleM rep (SymbolTable (Wise rep))
forall rep. SimpleM rep (SymbolTable (Wise rep))
askVtable
  lookupType :: VName -> SimpleM rep Type
lookupType VName
name = do
    SymbolTable (Wise rep)
vtable <- SimpleM rep (SymbolTable (Wise rep))
forall rep. SimpleM rep (SymbolTable (Wise rep))
askVtable
    case VName -> SymbolTable (Wise rep) -> Maybe Type
forall rep. ASTRep rep => VName -> SymbolTable rep -> Maybe Type
ST.lookupType VName
name SymbolTable (Wise rep)
vtable of
      Just Type
t -> Type -> SimpleM rep Type
forall a. a -> SimpleM rep a
forall (f :: * -> *) a. Applicative f => a -> f a
pure Type
t
      Maybe Type
Nothing ->
        [Char] -> SimpleM rep Type
forall a. HasCallStack => [Char] -> a
error ([Char] -> SimpleM rep Type) -> [Char] -> SimpleM rep Type
forall a b. (a -> b) -> a -> b
$
          [Char]
"SimpleM.lookupType: cannot find variable "
            [Char] -> [Char] -> [Char]
forall a. [a] -> [a] -> [a]
++ VName -> [Char]
forall a. Pretty a => a -> [Char]
prettyString VName
name
            [Char] -> [Char] -> [Char]
forall a. [a] -> [a] -> [a]
++ [Char]
" in symbol table."

instance
  SimplifiableRep rep =>
  LocalScope (Wise rep) (SimpleM rep)
  where
  localScope :: forall a. Scope (Wise rep) -> SimpleM rep a -> SimpleM rep a
localScope Scope (Wise rep)
types = (SymbolTable (Wise rep) -> SymbolTable (Wise rep))
-> SimpleM rep a -> SimpleM rep a
forall rep a.
(SymbolTable (Wise rep) -> SymbolTable (Wise rep))
-> SimpleM rep a -> SimpleM rep a
localVtable (SymbolTable (Wise rep)
-> SymbolTable (Wise rep) -> SymbolTable (Wise rep)
forall a. Semigroup a => a -> a -> a
<> Scope (Wise rep) -> SymbolTable (Wise rep)
forall rep. ASTRep rep => Scope rep -> SymbolTable rep
ST.fromScope Scope (Wise rep)
types)

runSimpleM ::
  SimpleM rep a ->
  SimpleOps rep ->
  Env rep ->
  VNameSource ->
  ((a, Bool), VNameSource)
runSimpleM :: forall rep a.
SimpleM rep a
-> SimpleOps rep
-> Env rep
-> VNameSource
-> ((a, Bool), VNameSource)
runSimpleM (SimpleM ReaderT
  (SimpleOps rep, Env rep) (State (VNameSource, Bool, Certs)) a
m) SimpleOps rep
simpl Env rep
env VNameSource
src =
  let (a
x, (VNameSource
src', Bool
b, Certs
_)) = State (VNameSource, Bool, Certs) a
-> (VNameSource, Bool, Certs) -> (a, (VNameSource, Bool, Certs))
forall s a. State s a -> s -> (a, s)
runState (ReaderT
  (SimpleOps rep, Env rep) (State (VNameSource, Bool, Certs)) a
-> (SimpleOps rep, Env rep) -> State (VNameSource, Bool, Certs) a
forall r (m :: * -> *) a. ReaderT r m a -> r -> m a
runReaderT ReaderT
  (SimpleOps rep, Env rep) (State (VNameSource, Bool, Certs)) a
m (SimpleOps rep
simpl, Env rep
env)) (VNameSource
src, Bool
False, Certs
forall a. Monoid a => a
mempty)
   in ((a
x, Bool
b), VNameSource
src')

askEngineEnv :: SimpleM rep (Env rep)
askEngineEnv :: forall rep. SimpleM rep (Env rep)
askEngineEnv = ((SimpleOps rep, Env rep) -> Env rep) -> SimpleM rep (Env rep)
forall r (m :: * -> *) a. MonadReader r m => (r -> a) -> m a
asks (SimpleOps rep, Env rep) -> Env rep
forall a b. (a, b) -> b
snd

asksEngineEnv :: (Env rep -> a) -> SimpleM rep a
asksEngineEnv :: forall rep a. (Env rep -> a) -> SimpleM rep a
asksEngineEnv Env rep -> a
f = Env rep -> a
f (Env rep -> a) -> SimpleM rep (Env rep) -> SimpleM rep a
forall (f :: * -> *) a b. Functor f => (a -> b) -> f a -> f b
<$> SimpleM rep (Env rep)
forall rep. SimpleM rep (Env rep)
askEngineEnv

askVtable :: SimpleM rep (ST.SymbolTable (Wise rep))
askVtable :: forall rep. SimpleM rep (SymbolTable (Wise rep))
askVtable = (Env rep -> SymbolTable (Wise rep))
-> SimpleM rep (SymbolTable (Wise rep))
forall rep a. (Env rep -> a) -> SimpleM rep a
asksEngineEnv Env rep -> SymbolTable (Wise rep)
forall {k} (rep :: k). Env rep -> SymbolTable (Wise rep)
envVtable

localVtable ::
  (ST.SymbolTable (Wise rep) -> ST.SymbolTable (Wise rep)) ->
  SimpleM rep a ->
  SimpleM rep a
localVtable :: forall rep a.
(SymbolTable (Wise rep) -> SymbolTable (Wise rep))
-> SimpleM rep a -> SimpleM rep a
localVtable SymbolTable (Wise rep) -> SymbolTable (Wise rep)
f = ((SimpleOps rep, Env rep) -> (SimpleOps rep, Env rep))
-> SimpleM rep a -> SimpleM rep a
forall a.
((SimpleOps rep, Env rep) -> (SimpleOps rep, Env rep))
-> SimpleM rep a -> SimpleM rep a
forall r (m :: * -> *) a. MonadReader r m => (r -> r) -> m a -> m a
local (((SimpleOps rep, Env rep) -> (SimpleOps rep, Env rep))
 -> SimpleM rep a -> SimpleM rep a)
-> ((SimpleOps rep, Env rep) -> (SimpleOps rep, Env rep))
-> SimpleM rep a
-> SimpleM rep a
forall a b. (a -> b) -> a -> b
$ \(SimpleOps rep
ops, Env rep
env) -> (SimpleOps rep
ops, Env rep
env {envVtable :: SymbolTable (Wise rep)
envVtable = SymbolTable (Wise rep) -> SymbolTable (Wise rep)
f (SymbolTable (Wise rep) -> SymbolTable (Wise rep))
-> SymbolTable (Wise rep) -> SymbolTable (Wise rep)
forall a b. (a -> b) -> a -> b
$ Env rep -> SymbolTable (Wise rep)
forall {k} (rep :: k). Env rep -> SymbolTable (Wise rep)
envVtable Env rep
env})

collectCerts :: SimpleM rep a -> SimpleM rep (a, Certs)
collectCerts :: forall rep a. SimpleM rep a -> SimpleM rep (a, Certs)
collectCerts SimpleM rep a
m = do
  a
x <- SimpleM rep a
m
  (VNameSource
a, Bool
b, Certs
cs) <- SimpleM rep (VNameSource, Bool, Certs)
forall s (m :: * -> *). MonadState s m => m s
get
  (VNameSource, Bool, Certs) -> SimpleM rep ()
forall s (m :: * -> *). MonadState s m => s -> m ()
put (VNameSource
a, Bool
b, Certs
forall a. Monoid a => a
mempty)
  (a, Certs) -> SimpleM rep (a, Certs)
forall a. a -> SimpleM rep a
forall (f :: * -> *) a. Applicative f => a -> f a
pure (a
x, Certs
cs)

-- | Mark that we have changed something and it would be a good idea
-- to re-run the simplifier.
changed :: SimpleM rep ()
changed :: forall rep. SimpleM rep ()
changed = ((VNameSource, Bool, Certs) -> (VNameSource, Bool, Certs))
-> SimpleM rep ()
forall s (m :: * -> *). MonadState s m => (s -> s) -> m ()
modify (((VNameSource, Bool, Certs) -> (VNameSource, Bool, Certs))
 -> SimpleM rep ())
-> ((VNameSource, Bool, Certs) -> (VNameSource, Bool, Certs))
-> SimpleM rep ()
forall a b. (a -> b) -> a -> b
$ \(VNameSource
src, Bool
_, Certs
cs) -> (VNameSource
src, Bool
True, Certs
cs)

usedCerts :: Certs -> SimpleM rep ()
usedCerts :: forall rep. Certs -> SimpleM rep ()
usedCerts Certs
cs = ((VNameSource, Bool, Certs) -> (VNameSource, Bool, Certs))
-> SimpleM rep ()
forall s (m :: * -> *). MonadState s m => (s -> s) -> m ()
modify (((VNameSource, Bool, Certs) -> (VNameSource, Bool, Certs))
 -> SimpleM rep ())
-> ((VNameSource, Bool, Certs) -> (VNameSource, Bool, Certs))
-> SimpleM rep ()
forall a b. (a -> b) -> a -> b
$ \(VNameSource
a, Bool
b, Certs
c) -> (VNameSource
a, Bool
b, Certs
cs Certs -> Certs -> Certs
forall a. Semigroup a => a -> a -> a
<> Certs
c)

-- | Indicate in the symbol table that we have descended into a loop.
enterLoop :: SimpleM rep a -> SimpleM rep a
enterLoop :: forall rep a. SimpleM rep a -> SimpleM rep a
enterLoop = (SymbolTable (Wise rep) -> SymbolTable (Wise rep))
-> SimpleM rep a -> SimpleM rep a
forall rep a.
(SymbolTable (Wise rep) -> SymbolTable (Wise rep))
-> SimpleM rep a -> SimpleM rep a
localVtable SymbolTable (Wise rep) -> SymbolTable (Wise rep)
forall rep. SymbolTable rep -> SymbolTable rep
ST.deepen

bindFParams :: SimplifiableRep rep => [FParam (Wise rep)] -> SimpleM rep a -> SimpleM rep a
bindFParams :: forall rep a.
SimplifiableRep rep =>
[FParam (Wise rep)] -> SimpleM rep a -> SimpleM rep a
bindFParams [FParam (Wise rep)]
params =
  (SymbolTable (Wise rep) -> SymbolTable (Wise rep))
-> SimpleM rep a -> SimpleM rep a
forall rep a.
(SymbolTable (Wise rep) -> SymbolTable (Wise rep))
-> SimpleM rep a -> SimpleM rep a
localVtable ((SymbolTable (Wise rep) -> SymbolTable (Wise rep))
 -> SimpleM rep a -> SimpleM rep a)
-> (SymbolTable (Wise rep) -> SymbolTable (Wise rep))
-> SimpleM rep a
-> SimpleM rep a
forall a b. (a -> b) -> a -> b
$ [FParam (Wise rep)]
-> SymbolTable (Wise rep) -> SymbolTable (Wise rep)
forall rep.
ASTRep rep =>
[FParam rep] -> SymbolTable rep -> SymbolTable rep
ST.insertFParams [FParam (Wise rep)]
params

bindLParams :: SimplifiableRep rep => [LParam (Wise rep)] -> SimpleM rep a -> SimpleM rep a
bindLParams :: forall rep a.
SimplifiableRep rep =>
[LParam (Wise rep)] -> SimpleM rep a -> SimpleM rep a
bindLParams [LParam (Wise rep)]
params =
  (SymbolTable (Wise rep) -> SymbolTable (Wise rep))
-> SimpleM rep a -> SimpleM rep a
forall rep a.
(SymbolTable (Wise rep) -> SymbolTable (Wise rep))
-> SimpleM rep a -> SimpleM rep a
localVtable ((SymbolTable (Wise rep) -> SymbolTable (Wise rep))
 -> SimpleM rep a -> SimpleM rep a)
-> (SymbolTable (Wise rep) -> SymbolTable (Wise rep))
-> SimpleM rep a
-> SimpleM rep a
forall a b. (a -> b) -> a -> b
$ \SymbolTable (Wise rep)
vtable -> (Param (LParamInfo rep)
 -> SymbolTable (Wise rep) -> SymbolTable (Wise rep))
-> SymbolTable (Wise rep)
-> [Param (LParamInfo rep)]
-> SymbolTable (Wise rep)
forall a b. (a -> b -> b) -> b -> [a] -> b
forall (t :: * -> *) a b.
Foldable t =>
(a -> b -> b) -> b -> t a -> b
foldr Param (LParamInfo rep)
-> SymbolTable (Wise rep) -> SymbolTable (Wise rep)
LParam (Wise rep)
-> SymbolTable (Wise rep) -> SymbolTable (Wise rep)
forall rep.
ASTRep rep =>
LParam rep -> SymbolTable rep -> SymbolTable rep
ST.insertLParam SymbolTable (Wise rep)
vtable [Param (LParamInfo rep)]
[LParam (Wise rep)]
params

bindArrayLParams ::
  SimplifiableRep rep =>
  [LParam (Wise rep)] ->
  SimpleM rep a ->
  SimpleM rep a
bindArrayLParams :: forall rep a.
SimplifiableRep rep =>
[LParam (Wise rep)] -> SimpleM rep a -> SimpleM rep a
bindArrayLParams [LParam (Wise rep)]
params =
  (SymbolTable (Wise rep) -> SymbolTable (Wise rep))
-> SimpleM rep a -> SimpleM rep a
forall rep a.
(SymbolTable (Wise rep) -> SymbolTable (Wise rep))
-> SimpleM rep a -> SimpleM rep a
localVtable ((SymbolTable (Wise rep) -> SymbolTable (Wise rep))
 -> SimpleM rep a -> SimpleM rep a)
-> (SymbolTable (Wise rep) -> SymbolTable (Wise rep))
-> SimpleM rep a
-> SimpleM rep a
forall a b. (a -> b) -> a -> b
$ \SymbolTable (Wise rep)
vtable -> (SymbolTable (Wise rep)
 -> Param (LParamInfo rep) -> SymbolTable (Wise rep))
-> SymbolTable (Wise rep)
-> [Param (LParamInfo rep)]
-> SymbolTable (Wise rep)
forall b a. (b -> a -> b) -> b -> [a] -> b
forall (t :: * -> *) b a.
Foldable t =>
(b -> a -> b) -> b -> t a -> b
foldl' ((Param (LParamInfo rep)
 -> SymbolTable (Wise rep) -> SymbolTable (Wise rep))
-> SymbolTable (Wise rep)
-> Param (LParamInfo rep)
-> SymbolTable (Wise rep)
forall a b c. (a -> b -> c) -> b -> a -> c
flip Param (LParamInfo rep)
-> SymbolTable (Wise rep) -> SymbolTable (Wise rep)
LParam (Wise rep)
-> SymbolTable (Wise rep) -> SymbolTable (Wise rep)
forall rep.
ASTRep rep =>
LParam rep -> SymbolTable rep -> SymbolTable rep
ST.insertLParam) SymbolTable (Wise rep)
vtable [Param (LParamInfo rep)]
[LParam (Wise rep)]
params

bindMerge ::
  SimplifiableRep rep =>
  [(FParam (Wise rep), SubExp, SubExpRes)] ->
  SimpleM rep a ->
  SimpleM rep a
bindMerge :: forall rep a.
SimplifiableRep rep =>
[(FParam (Wise rep), SubExp, SubExpRes)]
-> SimpleM rep a -> SimpleM rep a
bindMerge = (SymbolTable (Wise rep) -> SymbolTable (Wise rep))
-> SimpleM rep a -> SimpleM rep a
forall rep a.
(SymbolTable (Wise rep) -> SymbolTable (Wise rep))
-> SimpleM rep a -> SimpleM rep a
localVtable ((SymbolTable (Wise rep) -> SymbolTable (Wise rep))
 -> SimpleM rep a -> SimpleM rep a)
-> ([(Param (FParamInfo rep), SubExp, SubExpRes)]
    -> SymbolTable (Wise rep) -> SymbolTable (Wise rep))
-> [(Param (FParamInfo rep), SubExp, SubExpRes)]
-> SimpleM rep a
-> SimpleM rep a
forall b c a. (b -> c) -> (a -> b) -> a -> c
. [(Param (FParamInfo rep), SubExp, SubExpRes)]
-> SymbolTable (Wise rep) -> SymbolTable (Wise rep)
[(Param (FParamInfo (Wise rep)), SubExp, SubExpRes)]
-> SymbolTable (Wise rep) -> SymbolTable (Wise rep)
forall rep.
ASTRep rep =>
[(FParam rep, SubExp, SubExpRes)]
-> SymbolTable rep -> SymbolTable rep
ST.insertLoopMerge

bindLoopVar :: SimplifiableRep rep => VName -> IntType -> SubExp -> SimpleM rep a -> SimpleM rep a
bindLoopVar :: forall rep a.
SimplifiableRep rep =>
VName -> IntType -> SubExp -> SimpleM rep a -> SimpleM rep a
bindLoopVar VName
var IntType
it SubExp
bound =
  (SymbolTable (Wise rep) -> SymbolTable (Wise rep))
-> SimpleM rep a -> SimpleM rep a
forall rep a.
(SymbolTable (Wise rep) -> SymbolTable (Wise rep))
-> SimpleM rep a -> SimpleM rep a
localVtable ((SymbolTable (Wise rep) -> SymbolTable (Wise rep))
 -> SimpleM rep a -> SimpleM rep a)
-> (SymbolTable (Wise rep) -> SymbolTable (Wise rep))
-> SimpleM rep a
-> SimpleM rep a
forall a b. (a -> b) -> a -> b
$ VName
-> IntType
-> SubExp
-> SymbolTable (Wise rep)
-> SymbolTable (Wise rep)
forall rep.
ASTRep rep =>
VName -> IntType -> SubExp -> SymbolTable rep -> SymbolTable rep
ST.insertLoopVar VName
var IntType
it SubExp
bound

makeSafe :: Exp rep -> Maybe (Exp rep)
makeSafe :: forall rep. Exp rep -> Maybe (Exp rep)
makeSafe (BasicOp (BinOp (SDiv IntType
t Safety
_) SubExp
x SubExp
y)) =
  Exp rep -> Maybe (Exp rep)
forall a. a -> Maybe a
Just (Exp rep -> Maybe (Exp rep)) -> Exp rep -> Maybe (Exp rep)
forall a b. (a -> b) -> a -> b
$ BasicOp -> Exp rep
forall rep. BasicOp -> Exp rep
BasicOp (BinOp -> SubExp -> SubExp -> BasicOp
BinOp (IntType -> Safety -> BinOp
SDiv IntType
t Safety
Safe) SubExp
x SubExp
y)
makeSafe (BasicOp (BinOp (SDivUp IntType
t Safety
_) SubExp
x SubExp
y)) =
  Exp rep -> Maybe (Exp rep)
forall a. a -> Maybe a
Just (Exp rep -> Maybe (Exp rep)) -> Exp rep -> Maybe (Exp rep)
forall a b. (a -> b) -> a -> b
$ BasicOp -> Exp rep
forall rep. BasicOp -> Exp rep
BasicOp (BinOp -> SubExp -> SubExp -> BasicOp
BinOp (IntType -> Safety -> BinOp
SDivUp IntType
t Safety
Safe) SubExp
x SubExp
y)
makeSafe (BasicOp (BinOp (SQuot IntType
t Safety
_) SubExp
x SubExp
y)) =
  Exp rep -> Maybe (Exp rep)
forall a. a -> Maybe a
Just (Exp rep -> Maybe (Exp rep)) -> Exp rep -> Maybe (Exp rep)
forall a b. (a -> b) -> a -> b
$ BasicOp -> Exp rep
forall rep. BasicOp -> Exp rep
BasicOp (BinOp -> SubExp -> SubExp -> BasicOp
BinOp (IntType -> Safety -> BinOp
SQuot IntType
t Safety
Safe) SubExp
x SubExp
y)
makeSafe (BasicOp (BinOp (UDiv IntType
t Safety
_) SubExp
x SubExp
y)) =
  Exp rep -> Maybe (Exp rep)
forall a. a -> Maybe a
Just (Exp rep -> Maybe (Exp rep)) -> Exp rep -> Maybe (Exp rep)
forall a b. (a -> b) -> a -> b
$ BasicOp -> Exp rep
forall rep. BasicOp -> Exp rep
BasicOp (BinOp -> SubExp -> SubExp -> BasicOp
BinOp (IntType -> Safety -> BinOp
UDiv IntType
t Safety
Safe) SubExp
x SubExp
y)
makeSafe (BasicOp (BinOp (UDivUp IntType
t Safety
_) SubExp
x SubExp
y)) =
  Exp rep -> Maybe (Exp rep)
forall a. a -> Maybe a
Just (Exp rep -> Maybe (Exp rep)) -> Exp rep -> Maybe (Exp rep)
forall a b. (a -> b) -> a -> b
$ BasicOp -> Exp rep
forall rep. BasicOp -> Exp rep
BasicOp (BinOp -> SubExp -> SubExp -> BasicOp
BinOp (IntType -> Safety -> BinOp
UDivUp IntType
t Safety
Safe) SubExp
x SubExp
y)
makeSafe (BasicOp (BinOp (SMod IntType
t Safety
_) SubExp
x SubExp
y)) =
  Exp rep -> Maybe (Exp rep)
forall a. a -> Maybe a
Just (Exp rep -> Maybe (Exp rep)) -> Exp rep -> Maybe (Exp rep)
forall a b. (a -> b) -> a -> b
$ BasicOp -> Exp rep
forall rep. BasicOp -> Exp rep
BasicOp (BinOp -> SubExp -> SubExp -> BasicOp
BinOp (IntType -> Safety -> BinOp
SMod IntType
t Safety
Safe) SubExp
x SubExp
y)
makeSafe (BasicOp (BinOp (SRem IntType
t Safety
_) SubExp
x SubExp
y)) =
  Exp rep -> Maybe (Exp rep)
forall a. a -> Maybe a
Just (Exp rep -> Maybe (Exp rep)) -> Exp rep -> Maybe (Exp rep)
forall a b. (a -> b) -> a -> b
$ BasicOp -> Exp rep
forall rep. BasicOp -> Exp rep
BasicOp (BinOp -> SubExp -> SubExp -> BasicOp
BinOp (IntType -> Safety -> BinOp
SRem IntType
t Safety
Safe) SubExp
x SubExp
y)
makeSafe (BasicOp (BinOp (UMod IntType
t Safety
_) SubExp
x SubExp
y)) =
  Exp rep -> Maybe (Exp rep)
forall a. a -> Maybe a
Just (Exp rep -> Maybe (Exp rep)) -> Exp rep -> Maybe (Exp rep)
forall a b. (a -> b) -> a -> b
$ BasicOp -> Exp rep
forall rep. BasicOp -> Exp rep
BasicOp (BinOp -> SubExp -> SubExp -> BasicOp
BinOp (IntType -> Safety -> BinOp
UMod IntType
t Safety
Safe) SubExp
x SubExp
y)
makeSafe Exp rep
_ =
  Maybe (Exp rep)
forall a. Maybe a
Nothing

emptyOfType :: MonadBuilder m => [VName] -> Type -> m (Exp (Rep m))
emptyOfType :: forall (m :: * -> *).
MonadBuilder m =>
[VName] -> Type -> m (Exp (Rep m))
emptyOfType [VName]
_ Mem {} =
  [Char] -> m (Exp (Rep m))
forall a. HasCallStack => [Char] -> a
error [Char]
"emptyOfType: Cannot hoist non-existential memory."
emptyOfType [VName]
_ Acc {} =
  [Char] -> m (Exp (Rep m))
forall a. HasCallStack => [Char] -> a
error [Char]
"emptyOfType: Cannot hoist accumulator."
emptyOfType [VName]
_ (Prim PrimType
pt) =
  Exp (Rep m) -> m (Exp (Rep m))
forall a. a -> m a
forall (f :: * -> *) a. Applicative f => a -> f a
pure (Exp (Rep m) -> m (Exp (Rep m))) -> Exp (Rep m) -> m (Exp (Rep m))
forall a b. (a -> b) -> a -> b
$ BasicOp -> Exp (Rep m)
forall rep. BasicOp -> Exp rep
BasicOp (BasicOp -> Exp (Rep m)) -> BasicOp -> Exp (Rep m)
forall a b. (a -> b) -> a -> b
$ SubExp -> BasicOp
SubExp (SubExp -> BasicOp) -> SubExp -> BasicOp
forall a b. (a -> b) -> a -> b
$ PrimValue -> SubExp
Constant (PrimValue -> SubExp) -> PrimValue -> SubExp
forall a b. (a -> b) -> a -> b
$ PrimType -> PrimValue
blankPrimValue PrimType
pt
emptyOfType [VName]
ctx_names (Array PrimType
et ShapeBase SubExp
shape NoUniqueness
_) = do
  let dims :: [SubExp]
dims = (SubExp -> SubExp) -> [SubExp] -> [SubExp]
forall a b. (a -> b) -> [a] -> [b]
map SubExp -> SubExp
zeroIfContext ([SubExp] -> [SubExp]) -> [SubExp] -> [SubExp]
forall a b. (a -> b) -> a -> b
$ ShapeBase SubExp -> [SubExp]
forall d. ShapeBase d -> [d]
shapeDims ShapeBase SubExp
shape
  Exp (Rep m) -> m (Exp (Rep m))
forall a. a -> m a
forall (f :: * -> *) a. Applicative f => a -> f a
pure (Exp (Rep m) -> m (Exp (Rep m))) -> Exp (Rep m) -> m (Exp (Rep m))
forall a b. (a -> b) -> a -> b
$ BasicOp -> Exp (Rep m)
forall rep. BasicOp -> Exp rep
BasicOp (BasicOp -> Exp (Rep m)) -> BasicOp -> Exp (Rep m)
forall a b. (a -> b) -> a -> b
$ PrimType -> [SubExp] -> BasicOp
Scratch PrimType
et [SubExp]
dims
  where
    zeroIfContext :: SubExp -> SubExp
zeroIfContext (Var VName
v) | VName
v VName -> [VName] -> Bool
forall a. Eq a => a -> [a] -> Bool
forall (t :: * -> *) a. (Foldable t, Eq a) => a -> t a -> Bool
`elem` [VName]
ctx_names = IntType -> Integer -> SubExp
intConst IntType
Int64 Integer
0
    zeroIfContext SubExp
se = SubExp
se

protectIf ::
  MonadBuilder m =>
  Protect m ->
  (Exp (Rep m) -> Bool) ->
  SubExp ->
  Stm (Rep m) ->
  m ()
protectIf :: forall (m :: * -> *).
MonadBuilder m =>
Protect m -> (Exp (Rep m) -> Bool) -> SubExp -> Stm (Rep m) -> m ()
protectIf Protect m
_ Exp (Rep m) -> Bool
_ SubExp
taken (Let Pat (LetDec (Rep m))
pat StmAux (ExpDec (Rep m))
aux (Match [SubExp
cond] [Case [Just (BoolValue Bool
True)] Body (Rep m)
taken_body] Body (Rep m)
untaken_body (MatchDec [BranchType (Rep m)]
if_ts MatchSort
MatchFallback))) = do
  SubExp
cond' <- [Char] -> Exp (Rep m) -> m SubExp
forall (m :: * -> *).
MonadBuilder m =>
[Char] -> Exp (Rep m) -> m SubExp
letSubExp [Char]
"protect_cond_conj" (Exp (Rep m) -> m SubExp) -> Exp (Rep m) -> m SubExp
forall a b. (a -> b) -> a -> b
$ BasicOp -> Exp (Rep m)
forall rep. BasicOp -> Exp rep
BasicOp (BasicOp -> Exp (Rep m)) -> BasicOp -> Exp (Rep m)
forall a b. (a -> b) -> a -> b
$ BinOp -> SubExp -> SubExp -> BasicOp
BinOp BinOp
LogAnd SubExp
taken SubExp
cond
  StmAux (ExpDec (Rep m)) -> m () -> m ()
forall (m :: * -> *) anyrep a.
MonadBuilder m =>
StmAux anyrep -> m a -> m a
auxing StmAux (ExpDec (Rep m))
aux (m () -> m ()) -> (Exp (Rep m) -> m ()) -> Exp (Rep m) -> m ()
forall b c a. (b -> c) -> (a -> b) -> a -> c
. Pat (LetDec (Rep m)) -> Exp (Rep m) -> m ()
forall (m :: * -> *).
MonadBuilder m =>
Pat (LetDec (Rep m)) -> Exp (Rep m) -> m ()
letBind Pat (LetDec (Rep m))
pat (Exp (Rep m) -> m ()) -> Exp (Rep m) -> m ()
forall a b. (a -> b) -> a -> b
$
    [SubExp]
-> [Case (Body (Rep m))]
-> Body (Rep m)
-> MatchDec (BranchType (Rep m))
-> Exp (Rep m)
forall rep.
[SubExp]
-> [Case (Body rep)]
-> Body rep
-> MatchDec (BranchType rep)
-> Exp rep
Match [SubExp
cond'] [[Maybe PrimValue] -> Body (Rep m) -> Case (Body (Rep m))
forall body. [Maybe PrimValue] -> body -> Case body
Case [PrimValue -> Maybe PrimValue
forall a. a -> Maybe a
Just (Bool -> PrimValue
BoolValue Bool
True)] Body (Rep m)
taken_body] Body (Rep m)
untaken_body (MatchDec (BranchType (Rep m)) -> Exp (Rep m))
-> MatchDec (BranchType (Rep m)) -> Exp (Rep m)
forall a b. (a -> b) -> a -> b
$
      [BranchType (Rep m)] -> MatchSort -> MatchDec (BranchType (Rep m))
forall rt. [rt] -> MatchSort -> MatchDec rt
MatchDec [BranchType (Rep m)]
if_ts MatchSort
MatchFallback
protectIf Protect m
_ Exp (Rep m) -> Bool
_ SubExp
taken (Let Pat (LetDec (Rep m))
pat StmAux (ExpDec (Rep m))
aux (BasicOp (Assert SubExp
cond ErrorMsg SubExp
msg (SrcLoc, [SrcLoc])
loc))) = do
  SubExp
not_taken <- [Char] -> Exp (Rep m) -> m SubExp
forall (m :: * -> *).
MonadBuilder m =>
[Char] -> Exp (Rep m) -> m SubExp
letSubExp [Char]
"loop_not_taken" (Exp (Rep m) -> m SubExp) -> Exp (Rep m) -> m SubExp
forall a b. (a -> b) -> a -> b
$ BasicOp -> Exp (Rep m)
forall rep. BasicOp -> Exp rep
BasicOp (BasicOp -> Exp (Rep m)) -> BasicOp -> Exp (Rep m)
forall a b. (a -> b) -> a -> b
$ UnOp -> SubExp -> BasicOp
UnOp UnOp
Not SubExp
taken
  SubExp
cond' <- [Char] -> Exp (Rep m) -> m SubExp
forall (m :: * -> *).
MonadBuilder m =>
[Char] -> Exp (Rep m) -> m SubExp
letSubExp [Char]
"protect_assert_disj" (Exp (Rep m) -> m SubExp) -> Exp (Rep m) -> m SubExp
forall a b. (a -> b) -> a -> b
$ BasicOp -> Exp (Rep m)
forall rep. BasicOp -> Exp rep
BasicOp (BasicOp -> Exp (Rep m)) -> BasicOp -> Exp (Rep m)
forall a b. (a -> b) -> a -> b
$ BinOp -> SubExp -> SubExp -> BasicOp
BinOp BinOp
LogOr SubExp
not_taken SubExp
cond
  StmAux (ExpDec (Rep m)) -> m () -> m ()
forall (m :: * -> *) anyrep a.
MonadBuilder m =>
StmAux anyrep -> m a -> m a
auxing StmAux (ExpDec (Rep m))
aux (m () -> m ()) -> m () -> m ()
forall a b. (a -> b) -> a -> b
$ Pat (LetDec (Rep m)) -> Exp (Rep m) -> m ()
forall (m :: * -> *).
MonadBuilder m =>
Pat (LetDec (Rep m)) -> Exp (Rep m) -> m ()
letBind Pat (LetDec (Rep m))
pat (Exp (Rep m) -> m ()) -> Exp (Rep m) -> m ()
forall a b. (a -> b) -> a -> b
$ BasicOp -> Exp (Rep m)
forall rep. BasicOp -> Exp rep
BasicOp (BasicOp -> Exp (Rep m)) -> BasicOp -> Exp (Rep m)
forall a b. (a -> b) -> a -> b
$ SubExp -> ErrorMsg SubExp -> (SrcLoc, [SrcLoc]) -> BasicOp
Assert SubExp
cond' ErrorMsg SubExp
msg (SrcLoc, [SrcLoc])
loc
protectIf Protect m
protect Exp (Rep m) -> Bool
_ SubExp
taken (Let Pat (LetDec (Rep m))
pat StmAux (ExpDec (Rep m))
aux (Op Op (Rep m)
op))
  | Just m ()
m <- Protect m
protect SubExp
taken Pat (LetDec (Rep m))
pat Op (Rep m)
op =
      StmAux (ExpDec (Rep m)) -> m () -> m ()
forall (m :: * -> *) anyrep a.
MonadBuilder m =>
StmAux anyrep -> m a -> m a
auxing StmAux (ExpDec (Rep m))
aux m ()
m
protectIf Protect m
_ Exp (Rep m) -> Bool
f SubExp
taken (Let Pat (LetDec (Rep m))
pat StmAux (ExpDec (Rep m))
aux Exp (Rep m)
e)
  | Exp (Rep m) -> Bool
f Exp (Rep m)
e =
      case Exp (Rep m) -> Maybe (Exp (Rep m))
forall rep. Exp rep -> Maybe (Exp rep)
makeSafe Exp (Rep m)
e of
        Just Exp (Rep m)
e' ->
          StmAux (ExpDec (Rep m)) -> m () -> m ()
forall (m :: * -> *) anyrep a.
MonadBuilder m =>
StmAux anyrep -> m a -> m a
auxing StmAux (ExpDec (Rep m))
aux (m () -> m ()) -> m () -> m ()
forall a b. (a -> b) -> a -> b
$ Pat (LetDec (Rep m)) -> Exp (Rep m) -> m ()
forall (m :: * -> *).
MonadBuilder m =>
Pat (LetDec (Rep m)) -> Exp (Rep m) -> m ()
letBind Pat (LetDec (Rep m))
pat Exp (Rep m)
e'
        Maybe (Exp (Rep m))
Nothing -> do
          Body (Rep m)
taken_body <- [m (Exp (Rep m))] -> m (Body (Rep m))
forall (m :: * -> *).
MonadBuilder m =>
[m (Exp (Rep m))] -> m (Body (Rep m))
eBody [Exp (Rep m) -> m (Exp (Rep m))
forall a. a -> m a
forall (f :: * -> *) a. Applicative f => a -> f a
pure Exp (Rep m)
e]
          Body (Rep m)
untaken_body <-
            [m (Exp (Rep m))] -> m (Body (Rep m))
forall (m :: * -> *).
MonadBuilder m =>
[m (Exp (Rep m))] -> m (Body (Rep m))
eBody ([m (Exp (Rep m))] -> m (Body (Rep m)))
-> [m (Exp (Rep m))] -> m (Body (Rep m))
forall a b. (a -> b) -> a -> b
$ (Type -> m (Exp (Rep m))) -> [Type] -> [m (Exp (Rep m))]
forall a b. (a -> b) -> [a] -> [b]
map ([VName] -> Type -> m (Exp (Rep m))
forall (m :: * -> *).
MonadBuilder m =>
[VName] -> Type -> m (Exp (Rep m))
emptyOfType ([VName] -> Type -> m (Exp (Rep m)))
-> [VName] -> Type -> m (Exp (Rep m))
forall a b. (a -> b) -> a -> b
$ Pat (LetDec (Rep m)) -> [VName]
forall dec. Pat dec -> [VName]
patNames Pat (LetDec (Rep m))
pat) (Pat (LetDec (Rep m)) -> [Type]
forall dec. Typed dec => Pat dec -> [Type]
patTypes Pat (LetDec (Rep m))
pat)
          [BranchType (Rep m)]
if_ts <- Pat (LetDec (Rep m)) -> m [BranchType (Rep m)]
forall rep (m :: * -> *).
(ASTRep rep, HasScope rep m, Monad m) =>
Pat (LetDec rep) -> m [BranchType rep]
forall (m :: * -> *).
(HasScope (Rep m) m, Monad m) =>
Pat (LetDec (Rep m)) -> m [BranchType (Rep m)]
expTypesFromPat Pat (LetDec (Rep m))
pat
          StmAux (ExpDec (Rep m)) -> m () -> m ()
forall (m :: * -> *) anyrep a.
MonadBuilder m =>
StmAux anyrep -> m a -> m a
auxing StmAux (ExpDec (Rep m))
aux (m () -> m ()) -> (Exp (Rep m) -> m ()) -> Exp (Rep m) -> m ()
forall b c a. (b -> c) -> (a -> b) -> a -> c
. Pat (LetDec (Rep m)) -> Exp (Rep m) -> m ()
forall (m :: * -> *).
MonadBuilder m =>
Pat (LetDec (Rep m)) -> Exp (Rep m) -> m ()
letBind Pat (LetDec (Rep m))
pat
            (Exp (Rep m) -> m ()) -> Exp (Rep m) -> m ()
forall a b. (a -> b) -> a -> b
$ [SubExp]
-> [Case (Body (Rep m))]
-> Body (Rep m)
-> MatchDec (BranchType (Rep m))
-> Exp (Rep m)
forall rep.
[SubExp]
-> [Case (Body rep)]
-> Body rep
-> MatchDec (BranchType rep)
-> Exp rep
Match
              [SubExp
taken]
              [[Maybe PrimValue] -> Body (Rep m) -> Case (Body (Rep m))
forall body. [Maybe PrimValue] -> body -> Case body
Case [PrimValue -> Maybe PrimValue
forall a. a -> Maybe a
Just (PrimValue -> Maybe PrimValue) -> PrimValue -> Maybe PrimValue
forall a b. (a -> b) -> a -> b
$ Bool -> PrimValue
BoolValue Bool
True] Body (Rep m)
taken_body]
              Body (Rep m)
untaken_body
            (MatchDec (BranchType (Rep m)) -> Exp (Rep m))
-> MatchDec (BranchType (Rep m)) -> Exp (Rep m)
forall a b. (a -> b) -> a -> b
$ [BranchType (Rep m)] -> MatchSort -> MatchDec (BranchType (Rep m))
forall rt. [rt] -> MatchSort -> MatchDec rt
MatchDec [BranchType (Rep m)]
if_ts MatchSort
MatchFallback
protectIf Protect m
_ Exp (Rep m) -> Bool
_ SubExp
_ Stm (Rep m)
stm =
  Stm (Rep m) -> m ()
forall (m :: * -> *). MonadBuilder m => Stm (Rep m) -> m ()
addStm Stm (Rep m)
stm

-- | We are willing to hoist potentially unsafe statements out of
-- loops, but they must be protected by adding a branch on top of
-- them.
protectLoopHoisted ::
  SimplifiableRep rep =>
  [(FParam (Wise rep), SubExp)] ->
  LoopForm (Wise rep) ->
  SimpleM rep (a, b, Stms (Wise rep)) ->
  SimpleM rep (a, b, Stms (Wise rep))
protectLoopHoisted :: forall rep a b.
SimplifiableRep rep =>
[(FParam (Wise rep), SubExp)]
-> LoopForm (Wise rep)
-> SimpleM rep (a, b, Stms (Wise rep))
-> SimpleM rep (a, b, Stms (Wise rep))
protectLoopHoisted [(FParam (Wise rep), SubExp)]
merge LoopForm (Wise rep)
form SimpleM rep (a, b, Stms (Wise rep))
m = do
  (a
x, b
y, Stms (Wise rep)
stms) <- SimpleM rep (a, b, Stms (Wise rep))
m
  SubExp
-> Pat (VarWisdom, LetDec rep)
-> OpC rep (Wise rep)
-> Maybe (Builder (Wise rep) ())
ops <- ((SimpleOps rep, Env rep)
 -> SubExp
 -> Pat (VarWisdom, LetDec rep)
 -> OpC rep (Wise rep)
 -> Maybe (Builder (Wise rep) ()))
-> SimpleM
     rep
     (SubExp
      -> Pat (VarWisdom, LetDec rep)
      -> OpC rep (Wise rep)
      -> Maybe (Builder (Wise rep) ()))
forall r (m :: * -> *) a. MonadReader r m => (r -> a) -> m a
asks (((SimpleOps rep, Env rep)
  -> SubExp
  -> Pat (VarWisdom, LetDec rep)
  -> OpC rep (Wise rep)
  -> Maybe (Builder (Wise rep) ()))
 -> SimpleM
      rep
      (SubExp
       -> Pat (VarWisdom, LetDec rep)
       -> OpC rep (Wise rep)
       -> Maybe (Builder (Wise rep) ())))
-> ((SimpleOps rep, Env rep)
    -> SubExp
    -> Pat (VarWisdom, LetDec rep)
    -> OpC rep (Wise rep)
    -> Maybe (Builder (Wise rep) ()))
-> SimpleM
     rep
     (SubExp
      -> Pat (VarWisdom, LetDec rep)
      -> OpC rep (Wise rep)
      -> Maybe (Builder (Wise rep) ()))
forall a b. (a -> b) -> a -> b
$ SimpleOps rep
-> SubExp
-> Pat (VarWisdom, LetDec rep)
-> OpC rep (Wise rep)
-> Maybe (Builder (Wise rep) ())
SimpleOps rep -> Protect (BuilderT (Wise rep) (State VNameSource))
forall rep. SimpleOps rep -> Protect (Builder (Wise rep))
protectHoistedOpS (SimpleOps rep
 -> SubExp
 -> Pat (VarWisdom, LetDec rep)
 -> OpC rep (Wise rep)
 -> Maybe (Builder (Wise rep) ()))
-> ((SimpleOps rep, Env rep) -> SimpleOps rep)
-> (SimpleOps rep, Env rep)
-> SubExp
-> Pat (VarWisdom, LetDec rep)
-> OpC rep (Wise rep)
-> Maybe (Builder (Wise rep) ())
forall b c a. (b -> c) -> (a -> b) -> a -> c
. (SimpleOps rep, Env rep) -> SimpleOps rep
forall a b. (a, b) -> a
fst
  Stms (Wise rep)
stms' <- Builder (Wise rep) () -> SimpleM rep (Stms (Wise rep))
forall (m :: * -> *) somerep rep a.
(MonadFreshNames m, HasScope somerep m, SameScope somerep rep) =>
Builder rep a -> m (Stms rep)
runBuilder_ (Builder (Wise rep) () -> SimpleM rep (Stms (Wise rep)))
-> Builder (Wise rep) () -> SimpleM rep (Stms (Wise rep))
forall a b. (a -> b) -> a -> b
$ do
    if Bool -> Bool
not (Bool -> Bool) -> Bool -> Bool
forall a b. (a -> b) -> a -> b
$ (Stm (Wise rep) -> Bool) -> Stms (Wise rep) -> Bool
forall (t :: * -> *) a. Foldable t => (a -> Bool) -> t a -> Bool
all (Exp (Wise rep) -> Bool
forall rep. IsOp (Op rep) => Exp rep -> Bool
safeExp (Exp (Wise rep) -> Bool)
-> (Stm (Wise rep) -> Exp (Wise rep)) -> Stm (Wise rep) -> Bool
forall b c a. (b -> c) -> (a -> b) -> a -> c
. Stm (Wise rep) -> Exp (Wise rep)
forall rep. Stm rep -> Exp rep
stmExp) Stms (Wise rep)
stms
      then do
        SubExp
is_nonempty <- BuilderT (Wise rep) (State VNameSource) SubExp
checkIfNonEmpty
        (Stm (Wise rep) -> Builder (Wise rep) ())
-> Stms (Wise rep) -> Builder (Wise rep) ()
forall (t :: * -> *) (m :: * -> *) a b.
(Foldable t, Monad m) =>
(a -> m b) -> t a -> m ()
mapM_ (Protect (BuilderT (Wise rep) (State VNameSource))
-> (Exp (Rep (BuilderT (Wise rep) (State VNameSource))) -> Bool)
-> SubExp
-> Stm (Rep (BuilderT (Wise rep) (State VNameSource)))
-> Builder (Wise rep) ()
forall (m :: * -> *).
MonadBuilder m =>
Protect m -> (Exp (Rep m) -> Bool) -> SubExp -> Stm (Rep m) -> m ()
protectIf SubExp
-> Pat (VarWisdom, LetDec rep)
-> OpC rep (Wise rep)
-> Maybe (Builder (Wise rep) ())
Protect (BuilderT (Wise rep) (State VNameSource))
ops (Bool -> Bool
not (Bool -> Bool)
-> (Exp (Wise rep) -> Bool) -> Exp (Wise rep) -> Bool
forall b c a. (b -> c) -> (a -> b) -> a -> c
. Exp (Wise rep) -> Bool
forall rep. IsOp (Op rep) => Exp rep -> Bool
safeExp) SubExp
is_nonempty) Stms (Wise rep)
stms
      else Stms (Rep (BuilderT (Wise rep) (State VNameSource)))
-> Builder (Wise rep) ()
forall (m :: * -> *). MonadBuilder m => Stms (Rep m) -> m ()
addStms Stms (Rep (BuilderT (Wise rep) (State VNameSource)))
Stms (Wise rep)
stms
  (a, b, Stms (Wise rep)) -> SimpleM rep (a, b, Stms (Wise rep))
forall a. a -> SimpleM rep a
forall (f :: * -> *) a. Applicative f => a -> f a
pure (a
x, b
y, Stms (Wise rep)
stms')
  where
    checkIfNonEmpty :: BuilderT (Wise rep) (State VNameSource) SubExp
checkIfNonEmpty =
      case LoopForm (Wise rep)
form of
        WhileLoop VName
cond
          | Just (Param (FParamInfo rep)
_, SubExp
cond_init) <-
              ((Param (FParamInfo rep), SubExp) -> Bool)
-> [(Param (FParamInfo rep), SubExp)]
-> Maybe (Param (FParamInfo rep), SubExp)
forall (t :: * -> *) a. Foldable t => (a -> Bool) -> t a -> Maybe a
find ((VName -> VName -> Bool
forall a. Eq a => a -> a -> Bool
== VName
cond) (VName -> Bool)
-> ((Param (FParamInfo rep), SubExp) -> VName)
-> (Param (FParamInfo rep), SubExp)
-> Bool
forall b c a. (b -> c) -> (a -> b) -> a -> c
. Param (FParamInfo rep) -> VName
forall dec. Param dec -> VName
paramName (Param (FParamInfo rep) -> VName)
-> ((Param (FParamInfo rep), SubExp) -> Param (FParamInfo rep))
-> (Param (FParamInfo rep), SubExp)
-> VName
forall b c a. (b -> c) -> (a -> b) -> a -> c
. (Param (FParamInfo rep), SubExp) -> Param (FParamInfo rep)
forall a b. (a, b) -> a
fst) [(Param (FParamInfo rep), SubExp)]
[(FParam (Wise rep), SubExp)]
merge ->
              SubExp -> BuilderT (Wise rep) (State VNameSource) SubExp
forall a. a -> BuilderT (Wise rep) (State VNameSource) a
forall (f :: * -> *) a. Applicative f => a -> f a
pure SubExp
cond_init
          | Bool
otherwise -> SubExp -> BuilderT (Wise rep) (State VNameSource) SubExp
forall a. a -> BuilderT (Wise rep) (State VNameSource) a
forall (f :: * -> *) a. Applicative f => a -> f a
pure (SubExp -> BuilderT (Wise rep) (State VNameSource) SubExp)
-> SubExp -> BuilderT (Wise rep) (State VNameSource) SubExp
forall a b. (a -> b) -> a -> b
$ Bool -> SubExp
forall v. IsValue v => v -> SubExp
constant Bool
True -- infinite loop
        ForLoop VName
_ IntType
it SubExp
bound [(LParam (Wise rep), VName)]
_ ->
          [Char]
-> Exp (Rep (BuilderT (Wise rep) (State VNameSource)))
-> BuilderT (Wise rep) (State VNameSource) SubExp
forall (m :: * -> *).
MonadBuilder m =>
[Char] -> Exp (Rep m) -> m SubExp
letSubExp [Char]
"loop_nonempty" (Exp (Rep (BuilderT (Wise rep) (State VNameSource)))
 -> BuilderT (Wise rep) (State VNameSource) SubExp)
-> Exp (Rep (BuilderT (Wise rep) (State VNameSource)))
-> BuilderT (Wise rep) (State VNameSource) SubExp
forall a b. (a -> b) -> a -> b
$
            BasicOp -> Exp (Rep (BuilderT (Wise rep) (State VNameSource)))
forall rep. BasicOp -> Exp rep
BasicOp (BasicOp -> Exp (Rep (BuilderT (Wise rep) (State VNameSource))))
-> BasicOp -> Exp (Rep (BuilderT (Wise rep) (State VNameSource)))
forall a b. (a -> b) -> a -> b
$
              CmpOp -> SubExp -> SubExp -> BasicOp
CmpOp (IntType -> CmpOp
CmpSlt IntType
it) (IntType -> Integer -> SubExp
intConst IntType
it Integer
0) SubExp
bound

-- Produces a true subexpression if the pattern (as in a 'Case')
-- matches the subexpression.
matching ::
  BuilderOps rep =>
  [(SubExp, Maybe PrimValue)] ->
  Builder rep SubExp
matching :: forall rep.
BuilderOps rep =>
[(SubExp, Maybe PrimValue)] -> Builder rep SubExp
matching = [Char]
-> Exp (Rep (BuilderT rep (State VNameSource)))
-> BuilderT rep (State VNameSource) SubExp
forall (m :: * -> *).
MonadBuilder m =>
[Char] -> Exp (Rep m) -> m SubExp
letSubExp [Char]
"match" (Exp rep -> BuilderT rep (State VNameSource) SubExp)
-> ([(SubExp, Maybe PrimValue)]
    -> BuilderT rep (State VNameSource) (Exp rep))
-> [(SubExp, Maybe PrimValue)]
-> BuilderT rep (State VNameSource) SubExp
forall (m :: * -> *) b c a.
Monad m =>
(b -> m c) -> (a -> m b) -> a -> m c
<=< [SubExp] -> BuilderT rep (State VNameSource) (Exp rep)
[SubExp]
-> BuilderT
     rep
     (State VNameSource)
     (Exp (Rep (BuilderT rep (State VNameSource))))
forall (m :: * -> *). MonadBuilder m => [SubExp] -> m (Exp (Rep m))
eAll ([SubExp] -> BuilderT rep (State VNameSource) (Exp rep))
-> ([(SubExp, Maybe PrimValue)]
    -> BuilderT rep (State VNameSource) [SubExp])
-> [(SubExp, Maybe PrimValue)]
-> BuilderT rep (State VNameSource) (Exp rep)
forall (m :: * -> *) b c a.
Monad m =>
(b -> m c) -> (a -> m b) -> a -> m c
<=< [BuilderT rep (State VNameSource) SubExp]
-> BuilderT rep (State VNameSource) [SubExp]
forall (t :: * -> *) (m :: * -> *) a.
(Traversable t, Monad m) =>
t (m a) -> m (t a)
forall (m :: * -> *) a. Monad m => [m a] -> m [a]
sequence ([BuilderT rep (State VNameSource) SubExp]
 -> BuilderT rep (State VNameSource) [SubExp])
-> ([(SubExp, Maybe PrimValue)]
    -> [BuilderT rep (State VNameSource) SubExp])
-> [(SubExp, Maybe PrimValue)]
-> BuilderT rep (State VNameSource) [SubExp]
forall b c a. (b -> c) -> (a -> b) -> a -> c
. ((SubExp, Maybe PrimValue)
 -> Maybe (BuilderT rep (State VNameSource) SubExp))
-> [(SubExp, Maybe PrimValue)]
-> [BuilderT rep (State VNameSource) SubExp]
forall a b. (a -> Maybe b) -> [a] -> [b]
mapMaybe (SubExp, Maybe PrimValue)
-> Maybe (BuilderT rep (State VNameSource) SubExp)
forall {f :: * -> *}.
MonadBuilder f =>
(SubExp, Maybe PrimValue) -> Maybe (f SubExp)
cmp
  where
    cmp :: (SubExp, Maybe PrimValue) -> Maybe (f SubExp)
cmp (SubExp
se, Just (BoolValue Bool
True)) =
      f SubExp -> Maybe (f SubExp)
forall a. a -> Maybe a
Just (f SubExp -> Maybe (f SubExp)) -> f SubExp -> Maybe (f SubExp)
forall a b. (a -> b) -> a -> b
$ SubExp -> f SubExp
forall a. a -> f a
forall (f :: * -> *) a. Applicative f => a -> f a
pure SubExp
se
    cmp (SubExp
se, Just PrimValue
v) =
      f SubExp -> Maybe (f SubExp)
forall a. a -> Maybe a
Just (f SubExp -> Maybe (f SubExp))
-> (BasicOp -> f SubExp) -> BasicOp -> Maybe (f SubExp)
forall b c a. (b -> c) -> (a -> b) -> a -> c
. [Char] -> Exp (Rep f) -> f SubExp
forall (m :: * -> *).
MonadBuilder m =>
[Char] -> Exp (Rep m) -> m SubExp
letSubExp [Char]
"match_val" (Exp (Rep f) -> f SubExp)
-> (BasicOp -> Exp (Rep f)) -> BasicOp -> f SubExp
forall b c a. (b -> c) -> (a -> b) -> a -> c
. BasicOp -> Exp (Rep f)
forall rep. BasicOp -> Exp rep
BasicOp (BasicOp -> Maybe (f SubExp)) -> BasicOp -> Maybe (f SubExp)
forall a b. (a -> b) -> a -> b
$
        CmpOp -> SubExp -> SubExp -> BasicOp
CmpOp (PrimType -> CmpOp
CmpEq (PrimValue -> PrimType
primValueType PrimValue
v)) SubExp
se (PrimValue -> SubExp
Constant PrimValue
v)
    cmp (SubExp
_, Maybe PrimValue
Nothing) = Maybe (f SubExp)
forall a. Maybe a
Nothing

matchingExactlyThis ::
  BuilderOps rep =>
  [SubExp] ->
  [[Maybe PrimValue]] ->
  [Maybe PrimValue] ->
  Builder rep SubExp
matchingExactlyThis :: forall rep.
BuilderOps rep =>
[SubExp]
-> [[Maybe PrimValue]] -> [Maybe PrimValue] -> Builder rep SubExp
matchingExactlyThis [SubExp]
ses [[Maybe PrimValue]]
prior [Maybe PrimValue]
this = do
  [SubExp]
prior_matches <- ([Maybe PrimValue] -> Builder rep SubExp)
-> [[Maybe PrimValue]] -> BuilderT rep (State VNameSource) [SubExp]
forall (t :: * -> *) (m :: * -> *) a b.
(Traversable t, Monad m) =>
(a -> m b) -> t a -> m (t b)
forall (m :: * -> *) a b. Monad m => (a -> m b) -> [a] -> m [b]
mapM ([(SubExp, Maybe PrimValue)] -> Builder rep SubExp
forall rep.
BuilderOps rep =>
[(SubExp, Maybe PrimValue)] -> Builder rep SubExp
matching ([(SubExp, Maybe PrimValue)] -> Builder rep SubExp)
-> ([Maybe PrimValue] -> [(SubExp, Maybe PrimValue)])
-> [Maybe PrimValue]
-> Builder rep SubExp
forall b c a. (b -> c) -> (a -> b) -> a -> c
. [SubExp] -> [Maybe PrimValue] -> [(SubExp, Maybe PrimValue)]
forall a b. [a] -> [b] -> [(a, b)]
zip [SubExp]
ses) [[Maybe PrimValue]]
prior
  [Char]
-> Exp (Rep (BuilderT rep (State VNameSource)))
-> Builder rep SubExp
forall (m :: * -> *).
MonadBuilder m =>
[Char] -> Exp (Rep m) -> m SubExp
letSubExp [Char]
"matching_just_this"
    (Exp rep -> Builder rep SubExp)
-> BuilderT rep (State VNameSource) (Exp rep) -> Builder rep SubExp
forall (m :: * -> *) a b. Monad m => (a -> m b) -> m a -> m b
=<< BinOp
-> BuilderT
     rep
     (State VNameSource)
     (Exp (Rep (BuilderT rep (State VNameSource))))
-> BuilderT
     rep
     (State VNameSource)
     (Exp (Rep (BuilderT rep (State VNameSource))))
-> BuilderT
     rep
     (State VNameSource)
     (Exp (Rep (BuilderT rep (State VNameSource))))
forall (m :: * -> *).
MonadBuilder m =>
BinOp -> m (Exp (Rep m)) -> m (Exp (Rep m)) -> m (Exp (Rep m))
eBinOp
      BinOp
LogAnd
      (UnOp
-> BuilderT
     rep
     (State VNameSource)
     (Exp (Rep (BuilderT rep (State VNameSource))))
-> BuilderT
     rep
     (State VNameSource)
     (Exp (Rep (BuilderT rep (State VNameSource))))
forall (m :: * -> *).
MonadBuilder m =>
UnOp -> m (Exp (Rep m)) -> m (Exp (Rep m))
eUnOp UnOp
Not ([SubExp]
-> BuilderT
     rep
     (State VNameSource)
     (Exp (Rep (BuilderT rep (State VNameSource))))
forall (m :: * -> *). MonadBuilder m => [SubExp] -> m (Exp (Rep m))
eAny [SubExp]
prior_matches))
      (SubExp -> BuilderT rep (State VNameSource) (Exp rep)
SubExp
-> BuilderT
     rep
     (State VNameSource)
     (Exp (Rep (BuilderT rep (State VNameSource))))
forall (m :: * -> *). MonadBuilder m => SubExp -> m (Exp (Rep m))
eSubExp (SubExp -> BuilderT rep (State VNameSource) (Exp rep))
-> Builder rep SubExp -> BuilderT rep (State VNameSource) (Exp rep)
forall (m :: * -> *) a b. Monad m => (a -> m b) -> m a -> m b
=<< [(SubExp, Maybe PrimValue)] -> Builder rep SubExp
forall rep.
BuilderOps rep =>
[(SubExp, Maybe PrimValue)] -> Builder rep SubExp
matching ([SubExp] -> [Maybe PrimValue] -> [(SubExp, Maybe PrimValue)]
forall a b. [a] -> [b] -> [(a, b)]
zip [SubExp]
ses [Maybe PrimValue]
this))

-- | We are willing to hoist potentially unsafe statements out of
-- matches, but they must be protected by adding a branch on top of
-- them.  (This means such hoisting is not worth it unless they are in
-- turn hoisted out of a loop somewhere.)
protectCaseHoisted ::
  SimplifiableRep rep =>
  -- | Scrutinee.
  [SubExp] ->
  -- | Pattern of previosu cases.
  [[Maybe PrimValue]] ->
  -- | Pattern of this case.
  [Maybe PrimValue] ->
  SimpleM rep (Stms (Wise rep), a) ->
  SimpleM rep (Stms (Wise rep), a)
protectCaseHoisted :: forall rep a.
SimplifiableRep rep =>
[SubExp]
-> [[Maybe PrimValue]]
-> [Maybe PrimValue]
-> SimpleM rep (Stms (Wise rep), a)
-> SimpleM rep (Stms (Wise rep), a)
protectCaseHoisted [SubExp]
ses [[Maybe PrimValue]]
prior [Maybe PrimValue]
vs SimpleM rep (Stms (Wise rep), a)
m = do
  (Stms (Wise rep)
hoisted, a
x) <- SimpleM rep (Stms (Wise rep), a)
m
  SubExp
-> Pat (VarWisdom, LetDec rep)
-> OpC rep (Wise rep)
-> Maybe (Builder (Wise rep) ())
ops <- ((SimpleOps rep, Env rep)
 -> SubExp
 -> Pat (VarWisdom, LetDec rep)
 -> OpC rep (Wise rep)
 -> Maybe (Builder (Wise rep) ()))
-> SimpleM
     rep
     (SubExp
      -> Pat (VarWisdom, LetDec rep)
      -> OpC rep (Wise rep)
      -> Maybe (Builder (Wise rep) ()))
forall r (m :: * -> *) a. MonadReader r m => (r -> a) -> m a
asks (((SimpleOps rep, Env rep)
  -> SubExp
  -> Pat (VarWisdom, LetDec rep)
  -> OpC rep (Wise rep)
  -> Maybe (Builder (Wise rep) ()))
 -> SimpleM
      rep
      (SubExp
       -> Pat (VarWisdom, LetDec rep)
       -> OpC rep (Wise rep)
       -> Maybe (Builder (Wise rep) ())))
-> ((SimpleOps rep, Env rep)
    -> SubExp
    -> Pat (VarWisdom, LetDec rep)
    -> OpC rep (Wise rep)
    -> Maybe (Builder (Wise rep) ()))
-> SimpleM
     rep
     (SubExp
      -> Pat (VarWisdom, LetDec rep)
      -> OpC rep (Wise rep)
      -> Maybe (Builder (Wise rep) ()))
forall a b. (a -> b) -> a -> b
$ SimpleOps rep
-> SubExp
-> Pat (VarWisdom, LetDec rep)
-> OpC rep (Wise rep)
-> Maybe (Builder (Wise rep) ())
SimpleOps rep -> Protect (BuilderT (Wise rep) (State VNameSource))
forall rep. SimpleOps rep -> Protect (Builder (Wise rep))
protectHoistedOpS (SimpleOps rep
 -> SubExp
 -> Pat (VarWisdom, LetDec rep)
 -> OpC rep (Wise rep)
 -> Maybe (Builder (Wise rep) ()))
-> ((SimpleOps rep, Env rep) -> SimpleOps rep)
-> (SimpleOps rep, Env rep)
-> SubExp
-> Pat (VarWisdom, LetDec rep)
-> OpC rep (Wise rep)
-> Maybe (Builder (Wise rep) ())
forall b c a. (b -> c) -> (a -> b) -> a -> c
. (SimpleOps rep, Env rep) -> SimpleOps rep
forall a b. (a, b) -> a
fst
  Stms (Wise rep)
hoisted' <- Builder (Wise rep) () -> SimpleM rep (Stms (Wise rep))
forall (m :: * -> *) somerep rep a.
(MonadFreshNames m, HasScope somerep m, SameScope somerep rep) =>
Builder rep a -> m (Stms rep)
runBuilder_ (Builder (Wise rep) () -> SimpleM rep (Stms (Wise rep)))
-> Builder (Wise rep) () -> SimpleM rep (Stms (Wise rep))
forall a b. (a -> b) -> a -> b
$ do
    if Bool -> Bool
not (Bool -> Bool) -> Bool -> Bool
forall a b. (a -> b) -> a -> b
$ (Stm (Wise rep) -> Bool) -> Stms (Wise rep) -> Bool
forall (t :: * -> *) a. Foldable t => (a -> Bool) -> t a -> Bool
all (Exp (Wise rep) -> Bool
forall rep. IsOp (Op rep) => Exp rep -> Bool
safeExp (Exp (Wise rep) -> Bool)
-> (Stm (Wise rep) -> Exp (Wise rep)) -> Stm (Wise rep) -> Bool
forall b c a. (b -> c) -> (a -> b) -> a -> c
. Stm (Wise rep) -> Exp (Wise rep)
forall rep. Stm rep -> Exp rep
stmExp) Stms (Wise rep)
hoisted
      then do
        SubExp
cond' <- [SubExp]
-> [[Maybe PrimValue]]
-> [Maybe PrimValue]
-> Builder (Wise rep) SubExp
forall rep.
BuilderOps rep =>
[SubExp]
-> [[Maybe PrimValue]] -> [Maybe PrimValue] -> Builder rep SubExp
matchingExactlyThis [SubExp]
ses [[Maybe PrimValue]]
prior [Maybe PrimValue]
vs
        (Stm (Wise rep) -> Builder (Wise rep) ())
-> Stms (Wise rep) -> Builder (Wise rep) ()
forall (t :: * -> *) (m :: * -> *) a b.
(Foldable t, Monad m) =>
(a -> m b) -> t a -> m ()
mapM_ (Protect (BuilderT (Wise rep) (State VNameSource))
-> (Exp (Rep (BuilderT (Wise rep) (State VNameSource))) -> Bool)
-> SubExp
-> Stm (Rep (BuilderT (Wise rep) (State VNameSource)))
-> Builder (Wise rep) ()
forall (m :: * -> *).
MonadBuilder m =>
Protect m -> (Exp (Rep m) -> Bool) -> SubExp -> Stm (Rep m) -> m ()
protectIf SubExp
-> Pat (VarWisdom, LetDec rep)
-> OpC rep (Wise rep)
-> Maybe (Builder (Wise rep) ())
Protect (BuilderT (Wise rep) (State VNameSource))
ops Exp (Rep (BuilderT (Wise rep) (State VNameSource))) -> Bool
Exp (Wise rep) -> Bool
forall {rep}. ASTRep rep => Exp rep -> Bool
unsafeOrCostly SubExp
cond') Stms (Wise rep)
hoisted
      else Stms (Rep (BuilderT (Wise rep) (State VNameSource)))
-> Builder (Wise rep) ()
forall (m :: * -> *). MonadBuilder m => Stms (Rep m) -> m ()
addStms Stms (Rep (BuilderT (Wise rep) (State VNameSource)))
Stms (Wise rep)
hoisted
  (Stms (Wise rep), a) -> SimpleM rep (Stms (Wise rep), a)
forall a. a -> SimpleM rep a
forall (f :: * -> *) a. Applicative f => a -> f a
pure (Stms (Wise rep)
hoisted', a
x)
  where
    unsafeOrCostly :: Exp rep -> Bool
unsafeOrCostly Exp rep
e = Bool -> Bool
not (Exp rep -> Bool
forall rep. IsOp (Op rep) => Exp rep -> Bool
safeExp Exp rep
e) Bool -> Bool -> Bool
|| Bool -> Bool
not (Exp rep -> Bool
forall {rep}. ASTRep rep => Exp rep -> Bool
cheapExp Exp rep
e)

-- | Statements that are not worth hoisting out of loops, because they
-- are unsafe, and added safety (by 'protectLoopHoisted') may inhibit
-- further optimisation.
notWorthHoisting :: ASTRep rep => BlockPred rep
notWorthHoisting :: forall rep. ASTRep rep => BlockPred rep
notWorthHoisting SymbolTable rep
_ UsageTable
_ (Let Pat (LetDec rep)
pat StmAux (ExpDec rep)
_ Exp rep
e) =
  Bool -> Bool
not (Exp rep -> Bool
forall rep. IsOp (Op rep) => Exp rep -> Bool
safeExp Exp rep
e) Bool -> Bool -> Bool
&& (Type -> Bool) -> [Type] -> Bool
forall (t :: * -> *) a. Foldable t => (a -> Bool) -> t a -> Bool
any ((Int -> Int -> Bool
forall a. Ord a => a -> a -> Bool
> Int
0) (Int -> Bool) -> (Type -> Int) -> Type -> Bool
forall b c a. (b -> c) -> (a -> b) -> a -> c
. Type -> Int
forall shape u. ArrayShape shape => TypeBase shape u -> Int
arrayRank) (Pat (LetDec rep) -> [Type]
forall dec. Typed dec => Pat dec -> [Type]
patTypes Pat (LetDec rep)
pat)

-- Top-down simplify a statement (including copy propagation into the
-- pattern and such).  Does not recurse into any sub-Bodies or Ops.
nonrecSimplifyStm ::
  SimplifiableRep rep =>
  Stm (Wise rep) ->
  SimpleM rep (Stm (Wise rep))
nonrecSimplifyStm :: forall rep.
SimplifiableRep rep =>
Stm (Wise rep) -> SimpleM rep (Stm (Wise rep))
nonrecSimplifyStm (Let Pat (LetDec (Wise rep))
pat (StmAux Certs
cs Attrs
attrs (ExpWisdom
_, ExpDec rep
dec)) Exp (Wise rep)
e) = do
  Certs
cs' <- Certs -> SimpleM rep Certs
forall rep. SimplifiableRep rep => Certs -> SimpleM rep Certs
forall e rep.
(Simplifiable e, SimplifiableRep rep) =>
e -> SimpleM rep e
simplify Certs
cs
  Exp (Wise rep)
e' <- Exp (Wise rep) -> SimpleM rep (Exp (Wise rep))
forall rep.
SimplifiableRep rep =>
Exp (Wise rep) -> SimpleM rep (Exp (Wise rep))
simplifyExpBase Exp (Wise rep)
e
  Pat (LetDec rep)
-> Exp (Wise rep) -> SimpleM rep (Pat (LetDec rep))
simplifyPat <- ((SimpleOps rep, Env rep)
 -> Pat (LetDec rep)
 -> Exp (Wise rep)
 -> SimpleM rep (Pat (LetDec rep)))
-> SimpleM
     rep
     (Pat (LetDec rep)
      -> Exp (Wise rep) -> SimpleM rep (Pat (LetDec rep)))
forall r (m :: * -> *) a. MonadReader r m => (r -> a) -> m a
asks (((SimpleOps rep, Env rep)
  -> Pat (LetDec rep)
  -> Exp (Wise rep)
  -> SimpleM rep (Pat (LetDec rep)))
 -> SimpleM
      rep
      (Pat (LetDec rep)
       -> Exp (Wise rep) -> SimpleM rep (Pat (LetDec rep))))
-> ((SimpleOps rep, Env rep)
    -> Pat (LetDec rep)
    -> Exp (Wise rep)
    -> SimpleM rep (Pat (LetDec rep)))
-> SimpleM
     rep
     (Pat (LetDec rep)
      -> Exp (Wise rep) -> SimpleM rep (Pat (LetDec rep)))
forall a b. (a -> b) -> a -> b
$ SimpleOps rep
-> Pat (LetDec rep)
-> Exp (Wise rep)
-> SimpleM rep (Pat (LetDec rep))
forall rep.
SimpleOps rep
-> Pat (LetDec rep)
-> Exp (Wise rep)
-> SimpleM rep (Pat (LetDec rep))
simplifyPatFromExpS (SimpleOps rep
 -> Pat (LetDec rep)
 -> Exp (Wise rep)
 -> SimpleM rep (Pat (LetDec rep)))
-> ((SimpleOps rep, Env rep) -> SimpleOps rep)
-> (SimpleOps rep, Env rep)
-> Pat (LetDec rep)
-> Exp (Wise rep)
-> SimpleM rep (Pat (LetDec rep))
forall b c a. (b -> c) -> (a -> b) -> a -> c
. (SimpleOps rep, Env rep) -> SimpleOps rep
forall a b. (a, b) -> a
fst
  (Pat (LetDec rep)
pat', Certs
pat_cs) <- SimpleM rep (Pat (LetDec rep))
-> SimpleM rep (Pat (LetDec rep), Certs)
forall rep a. SimpleM rep a -> SimpleM rep (a, Certs)
collectCerts (SimpleM rep (Pat (LetDec rep))
 -> SimpleM rep (Pat (LetDec rep), Certs))
-> SimpleM rep (Pat (LetDec rep))
-> SimpleM rep (Pat (LetDec rep), Certs)
forall a b. (a -> b) -> a -> b
$ Pat (LetDec rep)
-> Exp (Wise rep) -> SimpleM rep (Pat (LetDec rep))
simplifyPat (Pat (VarWisdom, LetDec rep) -> Pat (LetDec rep)
forall a. Pat (VarWisdom, a) -> Pat a
removePatWisdom Pat (VarWisdom, LetDec rep)
Pat (LetDec (Wise rep))
pat) Exp (Wise rep)
e'
  let aux' :: StmAux (ExpDec rep)
aux' = Certs -> Attrs -> ExpDec rep -> StmAux (ExpDec rep)
forall dec. Certs -> Attrs -> dec -> StmAux dec
StmAux (Certs
cs' Certs -> Certs -> Certs
forall a. Semigroup a => a -> a -> a
<> Certs
pat_cs) Attrs
attrs ExpDec rep
dec
  Stm (Wise rep) -> SimpleM rep (Stm (Wise rep))
forall a. a -> SimpleM rep a
forall (f :: * -> *) a. Applicative f => a -> f a
pure (Stm (Wise rep) -> SimpleM rep (Stm (Wise rep)))
-> Stm (Wise rep) -> SimpleM rep (Stm (Wise rep))
forall a b. (a -> b) -> a -> b
$ Pat (LetDec rep)
-> StmAux (ExpDec rep) -> Exp (Wise rep) -> Stm (Wise rep)
forall rep.
Informing rep =>
Pat (LetDec rep)
-> StmAux (ExpDec rep) -> Exp (Wise rep) -> Stm (Wise rep)
mkWiseStm Pat (LetDec rep)
pat' StmAux (ExpDec rep)
aux' Exp (Wise rep)
e'

-- Bottom-up simplify a statement.  Recurses into sub-Bodies and Ops.
-- Does not copy-propagate into the pattern and similar, as it is
-- assumed 'nonrecSimplifyStm' has already touched it (and worst case,
-- it'll get it on the next round of the overall fixpoint iteration.)
recSimplifyStm ::
  SimplifiableRep rep =>
  Stm (Wise rep) ->
  UT.UsageTable ->
  SimpleM rep (Stms (Wise rep), Stm (Wise rep))
recSimplifyStm :: forall rep.
SimplifiableRep rep =>
Stm (Wise rep)
-> UsageTable -> SimpleM rep (Stms (Wise rep), Stm (Wise rep))
recSimplifyStm (Let Pat (LetDec (Wise rep))
pat (StmAux Certs
cs Attrs
attrs (ExpWisdom
_, ExpDec rep
dec)) Exp (Wise rep)
e) UsageTable
usage = do
  ((Exp (Wise rep)
e', Stms (Wise rep)
e_hoisted), Certs
e_cs) <- SimpleM rep (Exp (Wise rep), Stms (Wise rep))
-> SimpleM rep ((Exp (Wise rep), Stms (Wise rep)), Certs)
forall rep a. SimpleM rep a -> SimpleM rep (a, Certs)
collectCerts (SimpleM rep (Exp (Wise rep), Stms (Wise rep))
 -> SimpleM rep ((Exp (Wise rep), Stms (Wise rep)), Certs))
-> SimpleM rep (Exp (Wise rep), Stms (Wise rep))
-> SimpleM rep ((Exp (Wise rep), Stms (Wise rep)), Certs)
forall a b. (a -> b) -> a -> b
$ UsageTable
-> Pat (LetDec (Wise rep))
-> Exp (Wise rep)
-> SimpleM rep (Exp (Wise rep), Stms (Wise rep))
forall rep.
SimplifiableRep rep =>
UsageTable
-> Pat (LetDec (Wise rep))
-> Exp (Wise rep)
-> SimpleM rep (Exp (Wise rep), Stms (Wise rep))
simplifyExp (UsageTable
usage UsageTable -> UsageTable -> UsageTable
forall a. Semigroup a => a -> a -> a
<> Pat (VarWisdom, LetDec rep) -> UsageTable
forall t. FreeIn t => Pat t -> UsageTable
UT.usageInPat Pat (VarWisdom, LetDec rep)
Pat (LetDec (Wise rep))
pat) Pat (LetDec (Wise rep))
pat Exp (Wise rep)
e
  let aux' :: StmAux (ExpDec rep)
aux' = Certs -> Attrs -> ExpDec rep -> StmAux (ExpDec rep)
forall dec. Certs -> Attrs -> dec -> StmAux dec
StmAux (Certs
cs Certs -> Certs -> Certs
forall a. Semigroup a => a -> a -> a
<> Certs
e_cs) Attrs
attrs ExpDec rep
dec
  (Stms (Wise rep), Stm (Wise rep))
-> SimpleM rep (Stms (Wise rep), Stm (Wise rep))
forall a. a -> SimpleM rep a
forall (f :: * -> *) a. Applicative f => a -> f a
pure (Stms (Wise rep)
e_hoisted, Pat (LetDec rep)
-> StmAux (ExpDec rep) -> Exp (Wise rep) -> Stm (Wise rep)
forall rep.
Informing rep =>
Pat (LetDec rep)
-> StmAux (ExpDec rep) -> Exp (Wise rep) -> Stm (Wise rep)
mkWiseStm (Pat (VarWisdom, LetDec rep) -> Pat (LetDec rep)
forall a. Pat (VarWisdom, a) -> Pat a
removePatWisdom Pat (VarWisdom, LetDec rep)
Pat (LetDec (Wise rep))
pat) StmAux (ExpDec rep)
aux' Exp (Wise rep)
e')

hoistStms ::
  SimplifiableRep rep =>
  RuleBook (Wise rep) ->
  BlockPred (Wise rep) ->
  Stms (Wise rep) ->
  SimpleM rep (a, UT.UsageTable) ->
  SimpleM rep (a, Stms (Wise rep), Stms (Wise rep))
hoistStms :: forall rep a.
SimplifiableRep rep =>
RuleBook (Wise rep)
-> BlockPred (Wise rep)
-> Stms (Wise rep)
-> SimpleM rep (a, UsageTable)
-> SimpleM rep (a, Stms (Wise rep), Stms (Wise rep))
hoistStms RuleBook (Wise rep)
rules BlockPred (Wise rep)
block Stms (Wise rep)
orig_stms SimpleM rep (a, UsageTable)
final = do
  (a
a, [Stm (Wise rep)]
blocked, [Stm (Wise rep)]
hoisted) <- Stms (Wise rep)
-> SimpleM rep (a, [Stm (Wise rep)], [Stm (Wise rep)])
simplifyStmsBottomUp Stms (Wise rep)
orig_stms
  Bool -> SimpleM rep () -> SimpleM rep ()
forall (f :: * -> *). Applicative f => Bool -> f () -> f ()
unless ([Stm (Wise rep)] -> Bool
forall a. [a] -> Bool
forall (t :: * -> *) a. Foldable t => t a -> Bool
null [Stm (Wise rep)]
hoisted) SimpleM rep ()
forall rep. SimpleM rep ()
changed
  (a, Stms (Wise rep), Stms (Wise rep))
-> SimpleM rep (a, Stms (Wise rep), Stms (Wise rep))
forall a. a -> SimpleM rep a
forall (f :: * -> *) a. Applicative f => a -> f a
pure (a
a, [Stm (Wise rep)] -> Stms (Wise rep)
forall rep. [Stm rep] -> Stms rep
stmsFromList [Stm (Wise rep)]
blocked, [Stm (Wise rep)] -> Stms (Wise rep)
forall rep. [Stm rep] -> Stms rep
stmsFromList [Stm (Wise rep)]
hoisted)
  where
    simplifyStmsBottomUp :: Stms (Wise rep)
-> SimpleM rep (a, [Stm (Wise rep)], [Stm (Wise rep)])
simplifyStmsBottomUp Stms (Wise rep)
stms = do
      OpC rep (Wise rep) -> UsageTable
opUsage <- ((SimpleOps rep, Env rep) -> OpC rep (Wise rep) -> UsageTable)
-> SimpleM rep (OpC rep (Wise rep) -> UsageTable)
forall r (m :: * -> *) a. MonadReader r m => (r -> a) -> m a
asks (((SimpleOps rep, Env rep) -> OpC rep (Wise rep) -> UsageTable)
 -> SimpleM rep (OpC rep (Wise rep) -> UsageTable))
-> ((SimpleOps rep, Env rep) -> OpC rep (Wise rep) -> UsageTable)
-> SimpleM rep (OpC rep (Wise rep) -> UsageTable)
forall a b. (a -> b) -> a -> b
$ SimpleOps rep -> OpC rep (Wise rep) -> UsageTable
SimpleOps rep -> Op (Wise rep) -> UsageTable
forall rep. SimpleOps rep -> Op (Wise rep) -> UsageTable
opUsageS (SimpleOps rep -> OpC rep (Wise rep) -> UsageTable)
-> ((SimpleOps rep, Env rep) -> SimpleOps rep)
-> (SimpleOps rep, Env rep)
-> OpC rep (Wise rep)
-> UsageTable
forall b c a. (b -> c) -> (a -> b) -> a -> c
. (SimpleOps rep, Env rep) -> SimpleOps rep
forall a b. (a, b) -> a
fst
      let usageInStm :: Stm (Wise rep) -> UsageTable
usageInStm Stm (Wise rep)
stm =
            Stm (Wise rep) -> UsageTable
forall rep. Aliased rep => Stm rep -> UsageTable
UT.usageInStm Stm (Wise rep)
stm
              UsageTable -> UsageTable -> UsageTable
forall a. Semigroup a => a -> a -> a
<> case Stm (Wise rep) -> Exp (Wise rep)
forall rep. Stm rep -> Exp rep
stmExp Stm (Wise rep)
stm of
                Op Op (Wise rep)
op -> OpC rep (Wise rep) -> UsageTable
opUsage OpC rep (Wise rep)
Op (Wise rep)
op
                Exp (Wise rep)
_ -> UsageTable
forall a. Monoid a => a
mempty
      (a
x, UsageTable
_, [Either (Stm (Wise rep)) (Stm (Wise rep))]
stms') <- (Stm (Wise rep) -> UsageTable)
-> Stms (Wise rep)
-> SimpleM
     rep (a, UsageTable, [Either (Stm (Wise rep)) (Stm (Wise rep))])
hoistableStms Stm (Wise rep) -> UsageTable
usageInStm Stms (Wise rep)
stms
      -- We need to do a final pass to ensure that nothing is
      -- hoisted past something that it depends on.
      let ([Stm (Wise rep)]
blocked, [Stm (Wise rep)]
hoisted) = [Either (Stm (Wise rep)) (Stm (Wise rep))]
-> ([Stm (Wise rep)], [Stm (Wise rep)])
forall a b. [Either a b] -> ([a], [b])
partitionEithers ([Either (Stm (Wise rep)) (Stm (Wise rep))]
 -> ([Stm (Wise rep)], [Stm (Wise rep)]))
-> [Either (Stm (Wise rep)) (Stm (Wise rep))]
-> ([Stm (Wise rep)], [Stm (Wise rep)])
forall a b. (a -> b) -> a -> b
$ [Either (Stm (Wise rep)) (Stm (Wise rep))]
-> [Either (Stm (Wise rep)) (Stm (Wise rep))]
forall rep.
ASTRep rep =>
[Either (Stm rep) (Stm rep)] -> [Either (Stm rep) (Stm rep)]
blockUnhoistedDeps [Either (Stm (Wise rep)) (Stm (Wise rep))]
stms'
      (a, [Stm (Wise rep)], [Stm (Wise rep)])
-> SimpleM rep (a, [Stm (Wise rep)], [Stm (Wise rep)])
forall a. a -> SimpleM rep a
forall (f :: * -> *) a. Applicative f => a -> f a
pure (a
x, [Stm (Wise rep)]
blocked, [Stm (Wise rep)]
hoisted)

    descend :: (Stm (Wise rep) -> UsageTable)
-> Stms (Wise rep)
-> SimpleM
     rep (a, UsageTable, [Either (Stm (Wise rep)) (Stm (Wise rep))])
-> SimpleM
     rep (a, UsageTable, [Either (Stm (Wise rep)) (Stm (Wise rep))])
descend Stm (Wise rep) -> UsageTable
usageInStm Stms (Wise rep)
stms SimpleM
  rep (a, UsageTable, [Either (Stm (Wise rep)) (Stm (Wise rep))])
m =
      case Stms (Wise rep) -> Maybe (Stm (Wise rep), Stms (Wise rep))
forall rep. Stms rep -> Maybe (Stm rep, Stms rep)
stmsHead Stms (Wise rep)
stms of
        Maybe (Stm (Wise rep), Stms (Wise rep))
Nothing -> SimpleM
  rep (a, UsageTable, [Either (Stm (Wise rep)) (Stm (Wise rep))])
m
        Just (Stm (Wise rep)
stms_h, Stms (Wise rep)
stms_t) -> (SymbolTable (Wise rep) -> SymbolTable (Wise rep))
-> SimpleM
     rep (a, UsageTable, [Either (Stm (Wise rep)) (Stm (Wise rep))])
-> SimpleM
     rep (a, UsageTable, [Either (Stm (Wise rep)) (Stm (Wise rep))])
forall rep a.
(SymbolTable (Wise rep) -> SymbolTable (Wise rep))
-> SimpleM rep a -> SimpleM rep a
localVtable (Stm (Wise rep) -> SymbolTable (Wise rep) -> SymbolTable (Wise rep)
forall rep.
(IndexOp (Op rep), Aliased rep) =>
Stm rep -> SymbolTable rep -> SymbolTable rep
ST.insertStm Stm (Wise rep)
stms_h) (SimpleM
   rep (a, UsageTable, [Either (Stm (Wise rep)) (Stm (Wise rep))])
 -> SimpleM
      rep (a, UsageTable, [Either (Stm (Wise rep)) (Stm (Wise rep))]))
-> SimpleM
     rep (a, UsageTable, [Either (Stm (Wise rep)) (Stm (Wise rep))])
-> SimpleM
     rep (a, UsageTable, [Either (Stm (Wise rep)) (Stm (Wise rep))])
forall a b. (a -> b) -> a -> b
$ do
          (a
x, UsageTable
usage, [Either (Stm (Wise rep)) (Stm (Wise rep))]
stms_t') <- (Stm (Wise rep) -> UsageTable)
-> Stms (Wise rep)
-> SimpleM
     rep (a, UsageTable, [Either (Stm (Wise rep)) (Stm (Wise rep))])
-> SimpleM
     rep (a, UsageTable, [Either (Stm (Wise rep)) (Stm (Wise rep))])
descend Stm (Wise rep) -> UsageTable
usageInStm Stms (Wise rep)
stms_t SimpleM
  rep (a, UsageTable, [Either (Stm (Wise rep)) (Stm (Wise rep))])
m
          (Stm (Wise rep) -> UsageTable)
-> Stm (Wise rep)
-> [Either (Stm (Wise rep)) (Stm (Wise rep))]
-> UsageTable
-> a
-> SimpleM
     rep (a, UsageTable, [Either (Stm (Wise rep)) (Stm (Wise rep))])
process Stm (Wise rep) -> UsageTable
usageInStm Stm (Wise rep)
stms_h [Either (Stm (Wise rep)) (Stm (Wise rep))]
stms_t' UsageTable
usage a
x

    process :: (Stm (Wise rep) -> UsageTable)
-> Stm (Wise rep)
-> [Either (Stm (Wise rep)) (Stm (Wise rep))]
-> UsageTable
-> a
-> SimpleM
     rep (a, UsageTable, [Either (Stm (Wise rep)) (Stm (Wise rep))])
process Stm (Wise rep) -> UsageTable
usageInStm Stm (Wise rep)
stm [Either (Stm (Wise rep)) (Stm (Wise rep))]
stms UsageTable
usage a
x = do
      SymbolTable (Wise rep)
vtable <- SimpleM rep (SymbolTable (Wise rep))
forall rep. SimpleM rep (SymbolTable (Wise rep))
askVtable
      Maybe (Stms (Wise rep))
res <- RuleBook (Wise rep)
-> (SymbolTable (Wise rep), UsageTable)
-> Stm (Wise rep)
-> SimpleM rep (Maybe (Stms (Wise rep)))
forall (m :: * -> *) rep.
(MonadFreshNames m, HasScope rep m, PrettyRep rep) =>
RuleBook rep
-> (SymbolTable rep, UsageTable) -> Stm rep -> m (Maybe (Stms rep))
bottomUpSimplifyStm RuleBook (Wise rep)
rules (SymbolTable (Wise rep)
vtable, UsageTable
usage) Stm (Wise rep)
stm
      case Maybe (Stms (Wise rep))
res of
        Maybe (Stms (Wise rep))
Nothing -- Nothing to optimise - see if hoistable.
          | BlockPred (Wise rep)
block SymbolTable (Wise rep)
vtable UsageTable
usage Stm (Wise rep)
stm ->
              -- No, not hoistable.
              (a, UsageTable, [Either (Stm (Wise rep)) (Stm (Wise rep))])
-> SimpleM
     rep (a, UsageTable, [Either (Stm (Wise rep)) (Stm (Wise rep))])
forall a. a -> SimpleM rep a
forall (f :: * -> *) a. Applicative f => a -> f a
pure
                ( a
x,
                  (Stm (Wise rep) -> UsageTable)
-> SymbolTable (Wise rep)
-> UsageTable
-> Stm (Wise rep)
-> UsageTable
forall rep.
Aliased rep =>
(Stm rep -> UsageTable)
-> SymbolTable rep -> UsageTable -> Stm rep -> UsageTable
expandUsage Stm (Wise rep) -> UsageTable
usageInStm SymbolTable (Wise rep)
vtable UsageTable
usage Stm (Wise rep)
stm
                    UsageTable -> [VName] -> UsageTable
`UT.without` Stm (Wise rep) -> [VName]
forall rep. Stm rep -> [VName]
provides Stm (Wise rep)
stm,
                  Stm (Wise rep) -> Either (Stm (Wise rep)) (Stm (Wise rep))
forall a b. a -> Either a b
Left Stm (Wise rep)
stm Either (Stm (Wise rep)) (Stm (Wise rep))
-> [Either (Stm (Wise rep)) (Stm (Wise rep))]
-> [Either (Stm (Wise rep)) (Stm (Wise rep))]
forall a. a -> [a] -> [a]
: [Either (Stm (Wise rep)) (Stm (Wise rep))]
stms
                )
          | Bool
otherwise ->
              -- Yes, hoistable.
              (a, UsageTable, [Either (Stm (Wise rep)) (Stm (Wise rep))])
-> SimpleM
     rep (a, UsageTable, [Either (Stm (Wise rep)) (Stm (Wise rep))])
forall a. a -> SimpleM rep a
forall (f :: * -> *) a. Applicative f => a -> f a
pure
                ( a
x,
                  (Stm (Wise rep) -> UsageTable)
-> SymbolTable (Wise rep)
-> UsageTable
-> Stm (Wise rep)
-> UsageTable
forall rep.
Aliased rep =>
(Stm rep -> UsageTable)
-> SymbolTable rep -> UsageTable -> Stm rep -> UsageTable
expandUsage Stm (Wise rep) -> UsageTable
usageInStm SymbolTable (Wise rep)
vtable UsageTable
usage Stm (Wise rep)
stm,
                  Stm (Wise rep) -> Either (Stm (Wise rep)) (Stm (Wise rep))
forall a b. b -> Either a b
Right Stm (Wise rep)
stm Either (Stm (Wise rep)) (Stm (Wise rep))
-> [Either (Stm (Wise rep)) (Stm (Wise rep))]
-> [Either (Stm (Wise rep)) (Stm (Wise rep))]
forall a. a -> [a] -> [a]
: [Either (Stm (Wise rep)) (Stm (Wise rep))]
stms
                )
        Just Stms (Wise rep)
optimstms -> do
          SimpleM rep ()
forall rep. SimpleM rep ()
changed
          (Stm (Wise rep) -> UsageTable)
-> Stms (Wise rep)
-> SimpleM
     rep (a, UsageTable, [Either (Stm (Wise rep)) (Stm (Wise rep))])
-> SimpleM
     rep (a, UsageTable, [Either (Stm (Wise rep)) (Stm (Wise rep))])
descend Stm (Wise rep) -> UsageTable
usageInStm Stms (Wise rep)
optimstms (SimpleM
   rep (a, UsageTable, [Either (Stm (Wise rep)) (Stm (Wise rep))])
 -> SimpleM
      rep (a, UsageTable, [Either (Stm (Wise rep)) (Stm (Wise rep))]))
-> SimpleM
     rep (a, UsageTable, [Either (Stm (Wise rep)) (Stm (Wise rep))])
-> SimpleM
     rep (a, UsageTable, [Either (Stm (Wise rep)) (Stm (Wise rep))])
forall a b. (a -> b) -> a -> b
$ (a, UsageTable, [Either (Stm (Wise rep)) (Stm (Wise rep))])
-> SimpleM
     rep (a, UsageTable, [Either (Stm (Wise rep)) (Stm (Wise rep))])
forall a. a -> SimpleM rep a
forall (f :: * -> *) a. Applicative f => a -> f a
pure (a
x, UsageTable
usage, [Either (Stm (Wise rep)) (Stm (Wise rep))]
stms)

    hoistableStms :: (Stm (Wise rep) -> UsageTable)
-> Stms (Wise rep)
-> SimpleM
     rep (a, UsageTable, [Either (Stm (Wise rep)) (Stm (Wise rep))])
hoistableStms Stm (Wise rep) -> UsageTable
usageInStm Stms (Wise rep)
stms =
      case Stms (Wise rep) -> Maybe (Stm (Wise rep), Stms (Wise rep))
forall rep. Stms rep -> Maybe (Stm rep, Stms rep)
stmsHead Stms (Wise rep)
stms of
        Maybe (Stm (Wise rep), Stms (Wise rep))
Nothing -> do
          (a
x, UsageTable
usage) <- SimpleM rep (a, UsageTable)
final
          (a, UsageTable, [Either (Stm (Wise rep)) (Stm (Wise rep))])
-> SimpleM
     rep (a, UsageTable, [Either (Stm (Wise rep)) (Stm (Wise rep))])
forall a. a -> SimpleM rep a
forall (f :: * -> *) a. Applicative f => a -> f a
pure (a
x, UsageTable
usage, [Either (Stm (Wise rep)) (Stm (Wise rep))]
forall a. Monoid a => a
mempty)
        Just (Stm (Wise rep)
stms_h, Stms (Wise rep)
stms_t) -> do
          Stm (Wise rep)
stms_h' <- Stm (Wise rep) -> SimpleM rep (Stm (Wise rep))
forall rep.
SimplifiableRep rep =>
Stm (Wise rep) -> SimpleM rep (Stm (Wise rep))
nonrecSimplifyStm Stm (Wise rep)
stms_h

          SymbolTable (Wise rep)
vtable <- SimpleM rep (SymbolTable (Wise rep))
forall rep. SimpleM rep (SymbolTable (Wise rep))
askVtable
          Maybe (Stms (Wise rep))
simplified <- RuleBook (Wise rep)
-> SymbolTable (Wise rep)
-> Stm (Wise rep)
-> SimpleM rep (Maybe (Stms (Wise rep)))
forall (m :: * -> *) rep.
(MonadFreshNames m, HasScope rep m, PrettyRep rep) =>
RuleBook rep -> SymbolTable rep -> Stm rep -> m (Maybe (Stms rep))
topDownSimplifyStm RuleBook (Wise rep)
rules SymbolTable (Wise rep)
vtable Stm (Wise rep)
stms_h'

          case Maybe (Stms (Wise rep))
simplified of
            Just Stms (Wise rep)
newstms -> do
              SimpleM rep ()
forall rep. SimpleM rep ()
changed
              (Stm (Wise rep) -> UsageTable)
-> Stms (Wise rep)
-> SimpleM
     rep (a, UsageTable, [Either (Stm (Wise rep)) (Stm (Wise rep))])
hoistableStms Stm (Wise rep) -> UsageTable
usageInStm (Stms (Wise rep)
newstms Stms (Wise rep) -> Stms (Wise rep) -> Stms (Wise rep)
forall a. Semigroup a => a -> a -> a
<> Stms (Wise rep)
stms_t)
            Maybe (Stms (Wise rep))
Nothing -> do
              (a
x, UsageTable
usage, [Either (Stm (Wise rep)) (Stm (Wise rep))]
stms_t') <-
                (SymbolTable (Wise rep) -> SymbolTable (Wise rep))
-> SimpleM
     rep (a, UsageTable, [Either (Stm (Wise rep)) (Stm (Wise rep))])
-> SimpleM
     rep (a, UsageTable, [Either (Stm (Wise rep)) (Stm (Wise rep))])
forall rep a.
(SymbolTable (Wise rep) -> SymbolTable (Wise rep))
-> SimpleM rep a -> SimpleM rep a
localVtable (Stm (Wise rep) -> SymbolTable (Wise rep) -> SymbolTable (Wise rep)
forall rep.
(IndexOp (Op rep), Aliased rep) =>
Stm rep -> SymbolTable rep -> SymbolTable rep
ST.insertStm Stm (Wise rep)
stms_h') (SimpleM
   rep (a, UsageTable, [Either (Stm (Wise rep)) (Stm (Wise rep))])
 -> SimpleM
      rep (a, UsageTable, [Either (Stm (Wise rep)) (Stm (Wise rep))]))
-> SimpleM
     rep (a, UsageTable, [Either (Stm (Wise rep)) (Stm (Wise rep))])
-> SimpleM
     rep (a, UsageTable, [Either (Stm (Wise rep)) (Stm (Wise rep))])
forall a b. (a -> b) -> a -> b
$
                  (Stm (Wise rep) -> UsageTable)
-> Stms (Wise rep)
-> SimpleM
     rep (a, UsageTable, [Either (Stm (Wise rep)) (Stm (Wise rep))])
hoistableStms Stm (Wise rep) -> UsageTable
usageInStm Stms (Wise rep)
stms_t
              if Bool -> Bool
not (Bool -> Bool) -> Bool -> Bool
forall a b. (a -> b) -> a -> b
$ (VName -> Bool) -> [VName] -> Bool
forall (t :: * -> *) a. Foldable t => (a -> Bool) -> t a -> Bool
any (VName -> UsageTable -> Bool
`UT.isUsedDirectly` UsageTable
usage) ([VName] -> Bool) -> [VName] -> Bool
forall a b. (a -> b) -> a -> b
$ Stm (Wise rep) -> [VName]
forall rep. Stm rep -> [VName]
provides Stm (Wise rep)
stms_h'
                then -- Dead statement.
                  (a, UsageTable, [Either (Stm (Wise rep)) (Stm (Wise rep))])
-> SimpleM
     rep (a, UsageTable, [Either (Stm (Wise rep)) (Stm (Wise rep))])
forall a. a -> SimpleM rep a
forall (f :: * -> *) a. Applicative f => a -> f a
pure (a
x, UsageTable
usage, [Either (Stm (Wise rep)) (Stm (Wise rep))]
stms_t')
                else do
                  (Stms (Wise rep)
stms_h_stms, Stm (Wise rep)
stms_h'') <- Stm (Wise rep)
-> UsageTable -> SimpleM rep (Stms (Wise rep), Stm (Wise rep))
forall rep.
SimplifiableRep rep =>
Stm (Wise rep)
-> UsageTable -> SimpleM rep (Stms (Wise rep), Stm (Wise rep))
recSimplifyStm Stm (Wise rep)
stms_h' UsageTable
usage
                  (Stm (Wise rep) -> UsageTable)
-> Stms (Wise rep)
-> SimpleM
     rep (a, UsageTable, [Either (Stm (Wise rep)) (Stm (Wise rep))])
-> SimpleM
     rep (a, UsageTable, [Either (Stm (Wise rep)) (Stm (Wise rep))])
descend Stm (Wise rep) -> UsageTable
usageInStm Stms (Wise rep)
stms_h_stms (SimpleM
   rep (a, UsageTable, [Either (Stm (Wise rep)) (Stm (Wise rep))])
 -> SimpleM
      rep (a, UsageTable, [Either (Stm (Wise rep)) (Stm (Wise rep))]))
-> SimpleM
     rep (a, UsageTable, [Either (Stm (Wise rep)) (Stm (Wise rep))])
-> SimpleM
     rep (a, UsageTable, [Either (Stm (Wise rep)) (Stm (Wise rep))])
forall a b. (a -> b) -> a -> b
$
                    (Stm (Wise rep) -> UsageTable)
-> Stm (Wise rep)
-> [Either (Stm (Wise rep)) (Stm (Wise rep))]
-> UsageTable
-> a
-> SimpleM
     rep (a, UsageTable, [Either (Stm (Wise rep)) (Stm (Wise rep))])
process Stm (Wise rep) -> UsageTable
usageInStm Stm (Wise rep)
stms_h'' [Either (Stm (Wise rep)) (Stm (Wise rep))]
stms_t' UsageTable
usage a
x

blockUnhoistedDeps ::
  ASTRep rep =>
  [Either (Stm rep) (Stm rep)] ->
  [Either (Stm rep) (Stm rep)]
blockUnhoistedDeps :: forall rep.
ASTRep rep =>
[Either (Stm rep) (Stm rep)] -> [Either (Stm rep) (Stm rep)]
blockUnhoistedDeps = (Names, [Either (Stm rep) (Stm rep)])
-> [Either (Stm rep) (Stm rep)]
forall a b. (a, b) -> b
snd ((Names, [Either (Stm rep) (Stm rep)])
 -> [Either (Stm rep) (Stm rep)])
-> ([Either (Stm rep) (Stm rep)]
    -> (Names, [Either (Stm rep) (Stm rep)]))
-> [Either (Stm rep) (Stm rep)]
-> [Either (Stm rep) (Stm rep)]
forall b c a. (b -> c) -> (a -> b) -> a -> c
. (Names
 -> Either (Stm rep) (Stm rep)
 -> (Names, Either (Stm rep) (Stm rep)))
-> Names
-> [Either (Stm rep) (Stm rep)]
-> (Names, [Either (Stm rep) (Stm rep)])
forall (t :: * -> *) s a b.
Traversable t =>
(s -> a -> (s, b)) -> s -> t a -> (s, t b)
mapAccumL Names
-> Either (Stm rep) (Stm rep)
-> (Names, Either (Stm rep) (Stm rep))
forall {rep}.
(FreeDec (ExpDec rep), FreeDec (BodyDec rep), FreeIn (OpC rep rep),
 FreeIn (FParamInfo rep), FreeIn (LParamInfo rep),
 FreeIn (LetDec rep), FreeIn (RetType rep),
 FreeIn (BranchType rep)) =>
Names
-> Either (Stm rep) (Stm rep)
-> (Names, Either (Stm rep) (Stm rep))
block Names
forall a. Monoid a => a
mempty
  where
    block :: Names
-> Either (Stm rep) (Stm rep)
-> (Names, Either (Stm rep) (Stm rep))
block Names
blocked (Left Stm rep
need) =
      (Names
blocked Names -> Names -> Names
forall a. Semigroup a => a -> a -> a
<> [VName] -> Names
namesFromList (Stm rep -> [VName]
forall rep. Stm rep -> [VName]
provides Stm rep
need), Stm rep -> Either (Stm rep) (Stm rep)
forall a b. a -> Either a b
Left Stm rep
need)
    block Names
blocked (Right Stm rep
need)
      | Names
blocked Names -> Names -> Bool
`namesIntersect` Stm rep -> Names
forall a. FreeIn a => a -> Names
freeIn Stm rep
need =
          (Names
blocked Names -> Names -> Names
forall a. Semigroup a => a -> a -> a
<> [VName] -> Names
namesFromList (Stm rep -> [VName]
forall rep. Stm rep -> [VName]
provides Stm rep
need), Stm rep -> Either (Stm rep) (Stm rep)
forall a b. a -> Either a b
Left Stm rep
need)
      | Bool
otherwise =
          (Names
blocked, Stm rep -> Either (Stm rep) (Stm rep)
forall a b. b -> Either a b
Right Stm rep
need)

provides :: Stm rep -> [VName]
provides :: forall rep. Stm rep -> [VName]
provides = Pat (LetDec rep) -> [VName]
forall dec. Pat dec -> [VName]
patNames (Pat (LetDec rep) -> [VName])
-> (Stm rep -> Pat (LetDec rep)) -> Stm rep -> [VName]
forall b c a. (b -> c) -> (a -> b) -> a -> c
. Stm rep -> Pat (LetDec rep)
forall rep. Stm rep -> Pat (LetDec rep)
stmPat

expandUsage ::
  Aliased rep =>
  (Stm rep -> UT.UsageTable) ->
  ST.SymbolTable rep ->
  UT.UsageTable ->
  Stm rep ->
  UT.UsageTable
expandUsage :: forall rep.
Aliased rep =>
(Stm rep -> UsageTable)
-> SymbolTable rep -> UsageTable -> Stm rep -> UsageTable
expandUsage Stm rep -> UsageTable
usageInStm SymbolTable rep
vtable UsageTable
utable stm :: Stm rep
stm@(Let Pat (LetDec rep)
pat StmAux (ExpDec rep)
aux Exp rep
e) =
  UsageTable
stmUsages UsageTable -> UsageTable -> UsageTable
forall a. Semigroup a => a -> a -> a
<> UsageTable
utable
  where
    stmUsages :: UsageTable
stmUsages =
      (VName -> Names) -> UsageTable -> UsageTable
UT.expand (VName -> SymbolTable rep -> Names
forall rep. VName -> SymbolTable rep -> Names
`ST.lookupAliases` SymbolTable rep
vtable) (Stm rep -> UsageTable
usageInStm Stm rep
stm UsageTable -> UsageTable -> UsageTable
forall a. Semigroup a => a -> a -> a
<> UsageTable
usageThroughAliases)
        UsageTable -> UsageTable -> UsageTable
forall a. Semigroup a => a -> a -> a
<> ( if (VName -> Bool) -> [VName] -> Bool
forall (t :: * -> *) a. Foldable t => (a -> Bool) -> t a -> Bool
any (VName -> UsageTable -> Bool
`UT.isSize` UsageTable
utable) (Pat (LetDec rep) -> [VName]
forall dec. Pat dec -> [VName]
patNames Pat (LetDec rep)
pat)
               then Names -> UsageTable
UT.sizeUsages (Certs -> Names
forall a. FreeIn a => a -> Names
freeIn (StmAux (ExpDec rep) -> Certs
forall dec. StmAux dec -> Certs
stmAuxCerts StmAux (ExpDec rep)
aux) Names -> Names -> Names
forall a. Semigroup a => a -> a -> a
<> Exp rep -> Names
forall a. FreeIn a => a -> Names
freeIn Exp rep
e)
               else UsageTable
forall a. Monoid a => a
mempty
           )
    usageThroughAliases :: UsageTable
usageThroughAliases =
      [UsageTable] -> UsageTable
forall a. Monoid a => [a] -> a
mconcat ([UsageTable] -> UsageTable)
-> ([(VName, Names)] -> [UsageTable])
-> [(VName, Names)]
-> UsageTable
forall b c a. (b -> c) -> (a -> b) -> a -> c
. ((VName, Names) -> Maybe UsageTable)
-> [(VName, Names)] -> [UsageTable]
forall a b. (a -> Maybe b) -> [a] -> [b]
mapMaybe (VName, Names) -> Maybe UsageTable
usageThroughBindeeAliases ([(VName, Names)] -> UsageTable) -> [(VName, Names)] -> UsageTable
forall a b. (a -> b) -> a -> b
$
        [VName] -> [Names] -> [(VName, Names)]
forall a b. [a] -> [b] -> [(a, b)]
zip (Pat (LetDec rep) -> [VName]
forall dec. Pat dec -> [VName]
patNames Pat (LetDec rep)
pat) (Pat (LetDec rep) -> [Names]
forall dec. AliasesOf dec => Pat dec -> [Names]
patAliases Pat (LetDec rep)
pat)
    usageThroughBindeeAliases :: (VName, Names) -> Maybe UsageTable
usageThroughBindeeAliases (VName
name, Names
aliases) = do
      Usages
uses <- VName -> UsageTable -> Maybe Usages
UT.lookup VName
name UsageTable
utable
      UsageTable -> Maybe UsageTable
forall a. a -> Maybe a
forall (f :: * -> *) a. Applicative f => a -> f a
pure (UsageTable -> Maybe UsageTable)
-> ([UsageTable] -> UsageTable) -> [UsageTable] -> Maybe UsageTable
forall b c a. (b -> c) -> (a -> b) -> a -> c
. [UsageTable] -> UsageTable
forall a. Monoid a => [a] -> a
mconcat ([UsageTable] -> Maybe UsageTable)
-> [UsageTable] -> Maybe UsageTable
forall a b. (a -> b) -> a -> b
$
        (VName -> UsageTable) -> [VName] -> [UsageTable]
forall a b. (a -> b) -> [a] -> [b]
map (VName -> Usages -> UsageTable
`UT.usage` (Usages
uses Usages -> Usages -> Usages
`UT.withoutU` Usages
UT.presentU)) ([VName] -> [UsageTable]) -> [VName] -> [UsageTable]
forall a b. (a -> b) -> a -> b
$
          Names -> [VName]
namesToList Names
aliases

type BlockPred rep = ST.SymbolTable rep -> UT.UsageTable -> Stm rep -> Bool

neverBlocks :: BlockPred rep
neverBlocks :: forall rep. BlockPred rep
neverBlocks SymbolTable rep
_ UsageTable
_ Stm rep
_ = Bool
False

alwaysBlocks :: BlockPred rep
alwaysBlocks :: forall rep. BlockPred rep
alwaysBlocks SymbolTable rep
_ UsageTable
_ Stm rep
_ = Bool
True

isFalse :: Bool -> BlockPred rep
isFalse :: forall rep. Bool -> BlockPred rep
isFalse Bool
b SymbolTable rep
_ UsageTable
_ Stm rep
_ = Bool -> Bool
not Bool
b

orIf :: BlockPred rep -> BlockPred rep -> BlockPred rep
orIf :: forall rep. BlockPred rep -> BlockPred rep -> BlockPred rep
orIf BlockPred rep
p1 BlockPred rep
p2 SymbolTable rep
body UsageTable
vtable Stm rep
need = BlockPred rep
p1 SymbolTable rep
body UsageTable
vtable Stm rep
need Bool -> Bool -> Bool
|| BlockPred rep
p2 SymbolTable rep
body UsageTable
vtable Stm rep
need

andAlso :: BlockPred rep -> BlockPred rep -> BlockPred rep
andAlso :: forall rep. BlockPred rep -> BlockPred rep -> BlockPred rep
andAlso BlockPred rep
p1 BlockPred rep
p2 SymbolTable rep
body UsageTable
vtable Stm rep
need = BlockPred rep
p1 SymbolTable rep
body UsageTable
vtable Stm rep
need Bool -> Bool -> Bool
&& BlockPred rep
p2 SymbolTable rep
body UsageTable
vtable Stm rep
need

isConsumed :: BlockPred rep
isConsumed :: forall rep. BlockPred rep
isConsumed SymbolTable rep
_ UsageTable
utable = (VName -> Bool) -> [VName] -> Bool
forall (t :: * -> *) a. Foldable t => (a -> Bool) -> t a -> Bool
any (VName -> UsageTable -> Bool
`UT.isConsumed` UsageTable
utable) ([VName] -> Bool) -> (Stm rep -> [VName]) -> Stm rep -> Bool
forall b c a. (b -> c) -> (a -> b) -> a -> c
. Pat (LetDec rep) -> [VName]
forall dec. Pat dec -> [VName]
patNames (Pat (LetDec rep) -> [VName])
-> (Stm rep -> Pat (LetDec rep)) -> Stm rep -> [VName]
forall b c a. (b -> c) -> (a -> b) -> a -> c
. Stm rep -> Pat (LetDec rep)
forall rep. Stm rep -> Pat (LetDec rep)
stmPat

isOp :: BlockPred rep
isOp :: forall rep. BlockPred rep
isOp SymbolTable rep
_ UsageTable
_ (Let Pat (LetDec rep)
_ StmAux (ExpDec rep)
_ Op {}) = Bool
True
isOp SymbolTable rep
_ UsageTable
_ Stm rep
_ = Bool
False

constructBody ::
  SimplifiableRep rep =>
  Stms (Wise rep) ->
  Result ->
  SimpleM rep (Body (Wise rep))
constructBody :: forall rep.
SimplifiableRep rep =>
Stms (Wise rep) -> Result -> SimpleM rep (Body (Wise rep))
constructBody Stms (Wise rep)
stms Result
res =
  ((Body (Wise rep), Stms (Wise rep)) -> Body (Wise rep))
-> SimpleM rep (Body (Wise rep), Stms (Wise rep))
-> SimpleM rep (Body (Wise rep))
forall a b. (a -> b) -> SimpleM rep a -> SimpleM rep b
forall (f :: * -> *) a b. Functor f => (a -> b) -> f a -> f b
fmap (Body (Wise rep), Stms (Wise rep)) -> Body (Wise rep)
forall a b. (a, b) -> a
fst (SimpleM rep (Body (Wise rep), Stms (Wise rep))
 -> SimpleM rep (Body (Wise rep)))
-> (BuilderT (Wise rep) (State VNameSource) Result
    -> SimpleM rep (Body (Wise rep), Stms (Wise rep)))
-> BuilderT (Wise rep) (State VNameSource) Result
-> SimpleM rep (Body (Wise rep))
forall b c a. (b -> c) -> (a -> b) -> a -> c
. Builder (Wise rep) (Body (Wise rep))
-> SimpleM rep (Body (Wise rep), Stms (Wise rep))
forall (m :: * -> *) somerep rep a.
(MonadFreshNames m, HasScope somerep m, SameScope somerep rep) =>
Builder rep a -> m (a, Stms rep)
runBuilder (Builder (Wise rep) (Body (Wise rep))
 -> SimpleM rep (Body (Wise rep), Stms (Wise rep)))
-> (BuilderT (Wise rep) (State VNameSource) Result
    -> Builder (Wise rep) (Body (Wise rep)))
-> BuilderT (Wise rep) (State VNameSource) Result
-> SimpleM rep (Body (Wise rep), Stms (Wise rep))
forall b c a. (b -> c) -> (a -> b) -> a -> c
. BuilderT (Wise rep) (State VNameSource) Result
-> BuilderT
     (Wise rep)
     (State VNameSource)
     (Body (Rep (BuilderT (Wise rep) (State VNameSource))))
BuilderT (Wise rep) (State VNameSource) Result
-> Builder (Wise rep) (Body (Wise rep))
forall (m :: * -> *).
MonadBuilder m =>
m Result -> m (Body (Rep m))
buildBody_ (BuilderT (Wise rep) (State VNameSource) Result
 -> SimpleM rep (Body (Wise rep)))
-> BuilderT (Wise rep) (State VNameSource) Result
-> SimpleM rep (Body (Wise rep))
forall a b. (a -> b) -> a -> b
$ do
    Stms (Rep (BuilderT (Wise rep) (State VNameSource)))
-> BuilderT (Wise rep) (State VNameSource) ()
forall (m :: * -> *). MonadBuilder m => Stms (Rep m) -> m ()
addStms Stms (Rep (BuilderT (Wise rep) (State VNameSource)))
Stms (Wise rep)
stms
    Result -> BuilderT (Wise rep) (State VNameSource) Result
forall a. a -> BuilderT (Wise rep) (State VNameSource) a
forall (f :: * -> *) a. Applicative f => a -> f a
pure Result
res

blockIf ::
  SimplifiableRep rep =>
  BlockPred (Wise rep) ->
  Stms (Wise rep) ->
  SimpleM rep (a, UT.UsageTable) ->
  SimpleM rep (a, Stms (Wise rep), Stms (Wise rep))
blockIf :: forall rep a.
SimplifiableRep rep =>
BlockPred (Wise rep)
-> Stms (Wise rep)
-> SimpleM rep (a, UsageTable)
-> SimpleM rep (a, Stms (Wise rep), Stms (Wise rep))
blockIf BlockPred (Wise rep)
block Stms (Wise rep)
stms SimpleM rep (a, UsageTable)
m = do
  RuleBook (Wise rep)
rules <- (Env rep -> RuleBook (Wise rep))
-> SimpleM rep (RuleBook (Wise rep))
forall rep a. (Env rep -> a) -> SimpleM rep a
asksEngineEnv Env rep -> RuleBook (Wise rep)
forall {k} (rep :: k). Env rep -> RuleBook (Wise rep)
envRules
  RuleBook (Wise rep)
-> BlockPred (Wise rep)
-> Stms (Wise rep)
-> SimpleM rep (a, UsageTable)
-> SimpleM rep (a, Stms (Wise rep), Stms (Wise rep))
forall rep a.
SimplifiableRep rep =>
RuleBook (Wise rep)
-> BlockPred (Wise rep)
-> Stms (Wise rep)
-> SimpleM rep (a, UsageTable)
-> SimpleM rep (a, Stms (Wise rep), Stms (Wise rep))
hoistStms RuleBook (Wise rep)
rules BlockPred (Wise rep)
block Stms (Wise rep)
stms SimpleM rep (a, UsageTable)
m

hasFree :: ASTRep rep => Names -> BlockPred rep
hasFree :: forall rep. ASTRep rep => Names -> BlockPred rep
hasFree Names
ks SymbolTable rep
_ UsageTable
_ Stm rep
need = Names
ks Names -> Names -> Bool
`namesIntersect` Stm rep -> Names
forall a. FreeIn a => a -> Names
freeIn Stm rep
need

isNotSafe :: ASTRep rep => BlockPred rep
isNotSafe :: forall rep. ASTRep rep => BlockPred rep
isNotSafe SymbolTable rep
_ UsageTable
_ = Bool -> Bool
not (Bool -> Bool) -> (Stm rep -> Bool) -> Stm rep -> Bool
forall b c a. (b -> c) -> (a -> b) -> a -> c
. Exp rep -> Bool
forall rep. IsOp (Op rep) => Exp rep -> Bool
safeExp (Exp rep -> Bool) -> (Stm rep -> Exp rep) -> Stm rep -> Bool
forall b c a. (b -> c) -> (a -> b) -> a -> c
. Stm rep -> Exp rep
forall rep. Stm rep -> Exp rep
stmExp

isConsuming :: Aliased rep => BlockPred rep
isConsuming :: forall rep. Aliased rep => BlockPred rep
isConsuming SymbolTable rep
_ UsageTable
_ = Exp rep -> Bool
forall {rep}. Aliased rep => Exp rep -> Bool
isUpdate (Exp rep -> Bool) -> (Stm rep -> Exp rep) -> Stm rep -> Bool
forall b c a. (b -> c) -> (a -> b) -> a -> c
. Stm rep -> Exp rep
forall rep. Stm rep -> Exp rep
stmExp
  where
    isUpdate :: Exp rep -> Bool
isUpdate Exp rep
e = Exp rep -> Names
forall rep. Aliased rep => Exp rep -> Names
consumedInExp Exp rep
e Names -> Names -> Bool
forall a. Eq a => a -> a -> Bool
/= Names
forall a. Monoid a => a
mempty

isNotCheap :: ASTRep rep => BlockPred rep
isNotCheap :: forall rep. ASTRep rep => BlockPred rep
isNotCheap SymbolTable rep
_ UsageTable
_ = Bool -> Bool
not (Bool -> Bool) -> (Stm rep -> Bool) -> Stm rep -> Bool
forall b c a. (b -> c) -> (a -> b) -> a -> c
. Stm rep -> Bool
forall rep. ASTRep rep => Stm rep -> Bool
cheapStm

cheapStm :: ASTRep rep => Stm rep -> Bool
cheapStm :: forall rep. ASTRep rep => Stm rep -> Bool
cheapStm = Exp rep -> Bool
forall {rep}. ASTRep rep => Exp rep -> Bool
cheapExp (Exp rep -> Bool) -> (Stm rep -> Exp rep) -> Stm rep -> Bool
forall b c a. (b -> c) -> (a -> b) -> a -> c
. Stm rep -> Exp rep
forall rep. Stm rep -> Exp rep
stmExp

cheapExp :: ASTRep rep => Exp rep -> Bool
cheapExp :: forall {rep}. ASTRep rep => Exp rep -> Bool
cheapExp (BasicOp BinOp {}) = Bool
True
cheapExp (BasicOp SubExp {}) = Bool
True
cheapExp (BasicOp UnOp {}) = Bool
True
cheapExp (BasicOp CmpOp {}) = Bool
True
cheapExp (BasicOp ConvOp {}) = Bool
True
cheapExp (BasicOp Assert {}) = Bool
True
cheapExp (BasicOp Replicate {}) = Bool
False
cheapExp (BasicOp Concat {}) = Bool
False
cheapExp (BasicOp Manifest {}) = Bool
False
cheapExp DoLoop {} = Bool
False
cheapExp (Match [SubExp]
_ [Case (Body rep)]
cases Body rep
defbranch MatchDec (BranchType rep)
_) =
  (Case (Body rep) -> Bool) -> [Case (Body rep)] -> Bool
forall (t :: * -> *) a. Foldable t => (a -> Bool) -> t a -> Bool
all ((Stm rep -> Bool) -> Seq (Stm rep) -> Bool
forall (t :: * -> *) a. Foldable t => (a -> Bool) -> t a -> Bool
all Stm rep -> Bool
forall rep. ASTRep rep => Stm rep -> Bool
cheapStm (Seq (Stm rep) -> Bool)
-> (Case (Body rep) -> Seq (Stm rep)) -> Case (Body rep) -> Bool
forall b c a. (b -> c) -> (a -> b) -> a -> c
. Body rep -> Seq (Stm rep)
forall rep. Body rep -> Stms rep
bodyStms (Body rep -> Seq (Stm rep))
-> (Case (Body rep) -> Body rep)
-> Case (Body rep)
-> Seq (Stm rep)
forall b c a. (b -> c) -> (a -> b) -> a -> c
. Case (Body rep) -> Body rep
forall body. Case body -> body
caseBody) [Case (Body rep)]
cases
    Bool -> Bool -> Bool
&& (Stm rep -> Bool) -> Seq (Stm rep) -> Bool
forall (t :: * -> *) a. Foldable t => (a -> Bool) -> t a -> Bool
all Stm rep -> Bool
forall rep. ASTRep rep => Stm rep -> Bool
cheapStm (Body rep -> Seq (Stm rep)
forall rep. Body rep -> Stms rep
bodyStms Body rep
defbranch)
cheapExp (Op OpC rep rep
op) = OpC rep rep -> Bool
forall op. IsOp op => op -> Bool
cheapOp OpC rep rep
op
cheapExp Exp rep
_ = Bool
True -- Used to be False, but
-- let's try it out.

loopInvariantStm :: ASTRep rep => ST.SymbolTable rep -> Stm rep -> Bool
loopInvariantStm :: forall rep. ASTRep rep => SymbolTable rep -> Stm rep -> Bool
loopInvariantStm SymbolTable rep
vtable =
  (VName -> Bool) -> [VName] -> Bool
forall (t :: * -> *) a. Foldable t => (a -> Bool) -> t a -> Bool
all (VName -> Names -> Bool
`nameIn` SymbolTable rep -> Names
forall rep. SymbolTable rep -> Names
ST.availableAtClosestLoop SymbolTable rep
vtable) ([VName] -> Bool) -> (Stm rep -> [VName]) -> Stm rep -> Bool
forall b c a. (b -> c) -> (a -> b) -> a -> c
. Names -> [VName]
namesToList (Names -> [VName]) -> (Stm rep -> Names) -> Stm rep -> [VName]
forall b c a. (b -> c) -> (a -> b) -> a -> c
. Stm rep -> Names
forall a. FreeIn a => a -> Names
freeIn

matchBlocker ::
  SimplifiableRep rep =>
  [SubExp] ->
  MatchDec rt ->
  SimpleM rep (BlockPred (Wise rep))
matchBlocker :: forall rep rt.
SimplifiableRep rep =>
[SubExp] -> MatchDec rt -> SimpleM rep (BlockPred (Wise rep))
matchBlocker [SubExp]
cond (MatchDec [rt]
_ MatchSort
ifsort) = do
  Stm (Wise rep) -> Bool
is_alloc_fun <- (Env rep -> Stm (Wise rep) -> Bool)
-> SimpleM rep (Stm (Wise rep) -> Bool)
forall rep a. (Env rep -> a) -> SimpleM rep a
asksEngineEnv ((Env rep -> Stm (Wise rep) -> Bool)
 -> SimpleM rep (Stm (Wise rep) -> Bool))
-> (Env rep -> Stm (Wise rep) -> Bool)
-> SimpleM rep (Stm (Wise rep) -> Bool)
forall a b. (a -> b) -> a -> b
$ HoistBlockers rep -> Stm (Wise rep) -> Bool
forall {k} (rep :: k). HoistBlockers rep -> Stm (Wise rep) -> Bool
isAllocation (HoistBlockers rep -> Stm (Wise rep) -> Bool)
-> (Env rep -> HoistBlockers rep)
-> Env rep
-> Stm (Wise rep)
-> Bool
forall b c a. (b -> c) -> (a -> b) -> a -> c
. Env rep -> HoistBlockers rep
forall {k} (rep :: k). Env rep -> HoistBlockers rep
envHoistBlockers
  BlockPred (Wise rep)
branch_blocker <- (Env rep -> BlockPred (Wise rep))
-> SimpleM rep (BlockPred (Wise rep))
forall rep a. (Env rep -> a) -> SimpleM rep a
asksEngineEnv ((Env rep -> BlockPred (Wise rep))
 -> SimpleM rep (BlockPred (Wise rep)))
-> (Env rep -> BlockPred (Wise rep))
-> SimpleM rep (BlockPred (Wise rep))
forall a b. (a -> b) -> a -> b
$ HoistBlockers rep -> BlockPred (Wise rep)
forall {k} (rep :: k). HoistBlockers rep -> BlockPred (Wise rep)
blockHoistBranch (HoistBlockers rep -> BlockPred (Wise rep))
-> (Env rep -> HoistBlockers rep)
-> Env rep
-> BlockPred (Wise rep)
forall b c a. (b -> c) -> (a -> b) -> a -> c
. Env rep -> HoistBlockers rep
forall {k} (rep :: k). Env rep -> HoistBlockers rep
envHoistBlockers
  SymbolTable (Wise rep)
vtable <- SimpleM rep (SymbolTable (Wise rep))
forall rep. SimpleM rep (SymbolTable (Wise rep))
askVtable
  let -- We are unwilling to hoist things that are unsafe or costly,
      -- except if they are invariant to the most enclosing loop,
      -- because in that case they will also be hoisted past that
      -- loop.
      --
      -- We also try very hard to hoist allocations or anything that
      -- contributes to memory or array size, because that will allow
      -- allocations to be hoisted.
      cond_loop_invariant :: Bool
cond_loop_invariant =
        (VName -> Bool) -> [VName] -> Bool
forall (t :: * -> *) a. Foldable t => (a -> Bool) -> t a -> Bool
all (VName -> Names -> Bool
`nameIn` SymbolTable (Wise rep) -> Names
forall rep. SymbolTable rep -> Names
ST.availableAtClosestLoop SymbolTable (Wise rep)
vtable) ([VName] -> Bool) -> [VName] -> Bool
forall a b. (a -> b) -> a -> b
$ Names -> [VName]
namesToList (Names -> [VName]) -> Names -> [VName]
forall a b. (a -> b) -> a -> b
$ [SubExp] -> Names
forall a. FreeIn a => a -> Names
freeIn [SubExp]
cond

      desirableToHoist :: UsageTable -> Stm (Wise rep) -> Bool
desirableToHoist UsageTable
usage Stm (Wise rep)
stm =
        Stm (Wise rep) -> Bool
is_alloc_fun Stm (Wise rep)
stm
          Bool -> Bool -> Bool
|| ( SymbolTable (Wise rep) -> Int
forall rep. SymbolTable rep -> Int
ST.loopDepth SymbolTable (Wise rep)
vtable Int -> Int -> Bool
forall a. Ord a => a -> a -> Bool
> Int
0
                 Bool -> Bool -> Bool
&& Bool
cond_loop_invariant
                 Bool -> Bool -> Bool
&& MatchSort
ifsort MatchSort -> MatchSort -> Bool
forall a. Eq a => a -> a -> Bool
/= MatchSort
MatchFallback
                 Bool -> Bool -> Bool
&& SymbolTable (Wise rep) -> Stm (Wise rep) -> Bool
forall rep. ASTRep rep => SymbolTable rep -> Stm rep -> Bool
loopInvariantStm SymbolTable (Wise rep)
vtable Stm (Wise rep)
stm
                 -- Avoid hoisting out something that might change the
                 -- asymptotics of the program.
                 Bool -> Bool -> Bool
&& (Type -> Bool) -> [Type] -> Bool
forall (t :: * -> *) a. Foldable t => (a -> Bool) -> t a -> Bool
all Type -> Bool
forall shape u. TypeBase shape u -> Bool
primType (Pat (VarWisdom, LetDec rep) -> [Type]
forall dec. Typed dec => Pat dec -> [Type]
patTypes (Stm (Wise rep) -> Pat (LetDec (Wise rep))
forall rep. Stm rep -> Pat (LetDec rep)
stmPat Stm (Wise rep)
stm))
             )
          Bool -> Bool -> Bool
|| ( MatchSort
ifsort MatchSort -> MatchSort -> Bool
forall a. Eq a => a -> a -> Bool
/= MatchSort
MatchFallback
                 Bool -> Bool -> Bool
&& (VName -> Bool) -> [VName] -> Bool
forall (t :: * -> *) a. Foldable t => (a -> Bool) -> t a -> Bool
any (VName -> UsageTable -> Bool
`UT.isSize` UsageTable
usage) (Pat (VarWisdom, LetDec rep) -> [VName]
forall dec. Pat dec -> [VName]
patNames (Stm (Wise rep) -> Pat (LetDec (Wise rep))
forall rep. Stm rep -> Pat (LetDec rep)
stmPat Stm (Wise rep)
stm))
                 Bool -> Bool -> Bool
&& (Type -> Bool) -> [Type] -> Bool
forall (t :: * -> *) a. Foldable t => (a -> Bool) -> t a -> Bool
all Type -> Bool
forall shape u. TypeBase shape u -> Bool
primType (Pat (VarWisdom, LetDec rep) -> [Type]
forall dec. Typed dec => Pat dec -> [Type]
patTypes (Stm (Wise rep) -> Pat (LetDec (Wise rep))
forall rep. Stm rep -> Pat (LetDec rep)
stmPat Stm (Wise rep)
stm))
             )
      notDesirableToHoist :: BlockPred (Wise rep)
notDesirableToHoist SymbolTable (Wise rep)
_ UsageTable
usage Stm (Wise rep)
stm = Bool -> Bool
not (Bool -> Bool) -> Bool -> Bool
forall a b. (a -> b) -> a -> b
$ UsageTable -> Stm (Wise rep) -> Bool
desirableToHoist UsageTable
usage Stm (Wise rep)
stm

      -- No matter what, we always want to hoist constants as much as
      -- possible.
      isNotHoistableBnd :: BlockPred (Wise rep)
isNotHoistableBnd SymbolTable (Wise rep)
_ UsageTable
_ (Let Pat (LetDec (Wise rep))
_ StmAux (ExpDec (Wise rep))
_ (BasicOp ArrayLit {})) = Bool
False
      isNotHoistableBnd SymbolTable (Wise rep)
_ UsageTable
_ (Let Pat (LetDec (Wise rep))
_ StmAux (ExpDec (Wise rep))
_ (BasicOp SubExp {})) = Bool
False
      -- Hoist things that are free.
      isNotHoistableBnd SymbolTable (Wise rep)
_ UsageTable
_ (Let Pat (LetDec (Wise rep))
_ StmAux (ExpDec (Wise rep))
_ (BasicOp Reshape {})) = Bool
False
      isNotHoistableBnd SymbolTable (Wise rep)
_ UsageTable
_ (Let Pat (LetDec (Wise rep))
_ StmAux (ExpDec (Wise rep))
_ (BasicOp Rearrange {})) = Bool
False
      isNotHoistableBnd SymbolTable (Wise rep)
_ UsageTable
_ (Let Pat (LetDec (Wise rep))
_ StmAux (ExpDec (Wise rep))
_ (BasicOp (Index VName
_ Slice SubExp
slice))) =
        [SubExp] -> Bool
forall a. [a] -> Bool
forall (t :: * -> *) a. Foldable t => t a -> Bool
null ([SubExp] -> Bool) -> [SubExp] -> Bool
forall a b. (a -> b) -> a -> b
$ Slice SubExp -> [SubExp]
forall d. Slice d -> [d]
sliceDims Slice SubExp
slice
      --
      isNotHoistableBnd SymbolTable (Wise rep)
_ UsageTable
_ Stm (Wise rep)
stm
        | Stm (Wise rep) -> Bool
is_alloc_fun Stm (Wise rep)
stm = Bool
False
      isNotHoistableBnd SymbolTable (Wise rep)
_ UsageTable
_ Stm (Wise rep)
_ =
        -- Hoist aggressively out of versioning branches.
        MatchSort
ifsort MatchSort -> MatchSort -> Bool
forall a. Eq a => a -> a -> Bool
/= MatchSort
MatchEquiv

      block :: BlockPred (Wise rep)
block =
        BlockPred (Wise rep)
branch_blocker
          BlockPred (Wise rep)
-> BlockPred (Wise rep) -> BlockPred (Wise rep)
forall rep. BlockPred rep -> BlockPred rep -> BlockPred rep
`orIf` ( (BlockPred (Wise rep)
forall rep. ASTRep rep => BlockPred rep
isNotSafe BlockPred (Wise rep)
-> BlockPred (Wise rep) -> BlockPred (Wise rep)
forall rep. BlockPred rep -> BlockPred rep -> BlockPred rep
`orIf` BlockPred (Wise rep)
forall rep. ASTRep rep => BlockPred rep
isNotCheap BlockPred (Wise rep)
-> BlockPred (Wise rep) -> BlockPred (Wise rep)
forall rep. BlockPred rep -> BlockPred rep -> BlockPred rep
`orIf` BlockPred (Wise rep)
isNotHoistableBnd)
                     BlockPred (Wise rep)
-> BlockPred (Wise rep) -> BlockPred (Wise rep)
forall rep. BlockPred rep -> BlockPred rep -> BlockPred rep
`andAlso` BlockPred (Wise rep)
notDesirableToHoist
                 )
          BlockPred (Wise rep)
-> BlockPred (Wise rep) -> BlockPred (Wise rep)
forall rep. BlockPred rep -> BlockPred rep -> BlockPred rep
`orIf` BlockPred (Wise rep)
forall rep. Aliased rep => BlockPred rep
isConsuming
  BlockPred (Wise rep) -> SimpleM rep (BlockPred (Wise rep))
forall a. a -> SimpleM rep a
forall (f :: * -> *) a. Applicative f => a -> f a
pure BlockPred (Wise rep)
block

-- | Simplify a single body.
simplifyBody ::
  SimplifiableRep rep =>
  BlockPred (Wise rep) ->
  UT.UsageTable ->
  [UT.Usages] ->
  Body (Wise rep) ->
  SimpleM rep (Stms (Wise rep), Body (Wise rep))
simplifyBody :: forall rep.
SimplifiableRep rep =>
BlockPred (Wise rep)
-> UsageTable
-> [Usages]
-> Body (Wise rep)
-> SimpleM rep (Stms (Wise rep), Body (Wise rep))
simplifyBody BlockPred (Wise rep)
blocker UsageTable
usage [Usages]
res_usages (Body BodyDec (Wise rep)
_ Stms (Wise rep)
stms Result
res) = do
  (Result
res', Stms (Wise rep)
stms', Stms (Wise rep)
hoisted) <-
    BlockPred (Wise rep)
-> Stms (Wise rep)
-> SimpleM rep (Result, UsageTable)
-> SimpleM rep (Result, Stms (Wise rep), Stms (Wise rep))
forall rep a.
SimplifiableRep rep =>
BlockPred (Wise rep)
-> Stms (Wise rep)
-> SimpleM rep (a, UsageTable)
-> SimpleM rep (a, Stms (Wise rep), Stms (Wise rep))
blockIf BlockPred (Wise rep)
blocker Stms (Wise rep)
stms (SimpleM rep (Result, UsageTable)
 -> SimpleM rep (Result, Stms (Wise rep), Stms (Wise rep)))
-> SimpleM rep (Result, UsageTable)
-> SimpleM rep (Result, Stms (Wise rep), Stms (Wise rep))
forall a b. (a -> b) -> a -> b
$ do
      (Result
res', UsageTable
res_usage) <- [Usages] -> Result -> SimpleM rep (Result, UsageTable)
forall rep.
SimplifiableRep rep =>
[Usages] -> Result -> SimpleM rep (Result, UsageTable)
simplifyResult [Usages]
res_usages Result
res
      (Result, UsageTable) -> SimpleM rep (Result, UsageTable)
forall a. a -> SimpleM rep a
forall (f :: * -> *) a. Applicative f => a -> f a
pure (Result
res', UsageTable
res_usage UsageTable -> UsageTable -> UsageTable
forall a. Semigroup a => a -> a -> a
<> UsageTable
usage)
  Body (Wise rep)
body' <- Stms (Wise rep) -> Result -> SimpleM rep (Body (Wise rep))
forall rep.
SimplifiableRep rep =>
Stms (Wise rep) -> Result -> SimpleM rep (Body (Wise rep))
constructBody Stms (Wise rep)
stms' Result
res'
  (Stms (Wise rep), Body (Wise rep))
-> SimpleM rep (Stms (Wise rep), Body (Wise rep))
forall a. a -> SimpleM rep a
forall (f :: * -> *) a. Applicative f => a -> f a
pure (Stms (Wise rep)
hoisted, Body (Wise rep)
body')

-- | Simplify a single body.
simplifyBodyNoHoisting ::
  SimplifiableRep rep =>
  UT.UsageTable ->
  [UT.Usages] ->
  Body (Wise rep) ->
  SimpleM rep (Body (Wise rep))
simplifyBodyNoHoisting :: forall rep.
SimplifiableRep rep =>
UsageTable
-> [Usages] -> Body (Wise rep) -> SimpleM rep (Body (Wise rep))
simplifyBodyNoHoisting UsageTable
usage [Usages]
res_usages Body (Wise rep)
body =
  (Stms (Wise rep), Body (Wise rep)) -> Body (Wise rep)
forall a b. (a, b) -> b
snd ((Stms (Wise rep), Body (Wise rep)) -> Body (Wise rep))
-> SimpleM rep (Stms (Wise rep), Body (Wise rep))
-> SimpleM rep (Body (Wise rep))
forall (f :: * -> *) a b. Functor f => (a -> b) -> f a -> f b
<$> BlockPred (Wise rep)
-> UsageTable
-> [Usages]
-> Body (Wise rep)
-> SimpleM rep (Stms (Wise rep), Body (Wise rep))
forall rep.
SimplifiableRep rep =>
BlockPred (Wise rep)
-> UsageTable
-> [Usages]
-> Body (Wise rep)
-> SimpleM rep (Stms (Wise rep), Body (Wise rep))
simplifyBody (Bool -> BlockPred (Wise rep)
forall rep. Bool -> BlockPred rep
isFalse Bool
False) UsageTable
usage [Usages]
res_usages Body (Wise rep)
body

usageFromDiet :: Diet -> UT.Usages
usageFromDiet :: Diet -> Usages
usageFromDiet Diet
Consume = Usages
UT.consumedU
usageFromDiet Diet
_ = Usages
forall a. Monoid a => a
mempty

-- | Simplify a single 'Result'.
simplifyResult ::
  SimplifiableRep rep => [UT.Usages] -> Result -> SimpleM rep (Result, UT.UsageTable)
simplifyResult :: forall rep.
SimplifiableRep rep =>
[Usages] -> Result -> SimpleM rep (Result, UsageTable)
simplifyResult [Usages]
usages Result
res = do
  Result
res' <- (SubExpRes -> SimpleM rep SubExpRes)
-> Result -> SimpleM rep Result
forall (t :: * -> *) (m :: * -> *) a b.
(Traversable t, Monad m) =>
(a -> m b) -> t a -> m (t b)
forall (m :: * -> *) a b. Monad m => (a -> m b) -> [a] -> m [b]
mapM SubExpRes -> SimpleM rep SubExpRes
forall rep.
SimplifiableRep rep =>
SubExpRes -> SimpleM rep SubExpRes
forall e rep.
(Simplifiable e, SimplifiableRep rep) =>
e -> SimpleM rep e
simplify Result
res
  SymbolTable (Wise rep)
vtable <- SimpleM rep (SymbolTable (Wise rep))
forall rep. SimpleM rep (SymbolTable (Wise rep))
askVtable
  let more_usages :: UsageTable
more_usages = [UsageTable] -> UsageTable
forall a. Monoid a => [a] -> a
mconcat ([UsageTable] -> UsageTable) -> [UsageTable] -> UsageTable
forall a b. (a -> b) -> a -> b
$ do
        (Usages
u, Var VName
v) <- [Usages] -> [SubExp] -> [(Usages, SubExp)]
forall a b. [a] -> [b] -> [(a, b)]
zip [Usages]
usages ([SubExp] -> [(Usages, SubExp)]) -> [SubExp] -> [(Usages, SubExp)]
forall a b. (a -> b) -> a -> b
$ (SubExpRes -> SubExp) -> Result -> [SubExp]
forall a b. (a -> b) -> [a] -> [b]
map SubExpRes -> SubExp
resSubExp Result
res
        let als_usages :: [UsageTable]
als_usages =
              (VName -> UsageTable) -> [VName] -> [UsageTable]
forall a b. (a -> b) -> [a] -> [b]
map
                (VName -> Usages -> UsageTable
`UT.usage` (Usages
u Usages -> Usages -> Usages
`UT.withoutU` Usages
UT.presentU))
                (Names -> [VName]
namesToList (VName -> SymbolTable (Wise rep) -> Names
forall rep. VName -> SymbolTable rep -> Names
ST.lookupAliases VName
v SymbolTable (Wise rep)
vtable))
        VName -> Usages -> UsageTable
UT.usage VName
v Usages
u UsageTable -> [UsageTable] -> [UsageTable]
forall a. a -> [a] -> [a]
: [UsageTable]
als_usages
  (Result, UsageTable) -> SimpleM rep (Result, UsageTable)
forall a. a -> SimpleM rep a
forall (f :: * -> *) a. Applicative f => a -> f a
pure
    ( Result
res',
      Names -> UsageTable
UT.usages (Result -> Names
forall a. FreeIn a => a -> Names
freeIn Result
res')
        UsageTable -> UsageTable -> UsageTable
forall a. Semigroup a => a -> a -> a
<> (VName -> UsageTable) -> [VName] -> UsageTable
forall m a. Monoid m => (a -> m) -> [a] -> m
forall (t :: * -> *) m a.
(Foldable t, Monoid m) =>
(a -> m) -> t a -> m
foldMap VName -> UsageTable
UT.inResultUsage (Names -> [VName]
namesToList (Result -> Names
forall a. FreeIn a => a -> Names
freeIn Result
res'))
        UsageTable -> UsageTable -> UsageTable
forall a. Semigroup a => a -> a -> a
<> UsageTable
more_usages
    )

isDoLoopResult :: Result -> UT.UsageTable
isDoLoopResult :: Result -> UsageTable
isDoLoopResult = [UsageTable] -> UsageTable
forall a. Monoid a => [a] -> a
mconcat ([UsageTable] -> UsageTable)
-> (Result -> [UsageTable]) -> Result -> UsageTable
forall b c a. (b -> c) -> (a -> b) -> a -> c
. (SubExpRes -> UsageTable) -> Result -> [UsageTable]
forall a b. (a -> b) -> [a] -> [b]
map SubExpRes -> UsageTable
checkForVar
  where
    checkForVar :: SubExpRes -> UsageTable
checkForVar (SubExpRes Certs
_ (Var VName
ident)) = VName -> UsageTable
UT.inResultUsage VName
ident
    checkForVar SubExpRes
_ = UsageTable
forall a. Monoid a => a
mempty

simplifyStms ::
  SimplifiableRep rep =>
  Stms (Wise rep) ->
  SimpleM rep (Stms (Wise rep))
simplifyStms :: forall rep.
SimplifiableRep rep =>
Stms (Wise rep) -> SimpleM rep (Stms (Wise rep))
simplifyStms Stms (Wise rep)
stms = do
  UsageTable -> Stms (Wise rep) -> SimpleM rep (Stms (Wise rep))
forall rep.
SimplifiableRep rep =>
UsageTable -> Stms (Wise rep) -> SimpleM rep (Stms (Wise rep))
simplifyStmsWithUsage UsageTable
all_used Stms (Wise rep)
stms
  where
    all_used :: UsageTable
all_used =
      Names -> UsageTable
UT.usages ([VName] -> Names
namesFromList (Map VName (NameInfo (Wise rep)) -> [VName]
forall k a. Map k a -> [k]
M.keys (Stms (Wise rep) -> Map VName (NameInfo (Wise rep))
forall rep a. Scoped rep a => a -> Scope rep
scopeOf Stms (Wise rep)
stms)))

simplifyStmsWithUsage ::
  SimplifiableRep rep =>
  UT.UsageTable ->
  Stms (Wise rep) ->
  SimpleM rep (Stms (Wise rep))
simplifyStmsWithUsage :: forall rep.
SimplifiableRep rep =>
UsageTable -> Stms (Wise rep) -> SimpleM rep (Stms (Wise rep))
simplifyStmsWithUsage UsageTable
usage Stms (Wise rep)
stms = do
  ((), Stms (Wise rep)
stms', Stms (Wise rep)
_) <- BlockPred (Wise rep)
-> Stms (Wise rep)
-> SimpleM rep ((), UsageTable)
-> SimpleM rep ((), Stms (Wise rep), Stms (Wise rep))
forall rep a.
SimplifiableRep rep =>
BlockPred (Wise rep)
-> Stms (Wise rep)
-> SimpleM rep (a, UsageTable)
-> SimpleM rep (a, Stms (Wise rep), Stms (Wise rep))
blockIf (Bool -> BlockPred (Wise rep)
forall rep. Bool -> BlockPred rep
isFalse Bool
False) Stms (Wise rep)
stms (SimpleM rep ((), UsageTable)
 -> SimpleM rep ((), Stms (Wise rep), Stms (Wise rep)))
-> SimpleM rep ((), UsageTable)
-> SimpleM rep ((), Stms (Wise rep), Stms (Wise rep))
forall a b. (a -> b) -> a -> b
$ ((), UsageTable) -> SimpleM rep ((), UsageTable)
forall a. a -> SimpleM rep a
forall (f :: * -> *) a. Applicative f => a -> f a
pure ((), UsageTable
usage)
  Stms (Wise rep) -> SimpleM rep (Stms (Wise rep))
forall a. a -> SimpleM rep a
forall (f :: * -> *) a. Applicative f => a -> f a
pure Stms (Wise rep)
stms'

simplifyOp :: Op (Wise rep) -> SimpleM rep (Op (Wise rep), Stms (Wise rep))
simplifyOp :: forall rep.
Op (Wise rep) -> SimpleM rep (Op (Wise rep), Stms (Wise rep))
simplifyOp Op (Wise rep)
op = do
  OpC rep (Wise rep)
-> SimpleM rep (OpC rep (Wise rep), Stms (Wise rep))
f <- ((SimpleOps rep, Env rep)
 -> OpC rep (Wise rep)
 -> SimpleM rep (OpC rep (Wise rep), Stms (Wise rep)))
-> SimpleM
     rep
     (OpC rep (Wise rep)
      -> SimpleM rep (OpC rep (Wise rep), Stms (Wise rep)))
forall r (m :: * -> *) a. MonadReader r m => (r -> a) -> m a
asks (((SimpleOps rep, Env rep)
  -> OpC rep (Wise rep)
  -> SimpleM rep (OpC rep (Wise rep), Stms (Wise rep)))
 -> SimpleM
      rep
      (OpC rep (Wise rep)
       -> SimpleM rep (OpC rep (Wise rep), Stms (Wise rep))))
-> ((SimpleOps rep, Env rep)
    -> OpC rep (Wise rep)
    -> SimpleM rep (OpC rep (Wise rep), Stms (Wise rep)))
-> SimpleM
     rep
     (OpC rep (Wise rep)
      -> SimpleM rep (OpC rep (Wise rep), Stms (Wise rep)))
forall a b. (a -> b) -> a -> b
$ SimpleOps rep
-> OpC rep (Wise rep)
-> SimpleM rep (OpC rep (Wise rep), Stms (Wise rep))
SimpleOps rep -> SimplifyOp rep (Op (Wise rep))
forall rep. SimpleOps rep -> SimplifyOp rep (Op (Wise rep))
simplifyOpS (SimpleOps rep
 -> OpC rep (Wise rep)
 -> SimpleM rep (OpC rep (Wise rep), Stms (Wise rep)))
-> ((SimpleOps rep, Env rep) -> SimpleOps rep)
-> (SimpleOps rep, Env rep)
-> OpC rep (Wise rep)
-> SimpleM rep (OpC rep (Wise rep), Stms (Wise rep))
forall b c a. (b -> c) -> (a -> b) -> a -> c
. (SimpleOps rep, Env rep) -> SimpleOps rep
forall a b. (a, b) -> a
fst
  OpC rep (Wise rep)
-> SimpleM rep (OpC rep (Wise rep), Stms (Wise rep))
f OpC rep (Wise rep)
Op (Wise rep)
op

simplifyExp ::
  SimplifiableRep rep =>
  UT.UsageTable ->
  Pat (LetDec (Wise rep)) ->
  Exp (Wise rep) ->
  SimpleM rep (Exp (Wise rep), Stms (Wise rep))
simplifyExp :: forall rep.
SimplifiableRep rep =>
UsageTable
-> Pat (LetDec (Wise rep))
-> Exp (Wise rep)
-> SimpleM rep (Exp (Wise rep), Stms (Wise rep))
simplifyExp UsageTable
usage (Pat [PatElem (LetDec (Wise rep))]
pes) (Match [SubExp]
ses [Case (Body (Wise rep))]
cases Body (Wise rep)
defbody ifdec :: MatchDec (BranchType (Wise rep))
ifdec@(MatchDec [BranchType (Wise rep)]
ts MatchSort
ifsort)) = do
  let pes_usages :: [Usages]
pes_usages = (PatElem (VarWisdom, LetDec rep) -> Usages)
-> [PatElem (VarWisdom, LetDec rep)] -> [Usages]
forall a b. (a -> b) -> [a] -> [b]
map (Usages -> Maybe Usages -> Usages
forall a. a -> Maybe a -> a
fromMaybe Usages
forall a. Monoid a => a
mempty (Maybe Usages -> Usages)
-> (PatElem (VarWisdom, LetDec rep) -> Maybe Usages)
-> PatElem (VarWisdom, LetDec rep)
-> Usages
forall b c a. (b -> c) -> (a -> b) -> a -> c
. (VName -> UsageTable -> Maybe Usages
`UT.lookup` UsageTable
usage) (VName -> Maybe Usages)
-> (PatElem (VarWisdom, LetDec rep) -> VName)
-> PatElem (VarWisdom, LetDec rep)
-> Maybe Usages
forall b c a. (b -> c) -> (a -> b) -> a -> c
. PatElem (VarWisdom, LetDec rep) -> VName
forall dec. PatElem dec -> VName
patElemName) [PatElem (VarWisdom, LetDec rep)]
[PatElem (LetDec (Wise rep))]
pes
  [SubExp]
ses' <- (SubExp -> SimpleM rep SubExp) -> [SubExp] -> SimpleM rep [SubExp]
forall (t :: * -> *) (m :: * -> *) a b.
(Traversable t, Monad m) =>
(a -> m b) -> t a -> m (t b)
forall (m :: * -> *) a b. Monad m => (a -> m b) -> [a] -> m [b]
mapM SubExp -> SimpleM rep SubExp
forall rep. SimplifiableRep rep => SubExp -> SimpleM rep SubExp
forall e rep.
(Simplifiable e, SimplifiableRep rep) =>
e -> SimpleM rep e
simplify [SubExp]
ses
  [BranchType rep]
ts' <- (BranchType rep -> SimpleM rep (BranchType rep))
-> [BranchType rep] -> SimpleM rep [BranchType rep]
forall (t :: * -> *) (m :: * -> *) a b.
(Traversable t, Monad m) =>
(a -> m b) -> t a -> m (t b)
forall (m :: * -> *) a b. Monad m => (a -> m b) -> [a] -> m [b]
mapM BranchType rep -> SimpleM rep (BranchType rep)
forall rep.
SimplifiableRep rep =>
BranchType rep -> SimpleM rep (BranchType rep)
forall e rep.
(Simplifiable e, SimplifiableRep rep) =>
e -> SimpleM rep e
simplify [BranchType rep]
[BranchType (Wise rep)]
ts
  let pats :: [[Maybe PrimValue]]
pats = (Case (Body (Wise rep)) -> [Maybe PrimValue])
-> [Case (Body (Wise rep))] -> [[Maybe PrimValue]]
forall a b. (a -> b) -> [a] -> [b]
map Case (Body (Wise rep)) -> [Maybe PrimValue]
forall body. Case body -> [Maybe PrimValue]
casePat [Case (Body (Wise rep))]
cases
  BlockPred (Wise rep)
block <- [SubExp]
-> MatchDec (BranchType rep) -> SimpleM rep (BlockPred (Wise rep))
forall rep rt.
SimplifiableRep rep =>
[SubExp] -> MatchDec rt -> SimpleM rep (BlockPred (Wise rep))
matchBlocker [SubExp]
ses MatchDec (BranchType rep)
MatchDec (BranchType (Wise rep))
ifdec
  ([Stms (Wise rep)]
cases_hoisted, [Case (Body (Wise rep))]
cases') <-
    [(Stms (Wise rep), Case (Body (Wise rep)))]
-> ([Stms (Wise rep)], [Case (Body (Wise rep))])
forall a b. [(a, b)] -> ([a], [b])
unzip ([(Stms (Wise rep), Case (Body (Wise rep)))]
 -> ([Stms (Wise rep)], [Case (Body (Wise rep))]))
-> SimpleM rep [(Stms (Wise rep), Case (Body (Wise rep)))]
-> SimpleM rep ([Stms (Wise rep)], [Case (Body (Wise rep))])
forall (f :: * -> *) a b. Functor f => (a -> b) -> f a -> f b
<$> ([[Maybe PrimValue]]
 -> Case (Body (Wise rep))
 -> SimpleM rep (Stms (Wise rep), Case (Body (Wise rep))))
-> [[[Maybe PrimValue]]]
-> [Case (Body (Wise rep))]
-> SimpleM rep [(Stms (Wise rep), Case (Body (Wise rep)))]
forall (m :: * -> *) a b c.
Applicative m =>
(a -> b -> m c) -> [a] -> [b] -> m [c]
zipWithM (BlockPred (Wise rep)
-> [SubExp]
-> [Usages]
-> [[Maybe PrimValue]]
-> Case (Body (Wise rep))
-> SimpleM rep (Stms (Wise rep), Case (Body (Wise rep)))
simplifyCase BlockPred (Wise rep)
block [SubExp]
ses' [Usages]
pes_usages) ([[Maybe PrimValue]] -> [[[Maybe PrimValue]]]
forall a. [a] -> [[a]]
inits [[Maybe PrimValue]]
pats) [Case (Body (Wise rep))]
cases
  (Stms (Wise rep)
defbody_hoisted, Body (Wise rep)
defbody') <-
    [SubExp]
-> [[Maybe PrimValue]]
-> [Maybe PrimValue]
-> SimpleM rep (Stms (Wise rep), Body (Wise rep))
-> SimpleM rep (Stms (Wise rep), Body (Wise rep))
forall rep a.
SimplifiableRep rep =>
[SubExp]
-> [[Maybe PrimValue]]
-> [Maybe PrimValue]
-> SimpleM rep (Stms (Wise rep), a)
-> SimpleM rep (Stms (Wise rep), a)
protectCaseHoisted [SubExp]
ses' [[Maybe PrimValue]]
pats [] (SimpleM rep (Stms (Wise rep), Body (Wise rep))
 -> SimpleM rep (Stms (Wise rep), Body (Wise rep)))
-> SimpleM rep (Stms (Wise rep), Body (Wise rep))
-> SimpleM rep (Stms (Wise rep), Body (Wise rep))
forall a b. (a -> b) -> a -> b
$
      BlockPred (Wise rep)
-> UsageTable
-> [Usages]
-> Body (Wise rep)
-> SimpleM rep (Stms (Wise rep), Body (Wise rep))
forall rep.
SimplifiableRep rep =>
BlockPred (Wise rep)
-> UsageTable
-> [Usages]
-> Body (Wise rep)
-> SimpleM rep (Stms (Wise rep), Body (Wise rep))
simplifyBody BlockPred (Wise rep)
block UsageTable
usage [Usages]
pes_usages Body (Wise rep)
defbody
  (Exp (Wise rep), Stms (Wise rep))
-> SimpleM rep (Exp (Wise rep), Stms (Wise rep))
forall a. a -> SimpleM rep a
forall (f :: * -> *) a. Applicative f => a -> f a
pure
    ( [SubExp]
-> [Case (Body (Wise rep))]
-> Body (Wise rep)
-> MatchDec (BranchType (Wise rep))
-> Exp (Wise rep)
forall rep.
[SubExp]
-> [Case (Body rep)]
-> Body rep
-> MatchDec (BranchType rep)
-> Exp rep
Match [SubExp]
ses' [Case (Body (Wise rep))]
cases' Body (Wise rep)
defbody' (MatchDec (BranchType (Wise rep)) -> Exp (Wise rep))
-> MatchDec (BranchType (Wise rep)) -> Exp (Wise rep)
forall a b. (a -> b) -> a -> b
$ [BranchType rep] -> MatchSort -> MatchDec (BranchType rep)
forall rt. [rt] -> MatchSort -> MatchDec rt
MatchDec [BranchType rep]
ts' MatchSort
ifsort,
      [Stms (Wise rep)] -> Stms (Wise rep)
forall a. Monoid a => [a] -> a
mconcat ([Stms (Wise rep)] -> Stms (Wise rep))
-> [Stms (Wise rep)] -> Stms (Wise rep)
forall a b. (a -> b) -> a -> b
$ Stms (Wise rep)
defbody_hoisted Stms (Wise rep) -> [Stms (Wise rep)] -> [Stms (Wise rep)]
forall a. a -> [a] -> [a]
: [Stms (Wise rep)]
cases_hoisted
    )
  where
    simplifyCase :: BlockPred (Wise rep)
-> [SubExp]
-> [Usages]
-> [[Maybe PrimValue]]
-> Case (Body (Wise rep))
-> SimpleM rep (Stms (Wise rep), Case (Body (Wise rep)))
simplifyCase BlockPred (Wise rep)
block [SubExp]
ses' [Usages]
pes_usages [[Maybe PrimValue]]
prior (Case [Maybe PrimValue]
vs Body (Wise rep)
body) = do
      (Stms (Wise rep)
hoisted, Body (Wise rep)
body') <-
        [SubExp]
-> [[Maybe PrimValue]]
-> [Maybe PrimValue]
-> SimpleM rep (Stms (Wise rep), Body (Wise rep))
-> SimpleM rep (Stms (Wise rep), Body (Wise rep))
forall rep a.
SimplifiableRep rep =>
[SubExp]
-> [[Maybe PrimValue]]
-> [Maybe PrimValue]
-> SimpleM rep (Stms (Wise rep), a)
-> SimpleM rep (Stms (Wise rep), a)
protectCaseHoisted [SubExp]
ses' [[Maybe PrimValue]]
prior [Maybe PrimValue]
vs (SimpleM rep (Stms (Wise rep), Body (Wise rep))
 -> SimpleM rep (Stms (Wise rep), Body (Wise rep)))
-> SimpleM rep (Stms (Wise rep), Body (Wise rep))
-> SimpleM rep (Stms (Wise rep), Body (Wise rep))
forall a b. (a -> b) -> a -> b
$
          BlockPred (Wise rep)
-> UsageTable
-> [Usages]
-> Body (Wise rep)
-> SimpleM rep (Stms (Wise rep), Body (Wise rep))
forall rep.
SimplifiableRep rep =>
BlockPred (Wise rep)
-> UsageTable
-> [Usages]
-> Body (Wise rep)
-> SimpleM rep (Stms (Wise rep), Body (Wise rep))
simplifyBody BlockPred (Wise rep)
block UsageTable
usage [Usages]
pes_usages Body (Wise rep)
body
      (Stms (Wise rep), Case (Body (Wise rep)))
-> SimpleM rep (Stms (Wise rep), Case (Body (Wise rep)))
forall a. a -> SimpleM rep a
forall (f :: * -> *) a. Applicative f => a -> f a
pure (Stms (Wise rep)
hoisted, [Maybe PrimValue] -> Body (Wise rep) -> Case (Body (Wise rep))
forall body. [Maybe PrimValue] -> body -> Case body
Case [Maybe PrimValue]
vs Body (Wise rep)
body')
simplifyExp UsageTable
_ Pat (LetDec (Wise rep))
_ (DoLoop [(FParam (Wise rep), SubExp)]
merge LoopForm (Wise rep)
form Body (Wise rep)
loopbody) = do
  let ([Param (FParamInfo rep)]
params, [SubExp]
args) = [(Param (FParamInfo rep), SubExp)]
-> ([Param (FParamInfo rep)], [SubExp])
forall a b. [(a, b)] -> ([a], [b])
unzip [(Param (FParamInfo rep), SubExp)]
[(FParam (Wise rep), SubExp)]
merge
  [Param (FParamInfo rep)]
params' <- (Param (FParamInfo rep) -> SimpleM rep (Param (FParamInfo rep)))
-> [Param (FParamInfo rep)] -> SimpleM rep [Param (FParamInfo rep)]
forall (t :: * -> *) (m :: * -> *) a b.
(Traversable t, Monad m) =>
(a -> m b) -> t a -> m (t b)
forall (m :: * -> *) a b. Monad m => (a -> m b) -> [a] -> m [b]
mapM ((FParamInfo rep -> SimpleM rep (FParamInfo rep))
-> Param (FParamInfo rep) -> SimpleM rep (Param (FParamInfo rep))
forall (t :: * -> *) (f :: * -> *) a b.
(Traversable t, Applicative f) =>
(a -> f b) -> t a -> f (t b)
forall (f :: * -> *) a b.
Applicative f =>
(a -> f b) -> Param a -> f (Param b)
traverse FParamInfo rep -> SimpleM rep (FParamInfo rep)
forall rep.
SimplifiableRep rep =>
FParamInfo rep -> SimpleM rep (FParamInfo rep)
forall e rep.
(Simplifiable e, SimplifiableRep rep) =>
e -> SimpleM rep e
simplify) [Param (FParamInfo rep)]
params
  [SubExp]
args' <- (SubExp -> SimpleM rep SubExp) -> [SubExp] -> SimpleM rep [SubExp]
forall (t :: * -> *) (m :: * -> *) a b.
(Traversable t, Monad m) =>
(a -> m b) -> t a -> m (t b)
forall (m :: * -> *) a b. Monad m => (a -> m b) -> [a] -> m [b]
mapM SubExp -> SimpleM rep SubExp
forall rep. SimplifiableRep rep => SubExp -> SimpleM rep SubExp
forall e rep.
(Simplifiable e, SimplifiableRep rep) =>
e -> SimpleM rep e
simplify [SubExp]
args
  let merge' :: [(Param (FParamInfo rep), SubExp)]
merge' = [Param (FParamInfo rep)]
-> [SubExp] -> [(Param (FParamInfo rep), SubExp)]
forall a b. [a] -> [b] -> [(a, b)]
zip [Param (FParamInfo rep)]
params' [SubExp]
args'
  (LoopForm (Wise rep)
form', Names
boundnames, SimpleM rep (Result, Stms (Wise rep), Stms (Wise rep))
-> SimpleM rep (Result, Stms (Wise rep), Stms (Wise rep))
wrapbody) <- case LoopForm (Wise rep)
form of
    ForLoop VName
loopvar IntType
it SubExp
boundexp [(LParam (Wise rep), VName)]
loopvars -> do
      SubExp
boundexp' <- SubExp -> SimpleM rep SubExp
forall rep. SimplifiableRep rep => SubExp -> SimpleM rep SubExp
forall e rep.
(Simplifiable e, SimplifiableRep rep) =>
e -> SimpleM rep e
simplify SubExp
boundexp
      let ([Param (LParamInfo rep)]
loop_params, [VName]
loop_arrs) = [(Param (LParamInfo rep), VName)]
-> ([Param (LParamInfo rep)], [VName])
forall a b. [(a, b)] -> ([a], [b])
unzip [(Param (LParamInfo rep), VName)]
[(LParam (Wise rep), VName)]
loopvars
      [Param (LParamInfo rep)]
loop_params' <- (Param (LParamInfo rep) -> SimpleM rep (Param (LParamInfo rep)))
-> [Param (LParamInfo rep)] -> SimpleM rep [Param (LParamInfo rep)]
forall (t :: * -> *) (m :: * -> *) a b.
(Traversable t, Monad m) =>
(a -> m b) -> t a -> m (t b)
forall (m :: * -> *) a b. Monad m => (a -> m b) -> [a] -> m [b]
mapM ((LParamInfo rep -> SimpleM rep (LParamInfo rep))
-> Param (LParamInfo rep) -> SimpleM rep (Param (LParamInfo rep))
forall (t :: * -> *) (f :: * -> *) a b.
(Traversable t, Applicative f) =>
(a -> f b) -> t a -> f (t b)
forall (f :: * -> *) a b.
Applicative f =>
(a -> f b) -> Param a -> f (Param b)
traverse LParamInfo rep -> SimpleM rep (LParamInfo rep)
forall rep.
SimplifiableRep rep =>
LParamInfo rep -> SimpleM rep (LParamInfo rep)
forall e rep.
(Simplifiable e, SimplifiableRep rep) =>
e -> SimpleM rep e
simplify) [Param (LParamInfo rep)]
loop_params
      [VName]
loop_arrs' <- (VName -> SimpleM rep VName) -> [VName] -> SimpleM rep [VName]
forall (t :: * -> *) (m :: * -> *) a b.
(Traversable t, Monad m) =>
(a -> m b) -> t a -> m (t b)
forall (m :: * -> *) a b. Monad m => (a -> m b) -> [a] -> m [b]
mapM VName -> SimpleM rep VName
forall rep. SimplifiableRep rep => VName -> SimpleM rep VName
forall e rep.
(Simplifiable e, SimplifiableRep rep) =>
e -> SimpleM rep e
simplify [VName]
loop_arrs
      let form' :: LoopForm (Wise rep)
form' = VName
-> IntType
-> SubExp
-> [(LParam (Wise rep), VName)]
-> LoopForm (Wise rep)
forall rep.
VName -> IntType -> SubExp -> [(LParam rep, VName)] -> LoopForm rep
ForLoop VName
loopvar IntType
it SubExp
boundexp' ([Param (LParamInfo rep)]
-> [VName] -> [(Param (LParamInfo rep), VName)]
forall a b. [a] -> [b] -> [(a, b)]
zip [Param (LParamInfo rep)]
loop_params' [VName]
loop_arrs')
      (LoopForm (Wise rep), Names,
 SimpleM rep (Result, Stms (Wise rep), Stms (Wise rep))
 -> SimpleM rep (Result, Stms (Wise rep), Stms (Wise rep)))
-> SimpleM
     rep
     (LoopForm (Wise rep), Names,
      SimpleM rep (Result, Stms (Wise rep), Stms (Wise rep))
      -> SimpleM rep (Result, Stms (Wise rep), Stms (Wise rep)))
forall a. a -> SimpleM rep a
forall (f :: * -> *) a. Applicative f => a -> f a
pure
        ( LoopForm (Wise rep)
form',
          [VName] -> Names
namesFromList (VName
loopvar VName -> [VName] -> [VName]
forall a. a -> [a] -> [a]
: (Param (LParamInfo rep) -> VName)
-> [Param (LParamInfo rep)] -> [VName]
forall a b. (a -> b) -> [a] -> [b]
map Param (LParamInfo rep) -> VName
forall dec. Param dec -> VName
paramName [Param (LParamInfo rep)]
loop_params') Names -> Names -> Names
forall a. Semigroup a => a -> a -> a
<> Names
fparamnames,
          VName
-> IntType
-> SubExp
-> SimpleM rep (Result, Stms (Wise rep), Stms (Wise rep))
-> SimpleM rep (Result, Stms (Wise rep), Stms (Wise rep))
forall rep a.
SimplifiableRep rep =>
VName -> IntType -> SubExp -> SimpleM rep a -> SimpleM rep a
bindLoopVar VName
loopvar IntType
it SubExp
boundexp'
            (SimpleM rep (Result, Stms (Wise rep), Stms (Wise rep))
 -> SimpleM rep (Result, Stms (Wise rep), Stms (Wise rep)))
-> (SimpleM rep (Result, Stms (Wise rep), Stms (Wise rep))
    -> SimpleM rep (Result, Stms (Wise rep), Stms (Wise rep)))
-> SimpleM rep (Result, Stms (Wise rep), Stms (Wise rep))
-> SimpleM rep (Result, Stms (Wise rep), Stms (Wise rep))
forall b c a. (b -> c) -> (a -> b) -> a -> c
. [(FParam (Wise rep), SubExp)]
-> LoopForm (Wise rep)
-> SimpleM rep (Result, Stms (Wise rep), Stms (Wise rep))
-> SimpleM rep (Result, Stms (Wise rep), Stms (Wise rep))
forall rep a b.
SimplifiableRep rep =>
[(FParam (Wise rep), SubExp)]
-> LoopForm (Wise rep)
-> SimpleM rep (a, b, Stms (Wise rep))
-> SimpleM rep (a, b, Stms (Wise rep))
protectLoopHoisted [(Param (FParamInfo rep), SubExp)]
[(FParam (Wise rep), SubExp)]
merge' LoopForm (Wise rep)
form'
            (SimpleM rep (Result, Stms (Wise rep), Stms (Wise rep))
 -> SimpleM rep (Result, Stms (Wise rep), Stms (Wise rep)))
-> (SimpleM rep (Result, Stms (Wise rep), Stms (Wise rep))
    -> SimpleM rep (Result, Stms (Wise rep), Stms (Wise rep)))
-> SimpleM rep (Result, Stms (Wise rep), Stms (Wise rep))
-> SimpleM rep (Result, Stms (Wise rep), Stms (Wise rep))
forall b c a. (b -> c) -> (a -> b) -> a -> c
. [LParam (Wise rep)]
-> SimpleM rep (Result, Stms (Wise rep), Stms (Wise rep))
-> SimpleM rep (Result, Stms (Wise rep), Stms (Wise rep))
forall rep a.
SimplifiableRep rep =>
[LParam (Wise rep)] -> SimpleM rep a -> SimpleM rep a
bindArrayLParams [Param (LParamInfo rep)]
[LParam (Wise rep)]
loop_params'
        )
    WhileLoop VName
cond -> do
      VName
cond' <- VName -> SimpleM rep VName
forall rep. SimplifiableRep rep => VName -> SimpleM rep VName
forall e rep.
(Simplifiable e, SimplifiableRep rep) =>
e -> SimpleM rep e
simplify VName
cond
      (LoopForm (Wise rep), Names,
 SimpleM rep (Result, Stms (Wise rep), Stms (Wise rep))
 -> SimpleM rep (Result, Stms (Wise rep), Stms (Wise rep)))
-> SimpleM
     rep
     (LoopForm (Wise rep), Names,
      SimpleM rep (Result, Stms (Wise rep), Stms (Wise rep))
      -> SimpleM rep (Result, Stms (Wise rep), Stms (Wise rep)))
forall a. a -> SimpleM rep a
forall (f :: * -> *) a. Applicative f => a -> f a
pure
        ( VName -> LoopForm (Wise rep)
forall rep. VName -> LoopForm rep
WhileLoop VName
cond',
          Names
fparamnames,
          [(FParam (Wise rep), SubExp)]
-> LoopForm (Wise rep)
-> SimpleM rep (Result, Stms (Wise rep), Stms (Wise rep))
-> SimpleM rep (Result, Stms (Wise rep), Stms (Wise rep))
forall rep a b.
SimplifiableRep rep =>
[(FParam (Wise rep), SubExp)]
-> LoopForm (Wise rep)
-> SimpleM rep (a, b, Stms (Wise rep))
-> SimpleM rep (a, b, Stms (Wise rep))
protectLoopHoisted [(Param (FParamInfo rep), SubExp)]
[(FParam (Wise rep), SubExp)]
merge' (VName -> LoopForm (Wise rep)
forall rep. VName -> LoopForm rep
WhileLoop VName
cond')
        )
  BlockPred (Wise rep)
seq_blocker <- (Env rep -> BlockPred (Wise rep))
-> SimpleM rep (BlockPred (Wise rep))
forall rep a. (Env rep -> a) -> SimpleM rep a
asksEngineEnv ((Env rep -> BlockPred (Wise rep))
 -> SimpleM rep (BlockPred (Wise rep)))
-> (Env rep -> BlockPred (Wise rep))
-> SimpleM rep (BlockPred (Wise rep))
forall a b. (a -> b) -> a -> b
$ HoistBlockers rep -> BlockPred (Wise rep)
forall {k} (rep :: k). HoistBlockers rep -> BlockPred (Wise rep)
blockHoistSeq (HoistBlockers rep -> BlockPred (Wise rep))
-> (Env rep -> HoistBlockers rep)
-> Env rep
-> BlockPred (Wise rep)
forall b c a. (b -> c) -> (a -> b) -> a -> c
. Env rep -> HoistBlockers rep
forall {k} (rep :: k). Env rep -> HoistBlockers rep
envHoistBlockers
  (Result
loopres, Stms (Wise rep)
loopstms, Stms (Wise rep)
hoisted) <-
    SimpleM rep (Result, Stms (Wise rep), Stms (Wise rep))
-> SimpleM rep (Result, Stms (Wise rep), Stms (Wise rep))
forall rep a. SimpleM rep a -> SimpleM rep a
enterLoop (SimpleM rep (Result, Stms (Wise rep), Stms (Wise rep))
 -> SimpleM rep (Result, Stms (Wise rep), Stms (Wise rep)))
-> (SimpleM rep (Result, Stms (Wise rep), Stms (Wise rep))
    -> SimpleM rep (Result, Stms (Wise rep), Stms (Wise rep)))
-> SimpleM rep (Result, Stms (Wise rep), Stms (Wise rep))
-> SimpleM rep (Result, Stms (Wise rep), Stms (Wise rep))
forall b c a. (b -> c) -> (a -> b) -> a -> c
. SimpleM rep (Result, Stms (Wise rep), Stms (Wise rep))
-> SimpleM rep (Result, Stms (Wise rep), Stms (Wise rep))
consumeMerge
      (SimpleM rep (Result, Stms (Wise rep), Stms (Wise rep))
 -> SimpleM rep (Result, Stms (Wise rep), Stms (Wise rep)))
-> SimpleM rep (Result, Stms (Wise rep), Stms (Wise rep))
-> SimpleM rep (Result, Stms (Wise rep), Stms (Wise rep))
forall a b. (a -> b) -> a -> b
$ [(FParam (Wise rep), SubExp, SubExpRes)]
-> SimpleM rep (Result, Stms (Wise rep), Stms (Wise rep))
-> SimpleM rep (Result, Stms (Wise rep), Stms (Wise rep))
forall rep a.
SimplifiableRep rep =>
[(FParam (Wise rep), SubExp, SubExpRes)]
-> SimpleM rep a -> SimpleM rep a
bindMerge (((Param (FParamInfo rep), SubExp)
 -> SubExpRes -> (Param (FParamInfo rep), SubExp, SubExpRes))
-> [(Param (FParamInfo rep), SubExp)]
-> Result
-> [(Param (FParamInfo rep), SubExp, SubExpRes)]
forall a b c. (a -> b -> c) -> [a] -> [b] -> [c]
zipWith (Param (FParamInfo rep), SubExp)
-> SubExpRes -> (Param (FParamInfo rep), SubExp, SubExpRes)
forall {a} {b} {c}. (a, b) -> c -> (a, b, c)
withRes [(Param (FParamInfo rep), SubExp)]
merge' (Body (Wise rep) -> Result
forall rep. Body rep -> Result
bodyResult Body (Wise rep)
loopbody)) (SimpleM rep (Result, Stms (Wise rep), Stms (Wise rep))
 -> SimpleM rep (Result, Stms (Wise rep), Stms (Wise rep)))
-> (SimpleM rep (Result, Stms (Wise rep), Stms (Wise rep))
    -> SimpleM rep (Result, Stms (Wise rep), Stms (Wise rep)))
-> SimpleM rep (Result, Stms (Wise rep), Stms (Wise rep))
-> SimpleM rep (Result, Stms (Wise rep), Stms (Wise rep))
forall b c a. (b -> c) -> (a -> b) -> a -> c
. SimpleM rep (Result, Stms (Wise rep), Stms (Wise rep))
-> SimpleM rep (Result, Stms (Wise rep), Stms (Wise rep))
wrapbody
      (SimpleM rep (Result, Stms (Wise rep), Stms (Wise rep))
 -> SimpleM rep (Result, Stms (Wise rep), Stms (Wise rep)))
-> SimpleM rep (Result, Stms (Wise rep), Stms (Wise rep))
-> SimpleM rep (Result, Stms (Wise rep), Stms (Wise rep))
forall a b. (a -> b) -> a -> b
$ BlockPred (Wise rep)
-> Stms (Wise rep)
-> SimpleM rep (Result, UsageTable)
-> SimpleM rep (Result, Stms (Wise rep), Stms (Wise rep))
forall rep a.
SimplifiableRep rep =>
BlockPred (Wise rep)
-> Stms (Wise rep)
-> SimpleM rep (a, UsageTable)
-> SimpleM rep (a, Stms (Wise rep), Stms (Wise rep))
blockIf
        ( Names -> BlockPred (Wise rep)
forall rep. ASTRep rep => Names -> BlockPred rep
hasFree Names
boundnames
            BlockPred (Wise rep)
-> BlockPred (Wise rep) -> BlockPred (Wise rep)
forall rep. BlockPred rep -> BlockPred rep -> BlockPred rep
`orIf` BlockPred (Wise rep)
forall rep. BlockPred rep
isConsumed
            BlockPred (Wise rep)
-> BlockPred (Wise rep) -> BlockPred (Wise rep)
forall rep. BlockPred rep -> BlockPred rep -> BlockPred rep
`orIf` BlockPred (Wise rep)
seq_blocker
            BlockPred (Wise rep)
-> BlockPred (Wise rep) -> BlockPred (Wise rep)
forall rep. BlockPred rep -> BlockPred rep -> BlockPred rep
`orIf` BlockPred (Wise rep)
forall rep. ASTRep rep => BlockPred rep
notWorthHoisting
        )
        (Body (Wise rep) -> Stms (Wise rep)
forall rep. Body rep -> Stms rep
bodyStms Body (Wise rep)
loopbody)
      (SimpleM rep (Result, UsageTable)
 -> SimpleM rep (Result, Stms (Wise rep), Stms (Wise rep)))
-> SimpleM rep (Result, UsageTable)
-> SimpleM rep (Result, Stms (Wise rep), Stms (Wise rep))
forall a b. (a -> b) -> a -> b
$ do
        let params_usages :: [Usages]
params_usages =
              (Param (FParamInfo rep) -> Usages)
-> [Param (FParamInfo rep)] -> [Usages]
forall a b. (a -> b) -> [a] -> [b]
map
                (\Param (FParamInfo rep)
p -> if DeclType -> Bool
forall shape. TypeBase shape Uniqueness -> Bool
unique (Param (FParamInfo rep) -> DeclType
forall dec. DeclTyped dec => Param dec -> DeclType
paramDeclType Param (FParamInfo rep)
p) then Usages
UT.consumedU else Usages
forall a. Monoid a => a
mempty)
                [Param (FParamInfo rep)]
params'
        (Result
res, UsageTable
uses) <- [Usages] -> Result -> SimpleM rep (Result, UsageTable)
forall rep.
SimplifiableRep rep =>
[Usages] -> Result -> SimpleM rep (Result, UsageTable)
simplifyResult [Usages]
params_usages (Result -> SimpleM rep (Result, UsageTable))
-> Result -> SimpleM rep (Result, UsageTable)
forall a b. (a -> b) -> a -> b
$ Body (Wise rep) -> Result
forall rep. Body rep -> Result
bodyResult Body (Wise rep)
loopbody
        (Result, UsageTable) -> SimpleM rep (Result, UsageTable)
forall a. a -> SimpleM rep a
forall (f :: * -> *) a. Applicative f => a -> f a
pure (Result
res, UsageTable
uses UsageTable -> UsageTable -> UsageTable
forall a. Semigroup a => a -> a -> a
<> Result -> UsageTable
isDoLoopResult Result
res)
  Body (Wise rep)
loopbody' <- Stms (Wise rep) -> Result -> SimpleM rep (Body (Wise rep))
forall rep.
SimplifiableRep rep =>
Stms (Wise rep) -> Result -> SimpleM rep (Body (Wise rep))
constructBody Stms (Wise rep)
loopstms Result
loopres
  (Exp (Wise rep), Stms (Wise rep))
-> SimpleM rep (Exp (Wise rep), Stms (Wise rep))
forall a. a -> SimpleM rep a
forall (f :: * -> *) a. Applicative f => a -> f a
pure ([(FParam (Wise rep), SubExp)]
-> LoopForm (Wise rep) -> Body (Wise rep) -> Exp (Wise rep)
forall rep.
[(FParam rep, SubExp)] -> LoopForm rep -> Body rep -> Exp rep
DoLoop [(Param (FParamInfo rep), SubExp)]
[(FParam (Wise rep), SubExp)]
merge' LoopForm (Wise rep)
form' Body (Wise rep)
loopbody', Stms (Wise rep)
hoisted)
  where
    fparamnames :: Names
fparamnames =
      [VName] -> Names
namesFromList (((Param (FParamInfo rep), SubExp) -> VName)
-> [(Param (FParamInfo rep), SubExp)] -> [VName]
forall a b. (a -> b) -> [a] -> [b]
map (Param (FParamInfo rep) -> VName
forall dec. Param dec -> VName
paramName (Param (FParamInfo rep) -> VName)
-> ((Param (FParamInfo rep), SubExp) -> Param (FParamInfo rep))
-> (Param (FParamInfo rep), SubExp)
-> VName
forall b c a. (b -> c) -> (a -> b) -> a -> c
. (Param (FParamInfo rep), SubExp) -> Param (FParamInfo rep)
forall a b. (a, b) -> a
fst) [(Param (FParamInfo rep), SubExp)]
[(FParam (Wise rep), SubExp)]
merge)
    consumeMerge :: SimpleM rep (Result, Stms (Wise rep), Stms (Wise rep))
-> SimpleM rep (Result, Stms (Wise rep), Stms (Wise rep))
consumeMerge =
      (SymbolTable (Wise rep) -> SymbolTable (Wise rep))
-> SimpleM rep (Result, Stms (Wise rep), Stms (Wise rep))
-> SimpleM rep (Result, Stms (Wise rep), Stms (Wise rep))
forall rep a.
(SymbolTable (Wise rep) -> SymbolTable (Wise rep))
-> SimpleM rep a -> SimpleM rep a
localVtable ((SymbolTable (Wise rep) -> SymbolTable (Wise rep))
 -> SimpleM rep (Result, Stms (Wise rep), Stms (Wise rep))
 -> SimpleM rep (Result, Stms (Wise rep), Stms (Wise rep)))
-> (SymbolTable (Wise rep) -> SymbolTable (Wise rep))
-> SimpleM rep (Result, Stms (Wise rep), Stms (Wise rep))
-> SimpleM rep (Result, Stms (Wise rep), Stms (Wise rep))
forall a b. (a -> b) -> a -> b
$ (SymbolTable (Wise rep) -> [VName] -> SymbolTable (Wise rep))
-> [VName] -> SymbolTable (Wise rep) -> SymbolTable (Wise rep)
forall a b c. (a -> b -> c) -> b -> a -> c
flip ((SymbolTable (Wise rep) -> VName -> SymbolTable (Wise rep))
-> SymbolTable (Wise rep) -> [VName] -> SymbolTable (Wise rep)
forall b a. (b -> a -> b) -> b -> [a] -> b
forall (t :: * -> *) b a.
Foldable t =>
(b -> a -> b) -> b -> t a -> b
foldl' ((VName -> SymbolTable (Wise rep) -> SymbolTable (Wise rep))
-> SymbolTable (Wise rep) -> VName -> SymbolTable (Wise rep)
forall a b c. (a -> b -> c) -> b -> a -> c
flip VName -> SymbolTable (Wise rep) -> SymbolTable (Wise rep)
forall rep. VName -> SymbolTable rep -> SymbolTable rep
ST.consume)) ([VName] -> SymbolTable (Wise rep) -> SymbolTable (Wise rep))
-> [VName] -> SymbolTable (Wise rep) -> SymbolTable (Wise rep)
forall a b. (a -> b) -> a -> b
$ Names -> [VName]
namesToList Names
consumed_by_merge
    consumed_by_merge :: Names
consumed_by_merge =
      [SubExp] -> Names
forall a. FreeIn a => a -> Names
freeIn ([SubExp] -> Names) -> [SubExp] -> Names
forall a b. (a -> b) -> a -> b
$ ((Param (FParamInfo rep), SubExp) -> SubExp)
-> [(Param (FParamInfo rep), SubExp)] -> [SubExp]
forall a b. (a -> b) -> [a] -> [b]
map (Param (FParamInfo rep), SubExp) -> SubExp
forall a b. (a, b) -> b
snd ([(Param (FParamInfo rep), SubExp)] -> [SubExp])
-> [(Param (FParamInfo rep), SubExp)] -> [SubExp]
forall a b. (a -> b) -> a -> b
$ ((Param (FParamInfo rep), SubExp) -> Bool)
-> [(Param (FParamInfo rep), SubExp)]
-> [(Param (FParamInfo rep), SubExp)]
forall a. (a -> Bool) -> [a] -> [a]
filter (DeclType -> Bool
forall shape. TypeBase shape Uniqueness -> Bool
unique (DeclType -> Bool)
-> ((Param (FParamInfo rep), SubExp) -> DeclType)
-> (Param (FParamInfo rep), SubExp)
-> Bool
forall b c a. (b -> c) -> (a -> b) -> a -> c
. Param (FParamInfo rep) -> DeclType
forall dec. DeclTyped dec => Param dec -> DeclType
paramDeclType (Param (FParamInfo rep) -> DeclType)
-> ((Param (FParamInfo rep), SubExp) -> Param (FParamInfo rep))
-> (Param (FParamInfo rep), SubExp)
-> DeclType
forall b c a. (b -> c) -> (a -> b) -> a -> c
. (Param (FParamInfo rep), SubExp) -> Param (FParamInfo rep)
forall a b. (a, b) -> a
fst) [(Param (FParamInfo rep), SubExp)]
[(FParam (Wise rep), SubExp)]
merge
    withRes :: (a, b) -> c -> (a, b, c)
withRes (a
p, b
x) c
y = (a
p, b
x, c
y)
simplifyExp UsageTable
_ Pat (LetDec (Wise rep))
_ (Op Op (Wise rep)
op) = do
  (OpC rep (Wise rep)
op', Stms (Wise rep)
stms) <- Op (Wise rep) -> SimpleM rep (Op (Wise rep), Stms (Wise rep))
forall rep.
Op (Wise rep) -> SimpleM rep (Op (Wise rep), Stms (Wise rep))
simplifyOp Op (Wise rep)
op
  (Exp (Wise rep), Stms (Wise rep))
-> SimpleM rep (Exp (Wise rep), Stms (Wise rep))
forall a. a -> SimpleM rep a
forall (f :: * -> *) a. Applicative f => a -> f a
pure (Op (Wise rep) -> Exp (Wise rep)
forall rep. Op rep -> Exp rep
Op OpC rep (Wise rep)
Op (Wise rep)
op', Stms (Wise rep)
stms)
simplifyExp UsageTable
usage Pat (LetDec (Wise rep))
_ (WithAcc [WithAccInput (Wise rep)]
inputs Lambda (Wise rep)
lam) = do
  ([WithAccInput (Wise rep)]
inputs', [Stms (Wise rep)]
inputs_stms) <- ([(WithAccInput (Wise rep), Stms (Wise rep))]
 -> ([WithAccInput (Wise rep)], [Stms (Wise rep)]))
-> SimpleM rep [(WithAccInput (Wise rep), Stms (Wise rep))]
-> SimpleM rep ([WithAccInput (Wise rep)], [Stms (Wise rep)])
forall a b. (a -> b) -> SimpleM rep a -> SimpleM rep b
forall (f :: * -> *) a b. Functor f => (a -> b) -> f a -> f b
fmap [(WithAccInput (Wise rep), Stms (Wise rep))]
-> ([WithAccInput (Wise rep)], [Stms (Wise rep)])
forall a b. [(a, b)] -> ([a], [b])
unzip (SimpleM rep [(WithAccInput (Wise rep), Stms (Wise rep))]
 -> SimpleM rep ([WithAccInput (Wise rep)], [Stms (Wise rep)]))
-> ((WithAccInput (Wise rep)
     -> SimpleM rep (WithAccInput (Wise rep), Stms (Wise rep)))
    -> SimpleM rep [(WithAccInput (Wise rep), Stms (Wise rep))])
-> (WithAccInput (Wise rep)
    -> SimpleM rep (WithAccInput (Wise rep), Stms (Wise rep)))
-> SimpleM rep ([WithAccInput (Wise rep)], [Stms (Wise rep)])
forall b c a. (b -> c) -> (a -> b) -> a -> c
. [WithAccInput (Wise rep)]
-> (WithAccInput (Wise rep)
    -> SimpleM rep (WithAccInput (Wise rep), Stms (Wise rep)))
-> SimpleM rep [(WithAccInput (Wise rep), Stms (Wise rep))]
forall (t :: * -> *) (m :: * -> *) a b.
(Traversable t, Monad m) =>
t a -> (a -> m b) -> m (t b)
forM [WithAccInput (Wise rep)]
inputs ((WithAccInput (Wise rep)
  -> SimpleM rep (WithAccInput (Wise rep), Stms (Wise rep)))
 -> SimpleM rep ([WithAccInput (Wise rep)], [Stms (Wise rep)]))
-> (WithAccInput (Wise rep)
    -> SimpleM rep (WithAccInput (Wise rep), Stms (Wise rep)))
-> SimpleM rep ([WithAccInput (Wise rep)], [Stms (Wise rep)])
forall a b. (a -> b) -> a -> b
$ \(ShapeBase SubExp
shape, [VName]
arrs, Maybe (Lambda (Wise rep), [SubExp])
op) -> do
    (Maybe (Lambda (Wise rep), [SubExp])
op', Stms (Wise rep)
op_stms) <- case Maybe (Lambda (Wise rep), [SubExp])
op of
      Maybe (Lambda (Wise rep), [SubExp])
Nothing ->
        (Maybe (Lambda (Wise rep), [SubExp]), Stms (Wise rep))
-> SimpleM
     rep (Maybe (Lambda (Wise rep), [SubExp]), Stms (Wise rep))
forall a. a -> SimpleM rep a
forall (f :: * -> *) a. Applicative f => a -> f a
pure (Maybe (Lambda (Wise rep), [SubExp])
forall a. Maybe a
Nothing, Stms (Wise rep)
forall a. Monoid a => a
mempty)
      Just (Lambda (Wise rep)
op_lam, [SubExp]
nes) -> do
        (Lambda (Wise rep)
op_lam', Stms (Wise rep)
op_lam_stms) <- SimpleM rep (Lambda (Wise rep), Stms (Wise rep))
-> SimpleM rep (Lambda (Wise rep), Stms (Wise rep))
forall rep.
SimplifiableRep rep =>
SimpleM rep (Lambda (Wise rep), Stms (Wise rep))
-> SimpleM rep (Lambda (Wise rep), Stms (Wise rep))
blockMigrated (Names
-> Lambda (Wise rep)
-> SimpleM rep (Lambda (Wise rep), Stms (Wise rep))
forall rep.
SimplifiableRep rep =>
Names
-> Lambda (Wise rep)
-> SimpleM rep (Lambda (Wise rep), Stms (Wise rep))
simplifyLambda Names
forall a. Monoid a => a
mempty Lambda (Wise rep)
op_lam)
        [SubExp]
nes' <- [SubExp] -> SimpleM rep [SubExp]
forall rep. SimplifiableRep rep => [SubExp] -> SimpleM rep [SubExp]
forall e rep.
(Simplifiable e, SimplifiableRep rep) =>
e -> SimpleM rep e
simplify [SubExp]
nes
        (Maybe (Lambda (Wise rep), [SubExp]), Stms (Wise rep))
-> SimpleM
     rep (Maybe (Lambda (Wise rep), [SubExp]), Stms (Wise rep))
forall a. a -> SimpleM rep a
forall (f :: * -> *) a. Applicative f => a -> f a
pure ((Lambda (Wise rep), [SubExp])
-> Maybe (Lambda (Wise rep), [SubExp])
forall a. a -> Maybe a
Just (Lambda (Wise rep)
op_lam', [SubExp]
nes'), Stms (Wise rep)
op_lam_stms)
    (,Stms (Wise rep)
op_stms) (WithAccInput (Wise rep)
 -> (WithAccInput (Wise rep), Stms (Wise rep)))
-> SimpleM rep (WithAccInput (Wise rep))
-> SimpleM rep (WithAccInput (Wise rep), Stms (Wise rep))
forall (f :: * -> *) a b. Functor f => (a -> b) -> f a -> f b
<$> ((,,Maybe (Lambda (Wise rep), [SubExp])
op') (ShapeBase SubExp -> [VName] -> WithAccInput (Wise rep))
-> SimpleM rep (ShapeBase SubExp)
-> SimpleM rep ([VName] -> WithAccInput (Wise rep))
forall (f :: * -> *) a b. Functor f => (a -> b) -> f a -> f b
<$> ShapeBase SubExp -> SimpleM rep (ShapeBase SubExp)
forall rep.
SimplifiableRep rep =>
ShapeBase SubExp -> SimpleM rep (ShapeBase SubExp)
forall e rep.
(Simplifiable e, SimplifiableRep rep) =>
e -> SimpleM rep e
simplify ShapeBase SubExp
shape SimpleM rep ([VName] -> WithAccInput (Wise rep))
-> SimpleM rep [VName] -> SimpleM rep (WithAccInput (Wise rep))
forall a b. SimpleM rep (a -> b) -> SimpleM rep a -> SimpleM rep b
forall (f :: * -> *) a b. Applicative f => f (a -> b) -> f a -> f b
<*> [VName] -> SimpleM rep [VName]
forall rep. SimplifiableRep rep => [VName] -> SimpleM rep [VName]
forall e rep.
(Simplifiable e, SimplifiableRep rep) =>
e -> SimpleM rep e
simplify [VName]
arrs)
  let noteAcc :: SymbolTable (Wise rep) -> SymbolTable (Wise rep)
noteAcc = [(VName, WithAccInput (Wise rep))]
-> SymbolTable (Wise rep) -> SymbolTable (Wise rep)
forall rep.
[(VName, WithAccInput rep)] -> SymbolTable rep -> SymbolTable rep
ST.noteAccTokens ([VName]
-> [WithAccInput (Wise rep)] -> [(VName, WithAccInput (Wise rep))]
forall a b. [a] -> [b] -> [(a, b)]
zip ((Param (LParamInfo rep) -> VName)
-> [Param (LParamInfo rep)] -> [VName]
forall a b. (a -> b) -> [a] -> [b]
map Param (LParamInfo rep) -> VName
forall dec. Param dec -> VName
paramName (Lambda (Wise rep) -> [LParam (Wise rep)]
forall rep. Lambda rep -> [LParam rep]
lambdaParams Lambda (Wise rep)
lam)) [WithAccInput (Wise rep)]
inputs')
  (Lambda (Wise rep)
lam', Stms (Wise rep)
lam_stms) <- (SymbolTable (Wise rep) -> SymbolTable (Wise rep))
-> BlockPred (Wise rep)
-> UsageTable
-> Lambda (Wise rep)
-> SimpleM rep (Lambda (Wise rep), Stms (Wise rep))
forall rep.
SimplifiableRep rep =>
(SymbolTable (Wise rep) -> SymbolTable (Wise rep))
-> BlockPred (Wise rep)
-> UsageTable
-> Lambda (Wise rep)
-> SimpleM rep (Lambda (Wise rep), Stms (Wise rep))
simplifyLambdaWith SymbolTable (Wise rep) -> SymbolTable (Wise rep)
noteAcc (Bool -> BlockPred (Wise rep)
forall rep. Bool -> BlockPred rep
isFalse Bool
True) UsageTable
usage Lambda (Wise rep)
lam
  (Exp (Wise rep), Stms (Wise rep))
-> SimpleM rep (Exp (Wise rep), Stms (Wise rep))
forall a. a -> SimpleM rep a
forall (f :: * -> *) a. Applicative f => a -> f a
pure ([WithAccInput (Wise rep)] -> Lambda (Wise rep) -> Exp (Wise rep)
forall rep. [WithAccInput rep] -> Lambda rep -> Exp rep
WithAcc [WithAccInput (Wise rep)]
inputs' Lambda (Wise rep)
lam', [Stms (Wise rep)] -> Stms (Wise rep)
forall a. Monoid a => [a] -> a
mconcat [Stms (Wise rep)]
inputs_stms Stms (Wise rep) -> Stms (Wise rep) -> Stms (Wise rep)
forall a. Semigroup a => a -> a -> a
<> Stms (Wise rep)
lam_stms)
simplifyExp UsageTable
_ Pat (LetDec (Wise rep))
_ Exp (Wise rep)
e = do
  Exp (Wise rep)
e' <- Exp (Wise rep) -> SimpleM rep (Exp (Wise rep))
forall rep.
SimplifiableRep rep =>
Exp (Wise rep) -> SimpleM rep (Exp (Wise rep))
simplifyExpBase Exp (Wise rep)
e
  (Exp (Wise rep), Stms (Wise rep))
-> SimpleM rep (Exp (Wise rep), Stms (Wise rep))
forall a. a -> SimpleM rep a
forall (f :: * -> *) a. Applicative f => a -> f a
pure (Exp (Wise rep)
e', Stms (Wise rep)
forall a. Monoid a => a
mempty)

-- | Block hoisting of 'Index' statements introduced by migration.
blockMigrated ::
  SimplifiableRep rep =>
  SimpleM rep (Lambda (Wise rep), Stms (Wise rep)) ->
  SimpleM rep (Lambda (Wise rep), Stms (Wise rep))
blockMigrated :: forall rep.
SimplifiableRep rep =>
SimpleM rep (Lambda (Wise rep), Stms (Wise rep))
-> SimpleM rep (Lambda (Wise rep), Stms (Wise rep))
blockMigrated = ((SimpleOps rep, Env rep) -> (SimpleOps rep, Env rep))
-> SimpleM rep (Lambda (Wise rep), Stms (Wise rep))
-> SimpleM rep (Lambda (Wise rep), Stms (Wise rep))
forall a.
((SimpleOps rep, Env rep) -> (SimpleOps rep, Env rep))
-> SimpleM rep a -> SimpleM rep a
forall r (m :: * -> *) a. MonadReader r m => (r -> r) -> m a -> m a
local (SimpleOps rep, Env rep) -> (SimpleOps rep, Env rep)
forall {rep} {a}.
(ASTRep rep, Simplifiable (LetDec rep),
 Simplifiable (FParamInfo rep), Simplifiable (LParamInfo rep),
 Simplifiable (RetType rep), Simplifiable (BranchType rep),
 TraverseOpStms (Wise rep), CanBeWise (OpC rep),
 IndexOp (OpC rep (Wise rep)), AliasedOp (OpC rep (Wise rep)),
 BuilderOps (Wise rep)) =>
(a, Env rep) -> (a, Env rep)
withMigrationBlocker
  where
    withMigrationBlocker :: (a, Env rep) -> (a, Env rep)
withMigrationBlocker (a
ops, Env rep
env) =
      let blockers :: HoistBlockers rep
blockers = Env rep -> HoistBlockers rep
forall {k} (rep :: k). Env rep -> HoistBlockers rep
envHoistBlockers Env rep
env
          par_blocker :: BlockPred (Wise rep)
par_blocker = HoistBlockers rep -> BlockPred (Wise rep)
forall {k} (rep :: k). HoistBlockers rep -> BlockPred (Wise rep)
blockHoistPar HoistBlockers rep
blockers

          blocker :: BlockPred (Wise rep)
blocker = BlockPred (Wise rep)
par_blocker BlockPred (Wise rep)
-> BlockPred (Wise rep) -> BlockPred (Wise rep)
forall rep. BlockPred rep -> BlockPred rep -> BlockPred rep
`orIf` BlockPred (Wise rep)
forall rep. SimplifiableRep rep => BlockPred (Wise rep)
isDeviceMigrated

          blockers' :: HoistBlockers rep
blockers' = HoistBlockers rep
blockers {blockHoistPar :: BlockPred (Wise rep)
blockHoistPar = BlockPred (Wise rep)
blocker}
          env' :: Env rep
env' = Env rep
env {envHoistBlockers :: HoistBlockers rep
envHoistBlockers = HoistBlockers rep
blockers'}
       in (a
ops, Env rep
env')

-- | Statement is a scalar read from a single element array of rank one.
isDeviceMigrated :: SimplifiableRep rep => BlockPred (Wise rep)
isDeviceMigrated :: forall rep. SimplifiableRep rep => BlockPred (Wise rep)
isDeviceMigrated SymbolTable (Wise rep)
vtable UsageTable
_ Stm (Wise rep)
stm
  | BasicOp (Index VName
arr Slice SubExp
slice) <- Stm (Wise rep) -> Exp (Wise rep)
forall rep. Stm rep -> Exp rep
stmExp Stm (Wise rep)
stm,
    [DimFix SubExp
idx] <- Slice SubExp -> [DimIndex SubExp]
forall d. Slice d -> [DimIndex d]
unSlice Slice SubExp
slice,
    SubExp
idx SubExp -> SubExp -> Bool
forall a. Eq a => a -> a -> Bool
== IntType -> Integer -> SubExp
intConst IntType
Int64 Integer
0,
    Just Type
arr_t <- VName -> SymbolTable (Wise rep) -> Maybe Type
forall rep. ASTRep rep => VName -> SymbolTable rep -> Maybe Type
ST.lookupType VName
arr SymbolTable (Wise rep)
vtable,
    [SubExp
size] <- Type -> [SubExp]
forall u. TypeBase (ShapeBase SubExp) u -> [SubExp]
arrayDims Type
arr_t,
    SubExp
size SubExp -> SubExp -> Bool
forall a. Eq a => a -> a -> Bool
== IntType -> Integer -> SubExp
intConst IntType
Int64 Integer
1 =
      Bool
True
  | Bool
otherwise =
      Bool
False

-- The simple nonrecursive case that we can perform without bottom-up
-- information.
simplifyExpBase :: SimplifiableRep rep => Exp (Wise rep) -> SimpleM rep (Exp (Wise rep))
-- Special case for simplification of commutative BinOps where we
-- arrange the operands in sorted order.  This can make expressions
-- more identical, which helps CSE.
simplifyExpBase :: forall rep.
SimplifiableRep rep =>
Exp (Wise rep) -> SimpleM rep (Exp (Wise rep))
simplifyExpBase (BasicOp (BinOp BinOp
op SubExp
x SubExp
y))
  | BinOp -> Bool
commutativeBinOp BinOp
op = do
      SubExp
x' <- SubExp -> SimpleM rep SubExp
forall rep. SimplifiableRep rep => SubExp -> SimpleM rep SubExp
forall e rep.
(Simplifiable e, SimplifiableRep rep) =>
e -> SimpleM rep e
simplify SubExp
x
      SubExp
y' <- SubExp -> SimpleM rep SubExp
forall rep. SimplifiableRep rep => SubExp -> SimpleM rep SubExp
forall e rep.
(Simplifiable e, SimplifiableRep rep) =>
e -> SimpleM rep e
simplify SubExp
y
      Exp (Wise rep) -> SimpleM rep (Exp (Wise rep))
forall a. a -> SimpleM rep a
forall (f :: * -> *) a. Applicative f => a -> f a
pure (Exp (Wise rep) -> SimpleM rep (Exp (Wise rep)))
-> Exp (Wise rep) -> SimpleM rep (Exp (Wise rep))
forall a b. (a -> b) -> a -> b
$ BasicOp -> Exp (Wise rep)
forall rep. BasicOp -> Exp rep
BasicOp (BasicOp -> Exp (Wise rep)) -> BasicOp -> Exp (Wise rep)
forall a b. (a -> b) -> a -> b
$ BinOp -> SubExp -> SubExp -> BasicOp
BinOp BinOp
op (SubExp -> SubExp -> SubExp
forall a. Ord a => a -> a -> a
min SubExp
x' SubExp
y') (SubExp -> SubExp -> SubExp
forall a. Ord a => a -> a -> a
max SubExp
x' SubExp
y')
simplifyExpBase Exp (Wise rep)
e = Mapper (Wise rep) (Wise rep) (SimpleM rep)
-> Exp (Wise rep) -> SimpleM rep (Exp (Wise rep))
forall (m :: * -> *) frep trep.
Monad m =>
Mapper frep trep m -> Exp frep -> m (Exp trep)
mapExpM Mapper (Wise rep) (Wise rep) (SimpleM rep)
hoist Exp (Wise rep)
e
  where
    hoist :: Mapper (Wise rep) (Wise rep) (SimpleM rep)
hoist =
      Mapper (Wise rep) (Wise rep) (SimpleM rep)
forall rep (m :: * -> *). Monad m => Mapper rep rep m
identityMapper
        { mapOnSubExp :: SubExp -> SimpleM rep SubExp
mapOnSubExp = SubExp -> SimpleM rep SubExp
forall rep. SimplifiableRep rep => SubExp -> SimpleM rep SubExp
forall e rep.
(Simplifiable e, SimplifiableRep rep) =>
e -> SimpleM rep e
simplify,
          mapOnVName :: VName -> SimpleM rep VName
mapOnVName = VName -> SimpleM rep VName
forall rep. SimplifiableRep rep => VName -> SimpleM rep VName
forall e rep.
(Simplifiable e, SimplifiableRep rep) =>
e -> SimpleM rep e
simplify,
          mapOnRetType :: RetType (Wise rep) -> SimpleM rep (RetType (Wise rep))
mapOnRetType = RetType (Wise rep) -> SimpleM rep (RetType (Wise rep))
forall rep.
SimplifiableRep rep =>
RetType (Wise rep) -> SimpleM rep (RetType (Wise rep))
forall e rep.
(Simplifiable e, SimplifiableRep rep) =>
e -> SimpleM rep e
simplify,
          mapOnBranchType :: BranchType (Wise rep) -> SimpleM rep (BranchType (Wise rep))
mapOnBranchType = BranchType (Wise rep) -> SimpleM rep (BranchType (Wise rep))
forall rep.
SimplifiableRep rep =>
BranchType (Wise rep) -> SimpleM rep (BranchType (Wise rep))
forall e rep.
(Simplifiable e, SimplifiableRep rep) =>
e -> SimpleM rep e
simplify
        }

type SimplifiableRep rep =
  ( ASTRep rep,
    Simplifiable (LetDec rep),
    Simplifiable (FParamInfo rep),
    Simplifiable (LParamInfo rep),
    Simplifiable (RetType rep),
    Simplifiable (BranchType rep),
    TraverseOpStms (Wise rep),
    CanBeWise (OpC rep),
    ST.IndexOp (Op (Wise rep)),
    AliasedOp (Op (Wise rep)),
    RephraseOp (OpC rep),
    BuilderOps (Wise rep),
    IsOp (Op rep)
  )

class Simplifiable e where
  simplify :: SimplifiableRep rep => e -> SimpleM rep e

instance (Simplifiable a, Simplifiable b) => Simplifiable (a, b) where
  simplify :: forall rep. SimplifiableRep rep => (a, b) -> SimpleM rep (a, b)
simplify (a
x, b
y) = (,) (a -> b -> (a, b)) -> SimpleM rep a -> SimpleM rep (b -> (a, b))
forall (f :: * -> *) a b. Functor f => (a -> b) -> f a -> f b
<$> a -> SimpleM rep a
forall rep. SimplifiableRep rep => a -> SimpleM rep a
forall e rep.
(Simplifiable e, SimplifiableRep rep) =>
e -> SimpleM rep e
simplify a
x SimpleM rep (b -> (a, b)) -> SimpleM rep b -> SimpleM rep (a, b)
forall a b. SimpleM rep (a -> b) -> SimpleM rep a -> SimpleM rep b
forall (f :: * -> *) a b. Applicative f => f (a -> b) -> f a -> f b
<*> b -> SimpleM rep b
forall rep. SimplifiableRep rep => b -> SimpleM rep b
forall e rep.
(Simplifiable e, SimplifiableRep rep) =>
e -> SimpleM rep e
simplify b
y

instance
  (Simplifiable a, Simplifiable b, Simplifiable c) =>
  Simplifiable (a, b, c)
  where
  simplify :: forall rep.
SimplifiableRep rep =>
(a, b, c) -> SimpleM rep (a, b, c)
simplify (a
x, b
y, c
z) = (,,) (a -> b -> c -> (a, b, c))
-> SimpleM rep a -> SimpleM rep (b -> c -> (a, b, c))
forall (f :: * -> *) a b. Functor f => (a -> b) -> f a -> f b
<$> a -> SimpleM rep a
forall rep. SimplifiableRep rep => a -> SimpleM rep a
forall e rep.
(Simplifiable e, SimplifiableRep rep) =>
e -> SimpleM rep e
simplify a
x SimpleM rep (b -> c -> (a, b, c))
-> SimpleM rep b -> SimpleM rep (c -> (a, b, c))
forall a b. SimpleM rep (a -> b) -> SimpleM rep a -> SimpleM rep b
forall (f :: * -> *) a b. Applicative f => f (a -> b) -> f a -> f b
<*> b -> SimpleM rep b
forall rep. SimplifiableRep rep => b -> SimpleM rep b
forall e rep.
(Simplifiable e, SimplifiableRep rep) =>
e -> SimpleM rep e
simplify b
y SimpleM rep (c -> (a, b, c))
-> SimpleM rep c -> SimpleM rep (a, b, c)
forall a b. SimpleM rep (a -> b) -> SimpleM rep a -> SimpleM rep b
forall (f :: * -> *) a b. Applicative f => f (a -> b) -> f a -> f b
<*> c -> SimpleM rep c
forall rep. SimplifiableRep rep => c -> SimpleM rep c
forall e rep.
(Simplifiable e, SimplifiableRep rep) =>
e -> SimpleM rep e
simplify c
z

-- Convenient for Scatter.
instance Simplifiable Int where
  simplify :: forall rep. SimplifiableRep rep => Int -> SimpleM rep Int
simplify = Int -> SimpleM rep Int
forall a. a -> SimpleM rep a
forall (f :: * -> *) a. Applicative f => a -> f a
pure

instance Simplifiable a => Simplifiable (Maybe a) where
  simplify :: forall rep. SimplifiableRep rep => Maybe a -> SimpleM rep (Maybe a)
simplify Maybe a
Nothing = Maybe a -> SimpleM rep (Maybe a)
forall a. a -> SimpleM rep a
forall (f :: * -> *) a. Applicative f => a -> f a
pure Maybe a
forall a. Maybe a
Nothing
  simplify (Just a
x) = a -> Maybe a
forall a. a -> Maybe a
Just (a -> Maybe a) -> SimpleM rep a -> SimpleM rep (Maybe a)
forall (f :: * -> *) a b. Functor f => (a -> b) -> f a -> f b
<$> a -> SimpleM rep a
forall rep. SimplifiableRep rep => a -> SimpleM rep a
forall e rep.
(Simplifiable e, SimplifiableRep rep) =>
e -> SimpleM rep e
simplify a
x

instance Simplifiable a => Simplifiable [a] where
  simplify :: forall rep. SimplifiableRep rep => [a] -> SimpleM rep [a]
simplify = (a -> SimpleM rep a) -> [a] -> SimpleM rep [a]
forall (t :: * -> *) (m :: * -> *) a b.
(Traversable t, Monad m) =>
(a -> m b) -> t a -> m (t b)
forall (m :: * -> *) a b. Monad m => (a -> m b) -> [a] -> m [b]
mapM a -> SimpleM rep a
forall rep. SimplifiableRep rep => a -> SimpleM rep a
forall e rep.
(Simplifiable e, SimplifiableRep rep) =>
e -> SimpleM rep e
simplify

instance Simplifiable SubExp where
  simplify :: forall rep. SimplifiableRep rep => SubExp -> SimpleM rep SubExp
simplify (Var VName
name) = do
    Maybe (SubExp, Certs)
stm <- VName -> SymbolTable (Wise rep) -> Maybe (SubExp, Certs)
forall rep. VName -> SymbolTable rep -> Maybe (SubExp, Certs)
ST.lookupSubExp VName
name (SymbolTable (Wise rep) -> Maybe (SubExp, Certs))
-> SimpleM rep (SymbolTable (Wise rep))
-> SimpleM rep (Maybe (SubExp, Certs))
forall (f :: * -> *) a b. Functor f => (a -> b) -> f a -> f b
<$> SimpleM rep (SymbolTable (Wise rep))
forall rep. SimpleM rep (SymbolTable (Wise rep))
askVtable
    case Maybe (SubExp, Certs)
stm of
      Just (Constant PrimValue
v, Certs
cs) -> do
        SimpleM rep ()
forall rep. SimpleM rep ()
changed
        Certs -> SimpleM rep ()
forall rep. Certs -> SimpleM rep ()
usedCerts Certs
cs
        SubExp -> SimpleM rep SubExp
forall a. a -> SimpleM rep a
forall (f :: * -> *) a. Applicative f => a -> f a
pure (SubExp -> SimpleM rep SubExp) -> SubExp -> SimpleM rep SubExp
forall a b. (a -> b) -> a -> b
$ PrimValue -> SubExp
Constant PrimValue
v
      Just (Var VName
id', Certs
cs) -> do
        SimpleM rep ()
forall rep. SimpleM rep ()
changed
        Certs -> SimpleM rep ()
forall rep. Certs -> SimpleM rep ()
usedCerts Certs
cs
        SubExp -> SimpleM rep SubExp
forall a. a -> SimpleM rep a
forall (f :: * -> *) a. Applicative f => a -> f a
pure (SubExp -> SimpleM rep SubExp) -> SubExp -> SimpleM rep SubExp
forall a b. (a -> b) -> a -> b
$ VName -> SubExp
Var VName
id'
      Maybe (SubExp, Certs)
_ -> SubExp -> SimpleM rep SubExp
forall a. a -> SimpleM rep a
forall (f :: * -> *) a. Applicative f => a -> f a
pure (SubExp -> SimpleM rep SubExp) -> SubExp -> SimpleM rep SubExp
forall a b. (a -> b) -> a -> b
$ VName -> SubExp
Var VName
name
  simplify (Constant PrimValue
v) =
    SubExp -> SimpleM rep SubExp
forall a. a -> SimpleM rep a
forall (f :: * -> *) a. Applicative f => a -> f a
pure (SubExp -> SimpleM rep SubExp) -> SubExp -> SimpleM rep SubExp
forall a b. (a -> b) -> a -> b
$ PrimValue -> SubExp
Constant PrimValue
v

instance Simplifiable SubExpRes where
  simplify :: forall rep.
SimplifiableRep rep =>
SubExpRes -> SimpleM rep SubExpRes
simplify (SubExpRes Certs
cs SubExp
se) = do
    Certs
cs' <- Certs -> SimpleM rep Certs
forall rep. SimplifiableRep rep => Certs -> SimpleM rep Certs
forall e rep.
(Simplifiable e, SimplifiableRep rep) =>
e -> SimpleM rep e
simplify Certs
cs
    (SubExp
se', Certs
se_cs) <- SimpleM rep SubExp -> SimpleM rep (SubExp, Certs)
forall rep a. SimpleM rep a -> SimpleM rep (a, Certs)
collectCerts (SimpleM rep SubExp -> SimpleM rep (SubExp, Certs))
-> SimpleM rep SubExp -> SimpleM rep (SubExp, Certs)
forall a b. (a -> b) -> a -> b
$ SubExp -> SimpleM rep SubExp
forall rep. SimplifiableRep rep => SubExp -> SimpleM rep SubExp
forall e rep.
(Simplifiable e, SimplifiableRep rep) =>
e -> SimpleM rep e
simplify SubExp
se
    SubExpRes -> SimpleM rep SubExpRes
forall a. a -> SimpleM rep a
forall (f :: * -> *) a. Applicative f => a -> f a
pure (SubExpRes -> SimpleM rep SubExpRes)
-> SubExpRes -> SimpleM rep SubExpRes
forall a b. (a -> b) -> a -> b
$ Certs -> SubExp -> SubExpRes
SubExpRes (Certs
se_cs Certs -> Certs -> Certs
forall a. Semigroup a => a -> a -> a
<> Certs
cs') SubExp
se'

instance Simplifiable () where
  simplify :: forall rep. SimplifiableRep rep => () -> SimpleM rep ()
simplify = () -> SimpleM rep ()
forall a. a -> SimpleM rep a
forall (f :: * -> *) a. Applicative f => a -> f a
pure

instance Simplifiable VName where
  simplify :: forall rep. SimplifiableRep rep => VName -> SimpleM rep VName
simplify VName
v = do
    Maybe (SubExp, Certs)
se <- VName -> SymbolTable (Wise rep) -> Maybe (SubExp, Certs)
forall rep. VName -> SymbolTable rep -> Maybe (SubExp, Certs)
ST.lookupSubExp VName
v (SymbolTable (Wise rep) -> Maybe (SubExp, Certs))
-> SimpleM rep (SymbolTable (Wise rep))
-> SimpleM rep (Maybe (SubExp, Certs))
forall (f :: * -> *) a b. Functor f => (a -> b) -> f a -> f b
<$> SimpleM rep (SymbolTable (Wise rep))
forall rep. SimpleM rep (SymbolTable (Wise rep))
askVtable
    case Maybe (SubExp, Certs)
se of
      Just (Var VName
v', Certs
cs) -> do
        SimpleM rep ()
forall rep. SimpleM rep ()
changed
        Certs -> SimpleM rep ()
forall rep. Certs -> SimpleM rep ()
usedCerts Certs
cs
        VName -> SimpleM rep VName
forall a. a -> SimpleM rep a
forall (f :: * -> *) a. Applicative f => a -> f a
pure VName
v'
      Maybe (SubExp, Certs)
_ -> VName -> SimpleM rep VName
forall a. a -> SimpleM rep a
forall (f :: * -> *) a. Applicative f => a -> f a
pure VName
v

instance Simplifiable d => Simplifiable (ShapeBase d) where
  simplify :: forall rep.
SimplifiableRep rep =>
ShapeBase d -> SimpleM rep (ShapeBase d)
simplify = ([d] -> ShapeBase d)
-> SimpleM rep [d] -> SimpleM rep (ShapeBase d)
forall a b. (a -> b) -> SimpleM rep a -> SimpleM rep b
forall (f :: * -> *) a b. Functor f => (a -> b) -> f a -> f b
fmap [d] -> ShapeBase d
forall d. [d] -> ShapeBase d
Shape (SimpleM rep [d] -> SimpleM rep (ShapeBase d))
-> (ShapeBase d -> SimpleM rep [d])
-> ShapeBase d
-> SimpleM rep (ShapeBase d)
forall b c a. (b -> c) -> (a -> b) -> a -> c
. [d] -> SimpleM rep [d]
forall rep. SimplifiableRep rep => [d] -> SimpleM rep [d]
forall e rep.
(Simplifiable e, SimplifiableRep rep) =>
e -> SimpleM rep e
simplify ([d] -> SimpleM rep [d])
-> (ShapeBase d -> [d]) -> ShapeBase d -> SimpleM rep [d]
forall b c a. (b -> c) -> (a -> b) -> a -> c
. ShapeBase d -> [d]
forall d. ShapeBase d -> [d]
shapeDims

instance Simplifiable ExtSize where
  simplify :: forall rep. SimplifiableRep rep => ExtSize -> SimpleM rep ExtSize
simplify (Free SubExp
se) = SubExp -> ExtSize
forall a. a -> Ext a
Free (SubExp -> ExtSize) -> SimpleM rep SubExp -> SimpleM rep ExtSize
forall (f :: * -> *) a b. Functor f => (a -> b) -> f a -> f b
<$> SubExp -> SimpleM rep SubExp
forall rep. SimplifiableRep rep => SubExp -> SimpleM rep SubExp
forall e rep.
(Simplifiable e, SimplifiableRep rep) =>
e -> SimpleM rep e
simplify SubExp
se
  simplify (Ext Int
x) = ExtSize -> SimpleM rep ExtSize
forall a. a -> SimpleM rep a
forall (f :: * -> *) a. Applicative f => a -> f a
pure (ExtSize -> SimpleM rep ExtSize) -> ExtSize -> SimpleM rep ExtSize
forall a b. (a -> b) -> a -> b
$ Int -> ExtSize
forall a. Int -> Ext a
Ext Int
x

instance Simplifiable Space where
  simplify :: forall rep. SimplifiableRep rep => Space -> SimpleM rep Space
simplify (ScalarSpace [SubExp]
ds PrimType
t) = [SubExp] -> PrimType -> Space
ScalarSpace ([SubExp] -> PrimType -> Space)
-> SimpleM rep [SubExp] -> SimpleM rep (PrimType -> Space)
forall (f :: * -> *) a b. Functor f => (a -> b) -> f a -> f b
<$> [SubExp] -> SimpleM rep [SubExp]
forall rep. SimplifiableRep rep => [SubExp] -> SimpleM rep [SubExp]
forall e rep.
(Simplifiable e, SimplifiableRep rep) =>
e -> SimpleM rep e
simplify [SubExp]
ds SimpleM rep (PrimType -> Space)
-> SimpleM rep PrimType -> SimpleM rep Space
forall a b. SimpleM rep (a -> b) -> SimpleM rep a -> SimpleM rep b
forall (f :: * -> *) a b. Applicative f => f (a -> b) -> f a -> f b
<*> PrimType -> SimpleM rep PrimType
forall a. a -> SimpleM rep a
forall (f :: * -> *) a. Applicative f => a -> f a
pure PrimType
t
  simplify Space
s = Space -> SimpleM rep Space
forall a. a -> SimpleM rep a
forall (f :: * -> *) a. Applicative f => a -> f a
pure Space
s

instance Simplifiable PrimType where
  simplify :: forall rep. SimplifiableRep rep => PrimType -> SimpleM rep PrimType
simplify = PrimType -> SimpleM rep PrimType
forall a. a -> SimpleM rep a
forall (f :: * -> *) a. Applicative f => a -> f a
pure

instance Simplifiable shape => Simplifiable (TypeBase shape u) where
  simplify :: forall rep.
SimplifiableRep rep =>
TypeBase shape u -> SimpleM rep (TypeBase shape u)
simplify (Array PrimType
et shape
shape u
u) =
    PrimType -> shape -> u -> TypeBase shape u
forall shape u. PrimType -> shape -> u -> TypeBase shape u
Array (PrimType -> shape -> u -> TypeBase shape u)
-> SimpleM rep PrimType
-> SimpleM rep (shape -> u -> TypeBase shape u)
forall (f :: * -> *) a b. Functor f => (a -> b) -> f a -> f b
<$> PrimType -> SimpleM rep PrimType
forall rep. SimplifiableRep rep => PrimType -> SimpleM rep PrimType
forall e rep.
(Simplifiable e, SimplifiableRep rep) =>
e -> SimpleM rep e
simplify PrimType
et SimpleM rep (shape -> u -> TypeBase shape u)
-> SimpleM rep shape -> SimpleM rep (u -> TypeBase shape u)
forall a b. SimpleM rep (a -> b) -> SimpleM rep a -> SimpleM rep b
forall (f :: * -> *) a b. Applicative f => f (a -> b) -> f a -> f b
<*> shape -> SimpleM rep shape
forall rep. SimplifiableRep rep => shape -> SimpleM rep shape
forall e rep.
(Simplifiable e, SimplifiableRep rep) =>
e -> SimpleM rep e
simplify shape
shape SimpleM rep (u -> TypeBase shape u)
-> SimpleM rep u -> SimpleM rep (TypeBase shape u)
forall a b. SimpleM rep (a -> b) -> SimpleM rep a -> SimpleM rep b
forall (f :: * -> *) a b. Applicative f => f (a -> b) -> f a -> f b
<*> u -> SimpleM rep u
forall a. a -> SimpleM rep a
forall (f :: * -> *) a. Applicative f => a -> f a
pure u
u
  simplify (Acc VName
acc ShapeBase SubExp
ispace [Type]
ts u
u) =
    VName -> ShapeBase SubExp -> [Type] -> u -> TypeBase shape u
forall shape u.
VName -> ShapeBase SubExp -> [Type] -> u -> TypeBase shape u
Acc (VName -> ShapeBase SubExp -> [Type] -> u -> TypeBase shape u)
-> SimpleM rep VName
-> SimpleM
     rep (ShapeBase SubExp -> [Type] -> u -> TypeBase shape u)
forall (f :: * -> *) a b. Functor f => (a -> b) -> f a -> f b
<$> VName -> SimpleM rep VName
forall rep. SimplifiableRep rep => VName -> SimpleM rep VName
forall e rep.
(Simplifiable e, SimplifiableRep rep) =>
e -> SimpleM rep e
simplify VName
acc SimpleM rep (ShapeBase SubExp -> [Type] -> u -> TypeBase shape u)
-> SimpleM rep (ShapeBase SubExp)
-> SimpleM rep ([Type] -> u -> TypeBase shape u)
forall a b. SimpleM rep (a -> b) -> SimpleM rep a -> SimpleM rep b
forall (f :: * -> *) a b. Applicative f => f (a -> b) -> f a -> f b
<*> ShapeBase SubExp -> SimpleM rep (ShapeBase SubExp)
forall rep.
SimplifiableRep rep =>
ShapeBase SubExp -> SimpleM rep (ShapeBase SubExp)
forall e rep.
(Simplifiable e, SimplifiableRep rep) =>
e -> SimpleM rep e
simplify ShapeBase SubExp
ispace SimpleM rep ([Type] -> u -> TypeBase shape u)
-> SimpleM rep [Type] -> SimpleM rep (u -> TypeBase shape u)
forall a b. SimpleM rep (a -> b) -> SimpleM rep a -> SimpleM rep b
forall (f :: * -> *) a b. Applicative f => f (a -> b) -> f a -> f b
<*> [Type] -> SimpleM rep [Type]
forall rep. SimplifiableRep rep => [Type] -> SimpleM rep [Type]
forall e rep.
(Simplifiable e, SimplifiableRep rep) =>
e -> SimpleM rep e
simplify [Type]
ts SimpleM rep (u -> TypeBase shape u)
-> SimpleM rep u -> SimpleM rep (TypeBase shape u)
forall a b. SimpleM rep (a -> b) -> SimpleM rep a -> SimpleM rep b
forall (f :: * -> *) a b. Applicative f => f (a -> b) -> f a -> f b
<*> u -> SimpleM rep u
forall a. a -> SimpleM rep a
forall (f :: * -> *) a. Applicative f => a -> f a
pure u
u
  simplify (Mem Space
space) =
    Space -> TypeBase shape u
forall shape u. Space -> TypeBase shape u
Mem (Space -> TypeBase shape u)
-> SimpleM rep Space -> SimpleM rep (TypeBase shape u)
forall (f :: * -> *) a b. Functor f => (a -> b) -> f a -> f b
<$> Space -> SimpleM rep Space
forall rep. SimplifiableRep rep => Space -> SimpleM rep Space
forall e rep.
(Simplifiable e, SimplifiableRep rep) =>
e -> SimpleM rep e
simplify Space
space
  simplify (Prim PrimType
bt) =
    TypeBase shape u -> SimpleM rep (TypeBase shape u)
forall a. a -> SimpleM rep a
forall (f :: * -> *) a. Applicative f => a -> f a
pure (TypeBase shape u -> SimpleM rep (TypeBase shape u))
-> TypeBase shape u -> SimpleM rep (TypeBase shape u)
forall a b. (a -> b) -> a -> b
$ PrimType -> TypeBase shape u
forall shape u. PrimType -> TypeBase shape u
Prim PrimType
bt

instance Simplifiable d => Simplifiable (DimIndex d) where
  simplify :: forall rep.
SimplifiableRep rep =>
DimIndex d -> SimpleM rep (DimIndex d)
simplify (DimFix d
i) = d -> DimIndex d
forall d. d -> DimIndex d
DimFix (d -> DimIndex d) -> SimpleM rep d -> SimpleM rep (DimIndex d)
forall (f :: * -> *) a b. Functor f => (a -> b) -> f a -> f b
<$> d -> SimpleM rep d
forall rep. SimplifiableRep rep => d -> SimpleM rep d
forall e rep.
(Simplifiable e, SimplifiableRep rep) =>
e -> SimpleM rep e
simplify d
i
  simplify (DimSlice d
i d
n d
s) = d -> d -> d -> DimIndex d
forall d. d -> d -> d -> DimIndex d
DimSlice (d -> d -> d -> DimIndex d)
-> SimpleM rep d -> SimpleM rep (d -> d -> DimIndex d)
forall (f :: * -> *) a b. Functor f => (a -> b) -> f a -> f b
<$> d -> SimpleM rep d
forall rep. SimplifiableRep rep => d -> SimpleM rep d
forall e rep.
(Simplifiable e, SimplifiableRep rep) =>
e -> SimpleM rep e
simplify d
i SimpleM rep (d -> d -> DimIndex d)
-> SimpleM rep d -> SimpleM rep (d -> DimIndex d)
forall a b. SimpleM rep (a -> b) -> SimpleM rep a -> SimpleM rep b
forall (f :: * -> *) a b. Applicative f => f (a -> b) -> f a -> f b
<*> d -> SimpleM rep d
forall rep. SimplifiableRep rep => d -> SimpleM rep d
forall e rep.
(Simplifiable e, SimplifiableRep rep) =>
e -> SimpleM rep e
simplify d
n SimpleM rep (d -> DimIndex d)
-> SimpleM rep d -> SimpleM rep (DimIndex d)
forall a b. SimpleM rep (a -> b) -> SimpleM rep a -> SimpleM rep b
forall (f :: * -> *) a b. Applicative f => f (a -> b) -> f a -> f b
<*> d -> SimpleM rep d
forall rep. SimplifiableRep rep => d -> SimpleM rep d
forall e rep.
(Simplifiable e, SimplifiableRep rep) =>
e -> SimpleM rep e
simplify d
s

instance Simplifiable d => Simplifiable (Slice d) where
  simplify :: forall rep. SimplifiableRep rep => Slice d -> SimpleM rep (Slice d)
simplify = (d -> SimpleM rep d) -> Slice d -> SimpleM rep (Slice d)
forall (t :: * -> *) (f :: * -> *) a b.
(Traversable t, Applicative f) =>
(a -> f b) -> t a -> f (t b)
forall (f :: * -> *) a b.
Applicative f =>
(a -> f b) -> Slice a -> f (Slice b)
traverse d -> SimpleM rep d
forall rep. SimplifiableRep rep => d -> SimpleM rep d
forall e rep.
(Simplifiable e, SimplifiableRep rep) =>
e -> SimpleM rep e
simplify

simplifyLambda ::
  SimplifiableRep rep =>
  Names ->
  Lambda (Wise rep) ->
  SimpleM rep (Lambda (Wise rep), Stms (Wise rep))
simplifyLambda :: forall rep.
SimplifiableRep rep =>
Names
-> Lambda (Wise rep)
-> SimpleM rep (Lambda (Wise rep), Stms (Wise rep))
simplifyLambda Names
extra_bound Lambda (Wise rep)
lam = do
  BlockPred (Wise rep)
par_blocker <- (Env rep -> BlockPred (Wise rep))
-> SimpleM rep (BlockPred (Wise rep))
forall rep a. (Env rep -> a) -> SimpleM rep a
asksEngineEnv ((Env rep -> BlockPred (Wise rep))
 -> SimpleM rep (BlockPred (Wise rep)))
-> (Env rep -> BlockPred (Wise rep))
-> SimpleM rep (BlockPred (Wise rep))
forall a b. (a -> b) -> a -> b
$ HoistBlockers rep -> BlockPred (Wise rep)
forall {k} (rep :: k). HoistBlockers rep -> BlockPred (Wise rep)
blockHoistPar (HoistBlockers rep -> BlockPred (Wise rep))
-> (Env rep -> HoistBlockers rep)
-> Env rep
-> BlockPred (Wise rep)
forall b c a. (b -> c) -> (a -> b) -> a -> c
. Env rep -> HoistBlockers rep
forall {k} (rep :: k). Env rep -> HoistBlockers rep
envHoistBlockers
  BlockPred (Wise rep)
-> UsageTable
-> Lambda (Wise rep)
-> SimpleM rep (Lambda (Wise rep), Stms (Wise rep))
forall rep.
SimplifiableRep rep =>
BlockPred (Wise rep)
-> UsageTable
-> Lambda (Wise rep)
-> SimpleM rep (Lambda (Wise rep), Stms (Wise rep))
simplifyLambdaMaybeHoist (BlockPred (Wise rep)
par_blocker BlockPred (Wise rep)
-> BlockPred (Wise rep) -> BlockPred (Wise rep)
forall rep. BlockPred rep -> BlockPred rep -> BlockPred rep
`orIf` Names -> BlockPred (Wise rep)
forall rep. ASTRep rep => Names -> BlockPred rep
hasFree Names
extra_bound) UsageTable
forall a. Monoid a => a
mempty Lambda (Wise rep)
lam

simplifyLambdaNoHoisting ::
  SimplifiableRep rep =>
  Lambda (Wise rep) ->
  SimpleM rep (Lambda (Wise rep))
simplifyLambdaNoHoisting :: forall rep.
SimplifiableRep rep =>
Lambda (Wise rep) -> SimpleM rep (Lambda (Wise rep))
simplifyLambdaNoHoisting Lambda (Wise rep)
lam =
  (Lambda (Wise rep), Stms (Wise rep)) -> Lambda (Wise rep)
forall a b. (a, b) -> a
fst ((Lambda (Wise rep), Stms (Wise rep)) -> Lambda (Wise rep))
-> SimpleM rep (Lambda (Wise rep), Stms (Wise rep))
-> SimpleM rep (Lambda (Wise rep))
forall (f :: * -> *) a b. Functor f => (a -> b) -> f a -> f b
<$> BlockPred (Wise rep)
-> UsageTable
-> Lambda (Wise rep)
-> SimpleM rep (Lambda (Wise rep), Stms (Wise rep))
forall rep.
SimplifiableRep rep =>
BlockPred (Wise rep)
-> UsageTable
-> Lambda (Wise rep)
-> SimpleM rep (Lambda (Wise rep), Stms (Wise rep))
simplifyLambdaMaybeHoist (Bool -> BlockPred (Wise rep)
forall rep. Bool -> BlockPred rep
isFalse Bool
False) UsageTable
forall a. Monoid a => a
mempty Lambda (Wise rep)
lam

simplifyLambdaMaybeHoist ::
  SimplifiableRep rep =>
  BlockPred (Wise rep) ->
  UT.UsageTable ->
  Lambda (Wise rep) ->
  SimpleM rep (Lambda (Wise rep), Stms (Wise rep))
simplifyLambdaMaybeHoist :: forall rep.
SimplifiableRep rep =>
BlockPred (Wise rep)
-> UsageTable
-> Lambda (Wise rep)
-> SimpleM rep (Lambda (Wise rep), Stms (Wise rep))
simplifyLambdaMaybeHoist = (SymbolTable (Wise rep) -> SymbolTable (Wise rep))
-> BlockPred (Wise rep)
-> UsageTable
-> Lambda (Wise rep)
-> SimpleM rep (Lambda (Wise rep), Stms (Wise rep))
forall rep.
SimplifiableRep rep =>
(SymbolTable (Wise rep) -> SymbolTable (Wise rep))
-> BlockPred (Wise rep)
-> UsageTable
-> Lambda (Wise rep)
-> SimpleM rep (Lambda (Wise rep), Stms (Wise rep))
simplifyLambdaWith SymbolTable (Wise rep) -> SymbolTable (Wise rep)
forall a. a -> a
id

simplifyLambdaWith ::
  SimplifiableRep rep =>
  (ST.SymbolTable (Wise rep) -> ST.SymbolTable (Wise rep)) ->
  BlockPred (Wise rep) ->
  UT.UsageTable ->
  Lambda (Wise rep) ->
  SimpleM rep (Lambda (Wise rep), Stms (Wise rep))
simplifyLambdaWith :: forall rep.
SimplifiableRep rep =>
(SymbolTable (Wise rep) -> SymbolTable (Wise rep))
-> BlockPred (Wise rep)
-> UsageTable
-> Lambda (Wise rep)
-> SimpleM rep (Lambda (Wise rep), Stms (Wise rep))
simplifyLambdaWith SymbolTable (Wise rep) -> SymbolTable (Wise rep)
f BlockPred (Wise rep)
blocked UsageTable
usage lam :: Lambda (Wise rep)
lam@(Lambda [LParam (Wise rep)]
params Body (Wise rep)
body [Type]
rettype) = do
  [Param (LParamInfo rep)]
params' <- (Param (LParamInfo rep) -> SimpleM rep (Param (LParamInfo rep)))
-> [Param (LParamInfo rep)] -> SimpleM rep [Param (LParamInfo rep)]
forall (t :: * -> *) (m :: * -> *) a b.
(Traversable t, Monad m) =>
(a -> m b) -> t a -> m (t b)
forall (m :: * -> *) a b. Monad m => (a -> m b) -> [a] -> m [b]
mapM ((LParamInfo rep -> SimpleM rep (LParamInfo rep))
-> Param (LParamInfo rep) -> SimpleM rep (Param (LParamInfo rep))
forall (t :: * -> *) (f :: * -> *) a b.
(Traversable t, Applicative f) =>
(a -> f b) -> t a -> f (t b)
forall (f :: * -> *) a b.
Applicative f =>
(a -> f b) -> Param a -> f (Param b)
traverse LParamInfo rep -> SimpleM rep (LParamInfo rep)
forall rep.
SimplifiableRep rep =>
LParamInfo rep -> SimpleM rep (LParamInfo rep)
forall e rep.
(Simplifiable e, SimplifiableRep rep) =>
e -> SimpleM rep e
simplify) [Param (LParamInfo rep)]
[LParam (Wise rep)]
params
  let paramnames :: Names
paramnames = [VName] -> Names
namesFromList ([VName] -> Names) -> [VName] -> Names
forall a b. (a -> b) -> a -> b
$ Lambda (Wise rep) -> [VName]
forall rep. Lambda rep -> [VName]
boundByLambda Lambda (Wise rep)
lam
  (Stms (Wise rep)
hoisted, Body (Wise rep)
body') <-
    [LParam (Wise rep)]
-> SimpleM rep (Stms (Wise rep), Body (Wise rep))
-> SimpleM rep (Stms (Wise rep), Body (Wise rep))
forall rep a.
SimplifiableRep rep =>
[LParam (Wise rep)] -> SimpleM rep a -> SimpleM rep a
bindLParams [Param (LParamInfo rep)]
[LParam (Wise rep)]
params' (SimpleM rep (Stms (Wise rep), Body (Wise rep))
 -> SimpleM rep (Stms (Wise rep), Body (Wise rep)))
-> (SimpleM rep (Stms (Wise rep), Body (Wise rep))
    -> SimpleM rep (Stms (Wise rep), Body (Wise rep)))
-> SimpleM rep (Stms (Wise rep), Body (Wise rep))
-> SimpleM rep (Stms (Wise rep), Body (Wise rep))
forall b c a. (b -> c) -> (a -> b) -> a -> c
. (SymbolTable (Wise rep) -> SymbolTable (Wise rep))
-> SimpleM rep (Stms (Wise rep), Body (Wise rep))
-> SimpleM rep (Stms (Wise rep), Body (Wise rep))
forall rep a.
(SymbolTable (Wise rep) -> SymbolTable (Wise rep))
-> SimpleM rep a -> SimpleM rep a
localVtable SymbolTable (Wise rep) -> SymbolTable (Wise rep)
f (SimpleM rep (Stms (Wise rep), Body (Wise rep))
 -> SimpleM rep (Stms (Wise rep), Body (Wise rep)))
-> SimpleM rep (Stms (Wise rep), Body (Wise rep))
-> SimpleM rep (Stms (Wise rep), Body (Wise rep))
forall a b. (a -> b) -> a -> b
$
      BlockPred (Wise rep)
-> UsageTable
-> [Usages]
-> Body (Wise rep)
-> SimpleM rep (Stms (Wise rep), Body (Wise rep))
forall rep.
SimplifiableRep rep =>
BlockPred (Wise rep)
-> UsageTable
-> [Usages]
-> Body (Wise rep)
-> SimpleM rep (Stms (Wise rep), Body (Wise rep))
simplifyBody
        (BlockPred (Wise rep)
blocked BlockPred (Wise rep)
-> BlockPred (Wise rep) -> BlockPred (Wise rep)
forall rep. BlockPred rep -> BlockPred rep -> BlockPred rep
`orIf` Names -> BlockPred (Wise rep)
forall rep. ASTRep rep => Names -> BlockPred rep
hasFree Names
paramnames BlockPred (Wise rep)
-> BlockPred (Wise rep) -> BlockPred (Wise rep)
forall rep. BlockPred rep -> BlockPred rep -> BlockPred rep
`orIf` BlockPred (Wise rep)
forall rep. BlockPred rep
isConsumed)
        UsageTable
usage
        ((Type -> Usages) -> [Type] -> [Usages]
forall a b. (a -> b) -> [a] -> [b]
map (Usages -> Type -> Usages
forall a b. a -> b -> a
const Usages
forall a. Monoid a => a
mempty) [Type]
rettype)
        Body (Wise rep)
body
  [Type]
rettype' <- [Type] -> SimpleM rep [Type]
forall rep. SimplifiableRep rep => [Type] -> SimpleM rep [Type]
forall e rep.
(Simplifiable e, SimplifiableRep rep) =>
e -> SimpleM rep e
simplify [Type]
rettype
  (Lambda (Wise rep), Stms (Wise rep))
-> SimpleM rep (Lambda (Wise rep), Stms (Wise rep))
forall a. a -> SimpleM rep a
forall (f :: * -> *) a. Applicative f => a -> f a
pure ([LParam (Wise rep)]
-> Body (Wise rep) -> [Type] -> Lambda (Wise rep)
forall rep. [LParam rep] -> Body rep -> [Type] -> Lambda rep
Lambda [Param (LParamInfo rep)]
[LParam (Wise rep)]
params' Body (Wise rep)
body' [Type]
rettype', Stms (Wise rep)
hoisted)

instance Simplifiable Certs where
  simplify :: forall rep. SimplifiableRep rep => Certs -> SimpleM rep Certs
simplify (Certs [VName]
ocs) = [VName] -> Certs
Certs ([VName] -> Certs) -> ([[VName]] -> [VName]) -> [[VName]] -> Certs
forall b c a. (b -> c) -> (a -> b) -> a -> c
. [VName] -> [VName]
forall a. Ord a => [a] -> [a]
nubOrd ([VName] -> [VName])
-> ([[VName]] -> [VName]) -> [[VName]] -> [VName]
forall b c a. (b -> c) -> (a -> b) -> a -> c
. [[VName]] -> [VName]
forall (t :: * -> *) a. Foldable t => t [a] -> [a]
concat ([[VName]] -> Certs) -> SimpleM rep [[VName]] -> SimpleM rep Certs
forall (f :: * -> *) a b. Functor f => (a -> b) -> f a -> f b
<$> (VName -> SimpleM rep [VName]) -> [VName] -> SimpleM rep [[VName]]
forall (t :: * -> *) (m :: * -> *) a b.
(Traversable t, Monad m) =>
(a -> m b) -> t a -> m (t b)
forall (m :: * -> *) a b. Monad m => (a -> m b) -> [a] -> m [b]
mapM VName -> SimpleM rep [VName]
forall {rep}. VName -> SimpleM rep [VName]
check [VName]
ocs
    where
      check :: VName -> SimpleM rep [VName]
check VName
idd = do
        Maybe (SubExp, Certs)
vv <- VName -> SymbolTable (Wise rep) -> Maybe (SubExp, Certs)
forall rep. VName -> SymbolTable rep -> Maybe (SubExp, Certs)
ST.lookupSubExp VName
idd (SymbolTable (Wise rep) -> Maybe (SubExp, Certs))
-> SimpleM rep (SymbolTable (Wise rep))
-> SimpleM rep (Maybe (SubExp, Certs))
forall (f :: * -> *) a b. Functor f => (a -> b) -> f a -> f b
<$> SimpleM rep (SymbolTable (Wise rep))
forall rep. SimpleM rep (SymbolTable (Wise rep))
askVtable
        case Maybe (SubExp, Certs)
vv of
          Just (Constant PrimValue
_, Certs [VName]
cs) -> [VName] -> SimpleM rep [VName]
forall a. a -> SimpleM rep a
forall (f :: * -> *) a. Applicative f => a -> f a
pure [VName]
cs
          Just (Var VName
idd', Certs
_) -> [VName] -> SimpleM rep [VName]
forall a. a -> SimpleM rep a
forall (f :: * -> *) a. Applicative f => a -> f a
pure [VName
idd']
          Maybe (SubExp, Certs)
_ -> [VName] -> SimpleM rep [VName]
forall a. a -> SimpleM rep a
forall (f :: * -> *) a. Applicative f => a -> f a
pure [VName
idd]

simplifyFun ::
  SimplifiableRep rep =>
  FunDef (Wise rep) ->
  SimpleM rep (FunDef (Wise rep))
simplifyFun :: forall rep.
SimplifiableRep rep =>
FunDef (Wise rep) -> SimpleM rep (FunDef (Wise rep))
simplifyFun (FunDef Maybe EntryPoint
entry Attrs
attrs Name
fname [(RetType (Wise rep), RetAls)]
rettype [FParam (Wise rep)]
params Body (Wise rep)
body) = do
  [(RetType rep, RetAls)]
rettype' <- ((RetType rep, RetAls) -> SimpleM rep (RetType rep, RetAls))
-> [(RetType rep, RetAls)] -> SimpleM rep [(RetType rep, RetAls)]
forall (t :: * -> *) (m :: * -> *) a b.
(Traversable t, Monad m) =>
(a -> m b) -> t a -> m (t b)
forall (m :: * -> *) a b. Monad m => (a -> m b) -> [a] -> m [b]
mapM ((RetType rep -> SimpleM rep (RetType rep))
-> (RetAls -> SimpleM rep RetAls)
-> (RetType rep, RetAls)
-> SimpleM rep (RetType rep, RetAls)
forall (f :: * -> *) a c b d.
Applicative f =>
(a -> f c) -> (b -> f d) -> (a, b) -> f (c, d)
forall (t :: * -> * -> *) (f :: * -> *) a c b d.
(Bitraversable t, Applicative f) =>
(a -> f c) -> (b -> f d) -> t a b -> f (t c d)
bitraverse RetType rep -> SimpleM rep (RetType rep)
forall rep.
SimplifiableRep rep =>
RetType rep -> SimpleM rep (RetType rep)
forall e rep.
(Simplifiable e, SimplifiableRep rep) =>
e -> SimpleM rep e
simplify RetAls -> SimpleM rep RetAls
forall a. a -> SimpleM rep a
forall (f :: * -> *) a. Applicative f => a -> f a
pure) [(RetType rep, RetAls)]
[(RetType (Wise rep), RetAls)]
rettype
  [Param (FParamInfo rep)]
params' <- (Param (FParamInfo rep) -> SimpleM rep (Param (FParamInfo rep)))
-> [Param (FParamInfo rep)] -> SimpleM rep [Param (FParamInfo rep)]
forall (t :: * -> *) (m :: * -> *) a b.
(Traversable t, Monad m) =>
(a -> m b) -> t a -> m (t b)
forall (m :: * -> *) a b. Monad m => (a -> m b) -> [a] -> m [b]
mapM ((FParamInfo rep -> SimpleM rep (FParamInfo rep))
-> Param (FParamInfo rep) -> SimpleM rep (Param (FParamInfo rep))
forall (t :: * -> *) (f :: * -> *) a b.
(Traversable t, Applicative f) =>
(a -> f b) -> t a -> f (t b)
forall (f :: * -> *) a b.
Applicative f =>
(a -> f b) -> Param a -> f (Param b)
traverse FParamInfo rep -> SimpleM rep (FParamInfo rep)
forall rep.
SimplifiableRep rep =>
FParamInfo rep -> SimpleM rep (FParamInfo rep)
forall e rep.
(Simplifiable e, SimplifiableRep rep) =>
e -> SimpleM rep e
simplify) [Param (FParamInfo rep)]
[FParam (Wise rep)]
params
  let usages :: [Usages]
usages = ((RetType rep, RetAls) -> Usages)
-> [(RetType rep, RetAls)] -> [Usages]
forall a b. (a -> b) -> [a] -> [b]
map (RetType rep, RetAls) -> Usages
usageFromRet [(RetType rep, RetAls)]
rettype'
  Body (Wise rep)
body' <- [FParam (Wise rep)]
-> SimpleM rep (Body (Wise rep)) -> SimpleM rep (Body (Wise rep))
forall rep a.
SimplifiableRep rep =>
[FParam (Wise rep)] -> SimpleM rep a -> SimpleM rep a
bindFParams [FParam (Wise rep)]
params (SimpleM rep (Body (Wise rep)) -> SimpleM rep (Body (Wise rep)))
-> SimpleM rep (Body (Wise rep)) -> SimpleM rep (Body (Wise rep))
forall a b. (a -> b) -> a -> b
$ UsageTable
-> [Usages] -> Body (Wise rep) -> SimpleM rep (Body (Wise rep))
forall rep.
SimplifiableRep rep =>
UsageTable
-> [Usages] -> Body (Wise rep) -> SimpleM rep (Body (Wise rep))
simplifyBodyNoHoisting UsageTable
forall a. Monoid a => a
mempty [Usages]
usages Body (Wise rep)
body
  FunDef (Wise rep) -> SimpleM rep (FunDef (Wise rep))
forall a. a -> SimpleM rep a
forall (f :: * -> *) a. Applicative f => a -> f a
pure (FunDef (Wise rep) -> SimpleM rep (FunDef (Wise rep)))
-> FunDef (Wise rep) -> SimpleM rep (FunDef (Wise rep))
forall a b. (a -> b) -> a -> b
$ Maybe EntryPoint
-> Attrs
-> Name
-> [(RetType (Wise rep), RetAls)]
-> [FParam (Wise rep)]
-> Body (Wise rep)
-> FunDef (Wise rep)
forall rep.
Maybe EntryPoint
-> Attrs
-> Name
-> [(RetType rep, RetAls)]
-> [FParam rep]
-> Body rep
-> FunDef rep
FunDef Maybe EntryPoint
entry Attrs
attrs Name
fname [(RetType rep, RetAls)]
[(RetType (Wise rep), RetAls)]
rettype' [Param (FParamInfo rep)]
[FParam (Wise rep)]
params' Body (Wise rep)
body'
  where
    aliasable :: TypeBase shape u -> Bool
aliasable Array {} = Bool
True
    aliasable TypeBase shape u
_ = Bool
False
    aliasable_params :: [Int]
aliasable_params =
      ((Param (FParamInfo rep), Int) -> Int)
-> [(Param (FParamInfo rep), Int)] -> [Int]
forall a b. (a -> b) -> [a] -> [b]
map (Param (FParamInfo rep), Int) -> Int
forall a b. (a, b) -> b
snd ([(Param (FParamInfo rep), Int)] -> [Int])
-> [(Param (FParamInfo rep), Int)] -> [Int]
forall a b. (a -> b) -> a -> b
$ ((Param (FParamInfo rep), Int) -> Bool)
-> [(Param (FParamInfo rep), Int)]
-> [(Param (FParamInfo rep), Int)]
forall a. (a -> Bool) -> [a] -> [a]
filter (Type -> Bool
forall shape u. TypeBase shape u -> Bool
aliasable (Type -> Bool)
-> ((Param (FParamInfo rep), Int) -> Type)
-> (Param (FParamInfo rep), Int)
-> Bool
forall b c a. (b -> c) -> (a -> b) -> a -> c
. Param (FParamInfo rep) -> Type
forall dec. Typed dec => Param dec -> Type
paramType (Param (FParamInfo rep) -> Type)
-> ((Param (FParamInfo rep), Int) -> Param (FParamInfo rep))
-> (Param (FParamInfo rep), Int)
-> Type
forall b c a. (b -> c) -> (a -> b) -> a -> c
. (Param (FParamInfo rep), Int) -> Param (FParamInfo rep)
forall a b. (a, b) -> a
fst) ([(Param (FParamInfo rep), Int)]
 -> [(Param (FParamInfo rep), Int)])
-> [(Param (FParamInfo rep), Int)]
-> [(Param (FParamInfo rep), Int)]
forall a b. (a -> b) -> a -> b
$ [Param (FParamInfo rep)]
-> [Int] -> [(Param (FParamInfo rep), Int)]
forall a b. [a] -> [b] -> [(a, b)]
zip [Param (FParamInfo rep)]
[FParam (Wise rep)]
params [Int
0 ..]
    aliasable_rets :: [Int]
aliasable_rets =
      (((RetType rep, RetAls), Int) -> Int)
-> [((RetType rep, RetAls), Int)] -> [Int]
forall a b. (a -> b) -> [a] -> [b]
map ((RetType rep, RetAls), Int) -> Int
forall a b. (a, b) -> b
snd ([((RetType rep, RetAls), Int)] -> [Int])
-> [((RetType rep, RetAls), Int)] -> [Int]
forall a b. (a -> b) -> a -> b
$ (((RetType rep, RetAls), Int) -> Bool)
-> [((RetType rep, RetAls), Int)] -> [((RetType rep, RetAls), Int)]
forall a. (a -> Bool) -> [a] -> [a]
filter (ExtType -> Bool
forall shape u. TypeBase shape u -> Bool
aliasable (ExtType -> Bool)
-> (((RetType rep, RetAls), Int) -> ExtType)
-> ((RetType rep, RetAls), Int)
-> Bool
forall b c a. (b -> c) -> (a -> b) -> a -> c
. RetType rep -> ExtType
forall t. ExtTyped t => t -> ExtType
extTypeOf (RetType rep -> ExtType)
-> (((RetType rep, RetAls), Int) -> RetType rep)
-> ((RetType rep, RetAls), Int)
-> ExtType
forall b c a. (b -> c) -> (a -> b) -> a -> c
. (RetType rep, RetAls) -> RetType rep
forall a b. (a, b) -> a
fst ((RetType rep, RetAls) -> RetType rep)
-> (((RetType rep, RetAls), Int) -> (RetType rep, RetAls))
-> ((RetType rep, RetAls), Int)
-> RetType rep
forall b c a. (b -> c) -> (a -> b) -> a -> c
. ((RetType rep, RetAls), Int) -> (RetType rep, RetAls)
forall a b. (a, b) -> a
fst) ([((RetType rep, RetAls), Int)] -> [((RetType rep, RetAls), Int)])
-> [((RetType rep, RetAls), Int)] -> [((RetType rep, RetAls), Int)]
forall a b. (a -> b) -> a -> b
$ [(RetType rep, RetAls)] -> [Int] -> [((RetType rep, RetAls), Int)]
forall a b. [a] -> [b] -> [(a, b)]
zip [(RetType rep, RetAls)]
[(RetType (Wise rep), RetAls)]
rettype [Int
0 ..]
    restricted :: t a -> t a -> Bool
restricted t a
als = (a -> Bool) -> t a -> Bool
forall (t :: * -> *) a. Foldable t => (a -> Bool) -> t a -> Bool
any (a -> t a -> Bool
forall (t :: * -> *) a. (Foldable t, Eq a) => a -> t a -> Bool
`notElem` t a
als)
    usageFromRet :: (RetType rep, RetAls) -> Usages
usageFromRet (RetType rep
t, RetAls [Int]
pals [Int]
rals) =
      Diet -> Usages
usageFromDiet (DeclExtType -> Diet
forall shape. TypeBase shape Uniqueness -> Diet
diet (DeclExtType -> Diet) -> DeclExtType -> Diet
forall a b. (a -> b) -> a -> b
$ RetType rep -> DeclExtType
forall t. DeclExtTyped t => t -> DeclExtType
declExtTypeOf RetType rep
t)
        Usages -> Usages -> Usages
forall a. Semigroup a => a -> a -> a
<> if [Int] -> [Int] -> Bool
forall {t :: * -> *} {t :: * -> *} {a}.
(Foldable t, Foldable t, Eq a) =>
t a -> t a -> Bool
restricted [Int]
pals [Int]
aliasable_params
          Bool -> Bool -> Bool
|| [Int] -> [Int] -> Bool
forall {t :: * -> *} {t :: * -> *} {a}.
(Foldable t, Foldable t, Eq a) =>
t a -> t a -> Bool
restricted [Int]
rals [Int]
aliasable_rets
          then Usages
UT.consumedU
          else Usages
forall a. Monoid a => a
mempty