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
|
(******************************************************************************)
(* 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. *)
(******************************************************************************)
(* Authors: *)
(* Hadrien Renaud, University College London, UK. *)
(* Luc Maranget, INRIA Paris-Rocquencourt, France. *)
(******************************************************************************)
(* Disclaimer: *)
(* This material covers both ASLv0 (viz, the existing ASL pseudocode language *)
(* which appears in the Arm Architecture Reference Manual) and ASLv1, a new, *)
(* experimental, and as yet unreleased version of ASL. *)
(* This material is work in progress, more precisely at pre-Alpha quality as *)
(* per Arm’s quality standards. *)
(* In particular, this means that it would be premature to base any *)
(* production tool development on this material. *)
(* However, any feedback, question, query and feature request would be most *)
(* welcome; those can be sent to Arm’s Architecture Formal Team Lead *)
(* Jade Alglave <jade.alglave@arm.com>, or by raising issues or PRs to the *)
(* herdtools7 github repository. *)
(******************************************************************************)
open Dir
module type Config = sig
val hexa: bool
end
module type S = sig
include Arch_herd.S
val is_local : reg -> bool
val is_pc : reg -> bool
end
module Make (C: Config) (A : S) = struct
module A = A
module V = A.V
type action =
| Access of dirn * A.location * A.V.v * MachSize.sz * AArch64Annot.t
| Barrier of A.barrier
| Branching of string option
| CutOff of string
| NoAction
let mk_init_write loc sz v = Access (W, loc, v, sz, AArch64Annot.N)
let pp_action = function
| Access (d, l, v, _sz,a) ->
Printf.sprintf "%s%s=%s%s"
(pp_dirn d) (A.pp_location l) (V.pp C.hexa v)
(let open AArch64Annot in
match a with
| N -> ""
| _ -> AArch64Annot.pp a)
| Barrier b -> A.pp_barrier_short b
| Branching txt ->
Printf.sprintf "Branching(%s)"
(Misc.app_opt_def "" Misc.identity txt)
| CutOff msg -> Printf.sprintf "CutOff:%s" msg
| NoAction -> ""
let is_local = function
| Access (_, A.Location_reg (_, r), _, _, _) -> A.is_local r
| Access _|Barrier _|Branching _|CutOff _|NoAction
-> false
(** Write to PC *)
let is_wpc = function
| Access (Dir.W, A.Location_reg (_, r), _, _, _) -> A.is_pc r
| _ -> false
(* Some architecture-specific sets and relations, with their definitions *)
let arch_sets = [ ("ASLLocal", is_local); ("WPC",is_wpc); ]
let arch_rels = []
let arch_dirty = []
let is_isync _ = false
let pp_isync = "ISYNC"
(**************************************)
(* Access to sub_components of events *)
(**************************************)
let value_of =
function
| Access (_, _, v, _, _) -> Some v
| Barrier _|Branching _|CutOff _|NoAction
-> None
let read_of =
function
| Access (R, _, v, _, _) -> Some v
| Access _|Barrier _|Branching _|CutOff _|NoAction
-> None
let written_of =
function
| Access (W, _, v, _, _) -> Some v
| Access _|Barrier _| Branching _|CutOff _|NoAction
-> None
let location_of =
function
| Access (_, l, _, _, _) -> Some l
| Branching _|Barrier _|CutOff _|NoAction
-> None
(************************)
(* Predicates on events *)
(************************)
(* relative to memory *)
let is_mem_store = function
| Access (W, A.Location_global _, _, _, _) -> true
| Access _| Branching _|Barrier _|CutOff _|NoAction
-> false
let is_mem_load = function
| Access (R, A.Location_global _, _, _, _) -> true
| Access _| Branching _|Barrier _|CutOff _|NoAction
-> false
let is_additional_mem_load = function
| Access _| Branching _|Barrier _|CutOff _|NoAction
-> false
let is_mem = function
| Access (_, A.Location_global _, _, _, _) -> true
| Access _| Branching _|Barrier _|CutOff _|NoAction
-> false
let is_ifetch = function
| Access _| Branching _|Barrier _|CutOff _|NoAction
-> false
let is_tag = function
| Access _| Branching _|Barrier _|CutOff _|NoAction
-> false
let is_additional_mem = function
| Access _| Branching _|Barrier _|CutOff _|NoAction
-> false
let is_atomic = function
| Access _| Branching _|Barrier _|CutOff _|NoAction
-> false
let is_fault = function
| Access _| Branching _|Barrier _|CutOff _|NoAction
-> false
let to_fault = function
| Access _| Branching _|Barrier _|CutOff _|NoAction
-> None
let get_mem_dir = function
| Access (d, A.Location_global _, _, _, _) -> d
| Access _| Branching _|Barrier _|CutOff _|NoAction
-> assert false
let get_mem_size = function
| Access (_, A.Location_global _, _, sz, _) -> sz
| Access _| Branching _|Barrier _|CutOff _|NoAction
-> assert false
let is_pte_access = function
| Access _| Branching _|Barrier _|CutOff _|NoAction
-> false
let is_explicit = function
| Access _| Branching _|Barrier _|CutOff _|NoAction
-> false
let is_not_explicit = function
| Access _| Branching _|Barrier _|CutOff _|NoAction
-> false
(* relative to the registers of the given proc *)
let is_reg_store = function
| Access (W, A.Location_reg (p, _), _, _, _) -> Proc.equal p
| Access _|Barrier _|Branching _|CutOff _|NoAction
->
fun _ -> false
let is_reg_load = function
| Access (R, A.Location_reg (p, _), _, _, _) -> Proc.equal p
| Access _|Barrier _|Branching _|CutOff _|NoAction
->
fun _ -> false
let is_reg = function
| Access (_, A.Location_reg (p, _), _, _, _) -> Proc.equal p
| Access _|Barrier _|Branching _|CutOff _|NoAction
-> fun _ -> false
(* Reg events, proc not specified *)
let is_reg_store_any = function
| Access (W, A.Location_reg _, _, _, _) -> true
| Access _|Barrier _|Branching _|CutOff _|NoAction
-> false
let is_reg_load_any = function
| Access (R, A.Location_reg _, _, _, _) -> true
| Access _|Barrier _|Branching _|CutOff _|NoAction
-> false
let is_reg_any = function
| Access (_, A.Location_reg _, _, _, _) -> true
| Access _|Barrier _|Branching _|CutOff _|NoAction
-> false
(* Store/Load to memory or register *)
let is_store =
function
| Access (W, _, _, _, _) -> true
| Access _|Barrier _|Branching _|CutOff _|NoAction
-> false
let is_load =
function
| Access (R, _, _, _, _) -> true
| Access _|Barrier _|Branching _|CutOff _|NoAction
-> false
(* Compatible accesses *)
let compatible_accesses _a1 _a2 = true
(* for bell annotations *)
let annot_in_list _str _act = false
(* Barriers *)
let is_barrier = function
| Barrier _ -> true
| Access _|Branching _|CutOff _|NoAction
-> false
let barrier_of = function
| Barrier b -> Some b
| Access _|Branching _|CutOff _|NoAction
-> None
let same_barrier_id _a1 _a2 = assert false
(* Commits *)
let is_bcc = function
| Access _| Branching _|Barrier _|CutOff _|NoAction
-> false
let is_pred ?(cond=None) = function
| Branching cond0 ->
Option.is_none cond || Option.equal String.equal cond cond0
| Access _|Barrier _|CutOff _|NoAction -> false
let is_commit = function
| Branching _ -> true
| Access _|Barrier _|CutOff _|NoAction -> false
(* Unrolling control *)
let cutoff msg = CutOff msg
let is_cutoff = function
| CutOff _ -> true
| Access _|Barrier _|Branching _|NoAction
-> false
and as_cutoff = function
| CutOff msg -> Some msg
| Access _|Barrier _|Branching _|NoAction
-> None
(********************)
(* Equation solving *)
(********************)
let undetermined_vars_in_action = function
| Access (_, l, v, _, _) ->
V.ValueSet.union (A.undetermined_vars_in_loc l) (V.undetermined_vars v)
| Barrier _ | Branching _| CutOff _ | NoAction -> V.ValueSet.empty
let simplify_vars_in_action soln a =
match a with
| Access (d, l, v, sz, a) ->
Access
(d, A.simplify_vars_in_loc soln l,
V.simplify_var soln v, sz, a)
| Barrier _ | Branching _ | CutOff _ | NoAction -> a
end
module FakeModuleForCheckingSignatures (C: Config) (A : S) : Action.S
with module A = A = Make (C) (A)
|