4 {-# LANGUAGE TypeOperators, TypeFamilies, FlexibleContexts #-}
7 import qualified Prelude as P
11 \section{Polymorphic, Higher-Order CPU}
12 \subsection{Introduction}
15 \frametitle{Small Use Case}
17 \item Small Polymorphic, Higher-Order CPU
18 \item Each function is turned into a hardware component
19 \item Use of state will be simple
26 Import all the built-in types, such as vectors and integers:
27 \begin{beamercolorbox}[sep=-2.5ex,rounded=true,shadow=true,vmode]{codebox}
29 import CLasH.HardwareTypes
31 \end{beamercolorbox}\pause
33 Import annotations, helps \clash{} to find top-level component:
34 \begin{beamercolorbox}[sep=-2.5ex,rounded=true,shadow=true,vmode]{codebox}
36 import CLasH.Translator.Annotations
41 \subsection{Type Definitions}
44 \frametitle{Type definitions}
45 First we define some ALU types:
46 \begin{beamercolorbox}[sep=-2.5ex,rounded=true,shadow=true,vmode]{codebox}
48 type Op s a = a -> Vector s a -> a
51 \end{beamercolorbox}\pause
53 And some Register types:
54 \begin{beamercolorbox}[sep=-2.5ex,rounded=true,shadow=true,vmode]{codebox}
56 type RegBank s a = Vector (s :+: D1) a
57 type RegState s a = State (RegBank s a)
59 \end{beamercolorbox}\pause
61 And a simple Word type:
62 \begin{beamercolorbox}[sep=-2.5ex,rounded=true,shadow=true,vmode]{codebox}
64 type Word = SizedInt D12
69 \subsection{Frameworks for Operations}
72 \frametitle{Operations}
73 We make a primitive operation:
74 \begin{beamercolorbox}[sep=-2.5ex,rounded=true,shadow=true,vmode]{codebox}
76 primOp :: {-"{\color<3>[rgb]{1,0,0}"-}(a -> a -> a){-"}"-} -> Op s a
77 primOp f a b = a `f` a
79 \end{beamercolorbox}\pause
81 We make a vector operation:
82 \begin{beamercolorbox}[sep=-2.5ex,rounded=true,shadow=true,vmode]{codebox}
84 vectOp :: {-"{\color<3>[rgb]{1,0,0}"-}(a -> a -> a){-"}"-} -> Op s a
85 vectOp f a b = {-"{\color<3>[rgb]{1,0,0}"-}foldl{-"}"-} f a b
89 \uncover<3->{\item We support Higher-Order Functionality}
92 \subsection{Polymorphic, Higher-Order ALU}
95 \frametitle{Simple ALU}
96 We define a polymorphic ALU:
97 \begin{beamercolorbox}[sep=-2.5ex,rounded=true,shadow=true,vmode]{codebox}
102 Opcode -> a -> Vector s a -> a
103 alu op1 op2 {-"{\color<2>[rgb]{1,0,0}"-}Low{-"}"-} a b = op1 a b
104 alu op1 op2 {-"{\color<2>[rgb]{1,0,0}"-}High{-"}"-} a b = op2 a b
108 \uncover<2->{\item We support Patter Matching}
111 \subsection{Register bank}
114 \frametitle{Register Bank}
115 Make a simple register bank:
116 \begin{beamercolorbox}[sep=-2.5ex,rounded=true,shadow=true,vmode]{codebox}
119 CXT((NaturalT s ,PositiveT (s :+: D1),((s :+: D1) :>: s) ~ True )) => (RegState s a) -> a -> RangedWord s ->
120 RangedWord s -> Bit -> ((RegState s a), a )
122 registerBank (State mem) data_in rdaddr wraddr wrenable =
123 ((State mem'), data_out)
125 data_out = mem!rdaddr
126 mem' {-"{\color<2>[rgb]{1,0,0}"-}| wrenable == Low{-"}"-} = mem
127 {-"{\color<2>[rgb]{1,0,0}"-}| otherwise{-"}"-} = replace mem wraddr data_in
131 \uncover<2->{\item We support Guards}
134 \subsection{Simple CPU: ALU \& Register Bank}
137 \frametitle{Simple CPU}
138 Combining ALU and register bank:
139 \begin{beamercolorbox}[sep=-2.5ex,rounded=true,shadow=true,vmode]{codebox}
141 {-"{\color<2>[rgb]{1,0,0}"-}ANN(actual_cpu TopEntity){-"}"-}
143 (Opcode, Word, Vector D4 Word, RangedWord D9,
144 RangedWord D9, Bit) -> RegState D9 Word ->
145 (RegState D9 Word, Word)
147 actual_cpu (opc, a ,b, rdaddr, wraddr, wren) ram = (ram', alu_out)
149 alu_out = alu ({-"{\color<3>[rgb]{1,0,0}"-}primOp (+){-"}"-}) ({-"{\color<3>[rgb]{1,0,0}"-}vectOp (+){-"}"-}) opc ram_out b
150 (ram',ram_out) = registerBank ram a rdaddr wraddr wren
154 \uncover<2->{\item Annotation is used to indicate top-level component}
160 ANN(initstate InitState)
161 initstate :: RegState D9 Word
162 initstate = State (copy (0 :: Word))
164 ANN(program TestInput)
165 program :: [(Opcode, Word, Vector D4 Word, RangedWord D9, RangedWord D9, Bit)]
167 [ (Low, 4, copy (0::Word), 0, 0, High) -- Write 4 to Reg0, out = 0
168 , (Low, 3, copy (0::Word), 0, 1, High) -- Write 3 to Reg1, out = Reg0 + Reg0 = 8
169 , (High,0, copy (3::Word), 1, 0, Low) -- No Write , out = 15
172 run func state [] = []
173 run func state (i:input) = o:out
175 (state', o) = func i state
176 out = run func state' input
181 let istate = initstate
182 let output = run actual_cpu istate input
183 mapM_ (\x -> putStr $ ("# (" P.++ (show x) P.++ ")\n")) output