1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310
|
(****************************************************************************)
(* the diy toolsuite *)
(* *)
(* Jade Alglave, University College London, UK. *)
(* Luc Maranget, INRIA Paris-Rocquencourt, France. *)
(* *)
(* Copyright 2015-present Institut National de Recherche en Informatique et *)
(* en Automatique and the authors. All rights reserved. *)
(* *)
(* This software is governed by the CeCILL-B license under French law and *)
(* abiding by the rules of distribution of free software. You can use, *)
(* modify and/ or redistribute the software under the terms of the CeCILL-B *)
(* license as circulated by CEA, CNRS and INRIA at the following URL *)
(* "http://www.cecill.info". We also give a copy in LICENSE.txt. *)
(****************************************************************************)
open Code
module type Config = sig
include CompileCommon.Config
val realdep : bool
end
module Make(Cfg:Config)(BO:BellArch_gen.Config) : XXXCompile_gen.S =
struct
(* Common *)
module Bell = BellArch_gen.Make(BO)
include CompileCommon.Make(Cfg)(Bell)
let ppo _f k = k
open Bell
open C
(* Utilities *)
let tempo1 = Symbolic_reg "T1" (* May be used for branch cond *)
let next_reg x = Bell.alloc_reg x
let pseudo = List.map (fun i -> Instruction i)
(* Bell instructions *)
let symb_of_string x = Abs x
(* let movi r i = Pmov (r,IAR_imm i) *)
let ld_tagged r x a = Pld (r, Addr_op_atom (symb_of_string x),a)
let ld r x = ld_tagged r x []
let ld_idx_tagged r x idx a =
Pld (r, Addr_op_add (symb_of_string x,Regi idx),a)
let st_tagged x v a =
Pst (Addr_op_atom (symb_of_string x),Imm v,a)
let st_reg_tagged x r a =
Pst (Addr_op_atom (Abs x),Regi r,a)
let st_idx_tagged x v idx a =
Pst (Addr_op_add (symb_of_string x,Regi idx),Imm v,a)
let mov rA op = Pmov (rA,op)
let movne rA rB k = mov rA (OP (Neq,IAR_roa (Rega rB),IAR_imm k))
let moveq rA rB k = mov rA (OP (Eq,IAR_roa (Rega rB),IAR_imm k))
let xor r1 r2 r3 = mov r1 (OP (Xor,IAR_roa (Rega r2),IAR_roa (Rega r3)))
let addk r1 r2 k = mov r1 (OP (Add,IAR_roa (Rega r2),IAR_imm k))
let andk r1 r2 k = mov r1 (OP (And,IAR_roa (Rega r2),IAR_imm k))
let branchcc reg lab = Pbranch (Some reg,lab,[])
let inc r = Pmov (r,OP (Add,IAR_roa (Rega r),IAR_imm 1))
(**********)
(* Export *)
(**********)
let emit_joker st init = None,init,[],st
(* Loads (some specific added) *)
let emit_load_tagged st _p init x a =
let rA,st = next_reg st in
rA,init,pseudo [ld_tagged rA x a],st
let emit_load st p init x = emit_load_tagged st p init x []
let emit_obs _ = emit_load
let emit_load_idx_tagged st _p init x idx a =
let rA,st = next_reg st in
rA,init,pseudo [ld_idx_tagged rA x idx a],st
let emit_load_idx st p init x idx =
emit_load_idx_tagged st p init x idx []
let emit_obs_not_zero st _p init x =
let rA,st = next_reg st in
let rB,st = next_reg st in
let lab = Label.next_label "L" in
rA,init,
Label (lab,Nop)::
pseudo
[ld rA x; movne rB rA 0 ; branchcc rB lab;],
st
let emit_load_one st _p init x =
let rA,st = next_reg st in
let rB,st = next_reg st in
let lab = Label.next_label "L" in
rA,init,
Label (lab,Nop)::
pseudo [ld rA x; movne rB rA 1; branchcc rB lab],
st
(* let emit_load_not st _p init x bcc =
let rA,st = next_reg st in
let rC,st = next_reg st in
let lab = Label.next_label "L" in
let out = Label.next_label "L" in
rA,init,
Instruction (movi rC 200)::
(* 200 X about 5 ins looks for a typical memory delay *)
Label (lab,Nop)::
pseudo
[
ld rA x; bcc rA out;
subi rC rC 1 ;
bcci Ne rC 0 lab ;
]@
[Label (out,Nop)],
st
*)
(*
let emit_load_not_eq st p init x rP =
emit_load_not st p init x
zz (fun r lab -> bcc Ne r rP lab)
let emit_load_not_value st p init x v =
emit_load_not st p init x
(fun r lab -> bcci Ne r v lab)
*)
let emit_obs_not_eq _ = assert false
let emit_obs_not_value _ = assert false
(* Stores *)
let emit_store_tagged st _p init x v a =
init,[Instruction (st_tagged x v a)],st
let emit_store st p init x v = emit_store_tagged st p init x v []
let emit_store_idx_tagged st _p init x v idx a =
init,[Instruction (st_idx_tagged x v idx a)],st
let emit_store_idx st p init x v idx =
emit_store_idx_tagged st p init x v idx []
let emit_store_reg_tagged st _p init x r a =
init,[Instruction (st_reg_tagged x r a)],st
let emit_store_reg st p init x r =
emit_store_reg_tagged st p init x r []
(**********)
(* Access *)
(**********)
let emit_access st p init e = match e.dir with
| None -> Warn.fatal "BellCompile.emit_access"
| Some d ->
match d,e.atom,e.loc with
| R,None,Data loc ->
let r,init,cs,st = emit_load st p init loc in
Some r,init,cs,st
| R,Some a,Data loc ->
let r,init,cs,st = emit_load_tagged st p init loc a in
Some r,init,cs,st
| W,None,Data loc ->
let init,cs,st = emit_store st p init loc e.v in
None,init,cs,st
| W,Some a,Data loc ->
let init,cs,st = emit_store_tagged st p init loc e.v a in
None,init,cs,st
| J,_,_ -> emit_joker st init
| _,_,Code _ -> Warn.fatal "No code location in Bell"
(* Dubious... *)
let _tr_a ar aw = match ar,aw with
| None,None -> []
| (Some a,None)
| (None,Some a) -> a
| Some a,Some _ -> a
(* let emit_exch st _p init er ew =
let rR,st = next_reg st in
let arw = tr_a er.C.atom ew.C.atom in
rR,init,[Instruction (exch_tagged rR er.loc ew.v arw)],st *)
let emit_rmw _ = assert false
(**********)
(* Fences *)
(**********)
let emit_fence st _ init _ f = init,[Instruction (Pfence f)],st
let emit_fence_dp st a init b f _ r _ =
let init,cs,st = emit_fence st a init b f in
Some r,init,cs,st
let _emit_fence_tagged o a = Instruction (Pfence(Fence(a,o)))
let stronger_fence = strong
(****************)
(* Dependencies *)
(****************)
(*jade: l'idee c'est de tout faire par les labelled fences en LISA*)
let calc_zero =
if Cfg.realdep then fun dst src -> Instruction (andk dst src kbig)
else fun dst src -> Instruction (xor dst src src)
let emit_access_dep_addr st p init e r1 =
let idx,st = next_reg st in
let cA = calc_zero idx r1 in
begin match Misc.as_some e.dir,e.atom,e.loc with
| R,None,Data loc ->
let rC,init,cs,st = emit_load_idx st p init loc idx in
Some rC,init,cA::cs,st
| R,Some a,Data loc ->
let rC,init,cs,st = emit_load_idx_tagged st p init loc idx a in
Some rC,init,cA::cs,st
| W,None,Data loc ->
let init,cs,st = emit_store_idx st p init loc e.v idx in
None,init,cA::cs,st
| W,Some a,Data loc ->
let init,cs,st = emit_store_idx_tagged st p init loc e.v idx a in
None,init,cA::cs,st
| J,_,Data _ -> emit_joker st init
| _,_,Code _ -> Warn.fatal "No code location for Bell"
end
let emit_access_dep_data st p init e r1 = match e.dir,e.loc with
| None,_ -> Warn.fatal "BellCompile.emit_access_dep_data"
| Some R,_ -> Warn.fatal "data dependency to load"
| Some W,Data loc ->
let r2,st = next_reg st in
let cs2 = [calc_zero r2 r1;Instruction (addk r2 r2 e.v);] in
begin match e.atom with
| None ->
let init,cs,st = emit_store_reg st p init loc r2 in
None,init,cs2@cs,st
| Some a ->
let init,cs,st = emit_store_reg_tagged st p init loc r2 a in
None,init,cs2@cs,st
end
| Some J,Data _ -> emit_joker st init
| _,Code _ -> Warn.fatal "No code location for Bell"
let emit_access_ctrl st p init e r1 v1 =
if Cfg.realdep then
let lab = Label.last p in
let ok,st = A.ok_reg st in
let st = A.next_ok st in
let rd,st = next_reg st in
let c =
[Instruction (movne rd r1 v1) ;
Instruction (branchcc rd lab) ;
Instruction (inc ok);] in
let ropt,init,cs,st = emit_access st p init e in
ropt,init,c@cs,st
else
let lab = Label.next_label "LC" in
let rd,st = next_reg st in
let c =
[Instruction (moveq rd r1 0) ;
Instruction (branchcc rd lab) ;
Label (lab,Nop);] in
let ropt,init,cs,st = emit_access st p init e in
ropt,init,c@cs,st
let emit_access_dep st p init e dp r1 n1 =
let v1 = n1.C.evt.C.v in
match dp with
| ADDR -> emit_access_dep_addr st p init e r1
| DATA -> emit_access_dep_data st p init e r1
| CTRL -> emit_access_ctrl st p init e r1 v1
let emit_rmw_dep _ = assert false
(* Check load *)
let do_check_load p st r e =
let ok,st = A.ok_reg st in
(fun k ->
Instruction (movne tempo1 r e.v)::
Instruction (branchcc tempo1 (Label.last p))::
Instruction (inc ok)::k),
A.next_ok st
let check_load p r e init st =
let cs,st = do_check_load p st r e in
init,cs,st
(* Postlude for adding exit label *)
let postlude = mk_postlude emit_store_reg
let get_xstore_results _ = []
include NoInfo
end
|