file_name
stringlengths
5
52
name
stringlengths
4
95
original_source_type
stringlengths
0
23k
source_type
stringlengths
9
23k
source_definition
stringlengths
9
57.9k
source
dict
source_range
dict
file_context
stringlengths
0
721k
dependencies
dict
opens_and_abbrevs
listlengths
2
94
vconfig
dict
interleaved
bool
1 class
verbose_type
stringlengths
1
7.42k
effect
stringclasses
118 values
effect_flags
listlengths
0
2
mutual_with
listlengths
0
11
ideal_premises
listlengths
0
236
proof_features
listlengths
0
1
is_simple_lemma
bool
2 classes
is_div
bool
2 classes
is_proof
bool
2 classes
is_simply_typed
bool
2 classes
is_type
bool
2 classes
partial_definition
stringlengths
5
3.99k
completed_definiton
stringlengths
1
1.63M
isa_cross_project_example
bool
1 class
LowStar.Vector.fst
LowStar.Vector.modifies_as_seq
val modifies_as_seq: #a:Type -> vec:vector a -> dloc:loc -> h0:HS.mem -> h1:HS.mem -> Lemma (requires (live h0 vec /\ loc_disjoint (loc_vector vec) dloc /\ modifies dloc h0 h1)) (ensures (live h1 vec /\ as_seq h0 vec == as_seq h1 vec)) [SMTPat (...
val modifies_as_seq: #a:Type -> vec:vector a -> dloc:loc -> h0:HS.mem -> h1:HS.mem -> Lemma (requires (live h0 vec /\ loc_disjoint (loc_vector vec) dloc /\ modifies dloc h0 h1)) (ensures (live h1 vec /\ as_seq h0 vec == as_seq h1 vec)) [SMTPat (...
let modifies_as_seq #a vec dloc h0 h1 = B.modifies_buffer_elim (Vec?.vs vec) dloc h0 h1
{ "file_name": "ulib/LowStar.Vector.fst", "git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3", "git_url": "https://github.com/FStarLang/FStar.git", "project_name": "FStar" }
{ "end_col": 49, "end_line": 232, "start_col": 0, "start_line": 231 }
(* Copyright 2008-2018 Microsoft Research Licensed under the Apache License, Version 2.0 (the "License"); you may not use this file except in compliance with the License. You may obtain a copy of the License at http://www.apache.org/licenses/LICENSE-2.0 Unless required by applicable law or agre...
{ "checked_file": "/", "dependencies": [ "prims.fst.checked", "LowStar.Modifies.fst.checked", "LowStar.Buffer.fst.checked", "FStar.UInt32.fsti.checked", "FStar.Set.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Map.fsti.checked", "FStar.Integers.f...
[ { "abbrev": true, "full_module": "FStar.UInt32", "short_module": "U32" }, { "abbrev": true, "full_module": "FStar.Seq", "short_module": "S" }, { "abbrev": true, "full_module": "LowStar.Buffer", "short_module": "B" }, { "abbrev": true, "full_module": "FStar.Hyp...
{ "detail_errors": false, "detail_hint_replay": false, "initial_fuel": 2, "initial_ifuel": 1, "max_fuel": 8, "max_ifuel": 2, "no_plugins": false, "no_smt": false, "no_tactics": false, "quake_hi": 1, "quake_keep": false, "quake_lo": 1, "retry": false, "reuse_hint_for": null, "smtencoding_el...
false
vec: LowStar.Vector.vector a -> dloc: LowStar.Monotonic.Buffer.loc -> h0: FStar.Monotonic.HyperStack.mem -> h1: FStar.Monotonic.HyperStack.mem -> FStar.Pervasives.Lemma (requires LowStar.Vector.live h0 vec /\ LowStar.Monotonic.Buffer.loc_disjoint (LowStar.Vector.loc_vector vec) ...
FStar.Pervasives.Lemma
[ "lemma" ]
[]
[ "LowStar.Vector.vector", "LowStar.Monotonic.Buffer.loc", "FStar.Monotonic.HyperStack.mem", "LowStar.Monotonic.Buffer.modifies_buffer_elim", "LowStar.Buffer.trivial_preorder", "LowStar.Vector.__proj__Vec__item__vs", "Prims.unit" ]
[]
true
false
true
false
false
let modifies_as_seq #a vec dloc h0 h1 =
B.modifies_buffer_elim (Vec?.vs vec) dloc h0 h1
false
LowStar.Vector.fst
LowStar.Vector.loc_vector_within
val loc_vector_within: #a:Type -> vec:vector a -> i:uint32_t -> j:uint32_t{i <= j && j <= size_of vec} -> GTot loc (decreases (U32.v (j - i)))
val loc_vector_within: #a:Type -> vec:vector a -> i:uint32_t -> j:uint32_t{i <= j && j <= size_of vec} -> GTot loc (decreases (U32.v (j - i)))
let rec loc_vector_within #a vec i j = if i = j then loc_none else loc_union (B.loc_buffer (B.gsub (Vec?.vs vec) i 1ul)) (loc_vector_within vec (i + 1ul) j)
{ "file_name": "ulib/LowStar.Vector.fst", "git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3", "git_url": "https://github.com/FStarLang/FStar.git", "project_name": "FStar" }
{ "end_col": 52, "end_line": 115, "start_col": 0, "start_line": 112 }
(* Copyright 2008-2018 Microsoft Research Licensed under the Apache License, Version 2.0 (the "License"); you may not use this file except in compliance with the License. You may obtain a copy of the License at http://www.apache.org/licenses/LICENSE-2.0 Unless required by applicable law or agre...
{ "checked_file": "/", "dependencies": [ "prims.fst.checked", "LowStar.Modifies.fst.checked", "LowStar.Buffer.fst.checked", "FStar.UInt32.fsti.checked", "FStar.Set.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Map.fsti.checked", "FStar.Integers.f...
[ { "abbrev": true, "full_module": "FStar.UInt32", "short_module": "U32" }, { "abbrev": true, "full_module": "FStar.Seq", "short_module": "S" }, { "abbrev": true, "full_module": "LowStar.Buffer", "short_module": "B" }, { "abbrev": true, "full_module": "FStar.Hyp...
{ "detail_errors": false, "detail_hint_replay": false, "initial_fuel": 2, "initial_ifuel": 1, "max_fuel": 8, "max_ifuel": 2, "no_plugins": false, "no_smt": false, "no_tactics": false, "quake_hi": 1, "quake_keep": false, "quake_lo": 1, "retry": false, "reuse_hint_for": null, "smtencoding_el...
false
vec: LowStar.Vector.vector a -> i: LowStar.Vector.uint32_t -> j: LowStar.Vector.uint32_t{i <= j && j <= LowStar.Vector.size_of vec} -> Prims.GTot LowStar.Monotonic.Buffer.loc
Prims.GTot
[ "sometrivial", "" ]
[]
[ "LowStar.Vector.vector", "LowStar.Vector.uint32_t", "Prims.b2t", "Prims.op_AmpAmp", "FStar.Integers.op_Less_Equals", "FStar.Integers.Unsigned", "FStar.Integers.W32", "LowStar.Vector.size_of", "Prims.op_Equality", "LowStar.Monotonic.Buffer.loc_none", "Prims.bool", "LowStar.Monotonic.Buffer.loc_...
[ "recursion" ]
false
false
false
false
false
let rec loc_vector_within #a vec i j =
if i = j then loc_none else loc_union (B.loc_buffer (B.gsub (Vec?.vs vec) i 1ul)) (loc_vector_within vec (i + 1ul) j)
false
LowStar.Vector.fst
LowStar.Vector.alloc_empty
val alloc_empty: a:Type -> Tot (vec:vector a{size_of vec = 0ul})
val alloc_empty: a:Type -> Tot (vec:vector a{size_of vec = 0ul})
let alloc_empty a = Vec 0ul 0ul B.null
{ "file_name": "ulib/LowStar.Vector.fst", "git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3", "git_url": "https://github.com/FStarLang/FStar.git", "project_name": "FStar" }
{ "end_col": 20, "end_line": 265, "start_col": 22, "start_line": 264 }
(* Copyright 2008-2018 Microsoft Research Licensed under the Apache License, Version 2.0 (the "License"); you may not use this file except in compliance with the License. You may obtain a copy of the License at http://www.apache.org/licenses/LICENSE-2.0 Unless required by applicable law or agre...
{ "checked_file": "/", "dependencies": [ "prims.fst.checked", "LowStar.Modifies.fst.checked", "LowStar.Buffer.fst.checked", "FStar.UInt32.fsti.checked", "FStar.Set.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Map.fsti.checked", "FStar.Integers.f...
[ { "abbrev": true, "full_module": "FStar.UInt32", "short_module": "U32" }, { "abbrev": true, "full_module": "FStar.Seq", "short_module": "S" }, { "abbrev": true, "full_module": "LowStar.Buffer", "short_module": "B" }, { "abbrev": true, "full_module": "FStar.Hyp...
{ "detail_errors": false, "detail_hint_replay": false, "initial_fuel": 2, "initial_ifuel": 1, "max_fuel": 8, "max_ifuel": 2, "no_plugins": false, "no_smt": false, "no_tactics": false, "quake_hi": 1, "quake_keep": false, "quake_lo": 1, "retry": false, "reuse_hint_for": null, "smtencoding_el...
false
a: Type0 -> vec: LowStar.Vector.vector a {LowStar.Vector.size_of vec = 0ul}
Prims.Tot
[ "total" ]
[]
[ "LowStar.Vector.Vec", "FStar.UInt32.__uint_to_t", "LowStar.Buffer.null", "LowStar.Vector.vector", "Prims.b2t", "Prims.op_Equality", "FStar.UInt32.t", "LowStar.Vector.size_of" ]
[]
false
false
false
false
false
let alloc_empty a =
Vec 0ul 0ul B.null
false
Vale.Transformers.Locations.fst
Vale.Transformers.Locations.aux_print_reg_from_location
val aux_print_reg_from_location (a: location{ALocReg? a}) : string
val aux_print_reg_from_location (a: location{ALocReg? a}) : string
let aux_print_reg_from_location (a:location{ALocReg? a}) : string = let ALocReg (Reg file id) = a in match file with | 0 -> print_reg_name id | 1 -> print_xmm id gcc
{ "file_name": "vale/code/lib/transformers/Vale.Transformers.Locations.fst", "git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872", "git_url": "https://github.com/project-everest/hacl-star.git", "project_name": "hacl-star" }
{ "end_col": 25, "end_line": 28, "start_col": 0, "start_line": 24 }
module Vale.Transformers.Locations open Vale.Arch.HeapTypes_s open Vale.Arch.Heap open Vale.X64.Bytes_Code_s open Vale.X64.Instruction_s open Vale.X64.Instructions_s open Vale.X64.Machine_Semantics_s open Vale.X64.Machine_s open Vale.X64.Print_s open Vale.Def.PossiblyMonad module L = FStar.List.Tot (* See fsti *) t...
{ "checked_file": "/", "dependencies": [ "Vale.X64.Print_s.fst.checked", "Vale.X64.Machine_Semantics_s.fst.checked", "Vale.X64.Machine_s.fst.checked", "Vale.X64.Instructions_s.fsti.checked", "Vale.X64.Instruction_s.fsti.checked", "Vale.X64.Bytes_Code_s.fst.checked", "Vale.Def.PossiblyMon...
[ { "abbrev": true, "full_module": "FStar.List.Tot", "short_module": "L" }, { "abbrev": false, "full_module": "Vale.Def.PossiblyMonad", "short_module": null }, { "abbrev": false, "full_module": "Vale.X64.Print_s", "short_module": null }, { "abbrev": false, "full...
{ "detail_errors": false, "detail_hint_replay": false, "initial_fuel": 2, "initial_ifuel": 0, "max_fuel": 1, "max_ifuel": 1, "no_plugins": false, "no_smt": false, "no_tactics": false, "quake_hi": 1, "quake_keep": false, "quake_lo": 1, "retry": false, "reuse_hint_for": null, "smtencoding_el...
false
a: Vale.Transformers.Locations.location{ALocReg? a} -> Prims.string
Prims.Tot
[ "total" ]
[]
[ "Vale.Transformers.Locations.location", "Prims.b2t", "Vale.Transformers.Locations.uu___is_ALocReg", "Vale.X64.Machine_s.reg_file_id", "Vale.X64.Machine_s.reg_id", "Vale.X64.Print_s.print_reg_name", "Vale.X64.Print_s.print_xmm", "Vale.X64.Print_s.gcc", "Prims.string" ]
[]
false
false
false
false
false
let aux_print_reg_from_location (a: location{ALocReg? a}) : string =
let ALocReg (Reg file id) = a in match file with | 0 -> print_reg_name id | 1 -> print_xmm id gcc
false
Vale.Transformers.Locations.fst
Vale.Transformers.Locations.location_val_eqt
val location_val_eqt : location -> eqtype
val location_val_eqt : location -> eqtype
let location_val_eqt a = match a with | ALocMem -> unit | ALocStack -> unit | ALocReg r -> t_reg r | ALocCf -> flag_val_t | ALocOf -> flag_val_t
{ "file_name": "vale/code/lib/transformers/Vale.Transformers.Locations.fst", "git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872", "git_url": "https://github.com/project-everest/hacl-star.git", "project_name": "hacl-star" }
{ "end_col": 24, "end_line": 65, "start_col": 0, "start_line": 59 }
module Vale.Transformers.Locations open Vale.Arch.HeapTypes_s open Vale.Arch.Heap open Vale.X64.Bytes_Code_s open Vale.X64.Instruction_s open Vale.X64.Instructions_s open Vale.X64.Machine_Semantics_s open Vale.X64.Machine_s open Vale.X64.Print_s open Vale.Def.PossiblyMonad module L = FStar.List.Tot (* See fsti *) t...
{ "checked_file": "/", "dependencies": [ "Vale.X64.Print_s.fst.checked", "Vale.X64.Machine_Semantics_s.fst.checked", "Vale.X64.Machine_s.fst.checked", "Vale.X64.Instructions_s.fsti.checked", "Vale.X64.Instruction_s.fsti.checked", "Vale.X64.Bytes_Code_s.fst.checked", "Vale.Def.PossiblyMon...
[ { "abbrev": true, "full_module": "FStar.List.Tot", "short_module": "L" }, { "abbrev": false, "full_module": "Vale.Def.PossiblyMonad", "short_module": null }, { "abbrev": false, "full_module": "Vale.X64.Print_s", "short_module": null }, { "abbrev": false, "full...
{ "detail_errors": false, "detail_hint_replay": false, "initial_fuel": 2, "initial_ifuel": 0, "max_fuel": 1, "max_ifuel": 1, "no_plugins": false, "no_smt": false, "no_tactics": false, "quake_hi": 1, "quake_keep": false, "quake_lo": 1, "retry": false, "reuse_hint_for": null, "smtencoding_el...
false
a: Vale.Transformers.Locations.location -> Prims.eqtype
Prims.Tot
[ "total" ]
[]
[ "Vale.Transformers.Locations.location", "Prims.unit", "Vale.X64.Machine_s.reg", "Vale.X64.Machine_s.t_reg", "Vale.X64.Machine_Semantics_s.flag_val_t", "Prims.eqtype" ]
[]
false
false
false
true
false
let location_val_eqt a =
match a with | ALocMem -> unit | ALocStack -> unit | ALocReg r -> t_reg r | ALocCf -> flag_val_t | ALocOf -> flag_val_t
false
LowStar.Vector.fst
LowStar.Vector.index
val index: #a:Type -> vec:vector a -> i:uint32_t -> HST.ST a (requires (fun h0 -> live h0 vec /\ i < size_of vec)) (ensures (fun h0 v h1 -> h0 == h1 /\ S.index (as_seq h1 vec) (U32.v i) == v))
val index: #a:Type -> vec:vector a -> i:uint32_t -> HST.ST a (requires (fun h0 -> live h0 vec /\ i < size_of vec)) (ensures (fun h0 v h1 -> h0 == h1 /\ S.index (as_seq h1 vec) (U32.v i) == v))
let index #a vec i = B.index (Vec?.vs vec) i
{ "file_name": "ulib/LowStar.Vector.fst", "git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3", "git_url": "https://github.com/FStarLang/FStar.git", "project_name": "FStar" }
{ "end_col": 25, "end_line": 367, "start_col": 0, "start_line": 366 }
(* Copyright 2008-2018 Microsoft Research Licensed under the Apache License, Version 2.0 (the "License"); you may not use this file except in compliance with the License. You may obtain a copy of the License at http://www.apache.org/licenses/LICENSE-2.0 Unless required by applicable law or agre...
{ "checked_file": "/", "dependencies": [ "prims.fst.checked", "LowStar.Modifies.fst.checked", "LowStar.Buffer.fst.checked", "FStar.UInt32.fsti.checked", "FStar.Set.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Map.fsti.checked", "FStar.Integers.f...
[ { "abbrev": true, "full_module": "FStar.UInt32", "short_module": "U32" }, { "abbrev": true, "full_module": "FStar.Seq", "short_module": "S" }, { "abbrev": true, "full_module": "LowStar.Buffer", "short_module": "B" }, { "abbrev": true, "full_module": "FStar.Hyp...
{ "detail_errors": false, "detail_hint_replay": false, "initial_fuel": 2, "initial_ifuel": 1, "max_fuel": 8, "max_ifuel": 2, "no_plugins": false, "no_smt": false, "no_tactics": false, "quake_hi": 1, "quake_keep": false, "quake_lo": 1, "retry": false, "reuse_hint_for": null, "smtencoding_el...
false
vec: LowStar.Vector.vector a -> i: LowStar.Vector.uint32_t -> FStar.HyperStack.ST.ST a
FStar.HyperStack.ST.ST
[]
[]
[ "LowStar.Vector.vector", "LowStar.Vector.uint32_t", "LowStar.Monotonic.Buffer.index", "LowStar.Buffer.trivial_preorder", "LowStar.Vector.__proj__Vec__item__vs" ]
[]
false
true
false
false
false
let index #a vec i =
B.index (Vec?.vs vec) i
false
Vale.Transformers.Locations.fst
Vale.Transformers.Locations.lemma_locations_complete
val lemma_locations_complete : s1:machine_state -> s2:machine_state -> flags:flags_t -> ok:bool -> trace:list observation -> Lemma (requires ( (forall a. eval_location a s1 == eval_location a s2))) (ensures ( filter_state s1 flags ok trace == filter_state s2 flags ok trace))
val lemma_locations_complete : s1:machine_state -> s2:machine_state -> flags:flags_t -> ok:bool -> trace:list observation -> Lemma (requires ( (forall a. eval_location a s1 == eval_location a s2))) (ensures ( filter_state s1 flags ok trace == filter_state s2 flags ok trace))
let lemma_locations_complete s1 s2 flags ok trace = let s1, s2 = filter_state s1 flags ok trace, filter_state s2 flags ok trace in assert (s1.ms_ok == s2.ms_ok); FStar.Classical.forall_intro ( (fun r -> assert (eval_location (ALocReg r) s1 == eval_location (ALocReg r) s2) (* OBSERVE *) ) <:...
{ "file_name": "vale/code/lib/transformers/Vale.Transformers.Locations.fst", "git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872", "git_url": "https://github.com/project-everest/hacl-star.git", "project_name": "hacl-star" }
{ "end_col": 37, "end_line": 117, "start_col": 0, "start_line": 99 }
module Vale.Transformers.Locations open Vale.Arch.HeapTypes_s open Vale.Arch.Heap open Vale.X64.Bytes_Code_s open Vale.X64.Instruction_s open Vale.X64.Instructions_s open Vale.X64.Machine_Semantics_s open Vale.X64.Machine_s open Vale.X64.Print_s open Vale.Def.PossiblyMonad module L = FStar.List.Tot (* See fsti *) t...
{ "checked_file": "/", "dependencies": [ "Vale.X64.Print_s.fst.checked", "Vale.X64.Machine_Semantics_s.fst.checked", "Vale.X64.Machine_s.fst.checked", "Vale.X64.Instructions_s.fsti.checked", "Vale.X64.Instruction_s.fsti.checked", "Vale.X64.Bytes_Code_s.fst.checked", "Vale.Def.PossiblyMon...
[ { "abbrev": true, "full_module": "FStar.List.Tot", "short_module": "L" }, { "abbrev": false, "full_module": "Vale.Def.PossiblyMonad", "short_module": null }, { "abbrev": false, "full_module": "Vale.X64.Print_s", "short_module": null }, { "abbrev": false, "full...
{ "detail_errors": false, "detail_hint_replay": false, "initial_fuel": 2, "initial_ifuel": 0, "max_fuel": 1, "max_ifuel": 1, "no_plugins": false, "no_smt": false, "no_tactics": false, "quake_hi": 1, "quake_keep": false, "quake_lo": 1, "retry": false, "reuse_hint_for": null, "smtencoding_el...
false
s1: Vale.X64.Machine_Semantics_s.machine_state -> s2: Vale.X64.Machine_Semantics_s.machine_state -> flags: Vale.X64.Machine_Semantics_s.flags_t -> ok: Prims.bool -> trace: Prims.list Vale.X64.Machine_s.observation -> FStar.Pervasives.Lemma (requires forall (a: Vale.Transformers.Loca...
FStar.Pervasives.Lemma
[ "lemma" ]
[]
[ "Vale.X64.Machine_Semantics_s.machine_state", "Vale.X64.Machine_Semantics_s.flags_t", "Prims.bool", "Prims.list", "Vale.X64.Machine_s.observation", "Prims._assert", "Prims.eq2", "Vale.X64.Machine_Semantics_s.__proj__Mkmachine_state__item__ms_trace", "Prims.unit", "Vale.Arch.HeapTypes_s.memTaint_t"...
[]
false
false
true
false
false
let lemma_locations_complete s1 s2 flags ok trace =
let s1, s2 = filter_state s1 flags ok trace, filter_state s2 flags ok trace in assert (s1.ms_ok == s2.ms_ok); FStar.Classical.forall_intro ((fun r -> assert (eval_location (ALocReg r) s1 == eval_location (ALocReg r) s2)) <: (r: _ -> Lemma (eval_reg r s1 == eval_reg r s2))); assert (FStar.FunctionalExten...
false
Hacl.Test.HMAC_DRBG.fst
Hacl.Test.HMAC_DRBG.vec8
val vec8 : Type0
let vec8 = L.lbuffer UInt8.t
{ "file_name": "code/tests/Hacl.Test.HMAC_DRBG.fst", "git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872", "git_url": "https://github.com/project-everest/hacl-star.git", "project_name": "hacl-star" }
{ "end_col": 28, "end_line": 31, "start_col": 0, "start_line": 31 }
module Hacl.Test.HMAC_DRBG open FStar.HyperStack.ST open Test.Lowstarize open Lib.IntTypes open Hacl.HMAC_DRBG open Spec.HMAC_DRBG.Test.Vectors module D = Spec.Hash.Definitions module L = Test.Lowstarize module B = LowStar.Buffer #set-options "--fuel 0 --ifuel 0 --z3rlimit 100" (* FStar.Reflection only supports u...
{ "checked_file": "/", "dependencies": [ "Test.Lowstarize.fst.checked", "Spec.HMAC_DRBG.Test.Vectors.fst.checked", "Spec.HMAC_DRBG.fsti.checked", "Spec.Hash.Definitions.fst.checked", "prims.fst.checked", "LowStar.Printf.fst.checked", "LowStar.BufferOps.fst.checked", "LowStar.Buffer.f...
[ { "abbrev": true, "full_module": "LowStar.Buffer", "short_module": "B" }, { "abbrev": true, "full_module": "Test.Lowstarize", "short_module": "L" }, { "abbrev": true, "full_module": "Spec.Hash.Definitions", "short_module": "D" }, { "abbrev": false, "full_modul...
{ "detail_errors": false, "detail_hint_replay": false, "initial_fuel": 0, "initial_ifuel": 0, "max_fuel": 0, "max_ifuel": 0, "no_plugins": false, "no_smt": false, "no_tactics": false, "quake_hi": 1, "quake_keep": false, "quake_lo": 1, "retry": false, "reuse_hint_for": null, "smtencoding_el...
false
Type0
Prims.Tot
[ "total" ]
[]
[ "Test.Lowstarize.lbuffer", "FStar.UInt8.t" ]
[]
false
false
false
true
true
let vec8 =
L.lbuffer UInt8.t
false
LowStar.Vector.fst
LowStar.Vector.free
val free: #a:Type -> vec:vector a -> HST.ST unit (requires (fun h0 -> live h0 vec /\ freeable vec)) (ensures (fun h0 _ h1 -> modifies (loc_addr_of_vector vec) h0 h1))
val free: #a:Type -> vec:vector a -> HST.ST unit (requires (fun h0 -> live h0 vec /\ freeable vec)) (ensures (fun h0 _ h1 -> modifies (loc_addr_of_vector vec) h0 h1))
let free #a vec = B.free (Vec?.vs vec)
{ "file_name": "ulib/LowStar.Vector.fst", "git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3", "git_url": "https://github.com/FStarLang/FStar.git", "project_name": "FStar" }
{ "end_col": 22, "end_line": 350, "start_col": 0, "start_line": 349 }
(* Copyright 2008-2018 Microsoft Research Licensed under the Apache License, Version 2.0 (the "License"); you may not use this file except in compliance with the License. You may obtain a copy of the License at http://www.apache.org/licenses/LICENSE-2.0 Unless required by applicable law or agre...
{ "checked_file": "/", "dependencies": [ "prims.fst.checked", "LowStar.Modifies.fst.checked", "LowStar.Buffer.fst.checked", "FStar.UInt32.fsti.checked", "FStar.Set.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Map.fsti.checked", "FStar.Integers.f...
[ { "abbrev": true, "full_module": "FStar.UInt32", "short_module": "U32" }, { "abbrev": true, "full_module": "FStar.Seq", "short_module": "S" }, { "abbrev": true, "full_module": "LowStar.Buffer", "short_module": "B" }, { "abbrev": true, "full_module": "FStar.Hyp...
{ "detail_errors": false, "detail_hint_replay": false, "initial_fuel": 2, "initial_ifuel": 1, "max_fuel": 8, "max_ifuel": 2, "no_plugins": false, "no_smt": false, "no_tactics": false, "quake_hi": 1, "quake_keep": false, "quake_lo": 1, "retry": false, "reuse_hint_for": null, "smtencoding_el...
false
vec: LowStar.Vector.vector a -> FStar.HyperStack.ST.ST Prims.unit
FStar.HyperStack.ST.ST
[]
[]
[ "LowStar.Vector.vector", "LowStar.Monotonic.Buffer.free", "LowStar.Buffer.trivial_preorder", "LowStar.Vector.__proj__Vec__item__vs", "Prims.unit" ]
[]
false
true
false
false
false
let free #a vec =
B.free (Vec?.vs vec)
false
LowStar.Vector.fst
LowStar.Vector.clear
val clear: #a:Type -> vec:vector a -> Tot (cvec:vector a{size_of cvec = 0ul})
val clear: #a:Type -> vec:vector a -> Tot (cvec:vector a{size_of cvec = 0ul})
let clear #a vec = Vec 0ul (Vec?.cap vec) (Vec?.vs vec)
{ "file_name": "ulib/LowStar.Vector.fst", "git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3", "git_url": "https://github.com/FStarLang/FStar.git", "project_name": "FStar" }
{ "end_col": 38, "end_line": 393, "start_col": 0, "start_line": 392 }
(* Copyright 2008-2018 Microsoft Research Licensed under the Apache License, Version 2.0 (the "License"); you may not use this file except in compliance with the License. You may obtain a copy of the License at http://www.apache.org/licenses/LICENSE-2.0 Unless required by applicable law or agre...
{ "checked_file": "/", "dependencies": [ "prims.fst.checked", "LowStar.Modifies.fst.checked", "LowStar.Buffer.fst.checked", "FStar.UInt32.fsti.checked", "FStar.Set.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Map.fsti.checked", "FStar.Integers.f...
[ { "abbrev": true, "full_module": "FStar.UInt32", "short_module": "U32" }, { "abbrev": true, "full_module": "FStar.Seq", "short_module": "S" }, { "abbrev": true, "full_module": "LowStar.Buffer", "short_module": "B" }, { "abbrev": true, "full_module": "FStar.Hyp...
{ "detail_errors": false, "detail_hint_replay": false, "initial_fuel": 2, "initial_ifuel": 1, "max_fuel": 8, "max_ifuel": 2, "no_plugins": false, "no_smt": false, "no_tactics": false, "quake_hi": 1, "quake_keep": false, "quake_lo": 1, "retry": false, "reuse_hint_for": null, "smtencoding_el...
false
vec: LowStar.Vector.vector a -> cvec: LowStar.Vector.vector a {LowStar.Vector.size_of cvec = 0ul}
Prims.Tot
[ "total" ]
[]
[ "LowStar.Vector.vector", "LowStar.Vector.Vec", "FStar.UInt32.__uint_to_t", "LowStar.Vector.__proj__Vec__item__cap", "LowStar.Vector.__proj__Vec__item__vs", "Prims.b2t", "Prims.op_Equality", "FStar.UInt32.t", "LowStar.Vector.size_of" ]
[]
false
false
false
false
false
let clear #a vec =
Vec 0ul (Vec?.cap vec) (Vec?.vs vec)
false
LowStar.Vector.fst
LowStar.Vector.loc_vector_within_included
val loc_vector_within_included: #a:Type -> vec:vector a -> i:uint32_t -> j:uint32_t{i <= j && j <= size_of vec} -> Lemma (requires True) (ensures (loc_includes (loc_vector vec) (loc_vector_within vec i j))) (decreases (U32.v (j - i)))
val loc_vector_within_included: #a:Type -> vec:vector a -> i:uint32_t -> j:uint32_t{i <= j && j <= size_of vec} -> Lemma (requires True) (ensures (loc_includes (loc_vector vec) (loc_vector_within vec i j))) (decreases (U32.v (j - i)))
let rec loc_vector_within_included #a vec i j = if i = j then () else loc_vector_within_included vec (i + 1ul) j
{ "file_name": "ulib/LowStar.Vector.fst", "git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3", "git_url": "https://github.com/FStarLang/FStar.git", "project_name": "FStar" }
{ "end_col": 49, "end_line": 166, "start_col": 0, "start_line": 164 }
(* Copyright 2008-2018 Microsoft Research Licensed under the Apache License, Version 2.0 (the "License"); you may not use this file except in compliance with the License. You may obtain a copy of the License at http://www.apache.org/licenses/LICENSE-2.0 Unless required by applicable law or agre...
{ "checked_file": "/", "dependencies": [ "prims.fst.checked", "LowStar.Modifies.fst.checked", "LowStar.Buffer.fst.checked", "FStar.UInt32.fsti.checked", "FStar.Set.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Map.fsti.checked", "FStar.Integers.f...
[ { "abbrev": true, "full_module": "FStar.UInt32", "short_module": "U32" }, { "abbrev": true, "full_module": "FStar.Seq", "short_module": "S" }, { "abbrev": true, "full_module": "LowStar.Buffer", "short_module": "B" }, { "abbrev": true, "full_module": "FStar.Hyp...
{ "detail_errors": false, "detail_hint_replay": false, "initial_fuel": 2, "initial_ifuel": 1, "max_fuel": 8, "max_ifuel": 2, "no_plugins": false, "no_smt": false, "no_tactics": false, "quake_hi": 1, "quake_keep": false, "quake_lo": 1, "retry": false, "reuse_hint_for": null, "smtencoding_el...
false
vec: LowStar.Vector.vector a -> i: LowStar.Vector.uint32_t -> j: LowStar.Vector.uint32_t{i <= j && j <= LowStar.Vector.size_of vec} -> FStar.Pervasives.Lemma (ensures LowStar.Monotonic.Buffer.loc_includes (LowStar.Vector.loc_vector vec) (LowStar.Vector.loc_vector_within vec i j)) ...
FStar.Pervasives.Lemma
[ "lemma", "" ]
[]
[ "LowStar.Vector.vector", "LowStar.Vector.uint32_t", "Prims.b2t", "Prims.op_AmpAmp", "FStar.Integers.op_Less_Equals", "FStar.Integers.Unsigned", "FStar.Integers.W32", "LowStar.Vector.size_of", "Prims.op_Equality", "Prims.bool", "LowStar.Vector.loc_vector_within_included", "FStar.Integers.op_Plu...
[ "recursion" ]
false
false
true
false
false
let rec loc_vector_within_included #a vec i j =
if i = j then () else loc_vector_within_included vec (i + 1ul) j
false
LowStar.Vector.fst
LowStar.Vector.loc_vector_within_includes_
val loc_vector_within_includes_: #a:Type -> vec:vector a -> i:uint32_t -> j1:uint32_t{i <= j1 && j1 <= size_of vec} -> j2:uint32_t{i <= j2 && j2 <= j1} -> Lemma (requires True) (ensures (loc_includes (loc_vector_within vec i j1) (loc_vector_within vec i j2))) (de...
val loc_vector_within_includes_: #a:Type -> vec:vector a -> i:uint32_t -> j1:uint32_t{i <= j1 && j1 <= size_of vec} -> j2:uint32_t{i <= j2 && j2 <= j1} -> Lemma (requires True) (ensures (loc_includes (loc_vector_within vec i j1) (loc_vector_within vec i j2))) (de...
let rec loc_vector_within_includes_ #a vec i j1 j2 = if i = j1 then () else if i = j2 then () else begin loc_vector_within_includes_ vec (i + 1ul) j1 j2; loc_includes_union_l (B.loc_buffer (B.gsub (Vec?.vs vec) i 1ul)) (loc_vector_within vec (i + 1ul) j1) ...
{ "file_name": "ulib/LowStar.Vector.fst", "git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3", "git_url": "https://github.com/FStarLang/FStar.git", "project_name": "FStar" }
{ "end_col": 5, "end_line": 137, "start_col": 0, "start_line": 126 }
(* Copyright 2008-2018 Microsoft Research Licensed under the Apache License, Version 2.0 (the "License"); you may not use this file except in compliance with the License. You may obtain a copy of the License at http://www.apache.org/licenses/LICENSE-2.0 Unless required by applicable law or agre...
{ "checked_file": "/", "dependencies": [ "prims.fst.checked", "LowStar.Modifies.fst.checked", "LowStar.Buffer.fst.checked", "FStar.UInt32.fsti.checked", "FStar.Set.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Map.fsti.checked", "FStar.Integers.f...
[ { "abbrev": true, "full_module": "FStar.UInt32", "short_module": "U32" }, { "abbrev": true, "full_module": "FStar.Seq", "short_module": "S" }, { "abbrev": true, "full_module": "LowStar.Buffer", "short_module": "B" }, { "abbrev": true, "full_module": "FStar.Hyp...
{ "detail_errors": false, "detail_hint_replay": false, "initial_fuel": 2, "initial_ifuel": 1, "max_fuel": 8, "max_ifuel": 2, "no_plugins": false, "no_smt": false, "no_tactics": false, "quake_hi": 1, "quake_keep": false, "quake_lo": 1, "retry": false, "reuse_hint_for": null, "smtencoding_el...
false
vec: LowStar.Vector.vector a -> i: LowStar.Vector.uint32_t -> j1: LowStar.Vector.uint32_t{i <= j1 && j1 <= LowStar.Vector.size_of vec} -> j2: LowStar.Vector.uint32_t{i <= j2 && j2 <= j1} -> FStar.Pervasives.Lemma (ensures LowStar.Monotonic.Buffer.loc_includes (LowStar.Vector.loc_vector_...
FStar.Pervasives.Lemma
[ "lemma", "" ]
[]
[ "LowStar.Vector.vector", "LowStar.Vector.uint32_t", "Prims.b2t", "Prims.op_AmpAmp", "FStar.Integers.op_Less_Equals", "FStar.Integers.Unsigned", "FStar.Integers.W32", "LowStar.Vector.size_of", "Prims.op_Equality", "Prims.bool", "LowStar.Monotonic.Buffer.loc_includes_union_r", "LowStar.Vector.lo...
[ "recursion" ]
false
false
true
false
false
let rec loc_vector_within_includes_ #a vec i j1 j2 =
if i = j1 then () else if i = j2 then () else (loc_vector_within_includes_ vec (i + 1ul) j1 j2; loc_includes_union_l (B.loc_buffer (B.gsub (Vec?.vs vec) i 1ul)) (loc_vector_within vec (i + 1ul) j1) (loc_vector_within vec (i + 1ul) j2); loc_includes_union_r (loc_vector_within vec i ...
false
LowStar.Vector.fst
LowStar.Vector.alloc_reserve
val alloc_reserve: #a:Type -> len:uint32_t{len > 0ul} -> ia:a -> rid:HS.rid{HST.is_eternal_region rid} -> HST.ST (vector a) (requires (fun h0 -> true)) (ensures (fun h0 vec h1 -> frameOf vec = rid /\ live h1 vec /\ freeable vec /\ modifies loc_none h0 h1 /\ B.fre...
val alloc_reserve: #a:Type -> len:uint32_t{len > 0ul} -> ia:a -> rid:HS.rid{HST.is_eternal_region rid} -> HST.ST (vector a) (requires (fun h0 -> true)) (ensures (fun h0 vec h1 -> frameOf vec = rid /\ live h1 vec /\ freeable vec /\ modifies loc_none h0 h1 /\ B.fre...
let alloc_reserve #a len ia rid = Vec 0ul len (B.malloc rid ia len)
{ "file_name": "ulib/LowStar.Vector.fst", "git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3", "git_url": "https://github.com/FStarLang/FStar.git", "project_name": "FStar" }
{ "end_col": 35, "end_line": 324, "start_col": 0, "start_line": 323 }
(* Copyright 2008-2018 Microsoft Research Licensed under the Apache License, Version 2.0 (the "License"); you may not use this file except in compliance with the License. You may obtain a copy of the License at http://www.apache.org/licenses/LICENSE-2.0 Unless required by applicable law or agre...
{ "checked_file": "/", "dependencies": [ "prims.fst.checked", "LowStar.Modifies.fst.checked", "LowStar.Buffer.fst.checked", "FStar.UInt32.fsti.checked", "FStar.Set.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Map.fsti.checked", "FStar.Integers.f...
[ { "abbrev": true, "full_module": "FStar.UInt32", "short_module": "U32" }, { "abbrev": true, "full_module": "FStar.Seq", "short_module": "S" }, { "abbrev": true, "full_module": "LowStar.Buffer", "short_module": "B" }, { "abbrev": true, "full_module": "FStar.Hyp...
{ "detail_errors": false, "detail_hint_replay": false, "initial_fuel": 2, "initial_ifuel": 1, "max_fuel": 8, "max_ifuel": 2, "no_plugins": false, "no_smt": false, "no_tactics": false, "quake_hi": 1, "quake_keep": false, "quake_lo": 1, "retry": false, "reuse_hint_for": null, "smtencoding_el...
false
len: LowStar.Vector.uint32_t{len > 0ul} -> ia: a -> rid: FStar.Monotonic.HyperHeap.rid{FStar.HyperStack.ST.is_eternal_region rid} -> FStar.HyperStack.ST.ST (LowStar.Vector.vector a)
FStar.HyperStack.ST.ST
[]
[]
[ "LowStar.Vector.uint32_t", "Prims.b2t", "FStar.Integers.op_Greater", "FStar.Integers.Unsigned", "FStar.Integers.W32", "FStar.UInt32.__uint_to_t", "FStar.Monotonic.HyperHeap.rid", "FStar.HyperStack.ST.is_eternal_region", "LowStar.Vector.Vec", "LowStar.Vector.vector", "LowStar.Buffer.buffer", "P...
[]
false
true
false
false
false
let alloc_reserve #a len ia rid =
Vec 0ul len (B.malloc rid ia len)
false
LowStar.Vector.fst
LowStar.Vector.front
val front: #a:Type -> vec:vector a{size_of vec > 0ul} -> HST.ST a (requires (fun h0 -> live h0 vec)) (ensures (fun h0 v h1 -> h0 == h1 /\ S.index (as_seq h1 vec) 0 == v))
val front: #a:Type -> vec:vector a{size_of vec > 0ul} -> HST.ST a (requires (fun h0 -> live h0 vec)) (ensures (fun h0 v h1 -> h0 == h1 /\ S.index (as_seq h1 vec) 0 == v))
let front #a vec = B.index (Vec?.vs vec) 0ul
{ "file_name": "ulib/LowStar.Vector.fst", "git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3", "git_url": "https://github.com/FStarLang/FStar.git", "project_name": "FStar" }
{ "end_col": 27, "end_line": 376, "start_col": 0, "start_line": 375 }
(* Copyright 2008-2018 Microsoft Research Licensed under the Apache License, Version 2.0 (the "License"); you may not use this file except in compliance with the License. You may obtain a copy of the License at http://www.apache.org/licenses/LICENSE-2.0 Unless required by applicable law or agre...
{ "checked_file": "/", "dependencies": [ "prims.fst.checked", "LowStar.Modifies.fst.checked", "LowStar.Buffer.fst.checked", "FStar.UInt32.fsti.checked", "FStar.Set.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Map.fsti.checked", "FStar.Integers.f...
[ { "abbrev": true, "full_module": "FStar.UInt32", "short_module": "U32" }, { "abbrev": true, "full_module": "FStar.Seq", "short_module": "S" }, { "abbrev": true, "full_module": "LowStar.Buffer", "short_module": "B" }, { "abbrev": true, "full_module": "FStar.Hyp...
{ "detail_errors": false, "detail_hint_replay": false, "initial_fuel": 2, "initial_ifuel": 1, "max_fuel": 8, "max_ifuel": 2, "no_plugins": false, "no_smt": false, "no_tactics": false, "quake_hi": 1, "quake_keep": false, "quake_lo": 1, "retry": false, "reuse_hint_for": null, "smtencoding_el...
false
vec: LowStar.Vector.vector a {LowStar.Vector.size_of vec > 0ul} -> FStar.HyperStack.ST.ST a
FStar.HyperStack.ST.ST
[]
[]
[ "LowStar.Vector.vector", "Prims.b2t", "FStar.Integers.op_Greater", "FStar.Integers.Unsigned", "FStar.Integers.W32", "LowStar.Vector.size_of", "FStar.UInt32.__uint_to_t", "LowStar.Monotonic.Buffer.index", "LowStar.Buffer.trivial_preorder", "LowStar.Vector.__proj__Vec__item__vs" ]
[]
false
true
false
false
false
let front #a vec =
B.index (Vec?.vs vec) 0ul
false
Vale.Transformers.Locations.fst
Vale.Transformers.Locations.eval_location
val eval_location : a:location -> machine_state -> location_val_t a
val eval_location : a:location -> machine_state -> location_val_t a
let eval_location a s = match a with | ALocMem -> s.ms_heap | ALocStack -> FStar.Universe.raise_val (s.ms_stack, s.ms_stackTaint) | ALocReg r -> FStar.Universe.raise_val (eval_reg r s) | ALocCf -> FStar.Universe.raise_val (cf s.ms_flags) | ALocOf -> FStar.Universe.raise_val (overflow s.ms_flags)
{ "file_name": "vale/code/lib/transformers/Vale.Transformers.Locations.fst", "git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872", "git_url": "https://github.com/project-everest/hacl-star.git", "project_name": "hacl-star" }
{ "end_col": 60, "end_line": 74, "start_col": 0, "start_line": 68 }
module Vale.Transformers.Locations open Vale.Arch.HeapTypes_s open Vale.Arch.Heap open Vale.X64.Bytes_Code_s open Vale.X64.Instruction_s open Vale.X64.Instructions_s open Vale.X64.Machine_Semantics_s open Vale.X64.Machine_s open Vale.X64.Print_s open Vale.Def.PossiblyMonad module L = FStar.List.Tot (* See fsti *) t...
{ "checked_file": "/", "dependencies": [ "Vale.X64.Print_s.fst.checked", "Vale.X64.Machine_Semantics_s.fst.checked", "Vale.X64.Machine_s.fst.checked", "Vale.X64.Instructions_s.fsti.checked", "Vale.X64.Instruction_s.fsti.checked", "Vale.X64.Bytes_Code_s.fst.checked", "Vale.Def.PossiblyMon...
[ { "abbrev": true, "full_module": "FStar.List.Tot", "short_module": "L" }, { "abbrev": false, "full_module": "Vale.Def.PossiblyMonad", "short_module": null }, { "abbrev": false, "full_module": "Vale.X64.Print_s", "short_module": null }, { "abbrev": false, "full...
{ "detail_errors": false, "detail_hint_replay": false, "initial_fuel": 2, "initial_ifuel": 0, "max_fuel": 1, "max_ifuel": 1, "no_plugins": false, "no_smt": false, "no_tactics": false, "quake_hi": 1, "quake_keep": false, "quake_lo": 1, "retry": false, "reuse_hint_for": null, "smtencoding_el...
false
a: Vale.Transformers.Locations.location -> s: Vale.X64.Machine_Semantics_s.machine_state -> Vale.Transformers.Locations.location_val_t a
Prims.Tot
[ "total" ]
[]
[ "Vale.Transformers.Locations.location", "Vale.X64.Machine_Semantics_s.machine_state", "Vale.X64.Machine_Semantics_s.__proj__Mkmachine_state__item__ms_heap", "FStar.Universe.raise_val", "FStar.Pervasives.Native.tuple2", "Vale.X64.Machine_Semantics_s.machine_stack", "Vale.Arch.HeapTypes_s.memTaint_t", "...
[]
false
false
false
false
false
let eval_location a s =
match a with | ALocMem -> s.ms_heap | ALocStack -> FStar.Universe.raise_val (s.ms_stack, s.ms_stackTaint) | ALocReg r -> FStar.Universe.raise_val (eval_reg r s) | ALocCf -> FStar.Universe.raise_val (cf s.ms_flags) | ALocOf -> FStar.Universe.raise_val (overflow s.ms_flags)
false
LowStar.Vector.fst
LowStar.Vector.get
val get: #a:Type -> h:HS.mem -> vec:vector a -> i:uint32_t{i < size_of vec} -> GTot a
val get: #a:Type -> h:HS.mem -> vec:vector a -> i:uint32_t{i < size_of vec} -> GTot a
let get #a h vec i = S.index (as_seq h vec) (U32.v i)
{ "file_name": "ulib/LowStar.Vector.fst", "git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3", "git_url": "https://github.com/FStarLang/FStar.git", "project_name": "FStar" }
{ "end_col": 34, "end_line": 358, "start_col": 0, "start_line": 357 }
(* Copyright 2008-2018 Microsoft Research Licensed under the Apache License, Version 2.0 (the "License"); you may not use this file except in compliance with the License. You may obtain a copy of the License at http://www.apache.org/licenses/LICENSE-2.0 Unless required by applicable law or agre...
{ "checked_file": "/", "dependencies": [ "prims.fst.checked", "LowStar.Modifies.fst.checked", "LowStar.Buffer.fst.checked", "FStar.UInt32.fsti.checked", "FStar.Set.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Map.fsti.checked", "FStar.Integers.f...
[ { "abbrev": true, "full_module": "FStar.UInt32", "short_module": "U32" }, { "abbrev": true, "full_module": "FStar.Seq", "short_module": "S" }, { "abbrev": true, "full_module": "LowStar.Buffer", "short_module": "B" }, { "abbrev": true, "full_module": "FStar.Hyp...
{ "detail_errors": false, "detail_hint_replay": false, "initial_fuel": 2, "initial_ifuel": 1, "max_fuel": 8, "max_ifuel": 2, "no_plugins": false, "no_smt": false, "no_tactics": false, "quake_hi": 1, "quake_keep": false, "quake_lo": 1, "retry": false, "reuse_hint_for": null, "smtencoding_el...
false
h: FStar.Monotonic.HyperStack.mem -> vec: LowStar.Vector.vector a -> i: LowStar.Vector.uint32_t{i < LowStar.Vector.size_of vec} -> Prims.GTot a
Prims.GTot
[ "sometrivial" ]
[]
[ "FStar.Monotonic.HyperStack.mem", "LowStar.Vector.vector", "LowStar.Vector.uint32_t", "Prims.b2t", "FStar.Integers.op_Less", "FStar.Integers.Unsigned", "FStar.Integers.W32", "LowStar.Vector.size_of", "FStar.Seq.Base.index", "LowStar.Vector.as_seq", "FStar.UInt32.v" ]
[]
false
false
false
false
false
let get #a h vec i =
S.index (as_seq h vec) (U32.v i)
false
LowStar.Vector.fst
LowStar.Vector.loc_vector_within_disjoint_
val loc_vector_within_disjoint_: #a:Type -> vec:vector a -> i1:uint32_t -> i2:uint32_t{i1 < i2} -> j2:uint32_t{i2 <= j2 && j2 <= size_of vec} -> Lemma (requires True) (ensures (loc_disjoint (B.loc_buffer (B.gsub (Vec?.vs vec) i1 1ul)) (loc_vector_within vec i2 j2))) ...
val loc_vector_within_disjoint_: #a:Type -> vec:vector a -> i1:uint32_t -> i2:uint32_t{i1 < i2} -> j2:uint32_t{i2 <= j2 && j2 <= size_of vec} -> Lemma (requires True) (ensures (loc_disjoint (B.loc_buffer (B.gsub (Vec?.vs vec) i1 1ul)) (loc_vector_within vec i2 j2))) ...
let rec loc_vector_within_disjoint_ #a vec i1 i2 j2 = if i2 = j2 then () else loc_vector_within_disjoint_ vec i1 (i2 + 1ul) j2
{ "file_name": "ulib/LowStar.Vector.fst", "git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3", "git_url": "https://github.com/FStarLang/FStar.git", "project_name": "FStar" }
{ "end_col": 55, "end_line": 179, "start_col": 0, "start_line": 177 }
(* Copyright 2008-2018 Microsoft Research Licensed under the Apache License, Version 2.0 (the "License"); you may not use this file except in compliance with the License. You may obtain a copy of the License at http://www.apache.org/licenses/LICENSE-2.0 Unless required by applicable law or agre...
{ "checked_file": "/", "dependencies": [ "prims.fst.checked", "LowStar.Modifies.fst.checked", "LowStar.Buffer.fst.checked", "FStar.UInt32.fsti.checked", "FStar.Set.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Map.fsti.checked", "FStar.Integers.f...
[ { "abbrev": true, "full_module": "FStar.UInt32", "short_module": "U32" }, { "abbrev": true, "full_module": "FStar.Seq", "short_module": "S" }, { "abbrev": true, "full_module": "LowStar.Buffer", "short_module": "B" }, { "abbrev": true, "full_module": "FStar.Hyp...
{ "detail_errors": false, "detail_hint_replay": false, "initial_fuel": 2, "initial_ifuel": 1, "max_fuel": 8, "max_ifuel": 2, "no_plugins": false, "no_smt": false, "no_tactics": false, "quake_hi": 1, "quake_keep": false, "quake_lo": 1, "retry": false, "reuse_hint_for": null, "smtencoding_el...
false
vec: LowStar.Vector.vector a -> i1: LowStar.Vector.uint32_t -> i2: LowStar.Vector.uint32_t{i1 < i2} -> j2: LowStar.Vector.uint32_t{i2 <= j2 && j2 <= LowStar.Vector.size_of vec} -> FStar.Pervasives.Lemma (ensures LowStar.Monotonic.Buffer.loc_disjoint (LowStar.Monotonic.Buffer.loc_buffer ...
FStar.Pervasives.Lemma
[ "lemma", "" ]
[]
[ "LowStar.Vector.vector", "LowStar.Vector.uint32_t", "Prims.b2t", "FStar.Integers.op_Less", "FStar.Integers.Unsigned", "FStar.Integers.W32", "Prims.op_AmpAmp", "FStar.Integers.op_Less_Equals", "LowStar.Vector.size_of", "Prims.op_Equality", "Prims.l_or", "Prims.bool", "LowStar.Vector.loc_vecto...
[ "recursion" ]
false
false
true
false
false
let rec loc_vector_within_disjoint_ #a vec i1 i2 j2 =
if i2 = j2 then () else loc_vector_within_disjoint_ vec i1 (i2 + 1ul) j2
false
LowStar.Vector.fst
LowStar.Vector.forall_buffer
val forall_buffer: #a:Type -> h:HS.mem -> buf:B.buffer a -> i:nat -> j:nat{i <= j && j <= B.length buf} -> p:(a -> GTot Type0) -> GTot Type0
val forall_buffer: #a:Type -> h:HS.mem -> buf:B.buffer a -> i:nat -> j:nat{i <= j && j <= B.length buf} -> p:(a -> GTot Type0) -> GTot Type0
let forall_buffer #a h buf i j p = forall_seq (B.as_seq h buf) i j p
{ "file_name": "ulib/LowStar.Vector.fst", "git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3", "git_url": "https://github.com/FStarLang/FStar.git", "project_name": "FStar" }
{ "end_col": 35, "end_line": 562, "start_col": 0, "start_line": 561 }
(* Copyright 2008-2018 Microsoft Research Licensed under the Apache License, Version 2.0 (the "License"); you may not use this file except in compliance with the License. You may obtain a copy of the License at http://www.apache.org/licenses/LICENSE-2.0 Unless required by applicable law or agre...
{ "checked_file": "/", "dependencies": [ "prims.fst.checked", "LowStar.Modifies.fst.checked", "LowStar.Buffer.fst.checked", "FStar.UInt32.fsti.checked", "FStar.Set.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Map.fsti.checked", "FStar.Integers.f...
[ { "abbrev": true, "full_module": "FStar.UInt32", "short_module": "U32" }, { "abbrev": true, "full_module": "FStar.Seq", "short_module": "S" }, { "abbrev": true, "full_module": "LowStar.Buffer", "short_module": "B" }, { "abbrev": true, "full_module": "FStar.Hyp...
{ "detail_errors": false, "detail_hint_replay": false, "initial_fuel": 2, "initial_ifuel": 1, "max_fuel": 8, "max_ifuel": 2, "no_plugins": false, "no_smt": false, "no_tactics": false, "quake_hi": 1, "quake_keep": false, "quake_lo": 1, "retry": false, "reuse_hint_for": null, "smtencoding_el...
false
h: FStar.Monotonic.HyperStack.mem -> buf: LowStar.Buffer.buffer a -> i: FStar.Integers.nat -> j: FStar.Integers.nat{i <= j && j <= LowStar.Monotonic.Buffer.length buf} -> p: (_: a -> Prims.GTot Type0) -> Prims.GTot Type0
Prims.GTot
[ "sometrivial" ]
[]
[ "FStar.Monotonic.HyperStack.mem", "LowStar.Buffer.buffer", "FStar.Integers.nat", "Prims.b2t", "Prims.op_AmpAmp", "FStar.Integers.op_Less_Equals", "FStar.Integers.Signed", "FStar.Integers.Winfinite", "LowStar.Monotonic.Buffer.length", "LowStar.Buffer.trivial_preorder", "LowStar.Vector.forall_seq"...
[]
false
false
false
false
true
let forall_buffer #a h buf i j p =
forall_seq (B.as_seq h buf) i j p
false
LowStar.Vector.fst
LowStar.Vector.alloc_by_buffer
val alloc_by_buffer: #a:Type -> len:uint32_t{len > 0ul} -> buf:B.buffer a{B.len buf = len} -> HST.ST (vector a) (requires (fun h0 -> B.live h0 buf)) (ensures (fun h0 vec h1 -> frameOf vec = B.frameOf buf /\ loc_vector vec == B.loc_buffer buf /\ live h1 vec /\ h0 == h1 /\ ...
val alloc_by_buffer: #a:Type -> len:uint32_t{len > 0ul} -> buf:B.buffer a{B.len buf = len} -> HST.ST (vector a) (requires (fun h0 -> B.live h0 buf)) (ensures (fun h0 vec h1 -> frameOf vec = B.frameOf buf /\ loc_vector vec == B.loc_buffer buf /\ live h1 vec /\ h0 == h1 /\ ...
let alloc_by_buffer #a len buf = Vec len len buf
{ "file_name": "ulib/LowStar.Vector.fst", "git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3", "git_url": "https://github.com/FStarLang/FStar.git", "project_name": "FStar" }
{ "end_col": 17, "end_line": 340, "start_col": 0, "start_line": 339 }
(* Copyright 2008-2018 Microsoft Research Licensed under the Apache License, Version 2.0 (the "License"); you may not use this file except in compliance with the License. You may obtain a copy of the License at http://www.apache.org/licenses/LICENSE-2.0 Unless required by applicable law or agre...
{ "checked_file": "/", "dependencies": [ "prims.fst.checked", "LowStar.Modifies.fst.checked", "LowStar.Buffer.fst.checked", "FStar.UInt32.fsti.checked", "FStar.Set.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Map.fsti.checked", "FStar.Integers.f...
[ { "abbrev": true, "full_module": "FStar.UInt32", "short_module": "U32" }, { "abbrev": true, "full_module": "FStar.Seq", "short_module": "S" }, { "abbrev": true, "full_module": "LowStar.Buffer", "short_module": "B" }, { "abbrev": true, "full_module": "FStar.Hyp...
{ "detail_errors": false, "detail_hint_replay": false, "initial_fuel": 2, "initial_ifuel": 1, "max_fuel": 8, "max_ifuel": 2, "no_plugins": false, "no_smt": false, "no_tactics": false, "quake_hi": 1, "quake_keep": false, "quake_lo": 1, "retry": false, "reuse_hint_for": null, "smtencoding_el...
false
len: LowStar.Vector.uint32_t{len > 0ul} -> buf: LowStar.Buffer.buffer a {LowStar.Monotonic.Buffer.len buf = len} -> FStar.HyperStack.ST.ST (LowStar.Vector.vector a)
FStar.HyperStack.ST.ST
[]
[]
[ "LowStar.Vector.uint32_t", "Prims.b2t", "FStar.Integers.op_Greater", "FStar.Integers.Unsigned", "FStar.Integers.W32", "FStar.UInt32.__uint_to_t", "LowStar.Buffer.buffer", "Prims.op_Equality", "FStar.UInt32.t", "LowStar.Monotonic.Buffer.len", "LowStar.Buffer.trivial_preorder", "LowStar.Vector.V...
[]
false
true
false
false
false
let alloc_by_buffer #a len buf =
Vec len len buf
false
LowStar.Vector.fst
LowStar.Vector.shrink
val shrink: #a:Type -> vec:vector a -> new_size:uint32_t{new_size <= size_of vec} -> Tot (vector a)
val shrink: #a:Type -> vec:vector a -> new_size:uint32_t{new_size <= size_of vec} -> Tot (vector a)
let shrink #a vec new_size = Vec new_size (Vec?.cap vec) (Vec?.vs vec)
{ "file_name": "ulib/LowStar.Vector.fst", "git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3", "git_url": "https://github.com/FStarLang/FStar.git", "project_name": "FStar" }
{ "end_col": 43, "end_line": 510, "start_col": 0, "start_line": 509 }
(* Copyright 2008-2018 Microsoft Research Licensed under the Apache License, Version 2.0 (the "License"); you may not use this file except in compliance with the License. You may obtain a copy of the License at http://www.apache.org/licenses/LICENSE-2.0 Unless required by applicable law or agre...
{ "checked_file": "/", "dependencies": [ "prims.fst.checked", "LowStar.Modifies.fst.checked", "LowStar.Buffer.fst.checked", "FStar.UInt32.fsti.checked", "FStar.Set.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Map.fsti.checked", "FStar.Integers.f...
[ { "abbrev": true, "full_module": "FStar.UInt32", "short_module": "U32" }, { "abbrev": true, "full_module": "FStar.Seq", "short_module": "S" }, { "abbrev": true, "full_module": "LowStar.Buffer", "short_module": "B" }, { "abbrev": true, "full_module": "FStar.Hyp...
{ "detail_errors": false, "detail_hint_replay": false, "initial_fuel": 2, "initial_ifuel": 1, "max_fuel": 8, "max_ifuel": 2, "no_plugins": false, "no_smt": false, "no_tactics": false, "quake_hi": 1, "quake_keep": false, "quake_lo": 1, "retry": false, "reuse_hint_for": null, "smtencoding_el...
false
vec: LowStar.Vector.vector a -> new_size: LowStar.Vector.uint32_t{new_size <= LowStar.Vector.size_of vec} -> LowStar.Vector.vector a
Prims.Tot
[ "total" ]
[]
[ "LowStar.Vector.vector", "LowStar.Vector.uint32_t", "Prims.b2t", "FStar.Integers.op_Less_Equals", "FStar.Integers.Unsigned", "FStar.Integers.W32", "LowStar.Vector.size_of", "LowStar.Vector.Vec", "LowStar.Vector.__proj__Vec__item__cap", "LowStar.Vector.__proj__Vec__item__vs" ]
[]
false
false
false
false
false
let shrink #a vec new_size =
Vec new_size (Vec?.cap vec) (Vec?.vs vec)
false
LowStar.Vector.fst
LowStar.Vector.alloc
val alloc: #a:Type -> len:uint32_t{len > 0ul} -> v:a -> HST.ST (vector a) (requires (fun h0 -> true)) (ensures (fun h0 vec h1 -> frameOf vec = HS.root /\ live h1 vec /\ freeable vec /\ modifies loc_none h0 h1 /\ Set.equal (Map.domain (HS.get_hmap h0)) ...
val alloc: #a:Type -> len:uint32_t{len > 0ul} -> v:a -> HST.ST (vector a) (requires (fun h0 -> true)) (ensures (fun h0 vec h1 -> frameOf vec = HS.root /\ live h1 vec /\ freeable vec /\ modifies loc_none h0 h1 /\ Set.equal (Map.domain (HS.get_hmap h0)) ...
let alloc #a len v = alloc_rid len v HS.root
{ "file_name": "ulib/LowStar.Vector.fst", "git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3", "git_url": "https://github.com/FStarLang/FStar.git", "project_name": "FStar" }
{ "end_col": 25, "end_line": 306, "start_col": 0, "start_line": 305 }
(* Copyright 2008-2018 Microsoft Research Licensed under the Apache License, Version 2.0 (the "License"); you may not use this file except in compliance with the License. You may obtain a copy of the License at http://www.apache.org/licenses/LICENSE-2.0 Unless required by applicable law or agre...
{ "checked_file": "/", "dependencies": [ "prims.fst.checked", "LowStar.Modifies.fst.checked", "LowStar.Buffer.fst.checked", "FStar.UInt32.fsti.checked", "FStar.Set.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Map.fsti.checked", "FStar.Integers.f...
[ { "abbrev": true, "full_module": "FStar.UInt32", "short_module": "U32" }, { "abbrev": true, "full_module": "FStar.Seq", "short_module": "S" }, { "abbrev": true, "full_module": "LowStar.Buffer", "short_module": "B" }, { "abbrev": true, "full_module": "FStar.Hyp...
{ "detail_errors": false, "detail_hint_replay": false, "initial_fuel": 2, "initial_ifuel": 1, "max_fuel": 8, "max_ifuel": 2, "no_plugins": false, "no_smt": false, "no_tactics": false, "quake_hi": 1, "quake_keep": false, "quake_lo": 1, "retry": false, "reuse_hint_for": null, "smtencoding_el...
false
len: LowStar.Vector.uint32_t{len > 0ul} -> v: a -> FStar.HyperStack.ST.ST (LowStar.Vector.vector a)
FStar.HyperStack.ST.ST
[]
[]
[ "LowStar.Vector.uint32_t", "Prims.b2t", "FStar.Integers.op_Greater", "FStar.Integers.Unsigned", "FStar.Integers.W32", "FStar.UInt32.__uint_to_t", "LowStar.Vector.alloc_rid", "FStar.Monotonic.HyperHeap.root", "LowStar.Vector.vector" ]
[]
false
true
false
false
false
let alloc #a len v =
alloc_rid len v HS.root
false
LowStar.Vector.fst
LowStar.Vector.loc_vector_within_disjoint
val loc_vector_within_disjoint: #a:Type -> vec:vector a -> i1:uint32_t -> j1:uint32_t{i1 <= j1 && j1 <= size_of vec} -> i2:uint32_t{j1 <= i2} -> j2:uint32_t{i2 <= j2 && j2 <= size_of vec} -> Lemma (requires True) (ensures (loc_disjoint (loc_vector_within vec i1 j1) (loc_ve...
val loc_vector_within_disjoint: #a:Type -> vec:vector a -> i1:uint32_t -> j1:uint32_t{i1 <= j1 && j1 <= size_of vec} -> i2:uint32_t{j1 <= i2} -> j2:uint32_t{i2 <= j2 && j2 <= size_of vec} -> Lemma (requires True) (ensures (loc_disjoint (loc_vector_within vec i1 j1) (loc_ve...
let rec loc_vector_within_disjoint #a vec i1 j1 i2 j2 = if i1 = j1 then () else (loc_vector_within_disjoint_ vec i1 i2 j2; loc_vector_within_disjoint vec (i1 + 1ul) j1 i2 j2)
{ "file_name": "ulib/LowStar.Vector.fst", "git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3", "git_url": "https://github.com/FStarLang/FStar.git", "project_name": "FStar" }
{ "end_col": 58, "end_line": 192, "start_col": 0, "start_line": 189 }
(* Copyright 2008-2018 Microsoft Research Licensed under the Apache License, Version 2.0 (the "License"); you may not use this file except in compliance with the License. You may obtain a copy of the License at http://www.apache.org/licenses/LICENSE-2.0 Unless required by applicable law or agre...
{ "checked_file": "/", "dependencies": [ "prims.fst.checked", "LowStar.Modifies.fst.checked", "LowStar.Buffer.fst.checked", "FStar.UInt32.fsti.checked", "FStar.Set.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Map.fsti.checked", "FStar.Integers.f...
[ { "abbrev": true, "full_module": "FStar.UInt32", "short_module": "U32" }, { "abbrev": true, "full_module": "FStar.Seq", "short_module": "S" }, { "abbrev": true, "full_module": "LowStar.Buffer", "short_module": "B" }, { "abbrev": true, "full_module": "FStar.Hyp...
{ "detail_errors": false, "detail_hint_replay": false, "initial_fuel": 2, "initial_ifuel": 1, "max_fuel": 8, "max_ifuel": 2, "no_plugins": false, "no_smt": false, "no_tactics": false, "quake_hi": 1, "quake_keep": false, "quake_lo": 1, "retry": false, "reuse_hint_for": null, "smtencoding_el...
false
vec: LowStar.Vector.vector a -> i1: LowStar.Vector.uint32_t -> j1: LowStar.Vector.uint32_t{i1 <= j1 && j1 <= LowStar.Vector.size_of vec} -> i2: LowStar.Vector.uint32_t{j1 <= i2} -> j2: LowStar.Vector.uint32_t{i2 <= j2 && j2 <= LowStar.Vector.size_of vec} -> FStar.Pervasives.Lemma (ensures ...
FStar.Pervasives.Lemma
[ "lemma", "" ]
[]
[ "LowStar.Vector.vector", "LowStar.Vector.uint32_t", "Prims.b2t", "Prims.op_AmpAmp", "FStar.Integers.op_Less_Equals", "FStar.Integers.Unsigned", "FStar.Integers.W32", "LowStar.Vector.size_of", "Prims.op_Equality", "Prims.bool", "LowStar.Vector.loc_vector_within_disjoint", "FStar.Integers.op_Plu...
[ "recursion" ]
false
false
true
false
false
let rec loc_vector_within_disjoint #a vec i1 j1 i2 j2 =
if i1 = j1 then () else (loc_vector_within_disjoint_ vec i1 i2 j2; loc_vector_within_disjoint vec (i1 + 1ul) j1 i2 j2)
false
LowStar.Vector.fst
LowStar.Vector.fold_left_seq
val fold_left_seq: #a:Type -> #b:Type0 -> seq:S.seq a -> f:(b -> a -> GTot b) -> ib:b -> GTot b (decreases (S.length seq))
val fold_left_seq: #a:Type -> #b:Type0 -> seq:S.seq a -> f:(b -> a -> GTot b) -> ib:b -> GTot b (decreases (S.length seq))
let rec fold_left_seq #a #b seq f ib = if S.length seq = 0 then ib else fold_left_seq (S.tail seq) f (f ib (S.head seq))
{ "file_name": "ulib/LowStar.Vector.fst", "git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3", "git_url": "https://github.com/FStarLang/FStar.git", "project_name": "FStar" }
{ "end_col": 55, "end_line": 521, "start_col": 0, "start_line": 519 }
(* Copyright 2008-2018 Microsoft Research Licensed under the Apache License, Version 2.0 (the "License"); you may not use this file except in compliance with the License. You may obtain a copy of the License at http://www.apache.org/licenses/LICENSE-2.0 Unless required by applicable law or agre...
{ "checked_file": "/", "dependencies": [ "prims.fst.checked", "LowStar.Modifies.fst.checked", "LowStar.Buffer.fst.checked", "FStar.UInt32.fsti.checked", "FStar.Set.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Map.fsti.checked", "FStar.Integers.f...
[ { "abbrev": true, "full_module": "FStar.UInt32", "short_module": "U32" }, { "abbrev": true, "full_module": "FStar.Seq", "short_module": "S" }, { "abbrev": true, "full_module": "LowStar.Buffer", "short_module": "B" }, { "abbrev": true, "full_module": "FStar.Hyp...
{ "detail_errors": false, "detail_hint_replay": false, "initial_fuel": 2, "initial_ifuel": 1, "max_fuel": 8, "max_ifuel": 2, "no_plugins": false, "no_smt": false, "no_tactics": false, "quake_hi": 1, "quake_keep": false, "quake_lo": 1, "retry": false, "reuse_hint_for": null, "smtencoding_el...
false
seq: FStar.Seq.Base.seq a -> f: (_: b -> _: a -> Prims.GTot b) -> ib: b -> Prims.GTot b
Prims.GTot
[ "sometrivial", "" ]
[]
[ "FStar.Seq.Base.seq", "Prims.op_Equality", "Prims.int", "FStar.Seq.Base.length", "Prims.bool", "LowStar.Vector.fold_left_seq", "FStar.Seq.Properties.tail", "FStar.Seq.Properties.head" ]
[ "recursion" ]
false
false
false
false
false
let rec fold_left_seq #a #b seq f ib =
if S.length seq = 0 then ib else fold_left_seq (S.tail seq) f (f ib (S.head seq))
false
LowStar.Vector.fst
LowStar.Vector.forall_all
val forall_all: #a:Type -> h:HS.mem -> vec:vector a -> p:(a -> Tot Type0) -> GTot Type0
val forall_all: #a:Type -> h:HS.mem -> vec:vector a -> p:(a -> Tot Type0) -> GTot Type0
let forall_all #a h vec p = forall_ h vec 0ul (size_of vec) p
{ "file_name": "ulib/LowStar.Vector.fst", "git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3", "git_url": "https://github.com/FStarLang/FStar.git", "project_name": "FStar" }
{ "end_col": 35, "end_line": 575, "start_col": 0, "start_line": 574 }
(* Copyright 2008-2018 Microsoft Research Licensed under the Apache License, Version 2.0 (the "License"); you may not use this file except in compliance with the License. You may obtain a copy of the License at http://www.apache.org/licenses/LICENSE-2.0 Unless required by applicable law or agre...
{ "checked_file": "/", "dependencies": [ "prims.fst.checked", "LowStar.Modifies.fst.checked", "LowStar.Buffer.fst.checked", "FStar.UInt32.fsti.checked", "FStar.Set.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Map.fsti.checked", "FStar.Integers.f...
[ { "abbrev": true, "full_module": "FStar.UInt32", "short_module": "U32" }, { "abbrev": true, "full_module": "FStar.Seq", "short_module": "S" }, { "abbrev": true, "full_module": "LowStar.Buffer", "short_module": "B" }, { "abbrev": true, "full_module": "FStar.Hyp...
{ "detail_errors": false, "detail_hint_replay": false, "initial_fuel": 2, "initial_ifuel": 1, "max_fuel": 8, "max_ifuel": 2, "no_plugins": false, "no_smt": false, "no_tactics": false, "quake_hi": 1, "quake_keep": false, "quake_lo": 1, "retry": false, "reuse_hint_for": null, "smtencoding_el...
false
h: FStar.Monotonic.HyperStack.mem -> vec: LowStar.Vector.vector a -> p: (_: a -> Type0) -> Prims.GTot Type0
Prims.GTot
[ "sometrivial" ]
[]
[ "FStar.Monotonic.HyperStack.mem", "LowStar.Vector.vector", "LowStar.Vector.forall_", "FStar.UInt32.__uint_to_t", "LowStar.Vector.size_of" ]
[]
false
false
false
false
true
let forall_all #a h vec p =
forall_ h vec 0ul (size_of vec) p
false
LowStar.Vector.fst
LowStar.Vector.new_capacity
val new_capacity: cap:uint32_t -> Tot uint32_t
val new_capacity: cap:uint32_t -> Tot uint32_t
let new_capacity cap = if cap >= max_uint32 / resize_ratio then max_uint32 else if cap = 0ul then 1ul else cap * resize_ratio
{ "file_name": "ulib/LowStar.Vector.fst", "git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3", "git_url": "https://github.com/FStarLang/FStar.git", "project_name": "FStar" }
{ "end_col": 25, "end_line": 444, "start_col": 8, "start_line": 441 }
(* Copyright 2008-2018 Microsoft Research Licensed under the Apache License, Version 2.0 (the "License"); you may not use this file except in compliance with the License. You may obtain a copy of the License at http://www.apache.org/licenses/LICENSE-2.0 Unless required by applicable law or agre...
{ "checked_file": "/", "dependencies": [ "prims.fst.checked", "LowStar.Modifies.fst.checked", "LowStar.Buffer.fst.checked", "FStar.UInt32.fsti.checked", "FStar.Set.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Map.fsti.checked", "FStar.Integers.f...
[ { "abbrev": true, "full_module": "FStar.UInt32", "short_module": "U32" }, { "abbrev": true, "full_module": "FStar.Seq", "short_module": "S" }, { "abbrev": true, "full_module": "LowStar.Buffer", "short_module": "B" }, { "abbrev": true, "full_module": "FStar.Hyp...
{ "detail_errors": false, "detail_hint_replay": false, "initial_fuel": 2, "initial_ifuel": 1, "max_fuel": 8, "max_ifuel": 2, "no_plugins": false, "no_smt": false, "no_tactics": false, "quake_hi": 1, "quake_keep": false, "quake_lo": 1, "retry": false, "reuse_hint_for": null, "smtencoding_el...
false
cap: LowStar.Vector.uint32_t -> LowStar.Vector.uint32_t
Prims.Tot
[ "total" ]
[]
[ "LowStar.Vector.uint32_t", "FStar.Integers.op_Greater_Equals", "FStar.Integers.Unsigned", "FStar.Integers.W32", "FStar.Integers.op_Slash", "LowStar.Vector.max_uint32", "LowStar.Vector.resize_ratio", "Prims.bool", "Prims.op_Equality", "FStar.UInt32.t", "FStar.UInt32.__uint_to_t", "FStar.Integer...
[]
false
false
false
true
false
let new_capacity cap =
if cap >= max_uint32 / resize_ratio then max_uint32 else if cap = 0ul then 1ul else cap * resize_ratio
false
LowStar.Vector.fst
LowStar.Vector.forall2_buffer
val forall2_buffer: #a:Type -> h:HS.mem -> buf:B.buffer a -> i:nat -> j:nat{i <= j && j <= B.length buf} -> p:(a -> a -> GTot Type0) -> GTot Type0
val forall2_buffer: #a:Type -> h:HS.mem -> buf:B.buffer a -> i:nat -> j:nat{i <= j && j <= B.length buf} -> p:(a -> a -> GTot Type0) -> GTot Type0
let forall2_buffer #a h buf i j p = forall2_seq (B.as_seq h buf) i j p
{ "file_name": "ulib/LowStar.Vector.fst", "git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3", "git_url": "https://github.com/FStarLang/FStar.git", "project_name": "FStar" }
{ "end_col": 36, "end_line": 590, "start_col": 0, "start_line": 589 }
(* Copyright 2008-2018 Microsoft Research Licensed under the Apache License, Version 2.0 (the "License"); you may not use this file except in compliance with the License. You may obtain a copy of the License at http://www.apache.org/licenses/LICENSE-2.0 Unless required by applicable law or agre...
{ "checked_file": "/", "dependencies": [ "prims.fst.checked", "LowStar.Modifies.fst.checked", "LowStar.Buffer.fst.checked", "FStar.UInt32.fsti.checked", "FStar.Set.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Map.fsti.checked", "FStar.Integers.f...
[ { "abbrev": true, "full_module": "FStar.UInt32", "short_module": "U32" }, { "abbrev": true, "full_module": "FStar.Seq", "short_module": "S" }, { "abbrev": true, "full_module": "LowStar.Buffer", "short_module": "B" }, { "abbrev": true, "full_module": "FStar.Hyp...
{ "detail_errors": false, "detail_hint_replay": false, "initial_fuel": 2, "initial_ifuel": 1, "max_fuel": 8, "max_ifuel": 2, "no_plugins": false, "no_smt": false, "no_tactics": false, "quake_hi": 1, "quake_keep": false, "quake_lo": 1, "retry": false, "reuse_hint_for": null, "smtencoding_el...
false
h: FStar.Monotonic.HyperStack.mem -> buf: LowStar.Buffer.buffer a -> i: FStar.Integers.nat -> j: FStar.Integers.nat{i <= j && j <= LowStar.Monotonic.Buffer.length buf} -> p: (_: a -> _: a -> Prims.GTot Type0) -> Prims.GTot Type0
Prims.GTot
[ "sometrivial" ]
[]
[ "FStar.Monotonic.HyperStack.mem", "LowStar.Buffer.buffer", "FStar.Integers.nat", "Prims.b2t", "Prims.op_AmpAmp", "FStar.Integers.op_Less_Equals", "FStar.Integers.Signed", "FStar.Integers.Winfinite", "LowStar.Monotonic.Buffer.length", "LowStar.Buffer.trivial_preorder", "LowStar.Vector.forall2_seq...
[]
false
false
false
false
true
let forall2_buffer #a h buf i j p =
forall2_seq (B.as_seq h buf) i j p
false
LowStar.Vector.fst
LowStar.Vector.fold_left
val fold_left: #a:Type -> #b:Type0 -> vec:vector a -> f:(b -> a -> Tot b) -> ib:b -> HST.ST b (requires (fun h0 -> live h0 vec)) (ensures (fun h0 v h1 -> h0 == h1 /\ v == fold_left_seq (as_seq h0 vec) f ib))
val fold_left: #a:Type -> #b:Type0 -> vec:vector a -> f:(b -> a -> Tot b) -> ib:b -> HST.ST b (requires (fun h0 -> live h0 vec)) (ensures (fun h0 v h1 -> h0 == h1 /\ v == fold_left_seq (as_seq h0 vec) f ib))
let fold_left #a #b vec f ib = fold_left_buffer (Vec?.sz vec) (B.sub (Vec?.vs vec) 0ul (Vec?.sz vec)) f ib
{ "file_name": "ulib/LowStar.Vector.fst", "git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3", "git_url": "https://github.com/FStarLang/FStar.git", "project_name": "FStar" }
{ "end_col": 77, "end_line": 547, "start_col": 0, "start_line": 546 }
(* Copyright 2008-2018 Microsoft Research Licensed under the Apache License, Version 2.0 (the "License"); you may not use this file except in compliance with the License. You may obtain a copy of the License at http://www.apache.org/licenses/LICENSE-2.0 Unless required by applicable law or agre...
{ "checked_file": "/", "dependencies": [ "prims.fst.checked", "LowStar.Modifies.fst.checked", "LowStar.Buffer.fst.checked", "FStar.UInt32.fsti.checked", "FStar.Set.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Map.fsti.checked", "FStar.Integers.f...
[ { "abbrev": true, "full_module": "FStar.UInt32", "short_module": "U32" }, { "abbrev": true, "full_module": "FStar.Seq", "short_module": "S" }, { "abbrev": true, "full_module": "LowStar.Buffer", "short_module": "B" }, { "abbrev": true, "full_module": "FStar.Hyp...
{ "detail_errors": false, "detail_hint_replay": false, "initial_fuel": 2, "initial_ifuel": 1, "max_fuel": 8, "max_ifuel": 2, "no_plugins": false, "no_smt": false, "no_tactics": false, "quake_hi": 1, "quake_keep": false, "quake_lo": 1, "retry": false, "reuse_hint_for": null, "smtencoding_el...
false
vec: LowStar.Vector.vector a -> f: (_: b -> _: a -> b) -> ib: b -> FStar.HyperStack.ST.ST b
FStar.HyperStack.ST.ST
[]
[]
[ "LowStar.Vector.vector", "LowStar.Vector.fold_left_buffer", "LowStar.Vector.__proj__Vec__item__sz", "LowStar.Buffer.buffer", "Prims.b2t", "Prims.op_Equality", "FStar.UInt32.t", "LowStar.Monotonic.Buffer.len", "LowStar.Buffer.trivial_preorder", "LowStar.Buffer.sub", "LowStar.Vector.__proj__Vec__i...
[]
false
true
false
false
false
let fold_left #a #b vec f ib =
fold_left_buffer (Vec?.sz vec) (B.sub (Vec?.vs vec) 0ul (Vec?.sz vec)) f ib
false
LowStar.Vector.fst
LowStar.Vector.back
val back: #a:Type -> vec:vector a{size_of vec > 0ul} -> HST.ST a (requires (fun h0 -> live h0 vec)) (ensures (fun h0 v h1 -> h0 == h1 /\ S.index (as_seq h1 vec) (U32.v (size_of vec) - 1) == v))
val back: #a:Type -> vec:vector a{size_of vec > 0ul} -> HST.ST a (requires (fun h0 -> live h0 vec)) (ensures (fun h0 v h1 -> h0 == h1 /\ S.index (as_seq h1 vec) (U32.v (size_of vec) - 1) == v))
let back #a vec = B.index (Vec?.vs vec) (size_of vec - 1ul)
{ "file_name": "ulib/LowStar.Vector.fst", "git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3", "git_url": "https://github.com/FStarLang/FStar.git", "project_name": "FStar" }
{ "end_col": 43, "end_line": 385, "start_col": 0, "start_line": 384 }
(* Copyright 2008-2018 Microsoft Research Licensed under the Apache License, Version 2.0 (the "License"); you may not use this file except in compliance with the License. You may obtain a copy of the License at http://www.apache.org/licenses/LICENSE-2.0 Unless required by applicable law or agre...
{ "checked_file": "/", "dependencies": [ "prims.fst.checked", "LowStar.Modifies.fst.checked", "LowStar.Buffer.fst.checked", "FStar.UInt32.fsti.checked", "FStar.Set.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Map.fsti.checked", "FStar.Integers.f...
[ { "abbrev": true, "full_module": "FStar.UInt32", "short_module": "U32" }, { "abbrev": true, "full_module": "FStar.Seq", "short_module": "S" }, { "abbrev": true, "full_module": "LowStar.Buffer", "short_module": "B" }, { "abbrev": true, "full_module": "FStar.Hyp...
{ "detail_errors": false, "detail_hint_replay": false, "initial_fuel": 2, "initial_ifuel": 1, "max_fuel": 8, "max_ifuel": 2, "no_plugins": false, "no_smt": false, "no_tactics": false, "quake_hi": 1, "quake_keep": false, "quake_lo": 1, "retry": false, "reuse_hint_for": null, "smtencoding_el...
false
vec: LowStar.Vector.vector a {LowStar.Vector.size_of vec > 0ul} -> FStar.HyperStack.ST.ST a
FStar.HyperStack.ST.ST
[]
[]
[ "LowStar.Vector.vector", "Prims.b2t", "FStar.Integers.op_Greater", "FStar.Integers.Unsigned", "FStar.Integers.W32", "LowStar.Vector.size_of", "FStar.UInt32.__uint_to_t", "LowStar.Monotonic.Buffer.index", "LowStar.Buffer.trivial_preorder", "LowStar.Vector.__proj__Vec__item__vs", "FStar.Integers.o...
[]
false
true
false
false
false
let back #a vec =
B.index (Vec?.vs vec) (size_of vec - 1ul)
false
Hacl.Test.HMAC_DRBG.fst
Hacl.Test.HMAC_DRBG.vector
val vector : Type0
let vector = D.hash_alg & vec8 & vec8 & vec8 & vec8 & vec8 & (vec8 & vec8) & vec8
{ "file_name": "code/tests/Hacl.Test.HMAC_DRBG.fst", "git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872", "git_url": "https://github.com/project-everest/hacl-star.git", "project_name": "hacl-star" }
{ "end_col": 81, "end_line": 33, "start_col": 0, "start_line": 33 }
module Hacl.Test.HMAC_DRBG open FStar.HyperStack.ST open Test.Lowstarize open Lib.IntTypes open Hacl.HMAC_DRBG open Spec.HMAC_DRBG.Test.Vectors module D = Spec.Hash.Definitions module L = Test.Lowstarize module B = LowStar.Buffer #set-options "--fuel 0 --ifuel 0 --z3rlimit 100" (* FStar.Reflection only supports u...
{ "checked_file": "/", "dependencies": [ "Test.Lowstarize.fst.checked", "Spec.HMAC_DRBG.Test.Vectors.fst.checked", "Spec.HMAC_DRBG.fsti.checked", "Spec.Hash.Definitions.fst.checked", "prims.fst.checked", "LowStar.Printf.fst.checked", "LowStar.BufferOps.fst.checked", "LowStar.Buffer.f...
[ { "abbrev": true, "full_module": "LowStar.Buffer", "short_module": "B" }, { "abbrev": true, "full_module": "Test.Lowstarize", "short_module": "L" }, { "abbrev": true, "full_module": "Spec.Hash.Definitions", "short_module": "D" }, { "abbrev": false, "full_modul...
{ "detail_errors": false, "detail_hint_replay": false, "initial_fuel": 0, "initial_ifuel": 0, "max_fuel": 0, "max_ifuel": 0, "no_plugins": false, "no_smt": false, "no_tactics": false, "quake_hi": 1, "quake_keep": false, "quake_lo": 1, "retry": false, "reuse_hint_for": null, "smtencoding_el...
false
Type0
Prims.Tot
[ "total" ]
[]
[ "FStar.Pervasives.Native.tuple8", "Spec.Hash.Definitions.hash_alg", "Hacl.Test.HMAC_DRBG.vec8", "FStar.Pervasives.Native.tuple2" ]
[]
false
false
false
true
true
let vector =
D.hash_alg & vec8 & vec8 & vec8 & vec8 & vec8 & (vec8 & vec8) & vec8
false
LowStar.Vector.fst
LowStar.Vector.forall_seq
val forall_seq: #a:Type -> seq:S.seq a -> i:nat -> j:nat{i <= j && j <= S.length seq} -> p:(a -> GTot Type0) -> GTot Type0
val forall_seq: #a:Type -> seq:S.seq a -> i:nat -> j:nat{i <= j && j <= S.length seq} -> p:(a -> GTot Type0) -> GTot Type0
let forall_seq #a seq i j p = forall (idx:nat{i <= idx && idx < j}). p (S.index seq idx)
{ "file_name": "ulib/LowStar.Vector.fst", "git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3", "git_url": "https://github.com/FStarLang/FStar.git", "project_name": "FStar" }
{ "end_col": 23, "end_line": 555, "start_col": 0, "start_line": 553 }
(* Copyright 2008-2018 Microsoft Research Licensed under the Apache License, Version 2.0 (the "License"); you may not use this file except in compliance with the License. You may obtain a copy of the License at http://www.apache.org/licenses/LICENSE-2.0 Unless required by applicable law or agre...
{ "checked_file": "/", "dependencies": [ "prims.fst.checked", "LowStar.Modifies.fst.checked", "LowStar.Buffer.fst.checked", "FStar.UInt32.fsti.checked", "FStar.Set.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Map.fsti.checked", "FStar.Integers.f...
[ { "abbrev": true, "full_module": "FStar.UInt32", "short_module": "U32" }, { "abbrev": true, "full_module": "FStar.Seq", "short_module": "S" }, { "abbrev": true, "full_module": "LowStar.Buffer", "short_module": "B" }, { "abbrev": true, "full_module": "FStar.Hyp...
{ "detail_errors": false, "detail_hint_replay": false, "initial_fuel": 2, "initial_ifuel": 1, "max_fuel": 8, "max_ifuel": 2, "no_plugins": false, "no_smt": false, "no_tactics": false, "quake_hi": 1, "quake_keep": false, "quake_lo": 1, "retry": false, "reuse_hint_for": null, "smtencoding_el...
false
seq: FStar.Seq.Base.seq a -> i: FStar.Integers.nat -> j: FStar.Integers.nat{i <= j && j <= FStar.Seq.Base.length seq} -> p: (_: a -> Prims.GTot Type0) -> Prims.GTot Type0
Prims.GTot
[ "sometrivial" ]
[]
[ "FStar.Seq.Base.seq", "FStar.Integers.nat", "Prims.b2t", "Prims.op_AmpAmp", "FStar.Integers.op_Less_Equals", "FStar.Integers.Signed", "FStar.Integers.Winfinite", "FStar.Seq.Base.length", "Prims.l_Forall", "FStar.Integers.op_Less", "FStar.Seq.Base.index" ]
[]
false
false
false
false
true
let forall_seq #a seq i j p =
forall (idx: nat{i <= idx && idx < j}). p (S.index seq idx)
false
LowStar.Vector.fst
LowStar.Vector.forall_
val forall_: #a:Type -> h:HS.mem -> vec:vector a -> i:uint32_t -> j:uint32_t{i <= j && j <= size_of vec} -> p:(a -> Tot Type0) -> GTot Type0
val forall_: #a:Type -> h:HS.mem -> vec:vector a -> i:uint32_t -> j:uint32_t{i <= j && j <= size_of vec} -> p:(a -> Tot Type0) -> GTot Type0
let forall_ #a h vec i j p = forall_seq (as_seq h vec) (U32.v i) (U32.v j) p
{ "file_name": "ulib/LowStar.Vector.fst", "git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3", "git_url": "https://github.com/FStarLang/FStar.git", "project_name": "FStar" }
{ "end_col": 49, "end_line": 569, "start_col": 0, "start_line": 568 }
(* Copyright 2008-2018 Microsoft Research Licensed under the Apache License, Version 2.0 (the "License"); you may not use this file except in compliance with the License. You may obtain a copy of the License at http://www.apache.org/licenses/LICENSE-2.0 Unless required by applicable law or agre...
{ "checked_file": "/", "dependencies": [ "prims.fst.checked", "LowStar.Modifies.fst.checked", "LowStar.Buffer.fst.checked", "FStar.UInt32.fsti.checked", "FStar.Set.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Map.fsti.checked", "FStar.Integers.f...
[ { "abbrev": true, "full_module": "FStar.UInt32", "short_module": "U32" }, { "abbrev": true, "full_module": "FStar.Seq", "short_module": "S" }, { "abbrev": true, "full_module": "LowStar.Buffer", "short_module": "B" }, { "abbrev": true, "full_module": "FStar.Hyp...
{ "detail_errors": false, "detail_hint_replay": false, "initial_fuel": 2, "initial_ifuel": 1, "max_fuel": 8, "max_ifuel": 2, "no_plugins": false, "no_smt": false, "no_tactics": false, "quake_hi": 1, "quake_keep": false, "quake_lo": 1, "retry": false, "reuse_hint_for": null, "smtencoding_el...
false
h: FStar.Monotonic.HyperStack.mem -> vec: LowStar.Vector.vector a -> i: LowStar.Vector.uint32_t -> j: LowStar.Vector.uint32_t{i <= j && j <= LowStar.Vector.size_of vec} -> p: (_: a -> Type0) -> Prims.GTot Type0
Prims.GTot
[ "sometrivial" ]
[]
[ "FStar.Monotonic.HyperStack.mem", "LowStar.Vector.vector", "LowStar.Vector.uint32_t", "Prims.b2t", "Prims.op_AmpAmp", "FStar.Integers.op_Less_Equals", "FStar.Integers.Unsigned", "FStar.Integers.W32", "LowStar.Vector.size_of", "LowStar.Vector.forall_seq", "LowStar.Vector.as_seq", "FStar.UInt32....
[]
false
false
false
false
true
let forall_ #a h vec i j p =
forall_seq (as_seq h vec) (U32.v i) (U32.v j) p
false
Vale.Transformers.Locations.fst
Vale.Transformers.Locations.update_location
val update_location : a:location -> v:location_val_t a -> machine_state -> s:machine_state{eval_location a s == v}
val update_location : a:location -> v:location_val_t a -> machine_state -> s:machine_state{eval_location a s == v}
let update_location a v s = match a with | ALocMem -> let v = coerce v in { s with ms_heap = v } | ALocStack -> let v = FStar.Universe.downgrade_val (coerce v) in { s with ms_stack = fst v ; ms_stackTaint = snd v } | ALocReg r -> let v = FStar.Universe.downgrade_val v in update_reg' r v ...
{ "file_name": "vale/code/lib/transformers/Vale.Transformers.Locations.fst", "git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872", "git_url": "https://github.com/project-everest/hacl-star.git", "project_name": "hacl-star" }
{ "end_col": 121, "end_line": 93, "start_col": 0, "start_line": 77 }
module Vale.Transformers.Locations open Vale.Arch.HeapTypes_s open Vale.Arch.Heap open Vale.X64.Bytes_Code_s open Vale.X64.Instruction_s open Vale.X64.Instructions_s open Vale.X64.Machine_Semantics_s open Vale.X64.Machine_s open Vale.X64.Print_s open Vale.Def.PossiblyMonad module L = FStar.List.Tot (* See fsti *) t...
{ "checked_file": "/", "dependencies": [ "Vale.X64.Print_s.fst.checked", "Vale.X64.Machine_Semantics_s.fst.checked", "Vale.X64.Machine_s.fst.checked", "Vale.X64.Instructions_s.fsti.checked", "Vale.X64.Instruction_s.fsti.checked", "Vale.X64.Bytes_Code_s.fst.checked", "Vale.Def.PossiblyMon...
[ { "abbrev": true, "full_module": "FStar.List.Tot", "short_module": "L" }, { "abbrev": false, "full_module": "Vale.Def.PossiblyMonad", "short_module": null }, { "abbrev": false, "full_module": "Vale.X64.Print_s", "short_module": null }, { "abbrev": false, "full...
{ "detail_errors": false, "detail_hint_replay": false, "initial_fuel": 2, "initial_ifuel": 0, "max_fuel": 1, "max_ifuel": 1, "no_plugins": false, "no_smt": false, "no_tactics": false, "quake_hi": 1, "quake_keep": false, "quake_lo": 1, "retry": false, "reuse_hint_for": null, "smtencoding_el...
false
a: Vale.Transformers.Locations.location -> v: Vale.Transformers.Locations.location_val_t a -> s: Vale.X64.Machine_Semantics_s.machine_state -> s: Vale.X64.Machine_Semantics_s.machine_state{Vale.Transformers.Locations.eval_location a s == v}
Prims.Tot
[ "total" ]
[]
[ "Vale.Transformers.Locations.location", "Vale.Transformers.Locations.location_val_t", "Vale.X64.Machine_Semantics_s.machine_state", "Vale.X64.Machine_Semantics_s.Mkmachine_state", "Vale.X64.Machine_Semantics_s.__proj__Mkmachine_state__item__ms_ok", "Vale.X64.Machine_Semantics_s.__proj__Mkmachine_state__it...
[]
false
false
false
false
false
let update_location a v s =
match a with | ALocMem -> let v = coerce v in { s with ms_heap = v } | ALocStack -> let v = FStar.Universe.downgrade_val (coerce v) in { s with ms_stack = fst v; ms_stackTaint = snd v } | ALocReg r -> let v = FStar.Universe.downgrade_val v in update_reg' r v s | ALocCf -> let v = FStar.Universe.downgrade_...
false
LowStar.Vector.fst
LowStar.Vector.loc_vector_within_includes
val loc_vector_within_includes: #a:Type -> vec:vector a -> i1:uint32_t -> j1:uint32_t{i1 <= j1 && j1 <= size_of vec} -> i2:uint32_t{i1 <= i2} -> j2:uint32_t{i2 <= j2 && j2 <= j1} -> Lemma (requires True) (ensures (loc_includes (loc_vector_within vec i1 j1) (loc_vector_with...
val loc_vector_within_includes: #a:Type -> vec:vector a -> i1:uint32_t -> j1:uint32_t{i1 <= j1 && j1 <= size_of vec} -> i2:uint32_t{i1 <= i2} -> j2:uint32_t{i2 <= j2 && j2 <= j1} -> Lemma (requires True) (ensures (loc_includes (loc_vector_within vec i1 j1) (loc_vector_with...
let rec loc_vector_within_includes #a vec i1 j1 i2 j2 = if i1 = j1 then () else if i1 = i2 then loc_vector_within_includes_ vec i1 j1 j2 else begin loc_vector_within_includes vec (i1 + 1ul) j1 i2 j2; loc_includes_union_l (B.loc_buffer (B.gsub (Vec?.vs vec) i1 1ul)) (loc_vector_wit...
{ "file_name": "ulib/LowStar.Vector.fst", "git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3", "git_url": "https://github.com/FStarLang/FStar.git", "project_name": "FStar" }
{ "end_col": 5, "end_line": 155, "start_col": 0, "start_line": 147 }
(* Copyright 2008-2018 Microsoft Research Licensed under the Apache License, Version 2.0 (the "License"); you may not use this file except in compliance with the License. You may obtain a copy of the License at http://www.apache.org/licenses/LICENSE-2.0 Unless required by applicable law or agre...
{ "checked_file": "/", "dependencies": [ "prims.fst.checked", "LowStar.Modifies.fst.checked", "LowStar.Buffer.fst.checked", "FStar.UInt32.fsti.checked", "FStar.Set.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Map.fsti.checked", "FStar.Integers.f...
[ { "abbrev": true, "full_module": "FStar.UInt32", "short_module": "U32" }, { "abbrev": true, "full_module": "FStar.Seq", "short_module": "S" }, { "abbrev": true, "full_module": "LowStar.Buffer", "short_module": "B" }, { "abbrev": true, "full_module": "FStar.Hyp...
{ "detail_errors": false, "detail_hint_replay": false, "initial_fuel": 2, "initial_ifuel": 1, "max_fuel": 8, "max_ifuel": 2, "no_plugins": false, "no_smt": false, "no_tactics": false, "quake_hi": 1, "quake_keep": false, "quake_lo": 1, "retry": false, "reuse_hint_for": null, "smtencoding_el...
false
vec: LowStar.Vector.vector a -> i1: LowStar.Vector.uint32_t -> j1: LowStar.Vector.uint32_t{i1 <= j1 && j1 <= LowStar.Vector.size_of vec} -> i2: LowStar.Vector.uint32_t{i1 <= i2} -> j2: LowStar.Vector.uint32_t{i2 <= j2 && j2 <= j1} -> FStar.Pervasives.Lemma (ensures LowStar.Monotonic...
FStar.Pervasives.Lemma
[ "lemma", "" ]
[]
[ "LowStar.Vector.vector", "LowStar.Vector.uint32_t", "Prims.b2t", "Prims.op_AmpAmp", "FStar.Integers.op_Less_Equals", "FStar.Integers.Unsigned", "FStar.Integers.W32", "LowStar.Vector.size_of", "Prims.op_Equality", "Prims.bool", "LowStar.Vector.loc_vector_within_includes_", "LowStar.Monotonic.Bu...
[ "recursion" ]
false
false
true
false
false
let rec loc_vector_within_includes #a vec i1 j1 i2 j2 =
if i1 = j1 then () else if i1 = i2 then loc_vector_within_includes_ vec i1 j1 j2 else (loc_vector_within_includes vec (i1 + 1ul) j1 i2 j2; loc_includes_union_l (B.loc_buffer (B.gsub (Vec?.vs vec) i1 1ul)) (loc_vector_within vec (i1 + 1ul) j1) (loc_vector_within vec i2 j2))
false
LowStar.Vector.fst
LowStar.Vector.forall2
val forall2: #a:Type -> h:HS.mem -> vec:vector a -> i:uint32_t -> j:uint32_t{i <= j && j <= size_of vec} -> p:(a -> a -> GTot Type0) -> GTot Type0
val forall2: #a:Type -> h:HS.mem -> vec:vector a -> i:uint32_t -> j:uint32_t{i <= j && j <= size_of vec} -> p:(a -> a -> GTot Type0) -> GTot Type0
let forall2 #a h vec i j p = forall2_seq (as_seq h vec) (U32.v i) (U32.v j) p
{ "file_name": "ulib/LowStar.Vector.fst", "git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3", "git_url": "https://github.com/FStarLang/FStar.git", "project_name": "FStar" }
{ "end_col": 50, "end_line": 597, "start_col": 0, "start_line": 596 }
(* Copyright 2008-2018 Microsoft Research Licensed under the Apache License, Version 2.0 (the "License"); you may not use this file except in compliance with the License. You may obtain a copy of the License at http://www.apache.org/licenses/LICENSE-2.0 Unless required by applicable law or agre...
{ "checked_file": "/", "dependencies": [ "prims.fst.checked", "LowStar.Modifies.fst.checked", "LowStar.Buffer.fst.checked", "FStar.UInt32.fsti.checked", "FStar.Set.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Map.fsti.checked", "FStar.Integers.f...
[ { "abbrev": true, "full_module": "FStar.UInt32", "short_module": "U32" }, { "abbrev": true, "full_module": "FStar.Seq", "short_module": "S" }, { "abbrev": true, "full_module": "LowStar.Buffer", "short_module": "B" }, { "abbrev": true, "full_module": "FStar.Hyp...
{ "detail_errors": false, "detail_hint_replay": false, "initial_fuel": 2, "initial_ifuel": 1, "max_fuel": 8, "max_ifuel": 2, "no_plugins": false, "no_smt": false, "no_tactics": false, "quake_hi": 1, "quake_keep": false, "quake_lo": 1, "retry": false, "reuse_hint_for": null, "smtencoding_el...
false
h: FStar.Monotonic.HyperStack.mem -> vec: LowStar.Vector.vector a -> i: LowStar.Vector.uint32_t -> j: LowStar.Vector.uint32_t{i <= j && j <= LowStar.Vector.size_of vec} -> p: (_: a -> _: a -> Prims.GTot Type0) -> Prims.GTot Type0
Prims.GTot
[ "sometrivial" ]
[]
[ "FStar.Monotonic.HyperStack.mem", "LowStar.Vector.vector", "LowStar.Vector.uint32_t", "Prims.b2t", "Prims.op_AmpAmp", "FStar.Integers.op_Less_Equals", "FStar.Integers.Unsigned", "FStar.Integers.W32", "LowStar.Vector.size_of", "LowStar.Vector.forall2_seq", "LowStar.Vector.as_seq", "FStar.UInt32...
[]
false
false
false
false
true
let forall2 #a h vec i j p =
forall2_seq (as_seq h vec) (U32.v i) (U32.v j) p
false
LowStar.Vector.fst
LowStar.Vector.loc_vector_within_union_rev
val loc_vector_within_union_rev: #a:Type -> vec:vector a -> i:uint32_t -> j:uint32_t{i < j && j <= size_of vec} -> Lemma (requires True) (ensures (loc_vector_within vec i j == loc_union (loc_vector_within vec i (j - 1ul)) (loc_vector_within vec (j - 1ul) j))) ...
val loc_vector_within_union_rev: #a:Type -> vec:vector a -> i:uint32_t -> j:uint32_t{i < j && j <= size_of vec} -> Lemma (requires True) (ensures (loc_vector_within vec i j == loc_union (loc_vector_within vec i (j - 1ul)) (loc_vector_within vec (j - 1ul) j))) ...
let rec loc_vector_within_union_rev #a vec i j = if i = j - 1ul then () else begin loc_vector_within_union_rev vec (i + 1ul) j; loc_union_assoc (B.loc_buffer (B.gsub (Vec?.vs vec) i 1ul)) (loc_vector_within vec (i + 1ul) (j - 1ul)) (loc_vector_within vec (j - 1ul) j) ...
{ "file_name": "ulib/LowStar.Vector.fst", "git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3", "git_url": "https://github.com/FStarLang/FStar.git", "project_name": "FStar" }
{ "end_col": 5, "end_line": 209, "start_col": 0, "start_line": 202 }
(* Copyright 2008-2018 Microsoft Research Licensed under the Apache License, Version 2.0 (the "License"); you may not use this file except in compliance with the License. You may obtain a copy of the License at http://www.apache.org/licenses/LICENSE-2.0 Unless required by applicable law or agre...
{ "checked_file": "/", "dependencies": [ "prims.fst.checked", "LowStar.Modifies.fst.checked", "LowStar.Buffer.fst.checked", "FStar.UInt32.fsti.checked", "FStar.Set.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Map.fsti.checked", "FStar.Integers.f...
[ { "abbrev": true, "full_module": "FStar.UInt32", "short_module": "U32" }, { "abbrev": true, "full_module": "FStar.Seq", "short_module": "S" }, { "abbrev": true, "full_module": "LowStar.Buffer", "short_module": "B" }, { "abbrev": true, "full_module": "FStar.Hyp...
{ "detail_errors": false, "detail_hint_replay": false, "initial_fuel": 2, "initial_ifuel": 1, "max_fuel": 8, "max_ifuel": 2, "no_plugins": false, "no_smt": false, "no_tactics": false, "quake_hi": 1, "quake_keep": false, "quake_lo": 1, "retry": false, "reuse_hint_for": null, "smtencoding_el...
false
vec: LowStar.Vector.vector a -> i: LowStar.Vector.uint32_t -> j: LowStar.Vector.uint32_t{i < j && j <= LowStar.Vector.size_of vec} -> FStar.Pervasives.Lemma (ensures LowStar.Vector.loc_vector_within vec i j == LowStar.Monotonic.Buffer.loc_union (LowStar.Vector.loc_vector_within vec ...
FStar.Pervasives.Lemma
[ "lemma", "" ]
[]
[ "LowStar.Vector.vector", "LowStar.Vector.uint32_t", "Prims.b2t", "Prims.op_AmpAmp", "FStar.Integers.op_Less", "FStar.Integers.Unsigned", "FStar.Integers.W32", "FStar.Integers.op_Less_Equals", "LowStar.Vector.size_of", "Prims.op_Equality", "FStar.UInt32.t", "FStar.Integers.op_Subtraction", "F...
[ "recursion" ]
false
false
true
false
false
let rec loc_vector_within_union_rev #a vec i j =
if i = j - 1ul then () else (loc_vector_within_union_rev vec (i + 1ul) j; loc_union_assoc (B.loc_buffer (B.gsub (Vec?.vs vec) i 1ul)) (loc_vector_within vec (i + 1ul) (j - 1ul)) (loc_vector_within vec (j - 1ul) j))
false
LowStar.Vector.fst
LowStar.Vector.forall2_seq
val forall2_seq: #a:Type -> seq:S.seq a -> i:nat -> j:nat{i <= j && j <= S.length seq} -> p:(a -> a -> GTot Type0) -> GTot Type0
val forall2_seq: #a:Type -> seq:S.seq a -> i:nat -> j:nat{i <= j && j <= S.length seq} -> p:(a -> a -> GTot Type0) -> GTot Type0
let forall2_seq #a seq i j p = forall (k:nat{i <= k && k < j}) (l:nat{i <= l && l < j && k <> l}). p (S.index seq k) (S.index seq l)
{ "file_name": "ulib/LowStar.Vector.fst", "git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3", "git_url": "https://github.com/FStarLang/FStar.git", "project_name": "FStar" }
{ "end_col": 37, "end_line": 583, "start_col": 0, "start_line": 581 }
(* Copyright 2008-2018 Microsoft Research Licensed under the Apache License, Version 2.0 (the "License"); you may not use this file except in compliance with the License. You may obtain a copy of the License at http://www.apache.org/licenses/LICENSE-2.0 Unless required by applicable law or agre...
{ "checked_file": "/", "dependencies": [ "prims.fst.checked", "LowStar.Modifies.fst.checked", "LowStar.Buffer.fst.checked", "FStar.UInt32.fsti.checked", "FStar.Set.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Map.fsti.checked", "FStar.Integers.f...
[ { "abbrev": true, "full_module": "FStar.UInt32", "short_module": "U32" }, { "abbrev": true, "full_module": "FStar.Seq", "short_module": "S" }, { "abbrev": true, "full_module": "LowStar.Buffer", "short_module": "B" }, { "abbrev": true, "full_module": "FStar.Hyp...
{ "detail_errors": false, "detail_hint_replay": false, "initial_fuel": 2, "initial_ifuel": 1, "max_fuel": 8, "max_ifuel": 2, "no_plugins": false, "no_smt": false, "no_tactics": false, "quake_hi": 1, "quake_keep": false, "quake_lo": 1, "retry": false, "reuse_hint_for": null, "smtencoding_el...
false
seq: FStar.Seq.Base.seq a -> i: FStar.Integers.nat -> j: FStar.Integers.nat{i <= j && j <= FStar.Seq.Base.length seq} -> p: (_: a -> _: a -> Prims.GTot Type0) -> Prims.GTot Type0
Prims.GTot
[ "sometrivial" ]
[]
[ "FStar.Seq.Base.seq", "FStar.Integers.nat", "Prims.b2t", "Prims.op_AmpAmp", "FStar.Integers.op_Less_Equals", "FStar.Integers.Signed", "FStar.Integers.Winfinite", "FStar.Seq.Base.length", "Prims.l_Forall", "FStar.Integers.op_Less", "Prims.op_disEquality", "FStar.Seq.Base.index" ]
[]
false
false
false
false
true
let forall2_seq #a seq i j p =
forall (k: nat{i <= k && k < j}) (l: nat{i <= l && l < j && k <> l}). p (S.index seq k) (S.index seq l)
false
CalcTest.fst
CalcTest.calc0
val calc0 (a: pos) : Lemma (a + a > a)
val calc0 (a: pos) : Lemma (a + a > a)
let calc0 (a : pos) : Lemma (a + a > a) = calc (>) { a + a; == {} 2 * a; > { lem1 a } a; }
{ "file_name": "examples/calc/CalcTest.fst", "git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3", "git_url": "https://github.com/FStarLang/FStar.git", "project_name": "FStar" }
{ "end_col": 3, "end_line": 15, "start_col": 0, "start_line": 8 }
module CalcTest open FStar.Mul open FStar.Calc let lem1 (a : pos) : Lemma (2 * a > a) = ()
{ "checked_file": "/", "dependencies": [ "prims.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Mul.fst.checked", "FStar.Calc.fsti.checked" ], "interface_file": false, "source_file": "CalcTest.fst" }
[ { "abbrev": false, "full_module": "FStar.Calc", "short_module": null }, { "abbrev": false, "full_module": "FStar.Mul", "short_module": null }, { "abbrev": false, "full_module": "FStar.Pervasives", "short_module": null }, { "abbrev": false, "full_module": "Prim...
{ "detail_errors": false, "detail_hint_replay": false, "initial_fuel": 2, "initial_ifuel": 1, "max_fuel": 8, "max_ifuel": 2, "no_plugins": false, "no_smt": false, "no_tactics": false, "quake_hi": 1, "quake_keep": false, "quake_lo": 1, "retry": false, "reuse_hint_for": null, "smtencoding_el...
false
a: Prims.pos -> FStar.Pervasives.Lemma (ensures a + a > a)
FStar.Pervasives.Lemma
[ "lemma" ]
[]
[ "Prims.pos", "FStar.Calc.calc_finish", "Prims.int", "Prims.b2t", "Prims.op_GreaterThan", "Prims.op_Addition", "Prims.Cons", "FStar.Preorder.relation", "Prims.eq2", "Prims.Nil", "Prims.unit", "FStar.Calc.calc_step", "FStar.Mul.op_Star", "FStar.Calc.calc_init", "FStar.Calc.calc_pack", "P...
[]
false
false
true
false
false
let calc0 (a: pos) : Lemma (a + a > a) =
calc ( > ) { a + a; ( == ) { () } 2 * a; ( > ) { lem1 a } a; }
false
CalcTest.fst
CalcTest.test_erase
val test_erase : _: Prims.unit -> Prims.int
let test_erase () = let x = 1 in calc (>=) { 10; >= {} 9; >= {} 8; == {} 4+4; >= {} 0; }; let y = 41 in x + y
{ "file_name": "examples/calc/CalcTest.fst", "git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3", "git_url": "https://github.com/FStarLang/FStar.git", "project_name": "FStar" }
{ "end_col": 7, "end_line": 75, "start_col": 0, "start_line": 61 }
module CalcTest open FStar.Mul open FStar.Calc let lem1 (a : pos) : Lemma (2 * a > a) = () let calc0 (a : pos) : Lemma (a + a > a) = calc (>) { a + a; == {} 2 * a; > { lem1 a } a; } (* The lemma above, desugared. F* eta-expands and ascribes <: Type in * order to treat boolean operators such...
{ "checked_file": "/", "dependencies": [ "prims.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Mul.fst.checked", "FStar.Calc.fsti.checked" ], "interface_file": false, "source_file": "CalcTest.fst" }
[ { "abbrev": false, "full_module": "FStar.Calc", "short_module": null }, { "abbrev": false, "full_module": "FStar.Mul", "short_module": null }, { "abbrev": false, "full_module": "FStar.Pervasives", "short_module": null }, { "abbrev": false, "full_module": "Prim...
{ "detail_errors": false, "detail_hint_replay": false, "initial_fuel": 2, "initial_ifuel": 1, "max_fuel": 8, "max_ifuel": 2, "no_plugins": false, "no_smt": false, "no_tactics": false, "quake_hi": 1, "quake_keep": false, "quake_lo": 1, "retry": false, "reuse_hint_for": null, "smtencoding_el...
false
_: Prims.unit -> Prims.int
Prims.Tot
[ "total" ]
[]
[ "Prims.unit", "Prims.op_Addition", "Prims.int", "FStar.Calc.calc_finish", "Prims.b2t", "Prims.op_GreaterThanOrEqual", "Prims.Cons", "FStar.Preorder.relation", "Prims.eq2", "Prims.Nil", "FStar.Calc.calc_step", "FStar.Calc.calc_init", "FStar.Calc.calc_pack", "Prims.squash" ]
[]
false
false
false
true
false
let test_erase () =
let x = 1 in calc ( >= ) { 10; ( >= ) { () } 9; ( >= ) { () } 8; ( == ) { () } 4 + 4; ( >= ) { () } 0; }; let y = 41 in x + y
false
LowStar.Vector.fst
LowStar.Vector.fold_left_buffer
val fold_left_buffer: #a:Type -> #b:Type0 -> len:uint32_t -> buf:B.buffer a{B.len buf = len} -> f:(b -> a -> Tot b) -> ib:b -> HST.ST b (requires (fun h0 -> B.live h0 buf)) (ensures (fun h0 v h1 -> h0 == h1 /\ v == fold_left_seq (B.as_seq h0 buf) f ib)) (decreases (B.length buf))
val fold_left_buffer: #a:Type -> #b:Type0 -> len:uint32_t -> buf:B.buffer a{B.len buf = len} -> f:(b -> a -> Tot b) -> ib:b -> HST.ST b (requires (fun h0 -> B.live h0 buf)) (ensures (fun h0 v h1 -> h0 == h1 /\ v == fold_left_seq (B.as_seq h0 buf) f ib)) (decreases (B.length buf))
let rec fold_left_buffer #a #b len buf f ib = if len = 0ul then ib else (fold_left_buffer (len - 1ul) (B.sub buf 1ul (len - 1ul)) f (f ib (B.index buf 0ul)))
{ "file_name": "ulib/LowStar.Vector.fst", "git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3", "git_url": "https://github.com/FStarLang/FStar.git", "project_name": "FStar" }
{ "end_col": 52, "end_line": 536, "start_col": 0, "start_line": 533 }
(* Copyright 2008-2018 Microsoft Research Licensed under the Apache License, Version 2.0 (the "License"); you may not use this file except in compliance with the License. You may obtain a copy of the License at http://www.apache.org/licenses/LICENSE-2.0 Unless required by applicable law or agre...
{ "checked_file": "/", "dependencies": [ "prims.fst.checked", "LowStar.Modifies.fst.checked", "LowStar.Buffer.fst.checked", "FStar.UInt32.fsti.checked", "FStar.Set.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Map.fsti.checked", "FStar.Integers.f...
[ { "abbrev": true, "full_module": "FStar.UInt32", "short_module": "U32" }, { "abbrev": true, "full_module": "FStar.Seq", "short_module": "S" }, { "abbrev": true, "full_module": "LowStar.Buffer", "short_module": "B" }, { "abbrev": true, "full_module": "FStar.Hyp...
{ "detail_errors": false, "detail_hint_replay": false, "initial_fuel": 2, "initial_ifuel": 1, "max_fuel": 8, "max_ifuel": 2, "no_plugins": false, "no_smt": false, "no_tactics": false, "quake_hi": 1, "quake_keep": false, "quake_lo": 1, "retry": false, "reuse_hint_for": null, "smtencoding_el...
false
len: LowStar.Vector.uint32_t -> buf: LowStar.Buffer.buffer a {LowStar.Monotonic.Buffer.len buf = len} -> f: (_: b -> _: a -> b) -> ib: b -> FStar.HyperStack.ST.ST b
FStar.HyperStack.ST.ST
[ "" ]
[]
[ "LowStar.Vector.uint32_t", "LowStar.Buffer.buffer", "Prims.b2t", "Prims.op_Equality", "FStar.UInt32.t", "LowStar.Monotonic.Buffer.len", "LowStar.Buffer.trivial_preorder", "FStar.UInt32.__uint_to_t", "Prims.bool", "LowStar.Vector.fold_left_buffer", "FStar.Integers.op_Subtraction", "FStar.Intege...
[ "recursion" ]
false
true
false
false
false
let rec fold_left_buffer #a #b len buf f ib =
if len = 0ul then ib else (fold_left_buffer (len - 1ul) (B.sub buf 1ul (len - 1ul)) f (f ib (B.index buf 0ul)))
false
CalcTest.fst
CalcTest.calc0_desugared
val calc0_desugared (a: pos) : Lemma (a + a > a)
val calc0_desugared (a: pos) : Lemma (a + a > a)
let calc0_desugared (a : pos) : Lemma (a + a > a) = calc_finish (fun x y -> (>) x y <: Type) (fun () -> calc_step (fun x y -> (>) x y <: Type) a (fun () -> calc_step (fun x y -> (==) x y <: Type) (2 * a) (fun () -> calc_init (a + a) ) (fun () -> ()) ) (fun () -> lem1 a) )
{ "file_name": "examples/calc/CalcTest.fst", "git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3", "git_url": "https://github.com/FStarLang/FStar.git", "project_name": "FStar" }
{ "end_col": 3, "end_line": 26, "start_col": 0, "start_line": 19 }
module CalcTest open FStar.Mul open FStar.Calc let lem1 (a : pos) : Lemma (2 * a > a) = () let calc0 (a : pos) : Lemma (a + a > a) = calc (>) { a + a; == {} 2 * a; > { lem1 a } a; } (* The lemma above, desugared. F* eta-expands and ascribes <: Type in
{ "checked_file": "/", "dependencies": [ "prims.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Mul.fst.checked", "FStar.Calc.fsti.checked" ], "interface_file": false, "source_file": "CalcTest.fst" }
[ { "abbrev": false, "full_module": "FStar.Calc", "short_module": null }, { "abbrev": false, "full_module": "FStar.Mul", "short_module": null }, { "abbrev": false, "full_module": "FStar.Pervasives", "short_module": null }, { "abbrev": false, "full_module": "Prim...
{ "detail_errors": false, "detail_hint_replay": false, "initial_fuel": 2, "initial_ifuel": 1, "max_fuel": 8, "max_ifuel": 2, "no_plugins": false, "no_smt": false, "no_tactics": false, "quake_hi": 1, "quake_keep": false, "quake_lo": 1, "retry": false, "reuse_hint_for": null, "smtencoding_el...
false
a: Prims.pos -> FStar.Pervasives.Lemma (ensures a + a > a)
FStar.Pervasives.Lemma
[ "lemma" ]
[]
[ "Prims.pos", "FStar.Calc.calc_finish", "Prims.int", "Prims.b2t", "Prims.op_GreaterThan", "Prims.op_Addition", "Prims.Cons", "FStar.Preorder.relation", "Prims.eq2", "Prims.Nil", "Prims.unit", "FStar.Calc.calc_step", "FStar.Mul.op_Star", "FStar.Calc.calc_init", "FStar.Calc.calc_pack", "P...
[]
false
false
true
false
false
let calc0_desugared (a: pos) : Lemma (a + a > a) =
calc_finish (fun x y -> ( > ) x y <: Type) (fun () -> calc_step (fun x y -> ( > ) x y <: Type) a (fun () -> calc_step (fun x y -> ( == ) x y <: Type) (2 * a) (fun () -> calc_init (a + a)) (fun () -> ())) (fun () -> lem1 a))
false
CalcTest.fst
CalcTest.test_ge
val test_ge : _: Prims.unit -> Prims.unit
let test_ge () = calc (>=) { 10; >= {} 9; >= {} 8; == {} 4+4; >= {} 0; }
{ "file_name": "examples/calc/CalcTest.fst", "git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3", "git_url": "https://github.com/FStarLang/FStar.git", "project_name": "FStar" }
{ "end_col": 3, "end_line": 59, "start_col": 0, "start_line": 48 }
module CalcTest open FStar.Mul open FStar.Calc let lem1 (a : pos) : Lemma (2 * a > a) = () let calc0 (a : pos) : Lemma (a + a > a) = calc (>) { a + a; == {} 2 * a; > { lem1 a } a; } (* The lemma above, desugared. F* eta-expands and ascribes <: Type in * order to treat boolean operators such...
{ "checked_file": "/", "dependencies": [ "prims.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Mul.fst.checked", "FStar.Calc.fsti.checked" ], "interface_file": false, "source_file": "CalcTest.fst" }
[ { "abbrev": false, "full_module": "FStar.Calc", "short_module": null }, { "abbrev": false, "full_module": "FStar.Mul", "short_module": null }, { "abbrev": false, "full_module": "FStar.Pervasives", "short_module": null }, { "abbrev": false, "full_module": "Prim...
{ "detail_errors": false, "detail_hint_replay": false, "initial_fuel": 2, "initial_ifuel": 1, "max_fuel": 8, "max_ifuel": 2, "no_plugins": false, "no_smt": false, "no_tactics": false, "quake_hi": 1, "quake_keep": false, "quake_lo": 1, "retry": false, "reuse_hint_for": null, "smtencoding_el...
false
_: Prims.unit -> Prims.unit
Prims.Tot
[ "total" ]
[]
[ "Prims.unit", "FStar.Calc.calc_finish", "Prims.int", "Prims.b2t", "Prims.op_GreaterThanOrEqual", "Prims.Cons", "FStar.Preorder.relation", "Prims.eq2", "Prims.Nil", "FStar.Calc.calc_step", "Prims.op_Addition", "FStar.Calc.calc_init", "FStar.Calc.calc_pack", "Prims.squash" ]
[]
false
false
false
true
false
let test_ge () =
calc ( >= ) { 10; ( >= ) { () } 9; ( >= ) { () } 8; ( == ) { () } 4 + 4; ( >= ) { () } 0; }
false
CalcTest.fst
CalcTest.test_gt
val test_gt : _: Prims.unit -> Prims.unit
let test_gt () = calc (>) { 10; >= {} 9; > { () } 8; == {} 4+4; >= {} 0; }
{ "file_name": "examples/calc/CalcTest.fst", "git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3", "git_url": "https://github.com/FStarLang/FStar.git", "project_name": "FStar" }
{ "end_col": 3, "end_line": 88, "start_col": 0, "start_line": 77 }
module CalcTest open FStar.Mul open FStar.Calc let lem1 (a : pos) : Lemma (2 * a > a) = () let calc0 (a : pos) : Lemma (a + a > a) = calc (>) { a + a; == {} 2 * a; > { lem1 a } a; } (* The lemma above, desugared. F* eta-expands and ascribes <: Type in * order to treat boolean operators such...
{ "checked_file": "/", "dependencies": [ "prims.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Mul.fst.checked", "FStar.Calc.fsti.checked" ], "interface_file": false, "source_file": "CalcTest.fst" }
[ { "abbrev": false, "full_module": "FStar.Calc", "short_module": null }, { "abbrev": false, "full_module": "FStar.Mul", "short_module": null }, { "abbrev": false, "full_module": "FStar.Pervasives", "short_module": null }, { "abbrev": false, "full_module": "Prim...
{ "detail_errors": false, "detail_hint_replay": false, "initial_fuel": 2, "initial_ifuel": 1, "max_fuel": 8, "max_ifuel": 2, "no_plugins": false, "no_smt": false, "no_tactics": false, "quake_hi": 1, "quake_keep": false, "quake_lo": 1, "retry": false, "reuse_hint_for": null, "smtencoding_el...
false
_: Prims.unit -> Prims.unit
Prims.Tot
[ "total" ]
[]
[ "Prims.unit", "FStar.Calc.calc_finish", "Prims.int", "Prims.b2t", "Prims.op_GreaterThan", "Prims.Cons", "FStar.Preorder.relation", "Prims.op_GreaterThanOrEqual", "Prims.eq2", "Prims.Nil", "FStar.Calc.calc_step", "Prims.op_Addition", "FStar.Calc.calc_init", "FStar.Calc.calc_pack", "Prims....
[]
false
false
false
true
false
let test_gt () =
calc ( > ) { 10; ( >= ) { () } 9; ( > ) { () } 8; ( == ) { () } 4 + 4; ( >= ) { () } 0; }
false
CalcTest.fst
CalcTest.calc1
val calc1 (a b c d e: int) (h1: (unit -> Lemma (a * (c + 1) = 24))) (h2: (unit -> Lemma (b + d == 25))) : Lemma (a + b + a * c + d - (e - e) > 30)
val calc1 (a b c d e: int) (h1: (unit -> Lemma (a * (c + 1) = 24))) (h2: (unit -> Lemma (b + d == 25))) : Lemma (a + b + a * c + d - (e - e) > 30)
let calc1 (a b c d e : int) (h1 : unit -> Lemma (a * (c + 1) = 24)) (h2 : unit -> Lemma (b + d == 25)) : Lemma (a + b + a * c + d - (e - e) > 30) = calc (>) { a + b + a * c + d - (e - e); == { (* reorder, e-e = 0 *) } a + a * c + b + d; == { (* distributivity *) } a * (c +...
{ "file_name": "examples/calc/CalcTest.fst", "git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3", "git_url": "https://github.com/FStarLang/FStar.git", "project_name": "FStar" }
{ "end_col": 3, "end_line": 46, "start_col": 0, "start_line": 28 }
module CalcTest open FStar.Mul open FStar.Calc let lem1 (a : pos) : Lemma (2 * a > a) = () let calc0 (a : pos) : Lemma (a + a > a) = calc (>) { a + a; == {} 2 * a; > { lem1 a } a; } (* The lemma above, desugared. F* eta-expands and ascribes <: Type in * order to treat boolean operators such...
{ "checked_file": "/", "dependencies": [ "prims.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Mul.fst.checked", "FStar.Calc.fsti.checked" ], "interface_file": false, "source_file": "CalcTest.fst" }
[ { "abbrev": false, "full_module": "FStar.Calc", "short_module": null }, { "abbrev": false, "full_module": "FStar.Mul", "short_module": null }, { "abbrev": false, "full_module": "FStar.Pervasives", "short_module": null }, { "abbrev": false, "full_module": "Prim...
{ "detail_errors": false, "detail_hint_replay": false, "initial_fuel": 2, "initial_ifuel": 1, "max_fuel": 8, "max_ifuel": 2, "no_plugins": false, "no_smt": false, "no_tactics": false, "quake_hi": 1, "quake_keep": false, "quake_lo": 1, "retry": false, "reuse_hint_for": null, "smtencoding_el...
false
a: Prims.int -> b: Prims.int -> c: Prims.int -> d: Prims.int -> e: Prims.int -> h1: (_: Prims.unit -> FStar.Pervasives.Lemma (ensures a * (c + 1) = 24)) -> h2: (_: Prims.unit -> FStar.Pervasives.Lemma (ensures b + d == 25)) -> FStar.Pervasives.Lemma (ensures a + b + a * c + d - (e - e) > ...
FStar.Pervasives.Lemma
[ "lemma" ]
[]
[ "Prims.int", "Prims.unit", "Prims.l_True", "Prims.squash", "Prims.b2t", "Prims.op_Equality", "FStar.Mul.op_Star", "Prims.op_Addition", "Prims.Nil", "FStar.Pervasives.pattern", "Prims.eq2", "FStar.Calc.calc_finish", "Prims.op_GreaterThan", "Prims.op_Subtraction", "Prims.Cons", "FStar.Pr...
[]
false
false
true
false
false
let calc1 (a b c d e: int) (h1: (unit -> Lemma (a * (c + 1) = 24))) (h2: (unit -> Lemma (b + d == 25))) : Lemma (a + b + a * c + d - (e - e) > 30) =
calc ( > ) { a + b + a * c + d - (e - e); ( == ) { () } a + a * c + b + d; ( == ) { () } a * (c + 1) + b + d; ( == ) { h1 () } 24 + b + d; ( == ) { h2 () } 24 + 25; ( == ) { () } 49; ( > ) { () } 30; }
false
LowStar.Vector.fst
LowStar.Vector.forall2_all
val forall2_all: #a:Type -> h:HS.mem -> vec:vector a -> p:(a -> a -> GTot Type0) -> GTot Type0
val forall2_all: #a:Type -> h:HS.mem -> vec:vector a -> p:(a -> a -> GTot Type0) -> GTot Type0
let forall2_all #a h vec p = forall2 h vec 0ul (size_of vec) p
{ "file_name": "ulib/LowStar.Vector.fst", "git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3", "git_url": "https://github.com/FStarLang/FStar.git", "project_name": "FStar" }
{ "end_col": 35, "end_line": 603, "start_col": 0, "start_line": 602 }
(* Copyright 2008-2018 Microsoft Research Licensed under the Apache License, Version 2.0 (the "License"); you may not use this file except in compliance with the License. You may obtain a copy of the License at http://www.apache.org/licenses/LICENSE-2.0 Unless required by applicable law or agre...
{ "checked_file": "/", "dependencies": [ "prims.fst.checked", "LowStar.Modifies.fst.checked", "LowStar.Buffer.fst.checked", "FStar.UInt32.fsti.checked", "FStar.Set.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Map.fsti.checked", "FStar.Integers.f...
[ { "abbrev": true, "full_module": "FStar.UInt32", "short_module": "U32" }, { "abbrev": true, "full_module": "FStar.Seq", "short_module": "S" }, { "abbrev": true, "full_module": "LowStar.Buffer", "short_module": "B" }, { "abbrev": true, "full_module": "FStar.Hyp...
{ "detail_errors": false, "detail_hint_replay": false, "initial_fuel": 2, "initial_ifuel": 1, "max_fuel": 8, "max_ifuel": 2, "no_plugins": false, "no_smt": false, "no_tactics": false, "quake_hi": 1, "quake_keep": false, "quake_lo": 1, "retry": false, "reuse_hint_for": null, "smtencoding_el...
false
h: FStar.Monotonic.HyperStack.mem -> vec: LowStar.Vector.vector a -> p: (_: a -> _: a -> Prims.GTot Type0) -> Prims.GTot Type0
Prims.GTot
[ "sometrivial" ]
[]
[ "FStar.Monotonic.HyperStack.mem", "LowStar.Vector.vector", "LowStar.Vector.forall2", "FStar.UInt32.__uint_to_t", "LowStar.Vector.size_of" ]
[]
false
false
false
false
true
let forall2_all #a h vec p =
forall2 h vec 0ul (size_of vec) p
false
LowStar.Vector.fst
LowStar.Vector.get_preserved_within
val get_preserved_within: #a:Type -> vec:vector a -> i:uint32_t -> j:uint32_t{i <= j && j <= size_of vec} -> k:uint32_t{(k < i || j <= k) && k < size_of vec} -> h0:HS.mem -> h1:HS.mem -> Lemma (requires (live h0 vec /\ modifies (loc_vector_within vec i j) h0 h1)) (ensures (get h0 vec...
val get_preserved_within: #a:Type -> vec:vector a -> i:uint32_t -> j:uint32_t{i <= j && j <= size_of vec} -> k:uint32_t{(k < i || j <= k) && k < size_of vec} -> h0:HS.mem -> h1:HS.mem -> Lemma (requires (live h0 vec /\ modifies (loc_vector_within vec i j) h0 h1)) (ensures (get h0 vec...
let get_preserved_within #a vec i j k h0 h1 = if k < i then begin loc_vector_within_disjoint vec k (k + 1ul) i j; get_preserved vec k (loc_vector_within vec i j) h0 h1 end else begin loc_vector_within_disjoint vec i j k (k + 1ul); get_preserved vec k (loc_vector_within vec i j) h0 h1 end
{ "file_name": "ulib/LowStar.Vector.fst", "git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3", "git_url": "https://github.com/FStarLang/FStar.git", "project_name": "FStar" }
{ "end_col": 5, "end_line": 643, "start_col": 0, "start_line": 635 }
(* Copyright 2008-2018 Microsoft Research Licensed under the Apache License, Version 2.0 (the "License"); you may not use this file except in compliance with the License. You may obtain a copy of the License at http://www.apache.org/licenses/LICENSE-2.0 Unless required by applicable law or agre...
{ "checked_file": "/", "dependencies": [ "prims.fst.checked", "LowStar.Modifies.fst.checked", "LowStar.Buffer.fst.checked", "FStar.UInt32.fsti.checked", "FStar.Set.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Map.fsti.checked", "FStar.Integers.f...
[ { "abbrev": true, "full_module": "FStar.UInt32", "short_module": "U32" }, { "abbrev": true, "full_module": "FStar.Seq", "short_module": "S" }, { "abbrev": true, "full_module": "LowStar.Buffer", "short_module": "B" }, { "abbrev": true, "full_module": "FStar.Hyp...
{ "detail_errors": false, "detail_hint_replay": false, "initial_fuel": 2, "initial_ifuel": 1, "max_fuel": 8, "max_ifuel": 2, "no_plugins": false, "no_smt": false, "no_tactics": false, "quake_hi": 1, "quake_keep": false, "quake_lo": 1, "retry": false, "reuse_hint_for": null, "smtencoding_el...
false
vec: LowStar.Vector.vector a -> i: LowStar.Vector.uint32_t -> j: LowStar.Vector.uint32_t{i <= j && j <= LowStar.Vector.size_of vec} -> k: LowStar.Vector.uint32_t{(k < i || j <= k) && k < LowStar.Vector.size_of vec} -> h0: FStar.Monotonic.HyperStack.mem -> h1: FStar.Monotonic.HyperStack.mem ->...
FStar.Pervasives.Lemma
[ "lemma" ]
[]
[ "LowStar.Vector.vector", "LowStar.Vector.uint32_t", "Prims.b2t", "Prims.op_AmpAmp", "FStar.Integers.op_Less_Equals", "FStar.Integers.Unsigned", "FStar.Integers.W32", "LowStar.Vector.size_of", "Prims.op_BarBar", "FStar.Integers.op_Less", "FStar.Monotonic.HyperStack.mem", "LowStar.Vector.get_pre...
[]
false
false
true
false
false
let get_preserved_within #a vec i j k h0 h1 =
if k < i then (loc_vector_within_disjoint vec k (k + 1ul) i j; get_preserved vec k (loc_vector_within vec i j) h0 h1) else (loc_vector_within_disjoint vec i j k (k + 1ul); get_preserved vec k (loc_vector_within vec i j) h0 h1)
false
LowStar.Vector.fst
LowStar.Vector.modifies_as_seq_within
val modifies_as_seq_within: #a:Type -> vec:vector a -> i:uint32_t -> j:uint32_t{i <= j && j <= size_of vec} -> dloc:loc -> h0:HS.mem -> h1:HS.mem -> Lemma (requires (live h0 vec /\ loc_disjoint (loc_vector_within vec i j) dloc /\ modifies dloc h0 h1)) (ensures (S.slic...
val modifies_as_seq_within: #a:Type -> vec:vector a -> i:uint32_t -> j:uint32_t{i <= j && j <= size_of vec} -> dloc:loc -> h0:HS.mem -> h1:HS.mem -> Lemma (requires (live h0 vec /\ loc_disjoint (loc_vector_within vec i j) dloc /\ modifies dloc h0 h1)) (ensures (S.slic...
let rec modifies_as_seq_within #a vec i j dloc h0 h1 = if i = j then () else begin B.modifies_buffer_elim (B.gsub (Vec?.vs vec) i 1ul) dloc h0 h1; modifies_as_seq_within vec (i + 1ul) j dloc h0 h1; assert (S.equal (S.slice (as_seq h0 vec) (U32.v i) (U32.v j)) (S.append (S.slice (as_s...
{ "file_name": "ulib/LowStar.Vector.fst", "git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3", "git_url": "https://github.com/FStarLang/FStar.git", "project_name": "FStar" }
{ "end_col": 5, "end_line": 258, "start_col": 0, "start_line": 247 }
(* Copyright 2008-2018 Microsoft Research Licensed under the Apache License, Version 2.0 (the "License"); you may not use this file except in compliance with the License. You may obtain a copy of the License at http://www.apache.org/licenses/LICENSE-2.0 Unless required by applicable law or agre...
{ "checked_file": "/", "dependencies": [ "prims.fst.checked", "LowStar.Modifies.fst.checked", "LowStar.Buffer.fst.checked", "FStar.UInt32.fsti.checked", "FStar.Set.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Map.fsti.checked", "FStar.Integers.f...
[ { "abbrev": true, "full_module": "FStar.UInt32", "short_module": "U32" }, { "abbrev": true, "full_module": "FStar.Seq", "short_module": "S" }, { "abbrev": true, "full_module": "LowStar.Buffer", "short_module": "B" }, { "abbrev": true, "full_module": "FStar.Hyp...
{ "detail_errors": false, "detail_hint_replay": false, "initial_fuel": 2, "initial_ifuel": 1, "max_fuel": 8, "max_ifuel": 2, "no_plugins": false, "no_smt": false, "no_tactics": false, "quake_hi": 1, "quake_keep": false, "quake_lo": 1, "retry": false, "reuse_hint_for": null, "smtencoding_el...
false
vec: LowStar.Vector.vector a -> i: LowStar.Vector.uint32_t -> j: LowStar.Vector.uint32_t{i <= j && j <= LowStar.Vector.size_of vec} -> dloc: LowStar.Monotonic.Buffer.loc -> h0: FStar.Monotonic.HyperStack.mem -> h1: FStar.Monotonic.HyperStack.mem -> FStar.Pervasives.Lemma (requires ...
FStar.Pervasives.Lemma
[ "lemma", "" ]
[]
[ "LowStar.Vector.vector", "LowStar.Vector.uint32_t", "Prims.b2t", "Prims.op_AmpAmp", "FStar.Integers.op_Less_Equals", "FStar.Integers.Unsigned", "FStar.Integers.W32", "LowStar.Vector.size_of", "LowStar.Monotonic.Buffer.loc", "FStar.Monotonic.HyperStack.mem", "Prims.op_Equality", "Prims.bool", ...
[ "recursion" ]
false
false
true
false
false
let rec modifies_as_seq_within #a vec i j dloc h0 h1 =
if i = j then () else (B.modifies_buffer_elim (B.gsub (Vec?.vs vec) i 1ul) dloc h0 h1; modifies_as_seq_within vec (i + 1ul) j dloc h0 h1; assert (S.equal (S.slice (as_seq h0 vec) (U32.v i) (U32.v j)) (S.append (S.slice (as_seq h0 vec) (U32.v i) (U32.v i + 1)) (S.slice (as_seq h0 vec) (...
false
Ast.fst
Ast.string_of_pos
val string_of_pos : p: Ast.pos -> Prims.string
let string_of_pos p = Printf.sprintf "%s:(%d,%d)" p.filename p.line p.col
{ "file_name": "src/3d/Ast.fst", "git_rev": "00217c4a89f5ba56002ba9aa5b4a9d5903bfe9fa", "git_url": "https://github.com/project-everest/everparse.git", "project_name": "everparse" }
{ "end_col": 53, "end_line": 77, "start_col": 0, "start_line": 76 }
(* Copyright 2019 Microsoft Research Licensed under the Apache License, Version 2.0 (the "License"); you may not use this file except in compliance with the License. You may obtain a copy of the License at http://www.apache.org/licenses/LICENSE-2.0 Unless required by applicable law or agreed to...
{ "checked_file": "/", "dependencies": [ "prims.fst.checked", "Options.fsti.checked", "Hashtable.fsti.checked", "FStar.UInt.fsti.checked", "FStar.String.fsti.checked", "FStar.ST.fst.checked", "FStar.Printf.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fst...
[ { "abbrev": false, "full_module": "FStar.All", "short_module": null }, { "abbrev": false, "full_module": "FStar.Pervasives", "short_module": null }, { "abbrev": false, "full_module": "Prims", "short_module": null }, { "abbrev": false, "full_module": "FStar", ...
{ "detail_errors": false, "detail_hint_replay": false, "initial_fuel": 2, "initial_ifuel": 1, "max_fuel": 8, "max_ifuel": 2, "no_plugins": false, "no_smt": false, "no_tactics": false, "quake_hi": 1, "quake_keep": false, "quake_lo": 1, "retry": false, "reuse_hint_for": null, "smtencoding_el...
false
p: Ast.pos -> Prims.string
Prims.Tot
[ "total" ]
[]
[ "Ast.pos", "FStar.Printf.sprintf", "Ast.__proj__Mkpos__item__filename", "Ast.__proj__Mkpos__item__line", "Ast.__proj__Mkpos__item__col", "Prims.string" ]
[]
false
false
false
true
false
let string_of_pos p =
Printf.sprintf "%s:(%d,%d)" p.filename p.line p.col
false
Ast.fst
Ast.string_of_range
val string_of_range : r: (Ast.pos * Ast.pos) -> Prims.string
let string_of_range r = let p, q = r in if p.filename = q.filename then Printf.sprintf "%s:(%d,%d--%d,%d)" p.filename p.line p.col q.line q.col else Printf.sprintf "%s -- %s" (string_of_pos p) (string_of_pos q)
{ "file_name": "src/3d/Ast.fst", "git_rev": "00217c4a89f5ba56002ba9aa5b4a9d5903bfe9fa", "git_url": "https://github.com/project-everest/everparse.git", "project_name": "everparse" }
{ "end_col": 31, "end_line": 92, "start_col": 0, "start_line": 85 }
(* Copyright 2019 Microsoft Research Licensed under the Apache License, Version 2.0 (the "License"); you may not use this file except in compliance with the License. You may obtain a copy of the License at http://www.apache.org/licenses/LICENSE-2.0 Unless required by applicable law or agreed to...
{ "checked_file": "/", "dependencies": [ "prims.fst.checked", "Options.fsti.checked", "Hashtable.fsti.checked", "FStar.UInt.fsti.checked", "FStar.String.fsti.checked", "FStar.ST.fst.checked", "FStar.Printf.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fst...
[ { "abbrev": false, "full_module": "FStar.All", "short_module": null }, { "abbrev": false, "full_module": "FStar.Pervasives", "short_module": null }, { "abbrev": false, "full_module": "Prims", "short_module": null }, { "abbrev": false, "full_module": "FStar", ...
{ "detail_errors": false, "detail_hint_replay": false, "initial_fuel": 2, "initial_ifuel": 1, "max_fuel": 8, "max_ifuel": 2, "no_plugins": false, "no_smt": false, "no_tactics": false, "quake_hi": 1, "quake_keep": false, "quake_lo": 1, "retry": false, "reuse_hint_for": null, "smtencoding_el...
false
r: (Ast.pos * Ast.pos) -> Prims.string
Prims.Tot
[ "total" ]
[]
[ "FStar.Pervasives.Native.tuple2", "Ast.pos", "Prims.op_Equality", "Prims.string", "Ast.__proj__Mkpos__item__filename", "FStar.Printf.sprintf", "Ast.__proj__Mkpos__item__line", "Ast.__proj__Mkpos__item__col", "Prims.bool", "Ast.string_of_pos" ]
[]
false
false
false
true
false
let string_of_range r =
let p, q = r in if p.filename = q.filename then Printf.sprintf "%s:(%d,%d--%d,%d)" p.filename p.line p.col q.line q.col else Printf.sprintf "%s -- %s" (string_of_pos p) (string_of_pos q)
false
Ast.fst
Ast.range
val range : Type0
let range = pos * pos
{ "file_name": "src/3d/Ast.fst", "git_rev": "00217c4a89f5ba56002ba9aa5b4a9d5903bfe9fa", "git_url": "https://github.com/project-everest/everparse.git", "project_name": "everparse" }
{ "end_col": 21, "end_line": 80, "start_col": 0, "start_line": 80 }
(* Copyright 2019 Microsoft Research Licensed under the Apache License, Version 2.0 (the "License"); you may not use this file except in compliance with the License. You may obtain a copy of the License at http://www.apache.org/licenses/LICENSE-2.0 Unless required by applicable law or agreed to...
{ "checked_file": "/", "dependencies": [ "prims.fst.checked", "Options.fsti.checked", "Hashtable.fsti.checked", "FStar.UInt.fsti.checked", "FStar.String.fsti.checked", "FStar.ST.fst.checked", "FStar.Printf.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fst...
[ { "abbrev": false, "full_module": "FStar.All", "short_module": null }, { "abbrev": false, "full_module": "FStar.Pervasives", "short_module": null }, { "abbrev": false, "full_module": "Prims", "short_module": null }, { "abbrev": false, "full_module": "FStar", ...
{ "detail_errors": false, "detail_hint_replay": false, "initial_fuel": 2, "initial_ifuel": 1, "max_fuel": 8, "max_ifuel": 2, "no_plugins": false, "no_smt": false, "no_tactics": false, "quake_hi": 1, "quake_keep": false, "quake_lo": 1, "retry": false, "reuse_hint_for": null, "smtencoding_el...
false
Type0
Prims.Tot
[ "total" ]
[]
[ "FStar.Pervasives.Native.tuple2", "Ast.pos" ]
[]
false
false
false
true
true
let range =
pos * pos
false
LowStar.Vector.fst
LowStar.Vector.get_preserved
val get_preserved: #a:Type -> vec:vector a -> i:uint32_t{i < size_of vec} -> p:loc -> h0:HS.mem -> h1:HS.mem -> Lemma (requires (live h0 vec /\ loc_disjoint p (loc_vector_within vec i (i + 1ul)) /\ modifies p h0 h1)) (ensures (get h0 vec i == get h1 vec i))
val get_preserved: #a:Type -> vec:vector a -> i:uint32_t{i < size_of vec} -> p:loc -> h0:HS.mem -> h1:HS.mem -> Lemma (requires (live h0 vec /\ loc_disjoint p (loc_vector_within vec i (i + 1ul)) /\ modifies p h0 h1)) (ensures (get h0 vec i == get h1 vec i))
let get_preserved #a vec i p h0 h1 = get_as_seq_index h0 (Vec?.vs vec) i; get_as_seq_index h1 (Vec?.vs vec) i
{ "file_name": "ulib/LowStar.Vector.fst", "git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3", "git_url": "https://github.com/FStarLang/FStar.git", "project_name": "FStar" }
{ "end_col": 37, "end_line": 622, "start_col": 0, "start_line": 620 }
(* Copyright 2008-2018 Microsoft Research Licensed under the Apache License, Version 2.0 (the "License"); you may not use this file except in compliance with the License. You may obtain a copy of the License at http://www.apache.org/licenses/LICENSE-2.0 Unless required by applicable law or agre...
{ "checked_file": "/", "dependencies": [ "prims.fst.checked", "LowStar.Modifies.fst.checked", "LowStar.Buffer.fst.checked", "FStar.UInt32.fsti.checked", "FStar.Set.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Map.fsti.checked", "FStar.Integers.f...
[ { "abbrev": true, "full_module": "FStar.UInt32", "short_module": "U32" }, { "abbrev": true, "full_module": "FStar.Seq", "short_module": "S" }, { "abbrev": true, "full_module": "LowStar.Buffer", "short_module": "B" }, { "abbrev": true, "full_module": "FStar.Hyp...
{ "detail_errors": false, "detail_hint_replay": false, "initial_fuel": 2, "initial_ifuel": 1, "max_fuel": 8, "max_ifuel": 2, "no_plugins": false, "no_smt": false, "no_tactics": false, "quake_hi": 1, "quake_keep": false, "quake_lo": 1, "retry": false, "reuse_hint_for": null, "smtencoding_el...
false
vec: LowStar.Vector.vector a -> i: LowStar.Vector.uint32_t{i < LowStar.Vector.size_of vec} -> p: LowStar.Monotonic.Buffer.loc -> h0: FStar.Monotonic.HyperStack.mem -> h1: FStar.Monotonic.HyperStack.mem -> FStar.Pervasives.Lemma (requires LowStar.Vector.live h0 vec /\ LowStar...
FStar.Pervasives.Lemma
[ "lemma" ]
[]
[ "LowStar.Vector.vector", "LowStar.Vector.uint32_t", "Prims.b2t", "FStar.Integers.op_Less", "FStar.Integers.Unsigned", "FStar.Integers.W32", "LowStar.Vector.size_of", "LowStar.Monotonic.Buffer.loc", "FStar.Monotonic.HyperStack.mem", "LowStar.Vector.get_as_seq_index", "LowStar.Vector.__proj__Vec__...
[]
true
false
true
false
false
let get_preserved #a vec i p h0 h1 =
get_as_seq_index h0 (Vec?.vs vec) i; get_as_seq_index h1 (Vec?.vs vec) i
false
Ast.fst
Ast.reserved_prefix
val reserved_prefix : Prims.string
let reserved_prefix = "___"
{ "file_name": "src/3d/Ast.fst", "git_rev": "00217c4a89f5ba56002ba9aa5b4a9d5903bfe9fa", "git_url": "https://github.com/project-everest/everparse.git", "project_name": "everparse" }
{ "end_col": 27, "end_line": 21, "start_col": 0, "start_line": 21 }
(* Copyright 2019 Microsoft Research Licensed under the Apache License, Version 2.0 (the "License"); you may not use this file except in compliance with the License. You may obtain a copy of the License at http://www.apache.org/licenses/LICENSE-2.0 Unless required by applicable law or agreed to...
{ "checked_file": "/", "dependencies": [ "prims.fst.checked", "Options.fsti.checked", "Hashtable.fsti.checked", "FStar.UInt.fsti.checked", "FStar.String.fsti.checked", "FStar.ST.fst.checked", "FStar.Printf.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fst...
[ { "abbrev": false, "full_module": "FStar.All", "short_module": null }, { "abbrev": false, "full_module": "FStar.Pervasives", "short_module": null }, { "abbrev": false, "full_module": "Prims", "short_module": null }, { "abbrev": false, "full_module": "FStar", ...
{ "detail_errors": false, "detail_hint_replay": false, "initial_fuel": 2, "initial_ifuel": 1, "max_fuel": 8, "max_ifuel": 2, "no_plugins": false, "no_smt": false, "no_tactics": false, "quake_hi": 1, "quake_keep": false, "quake_lo": 1, "retry": false, "reuse_hint_for": null, "smtencoding_el...
false
Prims.string
Prims.Tot
[ "total" ]
[]
[]
[]
false
false
false
true
false
let reserved_prefix =
"___"
false
Ast.fst
Ast.with_range
val with_range (x: 'a) (r: range) : with_meta_t 'a
val with_range (x: 'a) (r: range) : with_meta_t 'a
let with_range (x:'a) (r:range) : with_meta_t 'a = with_range_and_comments x r []
{ "file_name": "src/3d/Ast.fst", "git_rev": "00217c4a89f5ba56002ba9aa5b4a9d5903bfe9fa", "git_url": "https://github.com/project-everest/everparse.git", "project_name": "everparse" }
{ "end_col": 81, "end_line": 119, "start_col": 0, "start_line": 119 }
(* Copyright 2019 Microsoft Research Licensed under the Apache License, Version 2.0 (the "License"); you may not use this file except in compliance with the License. You may obtain a copy of the License at http://www.apache.org/licenses/LICENSE-2.0 Unless required by applicable law or agreed to...
{ "checked_file": "/", "dependencies": [ "prims.fst.checked", "Options.fsti.checked", "Hashtable.fsti.checked", "FStar.UInt.fsti.checked", "FStar.String.fsti.checked", "FStar.ST.fst.checked", "FStar.Printf.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fst...
[ { "abbrev": false, "full_module": "FStar.All", "short_module": null }, { "abbrev": false, "full_module": "FStar.Pervasives", "short_module": null }, { "abbrev": false, "full_module": "Prims", "short_module": null }, { "abbrev": false, "full_module": "FStar", ...
{ "detail_errors": false, "detail_hint_replay": false, "initial_fuel": 2, "initial_ifuel": 1, "max_fuel": 8, "max_ifuel": 2, "no_plugins": false, "no_smt": false, "no_tactics": false, "quake_hi": 1, "quake_keep": false, "quake_lo": 1, "retry": false, "reuse_hint_for": null, "smtencoding_el...
false
x: 'a -> r: Ast.range -> Ast.with_meta_t 'a
Prims.Tot
[ "total" ]
[]
[ "Ast.range", "Ast.with_range_and_comments", "Prims.Nil", "Prims.string", "Ast.with_meta_t" ]
[]
false
false
false
true
false
let with_range (x: 'a) (r: range) : with_meta_t 'a =
with_range_and_comments x r []
false
Ast.fst
Ast.with_meta_t_of_yojson
val with_meta_t_of_yojson (#a #b #c: Type) (f: (a -> b)) (x: a) : ML c
val with_meta_t_of_yojson (#a #b #c: Type) (f: (a -> b)) (x: a) : ML c
let with_meta_t_of_yojson (#a #b #c:Type) (f:(a -> b)) (x:a) : ML c = failwith "No reading yojson"
{ "file_name": "src/3d/Ast.fst", "git_rev": "00217c4a89f5ba56002ba9aa5b4a9d5903bfe9fa", "git_url": "https://github.com/project-everest/everparse.git", "project_name": "everparse" }
{ "end_col": 32, "end_line": 110, "start_col": 0, "start_line": 108 }
(* Copyright 2019 Microsoft Research Licensed under the Apache License, Version 2.0 (the "License"); you may not use this file except in compliance with the License. You may obtain a copy of the License at http://www.apache.org/licenses/LICENSE-2.0 Unless required by applicable law or agreed to...
{ "checked_file": "/", "dependencies": [ "prims.fst.checked", "Options.fsti.checked", "Hashtable.fsti.checked", "FStar.UInt.fsti.checked", "FStar.String.fsti.checked", "FStar.ST.fst.checked", "FStar.Printf.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fst...
[ { "abbrev": false, "full_module": "FStar.All", "short_module": null }, { "abbrev": false, "full_module": "FStar.Pervasives", "short_module": null }, { "abbrev": false, "full_module": "Prims", "short_module": null }, { "abbrev": false, "full_module": "FStar", ...
{ "detail_errors": false, "detail_hint_replay": false, "initial_fuel": 2, "initial_ifuel": 1, "max_fuel": 8, "max_ifuel": 2, "no_plugins": false, "no_smt": false, "no_tactics": false, "quake_hi": 1, "quake_keep": false, "quake_lo": 1, "retry": false, "reuse_hint_for": null, "smtencoding_el...
false
f: (_: a -> b) -> x: a -> FStar.All.ML c
FStar.All.ML
[ "ml" ]
[]
[ "FStar.All.failwith" ]
[]
false
true
false
false
false
let with_meta_t_of_yojson (#a #b #c: Type) (f: (a -> b)) (x: a) : ML c =
failwith "No reading yojson"
false
Ast.fst
Ast.comments
val comments : Type0
let comments = list string
{ "file_name": "src/3d/Ast.fst", "git_rev": "00217c4a89f5ba56002ba9aa5b4a9d5903bfe9fa", "git_url": "https://github.com/project-everest/everparse.git", "project_name": "everparse" }
{ "end_col": 26, "end_line": 83, "start_col": 0, "start_line": 83 }
(* Copyright 2019 Microsoft Research Licensed under the Apache License, Version 2.0 (the "License"); you may not use this file except in compliance with the License. You may obtain a copy of the License at http://www.apache.org/licenses/LICENSE-2.0 Unless required by applicable law or agreed to...
{ "checked_file": "/", "dependencies": [ "prims.fst.checked", "Options.fsti.checked", "Hashtable.fsti.checked", "FStar.UInt.fsti.checked", "FStar.String.fsti.checked", "FStar.ST.fst.checked", "FStar.Printf.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fst...
[ { "abbrev": false, "full_module": "FStar.All", "short_module": null }, { "abbrev": false, "full_module": "FStar.Pervasives", "short_module": null }, { "abbrev": false, "full_module": "Prims", "short_module": null }, { "abbrev": false, "full_module": "FStar", ...
{ "detail_errors": false, "detail_hint_replay": false, "initial_fuel": 2, "initial_ifuel": 1, "max_fuel": 8, "max_ifuel": 2, "no_plugins": false, "no_smt": false, "no_tactics": false, "quake_hi": 1, "quake_keep": false, "quake_lo": 1, "retry": false, "reuse_hint_for": null, "smtencoding_el...
false
Type0
Prims.Tot
[ "total" ]
[]
[ "Prims.list", "Prims.string" ]
[]
false
false
false
true
true
let comments =
list string
false
Ast.fst
Ast.dummy_pos
val dummy_pos : Ast.pos
let dummy_pos = { filename=""; line=0; col=0; }
{ "file_name": "src/3d/Ast.fst", "git_rev": "00217c4a89f5ba56002ba9aa5b4a9d5903bfe9fa", "git_url": "https://github.com/project-everest/everparse.git", "project_name": "everparse" }
{ "end_col": 1, "end_line": 98, "start_col": 0, "start_line": 94 }
(* Copyright 2019 Microsoft Research Licensed under the Apache License, Version 2.0 (the "License"); you may not use this file except in compliance with the License. You may obtain a copy of the License at http://www.apache.org/licenses/LICENSE-2.0 Unless required by applicable law or agreed to...
{ "checked_file": "/", "dependencies": [ "prims.fst.checked", "Options.fsti.checked", "Hashtable.fsti.checked", "FStar.UInt.fsti.checked", "FStar.String.fsti.checked", "FStar.ST.fst.checked", "FStar.Printf.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fst...
[ { "abbrev": false, "full_module": "FStar.All", "short_module": null }, { "abbrev": false, "full_module": "FStar.Pervasives", "short_module": null }, { "abbrev": false, "full_module": "Prims", "short_module": null }, { "abbrev": false, "full_module": "FStar", ...
{ "detail_errors": false, "detail_hint_replay": false, "initial_fuel": 2, "initial_ifuel": 1, "max_fuel": 8, "max_ifuel": 2, "no_plugins": false, "no_smt": false, "no_tactics": false, "quake_hi": 1, "quake_keep": false, "quake_lo": 1, "retry": false, "reuse_hint_for": null, "smtencoding_el...
false
Ast.pos
Prims.Tot
[ "total" ]
[]
[ "Ast.Mkpos" ]
[]
false
false
false
true
false
let dummy_pos =
{ filename = ""; line = 0; col = 0 }
false
Ast.fst
Ast.with_meta_t_to_yojson
val with_meta_t_to_yojson (f: ('a -> 'b)) (x: with_meta_t 'a) : 'b
val with_meta_t_to_yojson (f: ('a -> 'b)) (x: with_meta_t 'a) : 'b
let with_meta_t_to_yojson (f:('a -> 'b)) (x:with_meta_t 'a) : 'b = f x.v
{ "file_name": "src/3d/Ast.fst", "git_rev": "00217c4a89f5ba56002ba9aa5b4a9d5903bfe9fa", "git_url": "https://github.com/project-everest/everparse.git", "project_name": "everparse" }
{ "end_col": 9, "end_line": 113, "start_col": 0, "start_line": 111 }
(* Copyright 2019 Microsoft Research Licensed under the Apache License, Version 2.0 (the "License"); you may not use this file except in compliance with the License. You may obtain a copy of the License at http://www.apache.org/licenses/LICENSE-2.0 Unless required by applicable law or agreed to...
{ "checked_file": "/", "dependencies": [ "prims.fst.checked", "Options.fsti.checked", "Hashtable.fsti.checked", "FStar.UInt.fsti.checked", "FStar.String.fsti.checked", "FStar.ST.fst.checked", "FStar.Printf.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fst...
[ { "abbrev": false, "full_module": "FStar.All", "short_module": null }, { "abbrev": false, "full_module": "FStar.Pervasives", "short_module": null }, { "abbrev": false, "full_module": "Prims", "short_module": null }, { "abbrev": false, "full_module": "FStar", ...
{ "detail_errors": false, "detail_hint_replay": false, "initial_fuel": 2, "initial_ifuel": 1, "max_fuel": 8, "max_ifuel": 2, "no_plugins": false, "no_smt": false, "no_tactics": false, "quake_hi": 1, "quake_keep": false, "quake_lo": 1, "retry": false, "reuse_hint_for": null, "smtencoding_el...
false
f: (_: 'a -> 'b) -> x: Ast.with_meta_t 'a -> 'b
Prims.Tot
[ "total" ]
[]
[ "Ast.with_meta_t", "Ast.__proj__Mkwith_meta_t__item__v" ]
[]
false
false
false
true
false
let with_meta_t_to_yojson (f: ('a -> 'b)) (x: with_meta_t 'a) : 'b =
f x.v
false
Ast.fst
Ast.ident_name
val ident_name : i: Ast.with_meta_t Ast.ident' -> Prims.string
let ident_name i = i.v.name
{ "file_name": "src/3d/Ast.fst", "git_rev": "00217c4a89f5ba56002ba9aa5b4a9d5903bfe9fa", "git_url": "https://github.com/project-everest/everparse.git", "project_name": "everparse" }
{ "end_col": 27, "end_line": 135, "start_col": 0, "start_line": 135 }
(* Copyright 2019 Microsoft Research Licensed under the Apache License, Version 2.0 (the "License"); you may not use this file except in compliance with the License. You may obtain a copy of the License at http://www.apache.org/licenses/LICENSE-2.0 Unless required by applicable law or agreed to...
{ "checked_file": "/", "dependencies": [ "prims.fst.checked", "Options.fsti.checked", "Hashtable.fsti.checked", "FStar.UInt.fsti.checked", "FStar.String.fsti.checked", "FStar.ST.fst.checked", "FStar.Printf.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fst...
[ { "abbrev": false, "full_module": "FStar.All", "short_module": null }, { "abbrev": false, "full_module": "FStar.Pervasives", "short_module": null }, { "abbrev": false, "full_module": "Prims", "short_module": null }, { "abbrev": false, "full_module": "FStar", ...
{ "detail_errors": false, "detail_hint_replay": false, "initial_fuel": 2, "initial_ifuel": 1, "max_fuel": 8, "max_ifuel": 2, "no_plugins": false, "no_smt": false, "no_tactics": false, "quake_hi": 1, "quake_keep": false, "quake_lo": 1, "retry": false, "reuse_hint_for": null, "smtencoding_el...
false
i: Ast.with_meta_t Ast.ident' -> Prims.string
Prims.Tot
[ "total" ]
[]
[ "Ast.with_meta_t", "Ast.ident'", "Ast.__proj__Mkident'__item__name", "Ast.__proj__Mkwith_meta_t__item__v", "Prims.string" ]
[]
false
false
false
true
false
let ident_name i =
i.v.name
false
LowStar.Vector.fst
LowStar.Vector.flush
val flush: #a:Type -> vec:vector a -> ia:a -> i:uint32_t{i <= size_of vec} -> HST.ST (vector a) (requires (fun h0 -> live h0 vec /\ freeable vec /\ HST.is_eternal_region (frameOf vec))) (ensures (fun h0 fvec h1 -> frameOf vec = frameOf fvec /\ hmap_dom_eq h0 h1 /\ live h1 fve...
val flush: #a:Type -> vec:vector a -> ia:a -> i:uint32_t{i <= size_of vec} -> HST.ST (vector a) (requires (fun h0 -> live h0 vec /\ freeable vec /\ HST.is_eternal_region (frameOf vec))) (ensures (fun h0 fvec h1 -> frameOf vec = frameOf fvec /\ hmap_dom_eq h0 h1 /\ live h1 fve...
let flush #a vec ia i = let fsz = Vec?.sz vec - i in let asz = if Vec?.sz vec = i then 1ul else fsz in let vs = Vec?.vs vec in let fvs = B.malloc (B.frameOf vs) ia asz in B.blit vs i fvs 0ul fsz; B.free vs; Vec fsz asz fvs
{ "file_name": "ulib/LowStar.Vector.fst", "git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3", "git_url": "https://github.com/FStarLang/FStar.git", "project_name": "FStar" }
{ "end_col": 17, "end_line": 503, "start_col": 0, "start_line": 496 }
(* Copyright 2008-2018 Microsoft Research Licensed under the Apache License, Version 2.0 (the "License"); you may not use this file except in compliance with the License. You may obtain a copy of the License at http://www.apache.org/licenses/LICENSE-2.0 Unless required by applicable law or agre...
{ "checked_file": "/", "dependencies": [ "prims.fst.checked", "LowStar.Modifies.fst.checked", "LowStar.Buffer.fst.checked", "FStar.UInt32.fsti.checked", "FStar.Set.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Map.fsti.checked", "FStar.Integers.f...
[ { "abbrev": true, "full_module": "FStar.UInt32", "short_module": "U32" }, { "abbrev": true, "full_module": "FStar.Seq", "short_module": "S" }, { "abbrev": true, "full_module": "LowStar.Buffer", "short_module": "B" }, { "abbrev": true, "full_module": "FStar.Hyp...
{ "detail_errors": false, "detail_hint_replay": false, "initial_fuel": 2, "initial_ifuel": 1, "max_fuel": 8, "max_ifuel": 2, "no_plugins": false, "no_smt": false, "no_tactics": false, "quake_hi": 1, "quake_keep": false, "quake_lo": 1, "retry": false, "reuse_hint_for": null, "smtencoding_el...
false
vec: LowStar.Vector.vector a -> ia: a -> i: LowStar.Vector.uint32_t{i <= LowStar.Vector.size_of vec} -> FStar.HyperStack.ST.ST (LowStar.Vector.vector a)
FStar.HyperStack.ST.ST
[]
[]
[ "LowStar.Vector.vector", "LowStar.Vector.uint32_t", "Prims.b2t", "FStar.Integers.op_Less_Equals", "FStar.Integers.Unsigned", "FStar.Integers.W32", "LowStar.Vector.size_of", "LowStar.Vector.Vec", "Prims.unit", "LowStar.Monotonic.Buffer.free", "LowStar.Buffer.trivial_preorder", "LowStar.Monotoni...
[]
false
true
false
false
false
let flush #a vec ia i =
let fsz = Vec?.sz vec - i in let asz = if Vec?.sz vec = i then 1ul else fsz in let vs = Vec?.vs vec in let fvs = B.malloc (B.frameOf vs) ia asz in B.blit vs i fvs 0ul fsz; B.free vs; Vec fsz asz fvs
false
Ast.fst
Ast.ident
val ident : Type0
let ident = with_meta_t ident'
{ "file_name": "src/3d/Ast.fst", "git_rev": "00217c4a89f5ba56002ba9aa5b4a9d5903bfe9fa", "git_url": "https://github.com/project-everest/everparse.git", "project_name": "everparse" }
{ "end_col": 30, "end_line": 127, "start_col": 0, "start_line": 127 }
(* Copyright 2019 Microsoft Research Licensed under the Apache License, Version 2.0 (the "License"); you may not use this file except in compliance with the License. You may obtain a copy of the License at http://www.apache.org/licenses/LICENSE-2.0 Unless required by applicable law or agreed to...
{ "checked_file": "/", "dependencies": [ "prims.fst.checked", "Options.fsti.checked", "Hashtable.fsti.checked", "FStar.UInt.fsti.checked", "FStar.String.fsti.checked", "FStar.ST.fst.checked", "FStar.Printf.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fst...
[ { "abbrev": false, "full_module": "FStar.All", "short_module": null }, { "abbrev": false, "full_module": "FStar.Pervasives", "short_module": null }, { "abbrev": false, "full_module": "Prims", "short_module": null }, { "abbrev": false, "full_module": "FStar", ...
{ "detail_errors": false, "detail_hint_replay": false, "initial_fuel": 2, "initial_ifuel": 1, "max_fuel": 8, "max_ifuel": 2, "no_plugins": false, "no_smt": false, "no_tactics": false, "quake_hi": 1, "quake_keep": false, "quake_lo": 1, "retry": false, "reuse_hint_for": null, "smtencoding_el...
false
Type0
Prims.Tot
[ "total" ]
[]
[ "Ast.with_meta_t", "Ast.ident'" ]
[]
false
false
false
true
true
let ident =
with_meta_t ident'
false
LowStar.Vector.fst
LowStar.Vector.forall_preserved
val forall_preserved: #a:Type -> vec:vector a -> i:uint32_t -> j:uint32_t{i <= j && j <= size_of vec} -> p:(a -> Tot Type0) -> dloc:loc -> h0:HS.mem -> h1:HS.mem -> Lemma (requires (live h0 vec /\ loc_disjoint (loc_vector_within vec i j) dloc /\ forall_ h0 vec i j p /\ ...
val forall_preserved: #a:Type -> vec:vector a -> i:uint32_t -> j:uint32_t{i <= j && j <= size_of vec} -> p:(a -> Tot Type0) -> dloc:loc -> h0:HS.mem -> h1:HS.mem -> Lemma (requires (live h0 vec /\ loc_disjoint (loc_vector_within vec i j) dloc /\ forall_ h0 vec i j p /\ ...
let forall_preserved #a vec i j p dloc h0 h1 = modifies_as_seq_within vec i j dloc h0 h1; assert (S.slice (as_seq h0 vec) (U32.v i) (U32.v j) == S.slice (as_seq h1 vec) (U32.v i) (U32.v j))
{ "file_name": "ulib/LowStar.Vector.fst", "git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3", "git_url": "https://github.com/FStarLang/FStar.git", "project_name": "FStar" }
{ "end_col": 53, "end_line": 690, "start_col": 0, "start_line": 687 }
(* Copyright 2008-2018 Microsoft Research Licensed under the Apache License, Version 2.0 (the "License"); you may not use this file except in compliance with the License. You may obtain a copy of the License at http://www.apache.org/licenses/LICENSE-2.0 Unless required by applicable law or agre...
{ "checked_file": "/", "dependencies": [ "prims.fst.checked", "LowStar.Modifies.fst.checked", "LowStar.Buffer.fst.checked", "FStar.UInt32.fsti.checked", "FStar.Set.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Map.fsti.checked", "FStar.Integers.f...
[ { "abbrev": true, "full_module": "FStar.UInt32", "short_module": "U32" }, { "abbrev": true, "full_module": "FStar.Seq", "short_module": "S" }, { "abbrev": true, "full_module": "LowStar.Buffer", "short_module": "B" }, { "abbrev": true, "full_module": "FStar.Hyp...
{ "detail_errors": false, "detail_hint_replay": false, "initial_fuel": 2, "initial_ifuel": 1, "max_fuel": 8, "max_ifuel": 2, "no_plugins": false, "no_smt": false, "no_tactics": false, "quake_hi": 1, "quake_keep": false, "quake_lo": 1, "retry": false, "reuse_hint_for": null, "smtencoding_el...
false
vec: LowStar.Vector.vector a -> i: LowStar.Vector.uint32_t -> j: LowStar.Vector.uint32_t{i <= j && j <= LowStar.Vector.size_of vec} -> p: (_: a -> Type0) -> dloc: LowStar.Monotonic.Buffer.loc -> h0: FStar.Monotonic.HyperStack.mem -> h1: FStar.Monotonic.HyperStack.mem -> FStar.Pervasives.L...
FStar.Pervasives.Lemma
[ "lemma" ]
[]
[ "LowStar.Vector.vector", "LowStar.Vector.uint32_t", "Prims.b2t", "Prims.op_AmpAmp", "FStar.Integers.op_Less_Equals", "FStar.Integers.Unsigned", "FStar.Integers.W32", "LowStar.Vector.size_of", "LowStar.Monotonic.Buffer.loc", "FStar.Monotonic.HyperStack.mem", "Prims._assert", "Prims.eq2", "FSt...
[]
true
false
true
false
false
let forall_preserved #a vec i j p dloc h0 h1 =
modifies_as_seq_within vec i j dloc h0 h1; assert (S.slice (as_seq h0 vec) (U32.v i) (U32.v j) == S.slice (as_seq h1 vec) (U32.v i) (U32.v j))
false
LowStar.Vector.fst
LowStar.Vector.assign
val assign: #a:Type -> vec:vector a -> i:uint32_t -> v:a -> HST.ST unit (requires (fun h0 -> live h0 vec /\ i < size_of vec)) (ensures (fun h0 _ h1 -> hmap_dom_eq h0 h1 /\ modifies (loc_vector_within #a vec i (i + 1ul)) h0 h1 /\ get h1 vec i == v /\ S.equal (as_seq h1 vec) (S.upd (...
val assign: #a:Type -> vec:vector a -> i:uint32_t -> v:a -> HST.ST unit (requires (fun h0 -> live h0 vec /\ i < size_of vec)) (ensures (fun h0 _ h1 -> hmap_dom_eq h0 h1 /\ modifies (loc_vector_within #a vec i (i + 1ul)) h0 h1 /\ get h1 vec i == v /\ S.equal (as_seq h1 vec) (S.upd (...
let assign #a vec i v = let hh0 = HST.get () in // NOTE: `B.upd (Vec?.vs vec) i v` makes more sense, // but the `modifies` postcondition is coarse-grained. B.upd (B.sub (Vec?.vs vec) i 1ul) 0ul v; let hh1 = HST.get () in loc_vector_within_disjoint vec 0ul i i (i + 1ul); modifies_as_seq_within ve...
{ "file_name": "ulib/LowStar.Vector.fst", "git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3", "git_url": "https://github.com/FStarLang/FStar.git", "project_name": "FStar" }
{ "end_col": 89, "end_line": 435, "start_col": 0, "start_line": 420 }
(* Copyright 2008-2018 Microsoft Research Licensed under the Apache License, Version 2.0 (the "License"); you may not use this file except in compliance with the License. You may obtain a copy of the License at http://www.apache.org/licenses/LICENSE-2.0 Unless required by applicable law or agre...
{ "checked_file": "/", "dependencies": [ "prims.fst.checked", "LowStar.Modifies.fst.checked", "LowStar.Buffer.fst.checked", "FStar.UInt32.fsti.checked", "FStar.Set.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Map.fsti.checked", "FStar.Integers.f...
[ { "abbrev": true, "full_module": "FStar.UInt32", "short_module": "U32" }, { "abbrev": true, "full_module": "FStar.Seq", "short_module": "S" }, { "abbrev": true, "full_module": "LowStar.Buffer", "short_module": "B" }, { "abbrev": true, "full_module": "FStar.Hyp...
{ "detail_errors": false, "detail_hint_replay": false, "initial_fuel": 2, "initial_ifuel": 1, "max_fuel": 8, "max_ifuel": 2, "no_plugins": false, "no_smt": false, "no_tactics": false, "quake_hi": 1, "quake_keep": false, "quake_lo": 1, "retry": false, "reuse_hint_for": null, "smtencoding_el...
false
vec: LowStar.Vector.vector a -> i: LowStar.Vector.uint32_t -> v: a -> FStar.HyperStack.ST.ST Prims.unit
FStar.HyperStack.ST.ST
[]
[]
[ "LowStar.Vector.vector", "LowStar.Vector.uint32_t", "LowStar.Vector.slice_append", "FStar.Seq.Base.upd", "LowStar.Vector.as_seq", "FStar.UInt32.v", "FStar.Integers.op_Plus", "FStar.Integers.Signed", "FStar.Integers.Winfinite", "LowStar.Vector.size_of", "Prims.unit", "LowStar.Vector.modifies_as...
[]
false
true
false
false
false
let assign #a vec i v =
let hh0 = HST.get () in B.upd (B.sub (Vec?.vs vec) i 1ul) 0ul v; let hh1 = HST.get () in loc_vector_within_disjoint vec 0ul i i (i + 1ul); modifies_as_seq_within vec 0ul i (loc_vector_within #a vec i (i + 1ul)) hh0 hh1; loc_vector_within_disjoint vec i (i + 1ul) (i + 1ul) (size_of vec); modifies_as_seq_within vec (i + ...
false
Ast.fst
Ast.field_typ
val field_typ : Type0
let field_typ = t:typ { Type_app? t.v }
{ "file_name": "src/3d/Ast.fst", "git_rev": "00217c4a89f5ba56002ba9aa5b4a9d5903bfe9fa", "git_url": "https://github.com/project-everest/everparse.git", "project_name": "everparse" }
{ "end_col": 39, "end_line": 369, "start_col": 0, "start_line": 369 }
(* Copyright 2019 Microsoft Research Licensed under the Apache License, Version 2.0 (the "License"); you may not use this file except in compliance with the License. You may obtain a copy of the License at http://www.apache.org/licenses/LICENSE-2.0 Unless required by applicable law or agreed to...
{ "checked_file": "/", "dependencies": [ "prims.fst.checked", "Options.fsti.checked", "Hashtable.fsti.checked", "FStar.UInt.fsti.checked", "FStar.String.fsti.checked", "FStar.ST.fst.checked", "FStar.Printf.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fst...
[ { "abbrev": false, "full_module": "FStar.All", "short_module": null }, { "abbrev": false, "full_module": "FStar.Pervasives", "short_module": null }, { "abbrev": false, "full_module": "Prims", "short_module": null }, { "abbrev": false, "full_module": "FStar", ...
{ "detail_errors": false, "detail_hint_replay": false, "initial_fuel": 2, "initial_ifuel": 1, "max_fuel": 8, "max_ifuel": 2, "no_plugins": false, "no_smt": false, "no_tactics": false, "quake_hi": 1, "quake_keep": false, "quake_lo": 1, "retry": false, "reuse_hint_for": null, "smtencoding_el...
false
Type0
Prims.Tot
[ "total" ]
[]
[ "Ast.typ", "Prims.b2t", "Ast.uu___is_Type_app", "Ast.__proj__Mkwith_meta_t__item__v", "Ast.typ'" ]
[]
false
false
false
true
true
let field_typ =
t: typ{Type_app? t.v}
false
LowStar.Vector.fst
LowStar.Vector.forall_as_seq
val forall_as_seq: #a:Type -> s0:S.seq a -> s1:S.seq a{S.length s0 = S.length s1} -> i:nat -> j:nat{i <= j && j <= S.length s0} -> k:nat{i <= k && k < j} -> p:(a -> Tot Type0) -> Lemma (requires (p (S.index s0 k) /\ S.slice s0 i j == S.slice s1 i j)) (ensures (p (S.index s1 k))) [SMTPat (p (S....
val forall_as_seq: #a:Type -> s0:S.seq a -> s1:S.seq a{S.length s0 = S.length s1} -> i:nat -> j:nat{i <= j && j <= S.length s0} -> k:nat{i <= k && k < j} -> p:(a -> Tot Type0) -> Lemma (requires (p (S.index s0 k) /\ S.slice s0 i j == S.slice s1 i j)) (ensures (p (S.index s1 k))) [SMTPat (p (S....
let forall_as_seq #a s0 s1 i j k p = assert (S.index (S.slice s0 i j) (k - i) == S.index (S.slice s1 i j) (k - i))
{ "file_name": "ulib/LowStar.Vector.fst", "git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3", "git_url": "https://github.com/FStarLang/FStar.git", "project_name": "FStar" }
{ "end_col": 42, "end_line": 675, "start_col": 0, "start_line": 673 }
(* Copyright 2008-2018 Microsoft Research Licensed under the Apache License, Version 2.0 (the "License"); you may not use this file except in compliance with the License. You may obtain a copy of the License at http://www.apache.org/licenses/LICENSE-2.0 Unless required by applicable law or agre...
{ "checked_file": "/", "dependencies": [ "prims.fst.checked", "LowStar.Modifies.fst.checked", "LowStar.Buffer.fst.checked", "FStar.UInt32.fsti.checked", "FStar.Set.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Map.fsti.checked", "FStar.Integers.f...
[ { "abbrev": true, "full_module": "FStar.UInt32", "short_module": "U32" }, { "abbrev": true, "full_module": "FStar.Seq", "short_module": "S" }, { "abbrev": true, "full_module": "LowStar.Buffer", "short_module": "B" }, { "abbrev": true, "full_module": "FStar.Hyp...
{ "detail_errors": false, "detail_hint_replay": false, "initial_fuel": 2, "initial_ifuel": 1, "max_fuel": 8, "max_ifuel": 2, "no_plugins": false, "no_smt": false, "no_tactics": false, "quake_hi": 1, "quake_keep": false, "quake_lo": 1, "retry": false, "reuse_hint_for": null, "smtencoding_el...
false
s0: FStar.Seq.Base.seq a -> s1: FStar.Seq.Base.seq a {FStar.Seq.Base.length s0 = FStar.Seq.Base.length s1} -> i: FStar.Integers.nat -> j: FStar.Integers.nat{i <= j && j <= FStar.Seq.Base.length s0} -> k: FStar.Integers.nat{i <= k && k < j} -> p: (_: a -> Type0) -> FStar.Pervasives.Lemma ...
FStar.Pervasives.Lemma
[ "lemma" ]
[]
[ "FStar.Seq.Base.seq", "Prims.b2t", "Prims.op_Equality", "Prims.nat", "FStar.Seq.Base.length", "FStar.Integers.nat", "Prims.op_AmpAmp", "FStar.Integers.op_Less_Equals", "FStar.Integers.Signed", "FStar.Integers.Winfinite", "FStar.Integers.op_Less", "Prims._assert", "Prims.eq2", "FStar.Seq.Ba...
[]
true
false
true
false
false
let forall_as_seq #a s0 s1 i j k p =
assert (S.index (S.slice s0 i j) (k - i) == S.index (S.slice s1 i j) (k - i))
false
Ast.fst
Ast.enum_case
val enum_case : Type0
let enum_case = ident & option (either int ident)
{ "file_name": "src/3d/Ast.fst", "git_rev": "00217c4a89f5ba56002ba9aa5b4a9d5903bfe9fa", "git_url": "https://github.com/project-everest/everparse.git", "project_name": "everparse" }
{ "end_col": 49, "end_line": 530, "start_col": 0, "start_line": 530 }
(* Copyright 2019 Microsoft Research Licensed under the Apache License, Version 2.0 (the "License"); you may not use this file except in compliance with the License. You may obtain a copy of the License at http://www.apache.org/licenses/LICENSE-2.0 Unless required by applicable law or agreed to...
{ "checked_file": "/", "dependencies": [ "prims.fst.checked", "Options.fsti.checked", "Hashtable.fsti.checked", "FStar.UInt.fsti.checked", "FStar.String.fsti.checked", "FStar.ST.fst.checked", "FStar.Printf.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fst...
[ { "abbrev": false, "full_module": "FStar.List.Tot", "short_module": null }, { "abbrev": false, "full_module": "FStar.All", "short_module": null }, { "abbrev": false, "full_module": "FStar.Pervasives", "short_module": null }, { "abbrev": false, "full_module": "...
{ "detail_errors": false, "detail_hint_replay": false, "initial_fuel": 2, "initial_ifuel": 1, "max_fuel": 8, "max_ifuel": 2, "no_plugins": false, "no_smt": false, "no_tactics": false, "quake_hi": 1, "quake_keep": false, "quake_lo": 1, "retry": false, "reuse_hint_for": null, "smtencoding_el...
false
Type0
Prims.Tot
[ "total" ]
[]
[ "FStar.Pervasives.Native.tuple2", "Ast.ident", "FStar.Pervasives.Native.option", "Ast.either", "Prims.int" ]
[]
false
false
false
true
true
let enum_case =
ident & option (either int ident)
false
Ast.fst
Ast.field_bitwidth_t
val field_bitwidth_t : Type0
let field_bitwidth_t = either (with_meta_t int) bitfield_attr
{ "file_name": "src/3d/Ast.fst", "git_rev": "00217c4a89f5ba56002ba9aa5b4a9d5903bfe9fa", "git_url": "https://github.com/project-everest/everparse.git", "project_name": "everparse" }
{ "end_col": 61, "end_line": 454, "start_col": 0, "start_line": 454 }
(* Copyright 2019 Microsoft Research Licensed under the Apache License, Version 2.0 (the "License"); you may not use this file except in compliance with the License. You may obtain a copy of the License at http://www.apache.org/licenses/LICENSE-2.0 Unless required by applicable law or agreed to...
{ "checked_file": "/", "dependencies": [ "prims.fst.checked", "Options.fsti.checked", "Hashtable.fsti.checked", "FStar.UInt.fsti.checked", "FStar.String.fsti.checked", "FStar.ST.fst.checked", "FStar.Printf.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fst...
[ { "abbrev": false, "full_module": "FStar.List.Tot", "short_module": null }, { "abbrev": false, "full_module": "FStar.All", "short_module": null }, { "abbrev": false, "full_module": "FStar.Pervasives", "short_module": null }, { "abbrev": false, "full_module": "...
{ "detail_errors": false, "detail_hint_replay": false, "initial_fuel": 2, "initial_ifuel": 1, "max_fuel": 8, "max_ifuel": 2, "no_plugins": false, "no_smt": false, "no_tactics": false, "quake_hi": 1, "quake_keep": false, "quake_lo": 1, "retry": false, "reuse_hint_for": null, "smtencoding_el...
false
Type0
Prims.Tot
[ "total" ]
[]
[ "Ast.either", "Ast.with_meta_t", "Prims.int", "Ast.bitfield_attr" ]
[]
false
false
false
true
true
let field_bitwidth_t =
either (with_meta_t int) bitfield_attr
false
Ast.fst
Ast.ident_to_string
val ident_to_string : i: Ast.with_meta_t Ast.ident' -> Prims.string
let ident_to_string i = Printf.sprintf "%s%s" (match i.v.modul_name with | None -> "" | Some m -> m ^ ".") i.v.name
{ "file_name": "src/3d/Ast.fst", "git_rev": "00217c4a89f5ba56002ba9aa5b4a9d5903bfe9fa", "git_url": "https://github.com/project-everest/everparse.git", "project_name": "everparse" }
{ "end_col": 10, "end_line": 133, "start_col": 0, "start_line": 129 }
(* Copyright 2019 Microsoft Research Licensed under the Apache License, Version 2.0 (the "License"); you may not use this file except in compliance with the License. You may obtain a copy of the License at http://www.apache.org/licenses/LICENSE-2.0 Unless required by applicable law or agreed to...
{ "checked_file": "/", "dependencies": [ "prims.fst.checked", "Options.fsti.checked", "Hashtable.fsti.checked", "FStar.UInt.fsti.checked", "FStar.String.fsti.checked", "FStar.ST.fst.checked", "FStar.Printf.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fst...
[ { "abbrev": false, "full_module": "FStar.All", "short_module": null }, { "abbrev": false, "full_module": "FStar.Pervasives", "short_module": null }, { "abbrev": false, "full_module": "Prims", "short_module": null }, { "abbrev": false, "full_module": "FStar", ...
{ "detail_errors": false, "detail_hint_replay": false, "initial_fuel": 2, "initial_ifuel": 1, "max_fuel": 8, "max_ifuel": 2, "no_plugins": false, "no_smt": false, "no_tactics": false, "quake_hi": 1, "quake_keep": false, "quake_lo": 1, "retry": false, "reuse_hint_for": null, "smtencoding_el...
false
i: Ast.with_meta_t Ast.ident' -> Prims.string
Prims.Tot
[ "total" ]
[]
[ "Ast.with_meta_t", "Ast.ident'", "FStar.Printf.sprintf", "Ast.__proj__Mkident'__item__modul_name", "Ast.__proj__Mkwith_meta_t__item__v", "Prims.string", "Prims.op_Hat", "Ast.__proj__Mkident'__item__name" ]
[]
false
false
false
true
false
let ident_to_string i =
Printf.sprintf "%s%s" (match i.v.modul_name with | None -> "" | Some m -> m ^ ".") i.v.name
false
Ast.fst
Ast.prog
val prog : Type0
let prog = list decl & option type_refinement
{ "file_name": "src/3d/Ast.fst", "git_rev": "00217c4a89f5ba56002ba9aa5b4a9d5903bfe9fa", "git_url": "https://github.com/project-everest/everparse.git", "project_name": "everparse" }
{ "end_col": 45, "end_line": 601, "start_col": 0, "start_line": 601 }
(* Copyright 2019 Microsoft Research Licensed under the Apache License, Version 2.0 (the "License"); you may not use this file except in compliance with the License. You may obtain a copy of the License at http://www.apache.org/licenses/LICENSE-2.0 Unless required by applicable law or agreed to...
{ "checked_file": "/", "dependencies": [ "prims.fst.checked", "Options.fsti.checked", "Hashtable.fsti.checked", "FStar.UInt.fsti.checked", "FStar.String.fsti.checked", "FStar.ST.fst.checked", "FStar.Printf.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fst...
[ { "abbrev": false, "full_module": "FStar.List.Tot", "short_module": null }, { "abbrev": false, "full_module": "FStar.All", "short_module": null }, { "abbrev": false, "full_module": "FStar.Pervasives", "short_module": null }, { "abbrev": false, "full_module": "...
{ "detail_errors": false, "detail_hint_replay": false, "initial_fuel": 2, "initial_ifuel": 1, "max_fuel": 8, "max_ifuel": 2, "no_plugins": false, "no_smt": false, "no_tactics": false, "quake_hi": 1, "quake_keep": false, "quake_lo": 1, "retry": false, "reuse_hint_for": null, "smtencoding_el...
false
Type0
Prims.Tot
[ "total" ]
[]
[ "FStar.Pervasives.Native.tuple2", "Prims.list", "Ast.decl", "FStar.Pervasives.Native.option", "Ast.type_refinement" ]
[]
false
false
false
true
true
let prog =
list decl & option type_refinement
false
Ast.fst
Ast.decl_with_v
val decl_with_v (d: decl) (v: decl') : decl
val decl_with_v (d: decl) (v: decl') : decl
let decl_with_v (d:decl) (v:decl') : decl = { d with d_decl = { d.d_decl with v = v } }
{ "file_name": "src/3d/Ast.fst", "git_rev": "00217c4a89f5ba56002ba9aa5b4a9d5903bfe9fa", "git_url": "https://github.com/project-everest/everparse.git", "project_name": "everparse" }
{ "end_col": 45, "end_line": 591, "start_col": 0, "start_line": 590 }
(* Copyright 2019 Microsoft Research Licensed under the Apache License, Version 2.0 (the "License"); you may not use this file except in compliance with the License. You may obtain a copy of the License at http://www.apache.org/licenses/LICENSE-2.0 Unless required by applicable law or agreed to...
{ "checked_file": "/", "dependencies": [ "prims.fst.checked", "Options.fsti.checked", "Hashtable.fsti.checked", "FStar.UInt.fsti.checked", "FStar.String.fsti.checked", "FStar.ST.fst.checked", "FStar.Printf.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fst...
[ { "abbrev": false, "full_module": "FStar.List.Tot", "short_module": null }, { "abbrev": false, "full_module": "FStar.All", "short_module": null }, { "abbrev": false, "full_module": "FStar.Pervasives", "short_module": null }, { "abbrev": false, "full_module": "...
{ "detail_errors": false, "detail_hint_replay": false, "initial_fuel": 2, "initial_ifuel": 1, "max_fuel": 8, "max_ifuel": 2, "no_plugins": false, "no_smt": false, "no_tactics": false, "quake_hi": 1, "quake_keep": false, "quake_lo": 1, "retry": false, "reuse_hint_for": null, "smtencoding_el...
false
d: Ast.decl -> v: Ast.decl' -> Ast.decl
Prims.Tot
[ "total" ]
[]
[ "Ast.decl", "Ast.decl'", "Ast.Mkdecl", "Ast.Mkwith_meta_t", "Ast.__proj__Mkwith_meta_t__item__range", "Ast.__proj__Mkwith_meta_t__item__comments", "Ast.with_meta_t", "Ast.__proj__Mkdecl__item__d_decl", "Ast.__proj__Mkdecl__item__d_exported" ]
[]
false
false
false
true
false
let decl_with_v (d: decl) (v: decl') : decl =
{ d with d_decl = { d.d_decl with v = v } }
false
LowStar.Vector.fst
LowStar.Vector.insert
val insert: #a:Type -> vec:vector a -> v:a -> HST.ST (vector a) (requires (fun h0 -> live h0 vec /\ freeable vec /\ not (is_full vec) /\ HST.is_eternal_region (frameOf vec))) (ensures (fun h0 nvec h1 -> frameOf vec = frameOf nvec /\ hmap_dom_eq h0 h1 /\ live h1 nvec /\ freeable...
val insert: #a:Type -> vec:vector a -> v:a -> HST.ST (vector a) (requires (fun h0 -> live h0 vec /\ freeable vec /\ not (is_full vec) /\ HST.is_eternal_region (frameOf vec))) (ensures (fun h0 nvec h1 -> frameOf vec = frameOf nvec /\ hmap_dom_eq h0 h1 /\ live h1 nvec /\ freeable...
let insert #a vec v = let sz = Vec?.sz vec in let cap = Vec?.cap vec in let vs = Vec?.vs vec in if sz = cap then (let ncap = new_capacity cap in let nvs = B.malloc (B.frameOf vs) v ncap in B.blit vs 0ul nvs 0ul sz; B.upd nvs sz v; B.free vs; Vec (sz + 1ul) ncap nvs) else ...
{ "file_name": "ulib/LowStar.Vector.fst", "git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3", "git_url": "https://github.com/FStarLang/FStar.git", "project_name": "FStar" }
{ "end_col": 26, "end_line": 475, "start_col": 0, "start_line": 462 }
(* Copyright 2008-2018 Microsoft Research Licensed under the Apache License, Version 2.0 (the "License"); you may not use this file except in compliance with the License. You may obtain a copy of the License at http://www.apache.org/licenses/LICENSE-2.0 Unless required by applicable law or agre...
{ "checked_file": "/", "dependencies": [ "prims.fst.checked", "LowStar.Modifies.fst.checked", "LowStar.Buffer.fst.checked", "FStar.UInt32.fsti.checked", "FStar.Set.fsti.checked", "FStar.Seq.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.Map.fsti.checked", "FStar.Integers.f...
[ { "abbrev": true, "full_module": "FStar.UInt32", "short_module": "U32" }, { "abbrev": true, "full_module": "FStar.Seq", "short_module": "S" }, { "abbrev": true, "full_module": "LowStar.Buffer", "short_module": "B" }, { "abbrev": true, "full_module": "FStar.Hyp...
{ "detail_errors": false, "detail_hint_replay": false, "initial_fuel": 2, "initial_ifuel": 1, "max_fuel": 8, "max_ifuel": 2, "no_plugins": false, "no_smt": false, "no_tactics": false, "quake_hi": 1, "quake_keep": false, "quake_lo": 1, "retry": false, "reuse_hint_for": null, "smtencoding_el...
false
vec: LowStar.Vector.vector a -> v: a -> FStar.HyperStack.ST.ST (LowStar.Vector.vector a)
FStar.HyperStack.ST.ST
[]
[]
[ "LowStar.Vector.vector", "Prims.op_Equality", "LowStar.Vector.uint32_t", "LowStar.Vector.Vec", "FStar.Integers.op_Plus", "FStar.Integers.Unsigned", "FStar.Integers.W32", "FStar.UInt32.__uint_to_t", "Prims.unit", "LowStar.Monotonic.Buffer.free", "LowStar.Buffer.trivial_preorder", "LowStar.Monot...
[]
false
true
false
false
false
let insert #a vec v =
let sz = Vec?.sz vec in let cap = Vec?.cap vec in let vs = Vec?.vs vec in if sz = cap then (let ncap = new_capacity cap in let nvs = B.malloc (B.frameOf vs) v ncap in B.blit vs 0ul nvs 0ul sz; B.upd nvs sz v; B.free vs; Vec (sz + 1ul) ncap nvs) else (B.upd vs sz v; Vec (sz + 1ul) cap vs)
false
Ast.fst
Ast.has_entrypoint
val has_entrypoint (l: list attribute) : Tot bool
val has_entrypoint (l: list attribute) : Tot bool
let has_entrypoint (l:list attribute) : Tot bool = Some? (List.Tot.tryFind (function Entrypoint -> true | _ -> false) l)
{ "file_name": "src/3d/Ast.fst", "git_rev": "00217c4a89f5ba56002ba9aa5b4a9d5903bfe9fa", "git_url": "https://github.com/project-everest/everparse.git", "project_name": "everparse" }
{ "end_col": 71, "end_line": 610, "start_col": 0, "start_line": 609 }
(* Copyright 2019 Microsoft Research Licensed under the Apache License, Version 2.0 (the "License"); you may not use this file except in compliance with the License. You may obtain a copy of the License at http://www.apache.org/licenses/LICENSE-2.0 Unless required by applicable law or agreed to...
{ "checked_file": "/", "dependencies": [ "prims.fst.checked", "Options.fsti.checked", "Hashtable.fsti.checked", "FStar.UInt.fsti.checked", "FStar.String.fsti.checked", "FStar.ST.fst.checked", "FStar.Printf.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fst...
[ { "abbrev": false, "full_module": "FStar.List.Tot", "short_module": null }, { "abbrev": false, "full_module": "FStar.All", "short_module": null }, { "abbrev": false, "full_module": "FStar.Pervasives", "short_module": null }, { "abbrev": false, "full_module": "...
{ "detail_errors": false, "detail_hint_replay": false, "initial_fuel": 2, "initial_ifuel": 1, "max_fuel": 8, "max_ifuel": 2, "no_plugins": false, "no_smt": false, "no_tactics": false, "quake_hi": 1, "quake_keep": false, "quake_lo": 1, "retry": false, "reuse_hint_for": null, "smtencoding_el...
false
l: Prims.list Ast.attribute -> Prims.bool
Prims.Tot
[ "total" ]
[]
[ "Prims.list", "Ast.attribute", "FStar.Pervasives.Native.uu___is_Some", "FStar.List.Tot.Base.tryFind", "Prims.bool" ]
[]
false
false
false
true
false
let has_entrypoint (l: list attribute) : Tot bool =
Some? (List.Tot.tryFind (function | Entrypoint -> true | _ -> false) l)
false
Ast.fst
Ast.is_entrypoint_or_export
val is_entrypoint_or_export : d: Ast.decl -> Prims.bool
let is_entrypoint_or_export d = match d.d_decl.v with | Record names _ _ _ | CaseType names _ _ -> if has_entrypoint (names.typedef_attributes) then true else d.d_exported | _ -> d.d_exported
{ "file_name": "src/3d/Ast.fst", "git_rev": "00217c4a89f5ba56002ba9aa5b4a9d5903bfe9fa", "git_url": "https://github.com/project-everest/everparse.git", "project_name": "everparse" }
{ "end_col": 21, "end_line": 618, "start_col": 0, "start_line": 612 }
(* Copyright 2019 Microsoft Research Licensed under the Apache License, Version 2.0 (the "License"); you may not use this file except in compliance with the License. You may obtain a copy of the License at http://www.apache.org/licenses/LICENSE-2.0 Unless required by applicable law or agreed to...
{ "checked_file": "/", "dependencies": [ "prims.fst.checked", "Options.fsti.checked", "Hashtable.fsti.checked", "FStar.UInt.fsti.checked", "FStar.String.fsti.checked", "FStar.ST.fst.checked", "FStar.Printf.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fst...
[ { "abbrev": false, "full_module": "FStar.List.Tot", "short_module": null }, { "abbrev": false, "full_module": "FStar.All", "short_module": null }, { "abbrev": false, "full_module": "FStar.Pervasives", "short_module": null }, { "abbrev": false, "full_module": "...
{ "detail_errors": false, "detail_hint_replay": false, "initial_fuel": 2, "initial_ifuel": 1, "max_fuel": 8, "max_ifuel": 2, "no_plugins": false, "no_smt": false, "no_tactics": false, "quake_hi": 1, "quake_keep": false, "quake_lo": 1, "retry": false, "reuse_hint_for": null, "smtencoding_el...
false
d: Ast.decl -> Prims.bool
Prims.Tot
[ "total" ]
[]
[ "Ast.decl", "Ast.__proj__Mkwith_meta_t__item__v", "Ast.decl'", "Ast.__proj__Mkdecl__item__d_decl", "Ast.typedef_names", "Prims.list", "Ast.param", "FStar.Pervasives.Native.option", "Ast.expr", "Ast.record", "Ast.has_entrypoint", "Ast.__proj__Mktypedef_names__item__typedef_attributes", "Prims...
[]
false
false
false
true
false
let is_entrypoint_or_export d =
match d.d_decl.v with | Record names _ _ _ | CaseType names _ _ -> if has_entrypoint (names.typedef_attributes) then true else d.d_exported | _ -> d.d_exported
false
Ast.fst
Ast.is_entrypoint
val is_entrypoint : d: Ast.decl -> Prims.bool
let is_entrypoint d = match d.d_decl.v with | Record names _ _ _ | CaseType names _ _ -> has_entrypoint (names.typedef_attributes) | _ -> false
{ "file_name": "src/3d/Ast.fst", "git_rev": "00217c4a89f5ba56002ba9aa5b4a9d5903bfe9fa", "git_url": "https://github.com/project-everest/everparse.git", "project_name": "everparse" }
{ "end_col": 14, "end_line": 624, "start_col": 0, "start_line": 620 }
(* Copyright 2019 Microsoft Research Licensed under the Apache License, Version 2.0 (the "License"); you may not use this file except in compliance with the License. You may obtain a copy of the License at http://www.apache.org/licenses/LICENSE-2.0 Unless required by applicable law or agreed to...
{ "checked_file": "/", "dependencies": [ "prims.fst.checked", "Options.fsti.checked", "Hashtable.fsti.checked", "FStar.UInt.fsti.checked", "FStar.String.fsti.checked", "FStar.ST.fst.checked", "FStar.Printf.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fst...
[ { "abbrev": false, "full_module": "FStar.List.Tot", "short_module": null }, { "abbrev": false, "full_module": "FStar.All", "short_module": null }, { "abbrev": false, "full_module": "FStar.Pervasives", "short_module": null }, { "abbrev": false, "full_module": "...
{ "detail_errors": false, "detail_hint_replay": false, "initial_fuel": 2, "initial_ifuel": 1, "max_fuel": 8, "max_ifuel": 2, "no_plugins": false, "no_smt": false, "no_tactics": false, "quake_hi": 1, "quake_keep": false, "quake_lo": 1, "retry": false, "reuse_hint_for": null, "smtencoding_el...
false
d: Ast.decl -> Prims.bool
Prims.Tot
[ "total" ]
[]
[ "Ast.decl", "Ast.__proj__Mkwith_meta_t__item__v", "Ast.decl'", "Ast.__proj__Mkdecl__item__d_decl", "Ast.typedef_names", "Prims.list", "Ast.param", "FStar.Pervasives.Native.option", "Ast.expr", "Ast.record", "Ast.has_entrypoint", "Ast.__proj__Mktypedef_names__item__typedef_attributes", "Ast.s...
[]
false
false
false
true
false
let is_entrypoint d =
match d.d_decl.v with | Record names _ _ _ | CaseType names _ _ -> has_entrypoint (names.typedef_attributes) | _ -> false
false
FStar.Seq.Properties.fst
FStar.Seq.Properties.elim_of_list''
val elim_of_list'' (#a: Type) (i: nat) (s: seq a) (l: list a) : Lemma (requires (List.Tot.length l + i = length s /\ i <= length s /\ slice s i (length s) == seq_of_list l) ) (ensures (explode_and i s l)) (decreases (List.Tot.length l))
val elim_of_list'' (#a: Type) (i: nat) (s: seq a) (l: list a) : Lemma (requires (List.Tot.length l + i = length s /\ i <= length s /\ slice s i (length s) == seq_of_list l) ) (ensures (explode_and i s l)) (decreases (List.Tot.length l))
let rec elim_of_list'': #a:Type -> i:nat -> s:seq a -> l:list a -> Lemma (requires ( List.Tot.length l + i = length s /\ i <= length s /\ slice s i (length s) == seq_of_list l)) (ensures ( explode_and i s l)) (decreases ( List.Tot.length l)) = fun #_ i s l -> match l ...
{ "file_name": "ulib/FStar.Seq.Properties.fst", "git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3", "git_url": "https://github.com/FStarLang/FStar.git", "project_name": "FStar" }
{ "end_col": 33, "end_line": 588, "start_col": 0, "start_line": 570 }
(* Copyright 2008-2014 Nikhil Swamy and Microsoft Research Licensed under the Apache License, Version 2.0 (the "License"); you may not use this file except in compliance with the License. You may obtain a copy of the License at http://www.apache.org/licenses/LICENSE-2.0 Unless required by appli...
{ "checked_file": "/", "dependencies": [ "prims.fst.checked", "FStar.Squash.fsti.checked", "FStar.Seq.Base.fsti.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fsti.checked", "FStar.List.Tot.Properties.fst.checked", "FStar.List.Tot.Base.fst.checked", "FStar.List.To...
[ { "abbrev": true, "full_module": "FStar.List.Tot", "short_module": "L" }, { "abbrev": true, "full_module": "FStar.List.Tot", "short_module": "L" }, { "abbrev": true, "full_module": "FStar.Seq.Base", "short_module": "Seq" }, { "abbrev": false, "full_module": "F...
{ "detail_errors": false, "detail_hint_replay": false, "initial_fuel": 2, "initial_ifuel": 1, "max_fuel": 8, "max_ifuel": 2, "no_plugins": false, "no_smt": false, "no_tactics": false, "quake_hi": 1, "quake_keep": false, "quake_lo": 1, "retry": false, "reuse_hint_for": null, "smtencoding_el...
false
i: Prims.nat -> s: FStar.Seq.Base.seq a -> l: Prims.list a -> FStar.Pervasives.Lemma (requires FStar.List.Tot.Base.length l + i = FStar.Seq.Base.length s /\ i <= FStar.Seq.Base.length s /\ FStar.Seq.Base.slice s i (FStar.Seq.Base.length s) == FStar.Seq.Base.seq_of_list l) (ensures FStar.Se...
FStar.Pervasives.Lemma
[ "lemma", "" ]
[]
[ "Prims.nat", "FStar.Seq.Base.seq", "Prims.list", "FStar.Seq.Properties.elim_of_list''", "Prims.op_Addition", "Prims.unit", "FStar.Seq.Properties.lemma_seq_of_list_induction" ]
[ "recursion" ]
false
false
true
false
false
let rec elim_of_list'': #a: Type -> i: nat -> s: seq a -> l: list a -> Lemma (requires (List.Tot.length l + i = length s /\ i <= length s /\ slice s i (length s) == seq_of_list l) ) (ensures (explode_and i s l)) (decreases (List.Tot.length l)) =
fun #_ i s l -> match l with | [] -> () | hd :: tl -> lemma_seq_of_list_induction l; elim_of_list'' (i + 1) s tl
false
Ast.fst
Ast.out_expr_is_out_type_expr
val out_expr_is_out_type_expr (lhs: out_expr) : Tot bool
val out_expr_is_out_type_expr (lhs: out_expr) : Tot bool
let out_expr_is_out_type_expr (lhs: out_expr) : Tot bool = match lhs.out_expr_node.v with | OE_star ({out_expr_node = {v=OE_id i}}) -> false | _ -> true
{ "file_name": "src/3d/Ast.fst", "git_rev": "00217c4a89f5ba56002ba9aa5b4a9d5903bfe9fa", "git_url": "https://github.com/project-everest/everparse.git", "project_name": "everparse" }
{ "end_col": 13, "end_line": 634, "start_col": 0, "start_line": 631 }
(* Copyright 2019 Microsoft Research Licensed under the Apache License, Version 2.0 (the "License"); you may not use this file except in compliance with the License. You may obtain a copy of the License at http://www.apache.org/licenses/LICENSE-2.0 Unless required by applicable law or agreed to...
{ "checked_file": "/", "dependencies": [ "prims.fst.checked", "Options.fsti.checked", "Hashtable.fsti.checked", "FStar.UInt.fsti.checked", "FStar.String.fsti.checked", "FStar.ST.fst.checked", "FStar.Printf.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fst...
[ { "abbrev": false, "full_module": "FStar.List.Tot", "short_module": null }, { "abbrev": false, "full_module": "FStar.All", "short_module": null }, { "abbrev": false, "full_module": "FStar.Pervasives", "short_module": null }, { "abbrev": false, "full_module": "...
{ "detail_errors": false, "detail_hint_replay": false, "initial_fuel": 2, "initial_ifuel": 1, "max_fuel": 8, "max_ifuel": 2, "no_plugins": false, "no_smt": false, "no_tactics": false, "quake_hi": 1, "quake_keep": false, "quake_lo": 1, "retry": false, "reuse_hint_for": null, "smtencoding_el...
false
lhs: Ast.out_expr -> Prims.bool
Prims.Tot
[ "total" ]
[]
[ "Ast.out_expr", "Ast.__proj__Mkwith_meta_t__item__v", "Ast.out_expr'", "Ast.__proj__Mkout_expr__item__out_expr_node", "Ast.ident", "Ast.range", "Ast.comments", "FStar.Pervasives.Native.option", "Ast.out_expr_meta_t", "Prims.bool" ]
[]
false
false
false
true
false
let out_expr_is_out_type_expr (lhs: out_expr) : Tot bool =
match lhs.out_expr_node.v with | OE_star { out_expr_node = { v = OE_id i } } -> false | _ -> true
false
Hacl.Impl.Ed25519.RecoverX.fst
Hacl.Impl.Ed25519.RecoverX.elemB
val elemB : Type0
let elemB = lbuffer uint64 5ul
{ "file_name": "code/ed25519/Hacl.Impl.Ed25519.RecoverX.fst", "git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872", "git_url": "https://github.com/project-everest/hacl-star.git", "project_name": "hacl-star" }
{ "end_col": 30, "end_line": 21, "start_col": 0, "start_line": 21 }
module Hacl.Impl.Ed25519.RecoverX module ST = FStar.HyperStack.ST open FStar.HyperStack.All open FStar.Mul open Lib.IntTypes open Lib.Buffer open Hacl.Bignum25519 module F51 = Hacl.Impl.Ed25519.Field51 module S51 = Hacl.Spec.Curve25519.Field51.Definition module SC = Spec.Curve25519 module SE = Spec.Ed25519 #reset...
{ "checked_file": "/", "dependencies": [ "Spec.Ed25519.fst.checked", "Spec.Curve25519.fst.checked", "prims.fst.checked", "Lib.RawIntTypes.fsti.checked", "Lib.IntTypes.Compatibility.fst.checked", "Lib.IntTypes.fsti.checked", "Lib.Buffer.fsti.checked", "Hacl.Spec.Curve25519.Field51.Def...
[ { "abbrev": true, "full_module": "Spec.Ed25519", "short_module": "SE" }, { "abbrev": true, "full_module": "Spec.Curve25519", "short_module": "SC" }, { "abbrev": true, "full_module": "Hacl.Spec.Curve25519.Field51.Definition", "short_module": "S51" }, { "abbrev": tr...
{ "detail_errors": false, "detail_hint_replay": false, "initial_fuel": 2, "initial_ifuel": 1, "max_fuel": 0, "max_ifuel": 0, "no_plugins": false, "no_smt": false, "no_tactics": false, "quake_hi": 1, "quake_keep": false, "quake_lo": 1, "retry": false, "reuse_hint_for": null, "smtencoding_el...
false
Type0
Prims.Tot
[ "total" ]
[]
[ "Lib.Buffer.lbuffer", "Lib.IntTypes.uint64", "FStar.UInt32.__uint_to_t" ]
[]
false
false
false
true
true
let elemB =
lbuffer uint64 5ul
false
Ast.fst
Ast.atomic_action_has_out_expr
val atomic_action_has_out_expr (a: atomic_action) : Tot bool
val atomic_action_has_out_expr (a: atomic_action) : Tot bool
let atomic_action_has_out_expr (a: atomic_action) : Tot bool = match a with | Action_field_ptr_after _ write_to | Action_assignment write_to _ -> out_expr_is_out_type_expr write_to | _ -> false
{ "file_name": "src/3d/Ast.fst", "git_rev": "00217c4a89f5ba56002ba9aa5b4a9d5903bfe9fa", "git_url": "https://github.com/project-everest/everparse.git", "project_name": "everparse" }
{ "end_col": 14, "end_line": 642, "start_col": 0, "start_line": 637 }
(* Copyright 2019 Microsoft Research Licensed under the Apache License, Version 2.0 (the "License"); you may not use this file except in compliance with the License. You may obtain a copy of the License at http://www.apache.org/licenses/LICENSE-2.0 Unless required by applicable law or agreed to...
{ "checked_file": "/", "dependencies": [ "prims.fst.checked", "Options.fsti.checked", "Hashtable.fsti.checked", "FStar.UInt.fsti.checked", "FStar.String.fsti.checked", "FStar.ST.fst.checked", "FStar.Printf.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fst...
[ { "abbrev": false, "full_module": "FStar.List.Tot", "short_module": null }, { "abbrev": false, "full_module": "FStar.All", "short_module": null }, { "abbrev": false, "full_module": "FStar.Pervasives", "short_module": null }, { "abbrev": false, "full_module": "...
{ "detail_errors": false, "detail_hint_replay": false, "initial_fuel": 2, "initial_ifuel": 1, "max_fuel": 8, "max_ifuel": 2, "no_plugins": false, "no_smt": false, "no_tactics": false, "quake_hi": 1, "quake_keep": false, "quake_lo": 1, "retry": false, "reuse_hint_for": null, "smtencoding_el...
false
a: Ast.atomic_action -> Prims.bool
Prims.Tot
[ "total" ]
[]
[ "Ast.atomic_action", "Ast.expr", "Ast.out_expr", "Ast.out_expr_is_out_type_expr", "Prims.bool" ]
[]
false
false
false
true
false
let atomic_action_has_out_expr (a: atomic_action) : Tot bool =
match a with | Action_field_ptr_after _ write_to | Action_assignment write_to _ -> out_expr_is_out_type_expr write_to | _ -> false
false
Ast.fst
Ast.atomic_field_has_out_expr
val atomic_field_has_out_expr (f: atomic_field) : Tot bool
val atomic_field_has_out_expr (f: atomic_field) : Tot bool
let atomic_field_has_out_expr (f: atomic_field) : Tot bool = let sf = f.v in field_action_has_out_expr sf.field_action
{ "file_name": "src/3d/Ast.fst", "git_rev": "00217c4a89f5ba56002ba9aa5b4a9d5903bfe9fa", "git_url": "https://github.com/project-everest/everparse.git", "project_name": "everparse" }
{ "end_col": 43, "end_line": 675, "start_col": 0, "start_line": 673 }
(* Copyright 2019 Microsoft Research Licensed under the Apache License, Version 2.0 (the "License"); you may not use this file except in compliance with the License. You may obtain a copy of the License at http://www.apache.org/licenses/LICENSE-2.0 Unless required by applicable law or agreed to...
{ "checked_file": "/", "dependencies": [ "prims.fst.checked", "Options.fsti.checked", "Hashtable.fsti.checked", "FStar.UInt.fsti.checked", "FStar.String.fsti.checked", "FStar.ST.fst.checked", "FStar.Printf.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fst...
[ { "abbrev": false, "full_module": "FStar.List.Tot", "short_module": null }, { "abbrev": false, "full_module": "FStar.All", "short_module": null }, { "abbrev": false, "full_module": "FStar.Pervasives", "short_module": null }, { "abbrev": false, "full_module": "...
{ "detail_errors": false, "detail_hint_replay": false, "initial_fuel": 2, "initial_ifuel": 1, "max_fuel": 8, "max_ifuel": 2, "no_plugins": false, "no_smt": false, "no_tactics": false, "quake_hi": 1, "quake_keep": false, "quake_lo": 1, "retry": false, "reuse_hint_for": null, "smtencoding_el...
false
f: Ast.atomic_field -> Prims.bool
Prims.Tot
[ "total" ]
[]
[ "Ast.atomic_field", "Ast.field_action_has_out_expr", "Ast.__proj__Mkatomic_field'__item__field_action", "Ast.atomic_field'", "Ast.__proj__Mkwith_meta_t__item__v", "Prims.bool" ]
[]
false
false
false
true
false
let atomic_field_has_out_expr (f: atomic_field) : Tot bool =
let sf = f.v in field_action_has_out_expr sf.field_action
false
Ast.fst
Ast.comments_buffer
val comments_buffer:comments_buffer_t
val comments_buffer:comments_buffer_t
let comments_buffer : comments_buffer_t = let buffer : ref (list (string & pos & pos)) = FStar.ST.alloc [] in let buffer_comment (c, s, p) = let c = String.substring c 2 (String.length c - 2) in buffer := (c, s, p) :: !buffer in let flush_comments () = let cs = !buffer in buffer := []; ...
{ "file_name": "src/3d/Ast.fst", "git_rev": "00217c4a89f5ba56002ba9aa5b4a9d5903bfe9fa", "git_url": "https://github.com/project-everest/everparse.git", "project_name": "everparse" }
{ "end_col": 3, "end_line": 73, "start_col": 0, "start_line": 44 }
(* Copyright 2019 Microsoft Research Licensed under the Apache License, Version 2.0 (the "License"); you may not use this file except in compliance with the License. You may obtain a copy of the License at http://www.apache.org/licenses/LICENSE-2.0 Unless required by applicable law or agreed to...
{ "checked_file": "/", "dependencies": [ "prims.fst.checked", "Options.fsti.checked", "Hashtable.fsti.checked", "FStar.UInt.fsti.checked", "FStar.String.fsti.checked", "FStar.ST.fst.checked", "FStar.Printf.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fst...
[ { "abbrev": false, "full_module": "FStar.All", "short_module": null }, { "abbrev": false, "full_module": "FStar.Pervasives", "short_module": null }, { "abbrev": false, "full_module": "Prims", "short_module": null }, { "abbrev": false, "full_module": "FStar", ...
{ "detail_errors": false, "detail_hint_replay": false, "initial_fuel": 2, "initial_ifuel": 1, "max_fuel": 8, "max_ifuel": 2, "no_plugins": false, "no_smt": false, "no_tactics": false, "quake_hi": 1, "quake_keep": false, "quake_lo": 1, "retry": false, "reuse_hint_for": null, "smtencoding_el...
false
Ast.comments_buffer_t
Prims.Tot
[ "total" ]
[]
[ "Ast.Mkcomments_buffer_t", "Ast.pos", "Prims.list", "Prims.string", "FStar.Pervasives.Native.tuple3", "FStar.List.map", "Prims.unit", "FStar.ST.op_Colon_Equals", "FStar.Heap.trivial_preorder", "FStar.Pervasives.Native.tuple2", "FStar.List.partition", "Prims.op_LessThanOrEqual", "Ast.__proj__...
[]
false
false
false
true
false
let comments_buffer:comments_buffer_t =
let buffer:ref (list (string & pos & pos)) = FStar.ST.alloc [] in let buffer_comment (c, s, p) = let c = String.substring c 2 (String.length c - 2) in buffer := (c, s, p) :: !buffer in let flush_comments () = let cs = !buffer in buffer := []; (List.rev cs) |> List.map (fun (c, _, _) -> c) in let flush_until p...
false
Ast.fst
Ast.parse_int_suffix
val parse_int_suffix (i: string) : string * option integer_type
val parse_int_suffix (i: string) : string * option integer_type
let parse_int_suffix (i:string) : string * option integer_type = let l = String.length i in if l >= 2 then let suffix = String.sub i (l - 2) 2 in let prefix = String.sub i 0 (l - 2) in match suffix with | "uy" -> prefix, Some UInt8 | "us" -> prefix, Some UInt16 ...
{ "file_name": "src/3d/Ast.fst", "git_rev": "00217c4a89f5ba56002ba9aa5b4a9d5903bfe9fa", "git_url": "https://github.com/project-everest/everparse.git", "project_name": "everparse" }
{ "end_col": 16, "end_line": 170, "start_col": 0, "start_line": 159 }
(* Copyright 2019 Microsoft Research Licensed under the Apache License, Version 2.0 (the "License"); you may not use this file except in compliance with the License. You may obtain a copy of the License at http://www.apache.org/licenses/LICENSE-2.0 Unless required by applicable law or agreed to...
{ "checked_file": "/", "dependencies": [ "prims.fst.checked", "Options.fsti.checked", "Hashtable.fsti.checked", "FStar.UInt.fsti.checked", "FStar.String.fsti.checked", "FStar.ST.fst.checked", "FStar.Printf.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fst...
[ { "abbrev": false, "full_module": "FStar.All", "short_module": null }, { "abbrev": false, "full_module": "FStar.Pervasives", "short_module": null }, { "abbrev": false, "full_module": "Prims", "short_module": null }, { "abbrev": false, "full_module": "FStar", ...
{ "detail_errors": false, "detail_hint_replay": false, "initial_fuel": 2, "initial_ifuel": 1, "max_fuel": 8, "max_ifuel": 2, "no_plugins": false, "no_smt": false, "no_tactics": false, "quake_hi": 1, "quake_keep": false, "quake_lo": 1, "retry": false, "reuse_hint_for": null, "smtencoding_el...
false
i: Prims.string -> Prims.string * FStar.Pervasives.Native.option Ast.integer_type
Prims.Tot
[ "total" ]
[]
[ "Prims.string", "Prims.op_GreaterThanOrEqual", "FStar.Pervasives.Native.Mktuple2", "FStar.Pervasives.Native.option", "Ast.integer_type", "FStar.Pervasives.Native.Some", "Ast.UInt8", "Ast.UInt16", "Ast.UInt32", "Ast.UInt64", "FStar.Pervasives.Native.None", "FStar.Pervasives.Native.tuple2", "P...
[]
false
false
false
true
false
let parse_int_suffix (i: string) : string * option integer_type =
let l = String.length i in if l >= 2 then let suffix = String.sub i (l - 2) 2 in let prefix = String.sub i 0 (l - 2) in match suffix with | "uy" -> prefix, Some UInt8 | "us" -> prefix, Some UInt16 | "ul" -> prefix, Some UInt32 | "uL" -> prefix, Some UInt64 | _ -> i, None else i, None
false
Ast.fst
Ast.integer_type_lub
val integer_type_lub (t1 t2: integer_type) : Tot integer_type
val integer_type_lub (t1 t2: integer_type) : Tot integer_type
let integer_type_lub (t1 t2: integer_type) : Tot integer_type = match t1, t2 with | UInt64, _ | _, UInt64 -> UInt64 | _, UInt32 | UInt32, _ -> UInt32 | _, UInt16 | UInt16, _ -> UInt16 | UInt8, UInt8 -> UInt8
{ "file_name": "src/3d/Ast.fst", "git_rev": "00217c4a89f5ba56002ba9aa5b4a9d5903bfe9fa", "git_url": "https://github.com/project-everest/everparse.git", "project_name": "everparse" }
{ "end_col": 25, "end_line": 190, "start_col": 0, "start_line": 182 }
(* Copyright 2019 Microsoft Research Licensed under the Apache License, Version 2.0 (the "License"); you may not use this file except in compliance with the License. You may obtain a copy of the License at http://www.apache.org/licenses/LICENSE-2.0 Unless required by applicable law or agreed to...
{ "checked_file": "/", "dependencies": [ "prims.fst.checked", "Options.fsti.checked", "Hashtable.fsti.checked", "FStar.UInt.fsti.checked", "FStar.String.fsti.checked", "FStar.ST.fst.checked", "FStar.Printf.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fst...
[ { "abbrev": false, "full_module": "FStar.All", "short_module": null }, { "abbrev": false, "full_module": "FStar.Pervasives", "short_module": null }, { "abbrev": false, "full_module": "Prims", "short_module": null }, { "abbrev": false, "full_module": "FStar", ...
{ "detail_errors": false, "detail_hint_replay": false, "initial_fuel": 2, "initial_ifuel": 1, "max_fuel": 8, "max_ifuel": 2, "no_plugins": false, "no_smt": false, "no_tactics": false, "quake_hi": 1, "quake_keep": false, "quake_lo": 1, "retry": false, "reuse_hint_for": null, "smtencoding_el...
false
t1: Ast.integer_type -> t2: Ast.integer_type -> Ast.integer_type
Prims.Tot
[ "total" ]
[]
[ "Ast.integer_type", "FStar.Pervasives.Native.Mktuple2", "Ast.UInt64", "Ast.UInt32", "Ast.UInt16", "Ast.UInt8" ]
[]
false
false
false
true
false
let integer_type_lub (t1 t2: integer_type) : Tot integer_type =
match t1, t2 with | UInt64, _ | _, UInt64 -> UInt64 | _, UInt32 | UInt32, _ -> UInt32 | _, UInt16 | UInt16, _ -> UInt16 | UInt8, UInt8 -> UInt8
false
Ast.fst
Ast.check_reserved_identifier
val check_reserved_identifier : i: Ast.ident -> FStar.All.ALL Prims.unit
let check_reserved_identifier (i:ident) = let open FStar.String in let s = i.v.name in if length s >= 3 && sub s 0 3 = reserved_prefix then error "Identifiers cannot begin with \"___\"" i.range
{ "file_name": "src/3d/Ast.fst", "git_rev": "00217c4a89f5ba56002ba9aa5b4a9d5903bfe9fa", "git_url": "https://github.com/project-everest/everparse.git", "project_name": "everparse" }
{ "end_col": 60, "end_line": 150, "start_col": 0, "start_line": 145 }
(* Copyright 2019 Microsoft Research Licensed under the Apache License, Version 2.0 (the "License"); you may not use this file except in compliance with the License. You may obtain a copy of the License at http://www.apache.org/licenses/LICENSE-2.0 Unless required by applicable law or agreed to...
{ "checked_file": "/", "dependencies": [ "prims.fst.checked", "Options.fsti.checked", "Hashtable.fsti.checked", "FStar.UInt.fsti.checked", "FStar.String.fsti.checked", "FStar.ST.fst.checked", "FStar.Printf.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fst...
[ { "abbrev": false, "full_module": "FStar.All", "short_module": null }, { "abbrev": false, "full_module": "FStar.Pervasives", "short_module": null }, { "abbrev": false, "full_module": "Prims", "short_module": null }, { "abbrev": false, "full_module": "FStar", ...
{ "detail_errors": false, "detail_hint_replay": false, "initial_fuel": 2, "initial_ifuel": 1, "max_fuel": 8, "max_ifuel": 2, "no_plugins": false, "no_smt": false, "no_tactics": false, "quake_hi": 1, "quake_keep": false, "quake_lo": 1, "retry": false, "reuse_hint_for": null, "smtencoding_el...
false
i: Ast.ident -> FStar.All.ALL Prims.unit
FStar.All.ALL
[]
[]
[ "Ast.ident", "Prims.op_AmpAmp", "Prims.op_GreaterThanOrEqual", "FStar.String.length", "Prims.op_Equality", "Prims.string", "FStar.String.sub", "Ast.reserved_prefix", "Ast.error", "Prims.unit", "Ast.__proj__Mkwith_meta_t__item__range", "Ast.ident'", "Prims.bool", "Ast.__proj__Mkident'__item...
[]
false
true
false
false
false
let check_reserved_identifier (i: ident) =
let open FStar.String in let s = i.v.name in if length s >= 3 && sub s 0 3 = reserved_prefix then error "Identifiers cannot begin with \"___\"" i.range
false
Ast.fst
Ast.integer_type_leq
val integer_type_leq (t1 t2: integer_type) : bool
val integer_type_leq (t1 t2: integer_type) : bool
let integer_type_leq (t1 t2: integer_type) : bool = integer_type_lub t1 t2 = t2
{ "file_name": "src/3d/Ast.fst", "git_rev": "00217c4a89f5ba56002ba9aa5b4a9d5903bfe9fa", "git_url": "https://github.com/project-everest/everparse.git", "project_name": "everparse" }
{ "end_col": 29, "end_line": 193, "start_col": 0, "start_line": 192 }
(* Copyright 2019 Microsoft Research Licensed under the Apache License, Version 2.0 (the "License"); you may not use this file except in compliance with the License. You may obtain a copy of the License at http://www.apache.org/licenses/LICENSE-2.0 Unless required by applicable law or agreed to...
{ "checked_file": "/", "dependencies": [ "prims.fst.checked", "Options.fsti.checked", "Hashtable.fsti.checked", "FStar.UInt.fsti.checked", "FStar.String.fsti.checked", "FStar.ST.fst.checked", "FStar.Printf.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fst...
[ { "abbrev": false, "full_module": "FStar.All", "short_module": null }, { "abbrev": false, "full_module": "FStar.Pervasives", "short_module": null }, { "abbrev": false, "full_module": "Prims", "short_module": null }, { "abbrev": false, "full_module": "FStar", ...
{ "detail_errors": false, "detail_hint_replay": false, "initial_fuel": 2, "initial_ifuel": 1, "max_fuel": 8, "max_ifuel": 2, "no_plugins": false, "no_smt": false, "no_tactics": false, "quake_hi": 1, "quake_keep": false, "quake_lo": 1, "retry": false, "reuse_hint_for": null, "smtencoding_el...
false
t1: Ast.integer_type -> t2: Ast.integer_type -> Prims.bool
Prims.Tot
[ "total" ]
[]
[ "Ast.integer_type", "Prims.op_Equality", "Ast.integer_type_lub", "Prims.bool" ]
[]
false
false
false
true
false
let integer_type_leq (t1 t2: integer_type) : bool =
integer_type_lub t1 t2 = t2
false
Ast.fst
Ast.bit_order_of
val bit_order_of (i: ident) : ML bitfield_bit_order
val bit_order_of (i: ident) : ML bitfield_bit_order
let bit_order_of (i:ident) : ML bitfield_bit_order = match maybe_bit_order_of i with | None -> error ("Unknown integer type: " ^ ident_to_string i) i.range | Some t -> t
{ "file_name": "src/3d/Ast.fst", "git_rev": "00217c4a89f5ba56002ba9aa5b4a9d5903bfe9fa", "git_url": "https://github.com/project-everest/everparse.git", "project_name": "everparse" }
{ "end_col": 15, "end_line": 243, "start_col": 0, "start_line": 240 }
(* Copyright 2019 Microsoft Research Licensed under the Apache License, Version 2.0 (the "License"); you may not use this file except in compliance with the License. You may obtain a copy of the License at http://www.apache.org/licenses/LICENSE-2.0 Unless required by applicable law or agreed to...
{ "checked_file": "/", "dependencies": [ "prims.fst.checked", "Options.fsti.checked", "Hashtable.fsti.checked", "FStar.UInt.fsti.checked", "FStar.String.fsti.checked", "FStar.ST.fst.checked", "FStar.Printf.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fst...
[ { "abbrev": false, "full_module": "FStar.All", "short_module": null }, { "abbrev": false, "full_module": "FStar.Pervasives", "short_module": null }, { "abbrev": false, "full_module": "Prims", "short_module": null }, { "abbrev": false, "full_module": "FStar", ...
{ "detail_errors": false, "detail_hint_replay": false, "initial_fuel": 2, "initial_ifuel": 1, "max_fuel": 8, "max_ifuel": 2, "no_plugins": false, "no_smt": false, "no_tactics": false, "quake_hi": 1, "quake_keep": false, "quake_lo": 1, "retry": false, "reuse_hint_for": null, "smtencoding_el...
false
i: Ast.ident -> FStar.All.ML Ast.bitfield_bit_order
FStar.All.ML
[ "ml" ]
[]
[ "Ast.ident", "Ast.maybe_bit_order_of", "Ast.error", "Ast.bitfield_bit_order", "Prims.op_Hat", "Ast.ident_to_string", "Ast.__proj__Mkwith_meta_t__item__range", "Ast.ident'" ]
[]
false
true
false
false
false
let bit_order_of (i: ident) : ML bitfield_bit_order =
match maybe_bit_order_of i with | None -> error ("Unknown integer type: " ^ ident_to_string i) i.range | Some t -> t
false
Hacl.Test.HMAC_DRBG.fst
Hacl.Test.HMAC_DRBG.test_many
val test_many : label: C.String.t -> f: (_: a -> FStar.HyperStack.ST.Stack Prims.unit) -> vec: Test.Lowstarize.lbuffer a -> FStar.HyperStack.ST.STATE Prims.unit
let test_many #a (label:C.String.t) (f:a -> Stack unit (fun _ -> True) (fun _ _ _ -> True)) (vec: L.lbuffer a) = C.String.print label; C.String.(print !$"\n"); let L.LB len vs = vec in let f (i:UInt32.t{0 <= v i /\ v i < v len}): Stack unit (requires fun h -> True) (ensures fun h0 _ h1 -> True) = ...
{ "file_name": "code/tests/Hacl.Test.HMAC_DRBG.fst", "git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872", "git_url": "https://github.com/project-everest/hacl-star.git", "project_name": "hacl-star" }
{ "end_col": 41, "end_line": 130, "start_col": 0, "start_line": 115 }
module Hacl.Test.HMAC_DRBG open FStar.HyperStack.ST open Test.Lowstarize open Lib.IntTypes open Hacl.HMAC_DRBG open Spec.HMAC_DRBG.Test.Vectors module D = Spec.Hash.Definitions module L = Test.Lowstarize module B = LowStar.Buffer #set-options "--fuel 0 --ifuel 0 --z3rlimit 100" (* FStar.Reflection only supports u...
{ "checked_file": "/", "dependencies": [ "Test.Lowstarize.fst.checked", "Spec.HMAC_DRBG.Test.Vectors.fst.checked", "Spec.HMAC_DRBG.fsti.checked", "Spec.Hash.Definitions.fst.checked", "prims.fst.checked", "LowStar.Printf.fst.checked", "LowStar.BufferOps.fst.checked", "LowStar.Buffer.f...
[ { "abbrev": true, "full_module": "LowStar.Buffer", "short_module": "B" }, { "abbrev": true, "full_module": "Test.Lowstarize", "short_module": "L" }, { "abbrev": true, "full_module": "Spec.Hash.Definitions", "short_module": "D" }, { "abbrev": false, "full_modul...
{ "detail_errors": false, "detail_hint_replay": false, "initial_fuel": 0, "initial_ifuel": 0, "max_fuel": 0, "max_ifuel": 0, "no_plugins": false, "no_smt": false, "no_tactics": false, "quake_hi": 1, "quake_keep": false, "quake_lo": 1, "retry": false, "reuse_hint_for": null, "smtencoding_el...
false
label: C.String.t -> f: (_: a -> FStar.HyperStack.ST.Stack Prims.unit) -> vec: Test.Lowstarize.lbuffer a -> FStar.HyperStack.ST.STATE Prims.unit
FStar.HyperStack.ST.STATE
[]
[]
[ "C.String.t", "Prims.unit", "FStar.Monotonic.HyperStack.mem", "Prims.l_True", "Test.Lowstarize.lbuffer", "FStar.UInt32.t", "LowStar.Buffer.buffer", "Prims.l_and", "Prims.eq2", "LowStar.Monotonic.Buffer.len", "LowStar.Buffer.trivial_preorder", "LowStar.Monotonic.Buffer.recallable", "C.Loops.f...
[]
false
true
false
false
false
let test_many #a (label: C.String.t) (f: (a -> Stack unit (fun _ -> True) (fun _ _ _ -> True))) (vec: L.lbuffer a) =
C.String.print label; (let open C.String in print !$"\n"); let L.LB len vs = vec in let f (i: UInt32.t{0 <= v i /\ v i < v len}) : Stack unit (requires fun h -> True) (ensures fun h0 _ h1 -> True) = let open LowStar.BufferOps in B.recall vs; (let open LowStar.Printf in printf "HMAC-DRBG Test %ul/%ul\n" (i +! ...
false
Ast.fst
Ast.maybe_as_integer_typ
val maybe_as_integer_typ (i: ident) : Tot (option integer_type)
val maybe_as_integer_typ (i: ident) : Tot (option integer_type)
let maybe_as_integer_typ (i:ident) : Tot (option integer_type) = if i.v.modul_name <> None then None else match i.v.name with | "UINT8" -> Some UInt8 | "UINT16" -> Some UInt16 | "UINT32" -> Some UInt32 | "UINT64" -> Some UInt64 | "UINT8BE" -> Some UInt8 | "UINT16BE" -> Some U...
{ "file_name": "src/3d/Ast.fst", "git_rev": "00217c4a89f5ba56002ba9aa5b4a9d5903bfe9fa", "git_url": "https://github.com/project-everest/everparse.git", "project_name": "everparse" }
{ "end_col": 15, "end_line": 208, "start_col": 0, "start_line": 195 }
(* Copyright 2019 Microsoft Research Licensed under the Apache License, Version 2.0 (the "License"); you may not use this file except in compliance with the License. You may obtain a copy of the License at http://www.apache.org/licenses/LICENSE-2.0 Unless required by applicable law or agreed to...
{ "checked_file": "/", "dependencies": [ "prims.fst.checked", "Options.fsti.checked", "Hashtable.fsti.checked", "FStar.UInt.fsti.checked", "FStar.String.fsti.checked", "FStar.ST.fst.checked", "FStar.Printf.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fst...
[ { "abbrev": false, "full_module": "FStar.All", "short_module": null }, { "abbrev": false, "full_module": "FStar.Pervasives", "short_module": null }, { "abbrev": false, "full_module": "Prims", "short_module": null }, { "abbrev": false, "full_module": "FStar", ...
{ "detail_errors": false, "detail_hint_replay": false, "initial_fuel": 2, "initial_ifuel": 1, "max_fuel": 8, "max_ifuel": 2, "no_plugins": false, "no_smt": false, "no_tactics": false, "quake_hi": 1, "quake_keep": false, "quake_lo": 1, "retry": false, "reuse_hint_for": null, "smtencoding_el...
false
i: Ast.ident -> FStar.Pervasives.Native.option Ast.integer_type
Prims.Tot
[ "total" ]
[]
[ "Ast.ident", "Prims.op_disEquality", "FStar.Pervasives.Native.option", "Prims.string", "Ast.__proj__Mkident'__item__modul_name", "Ast.__proj__Mkwith_meta_t__item__v", "Ast.ident'", "FStar.Pervasives.Native.None", "Ast.integer_type", "Prims.bool", "Ast.__proj__Mkident'__item__name", "FStar.Perv...
[]
false
false
false
true
false
let maybe_as_integer_typ (i: ident) : Tot (option integer_type) =
if i.v.modul_name <> None then None else match i.v.name with | "UINT8" -> Some UInt8 | "UINT16" -> Some UInt16 | "UINT32" -> Some UInt32 | "UINT64" -> Some UInt64 | "UINT8BE" -> Some UInt8 | "UINT16BE" -> Some UInt16 | "UINT32BE" -> Some UInt32 | "UINT64BE" -> Some UInt64 | _ -> None
false
Ast.fst
Ast.decl_has_out_expr
val decl_has_out_expr (d: decl) : Tot bool
val decl_has_out_expr (d: decl) : Tot bool
let decl_has_out_expr (d: decl) : Tot bool = match d.d_decl.v with | Record _ _ _ ast_fields -> record_has_out_expr ast_fields | CaseType _ _ switch_case -> switch_case_has_out_expr switch_case | _ -> false
{ "file_name": "src/3d/Ast.fst", "git_rev": "00217c4a89f5ba56002ba9aa5b4a9d5903bfe9fa", "git_url": "https://github.com/project-everest/everparse.git", "project_name": "everparse" }
{ "end_col": 14, "end_line": 721, "start_col": 0, "start_line": 715 }
(* Copyright 2019 Microsoft Research Licensed under the Apache License, Version 2.0 (the "License"); you may not use this file except in compliance with the License. You may obtain a copy of the License at http://www.apache.org/licenses/LICENSE-2.0 Unless required by applicable law or agreed to...
{ "checked_file": "/", "dependencies": [ "prims.fst.checked", "Options.fsti.checked", "Hashtable.fsti.checked", "FStar.UInt.fsti.checked", "FStar.String.fsti.checked", "FStar.ST.fst.checked", "FStar.Printf.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fst...
[ { "abbrev": false, "full_module": "FStar.List.Tot", "short_module": null }, { "abbrev": false, "full_module": "FStar.All", "short_module": null }, { "abbrev": false, "full_module": "FStar.Pervasives", "short_module": null }, { "abbrev": false, "full_module": "...
{ "detail_errors": false, "detail_hint_replay": false, "initial_fuel": 2, "initial_ifuel": 1, "max_fuel": 8, "max_ifuel": 2, "no_plugins": false, "no_smt": false, "no_tactics": false, "quake_hi": 1, "quake_keep": false, "quake_lo": 1, "retry": false, "reuse_hint_for": null, "smtencoding_el...
false
d: Ast.decl -> Prims.bool
Prims.Tot
[ "total" ]
[]
[ "Ast.decl", "Ast.__proj__Mkwith_meta_t__item__v", "Ast.decl'", "Ast.__proj__Mkdecl__item__d_decl", "Ast.typedef_names", "Prims.list", "Ast.param", "FStar.Pervasives.Native.option", "Ast.expr", "Ast.record", "Ast.record_has_out_expr", "Ast.switch_case", "Ast.switch_case_has_out_expr", "Prim...
[]
false
false
false
true
false
let decl_has_out_expr (d: decl) : Tot bool =
match d.d_decl.v with | Record _ _ _ ast_fields -> record_has_out_expr ast_fields | CaseType _ _ switch_case -> switch_case_has_out_expr switch_case | _ -> false
false
Ast.fst
Ast.as_integer_typ
val as_integer_typ (i: ident) : ML integer_type
val as_integer_typ (i: ident) : ML integer_type
let as_integer_typ (i:ident) : ML integer_type = match maybe_as_integer_typ i with | None -> error ("Unknown integer type: " ^ ident_to_string i) i.range | Some t -> t
{ "file_name": "src/3d/Ast.fst", "git_rev": "00217c4a89f5ba56002ba9aa5b4a9d5903bfe9fa", "git_url": "https://github.com/project-everest/everparse.git", "project_name": "everparse" }
{ "end_col": 15, "end_line": 213, "start_col": 0, "start_line": 210 }
(* Copyright 2019 Microsoft Research Licensed under the Apache License, Version 2.0 (the "License"); you may not use this file except in compliance with the License. You may obtain a copy of the License at http://www.apache.org/licenses/LICENSE-2.0 Unless required by applicable law or agreed to...
{ "checked_file": "/", "dependencies": [ "prims.fst.checked", "Options.fsti.checked", "Hashtable.fsti.checked", "FStar.UInt.fsti.checked", "FStar.String.fsti.checked", "FStar.ST.fst.checked", "FStar.Printf.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fst...
[ { "abbrev": false, "full_module": "FStar.All", "short_module": null }, { "abbrev": false, "full_module": "FStar.Pervasives", "short_module": null }, { "abbrev": false, "full_module": "Prims", "short_module": null }, { "abbrev": false, "full_module": "FStar", ...
{ "detail_errors": false, "detail_hint_replay": false, "initial_fuel": 2, "initial_ifuel": 1, "max_fuel": 8, "max_ifuel": 2, "no_plugins": false, "no_smt": false, "no_tactics": false, "quake_hi": 1, "quake_keep": false, "quake_lo": 1, "retry": false, "reuse_hint_for": null, "smtencoding_el...
false
i: Ast.ident -> FStar.All.ML Ast.integer_type
FStar.All.ML
[ "ml" ]
[]
[ "Ast.ident", "Ast.maybe_as_integer_typ", "Ast.error", "Ast.integer_type", "Prims.op_Hat", "Ast.ident_to_string", "Ast.__proj__Mkwith_meta_t__item__range", "Ast.ident'" ]
[]
false
true
false
false
false
let as_integer_typ (i: ident) : ML integer_type =
match maybe_as_integer_typ i with | None -> error ("Unknown integer type: " ^ ident_to_string i) i.range | Some t -> t
false
Ast.fst
Ast.sequence_non_failing_actions
val sequence_non_failing_actions (a0: action{Action_act? a0.v}) (a1: action{Action_act? a1.v}) : a: action{Action_act? a.v}
val sequence_non_failing_actions (a0: action{Action_act? a0.v}) (a1: action{Action_act? a1.v}) : a: action{Action_act? a.v}
let sequence_non_failing_actions (a0:action{Action_act? a0.v}) (a1:action {Action_act? a1.v}) : a:action{Action_act? a.v} = let rec seq (a0:action) = let w a = with_range_and_comments a a1.range (a0.comments @ a1.comments) in let Action_act a1 = a1.v in...
{ "file_name": "src/3d/Ast.fst", "git_rev": "00217c4a89f5ba56002ba9aa5b4a9d5903bfe9fa", "git_url": "https://github.com/project-everest/everparse.git", "project_name": "everparse" }
{ "end_col": 18, "end_line": 429, "start_col": 0, "start_line": 395 }
(* Copyright 2019 Microsoft Research Licensed under the Apache License, Version 2.0 (the "License"); you may not use this file except in compliance with the License. You may obtain a copy of the License at http://www.apache.org/licenses/LICENSE-2.0 Unless required by applicable law or agreed to...
{ "checked_file": "/", "dependencies": [ "prims.fst.checked", "Options.fsti.checked", "Hashtable.fsti.checked", "FStar.UInt.fsti.checked", "FStar.String.fsti.checked", "FStar.ST.fst.checked", "FStar.Printf.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fst...
[ { "abbrev": false, "full_module": "FStar.List.Tot", "short_module": null }, { "abbrev": false, "full_module": "FStar.All", "short_module": null }, { "abbrev": false, "full_module": "FStar.Pervasives", "short_module": null }, { "abbrev": false, "full_module": "...
{ "detail_errors": false, "detail_hint_replay": false, "initial_fuel": 2, "initial_ifuel": 1, "max_fuel": 8, "max_ifuel": 2, "no_plugins": false, "no_smt": false, "no_tactics": false, "quake_hi": 1, "quake_keep": false, "quake_lo": 1, "retry": false, "reuse_hint_for": null, "smtencoding_el...
false
a0: Ast.action{Action_act? (Mkwith_meta_t?.v a0)} -> a1: Ast.action{Action_act? (Mkwith_meta_t?.v a1)} -> a: Ast.action{Action_act? (Mkwith_meta_t?.v a)}
Prims.Tot
[ "total" ]
[]
[ "Ast.action", "Prims.b2t", "Ast.uu___is_Action_act", "Ast.__proj__Mkwith_meta_t__item__v", "Ast.action'", "Ast.with_range_and_comments", "Ast.Action_act", "Ast.__proj__Mkwith_meta_t__item__range", "Ast.__proj__Mkwith_meta_t__item__comments", "Ast.with_meta_t", "Ast.atomic_action", "Ast.Action_...
[]
false
false
false
false
false
let sequence_non_failing_actions (a0: action{Action_act? a0.v}) (a1: action{Action_act? a1.v}) : a: action{Action_act? a.v} =
let rec seq (a0: action) = let w a = with_range_and_comments a a1.range (a0.comments @ a1.comments) in let Action_act a1 = a1.v in match a0.v with | Atomic_action a -> w (Action_seq a a1) | Action_seq a0 tl -> w (Action_seq a0 (seq tl)) | Action_ite hd th el -> let th = seq th in let el = matc...
false
Ast.fst
Ast.maybe_bit_order_of
val maybe_bit_order_of (i: ident) : Pure (option bitfield_bit_order) (requires True) (ensures (fun y -> Some? y == Some? (maybe_as_integer_typ i)))
val maybe_bit_order_of (i: ident) : Pure (option bitfield_bit_order) (requires True) (ensures (fun y -> Some? y == Some? (maybe_as_integer_typ i)))
let maybe_bit_order_of (i:ident) : Pure (option bitfield_bit_order) (requires True) (ensures (fun y -> Some? y == Some? (maybe_as_integer_typ i) )) = if i.v.modul_name <> None then None else match i.v.name with | "UINT8" -> Some LSBFirst | "UINT16" -> Some LSBFirst | "UINT32" ->...
{ "file_name": "src/3d/Ast.fst", "git_rev": "00217c4a89f5ba56002ba9aa5b4a9d5903bfe9fa", "git_url": "https://github.com/project-everest/everparse.git", "project_name": "everparse" }
{ "end_col": 15, "end_line": 238, "start_col": 0, "start_line": 221 }
(* Copyright 2019 Microsoft Research Licensed under the Apache License, Version 2.0 (the "License"); you may not use this file except in compliance with the License. You may obtain a copy of the License at http://www.apache.org/licenses/LICENSE-2.0 Unless required by applicable law or agreed to...
{ "checked_file": "/", "dependencies": [ "prims.fst.checked", "Options.fsti.checked", "Hashtable.fsti.checked", "FStar.UInt.fsti.checked", "FStar.String.fsti.checked", "FStar.ST.fst.checked", "FStar.Printf.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fst...
[ { "abbrev": false, "full_module": "FStar.All", "short_module": null }, { "abbrev": false, "full_module": "FStar.Pervasives", "short_module": null }, { "abbrev": false, "full_module": "Prims", "short_module": null }, { "abbrev": false, "full_module": "FStar", ...
{ "detail_errors": false, "detail_hint_replay": false, "initial_fuel": 2, "initial_ifuel": 1, "max_fuel": 8, "max_ifuel": 2, "no_plugins": false, "no_smt": false, "no_tactics": false, "quake_hi": 1, "quake_keep": false, "quake_lo": 1, "retry": false, "reuse_hint_for": null, "smtencoding_el...
false
i: Ast.ident -> Prims.Pure (FStar.Pervasives.Native.option Ast.bitfield_bit_order)
Prims.Pure
[]
[]
[ "Ast.ident", "Prims.op_disEquality", "FStar.Pervasives.Native.option", "Prims.string", "Ast.__proj__Mkident'__item__modul_name", "Ast.__proj__Mkwith_meta_t__item__v", "Ast.ident'", "FStar.Pervasives.Native.None", "Ast.bitfield_bit_order", "Prims.bool", "Ast.__proj__Mkident'__item__name", "FSta...
[]
false
false
false
false
false
let maybe_bit_order_of (i: ident) : Pure (option bitfield_bit_order) (requires True) (ensures (fun y -> Some? y == Some? (maybe_as_integer_typ i))) =
if i.v.modul_name <> None then None else match i.v.name with | "UINT8" -> Some LSBFirst | "UINT16" -> Some LSBFirst | "UINT32" -> Some LSBFirst | "UINT64" -> Some LSBFirst | "UINT8BE" -> Some MSBFirst | "UINT16BE" -> Some MSBFirst | "UINT32BE" -> Some MSBFirst | "UINT64BE" -> Some MSBFirst | _ -> No...
false
Ast.fst
Ast.dummy_range
val dummy_range : Ast.pos * Ast.pos
let dummy_range = dummy_pos, dummy_pos
{ "file_name": "src/3d/Ast.fst", "git_rev": "00217c4a89f5ba56002ba9aa5b4a9d5903bfe9fa", "git_url": "https://github.com/project-everest/everparse.git", "project_name": "everparse" }
{ "end_col": 38, "end_line": 781, "start_col": 0, "start_line": 781 }
(* Copyright 2019 Microsoft Research Licensed under the Apache License, Version 2.0 (the "License"); you may not use this file except in compliance with the License. You may obtain a copy of the License at http://www.apache.org/licenses/LICENSE-2.0 Unless required by applicable law or agreed to...
{ "checked_file": "/", "dependencies": [ "prims.fst.checked", "Options.fsti.checked", "Hashtable.fsti.checked", "FStar.UInt.fsti.checked", "FStar.String.fsti.checked", "FStar.ST.fst.checked", "FStar.Printf.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fst...
[ { "abbrev": false, "full_module": "FStar.List.Tot", "short_module": null }, { "abbrev": false, "full_module": "FStar.All", "short_module": null }, { "abbrev": false, "full_module": "FStar.Pervasives", "short_module": null }, { "abbrev": false, "full_module": "...
{ "detail_errors": false, "detail_hint_replay": false, "initial_fuel": 2, "initial_ifuel": 1, "max_fuel": 8, "max_ifuel": 2, "no_plugins": false, "no_smt": false, "no_tactics": false, "quake_hi": 1, "quake_keep": false, "quake_lo": 1, "retry": false, "reuse_hint_for": null, "smtencoding_el...
false
Ast.pos * Ast.pos
Prims.Tot
[ "total" ]
[]
[ "FStar.Pervasives.Native.Mktuple2", "Ast.pos", "Ast.dummy_pos" ]
[]
false
false
false
true
false
let dummy_range =
dummy_pos, dummy_pos
false
Ast.fst
Ast.eq_typ_param
val eq_typ_param (p1 p2: typ_param) : bool
val eq_typ_param (p1 p2: typ_param) : bool
let eq_typ_param (p1 p2:typ_param) : bool = match p1, p2 with | Inl e1, Inl e2 -> eq_expr e1 e2 | Inr o1, Inr o2 -> eq_out_expr o1 o2 | _ -> false
{ "file_name": "src/3d/Ast.fst", "git_rev": "00217c4a89f5ba56002ba9aa5b4a9d5903bfe9fa", "git_url": "https://github.com/project-everest/everparse.git", "project_name": "everparse" }
{ "end_col": 14, "end_line": 762, "start_col": 0, "start_line": 758 }
(* Copyright 2019 Microsoft Research Licensed under the Apache License, Version 2.0 (the "License"); you may not use this file except in compliance with the License. You may obtain a copy of the License at http://www.apache.org/licenses/LICENSE-2.0 Unless required by applicable law or agreed to...
{ "checked_file": "/", "dependencies": [ "prims.fst.checked", "Options.fsti.checked", "Hashtable.fsti.checked", "FStar.UInt.fsti.checked", "FStar.String.fsti.checked", "FStar.ST.fst.checked", "FStar.Printf.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fst...
[ { "abbrev": false, "full_module": "FStar.List.Tot", "short_module": null }, { "abbrev": false, "full_module": "FStar.All", "short_module": null }, { "abbrev": false, "full_module": "FStar.Pervasives", "short_module": null }, { "abbrev": false, "full_module": "...
{ "detail_errors": false, "detail_hint_replay": false, "initial_fuel": 2, "initial_ifuel": 1, "max_fuel": 8, "max_ifuel": 2, "no_plugins": false, "no_smt": false, "no_tactics": false, "quake_hi": 1, "quake_keep": false, "quake_lo": 1, "retry": false, "reuse_hint_for": null, "smtencoding_el...
false
p1: Ast.typ_param -> p2: Ast.typ_param -> Prims.bool
Prims.Tot
[ "total" ]
[]
[ "Ast.typ_param", "FStar.Pervasives.Native.Mktuple2", "Ast.either", "Ast.expr", "Ast.out_expr", "Ast.eq_expr", "Ast.eq_out_expr", "FStar.Pervasives.Native.tuple2", "Prims.bool" ]
[]
false
false
false
true
false
let eq_typ_param (p1 p2: typ_param) : bool =
match p1, p2 with | Inl e1, Inl e2 -> eq_expr e1 e2 | Inr o1, Inr o2 -> eq_out_expr o1 o2 | _ -> false
false
Ast.fst
Ast.puint8
val puint8 : Ast.with_meta_t Ast.typ'
let puint8 = mk_prim_t "PUINT8"
{ "file_name": "src/3d/Ast.fst", "git_rev": "00217c4a89f5ba56002ba9aa5b4a9d5903bfe9fa", "git_url": "https://github.com/project-everest/everparse.git", "project_name": "everparse" }
{ "end_col": 31, "end_line": 789, "start_col": 0, "start_line": 789 }
(* Copyright 2019 Microsoft Research Licensed under the Apache License, Version 2.0 (the "License"); you may not use this file except in compliance with the License. You may obtain a copy of the License at http://www.apache.org/licenses/LICENSE-2.0 Unless required by applicable law or agreed to...
{ "checked_file": "/", "dependencies": [ "prims.fst.checked", "Options.fsti.checked", "Hashtable.fsti.checked", "FStar.UInt.fsti.checked", "FStar.String.fsti.checked", "FStar.ST.fst.checked", "FStar.Printf.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fst...
[ { "abbrev": false, "full_module": "FStar.List.Tot", "short_module": null }, { "abbrev": false, "full_module": "FStar.All", "short_module": null }, { "abbrev": false, "full_module": "FStar.Pervasives", "short_module": null }, { "abbrev": false, "full_module": "...
{ "detail_errors": false, "detail_hint_replay": false, "initial_fuel": 2, "initial_ifuel": 1, "max_fuel": 8, "max_ifuel": 2, "no_plugins": false, "no_smt": false, "no_tactics": false, "quake_hi": 1, "quake_keep": false, "quake_lo": 1, "retry": false, "reuse_hint_for": null, "smtencoding_el...
false
Ast.with_meta_t Ast.typ'
Prims.Tot
[ "total" ]
[]
[ "Ast.mk_prim_t" ]
[]
false
false
false
true
false
let puint8 =
mk_prim_t "PUINT8"
false
Ast.fst
Ast.tuint32
val tuint32 : Ast.with_meta_t Ast.typ'
let tuint32 = mk_prim_t "UINT32"
{ "file_name": "src/3d/Ast.fst", "git_rev": "00217c4a89f5ba56002ba9aa5b4a9d5903bfe9fa", "git_url": "https://github.com/project-everest/everparse.git", "project_name": "everparse" }
{ "end_col": 32, "end_line": 791, "start_col": 0, "start_line": 791 }
(* Copyright 2019 Microsoft Research Licensed under the Apache License, Version 2.0 (the "License"); you may not use this file except in compliance with the License. You may obtain a copy of the License at http://www.apache.org/licenses/LICENSE-2.0 Unless required by applicable law or agreed to...
{ "checked_file": "/", "dependencies": [ "prims.fst.checked", "Options.fsti.checked", "Hashtable.fsti.checked", "FStar.UInt.fsti.checked", "FStar.String.fsti.checked", "FStar.ST.fst.checked", "FStar.Printf.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fst...
[ { "abbrev": false, "full_module": "FStar.List.Tot", "short_module": null }, { "abbrev": false, "full_module": "FStar.All", "short_module": null }, { "abbrev": false, "full_module": "FStar.Pervasives", "short_module": null }, { "abbrev": false, "full_module": "...
{ "detail_errors": false, "detail_hint_replay": false, "initial_fuel": 2, "initial_ifuel": 1, "max_fuel": 8, "max_ifuel": 2, "no_plugins": false, "no_smt": false, "no_tactics": false, "quake_hi": 1, "quake_keep": false, "quake_lo": 1, "retry": false, "reuse_hint_for": null, "smtencoding_el...
false
Ast.with_meta_t Ast.typ'
Prims.Tot
[ "total" ]
[]
[ "Ast.mk_prim_t" ]
[]
false
false
false
true
false
let tuint32 =
mk_prim_t "UINT32"
false
Ast.fst
Ast.mk_prim_t
val mk_prim_t : x: Prims.string -> Ast.with_meta_t Ast.typ'
let mk_prim_t x = with_dummy_range (Type_app (with_dummy_range (to_ident' x)) KindSpec [])
{ "file_name": "src/3d/Ast.fst", "git_rev": "00217c4a89f5ba56002ba9aa5b4a9d5903bfe9fa", "git_url": "https://github.com/project-everest/everparse.git", "project_name": "everparse" }
{ "end_col": 90, "end_line": 784, "start_col": 0, "start_line": 784 }
(* Copyright 2019 Microsoft Research Licensed under the Apache License, Version 2.0 (the "License"); you may not use this file except in compliance with the License. You may obtain a copy of the License at http://www.apache.org/licenses/LICENSE-2.0 Unless required by applicable law or agreed to...
{ "checked_file": "/", "dependencies": [ "prims.fst.checked", "Options.fsti.checked", "Hashtable.fsti.checked", "FStar.UInt.fsti.checked", "FStar.String.fsti.checked", "FStar.ST.fst.checked", "FStar.Printf.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fst...
[ { "abbrev": false, "full_module": "FStar.List.Tot", "short_module": null }, { "abbrev": false, "full_module": "FStar.All", "short_module": null }, { "abbrev": false, "full_module": "FStar.Pervasives", "short_module": null }, { "abbrev": false, "full_module": "...
{ "detail_errors": false, "detail_hint_replay": false, "initial_fuel": 2, "initial_ifuel": 1, "max_fuel": 8, "max_ifuel": 2, "no_plugins": false, "no_smt": false, "no_tactics": false, "quake_hi": 1, "quake_keep": false, "quake_lo": 1, "retry": false, "reuse_hint_for": null, "smtencoding_el...
false
x: Prims.string -> Ast.with_meta_t Ast.typ'
Prims.Tot
[ "total" ]
[]
[ "Prims.string", "Ast.with_dummy_range", "Ast.typ'", "Ast.Type_app", "Ast.ident'", "Ast.to_ident'", "Ast.KindSpec", "Prims.Nil", "Ast.either", "Ast.expr", "Ast.out_expr", "Ast.with_meta_t" ]
[]
false
false
false
true
false
let mk_prim_t x =
with_dummy_range (Type_app (with_dummy_range (to_ident' x)) KindSpec [])
false
Ast.fst
Ast.tbool
val tbool : Ast.with_meta_t Ast.typ'
let tbool = mk_prim_t "Bool"
{ "file_name": "src/3d/Ast.fst", "git_rev": "00217c4a89f5ba56002ba9aa5b4a9d5903bfe9fa", "git_url": "https://github.com/project-everest/everparse.git", "project_name": "everparse" }
{ "end_col": 28, "end_line": 785, "start_col": 0, "start_line": 785 }
(* Copyright 2019 Microsoft Research Licensed under the Apache License, Version 2.0 (the "License"); you may not use this file except in compliance with the License. You may obtain a copy of the License at http://www.apache.org/licenses/LICENSE-2.0 Unless required by applicable law or agreed to...
{ "checked_file": "/", "dependencies": [ "prims.fst.checked", "Options.fsti.checked", "Hashtable.fsti.checked", "FStar.UInt.fsti.checked", "FStar.String.fsti.checked", "FStar.ST.fst.checked", "FStar.Printf.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fst...
[ { "abbrev": false, "full_module": "FStar.List.Tot", "short_module": null }, { "abbrev": false, "full_module": "FStar.All", "short_module": null }, { "abbrev": false, "full_module": "FStar.Pervasives", "short_module": null }, { "abbrev": false, "full_module": "...
{ "detail_errors": false, "detail_hint_replay": false, "initial_fuel": 2, "initial_ifuel": 1, "max_fuel": 8, "max_ifuel": 2, "no_plugins": false, "no_smt": false, "no_tactics": false, "quake_hi": 1, "quake_keep": false, "quake_lo": 1, "retry": false, "reuse_hint_for": null, "smtencoding_el...
false
Ast.with_meta_t Ast.typ'
Prims.Tot
[ "total" ]
[]
[ "Ast.mk_prim_t" ]
[]
false
false
false
true
false
let tbool =
mk_prim_t "Bool"
false
Ast.fst
Ast.tuint64
val tuint64 : Ast.with_meta_t Ast.typ'
let tuint64 = mk_prim_t "UINT64"
{ "file_name": "src/3d/Ast.fst", "git_rev": "00217c4a89f5ba56002ba9aa5b4a9d5903bfe9fa", "git_url": "https://github.com/project-everest/everparse.git", "project_name": "everparse" }
{ "end_col": 32, "end_line": 792, "start_col": 0, "start_line": 792 }
(* Copyright 2019 Microsoft Research Licensed under the Apache License, Version 2.0 (the "License"); you may not use this file except in compliance with the License. You may obtain a copy of the License at http://www.apache.org/licenses/LICENSE-2.0 Unless required by applicable law or agreed to...
{ "checked_file": "/", "dependencies": [ "prims.fst.checked", "Options.fsti.checked", "Hashtable.fsti.checked", "FStar.UInt.fsti.checked", "FStar.String.fsti.checked", "FStar.ST.fst.checked", "FStar.Printf.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fst...
[ { "abbrev": false, "full_module": "FStar.List.Tot", "short_module": null }, { "abbrev": false, "full_module": "FStar.All", "short_module": null }, { "abbrev": false, "full_module": "FStar.Pervasives", "short_module": null }, { "abbrev": false, "full_module": "...
{ "detail_errors": false, "detail_hint_replay": false, "initial_fuel": 2, "initial_ifuel": 1, "max_fuel": 8, "max_ifuel": 2, "no_plugins": false, "no_smt": false, "no_tactics": false, "quake_hi": 1, "quake_keep": false, "quake_lo": 1, "retry": false, "reuse_hint_for": null, "smtencoding_el...
false
Ast.with_meta_t Ast.typ'
Prims.Tot
[ "total" ]
[]
[ "Ast.mk_prim_t" ]
[]
false
false
false
true
false
let tuint64 =
mk_prim_t "UINT64"
false
Ast.fst
Ast.tunit
val tunit : Ast.with_meta_t Ast.typ'
let tunit = mk_prim_t "unit"
{ "file_name": "src/3d/Ast.fst", "git_rev": "00217c4a89f5ba56002ba9aa5b4a9d5903bfe9fa", "git_url": "https://github.com/project-everest/everparse.git", "project_name": "everparse" }
{ "end_col": 28, "end_line": 786, "start_col": 0, "start_line": 786 }
(* Copyright 2019 Microsoft Research Licensed under the Apache License, Version 2.0 (the "License"); you may not use this file except in compliance with the License. You may obtain a copy of the License at http://www.apache.org/licenses/LICENSE-2.0 Unless required by applicable law or agreed to...
{ "checked_file": "/", "dependencies": [ "prims.fst.checked", "Options.fsti.checked", "Hashtable.fsti.checked", "FStar.UInt.fsti.checked", "FStar.String.fsti.checked", "FStar.ST.fst.checked", "FStar.Printf.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fst...
[ { "abbrev": false, "full_module": "FStar.List.Tot", "short_module": null }, { "abbrev": false, "full_module": "FStar.All", "short_module": null }, { "abbrev": false, "full_module": "FStar.Pervasives", "short_module": null }, { "abbrev": false, "full_module": "...
{ "detail_errors": false, "detail_hint_replay": false, "initial_fuel": 2, "initial_ifuel": 1, "max_fuel": 8, "max_ifuel": 2, "no_plugins": false, "no_smt": false, "no_tactics": false, "quake_hi": 1, "quake_keep": false, "quake_lo": 1, "retry": false, "reuse_hint_for": null, "smtencoding_el...
false
Ast.with_meta_t Ast.typ'
Prims.Tot
[ "total" ]
[]
[ "Ast.mk_prim_t" ]
[]
false
false
false
true
false
let tunit =
mk_prim_t "unit"
false
Hacl.Test.HMAC_DRBG.fst
Hacl.Test.HMAC_DRBG.main
val main: Prims.unit -> St C.exit_code
val main: Prims.unit -> St C.exit_code
let main () : St C.exit_code = test_many C.String.(!$"[HMAC_DRBG]") test_one vectors_low; C.EXIT_SUCCESS
{ "file_name": "code/tests/Hacl.Test.HMAC_DRBG.fst", "git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872", "git_url": "https://github.com/project-everest/hacl-star.git", "project_name": "hacl-star" }
{ "end_col": 16, "end_line": 134, "start_col": 0, "start_line": 132 }
module Hacl.Test.HMAC_DRBG open FStar.HyperStack.ST open Test.Lowstarize open Lib.IntTypes open Hacl.HMAC_DRBG open Spec.HMAC_DRBG.Test.Vectors module D = Spec.Hash.Definitions module L = Test.Lowstarize module B = LowStar.Buffer #set-options "--fuel 0 --ifuel 0 --z3rlimit 100" (* FStar.Reflection only supports u...
{ "checked_file": "/", "dependencies": [ "Test.Lowstarize.fst.checked", "Spec.HMAC_DRBG.Test.Vectors.fst.checked", "Spec.HMAC_DRBG.fsti.checked", "Spec.Hash.Definitions.fst.checked", "prims.fst.checked", "LowStar.Printf.fst.checked", "LowStar.BufferOps.fst.checked", "LowStar.Buffer.f...
[ { "abbrev": true, "full_module": "LowStar.Buffer", "short_module": "B" }, { "abbrev": true, "full_module": "Test.Lowstarize", "short_module": "L" }, { "abbrev": true, "full_module": "Spec.Hash.Definitions", "short_module": "D" }, { "abbrev": false, "full_modul...
{ "detail_errors": false, "detail_hint_replay": false, "initial_fuel": 0, "initial_ifuel": 0, "max_fuel": 0, "max_ifuel": 0, "no_plugins": false, "no_smt": false, "no_tactics": false, "quake_hi": 1, "quake_keep": false, "quake_lo": 1, "retry": false, "reuse_hint_for": null, "smtencoding_el...
false
_: Prims.unit -> FStar.HyperStack.ST.St C.exit_code
FStar.HyperStack.ST.St
[]
[]
[ "Prims.unit", "C.EXIT_SUCCESS", "C.exit_code", "Hacl.Test.HMAC_DRBG.test_many", "FStar.Pervasives.Native.tuple8", "Spec.Hash.Definitions.hash_alg", "Test.Lowstarize.lbuffer", "FStar.UInt8.t", "FStar.Pervasives.Native.tuple2", "C.String.op_Bang_Dollar", "Hacl.Test.HMAC_DRBG.test_one", "Hacl.Tes...
[]
false
true
false
false
false
let main () : St C.exit_code =
test_many C.String.(!$"[HMAC_DRBG]") test_one vectors_low; C.EXIT_SUCCESS
false
Ast.fst
Ast.tuint16
val tuint16 : Ast.with_meta_t Ast.typ'
let tuint16 = mk_prim_t "UINT16"
{ "file_name": "src/3d/Ast.fst", "git_rev": "00217c4a89f5ba56002ba9aa5b4a9d5903bfe9fa", "git_url": "https://github.com/project-everest/everparse.git", "project_name": "everparse" }
{ "end_col": 32, "end_line": 790, "start_col": 0, "start_line": 790 }
(* Copyright 2019 Microsoft Research Licensed under the Apache License, Version 2.0 (the "License"); you may not use this file except in compliance with the License. You may obtain a copy of the License at http://www.apache.org/licenses/LICENSE-2.0 Unless required by applicable law or agreed to...
{ "checked_file": "/", "dependencies": [ "prims.fst.checked", "Options.fsti.checked", "Hashtable.fsti.checked", "FStar.UInt.fsti.checked", "FStar.String.fsti.checked", "FStar.ST.fst.checked", "FStar.Printf.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fst...
[ { "abbrev": false, "full_module": "FStar.List.Tot", "short_module": null }, { "abbrev": false, "full_module": "FStar.All", "short_module": null }, { "abbrev": false, "full_module": "FStar.Pervasives", "short_module": null }, { "abbrev": false, "full_module": "...
{ "detail_errors": false, "detail_hint_replay": false, "initial_fuel": 2, "initial_ifuel": 1, "max_fuel": 8, "max_ifuel": 2, "no_plugins": false, "no_smt": false, "no_tactics": false, "quake_hi": 1, "quake_keep": false, "quake_lo": 1, "retry": false, "reuse_hint_for": null, "smtencoding_el...
false
Ast.with_meta_t Ast.typ'
Prims.Tot
[ "total" ]
[]
[ "Ast.mk_prim_t" ]
[]
false
false
false
true
false
let tuint16 =
mk_prim_t "UINT16"
false
Ast.fst
Ast.tuint8be
val tuint8be : Ast.with_meta_t Ast.typ'
let tuint8be = mk_prim_t "UINT8BE"
{ "file_name": "src/3d/Ast.fst", "git_rev": "00217c4a89f5ba56002ba9aa5b4a9d5903bfe9fa", "git_url": "https://github.com/project-everest/everparse.git", "project_name": "everparse" }
{ "end_col": 34, "end_line": 788, "start_col": 0, "start_line": 788 }
(* Copyright 2019 Microsoft Research Licensed under the Apache License, Version 2.0 (the "License"); you may not use this file except in compliance with the License. You may obtain a copy of the License at http://www.apache.org/licenses/LICENSE-2.0 Unless required by applicable law or agreed to...
{ "checked_file": "/", "dependencies": [ "prims.fst.checked", "Options.fsti.checked", "Hashtable.fsti.checked", "FStar.UInt.fsti.checked", "FStar.String.fsti.checked", "FStar.ST.fst.checked", "FStar.Printf.fst.checked", "FStar.Pervasives.Native.fst.checked", "FStar.Pervasives.fst...
[ { "abbrev": false, "full_module": "FStar.List.Tot", "short_module": null }, { "abbrev": false, "full_module": "FStar.All", "short_module": null }, { "abbrev": false, "full_module": "FStar.Pervasives", "short_module": null }, { "abbrev": false, "full_module": "...
{ "detail_errors": false, "detail_hint_replay": false, "initial_fuel": 2, "initial_ifuel": 1, "max_fuel": 8, "max_ifuel": 2, "no_plugins": false, "no_smt": false, "no_tactics": false, "quake_hi": 1, "quake_keep": false, "quake_lo": 1, "retry": false, "reuse_hint_for": null, "smtencoding_el...
false
Ast.with_meta_t Ast.typ'
Prims.Tot
[ "total" ]
[]
[ "Ast.mk_prim_t" ]
[]
false
false
false
true
false
let tuint8be =
mk_prim_t "UINT8BE"
false