Copyright	(c) Sebastian Graf 2018
License	ISC
Maintainer	sgraf1337@gmail.com
Portability	portable
Safe Haskell	None
Language	Haskell2010

Datafix.Worklist.Graph

Description

Abstracts over the representation of the data-flow graph.

The contents of this module are more or less internal to the Datafix.Worklist implementation.

Synopsis

Documentation

data PointInfo domain Source #

The data associated with each point in the transfer function of a data-flow Node.

Constructors

PointInfo

Fields

value :: !(Maybe (ReturnType domain))
The value at this point. Can be Nothing only when a loop was detected.
references :: !(IntArgsMonoSet (Products (ParamTypes domain)))
Points this point of the transfer function depends on.
referrers :: !(IntArgsMonoSet (Products (ParamTypes domain)))
Points depending on this point.
iterations :: !Int
The number of times this point has been updated through calls to updateNodeValue.

Instances

(Eq (ReturnType domain), Eq (IntArgsMonoSet (Products (ParamTypes domain)))) => Eq (PointInfo domain) Source #
Methods (==) :: PointInfo domain -> PointInfo domain -> Bool # (/=) :: PointInfo domain -> PointInfo domain -> Bool #
(Show (ReturnType domain), Show (IntArgsMonoSet (Products (ParamTypes domain)))) => Show (PointInfo domain) Source #
Methods showsPrec :: Int -> PointInfo domain -> ShowS # show :: PointInfo domain -> String # showList :: [PointInfo domain] -> ShowS #

emptyPointInfo :: PointInfo domain Source #

The default PointInfo.

data Diff a Source #

Diff between two IntArgsMonoSets.

Constructors

Diff
Fields added :: !(IntArgsMonoSet a) removed :: !(IntArgsMonoSet a)

computeDiff :: MonoMapKey k => IntArgsMonoSet k -> IntArgsMonoSet k -> Diff k Source #

Computes the diff between two IntArgsMonoSets.

class GraphRef (ref :: * -> *) where Source #

Abstracts over the concrete representation of the data-flow graph.

There are two instances: The default Ref for sparse graphs based on an IntMap and Ref for the dense case, storing the Node mapping in a IOVector.

Minimal complete definition

updatePoint, lookup, lookupLT

Methods

updatePoint :: MonoMapKey (Products (ParamTypes domain)) => Int -> Products (ParamTypes domain) -> ReturnType domain -> IntArgsMonoSet (Products (ParamTypes domain)) -> ReaderT (ref domain) IO (PointInfo domain) Source #

lookup :: MonoMapKey (Products (ParamTypes domain)) => Int -> Products (ParamTypes domain) -> ReaderT (ref domain) IO (Maybe (PointInfo domain)) Source #

lookupLT :: MonoMapKey (Products (ParamTypes domain)) => Int -> Products (ParamTypes domain) -> ReaderT (ref domain) IO [(Products (ParamTypes domain), PointInfo domain)] Source #

Instances

GraphRef Ref Source #
Methods updatePoint :: MonoMapKey (Products (ParamTypes domain)) => Int -> Products (ParamTypes domain) -> ReturnType domain -> IntArgsMonoSet (Products (ParamTypes domain)) -> ReaderT * (Ref domain) IO (PointInfo domain) Source # lookup :: MonoMapKey (Products (ParamTypes domain)) => Int -> Products (ParamTypes domain) -> ReaderT * (Ref domain) IO (Maybe (PointInfo domain)) Source # lookupLT :: MonoMapKey (Products (ParamTypes domain)) => Int -> Products (ParamTypes domain) -> ReaderT * (Ref domain) IO [(Products (ParamTypes domain), PointInfo domain)] Source #
GraphRef Ref Source #
Methods updatePoint :: MonoMapKey (Products (ParamTypes domain)) => Int -> Products (ParamTypes domain) -> ReturnType domain -> IntArgsMonoSet (Products (ParamTypes domain)) -> ReaderT * (Ref domain) IO (PointInfo domain) Source # lookup :: MonoMapKey (Products (ParamTypes domain)) => Int -> Products (ParamTypes domain) -> ReaderT * (Ref domain) IO (Maybe (PointInfo domain)) Source # lookupLT :: MonoMapKey (Products (ParamTypes domain)) => Int -> Products (ParamTypes domain) -> ReaderT * (Ref domain) IO [(Products (ParamTypes domain), PointInfo domain)] Source #