Safe Haskell	None

LLVM.Extra.Multi.Vector

Synopsis

newtype T n a = Cons (Repr (Value n) a)
consPrim :: Repr (Value n) a ~ Value n a => Value (Vector n a) -> T n a
deconsPrim :: Repr (Value n) a ~ Value n a => T n a -> Value (Vector n a)
class C a => C a where
- undef :: Positive n => T n a
- zero :: Positive n => T n a
- phis :: Positive n => BasicBlock -> T n a -> CodeGenFunction r (T n a)
- addPhis :: Positive n => BasicBlock -> T n a -> T n a -> CodeGenFunction r ()
- shuffleMatch :: Positive n => ConstValue (Vector n Word32) -> T n a -> CodeGenFunction r (T n a)
- extract :: Positive n => Value Word32 -> T n a -> CodeGenFunction r (T a)
- insert :: Positive n => Value Word32 -> T a -> T n a -> CodeGenFunction r (T n a)
newtype Value n a = Value (PrimValue n a)
map :: (Positive n, C a, C b) => (T a -> CodeGenFunction r (T b)) -> T n a -> CodeGenFunction r (T n b)
zip :: T n a -> T n b -> T n (a, b)
zip3 :: T n a -> T n b -> T n c -> T n (a, b, c)
unzip :: T n (a, b) -> (T n a, T n b)
unzip3 :: T n (a, b, c) -> (T n a, T n b, T n c)
replicate :: (Positive n, C a) => T a -> CodeGenFunction r (T n a)
iterate :: (Positive n, C a) => (T a -> CodeGenFunction r (T a)) -> T a -> CodeGenFunction r (T n a)
lift1 :: (Repr (Value n) a -> Repr (Value n) b) -> T n a -> T n b
modify :: (Positive n, C a) => Value Word32 -> (T a -> CodeGenFunction r (T a)) -> T n a -> CodeGenFunction r (T n a)
assemble :: (Positive n, C a) => [T a] -> CodeGenFunction r (T n a)
dissect :: (Positive n, C a) => T n a -> CodeGenFunction r [T a]
dissectList :: (Positive n, C a) => T n a -> [CodeGenFunction r (T a)]
reverse :: (Positive n, C a) => T n a -> CodeGenFunction r (T n a)
rotateUp :: (Positive n, C a) => T n a -> CodeGenFunction r (T n a)
rotateDown :: (Positive n, C a) => T n a -> CodeGenFunction r (T n a)
shiftUp :: (Positive n, C a) => T a -> T n a -> CodeGenFunction r (T a, T n a)
shiftDown :: (Positive n, C a) => T a -> T n a -> CodeGenFunction r (T a, T n a)
shiftUpMultiZero :: (Positive n, C a, ValueTuple a ~ al, Zero al) => Int -> T n a -> CodeGenFunction r (T n a)
shiftDownMultiZero :: (Positive n, C a, ValueTuple a ~ al, Zero al) => Int -> T n a -> CodeGenFunction r (T n a)
undefPrimitive :: (Positive n, IsPrimitive a, Repr (Value n) a ~ Value n a) => T n a
shuffleMatchPrimitive :: (Positive n, IsPrimitive a, Repr Value a ~ Value a, Repr (Value n) a ~ Value n a) => ConstValue (Vector n Word32) -> T n a -> CodeGenFunction r (T n a)
extractPrimitive :: (Positive n, IsPrimitive a, Repr Value a ~ Value a, Repr (Value n) a ~ Value n a) => Value Word32 -> T n a -> CodeGenFunction r (T a)
insertPrimitive :: (Positive n, IsPrimitive a, Repr Value a ~ Value a, Repr (Value n) a ~ Value n a) => Value Word32 -> T a -> T n a -> CodeGenFunction r (T n a)
shuffleMatchTraversable :: (Positive n, C a, Traversable f) => ConstValue (Vector n Word32) -> f (T n a) -> CodeGenFunction r (f (T n a))
insertTraversable :: (Positive n, C a, Traversable f, Applicative f) => Value Word32 -> f (T a) -> f (T n a) -> CodeGenFunction r (f (T n a))
extractTraversable :: (Positive n, C a, Traversable f) => Value Word32 -> f (T n a) -> CodeGenFunction r (f (T a))
class (Additive a, C a) => Additive a where
- add :: Positive n => T n a -> T n a -> CodeGenFunction r (T n a)
- sub :: Positive n => T n a -> T n a -> CodeGenFunction r (T n a)
- neg :: Positive n => T n a -> CodeGenFunction r (T n a)
class (PseudoRing a, Additive a) => PseudoRing a where
- mul :: Positive n => T n a -> T n a -> CodeGenFunction r (T n a)
class (Field a, PseudoRing a) => Field a where
- fdiv :: Positive n => T n a -> T n a -> CodeGenFunction r (T n a)
class (PseudoModule v, PseudoRing (Scalar v), Additive v) => PseudoModule v where
- scale :: Positive n => T n (Scalar v) -> T n v -> CodeGenFunction r (T n v)
class (Real a, Additive a) => Real a where
- min :: Positive n => T n a -> T n a -> CodeGenFunction r (T n a)
- max :: Positive n => T n a -> T n a -> CodeGenFunction r (T n a)
- abs :: Positive n => T n a -> CodeGenFunction r (T n a)
- signum :: Positive n => T n a -> CodeGenFunction r (T n a)
class (Fraction a, Real a) => Fraction a where
- truncate :: Positive n => T n a -> CodeGenFunction r (T n a)
- fraction :: Positive n => T n a -> CodeGenFunction r (T n a)
class (Algebraic a, Field a) => Algebraic a where
- sqrt :: Positive n => T n a -> CodeGenFunction r (T n a)
class (Transcendental a, Algebraic a) => Transcendental a where
- pi :: Positive n => CodeGenFunction r (T n a)
- sin, log, exp, cos :: Positive n => T n a -> CodeGenFunction r (T n a)
- pow :: Positive n => T n a -> T n a -> CodeGenFunction r (T n a)
class (FloatingComparison a, Comparison a) => FloatingComparison a where
- fcmp :: Positive n => FPPredicate -> T n a -> T n a -> CodeGenFunction r (T n Bool)
class (Comparison a, C a) => Comparison a where
- cmp :: Positive n => CmpPredicate -> T n a -> T n a -> CodeGenFunction r (T n Bool)
class (Logic a, C a) => Logic a where
- and :: Positive n => T n a -> T n a -> CodeGenFunction r (T n a)
- or :: Positive n => T n a -> T n a -> CodeGenFunction r (T n a)
- xor :: Positive n => T n a -> T n a -> CodeGenFunction r (T n a)
- inv :: Positive n => T n a -> CodeGenFunction r (T n a)
class BitShift a where
- shl :: Positive n => T n a -> T n a -> CodeGenFunction r (T n a)
- shr :: Positive n => T n a -> T n a -> CodeGenFunction r (T n a)

Documentation

newtype T n a Source

Constructors

Cons (Repr (Value n) a)

Instances

Positive n => C (T n)
(Positive n, C a) => Phi (T n a)
(Positive n, C a) => Zero (T n a)
(Positive n, C a) => Undefined (T n a)
(Positive n, Transcendental a) => Transcendental (T n a)
(Positive n, Algebraic a) => Algebraic (T n a)
(Positive n, Logic a) => Logic (T n a)
(Positive n, FloatingComparison a) => FloatingComparison (T n a)
(Positive n, Comparison a) => Comparison (T n a)
(Positive n, Fraction a) => Fraction (T n a)
(Positive n, Real a) => Real (T n a)
(Positive n, RationalConstant a) => RationalConstant (T n a)
(Positive n, Field a) => Field (T n a)
(Positive n, IntegerConstant a) => IntegerConstant (T n a)
(Positive n, PseudoModule a) => PseudoModule (T n a)
(Positive n, PseudoRing a) => PseudoRing (T n a)
(Positive n, Additive a) => Additive (T n a)
C n a => C (T n a)

consPrim :: Repr (Value n) a ~ Value n a => Value (Vector n a) -> T n aSource

deconsPrim :: Repr (Value n) a ~ Value n a => T n a -> Value (Vector n a)Source

class C a => C a whereSource

Methods

undef :: Positive n => T n aSource

zero :: Positive n => T n aSource

phis :: Positive n => BasicBlock -> T n a -> CodeGenFunction r (T n a)Source

addPhis :: Positive n => BasicBlock -> T n a -> T n a -> CodeGenFunction r ()Source

shuffleMatch :: Positive n => ConstValue (Vector n Word32) -> T n a -> CodeGenFunction r (T n a)Source

extract :: Positive n => Value Word32 -> T n a -> CodeGenFunction r (T a)Source

insert :: Positive n => Value Word32 -> T a -> T n a -> CodeGenFunction r (T n a)Source

Instances

C Bool
C Double
C Float
(C a, C b) => C (a, b)
(C a, C b, C c) => C (a, b, c)

newtype Value n a Source

Constructors

Value (PrimValue n a)

map :: (Positive n, C a, C b) => (T a -> CodeGenFunction r (T b)) -> T n a -> CodeGenFunction r (T n b)Source

zip :: T n a -> T n b -> T n (a, b)Source

zip3 :: T n a -> T n b -> T n c -> T n (a, b, c)Source

unzip :: T n (a, b) -> (T n a, T n b)Source

unzip3 :: T n (a, b, c) -> (T n a, T n b, T n c)Source

replicate :: (Positive n, C a) => T a -> CodeGenFunction r (T n a)Source

iterate :: (Positive n, C a) => (T a -> CodeGenFunction r (T a)) -> T a -> CodeGenFunction r (T n a)Source

lift1 :: (Repr (Value n) a -> Repr (Value n) b) -> T n a -> T n bSource

modify :: (Positive n, C a) => Value Word32 -> (T a -> CodeGenFunction r (T a)) -> T n a -> CodeGenFunction r (T n a)Source

assemble :: (Positive n, C a) => [T a] -> CodeGenFunction r (T n a)Source

dissect :: (Positive n, C a) => T n a -> CodeGenFunction r [T a]Source

dissectList :: (Positive n, C a) => T n a -> [CodeGenFunction r (T a)]Source

reverse :: (Positive n, C a) => T n a -> CodeGenFunction r (T n a)Source

rotateUp :: (Positive n, C a) => T n a -> CodeGenFunction r (T n a)Source

Rotate one element towards the higher elements.

I don't want to call it rotateLeft or rotateRight, because there is no prefered layout for the vector elements. In Intel's instruction manual vector elements are indexed like the bits, that is from right to left. However, when working with Haskell list and enumeration syntax, the start index is left.

rotateDown :: (Positive n, C a) => T n a -> CodeGenFunction r (T n a)Source

shiftUp :: (Positive n, C a) => T a -> T n a -> CodeGenFunction r (T a, T n a)Source

shiftDown :: (Positive n, C a) => T a -> T n a -> CodeGenFunction r (T a, T n a)Source

shiftUpMultiZero :: (Positive n, C a, ValueTuple a ~ al, Zero al) => Int -> T n a -> CodeGenFunction r (T n a)Source

shiftDownMultiZero :: (Positive n, C a, ValueTuple a ~ al, Zero al) => Int -> T n a -> CodeGenFunction r (T n a)Source

undefPrimitive :: (Positive n, IsPrimitive a, Repr (Value n) a ~ Value n a) => T n aSource

shuffleMatchPrimitive :: (Positive n, IsPrimitive a, Repr Value a ~ Value a, Repr (Value n) a ~ Value n a) => ConstValue (Vector n Word32) -> T n a -> CodeGenFunction r (T n a)Source

extractPrimitive :: (Positive n, IsPrimitive a, Repr Value a ~ Value a, Repr (Value n) a ~ Value n a) => Value Word32 -> T n a -> CodeGenFunction r (T a)Source

insertPrimitive :: (Positive n, IsPrimitive a, Repr Value a ~ Value a, Repr (Value n) a ~ Value n a) => Value Word32 -> T a -> T n a -> CodeGenFunction r (T n a)Source

shuffleMatchTraversable :: (Positive n, C a, Traversable f) => ConstValue (Vector n Word32) -> f (T n a) -> CodeGenFunction r (f (T n a))Source

insertTraversable :: (Positive n, C a, Traversable f, Applicative f) => Value Word32 -> f (T a) -> f (T n a) -> CodeGenFunction r (f (T n a))Source

extractTraversable :: (Positive n, C a, Traversable f) => Value Word32 -> f (T n a) -> CodeGenFunction r (f (T a))Source

class (Additive a, C a) => Additive a whereSource

Methods

add :: Positive n => T n a -> T n a -> CodeGenFunction r (T n a)Source

sub :: Positive n => T n a -> T n a -> CodeGenFunction r (T n a)Source

neg :: Positive n => T n a -> CodeGenFunction r (T n a)Source

Instances

Additive Double
Additive Float

class (PseudoRing a, Additive a) => PseudoRing a whereSource

Methods

mul :: Positive n => T n a -> T n a -> CodeGenFunction r (T n a)Source

Instances

PseudoRing Double
PseudoRing Float

class (Field a, PseudoRing a) => Field a whereSource

Methods

fdiv :: Positive n => T n a -> T n a -> CodeGenFunction r (T n a)Source

Instances

Field Double
Field Float

class (PseudoModule v, PseudoRing (Scalar v), Additive v) => PseudoModule v whereSource

Methods

scale :: Positive n => T n (Scalar v) -> T n v -> CodeGenFunction r (T n v)Source

Instances

PseudoModule Double
PseudoModule Float

class (Real a, Additive a) => Real a whereSource

Methods

min :: Positive n => T n a -> T n a -> CodeGenFunction r (T n a)Source

max :: Positive n => T n a -> T n a -> CodeGenFunction r (T n a)Source

abs :: Positive n => T n a -> CodeGenFunction r (T n a)Source

signum :: Positive n => T n a -> CodeGenFunction r (T n a)Source

Instances

Real Double
Real Float

class (Fraction a, Real a) => Fraction a whereSource

Methods

truncate :: Positive n => T n a -> CodeGenFunction r (T n a)Source

fraction :: Positive n => T n a -> CodeGenFunction r (T n a)Source

Instances

Fraction Double
Fraction Float

class (Algebraic a, Field a) => Algebraic a whereSource

Methods

sqrt :: Positive n => T n a -> CodeGenFunction r (T n a)Source

Instances

Algebraic Double
Algebraic Float

class (Transcendental a, Algebraic a) => Transcendental a whereSource

Methods

pi :: Positive n => CodeGenFunction r (T n a)Source

sin, log, exp, cos :: Positive n => T n a -> CodeGenFunction r (T n a)Source

pow :: Positive n => T n a -> T n a -> CodeGenFunction r (T n a)Source

Instances

Transcendental Double
Transcendental Float

class (FloatingComparison a, Comparison a) => FloatingComparison a whereSource

Methods

fcmp :: Positive n => FPPredicate -> T n a -> T n a -> CodeGenFunction r (T n Bool)Source

Instances

FloatingComparison Float

class (Comparison a, C a) => Comparison a whereSource

Methods

cmp :: Positive n => CmpPredicate -> T n a -> T n a -> CodeGenFunction r (T n Bool)Source

Instances

Comparison Double
Comparison Float

class (Logic a, C a) => Logic a whereSource

Methods

and :: Positive n => T n a -> T n a -> CodeGenFunction r (T n a)Source

or :: Positive n => T n a -> T n a -> CodeGenFunction r (T n a)Source

xor :: Positive n => T n a -> T n a -> CodeGenFunction r (T n a)Source

inv :: Positive n => T n a -> CodeGenFunction r (T n a)Source

Instances

Logic Bool

class BitShift a whereSource

Methods

shl :: Positive n => T n a -> T n a -> CodeGenFunction r (T n a)Source

shr :: Positive n => T n a -> T n a -> CodeGenFunction r (T n a)Source

Instances

BitShift Int8
BitShift Int16
BitShift Int32
BitShift Int64
BitShift Word8
BitShift Word16
BitShift Word32
BitShift Word64