--
-- Copyright (c) 2009-2011, ERICSSON AB
-- All rights reserved.
--
-- Redistribution and use in source and binary forms, with or without
-- modification, are permitted provided that the following conditions are met:
--
-- * Redistributions of source code must retain the above copyright notice,
-- this list of conditions and the following disclaimer.
-- * Redistributions in binary form must reproduce the above copyright
-- notice, this list of conditions and the following disclaimer in the
-- documentation and/or other materials provided with the distribution.
-- * Neither the name of the ERICSSON AB nor the names of its contributors
-- may be used to endorse or promote products derived from this software
-- without specific prior written permission.
--
-- THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
-- AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
-- IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
-- DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE
-- FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
-- DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
-- SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
-- CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
-- OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
-- OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
--
module Feldspar.Par
( P
, IVar
, runPar
, new
, get
, put
, fork
, yield
, spawn
, pval
, parMap
, parMapM
)
where
import Language.Syntactic
import Feldspar.Core.Constructs (Syntax(..))
import Feldspar.Core.Constructs.Par
import Feldspar.Core.Frontend.Par
runPar :: Syntax a => P a -> a
runPar = sugarSym ParRun
new :: Syntax a => P (IVar a)
new = sugarSym ParNew
get :: Syntax a => IVar a -> P a
get = sugarSym ParGet
put :: Syntax a => IVar a -> a -> P ()
put = sugarSym ParPut
fork :: P () -> P ()
fork = sugarSym ParFork
yield :: P ()
yield = sugarSym ParYield
spawn :: Syntax a => P a -> P (IVar a)
spawn p = do
r <- new
fork (p >>= put r)
return r
pval a = spawn (return a)
parMap f xs = mapM (pval . f) xs >>= mapM get
parMapM f xs = mapM (spawn . f) xs >>= mapM get
{-
divConq :: (prob -> Bool) -- indivisible?
-> (prob -> [prob]) -- split into subproblems
-> ([sol] -> [sol]) -- join solutions
-> (prob -> sol) -- solve a (sub)problem
-> (prob -> sol)
-}
divConq indiv split join f prob = go prob
where
go prob | indiv prob = return (f prob)
| otherwise = do
sols <- parMapM go (split prob)
return (join sols)