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
|
(****************************************************************************)
(* 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, ARM Ltd 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. *)
(****************************************************************************)
type sz = Byte | Short | Word | Quad | S128
let pp = function
| Byte -> "byte"
| Short -> "short"
| Word -> "word"
| Quad -> "quad"
| S128 -> "s128"
let pp_short = function
| Byte -> "b"
| Short -> "h"
| Word -> "w"
| Quad -> "q"
| S128 -> "s"
let debug = function
| Byte -> "Byte"
| Short -> "Short"
| Word -> "Word"
| Quad -> "Quad"
| S128 -> "S128"
let nbytes = function
| Byte -> 1
| Short -> 2
| Word -> 4
| Quad -> 8
| S128 -> 16
let log2bytes = function
| Byte -> 0
| Short -> 1
| Word -> 2
| Quad -> 3
| S128 -> 4
let nbits sz = nbytes sz * 8
(* check is 16 bit immediate *)
let is_imm16 n = n >= 0 && n < 65535
(* Correct endianess *)
let swap16 x =
let r = (x land 0xff) lsl 8 in
let r = r lor (x land 0xff00) lsr 8 in
r
(* k is total size (in bits) *)
let rec swap k x =
if k <= 16 then swap16 x
else
let k2 = k / 2 in
let mask = (1 lsl k2) - 1 in
let r1 = swap k2 (x land mask)
and r2 = swap k2 (x lsr k2) in
(r1 lsl k2) lor r2
let tr_endian sz = match sz with
| Byte -> fun x -> x
| Short -> swap16
| Word|Quad -> swap (nbits sz)
| S128 -> assert false
let l0 = [0;]
let l01 = [0;1;]
let l02 = [0;2;]
let l04 = [0;4;]
let l08 = [0;8;]
let l0123 = [0;1;2;3;]
let l0246 = [0;2;4;6;]
let l048c = [0;4;8;12;]
let l01234567 = [0;1;2;3;4;5;6;7;]
let l02468ace = [0;2;4;6;8;10;12;14;]
let l0123456789abcdef = [0;1;2;3;4;5;6;7;8;9;10;11;12;13;14;15;]
let off_byte = function
| Byte -> l0
| Short|Word|Quad|S128 -> []
let off_short = function
| Byte -> l01
| Short -> l0
| Word|Quad|S128 -> []
let off_word = function
| Byte -> l0123
| Short -> l02
| Word -> l0
| Quad|S128 -> []
let off_quad = function
| Byte -> l01234567
| Short -> l0246
| Word -> l04
| Quad -> l0
| S128 -> []
let off_s128 = function
| Byte -> l0123456789abcdef
| Short -> l02468ace
| Word -> l048c
| Quad -> l08
| S128 -> l0
let get_off sz = match sz with
| Byte -> off_byte
| Short -> off_short
| Word -> off_word
| Quad -> off_quad
| S128 -> off_s128
let get_off_reduced sz = match sz with
| Byte -> off_byte
| Short -> off_short
| Word ->
begin fun sz -> match sz with
| Byte -> []
| _ -> off_word sz
end
| Quad ->
begin fun sz -> match sz with
| Byte|Short -> []
| _ -> off_quad sz
end
| S128 ->
begin fun sz -> match sz with
| Byte|Short|Word -> []
| _ -> off_s128 sz
end
let compare sz1 sz2 = match sz1,sz2 with
| (Byte,(Short|Word|Quad|S128))
| (Short,(Word|Quad|S128))
| (Word,(Quad|S128))
| (Quad,S128)
-> -1
| (Byte,Byte)
| (Short,Short)
| (Word,Word)
| (Quad,Quad)
| (S128,S128)
-> 0
| ((Short|Word|Quad|S128),Byte)
| ((Word|Quad|S128),Short)
| ((Quad|S128),Word)
| (S128,Quad)
-> 1
let equal sz1 sz2 = compare sz1 sz2 = 0
let less_than_or_equal sz1 sz2 = compare sz1 sz2 <= 0
module Set =
MySet.Make
(struct
type t = sz
let compare = compare
end)
let min sz1 sz2 = if compare sz1 sz2 <= 0 then sz1 else sz2
let pred = function
| Byte|Short -> Byte
| Word -> Short
| Quad -> Word
| S128 -> Quad
let at_least_word = function
| Quad|S128 as sz -> sz
| Word|Short|Byte -> Word
module Tag = struct
type t = Auto | Size of sz
let tags = ["auto";"byte";"short";"word";"quad";"s128"]
let parse tag = match Misc.lowercase tag with
| "byte" -> Some (Size Byte)
| "short" -> Some (Size Short)
| "word" -> Some (Size Word)
| "quad" -> Some (Size Quad)
| "s128" -> Some (Size S128)
| "auto" -> Some Auto
| _ -> None
let pp = function
| Size sz -> pp sz
| Auto -> "auto"
end
(* Some size info for load reserve *)
type lr_sc =
| Ld of sz
| St
| No
(* MTE granule *)
let granule = S128
let granule_nbytes = nbytes granule
let granule_log2bytes = log2bytes granule
let granule_align x = (x / granule_nbytes) * granule_nbytes
|