X-Git-Url: https://git.stderr.nl/gitweb?a=blobdiff_plain;f=Adders.hs;h=e6676e94888f3ce0bec9c9a489672da8288200e0;hb=c5bde4d7862c7df2b4bad183088f77a43d8b5a2c;hp=ac93a3366db359f3fc368467fe7280320aece926;hpb=0082f01a853476cdcec0e73bacf8c0d4508dbec0;p=matthijs%2Fmaster-project%2Fc%CE%BBash.git diff --git a/Adders.hs b/Adders.hs index ac93a33..e6676e9 100644 --- a/Adders.hs +++ b/Adders.hs @@ -2,6 +2,8 @@ module Adders where import Bits import qualified Sim import Language.Haskell.Syntax +import qualified Data.TypeLevel as TypeLevel +import qualified Data.Param.FSVec as FSVec mainIO f = Sim.simulateIO (Sim.stateless f) () @@ -16,10 +18,39 @@ show_add f = do print ("Sum: " ++ (displaysigs s)); print ("Carry: " ++ (displ b = [Low, Low, Low, High] (s, c) = f (a, b) +mux2 :: Bit -> (Bit, Bit) -> Bit +mux2 Low (a, b) = a +mux2 High (a, b) = b + -- Not really an adder, but this is nice minimal hardware description wire :: Bit -> Bit wire a = a +bus :: (TypeLevel.Pos len) => BitVec len -> BitVec len +bus v = v + +bus_4 :: BitVec TypeLevel.D4 -> BitVec TypeLevel.D4 +bus_4 v = v + +{- +inv_n :: (Pos len) => BitVec len -> BitVec len +inv_n v = + --FSVec.map hwnot v + inv_n_rec v + +class Inv vec where + inv_n_rec :: vec -> vec + +instance (Pos len) => Inv (BitVec len) where + inv_n_rec v = + h FSVec.+> t + where + h = FSVec.head v + t = FSVec.tail v + +instance Inv (BitVec D0) where + inv_n_rec v = v +-} -- Not really an adder either, but a slightly more complex example inv :: Bit -> Bit inv a = hwnot a @@ -41,11 +72,31 @@ dff d s = (s', q) type ShifterState = (Bit, Bit, Bit, Bit) shifter :: Bit -> ShifterState -> (ShifterState, Bit) -shifter a s = - (s', o) +shifter i (a, b, c, d) = + (s', d) + where + s' = (i, a, b, c) + +{-# NOINLINE shifter_en #-} +shifter_en :: Bit -> Bit-> ShifterState -> (ShifterState, Bit) +shifter_en High i (a, b, c, d) = + (s', d) + where + s' = (i, a, b, c) + +shifter_en Low i s@(a, b, c, d) = + (s, d) + +-- Two multiplexed shifters +type ShiftersState = (ShifterState, ShifterState) +shifters :: Bit -> Bit -> ShiftersState -> (ShiftersState, Bit) +shifters sel i (sa, sb) = + (s', out) where - s' = (a, b, c, d) - (b, c, d, o) = s + (sa', outa) = shifter_en sel i sa + (sb', outb) = shifter_en (hwnot sel) i sb + s' = (sa', sb') + out = if sel == High then outa else outb -- Combinatoric stateless no-carry adder -- A -> B -> S @@ -55,6 +106,7 @@ no_carry_adder (a, b) = a `hwxor` b -- Combinatoric stateless half adder -- A -> B -> (S, C) half_adder :: (Bit, Bit) -> (Bit, Bit) +{-# NOINLINE half_adder #-} half_adder (a, b) = ( a `hwxor` b, a `hwand` b )