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 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
LowParse.Low.Sum.fst | LowParse.Low.Sum.serialize32_sum_cases | val serialize32_sum_cases
(t: sum)
(#pc: (x: sum_key t -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(sc: (x: sum_key t -> Tot (serializer (dsnd (pc x)))))
(sc32: (x: sum_key t -> Tot (serializer32 (sc x))))
(destr: dep_enum_destr (sum_enum t) (serialize32_sum_cases_t t sc))
(k: sum_key t)
: Tot (serializer32 (serialize_sum_cases t pc sc k)) | val serialize32_sum_cases
(t: sum)
(#pc: (x: sum_key t -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(sc: (x: sum_key t -> Tot (serializer (dsnd (pc x)))))
(sc32: (x: sum_key t -> Tot (serializer32 (sc x))))
(destr: dep_enum_destr (sum_enum t) (serialize32_sum_cases_t t sc))
(k: sum_key t)
: Tot (serializer32 (serialize_sum_cases t pc sc k)) | let serialize32_sum_cases
(t: sum)
(#pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(sc: ((x: sum_key t) -> Tot (serializer (dsnd (pc x)))))
(sc32: ((x: sum_key t) -> Tot (serializer32 (sc x))))
(destr: dep_enum_destr (sum_enum t) (serialize32_sum_cases_t t sc))
(k: sum_key t)
: Tot (serializer32 (serialize_sum_cases t pc sc k))
= destr
_
(serialize32_sum_cases_t_if t sc)
(fun _ _ -> ())
(fun _ _ _ _ -> ())
(serialize32_sum_cases_aux t sc sc32)
k | {
"file_name": "src/lowparse/LowParse.Low.Sum.fst",
"git_rev": "00217c4a89f5ba56002ba9aa5b4a9d5903bfe9fa",
"git_url": "https://github.com/project-everest/everparse.git",
"project_name": "everparse"
} | {
"end_col": 5,
"end_line": 735,
"start_col": 0,
"start_line": 721
} | module LowParse.Low.Sum
include LowParse.Low.Enum
include LowParse.Spec.Sum
module U32 = FStar.UInt32
module HST = FStar.HyperStack.ST
module B = LowStar.Buffer
module Cast = FStar.Int.Cast
module U64 = FStar.UInt64
inline_for_extraction
let validate_sum_cases_aux
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(vc: ((x: sum_key t) -> Tot (validator (dsnd (pc x)))))
(k: sum_key t)
: Tot (validator (parse_sum_cases t pc k))
= [@inline_let]
let _ = synth_sum_case_injective t k in
validate_synth
(validate_weaken
(weaken_parse_cases_kind t pc)
(vc k)
()
)
(synth_sum_case t k)
()
inline_for_extraction
let validate_sum_cases_t
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot Type
= validator (parse_sum_cases t pc k)
let validate_sum_cases_t_eq
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
(x y : validate_sum_cases_t t pc k)
: GTot Type0
= True
inline_for_extraction
let validate_sum_cases_t_if
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (if_combinator _ (validate_sum_cases_t_eq t pc k))
= fun cond (sv_true: cond_true cond -> Tot (validate_sum_cases_t t pc k)) (sv_false: cond_false cond -> Tot (validate_sum_cases_t t pc k)) #rrel #rel input pos ->
if cond
then sv_true () input pos
else sv_false () input pos
inline_for_extraction
let validate_sum_cases
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(vc: ((x: sum_key t) -> Tot (validator (dsnd (pc x)))))
(destr: dep_enum_destr (sum_enum t) (validate_sum_cases_t t pc))
(k: sum_key t)
: Tot (validator (parse_sum_cases t pc k))
= destr
_
(validate_sum_cases_t_if t pc)
(fun _ _ -> ())
(fun _ _ _ _ -> ())
(validate_sum_cases_aux t pc vc)
k
inline_for_extraction
let validate_sum_aux_payload_t
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
: Tot Type
= (#rrel: _) -> (#rel: _) ->
(input: slice rrel rel) ->
(pos: U64.t) ->
HST.Stack U64.t
(requires (fun h -> live_slice h input /\ U64.v pos <= U32.v input.len))
(ensures (fun h res h' ->
B.modifies B.loc_none h h' /\ (
match k with
| Unknown _ -> is_error res
| Known k' ->
if is_success res
then
valid_pos (dsnd (pc k')) h input (uint64_to_uint32 pos) (uint64_to_uint32 res)
else
(~ (valid (dsnd (pc k')) h input (uint64_to_uint32 pos)))
)))
let validate_sum_aux_payload_eq
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
: Tot (validate_sum_aux_payload_t t pc k -> validate_sum_aux_payload_t t pc k -> GTot Type0)
= fun _ _ -> True
inline_for_extraction
let validate_sum_aux_payload_if'
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
(cond: bool)
(ift: ((cond_true cond) -> Tot (validate_sum_aux_payload_t t pc k)))
(iff: ((cond_false cond) -> Tot (validate_sum_aux_payload_t t pc k)))
: Tot (validate_sum_aux_payload_t t pc k)
= fun #rrel #rel input pos ->
if cond
then begin
(ift () <: validate_sum_aux_payload_t t pc k) input pos
end else
(iff () <: validate_sum_aux_payload_t t pc k) input pos
inline_for_extraction
let validate_sum_aux_payload_if
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
: Tot (if_combinator _ (validate_sum_aux_payload_eq t pc k))
= validate_sum_aux_payload_if' t pc k
#push-options "--z3rlimit 64 --z3cliopt smt.arith.nl=false --using_facts_from '* -FStar.Int.Cast -LowParse.BitFields'"
// --query_stats --smtencoding.elim_box true --smtencoding.l_arith_repr native --z3refresh"
inline_for_extraction
let validate_sum_aux
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(v: validator p)
(p32: leaf_reader p)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(v_payload: ((k: sum_repr_type t)) -> Tot (validate_sum_aux_payload_t t pc (maybe_enum_key_of_repr (sum_enum t) k)))
: Tot (validator (parse_sum t p pc))
= fun #rrel #rel input pos ->
let h = HST.get () in
[@inline_let]
let _ = parse_sum_eq'' t p pc (bytes_of_slice_from h input (uint64_to_uint32 pos)) in
[@inline_let]
let _ = valid_facts (parse_sum t p pc) h input (uint64_to_uint32 pos) in
[@inline_let]
let _ = valid_facts p h input (uint64_to_uint32 pos) in
let len_after_tag = v input pos in
if is_error len_after_tag
then len_after_tag
else begin
let h1 = HST.get () in
let k' = p32 input (uint64_to_uint32 pos) in
[@inline_let]
let _ =
match maybe_enum_key_of_repr (sum_enum t) k' with
| Known k -> valid_facts (dsnd (pc k)) h input (uint64_to_uint32 len_after_tag)
| _ -> ()
in
v_payload k' input len_after_tag
end
#pop-options
inline_for_extraction
let validate_sum_aux_payload'
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (validator (dsnd (pc x)))))
(k: maybe_enum_key (sum_enum t))
: Tot (validate_sum_aux_payload_t t pc k)
= fun #rrel #rel input pos ->
match k with
| Known k ->
[@inline_let]
let _ = synth_sum_case_injective t k in
pc32 k input pos
// validate_synth (pc32 k) (synth_sum_case t k) () input pos
| _ -> validator_error_generic
inline_for_extraction
let validate_sum_aux_payload
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (validator (dsnd (pc x)))))
(destr: dep_maybe_enum_destr_t (sum_enum t) (validate_sum_aux_payload_t t pc))
(k: sum_repr_type t)
: Tot (validate_sum_aux_payload_t t pc (maybe_enum_key_of_repr (sum_enum t) k))
= destr (validate_sum_aux_payload_eq t pc) (validate_sum_aux_payload_if t pc) (fun _ _ -> ()) (fun _ _ _ _ -> ()) (validate_sum_aux_payload' t pc pc32) k
inline_for_extraction
let validate_sum
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(v: validator p)
(p32: leaf_reader p)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (validator (dsnd (pc x)))))
(destr: dep_maybe_enum_destr_t (sum_enum t) (validate_sum_aux_payload_t t pc))
: Tot (validator (parse_sum t p pc))
= validate_sum_aux t v p32 pc (validate_sum_aux_payload t pc pc32 destr)
module HS = FStar.HyperStack
#push-options "--z3rlimit 256 --z3cliopt smt.arith.nl=false --initial_ifuel 8 --max_ifuel 8 --initial_fuel 2 --max_fuel 2"
#restart-solver
let valid_sum_intro
(h: HS.mem)
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: Lemma
(requires (
valid (parse_enum_key p (sum_enum t)) h input pos /\ (
let k = contents (parse_enum_key p (sum_enum t)) h input pos in
valid (dsnd (pc k)) h input (get_valid_pos (parse_enum_key p (sum_enum t)) h input pos)
)))
(ensures (
let k = contents (parse_enum_key p (sum_enum t)) h input pos in
let pos_payload = get_valid_pos (parse_enum_key p (sum_enum t)) h input pos in
valid_content_pos
(parse_sum t p pc) h input pos
(synth_sum_case t k (contents (dsnd (pc k)) h input pos_payload))
(get_valid_pos (dsnd (pc k)) h input pos_payload)
))
= valid_facts (parse_enum_key p (sum_enum t)) h input pos;
let k = contents (parse_enum_key p (sum_enum t)) h input pos in
let pos_payload = get_valid_pos (parse_enum_key p (sum_enum t)) h input pos in
valid_facts (dsnd (pc k)) h input pos_payload;
valid_facts (parse_sum t p pc) h input pos;
parse_sum_eq t p pc (bytes_of_slice_from h input pos)
#pop-options
inline_for_extraction
let finalize_sum_case
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(s: serializer p)
(w: leaf_writer_strong s)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(destr: enum_repr_of_key'_t (sum_enum t))
(k: sum_key t)
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: HST.Stack unit
(requires (fun h ->
let len_tag = serialized_length (serialize_enum_key _ s (sum_enum t)) k in
U32.v pos + len_tag < 4294967296 /\ (
let pos_payload = pos `U32.add` U32.uint_to_t len_tag in
valid (dsnd (pc k)) h input pos_payload /\
writable input.base (U32.v pos) (U32.v pos_payload) h
)))
(ensures (fun h _ h' ->
let len_tag = serialized_length (serialize_enum_key _ s (sum_enum t)) k in
let pos_payload = pos `U32.add` U32.uint_to_t len_tag in
B.modifies (loc_slice_from_to input pos pos_payload) h h' /\
valid_content_pos (parse_sum t p pc) h' input pos (synth_sum_case t k (contents (dsnd (pc k)) h input pos_payload)) (get_valid_pos (dsnd (pc k)) h input pos_payload)
))
= let pos1 = write_enum_key w (sum_enum t) destr k input pos in
let h = HST.get () in
[@inline_let]
let _ = valid_sum_intro h t p pc input pos in
()
inline_for_extraction
let jump_sum_cases_aux
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(vc: ((x: sum_key t) -> Tot (jumper (dsnd (pc x)))))
(k: sum_key t)
: Tot (jumper (parse_sum_cases t pc k))
= [@inline_let]
let _ = synth_sum_case_injective t k in
jump_synth
(jump_weaken
(weaken_parse_cases_kind t pc)
(vc k)
()
)
(synth_sum_case t k)
()
inline_for_extraction
let jump_sum_cases_t
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot Type
= jumper (parse_sum_cases t pc k)
let jump_sum_cases_t_eq
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
(x y : jump_sum_cases_t t pc k)
: GTot Type0
= True
inline_for_extraction
let jump_sum_cases_t_if
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (if_combinator _ (jump_sum_cases_t_eq t pc k))
= fun cond (sv_true: cond_true cond -> Tot (jump_sum_cases_t t pc k)) (sv_false: cond_false cond -> Tot (jump_sum_cases_t t pc k)) #rrel #rel input pos ->
if cond
then sv_true () input pos
else sv_false () input pos
inline_for_extraction
let jump_sum_cases
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(vc: ((x: sum_key t) -> Tot (jumper (dsnd (pc x)))))
(destr: dep_enum_destr (sum_enum t) (jump_sum_cases_t t pc))
(k: sum_key t)
: Tot (jumper (parse_sum_cases t pc k))
= destr
_
(jump_sum_cases_t_if t pc)
(fun _ _ -> ())
(fun _ _ _ _ -> ())
(jump_sum_cases_aux t pc vc)
k
inline_for_extraction
let jump_sum_aux_payload_t
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
: Tot Type
= (#rrel: _) -> (#rel: _) ->
(input: slice rrel rel) ->
(pos: U32.t) ->
HST.Stack U32.t
(requires (fun h -> live_slice h input /\ U32.v pos <= U32.v input.len /\ (
match k with
| Unknown _ -> False
| Known k' -> valid (dsnd (pc k')) h input pos
)))
(ensures (fun h res h' ->
B.modifies B.loc_none h h' /\ (
match k with
| Unknown _ -> False
| Known k' ->
valid_pos (dsnd (pc k')) h input pos res
)))
let jump_sum_aux_payload_eq
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
: Tot (jump_sum_aux_payload_t t pc k -> jump_sum_aux_payload_t t pc k -> GTot Type0)
= fun _ _ -> True
inline_for_extraction
let jump_sum_aux_payload_if'
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
(cond: bool)
(ift: ((cond_true cond) -> Tot (jump_sum_aux_payload_t t pc k)))
(iff: ((cond_false cond) -> Tot (jump_sum_aux_payload_t t pc k)))
: Tot (jump_sum_aux_payload_t t pc k)
= fun #rrel #rel input pos ->
if cond
then begin
(ift () <: jump_sum_aux_payload_t t pc k) input pos
end else
(iff () <: jump_sum_aux_payload_t t pc k) input pos
inline_for_extraction
let jump_sum_aux_payload_if
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
: Tot (if_combinator _ (jump_sum_aux_payload_eq t pc k))
= jump_sum_aux_payload_if' t pc k
let parse_sum_eq3
(#kt: parser_kind)
(t: sum)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(input: bytes)
(k' : sum_repr_type t)
(consumed_k: consumed_length input)
: Lemma
(requires (Some? (parse (parse_sum t p pc) input) /\ parse p input == Some (k', consumed_k)))
(ensures (
let input_k = Seq.slice input consumed_k (Seq.length input) in
let k = maybe_enum_key_of_repr (sum_enum t) k' in
begin match k with
| Known k ->
Some? (parse (dsnd (pc k)) input_k)
| _ -> False
end
))
= parse_sum_eq'' t p pc input
let parse_sum_eq4
(#kt: parser_kind)
(t: sum)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(input: bytes)
(k' : sum_repr_type t)
(consumed_k: consumed_length input)
(consumed_payload: nat)
: Lemma
(requires (Some? (parse (parse_sum t p pc) input) /\ parse p input == Some (k', consumed_k) /\ (
let input_k = Seq.slice input consumed_k (Seq.length input) in
let k = maybe_enum_key_of_repr (sum_enum t) k' in
begin match k with
| Known k ->
Some? (parse (dsnd (pc k)) input_k) /\ (
let Some (_, consumed_payload') = parse (dsnd (pc k)) input_k in
consumed_payload' == consumed_payload
)
| _ -> False
end
)))
(ensures (
let Some (_, consumed) = parse (parse_sum t p pc) input in
consumed == consumed_k + consumed_payload
))
= parse_sum_eq'' t p pc input
#push-options "--z3rlimit 16"
let valid_sum_elim
(h: HS.mem)
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(#rrel: _) (#rel: _)
(input: slice rrel rel)
(pos: U32.t)
: Lemma
(requires (
valid (parse_sum t p pc) h input pos
))
(ensures (
valid p h input pos /\ (
let pos_payload = get_valid_pos p h input pos in
let k' = maybe_enum_key_of_repr (sum_enum t) (contents p h input pos) in
match k' with
| Known k ->
k == sum_tag_of_data t (contents (parse_sum t p pc) h input pos) /\
valid (dsnd (pc k)) h input pos_payload /\
valid_pos
(parse_sum t p pc) h input pos
(get_valid_pos (dsnd (pc k)) h input pos_payload)
| _ -> False
)))
= let sinput = bytes_of_slice_from h input pos in
let _ = parse_sum_eq'' t p pc sinput in
[@inline_let]
let _ = valid_facts (parse_sum t p pc) h input pos in
let Some (k', consumed_k) = parse p sinput in
let pos_after_tag = U32.uint_to_t (U32.v pos + consumed_k) in
[@inline_let]
let _ = valid_facts p h input pos in
assert (valid_content_pos p h input pos k' pos_after_tag);
match maybe_enum_key_of_repr (sum_enum t) k' with
| Known k -> valid_facts (dsnd (pc k)) h input pos_after_tag
| _ -> ()
#pop-options
let valid_sum_elim_tag
(h: HS.mem)
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: Lemma
(requires (
valid (parse_sum t p pc) h input pos
))
(ensures (
valid (parse_enum_key p (sum_enum t)) h input pos /\
contents (parse_enum_key p (sum_enum t)) h input pos == sum_tag_of_data t (contents (parse_sum t p pc) h input pos)
))
= let _ = parse_sum_eq' t p pc (bytes_of_slice_from h input pos) in
let _ = valid_facts (parse_sum t p pc) h input pos in
let _ = valid_facts (parse_enum_key p (sum_enum t)) h input pos in
()
inline_for_extraction
let read_sum_tag
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(p32: leaf_reader p)
(destr: dep_maybe_enum_destr_t (sum_enum t) (read_enum_key_t (sum_enum t)))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: HST.Stack (sum_key t)
(requires (fun h ->
valid (parse_sum t p pc) h input pos
))
(ensures (fun h res h' ->
B.modifies B.loc_none h h' /\
res == sum_tag_of_data t (contents (parse_sum t p pc) h input pos)
))
= let h = HST.get () in
[@inline_let] let _ = valid_sum_elim_tag h t p pc input pos in
read_enum_key p32 (sum_enum t) destr input pos
inline_for_extraction
let jump_sum_aux
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(v: jumper p)
(p32: leaf_reader p)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(v_payload: ((k: sum_repr_type t)) -> Tot (jump_sum_aux_payload_t t pc (maybe_enum_key_of_repr (sum_enum t) k)))
: Tot (jumper (parse_sum t p pc))
= fun #rrel #rel input pos ->
let h = HST.get () in
[@inline_let]
let _ = valid_sum_elim h t p pc input pos in
let pos_after_tag = v input pos in
let k' = p32 input pos in
v_payload k' input pos_after_tag
inline_for_extraction
let jump_sum_aux_payload'
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (jumper (dsnd (pc x)))))
(k: maybe_enum_key (sum_enum t))
: Tot (jump_sum_aux_payload_t t pc k)
= fun #rrel #rel input pos ->
match k with
| Known k ->
[@inline_let]
let _ = synth_sum_case_injective t k in
pc32 k input pos
| _ -> 0ul // dummy, but we MUST NOT remove this branch, otherwise extraction fails
inline_for_extraction
let jump_sum_aux_payload
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (jumper (dsnd (pc x)))))
(destr: dep_maybe_enum_destr_t (sum_enum t) (jump_sum_aux_payload_t t pc))
(k: sum_repr_type t)
: Tot (jump_sum_aux_payload_t t pc (maybe_enum_key_of_repr (sum_enum t) k))
= destr (jump_sum_aux_payload_eq t pc) (jump_sum_aux_payload_if t pc) (fun _ _ -> ()) (fun _ _ _ _ -> ()) (jump_sum_aux_payload' t pc pc32) k
inline_for_extraction
let jump_sum
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(v: jumper p)
(p32: leaf_reader p)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (jumper (dsnd (pc x)))))
(destr: dep_maybe_enum_destr_t (sum_enum t) (jump_sum_aux_payload_t t pc))
: Tot (jumper (parse_sum t p pc))
= jump_sum_aux t v p32 pc (jump_sum_aux_payload t pc pc32 destr)
inline_for_extraction
let read_sum_cases'
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (leaf_reader (dsnd (pc x)))))
(k: sum_key t)
: Tot (leaf_reader (parse_sum_cases' t pc k))
= [@inline_let]
let _ = synth_sum_case_injective t k in
read_synth'
(dsnd (pc k))
(synth_sum_case t k)
(pc32 k)
()
inline_for_extraction
let read_sum_cases_t
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot Type
= leaf_reader (parse_sum_cases' t pc k)
let read_sum_cases_t_eq
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
(x y : read_sum_cases_t t pc k)
: GTot Type0
= True
inline_for_extraction
let read_sum_cases_t_if
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (if_combinator _ (read_sum_cases_t_eq t pc k))
= fun cond (sv_true: cond_true cond -> Tot (read_sum_cases_t t pc k)) (sv_false: cond_false cond -> Tot (read_sum_cases_t t pc k)) #_ #_ input pos ->
if cond
then (sv_true () input pos)
else (sv_false () input pos)
inline_for_extraction
let read_sum_cases
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (leaf_reader (dsnd (pc x)))))
(destr: dep_enum_destr (sum_enum t) (read_sum_cases_t t pc))
(k: sum_key t)
: Tot (leaf_reader (parse_sum_cases' t pc k))
= destr
_
(read_sum_cases_t_if t pc)
(fun _ _ -> ())
(fun _ _ _ _ -> ())
(read_sum_cases' t pc pc32)
k
#push-options "--z3rlimit 32"
inline_for_extraction
let read_sum
(#kt: parser_kind)
(t: sum)
(p: parser kt (sum_repr_type t))
(p32: leaf_reader (parse_enum_key p (sum_enum t)))
(j: jumper p)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (leaf_reader (dsnd (pc x)))))
(destr: dep_enum_destr (sum_enum t) (read_sum_cases_t t pc))
: Tot (leaf_reader (parse_sum t p pc))
=
fun #_ #_ input pos ->
let h = HST.get () in
valid_facts (parse_sum t p pc) h input pos;
parse_sum_eq' t p pc (bytes_of_slice_from h input pos);
valid_facts (parse_enum_key p (sum_enum t)) h input pos;
let k = p32 input pos in
let pos' = jump_enum_key j (sum_enum t) input pos in
valid_facts (parse_sum_cases' t pc k) h input pos' ;
read_sum_cases t pc pc32 destr k input pos'
#pop-options
inline_for_extraction
let serialize32_sum_cases_t
(t: sum)
(#pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(sc: ((x: sum_key t) -> Tot (serializer (dsnd (pc x)))))
(k: sum_key t)
: Tot Type
= serializer32 (serialize_sum_cases t pc sc k)
let serialize32_sum_cases_t_eq
(t: sum)
(#pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(sc: ((x: sum_key t) -> Tot (serializer (dsnd (pc x)))))
(k: sum_key t)
(x y: serialize32_sum_cases_t t sc k)
: GTot Type0
= True
inline_for_extraction
let serialize32_sum_cases_t_if
(t: sum)
(#pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(sc: ((x: sum_key t) -> Tot (serializer (dsnd (pc x)))))
(k: sum_key t)
: Tot (if_combinator _ (serialize32_sum_cases_t_eq t sc k))
= fun cond (sv_true: (cond_true cond -> Tot (serialize32_sum_cases_t t sc k))) (sv_false: (cond_false cond -> Tot (serialize32_sum_cases_t t sc k))) x #rrel #rel b pos ->
if cond
then (sv_true () x b pos)
else (sv_false () x b pos)
inline_for_extraction
let serialize32_sum_cases_aux
(t: sum)
(#pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(sc: ((x: sum_key t) -> Tot (serializer (dsnd (pc x)))))
(sc32: ((x: sum_key t) -> Tot (serializer32 (sc x))))
(k: sum_key t)
: Tot (serializer32 (serialize_sum_cases t pc sc k))
= fun x #rrel #rel b pos ->
[@inline_let] let _ =
Classical.forall_intro (parse_sum_cases_eq' t pc k);
synth_sum_case_injective t k;
synth_sum_case_inverse t k
in
serialize32_synth
(sc32 k)
(synth_sum_case t k)
(synth_sum_case_recip t k)
(fun x -> synth_sum_case_recip t k x)
()
x
b
pos | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"LowStar.Buffer.fst.checked",
"LowParse.Spec.Sum.fst.checked",
"LowParse.Low.Enum.fst.checked",
"FStar.UInt64.fsti.checked",
"FStar.UInt32.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Int.Cast.fst.checked",
"FStar.HyperStack.ST.fsti.checked",
"FStar.HyperStack.fst.checked",
"FStar.Classical.fsti.checked"
],
"interface_file": false,
"source_file": "LowParse.Low.Sum.fst"
} | [
{
"abbrev": true,
"full_module": "FStar.HyperStack",
"short_module": "HS"
},
{
"abbrev": true,
"full_module": "FStar.UInt64",
"short_module": "U64"
},
{
"abbrev": true,
"full_module": "FStar.Int.Cast",
"short_module": "Cast"
},
{
"abbrev": true,
"full_module": "LowStar.Buffer",
"short_module": "B"
},
{
"abbrev": true,
"full_module": "FStar.HyperStack.ST",
"short_module": "HST"
},
{
"abbrev": true,
"full_module": "FStar.UInt32",
"short_module": "U32"
},
{
"abbrev": false,
"full_module": "LowParse.Spec.Sum",
"short_module": null
},
{
"abbrev": false,
"full_module": "LowParse.Low.Enum",
"short_module": null
},
{
"abbrev": false,
"full_module": "LowParse.Low",
"short_module": null
},
{
"abbrev": false,
"full_module": "LowParse.Low",
"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",
"short_module": null
}
] | {
"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_elim_box": false,
"smtencoding_l_arith_repr": "boxwrap",
"smtencoding_nl_arith_repr": "boxwrap",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": true,
"z3cliopt": [],
"z3refresh": false,
"z3rlimit": 5,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | false |
t: LowParse.Spec.Sum.sum ->
sc:
(x: LowParse.Spec.Sum.sum_key t
-> LowParse.Spec.Base.serializer (FStar.Pervasives.dsnd (pc x))) ->
sc32: (x: LowParse.Spec.Sum.sum_key t -> LowParse.Low.Base.serializer32 (sc x)) ->
destr:
LowParse.Spec.Enum.dep_enum_destr (LowParse.Spec.Sum.sum_enum t)
(LowParse.Low.Sum.serialize32_sum_cases_t t sc) ->
k: LowParse.Spec.Sum.sum_key t
-> LowParse.Low.Base.serializer32 (LowParse.Spec.Sum.serialize_sum_cases t pc sc k) | Prims.Tot | [
"total"
] | [] | [
"LowParse.Spec.Sum.sum",
"LowParse.Spec.Sum.sum_key",
"Prims.dtuple2",
"LowParse.Spec.Base.parser_kind",
"LowParse.Spec.Base.parser",
"LowParse.Spec.Sum.sum_type_of_tag",
"LowParse.Spec.Base.serializer",
"Prims.__proj__Mkdtuple2__item___1",
"FStar.Pervasives.dsnd",
"LowParse.Low.Base.serializer32",
"LowParse.Spec.Enum.dep_enum_destr",
"LowParse.Spec.Sum.sum_key_type",
"LowParse.Spec.Sum.sum_repr_type",
"LowParse.Spec.Sum.sum_enum",
"LowParse.Low.Sum.serialize32_sum_cases_t",
"LowParse.Low.Sum.serialize32_sum_cases_t_eq",
"LowParse.Low.Sum.serialize32_sum_cases_t_if",
"LowParse.Spec.Enum.enum_key",
"Prims.unit",
"LowParse.Low.Sum.serialize32_sum_cases_aux",
"LowParse.Spec.Sum.weaken_parse_cases_kind",
"LowParse.Spec.Sum.sum_cases",
"LowParse.Spec.Sum.parse_sum_cases",
"LowParse.Spec.Sum.serialize_sum_cases"
] | [] | false | false | false | false | false | let serialize32_sum_cases
(t: sum)
(#pc: (x: sum_key t -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(sc: (x: sum_key t -> Tot (serializer (dsnd (pc x)))))
(sc32: (x: sum_key t -> Tot (serializer32 (sc x))))
(destr: dep_enum_destr (sum_enum t) (serialize32_sum_cases_t t sc))
(k: sum_key t)
: Tot (serializer32 (serialize_sum_cases t pc sc k)) =
| destr _
(serialize32_sum_cases_t_if t sc)
(fun _ _ -> ())
(fun _ _ _ _ -> ())
(serialize32_sum_cases_aux t sc sc32)
k | false |
LowParse.Low.Sum.fst | LowParse.Low.Sum.clens_sum_payload | val clens_sum_payload (s: sum) (k: sum_key s) : Tot (clens (sum_type s) (sum_type_of_tag s k)) | val clens_sum_payload (s: sum) (k: sum_key s) : Tot (clens (sum_type s) (sum_type_of_tag s k)) | let clens_sum_payload
(s: sum)
(k: sum_key s)
: Tot (clens (sum_type s) (sum_type_of_tag s k))
= {
clens_cond = (fun (x: sum_type s) -> sum_tag_of_data s x == k);
clens_get = (fun (x: sum_type s) -> synth_sum_case_recip s k x <: Ghost (sum_type_of_tag s k) (requires (sum_tag_of_data s x == k)) (ensures (fun _ -> True)));
} | {
"file_name": "src/lowparse/LowParse.Low.Sum.fst",
"git_rev": "00217c4a89f5ba56002ba9aa5b4a9d5903bfe9fa",
"git_url": "https://github.com/project-everest/everparse.git",
"project_name": "everparse"
} | {
"end_col": 3,
"end_line": 792,
"start_col": 0,
"start_line": 785
} | module LowParse.Low.Sum
include LowParse.Low.Enum
include LowParse.Spec.Sum
module U32 = FStar.UInt32
module HST = FStar.HyperStack.ST
module B = LowStar.Buffer
module Cast = FStar.Int.Cast
module U64 = FStar.UInt64
inline_for_extraction
let validate_sum_cases_aux
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(vc: ((x: sum_key t) -> Tot (validator (dsnd (pc x)))))
(k: sum_key t)
: Tot (validator (parse_sum_cases t pc k))
= [@inline_let]
let _ = synth_sum_case_injective t k in
validate_synth
(validate_weaken
(weaken_parse_cases_kind t pc)
(vc k)
()
)
(synth_sum_case t k)
()
inline_for_extraction
let validate_sum_cases_t
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot Type
= validator (parse_sum_cases t pc k)
let validate_sum_cases_t_eq
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
(x y : validate_sum_cases_t t pc k)
: GTot Type0
= True
inline_for_extraction
let validate_sum_cases_t_if
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (if_combinator _ (validate_sum_cases_t_eq t pc k))
= fun cond (sv_true: cond_true cond -> Tot (validate_sum_cases_t t pc k)) (sv_false: cond_false cond -> Tot (validate_sum_cases_t t pc k)) #rrel #rel input pos ->
if cond
then sv_true () input pos
else sv_false () input pos
inline_for_extraction
let validate_sum_cases
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(vc: ((x: sum_key t) -> Tot (validator (dsnd (pc x)))))
(destr: dep_enum_destr (sum_enum t) (validate_sum_cases_t t pc))
(k: sum_key t)
: Tot (validator (parse_sum_cases t pc k))
= destr
_
(validate_sum_cases_t_if t pc)
(fun _ _ -> ())
(fun _ _ _ _ -> ())
(validate_sum_cases_aux t pc vc)
k
inline_for_extraction
let validate_sum_aux_payload_t
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
: Tot Type
= (#rrel: _) -> (#rel: _) ->
(input: slice rrel rel) ->
(pos: U64.t) ->
HST.Stack U64.t
(requires (fun h -> live_slice h input /\ U64.v pos <= U32.v input.len))
(ensures (fun h res h' ->
B.modifies B.loc_none h h' /\ (
match k with
| Unknown _ -> is_error res
| Known k' ->
if is_success res
then
valid_pos (dsnd (pc k')) h input (uint64_to_uint32 pos) (uint64_to_uint32 res)
else
(~ (valid (dsnd (pc k')) h input (uint64_to_uint32 pos)))
)))
let validate_sum_aux_payload_eq
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
: Tot (validate_sum_aux_payload_t t pc k -> validate_sum_aux_payload_t t pc k -> GTot Type0)
= fun _ _ -> True
inline_for_extraction
let validate_sum_aux_payload_if'
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
(cond: bool)
(ift: ((cond_true cond) -> Tot (validate_sum_aux_payload_t t pc k)))
(iff: ((cond_false cond) -> Tot (validate_sum_aux_payload_t t pc k)))
: Tot (validate_sum_aux_payload_t t pc k)
= fun #rrel #rel input pos ->
if cond
then begin
(ift () <: validate_sum_aux_payload_t t pc k) input pos
end else
(iff () <: validate_sum_aux_payload_t t pc k) input pos
inline_for_extraction
let validate_sum_aux_payload_if
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
: Tot (if_combinator _ (validate_sum_aux_payload_eq t pc k))
= validate_sum_aux_payload_if' t pc k
#push-options "--z3rlimit 64 --z3cliopt smt.arith.nl=false --using_facts_from '* -FStar.Int.Cast -LowParse.BitFields'"
// --query_stats --smtencoding.elim_box true --smtencoding.l_arith_repr native --z3refresh"
inline_for_extraction
let validate_sum_aux
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(v: validator p)
(p32: leaf_reader p)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(v_payload: ((k: sum_repr_type t)) -> Tot (validate_sum_aux_payload_t t pc (maybe_enum_key_of_repr (sum_enum t) k)))
: Tot (validator (parse_sum t p pc))
= fun #rrel #rel input pos ->
let h = HST.get () in
[@inline_let]
let _ = parse_sum_eq'' t p pc (bytes_of_slice_from h input (uint64_to_uint32 pos)) in
[@inline_let]
let _ = valid_facts (parse_sum t p pc) h input (uint64_to_uint32 pos) in
[@inline_let]
let _ = valid_facts p h input (uint64_to_uint32 pos) in
let len_after_tag = v input pos in
if is_error len_after_tag
then len_after_tag
else begin
let h1 = HST.get () in
let k' = p32 input (uint64_to_uint32 pos) in
[@inline_let]
let _ =
match maybe_enum_key_of_repr (sum_enum t) k' with
| Known k -> valid_facts (dsnd (pc k)) h input (uint64_to_uint32 len_after_tag)
| _ -> ()
in
v_payload k' input len_after_tag
end
#pop-options
inline_for_extraction
let validate_sum_aux_payload'
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (validator (dsnd (pc x)))))
(k: maybe_enum_key (sum_enum t))
: Tot (validate_sum_aux_payload_t t pc k)
= fun #rrel #rel input pos ->
match k with
| Known k ->
[@inline_let]
let _ = synth_sum_case_injective t k in
pc32 k input pos
// validate_synth (pc32 k) (synth_sum_case t k) () input pos
| _ -> validator_error_generic
inline_for_extraction
let validate_sum_aux_payload
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (validator (dsnd (pc x)))))
(destr: dep_maybe_enum_destr_t (sum_enum t) (validate_sum_aux_payload_t t pc))
(k: sum_repr_type t)
: Tot (validate_sum_aux_payload_t t pc (maybe_enum_key_of_repr (sum_enum t) k))
= destr (validate_sum_aux_payload_eq t pc) (validate_sum_aux_payload_if t pc) (fun _ _ -> ()) (fun _ _ _ _ -> ()) (validate_sum_aux_payload' t pc pc32) k
inline_for_extraction
let validate_sum
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(v: validator p)
(p32: leaf_reader p)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (validator (dsnd (pc x)))))
(destr: dep_maybe_enum_destr_t (sum_enum t) (validate_sum_aux_payload_t t pc))
: Tot (validator (parse_sum t p pc))
= validate_sum_aux t v p32 pc (validate_sum_aux_payload t pc pc32 destr)
module HS = FStar.HyperStack
#push-options "--z3rlimit 256 --z3cliopt smt.arith.nl=false --initial_ifuel 8 --max_ifuel 8 --initial_fuel 2 --max_fuel 2"
#restart-solver
let valid_sum_intro
(h: HS.mem)
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: Lemma
(requires (
valid (parse_enum_key p (sum_enum t)) h input pos /\ (
let k = contents (parse_enum_key p (sum_enum t)) h input pos in
valid (dsnd (pc k)) h input (get_valid_pos (parse_enum_key p (sum_enum t)) h input pos)
)))
(ensures (
let k = contents (parse_enum_key p (sum_enum t)) h input pos in
let pos_payload = get_valid_pos (parse_enum_key p (sum_enum t)) h input pos in
valid_content_pos
(parse_sum t p pc) h input pos
(synth_sum_case t k (contents (dsnd (pc k)) h input pos_payload))
(get_valid_pos (dsnd (pc k)) h input pos_payload)
))
= valid_facts (parse_enum_key p (sum_enum t)) h input pos;
let k = contents (parse_enum_key p (sum_enum t)) h input pos in
let pos_payload = get_valid_pos (parse_enum_key p (sum_enum t)) h input pos in
valid_facts (dsnd (pc k)) h input pos_payload;
valid_facts (parse_sum t p pc) h input pos;
parse_sum_eq t p pc (bytes_of_slice_from h input pos)
#pop-options
inline_for_extraction
let finalize_sum_case
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(s: serializer p)
(w: leaf_writer_strong s)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(destr: enum_repr_of_key'_t (sum_enum t))
(k: sum_key t)
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: HST.Stack unit
(requires (fun h ->
let len_tag = serialized_length (serialize_enum_key _ s (sum_enum t)) k in
U32.v pos + len_tag < 4294967296 /\ (
let pos_payload = pos `U32.add` U32.uint_to_t len_tag in
valid (dsnd (pc k)) h input pos_payload /\
writable input.base (U32.v pos) (U32.v pos_payload) h
)))
(ensures (fun h _ h' ->
let len_tag = serialized_length (serialize_enum_key _ s (sum_enum t)) k in
let pos_payload = pos `U32.add` U32.uint_to_t len_tag in
B.modifies (loc_slice_from_to input pos pos_payload) h h' /\
valid_content_pos (parse_sum t p pc) h' input pos (synth_sum_case t k (contents (dsnd (pc k)) h input pos_payload)) (get_valid_pos (dsnd (pc k)) h input pos_payload)
))
= let pos1 = write_enum_key w (sum_enum t) destr k input pos in
let h = HST.get () in
[@inline_let]
let _ = valid_sum_intro h t p pc input pos in
()
inline_for_extraction
let jump_sum_cases_aux
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(vc: ((x: sum_key t) -> Tot (jumper (dsnd (pc x)))))
(k: sum_key t)
: Tot (jumper (parse_sum_cases t pc k))
= [@inline_let]
let _ = synth_sum_case_injective t k in
jump_synth
(jump_weaken
(weaken_parse_cases_kind t pc)
(vc k)
()
)
(synth_sum_case t k)
()
inline_for_extraction
let jump_sum_cases_t
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot Type
= jumper (parse_sum_cases t pc k)
let jump_sum_cases_t_eq
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
(x y : jump_sum_cases_t t pc k)
: GTot Type0
= True
inline_for_extraction
let jump_sum_cases_t_if
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (if_combinator _ (jump_sum_cases_t_eq t pc k))
= fun cond (sv_true: cond_true cond -> Tot (jump_sum_cases_t t pc k)) (sv_false: cond_false cond -> Tot (jump_sum_cases_t t pc k)) #rrel #rel input pos ->
if cond
then sv_true () input pos
else sv_false () input pos
inline_for_extraction
let jump_sum_cases
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(vc: ((x: sum_key t) -> Tot (jumper (dsnd (pc x)))))
(destr: dep_enum_destr (sum_enum t) (jump_sum_cases_t t pc))
(k: sum_key t)
: Tot (jumper (parse_sum_cases t pc k))
= destr
_
(jump_sum_cases_t_if t pc)
(fun _ _ -> ())
(fun _ _ _ _ -> ())
(jump_sum_cases_aux t pc vc)
k
inline_for_extraction
let jump_sum_aux_payload_t
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
: Tot Type
= (#rrel: _) -> (#rel: _) ->
(input: slice rrel rel) ->
(pos: U32.t) ->
HST.Stack U32.t
(requires (fun h -> live_slice h input /\ U32.v pos <= U32.v input.len /\ (
match k with
| Unknown _ -> False
| Known k' -> valid (dsnd (pc k')) h input pos
)))
(ensures (fun h res h' ->
B.modifies B.loc_none h h' /\ (
match k with
| Unknown _ -> False
| Known k' ->
valid_pos (dsnd (pc k')) h input pos res
)))
let jump_sum_aux_payload_eq
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
: Tot (jump_sum_aux_payload_t t pc k -> jump_sum_aux_payload_t t pc k -> GTot Type0)
= fun _ _ -> True
inline_for_extraction
let jump_sum_aux_payload_if'
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
(cond: bool)
(ift: ((cond_true cond) -> Tot (jump_sum_aux_payload_t t pc k)))
(iff: ((cond_false cond) -> Tot (jump_sum_aux_payload_t t pc k)))
: Tot (jump_sum_aux_payload_t t pc k)
= fun #rrel #rel input pos ->
if cond
then begin
(ift () <: jump_sum_aux_payload_t t pc k) input pos
end else
(iff () <: jump_sum_aux_payload_t t pc k) input pos
inline_for_extraction
let jump_sum_aux_payload_if
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
: Tot (if_combinator _ (jump_sum_aux_payload_eq t pc k))
= jump_sum_aux_payload_if' t pc k
let parse_sum_eq3
(#kt: parser_kind)
(t: sum)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(input: bytes)
(k' : sum_repr_type t)
(consumed_k: consumed_length input)
: Lemma
(requires (Some? (parse (parse_sum t p pc) input) /\ parse p input == Some (k', consumed_k)))
(ensures (
let input_k = Seq.slice input consumed_k (Seq.length input) in
let k = maybe_enum_key_of_repr (sum_enum t) k' in
begin match k with
| Known k ->
Some? (parse (dsnd (pc k)) input_k)
| _ -> False
end
))
= parse_sum_eq'' t p pc input
let parse_sum_eq4
(#kt: parser_kind)
(t: sum)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(input: bytes)
(k' : sum_repr_type t)
(consumed_k: consumed_length input)
(consumed_payload: nat)
: Lemma
(requires (Some? (parse (parse_sum t p pc) input) /\ parse p input == Some (k', consumed_k) /\ (
let input_k = Seq.slice input consumed_k (Seq.length input) in
let k = maybe_enum_key_of_repr (sum_enum t) k' in
begin match k with
| Known k ->
Some? (parse (dsnd (pc k)) input_k) /\ (
let Some (_, consumed_payload') = parse (dsnd (pc k)) input_k in
consumed_payload' == consumed_payload
)
| _ -> False
end
)))
(ensures (
let Some (_, consumed) = parse (parse_sum t p pc) input in
consumed == consumed_k + consumed_payload
))
= parse_sum_eq'' t p pc input
#push-options "--z3rlimit 16"
let valid_sum_elim
(h: HS.mem)
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(#rrel: _) (#rel: _)
(input: slice rrel rel)
(pos: U32.t)
: Lemma
(requires (
valid (parse_sum t p pc) h input pos
))
(ensures (
valid p h input pos /\ (
let pos_payload = get_valid_pos p h input pos in
let k' = maybe_enum_key_of_repr (sum_enum t) (contents p h input pos) in
match k' with
| Known k ->
k == sum_tag_of_data t (contents (parse_sum t p pc) h input pos) /\
valid (dsnd (pc k)) h input pos_payload /\
valid_pos
(parse_sum t p pc) h input pos
(get_valid_pos (dsnd (pc k)) h input pos_payload)
| _ -> False
)))
= let sinput = bytes_of_slice_from h input pos in
let _ = parse_sum_eq'' t p pc sinput in
[@inline_let]
let _ = valid_facts (parse_sum t p pc) h input pos in
let Some (k', consumed_k) = parse p sinput in
let pos_after_tag = U32.uint_to_t (U32.v pos + consumed_k) in
[@inline_let]
let _ = valid_facts p h input pos in
assert (valid_content_pos p h input pos k' pos_after_tag);
match maybe_enum_key_of_repr (sum_enum t) k' with
| Known k -> valid_facts (dsnd (pc k)) h input pos_after_tag
| _ -> ()
#pop-options
let valid_sum_elim_tag
(h: HS.mem)
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: Lemma
(requires (
valid (parse_sum t p pc) h input pos
))
(ensures (
valid (parse_enum_key p (sum_enum t)) h input pos /\
contents (parse_enum_key p (sum_enum t)) h input pos == sum_tag_of_data t (contents (parse_sum t p pc) h input pos)
))
= let _ = parse_sum_eq' t p pc (bytes_of_slice_from h input pos) in
let _ = valid_facts (parse_sum t p pc) h input pos in
let _ = valid_facts (parse_enum_key p (sum_enum t)) h input pos in
()
inline_for_extraction
let read_sum_tag
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(p32: leaf_reader p)
(destr: dep_maybe_enum_destr_t (sum_enum t) (read_enum_key_t (sum_enum t)))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: HST.Stack (sum_key t)
(requires (fun h ->
valid (parse_sum t p pc) h input pos
))
(ensures (fun h res h' ->
B.modifies B.loc_none h h' /\
res == sum_tag_of_data t (contents (parse_sum t p pc) h input pos)
))
= let h = HST.get () in
[@inline_let] let _ = valid_sum_elim_tag h t p pc input pos in
read_enum_key p32 (sum_enum t) destr input pos
inline_for_extraction
let jump_sum_aux
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(v: jumper p)
(p32: leaf_reader p)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(v_payload: ((k: sum_repr_type t)) -> Tot (jump_sum_aux_payload_t t pc (maybe_enum_key_of_repr (sum_enum t) k)))
: Tot (jumper (parse_sum t p pc))
= fun #rrel #rel input pos ->
let h = HST.get () in
[@inline_let]
let _ = valid_sum_elim h t p pc input pos in
let pos_after_tag = v input pos in
let k' = p32 input pos in
v_payload k' input pos_after_tag
inline_for_extraction
let jump_sum_aux_payload'
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (jumper (dsnd (pc x)))))
(k: maybe_enum_key (sum_enum t))
: Tot (jump_sum_aux_payload_t t pc k)
= fun #rrel #rel input pos ->
match k with
| Known k ->
[@inline_let]
let _ = synth_sum_case_injective t k in
pc32 k input pos
| _ -> 0ul // dummy, but we MUST NOT remove this branch, otherwise extraction fails
inline_for_extraction
let jump_sum_aux_payload
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (jumper (dsnd (pc x)))))
(destr: dep_maybe_enum_destr_t (sum_enum t) (jump_sum_aux_payload_t t pc))
(k: sum_repr_type t)
: Tot (jump_sum_aux_payload_t t pc (maybe_enum_key_of_repr (sum_enum t) k))
= destr (jump_sum_aux_payload_eq t pc) (jump_sum_aux_payload_if t pc) (fun _ _ -> ()) (fun _ _ _ _ -> ()) (jump_sum_aux_payload' t pc pc32) k
inline_for_extraction
let jump_sum
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(v: jumper p)
(p32: leaf_reader p)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (jumper (dsnd (pc x)))))
(destr: dep_maybe_enum_destr_t (sum_enum t) (jump_sum_aux_payload_t t pc))
: Tot (jumper (parse_sum t p pc))
= jump_sum_aux t v p32 pc (jump_sum_aux_payload t pc pc32 destr)
inline_for_extraction
let read_sum_cases'
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (leaf_reader (dsnd (pc x)))))
(k: sum_key t)
: Tot (leaf_reader (parse_sum_cases' t pc k))
= [@inline_let]
let _ = synth_sum_case_injective t k in
read_synth'
(dsnd (pc k))
(synth_sum_case t k)
(pc32 k)
()
inline_for_extraction
let read_sum_cases_t
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot Type
= leaf_reader (parse_sum_cases' t pc k)
let read_sum_cases_t_eq
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
(x y : read_sum_cases_t t pc k)
: GTot Type0
= True
inline_for_extraction
let read_sum_cases_t_if
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (if_combinator _ (read_sum_cases_t_eq t pc k))
= fun cond (sv_true: cond_true cond -> Tot (read_sum_cases_t t pc k)) (sv_false: cond_false cond -> Tot (read_sum_cases_t t pc k)) #_ #_ input pos ->
if cond
then (sv_true () input pos)
else (sv_false () input pos)
inline_for_extraction
let read_sum_cases
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (leaf_reader (dsnd (pc x)))))
(destr: dep_enum_destr (sum_enum t) (read_sum_cases_t t pc))
(k: sum_key t)
: Tot (leaf_reader (parse_sum_cases' t pc k))
= destr
_
(read_sum_cases_t_if t pc)
(fun _ _ -> ())
(fun _ _ _ _ -> ())
(read_sum_cases' t pc pc32)
k
#push-options "--z3rlimit 32"
inline_for_extraction
let read_sum
(#kt: parser_kind)
(t: sum)
(p: parser kt (sum_repr_type t))
(p32: leaf_reader (parse_enum_key p (sum_enum t)))
(j: jumper p)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (leaf_reader (dsnd (pc x)))))
(destr: dep_enum_destr (sum_enum t) (read_sum_cases_t t pc))
: Tot (leaf_reader (parse_sum t p pc))
=
fun #_ #_ input pos ->
let h = HST.get () in
valid_facts (parse_sum t p pc) h input pos;
parse_sum_eq' t p pc (bytes_of_slice_from h input pos);
valid_facts (parse_enum_key p (sum_enum t)) h input pos;
let k = p32 input pos in
let pos' = jump_enum_key j (sum_enum t) input pos in
valid_facts (parse_sum_cases' t pc k) h input pos' ;
read_sum_cases t pc pc32 destr k input pos'
#pop-options
inline_for_extraction
let serialize32_sum_cases_t
(t: sum)
(#pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(sc: ((x: sum_key t) -> Tot (serializer (dsnd (pc x)))))
(k: sum_key t)
: Tot Type
= serializer32 (serialize_sum_cases t pc sc k)
let serialize32_sum_cases_t_eq
(t: sum)
(#pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(sc: ((x: sum_key t) -> Tot (serializer (dsnd (pc x)))))
(k: sum_key t)
(x y: serialize32_sum_cases_t t sc k)
: GTot Type0
= True
inline_for_extraction
let serialize32_sum_cases_t_if
(t: sum)
(#pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(sc: ((x: sum_key t) -> Tot (serializer (dsnd (pc x)))))
(k: sum_key t)
: Tot (if_combinator _ (serialize32_sum_cases_t_eq t sc k))
= fun cond (sv_true: (cond_true cond -> Tot (serialize32_sum_cases_t t sc k))) (sv_false: (cond_false cond -> Tot (serialize32_sum_cases_t t sc k))) x #rrel #rel b pos ->
if cond
then (sv_true () x b pos)
else (sv_false () x b pos)
inline_for_extraction
let serialize32_sum_cases_aux
(t: sum)
(#pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(sc: ((x: sum_key t) -> Tot (serializer (dsnd (pc x)))))
(sc32: ((x: sum_key t) -> Tot (serializer32 (sc x))))
(k: sum_key t)
: Tot (serializer32 (serialize_sum_cases t pc sc k))
= fun x #rrel #rel b pos ->
[@inline_let] let _ =
Classical.forall_intro (parse_sum_cases_eq' t pc k);
synth_sum_case_injective t k;
synth_sum_case_inverse t k
in
serialize32_synth
(sc32 k)
(synth_sum_case t k)
(synth_sum_case_recip t k)
(fun x -> synth_sum_case_recip t k x)
()
x
b
pos
inline_for_extraction
let serialize32_sum_cases
(t: sum)
(#pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(sc: ((x: sum_key t) -> Tot (serializer (dsnd (pc x)))))
(sc32: ((x: sum_key t) -> Tot (serializer32 (sc x))))
(destr: dep_enum_destr (sum_enum t) (serialize32_sum_cases_t t sc))
(k: sum_key t)
: Tot (serializer32 (serialize_sum_cases t pc sc k))
= destr
_
(serialize32_sum_cases_t_if t sc)
(fun _ _ -> ())
(fun _ _ _ _ -> ())
(serialize32_sum_cases_aux t sc sc32)
k
inline_for_extraction
let serialize32_sum
(#kt: parser_kind)
(t: sum)
(#p: parser kt (sum_repr_type t))
(s: serializer p {kt.parser_kind_subkind == Some ParserStrong})
(s32: serializer32 (serialize_enum_key _ s (sum_enum t)))
(#pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(sc: ((x: sum_key t) -> Tot (serializer (dsnd (pc x)))))
(sc32: ((x: sum_key t) -> Tot (serializer32 (sc x))))
(destr: dep_enum_destr (sum_enum t) (serialize32_sum_cases_t t sc))
: Tot (serializer32 (serialize_sum t s sc))
= fun x #rrel #rel b pos ->
serialize_sum_eq t s sc x;
let tg = sum_tag_of_data t x in
serialize32_nondep_then_aux s32 (serialize32_sum_cases t sc sc32 destr tg) tg x b pos
let clens_sum_tag
(s: sum)
: Tot (clens (sum_type s) (sum_key s))
= {
clens_cond = (fun _ -> True);
clens_get = sum_tag_of_data s;
}
let gaccessor_sum_tag
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
: Tot (gaccessor (parse_sum t p pc) (parse_enum_key p (sum_enum t)) (clens_sum_tag t))
= gaccessor_tagged_union_tag
(parse_enum_key p (sum_enum t))
(sum_tag_of_data t)
(parse_sum_cases t pc)
inline_for_extraction
let accessor_sum_tag
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
: Tot (accessor (gaccessor_sum_tag t p pc))
= accessor_tagged_union_tag
(parse_enum_key p (sum_enum t))
(sum_tag_of_data t)
(parse_sum_cases t pc) | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"LowStar.Buffer.fst.checked",
"LowParse.Spec.Sum.fst.checked",
"LowParse.Low.Enum.fst.checked",
"FStar.UInt64.fsti.checked",
"FStar.UInt32.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Int.Cast.fst.checked",
"FStar.HyperStack.ST.fsti.checked",
"FStar.HyperStack.fst.checked",
"FStar.Classical.fsti.checked"
],
"interface_file": false,
"source_file": "LowParse.Low.Sum.fst"
} | [
{
"abbrev": true,
"full_module": "FStar.HyperStack",
"short_module": "HS"
},
{
"abbrev": true,
"full_module": "FStar.UInt64",
"short_module": "U64"
},
{
"abbrev": true,
"full_module": "FStar.Int.Cast",
"short_module": "Cast"
},
{
"abbrev": true,
"full_module": "LowStar.Buffer",
"short_module": "B"
},
{
"abbrev": true,
"full_module": "FStar.HyperStack.ST",
"short_module": "HST"
},
{
"abbrev": true,
"full_module": "FStar.UInt32",
"short_module": "U32"
},
{
"abbrev": false,
"full_module": "LowParse.Spec.Sum",
"short_module": null
},
{
"abbrev": false,
"full_module": "LowParse.Low.Enum",
"short_module": null
},
{
"abbrev": false,
"full_module": "LowParse.Low",
"short_module": null
},
{
"abbrev": false,
"full_module": "LowParse.Low",
"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",
"short_module": null
}
] | {
"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_elim_box": false,
"smtencoding_l_arith_repr": "boxwrap",
"smtencoding_nl_arith_repr": "boxwrap",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": true,
"z3cliopt": [],
"z3refresh": false,
"z3rlimit": 5,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | false | s: LowParse.Spec.Sum.sum -> k: LowParse.Spec.Sum.sum_key s
-> LowParse.Low.Base.Spec.clens (LowParse.Spec.Sum.sum_type s)
(LowParse.Spec.Sum.sum_type_of_tag s k) | Prims.Tot | [
"total"
] | [] | [
"LowParse.Spec.Sum.sum",
"LowParse.Spec.Sum.sum_key",
"LowParse.Low.Base.Spec.Mkclens",
"LowParse.Spec.Sum.sum_type",
"LowParse.Spec.Sum.sum_type_of_tag",
"Prims.eq2",
"LowParse.Spec.Sum.sum_tag_of_data",
"LowParse.Spec.Sum.synth_sum_case_recip",
"Prims.l_True",
"LowParse.Low.Base.Spec.clens"
] | [] | false | false | false | false | false | let clens_sum_payload (s: sum) (k: sum_key s) : Tot (clens (sum_type s) (sum_type_of_tag s k)) =
| {
clens_cond = (fun (x: sum_type s) -> sum_tag_of_data s x == k);
clens_get
=
(fun (x: sum_type s) ->
synth_sum_case_recip s k x
<:
Ghost (sum_type_of_tag s k) (requires (sum_tag_of_data s x == k)) (ensures (fun _ -> True)))
} | false |
LowParse.Low.Sum.fst | LowParse.Low.Sum.gaccessor_clens_sum_payload | val gaccessor_clens_sum_payload
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: (x: sum_key t -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (gaccessor (parse_sum t p pc) (dsnd (pc k)) (clens_sum_payload t k)) | val gaccessor_clens_sum_payload
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: (x: sum_key t -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (gaccessor (parse_sum t p pc) (dsnd (pc k)) (clens_sum_payload t k)) | let gaccessor_clens_sum_payload
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (gaccessor (parse_sum t p pc) (dsnd (pc k)) (clens_sum_payload t k))
= Classical.forall_intro_2 (fun x -> Classical.move_requires (gaccessor_clens_sum_payload_injective t p pc k x));
Classical.forall_intro_2 (fun x -> Classical.move_requires (gaccessor_clens_sum_payload_no_lookahead t p pc k x));
gaccessor_prop_equiv (parse_sum t p pc) (dsnd (pc k)) (clens_sum_payload t k) (gaccessor_clens_sum_payload' t p pc k);
gaccessor_clens_sum_payload' t p pc k | {
"file_name": "src/lowparse/LowParse.Low.Sum.fst",
"git_rev": "00217c4a89f5ba56002ba9aa5b4a9d5903bfe9fa",
"git_url": "https://github.com/project-everest/everparse.git",
"project_name": "everparse"
} | {
"end_col": 39,
"end_line": 869,
"start_col": 0,
"start_line": 859
} | module LowParse.Low.Sum
include LowParse.Low.Enum
include LowParse.Spec.Sum
module U32 = FStar.UInt32
module HST = FStar.HyperStack.ST
module B = LowStar.Buffer
module Cast = FStar.Int.Cast
module U64 = FStar.UInt64
inline_for_extraction
let validate_sum_cases_aux
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(vc: ((x: sum_key t) -> Tot (validator (dsnd (pc x)))))
(k: sum_key t)
: Tot (validator (parse_sum_cases t pc k))
= [@inline_let]
let _ = synth_sum_case_injective t k in
validate_synth
(validate_weaken
(weaken_parse_cases_kind t pc)
(vc k)
()
)
(synth_sum_case t k)
()
inline_for_extraction
let validate_sum_cases_t
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot Type
= validator (parse_sum_cases t pc k)
let validate_sum_cases_t_eq
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
(x y : validate_sum_cases_t t pc k)
: GTot Type0
= True
inline_for_extraction
let validate_sum_cases_t_if
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (if_combinator _ (validate_sum_cases_t_eq t pc k))
= fun cond (sv_true: cond_true cond -> Tot (validate_sum_cases_t t pc k)) (sv_false: cond_false cond -> Tot (validate_sum_cases_t t pc k)) #rrel #rel input pos ->
if cond
then sv_true () input pos
else sv_false () input pos
inline_for_extraction
let validate_sum_cases
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(vc: ((x: sum_key t) -> Tot (validator (dsnd (pc x)))))
(destr: dep_enum_destr (sum_enum t) (validate_sum_cases_t t pc))
(k: sum_key t)
: Tot (validator (parse_sum_cases t pc k))
= destr
_
(validate_sum_cases_t_if t pc)
(fun _ _ -> ())
(fun _ _ _ _ -> ())
(validate_sum_cases_aux t pc vc)
k
inline_for_extraction
let validate_sum_aux_payload_t
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
: Tot Type
= (#rrel: _) -> (#rel: _) ->
(input: slice rrel rel) ->
(pos: U64.t) ->
HST.Stack U64.t
(requires (fun h -> live_slice h input /\ U64.v pos <= U32.v input.len))
(ensures (fun h res h' ->
B.modifies B.loc_none h h' /\ (
match k with
| Unknown _ -> is_error res
| Known k' ->
if is_success res
then
valid_pos (dsnd (pc k')) h input (uint64_to_uint32 pos) (uint64_to_uint32 res)
else
(~ (valid (dsnd (pc k')) h input (uint64_to_uint32 pos)))
)))
let validate_sum_aux_payload_eq
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
: Tot (validate_sum_aux_payload_t t pc k -> validate_sum_aux_payload_t t pc k -> GTot Type0)
= fun _ _ -> True
inline_for_extraction
let validate_sum_aux_payload_if'
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
(cond: bool)
(ift: ((cond_true cond) -> Tot (validate_sum_aux_payload_t t pc k)))
(iff: ((cond_false cond) -> Tot (validate_sum_aux_payload_t t pc k)))
: Tot (validate_sum_aux_payload_t t pc k)
= fun #rrel #rel input pos ->
if cond
then begin
(ift () <: validate_sum_aux_payload_t t pc k) input pos
end else
(iff () <: validate_sum_aux_payload_t t pc k) input pos
inline_for_extraction
let validate_sum_aux_payload_if
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
: Tot (if_combinator _ (validate_sum_aux_payload_eq t pc k))
= validate_sum_aux_payload_if' t pc k
#push-options "--z3rlimit 64 --z3cliopt smt.arith.nl=false --using_facts_from '* -FStar.Int.Cast -LowParse.BitFields'"
// --query_stats --smtencoding.elim_box true --smtencoding.l_arith_repr native --z3refresh"
inline_for_extraction
let validate_sum_aux
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(v: validator p)
(p32: leaf_reader p)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(v_payload: ((k: sum_repr_type t)) -> Tot (validate_sum_aux_payload_t t pc (maybe_enum_key_of_repr (sum_enum t) k)))
: Tot (validator (parse_sum t p pc))
= fun #rrel #rel input pos ->
let h = HST.get () in
[@inline_let]
let _ = parse_sum_eq'' t p pc (bytes_of_slice_from h input (uint64_to_uint32 pos)) in
[@inline_let]
let _ = valid_facts (parse_sum t p pc) h input (uint64_to_uint32 pos) in
[@inline_let]
let _ = valid_facts p h input (uint64_to_uint32 pos) in
let len_after_tag = v input pos in
if is_error len_after_tag
then len_after_tag
else begin
let h1 = HST.get () in
let k' = p32 input (uint64_to_uint32 pos) in
[@inline_let]
let _ =
match maybe_enum_key_of_repr (sum_enum t) k' with
| Known k -> valid_facts (dsnd (pc k)) h input (uint64_to_uint32 len_after_tag)
| _ -> ()
in
v_payload k' input len_after_tag
end
#pop-options
inline_for_extraction
let validate_sum_aux_payload'
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (validator (dsnd (pc x)))))
(k: maybe_enum_key (sum_enum t))
: Tot (validate_sum_aux_payload_t t pc k)
= fun #rrel #rel input pos ->
match k with
| Known k ->
[@inline_let]
let _ = synth_sum_case_injective t k in
pc32 k input pos
// validate_synth (pc32 k) (synth_sum_case t k) () input pos
| _ -> validator_error_generic
inline_for_extraction
let validate_sum_aux_payload
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (validator (dsnd (pc x)))))
(destr: dep_maybe_enum_destr_t (sum_enum t) (validate_sum_aux_payload_t t pc))
(k: sum_repr_type t)
: Tot (validate_sum_aux_payload_t t pc (maybe_enum_key_of_repr (sum_enum t) k))
= destr (validate_sum_aux_payload_eq t pc) (validate_sum_aux_payload_if t pc) (fun _ _ -> ()) (fun _ _ _ _ -> ()) (validate_sum_aux_payload' t pc pc32) k
inline_for_extraction
let validate_sum
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(v: validator p)
(p32: leaf_reader p)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (validator (dsnd (pc x)))))
(destr: dep_maybe_enum_destr_t (sum_enum t) (validate_sum_aux_payload_t t pc))
: Tot (validator (parse_sum t p pc))
= validate_sum_aux t v p32 pc (validate_sum_aux_payload t pc pc32 destr)
module HS = FStar.HyperStack
#push-options "--z3rlimit 256 --z3cliopt smt.arith.nl=false --initial_ifuel 8 --max_ifuel 8 --initial_fuel 2 --max_fuel 2"
#restart-solver
let valid_sum_intro
(h: HS.mem)
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: Lemma
(requires (
valid (parse_enum_key p (sum_enum t)) h input pos /\ (
let k = contents (parse_enum_key p (sum_enum t)) h input pos in
valid (dsnd (pc k)) h input (get_valid_pos (parse_enum_key p (sum_enum t)) h input pos)
)))
(ensures (
let k = contents (parse_enum_key p (sum_enum t)) h input pos in
let pos_payload = get_valid_pos (parse_enum_key p (sum_enum t)) h input pos in
valid_content_pos
(parse_sum t p pc) h input pos
(synth_sum_case t k (contents (dsnd (pc k)) h input pos_payload))
(get_valid_pos (dsnd (pc k)) h input pos_payload)
))
= valid_facts (parse_enum_key p (sum_enum t)) h input pos;
let k = contents (parse_enum_key p (sum_enum t)) h input pos in
let pos_payload = get_valid_pos (parse_enum_key p (sum_enum t)) h input pos in
valid_facts (dsnd (pc k)) h input pos_payload;
valid_facts (parse_sum t p pc) h input pos;
parse_sum_eq t p pc (bytes_of_slice_from h input pos)
#pop-options
inline_for_extraction
let finalize_sum_case
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(s: serializer p)
(w: leaf_writer_strong s)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(destr: enum_repr_of_key'_t (sum_enum t))
(k: sum_key t)
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: HST.Stack unit
(requires (fun h ->
let len_tag = serialized_length (serialize_enum_key _ s (sum_enum t)) k in
U32.v pos + len_tag < 4294967296 /\ (
let pos_payload = pos `U32.add` U32.uint_to_t len_tag in
valid (dsnd (pc k)) h input pos_payload /\
writable input.base (U32.v pos) (U32.v pos_payload) h
)))
(ensures (fun h _ h' ->
let len_tag = serialized_length (serialize_enum_key _ s (sum_enum t)) k in
let pos_payload = pos `U32.add` U32.uint_to_t len_tag in
B.modifies (loc_slice_from_to input pos pos_payload) h h' /\
valid_content_pos (parse_sum t p pc) h' input pos (synth_sum_case t k (contents (dsnd (pc k)) h input pos_payload)) (get_valid_pos (dsnd (pc k)) h input pos_payload)
))
= let pos1 = write_enum_key w (sum_enum t) destr k input pos in
let h = HST.get () in
[@inline_let]
let _ = valid_sum_intro h t p pc input pos in
()
inline_for_extraction
let jump_sum_cases_aux
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(vc: ((x: sum_key t) -> Tot (jumper (dsnd (pc x)))))
(k: sum_key t)
: Tot (jumper (parse_sum_cases t pc k))
= [@inline_let]
let _ = synth_sum_case_injective t k in
jump_synth
(jump_weaken
(weaken_parse_cases_kind t pc)
(vc k)
()
)
(synth_sum_case t k)
()
inline_for_extraction
let jump_sum_cases_t
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot Type
= jumper (parse_sum_cases t pc k)
let jump_sum_cases_t_eq
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
(x y : jump_sum_cases_t t pc k)
: GTot Type0
= True
inline_for_extraction
let jump_sum_cases_t_if
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (if_combinator _ (jump_sum_cases_t_eq t pc k))
= fun cond (sv_true: cond_true cond -> Tot (jump_sum_cases_t t pc k)) (sv_false: cond_false cond -> Tot (jump_sum_cases_t t pc k)) #rrel #rel input pos ->
if cond
then sv_true () input pos
else sv_false () input pos
inline_for_extraction
let jump_sum_cases
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(vc: ((x: sum_key t) -> Tot (jumper (dsnd (pc x)))))
(destr: dep_enum_destr (sum_enum t) (jump_sum_cases_t t pc))
(k: sum_key t)
: Tot (jumper (parse_sum_cases t pc k))
= destr
_
(jump_sum_cases_t_if t pc)
(fun _ _ -> ())
(fun _ _ _ _ -> ())
(jump_sum_cases_aux t pc vc)
k
inline_for_extraction
let jump_sum_aux_payload_t
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
: Tot Type
= (#rrel: _) -> (#rel: _) ->
(input: slice rrel rel) ->
(pos: U32.t) ->
HST.Stack U32.t
(requires (fun h -> live_slice h input /\ U32.v pos <= U32.v input.len /\ (
match k with
| Unknown _ -> False
| Known k' -> valid (dsnd (pc k')) h input pos
)))
(ensures (fun h res h' ->
B.modifies B.loc_none h h' /\ (
match k with
| Unknown _ -> False
| Known k' ->
valid_pos (dsnd (pc k')) h input pos res
)))
let jump_sum_aux_payload_eq
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
: Tot (jump_sum_aux_payload_t t pc k -> jump_sum_aux_payload_t t pc k -> GTot Type0)
= fun _ _ -> True
inline_for_extraction
let jump_sum_aux_payload_if'
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
(cond: bool)
(ift: ((cond_true cond) -> Tot (jump_sum_aux_payload_t t pc k)))
(iff: ((cond_false cond) -> Tot (jump_sum_aux_payload_t t pc k)))
: Tot (jump_sum_aux_payload_t t pc k)
= fun #rrel #rel input pos ->
if cond
then begin
(ift () <: jump_sum_aux_payload_t t pc k) input pos
end else
(iff () <: jump_sum_aux_payload_t t pc k) input pos
inline_for_extraction
let jump_sum_aux_payload_if
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
: Tot (if_combinator _ (jump_sum_aux_payload_eq t pc k))
= jump_sum_aux_payload_if' t pc k
let parse_sum_eq3
(#kt: parser_kind)
(t: sum)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(input: bytes)
(k' : sum_repr_type t)
(consumed_k: consumed_length input)
: Lemma
(requires (Some? (parse (parse_sum t p pc) input) /\ parse p input == Some (k', consumed_k)))
(ensures (
let input_k = Seq.slice input consumed_k (Seq.length input) in
let k = maybe_enum_key_of_repr (sum_enum t) k' in
begin match k with
| Known k ->
Some? (parse (dsnd (pc k)) input_k)
| _ -> False
end
))
= parse_sum_eq'' t p pc input
let parse_sum_eq4
(#kt: parser_kind)
(t: sum)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(input: bytes)
(k' : sum_repr_type t)
(consumed_k: consumed_length input)
(consumed_payload: nat)
: Lemma
(requires (Some? (parse (parse_sum t p pc) input) /\ parse p input == Some (k', consumed_k) /\ (
let input_k = Seq.slice input consumed_k (Seq.length input) in
let k = maybe_enum_key_of_repr (sum_enum t) k' in
begin match k with
| Known k ->
Some? (parse (dsnd (pc k)) input_k) /\ (
let Some (_, consumed_payload') = parse (dsnd (pc k)) input_k in
consumed_payload' == consumed_payload
)
| _ -> False
end
)))
(ensures (
let Some (_, consumed) = parse (parse_sum t p pc) input in
consumed == consumed_k + consumed_payload
))
= parse_sum_eq'' t p pc input
#push-options "--z3rlimit 16"
let valid_sum_elim
(h: HS.mem)
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(#rrel: _) (#rel: _)
(input: slice rrel rel)
(pos: U32.t)
: Lemma
(requires (
valid (parse_sum t p pc) h input pos
))
(ensures (
valid p h input pos /\ (
let pos_payload = get_valid_pos p h input pos in
let k' = maybe_enum_key_of_repr (sum_enum t) (contents p h input pos) in
match k' with
| Known k ->
k == sum_tag_of_data t (contents (parse_sum t p pc) h input pos) /\
valid (dsnd (pc k)) h input pos_payload /\
valid_pos
(parse_sum t p pc) h input pos
(get_valid_pos (dsnd (pc k)) h input pos_payload)
| _ -> False
)))
= let sinput = bytes_of_slice_from h input pos in
let _ = parse_sum_eq'' t p pc sinput in
[@inline_let]
let _ = valid_facts (parse_sum t p pc) h input pos in
let Some (k', consumed_k) = parse p sinput in
let pos_after_tag = U32.uint_to_t (U32.v pos + consumed_k) in
[@inline_let]
let _ = valid_facts p h input pos in
assert (valid_content_pos p h input pos k' pos_after_tag);
match maybe_enum_key_of_repr (sum_enum t) k' with
| Known k -> valid_facts (dsnd (pc k)) h input pos_after_tag
| _ -> ()
#pop-options
let valid_sum_elim_tag
(h: HS.mem)
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: Lemma
(requires (
valid (parse_sum t p pc) h input pos
))
(ensures (
valid (parse_enum_key p (sum_enum t)) h input pos /\
contents (parse_enum_key p (sum_enum t)) h input pos == sum_tag_of_data t (contents (parse_sum t p pc) h input pos)
))
= let _ = parse_sum_eq' t p pc (bytes_of_slice_from h input pos) in
let _ = valid_facts (parse_sum t p pc) h input pos in
let _ = valid_facts (parse_enum_key p (sum_enum t)) h input pos in
()
inline_for_extraction
let read_sum_tag
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(p32: leaf_reader p)
(destr: dep_maybe_enum_destr_t (sum_enum t) (read_enum_key_t (sum_enum t)))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: HST.Stack (sum_key t)
(requires (fun h ->
valid (parse_sum t p pc) h input pos
))
(ensures (fun h res h' ->
B.modifies B.loc_none h h' /\
res == sum_tag_of_data t (contents (parse_sum t p pc) h input pos)
))
= let h = HST.get () in
[@inline_let] let _ = valid_sum_elim_tag h t p pc input pos in
read_enum_key p32 (sum_enum t) destr input pos
inline_for_extraction
let jump_sum_aux
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(v: jumper p)
(p32: leaf_reader p)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(v_payload: ((k: sum_repr_type t)) -> Tot (jump_sum_aux_payload_t t pc (maybe_enum_key_of_repr (sum_enum t) k)))
: Tot (jumper (parse_sum t p pc))
= fun #rrel #rel input pos ->
let h = HST.get () in
[@inline_let]
let _ = valid_sum_elim h t p pc input pos in
let pos_after_tag = v input pos in
let k' = p32 input pos in
v_payload k' input pos_after_tag
inline_for_extraction
let jump_sum_aux_payload'
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (jumper (dsnd (pc x)))))
(k: maybe_enum_key (sum_enum t))
: Tot (jump_sum_aux_payload_t t pc k)
= fun #rrel #rel input pos ->
match k with
| Known k ->
[@inline_let]
let _ = synth_sum_case_injective t k in
pc32 k input pos
| _ -> 0ul // dummy, but we MUST NOT remove this branch, otherwise extraction fails
inline_for_extraction
let jump_sum_aux_payload
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (jumper (dsnd (pc x)))))
(destr: dep_maybe_enum_destr_t (sum_enum t) (jump_sum_aux_payload_t t pc))
(k: sum_repr_type t)
: Tot (jump_sum_aux_payload_t t pc (maybe_enum_key_of_repr (sum_enum t) k))
= destr (jump_sum_aux_payload_eq t pc) (jump_sum_aux_payload_if t pc) (fun _ _ -> ()) (fun _ _ _ _ -> ()) (jump_sum_aux_payload' t pc pc32) k
inline_for_extraction
let jump_sum
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(v: jumper p)
(p32: leaf_reader p)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (jumper (dsnd (pc x)))))
(destr: dep_maybe_enum_destr_t (sum_enum t) (jump_sum_aux_payload_t t pc))
: Tot (jumper (parse_sum t p pc))
= jump_sum_aux t v p32 pc (jump_sum_aux_payload t pc pc32 destr)
inline_for_extraction
let read_sum_cases'
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (leaf_reader (dsnd (pc x)))))
(k: sum_key t)
: Tot (leaf_reader (parse_sum_cases' t pc k))
= [@inline_let]
let _ = synth_sum_case_injective t k in
read_synth'
(dsnd (pc k))
(synth_sum_case t k)
(pc32 k)
()
inline_for_extraction
let read_sum_cases_t
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot Type
= leaf_reader (parse_sum_cases' t pc k)
let read_sum_cases_t_eq
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
(x y : read_sum_cases_t t pc k)
: GTot Type0
= True
inline_for_extraction
let read_sum_cases_t_if
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (if_combinator _ (read_sum_cases_t_eq t pc k))
= fun cond (sv_true: cond_true cond -> Tot (read_sum_cases_t t pc k)) (sv_false: cond_false cond -> Tot (read_sum_cases_t t pc k)) #_ #_ input pos ->
if cond
then (sv_true () input pos)
else (sv_false () input pos)
inline_for_extraction
let read_sum_cases
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (leaf_reader (dsnd (pc x)))))
(destr: dep_enum_destr (sum_enum t) (read_sum_cases_t t pc))
(k: sum_key t)
: Tot (leaf_reader (parse_sum_cases' t pc k))
= destr
_
(read_sum_cases_t_if t pc)
(fun _ _ -> ())
(fun _ _ _ _ -> ())
(read_sum_cases' t pc pc32)
k
#push-options "--z3rlimit 32"
inline_for_extraction
let read_sum
(#kt: parser_kind)
(t: sum)
(p: parser kt (sum_repr_type t))
(p32: leaf_reader (parse_enum_key p (sum_enum t)))
(j: jumper p)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (leaf_reader (dsnd (pc x)))))
(destr: dep_enum_destr (sum_enum t) (read_sum_cases_t t pc))
: Tot (leaf_reader (parse_sum t p pc))
=
fun #_ #_ input pos ->
let h = HST.get () in
valid_facts (parse_sum t p pc) h input pos;
parse_sum_eq' t p pc (bytes_of_slice_from h input pos);
valid_facts (parse_enum_key p (sum_enum t)) h input pos;
let k = p32 input pos in
let pos' = jump_enum_key j (sum_enum t) input pos in
valid_facts (parse_sum_cases' t pc k) h input pos' ;
read_sum_cases t pc pc32 destr k input pos'
#pop-options
inline_for_extraction
let serialize32_sum_cases_t
(t: sum)
(#pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(sc: ((x: sum_key t) -> Tot (serializer (dsnd (pc x)))))
(k: sum_key t)
: Tot Type
= serializer32 (serialize_sum_cases t pc sc k)
let serialize32_sum_cases_t_eq
(t: sum)
(#pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(sc: ((x: sum_key t) -> Tot (serializer (dsnd (pc x)))))
(k: sum_key t)
(x y: serialize32_sum_cases_t t sc k)
: GTot Type0
= True
inline_for_extraction
let serialize32_sum_cases_t_if
(t: sum)
(#pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(sc: ((x: sum_key t) -> Tot (serializer (dsnd (pc x)))))
(k: sum_key t)
: Tot (if_combinator _ (serialize32_sum_cases_t_eq t sc k))
= fun cond (sv_true: (cond_true cond -> Tot (serialize32_sum_cases_t t sc k))) (sv_false: (cond_false cond -> Tot (serialize32_sum_cases_t t sc k))) x #rrel #rel b pos ->
if cond
then (sv_true () x b pos)
else (sv_false () x b pos)
inline_for_extraction
let serialize32_sum_cases_aux
(t: sum)
(#pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(sc: ((x: sum_key t) -> Tot (serializer (dsnd (pc x)))))
(sc32: ((x: sum_key t) -> Tot (serializer32 (sc x))))
(k: sum_key t)
: Tot (serializer32 (serialize_sum_cases t pc sc k))
= fun x #rrel #rel b pos ->
[@inline_let] let _ =
Classical.forall_intro (parse_sum_cases_eq' t pc k);
synth_sum_case_injective t k;
synth_sum_case_inverse t k
in
serialize32_synth
(sc32 k)
(synth_sum_case t k)
(synth_sum_case_recip t k)
(fun x -> synth_sum_case_recip t k x)
()
x
b
pos
inline_for_extraction
let serialize32_sum_cases
(t: sum)
(#pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(sc: ((x: sum_key t) -> Tot (serializer (dsnd (pc x)))))
(sc32: ((x: sum_key t) -> Tot (serializer32 (sc x))))
(destr: dep_enum_destr (sum_enum t) (serialize32_sum_cases_t t sc))
(k: sum_key t)
: Tot (serializer32 (serialize_sum_cases t pc sc k))
= destr
_
(serialize32_sum_cases_t_if t sc)
(fun _ _ -> ())
(fun _ _ _ _ -> ())
(serialize32_sum_cases_aux t sc sc32)
k
inline_for_extraction
let serialize32_sum
(#kt: parser_kind)
(t: sum)
(#p: parser kt (sum_repr_type t))
(s: serializer p {kt.parser_kind_subkind == Some ParserStrong})
(s32: serializer32 (serialize_enum_key _ s (sum_enum t)))
(#pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(sc: ((x: sum_key t) -> Tot (serializer (dsnd (pc x)))))
(sc32: ((x: sum_key t) -> Tot (serializer32 (sc x))))
(destr: dep_enum_destr (sum_enum t) (serialize32_sum_cases_t t sc))
: Tot (serializer32 (serialize_sum t s sc))
= fun x #rrel #rel b pos ->
serialize_sum_eq t s sc x;
let tg = sum_tag_of_data t x in
serialize32_nondep_then_aux s32 (serialize32_sum_cases t sc sc32 destr tg) tg x b pos
let clens_sum_tag
(s: sum)
: Tot (clens (sum_type s) (sum_key s))
= {
clens_cond = (fun _ -> True);
clens_get = sum_tag_of_data s;
}
let gaccessor_sum_tag
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
: Tot (gaccessor (parse_sum t p pc) (parse_enum_key p (sum_enum t)) (clens_sum_tag t))
= gaccessor_tagged_union_tag
(parse_enum_key p (sum_enum t))
(sum_tag_of_data t)
(parse_sum_cases t pc)
inline_for_extraction
let accessor_sum_tag
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
: Tot (accessor (gaccessor_sum_tag t p pc))
= accessor_tagged_union_tag
(parse_enum_key p (sum_enum t))
(sum_tag_of_data t)
(parse_sum_cases t pc)
let clens_sum_payload
(s: sum)
(k: sum_key s)
: Tot (clens (sum_type s) (sum_type_of_tag s k))
= {
clens_cond = (fun (x: sum_type s) -> sum_tag_of_data s x == k);
clens_get = (fun (x: sum_type s) -> synth_sum_case_recip s k x <: Ghost (sum_type_of_tag s k) (requires (sum_tag_of_data s x == k)) (ensures (fun _ -> True)));
}
#push-options "--z3rlimit 32"
let gaccessor_clens_sum_payload'
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (gaccessor' (parse_sum t p pc) (dsnd (pc k)) (clens_sum_payload t k))
= fun (input: bytes) ->
parse_sum_eq'' t p pc input;
let res =
match parse p input with
| Some (_, consumed) ->
synth_sum_case_inverse t k;
synth_sum_case_injective t k;
synth_injective_synth_inverse_synth_inverse_recip (synth_sum_case t k) (synth_sum_case_recip t k) ();
(consumed)
| _ -> 0 // dummy
in
(res <: (res: _ { gaccessor_post' (parse_sum t p pc) (dsnd (pc k)) (clens_sum_payload t k) input res } ))
#push-options "--z3rlimit 64"
let gaccessor_clens_sum_payload_injective
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
(sl sl' : bytes)
: Lemma
(requires (
gaccessor_pre (parse_sum t p pc) (dsnd (pc k)) (clens_sum_payload t k) sl /\
gaccessor_pre (parse_sum t p pc) (dsnd (pc k)) (clens_sum_payload t k) sl' /\
injective_precond (parse_sum t p pc) sl sl'
))
(ensures (gaccessor_clens_sum_payload' t p pc k sl == gaccessor_clens_sum_payload' t p pc k sl'))
= parse_sum_eq'' t p pc sl;
parse_sum_eq'' t p pc sl' ;
parse_injective (parse_sum t p pc) sl sl' ;
parse_injective p sl sl'
#pop-options
let gaccessor_clens_sum_payload_no_lookahead
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
(sl sl' : bytes)
: Lemma
(requires (
(parse_sum_kind kt t pc).parser_kind_subkind == Some ParserStrong /\
gaccessor_pre (parse_sum t p pc) (dsnd (pc k)) (clens_sum_payload t k) sl /\
gaccessor_pre (parse_sum t p pc) (dsnd (pc k)) (clens_sum_payload t k) sl' /\
no_lookahead_on_precond (parse_sum t p pc) sl sl'
))
(ensures (gaccessor_clens_sum_payload' t p pc k sl == gaccessor_clens_sum_payload' t p pc k sl'))
= parse_sum_eq'' t p pc sl;
parse_sum_eq'' t p pc sl' ;
parse_strong_prefix (parse_sum t p pc) sl sl' ;
parse_injective p sl sl' | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"LowStar.Buffer.fst.checked",
"LowParse.Spec.Sum.fst.checked",
"LowParse.Low.Enum.fst.checked",
"FStar.UInt64.fsti.checked",
"FStar.UInt32.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Int.Cast.fst.checked",
"FStar.HyperStack.ST.fsti.checked",
"FStar.HyperStack.fst.checked",
"FStar.Classical.fsti.checked"
],
"interface_file": false,
"source_file": "LowParse.Low.Sum.fst"
} | [
{
"abbrev": true,
"full_module": "FStar.HyperStack",
"short_module": "HS"
},
{
"abbrev": true,
"full_module": "FStar.UInt64",
"short_module": "U64"
},
{
"abbrev": true,
"full_module": "FStar.Int.Cast",
"short_module": "Cast"
},
{
"abbrev": true,
"full_module": "LowStar.Buffer",
"short_module": "B"
},
{
"abbrev": true,
"full_module": "FStar.HyperStack.ST",
"short_module": "HST"
},
{
"abbrev": true,
"full_module": "FStar.UInt32",
"short_module": "U32"
},
{
"abbrev": false,
"full_module": "LowParse.Spec.Sum",
"short_module": null
},
{
"abbrev": false,
"full_module": "LowParse.Low.Enum",
"short_module": null
},
{
"abbrev": false,
"full_module": "LowParse.Low",
"short_module": null
},
{
"abbrev": false,
"full_module": "LowParse.Low",
"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",
"short_module": null
}
] | {
"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_elim_box": false,
"smtencoding_l_arith_repr": "boxwrap",
"smtencoding_nl_arith_repr": "boxwrap",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": true,
"z3cliopt": [],
"z3refresh": false,
"z3rlimit": 32,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | false |
t: LowParse.Spec.Sum.sum ->
p: LowParse.Spec.Base.parser kt (LowParse.Spec.Sum.sum_repr_type t) ->
pc:
(x: LowParse.Spec.Sum.sum_key t
-> Prims.dtuple2 LowParse.Spec.Base.parser_kind
(fun k -> LowParse.Spec.Base.parser k (LowParse.Spec.Sum.sum_type_of_tag t x))) ->
k: LowParse.Spec.Sum.sum_key t
-> LowParse.Low.Base.Spec.gaccessor (LowParse.Spec.Sum.parse_sum t p pc)
(FStar.Pervasives.dsnd (pc k))
(LowParse.Low.Sum.clens_sum_payload t k) | Prims.Tot | [
"total"
] | [] | [
"LowParse.Spec.Sum.sum",
"LowParse.Spec.Base.parser_kind",
"LowParse.Spec.Base.parser",
"LowParse.Spec.Sum.sum_repr_type",
"LowParse.Spec.Sum.sum_key",
"Prims.dtuple2",
"LowParse.Spec.Sum.sum_type_of_tag",
"LowParse.Low.Sum.gaccessor_clens_sum_payload'",
"Prims.unit",
"LowParse.Low.Base.Spec.gaccessor_prop_equiv",
"LowParse.Spec.Sum.parse_sum_kind",
"LowParse.Spec.Sum.sum_type",
"LowParse.Spec.Sum.parse_sum",
"Prims.__proj__Mkdtuple2__item___1",
"FStar.Pervasives.dsnd",
"LowParse.Low.Sum.clens_sum_payload",
"FStar.Classical.forall_intro_2",
"LowParse.Bytes.bytes",
"Prims.l_imp",
"Prims.l_and",
"Prims.eq2",
"FStar.Pervasives.Native.option",
"LowParse.Spec.Base.parser_subkind",
"LowParse.Spec.Base.__proj__Mkparser_kind'__item__parser_kind_subkind",
"FStar.Pervasives.Native.Some",
"LowParse.Spec.Base.ParserStrong",
"LowParse.Low.Base.Spec.gaccessor_pre",
"LowParse.Spec.Base.no_lookahead_on_precond",
"Prims.nat",
"FStar.Classical.move_requires",
"LowParse.Low.Sum.gaccessor_clens_sum_payload_no_lookahead",
"Prims.l_True",
"Prims.squash",
"Prims.Nil",
"FStar.Pervasives.pattern",
"LowParse.Spec.Base.injective_precond",
"LowParse.Low.Sum.gaccessor_clens_sum_payload_injective",
"LowParse.Low.Base.Spec.gaccessor"
] | [] | false | false | false | false | false | let gaccessor_clens_sum_payload
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: (x: sum_key t -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (gaccessor (parse_sum t p pc) (dsnd (pc k)) (clens_sum_payload t k)) =
| Classical.forall_intro_2 (fun x ->
Classical.move_requires (gaccessor_clens_sum_payload_injective t p pc k x));
Classical.forall_intro_2 (fun x ->
Classical.move_requires (gaccessor_clens_sum_payload_no_lookahead t p pc k x));
gaccessor_prop_equiv (parse_sum t p pc)
(dsnd (pc k))
(clens_sum_payload t k)
(gaccessor_clens_sum_payload' t p pc k);
gaccessor_clens_sum_payload' t p pc k | false |
LowParse.Low.Sum.fst | LowParse.Low.Sum.serialize32_sum | val serialize32_sum
(#kt: parser_kind)
(t: sum)
(#p: parser kt (sum_repr_type t))
(s: serializer p {kt.parser_kind_subkind == Some ParserStrong})
(s32: serializer32 (serialize_enum_key _ s (sum_enum t)))
(#pc: (x: sum_key t -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(sc: (x: sum_key t -> Tot (serializer (dsnd (pc x)))))
(sc32: (x: sum_key t -> Tot (serializer32 (sc x))))
(destr: dep_enum_destr (sum_enum t) (serialize32_sum_cases_t t sc))
: Tot (serializer32 (serialize_sum t s sc)) | val serialize32_sum
(#kt: parser_kind)
(t: sum)
(#p: parser kt (sum_repr_type t))
(s: serializer p {kt.parser_kind_subkind == Some ParserStrong})
(s32: serializer32 (serialize_enum_key _ s (sum_enum t)))
(#pc: (x: sum_key t -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(sc: (x: sum_key t -> Tot (serializer (dsnd (pc x)))))
(sc32: (x: sum_key t -> Tot (serializer32 (sc x))))
(destr: dep_enum_destr (sum_enum t) (serialize32_sum_cases_t t sc))
: Tot (serializer32 (serialize_sum t s sc)) | let serialize32_sum
(#kt: parser_kind)
(t: sum)
(#p: parser kt (sum_repr_type t))
(s: serializer p {kt.parser_kind_subkind == Some ParserStrong})
(s32: serializer32 (serialize_enum_key _ s (sum_enum t)))
(#pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(sc: ((x: sum_key t) -> Tot (serializer (dsnd (pc x)))))
(sc32: ((x: sum_key t) -> Tot (serializer32 (sc x))))
(destr: dep_enum_destr (sum_enum t) (serialize32_sum_cases_t t sc))
: Tot (serializer32 (serialize_sum t s sc))
= fun x #rrel #rel b pos ->
serialize_sum_eq t s sc x;
let tg = sum_tag_of_data t x in
serialize32_nondep_then_aux s32 (serialize32_sum_cases t sc sc32 destr tg) tg x b pos | {
"file_name": "src/lowparse/LowParse.Low.Sum.fst",
"git_rev": "00217c4a89f5ba56002ba9aa5b4a9d5903bfe9fa",
"git_url": "https://github.com/project-everest/everparse.git",
"project_name": "everparse"
} | {
"end_col": 87,
"end_line": 752,
"start_col": 0,
"start_line": 738
} | module LowParse.Low.Sum
include LowParse.Low.Enum
include LowParse.Spec.Sum
module U32 = FStar.UInt32
module HST = FStar.HyperStack.ST
module B = LowStar.Buffer
module Cast = FStar.Int.Cast
module U64 = FStar.UInt64
inline_for_extraction
let validate_sum_cases_aux
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(vc: ((x: sum_key t) -> Tot (validator (dsnd (pc x)))))
(k: sum_key t)
: Tot (validator (parse_sum_cases t pc k))
= [@inline_let]
let _ = synth_sum_case_injective t k in
validate_synth
(validate_weaken
(weaken_parse_cases_kind t pc)
(vc k)
()
)
(synth_sum_case t k)
()
inline_for_extraction
let validate_sum_cases_t
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot Type
= validator (parse_sum_cases t pc k)
let validate_sum_cases_t_eq
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
(x y : validate_sum_cases_t t pc k)
: GTot Type0
= True
inline_for_extraction
let validate_sum_cases_t_if
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (if_combinator _ (validate_sum_cases_t_eq t pc k))
= fun cond (sv_true: cond_true cond -> Tot (validate_sum_cases_t t pc k)) (sv_false: cond_false cond -> Tot (validate_sum_cases_t t pc k)) #rrel #rel input pos ->
if cond
then sv_true () input pos
else sv_false () input pos
inline_for_extraction
let validate_sum_cases
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(vc: ((x: sum_key t) -> Tot (validator (dsnd (pc x)))))
(destr: dep_enum_destr (sum_enum t) (validate_sum_cases_t t pc))
(k: sum_key t)
: Tot (validator (parse_sum_cases t pc k))
= destr
_
(validate_sum_cases_t_if t pc)
(fun _ _ -> ())
(fun _ _ _ _ -> ())
(validate_sum_cases_aux t pc vc)
k
inline_for_extraction
let validate_sum_aux_payload_t
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
: Tot Type
= (#rrel: _) -> (#rel: _) ->
(input: slice rrel rel) ->
(pos: U64.t) ->
HST.Stack U64.t
(requires (fun h -> live_slice h input /\ U64.v pos <= U32.v input.len))
(ensures (fun h res h' ->
B.modifies B.loc_none h h' /\ (
match k with
| Unknown _ -> is_error res
| Known k' ->
if is_success res
then
valid_pos (dsnd (pc k')) h input (uint64_to_uint32 pos) (uint64_to_uint32 res)
else
(~ (valid (dsnd (pc k')) h input (uint64_to_uint32 pos)))
)))
let validate_sum_aux_payload_eq
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
: Tot (validate_sum_aux_payload_t t pc k -> validate_sum_aux_payload_t t pc k -> GTot Type0)
= fun _ _ -> True
inline_for_extraction
let validate_sum_aux_payload_if'
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
(cond: bool)
(ift: ((cond_true cond) -> Tot (validate_sum_aux_payload_t t pc k)))
(iff: ((cond_false cond) -> Tot (validate_sum_aux_payload_t t pc k)))
: Tot (validate_sum_aux_payload_t t pc k)
= fun #rrel #rel input pos ->
if cond
then begin
(ift () <: validate_sum_aux_payload_t t pc k) input pos
end else
(iff () <: validate_sum_aux_payload_t t pc k) input pos
inline_for_extraction
let validate_sum_aux_payload_if
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
: Tot (if_combinator _ (validate_sum_aux_payload_eq t pc k))
= validate_sum_aux_payload_if' t pc k
#push-options "--z3rlimit 64 --z3cliopt smt.arith.nl=false --using_facts_from '* -FStar.Int.Cast -LowParse.BitFields'"
// --query_stats --smtencoding.elim_box true --smtencoding.l_arith_repr native --z3refresh"
inline_for_extraction
let validate_sum_aux
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(v: validator p)
(p32: leaf_reader p)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(v_payload: ((k: sum_repr_type t)) -> Tot (validate_sum_aux_payload_t t pc (maybe_enum_key_of_repr (sum_enum t) k)))
: Tot (validator (parse_sum t p pc))
= fun #rrel #rel input pos ->
let h = HST.get () in
[@inline_let]
let _ = parse_sum_eq'' t p pc (bytes_of_slice_from h input (uint64_to_uint32 pos)) in
[@inline_let]
let _ = valid_facts (parse_sum t p pc) h input (uint64_to_uint32 pos) in
[@inline_let]
let _ = valid_facts p h input (uint64_to_uint32 pos) in
let len_after_tag = v input pos in
if is_error len_after_tag
then len_after_tag
else begin
let h1 = HST.get () in
let k' = p32 input (uint64_to_uint32 pos) in
[@inline_let]
let _ =
match maybe_enum_key_of_repr (sum_enum t) k' with
| Known k -> valid_facts (dsnd (pc k)) h input (uint64_to_uint32 len_after_tag)
| _ -> ()
in
v_payload k' input len_after_tag
end
#pop-options
inline_for_extraction
let validate_sum_aux_payload'
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (validator (dsnd (pc x)))))
(k: maybe_enum_key (sum_enum t))
: Tot (validate_sum_aux_payload_t t pc k)
= fun #rrel #rel input pos ->
match k with
| Known k ->
[@inline_let]
let _ = synth_sum_case_injective t k in
pc32 k input pos
// validate_synth (pc32 k) (synth_sum_case t k) () input pos
| _ -> validator_error_generic
inline_for_extraction
let validate_sum_aux_payload
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (validator (dsnd (pc x)))))
(destr: dep_maybe_enum_destr_t (sum_enum t) (validate_sum_aux_payload_t t pc))
(k: sum_repr_type t)
: Tot (validate_sum_aux_payload_t t pc (maybe_enum_key_of_repr (sum_enum t) k))
= destr (validate_sum_aux_payload_eq t pc) (validate_sum_aux_payload_if t pc) (fun _ _ -> ()) (fun _ _ _ _ -> ()) (validate_sum_aux_payload' t pc pc32) k
inline_for_extraction
let validate_sum
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(v: validator p)
(p32: leaf_reader p)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (validator (dsnd (pc x)))))
(destr: dep_maybe_enum_destr_t (sum_enum t) (validate_sum_aux_payload_t t pc))
: Tot (validator (parse_sum t p pc))
= validate_sum_aux t v p32 pc (validate_sum_aux_payload t pc pc32 destr)
module HS = FStar.HyperStack
#push-options "--z3rlimit 256 --z3cliopt smt.arith.nl=false --initial_ifuel 8 --max_ifuel 8 --initial_fuel 2 --max_fuel 2"
#restart-solver
let valid_sum_intro
(h: HS.mem)
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: Lemma
(requires (
valid (parse_enum_key p (sum_enum t)) h input pos /\ (
let k = contents (parse_enum_key p (sum_enum t)) h input pos in
valid (dsnd (pc k)) h input (get_valid_pos (parse_enum_key p (sum_enum t)) h input pos)
)))
(ensures (
let k = contents (parse_enum_key p (sum_enum t)) h input pos in
let pos_payload = get_valid_pos (parse_enum_key p (sum_enum t)) h input pos in
valid_content_pos
(parse_sum t p pc) h input pos
(synth_sum_case t k (contents (dsnd (pc k)) h input pos_payload))
(get_valid_pos (dsnd (pc k)) h input pos_payload)
))
= valid_facts (parse_enum_key p (sum_enum t)) h input pos;
let k = contents (parse_enum_key p (sum_enum t)) h input pos in
let pos_payload = get_valid_pos (parse_enum_key p (sum_enum t)) h input pos in
valid_facts (dsnd (pc k)) h input pos_payload;
valid_facts (parse_sum t p pc) h input pos;
parse_sum_eq t p pc (bytes_of_slice_from h input pos)
#pop-options
inline_for_extraction
let finalize_sum_case
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(s: serializer p)
(w: leaf_writer_strong s)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(destr: enum_repr_of_key'_t (sum_enum t))
(k: sum_key t)
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: HST.Stack unit
(requires (fun h ->
let len_tag = serialized_length (serialize_enum_key _ s (sum_enum t)) k in
U32.v pos + len_tag < 4294967296 /\ (
let pos_payload = pos `U32.add` U32.uint_to_t len_tag in
valid (dsnd (pc k)) h input pos_payload /\
writable input.base (U32.v pos) (U32.v pos_payload) h
)))
(ensures (fun h _ h' ->
let len_tag = serialized_length (serialize_enum_key _ s (sum_enum t)) k in
let pos_payload = pos `U32.add` U32.uint_to_t len_tag in
B.modifies (loc_slice_from_to input pos pos_payload) h h' /\
valid_content_pos (parse_sum t p pc) h' input pos (synth_sum_case t k (contents (dsnd (pc k)) h input pos_payload)) (get_valid_pos (dsnd (pc k)) h input pos_payload)
))
= let pos1 = write_enum_key w (sum_enum t) destr k input pos in
let h = HST.get () in
[@inline_let]
let _ = valid_sum_intro h t p pc input pos in
()
inline_for_extraction
let jump_sum_cases_aux
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(vc: ((x: sum_key t) -> Tot (jumper (dsnd (pc x)))))
(k: sum_key t)
: Tot (jumper (parse_sum_cases t pc k))
= [@inline_let]
let _ = synth_sum_case_injective t k in
jump_synth
(jump_weaken
(weaken_parse_cases_kind t pc)
(vc k)
()
)
(synth_sum_case t k)
()
inline_for_extraction
let jump_sum_cases_t
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot Type
= jumper (parse_sum_cases t pc k)
let jump_sum_cases_t_eq
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
(x y : jump_sum_cases_t t pc k)
: GTot Type0
= True
inline_for_extraction
let jump_sum_cases_t_if
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (if_combinator _ (jump_sum_cases_t_eq t pc k))
= fun cond (sv_true: cond_true cond -> Tot (jump_sum_cases_t t pc k)) (sv_false: cond_false cond -> Tot (jump_sum_cases_t t pc k)) #rrel #rel input pos ->
if cond
then sv_true () input pos
else sv_false () input pos
inline_for_extraction
let jump_sum_cases
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(vc: ((x: sum_key t) -> Tot (jumper (dsnd (pc x)))))
(destr: dep_enum_destr (sum_enum t) (jump_sum_cases_t t pc))
(k: sum_key t)
: Tot (jumper (parse_sum_cases t pc k))
= destr
_
(jump_sum_cases_t_if t pc)
(fun _ _ -> ())
(fun _ _ _ _ -> ())
(jump_sum_cases_aux t pc vc)
k
inline_for_extraction
let jump_sum_aux_payload_t
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
: Tot Type
= (#rrel: _) -> (#rel: _) ->
(input: slice rrel rel) ->
(pos: U32.t) ->
HST.Stack U32.t
(requires (fun h -> live_slice h input /\ U32.v pos <= U32.v input.len /\ (
match k with
| Unknown _ -> False
| Known k' -> valid (dsnd (pc k')) h input pos
)))
(ensures (fun h res h' ->
B.modifies B.loc_none h h' /\ (
match k with
| Unknown _ -> False
| Known k' ->
valid_pos (dsnd (pc k')) h input pos res
)))
let jump_sum_aux_payload_eq
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
: Tot (jump_sum_aux_payload_t t pc k -> jump_sum_aux_payload_t t pc k -> GTot Type0)
= fun _ _ -> True
inline_for_extraction
let jump_sum_aux_payload_if'
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
(cond: bool)
(ift: ((cond_true cond) -> Tot (jump_sum_aux_payload_t t pc k)))
(iff: ((cond_false cond) -> Tot (jump_sum_aux_payload_t t pc k)))
: Tot (jump_sum_aux_payload_t t pc k)
= fun #rrel #rel input pos ->
if cond
then begin
(ift () <: jump_sum_aux_payload_t t pc k) input pos
end else
(iff () <: jump_sum_aux_payload_t t pc k) input pos
inline_for_extraction
let jump_sum_aux_payload_if
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
: Tot (if_combinator _ (jump_sum_aux_payload_eq t pc k))
= jump_sum_aux_payload_if' t pc k
let parse_sum_eq3
(#kt: parser_kind)
(t: sum)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(input: bytes)
(k' : sum_repr_type t)
(consumed_k: consumed_length input)
: Lemma
(requires (Some? (parse (parse_sum t p pc) input) /\ parse p input == Some (k', consumed_k)))
(ensures (
let input_k = Seq.slice input consumed_k (Seq.length input) in
let k = maybe_enum_key_of_repr (sum_enum t) k' in
begin match k with
| Known k ->
Some? (parse (dsnd (pc k)) input_k)
| _ -> False
end
))
= parse_sum_eq'' t p pc input
let parse_sum_eq4
(#kt: parser_kind)
(t: sum)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(input: bytes)
(k' : sum_repr_type t)
(consumed_k: consumed_length input)
(consumed_payload: nat)
: Lemma
(requires (Some? (parse (parse_sum t p pc) input) /\ parse p input == Some (k', consumed_k) /\ (
let input_k = Seq.slice input consumed_k (Seq.length input) in
let k = maybe_enum_key_of_repr (sum_enum t) k' in
begin match k with
| Known k ->
Some? (parse (dsnd (pc k)) input_k) /\ (
let Some (_, consumed_payload') = parse (dsnd (pc k)) input_k in
consumed_payload' == consumed_payload
)
| _ -> False
end
)))
(ensures (
let Some (_, consumed) = parse (parse_sum t p pc) input in
consumed == consumed_k + consumed_payload
))
= parse_sum_eq'' t p pc input
#push-options "--z3rlimit 16"
let valid_sum_elim
(h: HS.mem)
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(#rrel: _) (#rel: _)
(input: slice rrel rel)
(pos: U32.t)
: Lemma
(requires (
valid (parse_sum t p pc) h input pos
))
(ensures (
valid p h input pos /\ (
let pos_payload = get_valid_pos p h input pos in
let k' = maybe_enum_key_of_repr (sum_enum t) (contents p h input pos) in
match k' with
| Known k ->
k == sum_tag_of_data t (contents (parse_sum t p pc) h input pos) /\
valid (dsnd (pc k)) h input pos_payload /\
valid_pos
(parse_sum t p pc) h input pos
(get_valid_pos (dsnd (pc k)) h input pos_payload)
| _ -> False
)))
= let sinput = bytes_of_slice_from h input pos in
let _ = parse_sum_eq'' t p pc sinput in
[@inline_let]
let _ = valid_facts (parse_sum t p pc) h input pos in
let Some (k', consumed_k) = parse p sinput in
let pos_after_tag = U32.uint_to_t (U32.v pos + consumed_k) in
[@inline_let]
let _ = valid_facts p h input pos in
assert (valid_content_pos p h input pos k' pos_after_tag);
match maybe_enum_key_of_repr (sum_enum t) k' with
| Known k -> valid_facts (dsnd (pc k)) h input pos_after_tag
| _ -> ()
#pop-options
let valid_sum_elim_tag
(h: HS.mem)
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: Lemma
(requires (
valid (parse_sum t p pc) h input pos
))
(ensures (
valid (parse_enum_key p (sum_enum t)) h input pos /\
contents (parse_enum_key p (sum_enum t)) h input pos == sum_tag_of_data t (contents (parse_sum t p pc) h input pos)
))
= let _ = parse_sum_eq' t p pc (bytes_of_slice_from h input pos) in
let _ = valid_facts (parse_sum t p pc) h input pos in
let _ = valid_facts (parse_enum_key p (sum_enum t)) h input pos in
()
inline_for_extraction
let read_sum_tag
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(p32: leaf_reader p)
(destr: dep_maybe_enum_destr_t (sum_enum t) (read_enum_key_t (sum_enum t)))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: HST.Stack (sum_key t)
(requires (fun h ->
valid (parse_sum t p pc) h input pos
))
(ensures (fun h res h' ->
B.modifies B.loc_none h h' /\
res == sum_tag_of_data t (contents (parse_sum t p pc) h input pos)
))
= let h = HST.get () in
[@inline_let] let _ = valid_sum_elim_tag h t p pc input pos in
read_enum_key p32 (sum_enum t) destr input pos
inline_for_extraction
let jump_sum_aux
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(v: jumper p)
(p32: leaf_reader p)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(v_payload: ((k: sum_repr_type t)) -> Tot (jump_sum_aux_payload_t t pc (maybe_enum_key_of_repr (sum_enum t) k)))
: Tot (jumper (parse_sum t p pc))
= fun #rrel #rel input pos ->
let h = HST.get () in
[@inline_let]
let _ = valid_sum_elim h t p pc input pos in
let pos_after_tag = v input pos in
let k' = p32 input pos in
v_payload k' input pos_after_tag
inline_for_extraction
let jump_sum_aux_payload'
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (jumper (dsnd (pc x)))))
(k: maybe_enum_key (sum_enum t))
: Tot (jump_sum_aux_payload_t t pc k)
= fun #rrel #rel input pos ->
match k with
| Known k ->
[@inline_let]
let _ = synth_sum_case_injective t k in
pc32 k input pos
| _ -> 0ul // dummy, but we MUST NOT remove this branch, otherwise extraction fails
inline_for_extraction
let jump_sum_aux_payload
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (jumper (dsnd (pc x)))))
(destr: dep_maybe_enum_destr_t (sum_enum t) (jump_sum_aux_payload_t t pc))
(k: sum_repr_type t)
: Tot (jump_sum_aux_payload_t t pc (maybe_enum_key_of_repr (sum_enum t) k))
= destr (jump_sum_aux_payload_eq t pc) (jump_sum_aux_payload_if t pc) (fun _ _ -> ()) (fun _ _ _ _ -> ()) (jump_sum_aux_payload' t pc pc32) k
inline_for_extraction
let jump_sum
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(v: jumper p)
(p32: leaf_reader p)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (jumper (dsnd (pc x)))))
(destr: dep_maybe_enum_destr_t (sum_enum t) (jump_sum_aux_payload_t t pc))
: Tot (jumper (parse_sum t p pc))
= jump_sum_aux t v p32 pc (jump_sum_aux_payload t pc pc32 destr)
inline_for_extraction
let read_sum_cases'
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (leaf_reader (dsnd (pc x)))))
(k: sum_key t)
: Tot (leaf_reader (parse_sum_cases' t pc k))
= [@inline_let]
let _ = synth_sum_case_injective t k in
read_synth'
(dsnd (pc k))
(synth_sum_case t k)
(pc32 k)
()
inline_for_extraction
let read_sum_cases_t
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot Type
= leaf_reader (parse_sum_cases' t pc k)
let read_sum_cases_t_eq
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
(x y : read_sum_cases_t t pc k)
: GTot Type0
= True
inline_for_extraction
let read_sum_cases_t_if
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (if_combinator _ (read_sum_cases_t_eq t pc k))
= fun cond (sv_true: cond_true cond -> Tot (read_sum_cases_t t pc k)) (sv_false: cond_false cond -> Tot (read_sum_cases_t t pc k)) #_ #_ input pos ->
if cond
then (sv_true () input pos)
else (sv_false () input pos)
inline_for_extraction
let read_sum_cases
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (leaf_reader (dsnd (pc x)))))
(destr: dep_enum_destr (sum_enum t) (read_sum_cases_t t pc))
(k: sum_key t)
: Tot (leaf_reader (parse_sum_cases' t pc k))
= destr
_
(read_sum_cases_t_if t pc)
(fun _ _ -> ())
(fun _ _ _ _ -> ())
(read_sum_cases' t pc pc32)
k
#push-options "--z3rlimit 32"
inline_for_extraction
let read_sum
(#kt: parser_kind)
(t: sum)
(p: parser kt (sum_repr_type t))
(p32: leaf_reader (parse_enum_key p (sum_enum t)))
(j: jumper p)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (leaf_reader (dsnd (pc x)))))
(destr: dep_enum_destr (sum_enum t) (read_sum_cases_t t pc))
: Tot (leaf_reader (parse_sum t p pc))
=
fun #_ #_ input pos ->
let h = HST.get () in
valid_facts (parse_sum t p pc) h input pos;
parse_sum_eq' t p pc (bytes_of_slice_from h input pos);
valid_facts (parse_enum_key p (sum_enum t)) h input pos;
let k = p32 input pos in
let pos' = jump_enum_key j (sum_enum t) input pos in
valid_facts (parse_sum_cases' t pc k) h input pos' ;
read_sum_cases t pc pc32 destr k input pos'
#pop-options
inline_for_extraction
let serialize32_sum_cases_t
(t: sum)
(#pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(sc: ((x: sum_key t) -> Tot (serializer (dsnd (pc x)))))
(k: sum_key t)
: Tot Type
= serializer32 (serialize_sum_cases t pc sc k)
let serialize32_sum_cases_t_eq
(t: sum)
(#pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(sc: ((x: sum_key t) -> Tot (serializer (dsnd (pc x)))))
(k: sum_key t)
(x y: serialize32_sum_cases_t t sc k)
: GTot Type0
= True
inline_for_extraction
let serialize32_sum_cases_t_if
(t: sum)
(#pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(sc: ((x: sum_key t) -> Tot (serializer (dsnd (pc x)))))
(k: sum_key t)
: Tot (if_combinator _ (serialize32_sum_cases_t_eq t sc k))
= fun cond (sv_true: (cond_true cond -> Tot (serialize32_sum_cases_t t sc k))) (sv_false: (cond_false cond -> Tot (serialize32_sum_cases_t t sc k))) x #rrel #rel b pos ->
if cond
then (sv_true () x b pos)
else (sv_false () x b pos)
inline_for_extraction
let serialize32_sum_cases_aux
(t: sum)
(#pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(sc: ((x: sum_key t) -> Tot (serializer (dsnd (pc x)))))
(sc32: ((x: sum_key t) -> Tot (serializer32 (sc x))))
(k: sum_key t)
: Tot (serializer32 (serialize_sum_cases t pc sc k))
= fun x #rrel #rel b pos ->
[@inline_let] let _ =
Classical.forall_intro (parse_sum_cases_eq' t pc k);
synth_sum_case_injective t k;
synth_sum_case_inverse t k
in
serialize32_synth
(sc32 k)
(synth_sum_case t k)
(synth_sum_case_recip t k)
(fun x -> synth_sum_case_recip t k x)
()
x
b
pos
inline_for_extraction
let serialize32_sum_cases
(t: sum)
(#pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(sc: ((x: sum_key t) -> Tot (serializer (dsnd (pc x)))))
(sc32: ((x: sum_key t) -> Tot (serializer32 (sc x))))
(destr: dep_enum_destr (sum_enum t) (serialize32_sum_cases_t t sc))
(k: sum_key t)
: Tot (serializer32 (serialize_sum_cases t pc sc k))
= destr
_
(serialize32_sum_cases_t_if t sc)
(fun _ _ -> ())
(fun _ _ _ _ -> ())
(serialize32_sum_cases_aux t sc sc32)
k | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"LowStar.Buffer.fst.checked",
"LowParse.Spec.Sum.fst.checked",
"LowParse.Low.Enum.fst.checked",
"FStar.UInt64.fsti.checked",
"FStar.UInt32.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Int.Cast.fst.checked",
"FStar.HyperStack.ST.fsti.checked",
"FStar.HyperStack.fst.checked",
"FStar.Classical.fsti.checked"
],
"interface_file": false,
"source_file": "LowParse.Low.Sum.fst"
} | [
{
"abbrev": true,
"full_module": "FStar.HyperStack",
"short_module": "HS"
},
{
"abbrev": true,
"full_module": "FStar.UInt64",
"short_module": "U64"
},
{
"abbrev": true,
"full_module": "FStar.Int.Cast",
"short_module": "Cast"
},
{
"abbrev": true,
"full_module": "LowStar.Buffer",
"short_module": "B"
},
{
"abbrev": true,
"full_module": "FStar.HyperStack.ST",
"short_module": "HST"
},
{
"abbrev": true,
"full_module": "FStar.UInt32",
"short_module": "U32"
},
{
"abbrev": false,
"full_module": "LowParse.Spec.Sum",
"short_module": null
},
{
"abbrev": false,
"full_module": "LowParse.Low.Enum",
"short_module": null
},
{
"abbrev": false,
"full_module": "LowParse.Low",
"short_module": null
},
{
"abbrev": false,
"full_module": "LowParse.Low",
"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",
"short_module": null
}
] | {
"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_elim_box": false,
"smtencoding_l_arith_repr": "boxwrap",
"smtencoding_nl_arith_repr": "boxwrap",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": true,
"z3cliopt": [],
"z3refresh": false,
"z3rlimit": 5,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | false |
t: LowParse.Spec.Sum.sum ->
s:
LowParse.Spec.Base.serializer p
{ Mkparser_kind'?.parser_kind_subkind kt ==
FStar.Pervasives.Native.Some LowParse.Spec.Base.ParserStrong } ->
s32:
LowParse.Low.Base.serializer32 (LowParse.Spec.Enum.serialize_enum_key p
s
(LowParse.Spec.Sum.sum_enum t)) ->
sc:
(x: LowParse.Spec.Sum.sum_key t
-> LowParse.Spec.Base.serializer (FStar.Pervasives.dsnd (pc x))) ->
sc32: (x: LowParse.Spec.Sum.sum_key t -> LowParse.Low.Base.serializer32 (sc x)) ->
destr:
LowParse.Spec.Enum.dep_enum_destr (LowParse.Spec.Sum.sum_enum t)
(LowParse.Low.Sum.serialize32_sum_cases_t t sc)
-> LowParse.Low.Base.serializer32 (LowParse.Spec.Sum.serialize_sum t s sc) | Prims.Tot | [
"total"
] | [] | [
"LowParse.Spec.Base.parser_kind",
"LowParse.Spec.Sum.sum",
"LowParse.Spec.Base.parser",
"LowParse.Spec.Sum.sum_repr_type",
"LowParse.Spec.Base.serializer",
"Prims.eq2",
"FStar.Pervasives.Native.option",
"LowParse.Spec.Base.parser_subkind",
"LowParse.Spec.Base.__proj__Mkparser_kind'__item__parser_kind_subkind",
"FStar.Pervasives.Native.Some",
"LowParse.Spec.Base.ParserStrong",
"LowParse.Low.Base.serializer32",
"LowParse.Spec.Combinators.parse_filter_kind",
"LowParse.Spec.Enum.enum_key",
"LowParse.Spec.Sum.sum_key_type",
"LowParse.Spec.Sum.sum_enum",
"LowParse.Spec.Enum.parse_enum_key",
"LowParse.Spec.Enum.serialize_enum_key",
"LowParse.Spec.Sum.sum_key",
"Prims.dtuple2",
"LowParse.Spec.Sum.sum_type_of_tag",
"Prims.__proj__Mkdtuple2__item___1",
"FStar.Pervasives.dsnd",
"LowParse.Spec.Enum.dep_enum_destr",
"LowParse.Low.Sum.serialize32_sum_cases_t",
"LowParse.Spec.Sum.sum_type",
"LowStar.Monotonic.Buffer.srel",
"LowParse.Bytes.byte",
"LowStar.Monotonic.Buffer.mbuffer",
"FStar.UInt32.t",
"LowParse.Low.Combinators.serialize32_nondep_then_aux",
"LowParse.Spec.Sum.weaken_parse_cases_kind",
"LowParse.Spec.Sum.sum_cases",
"LowParse.Spec.Sum.parse_sum_cases",
"LowParse.Spec.Sum.serialize_sum_cases",
"LowParse.Low.Sum.serialize32_sum_cases",
"LowParse.Spec.Sum.sum_tag_of_data",
"Prims.unit",
"LowParse.Spec.Sum.serialize_sum_eq",
"LowParse.Spec.Sum.parse_sum_kind",
"LowParse.Spec.Sum.parse_sum",
"LowParse.Spec.Sum.serialize_sum"
] | [] | false | false | false | false | false | let serialize32_sum
(#kt: parser_kind)
(t: sum)
(#p: parser kt (sum_repr_type t))
(s: serializer p {kt.parser_kind_subkind == Some ParserStrong})
(s32: serializer32 (serialize_enum_key _ s (sum_enum t)))
(#pc: (x: sum_key t -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(sc: (x: sum_key t -> Tot (serializer (dsnd (pc x)))))
(sc32: (x: sum_key t -> Tot (serializer32 (sc x))))
(destr: dep_enum_destr (sum_enum t) (serialize32_sum_cases_t t sc))
: Tot (serializer32 (serialize_sum t s sc)) =
| fun x #rrel #rel b pos ->
serialize_sum_eq t s sc x;
let tg = sum_tag_of_data t x in
serialize32_nondep_then_aux s32 (serialize32_sum_cases t sc sc32 destr tg) tg x b pos | false |
LowParse.Low.Sum.fst | LowParse.Low.Sum.jump_dsum_cases_eq | val jump_dsum_cases_eq
(s: dsum)
(f: (x: dsum_known_key s -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x))))
(#k: parser_kind)
(g: parser k (dsum_type_of_unknown_tag s))
(x: dsum_key s)
(v1 v2: jump_dsum_cases_t s f g x)
: GTot Type0 | val jump_dsum_cases_eq
(s: dsum)
(f: (x: dsum_known_key s -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x))))
(#k: parser_kind)
(g: parser k (dsum_type_of_unknown_tag s))
(x: dsum_key s)
(v1 v2: jump_dsum_cases_t s f g x)
: GTot Type0 | let jump_dsum_cases_eq
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(#k: parser_kind)
(g: parser k (dsum_type_of_unknown_tag s))
(x: dsum_key s)
(v1 v2 : jump_dsum_cases_t s f g x)
: GTot Type0
= True | {
"file_name": "src/lowparse/LowParse.Low.Sum.fst",
"git_rev": "00217c4a89f5ba56002ba9aa5b4a9d5903bfe9fa",
"git_url": "https://github.com/project-everest/everparse.git",
"project_name": "everparse"
} | {
"end_col": 6,
"end_line": 1391,
"start_col": 0,
"start_line": 1383
} | module LowParse.Low.Sum
include LowParse.Low.Enum
include LowParse.Spec.Sum
module U32 = FStar.UInt32
module HST = FStar.HyperStack.ST
module B = LowStar.Buffer
module Cast = FStar.Int.Cast
module U64 = FStar.UInt64
inline_for_extraction
let validate_sum_cases_aux
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(vc: ((x: sum_key t) -> Tot (validator (dsnd (pc x)))))
(k: sum_key t)
: Tot (validator (parse_sum_cases t pc k))
= [@inline_let]
let _ = synth_sum_case_injective t k in
validate_synth
(validate_weaken
(weaken_parse_cases_kind t pc)
(vc k)
()
)
(synth_sum_case t k)
()
inline_for_extraction
let validate_sum_cases_t
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot Type
= validator (parse_sum_cases t pc k)
let validate_sum_cases_t_eq
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
(x y : validate_sum_cases_t t pc k)
: GTot Type0
= True
inline_for_extraction
let validate_sum_cases_t_if
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (if_combinator _ (validate_sum_cases_t_eq t pc k))
= fun cond (sv_true: cond_true cond -> Tot (validate_sum_cases_t t pc k)) (sv_false: cond_false cond -> Tot (validate_sum_cases_t t pc k)) #rrel #rel input pos ->
if cond
then sv_true () input pos
else sv_false () input pos
inline_for_extraction
let validate_sum_cases
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(vc: ((x: sum_key t) -> Tot (validator (dsnd (pc x)))))
(destr: dep_enum_destr (sum_enum t) (validate_sum_cases_t t pc))
(k: sum_key t)
: Tot (validator (parse_sum_cases t pc k))
= destr
_
(validate_sum_cases_t_if t pc)
(fun _ _ -> ())
(fun _ _ _ _ -> ())
(validate_sum_cases_aux t pc vc)
k
inline_for_extraction
let validate_sum_aux_payload_t
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
: Tot Type
= (#rrel: _) -> (#rel: _) ->
(input: slice rrel rel) ->
(pos: U64.t) ->
HST.Stack U64.t
(requires (fun h -> live_slice h input /\ U64.v pos <= U32.v input.len))
(ensures (fun h res h' ->
B.modifies B.loc_none h h' /\ (
match k with
| Unknown _ -> is_error res
| Known k' ->
if is_success res
then
valid_pos (dsnd (pc k')) h input (uint64_to_uint32 pos) (uint64_to_uint32 res)
else
(~ (valid (dsnd (pc k')) h input (uint64_to_uint32 pos)))
)))
let validate_sum_aux_payload_eq
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
: Tot (validate_sum_aux_payload_t t pc k -> validate_sum_aux_payload_t t pc k -> GTot Type0)
= fun _ _ -> True
inline_for_extraction
let validate_sum_aux_payload_if'
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
(cond: bool)
(ift: ((cond_true cond) -> Tot (validate_sum_aux_payload_t t pc k)))
(iff: ((cond_false cond) -> Tot (validate_sum_aux_payload_t t pc k)))
: Tot (validate_sum_aux_payload_t t pc k)
= fun #rrel #rel input pos ->
if cond
then begin
(ift () <: validate_sum_aux_payload_t t pc k) input pos
end else
(iff () <: validate_sum_aux_payload_t t pc k) input pos
inline_for_extraction
let validate_sum_aux_payload_if
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
: Tot (if_combinator _ (validate_sum_aux_payload_eq t pc k))
= validate_sum_aux_payload_if' t pc k
#push-options "--z3rlimit 64 --z3cliopt smt.arith.nl=false --using_facts_from '* -FStar.Int.Cast -LowParse.BitFields'"
// --query_stats --smtencoding.elim_box true --smtencoding.l_arith_repr native --z3refresh"
inline_for_extraction
let validate_sum_aux
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(v: validator p)
(p32: leaf_reader p)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(v_payload: ((k: sum_repr_type t)) -> Tot (validate_sum_aux_payload_t t pc (maybe_enum_key_of_repr (sum_enum t) k)))
: Tot (validator (parse_sum t p pc))
= fun #rrel #rel input pos ->
let h = HST.get () in
[@inline_let]
let _ = parse_sum_eq'' t p pc (bytes_of_slice_from h input (uint64_to_uint32 pos)) in
[@inline_let]
let _ = valid_facts (parse_sum t p pc) h input (uint64_to_uint32 pos) in
[@inline_let]
let _ = valid_facts p h input (uint64_to_uint32 pos) in
let len_after_tag = v input pos in
if is_error len_after_tag
then len_after_tag
else begin
let h1 = HST.get () in
let k' = p32 input (uint64_to_uint32 pos) in
[@inline_let]
let _ =
match maybe_enum_key_of_repr (sum_enum t) k' with
| Known k -> valid_facts (dsnd (pc k)) h input (uint64_to_uint32 len_after_tag)
| _ -> ()
in
v_payload k' input len_after_tag
end
#pop-options
inline_for_extraction
let validate_sum_aux_payload'
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (validator (dsnd (pc x)))))
(k: maybe_enum_key (sum_enum t))
: Tot (validate_sum_aux_payload_t t pc k)
= fun #rrel #rel input pos ->
match k with
| Known k ->
[@inline_let]
let _ = synth_sum_case_injective t k in
pc32 k input pos
// validate_synth (pc32 k) (synth_sum_case t k) () input pos
| _ -> validator_error_generic
inline_for_extraction
let validate_sum_aux_payload
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (validator (dsnd (pc x)))))
(destr: dep_maybe_enum_destr_t (sum_enum t) (validate_sum_aux_payload_t t pc))
(k: sum_repr_type t)
: Tot (validate_sum_aux_payload_t t pc (maybe_enum_key_of_repr (sum_enum t) k))
= destr (validate_sum_aux_payload_eq t pc) (validate_sum_aux_payload_if t pc) (fun _ _ -> ()) (fun _ _ _ _ -> ()) (validate_sum_aux_payload' t pc pc32) k
inline_for_extraction
let validate_sum
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(v: validator p)
(p32: leaf_reader p)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (validator (dsnd (pc x)))))
(destr: dep_maybe_enum_destr_t (sum_enum t) (validate_sum_aux_payload_t t pc))
: Tot (validator (parse_sum t p pc))
= validate_sum_aux t v p32 pc (validate_sum_aux_payload t pc pc32 destr)
module HS = FStar.HyperStack
#push-options "--z3rlimit 256 --z3cliopt smt.arith.nl=false --initial_ifuel 8 --max_ifuel 8 --initial_fuel 2 --max_fuel 2"
#restart-solver
let valid_sum_intro
(h: HS.mem)
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: Lemma
(requires (
valid (parse_enum_key p (sum_enum t)) h input pos /\ (
let k = contents (parse_enum_key p (sum_enum t)) h input pos in
valid (dsnd (pc k)) h input (get_valid_pos (parse_enum_key p (sum_enum t)) h input pos)
)))
(ensures (
let k = contents (parse_enum_key p (sum_enum t)) h input pos in
let pos_payload = get_valid_pos (parse_enum_key p (sum_enum t)) h input pos in
valid_content_pos
(parse_sum t p pc) h input pos
(synth_sum_case t k (contents (dsnd (pc k)) h input pos_payload))
(get_valid_pos (dsnd (pc k)) h input pos_payload)
))
= valid_facts (parse_enum_key p (sum_enum t)) h input pos;
let k = contents (parse_enum_key p (sum_enum t)) h input pos in
let pos_payload = get_valid_pos (parse_enum_key p (sum_enum t)) h input pos in
valid_facts (dsnd (pc k)) h input pos_payload;
valid_facts (parse_sum t p pc) h input pos;
parse_sum_eq t p pc (bytes_of_slice_from h input pos)
#pop-options
inline_for_extraction
let finalize_sum_case
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(s: serializer p)
(w: leaf_writer_strong s)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(destr: enum_repr_of_key'_t (sum_enum t))
(k: sum_key t)
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: HST.Stack unit
(requires (fun h ->
let len_tag = serialized_length (serialize_enum_key _ s (sum_enum t)) k in
U32.v pos + len_tag < 4294967296 /\ (
let pos_payload = pos `U32.add` U32.uint_to_t len_tag in
valid (dsnd (pc k)) h input pos_payload /\
writable input.base (U32.v pos) (U32.v pos_payload) h
)))
(ensures (fun h _ h' ->
let len_tag = serialized_length (serialize_enum_key _ s (sum_enum t)) k in
let pos_payload = pos `U32.add` U32.uint_to_t len_tag in
B.modifies (loc_slice_from_to input pos pos_payload) h h' /\
valid_content_pos (parse_sum t p pc) h' input pos (synth_sum_case t k (contents (dsnd (pc k)) h input pos_payload)) (get_valid_pos (dsnd (pc k)) h input pos_payload)
))
= let pos1 = write_enum_key w (sum_enum t) destr k input pos in
let h = HST.get () in
[@inline_let]
let _ = valid_sum_intro h t p pc input pos in
()
inline_for_extraction
let jump_sum_cases_aux
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(vc: ((x: sum_key t) -> Tot (jumper (dsnd (pc x)))))
(k: sum_key t)
: Tot (jumper (parse_sum_cases t pc k))
= [@inline_let]
let _ = synth_sum_case_injective t k in
jump_synth
(jump_weaken
(weaken_parse_cases_kind t pc)
(vc k)
()
)
(synth_sum_case t k)
()
inline_for_extraction
let jump_sum_cases_t
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot Type
= jumper (parse_sum_cases t pc k)
let jump_sum_cases_t_eq
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
(x y : jump_sum_cases_t t pc k)
: GTot Type0
= True
inline_for_extraction
let jump_sum_cases_t_if
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (if_combinator _ (jump_sum_cases_t_eq t pc k))
= fun cond (sv_true: cond_true cond -> Tot (jump_sum_cases_t t pc k)) (sv_false: cond_false cond -> Tot (jump_sum_cases_t t pc k)) #rrel #rel input pos ->
if cond
then sv_true () input pos
else sv_false () input pos
inline_for_extraction
let jump_sum_cases
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(vc: ((x: sum_key t) -> Tot (jumper (dsnd (pc x)))))
(destr: dep_enum_destr (sum_enum t) (jump_sum_cases_t t pc))
(k: sum_key t)
: Tot (jumper (parse_sum_cases t pc k))
= destr
_
(jump_sum_cases_t_if t pc)
(fun _ _ -> ())
(fun _ _ _ _ -> ())
(jump_sum_cases_aux t pc vc)
k
inline_for_extraction
let jump_sum_aux_payload_t
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
: Tot Type
= (#rrel: _) -> (#rel: _) ->
(input: slice rrel rel) ->
(pos: U32.t) ->
HST.Stack U32.t
(requires (fun h -> live_slice h input /\ U32.v pos <= U32.v input.len /\ (
match k with
| Unknown _ -> False
| Known k' -> valid (dsnd (pc k')) h input pos
)))
(ensures (fun h res h' ->
B.modifies B.loc_none h h' /\ (
match k with
| Unknown _ -> False
| Known k' ->
valid_pos (dsnd (pc k')) h input pos res
)))
let jump_sum_aux_payload_eq
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
: Tot (jump_sum_aux_payload_t t pc k -> jump_sum_aux_payload_t t pc k -> GTot Type0)
= fun _ _ -> True
inline_for_extraction
let jump_sum_aux_payload_if'
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
(cond: bool)
(ift: ((cond_true cond) -> Tot (jump_sum_aux_payload_t t pc k)))
(iff: ((cond_false cond) -> Tot (jump_sum_aux_payload_t t pc k)))
: Tot (jump_sum_aux_payload_t t pc k)
= fun #rrel #rel input pos ->
if cond
then begin
(ift () <: jump_sum_aux_payload_t t pc k) input pos
end else
(iff () <: jump_sum_aux_payload_t t pc k) input pos
inline_for_extraction
let jump_sum_aux_payload_if
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
: Tot (if_combinator _ (jump_sum_aux_payload_eq t pc k))
= jump_sum_aux_payload_if' t pc k
let parse_sum_eq3
(#kt: parser_kind)
(t: sum)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(input: bytes)
(k' : sum_repr_type t)
(consumed_k: consumed_length input)
: Lemma
(requires (Some? (parse (parse_sum t p pc) input) /\ parse p input == Some (k', consumed_k)))
(ensures (
let input_k = Seq.slice input consumed_k (Seq.length input) in
let k = maybe_enum_key_of_repr (sum_enum t) k' in
begin match k with
| Known k ->
Some? (parse (dsnd (pc k)) input_k)
| _ -> False
end
))
= parse_sum_eq'' t p pc input
let parse_sum_eq4
(#kt: parser_kind)
(t: sum)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(input: bytes)
(k' : sum_repr_type t)
(consumed_k: consumed_length input)
(consumed_payload: nat)
: Lemma
(requires (Some? (parse (parse_sum t p pc) input) /\ parse p input == Some (k', consumed_k) /\ (
let input_k = Seq.slice input consumed_k (Seq.length input) in
let k = maybe_enum_key_of_repr (sum_enum t) k' in
begin match k with
| Known k ->
Some? (parse (dsnd (pc k)) input_k) /\ (
let Some (_, consumed_payload') = parse (dsnd (pc k)) input_k in
consumed_payload' == consumed_payload
)
| _ -> False
end
)))
(ensures (
let Some (_, consumed) = parse (parse_sum t p pc) input in
consumed == consumed_k + consumed_payload
))
= parse_sum_eq'' t p pc input
#push-options "--z3rlimit 16"
let valid_sum_elim
(h: HS.mem)
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(#rrel: _) (#rel: _)
(input: slice rrel rel)
(pos: U32.t)
: Lemma
(requires (
valid (parse_sum t p pc) h input pos
))
(ensures (
valid p h input pos /\ (
let pos_payload = get_valid_pos p h input pos in
let k' = maybe_enum_key_of_repr (sum_enum t) (contents p h input pos) in
match k' with
| Known k ->
k == sum_tag_of_data t (contents (parse_sum t p pc) h input pos) /\
valid (dsnd (pc k)) h input pos_payload /\
valid_pos
(parse_sum t p pc) h input pos
(get_valid_pos (dsnd (pc k)) h input pos_payload)
| _ -> False
)))
= let sinput = bytes_of_slice_from h input pos in
let _ = parse_sum_eq'' t p pc sinput in
[@inline_let]
let _ = valid_facts (parse_sum t p pc) h input pos in
let Some (k', consumed_k) = parse p sinput in
let pos_after_tag = U32.uint_to_t (U32.v pos + consumed_k) in
[@inline_let]
let _ = valid_facts p h input pos in
assert (valid_content_pos p h input pos k' pos_after_tag);
match maybe_enum_key_of_repr (sum_enum t) k' with
| Known k -> valid_facts (dsnd (pc k)) h input pos_after_tag
| _ -> ()
#pop-options
let valid_sum_elim_tag
(h: HS.mem)
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: Lemma
(requires (
valid (parse_sum t p pc) h input pos
))
(ensures (
valid (parse_enum_key p (sum_enum t)) h input pos /\
contents (parse_enum_key p (sum_enum t)) h input pos == sum_tag_of_data t (contents (parse_sum t p pc) h input pos)
))
= let _ = parse_sum_eq' t p pc (bytes_of_slice_from h input pos) in
let _ = valid_facts (parse_sum t p pc) h input pos in
let _ = valid_facts (parse_enum_key p (sum_enum t)) h input pos in
()
inline_for_extraction
let read_sum_tag
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(p32: leaf_reader p)
(destr: dep_maybe_enum_destr_t (sum_enum t) (read_enum_key_t (sum_enum t)))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: HST.Stack (sum_key t)
(requires (fun h ->
valid (parse_sum t p pc) h input pos
))
(ensures (fun h res h' ->
B.modifies B.loc_none h h' /\
res == sum_tag_of_data t (contents (parse_sum t p pc) h input pos)
))
= let h = HST.get () in
[@inline_let] let _ = valid_sum_elim_tag h t p pc input pos in
read_enum_key p32 (sum_enum t) destr input pos
inline_for_extraction
let jump_sum_aux
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(v: jumper p)
(p32: leaf_reader p)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(v_payload: ((k: sum_repr_type t)) -> Tot (jump_sum_aux_payload_t t pc (maybe_enum_key_of_repr (sum_enum t) k)))
: Tot (jumper (parse_sum t p pc))
= fun #rrel #rel input pos ->
let h = HST.get () in
[@inline_let]
let _ = valid_sum_elim h t p pc input pos in
let pos_after_tag = v input pos in
let k' = p32 input pos in
v_payload k' input pos_after_tag
inline_for_extraction
let jump_sum_aux_payload'
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (jumper (dsnd (pc x)))))
(k: maybe_enum_key (sum_enum t))
: Tot (jump_sum_aux_payload_t t pc k)
= fun #rrel #rel input pos ->
match k with
| Known k ->
[@inline_let]
let _ = synth_sum_case_injective t k in
pc32 k input pos
| _ -> 0ul // dummy, but we MUST NOT remove this branch, otherwise extraction fails
inline_for_extraction
let jump_sum_aux_payload
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (jumper (dsnd (pc x)))))
(destr: dep_maybe_enum_destr_t (sum_enum t) (jump_sum_aux_payload_t t pc))
(k: sum_repr_type t)
: Tot (jump_sum_aux_payload_t t pc (maybe_enum_key_of_repr (sum_enum t) k))
= destr (jump_sum_aux_payload_eq t pc) (jump_sum_aux_payload_if t pc) (fun _ _ -> ()) (fun _ _ _ _ -> ()) (jump_sum_aux_payload' t pc pc32) k
inline_for_extraction
let jump_sum
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(v: jumper p)
(p32: leaf_reader p)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (jumper (dsnd (pc x)))))
(destr: dep_maybe_enum_destr_t (sum_enum t) (jump_sum_aux_payload_t t pc))
: Tot (jumper (parse_sum t p pc))
= jump_sum_aux t v p32 pc (jump_sum_aux_payload t pc pc32 destr)
inline_for_extraction
let read_sum_cases'
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (leaf_reader (dsnd (pc x)))))
(k: sum_key t)
: Tot (leaf_reader (parse_sum_cases' t pc k))
= [@inline_let]
let _ = synth_sum_case_injective t k in
read_synth'
(dsnd (pc k))
(synth_sum_case t k)
(pc32 k)
()
inline_for_extraction
let read_sum_cases_t
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot Type
= leaf_reader (parse_sum_cases' t pc k)
let read_sum_cases_t_eq
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
(x y : read_sum_cases_t t pc k)
: GTot Type0
= True
inline_for_extraction
let read_sum_cases_t_if
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (if_combinator _ (read_sum_cases_t_eq t pc k))
= fun cond (sv_true: cond_true cond -> Tot (read_sum_cases_t t pc k)) (sv_false: cond_false cond -> Tot (read_sum_cases_t t pc k)) #_ #_ input pos ->
if cond
then (sv_true () input pos)
else (sv_false () input pos)
inline_for_extraction
let read_sum_cases
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (leaf_reader (dsnd (pc x)))))
(destr: dep_enum_destr (sum_enum t) (read_sum_cases_t t pc))
(k: sum_key t)
: Tot (leaf_reader (parse_sum_cases' t pc k))
= destr
_
(read_sum_cases_t_if t pc)
(fun _ _ -> ())
(fun _ _ _ _ -> ())
(read_sum_cases' t pc pc32)
k
#push-options "--z3rlimit 32"
inline_for_extraction
let read_sum
(#kt: parser_kind)
(t: sum)
(p: parser kt (sum_repr_type t))
(p32: leaf_reader (parse_enum_key p (sum_enum t)))
(j: jumper p)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (leaf_reader (dsnd (pc x)))))
(destr: dep_enum_destr (sum_enum t) (read_sum_cases_t t pc))
: Tot (leaf_reader (parse_sum t p pc))
=
fun #_ #_ input pos ->
let h = HST.get () in
valid_facts (parse_sum t p pc) h input pos;
parse_sum_eq' t p pc (bytes_of_slice_from h input pos);
valid_facts (parse_enum_key p (sum_enum t)) h input pos;
let k = p32 input pos in
let pos' = jump_enum_key j (sum_enum t) input pos in
valid_facts (parse_sum_cases' t pc k) h input pos' ;
read_sum_cases t pc pc32 destr k input pos'
#pop-options
inline_for_extraction
let serialize32_sum_cases_t
(t: sum)
(#pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(sc: ((x: sum_key t) -> Tot (serializer (dsnd (pc x)))))
(k: sum_key t)
: Tot Type
= serializer32 (serialize_sum_cases t pc sc k)
let serialize32_sum_cases_t_eq
(t: sum)
(#pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(sc: ((x: sum_key t) -> Tot (serializer (dsnd (pc x)))))
(k: sum_key t)
(x y: serialize32_sum_cases_t t sc k)
: GTot Type0
= True
inline_for_extraction
let serialize32_sum_cases_t_if
(t: sum)
(#pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(sc: ((x: sum_key t) -> Tot (serializer (dsnd (pc x)))))
(k: sum_key t)
: Tot (if_combinator _ (serialize32_sum_cases_t_eq t sc k))
= fun cond (sv_true: (cond_true cond -> Tot (serialize32_sum_cases_t t sc k))) (sv_false: (cond_false cond -> Tot (serialize32_sum_cases_t t sc k))) x #rrel #rel b pos ->
if cond
then (sv_true () x b pos)
else (sv_false () x b pos)
inline_for_extraction
let serialize32_sum_cases_aux
(t: sum)
(#pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(sc: ((x: sum_key t) -> Tot (serializer (dsnd (pc x)))))
(sc32: ((x: sum_key t) -> Tot (serializer32 (sc x))))
(k: sum_key t)
: Tot (serializer32 (serialize_sum_cases t pc sc k))
= fun x #rrel #rel b pos ->
[@inline_let] let _ =
Classical.forall_intro (parse_sum_cases_eq' t pc k);
synth_sum_case_injective t k;
synth_sum_case_inverse t k
in
serialize32_synth
(sc32 k)
(synth_sum_case t k)
(synth_sum_case_recip t k)
(fun x -> synth_sum_case_recip t k x)
()
x
b
pos
inline_for_extraction
let serialize32_sum_cases
(t: sum)
(#pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(sc: ((x: sum_key t) -> Tot (serializer (dsnd (pc x)))))
(sc32: ((x: sum_key t) -> Tot (serializer32 (sc x))))
(destr: dep_enum_destr (sum_enum t) (serialize32_sum_cases_t t sc))
(k: sum_key t)
: Tot (serializer32 (serialize_sum_cases t pc sc k))
= destr
_
(serialize32_sum_cases_t_if t sc)
(fun _ _ -> ())
(fun _ _ _ _ -> ())
(serialize32_sum_cases_aux t sc sc32)
k
inline_for_extraction
let serialize32_sum
(#kt: parser_kind)
(t: sum)
(#p: parser kt (sum_repr_type t))
(s: serializer p {kt.parser_kind_subkind == Some ParserStrong})
(s32: serializer32 (serialize_enum_key _ s (sum_enum t)))
(#pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(sc: ((x: sum_key t) -> Tot (serializer (dsnd (pc x)))))
(sc32: ((x: sum_key t) -> Tot (serializer32 (sc x))))
(destr: dep_enum_destr (sum_enum t) (serialize32_sum_cases_t t sc))
: Tot (serializer32 (serialize_sum t s sc))
= fun x #rrel #rel b pos ->
serialize_sum_eq t s sc x;
let tg = sum_tag_of_data t x in
serialize32_nondep_then_aux s32 (serialize32_sum_cases t sc sc32 destr tg) tg x b pos
let clens_sum_tag
(s: sum)
: Tot (clens (sum_type s) (sum_key s))
= {
clens_cond = (fun _ -> True);
clens_get = sum_tag_of_data s;
}
let gaccessor_sum_tag
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
: Tot (gaccessor (parse_sum t p pc) (parse_enum_key p (sum_enum t)) (clens_sum_tag t))
= gaccessor_tagged_union_tag
(parse_enum_key p (sum_enum t))
(sum_tag_of_data t)
(parse_sum_cases t pc)
inline_for_extraction
let accessor_sum_tag
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
: Tot (accessor (gaccessor_sum_tag t p pc))
= accessor_tagged_union_tag
(parse_enum_key p (sum_enum t))
(sum_tag_of_data t)
(parse_sum_cases t pc)
let clens_sum_payload
(s: sum)
(k: sum_key s)
: Tot (clens (sum_type s) (sum_type_of_tag s k))
= {
clens_cond = (fun (x: sum_type s) -> sum_tag_of_data s x == k);
clens_get = (fun (x: sum_type s) -> synth_sum_case_recip s k x <: Ghost (sum_type_of_tag s k) (requires (sum_tag_of_data s x == k)) (ensures (fun _ -> True)));
}
#push-options "--z3rlimit 32"
let gaccessor_clens_sum_payload'
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (gaccessor' (parse_sum t p pc) (dsnd (pc k)) (clens_sum_payload t k))
= fun (input: bytes) ->
parse_sum_eq'' t p pc input;
let res =
match parse p input with
| Some (_, consumed) ->
synth_sum_case_inverse t k;
synth_sum_case_injective t k;
synth_injective_synth_inverse_synth_inverse_recip (synth_sum_case t k) (synth_sum_case_recip t k) ();
(consumed)
| _ -> 0 // dummy
in
(res <: (res: _ { gaccessor_post' (parse_sum t p pc) (dsnd (pc k)) (clens_sum_payload t k) input res } ))
#push-options "--z3rlimit 64"
let gaccessor_clens_sum_payload_injective
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
(sl sl' : bytes)
: Lemma
(requires (
gaccessor_pre (parse_sum t p pc) (dsnd (pc k)) (clens_sum_payload t k) sl /\
gaccessor_pre (parse_sum t p pc) (dsnd (pc k)) (clens_sum_payload t k) sl' /\
injective_precond (parse_sum t p pc) sl sl'
))
(ensures (gaccessor_clens_sum_payload' t p pc k sl == gaccessor_clens_sum_payload' t p pc k sl'))
= parse_sum_eq'' t p pc sl;
parse_sum_eq'' t p pc sl' ;
parse_injective (parse_sum t p pc) sl sl' ;
parse_injective p sl sl'
#pop-options
let gaccessor_clens_sum_payload_no_lookahead
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
(sl sl' : bytes)
: Lemma
(requires (
(parse_sum_kind kt t pc).parser_kind_subkind == Some ParserStrong /\
gaccessor_pre (parse_sum t p pc) (dsnd (pc k)) (clens_sum_payload t k) sl /\
gaccessor_pre (parse_sum t p pc) (dsnd (pc k)) (clens_sum_payload t k) sl' /\
no_lookahead_on_precond (parse_sum t p pc) sl sl'
))
(ensures (gaccessor_clens_sum_payload' t p pc k sl == gaccessor_clens_sum_payload' t p pc k sl'))
= parse_sum_eq'' t p pc sl;
parse_sum_eq'' t p pc sl' ;
parse_strong_prefix (parse_sum t p pc) sl sl' ;
parse_injective p sl sl'
let gaccessor_clens_sum_payload
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (gaccessor (parse_sum t p pc) (dsnd (pc k)) (clens_sum_payload t k))
= Classical.forall_intro_2 (fun x -> Classical.move_requires (gaccessor_clens_sum_payload_injective t p pc k x));
Classical.forall_intro_2 (fun x -> Classical.move_requires (gaccessor_clens_sum_payload_no_lookahead t p pc k x));
gaccessor_prop_equiv (parse_sum t p pc) (dsnd (pc k)) (clens_sum_payload t k) (gaccessor_clens_sum_payload' t p pc k);
gaccessor_clens_sum_payload' t p pc k
inline_for_extraction
let accessor_clens_sum_payload'
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(j: jumper p)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: HST.Stack U32.t
(requires (fun h ->
valid (parse_sum t p pc) h input pos /\
(clens_sum_payload t k).clens_cond (contents (parse_sum t p pc) h input pos)
))
(ensures (fun h pos' h' ->
B.modifies B.loc_none h h' /\
pos' == slice_access h (gaccessor_clens_sum_payload t p pc k) input pos
))
=
let h = HST.get () in
[@inline_let]
let _ =
let pos' = get_valid_pos (parse_sum t p pc) h input pos in
let large = bytes_of_slice_from h input pos in
slice_access_eq h (gaccessor_clens_sum_payload t p pc k) input pos;
valid_facts (parse_sum t p pc) h input pos;
parse_sum_eq'' t p pc large;
valid_facts p h input pos
in
j input pos
#pop-options
inline_for_extraction
let accessor_clens_sum_payload
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(j: jumper p)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (accessor (gaccessor_clens_sum_payload t p pc k))
= fun #rrel #rel -> accessor_clens_sum_payload' t j pc k #rrel #rel
let clens_sum_cases_payload
(s: sum)
(k: sum_key s)
: Tot (clens (sum_cases s k) (sum_type_of_tag s k))
= {
clens_cond = (fun (x: sum_cases s k) -> True);
clens_get = (fun (x: sum_cases s k) -> synth_sum_case_recip s k x <: Ghost (sum_type_of_tag s k) (requires (True)) (ensures (fun _ -> True)));
}
let gaccessor_clens_sum_cases_payload
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (gaccessor (parse_sum_cases' t pc k) (dsnd (pc k)) (clens_sum_cases_payload t k))
= synth_sum_case_injective t k;
synth_sum_case_inverse t k;
synth_injective_synth_inverse_synth_inverse_recip (synth_sum_case t k) (synth_sum_case_recip t k) ();
gaccessor_ext
(gaccessor_synth (dsnd (pc k)) (synth_sum_case t k) (synth_sum_case_recip t k) ())
(clens_sum_cases_payload t k)
()
inline_for_extraction
let accessor_clens_sum_cases_payload
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (accessor (gaccessor_clens_sum_cases_payload t pc k))
= [@inline_let]
let _ =
synth_sum_case_injective t k;
synth_sum_case_inverse t k;
synth_injective_synth_inverse_synth_inverse_recip (synth_sum_case t k) (synth_sum_case_recip t k) ()
in
accessor_ext
(accessor_synth (dsnd (pc k)) (synth_sum_case t k) (synth_sum_case_recip t k) ())
(clens_sum_cases_payload t k)
()
inline_for_extraction
let validate_dsum_cases_t
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(#k: parser_kind)
(g: parser k (dsum_type_of_unknown_tag s))
(x: dsum_key s)
: Tot Type
= validator (parse_dsum_cases' s f g x)
let validate_dsum_cases_eq
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(#k: parser_kind)
(g: parser k (dsum_type_of_unknown_tag s))
(x: dsum_key s)
(v1 v2 : validate_dsum_cases_t s f g x)
: GTot Type0
= True
inline_for_extraction
let validate_dsum_cases_if'
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(#k: parser_kind)
(g: parser k (dsum_type_of_unknown_tag s))
(x: dsum_key s)
(cond: bool)
(ift: (cond_true cond -> Tot (validate_dsum_cases_t s f g x)))
(iff: (cond_false cond -> Tot (validate_dsum_cases_t s f g x)))
: Tot (validate_dsum_cases_t s f g x)
= fun #rrel #rel input len ->
if cond
then (ift () <: validate_dsum_cases_t s f g x) input len
else (iff () <: validate_dsum_cases_t s f g x) input len
inline_for_extraction
let validate_dsum_cases_if
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(#k: parser_kind)
(g: parser k (dsum_type_of_unknown_tag s))
(x: dsum_key s)
: Tot (if_combinator _ (validate_dsum_cases_eq s f g x))
= validate_dsum_cases_if' s f g x
inline_for_extraction
let validate_dsum_cases'
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(f' : (x: dsum_known_key s) -> Tot (validator (dsnd (f x))))
(#k: parser_kind)
(#g: parser k (dsum_type_of_unknown_tag s))
(g' : validator g)
(x: dsum_key s)
: Tot (validate_dsum_cases_t s f g x)
= [@inline_let]
let _ = synth_dsum_case_injective s x in
match x with
| Known x' -> validate_synth (f' x') (synth_dsum_case s (Known x')) () <: validator (parse_dsum_cases' s f g x)
| Unknown x' -> validate_synth g' (synth_dsum_case s (Unknown x')) () <: validator (parse_dsum_cases' s f g x)
inline_for_extraction
let validate_dsum_cases'_destr
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(f' : (x: dsum_known_key s) -> Tot (validator (dsnd (f x))))
(#k: parser_kind)
(#g: parser k (dsum_type_of_unknown_tag s))
(g' : validator g)
(destr: dep_enum_destr _ (fun k -> validate_dsum_cases_t s f g (Known k)))
(x: dsum_key s)
: Tot (validate_dsum_cases_t s f g x)
= fun #rrel #rel input pos ->
match x with
| Known k ->
destr
_
(fun k -> validate_dsum_cases_if s f g (Known k))
(fun _ _ -> ())
(fun _ _ _ _ -> ())
(fun k -> validate_dsum_cases' s f f' g' (Known k))
k
input
pos
| Unknown r -> validate_dsum_cases' s f f' g' (Unknown r) input pos
inline_for_extraction
let validate_dsum_cases
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(f' : (x: dsum_known_key s) -> Tot (validator (dsnd (f x))))
(#k: parser_kind)
(#g: parser k (dsum_type_of_unknown_tag s))
(g' : validator g)
(destr: dep_enum_destr _ (fun k -> validate_dsum_cases_t s f g (Known k)))
(x: dsum_key s)
: Tot (validator (parse_dsum_cases s f g x))
= fun #rrel #rel input pos ->
let h = HST.get () in
[@inline_let]
let _ =
valid_facts (parse_dsum_cases' s f g x) h input (uint64_to_uint32 pos);
valid_facts (parse_dsum_cases s f g x) h input (uint64_to_uint32 pos);
parse_dsum_cases_eq' s f g x (bytes_of_slice_from h input (uint64_to_uint32 pos))
in
validate_dsum_cases'_destr s f f' g' destr x input pos
#push-options "--z3rlimit 40"
inline_for_extraction
let validate_dsum
(#kt: parser_kind)
(t: dsum)
(#p: parser kt (dsum_repr_type t))
(v: validator p)
(p32: leaf_reader p)
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(f32: (x: dsum_known_key t) -> Tot (validator (dsnd (f x))))
(#k': parser_kind)
(#g: parser k' (dsum_type_of_unknown_tag t))
(g32: validator g)
(destr: dep_maybe_enum_destr_t (dsum_enum t) (validate_dsum_cases_t t f g))
: Tot (validator (parse_dsum t p f g))
= fun #rrel #rel input pos ->
let h = HST.get () in
[@inline_let]
let _ = parse_dsum_eq' t p f g (bytes_of_slice_from h input (uint64_to_uint32 pos)) in
[@inline_let]
let _ = valid_facts (parse_dsum t p f g) h input (uint64_to_uint32 pos) in
[@inline_let]
let _ = valid_facts p h input (uint64_to_uint32 pos) in
let pos_after_tag = v input pos in
if is_error pos_after_tag
then pos_after_tag
else
let tg = p32 input (uint64_to_uint32 pos) in
[@inline_let]
let _ = valid_facts (parse_dsum_cases' t f g (maybe_enum_key_of_repr (dsum_enum t) tg)) h input (uint64_to_uint32 pos_after_tag) in
destr (validate_dsum_cases_eq t f g) (validate_dsum_cases_if t f g) (fun _ _ -> ()) (fun _ _ _ _ -> ()) (validate_dsum_cases' t f f32 g32) tg input pos_after_tag
#pop-options
#reset-options "--z3rlimit 64 --z3cliopt smt.arith.nl=false --initial_ifuel 8 --max_ifuel 8 --initial_fuel 2 --max_fuel 2"
let valid_dsum_intro_known
(h: HS.mem)
(t: dsum)
(#kt: parser_kind)
(p: parser kt (dsum_repr_type t))
(f: ((x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x))))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: Lemma
(requires (
valid (parse_maybe_enum_key p (dsum_enum t)) h input pos /\ (
let k' = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
Known? k' /\ (
let Known k = k' in
valid (dsnd (f k)) h input (get_valid_pos (parse_maybe_enum_key p (dsum_enum t)) h input pos)
))))
(ensures (
let Known k = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
let pos_payload = get_valid_pos (parse_maybe_enum_key p (dsum_enum t)) h input pos in
valid_content_pos
(parse_dsum t p f g) h input pos
(synth_dsum_case t (Known k) (contents (dsnd (f k)) h input pos_payload))
(get_valid_pos (dsnd (f k)) h input pos_payload)
))
= valid_facts (parse_maybe_enum_key p (dsum_enum t)) h input pos;
let Known k = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
let pos_payload = get_valid_pos (parse_maybe_enum_key p (dsum_enum t)) h input pos in
valid_facts (dsnd (f k)) h input pos_payload;
valid_facts (parse_dsum t p f g) h input pos;
parse_dsum_eq t p f g (bytes_of_slice_from h input pos)
let valid_dsum_intro_unknown
(h: HS.mem)
(t: dsum)
(#kt: parser_kind)
(p: parser kt (dsum_repr_type t))
(f: ((x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x))))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: Lemma
(requires (
valid (parse_maybe_enum_key p (dsum_enum t)) h input pos /\ (
let k' = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
Unknown? k' /\
valid g h input (get_valid_pos (parse_maybe_enum_key p (dsum_enum t)) h input pos)
)))
(ensures (
let Unknown r = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
let pos_payload = get_valid_pos (parse_maybe_enum_key p (dsum_enum t)) h input pos in
valid_content_pos
(parse_dsum t p f g) h input pos
(synth_dsum_case t (Unknown r) (contents g h input pos_payload))
(get_valid_pos g h input pos_payload)
))
= valid_facts (parse_maybe_enum_key p (dsum_enum t)) h input pos;
let Unknown r = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
let pos_payload = get_valid_pos (parse_maybe_enum_key p (dsum_enum t)) h input pos in
valid_facts g h input pos_payload;
valid_facts (parse_dsum t p f g) h input pos;
parse_dsum_eq t p f g (bytes_of_slice_from h input pos)
#reset-options
inline_for_extraction
let finalize_dsum_case_known
(t: dsum)
(#kt: parser_kind)
(#p: parser kt (dsum_repr_type t))
(s: serializer p)
(w: leaf_writer_strong s)
(f: ((x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x))))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
(destr: enum_repr_of_key'_t (dsum_enum t))
(k: dsum_known_key t)
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: HST.Stack unit
(requires (fun h ->
let len_tag = serialized_length (serialize_enum_key _ s (dsum_enum t)) k in
U32.v pos + len_tag < 4294967296 /\ (
let pos_payload = pos `U32.add` U32.uint_to_t len_tag in
valid (dsnd (f k)) h input pos_payload /\
writable input.base (U32.v pos) (U32.v pos_payload) h
)))
(ensures (fun h _ h' ->
let len_tag = serialized_length (serialize_enum_key _ s (dsum_enum t)) k in
let pos_payload = pos `U32.add` U32.uint_to_t len_tag in
B.modifies (loc_slice_from_to input pos pos_payload) h h' /\
valid_content_pos (parse_dsum t p f g) h' input pos (synth_dsum_case t (Known k) (contents (dsnd (f k)) h input pos_payload)) (get_valid_pos (dsnd (f k)) h input pos_payload)
))
= let pos1 = write_enum_key w (dsum_enum t) destr k input pos in
let h = HST.get () in
[@inline_let]
let _ =
valid_facts (parse_enum_key p (dsum_enum t)) h input pos;
valid_facts (parse_maybe_enum_key p (dsum_enum t)) h input pos;
let sq = bytes_of_slice_from h input pos in
parse_enum_key_eq p (dsum_enum t) sq;
parse_maybe_enum_key_eq p (dsum_enum t) sq;
valid_dsum_intro_known h t p f g input pos
in
()
inline_for_extraction
let finalize_dsum_case_unknown
(t: dsum)
(#kt: parser_kind)
(#p: parser kt (dsum_repr_type t))
(s: serializer p)
(w: leaf_writer_strong s)
(f: ((x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x))))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
(r: unknown_enum_repr (dsum_enum t))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: HST.Stack unit
(requires (fun h ->
let len_tag = serialized_length s r in
U32.v pos + len_tag < 4294967296 /\ (
let pos_payload = pos `U32.add` U32.uint_to_t len_tag in
valid g h input pos_payload /\
writable input.base (U32.v pos) (U32.v pos_payload) h
)))
(ensures (fun h _ h' ->
let len_tag = serialized_length s r in
let pos_payload = pos `U32.add` U32.uint_to_t len_tag in
B.modifies (loc_slice_from_to input pos pos_payload) h h' /\
valid_content_pos (parse_dsum t p f g) h' input pos (synth_dsum_case t (Unknown r) (contents g h input pos_payload)) (get_valid_pos g h input pos_payload)
))
= let pos1 = w r input pos in
let h = HST.get () in
[@inline_let]
let _ =
valid_facts (parse_maybe_enum_key p (dsum_enum t)) h input pos;
valid_facts p h input pos;
let sq = bytes_of_slice_from h input pos in
parse_maybe_enum_key_eq p (dsum_enum t) sq;
valid_dsum_intro_unknown h t p f g input pos
in
()
let valid_dsum_elim_tag
(h: HS.mem)
(t: dsum)
(#kt: parser_kind)
(p: parser kt (dsum_repr_type t))
(f: ((x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x))))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: Lemma
(requires (
valid (parse_dsum t p f g) h input pos
))
(ensures (
valid (parse_maybe_enum_key p (dsum_enum t)) h input pos /\
contents (parse_maybe_enum_key p (dsum_enum t)) h input pos == dsum_tag_of_data t (contents (parse_dsum t p f g) h input pos)
))
= let _ = parse_dsum_eq_ t p f g (bytes_of_slice_from h input pos) in
let _ = valid_facts (parse_dsum t p f g) h input pos in
let _ = valid_facts (parse_maybe_enum_key p (dsum_enum t)) h input pos in
()
inline_for_extraction
let read_dsum_tag
(t: dsum)
(#kt: parser_kind)
(#p: parser kt (dsum_repr_type t))
(p32: leaf_reader p)
(destr: maybe_enum_destr_t (maybe_enum_key (dsum_enum t)) (dsum_enum t))
(f: ((x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x))))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: HST.Stack (dsum_key t)
(requires (fun h ->
valid (parse_dsum t p f g) h input pos
))
(ensures (fun h res h' ->
B.modifies B.loc_none h h' /\
res == dsum_tag_of_data t (contents (parse_dsum t p f g) h input pos)
))
= let h = HST.get () in
[@inline_let] let _ = valid_dsum_elim_tag h t p f g input pos in
read_maybe_enum_key p32 (dsum_enum t) destr input pos
#push-options "--z3rlimit 32"
let valid_dsum_elim_known
(h: HS.mem)
(t: dsum)
(#kt: parser_kind)
(p: parser kt (dsum_repr_type t))
(f: ((x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x))))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: Lemma
(requires (
valid (parse_dsum t p f g) h input pos /\
Known? (dsum_tag_of_data t (contents (parse_dsum t p f g) h input pos))
))
(ensures (
valid (parse_maybe_enum_key p (dsum_enum t)) h input pos /\ (
let k' = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
let pos_payload = get_valid_pos (parse_maybe_enum_key p (dsum_enum t)) h input pos in
Known? k' /\ (
let Known k = k' in
valid (dsnd (f k)) h input pos_payload /\
valid_content_pos
(parse_dsum t p f g) h input pos
(synth_dsum_case t (Known k) (contents (dsnd (f k)) h input pos_payload))
(get_valid_pos (dsnd (f k)) h input pos_payload)
))))
=
valid_facts (parse_dsum t p f g) h input pos;
parse_dsum_eq t p f g (bytes_of_slice_from h input pos);
valid_facts (parse_maybe_enum_key p (dsum_enum t)) h input pos;
let Known k = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
let pos_payload = get_valid_pos (parse_maybe_enum_key p (dsum_enum t)) h input pos in
valid_facts (dsnd (f k)) h input pos_payload
#pop-options
let valid_dsum_elim_unknown
(h: HS.mem)
(t: dsum)
(#kt: parser_kind)
(p: parser kt (dsum_repr_type t))
(f: ((x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x))))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: Lemma
(requires (
valid (parse_dsum t p f g) h input pos /\
Unknown? (dsum_tag_of_data t (contents (parse_dsum t p f g) h input pos))
))
(ensures (
valid (parse_maybe_enum_key p (dsum_enum t)) h input pos /\ (
let k' = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
let pos_payload = get_valid_pos (parse_maybe_enum_key p (dsum_enum t)) h input pos in
Unknown? k' /\ (
let Unknown r = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
valid g h input pos_payload /\
valid_content_pos
(parse_dsum t p f g) h input pos
(synth_dsum_case t (Unknown r) (contents g h input pos_payload))
(get_valid_pos g h input pos_payload)
))))
=
valid_facts (parse_dsum t p f g) h input pos;
parse_dsum_eq t p f g (bytes_of_slice_from h input pos);
valid_facts (parse_maybe_enum_key p (dsum_enum t)) h input pos;
let Unknown r = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
let pos_payload = get_valid_pos (parse_maybe_enum_key p (dsum_enum t)) h input pos in
valid_facts g h input pos_payload
inline_for_extraction
let jump_dsum_cases_t
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(#k: parser_kind)
(g: parser k (dsum_type_of_unknown_tag s))
(x: dsum_key s)
: Tot Type
= jumper (parse_dsum_cases' s f g x) | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"LowStar.Buffer.fst.checked",
"LowParse.Spec.Sum.fst.checked",
"LowParse.Low.Enum.fst.checked",
"FStar.UInt64.fsti.checked",
"FStar.UInt32.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Int.Cast.fst.checked",
"FStar.HyperStack.ST.fsti.checked",
"FStar.HyperStack.fst.checked",
"FStar.Classical.fsti.checked"
],
"interface_file": false,
"source_file": "LowParse.Low.Sum.fst"
} | [
{
"abbrev": true,
"full_module": "FStar.HyperStack",
"short_module": "HS"
},
{
"abbrev": true,
"full_module": "FStar.UInt64",
"short_module": "U64"
},
{
"abbrev": true,
"full_module": "FStar.Int.Cast",
"short_module": "Cast"
},
{
"abbrev": true,
"full_module": "LowStar.Buffer",
"short_module": "B"
},
{
"abbrev": true,
"full_module": "FStar.HyperStack.ST",
"short_module": "HST"
},
{
"abbrev": true,
"full_module": "FStar.UInt32",
"short_module": "U32"
},
{
"abbrev": false,
"full_module": "LowParse.Spec.Sum",
"short_module": null
},
{
"abbrev": false,
"full_module": "LowParse.Low.Enum",
"short_module": null
},
{
"abbrev": false,
"full_module": "LowParse.Low",
"short_module": null
},
{
"abbrev": false,
"full_module": "LowParse.Low",
"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",
"short_module": null
}
] | {
"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_elim_box": false,
"smtencoding_l_arith_repr": "boxwrap",
"smtencoding_nl_arith_repr": "boxwrap",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": true,
"z3cliopt": [],
"z3refresh": false,
"z3rlimit": 5,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | false |
s: LowParse.Spec.Sum.dsum ->
f:
(x: LowParse.Spec.Sum.dsum_known_key s
-> Prims.dtuple2 LowParse.Spec.Base.parser_kind
(fun k -> LowParse.Spec.Base.parser k (LowParse.Spec.Sum.dsum_type_of_known_tag s x))) ->
g: LowParse.Spec.Base.parser k (LowParse.Spec.Sum.dsum_type_of_unknown_tag s) ->
x: LowParse.Spec.Sum.dsum_key s ->
v1: LowParse.Low.Sum.jump_dsum_cases_t s f g x ->
v2: LowParse.Low.Sum.jump_dsum_cases_t s f g x
-> Prims.GTot Type0 | Prims.GTot | [
"sometrivial"
] | [] | [
"LowParse.Spec.Sum.dsum",
"LowParse.Spec.Sum.dsum_known_key",
"Prims.dtuple2",
"LowParse.Spec.Base.parser_kind",
"LowParse.Spec.Base.parser",
"LowParse.Spec.Sum.dsum_type_of_known_tag",
"LowParse.Spec.Sum.dsum_type_of_unknown_tag",
"LowParse.Spec.Sum.dsum_key",
"LowParse.Low.Sum.jump_dsum_cases_t",
"Prims.l_True"
] | [] | false | false | false | false | true | let jump_dsum_cases_eq
(s: dsum)
(f: (x: dsum_known_key s -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x))))
(#k: parser_kind)
(g: parser k (dsum_type_of_unknown_tag s))
(x: dsum_key s)
(v1 v2: jump_dsum_cases_t s f g x)
: GTot Type0 =
| True | false |
LowParse.Low.Sum.fst | LowParse.Low.Sum.accessor_clens_sum_payload' | val accessor_clens_sum_payload'
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(j: jumper p)
(pc: (x: sum_key t -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: HST.Stack U32.t
(requires
(fun h ->
valid (parse_sum t p pc) h input pos /\
(clens_sum_payload t k).clens_cond (contents (parse_sum t p pc) h input pos)))
(ensures
(fun h pos' h' ->
B.modifies B.loc_none h h' /\
pos' == slice_access h (gaccessor_clens_sum_payload t p pc k) input pos)) | val accessor_clens_sum_payload'
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(j: jumper p)
(pc: (x: sum_key t -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: HST.Stack U32.t
(requires
(fun h ->
valid (parse_sum t p pc) h input pos /\
(clens_sum_payload t k).clens_cond (contents (parse_sum t p pc) h input pos)))
(ensures
(fun h pos' h' ->
B.modifies B.loc_none h h' /\
pos' == slice_access h (gaccessor_clens_sum_payload t p pc k) input pos)) | let accessor_clens_sum_payload'
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(j: jumper p)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: HST.Stack U32.t
(requires (fun h ->
valid (parse_sum t p pc) h input pos /\
(clens_sum_payload t k).clens_cond (contents (parse_sum t p pc) h input pos)
))
(ensures (fun h pos' h' ->
B.modifies B.loc_none h h' /\
pos' == slice_access h (gaccessor_clens_sum_payload t p pc k) input pos
))
=
let h = HST.get () in
[@inline_let]
let _ =
let pos' = get_valid_pos (parse_sum t p pc) h input pos in
let large = bytes_of_slice_from h input pos in
slice_access_eq h (gaccessor_clens_sum_payload t p pc k) input pos;
valid_facts (parse_sum t p pc) h input pos;
parse_sum_eq'' t p pc large;
valid_facts p h input pos
in
j input pos | {
"file_name": "src/lowparse/LowParse.Low.Sum.fst",
"git_rev": "00217c4a89f5ba56002ba9aa5b4a9d5903bfe9fa",
"git_url": "https://github.com/project-everest/everparse.git",
"project_name": "everparse"
} | {
"end_col": 13,
"end_line": 902,
"start_col": 0,
"start_line": 872
} | module LowParse.Low.Sum
include LowParse.Low.Enum
include LowParse.Spec.Sum
module U32 = FStar.UInt32
module HST = FStar.HyperStack.ST
module B = LowStar.Buffer
module Cast = FStar.Int.Cast
module U64 = FStar.UInt64
inline_for_extraction
let validate_sum_cases_aux
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(vc: ((x: sum_key t) -> Tot (validator (dsnd (pc x)))))
(k: sum_key t)
: Tot (validator (parse_sum_cases t pc k))
= [@inline_let]
let _ = synth_sum_case_injective t k in
validate_synth
(validate_weaken
(weaken_parse_cases_kind t pc)
(vc k)
()
)
(synth_sum_case t k)
()
inline_for_extraction
let validate_sum_cases_t
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot Type
= validator (parse_sum_cases t pc k)
let validate_sum_cases_t_eq
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
(x y : validate_sum_cases_t t pc k)
: GTot Type0
= True
inline_for_extraction
let validate_sum_cases_t_if
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (if_combinator _ (validate_sum_cases_t_eq t pc k))
= fun cond (sv_true: cond_true cond -> Tot (validate_sum_cases_t t pc k)) (sv_false: cond_false cond -> Tot (validate_sum_cases_t t pc k)) #rrel #rel input pos ->
if cond
then sv_true () input pos
else sv_false () input pos
inline_for_extraction
let validate_sum_cases
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(vc: ((x: sum_key t) -> Tot (validator (dsnd (pc x)))))
(destr: dep_enum_destr (sum_enum t) (validate_sum_cases_t t pc))
(k: sum_key t)
: Tot (validator (parse_sum_cases t pc k))
= destr
_
(validate_sum_cases_t_if t pc)
(fun _ _ -> ())
(fun _ _ _ _ -> ())
(validate_sum_cases_aux t pc vc)
k
inline_for_extraction
let validate_sum_aux_payload_t
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
: Tot Type
= (#rrel: _) -> (#rel: _) ->
(input: slice rrel rel) ->
(pos: U64.t) ->
HST.Stack U64.t
(requires (fun h -> live_slice h input /\ U64.v pos <= U32.v input.len))
(ensures (fun h res h' ->
B.modifies B.loc_none h h' /\ (
match k with
| Unknown _ -> is_error res
| Known k' ->
if is_success res
then
valid_pos (dsnd (pc k')) h input (uint64_to_uint32 pos) (uint64_to_uint32 res)
else
(~ (valid (dsnd (pc k')) h input (uint64_to_uint32 pos)))
)))
let validate_sum_aux_payload_eq
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
: Tot (validate_sum_aux_payload_t t pc k -> validate_sum_aux_payload_t t pc k -> GTot Type0)
= fun _ _ -> True
inline_for_extraction
let validate_sum_aux_payload_if'
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
(cond: bool)
(ift: ((cond_true cond) -> Tot (validate_sum_aux_payload_t t pc k)))
(iff: ((cond_false cond) -> Tot (validate_sum_aux_payload_t t pc k)))
: Tot (validate_sum_aux_payload_t t pc k)
= fun #rrel #rel input pos ->
if cond
then begin
(ift () <: validate_sum_aux_payload_t t pc k) input pos
end else
(iff () <: validate_sum_aux_payload_t t pc k) input pos
inline_for_extraction
let validate_sum_aux_payload_if
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
: Tot (if_combinator _ (validate_sum_aux_payload_eq t pc k))
= validate_sum_aux_payload_if' t pc k
#push-options "--z3rlimit 64 --z3cliopt smt.arith.nl=false --using_facts_from '* -FStar.Int.Cast -LowParse.BitFields'"
// --query_stats --smtencoding.elim_box true --smtencoding.l_arith_repr native --z3refresh"
inline_for_extraction
let validate_sum_aux
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(v: validator p)
(p32: leaf_reader p)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(v_payload: ((k: sum_repr_type t)) -> Tot (validate_sum_aux_payload_t t pc (maybe_enum_key_of_repr (sum_enum t) k)))
: Tot (validator (parse_sum t p pc))
= fun #rrel #rel input pos ->
let h = HST.get () in
[@inline_let]
let _ = parse_sum_eq'' t p pc (bytes_of_slice_from h input (uint64_to_uint32 pos)) in
[@inline_let]
let _ = valid_facts (parse_sum t p pc) h input (uint64_to_uint32 pos) in
[@inline_let]
let _ = valid_facts p h input (uint64_to_uint32 pos) in
let len_after_tag = v input pos in
if is_error len_after_tag
then len_after_tag
else begin
let h1 = HST.get () in
let k' = p32 input (uint64_to_uint32 pos) in
[@inline_let]
let _ =
match maybe_enum_key_of_repr (sum_enum t) k' with
| Known k -> valid_facts (dsnd (pc k)) h input (uint64_to_uint32 len_after_tag)
| _ -> ()
in
v_payload k' input len_after_tag
end
#pop-options
inline_for_extraction
let validate_sum_aux_payload'
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (validator (dsnd (pc x)))))
(k: maybe_enum_key (sum_enum t))
: Tot (validate_sum_aux_payload_t t pc k)
= fun #rrel #rel input pos ->
match k with
| Known k ->
[@inline_let]
let _ = synth_sum_case_injective t k in
pc32 k input pos
// validate_synth (pc32 k) (synth_sum_case t k) () input pos
| _ -> validator_error_generic
inline_for_extraction
let validate_sum_aux_payload
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (validator (dsnd (pc x)))))
(destr: dep_maybe_enum_destr_t (sum_enum t) (validate_sum_aux_payload_t t pc))
(k: sum_repr_type t)
: Tot (validate_sum_aux_payload_t t pc (maybe_enum_key_of_repr (sum_enum t) k))
= destr (validate_sum_aux_payload_eq t pc) (validate_sum_aux_payload_if t pc) (fun _ _ -> ()) (fun _ _ _ _ -> ()) (validate_sum_aux_payload' t pc pc32) k
inline_for_extraction
let validate_sum
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(v: validator p)
(p32: leaf_reader p)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (validator (dsnd (pc x)))))
(destr: dep_maybe_enum_destr_t (sum_enum t) (validate_sum_aux_payload_t t pc))
: Tot (validator (parse_sum t p pc))
= validate_sum_aux t v p32 pc (validate_sum_aux_payload t pc pc32 destr)
module HS = FStar.HyperStack
#push-options "--z3rlimit 256 --z3cliopt smt.arith.nl=false --initial_ifuel 8 --max_ifuel 8 --initial_fuel 2 --max_fuel 2"
#restart-solver
let valid_sum_intro
(h: HS.mem)
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: Lemma
(requires (
valid (parse_enum_key p (sum_enum t)) h input pos /\ (
let k = contents (parse_enum_key p (sum_enum t)) h input pos in
valid (dsnd (pc k)) h input (get_valid_pos (parse_enum_key p (sum_enum t)) h input pos)
)))
(ensures (
let k = contents (parse_enum_key p (sum_enum t)) h input pos in
let pos_payload = get_valid_pos (parse_enum_key p (sum_enum t)) h input pos in
valid_content_pos
(parse_sum t p pc) h input pos
(synth_sum_case t k (contents (dsnd (pc k)) h input pos_payload))
(get_valid_pos (dsnd (pc k)) h input pos_payload)
))
= valid_facts (parse_enum_key p (sum_enum t)) h input pos;
let k = contents (parse_enum_key p (sum_enum t)) h input pos in
let pos_payload = get_valid_pos (parse_enum_key p (sum_enum t)) h input pos in
valid_facts (dsnd (pc k)) h input pos_payload;
valid_facts (parse_sum t p pc) h input pos;
parse_sum_eq t p pc (bytes_of_slice_from h input pos)
#pop-options
inline_for_extraction
let finalize_sum_case
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(s: serializer p)
(w: leaf_writer_strong s)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(destr: enum_repr_of_key'_t (sum_enum t))
(k: sum_key t)
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: HST.Stack unit
(requires (fun h ->
let len_tag = serialized_length (serialize_enum_key _ s (sum_enum t)) k in
U32.v pos + len_tag < 4294967296 /\ (
let pos_payload = pos `U32.add` U32.uint_to_t len_tag in
valid (dsnd (pc k)) h input pos_payload /\
writable input.base (U32.v pos) (U32.v pos_payload) h
)))
(ensures (fun h _ h' ->
let len_tag = serialized_length (serialize_enum_key _ s (sum_enum t)) k in
let pos_payload = pos `U32.add` U32.uint_to_t len_tag in
B.modifies (loc_slice_from_to input pos pos_payload) h h' /\
valid_content_pos (parse_sum t p pc) h' input pos (synth_sum_case t k (contents (dsnd (pc k)) h input pos_payload)) (get_valid_pos (dsnd (pc k)) h input pos_payload)
))
= let pos1 = write_enum_key w (sum_enum t) destr k input pos in
let h = HST.get () in
[@inline_let]
let _ = valid_sum_intro h t p pc input pos in
()
inline_for_extraction
let jump_sum_cases_aux
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(vc: ((x: sum_key t) -> Tot (jumper (dsnd (pc x)))))
(k: sum_key t)
: Tot (jumper (parse_sum_cases t pc k))
= [@inline_let]
let _ = synth_sum_case_injective t k in
jump_synth
(jump_weaken
(weaken_parse_cases_kind t pc)
(vc k)
()
)
(synth_sum_case t k)
()
inline_for_extraction
let jump_sum_cases_t
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot Type
= jumper (parse_sum_cases t pc k)
let jump_sum_cases_t_eq
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
(x y : jump_sum_cases_t t pc k)
: GTot Type0
= True
inline_for_extraction
let jump_sum_cases_t_if
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (if_combinator _ (jump_sum_cases_t_eq t pc k))
= fun cond (sv_true: cond_true cond -> Tot (jump_sum_cases_t t pc k)) (sv_false: cond_false cond -> Tot (jump_sum_cases_t t pc k)) #rrel #rel input pos ->
if cond
then sv_true () input pos
else sv_false () input pos
inline_for_extraction
let jump_sum_cases
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(vc: ((x: sum_key t) -> Tot (jumper (dsnd (pc x)))))
(destr: dep_enum_destr (sum_enum t) (jump_sum_cases_t t pc))
(k: sum_key t)
: Tot (jumper (parse_sum_cases t pc k))
= destr
_
(jump_sum_cases_t_if t pc)
(fun _ _ -> ())
(fun _ _ _ _ -> ())
(jump_sum_cases_aux t pc vc)
k
inline_for_extraction
let jump_sum_aux_payload_t
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
: Tot Type
= (#rrel: _) -> (#rel: _) ->
(input: slice rrel rel) ->
(pos: U32.t) ->
HST.Stack U32.t
(requires (fun h -> live_slice h input /\ U32.v pos <= U32.v input.len /\ (
match k with
| Unknown _ -> False
| Known k' -> valid (dsnd (pc k')) h input pos
)))
(ensures (fun h res h' ->
B.modifies B.loc_none h h' /\ (
match k with
| Unknown _ -> False
| Known k' ->
valid_pos (dsnd (pc k')) h input pos res
)))
let jump_sum_aux_payload_eq
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
: Tot (jump_sum_aux_payload_t t pc k -> jump_sum_aux_payload_t t pc k -> GTot Type0)
= fun _ _ -> True
inline_for_extraction
let jump_sum_aux_payload_if'
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
(cond: bool)
(ift: ((cond_true cond) -> Tot (jump_sum_aux_payload_t t pc k)))
(iff: ((cond_false cond) -> Tot (jump_sum_aux_payload_t t pc k)))
: Tot (jump_sum_aux_payload_t t pc k)
= fun #rrel #rel input pos ->
if cond
then begin
(ift () <: jump_sum_aux_payload_t t pc k) input pos
end else
(iff () <: jump_sum_aux_payload_t t pc k) input pos
inline_for_extraction
let jump_sum_aux_payload_if
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
: Tot (if_combinator _ (jump_sum_aux_payload_eq t pc k))
= jump_sum_aux_payload_if' t pc k
let parse_sum_eq3
(#kt: parser_kind)
(t: sum)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(input: bytes)
(k' : sum_repr_type t)
(consumed_k: consumed_length input)
: Lemma
(requires (Some? (parse (parse_sum t p pc) input) /\ parse p input == Some (k', consumed_k)))
(ensures (
let input_k = Seq.slice input consumed_k (Seq.length input) in
let k = maybe_enum_key_of_repr (sum_enum t) k' in
begin match k with
| Known k ->
Some? (parse (dsnd (pc k)) input_k)
| _ -> False
end
))
= parse_sum_eq'' t p pc input
let parse_sum_eq4
(#kt: parser_kind)
(t: sum)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(input: bytes)
(k' : sum_repr_type t)
(consumed_k: consumed_length input)
(consumed_payload: nat)
: Lemma
(requires (Some? (parse (parse_sum t p pc) input) /\ parse p input == Some (k', consumed_k) /\ (
let input_k = Seq.slice input consumed_k (Seq.length input) in
let k = maybe_enum_key_of_repr (sum_enum t) k' in
begin match k with
| Known k ->
Some? (parse (dsnd (pc k)) input_k) /\ (
let Some (_, consumed_payload') = parse (dsnd (pc k)) input_k in
consumed_payload' == consumed_payload
)
| _ -> False
end
)))
(ensures (
let Some (_, consumed) = parse (parse_sum t p pc) input in
consumed == consumed_k + consumed_payload
))
= parse_sum_eq'' t p pc input
#push-options "--z3rlimit 16"
let valid_sum_elim
(h: HS.mem)
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(#rrel: _) (#rel: _)
(input: slice rrel rel)
(pos: U32.t)
: Lemma
(requires (
valid (parse_sum t p pc) h input pos
))
(ensures (
valid p h input pos /\ (
let pos_payload = get_valid_pos p h input pos in
let k' = maybe_enum_key_of_repr (sum_enum t) (contents p h input pos) in
match k' with
| Known k ->
k == sum_tag_of_data t (contents (parse_sum t p pc) h input pos) /\
valid (dsnd (pc k)) h input pos_payload /\
valid_pos
(parse_sum t p pc) h input pos
(get_valid_pos (dsnd (pc k)) h input pos_payload)
| _ -> False
)))
= let sinput = bytes_of_slice_from h input pos in
let _ = parse_sum_eq'' t p pc sinput in
[@inline_let]
let _ = valid_facts (parse_sum t p pc) h input pos in
let Some (k', consumed_k) = parse p sinput in
let pos_after_tag = U32.uint_to_t (U32.v pos + consumed_k) in
[@inline_let]
let _ = valid_facts p h input pos in
assert (valid_content_pos p h input pos k' pos_after_tag);
match maybe_enum_key_of_repr (sum_enum t) k' with
| Known k -> valid_facts (dsnd (pc k)) h input pos_after_tag
| _ -> ()
#pop-options
let valid_sum_elim_tag
(h: HS.mem)
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: Lemma
(requires (
valid (parse_sum t p pc) h input pos
))
(ensures (
valid (parse_enum_key p (sum_enum t)) h input pos /\
contents (parse_enum_key p (sum_enum t)) h input pos == sum_tag_of_data t (contents (parse_sum t p pc) h input pos)
))
= let _ = parse_sum_eq' t p pc (bytes_of_slice_from h input pos) in
let _ = valid_facts (parse_sum t p pc) h input pos in
let _ = valid_facts (parse_enum_key p (sum_enum t)) h input pos in
()
inline_for_extraction
let read_sum_tag
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(p32: leaf_reader p)
(destr: dep_maybe_enum_destr_t (sum_enum t) (read_enum_key_t (sum_enum t)))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: HST.Stack (sum_key t)
(requires (fun h ->
valid (parse_sum t p pc) h input pos
))
(ensures (fun h res h' ->
B.modifies B.loc_none h h' /\
res == sum_tag_of_data t (contents (parse_sum t p pc) h input pos)
))
= let h = HST.get () in
[@inline_let] let _ = valid_sum_elim_tag h t p pc input pos in
read_enum_key p32 (sum_enum t) destr input pos
inline_for_extraction
let jump_sum_aux
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(v: jumper p)
(p32: leaf_reader p)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(v_payload: ((k: sum_repr_type t)) -> Tot (jump_sum_aux_payload_t t pc (maybe_enum_key_of_repr (sum_enum t) k)))
: Tot (jumper (parse_sum t p pc))
= fun #rrel #rel input pos ->
let h = HST.get () in
[@inline_let]
let _ = valid_sum_elim h t p pc input pos in
let pos_after_tag = v input pos in
let k' = p32 input pos in
v_payload k' input pos_after_tag
inline_for_extraction
let jump_sum_aux_payload'
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (jumper (dsnd (pc x)))))
(k: maybe_enum_key (sum_enum t))
: Tot (jump_sum_aux_payload_t t pc k)
= fun #rrel #rel input pos ->
match k with
| Known k ->
[@inline_let]
let _ = synth_sum_case_injective t k in
pc32 k input pos
| _ -> 0ul // dummy, but we MUST NOT remove this branch, otherwise extraction fails
inline_for_extraction
let jump_sum_aux_payload
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (jumper (dsnd (pc x)))))
(destr: dep_maybe_enum_destr_t (sum_enum t) (jump_sum_aux_payload_t t pc))
(k: sum_repr_type t)
: Tot (jump_sum_aux_payload_t t pc (maybe_enum_key_of_repr (sum_enum t) k))
= destr (jump_sum_aux_payload_eq t pc) (jump_sum_aux_payload_if t pc) (fun _ _ -> ()) (fun _ _ _ _ -> ()) (jump_sum_aux_payload' t pc pc32) k
inline_for_extraction
let jump_sum
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(v: jumper p)
(p32: leaf_reader p)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (jumper (dsnd (pc x)))))
(destr: dep_maybe_enum_destr_t (sum_enum t) (jump_sum_aux_payload_t t pc))
: Tot (jumper (parse_sum t p pc))
= jump_sum_aux t v p32 pc (jump_sum_aux_payload t pc pc32 destr)
inline_for_extraction
let read_sum_cases'
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (leaf_reader (dsnd (pc x)))))
(k: sum_key t)
: Tot (leaf_reader (parse_sum_cases' t pc k))
= [@inline_let]
let _ = synth_sum_case_injective t k in
read_synth'
(dsnd (pc k))
(synth_sum_case t k)
(pc32 k)
()
inline_for_extraction
let read_sum_cases_t
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot Type
= leaf_reader (parse_sum_cases' t pc k)
let read_sum_cases_t_eq
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
(x y : read_sum_cases_t t pc k)
: GTot Type0
= True
inline_for_extraction
let read_sum_cases_t_if
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (if_combinator _ (read_sum_cases_t_eq t pc k))
= fun cond (sv_true: cond_true cond -> Tot (read_sum_cases_t t pc k)) (sv_false: cond_false cond -> Tot (read_sum_cases_t t pc k)) #_ #_ input pos ->
if cond
then (sv_true () input pos)
else (sv_false () input pos)
inline_for_extraction
let read_sum_cases
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (leaf_reader (dsnd (pc x)))))
(destr: dep_enum_destr (sum_enum t) (read_sum_cases_t t pc))
(k: sum_key t)
: Tot (leaf_reader (parse_sum_cases' t pc k))
= destr
_
(read_sum_cases_t_if t pc)
(fun _ _ -> ())
(fun _ _ _ _ -> ())
(read_sum_cases' t pc pc32)
k
#push-options "--z3rlimit 32"
inline_for_extraction
let read_sum
(#kt: parser_kind)
(t: sum)
(p: parser kt (sum_repr_type t))
(p32: leaf_reader (parse_enum_key p (sum_enum t)))
(j: jumper p)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (leaf_reader (dsnd (pc x)))))
(destr: dep_enum_destr (sum_enum t) (read_sum_cases_t t pc))
: Tot (leaf_reader (parse_sum t p pc))
=
fun #_ #_ input pos ->
let h = HST.get () in
valid_facts (parse_sum t p pc) h input pos;
parse_sum_eq' t p pc (bytes_of_slice_from h input pos);
valid_facts (parse_enum_key p (sum_enum t)) h input pos;
let k = p32 input pos in
let pos' = jump_enum_key j (sum_enum t) input pos in
valid_facts (parse_sum_cases' t pc k) h input pos' ;
read_sum_cases t pc pc32 destr k input pos'
#pop-options
inline_for_extraction
let serialize32_sum_cases_t
(t: sum)
(#pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(sc: ((x: sum_key t) -> Tot (serializer (dsnd (pc x)))))
(k: sum_key t)
: Tot Type
= serializer32 (serialize_sum_cases t pc sc k)
let serialize32_sum_cases_t_eq
(t: sum)
(#pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(sc: ((x: sum_key t) -> Tot (serializer (dsnd (pc x)))))
(k: sum_key t)
(x y: serialize32_sum_cases_t t sc k)
: GTot Type0
= True
inline_for_extraction
let serialize32_sum_cases_t_if
(t: sum)
(#pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(sc: ((x: sum_key t) -> Tot (serializer (dsnd (pc x)))))
(k: sum_key t)
: Tot (if_combinator _ (serialize32_sum_cases_t_eq t sc k))
= fun cond (sv_true: (cond_true cond -> Tot (serialize32_sum_cases_t t sc k))) (sv_false: (cond_false cond -> Tot (serialize32_sum_cases_t t sc k))) x #rrel #rel b pos ->
if cond
then (sv_true () x b pos)
else (sv_false () x b pos)
inline_for_extraction
let serialize32_sum_cases_aux
(t: sum)
(#pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(sc: ((x: sum_key t) -> Tot (serializer (dsnd (pc x)))))
(sc32: ((x: sum_key t) -> Tot (serializer32 (sc x))))
(k: sum_key t)
: Tot (serializer32 (serialize_sum_cases t pc sc k))
= fun x #rrel #rel b pos ->
[@inline_let] let _ =
Classical.forall_intro (parse_sum_cases_eq' t pc k);
synth_sum_case_injective t k;
synth_sum_case_inverse t k
in
serialize32_synth
(sc32 k)
(synth_sum_case t k)
(synth_sum_case_recip t k)
(fun x -> synth_sum_case_recip t k x)
()
x
b
pos
inline_for_extraction
let serialize32_sum_cases
(t: sum)
(#pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(sc: ((x: sum_key t) -> Tot (serializer (dsnd (pc x)))))
(sc32: ((x: sum_key t) -> Tot (serializer32 (sc x))))
(destr: dep_enum_destr (sum_enum t) (serialize32_sum_cases_t t sc))
(k: sum_key t)
: Tot (serializer32 (serialize_sum_cases t pc sc k))
= destr
_
(serialize32_sum_cases_t_if t sc)
(fun _ _ -> ())
(fun _ _ _ _ -> ())
(serialize32_sum_cases_aux t sc sc32)
k
inline_for_extraction
let serialize32_sum
(#kt: parser_kind)
(t: sum)
(#p: parser kt (sum_repr_type t))
(s: serializer p {kt.parser_kind_subkind == Some ParserStrong})
(s32: serializer32 (serialize_enum_key _ s (sum_enum t)))
(#pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(sc: ((x: sum_key t) -> Tot (serializer (dsnd (pc x)))))
(sc32: ((x: sum_key t) -> Tot (serializer32 (sc x))))
(destr: dep_enum_destr (sum_enum t) (serialize32_sum_cases_t t sc))
: Tot (serializer32 (serialize_sum t s sc))
= fun x #rrel #rel b pos ->
serialize_sum_eq t s sc x;
let tg = sum_tag_of_data t x in
serialize32_nondep_then_aux s32 (serialize32_sum_cases t sc sc32 destr tg) tg x b pos
let clens_sum_tag
(s: sum)
: Tot (clens (sum_type s) (sum_key s))
= {
clens_cond = (fun _ -> True);
clens_get = sum_tag_of_data s;
}
let gaccessor_sum_tag
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
: Tot (gaccessor (parse_sum t p pc) (parse_enum_key p (sum_enum t)) (clens_sum_tag t))
= gaccessor_tagged_union_tag
(parse_enum_key p (sum_enum t))
(sum_tag_of_data t)
(parse_sum_cases t pc)
inline_for_extraction
let accessor_sum_tag
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
: Tot (accessor (gaccessor_sum_tag t p pc))
= accessor_tagged_union_tag
(parse_enum_key p (sum_enum t))
(sum_tag_of_data t)
(parse_sum_cases t pc)
let clens_sum_payload
(s: sum)
(k: sum_key s)
: Tot (clens (sum_type s) (sum_type_of_tag s k))
= {
clens_cond = (fun (x: sum_type s) -> sum_tag_of_data s x == k);
clens_get = (fun (x: sum_type s) -> synth_sum_case_recip s k x <: Ghost (sum_type_of_tag s k) (requires (sum_tag_of_data s x == k)) (ensures (fun _ -> True)));
}
#push-options "--z3rlimit 32"
let gaccessor_clens_sum_payload'
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (gaccessor' (parse_sum t p pc) (dsnd (pc k)) (clens_sum_payload t k))
= fun (input: bytes) ->
parse_sum_eq'' t p pc input;
let res =
match parse p input with
| Some (_, consumed) ->
synth_sum_case_inverse t k;
synth_sum_case_injective t k;
synth_injective_synth_inverse_synth_inverse_recip (synth_sum_case t k) (synth_sum_case_recip t k) ();
(consumed)
| _ -> 0 // dummy
in
(res <: (res: _ { gaccessor_post' (parse_sum t p pc) (dsnd (pc k)) (clens_sum_payload t k) input res } ))
#push-options "--z3rlimit 64"
let gaccessor_clens_sum_payload_injective
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
(sl sl' : bytes)
: Lemma
(requires (
gaccessor_pre (parse_sum t p pc) (dsnd (pc k)) (clens_sum_payload t k) sl /\
gaccessor_pre (parse_sum t p pc) (dsnd (pc k)) (clens_sum_payload t k) sl' /\
injective_precond (parse_sum t p pc) sl sl'
))
(ensures (gaccessor_clens_sum_payload' t p pc k sl == gaccessor_clens_sum_payload' t p pc k sl'))
= parse_sum_eq'' t p pc sl;
parse_sum_eq'' t p pc sl' ;
parse_injective (parse_sum t p pc) sl sl' ;
parse_injective p sl sl'
#pop-options
let gaccessor_clens_sum_payload_no_lookahead
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
(sl sl' : bytes)
: Lemma
(requires (
(parse_sum_kind kt t pc).parser_kind_subkind == Some ParserStrong /\
gaccessor_pre (parse_sum t p pc) (dsnd (pc k)) (clens_sum_payload t k) sl /\
gaccessor_pre (parse_sum t p pc) (dsnd (pc k)) (clens_sum_payload t k) sl' /\
no_lookahead_on_precond (parse_sum t p pc) sl sl'
))
(ensures (gaccessor_clens_sum_payload' t p pc k sl == gaccessor_clens_sum_payload' t p pc k sl'))
= parse_sum_eq'' t p pc sl;
parse_sum_eq'' t p pc sl' ;
parse_strong_prefix (parse_sum t p pc) sl sl' ;
parse_injective p sl sl'
let gaccessor_clens_sum_payload
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (gaccessor (parse_sum t p pc) (dsnd (pc k)) (clens_sum_payload t k))
= Classical.forall_intro_2 (fun x -> Classical.move_requires (gaccessor_clens_sum_payload_injective t p pc k x));
Classical.forall_intro_2 (fun x -> Classical.move_requires (gaccessor_clens_sum_payload_no_lookahead t p pc k x));
gaccessor_prop_equiv (parse_sum t p pc) (dsnd (pc k)) (clens_sum_payload t k) (gaccessor_clens_sum_payload' t p pc k);
gaccessor_clens_sum_payload' t p pc k | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"LowStar.Buffer.fst.checked",
"LowParse.Spec.Sum.fst.checked",
"LowParse.Low.Enum.fst.checked",
"FStar.UInt64.fsti.checked",
"FStar.UInt32.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Int.Cast.fst.checked",
"FStar.HyperStack.ST.fsti.checked",
"FStar.HyperStack.fst.checked",
"FStar.Classical.fsti.checked"
],
"interface_file": false,
"source_file": "LowParse.Low.Sum.fst"
} | [
{
"abbrev": true,
"full_module": "FStar.HyperStack",
"short_module": "HS"
},
{
"abbrev": true,
"full_module": "FStar.UInt64",
"short_module": "U64"
},
{
"abbrev": true,
"full_module": "FStar.Int.Cast",
"short_module": "Cast"
},
{
"abbrev": true,
"full_module": "LowStar.Buffer",
"short_module": "B"
},
{
"abbrev": true,
"full_module": "FStar.HyperStack.ST",
"short_module": "HST"
},
{
"abbrev": true,
"full_module": "FStar.UInt32",
"short_module": "U32"
},
{
"abbrev": false,
"full_module": "LowParse.Spec.Sum",
"short_module": null
},
{
"abbrev": false,
"full_module": "LowParse.Low.Enum",
"short_module": null
},
{
"abbrev": false,
"full_module": "LowParse.Low",
"short_module": null
},
{
"abbrev": false,
"full_module": "LowParse.Low",
"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",
"short_module": null
}
] | {
"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_elim_box": false,
"smtencoding_l_arith_repr": "boxwrap",
"smtencoding_nl_arith_repr": "boxwrap",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": true,
"z3cliopt": [],
"z3refresh": false,
"z3rlimit": 32,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | false |
t: LowParse.Spec.Sum.sum ->
j: LowParse.Low.Base.jumper p ->
pc:
(x: LowParse.Spec.Sum.sum_key t
-> Prims.dtuple2 LowParse.Spec.Base.parser_kind
(fun k -> LowParse.Spec.Base.parser k (LowParse.Spec.Sum.sum_type_of_tag t x))) ->
k: LowParse.Spec.Sum.sum_key t ->
input: LowParse.Slice.slice rrel rel ->
pos: FStar.UInt32.t
-> FStar.HyperStack.ST.Stack FStar.UInt32.t | FStar.HyperStack.ST.Stack | [] | [] | [
"LowParse.Spec.Sum.sum",
"LowParse.Spec.Base.parser_kind",
"LowParse.Spec.Base.parser",
"LowParse.Spec.Sum.sum_repr_type",
"LowParse.Low.Base.jumper",
"LowParse.Spec.Sum.sum_key",
"Prims.dtuple2",
"LowParse.Spec.Sum.sum_type_of_tag",
"LowParse.Slice.srel",
"LowParse.Bytes.byte",
"LowParse.Slice.slice",
"FStar.UInt32.t",
"Prims.unit",
"LowParse.Low.Base.Spec.valid_facts",
"LowParse.Spec.Sum.parse_sum_eq''",
"LowParse.Spec.Sum.parse_sum_kind",
"LowParse.Spec.Sum.sum_type",
"LowParse.Spec.Sum.parse_sum",
"LowParse.Low.Base.Spec.slice_access_eq",
"Prims.__proj__Mkdtuple2__item___1",
"FStar.Pervasives.dsnd",
"LowParse.Low.Sum.clens_sum_payload",
"LowParse.Low.Sum.gaccessor_clens_sum_payload",
"LowParse.Bytes.bytes",
"LowParse.Slice.bytes_of_slice_from",
"LowParse.Low.Base.Spec.get_valid_pos",
"FStar.Monotonic.HyperStack.mem",
"FStar.HyperStack.ST.get",
"Prims.l_and",
"LowParse.Low.Base.Spec.valid",
"LowParse.Low.Base.Spec.__proj__Mkclens__item__clens_cond",
"LowParse.Low.Base.Spec.contents",
"LowStar.Monotonic.Buffer.modifies",
"LowStar.Monotonic.Buffer.loc_none",
"Prims.eq2",
"LowParse.Low.Base.Spec.slice_access"
] | [] | false | true | false | false | false | let accessor_clens_sum_payload'
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(j: jumper p)
(pc: (x: sum_key t -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: HST.Stack U32.t
(requires
(fun h ->
valid (parse_sum t p pc) h input pos /\
(clens_sum_payload t k).clens_cond (contents (parse_sum t p pc) h input pos)))
(ensures
(fun h pos' h' ->
B.modifies B.loc_none h h' /\
pos' == slice_access h (gaccessor_clens_sum_payload t p pc k) input pos)) =
| let h = HST.get () in
[@@ inline_let ]let _ =
let pos' = get_valid_pos (parse_sum t p pc) h input pos in
let large = bytes_of_slice_from h input pos in
slice_access_eq h (gaccessor_clens_sum_payload t p pc k) input pos;
valid_facts (parse_sum t p pc) h input pos;
parse_sum_eq'' t p pc large;
valid_facts p h input pos
in
j input pos | false |
LowParse.Low.Sum.fst | LowParse.Low.Sum.gaccessor_clens_sum_cases_payload | val gaccessor_clens_sum_cases_payload
(t: sum)
(pc: (x: sum_key t -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (gaccessor (parse_sum_cases' t pc k) (dsnd (pc k)) (clens_sum_cases_payload t k)) | val gaccessor_clens_sum_cases_payload
(t: sum)
(pc: (x: sum_key t -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (gaccessor (parse_sum_cases' t pc k) (dsnd (pc k)) (clens_sum_cases_payload t k)) | let gaccessor_clens_sum_cases_payload
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (gaccessor (parse_sum_cases' t pc k) (dsnd (pc k)) (clens_sum_cases_payload t k))
= synth_sum_case_injective t k;
synth_sum_case_inverse t k;
synth_injective_synth_inverse_synth_inverse_recip (synth_sum_case t k) (synth_sum_case_recip t k) ();
gaccessor_ext
(gaccessor_synth (dsnd (pc k)) (synth_sum_case t k) (synth_sum_case_recip t k) ())
(clens_sum_cases_payload t k)
() | {
"file_name": "src/lowparse/LowParse.Low.Sum.fst",
"git_rev": "00217c4a89f5ba56002ba9aa5b4a9d5903bfe9fa",
"git_url": "https://github.com/project-everest/everparse.git",
"project_name": "everparse"
} | {
"end_col": 6,
"end_line": 937,
"start_col": 0,
"start_line": 926
} | module LowParse.Low.Sum
include LowParse.Low.Enum
include LowParse.Spec.Sum
module U32 = FStar.UInt32
module HST = FStar.HyperStack.ST
module B = LowStar.Buffer
module Cast = FStar.Int.Cast
module U64 = FStar.UInt64
inline_for_extraction
let validate_sum_cases_aux
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(vc: ((x: sum_key t) -> Tot (validator (dsnd (pc x)))))
(k: sum_key t)
: Tot (validator (parse_sum_cases t pc k))
= [@inline_let]
let _ = synth_sum_case_injective t k in
validate_synth
(validate_weaken
(weaken_parse_cases_kind t pc)
(vc k)
()
)
(synth_sum_case t k)
()
inline_for_extraction
let validate_sum_cases_t
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot Type
= validator (parse_sum_cases t pc k)
let validate_sum_cases_t_eq
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
(x y : validate_sum_cases_t t pc k)
: GTot Type0
= True
inline_for_extraction
let validate_sum_cases_t_if
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (if_combinator _ (validate_sum_cases_t_eq t pc k))
= fun cond (sv_true: cond_true cond -> Tot (validate_sum_cases_t t pc k)) (sv_false: cond_false cond -> Tot (validate_sum_cases_t t pc k)) #rrel #rel input pos ->
if cond
then sv_true () input pos
else sv_false () input pos
inline_for_extraction
let validate_sum_cases
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(vc: ((x: sum_key t) -> Tot (validator (dsnd (pc x)))))
(destr: dep_enum_destr (sum_enum t) (validate_sum_cases_t t pc))
(k: sum_key t)
: Tot (validator (parse_sum_cases t pc k))
= destr
_
(validate_sum_cases_t_if t pc)
(fun _ _ -> ())
(fun _ _ _ _ -> ())
(validate_sum_cases_aux t pc vc)
k
inline_for_extraction
let validate_sum_aux_payload_t
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
: Tot Type
= (#rrel: _) -> (#rel: _) ->
(input: slice rrel rel) ->
(pos: U64.t) ->
HST.Stack U64.t
(requires (fun h -> live_slice h input /\ U64.v pos <= U32.v input.len))
(ensures (fun h res h' ->
B.modifies B.loc_none h h' /\ (
match k with
| Unknown _ -> is_error res
| Known k' ->
if is_success res
then
valid_pos (dsnd (pc k')) h input (uint64_to_uint32 pos) (uint64_to_uint32 res)
else
(~ (valid (dsnd (pc k')) h input (uint64_to_uint32 pos)))
)))
let validate_sum_aux_payload_eq
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
: Tot (validate_sum_aux_payload_t t pc k -> validate_sum_aux_payload_t t pc k -> GTot Type0)
= fun _ _ -> True
inline_for_extraction
let validate_sum_aux_payload_if'
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
(cond: bool)
(ift: ((cond_true cond) -> Tot (validate_sum_aux_payload_t t pc k)))
(iff: ((cond_false cond) -> Tot (validate_sum_aux_payload_t t pc k)))
: Tot (validate_sum_aux_payload_t t pc k)
= fun #rrel #rel input pos ->
if cond
then begin
(ift () <: validate_sum_aux_payload_t t pc k) input pos
end else
(iff () <: validate_sum_aux_payload_t t pc k) input pos
inline_for_extraction
let validate_sum_aux_payload_if
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
: Tot (if_combinator _ (validate_sum_aux_payload_eq t pc k))
= validate_sum_aux_payload_if' t pc k
#push-options "--z3rlimit 64 --z3cliopt smt.arith.nl=false --using_facts_from '* -FStar.Int.Cast -LowParse.BitFields'"
// --query_stats --smtencoding.elim_box true --smtencoding.l_arith_repr native --z3refresh"
inline_for_extraction
let validate_sum_aux
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(v: validator p)
(p32: leaf_reader p)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(v_payload: ((k: sum_repr_type t)) -> Tot (validate_sum_aux_payload_t t pc (maybe_enum_key_of_repr (sum_enum t) k)))
: Tot (validator (parse_sum t p pc))
= fun #rrel #rel input pos ->
let h = HST.get () in
[@inline_let]
let _ = parse_sum_eq'' t p pc (bytes_of_slice_from h input (uint64_to_uint32 pos)) in
[@inline_let]
let _ = valid_facts (parse_sum t p pc) h input (uint64_to_uint32 pos) in
[@inline_let]
let _ = valid_facts p h input (uint64_to_uint32 pos) in
let len_after_tag = v input pos in
if is_error len_after_tag
then len_after_tag
else begin
let h1 = HST.get () in
let k' = p32 input (uint64_to_uint32 pos) in
[@inline_let]
let _ =
match maybe_enum_key_of_repr (sum_enum t) k' with
| Known k -> valid_facts (dsnd (pc k)) h input (uint64_to_uint32 len_after_tag)
| _ -> ()
in
v_payload k' input len_after_tag
end
#pop-options
inline_for_extraction
let validate_sum_aux_payload'
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (validator (dsnd (pc x)))))
(k: maybe_enum_key (sum_enum t))
: Tot (validate_sum_aux_payload_t t pc k)
= fun #rrel #rel input pos ->
match k with
| Known k ->
[@inline_let]
let _ = synth_sum_case_injective t k in
pc32 k input pos
// validate_synth (pc32 k) (synth_sum_case t k) () input pos
| _ -> validator_error_generic
inline_for_extraction
let validate_sum_aux_payload
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (validator (dsnd (pc x)))))
(destr: dep_maybe_enum_destr_t (sum_enum t) (validate_sum_aux_payload_t t pc))
(k: sum_repr_type t)
: Tot (validate_sum_aux_payload_t t pc (maybe_enum_key_of_repr (sum_enum t) k))
= destr (validate_sum_aux_payload_eq t pc) (validate_sum_aux_payload_if t pc) (fun _ _ -> ()) (fun _ _ _ _ -> ()) (validate_sum_aux_payload' t pc pc32) k
inline_for_extraction
let validate_sum
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(v: validator p)
(p32: leaf_reader p)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (validator (dsnd (pc x)))))
(destr: dep_maybe_enum_destr_t (sum_enum t) (validate_sum_aux_payload_t t pc))
: Tot (validator (parse_sum t p pc))
= validate_sum_aux t v p32 pc (validate_sum_aux_payload t pc pc32 destr)
module HS = FStar.HyperStack
#push-options "--z3rlimit 256 --z3cliopt smt.arith.nl=false --initial_ifuel 8 --max_ifuel 8 --initial_fuel 2 --max_fuel 2"
#restart-solver
let valid_sum_intro
(h: HS.mem)
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: Lemma
(requires (
valid (parse_enum_key p (sum_enum t)) h input pos /\ (
let k = contents (parse_enum_key p (sum_enum t)) h input pos in
valid (dsnd (pc k)) h input (get_valid_pos (parse_enum_key p (sum_enum t)) h input pos)
)))
(ensures (
let k = contents (parse_enum_key p (sum_enum t)) h input pos in
let pos_payload = get_valid_pos (parse_enum_key p (sum_enum t)) h input pos in
valid_content_pos
(parse_sum t p pc) h input pos
(synth_sum_case t k (contents (dsnd (pc k)) h input pos_payload))
(get_valid_pos (dsnd (pc k)) h input pos_payload)
))
= valid_facts (parse_enum_key p (sum_enum t)) h input pos;
let k = contents (parse_enum_key p (sum_enum t)) h input pos in
let pos_payload = get_valid_pos (parse_enum_key p (sum_enum t)) h input pos in
valid_facts (dsnd (pc k)) h input pos_payload;
valid_facts (parse_sum t p pc) h input pos;
parse_sum_eq t p pc (bytes_of_slice_from h input pos)
#pop-options
inline_for_extraction
let finalize_sum_case
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(s: serializer p)
(w: leaf_writer_strong s)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(destr: enum_repr_of_key'_t (sum_enum t))
(k: sum_key t)
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: HST.Stack unit
(requires (fun h ->
let len_tag = serialized_length (serialize_enum_key _ s (sum_enum t)) k in
U32.v pos + len_tag < 4294967296 /\ (
let pos_payload = pos `U32.add` U32.uint_to_t len_tag in
valid (dsnd (pc k)) h input pos_payload /\
writable input.base (U32.v pos) (U32.v pos_payload) h
)))
(ensures (fun h _ h' ->
let len_tag = serialized_length (serialize_enum_key _ s (sum_enum t)) k in
let pos_payload = pos `U32.add` U32.uint_to_t len_tag in
B.modifies (loc_slice_from_to input pos pos_payload) h h' /\
valid_content_pos (parse_sum t p pc) h' input pos (synth_sum_case t k (contents (dsnd (pc k)) h input pos_payload)) (get_valid_pos (dsnd (pc k)) h input pos_payload)
))
= let pos1 = write_enum_key w (sum_enum t) destr k input pos in
let h = HST.get () in
[@inline_let]
let _ = valid_sum_intro h t p pc input pos in
()
inline_for_extraction
let jump_sum_cases_aux
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(vc: ((x: sum_key t) -> Tot (jumper (dsnd (pc x)))))
(k: sum_key t)
: Tot (jumper (parse_sum_cases t pc k))
= [@inline_let]
let _ = synth_sum_case_injective t k in
jump_synth
(jump_weaken
(weaken_parse_cases_kind t pc)
(vc k)
()
)
(synth_sum_case t k)
()
inline_for_extraction
let jump_sum_cases_t
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot Type
= jumper (parse_sum_cases t pc k)
let jump_sum_cases_t_eq
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
(x y : jump_sum_cases_t t pc k)
: GTot Type0
= True
inline_for_extraction
let jump_sum_cases_t_if
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (if_combinator _ (jump_sum_cases_t_eq t pc k))
= fun cond (sv_true: cond_true cond -> Tot (jump_sum_cases_t t pc k)) (sv_false: cond_false cond -> Tot (jump_sum_cases_t t pc k)) #rrel #rel input pos ->
if cond
then sv_true () input pos
else sv_false () input pos
inline_for_extraction
let jump_sum_cases
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(vc: ((x: sum_key t) -> Tot (jumper (dsnd (pc x)))))
(destr: dep_enum_destr (sum_enum t) (jump_sum_cases_t t pc))
(k: sum_key t)
: Tot (jumper (parse_sum_cases t pc k))
= destr
_
(jump_sum_cases_t_if t pc)
(fun _ _ -> ())
(fun _ _ _ _ -> ())
(jump_sum_cases_aux t pc vc)
k
inline_for_extraction
let jump_sum_aux_payload_t
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
: Tot Type
= (#rrel: _) -> (#rel: _) ->
(input: slice rrel rel) ->
(pos: U32.t) ->
HST.Stack U32.t
(requires (fun h -> live_slice h input /\ U32.v pos <= U32.v input.len /\ (
match k with
| Unknown _ -> False
| Known k' -> valid (dsnd (pc k')) h input pos
)))
(ensures (fun h res h' ->
B.modifies B.loc_none h h' /\ (
match k with
| Unknown _ -> False
| Known k' ->
valid_pos (dsnd (pc k')) h input pos res
)))
let jump_sum_aux_payload_eq
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
: Tot (jump_sum_aux_payload_t t pc k -> jump_sum_aux_payload_t t pc k -> GTot Type0)
= fun _ _ -> True
inline_for_extraction
let jump_sum_aux_payload_if'
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
(cond: bool)
(ift: ((cond_true cond) -> Tot (jump_sum_aux_payload_t t pc k)))
(iff: ((cond_false cond) -> Tot (jump_sum_aux_payload_t t pc k)))
: Tot (jump_sum_aux_payload_t t pc k)
= fun #rrel #rel input pos ->
if cond
then begin
(ift () <: jump_sum_aux_payload_t t pc k) input pos
end else
(iff () <: jump_sum_aux_payload_t t pc k) input pos
inline_for_extraction
let jump_sum_aux_payload_if
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
: Tot (if_combinator _ (jump_sum_aux_payload_eq t pc k))
= jump_sum_aux_payload_if' t pc k
let parse_sum_eq3
(#kt: parser_kind)
(t: sum)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(input: bytes)
(k' : sum_repr_type t)
(consumed_k: consumed_length input)
: Lemma
(requires (Some? (parse (parse_sum t p pc) input) /\ parse p input == Some (k', consumed_k)))
(ensures (
let input_k = Seq.slice input consumed_k (Seq.length input) in
let k = maybe_enum_key_of_repr (sum_enum t) k' in
begin match k with
| Known k ->
Some? (parse (dsnd (pc k)) input_k)
| _ -> False
end
))
= parse_sum_eq'' t p pc input
let parse_sum_eq4
(#kt: parser_kind)
(t: sum)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(input: bytes)
(k' : sum_repr_type t)
(consumed_k: consumed_length input)
(consumed_payload: nat)
: Lemma
(requires (Some? (parse (parse_sum t p pc) input) /\ parse p input == Some (k', consumed_k) /\ (
let input_k = Seq.slice input consumed_k (Seq.length input) in
let k = maybe_enum_key_of_repr (sum_enum t) k' in
begin match k with
| Known k ->
Some? (parse (dsnd (pc k)) input_k) /\ (
let Some (_, consumed_payload') = parse (dsnd (pc k)) input_k in
consumed_payload' == consumed_payload
)
| _ -> False
end
)))
(ensures (
let Some (_, consumed) = parse (parse_sum t p pc) input in
consumed == consumed_k + consumed_payload
))
= parse_sum_eq'' t p pc input
#push-options "--z3rlimit 16"
let valid_sum_elim
(h: HS.mem)
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(#rrel: _) (#rel: _)
(input: slice rrel rel)
(pos: U32.t)
: Lemma
(requires (
valid (parse_sum t p pc) h input pos
))
(ensures (
valid p h input pos /\ (
let pos_payload = get_valid_pos p h input pos in
let k' = maybe_enum_key_of_repr (sum_enum t) (contents p h input pos) in
match k' with
| Known k ->
k == sum_tag_of_data t (contents (parse_sum t p pc) h input pos) /\
valid (dsnd (pc k)) h input pos_payload /\
valid_pos
(parse_sum t p pc) h input pos
(get_valid_pos (dsnd (pc k)) h input pos_payload)
| _ -> False
)))
= let sinput = bytes_of_slice_from h input pos in
let _ = parse_sum_eq'' t p pc sinput in
[@inline_let]
let _ = valid_facts (parse_sum t p pc) h input pos in
let Some (k', consumed_k) = parse p sinput in
let pos_after_tag = U32.uint_to_t (U32.v pos + consumed_k) in
[@inline_let]
let _ = valid_facts p h input pos in
assert (valid_content_pos p h input pos k' pos_after_tag);
match maybe_enum_key_of_repr (sum_enum t) k' with
| Known k -> valid_facts (dsnd (pc k)) h input pos_after_tag
| _ -> ()
#pop-options
let valid_sum_elim_tag
(h: HS.mem)
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: Lemma
(requires (
valid (parse_sum t p pc) h input pos
))
(ensures (
valid (parse_enum_key p (sum_enum t)) h input pos /\
contents (parse_enum_key p (sum_enum t)) h input pos == sum_tag_of_data t (contents (parse_sum t p pc) h input pos)
))
= let _ = parse_sum_eq' t p pc (bytes_of_slice_from h input pos) in
let _ = valid_facts (parse_sum t p pc) h input pos in
let _ = valid_facts (parse_enum_key p (sum_enum t)) h input pos in
()
inline_for_extraction
let read_sum_tag
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(p32: leaf_reader p)
(destr: dep_maybe_enum_destr_t (sum_enum t) (read_enum_key_t (sum_enum t)))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: HST.Stack (sum_key t)
(requires (fun h ->
valid (parse_sum t p pc) h input pos
))
(ensures (fun h res h' ->
B.modifies B.loc_none h h' /\
res == sum_tag_of_data t (contents (parse_sum t p pc) h input pos)
))
= let h = HST.get () in
[@inline_let] let _ = valid_sum_elim_tag h t p pc input pos in
read_enum_key p32 (sum_enum t) destr input pos
inline_for_extraction
let jump_sum_aux
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(v: jumper p)
(p32: leaf_reader p)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(v_payload: ((k: sum_repr_type t)) -> Tot (jump_sum_aux_payload_t t pc (maybe_enum_key_of_repr (sum_enum t) k)))
: Tot (jumper (parse_sum t p pc))
= fun #rrel #rel input pos ->
let h = HST.get () in
[@inline_let]
let _ = valid_sum_elim h t p pc input pos in
let pos_after_tag = v input pos in
let k' = p32 input pos in
v_payload k' input pos_after_tag
inline_for_extraction
let jump_sum_aux_payload'
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (jumper (dsnd (pc x)))))
(k: maybe_enum_key (sum_enum t))
: Tot (jump_sum_aux_payload_t t pc k)
= fun #rrel #rel input pos ->
match k with
| Known k ->
[@inline_let]
let _ = synth_sum_case_injective t k in
pc32 k input pos
| _ -> 0ul // dummy, but we MUST NOT remove this branch, otherwise extraction fails
inline_for_extraction
let jump_sum_aux_payload
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (jumper (dsnd (pc x)))))
(destr: dep_maybe_enum_destr_t (sum_enum t) (jump_sum_aux_payload_t t pc))
(k: sum_repr_type t)
: Tot (jump_sum_aux_payload_t t pc (maybe_enum_key_of_repr (sum_enum t) k))
= destr (jump_sum_aux_payload_eq t pc) (jump_sum_aux_payload_if t pc) (fun _ _ -> ()) (fun _ _ _ _ -> ()) (jump_sum_aux_payload' t pc pc32) k
inline_for_extraction
let jump_sum
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(v: jumper p)
(p32: leaf_reader p)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (jumper (dsnd (pc x)))))
(destr: dep_maybe_enum_destr_t (sum_enum t) (jump_sum_aux_payload_t t pc))
: Tot (jumper (parse_sum t p pc))
= jump_sum_aux t v p32 pc (jump_sum_aux_payload t pc pc32 destr)
inline_for_extraction
let read_sum_cases'
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (leaf_reader (dsnd (pc x)))))
(k: sum_key t)
: Tot (leaf_reader (parse_sum_cases' t pc k))
= [@inline_let]
let _ = synth_sum_case_injective t k in
read_synth'
(dsnd (pc k))
(synth_sum_case t k)
(pc32 k)
()
inline_for_extraction
let read_sum_cases_t
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot Type
= leaf_reader (parse_sum_cases' t pc k)
let read_sum_cases_t_eq
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
(x y : read_sum_cases_t t pc k)
: GTot Type0
= True
inline_for_extraction
let read_sum_cases_t_if
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (if_combinator _ (read_sum_cases_t_eq t pc k))
= fun cond (sv_true: cond_true cond -> Tot (read_sum_cases_t t pc k)) (sv_false: cond_false cond -> Tot (read_sum_cases_t t pc k)) #_ #_ input pos ->
if cond
then (sv_true () input pos)
else (sv_false () input pos)
inline_for_extraction
let read_sum_cases
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (leaf_reader (dsnd (pc x)))))
(destr: dep_enum_destr (sum_enum t) (read_sum_cases_t t pc))
(k: sum_key t)
: Tot (leaf_reader (parse_sum_cases' t pc k))
= destr
_
(read_sum_cases_t_if t pc)
(fun _ _ -> ())
(fun _ _ _ _ -> ())
(read_sum_cases' t pc pc32)
k
#push-options "--z3rlimit 32"
inline_for_extraction
let read_sum
(#kt: parser_kind)
(t: sum)
(p: parser kt (sum_repr_type t))
(p32: leaf_reader (parse_enum_key p (sum_enum t)))
(j: jumper p)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (leaf_reader (dsnd (pc x)))))
(destr: dep_enum_destr (sum_enum t) (read_sum_cases_t t pc))
: Tot (leaf_reader (parse_sum t p pc))
=
fun #_ #_ input pos ->
let h = HST.get () in
valid_facts (parse_sum t p pc) h input pos;
parse_sum_eq' t p pc (bytes_of_slice_from h input pos);
valid_facts (parse_enum_key p (sum_enum t)) h input pos;
let k = p32 input pos in
let pos' = jump_enum_key j (sum_enum t) input pos in
valid_facts (parse_sum_cases' t pc k) h input pos' ;
read_sum_cases t pc pc32 destr k input pos'
#pop-options
inline_for_extraction
let serialize32_sum_cases_t
(t: sum)
(#pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(sc: ((x: sum_key t) -> Tot (serializer (dsnd (pc x)))))
(k: sum_key t)
: Tot Type
= serializer32 (serialize_sum_cases t pc sc k)
let serialize32_sum_cases_t_eq
(t: sum)
(#pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(sc: ((x: sum_key t) -> Tot (serializer (dsnd (pc x)))))
(k: sum_key t)
(x y: serialize32_sum_cases_t t sc k)
: GTot Type0
= True
inline_for_extraction
let serialize32_sum_cases_t_if
(t: sum)
(#pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(sc: ((x: sum_key t) -> Tot (serializer (dsnd (pc x)))))
(k: sum_key t)
: Tot (if_combinator _ (serialize32_sum_cases_t_eq t sc k))
= fun cond (sv_true: (cond_true cond -> Tot (serialize32_sum_cases_t t sc k))) (sv_false: (cond_false cond -> Tot (serialize32_sum_cases_t t sc k))) x #rrel #rel b pos ->
if cond
then (sv_true () x b pos)
else (sv_false () x b pos)
inline_for_extraction
let serialize32_sum_cases_aux
(t: sum)
(#pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(sc: ((x: sum_key t) -> Tot (serializer (dsnd (pc x)))))
(sc32: ((x: sum_key t) -> Tot (serializer32 (sc x))))
(k: sum_key t)
: Tot (serializer32 (serialize_sum_cases t pc sc k))
= fun x #rrel #rel b pos ->
[@inline_let] let _ =
Classical.forall_intro (parse_sum_cases_eq' t pc k);
synth_sum_case_injective t k;
synth_sum_case_inverse t k
in
serialize32_synth
(sc32 k)
(synth_sum_case t k)
(synth_sum_case_recip t k)
(fun x -> synth_sum_case_recip t k x)
()
x
b
pos
inline_for_extraction
let serialize32_sum_cases
(t: sum)
(#pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(sc: ((x: sum_key t) -> Tot (serializer (dsnd (pc x)))))
(sc32: ((x: sum_key t) -> Tot (serializer32 (sc x))))
(destr: dep_enum_destr (sum_enum t) (serialize32_sum_cases_t t sc))
(k: sum_key t)
: Tot (serializer32 (serialize_sum_cases t pc sc k))
= destr
_
(serialize32_sum_cases_t_if t sc)
(fun _ _ -> ())
(fun _ _ _ _ -> ())
(serialize32_sum_cases_aux t sc sc32)
k
inline_for_extraction
let serialize32_sum
(#kt: parser_kind)
(t: sum)
(#p: parser kt (sum_repr_type t))
(s: serializer p {kt.parser_kind_subkind == Some ParserStrong})
(s32: serializer32 (serialize_enum_key _ s (sum_enum t)))
(#pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(sc: ((x: sum_key t) -> Tot (serializer (dsnd (pc x)))))
(sc32: ((x: sum_key t) -> Tot (serializer32 (sc x))))
(destr: dep_enum_destr (sum_enum t) (serialize32_sum_cases_t t sc))
: Tot (serializer32 (serialize_sum t s sc))
= fun x #rrel #rel b pos ->
serialize_sum_eq t s sc x;
let tg = sum_tag_of_data t x in
serialize32_nondep_then_aux s32 (serialize32_sum_cases t sc sc32 destr tg) tg x b pos
let clens_sum_tag
(s: sum)
: Tot (clens (sum_type s) (sum_key s))
= {
clens_cond = (fun _ -> True);
clens_get = sum_tag_of_data s;
}
let gaccessor_sum_tag
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
: Tot (gaccessor (parse_sum t p pc) (parse_enum_key p (sum_enum t)) (clens_sum_tag t))
= gaccessor_tagged_union_tag
(parse_enum_key p (sum_enum t))
(sum_tag_of_data t)
(parse_sum_cases t pc)
inline_for_extraction
let accessor_sum_tag
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
: Tot (accessor (gaccessor_sum_tag t p pc))
= accessor_tagged_union_tag
(parse_enum_key p (sum_enum t))
(sum_tag_of_data t)
(parse_sum_cases t pc)
let clens_sum_payload
(s: sum)
(k: sum_key s)
: Tot (clens (sum_type s) (sum_type_of_tag s k))
= {
clens_cond = (fun (x: sum_type s) -> sum_tag_of_data s x == k);
clens_get = (fun (x: sum_type s) -> synth_sum_case_recip s k x <: Ghost (sum_type_of_tag s k) (requires (sum_tag_of_data s x == k)) (ensures (fun _ -> True)));
}
#push-options "--z3rlimit 32"
let gaccessor_clens_sum_payload'
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (gaccessor' (parse_sum t p pc) (dsnd (pc k)) (clens_sum_payload t k))
= fun (input: bytes) ->
parse_sum_eq'' t p pc input;
let res =
match parse p input with
| Some (_, consumed) ->
synth_sum_case_inverse t k;
synth_sum_case_injective t k;
synth_injective_synth_inverse_synth_inverse_recip (synth_sum_case t k) (synth_sum_case_recip t k) ();
(consumed)
| _ -> 0 // dummy
in
(res <: (res: _ { gaccessor_post' (parse_sum t p pc) (dsnd (pc k)) (clens_sum_payload t k) input res } ))
#push-options "--z3rlimit 64"
let gaccessor_clens_sum_payload_injective
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
(sl sl' : bytes)
: Lemma
(requires (
gaccessor_pre (parse_sum t p pc) (dsnd (pc k)) (clens_sum_payload t k) sl /\
gaccessor_pre (parse_sum t p pc) (dsnd (pc k)) (clens_sum_payload t k) sl' /\
injective_precond (parse_sum t p pc) sl sl'
))
(ensures (gaccessor_clens_sum_payload' t p pc k sl == gaccessor_clens_sum_payload' t p pc k sl'))
= parse_sum_eq'' t p pc sl;
parse_sum_eq'' t p pc sl' ;
parse_injective (parse_sum t p pc) sl sl' ;
parse_injective p sl sl'
#pop-options
let gaccessor_clens_sum_payload_no_lookahead
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
(sl sl' : bytes)
: Lemma
(requires (
(parse_sum_kind kt t pc).parser_kind_subkind == Some ParserStrong /\
gaccessor_pre (parse_sum t p pc) (dsnd (pc k)) (clens_sum_payload t k) sl /\
gaccessor_pre (parse_sum t p pc) (dsnd (pc k)) (clens_sum_payload t k) sl' /\
no_lookahead_on_precond (parse_sum t p pc) sl sl'
))
(ensures (gaccessor_clens_sum_payload' t p pc k sl == gaccessor_clens_sum_payload' t p pc k sl'))
= parse_sum_eq'' t p pc sl;
parse_sum_eq'' t p pc sl' ;
parse_strong_prefix (parse_sum t p pc) sl sl' ;
parse_injective p sl sl'
let gaccessor_clens_sum_payload
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (gaccessor (parse_sum t p pc) (dsnd (pc k)) (clens_sum_payload t k))
= Classical.forall_intro_2 (fun x -> Classical.move_requires (gaccessor_clens_sum_payload_injective t p pc k x));
Classical.forall_intro_2 (fun x -> Classical.move_requires (gaccessor_clens_sum_payload_no_lookahead t p pc k x));
gaccessor_prop_equiv (parse_sum t p pc) (dsnd (pc k)) (clens_sum_payload t k) (gaccessor_clens_sum_payload' t p pc k);
gaccessor_clens_sum_payload' t p pc k
inline_for_extraction
let accessor_clens_sum_payload'
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(j: jumper p)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: HST.Stack U32.t
(requires (fun h ->
valid (parse_sum t p pc) h input pos /\
(clens_sum_payload t k).clens_cond (contents (parse_sum t p pc) h input pos)
))
(ensures (fun h pos' h' ->
B.modifies B.loc_none h h' /\
pos' == slice_access h (gaccessor_clens_sum_payload t p pc k) input pos
))
=
let h = HST.get () in
[@inline_let]
let _ =
let pos' = get_valid_pos (parse_sum t p pc) h input pos in
let large = bytes_of_slice_from h input pos in
slice_access_eq h (gaccessor_clens_sum_payload t p pc k) input pos;
valid_facts (parse_sum t p pc) h input pos;
parse_sum_eq'' t p pc large;
valid_facts p h input pos
in
j input pos
#pop-options
inline_for_extraction
let accessor_clens_sum_payload
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(j: jumper p)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (accessor (gaccessor_clens_sum_payload t p pc k))
= fun #rrel #rel -> accessor_clens_sum_payload' t j pc k #rrel #rel
let clens_sum_cases_payload
(s: sum)
(k: sum_key s)
: Tot (clens (sum_cases s k) (sum_type_of_tag s k))
= {
clens_cond = (fun (x: sum_cases s k) -> True);
clens_get = (fun (x: sum_cases s k) -> synth_sum_case_recip s k x <: Ghost (sum_type_of_tag s k) (requires (True)) (ensures (fun _ -> True)));
} | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"LowStar.Buffer.fst.checked",
"LowParse.Spec.Sum.fst.checked",
"LowParse.Low.Enum.fst.checked",
"FStar.UInt64.fsti.checked",
"FStar.UInt32.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Int.Cast.fst.checked",
"FStar.HyperStack.ST.fsti.checked",
"FStar.HyperStack.fst.checked",
"FStar.Classical.fsti.checked"
],
"interface_file": false,
"source_file": "LowParse.Low.Sum.fst"
} | [
{
"abbrev": true,
"full_module": "FStar.HyperStack",
"short_module": "HS"
},
{
"abbrev": true,
"full_module": "FStar.UInt64",
"short_module": "U64"
},
{
"abbrev": true,
"full_module": "FStar.Int.Cast",
"short_module": "Cast"
},
{
"abbrev": true,
"full_module": "LowStar.Buffer",
"short_module": "B"
},
{
"abbrev": true,
"full_module": "FStar.HyperStack.ST",
"short_module": "HST"
},
{
"abbrev": true,
"full_module": "FStar.UInt32",
"short_module": "U32"
},
{
"abbrev": false,
"full_module": "LowParse.Spec.Sum",
"short_module": null
},
{
"abbrev": false,
"full_module": "LowParse.Low.Enum",
"short_module": null
},
{
"abbrev": false,
"full_module": "LowParse.Low",
"short_module": null
},
{
"abbrev": false,
"full_module": "LowParse.Low",
"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",
"short_module": null
}
] | {
"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_elim_box": false,
"smtencoding_l_arith_repr": "boxwrap",
"smtencoding_nl_arith_repr": "boxwrap",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": true,
"z3cliopt": [],
"z3refresh": false,
"z3rlimit": 5,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | false |
t: LowParse.Spec.Sum.sum ->
pc:
(x: LowParse.Spec.Sum.sum_key t
-> Prims.dtuple2 LowParse.Spec.Base.parser_kind
(fun k -> LowParse.Spec.Base.parser k (LowParse.Spec.Sum.sum_type_of_tag t x))) ->
k: LowParse.Spec.Sum.sum_key t
-> LowParse.Low.Base.Spec.gaccessor (LowParse.Spec.Sum.parse_sum_cases' t pc k)
(FStar.Pervasives.dsnd (pc k))
(LowParse.Low.Sum.clens_sum_cases_payload t k) | Prims.Tot | [
"total"
] | [] | [
"LowParse.Spec.Sum.sum",
"LowParse.Spec.Sum.sum_key",
"Prims.dtuple2",
"LowParse.Spec.Base.parser_kind",
"LowParse.Spec.Base.parser",
"LowParse.Spec.Sum.sum_type_of_tag",
"LowParse.Low.Base.Spec.gaccessor_ext",
"Prims.__proj__Mkdtuple2__item___1",
"LowParse.Spec.Sum.sum_cases",
"LowParse.Spec.Combinators.parse_synth",
"FStar.Pervasives.dsnd",
"LowParse.Spec.Sum.synth_sum_case",
"LowParse.Low.Combinators.clens_synth",
"LowParse.Spec.Sum.synth_sum_case_recip",
"LowParse.Low.Combinators.gaccessor_synth",
"LowParse.Low.Sum.clens_sum_cases_payload",
"Prims.unit",
"LowParse.Spec.Combinators.synth_injective_synth_inverse_synth_inverse_recip",
"LowParse.Spec.Sum.synth_sum_case_inverse",
"LowParse.Spec.Sum.synth_sum_case_injective",
"LowParse.Low.Base.Spec.gaccessor",
"FStar.Pervasives.dfst",
"LowParse.Spec.Sum.parse_sum_cases'"
] | [] | false | false | false | false | false | let gaccessor_clens_sum_cases_payload
(t: sum)
(pc: (x: sum_key t -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (gaccessor (parse_sum_cases' t pc k) (dsnd (pc k)) (clens_sum_cases_payload t k)) =
| synth_sum_case_injective t k;
synth_sum_case_inverse t k;
synth_injective_synth_inverse_synth_inverse_recip (synth_sum_case t k) (synth_sum_case_recip t k) ();
gaccessor_ext (gaccessor_synth (dsnd (pc k)) (synth_sum_case t k) (synth_sum_case_recip t k) ())
(clens_sum_cases_payload t k)
() | false |
LowParse.Low.Sum.fst | LowParse.Low.Sum.accessor_clens_sum_cases_payload | val accessor_clens_sum_cases_payload
(t: sum)
(pc: (x: sum_key t -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (accessor (gaccessor_clens_sum_cases_payload t pc k)) | val accessor_clens_sum_cases_payload
(t: sum)
(pc: (x: sum_key t -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (accessor (gaccessor_clens_sum_cases_payload t pc k)) | let accessor_clens_sum_cases_payload
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (accessor (gaccessor_clens_sum_cases_payload t pc k))
= [@inline_let]
let _ =
synth_sum_case_injective t k;
synth_sum_case_inverse t k;
synth_injective_synth_inverse_synth_inverse_recip (synth_sum_case t k) (synth_sum_case_recip t k) ()
in
accessor_ext
(accessor_synth (dsnd (pc k)) (synth_sum_case t k) (synth_sum_case_recip t k) ())
(clens_sum_cases_payload t k)
() | {
"file_name": "src/lowparse/LowParse.Low.Sum.fst",
"git_rev": "00217c4a89f5ba56002ba9aa5b4a9d5903bfe9fa",
"git_url": "https://github.com/project-everest/everparse.git",
"project_name": "everparse"
} | {
"end_col": 6,
"end_line": 954,
"start_col": 0,
"start_line": 940
} | module LowParse.Low.Sum
include LowParse.Low.Enum
include LowParse.Spec.Sum
module U32 = FStar.UInt32
module HST = FStar.HyperStack.ST
module B = LowStar.Buffer
module Cast = FStar.Int.Cast
module U64 = FStar.UInt64
inline_for_extraction
let validate_sum_cases_aux
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(vc: ((x: sum_key t) -> Tot (validator (dsnd (pc x)))))
(k: sum_key t)
: Tot (validator (parse_sum_cases t pc k))
= [@inline_let]
let _ = synth_sum_case_injective t k in
validate_synth
(validate_weaken
(weaken_parse_cases_kind t pc)
(vc k)
()
)
(synth_sum_case t k)
()
inline_for_extraction
let validate_sum_cases_t
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot Type
= validator (parse_sum_cases t pc k)
let validate_sum_cases_t_eq
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
(x y : validate_sum_cases_t t pc k)
: GTot Type0
= True
inline_for_extraction
let validate_sum_cases_t_if
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (if_combinator _ (validate_sum_cases_t_eq t pc k))
= fun cond (sv_true: cond_true cond -> Tot (validate_sum_cases_t t pc k)) (sv_false: cond_false cond -> Tot (validate_sum_cases_t t pc k)) #rrel #rel input pos ->
if cond
then sv_true () input pos
else sv_false () input pos
inline_for_extraction
let validate_sum_cases
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(vc: ((x: sum_key t) -> Tot (validator (dsnd (pc x)))))
(destr: dep_enum_destr (sum_enum t) (validate_sum_cases_t t pc))
(k: sum_key t)
: Tot (validator (parse_sum_cases t pc k))
= destr
_
(validate_sum_cases_t_if t pc)
(fun _ _ -> ())
(fun _ _ _ _ -> ())
(validate_sum_cases_aux t pc vc)
k
inline_for_extraction
let validate_sum_aux_payload_t
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
: Tot Type
= (#rrel: _) -> (#rel: _) ->
(input: slice rrel rel) ->
(pos: U64.t) ->
HST.Stack U64.t
(requires (fun h -> live_slice h input /\ U64.v pos <= U32.v input.len))
(ensures (fun h res h' ->
B.modifies B.loc_none h h' /\ (
match k with
| Unknown _ -> is_error res
| Known k' ->
if is_success res
then
valid_pos (dsnd (pc k')) h input (uint64_to_uint32 pos) (uint64_to_uint32 res)
else
(~ (valid (dsnd (pc k')) h input (uint64_to_uint32 pos)))
)))
let validate_sum_aux_payload_eq
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
: Tot (validate_sum_aux_payload_t t pc k -> validate_sum_aux_payload_t t pc k -> GTot Type0)
= fun _ _ -> True
inline_for_extraction
let validate_sum_aux_payload_if'
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
(cond: bool)
(ift: ((cond_true cond) -> Tot (validate_sum_aux_payload_t t pc k)))
(iff: ((cond_false cond) -> Tot (validate_sum_aux_payload_t t pc k)))
: Tot (validate_sum_aux_payload_t t pc k)
= fun #rrel #rel input pos ->
if cond
then begin
(ift () <: validate_sum_aux_payload_t t pc k) input pos
end else
(iff () <: validate_sum_aux_payload_t t pc k) input pos
inline_for_extraction
let validate_sum_aux_payload_if
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
: Tot (if_combinator _ (validate_sum_aux_payload_eq t pc k))
= validate_sum_aux_payload_if' t pc k
#push-options "--z3rlimit 64 --z3cliopt smt.arith.nl=false --using_facts_from '* -FStar.Int.Cast -LowParse.BitFields'"
// --query_stats --smtencoding.elim_box true --smtencoding.l_arith_repr native --z3refresh"
inline_for_extraction
let validate_sum_aux
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(v: validator p)
(p32: leaf_reader p)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(v_payload: ((k: sum_repr_type t)) -> Tot (validate_sum_aux_payload_t t pc (maybe_enum_key_of_repr (sum_enum t) k)))
: Tot (validator (parse_sum t p pc))
= fun #rrel #rel input pos ->
let h = HST.get () in
[@inline_let]
let _ = parse_sum_eq'' t p pc (bytes_of_slice_from h input (uint64_to_uint32 pos)) in
[@inline_let]
let _ = valid_facts (parse_sum t p pc) h input (uint64_to_uint32 pos) in
[@inline_let]
let _ = valid_facts p h input (uint64_to_uint32 pos) in
let len_after_tag = v input pos in
if is_error len_after_tag
then len_after_tag
else begin
let h1 = HST.get () in
let k' = p32 input (uint64_to_uint32 pos) in
[@inline_let]
let _ =
match maybe_enum_key_of_repr (sum_enum t) k' with
| Known k -> valid_facts (dsnd (pc k)) h input (uint64_to_uint32 len_after_tag)
| _ -> ()
in
v_payload k' input len_after_tag
end
#pop-options
inline_for_extraction
let validate_sum_aux_payload'
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (validator (dsnd (pc x)))))
(k: maybe_enum_key (sum_enum t))
: Tot (validate_sum_aux_payload_t t pc k)
= fun #rrel #rel input pos ->
match k with
| Known k ->
[@inline_let]
let _ = synth_sum_case_injective t k in
pc32 k input pos
// validate_synth (pc32 k) (synth_sum_case t k) () input pos
| _ -> validator_error_generic
inline_for_extraction
let validate_sum_aux_payload
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (validator (dsnd (pc x)))))
(destr: dep_maybe_enum_destr_t (sum_enum t) (validate_sum_aux_payload_t t pc))
(k: sum_repr_type t)
: Tot (validate_sum_aux_payload_t t pc (maybe_enum_key_of_repr (sum_enum t) k))
= destr (validate_sum_aux_payload_eq t pc) (validate_sum_aux_payload_if t pc) (fun _ _ -> ()) (fun _ _ _ _ -> ()) (validate_sum_aux_payload' t pc pc32) k
inline_for_extraction
let validate_sum
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(v: validator p)
(p32: leaf_reader p)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (validator (dsnd (pc x)))))
(destr: dep_maybe_enum_destr_t (sum_enum t) (validate_sum_aux_payload_t t pc))
: Tot (validator (parse_sum t p pc))
= validate_sum_aux t v p32 pc (validate_sum_aux_payload t pc pc32 destr)
module HS = FStar.HyperStack
#push-options "--z3rlimit 256 --z3cliopt smt.arith.nl=false --initial_ifuel 8 --max_ifuel 8 --initial_fuel 2 --max_fuel 2"
#restart-solver
let valid_sum_intro
(h: HS.mem)
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: Lemma
(requires (
valid (parse_enum_key p (sum_enum t)) h input pos /\ (
let k = contents (parse_enum_key p (sum_enum t)) h input pos in
valid (dsnd (pc k)) h input (get_valid_pos (parse_enum_key p (sum_enum t)) h input pos)
)))
(ensures (
let k = contents (parse_enum_key p (sum_enum t)) h input pos in
let pos_payload = get_valid_pos (parse_enum_key p (sum_enum t)) h input pos in
valid_content_pos
(parse_sum t p pc) h input pos
(synth_sum_case t k (contents (dsnd (pc k)) h input pos_payload))
(get_valid_pos (dsnd (pc k)) h input pos_payload)
))
= valid_facts (parse_enum_key p (sum_enum t)) h input pos;
let k = contents (parse_enum_key p (sum_enum t)) h input pos in
let pos_payload = get_valid_pos (parse_enum_key p (sum_enum t)) h input pos in
valid_facts (dsnd (pc k)) h input pos_payload;
valid_facts (parse_sum t p pc) h input pos;
parse_sum_eq t p pc (bytes_of_slice_from h input pos)
#pop-options
inline_for_extraction
let finalize_sum_case
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(s: serializer p)
(w: leaf_writer_strong s)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(destr: enum_repr_of_key'_t (sum_enum t))
(k: sum_key t)
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: HST.Stack unit
(requires (fun h ->
let len_tag = serialized_length (serialize_enum_key _ s (sum_enum t)) k in
U32.v pos + len_tag < 4294967296 /\ (
let pos_payload = pos `U32.add` U32.uint_to_t len_tag in
valid (dsnd (pc k)) h input pos_payload /\
writable input.base (U32.v pos) (U32.v pos_payload) h
)))
(ensures (fun h _ h' ->
let len_tag = serialized_length (serialize_enum_key _ s (sum_enum t)) k in
let pos_payload = pos `U32.add` U32.uint_to_t len_tag in
B.modifies (loc_slice_from_to input pos pos_payload) h h' /\
valid_content_pos (parse_sum t p pc) h' input pos (synth_sum_case t k (contents (dsnd (pc k)) h input pos_payload)) (get_valid_pos (dsnd (pc k)) h input pos_payload)
))
= let pos1 = write_enum_key w (sum_enum t) destr k input pos in
let h = HST.get () in
[@inline_let]
let _ = valid_sum_intro h t p pc input pos in
()
inline_for_extraction
let jump_sum_cases_aux
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(vc: ((x: sum_key t) -> Tot (jumper (dsnd (pc x)))))
(k: sum_key t)
: Tot (jumper (parse_sum_cases t pc k))
= [@inline_let]
let _ = synth_sum_case_injective t k in
jump_synth
(jump_weaken
(weaken_parse_cases_kind t pc)
(vc k)
()
)
(synth_sum_case t k)
()
inline_for_extraction
let jump_sum_cases_t
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot Type
= jumper (parse_sum_cases t pc k)
let jump_sum_cases_t_eq
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
(x y : jump_sum_cases_t t pc k)
: GTot Type0
= True
inline_for_extraction
let jump_sum_cases_t_if
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (if_combinator _ (jump_sum_cases_t_eq t pc k))
= fun cond (sv_true: cond_true cond -> Tot (jump_sum_cases_t t pc k)) (sv_false: cond_false cond -> Tot (jump_sum_cases_t t pc k)) #rrel #rel input pos ->
if cond
then sv_true () input pos
else sv_false () input pos
inline_for_extraction
let jump_sum_cases
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(vc: ((x: sum_key t) -> Tot (jumper (dsnd (pc x)))))
(destr: dep_enum_destr (sum_enum t) (jump_sum_cases_t t pc))
(k: sum_key t)
: Tot (jumper (parse_sum_cases t pc k))
= destr
_
(jump_sum_cases_t_if t pc)
(fun _ _ -> ())
(fun _ _ _ _ -> ())
(jump_sum_cases_aux t pc vc)
k
inline_for_extraction
let jump_sum_aux_payload_t
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
: Tot Type
= (#rrel: _) -> (#rel: _) ->
(input: slice rrel rel) ->
(pos: U32.t) ->
HST.Stack U32.t
(requires (fun h -> live_slice h input /\ U32.v pos <= U32.v input.len /\ (
match k with
| Unknown _ -> False
| Known k' -> valid (dsnd (pc k')) h input pos
)))
(ensures (fun h res h' ->
B.modifies B.loc_none h h' /\ (
match k with
| Unknown _ -> False
| Known k' ->
valid_pos (dsnd (pc k')) h input pos res
)))
let jump_sum_aux_payload_eq
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
: Tot (jump_sum_aux_payload_t t pc k -> jump_sum_aux_payload_t t pc k -> GTot Type0)
= fun _ _ -> True
inline_for_extraction
let jump_sum_aux_payload_if'
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
(cond: bool)
(ift: ((cond_true cond) -> Tot (jump_sum_aux_payload_t t pc k)))
(iff: ((cond_false cond) -> Tot (jump_sum_aux_payload_t t pc k)))
: Tot (jump_sum_aux_payload_t t pc k)
= fun #rrel #rel input pos ->
if cond
then begin
(ift () <: jump_sum_aux_payload_t t pc k) input pos
end else
(iff () <: jump_sum_aux_payload_t t pc k) input pos
inline_for_extraction
let jump_sum_aux_payload_if
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
: Tot (if_combinator _ (jump_sum_aux_payload_eq t pc k))
= jump_sum_aux_payload_if' t pc k
let parse_sum_eq3
(#kt: parser_kind)
(t: sum)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(input: bytes)
(k' : sum_repr_type t)
(consumed_k: consumed_length input)
: Lemma
(requires (Some? (parse (parse_sum t p pc) input) /\ parse p input == Some (k', consumed_k)))
(ensures (
let input_k = Seq.slice input consumed_k (Seq.length input) in
let k = maybe_enum_key_of_repr (sum_enum t) k' in
begin match k with
| Known k ->
Some? (parse (dsnd (pc k)) input_k)
| _ -> False
end
))
= parse_sum_eq'' t p pc input
let parse_sum_eq4
(#kt: parser_kind)
(t: sum)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(input: bytes)
(k' : sum_repr_type t)
(consumed_k: consumed_length input)
(consumed_payload: nat)
: Lemma
(requires (Some? (parse (parse_sum t p pc) input) /\ parse p input == Some (k', consumed_k) /\ (
let input_k = Seq.slice input consumed_k (Seq.length input) in
let k = maybe_enum_key_of_repr (sum_enum t) k' in
begin match k with
| Known k ->
Some? (parse (dsnd (pc k)) input_k) /\ (
let Some (_, consumed_payload') = parse (dsnd (pc k)) input_k in
consumed_payload' == consumed_payload
)
| _ -> False
end
)))
(ensures (
let Some (_, consumed) = parse (parse_sum t p pc) input in
consumed == consumed_k + consumed_payload
))
= parse_sum_eq'' t p pc input
#push-options "--z3rlimit 16"
let valid_sum_elim
(h: HS.mem)
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(#rrel: _) (#rel: _)
(input: slice rrel rel)
(pos: U32.t)
: Lemma
(requires (
valid (parse_sum t p pc) h input pos
))
(ensures (
valid p h input pos /\ (
let pos_payload = get_valid_pos p h input pos in
let k' = maybe_enum_key_of_repr (sum_enum t) (contents p h input pos) in
match k' with
| Known k ->
k == sum_tag_of_data t (contents (parse_sum t p pc) h input pos) /\
valid (dsnd (pc k)) h input pos_payload /\
valid_pos
(parse_sum t p pc) h input pos
(get_valid_pos (dsnd (pc k)) h input pos_payload)
| _ -> False
)))
= let sinput = bytes_of_slice_from h input pos in
let _ = parse_sum_eq'' t p pc sinput in
[@inline_let]
let _ = valid_facts (parse_sum t p pc) h input pos in
let Some (k', consumed_k) = parse p sinput in
let pos_after_tag = U32.uint_to_t (U32.v pos + consumed_k) in
[@inline_let]
let _ = valid_facts p h input pos in
assert (valid_content_pos p h input pos k' pos_after_tag);
match maybe_enum_key_of_repr (sum_enum t) k' with
| Known k -> valid_facts (dsnd (pc k)) h input pos_after_tag
| _ -> ()
#pop-options
let valid_sum_elim_tag
(h: HS.mem)
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: Lemma
(requires (
valid (parse_sum t p pc) h input pos
))
(ensures (
valid (parse_enum_key p (sum_enum t)) h input pos /\
contents (parse_enum_key p (sum_enum t)) h input pos == sum_tag_of_data t (contents (parse_sum t p pc) h input pos)
))
= let _ = parse_sum_eq' t p pc (bytes_of_slice_from h input pos) in
let _ = valid_facts (parse_sum t p pc) h input pos in
let _ = valid_facts (parse_enum_key p (sum_enum t)) h input pos in
()
inline_for_extraction
let read_sum_tag
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(p32: leaf_reader p)
(destr: dep_maybe_enum_destr_t (sum_enum t) (read_enum_key_t (sum_enum t)))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: HST.Stack (sum_key t)
(requires (fun h ->
valid (parse_sum t p pc) h input pos
))
(ensures (fun h res h' ->
B.modifies B.loc_none h h' /\
res == sum_tag_of_data t (contents (parse_sum t p pc) h input pos)
))
= let h = HST.get () in
[@inline_let] let _ = valid_sum_elim_tag h t p pc input pos in
read_enum_key p32 (sum_enum t) destr input pos
inline_for_extraction
let jump_sum_aux
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(v: jumper p)
(p32: leaf_reader p)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(v_payload: ((k: sum_repr_type t)) -> Tot (jump_sum_aux_payload_t t pc (maybe_enum_key_of_repr (sum_enum t) k)))
: Tot (jumper (parse_sum t p pc))
= fun #rrel #rel input pos ->
let h = HST.get () in
[@inline_let]
let _ = valid_sum_elim h t p pc input pos in
let pos_after_tag = v input pos in
let k' = p32 input pos in
v_payload k' input pos_after_tag
inline_for_extraction
let jump_sum_aux_payload'
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (jumper (dsnd (pc x)))))
(k: maybe_enum_key (sum_enum t))
: Tot (jump_sum_aux_payload_t t pc k)
= fun #rrel #rel input pos ->
match k with
| Known k ->
[@inline_let]
let _ = synth_sum_case_injective t k in
pc32 k input pos
| _ -> 0ul // dummy, but we MUST NOT remove this branch, otherwise extraction fails
inline_for_extraction
let jump_sum_aux_payload
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (jumper (dsnd (pc x)))))
(destr: dep_maybe_enum_destr_t (sum_enum t) (jump_sum_aux_payload_t t pc))
(k: sum_repr_type t)
: Tot (jump_sum_aux_payload_t t pc (maybe_enum_key_of_repr (sum_enum t) k))
= destr (jump_sum_aux_payload_eq t pc) (jump_sum_aux_payload_if t pc) (fun _ _ -> ()) (fun _ _ _ _ -> ()) (jump_sum_aux_payload' t pc pc32) k
inline_for_extraction
let jump_sum
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(v: jumper p)
(p32: leaf_reader p)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (jumper (dsnd (pc x)))))
(destr: dep_maybe_enum_destr_t (sum_enum t) (jump_sum_aux_payload_t t pc))
: Tot (jumper (parse_sum t p pc))
= jump_sum_aux t v p32 pc (jump_sum_aux_payload t pc pc32 destr)
inline_for_extraction
let read_sum_cases'
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (leaf_reader (dsnd (pc x)))))
(k: sum_key t)
: Tot (leaf_reader (parse_sum_cases' t pc k))
= [@inline_let]
let _ = synth_sum_case_injective t k in
read_synth'
(dsnd (pc k))
(synth_sum_case t k)
(pc32 k)
()
inline_for_extraction
let read_sum_cases_t
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot Type
= leaf_reader (parse_sum_cases' t pc k)
let read_sum_cases_t_eq
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
(x y : read_sum_cases_t t pc k)
: GTot Type0
= True
inline_for_extraction
let read_sum_cases_t_if
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (if_combinator _ (read_sum_cases_t_eq t pc k))
= fun cond (sv_true: cond_true cond -> Tot (read_sum_cases_t t pc k)) (sv_false: cond_false cond -> Tot (read_sum_cases_t t pc k)) #_ #_ input pos ->
if cond
then (sv_true () input pos)
else (sv_false () input pos)
inline_for_extraction
let read_sum_cases
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (leaf_reader (dsnd (pc x)))))
(destr: dep_enum_destr (sum_enum t) (read_sum_cases_t t pc))
(k: sum_key t)
: Tot (leaf_reader (parse_sum_cases' t pc k))
= destr
_
(read_sum_cases_t_if t pc)
(fun _ _ -> ())
(fun _ _ _ _ -> ())
(read_sum_cases' t pc pc32)
k
#push-options "--z3rlimit 32"
inline_for_extraction
let read_sum
(#kt: parser_kind)
(t: sum)
(p: parser kt (sum_repr_type t))
(p32: leaf_reader (parse_enum_key p (sum_enum t)))
(j: jumper p)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (leaf_reader (dsnd (pc x)))))
(destr: dep_enum_destr (sum_enum t) (read_sum_cases_t t pc))
: Tot (leaf_reader (parse_sum t p pc))
=
fun #_ #_ input pos ->
let h = HST.get () in
valid_facts (parse_sum t p pc) h input pos;
parse_sum_eq' t p pc (bytes_of_slice_from h input pos);
valid_facts (parse_enum_key p (sum_enum t)) h input pos;
let k = p32 input pos in
let pos' = jump_enum_key j (sum_enum t) input pos in
valid_facts (parse_sum_cases' t pc k) h input pos' ;
read_sum_cases t pc pc32 destr k input pos'
#pop-options
inline_for_extraction
let serialize32_sum_cases_t
(t: sum)
(#pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(sc: ((x: sum_key t) -> Tot (serializer (dsnd (pc x)))))
(k: sum_key t)
: Tot Type
= serializer32 (serialize_sum_cases t pc sc k)
let serialize32_sum_cases_t_eq
(t: sum)
(#pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(sc: ((x: sum_key t) -> Tot (serializer (dsnd (pc x)))))
(k: sum_key t)
(x y: serialize32_sum_cases_t t sc k)
: GTot Type0
= True
inline_for_extraction
let serialize32_sum_cases_t_if
(t: sum)
(#pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(sc: ((x: sum_key t) -> Tot (serializer (dsnd (pc x)))))
(k: sum_key t)
: Tot (if_combinator _ (serialize32_sum_cases_t_eq t sc k))
= fun cond (sv_true: (cond_true cond -> Tot (serialize32_sum_cases_t t sc k))) (sv_false: (cond_false cond -> Tot (serialize32_sum_cases_t t sc k))) x #rrel #rel b pos ->
if cond
then (sv_true () x b pos)
else (sv_false () x b pos)
inline_for_extraction
let serialize32_sum_cases_aux
(t: sum)
(#pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(sc: ((x: sum_key t) -> Tot (serializer (dsnd (pc x)))))
(sc32: ((x: sum_key t) -> Tot (serializer32 (sc x))))
(k: sum_key t)
: Tot (serializer32 (serialize_sum_cases t pc sc k))
= fun x #rrel #rel b pos ->
[@inline_let] let _ =
Classical.forall_intro (parse_sum_cases_eq' t pc k);
synth_sum_case_injective t k;
synth_sum_case_inverse t k
in
serialize32_synth
(sc32 k)
(synth_sum_case t k)
(synth_sum_case_recip t k)
(fun x -> synth_sum_case_recip t k x)
()
x
b
pos
inline_for_extraction
let serialize32_sum_cases
(t: sum)
(#pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(sc: ((x: sum_key t) -> Tot (serializer (dsnd (pc x)))))
(sc32: ((x: sum_key t) -> Tot (serializer32 (sc x))))
(destr: dep_enum_destr (sum_enum t) (serialize32_sum_cases_t t sc))
(k: sum_key t)
: Tot (serializer32 (serialize_sum_cases t pc sc k))
= destr
_
(serialize32_sum_cases_t_if t sc)
(fun _ _ -> ())
(fun _ _ _ _ -> ())
(serialize32_sum_cases_aux t sc sc32)
k
inline_for_extraction
let serialize32_sum
(#kt: parser_kind)
(t: sum)
(#p: parser kt (sum_repr_type t))
(s: serializer p {kt.parser_kind_subkind == Some ParserStrong})
(s32: serializer32 (serialize_enum_key _ s (sum_enum t)))
(#pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(sc: ((x: sum_key t) -> Tot (serializer (dsnd (pc x)))))
(sc32: ((x: sum_key t) -> Tot (serializer32 (sc x))))
(destr: dep_enum_destr (sum_enum t) (serialize32_sum_cases_t t sc))
: Tot (serializer32 (serialize_sum t s sc))
= fun x #rrel #rel b pos ->
serialize_sum_eq t s sc x;
let tg = sum_tag_of_data t x in
serialize32_nondep_then_aux s32 (serialize32_sum_cases t sc sc32 destr tg) tg x b pos
let clens_sum_tag
(s: sum)
: Tot (clens (sum_type s) (sum_key s))
= {
clens_cond = (fun _ -> True);
clens_get = sum_tag_of_data s;
}
let gaccessor_sum_tag
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
: Tot (gaccessor (parse_sum t p pc) (parse_enum_key p (sum_enum t)) (clens_sum_tag t))
= gaccessor_tagged_union_tag
(parse_enum_key p (sum_enum t))
(sum_tag_of_data t)
(parse_sum_cases t pc)
inline_for_extraction
let accessor_sum_tag
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
: Tot (accessor (gaccessor_sum_tag t p pc))
= accessor_tagged_union_tag
(parse_enum_key p (sum_enum t))
(sum_tag_of_data t)
(parse_sum_cases t pc)
let clens_sum_payload
(s: sum)
(k: sum_key s)
: Tot (clens (sum_type s) (sum_type_of_tag s k))
= {
clens_cond = (fun (x: sum_type s) -> sum_tag_of_data s x == k);
clens_get = (fun (x: sum_type s) -> synth_sum_case_recip s k x <: Ghost (sum_type_of_tag s k) (requires (sum_tag_of_data s x == k)) (ensures (fun _ -> True)));
}
#push-options "--z3rlimit 32"
let gaccessor_clens_sum_payload'
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (gaccessor' (parse_sum t p pc) (dsnd (pc k)) (clens_sum_payload t k))
= fun (input: bytes) ->
parse_sum_eq'' t p pc input;
let res =
match parse p input with
| Some (_, consumed) ->
synth_sum_case_inverse t k;
synth_sum_case_injective t k;
synth_injective_synth_inverse_synth_inverse_recip (synth_sum_case t k) (synth_sum_case_recip t k) ();
(consumed)
| _ -> 0 // dummy
in
(res <: (res: _ { gaccessor_post' (parse_sum t p pc) (dsnd (pc k)) (clens_sum_payload t k) input res } ))
#push-options "--z3rlimit 64"
let gaccessor_clens_sum_payload_injective
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
(sl sl' : bytes)
: Lemma
(requires (
gaccessor_pre (parse_sum t p pc) (dsnd (pc k)) (clens_sum_payload t k) sl /\
gaccessor_pre (parse_sum t p pc) (dsnd (pc k)) (clens_sum_payload t k) sl' /\
injective_precond (parse_sum t p pc) sl sl'
))
(ensures (gaccessor_clens_sum_payload' t p pc k sl == gaccessor_clens_sum_payload' t p pc k sl'))
= parse_sum_eq'' t p pc sl;
parse_sum_eq'' t p pc sl' ;
parse_injective (parse_sum t p pc) sl sl' ;
parse_injective p sl sl'
#pop-options
let gaccessor_clens_sum_payload_no_lookahead
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
(sl sl' : bytes)
: Lemma
(requires (
(parse_sum_kind kt t pc).parser_kind_subkind == Some ParserStrong /\
gaccessor_pre (parse_sum t p pc) (dsnd (pc k)) (clens_sum_payload t k) sl /\
gaccessor_pre (parse_sum t p pc) (dsnd (pc k)) (clens_sum_payload t k) sl' /\
no_lookahead_on_precond (parse_sum t p pc) sl sl'
))
(ensures (gaccessor_clens_sum_payload' t p pc k sl == gaccessor_clens_sum_payload' t p pc k sl'))
= parse_sum_eq'' t p pc sl;
parse_sum_eq'' t p pc sl' ;
parse_strong_prefix (parse_sum t p pc) sl sl' ;
parse_injective p sl sl'
let gaccessor_clens_sum_payload
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (gaccessor (parse_sum t p pc) (dsnd (pc k)) (clens_sum_payload t k))
= Classical.forall_intro_2 (fun x -> Classical.move_requires (gaccessor_clens_sum_payload_injective t p pc k x));
Classical.forall_intro_2 (fun x -> Classical.move_requires (gaccessor_clens_sum_payload_no_lookahead t p pc k x));
gaccessor_prop_equiv (parse_sum t p pc) (dsnd (pc k)) (clens_sum_payload t k) (gaccessor_clens_sum_payload' t p pc k);
gaccessor_clens_sum_payload' t p pc k
inline_for_extraction
let accessor_clens_sum_payload'
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(j: jumper p)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: HST.Stack U32.t
(requires (fun h ->
valid (parse_sum t p pc) h input pos /\
(clens_sum_payload t k).clens_cond (contents (parse_sum t p pc) h input pos)
))
(ensures (fun h pos' h' ->
B.modifies B.loc_none h h' /\
pos' == slice_access h (gaccessor_clens_sum_payload t p pc k) input pos
))
=
let h = HST.get () in
[@inline_let]
let _ =
let pos' = get_valid_pos (parse_sum t p pc) h input pos in
let large = bytes_of_slice_from h input pos in
slice_access_eq h (gaccessor_clens_sum_payload t p pc k) input pos;
valid_facts (parse_sum t p pc) h input pos;
parse_sum_eq'' t p pc large;
valid_facts p h input pos
in
j input pos
#pop-options
inline_for_extraction
let accessor_clens_sum_payload
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(j: jumper p)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (accessor (gaccessor_clens_sum_payload t p pc k))
= fun #rrel #rel -> accessor_clens_sum_payload' t j pc k #rrel #rel
let clens_sum_cases_payload
(s: sum)
(k: sum_key s)
: Tot (clens (sum_cases s k) (sum_type_of_tag s k))
= {
clens_cond = (fun (x: sum_cases s k) -> True);
clens_get = (fun (x: sum_cases s k) -> synth_sum_case_recip s k x <: Ghost (sum_type_of_tag s k) (requires (True)) (ensures (fun _ -> True)));
}
let gaccessor_clens_sum_cases_payload
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (gaccessor (parse_sum_cases' t pc k) (dsnd (pc k)) (clens_sum_cases_payload t k))
= synth_sum_case_injective t k;
synth_sum_case_inverse t k;
synth_injective_synth_inverse_synth_inverse_recip (synth_sum_case t k) (synth_sum_case_recip t k) ();
gaccessor_ext
(gaccessor_synth (dsnd (pc k)) (synth_sum_case t k) (synth_sum_case_recip t k) ())
(clens_sum_cases_payload t k)
() | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"LowStar.Buffer.fst.checked",
"LowParse.Spec.Sum.fst.checked",
"LowParse.Low.Enum.fst.checked",
"FStar.UInt64.fsti.checked",
"FStar.UInt32.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Int.Cast.fst.checked",
"FStar.HyperStack.ST.fsti.checked",
"FStar.HyperStack.fst.checked",
"FStar.Classical.fsti.checked"
],
"interface_file": false,
"source_file": "LowParse.Low.Sum.fst"
} | [
{
"abbrev": true,
"full_module": "FStar.HyperStack",
"short_module": "HS"
},
{
"abbrev": true,
"full_module": "FStar.UInt64",
"short_module": "U64"
},
{
"abbrev": true,
"full_module": "FStar.Int.Cast",
"short_module": "Cast"
},
{
"abbrev": true,
"full_module": "LowStar.Buffer",
"short_module": "B"
},
{
"abbrev": true,
"full_module": "FStar.HyperStack.ST",
"short_module": "HST"
},
{
"abbrev": true,
"full_module": "FStar.UInt32",
"short_module": "U32"
},
{
"abbrev": false,
"full_module": "LowParse.Spec.Sum",
"short_module": null
},
{
"abbrev": false,
"full_module": "LowParse.Low.Enum",
"short_module": null
},
{
"abbrev": false,
"full_module": "LowParse.Low",
"short_module": null
},
{
"abbrev": false,
"full_module": "LowParse.Low",
"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",
"short_module": null
}
] | {
"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_elim_box": false,
"smtencoding_l_arith_repr": "boxwrap",
"smtencoding_nl_arith_repr": "boxwrap",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": true,
"z3cliopt": [],
"z3refresh": false,
"z3rlimit": 5,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | false |
t: LowParse.Spec.Sum.sum ->
pc:
(x: LowParse.Spec.Sum.sum_key t
-> Prims.dtuple2 LowParse.Spec.Base.parser_kind
(fun k -> LowParse.Spec.Base.parser k (LowParse.Spec.Sum.sum_type_of_tag t x))) ->
k: LowParse.Spec.Sum.sum_key t
-> LowParse.Low.Base.accessor (LowParse.Low.Sum.gaccessor_clens_sum_cases_payload t pc k) | Prims.Tot | [
"total"
] | [] | [
"LowParse.Spec.Sum.sum",
"LowParse.Spec.Sum.sum_key",
"Prims.dtuple2",
"LowParse.Spec.Base.parser_kind",
"LowParse.Spec.Base.parser",
"LowParse.Spec.Sum.sum_type_of_tag",
"LowParse.Low.Base.accessor_ext",
"Prims.__proj__Mkdtuple2__item___1",
"LowParse.Spec.Sum.sum_cases",
"LowParse.Spec.Combinators.parse_synth",
"FStar.Pervasives.dsnd",
"LowParse.Spec.Sum.synth_sum_case",
"LowParse.Low.Combinators.clens_synth",
"LowParse.Spec.Sum.synth_sum_case_recip",
"LowParse.Low.Combinators.gaccessor_synth",
"LowParse.Low.Combinators.accessor_synth",
"LowParse.Low.Sum.clens_sum_cases_payload",
"Prims.squash",
"LowParse.Spec.Combinators.synth_inverse",
"LowParse.Spec.Combinators.synth_injective_synth_inverse_synth_inverse_recip",
"Prims.unit",
"LowParse.Spec.Sum.synth_sum_case_inverse",
"LowParse.Spec.Sum.synth_sum_case_injective",
"LowParse.Low.Base.accessor",
"FStar.Pervasives.dfst",
"LowParse.Spec.Sum.parse_sum_cases'",
"LowParse.Low.Sum.gaccessor_clens_sum_cases_payload"
] | [] | false | false | false | false | false | let accessor_clens_sum_cases_payload
(t: sum)
(pc: (x: sum_key t -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (accessor (gaccessor_clens_sum_cases_payload t pc k)) =
| [@@ inline_let ]let _ =
synth_sum_case_injective t k;
synth_sum_case_inverse t k;
synth_injective_synth_inverse_synth_inverse_recip (synth_sum_case t k)
(synth_sum_case_recip t k)
()
in
accessor_ext (accessor_synth (dsnd (pc k)) (synth_sum_case t k) (synth_sum_case_recip t k) ())
(clens_sum_cases_payload t k)
() | false |
LowParse.Low.Sum.fst | LowParse.Low.Sum.validate_dsum_cases_if' | val validate_dsum_cases_if'
(s: dsum)
(f: (x: dsum_known_key s -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x))))
(#k: parser_kind)
(g: parser k (dsum_type_of_unknown_tag s))
(x: dsum_key s)
(cond: bool)
(ift: (cond_true cond -> Tot (validate_dsum_cases_t s f g x)))
(iff: (cond_false cond -> Tot (validate_dsum_cases_t s f g x)))
: Tot (validate_dsum_cases_t s f g x) | val validate_dsum_cases_if'
(s: dsum)
(f: (x: dsum_known_key s -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x))))
(#k: parser_kind)
(g: parser k (dsum_type_of_unknown_tag s))
(x: dsum_key s)
(cond: bool)
(ift: (cond_true cond -> Tot (validate_dsum_cases_t s f g x)))
(iff: (cond_false cond -> Tot (validate_dsum_cases_t s f g x)))
: Tot (validate_dsum_cases_t s f g x) | let validate_dsum_cases_if'
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(#k: parser_kind)
(g: parser k (dsum_type_of_unknown_tag s))
(x: dsum_key s)
(cond: bool)
(ift: (cond_true cond -> Tot (validate_dsum_cases_t s f g x)))
(iff: (cond_false cond -> Tot (validate_dsum_cases_t s f g x)))
: Tot (validate_dsum_cases_t s f g x)
= fun #rrel #rel input len ->
if cond
then (ift () <: validate_dsum_cases_t s f g x) input len
else (iff () <: validate_dsum_cases_t s f g x) input len | {
"file_name": "src/lowparse/LowParse.Low.Sum.fst",
"git_rev": "00217c4a89f5ba56002ba9aa5b4a9d5903bfe9fa",
"git_url": "https://github.com/project-everest/everparse.git",
"project_name": "everparse"
} | {
"end_col": 58,
"end_line": 990,
"start_col": 0,
"start_line": 977
} | module LowParse.Low.Sum
include LowParse.Low.Enum
include LowParse.Spec.Sum
module U32 = FStar.UInt32
module HST = FStar.HyperStack.ST
module B = LowStar.Buffer
module Cast = FStar.Int.Cast
module U64 = FStar.UInt64
inline_for_extraction
let validate_sum_cases_aux
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(vc: ((x: sum_key t) -> Tot (validator (dsnd (pc x)))))
(k: sum_key t)
: Tot (validator (parse_sum_cases t pc k))
= [@inline_let]
let _ = synth_sum_case_injective t k in
validate_synth
(validate_weaken
(weaken_parse_cases_kind t pc)
(vc k)
()
)
(synth_sum_case t k)
()
inline_for_extraction
let validate_sum_cases_t
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot Type
= validator (parse_sum_cases t pc k)
let validate_sum_cases_t_eq
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
(x y : validate_sum_cases_t t pc k)
: GTot Type0
= True
inline_for_extraction
let validate_sum_cases_t_if
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (if_combinator _ (validate_sum_cases_t_eq t pc k))
= fun cond (sv_true: cond_true cond -> Tot (validate_sum_cases_t t pc k)) (sv_false: cond_false cond -> Tot (validate_sum_cases_t t pc k)) #rrel #rel input pos ->
if cond
then sv_true () input pos
else sv_false () input pos
inline_for_extraction
let validate_sum_cases
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(vc: ((x: sum_key t) -> Tot (validator (dsnd (pc x)))))
(destr: dep_enum_destr (sum_enum t) (validate_sum_cases_t t pc))
(k: sum_key t)
: Tot (validator (parse_sum_cases t pc k))
= destr
_
(validate_sum_cases_t_if t pc)
(fun _ _ -> ())
(fun _ _ _ _ -> ())
(validate_sum_cases_aux t pc vc)
k
inline_for_extraction
let validate_sum_aux_payload_t
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
: Tot Type
= (#rrel: _) -> (#rel: _) ->
(input: slice rrel rel) ->
(pos: U64.t) ->
HST.Stack U64.t
(requires (fun h -> live_slice h input /\ U64.v pos <= U32.v input.len))
(ensures (fun h res h' ->
B.modifies B.loc_none h h' /\ (
match k with
| Unknown _ -> is_error res
| Known k' ->
if is_success res
then
valid_pos (dsnd (pc k')) h input (uint64_to_uint32 pos) (uint64_to_uint32 res)
else
(~ (valid (dsnd (pc k')) h input (uint64_to_uint32 pos)))
)))
let validate_sum_aux_payload_eq
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
: Tot (validate_sum_aux_payload_t t pc k -> validate_sum_aux_payload_t t pc k -> GTot Type0)
= fun _ _ -> True
inline_for_extraction
let validate_sum_aux_payload_if'
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
(cond: bool)
(ift: ((cond_true cond) -> Tot (validate_sum_aux_payload_t t pc k)))
(iff: ((cond_false cond) -> Tot (validate_sum_aux_payload_t t pc k)))
: Tot (validate_sum_aux_payload_t t pc k)
= fun #rrel #rel input pos ->
if cond
then begin
(ift () <: validate_sum_aux_payload_t t pc k) input pos
end else
(iff () <: validate_sum_aux_payload_t t pc k) input pos
inline_for_extraction
let validate_sum_aux_payload_if
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
: Tot (if_combinator _ (validate_sum_aux_payload_eq t pc k))
= validate_sum_aux_payload_if' t pc k
#push-options "--z3rlimit 64 --z3cliopt smt.arith.nl=false --using_facts_from '* -FStar.Int.Cast -LowParse.BitFields'"
// --query_stats --smtencoding.elim_box true --smtencoding.l_arith_repr native --z3refresh"
inline_for_extraction
let validate_sum_aux
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(v: validator p)
(p32: leaf_reader p)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(v_payload: ((k: sum_repr_type t)) -> Tot (validate_sum_aux_payload_t t pc (maybe_enum_key_of_repr (sum_enum t) k)))
: Tot (validator (parse_sum t p pc))
= fun #rrel #rel input pos ->
let h = HST.get () in
[@inline_let]
let _ = parse_sum_eq'' t p pc (bytes_of_slice_from h input (uint64_to_uint32 pos)) in
[@inline_let]
let _ = valid_facts (parse_sum t p pc) h input (uint64_to_uint32 pos) in
[@inline_let]
let _ = valid_facts p h input (uint64_to_uint32 pos) in
let len_after_tag = v input pos in
if is_error len_after_tag
then len_after_tag
else begin
let h1 = HST.get () in
let k' = p32 input (uint64_to_uint32 pos) in
[@inline_let]
let _ =
match maybe_enum_key_of_repr (sum_enum t) k' with
| Known k -> valid_facts (dsnd (pc k)) h input (uint64_to_uint32 len_after_tag)
| _ -> ()
in
v_payload k' input len_after_tag
end
#pop-options
inline_for_extraction
let validate_sum_aux_payload'
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (validator (dsnd (pc x)))))
(k: maybe_enum_key (sum_enum t))
: Tot (validate_sum_aux_payload_t t pc k)
= fun #rrel #rel input pos ->
match k with
| Known k ->
[@inline_let]
let _ = synth_sum_case_injective t k in
pc32 k input pos
// validate_synth (pc32 k) (synth_sum_case t k) () input pos
| _ -> validator_error_generic
inline_for_extraction
let validate_sum_aux_payload
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (validator (dsnd (pc x)))))
(destr: dep_maybe_enum_destr_t (sum_enum t) (validate_sum_aux_payload_t t pc))
(k: sum_repr_type t)
: Tot (validate_sum_aux_payload_t t pc (maybe_enum_key_of_repr (sum_enum t) k))
= destr (validate_sum_aux_payload_eq t pc) (validate_sum_aux_payload_if t pc) (fun _ _ -> ()) (fun _ _ _ _ -> ()) (validate_sum_aux_payload' t pc pc32) k
inline_for_extraction
let validate_sum
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(v: validator p)
(p32: leaf_reader p)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (validator (dsnd (pc x)))))
(destr: dep_maybe_enum_destr_t (sum_enum t) (validate_sum_aux_payload_t t pc))
: Tot (validator (parse_sum t p pc))
= validate_sum_aux t v p32 pc (validate_sum_aux_payload t pc pc32 destr)
module HS = FStar.HyperStack
#push-options "--z3rlimit 256 --z3cliopt smt.arith.nl=false --initial_ifuel 8 --max_ifuel 8 --initial_fuel 2 --max_fuel 2"
#restart-solver
let valid_sum_intro
(h: HS.mem)
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: Lemma
(requires (
valid (parse_enum_key p (sum_enum t)) h input pos /\ (
let k = contents (parse_enum_key p (sum_enum t)) h input pos in
valid (dsnd (pc k)) h input (get_valid_pos (parse_enum_key p (sum_enum t)) h input pos)
)))
(ensures (
let k = contents (parse_enum_key p (sum_enum t)) h input pos in
let pos_payload = get_valid_pos (parse_enum_key p (sum_enum t)) h input pos in
valid_content_pos
(parse_sum t p pc) h input pos
(synth_sum_case t k (contents (dsnd (pc k)) h input pos_payload))
(get_valid_pos (dsnd (pc k)) h input pos_payload)
))
= valid_facts (parse_enum_key p (sum_enum t)) h input pos;
let k = contents (parse_enum_key p (sum_enum t)) h input pos in
let pos_payload = get_valid_pos (parse_enum_key p (sum_enum t)) h input pos in
valid_facts (dsnd (pc k)) h input pos_payload;
valid_facts (parse_sum t p pc) h input pos;
parse_sum_eq t p pc (bytes_of_slice_from h input pos)
#pop-options
inline_for_extraction
let finalize_sum_case
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(s: serializer p)
(w: leaf_writer_strong s)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(destr: enum_repr_of_key'_t (sum_enum t))
(k: sum_key t)
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: HST.Stack unit
(requires (fun h ->
let len_tag = serialized_length (serialize_enum_key _ s (sum_enum t)) k in
U32.v pos + len_tag < 4294967296 /\ (
let pos_payload = pos `U32.add` U32.uint_to_t len_tag in
valid (dsnd (pc k)) h input pos_payload /\
writable input.base (U32.v pos) (U32.v pos_payload) h
)))
(ensures (fun h _ h' ->
let len_tag = serialized_length (serialize_enum_key _ s (sum_enum t)) k in
let pos_payload = pos `U32.add` U32.uint_to_t len_tag in
B.modifies (loc_slice_from_to input pos pos_payload) h h' /\
valid_content_pos (parse_sum t p pc) h' input pos (synth_sum_case t k (contents (dsnd (pc k)) h input pos_payload)) (get_valid_pos (dsnd (pc k)) h input pos_payload)
))
= let pos1 = write_enum_key w (sum_enum t) destr k input pos in
let h = HST.get () in
[@inline_let]
let _ = valid_sum_intro h t p pc input pos in
()
inline_for_extraction
let jump_sum_cases_aux
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(vc: ((x: sum_key t) -> Tot (jumper (dsnd (pc x)))))
(k: sum_key t)
: Tot (jumper (parse_sum_cases t pc k))
= [@inline_let]
let _ = synth_sum_case_injective t k in
jump_synth
(jump_weaken
(weaken_parse_cases_kind t pc)
(vc k)
()
)
(synth_sum_case t k)
()
inline_for_extraction
let jump_sum_cases_t
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot Type
= jumper (parse_sum_cases t pc k)
let jump_sum_cases_t_eq
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
(x y : jump_sum_cases_t t pc k)
: GTot Type0
= True
inline_for_extraction
let jump_sum_cases_t_if
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (if_combinator _ (jump_sum_cases_t_eq t pc k))
= fun cond (sv_true: cond_true cond -> Tot (jump_sum_cases_t t pc k)) (sv_false: cond_false cond -> Tot (jump_sum_cases_t t pc k)) #rrel #rel input pos ->
if cond
then sv_true () input pos
else sv_false () input pos
inline_for_extraction
let jump_sum_cases
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(vc: ((x: sum_key t) -> Tot (jumper (dsnd (pc x)))))
(destr: dep_enum_destr (sum_enum t) (jump_sum_cases_t t pc))
(k: sum_key t)
: Tot (jumper (parse_sum_cases t pc k))
= destr
_
(jump_sum_cases_t_if t pc)
(fun _ _ -> ())
(fun _ _ _ _ -> ())
(jump_sum_cases_aux t pc vc)
k
inline_for_extraction
let jump_sum_aux_payload_t
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
: Tot Type
= (#rrel: _) -> (#rel: _) ->
(input: slice rrel rel) ->
(pos: U32.t) ->
HST.Stack U32.t
(requires (fun h -> live_slice h input /\ U32.v pos <= U32.v input.len /\ (
match k with
| Unknown _ -> False
| Known k' -> valid (dsnd (pc k')) h input pos
)))
(ensures (fun h res h' ->
B.modifies B.loc_none h h' /\ (
match k with
| Unknown _ -> False
| Known k' ->
valid_pos (dsnd (pc k')) h input pos res
)))
let jump_sum_aux_payload_eq
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
: Tot (jump_sum_aux_payload_t t pc k -> jump_sum_aux_payload_t t pc k -> GTot Type0)
= fun _ _ -> True
inline_for_extraction
let jump_sum_aux_payload_if'
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
(cond: bool)
(ift: ((cond_true cond) -> Tot (jump_sum_aux_payload_t t pc k)))
(iff: ((cond_false cond) -> Tot (jump_sum_aux_payload_t t pc k)))
: Tot (jump_sum_aux_payload_t t pc k)
= fun #rrel #rel input pos ->
if cond
then begin
(ift () <: jump_sum_aux_payload_t t pc k) input pos
end else
(iff () <: jump_sum_aux_payload_t t pc k) input pos
inline_for_extraction
let jump_sum_aux_payload_if
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
: Tot (if_combinator _ (jump_sum_aux_payload_eq t pc k))
= jump_sum_aux_payload_if' t pc k
let parse_sum_eq3
(#kt: parser_kind)
(t: sum)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(input: bytes)
(k' : sum_repr_type t)
(consumed_k: consumed_length input)
: Lemma
(requires (Some? (parse (parse_sum t p pc) input) /\ parse p input == Some (k', consumed_k)))
(ensures (
let input_k = Seq.slice input consumed_k (Seq.length input) in
let k = maybe_enum_key_of_repr (sum_enum t) k' in
begin match k with
| Known k ->
Some? (parse (dsnd (pc k)) input_k)
| _ -> False
end
))
= parse_sum_eq'' t p pc input
let parse_sum_eq4
(#kt: parser_kind)
(t: sum)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(input: bytes)
(k' : sum_repr_type t)
(consumed_k: consumed_length input)
(consumed_payload: nat)
: Lemma
(requires (Some? (parse (parse_sum t p pc) input) /\ parse p input == Some (k', consumed_k) /\ (
let input_k = Seq.slice input consumed_k (Seq.length input) in
let k = maybe_enum_key_of_repr (sum_enum t) k' in
begin match k with
| Known k ->
Some? (parse (dsnd (pc k)) input_k) /\ (
let Some (_, consumed_payload') = parse (dsnd (pc k)) input_k in
consumed_payload' == consumed_payload
)
| _ -> False
end
)))
(ensures (
let Some (_, consumed) = parse (parse_sum t p pc) input in
consumed == consumed_k + consumed_payload
))
= parse_sum_eq'' t p pc input
#push-options "--z3rlimit 16"
let valid_sum_elim
(h: HS.mem)
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(#rrel: _) (#rel: _)
(input: slice rrel rel)
(pos: U32.t)
: Lemma
(requires (
valid (parse_sum t p pc) h input pos
))
(ensures (
valid p h input pos /\ (
let pos_payload = get_valid_pos p h input pos in
let k' = maybe_enum_key_of_repr (sum_enum t) (contents p h input pos) in
match k' with
| Known k ->
k == sum_tag_of_data t (contents (parse_sum t p pc) h input pos) /\
valid (dsnd (pc k)) h input pos_payload /\
valid_pos
(parse_sum t p pc) h input pos
(get_valid_pos (dsnd (pc k)) h input pos_payload)
| _ -> False
)))
= let sinput = bytes_of_slice_from h input pos in
let _ = parse_sum_eq'' t p pc sinput in
[@inline_let]
let _ = valid_facts (parse_sum t p pc) h input pos in
let Some (k', consumed_k) = parse p sinput in
let pos_after_tag = U32.uint_to_t (U32.v pos + consumed_k) in
[@inline_let]
let _ = valid_facts p h input pos in
assert (valid_content_pos p h input pos k' pos_after_tag);
match maybe_enum_key_of_repr (sum_enum t) k' with
| Known k -> valid_facts (dsnd (pc k)) h input pos_after_tag
| _ -> ()
#pop-options
let valid_sum_elim_tag
(h: HS.mem)
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: Lemma
(requires (
valid (parse_sum t p pc) h input pos
))
(ensures (
valid (parse_enum_key p (sum_enum t)) h input pos /\
contents (parse_enum_key p (sum_enum t)) h input pos == sum_tag_of_data t (contents (parse_sum t p pc) h input pos)
))
= let _ = parse_sum_eq' t p pc (bytes_of_slice_from h input pos) in
let _ = valid_facts (parse_sum t p pc) h input pos in
let _ = valid_facts (parse_enum_key p (sum_enum t)) h input pos in
()
inline_for_extraction
let read_sum_tag
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(p32: leaf_reader p)
(destr: dep_maybe_enum_destr_t (sum_enum t) (read_enum_key_t (sum_enum t)))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: HST.Stack (sum_key t)
(requires (fun h ->
valid (parse_sum t p pc) h input pos
))
(ensures (fun h res h' ->
B.modifies B.loc_none h h' /\
res == sum_tag_of_data t (contents (parse_sum t p pc) h input pos)
))
= let h = HST.get () in
[@inline_let] let _ = valid_sum_elim_tag h t p pc input pos in
read_enum_key p32 (sum_enum t) destr input pos
inline_for_extraction
let jump_sum_aux
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(v: jumper p)
(p32: leaf_reader p)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(v_payload: ((k: sum_repr_type t)) -> Tot (jump_sum_aux_payload_t t pc (maybe_enum_key_of_repr (sum_enum t) k)))
: Tot (jumper (parse_sum t p pc))
= fun #rrel #rel input pos ->
let h = HST.get () in
[@inline_let]
let _ = valid_sum_elim h t p pc input pos in
let pos_after_tag = v input pos in
let k' = p32 input pos in
v_payload k' input pos_after_tag
inline_for_extraction
let jump_sum_aux_payload'
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (jumper (dsnd (pc x)))))
(k: maybe_enum_key (sum_enum t))
: Tot (jump_sum_aux_payload_t t pc k)
= fun #rrel #rel input pos ->
match k with
| Known k ->
[@inline_let]
let _ = synth_sum_case_injective t k in
pc32 k input pos
| _ -> 0ul // dummy, but we MUST NOT remove this branch, otherwise extraction fails
inline_for_extraction
let jump_sum_aux_payload
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (jumper (dsnd (pc x)))))
(destr: dep_maybe_enum_destr_t (sum_enum t) (jump_sum_aux_payload_t t pc))
(k: sum_repr_type t)
: Tot (jump_sum_aux_payload_t t pc (maybe_enum_key_of_repr (sum_enum t) k))
= destr (jump_sum_aux_payload_eq t pc) (jump_sum_aux_payload_if t pc) (fun _ _ -> ()) (fun _ _ _ _ -> ()) (jump_sum_aux_payload' t pc pc32) k
inline_for_extraction
let jump_sum
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(v: jumper p)
(p32: leaf_reader p)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (jumper (dsnd (pc x)))))
(destr: dep_maybe_enum_destr_t (sum_enum t) (jump_sum_aux_payload_t t pc))
: Tot (jumper (parse_sum t p pc))
= jump_sum_aux t v p32 pc (jump_sum_aux_payload t pc pc32 destr)
inline_for_extraction
let read_sum_cases'
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (leaf_reader (dsnd (pc x)))))
(k: sum_key t)
: Tot (leaf_reader (parse_sum_cases' t pc k))
= [@inline_let]
let _ = synth_sum_case_injective t k in
read_synth'
(dsnd (pc k))
(synth_sum_case t k)
(pc32 k)
()
inline_for_extraction
let read_sum_cases_t
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot Type
= leaf_reader (parse_sum_cases' t pc k)
let read_sum_cases_t_eq
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
(x y : read_sum_cases_t t pc k)
: GTot Type0
= True
inline_for_extraction
let read_sum_cases_t_if
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (if_combinator _ (read_sum_cases_t_eq t pc k))
= fun cond (sv_true: cond_true cond -> Tot (read_sum_cases_t t pc k)) (sv_false: cond_false cond -> Tot (read_sum_cases_t t pc k)) #_ #_ input pos ->
if cond
then (sv_true () input pos)
else (sv_false () input pos)
inline_for_extraction
let read_sum_cases
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (leaf_reader (dsnd (pc x)))))
(destr: dep_enum_destr (sum_enum t) (read_sum_cases_t t pc))
(k: sum_key t)
: Tot (leaf_reader (parse_sum_cases' t pc k))
= destr
_
(read_sum_cases_t_if t pc)
(fun _ _ -> ())
(fun _ _ _ _ -> ())
(read_sum_cases' t pc pc32)
k
#push-options "--z3rlimit 32"
inline_for_extraction
let read_sum
(#kt: parser_kind)
(t: sum)
(p: parser kt (sum_repr_type t))
(p32: leaf_reader (parse_enum_key p (sum_enum t)))
(j: jumper p)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (leaf_reader (dsnd (pc x)))))
(destr: dep_enum_destr (sum_enum t) (read_sum_cases_t t pc))
: Tot (leaf_reader (parse_sum t p pc))
=
fun #_ #_ input pos ->
let h = HST.get () in
valid_facts (parse_sum t p pc) h input pos;
parse_sum_eq' t p pc (bytes_of_slice_from h input pos);
valid_facts (parse_enum_key p (sum_enum t)) h input pos;
let k = p32 input pos in
let pos' = jump_enum_key j (sum_enum t) input pos in
valid_facts (parse_sum_cases' t pc k) h input pos' ;
read_sum_cases t pc pc32 destr k input pos'
#pop-options
inline_for_extraction
let serialize32_sum_cases_t
(t: sum)
(#pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(sc: ((x: sum_key t) -> Tot (serializer (dsnd (pc x)))))
(k: sum_key t)
: Tot Type
= serializer32 (serialize_sum_cases t pc sc k)
let serialize32_sum_cases_t_eq
(t: sum)
(#pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(sc: ((x: sum_key t) -> Tot (serializer (dsnd (pc x)))))
(k: sum_key t)
(x y: serialize32_sum_cases_t t sc k)
: GTot Type0
= True
inline_for_extraction
let serialize32_sum_cases_t_if
(t: sum)
(#pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(sc: ((x: sum_key t) -> Tot (serializer (dsnd (pc x)))))
(k: sum_key t)
: Tot (if_combinator _ (serialize32_sum_cases_t_eq t sc k))
= fun cond (sv_true: (cond_true cond -> Tot (serialize32_sum_cases_t t sc k))) (sv_false: (cond_false cond -> Tot (serialize32_sum_cases_t t sc k))) x #rrel #rel b pos ->
if cond
then (sv_true () x b pos)
else (sv_false () x b pos)
inline_for_extraction
let serialize32_sum_cases_aux
(t: sum)
(#pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(sc: ((x: sum_key t) -> Tot (serializer (dsnd (pc x)))))
(sc32: ((x: sum_key t) -> Tot (serializer32 (sc x))))
(k: sum_key t)
: Tot (serializer32 (serialize_sum_cases t pc sc k))
= fun x #rrel #rel b pos ->
[@inline_let] let _ =
Classical.forall_intro (parse_sum_cases_eq' t pc k);
synth_sum_case_injective t k;
synth_sum_case_inverse t k
in
serialize32_synth
(sc32 k)
(synth_sum_case t k)
(synth_sum_case_recip t k)
(fun x -> synth_sum_case_recip t k x)
()
x
b
pos
inline_for_extraction
let serialize32_sum_cases
(t: sum)
(#pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(sc: ((x: sum_key t) -> Tot (serializer (dsnd (pc x)))))
(sc32: ((x: sum_key t) -> Tot (serializer32 (sc x))))
(destr: dep_enum_destr (sum_enum t) (serialize32_sum_cases_t t sc))
(k: sum_key t)
: Tot (serializer32 (serialize_sum_cases t pc sc k))
= destr
_
(serialize32_sum_cases_t_if t sc)
(fun _ _ -> ())
(fun _ _ _ _ -> ())
(serialize32_sum_cases_aux t sc sc32)
k
inline_for_extraction
let serialize32_sum
(#kt: parser_kind)
(t: sum)
(#p: parser kt (sum_repr_type t))
(s: serializer p {kt.parser_kind_subkind == Some ParserStrong})
(s32: serializer32 (serialize_enum_key _ s (sum_enum t)))
(#pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(sc: ((x: sum_key t) -> Tot (serializer (dsnd (pc x)))))
(sc32: ((x: sum_key t) -> Tot (serializer32 (sc x))))
(destr: dep_enum_destr (sum_enum t) (serialize32_sum_cases_t t sc))
: Tot (serializer32 (serialize_sum t s sc))
= fun x #rrel #rel b pos ->
serialize_sum_eq t s sc x;
let tg = sum_tag_of_data t x in
serialize32_nondep_then_aux s32 (serialize32_sum_cases t sc sc32 destr tg) tg x b pos
let clens_sum_tag
(s: sum)
: Tot (clens (sum_type s) (sum_key s))
= {
clens_cond = (fun _ -> True);
clens_get = sum_tag_of_data s;
}
let gaccessor_sum_tag
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
: Tot (gaccessor (parse_sum t p pc) (parse_enum_key p (sum_enum t)) (clens_sum_tag t))
= gaccessor_tagged_union_tag
(parse_enum_key p (sum_enum t))
(sum_tag_of_data t)
(parse_sum_cases t pc)
inline_for_extraction
let accessor_sum_tag
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
: Tot (accessor (gaccessor_sum_tag t p pc))
= accessor_tagged_union_tag
(parse_enum_key p (sum_enum t))
(sum_tag_of_data t)
(parse_sum_cases t pc)
let clens_sum_payload
(s: sum)
(k: sum_key s)
: Tot (clens (sum_type s) (sum_type_of_tag s k))
= {
clens_cond = (fun (x: sum_type s) -> sum_tag_of_data s x == k);
clens_get = (fun (x: sum_type s) -> synth_sum_case_recip s k x <: Ghost (sum_type_of_tag s k) (requires (sum_tag_of_data s x == k)) (ensures (fun _ -> True)));
}
#push-options "--z3rlimit 32"
let gaccessor_clens_sum_payload'
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (gaccessor' (parse_sum t p pc) (dsnd (pc k)) (clens_sum_payload t k))
= fun (input: bytes) ->
parse_sum_eq'' t p pc input;
let res =
match parse p input with
| Some (_, consumed) ->
synth_sum_case_inverse t k;
synth_sum_case_injective t k;
synth_injective_synth_inverse_synth_inverse_recip (synth_sum_case t k) (synth_sum_case_recip t k) ();
(consumed)
| _ -> 0 // dummy
in
(res <: (res: _ { gaccessor_post' (parse_sum t p pc) (dsnd (pc k)) (clens_sum_payload t k) input res } ))
#push-options "--z3rlimit 64"
let gaccessor_clens_sum_payload_injective
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
(sl sl' : bytes)
: Lemma
(requires (
gaccessor_pre (parse_sum t p pc) (dsnd (pc k)) (clens_sum_payload t k) sl /\
gaccessor_pre (parse_sum t p pc) (dsnd (pc k)) (clens_sum_payload t k) sl' /\
injective_precond (parse_sum t p pc) sl sl'
))
(ensures (gaccessor_clens_sum_payload' t p pc k sl == gaccessor_clens_sum_payload' t p pc k sl'))
= parse_sum_eq'' t p pc sl;
parse_sum_eq'' t p pc sl' ;
parse_injective (parse_sum t p pc) sl sl' ;
parse_injective p sl sl'
#pop-options
let gaccessor_clens_sum_payload_no_lookahead
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
(sl sl' : bytes)
: Lemma
(requires (
(parse_sum_kind kt t pc).parser_kind_subkind == Some ParserStrong /\
gaccessor_pre (parse_sum t p pc) (dsnd (pc k)) (clens_sum_payload t k) sl /\
gaccessor_pre (parse_sum t p pc) (dsnd (pc k)) (clens_sum_payload t k) sl' /\
no_lookahead_on_precond (parse_sum t p pc) sl sl'
))
(ensures (gaccessor_clens_sum_payload' t p pc k sl == gaccessor_clens_sum_payload' t p pc k sl'))
= parse_sum_eq'' t p pc sl;
parse_sum_eq'' t p pc sl' ;
parse_strong_prefix (parse_sum t p pc) sl sl' ;
parse_injective p sl sl'
let gaccessor_clens_sum_payload
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (gaccessor (parse_sum t p pc) (dsnd (pc k)) (clens_sum_payload t k))
= Classical.forall_intro_2 (fun x -> Classical.move_requires (gaccessor_clens_sum_payload_injective t p pc k x));
Classical.forall_intro_2 (fun x -> Classical.move_requires (gaccessor_clens_sum_payload_no_lookahead t p pc k x));
gaccessor_prop_equiv (parse_sum t p pc) (dsnd (pc k)) (clens_sum_payload t k) (gaccessor_clens_sum_payload' t p pc k);
gaccessor_clens_sum_payload' t p pc k
inline_for_extraction
let accessor_clens_sum_payload'
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(j: jumper p)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: HST.Stack U32.t
(requires (fun h ->
valid (parse_sum t p pc) h input pos /\
(clens_sum_payload t k).clens_cond (contents (parse_sum t p pc) h input pos)
))
(ensures (fun h pos' h' ->
B.modifies B.loc_none h h' /\
pos' == slice_access h (gaccessor_clens_sum_payload t p pc k) input pos
))
=
let h = HST.get () in
[@inline_let]
let _ =
let pos' = get_valid_pos (parse_sum t p pc) h input pos in
let large = bytes_of_slice_from h input pos in
slice_access_eq h (gaccessor_clens_sum_payload t p pc k) input pos;
valid_facts (parse_sum t p pc) h input pos;
parse_sum_eq'' t p pc large;
valid_facts p h input pos
in
j input pos
#pop-options
inline_for_extraction
let accessor_clens_sum_payload
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(j: jumper p)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (accessor (gaccessor_clens_sum_payload t p pc k))
= fun #rrel #rel -> accessor_clens_sum_payload' t j pc k #rrel #rel
let clens_sum_cases_payload
(s: sum)
(k: sum_key s)
: Tot (clens (sum_cases s k) (sum_type_of_tag s k))
= {
clens_cond = (fun (x: sum_cases s k) -> True);
clens_get = (fun (x: sum_cases s k) -> synth_sum_case_recip s k x <: Ghost (sum_type_of_tag s k) (requires (True)) (ensures (fun _ -> True)));
}
let gaccessor_clens_sum_cases_payload
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (gaccessor (parse_sum_cases' t pc k) (dsnd (pc k)) (clens_sum_cases_payload t k))
= synth_sum_case_injective t k;
synth_sum_case_inverse t k;
synth_injective_synth_inverse_synth_inverse_recip (synth_sum_case t k) (synth_sum_case_recip t k) ();
gaccessor_ext
(gaccessor_synth (dsnd (pc k)) (synth_sum_case t k) (synth_sum_case_recip t k) ())
(clens_sum_cases_payload t k)
()
inline_for_extraction
let accessor_clens_sum_cases_payload
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (accessor (gaccessor_clens_sum_cases_payload t pc k))
= [@inline_let]
let _ =
synth_sum_case_injective t k;
synth_sum_case_inverse t k;
synth_injective_synth_inverse_synth_inverse_recip (synth_sum_case t k) (synth_sum_case_recip t k) ()
in
accessor_ext
(accessor_synth (dsnd (pc k)) (synth_sum_case t k) (synth_sum_case_recip t k) ())
(clens_sum_cases_payload t k)
()
inline_for_extraction
let validate_dsum_cases_t
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(#k: parser_kind)
(g: parser k (dsum_type_of_unknown_tag s))
(x: dsum_key s)
: Tot Type
= validator (parse_dsum_cases' s f g x)
let validate_dsum_cases_eq
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(#k: parser_kind)
(g: parser k (dsum_type_of_unknown_tag s))
(x: dsum_key s)
(v1 v2 : validate_dsum_cases_t s f g x)
: GTot Type0
= True | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"LowStar.Buffer.fst.checked",
"LowParse.Spec.Sum.fst.checked",
"LowParse.Low.Enum.fst.checked",
"FStar.UInt64.fsti.checked",
"FStar.UInt32.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Int.Cast.fst.checked",
"FStar.HyperStack.ST.fsti.checked",
"FStar.HyperStack.fst.checked",
"FStar.Classical.fsti.checked"
],
"interface_file": false,
"source_file": "LowParse.Low.Sum.fst"
} | [
{
"abbrev": true,
"full_module": "FStar.HyperStack",
"short_module": "HS"
},
{
"abbrev": true,
"full_module": "FStar.UInt64",
"short_module": "U64"
},
{
"abbrev": true,
"full_module": "FStar.Int.Cast",
"short_module": "Cast"
},
{
"abbrev": true,
"full_module": "LowStar.Buffer",
"short_module": "B"
},
{
"abbrev": true,
"full_module": "FStar.HyperStack.ST",
"short_module": "HST"
},
{
"abbrev": true,
"full_module": "FStar.UInt32",
"short_module": "U32"
},
{
"abbrev": false,
"full_module": "LowParse.Spec.Sum",
"short_module": null
},
{
"abbrev": false,
"full_module": "LowParse.Low.Enum",
"short_module": null
},
{
"abbrev": false,
"full_module": "LowParse.Low",
"short_module": null
},
{
"abbrev": false,
"full_module": "LowParse.Low",
"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",
"short_module": null
}
] | {
"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_elim_box": false,
"smtencoding_l_arith_repr": "boxwrap",
"smtencoding_nl_arith_repr": "boxwrap",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": true,
"z3cliopt": [],
"z3refresh": false,
"z3rlimit": 5,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | false |
s: LowParse.Spec.Sum.dsum ->
f:
(x: LowParse.Spec.Sum.dsum_known_key s
-> Prims.dtuple2 LowParse.Spec.Base.parser_kind
(fun k -> LowParse.Spec.Base.parser k (LowParse.Spec.Sum.dsum_type_of_known_tag s x))) ->
g: LowParse.Spec.Base.parser k (LowParse.Spec.Sum.dsum_type_of_unknown_tag s) ->
x: LowParse.Spec.Sum.dsum_key s ->
cond: Prims.bool ->
ift:
(_: LowParse.Spec.Combinators.cond_true cond -> LowParse.Low.Sum.validate_dsum_cases_t s f g x
) ->
iff:
(_: LowParse.Spec.Combinators.cond_false cond
-> LowParse.Low.Sum.validate_dsum_cases_t s f g x)
-> LowParse.Low.Sum.validate_dsum_cases_t s f g x | Prims.Tot | [
"total"
] | [] | [
"LowParse.Spec.Sum.dsum",
"LowParse.Spec.Sum.dsum_known_key",
"Prims.dtuple2",
"LowParse.Spec.Base.parser_kind",
"LowParse.Spec.Base.parser",
"LowParse.Spec.Sum.dsum_type_of_known_tag",
"LowParse.Spec.Sum.dsum_type_of_unknown_tag",
"LowParse.Spec.Sum.dsum_key",
"Prims.bool",
"LowParse.Spec.Combinators.cond_true",
"LowParse.Low.Sum.validate_dsum_cases_t",
"LowParse.Spec.Combinators.cond_false",
"LowParse.Slice.srel",
"LowParse.Bytes.byte",
"LowParse.Slice.slice",
"FStar.UInt64.t"
] | [] | false | false | false | false | false | let validate_dsum_cases_if'
(s: dsum)
(f: (x: dsum_known_key s -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x))))
(#k: parser_kind)
(g: parser k (dsum_type_of_unknown_tag s))
(x: dsum_key s)
(cond: bool)
(ift: (cond_true cond -> Tot (validate_dsum_cases_t s f g x)))
(iff: (cond_false cond -> Tot (validate_dsum_cases_t s f g x)))
: Tot (validate_dsum_cases_t s f g x) =
| fun #rrel #rel input len ->
if cond
then (ift () <: validate_dsum_cases_t s f g x) input len
else (iff () <: validate_dsum_cases_t s f g x) input len | false |
LowParse.Low.Sum.fst | LowParse.Low.Sum.valid_sum_elim_tag | val valid_sum_elim_tag
(h: HS.mem)
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: (x: sum_key t -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: Lemma (requires (valid (parse_sum t p pc) h input pos))
(ensures
(valid (parse_enum_key p (sum_enum t)) h input pos /\
contents (parse_enum_key p (sum_enum t)) h input pos ==
sum_tag_of_data t (contents (parse_sum t p pc) h input pos))) | val valid_sum_elim_tag
(h: HS.mem)
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: (x: sum_key t -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: Lemma (requires (valid (parse_sum t p pc) h input pos))
(ensures
(valid (parse_enum_key p (sum_enum t)) h input pos /\
contents (parse_enum_key p (sum_enum t)) h input pos ==
sum_tag_of_data t (contents (parse_sum t p pc) h input pos))) | let valid_sum_elim_tag
(h: HS.mem)
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: Lemma
(requires (
valid (parse_sum t p pc) h input pos
))
(ensures (
valid (parse_enum_key p (sum_enum t)) h input pos /\
contents (parse_enum_key p (sum_enum t)) h input pos == sum_tag_of_data t (contents (parse_sum t p pc) h input pos)
))
= let _ = parse_sum_eq' t p pc (bytes_of_slice_from h input pos) in
let _ = valid_facts (parse_sum t p pc) h input pos in
let _ = valid_facts (parse_enum_key p (sum_enum t)) h input pos in
() | {
"file_name": "src/lowparse/LowParse.Low.Sum.fst",
"git_rev": "00217c4a89f5ba56002ba9aa5b4a9d5903bfe9fa",
"git_url": "https://github.com/project-everest/everparse.git",
"project_name": "everparse"
} | {
"end_col": 4,
"end_line": 501,
"start_col": 0,
"start_line": 481
} | module LowParse.Low.Sum
include LowParse.Low.Enum
include LowParse.Spec.Sum
module U32 = FStar.UInt32
module HST = FStar.HyperStack.ST
module B = LowStar.Buffer
module Cast = FStar.Int.Cast
module U64 = FStar.UInt64
inline_for_extraction
let validate_sum_cases_aux
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(vc: ((x: sum_key t) -> Tot (validator (dsnd (pc x)))))
(k: sum_key t)
: Tot (validator (parse_sum_cases t pc k))
= [@inline_let]
let _ = synth_sum_case_injective t k in
validate_synth
(validate_weaken
(weaken_parse_cases_kind t pc)
(vc k)
()
)
(synth_sum_case t k)
()
inline_for_extraction
let validate_sum_cases_t
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot Type
= validator (parse_sum_cases t pc k)
let validate_sum_cases_t_eq
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
(x y : validate_sum_cases_t t pc k)
: GTot Type0
= True
inline_for_extraction
let validate_sum_cases_t_if
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (if_combinator _ (validate_sum_cases_t_eq t pc k))
= fun cond (sv_true: cond_true cond -> Tot (validate_sum_cases_t t pc k)) (sv_false: cond_false cond -> Tot (validate_sum_cases_t t pc k)) #rrel #rel input pos ->
if cond
then sv_true () input pos
else sv_false () input pos
inline_for_extraction
let validate_sum_cases
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(vc: ((x: sum_key t) -> Tot (validator (dsnd (pc x)))))
(destr: dep_enum_destr (sum_enum t) (validate_sum_cases_t t pc))
(k: sum_key t)
: Tot (validator (parse_sum_cases t pc k))
= destr
_
(validate_sum_cases_t_if t pc)
(fun _ _ -> ())
(fun _ _ _ _ -> ())
(validate_sum_cases_aux t pc vc)
k
inline_for_extraction
let validate_sum_aux_payload_t
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
: Tot Type
= (#rrel: _) -> (#rel: _) ->
(input: slice rrel rel) ->
(pos: U64.t) ->
HST.Stack U64.t
(requires (fun h -> live_slice h input /\ U64.v pos <= U32.v input.len))
(ensures (fun h res h' ->
B.modifies B.loc_none h h' /\ (
match k with
| Unknown _ -> is_error res
| Known k' ->
if is_success res
then
valid_pos (dsnd (pc k')) h input (uint64_to_uint32 pos) (uint64_to_uint32 res)
else
(~ (valid (dsnd (pc k')) h input (uint64_to_uint32 pos)))
)))
let validate_sum_aux_payload_eq
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
: Tot (validate_sum_aux_payload_t t pc k -> validate_sum_aux_payload_t t pc k -> GTot Type0)
= fun _ _ -> True
inline_for_extraction
let validate_sum_aux_payload_if'
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
(cond: bool)
(ift: ((cond_true cond) -> Tot (validate_sum_aux_payload_t t pc k)))
(iff: ((cond_false cond) -> Tot (validate_sum_aux_payload_t t pc k)))
: Tot (validate_sum_aux_payload_t t pc k)
= fun #rrel #rel input pos ->
if cond
then begin
(ift () <: validate_sum_aux_payload_t t pc k) input pos
end else
(iff () <: validate_sum_aux_payload_t t pc k) input pos
inline_for_extraction
let validate_sum_aux_payload_if
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
: Tot (if_combinator _ (validate_sum_aux_payload_eq t pc k))
= validate_sum_aux_payload_if' t pc k
#push-options "--z3rlimit 64 --z3cliopt smt.arith.nl=false --using_facts_from '* -FStar.Int.Cast -LowParse.BitFields'"
// --query_stats --smtencoding.elim_box true --smtencoding.l_arith_repr native --z3refresh"
inline_for_extraction
let validate_sum_aux
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(v: validator p)
(p32: leaf_reader p)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(v_payload: ((k: sum_repr_type t)) -> Tot (validate_sum_aux_payload_t t pc (maybe_enum_key_of_repr (sum_enum t) k)))
: Tot (validator (parse_sum t p pc))
= fun #rrel #rel input pos ->
let h = HST.get () in
[@inline_let]
let _ = parse_sum_eq'' t p pc (bytes_of_slice_from h input (uint64_to_uint32 pos)) in
[@inline_let]
let _ = valid_facts (parse_sum t p pc) h input (uint64_to_uint32 pos) in
[@inline_let]
let _ = valid_facts p h input (uint64_to_uint32 pos) in
let len_after_tag = v input pos in
if is_error len_after_tag
then len_after_tag
else begin
let h1 = HST.get () in
let k' = p32 input (uint64_to_uint32 pos) in
[@inline_let]
let _ =
match maybe_enum_key_of_repr (sum_enum t) k' with
| Known k -> valid_facts (dsnd (pc k)) h input (uint64_to_uint32 len_after_tag)
| _ -> ()
in
v_payload k' input len_after_tag
end
#pop-options
inline_for_extraction
let validate_sum_aux_payload'
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (validator (dsnd (pc x)))))
(k: maybe_enum_key (sum_enum t))
: Tot (validate_sum_aux_payload_t t pc k)
= fun #rrel #rel input pos ->
match k with
| Known k ->
[@inline_let]
let _ = synth_sum_case_injective t k in
pc32 k input pos
// validate_synth (pc32 k) (synth_sum_case t k) () input pos
| _ -> validator_error_generic
inline_for_extraction
let validate_sum_aux_payload
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (validator (dsnd (pc x)))))
(destr: dep_maybe_enum_destr_t (sum_enum t) (validate_sum_aux_payload_t t pc))
(k: sum_repr_type t)
: Tot (validate_sum_aux_payload_t t pc (maybe_enum_key_of_repr (sum_enum t) k))
= destr (validate_sum_aux_payload_eq t pc) (validate_sum_aux_payload_if t pc) (fun _ _ -> ()) (fun _ _ _ _ -> ()) (validate_sum_aux_payload' t pc pc32) k
inline_for_extraction
let validate_sum
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(v: validator p)
(p32: leaf_reader p)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (validator (dsnd (pc x)))))
(destr: dep_maybe_enum_destr_t (sum_enum t) (validate_sum_aux_payload_t t pc))
: Tot (validator (parse_sum t p pc))
= validate_sum_aux t v p32 pc (validate_sum_aux_payload t pc pc32 destr)
module HS = FStar.HyperStack
#push-options "--z3rlimit 256 --z3cliopt smt.arith.nl=false --initial_ifuel 8 --max_ifuel 8 --initial_fuel 2 --max_fuel 2"
#restart-solver
let valid_sum_intro
(h: HS.mem)
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: Lemma
(requires (
valid (parse_enum_key p (sum_enum t)) h input pos /\ (
let k = contents (parse_enum_key p (sum_enum t)) h input pos in
valid (dsnd (pc k)) h input (get_valid_pos (parse_enum_key p (sum_enum t)) h input pos)
)))
(ensures (
let k = contents (parse_enum_key p (sum_enum t)) h input pos in
let pos_payload = get_valid_pos (parse_enum_key p (sum_enum t)) h input pos in
valid_content_pos
(parse_sum t p pc) h input pos
(synth_sum_case t k (contents (dsnd (pc k)) h input pos_payload))
(get_valid_pos (dsnd (pc k)) h input pos_payload)
))
= valid_facts (parse_enum_key p (sum_enum t)) h input pos;
let k = contents (parse_enum_key p (sum_enum t)) h input pos in
let pos_payload = get_valid_pos (parse_enum_key p (sum_enum t)) h input pos in
valid_facts (dsnd (pc k)) h input pos_payload;
valid_facts (parse_sum t p pc) h input pos;
parse_sum_eq t p pc (bytes_of_slice_from h input pos)
#pop-options
inline_for_extraction
let finalize_sum_case
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(s: serializer p)
(w: leaf_writer_strong s)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(destr: enum_repr_of_key'_t (sum_enum t))
(k: sum_key t)
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: HST.Stack unit
(requires (fun h ->
let len_tag = serialized_length (serialize_enum_key _ s (sum_enum t)) k in
U32.v pos + len_tag < 4294967296 /\ (
let pos_payload = pos `U32.add` U32.uint_to_t len_tag in
valid (dsnd (pc k)) h input pos_payload /\
writable input.base (U32.v pos) (U32.v pos_payload) h
)))
(ensures (fun h _ h' ->
let len_tag = serialized_length (serialize_enum_key _ s (sum_enum t)) k in
let pos_payload = pos `U32.add` U32.uint_to_t len_tag in
B.modifies (loc_slice_from_to input pos pos_payload) h h' /\
valid_content_pos (parse_sum t p pc) h' input pos (synth_sum_case t k (contents (dsnd (pc k)) h input pos_payload)) (get_valid_pos (dsnd (pc k)) h input pos_payload)
))
= let pos1 = write_enum_key w (sum_enum t) destr k input pos in
let h = HST.get () in
[@inline_let]
let _ = valid_sum_intro h t p pc input pos in
()
inline_for_extraction
let jump_sum_cases_aux
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(vc: ((x: sum_key t) -> Tot (jumper (dsnd (pc x)))))
(k: sum_key t)
: Tot (jumper (parse_sum_cases t pc k))
= [@inline_let]
let _ = synth_sum_case_injective t k in
jump_synth
(jump_weaken
(weaken_parse_cases_kind t pc)
(vc k)
()
)
(synth_sum_case t k)
()
inline_for_extraction
let jump_sum_cases_t
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot Type
= jumper (parse_sum_cases t pc k)
let jump_sum_cases_t_eq
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
(x y : jump_sum_cases_t t pc k)
: GTot Type0
= True
inline_for_extraction
let jump_sum_cases_t_if
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (if_combinator _ (jump_sum_cases_t_eq t pc k))
= fun cond (sv_true: cond_true cond -> Tot (jump_sum_cases_t t pc k)) (sv_false: cond_false cond -> Tot (jump_sum_cases_t t pc k)) #rrel #rel input pos ->
if cond
then sv_true () input pos
else sv_false () input pos
inline_for_extraction
let jump_sum_cases
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(vc: ((x: sum_key t) -> Tot (jumper (dsnd (pc x)))))
(destr: dep_enum_destr (sum_enum t) (jump_sum_cases_t t pc))
(k: sum_key t)
: Tot (jumper (parse_sum_cases t pc k))
= destr
_
(jump_sum_cases_t_if t pc)
(fun _ _ -> ())
(fun _ _ _ _ -> ())
(jump_sum_cases_aux t pc vc)
k
inline_for_extraction
let jump_sum_aux_payload_t
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
: Tot Type
= (#rrel: _) -> (#rel: _) ->
(input: slice rrel rel) ->
(pos: U32.t) ->
HST.Stack U32.t
(requires (fun h -> live_slice h input /\ U32.v pos <= U32.v input.len /\ (
match k with
| Unknown _ -> False
| Known k' -> valid (dsnd (pc k')) h input pos
)))
(ensures (fun h res h' ->
B.modifies B.loc_none h h' /\ (
match k with
| Unknown _ -> False
| Known k' ->
valid_pos (dsnd (pc k')) h input pos res
)))
let jump_sum_aux_payload_eq
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
: Tot (jump_sum_aux_payload_t t pc k -> jump_sum_aux_payload_t t pc k -> GTot Type0)
= fun _ _ -> True
inline_for_extraction
let jump_sum_aux_payload_if'
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
(cond: bool)
(ift: ((cond_true cond) -> Tot (jump_sum_aux_payload_t t pc k)))
(iff: ((cond_false cond) -> Tot (jump_sum_aux_payload_t t pc k)))
: Tot (jump_sum_aux_payload_t t pc k)
= fun #rrel #rel input pos ->
if cond
then begin
(ift () <: jump_sum_aux_payload_t t pc k) input pos
end else
(iff () <: jump_sum_aux_payload_t t pc k) input pos
inline_for_extraction
let jump_sum_aux_payload_if
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
: Tot (if_combinator _ (jump_sum_aux_payload_eq t pc k))
= jump_sum_aux_payload_if' t pc k
let parse_sum_eq3
(#kt: parser_kind)
(t: sum)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(input: bytes)
(k' : sum_repr_type t)
(consumed_k: consumed_length input)
: Lemma
(requires (Some? (parse (parse_sum t p pc) input) /\ parse p input == Some (k', consumed_k)))
(ensures (
let input_k = Seq.slice input consumed_k (Seq.length input) in
let k = maybe_enum_key_of_repr (sum_enum t) k' in
begin match k with
| Known k ->
Some? (parse (dsnd (pc k)) input_k)
| _ -> False
end
))
= parse_sum_eq'' t p pc input
let parse_sum_eq4
(#kt: parser_kind)
(t: sum)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(input: bytes)
(k' : sum_repr_type t)
(consumed_k: consumed_length input)
(consumed_payload: nat)
: Lemma
(requires (Some? (parse (parse_sum t p pc) input) /\ parse p input == Some (k', consumed_k) /\ (
let input_k = Seq.slice input consumed_k (Seq.length input) in
let k = maybe_enum_key_of_repr (sum_enum t) k' in
begin match k with
| Known k ->
Some? (parse (dsnd (pc k)) input_k) /\ (
let Some (_, consumed_payload') = parse (dsnd (pc k)) input_k in
consumed_payload' == consumed_payload
)
| _ -> False
end
)))
(ensures (
let Some (_, consumed) = parse (parse_sum t p pc) input in
consumed == consumed_k + consumed_payload
))
= parse_sum_eq'' t p pc input
#push-options "--z3rlimit 16"
let valid_sum_elim
(h: HS.mem)
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(#rrel: _) (#rel: _)
(input: slice rrel rel)
(pos: U32.t)
: Lemma
(requires (
valid (parse_sum t p pc) h input pos
))
(ensures (
valid p h input pos /\ (
let pos_payload = get_valid_pos p h input pos in
let k' = maybe_enum_key_of_repr (sum_enum t) (contents p h input pos) in
match k' with
| Known k ->
k == sum_tag_of_data t (contents (parse_sum t p pc) h input pos) /\
valid (dsnd (pc k)) h input pos_payload /\
valid_pos
(parse_sum t p pc) h input pos
(get_valid_pos (dsnd (pc k)) h input pos_payload)
| _ -> False
)))
= let sinput = bytes_of_slice_from h input pos in
let _ = parse_sum_eq'' t p pc sinput in
[@inline_let]
let _ = valid_facts (parse_sum t p pc) h input pos in
let Some (k', consumed_k) = parse p sinput in
let pos_after_tag = U32.uint_to_t (U32.v pos + consumed_k) in
[@inline_let]
let _ = valid_facts p h input pos in
assert (valid_content_pos p h input pos k' pos_after_tag);
match maybe_enum_key_of_repr (sum_enum t) k' with
| Known k -> valid_facts (dsnd (pc k)) h input pos_after_tag
| _ -> ()
#pop-options | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"LowStar.Buffer.fst.checked",
"LowParse.Spec.Sum.fst.checked",
"LowParse.Low.Enum.fst.checked",
"FStar.UInt64.fsti.checked",
"FStar.UInt32.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Int.Cast.fst.checked",
"FStar.HyperStack.ST.fsti.checked",
"FStar.HyperStack.fst.checked",
"FStar.Classical.fsti.checked"
],
"interface_file": false,
"source_file": "LowParse.Low.Sum.fst"
} | [
{
"abbrev": true,
"full_module": "FStar.HyperStack",
"short_module": "HS"
},
{
"abbrev": true,
"full_module": "FStar.UInt64",
"short_module": "U64"
},
{
"abbrev": true,
"full_module": "FStar.Int.Cast",
"short_module": "Cast"
},
{
"abbrev": true,
"full_module": "LowStar.Buffer",
"short_module": "B"
},
{
"abbrev": true,
"full_module": "FStar.HyperStack.ST",
"short_module": "HST"
},
{
"abbrev": true,
"full_module": "FStar.UInt32",
"short_module": "U32"
},
{
"abbrev": false,
"full_module": "LowParse.Spec.Sum",
"short_module": null
},
{
"abbrev": false,
"full_module": "LowParse.Low.Enum",
"short_module": null
},
{
"abbrev": false,
"full_module": "LowParse.Low",
"short_module": null
},
{
"abbrev": false,
"full_module": "LowParse.Low",
"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",
"short_module": null
}
] | {
"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_elim_box": false,
"smtencoding_l_arith_repr": "boxwrap",
"smtencoding_nl_arith_repr": "boxwrap",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": true,
"z3cliopt": [],
"z3refresh": false,
"z3rlimit": 5,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | false |
h: FStar.Monotonic.HyperStack.mem ->
t: LowParse.Spec.Sum.sum ->
p: LowParse.Spec.Base.parser kt (LowParse.Spec.Sum.sum_repr_type t) ->
pc:
(x: LowParse.Spec.Sum.sum_key t
-> Prims.dtuple2 LowParse.Spec.Base.parser_kind
(fun k -> LowParse.Spec.Base.parser k (LowParse.Spec.Sum.sum_type_of_tag t x))) ->
input: LowParse.Slice.slice rrel rel ->
pos: FStar.UInt32.t
-> FStar.Pervasives.Lemma
(requires LowParse.Low.Base.Spec.valid (LowParse.Spec.Sum.parse_sum t p pc) h input pos)
(ensures
LowParse.Low.Base.Spec.valid (LowParse.Spec.Enum.parse_enum_key p
(LowParse.Spec.Sum.sum_enum t))
h
input
pos /\
LowParse.Low.Base.Spec.contents (LowParse.Spec.Enum.parse_enum_key p
(LowParse.Spec.Sum.sum_enum t))
h
input
pos ==
LowParse.Spec.Sum.sum_tag_of_data t
(LowParse.Low.Base.Spec.contents (LowParse.Spec.Sum.parse_sum t p pc) h input pos)) | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"FStar.Monotonic.HyperStack.mem",
"LowParse.Spec.Sum.sum",
"LowParse.Spec.Base.parser_kind",
"LowParse.Spec.Base.parser",
"LowParse.Spec.Sum.sum_repr_type",
"LowParse.Spec.Sum.sum_key",
"Prims.dtuple2",
"LowParse.Spec.Sum.sum_type_of_tag",
"LowParse.Slice.srel",
"LowParse.Bytes.byte",
"LowParse.Slice.slice",
"FStar.UInt32.t",
"Prims.unit",
"LowParse.Low.Base.Spec.valid_facts",
"LowParse.Spec.Combinators.parse_filter_kind",
"LowParse.Spec.Enum.enum_key",
"LowParse.Spec.Sum.sum_key_type",
"LowParse.Spec.Sum.sum_enum",
"LowParse.Spec.Enum.parse_enum_key",
"LowParse.Spec.Sum.parse_sum_kind",
"LowParse.Spec.Sum.sum_type",
"LowParse.Spec.Sum.parse_sum",
"LowParse.Spec.Sum.parse_sum_eq'",
"LowParse.Slice.bytes_of_slice_from",
"LowParse.Low.Base.Spec.valid",
"Prims.squash",
"Prims.l_and",
"Prims.eq2",
"LowParse.Low.Base.Spec.contents",
"LowParse.Spec.Sum.sum_tag_of_data",
"Prims.Nil",
"FStar.Pervasives.pattern"
] | [] | true | false | true | false | false | let valid_sum_elim_tag
(h: HS.mem)
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: (x: sum_key t -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: Lemma (requires (valid (parse_sum t p pc) h input pos))
(ensures
(valid (parse_enum_key p (sum_enum t)) h input pos /\
contents (parse_enum_key p (sum_enum t)) h input pos ==
sum_tag_of_data t (contents (parse_sum t p pc) h input pos))) =
| let _ = parse_sum_eq' t p pc (bytes_of_slice_from h input pos) in
let _ = valid_facts (parse_sum t p pc) h input pos in
let _ = valid_facts (parse_enum_key p (sum_enum t)) h input pos in
() | false |
LowParse.Low.Sum.fst | LowParse.Low.Sum.read_dsum_cases_t_eq | val read_dsum_cases_t_eq
(t: dsum)
(f: (x: dsum_known_key t -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x))))
(#k': parser_kind)
(g: parser k' (dsum_type_of_unknown_tag t))
(k: dsum_known_key t)
(x y: read_dsum_cases_t t f g k)
: GTot Type0 | val read_dsum_cases_t_eq
(t: dsum)
(f: (x: dsum_known_key t -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x))))
(#k': parser_kind)
(g: parser k' (dsum_type_of_unknown_tag t))
(k: dsum_known_key t)
(x y: read_dsum_cases_t t f g k)
: GTot Type0 | let read_dsum_cases_t_eq
(t: dsum)
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(#k': parser_kind)
(g: parser k' (dsum_type_of_unknown_tag t))
(k: dsum_known_key t)
(x y : read_dsum_cases_t t f g k)
: GTot Type0
= True | {
"file_name": "src/lowparse/LowParse.Low.Sum.fst",
"git_rev": "00217c4a89f5ba56002ba9aa5b4a9d5903bfe9fa",
"git_url": "https://github.com/project-everest/everparse.git",
"project_name": "everparse"
} | {
"end_col": 6,
"end_line": 1561,
"start_col": 0,
"start_line": 1553
} | module LowParse.Low.Sum
include LowParse.Low.Enum
include LowParse.Spec.Sum
module U32 = FStar.UInt32
module HST = FStar.HyperStack.ST
module B = LowStar.Buffer
module Cast = FStar.Int.Cast
module U64 = FStar.UInt64
inline_for_extraction
let validate_sum_cases_aux
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(vc: ((x: sum_key t) -> Tot (validator (dsnd (pc x)))))
(k: sum_key t)
: Tot (validator (parse_sum_cases t pc k))
= [@inline_let]
let _ = synth_sum_case_injective t k in
validate_synth
(validate_weaken
(weaken_parse_cases_kind t pc)
(vc k)
()
)
(synth_sum_case t k)
()
inline_for_extraction
let validate_sum_cases_t
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot Type
= validator (parse_sum_cases t pc k)
let validate_sum_cases_t_eq
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
(x y : validate_sum_cases_t t pc k)
: GTot Type0
= True
inline_for_extraction
let validate_sum_cases_t_if
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (if_combinator _ (validate_sum_cases_t_eq t pc k))
= fun cond (sv_true: cond_true cond -> Tot (validate_sum_cases_t t pc k)) (sv_false: cond_false cond -> Tot (validate_sum_cases_t t pc k)) #rrel #rel input pos ->
if cond
then sv_true () input pos
else sv_false () input pos
inline_for_extraction
let validate_sum_cases
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(vc: ((x: sum_key t) -> Tot (validator (dsnd (pc x)))))
(destr: dep_enum_destr (sum_enum t) (validate_sum_cases_t t pc))
(k: sum_key t)
: Tot (validator (parse_sum_cases t pc k))
= destr
_
(validate_sum_cases_t_if t pc)
(fun _ _ -> ())
(fun _ _ _ _ -> ())
(validate_sum_cases_aux t pc vc)
k
inline_for_extraction
let validate_sum_aux_payload_t
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
: Tot Type
= (#rrel: _) -> (#rel: _) ->
(input: slice rrel rel) ->
(pos: U64.t) ->
HST.Stack U64.t
(requires (fun h -> live_slice h input /\ U64.v pos <= U32.v input.len))
(ensures (fun h res h' ->
B.modifies B.loc_none h h' /\ (
match k with
| Unknown _ -> is_error res
| Known k' ->
if is_success res
then
valid_pos (dsnd (pc k')) h input (uint64_to_uint32 pos) (uint64_to_uint32 res)
else
(~ (valid (dsnd (pc k')) h input (uint64_to_uint32 pos)))
)))
let validate_sum_aux_payload_eq
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
: Tot (validate_sum_aux_payload_t t pc k -> validate_sum_aux_payload_t t pc k -> GTot Type0)
= fun _ _ -> True
inline_for_extraction
let validate_sum_aux_payload_if'
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
(cond: bool)
(ift: ((cond_true cond) -> Tot (validate_sum_aux_payload_t t pc k)))
(iff: ((cond_false cond) -> Tot (validate_sum_aux_payload_t t pc k)))
: Tot (validate_sum_aux_payload_t t pc k)
= fun #rrel #rel input pos ->
if cond
then begin
(ift () <: validate_sum_aux_payload_t t pc k) input pos
end else
(iff () <: validate_sum_aux_payload_t t pc k) input pos
inline_for_extraction
let validate_sum_aux_payload_if
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
: Tot (if_combinator _ (validate_sum_aux_payload_eq t pc k))
= validate_sum_aux_payload_if' t pc k
#push-options "--z3rlimit 64 --z3cliopt smt.arith.nl=false --using_facts_from '* -FStar.Int.Cast -LowParse.BitFields'"
// --query_stats --smtencoding.elim_box true --smtencoding.l_arith_repr native --z3refresh"
inline_for_extraction
let validate_sum_aux
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(v: validator p)
(p32: leaf_reader p)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(v_payload: ((k: sum_repr_type t)) -> Tot (validate_sum_aux_payload_t t pc (maybe_enum_key_of_repr (sum_enum t) k)))
: Tot (validator (parse_sum t p pc))
= fun #rrel #rel input pos ->
let h = HST.get () in
[@inline_let]
let _ = parse_sum_eq'' t p pc (bytes_of_slice_from h input (uint64_to_uint32 pos)) in
[@inline_let]
let _ = valid_facts (parse_sum t p pc) h input (uint64_to_uint32 pos) in
[@inline_let]
let _ = valid_facts p h input (uint64_to_uint32 pos) in
let len_after_tag = v input pos in
if is_error len_after_tag
then len_after_tag
else begin
let h1 = HST.get () in
let k' = p32 input (uint64_to_uint32 pos) in
[@inline_let]
let _ =
match maybe_enum_key_of_repr (sum_enum t) k' with
| Known k -> valid_facts (dsnd (pc k)) h input (uint64_to_uint32 len_after_tag)
| _ -> ()
in
v_payload k' input len_after_tag
end
#pop-options
inline_for_extraction
let validate_sum_aux_payload'
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (validator (dsnd (pc x)))))
(k: maybe_enum_key (sum_enum t))
: Tot (validate_sum_aux_payload_t t pc k)
= fun #rrel #rel input pos ->
match k with
| Known k ->
[@inline_let]
let _ = synth_sum_case_injective t k in
pc32 k input pos
// validate_synth (pc32 k) (synth_sum_case t k) () input pos
| _ -> validator_error_generic
inline_for_extraction
let validate_sum_aux_payload
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (validator (dsnd (pc x)))))
(destr: dep_maybe_enum_destr_t (sum_enum t) (validate_sum_aux_payload_t t pc))
(k: sum_repr_type t)
: Tot (validate_sum_aux_payload_t t pc (maybe_enum_key_of_repr (sum_enum t) k))
= destr (validate_sum_aux_payload_eq t pc) (validate_sum_aux_payload_if t pc) (fun _ _ -> ()) (fun _ _ _ _ -> ()) (validate_sum_aux_payload' t pc pc32) k
inline_for_extraction
let validate_sum
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(v: validator p)
(p32: leaf_reader p)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (validator (dsnd (pc x)))))
(destr: dep_maybe_enum_destr_t (sum_enum t) (validate_sum_aux_payload_t t pc))
: Tot (validator (parse_sum t p pc))
= validate_sum_aux t v p32 pc (validate_sum_aux_payload t pc pc32 destr)
module HS = FStar.HyperStack
#push-options "--z3rlimit 256 --z3cliopt smt.arith.nl=false --initial_ifuel 8 --max_ifuel 8 --initial_fuel 2 --max_fuel 2"
#restart-solver
let valid_sum_intro
(h: HS.mem)
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: Lemma
(requires (
valid (parse_enum_key p (sum_enum t)) h input pos /\ (
let k = contents (parse_enum_key p (sum_enum t)) h input pos in
valid (dsnd (pc k)) h input (get_valid_pos (parse_enum_key p (sum_enum t)) h input pos)
)))
(ensures (
let k = contents (parse_enum_key p (sum_enum t)) h input pos in
let pos_payload = get_valid_pos (parse_enum_key p (sum_enum t)) h input pos in
valid_content_pos
(parse_sum t p pc) h input pos
(synth_sum_case t k (contents (dsnd (pc k)) h input pos_payload))
(get_valid_pos (dsnd (pc k)) h input pos_payload)
))
= valid_facts (parse_enum_key p (sum_enum t)) h input pos;
let k = contents (parse_enum_key p (sum_enum t)) h input pos in
let pos_payload = get_valid_pos (parse_enum_key p (sum_enum t)) h input pos in
valid_facts (dsnd (pc k)) h input pos_payload;
valid_facts (parse_sum t p pc) h input pos;
parse_sum_eq t p pc (bytes_of_slice_from h input pos)
#pop-options
inline_for_extraction
let finalize_sum_case
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(s: serializer p)
(w: leaf_writer_strong s)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(destr: enum_repr_of_key'_t (sum_enum t))
(k: sum_key t)
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: HST.Stack unit
(requires (fun h ->
let len_tag = serialized_length (serialize_enum_key _ s (sum_enum t)) k in
U32.v pos + len_tag < 4294967296 /\ (
let pos_payload = pos `U32.add` U32.uint_to_t len_tag in
valid (dsnd (pc k)) h input pos_payload /\
writable input.base (U32.v pos) (U32.v pos_payload) h
)))
(ensures (fun h _ h' ->
let len_tag = serialized_length (serialize_enum_key _ s (sum_enum t)) k in
let pos_payload = pos `U32.add` U32.uint_to_t len_tag in
B.modifies (loc_slice_from_to input pos pos_payload) h h' /\
valid_content_pos (parse_sum t p pc) h' input pos (synth_sum_case t k (contents (dsnd (pc k)) h input pos_payload)) (get_valid_pos (dsnd (pc k)) h input pos_payload)
))
= let pos1 = write_enum_key w (sum_enum t) destr k input pos in
let h = HST.get () in
[@inline_let]
let _ = valid_sum_intro h t p pc input pos in
()
inline_for_extraction
let jump_sum_cases_aux
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(vc: ((x: sum_key t) -> Tot (jumper (dsnd (pc x)))))
(k: sum_key t)
: Tot (jumper (parse_sum_cases t pc k))
= [@inline_let]
let _ = synth_sum_case_injective t k in
jump_synth
(jump_weaken
(weaken_parse_cases_kind t pc)
(vc k)
()
)
(synth_sum_case t k)
()
inline_for_extraction
let jump_sum_cases_t
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot Type
= jumper (parse_sum_cases t pc k)
let jump_sum_cases_t_eq
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
(x y : jump_sum_cases_t t pc k)
: GTot Type0
= True
inline_for_extraction
let jump_sum_cases_t_if
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (if_combinator _ (jump_sum_cases_t_eq t pc k))
= fun cond (sv_true: cond_true cond -> Tot (jump_sum_cases_t t pc k)) (sv_false: cond_false cond -> Tot (jump_sum_cases_t t pc k)) #rrel #rel input pos ->
if cond
then sv_true () input pos
else sv_false () input pos
inline_for_extraction
let jump_sum_cases
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(vc: ((x: sum_key t) -> Tot (jumper (dsnd (pc x)))))
(destr: dep_enum_destr (sum_enum t) (jump_sum_cases_t t pc))
(k: sum_key t)
: Tot (jumper (parse_sum_cases t pc k))
= destr
_
(jump_sum_cases_t_if t pc)
(fun _ _ -> ())
(fun _ _ _ _ -> ())
(jump_sum_cases_aux t pc vc)
k
inline_for_extraction
let jump_sum_aux_payload_t
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
: Tot Type
= (#rrel: _) -> (#rel: _) ->
(input: slice rrel rel) ->
(pos: U32.t) ->
HST.Stack U32.t
(requires (fun h -> live_slice h input /\ U32.v pos <= U32.v input.len /\ (
match k with
| Unknown _ -> False
| Known k' -> valid (dsnd (pc k')) h input pos
)))
(ensures (fun h res h' ->
B.modifies B.loc_none h h' /\ (
match k with
| Unknown _ -> False
| Known k' ->
valid_pos (dsnd (pc k')) h input pos res
)))
let jump_sum_aux_payload_eq
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
: Tot (jump_sum_aux_payload_t t pc k -> jump_sum_aux_payload_t t pc k -> GTot Type0)
= fun _ _ -> True
inline_for_extraction
let jump_sum_aux_payload_if'
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
(cond: bool)
(ift: ((cond_true cond) -> Tot (jump_sum_aux_payload_t t pc k)))
(iff: ((cond_false cond) -> Tot (jump_sum_aux_payload_t t pc k)))
: Tot (jump_sum_aux_payload_t t pc k)
= fun #rrel #rel input pos ->
if cond
then begin
(ift () <: jump_sum_aux_payload_t t pc k) input pos
end else
(iff () <: jump_sum_aux_payload_t t pc k) input pos
inline_for_extraction
let jump_sum_aux_payload_if
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
: Tot (if_combinator _ (jump_sum_aux_payload_eq t pc k))
= jump_sum_aux_payload_if' t pc k
let parse_sum_eq3
(#kt: parser_kind)
(t: sum)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(input: bytes)
(k' : sum_repr_type t)
(consumed_k: consumed_length input)
: Lemma
(requires (Some? (parse (parse_sum t p pc) input) /\ parse p input == Some (k', consumed_k)))
(ensures (
let input_k = Seq.slice input consumed_k (Seq.length input) in
let k = maybe_enum_key_of_repr (sum_enum t) k' in
begin match k with
| Known k ->
Some? (parse (dsnd (pc k)) input_k)
| _ -> False
end
))
= parse_sum_eq'' t p pc input
let parse_sum_eq4
(#kt: parser_kind)
(t: sum)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(input: bytes)
(k' : sum_repr_type t)
(consumed_k: consumed_length input)
(consumed_payload: nat)
: Lemma
(requires (Some? (parse (parse_sum t p pc) input) /\ parse p input == Some (k', consumed_k) /\ (
let input_k = Seq.slice input consumed_k (Seq.length input) in
let k = maybe_enum_key_of_repr (sum_enum t) k' in
begin match k with
| Known k ->
Some? (parse (dsnd (pc k)) input_k) /\ (
let Some (_, consumed_payload') = parse (dsnd (pc k)) input_k in
consumed_payload' == consumed_payload
)
| _ -> False
end
)))
(ensures (
let Some (_, consumed) = parse (parse_sum t p pc) input in
consumed == consumed_k + consumed_payload
))
= parse_sum_eq'' t p pc input
#push-options "--z3rlimit 16"
let valid_sum_elim
(h: HS.mem)
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(#rrel: _) (#rel: _)
(input: slice rrel rel)
(pos: U32.t)
: Lemma
(requires (
valid (parse_sum t p pc) h input pos
))
(ensures (
valid p h input pos /\ (
let pos_payload = get_valid_pos p h input pos in
let k' = maybe_enum_key_of_repr (sum_enum t) (contents p h input pos) in
match k' with
| Known k ->
k == sum_tag_of_data t (contents (parse_sum t p pc) h input pos) /\
valid (dsnd (pc k)) h input pos_payload /\
valid_pos
(parse_sum t p pc) h input pos
(get_valid_pos (dsnd (pc k)) h input pos_payload)
| _ -> False
)))
= let sinput = bytes_of_slice_from h input pos in
let _ = parse_sum_eq'' t p pc sinput in
[@inline_let]
let _ = valid_facts (parse_sum t p pc) h input pos in
let Some (k', consumed_k) = parse p sinput in
let pos_after_tag = U32.uint_to_t (U32.v pos + consumed_k) in
[@inline_let]
let _ = valid_facts p h input pos in
assert (valid_content_pos p h input pos k' pos_after_tag);
match maybe_enum_key_of_repr (sum_enum t) k' with
| Known k -> valid_facts (dsnd (pc k)) h input pos_after_tag
| _ -> ()
#pop-options
let valid_sum_elim_tag
(h: HS.mem)
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: Lemma
(requires (
valid (parse_sum t p pc) h input pos
))
(ensures (
valid (parse_enum_key p (sum_enum t)) h input pos /\
contents (parse_enum_key p (sum_enum t)) h input pos == sum_tag_of_data t (contents (parse_sum t p pc) h input pos)
))
= let _ = parse_sum_eq' t p pc (bytes_of_slice_from h input pos) in
let _ = valid_facts (parse_sum t p pc) h input pos in
let _ = valid_facts (parse_enum_key p (sum_enum t)) h input pos in
()
inline_for_extraction
let read_sum_tag
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(p32: leaf_reader p)
(destr: dep_maybe_enum_destr_t (sum_enum t) (read_enum_key_t (sum_enum t)))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: HST.Stack (sum_key t)
(requires (fun h ->
valid (parse_sum t p pc) h input pos
))
(ensures (fun h res h' ->
B.modifies B.loc_none h h' /\
res == sum_tag_of_data t (contents (parse_sum t p pc) h input pos)
))
= let h = HST.get () in
[@inline_let] let _ = valid_sum_elim_tag h t p pc input pos in
read_enum_key p32 (sum_enum t) destr input pos
inline_for_extraction
let jump_sum_aux
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(v: jumper p)
(p32: leaf_reader p)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(v_payload: ((k: sum_repr_type t)) -> Tot (jump_sum_aux_payload_t t pc (maybe_enum_key_of_repr (sum_enum t) k)))
: Tot (jumper (parse_sum t p pc))
= fun #rrel #rel input pos ->
let h = HST.get () in
[@inline_let]
let _ = valid_sum_elim h t p pc input pos in
let pos_after_tag = v input pos in
let k' = p32 input pos in
v_payload k' input pos_after_tag
inline_for_extraction
let jump_sum_aux_payload'
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (jumper (dsnd (pc x)))))
(k: maybe_enum_key (sum_enum t))
: Tot (jump_sum_aux_payload_t t pc k)
= fun #rrel #rel input pos ->
match k with
| Known k ->
[@inline_let]
let _ = synth_sum_case_injective t k in
pc32 k input pos
| _ -> 0ul // dummy, but we MUST NOT remove this branch, otherwise extraction fails
inline_for_extraction
let jump_sum_aux_payload
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (jumper (dsnd (pc x)))))
(destr: dep_maybe_enum_destr_t (sum_enum t) (jump_sum_aux_payload_t t pc))
(k: sum_repr_type t)
: Tot (jump_sum_aux_payload_t t pc (maybe_enum_key_of_repr (sum_enum t) k))
= destr (jump_sum_aux_payload_eq t pc) (jump_sum_aux_payload_if t pc) (fun _ _ -> ()) (fun _ _ _ _ -> ()) (jump_sum_aux_payload' t pc pc32) k
inline_for_extraction
let jump_sum
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(v: jumper p)
(p32: leaf_reader p)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (jumper (dsnd (pc x)))))
(destr: dep_maybe_enum_destr_t (sum_enum t) (jump_sum_aux_payload_t t pc))
: Tot (jumper (parse_sum t p pc))
= jump_sum_aux t v p32 pc (jump_sum_aux_payload t pc pc32 destr)
inline_for_extraction
let read_sum_cases'
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (leaf_reader (dsnd (pc x)))))
(k: sum_key t)
: Tot (leaf_reader (parse_sum_cases' t pc k))
= [@inline_let]
let _ = synth_sum_case_injective t k in
read_synth'
(dsnd (pc k))
(synth_sum_case t k)
(pc32 k)
()
inline_for_extraction
let read_sum_cases_t
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot Type
= leaf_reader (parse_sum_cases' t pc k)
let read_sum_cases_t_eq
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
(x y : read_sum_cases_t t pc k)
: GTot Type0
= True
inline_for_extraction
let read_sum_cases_t_if
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (if_combinator _ (read_sum_cases_t_eq t pc k))
= fun cond (sv_true: cond_true cond -> Tot (read_sum_cases_t t pc k)) (sv_false: cond_false cond -> Tot (read_sum_cases_t t pc k)) #_ #_ input pos ->
if cond
then (sv_true () input pos)
else (sv_false () input pos)
inline_for_extraction
let read_sum_cases
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (leaf_reader (dsnd (pc x)))))
(destr: dep_enum_destr (sum_enum t) (read_sum_cases_t t pc))
(k: sum_key t)
: Tot (leaf_reader (parse_sum_cases' t pc k))
= destr
_
(read_sum_cases_t_if t pc)
(fun _ _ -> ())
(fun _ _ _ _ -> ())
(read_sum_cases' t pc pc32)
k
#push-options "--z3rlimit 32"
inline_for_extraction
let read_sum
(#kt: parser_kind)
(t: sum)
(p: parser kt (sum_repr_type t))
(p32: leaf_reader (parse_enum_key p (sum_enum t)))
(j: jumper p)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (leaf_reader (dsnd (pc x)))))
(destr: dep_enum_destr (sum_enum t) (read_sum_cases_t t pc))
: Tot (leaf_reader (parse_sum t p pc))
=
fun #_ #_ input pos ->
let h = HST.get () in
valid_facts (parse_sum t p pc) h input pos;
parse_sum_eq' t p pc (bytes_of_slice_from h input pos);
valid_facts (parse_enum_key p (sum_enum t)) h input pos;
let k = p32 input pos in
let pos' = jump_enum_key j (sum_enum t) input pos in
valid_facts (parse_sum_cases' t pc k) h input pos' ;
read_sum_cases t pc pc32 destr k input pos'
#pop-options
inline_for_extraction
let serialize32_sum_cases_t
(t: sum)
(#pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(sc: ((x: sum_key t) -> Tot (serializer (dsnd (pc x)))))
(k: sum_key t)
: Tot Type
= serializer32 (serialize_sum_cases t pc sc k)
let serialize32_sum_cases_t_eq
(t: sum)
(#pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(sc: ((x: sum_key t) -> Tot (serializer (dsnd (pc x)))))
(k: sum_key t)
(x y: serialize32_sum_cases_t t sc k)
: GTot Type0
= True
inline_for_extraction
let serialize32_sum_cases_t_if
(t: sum)
(#pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(sc: ((x: sum_key t) -> Tot (serializer (dsnd (pc x)))))
(k: sum_key t)
: Tot (if_combinator _ (serialize32_sum_cases_t_eq t sc k))
= fun cond (sv_true: (cond_true cond -> Tot (serialize32_sum_cases_t t sc k))) (sv_false: (cond_false cond -> Tot (serialize32_sum_cases_t t sc k))) x #rrel #rel b pos ->
if cond
then (sv_true () x b pos)
else (sv_false () x b pos)
inline_for_extraction
let serialize32_sum_cases_aux
(t: sum)
(#pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(sc: ((x: sum_key t) -> Tot (serializer (dsnd (pc x)))))
(sc32: ((x: sum_key t) -> Tot (serializer32 (sc x))))
(k: sum_key t)
: Tot (serializer32 (serialize_sum_cases t pc sc k))
= fun x #rrel #rel b pos ->
[@inline_let] let _ =
Classical.forall_intro (parse_sum_cases_eq' t pc k);
synth_sum_case_injective t k;
synth_sum_case_inverse t k
in
serialize32_synth
(sc32 k)
(synth_sum_case t k)
(synth_sum_case_recip t k)
(fun x -> synth_sum_case_recip t k x)
()
x
b
pos
inline_for_extraction
let serialize32_sum_cases
(t: sum)
(#pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(sc: ((x: sum_key t) -> Tot (serializer (dsnd (pc x)))))
(sc32: ((x: sum_key t) -> Tot (serializer32 (sc x))))
(destr: dep_enum_destr (sum_enum t) (serialize32_sum_cases_t t sc))
(k: sum_key t)
: Tot (serializer32 (serialize_sum_cases t pc sc k))
= destr
_
(serialize32_sum_cases_t_if t sc)
(fun _ _ -> ())
(fun _ _ _ _ -> ())
(serialize32_sum_cases_aux t sc sc32)
k
inline_for_extraction
let serialize32_sum
(#kt: parser_kind)
(t: sum)
(#p: parser kt (sum_repr_type t))
(s: serializer p {kt.parser_kind_subkind == Some ParserStrong})
(s32: serializer32 (serialize_enum_key _ s (sum_enum t)))
(#pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(sc: ((x: sum_key t) -> Tot (serializer (dsnd (pc x)))))
(sc32: ((x: sum_key t) -> Tot (serializer32 (sc x))))
(destr: dep_enum_destr (sum_enum t) (serialize32_sum_cases_t t sc))
: Tot (serializer32 (serialize_sum t s sc))
= fun x #rrel #rel b pos ->
serialize_sum_eq t s sc x;
let tg = sum_tag_of_data t x in
serialize32_nondep_then_aux s32 (serialize32_sum_cases t sc sc32 destr tg) tg x b pos
let clens_sum_tag
(s: sum)
: Tot (clens (sum_type s) (sum_key s))
= {
clens_cond = (fun _ -> True);
clens_get = sum_tag_of_data s;
}
let gaccessor_sum_tag
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
: Tot (gaccessor (parse_sum t p pc) (parse_enum_key p (sum_enum t)) (clens_sum_tag t))
= gaccessor_tagged_union_tag
(parse_enum_key p (sum_enum t))
(sum_tag_of_data t)
(parse_sum_cases t pc)
inline_for_extraction
let accessor_sum_tag
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
: Tot (accessor (gaccessor_sum_tag t p pc))
= accessor_tagged_union_tag
(parse_enum_key p (sum_enum t))
(sum_tag_of_data t)
(parse_sum_cases t pc)
let clens_sum_payload
(s: sum)
(k: sum_key s)
: Tot (clens (sum_type s) (sum_type_of_tag s k))
= {
clens_cond = (fun (x: sum_type s) -> sum_tag_of_data s x == k);
clens_get = (fun (x: sum_type s) -> synth_sum_case_recip s k x <: Ghost (sum_type_of_tag s k) (requires (sum_tag_of_data s x == k)) (ensures (fun _ -> True)));
}
#push-options "--z3rlimit 32"
let gaccessor_clens_sum_payload'
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (gaccessor' (parse_sum t p pc) (dsnd (pc k)) (clens_sum_payload t k))
= fun (input: bytes) ->
parse_sum_eq'' t p pc input;
let res =
match parse p input with
| Some (_, consumed) ->
synth_sum_case_inverse t k;
synth_sum_case_injective t k;
synth_injective_synth_inverse_synth_inverse_recip (synth_sum_case t k) (synth_sum_case_recip t k) ();
(consumed)
| _ -> 0 // dummy
in
(res <: (res: _ { gaccessor_post' (parse_sum t p pc) (dsnd (pc k)) (clens_sum_payload t k) input res } ))
#push-options "--z3rlimit 64"
let gaccessor_clens_sum_payload_injective
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
(sl sl' : bytes)
: Lemma
(requires (
gaccessor_pre (parse_sum t p pc) (dsnd (pc k)) (clens_sum_payload t k) sl /\
gaccessor_pre (parse_sum t p pc) (dsnd (pc k)) (clens_sum_payload t k) sl' /\
injective_precond (parse_sum t p pc) sl sl'
))
(ensures (gaccessor_clens_sum_payload' t p pc k sl == gaccessor_clens_sum_payload' t p pc k sl'))
= parse_sum_eq'' t p pc sl;
parse_sum_eq'' t p pc sl' ;
parse_injective (parse_sum t p pc) sl sl' ;
parse_injective p sl sl'
#pop-options
let gaccessor_clens_sum_payload_no_lookahead
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
(sl sl' : bytes)
: Lemma
(requires (
(parse_sum_kind kt t pc).parser_kind_subkind == Some ParserStrong /\
gaccessor_pre (parse_sum t p pc) (dsnd (pc k)) (clens_sum_payload t k) sl /\
gaccessor_pre (parse_sum t p pc) (dsnd (pc k)) (clens_sum_payload t k) sl' /\
no_lookahead_on_precond (parse_sum t p pc) sl sl'
))
(ensures (gaccessor_clens_sum_payload' t p pc k sl == gaccessor_clens_sum_payload' t p pc k sl'))
= parse_sum_eq'' t p pc sl;
parse_sum_eq'' t p pc sl' ;
parse_strong_prefix (parse_sum t p pc) sl sl' ;
parse_injective p sl sl'
let gaccessor_clens_sum_payload
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (gaccessor (parse_sum t p pc) (dsnd (pc k)) (clens_sum_payload t k))
= Classical.forall_intro_2 (fun x -> Classical.move_requires (gaccessor_clens_sum_payload_injective t p pc k x));
Classical.forall_intro_2 (fun x -> Classical.move_requires (gaccessor_clens_sum_payload_no_lookahead t p pc k x));
gaccessor_prop_equiv (parse_sum t p pc) (dsnd (pc k)) (clens_sum_payload t k) (gaccessor_clens_sum_payload' t p pc k);
gaccessor_clens_sum_payload' t p pc k
inline_for_extraction
let accessor_clens_sum_payload'
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(j: jumper p)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: HST.Stack U32.t
(requires (fun h ->
valid (parse_sum t p pc) h input pos /\
(clens_sum_payload t k).clens_cond (contents (parse_sum t p pc) h input pos)
))
(ensures (fun h pos' h' ->
B.modifies B.loc_none h h' /\
pos' == slice_access h (gaccessor_clens_sum_payload t p pc k) input pos
))
=
let h = HST.get () in
[@inline_let]
let _ =
let pos' = get_valid_pos (parse_sum t p pc) h input pos in
let large = bytes_of_slice_from h input pos in
slice_access_eq h (gaccessor_clens_sum_payload t p pc k) input pos;
valid_facts (parse_sum t p pc) h input pos;
parse_sum_eq'' t p pc large;
valid_facts p h input pos
in
j input pos
#pop-options
inline_for_extraction
let accessor_clens_sum_payload
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(j: jumper p)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (accessor (gaccessor_clens_sum_payload t p pc k))
= fun #rrel #rel -> accessor_clens_sum_payload' t j pc k #rrel #rel
let clens_sum_cases_payload
(s: sum)
(k: sum_key s)
: Tot (clens (sum_cases s k) (sum_type_of_tag s k))
= {
clens_cond = (fun (x: sum_cases s k) -> True);
clens_get = (fun (x: sum_cases s k) -> synth_sum_case_recip s k x <: Ghost (sum_type_of_tag s k) (requires (True)) (ensures (fun _ -> True)));
}
let gaccessor_clens_sum_cases_payload
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (gaccessor (parse_sum_cases' t pc k) (dsnd (pc k)) (clens_sum_cases_payload t k))
= synth_sum_case_injective t k;
synth_sum_case_inverse t k;
synth_injective_synth_inverse_synth_inverse_recip (synth_sum_case t k) (synth_sum_case_recip t k) ();
gaccessor_ext
(gaccessor_synth (dsnd (pc k)) (synth_sum_case t k) (synth_sum_case_recip t k) ())
(clens_sum_cases_payload t k)
()
inline_for_extraction
let accessor_clens_sum_cases_payload
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (accessor (gaccessor_clens_sum_cases_payload t pc k))
= [@inline_let]
let _ =
synth_sum_case_injective t k;
synth_sum_case_inverse t k;
synth_injective_synth_inverse_synth_inverse_recip (synth_sum_case t k) (synth_sum_case_recip t k) ()
in
accessor_ext
(accessor_synth (dsnd (pc k)) (synth_sum_case t k) (synth_sum_case_recip t k) ())
(clens_sum_cases_payload t k)
()
inline_for_extraction
let validate_dsum_cases_t
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(#k: parser_kind)
(g: parser k (dsum_type_of_unknown_tag s))
(x: dsum_key s)
: Tot Type
= validator (parse_dsum_cases' s f g x)
let validate_dsum_cases_eq
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(#k: parser_kind)
(g: parser k (dsum_type_of_unknown_tag s))
(x: dsum_key s)
(v1 v2 : validate_dsum_cases_t s f g x)
: GTot Type0
= True
inline_for_extraction
let validate_dsum_cases_if'
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(#k: parser_kind)
(g: parser k (dsum_type_of_unknown_tag s))
(x: dsum_key s)
(cond: bool)
(ift: (cond_true cond -> Tot (validate_dsum_cases_t s f g x)))
(iff: (cond_false cond -> Tot (validate_dsum_cases_t s f g x)))
: Tot (validate_dsum_cases_t s f g x)
= fun #rrel #rel input len ->
if cond
then (ift () <: validate_dsum_cases_t s f g x) input len
else (iff () <: validate_dsum_cases_t s f g x) input len
inline_for_extraction
let validate_dsum_cases_if
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(#k: parser_kind)
(g: parser k (dsum_type_of_unknown_tag s))
(x: dsum_key s)
: Tot (if_combinator _ (validate_dsum_cases_eq s f g x))
= validate_dsum_cases_if' s f g x
inline_for_extraction
let validate_dsum_cases'
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(f' : (x: dsum_known_key s) -> Tot (validator (dsnd (f x))))
(#k: parser_kind)
(#g: parser k (dsum_type_of_unknown_tag s))
(g' : validator g)
(x: dsum_key s)
: Tot (validate_dsum_cases_t s f g x)
= [@inline_let]
let _ = synth_dsum_case_injective s x in
match x with
| Known x' -> validate_synth (f' x') (synth_dsum_case s (Known x')) () <: validator (parse_dsum_cases' s f g x)
| Unknown x' -> validate_synth g' (synth_dsum_case s (Unknown x')) () <: validator (parse_dsum_cases' s f g x)
inline_for_extraction
let validate_dsum_cases'_destr
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(f' : (x: dsum_known_key s) -> Tot (validator (dsnd (f x))))
(#k: parser_kind)
(#g: parser k (dsum_type_of_unknown_tag s))
(g' : validator g)
(destr: dep_enum_destr _ (fun k -> validate_dsum_cases_t s f g (Known k)))
(x: dsum_key s)
: Tot (validate_dsum_cases_t s f g x)
= fun #rrel #rel input pos ->
match x with
| Known k ->
destr
_
(fun k -> validate_dsum_cases_if s f g (Known k))
(fun _ _ -> ())
(fun _ _ _ _ -> ())
(fun k -> validate_dsum_cases' s f f' g' (Known k))
k
input
pos
| Unknown r -> validate_dsum_cases' s f f' g' (Unknown r) input pos
inline_for_extraction
let validate_dsum_cases
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(f' : (x: dsum_known_key s) -> Tot (validator (dsnd (f x))))
(#k: parser_kind)
(#g: parser k (dsum_type_of_unknown_tag s))
(g' : validator g)
(destr: dep_enum_destr _ (fun k -> validate_dsum_cases_t s f g (Known k)))
(x: dsum_key s)
: Tot (validator (parse_dsum_cases s f g x))
= fun #rrel #rel input pos ->
let h = HST.get () in
[@inline_let]
let _ =
valid_facts (parse_dsum_cases' s f g x) h input (uint64_to_uint32 pos);
valid_facts (parse_dsum_cases s f g x) h input (uint64_to_uint32 pos);
parse_dsum_cases_eq' s f g x (bytes_of_slice_from h input (uint64_to_uint32 pos))
in
validate_dsum_cases'_destr s f f' g' destr x input pos
#push-options "--z3rlimit 40"
inline_for_extraction
let validate_dsum
(#kt: parser_kind)
(t: dsum)
(#p: parser kt (dsum_repr_type t))
(v: validator p)
(p32: leaf_reader p)
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(f32: (x: dsum_known_key t) -> Tot (validator (dsnd (f x))))
(#k': parser_kind)
(#g: parser k' (dsum_type_of_unknown_tag t))
(g32: validator g)
(destr: dep_maybe_enum_destr_t (dsum_enum t) (validate_dsum_cases_t t f g))
: Tot (validator (parse_dsum t p f g))
= fun #rrel #rel input pos ->
let h = HST.get () in
[@inline_let]
let _ = parse_dsum_eq' t p f g (bytes_of_slice_from h input (uint64_to_uint32 pos)) in
[@inline_let]
let _ = valid_facts (parse_dsum t p f g) h input (uint64_to_uint32 pos) in
[@inline_let]
let _ = valid_facts p h input (uint64_to_uint32 pos) in
let pos_after_tag = v input pos in
if is_error pos_after_tag
then pos_after_tag
else
let tg = p32 input (uint64_to_uint32 pos) in
[@inline_let]
let _ = valid_facts (parse_dsum_cases' t f g (maybe_enum_key_of_repr (dsum_enum t) tg)) h input (uint64_to_uint32 pos_after_tag) in
destr (validate_dsum_cases_eq t f g) (validate_dsum_cases_if t f g) (fun _ _ -> ()) (fun _ _ _ _ -> ()) (validate_dsum_cases' t f f32 g32) tg input pos_after_tag
#pop-options
#reset-options "--z3rlimit 64 --z3cliopt smt.arith.nl=false --initial_ifuel 8 --max_ifuel 8 --initial_fuel 2 --max_fuel 2"
let valid_dsum_intro_known
(h: HS.mem)
(t: dsum)
(#kt: parser_kind)
(p: parser kt (dsum_repr_type t))
(f: ((x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x))))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: Lemma
(requires (
valid (parse_maybe_enum_key p (dsum_enum t)) h input pos /\ (
let k' = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
Known? k' /\ (
let Known k = k' in
valid (dsnd (f k)) h input (get_valid_pos (parse_maybe_enum_key p (dsum_enum t)) h input pos)
))))
(ensures (
let Known k = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
let pos_payload = get_valid_pos (parse_maybe_enum_key p (dsum_enum t)) h input pos in
valid_content_pos
(parse_dsum t p f g) h input pos
(synth_dsum_case t (Known k) (contents (dsnd (f k)) h input pos_payload))
(get_valid_pos (dsnd (f k)) h input pos_payload)
))
= valid_facts (parse_maybe_enum_key p (dsum_enum t)) h input pos;
let Known k = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
let pos_payload = get_valid_pos (parse_maybe_enum_key p (dsum_enum t)) h input pos in
valid_facts (dsnd (f k)) h input pos_payload;
valid_facts (parse_dsum t p f g) h input pos;
parse_dsum_eq t p f g (bytes_of_slice_from h input pos)
let valid_dsum_intro_unknown
(h: HS.mem)
(t: dsum)
(#kt: parser_kind)
(p: parser kt (dsum_repr_type t))
(f: ((x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x))))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: Lemma
(requires (
valid (parse_maybe_enum_key p (dsum_enum t)) h input pos /\ (
let k' = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
Unknown? k' /\
valid g h input (get_valid_pos (parse_maybe_enum_key p (dsum_enum t)) h input pos)
)))
(ensures (
let Unknown r = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
let pos_payload = get_valid_pos (parse_maybe_enum_key p (dsum_enum t)) h input pos in
valid_content_pos
(parse_dsum t p f g) h input pos
(synth_dsum_case t (Unknown r) (contents g h input pos_payload))
(get_valid_pos g h input pos_payload)
))
= valid_facts (parse_maybe_enum_key p (dsum_enum t)) h input pos;
let Unknown r = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
let pos_payload = get_valid_pos (parse_maybe_enum_key p (dsum_enum t)) h input pos in
valid_facts g h input pos_payload;
valid_facts (parse_dsum t p f g) h input pos;
parse_dsum_eq t p f g (bytes_of_slice_from h input pos)
#reset-options
inline_for_extraction
let finalize_dsum_case_known
(t: dsum)
(#kt: parser_kind)
(#p: parser kt (dsum_repr_type t))
(s: serializer p)
(w: leaf_writer_strong s)
(f: ((x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x))))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
(destr: enum_repr_of_key'_t (dsum_enum t))
(k: dsum_known_key t)
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: HST.Stack unit
(requires (fun h ->
let len_tag = serialized_length (serialize_enum_key _ s (dsum_enum t)) k in
U32.v pos + len_tag < 4294967296 /\ (
let pos_payload = pos `U32.add` U32.uint_to_t len_tag in
valid (dsnd (f k)) h input pos_payload /\
writable input.base (U32.v pos) (U32.v pos_payload) h
)))
(ensures (fun h _ h' ->
let len_tag = serialized_length (serialize_enum_key _ s (dsum_enum t)) k in
let pos_payload = pos `U32.add` U32.uint_to_t len_tag in
B.modifies (loc_slice_from_to input pos pos_payload) h h' /\
valid_content_pos (parse_dsum t p f g) h' input pos (synth_dsum_case t (Known k) (contents (dsnd (f k)) h input pos_payload)) (get_valid_pos (dsnd (f k)) h input pos_payload)
))
= let pos1 = write_enum_key w (dsum_enum t) destr k input pos in
let h = HST.get () in
[@inline_let]
let _ =
valid_facts (parse_enum_key p (dsum_enum t)) h input pos;
valid_facts (parse_maybe_enum_key p (dsum_enum t)) h input pos;
let sq = bytes_of_slice_from h input pos in
parse_enum_key_eq p (dsum_enum t) sq;
parse_maybe_enum_key_eq p (dsum_enum t) sq;
valid_dsum_intro_known h t p f g input pos
in
()
inline_for_extraction
let finalize_dsum_case_unknown
(t: dsum)
(#kt: parser_kind)
(#p: parser kt (dsum_repr_type t))
(s: serializer p)
(w: leaf_writer_strong s)
(f: ((x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x))))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
(r: unknown_enum_repr (dsum_enum t))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: HST.Stack unit
(requires (fun h ->
let len_tag = serialized_length s r in
U32.v pos + len_tag < 4294967296 /\ (
let pos_payload = pos `U32.add` U32.uint_to_t len_tag in
valid g h input pos_payload /\
writable input.base (U32.v pos) (U32.v pos_payload) h
)))
(ensures (fun h _ h' ->
let len_tag = serialized_length s r in
let pos_payload = pos `U32.add` U32.uint_to_t len_tag in
B.modifies (loc_slice_from_to input pos pos_payload) h h' /\
valid_content_pos (parse_dsum t p f g) h' input pos (synth_dsum_case t (Unknown r) (contents g h input pos_payload)) (get_valid_pos g h input pos_payload)
))
= let pos1 = w r input pos in
let h = HST.get () in
[@inline_let]
let _ =
valid_facts (parse_maybe_enum_key p (dsum_enum t)) h input pos;
valid_facts p h input pos;
let sq = bytes_of_slice_from h input pos in
parse_maybe_enum_key_eq p (dsum_enum t) sq;
valid_dsum_intro_unknown h t p f g input pos
in
()
let valid_dsum_elim_tag
(h: HS.mem)
(t: dsum)
(#kt: parser_kind)
(p: parser kt (dsum_repr_type t))
(f: ((x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x))))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: Lemma
(requires (
valid (parse_dsum t p f g) h input pos
))
(ensures (
valid (parse_maybe_enum_key p (dsum_enum t)) h input pos /\
contents (parse_maybe_enum_key p (dsum_enum t)) h input pos == dsum_tag_of_data t (contents (parse_dsum t p f g) h input pos)
))
= let _ = parse_dsum_eq_ t p f g (bytes_of_slice_from h input pos) in
let _ = valid_facts (parse_dsum t p f g) h input pos in
let _ = valid_facts (parse_maybe_enum_key p (dsum_enum t)) h input pos in
()
inline_for_extraction
let read_dsum_tag
(t: dsum)
(#kt: parser_kind)
(#p: parser kt (dsum_repr_type t))
(p32: leaf_reader p)
(destr: maybe_enum_destr_t (maybe_enum_key (dsum_enum t)) (dsum_enum t))
(f: ((x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x))))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: HST.Stack (dsum_key t)
(requires (fun h ->
valid (parse_dsum t p f g) h input pos
))
(ensures (fun h res h' ->
B.modifies B.loc_none h h' /\
res == dsum_tag_of_data t (contents (parse_dsum t p f g) h input pos)
))
= let h = HST.get () in
[@inline_let] let _ = valid_dsum_elim_tag h t p f g input pos in
read_maybe_enum_key p32 (dsum_enum t) destr input pos
#push-options "--z3rlimit 32"
let valid_dsum_elim_known
(h: HS.mem)
(t: dsum)
(#kt: parser_kind)
(p: parser kt (dsum_repr_type t))
(f: ((x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x))))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: Lemma
(requires (
valid (parse_dsum t p f g) h input pos /\
Known? (dsum_tag_of_data t (contents (parse_dsum t p f g) h input pos))
))
(ensures (
valid (parse_maybe_enum_key p (dsum_enum t)) h input pos /\ (
let k' = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
let pos_payload = get_valid_pos (parse_maybe_enum_key p (dsum_enum t)) h input pos in
Known? k' /\ (
let Known k = k' in
valid (dsnd (f k)) h input pos_payload /\
valid_content_pos
(parse_dsum t p f g) h input pos
(synth_dsum_case t (Known k) (contents (dsnd (f k)) h input pos_payload))
(get_valid_pos (dsnd (f k)) h input pos_payload)
))))
=
valid_facts (parse_dsum t p f g) h input pos;
parse_dsum_eq t p f g (bytes_of_slice_from h input pos);
valid_facts (parse_maybe_enum_key p (dsum_enum t)) h input pos;
let Known k = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
let pos_payload = get_valid_pos (parse_maybe_enum_key p (dsum_enum t)) h input pos in
valid_facts (dsnd (f k)) h input pos_payload
#pop-options
let valid_dsum_elim_unknown
(h: HS.mem)
(t: dsum)
(#kt: parser_kind)
(p: parser kt (dsum_repr_type t))
(f: ((x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x))))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: Lemma
(requires (
valid (parse_dsum t p f g) h input pos /\
Unknown? (dsum_tag_of_data t (contents (parse_dsum t p f g) h input pos))
))
(ensures (
valid (parse_maybe_enum_key p (dsum_enum t)) h input pos /\ (
let k' = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
let pos_payload = get_valid_pos (parse_maybe_enum_key p (dsum_enum t)) h input pos in
Unknown? k' /\ (
let Unknown r = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
valid g h input pos_payload /\
valid_content_pos
(parse_dsum t p f g) h input pos
(synth_dsum_case t (Unknown r) (contents g h input pos_payload))
(get_valid_pos g h input pos_payload)
))))
=
valid_facts (parse_dsum t p f g) h input pos;
parse_dsum_eq t p f g (bytes_of_slice_from h input pos);
valid_facts (parse_maybe_enum_key p (dsum_enum t)) h input pos;
let Unknown r = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
let pos_payload = get_valid_pos (parse_maybe_enum_key p (dsum_enum t)) h input pos in
valid_facts g h input pos_payload
inline_for_extraction
let jump_dsum_cases_t
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(#k: parser_kind)
(g: parser k (dsum_type_of_unknown_tag s))
(x: dsum_key s)
: Tot Type
= jumper (parse_dsum_cases' s f g x)
let jump_dsum_cases_eq
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(#k: parser_kind)
(g: parser k (dsum_type_of_unknown_tag s))
(x: dsum_key s)
(v1 v2 : jump_dsum_cases_t s f g x)
: GTot Type0
= True
inline_for_extraction
let jump_dsum_cases_if'
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(#k: parser_kind)
(g: parser k (dsum_type_of_unknown_tag s))
(x: dsum_key s)
(cond: bool)
(ift: (cond_true cond -> Tot (jump_dsum_cases_t s f g x)))
(iff: (cond_false cond -> Tot (jump_dsum_cases_t s f g x)))
: Tot (jump_dsum_cases_t s f g x)
= fun #rrel #rel input len ->
if cond
then (ift () <: jump_dsum_cases_t s f g x) input len
else (iff () <: jump_dsum_cases_t s f g x) input len
inline_for_extraction
let jump_dsum_cases_if
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(#k: parser_kind)
(g: parser k (dsum_type_of_unknown_tag s))
(x: dsum_key s)
: Tot (if_combinator _ (jump_dsum_cases_eq s f g x))
= jump_dsum_cases_if' s f g x
inline_for_extraction
let jump_dsum_cases'
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(f' : (x: dsum_known_key s) -> Tot (jumper (dsnd (f x))))
(#k: parser_kind)
(#g: parser k (dsum_type_of_unknown_tag s))
(g' : jumper g)
(x: dsum_key s)
: Tot (jump_dsum_cases_t s f g x)
= synth_dsum_case_injective s x;
match x with
| Known x' -> jump_synth (f' x') (synth_dsum_case s (Known x')) () <: jumper (parse_dsum_cases' s f g x)
| Unknown x' -> jump_synth g' (synth_dsum_case s (Unknown x')) () <: jumper (parse_dsum_cases' s f g x)
inline_for_extraction
let jump_dsum_cases'_destr
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(f' : (x: dsum_known_key s) -> Tot (jumper (dsnd (f x))))
(#k: parser_kind)
(#g: parser k (dsum_type_of_unknown_tag s))
(g' : jumper g)
(destr: dep_enum_destr _ (fun k -> jump_dsum_cases_t s f g (Known k)))
(x: dsum_key s)
: Tot (jump_dsum_cases_t s f g x)
= fun #rrel #rel input pos ->
match x with
| Known k ->
destr
_
(fun k -> jump_dsum_cases_if s f g (Known k))
(fun _ _ -> ())
(fun _ _ _ _ -> ())
(fun k -> jump_dsum_cases' s f f' g' (Known k))
k
input
pos
| Unknown r -> jump_dsum_cases' s f f' g' (Unknown r) input pos
inline_for_extraction
let jump_dsum_cases
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(f' : (x: dsum_known_key s) -> Tot (jumper (dsnd (f x))))
(#k: parser_kind)
(#g: parser k (dsum_type_of_unknown_tag s))
(g' : jumper g)
(destr: dep_enum_destr _ (fun k -> jump_dsum_cases_t s f g (Known k)))
(x: dsum_key s)
: Tot (jumper (parse_dsum_cases s f g x))
= fun #rrel #rel input pos ->
let h = HST.get () in
[@inline_let]
let _ =
valid_facts (parse_dsum_cases' s f g x) h input pos;
valid_facts (parse_dsum_cases s f g x) h input pos;
parse_dsum_cases_eq' s f g x (bytes_of_slice_from h input pos)
in
jump_dsum_cases'_destr s f f' g' destr x input pos
#push-options "--z3rlimit 16"
inline_for_extraction
let jump_dsum
(#kt: parser_kind)
(t: dsum)
(#p: parser kt (dsum_repr_type t))
(v: jumper p)
(p32: leaf_reader p)
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(f32: (x: dsum_known_key t) -> Tot (jumper (dsnd (f x))))
(#k': parser_kind)
(#g: parser k' (dsum_type_of_unknown_tag t))
(g32: jumper g)
(destr: dep_maybe_enum_destr_t (dsum_enum t) (jump_dsum_cases_t t f g))
: Tot (jumper (parse_dsum t p f g))
= fun #rrel #rel input pos ->
let h = HST.get () in
[@inline_let]
let _ = parse_dsum_eq' t p f g (bytes_of_slice_from h input pos) in
[@inline_let]
let _ = valid_facts (parse_dsum t p f g) h input pos in
[@inline_let]
let _ = valid_facts p h input pos in
let pos_after_tag = v input pos in
let tg = p32 input pos in
[@inline_let]
let _ = valid_facts (parse_dsum_cases' t f g (maybe_enum_key_of_repr (dsum_enum t) tg)) h input pos_after_tag in
destr (jump_dsum_cases_eq t f g) (jump_dsum_cases_if t f g) (fun _ _ -> ()) (fun _ _ _ _ -> ()) (jump_dsum_cases' t f f32 g32) tg input pos_after_tag
#pop-options
inline_for_extraction
let read_dsum_cases'
(t: dsum)
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(f32: (x: dsum_known_key t) -> Tot (leaf_reader (dsnd (f x))))
(#k': parser_kind)
(g: parser k' (dsum_type_of_unknown_tag t))
(g32: leaf_reader g)
(x: dsum_key t)
: Tot (leaf_reader (parse_dsum_cases' t f g x))
= fun #rrel #rel input pos ->
[@inline_let]
let _ = synth_dsum_case_injective t x in
match x with
| Known x' ->
read_synth'
(dsnd (f x'))
(synth_dsum_case t (Known x'))
(f32 x')
()
input
pos
| Unknown x' ->
read_synth'
g
(synth_dsum_case t (Unknown x'))
g32
()
input
pos
inline_for_extraction
let read_dsum_cases_t
(t: dsum)
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(#k': parser_kind)
(g: parser k' (dsum_type_of_unknown_tag t))
(k: dsum_known_key t)
: Tot Type
= leaf_reader (parse_dsum_cases' t f g (Known k)) | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"LowStar.Buffer.fst.checked",
"LowParse.Spec.Sum.fst.checked",
"LowParse.Low.Enum.fst.checked",
"FStar.UInt64.fsti.checked",
"FStar.UInt32.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Int.Cast.fst.checked",
"FStar.HyperStack.ST.fsti.checked",
"FStar.HyperStack.fst.checked",
"FStar.Classical.fsti.checked"
],
"interface_file": false,
"source_file": "LowParse.Low.Sum.fst"
} | [
{
"abbrev": true,
"full_module": "FStar.HyperStack",
"short_module": "HS"
},
{
"abbrev": true,
"full_module": "FStar.UInt64",
"short_module": "U64"
},
{
"abbrev": true,
"full_module": "FStar.Int.Cast",
"short_module": "Cast"
},
{
"abbrev": true,
"full_module": "LowStar.Buffer",
"short_module": "B"
},
{
"abbrev": true,
"full_module": "FStar.HyperStack.ST",
"short_module": "HST"
},
{
"abbrev": true,
"full_module": "FStar.UInt32",
"short_module": "U32"
},
{
"abbrev": false,
"full_module": "LowParse.Spec.Sum",
"short_module": null
},
{
"abbrev": false,
"full_module": "LowParse.Low.Enum",
"short_module": null
},
{
"abbrev": false,
"full_module": "LowParse.Low",
"short_module": null
},
{
"abbrev": false,
"full_module": "LowParse.Low",
"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",
"short_module": null
}
] | {
"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_elim_box": false,
"smtencoding_l_arith_repr": "boxwrap",
"smtencoding_nl_arith_repr": "boxwrap",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": true,
"z3cliopt": [],
"z3refresh": false,
"z3rlimit": 5,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | false |
t: LowParse.Spec.Sum.dsum ->
f:
(x: LowParse.Spec.Sum.dsum_known_key t
-> Prims.dtuple2 LowParse.Spec.Base.parser_kind
(fun k -> LowParse.Spec.Base.parser k (LowParse.Spec.Sum.dsum_type_of_known_tag t x))) ->
g: LowParse.Spec.Base.parser k' (LowParse.Spec.Sum.dsum_type_of_unknown_tag t) ->
k: LowParse.Spec.Sum.dsum_known_key t ->
x: LowParse.Low.Sum.read_dsum_cases_t t f g k ->
y: LowParse.Low.Sum.read_dsum_cases_t t f g k
-> Prims.GTot Type0 | Prims.GTot | [
"sometrivial"
] | [] | [
"LowParse.Spec.Sum.dsum",
"LowParse.Spec.Sum.dsum_known_key",
"Prims.dtuple2",
"LowParse.Spec.Base.parser_kind",
"LowParse.Spec.Base.parser",
"LowParse.Spec.Sum.dsum_type_of_known_tag",
"LowParse.Spec.Sum.dsum_type_of_unknown_tag",
"LowParse.Low.Sum.read_dsum_cases_t",
"Prims.l_True"
] | [] | false | false | false | false | true | let read_dsum_cases_t_eq
(t: dsum)
(f: (x: dsum_known_key t -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x))))
(#k': parser_kind)
(g: parser k' (dsum_type_of_unknown_tag t))
(k: dsum_known_key t)
(x y: read_dsum_cases_t t f g k)
: GTot Type0 =
| True | false |
LowParse.Low.Sum.fst | LowParse.Low.Sum.validate_dsum_cases' | val validate_dsum_cases'
(s: dsum)
(f: (x: dsum_known_key s -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x))))
(f': (x: dsum_known_key s -> Tot (validator (dsnd (f x)))))
(#k: parser_kind)
(#g: parser k (dsum_type_of_unknown_tag s))
(g': validator g)
(x: dsum_key s)
: Tot (validate_dsum_cases_t s f g x) | val validate_dsum_cases'
(s: dsum)
(f: (x: dsum_known_key s -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x))))
(f': (x: dsum_known_key s -> Tot (validator (dsnd (f x)))))
(#k: parser_kind)
(#g: parser k (dsum_type_of_unknown_tag s))
(g': validator g)
(x: dsum_key s)
: Tot (validate_dsum_cases_t s f g x) | let validate_dsum_cases'
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(f' : (x: dsum_known_key s) -> Tot (validator (dsnd (f x))))
(#k: parser_kind)
(#g: parser k (dsum_type_of_unknown_tag s))
(g' : validator g)
(x: dsum_key s)
: Tot (validate_dsum_cases_t s f g x)
= [@inline_let]
let _ = synth_dsum_case_injective s x in
match x with
| Known x' -> validate_synth (f' x') (synth_dsum_case s (Known x')) () <: validator (parse_dsum_cases' s f g x)
| Unknown x' -> validate_synth g' (synth_dsum_case s (Unknown x')) () <: validator (parse_dsum_cases' s f g x) | {
"file_name": "src/lowparse/LowParse.Low.Sum.fst",
"git_rev": "00217c4a89f5ba56002ba9aa5b4a9d5903bfe9fa",
"git_url": "https://github.com/project-everest/everparse.git",
"project_name": "everparse"
} | {
"end_col": 112,
"end_line": 1016,
"start_col": 0,
"start_line": 1003
} | module LowParse.Low.Sum
include LowParse.Low.Enum
include LowParse.Spec.Sum
module U32 = FStar.UInt32
module HST = FStar.HyperStack.ST
module B = LowStar.Buffer
module Cast = FStar.Int.Cast
module U64 = FStar.UInt64
inline_for_extraction
let validate_sum_cases_aux
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(vc: ((x: sum_key t) -> Tot (validator (dsnd (pc x)))))
(k: sum_key t)
: Tot (validator (parse_sum_cases t pc k))
= [@inline_let]
let _ = synth_sum_case_injective t k in
validate_synth
(validate_weaken
(weaken_parse_cases_kind t pc)
(vc k)
()
)
(synth_sum_case t k)
()
inline_for_extraction
let validate_sum_cases_t
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot Type
= validator (parse_sum_cases t pc k)
let validate_sum_cases_t_eq
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
(x y : validate_sum_cases_t t pc k)
: GTot Type0
= True
inline_for_extraction
let validate_sum_cases_t_if
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (if_combinator _ (validate_sum_cases_t_eq t pc k))
= fun cond (sv_true: cond_true cond -> Tot (validate_sum_cases_t t pc k)) (sv_false: cond_false cond -> Tot (validate_sum_cases_t t pc k)) #rrel #rel input pos ->
if cond
then sv_true () input pos
else sv_false () input pos
inline_for_extraction
let validate_sum_cases
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(vc: ((x: sum_key t) -> Tot (validator (dsnd (pc x)))))
(destr: dep_enum_destr (sum_enum t) (validate_sum_cases_t t pc))
(k: sum_key t)
: Tot (validator (parse_sum_cases t pc k))
= destr
_
(validate_sum_cases_t_if t pc)
(fun _ _ -> ())
(fun _ _ _ _ -> ())
(validate_sum_cases_aux t pc vc)
k
inline_for_extraction
let validate_sum_aux_payload_t
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
: Tot Type
= (#rrel: _) -> (#rel: _) ->
(input: slice rrel rel) ->
(pos: U64.t) ->
HST.Stack U64.t
(requires (fun h -> live_slice h input /\ U64.v pos <= U32.v input.len))
(ensures (fun h res h' ->
B.modifies B.loc_none h h' /\ (
match k with
| Unknown _ -> is_error res
| Known k' ->
if is_success res
then
valid_pos (dsnd (pc k')) h input (uint64_to_uint32 pos) (uint64_to_uint32 res)
else
(~ (valid (dsnd (pc k')) h input (uint64_to_uint32 pos)))
)))
let validate_sum_aux_payload_eq
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
: Tot (validate_sum_aux_payload_t t pc k -> validate_sum_aux_payload_t t pc k -> GTot Type0)
= fun _ _ -> True
inline_for_extraction
let validate_sum_aux_payload_if'
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
(cond: bool)
(ift: ((cond_true cond) -> Tot (validate_sum_aux_payload_t t pc k)))
(iff: ((cond_false cond) -> Tot (validate_sum_aux_payload_t t pc k)))
: Tot (validate_sum_aux_payload_t t pc k)
= fun #rrel #rel input pos ->
if cond
then begin
(ift () <: validate_sum_aux_payload_t t pc k) input pos
end else
(iff () <: validate_sum_aux_payload_t t pc k) input pos
inline_for_extraction
let validate_sum_aux_payload_if
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
: Tot (if_combinator _ (validate_sum_aux_payload_eq t pc k))
= validate_sum_aux_payload_if' t pc k
#push-options "--z3rlimit 64 --z3cliopt smt.arith.nl=false --using_facts_from '* -FStar.Int.Cast -LowParse.BitFields'"
// --query_stats --smtencoding.elim_box true --smtencoding.l_arith_repr native --z3refresh"
inline_for_extraction
let validate_sum_aux
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(v: validator p)
(p32: leaf_reader p)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(v_payload: ((k: sum_repr_type t)) -> Tot (validate_sum_aux_payload_t t pc (maybe_enum_key_of_repr (sum_enum t) k)))
: Tot (validator (parse_sum t p pc))
= fun #rrel #rel input pos ->
let h = HST.get () in
[@inline_let]
let _ = parse_sum_eq'' t p pc (bytes_of_slice_from h input (uint64_to_uint32 pos)) in
[@inline_let]
let _ = valid_facts (parse_sum t p pc) h input (uint64_to_uint32 pos) in
[@inline_let]
let _ = valid_facts p h input (uint64_to_uint32 pos) in
let len_after_tag = v input pos in
if is_error len_after_tag
then len_after_tag
else begin
let h1 = HST.get () in
let k' = p32 input (uint64_to_uint32 pos) in
[@inline_let]
let _ =
match maybe_enum_key_of_repr (sum_enum t) k' with
| Known k -> valid_facts (dsnd (pc k)) h input (uint64_to_uint32 len_after_tag)
| _ -> ()
in
v_payload k' input len_after_tag
end
#pop-options
inline_for_extraction
let validate_sum_aux_payload'
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (validator (dsnd (pc x)))))
(k: maybe_enum_key (sum_enum t))
: Tot (validate_sum_aux_payload_t t pc k)
= fun #rrel #rel input pos ->
match k with
| Known k ->
[@inline_let]
let _ = synth_sum_case_injective t k in
pc32 k input pos
// validate_synth (pc32 k) (synth_sum_case t k) () input pos
| _ -> validator_error_generic
inline_for_extraction
let validate_sum_aux_payload
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (validator (dsnd (pc x)))))
(destr: dep_maybe_enum_destr_t (sum_enum t) (validate_sum_aux_payload_t t pc))
(k: sum_repr_type t)
: Tot (validate_sum_aux_payload_t t pc (maybe_enum_key_of_repr (sum_enum t) k))
= destr (validate_sum_aux_payload_eq t pc) (validate_sum_aux_payload_if t pc) (fun _ _ -> ()) (fun _ _ _ _ -> ()) (validate_sum_aux_payload' t pc pc32) k
inline_for_extraction
let validate_sum
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(v: validator p)
(p32: leaf_reader p)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (validator (dsnd (pc x)))))
(destr: dep_maybe_enum_destr_t (sum_enum t) (validate_sum_aux_payload_t t pc))
: Tot (validator (parse_sum t p pc))
= validate_sum_aux t v p32 pc (validate_sum_aux_payload t pc pc32 destr)
module HS = FStar.HyperStack
#push-options "--z3rlimit 256 --z3cliopt smt.arith.nl=false --initial_ifuel 8 --max_ifuel 8 --initial_fuel 2 --max_fuel 2"
#restart-solver
let valid_sum_intro
(h: HS.mem)
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: Lemma
(requires (
valid (parse_enum_key p (sum_enum t)) h input pos /\ (
let k = contents (parse_enum_key p (sum_enum t)) h input pos in
valid (dsnd (pc k)) h input (get_valid_pos (parse_enum_key p (sum_enum t)) h input pos)
)))
(ensures (
let k = contents (parse_enum_key p (sum_enum t)) h input pos in
let pos_payload = get_valid_pos (parse_enum_key p (sum_enum t)) h input pos in
valid_content_pos
(parse_sum t p pc) h input pos
(synth_sum_case t k (contents (dsnd (pc k)) h input pos_payload))
(get_valid_pos (dsnd (pc k)) h input pos_payload)
))
= valid_facts (parse_enum_key p (sum_enum t)) h input pos;
let k = contents (parse_enum_key p (sum_enum t)) h input pos in
let pos_payload = get_valid_pos (parse_enum_key p (sum_enum t)) h input pos in
valid_facts (dsnd (pc k)) h input pos_payload;
valid_facts (parse_sum t p pc) h input pos;
parse_sum_eq t p pc (bytes_of_slice_from h input pos)
#pop-options
inline_for_extraction
let finalize_sum_case
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(s: serializer p)
(w: leaf_writer_strong s)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(destr: enum_repr_of_key'_t (sum_enum t))
(k: sum_key t)
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: HST.Stack unit
(requires (fun h ->
let len_tag = serialized_length (serialize_enum_key _ s (sum_enum t)) k in
U32.v pos + len_tag < 4294967296 /\ (
let pos_payload = pos `U32.add` U32.uint_to_t len_tag in
valid (dsnd (pc k)) h input pos_payload /\
writable input.base (U32.v pos) (U32.v pos_payload) h
)))
(ensures (fun h _ h' ->
let len_tag = serialized_length (serialize_enum_key _ s (sum_enum t)) k in
let pos_payload = pos `U32.add` U32.uint_to_t len_tag in
B.modifies (loc_slice_from_to input pos pos_payload) h h' /\
valid_content_pos (parse_sum t p pc) h' input pos (synth_sum_case t k (contents (dsnd (pc k)) h input pos_payload)) (get_valid_pos (dsnd (pc k)) h input pos_payload)
))
= let pos1 = write_enum_key w (sum_enum t) destr k input pos in
let h = HST.get () in
[@inline_let]
let _ = valid_sum_intro h t p pc input pos in
()
inline_for_extraction
let jump_sum_cases_aux
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(vc: ((x: sum_key t) -> Tot (jumper (dsnd (pc x)))))
(k: sum_key t)
: Tot (jumper (parse_sum_cases t pc k))
= [@inline_let]
let _ = synth_sum_case_injective t k in
jump_synth
(jump_weaken
(weaken_parse_cases_kind t pc)
(vc k)
()
)
(synth_sum_case t k)
()
inline_for_extraction
let jump_sum_cases_t
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot Type
= jumper (parse_sum_cases t pc k)
let jump_sum_cases_t_eq
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
(x y : jump_sum_cases_t t pc k)
: GTot Type0
= True
inline_for_extraction
let jump_sum_cases_t_if
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (if_combinator _ (jump_sum_cases_t_eq t pc k))
= fun cond (sv_true: cond_true cond -> Tot (jump_sum_cases_t t pc k)) (sv_false: cond_false cond -> Tot (jump_sum_cases_t t pc k)) #rrel #rel input pos ->
if cond
then sv_true () input pos
else sv_false () input pos
inline_for_extraction
let jump_sum_cases
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(vc: ((x: sum_key t) -> Tot (jumper (dsnd (pc x)))))
(destr: dep_enum_destr (sum_enum t) (jump_sum_cases_t t pc))
(k: sum_key t)
: Tot (jumper (parse_sum_cases t pc k))
= destr
_
(jump_sum_cases_t_if t pc)
(fun _ _ -> ())
(fun _ _ _ _ -> ())
(jump_sum_cases_aux t pc vc)
k
inline_for_extraction
let jump_sum_aux_payload_t
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
: Tot Type
= (#rrel: _) -> (#rel: _) ->
(input: slice rrel rel) ->
(pos: U32.t) ->
HST.Stack U32.t
(requires (fun h -> live_slice h input /\ U32.v pos <= U32.v input.len /\ (
match k with
| Unknown _ -> False
| Known k' -> valid (dsnd (pc k')) h input pos
)))
(ensures (fun h res h' ->
B.modifies B.loc_none h h' /\ (
match k with
| Unknown _ -> False
| Known k' ->
valid_pos (dsnd (pc k')) h input pos res
)))
let jump_sum_aux_payload_eq
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
: Tot (jump_sum_aux_payload_t t pc k -> jump_sum_aux_payload_t t pc k -> GTot Type0)
= fun _ _ -> True
inline_for_extraction
let jump_sum_aux_payload_if'
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
(cond: bool)
(ift: ((cond_true cond) -> Tot (jump_sum_aux_payload_t t pc k)))
(iff: ((cond_false cond) -> Tot (jump_sum_aux_payload_t t pc k)))
: Tot (jump_sum_aux_payload_t t pc k)
= fun #rrel #rel input pos ->
if cond
then begin
(ift () <: jump_sum_aux_payload_t t pc k) input pos
end else
(iff () <: jump_sum_aux_payload_t t pc k) input pos
inline_for_extraction
let jump_sum_aux_payload_if
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
: Tot (if_combinator _ (jump_sum_aux_payload_eq t pc k))
= jump_sum_aux_payload_if' t pc k
let parse_sum_eq3
(#kt: parser_kind)
(t: sum)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(input: bytes)
(k' : sum_repr_type t)
(consumed_k: consumed_length input)
: Lemma
(requires (Some? (parse (parse_sum t p pc) input) /\ parse p input == Some (k', consumed_k)))
(ensures (
let input_k = Seq.slice input consumed_k (Seq.length input) in
let k = maybe_enum_key_of_repr (sum_enum t) k' in
begin match k with
| Known k ->
Some? (parse (dsnd (pc k)) input_k)
| _ -> False
end
))
= parse_sum_eq'' t p pc input
let parse_sum_eq4
(#kt: parser_kind)
(t: sum)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(input: bytes)
(k' : sum_repr_type t)
(consumed_k: consumed_length input)
(consumed_payload: nat)
: Lemma
(requires (Some? (parse (parse_sum t p pc) input) /\ parse p input == Some (k', consumed_k) /\ (
let input_k = Seq.slice input consumed_k (Seq.length input) in
let k = maybe_enum_key_of_repr (sum_enum t) k' in
begin match k with
| Known k ->
Some? (parse (dsnd (pc k)) input_k) /\ (
let Some (_, consumed_payload') = parse (dsnd (pc k)) input_k in
consumed_payload' == consumed_payload
)
| _ -> False
end
)))
(ensures (
let Some (_, consumed) = parse (parse_sum t p pc) input in
consumed == consumed_k + consumed_payload
))
= parse_sum_eq'' t p pc input
#push-options "--z3rlimit 16"
let valid_sum_elim
(h: HS.mem)
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(#rrel: _) (#rel: _)
(input: slice rrel rel)
(pos: U32.t)
: Lemma
(requires (
valid (parse_sum t p pc) h input pos
))
(ensures (
valid p h input pos /\ (
let pos_payload = get_valid_pos p h input pos in
let k' = maybe_enum_key_of_repr (sum_enum t) (contents p h input pos) in
match k' with
| Known k ->
k == sum_tag_of_data t (contents (parse_sum t p pc) h input pos) /\
valid (dsnd (pc k)) h input pos_payload /\
valid_pos
(parse_sum t p pc) h input pos
(get_valid_pos (dsnd (pc k)) h input pos_payload)
| _ -> False
)))
= let sinput = bytes_of_slice_from h input pos in
let _ = parse_sum_eq'' t p pc sinput in
[@inline_let]
let _ = valid_facts (parse_sum t p pc) h input pos in
let Some (k', consumed_k) = parse p sinput in
let pos_after_tag = U32.uint_to_t (U32.v pos + consumed_k) in
[@inline_let]
let _ = valid_facts p h input pos in
assert (valid_content_pos p h input pos k' pos_after_tag);
match maybe_enum_key_of_repr (sum_enum t) k' with
| Known k -> valid_facts (dsnd (pc k)) h input pos_after_tag
| _ -> ()
#pop-options
let valid_sum_elim_tag
(h: HS.mem)
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: Lemma
(requires (
valid (parse_sum t p pc) h input pos
))
(ensures (
valid (parse_enum_key p (sum_enum t)) h input pos /\
contents (parse_enum_key p (sum_enum t)) h input pos == sum_tag_of_data t (contents (parse_sum t p pc) h input pos)
))
= let _ = parse_sum_eq' t p pc (bytes_of_slice_from h input pos) in
let _ = valid_facts (parse_sum t p pc) h input pos in
let _ = valid_facts (parse_enum_key p (sum_enum t)) h input pos in
()
inline_for_extraction
let read_sum_tag
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(p32: leaf_reader p)
(destr: dep_maybe_enum_destr_t (sum_enum t) (read_enum_key_t (sum_enum t)))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: HST.Stack (sum_key t)
(requires (fun h ->
valid (parse_sum t p pc) h input pos
))
(ensures (fun h res h' ->
B.modifies B.loc_none h h' /\
res == sum_tag_of_data t (contents (parse_sum t p pc) h input pos)
))
= let h = HST.get () in
[@inline_let] let _ = valid_sum_elim_tag h t p pc input pos in
read_enum_key p32 (sum_enum t) destr input pos
inline_for_extraction
let jump_sum_aux
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(v: jumper p)
(p32: leaf_reader p)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(v_payload: ((k: sum_repr_type t)) -> Tot (jump_sum_aux_payload_t t pc (maybe_enum_key_of_repr (sum_enum t) k)))
: Tot (jumper (parse_sum t p pc))
= fun #rrel #rel input pos ->
let h = HST.get () in
[@inline_let]
let _ = valid_sum_elim h t p pc input pos in
let pos_after_tag = v input pos in
let k' = p32 input pos in
v_payload k' input pos_after_tag
inline_for_extraction
let jump_sum_aux_payload'
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (jumper (dsnd (pc x)))))
(k: maybe_enum_key (sum_enum t))
: Tot (jump_sum_aux_payload_t t pc k)
= fun #rrel #rel input pos ->
match k with
| Known k ->
[@inline_let]
let _ = synth_sum_case_injective t k in
pc32 k input pos
| _ -> 0ul // dummy, but we MUST NOT remove this branch, otherwise extraction fails
inline_for_extraction
let jump_sum_aux_payload
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (jumper (dsnd (pc x)))))
(destr: dep_maybe_enum_destr_t (sum_enum t) (jump_sum_aux_payload_t t pc))
(k: sum_repr_type t)
: Tot (jump_sum_aux_payload_t t pc (maybe_enum_key_of_repr (sum_enum t) k))
= destr (jump_sum_aux_payload_eq t pc) (jump_sum_aux_payload_if t pc) (fun _ _ -> ()) (fun _ _ _ _ -> ()) (jump_sum_aux_payload' t pc pc32) k
inline_for_extraction
let jump_sum
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(v: jumper p)
(p32: leaf_reader p)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (jumper (dsnd (pc x)))))
(destr: dep_maybe_enum_destr_t (sum_enum t) (jump_sum_aux_payload_t t pc))
: Tot (jumper (parse_sum t p pc))
= jump_sum_aux t v p32 pc (jump_sum_aux_payload t pc pc32 destr)
inline_for_extraction
let read_sum_cases'
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (leaf_reader (dsnd (pc x)))))
(k: sum_key t)
: Tot (leaf_reader (parse_sum_cases' t pc k))
= [@inline_let]
let _ = synth_sum_case_injective t k in
read_synth'
(dsnd (pc k))
(synth_sum_case t k)
(pc32 k)
()
inline_for_extraction
let read_sum_cases_t
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot Type
= leaf_reader (parse_sum_cases' t pc k)
let read_sum_cases_t_eq
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
(x y : read_sum_cases_t t pc k)
: GTot Type0
= True
inline_for_extraction
let read_sum_cases_t_if
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (if_combinator _ (read_sum_cases_t_eq t pc k))
= fun cond (sv_true: cond_true cond -> Tot (read_sum_cases_t t pc k)) (sv_false: cond_false cond -> Tot (read_sum_cases_t t pc k)) #_ #_ input pos ->
if cond
then (sv_true () input pos)
else (sv_false () input pos)
inline_for_extraction
let read_sum_cases
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (leaf_reader (dsnd (pc x)))))
(destr: dep_enum_destr (sum_enum t) (read_sum_cases_t t pc))
(k: sum_key t)
: Tot (leaf_reader (parse_sum_cases' t pc k))
= destr
_
(read_sum_cases_t_if t pc)
(fun _ _ -> ())
(fun _ _ _ _ -> ())
(read_sum_cases' t pc pc32)
k
#push-options "--z3rlimit 32"
inline_for_extraction
let read_sum
(#kt: parser_kind)
(t: sum)
(p: parser kt (sum_repr_type t))
(p32: leaf_reader (parse_enum_key p (sum_enum t)))
(j: jumper p)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (leaf_reader (dsnd (pc x)))))
(destr: dep_enum_destr (sum_enum t) (read_sum_cases_t t pc))
: Tot (leaf_reader (parse_sum t p pc))
=
fun #_ #_ input pos ->
let h = HST.get () in
valid_facts (parse_sum t p pc) h input pos;
parse_sum_eq' t p pc (bytes_of_slice_from h input pos);
valid_facts (parse_enum_key p (sum_enum t)) h input pos;
let k = p32 input pos in
let pos' = jump_enum_key j (sum_enum t) input pos in
valid_facts (parse_sum_cases' t pc k) h input pos' ;
read_sum_cases t pc pc32 destr k input pos'
#pop-options
inline_for_extraction
let serialize32_sum_cases_t
(t: sum)
(#pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(sc: ((x: sum_key t) -> Tot (serializer (dsnd (pc x)))))
(k: sum_key t)
: Tot Type
= serializer32 (serialize_sum_cases t pc sc k)
let serialize32_sum_cases_t_eq
(t: sum)
(#pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(sc: ((x: sum_key t) -> Tot (serializer (dsnd (pc x)))))
(k: sum_key t)
(x y: serialize32_sum_cases_t t sc k)
: GTot Type0
= True
inline_for_extraction
let serialize32_sum_cases_t_if
(t: sum)
(#pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(sc: ((x: sum_key t) -> Tot (serializer (dsnd (pc x)))))
(k: sum_key t)
: Tot (if_combinator _ (serialize32_sum_cases_t_eq t sc k))
= fun cond (sv_true: (cond_true cond -> Tot (serialize32_sum_cases_t t sc k))) (sv_false: (cond_false cond -> Tot (serialize32_sum_cases_t t sc k))) x #rrel #rel b pos ->
if cond
then (sv_true () x b pos)
else (sv_false () x b pos)
inline_for_extraction
let serialize32_sum_cases_aux
(t: sum)
(#pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(sc: ((x: sum_key t) -> Tot (serializer (dsnd (pc x)))))
(sc32: ((x: sum_key t) -> Tot (serializer32 (sc x))))
(k: sum_key t)
: Tot (serializer32 (serialize_sum_cases t pc sc k))
= fun x #rrel #rel b pos ->
[@inline_let] let _ =
Classical.forall_intro (parse_sum_cases_eq' t pc k);
synth_sum_case_injective t k;
synth_sum_case_inverse t k
in
serialize32_synth
(sc32 k)
(synth_sum_case t k)
(synth_sum_case_recip t k)
(fun x -> synth_sum_case_recip t k x)
()
x
b
pos
inline_for_extraction
let serialize32_sum_cases
(t: sum)
(#pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(sc: ((x: sum_key t) -> Tot (serializer (dsnd (pc x)))))
(sc32: ((x: sum_key t) -> Tot (serializer32 (sc x))))
(destr: dep_enum_destr (sum_enum t) (serialize32_sum_cases_t t sc))
(k: sum_key t)
: Tot (serializer32 (serialize_sum_cases t pc sc k))
= destr
_
(serialize32_sum_cases_t_if t sc)
(fun _ _ -> ())
(fun _ _ _ _ -> ())
(serialize32_sum_cases_aux t sc sc32)
k
inline_for_extraction
let serialize32_sum
(#kt: parser_kind)
(t: sum)
(#p: parser kt (sum_repr_type t))
(s: serializer p {kt.parser_kind_subkind == Some ParserStrong})
(s32: serializer32 (serialize_enum_key _ s (sum_enum t)))
(#pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(sc: ((x: sum_key t) -> Tot (serializer (dsnd (pc x)))))
(sc32: ((x: sum_key t) -> Tot (serializer32 (sc x))))
(destr: dep_enum_destr (sum_enum t) (serialize32_sum_cases_t t sc))
: Tot (serializer32 (serialize_sum t s sc))
= fun x #rrel #rel b pos ->
serialize_sum_eq t s sc x;
let tg = sum_tag_of_data t x in
serialize32_nondep_then_aux s32 (serialize32_sum_cases t sc sc32 destr tg) tg x b pos
let clens_sum_tag
(s: sum)
: Tot (clens (sum_type s) (sum_key s))
= {
clens_cond = (fun _ -> True);
clens_get = sum_tag_of_data s;
}
let gaccessor_sum_tag
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
: Tot (gaccessor (parse_sum t p pc) (parse_enum_key p (sum_enum t)) (clens_sum_tag t))
= gaccessor_tagged_union_tag
(parse_enum_key p (sum_enum t))
(sum_tag_of_data t)
(parse_sum_cases t pc)
inline_for_extraction
let accessor_sum_tag
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
: Tot (accessor (gaccessor_sum_tag t p pc))
= accessor_tagged_union_tag
(parse_enum_key p (sum_enum t))
(sum_tag_of_data t)
(parse_sum_cases t pc)
let clens_sum_payload
(s: sum)
(k: sum_key s)
: Tot (clens (sum_type s) (sum_type_of_tag s k))
= {
clens_cond = (fun (x: sum_type s) -> sum_tag_of_data s x == k);
clens_get = (fun (x: sum_type s) -> synth_sum_case_recip s k x <: Ghost (sum_type_of_tag s k) (requires (sum_tag_of_data s x == k)) (ensures (fun _ -> True)));
}
#push-options "--z3rlimit 32"
let gaccessor_clens_sum_payload'
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (gaccessor' (parse_sum t p pc) (dsnd (pc k)) (clens_sum_payload t k))
= fun (input: bytes) ->
parse_sum_eq'' t p pc input;
let res =
match parse p input with
| Some (_, consumed) ->
synth_sum_case_inverse t k;
synth_sum_case_injective t k;
synth_injective_synth_inverse_synth_inverse_recip (synth_sum_case t k) (synth_sum_case_recip t k) ();
(consumed)
| _ -> 0 // dummy
in
(res <: (res: _ { gaccessor_post' (parse_sum t p pc) (dsnd (pc k)) (clens_sum_payload t k) input res } ))
#push-options "--z3rlimit 64"
let gaccessor_clens_sum_payload_injective
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
(sl sl' : bytes)
: Lemma
(requires (
gaccessor_pre (parse_sum t p pc) (dsnd (pc k)) (clens_sum_payload t k) sl /\
gaccessor_pre (parse_sum t p pc) (dsnd (pc k)) (clens_sum_payload t k) sl' /\
injective_precond (parse_sum t p pc) sl sl'
))
(ensures (gaccessor_clens_sum_payload' t p pc k sl == gaccessor_clens_sum_payload' t p pc k sl'))
= parse_sum_eq'' t p pc sl;
parse_sum_eq'' t p pc sl' ;
parse_injective (parse_sum t p pc) sl sl' ;
parse_injective p sl sl'
#pop-options
let gaccessor_clens_sum_payload_no_lookahead
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
(sl sl' : bytes)
: Lemma
(requires (
(parse_sum_kind kt t pc).parser_kind_subkind == Some ParserStrong /\
gaccessor_pre (parse_sum t p pc) (dsnd (pc k)) (clens_sum_payload t k) sl /\
gaccessor_pre (parse_sum t p pc) (dsnd (pc k)) (clens_sum_payload t k) sl' /\
no_lookahead_on_precond (parse_sum t p pc) sl sl'
))
(ensures (gaccessor_clens_sum_payload' t p pc k sl == gaccessor_clens_sum_payload' t p pc k sl'))
= parse_sum_eq'' t p pc sl;
parse_sum_eq'' t p pc sl' ;
parse_strong_prefix (parse_sum t p pc) sl sl' ;
parse_injective p sl sl'
let gaccessor_clens_sum_payload
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (gaccessor (parse_sum t p pc) (dsnd (pc k)) (clens_sum_payload t k))
= Classical.forall_intro_2 (fun x -> Classical.move_requires (gaccessor_clens_sum_payload_injective t p pc k x));
Classical.forall_intro_2 (fun x -> Classical.move_requires (gaccessor_clens_sum_payload_no_lookahead t p pc k x));
gaccessor_prop_equiv (parse_sum t p pc) (dsnd (pc k)) (clens_sum_payload t k) (gaccessor_clens_sum_payload' t p pc k);
gaccessor_clens_sum_payload' t p pc k
inline_for_extraction
let accessor_clens_sum_payload'
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(j: jumper p)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: HST.Stack U32.t
(requires (fun h ->
valid (parse_sum t p pc) h input pos /\
(clens_sum_payload t k).clens_cond (contents (parse_sum t p pc) h input pos)
))
(ensures (fun h pos' h' ->
B.modifies B.loc_none h h' /\
pos' == slice_access h (gaccessor_clens_sum_payload t p pc k) input pos
))
=
let h = HST.get () in
[@inline_let]
let _ =
let pos' = get_valid_pos (parse_sum t p pc) h input pos in
let large = bytes_of_slice_from h input pos in
slice_access_eq h (gaccessor_clens_sum_payload t p pc k) input pos;
valid_facts (parse_sum t p pc) h input pos;
parse_sum_eq'' t p pc large;
valid_facts p h input pos
in
j input pos
#pop-options
inline_for_extraction
let accessor_clens_sum_payload
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(j: jumper p)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (accessor (gaccessor_clens_sum_payload t p pc k))
= fun #rrel #rel -> accessor_clens_sum_payload' t j pc k #rrel #rel
let clens_sum_cases_payload
(s: sum)
(k: sum_key s)
: Tot (clens (sum_cases s k) (sum_type_of_tag s k))
= {
clens_cond = (fun (x: sum_cases s k) -> True);
clens_get = (fun (x: sum_cases s k) -> synth_sum_case_recip s k x <: Ghost (sum_type_of_tag s k) (requires (True)) (ensures (fun _ -> True)));
}
let gaccessor_clens_sum_cases_payload
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (gaccessor (parse_sum_cases' t pc k) (dsnd (pc k)) (clens_sum_cases_payload t k))
= synth_sum_case_injective t k;
synth_sum_case_inverse t k;
synth_injective_synth_inverse_synth_inverse_recip (synth_sum_case t k) (synth_sum_case_recip t k) ();
gaccessor_ext
(gaccessor_synth (dsnd (pc k)) (synth_sum_case t k) (synth_sum_case_recip t k) ())
(clens_sum_cases_payload t k)
()
inline_for_extraction
let accessor_clens_sum_cases_payload
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (accessor (gaccessor_clens_sum_cases_payload t pc k))
= [@inline_let]
let _ =
synth_sum_case_injective t k;
synth_sum_case_inverse t k;
synth_injective_synth_inverse_synth_inverse_recip (synth_sum_case t k) (synth_sum_case_recip t k) ()
in
accessor_ext
(accessor_synth (dsnd (pc k)) (synth_sum_case t k) (synth_sum_case_recip t k) ())
(clens_sum_cases_payload t k)
()
inline_for_extraction
let validate_dsum_cases_t
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(#k: parser_kind)
(g: parser k (dsum_type_of_unknown_tag s))
(x: dsum_key s)
: Tot Type
= validator (parse_dsum_cases' s f g x)
let validate_dsum_cases_eq
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(#k: parser_kind)
(g: parser k (dsum_type_of_unknown_tag s))
(x: dsum_key s)
(v1 v2 : validate_dsum_cases_t s f g x)
: GTot Type0
= True
inline_for_extraction
let validate_dsum_cases_if'
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(#k: parser_kind)
(g: parser k (dsum_type_of_unknown_tag s))
(x: dsum_key s)
(cond: bool)
(ift: (cond_true cond -> Tot (validate_dsum_cases_t s f g x)))
(iff: (cond_false cond -> Tot (validate_dsum_cases_t s f g x)))
: Tot (validate_dsum_cases_t s f g x)
= fun #rrel #rel input len ->
if cond
then (ift () <: validate_dsum_cases_t s f g x) input len
else (iff () <: validate_dsum_cases_t s f g x) input len
inline_for_extraction
let validate_dsum_cases_if
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(#k: parser_kind)
(g: parser k (dsum_type_of_unknown_tag s))
(x: dsum_key s)
: Tot (if_combinator _ (validate_dsum_cases_eq s f g x))
= validate_dsum_cases_if' s f g x | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"LowStar.Buffer.fst.checked",
"LowParse.Spec.Sum.fst.checked",
"LowParse.Low.Enum.fst.checked",
"FStar.UInt64.fsti.checked",
"FStar.UInt32.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Int.Cast.fst.checked",
"FStar.HyperStack.ST.fsti.checked",
"FStar.HyperStack.fst.checked",
"FStar.Classical.fsti.checked"
],
"interface_file": false,
"source_file": "LowParse.Low.Sum.fst"
} | [
{
"abbrev": true,
"full_module": "FStar.HyperStack",
"short_module": "HS"
},
{
"abbrev": true,
"full_module": "FStar.UInt64",
"short_module": "U64"
},
{
"abbrev": true,
"full_module": "FStar.Int.Cast",
"short_module": "Cast"
},
{
"abbrev": true,
"full_module": "LowStar.Buffer",
"short_module": "B"
},
{
"abbrev": true,
"full_module": "FStar.HyperStack.ST",
"short_module": "HST"
},
{
"abbrev": true,
"full_module": "FStar.UInt32",
"short_module": "U32"
},
{
"abbrev": false,
"full_module": "LowParse.Spec.Sum",
"short_module": null
},
{
"abbrev": false,
"full_module": "LowParse.Low.Enum",
"short_module": null
},
{
"abbrev": false,
"full_module": "LowParse.Low",
"short_module": null
},
{
"abbrev": false,
"full_module": "LowParse.Low",
"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",
"short_module": null
}
] | {
"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_elim_box": false,
"smtencoding_l_arith_repr": "boxwrap",
"smtencoding_nl_arith_repr": "boxwrap",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": true,
"z3cliopt": [],
"z3refresh": false,
"z3rlimit": 5,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | false |
s: LowParse.Spec.Sum.dsum ->
f:
(x: LowParse.Spec.Sum.dsum_known_key s
-> Prims.dtuple2 LowParse.Spec.Base.parser_kind
(fun k -> LowParse.Spec.Base.parser k (LowParse.Spec.Sum.dsum_type_of_known_tag s x))) ->
f':
(x: LowParse.Spec.Sum.dsum_known_key s
-> LowParse.Low.Base.validator (FStar.Pervasives.dsnd (f x))) ->
g': LowParse.Low.Base.validator g ->
x: LowParse.Spec.Sum.dsum_key s
-> LowParse.Low.Sum.validate_dsum_cases_t s f g x | Prims.Tot | [
"total"
] | [] | [
"LowParse.Spec.Sum.dsum",
"LowParse.Spec.Sum.dsum_known_key",
"Prims.dtuple2",
"LowParse.Spec.Base.parser_kind",
"LowParse.Spec.Base.parser",
"LowParse.Spec.Sum.dsum_type_of_known_tag",
"LowParse.Low.Base.validator",
"Prims.__proj__Mkdtuple2__item___1",
"FStar.Pervasives.dsnd",
"LowParse.Spec.Sum.dsum_type_of_unknown_tag",
"LowParse.Spec.Sum.dsum_key",
"LowParse.Spec.Enum.enum_key",
"LowParse.Spec.Sum.dsum_key_type",
"LowParse.Spec.Sum.dsum_repr_type",
"LowParse.Spec.Sum.dsum_enum",
"LowParse.Low.Combinators.validate_synth",
"LowParse.Spec.Sum.dsum_cases",
"LowParse.Spec.Sum.synth_dsum_case",
"LowParse.Spec.Enum.Known",
"LowParse.Spec.Sum.parse_dsum_cases_kind",
"LowParse.Spec.Sum.parse_dsum_cases'",
"LowParse.Spec.Enum.unknown_enum_repr",
"LowParse.Spec.Enum.Unknown",
"LowParse.Low.Sum.validate_dsum_cases_t",
"Prims.unit",
"LowParse.Spec.Sum.synth_dsum_case_injective"
] | [] | false | false | false | false | false | let validate_dsum_cases'
(s: dsum)
(f: (x: dsum_known_key s -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x))))
(f': (x: dsum_known_key s -> Tot (validator (dsnd (f x)))))
(#k: parser_kind)
(#g: parser k (dsum_type_of_unknown_tag s))
(g': validator g)
(x: dsum_key s)
: Tot (validate_dsum_cases_t s f g x) =
| [@@ inline_let ]let _ = synth_dsum_case_injective s x in
match x with
| Known x' ->
validate_synth (f' x') (synth_dsum_case s (Known x')) () <: validator (parse_dsum_cases' s f g x)
| Unknown x' ->
validate_synth g' (synth_dsum_case s (Unknown x')) () <: validator (parse_dsum_cases' s f g x) | false |
LowParse.Low.Sum.fst | LowParse.Low.Sum.validate_dsum_cases_if | val validate_dsum_cases_if
(s: dsum)
(f: (x: dsum_known_key s -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x))))
(#k: parser_kind)
(g: parser k (dsum_type_of_unknown_tag s))
(x: dsum_key s)
: Tot (if_combinator _ (validate_dsum_cases_eq s f g x)) | val validate_dsum_cases_if
(s: dsum)
(f: (x: dsum_known_key s -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x))))
(#k: parser_kind)
(g: parser k (dsum_type_of_unknown_tag s))
(x: dsum_key s)
: Tot (if_combinator _ (validate_dsum_cases_eq s f g x)) | let validate_dsum_cases_if
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(#k: parser_kind)
(g: parser k (dsum_type_of_unknown_tag s))
(x: dsum_key s)
: Tot (if_combinator _ (validate_dsum_cases_eq s f g x))
= validate_dsum_cases_if' s f g x | {
"file_name": "src/lowparse/LowParse.Low.Sum.fst",
"git_rev": "00217c4a89f5ba56002ba9aa5b4a9d5903bfe9fa",
"git_url": "https://github.com/project-everest/everparse.git",
"project_name": "everparse"
} | {
"end_col": 33,
"end_line": 1000,
"start_col": 0,
"start_line": 993
} | module LowParse.Low.Sum
include LowParse.Low.Enum
include LowParse.Spec.Sum
module U32 = FStar.UInt32
module HST = FStar.HyperStack.ST
module B = LowStar.Buffer
module Cast = FStar.Int.Cast
module U64 = FStar.UInt64
inline_for_extraction
let validate_sum_cases_aux
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(vc: ((x: sum_key t) -> Tot (validator (dsnd (pc x)))))
(k: sum_key t)
: Tot (validator (parse_sum_cases t pc k))
= [@inline_let]
let _ = synth_sum_case_injective t k in
validate_synth
(validate_weaken
(weaken_parse_cases_kind t pc)
(vc k)
()
)
(synth_sum_case t k)
()
inline_for_extraction
let validate_sum_cases_t
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot Type
= validator (parse_sum_cases t pc k)
let validate_sum_cases_t_eq
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
(x y : validate_sum_cases_t t pc k)
: GTot Type0
= True
inline_for_extraction
let validate_sum_cases_t_if
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (if_combinator _ (validate_sum_cases_t_eq t pc k))
= fun cond (sv_true: cond_true cond -> Tot (validate_sum_cases_t t pc k)) (sv_false: cond_false cond -> Tot (validate_sum_cases_t t pc k)) #rrel #rel input pos ->
if cond
then sv_true () input pos
else sv_false () input pos
inline_for_extraction
let validate_sum_cases
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(vc: ((x: sum_key t) -> Tot (validator (dsnd (pc x)))))
(destr: dep_enum_destr (sum_enum t) (validate_sum_cases_t t pc))
(k: sum_key t)
: Tot (validator (parse_sum_cases t pc k))
= destr
_
(validate_sum_cases_t_if t pc)
(fun _ _ -> ())
(fun _ _ _ _ -> ())
(validate_sum_cases_aux t pc vc)
k
inline_for_extraction
let validate_sum_aux_payload_t
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
: Tot Type
= (#rrel: _) -> (#rel: _) ->
(input: slice rrel rel) ->
(pos: U64.t) ->
HST.Stack U64.t
(requires (fun h -> live_slice h input /\ U64.v pos <= U32.v input.len))
(ensures (fun h res h' ->
B.modifies B.loc_none h h' /\ (
match k with
| Unknown _ -> is_error res
| Known k' ->
if is_success res
then
valid_pos (dsnd (pc k')) h input (uint64_to_uint32 pos) (uint64_to_uint32 res)
else
(~ (valid (dsnd (pc k')) h input (uint64_to_uint32 pos)))
)))
let validate_sum_aux_payload_eq
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
: Tot (validate_sum_aux_payload_t t pc k -> validate_sum_aux_payload_t t pc k -> GTot Type0)
= fun _ _ -> True
inline_for_extraction
let validate_sum_aux_payload_if'
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
(cond: bool)
(ift: ((cond_true cond) -> Tot (validate_sum_aux_payload_t t pc k)))
(iff: ((cond_false cond) -> Tot (validate_sum_aux_payload_t t pc k)))
: Tot (validate_sum_aux_payload_t t pc k)
= fun #rrel #rel input pos ->
if cond
then begin
(ift () <: validate_sum_aux_payload_t t pc k) input pos
end else
(iff () <: validate_sum_aux_payload_t t pc k) input pos
inline_for_extraction
let validate_sum_aux_payload_if
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
: Tot (if_combinator _ (validate_sum_aux_payload_eq t pc k))
= validate_sum_aux_payload_if' t pc k
#push-options "--z3rlimit 64 --z3cliopt smt.arith.nl=false --using_facts_from '* -FStar.Int.Cast -LowParse.BitFields'"
// --query_stats --smtencoding.elim_box true --smtencoding.l_arith_repr native --z3refresh"
inline_for_extraction
let validate_sum_aux
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(v: validator p)
(p32: leaf_reader p)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(v_payload: ((k: sum_repr_type t)) -> Tot (validate_sum_aux_payload_t t pc (maybe_enum_key_of_repr (sum_enum t) k)))
: Tot (validator (parse_sum t p pc))
= fun #rrel #rel input pos ->
let h = HST.get () in
[@inline_let]
let _ = parse_sum_eq'' t p pc (bytes_of_slice_from h input (uint64_to_uint32 pos)) in
[@inline_let]
let _ = valid_facts (parse_sum t p pc) h input (uint64_to_uint32 pos) in
[@inline_let]
let _ = valid_facts p h input (uint64_to_uint32 pos) in
let len_after_tag = v input pos in
if is_error len_after_tag
then len_after_tag
else begin
let h1 = HST.get () in
let k' = p32 input (uint64_to_uint32 pos) in
[@inline_let]
let _ =
match maybe_enum_key_of_repr (sum_enum t) k' with
| Known k -> valid_facts (dsnd (pc k)) h input (uint64_to_uint32 len_after_tag)
| _ -> ()
in
v_payload k' input len_after_tag
end
#pop-options
inline_for_extraction
let validate_sum_aux_payload'
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (validator (dsnd (pc x)))))
(k: maybe_enum_key (sum_enum t))
: Tot (validate_sum_aux_payload_t t pc k)
= fun #rrel #rel input pos ->
match k with
| Known k ->
[@inline_let]
let _ = synth_sum_case_injective t k in
pc32 k input pos
// validate_synth (pc32 k) (synth_sum_case t k) () input pos
| _ -> validator_error_generic
inline_for_extraction
let validate_sum_aux_payload
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (validator (dsnd (pc x)))))
(destr: dep_maybe_enum_destr_t (sum_enum t) (validate_sum_aux_payload_t t pc))
(k: sum_repr_type t)
: Tot (validate_sum_aux_payload_t t pc (maybe_enum_key_of_repr (sum_enum t) k))
= destr (validate_sum_aux_payload_eq t pc) (validate_sum_aux_payload_if t pc) (fun _ _ -> ()) (fun _ _ _ _ -> ()) (validate_sum_aux_payload' t pc pc32) k
inline_for_extraction
let validate_sum
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(v: validator p)
(p32: leaf_reader p)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (validator (dsnd (pc x)))))
(destr: dep_maybe_enum_destr_t (sum_enum t) (validate_sum_aux_payload_t t pc))
: Tot (validator (parse_sum t p pc))
= validate_sum_aux t v p32 pc (validate_sum_aux_payload t pc pc32 destr)
module HS = FStar.HyperStack
#push-options "--z3rlimit 256 --z3cliopt smt.arith.nl=false --initial_ifuel 8 --max_ifuel 8 --initial_fuel 2 --max_fuel 2"
#restart-solver
let valid_sum_intro
(h: HS.mem)
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: Lemma
(requires (
valid (parse_enum_key p (sum_enum t)) h input pos /\ (
let k = contents (parse_enum_key p (sum_enum t)) h input pos in
valid (dsnd (pc k)) h input (get_valid_pos (parse_enum_key p (sum_enum t)) h input pos)
)))
(ensures (
let k = contents (parse_enum_key p (sum_enum t)) h input pos in
let pos_payload = get_valid_pos (parse_enum_key p (sum_enum t)) h input pos in
valid_content_pos
(parse_sum t p pc) h input pos
(synth_sum_case t k (contents (dsnd (pc k)) h input pos_payload))
(get_valid_pos (dsnd (pc k)) h input pos_payload)
))
= valid_facts (parse_enum_key p (sum_enum t)) h input pos;
let k = contents (parse_enum_key p (sum_enum t)) h input pos in
let pos_payload = get_valid_pos (parse_enum_key p (sum_enum t)) h input pos in
valid_facts (dsnd (pc k)) h input pos_payload;
valid_facts (parse_sum t p pc) h input pos;
parse_sum_eq t p pc (bytes_of_slice_from h input pos)
#pop-options
inline_for_extraction
let finalize_sum_case
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(s: serializer p)
(w: leaf_writer_strong s)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(destr: enum_repr_of_key'_t (sum_enum t))
(k: sum_key t)
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: HST.Stack unit
(requires (fun h ->
let len_tag = serialized_length (serialize_enum_key _ s (sum_enum t)) k in
U32.v pos + len_tag < 4294967296 /\ (
let pos_payload = pos `U32.add` U32.uint_to_t len_tag in
valid (dsnd (pc k)) h input pos_payload /\
writable input.base (U32.v pos) (U32.v pos_payload) h
)))
(ensures (fun h _ h' ->
let len_tag = serialized_length (serialize_enum_key _ s (sum_enum t)) k in
let pos_payload = pos `U32.add` U32.uint_to_t len_tag in
B.modifies (loc_slice_from_to input pos pos_payload) h h' /\
valid_content_pos (parse_sum t p pc) h' input pos (synth_sum_case t k (contents (dsnd (pc k)) h input pos_payload)) (get_valid_pos (dsnd (pc k)) h input pos_payload)
))
= let pos1 = write_enum_key w (sum_enum t) destr k input pos in
let h = HST.get () in
[@inline_let]
let _ = valid_sum_intro h t p pc input pos in
()
inline_for_extraction
let jump_sum_cases_aux
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(vc: ((x: sum_key t) -> Tot (jumper (dsnd (pc x)))))
(k: sum_key t)
: Tot (jumper (parse_sum_cases t pc k))
= [@inline_let]
let _ = synth_sum_case_injective t k in
jump_synth
(jump_weaken
(weaken_parse_cases_kind t pc)
(vc k)
()
)
(synth_sum_case t k)
()
inline_for_extraction
let jump_sum_cases_t
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot Type
= jumper (parse_sum_cases t pc k)
let jump_sum_cases_t_eq
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
(x y : jump_sum_cases_t t pc k)
: GTot Type0
= True
inline_for_extraction
let jump_sum_cases_t_if
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (if_combinator _ (jump_sum_cases_t_eq t pc k))
= fun cond (sv_true: cond_true cond -> Tot (jump_sum_cases_t t pc k)) (sv_false: cond_false cond -> Tot (jump_sum_cases_t t pc k)) #rrel #rel input pos ->
if cond
then sv_true () input pos
else sv_false () input pos
inline_for_extraction
let jump_sum_cases
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(vc: ((x: sum_key t) -> Tot (jumper (dsnd (pc x)))))
(destr: dep_enum_destr (sum_enum t) (jump_sum_cases_t t pc))
(k: sum_key t)
: Tot (jumper (parse_sum_cases t pc k))
= destr
_
(jump_sum_cases_t_if t pc)
(fun _ _ -> ())
(fun _ _ _ _ -> ())
(jump_sum_cases_aux t pc vc)
k
inline_for_extraction
let jump_sum_aux_payload_t
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
: Tot Type
= (#rrel: _) -> (#rel: _) ->
(input: slice rrel rel) ->
(pos: U32.t) ->
HST.Stack U32.t
(requires (fun h -> live_slice h input /\ U32.v pos <= U32.v input.len /\ (
match k with
| Unknown _ -> False
| Known k' -> valid (dsnd (pc k')) h input pos
)))
(ensures (fun h res h' ->
B.modifies B.loc_none h h' /\ (
match k with
| Unknown _ -> False
| Known k' ->
valid_pos (dsnd (pc k')) h input pos res
)))
let jump_sum_aux_payload_eq
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
: Tot (jump_sum_aux_payload_t t pc k -> jump_sum_aux_payload_t t pc k -> GTot Type0)
= fun _ _ -> True
inline_for_extraction
let jump_sum_aux_payload_if'
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
(cond: bool)
(ift: ((cond_true cond) -> Tot (jump_sum_aux_payload_t t pc k)))
(iff: ((cond_false cond) -> Tot (jump_sum_aux_payload_t t pc k)))
: Tot (jump_sum_aux_payload_t t pc k)
= fun #rrel #rel input pos ->
if cond
then begin
(ift () <: jump_sum_aux_payload_t t pc k) input pos
end else
(iff () <: jump_sum_aux_payload_t t pc k) input pos
inline_for_extraction
let jump_sum_aux_payload_if
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
: Tot (if_combinator _ (jump_sum_aux_payload_eq t pc k))
= jump_sum_aux_payload_if' t pc k
let parse_sum_eq3
(#kt: parser_kind)
(t: sum)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(input: bytes)
(k' : sum_repr_type t)
(consumed_k: consumed_length input)
: Lemma
(requires (Some? (parse (parse_sum t p pc) input) /\ parse p input == Some (k', consumed_k)))
(ensures (
let input_k = Seq.slice input consumed_k (Seq.length input) in
let k = maybe_enum_key_of_repr (sum_enum t) k' in
begin match k with
| Known k ->
Some? (parse (dsnd (pc k)) input_k)
| _ -> False
end
))
= parse_sum_eq'' t p pc input
let parse_sum_eq4
(#kt: parser_kind)
(t: sum)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(input: bytes)
(k' : sum_repr_type t)
(consumed_k: consumed_length input)
(consumed_payload: nat)
: Lemma
(requires (Some? (parse (parse_sum t p pc) input) /\ parse p input == Some (k', consumed_k) /\ (
let input_k = Seq.slice input consumed_k (Seq.length input) in
let k = maybe_enum_key_of_repr (sum_enum t) k' in
begin match k with
| Known k ->
Some? (parse (dsnd (pc k)) input_k) /\ (
let Some (_, consumed_payload') = parse (dsnd (pc k)) input_k in
consumed_payload' == consumed_payload
)
| _ -> False
end
)))
(ensures (
let Some (_, consumed) = parse (parse_sum t p pc) input in
consumed == consumed_k + consumed_payload
))
= parse_sum_eq'' t p pc input
#push-options "--z3rlimit 16"
let valid_sum_elim
(h: HS.mem)
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(#rrel: _) (#rel: _)
(input: slice rrel rel)
(pos: U32.t)
: Lemma
(requires (
valid (parse_sum t p pc) h input pos
))
(ensures (
valid p h input pos /\ (
let pos_payload = get_valid_pos p h input pos in
let k' = maybe_enum_key_of_repr (sum_enum t) (contents p h input pos) in
match k' with
| Known k ->
k == sum_tag_of_data t (contents (parse_sum t p pc) h input pos) /\
valid (dsnd (pc k)) h input pos_payload /\
valid_pos
(parse_sum t p pc) h input pos
(get_valid_pos (dsnd (pc k)) h input pos_payload)
| _ -> False
)))
= let sinput = bytes_of_slice_from h input pos in
let _ = parse_sum_eq'' t p pc sinput in
[@inline_let]
let _ = valid_facts (parse_sum t p pc) h input pos in
let Some (k', consumed_k) = parse p sinput in
let pos_after_tag = U32.uint_to_t (U32.v pos + consumed_k) in
[@inline_let]
let _ = valid_facts p h input pos in
assert (valid_content_pos p h input pos k' pos_after_tag);
match maybe_enum_key_of_repr (sum_enum t) k' with
| Known k -> valid_facts (dsnd (pc k)) h input pos_after_tag
| _ -> ()
#pop-options
let valid_sum_elim_tag
(h: HS.mem)
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: Lemma
(requires (
valid (parse_sum t p pc) h input pos
))
(ensures (
valid (parse_enum_key p (sum_enum t)) h input pos /\
contents (parse_enum_key p (sum_enum t)) h input pos == sum_tag_of_data t (contents (parse_sum t p pc) h input pos)
))
= let _ = parse_sum_eq' t p pc (bytes_of_slice_from h input pos) in
let _ = valid_facts (parse_sum t p pc) h input pos in
let _ = valid_facts (parse_enum_key p (sum_enum t)) h input pos in
()
inline_for_extraction
let read_sum_tag
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(p32: leaf_reader p)
(destr: dep_maybe_enum_destr_t (sum_enum t) (read_enum_key_t (sum_enum t)))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: HST.Stack (sum_key t)
(requires (fun h ->
valid (parse_sum t p pc) h input pos
))
(ensures (fun h res h' ->
B.modifies B.loc_none h h' /\
res == sum_tag_of_data t (contents (parse_sum t p pc) h input pos)
))
= let h = HST.get () in
[@inline_let] let _ = valid_sum_elim_tag h t p pc input pos in
read_enum_key p32 (sum_enum t) destr input pos
inline_for_extraction
let jump_sum_aux
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(v: jumper p)
(p32: leaf_reader p)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(v_payload: ((k: sum_repr_type t)) -> Tot (jump_sum_aux_payload_t t pc (maybe_enum_key_of_repr (sum_enum t) k)))
: Tot (jumper (parse_sum t p pc))
= fun #rrel #rel input pos ->
let h = HST.get () in
[@inline_let]
let _ = valid_sum_elim h t p pc input pos in
let pos_after_tag = v input pos in
let k' = p32 input pos in
v_payload k' input pos_after_tag
inline_for_extraction
let jump_sum_aux_payload'
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (jumper (dsnd (pc x)))))
(k: maybe_enum_key (sum_enum t))
: Tot (jump_sum_aux_payload_t t pc k)
= fun #rrel #rel input pos ->
match k with
| Known k ->
[@inline_let]
let _ = synth_sum_case_injective t k in
pc32 k input pos
| _ -> 0ul // dummy, but we MUST NOT remove this branch, otherwise extraction fails
inline_for_extraction
let jump_sum_aux_payload
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (jumper (dsnd (pc x)))))
(destr: dep_maybe_enum_destr_t (sum_enum t) (jump_sum_aux_payload_t t pc))
(k: sum_repr_type t)
: Tot (jump_sum_aux_payload_t t pc (maybe_enum_key_of_repr (sum_enum t) k))
= destr (jump_sum_aux_payload_eq t pc) (jump_sum_aux_payload_if t pc) (fun _ _ -> ()) (fun _ _ _ _ -> ()) (jump_sum_aux_payload' t pc pc32) k
inline_for_extraction
let jump_sum
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(v: jumper p)
(p32: leaf_reader p)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (jumper (dsnd (pc x)))))
(destr: dep_maybe_enum_destr_t (sum_enum t) (jump_sum_aux_payload_t t pc))
: Tot (jumper (parse_sum t p pc))
= jump_sum_aux t v p32 pc (jump_sum_aux_payload t pc pc32 destr)
inline_for_extraction
let read_sum_cases'
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (leaf_reader (dsnd (pc x)))))
(k: sum_key t)
: Tot (leaf_reader (parse_sum_cases' t pc k))
= [@inline_let]
let _ = synth_sum_case_injective t k in
read_synth'
(dsnd (pc k))
(synth_sum_case t k)
(pc32 k)
()
inline_for_extraction
let read_sum_cases_t
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot Type
= leaf_reader (parse_sum_cases' t pc k)
let read_sum_cases_t_eq
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
(x y : read_sum_cases_t t pc k)
: GTot Type0
= True
inline_for_extraction
let read_sum_cases_t_if
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (if_combinator _ (read_sum_cases_t_eq t pc k))
= fun cond (sv_true: cond_true cond -> Tot (read_sum_cases_t t pc k)) (sv_false: cond_false cond -> Tot (read_sum_cases_t t pc k)) #_ #_ input pos ->
if cond
then (sv_true () input pos)
else (sv_false () input pos)
inline_for_extraction
let read_sum_cases
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (leaf_reader (dsnd (pc x)))))
(destr: dep_enum_destr (sum_enum t) (read_sum_cases_t t pc))
(k: sum_key t)
: Tot (leaf_reader (parse_sum_cases' t pc k))
= destr
_
(read_sum_cases_t_if t pc)
(fun _ _ -> ())
(fun _ _ _ _ -> ())
(read_sum_cases' t pc pc32)
k
#push-options "--z3rlimit 32"
inline_for_extraction
let read_sum
(#kt: parser_kind)
(t: sum)
(p: parser kt (sum_repr_type t))
(p32: leaf_reader (parse_enum_key p (sum_enum t)))
(j: jumper p)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (leaf_reader (dsnd (pc x)))))
(destr: dep_enum_destr (sum_enum t) (read_sum_cases_t t pc))
: Tot (leaf_reader (parse_sum t p pc))
=
fun #_ #_ input pos ->
let h = HST.get () in
valid_facts (parse_sum t p pc) h input pos;
parse_sum_eq' t p pc (bytes_of_slice_from h input pos);
valid_facts (parse_enum_key p (sum_enum t)) h input pos;
let k = p32 input pos in
let pos' = jump_enum_key j (sum_enum t) input pos in
valid_facts (parse_sum_cases' t pc k) h input pos' ;
read_sum_cases t pc pc32 destr k input pos'
#pop-options
inline_for_extraction
let serialize32_sum_cases_t
(t: sum)
(#pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(sc: ((x: sum_key t) -> Tot (serializer (dsnd (pc x)))))
(k: sum_key t)
: Tot Type
= serializer32 (serialize_sum_cases t pc sc k)
let serialize32_sum_cases_t_eq
(t: sum)
(#pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(sc: ((x: sum_key t) -> Tot (serializer (dsnd (pc x)))))
(k: sum_key t)
(x y: serialize32_sum_cases_t t sc k)
: GTot Type0
= True
inline_for_extraction
let serialize32_sum_cases_t_if
(t: sum)
(#pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(sc: ((x: sum_key t) -> Tot (serializer (dsnd (pc x)))))
(k: sum_key t)
: Tot (if_combinator _ (serialize32_sum_cases_t_eq t sc k))
= fun cond (sv_true: (cond_true cond -> Tot (serialize32_sum_cases_t t sc k))) (sv_false: (cond_false cond -> Tot (serialize32_sum_cases_t t sc k))) x #rrel #rel b pos ->
if cond
then (sv_true () x b pos)
else (sv_false () x b pos)
inline_for_extraction
let serialize32_sum_cases_aux
(t: sum)
(#pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(sc: ((x: sum_key t) -> Tot (serializer (dsnd (pc x)))))
(sc32: ((x: sum_key t) -> Tot (serializer32 (sc x))))
(k: sum_key t)
: Tot (serializer32 (serialize_sum_cases t pc sc k))
= fun x #rrel #rel b pos ->
[@inline_let] let _ =
Classical.forall_intro (parse_sum_cases_eq' t pc k);
synth_sum_case_injective t k;
synth_sum_case_inverse t k
in
serialize32_synth
(sc32 k)
(synth_sum_case t k)
(synth_sum_case_recip t k)
(fun x -> synth_sum_case_recip t k x)
()
x
b
pos
inline_for_extraction
let serialize32_sum_cases
(t: sum)
(#pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(sc: ((x: sum_key t) -> Tot (serializer (dsnd (pc x)))))
(sc32: ((x: sum_key t) -> Tot (serializer32 (sc x))))
(destr: dep_enum_destr (sum_enum t) (serialize32_sum_cases_t t sc))
(k: sum_key t)
: Tot (serializer32 (serialize_sum_cases t pc sc k))
= destr
_
(serialize32_sum_cases_t_if t sc)
(fun _ _ -> ())
(fun _ _ _ _ -> ())
(serialize32_sum_cases_aux t sc sc32)
k
inline_for_extraction
let serialize32_sum
(#kt: parser_kind)
(t: sum)
(#p: parser kt (sum_repr_type t))
(s: serializer p {kt.parser_kind_subkind == Some ParserStrong})
(s32: serializer32 (serialize_enum_key _ s (sum_enum t)))
(#pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(sc: ((x: sum_key t) -> Tot (serializer (dsnd (pc x)))))
(sc32: ((x: sum_key t) -> Tot (serializer32 (sc x))))
(destr: dep_enum_destr (sum_enum t) (serialize32_sum_cases_t t sc))
: Tot (serializer32 (serialize_sum t s sc))
= fun x #rrel #rel b pos ->
serialize_sum_eq t s sc x;
let tg = sum_tag_of_data t x in
serialize32_nondep_then_aux s32 (serialize32_sum_cases t sc sc32 destr tg) tg x b pos
let clens_sum_tag
(s: sum)
: Tot (clens (sum_type s) (sum_key s))
= {
clens_cond = (fun _ -> True);
clens_get = sum_tag_of_data s;
}
let gaccessor_sum_tag
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
: Tot (gaccessor (parse_sum t p pc) (parse_enum_key p (sum_enum t)) (clens_sum_tag t))
= gaccessor_tagged_union_tag
(parse_enum_key p (sum_enum t))
(sum_tag_of_data t)
(parse_sum_cases t pc)
inline_for_extraction
let accessor_sum_tag
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
: Tot (accessor (gaccessor_sum_tag t p pc))
= accessor_tagged_union_tag
(parse_enum_key p (sum_enum t))
(sum_tag_of_data t)
(parse_sum_cases t pc)
let clens_sum_payload
(s: sum)
(k: sum_key s)
: Tot (clens (sum_type s) (sum_type_of_tag s k))
= {
clens_cond = (fun (x: sum_type s) -> sum_tag_of_data s x == k);
clens_get = (fun (x: sum_type s) -> synth_sum_case_recip s k x <: Ghost (sum_type_of_tag s k) (requires (sum_tag_of_data s x == k)) (ensures (fun _ -> True)));
}
#push-options "--z3rlimit 32"
let gaccessor_clens_sum_payload'
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (gaccessor' (parse_sum t p pc) (dsnd (pc k)) (clens_sum_payload t k))
= fun (input: bytes) ->
parse_sum_eq'' t p pc input;
let res =
match parse p input with
| Some (_, consumed) ->
synth_sum_case_inverse t k;
synth_sum_case_injective t k;
synth_injective_synth_inverse_synth_inverse_recip (synth_sum_case t k) (synth_sum_case_recip t k) ();
(consumed)
| _ -> 0 // dummy
in
(res <: (res: _ { gaccessor_post' (parse_sum t p pc) (dsnd (pc k)) (clens_sum_payload t k) input res } ))
#push-options "--z3rlimit 64"
let gaccessor_clens_sum_payload_injective
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
(sl sl' : bytes)
: Lemma
(requires (
gaccessor_pre (parse_sum t p pc) (dsnd (pc k)) (clens_sum_payload t k) sl /\
gaccessor_pre (parse_sum t p pc) (dsnd (pc k)) (clens_sum_payload t k) sl' /\
injective_precond (parse_sum t p pc) sl sl'
))
(ensures (gaccessor_clens_sum_payload' t p pc k sl == gaccessor_clens_sum_payload' t p pc k sl'))
= parse_sum_eq'' t p pc sl;
parse_sum_eq'' t p pc sl' ;
parse_injective (parse_sum t p pc) sl sl' ;
parse_injective p sl sl'
#pop-options
let gaccessor_clens_sum_payload_no_lookahead
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
(sl sl' : bytes)
: Lemma
(requires (
(parse_sum_kind kt t pc).parser_kind_subkind == Some ParserStrong /\
gaccessor_pre (parse_sum t p pc) (dsnd (pc k)) (clens_sum_payload t k) sl /\
gaccessor_pre (parse_sum t p pc) (dsnd (pc k)) (clens_sum_payload t k) sl' /\
no_lookahead_on_precond (parse_sum t p pc) sl sl'
))
(ensures (gaccessor_clens_sum_payload' t p pc k sl == gaccessor_clens_sum_payload' t p pc k sl'))
= parse_sum_eq'' t p pc sl;
parse_sum_eq'' t p pc sl' ;
parse_strong_prefix (parse_sum t p pc) sl sl' ;
parse_injective p sl sl'
let gaccessor_clens_sum_payload
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (gaccessor (parse_sum t p pc) (dsnd (pc k)) (clens_sum_payload t k))
= Classical.forall_intro_2 (fun x -> Classical.move_requires (gaccessor_clens_sum_payload_injective t p pc k x));
Classical.forall_intro_2 (fun x -> Classical.move_requires (gaccessor_clens_sum_payload_no_lookahead t p pc k x));
gaccessor_prop_equiv (parse_sum t p pc) (dsnd (pc k)) (clens_sum_payload t k) (gaccessor_clens_sum_payload' t p pc k);
gaccessor_clens_sum_payload' t p pc k
inline_for_extraction
let accessor_clens_sum_payload'
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(j: jumper p)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: HST.Stack U32.t
(requires (fun h ->
valid (parse_sum t p pc) h input pos /\
(clens_sum_payload t k).clens_cond (contents (parse_sum t p pc) h input pos)
))
(ensures (fun h pos' h' ->
B.modifies B.loc_none h h' /\
pos' == slice_access h (gaccessor_clens_sum_payload t p pc k) input pos
))
=
let h = HST.get () in
[@inline_let]
let _ =
let pos' = get_valid_pos (parse_sum t p pc) h input pos in
let large = bytes_of_slice_from h input pos in
slice_access_eq h (gaccessor_clens_sum_payload t p pc k) input pos;
valid_facts (parse_sum t p pc) h input pos;
parse_sum_eq'' t p pc large;
valid_facts p h input pos
in
j input pos
#pop-options
inline_for_extraction
let accessor_clens_sum_payload
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(j: jumper p)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (accessor (gaccessor_clens_sum_payload t p pc k))
= fun #rrel #rel -> accessor_clens_sum_payload' t j pc k #rrel #rel
let clens_sum_cases_payload
(s: sum)
(k: sum_key s)
: Tot (clens (sum_cases s k) (sum_type_of_tag s k))
= {
clens_cond = (fun (x: sum_cases s k) -> True);
clens_get = (fun (x: sum_cases s k) -> synth_sum_case_recip s k x <: Ghost (sum_type_of_tag s k) (requires (True)) (ensures (fun _ -> True)));
}
let gaccessor_clens_sum_cases_payload
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (gaccessor (parse_sum_cases' t pc k) (dsnd (pc k)) (clens_sum_cases_payload t k))
= synth_sum_case_injective t k;
synth_sum_case_inverse t k;
synth_injective_synth_inverse_synth_inverse_recip (synth_sum_case t k) (synth_sum_case_recip t k) ();
gaccessor_ext
(gaccessor_synth (dsnd (pc k)) (synth_sum_case t k) (synth_sum_case_recip t k) ())
(clens_sum_cases_payload t k)
()
inline_for_extraction
let accessor_clens_sum_cases_payload
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (accessor (gaccessor_clens_sum_cases_payload t pc k))
= [@inline_let]
let _ =
synth_sum_case_injective t k;
synth_sum_case_inverse t k;
synth_injective_synth_inverse_synth_inverse_recip (synth_sum_case t k) (synth_sum_case_recip t k) ()
in
accessor_ext
(accessor_synth (dsnd (pc k)) (synth_sum_case t k) (synth_sum_case_recip t k) ())
(clens_sum_cases_payload t k)
()
inline_for_extraction
let validate_dsum_cases_t
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(#k: parser_kind)
(g: parser k (dsum_type_of_unknown_tag s))
(x: dsum_key s)
: Tot Type
= validator (parse_dsum_cases' s f g x)
let validate_dsum_cases_eq
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(#k: parser_kind)
(g: parser k (dsum_type_of_unknown_tag s))
(x: dsum_key s)
(v1 v2 : validate_dsum_cases_t s f g x)
: GTot Type0
= True
inline_for_extraction
let validate_dsum_cases_if'
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(#k: parser_kind)
(g: parser k (dsum_type_of_unknown_tag s))
(x: dsum_key s)
(cond: bool)
(ift: (cond_true cond -> Tot (validate_dsum_cases_t s f g x)))
(iff: (cond_false cond -> Tot (validate_dsum_cases_t s f g x)))
: Tot (validate_dsum_cases_t s f g x)
= fun #rrel #rel input len ->
if cond
then (ift () <: validate_dsum_cases_t s f g x) input len
else (iff () <: validate_dsum_cases_t s f g x) input len | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"LowStar.Buffer.fst.checked",
"LowParse.Spec.Sum.fst.checked",
"LowParse.Low.Enum.fst.checked",
"FStar.UInt64.fsti.checked",
"FStar.UInt32.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Int.Cast.fst.checked",
"FStar.HyperStack.ST.fsti.checked",
"FStar.HyperStack.fst.checked",
"FStar.Classical.fsti.checked"
],
"interface_file": false,
"source_file": "LowParse.Low.Sum.fst"
} | [
{
"abbrev": true,
"full_module": "FStar.HyperStack",
"short_module": "HS"
},
{
"abbrev": true,
"full_module": "FStar.UInt64",
"short_module": "U64"
},
{
"abbrev": true,
"full_module": "FStar.Int.Cast",
"short_module": "Cast"
},
{
"abbrev": true,
"full_module": "LowStar.Buffer",
"short_module": "B"
},
{
"abbrev": true,
"full_module": "FStar.HyperStack.ST",
"short_module": "HST"
},
{
"abbrev": true,
"full_module": "FStar.UInt32",
"short_module": "U32"
},
{
"abbrev": false,
"full_module": "LowParse.Spec.Sum",
"short_module": null
},
{
"abbrev": false,
"full_module": "LowParse.Low.Enum",
"short_module": null
},
{
"abbrev": false,
"full_module": "LowParse.Low",
"short_module": null
},
{
"abbrev": false,
"full_module": "LowParse.Low",
"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",
"short_module": null
}
] | {
"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_elim_box": false,
"smtencoding_l_arith_repr": "boxwrap",
"smtencoding_nl_arith_repr": "boxwrap",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": true,
"z3cliopt": [],
"z3refresh": false,
"z3rlimit": 5,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | false |
s: LowParse.Spec.Sum.dsum ->
f:
(x: LowParse.Spec.Sum.dsum_known_key s
-> Prims.dtuple2 LowParse.Spec.Base.parser_kind
(fun k -> LowParse.Spec.Base.parser k (LowParse.Spec.Sum.dsum_type_of_known_tag s x))) ->
g: LowParse.Spec.Base.parser k (LowParse.Spec.Sum.dsum_type_of_unknown_tag s) ->
x: LowParse.Spec.Sum.dsum_key s
-> LowParse.Spec.Enum.if_combinator (LowParse.Low.Sum.validate_dsum_cases_t s f g x)
(LowParse.Low.Sum.validate_dsum_cases_eq s f g x) | Prims.Tot | [
"total"
] | [] | [
"LowParse.Spec.Sum.dsum",
"LowParse.Spec.Sum.dsum_known_key",
"Prims.dtuple2",
"LowParse.Spec.Base.parser_kind",
"LowParse.Spec.Base.parser",
"LowParse.Spec.Sum.dsum_type_of_known_tag",
"LowParse.Spec.Sum.dsum_type_of_unknown_tag",
"LowParse.Spec.Sum.dsum_key",
"LowParse.Low.Sum.validate_dsum_cases_if'",
"LowParse.Spec.Enum.if_combinator",
"LowParse.Low.Sum.validate_dsum_cases_t",
"LowParse.Low.Sum.validate_dsum_cases_eq"
] | [] | false | false | false | false | false | let validate_dsum_cases_if
(s: dsum)
(f: (x: dsum_known_key s -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x))))
(#k: parser_kind)
(g: parser k (dsum_type_of_unknown_tag s))
(x: dsum_key s)
: Tot (if_combinator _ (validate_dsum_cases_eq s f g x)) =
| validate_dsum_cases_if' s f g x | false |
LowParse.Low.Sum.fst | LowParse.Low.Sum.gaccessor_dsum_tag | val gaccessor_dsum_tag
(#kt: parser_kind)
(t: dsum)
(p: parser kt (dsum_repr_type t))
(f: (x: dsum_known_key t -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x))))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
: Tot (gaccessor (parse_dsum t p f g) (parse_maybe_enum_key p (dsum_enum t)) (clens_dsum_tag t)) | val gaccessor_dsum_tag
(#kt: parser_kind)
(t: dsum)
(p: parser kt (dsum_repr_type t))
(f: (x: dsum_known_key t -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x))))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
: Tot (gaccessor (parse_dsum t p f g) (parse_maybe_enum_key p (dsum_enum t)) (clens_dsum_tag t)) | let gaccessor_dsum_tag
(#kt: parser_kind)
(t: dsum)
(p: parser kt (dsum_repr_type t))
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
: Tot (gaccessor (parse_dsum t p f g) (parse_maybe_enum_key p (dsum_enum t)) (clens_dsum_tag t))
= gaccessor_tagged_union_tag
(parse_maybe_enum_key p (dsum_enum t))
(dsum_tag_of_data t)
(parse_dsum_cases t f g) | {
"file_name": "src/lowparse/LowParse.Low.Sum.fst",
"git_rev": "00217c4a89f5ba56002ba9aa5b4a9d5903bfe9fa",
"git_url": "https://github.com/project-everest/everparse.git",
"project_name": "everparse"
} | {
"end_col": 28,
"end_line": 1784,
"start_col": 0,
"start_line": 1773
} | module LowParse.Low.Sum
include LowParse.Low.Enum
include LowParse.Spec.Sum
module U32 = FStar.UInt32
module HST = FStar.HyperStack.ST
module B = LowStar.Buffer
module Cast = FStar.Int.Cast
module U64 = FStar.UInt64
inline_for_extraction
let validate_sum_cases_aux
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(vc: ((x: sum_key t) -> Tot (validator (dsnd (pc x)))))
(k: sum_key t)
: Tot (validator (parse_sum_cases t pc k))
= [@inline_let]
let _ = synth_sum_case_injective t k in
validate_synth
(validate_weaken
(weaken_parse_cases_kind t pc)
(vc k)
()
)
(synth_sum_case t k)
()
inline_for_extraction
let validate_sum_cases_t
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot Type
= validator (parse_sum_cases t pc k)
let validate_sum_cases_t_eq
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
(x y : validate_sum_cases_t t pc k)
: GTot Type0
= True
inline_for_extraction
let validate_sum_cases_t_if
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (if_combinator _ (validate_sum_cases_t_eq t pc k))
= fun cond (sv_true: cond_true cond -> Tot (validate_sum_cases_t t pc k)) (sv_false: cond_false cond -> Tot (validate_sum_cases_t t pc k)) #rrel #rel input pos ->
if cond
then sv_true () input pos
else sv_false () input pos
inline_for_extraction
let validate_sum_cases
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(vc: ((x: sum_key t) -> Tot (validator (dsnd (pc x)))))
(destr: dep_enum_destr (sum_enum t) (validate_sum_cases_t t pc))
(k: sum_key t)
: Tot (validator (parse_sum_cases t pc k))
= destr
_
(validate_sum_cases_t_if t pc)
(fun _ _ -> ())
(fun _ _ _ _ -> ())
(validate_sum_cases_aux t pc vc)
k
inline_for_extraction
let validate_sum_aux_payload_t
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
: Tot Type
= (#rrel: _) -> (#rel: _) ->
(input: slice rrel rel) ->
(pos: U64.t) ->
HST.Stack U64.t
(requires (fun h -> live_slice h input /\ U64.v pos <= U32.v input.len))
(ensures (fun h res h' ->
B.modifies B.loc_none h h' /\ (
match k with
| Unknown _ -> is_error res
| Known k' ->
if is_success res
then
valid_pos (dsnd (pc k')) h input (uint64_to_uint32 pos) (uint64_to_uint32 res)
else
(~ (valid (dsnd (pc k')) h input (uint64_to_uint32 pos)))
)))
let validate_sum_aux_payload_eq
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
: Tot (validate_sum_aux_payload_t t pc k -> validate_sum_aux_payload_t t pc k -> GTot Type0)
= fun _ _ -> True
inline_for_extraction
let validate_sum_aux_payload_if'
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
(cond: bool)
(ift: ((cond_true cond) -> Tot (validate_sum_aux_payload_t t pc k)))
(iff: ((cond_false cond) -> Tot (validate_sum_aux_payload_t t pc k)))
: Tot (validate_sum_aux_payload_t t pc k)
= fun #rrel #rel input pos ->
if cond
then begin
(ift () <: validate_sum_aux_payload_t t pc k) input pos
end else
(iff () <: validate_sum_aux_payload_t t pc k) input pos
inline_for_extraction
let validate_sum_aux_payload_if
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
: Tot (if_combinator _ (validate_sum_aux_payload_eq t pc k))
= validate_sum_aux_payload_if' t pc k
#push-options "--z3rlimit 64 --z3cliopt smt.arith.nl=false --using_facts_from '* -FStar.Int.Cast -LowParse.BitFields'"
// --query_stats --smtencoding.elim_box true --smtencoding.l_arith_repr native --z3refresh"
inline_for_extraction
let validate_sum_aux
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(v: validator p)
(p32: leaf_reader p)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(v_payload: ((k: sum_repr_type t)) -> Tot (validate_sum_aux_payload_t t pc (maybe_enum_key_of_repr (sum_enum t) k)))
: Tot (validator (parse_sum t p pc))
= fun #rrel #rel input pos ->
let h = HST.get () in
[@inline_let]
let _ = parse_sum_eq'' t p pc (bytes_of_slice_from h input (uint64_to_uint32 pos)) in
[@inline_let]
let _ = valid_facts (parse_sum t p pc) h input (uint64_to_uint32 pos) in
[@inline_let]
let _ = valid_facts p h input (uint64_to_uint32 pos) in
let len_after_tag = v input pos in
if is_error len_after_tag
then len_after_tag
else begin
let h1 = HST.get () in
let k' = p32 input (uint64_to_uint32 pos) in
[@inline_let]
let _ =
match maybe_enum_key_of_repr (sum_enum t) k' with
| Known k -> valid_facts (dsnd (pc k)) h input (uint64_to_uint32 len_after_tag)
| _ -> ()
in
v_payload k' input len_after_tag
end
#pop-options
inline_for_extraction
let validate_sum_aux_payload'
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (validator (dsnd (pc x)))))
(k: maybe_enum_key (sum_enum t))
: Tot (validate_sum_aux_payload_t t pc k)
= fun #rrel #rel input pos ->
match k with
| Known k ->
[@inline_let]
let _ = synth_sum_case_injective t k in
pc32 k input pos
// validate_synth (pc32 k) (synth_sum_case t k) () input pos
| _ -> validator_error_generic
inline_for_extraction
let validate_sum_aux_payload
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (validator (dsnd (pc x)))))
(destr: dep_maybe_enum_destr_t (sum_enum t) (validate_sum_aux_payload_t t pc))
(k: sum_repr_type t)
: Tot (validate_sum_aux_payload_t t pc (maybe_enum_key_of_repr (sum_enum t) k))
= destr (validate_sum_aux_payload_eq t pc) (validate_sum_aux_payload_if t pc) (fun _ _ -> ()) (fun _ _ _ _ -> ()) (validate_sum_aux_payload' t pc pc32) k
inline_for_extraction
let validate_sum
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(v: validator p)
(p32: leaf_reader p)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (validator (dsnd (pc x)))))
(destr: dep_maybe_enum_destr_t (sum_enum t) (validate_sum_aux_payload_t t pc))
: Tot (validator (parse_sum t p pc))
= validate_sum_aux t v p32 pc (validate_sum_aux_payload t pc pc32 destr)
module HS = FStar.HyperStack
#push-options "--z3rlimit 256 --z3cliopt smt.arith.nl=false --initial_ifuel 8 --max_ifuel 8 --initial_fuel 2 --max_fuel 2"
#restart-solver
let valid_sum_intro
(h: HS.mem)
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: Lemma
(requires (
valid (parse_enum_key p (sum_enum t)) h input pos /\ (
let k = contents (parse_enum_key p (sum_enum t)) h input pos in
valid (dsnd (pc k)) h input (get_valid_pos (parse_enum_key p (sum_enum t)) h input pos)
)))
(ensures (
let k = contents (parse_enum_key p (sum_enum t)) h input pos in
let pos_payload = get_valid_pos (parse_enum_key p (sum_enum t)) h input pos in
valid_content_pos
(parse_sum t p pc) h input pos
(synth_sum_case t k (contents (dsnd (pc k)) h input pos_payload))
(get_valid_pos (dsnd (pc k)) h input pos_payload)
))
= valid_facts (parse_enum_key p (sum_enum t)) h input pos;
let k = contents (parse_enum_key p (sum_enum t)) h input pos in
let pos_payload = get_valid_pos (parse_enum_key p (sum_enum t)) h input pos in
valid_facts (dsnd (pc k)) h input pos_payload;
valid_facts (parse_sum t p pc) h input pos;
parse_sum_eq t p pc (bytes_of_slice_from h input pos)
#pop-options
inline_for_extraction
let finalize_sum_case
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(s: serializer p)
(w: leaf_writer_strong s)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(destr: enum_repr_of_key'_t (sum_enum t))
(k: sum_key t)
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: HST.Stack unit
(requires (fun h ->
let len_tag = serialized_length (serialize_enum_key _ s (sum_enum t)) k in
U32.v pos + len_tag < 4294967296 /\ (
let pos_payload = pos `U32.add` U32.uint_to_t len_tag in
valid (dsnd (pc k)) h input pos_payload /\
writable input.base (U32.v pos) (U32.v pos_payload) h
)))
(ensures (fun h _ h' ->
let len_tag = serialized_length (serialize_enum_key _ s (sum_enum t)) k in
let pos_payload = pos `U32.add` U32.uint_to_t len_tag in
B.modifies (loc_slice_from_to input pos pos_payload) h h' /\
valid_content_pos (parse_sum t p pc) h' input pos (synth_sum_case t k (contents (dsnd (pc k)) h input pos_payload)) (get_valid_pos (dsnd (pc k)) h input pos_payload)
))
= let pos1 = write_enum_key w (sum_enum t) destr k input pos in
let h = HST.get () in
[@inline_let]
let _ = valid_sum_intro h t p pc input pos in
()
inline_for_extraction
let jump_sum_cases_aux
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(vc: ((x: sum_key t) -> Tot (jumper (dsnd (pc x)))))
(k: sum_key t)
: Tot (jumper (parse_sum_cases t pc k))
= [@inline_let]
let _ = synth_sum_case_injective t k in
jump_synth
(jump_weaken
(weaken_parse_cases_kind t pc)
(vc k)
()
)
(synth_sum_case t k)
()
inline_for_extraction
let jump_sum_cases_t
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot Type
= jumper (parse_sum_cases t pc k)
let jump_sum_cases_t_eq
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
(x y : jump_sum_cases_t t pc k)
: GTot Type0
= True
inline_for_extraction
let jump_sum_cases_t_if
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (if_combinator _ (jump_sum_cases_t_eq t pc k))
= fun cond (sv_true: cond_true cond -> Tot (jump_sum_cases_t t pc k)) (sv_false: cond_false cond -> Tot (jump_sum_cases_t t pc k)) #rrel #rel input pos ->
if cond
then sv_true () input pos
else sv_false () input pos
inline_for_extraction
let jump_sum_cases
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(vc: ((x: sum_key t) -> Tot (jumper (dsnd (pc x)))))
(destr: dep_enum_destr (sum_enum t) (jump_sum_cases_t t pc))
(k: sum_key t)
: Tot (jumper (parse_sum_cases t pc k))
= destr
_
(jump_sum_cases_t_if t pc)
(fun _ _ -> ())
(fun _ _ _ _ -> ())
(jump_sum_cases_aux t pc vc)
k
inline_for_extraction
let jump_sum_aux_payload_t
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
: Tot Type
= (#rrel: _) -> (#rel: _) ->
(input: slice rrel rel) ->
(pos: U32.t) ->
HST.Stack U32.t
(requires (fun h -> live_slice h input /\ U32.v pos <= U32.v input.len /\ (
match k with
| Unknown _ -> False
| Known k' -> valid (dsnd (pc k')) h input pos
)))
(ensures (fun h res h' ->
B.modifies B.loc_none h h' /\ (
match k with
| Unknown _ -> False
| Known k' ->
valid_pos (dsnd (pc k')) h input pos res
)))
let jump_sum_aux_payload_eq
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
: Tot (jump_sum_aux_payload_t t pc k -> jump_sum_aux_payload_t t pc k -> GTot Type0)
= fun _ _ -> True
inline_for_extraction
let jump_sum_aux_payload_if'
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
(cond: bool)
(ift: ((cond_true cond) -> Tot (jump_sum_aux_payload_t t pc k)))
(iff: ((cond_false cond) -> Tot (jump_sum_aux_payload_t t pc k)))
: Tot (jump_sum_aux_payload_t t pc k)
= fun #rrel #rel input pos ->
if cond
then begin
(ift () <: jump_sum_aux_payload_t t pc k) input pos
end else
(iff () <: jump_sum_aux_payload_t t pc k) input pos
inline_for_extraction
let jump_sum_aux_payload_if
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
: Tot (if_combinator _ (jump_sum_aux_payload_eq t pc k))
= jump_sum_aux_payload_if' t pc k
let parse_sum_eq3
(#kt: parser_kind)
(t: sum)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(input: bytes)
(k' : sum_repr_type t)
(consumed_k: consumed_length input)
: Lemma
(requires (Some? (parse (parse_sum t p pc) input) /\ parse p input == Some (k', consumed_k)))
(ensures (
let input_k = Seq.slice input consumed_k (Seq.length input) in
let k = maybe_enum_key_of_repr (sum_enum t) k' in
begin match k with
| Known k ->
Some? (parse (dsnd (pc k)) input_k)
| _ -> False
end
))
= parse_sum_eq'' t p pc input
let parse_sum_eq4
(#kt: parser_kind)
(t: sum)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(input: bytes)
(k' : sum_repr_type t)
(consumed_k: consumed_length input)
(consumed_payload: nat)
: Lemma
(requires (Some? (parse (parse_sum t p pc) input) /\ parse p input == Some (k', consumed_k) /\ (
let input_k = Seq.slice input consumed_k (Seq.length input) in
let k = maybe_enum_key_of_repr (sum_enum t) k' in
begin match k with
| Known k ->
Some? (parse (dsnd (pc k)) input_k) /\ (
let Some (_, consumed_payload') = parse (dsnd (pc k)) input_k in
consumed_payload' == consumed_payload
)
| _ -> False
end
)))
(ensures (
let Some (_, consumed) = parse (parse_sum t p pc) input in
consumed == consumed_k + consumed_payload
))
= parse_sum_eq'' t p pc input
#push-options "--z3rlimit 16"
let valid_sum_elim
(h: HS.mem)
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(#rrel: _) (#rel: _)
(input: slice rrel rel)
(pos: U32.t)
: Lemma
(requires (
valid (parse_sum t p pc) h input pos
))
(ensures (
valid p h input pos /\ (
let pos_payload = get_valid_pos p h input pos in
let k' = maybe_enum_key_of_repr (sum_enum t) (contents p h input pos) in
match k' with
| Known k ->
k == sum_tag_of_data t (contents (parse_sum t p pc) h input pos) /\
valid (dsnd (pc k)) h input pos_payload /\
valid_pos
(parse_sum t p pc) h input pos
(get_valid_pos (dsnd (pc k)) h input pos_payload)
| _ -> False
)))
= let sinput = bytes_of_slice_from h input pos in
let _ = parse_sum_eq'' t p pc sinput in
[@inline_let]
let _ = valid_facts (parse_sum t p pc) h input pos in
let Some (k', consumed_k) = parse p sinput in
let pos_after_tag = U32.uint_to_t (U32.v pos + consumed_k) in
[@inline_let]
let _ = valid_facts p h input pos in
assert (valid_content_pos p h input pos k' pos_after_tag);
match maybe_enum_key_of_repr (sum_enum t) k' with
| Known k -> valid_facts (dsnd (pc k)) h input pos_after_tag
| _ -> ()
#pop-options
let valid_sum_elim_tag
(h: HS.mem)
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: Lemma
(requires (
valid (parse_sum t p pc) h input pos
))
(ensures (
valid (parse_enum_key p (sum_enum t)) h input pos /\
contents (parse_enum_key p (sum_enum t)) h input pos == sum_tag_of_data t (contents (parse_sum t p pc) h input pos)
))
= let _ = parse_sum_eq' t p pc (bytes_of_slice_from h input pos) in
let _ = valid_facts (parse_sum t p pc) h input pos in
let _ = valid_facts (parse_enum_key p (sum_enum t)) h input pos in
()
inline_for_extraction
let read_sum_tag
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(p32: leaf_reader p)
(destr: dep_maybe_enum_destr_t (sum_enum t) (read_enum_key_t (sum_enum t)))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: HST.Stack (sum_key t)
(requires (fun h ->
valid (parse_sum t p pc) h input pos
))
(ensures (fun h res h' ->
B.modifies B.loc_none h h' /\
res == sum_tag_of_data t (contents (parse_sum t p pc) h input pos)
))
= let h = HST.get () in
[@inline_let] let _ = valid_sum_elim_tag h t p pc input pos in
read_enum_key p32 (sum_enum t) destr input pos
inline_for_extraction
let jump_sum_aux
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(v: jumper p)
(p32: leaf_reader p)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(v_payload: ((k: sum_repr_type t)) -> Tot (jump_sum_aux_payload_t t pc (maybe_enum_key_of_repr (sum_enum t) k)))
: Tot (jumper (parse_sum t p pc))
= fun #rrel #rel input pos ->
let h = HST.get () in
[@inline_let]
let _ = valid_sum_elim h t p pc input pos in
let pos_after_tag = v input pos in
let k' = p32 input pos in
v_payload k' input pos_after_tag
inline_for_extraction
let jump_sum_aux_payload'
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (jumper (dsnd (pc x)))))
(k: maybe_enum_key (sum_enum t))
: Tot (jump_sum_aux_payload_t t pc k)
= fun #rrel #rel input pos ->
match k with
| Known k ->
[@inline_let]
let _ = synth_sum_case_injective t k in
pc32 k input pos
| _ -> 0ul // dummy, but we MUST NOT remove this branch, otherwise extraction fails
inline_for_extraction
let jump_sum_aux_payload
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (jumper (dsnd (pc x)))))
(destr: dep_maybe_enum_destr_t (sum_enum t) (jump_sum_aux_payload_t t pc))
(k: sum_repr_type t)
: Tot (jump_sum_aux_payload_t t pc (maybe_enum_key_of_repr (sum_enum t) k))
= destr (jump_sum_aux_payload_eq t pc) (jump_sum_aux_payload_if t pc) (fun _ _ -> ()) (fun _ _ _ _ -> ()) (jump_sum_aux_payload' t pc pc32) k
inline_for_extraction
let jump_sum
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(v: jumper p)
(p32: leaf_reader p)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (jumper (dsnd (pc x)))))
(destr: dep_maybe_enum_destr_t (sum_enum t) (jump_sum_aux_payload_t t pc))
: Tot (jumper (parse_sum t p pc))
= jump_sum_aux t v p32 pc (jump_sum_aux_payload t pc pc32 destr)
inline_for_extraction
let read_sum_cases'
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (leaf_reader (dsnd (pc x)))))
(k: sum_key t)
: Tot (leaf_reader (parse_sum_cases' t pc k))
= [@inline_let]
let _ = synth_sum_case_injective t k in
read_synth'
(dsnd (pc k))
(synth_sum_case t k)
(pc32 k)
()
inline_for_extraction
let read_sum_cases_t
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot Type
= leaf_reader (parse_sum_cases' t pc k)
let read_sum_cases_t_eq
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
(x y : read_sum_cases_t t pc k)
: GTot Type0
= True
inline_for_extraction
let read_sum_cases_t_if
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (if_combinator _ (read_sum_cases_t_eq t pc k))
= fun cond (sv_true: cond_true cond -> Tot (read_sum_cases_t t pc k)) (sv_false: cond_false cond -> Tot (read_sum_cases_t t pc k)) #_ #_ input pos ->
if cond
then (sv_true () input pos)
else (sv_false () input pos)
inline_for_extraction
let read_sum_cases
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (leaf_reader (dsnd (pc x)))))
(destr: dep_enum_destr (sum_enum t) (read_sum_cases_t t pc))
(k: sum_key t)
: Tot (leaf_reader (parse_sum_cases' t pc k))
= destr
_
(read_sum_cases_t_if t pc)
(fun _ _ -> ())
(fun _ _ _ _ -> ())
(read_sum_cases' t pc pc32)
k
#push-options "--z3rlimit 32"
inline_for_extraction
let read_sum
(#kt: parser_kind)
(t: sum)
(p: parser kt (sum_repr_type t))
(p32: leaf_reader (parse_enum_key p (sum_enum t)))
(j: jumper p)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (leaf_reader (dsnd (pc x)))))
(destr: dep_enum_destr (sum_enum t) (read_sum_cases_t t pc))
: Tot (leaf_reader (parse_sum t p pc))
=
fun #_ #_ input pos ->
let h = HST.get () in
valid_facts (parse_sum t p pc) h input pos;
parse_sum_eq' t p pc (bytes_of_slice_from h input pos);
valid_facts (parse_enum_key p (sum_enum t)) h input pos;
let k = p32 input pos in
let pos' = jump_enum_key j (sum_enum t) input pos in
valid_facts (parse_sum_cases' t pc k) h input pos' ;
read_sum_cases t pc pc32 destr k input pos'
#pop-options
inline_for_extraction
let serialize32_sum_cases_t
(t: sum)
(#pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(sc: ((x: sum_key t) -> Tot (serializer (dsnd (pc x)))))
(k: sum_key t)
: Tot Type
= serializer32 (serialize_sum_cases t pc sc k)
let serialize32_sum_cases_t_eq
(t: sum)
(#pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(sc: ((x: sum_key t) -> Tot (serializer (dsnd (pc x)))))
(k: sum_key t)
(x y: serialize32_sum_cases_t t sc k)
: GTot Type0
= True
inline_for_extraction
let serialize32_sum_cases_t_if
(t: sum)
(#pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(sc: ((x: sum_key t) -> Tot (serializer (dsnd (pc x)))))
(k: sum_key t)
: Tot (if_combinator _ (serialize32_sum_cases_t_eq t sc k))
= fun cond (sv_true: (cond_true cond -> Tot (serialize32_sum_cases_t t sc k))) (sv_false: (cond_false cond -> Tot (serialize32_sum_cases_t t sc k))) x #rrel #rel b pos ->
if cond
then (sv_true () x b pos)
else (sv_false () x b pos)
inline_for_extraction
let serialize32_sum_cases_aux
(t: sum)
(#pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(sc: ((x: sum_key t) -> Tot (serializer (dsnd (pc x)))))
(sc32: ((x: sum_key t) -> Tot (serializer32 (sc x))))
(k: sum_key t)
: Tot (serializer32 (serialize_sum_cases t pc sc k))
= fun x #rrel #rel b pos ->
[@inline_let] let _ =
Classical.forall_intro (parse_sum_cases_eq' t pc k);
synth_sum_case_injective t k;
synth_sum_case_inverse t k
in
serialize32_synth
(sc32 k)
(synth_sum_case t k)
(synth_sum_case_recip t k)
(fun x -> synth_sum_case_recip t k x)
()
x
b
pos
inline_for_extraction
let serialize32_sum_cases
(t: sum)
(#pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(sc: ((x: sum_key t) -> Tot (serializer (dsnd (pc x)))))
(sc32: ((x: sum_key t) -> Tot (serializer32 (sc x))))
(destr: dep_enum_destr (sum_enum t) (serialize32_sum_cases_t t sc))
(k: sum_key t)
: Tot (serializer32 (serialize_sum_cases t pc sc k))
= destr
_
(serialize32_sum_cases_t_if t sc)
(fun _ _ -> ())
(fun _ _ _ _ -> ())
(serialize32_sum_cases_aux t sc sc32)
k
inline_for_extraction
let serialize32_sum
(#kt: parser_kind)
(t: sum)
(#p: parser kt (sum_repr_type t))
(s: serializer p {kt.parser_kind_subkind == Some ParserStrong})
(s32: serializer32 (serialize_enum_key _ s (sum_enum t)))
(#pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(sc: ((x: sum_key t) -> Tot (serializer (dsnd (pc x)))))
(sc32: ((x: sum_key t) -> Tot (serializer32 (sc x))))
(destr: dep_enum_destr (sum_enum t) (serialize32_sum_cases_t t sc))
: Tot (serializer32 (serialize_sum t s sc))
= fun x #rrel #rel b pos ->
serialize_sum_eq t s sc x;
let tg = sum_tag_of_data t x in
serialize32_nondep_then_aux s32 (serialize32_sum_cases t sc sc32 destr tg) tg x b pos
let clens_sum_tag
(s: sum)
: Tot (clens (sum_type s) (sum_key s))
= {
clens_cond = (fun _ -> True);
clens_get = sum_tag_of_data s;
}
let gaccessor_sum_tag
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
: Tot (gaccessor (parse_sum t p pc) (parse_enum_key p (sum_enum t)) (clens_sum_tag t))
= gaccessor_tagged_union_tag
(parse_enum_key p (sum_enum t))
(sum_tag_of_data t)
(parse_sum_cases t pc)
inline_for_extraction
let accessor_sum_tag
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
: Tot (accessor (gaccessor_sum_tag t p pc))
= accessor_tagged_union_tag
(parse_enum_key p (sum_enum t))
(sum_tag_of_data t)
(parse_sum_cases t pc)
let clens_sum_payload
(s: sum)
(k: sum_key s)
: Tot (clens (sum_type s) (sum_type_of_tag s k))
= {
clens_cond = (fun (x: sum_type s) -> sum_tag_of_data s x == k);
clens_get = (fun (x: sum_type s) -> synth_sum_case_recip s k x <: Ghost (sum_type_of_tag s k) (requires (sum_tag_of_data s x == k)) (ensures (fun _ -> True)));
}
#push-options "--z3rlimit 32"
let gaccessor_clens_sum_payload'
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (gaccessor' (parse_sum t p pc) (dsnd (pc k)) (clens_sum_payload t k))
= fun (input: bytes) ->
parse_sum_eq'' t p pc input;
let res =
match parse p input with
| Some (_, consumed) ->
synth_sum_case_inverse t k;
synth_sum_case_injective t k;
synth_injective_synth_inverse_synth_inverse_recip (synth_sum_case t k) (synth_sum_case_recip t k) ();
(consumed)
| _ -> 0 // dummy
in
(res <: (res: _ { gaccessor_post' (parse_sum t p pc) (dsnd (pc k)) (clens_sum_payload t k) input res } ))
#push-options "--z3rlimit 64"
let gaccessor_clens_sum_payload_injective
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
(sl sl' : bytes)
: Lemma
(requires (
gaccessor_pre (parse_sum t p pc) (dsnd (pc k)) (clens_sum_payload t k) sl /\
gaccessor_pre (parse_sum t p pc) (dsnd (pc k)) (clens_sum_payload t k) sl' /\
injective_precond (parse_sum t p pc) sl sl'
))
(ensures (gaccessor_clens_sum_payload' t p pc k sl == gaccessor_clens_sum_payload' t p pc k sl'))
= parse_sum_eq'' t p pc sl;
parse_sum_eq'' t p pc sl' ;
parse_injective (parse_sum t p pc) sl sl' ;
parse_injective p sl sl'
#pop-options
let gaccessor_clens_sum_payload_no_lookahead
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
(sl sl' : bytes)
: Lemma
(requires (
(parse_sum_kind kt t pc).parser_kind_subkind == Some ParserStrong /\
gaccessor_pre (parse_sum t p pc) (dsnd (pc k)) (clens_sum_payload t k) sl /\
gaccessor_pre (parse_sum t p pc) (dsnd (pc k)) (clens_sum_payload t k) sl' /\
no_lookahead_on_precond (parse_sum t p pc) sl sl'
))
(ensures (gaccessor_clens_sum_payload' t p pc k sl == gaccessor_clens_sum_payload' t p pc k sl'))
= parse_sum_eq'' t p pc sl;
parse_sum_eq'' t p pc sl' ;
parse_strong_prefix (parse_sum t p pc) sl sl' ;
parse_injective p sl sl'
let gaccessor_clens_sum_payload
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (gaccessor (parse_sum t p pc) (dsnd (pc k)) (clens_sum_payload t k))
= Classical.forall_intro_2 (fun x -> Classical.move_requires (gaccessor_clens_sum_payload_injective t p pc k x));
Classical.forall_intro_2 (fun x -> Classical.move_requires (gaccessor_clens_sum_payload_no_lookahead t p pc k x));
gaccessor_prop_equiv (parse_sum t p pc) (dsnd (pc k)) (clens_sum_payload t k) (gaccessor_clens_sum_payload' t p pc k);
gaccessor_clens_sum_payload' t p pc k
inline_for_extraction
let accessor_clens_sum_payload'
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(j: jumper p)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: HST.Stack U32.t
(requires (fun h ->
valid (parse_sum t p pc) h input pos /\
(clens_sum_payload t k).clens_cond (contents (parse_sum t p pc) h input pos)
))
(ensures (fun h pos' h' ->
B.modifies B.loc_none h h' /\
pos' == slice_access h (gaccessor_clens_sum_payload t p pc k) input pos
))
=
let h = HST.get () in
[@inline_let]
let _ =
let pos' = get_valid_pos (parse_sum t p pc) h input pos in
let large = bytes_of_slice_from h input pos in
slice_access_eq h (gaccessor_clens_sum_payload t p pc k) input pos;
valid_facts (parse_sum t p pc) h input pos;
parse_sum_eq'' t p pc large;
valid_facts p h input pos
in
j input pos
#pop-options
inline_for_extraction
let accessor_clens_sum_payload
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(j: jumper p)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (accessor (gaccessor_clens_sum_payload t p pc k))
= fun #rrel #rel -> accessor_clens_sum_payload' t j pc k #rrel #rel
let clens_sum_cases_payload
(s: sum)
(k: sum_key s)
: Tot (clens (sum_cases s k) (sum_type_of_tag s k))
= {
clens_cond = (fun (x: sum_cases s k) -> True);
clens_get = (fun (x: sum_cases s k) -> synth_sum_case_recip s k x <: Ghost (sum_type_of_tag s k) (requires (True)) (ensures (fun _ -> True)));
}
let gaccessor_clens_sum_cases_payload
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (gaccessor (parse_sum_cases' t pc k) (dsnd (pc k)) (clens_sum_cases_payload t k))
= synth_sum_case_injective t k;
synth_sum_case_inverse t k;
synth_injective_synth_inverse_synth_inverse_recip (synth_sum_case t k) (synth_sum_case_recip t k) ();
gaccessor_ext
(gaccessor_synth (dsnd (pc k)) (synth_sum_case t k) (synth_sum_case_recip t k) ())
(clens_sum_cases_payload t k)
()
inline_for_extraction
let accessor_clens_sum_cases_payload
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (accessor (gaccessor_clens_sum_cases_payload t pc k))
= [@inline_let]
let _ =
synth_sum_case_injective t k;
synth_sum_case_inverse t k;
synth_injective_synth_inverse_synth_inverse_recip (synth_sum_case t k) (synth_sum_case_recip t k) ()
in
accessor_ext
(accessor_synth (dsnd (pc k)) (synth_sum_case t k) (synth_sum_case_recip t k) ())
(clens_sum_cases_payload t k)
()
inline_for_extraction
let validate_dsum_cases_t
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(#k: parser_kind)
(g: parser k (dsum_type_of_unknown_tag s))
(x: dsum_key s)
: Tot Type
= validator (parse_dsum_cases' s f g x)
let validate_dsum_cases_eq
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(#k: parser_kind)
(g: parser k (dsum_type_of_unknown_tag s))
(x: dsum_key s)
(v1 v2 : validate_dsum_cases_t s f g x)
: GTot Type0
= True
inline_for_extraction
let validate_dsum_cases_if'
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(#k: parser_kind)
(g: parser k (dsum_type_of_unknown_tag s))
(x: dsum_key s)
(cond: bool)
(ift: (cond_true cond -> Tot (validate_dsum_cases_t s f g x)))
(iff: (cond_false cond -> Tot (validate_dsum_cases_t s f g x)))
: Tot (validate_dsum_cases_t s f g x)
= fun #rrel #rel input len ->
if cond
then (ift () <: validate_dsum_cases_t s f g x) input len
else (iff () <: validate_dsum_cases_t s f g x) input len
inline_for_extraction
let validate_dsum_cases_if
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(#k: parser_kind)
(g: parser k (dsum_type_of_unknown_tag s))
(x: dsum_key s)
: Tot (if_combinator _ (validate_dsum_cases_eq s f g x))
= validate_dsum_cases_if' s f g x
inline_for_extraction
let validate_dsum_cases'
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(f' : (x: dsum_known_key s) -> Tot (validator (dsnd (f x))))
(#k: parser_kind)
(#g: parser k (dsum_type_of_unknown_tag s))
(g' : validator g)
(x: dsum_key s)
: Tot (validate_dsum_cases_t s f g x)
= [@inline_let]
let _ = synth_dsum_case_injective s x in
match x with
| Known x' -> validate_synth (f' x') (synth_dsum_case s (Known x')) () <: validator (parse_dsum_cases' s f g x)
| Unknown x' -> validate_synth g' (synth_dsum_case s (Unknown x')) () <: validator (parse_dsum_cases' s f g x)
inline_for_extraction
let validate_dsum_cases'_destr
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(f' : (x: dsum_known_key s) -> Tot (validator (dsnd (f x))))
(#k: parser_kind)
(#g: parser k (dsum_type_of_unknown_tag s))
(g' : validator g)
(destr: dep_enum_destr _ (fun k -> validate_dsum_cases_t s f g (Known k)))
(x: dsum_key s)
: Tot (validate_dsum_cases_t s f g x)
= fun #rrel #rel input pos ->
match x with
| Known k ->
destr
_
(fun k -> validate_dsum_cases_if s f g (Known k))
(fun _ _ -> ())
(fun _ _ _ _ -> ())
(fun k -> validate_dsum_cases' s f f' g' (Known k))
k
input
pos
| Unknown r -> validate_dsum_cases' s f f' g' (Unknown r) input pos
inline_for_extraction
let validate_dsum_cases
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(f' : (x: dsum_known_key s) -> Tot (validator (dsnd (f x))))
(#k: parser_kind)
(#g: parser k (dsum_type_of_unknown_tag s))
(g' : validator g)
(destr: dep_enum_destr _ (fun k -> validate_dsum_cases_t s f g (Known k)))
(x: dsum_key s)
: Tot (validator (parse_dsum_cases s f g x))
= fun #rrel #rel input pos ->
let h = HST.get () in
[@inline_let]
let _ =
valid_facts (parse_dsum_cases' s f g x) h input (uint64_to_uint32 pos);
valid_facts (parse_dsum_cases s f g x) h input (uint64_to_uint32 pos);
parse_dsum_cases_eq' s f g x (bytes_of_slice_from h input (uint64_to_uint32 pos))
in
validate_dsum_cases'_destr s f f' g' destr x input pos
#push-options "--z3rlimit 40"
inline_for_extraction
let validate_dsum
(#kt: parser_kind)
(t: dsum)
(#p: parser kt (dsum_repr_type t))
(v: validator p)
(p32: leaf_reader p)
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(f32: (x: dsum_known_key t) -> Tot (validator (dsnd (f x))))
(#k': parser_kind)
(#g: parser k' (dsum_type_of_unknown_tag t))
(g32: validator g)
(destr: dep_maybe_enum_destr_t (dsum_enum t) (validate_dsum_cases_t t f g))
: Tot (validator (parse_dsum t p f g))
= fun #rrel #rel input pos ->
let h = HST.get () in
[@inline_let]
let _ = parse_dsum_eq' t p f g (bytes_of_slice_from h input (uint64_to_uint32 pos)) in
[@inline_let]
let _ = valid_facts (parse_dsum t p f g) h input (uint64_to_uint32 pos) in
[@inline_let]
let _ = valid_facts p h input (uint64_to_uint32 pos) in
let pos_after_tag = v input pos in
if is_error pos_after_tag
then pos_after_tag
else
let tg = p32 input (uint64_to_uint32 pos) in
[@inline_let]
let _ = valid_facts (parse_dsum_cases' t f g (maybe_enum_key_of_repr (dsum_enum t) tg)) h input (uint64_to_uint32 pos_after_tag) in
destr (validate_dsum_cases_eq t f g) (validate_dsum_cases_if t f g) (fun _ _ -> ()) (fun _ _ _ _ -> ()) (validate_dsum_cases' t f f32 g32) tg input pos_after_tag
#pop-options
#reset-options "--z3rlimit 64 --z3cliopt smt.arith.nl=false --initial_ifuel 8 --max_ifuel 8 --initial_fuel 2 --max_fuel 2"
let valid_dsum_intro_known
(h: HS.mem)
(t: dsum)
(#kt: parser_kind)
(p: parser kt (dsum_repr_type t))
(f: ((x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x))))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: Lemma
(requires (
valid (parse_maybe_enum_key p (dsum_enum t)) h input pos /\ (
let k' = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
Known? k' /\ (
let Known k = k' in
valid (dsnd (f k)) h input (get_valid_pos (parse_maybe_enum_key p (dsum_enum t)) h input pos)
))))
(ensures (
let Known k = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
let pos_payload = get_valid_pos (parse_maybe_enum_key p (dsum_enum t)) h input pos in
valid_content_pos
(parse_dsum t p f g) h input pos
(synth_dsum_case t (Known k) (contents (dsnd (f k)) h input pos_payload))
(get_valid_pos (dsnd (f k)) h input pos_payload)
))
= valid_facts (parse_maybe_enum_key p (dsum_enum t)) h input pos;
let Known k = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
let pos_payload = get_valid_pos (parse_maybe_enum_key p (dsum_enum t)) h input pos in
valid_facts (dsnd (f k)) h input pos_payload;
valid_facts (parse_dsum t p f g) h input pos;
parse_dsum_eq t p f g (bytes_of_slice_from h input pos)
let valid_dsum_intro_unknown
(h: HS.mem)
(t: dsum)
(#kt: parser_kind)
(p: parser kt (dsum_repr_type t))
(f: ((x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x))))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: Lemma
(requires (
valid (parse_maybe_enum_key p (dsum_enum t)) h input pos /\ (
let k' = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
Unknown? k' /\
valid g h input (get_valid_pos (parse_maybe_enum_key p (dsum_enum t)) h input pos)
)))
(ensures (
let Unknown r = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
let pos_payload = get_valid_pos (parse_maybe_enum_key p (dsum_enum t)) h input pos in
valid_content_pos
(parse_dsum t p f g) h input pos
(synth_dsum_case t (Unknown r) (contents g h input pos_payload))
(get_valid_pos g h input pos_payload)
))
= valid_facts (parse_maybe_enum_key p (dsum_enum t)) h input pos;
let Unknown r = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
let pos_payload = get_valid_pos (parse_maybe_enum_key p (dsum_enum t)) h input pos in
valid_facts g h input pos_payload;
valid_facts (parse_dsum t p f g) h input pos;
parse_dsum_eq t p f g (bytes_of_slice_from h input pos)
#reset-options
inline_for_extraction
let finalize_dsum_case_known
(t: dsum)
(#kt: parser_kind)
(#p: parser kt (dsum_repr_type t))
(s: serializer p)
(w: leaf_writer_strong s)
(f: ((x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x))))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
(destr: enum_repr_of_key'_t (dsum_enum t))
(k: dsum_known_key t)
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: HST.Stack unit
(requires (fun h ->
let len_tag = serialized_length (serialize_enum_key _ s (dsum_enum t)) k in
U32.v pos + len_tag < 4294967296 /\ (
let pos_payload = pos `U32.add` U32.uint_to_t len_tag in
valid (dsnd (f k)) h input pos_payload /\
writable input.base (U32.v pos) (U32.v pos_payload) h
)))
(ensures (fun h _ h' ->
let len_tag = serialized_length (serialize_enum_key _ s (dsum_enum t)) k in
let pos_payload = pos `U32.add` U32.uint_to_t len_tag in
B.modifies (loc_slice_from_to input pos pos_payload) h h' /\
valid_content_pos (parse_dsum t p f g) h' input pos (synth_dsum_case t (Known k) (contents (dsnd (f k)) h input pos_payload)) (get_valid_pos (dsnd (f k)) h input pos_payload)
))
= let pos1 = write_enum_key w (dsum_enum t) destr k input pos in
let h = HST.get () in
[@inline_let]
let _ =
valid_facts (parse_enum_key p (dsum_enum t)) h input pos;
valid_facts (parse_maybe_enum_key p (dsum_enum t)) h input pos;
let sq = bytes_of_slice_from h input pos in
parse_enum_key_eq p (dsum_enum t) sq;
parse_maybe_enum_key_eq p (dsum_enum t) sq;
valid_dsum_intro_known h t p f g input pos
in
()
inline_for_extraction
let finalize_dsum_case_unknown
(t: dsum)
(#kt: parser_kind)
(#p: parser kt (dsum_repr_type t))
(s: serializer p)
(w: leaf_writer_strong s)
(f: ((x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x))))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
(r: unknown_enum_repr (dsum_enum t))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: HST.Stack unit
(requires (fun h ->
let len_tag = serialized_length s r in
U32.v pos + len_tag < 4294967296 /\ (
let pos_payload = pos `U32.add` U32.uint_to_t len_tag in
valid g h input pos_payload /\
writable input.base (U32.v pos) (U32.v pos_payload) h
)))
(ensures (fun h _ h' ->
let len_tag = serialized_length s r in
let pos_payload = pos `U32.add` U32.uint_to_t len_tag in
B.modifies (loc_slice_from_to input pos pos_payload) h h' /\
valid_content_pos (parse_dsum t p f g) h' input pos (synth_dsum_case t (Unknown r) (contents g h input pos_payload)) (get_valid_pos g h input pos_payload)
))
= let pos1 = w r input pos in
let h = HST.get () in
[@inline_let]
let _ =
valid_facts (parse_maybe_enum_key p (dsum_enum t)) h input pos;
valid_facts p h input pos;
let sq = bytes_of_slice_from h input pos in
parse_maybe_enum_key_eq p (dsum_enum t) sq;
valid_dsum_intro_unknown h t p f g input pos
in
()
let valid_dsum_elim_tag
(h: HS.mem)
(t: dsum)
(#kt: parser_kind)
(p: parser kt (dsum_repr_type t))
(f: ((x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x))))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: Lemma
(requires (
valid (parse_dsum t p f g) h input pos
))
(ensures (
valid (parse_maybe_enum_key p (dsum_enum t)) h input pos /\
contents (parse_maybe_enum_key p (dsum_enum t)) h input pos == dsum_tag_of_data t (contents (parse_dsum t p f g) h input pos)
))
= let _ = parse_dsum_eq_ t p f g (bytes_of_slice_from h input pos) in
let _ = valid_facts (parse_dsum t p f g) h input pos in
let _ = valid_facts (parse_maybe_enum_key p (dsum_enum t)) h input pos in
()
inline_for_extraction
let read_dsum_tag
(t: dsum)
(#kt: parser_kind)
(#p: parser kt (dsum_repr_type t))
(p32: leaf_reader p)
(destr: maybe_enum_destr_t (maybe_enum_key (dsum_enum t)) (dsum_enum t))
(f: ((x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x))))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: HST.Stack (dsum_key t)
(requires (fun h ->
valid (parse_dsum t p f g) h input pos
))
(ensures (fun h res h' ->
B.modifies B.loc_none h h' /\
res == dsum_tag_of_data t (contents (parse_dsum t p f g) h input pos)
))
= let h = HST.get () in
[@inline_let] let _ = valid_dsum_elim_tag h t p f g input pos in
read_maybe_enum_key p32 (dsum_enum t) destr input pos
#push-options "--z3rlimit 32"
let valid_dsum_elim_known
(h: HS.mem)
(t: dsum)
(#kt: parser_kind)
(p: parser kt (dsum_repr_type t))
(f: ((x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x))))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: Lemma
(requires (
valid (parse_dsum t p f g) h input pos /\
Known? (dsum_tag_of_data t (contents (parse_dsum t p f g) h input pos))
))
(ensures (
valid (parse_maybe_enum_key p (dsum_enum t)) h input pos /\ (
let k' = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
let pos_payload = get_valid_pos (parse_maybe_enum_key p (dsum_enum t)) h input pos in
Known? k' /\ (
let Known k = k' in
valid (dsnd (f k)) h input pos_payload /\
valid_content_pos
(parse_dsum t p f g) h input pos
(synth_dsum_case t (Known k) (contents (dsnd (f k)) h input pos_payload))
(get_valid_pos (dsnd (f k)) h input pos_payload)
))))
=
valid_facts (parse_dsum t p f g) h input pos;
parse_dsum_eq t p f g (bytes_of_slice_from h input pos);
valid_facts (parse_maybe_enum_key p (dsum_enum t)) h input pos;
let Known k = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
let pos_payload = get_valid_pos (parse_maybe_enum_key p (dsum_enum t)) h input pos in
valid_facts (dsnd (f k)) h input pos_payload
#pop-options
let valid_dsum_elim_unknown
(h: HS.mem)
(t: dsum)
(#kt: parser_kind)
(p: parser kt (dsum_repr_type t))
(f: ((x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x))))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: Lemma
(requires (
valid (parse_dsum t p f g) h input pos /\
Unknown? (dsum_tag_of_data t (contents (parse_dsum t p f g) h input pos))
))
(ensures (
valid (parse_maybe_enum_key p (dsum_enum t)) h input pos /\ (
let k' = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
let pos_payload = get_valid_pos (parse_maybe_enum_key p (dsum_enum t)) h input pos in
Unknown? k' /\ (
let Unknown r = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
valid g h input pos_payload /\
valid_content_pos
(parse_dsum t p f g) h input pos
(synth_dsum_case t (Unknown r) (contents g h input pos_payload))
(get_valid_pos g h input pos_payload)
))))
=
valid_facts (parse_dsum t p f g) h input pos;
parse_dsum_eq t p f g (bytes_of_slice_from h input pos);
valid_facts (parse_maybe_enum_key p (dsum_enum t)) h input pos;
let Unknown r = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
let pos_payload = get_valid_pos (parse_maybe_enum_key p (dsum_enum t)) h input pos in
valid_facts g h input pos_payload
inline_for_extraction
let jump_dsum_cases_t
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(#k: parser_kind)
(g: parser k (dsum_type_of_unknown_tag s))
(x: dsum_key s)
: Tot Type
= jumper (parse_dsum_cases' s f g x)
let jump_dsum_cases_eq
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(#k: parser_kind)
(g: parser k (dsum_type_of_unknown_tag s))
(x: dsum_key s)
(v1 v2 : jump_dsum_cases_t s f g x)
: GTot Type0
= True
inline_for_extraction
let jump_dsum_cases_if'
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(#k: parser_kind)
(g: parser k (dsum_type_of_unknown_tag s))
(x: dsum_key s)
(cond: bool)
(ift: (cond_true cond -> Tot (jump_dsum_cases_t s f g x)))
(iff: (cond_false cond -> Tot (jump_dsum_cases_t s f g x)))
: Tot (jump_dsum_cases_t s f g x)
= fun #rrel #rel input len ->
if cond
then (ift () <: jump_dsum_cases_t s f g x) input len
else (iff () <: jump_dsum_cases_t s f g x) input len
inline_for_extraction
let jump_dsum_cases_if
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(#k: parser_kind)
(g: parser k (dsum_type_of_unknown_tag s))
(x: dsum_key s)
: Tot (if_combinator _ (jump_dsum_cases_eq s f g x))
= jump_dsum_cases_if' s f g x
inline_for_extraction
let jump_dsum_cases'
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(f' : (x: dsum_known_key s) -> Tot (jumper (dsnd (f x))))
(#k: parser_kind)
(#g: parser k (dsum_type_of_unknown_tag s))
(g' : jumper g)
(x: dsum_key s)
: Tot (jump_dsum_cases_t s f g x)
= synth_dsum_case_injective s x;
match x with
| Known x' -> jump_synth (f' x') (synth_dsum_case s (Known x')) () <: jumper (parse_dsum_cases' s f g x)
| Unknown x' -> jump_synth g' (synth_dsum_case s (Unknown x')) () <: jumper (parse_dsum_cases' s f g x)
inline_for_extraction
let jump_dsum_cases'_destr
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(f' : (x: dsum_known_key s) -> Tot (jumper (dsnd (f x))))
(#k: parser_kind)
(#g: parser k (dsum_type_of_unknown_tag s))
(g' : jumper g)
(destr: dep_enum_destr _ (fun k -> jump_dsum_cases_t s f g (Known k)))
(x: dsum_key s)
: Tot (jump_dsum_cases_t s f g x)
= fun #rrel #rel input pos ->
match x with
| Known k ->
destr
_
(fun k -> jump_dsum_cases_if s f g (Known k))
(fun _ _ -> ())
(fun _ _ _ _ -> ())
(fun k -> jump_dsum_cases' s f f' g' (Known k))
k
input
pos
| Unknown r -> jump_dsum_cases' s f f' g' (Unknown r) input pos
inline_for_extraction
let jump_dsum_cases
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(f' : (x: dsum_known_key s) -> Tot (jumper (dsnd (f x))))
(#k: parser_kind)
(#g: parser k (dsum_type_of_unknown_tag s))
(g' : jumper g)
(destr: dep_enum_destr _ (fun k -> jump_dsum_cases_t s f g (Known k)))
(x: dsum_key s)
: Tot (jumper (parse_dsum_cases s f g x))
= fun #rrel #rel input pos ->
let h = HST.get () in
[@inline_let]
let _ =
valid_facts (parse_dsum_cases' s f g x) h input pos;
valid_facts (parse_dsum_cases s f g x) h input pos;
parse_dsum_cases_eq' s f g x (bytes_of_slice_from h input pos)
in
jump_dsum_cases'_destr s f f' g' destr x input pos
#push-options "--z3rlimit 16"
inline_for_extraction
let jump_dsum
(#kt: parser_kind)
(t: dsum)
(#p: parser kt (dsum_repr_type t))
(v: jumper p)
(p32: leaf_reader p)
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(f32: (x: dsum_known_key t) -> Tot (jumper (dsnd (f x))))
(#k': parser_kind)
(#g: parser k' (dsum_type_of_unknown_tag t))
(g32: jumper g)
(destr: dep_maybe_enum_destr_t (dsum_enum t) (jump_dsum_cases_t t f g))
: Tot (jumper (parse_dsum t p f g))
= fun #rrel #rel input pos ->
let h = HST.get () in
[@inline_let]
let _ = parse_dsum_eq' t p f g (bytes_of_slice_from h input pos) in
[@inline_let]
let _ = valid_facts (parse_dsum t p f g) h input pos in
[@inline_let]
let _ = valid_facts p h input pos in
let pos_after_tag = v input pos in
let tg = p32 input pos in
[@inline_let]
let _ = valid_facts (parse_dsum_cases' t f g (maybe_enum_key_of_repr (dsum_enum t) tg)) h input pos_after_tag in
destr (jump_dsum_cases_eq t f g) (jump_dsum_cases_if t f g) (fun _ _ -> ()) (fun _ _ _ _ -> ()) (jump_dsum_cases' t f f32 g32) tg input pos_after_tag
#pop-options
inline_for_extraction
let read_dsum_cases'
(t: dsum)
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(f32: (x: dsum_known_key t) -> Tot (leaf_reader (dsnd (f x))))
(#k': parser_kind)
(g: parser k' (dsum_type_of_unknown_tag t))
(g32: leaf_reader g)
(x: dsum_key t)
: Tot (leaf_reader (parse_dsum_cases' t f g x))
= fun #rrel #rel input pos ->
[@inline_let]
let _ = synth_dsum_case_injective t x in
match x with
| Known x' ->
read_synth'
(dsnd (f x'))
(synth_dsum_case t (Known x'))
(f32 x')
()
input
pos
| Unknown x' ->
read_synth'
g
(synth_dsum_case t (Unknown x'))
g32
()
input
pos
inline_for_extraction
let read_dsum_cases_t
(t: dsum)
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(#k': parser_kind)
(g: parser k' (dsum_type_of_unknown_tag t))
(k: dsum_known_key t)
: Tot Type
= leaf_reader (parse_dsum_cases' t f g (Known k))
let read_dsum_cases_t_eq
(t: dsum)
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(#k': parser_kind)
(g: parser k' (dsum_type_of_unknown_tag t))
(k: dsum_known_key t)
(x y : read_dsum_cases_t t f g k)
: GTot Type0
= True
inline_for_extraction
let read_dsum_cases_t_if
(t: dsum)
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(#k': parser_kind)
(g: parser k' (dsum_type_of_unknown_tag t))
(k: dsum_known_key t)
: Tot (if_combinator _ (read_dsum_cases_t_eq t f g k))
= fun cond (sv_true: cond_true cond -> Tot (read_dsum_cases_t t f g k)) (sv_false: cond_false cond -> Tot (read_dsum_cases_t t f g k)) #_ #_ input pos ->
if cond
then sv_true () input pos
else sv_false () input pos
inline_for_extraction
let read_dsum_cases
(t: dsum)
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(f32: (x: dsum_known_key t) -> Tot (leaf_reader (dsnd (f x))))
(#k': parser_kind)
(g: parser k' (dsum_type_of_unknown_tag t))
(g32: leaf_reader g)
(destr: dep_enum_destr _ (read_dsum_cases_t t f g))
(x: dsum_key t)
: Tot (leaf_reader (parse_dsum_cases' t f g x))
= fun #_ #_ input pos ->
match x with
| Known k ->
destr
_
(read_dsum_cases_t_if t f g)
(fun _ _ -> ())
(fun _ _ _ _ -> ())
(fun k -> read_dsum_cases' t f f32 g g32 (Known k))
k
input
pos
| Unknown r ->
read_dsum_cases' t f f32 g g32 (Unknown r) input pos
#push-options "--z3rlimit 16"
inline_for_extraction
let read_dsum
(#kt: parser_kind)
(t: dsum)
(#p: parser kt (dsum_repr_type t))
(p32: leaf_reader (parse_maybe_enum_key p (dsum_enum t)))
(j: jumper p)
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(f32: (x: dsum_known_key t) -> Tot (leaf_reader (dsnd (f x))))
(#k': parser_kind)
(#g: parser k' (dsum_type_of_unknown_tag t))
(g32: leaf_reader g)
(destr: dep_enum_destr _ (read_dsum_cases_t t f g))
: Tot (leaf_reader (parse_dsum t p f g))
= fun #_ #_ input pos ->
let h = HST.get () in
valid_facts (parse_dsum t p f g) h input pos;
parse_dsum_eq_ t p f g (bytes_of_slice_from h input pos);
valid_facts (parse_maybe_enum_key p (dsum_enum t)) h input pos;
let k = p32 input pos in
let pos' = jump_maybe_enum_key j (dsum_enum t) input pos in
valid_facts (parse_dsum_cases' t f g k) h input pos' ;
read_dsum_cases t f f32 g g32 destr k input pos'
#pop-options
inline_for_extraction
let serialize32_dsum_type_of_tag
(t: dsum)
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(sf: (x: dsum_known_key t) -> Tot (serializer (dsnd (f x))))
(sf32: (x: dsum_known_key t) -> Tot (serializer32 (sf x)))
(#k': parser_kind)
(#g: parser k' (dsum_type_of_unknown_tag t))
(#sg: serializer g)
(sg32: serializer32 sg)
(tg: dsum_key t)
: Tot (serializer32 (serialize_dsum_type_of_tag t f sf g sg tg))
= match tg with
| Known x' -> serialize32_ext (dsnd (f x')) (sf x') (sf32 x') (parse_dsum_type_of_tag t f g tg) ()
| Unknown x' -> serialize32_ext g sg sg32 (parse_dsum_type_of_tag t f g tg) ()
inline_for_extraction
let serialize32_dsum_cases_aux
(t: dsum)
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(sf: (x: dsum_known_key t) -> Tot (serializer (dsnd (f x))))
(sf32: (x: dsum_known_key t) -> Tot (serializer32 (sf x)))
(#k': parser_kind)
(#g: parser k' (dsum_type_of_unknown_tag t))
(#sg: serializer g)
(sg32: serializer32 sg)
(tg: dsum_key t)
: Tot (serializer32 (serialize_dsum_cases t f sf g sg tg))
= [@inline_let]
let _ = synth_dsum_case_injective t tg in
[@inline_let]
let _ = synth_dsum_case_inverse t tg in
serialize32_synth
(serialize32_dsum_type_of_tag t f sf sf32 sg32 tg)
(synth_dsum_case t tg)
(synth_dsum_case_recip t tg)
(fun x -> synth_dsum_case_recip t tg x)
()
inline_for_extraction
let serialize32_dsum_cases_t
(t: dsum)
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(sf: (x: dsum_known_key t) -> Tot (serializer (dsnd (f x))))
(#k': parser_kind)
(g: parser k' (dsum_type_of_unknown_tag t))
(sg: serializer g)
(k: dsum_known_key t)
: Tot Type
= serializer32 (serialize_dsum_cases t f sf g sg (Known k))
let serialize32_dsum_cases_t_eq
(t: dsum)
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(sf: (x: dsum_known_key t) -> Tot (serializer (dsnd (f x))))
(#k': parser_kind)
(g: parser k' (dsum_type_of_unknown_tag t))
(sg: serializer g)
(k: dsum_known_key t)
(x y: serialize32_dsum_cases_t t f sf g sg k)
: GTot Type0
= True
inline_for_extraction
let serialize32_dsum_cases_t_if
(t: dsum)
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(sf: (x: dsum_known_key t) -> Tot (serializer (dsnd (f x))))
(#k': parser_kind)
(g: parser k' (dsum_type_of_unknown_tag t))
(sg: serializer g)
(k: dsum_known_key t)
: Tot (if_combinator _ (serialize32_dsum_cases_t_eq t f sf g sg k))
= fun cond (sv_true: (cond_true cond -> Tot (serialize32_dsum_cases_t t f sf g sg k))) (sv_false: (cond_false cond -> Tot (serialize32_dsum_cases_t t f sf g sg k))) x #rrel #rel output pos ->
if cond
then (sv_true () x output pos)
else (sv_false () x output pos)
inline_for_extraction
let serialize32_dsum_cases
(t: dsum)
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(sf: (x: dsum_known_key t) -> Tot (serializer (dsnd (f x))))
(sf32: (x: dsum_known_key t) -> Tot (serializer32 (sf x)))
(#k': parser_kind)
(#g: parser k' (dsum_type_of_unknown_tag t))
(#sg: serializer g)
(sg32: serializer32 sg)
(destr: dep_enum_destr _ (serialize32_dsum_cases_t t f sf g sg))
(tg: dsum_key t)
: Tot (serializer32 (serialize_dsum_cases t f sf g sg tg))
= fun x #rrel #rel output pos ->
match tg with
| Known k ->
destr
_
(serialize32_dsum_cases_t_if t f sf g sg)
(fun _ _ -> ())
(fun _ _ _ _ -> ())
(fun k -> serialize32_dsum_cases_aux t f sf sf32 sg32 (Known k))
k
x
output
pos
| Unknown r ->
serialize32_dsum_cases_aux t f sf sf32 sg32 (Unknown r) x output pos
inline_for_extraction
let serialize32_dsum
(#kt: parser_kind)
(t: dsum)
(#p: parser kt (dsum_repr_type t))
(s: serializer p {kt.parser_kind_subkind == Some ParserStrong})
(s32: serializer32 (serialize_maybe_enum_key _ s (dsum_enum t)))
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(sf: (x: dsum_known_key t) -> Tot (serializer (dsnd (f x))))
(sf32: (x: dsum_known_key t) -> Tot (serializer32 (sf x)))
(#k': parser_kind)
(#g: parser k' (dsum_type_of_unknown_tag t))
(#sg: serializer g)
(sg32: serializer32 sg)
(destr: dep_enum_destr _ (serialize32_dsum_cases_t t f sf g sg))
: Tot (serializer32 (serialize_dsum t s f sf g sg))
= fun x #_ #_ output pos ->
[@inline_let]
let _ = serialize_dsum_eq' t s f sf g sg x in
let tg = dsum_tag_of_data t x in
serialize32_nondep_then_aux
s32
(serialize32_dsum_cases t f sf sf32 sg32 destr tg)
tg
x
output
pos
let clens_dsum_tag
(s: dsum)
: Tot (clens (dsum_type s) (dsum_key s))
= {
clens_cond = (fun _ -> True);
clens_get = dsum_tag_of_data s;
} | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"LowStar.Buffer.fst.checked",
"LowParse.Spec.Sum.fst.checked",
"LowParse.Low.Enum.fst.checked",
"FStar.UInt64.fsti.checked",
"FStar.UInt32.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Int.Cast.fst.checked",
"FStar.HyperStack.ST.fsti.checked",
"FStar.HyperStack.fst.checked",
"FStar.Classical.fsti.checked"
],
"interface_file": false,
"source_file": "LowParse.Low.Sum.fst"
} | [
{
"abbrev": true,
"full_module": "FStar.HyperStack",
"short_module": "HS"
},
{
"abbrev": true,
"full_module": "FStar.UInt64",
"short_module": "U64"
},
{
"abbrev": true,
"full_module": "FStar.Int.Cast",
"short_module": "Cast"
},
{
"abbrev": true,
"full_module": "LowStar.Buffer",
"short_module": "B"
},
{
"abbrev": true,
"full_module": "FStar.HyperStack.ST",
"short_module": "HST"
},
{
"abbrev": true,
"full_module": "FStar.UInt32",
"short_module": "U32"
},
{
"abbrev": false,
"full_module": "LowParse.Spec.Sum",
"short_module": null
},
{
"abbrev": false,
"full_module": "LowParse.Low.Enum",
"short_module": null
},
{
"abbrev": false,
"full_module": "LowParse.Low",
"short_module": null
},
{
"abbrev": false,
"full_module": "LowParse.Low",
"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",
"short_module": null
}
] | {
"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_elim_box": false,
"smtencoding_l_arith_repr": "boxwrap",
"smtencoding_nl_arith_repr": "boxwrap",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": true,
"z3cliopt": [],
"z3refresh": false,
"z3rlimit": 5,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | false |
t: LowParse.Spec.Sum.dsum ->
p: LowParse.Spec.Base.parser kt (LowParse.Spec.Sum.dsum_repr_type t) ->
f:
(x: LowParse.Spec.Sum.dsum_known_key t
-> Prims.dtuple2 LowParse.Spec.Base.parser_kind
(fun k -> LowParse.Spec.Base.parser k (LowParse.Spec.Sum.dsum_type_of_known_tag t x))) ->
g: LowParse.Spec.Base.parser ku (LowParse.Spec.Sum.dsum_type_of_unknown_tag t)
-> LowParse.Low.Base.Spec.gaccessor (LowParse.Spec.Sum.parse_dsum t p f g)
(LowParse.Spec.Enum.parse_maybe_enum_key p (LowParse.Spec.Sum.dsum_enum t))
(LowParse.Low.Sum.clens_dsum_tag t) | Prims.Tot | [
"total"
] | [] | [
"LowParse.Spec.Base.parser_kind",
"LowParse.Spec.Sum.dsum",
"LowParse.Spec.Base.parser",
"LowParse.Spec.Sum.dsum_repr_type",
"LowParse.Spec.Sum.dsum_known_key",
"Prims.dtuple2",
"LowParse.Spec.Sum.dsum_type_of_known_tag",
"LowParse.Spec.Sum.dsum_type_of_unknown_tag",
"LowParse.Low.Combinators.gaccessor_tagged_union_tag",
"LowParse.Spec.Enum.maybe_enum_key",
"LowParse.Spec.Sum.dsum_key_type",
"LowParse.Spec.Sum.dsum_enum",
"LowParse.Spec.Enum.parse_maybe_enum_key",
"LowParse.Spec.Sum.dsum_type",
"LowParse.Spec.Sum.dsum_tag_of_data",
"LowParse.Spec.Sum.weaken_parse_dsum_cases_kind",
"LowParse.Spec.Sum.parse_dsum_cases",
"LowParse.Low.Base.Spec.gaccessor",
"LowParse.Spec.Sum.parse_dsum_kind",
"LowParse.Spec.Sum.parse_dsum",
"LowParse.Low.Sum.clens_dsum_tag"
] | [] | false | false | false | false | false | let gaccessor_dsum_tag
(#kt: parser_kind)
(t: dsum)
(p: parser kt (dsum_repr_type t))
(f: (x: dsum_known_key t -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x))))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
: Tot (gaccessor (parse_dsum t p f g) (parse_maybe_enum_key p (dsum_enum t)) (clens_dsum_tag t)) =
| gaccessor_tagged_union_tag (parse_maybe_enum_key p (dsum_enum t))
(dsum_tag_of_data t)
(parse_dsum_cases t f g) | false |
LowParse.Low.Sum.fst | LowParse.Low.Sum.validate_dsum_cases | val validate_dsum_cases
(s: dsum)
(f: (x: dsum_known_key s -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x))))
(f': (x: dsum_known_key s -> Tot (validator (dsnd (f x)))))
(#k: parser_kind)
(#g: parser k (dsum_type_of_unknown_tag s))
(g': validator g)
(destr: dep_enum_destr _ (fun k -> validate_dsum_cases_t s f g (Known k)))
(x: dsum_key s)
: Tot (validator (parse_dsum_cases s f g x)) | val validate_dsum_cases
(s: dsum)
(f: (x: dsum_known_key s -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x))))
(f': (x: dsum_known_key s -> Tot (validator (dsnd (f x)))))
(#k: parser_kind)
(#g: parser k (dsum_type_of_unknown_tag s))
(g': validator g)
(destr: dep_enum_destr _ (fun k -> validate_dsum_cases_t s f g (Known k)))
(x: dsum_key s)
: Tot (validator (parse_dsum_cases s f g x)) | let validate_dsum_cases
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(f' : (x: dsum_known_key s) -> Tot (validator (dsnd (f x))))
(#k: parser_kind)
(#g: parser k (dsum_type_of_unknown_tag s))
(g' : validator g)
(destr: dep_enum_destr _ (fun k -> validate_dsum_cases_t s f g (Known k)))
(x: dsum_key s)
: Tot (validator (parse_dsum_cases s f g x))
= fun #rrel #rel input pos ->
let h = HST.get () in
[@inline_let]
let _ =
valid_facts (parse_dsum_cases' s f g x) h input (uint64_to_uint32 pos);
valid_facts (parse_dsum_cases s f g x) h input (uint64_to_uint32 pos);
parse_dsum_cases_eq' s f g x (bytes_of_slice_from h input (uint64_to_uint32 pos))
in
validate_dsum_cases'_destr s f f' g' destr x input pos | {
"file_name": "src/lowparse/LowParse.Low.Sum.fst",
"git_rev": "00217c4a89f5ba56002ba9aa5b4a9d5903bfe9fa",
"git_url": "https://github.com/project-everest/everparse.git",
"project_name": "everparse"
} | {
"end_col": 56,
"end_line": 1062,
"start_col": 0,
"start_line": 1044
} | module LowParse.Low.Sum
include LowParse.Low.Enum
include LowParse.Spec.Sum
module U32 = FStar.UInt32
module HST = FStar.HyperStack.ST
module B = LowStar.Buffer
module Cast = FStar.Int.Cast
module U64 = FStar.UInt64
inline_for_extraction
let validate_sum_cases_aux
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(vc: ((x: sum_key t) -> Tot (validator (dsnd (pc x)))))
(k: sum_key t)
: Tot (validator (parse_sum_cases t pc k))
= [@inline_let]
let _ = synth_sum_case_injective t k in
validate_synth
(validate_weaken
(weaken_parse_cases_kind t pc)
(vc k)
()
)
(synth_sum_case t k)
()
inline_for_extraction
let validate_sum_cases_t
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot Type
= validator (parse_sum_cases t pc k)
let validate_sum_cases_t_eq
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
(x y : validate_sum_cases_t t pc k)
: GTot Type0
= True
inline_for_extraction
let validate_sum_cases_t_if
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (if_combinator _ (validate_sum_cases_t_eq t pc k))
= fun cond (sv_true: cond_true cond -> Tot (validate_sum_cases_t t pc k)) (sv_false: cond_false cond -> Tot (validate_sum_cases_t t pc k)) #rrel #rel input pos ->
if cond
then sv_true () input pos
else sv_false () input pos
inline_for_extraction
let validate_sum_cases
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(vc: ((x: sum_key t) -> Tot (validator (dsnd (pc x)))))
(destr: dep_enum_destr (sum_enum t) (validate_sum_cases_t t pc))
(k: sum_key t)
: Tot (validator (parse_sum_cases t pc k))
= destr
_
(validate_sum_cases_t_if t pc)
(fun _ _ -> ())
(fun _ _ _ _ -> ())
(validate_sum_cases_aux t pc vc)
k
inline_for_extraction
let validate_sum_aux_payload_t
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
: Tot Type
= (#rrel: _) -> (#rel: _) ->
(input: slice rrel rel) ->
(pos: U64.t) ->
HST.Stack U64.t
(requires (fun h -> live_slice h input /\ U64.v pos <= U32.v input.len))
(ensures (fun h res h' ->
B.modifies B.loc_none h h' /\ (
match k with
| Unknown _ -> is_error res
| Known k' ->
if is_success res
then
valid_pos (dsnd (pc k')) h input (uint64_to_uint32 pos) (uint64_to_uint32 res)
else
(~ (valid (dsnd (pc k')) h input (uint64_to_uint32 pos)))
)))
let validate_sum_aux_payload_eq
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
: Tot (validate_sum_aux_payload_t t pc k -> validate_sum_aux_payload_t t pc k -> GTot Type0)
= fun _ _ -> True
inline_for_extraction
let validate_sum_aux_payload_if'
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
(cond: bool)
(ift: ((cond_true cond) -> Tot (validate_sum_aux_payload_t t pc k)))
(iff: ((cond_false cond) -> Tot (validate_sum_aux_payload_t t pc k)))
: Tot (validate_sum_aux_payload_t t pc k)
= fun #rrel #rel input pos ->
if cond
then begin
(ift () <: validate_sum_aux_payload_t t pc k) input pos
end else
(iff () <: validate_sum_aux_payload_t t pc k) input pos
inline_for_extraction
let validate_sum_aux_payload_if
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
: Tot (if_combinator _ (validate_sum_aux_payload_eq t pc k))
= validate_sum_aux_payload_if' t pc k
#push-options "--z3rlimit 64 --z3cliopt smt.arith.nl=false --using_facts_from '* -FStar.Int.Cast -LowParse.BitFields'"
// --query_stats --smtencoding.elim_box true --smtencoding.l_arith_repr native --z3refresh"
inline_for_extraction
let validate_sum_aux
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(v: validator p)
(p32: leaf_reader p)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(v_payload: ((k: sum_repr_type t)) -> Tot (validate_sum_aux_payload_t t pc (maybe_enum_key_of_repr (sum_enum t) k)))
: Tot (validator (parse_sum t p pc))
= fun #rrel #rel input pos ->
let h = HST.get () in
[@inline_let]
let _ = parse_sum_eq'' t p pc (bytes_of_slice_from h input (uint64_to_uint32 pos)) in
[@inline_let]
let _ = valid_facts (parse_sum t p pc) h input (uint64_to_uint32 pos) in
[@inline_let]
let _ = valid_facts p h input (uint64_to_uint32 pos) in
let len_after_tag = v input pos in
if is_error len_after_tag
then len_after_tag
else begin
let h1 = HST.get () in
let k' = p32 input (uint64_to_uint32 pos) in
[@inline_let]
let _ =
match maybe_enum_key_of_repr (sum_enum t) k' with
| Known k -> valid_facts (dsnd (pc k)) h input (uint64_to_uint32 len_after_tag)
| _ -> ()
in
v_payload k' input len_after_tag
end
#pop-options
inline_for_extraction
let validate_sum_aux_payload'
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (validator (dsnd (pc x)))))
(k: maybe_enum_key (sum_enum t))
: Tot (validate_sum_aux_payload_t t pc k)
= fun #rrel #rel input pos ->
match k with
| Known k ->
[@inline_let]
let _ = synth_sum_case_injective t k in
pc32 k input pos
// validate_synth (pc32 k) (synth_sum_case t k) () input pos
| _ -> validator_error_generic
inline_for_extraction
let validate_sum_aux_payload
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (validator (dsnd (pc x)))))
(destr: dep_maybe_enum_destr_t (sum_enum t) (validate_sum_aux_payload_t t pc))
(k: sum_repr_type t)
: Tot (validate_sum_aux_payload_t t pc (maybe_enum_key_of_repr (sum_enum t) k))
= destr (validate_sum_aux_payload_eq t pc) (validate_sum_aux_payload_if t pc) (fun _ _ -> ()) (fun _ _ _ _ -> ()) (validate_sum_aux_payload' t pc pc32) k
inline_for_extraction
let validate_sum
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(v: validator p)
(p32: leaf_reader p)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (validator (dsnd (pc x)))))
(destr: dep_maybe_enum_destr_t (sum_enum t) (validate_sum_aux_payload_t t pc))
: Tot (validator (parse_sum t p pc))
= validate_sum_aux t v p32 pc (validate_sum_aux_payload t pc pc32 destr)
module HS = FStar.HyperStack
#push-options "--z3rlimit 256 --z3cliopt smt.arith.nl=false --initial_ifuel 8 --max_ifuel 8 --initial_fuel 2 --max_fuel 2"
#restart-solver
let valid_sum_intro
(h: HS.mem)
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: Lemma
(requires (
valid (parse_enum_key p (sum_enum t)) h input pos /\ (
let k = contents (parse_enum_key p (sum_enum t)) h input pos in
valid (dsnd (pc k)) h input (get_valid_pos (parse_enum_key p (sum_enum t)) h input pos)
)))
(ensures (
let k = contents (parse_enum_key p (sum_enum t)) h input pos in
let pos_payload = get_valid_pos (parse_enum_key p (sum_enum t)) h input pos in
valid_content_pos
(parse_sum t p pc) h input pos
(synth_sum_case t k (contents (dsnd (pc k)) h input pos_payload))
(get_valid_pos (dsnd (pc k)) h input pos_payload)
))
= valid_facts (parse_enum_key p (sum_enum t)) h input pos;
let k = contents (parse_enum_key p (sum_enum t)) h input pos in
let pos_payload = get_valid_pos (parse_enum_key p (sum_enum t)) h input pos in
valid_facts (dsnd (pc k)) h input pos_payload;
valid_facts (parse_sum t p pc) h input pos;
parse_sum_eq t p pc (bytes_of_slice_from h input pos)
#pop-options
inline_for_extraction
let finalize_sum_case
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(s: serializer p)
(w: leaf_writer_strong s)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(destr: enum_repr_of_key'_t (sum_enum t))
(k: sum_key t)
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: HST.Stack unit
(requires (fun h ->
let len_tag = serialized_length (serialize_enum_key _ s (sum_enum t)) k in
U32.v pos + len_tag < 4294967296 /\ (
let pos_payload = pos `U32.add` U32.uint_to_t len_tag in
valid (dsnd (pc k)) h input pos_payload /\
writable input.base (U32.v pos) (U32.v pos_payload) h
)))
(ensures (fun h _ h' ->
let len_tag = serialized_length (serialize_enum_key _ s (sum_enum t)) k in
let pos_payload = pos `U32.add` U32.uint_to_t len_tag in
B.modifies (loc_slice_from_to input pos pos_payload) h h' /\
valid_content_pos (parse_sum t p pc) h' input pos (synth_sum_case t k (contents (dsnd (pc k)) h input pos_payload)) (get_valid_pos (dsnd (pc k)) h input pos_payload)
))
= let pos1 = write_enum_key w (sum_enum t) destr k input pos in
let h = HST.get () in
[@inline_let]
let _ = valid_sum_intro h t p pc input pos in
()
inline_for_extraction
let jump_sum_cases_aux
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(vc: ((x: sum_key t) -> Tot (jumper (dsnd (pc x)))))
(k: sum_key t)
: Tot (jumper (parse_sum_cases t pc k))
= [@inline_let]
let _ = synth_sum_case_injective t k in
jump_synth
(jump_weaken
(weaken_parse_cases_kind t pc)
(vc k)
()
)
(synth_sum_case t k)
()
inline_for_extraction
let jump_sum_cases_t
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot Type
= jumper (parse_sum_cases t pc k)
let jump_sum_cases_t_eq
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
(x y : jump_sum_cases_t t pc k)
: GTot Type0
= True
inline_for_extraction
let jump_sum_cases_t_if
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (if_combinator _ (jump_sum_cases_t_eq t pc k))
= fun cond (sv_true: cond_true cond -> Tot (jump_sum_cases_t t pc k)) (sv_false: cond_false cond -> Tot (jump_sum_cases_t t pc k)) #rrel #rel input pos ->
if cond
then sv_true () input pos
else sv_false () input pos
inline_for_extraction
let jump_sum_cases
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(vc: ((x: sum_key t) -> Tot (jumper (dsnd (pc x)))))
(destr: dep_enum_destr (sum_enum t) (jump_sum_cases_t t pc))
(k: sum_key t)
: Tot (jumper (parse_sum_cases t pc k))
= destr
_
(jump_sum_cases_t_if t pc)
(fun _ _ -> ())
(fun _ _ _ _ -> ())
(jump_sum_cases_aux t pc vc)
k
inline_for_extraction
let jump_sum_aux_payload_t
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
: Tot Type
= (#rrel: _) -> (#rel: _) ->
(input: slice rrel rel) ->
(pos: U32.t) ->
HST.Stack U32.t
(requires (fun h -> live_slice h input /\ U32.v pos <= U32.v input.len /\ (
match k with
| Unknown _ -> False
| Known k' -> valid (dsnd (pc k')) h input pos
)))
(ensures (fun h res h' ->
B.modifies B.loc_none h h' /\ (
match k with
| Unknown _ -> False
| Known k' ->
valid_pos (dsnd (pc k')) h input pos res
)))
let jump_sum_aux_payload_eq
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
: Tot (jump_sum_aux_payload_t t pc k -> jump_sum_aux_payload_t t pc k -> GTot Type0)
= fun _ _ -> True
inline_for_extraction
let jump_sum_aux_payload_if'
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
(cond: bool)
(ift: ((cond_true cond) -> Tot (jump_sum_aux_payload_t t pc k)))
(iff: ((cond_false cond) -> Tot (jump_sum_aux_payload_t t pc k)))
: Tot (jump_sum_aux_payload_t t pc k)
= fun #rrel #rel input pos ->
if cond
then begin
(ift () <: jump_sum_aux_payload_t t pc k) input pos
end else
(iff () <: jump_sum_aux_payload_t t pc k) input pos
inline_for_extraction
let jump_sum_aux_payload_if
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
: Tot (if_combinator _ (jump_sum_aux_payload_eq t pc k))
= jump_sum_aux_payload_if' t pc k
let parse_sum_eq3
(#kt: parser_kind)
(t: sum)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(input: bytes)
(k' : sum_repr_type t)
(consumed_k: consumed_length input)
: Lemma
(requires (Some? (parse (parse_sum t p pc) input) /\ parse p input == Some (k', consumed_k)))
(ensures (
let input_k = Seq.slice input consumed_k (Seq.length input) in
let k = maybe_enum_key_of_repr (sum_enum t) k' in
begin match k with
| Known k ->
Some? (parse (dsnd (pc k)) input_k)
| _ -> False
end
))
= parse_sum_eq'' t p pc input
let parse_sum_eq4
(#kt: parser_kind)
(t: sum)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(input: bytes)
(k' : sum_repr_type t)
(consumed_k: consumed_length input)
(consumed_payload: nat)
: Lemma
(requires (Some? (parse (parse_sum t p pc) input) /\ parse p input == Some (k', consumed_k) /\ (
let input_k = Seq.slice input consumed_k (Seq.length input) in
let k = maybe_enum_key_of_repr (sum_enum t) k' in
begin match k with
| Known k ->
Some? (parse (dsnd (pc k)) input_k) /\ (
let Some (_, consumed_payload') = parse (dsnd (pc k)) input_k in
consumed_payload' == consumed_payload
)
| _ -> False
end
)))
(ensures (
let Some (_, consumed) = parse (parse_sum t p pc) input in
consumed == consumed_k + consumed_payload
))
= parse_sum_eq'' t p pc input
#push-options "--z3rlimit 16"
let valid_sum_elim
(h: HS.mem)
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(#rrel: _) (#rel: _)
(input: slice rrel rel)
(pos: U32.t)
: Lemma
(requires (
valid (parse_sum t p pc) h input pos
))
(ensures (
valid p h input pos /\ (
let pos_payload = get_valid_pos p h input pos in
let k' = maybe_enum_key_of_repr (sum_enum t) (contents p h input pos) in
match k' with
| Known k ->
k == sum_tag_of_data t (contents (parse_sum t p pc) h input pos) /\
valid (dsnd (pc k)) h input pos_payload /\
valid_pos
(parse_sum t p pc) h input pos
(get_valid_pos (dsnd (pc k)) h input pos_payload)
| _ -> False
)))
= let sinput = bytes_of_slice_from h input pos in
let _ = parse_sum_eq'' t p pc sinput in
[@inline_let]
let _ = valid_facts (parse_sum t p pc) h input pos in
let Some (k', consumed_k) = parse p sinput in
let pos_after_tag = U32.uint_to_t (U32.v pos + consumed_k) in
[@inline_let]
let _ = valid_facts p h input pos in
assert (valid_content_pos p h input pos k' pos_after_tag);
match maybe_enum_key_of_repr (sum_enum t) k' with
| Known k -> valid_facts (dsnd (pc k)) h input pos_after_tag
| _ -> ()
#pop-options
let valid_sum_elim_tag
(h: HS.mem)
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: Lemma
(requires (
valid (parse_sum t p pc) h input pos
))
(ensures (
valid (parse_enum_key p (sum_enum t)) h input pos /\
contents (parse_enum_key p (sum_enum t)) h input pos == sum_tag_of_data t (contents (parse_sum t p pc) h input pos)
))
= let _ = parse_sum_eq' t p pc (bytes_of_slice_from h input pos) in
let _ = valid_facts (parse_sum t p pc) h input pos in
let _ = valid_facts (parse_enum_key p (sum_enum t)) h input pos in
()
inline_for_extraction
let read_sum_tag
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(p32: leaf_reader p)
(destr: dep_maybe_enum_destr_t (sum_enum t) (read_enum_key_t (sum_enum t)))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: HST.Stack (sum_key t)
(requires (fun h ->
valid (parse_sum t p pc) h input pos
))
(ensures (fun h res h' ->
B.modifies B.loc_none h h' /\
res == sum_tag_of_data t (contents (parse_sum t p pc) h input pos)
))
= let h = HST.get () in
[@inline_let] let _ = valid_sum_elim_tag h t p pc input pos in
read_enum_key p32 (sum_enum t) destr input pos
inline_for_extraction
let jump_sum_aux
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(v: jumper p)
(p32: leaf_reader p)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(v_payload: ((k: sum_repr_type t)) -> Tot (jump_sum_aux_payload_t t pc (maybe_enum_key_of_repr (sum_enum t) k)))
: Tot (jumper (parse_sum t p pc))
= fun #rrel #rel input pos ->
let h = HST.get () in
[@inline_let]
let _ = valid_sum_elim h t p pc input pos in
let pos_after_tag = v input pos in
let k' = p32 input pos in
v_payload k' input pos_after_tag
inline_for_extraction
let jump_sum_aux_payload'
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (jumper (dsnd (pc x)))))
(k: maybe_enum_key (sum_enum t))
: Tot (jump_sum_aux_payload_t t pc k)
= fun #rrel #rel input pos ->
match k with
| Known k ->
[@inline_let]
let _ = synth_sum_case_injective t k in
pc32 k input pos
| _ -> 0ul // dummy, but we MUST NOT remove this branch, otherwise extraction fails
inline_for_extraction
let jump_sum_aux_payload
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (jumper (dsnd (pc x)))))
(destr: dep_maybe_enum_destr_t (sum_enum t) (jump_sum_aux_payload_t t pc))
(k: sum_repr_type t)
: Tot (jump_sum_aux_payload_t t pc (maybe_enum_key_of_repr (sum_enum t) k))
= destr (jump_sum_aux_payload_eq t pc) (jump_sum_aux_payload_if t pc) (fun _ _ -> ()) (fun _ _ _ _ -> ()) (jump_sum_aux_payload' t pc pc32) k
inline_for_extraction
let jump_sum
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(v: jumper p)
(p32: leaf_reader p)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (jumper (dsnd (pc x)))))
(destr: dep_maybe_enum_destr_t (sum_enum t) (jump_sum_aux_payload_t t pc))
: Tot (jumper (parse_sum t p pc))
= jump_sum_aux t v p32 pc (jump_sum_aux_payload t pc pc32 destr)
inline_for_extraction
let read_sum_cases'
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (leaf_reader (dsnd (pc x)))))
(k: sum_key t)
: Tot (leaf_reader (parse_sum_cases' t pc k))
= [@inline_let]
let _ = synth_sum_case_injective t k in
read_synth'
(dsnd (pc k))
(synth_sum_case t k)
(pc32 k)
()
inline_for_extraction
let read_sum_cases_t
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot Type
= leaf_reader (parse_sum_cases' t pc k)
let read_sum_cases_t_eq
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
(x y : read_sum_cases_t t pc k)
: GTot Type0
= True
inline_for_extraction
let read_sum_cases_t_if
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (if_combinator _ (read_sum_cases_t_eq t pc k))
= fun cond (sv_true: cond_true cond -> Tot (read_sum_cases_t t pc k)) (sv_false: cond_false cond -> Tot (read_sum_cases_t t pc k)) #_ #_ input pos ->
if cond
then (sv_true () input pos)
else (sv_false () input pos)
inline_for_extraction
let read_sum_cases
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (leaf_reader (dsnd (pc x)))))
(destr: dep_enum_destr (sum_enum t) (read_sum_cases_t t pc))
(k: sum_key t)
: Tot (leaf_reader (parse_sum_cases' t pc k))
= destr
_
(read_sum_cases_t_if t pc)
(fun _ _ -> ())
(fun _ _ _ _ -> ())
(read_sum_cases' t pc pc32)
k
#push-options "--z3rlimit 32"
inline_for_extraction
let read_sum
(#kt: parser_kind)
(t: sum)
(p: parser kt (sum_repr_type t))
(p32: leaf_reader (parse_enum_key p (sum_enum t)))
(j: jumper p)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (leaf_reader (dsnd (pc x)))))
(destr: dep_enum_destr (sum_enum t) (read_sum_cases_t t pc))
: Tot (leaf_reader (parse_sum t p pc))
=
fun #_ #_ input pos ->
let h = HST.get () in
valid_facts (parse_sum t p pc) h input pos;
parse_sum_eq' t p pc (bytes_of_slice_from h input pos);
valid_facts (parse_enum_key p (sum_enum t)) h input pos;
let k = p32 input pos in
let pos' = jump_enum_key j (sum_enum t) input pos in
valid_facts (parse_sum_cases' t pc k) h input pos' ;
read_sum_cases t pc pc32 destr k input pos'
#pop-options
inline_for_extraction
let serialize32_sum_cases_t
(t: sum)
(#pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(sc: ((x: sum_key t) -> Tot (serializer (dsnd (pc x)))))
(k: sum_key t)
: Tot Type
= serializer32 (serialize_sum_cases t pc sc k)
let serialize32_sum_cases_t_eq
(t: sum)
(#pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(sc: ((x: sum_key t) -> Tot (serializer (dsnd (pc x)))))
(k: sum_key t)
(x y: serialize32_sum_cases_t t sc k)
: GTot Type0
= True
inline_for_extraction
let serialize32_sum_cases_t_if
(t: sum)
(#pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(sc: ((x: sum_key t) -> Tot (serializer (dsnd (pc x)))))
(k: sum_key t)
: Tot (if_combinator _ (serialize32_sum_cases_t_eq t sc k))
= fun cond (sv_true: (cond_true cond -> Tot (serialize32_sum_cases_t t sc k))) (sv_false: (cond_false cond -> Tot (serialize32_sum_cases_t t sc k))) x #rrel #rel b pos ->
if cond
then (sv_true () x b pos)
else (sv_false () x b pos)
inline_for_extraction
let serialize32_sum_cases_aux
(t: sum)
(#pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(sc: ((x: sum_key t) -> Tot (serializer (dsnd (pc x)))))
(sc32: ((x: sum_key t) -> Tot (serializer32 (sc x))))
(k: sum_key t)
: Tot (serializer32 (serialize_sum_cases t pc sc k))
= fun x #rrel #rel b pos ->
[@inline_let] let _ =
Classical.forall_intro (parse_sum_cases_eq' t pc k);
synth_sum_case_injective t k;
synth_sum_case_inverse t k
in
serialize32_synth
(sc32 k)
(synth_sum_case t k)
(synth_sum_case_recip t k)
(fun x -> synth_sum_case_recip t k x)
()
x
b
pos
inline_for_extraction
let serialize32_sum_cases
(t: sum)
(#pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(sc: ((x: sum_key t) -> Tot (serializer (dsnd (pc x)))))
(sc32: ((x: sum_key t) -> Tot (serializer32 (sc x))))
(destr: dep_enum_destr (sum_enum t) (serialize32_sum_cases_t t sc))
(k: sum_key t)
: Tot (serializer32 (serialize_sum_cases t pc sc k))
= destr
_
(serialize32_sum_cases_t_if t sc)
(fun _ _ -> ())
(fun _ _ _ _ -> ())
(serialize32_sum_cases_aux t sc sc32)
k
inline_for_extraction
let serialize32_sum
(#kt: parser_kind)
(t: sum)
(#p: parser kt (sum_repr_type t))
(s: serializer p {kt.parser_kind_subkind == Some ParserStrong})
(s32: serializer32 (serialize_enum_key _ s (sum_enum t)))
(#pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(sc: ((x: sum_key t) -> Tot (serializer (dsnd (pc x)))))
(sc32: ((x: sum_key t) -> Tot (serializer32 (sc x))))
(destr: dep_enum_destr (sum_enum t) (serialize32_sum_cases_t t sc))
: Tot (serializer32 (serialize_sum t s sc))
= fun x #rrel #rel b pos ->
serialize_sum_eq t s sc x;
let tg = sum_tag_of_data t x in
serialize32_nondep_then_aux s32 (serialize32_sum_cases t sc sc32 destr tg) tg x b pos
let clens_sum_tag
(s: sum)
: Tot (clens (sum_type s) (sum_key s))
= {
clens_cond = (fun _ -> True);
clens_get = sum_tag_of_data s;
}
let gaccessor_sum_tag
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
: Tot (gaccessor (parse_sum t p pc) (parse_enum_key p (sum_enum t)) (clens_sum_tag t))
= gaccessor_tagged_union_tag
(parse_enum_key p (sum_enum t))
(sum_tag_of_data t)
(parse_sum_cases t pc)
inline_for_extraction
let accessor_sum_tag
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
: Tot (accessor (gaccessor_sum_tag t p pc))
= accessor_tagged_union_tag
(parse_enum_key p (sum_enum t))
(sum_tag_of_data t)
(parse_sum_cases t pc)
let clens_sum_payload
(s: sum)
(k: sum_key s)
: Tot (clens (sum_type s) (sum_type_of_tag s k))
= {
clens_cond = (fun (x: sum_type s) -> sum_tag_of_data s x == k);
clens_get = (fun (x: sum_type s) -> synth_sum_case_recip s k x <: Ghost (sum_type_of_tag s k) (requires (sum_tag_of_data s x == k)) (ensures (fun _ -> True)));
}
#push-options "--z3rlimit 32"
let gaccessor_clens_sum_payload'
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (gaccessor' (parse_sum t p pc) (dsnd (pc k)) (clens_sum_payload t k))
= fun (input: bytes) ->
parse_sum_eq'' t p pc input;
let res =
match parse p input with
| Some (_, consumed) ->
synth_sum_case_inverse t k;
synth_sum_case_injective t k;
synth_injective_synth_inverse_synth_inverse_recip (synth_sum_case t k) (synth_sum_case_recip t k) ();
(consumed)
| _ -> 0 // dummy
in
(res <: (res: _ { gaccessor_post' (parse_sum t p pc) (dsnd (pc k)) (clens_sum_payload t k) input res } ))
#push-options "--z3rlimit 64"
let gaccessor_clens_sum_payload_injective
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
(sl sl' : bytes)
: Lemma
(requires (
gaccessor_pre (parse_sum t p pc) (dsnd (pc k)) (clens_sum_payload t k) sl /\
gaccessor_pre (parse_sum t p pc) (dsnd (pc k)) (clens_sum_payload t k) sl' /\
injective_precond (parse_sum t p pc) sl sl'
))
(ensures (gaccessor_clens_sum_payload' t p pc k sl == gaccessor_clens_sum_payload' t p pc k sl'))
= parse_sum_eq'' t p pc sl;
parse_sum_eq'' t p pc sl' ;
parse_injective (parse_sum t p pc) sl sl' ;
parse_injective p sl sl'
#pop-options
let gaccessor_clens_sum_payload_no_lookahead
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
(sl sl' : bytes)
: Lemma
(requires (
(parse_sum_kind kt t pc).parser_kind_subkind == Some ParserStrong /\
gaccessor_pre (parse_sum t p pc) (dsnd (pc k)) (clens_sum_payload t k) sl /\
gaccessor_pre (parse_sum t p pc) (dsnd (pc k)) (clens_sum_payload t k) sl' /\
no_lookahead_on_precond (parse_sum t p pc) sl sl'
))
(ensures (gaccessor_clens_sum_payload' t p pc k sl == gaccessor_clens_sum_payload' t p pc k sl'))
= parse_sum_eq'' t p pc sl;
parse_sum_eq'' t p pc sl' ;
parse_strong_prefix (parse_sum t p pc) sl sl' ;
parse_injective p sl sl'
let gaccessor_clens_sum_payload
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (gaccessor (parse_sum t p pc) (dsnd (pc k)) (clens_sum_payload t k))
= Classical.forall_intro_2 (fun x -> Classical.move_requires (gaccessor_clens_sum_payload_injective t p pc k x));
Classical.forall_intro_2 (fun x -> Classical.move_requires (gaccessor_clens_sum_payload_no_lookahead t p pc k x));
gaccessor_prop_equiv (parse_sum t p pc) (dsnd (pc k)) (clens_sum_payload t k) (gaccessor_clens_sum_payload' t p pc k);
gaccessor_clens_sum_payload' t p pc k
inline_for_extraction
let accessor_clens_sum_payload'
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(j: jumper p)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: HST.Stack U32.t
(requires (fun h ->
valid (parse_sum t p pc) h input pos /\
(clens_sum_payload t k).clens_cond (contents (parse_sum t p pc) h input pos)
))
(ensures (fun h pos' h' ->
B.modifies B.loc_none h h' /\
pos' == slice_access h (gaccessor_clens_sum_payload t p pc k) input pos
))
=
let h = HST.get () in
[@inline_let]
let _ =
let pos' = get_valid_pos (parse_sum t p pc) h input pos in
let large = bytes_of_slice_from h input pos in
slice_access_eq h (gaccessor_clens_sum_payload t p pc k) input pos;
valid_facts (parse_sum t p pc) h input pos;
parse_sum_eq'' t p pc large;
valid_facts p h input pos
in
j input pos
#pop-options
inline_for_extraction
let accessor_clens_sum_payload
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(j: jumper p)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (accessor (gaccessor_clens_sum_payload t p pc k))
= fun #rrel #rel -> accessor_clens_sum_payload' t j pc k #rrel #rel
let clens_sum_cases_payload
(s: sum)
(k: sum_key s)
: Tot (clens (sum_cases s k) (sum_type_of_tag s k))
= {
clens_cond = (fun (x: sum_cases s k) -> True);
clens_get = (fun (x: sum_cases s k) -> synth_sum_case_recip s k x <: Ghost (sum_type_of_tag s k) (requires (True)) (ensures (fun _ -> True)));
}
let gaccessor_clens_sum_cases_payload
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (gaccessor (parse_sum_cases' t pc k) (dsnd (pc k)) (clens_sum_cases_payload t k))
= synth_sum_case_injective t k;
synth_sum_case_inverse t k;
synth_injective_synth_inverse_synth_inverse_recip (synth_sum_case t k) (synth_sum_case_recip t k) ();
gaccessor_ext
(gaccessor_synth (dsnd (pc k)) (synth_sum_case t k) (synth_sum_case_recip t k) ())
(clens_sum_cases_payload t k)
()
inline_for_extraction
let accessor_clens_sum_cases_payload
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (accessor (gaccessor_clens_sum_cases_payload t pc k))
= [@inline_let]
let _ =
synth_sum_case_injective t k;
synth_sum_case_inverse t k;
synth_injective_synth_inverse_synth_inverse_recip (synth_sum_case t k) (synth_sum_case_recip t k) ()
in
accessor_ext
(accessor_synth (dsnd (pc k)) (synth_sum_case t k) (synth_sum_case_recip t k) ())
(clens_sum_cases_payload t k)
()
inline_for_extraction
let validate_dsum_cases_t
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(#k: parser_kind)
(g: parser k (dsum_type_of_unknown_tag s))
(x: dsum_key s)
: Tot Type
= validator (parse_dsum_cases' s f g x)
let validate_dsum_cases_eq
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(#k: parser_kind)
(g: parser k (dsum_type_of_unknown_tag s))
(x: dsum_key s)
(v1 v2 : validate_dsum_cases_t s f g x)
: GTot Type0
= True
inline_for_extraction
let validate_dsum_cases_if'
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(#k: parser_kind)
(g: parser k (dsum_type_of_unknown_tag s))
(x: dsum_key s)
(cond: bool)
(ift: (cond_true cond -> Tot (validate_dsum_cases_t s f g x)))
(iff: (cond_false cond -> Tot (validate_dsum_cases_t s f g x)))
: Tot (validate_dsum_cases_t s f g x)
= fun #rrel #rel input len ->
if cond
then (ift () <: validate_dsum_cases_t s f g x) input len
else (iff () <: validate_dsum_cases_t s f g x) input len
inline_for_extraction
let validate_dsum_cases_if
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(#k: parser_kind)
(g: parser k (dsum_type_of_unknown_tag s))
(x: dsum_key s)
: Tot (if_combinator _ (validate_dsum_cases_eq s f g x))
= validate_dsum_cases_if' s f g x
inline_for_extraction
let validate_dsum_cases'
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(f' : (x: dsum_known_key s) -> Tot (validator (dsnd (f x))))
(#k: parser_kind)
(#g: parser k (dsum_type_of_unknown_tag s))
(g' : validator g)
(x: dsum_key s)
: Tot (validate_dsum_cases_t s f g x)
= [@inline_let]
let _ = synth_dsum_case_injective s x in
match x with
| Known x' -> validate_synth (f' x') (synth_dsum_case s (Known x')) () <: validator (parse_dsum_cases' s f g x)
| Unknown x' -> validate_synth g' (synth_dsum_case s (Unknown x')) () <: validator (parse_dsum_cases' s f g x)
inline_for_extraction
let validate_dsum_cases'_destr
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(f' : (x: dsum_known_key s) -> Tot (validator (dsnd (f x))))
(#k: parser_kind)
(#g: parser k (dsum_type_of_unknown_tag s))
(g' : validator g)
(destr: dep_enum_destr _ (fun k -> validate_dsum_cases_t s f g (Known k)))
(x: dsum_key s)
: Tot (validate_dsum_cases_t s f g x)
= fun #rrel #rel input pos ->
match x with
| Known k ->
destr
_
(fun k -> validate_dsum_cases_if s f g (Known k))
(fun _ _ -> ())
(fun _ _ _ _ -> ())
(fun k -> validate_dsum_cases' s f f' g' (Known k))
k
input
pos
| Unknown r -> validate_dsum_cases' s f f' g' (Unknown r) input pos | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"LowStar.Buffer.fst.checked",
"LowParse.Spec.Sum.fst.checked",
"LowParse.Low.Enum.fst.checked",
"FStar.UInt64.fsti.checked",
"FStar.UInt32.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Int.Cast.fst.checked",
"FStar.HyperStack.ST.fsti.checked",
"FStar.HyperStack.fst.checked",
"FStar.Classical.fsti.checked"
],
"interface_file": false,
"source_file": "LowParse.Low.Sum.fst"
} | [
{
"abbrev": true,
"full_module": "FStar.HyperStack",
"short_module": "HS"
},
{
"abbrev": true,
"full_module": "FStar.UInt64",
"short_module": "U64"
},
{
"abbrev": true,
"full_module": "FStar.Int.Cast",
"short_module": "Cast"
},
{
"abbrev": true,
"full_module": "LowStar.Buffer",
"short_module": "B"
},
{
"abbrev": true,
"full_module": "FStar.HyperStack.ST",
"short_module": "HST"
},
{
"abbrev": true,
"full_module": "FStar.UInt32",
"short_module": "U32"
},
{
"abbrev": false,
"full_module": "LowParse.Spec.Sum",
"short_module": null
},
{
"abbrev": false,
"full_module": "LowParse.Low.Enum",
"short_module": null
},
{
"abbrev": false,
"full_module": "LowParse.Low",
"short_module": null
},
{
"abbrev": false,
"full_module": "LowParse.Low",
"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",
"short_module": null
}
] | {
"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_elim_box": false,
"smtencoding_l_arith_repr": "boxwrap",
"smtencoding_nl_arith_repr": "boxwrap",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": true,
"z3cliopt": [],
"z3refresh": false,
"z3rlimit": 5,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | false |
s: LowParse.Spec.Sum.dsum ->
f:
(x: LowParse.Spec.Sum.dsum_known_key s
-> Prims.dtuple2 LowParse.Spec.Base.parser_kind
(fun k -> LowParse.Spec.Base.parser k (LowParse.Spec.Sum.dsum_type_of_known_tag s x))) ->
f':
(x: LowParse.Spec.Sum.dsum_known_key s
-> LowParse.Low.Base.validator (FStar.Pervasives.dsnd (f x))) ->
g': LowParse.Low.Base.validator g ->
destr:
LowParse.Spec.Enum.dep_enum_destr (LowParse.Spec.Sum.dsum_enum s)
(fun k -> LowParse.Low.Sum.validate_dsum_cases_t s f g (LowParse.Spec.Enum.Known k)) ->
x: LowParse.Spec.Sum.dsum_key s
-> LowParse.Low.Base.validator (LowParse.Spec.Sum.parse_dsum_cases s f g x) | Prims.Tot | [
"total"
] | [] | [
"LowParse.Spec.Sum.dsum",
"LowParse.Spec.Sum.dsum_known_key",
"Prims.dtuple2",
"LowParse.Spec.Base.parser_kind",
"LowParse.Spec.Base.parser",
"LowParse.Spec.Sum.dsum_type_of_known_tag",
"LowParse.Low.Base.validator",
"Prims.__proj__Mkdtuple2__item___1",
"FStar.Pervasives.dsnd",
"LowParse.Spec.Sum.dsum_type_of_unknown_tag",
"LowParse.Spec.Enum.dep_enum_destr",
"LowParse.Spec.Sum.dsum_key_type",
"LowParse.Spec.Sum.dsum_repr_type",
"LowParse.Spec.Sum.dsum_enum",
"LowParse.Spec.Enum.enum_key",
"LowParse.Low.Sum.validate_dsum_cases_t",
"LowParse.Spec.Enum.Known",
"LowParse.Spec.Sum.dsum_key",
"LowParse.Slice.srel",
"LowParse.Bytes.byte",
"LowParse.Slice.slice",
"FStar.UInt64.t",
"LowParse.Low.Sum.validate_dsum_cases'_destr",
"Prims.unit",
"LowParse.Spec.Sum.parse_dsum_cases_eq'",
"LowParse.Slice.bytes_of_slice_from",
"LowParse.Low.ErrorCode.uint64_to_uint32",
"LowParse.Low.Base.Spec.valid_facts",
"LowParse.Spec.Sum.weaken_parse_dsum_cases_kind",
"LowParse.Spec.Sum.dsum_cases",
"LowParse.Spec.Sum.parse_dsum_cases",
"LowParse.Spec.Sum.parse_dsum_cases_kind",
"LowParse.Spec.Sum.parse_dsum_cases'",
"FStar.Monotonic.HyperStack.mem",
"FStar.HyperStack.ST.get"
] | [] | false | false | false | false | false | let validate_dsum_cases
(s: dsum)
(f: (x: dsum_known_key s -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x))))
(f': (x: dsum_known_key s -> Tot (validator (dsnd (f x)))))
(#k: parser_kind)
(#g: parser k (dsum_type_of_unknown_tag s))
(g': validator g)
(destr: dep_enum_destr _ (fun k -> validate_dsum_cases_t s f g (Known k)))
(x: dsum_key s)
: Tot (validator (parse_dsum_cases s f g x)) =
| fun #rrel #rel input pos ->
let h = HST.get () in
[@@ inline_let ]let _ =
valid_facts (parse_dsum_cases' s f g x) h input (uint64_to_uint32 pos);
valid_facts (parse_dsum_cases s f g x) h input (uint64_to_uint32 pos);
parse_dsum_cases_eq' s f g x (bytes_of_slice_from h input (uint64_to_uint32 pos))
in
validate_dsum_cases'_destr s f f' g' destr x input pos | false |
LowParse.Low.Sum.fst | LowParse.Low.Sum.serialize32_dsum_cases_t_eq | val serialize32_dsum_cases_t_eq
(t: dsum)
(f: (x: dsum_known_key t -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x))))
(sf: (x: dsum_known_key t -> Tot (serializer (dsnd (f x)))))
(#k': parser_kind)
(g: parser k' (dsum_type_of_unknown_tag t))
(sg: serializer g)
(k: dsum_known_key t)
(x y: serialize32_dsum_cases_t t f sf g sg k)
: GTot Type0 | val serialize32_dsum_cases_t_eq
(t: dsum)
(f: (x: dsum_known_key t -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x))))
(sf: (x: dsum_known_key t -> Tot (serializer (dsnd (f x)))))
(#k': parser_kind)
(g: parser k' (dsum_type_of_unknown_tag t))
(sg: serializer g)
(k: dsum_known_key t)
(x y: serialize32_dsum_cases_t t f sf g sg k)
: GTot Type0 | let serialize32_dsum_cases_t_eq
(t: dsum)
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(sf: (x: dsum_known_key t) -> Tot (serializer (dsnd (f x))))
(#k': parser_kind)
(g: parser k' (dsum_type_of_unknown_tag t))
(sg: serializer g)
(k: dsum_known_key t)
(x y: serialize32_dsum_cases_t t f sf g sg k)
: GTot Type0
= True | {
"file_name": "src/lowparse/LowParse.Low.Sum.fst",
"git_rev": "00217c4a89f5ba56002ba9aa5b4a9d5903bfe9fa",
"git_url": "https://github.com/project-everest/everparse.git",
"project_name": "everparse"
} | {
"end_col": 6,
"end_line": 1691,
"start_col": 0,
"start_line": 1681
} | module LowParse.Low.Sum
include LowParse.Low.Enum
include LowParse.Spec.Sum
module U32 = FStar.UInt32
module HST = FStar.HyperStack.ST
module B = LowStar.Buffer
module Cast = FStar.Int.Cast
module U64 = FStar.UInt64
inline_for_extraction
let validate_sum_cases_aux
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(vc: ((x: sum_key t) -> Tot (validator (dsnd (pc x)))))
(k: sum_key t)
: Tot (validator (parse_sum_cases t pc k))
= [@inline_let]
let _ = synth_sum_case_injective t k in
validate_synth
(validate_weaken
(weaken_parse_cases_kind t pc)
(vc k)
()
)
(synth_sum_case t k)
()
inline_for_extraction
let validate_sum_cases_t
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot Type
= validator (parse_sum_cases t pc k)
let validate_sum_cases_t_eq
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
(x y : validate_sum_cases_t t pc k)
: GTot Type0
= True
inline_for_extraction
let validate_sum_cases_t_if
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (if_combinator _ (validate_sum_cases_t_eq t pc k))
= fun cond (sv_true: cond_true cond -> Tot (validate_sum_cases_t t pc k)) (sv_false: cond_false cond -> Tot (validate_sum_cases_t t pc k)) #rrel #rel input pos ->
if cond
then sv_true () input pos
else sv_false () input pos
inline_for_extraction
let validate_sum_cases
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(vc: ((x: sum_key t) -> Tot (validator (dsnd (pc x)))))
(destr: dep_enum_destr (sum_enum t) (validate_sum_cases_t t pc))
(k: sum_key t)
: Tot (validator (parse_sum_cases t pc k))
= destr
_
(validate_sum_cases_t_if t pc)
(fun _ _ -> ())
(fun _ _ _ _ -> ())
(validate_sum_cases_aux t pc vc)
k
inline_for_extraction
let validate_sum_aux_payload_t
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
: Tot Type
= (#rrel: _) -> (#rel: _) ->
(input: slice rrel rel) ->
(pos: U64.t) ->
HST.Stack U64.t
(requires (fun h -> live_slice h input /\ U64.v pos <= U32.v input.len))
(ensures (fun h res h' ->
B.modifies B.loc_none h h' /\ (
match k with
| Unknown _ -> is_error res
| Known k' ->
if is_success res
then
valid_pos (dsnd (pc k')) h input (uint64_to_uint32 pos) (uint64_to_uint32 res)
else
(~ (valid (dsnd (pc k')) h input (uint64_to_uint32 pos)))
)))
let validate_sum_aux_payload_eq
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
: Tot (validate_sum_aux_payload_t t pc k -> validate_sum_aux_payload_t t pc k -> GTot Type0)
= fun _ _ -> True
inline_for_extraction
let validate_sum_aux_payload_if'
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
(cond: bool)
(ift: ((cond_true cond) -> Tot (validate_sum_aux_payload_t t pc k)))
(iff: ((cond_false cond) -> Tot (validate_sum_aux_payload_t t pc k)))
: Tot (validate_sum_aux_payload_t t pc k)
= fun #rrel #rel input pos ->
if cond
then begin
(ift () <: validate_sum_aux_payload_t t pc k) input pos
end else
(iff () <: validate_sum_aux_payload_t t pc k) input pos
inline_for_extraction
let validate_sum_aux_payload_if
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
: Tot (if_combinator _ (validate_sum_aux_payload_eq t pc k))
= validate_sum_aux_payload_if' t pc k
#push-options "--z3rlimit 64 --z3cliopt smt.arith.nl=false --using_facts_from '* -FStar.Int.Cast -LowParse.BitFields'"
// --query_stats --smtencoding.elim_box true --smtencoding.l_arith_repr native --z3refresh"
inline_for_extraction
let validate_sum_aux
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(v: validator p)
(p32: leaf_reader p)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(v_payload: ((k: sum_repr_type t)) -> Tot (validate_sum_aux_payload_t t pc (maybe_enum_key_of_repr (sum_enum t) k)))
: Tot (validator (parse_sum t p pc))
= fun #rrel #rel input pos ->
let h = HST.get () in
[@inline_let]
let _ = parse_sum_eq'' t p pc (bytes_of_slice_from h input (uint64_to_uint32 pos)) in
[@inline_let]
let _ = valid_facts (parse_sum t p pc) h input (uint64_to_uint32 pos) in
[@inline_let]
let _ = valid_facts p h input (uint64_to_uint32 pos) in
let len_after_tag = v input pos in
if is_error len_after_tag
then len_after_tag
else begin
let h1 = HST.get () in
let k' = p32 input (uint64_to_uint32 pos) in
[@inline_let]
let _ =
match maybe_enum_key_of_repr (sum_enum t) k' with
| Known k -> valid_facts (dsnd (pc k)) h input (uint64_to_uint32 len_after_tag)
| _ -> ()
in
v_payload k' input len_after_tag
end
#pop-options
inline_for_extraction
let validate_sum_aux_payload'
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (validator (dsnd (pc x)))))
(k: maybe_enum_key (sum_enum t))
: Tot (validate_sum_aux_payload_t t pc k)
= fun #rrel #rel input pos ->
match k with
| Known k ->
[@inline_let]
let _ = synth_sum_case_injective t k in
pc32 k input pos
// validate_synth (pc32 k) (synth_sum_case t k) () input pos
| _ -> validator_error_generic
inline_for_extraction
let validate_sum_aux_payload
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (validator (dsnd (pc x)))))
(destr: dep_maybe_enum_destr_t (sum_enum t) (validate_sum_aux_payload_t t pc))
(k: sum_repr_type t)
: Tot (validate_sum_aux_payload_t t pc (maybe_enum_key_of_repr (sum_enum t) k))
= destr (validate_sum_aux_payload_eq t pc) (validate_sum_aux_payload_if t pc) (fun _ _ -> ()) (fun _ _ _ _ -> ()) (validate_sum_aux_payload' t pc pc32) k
inline_for_extraction
let validate_sum
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(v: validator p)
(p32: leaf_reader p)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (validator (dsnd (pc x)))))
(destr: dep_maybe_enum_destr_t (sum_enum t) (validate_sum_aux_payload_t t pc))
: Tot (validator (parse_sum t p pc))
= validate_sum_aux t v p32 pc (validate_sum_aux_payload t pc pc32 destr)
module HS = FStar.HyperStack
#push-options "--z3rlimit 256 --z3cliopt smt.arith.nl=false --initial_ifuel 8 --max_ifuel 8 --initial_fuel 2 --max_fuel 2"
#restart-solver
let valid_sum_intro
(h: HS.mem)
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: Lemma
(requires (
valid (parse_enum_key p (sum_enum t)) h input pos /\ (
let k = contents (parse_enum_key p (sum_enum t)) h input pos in
valid (dsnd (pc k)) h input (get_valid_pos (parse_enum_key p (sum_enum t)) h input pos)
)))
(ensures (
let k = contents (parse_enum_key p (sum_enum t)) h input pos in
let pos_payload = get_valid_pos (parse_enum_key p (sum_enum t)) h input pos in
valid_content_pos
(parse_sum t p pc) h input pos
(synth_sum_case t k (contents (dsnd (pc k)) h input pos_payload))
(get_valid_pos (dsnd (pc k)) h input pos_payload)
))
= valid_facts (parse_enum_key p (sum_enum t)) h input pos;
let k = contents (parse_enum_key p (sum_enum t)) h input pos in
let pos_payload = get_valid_pos (parse_enum_key p (sum_enum t)) h input pos in
valid_facts (dsnd (pc k)) h input pos_payload;
valid_facts (parse_sum t p pc) h input pos;
parse_sum_eq t p pc (bytes_of_slice_from h input pos)
#pop-options
inline_for_extraction
let finalize_sum_case
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(s: serializer p)
(w: leaf_writer_strong s)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(destr: enum_repr_of_key'_t (sum_enum t))
(k: sum_key t)
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: HST.Stack unit
(requires (fun h ->
let len_tag = serialized_length (serialize_enum_key _ s (sum_enum t)) k in
U32.v pos + len_tag < 4294967296 /\ (
let pos_payload = pos `U32.add` U32.uint_to_t len_tag in
valid (dsnd (pc k)) h input pos_payload /\
writable input.base (U32.v pos) (U32.v pos_payload) h
)))
(ensures (fun h _ h' ->
let len_tag = serialized_length (serialize_enum_key _ s (sum_enum t)) k in
let pos_payload = pos `U32.add` U32.uint_to_t len_tag in
B.modifies (loc_slice_from_to input pos pos_payload) h h' /\
valid_content_pos (parse_sum t p pc) h' input pos (synth_sum_case t k (contents (dsnd (pc k)) h input pos_payload)) (get_valid_pos (dsnd (pc k)) h input pos_payload)
))
= let pos1 = write_enum_key w (sum_enum t) destr k input pos in
let h = HST.get () in
[@inline_let]
let _ = valid_sum_intro h t p pc input pos in
()
inline_for_extraction
let jump_sum_cases_aux
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(vc: ((x: sum_key t) -> Tot (jumper (dsnd (pc x)))))
(k: sum_key t)
: Tot (jumper (parse_sum_cases t pc k))
= [@inline_let]
let _ = synth_sum_case_injective t k in
jump_synth
(jump_weaken
(weaken_parse_cases_kind t pc)
(vc k)
()
)
(synth_sum_case t k)
()
inline_for_extraction
let jump_sum_cases_t
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot Type
= jumper (parse_sum_cases t pc k)
let jump_sum_cases_t_eq
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
(x y : jump_sum_cases_t t pc k)
: GTot Type0
= True
inline_for_extraction
let jump_sum_cases_t_if
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (if_combinator _ (jump_sum_cases_t_eq t pc k))
= fun cond (sv_true: cond_true cond -> Tot (jump_sum_cases_t t pc k)) (sv_false: cond_false cond -> Tot (jump_sum_cases_t t pc k)) #rrel #rel input pos ->
if cond
then sv_true () input pos
else sv_false () input pos
inline_for_extraction
let jump_sum_cases
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(vc: ((x: sum_key t) -> Tot (jumper (dsnd (pc x)))))
(destr: dep_enum_destr (sum_enum t) (jump_sum_cases_t t pc))
(k: sum_key t)
: Tot (jumper (parse_sum_cases t pc k))
= destr
_
(jump_sum_cases_t_if t pc)
(fun _ _ -> ())
(fun _ _ _ _ -> ())
(jump_sum_cases_aux t pc vc)
k
inline_for_extraction
let jump_sum_aux_payload_t
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
: Tot Type
= (#rrel: _) -> (#rel: _) ->
(input: slice rrel rel) ->
(pos: U32.t) ->
HST.Stack U32.t
(requires (fun h -> live_slice h input /\ U32.v pos <= U32.v input.len /\ (
match k with
| Unknown _ -> False
| Known k' -> valid (dsnd (pc k')) h input pos
)))
(ensures (fun h res h' ->
B.modifies B.loc_none h h' /\ (
match k with
| Unknown _ -> False
| Known k' ->
valid_pos (dsnd (pc k')) h input pos res
)))
let jump_sum_aux_payload_eq
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
: Tot (jump_sum_aux_payload_t t pc k -> jump_sum_aux_payload_t t pc k -> GTot Type0)
= fun _ _ -> True
inline_for_extraction
let jump_sum_aux_payload_if'
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
(cond: bool)
(ift: ((cond_true cond) -> Tot (jump_sum_aux_payload_t t pc k)))
(iff: ((cond_false cond) -> Tot (jump_sum_aux_payload_t t pc k)))
: Tot (jump_sum_aux_payload_t t pc k)
= fun #rrel #rel input pos ->
if cond
then begin
(ift () <: jump_sum_aux_payload_t t pc k) input pos
end else
(iff () <: jump_sum_aux_payload_t t pc k) input pos
inline_for_extraction
let jump_sum_aux_payload_if
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
: Tot (if_combinator _ (jump_sum_aux_payload_eq t pc k))
= jump_sum_aux_payload_if' t pc k
let parse_sum_eq3
(#kt: parser_kind)
(t: sum)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(input: bytes)
(k' : sum_repr_type t)
(consumed_k: consumed_length input)
: Lemma
(requires (Some? (parse (parse_sum t p pc) input) /\ parse p input == Some (k', consumed_k)))
(ensures (
let input_k = Seq.slice input consumed_k (Seq.length input) in
let k = maybe_enum_key_of_repr (sum_enum t) k' in
begin match k with
| Known k ->
Some? (parse (dsnd (pc k)) input_k)
| _ -> False
end
))
= parse_sum_eq'' t p pc input
let parse_sum_eq4
(#kt: parser_kind)
(t: sum)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(input: bytes)
(k' : sum_repr_type t)
(consumed_k: consumed_length input)
(consumed_payload: nat)
: Lemma
(requires (Some? (parse (parse_sum t p pc) input) /\ parse p input == Some (k', consumed_k) /\ (
let input_k = Seq.slice input consumed_k (Seq.length input) in
let k = maybe_enum_key_of_repr (sum_enum t) k' in
begin match k with
| Known k ->
Some? (parse (dsnd (pc k)) input_k) /\ (
let Some (_, consumed_payload') = parse (dsnd (pc k)) input_k in
consumed_payload' == consumed_payload
)
| _ -> False
end
)))
(ensures (
let Some (_, consumed) = parse (parse_sum t p pc) input in
consumed == consumed_k + consumed_payload
))
= parse_sum_eq'' t p pc input
#push-options "--z3rlimit 16"
let valid_sum_elim
(h: HS.mem)
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(#rrel: _) (#rel: _)
(input: slice rrel rel)
(pos: U32.t)
: Lemma
(requires (
valid (parse_sum t p pc) h input pos
))
(ensures (
valid p h input pos /\ (
let pos_payload = get_valid_pos p h input pos in
let k' = maybe_enum_key_of_repr (sum_enum t) (contents p h input pos) in
match k' with
| Known k ->
k == sum_tag_of_data t (contents (parse_sum t p pc) h input pos) /\
valid (dsnd (pc k)) h input pos_payload /\
valid_pos
(parse_sum t p pc) h input pos
(get_valid_pos (dsnd (pc k)) h input pos_payload)
| _ -> False
)))
= let sinput = bytes_of_slice_from h input pos in
let _ = parse_sum_eq'' t p pc sinput in
[@inline_let]
let _ = valid_facts (parse_sum t p pc) h input pos in
let Some (k', consumed_k) = parse p sinput in
let pos_after_tag = U32.uint_to_t (U32.v pos + consumed_k) in
[@inline_let]
let _ = valid_facts p h input pos in
assert (valid_content_pos p h input pos k' pos_after_tag);
match maybe_enum_key_of_repr (sum_enum t) k' with
| Known k -> valid_facts (dsnd (pc k)) h input pos_after_tag
| _ -> ()
#pop-options
let valid_sum_elim_tag
(h: HS.mem)
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: Lemma
(requires (
valid (parse_sum t p pc) h input pos
))
(ensures (
valid (parse_enum_key p (sum_enum t)) h input pos /\
contents (parse_enum_key p (sum_enum t)) h input pos == sum_tag_of_data t (contents (parse_sum t p pc) h input pos)
))
= let _ = parse_sum_eq' t p pc (bytes_of_slice_from h input pos) in
let _ = valid_facts (parse_sum t p pc) h input pos in
let _ = valid_facts (parse_enum_key p (sum_enum t)) h input pos in
()
inline_for_extraction
let read_sum_tag
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(p32: leaf_reader p)
(destr: dep_maybe_enum_destr_t (sum_enum t) (read_enum_key_t (sum_enum t)))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: HST.Stack (sum_key t)
(requires (fun h ->
valid (parse_sum t p pc) h input pos
))
(ensures (fun h res h' ->
B.modifies B.loc_none h h' /\
res == sum_tag_of_data t (contents (parse_sum t p pc) h input pos)
))
= let h = HST.get () in
[@inline_let] let _ = valid_sum_elim_tag h t p pc input pos in
read_enum_key p32 (sum_enum t) destr input pos
inline_for_extraction
let jump_sum_aux
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(v: jumper p)
(p32: leaf_reader p)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(v_payload: ((k: sum_repr_type t)) -> Tot (jump_sum_aux_payload_t t pc (maybe_enum_key_of_repr (sum_enum t) k)))
: Tot (jumper (parse_sum t p pc))
= fun #rrel #rel input pos ->
let h = HST.get () in
[@inline_let]
let _ = valid_sum_elim h t p pc input pos in
let pos_after_tag = v input pos in
let k' = p32 input pos in
v_payload k' input pos_after_tag
inline_for_extraction
let jump_sum_aux_payload'
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (jumper (dsnd (pc x)))))
(k: maybe_enum_key (sum_enum t))
: Tot (jump_sum_aux_payload_t t pc k)
= fun #rrel #rel input pos ->
match k with
| Known k ->
[@inline_let]
let _ = synth_sum_case_injective t k in
pc32 k input pos
| _ -> 0ul // dummy, but we MUST NOT remove this branch, otherwise extraction fails
inline_for_extraction
let jump_sum_aux_payload
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (jumper (dsnd (pc x)))))
(destr: dep_maybe_enum_destr_t (sum_enum t) (jump_sum_aux_payload_t t pc))
(k: sum_repr_type t)
: Tot (jump_sum_aux_payload_t t pc (maybe_enum_key_of_repr (sum_enum t) k))
= destr (jump_sum_aux_payload_eq t pc) (jump_sum_aux_payload_if t pc) (fun _ _ -> ()) (fun _ _ _ _ -> ()) (jump_sum_aux_payload' t pc pc32) k
inline_for_extraction
let jump_sum
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(v: jumper p)
(p32: leaf_reader p)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (jumper (dsnd (pc x)))))
(destr: dep_maybe_enum_destr_t (sum_enum t) (jump_sum_aux_payload_t t pc))
: Tot (jumper (parse_sum t p pc))
= jump_sum_aux t v p32 pc (jump_sum_aux_payload t pc pc32 destr)
inline_for_extraction
let read_sum_cases'
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (leaf_reader (dsnd (pc x)))))
(k: sum_key t)
: Tot (leaf_reader (parse_sum_cases' t pc k))
= [@inline_let]
let _ = synth_sum_case_injective t k in
read_synth'
(dsnd (pc k))
(synth_sum_case t k)
(pc32 k)
()
inline_for_extraction
let read_sum_cases_t
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot Type
= leaf_reader (parse_sum_cases' t pc k)
let read_sum_cases_t_eq
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
(x y : read_sum_cases_t t pc k)
: GTot Type0
= True
inline_for_extraction
let read_sum_cases_t_if
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (if_combinator _ (read_sum_cases_t_eq t pc k))
= fun cond (sv_true: cond_true cond -> Tot (read_sum_cases_t t pc k)) (sv_false: cond_false cond -> Tot (read_sum_cases_t t pc k)) #_ #_ input pos ->
if cond
then (sv_true () input pos)
else (sv_false () input pos)
inline_for_extraction
let read_sum_cases
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (leaf_reader (dsnd (pc x)))))
(destr: dep_enum_destr (sum_enum t) (read_sum_cases_t t pc))
(k: sum_key t)
: Tot (leaf_reader (parse_sum_cases' t pc k))
= destr
_
(read_sum_cases_t_if t pc)
(fun _ _ -> ())
(fun _ _ _ _ -> ())
(read_sum_cases' t pc pc32)
k
#push-options "--z3rlimit 32"
inline_for_extraction
let read_sum
(#kt: parser_kind)
(t: sum)
(p: parser kt (sum_repr_type t))
(p32: leaf_reader (parse_enum_key p (sum_enum t)))
(j: jumper p)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (leaf_reader (dsnd (pc x)))))
(destr: dep_enum_destr (sum_enum t) (read_sum_cases_t t pc))
: Tot (leaf_reader (parse_sum t p pc))
=
fun #_ #_ input pos ->
let h = HST.get () in
valid_facts (parse_sum t p pc) h input pos;
parse_sum_eq' t p pc (bytes_of_slice_from h input pos);
valid_facts (parse_enum_key p (sum_enum t)) h input pos;
let k = p32 input pos in
let pos' = jump_enum_key j (sum_enum t) input pos in
valid_facts (parse_sum_cases' t pc k) h input pos' ;
read_sum_cases t pc pc32 destr k input pos'
#pop-options
inline_for_extraction
let serialize32_sum_cases_t
(t: sum)
(#pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(sc: ((x: sum_key t) -> Tot (serializer (dsnd (pc x)))))
(k: sum_key t)
: Tot Type
= serializer32 (serialize_sum_cases t pc sc k)
let serialize32_sum_cases_t_eq
(t: sum)
(#pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(sc: ((x: sum_key t) -> Tot (serializer (dsnd (pc x)))))
(k: sum_key t)
(x y: serialize32_sum_cases_t t sc k)
: GTot Type0
= True
inline_for_extraction
let serialize32_sum_cases_t_if
(t: sum)
(#pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(sc: ((x: sum_key t) -> Tot (serializer (dsnd (pc x)))))
(k: sum_key t)
: Tot (if_combinator _ (serialize32_sum_cases_t_eq t sc k))
= fun cond (sv_true: (cond_true cond -> Tot (serialize32_sum_cases_t t sc k))) (sv_false: (cond_false cond -> Tot (serialize32_sum_cases_t t sc k))) x #rrel #rel b pos ->
if cond
then (sv_true () x b pos)
else (sv_false () x b pos)
inline_for_extraction
let serialize32_sum_cases_aux
(t: sum)
(#pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(sc: ((x: sum_key t) -> Tot (serializer (dsnd (pc x)))))
(sc32: ((x: sum_key t) -> Tot (serializer32 (sc x))))
(k: sum_key t)
: Tot (serializer32 (serialize_sum_cases t pc sc k))
= fun x #rrel #rel b pos ->
[@inline_let] let _ =
Classical.forall_intro (parse_sum_cases_eq' t pc k);
synth_sum_case_injective t k;
synth_sum_case_inverse t k
in
serialize32_synth
(sc32 k)
(synth_sum_case t k)
(synth_sum_case_recip t k)
(fun x -> synth_sum_case_recip t k x)
()
x
b
pos
inline_for_extraction
let serialize32_sum_cases
(t: sum)
(#pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(sc: ((x: sum_key t) -> Tot (serializer (dsnd (pc x)))))
(sc32: ((x: sum_key t) -> Tot (serializer32 (sc x))))
(destr: dep_enum_destr (sum_enum t) (serialize32_sum_cases_t t sc))
(k: sum_key t)
: Tot (serializer32 (serialize_sum_cases t pc sc k))
= destr
_
(serialize32_sum_cases_t_if t sc)
(fun _ _ -> ())
(fun _ _ _ _ -> ())
(serialize32_sum_cases_aux t sc sc32)
k
inline_for_extraction
let serialize32_sum
(#kt: parser_kind)
(t: sum)
(#p: parser kt (sum_repr_type t))
(s: serializer p {kt.parser_kind_subkind == Some ParserStrong})
(s32: serializer32 (serialize_enum_key _ s (sum_enum t)))
(#pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(sc: ((x: sum_key t) -> Tot (serializer (dsnd (pc x)))))
(sc32: ((x: sum_key t) -> Tot (serializer32 (sc x))))
(destr: dep_enum_destr (sum_enum t) (serialize32_sum_cases_t t sc))
: Tot (serializer32 (serialize_sum t s sc))
= fun x #rrel #rel b pos ->
serialize_sum_eq t s sc x;
let tg = sum_tag_of_data t x in
serialize32_nondep_then_aux s32 (serialize32_sum_cases t sc sc32 destr tg) tg x b pos
let clens_sum_tag
(s: sum)
: Tot (clens (sum_type s) (sum_key s))
= {
clens_cond = (fun _ -> True);
clens_get = sum_tag_of_data s;
}
let gaccessor_sum_tag
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
: Tot (gaccessor (parse_sum t p pc) (parse_enum_key p (sum_enum t)) (clens_sum_tag t))
= gaccessor_tagged_union_tag
(parse_enum_key p (sum_enum t))
(sum_tag_of_data t)
(parse_sum_cases t pc)
inline_for_extraction
let accessor_sum_tag
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
: Tot (accessor (gaccessor_sum_tag t p pc))
= accessor_tagged_union_tag
(parse_enum_key p (sum_enum t))
(sum_tag_of_data t)
(parse_sum_cases t pc)
let clens_sum_payload
(s: sum)
(k: sum_key s)
: Tot (clens (sum_type s) (sum_type_of_tag s k))
= {
clens_cond = (fun (x: sum_type s) -> sum_tag_of_data s x == k);
clens_get = (fun (x: sum_type s) -> synth_sum_case_recip s k x <: Ghost (sum_type_of_tag s k) (requires (sum_tag_of_data s x == k)) (ensures (fun _ -> True)));
}
#push-options "--z3rlimit 32"
let gaccessor_clens_sum_payload'
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (gaccessor' (parse_sum t p pc) (dsnd (pc k)) (clens_sum_payload t k))
= fun (input: bytes) ->
parse_sum_eq'' t p pc input;
let res =
match parse p input with
| Some (_, consumed) ->
synth_sum_case_inverse t k;
synth_sum_case_injective t k;
synth_injective_synth_inverse_synth_inverse_recip (synth_sum_case t k) (synth_sum_case_recip t k) ();
(consumed)
| _ -> 0 // dummy
in
(res <: (res: _ { gaccessor_post' (parse_sum t p pc) (dsnd (pc k)) (clens_sum_payload t k) input res } ))
#push-options "--z3rlimit 64"
let gaccessor_clens_sum_payload_injective
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
(sl sl' : bytes)
: Lemma
(requires (
gaccessor_pre (parse_sum t p pc) (dsnd (pc k)) (clens_sum_payload t k) sl /\
gaccessor_pre (parse_sum t p pc) (dsnd (pc k)) (clens_sum_payload t k) sl' /\
injective_precond (parse_sum t p pc) sl sl'
))
(ensures (gaccessor_clens_sum_payload' t p pc k sl == gaccessor_clens_sum_payload' t p pc k sl'))
= parse_sum_eq'' t p pc sl;
parse_sum_eq'' t p pc sl' ;
parse_injective (parse_sum t p pc) sl sl' ;
parse_injective p sl sl'
#pop-options
let gaccessor_clens_sum_payload_no_lookahead
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
(sl sl' : bytes)
: Lemma
(requires (
(parse_sum_kind kt t pc).parser_kind_subkind == Some ParserStrong /\
gaccessor_pre (parse_sum t p pc) (dsnd (pc k)) (clens_sum_payload t k) sl /\
gaccessor_pre (parse_sum t p pc) (dsnd (pc k)) (clens_sum_payload t k) sl' /\
no_lookahead_on_precond (parse_sum t p pc) sl sl'
))
(ensures (gaccessor_clens_sum_payload' t p pc k sl == gaccessor_clens_sum_payload' t p pc k sl'))
= parse_sum_eq'' t p pc sl;
parse_sum_eq'' t p pc sl' ;
parse_strong_prefix (parse_sum t p pc) sl sl' ;
parse_injective p sl sl'
let gaccessor_clens_sum_payload
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (gaccessor (parse_sum t p pc) (dsnd (pc k)) (clens_sum_payload t k))
= Classical.forall_intro_2 (fun x -> Classical.move_requires (gaccessor_clens_sum_payload_injective t p pc k x));
Classical.forall_intro_2 (fun x -> Classical.move_requires (gaccessor_clens_sum_payload_no_lookahead t p pc k x));
gaccessor_prop_equiv (parse_sum t p pc) (dsnd (pc k)) (clens_sum_payload t k) (gaccessor_clens_sum_payload' t p pc k);
gaccessor_clens_sum_payload' t p pc k
inline_for_extraction
let accessor_clens_sum_payload'
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(j: jumper p)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: HST.Stack U32.t
(requires (fun h ->
valid (parse_sum t p pc) h input pos /\
(clens_sum_payload t k).clens_cond (contents (parse_sum t p pc) h input pos)
))
(ensures (fun h pos' h' ->
B.modifies B.loc_none h h' /\
pos' == slice_access h (gaccessor_clens_sum_payload t p pc k) input pos
))
=
let h = HST.get () in
[@inline_let]
let _ =
let pos' = get_valid_pos (parse_sum t p pc) h input pos in
let large = bytes_of_slice_from h input pos in
slice_access_eq h (gaccessor_clens_sum_payload t p pc k) input pos;
valid_facts (parse_sum t p pc) h input pos;
parse_sum_eq'' t p pc large;
valid_facts p h input pos
in
j input pos
#pop-options
inline_for_extraction
let accessor_clens_sum_payload
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(j: jumper p)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (accessor (gaccessor_clens_sum_payload t p pc k))
= fun #rrel #rel -> accessor_clens_sum_payload' t j pc k #rrel #rel
let clens_sum_cases_payload
(s: sum)
(k: sum_key s)
: Tot (clens (sum_cases s k) (sum_type_of_tag s k))
= {
clens_cond = (fun (x: sum_cases s k) -> True);
clens_get = (fun (x: sum_cases s k) -> synth_sum_case_recip s k x <: Ghost (sum_type_of_tag s k) (requires (True)) (ensures (fun _ -> True)));
}
let gaccessor_clens_sum_cases_payload
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (gaccessor (parse_sum_cases' t pc k) (dsnd (pc k)) (clens_sum_cases_payload t k))
= synth_sum_case_injective t k;
synth_sum_case_inverse t k;
synth_injective_synth_inverse_synth_inverse_recip (synth_sum_case t k) (synth_sum_case_recip t k) ();
gaccessor_ext
(gaccessor_synth (dsnd (pc k)) (synth_sum_case t k) (synth_sum_case_recip t k) ())
(clens_sum_cases_payload t k)
()
inline_for_extraction
let accessor_clens_sum_cases_payload
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (accessor (gaccessor_clens_sum_cases_payload t pc k))
= [@inline_let]
let _ =
synth_sum_case_injective t k;
synth_sum_case_inverse t k;
synth_injective_synth_inverse_synth_inverse_recip (synth_sum_case t k) (synth_sum_case_recip t k) ()
in
accessor_ext
(accessor_synth (dsnd (pc k)) (synth_sum_case t k) (synth_sum_case_recip t k) ())
(clens_sum_cases_payload t k)
()
inline_for_extraction
let validate_dsum_cases_t
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(#k: parser_kind)
(g: parser k (dsum_type_of_unknown_tag s))
(x: dsum_key s)
: Tot Type
= validator (parse_dsum_cases' s f g x)
let validate_dsum_cases_eq
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(#k: parser_kind)
(g: parser k (dsum_type_of_unknown_tag s))
(x: dsum_key s)
(v1 v2 : validate_dsum_cases_t s f g x)
: GTot Type0
= True
inline_for_extraction
let validate_dsum_cases_if'
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(#k: parser_kind)
(g: parser k (dsum_type_of_unknown_tag s))
(x: dsum_key s)
(cond: bool)
(ift: (cond_true cond -> Tot (validate_dsum_cases_t s f g x)))
(iff: (cond_false cond -> Tot (validate_dsum_cases_t s f g x)))
: Tot (validate_dsum_cases_t s f g x)
= fun #rrel #rel input len ->
if cond
then (ift () <: validate_dsum_cases_t s f g x) input len
else (iff () <: validate_dsum_cases_t s f g x) input len
inline_for_extraction
let validate_dsum_cases_if
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(#k: parser_kind)
(g: parser k (dsum_type_of_unknown_tag s))
(x: dsum_key s)
: Tot (if_combinator _ (validate_dsum_cases_eq s f g x))
= validate_dsum_cases_if' s f g x
inline_for_extraction
let validate_dsum_cases'
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(f' : (x: dsum_known_key s) -> Tot (validator (dsnd (f x))))
(#k: parser_kind)
(#g: parser k (dsum_type_of_unknown_tag s))
(g' : validator g)
(x: dsum_key s)
: Tot (validate_dsum_cases_t s f g x)
= [@inline_let]
let _ = synth_dsum_case_injective s x in
match x with
| Known x' -> validate_synth (f' x') (synth_dsum_case s (Known x')) () <: validator (parse_dsum_cases' s f g x)
| Unknown x' -> validate_synth g' (synth_dsum_case s (Unknown x')) () <: validator (parse_dsum_cases' s f g x)
inline_for_extraction
let validate_dsum_cases'_destr
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(f' : (x: dsum_known_key s) -> Tot (validator (dsnd (f x))))
(#k: parser_kind)
(#g: parser k (dsum_type_of_unknown_tag s))
(g' : validator g)
(destr: dep_enum_destr _ (fun k -> validate_dsum_cases_t s f g (Known k)))
(x: dsum_key s)
: Tot (validate_dsum_cases_t s f g x)
= fun #rrel #rel input pos ->
match x with
| Known k ->
destr
_
(fun k -> validate_dsum_cases_if s f g (Known k))
(fun _ _ -> ())
(fun _ _ _ _ -> ())
(fun k -> validate_dsum_cases' s f f' g' (Known k))
k
input
pos
| Unknown r -> validate_dsum_cases' s f f' g' (Unknown r) input pos
inline_for_extraction
let validate_dsum_cases
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(f' : (x: dsum_known_key s) -> Tot (validator (dsnd (f x))))
(#k: parser_kind)
(#g: parser k (dsum_type_of_unknown_tag s))
(g' : validator g)
(destr: dep_enum_destr _ (fun k -> validate_dsum_cases_t s f g (Known k)))
(x: dsum_key s)
: Tot (validator (parse_dsum_cases s f g x))
= fun #rrel #rel input pos ->
let h = HST.get () in
[@inline_let]
let _ =
valid_facts (parse_dsum_cases' s f g x) h input (uint64_to_uint32 pos);
valid_facts (parse_dsum_cases s f g x) h input (uint64_to_uint32 pos);
parse_dsum_cases_eq' s f g x (bytes_of_slice_from h input (uint64_to_uint32 pos))
in
validate_dsum_cases'_destr s f f' g' destr x input pos
#push-options "--z3rlimit 40"
inline_for_extraction
let validate_dsum
(#kt: parser_kind)
(t: dsum)
(#p: parser kt (dsum_repr_type t))
(v: validator p)
(p32: leaf_reader p)
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(f32: (x: dsum_known_key t) -> Tot (validator (dsnd (f x))))
(#k': parser_kind)
(#g: parser k' (dsum_type_of_unknown_tag t))
(g32: validator g)
(destr: dep_maybe_enum_destr_t (dsum_enum t) (validate_dsum_cases_t t f g))
: Tot (validator (parse_dsum t p f g))
= fun #rrel #rel input pos ->
let h = HST.get () in
[@inline_let]
let _ = parse_dsum_eq' t p f g (bytes_of_slice_from h input (uint64_to_uint32 pos)) in
[@inline_let]
let _ = valid_facts (parse_dsum t p f g) h input (uint64_to_uint32 pos) in
[@inline_let]
let _ = valid_facts p h input (uint64_to_uint32 pos) in
let pos_after_tag = v input pos in
if is_error pos_after_tag
then pos_after_tag
else
let tg = p32 input (uint64_to_uint32 pos) in
[@inline_let]
let _ = valid_facts (parse_dsum_cases' t f g (maybe_enum_key_of_repr (dsum_enum t) tg)) h input (uint64_to_uint32 pos_after_tag) in
destr (validate_dsum_cases_eq t f g) (validate_dsum_cases_if t f g) (fun _ _ -> ()) (fun _ _ _ _ -> ()) (validate_dsum_cases' t f f32 g32) tg input pos_after_tag
#pop-options
#reset-options "--z3rlimit 64 --z3cliopt smt.arith.nl=false --initial_ifuel 8 --max_ifuel 8 --initial_fuel 2 --max_fuel 2"
let valid_dsum_intro_known
(h: HS.mem)
(t: dsum)
(#kt: parser_kind)
(p: parser kt (dsum_repr_type t))
(f: ((x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x))))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: Lemma
(requires (
valid (parse_maybe_enum_key p (dsum_enum t)) h input pos /\ (
let k' = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
Known? k' /\ (
let Known k = k' in
valid (dsnd (f k)) h input (get_valid_pos (parse_maybe_enum_key p (dsum_enum t)) h input pos)
))))
(ensures (
let Known k = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
let pos_payload = get_valid_pos (parse_maybe_enum_key p (dsum_enum t)) h input pos in
valid_content_pos
(parse_dsum t p f g) h input pos
(synth_dsum_case t (Known k) (contents (dsnd (f k)) h input pos_payload))
(get_valid_pos (dsnd (f k)) h input pos_payload)
))
= valid_facts (parse_maybe_enum_key p (dsum_enum t)) h input pos;
let Known k = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
let pos_payload = get_valid_pos (parse_maybe_enum_key p (dsum_enum t)) h input pos in
valid_facts (dsnd (f k)) h input pos_payload;
valid_facts (parse_dsum t p f g) h input pos;
parse_dsum_eq t p f g (bytes_of_slice_from h input pos)
let valid_dsum_intro_unknown
(h: HS.mem)
(t: dsum)
(#kt: parser_kind)
(p: parser kt (dsum_repr_type t))
(f: ((x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x))))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: Lemma
(requires (
valid (parse_maybe_enum_key p (dsum_enum t)) h input pos /\ (
let k' = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
Unknown? k' /\
valid g h input (get_valid_pos (parse_maybe_enum_key p (dsum_enum t)) h input pos)
)))
(ensures (
let Unknown r = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
let pos_payload = get_valid_pos (parse_maybe_enum_key p (dsum_enum t)) h input pos in
valid_content_pos
(parse_dsum t p f g) h input pos
(synth_dsum_case t (Unknown r) (contents g h input pos_payload))
(get_valid_pos g h input pos_payload)
))
= valid_facts (parse_maybe_enum_key p (dsum_enum t)) h input pos;
let Unknown r = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
let pos_payload = get_valid_pos (parse_maybe_enum_key p (dsum_enum t)) h input pos in
valid_facts g h input pos_payload;
valid_facts (parse_dsum t p f g) h input pos;
parse_dsum_eq t p f g (bytes_of_slice_from h input pos)
#reset-options
inline_for_extraction
let finalize_dsum_case_known
(t: dsum)
(#kt: parser_kind)
(#p: parser kt (dsum_repr_type t))
(s: serializer p)
(w: leaf_writer_strong s)
(f: ((x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x))))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
(destr: enum_repr_of_key'_t (dsum_enum t))
(k: dsum_known_key t)
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: HST.Stack unit
(requires (fun h ->
let len_tag = serialized_length (serialize_enum_key _ s (dsum_enum t)) k in
U32.v pos + len_tag < 4294967296 /\ (
let pos_payload = pos `U32.add` U32.uint_to_t len_tag in
valid (dsnd (f k)) h input pos_payload /\
writable input.base (U32.v pos) (U32.v pos_payload) h
)))
(ensures (fun h _ h' ->
let len_tag = serialized_length (serialize_enum_key _ s (dsum_enum t)) k in
let pos_payload = pos `U32.add` U32.uint_to_t len_tag in
B.modifies (loc_slice_from_to input pos pos_payload) h h' /\
valid_content_pos (parse_dsum t p f g) h' input pos (synth_dsum_case t (Known k) (contents (dsnd (f k)) h input pos_payload)) (get_valid_pos (dsnd (f k)) h input pos_payload)
))
= let pos1 = write_enum_key w (dsum_enum t) destr k input pos in
let h = HST.get () in
[@inline_let]
let _ =
valid_facts (parse_enum_key p (dsum_enum t)) h input pos;
valid_facts (parse_maybe_enum_key p (dsum_enum t)) h input pos;
let sq = bytes_of_slice_from h input pos in
parse_enum_key_eq p (dsum_enum t) sq;
parse_maybe_enum_key_eq p (dsum_enum t) sq;
valid_dsum_intro_known h t p f g input pos
in
()
inline_for_extraction
let finalize_dsum_case_unknown
(t: dsum)
(#kt: parser_kind)
(#p: parser kt (dsum_repr_type t))
(s: serializer p)
(w: leaf_writer_strong s)
(f: ((x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x))))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
(r: unknown_enum_repr (dsum_enum t))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: HST.Stack unit
(requires (fun h ->
let len_tag = serialized_length s r in
U32.v pos + len_tag < 4294967296 /\ (
let pos_payload = pos `U32.add` U32.uint_to_t len_tag in
valid g h input pos_payload /\
writable input.base (U32.v pos) (U32.v pos_payload) h
)))
(ensures (fun h _ h' ->
let len_tag = serialized_length s r in
let pos_payload = pos `U32.add` U32.uint_to_t len_tag in
B.modifies (loc_slice_from_to input pos pos_payload) h h' /\
valid_content_pos (parse_dsum t p f g) h' input pos (synth_dsum_case t (Unknown r) (contents g h input pos_payload)) (get_valid_pos g h input pos_payload)
))
= let pos1 = w r input pos in
let h = HST.get () in
[@inline_let]
let _ =
valid_facts (parse_maybe_enum_key p (dsum_enum t)) h input pos;
valid_facts p h input pos;
let sq = bytes_of_slice_from h input pos in
parse_maybe_enum_key_eq p (dsum_enum t) sq;
valid_dsum_intro_unknown h t p f g input pos
in
()
let valid_dsum_elim_tag
(h: HS.mem)
(t: dsum)
(#kt: parser_kind)
(p: parser kt (dsum_repr_type t))
(f: ((x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x))))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: Lemma
(requires (
valid (parse_dsum t p f g) h input pos
))
(ensures (
valid (parse_maybe_enum_key p (dsum_enum t)) h input pos /\
contents (parse_maybe_enum_key p (dsum_enum t)) h input pos == dsum_tag_of_data t (contents (parse_dsum t p f g) h input pos)
))
= let _ = parse_dsum_eq_ t p f g (bytes_of_slice_from h input pos) in
let _ = valid_facts (parse_dsum t p f g) h input pos in
let _ = valid_facts (parse_maybe_enum_key p (dsum_enum t)) h input pos in
()
inline_for_extraction
let read_dsum_tag
(t: dsum)
(#kt: parser_kind)
(#p: parser kt (dsum_repr_type t))
(p32: leaf_reader p)
(destr: maybe_enum_destr_t (maybe_enum_key (dsum_enum t)) (dsum_enum t))
(f: ((x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x))))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: HST.Stack (dsum_key t)
(requires (fun h ->
valid (parse_dsum t p f g) h input pos
))
(ensures (fun h res h' ->
B.modifies B.loc_none h h' /\
res == dsum_tag_of_data t (contents (parse_dsum t p f g) h input pos)
))
= let h = HST.get () in
[@inline_let] let _ = valid_dsum_elim_tag h t p f g input pos in
read_maybe_enum_key p32 (dsum_enum t) destr input pos
#push-options "--z3rlimit 32"
let valid_dsum_elim_known
(h: HS.mem)
(t: dsum)
(#kt: parser_kind)
(p: parser kt (dsum_repr_type t))
(f: ((x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x))))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: Lemma
(requires (
valid (parse_dsum t p f g) h input pos /\
Known? (dsum_tag_of_data t (contents (parse_dsum t p f g) h input pos))
))
(ensures (
valid (parse_maybe_enum_key p (dsum_enum t)) h input pos /\ (
let k' = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
let pos_payload = get_valid_pos (parse_maybe_enum_key p (dsum_enum t)) h input pos in
Known? k' /\ (
let Known k = k' in
valid (dsnd (f k)) h input pos_payload /\
valid_content_pos
(parse_dsum t p f g) h input pos
(synth_dsum_case t (Known k) (contents (dsnd (f k)) h input pos_payload))
(get_valid_pos (dsnd (f k)) h input pos_payload)
))))
=
valid_facts (parse_dsum t p f g) h input pos;
parse_dsum_eq t p f g (bytes_of_slice_from h input pos);
valid_facts (parse_maybe_enum_key p (dsum_enum t)) h input pos;
let Known k = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
let pos_payload = get_valid_pos (parse_maybe_enum_key p (dsum_enum t)) h input pos in
valid_facts (dsnd (f k)) h input pos_payload
#pop-options
let valid_dsum_elim_unknown
(h: HS.mem)
(t: dsum)
(#kt: parser_kind)
(p: parser kt (dsum_repr_type t))
(f: ((x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x))))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: Lemma
(requires (
valid (parse_dsum t p f g) h input pos /\
Unknown? (dsum_tag_of_data t (contents (parse_dsum t p f g) h input pos))
))
(ensures (
valid (parse_maybe_enum_key p (dsum_enum t)) h input pos /\ (
let k' = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
let pos_payload = get_valid_pos (parse_maybe_enum_key p (dsum_enum t)) h input pos in
Unknown? k' /\ (
let Unknown r = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
valid g h input pos_payload /\
valid_content_pos
(parse_dsum t p f g) h input pos
(synth_dsum_case t (Unknown r) (contents g h input pos_payload))
(get_valid_pos g h input pos_payload)
))))
=
valid_facts (parse_dsum t p f g) h input pos;
parse_dsum_eq t p f g (bytes_of_slice_from h input pos);
valid_facts (parse_maybe_enum_key p (dsum_enum t)) h input pos;
let Unknown r = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
let pos_payload = get_valid_pos (parse_maybe_enum_key p (dsum_enum t)) h input pos in
valid_facts g h input pos_payload
inline_for_extraction
let jump_dsum_cases_t
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(#k: parser_kind)
(g: parser k (dsum_type_of_unknown_tag s))
(x: dsum_key s)
: Tot Type
= jumper (parse_dsum_cases' s f g x)
let jump_dsum_cases_eq
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(#k: parser_kind)
(g: parser k (dsum_type_of_unknown_tag s))
(x: dsum_key s)
(v1 v2 : jump_dsum_cases_t s f g x)
: GTot Type0
= True
inline_for_extraction
let jump_dsum_cases_if'
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(#k: parser_kind)
(g: parser k (dsum_type_of_unknown_tag s))
(x: dsum_key s)
(cond: bool)
(ift: (cond_true cond -> Tot (jump_dsum_cases_t s f g x)))
(iff: (cond_false cond -> Tot (jump_dsum_cases_t s f g x)))
: Tot (jump_dsum_cases_t s f g x)
= fun #rrel #rel input len ->
if cond
then (ift () <: jump_dsum_cases_t s f g x) input len
else (iff () <: jump_dsum_cases_t s f g x) input len
inline_for_extraction
let jump_dsum_cases_if
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(#k: parser_kind)
(g: parser k (dsum_type_of_unknown_tag s))
(x: dsum_key s)
: Tot (if_combinator _ (jump_dsum_cases_eq s f g x))
= jump_dsum_cases_if' s f g x
inline_for_extraction
let jump_dsum_cases'
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(f' : (x: dsum_known_key s) -> Tot (jumper (dsnd (f x))))
(#k: parser_kind)
(#g: parser k (dsum_type_of_unknown_tag s))
(g' : jumper g)
(x: dsum_key s)
: Tot (jump_dsum_cases_t s f g x)
= synth_dsum_case_injective s x;
match x with
| Known x' -> jump_synth (f' x') (synth_dsum_case s (Known x')) () <: jumper (parse_dsum_cases' s f g x)
| Unknown x' -> jump_synth g' (synth_dsum_case s (Unknown x')) () <: jumper (parse_dsum_cases' s f g x)
inline_for_extraction
let jump_dsum_cases'_destr
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(f' : (x: dsum_known_key s) -> Tot (jumper (dsnd (f x))))
(#k: parser_kind)
(#g: parser k (dsum_type_of_unknown_tag s))
(g' : jumper g)
(destr: dep_enum_destr _ (fun k -> jump_dsum_cases_t s f g (Known k)))
(x: dsum_key s)
: Tot (jump_dsum_cases_t s f g x)
= fun #rrel #rel input pos ->
match x with
| Known k ->
destr
_
(fun k -> jump_dsum_cases_if s f g (Known k))
(fun _ _ -> ())
(fun _ _ _ _ -> ())
(fun k -> jump_dsum_cases' s f f' g' (Known k))
k
input
pos
| Unknown r -> jump_dsum_cases' s f f' g' (Unknown r) input pos
inline_for_extraction
let jump_dsum_cases
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(f' : (x: dsum_known_key s) -> Tot (jumper (dsnd (f x))))
(#k: parser_kind)
(#g: parser k (dsum_type_of_unknown_tag s))
(g' : jumper g)
(destr: dep_enum_destr _ (fun k -> jump_dsum_cases_t s f g (Known k)))
(x: dsum_key s)
: Tot (jumper (parse_dsum_cases s f g x))
= fun #rrel #rel input pos ->
let h = HST.get () in
[@inline_let]
let _ =
valid_facts (parse_dsum_cases' s f g x) h input pos;
valid_facts (parse_dsum_cases s f g x) h input pos;
parse_dsum_cases_eq' s f g x (bytes_of_slice_from h input pos)
in
jump_dsum_cases'_destr s f f' g' destr x input pos
#push-options "--z3rlimit 16"
inline_for_extraction
let jump_dsum
(#kt: parser_kind)
(t: dsum)
(#p: parser kt (dsum_repr_type t))
(v: jumper p)
(p32: leaf_reader p)
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(f32: (x: dsum_known_key t) -> Tot (jumper (dsnd (f x))))
(#k': parser_kind)
(#g: parser k' (dsum_type_of_unknown_tag t))
(g32: jumper g)
(destr: dep_maybe_enum_destr_t (dsum_enum t) (jump_dsum_cases_t t f g))
: Tot (jumper (parse_dsum t p f g))
= fun #rrel #rel input pos ->
let h = HST.get () in
[@inline_let]
let _ = parse_dsum_eq' t p f g (bytes_of_slice_from h input pos) in
[@inline_let]
let _ = valid_facts (parse_dsum t p f g) h input pos in
[@inline_let]
let _ = valid_facts p h input pos in
let pos_after_tag = v input pos in
let tg = p32 input pos in
[@inline_let]
let _ = valid_facts (parse_dsum_cases' t f g (maybe_enum_key_of_repr (dsum_enum t) tg)) h input pos_after_tag in
destr (jump_dsum_cases_eq t f g) (jump_dsum_cases_if t f g) (fun _ _ -> ()) (fun _ _ _ _ -> ()) (jump_dsum_cases' t f f32 g32) tg input pos_after_tag
#pop-options
inline_for_extraction
let read_dsum_cases'
(t: dsum)
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(f32: (x: dsum_known_key t) -> Tot (leaf_reader (dsnd (f x))))
(#k': parser_kind)
(g: parser k' (dsum_type_of_unknown_tag t))
(g32: leaf_reader g)
(x: dsum_key t)
: Tot (leaf_reader (parse_dsum_cases' t f g x))
= fun #rrel #rel input pos ->
[@inline_let]
let _ = synth_dsum_case_injective t x in
match x with
| Known x' ->
read_synth'
(dsnd (f x'))
(synth_dsum_case t (Known x'))
(f32 x')
()
input
pos
| Unknown x' ->
read_synth'
g
(synth_dsum_case t (Unknown x'))
g32
()
input
pos
inline_for_extraction
let read_dsum_cases_t
(t: dsum)
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(#k': parser_kind)
(g: parser k' (dsum_type_of_unknown_tag t))
(k: dsum_known_key t)
: Tot Type
= leaf_reader (parse_dsum_cases' t f g (Known k))
let read_dsum_cases_t_eq
(t: dsum)
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(#k': parser_kind)
(g: parser k' (dsum_type_of_unknown_tag t))
(k: dsum_known_key t)
(x y : read_dsum_cases_t t f g k)
: GTot Type0
= True
inline_for_extraction
let read_dsum_cases_t_if
(t: dsum)
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(#k': parser_kind)
(g: parser k' (dsum_type_of_unknown_tag t))
(k: dsum_known_key t)
: Tot (if_combinator _ (read_dsum_cases_t_eq t f g k))
= fun cond (sv_true: cond_true cond -> Tot (read_dsum_cases_t t f g k)) (sv_false: cond_false cond -> Tot (read_dsum_cases_t t f g k)) #_ #_ input pos ->
if cond
then sv_true () input pos
else sv_false () input pos
inline_for_extraction
let read_dsum_cases
(t: dsum)
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(f32: (x: dsum_known_key t) -> Tot (leaf_reader (dsnd (f x))))
(#k': parser_kind)
(g: parser k' (dsum_type_of_unknown_tag t))
(g32: leaf_reader g)
(destr: dep_enum_destr _ (read_dsum_cases_t t f g))
(x: dsum_key t)
: Tot (leaf_reader (parse_dsum_cases' t f g x))
= fun #_ #_ input pos ->
match x with
| Known k ->
destr
_
(read_dsum_cases_t_if t f g)
(fun _ _ -> ())
(fun _ _ _ _ -> ())
(fun k -> read_dsum_cases' t f f32 g g32 (Known k))
k
input
pos
| Unknown r ->
read_dsum_cases' t f f32 g g32 (Unknown r) input pos
#push-options "--z3rlimit 16"
inline_for_extraction
let read_dsum
(#kt: parser_kind)
(t: dsum)
(#p: parser kt (dsum_repr_type t))
(p32: leaf_reader (parse_maybe_enum_key p (dsum_enum t)))
(j: jumper p)
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(f32: (x: dsum_known_key t) -> Tot (leaf_reader (dsnd (f x))))
(#k': parser_kind)
(#g: parser k' (dsum_type_of_unknown_tag t))
(g32: leaf_reader g)
(destr: dep_enum_destr _ (read_dsum_cases_t t f g))
: Tot (leaf_reader (parse_dsum t p f g))
= fun #_ #_ input pos ->
let h = HST.get () in
valid_facts (parse_dsum t p f g) h input pos;
parse_dsum_eq_ t p f g (bytes_of_slice_from h input pos);
valid_facts (parse_maybe_enum_key p (dsum_enum t)) h input pos;
let k = p32 input pos in
let pos' = jump_maybe_enum_key j (dsum_enum t) input pos in
valid_facts (parse_dsum_cases' t f g k) h input pos' ;
read_dsum_cases t f f32 g g32 destr k input pos'
#pop-options
inline_for_extraction
let serialize32_dsum_type_of_tag
(t: dsum)
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(sf: (x: dsum_known_key t) -> Tot (serializer (dsnd (f x))))
(sf32: (x: dsum_known_key t) -> Tot (serializer32 (sf x)))
(#k': parser_kind)
(#g: parser k' (dsum_type_of_unknown_tag t))
(#sg: serializer g)
(sg32: serializer32 sg)
(tg: dsum_key t)
: Tot (serializer32 (serialize_dsum_type_of_tag t f sf g sg tg))
= match tg with
| Known x' -> serialize32_ext (dsnd (f x')) (sf x') (sf32 x') (parse_dsum_type_of_tag t f g tg) ()
| Unknown x' -> serialize32_ext g sg sg32 (parse_dsum_type_of_tag t f g tg) ()
inline_for_extraction
let serialize32_dsum_cases_aux
(t: dsum)
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(sf: (x: dsum_known_key t) -> Tot (serializer (dsnd (f x))))
(sf32: (x: dsum_known_key t) -> Tot (serializer32 (sf x)))
(#k': parser_kind)
(#g: parser k' (dsum_type_of_unknown_tag t))
(#sg: serializer g)
(sg32: serializer32 sg)
(tg: dsum_key t)
: Tot (serializer32 (serialize_dsum_cases t f sf g sg tg))
= [@inline_let]
let _ = synth_dsum_case_injective t tg in
[@inline_let]
let _ = synth_dsum_case_inverse t tg in
serialize32_synth
(serialize32_dsum_type_of_tag t f sf sf32 sg32 tg)
(synth_dsum_case t tg)
(synth_dsum_case_recip t tg)
(fun x -> synth_dsum_case_recip t tg x)
()
inline_for_extraction
let serialize32_dsum_cases_t
(t: dsum)
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(sf: (x: dsum_known_key t) -> Tot (serializer (dsnd (f x))))
(#k': parser_kind)
(g: parser k' (dsum_type_of_unknown_tag t))
(sg: serializer g)
(k: dsum_known_key t)
: Tot Type
= serializer32 (serialize_dsum_cases t f sf g sg (Known k)) | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"LowStar.Buffer.fst.checked",
"LowParse.Spec.Sum.fst.checked",
"LowParse.Low.Enum.fst.checked",
"FStar.UInt64.fsti.checked",
"FStar.UInt32.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Int.Cast.fst.checked",
"FStar.HyperStack.ST.fsti.checked",
"FStar.HyperStack.fst.checked",
"FStar.Classical.fsti.checked"
],
"interface_file": false,
"source_file": "LowParse.Low.Sum.fst"
} | [
{
"abbrev": true,
"full_module": "FStar.HyperStack",
"short_module": "HS"
},
{
"abbrev": true,
"full_module": "FStar.UInt64",
"short_module": "U64"
},
{
"abbrev": true,
"full_module": "FStar.Int.Cast",
"short_module": "Cast"
},
{
"abbrev": true,
"full_module": "LowStar.Buffer",
"short_module": "B"
},
{
"abbrev": true,
"full_module": "FStar.HyperStack.ST",
"short_module": "HST"
},
{
"abbrev": true,
"full_module": "FStar.UInt32",
"short_module": "U32"
},
{
"abbrev": false,
"full_module": "LowParse.Spec.Sum",
"short_module": null
},
{
"abbrev": false,
"full_module": "LowParse.Low.Enum",
"short_module": null
},
{
"abbrev": false,
"full_module": "LowParse.Low",
"short_module": null
},
{
"abbrev": false,
"full_module": "LowParse.Low",
"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",
"short_module": null
}
] | {
"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_elim_box": false,
"smtencoding_l_arith_repr": "boxwrap",
"smtencoding_nl_arith_repr": "boxwrap",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": true,
"z3cliopt": [],
"z3refresh": false,
"z3rlimit": 5,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | false |
t: LowParse.Spec.Sum.dsum ->
f:
(x: LowParse.Spec.Sum.dsum_known_key t
-> Prims.dtuple2 LowParse.Spec.Base.parser_kind
(fun k -> LowParse.Spec.Base.parser k (LowParse.Spec.Sum.dsum_type_of_known_tag t x))) ->
sf:
(x: LowParse.Spec.Sum.dsum_known_key t
-> LowParse.Spec.Base.serializer (FStar.Pervasives.dsnd (f x))) ->
g: LowParse.Spec.Base.parser k' (LowParse.Spec.Sum.dsum_type_of_unknown_tag t) ->
sg: LowParse.Spec.Base.serializer g ->
k: LowParse.Spec.Sum.dsum_known_key t ->
x: LowParse.Low.Sum.serialize32_dsum_cases_t t f sf g sg k ->
y: LowParse.Low.Sum.serialize32_dsum_cases_t t f sf g sg k
-> Prims.GTot Type0 | Prims.GTot | [
"sometrivial"
] | [] | [
"LowParse.Spec.Sum.dsum",
"LowParse.Spec.Sum.dsum_known_key",
"Prims.dtuple2",
"LowParse.Spec.Base.parser_kind",
"LowParse.Spec.Base.parser",
"LowParse.Spec.Sum.dsum_type_of_known_tag",
"LowParse.Spec.Base.serializer",
"Prims.__proj__Mkdtuple2__item___1",
"FStar.Pervasives.dsnd",
"LowParse.Spec.Sum.dsum_type_of_unknown_tag",
"LowParse.Low.Sum.serialize32_dsum_cases_t",
"Prims.l_True"
] | [] | false | false | false | false | true | let serialize32_dsum_cases_t_eq
(t: dsum)
(f: (x: dsum_known_key t -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x))))
(sf: (x: dsum_known_key t -> Tot (serializer (dsnd (f x)))))
(#k': parser_kind)
(g: parser k' (dsum_type_of_unknown_tag t))
(sg: serializer g)
(k: dsum_known_key t)
(x y: serialize32_dsum_cases_t t f sf g sg k)
: GTot Type0 =
| True | false |
LowParse.Low.Sum.fst | LowParse.Low.Sum.clens_dsum_tag | val clens_dsum_tag (s: dsum) : Tot (clens (dsum_type s) (dsum_key s)) | val clens_dsum_tag (s: dsum) : Tot (clens (dsum_type s) (dsum_key s)) | let clens_dsum_tag
(s: dsum)
: Tot (clens (dsum_type s) (dsum_key s))
= {
clens_cond = (fun _ -> True);
clens_get = dsum_tag_of_data s;
} | {
"file_name": "src/lowparse/LowParse.Low.Sum.fst",
"git_rev": "00217c4a89f5ba56002ba9aa5b4a9d5903bfe9fa",
"git_url": "https://github.com/project-everest/everparse.git",
"project_name": "everparse"
} | {
"end_col": 3,
"end_line": 1771,
"start_col": 0,
"start_line": 1765
} | module LowParse.Low.Sum
include LowParse.Low.Enum
include LowParse.Spec.Sum
module U32 = FStar.UInt32
module HST = FStar.HyperStack.ST
module B = LowStar.Buffer
module Cast = FStar.Int.Cast
module U64 = FStar.UInt64
inline_for_extraction
let validate_sum_cases_aux
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(vc: ((x: sum_key t) -> Tot (validator (dsnd (pc x)))))
(k: sum_key t)
: Tot (validator (parse_sum_cases t pc k))
= [@inline_let]
let _ = synth_sum_case_injective t k in
validate_synth
(validate_weaken
(weaken_parse_cases_kind t pc)
(vc k)
()
)
(synth_sum_case t k)
()
inline_for_extraction
let validate_sum_cases_t
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot Type
= validator (parse_sum_cases t pc k)
let validate_sum_cases_t_eq
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
(x y : validate_sum_cases_t t pc k)
: GTot Type0
= True
inline_for_extraction
let validate_sum_cases_t_if
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (if_combinator _ (validate_sum_cases_t_eq t pc k))
= fun cond (sv_true: cond_true cond -> Tot (validate_sum_cases_t t pc k)) (sv_false: cond_false cond -> Tot (validate_sum_cases_t t pc k)) #rrel #rel input pos ->
if cond
then sv_true () input pos
else sv_false () input pos
inline_for_extraction
let validate_sum_cases
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(vc: ((x: sum_key t) -> Tot (validator (dsnd (pc x)))))
(destr: dep_enum_destr (sum_enum t) (validate_sum_cases_t t pc))
(k: sum_key t)
: Tot (validator (parse_sum_cases t pc k))
= destr
_
(validate_sum_cases_t_if t pc)
(fun _ _ -> ())
(fun _ _ _ _ -> ())
(validate_sum_cases_aux t pc vc)
k
inline_for_extraction
let validate_sum_aux_payload_t
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
: Tot Type
= (#rrel: _) -> (#rel: _) ->
(input: slice rrel rel) ->
(pos: U64.t) ->
HST.Stack U64.t
(requires (fun h -> live_slice h input /\ U64.v pos <= U32.v input.len))
(ensures (fun h res h' ->
B.modifies B.loc_none h h' /\ (
match k with
| Unknown _ -> is_error res
| Known k' ->
if is_success res
then
valid_pos (dsnd (pc k')) h input (uint64_to_uint32 pos) (uint64_to_uint32 res)
else
(~ (valid (dsnd (pc k')) h input (uint64_to_uint32 pos)))
)))
let validate_sum_aux_payload_eq
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
: Tot (validate_sum_aux_payload_t t pc k -> validate_sum_aux_payload_t t pc k -> GTot Type0)
= fun _ _ -> True
inline_for_extraction
let validate_sum_aux_payload_if'
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
(cond: bool)
(ift: ((cond_true cond) -> Tot (validate_sum_aux_payload_t t pc k)))
(iff: ((cond_false cond) -> Tot (validate_sum_aux_payload_t t pc k)))
: Tot (validate_sum_aux_payload_t t pc k)
= fun #rrel #rel input pos ->
if cond
then begin
(ift () <: validate_sum_aux_payload_t t pc k) input pos
end else
(iff () <: validate_sum_aux_payload_t t pc k) input pos
inline_for_extraction
let validate_sum_aux_payload_if
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
: Tot (if_combinator _ (validate_sum_aux_payload_eq t pc k))
= validate_sum_aux_payload_if' t pc k
#push-options "--z3rlimit 64 --z3cliopt smt.arith.nl=false --using_facts_from '* -FStar.Int.Cast -LowParse.BitFields'"
// --query_stats --smtencoding.elim_box true --smtencoding.l_arith_repr native --z3refresh"
inline_for_extraction
let validate_sum_aux
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(v: validator p)
(p32: leaf_reader p)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(v_payload: ((k: sum_repr_type t)) -> Tot (validate_sum_aux_payload_t t pc (maybe_enum_key_of_repr (sum_enum t) k)))
: Tot (validator (parse_sum t p pc))
= fun #rrel #rel input pos ->
let h = HST.get () in
[@inline_let]
let _ = parse_sum_eq'' t p pc (bytes_of_slice_from h input (uint64_to_uint32 pos)) in
[@inline_let]
let _ = valid_facts (parse_sum t p pc) h input (uint64_to_uint32 pos) in
[@inline_let]
let _ = valid_facts p h input (uint64_to_uint32 pos) in
let len_after_tag = v input pos in
if is_error len_after_tag
then len_after_tag
else begin
let h1 = HST.get () in
let k' = p32 input (uint64_to_uint32 pos) in
[@inline_let]
let _ =
match maybe_enum_key_of_repr (sum_enum t) k' with
| Known k -> valid_facts (dsnd (pc k)) h input (uint64_to_uint32 len_after_tag)
| _ -> ()
in
v_payload k' input len_after_tag
end
#pop-options
inline_for_extraction
let validate_sum_aux_payload'
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (validator (dsnd (pc x)))))
(k: maybe_enum_key (sum_enum t))
: Tot (validate_sum_aux_payload_t t pc k)
= fun #rrel #rel input pos ->
match k with
| Known k ->
[@inline_let]
let _ = synth_sum_case_injective t k in
pc32 k input pos
// validate_synth (pc32 k) (synth_sum_case t k) () input pos
| _ -> validator_error_generic
inline_for_extraction
let validate_sum_aux_payload
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (validator (dsnd (pc x)))))
(destr: dep_maybe_enum_destr_t (sum_enum t) (validate_sum_aux_payload_t t pc))
(k: sum_repr_type t)
: Tot (validate_sum_aux_payload_t t pc (maybe_enum_key_of_repr (sum_enum t) k))
= destr (validate_sum_aux_payload_eq t pc) (validate_sum_aux_payload_if t pc) (fun _ _ -> ()) (fun _ _ _ _ -> ()) (validate_sum_aux_payload' t pc pc32) k
inline_for_extraction
let validate_sum
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(v: validator p)
(p32: leaf_reader p)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (validator (dsnd (pc x)))))
(destr: dep_maybe_enum_destr_t (sum_enum t) (validate_sum_aux_payload_t t pc))
: Tot (validator (parse_sum t p pc))
= validate_sum_aux t v p32 pc (validate_sum_aux_payload t pc pc32 destr)
module HS = FStar.HyperStack
#push-options "--z3rlimit 256 --z3cliopt smt.arith.nl=false --initial_ifuel 8 --max_ifuel 8 --initial_fuel 2 --max_fuel 2"
#restart-solver
let valid_sum_intro
(h: HS.mem)
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: Lemma
(requires (
valid (parse_enum_key p (sum_enum t)) h input pos /\ (
let k = contents (parse_enum_key p (sum_enum t)) h input pos in
valid (dsnd (pc k)) h input (get_valid_pos (parse_enum_key p (sum_enum t)) h input pos)
)))
(ensures (
let k = contents (parse_enum_key p (sum_enum t)) h input pos in
let pos_payload = get_valid_pos (parse_enum_key p (sum_enum t)) h input pos in
valid_content_pos
(parse_sum t p pc) h input pos
(synth_sum_case t k (contents (dsnd (pc k)) h input pos_payload))
(get_valid_pos (dsnd (pc k)) h input pos_payload)
))
= valid_facts (parse_enum_key p (sum_enum t)) h input pos;
let k = contents (parse_enum_key p (sum_enum t)) h input pos in
let pos_payload = get_valid_pos (parse_enum_key p (sum_enum t)) h input pos in
valid_facts (dsnd (pc k)) h input pos_payload;
valid_facts (parse_sum t p pc) h input pos;
parse_sum_eq t p pc (bytes_of_slice_from h input pos)
#pop-options
inline_for_extraction
let finalize_sum_case
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(s: serializer p)
(w: leaf_writer_strong s)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(destr: enum_repr_of_key'_t (sum_enum t))
(k: sum_key t)
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: HST.Stack unit
(requires (fun h ->
let len_tag = serialized_length (serialize_enum_key _ s (sum_enum t)) k in
U32.v pos + len_tag < 4294967296 /\ (
let pos_payload = pos `U32.add` U32.uint_to_t len_tag in
valid (dsnd (pc k)) h input pos_payload /\
writable input.base (U32.v pos) (U32.v pos_payload) h
)))
(ensures (fun h _ h' ->
let len_tag = serialized_length (serialize_enum_key _ s (sum_enum t)) k in
let pos_payload = pos `U32.add` U32.uint_to_t len_tag in
B.modifies (loc_slice_from_to input pos pos_payload) h h' /\
valid_content_pos (parse_sum t p pc) h' input pos (synth_sum_case t k (contents (dsnd (pc k)) h input pos_payload)) (get_valid_pos (dsnd (pc k)) h input pos_payload)
))
= let pos1 = write_enum_key w (sum_enum t) destr k input pos in
let h = HST.get () in
[@inline_let]
let _ = valid_sum_intro h t p pc input pos in
()
inline_for_extraction
let jump_sum_cases_aux
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(vc: ((x: sum_key t) -> Tot (jumper (dsnd (pc x)))))
(k: sum_key t)
: Tot (jumper (parse_sum_cases t pc k))
= [@inline_let]
let _ = synth_sum_case_injective t k in
jump_synth
(jump_weaken
(weaken_parse_cases_kind t pc)
(vc k)
()
)
(synth_sum_case t k)
()
inline_for_extraction
let jump_sum_cases_t
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot Type
= jumper (parse_sum_cases t pc k)
let jump_sum_cases_t_eq
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
(x y : jump_sum_cases_t t pc k)
: GTot Type0
= True
inline_for_extraction
let jump_sum_cases_t_if
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (if_combinator _ (jump_sum_cases_t_eq t pc k))
= fun cond (sv_true: cond_true cond -> Tot (jump_sum_cases_t t pc k)) (sv_false: cond_false cond -> Tot (jump_sum_cases_t t pc k)) #rrel #rel input pos ->
if cond
then sv_true () input pos
else sv_false () input pos
inline_for_extraction
let jump_sum_cases
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(vc: ((x: sum_key t) -> Tot (jumper (dsnd (pc x)))))
(destr: dep_enum_destr (sum_enum t) (jump_sum_cases_t t pc))
(k: sum_key t)
: Tot (jumper (parse_sum_cases t pc k))
= destr
_
(jump_sum_cases_t_if t pc)
(fun _ _ -> ())
(fun _ _ _ _ -> ())
(jump_sum_cases_aux t pc vc)
k
inline_for_extraction
let jump_sum_aux_payload_t
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
: Tot Type
= (#rrel: _) -> (#rel: _) ->
(input: slice rrel rel) ->
(pos: U32.t) ->
HST.Stack U32.t
(requires (fun h -> live_slice h input /\ U32.v pos <= U32.v input.len /\ (
match k with
| Unknown _ -> False
| Known k' -> valid (dsnd (pc k')) h input pos
)))
(ensures (fun h res h' ->
B.modifies B.loc_none h h' /\ (
match k with
| Unknown _ -> False
| Known k' ->
valid_pos (dsnd (pc k')) h input pos res
)))
let jump_sum_aux_payload_eq
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
: Tot (jump_sum_aux_payload_t t pc k -> jump_sum_aux_payload_t t pc k -> GTot Type0)
= fun _ _ -> True
inline_for_extraction
let jump_sum_aux_payload_if'
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
(cond: bool)
(ift: ((cond_true cond) -> Tot (jump_sum_aux_payload_t t pc k)))
(iff: ((cond_false cond) -> Tot (jump_sum_aux_payload_t t pc k)))
: Tot (jump_sum_aux_payload_t t pc k)
= fun #rrel #rel input pos ->
if cond
then begin
(ift () <: jump_sum_aux_payload_t t pc k) input pos
end else
(iff () <: jump_sum_aux_payload_t t pc k) input pos
inline_for_extraction
let jump_sum_aux_payload_if
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
: Tot (if_combinator _ (jump_sum_aux_payload_eq t pc k))
= jump_sum_aux_payload_if' t pc k
let parse_sum_eq3
(#kt: parser_kind)
(t: sum)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(input: bytes)
(k' : sum_repr_type t)
(consumed_k: consumed_length input)
: Lemma
(requires (Some? (parse (parse_sum t p pc) input) /\ parse p input == Some (k', consumed_k)))
(ensures (
let input_k = Seq.slice input consumed_k (Seq.length input) in
let k = maybe_enum_key_of_repr (sum_enum t) k' in
begin match k with
| Known k ->
Some? (parse (dsnd (pc k)) input_k)
| _ -> False
end
))
= parse_sum_eq'' t p pc input
let parse_sum_eq4
(#kt: parser_kind)
(t: sum)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(input: bytes)
(k' : sum_repr_type t)
(consumed_k: consumed_length input)
(consumed_payload: nat)
: Lemma
(requires (Some? (parse (parse_sum t p pc) input) /\ parse p input == Some (k', consumed_k) /\ (
let input_k = Seq.slice input consumed_k (Seq.length input) in
let k = maybe_enum_key_of_repr (sum_enum t) k' in
begin match k with
| Known k ->
Some? (parse (dsnd (pc k)) input_k) /\ (
let Some (_, consumed_payload') = parse (dsnd (pc k)) input_k in
consumed_payload' == consumed_payload
)
| _ -> False
end
)))
(ensures (
let Some (_, consumed) = parse (parse_sum t p pc) input in
consumed == consumed_k + consumed_payload
))
= parse_sum_eq'' t p pc input
#push-options "--z3rlimit 16"
let valid_sum_elim
(h: HS.mem)
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(#rrel: _) (#rel: _)
(input: slice rrel rel)
(pos: U32.t)
: Lemma
(requires (
valid (parse_sum t p pc) h input pos
))
(ensures (
valid p h input pos /\ (
let pos_payload = get_valid_pos p h input pos in
let k' = maybe_enum_key_of_repr (sum_enum t) (contents p h input pos) in
match k' with
| Known k ->
k == sum_tag_of_data t (contents (parse_sum t p pc) h input pos) /\
valid (dsnd (pc k)) h input pos_payload /\
valid_pos
(parse_sum t p pc) h input pos
(get_valid_pos (dsnd (pc k)) h input pos_payload)
| _ -> False
)))
= let sinput = bytes_of_slice_from h input pos in
let _ = parse_sum_eq'' t p pc sinput in
[@inline_let]
let _ = valid_facts (parse_sum t p pc) h input pos in
let Some (k', consumed_k) = parse p sinput in
let pos_after_tag = U32.uint_to_t (U32.v pos + consumed_k) in
[@inline_let]
let _ = valid_facts p h input pos in
assert (valid_content_pos p h input pos k' pos_after_tag);
match maybe_enum_key_of_repr (sum_enum t) k' with
| Known k -> valid_facts (dsnd (pc k)) h input pos_after_tag
| _ -> ()
#pop-options
let valid_sum_elim_tag
(h: HS.mem)
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: Lemma
(requires (
valid (parse_sum t p pc) h input pos
))
(ensures (
valid (parse_enum_key p (sum_enum t)) h input pos /\
contents (parse_enum_key p (sum_enum t)) h input pos == sum_tag_of_data t (contents (parse_sum t p pc) h input pos)
))
= let _ = parse_sum_eq' t p pc (bytes_of_slice_from h input pos) in
let _ = valid_facts (parse_sum t p pc) h input pos in
let _ = valid_facts (parse_enum_key p (sum_enum t)) h input pos in
()
inline_for_extraction
let read_sum_tag
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(p32: leaf_reader p)
(destr: dep_maybe_enum_destr_t (sum_enum t) (read_enum_key_t (sum_enum t)))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: HST.Stack (sum_key t)
(requires (fun h ->
valid (parse_sum t p pc) h input pos
))
(ensures (fun h res h' ->
B.modifies B.loc_none h h' /\
res == sum_tag_of_data t (contents (parse_sum t p pc) h input pos)
))
= let h = HST.get () in
[@inline_let] let _ = valid_sum_elim_tag h t p pc input pos in
read_enum_key p32 (sum_enum t) destr input pos
inline_for_extraction
let jump_sum_aux
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(v: jumper p)
(p32: leaf_reader p)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(v_payload: ((k: sum_repr_type t)) -> Tot (jump_sum_aux_payload_t t pc (maybe_enum_key_of_repr (sum_enum t) k)))
: Tot (jumper (parse_sum t p pc))
= fun #rrel #rel input pos ->
let h = HST.get () in
[@inline_let]
let _ = valid_sum_elim h t p pc input pos in
let pos_after_tag = v input pos in
let k' = p32 input pos in
v_payload k' input pos_after_tag
inline_for_extraction
let jump_sum_aux_payload'
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (jumper (dsnd (pc x)))))
(k: maybe_enum_key (sum_enum t))
: Tot (jump_sum_aux_payload_t t pc k)
= fun #rrel #rel input pos ->
match k with
| Known k ->
[@inline_let]
let _ = synth_sum_case_injective t k in
pc32 k input pos
| _ -> 0ul // dummy, but we MUST NOT remove this branch, otherwise extraction fails
inline_for_extraction
let jump_sum_aux_payload
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (jumper (dsnd (pc x)))))
(destr: dep_maybe_enum_destr_t (sum_enum t) (jump_sum_aux_payload_t t pc))
(k: sum_repr_type t)
: Tot (jump_sum_aux_payload_t t pc (maybe_enum_key_of_repr (sum_enum t) k))
= destr (jump_sum_aux_payload_eq t pc) (jump_sum_aux_payload_if t pc) (fun _ _ -> ()) (fun _ _ _ _ -> ()) (jump_sum_aux_payload' t pc pc32) k
inline_for_extraction
let jump_sum
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(v: jumper p)
(p32: leaf_reader p)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (jumper (dsnd (pc x)))))
(destr: dep_maybe_enum_destr_t (sum_enum t) (jump_sum_aux_payload_t t pc))
: Tot (jumper (parse_sum t p pc))
= jump_sum_aux t v p32 pc (jump_sum_aux_payload t pc pc32 destr)
inline_for_extraction
let read_sum_cases'
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (leaf_reader (dsnd (pc x)))))
(k: sum_key t)
: Tot (leaf_reader (parse_sum_cases' t pc k))
= [@inline_let]
let _ = synth_sum_case_injective t k in
read_synth'
(dsnd (pc k))
(synth_sum_case t k)
(pc32 k)
()
inline_for_extraction
let read_sum_cases_t
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot Type
= leaf_reader (parse_sum_cases' t pc k)
let read_sum_cases_t_eq
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
(x y : read_sum_cases_t t pc k)
: GTot Type0
= True
inline_for_extraction
let read_sum_cases_t_if
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (if_combinator _ (read_sum_cases_t_eq t pc k))
= fun cond (sv_true: cond_true cond -> Tot (read_sum_cases_t t pc k)) (sv_false: cond_false cond -> Tot (read_sum_cases_t t pc k)) #_ #_ input pos ->
if cond
then (sv_true () input pos)
else (sv_false () input pos)
inline_for_extraction
let read_sum_cases
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (leaf_reader (dsnd (pc x)))))
(destr: dep_enum_destr (sum_enum t) (read_sum_cases_t t pc))
(k: sum_key t)
: Tot (leaf_reader (parse_sum_cases' t pc k))
= destr
_
(read_sum_cases_t_if t pc)
(fun _ _ -> ())
(fun _ _ _ _ -> ())
(read_sum_cases' t pc pc32)
k
#push-options "--z3rlimit 32"
inline_for_extraction
let read_sum
(#kt: parser_kind)
(t: sum)
(p: parser kt (sum_repr_type t))
(p32: leaf_reader (parse_enum_key p (sum_enum t)))
(j: jumper p)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (leaf_reader (dsnd (pc x)))))
(destr: dep_enum_destr (sum_enum t) (read_sum_cases_t t pc))
: Tot (leaf_reader (parse_sum t p pc))
=
fun #_ #_ input pos ->
let h = HST.get () in
valid_facts (parse_sum t p pc) h input pos;
parse_sum_eq' t p pc (bytes_of_slice_from h input pos);
valid_facts (parse_enum_key p (sum_enum t)) h input pos;
let k = p32 input pos in
let pos' = jump_enum_key j (sum_enum t) input pos in
valid_facts (parse_sum_cases' t pc k) h input pos' ;
read_sum_cases t pc pc32 destr k input pos'
#pop-options
inline_for_extraction
let serialize32_sum_cases_t
(t: sum)
(#pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(sc: ((x: sum_key t) -> Tot (serializer (dsnd (pc x)))))
(k: sum_key t)
: Tot Type
= serializer32 (serialize_sum_cases t pc sc k)
let serialize32_sum_cases_t_eq
(t: sum)
(#pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(sc: ((x: sum_key t) -> Tot (serializer (dsnd (pc x)))))
(k: sum_key t)
(x y: serialize32_sum_cases_t t sc k)
: GTot Type0
= True
inline_for_extraction
let serialize32_sum_cases_t_if
(t: sum)
(#pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(sc: ((x: sum_key t) -> Tot (serializer (dsnd (pc x)))))
(k: sum_key t)
: Tot (if_combinator _ (serialize32_sum_cases_t_eq t sc k))
= fun cond (sv_true: (cond_true cond -> Tot (serialize32_sum_cases_t t sc k))) (sv_false: (cond_false cond -> Tot (serialize32_sum_cases_t t sc k))) x #rrel #rel b pos ->
if cond
then (sv_true () x b pos)
else (sv_false () x b pos)
inline_for_extraction
let serialize32_sum_cases_aux
(t: sum)
(#pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(sc: ((x: sum_key t) -> Tot (serializer (dsnd (pc x)))))
(sc32: ((x: sum_key t) -> Tot (serializer32 (sc x))))
(k: sum_key t)
: Tot (serializer32 (serialize_sum_cases t pc sc k))
= fun x #rrel #rel b pos ->
[@inline_let] let _ =
Classical.forall_intro (parse_sum_cases_eq' t pc k);
synth_sum_case_injective t k;
synth_sum_case_inverse t k
in
serialize32_synth
(sc32 k)
(synth_sum_case t k)
(synth_sum_case_recip t k)
(fun x -> synth_sum_case_recip t k x)
()
x
b
pos
inline_for_extraction
let serialize32_sum_cases
(t: sum)
(#pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(sc: ((x: sum_key t) -> Tot (serializer (dsnd (pc x)))))
(sc32: ((x: sum_key t) -> Tot (serializer32 (sc x))))
(destr: dep_enum_destr (sum_enum t) (serialize32_sum_cases_t t sc))
(k: sum_key t)
: Tot (serializer32 (serialize_sum_cases t pc sc k))
= destr
_
(serialize32_sum_cases_t_if t sc)
(fun _ _ -> ())
(fun _ _ _ _ -> ())
(serialize32_sum_cases_aux t sc sc32)
k
inline_for_extraction
let serialize32_sum
(#kt: parser_kind)
(t: sum)
(#p: parser kt (sum_repr_type t))
(s: serializer p {kt.parser_kind_subkind == Some ParserStrong})
(s32: serializer32 (serialize_enum_key _ s (sum_enum t)))
(#pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(sc: ((x: sum_key t) -> Tot (serializer (dsnd (pc x)))))
(sc32: ((x: sum_key t) -> Tot (serializer32 (sc x))))
(destr: dep_enum_destr (sum_enum t) (serialize32_sum_cases_t t sc))
: Tot (serializer32 (serialize_sum t s sc))
= fun x #rrel #rel b pos ->
serialize_sum_eq t s sc x;
let tg = sum_tag_of_data t x in
serialize32_nondep_then_aux s32 (serialize32_sum_cases t sc sc32 destr tg) tg x b pos
let clens_sum_tag
(s: sum)
: Tot (clens (sum_type s) (sum_key s))
= {
clens_cond = (fun _ -> True);
clens_get = sum_tag_of_data s;
}
let gaccessor_sum_tag
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
: Tot (gaccessor (parse_sum t p pc) (parse_enum_key p (sum_enum t)) (clens_sum_tag t))
= gaccessor_tagged_union_tag
(parse_enum_key p (sum_enum t))
(sum_tag_of_data t)
(parse_sum_cases t pc)
inline_for_extraction
let accessor_sum_tag
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
: Tot (accessor (gaccessor_sum_tag t p pc))
= accessor_tagged_union_tag
(parse_enum_key p (sum_enum t))
(sum_tag_of_data t)
(parse_sum_cases t pc)
let clens_sum_payload
(s: sum)
(k: sum_key s)
: Tot (clens (sum_type s) (sum_type_of_tag s k))
= {
clens_cond = (fun (x: sum_type s) -> sum_tag_of_data s x == k);
clens_get = (fun (x: sum_type s) -> synth_sum_case_recip s k x <: Ghost (sum_type_of_tag s k) (requires (sum_tag_of_data s x == k)) (ensures (fun _ -> True)));
}
#push-options "--z3rlimit 32"
let gaccessor_clens_sum_payload'
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (gaccessor' (parse_sum t p pc) (dsnd (pc k)) (clens_sum_payload t k))
= fun (input: bytes) ->
parse_sum_eq'' t p pc input;
let res =
match parse p input with
| Some (_, consumed) ->
synth_sum_case_inverse t k;
synth_sum_case_injective t k;
synth_injective_synth_inverse_synth_inverse_recip (synth_sum_case t k) (synth_sum_case_recip t k) ();
(consumed)
| _ -> 0 // dummy
in
(res <: (res: _ { gaccessor_post' (parse_sum t p pc) (dsnd (pc k)) (clens_sum_payload t k) input res } ))
#push-options "--z3rlimit 64"
let gaccessor_clens_sum_payload_injective
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
(sl sl' : bytes)
: Lemma
(requires (
gaccessor_pre (parse_sum t p pc) (dsnd (pc k)) (clens_sum_payload t k) sl /\
gaccessor_pre (parse_sum t p pc) (dsnd (pc k)) (clens_sum_payload t k) sl' /\
injective_precond (parse_sum t p pc) sl sl'
))
(ensures (gaccessor_clens_sum_payload' t p pc k sl == gaccessor_clens_sum_payload' t p pc k sl'))
= parse_sum_eq'' t p pc sl;
parse_sum_eq'' t p pc sl' ;
parse_injective (parse_sum t p pc) sl sl' ;
parse_injective p sl sl'
#pop-options
let gaccessor_clens_sum_payload_no_lookahead
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
(sl sl' : bytes)
: Lemma
(requires (
(parse_sum_kind kt t pc).parser_kind_subkind == Some ParserStrong /\
gaccessor_pre (parse_sum t p pc) (dsnd (pc k)) (clens_sum_payload t k) sl /\
gaccessor_pre (parse_sum t p pc) (dsnd (pc k)) (clens_sum_payload t k) sl' /\
no_lookahead_on_precond (parse_sum t p pc) sl sl'
))
(ensures (gaccessor_clens_sum_payload' t p pc k sl == gaccessor_clens_sum_payload' t p pc k sl'))
= parse_sum_eq'' t p pc sl;
parse_sum_eq'' t p pc sl' ;
parse_strong_prefix (parse_sum t p pc) sl sl' ;
parse_injective p sl sl'
let gaccessor_clens_sum_payload
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (gaccessor (parse_sum t p pc) (dsnd (pc k)) (clens_sum_payload t k))
= Classical.forall_intro_2 (fun x -> Classical.move_requires (gaccessor_clens_sum_payload_injective t p pc k x));
Classical.forall_intro_2 (fun x -> Classical.move_requires (gaccessor_clens_sum_payload_no_lookahead t p pc k x));
gaccessor_prop_equiv (parse_sum t p pc) (dsnd (pc k)) (clens_sum_payload t k) (gaccessor_clens_sum_payload' t p pc k);
gaccessor_clens_sum_payload' t p pc k
inline_for_extraction
let accessor_clens_sum_payload'
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(j: jumper p)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: HST.Stack U32.t
(requires (fun h ->
valid (parse_sum t p pc) h input pos /\
(clens_sum_payload t k).clens_cond (contents (parse_sum t p pc) h input pos)
))
(ensures (fun h pos' h' ->
B.modifies B.loc_none h h' /\
pos' == slice_access h (gaccessor_clens_sum_payload t p pc k) input pos
))
=
let h = HST.get () in
[@inline_let]
let _ =
let pos' = get_valid_pos (parse_sum t p pc) h input pos in
let large = bytes_of_slice_from h input pos in
slice_access_eq h (gaccessor_clens_sum_payload t p pc k) input pos;
valid_facts (parse_sum t p pc) h input pos;
parse_sum_eq'' t p pc large;
valid_facts p h input pos
in
j input pos
#pop-options
inline_for_extraction
let accessor_clens_sum_payload
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(j: jumper p)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (accessor (gaccessor_clens_sum_payload t p pc k))
= fun #rrel #rel -> accessor_clens_sum_payload' t j pc k #rrel #rel
let clens_sum_cases_payload
(s: sum)
(k: sum_key s)
: Tot (clens (sum_cases s k) (sum_type_of_tag s k))
= {
clens_cond = (fun (x: sum_cases s k) -> True);
clens_get = (fun (x: sum_cases s k) -> synth_sum_case_recip s k x <: Ghost (sum_type_of_tag s k) (requires (True)) (ensures (fun _ -> True)));
}
let gaccessor_clens_sum_cases_payload
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (gaccessor (parse_sum_cases' t pc k) (dsnd (pc k)) (clens_sum_cases_payload t k))
= synth_sum_case_injective t k;
synth_sum_case_inverse t k;
synth_injective_synth_inverse_synth_inverse_recip (synth_sum_case t k) (synth_sum_case_recip t k) ();
gaccessor_ext
(gaccessor_synth (dsnd (pc k)) (synth_sum_case t k) (synth_sum_case_recip t k) ())
(clens_sum_cases_payload t k)
()
inline_for_extraction
let accessor_clens_sum_cases_payload
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (accessor (gaccessor_clens_sum_cases_payload t pc k))
= [@inline_let]
let _ =
synth_sum_case_injective t k;
synth_sum_case_inverse t k;
synth_injective_synth_inverse_synth_inverse_recip (synth_sum_case t k) (synth_sum_case_recip t k) ()
in
accessor_ext
(accessor_synth (dsnd (pc k)) (synth_sum_case t k) (synth_sum_case_recip t k) ())
(clens_sum_cases_payload t k)
()
inline_for_extraction
let validate_dsum_cases_t
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(#k: parser_kind)
(g: parser k (dsum_type_of_unknown_tag s))
(x: dsum_key s)
: Tot Type
= validator (parse_dsum_cases' s f g x)
let validate_dsum_cases_eq
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(#k: parser_kind)
(g: parser k (dsum_type_of_unknown_tag s))
(x: dsum_key s)
(v1 v2 : validate_dsum_cases_t s f g x)
: GTot Type0
= True
inline_for_extraction
let validate_dsum_cases_if'
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(#k: parser_kind)
(g: parser k (dsum_type_of_unknown_tag s))
(x: dsum_key s)
(cond: bool)
(ift: (cond_true cond -> Tot (validate_dsum_cases_t s f g x)))
(iff: (cond_false cond -> Tot (validate_dsum_cases_t s f g x)))
: Tot (validate_dsum_cases_t s f g x)
= fun #rrel #rel input len ->
if cond
then (ift () <: validate_dsum_cases_t s f g x) input len
else (iff () <: validate_dsum_cases_t s f g x) input len
inline_for_extraction
let validate_dsum_cases_if
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(#k: parser_kind)
(g: parser k (dsum_type_of_unknown_tag s))
(x: dsum_key s)
: Tot (if_combinator _ (validate_dsum_cases_eq s f g x))
= validate_dsum_cases_if' s f g x
inline_for_extraction
let validate_dsum_cases'
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(f' : (x: dsum_known_key s) -> Tot (validator (dsnd (f x))))
(#k: parser_kind)
(#g: parser k (dsum_type_of_unknown_tag s))
(g' : validator g)
(x: dsum_key s)
: Tot (validate_dsum_cases_t s f g x)
= [@inline_let]
let _ = synth_dsum_case_injective s x in
match x with
| Known x' -> validate_synth (f' x') (synth_dsum_case s (Known x')) () <: validator (parse_dsum_cases' s f g x)
| Unknown x' -> validate_synth g' (synth_dsum_case s (Unknown x')) () <: validator (parse_dsum_cases' s f g x)
inline_for_extraction
let validate_dsum_cases'_destr
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(f' : (x: dsum_known_key s) -> Tot (validator (dsnd (f x))))
(#k: parser_kind)
(#g: parser k (dsum_type_of_unknown_tag s))
(g' : validator g)
(destr: dep_enum_destr _ (fun k -> validate_dsum_cases_t s f g (Known k)))
(x: dsum_key s)
: Tot (validate_dsum_cases_t s f g x)
= fun #rrel #rel input pos ->
match x with
| Known k ->
destr
_
(fun k -> validate_dsum_cases_if s f g (Known k))
(fun _ _ -> ())
(fun _ _ _ _ -> ())
(fun k -> validate_dsum_cases' s f f' g' (Known k))
k
input
pos
| Unknown r -> validate_dsum_cases' s f f' g' (Unknown r) input pos
inline_for_extraction
let validate_dsum_cases
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(f' : (x: dsum_known_key s) -> Tot (validator (dsnd (f x))))
(#k: parser_kind)
(#g: parser k (dsum_type_of_unknown_tag s))
(g' : validator g)
(destr: dep_enum_destr _ (fun k -> validate_dsum_cases_t s f g (Known k)))
(x: dsum_key s)
: Tot (validator (parse_dsum_cases s f g x))
= fun #rrel #rel input pos ->
let h = HST.get () in
[@inline_let]
let _ =
valid_facts (parse_dsum_cases' s f g x) h input (uint64_to_uint32 pos);
valid_facts (parse_dsum_cases s f g x) h input (uint64_to_uint32 pos);
parse_dsum_cases_eq' s f g x (bytes_of_slice_from h input (uint64_to_uint32 pos))
in
validate_dsum_cases'_destr s f f' g' destr x input pos
#push-options "--z3rlimit 40"
inline_for_extraction
let validate_dsum
(#kt: parser_kind)
(t: dsum)
(#p: parser kt (dsum_repr_type t))
(v: validator p)
(p32: leaf_reader p)
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(f32: (x: dsum_known_key t) -> Tot (validator (dsnd (f x))))
(#k': parser_kind)
(#g: parser k' (dsum_type_of_unknown_tag t))
(g32: validator g)
(destr: dep_maybe_enum_destr_t (dsum_enum t) (validate_dsum_cases_t t f g))
: Tot (validator (parse_dsum t p f g))
= fun #rrel #rel input pos ->
let h = HST.get () in
[@inline_let]
let _ = parse_dsum_eq' t p f g (bytes_of_slice_from h input (uint64_to_uint32 pos)) in
[@inline_let]
let _ = valid_facts (parse_dsum t p f g) h input (uint64_to_uint32 pos) in
[@inline_let]
let _ = valid_facts p h input (uint64_to_uint32 pos) in
let pos_after_tag = v input pos in
if is_error pos_after_tag
then pos_after_tag
else
let tg = p32 input (uint64_to_uint32 pos) in
[@inline_let]
let _ = valid_facts (parse_dsum_cases' t f g (maybe_enum_key_of_repr (dsum_enum t) tg)) h input (uint64_to_uint32 pos_after_tag) in
destr (validate_dsum_cases_eq t f g) (validate_dsum_cases_if t f g) (fun _ _ -> ()) (fun _ _ _ _ -> ()) (validate_dsum_cases' t f f32 g32) tg input pos_after_tag
#pop-options
#reset-options "--z3rlimit 64 --z3cliopt smt.arith.nl=false --initial_ifuel 8 --max_ifuel 8 --initial_fuel 2 --max_fuel 2"
let valid_dsum_intro_known
(h: HS.mem)
(t: dsum)
(#kt: parser_kind)
(p: parser kt (dsum_repr_type t))
(f: ((x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x))))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: Lemma
(requires (
valid (parse_maybe_enum_key p (dsum_enum t)) h input pos /\ (
let k' = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
Known? k' /\ (
let Known k = k' in
valid (dsnd (f k)) h input (get_valid_pos (parse_maybe_enum_key p (dsum_enum t)) h input pos)
))))
(ensures (
let Known k = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
let pos_payload = get_valid_pos (parse_maybe_enum_key p (dsum_enum t)) h input pos in
valid_content_pos
(parse_dsum t p f g) h input pos
(synth_dsum_case t (Known k) (contents (dsnd (f k)) h input pos_payload))
(get_valid_pos (dsnd (f k)) h input pos_payload)
))
= valid_facts (parse_maybe_enum_key p (dsum_enum t)) h input pos;
let Known k = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
let pos_payload = get_valid_pos (parse_maybe_enum_key p (dsum_enum t)) h input pos in
valid_facts (dsnd (f k)) h input pos_payload;
valid_facts (parse_dsum t p f g) h input pos;
parse_dsum_eq t p f g (bytes_of_slice_from h input pos)
let valid_dsum_intro_unknown
(h: HS.mem)
(t: dsum)
(#kt: parser_kind)
(p: parser kt (dsum_repr_type t))
(f: ((x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x))))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: Lemma
(requires (
valid (parse_maybe_enum_key p (dsum_enum t)) h input pos /\ (
let k' = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
Unknown? k' /\
valid g h input (get_valid_pos (parse_maybe_enum_key p (dsum_enum t)) h input pos)
)))
(ensures (
let Unknown r = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
let pos_payload = get_valid_pos (parse_maybe_enum_key p (dsum_enum t)) h input pos in
valid_content_pos
(parse_dsum t p f g) h input pos
(synth_dsum_case t (Unknown r) (contents g h input pos_payload))
(get_valid_pos g h input pos_payload)
))
= valid_facts (parse_maybe_enum_key p (dsum_enum t)) h input pos;
let Unknown r = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
let pos_payload = get_valid_pos (parse_maybe_enum_key p (dsum_enum t)) h input pos in
valid_facts g h input pos_payload;
valid_facts (parse_dsum t p f g) h input pos;
parse_dsum_eq t p f g (bytes_of_slice_from h input pos)
#reset-options
inline_for_extraction
let finalize_dsum_case_known
(t: dsum)
(#kt: parser_kind)
(#p: parser kt (dsum_repr_type t))
(s: serializer p)
(w: leaf_writer_strong s)
(f: ((x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x))))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
(destr: enum_repr_of_key'_t (dsum_enum t))
(k: dsum_known_key t)
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: HST.Stack unit
(requires (fun h ->
let len_tag = serialized_length (serialize_enum_key _ s (dsum_enum t)) k in
U32.v pos + len_tag < 4294967296 /\ (
let pos_payload = pos `U32.add` U32.uint_to_t len_tag in
valid (dsnd (f k)) h input pos_payload /\
writable input.base (U32.v pos) (U32.v pos_payload) h
)))
(ensures (fun h _ h' ->
let len_tag = serialized_length (serialize_enum_key _ s (dsum_enum t)) k in
let pos_payload = pos `U32.add` U32.uint_to_t len_tag in
B.modifies (loc_slice_from_to input pos pos_payload) h h' /\
valid_content_pos (parse_dsum t p f g) h' input pos (synth_dsum_case t (Known k) (contents (dsnd (f k)) h input pos_payload)) (get_valid_pos (dsnd (f k)) h input pos_payload)
))
= let pos1 = write_enum_key w (dsum_enum t) destr k input pos in
let h = HST.get () in
[@inline_let]
let _ =
valid_facts (parse_enum_key p (dsum_enum t)) h input pos;
valid_facts (parse_maybe_enum_key p (dsum_enum t)) h input pos;
let sq = bytes_of_slice_from h input pos in
parse_enum_key_eq p (dsum_enum t) sq;
parse_maybe_enum_key_eq p (dsum_enum t) sq;
valid_dsum_intro_known h t p f g input pos
in
()
inline_for_extraction
let finalize_dsum_case_unknown
(t: dsum)
(#kt: parser_kind)
(#p: parser kt (dsum_repr_type t))
(s: serializer p)
(w: leaf_writer_strong s)
(f: ((x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x))))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
(r: unknown_enum_repr (dsum_enum t))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: HST.Stack unit
(requires (fun h ->
let len_tag = serialized_length s r in
U32.v pos + len_tag < 4294967296 /\ (
let pos_payload = pos `U32.add` U32.uint_to_t len_tag in
valid g h input pos_payload /\
writable input.base (U32.v pos) (U32.v pos_payload) h
)))
(ensures (fun h _ h' ->
let len_tag = serialized_length s r in
let pos_payload = pos `U32.add` U32.uint_to_t len_tag in
B.modifies (loc_slice_from_to input pos pos_payload) h h' /\
valid_content_pos (parse_dsum t p f g) h' input pos (synth_dsum_case t (Unknown r) (contents g h input pos_payload)) (get_valid_pos g h input pos_payload)
))
= let pos1 = w r input pos in
let h = HST.get () in
[@inline_let]
let _ =
valid_facts (parse_maybe_enum_key p (dsum_enum t)) h input pos;
valid_facts p h input pos;
let sq = bytes_of_slice_from h input pos in
parse_maybe_enum_key_eq p (dsum_enum t) sq;
valid_dsum_intro_unknown h t p f g input pos
in
()
let valid_dsum_elim_tag
(h: HS.mem)
(t: dsum)
(#kt: parser_kind)
(p: parser kt (dsum_repr_type t))
(f: ((x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x))))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: Lemma
(requires (
valid (parse_dsum t p f g) h input pos
))
(ensures (
valid (parse_maybe_enum_key p (dsum_enum t)) h input pos /\
contents (parse_maybe_enum_key p (dsum_enum t)) h input pos == dsum_tag_of_data t (contents (parse_dsum t p f g) h input pos)
))
= let _ = parse_dsum_eq_ t p f g (bytes_of_slice_from h input pos) in
let _ = valid_facts (parse_dsum t p f g) h input pos in
let _ = valid_facts (parse_maybe_enum_key p (dsum_enum t)) h input pos in
()
inline_for_extraction
let read_dsum_tag
(t: dsum)
(#kt: parser_kind)
(#p: parser kt (dsum_repr_type t))
(p32: leaf_reader p)
(destr: maybe_enum_destr_t (maybe_enum_key (dsum_enum t)) (dsum_enum t))
(f: ((x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x))))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: HST.Stack (dsum_key t)
(requires (fun h ->
valid (parse_dsum t p f g) h input pos
))
(ensures (fun h res h' ->
B.modifies B.loc_none h h' /\
res == dsum_tag_of_data t (contents (parse_dsum t p f g) h input pos)
))
= let h = HST.get () in
[@inline_let] let _ = valid_dsum_elim_tag h t p f g input pos in
read_maybe_enum_key p32 (dsum_enum t) destr input pos
#push-options "--z3rlimit 32"
let valid_dsum_elim_known
(h: HS.mem)
(t: dsum)
(#kt: parser_kind)
(p: parser kt (dsum_repr_type t))
(f: ((x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x))))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: Lemma
(requires (
valid (parse_dsum t p f g) h input pos /\
Known? (dsum_tag_of_data t (contents (parse_dsum t p f g) h input pos))
))
(ensures (
valid (parse_maybe_enum_key p (dsum_enum t)) h input pos /\ (
let k' = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
let pos_payload = get_valid_pos (parse_maybe_enum_key p (dsum_enum t)) h input pos in
Known? k' /\ (
let Known k = k' in
valid (dsnd (f k)) h input pos_payload /\
valid_content_pos
(parse_dsum t p f g) h input pos
(synth_dsum_case t (Known k) (contents (dsnd (f k)) h input pos_payload))
(get_valid_pos (dsnd (f k)) h input pos_payload)
))))
=
valid_facts (parse_dsum t p f g) h input pos;
parse_dsum_eq t p f g (bytes_of_slice_from h input pos);
valid_facts (parse_maybe_enum_key p (dsum_enum t)) h input pos;
let Known k = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
let pos_payload = get_valid_pos (parse_maybe_enum_key p (dsum_enum t)) h input pos in
valid_facts (dsnd (f k)) h input pos_payload
#pop-options
let valid_dsum_elim_unknown
(h: HS.mem)
(t: dsum)
(#kt: parser_kind)
(p: parser kt (dsum_repr_type t))
(f: ((x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x))))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: Lemma
(requires (
valid (parse_dsum t p f g) h input pos /\
Unknown? (dsum_tag_of_data t (contents (parse_dsum t p f g) h input pos))
))
(ensures (
valid (parse_maybe_enum_key p (dsum_enum t)) h input pos /\ (
let k' = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
let pos_payload = get_valid_pos (parse_maybe_enum_key p (dsum_enum t)) h input pos in
Unknown? k' /\ (
let Unknown r = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
valid g h input pos_payload /\
valid_content_pos
(parse_dsum t p f g) h input pos
(synth_dsum_case t (Unknown r) (contents g h input pos_payload))
(get_valid_pos g h input pos_payload)
))))
=
valid_facts (parse_dsum t p f g) h input pos;
parse_dsum_eq t p f g (bytes_of_slice_from h input pos);
valid_facts (parse_maybe_enum_key p (dsum_enum t)) h input pos;
let Unknown r = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
let pos_payload = get_valid_pos (parse_maybe_enum_key p (dsum_enum t)) h input pos in
valid_facts g h input pos_payload
inline_for_extraction
let jump_dsum_cases_t
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(#k: parser_kind)
(g: parser k (dsum_type_of_unknown_tag s))
(x: dsum_key s)
: Tot Type
= jumper (parse_dsum_cases' s f g x)
let jump_dsum_cases_eq
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(#k: parser_kind)
(g: parser k (dsum_type_of_unknown_tag s))
(x: dsum_key s)
(v1 v2 : jump_dsum_cases_t s f g x)
: GTot Type0
= True
inline_for_extraction
let jump_dsum_cases_if'
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(#k: parser_kind)
(g: parser k (dsum_type_of_unknown_tag s))
(x: dsum_key s)
(cond: bool)
(ift: (cond_true cond -> Tot (jump_dsum_cases_t s f g x)))
(iff: (cond_false cond -> Tot (jump_dsum_cases_t s f g x)))
: Tot (jump_dsum_cases_t s f g x)
= fun #rrel #rel input len ->
if cond
then (ift () <: jump_dsum_cases_t s f g x) input len
else (iff () <: jump_dsum_cases_t s f g x) input len
inline_for_extraction
let jump_dsum_cases_if
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(#k: parser_kind)
(g: parser k (dsum_type_of_unknown_tag s))
(x: dsum_key s)
: Tot (if_combinator _ (jump_dsum_cases_eq s f g x))
= jump_dsum_cases_if' s f g x
inline_for_extraction
let jump_dsum_cases'
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(f' : (x: dsum_known_key s) -> Tot (jumper (dsnd (f x))))
(#k: parser_kind)
(#g: parser k (dsum_type_of_unknown_tag s))
(g' : jumper g)
(x: dsum_key s)
: Tot (jump_dsum_cases_t s f g x)
= synth_dsum_case_injective s x;
match x with
| Known x' -> jump_synth (f' x') (synth_dsum_case s (Known x')) () <: jumper (parse_dsum_cases' s f g x)
| Unknown x' -> jump_synth g' (synth_dsum_case s (Unknown x')) () <: jumper (parse_dsum_cases' s f g x)
inline_for_extraction
let jump_dsum_cases'_destr
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(f' : (x: dsum_known_key s) -> Tot (jumper (dsnd (f x))))
(#k: parser_kind)
(#g: parser k (dsum_type_of_unknown_tag s))
(g' : jumper g)
(destr: dep_enum_destr _ (fun k -> jump_dsum_cases_t s f g (Known k)))
(x: dsum_key s)
: Tot (jump_dsum_cases_t s f g x)
= fun #rrel #rel input pos ->
match x with
| Known k ->
destr
_
(fun k -> jump_dsum_cases_if s f g (Known k))
(fun _ _ -> ())
(fun _ _ _ _ -> ())
(fun k -> jump_dsum_cases' s f f' g' (Known k))
k
input
pos
| Unknown r -> jump_dsum_cases' s f f' g' (Unknown r) input pos
inline_for_extraction
let jump_dsum_cases
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(f' : (x: dsum_known_key s) -> Tot (jumper (dsnd (f x))))
(#k: parser_kind)
(#g: parser k (dsum_type_of_unknown_tag s))
(g' : jumper g)
(destr: dep_enum_destr _ (fun k -> jump_dsum_cases_t s f g (Known k)))
(x: dsum_key s)
: Tot (jumper (parse_dsum_cases s f g x))
= fun #rrel #rel input pos ->
let h = HST.get () in
[@inline_let]
let _ =
valid_facts (parse_dsum_cases' s f g x) h input pos;
valid_facts (parse_dsum_cases s f g x) h input pos;
parse_dsum_cases_eq' s f g x (bytes_of_slice_from h input pos)
in
jump_dsum_cases'_destr s f f' g' destr x input pos
#push-options "--z3rlimit 16"
inline_for_extraction
let jump_dsum
(#kt: parser_kind)
(t: dsum)
(#p: parser kt (dsum_repr_type t))
(v: jumper p)
(p32: leaf_reader p)
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(f32: (x: dsum_known_key t) -> Tot (jumper (dsnd (f x))))
(#k': parser_kind)
(#g: parser k' (dsum_type_of_unknown_tag t))
(g32: jumper g)
(destr: dep_maybe_enum_destr_t (dsum_enum t) (jump_dsum_cases_t t f g))
: Tot (jumper (parse_dsum t p f g))
= fun #rrel #rel input pos ->
let h = HST.get () in
[@inline_let]
let _ = parse_dsum_eq' t p f g (bytes_of_slice_from h input pos) in
[@inline_let]
let _ = valid_facts (parse_dsum t p f g) h input pos in
[@inline_let]
let _ = valid_facts p h input pos in
let pos_after_tag = v input pos in
let tg = p32 input pos in
[@inline_let]
let _ = valid_facts (parse_dsum_cases' t f g (maybe_enum_key_of_repr (dsum_enum t) tg)) h input pos_after_tag in
destr (jump_dsum_cases_eq t f g) (jump_dsum_cases_if t f g) (fun _ _ -> ()) (fun _ _ _ _ -> ()) (jump_dsum_cases' t f f32 g32) tg input pos_after_tag
#pop-options
inline_for_extraction
let read_dsum_cases'
(t: dsum)
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(f32: (x: dsum_known_key t) -> Tot (leaf_reader (dsnd (f x))))
(#k': parser_kind)
(g: parser k' (dsum_type_of_unknown_tag t))
(g32: leaf_reader g)
(x: dsum_key t)
: Tot (leaf_reader (parse_dsum_cases' t f g x))
= fun #rrel #rel input pos ->
[@inline_let]
let _ = synth_dsum_case_injective t x in
match x with
| Known x' ->
read_synth'
(dsnd (f x'))
(synth_dsum_case t (Known x'))
(f32 x')
()
input
pos
| Unknown x' ->
read_synth'
g
(synth_dsum_case t (Unknown x'))
g32
()
input
pos
inline_for_extraction
let read_dsum_cases_t
(t: dsum)
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(#k': parser_kind)
(g: parser k' (dsum_type_of_unknown_tag t))
(k: dsum_known_key t)
: Tot Type
= leaf_reader (parse_dsum_cases' t f g (Known k))
let read_dsum_cases_t_eq
(t: dsum)
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(#k': parser_kind)
(g: parser k' (dsum_type_of_unknown_tag t))
(k: dsum_known_key t)
(x y : read_dsum_cases_t t f g k)
: GTot Type0
= True
inline_for_extraction
let read_dsum_cases_t_if
(t: dsum)
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(#k': parser_kind)
(g: parser k' (dsum_type_of_unknown_tag t))
(k: dsum_known_key t)
: Tot (if_combinator _ (read_dsum_cases_t_eq t f g k))
= fun cond (sv_true: cond_true cond -> Tot (read_dsum_cases_t t f g k)) (sv_false: cond_false cond -> Tot (read_dsum_cases_t t f g k)) #_ #_ input pos ->
if cond
then sv_true () input pos
else sv_false () input pos
inline_for_extraction
let read_dsum_cases
(t: dsum)
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(f32: (x: dsum_known_key t) -> Tot (leaf_reader (dsnd (f x))))
(#k': parser_kind)
(g: parser k' (dsum_type_of_unknown_tag t))
(g32: leaf_reader g)
(destr: dep_enum_destr _ (read_dsum_cases_t t f g))
(x: dsum_key t)
: Tot (leaf_reader (parse_dsum_cases' t f g x))
= fun #_ #_ input pos ->
match x with
| Known k ->
destr
_
(read_dsum_cases_t_if t f g)
(fun _ _ -> ())
(fun _ _ _ _ -> ())
(fun k -> read_dsum_cases' t f f32 g g32 (Known k))
k
input
pos
| Unknown r ->
read_dsum_cases' t f f32 g g32 (Unknown r) input pos
#push-options "--z3rlimit 16"
inline_for_extraction
let read_dsum
(#kt: parser_kind)
(t: dsum)
(#p: parser kt (dsum_repr_type t))
(p32: leaf_reader (parse_maybe_enum_key p (dsum_enum t)))
(j: jumper p)
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(f32: (x: dsum_known_key t) -> Tot (leaf_reader (dsnd (f x))))
(#k': parser_kind)
(#g: parser k' (dsum_type_of_unknown_tag t))
(g32: leaf_reader g)
(destr: dep_enum_destr _ (read_dsum_cases_t t f g))
: Tot (leaf_reader (parse_dsum t p f g))
= fun #_ #_ input pos ->
let h = HST.get () in
valid_facts (parse_dsum t p f g) h input pos;
parse_dsum_eq_ t p f g (bytes_of_slice_from h input pos);
valid_facts (parse_maybe_enum_key p (dsum_enum t)) h input pos;
let k = p32 input pos in
let pos' = jump_maybe_enum_key j (dsum_enum t) input pos in
valid_facts (parse_dsum_cases' t f g k) h input pos' ;
read_dsum_cases t f f32 g g32 destr k input pos'
#pop-options
inline_for_extraction
let serialize32_dsum_type_of_tag
(t: dsum)
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(sf: (x: dsum_known_key t) -> Tot (serializer (dsnd (f x))))
(sf32: (x: dsum_known_key t) -> Tot (serializer32 (sf x)))
(#k': parser_kind)
(#g: parser k' (dsum_type_of_unknown_tag t))
(#sg: serializer g)
(sg32: serializer32 sg)
(tg: dsum_key t)
: Tot (serializer32 (serialize_dsum_type_of_tag t f sf g sg tg))
= match tg with
| Known x' -> serialize32_ext (dsnd (f x')) (sf x') (sf32 x') (parse_dsum_type_of_tag t f g tg) ()
| Unknown x' -> serialize32_ext g sg sg32 (parse_dsum_type_of_tag t f g tg) ()
inline_for_extraction
let serialize32_dsum_cases_aux
(t: dsum)
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(sf: (x: dsum_known_key t) -> Tot (serializer (dsnd (f x))))
(sf32: (x: dsum_known_key t) -> Tot (serializer32 (sf x)))
(#k': parser_kind)
(#g: parser k' (dsum_type_of_unknown_tag t))
(#sg: serializer g)
(sg32: serializer32 sg)
(tg: dsum_key t)
: Tot (serializer32 (serialize_dsum_cases t f sf g sg tg))
= [@inline_let]
let _ = synth_dsum_case_injective t tg in
[@inline_let]
let _ = synth_dsum_case_inverse t tg in
serialize32_synth
(serialize32_dsum_type_of_tag t f sf sf32 sg32 tg)
(synth_dsum_case t tg)
(synth_dsum_case_recip t tg)
(fun x -> synth_dsum_case_recip t tg x)
()
inline_for_extraction
let serialize32_dsum_cases_t
(t: dsum)
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(sf: (x: dsum_known_key t) -> Tot (serializer (dsnd (f x))))
(#k': parser_kind)
(g: parser k' (dsum_type_of_unknown_tag t))
(sg: serializer g)
(k: dsum_known_key t)
: Tot Type
= serializer32 (serialize_dsum_cases t f sf g sg (Known k))
let serialize32_dsum_cases_t_eq
(t: dsum)
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(sf: (x: dsum_known_key t) -> Tot (serializer (dsnd (f x))))
(#k': parser_kind)
(g: parser k' (dsum_type_of_unknown_tag t))
(sg: serializer g)
(k: dsum_known_key t)
(x y: serialize32_dsum_cases_t t f sf g sg k)
: GTot Type0
= True
inline_for_extraction
let serialize32_dsum_cases_t_if
(t: dsum)
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(sf: (x: dsum_known_key t) -> Tot (serializer (dsnd (f x))))
(#k': parser_kind)
(g: parser k' (dsum_type_of_unknown_tag t))
(sg: serializer g)
(k: dsum_known_key t)
: Tot (if_combinator _ (serialize32_dsum_cases_t_eq t f sf g sg k))
= fun cond (sv_true: (cond_true cond -> Tot (serialize32_dsum_cases_t t f sf g sg k))) (sv_false: (cond_false cond -> Tot (serialize32_dsum_cases_t t f sf g sg k))) x #rrel #rel output pos ->
if cond
then (sv_true () x output pos)
else (sv_false () x output pos)
inline_for_extraction
let serialize32_dsum_cases
(t: dsum)
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(sf: (x: dsum_known_key t) -> Tot (serializer (dsnd (f x))))
(sf32: (x: dsum_known_key t) -> Tot (serializer32 (sf x)))
(#k': parser_kind)
(#g: parser k' (dsum_type_of_unknown_tag t))
(#sg: serializer g)
(sg32: serializer32 sg)
(destr: dep_enum_destr _ (serialize32_dsum_cases_t t f sf g sg))
(tg: dsum_key t)
: Tot (serializer32 (serialize_dsum_cases t f sf g sg tg))
= fun x #rrel #rel output pos ->
match tg with
| Known k ->
destr
_
(serialize32_dsum_cases_t_if t f sf g sg)
(fun _ _ -> ())
(fun _ _ _ _ -> ())
(fun k -> serialize32_dsum_cases_aux t f sf sf32 sg32 (Known k))
k
x
output
pos
| Unknown r ->
serialize32_dsum_cases_aux t f sf sf32 sg32 (Unknown r) x output pos
inline_for_extraction
let serialize32_dsum
(#kt: parser_kind)
(t: dsum)
(#p: parser kt (dsum_repr_type t))
(s: serializer p {kt.parser_kind_subkind == Some ParserStrong})
(s32: serializer32 (serialize_maybe_enum_key _ s (dsum_enum t)))
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(sf: (x: dsum_known_key t) -> Tot (serializer (dsnd (f x))))
(sf32: (x: dsum_known_key t) -> Tot (serializer32 (sf x)))
(#k': parser_kind)
(#g: parser k' (dsum_type_of_unknown_tag t))
(#sg: serializer g)
(sg32: serializer32 sg)
(destr: dep_enum_destr _ (serialize32_dsum_cases_t t f sf g sg))
: Tot (serializer32 (serialize_dsum t s f sf g sg))
= fun x #_ #_ output pos ->
[@inline_let]
let _ = serialize_dsum_eq' t s f sf g sg x in
let tg = dsum_tag_of_data t x in
serialize32_nondep_then_aux
s32
(serialize32_dsum_cases t f sf sf32 sg32 destr tg)
tg
x
output
pos | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"LowStar.Buffer.fst.checked",
"LowParse.Spec.Sum.fst.checked",
"LowParse.Low.Enum.fst.checked",
"FStar.UInt64.fsti.checked",
"FStar.UInt32.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Int.Cast.fst.checked",
"FStar.HyperStack.ST.fsti.checked",
"FStar.HyperStack.fst.checked",
"FStar.Classical.fsti.checked"
],
"interface_file": false,
"source_file": "LowParse.Low.Sum.fst"
} | [
{
"abbrev": true,
"full_module": "FStar.HyperStack",
"short_module": "HS"
},
{
"abbrev": true,
"full_module": "FStar.UInt64",
"short_module": "U64"
},
{
"abbrev": true,
"full_module": "FStar.Int.Cast",
"short_module": "Cast"
},
{
"abbrev": true,
"full_module": "LowStar.Buffer",
"short_module": "B"
},
{
"abbrev": true,
"full_module": "FStar.HyperStack.ST",
"short_module": "HST"
},
{
"abbrev": true,
"full_module": "FStar.UInt32",
"short_module": "U32"
},
{
"abbrev": false,
"full_module": "LowParse.Spec.Sum",
"short_module": null
},
{
"abbrev": false,
"full_module": "LowParse.Low.Enum",
"short_module": null
},
{
"abbrev": false,
"full_module": "LowParse.Low",
"short_module": null
},
{
"abbrev": false,
"full_module": "LowParse.Low",
"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",
"short_module": null
}
] | {
"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_elim_box": false,
"smtencoding_l_arith_repr": "boxwrap",
"smtencoding_nl_arith_repr": "boxwrap",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": true,
"z3cliopt": [],
"z3refresh": false,
"z3rlimit": 5,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | false | s: LowParse.Spec.Sum.dsum
-> LowParse.Low.Base.Spec.clens (LowParse.Spec.Sum.dsum_type s) (LowParse.Spec.Sum.dsum_key s) | Prims.Tot | [
"total"
] | [] | [
"LowParse.Spec.Sum.dsum",
"LowParse.Low.Base.Spec.Mkclens",
"LowParse.Spec.Sum.dsum_type",
"LowParse.Spec.Sum.dsum_key",
"Prims.l_True",
"LowParse.Spec.Sum.dsum_tag_of_data",
"LowParse.Low.Base.Spec.clens"
] | [] | false | false | false | false | false | let clens_dsum_tag (s: dsum) : Tot (clens (dsum_type s) (dsum_key s)) =
| { clens_cond = (fun _ -> True); clens_get = dsum_tag_of_data s } | false |
LowParse.Low.Sum.fst | LowParse.Low.Sum.jump_dsum_cases_if' | val jump_dsum_cases_if'
(s: dsum)
(f: (x: dsum_known_key s -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x))))
(#k: parser_kind)
(g: parser k (dsum_type_of_unknown_tag s))
(x: dsum_key s)
(cond: bool)
(ift: (cond_true cond -> Tot (jump_dsum_cases_t s f g x)))
(iff: (cond_false cond -> Tot (jump_dsum_cases_t s f g x)))
: Tot (jump_dsum_cases_t s f g x) | val jump_dsum_cases_if'
(s: dsum)
(f: (x: dsum_known_key s -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x))))
(#k: parser_kind)
(g: parser k (dsum_type_of_unknown_tag s))
(x: dsum_key s)
(cond: bool)
(ift: (cond_true cond -> Tot (jump_dsum_cases_t s f g x)))
(iff: (cond_false cond -> Tot (jump_dsum_cases_t s f g x)))
: Tot (jump_dsum_cases_t s f g x) | let jump_dsum_cases_if'
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(#k: parser_kind)
(g: parser k (dsum_type_of_unknown_tag s))
(x: dsum_key s)
(cond: bool)
(ift: (cond_true cond -> Tot (jump_dsum_cases_t s f g x)))
(iff: (cond_false cond -> Tot (jump_dsum_cases_t s f g x)))
: Tot (jump_dsum_cases_t s f g x)
= fun #rrel #rel input len ->
if cond
then (ift () <: jump_dsum_cases_t s f g x) input len
else (iff () <: jump_dsum_cases_t s f g x) input len | {
"file_name": "src/lowparse/LowParse.Low.Sum.fst",
"git_rev": "00217c4a89f5ba56002ba9aa5b4a9d5903bfe9fa",
"git_url": "https://github.com/project-everest/everparse.git",
"project_name": "everparse"
} | {
"end_col": 54,
"end_line": 1407,
"start_col": 0,
"start_line": 1394
} | module LowParse.Low.Sum
include LowParse.Low.Enum
include LowParse.Spec.Sum
module U32 = FStar.UInt32
module HST = FStar.HyperStack.ST
module B = LowStar.Buffer
module Cast = FStar.Int.Cast
module U64 = FStar.UInt64
inline_for_extraction
let validate_sum_cases_aux
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(vc: ((x: sum_key t) -> Tot (validator (dsnd (pc x)))))
(k: sum_key t)
: Tot (validator (parse_sum_cases t pc k))
= [@inline_let]
let _ = synth_sum_case_injective t k in
validate_synth
(validate_weaken
(weaken_parse_cases_kind t pc)
(vc k)
()
)
(synth_sum_case t k)
()
inline_for_extraction
let validate_sum_cases_t
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot Type
= validator (parse_sum_cases t pc k)
let validate_sum_cases_t_eq
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
(x y : validate_sum_cases_t t pc k)
: GTot Type0
= True
inline_for_extraction
let validate_sum_cases_t_if
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (if_combinator _ (validate_sum_cases_t_eq t pc k))
= fun cond (sv_true: cond_true cond -> Tot (validate_sum_cases_t t pc k)) (sv_false: cond_false cond -> Tot (validate_sum_cases_t t pc k)) #rrel #rel input pos ->
if cond
then sv_true () input pos
else sv_false () input pos
inline_for_extraction
let validate_sum_cases
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(vc: ((x: sum_key t) -> Tot (validator (dsnd (pc x)))))
(destr: dep_enum_destr (sum_enum t) (validate_sum_cases_t t pc))
(k: sum_key t)
: Tot (validator (parse_sum_cases t pc k))
= destr
_
(validate_sum_cases_t_if t pc)
(fun _ _ -> ())
(fun _ _ _ _ -> ())
(validate_sum_cases_aux t pc vc)
k
inline_for_extraction
let validate_sum_aux_payload_t
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
: Tot Type
= (#rrel: _) -> (#rel: _) ->
(input: slice rrel rel) ->
(pos: U64.t) ->
HST.Stack U64.t
(requires (fun h -> live_slice h input /\ U64.v pos <= U32.v input.len))
(ensures (fun h res h' ->
B.modifies B.loc_none h h' /\ (
match k with
| Unknown _ -> is_error res
| Known k' ->
if is_success res
then
valid_pos (dsnd (pc k')) h input (uint64_to_uint32 pos) (uint64_to_uint32 res)
else
(~ (valid (dsnd (pc k')) h input (uint64_to_uint32 pos)))
)))
let validate_sum_aux_payload_eq
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
: Tot (validate_sum_aux_payload_t t pc k -> validate_sum_aux_payload_t t pc k -> GTot Type0)
= fun _ _ -> True
inline_for_extraction
let validate_sum_aux_payload_if'
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
(cond: bool)
(ift: ((cond_true cond) -> Tot (validate_sum_aux_payload_t t pc k)))
(iff: ((cond_false cond) -> Tot (validate_sum_aux_payload_t t pc k)))
: Tot (validate_sum_aux_payload_t t pc k)
= fun #rrel #rel input pos ->
if cond
then begin
(ift () <: validate_sum_aux_payload_t t pc k) input pos
end else
(iff () <: validate_sum_aux_payload_t t pc k) input pos
inline_for_extraction
let validate_sum_aux_payload_if
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
: Tot (if_combinator _ (validate_sum_aux_payload_eq t pc k))
= validate_sum_aux_payload_if' t pc k
#push-options "--z3rlimit 64 --z3cliopt smt.arith.nl=false --using_facts_from '* -FStar.Int.Cast -LowParse.BitFields'"
// --query_stats --smtencoding.elim_box true --smtencoding.l_arith_repr native --z3refresh"
inline_for_extraction
let validate_sum_aux
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(v: validator p)
(p32: leaf_reader p)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(v_payload: ((k: sum_repr_type t)) -> Tot (validate_sum_aux_payload_t t pc (maybe_enum_key_of_repr (sum_enum t) k)))
: Tot (validator (parse_sum t p pc))
= fun #rrel #rel input pos ->
let h = HST.get () in
[@inline_let]
let _ = parse_sum_eq'' t p pc (bytes_of_slice_from h input (uint64_to_uint32 pos)) in
[@inline_let]
let _ = valid_facts (parse_sum t p pc) h input (uint64_to_uint32 pos) in
[@inline_let]
let _ = valid_facts p h input (uint64_to_uint32 pos) in
let len_after_tag = v input pos in
if is_error len_after_tag
then len_after_tag
else begin
let h1 = HST.get () in
let k' = p32 input (uint64_to_uint32 pos) in
[@inline_let]
let _ =
match maybe_enum_key_of_repr (sum_enum t) k' with
| Known k -> valid_facts (dsnd (pc k)) h input (uint64_to_uint32 len_after_tag)
| _ -> ()
in
v_payload k' input len_after_tag
end
#pop-options
inline_for_extraction
let validate_sum_aux_payload'
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (validator (dsnd (pc x)))))
(k: maybe_enum_key (sum_enum t))
: Tot (validate_sum_aux_payload_t t pc k)
= fun #rrel #rel input pos ->
match k with
| Known k ->
[@inline_let]
let _ = synth_sum_case_injective t k in
pc32 k input pos
// validate_synth (pc32 k) (synth_sum_case t k) () input pos
| _ -> validator_error_generic
inline_for_extraction
let validate_sum_aux_payload
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (validator (dsnd (pc x)))))
(destr: dep_maybe_enum_destr_t (sum_enum t) (validate_sum_aux_payload_t t pc))
(k: sum_repr_type t)
: Tot (validate_sum_aux_payload_t t pc (maybe_enum_key_of_repr (sum_enum t) k))
= destr (validate_sum_aux_payload_eq t pc) (validate_sum_aux_payload_if t pc) (fun _ _ -> ()) (fun _ _ _ _ -> ()) (validate_sum_aux_payload' t pc pc32) k
inline_for_extraction
let validate_sum
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(v: validator p)
(p32: leaf_reader p)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (validator (dsnd (pc x)))))
(destr: dep_maybe_enum_destr_t (sum_enum t) (validate_sum_aux_payload_t t pc))
: Tot (validator (parse_sum t p pc))
= validate_sum_aux t v p32 pc (validate_sum_aux_payload t pc pc32 destr)
module HS = FStar.HyperStack
#push-options "--z3rlimit 256 --z3cliopt smt.arith.nl=false --initial_ifuel 8 --max_ifuel 8 --initial_fuel 2 --max_fuel 2"
#restart-solver
let valid_sum_intro
(h: HS.mem)
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: Lemma
(requires (
valid (parse_enum_key p (sum_enum t)) h input pos /\ (
let k = contents (parse_enum_key p (sum_enum t)) h input pos in
valid (dsnd (pc k)) h input (get_valid_pos (parse_enum_key p (sum_enum t)) h input pos)
)))
(ensures (
let k = contents (parse_enum_key p (sum_enum t)) h input pos in
let pos_payload = get_valid_pos (parse_enum_key p (sum_enum t)) h input pos in
valid_content_pos
(parse_sum t p pc) h input pos
(synth_sum_case t k (contents (dsnd (pc k)) h input pos_payload))
(get_valid_pos (dsnd (pc k)) h input pos_payload)
))
= valid_facts (parse_enum_key p (sum_enum t)) h input pos;
let k = contents (parse_enum_key p (sum_enum t)) h input pos in
let pos_payload = get_valid_pos (parse_enum_key p (sum_enum t)) h input pos in
valid_facts (dsnd (pc k)) h input pos_payload;
valid_facts (parse_sum t p pc) h input pos;
parse_sum_eq t p pc (bytes_of_slice_from h input pos)
#pop-options
inline_for_extraction
let finalize_sum_case
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(s: serializer p)
(w: leaf_writer_strong s)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(destr: enum_repr_of_key'_t (sum_enum t))
(k: sum_key t)
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: HST.Stack unit
(requires (fun h ->
let len_tag = serialized_length (serialize_enum_key _ s (sum_enum t)) k in
U32.v pos + len_tag < 4294967296 /\ (
let pos_payload = pos `U32.add` U32.uint_to_t len_tag in
valid (dsnd (pc k)) h input pos_payload /\
writable input.base (U32.v pos) (U32.v pos_payload) h
)))
(ensures (fun h _ h' ->
let len_tag = serialized_length (serialize_enum_key _ s (sum_enum t)) k in
let pos_payload = pos `U32.add` U32.uint_to_t len_tag in
B.modifies (loc_slice_from_to input pos pos_payload) h h' /\
valid_content_pos (parse_sum t p pc) h' input pos (synth_sum_case t k (contents (dsnd (pc k)) h input pos_payload)) (get_valid_pos (dsnd (pc k)) h input pos_payload)
))
= let pos1 = write_enum_key w (sum_enum t) destr k input pos in
let h = HST.get () in
[@inline_let]
let _ = valid_sum_intro h t p pc input pos in
()
inline_for_extraction
let jump_sum_cases_aux
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(vc: ((x: sum_key t) -> Tot (jumper (dsnd (pc x)))))
(k: sum_key t)
: Tot (jumper (parse_sum_cases t pc k))
= [@inline_let]
let _ = synth_sum_case_injective t k in
jump_synth
(jump_weaken
(weaken_parse_cases_kind t pc)
(vc k)
()
)
(synth_sum_case t k)
()
inline_for_extraction
let jump_sum_cases_t
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot Type
= jumper (parse_sum_cases t pc k)
let jump_sum_cases_t_eq
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
(x y : jump_sum_cases_t t pc k)
: GTot Type0
= True
inline_for_extraction
let jump_sum_cases_t_if
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (if_combinator _ (jump_sum_cases_t_eq t pc k))
= fun cond (sv_true: cond_true cond -> Tot (jump_sum_cases_t t pc k)) (sv_false: cond_false cond -> Tot (jump_sum_cases_t t pc k)) #rrel #rel input pos ->
if cond
then sv_true () input pos
else sv_false () input pos
inline_for_extraction
let jump_sum_cases
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(vc: ((x: sum_key t) -> Tot (jumper (dsnd (pc x)))))
(destr: dep_enum_destr (sum_enum t) (jump_sum_cases_t t pc))
(k: sum_key t)
: Tot (jumper (parse_sum_cases t pc k))
= destr
_
(jump_sum_cases_t_if t pc)
(fun _ _ -> ())
(fun _ _ _ _ -> ())
(jump_sum_cases_aux t pc vc)
k
inline_for_extraction
let jump_sum_aux_payload_t
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
: Tot Type
= (#rrel: _) -> (#rel: _) ->
(input: slice rrel rel) ->
(pos: U32.t) ->
HST.Stack U32.t
(requires (fun h -> live_slice h input /\ U32.v pos <= U32.v input.len /\ (
match k with
| Unknown _ -> False
| Known k' -> valid (dsnd (pc k')) h input pos
)))
(ensures (fun h res h' ->
B.modifies B.loc_none h h' /\ (
match k with
| Unknown _ -> False
| Known k' ->
valid_pos (dsnd (pc k')) h input pos res
)))
let jump_sum_aux_payload_eq
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
: Tot (jump_sum_aux_payload_t t pc k -> jump_sum_aux_payload_t t pc k -> GTot Type0)
= fun _ _ -> True
inline_for_extraction
let jump_sum_aux_payload_if'
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
(cond: bool)
(ift: ((cond_true cond) -> Tot (jump_sum_aux_payload_t t pc k)))
(iff: ((cond_false cond) -> Tot (jump_sum_aux_payload_t t pc k)))
: Tot (jump_sum_aux_payload_t t pc k)
= fun #rrel #rel input pos ->
if cond
then begin
(ift () <: jump_sum_aux_payload_t t pc k) input pos
end else
(iff () <: jump_sum_aux_payload_t t pc k) input pos
inline_for_extraction
let jump_sum_aux_payload_if
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
: Tot (if_combinator _ (jump_sum_aux_payload_eq t pc k))
= jump_sum_aux_payload_if' t pc k
let parse_sum_eq3
(#kt: parser_kind)
(t: sum)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(input: bytes)
(k' : sum_repr_type t)
(consumed_k: consumed_length input)
: Lemma
(requires (Some? (parse (parse_sum t p pc) input) /\ parse p input == Some (k', consumed_k)))
(ensures (
let input_k = Seq.slice input consumed_k (Seq.length input) in
let k = maybe_enum_key_of_repr (sum_enum t) k' in
begin match k with
| Known k ->
Some? (parse (dsnd (pc k)) input_k)
| _ -> False
end
))
= parse_sum_eq'' t p pc input
let parse_sum_eq4
(#kt: parser_kind)
(t: sum)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(input: bytes)
(k' : sum_repr_type t)
(consumed_k: consumed_length input)
(consumed_payload: nat)
: Lemma
(requires (Some? (parse (parse_sum t p pc) input) /\ parse p input == Some (k', consumed_k) /\ (
let input_k = Seq.slice input consumed_k (Seq.length input) in
let k = maybe_enum_key_of_repr (sum_enum t) k' in
begin match k with
| Known k ->
Some? (parse (dsnd (pc k)) input_k) /\ (
let Some (_, consumed_payload') = parse (dsnd (pc k)) input_k in
consumed_payload' == consumed_payload
)
| _ -> False
end
)))
(ensures (
let Some (_, consumed) = parse (parse_sum t p pc) input in
consumed == consumed_k + consumed_payload
))
= parse_sum_eq'' t p pc input
#push-options "--z3rlimit 16"
let valid_sum_elim
(h: HS.mem)
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(#rrel: _) (#rel: _)
(input: slice rrel rel)
(pos: U32.t)
: Lemma
(requires (
valid (parse_sum t p pc) h input pos
))
(ensures (
valid p h input pos /\ (
let pos_payload = get_valid_pos p h input pos in
let k' = maybe_enum_key_of_repr (sum_enum t) (contents p h input pos) in
match k' with
| Known k ->
k == sum_tag_of_data t (contents (parse_sum t p pc) h input pos) /\
valid (dsnd (pc k)) h input pos_payload /\
valid_pos
(parse_sum t p pc) h input pos
(get_valid_pos (dsnd (pc k)) h input pos_payload)
| _ -> False
)))
= let sinput = bytes_of_slice_from h input pos in
let _ = parse_sum_eq'' t p pc sinput in
[@inline_let]
let _ = valid_facts (parse_sum t p pc) h input pos in
let Some (k', consumed_k) = parse p sinput in
let pos_after_tag = U32.uint_to_t (U32.v pos + consumed_k) in
[@inline_let]
let _ = valid_facts p h input pos in
assert (valid_content_pos p h input pos k' pos_after_tag);
match maybe_enum_key_of_repr (sum_enum t) k' with
| Known k -> valid_facts (dsnd (pc k)) h input pos_after_tag
| _ -> ()
#pop-options
let valid_sum_elim_tag
(h: HS.mem)
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: Lemma
(requires (
valid (parse_sum t p pc) h input pos
))
(ensures (
valid (parse_enum_key p (sum_enum t)) h input pos /\
contents (parse_enum_key p (sum_enum t)) h input pos == sum_tag_of_data t (contents (parse_sum t p pc) h input pos)
))
= let _ = parse_sum_eq' t p pc (bytes_of_slice_from h input pos) in
let _ = valid_facts (parse_sum t p pc) h input pos in
let _ = valid_facts (parse_enum_key p (sum_enum t)) h input pos in
()
inline_for_extraction
let read_sum_tag
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(p32: leaf_reader p)
(destr: dep_maybe_enum_destr_t (sum_enum t) (read_enum_key_t (sum_enum t)))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: HST.Stack (sum_key t)
(requires (fun h ->
valid (parse_sum t p pc) h input pos
))
(ensures (fun h res h' ->
B.modifies B.loc_none h h' /\
res == sum_tag_of_data t (contents (parse_sum t p pc) h input pos)
))
= let h = HST.get () in
[@inline_let] let _ = valid_sum_elim_tag h t p pc input pos in
read_enum_key p32 (sum_enum t) destr input pos
inline_for_extraction
let jump_sum_aux
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(v: jumper p)
(p32: leaf_reader p)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(v_payload: ((k: sum_repr_type t)) -> Tot (jump_sum_aux_payload_t t pc (maybe_enum_key_of_repr (sum_enum t) k)))
: Tot (jumper (parse_sum t p pc))
= fun #rrel #rel input pos ->
let h = HST.get () in
[@inline_let]
let _ = valid_sum_elim h t p pc input pos in
let pos_after_tag = v input pos in
let k' = p32 input pos in
v_payload k' input pos_after_tag
inline_for_extraction
let jump_sum_aux_payload'
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (jumper (dsnd (pc x)))))
(k: maybe_enum_key (sum_enum t))
: Tot (jump_sum_aux_payload_t t pc k)
= fun #rrel #rel input pos ->
match k with
| Known k ->
[@inline_let]
let _ = synth_sum_case_injective t k in
pc32 k input pos
| _ -> 0ul // dummy, but we MUST NOT remove this branch, otherwise extraction fails
inline_for_extraction
let jump_sum_aux_payload
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (jumper (dsnd (pc x)))))
(destr: dep_maybe_enum_destr_t (sum_enum t) (jump_sum_aux_payload_t t pc))
(k: sum_repr_type t)
: Tot (jump_sum_aux_payload_t t pc (maybe_enum_key_of_repr (sum_enum t) k))
= destr (jump_sum_aux_payload_eq t pc) (jump_sum_aux_payload_if t pc) (fun _ _ -> ()) (fun _ _ _ _ -> ()) (jump_sum_aux_payload' t pc pc32) k
inline_for_extraction
let jump_sum
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(v: jumper p)
(p32: leaf_reader p)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (jumper (dsnd (pc x)))))
(destr: dep_maybe_enum_destr_t (sum_enum t) (jump_sum_aux_payload_t t pc))
: Tot (jumper (parse_sum t p pc))
= jump_sum_aux t v p32 pc (jump_sum_aux_payload t pc pc32 destr)
inline_for_extraction
let read_sum_cases'
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (leaf_reader (dsnd (pc x)))))
(k: sum_key t)
: Tot (leaf_reader (parse_sum_cases' t pc k))
= [@inline_let]
let _ = synth_sum_case_injective t k in
read_synth'
(dsnd (pc k))
(synth_sum_case t k)
(pc32 k)
()
inline_for_extraction
let read_sum_cases_t
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot Type
= leaf_reader (parse_sum_cases' t pc k)
let read_sum_cases_t_eq
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
(x y : read_sum_cases_t t pc k)
: GTot Type0
= True
inline_for_extraction
let read_sum_cases_t_if
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (if_combinator _ (read_sum_cases_t_eq t pc k))
= fun cond (sv_true: cond_true cond -> Tot (read_sum_cases_t t pc k)) (sv_false: cond_false cond -> Tot (read_sum_cases_t t pc k)) #_ #_ input pos ->
if cond
then (sv_true () input pos)
else (sv_false () input pos)
inline_for_extraction
let read_sum_cases
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (leaf_reader (dsnd (pc x)))))
(destr: dep_enum_destr (sum_enum t) (read_sum_cases_t t pc))
(k: sum_key t)
: Tot (leaf_reader (parse_sum_cases' t pc k))
= destr
_
(read_sum_cases_t_if t pc)
(fun _ _ -> ())
(fun _ _ _ _ -> ())
(read_sum_cases' t pc pc32)
k
#push-options "--z3rlimit 32"
inline_for_extraction
let read_sum
(#kt: parser_kind)
(t: sum)
(p: parser kt (sum_repr_type t))
(p32: leaf_reader (parse_enum_key p (sum_enum t)))
(j: jumper p)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (leaf_reader (dsnd (pc x)))))
(destr: dep_enum_destr (sum_enum t) (read_sum_cases_t t pc))
: Tot (leaf_reader (parse_sum t p pc))
=
fun #_ #_ input pos ->
let h = HST.get () in
valid_facts (parse_sum t p pc) h input pos;
parse_sum_eq' t p pc (bytes_of_slice_from h input pos);
valid_facts (parse_enum_key p (sum_enum t)) h input pos;
let k = p32 input pos in
let pos' = jump_enum_key j (sum_enum t) input pos in
valid_facts (parse_sum_cases' t pc k) h input pos' ;
read_sum_cases t pc pc32 destr k input pos'
#pop-options
inline_for_extraction
let serialize32_sum_cases_t
(t: sum)
(#pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(sc: ((x: sum_key t) -> Tot (serializer (dsnd (pc x)))))
(k: sum_key t)
: Tot Type
= serializer32 (serialize_sum_cases t pc sc k)
let serialize32_sum_cases_t_eq
(t: sum)
(#pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(sc: ((x: sum_key t) -> Tot (serializer (dsnd (pc x)))))
(k: sum_key t)
(x y: serialize32_sum_cases_t t sc k)
: GTot Type0
= True
inline_for_extraction
let serialize32_sum_cases_t_if
(t: sum)
(#pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(sc: ((x: sum_key t) -> Tot (serializer (dsnd (pc x)))))
(k: sum_key t)
: Tot (if_combinator _ (serialize32_sum_cases_t_eq t sc k))
= fun cond (sv_true: (cond_true cond -> Tot (serialize32_sum_cases_t t sc k))) (sv_false: (cond_false cond -> Tot (serialize32_sum_cases_t t sc k))) x #rrel #rel b pos ->
if cond
then (sv_true () x b pos)
else (sv_false () x b pos)
inline_for_extraction
let serialize32_sum_cases_aux
(t: sum)
(#pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(sc: ((x: sum_key t) -> Tot (serializer (dsnd (pc x)))))
(sc32: ((x: sum_key t) -> Tot (serializer32 (sc x))))
(k: sum_key t)
: Tot (serializer32 (serialize_sum_cases t pc sc k))
= fun x #rrel #rel b pos ->
[@inline_let] let _ =
Classical.forall_intro (parse_sum_cases_eq' t pc k);
synth_sum_case_injective t k;
synth_sum_case_inverse t k
in
serialize32_synth
(sc32 k)
(synth_sum_case t k)
(synth_sum_case_recip t k)
(fun x -> synth_sum_case_recip t k x)
()
x
b
pos
inline_for_extraction
let serialize32_sum_cases
(t: sum)
(#pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(sc: ((x: sum_key t) -> Tot (serializer (dsnd (pc x)))))
(sc32: ((x: sum_key t) -> Tot (serializer32 (sc x))))
(destr: dep_enum_destr (sum_enum t) (serialize32_sum_cases_t t sc))
(k: sum_key t)
: Tot (serializer32 (serialize_sum_cases t pc sc k))
= destr
_
(serialize32_sum_cases_t_if t sc)
(fun _ _ -> ())
(fun _ _ _ _ -> ())
(serialize32_sum_cases_aux t sc sc32)
k
inline_for_extraction
let serialize32_sum
(#kt: parser_kind)
(t: sum)
(#p: parser kt (sum_repr_type t))
(s: serializer p {kt.parser_kind_subkind == Some ParserStrong})
(s32: serializer32 (serialize_enum_key _ s (sum_enum t)))
(#pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(sc: ((x: sum_key t) -> Tot (serializer (dsnd (pc x)))))
(sc32: ((x: sum_key t) -> Tot (serializer32 (sc x))))
(destr: dep_enum_destr (sum_enum t) (serialize32_sum_cases_t t sc))
: Tot (serializer32 (serialize_sum t s sc))
= fun x #rrel #rel b pos ->
serialize_sum_eq t s sc x;
let tg = sum_tag_of_data t x in
serialize32_nondep_then_aux s32 (serialize32_sum_cases t sc sc32 destr tg) tg x b pos
let clens_sum_tag
(s: sum)
: Tot (clens (sum_type s) (sum_key s))
= {
clens_cond = (fun _ -> True);
clens_get = sum_tag_of_data s;
}
let gaccessor_sum_tag
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
: Tot (gaccessor (parse_sum t p pc) (parse_enum_key p (sum_enum t)) (clens_sum_tag t))
= gaccessor_tagged_union_tag
(parse_enum_key p (sum_enum t))
(sum_tag_of_data t)
(parse_sum_cases t pc)
inline_for_extraction
let accessor_sum_tag
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
: Tot (accessor (gaccessor_sum_tag t p pc))
= accessor_tagged_union_tag
(parse_enum_key p (sum_enum t))
(sum_tag_of_data t)
(parse_sum_cases t pc)
let clens_sum_payload
(s: sum)
(k: sum_key s)
: Tot (clens (sum_type s) (sum_type_of_tag s k))
= {
clens_cond = (fun (x: sum_type s) -> sum_tag_of_data s x == k);
clens_get = (fun (x: sum_type s) -> synth_sum_case_recip s k x <: Ghost (sum_type_of_tag s k) (requires (sum_tag_of_data s x == k)) (ensures (fun _ -> True)));
}
#push-options "--z3rlimit 32"
let gaccessor_clens_sum_payload'
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (gaccessor' (parse_sum t p pc) (dsnd (pc k)) (clens_sum_payload t k))
= fun (input: bytes) ->
parse_sum_eq'' t p pc input;
let res =
match parse p input with
| Some (_, consumed) ->
synth_sum_case_inverse t k;
synth_sum_case_injective t k;
synth_injective_synth_inverse_synth_inverse_recip (synth_sum_case t k) (synth_sum_case_recip t k) ();
(consumed)
| _ -> 0 // dummy
in
(res <: (res: _ { gaccessor_post' (parse_sum t p pc) (dsnd (pc k)) (clens_sum_payload t k) input res } ))
#push-options "--z3rlimit 64"
let gaccessor_clens_sum_payload_injective
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
(sl sl' : bytes)
: Lemma
(requires (
gaccessor_pre (parse_sum t p pc) (dsnd (pc k)) (clens_sum_payload t k) sl /\
gaccessor_pre (parse_sum t p pc) (dsnd (pc k)) (clens_sum_payload t k) sl' /\
injective_precond (parse_sum t p pc) sl sl'
))
(ensures (gaccessor_clens_sum_payload' t p pc k sl == gaccessor_clens_sum_payload' t p pc k sl'))
= parse_sum_eq'' t p pc sl;
parse_sum_eq'' t p pc sl' ;
parse_injective (parse_sum t p pc) sl sl' ;
parse_injective p sl sl'
#pop-options
let gaccessor_clens_sum_payload_no_lookahead
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
(sl sl' : bytes)
: Lemma
(requires (
(parse_sum_kind kt t pc).parser_kind_subkind == Some ParserStrong /\
gaccessor_pre (parse_sum t p pc) (dsnd (pc k)) (clens_sum_payload t k) sl /\
gaccessor_pre (parse_sum t p pc) (dsnd (pc k)) (clens_sum_payload t k) sl' /\
no_lookahead_on_precond (parse_sum t p pc) sl sl'
))
(ensures (gaccessor_clens_sum_payload' t p pc k sl == gaccessor_clens_sum_payload' t p pc k sl'))
= parse_sum_eq'' t p pc sl;
parse_sum_eq'' t p pc sl' ;
parse_strong_prefix (parse_sum t p pc) sl sl' ;
parse_injective p sl sl'
let gaccessor_clens_sum_payload
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (gaccessor (parse_sum t p pc) (dsnd (pc k)) (clens_sum_payload t k))
= Classical.forall_intro_2 (fun x -> Classical.move_requires (gaccessor_clens_sum_payload_injective t p pc k x));
Classical.forall_intro_2 (fun x -> Classical.move_requires (gaccessor_clens_sum_payload_no_lookahead t p pc k x));
gaccessor_prop_equiv (parse_sum t p pc) (dsnd (pc k)) (clens_sum_payload t k) (gaccessor_clens_sum_payload' t p pc k);
gaccessor_clens_sum_payload' t p pc k
inline_for_extraction
let accessor_clens_sum_payload'
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(j: jumper p)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: HST.Stack U32.t
(requires (fun h ->
valid (parse_sum t p pc) h input pos /\
(clens_sum_payload t k).clens_cond (contents (parse_sum t p pc) h input pos)
))
(ensures (fun h pos' h' ->
B.modifies B.loc_none h h' /\
pos' == slice_access h (gaccessor_clens_sum_payload t p pc k) input pos
))
=
let h = HST.get () in
[@inline_let]
let _ =
let pos' = get_valid_pos (parse_sum t p pc) h input pos in
let large = bytes_of_slice_from h input pos in
slice_access_eq h (gaccessor_clens_sum_payload t p pc k) input pos;
valid_facts (parse_sum t p pc) h input pos;
parse_sum_eq'' t p pc large;
valid_facts p h input pos
in
j input pos
#pop-options
inline_for_extraction
let accessor_clens_sum_payload
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(j: jumper p)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (accessor (gaccessor_clens_sum_payload t p pc k))
= fun #rrel #rel -> accessor_clens_sum_payload' t j pc k #rrel #rel
let clens_sum_cases_payload
(s: sum)
(k: sum_key s)
: Tot (clens (sum_cases s k) (sum_type_of_tag s k))
= {
clens_cond = (fun (x: sum_cases s k) -> True);
clens_get = (fun (x: sum_cases s k) -> synth_sum_case_recip s k x <: Ghost (sum_type_of_tag s k) (requires (True)) (ensures (fun _ -> True)));
}
let gaccessor_clens_sum_cases_payload
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (gaccessor (parse_sum_cases' t pc k) (dsnd (pc k)) (clens_sum_cases_payload t k))
= synth_sum_case_injective t k;
synth_sum_case_inverse t k;
synth_injective_synth_inverse_synth_inverse_recip (synth_sum_case t k) (synth_sum_case_recip t k) ();
gaccessor_ext
(gaccessor_synth (dsnd (pc k)) (synth_sum_case t k) (synth_sum_case_recip t k) ())
(clens_sum_cases_payload t k)
()
inline_for_extraction
let accessor_clens_sum_cases_payload
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (accessor (gaccessor_clens_sum_cases_payload t pc k))
= [@inline_let]
let _ =
synth_sum_case_injective t k;
synth_sum_case_inverse t k;
synth_injective_synth_inverse_synth_inverse_recip (synth_sum_case t k) (synth_sum_case_recip t k) ()
in
accessor_ext
(accessor_synth (dsnd (pc k)) (synth_sum_case t k) (synth_sum_case_recip t k) ())
(clens_sum_cases_payload t k)
()
inline_for_extraction
let validate_dsum_cases_t
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(#k: parser_kind)
(g: parser k (dsum_type_of_unknown_tag s))
(x: dsum_key s)
: Tot Type
= validator (parse_dsum_cases' s f g x)
let validate_dsum_cases_eq
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(#k: parser_kind)
(g: parser k (dsum_type_of_unknown_tag s))
(x: dsum_key s)
(v1 v2 : validate_dsum_cases_t s f g x)
: GTot Type0
= True
inline_for_extraction
let validate_dsum_cases_if'
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(#k: parser_kind)
(g: parser k (dsum_type_of_unknown_tag s))
(x: dsum_key s)
(cond: bool)
(ift: (cond_true cond -> Tot (validate_dsum_cases_t s f g x)))
(iff: (cond_false cond -> Tot (validate_dsum_cases_t s f g x)))
: Tot (validate_dsum_cases_t s f g x)
= fun #rrel #rel input len ->
if cond
then (ift () <: validate_dsum_cases_t s f g x) input len
else (iff () <: validate_dsum_cases_t s f g x) input len
inline_for_extraction
let validate_dsum_cases_if
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(#k: parser_kind)
(g: parser k (dsum_type_of_unknown_tag s))
(x: dsum_key s)
: Tot (if_combinator _ (validate_dsum_cases_eq s f g x))
= validate_dsum_cases_if' s f g x
inline_for_extraction
let validate_dsum_cases'
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(f' : (x: dsum_known_key s) -> Tot (validator (dsnd (f x))))
(#k: parser_kind)
(#g: parser k (dsum_type_of_unknown_tag s))
(g' : validator g)
(x: dsum_key s)
: Tot (validate_dsum_cases_t s f g x)
= [@inline_let]
let _ = synth_dsum_case_injective s x in
match x with
| Known x' -> validate_synth (f' x') (synth_dsum_case s (Known x')) () <: validator (parse_dsum_cases' s f g x)
| Unknown x' -> validate_synth g' (synth_dsum_case s (Unknown x')) () <: validator (parse_dsum_cases' s f g x)
inline_for_extraction
let validate_dsum_cases'_destr
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(f' : (x: dsum_known_key s) -> Tot (validator (dsnd (f x))))
(#k: parser_kind)
(#g: parser k (dsum_type_of_unknown_tag s))
(g' : validator g)
(destr: dep_enum_destr _ (fun k -> validate_dsum_cases_t s f g (Known k)))
(x: dsum_key s)
: Tot (validate_dsum_cases_t s f g x)
= fun #rrel #rel input pos ->
match x with
| Known k ->
destr
_
(fun k -> validate_dsum_cases_if s f g (Known k))
(fun _ _ -> ())
(fun _ _ _ _ -> ())
(fun k -> validate_dsum_cases' s f f' g' (Known k))
k
input
pos
| Unknown r -> validate_dsum_cases' s f f' g' (Unknown r) input pos
inline_for_extraction
let validate_dsum_cases
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(f' : (x: dsum_known_key s) -> Tot (validator (dsnd (f x))))
(#k: parser_kind)
(#g: parser k (dsum_type_of_unknown_tag s))
(g' : validator g)
(destr: dep_enum_destr _ (fun k -> validate_dsum_cases_t s f g (Known k)))
(x: dsum_key s)
: Tot (validator (parse_dsum_cases s f g x))
= fun #rrel #rel input pos ->
let h = HST.get () in
[@inline_let]
let _ =
valid_facts (parse_dsum_cases' s f g x) h input (uint64_to_uint32 pos);
valid_facts (parse_dsum_cases s f g x) h input (uint64_to_uint32 pos);
parse_dsum_cases_eq' s f g x (bytes_of_slice_from h input (uint64_to_uint32 pos))
in
validate_dsum_cases'_destr s f f' g' destr x input pos
#push-options "--z3rlimit 40"
inline_for_extraction
let validate_dsum
(#kt: parser_kind)
(t: dsum)
(#p: parser kt (dsum_repr_type t))
(v: validator p)
(p32: leaf_reader p)
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(f32: (x: dsum_known_key t) -> Tot (validator (dsnd (f x))))
(#k': parser_kind)
(#g: parser k' (dsum_type_of_unknown_tag t))
(g32: validator g)
(destr: dep_maybe_enum_destr_t (dsum_enum t) (validate_dsum_cases_t t f g))
: Tot (validator (parse_dsum t p f g))
= fun #rrel #rel input pos ->
let h = HST.get () in
[@inline_let]
let _ = parse_dsum_eq' t p f g (bytes_of_slice_from h input (uint64_to_uint32 pos)) in
[@inline_let]
let _ = valid_facts (parse_dsum t p f g) h input (uint64_to_uint32 pos) in
[@inline_let]
let _ = valid_facts p h input (uint64_to_uint32 pos) in
let pos_after_tag = v input pos in
if is_error pos_after_tag
then pos_after_tag
else
let tg = p32 input (uint64_to_uint32 pos) in
[@inline_let]
let _ = valid_facts (parse_dsum_cases' t f g (maybe_enum_key_of_repr (dsum_enum t) tg)) h input (uint64_to_uint32 pos_after_tag) in
destr (validate_dsum_cases_eq t f g) (validate_dsum_cases_if t f g) (fun _ _ -> ()) (fun _ _ _ _ -> ()) (validate_dsum_cases' t f f32 g32) tg input pos_after_tag
#pop-options
#reset-options "--z3rlimit 64 --z3cliopt smt.arith.nl=false --initial_ifuel 8 --max_ifuel 8 --initial_fuel 2 --max_fuel 2"
let valid_dsum_intro_known
(h: HS.mem)
(t: dsum)
(#kt: parser_kind)
(p: parser kt (dsum_repr_type t))
(f: ((x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x))))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: Lemma
(requires (
valid (parse_maybe_enum_key p (dsum_enum t)) h input pos /\ (
let k' = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
Known? k' /\ (
let Known k = k' in
valid (dsnd (f k)) h input (get_valid_pos (parse_maybe_enum_key p (dsum_enum t)) h input pos)
))))
(ensures (
let Known k = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
let pos_payload = get_valid_pos (parse_maybe_enum_key p (dsum_enum t)) h input pos in
valid_content_pos
(parse_dsum t p f g) h input pos
(synth_dsum_case t (Known k) (contents (dsnd (f k)) h input pos_payload))
(get_valid_pos (dsnd (f k)) h input pos_payload)
))
= valid_facts (parse_maybe_enum_key p (dsum_enum t)) h input pos;
let Known k = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
let pos_payload = get_valid_pos (parse_maybe_enum_key p (dsum_enum t)) h input pos in
valid_facts (dsnd (f k)) h input pos_payload;
valid_facts (parse_dsum t p f g) h input pos;
parse_dsum_eq t p f g (bytes_of_slice_from h input pos)
let valid_dsum_intro_unknown
(h: HS.mem)
(t: dsum)
(#kt: parser_kind)
(p: parser kt (dsum_repr_type t))
(f: ((x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x))))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: Lemma
(requires (
valid (parse_maybe_enum_key p (dsum_enum t)) h input pos /\ (
let k' = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
Unknown? k' /\
valid g h input (get_valid_pos (parse_maybe_enum_key p (dsum_enum t)) h input pos)
)))
(ensures (
let Unknown r = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
let pos_payload = get_valid_pos (parse_maybe_enum_key p (dsum_enum t)) h input pos in
valid_content_pos
(parse_dsum t p f g) h input pos
(synth_dsum_case t (Unknown r) (contents g h input pos_payload))
(get_valid_pos g h input pos_payload)
))
= valid_facts (parse_maybe_enum_key p (dsum_enum t)) h input pos;
let Unknown r = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
let pos_payload = get_valid_pos (parse_maybe_enum_key p (dsum_enum t)) h input pos in
valid_facts g h input pos_payload;
valid_facts (parse_dsum t p f g) h input pos;
parse_dsum_eq t p f g (bytes_of_slice_from h input pos)
#reset-options
inline_for_extraction
let finalize_dsum_case_known
(t: dsum)
(#kt: parser_kind)
(#p: parser kt (dsum_repr_type t))
(s: serializer p)
(w: leaf_writer_strong s)
(f: ((x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x))))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
(destr: enum_repr_of_key'_t (dsum_enum t))
(k: dsum_known_key t)
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: HST.Stack unit
(requires (fun h ->
let len_tag = serialized_length (serialize_enum_key _ s (dsum_enum t)) k in
U32.v pos + len_tag < 4294967296 /\ (
let pos_payload = pos `U32.add` U32.uint_to_t len_tag in
valid (dsnd (f k)) h input pos_payload /\
writable input.base (U32.v pos) (U32.v pos_payload) h
)))
(ensures (fun h _ h' ->
let len_tag = serialized_length (serialize_enum_key _ s (dsum_enum t)) k in
let pos_payload = pos `U32.add` U32.uint_to_t len_tag in
B.modifies (loc_slice_from_to input pos pos_payload) h h' /\
valid_content_pos (parse_dsum t p f g) h' input pos (synth_dsum_case t (Known k) (contents (dsnd (f k)) h input pos_payload)) (get_valid_pos (dsnd (f k)) h input pos_payload)
))
= let pos1 = write_enum_key w (dsum_enum t) destr k input pos in
let h = HST.get () in
[@inline_let]
let _ =
valid_facts (parse_enum_key p (dsum_enum t)) h input pos;
valid_facts (parse_maybe_enum_key p (dsum_enum t)) h input pos;
let sq = bytes_of_slice_from h input pos in
parse_enum_key_eq p (dsum_enum t) sq;
parse_maybe_enum_key_eq p (dsum_enum t) sq;
valid_dsum_intro_known h t p f g input pos
in
()
inline_for_extraction
let finalize_dsum_case_unknown
(t: dsum)
(#kt: parser_kind)
(#p: parser kt (dsum_repr_type t))
(s: serializer p)
(w: leaf_writer_strong s)
(f: ((x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x))))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
(r: unknown_enum_repr (dsum_enum t))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: HST.Stack unit
(requires (fun h ->
let len_tag = serialized_length s r in
U32.v pos + len_tag < 4294967296 /\ (
let pos_payload = pos `U32.add` U32.uint_to_t len_tag in
valid g h input pos_payload /\
writable input.base (U32.v pos) (U32.v pos_payload) h
)))
(ensures (fun h _ h' ->
let len_tag = serialized_length s r in
let pos_payload = pos `U32.add` U32.uint_to_t len_tag in
B.modifies (loc_slice_from_to input pos pos_payload) h h' /\
valid_content_pos (parse_dsum t p f g) h' input pos (synth_dsum_case t (Unknown r) (contents g h input pos_payload)) (get_valid_pos g h input pos_payload)
))
= let pos1 = w r input pos in
let h = HST.get () in
[@inline_let]
let _ =
valid_facts (parse_maybe_enum_key p (dsum_enum t)) h input pos;
valid_facts p h input pos;
let sq = bytes_of_slice_from h input pos in
parse_maybe_enum_key_eq p (dsum_enum t) sq;
valid_dsum_intro_unknown h t p f g input pos
in
()
let valid_dsum_elim_tag
(h: HS.mem)
(t: dsum)
(#kt: parser_kind)
(p: parser kt (dsum_repr_type t))
(f: ((x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x))))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: Lemma
(requires (
valid (parse_dsum t p f g) h input pos
))
(ensures (
valid (parse_maybe_enum_key p (dsum_enum t)) h input pos /\
contents (parse_maybe_enum_key p (dsum_enum t)) h input pos == dsum_tag_of_data t (contents (parse_dsum t p f g) h input pos)
))
= let _ = parse_dsum_eq_ t p f g (bytes_of_slice_from h input pos) in
let _ = valid_facts (parse_dsum t p f g) h input pos in
let _ = valid_facts (parse_maybe_enum_key p (dsum_enum t)) h input pos in
()
inline_for_extraction
let read_dsum_tag
(t: dsum)
(#kt: parser_kind)
(#p: parser kt (dsum_repr_type t))
(p32: leaf_reader p)
(destr: maybe_enum_destr_t (maybe_enum_key (dsum_enum t)) (dsum_enum t))
(f: ((x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x))))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: HST.Stack (dsum_key t)
(requires (fun h ->
valid (parse_dsum t p f g) h input pos
))
(ensures (fun h res h' ->
B.modifies B.loc_none h h' /\
res == dsum_tag_of_data t (contents (parse_dsum t p f g) h input pos)
))
= let h = HST.get () in
[@inline_let] let _ = valid_dsum_elim_tag h t p f g input pos in
read_maybe_enum_key p32 (dsum_enum t) destr input pos
#push-options "--z3rlimit 32"
let valid_dsum_elim_known
(h: HS.mem)
(t: dsum)
(#kt: parser_kind)
(p: parser kt (dsum_repr_type t))
(f: ((x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x))))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: Lemma
(requires (
valid (parse_dsum t p f g) h input pos /\
Known? (dsum_tag_of_data t (contents (parse_dsum t p f g) h input pos))
))
(ensures (
valid (parse_maybe_enum_key p (dsum_enum t)) h input pos /\ (
let k' = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
let pos_payload = get_valid_pos (parse_maybe_enum_key p (dsum_enum t)) h input pos in
Known? k' /\ (
let Known k = k' in
valid (dsnd (f k)) h input pos_payload /\
valid_content_pos
(parse_dsum t p f g) h input pos
(synth_dsum_case t (Known k) (contents (dsnd (f k)) h input pos_payload))
(get_valid_pos (dsnd (f k)) h input pos_payload)
))))
=
valid_facts (parse_dsum t p f g) h input pos;
parse_dsum_eq t p f g (bytes_of_slice_from h input pos);
valid_facts (parse_maybe_enum_key p (dsum_enum t)) h input pos;
let Known k = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
let pos_payload = get_valid_pos (parse_maybe_enum_key p (dsum_enum t)) h input pos in
valid_facts (dsnd (f k)) h input pos_payload
#pop-options
let valid_dsum_elim_unknown
(h: HS.mem)
(t: dsum)
(#kt: parser_kind)
(p: parser kt (dsum_repr_type t))
(f: ((x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x))))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: Lemma
(requires (
valid (parse_dsum t p f g) h input pos /\
Unknown? (dsum_tag_of_data t (contents (parse_dsum t p f g) h input pos))
))
(ensures (
valid (parse_maybe_enum_key p (dsum_enum t)) h input pos /\ (
let k' = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
let pos_payload = get_valid_pos (parse_maybe_enum_key p (dsum_enum t)) h input pos in
Unknown? k' /\ (
let Unknown r = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
valid g h input pos_payload /\
valid_content_pos
(parse_dsum t p f g) h input pos
(synth_dsum_case t (Unknown r) (contents g h input pos_payload))
(get_valid_pos g h input pos_payload)
))))
=
valid_facts (parse_dsum t p f g) h input pos;
parse_dsum_eq t p f g (bytes_of_slice_from h input pos);
valid_facts (parse_maybe_enum_key p (dsum_enum t)) h input pos;
let Unknown r = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
let pos_payload = get_valid_pos (parse_maybe_enum_key p (dsum_enum t)) h input pos in
valid_facts g h input pos_payload
inline_for_extraction
let jump_dsum_cases_t
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(#k: parser_kind)
(g: parser k (dsum_type_of_unknown_tag s))
(x: dsum_key s)
: Tot Type
= jumper (parse_dsum_cases' s f g x)
let jump_dsum_cases_eq
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(#k: parser_kind)
(g: parser k (dsum_type_of_unknown_tag s))
(x: dsum_key s)
(v1 v2 : jump_dsum_cases_t s f g x)
: GTot Type0
= True | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"LowStar.Buffer.fst.checked",
"LowParse.Spec.Sum.fst.checked",
"LowParse.Low.Enum.fst.checked",
"FStar.UInt64.fsti.checked",
"FStar.UInt32.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Int.Cast.fst.checked",
"FStar.HyperStack.ST.fsti.checked",
"FStar.HyperStack.fst.checked",
"FStar.Classical.fsti.checked"
],
"interface_file": false,
"source_file": "LowParse.Low.Sum.fst"
} | [
{
"abbrev": true,
"full_module": "FStar.HyperStack",
"short_module": "HS"
},
{
"abbrev": true,
"full_module": "FStar.UInt64",
"short_module": "U64"
},
{
"abbrev": true,
"full_module": "FStar.Int.Cast",
"short_module": "Cast"
},
{
"abbrev": true,
"full_module": "LowStar.Buffer",
"short_module": "B"
},
{
"abbrev": true,
"full_module": "FStar.HyperStack.ST",
"short_module": "HST"
},
{
"abbrev": true,
"full_module": "FStar.UInt32",
"short_module": "U32"
},
{
"abbrev": false,
"full_module": "LowParse.Spec.Sum",
"short_module": null
},
{
"abbrev": false,
"full_module": "LowParse.Low.Enum",
"short_module": null
},
{
"abbrev": false,
"full_module": "LowParse.Low",
"short_module": null
},
{
"abbrev": false,
"full_module": "LowParse.Low",
"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",
"short_module": null
}
] | {
"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_elim_box": false,
"smtencoding_l_arith_repr": "boxwrap",
"smtencoding_nl_arith_repr": "boxwrap",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": true,
"z3cliopt": [],
"z3refresh": false,
"z3rlimit": 5,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | false |
s: LowParse.Spec.Sum.dsum ->
f:
(x: LowParse.Spec.Sum.dsum_known_key s
-> Prims.dtuple2 LowParse.Spec.Base.parser_kind
(fun k -> LowParse.Spec.Base.parser k (LowParse.Spec.Sum.dsum_type_of_known_tag s x))) ->
g: LowParse.Spec.Base.parser k (LowParse.Spec.Sum.dsum_type_of_unknown_tag s) ->
x: LowParse.Spec.Sum.dsum_key s ->
cond: Prims.bool ->
ift: (_: LowParse.Spec.Combinators.cond_true cond -> LowParse.Low.Sum.jump_dsum_cases_t s f g x) ->
iff:
(_: LowParse.Spec.Combinators.cond_false cond -> LowParse.Low.Sum.jump_dsum_cases_t s f g x)
-> LowParse.Low.Sum.jump_dsum_cases_t s f g x | Prims.Tot | [
"total"
] | [] | [
"LowParse.Spec.Sum.dsum",
"LowParse.Spec.Sum.dsum_known_key",
"Prims.dtuple2",
"LowParse.Spec.Base.parser_kind",
"LowParse.Spec.Base.parser",
"LowParse.Spec.Sum.dsum_type_of_known_tag",
"LowParse.Spec.Sum.dsum_type_of_unknown_tag",
"LowParse.Spec.Sum.dsum_key",
"Prims.bool",
"LowParse.Spec.Combinators.cond_true",
"LowParse.Low.Sum.jump_dsum_cases_t",
"LowParse.Spec.Combinators.cond_false",
"LowParse.Slice.srel",
"LowParse.Bytes.byte",
"LowParse.Slice.slice",
"FStar.UInt32.t"
] | [] | false | false | false | false | false | let jump_dsum_cases_if'
(s: dsum)
(f: (x: dsum_known_key s -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x))))
(#k: parser_kind)
(g: parser k (dsum_type_of_unknown_tag s))
(x: dsum_key s)
(cond: bool)
(ift: (cond_true cond -> Tot (jump_dsum_cases_t s f g x)))
(iff: (cond_false cond -> Tot (jump_dsum_cases_t s f g x)))
: Tot (jump_dsum_cases_t s f g x) =
| fun #rrel #rel input len ->
if cond
then (ift () <: jump_dsum_cases_t s f g x) input len
else (iff () <: jump_dsum_cases_t s f g x) input len | false |
LowParse.Low.Sum.fst | LowParse.Low.Sum.read_dsum_tag | val read_dsum_tag
(t: dsum)
(#kt: parser_kind)
(#p: parser kt (dsum_repr_type t))
(p32: leaf_reader p)
(destr: maybe_enum_destr_t (maybe_enum_key (dsum_enum t)) (dsum_enum t))
(f: (x: dsum_known_key t -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x))))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: HST.Stack (dsum_key t)
(requires (fun h -> valid (parse_dsum t p f g) h input pos))
(ensures
(fun h res h' ->
B.modifies B.loc_none h h' /\
res == dsum_tag_of_data t (contents (parse_dsum t p f g) h input pos))) | val read_dsum_tag
(t: dsum)
(#kt: parser_kind)
(#p: parser kt (dsum_repr_type t))
(p32: leaf_reader p)
(destr: maybe_enum_destr_t (maybe_enum_key (dsum_enum t)) (dsum_enum t))
(f: (x: dsum_known_key t -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x))))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: HST.Stack (dsum_key t)
(requires (fun h -> valid (parse_dsum t p f g) h input pos))
(ensures
(fun h res h' ->
B.modifies B.loc_none h h' /\
res == dsum_tag_of_data t (contents (parse_dsum t p f g) h input pos))) | let read_dsum_tag
(t: dsum)
(#kt: parser_kind)
(#p: parser kt (dsum_repr_type t))
(p32: leaf_reader p)
(destr: maybe_enum_destr_t (maybe_enum_key (dsum_enum t)) (dsum_enum t))
(f: ((x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x))))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: HST.Stack (dsum_key t)
(requires (fun h ->
valid (parse_dsum t p f g) h input pos
))
(ensures (fun h res h' ->
B.modifies B.loc_none h h' /\
res == dsum_tag_of_data t (contents (parse_dsum t p f g) h input pos)
))
= let h = HST.get () in
[@inline_let] let _ = valid_dsum_elim_tag h t p f g input pos in
read_maybe_enum_key p32 (dsum_enum t) destr input pos | {
"file_name": "src/lowparse/LowParse.Low.Sum.fst",
"git_rev": "00217c4a89f5ba56002ba9aa5b4a9d5903bfe9fa",
"git_url": "https://github.com/project-everest/everparse.git",
"project_name": "everparse"
} | {
"end_col": 55,
"end_line": 1297,
"start_col": 0,
"start_line": 1275
} | module LowParse.Low.Sum
include LowParse.Low.Enum
include LowParse.Spec.Sum
module U32 = FStar.UInt32
module HST = FStar.HyperStack.ST
module B = LowStar.Buffer
module Cast = FStar.Int.Cast
module U64 = FStar.UInt64
inline_for_extraction
let validate_sum_cases_aux
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(vc: ((x: sum_key t) -> Tot (validator (dsnd (pc x)))))
(k: sum_key t)
: Tot (validator (parse_sum_cases t pc k))
= [@inline_let]
let _ = synth_sum_case_injective t k in
validate_synth
(validate_weaken
(weaken_parse_cases_kind t pc)
(vc k)
()
)
(synth_sum_case t k)
()
inline_for_extraction
let validate_sum_cases_t
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot Type
= validator (parse_sum_cases t pc k)
let validate_sum_cases_t_eq
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
(x y : validate_sum_cases_t t pc k)
: GTot Type0
= True
inline_for_extraction
let validate_sum_cases_t_if
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (if_combinator _ (validate_sum_cases_t_eq t pc k))
= fun cond (sv_true: cond_true cond -> Tot (validate_sum_cases_t t pc k)) (sv_false: cond_false cond -> Tot (validate_sum_cases_t t pc k)) #rrel #rel input pos ->
if cond
then sv_true () input pos
else sv_false () input pos
inline_for_extraction
let validate_sum_cases
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(vc: ((x: sum_key t) -> Tot (validator (dsnd (pc x)))))
(destr: dep_enum_destr (sum_enum t) (validate_sum_cases_t t pc))
(k: sum_key t)
: Tot (validator (parse_sum_cases t pc k))
= destr
_
(validate_sum_cases_t_if t pc)
(fun _ _ -> ())
(fun _ _ _ _ -> ())
(validate_sum_cases_aux t pc vc)
k
inline_for_extraction
let validate_sum_aux_payload_t
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
: Tot Type
= (#rrel: _) -> (#rel: _) ->
(input: slice rrel rel) ->
(pos: U64.t) ->
HST.Stack U64.t
(requires (fun h -> live_slice h input /\ U64.v pos <= U32.v input.len))
(ensures (fun h res h' ->
B.modifies B.loc_none h h' /\ (
match k with
| Unknown _ -> is_error res
| Known k' ->
if is_success res
then
valid_pos (dsnd (pc k')) h input (uint64_to_uint32 pos) (uint64_to_uint32 res)
else
(~ (valid (dsnd (pc k')) h input (uint64_to_uint32 pos)))
)))
let validate_sum_aux_payload_eq
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
: Tot (validate_sum_aux_payload_t t pc k -> validate_sum_aux_payload_t t pc k -> GTot Type0)
= fun _ _ -> True
inline_for_extraction
let validate_sum_aux_payload_if'
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
(cond: bool)
(ift: ((cond_true cond) -> Tot (validate_sum_aux_payload_t t pc k)))
(iff: ((cond_false cond) -> Tot (validate_sum_aux_payload_t t pc k)))
: Tot (validate_sum_aux_payload_t t pc k)
= fun #rrel #rel input pos ->
if cond
then begin
(ift () <: validate_sum_aux_payload_t t pc k) input pos
end else
(iff () <: validate_sum_aux_payload_t t pc k) input pos
inline_for_extraction
let validate_sum_aux_payload_if
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
: Tot (if_combinator _ (validate_sum_aux_payload_eq t pc k))
= validate_sum_aux_payload_if' t pc k
#push-options "--z3rlimit 64 --z3cliopt smt.arith.nl=false --using_facts_from '* -FStar.Int.Cast -LowParse.BitFields'"
// --query_stats --smtencoding.elim_box true --smtencoding.l_arith_repr native --z3refresh"
inline_for_extraction
let validate_sum_aux
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(v: validator p)
(p32: leaf_reader p)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(v_payload: ((k: sum_repr_type t)) -> Tot (validate_sum_aux_payload_t t pc (maybe_enum_key_of_repr (sum_enum t) k)))
: Tot (validator (parse_sum t p pc))
= fun #rrel #rel input pos ->
let h = HST.get () in
[@inline_let]
let _ = parse_sum_eq'' t p pc (bytes_of_slice_from h input (uint64_to_uint32 pos)) in
[@inline_let]
let _ = valid_facts (parse_sum t p pc) h input (uint64_to_uint32 pos) in
[@inline_let]
let _ = valid_facts p h input (uint64_to_uint32 pos) in
let len_after_tag = v input pos in
if is_error len_after_tag
then len_after_tag
else begin
let h1 = HST.get () in
let k' = p32 input (uint64_to_uint32 pos) in
[@inline_let]
let _ =
match maybe_enum_key_of_repr (sum_enum t) k' with
| Known k -> valid_facts (dsnd (pc k)) h input (uint64_to_uint32 len_after_tag)
| _ -> ()
in
v_payload k' input len_after_tag
end
#pop-options
inline_for_extraction
let validate_sum_aux_payload'
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (validator (dsnd (pc x)))))
(k: maybe_enum_key (sum_enum t))
: Tot (validate_sum_aux_payload_t t pc k)
= fun #rrel #rel input pos ->
match k with
| Known k ->
[@inline_let]
let _ = synth_sum_case_injective t k in
pc32 k input pos
// validate_synth (pc32 k) (synth_sum_case t k) () input pos
| _ -> validator_error_generic
inline_for_extraction
let validate_sum_aux_payload
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (validator (dsnd (pc x)))))
(destr: dep_maybe_enum_destr_t (sum_enum t) (validate_sum_aux_payload_t t pc))
(k: sum_repr_type t)
: Tot (validate_sum_aux_payload_t t pc (maybe_enum_key_of_repr (sum_enum t) k))
= destr (validate_sum_aux_payload_eq t pc) (validate_sum_aux_payload_if t pc) (fun _ _ -> ()) (fun _ _ _ _ -> ()) (validate_sum_aux_payload' t pc pc32) k
inline_for_extraction
let validate_sum
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(v: validator p)
(p32: leaf_reader p)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (validator (dsnd (pc x)))))
(destr: dep_maybe_enum_destr_t (sum_enum t) (validate_sum_aux_payload_t t pc))
: Tot (validator (parse_sum t p pc))
= validate_sum_aux t v p32 pc (validate_sum_aux_payload t pc pc32 destr)
module HS = FStar.HyperStack
#push-options "--z3rlimit 256 --z3cliopt smt.arith.nl=false --initial_ifuel 8 --max_ifuel 8 --initial_fuel 2 --max_fuel 2"
#restart-solver
let valid_sum_intro
(h: HS.mem)
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: Lemma
(requires (
valid (parse_enum_key p (sum_enum t)) h input pos /\ (
let k = contents (parse_enum_key p (sum_enum t)) h input pos in
valid (dsnd (pc k)) h input (get_valid_pos (parse_enum_key p (sum_enum t)) h input pos)
)))
(ensures (
let k = contents (parse_enum_key p (sum_enum t)) h input pos in
let pos_payload = get_valid_pos (parse_enum_key p (sum_enum t)) h input pos in
valid_content_pos
(parse_sum t p pc) h input pos
(synth_sum_case t k (contents (dsnd (pc k)) h input pos_payload))
(get_valid_pos (dsnd (pc k)) h input pos_payload)
))
= valid_facts (parse_enum_key p (sum_enum t)) h input pos;
let k = contents (parse_enum_key p (sum_enum t)) h input pos in
let pos_payload = get_valid_pos (parse_enum_key p (sum_enum t)) h input pos in
valid_facts (dsnd (pc k)) h input pos_payload;
valid_facts (parse_sum t p pc) h input pos;
parse_sum_eq t p pc (bytes_of_slice_from h input pos)
#pop-options
inline_for_extraction
let finalize_sum_case
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(s: serializer p)
(w: leaf_writer_strong s)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(destr: enum_repr_of_key'_t (sum_enum t))
(k: sum_key t)
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: HST.Stack unit
(requires (fun h ->
let len_tag = serialized_length (serialize_enum_key _ s (sum_enum t)) k in
U32.v pos + len_tag < 4294967296 /\ (
let pos_payload = pos `U32.add` U32.uint_to_t len_tag in
valid (dsnd (pc k)) h input pos_payload /\
writable input.base (U32.v pos) (U32.v pos_payload) h
)))
(ensures (fun h _ h' ->
let len_tag = serialized_length (serialize_enum_key _ s (sum_enum t)) k in
let pos_payload = pos `U32.add` U32.uint_to_t len_tag in
B.modifies (loc_slice_from_to input pos pos_payload) h h' /\
valid_content_pos (parse_sum t p pc) h' input pos (synth_sum_case t k (contents (dsnd (pc k)) h input pos_payload)) (get_valid_pos (dsnd (pc k)) h input pos_payload)
))
= let pos1 = write_enum_key w (sum_enum t) destr k input pos in
let h = HST.get () in
[@inline_let]
let _ = valid_sum_intro h t p pc input pos in
()
inline_for_extraction
let jump_sum_cases_aux
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(vc: ((x: sum_key t) -> Tot (jumper (dsnd (pc x)))))
(k: sum_key t)
: Tot (jumper (parse_sum_cases t pc k))
= [@inline_let]
let _ = synth_sum_case_injective t k in
jump_synth
(jump_weaken
(weaken_parse_cases_kind t pc)
(vc k)
()
)
(synth_sum_case t k)
()
inline_for_extraction
let jump_sum_cases_t
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot Type
= jumper (parse_sum_cases t pc k)
let jump_sum_cases_t_eq
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
(x y : jump_sum_cases_t t pc k)
: GTot Type0
= True
inline_for_extraction
let jump_sum_cases_t_if
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (if_combinator _ (jump_sum_cases_t_eq t pc k))
= fun cond (sv_true: cond_true cond -> Tot (jump_sum_cases_t t pc k)) (sv_false: cond_false cond -> Tot (jump_sum_cases_t t pc k)) #rrel #rel input pos ->
if cond
then sv_true () input pos
else sv_false () input pos
inline_for_extraction
let jump_sum_cases
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(vc: ((x: sum_key t) -> Tot (jumper (dsnd (pc x)))))
(destr: dep_enum_destr (sum_enum t) (jump_sum_cases_t t pc))
(k: sum_key t)
: Tot (jumper (parse_sum_cases t pc k))
= destr
_
(jump_sum_cases_t_if t pc)
(fun _ _ -> ())
(fun _ _ _ _ -> ())
(jump_sum_cases_aux t pc vc)
k
inline_for_extraction
let jump_sum_aux_payload_t
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
: Tot Type
= (#rrel: _) -> (#rel: _) ->
(input: slice rrel rel) ->
(pos: U32.t) ->
HST.Stack U32.t
(requires (fun h -> live_slice h input /\ U32.v pos <= U32.v input.len /\ (
match k with
| Unknown _ -> False
| Known k' -> valid (dsnd (pc k')) h input pos
)))
(ensures (fun h res h' ->
B.modifies B.loc_none h h' /\ (
match k with
| Unknown _ -> False
| Known k' ->
valid_pos (dsnd (pc k')) h input pos res
)))
let jump_sum_aux_payload_eq
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
: Tot (jump_sum_aux_payload_t t pc k -> jump_sum_aux_payload_t t pc k -> GTot Type0)
= fun _ _ -> True
inline_for_extraction
let jump_sum_aux_payload_if'
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
(cond: bool)
(ift: ((cond_true cond) -> Tot (jump_sum_aux_payload_t t pc k)))
(iff: ((cond_false cond) -> Tot (jump_sum_aux_payload_t t pc k)))
: Tot (jump_sum_aux_payload_t t pc k)
= fun #rrel #rel input pos ->
if cond
then begin
(ift () <: jump_sum_aux_payload_t t pc k) input pos
end else
(iff () <: jump_sum_aux_payload_t t pc k) input pos
inline_for_extraction
let jump_sum_aux_payload_if
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
: Tot (if_combinator _ (jump_sum_aux_payload_eq t pc k))
= jump_sum_aux_payload_if' t pc k
let parse_sum_eq3
(#kt: parser_kind)
(t: sum)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(input: bytes)
(k' : sum_repr_type t)
(consumed_k: consumed_length input)
: Lemma
(requires (Some? (parse (parse_sum t p pc) input) /\ parse p input == Some (k', consumed_k)))
(ensures (
let input_k = Seq.slice input consumed_k (Seq.length input) in
let k = maybe_enum_key_of_repr (sum_enum t) k' in
begin match k with
| Known k ->
Some? (parse (dsnd (pc k)) input_k)
| _ -> False
end
))
= parse_sum_eq'' t p pc input
let parse_sum_eq4
(#kt: parser_kind)
(t: sum)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(input: bytes)
(k' : sum_repr_type t)
(consumed_k: consumed_length input)
(consumed_payload: nat)
: Lemma
(requires (Some? (parse (parse_sum t p pc) input) /\ parse p input == Some (k', consumed_k) /\ (
let input_k = Seq.slice input consumed_k (Seq.length input) in
let k = maybe_enum_key_of_repr (sum_enum t) k' in
begin match k with
| Known k ->
Some? (parse (dsnd (pc k)) input_k) /\ (
let Some (_, consumed_payload') = parse (dsnd (pc k)) input_k in
consumed_payload' == consumed_payload
)
| _ -> False
end
)))
(ensures (
let Some (_, consumed) = parse (parse_sum t p pc) input in
consumed == consumed_k + consumed_payload
))
= parse_sum_eq'' t p pc input
#push-options "--z3rlimit 16"
let valid_sum_elim
(h: HS.mem)
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(#rrel: _) (#rel: _)
(input: slice rrel rel)
(pos: U32.t)
: Lemma
(requires (
valid (parse_sum t p pc) h input pos
))
(ensures (
valid p h input pos /\ (
let pos_payload = get_valid_pos p h input pos in
let k' = maybe_enum_key_of_repr (sum_enum t) (contents p h input pos) in
match k' with
| Known k ->
k == sum_tag_of_data t (contents (parse_sum t p pc) h input pos) /\
valid (dsnd (pc k)) h input pos_payload /\
valid_pos
(parse_sum t p pc) h input pos
(get_valid_pos (dsnd (pc k)) h input pos_payload)
| _ -> False
)))
= let sinput = bytes_of_slice_from h input pos in
let _ = parse_sum_eq'' t p pc sinput in
[@inline_let]
let _ = valid_facts (parse_sum t p pc) h input pos in
let Some (k', consumed_k) = parse p sinput in
let pos_after_tag = U32.uint_to_t (U32.v pos + consumed_k) in
[@inline_let]
let _ = valid_facts p h input pos in
assert (valid_content_pos p h input pos k' pos_after_tag);
match maybe_enum_key_of_repr (sum_enum t) k' with
| Known k -> valid_facts (dsnd (pc k)) h input pos_after_tag
| _ -> ()
#pop-options
let valid_sum_elim_tag
(h: HS.mem)
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: Lemma
(requires (
valid (parse_sum t p pc) h input pos
))
(ensures (
valid (parse_enum_key p (sum_enum t)) h input pos /\
contents (parse_enum_key p (sum_enum t)) h input pos == sum_tag_of_data t (contents (parse_sum t p pc) h input pos)
))
= let _ = parse_sum_eq' t p pc (bytes_of_slice_from h input pos) in
let _ = valid_facts (parse_sum t p pc) h input pos in
let _ = valid_facts (parse_enum_key p (sum_enum t)) h input pos in
()
inline_for_extraction
let read_sum_tag
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(p32: leaf_reader p)
(destr: dep_maybe_enum_destr_t (sum_enum t) (read_enum_key_t (sum_enum t)))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: HST.Stack (sum_key t)
(requires (fun h ->
valid (parse_sum t p pc) h input pos
))
(ensures (fun h res h' ->
B.modifies B.loc_none h h' /\
res == sum_tag_of_data t (contents (parse_sum t p pc) h input pos)
))
= let h = HST.get () in
[@inline_let] let _ = valid_sum_elim_tag h t p pc input pos in
read_enum_key p32 (sum_enum t) destr input pos
inline_for_extraction
let jump_sum_aux
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(v: jumper p)
(p32: leaf_reader p)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(v_payload: ((k: sum_repr_type t)) -> Tot (jump_sum_aux_payload_t t pc (maybe_enum_key_of_repr (sum_enum t) k)))
: Tot (jumper (parse_sum t p pc))
= fun #rrel #rel input pos ->
let h = HST.get () in
[@inline_let]
let _ = valid_sum_elim h t p pc input pos in
let pos_after_tag = v input pos in
let k' = p32 input pos in
v_payload k' input pos_after_tag
inline_for_extraction
let jump_sum_aux_payload'
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (jumper (dsnd (pc x)))))
(k: maybe_enum_key (sum_enum t))
: Tot (jump_sum_aux_payload_t t pc k)
= fun #rrel #rel input pos ->
match k with
| Known k ->
[@inline_let]
let _ = synth_sum_case_injective t k in
pc32 k input pos
| _ -> 0ul // dummy, but we MUST NOT remove this branch, otherwise extraction fails
inline_for_extraction
let jump_sum_aux_payload
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (jumper (dsnd (pc x)))))
(destr: dep_maybe_enum_destr_t (sum_enum t) (jump_sum_aux_payload_t t pc))
(k: sum_repr_type t)
: Tot (jump_sum_aux_payload_t t pc (maybe_enum_key_of_repr (sum_enum t) k))
= destr (jump_sum_aux_payload_eq t pc) (jump_sum_aux_payload_if t pc) (fun _ _ -> ()) (fun _ _ _ _ -> ()) (jump_sum_aux_payload' t pc pc32) k
inline_for_extraction
let jump_sum
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(v: jumper p)
(p32: leaf_reader p)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (jumper (dsnd (pc x)))))
(destr: dep_maybe_enum_destr_t (sum_enum t) (jump_sum_aux_payload_t t pc))
: Tot (jumper (parse_sum t p pc))
= jump_sum_aux t v p32 pc (jump_sum_aux_payload t pc pc32 destr)
inline_for_extraction
let read_sum_cases'
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (leaf_reader (dsnd (pc x)))))
(k: sum_key t)
: Tot (leaf_reader (parse_sum_cases' t pc k))
= [@inline_let]
let _ = synth_sum_case_injective t k in
read_synth'
(dsnd (pc k))
(synth_sum_case t k)
(pc32 k)
()
inline_for_extraction
let read_sum_cases_t
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot Type
= leaf_reader (parse_sum_cases' t pc k)
let read_sum_cases_t_eq
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
(x y : read_sum_cases_t t pc k)
: GTot Type0
= True
inline_for_extraction
let read_sum_cases_t_if
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (if_combinator _ (read_sum_cases_t_eq t pc k))
= fun cond (sv_true: cond_true cond -> Tot (read_sum_cases_t t pc k)) (sv_false: cond_false cond -> Tot (read_sum_cases_t t pc k)) #_ #_ input pos ->
if cond
then (sv_true () input pos)
else (sv_false () input pos)
inline_for_extraction
let read_sum_cases
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (leaf_reader (dsnd (pc x)))))
(destr: dep_enum_destr (sum_enum t) (read_sum_cases_t t pc))
(k: sum_key t)
: Tot (leaf_reader (parse_sum_cases' t pc k))
= destr
_
(read_sum_cases_t_if t pc)
(fun _ _ -> ())
(fun _ _ _ _ -> ())
(read_sum_cases' t pc pc32)
k
#push-options "--z3rlimit 32"
inline_for_extraction
let read_sum
(#kt: parser_kind)
(t: sum)
(p: parser kt (sum_repr_type t))
(p32: leaf_reader (parse_enum_key p (sum_enum t)))
(j: jumper p)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (leaf_reader (dsnd (pc x)))))
(destr: dep_enum_destr (sum_enum t) (read_sum_cases_t t pc))
: Tot (leaf_reader (parse_sum t p pc))
=
fun #_ #_ input pos ->
let h = HST.get () in
valid_facts (parse_sum t p pc) h input pos;
parse_sum_eq' t p pc (bytes_of_slice_from h input pos);
valid_facts (parse_enum_key p (sum_enum t)) h input pos;
let k = p32 input pos in
let pos' = jump_enum_key j (sum_enum t) input pos in
valid_facts (parse_sum_cases' t pc k) h input pos' ;
read_sum_cases t pc pc32 destr k input pos'
#pop-options
inline_for_extraction
let serialize32_sum_cases_t
(t: sum)
(#pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(sc: ((x: sum_key t) -> Tot (serializer (dsnd (pc x)))))
(k: sum_key t)
: Tot Type
= serializer32 (serialize_sum_cases t pc sc k)
let serialize32_sum_cases_t_eq
(t: sum)
(#pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(sc: ((x: sum_key t) -> Tot (serializer (dsnd (pc x)))))
(k: sum_key t)
(x y: serialize32_sum_cases_t t sc k)
: GTot Type0
= True
inline_for_extraction
let serialize32_sum_cases_t_if
(t: sum)
(#pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(sc: ((x: sum_key t) -> Tot (serializer (dsnd (pc x)))))
(k: sum_key t)
: Tot (if_combinator _ (serialize32_sum_cases_t_eq t sc k))
= fun cond (sv_true: (cond_true cond -> Tot (serialize32_sum_cases_t t sc k))) (sv_false: (cond_false cond -> Tot (serialize32_sum_cases_t t sc k))) x #rrel #rel b pos ->
if cond
then (sv_true () x b pos)
else (sv_false () x b pos)
inline_for_extraction
let serialize32_sum_cases_aux
(t: sum)
(#pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(sc: ((x: sum_key t) -> Tot (serializer (dsnd (pc x)))))
(sc32: ((x: sum_key t) -> Tot (serializer32 (sc x))))
(k: sum_key t)
: Tot (serializer32 (serialize_sum_cases t pc sc k))
= fun x #rrel #rel b pos ->
[@inline_let] let _ =
Classical.forall_intro (parse_sum_cases_eq' t pc k);
synth_sum_case_injective t k;
synth_sum_case_inverse t k
in
serialize32_synth
(sc32 k)
(synth_sum_case t k)
(synth_sum_case_recip t k)
(fun x -> synth_sum_case_recip t k x)
()
x
b
pos
inline_for_extraction
let serialize32_sum_cases
(t: sum)
(#pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(sc: ((x: sum_key t) -> Tot (serializer (dsnd (pc x)))))
(sc32: ((x: sum_key t) -> Tot (serializer32 (sc x))))
(destr: dep_enum_destr (sum_enum t) (serialize32_sum_cases_t t sc))
(k: sum_key t)
: Tot (serializer32 (serialize_sum_cases t pc sc k))
= destr
_
(serialize32_sum_cases_t_if t sc)
(fun _ _ -> ())
(fun _ _ _ _ -> ())
(serialize32_sum_cases_aux t sc sc32)
k
inline_for_extraction
let serialize32_sum
(#kt: parser_kind)
(t: sum)
(#p: parser kt (sum_repr_type t))
(s: serializer p {kt.parser_kind_subkind == Some ParserStrong})
(s32: serializer32 (serialize_enum_key _ s (sum_enum t)))
(#pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(sc: ((x: sum_key t) -> Tot (serializer (dsnd (pc x)))))
(sc32: ((x: sum_key t) -> Tot (serializer32 (sc x))))
(destr: dep_enum_destr (sum_enum t) (serialize32_sum_cases_t t sc))
: Tot (serializer32 (serialize_sum t s sc))
= fun x #rrel #rel b pos ->
serialize_sum_eq t s sc x;
let tg = sum_tag_of_data t x in
serialize32_nondep_then_aux s32 (serialize32_sum_cases t sc sc32 destr tg) tg x b pos
let clens_sum_tag
(s: sum)
: Tot (clens (sum_type s) (sum_key s))
= {
clens_cond = (fun _ -> True);
clens_get = sum_tag_of_data s;
}
let gaccessor_sum_tag
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
: Tot (gaccessor (parse_sum t p pc) (parse_enum_key p (sum_enum t)) (clens_sum_tag t))
= gaccessor_tagged_union_tag
(parse_enum_key p (sum_enum t))
(sum_tag_of_data t)
(parse_sum_cases t pc)
inline_for_extraction
let accessor_sum_tag
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
: Tot (accessor (gaccessor_sum_tag t p pc))
= accessor_tagged_union_tag
(parse_enum_key p (sum_enum t))
(sum_tag_of_data t)
(parse_sum_cases t pc)
let clens_sum_payload
(s: sum)
(k: sum_key s)
: Tot (clens (sum_type s) (sum_type_of_tag s k))
= {
clens_cond = (fun (x: sum_type s) -> sum_tag_of_data s x == k);
clens_get = (fun (x: sum_type s) -> synth_sum_case_recip s k x <: Ghost (sum_type_of_tag s k) (requires (sum_tag_of_data s x == k)) (ensures (fun _ -> True)));
}
#push-options "--z3rlimit 32"
let gaccessor_clens_sum_payload'
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (gaccessor' (parse_sum t p pc) (dsnd (pc k)) (clens_sum_payload t k))
= fun (input: bytes) ->
parse_sum_eq'' t p pc input;
let res =
match parse p input with
| Some (_, consumed) ->
synth_sum_case_inverse t k;
synth_sum_case_injective t k;
synth_injective_synth_inverse_synth_inverse_recip (synth_sum_case t k) (synth_sum_case_recip t k) ();
(consumed)
| _ -> 0 // dummy
in
(res <: (res: _ { gaccessor_post' (parse_sum t p pc) (dsnd (pc k)) (clens_sum_payload t k) input res } ))
#push-options "--z3rlimit 64"
let gaccessor_clens_sum_payload_injective
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
(sl sl' : bytes)
: Lemma
(requires (
gaccessor_pre (parse_sum t p pc) (dsnd (pc k)) (clens_sum_payload t k) sl /\
gaccessor_pre (parse_sum t p pc) (dsnd (pc k)) (clens_sum_payload t k) sl' /\
injective_precond (parse_sum t p pc) sl sl'
))
(ensures (gaccessor_clens_sum_payload' t p pc k sl == gaccessor_clens_sum_payload' t p pc k sl'))
= parse_sum_eq'' t p pc sl;
parse_sum_eq'' t p pc sl' ;
parse_injective (parse_sum t p pc) sl sl' ;
parse_injective p sl sl'
#pop-options
let gaccessor_clens_sum_payload_no_lookahead
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
(sl sl' : bytes)
: Lemma
(requires (
(parse_sum_kind kt t pc).parser_kind_subkind == Some ParserStrong /\
gaccessor_pre (parse_sum t p pc) (dsnd (pc k)) (clens_sum_payload t k) sl /\
gaccessor_pre (parse_sum t p pc) (dsnd (pc k)) (clens_sum_payload t k) sl' /\
no_lookahead_on_precond (parse_sum t p pc) sl sl'
))
(ensures (gaccessor_clens_sum_payload' t p pc k sl == gaccessor_clens_sum_payload' t p pc k sl'))
= parse_sum_eq'' t p pc sl;
parse_sum_eq'' t p pc sl' ;
parse_strong_prefix (parse_sum t p pc) sl sl' ;
parse_injective p sl sl'
let gaccessor_clens_sum_payload
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (gaccessor (parse_sum t p pc) (dsnd (pc k)) (clens_sum_payload t k))
= Classical.forall_intro_2 (fun x -> Classical.move_requires (gaccessor_clens_sum_payload_injective t p pc k x));
Classical.forall_intro_2 (fun x -> Classical.move_requires (gaccessor_clens_sum_payload_no_lookahead t p pc k x));
gaccessor_prop_equiv (parse_sum t p pc) (dsnd (pc k)) (clens_sum_payload t k) (gaccessor_clens_sum_payload' t p pc k);
gaccessor_clens_sum_payload' t p pc k
inline_for_extraction
let accessor_clens_sum_payload'
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(j: jumper p)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: HST.Stack U32.t
(requires (fun h ->
valid (parse_sum t p pc) h input pos /\
(clens_sum_payload t k).clens_cond (contents (parse_sum t p pc) h input pos)
))
(ensures (fun h pos' h' ->
B.modifies B.loc_none h h' /\
pos' == slice_access h (gaccessor_clens_sum_payload t p pc k) input pos
))
=
let h = HST.get () in
[@inline_let]
let _ =
let pos' = get_valid_pos (parse_sum t p pc) h input pos in
let large = bytes_of_slice_from h input pos in
slice_access_eq h (gaccessor_clens_sum_payload t p pc k) input pos;
valid_facts (parse_sum t p pc) h input pos;
parse_sum_eq'' t p pc large;
valid_facts p h input pos
in
j input pos
#pop-options
inline_for_extraction
let accessor_clens_sum_payload
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(j: jumper p)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (accessor (gaccessor_clens_sum_payload t p pc k))
= fun #rrel #rel -> accessor_clens_sum_payload' t j pc k #rrel #rel
let clens_sum_cases_payload
(s: sum)
(k: sum_key s)
: Tot (clens (sum_cases s k) (sum_type_of_tag s k))
= {
clens_cond = (fun (x: sum_cases s k) -> True);
clens_get = (fun (x: sum_cases s k) -> synth_sum_case_recip s k x <: Ghost (sum_type_of_tag s k) (requires (True)) (ensures (fun _ -> True)));
}
let gaccessor_clens_sum_cases_payload
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (gaccessor (parse_sum_cases' t pc k) (dsnd (pc k)) (clens_sum_cases_payload t k))
= synth_sum_case_injective t k;
synth_sum_case_inverse t k;
synth_injective_synth_inverse_synth_inverse_recip (synth_sum_case t k) (synth_sum_case_recip t k) ();
gaccessor_ext
(gaccessor_synth (dsnd (pc k)) (synth_sum_case t k) (synth_sum_case_recip t k) ())
(clens_sum_cases_payload t k)
()
inline_for_extraction
let accessor_clens_sum_cases_payload
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (accessor (gaccessor_clens_sum_cases_payload t pc k))
= [@inline_let]
let _ =
synth_sum_case_injective t k;
synth_sum_case_inverse t k;
synth_injective_synth_inverse_synth_inverse_recip (synth_sum_case t k) (synth_sum_case_recip t k) ()
in
accessor_ext
(accessor_synth (dsnd (pc k)) (synth_sum_case t k) (synth_sum_case_recip t k) ())
(clens_sum_cases_payload t k)
()
inline_for_extraction
let validate_dsum_cases_t
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(#k: parser_kind)
(g: parser k (dsum_type_of_unknown_tag s))
(x: dsum_key s)
: Tot Type
= validator (parse_dsum_cases' s f g x)
let validate_dsum_cases_eq
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(#k: parser_kind)
(g: parser k (dsum_type_of_unknown_tag s))
(x: dsum_key s)
(v1 v2 : validate_dsum_cases_t s f g x)
: GTot Type0
= True
inline_for_extraction
let validate_dsum_cases_if'
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(#k: parser_kind)
(g: parser k (dsum_type_of_unknown_tag s))
(x: dsum_key s)
(cond: bool)
(ift: (cond_true cond -> Tot (validate_dsum_cases_t s f g x)))
(iff: (cond_false cond -> Tot (validate_dsum_cases_t s f g x)))
: Tot (validate_dsum_cases_t s f g x)
= fun #rrel #rel input len ->
if cond
then (ift () <: validate_dsum_cases_t s f g x) input len
else (iff () <: validate_dsum_cases_t s f g x) input len
inline_for_extraction
let validate_dsum_cases_if
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(#k: parser_kind)
(g: parser k (dsum_type_of_unknown_tag s))
(x: dsum_key s)
: Tot (if_combinator _ (validate_dsum_cases_eq s f g x))
= validate_dsum_cases_if' s f g x
inline_for_extraction
let validate_dsum_cases'
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(f' : (x: dsum_known_key s) -> Tot (validator (dsnd (f x))))
(#k: parser_kind)
(#g: parser k (dsum_type_of_unknown_tag s))
(g' : validator g)
(x: dsum_key s)
: Tot (validate_dsum_cases_t s f g x)
= [@inline_let]
let _ = synth_dsum_case_injective s x in
match x with
| Known x' -> validate_synth (f' x') (synth_dsum_case s (Known x')) () <: validator (parse_dsum_cases' s f g x)
| Unknown x' -> validate_synth g' (synth_dsum_case s (Unknown x')) () <: validator (parse_dsum_cases' s f g x)
inline_for_extraction
let validate_dsum_cases'_destr
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(f' : (x: dsum_known_key s) -> Tot (validator (dsnd (f x))))
(#k: parser_kind)
(#g: parser k (dsum_type_of_unknown_tag s))
(g' : validator g)
(destr: dep_enum_destr _ (fun k -> validate_dsum_cases_t s f g (Known k)))
(x: dsum_key s)
: Tot (validate_dsum_cases_t s f g x)
= fun #rrel #rel input pos ->
match x with
| Known k ->
destr
_
(fun k -> validate_dsum_cases_if s f g (Known k))
(fun _ _ -> ())
(fun _ _ _ _ -> ())
(fun k -> validate_dsum_cases' s f f' g' (Known k))
k
input
pos
| Unknown r -> validate_dsum_cases' s f f' g' (Unknown r) input pos
inline_for_extraction
let validate_dsum_cases
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(f' : (x: dsum_known_key s) -> Tot (validator (dsnd (f x))))
(#k: parser_kind)
(#g: parser k (dsum_type_of_unknown_tag s))
(g' : validator g)
(destr: dep_enum_destr _ (fun k -> validate_dsum_cases_t s f g (Known k)))
(x: dsum_key s)
: Tot (validator (parse_dsum_cases s f g x))
= fun #rrel #rel input pos ->
let h = HST.get () in
[@inline_let]
let _ =
valid_facts (parse_dsum_cases' s f g x) h input (uint64_to_uint32 pos);
valid_facts (parse_dsum_cases s f g x) h input (uint64_to_uint32 pos);
parse_dsum_cases_eq' s f g x (bytes_of_slice_from h input (uint64_to_uint32 pos))
in
validate_dsum_cases'_destr s f f' g' destr x input pos
#push-options "--z3rlimit 40"
inline_for_extraction
let validate_dsum
(#kt: parser_kind)
(t: dsum)
(#p: parser kt (dsum_repr_type t))
(v: validator p)
(p32: leaf_reader p)
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(f32: (x: dsum_known_key t) -> Tot (validator (dsnd (f x))))
(#k': parser_kind)
(#g: parser k' (dsum_type_of_unknown_tag t))
(g32: validator g)
(destr: dep_maybe_enum_destr_t (dsum_enum t) (validate_dsum_cases_t t f g))
: Tot (validator (parse_dsum t p f g))
= fun #rrel #rel input pos ->
let h = HST.get () in
[@inline_let]
let _ = parse_dsum_eq' t p f g (bytes_of_slice_from h input (uint64_to_uint32 pos)) in
[@inline_let]
let _ = valid_facts (parse_dsum t p f g) h input (uint64_to_uint32 pos) in
[@inline_let]
let _ = valid_facts p h input (uint64_to_uint32 pos) in
let pos_after_tag = v input pos in
if is_error pos_after_tag
then pos_after_tag
else
let tg = p32 input (uint64_to_uint32 pos) in
[@inline_let]
let _ = valid_facts (parse_dsum_cases' t f g (maybe_enum_key_of_repr (dsum_enum t) tg)) h input (uint64_to_uint32 pos_after_tag) in
destr (validate_dsum_cases_eq t f g) (validate_dsum_cases_if t f g) (fun _ _ -> ()) (fun _ _ _ _ -> ()) (validate_dsum_cases' t f f32 g32) tg input pos_after_tag
#pop-options
#reset-options "--z3rlimit 64 --z3cliopt smt.arith.nl=false --initial_ifuel 8 --max_ifuel 8 --initial_fuel 2 --max_fuel 2"
let valid_dsum_intro_known
(h: HS.mem)
(t: dsum)
(#kt: parser_kind)
(p: parser kt (dsum_repr_type t))
(f: ((x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x))))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: Lemma
(requires (
valid (parse_maybe_enum_key p (dsum_enum t)) h input pos /\ (
let k' = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
Known? k' /\ (
let Known k = k' in
valid (dsnd (f k)) h input (get_valid_pos (parse_maybe_enum_key p (dsum_enum t)) h input pos)
))))
(ensures (
let Known k = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
let pos_payload = get_valid_pos (parse_maybe_enum_key p (dsum_enum t)) h input pos in
valid_content_pos
(parse_dsum t p f g) h input pos
(synth_dsum_case t (Known k) (contents (dsnd (f k)) h input pos_payload))
(get_valid_pos (dsnd (f k)) h input pos_payload)
))
= valid_facts (parse_maybe_enum_key p (dsum_enum t)) h input pos;
let Known k = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
let pos_payload = get_valid_pos (parse_maybe_enum_key p (dsum_enum t)) h input pos in
valid_facts (dsnd (f k)) h input pos_payload;
valid_facts (parse_dsum t p f g) h input pos;
parse_dsum_eq t p f g (bytes_of_slice_from h input pos)
let valid_dsum_intro_unknown
(h: HS.mem)
(t: dsum)
(#kt: parser_kind)
(p: parser kt (dsum_repr_type t))
(f: ((x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x))))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: Lemma
(requires (
valid (parse_maybe_enum_key p (dsum_enum t)) h input pos /\ (
let k' = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
Unknown? k' /\
valid g h input (get_valid_pos (parse_maybe_enum_key p (dsum_enum t)) h input pos)
)))
(ensures (
let Unknown r = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
let pos_payload = get_valid_pos (parse_maybe_enum_key p (dsum_enum t)) h input pos in
valid_content_pos
(parse_dsum t p f g) h input pos
(synth_dsum_case t (Unknown r) (contents g h input pos_payload))
(get_valid_pos g h input pos_payload)
))
= valid_facts (parse_maybe_enum_key p (dsum_enum t)) h input pos;
let Unknown r = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
let pos_payload = get_valid_pos (parse_maybe_enum_key p (dsum_enum t)) h input pos in
valid_facts g h input pos_payload;
valid_facts (parse_dsum t p f g) h input pos;
parse_dsum_eq t p f g (bytes_of_slice_from h input pos)
#reset-options
inline_for_extraction
let finalize_dsum_case_known
(t: dsum)
(#kt: parser_kind)
(#p: parser kt (dsum_repr_type t))
(s: serializer p)
(w: leaf_writer_strong s)
(f: ((x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x))))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
(destr: enum_repr_of_key'_t (dsum_enum t))
(k: dsum_known_key t)
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: HST.Stack unit
(requires (fun h ->
let len_tag = serialized_length (serialize_enum_key _ s (dsum_enum t)) k in
U32.v pos + len_tag < 4294967296 /\ (
let pos_payload = pos `U32.add` U32.uint_to_t len_tag in
valid (dsnd (f k)) h input pos_payload /\
writable input.base (U32.v pos) (U32.v pos_payload) h
)))
(ensures (fun h _ h' ->
let len_tag = serialized_length (serialize_enum_key _ s (dsum_enum t)) k in
let pos_payload = pos `U32.add` U32.uint_to_t len_tag in
B.modifies (loc_slice_from_to input pos pos_payload) h h' /\
valid_content_pos (parse_dsum t p f g) h' input pos (synth_dsum_case t (Known k) (contents (dsnd (f k)) h input pos_payload)) (get_valid_pos (dsnd (f k)) h input pos_payload)
))
= let pos1 = write_enum_key w (dsum_enum t) destr k input pos in
let h = HST.get () in
[@inline_let]
let _ =
valid_facts (parse_enum_key p (dsum_enum t)) h input pos;
valid_facts (parse_maybe_enum_key p (dsum_enum t)) h input pos;
let sq = bytes_of_slice_from h input pos in
parse_enum_key_eq p (dsum_enum t) sq;
parse_maybe_enum_key_eq p (dsum_enum t) sq;
valid_dsum_intro_known h t p f g input pos
in
()
inline_for_extraction
let finalize_dsum_case_unknown
(t: dsum)
(#kt: parser_kind)
(#p: parser kt (dsum_repr_type t))
(s: serializer p)
(w: leaf_writer_strong s)
(f: ((x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x))))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
(r: unknown_enum_repr (dsum_enum t))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: HST.Stack unit
(requires (fun h ->
let len_tag = serialized_length s r in
U32.v pos + len_tag < 4294967296 /\ (
let pos_payload = pos `U32.add` U32.uint_to_t len_tag in
valid g h input pos_payload /\
writable input.base (U32.v pos) (U32.v pos_payload) h
)))
(ensures (fun h _ h' ->
let len_tag = serialized_length s r in
let pos_payload = pos `U32.add` U32.uint_to_t len_tag in
B.modifies (loc_slice_from_to input pos pos_payload) h h' /\
valid_content_pos (parse_dsum t p f g) h' input pos (synth_dsum_case t (Unknown r) (contents g h input pos_payload)) (get_valid_pos g h input pos_payload)
))
= let pos1 = w r input pos in
let h = HST.get () in
[@inline_let]
let _ =
valid_facts (parse_maybe_enum_key p (dsum_enum t)) h input pos;
valid_facts p h input pos;
let sq = bytes_of_slice_from h input pos in
parse_maybe_enum_key_eq p (dsum_enum t) sq;
valid_dsum_intro_unknown h t p f g input pos
in
()
let valid_dsum_elim_tag
(h: HS.mem)
(t: dsum)
(#kt: parser_kind)
(p: parser kt (dsum_repr_type t))
(f: ((x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x))))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: Lemma
(requires (
valid (parse_dsum t p f g) h input pos
))
(ensures (
valid (parse_maybe_enum_key p (dsum_enum t)) h input pos /\
contents (parse_maybe_enum_key p (dsum_enum t)) h input pos == dsum_tag_of_data t (contents (parse_dsum t p f g) h input pos)
))
= let _ = parse_dsum_eq_ t p f g (bytes_of_slice_from h input pos) in
let _ = valid_facts (parse_dsum t p f g) h input pos in
let _ = valid_facts (parse_maybe_enum_key p (dsum_enum t)) h input pos in
() | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"LowStar.Buffer.fst.checked",
"LowParse.Spec.Sum.fst.checked",
"LowParse.Low.Enum.fst.checked",
"FStar.UInt64.fsti.checked",
"FStar.UInt32.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Int.Cast.fst.checked",
"FStar.HyperStack.ST.fsti.checked",
"FStar.HyperStack.fst.checked",
"FStar.Classical.fsti.checked"
],
"interface_file": false,
"source_file": "LowParse.Low.Sum.fst"
} | [
{
"abbrev": true,
"full_module": "FStar.HyperStack",
"short_module": "HS"
},
{
"abbrev": true,
"full_module": "FStar.UInt64",
"short_module": "U64"
},
{
"abbrev": true,
"full_module": "FStar.Int.Cast",
"short_module": "Cast"
},
{
"abbrev": true,
"full_module": "LowStar.Buffer",
"short_module": "B"
},
{
"abbrev": true,
"full_module": "FStar.HyperStack.ST",
"short_module": "HST"
},
{
"abbrev": true,
"full_module": "FStar.UInt32",
"short_module": "U32"
},
{
"abbrev": false,
"full_module": "LowParse.Spec.Sum",
"short_module": null
},
{
"abbrev": false,
"full_module": "LowParse.Low.Enum",
"short_module": null
},
{
"abbrev": false,
"full_module": "LowParse.Low",
"short_module": null
},
{
"abbrev": false,
"full_module": "LowParse.Low",
"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",
"short_module": null
}
] | {
"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_elim_box": false,
"smtencoding_l_arith_repr": "boxwrap",
"smtencoding_nl_arith_repr": "boxwrap",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": true,
"z3cliopt": [],
"z3refresh": false,
"z3rlimit": 5,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | false |
t: LowParse.Spec.Sum.dsum ->
p32: LowParse.Low.Base.leaf_reader p ->
destr:
LowParse.Spec.Enum.maybe_enum_destr_t (LowParse.Spec.Enum.maybe_enum_key (LowParse.Spec.Sum.dsum_enum
t))
(LowParse.Spec.Sum.dsum_enum t) ->
f:
(x: LowParse.Spec.Sum.dsum_known_key t
-> Prims.dtuple2 LowParse.Spec.Base.parser_kind
(fun k -> LowParse.Spec.Base.parser k (LowParse.Spec.Sum.dsum_type_of_known_tag t x))) ->
g: LowParse.Spec.Base.parser ku (LowParse.Spec.Sum.dsum_type_of_unknown_tag t) ->
input: LowParse.Slice.slice rrel rel ->
pos: FStar.UInt32.t
-> FStar.HyperStack.ST.Stack (LowParse.Spec.Sum.dsum_key t) | FStar.HyperStack.ST.Stack | [] | [] | [
"LowParse.Spec.Sum.dsum",
"LowParse.Spec.Base.parser_kind",
"LowParse.Spec.Base.parser",
"LowParse.Spec.Sum.dsum_repr_type",
"LowParse.Low.Base.leaf_reader",
"LowParse.Spec.Enum.maybe_enum_destr_t",
"LowParse.Spec.Enum.maybe_enum_key",
"LowParse.Spec.Sum.dsum_key_type",
"LowParse.Spec.Sum.dsum_enum",
"LowParse.Spec.Sum.dsum_known_key",
"Prims.dtuple2",
"LowParse.Spec.Sum.dsum_type_of_known_tag",
"LowParse.Spec.Sum.dsum_type_of_unknown_tag",
"LowParse.Slice.srel",
"LowParse.Bytes.byte",
"LowParse.Slice.slice",
"FStar.UInt32.t",
"LowParse.Low.Enum.read_maybe_enum_key",
"Prims.unit",
"LowParse.Low.Sum.valid_dsum_elim_tag",
"LowParse.Spec.Sum.dsum_key",
"FStar.Monotonic.HyperStack.mem",
"FStar.HyperStack.ST.get",
"LowParse.Low.Base.Spec.valid",
"LowParse.Spec.Sum.parse_dsum_kind",
"LowParse.Spec.Sum.dsum_type",
"LowParse.Spec.Sum.parse_dsum",
"Prims.l_and",
"LowStar.Monotonic.Buffer.modifies",
"LowStar.Monotonic.Buffer.loc_none",
"Prims.eq2",
"LowParse.Spec.Sum.dsum_tag_of_data",
"LowParse.Low.Base.Spec.contents"
] | [] | false | true | false | false | false | let read_dsum_tag
(t: dsum)
(#kt: parser_kind)
(#p: parser kt (dsum_repr_type t))
(p32: leaf_reader p)
(destr: maybe_enum_destr_t (maybe_enum_key (dsum_enum t)) (dsum_enum t))
(f: (x: dsum_known_key t -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x))))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: HST.Stack (dsum_key t)
(requires (fun h -> valid (parse_dsum t p f g) h input pos))
(ensures
(fun h res h' ->
B.modifies B.loc_none h h' /\
res == dsum_tag_of_data t (contents (parse_dsum t p f g) h input pos))) =
| let h = HST.get () in
[@@ inline_let ]let _ = valid_dsum_elim_tag h t p f g input pos in
read_maybe_enum_key p32 (dsum_enum t) destr input pos | false |
LowParse.Low.Sum.fst | LowParse.Low.Sum.validate_dsum_cases'_destr | val validate_dsum_cases'_destr
(s: dsum)
(f: (x: dsum_known_key s -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x))))
(f': (x: dsum_known_key s -> Tot (validator (dsnd (f x)))))
(#k: parser_kind)
(#g: parser k (dsum_type_of_unknown_tag s))
(g': validator g)
(destr: dep_enum_destr _ (fun k -> validate_dsum_cases_t s f g (Known k)))
(x: dsum_key s)
: Tot (validate_dsum_cases_t s f g x) | val validate_dsum_cases'_destr
(s: dsum)
(f: (x: dsum_known_key s -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x))))
(f': (x: dsum_known_key s -> Tot (validator (dsnd (f x)))))
(#k: parser_kind)
(#g: parser k (dsum_type_of_unknown_tag s))
(g': validator g)
(destr: dep_enum_destr _ (fun k -> validate_dsum_cases_t s f g (Known k)))
(x: dsum_key s)
: Tot (validate_dsum_cases_t s f g x) | let validate_dsum_cases'_destr
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(f' : (x: dsum_known_key s) -> Tot (validator (dsnd (f x))))
(#k: parser_kind)
(#g: parser k (dsum_type_of_unknown_tag s))
(g' : validator g)
(destr: dep_enum_destr _ (fun k -> validate_dsum_cases_t s f g (Known k)))
(x: dsum_key s)
: Tot (validate_dsum_cases_t s f g x)
= fun #rrel #rel input pos ->
match x with
| Known k ->
destr
_
(fun k -> validate_dsum_cases_if s f g (Known k))
(fun _ _ -> ())
(fun _ _ _ _ -> ())
(fun k -> validate_dsum_cases' s f f' g' (Known k))
k
input
pos
| Unknown r -> validate_dsum_cases' s f f' g' (Unknown r) input pos | {
"file_name": "src/lowparse/LowParse.Low.Sum.fst",
"git_rev": "00217c4a89f5ba56002ba9aa5b4a9d5903bfe9fa",
"git_url": "https://github.com/project-everest/everparse.git",
"project_name": "everparse"
} | {
"end_col": 69,
"end_line": 1041,
"start_col": 0,
"start_line": 1019
} | module LowParse.Low.Sum
include LowParse.Low.Enum
include LowParse.Spec.Sum
module U32 = FStar.UInt32
module HST = FStar.HyperStack.ST
module B = LowStar.Buffer
module Cast = FStar.Int.Cast
module U64 = FStar.UInt64
inline_for_extraction
let validate_sum_cases_aux
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(vc: ((x: sum_key t) -> Tot (validator (dsnd (pc x)))))
(k: sum_key t)
: Tot (validator (parse_sum_cases t pc k))
= [@inline_let]
let _ = synth_sum_case_injective t k in
validate_synth
(validate_weaken
(weaken_parse_cases_kind t pc)
(vc k)
()
)
(synth_sum_case t k)
()
inline_for_extraction
let validate_sum_cases_t
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot Type
= validator (parse_sum_cases t pc k)
let validate_sum_cases_t_eq
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
(x y : validate_sum_cases_t t pc k)
: GTot Type0
= True
inline_for_extraction
let validate_sum_cases_t_if
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (if_combinator _ (validate_sum_cases_t_eq t pc k))
= fun cond (sv_true: cond_true cond -> Tot (validate_sum_cases_t t pc k)) (sv_false: cond_false cond -> Tot (validate_sum_cases_t t pc k)) #rrel #rel input pos ->
if cond
then sv_true () input pos
else sv_false () input pos
inline_for_extraction
let validate_sum_cases
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(vc: ((x: sum_key t) -> Tot (validator (dsnd (pc x)))))
(destr: dep_enum_destr (sum_enum t) (validate_sum_cases_t t pc))
(k: sum_key t)
: Tot (validator (parse_sum_cases t pc k))
= destr
_
(validate_sum_cases_t_if t pc)
(fun _ _ -> ())
(fun _ _ _ _ -> ())
(validate_sum_cases_aux t pc vc)
k
inline_for_extraction
let validate_sum_aux_payload_t
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
: Tot Type
= (#rrel: _) -> (#rel: _) ->
(input: slice rrel rel) ->
(pos: U64.t) ->
HST.Stack U64.t
(requires (fun h -> live_slice h input /\ U64.v pos <= U32.v input.len))
(ensures (fun h res h' ->
B.modifies B.loc_none h h' /\ (
match k with
| Unknown _ -> is_error res
| Known k' ->
if is_success res
then
valid_pos (dsnd (pc k')) h input (uint64_to_uint32 pos) (uint64_to_uint32 res)
else
(~ (valid (dsnd (pc k')) h input (uint64_to_uint32 pos)))
)))
let validate_sum_aux_payload_eq
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
: Tot (validate_sum_aux_payload_t t pc k -> validate_sum_aux_payload_t t pc k -> GTot Type0)
= fun _ _ -> True
inline_for_extraction
let validate_sum_aux_payload_if'
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
(cond: bool)
(ift: ((cond_true cond) -> Tot (validate_sum_aux_payload_t t pc k)))
(iff: ((cond_false cond) -> Tot (validate_sum_aux_payload_t t pc k)))
: Tot (validate_sum_aux_payload_t t pc k)
= fun #rrel #rel input pos ->
if cond
then begin
(ift () <: validate_sum_aux_payload_t t pc k) input pos
end else
(iff () <: validate_sum_aux_payload_t t pc k) input pos
inline_for_extraction
let validate_sum_aux_payload_if
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
: Tot (if_combinator _ (validate_sum_aux_payload_eq t pc k))
= validate_sum_aux_payload_if' t pc k
#push-options "--z3rlimit 64 --z3cliopt smt.arith.nl=false --using_facts_from '* -FStar.Int.Cast -LowParse.BitFields'"
// --query_stats --smtencoding.elim_box true --smtencoding.l_arith_repr native --z3refresh"
inline_for_extraction
let validate_sum_aux
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(v: validator p)
(p32: leaf_reader p)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(v_payload: ((k: sum_repr_type t)) -> Tot (validate_sum_aux_payload_t t pc (maybe_enum_key_of_repr (sum_enum t) k)))
: Tot (validator (parse_sum t p pc))
= fun #rrel #rel input pos ->
let h = HST.get () in
[@inline_let]
let _ = parse_sum_eq'' t p pc (bytes_of_slice_from h input (uint64_to_uint32 pos)) in
[@inline_let]
let _ = valid_facts (parse_sum t p pc) h input (uint64_to_uint32 pos) in
[@inline_let]
let _ = valid_facts p h input (uint64_to_uint32 pos) in
let len_after_tag = v input pos in
if is_error len_after_tag
then len_after_tag
else begin
let h1 = HST.get () in
let k' = p32 input (uint64_to_uint32 pos) in
[@inline_let]
let _ =
match maybe_enum_key_of_repr (sum_enum t) k' with
| Known k -> valid_facts (dsnd (pc k)) h input (uint64_to_uint32 len_after_tag)
| _ -> ()
in
v_payload k' input len_after_tag
end
#pop-options
inline_for_extraction
let validate_sum_aux_payload'
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (validator (dsnd (pc x)))))
(k: maybe_enum_key (sum_enum t))
: Tot (validate_sum_aux_payload_t t pc k)
= fun #rrel #rel input pos ->
match k with
| Known k ->
[@inline_let]
let _ = synth_sum_case_injective t k in
pc32 k input pos
// validate_synth (pc32 k) (synth_sum_case t k) () input pos
| _ -> validator_error_generic
inline_for_extraction
let validate_sum_aux_payload
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (validator (dsnd (pc x)))))
(destr: dep_maybe_enum_destr_t (sum_enum t) (validate_sum_aux_payload_t t pc))
(k: sum_repr_type t)
: Tot (validate_sum_aux_payload_t t pc (maybe_enum_key_of_repr (sum_enum t) k))
= destr (validate_sum_aux_payload_eq t pc) (validate_sum_aux_payload_if t pc) (fun _ _ -> ()) (fun _ _ _ _ -> ()) (validate_sum_aux_payload' t pc pc32) k
inline_for_extraction
let validate_sum
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(v: validator p)
(p32: leaf_reader p)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (validator (dsnd (pc x)))))
(destr: dep_maybe_enum_destr_t (sum_enum t) (validate_sum_aux_payload_t t pc))
: Tot (validator (parse_sum t p pc))
= validate_sum_aux t v p32 pc (validate_sum_aux_payload t pc pc32 destr)
module HS = FStar.HyperStack
#push-options "--z3rlimit 256 --z3cliopt smt.arith.nl=false --initial_ifuel 8 --max_ifuel 8 --initial_fuel 2 --max_fuel 2"
#restart-solver
let valid_sum_intro
(h: HS.mem)
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: Lemma
(requires (
valid (parse_enum_key p (sum_enum t)) h input pos /\ (
let k = contents (parse_enum_key p (sum_enum t)) h input pos in
valid (dsnd (pc k)) h input (get_valid_pos (parse_enum_key p (sum_enum t)) h input pos)
)))
(ensures (
let k = contents (parse_enum_key p (sum_enum t)) h input pos in
let pos_payload = get_valid_pos (parse_enum_key p (sum_enum t)) h input pos in
valid_content_pos
(parse_sum t p pc) h input pos
(synth_sum_case t k (contents (dsnd (pc k)) h input pos_payload))
(get_valid_pos (dsnd (pc k)) h input pos_payload)
))
= valid_facts (parse_enum_key p (sum_enum t)) h input pos;
let k = contents (parse_enum_key p (sum_enum t)) h input pos in
let pos_payload = get_valid_pos (parse_enum_key p (sum_enum t)) h input pos in
valid_facts (dsnd (pc k)) h input pos_payload;
valid_facts (parse_sum t p pc) h input pos;
parse_sum_eq t p pc (bytes_of_slice_from h input pos)
#pop-options
inline_for_extraction
let finalize_sum_case
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(s: serializer p)
(w: leaf_writer_strong s)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(destr: enum_repr_of_key'_t (sum_enum t))
(k: sum_key t)
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: HST.Stack unit
(requires (fun h ->
let len_tag = serialized_length (serialize_enum_key _ s (sum_enum t)) k in
U32.v pos + len_tag < 4294967296 /\ (
let pos_payload = pos `U32.add` U32.uint_to_t len_tag in
valid (dsnd (pc k)) h input pos_payload /\
writable input.base (U32.v pos) (U32.v pos_payload) h
)))
(ensures (fun h _ h' ->
let len_tag = serialized_length (serialize_enum_key _ s (sum_enum t)) k in
let pos_payload = pos `U32.add` U32.uint_to_t len_tag in
B.modifies (loc_slice_from_to input pos pos_payload) h h' /\
valid_content_pos (parse_sum t p pc) h' input pos (synth_sum_case t k (contents (dsnd (pc k)) h input pos_payload)) (get_valid_pos (dsnd (pc k)) h input pos_payload)
))
= let pos1 = write_enum_key w (sum_enum t) destr k input pos in
let h = HST.get () in
[@inline_let]
let _ = valid_sum_intro h t p pc input pos in
()
inline_for_extraction
let jump_sum_cases_aux
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(vc: ((x: sum_key t) -> Tot (jumper (dsnd (pc x)))))
(k: sum_key t)
: Tot (jumper (parse_sum_cases t pc k))
= [@inline_let]
let _ = synth_sum_case_injective t k in
jump_synth
(jump_weaken
(weaken_parse_cases_kind t pc)
(vc k)
()
)
(synth_sum_case t k)
()
inline_for_extraction
let jump_sum_cases_t
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot Type
= jumper (parse_sum_cases t pc k)
let jump_sum_cases_t_eq
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
(x y : jump_sum_cases_t t pc k)
: GTot Type0
= True
inline_for_extraction
let jump_sum_cases_t_if
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (if_combinator _ (jump_sum_cases_t_eq t pc k))
= fun cond (sv_true: cond_true cond -> Tot (jump_sum_cases_t t pc k)) (sv_false: cond_false cond -> Tot (jump_sum_cases_t t pc k)) #rrel #rel input pos ->
if cond
then sv_true () input pos
else sv_false () input pos
inline_for_extraction
let jump_sum_cases
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(vc: ((x: sum_key t) -> Tot (jumper (dsnd (pc x)))))
(destr: dep_enum_destr (sum_enum t) (jump_sum_cases_t t pc))
(k: sum_key t)
: Tot (jumper (parse_sum_cases t pc k))
= destr
_
(jump_sum_cases_t_if t pc)
(fun _ _ -> ())
(fun _ _ _ _ -> ())
(jump_sum_cases_aux t pc vc)
k
inline_for_extraction
let jump_sum_aux_payload_t
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
: Tot Type
= (#rrel: _) -> (#rel: _) ->
(input: slice rrel rel) ->
(pos: U32.t) ->
HST.Stack U32.t
(requires (fun h -> live_slice h input /\ U32.v pos <= U32.v input.len /\ (
match k with
| Unknown _ -> False
| Known k' -> valid (dsnd (pc k')) h input pos
)))
(ensures (fun h res h' ->
B.modifies B.loc_none h h' /\ (
match k with
| Unknown _ -> False
| Known k' ->
valid_pos (dsnd (pc k')) h input pos res
)))
let jump_sum_aux_payload_eq
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
: Tot (jump_sum_aux_payload_t t pc k -> jump_sum_aux_payload_t t pc k -> GTot Type0)
= fun _ _ -> True
inline_for_extraction
let jump_sum_aux_payload_if'
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
(cond: bool)
(ift: ((cond_true cond) -> Tot (jump_sum_aux_payload_t t pc k)))
(iff: ((cond_false cond) -> Tot (jump_sum_aux_payload_t t pc k)))
: Tot (jump_sum_aux_payload_t t pc k)
= fun #rrel #rel input pos ->
if cond
then begin
(ift () <: jump_sum_aux_payload_t t pc k) input pos
end else
(iff () <: jump_sum_aux_payload_t t pc k) input pos
inline_for_extraction
let jump_sum_aux_payload_if
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
: Tot (if_combinator _ (jump_sum_aux_payload_eq t pc k))
= jump_sum_aux_payload_if' t pc k
let parse_sum_eq3
(#kt: parser_kind)
(t: sum)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(input: bytes)
(k' : sum_repr_type t)
(consumed_k: consumed_length input)
: Lemma
(requires (Some? (parse (parse_sum t p pc) input) /\ parse p input == Some (k', consumed_k)))
(ensures (
let input_k = Seq.slice input consumed_k (Seq.length input) in
let k = maybe_enum_key_of_repr (sum_enum t) k' in
begin match k with
| Known k ->
Some? (parse (dsnd (pc k)) input_k)
| _ -> False
end
))
= parse_sum_eq'' t p pc input
let parse_sum_eq4
(#kt: parser_kind)
(t: sum)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(input: bytes)
(k' : sum_repr_type t)
(consumed_k: consumed_length input)
(consumed_payload: nat)
: Lemma
(requires (Some? (parse (parse_sum t p pc) input) /\ parse p input == Some (k', consumed_k) /\ (
let input_k = Seq.slice input consumed_k (Seq.length input) in
let k = maybe_enum_key_of_repr (sum_enum t) k' in
begin match k with
| Known k ->
Some? (parse (dsnd (pc k)) input_k) /\ (
let Some (_, consumed_payload') = parse (dsnd (pc k)) input_k in
consumed_payload' == consumed_payload
)
| _ -> False
end
)))
(ensures (
let Some (_, consumed) = parse (parse_sum t p pc) input in
consumed == consumed_k + consumed_payload
))
= parse_sum_eq'' t p pc input
#push-options "--z3rlimit 16"
let valid_sum_elim
(h: HS.mem)
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(#rrel: _) (#rel: _)
(input: slice rrel rel)
(pos: U32.t)
: Lemma
(requires (
valid (parse_sum t p pc) h input pos
))
(ensures (
valid p h input pos /\ (
let pos_payload = get_valid_pos p h input pos in
let k' = maybe_enum_key_of_repr (sum_enum t) (contents p h input pos) in
match k' with
| Known k ->
k == sum_tag_of_data t (contents (parse_sum t p pc) h input pos) /\
valid (dsnd (pc k)) h input pos_payload /\
valid_pos
(parse_sum t p pc) h input pos
(get_valid_pos (dsnd (pc k)) h input pos_payload)
| _ -> False
)))
= let sinput = bytes_of_slice_from h input pos in
let _ = parse_sum_eq'' t p pc sinput in
[@inline_let]
let _ = valid_facts (parse_sum t p pc) h input pos in
let Some (k', consumed_k) = parse p sinput in
let pos_after_tag = U32.uint_to_t (U32.v pos + consumed_k) in
[@inline_let]
let _ = valid_facts p h input pos in
assert (valid_content_pos p h input pos k' pos_after_tag);
match maybe_enum_key_of_repr (sum_enum t) k' with
| Known k -> valid_facts (dsnd (pc k)) h input pos_after_tag
| _ -> ()
#pop-options
let valid_sum_elim_tag
(h: HS.mem)
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: Lemma
(requires (
valid (parse_sum t p pc) h input pos
))
(ensures (
valid (parse_enum_key p (sum_enum t)) h input pos /\
contents (parse_enum_key p (sum_enum t)) h input pos == sum_tag_of_data t (contents (parse_sum t p pc) h input pos)
))
= let _ = parse_sum_eq' t p pc (bytes_of_slice_from h input pos) in
let _ = valid_facts (parse_sum t p pc) h input pos in
let _ = valid_facts (parse_enum_key p (sum_enum t)) h input pos in
()
inline_for_extraction
let read_sum_tag
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(p32: leaf_reader p)
(destr: dep_maybe_enum_destr_t (sum_enum t) (read_enum_key_t (sum_enum t)))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: HST.Stack (sum_key t)
(requires (fun h ->
valid (parse_sum t p pc) h input pos
))
(ensures (fun h res h' ->
B.modifies B.loc_none h h' /\
res == sum_tag_of_data t (contents (parse_sum t p pc) h input pos)
))
= let h = HST.get () in
[@inline_let] let _ = valid_sum_elim_tag h t p pc input pos in
read_enum_key p32 (sum_enum t) destr input pos
inline_for_extraction
let jump_sum_aux
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(v: jumper p)
(p32: leaf_reader p)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(v_payload: ((k: sum_repr_type t)) -> Tot (jump_sum_aux_payload_t t pc (maybe_enum_key_of_repr (sum_enum t) k)))
: Tot (jumper (parse_sum t p pc))
= fun #rrel #rel input pos ->
let h = HST.get () in
[@inline_let]
let _ = valid_sum_elim h t p pc input pos in
let pos_after_tag = v input pos in
let k' = p32 input pos in
v_payload k' input pos_after_tag
inline_for_extraction
let jump_sum_aux_payload'
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (jumper (dsnd (pc x)))))
(k: maybe_enum_key (sum_enum t))
: Tot (jump_sum_aux_payload_t t pc k)
= fun #rrel #rel input pos ->
match k with
| Known k ->
[@inline_let]
let _ = synth_sum_case_injective t k in
pc32 k input pos
| _ -> 0ul // dummy, but we MUST NOT remove this branch, otherwise extraction fails
inline_for_extraction
let jump_sum_aux_payload
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (jumper (dsnd (pc x)))))
(destr: dep_maybe_enum_destr_t (sum_enum t) (jump_sum_aux_payload_t t pc))
(k: sum_repr_type t)
: Tot (jump_sum_aux_payload_t t pc (maybe_enum_key_of_repr (sum_enum t) k))
= destr (jump_sum_aux_payload_eq t pc) (jump_sum_aux_payload_if t pc) (fun _ _ -> ()) (fun _ _ _ _ -> ()) (jump_sum_aux_payload' t pc pc32) k
inline_for_extraction
let jump_sum
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(v: jumper p)
(p32: leaf_reader p)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (jumper (dsnd (pc x)))))
(destr: dep_maybe_enum_destr_t (sum_enum t) (jump_sum_aux_payload_t t pc))
: Tot (jumper (parse_sum t p pc))
= jump_sum_aux t v p32 pc (jump_sum_aux_payload t pc pc32 destr)
inline_for_extraction
let read_sum_cases'
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (leaf_reader (dsnd (pc x)))))
(k: sum_key t)
: Tot (leaf_reader (parse_sum_cases' t pc k))
= [@inline_let]
let _ = synth_sum_case_injective t k in
read_synth'
(dsnd (pc k))
(synth_sum_case t k)
(pc32 k)
()
inline_for_extraction
let read_sum_cases_t
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot Type
= leaf_reader (parse_sum_cases' t pc k)
let read_sum_cases_t_eq
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
(x y : read_sum_cases_t t pc k)
: GTot Type0
= True
inline_for_extraction
let read_sum_cases_t_if
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (if_combinator _ (read_sum_cases_t_eq t pc k))
= fun cond (sv_true: cond_true cond -> Tot (read_sum_cases_t t pc k)) (sv_false: cond_false cond -> Tot (read_sum_cases_t t pc k)) #_ #_ input pos ->
if cond
then (sv_true () input pos)
else (sv_false () input pos)
inline_for_extraction
let read_sum_cases
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (leaf_reader (dsnd (pc x)))))
(destr: dep_enum_destr (sum_enum t) (read_sum_cases_t t pc))
(k: sum_key t)
: Tot (leaf_reader (parse_sum_cases' t pc k))
= destr
_
(read_sum_cases_t_if t pc)
(fun _ _ -> ())
(fun _ _ _ _ -> ())
(read_sum_cases' t pc pc32)
k
#push-options "--z3rlimit 32"
inline_for_extraction
let read_sum
(#kt: parser_kind)
(t: sum)
(p: parser kt (sum_repr_type t))
(p32: leaf_reader (parse_enum_key p (sum_enum t)))
(j: jumper p)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (leaf_reader (dsnd (pc x)))))
(destr: dep_enum_destr (sum_enum t) (read_sum_cases_t t pc))
: Tot (leaf_reader (parse_sum t p pc))
=
fun #_ #_ input pos ->
let h = HST.get () in
valid_facts (parse_sum t p pc) h input pos;
parse_sum_eq' t p pc (bytes_of_slice_from h input pos);
valid_facts (parse_enum_key p (sum_enum t)) h input pos;
let k = p32 input pos in
let pos' = jump_enum_key j (sum_enum t) input pos in
valid_facts (parse_sum_cases' t pc k) h input pos' ;
read_sum_cases t pc pc32 destr k input pos'
#pop-options
inline_for_extraction
let serialize32_sum_cases_t
(t: sum)
(#pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(sc: ((x: sum_key t) -> Tot (serializer (dsnd (pc x)))))
(k: sum_key t)
: Tot Type
= serializer32 (serialize_sum_cases t pc sc k)
let serialize32_sum_cases_t_eq
(t: sum)
(#pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(sc: ((x: sum_key t) -> Tot (serializer (dsnd (pc x)))))
(k: sum_key t)
(x y: serialize32_sum_cases_t t sc k)
: GTot Type0
= True
inline_for_extraction
let serialize32_sum_cases_t_if
(t: sum)
(#pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(sc: ((x: sum_key t) -> Tot (serializer (dsnd (pc x)))))
(k: sum_key t)
: Tot (if_combinator _ (serialize32_sum_cases_t_eq t sc k))
= fun cond (sv_true: (cond_true cond -> Tot (serialize32_sum_cases_t t sc k))) (sv_false: (cond_false cond -> Tot (serialize32_sum_cases_t t sc k))) x #rrel #rel b pos ->
if cond
then (sv_true () x b pos)
else (sv_false () x b pos)
inline_for_extraction
let serialize32_sum_cases_aux
(t: sum)
(#pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(sc: ((x: sum_key t) -> Tot (serializer (dsnd (pc x)))))
(sc32: ((x: sum_key t) -> Tot (serializer32 (sc x))))
(k: sum_key t)
: Tot (serializer32 (serialize_sum_cases t pc sc k))
= fun x #rrel #rel b pos ->
[@inline_let] let _ =
Classical.forall_intro (parse_sum_cases_eq' t pc k);
synth_sum_case_injective t k;
synth_sum_case_inverse t k
in
serialize32_synth
(sc32 k)
(synth_sum_case t k)
(synth_sum_case_recip t k)
(fun x -> synth_sum_case_recip t k x)
()
x
b
pos
inline_for_extraction
let serialize32_sum_cases
(t: sum)
(#pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(sc: ((x: sum_key t) -> Tot (serializer (dsnd (pc x)))))
(sc32: ((x: sum_key t) -> Tot (serializer32 (sc x))))
(destr: dep_enum_destr (sum_enum t) (serialize32_sum_cases_t t sc))
(k: sum_key t)
: Tot (serializer32 (serialize_sum_cases t pc sc k))
= destr
_
(serialize32_sum_cases_t_if t sc)
(fun _ _ -> ())
(fun _ _ _ _ -> ())
(serialize32_sum_cases_aux t sc sc32)
k
inline_for_extraction
let serialize32_sum
(#kt: parser_kind)
(t: sum)
(#p: parser kt (sum_repr_type t))
(s: serializer p {kt.parser_kind_subkind == Some ParserStrong})
(s32: serializer32 (serialize_enum_key _ s (sum_enum t)))
(#pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(sc: ((x: sum_key t) -> Tot (serializer (dsnd (pc x)))))
(sc32: ((x: sum_key t) -> Tot (serializer32 (sc x))))
(destr: dep_enum_destr (sum_enum t) (serialize32_sum_cases_t t sc))
: Tot (serializer32 (serialize_sum t s sc))
= fun x #rrel #rel b pos ->
serialize_sum_eq t s sc x;
let tg = sum_tag_of_data t x in
serialize32_nondep_then_aux s32 (serialize32_sum_cases t sc sc32 destr tg) tg x b pos
let clens_sum_tag
(s: sum)
: Tot (clens (sum_type s) (sum_key s))
= {
clens_cond = (fun _ -> True);
clens_get = sum_tag_of_data s;
}
let gaccessor_sum_tag
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
: Tot (gaccessor (parse_sum t p pc) (parse_enum_key p (sum_enum t)) (clens_sum_tag t))
= gaccessor_tagged_union_tag
(parse_enum_key p (sum_enum t))
(sum_tag_of_data t)
(parse_sum_cases t pc)
inline_for_extraction
let accessor_sum_tag
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
: Tot (accessor (gaccessor_sum_tag t p pc))
= accessor_tagged_union_tag
(parse_enum_key p (sum_enum t))
(sum_tag_of_data t)
(parse_sum_cases t pc)
let clens_sum_payload
(s: sum)
(k: sum_key s)
: Tot (clens (sum_type s) (sum_type_of_tag s k))
= {
clens_cond = (fun (x: sum_type s) -> sum_tag_of_data s x == k);
clens_get = (fun (x: sum_type s) -> synth_sum_case_recip s k x <: Ghost (sum_type_of_tag s k) (requires (sum_tag_of_data s x == k)) (ensures (fun _ -> True)));
}
#push-options "--z3rlimit 32"
let gaccessor_clens_sum_payload'
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (gaccessor' (parse_sum t p pc) (dsnd (pc k)) (clens_sum_payload t k))
= fun (input: bytes) ->
parse_sum_eq'' t p pc input;
let res =
match parse p input with
| Some (_, consumed) ->
synth_sum_case_inverse t k;
synth_sum_case_injective t k;
synth_injective_synth_inverse_synth_inverse_recip (synth_sum_case t k) (synth_sum_case_recip t k) ();
(consumed)
| _ -> 0 // dummy
in
(res <: (res: _ { gaccessor_post' (parse_sum t p pc) (dsnd (pc k)) (clens_sum_payload t k) input res } ))
#push-options "--z3rlimit 64"
let gaccessor_clens_sum_payload_injective
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
(sl sl' : bytes)
: Lemma
(requires (
gaccessor_pre (parse_sum t p pc) (dsnd (pc k)) (clens_sum_payload t k) sl /\
gaccessor_pre (parse_sum t p pc) (dsnd (pc k)) (clens_sum_payload t k) sl' /\
injective_precond (parse_sum t p pc) sl sl'
))
(ensures (gaccessor_clens_sum_payload' t p pc k sl == gaccessor_clens_sum_payload' t p pc k sl'))
= parse_sum_eq'' t p pc sl;
parse_sum_eq'' t p pc sl' ;
parse_injective (parse_sum t p pc) sl sl' ;
parse_injective p sl sl'
#pop-options
let gaccessor_clens_sum_payload_no_lookahead
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
(sl sl' : bytes)
: Lemma
(requires (
(parse_sum_kind kt t pc).parser_kind_subkind == Some ParserStrong /\
gaccessor_pre (parse_sum t p pc) (dsnd (pc k)) (clens_sum_payload t k) sl /\
gaccessor_pre (parse_sum t p pc) (dsnd (pc k)) (clens_sum_payload t k) sl' /\
no_lookahead_on_precond (parse_sum t p pc) sl sl'
))
(ensures (gaccessor_clens_sum_payload' t p pc k sl == gaccessor_clens_sum_payload' t p pc k sl'))
= parse_sum_eq'' t p pc sl;
parse_sum_eq'' t p pc sl' ;
parse_strong_prefix (parse_sum t p pc) sl sl' ;
parse_injective p sl sl'
let gaccessor_clens_sum_payload
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (gaccessor (parse_sum t p pc) (dsnd (pc k)) (clens_sum_payload t k))
= Classical.forall_intro_2 (fun x -> Classical.move_requires (gaccessor_clens_sum_payload_injective t p pc k x));
Classical.forall_intro_2 (fun x -> Classical.move_requires (gaccessor_clens_sum_payload_no_lookahead t p pc k x));
gaccessor_prop_equiv (parse_sum t p pc) (dsnd (pc k)) (clens_sum_payload t k) (gaccessor_clens_sum_payload' t p pc k);
gaccessor_clens_sum_payload' t p pc k
inline_for_extraction
let accessor_clens_sum_payload'
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(j: jumper p)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: HST.Stack U32.t
(requires (fun h ->
valid (parse_sum t p pc) h input pos /\
(clens_sum_payload t k).clens_cond (contents (parse_sum t p pc) h input pos)
))
(ensures (fun h pos' h' ->
B.modifies B.loc_none h h' /\
pos' == slice_access h (gaccessor_clens_sum_payload t p pc k) input pos
))
=
let h = HST.get () in
[@inline_let]
let _ =
let pos' = get_valid_pos (parse_sum t p pc) h input pos in
let large = bytes_of_slice_from h input pos in
slice_access_eq h (gaccessor_clens_sum_payload t p pc k) input pos;
valid_facts (parse_sum t p pc) h input pos;
parse_sum_eq'' t p pc large;
valid_facts p h input pos
in
j input pos
#pop-options
inline_for_extraction
let accessor_clens_sum_payload
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(j: jumper p)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (accessor (gaccessor_clens_sum_payload t p pc k))
= fun #rrel #rel -> accessor_clens_sum_payload' t j pc k #rrel #rel
let clens_sum_cases_payload
(s: sum)
(k: sum_key s)
: Tot (clens (sum_cases s k) (sum_type_of_tag s k))
= {
clens_cond = (fun (x: sum_cases s k) -> True);
clens_get = (fun (x: sum_cases s k) -> synth_sum_case_recip s k x <: Ghost (sum_type_of_tag s k) (requires (True)) (ensures (fun _ -> True)));
}
let gaccessor_clens_sum_cases_payload
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (gaccessor (parse_sum_cases' t pc k) (dsnd (pc k)) (clens_sum_cases_payload t k))
= synth_sum_case_injective t k;
synth_sum_case_inverse t k;
synth_injective_synth_inverse_synth_inverse_recip (synth_sum_case t k) (synth_sum_case_recip t k) ();
gaccessor_ext
(gaccessor_synth (dsnd (pc k)) (synth_sum_case t k) (synth_sum_case_recip t k) ())
(clens_sum_cases_payload t k)
()
inline_for_extraction
let accessor_clens_sum_cases_payload
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (accessor (gaccessor_clens_sum_cases_payload t pc k))
= [@inline_let]
let _ =
synth_sum_case_injective t k;
synth_sum_case_inverse t k;
synth_injective_synth_inverse_synth_inverse_recip (synth_sum_case t k) (synth_sum_case_recip t k) ()
in
accessor_ext
(accessor_synth (dsnd (pc k)) (synth_sum_case t k) (synth_sum_case_recip t k) ())
(clens_sum_cases_payload t k)
()
inline_for_extraction
let validate_dsum_cases_t
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(#k: parser_kind)
(g: parser k (dsum_type_of_unknown_tag s))
(x: dsum_key s)
: Tot Type
= validator (parse_dsum_cases' s f g x)
let validate_dsum_cases_eq
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(#k: parser_kind)
(g: parser k (dsum_type_of_unknown_tag s))
(x: dsum_key s)
(v1 v2 : validate_dsum_cases_t s f g x)
: GTot Type0
= True
inline_for_extraction
let validate_dsum_cases_if'
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(#k: parser_kind)
(g: parser k (dsum_type_of_unknown_tag s))
(x: dsum_key s)
(cond: bool)
(ift: (cond_true cond -> Tot (validate_dsum_cases_t s f g x)))
(iff: (cond_false cond -> Tot (validate_dsum_cases_t s f g x)))
: Tot (validate_dsum_cases_t s f g x)
= fun #rrel #rel input len ->
if cond
then (ift () <: validate_dsum_cases_t s f g x) input len
else (iff () <: validate_dsum_cases_t s f g x) input len
inline_for_extraction
let validate_dsum_cases_if
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(#k: parser_kind)
(g: parser k (dsum_type_of_unknown_tag s))
(x: dsum_key s)
: Tot (if_combinator _ (validate_dsum_cases_eq s f g x))
= validate_dsum_cases_if' s f g x
inline_for_extraction
let validate_dsum_cases'
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(f' : (x: dsum_known_key s) -> Tot (validator (dsnd (f x))))
(#k: parser_kind)
(#g: parser k (dsum_type_of_unknown_tag s))
(g' : validator g)
(x: dsum_key s)
: Tot (validate_dsum_cases_t s f g x)
= [@inline_let]
let _ = synth_dsum_case_injective s x in
match x with
| Known x' -> validate_synth (f' x') (synth_dsum_case s (Known x')) () <: validator (parse_dsum_cases' s f g x)
| Unknown x' -> validate_synth g' (synth_dsum_case s (Unknown x')) () <: validator (parse_dsum_cases' s f g x) | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"LowStar.Buffer.fst.checked",
"LowParse.Spec.Sum.fst.checked",
"LowParse.Low.Enum.fst.checked",
"FStar.UInt64.fsti.checked",
"FStar.UInt32.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Int.Cast.fst.checked",
"FStar.HyperStack.ST.fsti.checked",
"FStar.HyperStack.fst.checked",
"FStar.Classical.fsti.checked"
],
"interface_file": false,
"source_file": "LowParse.Low.Sum.fst"
} | [
{
"abbrev": true,
"full_module": "FStar.HyperStack",
"short_module": "HS"
},
{
"abbrev": true,
"full_module": "FStar.UInt64",
"short_module": "U64"
},
{
"abbrev": true,
"full_module": "FStar.Int.Cast",
"short_module": "Cast"
},
{
"abbrev": true,
"full_module": "LowStar.Buffer",
"short_module": "B"
},
{
"abbrev": true,
"full_module": "FStar.HyperStack.ST",
"short_module": "HST"
},
{
"abbrev": true,
"full_module": "FStar.UInt32",
"short_module": "U32"
},
{
"abbrev": false,
"full_module": "LowParse.Spec.Sum",
"short_module": null
},
{
"abbrev": false,
"full_module": "LowParse.Low.Enum",
"short_module": null
},
{
"abbrev": false,
"full_module": "LowParse.Low",
"short_module": null
},
{
"abbrev": false,
"full_module": "LowParse.Low",
"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",
"short_module": null
}
] | {
"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_elim_box": false,
"smtencoding_l_arith_repr": "boxwrap",
"smtencoding_nl_arith_repr": "boxwrap",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": true,
"z3cliopt": [],
"z3refresh": false,
"z3rlimit": 5,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | false |
s: LowParse.Spec.Sum.dsum ->
f:
(x: LowParse.Spec.Sum.dsum_known_key s
-> Prims.dtuple2 LowParse.Spec.Base.parser_kind
(fun k -> LowParse.Spec.Base.parser k (LowParse.Spec.Sum.dsum_type_of_known_tag s x))) ->
f':
(x: LowParse.Spec.Sum.dsum_known_key s
-> LowParse.Low.Base.validator (FStar.Pervasives.dsnd (f x))) ->
g': LowParse.Low.Base.validator g ->
destr:
LowParse.Spec.Enum.dep_enum_destr (LowParse.Spec.Sum.dsum_enum s)
(fun k -> LowParse.Low.Sum.validate_dsum_cases_t s f g (LowParse.Spec.Enum.Known k)) ->
x: LowParse.Spec.Sum.dsum_key s
-> LowParse.Low.Sum.validate_dsum_cases_t s f g x | Prims.Tot | [
"total"
] | [] | [
"LowParse.Spec.Sum.dsum",
"LowParse.Spec.Sum.dsum_known_key",
"Prims.dtuple2",
"LowParse.Spec.Base.parser_kind",
"LowParse.Spec.Base.parser",
"LowParse.Spec.Sum.dsum_type_of_known_tag",
"LowParse.Low.Base.validator",
"Prims.__proj__Mkdtuple2__item___1",
"FStar.Pervasives.dsnd",
"LowParse.Spec.Sum.dsum_type_of_unknown_tag",
"LowParse.Spec.Enum.dep_enum_destr",
"LowParse.Spec.Sum.dsum_key_type",
"LowParse.Spec.Sum.dsum_repr_type",
"LowParse.Spec.Sum.dsum_enum",
"LowParse.Spec.Enum.enum_key",
"LowParse.Low.Sum.validate_dsum_cases_t",
"LowParse.Spec.Enum.Known",
"LowParse.Spec.Sum.dsum_key",
"LowParse.Slice.srel",
"LowParse.Bytes.byte",
"LowParse.Slice.slice",
"FStar.UInt64.t",
"LowParse.Low.Sum.validate_dsum_cases_eq",
"LowParse.Low.Sum.validate_dsum_cases_if",
"LowParse.Spec.Enum.if_combinator",
"Prims.unit",
"LowParse.Low.Sum.validate_dsum_cases'",
"LowParse.Spec.Enum.unknown_enum_repr",
"LowParse.Spec.Enum.Unknown"
] | [] | false | false | false | false | false | let validate_dsum_cases'_destr
(s: dsum)
(f: (x: dsum_known_key s -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x))))
(f': (x: dsum_known_key s -> Tot (validator (dsnd (f x)))))
(#k: parser_kind)
(#g: parser k (dsum_type_of_unknown_tag s))
(g': validator g)
(destr: dep_enum_destr _ (fun k -> validate_dsum_cases_t s f g (Known k)))
(x: dsum_key s)
: Tot (validate_dsum_cases_t s f g x) =
| fun #rrel #rel input pos ->
match x with
| Known k ->
destr _
(fun k -> validate_dsum_cases_if s f g (Known k))
(fun _ _ -> ())
(fun _ _ _ _ -> ())
(fun k -> validate_dsum_cases' s f f' g' (Known k))
k
input
pos
| Unknown r -> validate_dsum_cases' s f f' g' (Unknown r) input pos | false |
LowParse.Low.Sum.fst | LowParse.Low.Sum.accessor_dsum_tag | val accessor_dsum_tag
(#kt: parser_kind)
(t: dsum)
(p: parser kt (dsum_repr_type t))
(f: (x: dsum_known_key t -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x))))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
: Tot (accessor (gaccessor_dsum_tag t p f g)) | val accessor_dsum_tag
(#kt: parser_kind)
(t: dsum)
(p: parser kt (dsum_repr_type t))
(f: (x: dsum_known_key t -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x))))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
: Tot (accessor (gaccessor_dsum_tag t p f g)) | let accessor_dsum_tag
(#kt: parser_kind)
(t: dsum)
(p: parser kt (dsum_repr_type t))
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
: Tot (accessor (gaccessor_dsum_tag t p f g))
= accessor_tagged_union_tag
(parse_maybe_enum_key p (dsum_enum t))
(dsum_tag_of_data t)
(parse_dsum_cases t f g) | {
"file_name": "src/lowparse/LowParse.Low.Sum.fst",
"git_rev": "00217c4a89f5ba56002ba9aa5b4a9d5903bfe9fa",
"git_url": "https://github.com/project-everest/everparse.git",
"project_name": "everparse"
} | {
"end_col": 28,
"end_line": 1798,
"start_col": 0,
"start_line": 1787
} | module LowParse.Low.Sum
include LowParse.Low.Enum
include LowParse.Spec.Sum
module U32 = FStar.UInt32
module HST = FStar.HyperStack.ST
module B = LowStar.Buffer
module Cast = FStar.Int.Cast
module U64 = FStar.UInt64
inline_for_extraction
let validate_sum_cases_aux
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(vc: ((x: sum_key t) -> Tot (validator (dsnd (pc x)))))
(k: sum_key t)
: Tot (validator (parse_sum_cases t pc k))
= [@inline_let]
let _ = synth_sum_case_injective t k in
validate_synth
(validate_weaken
(weaken_parse_cases_kind t pc)
(vc k)
()
)
(synth_sum_case t k)
()
inline_for_extraction
let validate_sum_cases_t
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot Type
= validator (parse_sum_cases t pc k)
let validate_sum_cases_t_eq
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
(x y : validate_sum_cases_t t pc k)
: GTot Type0
= True
inline_for_extraction
let validate_sum_cases_t_if
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (if_combinator _ (validate_sum_cases_t_eq t pc k))
= fun cond (sv_true: cond_true cond -> Tot (validate_sum_cases_t t pc k)) (sv_false: cond_false cond -> Tot (validate_sum_cases_t t pc k)) #rrel #rel input pos ->
if cond
then sv_true () input pos
else sv_false () input pos
inline_for_extraction
let validate_sum_cases
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(vc: ((x: sum_key t) -> Tot (validator (dsnd (pc x)))))
(destr: dep_enum_destr (sum_enum t) (validate_sum_cases_t t pc))
(k: sum_key t)
: Tot (validator (parse_sum_cases t pc k))
= destr
_
(validate_sum_cases_t_if t pc)
(fun _ _ -> ())
(fun _ _ _ _ -> ())
(validate_sum_cases_aux t pc vc)
k
inline_for_extraction
let validate_sum_aux_payload_t
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
: Tot Type
= (#rrel: _) -> (#rel: _) ->
(input: slice rrel rel) ->
(pos: U64.t) ->
HST.Stack U64.t
(requires (fun h -> live_slice h input /\ U64.v pos <= U32.v input.len))
(ensures (fun h res h' ->
B.modifies B.loc_none h h' /\ (
match k with
| Unknown _ -> is_error res
| Known k' ->
if is_success res
then
valid_pos (dsnd (pc k')) h input (uint64_to_uint32 pos) (uint64_to_uint32 res)
else
(~ (valid (dsnd (pc k')) h input (uint64_to_uint32 pos)))
)))
let validate_sum_aux_payload_eq
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
: Tot (validate_sum_aux_payload_t t pc k -> validate_sum_aux_payload_t t pc k -> GTot Type0)
= fun _ _ -> True
inline_for_extraction
let validate_sum_aux_payload_if'
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
(cond: bool)
(ift: ((cond_true cond) -> Tot (validate_sum_aux_payload_t t pc k)))
(iff: ((cond_false cond) -> Tot (validate_sum_aux_payload_t t pc k)))
: Tot (validate_sum_aux_payload_t t pc k)
= fun #rrel #rel input pos ->
if cond
then begin
(ift () <: validate_sum_aux_payload_t t pc k) input pos
end else
(iff () <: validate_sum_aux_payload_t t pc k) input pos
inline_for_extraction
let validate_sum_aux_payload_if
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
: Tot (if_combinator _ (validate_sum_aux_payload_eq t pc k))
= validate_sum_aux_payload_if' t pc k
#push-options "--z3rlimit 64 --z3cliopt smt.arith.nl=false --using_facts_from '* -FStar.Int.Cast -LowParse.BitFields'"
// --query_stats --smtencoding.elim_box true --smtencoding.l_arith_repr native --z3refresh"
inline_for_extraction
let validate_sum_aux
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(v: validator p)
(p32: leaf_reader p)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(v_payload: ((k: sum_repr_type t)) -> Tot (validate_sum_aux_payload_t t pc (maybe_enum_key_of_repr (sum_enum t) k)))
: Tot (validator (parse_sum t p pc))
= fun #rrel #rel input pos ->
let h = HST.get () in
[@inline_let]
let _ = parse_sum_eq'' t p pc (bytes_of_slice_from h input (uint64_to_uint32 pos)) in
[@inline_let]
let _ = valid_facts (parse_sum t p pc) h input (uint64_to_uint32 pos) in
[@inline_let]
let _ = valid_facts p h input (uint64_to_uint32 pos) in
let len_after_tag = v input pos in
if is_error len_after_tag
then len_after_tag
else begin
let h1 = HST.get () in
let k' = p32 input (uint64_to_uint32 pos) in
[@inline_let]
let _ =
match maybe_enum_key_of_repr (sum_enum t) k' with
| Known k -> valid_facts (dsnd (pc k)) h input (uint64_to_uint32 len_after_tag)
| _ -> ()
in
v_payload k' input len_after_tag
end
#pop-options
inline_for_extraction
let validate_sum_aux_payload'
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (validator (dsnd (pc x)))))
(k: maybe_enum_key (sum_enum t))
: Tot (validate_sum_aux_payload_t t pc k)
= fun #rrel #rel input pos ->
match k with
| Known k ->
[@inline_let]
let _ = synth_sum_case_injective t k in
pc32 k input pos
// validate_synth (pc32 k) (synth_sum_case t k) () input pos
| _ -> validator_error_generic
inline_for_extraction
let validate_sum_aux_payload
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (validator (dsnd (pc x)))))
(destr: dep_maybe_enum_destr_t (sum_enum t) (validate_sum_aux_payload_t t pc))
(k: sum_repr_type t)
: Tot (validate_sum_aux_payload_t t pc (maybe_enum_key_of_repr (sum_enum t) k))
= destr (validate_sum_aux_payload_eq t pc) (validate_sum_aux_payload_if t pc) (fun _ _ -> ()) (fun _ _ _ _ -> ()) (validate_sum_aux_payload' t pc pc32) k
inline_for_extraction
let validate_sum
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(v: validator p)
(p32: leaf_reader p)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (validator (dsnd (pc x)))))
(destr: dep_maybe_enum_destr_t (sum_enum t) (validate_sum_aux_payload_t t pc))
: Tot (validator (parse_sum t p pc))
= validate_sum_aux t v p32 pc (validate_sum_aux_payload t pc pc32 destr)
module HS = FStar.HyperStack
#push-options "--z3rlimit 256 --z3cliopt smt.arith.nl=false --initial_ifuel 8 --max_ifuel 8 --initial_fuel 2 --max_fuel 2"
#restart-solver
let valid_sum_intro
(h: HS.mem)
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: Lemma
(requires (
valid (parse_enum_key p (sum_enum t)) h input pos /\ (
let k = contents (parse_enum_key p (sum_enum t)) h input pos in
valid (dsnd (pc k)) h input (get_valid_pos (parse_enum_key p (sum_enum t)) h input pos)
)))
(ensures (
let k = contents (parse_enum_key p (sum_enum t)) h input pos in
let pos_payload = get_valid_pos (parse_enum_key p (sum_enum t)) h input pos in
valid_content_pos
(parse_sum t p pc) h input pos
(synth_sum_case t k (contents (dsnd (pc k)) h input pos_payload))
(get_valid_pos (dsnd (pc k)) h input pos_payload)
))
= valid_facts (parse_enum_key p (sum_enum t)) h input pos;
let k = contents (parse_enum_key p (sum_enum t)) h input pos in
let pos_payload = get_valid_pos (parse_enum_key p (sum_enum t)) h input pos in
valid_facts (dsnd (pc k)) h input pos_payload;
valid_facts (parse_sum t p pc) h input pos;
parse_sum_eq t p pc (bytes_of_slice_from h input pos)
#pop-options
inline_for_extraction
let finalize_sum_case
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(s: serializer p)
(w: leaf_writer_strong s)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(destr: enum_repr_of_key'_t (sum_enum t))
(k: sum_key t)
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: HST.Stack unit
(requires (fun h ->
let len_tag = serialized_length (serialize_enum_key _ s (sum_enum t)) k in
U32.v pos + len_tag < 4294967296 /\ (
let pos_payload = pos `U32.add` U32.uint_to_t len_tag in
valid (dsnd (pc k)) h input pos_payload /\
writable input.base (U32.v pos) (U32.v pos_payload) h
)))
(ensures (fun h _ h' ->
let len_tag = serialized_length (serialize_enum_key _ s (sum_enum t)) k in
let pos_payload = pos `U32.add` U32.uint_to_t len_tag in
B.modifies (loc_slice_from_to input pos pos_payload) h h' /\
valid_content_pos (parse_sum t p pc) h' input pos (synth_sum_case t k (contents (dsnd (pc k)) h input pos_payload)) (get_valid_pos (dsnd (pc k)) h input pos_payload)
))
= let pos1 = write_enum_key w (sum_enum t) destr k input pos in
let h = HST.get () in
[@inline_let]
let _ = valid_sum_intro h t p pc input pos in
()
inline_for_extraction
let jump_sum_cases_aux
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(vc: ((x: sum_key t) -> Tot (jumper (dsnd (pc x)))))
(k: sum_key t)
: Tot (jumper (parse_sum_cases t pc k))
= [@inline_let]
let _ = synth_sum_case_injective t k in
jump_synth
(jump_weaken
(weaken_parse_cases_kind t pc)
(vc k)
()
)
(synth_sum_case t k)
()
inline_for_extraction
let jump_sum_cases_t
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot Type
= jumper (parse_sum_cases t pc k)
let jump_sum_cases_t_eq
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
(x y : jump_sum_cases_t t pc k)
: GTot Type0
= True
inline_for_extraction
let jump_sum_cases_t_if
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (if_combinator _ (jump_sum_cases_t_eq t pc k))
= fun cond (sv_true: cond_true cond -> Tot (jump_sum_cases_t t pc k)) (sv_false: cond_false cond -> Tot (jump_sum_cases_t t pc k)) #rrel #rel input pos ->
if cond
then sv_true () input pos
else sv_false () input pos
inline_for_extraction
let jump_sum_cases
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(vc: ((x: sum_key t) -> Tot (jumper (dsnd (pc x)))))
(destr: dep_enum_destr (sum_enum t) (jump_sum_cases_t t pc))
(k: sum_key t)
: Tot (jumper (parse_sum_cases t pc k))
= destr
_
(jump_sum_cases_t_if t pc)
(fun _ _ -> ())
(fun _ _ _ _ -> ())
(jump_sum_cases_aux t pc vc)
k
inline_for_extraction
let jump_sum_aux_payload_t
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
: Tot Type
= (#rrel: _) -> (#rel: _) ->
(input: slice rrel rel) ->
(pos: U32.t) ->
HST.Stack U32.t
(requires (fun h -> live_slice h input /\ U32.v pos <= U32.v input.len /\ (
match k with
| Unknown _ -> False
| Known k' -> valid (dsnd (pc k')) h input pos
)))
(ensures (fun h res h' ->
B.modifies B.loc_none h h' /\ (
match k with
| Unknown _ -> False
| Known k' ->
valid_pos (dsnd (pc k')) h input pos res
)))
let jump_sum_aux_payload_eq
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
: Tot (jump_sum_aux_payload_t t pc k -> jump_sum_aux_payload_t t pc k -> GTot Type0)
= fun _ _ -> True
inline_for_extraction
let jump_sum_aux_payload_if'
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
(cond: bool)
(ift: ((cond_true cond) -> Tot (jump_sum_aux_payload_t t pc k)))
(iff: ((cond_false cond) -> Tot (jump_sum_aux_payload_t t pc k)))
: Tot (jump_sum_aux_payload_t t pc k)
= fun #rrel #rel input pos ->
if cond
then begin
(ift () <: jump_sum_aux_payload_t t pc k) input pos
end else
(iff () <: jump_sum_aux_payload_t t pc k) input pos
inline_for_extraction
let jump_sum_aux_payload_if
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
: Tot (if_combinator _ (jump_sum_aux_payload_eq t pc k))
= jump_sum_aux_payload_if' t pc k
let parse_sum_eq3
(#kt: parser_kind)
(t: sum)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(input: bytes)
(k' : sum_repr_type t)
(consumed_k: consumed_length input)
: Lemma
(requires (Some? (parse (parse_sum t p pc) input) /\ parse p input == Some (k', consumed_k)))
(ensures (
let input_k = Seq.slice input consumed_k (Seq.length input) in
let k = maybe_enum_key_of_repr (sum_enum t) k' in
begin match k with
| Known k ->
Some? (parse (dsnd (pc k)) input_k)
| _ -> False
end
))
= parse_sum_eq'' t p pc input
let parse_sum_eq4
(#kt: parser_kind)
(t: sum)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(input: bytes)
(k' : sum_repr_type t)
(consumed_k: consumed_length input)
(consumed_payload: nat)
: Lemma
(requires (Some? (parse (parse_sum t p pc) input) /\ parse p input == Some (k', consumed_k) /\ (
let input_k = Seq.slice input consumed_k (Seq.length input) in
let k = maybe_enum_key_of_repr (sum_enum t) k' in
begin match k with
| Known k ->
Some? (parse (dsnd (pc k)) input_k) /\ (
let Some (_, consumed_payload') = parse (dsnd (pc k)) input_k in
consumed_payload' == consumed_payload
)
| _ -> False
end
)))
(ensures (
let Some (_, consumed) = parse (parse_sum t p pc) input in
consumed == consumed_k + consumed_payload
))
= parse_sum_eq'' t p pc input
#push-options "--z3rlimit 16"
let valid_sum_elim
(h: HS.mem)
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(#rrel: _) (#rel: _)
(input: slice rrel rel)
(pos: U32.t)
: Lemma
(requires (
valid (parse_sum t p pc) h input pos
))
(ensures (
valid p h input pos /\ (
let pos_payload = get_valid_pos p h input pos in
let k' = maybe_enum_key_of_repr (sum_enum t) (contents p h input pos) in
match k' with
| Known k ->
k == sum_tag_of_data t (contents (parse_sum t p pc) h input pos) /\
valid (dsnd (pc k)) h input pos_payload /\
valid_pos
(parse_sum t p pc) h input pos
(get_valid_pos (dsnd (pc k)) h input pos_payload)
| _ -> False
)))
= let sinput = bytes_of_slice_from h input pos in
let _ = parse_sum_eq'' t p pc sinput in
[@inline_let]
let _ = valid_facts (parse_sum t p pc) h input pos in
let Some (k', consumed_k) = parse p sinput in
let pos_after_tag = U32.uint_to_t (U32.v pos + consumed_k) in
[@inline_let]
let _ = valid_facts p h input pos in
assert (valid_content_pos p h input pos k' pos_after_tag);
match maybe_enum_key_of_repr (sum_enum t) k' with
| Known k -> valid_facts (dsnd (pc k)) h input pos_after_tag
| _ -> ()
#pop-options
let valid_sum_elim_tag
(h: HS.mem)
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: Lemma
(requires (
valid (parse_sum t p pc) h input pos
))
(ensures (
valid (parse_enum_key p (sum_enum t)) h input pos /\
contents (parse_enum_key p (sum_enum t)) h input pos == sum_tag_of_data t (contents (parse_sum t p pc) h input pos)
))
= let _ = parse_sum_eq' t p pc (bytes_of_slice_from h input pos) in
let _ = valid_facts (parse_sum t p pc) h input pos in
let _ = valid_facts (parse_enum_key p (sum_enum t)) h input pos in
()
inline_for_extraction
let read_sum_tag
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(p32: leaf_reader p)
(destr: dep_maybe_enum_destr_t (sum_enum t) (read_enum_key_t (sum_enum t)))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: HST.Stack (sum_key t)
(requires (fun h ->
valid (parse_sum t p pc) h input pos
))
(ensures (fun h res h' ->
B.modifies B.loc_none h h' /\
res == sum_tag_of_data t (contents (parse_sum t p pc) h input pos)
))
= let h = HST.get () in
[@inline_let] let _ = valid_sum_elim_tag h t p pc input pos in
read_enum_key p32 (sum_enum t) destr input pos
inline_for_extraction
let jump_sum_aux
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(v: jumper p)
(p32: leaf_reader p)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(v_payload: ((k: sum_repr_type t)) -> Tot (jump_sum_aux_payload_t t pc (maybe_enum_key_of_repr (sum_enum t) k)))
: Tot (jumper (parse_sum t p pc))
= fun #rrel #rel input pos ->
let h = HST.get () in
[@inline_let]
let _ = valid_sum_elim h t p pc input pos in
let pos_after_tag = v input pos in
let k' = p32 input pos in
v_payload k' input pos_after_tag
inline_for_extraction
let jump_sum_aux_payload'
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (jumper (dsnd (pc x)))))
(k: maybe_enum_key (sum_enum t))
: Tot (jump_sum_aux_payload_t t pc k)
= fun #rrel #rel input pos ->
match k with
| Known k ->
[@inline_let]
let _ = synth_sum_case_injective t k in
pc32 k input pos
| _ -> 0ul // dummy, but we MUST NOT remove this branch, otherwise extraction fails
inline_for_extraction
let jump_sum_aux_payload
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (jumper (dsnd (pc x)))))
(destr: dep_maybe_enum_destr_t (sum_enum t) (jump_sum_aux_payload_t t pc))
(k: sum_repr_type t)
: Tot (jump_sum_aux_payload_t t pc (maybe_enum_key_of_repr (sum_enum t) k))
= destr (jump_sum_aux_payload_eq t pc) (jump_sum_aux_payload_if t pc) (fun _ _ -> ()) (fun _ _ _ _ -> ()) (jump_sum_aux_payload' t pc pc32) k
inline_for_extraction
let jump_sum
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(v: jumper p)
(p32: leaf_reader p)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (jumper (dsnd (pc x)))))
(destr: dep_maybe_enum_destr_t (sum_enum t) (jump_sum_aux_payload_t t pc))
: Tot (jumper (parse_sum t p pc))
= jump_sum_aux t v p32 pc (jump_sum_aux_payload t pc pc32 destr)
inline_for_extraction
let read_sum_cases'
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (leaf_reader (dsnd (pc x)))))
(k: sum_key t)
: Tot (leaf_reader (parse_sum_cases' t pc k))
= [@inline_let]
let _ = synth_sum_case_injective t k in
read_synth'
(dsnd (pc k))
(synth_sum_case t k)
(pc32 k)
()
inline_for_extraction
let read_sum_cases_t
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot Type
= leaf_reader (parse_sum_cases' t pc k)
let read_sum_cases_t_eq
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
(x y : read_sum_cases_t t pc k)
: GTot Type0
= True
inline_for_extraction
let read_sum_cases_t_if
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (if_combinator _ (read_sum_cases_t_eq t pc k))
= fun cond (sv_true: cond_true cond -> Tot (read_sum_cases_t t pc k)) (sv_false: cond_false cond -> Tot (read_sum_cases_t t pc k)) #_ #_ input pos ->
if cond
then (sv_true () input pos)
else (sv_false () input pos)
inline_for_extraction
let read_sum_cases
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (leaf_reader (dsnd (pc x)))))
(destr: dep_enum_destr (sum_enum t) (read_sum_cases_t t pc))
(k: sum_key t)
: Tot (leaf_reader (parse_sum_cases' t pc k))
= destr
_
(read_sum_cases_t_if t pc)
(fun _ _ -> ())
(fun _ _ _ _ -> ())
(read_sum_cases' t pc pc32)
k
#push-options "--z3rlimit 32"
inline_for_extraction
let read_sum
(#kt: parser_kind)
(t: sum)
(p: parser kt (sum_repr_type t))
(p32: leaf_reader (parse_enum_key p (sum_enum t)))
(j: jumper p)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (leaf_reader (dsnd (pc x)))))
(destr: dep_enum_destr (sum_enum t) (read_sum_cases_t t pc))
: Tot (leaf_reader (parse_sum t p pc))
=
fun #_ #_ input pos ->
let h = HST.get () in
valid_facts (parse_sum t p pc) h input pos;
parse_sum_eq' t p pc (bytes_of_slice_from h input pos);
valid_facts (parse_enum_key p (sum_enum t)) h input pos;
let k = p32 input pos in
let pos' = jump_enum_key j (sum_enum t) input pos in
valid_facts (parse_sum_cases' t pc k) h input pos' ;
read_sum_cases t pc pc32 destr k input pos'
#pop-options
inline_for_extraction
let serialize32_sum_cases_t
(t: sum)
(#pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(sc: ((x: sum_key t) -> Tot (serializer (dsnd (pc x)))))
(k: sum_key t)
: Tot Type
= serializer32 (serialize_sum_cases t pc sc k)
let serialize32_sum_cases_t_eq
(t: sum)
(#pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(sc: ((x: sum_key t) -> Tot (serializer (dsnd (pc x)))))
(k: sum_key t)
(x y: serialize32_sum_cases_t t sc k)
: GTot Type0
= True
inline_for_extraction
let serialize32_sum_cases_t_if
(t: sum)
(#pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(sc: ((x: sum_key t) -> Tot (serializer (dsnd (pc x)))))
(k: sum_key t)
: Tot (if_combinator _ (serialize32_sum_cases_t_eq t sc k))
= fun cond (sv_true: (cond_true cond -> Tot (serialize32_sum_cases_t t sc k))) (sv_false: (cond_false cond -> Tot (serialize32_sum_cases_t t sc k))) x #rrel #rel b pos ->
if cond
then (sv_true () x b pos)
else (sv_false () x b pos)
inline_for_extraction
let serialize32_sum_cases_aux
(t: sum)
(#pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(sc: ((x: sum_key t) -> Tot (serializer (dsnd (pc x)))))
(sc32: ((x: sum_key t) -> Tot (serializer32 (sc x))))
(k: sum_key t)
: Tot (serializer32 (serialize_sum_cases t pc sc k))
= fun x #rrel #rel b pos ->
[@inline_let] let _ =
Classical.forall_intro (parse_sum_cases_eq' t pc k);
synth_sum_case_injective t k;
synth_sum_case_inverse t k
in
serialize32_synth
(sc32 k)
(synth_sum_case t k)
(synth_sum_case_recip t k)
(fun x -> synth_sum_case_recip t k x)
()
x
b
pos
inline_for_extraction
let serialize32_sum_cases
(t: sum)
(#pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(sc: ((x: sum_key t) -> Tot (serializer (dsnd (pc x)))))
(sc32: ((x: sum_key t) -> Tot (serializer32 (sc x))))
(destr: dep_enum_destr (sum_enum t) (serialize32_sum_cases_t t sc))
(k: sum_key t)
: Tot (serializer32 (serialize_sum_cases t pc sc k))
= destr
_
(serialize32_sum_cases_t_if t sc)
(fun _ _ -> ())
(fun _ _ _ _ -> ())
(serialize32_sum_cases_aux t sc sc32)
k
inline_for_extraction
let serialize32_sum
(#kt: parser_kind)
(t: sum)
(#p: parser kt (sum_repr_type t))
(s: serializer p {kt.parser_kind_subkind == Some ParserStrong})
(s32: serializer32 (serialize_enum_key _ s (sum_enum t)))
(#pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(sc: ((x: sum_key t) -> Tot (serializer (dsnd (pc x)))))
(sc32: ((x: sum_key t) -> Tot (serializer32 (sc x))))
(destr: dep_enum_destr (sum_enum t) (serialize32_sum_cases_t t sc))
: Tot (serializer32 (serialize_sum t s sc))
= fun x #rrel #rel b pos ->
serialize_sum_eq t s sc x;
let tg = sum_tag_of_data t x in
serialize32_nondep_then_aux s32 (serialize32_sum_cases t sc sc32 destr tg) tg x b pos
let clens_sum_tag
(s: sum)
: Tot (clens (sum_type s) (sum_key s))
= {
clens_cond = (fun _ -> True);
clens_get = sum_tag_of_data s;
}
let gaccessor_sum_tag
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
: Tot (gaccessor (parse_sum t p pc) (parse_enum_key p (sum_enum t)) (clens_sum_tag t))
= gaccessor_tagged_union_tag
(parse_enum_key p (sum_enum t))
(sum_tag_of_data t)
(parse_sum_cases t pc)
inline_for_extraction
let accessor_sum_tag
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
: Tot (accessor (gaccessor_sum_tag t p pc))
= accessor_tagged_union_tag
(parse_enum_key p (sum_enum t))
(sum_tag_of_data t)
(parse_sum_cases t pc)
let clens_sum_payload
(s: sum)
(k: sum_key s)
: Tot (clens (sum_type s) (sum_type_of_tag s k))
= {
clens_cond = (fun (x: sum_type s) -> sum_tag_of_data s x == k);
clens_get = (fun (x: sum_type s) -> synth_sum_case_recip s k x <: Ghost (sum_type_of_tag s k) (requires (sum_tag_of_data s x == k)) (ensures (fun _ -> True)));
}
#push-options "--z3rlimit 32"
let gaccessor_clens_sum_payload'
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (gaccessor' (parse_sum t p pc) (dsnd (pc k)) (clens_sum_payload t k))
= fun (input: bytes) ->
parse_sum_eq'' t p pc input;
let res =
match parse p input with
| Some (_, consumed) ->
synth_sum_case_inverse t k;
synth_sum_case_injective t k;
synth_injective_synth_inverse_synth_inverse_recip (synth_sum_case t k) (synth_sum_case_recip t k) ();
(consumed)
| _ -> 0 // dummy
in
(res <: (res: _ { gaccessor_post' (parse_sum t p pc) (dsnd (pc k)) (clens_sum_payload t k) input res } ))
#push-options "--z3rlimit 64"
let gaccessor_clens_sum_payload_injective
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
(sl sl' : bytes)
: Lemma
(requires (
gaccessor_pre (parse_sum t p pc) (dsnd (pc k)) (clens_sum_payload t k) sl /\
gaccessor_pre (parse_sum t p pc) (dsnd (pc k)) (clens_sum_payload t k) sl' /\
injective_precond (parse_sum t p pc) sl sl'
))
(ensures (gaccessor_clens_sum_payload' t p pc k sl == gaccessor_clens_sum_payload' t p pc k sl'))
= parse_sum_eq'' t p pc sl;
parse_sum_eq'' t p pc sl' ;
parse_injective (parse_sum t p pc) sl sl' ;
parse_injective p sl sl'
#pop-options
let gaccessor_clens_sum_payload_no_lookahead
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
(sl sl' : bytes)
: Lemma
(requires (
(parse_sum_kind kt t pc).parser_kind_subkind == Some ParserStrong /\
gaccessor_pre (parse_sum t p pc) (dsnd (pc k)) (clens_sum_payload t k) sl /\
gaccessor_pre (parse_sum t p pc) (dsnd (pc k)) (clens_sum_payload t k) sl' /\
no_lookahead_on_precond (parse_sum t p pc) sl sl'
))
(ensures (gaccessor_clens_sum_payload' t p pc k sl == gaccessor_clens_sum_payload' t p pc k sl'))
= parse_sum_eq'' t p pc sl;
parse_sum_eq'' t p pc sl' ;
parse_strong_prefix (parse_sum t p pc) sl sl' ;
parse_injective p sl sl'
let gaccessor_clens_sum_payload
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (gaccessor (parse_sum t p pc) (dsnd (pc k)) (clens_sum_payload t k))
= Classical.forall_intro_2 (fun x -> Classical.move_requires (gaccessor_clens_sum_payload_injective t p pc k x));
Classical.forall_intro_2 (fun x -> Classical.move_requires (gaccessor_clens_sum_payload_no_lookahead t p pc k x));
gaccessor_prop_equiv (parse_sum t p pc) (dsnd (pc k)) (clens_sum_payload t k) (gaccessor_clens_sum_payload' t p pc k);
gaccessor_clens_sum_payload' t p pc k
inline_for_extraction
let accessor_clens_sum_payload'
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(j: jumper p)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: HST.Stack U32.t
(requires (fun h ->
valid (parse_sum t p pc) h input pos /\
(clens_sum_payload t k).clens_cond (contents (parse_sum t p pc) h input pos)
))
(ensures (fun h pos' h' ->
B.modifies B.loc_none h h' /\
pos' == slice_access h (gaccessor_clens_sum_payload t p pc k) input pos
))
=
let h = HST.get () in
[@inline_let]
let _ =
let pos' = get_valid_pos (parse_sum t p pc) h input pos in
let large = bytes_of_slice_from h input pos in
slice_access_eq h (gaccessor_clens_sum_payload t p pc k) input pos;
valid_facts (parse_sum t p pc) h input pos;
parse_sum_eq'' t p pc large;
valid_facts p h input pos
in
j input pos
#pop-options
inline_for_extraction
let accessor_clens_sum_payload
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(j: jumper p)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (accessor (gaccessor_clens_sum_payload t p pc k))
= fun #rrel #rel -> accessor_clens_sum_payload' t j pc k #rrel #rel
let clens_sum_cases_payload
(s: sum)
(k: sum_key s)
: Tot (clens (sum_cases s k) (sum_type_of_tag s k))
= {
clens_cond = (fun (x: sum_cases s k) -> True);
clens_get = (fun (x: sum_cases s k) -> synth_sum_case_recip s k x <: Ghost (sum_type_of_tag s k) (requires (True)) (ensures (fun _ -> True)));
}
let gaccessor_clens_sum_cases_payload
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (gaccessor (parse_sum_cases' t pc k) (dsnd (pc k)) (clens_sum_cases_payload t k))
= synth_sum_case_injective t k;
synth_sum_case_inverse t k;
synth_injective_synth_inverse_synth_inverse_recip (synth_sum_case t k) (synth_sum_case_recip t k) ();
gaccessor_ext
(gaccessor_synth (dsnd (pc k)) (synth_sum_case t k) (synth_sum_case_recip t k) ())
(clens_sum_cases_payload t k)
()
inline_for_extraction
let accessor_clens_sum_cases_payload
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (accessor (gaccessor_clens_sum_cases_payload t pc k))
= [@inline_let]
let _ =
synth_sum_case_injective t k;
synth_sum_case_inverse t k;
synth_injective_synth_inverse_synth_inverse_recip (synth_sum_case t k) (synth_sum_case_recip t k) ()
in
accessor_ext
(accessor_synth (dsnd (pc k)) (synth_sum_case t k) (synth_sum_case_recip t k) ())
(clens_sum_cases_payload t k)
()
inline_for_extraction
let validate_dsum_cases_t
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(#k: parser_kind)
(g: parser k (dsum_type_of_unknown_tag s))
(x: dsum_key s)
: Tot Type
= validator (parse_dsum_cases' s f g x)
let validate_dsum_cases_eq
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(#k: parser_kind)
(g: parser k (dsum_type_of_unknown_tag s))
(x: dsum_key s)
(v1 v2 : validate_dsum_cases_t s f g x)
: GTot Type0
= True
inline_for_extraction
let validate_dsum_cases_if'
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(#k: parser_kind)
(g: parser k (dsum_type_of_unknown_tag s))
(x: dsum_key s)
(cond: bool)
(ift: (cond_true cond -> Tot (validate_dsum_cases_t s f g x)))
(iff: (cond_false cond -> Tot (validate_dsum_cases_t s f g x)))
: Tot (validate_dsum_cases_t s f g x)
= fun #rrel #rel input len ->
if cond
then (ift () <: validate_dsum_cases_t s f g x) input len
else (iff () <: validate_dsum_cases_t s f g x) input len
inline_for_extraction
let validate_dsum_cases_if
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(#k: parser_kind)
(g: parser k (dsum_type_of_unknown_tag s))
(x: dsum_key s)
: Tot (if_combinator _ (validate_dsum_cases_eq s f g x))
= validate_dsum_cases_if' s f g x
inline_for_extraction
let validate_dsum_cases'
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(f' : (x: dsum_known_key s) -> Tot (validator (dsnd (f x))))
(#k: parser_kind)
(#g: parser k (dsum_type_of_unknown_tag s))
(g' : validator g)
(x: dsum_key s)
: Tot (validate_dsum_cases_t s f g x)
= [@inline_let]
let _ = synth_dsum_case_injective s x in
match x with
| Known x' -> validate_synth (f' x') (synth_dsum_case s (Known x')) () <: validator (parse_dsum_cases' s f g x)
| Unknown x' -> validate_synth g' (synth_dsum_case s (Unknown x')) () <: validator (parse_dsum_cases' s f g x)
inline_for_extraction
let validate_dsum_cases'_destr
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(f' : (x: dsum_known_key s) -> Tot (validator (dsnd (f x))))
(#k: parser_kind)
(#g: parser k (dsum_type_of_unknown_tag s))
(g' : validator g)
(destr: dep_enum_destr _ (fun k -> validate_dsum_cases_t s f g (Known k)))
(x: dsum_key s)
: Tot (validate_dsum_cases_t s f g x)
= fun #rrel #rel input pos ->
match x with
| Known k ->
destr
_
(fun k -> validate_dsum_cases_if s f g (Known k))
(fun _ _ -> ())
(fun _ _ _ _ -> ())
(fun k -> validate_dsum_cases' s f f' g' (Known k))
k
input
pos
| Unknown r -> validate_dsum_cases' s f f' g' (Unknown r) input pos
inline_for_extraction
let validate_dsum_cases
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(f' : (x: dsum_known_key s) -> Tot (validator (dsnd (f x))))
(#k: parser_kind)
(#g: parser k (dsum_type_of_unknown_tag s))
(g' : validator g)
(destr: dep_enum_destr _ (fun k -> validate_dsum_cases_t s f g (Known k)))
(x: dsum_key s)
: Tot (validator (parse_dsum_cases s f g x))
= fun #rrel #rel input pos ->
let h = HST.get () in
[@inline_let]
let _ =
valid_facts (parse_dsum_cases' s f g x) h input (uint64_to_uint32 pos);
valid_facts (parse_dsum_cases s f g x) h input (uint64_to_uint32 pos);
parse_dsum_cases_eq' s f g x (bytes_of_slice_from h input (uint64_to_uint32 pos))
in
validate_dsum_cases'_destr s f f' g' destr x input pos
#push-options "--z3rlimit 40"
inline_for_extraction
let validate_dsum
(#kt: parser_kind)
(t: dsum)
(#p: parser kt (dsum_repr_type t))
(v: validator p)
(p32: leaf_reader p)
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(f32: (x: dsum_known_key t) -> Tot (validator (dsnd (f x))))
(#k': parser_kind)
(#g: parser k' (dsum_type_of_unknown_tag t))
(g32: validator g)
(destr: dep_maybe_enum_destr_t (dsum_enum t) (validate_dsum_cases_t t f g))
: Tot (validator (parse_dsum t p f g))
= fun #rrel #rel input pos ->
let h = HST.get () in
[@inline_let]
let _ = parse_dsum_eq' t p f g (bytes_of_slice_from h input (uint64_to_uint32 pos)) in
[@inline_let]
let _ = valid_facts (parse_dsum t p f g) h input (uint64_to_uint32 pos) in
[@inline_let]
let _ = valid_facts p h input (uint64_to_uint32 pos) in
let pos_after_tag = v input pos in
if is_error pos_after_tag
then pos_after_tag
else
let tg = p32 input (uint64_to_uint32 pos) in
[@inline_let]
let _ = valid_facts (parse_dsum_cases' t f g (maybe_enum_key_of_repr (dsum_enum t) tg)) h input (uint64_to_uint32 pos_after_tag) in
destr (validate_dsum_cases_eq t f g) (validate_dsum_cases_if t f g) (fun _ _ -> ()) (fun _ _ _ _ -> ()) (validate_dsum_cases' t f f32 g32) tg input pos_after_tag
#pop-options
#reset-options "--z3rlimit 64 --z3cliopt smt.arith.nl=false --initial_ifuel 8 --max_ifuel 8 --initial_fuel 2 --max_fuel 2"
let valid_dsum_intro_known
(h: HS.mem)
(t: dsum)
(#kt: parser_kind)
(p: parser kt (dsum_repr_type t))
(f: ((x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x))))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: Lemma
(requires (
valid (parse_maybe_enum_key p (dsum_enum t)) h input pos /\ (
let k' = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
Known? k' /\ (
let Known k = k' in
valid (dsnd (f k)) h input (get_valid_pos (parse_maybe_enum_key p (dsum_enum t)) h input pos)
))))
(ensures (
let Known k = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
let pos_payload = get_valid_pos (parse_maybe_enum_key p (dsum_enum t)) h input pos in
valid_content_pos
(parse_dsum t p f g) h input pos
(synth_dsum_case t (Known k) (contents (dsnd (f k)) h input pos_payload))
(get_valid_pos (dsnd (f k)) h input pos_payload)
))
= valid_facts (parse_maybe_enum_key p (dsum_enum t)) h input pos;
let Known k = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
let pos_payload = get_valid_pos (parse_maybe_enum_key p (dsum_enum t)) h input pos in
valid_facts (dsnd (f k)) h input pos_payload;
valid_facts (parse_dsum t p f g) h input pos;
parse_dsum_eq t p f g (bytes_of_slice_from h input pos)
let valid_dsum_intro_unknown
(h: HS.mem)
(t: dsum)
(#kt: parser_kind)
(p: parser kt (dsum_repr_type t))
(f: ((x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x))))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: Lemma
(requires (
valid (parse_maybe_enum_key p (dsum_enum t)) h input pos /\ (
let k' = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
Unknown? k' /\
valid g h input (get_valid_pos (parse_maybe_enum_key p (dsum_enum t)) h input pos)
)))
(ensures (
let Unknown r = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
let pos_payload = get_valid_pos (parse_maybe_enum_key p (dsum_enum t)) h input pos in
valid_content_pos
(parse_dsum t p f g) h input pos
(synth_dsum_case t (Unknown r) (contents g h input pos_payload))
(get_valid_pos g h input pos_payload)
))
= valid_facts (parse_maybe_enum_key p (dsum_enum t)) h input pos;
let Unknown r = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
let pos_payload = get_valid_pos (parse_maybe_enum_key p (dsum_enum t)) h input pos in
valid_facts g h input pos_payload;
valid_facts (parse_dsum t p f g) h input pos;
parse_dsum_eq t p f g (bytes_of_slice_from h input pos)
#reset-options
inline_for_extraction
let finalize_dsum_case_known
(t: dsum)
(#kt: parser_kind)
(#p: parser kt (dsum_repr_type t))
(s: serializer p)
(w: leaf_writer_strong s)
(f: ((x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x))))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
(destr: enum_repr_of_key'_t (dsum_enum t))
(k: dsum_known_key t)
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: HST.Stack unit
(requires (fun h ->
let len_tag = serialized_length (serialize_enum_key _ s (dsum_enum t)) k in
U32.v pos + len_tag < 4294967296 /\ (
let pos_payload = pos `U32.add` U32.uint_to_t len_tag in
valid (dsnd (f k)) h input pos_payload /\
writable input.base (U32.v pos) (U32.v pos_payload) h
)))
(ensures (fun h _ h' ->
let len_tag = serialized_length (serialize_enum_key _ s (dsum_enum t)) k in
let pos_payload = pos `U32.add` U32.uint_to_t len_tag in
B.modifies (loc_slice_from_to input pos pos_payload) h h' /\
valid_content_pos (parse_dsum t p f g) h' input pos (synth_dsum_case t (Known k) (contents (dsnd (f k)) h input pos_payload)) (get_valid_pos (dsnd (f k)) h input pos_payload)
))
= let pos1 = write_enum_key w (dsum_enum t) destr k input pos in
let h = HST.get () in
[@inline_let]
let _ =
valid_facts (parse_enum_key p (dsum_enum t)) h input pos;
valid_facts (parse_maybe_enum_key p (dsum_enum t)) h input pos;
let sq = bytes_of_slice_from h input pos in
parse_enum_key_eq p (dsum_enum t) sq;
parse_maybe_enum_key_eq p (dsum_enum t) sq;
valid_dsum_intro_known h t p f g input pos
in
()
inline_for_extraction
let finalize_dsum_case_unknown
(t: dsum)
(#kt: parser_kind)
(#p: parser kt (dsum_repr_type t))
(s: serializer p)
(w: leaf_writer_strong s)
(f: ((x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x))))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
(r: unknown_enum_repr (dsum_enum t))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: HST.Stack unit
(requires (fun h ->
let len_tag = serialized_length s r in
U32.v pos + len_tag < 4294967296 /\ (
let pos_payload = pos `U32.add` U32.uint_to_t len_tag in
valid g h input pos_payload /\
writable input.base (U32.v pos) (U32.v pos_payload) h
)))
(ensures (fun h _ h' ->
let len_tag = serialized_length s r in
let pos_payload = pos `U32.add` U32.uint_to_t len_tag in
B.modifies (loc_slice_from_to input pos pos_payload) h h' /\
valid_content_pos (parse_dsum t p f g) h' input pos (synth_dsum_case t (Unknown r) (contents g h input pos_payload)) (get_valid_pos g h input pos_payload)
))
= let pos1 = w r input pos in
let h = HST.get () in
[@inline_let]
let _ =
valid_facts (parse_maybe_enum_key p (dsum_enum t)) h input pos;
valid_facts p h input pos;
let sq = bytes_of_slice_from h input pos in
parse_maybe_enum_key_eq p (dsum_enum t) sq;
valid_dsum_intro_unknown h t p f g input pos
in
()
let valid_dsum_elim_tag
(h: HS.mem)
(t: dsum)
(#kt: parser_kind)
(p: parser kt (dsum_repr_type t))
(f: ((x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x))))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: Lemma
(requires (
valid (parse_dsum t p f g) h input pos
))
(ensures (
valid (parse_maybe_enum_key p (dsum_enum t)) h input pos /\
contents (parse_maybe_enum_key p (dsum_enum t)) h input pos == dsum_tag_of_data t (contents (parse_dsum t p f g) h input pos)
))
= let _ = parse_dsum_eq_ t p f g (bytes_of_slice_from h input pos) in
let _ = valid_facts (parse_dsum t p f g) h input pos in
let _ = valid_facts (parse_maybe_enum_key p (dsum_enum t)) h input pos in
()
inline_for_extraction
let read_dsum_tag
(t: dsum)
(#kt: parser_kind)
(#p: parser kt (dsum_repr_type t))
(p32: leaf_reader p)
(destr: maybe_enum_destr_t (maybe_enum_key (dsum_enum t)) (dsum_enum t))
(f: ((x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x))))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: HST.Stack (dsum_key t)
(requires (fun h ->
valid (parse_dsum t p f g) h input pos
))
(ensures (fun h res h' ->
B.modifies B.loc_none h h' /\
res == dsum_tag_of_data t (contents (parse_dsum t p f g) h input pos)
))
= let h = HST.get () in
[@inline_let] let _ = valid_dsum_elim_tag h t p f g input pos in
read_maybe_enum_key p32 (dsum_enum t) destr input pos
#push-options "--z3rlimit 32"
let valid_dsum_elim_known
(h: HS.mem)
(t: dsum)
(#kt: parser_kind)
(p: parser kt (dsum_repr_type t))
(f: ((x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x))))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: Lemma
(requires (
valid (parse_dsum t p f g) h input pos /\
Known? (dsum_tag_of_data t (contents (parse_dsum t p f g) h input pos))
))
(ensures (
valid (parse_maybe_enum_key p (dsum_enum t)) h input pos /\ (
let k' = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
let pos_payload = get_valid_pos (parse_maybe_enum_key p (dsum_enum t)) h input pos in
Known? k' /\ (
let Known k = k' in
valid (dsnd (f k)) h input pos_payload /\
valid_content_pos
(parse_dsum t p f g) h input pos
(synth_dsum_case t (Known k) (contents (dsnd (f k)) h input pos_payload))
(get_valid_pos (dsnd (f k)) h input pos_payload)
))))
=
valid_facts (parse_dsum t p f g) h input pos;
parse_dsum_eq t p f g (bytes_of_slice_from h input pos);
valid_facts (parse_maybe_enum_key p (dsum_enum t)) h input pos;
let Known k = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
let pos_payload = get_valid_pos (parse_maybe_enum_key p (dsum_enum t)) h input pos in
valid_facts (dsnd (f k)) h input pos_payload
#pop-options
let valid_dsum_elim_unknown
(h: HS.mem)
(t: dsum)
(#kt: parser_kind)
(p: parser kt (dsum_repr_type t))
(f: ((x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x))))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: Lemma
(requires (
valid (parse_dsum t p f g) h input pos /\
Unknown? (dsum_tag_of_data t (contents (parse_dsum t p f g) h input pos))
))
(ensures (
valid (parse_maybe_enum_key p (dsum_enum t)) h input pos /\ (
let k' = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
let pos_payload = get_valid_pos (parse_maybe_enum_key p (dsum_enum t)) h input pos in
Unknown? k' /\ (
let Unknown r = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
valid g h input pos_payload /\
valid_content_pos
(parse_dsum t p f g) h input pos
(synth_dsum_case t (Unknown r) (contents g h input pos_payload))
(get_valid_pos g h input pos_payload)
))))
=
valid_facts (parse_dsum t p f g) h input pos;
parse_dsum_eq t p f g (bytes_of_slice_from h input pos);
valid_facts (parse_maybe_enum_key p (dsum_enum t)) h input pos;
let Unknown r = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
let pos_payload = get_valid_pos (parse_maybe_enum_key p (dsum_enum t)) h input pos in
valid_facts g h input pos_payload
inline_for_extraction
let jump_dsum_cases_t
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(#k: parser_kind)
(g: parser k (dsum_type_of_unknown_tag s))
(x: dsum_key s)
: Tot Type
= jumper (parse_dsum_cases' s f g x)
let jump_dsum_cases_eq
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(#k: parser_kind)
(g: parser k (dsum_type_of_unknown_tag s))
(x: dsum_key s)
(v1 v2 : jump_dsum_cases_t s f g x)
: GTot Type0
= True
inline_for_extraction
let jump_dsum_cases_if'
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(#k: parser_kind)
(g: parser k (dsum_type_of_unknown_tag s))
(x: dsum_key s)
(cond: bool)
(ift: (cond_true cond -> Tot (jump_dsum_cases_t s f g x)))
(iff: (cond_false cond -> Tot (jump_dsum_cases_t s f g x)))
: Tot (jump_dsum_cases_t s f g x)
= fun #rrel #rel input len ->
if cond
then (ift () <: jump_dsum_cases_t s f g x) input len
else (iff () <: jump_dsum_cases_t s f g x) input len
inline_for_extraction
let jump_dsum_cases_if
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(#k: parser_kind)
(g: parser k (dsum_type_of_unknown_tag s))
(x: dsum_key s)
: Tot (if_combinator _ (jump_dsum_cases_eq s f g x))
= jump_dsum_cases_if' s f g x
inline_for_extraction
let jump_dsum_cases'
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(f' : (x: dsum_known_key s) -> Tot (jumper (dsnd (f x))))
(#k: parser_kind)
(#g: parser k (dsum_type_of_unknown_tag s))
(g' : jumper g)
(x: dsum_key s)
: Tot (jump_dsum_cases_t s f g x)
= synth_dsum_case_injective s x;
match x with
| Known x' -> jump_synth (f' x') (synth_dsum_case s (Known x')) () <: jumper (parse_dsum_cases' s f g x)
| Unknown x' -> jump_synth g' (synth_dsum_case s (Unknown x')) () <: jumper (parse_dsum_cases' s f g x)
inline_for_extraction
let jump_dsum_cases'_destr
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(f' : (x: dsum_known_key s) -> Tot (jumper (dsnd (f x))))
(#k: parser_kind)
(#g: parser k (dsum_type_of_unknown_tag s))
(g' : jumper g)
(destr: dep_enum_destr _ (fun k -> jump_dsum_cases_t s f g (Known k)))
(x: dsum_key s)
: Tot (jump_dsum_cases_t s f g x)
= fun #rrel #rel input pos ->
match x with
| Known k ->
destr
_
(fun k -> jump_dsum_cases_if s f g (Known k))
(fun _ _ -> ())
(fun _ _ _ _ -> ())
(fun k -> jump_dsum_cases' s f f' g' (Known k))
k
input
pos
| Unknown r -> jump_dsum_cases' s f f' g' (Unknown r) input pos
inline_for_extraction
let jump_dsum_cases
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(f' : (x: dsum_known_key s) -> Tot (jumper (dsnd (f x))))
(#k: parser_kind)
(#g: parser k (dsum_type_of_unknown_tag s))
(g' : jumper g)
(destr: dep_enum_destr _ (fun k -> jump_dsum_cases_t s f g (Known k)))
(x: dsum_key s)
: Tot (jumper (parse_dsum_cases s f g x))
= fun #rrel #rel input pos ->
let h = HST.get () in
[@inline_let]
let _ =
valid_facts (parse_dsum_cases' s f g x) h input pos;
valid_facts (parse_dsum_cases s f g x) h input pos;
parse_dsum_cases_eq' s f g x (bytes_of_slice_from h input pos)
in
jump_dsum_cases'_destr s f f' g' destr x input pos
#push-options "--z3rlimit 16"
inline_for_extraction
let jump_dsum
(#kt: parser_kind)
(t: dsum)
(#p: parser kt (dsum_repr_type t))
(v: jumper p)
(p32: leaf_reader p)
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(f32: (x: dsum_known_key t) -> Tot (jumper (dsnd (f x))))
(#k': parser_kind)
(#g: parser k' (dsum_type_of_unknown_tag t))
(g32: jumper g)
(destr: dep_maybe_enum_destr_t (dsum_enum t) (jump_dsum_cases_t t f g))
: Tot (jumper (parse_dsum t p f g))
= fun #rrel #rel input pos ->
let h = HST.get () in
[@inline_let]
let _ = parse_dsum_eq' t p f g (bytes_of_slice_from h input pos) in
[@inline_let]
let _ = valid_facts (parse_dsum t p f g) h input pos in
[@inline_let]
let _ = valid_facts p h input pos in
let pos_after_tag = v input pos in
let tg = p32 input pos in
[@inline_let]
let _ = valid_facts (parse_dsum_cases' t f g (maybe_enum_key_of_repr (dsum_enum t) tg)) h input pos_after_tag in
destr (jump_dsum_cases_eq t f g) (jump_dsum_cases_if t f g) (fun _ _ -> ()) (fun _ _ _ _ -> ()) (jump_dsum_cases' t f f32 g32) tg input pos_after_tag
#pop-options
inline_for_extraction
let read_dsum_cases'
(t: dsum)
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(f32: (x: dsum_known_key t) -> Tot (leaf_reader (dsnd (f x))))
(#k': parser_kind)
(g: parser k' (dsum_type_of_unknown_tag t))
(g32: leaf_reader g)
(x: dsum_key t)
: Tot (leaf_reader (parse_dsum_cases' t f g x))
= fun #rrel #rel input pos ->
[@inline_let]
let _ = synth_dsum_case_injective t x in
match x with
| Known x' ->
read_synth'
(dsnd (f x'))
(synth_dsum_case t (Known x'))
(f32 x')
()
input
pos
| Unknown x' ->
read_synth'
g
(synth_dsum_case t (Unknown x'))
g32
()
input
pos
inline_for_extraction
let read_dsum_cases_t
(t: dsum)
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(#k': parser_kind)
(g: parser k' (dsum_type_of_unknown_tag t))
(k: dsum_known_key t)
: Tot Type
= leaf_reader (parse_dsum_cases' t f g (Known k))
let read_dsum_cases_t_eq
(t: dsum)
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(#k': parser_kind)
(g: parser k' (dsum_type_of_unknown_tag t))
(k: dsum_known_key t)
(x y : read_dsum_cases_t t f g k)
: GTot Type0
= True
inline_for_extraction
let read_dsum_cases_t_if
(t: dsum)
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(#k': parser_kind)
(g: parser k' (dsum_type_of_unknown_tag t))
(k: dsum_known_key t)
: Tot (if_combinator _ (read_dsum_cases_t_eq t f g k))
= fun cond (sv_true: cond_true cond -> Tot (read_dsum_cases_t t f g k)) (sv_false: cond_false cond -> Tot (read_dsum_cases_t t f g k)) #_ #_ input pos ->
if cond
then sv_true () input pos
else sv_false () input pos
inline_for_extraction
let read_dsum_cases
(t: dsum)
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(f32: (x: dsum_known_key t) -> Tot (leaf_reader (dsnd (f x))))
(#k': parser_kind)
(g: parser k' (dsum_type_of_unknown_tag t))
(g32: leaf_reader g)
(destr: dep_enum_destr _ (read_dsum_cases_t t f g))
(x: dsum_key t)
: Tot (leaf_reader (parse_dsum_cases' t f g x))
= fun #_ #_ input pos ->
match x with
| Known k ->
destr
_
(read_dsum_cases_t_if t f g)
(fun _ _ -> ())
(fun _ _ _ _ -> ())
(fun k -> read_dsum_cases' t f f32 g g32 (Known k))
k
input
pos
| Unknown r ->
read_dsum_cases' t f f32 g g32 (Unknown r) input pos
#push-options "--z3rlimit 16"
inline_for_extraction
let read_dsum
(#kt: parser_kind)
(t: dsum)
(#p: parser kt (dsum_repr_type t))
(p32: leaf_reader (parse_maybe_enum_key p (dsum_enum t)))
(j: jumper p)
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(f32: (x: dsum_known_key t) -> Tot (leaf_reader (dsnd (f x))))
(#k': parser_kind)
(#g: parser k' (dsum_type_of_unknown_tag t))
(g32: leaf_reader g)
(destr: dep_enum_destr _ (read_dsum_cases_t t f g))
: Tot (leaf_reader (parse_dsum t p f g))
= fun #_ #_ input pos ->
let h = HST.get () in
valid_facts (parse_dsum t p f g) h input pos;
parse_dsum_eq_ t p f g (bytes_of_slice_from h input pos);
valid_facts (parse_maybe_enum_key p (dsum_enum t)) h input pos;
let k = p32 input pos in
let pos' = jump_maybe_enum_key j (dsum_enum t) input pos in
valid_facts (parse_dsum_cases' t f g k) h input pos' ;
read_dsum_cases t f f32 g g32 destr k input pos'
#pop-options
inline_for_extraction
let serialize32_dsum_type_of_tag
(t: dsum)
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(sf: (x: dsum_known_key t) -> Tot (serializer (dsnd (f x))))
(sf32: (x: dsum_known_key t) -> Tot (serializer32 (sf x)))
(#k': parser_kind)
(#g: parser k' (dsum_type_of_unknown_tag t))
(#sg: serializer g)
(sg32: serializer32 sg)
(tg: dsum_key t)
: Tot (serializer32 (serialize_dsum_type_of_tag t f sf g sg tg))
= match tg with
| Known x' -> serialize32_ext (dsnd (f x')) (sf x') (sf32 x') (parse_dsum_type_of_tag t f g tg) ()
| Unknown x' -> serialize32_ext g sg sg32 (parse_dsum_type_of_tag t f g tg) ()
inline_for_extraction
let serialize32_dsum_cases_aux
(t: dsum)
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(sf: (x: dsum_known_key t) -> Tot (serializer (dsnd (f x))))
(sf32: (x: dsum_known_key t) -> Tot (serializer32 (sf x)))
(#k': parser_kind)
(#g: parser k' (dsum_type_of_unknown_tag t))
(#sg: serializer g)
(sg32: serializer32 sg)
(tg: dsum_key t)
: Tot (serializer32 (serialize_dsum_cases t f sf g sg tg))
= [@inline_let]
let _ = synth_dsum_case_injective t tg in
[@inline_let]
let _ = synth_dsum_case_inverse t tg in
serialize32_synth
(serialize32_dsum_type_of_tag t f sf sf32 sg32 tg)
(synth_dsum_case t tg)
(synth_dsum_case_recip t tg)
(fun x -> synth_dsum_case_recip t tg x)
()
inline_for_extraction
let serialize32_dsum_cases_t
(t: dsum)
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(sf: (x: dsum_known_key t) -> Tot (serializer (dsnd (f x))))
(#k': parser_kind)
(g: parser k' (dsum_type_of_unknown_tag t))
(sg: serializer g)
(k: dsum_known_key t)
: Tot Type
= serializer32 (serialize_dsum_cases t f sf g sg (Known k))
let serialize32_dsum_cases_t_eq
(t: dsum)
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(sf: (x: dsum_known_key t) -> Tot (serializer (dsnd (f x))))
(#k': parser_kind)
(g: parser k' (dsum_type_of_unknown_tag t))
(sg: serializer g)
(k: dsum_known_key t)
(x y: serialize32_dsum_cases_t t f sf g sg k)
: GTot Type0
= True
inline_for_extraction
let serialize32_dsum_cases_t_if
(t: dsum)
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(sf: (x: dsum_known_key t) -> Tot (serializer (dsnd (f x))))
(#k': parser_kind)
(g: parser k' (dsum_type_of_unknown_tag t))
(sg: serializer g)
(k: dsum_known_key t)
: Tot (if_combinator _ (serialize32_dsum_cases_t_eq t f sf g sg k))
= fun cond (sv_true: (cond_true cond -> Tot (serialize32_dsum_cases_t t f sf g sg k))) (sv_false: (cond_false cond -> Tot (serialize32_dsum_cases_t t f sf g sg k))) x #rrel #rel output pos ->
if cond
then (sv_true () x output pos)
else (sv_false () x output pos)
inline_for_extraction
let serialize32_dsum_cases
(t: dsum)
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(sf: (x: dsum_known_key t) -> Tot (serializer (dsnd (f x))))
(sf32: (x: dsum_known_key t) -> Tot (serializer32 (sf x)))
(#k': parser_kind)
(#g: parser k' (dsum_type_of_unknown_tag t))
(#sg: serializer g)
(sg32: serializer32 sg)
(destr: dep_enum_destr _ (serialize32_dsum_cases_t t f sf g sg))
(tg: dsum_key t)
: Tot (serializer32 (serialize_dsum_cases t f sf g sg tg))
= fun x #rrel #rel output pos ->
match tg with
| Known k ->
destr
_
(serialize32_dsum_cases_t_if t f sf g sg)
(fun _ _ -> ())
(fun _ _ _ _ -> ())
(fun k -> serialize32_dsum_cases_aux t f sf sf32 sg32 (Known k))
k
x
output
pos
| Unknown r ->
serialize32_dsum_cases_aux t f sf sf32 sg32 (Unknown r) x output pos
inline_for_extraction
let serialize32_dsum
(#kt: parser_kind)
(t: dsum)
(#p: parser kt (dsum_repr_type t))
(s: serializer p {kt.parser_kind_subkind == Some ParserStrong})
(s32: serializer32 (serialize_maybe_enum_key _ s (dsum_enum t)))
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(sf: (x: dsum_known_key t) -> Tot (serializer (dsnd (f x))))
(sf32: (x: dsum_known_key t) -> Tot (serializer32 (sf x)))
(#k': parser_kind)
(#g: parser k' (dsum_type_of_unknown_tag t))
(#sg: serializer g)
(sg32: serializer32 sg)
(destr: dep_enum_destr _ (serialize32_dsum_cases_t t f sf g sg))
: Tot (serializer32 (serialize_dsum t s f sf g sg))
= fun x #_ #_ output pos ->
[@inline_let]
let _ = serialize_dsum_eq' t s f sf g sg x in
let tg = dsum_tag_of_data t x in
serialize32_nondep_then_aux
s32
(serialize32_dsum_cases t f sf sf32 sg32 destr tg)
tg
x
output
pos
let clens_dsum_tag
(s: dsum)
: Tot (clens (dsum_type s) (dsum_key s))
= {
clens_cond = (fun _ -> True);
clens_get = dsum_tag_of_data s;
}
let gaccessor_dsum_tag
(#kt: parser_kind)
(t: dsum)
(p: parser kt (dsum_repr_type t))
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
: Tot (gaccessor (parse_dsum t p f g) (parse_maybe_enum_key p (dsum_enum t)) (clens_dsum_tag t))
= gaccessor_tagged_union_tag
(parse_maybe_enum_key p (dsum_enum t))
(dsum_tag_of_data t)
(parse_dsum_cases t f g) | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"LowStar.Buffer.fst.checked",
"LowParse.Spec.Sum.fst.checked",
"LowParse.Low.Enum.fst.checked",
"FStar.UInt64.fsti.checked",
"FStar.UInt32.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Int.Cast.fst.checked",
"FStar.HyperStack.ST.fsti.checked",
"FStar.HyperStack.fst.checked",
"FStar.Classical.fsti.checked"
],
"interface_file": false,
"source_file": "LowParse.Low.Sum.fst"
} | [
{
"abbrev": true,
"full_module": "FStar.HyperStack",
"short_module": "HS"
},
{
"abbrev": true,
"full_module": "FStar.UInt64",
"short_module": "U64"
},
{
"abbrev": true,
"full_module": "FStar.Int.Cast",
"short_module": "Cast"
},
{
"abbrev": true,
"full_module": "LowStar.Buffer",
"short_module": "B"
},
{
"abbrev": true,
"full_module": "FStar.HyperStack.ST",
"short_module": "HST"
},
{
"abbrev": true,
"full_module": "FStar.UInt32",
"short_module": "U32"
},
{
"abbrev": false,
"full_module": "LowParse.Spec.Sum",
"short_module": null
},
{
"abbrev": false,
"full_module": "LowParse.Low.Enum",
"short_module": null
},
{
"abbrev": false,
"full_module": "LowParse.Low",
"short_module": null
},
{
"abbrev": false,
"full_module": "LowParse.Low",
"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",
"short_module": null
}
] | {
"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_elim_box": false,
"smtencoding_l_arith_repr": "boxwrap",
"smtencoding_nl_arith_repr": "boxwrap",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": true,
"z3cliopt": [],
"z3refresh": false,
"z3rlimit": 5,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | false |
t: LowParse.Spec.Sum.dsum ->
p: LowParse.Spec.Base.parser kt (LowParse.Spec.Sum.dsum_repr_type t) ->
f:
(x: LowParse.Spec.Sum.dsum_known_key t
-> Prims.dtuple2 LowParse.Spec.Base.parser_kind
(fun k -> LowParse.Spec.Base.parser k (LowParse.Spec.Sum.dsum_type_of_known_tag t x))) ->
g: LowParse.Spec.Base.parser ku (LowParse.Spec.Sum.dsum_type_of_unknown_tag t)
-> LowParse.Low.Base.accessor (LowParse.Low.Sum.gaccessor_dsum_tag t p f g) | Prims.Tot | [
"total"
] | [] | [
"LowParse.Spec.Base.parser_kind",
"LowParse.Spec.Sum.dsum",
"LowParse.Spec.Base.parser",
"LowParse.Spec.Sum.dsum_repr_type",
"LowParse.Spec.Sum.dsum_known_key",
"Prims.dtuple2",
"LowParse.Spec.Sum.dsum_type_of_known_tag",
"LowParse.Spec.Sum.dsum_type_of_unknown_tag",
"LowParse.Low.Combinators.accessor_tagged_union_tag",
"LowParse.Spec.Enum.maybe_enum_key",
"LowParse.Spec.Sum.dsum_key_type",
"LowParse.Spec.Sum.dsum_enum",
"LowParse.Spec.Enum.parse_maybe_enum_key",
"LowParse.Spec.Sum.dsum_type",
"LowParse.Spec.Sum.dsum_tag_of_data",
"LowParse.Spec.Sum.weaken_parse_dsum_cases_kind",
"LowParse.Spec.Sum.parse_dsum_cases",
"LowParse.Low.Base.accessor",
"LowParse.Spec.Sum.parse_dsum_kind",
"LowParse.Spec.Sum.parse_dsum",
"LowParse.Low.Sum.clens_dsum_tag",
"LowParse.Low.Sum.gaccessor_dsum_tag"
] | [] | false | false | false | false | false | let accessor_dsum_tag
(#kt: parser_kind)
(t: dsum)
(p: parser kt (dsum_repr_type t))
(f: (x: dsum_known_key t -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x))))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
: Tot (accessor (gaccessor_dsum_tag t p f g)) =
| accessor_tagged_union_tag (parse_maybe_enum_key p (dsum_enum t))
(dsum_tag_of_data t)
(parse_dsum_cases t f g) | false |
LowParse.Low.Sum.fst | LowParse.Low.Sum.jump_dsum_cases_if | val jump_dsum_cases_if
(s: dsum)
(f: (x: dsum_known_key s -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x))))
(#k: parser_kind)
(g: parser k (dsum_type_of_unknown_tag s))
(x: dsum_key s)
: Tot (if_combinator _ (jump_dsum_cases_eq s f g x)) | val jump_dsum_cases_if
(s: dsum)
(f: (x: dsum_known_key s -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x))))
(#k: parser_kind)
(g: parser k (dsum_type_of_unknown_tag s))
(x: dsum_key s)
: Tot (if_combinator _ (jump_dsum_cases_eq s f g x)) | let jump_dsum_cases_if
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(#k: parser_kind)
(g: parser k (dsum_type_of_unknown_tag s))
(x: dsum_key s)
: Tot (if_combinator _ (jump_dsum_cases_eq s f g x))
= jump_dsum_cases_if' s f g x | {
"file_name": "src/lowparse/LowParse.Low.Sum.fst",
"git_rev": "00217c4a89f5ba56002ba9aa5b4a9d5903bfe9fa",
"git_url": "https://github.com/project-everest/everparse.git",
"project_name": "everparse"
} | {
"end_col": 29,
"end_line": 1417,
"start_col": 0,
"start_line": 1410
} | module LowParse.Low.Sum
include LowParse.Low.Enum
include LowParse.Spec.Sum
module U32 = FStar.UInt32
module HST = FStar.HyperStack.ST
module B = LowStar.Buffer
module Cast = FStar.Int.Cast
module U64 = FStar.UInt64
inline_for_extraction
let validate_sum_cases_aux
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(vc: ((x: sum_key t) -> Tot (validator (dsnd (pc x)))))
(k: sum_key t)
: Tot (validator (parse_sum_cases t pc k))
= [@inline_let]
let _ = synth_sum_case_injective t k in
validate_synth
(validate_weaken
(weaken_parse_cases_kind t pc)
(vc k)
()
)
(synth_sum_case t k)
()
inline_for_extraction
let validate_sum_cases_t
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot Type
= validator (parse_sum_cases t pc k)
let validate_sum_cases_t_eq
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
(x y : validate_sum_cases_t t pc k)
: GTot Type0
= True
inline_for_extraction
let validate_sum_cases_t_if
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (if_combinator _ (validate_sum_cases_t_eq t pc k))
= fun cond (sv_true: cond_true cond -> Tot (validate_sum_cases_t t pc k)) (sv_false: cond_false cond -> Tot (validate_sum_cases_t t pc k)) #rrel #rel input pos ->
if cond
then sv_true () input pos
else sv_false () input pos
inline_for_extraction
let validate_sum_cases
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(vc: ((x: sum_key t) -> Tot (validator (dsnd (pc x)))))
(destr: dep_enum_destr (sum_enum t) (validate_sum_cases_t t pc))
(k: sum_key t)
: Tot (validator (parse_sum_cases t pc k))
= destr
_
(validate_sum_cases_t_if t pc)
(fun _ _ -> ())
(fun _ _ _ _ -> ())
(validate_sum_cases_aux t pc vc)
k
inline_for_extraction
let validate_sum_aux_payload_t
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
: Tot Type
= (#rrel: _) -> (#rel: _) ->
(input: slice rrel rel) ->
(pos: U64.t) ->
HST.Stack U64.t
(requires (fun h -> live_slice h input /\ U64.v pos <= U32.v input.len))
(ensures (fun h res h' ->
B.modifies B.loc_none h h' /\ (
match k with
| Unknown _ -> is_error res
| Known k' ->
if is_success res
then
valid_pos (dsnd (pc k')) h input (uint64_to_uint32 pos) (uint64_to_uint32 res)
else
(~ (valid (dsnd (pc k')) h input (uint64_to_uint32 pos)))
)))
let validate_sum_aux_payload_eq
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
: Tot (validate_sum_aux_payload_t t pc k -> validate_sum_aux_payload_t t pc k -> GTot Type0)
= fun _ _ -> True
inline_for_extraction
let validate_sum_aux_payload_if'
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
(cond: bool)
(ift: ((cond_true cond) -> Tot (validate_sum_aux_payload_t t pc k)))
(iff: ((cond_false cond) -> Tot (validate_sum_aux_payload_t t pc k)))
: Tot (validate_sum_aux_payload_t t pc k)
= fun #rrel #rel input pos ->
if cond
then begin
(ift () <: validate_sum_aux_payload_t t pc k) input pos
end else
(iff () <: validate_sum_aux_payload_t t pc k) input pos
inline_for_extraction
let validate_sum_aux_payload_if
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
: Tot (if_combinator _ (validate_sum_aux_payload_eq t pc k))
= validate_sum_aux_payload_if' t pc k
#push-options "--z3rlimit 64 --z3cliopt smt.arith.nl=false --using_facts_from '* -FStar.Int.Cast -LowParse.BitFields'"
// --query_stats --smtencoding.elim_box true --smtencoding.l_arith_repr native --z3refresh"
inline_for_extraction
let validate_sum_aux
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(v: validator p)
(p32: leaf_reader p)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(v_payload: ((k: sum_repr_type t)) -> Tot (validate_sum_aux_payload_t t pc (maybe_enum_key_of_repr (sum_enum t) k)))
: Tot (validator (parse_sum t p pc))
= fun #rrel #rel input pos ->
let h = HST.get () in
[@inline_let]
let _ = parse_sum_eq'' t p pc (bytes_of_slice_from h input (uint64_to_uint32 pos)) in
[@inline_let]
let _ = valid_facts (parse_sum t p pc) h input (uint64_to_uint32 pos) in
[@inline_let]
let _ = valid_facts p h input (uint64_to_uint32 pos) in
let len_after_tag = v input pos in
if is_error len_after_tag
then len_after_tag
else begin
let h1 = HST.get () in
let k' = p32 input (uint64_to_uint32 pos) in
[@inline_let]
let _ =
match maybe_enum_key_of_repr (sum_enum t) k' with
| Known k -> valid_facts (dsnd (pc k)) h input (uint64_to_uint32 len_after_tag)
| _ -> ()
in
v_payload k' input len_after_tag
end
#pop-options
inline_for_extraction
let validate_sum_aux_payload'
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (validator (dsnd (pc x)))))
(k: maybe_enum_key (sum_enum t))
: Tot (validate_sum_aux_payload_t t pc k)
= fun #rrel #rel input pos ->
match k with
| Known k ->
[@inline_let]
let _ = synth_sum_case_injective t k in
pc32 k input pos
// validate_synth (pc32 k) (synth_sum_case t k) () input pos
| _ -> validator_error_generic
inline_for_extraction
let validate_sum_aux_payload
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (validator (dsnd (pc x)))))
(destr: dep_maybe_enum_destr_t (sum_enum t) (validate_sum_aux_payload_t t pc))
(k: sum_repr_type t)
: Tot (validate_sum_aux_payload_t t pc (maybe_enum_key_of_repr (sum_enum t) k))
= destr (validate_sum_aux_payload_eq t pc) (validate_sum_aux_payload_if t pc) (fun _ _ -> ()) (fun _ _ _ _ -> ()) (validate_sum_aux_payload' t pc pc32) k
inline_for_extraction
let validate_sum
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(v: validator p)
(p32: leaf_reader p)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (validator (dsnd (pc x)))))
(destr: dep_maybe_enum_destr_t (sum_enum t) (validate_sum_aux_payload_t t pc))
: Tot (validator (parse_sum t p pc))
= validate_sum_aux t v p32 pc (validate_sum_aux_payload t pc pc32 destr)
module HS = FStar.HyperStack
#push-options "--z3rlimit 256 --z3cliopt smt.arith.nl=false --initial_ifuel 8 --max_ifuel 8 --initial_fuel 2 --max_fuel 2"
#restart-solver
let valid_sum_intro
(h: HS.mem)
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: Lemma
(requires (
valid (parse_enum_key p (sum_enum t)) h input pos /\ (
let k = contents (parse_enum_key p (sum_enum t)) h input pos in
valid (dsnd (pc k)) h input (get_valid_pos (parse_enum_key p (sum_enum t)) h input pos)
)))
(ensures (
let k = contents (parse_enum_key p (sum_enum t)) h input pos in
let pos_payload = get_valid_pos (parse_enum_key p (sum_enum t)) h input pos in
valid_content_pos
(parse_sum t p pc) h input pos
(synth_sum_case t k (contents (dsnd (pc k)) h input pos_payload))
(get_valid_pos (dsnd (pc k)) h input pos_payload)
))
= valid_facts (parse_enum_key p (sum_enum t)) h input pos;
let k = contents (parse_enum_key p (sum_enum t)) h input pos in
let pos_payload = get_valid_pos (parse_enum_key p (sum_enum t)) h input pos in
valid_facts (dsnd (pc k)) h input pos_payload;
valid_facts (parse_sum t p pc) h input pos;
parse_sum_eq t p pc (bytes_of_slice_from h input pos)
#pop-options
inline_for_extraction
let finalize_sum_case
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(s: serializer p)
(w: leaf_writer_strong s)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(destr: enum_repr_of_key'_t (sum_enum t))
(k: sum_key t)
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: HST.Stack unit
(requires (fun h ->
let len_tag = serialized_length (serialize_enum_key _ s (sum_enum t)) k in
U32.v pos + len_tag < 4294967296 /\ (
let pos_payload = pos `U32.add` U32.uint_to_t len_tag in
valid (dsnd (pc k)) h input pos_payload /\
writable input.base (U32.v pos) (U32.v pos_payload) h
)))
(ensures (fun h _ h' ->
let len_tag = serialized_length (serialize_enum_key _ s (sum_enum t)) k in
let pos_payload = pos `U32.add` U32.uint_to_t len_tag in
B.modifies (loc_slice_from_to input pos pos_payload) h h' /\
valid_content_pos (parse_sum t p pc) h' input pos (synth_sum_case t k (contents (dsnd (pc k)) h input pos_payload)) (get_valid_pos (dsnd (pc k)) h input pos_payload)
))
= let pos1 = write_enum_key w (sum_enum t) destr k input pos in
let h = HST.get () in
[@inline_let]
let _ = valid_sum_intro h t p pc input pos in
()
inline_for_extraction
let jump_sum_cases_aux
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(vc: ((x: sum_key t) -> Tot (jumper (dsnd (pc x)))))
(k: sum_key t)
: Tot (jumper (parse_sum_cases t pc k))
= [@inline_let]
let _ = synth_sum_case_injective t k in
jump_synth
(jump_weaken
(weaken_parse_cases_kind t pc)
(vc k)
()
)
(synth_sum_case t k)
()
inline_for_extraction
let jump_sum_cases_t
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot Type
= jumper (parse_sum_cases t pc k)
let jump_sum_cases_t_eq
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
(x y : jump_sum_cases_t t pc k)
: GTot Type0
= True
inline_for_extraction
let jump_sum_cases_t_if
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (if_combinator _ (jump_sum_cases_t_eq t pc k))
= fun cond (sv_true: cond_true cond -> Tot (jump_sum_cases_t t pc k)) (sv_false: cond_false cond -> Tot (jump_sum_cases_t t pc k)) #rrel #rel input pos ->
if cond
then sv_true () input pos
else sv_false () input pos
inline_for_extraction
let jump_sum_cases
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(vc: ((x: sum_key t) -> Tot (jumper (dsnd (pc x)))))
(destr: dep_enum_destr (sum_enum t) (jump_sum_cases_t t pc))
(k: sum_key t)
: Tot (jumper (parse_sum_cases t pc k))
= destr
_
(jump_sum_cases_t_if t pc)
(fun _ _ -> ())
(fun _ _ _ _ -> ())
(jump_sum_cases_aux t pc vc)
k
inline_for_extraction
let jump_sum_aux_payload_t
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
: Tot Type
= (#rrel: _) -> (#rel: _) ->
(input: slice rrel rel) ->
(pos: U32.t) ->
HST.Stack U32.t
(requires (fun h -> live_slice h input /\ U32.v pos <= U32.v input.len /\ (
match k with
| Unknown _ -> False
| Known k' -> valid (dsnd (pc k')) h input pos
)))
(ensures (fun h res h' ->
B.modifies B.loc_none h h' /\ (
match k with
| Unknown _ -> False
| Known k' ->
valid_pos (dsnd (pc k')) h input pos res
)))
let jump_sum_aux_payload_eq
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
: Tot (jump_sum_aux_payload_t t pc k -> jump_sum_aux_payload_t t pc k -> GTot Type0)
= fun _ _ -> True
inline_for_extraction
let jump_sum_aux_payload_if'
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
(cond: bool)
(ift: ((cond_true cond) -> Tot (jump_sum_aux_payload_t t pc k)))
(iff: ((cond_false cond) -> Tot (jump_sum_aux_payload_t t pc k)))
: Tot (jump_sum_aux_payload_t t pc k)
= fun #rrel #rel input pos ->
if cond
then begin
(ift () <: jump_sum_aux_payload_t t pc k) input pos
end else
(iff () <: jump_sum_aux_payload_t t pc k) input pos
inline_for_extraction
let jump_sum_aux_payload_if
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
: Tot (if_combinator _ (jump_sum_aux_payload_eq t pc k))
= jump_sum_aux_payload_if' t pc k
let parse_sum_eq3
(#kt: parser_kind)
(t: sum)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(input: bytes)
(k' : sum_repr_type t)
(consumed_k: consumed_length input)
: Lemma
(requires (Some? (parse (parse_sum t p pc) input) /\ parse p input == Some (k', consumed_k)))
(ensures (
let input_k = Seq.slice input consumed_k (Seq.length input) in
let k = maybe_enum_key_of_repr (sum_enum t) k' in
begin match k with
| Known k ->
Some? (parse (dsnd (pc k)) input_k)
| _ -> False
end
))
= parse_sum_eq'' t p pc input
let parse_sum_eq4
(#kt: parser_kind)
(t: sum)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(input: bytes)
(k' : sum_repr_type t)
(consumed_k: consumed_length input)
(consumed_payload: nat)
: Lemma
(requires (Some? (parse (parse_sum t p pc) input) /\ parse p input == Some (k', consumed_k) /\ (
let input_k = Seq.slice input consumed_k (Seq.length input) in
let k = maybe_enum_key_of_repr (sum_enum t) k' in
begin match k with
| Known k ->
Some? (parse (dsnd (pc k)) input_k) /\ (
let Some (_, consumed_payload') = parse (dsnd (pc k)) input_k in
consumed_payload' == consumed_payload
)
| _ -> False
end
)))
(ensures (
let Some (_, consumed) = parse (parse_sum t p pc) input in
consumed == consumed_k + consumed_payload
))
= parse_sum_eq'' t p pc input
#push-options "--z3rlimit 16"
let valid_sum_elim
(h: HS.mem)
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(#rrel: _) (#rel: _)
(input: slice rrel rel)
(pos: U32.t)
: Lemma
(requires (
valid (parse_sum t p pc) h input pos
))
(ensures (
valid p h input pos /\ (
let pos_payload = get_valid_pos p h input pos in
let k' = maybe_enum_key_of_repr (sum_enum t) (contents p h input pos) in
match k' with
| Known k ->
k == sum_tag_of_data t (contents (parse_sum t p pc) h input pos) /\
valid (dsnd (pc k)) h input pos_payload /\
valid_pos
(parse_sum t p pc) h input pos
(get_valid_pos (dsnd (pc k)) h input pos_payload)
| _ -> False
)))
= let sinput = bytes_of_slice_from h input pos in
let _ = parse_sum_eq'' t p pc sinput in
[@inline_let]
let _ = valid_facts (parse_sum t p pc) h input pos in
let Some (k', consumed_k) = parse p sinput in
let pos_after_tag = U32.uint_to_t (U32.v pos + consumed_k) in
[@inline_let]
let _ = valid_facts p h input pos in
assert (valid_content_pos p h input pos k' pos_after_tag);
match maybe_enum_key_of_repr (sum_enum t) k' with
| Known k -> valid_facts (dsnd (pc k)) h input pos_after_tag
| _ -> ()
#pop-options
let valid_sum_elim_tag
(h: HS.mem)
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: Lemma
(requires (
valid (parse_sum t p pc) h input pos
))
(ensures (
valid (parse_enum_key p (sum_enum t)) h input pos /\
contents (parse_enum_key p (sum_enum t)) h input pos == sum_tag_of_data t (contents (parse_sum t p pc) h input pos)
))
= let _ = parse_sum_eq' t p pc (bytes_of_slice_from h input pos) in
let _ = valid_facts (parse_sum t p pc) h input pos in
let _ = valid_facts (parse_enum_key p (sum_enum t)) h input pos in
()
inline_for_extraction
let read_sum_tag
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(p32: leaf_reader p)
(destr: dep_maybe_enum_destr_t (sum_enum t) (read_enum_key_t (sum_enum t)))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: HST.Stack (sum_key t)
(requires (fun h ->
valid (parse_sum t p pc) h input pos
))
(ensures (fun h res h' ->
B.modifies B.loc_none h h' /\
res == sum_tag_of_data t (contents (parse_sum t p pc) h input pos)
))
= let h = HST.get () in
[@inline_let] let _ = valid_sum_elim_tag h t p pc input pos in
read_enum_key p32 (sum_enum t) destr input pos
inline_for_extraction
let jump_sum_aux
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(v: jumper p)
(p32: leaf_reader p)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(v_payload: ((k: sum_repr_type t)) -> Tot (jump_sum_aux_payload_t t pc (maybe_enum_key_of_repr (sum_enum t) k)))
: Tot (jumper (parse_sum t p pc))
= fun #rrel #rel input pos ->
let h = HST.get () in
[@inline_let]
let _ = valid_sum_elim h t p pc input pos in
let pos_after_tag = v input pos in
let k' = p32 input pos in
v_payload k' input pos_after_tag
inline_for_extraction
let jump_sum_aux_payload'
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (jumper (dsnd (pc x)))))
(k: maybe_enum_key (sum_enum t))
: Tot (jump_sum_aux_payload_t t pc k)
= fun #rrel #rel input pos ->
match k with
| Known k ->
[@inline_let]
let _ = synth_sum_case_injective t k in
pc32 k input pos
| _ -> 0ul // dummy, but we MUST NOT remove this branch, otherwise extraction fails
inline_for_extraction
let jump_sum_aux_payload
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (jumper (dsnd (pc x)))))
(destr: dep_maybe_enum_destr_t (sum_enum t) (jump_sum_aux_payload_t t pc))
(k: sum_repr_type t)
: Tot (jump_sum_aux_payload_t t pc (maybe_enum_key_of_repr (sum_enum t) k))
= destr (jump_sum_aux_payload_eq t pc) (jump_sum_aux_payload_if t pc) (fun _ _ -> ()) (fun _ _ _ _ -> ()) (jump_sum_aux_payload' t pc pc32) k
inline_for_extraction
let jump_sum
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(v: jumper p)
(p32: leaf_reader p)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (jumper (dsnd (pc x)))))
(destr: dep_maybe_enum_destr_t (sum_enum t) (jump_sum_aux_payload_t t pc))
: Tot (jumper (parse_sum t p pc))
= jump_sum_aux t v p32 pc (jump_sum_aux_payload t pc pc32 destr)
inline_for_extraction
let read_sum_cases'
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (leaf_reader (dsnd (pc x)))))
(k: sum_key t)
: Tot (leaf_reader (parse_sum_cases' t pc k))
= [@inline_let]
let _ = synth_sum_case_injective t k in
read_synth'
(dsnd (pc k))
(synth_sum_case t k)
(pc32 k)
()
inline_for_extraction
let read_sum_cases_t
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot Type
= leaf_reader (parse_sum_cases' t pc k)
let read_sum_cases_t_eq
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
(x y : read_sum_cases_t t pc k)
: GTot Type0
= True
inline_for_extraction
let read_sum_cases_t_if
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (if_combinator _ (read_sum_cases_t_eq t pc k))
= fun cond (sv_true: cond_true cond -> Tot (read_sum_cases_t t pc k)) (sv_false: cond_false cond -> Tot (read_sum_cases_t t pc k)) #_ #_ input pos ->
if cond
then (sv_true () input pos)
else (sv_false () input pos)
inline_for_extraction
let read_sum_cases
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (leaf_reader (dsnd (pc x)))))
(destr: dep_enum_destr (sum_enum t) (read_sum_cases_t t pc))
(k: sum_key t)
: Tot (leaf_reader (parse_sum_cases' t pc k))
= destr
_
(read_sum_cases_t_if t pc)
(fun _ _ -> ())
(fun _ _ _ _ -> ())
(read_sum_cases' t pc pc32)
k
#push-options "--z3rlimit 32"
inline_for_extraction
let read_sum
(#kt: parser_kind)
(t: sum)
(p: parser kt (sum_repr_type t))
(p32: leaf_reader (parse_enum_key p (sum_enum t)))
(j: jumper p)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (leaf_reader (dsnd (pc x)))))
(destr: dep_enum_destr (sum_enum t) (read_sum_cases_t t pc))
: Tot (leaf_reader (parse_sum t p pc))
=
fun #_ #_ input pos ->
let h = HST.get () in
valid_facts (parse_sum t p pc) h input pos;
parse_sum_eq' t p pc (bytes_of_slice_from h input pos);
valid_facts (parse_enum_key p (sum_enum t)) h input pos;
let k = p32 input pos in
let pos' = jump_enum_key j (sum_enum t) input pos in
valid_facts (parse_sum_cases' t pc k) h input pos' ;
read_sum_cases t pc pc32 destr k input pos'
#pop-options
inline_for_extraction
let serialize32_sum_cases_t
(t: sum)
(#pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(sc: ((x: sum_key t) -> Tot (serializer (dsnd (pc x)))))
(k: sum_key t)
: Tot Type
= serializer32 (serialize_sum_cases t pc sc k)
let serialize32_sum_cases_t_eq
(t: sum)
(#pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(sc: ((x: sum_key t) -> Tot (serializer (dsnd (pc x)))))
(k: sum_key t)
(x y: serialize32_sum_cases_t t sc k)
: GTot Type0
= True
inline_for_extraction
let serialize32_sum_cases_t_if
(t: sum)
(#pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(sc: ((x: sum_key t) -> Tot (serializer (dsnd (pc x)))))
(k: sum_key t)
: Tot (if_combinator _ (serialize32_sum_cases_t_eq t sc k))
= fun cond (sv_true: (cond_true cond -> Tot (serialize32_sum_cases_t t sc k))) (sv_false: (cond_false cond -> Tot (serialize32_sum_cases_t t sc k))) x #rrel #rel b pos ->
if cond
then (sv_true () x b pos)
else (sv_false () x b pos)
inline_for_extraction
let serialize32_sum_cases_aux
(t: sum)
(#pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(sc: ((x: sum_key t) -> Tot (serializer (dsnd (pc x)))))
(sc32: ((x: sum_key t) -> Tot (serializer32 (sc x))))
(k: sum_key t)
: Tot (serializer32 (serialize_sum_cases t pc sc k))
= fun x #rrel #rel b pos ->
[@inline_let] let _ =
Classical.forall_intro (parse_sum_cases_eq' t pc k);
synth_sum_case_injective t k;
synth_sum_case_inverse t k
in
serialize32_synth
(sc32 k)
(synth_sum_case t k)
(synth_sum_case_recip t k)
(fun x -> synth_sum_case_recip t k x)
()
x
b
pos
inline_for_extraction
let serialize32_sum_cases
(t: sum)
(#pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(sc: ((x: sum_key t) -> Tot (serializer (dsnd (pc x)))))
(sc32: ((x: sum_key t) -> Tot (serializer32 (sc x))))
(destr: dep_enum_destr (sum_enum t) (serialize32_sum_cases_t t sc))
(k: sum_key t)
: Tot (serializer32 (serialize_sum_cases t pc sc k))
= destr
_
(serialize32_sum_cases_t_if t sc)
(fun _ _ -> ())
(fun _ _ _ _ -> ())
(serialize32_sum_cases_aux t sc sc32)
k
inline_for_extraction
let serialize32_sum
(#kt: parser_kind)
(t: sum)
(#p: parser kt (sum_repr_type t))
(s: serializer p {kt.parser_kind_subkind == Some ParserStrong})
(s32: serializer32 (serialize_enum_key _ s (sum_enum t)))
(#pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(sc: ((x: sum_key t) -> Tot (serializer (dsnd (pc x)))))
(sc32: ((x: sum_key t) -> Tot (serializer32 (sc x))))
(destr: dep_enum_destr (sum_enum t) (serialize32_sum_cases_t t sc))
: Tot (serializer32 (serialize_sum t s sc))
= fun x #rrel #rel b pos ->
serialize_sum_eq t s sc x;
let tg = sum_tag_of_data t x in
serialize32_nondep_then_aux s32 (serialize32_sum_cases t sc sc32 destr tg) tg x b pos
let clens_sum_tag
(s: sum)
: Tot (clens (sum_type s) (sum_key s))
= {
clens_cond = (fun _ -> True);
clens_get = sum_tag_of_data s;
}
let gaccessor_sum_tag
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
: Tot (gaccessor (parse_sum t p pc) (parse_enum_key p (sum_enum t)) (clens_sum_tag t))
= gaccessor_tagged_union_tag
(parse_enum_key p (sum_enum t))
(sum_tag_of_data t)
(parse_sum_cases t pc)
inline_for_extraction
let accessor_sum_tag
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
: Tot (accessor (gaccessor_sum_tag t p pc))
= accessor_tagged_union_tag
(parse_enum_key p (sum_enum t))
(sum_tag_of_data t)
(parse_sum_cases t pc)
let clens_sum_payload
(s: sum)
(k: sum_key s)
: Tot (clens (sum_type s) (sum_type_of_tag s k))
= {
clens_cond = (fun (x: sum_type s) -> sum_tag_of_data s x == k);
clens_get = (fun (x: sum_type s) -> synth_sum_case_recip s k x <: Ghost (sum_type_of_tag s k) (requires (sum_tag_of_data s x == k)) (ensures (fun _ -> True)));
}
#push-options "--z3rlimit 32"
let gaccessor_clens_sum_payload'
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (gaccessor' (parse_sum t p pc) (dsnd (pc k)) (clens_sum_payload t k))
= fun (input: bytes) ->
parse_sum_eq'' t p pc input;
let res =
match parse p input with
| Some (_, consumed) ->
synth_sum_case_inverse t k;
synth_sum_case_injective t k;
synth_injective_synth_inverse_synth_inverse_recip (synth_sum_case t k) (synth_sum_case_recip t k) ();
(consumed)
| _ -> 0 // dummy
in
(res <: (res: _ { gaccessor_post' (parse_sum t p pc) (dsnd (pc k)) (clens_sum_payload t k) input res } ))
#push-options "--z3rlimit 64"
let gaccessor_clens_sum_payload_injective
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
(sl sl' : bytes)
: Lemma
(requires (
gaccessor_pre (parse_sum t p pc) (dsnd (pc k)) (clens_sum_payload t k) sl /\
gaccessor_pre (parse_sum t p pc) (dsnd (pc k)) (clens_sum_payload t k) sl' /\
injective_precond (parse_sum t p pc) sl sl'
))
(ensures (gaccessor_clens_sum_payload' t p pc k sl == gaccessor_clens_sum_payload' t p pc k sl'))
= parse_sum_eq'' t p pc sl;
parse_sum_eq'' t p pc sl' ;
parse_injective (parse_sum t p pc) sl sl' ;
parse_injective p sl sl'
#pop-options
let gaccessor_clens_sum_payload_no_lookahead
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
(sl sl' : bytes)
: Lemma
(requires (
(parse_sum_kind kt t pc).parser_kind_subkind == Some ParserStrong /\
gaccessor_pre (parse_sum t p pc) (dsnd (pc k)) (clens_sum_payload t k) sl /\
gaccessor_pre (parse_sum t p pc) (dsnd (pc k)) (clens_sum_payload t k) sl' /\
no_lookahead_on_precond (parse_sum t p pc) sl sl'
))
(ensures (gaccessor_clens_sum_payload' t p pc k sl == gaccessor_clens_sum_payload' t p pc k sl'))
= parse_sum_eq'' t p pc sl;
parse_sum_eq'' t p pc sl' ;
parse_strong_prefix (parse_sum t p pc) sl sl' ;
parse_injective p sl sl'
let gaccessor_clens_sum_payload
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (gaccessor (parse_sum t p pc) (dsnd (pc k)) (clens_sum_payload t k))
= Classical.forall_intro_2 (fun x -> Classical.move_requires (gaccessor_clens_sum_payload_injective t p pc k x));
Classical.forall_intro_2 (fun x -> Classical.move_requires (gaccessor_clens_sum_payload_no_lookahead t p pc k x));
gaccessor_prop_equiv (parse_sum t p pc) (dsnd (pc k)) (clens_sum_payload t k) (gaccessor_clens_sum_payload' t p pc k);
gaccessor_clens_sum_payload' t p pc k
inline_for_extraction
let accessor_clens_sum_payload'
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(j: jumper p)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: HST.Stack U32.t
(requires (fun h ->
valid (parse_sum t p pc) h input pos /\
(clens_sum_payload t k).clens_cond (contents (parse_sum t p pc) h input pos)
))
(ensures (fun h pos' h' ->
B.modifies B.loc_none h h' /\
pos' == slice_access h (gaccessor_clens_sum_payload t p pc k) input pos
))
=
let h = HST.get () in
[@inline_let]
let _ =
let pos' = get_valid_pos (parse_sum t p pc) h input pos in
let large = bytes_of_slice_from h input pos in
slice_access_eq h (gaccessor_clens_sum_payload t p pc k) input pos;
valid_facts (parse_sum t p pc) h input pos;
parse_sum_eq'' t p pc large;
valid_facts p h input pos
in
j input pos
#pop-options
inline_for_extraction
let accessor_clens_sum_payload
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(j: jumper p)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (accessor (gaccessor_clens_sum_payload t p pc k))
= fun #rrel #rel -> accessor_clens_sum_payload' t j pc k #rrel #rel
let clens_sum_cases_payload
(s: sum)
(k: sum_key s)
: Tot (clens (sum_cases s k) (sum_type_of_tag s k))
= {
clens_cond = (fun (x: sum_cases s k) -> True);
clens_get = (fun (x: sum_cases s k) -> synth_sum_case_recip s k x <: Ghost (sum_type_of_tag s k) (requires (True)) (ensures (fun _ -> True)));
}
let gaccessor_clens_sum_cases_payload
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (gaccessor (parse_sum_cases' t pc k) (dsnd (pc k)) (clens_sum_cases_payload t k))
= synth_sum_case_injective t k;
synth_sum_case_inverse t k;
synth_injective_synth_inverse_synth_inverse_recip (synth_sum_case t k) (synth_sum_case_recip t k) ();
gaccessor_ext
(gaccessor_synth (dsnd (pc k)) (synth_sum_case t k) (synth_sum_case_recip t k) ())
(clens_sum_cases_payload t k)
()
inline_for_extraction
let accessor_clens_sum_cases_payload
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (accessor (gaccessor_clens_sum_cases_payload t pc k))
= [@inline_let]
let _ =
synth_sum_case_injective t k;
synth_sum_case_inverse t k;
synth_injective_synth_inverse_synth_inverse_recip (synth_sum_case t k) (synth_sum_case_recip t k) ()
in
accessor_ext
(accessor_synth (dsnd (pc k)) (synth_sum_case t k) (synth_sum_case_recip t k) ())
(clens_sum_cases_payload t k)
()
inline_for_extraction
let validate_dsum_cases_t
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(#k: parser_kind)
(g: parser k (dsum_type_of_unknown_tag s))
(x: dsum_key s)
: Tot Type
= validator (parse_dsum_cases' s f g x)
let validate_dsum_cases_eq
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(#k: parser_kind)
(g: parser k (dsum_type_of_unknown_tag s))
(x: dsum_key s)
(v1 v2 : validate_dsum_cases_t s f g x)
: GTot Type0
= True
inline_for_extraction
let validate_dsum_cases_if'
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(#k: parser_kind)
(g: parser k (dsum_type_of_unknown_tag s))
(x: dsum_key s)
(cond: bool)
(ift: (cond_true cond -> Tot (validate_dsum_cases_t s f g x)))
(iff: (cond_false cond -> Tot (validate_dsum_cases_t s f g x)))
: Tot (validate_dsum_cases_t s f g x)
= fun #rrel #rel input len ->
if cond
then (ift () <: validate_dsum_cases_t s f g x) input len
else (iff () <: validate_dsum_cases_t s f g x) input len
inline_for_extraction
let validate_dsum_cases_if
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(#k: parser_kind)
(g: parser k (dsum_type_of_unknown_tag s))
(x: dsum_key s)
: Tot (if_combinator _ (validate_dsum_cases_eq s f g x))
= validate_dsum_cases_if' s f g x
inline_for_extraction
let validate_dsum_cases'
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(f' : (x: dsum_known_key s) -> Tot (validator (dsnd (f x))))
(#k: parser_kind)
(#g: parser k (dsum_type_of_unknown_tag s))
(g' : validator g)
(x: dsum_key s)
: Tot (validate_dsum_cases_t s f g x)
= [@inline_let]
let _ = synth_dsum_case_injective s x in
match x with
| Known x' -> validate_synth (f' x') (synth_dsum_case s (Known x')) () <: validator (parse_dsum_cases' s f g x)
| Unknown x' -> validate_synth g' (synth_dsum_case s (Unknown x')) () <: validator (parse_dsum_cases' s f g x)
inline_for_extraction
let validate_dsum_cases'_destr
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(f' : (x: dsum_known_key s) -> Tot (validator (dsnd (f x))))
(#k: parser_kind)
(#g: parser k (dsum_type_of_unknown_tag s))
(g' : validator g)
(destr: dep_enum_destr _ (fun k -> validate_dsum_cases_t s f g (Known k)))
(x: dsum_key s)
: Tot (validate_dsum_cases_t s f g x)
= fun #rrel #rel input pos ->
match x with
| Known k ->
destr
_
(fun k -> validate_dsum_cases_if s f g (Known k))
(fun _ _ -> ())
(fun _ _ _ _ -> ())
(fun k -> validate_dsum_cases' s f f' g' (Known k))
k
input
pos
| Unknown r -> validate_dsum_cases' s f f' g' (Unknown r) input pos
inline_for_extraction
let validate_dsum_cases
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(f' : (x: dsum_known_key s) -> Tot (validator (dsnd (f x))))
(#k: parser_kind)
(#g: parser k (dsum_type_of_unknown_tag s))
(g' : validator g)
(destr: dep_enum_destr _ (fun k -> validate_dsum_cases_t s f g (Known k)))
(x: dsum_key s)
: Tot (validator (parse_dsum_cases s f g x))
= fun #rrel #rel input pos ->
let h = HST.get () in
[@inline_let]
let _ =
valid_facts (parse_dsum_cases' s f g x) h input (uint64_to_uint32 pos);
valid_facts (parse_dsum_cases s f g x) h input (uint64_to_uint32 pos);
parse_dsum_cases_eq' s f g x (bytes_of_slice_from h input (uint64_to_uint32 pos))
in
validate_dsum_cases'_destr s f f' g' destr x input pos
#push-options "--z3rlimit 40"
inline_for_extraction
let validate_dsum
(#kt: parser_kind)
(t: dsum)
(#p: parser kt (dsum_repr_type t))
(v: validator p)
(p32: leaf_reader p)
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(f32: (x: dsum_known_key t) -> Tot (validator (dsnd (f x))))
(#k': parser_kind)
(#g: parser k' (dsum_type_of_unknown_tag t))
(g32: validator g)
(destr: dep_maybe_enum_destr_t (dsum_enum t) (validate_dsum_cases_t t f g))
: Tot (validator (parse_dsum t p f g))
= fun #rrel #rel input pos ->
let h = HST.get () in
[@inline_let]
let _ = parse_dsum_eq' t p f g (bytes_of_slice_from h input (uint64_to_uint32 pos)) in
[@inline_let]
let _ = valid_facts (parse_dsum t p f g) h input (uint64_to_uint32 pos) in
[@inline_let]
let _ = valid_facts p h input (uint64_to_uint32 pos) in
let pos_after_tag = v input pos in
if is_error pos_after_tag
then pos_after_tag
else
let tg = p32 input (uint64_to_uint32 pos) in
[@inline_let]
let _ = valid_facts (parse_dsum_cases' t f g (maybe_enum_key_of_repr (dsum_enum t) tg)) h input (uint64_to_uint32 pos_after_tag) in
destr (validate_dsum_cases_eq t f g) (validate_dsum_cases_if t f g) (fun _ _ -> ()) (fun _ _ _ _ -> ()) (validate_dsum_cases' t f f32 g32) tg input pos_after_tag
#pop-options
#reset-options "--z3rlimit 64 --z3cliopt smt.arith.nl=false --initial_ifuel 8 --max_ifuel 8 --initial_fuel 2 --max_fuel 2"
let valid_dsum_intro_known
(h: HS.mem)
(t: dsum)
(#kt: parser_kind)
(p: parser kt (dsum_repr_type t))
(f: ((x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x))))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: Lemma
(requires (
valid (parse_maybe_enum_key p (dsum_enum t)) h input pos /\ (
let k' = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
Known? k' /\ (
let Known k = k' in
valid (dsnd (f k)) h input (get_valid_pos (parse_maybe_enum_key p (dsum_enum t)) h input pos)
))))
(ensures (
let Known k = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
let pos_payload = get_valid_pos (parse_maybe_enum_key p (dsum_enum t)) h input pos in
valid_content_pos
(parse_dsum t p f g) h input pos
(synth_dsum_case t (Known k) (contents (dsnd (f k)) h input pos_payload))
(get_valid_pos (dsnd (f k)) h input pos_payload)
))
= valid_facts (parse_maybe_enum_key p (dsum_enum t)) h input pos;
let Known k = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
let pos_payload = get_valid_pos (parse_maybe_enum_key p (dsum_enum t)) h input pos in
valid_facts (dsnd (f k)) h input pos_payload;
valid_facts (parse_dsum t p f g) h input pos;
parse_dsum_eq t p f g (bytes_of_slice_from h input pos)
let valid_dsum_intro_unknown
(h: HS.mem)
(t: dsum)
(#kt: parser_kind)
(p: parser kt (dsum_repr_type t))
(f: ((x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x))))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: Lemma
(requires (
valid (parse_maybe_enum_key p (dsum_enum t)) h input pos /\ (
let k' = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
Unknown? k' /\
valid g h input (get_valid_pos (parse_maybe_enum_key p (dsum_enum t)) h input pos)
)))
(ensures (
let Unknown r = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
let pos_payload = get_valid_pos (parse_maybe_enum_key p (dsum_enum t)) h input pos in
valid_content_pos
(parse_dsum t p f g) h input pos
(synth_dsum_case t (Unknown r) (contents g h input pos_payload))
(get_valid_pos g h input pos_payload)
))
= valid_facts (parse_maybe_enum_key p (dsum_enum t)) h input pos;
let Unknown r = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
let pos_payload = get_valid_pos (parse_maybe_enum_key p (dsum_enum t)) h input pos in
valid_facts g h input pos_payload;
valid_facts (parse_dsum t p f g) h input pos;
parse_dsum_eq t p f g (bytes_of_slice_from h input pos)
#reset-options
inline_for_extraction
let finalize_dsum_case_known
(t: dsum)
(#kt: parser_kind)
(#p: parser kt (dsum_repr_type t))
(s: serializer p)
(w: leaf_writer_strong s)
(f: ((x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x))))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
(destr: enum_repr_of_key'_t (dsum_enum t))
(k: dsum_known_key t)
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: HST.Stack unit
(requires (fun h ->
let len_tag = serialized_length (serialize_enum_key _ s (dsum_enum t)) k in
U32.v pos + len_tag < 4294967296 /\ (
let pos_payload = pos `U32.add` U32.uint_to_t len_tag in
valid (dsnd (f k)) h input pos_payload /\
writable input.base (U32.v pos) (U32.v pos_payload) h
)))
(ensures (fun h _ h' ->
let len_tag = serialized_length (serialize_enum_key _ s (dsum_enum t)) k in
let pos_payload = pos `U32.add` U32.uint_to_t len_tag in
B.modifies (loc_slice_from_to input pos pos_payload) h h' /\
valid_content_pos (parse_dsum t p f g) h' input pos (synth_dsum_case t (Known k) (contents (dsnd (f k)) h input pos_payload)) (get_valid_pos (dsnd (f k)) h input pos_payload)
))
= let pos1 = write_enum_key w (dsum_enum t) destr k input pos in
let h = HST.get () in
[@inline_let]
let _ =
valid_facts (parse_enum_key p (dsum_enum t)) h input pos;
valid_facts (parse_maybe_enum_key p (dsum_enum t)) h input pos;
let sq = bytes_of_slice_from h input pos in
parse_enum_key_eq p (dsum_enum t) sq;
parse_maybe_enum_key_eq p (dsum_enum t) sq;
valid_dsum_intro_known h t p f g input pos
in
()
inline_for_extraction
let finalize_dsum_case_unknown
(t: dsum)
(#kt: parser_kind)
(#p: parser kt (dsum_repr_type t))
(s: serializer p)
(w: leaf_writer_strong s)
(f: ((x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x))))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
(r: unknown_enum_repr (dsum_enum t))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: HST.Stack unit
(requires (fun h ->
let len_tag = serialized_length s r in
U32.v pos + len_tag < 4294967296 /\ (
let pos_payload = pos `U32.add` U32.uint_to_t len_tag in
valid g h input pos_payload /\
writable input.base (U32.v pos) (U32.v pos_payload) h
)))
(ensures (fun h _ h' ->
let len_tag = serialized_length s r in
let pos_payload = pos `U32.add` U32.uint_to_t len_tag in
B.modifies (loc_slice_from_to input pos pos_payload) h h' /\
valid_content_pos (parse_dsum t p f g) h' input pos (synth_dsum_case t (Unknown r) (contents g h input pos_payload)) (get_valid_pos g h input pos_payload)
))
= let pos1 = w r input pos in
let h = HST.get () in
[@inline_let]
let _ =
valid_facts (parse_maybe_enum_key p (dsum_enum t)) h input pos;
valid_facts p h input pos;
let sq = bytes_of_slice_from h input pos in
parse_maybe_enum_key_eq p (dsum_enum t) sq;
valid_dsum_intro_unknown h t p f g input pos
in
()
let valid_dsum_elim_tag
(h: HS.mem)
(t: dsum)
(#kt: parser_kind)
(p: parser kt (dsum_repr_type t))
(f: ((x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x))))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: Lemma
(requires (
valid (parse_dsum t p f g) h input pos
))
(ensures (
valid (parse_maybe_enum_key p (dsum_enum t)) h input pos /\
contents (parse_maybe_enum_key p (dsum_enum t)) h input pos == dsum_tag_of_data t (contents (parse_dsum t p f g) h input pos)
))
= let _ = parse_dsum_eq_ t p f g (bytes_of_slice_from h input pos) in
let _ = valid_facts (parse_dsum t p f g) h input pos in
let _ = valid_facts (parse_maybe_enum_key p (dsum_enum t)) h input pos in
()
inline_for_extraction
let read_dsum_tag
(t: dsum)
(#kt: parser_kind)
(#p: parser kt (dsum_repr_type t))
(p32: leaf_reader p)
(destr: maybe_enum_destr_t (maybe_enum_key (dsum_enum t)) (dsum_enum t))
(f: ((x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x))))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: HST.Stack (dsum_key t)
(requires (fun h ->
valid (parse_dsum t p f g) h input pos
))
(ensures (fun h res h' ->
B.modifies B.loc_none h h' /\
res == dsum_tag_of_data t (contents (parse_dsum t p f g) h input pos)
))
= let h = HST.get () in
[@inline_let] let _ = valid_dsum_elim_tag h t p f g input pos in
read_maybe_enum_key p32 (dsum_enum t) destr input pos
#push-options "--z3rlimit 32"
let valid_dsum_elim_known
(h: HS.mem)
(t: dsum)
(#kt: parser_kind)
(p: parser kt (dsum_repr_type t))
(f: ((x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x))))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: Lemma
(requires (
valid (parse_dsum t p f g) h input pos /\
Known? (dsum_tag_of_data t (contents (parse_dsum t p f g) h input pos))
))
(ensures (
valid (parse_maybe_enum_key p (dsum_enum t)) h input pos /\ (
let k' = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
let pos_payload = get_valid_pos (parse_maybe_enum_key p (dsum_enum t)) h input pos in
Known? k' /\ (
let Known k = k' in
valid (dsnd (f k)) h input pos_payload /\
valid_content_pos
(parse_dsum t p f g) h input pos
(synth_dsum_case t (Known k) (contents (dsnd (f k)) h input pos_payload))
(get_valid_pos (dsnd (f k)) h input pos_payload)
))))
=
valid_facts (parse_dsum t p f g) h input pos;
parse_dsum_eq t p f g (bytes_of_slice_from h input pos);
valid_facts (parse_maybe_enum_key p (dsum_enum t)) h input pos;
let Known k = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
let pos_payload = get_valid_pos (parse_maybe_enum_key p (dsum_enum t)) h input pos in
valid_facts (dsnd (f k)) h input pos_payload
#pop-options
let valid_dsum_elim_unknown
(h: HS.mem)
(t: dsum)
(#kt: parser_kind)
(p: parser kt (dsum_repr_type t))
(f: ((x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x))))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: Lemma
(requires (
valid (parse_dsum t p f g) h input pos /\
Unknown? (dsum_tag_of_data t (contents (parse_dsum t p f g) h input pos))
))
(ensures (
valid (parse_maybe_enum_key p (dsum_enum t)) h input pos /\ (
let k' = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
let pos_payload = get_valid_pos (parse_maybe_enum_key p (dsum_enum t)) h input pos in
Unknown? k' /\ (
let Unknown r = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
valid g h input pos_payload /\
valid_content_pos
(parse_dsum t p f g) h input pos
(synth_dsum_case t (Unknown r) (contents g h input pos_payload))
(get_valid_pos g h input pos_payload)
))))
=
valid_facts (parse_dsum t p f g) h input pos;
parse_dsum_eq t p f g (bytes_of_slice_from h input pos);
valid_facts (parse_maybe_enum_key p (dsum_enum t)) h input pos;
let Unknown r = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
let pos_payload = get_valid_pos (parse_maybe_enum_key p (dsum_enum t)) h input pos in
valid_facts g h input pos_payload
inline_for_extraction
let jump_dsum_cases_t
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(#k: parser_kind)
(g: parser k (dsum_type_of_unknown_tag s))
(x: dsum_key s)
: Tot Type
= jumper (parse_dsum_cases' s f g x)
let jump_dsum_cases_eq
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(#k: parser_kind)
(g: parser k (dsum_type_of_unknown_tag s))
(x: dsum_key s)
(v1 v2 : jump_dsum_cases_t s f g x)
: GTot Type0
= True
inline_for_extraction
let jump_dsum_cases_if'
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(#k: parser_kind)
(g: parser k (dsum_type_of_unknown_tag s))
(x: dsum_key s)
(cond: bool)
(ift: (cond_true cond -> Tot (jump_dsum_cases_t s f g x)))
(iff: (cond_false cond -> Tot (jump_dsum_cases_t s f g x)))
: Tot (jump_dsum_cases_t s f g x)
= fun #rrel #rel input len ->
if cond
then (ift () <: jump_dsum_cases_t s f g x) input len
else (iff () <: jump_dsum_cases_t s f g x) input len | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"LowStar.Buffer.fst.checked",
"LowParse.Spec.Sum.fst.checked",
"LowParse.Low.Enum.fst.checked",
"FStar.UInt64.fsti.checked",
"FStar.UInt32.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Int.Cast.fst.checked",
"FStar.HyperStack.ST.fsti.checked",
"FStar.HyperStack.fst.checked",
"FStar.Classical.fsti.checked"
],
"interface_file": false,
"source_file": "LowParse.Low.Sum.fst"
} | [
{
"abbrev": true,
"full_module": "FStar.HyperStack",
"short_module": "HS"
},
{
"abbrev": true,
"full_module": "FStar.UInt64",
"short_module": "U64"
},
{
"abbrev": true,
"full_module": "FStar.Int.Cast",
"short_module": "Cast"
},
{
"abbrev": true,
"full_module": "LowStar.Buffer",
"short_module": "B"
},
{
"abbrev": true,
"full_module": "FStar.HyperStack.ST",
"short_module": "HST"
},
{
"abbrev": true,
"full_module": "FStar.UInt32",
"short_module": "U32"
},
{
"abbrev": false,
"full_module": "LowParse.Spec.Sum",
"short_module": null
},
{
"abbrev": false,
"full_module": "LowParse.Low.Enum",
"short_module": null
},
{
"abbrev": false,
"full_module": "LowParse.Low",
"short_module": null
},
{
"abbrev": false,
"full_module": "LowParse.Low",
"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",
"short_module": null
}
] | {
"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_elim_box": false,
"smtencoding_l_arith_repr": "boxwrap",
"smtencoding_nl_arith_repr": "boxwrap",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": true,
"z3cliopt": [],
"z3refresh": false,
"z3rlimit": 5,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | false |
s: LowParse.Spec.Sum.dsum ->
f:
(x: LowParse.Spec.Sum.dsum_known_key s
-> Prims.dtuple2 LowParse.Spec.Base.parser_kind
(fun k -> LowParse.Spec.Base.parser k (LowParse.Spec.Sum.dsum_type_of_known_tag s x))) ->
g: LowParse.Spec.Base.parser k (LowParse.Spec.Sum.dsum_type_of_unknown_tag s) ->
x: LowParse.Spec.Sum.dsum_key s
-> LowParse.Spec.Enum.if_combinator (LowParse.Low.Sum.jump_dsum_cases_t s f g x)
(LowParse.Low.Sum.jump_dsum_cases_eq s f g x) | Prims.Tot | [
"total"
] | [] | [
"LowParse.Spec.Sum.dsum",
"LowParse.Spec.Sum.dsum_known_key",
"Prims.dtuple2",
"LowParse.Spec.Base.parser_kind",
"LowParse.Spec.Base.parser",
"LowParse.Spec.Sum.dsum_type_of_known_tag",
"LowParse.Spec.Sum.dsum_type_of_unknown_tag",
"LowParse.Spec.Sum.dsum_key",
"LowParse.Low.Sum.jump_dsum_cases_if'",
"LowParse.Spec.Enum.if_combinator",
"LowParse.Low.Sum.jump_dsum_cases_t",
"LowParse.Low.Sum.jump_dsum_cases_eq"
] | [] | false | false | false | false | false | let jump_dsum_cases_if
(s: dsum)
(f: (x: dsum_known_key s -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x))))
(#k: parser_kind)
(g: parser k (dsum_type_of_unknown_tag s))
(x: dsum_key s)
: Tot (if_combinator _ (jump_dsum_cases_eq s f g x)) =
| jump_dsum_cases_if' s f g x | false |
Vale.Curve25519.Fast_defs.fst | Vale.Curve25519.Fast_defs.pow2_192 | val pow2_192 : Prims.int | let pow2_192 = 0x1000000000000000000000000000000000000000000000000 | {
"file_name": "vale/code/crypto/ecc/curve25519/Vale.Curve25519.Fast_defs.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 73,
"end_line": 7,
"start_col": 7,
"start_line": 7
} | module Vale.Curve25519.Fast_defs
open Vale.Def.Words_s
open Vale.Def.Types_s
open FStar.Mul | {
"checked_file": "/",
"dependencies": [
"Vale.Def.Words_s.fsti.checked",
"Vale.Def.Types_s.fst.checked",
"Vale.Curve25519.Fast_lemmas_internal.fsti.checked",
"Vale.Arch.Types.fsti.checked",
"prims.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked"
],
"interface_file": false,
"source_file": "Vale.Curve25519.Fast_defs.fst"
} | [
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Def.Types_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Def.Words_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Curve25519",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Curve25519",
"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",
"short_module": null
}
] | {
"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_elim_box": true,
"smtencoding_l_arith_repr": "native",
"smtencoding_nl_arith_repr": "wrapped",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": false,
"z3cliopt": [
"smt.arith.nl=false",
"smt.QI.EAGER_THRESHOLD=100",
"smt.CASE_SPLIT=3"
],
"z3refresh": false,
"z3rlimit": 5,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | false | Prims.int | Prims.Tot | [
"total"
] | [] | [] | [] | false | false | false | true | false | let pow2_192 =
| 0x1000000000000000000000000000000000000000000000000 | false |
|
Vale.Curve25519.Fast_defs.fst | Vale.Curve25519.Fast_defs.pow2_256 | val pow2_256 : Prims.int | let pow2_256 = 0x10000000000000000000000000000000000000000000000000000000000000000 | {
"file_name": "vale/code/crypto/ecc/curve25519/Vale.Curve25519.Fast_defs.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 89,
"end_line": 9,
"start_col": 7,
"start_line": 9
} | module Vale.Curve25519.Fast_defs
open Vale.Def.Words_s
open Vale.Def.Types_s
open FStar.Mul
unfold let pow2_192 = 0x1000000000000000000000000000000000000000000000000 | {
"checked_file": "/",
"dependencies": [
"Vale.Def.Words_s.fsti.checked",
"Vale.Def.Types_s.fst.checked",
"Vale.Curve25519.Fast_lemmas_internal.fsti.checked",
"Vale.Arch.Types.fsti.checked",
"prims.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked"
],
"interface_file": false,
"source_file": "Vale.Curve25519.Fast_defs.fst"
} | [
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Def.Types_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Def.Words_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Curve25519",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Curve25519",
"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",
"short_module": null
}
] | {
"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_elim_box": true,
"smtencoding_l_arith_repr": "native",
"smtencoding_nl_arith_repr": "wrapped",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": false,
"z3cliopt": [
"smt.arith.nl=false",
"smt.QI.EAGER_THRESHOLD=100",
"smt.CASE_SPLIT=3"
],
"z3refresh": false,
"z3rlimit": 5,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | false | Prims.int | Prims.Tot | [
"total"
] | [] | [] | [] | false | false | false | true | false | let pow2_256 =
| 0x10000000000000000000000000000000000000000000000000000000000000000 | false |
|
LowParse.Low.Sum.fst | LowParse.Low.Sum.jump_dsum_cases' | val jump_dsum_cases'
(s: dsum)
(f: (x: dsum_known_key s -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x))))
(f': (x: dsum_known_key s -> Tot (jumper (dsnd (f x)))))
(#k: parser_kind)
(#g: parser k (dsum_type_of_unknown_tag s))
(g': jumper g)
(x: dsum_key s)
: Tot (jump_dsum_cases_t s f g x) | val jump_dsum_cases'
(s: dsum)
(f: (x: dsum_known_key s -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x))))
(f': (x: dsum_known_key s -> Tot (jumper (dsnd (f x)))))
(#k: parser_kind)
(#g: parser k (dsum_type_of_unknown_tag s))
(g': jumper g)
(x: dsum_key s)
: Tot (jump_dsum_cases_t s f g x) | let jump_dsum_cases'
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(f' : (x: dsum_known_key s) -> Tot (jumper (dsnd (f x))))
(#k: parser_kind)
(#g: parser k (dsum_type_of_unknown_tag s))
(g' : jumper g)
(x: dsum_key s)
: Tot (jump_dsum_cases_t s f g x)
= synth_dsum_case_injective s x;
match x with
| Known x' -> jump_synth (f' x') (synth_dsum_case s (Known x')) () <: jumper (parse_dsum_cases' s f g x)
| Unknown x' -> jump_synth g' (synth_dsum_case s (Unknown x')) () <: jumper (parse_dsum_cases' s f g x) | {
"file_name": "src/lowparse/LowParse.Low.Sum.fst",
"git_rev": "00217c4a89f5ba56002ba9aa5b4a9d5903bfe9fa",
"git_url": "https://github.com/project-everest/everparse.git",
"project_name": "everparse"
} | {
"end_col": 105,
"end_line": 1432,
"start_col": 0,
"start_line": 1420
} | module LowParse.Low.Sum
include LowParse.Low.Enum
include LowParse.Spec.Sum
module U32 = FStar.UInt32
module HST = FStar.HyperStack.ST
module B = LowStar.Buffer
module Cast = FStar.Int.Cast
module U64 = FStar.UInt64
inline_for_extraction
let validate_sum_cases_aux
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(vc: ((x: sum_key t) -> Tot (validator (dsnd (pc x)))))
(k: sum_key t)
: Tot (validator (parse_sum_cases t pc k))
= [@inline_let]
let _ = synth_sum_case_injective t k in
validate_synth
(validate_weaken
(weaken_parse_cases_kind t pc)
(vc k)
()
)
(synth_sum_case t k)
()
inline_for_extraction
let validate_sum_cases_t
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot Type
= validator (parse_sum_cases t pc k)
let validate_sum_cases_t_eq
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
(x y : validate_sum_cases_t t pc k)
: GTot Type0
= True
inline_for_extraction
let validate_sum_cases_t_if
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (if_combinator _ (validate_sum_cases_t_eq t pc k))
= fun cond (sv_true: cond_true cond -> Tot (validate_sum_cases_t t pc k)) (sv_false: cond_false cond -> Tot (validate_sum_cases_t t pc k)) #rrel #rel input pos ->
if cond
then sv_true () input pos
else sv_false () input pos
inline_for_extraction
let validate_sum_cases
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(vc: ((x: sum_key t) -> Tot (validator (dsnd (pc x)))))
(destr: dep_enum_destr (sum_enum t) (validate_sum_cases_t t pc))
(k: sum_key t)
: Tot (validator (parse_sum_cases t pc k))
= destr
_
(validate_sum_cases_t_if t pc)
(fun _ _ -> ())
(fun _ _ _ _ -> ())
(validate_sum_cases_aux t pc vc)
k
inline_for_extraction
let validate_sum_aux_payload_t
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
: Tot Type
= (#rrel: _) -> (#rel: _) ->
(input: slice rrel rel) ->
(pos: U64.t) ->
HST.Stack U64.t
(requires (fun h -> live_slice h input /\ U64.v pos <= U32.v input.len))
(ensures (fun h res h' ->
B.modifies B.loc_none h h' /\ (
match k with
| Unknown _ -> is_error res
| Known k' ->
if is_success res
then
valid_pos (dsnd (pc k')) h input (uint64_to_uint32 pos) (uint64_to_uint32 res)
else
(~ (valid (dsnd (pc k')) h input (uint64_to_uint32 pos)))
)))
let validate_sum_aux_payload_eq
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
: Tot (validate_sum_aux_payload_t t pc k -> validate_sum_aux_payload_t t pc k -> GTot Type0)
= fun _ _ -> True
inline_for_extraction
let validate_sum_aux_payload_if'
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
(cond: bool)
(ift: ((cond_true cond) -> Tot (validate_sum_aux_payload_t t pc k)))
(iff: ((cond_false cond) -> Tot (validate_sum_aux_payload_t t pc k)))
: Tot (validate_sum_aux_payload_t t pc k)
= fun #rrel #rel input pos ->
if cond
then begin
(ift () <: validate_sum_aux_payload_t t pc k) input pos
end else
(iff () <: validate_sum_aux_payload_t t pc k) input pos
inline_for_extraction
let validate_sum_aux_payload_if
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
: Tot (if_combinator _ (validate_sum_aux_payload_eq t pc k))
= validate_sum_aux_payload_if' t pc k
#push-options "--z3rlimit 64 --z3cliopt smt.arith.nl=false --using_facts_from '* -FStar.Int.Cast -LowParse.BitFields'"
// --query_stats --smtencoding.elim_box true --smtencoding.l_arith_repr native --z3refresh"
inline_for_extraction
let validate_sum_aux
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(v: validator p)
(p32: leaf_reader p)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(v_payload: ((k: sum_repr_type t)) -> Tot (validate_sum_aux_payload_t t pc (maybe_enum_key_of_repr (sum_enum t) k)))
: Tot (validator (parse_sum t p pc))
= fun #rrel #rel input pos ->
let h = HST.get () in
[@inline_let]
let _ = parse_sum_eq'' t p pc (bytes_of_slice_from h input (uint64_to_uint32 pos)) in
[@inline_let]
let _ = valid_facts (parse_sum t p pc) h input (uint64_to_uint32 pos) in
[@inline_let]
let _ = valid_facts p h input (uint64_to_uint32 pos) in
let len_after_tag = v input pos in
if is_error len_after_tag
then len_after_tag
else begin
let h1 = HST.get () in
let k' = p32 input (uint64_to_uint32 pos) in
[@inline_let]
let _ =
match maybe_enum_key_of_repr (sum_enum t) k' with
| Known k -> valid_facts (dsnd (pc k)) h input (uint64_to_uint32 len_after_tag)
| _ -> ()
in
v_payload k' input len_after_tag
end
#pop-options
inline_for_extraction
let validate_sum_aux_payload'
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (validator (dsnd (pc x)))))
(k: maybe_enum_key (sum_enum t))
: Tot (validate_sum_aux_payload_t t pc k)
= fun #rrel #rel input pos ->
match k with
| Known k ->
[@inline_let]
let _ = synth_sum_case_injective t k in
pc32 k input pos
// validate_synth (pc32 k) (synth_sum_case t k) () input pos
| _ -> validator_error_generic
inline_for_extraction
let validate_sum_aux_payload
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (validator (dsnd (pc x)))))
(destr: dep_maybe_enum_destr_t (sum_enum t) (validate_sum_aux_payload_t t pc))
(k: sum_repr_type t)
: Tot (validate_sum_aux_payload_t t pc (maybe_enum_key_of_repr (sum_enum t) k))
= destr (validate_sum_aux_payload_eq t pc) (validate_sum_aux_payload_if t pc) (fun _ _ -> ()) (fun _ _ _ _ -> ()) (validate_sum_aux_payload' t pc pc32) k
inline_for_extraction
let validate_sum
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(v: validator p)
(p32: leaf_reader p)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (validator (dsnd (pc x)))))
(destr: dep_maybe_enum_destr_t (sum_enum t) (validate_sum_aux_payload_t t pc))
: Tot (validator (parse_sum t p pc))
= validate_sum_aux t v p32 pc (validate_sum_aux_payload t pc pc32 destr)
module HS = FStar.HyperStack
#push-options "--z3rlimit 256 --z3cliopt smt.arith.nl=false --initial_ifuel 8 --max_ifuel 8 --initial_fuel 2 --max_fuel 2"
#restart-solver
let valid_sum_intro
(h: HS.mem)
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: Lemma
(requires (
valid (parse_enum_key p (sum_enum t)) h input pos /\ (
let k = contents (parse_enum_key p (sum_enum t)) h input pos in
valid (dsnd (pc k)) h input (get_valid_pos (parse_enum_key p (sum_enum t)) h input pos)
)))
(ensures (
let k = contents (parse_enum_key p (sum_enum t)) h input pos in
let pos_payload = get_valid_pos (parse_enum_key p (sum_enum t)) h input pos in
valid_content_pos
(parse_sum t p pc) h input pos
(synth_sum_case t k (contents (dsnd (pc k)) h input pos_payload))
(get_valid_pos (dsnd (pc k)) h input pos_payload)
))
= valid_facts (parse_enum_key p (sum_enum t)) h input pos;
let k = contents (parse_enum_key p (sum_enum t)) h input pos in
let pos_payload = get_valid_pos (parse_enum_key p (sum_enum t)) h input pos in
valid_facts (dsnd (pc k)) h input pos_payload;
valid_facts (parse_sum t p pc) h input pos;
parse_sum_eq t p pc (bytes_of_slice_from h input pos)
#pop-options
inline_for_extraction
let finalize_sum_case
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(s: serializer p)
(w: leaf_writer_strong s)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(destr: enum_repr_of_key'_t (sum_enum t))
(k: sum_key t)
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: HST.Stack unit
(requires (fun h ->
let len_tag = serialized_length (serialize_enum_key _ s (sum_enum t)) k in
U32.v pos + len_tag < 4294967296 /\ (
let pos_payload = pos `U32.add` U32.uint_to_t len_tag in
valid (dsnd (pc k)) h input pos_payload /\
writable input.base (U32.v pos) (U32.v pos_payload) h
)))
(ensures (fun h _ h' ->
let len_tag = serialized_length (serialize_enum_key _ s (sum_enum t)) k in
let pos_payload = pos `U32.add` U32.uint_to_t len_tag in
B.modifies (loc_slice_from_to input pos pos_payload) h h' /\
valid_content_pos (parse_sum t p pc) h' input pos (synth_sum_case t k (contents (dsnd (pc k)) h input pos_payload)) (get_valid_pos (dsnd (pc k)) h input pos_payload)
))
= let pos1 = write_enum_key w (sum_enum t) destr k input pos in
let h = HST.get () in
[@inline_let]
let _ = valid_sum_intro h t p pc input pos in
()
inline_for_extraction
let jump_sum_cases_aux
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(vc: ((x: sum_key t) -> Tot (jumper (dsnd (pc x)))))
(k: sum_key t)
: Tot (jumper (parse_sum_cases t pc k))
= [@inline_let]
let _ = synth_sum_case_injective t k in
jump_synth
(jump_weaken
(weaken_parse_cases_kind t pc)
(vc k)
()
)
(synth_sum_case t k)
()
inline_for_extraction
let jump_sum_cases_t
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot Type
= jumper (parse_sum_cases t pc k)
let jump_sum_cases_t_eq
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
(x y : jump_sum_cases_t t pc k)
: GTot Type0
= True
inline_for_extraction
let jump_sum_cases_t_if
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (if_combinator _ (jump_sum_cases_t_eq t pc k))
= fun cond (sv_true: cond_true cond -> Tot (jump_sum_cases_t t pc k)) (sv_false: cond_false cond -> Tot (jump_sum_cases_t t pc k)) #rrel #rel input pos ->
if cond
then sv_true () input pos
else sv_false () input pos
inline_for_extraction
let jump_sum_cases
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(vc: ((x: sum_key t) -> Tot (jumper (dsnd (pc x)))))
(destr: dep_enum_destr (sum_enum t) (jump_sum_cases_t t pc))
(k: sum_key t)
: Tot (jumper (parse_sum_cases t pc k))
= destr
_
(jump_sum_cases_t_if t pc)
(fun _ _ -> ())
(fun _ _ _ _ -> ())
(jump_sum_cases_aux t pc vc)
k
inline_for_extraction
let jump_sum_aux_payload_t
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
: Tot Type
= (#rrel: _) -> (#rel: _) ->
(input: slice rrel rel) ->
(pos: U32.t) ->
HST.Stack U32.t
(requires (fun h -> live_slice h input /\ U32.v pos <= U32.v input.len /\ (
match k with
| Unknown _ -> False
| Known k' -> valid (dsnd (pc k')) h input pos
)))
(ensures (fun h res h' ->
B.modifies B.loc_none h h' /\ (
match k with
| Unknown _ -> False
| Known k' ->
valid_pos (dsnd (pc k')) h input pos res
)))
let jump_sum_aux_payload_eq
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
: Tot (jump_sum_aux_payload_t t pc k -> jump_sum_aux_payload_t t pc k -> GTot Type0)
= fun _ _ -> True
inline_for_extraction
let jump_sum_aux_payload_if'
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
(cond: bool)
(ift: ((cond_true cond) -> Tot (jump_sum_aux_payload_t t pc k)))
(iff: ((cond_false cond) -> Tot (jump_sum_aux_payload_t t pc k)))
: Tot (jump_sum_aux_payload_t t pc k)
= fun #rrel #rel input pos ->
if cond
then begin
(ift () <: jump_sum_aux_payload_t t pc k) input pos
end else
(iff () <: jump_sum_aux_payload_t t pc k) input pos
inline_for_extraction
let jump_sum_aux_payload_if
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
: Tot (if_combinator _ (jump_sum_aux_payload_eq t pc k))
= jump_sum_aux_payload_if' t pc k
let parse_sum_eq3
(#kt: parser_kind)
(t: sum)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(input: bytes)
(k' : sum_repr_type t)
(consumed_k: consumed_length input)
: Lemma
(requires (Some? (parse (parse_sum t p pc) input) /\ parse p input == Some (k', consumed_k)))
(ensures (
let input_k = Seq.slice input consumed_k (Seq.length input) in
let k = maybe_enum_key_of_repr (sum_enum t) k' in
begin match k with
| Known k ->
Some? (parse (dsnd (pc k)) input_k)
| _ -> False
end
))
= parse_sum_eq'' t p pc input
let parse_sum_eq4
(#kt: parser_kind)
(t: sum)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(input: bytes)
(k' : sum_repr_type t)
(consumed_k: consumed_length input)
(consumed_payload: nat)
: Lemma
(requires (Some? (parse (parse_sum t p pc) input) /\ parse p input == Some (k', consumed_k) /\ (
let input_k = Seq.slice input consumed_k (Seq.length input) in
let k = maybe_enum_key_of_repr (sum_enum t) k' in
begin match k with
| Known k ->
Some? (parse (dsnd (pc k)) input_k) /\ (
let Some (_, consumed_payload') = parse (dsnd (pc k)) input_k in
consumed_payload' == consumed_payload
)
| _ -> False
end
)))
(ensures (
let Some (_, consumed) = parse (parse_sum t p pc) input in
consumed == consumed_k + consumed_payload
))
= parse_sum_eq'' t p pc input
#push-options "--z3rlimit 16"
let valid_sum_elim
(h: HS.mem)
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(#rrel: _) (#rel: _)
(input: slice rrel rel)
(pos: U32.t)
: Lemma
(requires (
valid (parse_sum t p pc) h input pos
))
(ensures (
valid p h input pos /\ (
let pos_payload = get_valid_pos p h input pos in
let k' = maybe_enum_key_of_repr (sum_enum t) (contents p h input pos) in
match k' with
| Known k ->
k == sum_tag_of_data t (contents (parse_sum t p pc) h input pos) /\
valid (dsnd (pc k)) h input pos_payload /\
valid_pos
(parse_sum t p pc) h input pos
(get_valid_pos (dsnd (pc k)) h input pos_payload)
| _ -> False
)))
= let sinput = bytes_of_slice_from h input pos in
let _ = parse_sum_eq'' t p pc sinput in
[@inline_let]
let _ = valid_facts (parse_sum t p pc) h input pos in
let Some (k', consumed_k) = parse p sinput in
let pos_after_tag = U32.uint_to_t (U32.v pos + consumed_k) in
[@inline_let]
let _ = valid_facts p h input pos in
assert (valid_content_pos p h input pos k' pos_after_tag);
match maybe_enum_key_of_repr (sum_enum t) k' with
| Known k -> valid_facts (dsnd (pc k)) h input pos_after_tag
| _ -> ()
#pop-options
let valid_sum_elim_tag
(h: HS.mem)
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: Lemma
(requires (
valid (parse_sum t p pc) h input pos
))
(ensures (
valid (parse_enum_key p (sum_enum t)) h input pos /\
contents (parse_enum_key p (sum_enum t)) h input pos == sum_tag_of_data t (contents (parse_sum t p pc) h input pos)
))
= let _ = parse_sum_eq' t p pc (bytes_of_slice_from h input pos) in
let _ = valid_facts (parse_sum t p pc) h input pos in
let _ = valid_facts (parse_enum_key p (sum_enum t)) h input pos in
()
inline_for_extraction
let read_sum_tag
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(p32: leaf_reader p)
(destr: dep_maybe_enum_destr_t (sum_enum t) (read_enum_key_t (sum_enum t)))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: HST.Stack (sum_key t)
(requires (fun h ->
valid (parse_sum t p pc) h input pos
))
(ensures (fun h res h' ->
B.modifies B.loc_none h h' /\
res == sum_tag_of_data t (contents (parse_sum t p pc) h input pos)
))
= let h = HST.get () in
[@inline_let] let _ = valid_sum_elim_tag h t p pc input pos in
read_enum_key p32 (sum_enum t) destr input pos
inline_for_extraction
let jump_sum_aux
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(v: jumper p)
(p32: leaf_reader p)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(v_payload: ((k: sum_repr_type t)) -> Tot (jump_sum_aux_payload_t t pc (maybe_enum_key_of_repr (sum_enum t) k)))
: Tot (jumper (parse_sum t p pc))
= fun #rrel #rel input pos ->
let h = HST.get () in
[@inline_let]
let _ = valid_sum_elim h t p pc input pos in
let pos_after_tag = v input pos in
let k' = p32 input pos in
v_payload k' input pos_after_tag
inline_for_extraction
let jump_sum_aux_payload'
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (jumper (dsnd (pc x)))))
(k: maybe_enum_key (sum_enum t))
: Tot (jump_sum_aux_payload_t t pc k)
= fun #rrel #rel input pos ->
match k with
| Known k ->
[@inline_let]
let _ = synth_sum_case_injective t k in
pc32 k input pos
| _ -> 0ul // dummy, but we MUST NOT remove this branch, otherwise extraction fails
inline_for_extraction
let jump_sum_aux_payload
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (jumper (dsnd (pc x)))))
(destr: dep_maybe_enum_destr_t (sum_enum t) (jump_sum_aux_payload_t t pc))
(k: sum_repr_type t)
: Tot (jump_sum_aux_payload_t t pc (maybe_enum_key_of_repr (sum_enum t) k))
= destr (jump_sum_aux_payload_eq t pc) (jump_sum_aux_payload_if t pc) (fun _ _ -> ()) (fun _ _ _ _ -> ()) (jump_sum_aux_payload' t pc pc32) k
inline_for_extraction
let jump_sum
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(v: jumper p)
(p32: leaf_reader p)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (jumper (dsnd (pc x)))))
(destr: dep_maybe_enum_destr_t (sum_enum t) (jump_sum_aux_payload_t t pc))
: Tot (jumper (parse_sum t p pc))
= jump_sum_aux t v p32 pc (jump_sum_aux_payload t pc pc32 destr)
inline_for_extraction
let read_sum_cases'
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (leaf_reader (dsnd (pc x)))))
(k: sum_key t)
: Tot (leaf_reader (parse_sum_cases' t pc k))
= [@inline_let]
let _ = synth_sum_case_injective t k in
read_synth'
(dsnd (pc k))
(synth_sum_case t k)
(pc32 k)
()
inline_for_extraction
let read_sum_cases_t
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot Type
= leaf_reader (parse_sum_cases' t pc k)
let read_sum_cases_t_eq
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
(x y : read_sum_cases_t t pc k)
: GTot Type0
= True
inline_for_extraction
let read_sum_cases_t_if
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (if_combinator _ (read_sum_cases_t_eq t pc k))
= fun cond (sv_true: cond_true cond -> Tot (read_sum_cases_t t pc k)) (sv_false: cond_false cond -> Tot (read_sum_cases_t t pc k)) #_ #_ input pos ->
if cond
then (sv_true () input pos)
else (sv_false () input pos)
inline_for_extraction
let read_sum_cases
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (leaf_reader (dsnd (pc x)))))
(destr: dep_enum_destr (sum_enum t) (read_sum_cases_t t pc))
(k: sum_key t)
: Tot (leaf_reader (parse_sum_cases' t pc k))
= destr
_
(read_sum_cases_t_if t pc)
(fun _ _ -> ())
(fun _ _ _ _ -> ())
(read_sum_cases' t pc pc32)
k
#push-options "--z3rlimit 32"
inline_for_extraction
let read_sum
(#kt: parser_kind)
(t: sum)
(p: parser kt (sum_repr_type t))
(p32: leaf_reader (parse_enum_key p (sum_enum t)))
(j: jumper p)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (leaf_reader (dsnd (pc x)))))
(destr: dep_enum_destr (sum_enum t) (read_sum_cases_t t pc))
: Tot (leaf_reader (parse_sum t p pc))
=
fun #_ #_ input pos ->
let h = HST.get () in
valid_facts (parse_sum t p pc) h input pos;
parse_sum_eq' t p pc (bytes_of_slice_from h input pos);
valid_facts (parse_enum_key p (sum_enum t)) h input pos;
let k = p32 input pos in
let pos' = jump_enum_key j (sum_enum t) input pos in
valid_facts (parse_sum_cases' t pc k) h input pos' ;
read_sum_cases t pc pc32 destr k input pos'
#pop-options
inline_for_extraction
let serialize32_sum_cases_t
(t: sum)
(#pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(sc: ((x: sum_key t) -> Tot (serializer (dsnd (pc x)))))
(k: sum_key t)
: Tot Type
= serializer32 (serialize_sum_cases t pc sc k)
let serialize32_sum_cases_t_eq
(t: sum)
(#pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(sc: ((x: sum_key t) -> Tot (serializer (dsnd (pc x)))))
(k: sum_key t)
(x y: serialize32_sum_cases_t t sc k)
: GTot Type0
= True
inline_for_extraction
let serialize32_sum_cases_t_if
(t: sum)
(#pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(sc: ((x: sum_key t) -> Tot (serializer (dsnd (pc x)))))
(k: sum_key t)
: Tot (if_combinator _ (serialize32_sum_cases_t_eq t sc k))
= fun cond (sv_true: (cond_true cond -> Tot (serialize32_sum_cases_t t sc k))) (sv_false: (cond_false cond -> Tot (serialize32_sum_cases_t t sc k))) x #rrel #rel b pos ->
if cond
then (sv_true () x b pos)
else (sv_false () x b pos)
inline_for_extraction
let serialize32_sum_cases_aux
(t: sum)
(#pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(sc: ((x: sum_key t) -> Tot (serializer (dsnd (pc x)))))
(sc32: ((x: sum_key t) -> Tot (serializer32 (sc x))))
(k: sum_key t)
: Tot (serializer32 (serialize_sum_cases t pc sc k))
= fun x #rrel #rel b pos ->
[@inline_let] let _ =
Classical.forall_intro (parse_sum_cases_eq' t pc k);
synth_sum_case_injective t k;
synth_sum_case_inverse t k
in
serialize32_synth
(sc32 k)
(synth_sum_case t k)
(synth_sum_case_recip t k)
(fun x -> synth_sum_case_recip t k x)
()
x
b
pos
inline_for_extraction
let serialize32_sum_cases
(t: sum)
(#pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(sc: ((x: sum_key t) -> Tot (serializer (dsnd (pc x)))))
(sc32: ((x: sum_key t) -> Tot (serializer32 (sc x))))
(destr: dep_enum_destr (sum_enum t) (serialize32_sum_cases_t t sc))
(k: sum_key t)
: Tot (serializer32 (serialize_sum_cases t pc sc k))
= destr
_
(serialize32_sum_cases_t_if t sc)
(fun _ _ -> ())
(fun _ _ _ _ -> ())
(serialize32_sum_cases_aux t sc sc32)
k
inline_for_extraction
let serialize32_sum
(#kt: parser_kind)
(t: sum)
(#p: parser kt (sum_repr_type t))
(s: serializer p {kt.parser_kind_subkind == Some ParserStrong})
(s32: serializer32 (serialize_enum_key _ s (sum_enum t)))
(#pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(sc: ((x: sum_key t) -> Tot (serializer (dsnd (pc x)))))
(sc32: ((x: sum_key t) -> Tot (serializer32 (sc x))))
(destr: dep_enum_destr (sum_enum t) (serialize32_sum_cases_t t sc))
: Tot (serializer32 (serialize_sum t s sc))
= fun x #rrel #rel b pos ->
serialize_sum_eq t s sc x;
let tg = sum_tag_of_data t x in
serialize32_nondep_then_aux s32 (serialize32_sum_cases t sc sc32 destr tg) tg x b pos
let clens_sum_tag
(s: sum)
: Tot (clens (sum_type s) (sum_key s))
= {
clens_cond = (fun _ -> True);
clens_get = sum_tag_of_data s;
}
let gaccessor_sum_tag
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
: Tot (gaccessor (parse_sum t p pc) (parse_enum_key p (sum_enum t)) (clens_sum_tag t))
= gaccessor_tagged_union_tag
(parse_enum_key p (sum_enum t))
(sum_tag_of_data t)
(parse_sum_cases t pc)
inline_for_extraction
let accessor_sum_tag
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
: Tot (accessor (gaccessor_sum_tag t p pc))
= accessor_tagged_union_tag
(parse_enum_key p (sum_enum t))
(sum_tag_of_data t)
(parse_sum_cases t pc)
let clens_sum_payload
(s: sum)
(k: sum_key s)
: Tot (clens (sum_type s) (sum_type_of_tag s k))
= {
clens_cond = (fun (x: sum_type s) -> sum_tag_of_data s x == k);
clens_get = (fun (x: sum_type s) -> synth_sum_case_recip s k x <: Ghost (sum_type_of_tag s k) (requires (sum_tag_of_data s x == k)) (ensures (fun _ -> True)));
}
#push-options "--z3rlimit 32"
let gaccessor_clens_sum_payload'
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (gaccessor' (parse_sum t p pc) (dsnd (pc k)) (clens_sum_payload t k))
= fun (input: bytes) ->
parse_sum_eq'' t p pc input;
let res =
match parse p input with
| Some (_, consumed) ->
synth_sum_case_inverse t k;
synth_sum_case_injective t k;
synth_injective_synth_inverse_synth_inverse_recip (synth_sum_case t k) (synth_sum_case_recip t k) ();
(consumed)
| _ -> 0 // dummy
in
(res <: (res: _ { gaccessor_post' (parse_sum t p pc) (dsnd (pc k)) (clens_sum_payload t k) input res } ))
#push-options "--z3rlimit 64"
let gaccessor_clens_sum_payload_injective
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
(sl sl' : bytes)
: Lemma
(requires (
gaccessor_pre (parse_sum t p pc) (dsnd (pc k)) (clens_sum_payload t k) sl /\
gaccessor_pre (parse_sum t p pc) (dsnd (pc k)) (clens_sum_payload t k) sl' /\
injective_precond (parse_sum t p pc) sl sl'
))
(ensures (gaccessor_clens_sum_payload' t p pc k sl == gaccessor_clens_sum_payload' t p pc k sl'))
= parse_sum_eq'' t p pc sl;
parse_sum_eq'' t p pc sl' ;
parse_injective (parse_sum t p pc) sl sl' ;
parse_injective p sl sl'
#pop-options
let gaccessor_clens_sum_payload_no_lookahead
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
(sl sl' : bytes)
: Lemma
(requires (
(parse_sum_kind kt t pc).parser_kind_subkind == Some ParserStrong /\
gaccessor_pre (parse_sum t p pc) (dsnd (pc k)) (clens_sum_payload t k) sl /\
gaccessor_pre (parse_sum t p pc) (dsnd (pc k)) (clens_sum_payload t k) sl' /\
no_lookahead_on_precond (parse_sum t p pc) sl sl'
))
(ensures (gaccessor_clens_sum_payload' t p pc k sl == gaccessor_clens_sum_payload' t p pc k sl'))
= parse_sum_eq'' t p pc sl;
parse_sum_eq'' t p pc sl' ;
parse_strong_prefix (parse_sum t p pc) sl sl' ;
parse_injective p sl sl'
let gaccessor_clens_sum_payload
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (gaccessor (parse_sum t p pc) (dsnd (pc k)) (clens_sum_payload t k))
= Classical.forall_intro_2 (fun x -> Classical.move_requires (gaccessor_clens_sum_payload_injective t p pc k x));
Classical.forall_intro_2 (fun x -> Classical.move_requires (gaccessor_clens_sum_payload_no_lookahead t p pc k x));
gaccessor_prop_equiv (parse_sum t p pc) (dsnd (pc k)) (clens_sum_payload t k) (gaccessor_clens_sum_payload' t p pc k);
gaccessor_clens_sum_payload' t p pc k
inline_for_extraction
let accessor_clens_sum_payload'
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(j: jumper p)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: HST.Stack U32.t
(requires (fun h ->
valid (parse_sum t p pc) h input pos /\
(clens_sum_payload t k).clens_cond (contents (parse_sum t p pc) h input pos)
))
(ensures (fun h pos' h' ->
B.modifies B.loc_none h h' /\
pos' == slice_access h (gaccessor_clens_sum_payload t p pc k) input pos
))
=
let h = HST.get () in
[@inline_let]
let _ =
let pos' = get_valid_pos (parse_sum t p pc) h input pos in
let large = bytes_of_slice_from h input pos in
slice_access_eq h (gaccessor_clens_sum_payload t p pc k) input pos;
valid_facts (parse_sum t p pc) h input pos;
parse_sum_eq'' t p pc large;
valid_facts p h input pos
in
j input pos
#pop-options
inline_for_extraction
let accessor_clens_sum_payload
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(j: jumper p)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (accessor (gaccessor_clens_sum_payload t p pc k))
= fun #rrel #rel -> accessor_clens_sum_payload' t j pc k #rrel #rel
let clens_sum_cases_payload
(s: sum)
(k: sum_key s)
: Tot (clens (sum_cases s k) (sum_type_of_tag s k))
= {
clens_cond = (fun (x: sum_cases s k) -> True);
clens_get = (fun (x: sum_cases s k) -> synth_sum_case_recip s k x <: Ghost (sum_type_of_tag s k) (requires (True)) (ensures (fun _ -> True)));
}
let gaccessor_clens_sum_cases_payload
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (gaccessor (parse_sum_cases' t pc k) (dsnd (pc k)) (clens_sum_cases_payload t k))
= synth_sum_case_injective t k;
synth_sum_case_inverse t k;
synth_injective_synth_inverse_synth_inverse_recip (synth_sum_case t k) (synth_sum_case_recip t k) ();
gaccessor_ext
(gaccessor_synth (dsnd (pc k)) (synth_sum_case t k) (synth_sum_case_recip t k) ())
(clens_sum_cases_payload t k)
()
inline_for_extraction
let accessor_clens_sum_cases_payload
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (accessor (gaccessor_clens_sum_cases_payload t pc k))
= [@inline_let]
let _ =
synth_sum_case_injective t k;
synth_sum_case_inverse t k;
synth_injective_synth_inverse_synth_inverse_recip (synth_sum_case t k) (synth_sum_case_recip t k) ()
in
accessor_ext
(accessor_synth (dsnd (pc k)) (synth_sum_case t k) (synth_sum_case_recip t k) ())
(clens_sum_cases_payload t k)
()
inline_for_extraction
let validate_dsum_cases_t
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(#k: parser_kind)
(g: parser k (dsum_type_of_unknown_tag s))
(x: dsum_key s)
: Tot Type
= validator (parse_dsum_cases' s f g x)
let validate_dsum_cases_eq
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(#k: parser_kind)
(g: parser k (dsum_type_of_unknown_tag s))
(x: dsum_key s)
(v1 v2 : validate_dsum_cases_t s f g x)
: GTot Type0
= True
inline_for_extraction
let validate_dsum_cases_if'
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(#k: parser_kind)
(g: parser k (dsum_type_of_unknown_tag s))
(x: dsum_key s)
(cond: bool)
(ift: (cond_true cond -> Tot (validate_dsum_cases_t s f g x)))
(iff: (cond_false cond -> Tot (validate_dsum_cases_t s f g x)))
: Tot (validate_dsum_cases_t s f g x)
= fun #rrel #rel input len ->
if cond
then (ift () <: validate_dsum_cases_t s f g x) input len
else (iff () <: validate_dsum_cases_t s f g x) input len
inline_for_extraction
let validate_dsum_cases_if
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(#k: parser_kind)
(g: parser k (dsum_type_of_unknown_tag s))
(x: dsum_key s)
: Tot (if_combinator _ (validate_dsum_cases_eq s f g x))
= validate_dsum_cases_if' s f g x
inline_for_extraction
let validate_dsum_cases'
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(f' : (x: dsum_known_key s) -> Tot (validator (dsnd (f x))))
(#k: parser_kind)
(#g: parser k (dsum_type_of_unknown_tag s))
(g' : validator g)
(x: dsum_key s)
: Tot (validate_dsum_cases_t s f g x)
= [@inline_let]
let _ = synth_dsum_case_injective s x in
match x with
| Known x' -> validate_synth (f' x') (synth_dsum_case s (Known x')) () <: validator (parse_dsum_cases' s f g x)
| Unknown x' -> validate_synth g' (synth_dsum_case s (Unknown x')) () <: validator (parse_dsum_cases' s f g x)
inline_for_extraction
let validate_dsum_cases'_destr
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(f' : (x: dsum_known_key s) -> Tot (validator (dsnd (f x))))
(#k: parser_kind)
(#g: parser k (dsum_type_of_unknown_tag s))
(g' : validator g)
(destr: dep_enum_destr _ (fun k -> validate_dsum_cases_t s f g (Known k)))
(x: dsum_key s)
: Tot (validate_dsum_cases_t s f g x)
= fun #rrel #rel input pos ->
match x with
| Known k ->
destr
_
(fun k -> validate_dsum_cases_if s f g (Known k))
(fun _ _ -> ())
(fun _ _ _ _ -> ())
(fun k -> validate_dsum_cases' s f f' g' (Known k))
k
input
pos
| Unknown r -> validate_dsum_cases' s f f' g' (Unknown r) input pos
inline_for_extraction
let validate_dsum_cases
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(f' : (x: dsum_known_key s) -> Tot (validator (dsnd (f x))))
(#k: parser_kind)
(#g: parser k (dsum_type_of_unknown_tag s))
(g' : validator g)
(destr: dep_enum_destr _ (fun k -> validate_dsum_cases_t s f g (Known k)))
(x: dsum_key s)
: Tot (validator (parse_dsum_cases s f g x))
= fun #rrel #rel input pos ->
let h = HST.get () in
[@inline_let]
let _ =
valid_facts (parse_dsum_cases' s f g x) h input (uint64_to_uint32 pos);
valid_facts (parse_dsum_cases s f g x) h input (uint64_to_uint32 pos);
parse_dsum_cases_eq' s f g x (bytes_of_slice_from h input (uint64_to_uint32 pos))
in
validate_dsum_cases'_destr s f f' g' destr x input pos
#push-options "--z3rlimit 40"
inline_for_extraction
let validate_dsum
(#kt: parser_kind)
(t: dsum)
(#p: parser kt (dsum_repr_type t))
(v: validator p)
(p32: leaf_reader p)
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(f32: (x: dsum_known_key t) -> Tot (validator (dsnd (f x))))
(#k': parser_kind)
(#g: parser k' (dsum_type_of_unknown_tag t))
(g32: validator g)
(destr: dep_maybe_enum_destr_t (dsum_enum t) (validate_dsum_cases_t t f g))
: Tot (validator (parse_dsum t p f g))
= fun #rrel #rel input pos ->
let h = HST.get () in
[@inline_let]
let _ = parse_dsum_eq' t p f g (bytes_of_slice_from h input (uint64_to_uint32 pos)) in
[@inline_let]
let _ = valid_facts (parse_dsum t p f g) h input (uint64_to_uint32 pos) in
[@inline_let]
let _ = valid_facts p h input (uint64_to_uint32 pos) in
let pos_after_tag = v input pos in
if is_error pos_after_tag
then pos_after_tag
else
let tg = p32 input (uint64_to_uint32 pos) in
[@inline_let]
let _ = valid_facts (parse_dsum_cases' t f g (maybe_enum_key_of_repr (dsum_enum t) tg)) h input (uint64_to_uint32 pos_after_tag) in
destr (validate_dsum_cases_eq t f g) (validate_dsum_cases_if t f g) (fun _ _ -> ()) (fun _ _ _ _ -> ()) (validate_dsum_cases' t f f32 g32) tg input pos_after_tag
#pop-options
#reset-options "--z3rlimit 64 --z3cliopt smt.arith.nl=false --initial_ifuel 8 --max_ifuel 8 --initial_fuel 2 --max_fuel 2"
let valid_dsum_intro_known
(h: HS.mem)
(t: dsum)
(#kt: parser_kind)
(p: parser kt (dsum_repr_type t))
(f: ((x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x))))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: Lemma
(requires (
valid (parse_maybe_enum_key p (dsum_enum t)) h input pos /\ (
let k' = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
Known? k' /\ (
let Known k = k' in
valid (dsnd (f k)) h input (get_valid_pos (parse_maybe_enum_key p (dsum_enum t)) h input pos)
))))
(ensures (
let Known k = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
let pos_payload = get_valid_pos (parse_maybe_enum_key p (dsum_enum t)) h input pos in
valid_content_pos
(parse_dsum t p f g) h input pos
(synth_dsum_case t (Known k) (contents (dsnd (f k)) h input pos_payload))
(get_valid_pos (dsnd (f k)) h input pos_payload)
))
= valid_facts (parse_maybe_enum_key p (dsum_enum t)) h input pos;
let Known k = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
let pos_payload = get_valid_pos (parse_maybe_enum_key p (dsum_enum t)) h input pos in
valid_facts (dsnd (f k)) h input pos_payload;
valid_facts (parse_dsum t p f g) h input pos;
parse_dsum_eq t p f g (bytes_of_slice_from h input pos)
let valid_dsum_intro_unknown
(h: HS.mem)
(t: dsum)
(#kt: parser_kind)
(p: parser kt (dsum_repr_type t))
(f: ((x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x))))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: Lemma
(requires (
valid (parse_maybe_enum_key p (dsum_enum t)) h input pos /\ (
let k' = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
Unknown? k' /\
valid g h input (get_valid_pos (parse_maybe_enum_key p (dsum_enum t)) h input pos)
)))
(ensures (
let Unknown r = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
let pos_payload = get_valid_pos (parse_maybe_enum_key p (dsum_enum t)) h input pos in
valid_content_pos
(parse_dsum t p f g) h input pos
(synth_dsum_case t (Unknown r) (contents g h input pos_payload))
(get_valid_pos g h input pos_payload)
))
= valid_facts (parse_maybe_enum_key p (dsum_enum t)) h input pos;
let Unknown r = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
let pos_payload = get_valid_pos (parse_maybe_enum_key p (dsum_enum t)) h input pos in
valid_facts g h input pos_payload;
valid_facts (parse_dsum t p f g) h input pos;
parse_dsum_eq t p f g (bytes_of_slice_from h input pos)
#reset-options
inline_for_extraction
let finalize_dsum_case_known
(t: dsum)
(#kt: parser_kind)
(#p: parser kt (dsum_repr_type t))
(s: serializer p)
(w: leaf_writer_strong s)
(f: ((x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x))))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
(destr: enum_repr_of_key'_t (dsum_enum t))
(k: dsum_known_key t)
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: HST.Stack unit
(requires (fun h ->
let len_tag = serialized_length (serialize_enum_key _ s (dsum_enum t)) k in
U32.v pos + len_tag < 4294967296 /\ (
let pos_payload = pos `U32.add` U32.uint_to_t len_tag in
valid (dsnd (f k)) h input pos_payload /\
writable input.base (U32.v pos) (U32.v pos_payload) h
)))
(ensures (fun h _ h' ->
let len_tag = serialized_length (serialize_enum_key _ s (dsum_enum t)) k in
let pos_payload = pos `U32.add` U32.uint_to_t len_tag in
B.modifies (loc_slice_from_to input pos pos_payload) h h' /\
valid_content_pos (parse_dsum t p f g) h' input pos (synth_dsum_case t (Known k) (contents (dsnd (f k)) h input pos_payload)) (get_valid_pos (dsnd (f k)) h input pos_payload)
))
= let pos1 = write_enum_key w (dsum_enum t) destr k input pos in
let h = HST.get () in
[@inline_let]
let _ =
valid_facts (parse_enum_key p (dsum_enum t)) h input pos;
valid_facts (parse_maybe_enum_key p (dsum_enum t)) h input pos;
let sq = bytes_of_slice_from h input pos in
parse_enum_key_eq p (dsum_enum t) sq;
parse_maybe_enum_key_eq p (dsum_enum t) sq;
valid_dsum_intro_known h t p f g input pos
in
()
inline_for_extraction
let finalize_dsum_case_unknown
(t: dsum)
(#kt: parser_kind)
(#p: parser kt (dsum_repr_type t))
(s: serializer p)
(w: leaf_writer_strong s)
(f: ((x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x))))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
(r: unknown_enum_repr (dsum_enum t))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: HST.Stack unit
(requires (fun h ->
let len_tag = serialized_length s r in
U32.v pos + len_tag < 4294967296 /\ (
let pos_payload = pos `U32.add` U32.uint_to_t len_tag in
valid g h input pos_payload /\
writable input.base (U32.v pos) (U32.v pos_payload) h
)))
(ensures (fun h _ h' ->
let len_tag = serialized_length s r in
let pos_payload = pos `U32.add` U32.uint_to_t len_tag in
B.modifies (loc_slice_from_to input pos pos_payload) h h' /\
valid_content_pos (parse_dsum t p f g) h' input pos (synth_dsum_case t (Unknown r) (contents g h input pos_payload)) (get_valid_pos g h input pos_payload)
))
= let pos1 = w r input pos in
let h = HST.get () in
[@inline_let]
let _ =
valid_facts (parse_maybe_enum_key p (dsum_enum t)) h input pos;
valid_facts p h input pos;
let sq = bytes_of_slice_from h input pos in
parse_maybe_enum_key_eq p (dsum_enum t) sq;
valid_dsum_intro_unknown h t p f g input pos
in
()
let valid_dsum_elim_tag
(h: HS.mem)
(t: dsum)
(#kt: parser_kind)
(p: parser kt (dsum_repr_type t))
(f: ((x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x))))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: Lemma
(requires (
valid (parse_dsum t p f g) h input pos
))
(ensures (
valid (parse_maybe_enum_key p (dsum_enum t)) h input pos /\
contents (parse_maybe_enum_key p (dsum_enum t)) h input pos == dsum_tag_of_data t (contents (parse_dsum t p f g) h input pos)
))
= let _ = parse_dsum_eq_ t p f g (bytes_of_slice_from h input pos) in
let _ = valid_facts (parse_dsum t p f g) h input pos in
let _ = valid_facts (parse_maybe_enum_key p (dsum_enum t)) h input pos in
()
inline_for_extraction
let read_dsum_tag
(t: dsum)
(#kt: parser_kind)
(#p: parser kt (dsum_repr_type t))
(p32: leaf_reader p)
(destr: maybe_enum_destr_t (maybe_enum_key (dsum_enum t)) (dsum_enum t))
(f: ((x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x))))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: HST.Stack (dsum_key t)
(requires (fun h ->
valid (parse_dsum t p f g) h input pos
))
(ensures (fun h res h' ->
B.modifies B.loc_none h h' /\
res == dsum_tag_of_data t (contents (parse_dsum t p f g) h input pos)
))
= let h = HST.get () in
[@inline_let] let _ = valid_dsum_elim_tag h t p f g input pos in
read_maybe_enum_key p32 (dsum_enum t) destr input pos
#push-options "--z3rlimit 32"
let valid_dsum_elim_known
(h: HS.mem)
(t: dsum)
(#kt: parser_kind)
(p: parser kt (dsum_repr_type t))
(f: ((x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x))))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: Lemma
(requires (
valid (parse_dsum t p f g) h input pos /\
Known? (dsum_tag_of_data t (contents (parse_dsum t p f g) h input pos))
))
(ensures (
valid (parse_maybe_enum_key p (dsum_enum t)) h input pos /\ (
let k' = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
let pos_payload = get_valid_pos (parse_maybe_enum_key p (dsum_enum t)) h input pos in
Known? k' /\ (
let Known k = k' in
valid (dsnd (f k)) h input pos_payload /\
valid_content_pos
(parse_dsum t p f g) h input pos
(synth_dsum_case t (Known k) (contents (dsnd (f k)) h input pos_payload))
(get_valid_pos (dsnd (f k)) h input pos_payload)
))))
=
valid_facts (parse_dsum t p f g) h input pos;
parse_dsum_eq t p f g (bytes_of_slice_from h input pos);
valid_facts (parse_maybe_enum_key p (dsum_enum t)) h input pos;
let Known k = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
let pos_payload = get_valid_pos (parse_maybe_enum_key p (dsum_enum t)) h input pos in
valid_facts (dsnd (f k)) h input pos_payload
#pop-options
let valid_dsum_elim_unknown
(h: HS.mem)
(t: dsum)
(#kt: parser_kind)
(p: parser kt (dsum_repr_type t))
(f: ((x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x))))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: Lemma
(requires (
valid (parse_dsum t p f g) h input pos /\
Unknown? (dsum_tag_of_data t (contents (parse_dsum t p f g) h input pos))
))
(ensures (
valid (parse_maybe_enum_key p (dsum_enum t)) h input pos /\ (
let k' = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
let pos_payload = get_valid_pos (parse_maybe_enum_key p (dsum_enum t)) h input pos in
Unknown? k' /\ (
let Unknown r = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
valid g h input pos_payload /\
valid_content_pos
(parse_dsum t p f g) h input pos
(synth_dsum_case t (Unknown r) (contents g h input pos_payload))
(get_valid_pos g h input pos_payload)
))))
=
valid_facts (parse_dsum t p f g) h input pos;
parse_dsum_eq t p f g (bytes_of_slice_from h input pos);
valid_facts (parse_maybe_enum_key p (dsum_enum t)) h input pos;
let Unknown r = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
let pos_payload = get_valid_pos (parse_maybe_enum_key p (dsum_enum t)) h input pos in
valid_facts g h input pos_payload
inline_for_extraction
let jump_dsum_cases_t
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(#k: parser_kind)
(g: parser k (dsum_type_of_unknown_tag s))
(x: dsum_key s)
: Tot Type
= jumper (parse_dsum_cases' s f g x)
let jump_dsum_cases_eq
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(#k: parser_kind)
(g: parser k (dsum_type_of_unknown_tag s))
(x: dsum_key s)
(v1 v2 : jump_dsum_cases_t s f g x)
: GTot Type0
= True
inline_for_extraction
let jump_dsum_cases_if'
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(#k: parser_kind)
(g: parser k (dsum_type_of_unknown_tag s))
(x: dsum_key s)
(cond: bool)
(ift: (cond_true cond -> Tot (jump_dsum_cases_t s f g x)))
(iff: (cond_false cond -> Tot (jump_dsum_cases_t s f g x)))
: Tot (jump_dsum_cases_t s f g x)
= fun #rrel #rel input len ->
if cond
then (ift () <: jump_dsum_cases_t s f g x) input len
else (iff () <: jump_dsum_cases_t s f g x) input len
inline_for_extraction
let jump_dsum_cases_if
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(#k: parser_kind)
(g: parser k (dsum_type_of_unknown_tag s))
(x: dsum_key s)
: Tot (if_combinator _ (jump_dsum_cases_eq s f g x))
= jump_dsum_cases_if' s f g x | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"LowStar.Buffer.fst.checked",
"LowParse.Spec.Sum.fst.checked",
"LowParse.Low.Enum.fst.checked",
"FStar.UInt64.fsti.checked",
"FStar.UInt32.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Int.Cast.fst.checked",
"FStar.HyperStack.ST.fsti.checked",
"FStar.HyperStack.fst.checked",
"FStar.Classical.fsti.checked"
],
"interface_file": false,
"source_file": "LowParse.Low.Sum.fst"
} | [
{
"abbrev": true,
"full_module": "FStar.HyperStack",
"short_module": "HS"
},
{
"abbrev": true,
"full_module": "FStar.UInt64",
"short_module": "U64"
},
{
"abbrev": true,
"full_module": "FStar.Int.Cast",
"short_module": "Cast"
},
{
"abbrev": true,
"full_module": "LowStar.Buffer",
"short_module": "B"
},
{
"abbrev": true,
"full_module": "FStar.HyperStack.ST",
"short_module": "HST"
},
{
"abbrev": true,
"full_module": "FStar.UInt32",
"short_module": "U32"
},
{
"abbrev": false,
"full_module": "LowParse.Spec.Sum",
"short_module": null
},
{
"abbrev": false,
"full_module": "LowParse.Low.Enum",
"short_module": null
},
{
"abbrev": false,
"full_module": "LowParse.Low",
"short_module": null
},
{
"abbrev": false,
"full_module": "LowParse.Low",
"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",
"short_module": null
}
] | {
"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_elim_box": false,
"smtencoding_l_arith_repr": "boxwrap",
"smtencoding_nl_arith_repr": "boxwrap",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": true,
"z3cliopt": [],
"z3refresh": false,
"z3rlimit": 5,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | false |
s: LowParse.Spec.Sum.dsum ->
f:
(x: LowParse.Spec.Sum.dsum_known_key s
-> Prims.dtuple2 LowParse.Spec.Base.parser_kind
(fun k -> LowParse.Spec.Base.parser k (LowParse.Spec.Sum.dsum_type_of_known_tag s x))) ->
f':
(x: LowParse.Spec.Sum.dsum_known_key s
-> LowParse.Low.Base.jumper (FStar.Pervasives.dsnd (f x))) ->
g': LowParse.Low.Base.jumper g ->
x: LowParse.Spec.Sum.dsum_key s
-> LowParse.Low.Sum.jump_dsum_cases_t s f g x | Prims.Tot | [
"total"
] | [] | [
"LowParse.Spec.Sum.dsum",
"LowParse.Spec.Sum.dsum_known_key",
"Prims.dtuple2",
"LowParse.Spec.Base.parser_kind",
"LowParse.Spec.Base.parser",
"LowParse.Spec.Sum.dsum_type_of_known_tag",
"LowParse.Low.Base.jumper",
"Prims.__proj__Mkdtuple2__item___1",
"FStar.Pervasives.dsnd",
"LowParse.Spec.Sum.dsum_type_of_unknown_tag",
"LowParse.Spec.Sum.dsum_key",
"LowParse.Spec.Enum.enum_key",
"LowParse.Spec.Sum.dsum_key_type",
"LowParse.Spec.Sum.dsum_repr_type",
"LowParse.Spec.Sum.dsum_enum",
"LowParse.Low.Combinators.jump_synth",
"LowParse.Spec.Sum.dsum_cases",
"LowParse.Spec.Sum.synth_dsum_case",
"LowParse.Spec.Enum.Known",
"LowParse.Spec.Sum.parse_dsum_cases_kind",
"LowParse.Spec.Sum.parse_dsum_cases'",
"LowParse.Spec.Enum.unknown_enum_repr",
"LowParse.Spec.Enum.Unknown",
"LowParse.Low.Sum.jump_dsum_cases_t",
"Prims.unit",
"LowParse.Spec.Sum.synth_dsum_case_injective"
] | [] | false | false | false | false | false | let jump_dsum_cases'
(s: dsum)
(f: (x: dsum_known_key s -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x))))
(f': (x: dsum_known_key s -> Tot (jumper (dsnd (f x)))))
(#k: parser_kind)
(#g: parser k (dsum_type_of_unknown_tag s))
(g': jumper g)
(x: dsum_key s)
: Tot (jump_dsum_cases_t s f g x) =
| synth_dsum_case_injective s x;
match x with
| Known x' ->
jump_synth (f' x') (synth_dsum_case s (Known x')) () <: jumper (parse_dsum_cases' s f g x)
| Unknown x' ->
jump_synth g' (synth_dsum_case s (Unknown x')) () <: jumper (parse_dsum_cases' s f g x) | false |
LowParse.Low.Sum.fst | LowParse.Low.Sum.read_dsum_cases' | val read_dsum_cases'
(t: dsum)
(f: (x: dsum_known_key t -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x))))
(f32: (x: dsum_known_key t -> Tot (leaf_reader (dsnd (f x)))))
(#k': parser_kind)
(g: parser k' (dsum_type_of_unknown_tag t))
(g32: leaf_reader g)
(x: dsum_key t)
: Tot (leaf_reader (parse_dsum_cases' t f g x)) | val read_dsum_cases'
(t: dsum)
(f: (x: dsum_known_key t -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x))))
(f32: (x: dsum_known_key t -> Tot (leaf_reader (dsnd (f x)))))
(#k': parser_kind)
(g: parser k' (dsum_type_of_unknown_tag t))
(g32: leaf_reader g)
(x: dsum_key t)
: Tot (leaf_reader (parse_dsum_cases' t f g x)) | let read_dsum_cases'
(t: dsum)
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(f32: (x: dsum_known_key t) -> Tot (leaf_reader (dsnd (f x))))
(#k': parser_kind)
(g: parser k' (dsum_type_of_unknown_tag t))
(g32: leaf_reader g)
(x: dsum_key t)
: Tot (leaf_reader (parse_dsum_cases' t f g x))
= fun #rrel #rel input pos ->
[@inline_let]
let _ = synth_dsum_case_injective t x in
match x with
| Known x' ->
read_synth'
(dsnd (f x'))
(synth_dsum_case t (Known x'))
(f32 x')
()
input
pos
| Unknown x' ->
read_synth'
g
(synth_dsum_case t (Unknown x'))
g32
()
input
pos | {
"file_name": "src/lowparse/LowParse.Low.Sum.fst",
"git_rev": "00217c4a89f5ba56002ba9aa5b4a9d5903bfe9fa",
"git_url": "https://github.com/project-everest/everparse.git",
"project_name": "everparse"
} | {
"end_col": 9,
"end_line": 1541,
"start_col": 0,
"start_line": 1513
} | module LowParse.Low.Sum
include LowParse.Low.Enum
include LowParse.Spec.Sum
module U32 = FStar.UInt32
module HST = FStar.HyperStack.ST
module B = LowStar.Buffer
module Cast = FStar.Int.Cast
module U64 = FStar.UInt64
inline_for_extraction
let validate_sum_cases_aux
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(vc: ((x: sum_key t) -> Tot (validator (dsnd (pc x)))))
(k: sum_key t)
: Tot (validator (parse_sum_cases t pc k))
= [@inline_let]
let _ = synth_sum_case_injective t k in
validate_synth
(validate_weaken
(weaken_parse_cases_kind t pc)
(vc k)
()
)
(synth_sum_case t k)
()
inline_for_extraction
let validate_sum_cases_t
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot Type
= validator (parse_sum_cases t pc k)
let validate_sum_cases_t_eq
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
(x y : validate_sum_cases_t t pc k)
: GTot Type0
= True
inline_for_extraction
let validate_sum_cases_t_if
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (if_combinator _ (validate_sum_cases_t_eq t pc k))
= fun cond (sv_true: cond_true cond -> Tot (validate_sum_cases_t t pc k)) (sv_false: cond_false cond -> Tot (validate_sum_cases_t t pc k)) #rrel #rel input pos ->
if cond
then sv_true () input pos
else sv_false () input pos
inline_for_extraction
let validate_sum_cases
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(vc: ((x: sum_key t) -> Tot (validator (dsnd (pc x)))))
(destr: dep_enum_destr (sum_enum t) (validate_sum_cases_t t pc))
(k: sum_key t)
: Tot (validator (parse_sum_cases t pc k))
= destr
_
(validate_sum_cases_t_if t pc)
(fun _ _ -> ())
(fun _ _ _ _ -> ())
(validate_sum_cases_aux t pc vc)
k
inline_for_extraction
let validate_sum_aux_payload_t
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
: Tot Type
= (#rrel: _) -> (#rel: _) ->
(input: slice rrel rel) ->
(pos: U64.t) ->
HST.Stack U64.t
(requires (fun h -> live_slice h input /\ U64.v pos <= U32.v input.len))
(ensures (fun h res h' ->
B.modifies B.loc_none h h' /\ (
match k with
| Unknown _ -> is_error res
| Known k' ->
if is_success res
then
valid_pos (dsnd (pc k')) h input (uint64_to_uint32 pos) (uint64_to_uint32 res)
else
(~ (valid (dsnd (pc k')) h input (uint64_to_uint32 pos)))
)))
let validate_sum_aux_payload_eq
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
: Tot (validate_sum_aux_payload_t t pc k -> validate_sum_aux_payload_t t pc k -> GTot Type0)
= fun _ _ -> True
inline_for_extraction
let validate_sum_aux_payload_if'
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
(cond: bool)
(ift: ((cond_true cond) -> Tot (validate_sum_aux_payload_t t pc k)))
(iff: ((cond_false cond) -> Tot (validate_sum_aux_payload_t t pc k)))
: Tot (validate_sum_aux_payload_t t pc k)
= fun #rrel #rel input pos ->
if cond
then begin
(ift () <: validate_sum_aux_payload_t t pc k) input pos
end else
(iff () <: validate_sum_aux_payload_t t pc k) input pos
inline_for_extraction
let validate_sum_aux_payload_if
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
: Tot (if_combinator _ (validate_sum_aux_payload_eq t pc k))
= validate_sum_aux_payload_if' t pc k
#push-options "--z3rlimit 64 --z3cliopt smt.arith.nl=false --using_facts_from '* -FStar.Int.Cast -LowParse.BitFields'"
// --query_stats --smtencoding.elim_box true --smtencoding.l_arith_repr native --z3refresh"
inline_for_extraction
let validate_sum_aux
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(v: validator p)
(p32: leaf_reader p)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(v_payload: ((k: sum_repr_type t)) -> Tot (validate_sum_aux_payload_t t pc (maybe_enum_key_of_repr (sum_enum t) k)))
: Tot (validator (parse_sum t p pc))
= fun #rrel #rel input pos ->
let h = HST.get () in
[@inline_let]
let _ = parse_sum_eq'' t p pc (bytes_of_slice_from h input (uint64_to_uint32 pos)) in
[@inline_let]
let _ = valid_facts (parse_sum t p pc) h input (uint64_to_uint32 pos) in
[@inline_let]
let _ = valid_facts p h input (uint64_to_uint32 pos) in
let len_after_tag = v input pos in
if is_error len_after_tag
then len_after_tag
else begin
let h1 = HST.get () in
let k' = p32 input (uint64_to_uint32 pos) in
[@inline_let]
let _ =
match maybe_enum_key_of_repr (sum_enum t) k' with
| Known k -> valid_facts (dsnd (pc k)) h input (uint64_to_uint32 len_after_tag)
| _ -> ()
in
v_payload k' input len_after_tag
end
#pop-options
inline_for_extraction
let validate_sum_aux_payload'
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (validator (dsnd (pc x)))))
(k: maybe_enum_key (sum_enum t))
: Tot (validate_sum_aux_payload_t t pc k)
= fun #rrel #rel input pos ->
match k with
| Known k ->
[@inline_let]
let _ = synth_sum_case_injective t k in
pc32 k input pos
// validate_synth (pc32 k) (synth_sum_case t k) () input pos
| _ -> validator_error_generic
inline_for_extraction
let validate_sum_aux_payload
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (validator (dsnd (pc x)))))
(destr: dep_maybe_enum_destr_t (sum_enum t) (validate_sum_aux_payload_t t pc))
(k: sum_repr_type t)
: Tot (validate_sum_aux_payload_t t pc (maybe_enum_key_of_repr (sum_enum t) k))
= destr (validate_sum_aux_payload_eq t pc) (validate_sum_aux_payload_if t pc) (fun _ _ -> ()) (fun _ _ _ _ -> ()) (validate_sum_aux_payload' t pc pc32) k
inline_for_extraction
let validate_sum
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(v: validator p)
(p32: leaf_reader p)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (validator (dsnd (pc x)))))
(destr: dep_maybe_enum_destr_t (sum_enum t) (validate_sum_aux_payload_t t pc))
: Tot (validator (parse_sum t p pc))
= validate_sum_aux t v p32 pc (validate_sum_aux_payload t pc pc32 destr)
module HS = FStar.HyperStack
#push-options "--z3rlimit 256 --z3cliopt smt.arith.nl=false --initial_ifuel 8 --max_ifuel 8 --initial_fuel 2 --max_fuel 2"
#restart-solver
let valid_sum_intro
(h: HS.mem)
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: Lemma
(requires (
valid (parse_enum_key p (sum_enum t)) h input pos /\ (
let k = contents (parse_enum_key p (sum_enum t)) h input pos in
valid (dsnd (pc k)) h input (get_valid_pos (parse_enum_key p (sum_enum t)) h input pos)
)))
(ensures (
let k = contents (parse_enum_key p (sum_enum t)) h input pos in
let pos_payload = get_valid_pos (parse_enum_key p (sum_enum t)) h input pos in
valid_content_pos
(parse_sum t p pc) h input pos
(synth_sum_case t k (contents (dsnd (pc k)) h input pos_payload))
(get_valid_pos (dsnd (pc k)) h input pos_payload)
))
= valid_facts (parse_enum_key p (sum_enum t)) h input pos;
let k = contents (parse_enum_key p (sum_enum t)) h input pos in
let pos_payload = get_valid_pos (parse_enum_key p (sum_enum t)) h input pos in
valid_facts (dsnd (pc k)) h input pos_payload;
valid_facts (parse_sum t p pc) h input pos;
parse_sum_eq t p pc (bytes_of_slice_from h input pos)
#pop-options
inline_for_extraction
let finalize_sum_case
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(s: serializer p)
(w: leaf_writer_strong s)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(destr: enum_repr_of_key'_t (sum_enum t))
(k: sum_key t)
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: HST.Stack unit
(requires (fun h ->
let len_tag = serialized_length (serialize_enum_key _ s (sum_enum t)) k in
U32.v pos + len_tag < 4294967296 /\ (
let pos_payload = pos `U32.add` U32.uint_to_t len_tag in
valid (dsnd (pc k)) h input pos_payload /\
writable input.base (U32.v pos) (U32.v pos_payload) h
)))
(ensures (fun h _ h' ->
let len_tag = serialized_length (serialize_enum_key _ s (sum_enum t)) k in
let pos_payload = pos `U32.add` U32.uint_to_t len_tag in
B.modifies (loc_slice_from_to input pos pos_payload) h h' /\
valid_content_pos (parse_sum t p pc) h' input pos (synth_sum_case t k (contents (dsnd (pc k)) h input pos_payload)) (get_valid_pos (dsnd (pc k)) h input pos_payload)
))
= let pos1 = write_enum_key w (sum_enum t) destr k input pos in
let h = HST.get () in
[@inline_let]
let _ = valid_sum_intro h t p pc input pos in
()
inline_for_extraction
let jump_sum_cases_aux
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(vc: ((x: sum_key t) -> Tot (jumper (dsnd (pc x)))))
(k: sum_key t)
: Tot (jumper (parse_sum_cases t pc k))
= [@inline_let]
let _ = synth_sum_case_injective t k in
jump_synth
(jump_weaken
(weaken_parse_cases_kind t pc)
(vc k)
()
)
(synth_sum_case t k)
()
inline_for_extraction
let jump_sum_cases_t
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot Type
= jumper (parse_sum_cases t pc k)
let jump_sum_cases_t_eq
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
(x y : jump_sum_cases_t t pc k)
: GTot Type0
= True
inline_for_extraction
let jump_sum_cases_t_if
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (if_combinator _ (jump_sum_cases_t_eq t pc k))
= fun cond (sv_true: cond_true cond -> Tot (jump_sum_cases_t t pc k)) (sv_false: cond_false cond -> Tot (jump_sum_cases_t t pc k)) #rrel #rel input pos ->
if cond
then sv_true () input pos
else sv_false () input pos
inline_for_extraction
let jump_sum_cases
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(vc: ((x: sum_key t) -> Tot (jumper (dsnd (pc x)))))
(destr: dep_enum_destr (sum_enum t) (jump_sum_cases_t t pc))
(k: sum_key t)
: Tot (jumper (parse_sum_cases t pc k))
= destr
_
(jump_sum_cases_t_if t pc)
(fun _ _ -> ())
(fun _ _ _ _ -> ())
(jump_sum_cases_aux t pc vc)
k
inline_for_extraction
let jump_sum_aux_payload_t
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
: Tot Type
= (#rrel: _) -> (#rel: _) ->
(input: slice rrel rel) ->
(pos: U32.t) ->
HST.Stack U32.t
(requires (fun h -> live_slice h input /\ U32.v pos <= U32.v input.len /\ (
match k with
| Unknown _ -> False
| Known k' -> valid (dsnd (pc k')) h input pos
)))
(ensures (fun h res h' ->
B.modifies B.loc_none h h' /\ (
match k with
| Unknown _ -> False
| Known k' ->
valid_pos (dsnd (pc k')) h input pos res
)))
let jump_sum_aux_payload_eq
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
: Tot (jump_sum_aux_payload_t t pc k -> jump_sum_aux_payload_t t pc k -> GTot Type0)
= fun _ _ -> True
inline_for_extraction
let jump_sum_aux_payload_if'
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
(cond: bool)
(ift: ((cond_true cond) -> Tot (jump_sum_aux_payload_t t pc k)))
(iff: ((cond_false cond) -> Tot (jump_sum_aux_payload_t t pc k)))
: Tot (jump_sum_aux_payload_t t pc k)
= fun #rrel #rel input pos ->
if cond
then begin
(ift () <: jump_sum_aux_payload_t t pc k) input pos
end else
(iff () <: jump_sum_aux_payload_t t pc k) input pos
inline_for_extraction
let jump_sum_aux_payload_if
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
: Tot (if_combinator _ (jump_sum_aux_payload_eq t pc k))
= jump_sum_aux_payload_if' t pc k
let parse_sum_eq3
(#kt: parser_kind)
(t: sum)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(input: bytes)
(k' : sum_repr_type t)
(consumed_k: consumed_length input)
: Lemma
(requires (Some? (parse (parse_sum t p pc) input) /\ parse p input == Some (k', consumed_k)))
(ensures (
let input_k = Seq.slice input consumed_k (Seq.length input) in
let k = maybe_enum_key_of_repr (sum_enum t) k' in
begin match k with
| Known k ->
Some? (parse (dsnd (pc k)) input_k)
| _ -> False
end
))
= parse_sum_eq'' t p pc input
let parse_sum_eq4
(#kt: parser_kind)
(t: sum)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(input: bytes)
(k' : sum_repr_type t)
(consumed_k: consumed_length input)
(consumed_payload: nat)
: Lemma
(requires (Some? (parse (parse_sum t p pc) input) /\ parse p input == Some (k', consumed_k) /\ (
let input_k = Seq.slice input consumed_k (Seq.length input) in
let k = maybe_enum_key_of_repr (sum_enum t) k' in
begin match k with
| Known k ->
Some? (parse (dsnd (pc k)) input_k) /\ (
let Some (_, consumed_payload') = parse (dsnd (pc k)) input_k in
consumed_payload' == consumed_payload
)
| _ -> False
end
)))
(ensures (
let Some (_, consumed) = parse (parse_sum t p pc) input in
consumed == consumed_k + consumed_payload
))
= parse_sum_eq'' t p pc input
#push-options "--z3rlimit 16"
let valid_sum_elim
(h: HS.mem)
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(#rrel: _) (#rel: _)
(input: slice rrel rel)
(pos: U32.t)
: Lemma
(requires (
valid (parse_sum t p pc) h input pos
))
(ensures (
valid p h input pos /\ (
let pos_payload = get_valid_pos p h input pos in
let k' = maybe_enum_key_of_repr (sum_enum t) (contents p h input pos) in
match k' with
| Known k ->
k == sum_tag_of_data t (contents (parse_sum t p pc) h input pos) /\
valid (dsnd (pc k)) h input pos_payload /\
valid_pos
(parse_sum t p pc) h input pos
(get_valid_pos (dsnd (pc k)) h input pos_payload)
| _ -> False
)))
= let sinput = bytes_of_slice_from h input pos in
let _ = parse_sum_eq'' t p pc sinput in
[@inline_let]
let _ = valid_facts (parse_sum t p pc) h input pos in
let Some (k', consumed_k) = parse p sinput in
let pos_after_tag = U32.uint_to_t (U32.v pos + consumed_k) in
[@inline_let]
let _ = valid_facts p h input pos in
assert (valid_content_pos p h input pos k' pos_after_tag);
match maybe_enum_key_of_repr (sum_enum t) k' with
| Known k -> valid_facts (dsnd (pc k)) h input pos_after_tag
| _ -> ()
#pop-options
let valid_sum_elim_tag
(h: HS.mem)
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: Lemma
(requires (
valid (parse_sum t p pc) h input pos
))
(ensures (
valid (parse_enum_key p (sum_enum t)) h input pos /\
contents (parse_enum_key p (sum_enum t)) h input pos == sum_tag_of_data t (contents (parse_sum t p pc) h input pos)
))
= let _ = parse_sum_eq' t p pc (bytes_of_slice_from h input pos) in
let _ = valid_facts (parse_sum t p pc) h input pos in
let _ = valid_facts (parse_enum_key p (sum_enum t)) h input pos in
()
inline_for_extraction
let read_sum_tag
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(p32: leaf_reader p)
(destr: dep_maybe_enum_destr_t (sum_enum t) (read_enum_key_t (sum_enum t)))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: HST.Stack (sum_key t)
(requires (fun h ->
valid (parse_sum t p pc) h input pos
))
(ensures (fun h res h' ->
B.modifies B.loc_none h h' /\
res == sum_tag_of_data t (contents (parse_sum t p pc) h input pos)
))
= let h = HST.get () in
[@inline_let] let _ = valid_sum_elim_tag h t p pc input pos in
read_enum_key p32 (sum_enum t) destr input pos
inline_for_extraction
let jump_sum_aux
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(v: jumper p)
(p32: leaf_reader p)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(v_payload: ((k: sum_repr_type t)) -> Tot (jump_sum_aux_payload_t t pc (maybe_enum_key_of_repr (sum_enum t) k)))
: Tot (jumper (parse_sum t p pc))
= fun #rrel #rel input pos ->
let h = HST.get () in
[@inline_let]
let _ = valid_sum_elim h t p pc input pos in
let pos_after_tag = v input pos in
let k' = p32 input pos in
v_payload k' input pos_after_tag
inline_for_extraction
let jump_sum_aux_payload'
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (jumper (dsnd (pc x)))))
(k: maybe_enum_key (sum_enum t))
: Tot (jump_sum_aux_payload_t t pc k)
= fun #rrel #rel input pos ->
match k with
| Known k ->
[@inline_let]
let _ = synth_sum_case_injective t k in
pc32 k input pos
| _ -> 0ul // dummy, but we MUST NOT remove this branch, otherwise extraction fails
inline_for_extraction
let jump_sum_aux_payload
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (jumper (dsnd (pc x)))))
(destr: dep_maybe_enum_destr_t (sum_enum t) (jump_sum_aux_payload_t t pc))
(k: sum_repr_type t)
: Tot (jump_sum_aux_payload_t t pc (maybe_enum_key_of_repr (sum_enum t) k))
= destr (jump_sum_aux_payload_eq t pc) (jump_sum_aux_payload_if t pc) (fun _ _ -> ()) (fun _ _ _ _ -> ()) (jump_sum_aux_payload' t pc pc32) k
inline_for_extraction
let jump_sum
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(v: jumper p)
(p32: leaf_reader p)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (jumper (dsnd (pc x)))))
(destr: dep_maybe_enum_destr_t (sum_enum t) (jump_sum_aux_payload_t t pc))
: Tot (jumper (parse_sum t p pc))
= jump_sum_aux t v p32 pc (jump_sum_aux_payload t pc pc32 destr)
inline_for_extraction
let read_sum_cases'
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (leaf_reader (dsnd (pc x)))))
(k: sum_key t)
: Tot (leaf_reader (parse_sum_cases' t pc k))
= [@inline_let]
let _ = synth_sum_case_injective t k in
read_synth'
(dsnd (pc k))
(synth_sum_case t k)
(pc32 k)
()
inline_for_extraction
let read_sum_cases_t
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot Type
= leaf_reader (parse_sum_cases' t pc k)
let read_sum_cases_t_eq
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
(x y : read_sum_cases_t t pc k)
: GTot Type0
= True
inline_for_extraction
let read_sum_cases_t_if
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (if_combinator _ (read_sum_cases_t_eq t pc k))
= fun cond (sv_true: cond_true cond -> Tot (read_sum_cases_t t pc k)) (sv_false: cond_false cond -> Tot (read_sum_cases_t t pc k)) #_ #_ input pos ->
if cond
then (sv_true () input pos)
else (sv_false () input pos)
inline_for_extraction
let read_sum_cases
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (leaf_reader (dsnd (pc x)))))
(destr: dep_enum_destr (sum_enum t) (read_sum_cases_t t pc))
(k: sum_key t)
: Tot (leaf_reader (parse_sum_cases' t pc k))
= destr
_
(read_sum_cases_t_if t pc)
(fun _ _ -> ())
(fun _ _ _ _ -> ())
(read_sum_cases' t pc pc32)
k
#push-options "--z3rlimit 32"
inline_for_extraction
let read_sum
(#kt: parser_kind)
(t: sum)
(p: parser kt (sum_repr_type t))
(p32: leaf_reader (parse_enum_key p (sum_enum t)))
(j: jumper p)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (leaf_reader (dsnd (pc x)))))
(destr: dep_enum_destr (sum_enum t) (read_sum_cases_t t pc))
: Tot (leaf_reader (parse_sum t p pc))
=
fun #_ #_ input pos ->
let h = HST.get () in
valid_facts (parse_sum t p pc) h input pos;
parse_sum_eq' t p pc (bytes_of_slice_from h input pos);
valid_facts (parse_enum_key p (sum_enum t)) h input pos;
let k = p32 input pos in
let pos' = jump_enum_key j (sum_enum t) input pos in
valid_facts (parse_sum_cases' t pc k) h input pos' ;
read_sum_cases t pc pc32 destr k input pos'
#pop-options
inline_for_extraction
let serialize32_sum_cases_t
(t: sum)
(#pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(sc: ((x: sum_key t) -> Tot (serializer (dsnd (pc x)))))
(k: sum_key t)
: Tot Type
= serializer32 (serialize_sum_cases t pc sc k)
let serialize32_sum_cases_t_eq
(t: sum)
(#pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(sc: ((x: sum_key t) -> Tot (serializer (dsnd (pc x)))))
(k: sum_key t)
(x y: serialize32_sum_cases_t t sc k)
: GTot Type0
= True
inline_for_extraction
let serialize32_sum_cases_t_if
(t: sum)
(#pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(sc: ((x: sum_key t) -> Tot (serializer (dsnd (pc x)))))
(k: sum_key t)
: Tot (if_combinator _ (serialize32_sum_cases_t_eq t sc k))
= fun cond (sv_true: (cond_true cond -> Tot (serialize32_sum_cases_t t sc k))) (sv_false: (cond_false cond -> Tot (serialize32_sum_cases_t t sc k))) x #rrel #rel b pos ->
if cond
then (sv_true () x b pos)
else (sv_false () x b pos)
inline_for_extraction
let serialize32_sum_cases_aux
(t: sum)
(#pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(sc: ((x: sum_key t) -> Tot (serializer (dsnd (pc x)))))
(sc32: ((x: sum_key t) -> Tot (serializer32 (sc x))))
(k: sum_key t)
: Tot (serializer32 (serialize_sum_cases t pc sc k))
= fun x #rrel #rel b pos ->
[@inline_let] let _ =
Classical.forall_intro (parse_sum_cases_eq' t pc k);
synth_sum_case_injective t k;
synth_sum_case_inverse t k
in
serialize32_synth
(sc32 k)
(synth_sum_case t k)
(synth_sum_case_recip t k)
(fun x -> synth_sum_case_recip t k x)
()
x
b
pos
inline_for_extraction
let serialize32_sum_cases
(t: sum)
(#pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(sc: ((x: sum_key t) -> Tot (serializer (dsnd (pc x)))))
(sc32: ((x: sum_key t) -> Tot (serializer32 (sc x))))
(destr: dep_enum_destr (sum_enum t) (serialize32_sum_cases_t t sc))
(k: sum_key t)
: Tot (serializer32 (serialize_sum_cases t pc sc k))
= destr
_
(serialize32_sum_cases_t_if t sc)
(fun _ _ -> ())
(fun _ _ _ _ -> ())
(serialize32_sum_cases_aux t sc sc32)
k
inline_for_extraction
let serialize32_sum
(#kt: parser_kind)
(t: sum)
(#p: parser kt (sum_repr_type t))
(s: serializer p {kt.parser_kind_subkind == Some ParserStrong})
(s32: serializer32 (serialize_enum_key _ s (sum_enum t)))
(#pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(sc: ((x: sum_key t) -> Tot (serializer (dsnd (pc x)))))
(sc32: ((x: sum_key t) -> Tot (serializer32 (sc x))))
(destr: dep_enum_destr (sum_enum t) (serialize32_sum_cases_t t sc))
: Tot (serializer32 (serialize_sum t s sc))
= fun x #rrel #rel b pos ->
serialize_sum_eq t s sc x;
let tg = sum_tag_of_data t x in
serialize32_nondep_then_aux s32 (serialize32_sum_cases t sc sc32 destr tg) tg x b pos
let clens_sum_tag
(s: sum)
: Tot (clens (sum_type s) (sum_key s))
= {
clens_cond = (fun _ -> True);
clens_get = sum_tag_of_data s;
}
let gaccessor_sum_tag
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
: Tot (gaccessor (parse_sum t p pc) (parse_enum_key p (sum_enum t)) (clens_sum_tag t))
= gaccessor_tagged_union_tag
(parse_enum_key p (sum_enum t))
(sum_tag_of_data t)
(parse_sum_cases t pc)
inline_for_extraction
let accessor_sum_tag
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
: Tot (accessor (gaccessor_sum_tag t p pc))
= accessor_tagged_union_tag
(parse_enum_key p (sum_enum t))
(sum_tag_of_data t)
(parse_sum_cases t pc)
let clens_sum_payload
(s: sum)
(k: sum_key s)
: Tot (clens (sum_type s) (sum_type_of_tag s k))
= {
clens_cond = (fun (x: sum_type s) -> sum_tag_of_data s x == k);
clens_get = (fun (x: sum_type s) -> synth_sum_case_recip s k x <: Ghost (sum_type_of_tag s k) (requires (sum_tag_of_data s x == k)) (ensures (fun _ -> True)));
}
#push-options "--z3rlimit 32"
let gaccessor_clens_sum_payload'
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (gaccessor' (parse_sum t p pc) (dsnd (pc k)) (clens_sum_payload t k))
= fun (input: bytes) ->
parse_sum_eq'' t p pc input;
let res =
match parse p input with
| Some (_, consumed) ->
synth_sum_case_inverse t k;
synth_sum_case_injective t k;
synth_injective_synth_inverse_synth_inverse_recip (synth_sum_case t k) (synth_sum_case_recip t k) ();
(consumed)
| _ -> 0 // dummy
in
(res <: (res: _ { gaccessor_post' (parse_sum t p pc) (dsnd (pc k)) (clens_sum_payload t k) input res } ))
#push-options "--z3rlimit 64"
let gaccessor_clens_sum_payload_injective
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
(sl sl' : bytes)
: Lemma
(requires (
gaccessor_pre (parse_sum t p pc) (dsnd (pc k)) (clens_sum_payload t k) sl /\
gaccessor_pre (parse_sum t p pc) (dsnd (pc k)) (clens_sum_payload t k) sl' /\
injective_precond (parse_sum t p pc) sl sl'
))
(ensures (gaccessor_clens_sum_payload' t p pc k sl == gaccessor_clens_sum_payload' t p pc k sl'))
= parse_sum_eq'' t p pc sl;
parse_sum_eq'' t p pc sl' ;
parse_injective (parse_sum t p pc) sl sl' ;
parse_injective p sl sl'
#pop-options
let gaccessor_clens_sum_payload_no_lookahead
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
(sl sl' : bytes)
: Lemma
(requires (
(parse_sum_kind kt t pc).parser_kind_subkind == Some ParserStrong /\
gaccessor_pre (parse_sum t p pc) (dsnd (pc k)) (clens_sum_payload t k) sl /\
gaccessor_pre (parse_sum t p pc) (dsnd (pc k)) (clens_sum_payload t k) sl' /\
no_lookahead_on_precond (parse_sum t p pc) sl sl'
))
(ensures (gaccessor_clens_sum_payload' t p pc k sl == gaccessor_clens_sum_payload' t p pc k sl'))
= parse_sum_eq'' t p pc sl;
parse_sum_eq'' t p pc sl' ;
parse_strong_prefix (parse_sum t p pc) sl sl' ;
parse_injective p sl sl'
let gaccessor_clens_sum_payload
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (gaccessor (parse_sum t p pc) (dsnd (pc k)) (clens_sum_payload t k))
= Classical.forall_intro_2 (fun x -> Classical.move_requires (gaccessor_clens_sum_payload_injective t p pc k x));
Classical.forall_intro_2 (fun x -> Classical.move_requires (gaccessor_clens_sum_payload_no_lookahead t p pc k x));
gaccessor_prop_equiv (parse_sum t p pc) (dsnd (pc k)) (clens_sum_payload t k) (gaccessor_clens_sum_payload' t p pc k);
gaccessor_clens_sum_payload' t p pc k
inline_for_extraction
let accessor_clens_sum_payload'
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(j: jumper p)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: HST.Stack U32.t
(requires (fun h ->
valid (parse_sum t p pc) h input pos /\
(clens_sum_payload t k).clens_cond (contents (parse_sum t p pc) h input pos)
))
(ensures (fun h pos' h' ->
B.modifies B.loc_none h h' /\
pos' == slice_access h (gaccessor_clens_sum_payload t p pc k) input pos
))
=
let h = HST.get () in
[@inline_let]
let _ =
let pos' = get_valid_pos (parse_sum t p pc) h input pos in
let large = bytes_of_slice_from h input pos in
slice_access_eq h (gaccessor_clens_sum_payload t p pc k) input pos;
valid_facts (parse_sum t p pc) h input pos;
parse_sum_eq'' t p pc large;
valid_facts p h input pos
in
j input pos
#pop-options
inline_for_extraction
let accessor_clens_sum_payload
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(j: jumper p)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (accessor (gaccessor_clens_sum_payload t p pc k))
= fun #rrel #rel -> accessor_clens_sum_payload' t j pc k #rrel #rel
let clens_sum_cases_payload
(s: sum)
(k: sum_key s)
: Tot (clens (sum_cases s k) (sum_type_of_tag s k))
= {
clens_cond = (fun (x: sum_cases s k) -> True);
clens_get = (fun (x: sum_cases s k) -> synth_sum_case_recip s k x <: Ghost (sum_type_of_tag s k) (requires (True)) (ensures (fun _ -> True)));
}
let gaccessor_clens_sum_cases_payload
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (gaccessor (parse_sum_cases' t pc k) (dsnd (pc k)) (clens_sum_cases_payload t k))
= synth_sum_case_injective t k;
synth_sum_case_inverse t k;
synth_injective_synth_inverse_synth_inverse_recip (synth_sum_case t k) (synth_sum_case_recip t k) ();
gaccessor_ext
(gaccessor_synth (dsnd (pc k)) (synth_sum_case t k) (synth_sum_case_recip t k) ())
(clens_sum_cases_payload t k)
()
inline_for_extraction
let accessor_clens_sum_cases_payload
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (accessor (gaccessor_clens_sum_cases_payload t pc k))
= [@inline_let]
let _ =
synth_sum_case_injective t k;
synth_sum_case_inverse t k;
synth_injective_synth_inverse_synth_inverse_recip (synth_sum_case t k) (synth_sum_case_recip t k) ()
in
accessor_ext
(accessor_synth (dsnd (pc k)) (synth_sum_case t k) (synth_sum_case_recip t k) ())
(clens_sum_cases_payload t k)
()
inline_for_extraction
let validate_dsum_cases_t
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(#k: parser_kind)
(g: parser k (dsum_type_of_unknown_tag s))
(x: dsum_key s)
: Tot Type
= validator (parse_dsum_cases' s f g x)
let validate_dsum_cases_eq
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(#k: parser_kind)
(g: parser k (dsum_type_of_unknown_tag s))
(x: dsum_key s)
(v1 v2 : validate_dsum_cases_t s f g x)
: GTot Type0
= True
inline_for_extraction
let validate_dsum_cases_if'
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(#k: parser_kind)
(g: parser k (dsum_type_of_unknown_tag s))
(x: dsum_key s)
(cond: bool)
(ift: (cond_true cond -> Tot (validate_dsum_cases_t s f g x)))
(iff: (cond_false cond -> Tot (validate_dsum_cases_t s f g x)))
: Tot (validate_dsum_cases_t s f g x)
= fun #rrel #rel input len ->
if cond
then (ift () <: validate_dsum_cases_t s f g x) input len
else (iff () <: validate_dsum_cases_t s f g x) input len
inline_for_extraction
let validate_dsum_cases_if
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(#k: parser_kind)
(g: parser k (dsum_type_of_unknown_tag s))
(x: dsum_key s)
: Tot (if_combinator _ (validate_dsum_cases_eq s f g x))
= validate_dsum_cases_if' s f g x
inline_for_extraction
let validate_dsum_cases'
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(f' : (x: dsum_known_key s) -> Tot (validator (dsnd (f x))))
(#k: parser_kind)
(#g: parser k (dsum_type_of_unknown_tag s))
(g' : validator g)
(x: dsum_key s)
: Tot (validate_dsum_cases_t s f g x)
= [@inline_let]
let _ = synth_dsum_case_injective s x in
match x with
| Known x' -> validate_synth (f' x') (synth_dsum_case s (Known x')) () <: validator (parse_dsum_cases' s f g x)
| Unknown x' -> validate_synth g' (synth_dsum_case s (Unknown x')) () <: validator (parse_dsum_cases' s f g x)
inline_for_extraction
let validate_dsum_cases'_destr
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(f' : (x: dsum_known_key s) -> Tot (validator (dsnd (f x))))
(#k: parser_kind)
(#g: parser k (dsum_type_of_unknown_tag s))
(g' : validator g)
(destr: dep_enum_destr _ (fun k -> validate_dsum_cases_t s f g (Known k)))
(x: dsum_key s)
: Tot (validate_dsum_cases_t s f g x)
= fun #rrel #rel input pos ->
match x with
| Known k ->
destr
_
(fun k -> validate_dsum_cases_if s f g (Known k))
(fun _ _ -> ())
(fun _ _ _ _ -> ())
(fun k -> validate_dsum_cases' s f f' g' (Known k))
k
input
pos
| Unknown r -> validate_dsum_cases' s f f' g' (Unknown r) input pos
inline_for_extraction
let validate_dsum_cases
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(f' : (x: dsum_known_key s) -> Tot (validator (dsnd (f x))))
(#k: parser_kind)
(#g: parser k (dsum_type_of_unknown_tag s))
(g' : validator g)
(destr: dep_enum_destr _ (fun k -> validate_dsum_cases_t s f g (Known k)))
(x: dsum_key s)
: Tot (validator (parse_dsum_cases s f g x))
= fun #rrel #rel input pos ->
let h = HST.get () in
[@inline_let]
let _ =
valid_facts (parse_dsum_cases' s f g x) h input (uint64_to_uint32 pos);
valid_facts (parse_dsum_cases s f g x) h input (uint64_to_uint32 pos);
parse_dsum_cases_eq' s f g x (bytes_of_slice_from h input (uint64_to_uint32 pos))
in
validate_dsum_cases'_destr s f f' g' destr x input pos
#push-options "--z3rlimit 40"
inline_for_extraction
let validate_dsum
(#kt: parser_kind)
(t: dsum)
(#p: parser kt (dsum_repr_type t))
(v: validator p)
(p32: leaf_reader p)
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(f32: (x: dsum_known_key t) -> Tot (validator (dsnd (f x))))
(#k': parser_kind)
(#g: parser k' (dsum_type_of_unknown_tag t))
(g32: validator g)
(destr: dep_maybe_enum_destr_t (dsum_enum t) (validate_dsum_cases_t t f g))
: Tot (validator (parse_dsum t p f g))
= fun #rrel #rel input pos ->
let h = HST.get () in
[@inline_let]
let _ = parse_dsum_eq' t p f g (bytes_of_slice_from h input (uint64_to_uint32 pos)) in
[@inline_let]
let _ = valid_facts (parse_dsum t p f g) h input (uint64_to_uint32 pos) in
[@inline_let]
let _ = valid_facts p h input (uint64_to_uint32 pos) in
let pos_after_tag = v input pos in
if is_error pos_after_tag
then pos_after_tag
else
let tg = p32 input (uint64_to_uint32 pos) in
[@inline_let]
let _ = valid_facts (parse_dsum_cases' t f g (maybe_enum_key_of_repr (dsum_enum t) tg)) h input (uint64_to_uint32 pos_after_tag) in
destr (validate_dsum_cases_eq t f g) (validate_dsum_cases_if t f g) (fun _ _ -> ()) (fun _ _ _ _ -> ()) (validate_dsum_cases' t f f32 g32) tg input pos_after_tag
#pop-options
#reset-options "--z3rlimit 64 --z3cliopt smt.arith.nl=false --initial_ifuel 8 --max_ifuel 8 --initial_fuel 2 --max_fuel 2"
let valid_dsum_intro_known
(h: HS.mem)
(t: dsum)
(#kt: parser_kind)
(p: parser kt (dsum_repr_type t))
(f: ((x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x))))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: Lemma
(requires (
valid (parse_maybe_enum_key p (dsum_enum t)) h input pos /\ (
let k' = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
Known? k' /\ (
let Known k = k' in
valid (dsnd (f k)) h input (get_valid_pos (parse_maybe_enum_key p (dsum_enum t)) h input pos)
))))
(ensures (
let Known k = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
let pos_payload = get_valid_pos (parse_maybe_enum_key p (dsum_enum t)) h input pos in
valid_content_pos
(parse_dsum t p f g) h input pos
(synth_dsum_case t (Known k) (contents (dsnd (f k)) h input pos_payload))
(get_valid_pos (dsnd (f k)) h input pos_payload)
))
= valid_facts (parse_maybe_enum_key p (dsum_enum t)) h input pos;
let Known k = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
let pos_payload = get_valid_pos (parse_maybe_enum_key p (dsum_enum t)) h input pos in
valid_facts (dsnd (f k)) h input pos_payload;
valid_facts (parse_dsum t p f g) h input pos;
parse_dsum_eq t p f g (bytes_of_slice_from h input pos)
let valid_dsum_intro_unknown
(h: HS.mem)
(t: dsum)
(#kt: parser_kind)
(p: parser kt (dsum_repr_type t))
(f: ((x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x))))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: Lemma
(requires (
valid (parse_maybe_enum_key p (dsum_enum t)) h input pos /\ (
let k' = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
Unknown? k' /\
valid g h input (get_valid_pos (parse_maybe_enum_key p (dsum_enum t)) h input pos)
)))
(ensures (
let Unknown r = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
let pos_payload = get_valid_pos (parse_maybe_enum_key p (dsum_enum t)) h input pos in
valid_content_pos
(parse_dsum t p f g) h input pos
(synth_dsum_case t (Unknown r) (contents g h input pos_payload))
(get_valid_pos g h input pos_payload)
))
= valid_facts (parse_maybe_enum_key p (dsum_enum t)) h input pos;
let Unknown r = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
let pos_payload = get_valid_pos (parse_maybe_enum_key p (dsum_enum t)) h input pos in
valid_facts g h input pos_payload;
valid_facts (parse_dsum t p f g) h input pos;
parse_dsum_eq t p f g (bytes_of_slice_from h input pos)
#reset-options
inline_for_extraction
let finalize_dsum_case_known
(t: dsum)
(#kt: parser_kind)
(#p: parser kt (dsum_repr_type t))
(s: serializer p)
(w: leaf_writer_strong s)
(f: ((x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x))))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
(destr: enum_repr_of_key'_t (dsum_enum t))
(k: dsum_known_key t)
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: HST.Stack unit
(requires (fun h ->
let len_tag = serialized_length (serialize_enum_key _ s (dsum_enum t)) k in
U32.v pos + len_tag < 4294967296 /\ (
let pos_payload = pos `U32.add` U32.uint_to_t len_tag in
valid (dsnd (f k)) h input pos_payload /\
writable input.base (U32.v pos) (U32.v pos_payload) h
)))
(ensures (fun h _ h' ->
let len_tag = serialized_length (serialize_enum_key _ s (dsum_enum t)) k in
let pos_payload = pos `U32.add` U32.uint_to_t len_tag in
B.modifies (loc_slice_from_to input pos pos_payload) h h' /\
valid_content_pos (parse_dsum t p f g) h' input pos (synth_dsum_case t (Known k) (contents (dsnd (f k)) h input pos_payload)) (get_valid_pos (dsnd (f k)) h input pos_payload)
))
= let pos1 = write_enum_key w (dsum_enum t) destr k input pos in
let h = HST.get () in
[@inline_let]
let _ =
valid_facts (parse_enum_key p (dsum_enum t)) h input pos;
valid_facts (parse_maybe_enum_key p (dsum_enum t)) h input pos;
let sq = bytes_of_slice_from h input pos in
parse_enum_key_eq p (dsum_enum t) sq;
parse_maybe_enum_key_eq p (dsum_enum t) sq;
valid_dsum_intro_known h t p f g input pos
in
()
inline_for_extraction
let finalize_dsum_case_unknown
(t: dsum)
(#kt: parser_kind)
(#p: parser kt (dsum_repr_type t))
(s: serializer p)
(w: leaf_writer_strong s)
(f: ((x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x))))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
(r: unknown_enum_repr (dsum_enum t))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: HST.Stack unit
(requires (fun h ->
let len_tag = serialized_length s r in
U32.v pos + len_tag < 4294967296 /\ (
let pos_payload = pos `U32.add` U32.uint_to_t len_tag in
valid g h input pos_payload /\
writable input.base (U32.v pos) (U32.v pos_payload) h
)))
(ensures (fun h _ h' ->
let len_tag = serialized_length s r in
let pos_payload = pos `U32.add` U32.uint_to_t len_tag in
B.modifies (loc_slice_from_to input pos pos_payload) h h' /\
valid_content_pos (parse_dsum t p f g) h' input pos (synth_dsum_case t (Unknown r) (contents g h input pos_payload)) (get_valid_pos g h input pos_payload)
))
= let pos1 = w r input pos in
let h = HST.get () in
[@inline_let]
let _ =
valid_facts (parse_maybe_enum_key p (dsum_enum t)) h input pos;
valid_facts p h input pos;
let sq = bytes_of_slice_from h input pos in
parse_maybe_enum_key_eq p (dsum_enum t) sq;
valid_dsum_intro_unknown h t p f g input pos
in
()
let valid_dsum_elim_tag
(h: HS.mem)
(t: dsum)
(#kt: parser_kind)
(p: parser kt (dsum_repr_type t))
(f: ((x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x))))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: Lemma
(requires (
valid (parse_dsum t p f g) h input pos
))
(ensures (
valid (parse_maybe_enum_key p (dsum_enum t)) h input pos /\
contents (parse_maybe_enum_key p (dsum_enum t)) h input pos == dsum_tag_of_data t (contents (parse_dsum t p f g) h input pos)
))
= let _ = parse_dsum_eq_ t p f g (bytes_of_slice_from h input pos) in
let _ = valid_facts (parse_dsum t p f g) h input pos in
let _ = valid_facts (parse_maybe_enum_key p (dsum_enum t)) h input pos in
()
inline_for_extraction
let read_dsum_tag
(t: dsum)
(#kt: parser_kind)
(#p: parser kt (dsum_repr_type t))
(p32: leaf_reader p)
(destr: maybe_enum_destr_t (maybe_enum_key (dsum_enum t)) (dsum_enum t))
(f: ((x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x))))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: HST.Stack (dsum_key t)
(requires (fun h ->
valid (parse_dsum t p f g) h input pos
))
(ensures (fun h res h' ->
B.modifies B.loc_none h h' /\
res == dsum_tag_of_data t (contents (parse_dsum t p f g) h input pos)
))
= let h = HST.get () in
[@inline_let] let _ = valid_dsum_elim_tag h t p f g input pos in
read_maybe_enum_key p32 (dsum_enum t) destr input pos
#push-options "--z3rlimit 32"
let valid_dsum_elim_known
(h: HS.mem)
(t: dsum)
(#kt: parser_kind)
(p: parser kt (dsum_repr_type t))
(f: ((x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x))))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: Lemma
(requires (
valid (parse_dsum t p f g) h input pos /\
Known? (dsum_tag_of_data t (contents (parse_dsum t p f g) h input pos))
))
(ensures (
valid (parse_maybe_enum_key p (dsum_enum t)) h input pos /\ (
let k' = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
let pos_payload = get_valid_pos (parse_maybe_enum_key p (dsum_enum t)) h input pos in
Known? k' /\ (
let Known k = k' in
valid (dsnd (f k)) h input pos_payload /\
valid_content_pos
(parse_dsum t p f g) h input pos
(synth_dsum_case t (Known k) (contents (dsnd (f k)) h input pos_payload))
(get_valid_pos (dsnd (f k)) h input pos_payload)
))))
=
valid_facts (parse_dsum t p f g) h input pos;
parse_dsum_eq t p f g (bytes_of_slice_from h input pos);
valid_facts (parse_maybe_enum_key p (dsum_enum t)) h input pos;
let Known k = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
let pos_payload = get_valid_pos (parse_maybe_enum_key p (dsum_enum t)) h input pos in
valid_facts (dsnd (f k)) h input pos_payload
#pop-options
let valid_dsum_elim_unknown
(h: HS.mem)
(t: dsum)
(#kt: parser_kind)
(p: parser kt (dsum_repr_type t))
(f: ((x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x))))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: Lemma
(requires (
valid (parse_dsum t p f g) h input pos /\
Unknown? (dsum_tag_of_data t (contents (parse_dsum t p f g) h input pos))
))
(ensures (
valid (parse_maybe_enum_key p (dsum_enum t)) h input pos /\ (
let k' = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
let pos_payload = get_valid_pos (parse_maybe_enum_key p (dsum_enum t)) h input pos in
Unknown? k' /\ (
let Unknown r = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
valid g h input pos_payload /\
valid_content_pos
(parse_dsum t p f g) h input pos
(synth_dsum_case t (Unknown r) (contents g h input pos_payload))
(get_valid_pos g h input pos_payload)
))))
=
valid_facts (parse_dsum t p f g) h input pos;
parse_dsum_eq t p f g (bytes_of_slice_from h input pos);
valid_facts (parse_maybe_enum_key p (dsum_enum t)) h input pos;
let Unknown r = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
let pos_payload = get_valid_pos (parse_maybe_enum_key p (dsum_enum t)) h input pos in
valid_facts g h input pos_payload
inline_for_extraction
let jump_dsum_cases_t
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(#k: parser_kind)
(g: parser k (dsum_type_of_unknown_tag s))
(x: dsum_key s)
: Tot Type
= jumper (parse_dsum_cases' s f g x)
let jump_dsum_cases_eq
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(#k: parser_kind)
(g: parser k (dsum_type_of_unknown_tag s))
(x: dsum_key s)
(v1 v2 : jump_dsum_cases_t s f g x)
: GTot Type0
= True
inline_for_extraction
let jump_dsum_cases_if'
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(#k: parser_kind)
(g: parser k (dsum_type_of_unknown_tag s))
(x: dsum_key s)
(cond: bool)
(ift: (cond_true cond -> Tot (jump_dsum_cases_t s f g x)))
(iff: (cond_false cond -> Tot (jump_dsum_cases_t s f g x)))
: Tot (jump_dsum_cases_t s f g x)
= fun #rrel #rel input len ->
if cond
then (ift () <: jump_dsum_cases_t s f g x) input len
else (iff () <: jump_dsum_cases_t s f g x) input len
inline_for_extraction
let jump_dsum_cases_if
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(#k: parser_kind)
(g: parser k (dsum_type_of_unknown_tag s))
(x: dsum_key s)
: Tot (if_combinator _ (jump_dsum_cases_eq s f g x))
= jump_dsum_cases_if' s f g x
inline_for_extraction
let jump_dsum_cases'
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(f' : (x: dsum_known_key s) -> Tot (jumper (dsnd (f x))))
(#k: parser_kind)
(#g: parser k (dsum_type_of_unknown_tag s))
(g' : jumper g)
(x: dsum_key s)
: Tot (jump_dsum_cases_t s f g x)
= synth_dsum_case_injective s x;
match x with
| Known x' -> jump_synth (f' x') (synth_dsum_case s (Known x')) () <: jumper (parse_dsum_cases' s f g x)
| Unknown x' -> jump_synth g' (synth_dsum_case s (Unknown x')) () <: jumper (parse_dsum_cases' s f g x)
inline_for_extraction
let jump_dsum_cases'_destr
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(f' : (x: dsum_known_key s) -> Tot (jumper (dsnd (f x))))
(#k: parser_kind)
(#g: parser k (dsum_type_of_unknown_tag s))
(g' : jumper g)
(destr: dep_enum_destr _ (fun k -> jump_dsum_cases_t s f g (Known k)))
(x: dsum_key s)
: Tot (jump_dsum_cases_t s f g x)
= fun #rrel #rel input pos ->
match x with
| Known k ->
destr
_
(fun k -> jump_dsum_cases_if s f g (Known k))
(fun _ _ -> ())
(fun _ _ _ _ -> ())
(fun k -> jump_dsum_cases' s f f' g' (Known k))
k
input
pos
| Unknown r -> jump_dsum_cases' s f f' g' (Unknown r) input pos
inline_for_extraction
let jump_dsum_cases
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(f' : (x: dsum_known_key s) -> Tot (jumper (dsnd (f x))))
(#k: parser_kind)
(#g: parser k (dsum_type_of_unknown_tag s))
(g' : jumper g)
(destr: dep_enum_destr _ (fun k -> jump_dsum_cases_t s f g (Known k)))
(x: dsum_key s)
: Tot (jumper (parse_dsum_cases s f g x))
= fun #rrel #rel input pos ->
let h = HST.get () in
[@inline_let]
let _ =
valid_facts (parse_dsum_cases' s f g x) h input pos;
valid_facts (parse_dsum_cases s f g x) h input pos;
parse_dsum_cases_eq' s f g x (bytes_of_slice_from h input pos)
in
jump_dsum_cases'_destr s f f' g' destr x input pos
#push-options "--z3rlimit 16"
inline_for_extraction
let jump_dsum
(#kt: parser_kind)
(t: dsum)
(#p: parser kt (dsum_repr_type t))
(v: jumper p)
(p32: leaf_reader p)
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(f32: (x: dsum_known_key t) -> Tot (jumper (dsnd (f x))))
(#k': parser_kind)
(#g: parser k' (dsum_type_of_unknown_tag t))
(g32: jumper g)
(destr: dep_maybe_enum_destr_t (dsum_enum t) (jump_dsum_cases_t t f g))
: Tot (jumper (parse_dsum t p f g))
= fun #rrel #rel input pos ->
let h = HST.get () in
[@inline_let]
let _ = parse_dsum_eq' t p f g (bytes_of_slice_from h input pos) in
[@inline_let]
let _ = valid_facts (parse_dsum t p f g) h input pos in
[@inline_let]
let _ = valid_facts p h input pos in
let pos_after_tag = v input pos in
let tg = p32 input pos in
[@inline_let]
let _ = valid_facts (parse_dsum_cases' t f g (maybe_enum_key_of_repr (dsum_enum t) tg)) h input pos_after_tag in
destr (jump_dsum_cases_eq t f g) (jump_dsum_cases_if t f g) (fun _ _ -> ()) (fun _ _ _ _ -> ()) (jump_dsum_cases' t f f32 g32) tg input pos_after_tag
#pop-options | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"LowStar.Buffer.fst.checked",
"LowParse.Spec.Sum.fst.checked",
"LowParse.Low.Enum.fst.checked",
"FStar.UInt64.fsti.checked",
"FStar.UInt32.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Int.Cast.fst.checked",
"FStar.HyperStack.ST.fsti.checked",
"FStar.HyperStack.fst.checked",
"FStar.Classical.fsti.checked"
],
"interface_file": false,
"source_file": "LowParse.Low.Sum.fst"
} | [
{
"abbrev": true,
"full_module": "FStar.HyperStack",
"short_module": "HS"
},
{
"abbrev": true,
"full_module": "FStar.UInt64",
"short_module": "U64"
},
{
"abbrev": true,
"full_module": "FStar.Int.Cast",
"short_module": "Cast"
},
{
"abbrev": true,
"full_module": "LowStar.Buffer",
"short_module": "B"
},
{
"abbrev": true,
"full_module": "FStar.HyperStack.ST",
"short_module": "HST"
},
{
"abbrev": true,
"full_module": "FStar.UInt32",
"short_module": "U32"
},
{
"abbrev": false,
"full_module": "LowParse.Spec.Sum",
"short_module": null
},
{
"abbrev": false,
"full_module": "LowParse.Low.Enum",
"short_module": null
},
{
"abbrev": false,
"full_module": "LowParse.Low",
"short_module": null
},
{
"abbrev": false,
"full_module": "LowParse.Low",
"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",
"short_module": null
}
] | {
"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_elim_box": false,
"smtencoding_l_arith_repr": "boxwrap",
"smtencoding_nl_arith_repr": "boxwrap",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": true,
"z3cliopt": [],
"z3refresh": false,
"z3rlimit": 5,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | false |
t: LowParse.Spec.Sum.dsum ->
f:
(x: LowParse.Spec.Sum.dsum_known_key t
-> Prims.dtuple2 LowParse.Spec.Base.parser_kind
(fun k -> LowParse.Spec.Base.parser k (LowParse.Spec.Sum.dsum_type_of_known_tag t x))) ->
f32:
(x: LowParse.Spec.Sum.dsum_known_key t
-> LowParse.Low.Base.leaf_reader (FStar.Pervasives.dsnd (f x))) ->
g: LowParse.Spec.Base.parser k' (LowParse.Spec.Sum.dsum_type_of_unknown_tag t) ->
g32: LowParse.Low.Base.leaf_reader g ->
x: LowParse.Spec.Sum.dsum_key t
-> LowParse.Low.Base.leaf_reader (LowParse.Spec.Sum.parse_dsum_cases' t f g x) | Prims.Tot | [
"total"
] | [] | [
"LowParse.Spec.Sum.dsum",
"LowParse.Spec.Sum.dsum_known_key",
"Prims.dtuple2",
"LowParse.Spec.Base.parser_kind",
"LowParse.Spec.Base.parser",
"LowParse.Spec.Sum.dsum_type_of_known_tag",
"LowParse.Low.Base.leaf_reader",
"Prims.__proj__Mkdtuple2__item___1",
"FStar.Pervasives.dsnd",
"LowParse.Spec.Sum.dsum_type_of_unknown_tag",
"LowParse.Spec.Sum.dsum_key",
"LowParse.Slice.srel",
"LowParse.Bytes.byte",
"LowParse.Slice.slice",
"FStar.UInt32.t",
"LowParse.Spec.Enum.enum_key",
"LowParse.Spec.Sum.dsum_key_type",
"LowParse.Spec.Sum.dsum_repr_type",
"LowParse.Spec.Sum.dsum_enum",
"LowParse.Low.Combinators.read_synth'",
"LowParse.Spec.Sum.dsum_cases",
"LowParse.Spec.Sum.synth_dsum_case",
"LowParse.Spec.Enum.Known",
"LowParse.Spec.Enum.unknown_enum_repr",
"LowParse.Spec.Enum.Unknown",
"Prims.unit",
"LowParse.Spec.Sum.synth_dsum_case_injective",
"LowParse.Spec.Sum.parse_dsum_cases_kind",
"LowParse.Spec.Sum.parse_dsum_cases'"
] | [] | false | false | false | false | false | let read_dsum_cases'
(t: dsum)
(f: (x: dsum_known_key t -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x))))
(f32: (x: dsum_known_key t -> Tot (leaf_reader (dsnd (f x)))))
(#k': parser_kind)
(g: parser k' (dsum_type_of_unknown_tag t))
(g32: leaf_reader g)
(x: dsum_key t)
: Tot (leaf_reader (parse_dsum_cases' t f g x)) =
| fun #rrel #rel input pos ->
[@@ inline_let ]let _ = synth_dsum_case_injective t x in
match x with
| Known x' -> read_synth' (dsnd (f x')) (synth_dsum_case t (Known x')) (f32 x') () input pos
| Unknown x' -> read_synth' g (synth_dsum_case t (Unknown x')) g32 () input pos | false |
LowParse.Low.Sum.fst | LowParse.Low.Sum.finalize_dsum_case_unknown | val finalize_dsum_case_unknown
(t: dsum)
(#kt: parser_kind)
(#p: parser kt (dsum_repr_type t))
(s: serializer p)
(w: leaf_writer_strong s)
(f: (x: dsum_known_key t -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x))))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
(r: unknown_enum_repr (dsum_enum t))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: HST.Stack unit
(requires
(fun h ->
let len_tag = serialized_length s r in
U32.v pos + len_tag < 4294967296 /\
(let pos_payload = pos `U32.add` (U32.uint_to_t len_tag) in
valid g h input pos_payload /\ writable input.base (U32.v pos) (U32.v pos_payload) h))
)
(ensures
(fun h _ h' ->
let len_tag = serialized_length s r in
let pos_payload = pos `U32.add` (U32.uint_to_t len_tag) in
B.modifies (loc_slice_from_to input pos pos_payload) h h' /\
valid_content_pos (parse_dsum t p f g)
h'
input
pos
(synth_dsum_case t (Unknown r) (contents g h input pos_payload))
(get_valid_pos g h input pos_payload))) | val finalize_dsum_case_unknown
(t: dsum)
(#kt: parser_kind)
(#p: parser kt (dsum_repr_type t))
(s: serializer p)
(w: leaf_writer_strong s)
(f: (x: dsum_known_key t -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x))))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
(r: unknown_enum_repr (dsum_enum t))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: HST.Stack unit
(requires
(fun h ->
let len_tag = serialized_length s r in
U32.v pos + len_tag < 4294967296 /\
(let pos_payload = pos `U32.add` (U32.uint_to_t len_tag) in
valid g h input pos_payload /\ writable input.base (U32.v pos) (U32.v pos_payload) h))
)
(ensures
(fun h _ h' ->
let len_tag = serialized_length s r in
let pos_payload = pos `U32.add` (U32.uint_to_t len_tag) in
B.modifies (loc_slice_from_to input pos pos_payload) h h' /\
valid_content_pos (parse_dsum t p f g)
h'
input
pos
(synth_dsum_case t (Unknown r) (contents g h input pos_payload))
(get_valid_pos g h input pos_payload))) | let finalize_dsum_case_unknown
(t: dsum)
(#kt: parser_kind)
(#p: parser kt (dsum_repr_type t))
(s: serializer p)
(w: leaf_writer_strong s)
(f: ((x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x))))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
(r: unknown_enum_repr (dsum_enum t))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: HST.Stack unit
(requires (fun h ->
let len_tag = serialized_length s r in
U32.v pos + len_tag < 4294967296 /\ (
let pos_payload = pos `U32.add` U32.uint_to_t len_tag in
valid g h input pos_payload /\
writable input.base (U32.v pos) (U32.v pos_payload) h
)))
(ensures (fun h _ h' ->
let len_tag = serialized_length s r in
let pos_payload = pos `U32.add` U32.uint_to_t len_tag in
B.modifies (loc_slice_from_to input pos pos_payload) h h' /\
valid_content_pos (parse_dsum t p f g) h' input pos (synth_dsum_case t (Unknown r) (contents g h input pos_payload)) (get_valid_pos g h input pos_payload)
))
= let pos1 = w r input pos in
let h = HST.get () in
[@inline_let]
let _ =
valid_facts (parse_maybe_enum_key p (dsum_enum t)) h input pos;
valid_facts p h input pos;
let sq = bytes_of_slice_from h input pos in
parse_maybe_enum_key_eq p (dsum_enum t) sq;
valid_dsum_intro_unknown h t p f g input pos
in
() | {
"file_name": "src/lowparse/LowParse.Low.Sum.fst",
"git_rev": "00217c4a89f5ba56002ba9aa5b4a9d5903bfe9fa",
"git_url": "https://github.com/project-everest/everparse.git",
"project_name": "everparse"
} | {
"end_col": 4,
"end_line": 1248,
"start_col": 0,
"start_line": 1211
} | module LowParse.Low.Sum
include LowParse.Low.Enum
include LowParse.Spec.Sum
module U32 = FStar.UInt32
module HST = FStar.HyperStack.ST
module B = LowStar.Buffer
module Cast = FStar.Int.Cast
module U64 = FStar.UInt64
inline_for_extraction
let validate_sum_cases_aux
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(vc: ((x: sum_key t) -> Tot (validator (dsnd (pc x)))))
(k: sum_key t)
: Tot (validator (parse_sum_cases t pc k))
= [@inline_let]
let _ = synth_sum_case_injective t k in
validate_synth
(validate_weaken
(weaken_parse_cases_kind t pc)
(vc k)
()
)
(synth_sum_case t k)
()
inline_for_extraction
let validate_sum_cases_t
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot Type
= validator (parse_sum_cases t pc k)
let validate_sum_cases_t_eq
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
(x y : validate_sum_cases_t t pc k)
: GTot Type0
= True
inline_for_extraction
let validate_sum_cases_t_if
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (if_combinator _ (validate_sum_cases_t_eq t pc k))
= fun cond (sv_true: cond_true cond -> Tot (validate_sum_cases_t t pc k)) (sv_false: cond_false cond -> Tot (validate_sum_cases_t t pc k)) #rrel #rel input pos ->
if cond
then sv_true () input pos
else sv_false () input pos
inline_for_extraction
let validate_sum_cases
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(vc: ((x: sum_key t) -> Tot (validator (dsnd (pc x)))))
(destr: dep_enum_destr (sum_enum t) (validate_sum_cases_t t pc))
(k: sum_key t)
: Tot (validator (parse_sum_cases t pc k))
= destr
_
(validate_sum_cases_t_if t pc)
(fun _ _ -> ())
(fun _ _ _ _ -> ())
(validate_sum_cases_aux t pc vc)
k
inline_for_extraction
let validate_sum_aux_payload_t
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
: Tot Type
= (#rrel: _) -> (#rel: _) ->
(input: slice rrel rel) ->
(pos: U64.t) ->
HST.Stack U64.t
(requires (fun h -> live_slice h input /\ U64.v pos <= U32.v input.len))
(ensures (fun h res h' ->
B.modifies B.loc_none h h' /\ (
match k with
| Unknown _ -> is_error res
| Known k' ->
if is_success res
then
valid_pos (dsnd (pc k')) h input (uint64_to_uint32 pos) (uint64_to_uint32 res)
else
(~ (valid (dsnd (pc k')) h input (uint64_to_uint32 pos)))
)))
let validate_sum_aux_payload_eq
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
: Tot (validate_sum_aux_payload_t t pc k -> validate_sum_aux_payload_t t pc k -> GTot Type0)
= fun _ _ -> True
inline_for_extraction
let validate_sum_aux_payload_if'
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
(cond: bool)
(ift: ((cond_true cond) -> Tot (validate_sum_aux_payload_t t pc k)))
(iff: ((cond_false cond) -> Tot (validate_sum_aux_payload_t t pc k)))
: Tot (validate_sum_aux_payload_t t pc k)
= fun #rrel #rel input pos ->
if cond
then begin
(ift () <: validate_sum_aux_payload_t t pc k) input pos
end else
(iff () <: validate_sum_aux_payload_t t pc k) input pos
inline_for_extraction
let validate_sum_aux_payload_if
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
: Tot (if_combinator _ (validate_sum_aux_payload_eq t pc k))
= validate_sum_aux_payload_if' t pc k
#push-options "--z3rlimit 64 --z3cliopt smt.arith.nl=false --using_facts_from '* -FStar.Int.Cast -LowParse.BitFields'"
// --query_stats --smtencoding.elim_box true --smtencoding.l_arith_repr native --z3refresh"
inline_for_extraction
let validate_sum_aux
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(v: validator p)
(p32: leaf_reader p)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(v_payload: ((k: sum_repr_type t)) -> Tot (validate_sum_aux_payload_t t pc (maybe_enum_key_of_repr (sum_enum t) k)))
: Tot (validator (parse_sum t p pc))
= fun #rrel #rel input pos ->
let h = HST.get () in
[@inline_let]
let _ = parse_sum_eq'' t p pc (bytes_of_slice_from h input (uint64_to_uint32 pos)) in
[@inline_let]
let _ = valid_facts (parse_sum t p pc) h input (uint64_to_uint32 pos) in
[@inline_let]
let _ = valid_facts p h input (uint64_to_uint32 pos) in
let len_after_tag = v input pos in
if is_error len_after_tag
then len_after_tag
else begin
let h1 = HST.get () in
let k' = p32 input (uint64_to_uint32 pos) in
[@inline_let]
let _ =
match maybe_enum_key_of_repr (sum_enum t) k' with
| Known k -> valid_facts (dsnd (pc k)) h input (uint64_to_uint32 len_after_tag)
| _ -> ()
in
v_payload k' input len_after_tag
end
#pop-options
inline_for_extraction
let validate_sum_aux_payload'
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (validator (dsnd (pc x)))))
(k: maybe_enum_key (sum_enum t))
: Tot (validate_sum_aux_payload_t t pc k)
= fun #rrel #rel input pos ->
match k with
| Known k ->
[@inline_let]
let _ = synth_sum_case_injective t k in
pc32 k input pos
// validate_synth (pc32 k) (synth_sum_case t k) () input pos
| _ -> validator_error_generic
inline_for_extraction
let validate_sum_aux_payload
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (validator (dsnd (pc x)))))
(destr: dep_maybe_enum_destr_t (sum_enum t) (validate_sum_aux_payload_t t pc))
(k: sum_repr_type t)
: Tot (validate_sum_aux_payload_t t pc (maybe_enum_key_of_repr (sum_enum t) k))
= destr (validate_sum_aux_payload_eq t pc) (validate_sum_aux_payload_if t pc) (fun _ _ -> ()) (fun _ _ _ _ -> ()) (validate_sum_aux_payload' t pc pc32) k
inline_for_extraction
let validate_sum
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(v: validator p)
(p32: leaf_reader p)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (validator (dsnd (pc x)))))
(destr: dep_maybe_enum_destr_t (sum_enum t) (validate_sum_aux_payload_t t pc))
: Tot (validator (parse_sum t p pc))
= validate_sum_aux t v p32 pc (validate_sum_aux_payload t pc pc32 destr)
module HS = FStar.HyperStack
#push-options "--z3rlimit 256 --z3cliopt smt.arith.nl=false --initial_ifuel 8 --max_ifuel 8 --initial_fuel 2 --max_fuel 2"
#restart-solver
let valid_sum_intro
(h: HS.mem)
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: Lemma
(requires (
valid (parse_enum_key p (sum_enum t)) h input pos /\ (
let k = contents (parse_enum_key p (sum_enum t)) h input pos in
valid (dsnd (pc k)) h input (get_valid_pos (parse_enum_key p (sum_enum t)) h input pos)
)))
(ensures (
let k = contents (parse_enum_key p (sum_enum t)) h input pos in
let pos_payload = get_valid_pos (parse_enum_key p (sum_enum t)) h input pos in
valid_content_pos
(parse_sum t p pc) h input pos
(synth_sum_case t k (contents (dsnd (pc k)) h input pos_payload))
(get_valid_pos (dsnd (pc k)) h input pos_payload)
))
= valid_facts (parse_enum_key p (sum_enum t)) h input pos;
let k = contents (parse_enum_key p (sum_enum t)) h input pos in
let pos_payload = get_valid_pos (parse_enum_key p (sum_enum t)) h input pos in
valid_facts (dsnd (pc k)) h input pos_payload;
valid_facts (parse_sum t p pc) h input pos;
parse_sum_eq t p pc (bytes_of_slice_from h input pos)
#pop-options
inline_for_extraction
let finalize_sum_case
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(s: serializer p)
(w: leaf_writer_strong s)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(destr: enum_repr_of_key'_t (sum_enum t))
(k: sum_key t)
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: HST.Stack unit
(requires (fun h ->
let len_tag = serialized_length (serialize_enum_key _ s (sum_enum t)) k in
U32.v pos + len_tag < 4294967296 /\ (
let pos_payload = pos `U32.add` U32.uint_to_t len_tag in
valid (dsnd (pc k)) h input pos_payload /\
writable input.base (U32.v pos) (U32.v pos_payload) h
)))
(ensures (fun h _ h' ->
let len_tag = serialized_length (serialize_enum_key _ s (sum_enum t)) k in
let pos_payload = pos `U32.add` U32.uint_to_t len_tag in
B.modifies (loc_slice_from_to input pos pos_payload) h h' /\
valid_content_pos (parse_sum t p pc) h' input pos (synth_sum_case t k (contents (dsnd (pc k)) h input pos_payload)) (get_valid_pos (dsnd (pc k)) h input pos_payload)
))
= let pos1 = write_enum_key w (sum_enum t) destr k input pos in
let h = HST.get () in
[@inline_let]
let _ = valid_sum_intro h t p pc input pos in
()
inline_for_extraction
let jump_sum_cases_aux
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(vc: ((x: sum_key t) -> Tot (jumper (dsnd (pc x)))))
(k: sum_key t)
: Tot (jumper (parse_sum_cases t pc k))
= [@inline_let]
let _ = synth_sum_case_injective t k in
jump_synth
(jump_weaken
(weaken_parse_cases_kind t pc)
(vc k)
()
)
(synth_sum_case t k)
()
inline_for_extraction
let jump_sum_cases_t
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot Type
= jumper (parse_sum_cases t pc k)
let jump_sum_cases_t_eq
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
(x y : jump_sum_cases_t t pc k)
: GTot Type0
= True
inline_for_extraction
let jump_sum_cases_t_if
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (if_combinator _ (jump_sum_cases_t_eq t pc k))
= fun cond (sv_true: cond_true cond -> Tot (jump_sum_cases_t t pc k)) (sv_false: cond_false cond -> Tot (jump_sum_cases_t t pc k)) #rrel #rel input pos ->
if cond
then sv_true () input pos
else sv_false () input pos
inline_for_extraction
let jump_sum_cases
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(vc: ((x: sum_key t) -> Tot (jumper (dsnd (pc x)))))
(destr: dep_enum_destr (sum_enum t) (jump_sum_cases_t t pc))
(k: sum_key t)
: Tot (jumper (parse_sum_cases t pc k))
= destr
_
(jump_sum_cases_t_if t pc)
(fun _ _ -> ())
(fun _ _ _ _ -> ())
(jump_sum_cases_aux t pc vc)
k
inline_for_extraction
let jump_sum_aux_payload_t
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
: Tot Type
= (#rrel: _) -> (#rel: _) ->
(input: slice rrel rel) ->
(pos: U32.t) ->
HST.Stack U32.t
(requires (fun h -> live_slice h input /\ U32.v pos <= U32.v input.len /\ (
match k with
| Unknown _ -> False
| Known k' -> valid (dsnd (pc k')) h input pos
)))
(ensures (fun h res h' ->
B.modifies B.loc_none h h' /\ (
match k with
| Unknown _ -> False
| Known k' ->
valid_pos (dsnd (pc k')) h input pos res
)))
let jump_sum_aux_payload_eq
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
: Tot (jump_sum_aux_payload_t t pc k -> jump_sum_aux_payload_t t pc k -> GTot Type0)
= fun _ _ -> True
inline_for_extraction
let jump_sum_aux_payload_if'
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
(cond: bool)
(ift: ((cond_true cond) -> Tot (jump_sum_aux_payload_t t pc k)))
(iff: ((cond_false cond) -> Tot (jump_sum_aux_payload_t t pc k)))
: Tot (jump_sum_aux_payload_t t pc k)
= fun #rrel #rel input pos ->
if cond
then begin
(ift () <: jump_sum_aux_payload_t t pc k) input pos
end else
(iff () <: jump_sum_aux_payload_t t pc k) input pos
inline_for_extraction
let jump_sum_aux_payload_if
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
: Tot (if_combinator _ (jump_sum_aux_payload_eq t pc k))
= jump_sum_aux_payload_if' t pc k
let parse_sum_eq3
(#kt: parser_kind)
(t: sum)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(input: bytes)
(k' : sum_repr_type t)
(consumed_k: consumed_length input)
: Lemma
(requires (Some? (parse (parse_sum t p pc) input) /\ parse p input == Some (k', consumed_k)))
(ensures (
let input_k = Seq.slice input consumed_k (Seq.length input) in
let k = maybe_enum_key_of_repr (sum_enum t) k' in
begin match k with
| Known k ->
Some? (parse (dsnd (pc k)) input_k)
| _ -> False
end
))
= parse_sum_eq'' t p pc input
let parse_sum_eq4
(#kt: parser_kind)
(t: sum)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(input: bytes)
(k' : sum_repr_type t)
(consumed_k: consumed_length input)
(consumed_payload: nat)
: Lemma
(requires (Some? (parse (parse_sum t p pc) input) /\ parse p input == Some (k', consumed_k) /\ (
let input_k = Seq.slice input consumed_k (Seq.length input) in
let k = maybe_enum_key_of_repr (sum_enum t) k' in
begin match k with
| Known k ->
Some? (parse (dsnd (pc k)) input_k) /\ (
let Some (_, consumed_payload') = parse (dsnd (pc k)) input_k in
consumed_payload' == consumed_payload
)
| _ -> False
end
)))
(ensures (
let Some (_, consumed) = parse (parse_sum t p pc) input in
consumed == consumed_k + consumed_payload
))
= parse_sum_eq'' t p pc input
#push-options "--z3rlimit 16"
let valid_sum_elim
(h: HS.mem)
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(#rrel: _) (#rel: _)
(input: slice rrel rel)
(pos: U32.t)
: Lemma
(requires (
valid (parse_sum t p pc) h input pos
))
(ensures (
valid p h input pos /\ (
let pos_payload = get_valid_pos p h input pos in
let k' = maybe_enum_key_of_repr (sum_enum t) (contents p h input pos) in
match k' with
| Known k ->
k == sum_tag_of_data t (contents (parse_sum t p pc) h input pos) /\
valid (dsnd (pc k)) h input pos_payload /\
valid_pos
(parse_sum t p pc) h input pos
(get_valid_pos (dsnd (pc k)) h input pos_payload)
| _ -> False
)))
= let sinput = bytes_of_slice_from h input pos in
let _ = parse_sum_eq'' t p pc sinput in
[@inline_let]
let _ = valid_facts (parse_sum t p pc) h input pos in
let Some (k', consumed_k) = parse p sinput in
let pos_after_tag = U32.uint_to_t (U32.v pos + consumed_k) in
[@inline_let]
let _ = valid_facts p h input pos in
assert (valid_content_pos p h input pos k' pos_after_tag);
match maybe_enum_key_of_repr (sum_enum t) k' with
| Known k -> valid_facts (dsnd (pc k)) h input pos_after_tag
| _ -> ()
#pop-options
let valid_sum_elim_tag
(h: HS.mem)
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: Lemma
(requires (
valid (parse_sum t p pc) h input pos
))
(ensures (
valid (parse_enum_key p (sum_enum t)) h input pos /\
contents (parse_enum_key p (sum_enum t)) h input pos == sum_tag_of_data t (contents (parse_sum t p pc) h input pos)
))
= let _ = parse_sum_eq' t p pc (bytes_of_slice_from h input pos) in
let _ = valid_facts (parse_sum t p pc) h input pos in
let _ = valid_facts (parse_enum_key p (sum_enum t)) h input pos in
()
inline_for_extraction
let read_sum_tag
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(p32: leaf_reader p)
(destr: dep_maybe_enum_destr_t (sum_enum t) (read_enum_key_t (sum_enum t)))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: HST.Stack (sum_key t)
(requires (fun h ->
valid (parse_sum t p pc) h input pos
))
(ensures (fun h res h' ->
B.modifies B.loc_none h h' /\
res == sum_tag_of_data t (contents (parse_sum t p pc) h input pos)
))
= let h = HST.get () in
[@inline_let] let _ = valid_sum_elim_tag h t p pc input pos in
read_enum_key p32 (sum_enum t) destr input pos
inline_for_extraction
let jump_sum_aux
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(v: jumper p)
(p32: leaf_reader p)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(v_payload: ((k: sum_repr_type t)) -> Tot (jump_sum_aux_payload_t t pc (maybe_enum_key_of_repr (sum_enum t) k)))
: Tot (jumper (parse_sum t p pc))
= fun #rrel #rel input pos ->
let h = HST.get () in
[@inline_let]
let _ = valid_sum_elim h t p pc input pos in
let pos_after_tag = v input pos in
let k' = p32 input pos in
v_payload k' input pos_after_tag
inline_for_extraction
let jump_sum_aux_payload'
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (jumper (dsnd (pc x)))))
(k: maybe_enum_key (sum_enum t))
: Tot (jump_sum_aux_payload_t t pc k)
= fun #rrel #rel input pos ->
match k with
| Known k ->
[@inline_let]
let _ = synth_sum_case_injective t k in
pc32 k input pos
| _ -> 0ul // dummy, but we MUST NOT remove this branch, otherwise extraction fails
inline_for_extraction
let jump_sum_aux_payload
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (jumper (dsnd (pc x)))))
(destr: dep_maybe_enum_destr_t (sum_enum t) (jump_sum_aux_payload_t t pc))
(k: sum_repr_type t)
: Tot (jump_sum_aux_payload_t t pc (maybe_enum_key_of_repr (sum_enum t) k))
= destr (jump_sum_aux_payload_eq t pc) (jump_sum_aux_payload_if t pc) (fun _ _ -> ()) (fun _ _ _ _ -> ()) (jump_sum_aux_payload' t pc pc32) k
inline_for_extraction
let jump_sum
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(v: jumper p)
(p32: leaf_reader p)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (jumper (dsnd (pc x)))))
(destr: dep_maybe_enum_destr_t (sum_enum t) (jump_sum_aux_payload_t t pc))
: Tot (jumper (parse_sum t p pc))
= jump_sum_aux t v p32 pc (jump_sum_aux_payload t pc pc32 destr)
inline_for_extraction
let read_sum_cases'
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (leaf_reader (dsnd (pc x)))))
(k: sum_key t)
: Tot (leaf_reader (parse_sum_cases' t pc k))
= [@inline_let]
let _ = synth_sum_case_injective t k in
read_synth'
(dsnd (pc k))
(synth_sum_case t k)
(pc32 k)
()
inline_for_extraction
let read_sum_cases_t
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot Type
= leaf_reader (parse_sum_cases' t pc k)
let read_sum_cases_t_eq
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
(x y : read_sum_cases_t t pc k)
: GTot Type0
= True
inline_for_extraction
let read_sum_cases_t_if
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (if_combinator _ (read_sum_cases_t_eq t pc k))
= fun cond (sv_true: cond_true cond -> Tot (read_sum_cases_t t pc k)) (sv_false: cond_false cond -> Tot (read_sum_cases_t t pc k)) #_ #_ input pos ->
if cond
then (sv_true () input pos)
else (sv_false () input pos)
inline_for_extraction
let read_sum_cases
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (leaf_reader (dsnd (pc x)))))
(destr: dep_enum_destr (sum_enum t) (read_sum_cases_t t pc))
(k: sum_key t)
: Tot (leaf_reader (parse_sum_cases' t pc k))
= destr
_
(read_sum_cases_t_if t pc)
(fun _ _ -> ())
(fun _ _ _ _ -> ())
(read_sum_cases' t pc pc32)
k
#push-options "--z3rlimit 32"
inline_for_extraction
let read_sum
(#kt: parser_kind)
(t: sum)
(p: parser kt (sum_repr_type t))
(p32: leaf_reader (parse_enum_key p (sum_enum t)))
(j: jumper p)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (leaf_reader (dsnd (pc x)))))
(destr: dep_enum_destr (sum_enum t) (read_sum_cases_t t pc))
: Tot (leaf_reader (parse_sum t p pc))
=
fun #_ #_ input pos ->
let h = HST.get () in
valid_facts (parse_sum t p pc) h input pos;
parse_sum_eq' t p pc (bytes_of_slice_from h input pos);
valid_facts (parse_enum_key p (sum_enum t)) h input pos;
let k = p32 input pos in
let pos' = jump_enum_key j (sum_enum t) input pos in
valid_facts (parse_sum_cases' t pc k) h input pos' ;
read_sum_cases t pc pc32 destr k input pos'
#pop-options
inline_for_extraction
let serialize32_sum_cases_t
(t: sum)
(#pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(sc: ((x: sum_key t) -> Tot (serializer (dsnd (pc x)))))
(k: sum_key t)
: Tot Type
= serializer32 (serialize_sum_cases t pc sc k)
let serialize32_sum_cases_t_eq
(t: sum)
(#pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(sc: ((x: sum_key t) -> Tot (serializer (dsnd (pc x)))))
(k: sum_key t)
(x y: serialize32_sum_cases_t t sc k)
: GTot Type0
= True
inline_for_extraction
let serialize32_sum_cases_t_if
(t: sum)
(#pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(sc: ((x: sum_key t) -> Tot (serializer (dsnd (pc x)))))
(k: sum_key t)
: Tot (if_combinator _ (serialize32_sum_cases_t_eq t sc k))
= fun cond (sv_true: (cond_true cond -> Tot (serialize32_sum_cases_t t sc k))) (sv_false: (cond_false cond -> Tot (serialize32_sum_cases_t t sc k))) x #rrel #rel b pos ->
if cond
then (sv_true () x b pos)
else (sv_false () x b pos)
inline_for_extraction
let serialize32_sum_cases_aux
(t: sum)
(#pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(sc: ((x: sum_key t) -> Tot (serializer (dsnd (pc x)))))
(sc32: ((x: sum_key t) -> Tot (serializer32 (sc x))))
(k: sum_key t)
: Tot (serializer32 (serialize_sum_cases t pc sc k))
= fun x #rrel #rel b pos ->
[@inline_let] let _ =
Classical.forall_intro (parse_sum_cases_eq' t pc k);
synth_sum_case_injective t k;
synth_sum_case_inverse t k
in
serialize32_synth
(sc32 k)
(synth_sum_case t k)
(synth_sum_case_recip t k)
(fun x -> synth_sum_case_recip t k x)
()
x
b
pos
inline_for_extraction
let serialize32_sum_cases
(t: sum)
(#pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(sc: ((x: sum_key t) -> Tot (serializer (dsnd (pc x)))))
(sc32: ((x: sum_key t) -> Tot (serializer32 (sc x))))
(destr: dep_enum_destr (sum_enum t) (serialize32_sum_cases_t t sc))
(k: sum_key t)
: Tot (serializer32 (serialize_sum_cases t pc sc k))
= destr
_
(serialize32_sum_cases_t_if t sc)
(fun _ _ -> ())
(fun _ _ _ _ -> ())
(serialize32_sum_cases_aux t sc sc32)
k
inline_for_extraction
let serialize32_sum
(#kt: parser_kind)
(t: sum)
(#p: parser kt (sum_repr_type t))
(s: serializer p {kt.parser_kind_subkind == Some ParserStrong})
(s32: serializer32 (serialize_enum_key _ s (sum_enum t)))
(#pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(sc: ((x: sum_key t) -> Tot (serializer (dsnd (pc x)))))
(sc32: ((x: sum_key t) -> Tot (serializer32 (sc x))))
(destr: dep_enum_destr (sum_enum t) (serialize32_sum_cases_t t sc))
: Tot (serializer32 (serialize_sum t s sc))
= fun x #rrel #rel b pos ->
serialize_sum_eq t s sc x;
let tg = sum_tag_of_data t x in
serialize32_nondep_then_aux s32 (serialize32_sum_cases t sc sc32 destr tg) tg x b pos
let clens_sum_tag
(s: sum)
: Tot (clens (sum_type s) (sum_key s))
= {
clens_cond = (fun _ -> True);
clens_get = sum_tag_of_data s;
}
let gaccessor_sum_tag
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
: Tot (gaccessor (parse_sum t p pc) (parse_enum_key p (sum_enum t)) (clens_sum_tag t))
= gaccessor_tagged_union_tag
(parse_enum_key p (sum_enum t))
(sum_tag_of_data t)
(parse_sum_cases t pc)
inline_for_extraction
let accessor_sum_tag
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
: Tot (accessor (gaccessor_sum_tag t p pc))
= accessor_tagged_union_tag
(parse_enum_key p (sum_enum t))
(sum_tag_of_data t)
(parse_sum_cases t pc)
let clens_sum_payload
(s: sum)
(k: sum_key s)
: Tot (clens (sum_type s) (sum_type_of_tag s k))
= {
clens_cond = (fun (x: sum_type s) -> sum_tag_of_data s x == k);
clens_get = (fun (x: sum_type s) -> synth_sum_case_recip s k x <: Ghost (sum_type_of_tag s k) (requires (sum_tag_of_data s x == k)) (ensures (fun _ -> True)));
}
#push-options "--z3rlimit 32"
let gaccessor_clens_sum_payload'
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (gaccessor' (parse_sum t p pc) (dsnd (pc k)) (clens_sum_payload t k))
= fun (input: bytes) ->
parse_sum_eq'' t p pc input;
let res =
match parse p input with
| Some (_, consumed) ->
synth_sum_case_inverse t k;
synth_sum_case_injective t k;
synth_injective_synth_inverse_synth_inverse_recip (synth_sum_case t k) (synth_sum_case_recip t k) ();
(consumed)
| _ -> 0 // dummy
in
(res <: (res: _ { gaccessor_post' (parse_sum t p pc) (dsnd (pc k)) (clens_sum_payload t k) input res } ))
#push-options "--z3rlimit 64"
let gaccessor_clens_sum_payload_injective
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
(sl sl' : bytes)
: Lemma
(requires (
gaccessor_pre (parse_sum t p pc) (dsnd (pc k)) (clens_sum_payload t k) sl /\
gaccessor_pre (parse_sum t p pc) (dsnd (pc k)) (clens_sum_payload t k) sl' /\
injective_precond (parse_sum t p pc) sl sl'
))
(ensures (gaccessor_clens_sum_payload' t p pc k sl == gaccessor_clens_sum_payload' t p pc k sl'))
= parse_sum_eq'' t p pc sl;
parse_sum_eq'' t p pc sl' ;
parse_injective (parse_sum t p pc) sl sl' ;
parse_injective p sl sl'
#pop-options
let gaccessor_clens_sum_payload_no_lookahead
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
(sl sl' : bytes)
: Lemma
(requires (
(parse_sum_kind kt t pc).parser_kind_subkind == Some ParserStrong /\
gaccessor_pre (parse_sum t p pc) (dsnd (pc k)) (clens_sum_payload t k) sl /\
gaccessor_pre (parse_sum t p pc) (dsnd (pc k)) (clens_sum_payload t k) sl' /\
no_lookahead_on_precond (parse_sum t p pc) sl sl'
))
(ensures (gaccessor_clens_sum_payload' t p pc k sl == gaccessor_clens_sum_payload' t p pc k sl'))
= parse_sum_eq'' t p pc sl;
parse_sum_eq'' t p pc sl' ;
parse_strong_prefix (parse_sum t p pc) sl sl' ;
parse_injective p sl sl'
let gaccessor_clens_sum_payload
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (gaccessor (parse_sum t p pc) (dsnd (pc k)) (clens_sum_payload t k))
= Classical.forall_intro_2 (fun x -> Classical.move_requires (gaccessor_clens_sum_payload_injective t p pc k x));
Classical.forall_intro_2 (fun x -> Classical.move_requires (gaccessor_clens_sum_payload_no_lookahead t p pc k x));
gaccessor_prop_equiv (parse_sum t p pc) (dsnd (pc k)) (clens_sum_payload t k) (gaccessor_clens_sum_payload' t p pc k);
gaccessor_clens_sum_payload' t p pc k
inline_for_extraction
let accessor_clens_sum_payload'
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(j: jumper p)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: HST.Stack U32.t
(requires (fun h ->
valid (parse_sum t p pc) h input pos /\
(clens_sum_payload t k).clens_cond (contents (parse_sum t p pc) h input pos)
))
(ensures (fun h pos' h' ->
B.modifies B.loc_none h h' /\
pos' == slice_access h (gaccessor_clens_sum_payload t p pc k) input pos
))
=
let h = HST.get () in
[@inline_let]
let _ =
let pos' = get_valid_pos (parse_sum t p pc) h input pos in
let large = bytes_of_slice_from h input pos in
slice_access_eq h (gaccessor_clens_sum_payload t p pc k) input pos;
valid_facts (parse_sum t p pc) h input pos;
parse_sum_eq'' t p pc large;
valid_facts p h input pos
in
j input pos
#pop-options
inline_for_extraction
let accessor_clens_sum_payload
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(j: jumper p)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (accessor (gaccessor_clens_sum_payload t p pc k))
= fun #rrel #rel -> accessor_clens_sum_payload' t j pc k #rrel #rel
let clens_sum_cases_payload
(s: sum)
(k: sum_key s)
: Tot (clens (sum_cases s k) (sum_type_of_tag s k))
= {
clens_cond = (fun (x: sum_cases s k) -> True);
clens_get = (fun (x: sum_cases s k) -> synth_sum_case_recip s k x <: Ghost (sum_type_of_tag s k) (requires (True)) (ensures (fun _ -> True)));
}
let gaccessor_clens_sum_cases_payload
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (gaccessor (parse_sum_cases' t pc k) (dsnd (pc k)) (clens_sum_cases_payload t k))
= synth_sum_case_injective t k;
synth_sum_case_inverse t k;
synth_injective_synth_inverse_synth_inverse_recip (synth_sum_case t k) (synth_sum_case_recip t k) ();
gaccessor_ext
(gaccessor_synth (dsnd (pc k)) (synth_sum_case t k) (synth_sum_case_recip t k) ())
(clens_sum_cases_payload t k)
()
inline_for_extraction
let accessor_clens_sum_cases_payload
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (accessor (gaccessor_clens_sum_cases_payload t pc k))
= [@inline_let]
let _ =
synth_sum_case_injective t k;
synth_sum_case_inverse t k;
synth_injective_synth_inverse_synth_inverse_recip (synth_sum_case t k) (synth_sum_case_recip t k) ()
in
accessor_ext
(accessor_synth (dsnd (pc k)) (synth_sum_case t k) (synth_sum_case_recip t k) ())
(clens_sum_cases_payload t k)
()
inline_for_extraction
let validate_dsum_cases_t
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(#k: parser_kind)
(g: parser k (dsum_type_of_unknown_tag s))
(x: dsum_key s)
: Tot Type
= validator (parse_dsum_cases' s f g x)
let validate_dsum_cases_eq
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(#k: parser_kind)
(g: parser k (dsum_type_of_unknown_tag s))
(x: dsum_key s)
(v1 v2 : validate_dsum_cases_t s f g x)
: GTot Type0
= True
inline_for_extraction
let validate_dsum_cases_if'
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(#k: parser_kind)
(g: parser k (dsum_type_of_unknown_tag s))
(x: dsum_key s)
(cond: bool)
(ift: (cond_true cond -> Tot (validate_dsum_cases_t s f g x)))
(iff: (cond_false cond -> Tot (validate_dsum_cases_t s f g x)))
: Tot (validate_dsum_cases_t s f g x)
= fun #rrel #rel input len ->
if cond
then (ift () <: validate_dsum_cases_t s f g x) input len
else (iff () <: validate_dsum_cases_t s f g x) input len
inline_for_extraction
let validate_dsum_cases_if
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(#k: parser_kind)
(g: parser k (dsum_type_of_unknown_tag s))
(x: dsum_key s)
: Tot (if_combinator _ (validate_dsum_cases_eq s f g x))
= validate_dsum_cases_if' s f g x
inline_for_extraction
let validate_dsum_cases'
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(f' : (x: dsum_known_key s) -> Tot (validator (dsnd (f x))))
(#k: parser_kind)
(#g: parser k (dsum_type_of_unknown_tag s))
(g' : validator g)
(x: dsum_key s)
: Tot (validate_dsum_cases_t s f g x)
= [@inline_let]
let _ = synth_dsum_case_injective s x in
match x with
| Known x' -> validate_synth (f' x') (synth_dsum_case s (Known x')) () <: validator (parse_dsum_cases' s f g x)
| Unknown x' -> validate_synth g' (synth_dsum_case s (Unknown x')) () <: validator (parse_dsum_cases' s f g x)
inline_for_extraction
let validate_dsum_cases'_destr
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(f' : (x: dsum_known_key s) -> Tot (validator (dsnd (f x))))
(#k: parser_kind)
(#g: parser k (dsum_type_of_unknown_tag s))
(g' : validator g)
(destr: dep_enum_destr _ (fun k -> validate_dsum_cases_t s f g (Known k)))
(x: dsum_key s)
: Tot (validate_dsum_cases_t s f g x)
= fun #rrel #rel input pos ->
match x with
| Known k ->
destr
_
(fun k -> validate_dsum_cases_if s f g (Known k))
(fun _ _ -> ())
(fun _ _ _ _ -> ())
(fun k -> validate_dsum_cases' s f f' g' (Known k))
k
input
pos
| Unknown r -> validate_dsum_cases' s f f' g' (Unknown r) input pos
inline_for_extraction
let validate_dsum_cases
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(f' : (x: dsum_known_key s) -> Tot (validator (dsnd (f x))))
(#k: parser_kind)
(#g: parser k (dsum_type_of_unknown_tag s))
(g' : validator g)
(destr: dep_enum_destr _ (fun k -> validate_dsum_cases_t s f g (Known k)))
(x: dsum_key s)
: Tot (validator (parse_dsum_cases s f g x))
= fun #rrel #rel input pos ->
let h = HST.get () in
[@inline_let]
let _ =
valid_facts (parse_dsum_cases' s f g x) h input (uint64_to_uint32 pos);
valid_facts (parse_dsum_cases s f g x) h input (uint64_to_uint32 pos);
parse_dsum_cases_eq' s f g x (bytes_of_slice_from h input (uint64_to_uint32 pos))
in
validate_dsum_cases'_destr s f f' g' destr x input pos
#push-options "--z3rlimit 40"
inline_for_extraction
let validate_dsum
(#kt: parser_kind)
(t: dsum)
(#p: parser kt (dsum_repr_type t))
(v: validator p)
(p32: leaf_reader p)
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(f32: (x: dsum_known_key t) -> Tot (validator (dsnd (f x))))
(#k': parser_kind)
(#g: parser k' (dsum_type_of_unknown_tag t))
(g32: validator g)
(destr: dep_maybe_enum_destr_t (dsum_enum t) (validate_dsum_cases_t t f g))
: Tot (validator (parse_dsum t p f g))
= fun #rrel #rel input pos ->
let h = HST.get () in
[@inline_let]
let _ = parse_dsum_eq' t p f g (bytes_of_slice_from h input (uint64_to_uint32 pos)) in
[@inline_let]
let _ = valid_facts (parse_dsum t p f g) h input (uint64_to_uint32 pos) in
[@inline_let]
let _ = valid_facts p h input (uint64_to_uint32 pos) in
let pos_after_tag = v input pos in
if is_error pos_after_tag
then pos_after_tag
else
let tg = p32 input (uint64_to_uint32 pos) in
[@inline_let]
let _ = valid_facts (parse_dsum_cases' t f g (maybe_enum_key_of_repr (dsum_enum t) tg)) h input (uint64_to_uint32 pos_after_tag) in
destr (validate_dsum_cases_eq t f g) (validate_dsum_cases_if t f g) (fun _ _ -> ()) (fun _ _ _ _ -> ()) (validate_dsum_cases' t f f32 g32) tg input pos_after_tag
#pop-options
#reset-options "--z3rlimit 64 --z3cliopt smt.arith.nl=false --initial_ifuel 8 --max_ifuel 8 --initial_fuel 2 --max_fuel 2"
let valid_dsum_intro_known
(h: HS.mem)
(t: dsum)
(#kt: parser_kind)
(p: parser kt (dsum_repr_type t))
(f: ((x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x))))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: Lemma
(requires (
valid (parse_maybe_enum_key p (dsum_enum t)) h input pos /\ (
let k' = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
Known? k' /\ (
let Known k = k' in
valid (dsnd (f k)) h input (get_valid_pos (parse_maybe_enum_key p (dsum_enum t)) h input pos)
))))
(ensures (
let Known k = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
let pos_payload = get_valid_pos (parse_maybe_enum_key p (dsum_enum t)) h input pos in
valid_content_pos
(parse_dsum t p f g) h input pos
(synth_dsum_case t (Known k) (contents (dsnd (f k)) h input pos_payload))
(get_valid_pos (dsnd (f k)) h input pos_payload)
))
= valid_facts (parse_maybe_enum_key p (dsum_enum t)) h input pos;
let Known k = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
let pos_payload = get_valid_pos (parse_maybe_enum_key p (dsum_enum t)) h input pos in
valid_facts (dsnd (f k)) h input pos_payload;
valid_facts (parse_dsum t p f g) h input pos;
parse_dsum_eq t p f g (bytes_of_slice_from h input pos)
let valid_dsum_intro_unknown
(h: HS.mem)
(t: dsum)
(#kt: parser_kind)
(p: parser kt (dsum_repr_type t))
(f: ((x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x))))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: Lemma
(requires (
valid (parse_maybe_enum_key p (dsum_enum t)) h input pos /\ (
let k' = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
Unknown? k' /\
valid g h input (get_valid_pos (parse_maybe_enum_key p (dsum_enum t)) h input pos)
)))
(ensures (
let Unknown r = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
let pos_payload = get_valid_pos (parse_maybe_enum_key p (dsum_enum t)) h input pos in
valid_content_pos
(parse_dsum t p f g) h input pos
(synth_dsum_case t (Unknown r) (contents g h input pos_payload))
(get_valid_pos g h input pos_payload)
))
= valid_facts (parse_maybe_enum_key p (dsum_enum t)) h input pos;
let Unknown r = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
let pos_payload = get_valid_pos (parse_maybe_enum_key p (dsum_enum t)) h input pos in
valid_facts g h input pos_payload;
valid_facts (parse_dsum t p f g) h input pos;
parse_dsum_eq t p f g (bytes_of_slice_from h input pos)
#reset-options
inline_for_extraction
let finalize_dsum_case_known
(t: dsum)
(#kt: parser_kind)
(#p: parser kt (dsum_repr_type t))
(s: serializer p)
(w: leaf_writer_strong s)
(f: ((x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x))))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
(destr: enum_repr_of_key'_t (dsum_enum t))
(k: dsum_known_key t)
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: HST.Stack unit
(requires (fun h ->
let len_tag = serialized_length (serialize_enum_key _ s (dsum_enum t)) k in
U32.v pos + len_tag < 4294967296 /\ (
let pos_payload = pos `U32.add` U32.uint_to_t len_tag in
valid (dsnd (f k)) h input pos_payload /\
writable input.base (U32.v pos) (U32.v pos_payload) h
)))
(ensures (fun h _ h' ->
let len_tag = serialized_length (serialize_enum_key _ s (dsum_enum t)) k in
let pos_payload = pos `U32.add` U32.uint_to_t len_tag in
B.modifies (loc_slice_from_to input pos pos_payload) h h' /\
valid_content_pos (parse_dsum t p f g) h' input pos (synth_dsum_case t (Known k) (contents (dsnd (f k)) h input pos_payload)) (get_valid_pos (dsnd (f k)) h input pos_payload)
))
= let pos1 = write_enum_key w (dsum_enum t) destr k input pos in
let h = HST.get () in
[@inline_let]
let _ =
valid_facts (parse_enum_key p (dsum_enum t)) h input pos;
valid_facts (parse_maybe_enum_key p (dsum_enum t)) h input pos;
let sq = bytes_of_slice_from h input pos in
parse_enum_key_eq p (dsum_enum t) sq;
parse_maybe_enum_key_eq p (dsum_enum t) sq;
valid_dsum_intro_known h t p f g input pos
in
() | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"LowStar.Buffer.fst.checked",
"LowParse.Spec.Sum.fst.checked",
"LowParse.Low.Enum.fst.checked",
"FStar.UInt64.fsti.checked",
"FStar.UInt32.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Int.Cast.fst.checked",
"FStar.HyperStack.ST.fsti.checked",
"FStar.HyperStack.fst.checked",
"FStar.Classical.fsti.checked"
],
"interface_file": false,
"source_file": "LowParse.Low.Sum.fst"
} | [
{
"abbrev": true,
"full_module": "FStar.HyperStack",
"short_module": "HS"
},
{
"abbrev": true,
"full_module": "FStar.UInt64",
"short_module": "U64"
},
{
"abbrev": true,
"full_module": "FStar.Int.Cast",
"short_module": "Cast"
},
{
"abbrev": true,
"full_module": "LowStar.Buffer",
"short_module": "B"
},
{
"abbrev": true,
"full_module": "FStar.HyperStack.ST",
"short_module": "HST"
},
{
"abbrev": true,
"full_module": "FStar.UInt32",
"short_module": "U32"
},
{
"abbrev": false,
"full_module": "LowParse.Spec.Sum",
"short_module": null
},
{
"abbrev": false,
"full_module": "LowParse.Low.Enum",
"short_module": null
},
{
"abbrev": false,
"full_module": "LowParse.Low",
"short_module": null
},
{
"abbrev": false,
"full_module": "LowParse.Low",
"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",
"short_module": null
}
] | {
"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_elim_box": false,
"smtencoding_l_arith_repr": "boxwrap",
"smtencoding_nl_arith_repr": "boxwrap",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": true,
"z3cliopt": [],
"z3refresh": false,
"z3rlimit": 5,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | false |
t: LowParse.Spec.Sum.dsum ->
s: LowParse.Spec.Base.serializer p ->
w: LowParse.Low.Base.leaf_writer_strong s ->
f:
(x: LowParse.Spec.Sum.dsum_known_key t
-> Prims.dtuple2 LowParse.Spec.Base.parser_kind
(fun k -> LowParse.Spec.Base.parser k (LowParse.Spec.Sum.dsum_type_of_known_tag t x))) ->
g: LowParse.Spec.Base.parser ku (LowParse.Spec.Sum.dsum_type_of_unknown_tag t) ->
r: LowParse.Spec.Enum.unknown_enum_repr (LowParse.Spec.Sum.dsum_enum t) ->
input: LowParse.Slice.slice rrel rel ->
pos: FStar.UInt32.t
-> FStar.HyperStack.ST.Stack Prims.unit | FStar.HyperStack.ST.Stack | [] | [] | [
"LowParse.Spec.Sum.dsum",
"LowParse.Spec.Base.parser_kind",
"LowParse.Spec.Base.parser",
"LowParse.Spec.Sum.dsum_repr_type",
"LowParse.Spec.Base.serializer",
"LowParse.Low.Base.leaf_writer_strong",
"LowParse.Spec.Sum.dsum_known_key",
"Prims.dtuple2",
"LowParse.Spec.Sum.dsum_type_of_known_tag",
"LowParse.Spec.Sum.dsum_type_of_unknown_tag",
"LowParse.Spec.Enum.unknown_enum_repr",
"LowParse.Spec.Sum.dsum_key_type",
"LowParse.Spec.Sum.dsum_enum",
"LowParse.Slice.srel",
"LowParse.Bytes.byte",
"LowParse.Slice.slice",
"FStar.UInt32.t",
"Prims.unit",
"LowParse.Low.Sum.valid_dsum_intro_unknown",
"LowParse.Spec.Enum.parse_maybe_enum_key_eq",
"LowParse.Bytes.bytes",
"LowParse.Slice.bytes_of_slice_from",
"LowParse.Low.Base.Spec.valid_facts",
"LowParse.Spec.Enum.maybe_enum_key",
"LowParse.Spec.Enum.parse_maybe_enum_key",
"FStar.Monotonic.HyperStack.mem",
"FStar.HyperStack.ST.get",
"Prims.l_and",
"Prims.b2t",
"Prims.op_LessThan",
"Prims.op_Addition",
"FStar.UInt32.v",
"LowParse.Low.Base.Spec.valid",
"LowParse.Low.Base.writable",
"LowParse.Slice.buffer_srel_of_srel",
"LowParse.Slice.__proj__Mkslice__item__base",
"FStar.UInt32.add",
"FStar.UInt32.uint_to_t",
"Prims.nat",
"LowParse.Low.Base.Spec.serialized_length",
"LowStar.Monotonic.Buffer.modifies",
"LowParse.Slice.loc_slice_from_to",
"LowParse.Low.Base.Spec.valid_content_pos",
"LowParse.Spec.Sum.parse_dsum_kind",
"LowParse.Spec.Sum.dsum_type",
"LowParse.Spec.Sum.parse_dsum",
"LowParse.Spec.Sum.synth_dsum_case",
"LowParse.Spec.Enum.Unknown",
"LowParse.Low.Base.Spec.contents",
"LowParse.Low.Base.Spec.get_valid_pos"
] | [] | false | true | false | false | false | let finalize_dsum_case_unknown
(t: dsum)
(#kt: parser_kind)
(#p: parser kt (dsum_repr_type t))
(s: serializer p)
(w: leaf_writer_strong s)
(f: (x: dsum_known_key t -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x))))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
(r: unknown_enum_repr (dsum_enum t))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: HST.Stack unit
(requires
(fun h ->
let len_tag = serialized_length s r in
U32.v pos + len_tag < 4294967296 /\
(let pos_payload = pos `U32.add` (U32.uint_to_t len_tag) in
valid g h input pos_payload /\ writable input.base (U32.v pos) (U32.v pos_payload) h))
)
(ensures
(fun h _ h' ->
let len_tag = serialized_length s r in
let pos_payload = pos `U32.add` (U32.uint_to_t len_tag) in
B.modifies (loc_slice_from_to input pos pos_payload) h h' /\
valid_content_pos (parse_dsum t p f g)
h'
input
pos
(synth_dsum_case t (Unknown r) (contents g h input pos_payload))
(get_valid_pos g h input pos_payload))) =
| let pos1 = w r input pos in
let h = HST.get () in
[@@ inline_let ]let _ =
valid_facts (parse_maybe_enum_key p (dsum_enum t)) h input pos;
valid_facts p h input pos;
let sq = bytes_of_slice_from h input pos in
parse_maybe_enum_key_eq p (dsum_enum t) sq;
valid_dsum_intro_unknown h t p f g input pos
in
() | false |
LowParse.Low.Sum.fst | LowParse.Low.Sum.jump_dsum_cases'_destr | val jump_dsum_cases'_destr
(s: dsum)
(f: (x: dsum_known_key s -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x))))
(f': (x: dsum_known_key s -> Tot (jumper (dsnd (f x)))))
(#k: parser_kind)
(#g: parser k (dsum_type_of_unknown_tag s))
(g': jumper g)
(destr: dep_enum_destr _ (fun k -> jump_dsum_cases_t s f g (Known k)))
(x: dsum_key s)
: Tot (jump_dsum_cases_t s f g x) | val jump_dsum_cases'_destr
(s: dsum)
(f: (x: dsum_known_key s -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x))))
(f': (x: dsum_known_key s -> Tot (jumper (dsnd (f x)))))
(#k: parser_kind)
(#g: parser k (dsum_type_of_unknown_tag s))
(g': jumper g)
(destr: dep_enum_destr _ (fun k -> jump_dsum_cases_t s f g (Known k)))
(x: dsum_key s)
: Tot (jump_dsum_cases_t s f g x) | let jump_dsum_cases'_destr
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(f' : (x: dsum_known_key s) -> Tot (jumper (dsnd (f x))))
(#k: parser_kind)
(#g: parser k (dsum_type_of_unknown_tag s))
(g' : jumper g)
(destr: dep_enum_destr _ (fun k -> jump_dsum_cases_t s f g (Known k)))
(x: dsum_key s)
: Tot (jump_dsum_cases_t s f g x)
= fun #rrel #rel input pos ->
match x with
| Known k ->
destr
_
(fun k -> jump_dsum_cases_if s f g (Known k))
(fun _ _ -> ())
(fun _ _ _ _ -> ())
(fun k -> jump_dsum_cases' s f f' g' (Known k))
k
input
pos
| Unknown r -> jump_dsum_cases' s f f' g' (Unknown r) input pos | {
"file_name": "src/lowparse/LowParse.Low.Sum.fst",
"git_rev": "00217c4a89f5ba56002ba9aa5b4a9d5903bfe9fa",
"git_url": "https://github.com/project-everest/everparse.git",
"project_name": "everparse"
} | {
"end_col": 65,
"end_line": 1457,
"start_col": 0,
"start_line": 1435
} | module LowParse.Low.Sum
include LowParse.Low.Enum
include LowParse.Spec.Sum
module U32 = FStar.UInt32
module HST = FStar.HyperStack.ST
module B = LowStar.Buffer
module Cast = FStar.Int.Cast
module U64 = FStar.UInt64
inline_for_extraction
let validate_sum_cases_aux
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(vc: ((x: sum_key t) -> Tot (validator (dsnd (pc x)))))
(k: sum_key t)
: Tot (validator (parse_sum_cases t pc k))
= [@inline_let]
let _ = synth_sum_case_injective t k in
validate_synth
(validate_weaken
(weaken_parse_cases_kind t pc)
(vc k)
()
)
(synth_sum_case t k)
()
inline_for_extraction
let validate_sum_cases_t
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot Type
= validator (parse_sum_cases t pc k)
let validate_sum_cases_t_eq
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
(x y : validate_sum_cases_t t pc k)
: GTot Type0
= True
inline_for_extraction
let validate_sum_cases_t_if
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (if_combinator _ (validate_sum_cases_t_eq t pc k))
= fun cond (sv_true: cond_true cond -> Tot (validate_sum_cases_t t pc k)) (sv_false: cond_false cond -> Tot (validate_sum_cases_t t pc k)) #rrel #rel input pos ->
if cond
then sv_true () input pos
else sv_false () input pos
inline_for_extraction
let validate_sum_cases
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(vc: ((x: sum_key t) -> Tot (validator (dsnd (pc x)))))
(destr: dep_enum_destr (sum_enum t) (validate_sum_cases_t t pc))
(k: sum_key t)
: Tot (validator (parse_sum_cases t pc k))
= destr
_
(validate_sum_cases_t_if t pc)
(fun _ _ -> ())
(fun _ _ _ _ -> ())
(validate_sum_cases_aux t pc vc)
k
inline_for_extraction
let validate_sum_aux_payload_t
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
: Tot Type
= (#rrel: _) -> (#rel: _) ->
(input: slice rrel rel) ->
(pos: U64.t) ->
HST.Stack U64.t
(requires (fun h -> live_slice h input /\ U64.v pos <= U32.v input.len))
(ensures (fun h res h' ->
B.modifies B.loc_none h h' /\ (
match k with
| Unknown _ -> is_error res
| Known k' ->
if is_success res
then
valid_pos (dsnd (pc k')) h input (uint64_to_uint32 pos) (uint64_to_uint32 res)
else
(~ (valid (dsnd (pc k')) h input (uint64_to_uint32 pos)))
)))
let validate_sum_aux_payload_eq
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
: Tot (validate_sum_aux_payload_t t pc k -> validate_sum_aux_payload_t t pc k -> GTot Type0)
= fun _ _ -> True
inline_for_extraction
let validate_sum_aux_payload_if'
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
(cond: bool)
(ift: ((cond_true cond) -> Tot (validate_sum_aux_payload_t t pc k)))
(iff: ((cond_false cond) -> Tot (validate_sum_aux_payload_t t pc k)))
: Tot (validate_sum_aux_payload_t t pc k)
= fun #rrel #rel input pos ->
if cond
then begin
(ift () <: validate_sum_aux_payload_t t pc k) input pos
end else
(iff () <: validate_sum_aux_payload_t t pc k) input pos
inline_for_extraction
let validate_sum_aux_payload_if
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
: Tot (if_combinator _ (validate_sum_aux_payload_eq t pc k))
= validate_sum_aux_payload_if' t pc k
#push-options "--z3rlimit 64 --z3cliopt smt.arith.nl=false --using_facts_from '* -FStar.Int.Cast -LowParse.BitFields'"
// --query_stats --smtencoding.elim_box true --smtencoding.l_arith_repr native --z3refresh"
inline_for_extraction
let validate_sum_aux
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(v: validator p)
(p32: leaf_reader p)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(v_payload: ((k: sum_repr_type t)) -> Tot (validate_sum_aux_payload_t t pc (maybe_enum_key_of_repr (sum_enum t) k)))
: Tot (validator (parse_sum t p pc))
= fun #rrel #rel input pos ->
let h = HST.get () in
[@inline_let]
let _ = parse_sum_eq'' t p pc (bytes_of_slice_from h input (uint64_to_uint32 pos)) in
[@inline_let]
let _ = valid_facts (parse_sum t p pc) h input (uint64_to_uint32 pos) in
[@inline_let]
let _ = valid_facts p h input (uint64_to_uint32 pos) in
let len_after_tag = v input pos in
if is_error len_after_tag
then len_after_tag
else begin
let h1 = HST.get () in
let k' = p32 input (uint64_to_uint32 pos) in
[@inline_let]
let _ =
match maybe_enum_key_of_repr (sum_enum t) k' with
| Known k -> valid_facts (dsnd (pc k)) h input (uint64_to_uint32 len_after_tag)
| _ -> ()
in
v_payload k' input len_after_tag
end
#pop-options
inline_for_extraction
let validate_sum_aux_payload'
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (validator (dsnd (pc x)))))
(k: maybe_enum_key (sum_enum t))
: Tot (validate_sum_aux_payload_t t pc k)
= fun #rrel #rel input pos ->
match k with
| Known k ->
[@inline_let]
let _ = synth_sum_case_injective t k in
pc32 k input pos
// validate_synth (pc32 k) (synth_sum_case t k) () input pos
| _ -> validator_error_generic
inline_for_extraction
let validate_sum_aux_payload
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (validator (dsnd (pc x)))))
(destr: dep_maybe_enum_destr_t (sum_enum t) (validate_sum_aux_payload_t t pc))
(k: sum_repr_type t)
: Tot (validate_sum_aux_payload_t t pc (maybe_enum_key_of_repr (sum_enum t) k))
= destr (validate_sum_aux_payload_eq t pc) (validate_sum_aux_payload_if t pc) (fun _ _ -> ()) (fun _ _ _ _ -> ()) (validate_sum_aux_payload' t pc pc32) k
inline_for_extraction
let validate_sum
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(v: validator p)
(p32: leaf_reader p)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (validator (dsnd (pc x)))))
(destr: dep_maybe_enum_destr_t (sum_enum t) (validate_sum_aux_payload_t t pc))
: Tot (validator (parse_sum t p pc))
= validate_sum_aux t v p32 pc (validate_sum_aux_payload t pc pc32 destr)
module HS = FStar.HyperStack
#push-options "--z3rlimit 256 --z3cliopt smt.arith.nl=false --initial_ifuel 8 --max_ifuel 8 --initial_fuel 2 --max_fuel 2"
#restart-solver
let valid_sum_intro
(h: HS.mem)
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: Lemma
(requires (
valid (parse_enum_key p (sum_enum t)) h input pos /\ (
let k = contents (parse_enum_key p (sum_enum t)) h input pos in
valid (dsnd (pc k)) h input (get_valid_pos (parse_enum_key p (sum_enum t)) h input pos)
)))
(ensures (
let k = contents (parse_enum_key p (sum_enum t)) h input pos in
let pos_payload = get_valid_pos (parse_enum_key p (sum_enum t)) h input pos in
valid_content_pos
(parse_sum t p pc) h input pos
(synth_sum_case t k (contents (dsnd (pc k)) h input pos_payload))
(get_valid_pos (dsnd (pc k)) h input pos_payload)
))
= valid_facts (parse_enum_key p (sum_enum t)) h input pos;
let k = contents (parse_enum_key p (sum_enum t)) h input pos in
let pos_payload = get_valid_pos (parse_enum_key p (sum_enum t)) h input pos in
valid_facts (dsnd (pc k)) h input pos_payload;
valid_facts (parse_sum t p pc) h input pos;
parse_sum_eq t p pc (bytes_of_slice_from h input pos)
#pop-options
inline_for_extraction
let finalize_sum_case
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(s: serializer p)
(w: leaf_writer_strong s)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(destr: enum_repr_of_key'_t (sum_enum t))
(k: sum_key t)
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: HST.Stack unit
(requires (fun h ->
let len_tag = serialized_length (serialize_enum_key _ s (sum_enum t)) k in
U32.v pos + len_tag < 4294967296 /\ (
let pos_payload = pos `U32.add` U32.uint_to_t len_tag in
valid (dsnd (pc k)) h input pos_payload /\
writable input.base (U32.v pos) (U32.v pos_payload) h
)))
(ensures (fun h _ h' ->
let len_tag = serialized_length (serialize_enum_key _ s (sum_enum t)) k in
let pos_payload = pos `U32.add` U32.uint_to_t len_tag in
B.modifies (loc_slice_from_to input pos pos_payload) h h' /\
valid_content_pos (parse_sum t p pc) h' input pos (synth_sum_case t k (contents (dsnd (pc k)) h input pos_payload)) (get_valid_pos (dsnd (pc k)) h input pos_payload)
))
= let pos1 = write_enum_key w (sum_enum t) destr k input pos in
let h = HST.get () in
[@inline_let]
let _ = valid_sum_intro h t p pc input pos in
()
inline_for_extraction
let jump_sum_cases_aux
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(vc: ((x: sum_key t) -> Tot (jumper (dsnd (pc x)))))
(k: sum_key t)
: Tot (jumper (parse_sum_cases t pc k))
= [@inline_let]
let _ = synth_sum_case_injective t k in
jump_synth
(jump_weaken
(weaken_parse_cases_kind t pc)
(vc k)
()
)
(synth_sum_case t k)
()
inline_for_extraction
let jump_sum_cases_t
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot Type
= jumper (parse_sum_cases t pc k)
let jump_sum_cases_t_eq
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
(x y : jump_sum_cases_t t pc k)
: GTot Type0
= True
inline_for_extraction
let jump_sum_cases_t_if
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (if_combinator _ (jump_sum_cases_t_eq t pc k))
= fun cond (sv_true: cond_true cond -> Tot (jump_sum_cases_t t pc k)) (sv_false: cond_false cond -> Tot (jump_sum_cases_t t pc k)) #rrel #rel input pos ->
if cond
then sv_true () input pos
else sv_false () input pos
inline_for_extraction
let jump_sum_cases
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(vc: ((x: sum_key t) -> Tot (jumper (dsnd (pc x)))))
(destr: dep_enum_destr (sum_enum t) (jump_sum_cases_t t pc))
(k: sum_key t)
: Tot (jumper (parse_sum_cases t pc k))
= destr
_
(jump_sum_cases_t_if t pc)
(fun _ _ -> ())
(fun _ _ _ _ -> ())
(jump_sum_cases_aux t pc vc)
k
inline_for_extraction
let jump_sum_aux_payload_t
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
: Tot Type
= (#rrel: _) -> (#rel: _) ->
(input: slice rrel rel) ->
(pos: U32.t) ->
HST.Stack U32.t
(requires (fun h -> live_slice h input /\ U32.v pos <= U32.v input.len /\ (
match k with
| Unknown _ -> False
| Known k' -> valid (dsnd (pc k')) h input pos
)))
(ensures (fun h res h' ->
B.modifies B.loc_none h h' /\ (
match k with
| Unknown _ -> False
| Known k' ->
valid_pos (dsnd (pc k')) h input pos res
)))
let jump_sum_aux_payload_eq
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
: Tot (jump_sum_aux_payload_t t pc k -> jump_sum_aux_payload_t t pc k -> GTot Type0)
= fun _ _ -> True
inline_for_extraction
let jump_sum_aux_payload_if'
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
(cond: bool)
(ift: ((cond_true cond) -> Tot (jump_sum_aux_payload_t t pc k)))
(iff: ((cond_false cond) -> Tot (jump_sum_aux_payload_t t pc k)))
: Tot (jump_sum_aux_payload_t t pc k)
= fun #rrel #rel input pos ->
if cond
then begin
(ift () <: jump_sum_aux_payload_t t pc k) input pos
end else
(iff () <: jump_sum_aux_payload_t t pc k) input pos
inline_for_extraction
let jump_sum_aux_payload_if
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
: Tot (if_combinator _ (jump_sum_aux_payload_eq t pc k))
= jump_sum_aux_payload_if' t pc k
let parse_sum_eq3
(#kt: parser_kind)
(t: sum)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(input: bytes)
(k' : sum_repr_type t)
(consumed_k: consumed_length input)
: Lemma
(requires (Some? (parse (parse_sum t p pc) input) /\ parse p input == Some (k', consumed_k)))
(ensures (
let input_k = Seq.slice input consumed_k (Seq.length input) in
let k = maybe_enum_key_of_repr (sum_enum t) k' in
begin match k with
| Known k ->
Some? (parse (dsnd (pc k)) input_k)
| _ -> False
end
))
= parse_sum_eq'' t p pc input
let parse_sum_eq4
(#kt: parser_kind)
(t: sum)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(input: bytes)
(k' : sum_repr_type t)
(consumed_k: consumed_length input)
(consumed_payload: nat)
: Lemma
(requires (Some? (parse (parse_sum t p pc) input) /\ parse p input == Some (k', consumed_k) /\ (
let input_k = Seq.slice input consumed_k (Seq.length input) in
let k = maybe_enum_key_of_repr (sum_enum t) k' in
begin match k with
| Known k ->
Some? (parse (dsnd (pc k)) input_k) /\ (
let Some (_, consumed_payload') = parse (dsnd (pc k)) input_k in
consumed_payload' == consumed_payload
)
| _ -> False
end
)))
(ensures (
let Some (_, consumed) = parse (parse_sum t p pc) input in
consumed == consumed_k + consumed_payload
))
= parse_sum_eq'' t p pc input
#push-options "--z3rlimit 16"
let valid_sum_elim
(h: HS.mem)
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(#rrel: _) (#rel: _)
(input: slice rrel rel)
(pos: U32.t)
: Lemma
(requires (
valid (parse_sum t p pc) h input pos
))
(ensures (
valid p h input pos /\ (
let pos_payload = get_valid_pos p h input pos in
let k' = maybe_enum_key_of_repr (sum_enum t) (contents p h input pos) in
match k' with
| Known k ->
k == sum_tag_of_data t (contents (parse_sum t p pc) h input pos) /\
valid (dsnd (pc k)) h input pos_payload /\
valid_pos
(parse_sum t p pc) h input pos
(get_valid_pos (dsnd (pc k)) h input pos_payload)
| _ -> False
)))
= let sinput = bytes_of_slice_from h input pos in
let _ = parse_sum_eq'' t p pc sinput in
[@inline_let]
let _ = valid_facts (parse_sum t p pc) h input pos in
let Some (k', consumed_k) = parse p sinput in
let pos_after_tag = U32.uint_to_t (U32.v pos + consumed_k) in
[@inline_let]
let _ = valid_facts p h input pos in
assert (valid_content_pos p h input pos k' pos_after_tag);
match maybe_enum_key_of_repr (sum_enum t) k' with
| Known k -> valid_facts (dsnd (pc k)) h input pos_after_tag
| _ -> ()
#pop-options
let valid_sum_elim_tag
(h: HS.mem)
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: Lemma
(requires (
valid (parse_sum t p pc) h input pos
))
(ensures (
valid (parse_enum_key p (sum_enum t)) h input pos /\
contents (parse_enum_key p (sum_enum t)) h input pos == sum_tag_of_data t (contents (parse_sum t p pc) h input pos)
))
= let _ = parse_sum_eq' t p pc (bytes_of_slice_from h input pos) in
let _ = valid_facts (parse_sum t p pc) h input pos in
let _ = valid_facts (parse_enum_key p (sum_enum t)) h input pos in
()
inline_for_extraction
let read_sum_tag
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(p32: leaf_reader p)
(destr: dep_maybe_enum_destr_t (sum_enum t) (read_enum_key_t (sum_enum t)))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: HST.Stack (sum_key t)
(requires (fun h ->
valid (parse_sum t p pc) h input pos
))
(ensures (fun h res h' ->
B.modifies B.loc_none h h' /\
res == sum_tag_of_data t (contents (parse_sum t p pc) h input pos)
))
= let h = HST.get () in
[@inline_let] let _ = valid_sum_elim_tag h t p pc input pos in
read_enum_key p32 (sum_enum t) destr input pos
inline_for_extraction
let jump_sum_aux
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(v: jumper p)
(p32: leaf_reader p)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(v_payload: ((k: sum_repr_type t)) -> Tot (jump_sum_aux_payload_t t pc (maybe_enum_key_of_repr (sum_enum t) k)))
: Tot (jumper (parse_sum t p pc))
= fun #rrel #rel input pos ->
let h = HST.get () in
[@inline_let]
let _ = valid_sum_elim h t p pc input pos in
let pos_after_tag = v input pos in
let k' = p32 input pos in
v_payload k' input pos_after_tag
inline_for_extraction
let jump_sum_aux_payload'
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (jumper (dsnd (pc x)))))
(k: maybe_enum_key (sum_enum t))
: Tot (jump_sum_aux_payload_t t pc k)
= fun #rrel #rel input pos ->
match k with
| Known k ->
[@inline_let]
let _ = synth_sum_case_injective t k in
pc32 k input pos
| _ -> 0ul // dummy, but we MUST NOT remove this branch, otherwise extraction fails
inline_for_extraction
let jump_sum_aux_payload
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (jumper (dsnd (pc x)))))
(destr: dep_maybe_enum_destr_t (sum_enum t) (jump_sum_aux_payload_t t pc))
(k: sum_repr_type t)
: Tot (jump_sum_aux_payload_t t pc (maybe_enum_key_of_repr (sum_enum t) k))
= destr (jump_sum_aux_payload_eq t pc) (jump_sum_aux_payload_if t pc) (fun _ _ -> ()) (fun _ _ _ _ -> ()) (jump_sum_aux_payload' t pc pc32) k
inline_for_extraction
let jump_sum
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(v: jumper p)
(p32: leaf_reader p)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (jumper (dsnd (pc x)))))
(destr: dep_maybe_enum_destr_t (sum_enum t) (jump_sum_aux_payload_t t pc))
: Tot (jumper (parse_sum t p pc))
= jump_sum_aux t v p32 pc (jump_sum_aux_payload t pc pc32 destr)
inline_for_extraction
let read_sum_cases'
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (leaf_reader (dsnd (pc x)))))
(k: sum_key t)
: Tot (leaf_reader (parse_sum_cases' t pc k))
= [@inline_let]
let _ = synth_sum_case_injective t k in
read_synth'
(dsnd (pc k))
(synth_sum_case t k)
(pc32 k)
()
inline_for_extraction
let read_sum_cases_t
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot Type
= leaf_reader (parse_sum_cases' t pc k)
let read_sum_cases_t_eq
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
(x y : read_sum_cases_t t pc k)
: GTot Type0
= True
inline_for_extraction
let read_sum_cases_t_if
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (if_combinator _ (read_sum_cases_t_eq t pc k))
= fun cond (sv_true: cond_true cond -> Tot (read_sum_cases_t t pc k)) (sv_false: cond_false cond -> Tot (read_sum_cases_t t pc k)) #_ #_ input pos ->
if cond
then (sv_true () input pos)
else (sv_false () input pos)
inline_for_extraction
let read_sum_cases
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (leaf_reader (dsnd (pc x)))))
(destr: dep_enum_destr (sum_enum t) (read_sum_cases_t t pc))
(k: sum_key t)
: Tot (leaf_reader (parse_sum_cases' t pc k))
= destr
_
(read_sum_cases_t_if t pc)
(fun _ _ -> ())
(fun _ _ _ _ -> ())
(read_sum_cases' t pc pc32)
k
#push-options "--z3rlimit 32"
inline_for_extraction
let read_sum
(#kt: parser_kind)
(t: sum)
(p: parser kt (sum_repr_type t))
(p32: leaf_reader (parse_enum_key p (sum_enum t)))
(j: jumper p)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (leaf_reader (dsnd (pc x)))))
(destr: dep_enum_destr (sum_enum t) (read_sum_cases_t t pc))
: Tot (leaf_reader (parse_sum t p pc))
=
fun #_ #_ input pos ->
let h = HST.get () in
valid_facts (parse_sum t p pc) h input pos;
parse_sum_eq' t p pc (bytes_of_slice_from h input pos);
valid_facts (parse_enum_key p (sum_enum t)) h input pos;
let k = p32 input pos in
let pos' = jump_enum_key j (sum_enum t) input pos in
valid_facts (parse_sum_cases' t pc k) h input pos' ;
read_sum_cases t pc pc32 destr k input pos'
#pop-options
inline_for_extraction
let serialize32_sum_cases_t
(t: sum)
(#pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(sc: ((x: sum_key t) -> Tot (serializer (dsnd (pc x)))))
(k: sum_key t)
: Tot Type
= serializer32 (serialize_sum_cases t pc sc k)
let serialize32_sum_cases_t_eq
(t: sum)
(#pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(sc: ((x: sum_key t) -> Tot (serializer (dsnd (pc x)))))
(k: sum_key t)
(x y: serialize32_sum_cases_t t sc k)
: GTot Type0
= True
inline_for_extraction
let serialize32_sum_cases_t_if
(t: sum)
(#pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(sc: ((x: sum_key t) -> Tot (serializer (dsnd (pc x)))))
(k: sum_key t)
: Tot (if_combinator _ (serialize32_sum_cases_t_eq t sc k))
= fun cond (sv_true: (cond_true cond -> Tot (serialize32_sum_cases_t t sc k))) (sv_false: (cond_false cond -> Tot (serialize32_sum_cases_t t sc k))) x #rrel #rel b pos ->
if cond
then (sv_true () x b pos)
else (sv_false () x b pos)
inline_for_extraction
let serialize32_sum_cases_aux
(t: sum)
(#pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(sc: ((x: sum_key t) -> Tot (serializer (dsnd (pc x)))))
(sc32: ((x: sum_key t) -> Tot (serializer32 (sc x))))
(k: sum_key t)
: Tot (serializer32 (serialize_sum_cases t pc sc k))
= fun x #rrel #rel b pos ->
[@inline_let] let _ =
Classical.forall_intro (parse_sum_cases_eq' t pc k);
synth_sum_case_injective t k;
synth_sum_case_inverse t k
in
serialize32_synth
(sc32 k)
(synth_sum_case t k)
(synth_sum_case_recip t k)
(fun x -> synth_sum_case_recip t k x)
()
x
b
pos
inline_for_extraction
let serialize32_sum_cases
(t: sum)
(#pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(sc: ((x: sum_key t) -> Tot (serializer (dsnd (pc x)))))
(sc32: ((x: sum_key t) -> Tot (serializer32 (sc x))))
(destr: dep_enum_destr (sum_enum t) (serialize32_sum_cases_t t sc))
(k: sum_key t)
: Tot (serializer32 (serialize_sum_cases t pc sc k))
= destr
_
(serialize32_sum_cases_t_if t sc)
(fun _ _ -> ())
(fun _ _ _ _ -> ())
(serialize32_sum_cases_aux t sc sc32)
k
inline_for_extraction
let serialize32_sum
(#kt: parser_kind)
(t: sum)
(#p: parser kt (sum_repr_type t))
(s: serializer p {kt.parser_kind_subkind == Some ParserStrong})
(s32: serializer32 (serialize_enum_key _ s (sum_enum t)))
(#pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(sc: ((x: sum_key t) -> Tot (serializer (dsnd (pc x)))))
(sc32: ((x: sum_key t) -> Tot (serializer32 (sc x))))
(destr: dep_enum_destr (sum_enum t) (serialize32_sum_cases_t t sc))
: Tot (serializer32 (serialize_sum t s sc))
= fun x #rrel #rel b pos ->
serialize_sum_eq t s sc x;
let tg = sum_tag_of_data t x in
serialize32_nondep_then_aux s32 (serialize32_sum_cases t sc sc32 destr tg) tg x b pos
let clens_sum_tag
(s: sum)
: Tot (clens (sum_type s) (sum_key s))
= {
clens_cond = (fun _ -> True);
clens_get = sum_tag_of_data s;
}
let gaccessor_sum_tag
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
: Tot (gaccessor (parse_sum t p pc) (parse_enum_key p (sum_enum t)) (clens_sum_tag t))
= gaccessor_tagged_union_tag
(parse_enum_key p (sum_enum t))
(sum_tag_of_data t)
(parse_sum_cases t pc)
inline_for_extraction
let accessor_sum_tag
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
: Tot (accessor (gaccessor_sum_tag t p pc))
= accessor_tagged_union_tag
(parse_enum_key p (sum_enum t))
(sum_tag_of_data t)
(parse_sum_cases t pc)
let clens_sum_payload
(s: sum)
(k: sum_key s)
: Tot (clens (sum_type s) (sum_type_of_tag s k))
= {
clens_cond = (fun (x: sum_type s) -> sum_tag_of_data s x == k);
clens_get = (fun (x: sum_type s) -> synth_sum_case_recip s k x <: Ghost (sum_type_of_tag s k) (requires (sum_tag_of_data s x == k)) (ensures (fun _ -> True)));
}
#push-options "--z3rlimit 32"
let gaccessor_clens_sum_payload'
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (gaccessor' (parse_sum t p pc) (dsnd (pc k)) (clens_sum_payload t k))
= fun (input: bytes) ->
parse_sum_eq'' t p pc input;
let res =
match parse p input with
| Some (_, consumed) ->
synth_sum_case_inverse t k;
synth_sum_case_injective t k;
synth_injective_synth_inverse_synth_inverse_recip (synth_sum_case t k) (synth_sum_case_recip t k) ();
(consumed)
| _ -> 0 // dummy
in
(res <: (res: _ { gaccessor_post' (parse_sum t p pc) (dsnd (pc k)) (clens_sum_payload t k) input res } ))
#push-options "--z3rlimit 64"
let gaccessor_clens_sum_payload_injective
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
(sl sl' : bytes)
: Lemma
(requires (
gaccessor_pre (parse_sum t p pc) (dsnd (pc k)) (clens_sum_payload t k) sl /\
gaccessor_pre (parse_sum t p pc) (dsnd (pc k)) (clens_sum_payload t k) sl' /\
injective_precond (parse_sum t p pc) sl sl'
))
(ensures (gaccessor_clens_sum_payload' t p pc k sl == gaccessor_clens_sum_payload' t p pc k sl'))
= parse_sum_eq'' t p pc sl;
parse_sum_eq'' t p pc sl' ;
parse_injective (parse_sum t p pc) sl sl' ;
parse_injective p sl sl'
#pop-options
let gaccessor_clens_sum_payload_no_lookahead
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
(sl sl' : bytes)
: Lemma
(requires (
(parse_sum_kind kt t pc).parser_kind_subkind == Some ParserStrong /\
gaccessor_pre (parse_sum t p pc) (dsnd (pc k)) (clens_sum_payload t k) sl /\
gaccessor_pre (parse_sum t p pc) (dsnd (pc k)) (clens_sum_payload t k) sl' /\
no_lookahead_on_precond (parse_sum t p pc) sl sl'
))
(ensures (gaccessor_clens_sum_payload' t p pc k sl == gaccessor_clens_sum_payload' t p pc k sl'))
= parse_sum_eq'' t p pc sl;
parse_sum_eq'' t p pc sl' ;
parse_strong_prefix (parse_sum t p pc) sl sl' ;
parse_injective p sl sl'
let gaccessor_clens_sum_payload
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (gaccessor (parse_sum t p pc) (dsnd (pc k)) (clens_sum_payload t k))
= Classical.forall_intro_2 (fun x -> Classical.move_requires (gaccessor_clens_sum_payload_injective t p pc k x));
Classical.forall_intro_2 (fun x -> Classical.move_requires (gaccessor_clens_sum_payload_no_lookahead t p pc k x));
gaccessor_prop_equiv (parse_sum t p pc) (dsnd (pc k)) (clens_sum_payload t k) (gaccessor_clens_sum_payload' t p pc k);
gaccessor_clens_sum_payload' t p pc k
inline_for_extraction
let accessor_clens_sum_payload'
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(j: jumper p)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: HST.Stack U32.t
(requires (fun h ->
valid (parse_sum t p pc) h input pos /\
(clens_sum_payload t k).clens_cond (contents (parse_sum t p pc) h input pos)
))
(ensures (fun h pos' h' ->
B.modifies B.loc_none h h' /\
pos' == slice_access h (gaccessor_clens_sum_payload t p pc k) input pos
))
=
let h = HST.get () in
[@inline_let]
let _ =
let pos' = get_valid_pos (parse_sum t p pc) h input pos in
let large = bytes_of_slice_from h input pos in
slice_access_eq h (gaccessor_clens_sum_payload t p pc k) input pos;
valid_facts (parse_sum t p pc) h input pos;
parse_sum_eq'' t p pc large;
valid_facts p h input pos
in
j input pos
#pop-options
inline_for_extraction
let accessor_clens_sum_payload
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(j: jumper p)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (accessor (gaccessor_clens_sum_payload t p pc k))
= fun #rrel #rel -> accessor_clens_sum_payload' t j pc k #rrel #rel
let clens_sum_cases_payload
(s: sum)
(k: sum_key s)
: Tot (clens (sum_cases s k) (sum_type_of_tag s k))
= {
clens_cond = (fun (x: sum_cases s k) -> True);
clens_get = (fun (x: sum_cases s k) -> synth_sum_case_recip s k x <: Ghost (sum_type_of_tag s k) (requires (True)) (ensures (fun _ -> True)));
}
let gaccessor_clens_sum_cases_payload
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (gaccessor (parse_sum_cases' t pc k) (dsnd (pc k)) (clens_sum_cases_payload t k))
= synth_sum_case_injective t k;
synth_sum_case_inverse t k;
synth_injective_synth_inverse_synth_inverse_recip (synth_sum_case t k) (synth_sum_case_recip t k) ();
gaccessor_ext
(gaccessor_synth (dsnd (pc k)) (synth_sum_case t k) (synth_sum_case_recip t k) ())
(clens_sum_cases_payload t k)
()
inline_for_extraction
let accessor_clens_sum_cases_payload
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (accessor (gaccessor_clens_sum_cases_payload t pc k))
= [@inline_let]
let _ =
synth_sum_case_injective t k;
synth_sum_case_inverse t k;
synth_injective_synth_inverse_synth_inverse_recip (synth_sum_case t k) (synth_sum_case_recip t k) ()
in
accessor_ext
(accessor_synth (dsnd (pc k)) (synth_sum_case t k) (synth_sum_case_recip t k) ())
(clens_sum_cases_payload t k)
()
inline_for_extraction
let validate_dsum_cases_t
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(#k: parser_kind)
(g: parser k (dsum_type_of_unknown_tag s))
(x: dsum_key s)
: Tot Type
= validator (parse_dsum_cases' s f g x)
let validate_dsum_cases_eq
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(#k: parser_kind)
(g: parser k (dsum_type_of_unknown_tag s))
(x: dsum_key s)
(v1 v2 : validate_dsum_cases_t s f g x)
: GTot Type0
= True
inline_for_extraction
let validate_dsum_cases_if'
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(#k: parser_kind)
(g: parser k (dsum_type_of_unknown_tag s))
(x: dsum_key s)
(cond: bool)
(ift: (cond_true cond -> Tot (validate_dsum_cases_t s f g x)))
(iff: (cond_false cond -> Tot (validate_dsum_cases_t s f g x)))
: Tot (validate_dsum_cases_t s f g x)
= fun #rrel #rel input len ->
if cond
then (ift () <: validate_dsum_cases_t s f g x) input len
else (iff () <: validate_dsum_cases_t s f g x) input len
inline_for_extraction
let validate_dsum_cases_if
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(#k: parser_kind)
(g: parser k (dsum_type_of_unknown_tag s))
(x: dsum_key s)
: Tot (if_combinator _ (validate_dsum_cases_eq s f g x))
= validate_dsum_cases_if' s f g x
inline_for_extraction
let validate_dsum_cases'
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(f' : (x: dsum_known_key s) -> Tot (validator (dsnd (f x))))
(#k: parser_kind)
(#g: parser k (dsum_type_of_unknown_tag s))
(g' : validator g)
(x: dsum_key s)
: Tot (validate_dsum_cases_t s f g x)
= [@inline_let]
let _ = synth_dsum_case_injective s x in
match x with
| Known x' -> validate_synth (f' x') (synth_dsum_case s (Known x')) () <: validator (parse_dsum_cases' s f g x)
| Unknown x' -> validate_synth g' (synth_dsum_case s (Unknown x')) () <: validator (parse_dsum_cases' s f g x)
inline_for_extraction
let validate_dsum_cases'_destr
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(f' : (x: dsum_known_key s) -> Tot (validator (dsnd (f x))))
(#k: parser_kind)
(#g: parser k (dsum_type_of_unknown_tag s))
(g' : validator g)
(destr: dep_enum_destr _ (fun k -> validate_dsum_cases_t s f g (Known k)))
(x: dsum_key s)
: Tot (validate_dsum_cases_t s f g x)
= fun #rrel #rel input pos ->
match x with
| Known k ->
destr
_
(fun k -> validate_dsum_cases_if s f g (Known k))
(fun _ _ -> ())
(fun _ _ _ _ -> ())
(fun k -> validate_dsum_cases' s f f' g' (Known k))
k
input
pos
| Unknown r -> validate_dsum_cases' s f f' g' (Unknown r) input pos
inline_for_extraction
let validate_dsum_cases
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(f' : (x: dsum_known_key s) -> Tot (validator (dsnd (f x))))
(#k: parser_kind)
(#g: parser k (dsum_type_of_unknown_tag s))
(g' : validator g)
(destr: dep_enum_destr _ (fun k -> validate_dsum_cases_t s f g (Known k)))
(x: dsum_key s)
: Tot (validator (parse_dsum_cases s f g x))
= fun #rrel #rel input pos ->
let h = HST.get () in
[@inline_let]
let _ =
valid_facts (parse_dsum_cases' s f g x) h input (uint64_to_uint32 pos);
valid_facts (parse_dsum_cases s f g x) h input (uint64_to_uint32 pos);
parse_dsum_cases_eq' s f g x (bytes_of_slice_from h input (uint64_to_uint32 pos))
in
validate_dsum_cases'_destr s f f' g' destr x input pos
#push-options "--z3rlimit 40"
inline_for_extraction
let validate_dsum
(#kt: parser_kind)
(t: dsum)
(#p: parser kt (dsum_repr_type t))
(v: validator p)
(p32: leaf_reader p)
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(f32: (x: dsum_known_key t) -> Tot (validator (dsnd (f x))))
(#k': parser_kind)
(#g: parser k' (dsum_type_of_unknown_tag t))
(g32: validator g)
(destr: dep_maybe_enum_destr_t (dsum_enum t) (validate_dsum_cases_t t f g))
: Tot (validator (parse_dsum t p f g))
= fun #rrel #rel input pos ->
let h = HST.get () in
[@inline_let]
let _ = parse_dsum_eq' t p f g (bytes_of_slice_from h input (uint64_to_uint32 pos)) in
[@inline_let]
let _ = valid_facts (parse_dsum t p f g) h input (uint64_to_uint32 pos) in
[@inline_let]
let _ = valid_facts p h input (uint64_to_uint32 pos) in
let pos_after_tag = v input pos in
if is_error pos_after_tag
then pos_after_tag
else
let tg = p32 input (uint64_to_uint32 pos) in
[@inline_let]
let _ = valid_facts (parse_dsum_cases' t f g (maybe_enum_key_of_repr (dsum_enum t) tg)) h input (uint64_to_uint32 pos_after_tag) in
destr (validate_dsum_cases_eq t f g) (validate_dsum_cases_if t f g) (fun _ _ -> ()) (fun _ _ _ _ -> ()) (validate_dsum_cases' t f f32 g32) tg input pos_after_tag
#pop-options
#reset-options "--z3rlimit 64 --z3cliopt smt.arith.nl=false --initial_ifuel 8 --max_ifuel 8 --initial_fuel 2 --max_fuel 2"
let valid_dsum_intro_known
(h: HS.mem)
(t: dsum)
(#kt: parser_kind)
(p: parser kt (dsum_repr_type t))
(f: ((x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x))))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: Lemma
(requires (
valid (parse_maybe_enum_key p (dsum_enum t)) h input pos /\ (
let k' = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
Known? k' /\ (
let Known k = k' in
valid (dsnd (f k)) h input (get_valid_pos (parse_maybe_enum_key p (dsum_enum t)) h input pos)
))))
(ensures (
let Known k = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
let pos_payload = get_valid_pos (parse_maybe_enum_key p (dsum_enum t)) h input pos in
valid_content_pos
(parse_dsum t p f g) h input pos
(synth_dsum_case t (Known k) (contents (dsnd (f k)) h input pos_payload))
(get_valid_pos (dsnd (f k)) h input pos_payload)
))
= valid_facts (parse_maybe_enum_key p (dsum_enum t)) h input pos;
let Known k = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
let pos_payload = get_valid_pos (parse_maybe_enum_key p (dsum_enum t)) h input pos in
valid_facts (dsnd (f k)) h input pos_payload;
valid_facts (parse_dsum t p f g) h input pos;
parse_dsum_eq t p f g (bytes_of_slice_from h input pos)
let valid_dsum_intro_unknown
(h: HS.mem)
(t: dsum)
(#kt: parser_kind)
(p: parser kt (dsum_repr_type t))
(f: ((x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x))))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: Lemma
(requires (
valid (parse_maybe_enum_key p (dsum_enum t)) h input pos /\ (
let k' = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
Unknown? k' /\
valid g h input (get_valid_pos (parse_maybe_enum_key p (dsum_enum t)) h input pos)
)))
(ensures (
let Unknown r = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
let pos_payload = get_valid_pos (parse_maybe_enum_key p (dsum_enum t)) h input pos in
valid_content_pos
(parse_dsum t p f g) h input pos
(synth_dsum_case t (Unknown r) (contents g h input pos_payload))
(get_valid_pos g h input pos_payload)
))
= valid_facts (parse_maybe_enum_key p (dsum_enum t)) h input pos;
let Unknown r = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
let pos_payload = get_valid_pos (parse_maybe_enum_key p (dsum_enum t)) h input pos in
valid_facts g h input pos_payload;
valid_facts (parse_dsum t p f g) h input pos;
parse_dsum_eq t p f g (bytes_of_slice_from h input pos)
#reset-options
inline_for_extraction
let finalize_dsum_case_known
(t: dsum)
(#kt: parser_kind)
(#p: parser kt (dsum_repr_type t))
(s: serializer p)
(w: leaf_writer_strong s)
(f: ((x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x))))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
(destr: enum_repr_of_key'_t (dsum_enum t))
(k: dsum_known_key t)
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: HST.Stack unit
(requires (fun h ->
let len_tag = serialized_length (serialize_enum_key _ s (dsum_enum t)) k in
U32.v pos + len_tag < 4294967296 /\ (
let pos_payload = pos `U32.add` U32.uint_to_t len_tag in
valid (dsnd (f k)) h input pos_payload /\
writable input.base (U32.v pos) (U32.v pos_payload) h
)))
(ensures (fun h _ h' ->
let len_tag = serialized_length (serialize_enum_key _ s (dsum_enum t)) k in
let pos_payload = pos `U32.add` U32.uint_to_t len_tag in
B.modifies (loc_slice_from_to input pos pos_payload) h h' /\
valid_content_pos (parse_dsum t p f g) h' input pos (synth_dsum_case t (Known k) (contents (dsnd (f k)) h input pos_payload)) (get_valid_pos (dsnd (f k)) h input pos_payload)
))
= let pos1 = write_enum_key w (dsum_enum t) destr k input pos in
let h = HST.get () in
[@inline_let]
let _ =
valid_facts (parse_enum_key p (dsum_enum t)) h input pos;
valid_facts (parse_maybe_enum_key p (dsum_enum t)) h input pos;
let sq = bytes_of_slice_from h input pos in
parse_enum_key_eq p (dsum_enum t) sq;
parse_maybe_enum_key_eq p (dsum_enum t) sq;
valid_dsum_intro_known h t p f g input pos
in
()
inline_for_extraction
let finalize_dsum_case_unknown
(t: dsum)
(#kt: parser_kind)
(#p: parser kt (dsum_repr_type t))
(s: serializer p)
(w: leaf_writer_strong s)
(f: ((x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x))))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
(r: unknown_enum_repr (dsum_enum t))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: HST.Stack unit
(requires (fun h ->
let len_tag = serialized_length s r in
U32.v pos + len_tag < 4294967296 /\ (
let pos_payload = pos `U32.add` U32.uint_to_t len_tag in
valid g h input pos_payload /\
writable input.base (U32.v pos) (U32.v pos_payload) h
)))
(ensures (fun h _ h' ->
let len_tag = serialized_length s r in
let pos_payload = pos `U32.add` U32.uint_to_t len_tag in
B.modifies (loc_slice_from_to input pos pos_payload) h h' /\
valid_content_pos (parse_dsum t p f g) h' input pos (synth_dsum_case t (Unknown r) (contents g h input pos_payload)) (get_valid_pos g h input pos_payload)
))
= let pos1 = w r input pos in
let h = HST.get () in
[@inline_let]
let _ =
valid_facts (parse_maybe_enum_key p (dsum_enum t)) h input pos;
valid_facts p h input pos;
let sq = bytes_of_slice_from h input pos in
parse_maybe_enum_key_eq p (dsum_enum t) sq;
valid_dsum_intro_unknown h t p f g input pos
in
()
let valid_dsum_elim_tag
(h: HS.mem)
(t: dsum)
(#kt: parser_kind)
(p: parser kt (dsum_repr_type t))
(f: ((x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x))))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: Lemma
(requires (
valid (parse_dsum t p f g) h input pos
))
(ensures (
valid (parse_maybe_enum_key p (dsum_enum t)) h input pos /\
contents (parse_maybe_enum_key p (dsum_enum t)) h input pos == dsum_tag_of_data t (contents (parse_dsum t p f g) h input pos)
))
= let _ = parse_dsum_eq_ t p f g (bytes_of_slice_from h input pos) in
let _ = valid_facts (parse_dsum t p f g) h input pos in
let _ = valid_facts (parse_maybe_enum_key p (dsum_enum t)) h input pos in
()
inline_for_extraction
let read_dsum_tag
(t: dsum)
(#kt: parser_kind)
(#p: parser kt (dsum_repr_type t))
(p32: leaf_reader p)
(destr: maybe_enum_destr_t (maybe_enum_key (dsum_enum t)) (dsum_enum t))
(f: ((x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x))))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: HST.Stack (dsum_key t)
(requires (fun h ->
valid (parse_dsum t p f g) h input pos
))
(ensures (fun h res h' ->
B.modifies B.loc_none h h' /\
res == dsum_tag_of_data t (contents (parse_dsum t p f g) h input pos)
))
= let h = HST.get () in
[@inline_let] let _ = valid_dsum_elim_tag h t p f g input pos in
read_maybe_enum_key p32 (dsum_enum t) destr input pos
#push-options "--z3rlimit 32"
let valid_dsum_elim_known
(h: HS.mem)
(t: dsum)
(#kt: parser_kind)
(p: parser kt (dsum_repr_type t))
(f: ((x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x))))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: Lemma
(requires (
valid (parse_dsum t p f g) h input pos /\
Known? (dsum_tag_of_data t (contents (parse_dsum t p f g) h input pos))
))
(ensures (
valid (parse_maybe_enum_key p (dsum_enum t)) h input pos /\ (
let k' = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
let pos_payload = get_valid_pos (parse_maybe_enum_key p (dsum_enum t)) h input pos in
Known? k' /\ (
let Known k = k' in
valid (dsnd (f k)) h input pos_payload /\
valid_content_pos
(parse_dsum t p f g) h input pos
(synth_dsum_case t (Known k) (contents (dsnd (f k)) h input pos_payload))
(get_valid_pos (dsnd (f k)) h input pos_payload)
))))
=
valid_facts (parse_dsum t p f g) h input pos;
parse_dsum_eq t p f g (bytes_of_slice_from h input pos);
valid_facts (parse_maybe_enum_key p (dsum_enum t)) h input pos;
let Known k = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
let pos_payload = get_valid_pos (parse_maybe_enum_key p (dsum_enum t)) h input pos in
valid_facts (dsnd (f k)) h input pos_payload
#pop-options
let valid_dsum_elim_unknown
(h: HS.mem)
(t: dsum)
(#kt: parser_kind)
(p: parser kt (dsum_repr_type t))
(f: ((x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x))))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: Lemma
(requires (
valid (parse_dsum t p f g) h input pos /\
Unknown? (dsum_tag_of_data t (contents (parse_dsum t p f g) h input pos))
))
(ensures (
valid (parse_maybe_enum_key p (dsum_enum t)) h input pos /\ (
let k' = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
let pos_payload = get_valid_pos (parse_maybe_enum_key p (dsum_enum t)) h input pos in
Unknown? k' /\ (
let Unknown r = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
valid g h input pos_payload /\
valid_content_pos
(parse_dsum t p f g) h input pos
(synth_dsum_case t (Unknown r) (contents g h input pos_payload))
(get_valid_pos g h input pos_payload)
))))
=
valid_facts (parse_dsum t p f g) h input pos;
parse_dsum_eq t p f g (bytes_of_slice_from h input pos);
valid_facts (parse_maybe_enum_key p (dsum_enum t)) h input pos;
let Unknown r = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
let pos_payload = get_valid_pos (parse_maybe_enum_key p (dsum_enum t)) h input pos in
valid_facts g h input pos_payload
inline_for_extraction
let jump_dsum_cases_t
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(#k: parser_kind)
(g: parser k (dsum_type_of_unknown_tag s))
(x: dsum_key s)
: Tot Type
= jumper (parse_dsum_cases' s f g x)
let jump_dsum_cases_eq
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(#k: parser_kind)
(g: parser k (dsum_type_of_unknown_tag s))
(x: dsum_key s)
(v1 v2 : jump_dsum_cases_t s f g x)
: GTot Type0
= True
inline_for_extraction
let jump_dsum_cases_if'
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(#k: parser_kind)
(g: parser k (dsum_type_of_unknown_tag s))
(x: dsum_key s)
(cond: bool)
(ift: (cond_true cond -> Tot (jump_dsum_cases_t s f g x)))
(iff: (cond_false cond -> Tot (jump_dsum_cases_t s f g x)))
: Tot (jump_dsum_cases_t s f g x)
= fun #rrel #rel input len ->
if cond
then (ift () <: jump_dsum_cases_t s f g x) input len
else (iff () <: jump_dsum_cases_t s f g x) input len
inline_for_extraction
let jump_dsum_cases_if
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(#k: parser_kind)
(g: parser k (dsum_type_of_unknown_tag s))
(x: dsum_key s)
: Tot (if_combinator _ (jump_dsum_cases_eq s f g x))
= jump_dsum_cases_if' s f g x
inline_for_extraction
let jump_dsum_cases'
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(f' : (x: dsum_known_key s) -> Tot (jumper (dsnd (f x))))
(#k: parser_kind)
(#g: parser k (dsum_type_of_unknown_tag s))
(g' : jumper g)
(x: dsum_key s)
: Tot (jump_dsum_cases_t s f g x)
= synth_dsum_case_injective s x;
match x with
| Known x' -> jump_synth (f' x') (synth_dsum_case s (Known x')) () <: jumper (parse_dsum_cases' s f g x)
| Unknown x' -> jump_synth g' (synth_dsum_case s (Unknown x')) () <: jumper (parse_dsum_cases' s f g x) | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"LowStar.Buffer.fst.checked",
"LowParse.Spec.Sum.fst.checked",
"LowParse.Low.Enum.fst.checked",
"FStar.UInt64.fsti.checked",
"FStar.UInt32.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Int.Cast.fst.checked",
"FStar.HyperStack.ST.fsti.checked",
"FStar.HyperStack.fst.checked",
"FStar.Classical.fsti.checked"
],
"interface_file": false,
"source_file": "LowParse.Low.Sum.fst"
} | [
{
"abbrev": true,
"full_module": "FStar.HyperStack",
"short_module": "HS"
},
{
"abbrev": true,
"full_module": "FStar.UInt64",
"short_module": "U64"
},
{
"abbrev": true,
"full_module": "FStar.Int.Cast",
"short_module": "Cast"
},
{
"abbrev": true,
"full_module": "LowStar.Buffer",
"short_module": "B"
},
{
"abbrev": true,
"full_module": "FStar.HyperStack.ST",
"short_module": "HST"
},
{
"abbrev": true,
"full_module": "FStar.UInt32",
"short_module": "U32"
},
{
"abbrev": false,
"full_module": "LowParse.Spec.Sum",
"short_module": null
},
{
"abbrev": false,
"full_module": "LowParse.Low.Enum",
"short_module": null
},
{
"abbrev": false,
"full_module": "LowParse.Low",
"short_module": null
},
{
"abbrev": false,
"full_module": "LowParse.Low",
"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",
"short_module": null
}
] | {
"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_elim_box": false,
"smtencoding_l_arith_repr": "boxwrap",
"smtencoding_nl_arith_repr": "boxwrap",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": true,
"z3cliopt": [],
"z3refresh": false,
"z3rlimit": 5,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | false |
s: LowParse.Spec.Sum.dsum ->
f:
(x: LowParse.Spec.Sum.dsum_known_key s
-> Prims.dtuple2 LowParse.Spec.Base.parser_kind
(fun k -> LowParse.Spec.Base.parser k (LowParse.Spec.Sum.dsum_type_of_known_tag s x))) ->
f':
(x: LowParse.Spec.Sum.dsum_known_key s
-> LowParse.Low.Base.jumper (FStar.Pervasives.dsnd (f x))) ->
g': LowParse.Low.Base.jumper g ->
destr:
LowParse.Spec.Enum.dep_enum_destr (LowParse.Spec.Sum.dsum_enum s)
(fun k -> LowParse.Low.Sum.jump_dsum_cases_t s f g (LowParse.Spec.Enum.Known k)) ->
x: LowParse.Spec.Sum.dsum_key s
-> LowParse.Low.Sum.jump_dsum_cases_t s f g x | Prims.Tot | [
"total"
] | [] | [
"LowParse.Spec.Sum.dsum",
"LowParse.Spec.Sum.dsum_known_key",
"Prims.dtuple2",
"LowParse.Spec.Base.parser_kind",
"LowParse.Spec.Base.parser",
"LowParse.Spec.Sum.dsum_type_of_known_tag",
"LowParse.Low.Base.jumper",
"Prims.__proj__Mkdtuple2__item___1",
"FStar.Pervasives.dsnd",
"LowParse.Spec.Sum.dsum_type_of_unknown_tag",
"LowParse.Spec.Enum.dep_enum_destr",
"LowParse.Spec.Sum.dsum_key_type",
"LowParse.Spec.Sum.dsum_repr_type",
"LowParse.Spec.Sum.dsum_enum",
"LowParse.Spec.Enum.enum_key",
"LowParse.Low.Sum.jump_dsum_cases_t",
"LowParse.Spec.Enum.Known",
"LowParse.Spec.Sum.dsum_key",
"LowParse.Slice.srel",
"LowParse.Bytes.byte",
"LowParse.Slice.slice",
"FStar.UInt32.t",
"LowParse.Low.Sum.jump_dsum_cases_eq",
"LowParse.Low.Sum.jump_dsum_cases_if",
"LowParse.Spec.Enum.if_combinator",
"Prims.unit",
"LowParse.Low.Sum.jump_dsum_cases'",
"LowParse.Spec.Enum.unknown_enum_repr",
"LowParse.Spec.Enum.Unknown"
] | [] | false | false | false | false | false | let jump_dsum_cases'_destr
(s: dsum)
(f: (x: dsum_known_key s -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x))))
(f': (x: dsum_known_key s -> Tot (jumper (dsnd (f x)))))
(#k: parser_kind)
(#g: parser k (dsum_type_of_unknown_tag s))
(g': jumper g)
(destr: dep_enum_destr _ (fun k -> jump_dsum_cases_t s f g (Known k)))
(x: dsum_key s)
: Tot (jump_dsum_cases_t s f g x) =
| fun #rrel #rel input pos ->
match x with
| Known k ->
destr _
(fun k -> jump_dsum_cases_if s f g (Known k))
(fun _ _ -> ())
(fun _ _ _ _ -> ())
(fun k -> jump_dsum_cases' s f f' g' (Known k))
k
input
pos
| Unknown r -> jump_dsum_cases' s f f' g' (Unknown r) input pos | false |
LowParse.Low.Sum.fst | LowParse.Low.Sum.read_dsum_cases_t_if | val read_dsum_cases_t_if
(t: dsum)
(f: (x: dsum_known_key t -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x))))
(#k': parser_kind)
(g: parser k' (dsum_type_of_unknown_tag t))
(k: dsum_known_key t)
: Tot (if_combinator _ (read_dsum_cases_t_eq t f g k)) | val read_dsum_cases_t_if
(t: dsum)
(f: (x: dsum_known_key t -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x))))
(#k': parser_kind)
(g: parser k' (dsum_type_of_unknown_tag t))
(k: dsum_known_key t)
: Tot (if_combinator _ (read_dsum_cases_t_eq t f g k)) | let read_dsum_cases_t_if
(t: dsum)
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(#k': parser_kind)
(g: parser k' (dsum_type_of_unknown_tag t))
(k: dsum_known_key t)
: Tot (if_combinator _ (read_dsum_cases_t_eq t f g k))
= fun cond (sv_true: cond_true cond -> Tot (read_dsum_cases_t t f g k)) (sv_false: cond_false cond -> Tot (read_dsum_cases_t t f g k)) #_ #_ input pos ->
if cond
then sv_true () input pos
else sv_false () input pos | {
"file_name": "src/lowparse/LowParse.Low.Sum.fst",
"git_rev": "00217c4a89f5ba56002ba9aa5b4a9d5903bfe9fa",
"git_url": "https://github.com/project-everest/everparse.git",
"project_name": "everparse"
} | {
"end_col": 28,
"end_line": 1574,
"start_col": 0,
"start_line": 1564
} | module LowParse.Low.Sum
include LowParse.Low.Enum
include LowParse.Spec.Sum
module U32 = FStar.UInt32
module HST = FStar.HyperStack.ST
module B = LowStar.Buffer
module Cast = FStar.Int.Cast
module U64 = FStar.UInt64
inline_for_extraction
let validate_sum_cases_aux
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(vc: ((x: sum_key t) -> Tot (validator (dsnd (pc x)))))
(k: sum_key t)
: Tot (validator (parse_sum_cases t pc k))
= [@inline_let]
let _ = synth_sum_case_injective t k in
validate_synth
(validate_weaken
(weaken_parse_cases_kind t pc)
(vc k)
()
)
(synth_sum_case t k)
()
inline_for_extraction
let validate_sum_cases_t
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot Type
= validator (parse_sum_cases t pc k)
let validate_sum_cases_t_eq
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
(x y : validate_sum_cases_t t pc k)
: GTot Type0
= True
inline_for_extraction
let validate_sum_cases_t_if
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (if_combinator _ (validate_sum_cases_t_eq t pc k))
= fun cond (sv_true: cond_true cond -> Tot (validate_sum_cases_t t pc k)) (sv_false: cond_false cond -> Tot (validate_sum_cases_t t pc k)) #rrel #rel input pos ->
if cond
then sv_true () input pos
else sv_false () input pos
inline_for_extraction
let validate_sum_cases
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(vc: ((x: sum_key t) -> Tot (validator (dsnd (pc x)))))
(destr: dep_enum_destr (sum_enum t) (validate_sum_cases_t t pc))
(k: sum_key t)
: Tot (validator (parse_sum_cases t pc k))
= destr
_
(validate_sum_cases_t_if t pc)
(fun _ _ -> ())
(fun _ _ _ _ -> ())
(validate_sum_cases_aux t pc vc)
k
inline_for_extraction
let validate_sum_aux_payload_t
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
: Tot Type
= (#rrel: _) -> (#rel: _) ->
(input: slice rrel rel) ->
(pos: U64.t) ->
HST.Stack U64.t
(requires (fun h -> live_slice h input /\ U64.v pos <= U32.v input.len))
(ensures (fun h res h' ->
B.modifies B.loc_none h h' /\ (
match k with
| Unknown _ -> is_error res
| Known k' ->
if is_success res
then
valid_pos (dsnd (pc k')) h input (uint64_to_uint32 pos) (uint64_to_uint32 res)
else
(~ (valid (dsnd (pc k')) h input (uint64_to_uint32 pos)))
)))
let validate_sum_aux_payload_eq
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
: Tot (validate_sum_aux_payload_t t pc k -> validate_sum_aux_payload_t t pc k -> GTot Type0)
= fun _ _ -> True
inline_for_extraction
let validate_sum_aux_payload_if'
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
(cond: bool)
(ift: ((cond_true cond) -> Tot (validate_sum_aux_payload_t t pc k)))
(iff: ((cond_false cond) -> Tot (validate_sum_aux_payload_t t pc k)))
: Tot (validate_sum_aux_payload_t t pc k)
= fun #rrel #rel input pos ->
if cond
then begin
(ift () <: validate_sum_aux_payload_t t pc k) input pos
end else
(iff () <: validate_sum_aux_payload_t t pc k) input pos
inline_for_extraction
let validate_sum_aux_payload_if
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
: Tot (if_combinator _ (validate_sum_aux_payload_eq t pc k))
= validate_sum_aux_payload_if' t pc k
#push-options "--z3rlimit 64 --z3cliopt smt.arith.nl=false --using_facts_from '* -FStar.Int.Cast -LowParse.BitFields'"
// --query_stats --smtencoding.elim_box true --smtencoding.l_arith_repr native --z3refresh"
inline_for_extraction
let validate_sum_aux
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(v: validator p)
(p32: leaf_reader p)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(v_payload: ((k: sum_repr_type t)) -> Tot (validate_sum_aux_payload_t t pc (maybe_enum_key_of_repr (sum_enum t) k)))
: Tot (validator (parse_sum t p pc))
= fun #rrel #rel input pos ->
let h = HST.get () in
[@inline_let]
let _ = parse_sum_eq'' t p pc (bytes_of_slice_from h input (uint64_to_uint32 pos)) in
[@inline_let]
let _ = valid_facts (parse_sum t p pc) h input (uint64_to_uint32 pos) in
[@inline_let]
let _ = valid_facts p h input (uint64_to_uint32 pos) in
let len_after_tag = v input pos in
if is_error len_after_tag
then len_after_tag
else begin
let h1 = HST.get () in
let k' = p32 input (uint64_to_uint32 pos) in
[@inline_let]
let _ =
match maybe_enum_key_of_repr (sum_enum t) k' with
| Known k -> valid_facts (dsnd (pc k)) h input (uint64_to_uint32 len_after_tag)
| _ -> ()
in
v_payload k' input len_after_tag
end
#pop-options
inline_for_extraction
let validate_sum_aux_payload'
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (validator (dsnd (pc x)))))
(k: maybe_enum_key (sum_enum t))
: Tot (validate_sum_aux_payload_t t pc k)
= fun #rrel #rel input pos ->
match k with
| Known k ->
[@inline_let]
let _ = synth_sum_case_injective t k in
pc32 k input pos
// validate_synth (pc32 k) (synth_sum_case t k) () input pos
| _ -> validator_error_generic
inline_for_extraction
let validate_sum_aux_payload
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (validator (dsnd (pc x)))))
(destr: dep_maybe_enum_destr_t (sum_enum t) (validate_sum_aux_payload_t t pc))
(k: sum_repr_type t)
: Tot (validate_sum_aux_payload_t t pc (maybe_enum_key_of_repr (sum_enum t) k))
= destr (validate_sum_aux_payload_eq t pc) (validate_sum_aux_payload_if t pc) (fun _ _ -> ()) (fun _ _ _ _ -> ()) (validate_sum_aux_payload' t pc pc32) k
inline_for_extraction
let validate_sum
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(v: validator p)
(p32: leaf_reader p)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (validator (dsnd (pc x)))))
(destr: dep_maybe_enum_destr_t (sum_enum t) (validate_sum_aux_payload_t t pc))
: Tot (validator (parse_sum t p pc))
= validate_sum_aux t v p32 pc (validate_sum_aux_payload t pc pc32 destr)
module HS = FStar.HyperStack
#push-options "--z3rlimit 256 --z3cliopt smt.arith.nl=false --initial_ifuel 8 --max_ifuel 8 --initial_fuel 2 --max_fuel 2"
#restart-solver
let valid_sum_intro
(h: HS.mem)
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: Lemma
(requires (
valid (parse_enum_key p (sum_enum t)) h input pos /\ (
let k = contents (parse_enum_key p (sum_enum t)) h input pos in
valid (dsnd (pc k)) h input (get_valid_pos (parse_enum_key p (sum_enum t)) h input pos)
)))
(ensures (
let k = contents (parse_enum_key p (sum_enum t)) h input pos in
let pos_payload = get_valid_pos (parse_enum_key p (sum_enum t)) h input pos in
valid_content_pos
(parse_sum t p pc) h input pos
(synth_sum_case t k (contents (dsnd (pc k)) h input pos_payload))
(get_valid_pos (dsnd (pc k)) h input pos_payload)
))
= valid_facts (parse_enum_key p (sum_enum t)) h input pos;
let k = contents (parse_enum_key p (sum_enum t)) h input pos in
let pos_payload = get_valid_pos (parse_enum_key p (sum_enum t)) h input pos in
valid_facts (dsnd (pc k)) h input pos_payload;
valid_facts (parse_sum t p pc) h input pos;
parse_sum_eq t p pc (bytes_of_slice_from h input pos)
#pop-options
inline_for_extraction
let finalize_sum_case
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(s: serializer p)
(w: leaf_writer_strong s)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(destr: enum_repr_of_key'_t (sum_enum t))
(k: sum_key t)
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: HST.Stack unit
(requires (fun h ->
let len_tag = serialized_length (serialize_enum_key _ s (sum_enum t)) k in
U32.v pos + len_tag < 4294967296 /\ (
let pos_payload = pos `U32.add` U32.uint_to_t len_tag in
valid (dsnd (pc k)) h input pos_payload /\
writable input.base (U32.v pos) (U32.v pos_payload) h
)))
(ensures (fun h _ h' ->
let len_tag = serialized_length (serialize_enum_key _ s (sum_enum t)) k in
let pos_payload = pos `U32.add` U32.uint_to_t len_tag in
B.modifies (loc_slice_from_to input pos pos_payload) h h' /\
valid_content_pos (parse_sum t p pc) h' input pos (synth_sum_case t k (contents (dsnd (pc k)) h input pos_payload)) (get_valid_pos (dsnd (pc k)) h input pos_payload)
))
= let pos1 = write_enum_key w (sum_enum t) destr k input pos in
let h = HST.get () in
[@inline_let]
let _ = valid_sum_intro h t p pc input pos in
()
inline_for_extraction
let jump_sum_cases_aux
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(vc: ((x: sum_key t) -> Tot (jumper (dsnd (pc x)))))
(k: sum_key t)
: Tot (jumper (parse_sum_cases t pc k))
= [@inline_let]
let _ = synth_sum_case_injective t k in
jump_synth
(jump_weaken
(weaken_parse_cases_kind t pc)
(vc k)
()
)
(synth_sum_case t k)
()
inline_for_extraction
let jump_sum_cases_t
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot Type
= jumper (parse_sum_cases t pc k)
let jump_sum_cases_t_eq
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
(x y : jump_sum_cases_t t pc k)
: GTot Type0
= True
inline_for_extraction
let jump_sum_cases_t_if
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (if_combinator _ (jump_sum_cases_t_eq t pc k))
= fun cond (sv_true: cond_true cond -> Tot (jump_sum_cases_t t pc k)) (sv_false: cond_false cond -> Tot (jump_sum_cases_t t pc k)) #rrel #rel input pos ->
if cond
then sv_true () input pos
else sv_false () input pos
inline_for_extraction
let jump_sum_cases
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(vc: ((x: sum_key t) -> Tot (jumper (dsnd (pc x)))))
(destr: dep_enum_destr (sum_enum t) (jump_sum_cases_t t pc))
(k: sum_key t)
: Tot (jumper (parse_sum_cases t pc k))
= destr
_
(jump_sum_cases_t_if t pc)
(fun _ _ -> ())
(fun _ _ _ _ -> ())
(jump_sum_cases_aux t pc vc)
k
inline_for_extraction
let jump_sum_aux_payload_t
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
: Tot Type
= (#rrel: _) -> (#rel: _) ->
(input: slice rrel rel) ->
(pos: U32.t) ->
HST.Stack U32.t
(requires (fun h -> live_slice h input /\ U32.v pos <= U32.v input.len /\ (
match k with
| Unknown _ -> False
| Known k' -> valid (dsnd (pc k')) h input pos
)))
(ensures (fun h res h' ->
B.modifies B.loc_none h h' /\ (
match k with
| Unknown _ -> False
| Known k' ->
valid_pos (dsnd (pc k')) h input pos res
)))
let jump_sum_aux_payload_eq
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
: Tot (jump_sum_aux_payload_t t pc k -> jump_sum_aux_payload_t t pc k -> GTot Type0)
= fun _ _ -> True
inline_for_extraction
let jump_sum_aux_payload_if'
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
(cond: bool)
(ift: ((cond_true cond) -> Tot (jump_sum_aux_payload_t t pc k)))
(iff: ((cond_false cond) -> Tot (jump_sum_aux_payload_t t pc k)))
: Tot (jump_sum_aux_payload_t t pc k)
= fun #rrel #rel input pos ->
if cond
then begin
(ift () <: jump_sum_aux_payload_t t pc k) input pos
end else
(iff () <: jump_sum_aux_payload_t t pc k) input pos
inline_for_extraction
let jump_sum_aux_payload_if
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
: Tot (if_combinator _ (jump_sum_aux_payload_eq t pc k))
= jump_sum_aux_payload_if' t pc k
let parse_sum_eq3
(#kt: parser_kind)
(t: sum)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(input: bytes)
(k' : sum_repr_type t)
(consumed_k: consumed_length input)
: Lemma
(requires (Some? (parse (parse_sum t p pc) input) /\ parse p input == Some (k', consumed_k)))
(ensures (
let input_k = Seq.slice input consumed_k (Seq.length input) in
let k = maybe_enum_key_of_repr (sum_enum t) k' in
begin match k with
| Known k ->
Some? (parse (dsnd (pc k)) input_k)
| _ -> False
end
))
= parse_sum_eq'' t p pc input
let parse_sum_eq4
(#kt: parser_kind)
(t: sum)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(input: bytes)
(k' : sum_repr_type t)
(consumed_k: consumed_length input)
(consumed_payload: nat)
: Lemma
(requires (Some? (parse (parse_sum t p pc) input) /\ parse p input == Some (k', consumed_k) /\ (
let input_k = Seq.slice input consumed_k (Seq.length input) in
let k = maybe_enum_key_of_repr (sum_enum t) k' in
begin match k with
| Known k ->
Some? (parse (dsnd (pc k)) input_k) /\ (
let Some (_, consumed_payload') = parse (dsnd (pc k)) input_k in
consumed_payload' == consumed_payload
)
| _ -> False
end
)))
(ensures (
let Some (_, consumed) = parse (parse_sum t p pc) input in
consumed == consumed_k + consumed_payload
))
= parse_sum_eq'' t p pc input
#push-options "--z3rlimit 16"
let valid_sum_elim
(h: HS.mem)
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(#rrel: _) (#rel: _)
(input: slice rrel rel)
(pos: U32.t)
: Lemma
(requires (
valid (parse_sum t p pc) h input pos
))
(ensures (
valid p h input pos /\ (
let pos_payload = get_valid_pos p h input pos in
let k' = maybe_enum_key_of_repr (sum_enum t) (contents p h input pos) in
match k' with
| Known k ->
k == sum_tag_of_data t (contents (parse_sum t p pc) h input pos) /\
valid (dsnd (pc k)) h input pos_payload /\
valid_pos
(parse_sum t p pc) h input pos
(get_valid_pos (dsnd (pc k)) h input pos_payload)
| _ -> False
)))
= let sinput = bytes_of_slice_from h input pos in
let _ = parse_sum_eq'' t p pc sinput in
[@inline_let]
let _ = valid_facts (parse_sum t p pc) h input pos in
let Some (k', consumed_k) = parse p sinput in
let pos_after_tag = U32.uint_to_t (U32.v pos + consumed_k) in
[@inline_let]
let _ = valid_facts p h input pos in
assert (valid_content_pos p h input pos k' pos_after_tag);
match maybe_enum_key_of_repr (sum_enum t) k' with
| Known k -> valid_facts (dsnd (pc k)) h input pos_after_tag
| _ -> ()
#pop-options
let valid_sum_elim_tag
(h: HS.mem)
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: Lemma
(requires (
valid (parse_sum t p pc) h input pos
))
(ensures (
valid (parse_enum_key p (sum_enum t)) h input pos /\
contents (parse_enum_key p (sum_enum t)) h input pos == sum_tag_of_data t (contents (parse_sum t p pc) h input pos)
))
= let _ = parse_sum_eq' t p pc (bytes_of_slice_from h input pos) in
let _ = valid_facts (parse_sum t p pc) h input pos in
let _ = valid_facts (parse_enum_key p (sum_enum t)) h input pos in
()
inline_for_extraction
let read_sum_tag
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(p32: leaf_reader p)
(destr: dep_maybe_enum_destr_t (sum_enum t) (read_enum_key_t (sum_enum t)))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: HST.Stack (sum_key t)
(requires (fun h ->
valid (parse_sum t p pc) h input pos
))
(ensures (fun h res h' ->
B.modifies B.loc_none h h' /\
res == sum_tag_of_data t (contents (parse_sum t p pc) h input pos)
))
= let h = HST.get () in
[@inline_let] let _ = valid_sum_elim_tag h t p pc input pos in
read_enum_key p32 (sum_enum t) destr input pos
inline_for_extraction
let jump_sum_aux
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(v: jumper p)
(p32: leaf_reader p)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(v_payload: ((k: sum_repr_type t)) -> Tot (jump_sum_aux_payload_t t pc (maybe_enum_key_of_repr (sum_enum t) k)))
: Tot (jumper (parse_sum t p pc))
= fun #rrel #rel input pos ->
let h = HST.get () in
[@inline_let]
let _ = valid_sum_elim h t p pc input pos in
let pos_after_tag = v input pos in
let k' = p32 input pos in
v_payload k' input pos_after_tag
inline_for_extraction
let jump_sum_aux_payload'
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (jumper (dsnd (pc x)))))
(k: maybe_enum_key (sum_enum t))
: Tot (jump_sum_aux_payload_t t pc k)
= fun #rrel #rel input pos ->
match k with
| Known k ->
[@inline_let]
let _ = synth_sum_case_injective t k in
pc32 k input pos
| _ -> 0ul // dummy, but we MUST NOT remove this branch, otherwise extraction fails
inline_for_extraction
let jump_sum_aux_payload
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (jumper (dsnd (pc x)))))
(destr: dep_maybe_enum_destr_t (sum_enum t) (jump_sum_aux_payload_t t pc))
(k: sum_repr_type t)
: Tot (jump_sum_aux_payload_t t pc (maybe_enum_key_of_repr (sum_enum t) k))
= destr (jump_sum_aux_payload_eq t pc) (jump_sum_aux_payload_if t pc) (fun _ _ -> ()) (fun _ _ _ _ -> ()) (jump_sum_aux_payload' t pc pc32) k
inline_for_extraction
let jump_sum
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(v: jumper p)
(p32: leaf_reader p)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (jumper (dsnd (pc x)))))
(destr: dep_maybe_enum_destr_t (sum_enum t) (jump_sum_aux_payload_t t pc))
: Tot (jumper (parse_sum t p pc))
= jump_sum_aux t v p32 pc (jump_sum_aux_payload t pc pc32 destr)
inline_for_extraction
let read_sum_cases'
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (leaf_reader (dsnd (pc x)))))
(k: sum_key t)
: Tot (leaf_reader (parse_sum_cases' t pc k))
= [@inline_let]
let _ = synth_sum_case_injective t k in
read_synth'
(dsnd (pc k))
(synth_sum_case t k)
(pc32 k)
()
inline_for_extraction
let read_sum_cases_t
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot Type
= leaf_reader (parse_sum_cases' t pc k)
let read_sum_cases_t_eq
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
(x y : read_sum_cases_t t pc k)
: GTot Type0
= True
inline_for_extraction
let read_sum_cases_t_if
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (if_combinator _ (read_sum_cases_t_eq t pc k))
= fun cond (sv_true: cond_true cond -> Tot (read_sum_cases_t t pc k)) (sv_false: cond_false cond -> Tot (read_sum_cases_t t pc k)) #_ #_ input pos ->
if cond
then (sv_true () input pos)
else (sv_false () input pos)
inline_for_extraction
let read_sum_cases
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (leaf_reader (dsnd (pc x)))))
(destr: dep_enum_destr (sum_enum t) (read_sum_cases_t t pc))
(k: sum_key t)
: Tot (leaf_reader (parse_sum_cases' t pc k))
= destr
_
(read_sum_cases_t_if t pc)
(fun _ _ -> ())
(fun _ _ _ _ -> ())
(read_sum_cases' t pc pc32)
k
#push-options "--z3rlimit 32"
inline_for_extraction
let read_sum
(#kt: parser_kind)
(t: sum)
(p: parser kt (sum_repr_type t))
(p32: leaf_reader (parse_enum_key p (sum_enum t)))
(j: jumper p)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (leaf_reader (dsnd (pc x)))))
(destr: dep_enum_destr (sum_enum t) (read_sum_cases_t t pc))
: Tot (leaf_reader (parse_sum t p pc))
=
fun #_ #_ input pos ->
let h = HST.get () in
valid_facts (parse_sum t p pc) h input pos;
parse_sum_eq' t p pc (bytes_of_slice_from h input pos);
valid_facts (parse_enum_key p (sum_enum t)) h input pos;
let k = p32 input pos in
let pos' = jump_enum_key j (sum_enum t) input pos in
valid_facts (parse_sum_cases' t pc k) h input pos' ;
read_sum_cases t pc pc32 destr k input pos'
#pop-options
inline_for_extraction
let serialize32_sum_cases_t
(t: sum)
(#pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(sc: ((x: sum_key t) -> Tot (serializer (dsnd (pc x)))))
(k: sum_key t)
: Tot Type
= serializer32 (serialize_sum_cases t pc sc k)
let serialize32_sum_cases_t_eq
(t: sum)
(#pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(sc: ((x: sum_key t) -> Tot (serializer (dsnd (pc x)))))
(k: sum_key t)
(x y: serialize32_sum_cases_t t sc k)
: GTot Type0
= True
inline_for_extraction
let serialize32_sum_cases_t_if
(t: sum)
(#pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(sc: ((x: sum_key t) -> Tot (serializer (dsnd (pc x)))))
(k: sum_key t)
: Tot (if_combinator _ (serialize32_sum_cases_t_eq t sc k))
= fun cond (sv_true: (cond_true cond -> Tot (serialize32_sum_cases_t t sc k))) (sv_false: (cond_false cond -> Tot (serialize32_sum_cases_t t sc k))) x #rrel #rel b pos ->
if cond
then (sv_true () x b pos)
else (sv_false () x b pos)
inline_for_extraction
let serialize32_sum_cases_aux
(t: sum)
(#pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(sc: ((x: sum_key t) -> Tot (serializer (dsnd (pc x)))))
(sc32: ((x: sum_key t) -> Tot (serializer32 (sc x))))
(k: sum_key t)
: Tot (serializer32 (serialize_sum_cases t pc sc k))
= fun x #rrel #rel b pos ->
[@inline_let] let _ =
Classical.forall_intro (parse_sum_cases_eq' t pc k);
synth_sum_case_injective t k;
synth_sum_case_inverse t k
in
serialize32_synth
(sc32 k)
(synth_sum_case t k)
(synth_sum_case_recip t k)
(fun x -> synth_sum_case_recip t k x)
()
x
b
pos
inline_for_extraction
let serialize32_sum_cases
(t: sum)
(#pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(sc: ((x: sum_key t) -> Tot (serializer (dsnd (pc x)))))
(sc32: ((x: sum_key t) -> Tot (serializer32 (sc x))))
(destr: dep_enum_destr (sum_enum t) (serialize32_sum_cases_t t sc))
(k: sum_key t)
: Tot (serializer32 (serialize_sum_cases t pc sc k))
= destr
_
(serialize32_sum_cases_t_if t sc)
(fun _ _ -> ())
(fun _ _ _ _ -> ())
(serialize32_sum_cases_aux t sc sc32)
k
inline_for_extraction
let serialize32_sum
(#kt: parser_kind)
(t: sum)
(#p: parser kt (sum_repr_type t))
(s: serializer p {kt.parser_kind_subkind == Some ParserStrong})
(s32: serializer32 (serialize_enum_key _ s (sum_enum t)))
(#pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(sc: ((x: sum_key t) -> Tot (serializer (dsnd (pc x)))))
(sc32: ((x: sum_key t) -> Tot (serializer32 (sc x))))
(destr: dep_enum_destr (sum_enum t) (serialize32_sum_cases_t t sc))
: Tot (serializer32 (serialize_sum t s sc))
= fun x #rrel #rel b pos ->
serialize_sum_eq t s sc x;
let tg = sum_tag_of_data t x in
serialize32_nondep_then_aux s32 (serialize32_sum_cases t sc sc32 destr tg) tg x b pos
let clens_sum_tag
(s: sum)
: Tot (clens (sum_type s) (sum_key s))
= {
clens_cond = (fun _ -> True);
clens_get = sum_tag_of_data s;
}
let gaccessor_sum_tag
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
: Tot (gaccessor (parse_sum t p pc) (parse_enum_key p (sum_enum t)) (clens_sum_tag t))
= gaccessor_tagged_union_tag
(parse_enum_key p (sum_enum t))
(sum_tag_of_data t)
(parse_sum_cases t pc)
inline_for_extraction
let accessor_sum_tag
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
: Tot (accessor (gaccessor_sum_tag t p pc))
= accessor_tagged_union_tag
(parse_enum_key p (sum_enum t))
(sum_tag_of_data t)
(parse_sum_cases t pc)
let clens_sum_payload
(s: sum)
(k: sum_key s)
: Tot (clens (sum_type s) (sum_type_of_tag s k))
= {
clens_cond = (fun (x: sum_type s) -> sum_tag_of_data s x == k);
clens_get = (fun (x: sum_type s) -> synth_sum_case_recip s k x <: Ghost (sum_type_of_tag s k) (requires (sum_tag_of_data s x == k)) (ensures (fun _ -> True)));
}
#push-options "--z3rlimit 32"
let gaccessor_clens_sum_payload'
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (gaccessor' (parse_sum t p pc) (dsnd (pc k)) (clens_sum_payload t k))
= fun (input: bytes) ->
parse_sum_eq'' t p pc input;
let res =
match parse p input with
| Some (_, consumed) ->
synth_sum_case_inverse t k;
synth_sum_case_injective t k;
synth_injective_synth_inverse_synth_inverse_recip (synth_sum_case t k) (synth_sum_case_recip t k) ();
(consumed)
| _ -> 0 // dummy
in
(res <: (res: _ { gaccessor_post' (parse_sum t p pc) (dsnd (pc k)) (clens_sum_payload t k) input res } ))
#push-options "--z3rlimit 64"
let gaccessor_clens_sum_payload_injective
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
(sl sl' : bytes)
: Lemma
(requires (
gaccessor_pre (parse_sum t p pc) (dsnd (pc k)) (clens_sum_payload t k) sl /\
gaccessor_pre (parse_sum t p pc) (dsnd (pc k)) (clens_sum_payload t k) sl' /\
injective_precond (parse_sum t p pc) sl sl'
))
(ensures (gaccessor_clens_sum_payload' t p pc k sl == gaccessor_clens_sum_payload' t p pc k sl'))
= parse_sum_eq'' t p pc sl;
parse_sum_eq'' t p pc sl' ;
parse_injective (parse_sum t p pc) sl sl' ;
parse_injective p sl sl'
#pop-options
let gaccessor_clens_sum_payload_no_lookahead
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
(sl sl' : bytes)
: Lemma
(requires (
(parse_sum_kind kt t pc).parser_kind_subkind == Some ParserStrong /\
gaccessor_pre (parse_sum t p pc) (dsnd (pc k)) (clens_sum_payload t k) sl /\
gaccessor_pre (parse_sum t p pc) (dsnd (pc k)) (clens_sum_payload t k) sl' /\
no_lookahead_on_precond (parse_sum t p pc) sl sl'
))
(ensures (gaccessor_clens_sum_payload' t p pc k sl == gaccessor_clens_sum_payload' t p pc k sl'))
= parse_sum_eq'' t p pc sl;
parse_sum_eq'' t p pc sl' ;
parse_strong_prefix (parse_sum t p pc) sl sl' ;
parse_injective p sl sl'
let gaccessor_clens_sum_payload
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (gaccessor (parse_sum t p pc) (dsnd (pc k)) (clens_sum_payload t k))
= Classical.forall_intro_2 (fun x -> Classical.move_requires (gaccessor_clens_sum_payload_injective t p pc k x));
Classical.forall_intro_2 (fun x -> Classical.move_requires (gaccessor_clens_sum_payload_no_lookahead t p pc k x));
gaccessor_prop_equiv (parse_sum t p pc) (dsnd (pc k)) (clens_sum_payload t k) (gaccessor_clens_sum_payload' t p pc k);
gaccessor_clens_sum_payload' t p pc k
inline_for_extraction
let accessor_clens_sum_payload'
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(j: jumper p)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: HST.Stack U32.t
(requires (fun h ->
valid (parse_sum t p pc) h input pos /\
(clens_sum_payload t k).clens_cond (contents (parse_sum t p pc) h input pos)
))
(ensures (fun h pos' h' ->
B.modifies B.loc_none h h' /\
pos' == slice_access h (gaccessor_clens_sum_payload t p pc k) input pos
))
=
let h = HST.get () in
[@inline_let]
let _ =
let pos' = get_valid_pos (parse_sum t p pc) h input pos in
let large = bytes_of_slice_from h input pos in
slice_access_eq h (gaccessor_clens_sum_payload t p pc k) input pos;
valid_facts (parse_sum t p pc) h input pos;
parse_sum_eq'' t p pc large;
valid_facts p h input pos
in
j input pos
#pop-options
inline_for_extraction
let accessor_clens_sum_payload
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(j: jumper p)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (accessor (gaccessor_clens_sum_payload t p pc k))
= fun #rrel #rel -> accessor_clens_sum_payload' t j pc k #rrel #rel
let clens_sum_cases_payload
(s: sum)
(k: sum_key s)
: Tot (clens (sum_cases s k) (sum_type_of_tag s k))
= {
clens_cond = (fun (x: sum_cases s k) -> True);
clens_get = (fun (x: sum_cases s k) -> synth_sum_case_recip s k x <: Ghost (sum_type_of_tag s k) (requires (True)) (ensures (fun _ -> True)));
}
let gaccessor_clens_sum_cases_payload
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (gaccessor (parse_sum_cases' t pc k) (dsnd (pc k)) (clens_sum_cases_payload t k))
= synth_sum_case_injective t k;
synth_sum_case_inverse t k;
synth_injective_synth_inverse_synth_inverse_recip (synth_sum_case t k) (synth_sum_case_recip t k) ();
gaccessor_ext
(gaccessor_synth (dsnd (pc k)) (synth_sum_case t k) (synth_sum_case_recip t k) ())
(clens_sum_cases_payload t k)
()
inline_for_extraction
let accessor_clens_sum_cases_payload
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (accessor (gaccessor_clens_sum_cases_payload t pc k))
= [@inline_let]
let _ =
synth_sum_case_injective t k;
synth_sum_case_inverse t k;
synth_injective_synth_inverse_synth_inverse_recip (synth_sum_case t k) (synth_sum_case_recip t k) ()
in
accessor_ext
(accessor_synth (dsnd (pc k)) (synth_sum_case t k) (synth_sum_case_recip t k) ())
(clens_sum_cases_payload t k)
()
inline_for_extraction
let validate_dsum_cases_t
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(#k: parser_kind)
(g: parser k (dsum_type_of_unknown_tag s))
(x: dsum_key s)
: Tot Type
= validator (parse_dsum_cases' s f g x)
let validate_dsum_cases_eq
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(#k: parser_kind)
(g: parser k (dsum_type_of_unknown_tag s))
(x: dsum_key s)
(v1 v2 : validate_dsum_cases_t s f g x)
: GTot Type0
= True
inline_for_extraction
let validate_dsum_cases_if'
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(#k: parser_kind)
(g: parser k (dsum_type_of_unknown_tag s))
(x: dsum_key s)
(cond: bool)
(ift: (cond_true cond -> Tot (validate_dsum_cases_t s f g x)))
(iff: (cond_false cond -> Tot (validate_dsum_cases_t s f g x)))
: Tot (validate_dsum_cases_t s f g x)
= fun #rrel #rel input len ->
if cond
then (ift () <: validate_dsum_cases_t s f g x) input len
else (iff () <: validate_dsum_cases_t s f g x) input len
inline_for_extraction
let validate_dsum_cases_if
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(#k: parser_kind)
(g: parser k (dsum_type_of_unknown_tag s))
(x: dsum_key s)
: Tot (if_combinator _ (validate_dsum_cases_eq s f g x))
= validate_dsum_cases_if' s f g x
inline_for_extraction
let validate_dsum_cases'
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(f' : (x: dsum_known_key s) -> Tot (validator (dsnd (f x))))
(#k: parser_kind)
(#g: parser k (dsum_type_of_unknown_tag s))
(g' : validator g)
(x: dsum_key s)
: Tot (validate_dsum_cases_t s f g x)
= [@inline_let]
let _ = synth_dsum_case_injective s x in
match x with
| Known x' -> validate_synth (f' x') (synth_dsum_case s (Known x')) () <: validator (parse_dsum_cases' s f g x)
| Unknown x' -> validate_synth g' (synth_dsum_case s (Unknown x')) () <: validator (parse_dsum_cases' s f g x)
inline_for_extraction
let validate_dsum_cases'_destr
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(f' : (x: dsum_known_key s) -> Tot (validator (dsnd (f x))))
(#k: parser_kind)
(#g: parser k (dsum_type_of_unknown_tag s))
(g' : validator g)
(destr: dep_enum_destr _ (fun k -> validate_dsum_cases_t s f g (Known k)))
(x: dsum_key s)
: Tot (validate_dsum_cases_t s f g x)
= fun #rrel #rel input pos ->
match x with
| Known k ->
destr
_
(fun k -> validate_dsum_cases_if s f g (Known k))
(fun _ _ -> ())
(fun _ _ _ _ -> ())
(fun k -> validate_dsum_cases' s f f' g' (Known k))
k
input
pos
| Unknown r -> validate_dsum_cases' s f f' g' (Unknown r) input pos
inline_for_extraction
let validate_dsum_cases
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(f' : (x: dsum_known_key s) -> Tot (validator (dsnd (f x))))
(#k: parser_kind)
(#g: parser k (dsum_type_of_unknown_tag s))
(g' : validator g)
(destr: dep_enum_destr _ (fun k -> validate_dsum_cases_t s f g (Known k)))
(x: dsum_key s)
: Tot (validator (parse_dsum_cases s f g x))
= fun #rrel #rel input pos ->
let h = HST.get () in
[@inline_let]
let _ =
valid_facts (parse_dsum_cases' s f g x) h input (uint64_to_uint32 pos);
valid_facts (parse_dsum_cases s f g x) h input (uint64_to_uint32 pos);
parse_dsum_cases_eq' s f g x (bytes_of_slice_from h input (uint64_to_uint32 pos))
in
validate_dsum_cases'_destr s f f' g' destr x input pos
#push-options "--z3rlimit 40"
inline_for_extraction
let validate_dsum
(#kt: parser_kind)
(t: dsum)
(#p: parser kt (dsum_repr_type t))
(v: validator p)
(p32: leaf_reader p)
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(f32: (x: dsum_known_key t) -> Tot (validator (dsnd (f x))))
(#k': parser_kind)
(#g: parser k' (dsum_type_of_unknown_tag t))
(g32: validator g)
(destr: dep_maybe_enum_destr_t (dsum_enum t) (validate_dsum_cases_t t f g))
: Tot (validator (parse_dsum t p f g))
= fun #rrel #rel input pos ->
let h = HST.get () in
[@inline_let]
let _ = parse_dsum_eq' t p f g (bytes_of_slice_from h input (uint64_to_uint32 pos)) in
[@inline_let]
let _ = valid_facts (parse_dsum t p f g) h input (uint64_to_uint32 pos) in
[@inline_let]
let _ = valid_facts p h input (uint64_to_uint32 pos) in
let pos_after_tag = v input pos in
if is_error pos_after_tag
then pos_after_tag
else
let tg = p32 input (uint64_to_uint32 pos) in
[@inline_let]
let _ = valid_facts (parse_dsum_cases' t f g (maybe_enum_key_of_repr (dsum_enum t) tg)) h input (uint64_to_uint32 pos_after_tag) in
destr (validate_dsum_cases_eq t f g) (validate_dsum_cases_if t f g) (fun _ _ -> ()) (fun _ _ _ _ -> ()) (validate_dsum_cases' t f f32 g32) tg input pos_after_tag
#pop-options
#reset-options "--z3rlimit 64 --z3cliopt smt.arith.nl=false --initial_ifuel 8 --max_ifuel 8 --initial_fuel 2 --max_fuel 2"
let valid_dsum_intro_known
(h: HS.mem)
(t: dsum)
(#kt: parser_kind)
(p: parser kt (dsum_repr_type t))
(f: ((x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x))))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: Lemma
(requires (
valid (parse_maybe_enum_key p (dsum_enum t)) h input pos /\ (
let k' = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
Known? k' /\ (
let Known k = k' in
valid (dsnd (f k)) h input (get_valid_pos (parse_maybe_enum_key p (dsum_enum t)) h input pos)
))))
(ensures (
let Known k = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
let pos_payload = get_valid_pos (parse_maybe_enum_key p (dsum_enum t)) h input pos in
valid_content_pos
(parse_dsum t p f g) h input pos
(synth_dsum_case t (Known k) (contents (dsnd (f k)) h input pos_payload))
(get_valid_pos (dsnd (f k)) h input pos_payload)
))
= valid_facts (parse_maybe_enum_key p (dsum_enum t)) h input pos;
let Known k = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
let pos_payload = get_valid_pos (parse_maybe_enum_key p (dsum_enum t)) h input pos in
valid_facts (dsnd (f k)) h input pos_payload;
valid_facts (parse_dsum t p f g) h input pos;
parse_dsum_eq t p f g (bytes_of_slice_from h input pos)
let valid_dsum_intro_unknown
(h: HS.mem)
(t: dsum)
(#kt: parser_kind)
(p: parser kt (dsum_repr_type t))
(f: ((x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x))))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: Lemma
(requires (
valid (parse_maybe_enum_key p (dsum_enum t)) h input pos /\ (
let k' = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
Unknown? k' /\
valid g h input (get_valid_pos (parse_maybe_enum_key p (dsum_enum t)) h input pos)
)))
(ensures (
let Unknown r = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
let pos_payload = get_valid_pos (parse_maybe_enum_key p (dsum_enum t)) h input pos in
valid_content_pos
(parse_dsum t p f g) h input pos
(synth_dsum_case t (Unknown r) (contents g h input pos_payload))
(get_valid_pos g h input pos_payload)
))
= valid_facts (parse_maybe_enum_key p (dsum_enum t)) h input pos;
let Unknown r = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
let pos_payload = get_valid_pos (parse_maybe_enum_key p (dsum_enum t)) h input pos in
valid_facts g h input pos_payload;
valid_facts (parse_dsum t p f g) h input pos;
parse_dsum_eq t p f g (bytes_of_slice_from h input pos)
#reset-options
inline_for_extraction
let finalize_dsum_case_known
(t: dsum)
(#kt: parser_kind)
(#p: parser kt (dsum_repr_type t))
(s: serializer p)
(w: leaf_writer_strong s)
(f: ((x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x))))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
(destr: enum_repr_of_key'_t (dsum_enum t))
(k: dsum_known_key t)
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: HST.Stack unit
(requires (fun h ->
let len_tag = serialized_length (serialize_enum_key _ s (dsum_enum t)) k in
U32.v pos + len_tag < 4294967296 /\ (
let pos_payload = pos `U32.add` U32.uint_to_t len_tag in
valid (dsnd (f k)) h input pos_payload /\
writable input.base (U32.v pos) (U32.v pos_payload) h
)))
(ensures (fun h _ h' ->
let len_tag = serialized_length (serialize_enum_key _ s (dsum_enum t)) k in
let pos_payload = pos `U32.add` U32.uint_to_t len_tag in
B.modifies (loc_slice_from_to input pos pos_payload) h h' /\
valid_content_pos (parse_dsum t p f g) h' input pos (synth_dsum_case t (Known k) (contents (dsnd (f k)) h input pos_payload)) (get_valid_pos (dsnd (f k)) h input pos_payload)
))
= let pos1 = write_enum_key w (dsum_enum t) destr k input pos in
let h = HST.get () in
[@inline_let]
let _ =
valid_facts (parse_enum_key p (dsum_enum t)) h input pos;
valid_facts (parse_maybe_enum_key p (dsum_enum t)) h input pos;
let sq = bytes_of_slice_from h input pos in
parse_enum_key_eq p (dsum_enum t) sq;
parse_maybe_enum_key_eq p (dsum_enum t) sq;
valid_dsum_intro_known h t p f g input pos
in
()
inline_for_extraction
let finalize_dsum_case_unknown
(t: dsum)
(#kt: parser_kind)
(#p: parser kt (dsum_repr_type t))
(s: serializer p)
(w: leaf_writer_strong s)
(f: ((x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x))))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
(r: unknown_enum_repr (dsum_enum t))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: HST.Stack unit
(requires (fun h ->
let len_tag = serialized_length s r in
U32.v pos + len_tag < 4294967296 /\ (
let pos_payload = pos `U32.add` U32.uint_to_t len_tag in
valid g h input pos_payload /\
writable input.base (U32.v pos) (U32.v pos_payload) h
)))
(ensures (fun h _ h' ->
let len_tag = serialized_length s r in
let pos_payload = pos `U32.add` U32.uint_to_t len_tag in
B.modifies (loc_slice_from_to input pos pos_payload) h h' /\
valid_content_pos (parse_dsum t p f g) h' input pos (synth_dsum_case t (Unknown r) (contents g h input pos_payload)) (get_valid_pos g h input pos_payload)
))
= let pos1 = w r input pos in
let h = HST.get () in
[@inline_let]
let _ =
valid_facts (parse_maybe_enum_key p (dsum_enum t)) h input pos;
valid_facts p h input pos;
let sq = bytes_of_slice_from h input pos in
parse_maybe_enum_key_eq p (dsum_enum t) sq;
valid_dsum_intro_unknown h t p f g input pos
in
()
let valid_dsum_elim_tag
(h: HS.mem)
(t: dsum)
(#kt: parser_kind)
(p: parser kt (dsum_repr_type t))
(f: ((x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x))))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: Lemma
(requires (
valid (parse_dsum t p f g) h input pos
))
(ensures (
valid (parse_maybe_enum_key p (dsum_enum t)) h input pos /\
contents (parse_maybe_enum_key p (dsum_enum t)) h input pos == dsum_tag_of_data t (contents (parse_dsum t p f g) h input pos)
))
= let _ = parse_dsum_eq_ t p f g (bytes_of_slice_from h input pos) in
let _ = valid_facts (parse_dsum t p f g) h input pos in
let _ = valid_facts (parse_maybe_enum_key p (dsum_enum t)) h input pos in
()
inline_for_extraction
let read_dsum_tag
(t: dsum)
(#kt: parser_kind)
(#p: parser kt (dsum_repr_type t))
(p32: leaf_reader p)
(destr: maybe_enum_destr_t (maybe_enum_key (dsum_enum t)) (dsum_enum t))
(f: ((x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x))))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: HST.Stack (dsum_key t)
(requires (fun h ->
valid (parse_dsum t p f g) h input pos
))
(ensures (fun h res h' ->
B.modifies B.loc_none h h' /\
res == dsum_tag_of_data t (contents (parse_dsum t p f g) h input pos)
))
= let h = HST.get () in
[@inline_let] let _ = valid_dsum_elim_tag h t p f g input pos in
read_maybe_enum_key p32 (dsum_enum t) destr input pos
#push-options "--z3rlimit 32"
let valid_dsum_elim_known
(h: HS.mem)
(t: dsum)
(#kt: parser_kind)
(p: parser kt (dsum_repr_type t))
(f: ((x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x))))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: Lemma
(requires (
valid (parse_dsum t p f g) h input pos /\
Known? (dsum_tag_of_data t (contents (parse_dsum t p f g) h input pos))
))
(ensures (
valid (parse_maybe_enum_key p (dsum_enum t)) h input pos /\ (
let k' = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
let pos_payload = get_valid_pos (parse_maybe_enum_key p (dsum_enum t)) h input pos in
Known? k' /\ (
let Known k = k' in
valid (dsnd (f k)) h input pos_payload /\
valid_content_pos
(parse_dsum t p f g) h input pos
(synth_dsum_case t (Known k) (contents (dsnd (f k)) h input pos_payload))
(get_valid_pos (dsnd (f k)) h input pos_payload)
))))
=
valid_facts (parse_dsum t p f g) h input pos;
parse_dsum_eq t p f g (bytes_of_slice_from h input pos);
valid_facts (parse_maybe_enum_key p (dsum_enum t)) h input pos;
let Known k = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
let pos_payload = get_valid_pos (parse_maybe_enum_key p (dsum_enum t)) h input pos in
valid_facts (dsnd (f k)) h input pos_payload
#pop-options
let valid_dsum_elim_unknown
(h: HS.mem)
(t: dsum)
(#kt: parser_kind)
(p: parser kt (dsum_repr_type t))
(f: ((x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x))))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: Lemma
(requires (
valid (parse_dsum t p f g) h input pos /\
Unknown? (dsum_tag_of_data t (contents (parse_dsum t p f g) h input pos))
))
(ensures (
valid (parse_maybe_enum_key p (dsum_enum t)) h input pos /\ (
let k' = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
let pos_payload = get_valid_pos (parse_maybe_enum_key p (dsum_enum t)) h input pos in
Unknown? k' /\ (
let Unknown r = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
valid g h input pos_payload /\
valid_content_pos
(parse_dsum t p f g) h input pos
(synth_dsum_case t (Unknown r) (contents g h input pos_payload))
(get_valid_pos g h input pos_payload)
))))
=
valid_facts (parse_dsum t p f g) h input pos;
parse_dsum_eq t p f g (bytes_of_slice_from h input pos);
valid_facts (parse_maybe_enum_key p (dsum_enum t)) h input pos;
let Unknown r = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
let pos_payload = get_valid_pos (parse_maybe_enum_key p (dsum_enum t)) h input pos in
valid_facts g h input pos_payload
inline_for_extraction
let jump_dsum_cases_t
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(#k: parser_kind)
(g: parser k (dsum_type_of_unknown_tag s))
(x: dsum_key s)
: Tot Type
= jumper (parse_dsum_cases' s f g x)
let jump_dsum_cases_eq
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(#k: parser_kind)
(g: parser k (dsum_type_of_unknown_tag s))
(x: dsum_key s)
(v1 v2 : jump_dsum_cases_t s f g x)
: GTot Type0
= True
inline_for_extraction
let jump_dsum_cases_if'
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(#k: parser_kind)
(g: parser k (dsum_type_of_unknown_tag s))
(x: dsum_key s)
(cond: bool)
(ift: (cond_true cond -> Tot (jump_dsum_cases_t s f g x)))
(iff: (cond_false cond -> Tot (jump_dsum_cases_t s f g x)))
: Tot (jump_dsum_cases_t s f g x)
= fun #rrel #rel input len ->
if cond
then (ift () <: jump_dsum_cases_t s f g x) input len
else (iff () <: jump_dsum_cases_t s f g x) input len
inline_for_extraction
let jump_dsum_cases_if
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(#k: parser_kind)
(g: parser k (dsum_type_of_unknown_tag s))
(x: dsum_key s)
: Tot (if_combinator _ (jump_dsum_cases_eq s f g x))
= jump_dsum_cases_if' s f g x
inline_for_extraction
let jump_dsum_cases'
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(f' : (x: dsum_known_key s) -> Tot (jumper (dsnd (f x))))
(#k: parser_kind)
(#g: parser k (dsum_type_of_unknown_tag s))
(g' : jumper g)
(x: dsum_key s)
: Tot (jump_dsum_cases_t s f g x)
= synth_dsum_case_injective s x;
match x with
| Known x' -> jump_synth (f' x') (synth_dsum_case s (Known x')) () <: jumper (parse_dsum_cases' s f g x)
| Unknown x' -> jump_synth g' (synth_dsum_case s (Unknown x')) () <: jumper (parse_dsum_cases' s f g x)
inline_for_extraction
let jump_dsum_cases'_destr
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(f' : (x: dsum_known_key s) -> Tot (jumper (dsnd (f x))))
(#k: parser_kind)
(#g: parser k (dsum_type_of_unknown_tag s))
(g' : jumper g)
(destr: dep_enum_destr _ (fun k -> jump_dsum_cases_t s f g (Known k)))
(x: dsum_key s)
: Tot (jump_dsum_cases_t s f g x)
= fun #rrel #rel input pos ->
match x with
| Known k ->
destr
_
(fun k -> jump_dsum_cases_if s f g (Known k))
(fun _ _ -> ())
(fun _ _ _ _ -> ())
(fun k -> jump_dsum_cases' s f f' g' (Known k))
k
input
pos
| Unknown r -> jump_dsum_cases' s f f' g' (Unknown r) input pos
inline_for_extraction
let jump_dsum_cases
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(f' : (x: dsum_known_key s) -> Tot (jumper (dsnd (f x))))
(#k: parser_kind)
(#g: parser k (dsum_type_of_unknown_tag s))
(g' : jumper g)
(destr: dep_enum_destr _ (fun k -> jump_dsum_cases_t s f g (Known k)))
(x: dsum_key s)
: Tot (jumper (parse_dsum_cases s f g x))
= fun #rrel #rel input pos ->
let h = HST.get () in
[@inline_let]
let _ =
valid_facts (parse_dsum_cases' s f g x) h input pos;
valid_facts (parse_dsum_cases s f g x) h input pos;
parse_dsum_cases_eq' s f g x (bytes_of_slice_from h input pos)
in
jump_dsum_cases'_destr s f f' g' destr x input pos
#push-options "--z3rlimit 16"
inline_for_extraction
let jump_dsum
(#kt: parser_kind)
(t: dsum)
(#p: parser kt (dsum_repr_type t))
(v: jumper p)
(p32: leaf_reader p)
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(f32: (x: dsum_known_key t) -> Tot (jumper (dsnd (f x))))
(#k': parser_kind)
(#g: parser k' (dsum_type_of_unknown_tag t))
(g32: jumper g)
(destr: dep_maybe_enum_destr_t (dsum_enum t) (jump_dsum_cases_t t f g))
: Tot (jumper (parse_dsum t p f g))
= fun #rrel #rel input pos ->
let h = HST.get () in
[@inline_let]
let _ = parse_dsum_eq' t p f g (bytes_of_slice_from h input pos) in
[@inline_let]
let _ = valid_facts (parse_dsum t p f g) h input pos in
[@inline_let]
let _ = valid_facts p h input pos in
let pos_after_tag = v input pos in
let tg = p32 input pos in
[@inline_let]
let _ = valid_facts (parse_dsum_cases' t f g (maybe_enum_key_of_repr (dsum_enum t) tg)) h input pos_after_tag in
destr (jump_dsum_cases_eq t f g) (jump_dsum_cases_if t f g) (fun _ _ -> ()) (fun _ _ _ _ -> ()) (jump_dsum_cases' t f f32 g32) tg input pos_after_tag
#pop-options
inline_for_extraction
let read_dsum_cases'
(t: dsum)
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(f32: (x: dsum_known_key t) -> Tot (leaf_reader (dsnd (f x))))
(#k': parser_kind)
(g: parser k' (dsum_type_of_unknown_tag t))
(g32: leaf_reader g)
(x: dsum_key t)
: Tot (leaf_reader (parse_dsum_cases' t f g x))
= fun #rrel #rel input pos ->
[@inline_let]
let _ = synth_dsum_case_injective t x in
match x with
| Known x' ->
read_synth'
(dsnd (f x'))
(synth_dsum_case t (Known x'))
(f32 x')
()
input
pos
| Unknown x' ->
read_synth'
g
(synth_dsum_case t (Unknown x'))
g32
()
input
pos
inline_for_extraction
let read_dsum_cases_t
(t: dsum)
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(#k': parser_kind)
(g: parser k' (dsum_type_of_unknown_tag t))
(k: dsum_known_key t)
: Tot Type
= leaf_reader (parse_dsum_cases' t f g (Known k))
let read_dsum_cases_t_eq
(t: dsum)
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(#k': parser_kind)
(g: parser k' (dsum_type_of_unknown_tag t))
(k: dsum_known_key t)
(x y : read_dsum_cases_t t f g k)
: GTot Type0
= True | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"LowStar.Buffer.fst.checked",
"LowParse.Spec.Sum.fst.checked",
"LowParse.Low.Enum.fst.checked",
"FStar.UInt64.fsti.checked",
"FStar.UInt32.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Int.Cast.fst.checked",
"FStar.HyperStack.ST.fsti.checked",
"FStar.HyperStack.fst.checked",
"FStar.Classical.fsti.checked"
],
"interface_file": false,
"source_file": "LowParse.Low.Sum.fst"
} | [
{
"abbrev": true,
"full_module": "FStar.HyperStack",
"short_module": "HS"
},
{
"abbrev": true,
"full_module": "FStar.UInt64",
"short_module": "U64"
},
{
"abbrev": true,
"full_module": "FStar.Int.Cast",
"short_module": "Cast"
},
{
"abbrev": true,
"full_module": "LowStar.Buffer",
"short_module": "B"
},
{
"abbrev": true,
"full_module": "FStar.HyperStack.ST",
"short_module": "HST"
},
{
"abbrev": true,
"full_module": "FStar.UInt32",
"short_module": "U32"
},
{
"abbrev": false,
"full_module": "LowParse.Spec.Sum",
"short_module": null
},
{
"abbrev": false,
"full_module": "LowParse.Low.Enum",
"short_module": null
},
{
"abbrev": false,
"full_module": "LowParse.Low",
"short_module": null
},
{
"abbrev": false,
"full_module": "LowParse.Low",
"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",
"short_module": null
}
] | {
"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_elim_box": false,
"smtencoding_l_arith_repr": "boxwrap",
"smtencoding_nl_arith_repr": "boxwrap",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": true,
"z3cliopt": [],
"z3refresh": false,
"z3rlimit": 5,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | false |
t: LowParse.Spec.Sum.dsum ->
f:
(x: LowParse.Spec.Sum.dsum_known_key t
-> Prims.dtuple2 LowParse.Spec.Base.parser_kind
(fun k -> LowParse.Spec.Base.parser k (LowParse.Spec.Sum.dsum_type_of_known_tag t x))) ->
g: LowParse.Spec.Base.parser k' (LowParse.Spec.Sum.dsum_type_of_unknown_tag t) ->
k: LowParse.Spec.Sum.dsum_known_key t
-> LowParse.Spec.Enum.if_combinator (LowParse.Low.Sum.read_dsum_cases_t t f g k)
(LowParse.Low.Sum.read_dsum_cases_t_eq t f g k) | Prims.Tot | [
"total"
] | [] | [
"LowParse.Spec.Sum.dsum",
"LowParse.Spec.Sum.dsum_known_key",
"Prims.dtuple2",
"LowParse.Spec.Base.parser_kind",
"LowParse.Spec.Base.parser",
"LowParse.Spec.Sum.dsum_type_of_known_tag",
"LowParse.Spec.Sum.dsum_type_of_unknown_tag",
"Prims.bool",
"LowParse.Spec.Combinators.cond_true",
"LowParse.Low.Sum.read_dsum_cases_t",
"LowParse.Spec.Combinators.cond_false",
"LowParse.Slice.srel",
"LowParse.Bytes.byte",
"LowParse.Slice.slice",
"FStar.UInt32.t",
"LowParse.Spec.Sum.dsum_cases",
"LowParse.Spec.Enum.Known",
"LowParse.Spec.Sum.dsum_key_type",
"LowParse.Spec.Sum.dsum_repr_type",
"LowParse.Spec.Sum.dsum_enum",
"LowParse.Spec.Enum.if_combinator",
"LowParse.Low.Sum.read_dsum_cases_t_eq"
] | [] | false | false | false | false | false | let read_dsum_cases_t_if
(t: dsum)
(f: (x: dsum_known_key t -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x))))
(#k': parser_kind)
(g: parser k' (dsum_type_of_unknown_tag t))
(k: dsum_known_key t)
: Tot (if_combinator _ (read_dsum_cases_t_eq t f g k)) =
| fun
cond
(sv_true: (cond_true cond -> Tot (read_dsum_cases_t t f g k)))
(sv_false: (cond_false cond -> Tot (read_dsum_cases_t t f g k)))
#_
#_
input
pos
->
if cond then sv_true () input pos else sv_false () input pos | false |
Steel.ST.HigherArray.fst | Steel.ST.HigherArray.upd0 | val upd0
(#t: Type)
(a: array t)
(#s: Ghost.erased (Seq.seq t))
(i: US.t{US.v i < Seq.length s})
(v: t)
: STT unit (pts_to a P.full_perm s) (fun res -> pts_to a P.full_perm (Seq.upd s (US.v i) v)) | val upd0
(#t: Type)
(a: array t)
(#s: Ghost.erased (Seq.seq t))
(i: US.t{US.v i < Seq.length s})
(v: t)
: STT unit (pts_to a P.full_perm s) (fun res -> pts_to a P.full_perm (Seq.upd s (US.v i) v)) | let upd0
(#t: Type)
(a: array t)
(#s: Ghost.erased (Seq.seq t))
(i: US.t { US.v i < Seq.length s })
(v: t)
: STT unit
(pts_to a P.full_perm s)
(fun res -> pts_to a P.full_perm (Seq.upd s (US.v i) v))
= elim_pts_to a _ _;
mk_carrier_upd (US.v (ptr_of a).base_len) ((ptr_of a).offset) s (US.v i) v ();
R.upd_gen
(ptr_of a).base
_ _
(PM.lift_frame_preserving_upd
_ _
(P.mk_frame_preserving_upd
(Seq.index s (US.v i))
v
)
_ ((ptr_of a).offset + US.v i)
);
intro_pts_to a _ _ | {
"file_name": "lib/steel/Steel.ST.HigherArray.fst",
"git_rev": "f984200f79bdc452374ae994a5ca837496476c41",
"git_url": "https://github.com/FStarLang/steel.git",
"project_name": "steel"
} | {
"end_col": 20,
"end_line": 479,
"start_col": 0,
"start_line": 457
} | (*
Copyright 2022 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 in writing, software
distributed under the License is distributed on an "AS IS" BASIS,
WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
See the License for the specific language governing permissions and
limitations under the License.
*)
module Steel.ST.HigherArray
module P = Steel.PCMFrac
module R = Steel.ST.PCMReference
module M = FStar.Map
module PM = Steel.PCMMap
[@@noextract_to "krml"]
let index_t (len: Ghost.erased nat) : Tot Type0 =
(i: nat { i < len })
[@@noextract_to "krml"]
let carrier (elt: Type u#a) (len: Ghost.erased nat) : Tot Type =
PM.map (index_t len) (P.fractional elt)
[@@noextract_to "krml"]
let pcm (elt: Type u#a) (len: Ghost.erased nat) : Tot (P.pcm (carrier elt len)) =
PM.pointwise (index_t len) (P.pcm_frac #elt)
[@@noextract_to "krml"]
let one (#elt: Type) (#len: Ghost.erased nat) = (pcm elt len).P.p.P.one
let composable (#elt: Type) (#len: Ghost.erased nat) = (pcm elt len).P.p.P.composable
[@@noextract_to "krml"]
let compose (#elt: Type) (#len: Ghost.erased nat) = (pcm elt len).P.p.P.op
[@@noextract_to "krml"]
let mk_carrier
(#elt: Type)
(len: nat)
(offset: nat)
(s: Seq.seq elt)
(p: P.perm)
: Tot (carrier elt len)
= let f (i: nat) : Tot (P.fractional elt) =
if offset + Seq.length s > len || i < offset || i >= offset + Seq.length s
then None
else Some (Seq.index s (i - offset), p)
in
M.map_literal f
let mk_carrier_inj
(#elt: Type)
(len: nat)
(offset: nat)
(s1 s2: Seq.seq elt)
(p1 p2: P.perm)
: Lemma
(requires (
mk_carrier len offset s1 p1 == mk_carrier len offset s2 p2 /\
offset + Seq.length s1 <= len /\
offset + Seq.length s2 <= len
))
(ensures (
s1 `Seq.equal` s2 /\
(Seq.length s1 > 0 ==> p1 == p2)
))
= assert (forall (i: nat) . i < Seq.length s1 ==>
(M.sel (mk_carrier len offset s1 p1) (offset + i) == Some (Seq.index s1 i, p1)));
assert (forall (i: nat) . i < Seq.length s2 ==>
M.sel (mk_carrier len offset s2 p2) (offset + i) == Some (Seq.index s2 i, p2))
[@@erasable]
let base_t (elt: Type u#a) : Tot Type0 = Ghost.erased (base_len: US.t & ref _ (pcm elt (US.v base_len)))
let base_len (#elt: Type) (b: base_t elt) : GTot nat = US.v (dfst b)
[@@noextract_to "krml"]
noeq
type ptr (elt: Type u#a) : Type0 = {
base_len: Ghost.erased US.t;
// U32.t to prove that A.read, A.write offset computation does not overflow. TODO: replace U32.t with size_t
base: (r: ref _ (pcm elt (US.v base_len)) { core_ref_is_null r ==> US.v base_len == 0 });
offset: (offset: nat { offset <= US.v base_len });
}
let null_ptr a = { base_len = 0sz; base = null #_ #(pcm a 0) ; offset = 0 }
let is_null_ptr p = is_null p.base
let base (#elt: Type) (p: ptr elt) : Tot (base_t elt) = (| Ghost.reveal p.base_len, p.base |)
let offset (#elt: Type) (p: ptr elt) : Ghost nat (requires True) (ensures (fun offset -> offset <= base_len (base p))) = p.offset
let ptr_base_offset_inj (#elt: Type) (p1 p2: ptr elt) : Lemma
(requires (
base p1 == base p2 /\
offset p1 == offset p2
))
(ensures (
p1 == p2
))
= ()
let base_len_null_ptr _ = ()
let length_fits #elt a = ()
let valid_perm
(len: nat)
(offset: nat)
(slice_len: nat)
(p: P.perm) : Tot prop =
let open FStar.Real in
((offset + slice_len <= len /\ slice_len > 0) ==> (p.P.v <=. one))
[@__reduce__]
let pts_to0 (#elt: Type u#1) (a: array elt) (p: P.perm) (s: Seq.seq elt) : Tot vprop =
R.pts_to (ptr_of a).base (mk_carrier (US.v (ptr_of a).base_len) (ptr_of a).offset s p) `star`
pure (
valid_perm (US.v (ptr_of a).base_len) (ptr_of a).offset (Seq.length s) p /\
Seq.length s == length a
)
let pts_to (#elt: Type u#1) (a: array elt) ([@@@ smt_fallback ] p: P.perm) ([@@@ smt_fallback ] s: Seq.seq elt) : Tot vprop =
pts_to0 a p s
// this lemma is necessary because Steel.PCMReference is marked unfold
let change_r_pts_to
(#opened: _)
(#carrier: Type u#1)
(#pcm: P.pcm carrier)
(p: ref carrier pcm)
(v: carrier)
(#carrier': Type u#1)
(#pcm': P.pcm carrier')
(p': ref carrier' pcm')
(v': carrier')
: STGhost unit opened
(R.pts_to p v)
(fun _ -> R.pts_to p' v')
(// keep on distinct lines for error messages
carrier == carrier' /\
pcm == pcm' /\
p == p' /\
v == v')
(fun _ -> True)
= rewrite
(R.pts_to p v)
(R.pts_to p' v')
let intro_pts_to (#opened: _) (#elt: Type u#1) (a: array elt) (#v: _) (p: P.perm) (s: Seq.seq elt) : STGhost unit opened
(R.pts_to (ptr_of a).base v)
(fun _ -> pts_to a p s)
(
v == mk_carrier (US.v (ptr_of a).base_len) (ptr_of a).offset s p /\
valid_perm (US.v (ptr_of a).base_len) (ptr_of a).offset (Seq.length s) p /\
Seq.length s == length a
)
(fun _ -> True)
= change_r_pts_to (ptr_of a).base v (ptr_of a).base (mk_carrier (US.v (ptr_of a).base_len) (ptr_of a).offset s p);
intro_pure _;
rewrite
(pts_to0 a p s)
(pts_to a p s)
let elim_pts_to (#opened: _) (#elt: Type u#1) (a: array elt) (p: P.perm) (s: Seq.seq elt) : STGhost unit opened
(pts_to a p s)
(fun _ -> R.pts_to (ptr_of a).base (mk_carrier (US.v (ptr_of a).base_len) (ptr_of a).offset s p))
(True)
(fun _ ->
valid_perm (US.v (ptr_of a).base_len) (ptr_of a).offset (Seq.length s) p /\
Seq.length s == length a
)
= rewrite
(pts_to a p s)
(pts_to0 a p s);
elim_pure _
let pts_to_length
a s
=
elim_pts_to a _ s;
intro_pts_to a _ s
let pts_to_not_null
a s
= elim_pts_to a _ s;
R.pts_to_not_null _ _;
intro_pts_to a _ s
let mk_carrier_joinable
(#elt: Type)
(len: nat)
(offset: nat)
(s1: Seq.seq elt)
(p1: P.perm)
(s2: Seq.seq elt)
(p2: P.perm)
: Lemma
(requires (
offset + Seq.length s1 <= len /\
Seq.length s1 == Seq.length s2 /\
P.joinable (pcm elt len) (mk_carrier len offset s1 p1) (mk_carrier len offset s2 p2)
))
(ensures (
s1 `Seq.equal` s2
))
=
let lem
(i: nat { 0 <= i /\ i < Seq.length s1 })
: Lemma
(Seq.index s1 i == Seq.index s2 i)
[SMTPat (Seq.index s1 i); SMTPat (Seq.index s2 i)]
= assert (
forall z . (
P.compatible (pcm elt len) (mk_carrier len offset s1 p1) z /\
P.compatible (pcm elt len) (mk_carrier len offset s2 p2) z
) ==>
begin match M.sel z (offset + i) with
| None -> False
| Some (v, _) -> v == Seq.index s1 i /\ v == Seq.index s2 i
end
)
in
()
let pure_star_interp' (p:slprop u#a) (q:prop) (m:mem)
: Lemma (interp (p `Steel.Memory.star` Steel.Memory.pure q) m <==>
interp p m /\ q)
= pure_star_interp p q m;
emp_unit p
let pts_to_inj
a p1 s1 p2 s2 m
=
Classical.forall_intro reveal_pure;
pure_star_interp'
(hp_of (R.pts_to (ptr_of a).base (mk_carrier (US.v (ptr_of a).base_len) (ptr_of a).offset s1 p1)))
(
valid_perm (US.v (ptr_of a).base_len) (ptr_of a).offset (Seq.length s1) p1 /\
Seq.length s1 == length a
)
m;
pure_star_interp'
(hp_of (R.pts_to (ptr_of a).base (mk_carrier (US.v (ptr_of a).base_len) (ptr_of a).offset s2 p2)))
(
valid_perm (US.v (ptr_of a).base_len) (ptr_of a).offset (Seq.length s2) p2 /\
Seq.length s2 == length a
)
m;
pts_to_join
(ptr_of a).base
(mk_carrier (US.v (ptr_of a).base_len) (ptr_of a).offset s1 p1)
(mk_carrier (US.v (ptr_of a).base_len) (ptr_of a).offset s2 p2)
m;
mk_carrier_joinable (US.v (ptr_of a).base_len) (ptr_of a).offset s1 p1 s2 p2
[@@noextract_to "krml"]
let malloc0
(#elt: Type)
(x: elt)
(n: US.t)
: ST (array elt)
emp
(fun a -> pts_to a P.full_perm (Seq.create (US.v n) x))
(True)
(fun a ->
length a == US.v n /\
base_len (base (ptr_of a)) == US.v n
)
=
let c : carrier elt (US.v n) = mk_carrier (US.v n) 0 (Seq.create (US.v n) x) P.full_perm in
let base : ref (carrier elt (US.v n)) (pcm elt (US.v n)) = R.alloc c in
R.pts_to_not_null base _;
let p = {
base_len = n;
base = base;
offset = 0;
}
in
let a = (| p, Ghost.hide (US.v n) |) in
change_r_pts_to
base c
(ptr_of a).base c;
intro_pts_to a P.full_perm (Seq.create (US.v n) x);
return a
let malloc_ptr
x n
=
let a = malloc0 x n in
let (| p, _ |) = a in
rewrite
(pts_to _ _ _)
(pts_to (| p, Ghost.hide (US.v n) |) _ _);
return p
[@@noextract_to "krml"]
let free0
(#elt: Type)
(#s: Ghost.erased (Seq.seq elt))
(a: array elt)
: ST unit
(pts_to a P.full_perm s)
(fun _ -> emp)
(
length a == base_len (base (ptr_of a))
)
(fun _ -> True)
= drop (pts_to a _ _)
let free_ptr a =
free0 _
let valid_sum_perm
(len: nat)
(offset: nat)
(slice_len: nat)
(p1 p2: P.perm)
: Tot prop
= let open FStar.Real in
valid_perm len offset slice_len (P.sum_perm p1 p2)
let mk_carrier_share
(#elt: Type)
(len: nat)
(offset: nat)
(s: Seq.seq elt)
(p1 p2: P.perm)
: Lemma
(requires (valid_sum_perm len offset (Seq.length s) p1 p2))
(ensures (
let c1 = mk_carrier len offset s p1 in
let c2 = mk_carrier len offset s p2 in
composable c1 c2 /\
mk_carrier len offset s (p1 `P.sum_perm` p2) `M.equal` (c1 `compose` c2)
))
= ()
let share
#_ #_ #x a p p1 p2
= elim_pts_to a p x;
mk_carrier_share (US.v (ptr_of a).base_len) (ptr_of a).offset x p1 p2;
R.split (ptr_of a).base _
(mk_carrier (US.v (ptr_of a).base_len) (ptr_of a).offset x p1)
(mk_carrier (US.v (ptr_of a).base_len) (ptr_of a).offset x p2);
intro_pts_to a p1 x;
intro_pts_to a p2 x
let mk_carrier_gather
(#elt: Type)
(len: nat)
(offset: nat)
(s1 s2: Seq.seq elt)
(p1 p2: P.perm)
: Lemma
(requires (
let c1 = mk_carrier len offset s1 p1 in
let c2 = mk_carrier len offset s2 p2 in
composable c1 c2 /\
Seq.length s1 == Seq.length s2 /\
offset + Seq.length s1 <= len
))
(ensures (
let c1 = mk_carrier len offset s1 p1 in
let c2 = mk_carrier len offset s2 p2 in
composable c1 c2 /\
mk_carrier len offset s1 (p1 `P.sum_perm` p2) == (c1 `compose` c2) /\
mk_carrier len offset s2 (p1 `P.sum_perm` p2) == (c1 `compose` c2) /\
s1 == s2
))
=
let c1 = mk_carrier len offset s1 p1 in
let c2 = mk_carrier len offset s2 p2 in
assert (composable c1 c2);
assert (mk_carrier len offset s1 (p1 `P.sum_perm` p2) `M.equal` (c1 `compose` c2));
assert (mk_carrier len offset s2 (p1 `P.sum_perm` p2) `M.equal` (c1 `compose` c2));
mk_carrier_inj len offset s1 s2 (p1 `P.sum_perm` p2) (p1 `P.sum_perm` p2)
let mk_carrier_valid_sum_perm
(#elt: Type)
(len: nat)
(offset: nat)
(s: Seq.seq elt)
(p1 p2: P.perm)
: Lemma
(let c1 = mk_carrier len offset s p1 in
let c2 = mk_carrier len offset s p2 in
composable c1 c2 <==> valid_sum_perm len offset (Seq.length s) p1 p2)
= let c1 = mk_carrier len offset s p1 in
let c2 = mk_carrier len offset s p2 in
if Seq.length s > 0 && offset + Seq.length s <= len
then
let open FStar.Real in
assert (P.composable (M.sel c1 offset) (M.sel c2 offset) <==> valid_perm len offset (Seq.length s) (P.sum_perm p1 p2))
else ()
let gather
a #x1 p1 #x2 p2
= elim_pts_to a p1 x1;
elim_pts_to a p2 x2;
let _ = R.gather (ptr_of a).base
(mk_carrier (US.v (ptr_of a).base_len) ((ptr_of a).offset) x1 p1)
(mk_carrier (US.v (ptr_of a).base_len) ((ptr_of a).offset) x2 p2)
in
mk_carrier_gather (US.v (ptr_of a).base_len) ((ptr_of a).offset) x1 x2 p1 p2;
mk_carrier_valid_sum_perm (US.v (ptr_of a).base_len) ((ptr_of a).offset) x1 p1 p2;
intro_pts_to a (p1 `P.sum_perm` p2) x1
#push-options "--z3rlimit 16"
[@@noextract_to "krml"]
let index0
(#t: Type) (#p: P.perm)
(a: array t)
(#s: Ghost.erased (Seq.seq t))
(i: US.t)
: ST t
(pts_to a p s)
(fun _ -> pts_to a p s)
(US.v i < length a \/ US.v i < Seq.length s)
(fun res -> Seq.length s == length a /\ US.v i < Seq.length s /\ res == Seq.index s (US.v i))
= elim_pts_to a p s;
let s' = R.read (ptr_of a).base _ in
let res = fst (Some?.v (M.sel s' ((ptr_of a).offset + US.v i))) in
intro_pts_to a p s;
return res
#pop-options
let index_ptr a i =
index0 _ i
let mk_carrier_upd
(#elt: Type)
(len: nat)
(offset: nat)
(s: Seq.seq elt)
(i: nat)
(v: elt)
(_: squash (
offset + Seq.length s <= len /\
i < Seq.length s
))
: Lemma
(ensures (
let o = mk_carrier len offset s P.full_perm in
let o' = mk_carrier len offset (Seq.upd s i v) P.full_perm in
o' `Map.equal` Map.upd o (offset + i) (Some (v, P.full_perm))
))
= ()
#push-options "--z3rlimit 20" | {
"checked_file": "/",
"dependencies": [
"Steel.ST.PCMReference.fsti.checked",
"Steel.ST.Loops.fsti.checked",
"Steel.PCMMap.fst.checked",
"Steel.PCMFrac.fst.checked",
"Steel.Memory.fsti.checked",
"prims.fst.checked",
"FStar.SizeT.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Real.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Map.fsti.checked",
"FStar.Ghost.fsti.checked",
"FStar.Classical.fsti.checked"
],
"interface_file": true,
"source_file": "Steel.ST.HigherArray.fst"
} | [
{
"abbrev": true,
"full_module": "Steel.PCMMap",
"short_module": "PM"
},
{
"abbrev": true,
"full_module": "FStar.Map",
"short_module": "M"
},
{
"abbrev": true,
"full_module": "Steel.ST.PCMReference",
"short_module": "R"
},
{
"abbrev": true,
"full_module": "Steel.PCMFrac",
"short_module": "P"
},
{
"abbrev": false,
"full_module": "Steel.ST.Util",
"short_module": null
},
{
"abbrev": true,
"full_module": "FStar.PtrdiffT",
"short_module": "UP"
},
{
"abbrev": true,
"full_module": "FStar.SizeT",
"short_module": "US"
},
{
"abbrev": true,
"full_module": "Steel.FractionalPermission",
"short_module": "P"
},
{
"abbrev": false,
"full_module": "Steel.ST",
"short_module": null
},
{
"abbrev": false,
"full_module": "Steel.ST",
"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",
"short_module": null
}
] | {
"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_elim_box": false,
"smtencoding_l_arith_repr": "boxwrap",
"smtencoding_nl_arith_repr": "boxwrap",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": true,
"z3cliopt": [],
"z3refresh": false,
"z3rlimit": 20,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | false |
a: Steel.ST.HigherArray.array t ->
i: FStar.SizeT.t{FStar.SizeT.v i < FStar.Seq.Base.length (FStar.Ghost.reveal s)} ->
v: t
-> Steel.ST.Effect.STT Prims.unit | Steel.ST.Effect.STT | [] | [] | [
"Steel.ST.HigherArray.array",
"FStar.Ghost.erased",
"FStar.Seq.Base.seq",
"FStar.SizeT.t",
"Prims.b2t",
"Prims.op_LessThan",
"FStar.SizeT.v",
"FStar.Seq.Base.length",
"FStar.Ghost.reveal",
"Steel.ST.HigherArray.intro_pts_to",
"FStar.Ghost.hide",
"FStar.Set.set",
"Steel.Memory.iname",
"FStar.Set.empty",
"FStar.Map.upd",
"Steel.ST.HigherArray.index_t",
"Prims.nat",
"Steel.ST.HigherArray.__proj__Mkptr__item__base_len",
"Steel.ST.HigherArray.ptr_of",
"Steel.PCMFrac.fractional",
"Steel.PCMMap.map",
"Steel.ST.HigherArray.carrier",
"Steel.ST.HigherArray.mk_carrier",
"Steel.ST.HigherArray.__proj__Mkptr__item__offset",
"Steel.FractionalPermission.full_perm",
"Prims.op_Addition",
"FStar.Pervasives.Native.Some",
"FStar.Pervasives.Native.tuple2",
"Steel.FractionalPermission.perm",
"FStar.Pervasives.Native.Mktuple2",
"FStar.Seq.Base.upd",
"Prims.unit",
"Steel.ST.PCMReference.upd_gen",
"Steel.ST.HigherArray.pcm",
"Steel.ST.HigherArray.__proj__Mkptr__item__base",
"Steel.PCMMap.lift_frame_preserving_upd",
"Steel.PCMFrac.pcm_frac",
"FStar.Seq.Base.index",
"Steel.PCMFrac.mk_frame_preserving_upd",
"Steel.ST.HigherArray.mk_carrier_upd",
"Steel.ST.HigherArray.elim_pts_to",
"Steel.ST.HigherArray.pts_to",
"Steel.Effect.Common.vprop"
] | [] | false | true | false | false | false | let upd0
(#t: Type)
(a: array t)
(#s: Ghost.erased (Seq.seq t))
(i: US.t{US.v i < Seq.length s})
(v: t)
: STT unit (pts_to a P.full_perm s) (fun res -> pts_to a P.full_perm (Seq.upd s (US.v i) v)) =
| elim_pts_to a _ _;
mk_carrier_upd (US.v (ptr_of a).base_len) ((ptr_of a).offset) s (US.v i) v ();
R.upd_gen (ptr_of a).base
_
_
(PM.lift_frame_preserving_upd _
_
(P.mk_frame_preserving_upd (Seq.index s (US.v i)) v)
_
((ptr_of a).offset + US.v i));
intro_pts_to a _ _ | false |
Vale.Curve25519.Fast_defs.fst | Vale.Curve25519.Fast_defs.pow2_320 | val pow2_320 : Prims.int | let pow2_320 = 0x100000000000000000000000000000000000000000000000000000000000000000000000000000000 | {
"file_name": "vale/code/crypto/ecc/curve25519/Vale.Curve25519.Fast_defs.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 105,
"end_line": 11,
"start_col": 7,
"start_line": 11
} | module Vale.Curve25519.Fast_defs
open Vale.Def.Words_s
open Vale.Def.Types_s
open FStar.Mul
unfold let pow2_192 = 0x1000000000000000000000000000000000000000000000000
let _ = assert_norm (pow2 192 = pow2_192)
unfold let pow2_256 = 0x10000000000000000000000000000000000000000000000000000000000000000 | {
"checked_file": "/",
"dependencies": [
"Vale.Def.Words_s.fsti.checked",
"Vale.Def.Types_s.fst.checked",
"Vale.Curve25519.Fast_lemmas_internal.fsti.checked",
"Vale.Arch.Types.fsti.checked",
"prims.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked"
],
"interface_file": false,
"source_file": "Vale.Curve25519.Fast_defs.fst"
} | [
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Def.Types_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Def.Words_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Curve25519",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Curve25519",
"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",
"short_module": null
}
] | {
"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_elim_box": true,
"smtencoding_l_arith_repr": "native",
"smtencoding_nl_arith_repr": "wrapped",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": false,
"z3cliopt": [
"smt.arith.nl=false",
"smt.QI.EAGER_THRESHOLD=100",
"smt.CASE_SPLIT=3"
],
"z3refresh": false,
"z3rlimit": 5,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | false | Prims.int | Prims.Tot | [
"total"
] | [] | [] | [] | false | false | false | true | false | let pow2_320 =
| 0x100000000000000000000000000000000000000000000000000000000000000000000000000000000 | false |
|
LowParse.Low.Sum.fst | LowParse.Low.Sum.valid_dsum_intro_unknown | val valid_dsum_intro_unknown
(h: HS.mem)
(t: dsum)
(#kt: parser_kind)
(p: parser kt (dsum_repr_type t))
(f: (x: dsum_known_key t -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x))))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: Lemma
(requires
(valid (parse_maybe_enum_key p (dsum_enum t)) h input pos /\
(let k' = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
Unknown? k' /\
valid g h input (get_valid_pos (parse_maybe_enum_key p (dsum_enum t)) h input pos))))
(ensures
(let Unknown r = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
let pos_payload = get_valid_pos (parse_maybe_enum_key p (dsum_enum t)) h input pos in
valid_content_pos (parse_dsum t p f g)
h
input
pos
(synth_dsum_case t (Unknown r) (contents g h input pos_payload))
(get_valid_pos g h input pos_payload))) | val valid_dsum_intro_unknown
(h: HS.mem)
(t: dsum)
(#kt: parser_kind)
(p: parser kt (dsum_repr_type t))
(f: (x: dsum_known_key t -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x))))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: Lemma
(requires
(valid (parse_maybe_enum_key p (dsum_enum t)) h input pos /\
(let k' = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
Unknown? k' /\
valid g h input (get_valid_pos (parse_maybe_enum_key p (dsum_enum t)) h input pos))))
(ensures
(let Unknown r = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
let pos_payload = get_valid_pos (parse_maybe_enum_key p (dsum_enum t)) h input pos in
valid_content_pos (parse_dsum t p f g)
h
input
pos
(synth_dsum_case t (Unknown r) (contents g h input pos_payload))
(get_valid_pos g h input pos_payload))) | let valid_dsum_intro_unknown
(h: HS.mem)
(t: dsum)
(#kt: parser_kind)
(p: parser kt (dsum_repr_type t))
(f: ((x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x))))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: Lemma
(requires (
valid (parse_maybe_enum_key p (dsum_enum t)) h input pos /\ (
let k' = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
Unknown? k' /\
valid g h input (get_valid_pos (parse_maybe_enum_key p (dsum_enum t)) h input pos)
)))
(ensures (
let Unknown r = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
let pos_payload = get_valid_pos (parse_maybe_enum_key p (dsum_enum t)) h input pos in
valid_content_pos
(parse_dsum t p f g) h input pos
(synth_dsum_case t (Unknown r) (contents g h input pos_payload))
(get_valid_pos g h input pos_payload)
))
= valid_facts (parse_maybe_enum_key p (dsum_enum t)) h input pos;
let Unknown r = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
let pos_payload = get_valid_pos (parse_maybe_enum_key p (dsum_enum t)) h input pos in
valid_facts g h input pos_payload;
valid_facts (parse_dsum t p f g) h input pos;
parse_dsum_eq t p f g (bytes_of_slice_from h input pos) | {
"file_name": "src/lowparse/LowParse.Low.Sum.fst",
"git_rev": "00217c4a89f5ba56002ba9aa5b4a9d5903bfe9fa",
"git_url": "https://github.com/project-everest/everparse.git",
"project_name": "everparse"
} | {
"end_col": 57,
"end_line": 1164,
"start_col": 0,
"start_line": 1133
} | module LowParse.Low.Sum
include LowParse.Low.Enum
include LowParse.Spec.Sum
module U32 = FStar.UInt32
module HST = FStar.HyperStack.ST
module B = LowStar.Buffer
module Cast = FStar.Int.Cast
module U64 = FStar.UInt64
inline_for_extraction
let validate_sum_cases_aux
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(vc: ((x: sum_key t) -> Tot (validator (dsnd (pc x)))))
(k: sum_key t)
: Tot (validator (parse_sum_cases t pc k))
= [@inline_let]
let _ = synth_sum_case_injective t k in
validate_synth
(validate_weaken
(weaken_parse_cases_kind t pc)
(vc k)
()
)
(synth_sum_case t k)
()
inline_for_extraction
let validate_sum_cases_t
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot Type
= validator (parse_sum_cases t pc k)
let validate_sum_cases_t_eq
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
(x y : validate_sum_cases_t t pc k)
: GTot Type0
= True
inline_for_extraction
let validate_sum_cases_t_if
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (if_combinator _ (validate_sum_cases_t_eq t pc k))
= fun cond (sv_true: cond_true cond -> Tot (validate_sum_cases_t t pc k)) (sv_false: cond_false cond -> Tot (validate_sum_cases_t t pc k)) #rrel #rel input pos ->
if cond
then sv_true () input pos
else sv_false () input pos
inline_for_extraction
let validate_sum_cases
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(vc: ((x: sum_key t) -> Tot (validator (dsnd (pc x)))))
(destr: dep_enum_destr (sum_enum t) (validate_sum_cases_t t pc))
(k: sum_key t)
: Tot (validator (parse_sum_cases t pc k))
= destr
_
(validate_sum_cases_t_if t pc)
(fun _ _ -> ())
(fun _ _ _ _ -> ())
(validate_sum_cases_aux t pc vc)
k
inline_for_extraction
let validate_sum_aux_payload_t
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
: Tot Type
= (#rrel: _) -> (#rel: _) ->
(input: slice rrel rel) ->
(pos: U64.t) ->
HST.Stack U64.t
(requires (fun h -> live_slice h input /\ U64.v pos <= U32.v input.len))
(ensures (fun h res h' ->
B.modifies B.loc_none h h' /\ (
match k with
| Unknown _ -> is_error res
| Known k' ->
if is_success res
then
valid_pos (dsnd (pc k')) h input (uint64_to_uint32 pos) (uint64_to_uint32 res)
else
(~ (valid (dsnd (pc k')) h input (uint64_to_uint32 pos)))
)))
let validate_sum_aux_payload_eq
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
: Tot (validate_sum_aux_payload_t t pc k -> validate_sum_aux_payload_t t pc k -> GTot Type0)
= fun _ _ -> True
inline_for_extraction
let validate_sum_aux_payload_if'
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
(cond: bool)
(ift: ((cond_true cond) -> Tot (validate_sum_aux_payload_t t pc k)))
(iff: ((cond_false cond) -> Tot (validate_sum_aux_payload_t t pc k)))
: Tot (validate_sum_aux_payload_t t pc k)
= fun #rrel #rel input pos ->
if cond
then begin
(ift () <: validate_sum_aux_payload_t t pc k) input pos
end else
(iff () <: validate_sum_aux_payload_t t pc k) input pos
inline_for_extraction
let validate_sum_aux_payload_if
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
: Tot (if_combinator _ (validate_sum_aux_payload_eq t pc k))
= validate_sum_aux_payload_if' t pc k
#push-options "--z3rlimit 64 --z3cliopt smt.arith.nl=false --using_facts_from '* -FStar.Int.Cast -LowParse.BitFields'"
// --query_stats --smtencoding.elim_box true --smtencoding.l_arith_repr native --z3refresh"
inline_for_extraction
let validate_sum_aux
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(v: validator p)
(p32: leaf_reader p)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(v_payload: ((k: sum_repr_type t)) -> Tot (validate_sum_aux_payload_t t pc (maybe_enum_key_of_repr (sum_enum t) k)))
: Tot (validator (parse_sum t p pc))
= fun #rrel #rel input pos ->
let h = HST.get () in
[@inline_let]
let _ = parse_sum_eq'' t p pc (bytes_of_slice_from h input (uint64_to_uint32 pos)) in
[@inline_let]
let _ = valid_facts (parse_sum t p pc) h input (uint64_to_uint32 pos) in
[@inline_let]
let _ = valid_facts p h input (uint64_to_uint32 pos) in
let len_after_tag = v input pos in
if is_error len_after_tag
then len_after_tag
else begin
let h1 = HST.get () in
let k' = p32 input (uint64_to_uint32 pos) in
[@inline_let]
let _ =
match maybe_enum_key_of_repr (sum_enum t) k' with
| Known k -> valid_facts (dsnd (pc k)) h input (uint64_to_uint32 len_after_tag)
| _ -> ()
in
v_payload k' input len_after_tag
end
#pop-options
inline_for_extraction
let validate_sum_aux_payload'
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (validator (dsnd (pc x)))))
(k: maybe_enum_key (sum_enum t))
: Tot (validate_sum_aux_payload_t t pc k)
= fun #rrel #rel input pos ->
match k with
| Known k ->
[@inline_let]
let _ = synth_sum_case_injective t k in
pc32 k input pos
// validate_synth (pc32 k) (synth_sum_case t k) () input pos
| _ -> validator_error_generic
inline_for_extraction
let validate_sum_aux_payload
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (validator (dsnd (pc x)))))
(destr: dep_maybe_enum_destr_t (sum_enum t) (validate_sum_aux_payload_t t pc))
(k: sum_repr_type t)
: Tot (validate_sum_aux_payload_t t pc (maybe_enum_key_of_repr (sum_enum t) k))
= destr (validate_sum_aux_payload_eq t pc) (validate_sum_aux_payload_if t pc) (fun _ _ -> ()) (fun _ _ _ _ -> ()) (validate_sum_aux_payload' t pc pc32) k
inline_for_extraction
let validate_sum
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(v: validator p)
(p32: leaf_reader p)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (validator (dsnd (pc x)))))
(destr: dep_maybe_enum_destr_t (sum_enum t) (validate_sum_aux_payload_t t pc))
: Tot (validator (parse_sum t p pc))
= validate_sum_aux t v p32 pc (validate_sum_aux_payload t pc pc32 destr)
module HS = FStar.HyperStack
#push-options "--z3rlimit 256 --z3cliopt smt.arith.nl=false --initial_ifuel 8 --max_ifuel 8 --initial_fuel 2 --max_fuel 2"
#restart-solver
let valid_sum_intro
(h: HS.mem)
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: Lemma
(requires (
valid (parse_enum_key p (sum_enum t)) h input pos /\ (
let k = contents (parse_enum_key p (sum_enum t)) h input pos in
valid (dsnd (pc k)) h input (get_valid_pos (parse_enum_key p (sum_enum t)) h input pos)
)))
(ensures (
let k = contents (parse_enum_key p (sum_enum t)) h input pos in
let pos_payload = get_valid_pos (parse_enum_key p (sum_enum t)) h input pos in
valid_content_pos
(parse_sum t p pc) h input pos
(synth_sum_case t k (contents (dsnd (pc k)) h input pos_payload))
(get_valid_pos (dsnd (pc k)) h input pos_payload)
))
= valid_facts (parse_enum_key p (sum_enum t)) h input pos;
let k = contents (parse_enum_key p (sum_enum t)) h input pos in
let pos_payload = get_valid_pos (parse_enum_key p (sum_enum t)) h input pos in
valid_facts (dsnd (pc k)) h input pos_payload;
valid_facts (parse_sum t p pc) h input pos;
parse_sum_eq t p pc (bytes_of_slice_from h input pos)
#pop-options
inline_for_extraction
let finalize_sum_case
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(s: serializer p)
(w: leaf_writer_strong s)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(destr: enum_repr_of_key'_t (sum_enum t))
(k: sum_key t)
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: HST.Stack unit
(requires (fun h ->
let len_tag = serialized_length (serialize_enum_key _ s (sum_enum t)) k in
U32.v pos + len_tag < 4294967296 /\ (
let pos_payload = pos `U32.add` U32.uint_to_t len_tag in
valid (dsnd (pc k)) h input pos_payload /\
writable input.base (U32.v pos) (U32.v pos_payload) h
)))
(ensures (fun h _ h' ->
let len_tag = serialized_length (serialize_enum_key _ s (sum_enum t)) k in
let pos_payload = pos `U32.add` U32.uint_to_t len_tag in
B.modifies (loc_slice_from_to input pos pos_payload) h h' /\
valid_content_pos (parse_sum t p pc) h' input pos (synth_sum_case t k (contents (dsnd (pc k)) h input pos_payload)) (get_valid_pos (dsnd (pc k)) h input pos_payload)
))
= let pos1 = write_enum_key w (sum_enum t) destr k input pos in
let h = HST.get () in
[@inline_let]
let _ = valid_sum_intro h t p pc input pos in
()
inline_for_extraction
let jump_sum_cases_aux
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(vc: ((x: sum_key t) -> Tot (jumper (dsnd (pc x)))))
(k: sum_key t)
: Tot (jumper (parse_sum_cases t pc k))
= [@inline_let]
let _ = synth_sum_case_injective t k in
jump_synth
(jump_weaken
(weaken_parse_cases_kind t pc)
(vc k)
()
)
(synth_sum_case t k)
()
inline_for_extraction
let jump_sum_cases_t
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot Type
= jumper (parse_sum_cases t pc k)
let jump_sum_cases_t_eq
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
(x y : jump_sum_cases_t t pc k)
: GTot Type0
= True
inline_for_extraction
let jump_sum_cases_t_if
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (if_combinator _ (jump_sum_cases_t_eq t pc k))
= fun cond (sv_true: cond_true cond -> Tot (jump_sum_cases_t t pc k)) (sv_false: cond_false cond -> Tot (jump_sum_cases_t t pc k)) #rrel #rel input pos ->
if cond
then sv_true () input pos
else sv_false () input pos
inline_for_extraction
let jump_sum_cases
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(vc: ((x: sum_key t) -> Tot (jumper (dsnd (pc x)))))
(destr: dep_enum_destr (sum_enum t) (jump_sum_cases_t t pc))
(k: sum_key t)
: Tot (jumper (parse_sum_cases t pc k))
= destr
_
(jump_sum_cases_t_if t pc)
(fun _ _ -> ())
(fun _ _ _ _ -> ())
(jump_sum_cases_aux t pc vc)
k
inline_for_extraction
let jump_sum_aux_payload_t
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
: Tot Type
= (#rrel: _) -> (#rel: _) ->
(input: slice rrel rel) ->
(pos: U32.t) ->
HST.Stack U32.t
(requires (fun h -> live_slice h input /\ U32.v pos <= U32.v input.len /\ (
match k with
| Unknown _ -> False
| Known k' -> valid (dsnd (pc k')) h input pos
)))
(ensures (fun h res h' ->
B.modifies B.loc_none h h' /\ (
match k with
| Unknown _ -> False
| Known k' ->
valid_pos (dsnd (pc k')) h input pos res
)))
let jump_sum_aux_payload_eq
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
: Tot (jump_sum_aux_payload_t t pc k -> jump_sum_aux_payload_t t pc k -> GTot Type0)
= fun _ _ -> True
inline_for_extraction
let jump_sum_aux_payload_if'
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
(cond: bool)
(ift: ((cond_true cond) -> Tot (jump_sum_aux_payload_t t pc k)))
(iff: ((cond_false cond) -> Tot (jump_sum_aux_payload_t t pc k)))
: Tot (jump_sum_aux_payload_t t pc k)
= fun #rrel #rel input pos ->
if cond
then begin
(ift () <: jump_sum_aux_payload_t t pc k) input pos
end else
(iff () <: jump_sum_aux_payload_t t pc k) input pos
inline_for_extraction
let jump_sum_aux_payload_if
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
: Tot (if_combinator _ (jump_sum_aux_payload_eq t pc k))
= jump_sum_aux_payload_if' t pc k
let parse_sum_eq3
(#kt: parser_kind)
(t: sum)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(input: bytes)
(k' : sum_repr_type t)
(consumed_k: consumed_length input)
: Lemma
(requires (Some? (parse (parse_sum t p pc) input) /\ parse p input == Some (k', consumed_k)))
(ensures (
let input_k = Seq.slice input consumed_k (Seq.length input) in
let k = maybe_enum_key_of_repr (sum_enum t) k' in
begin match k with
| Known k ->
Some? (parse (dsnd (pc k)) input_k)
| _ -> False
end
))
= parse_sum_eq'' t p pc input
let parse_sum_eq4
(#kt: parser_kind)
(t: sum)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(input: bytes)
(k' : sum_repr_type t)
(consumed_k: consumed_length input)
(consumed_payload: nat)
: Lemma
(requires (Some? (parse (parse_sum t p pc) input) /\ parse p input == Some (k', consumed_k) /\ (
let input_k = Seq.slice input consumed_k (Seq.length input) in
let k = maybe_enum_key_of_repr (sum_enum t) k' in
begin match k with
| Known k ->
Some? (parse (dsnd (pc k)) input_k) /\ (
let Some (_, consumed_payload') = parse (dsnd (pc k)) input_k in
consumed_payload' == consumed_payload
)
| _ -> False
end
)))
(ensures (
let Some (_, consumed) = parse (parse_sum t p pc) input in
consumed == consumed_k + consumed_payload
))
= parse_sum_eq'' t p pc input
#push-options "--z3rlimit 16"
let valid_sum_elim
(h: HS.mem)
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(#rrel: _) (#rel: _)
(input: slice rrel rel)
(pos: U32.t)
: Lemma
(requires (
valid (parse_sum t p pc) h input pos
))
(ensures (
valid p h input pos /\ (
let pos_payload = get_valid_pos p h input pos in
let k' = maybe_enum_key_of_repr (sum_enum t) (contents p h input pos) in
match k' with
| Known k ->
k == sum_tag_of_data t (contents (parse_sum t p pc) h input pos) /\
valid (dsnd (pc k)) h input pos_payload /\
valid_pos
(parse_sum t p pc) h input pos
(get_valid_pos (dsnd (pc k)) h input pos_payload)
| _ -> False
)))
= let sinput = bytes_of_slice_from h input pos in
let _ = parse_sum_eq'' t p pc sinput in
[@inline_let]
let _ = valid_facts (parse_sum t p pc) h input pos in
let Some (k', consumed_k) = parse p sinput in
let pos_after_tag = U32.uint_to_t (U32.v pos + consumed_k) in
[@inline_let]
let _ = valid_facts p h input pos in
assert (valid_content_pos p h input pos k' pos_after_tag);
match maybe_enum_key_of_repr (sum_enum t) k' with
| Known k -> valid_facts (dsnd (pc k)) h input pos_after_tag
| _ -> ()
#pop-options
let valid_sum_elim_tag
(h: HS.mem)
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: Lemma
(requires (
valid (parse_sum t p pc) h input pos
))
(ensures (
valid (parse_enum_key p (sum_enum t)) h input pos /\
contents (parse_enum_key p (sum_enum t)) h input pos == sum_tag_of_data t (contents (parse_sum t p pc) h input pos)
))
= let _ = parse_sum_eq' t p pc (bytes_of_slice_from h input pos) in
let _ = valid_facts (parse_sum t p pc) h input pos in
let _ = valid_facts (parse_enum_key p (sum_enum t)) h input pos in
()
inline_for_extraction
let read_sum_tag
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(p32: leaf_reader p)
(destr: dep_maybe_enum_destr_t (sum_enum t) (read_enum_key_t (sum_enum t)))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: HST.Stack (sum_key t)
(requires (fun h ->
valid (parse_sum t p pc) h input pos
))
(ensures (fun h res h' ->
B.modifies B.loc_none h h' /\
res == sum_tag_of_data t (contents (parse_sum t p pc) h input pos)
))
= let h = HST.get () in
[@inline_let] let _ = valid_sum_elim_tag h t p pc input pos in
read_enum_key p32 (sum_enum t) destr input pos
inline_for_extraction
let jump_sum_aux
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(v: jumper p)
(p32: leaf_reader p)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(v_payload: ((k: sum_repr_type t)) -> Tot (jump_sum_aux_payload_t t pc (maybe_enum_key_of_repr (sum_enum t) k)))
: Tot (jumper (parse_sum t p pc))
= fun #rrel #rel input pos ->
let h = HST.get () in
[@inline_let]
let _ = valid_sum_elim h t p pc input pos in
let pos_after_tag = v input pos in
let k' = p32 input pos in
v_payload k' input pos_after_tag
inline_for_extraction
let jump_sum_aux_payload'
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (jumper (dsnd (pc x)))))
(k: maybe_enum_key (sum_enum t))
: Tot (jump_sum_aux_payload_t t pc k)
= fun #rrel #rel input pos ->
match k with
| Known k ->
[@inline_let]
let _ = synth_sum_case_injective t k in
pc32 k input pos
| _ -> 0ul // dummy, but we MUST NOT remove this branch, otherwise extraction fails
inline_for_extraction
let jump_sum_aux_payload
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (jumper (dsnd (pc x)))))
(destr: dep_maybe_enum_destr_t (sum_enum t) (jump_sum_aux_payload_t t pc))
(k: sum_repr_type t)
: Tot (jump_sum_aux_payload_t t pc (maybe_enum_key_of_repr (sum_enum t) k))
= destr (jump_sum_aux_payload_eq t pc) (jump_sum_aux_payload_if t pc) (fun _ _ -> ()) (fun _ _ _ _ -> ()) (jump_sum_aux_payload' t pc pc32) k
inline_for_extraction
let jump_sum
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(v: jumper p)
(p32: leaf_reader p)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (jumper (dsnd (pc x)))))
(destr: dep_maybe_enum_destr_t (sum_enum t) (jump_sum_aux_payload_t t pc))
: Tot (jumper (parse_sum t p pc))
= jump_sum_aux t v p32 pc (jump_sum_aux_payload t pc pc32 destr)
inline_for_extraction
let read_sum_cases'
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (leaf_reader (dsnd (pc x)))))
(k: sum_key t)
: Tot (leaf_reader (parse_sum_cases' t pc k))
= [@inline_let]
let _ = synth_sum_case_injective t k in
read_synth'
(dsnd (pc k))
(synth_sum_case t k)
(pc32 k)
()
inline_for_extraction
let read_sum_cases_t
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot Type
= leaf_reader (parse_sum_cases' t pc k)
let read_sum_cases_t_eq
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
(x y : read_sum_cases_t t pc k)
: GTot Type0
= True
inline_for_extraction
let read_sum_cases_t_if
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (if_combinator _ (read_sum_cases_t_eq t pc k))
= fun cond (sv_true: cond_true cond -> Tot (read_sum_cases_t t pc k)) (sv_false: cond_false cond -> Tot (read_sum_cases_t t pc k)) #_ #_ input pos ->
if cond
then (sv_true () input pos)
else (sv_false () input pos)
inline_for_extraction
let read_sum_cases
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (leaf_reader (dsnd (pc x)))))
(destr: dep_enum_destr (sum_enum t) (read_sum_cases_t t pc))
(k: sum_key t)
: Tot (leaf_reader (parse_sum_cases' t pc k))
= destr
_
(read_sum_cases_t_if t pc)
(fun _ _ -> ())
(fun _ _ _ _ -> ())
(read_sum_cases' t pc pc32)
k
#push-options "--z3rlimit 32"
inline_for_extraction
let read_sum
(#kt: parser_kind)
(t: sum)
(p: parser kt (sum_repr_type t))
(p32: leaf_reader (parse_enum_key p (sum_enum t)))
(j: jumper p)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (leaf_reader (dsnd (pc x)))))
(destr: dep_enum_destr (sum_enum t) (read_sum_cases_t t pc))
: Tot (leaf_reader (parse_sum t p pc))
=
fun #_ #_ input pos ->
let h = HST.get () in
valid_facts (parse_sum t p pc) h input pos;
parse_sum_eq' t p pc (bytes_of_slice_from h input pos);
valid_facts (parse_enum_key p (sum_enum t)) h input pos;
let k = p32 input pos in
let pos' = jump_enum_key j (sum_enum t) input pos in
valid_facts (parse_sum_cases' t pc k) h input pos' ;
read_sum_cases t pc pc32 destr k input pos'
#pop-options
inline_for_extraction
let serialize32_sum_cases_t
(t: sum)
(#pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(sc: ((x: sum_key t) -> Tot (serializer (dsnd (pc x)))))
(k: sum_key t)
: Tot Type
= serializer32 (serialize_sum_cases t pc sc k)
let serialize32_sum_cases_t_eq
(t: sum)
(#pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(sc: ((x: sum_key t) -> Tot (serializer (dsnd (pc x)))))
(k: sum_key t)
(x y: serialize32_sum_cases_t t sc k)
: GTot Type0
= True
inline_for_extraction
let serialize32_sum_cases_t_if
(t: sum)
(#pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(sc: ((x: sum_key t) -> Tot (serializer (dsnd (pc x)))))
(k: sum_key t)
: Tot (if_combinator _ (serialize32_sum_cases_t_eq t sc k))
= fun cond (sv_true: (cond_true cond -> Tot (serialize32_sum_cases_t t sc k))) (sv_false: (cond_false cond -> Tot (serialize32_sum_cases_t t sc k))) x #rrel #rel b pos ->
if cond
then (sv_true () x b pos)
else (sv_false () x b pos)
inline_for_extraction
let serialize32_sum_cases_aux
(t: sum)
(#pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(sc: ((x: sum_key t) -> Tot (serializer (dsnd (pc x)))))
(sc32: ((x: sum_key t) -> Tot (serializer32 (sc x))))
(k: sum_key t)
: Tot (serializer32 (serialize_sum_cases t pc sc k))
= fun x #rrel #rel b pos ->
[@inline_let] let _ =
Classical.forall_intro (parse_sum_cases_eq' t pc k);
synth_sum_case_injective t k;
synth_sum_case_inverse t k
in
serialize32_synth
(sc32 k)
(synth_sum_case t k)
(synth_sum_case_recip t k)
(fun x -> synth_sum_case_recip t k x)
()
x
b
pos
inline_for_extraction
let serialize32_sum_cases
(t: sum)
(#pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(sc: ((x: sum_key t) -> Tot (serializer (dsnd (pc x)))))
(sc32: ((x: sum_key t) -> Tot (serializer32 (sc x))))
(destr: dep_enum_destr (sum_enum t) (serialize32_sum_cases_t t sc))
(k: sum_key t)
: Tot (serializer32 (serialize_sum_cases t pc sc k))
= destr
_
(serialize32_sum_cases_t_if t sc)
(fun _ _ -> ())
(fun _ _ _ _ -> ())
(serialize32_sum_cases_aux t sc sc32)
k
inline_for_extraction
let serialize32_sum
(#kt: parser_kind)
(t: sum)
(#p: parser kt (sum_repr_type t))
(s: serializer p {kt.parser_kind_subkind == Some ParserStrong})
(s32: serializer32 (serialize_enum_key _ s (sum_enum t)))
(#pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(sc: ((x: sum_key t) -> Tot (serializer (dsnd (pc x)))))
(sc32: ((x: sum_key t) -> Tot (serializer32 (sc x))))
(destr: dep_enum_destr (sum_enum t) (serialize32_sum_cases_t t sc))
: Tot (serializer32 (serialize_sum t s sc))
= fun x #rrel #rel b pos ->
serialize_sum_eq t s sc x;
let tg = sum_tag_of_data t x in
serialize32_nondep_then_aux s32 (serialize32_sum_cases t sc sc32 destr tg) tg x b pos
let clens_sum_tag
(s: sum)
: Tot (clens (sum_type s) (sum_key s))
= {
clens_cond = (fun _ -> True);
clens_get = sum_tag_of_data s;
}
let gaccessor_sum_tag
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
: Tot (gaccessor (parse_sum t p pc) (parse_enum_key p (sum_enum t)) (clens_sum_tag t))
= gaccessor_tagged_union_tag
(parse_enum_key p (sum_enum t))
(sum_tag_of_data t)
(parse_sum_cases t pc)
inline_for_extraction
let accessor_sum_tag
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
: Tot (accessor (gaccessor_sum_tag t p pc))
= accessor_tagged_union_tag
(parse_enum_key p (sum_enum t))
(sum_tag_of_data t)
(parse_sum_cases t pc)
let clens_sum_payload
(s: sum)
(k: sum_key s)
: Tot (clens (sum_type s) (sum_type_of_tag s k))
= {
clens_cond = (fun (x: sum_type s) -> sum_tag_of_data s x == k);
clens_get = (fun (x: sum_type s) -> synth_sum_case_recip s k x <: Ghost (sum_type_of_tag s k) (requires (sum_tag_of_data s x == k)) (ensures (fun _ -> True)));
}
#push-options "--z3rlimit 32"
let gaccessor_clens_sum_payload'
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (gaccessor' (parse_sum t p pc) (dsnd (pc k)) (clens_sum_payload t k))
= fun (input: bytes) ->
parse_sum_eq'' t p pc input;
let res =
match parse p input with
| Some (_, consumed) ->
synth_sum_case_inverse t k;
synth_sum_case_injective t k;
synth_injective_synth_inverse_synth_inverse_recip (synth_sum_case t k) (synth_sum_case_recip t k) ();
(consumed)
| _ -> 0 // dummy
in
(res <: (res: _ { gaccessor_post' (parse_sum t p pc) (dsnd (pc k)) (clens_sum_payload t k) input res } ))
#push-options "--z3rlimit 64"
let gaccessor_clens_sum_payload_injective
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
(sl sl' : bytes)
: Lemma
(requires (
gaccessor_pre (parse_sum t p pc) (dsnd (pc k)) (clens_sum_payload t k) sl /\
gaccessor_pre (parse_sum t p pc) (dsnd (pc k)) (clens_sum_payload t k) sl' /\
injective_precond (parse_sum t p pc) sl sl'
))
(ensures (gaccessor_clens_sum_payload' t p pc k sl == gaccessor_clens_sum_payload' t p pc k sl'))
= parse_sum_eq'' t p pc sl;
parse_sum_eq'' t p pc sl' ;
parse_injective (parse_sum t p pc) sl sl' ;
parse_injective p sl sl'
#pop-options
let gaccessor_clens_sum_payload_no_lookahead
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
(sl sl' : bytes)
: Lemma
(requires (
(parse_sum_kind kt t pc).parser_kind_subkind == Some ParserStrong /\
gaccessor_pre (parse_sum t p pc) (dsnd (pc k)) (clens_sum_payload t k) sl /\
gaccessor_pre (parse_sum t p pc) (dsnd (pc k)) (clens_sum_payload t k) sl' /\
no_lookahead_on_precond (parse_sum t p pc) sl sl'
))
(ensures (gaccessor_clens_sum_payload' t p pc k sl == gaccessor_clens_sum_payload' t p pc k sl'))
= parse_sum_eq'' t p pc sl;
parse_sum_eq'' t p pc sl' ;
parse_strong_prefix (parse_sum t p pc) sl sl' ;
parse_injective p sl sl'
let gaccessor_clens_sum_payload
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (gaccessor (parse_sum t p pc) (dsnd (pc k)) (clens_sum_payload t k))
= Classical.forall_intro_2 (fun x -> Classical.move_requires (gaccessor_clens_sum_payload_injective t p pc k x));
Classical.forall_intro_2 (fun x -> Classical.move_requires (gaccessor_clens_sum_payload_no_lookahead t p pc k x));
gaccessor_prop_equiv (parse_sum t p pc) (dsnd (pc k)) (clens_sum_payload t k) (gaccessor_clens_sum_payload' t p pc k);
gaccessor_clens_sum_payload' t p pc k
inline_for_extraction
let accessor_clens_sum_payload'
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(j: jumper p)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: HST.Stack U32.t
(requires (fun h ->
valid (parse_sum t p pc) h input pos /\
(clens_sum_payload t k).clens_cond (contents (parse_sum t p pc) h input pos)
))
(ensures (fun h pos' h' ->
B.modifies B.loc_none h h' /\
pos' == slice_access h (gaccessor_clens_sum_payload t p pc k) input pos
))
=
let h = HST.get () in
[@inline_let]
let _ =
let pos' = get_valid_pos (parse_sum t p pc) h input pos in
let large = bytes_of_slice_from h input pos in
slice_access_eq h (gaccessor_clens_sum_payload t p pc k) input pos;
valid_facts (parse_sum t p pc) h input pos;
parse_sum_eq'' t p pc large;
valid_facts p h input pos
in
j input pos
#pop-options
inline_for_extraction
let accessor_clens_sum_payload
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(j: jumper p)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (accessor (gaccessor_clens_sum_payload t p pc k))
= fun #rrel #rel -> accessor_clens_sum_payload' t j pc k #rrel #rel
let clens_sum_cases_payload
(s: sum)
(k: sum_key s)
: Tot (clens (sum_cases s k) (sum_type_of_tag s k))
= {
clens_cond = (fun (x: sum_cases s k) -> True);
clens_get = (fun (x: sum_cases s k) -> synth_sum_case_recip s k x <: Ghost (sum_type_of_tag s k) (requires (True)) (ensures (fun _ -> True)));
}
let gaccessor_clens_sum_cases_payload
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (gaccessor (parse_sum_cases' t pc k) (dsnd (pc k)) (clens_sum_cases_payload t k))
= synth_sum_case_injective t k;
synth_sum_case_inverse t k;
synth_injective_synth_inverse_synth_inverse_recip (synth_sum_case t k) (synth_sum_case_recip t k) ();
gaccessor_ext
(gaccessor_synth (dsnd (pc k)) (synth_sum_case t k) (synth_sum_case_recip t k) ())
(clens_sum_cases_payload t k)
()
inline_for_extraction
let accessor_clens_sum_cases_payload
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (accessor (gaccessor_clens_sum_cases_payload t pc k))
= [@inline_let]
let _ =
synth_sum_case_injective t k;
synth_sum_case_inverse t k;
synth_injective_synth_inverse_synth_inverse_recip (synth_sum_case t k) (synth_sum_case_recip t k) ()
in
accessor_ext
(accessor_synth (dsnd (pc k)) (synth_sum_case t k) (synth_sum_case_recip t k) ())
(clens_sum_cases_payload t k)
()
inline_for_extraction
let validate_dsum_cases_t
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(#k: parser_kind)
(g: parser k (dsum_type_of_unknown_tag s))
(x: dsum_key s)
: Tot Type
= validator (parse_dsum_cases' s f g x)
let validate_dsum_cases_eq
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(#k: parser_kind)
(g: parser k (dsum_type_of_unknown_tag s))
(x: dsum_key s)
(v1 v2 : validate_dsum_cases_t s f g x)
: GTot Type0
= True
inline_for_extraction
let validate_dsum_cases_if'
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(#k: parser_kind)
(g: parser k (dsum_type_of_unknown_tag s))
(x: dsum_key s)
(cond: bool)
(ift: (cond_true cond -> Tot (validate_dsum_cases_t s f g x)))
(iff: (cond_false cond -> Tot (validate_dsum_cases_t s f g x)))
: Tot (validate_dsum_cases_t s f g x)
= fun #rrel #rel input len ->
if cond
then (ift () <: validate_dsum_cases_t s f g x) input len
else (iff () <: validate_dsum_cases_t s f g x) input len
inline_for_extraction
let validate_dsum_cases_if
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(#k: parser_kind)
(g: parser k (dsum_type_of_unknown_tag s))
(x: dsum_key s)
: Tot (if_combinator _ (validate_dsum_cases_eq s f g x))
= validate_dsum_cases_if' s f g x
inline_for_extraction
let validate_dsum_cases'
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(f' : (x: dsum_known_key s) -> Tot (validator (dsnd (f x))))
(#k: parser_kind)
(#g: parser k (dsum_type_of_unknown_tag s))
(g' : validator g)
(x: dsum_key s)
: Tot (validate_dsum_cases_t s f g x)
= [@inline_let]
let _ = synth_dsum_case_injective s x in
match x with
| Known x' -> validate_synth (f' x') (synth_dsum_case s (Known x')) () <: validator (parse_dsum_cases' s f g x)
| Unknown x' -> validate_synth g' (synth_dsum_case s (Unknown x')) () <: validator (parse_dsum_cases' s f g x)
inline_for_extraction
let validate_dsum_cases'_destr
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(f' : (x: dsum_known_key s) -> Tot (validator (dsnd (f x))))
(#k: parser_kind)
(#g: parser k (dsum_type_of_unknown_tag s))
(g' : validator g)
(destr: dep_enum_destr _ (fun k -> validate_dsum_cases_t s f g (Known k)))
(x: dsum_key s)
: Tot (validate_dsum_cases_t s f g x)
= fun #rrel #rel input pos ->
match x with
| Known k ->
destr
_
(fun k -> validate_dsum_cases_if s f g (Known k))
(fun _ _ -> ())
(fun _ _ _ _ -> ())
(fun k -> validate_dsum_cases' s f f' g' (Known k))
k
input
pos
| Unknown r -> validate_dsum_cases' s f f' g' (Unknown r) input pos
inline_for_extraction
let validate_dsum_cases
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(f' : (x: dsum_known_key s) -> Tot (validator (dsnd (f x))))
(#k: parser_kind)
(#g: parser k (dsum_type_of_unknown_tag s))
(g' : validator g)
(destr: dep_enum_destr _ (fun k -> validate_dsum_cases_t s f g (Known k)))
(x: dsum_key s)
: Tot (validator (parse_dsum_cases s f g x))
= fun #rrel #rel input pos ->
let h = HST.get () in
[@inline_let]
let _ =
valid_facts (parse_dsum_cases' s f g x) h input (uint64_to_uint32 pos);
valid_facts (parse_dsum_cases s f g x) h input (uint64_to_uint32 pos);
parse_dsum_cases_eq' s f g x (bytes_of_slice_from h input (uint64_to_uint32 pos))
in
validate_dsum_cases'_destr s f f' g' destr x input pos
#push-options "--z3rlimit 40"
inline_for_extraction
let validate_dsum
(#kt: parser_kind)
(t: dsum)
(#p: parser kt (dsum_repr_type t))
(v: validator p)
(p32: leaf_reader p)
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(f32: (x: dsum_known_key t) -> Tot (validator (dsnd (f x))))
(#k': parser_kind)
(#g: parser k' (dsum_type_of_unknown_tag t))
(g32: validator g)
(destr: dep_maybe_enum_destr_t (dsum_enum t) (validate_dsum_cases_t t f g))
: Tot (validator (parse_dsum t p f g))
= fun #rrel #rel input pos ->
let h = HST.get () in
[@inline_let]
let _ = parse_dsum_eq' t p f g (bytes_of_slice_from h input (uint64_to_uint32 pos)) in
[@inline_let]
let _ = valid_facts (parse_dsum t p f g) h input (uint64_to_uint32 pos) in
[@inline_let]
let _ = valid_facts p h input (uint64_to_uint32 pos) in
let pos_after_tag = v input pos in
if is_error pos_after_tag
then pos_after_tag
else
let tg = p32 input (uint64_to_uint32 pos) in
[@inline_let]
let _ = valid_facts (parse_dsum_cases' t f g (maybe_enum_key_of_repr (dsum_enum t) tg)) h input (uint64_to_uint32 pos_after_tag) in
destr (validate_dsum_cases_eq t f g) (validate_dsum_cases_if t f g) (fun _ _ -> ()) (fun _ _ _ _ -> ()) (validate_dsum_cases' t f f32 g32) tg input pos_after_tag
#pop-options
#reset-options "--z3rlimit 64 --z3cliopt smt.arith.nl=false --initial_ifuel 8 --max_ifuel 8 --initial_fuel 2 --max_fuel 2"
let valid_dsum_intro_known
(h: HS.mem)
(t: dsum)
(#kt: parser_kind)
(p: parser kt (dsum_repr_type t))
(f: ((x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x))))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: Lemma
(requires (
valid (parse_maybe_enum_key p (dsum_enum t)) h input pos /\ (
let k' = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
Known? k' /\ (
let Known k = k' in
valid (dsnd (f k)) h input (get_valid_pos (parse_maybe_enum_key p (dsum_enum t)) h input pos)
))))
(ensures (
let Known k = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
let pos_payload = get_valid_pos (parse_maybe_enum_key p (dsum_enum t)) h input pos in
valid_content_pos
(parse_dsum t p f g) h input pos
(synth_dsum_case t (Known k) (contents (dsnd (f k)) h input pos_payload))
(get_valid_pos (dsnd (f k)) h input pos_payload)
))
= valid_facts (parse_maybe_enum_key p (dsum_enum t)) h input pos;
let Known k = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
let pos_payload = get_valid_pos (parse_maybe_enum_key p (dsum_enum t)) h input pos in
valid_facts (dsnd (f k)) h input pos_payload;
valid_facts (parse_dsum t p f g) h input pos;
parse_dsum_eq t p f g (bytes_of_slice_from h input pos) | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"LowStar.Buffer.fst.checked",
"LowParse.Spec.Sum.fst.checked",
"LowParse.Low.Enum.fst.checked",
"FStar.UInt64.fsti.checked",
"FStar.UInt32.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Int.Cast.fst.checked",
"FStar.HyperStack.ST.fsti.checked",
"FStar.HyperStack.fst.checked",
"FStar.Classical.fsti.checked"
],
"interface_file": false,
"source_file": "LowParse.Low.Sum.fst"
} | [
{
"abbrev": true,
"full_module": "FStar.HyperStack",
"short_module": "HS"
},
{
"abbrev": true,
"full_module": "FStar.UInt64",
"short_module": "U64"
},
{
"abbrev": true,
"full_module": "FStar.Int.Cast",
"short_module": "Cast"
},
{
"abbrev": true,
"full_module": "LowStar.Buffer",
"short_module": "B"
},
{
"abbrev": true,
"full_module": "FStar.HyperStack.ST",
"short_module": "HST"
},
{
"abbrev": true,
"full_module": "FStar.UInt32",
"short_module": "U32"
},
{
"abbrev": false,
"full_module": "LowParse.Spec.Sum",
"short_module": null
},
{
"abbrev": false,
"full_module": "LowParse.Low.Enum",
"short_module": null
},
{
"abbrev": false,
"full_module": "LowParse.Low",
"short_module": null
},
{
"abbrev": false,
"full_module": "LowParse.Low",
"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",
"short_module": null
}
] | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 8,
"max_fuel": 2,
"max_ifuel": 8,
"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_elim_box": false,
"smtencoding_l_arith_repr": "boxwrap",
"smtencoding_nl_arith_repr": "boxwrap",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": true,
"z3cliopt": [
"smt.arith.nl=false"
],
"z3refresh": false,
"z3rlimit": 64,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | false |
h: FStar.Monotonic.HyperStack.mem ->
t: LowParse.Spec.Sum.dsum ->
p: LowParse.Spec.Base.parser kt (LowParse.Spec.Sum.dsum_repr_type t) ->
f:
(x: LowParse.Spec.Sum.dsum_known_key t
-> Prims.dtuple2 LowParse.Spec.Base.parser_kind
(fun k -> LowParse.Spec.Base.parser k (LowParse.Spec.Sum.dsum_type_of_known_tag t x))) ->
g: LowParse.Spec.Base.parser ku (LowParse.Spec.Sum.dsum_type_of_unknown_tag t) ->
input: LowParse.Slice.slice rrel rel ->
pos: FStar.UInt32.t
-> FStar.Pervasives.Lemma
(requires
LowParse.Low.Base.Spec.valid (LowParse.Spec.Enum.parse_maybe_enum_key p
(LowParse.Spec.Sum.dsum_enum t))
h
input
pos /\
(let k' =
LowParse.Low.Base.Spec.contents (LowParse.Spec.Enum.parse_maybe_enum_key p
(LowParse.Spec.Sum.dsum_enum t))
h
input
pos
in
Unknown? k' /\
LowParse.Low.Base.Spec.valid g
h
input
(LowParse.Low.Base.Spec.get_valid_pos (LowParse.Spec.Enum.parse_maybe_enum_key p
(LowParse.Spec.Sum.dsum_enum t))
h
input
pos)))
(ensures
(let _ =
LowParse.Low.Base.Spec.contents (LowParse.Spec.Enum.parse_maybe_enum_key p
(LowParse.Spec.Sum.dsum_enum t))
h
input
pos
in
(let LowParse.Spec.Enum.Unknown #_ #_ #_ r = _ in
let pos_payload =
LowParse.Low.Base.Spec.get_valid_pos (LowParse.Spec.Enum.parse_maybe_enum_key p
(LowParse.Spec.Sum.dsum_enum t))
h
input
pos
in
LowParse.Low.Base.Spec.valid_content_pos (LowParse.Spec.Sum.parse_dsum t p f g)
h
input
pos
(LowParse.Spec.Sum.synth_dsum_case t
(LowParse.Spec.Enum.Unknown r)
(LowParse.Low.Base.Spec.contents g h input pos_payload))
(LowParse.Low.Base.Spec.get_valid_pos g h input pos_payload))
<:
Type0)) | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"FStar.Monotonic.HyperStack.mem",
"LowParse.Spec.Sum.dsum",
"LowParse.Spec.Base.parser_kind",
"LowParse.Spec.Base.parser",
"LowParse.Spec.Sum.dsum_repr_type",
"LowParse.Spec.Sum.dsum_known_key",
"Prims.dtuple2",
"LowParse.Spec.Sum.dsum_type_of_known_tag",
"LowParse.Spec.Sum.dsum_type_of_unknown_tag",
"LowParse.Slice.srel",
"LowParse.Bytes.byte",
"LowParse.Slice.slice",
"FStar.UInt32.t",
"LowParse.Spec.Enum.unknown_enum_repr",
"LowParse.Spec.Sum.dsum_key_type",
"LowParse.Spec.Sum.dsum_enum",
"LowParse.Spec.Sum.parse_dsum_eq",
"LowParse.Slice.bytes_of_slice_from",
"Prims.unit",
"LowParse.Low.Base.Spec.valid_facts",
"LowParse.Spec.Sum.parse_dsum_kind",
"LowParse.Spec.Sum.dsum_type",
"LowParse.Spec.Sum.parse_dsum",
"LowParse.Low.Base.Spec.get_valid_pos",
"LowParse.Spec.Enum.maybe_enum_key",
"LowParse.Spec.Enum.parse_maybe_enum_key",
"LowParse.Low.Base.Spec.contents",
"Prims.l_and",
"LowParse.Low.Base.Spec.valid",
"Prims.b2t",
"LowParse.Spec.Enum.uu___is_Unknown",
"Prims.squash",
"LowParse.Low.Base.Spec.valid_content_pos",
"LowParse.Spec.Sum.synth_dsum_case",
"LowParse.Spec.Enum.Unknown",
"Prims.Nil",
"FStar.Pervasives.pattern"
] | [] | false | false | true | false | false | let valid_dsum_intro_unknown
(h: HS.mem)
(t: dsum)
(#kt: parser_kind)
(p: parser kt (dsum_repr_type t))
(f: (x: dsum_known_key t -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x))))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: Lemma
(requires
(valid (parse_maybe_enum_key p (dsum_enum t)) h input pos /\
(let k' = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
Unknown? k' /\
valid g h input (get_valid_pos (parse_maybe_enum_key p (dsum_enum t)) h input pos))))
(ensures
(let Unknown r = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
let pos_payload = get_valid_pos (parse_maybe_enum_key p (dsum_enum t)) h input pos in
valid_content_pos (parse_dsum t p f g)
h
input
pos
(synth_dsum_case t (Unknown r) (contents g h input pos_payload))
(get_valid_pos g h input pos_payload))) =
| valid_facts (parse_maybe_enum_key p (dsum_enum t)) h input pos;
let Unknown r = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
let pos_payload = get_valid_pos (parse_maybe_enum_key p (dsum_enum t)) h input pos in
valid_facts g h input pos_payload;
valid_facts (parse_dsum t p f g) h input pos;
parse_dsum_eq t p f g (bytes_of_slice_from h input pos) | false |
Vale.Curve25519.Fast_defs.fst | Vale.Curve25519.Fast_defs.pow2_384 | val pow2_384 : Prims.int | let pow2_384 = 0x1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000 | {
"file_name": "vale/code/crypto/ecc/curve25519/Vale.Curve25519.Fast_defs.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 121,
"end_line": 13,
"start_col": 7,
"start_line": 13
} | module Vale.Curve25519.Fast_defs
open Vale.Def.Words_s
open Vale.Def.Types_s
open FStar.Mul
unfold let pow2_192 = 0x1000000000000000000000000000000000000000000000000
let _ = assert_norm (pow2 192 = pow2_192)
unfold let pow2_256 = 0x10000000000000000000000000000000000000000000000000000000000000000
let _ = assert_norm (pow2 256 = pow2_256)
unfold let pow2_320 = 0x100000000000000000000000000000000000000000000000000000000000000000000000000000000 | {
"checked_file": "/",
"dependencies": [
"Vale.Def.Words_s.fsti.checked",
"Vale.Def.Types_s.fst.checked",
"Vale.Curve25519.Fast_lemmas_internal.fsti.checked",
"Vale.Arch.Types.fsti.checked",
"prims.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked"
],
"interface_file": false,
"source_file": "Vale.Curve25519.Fast_defs.fst"
} | [
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Def.Types_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Def.Words_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Curve25519",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Curve25519",
"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",
"short_module": null
}
] | {
"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_elim_box": true,
"smtencoding_l_arith_repr": "native",
"smtencoding_nl_arith_repr": "wrapped",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": false,
"z3cliopt": [
"smt.arith.nl=false",
"smt.QI.EAGER_THRESHOLD=100",
"smt.CASE_SPLIT=3"
],
"z3refresh": false,
"z3rlimit": 5,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | false | Prims.int | Prims.Tot | [
"total"
] | [] | [] | [] | false | false | false | true | false | let pow2_384 =
| 0x1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000 | false |
|
LowParse.Low.Sum.fst | LowParse.Low.Sum.accessor_clens_dsum_payload | val accessor_clens_dsum_payload
(#kt: parser_kind)
(t: dsum)
(#p: parser kt (dsum_repr_type t))
(j: jumper p)
(f: (x: dsum_known_key t -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x))))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
(k: dsum_key t)
: Tot (accessor (gaccessor_clens_dsum_payload t p f g k)) | val accessor_clens_dsum_payload
(#kt: parser_kind)
(t: dsum)
(#p: parser kt (dsum_repr_type t))
(j: jumper p)
(f: (x: dsum_known_key t -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x))))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
(k: dsum_key t)
: Tot (accessor (gaccessor_clens_dsum_payload t p f g k)) | let accessor_clens_dsum_payload
(#kt: parser_kind)
(t: dsum)
(#p: parser kt (dsum_repr_type t))
(j: jumper p)
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
(k: dsum_key t)
: Tot (accessor (gaccessor_clens_dsum_payload t p f g k))
= fun #rrel #rel -> accessor_clens_dsum_payload' t j f g k #rrel #rel | {
"file_name": "src/lowparse/LowParse.Low.Sum.fst",
"git_rev": "00217c4a89f5ba56002ba9aa5b4a9d5903bfe9fa",
"git_url": "https://github.com/project-everest/everparse.git",
"project_name": "everparse"
} | {
"end_col": 69,
"end_line": 1951,
"start_col": 0,
"start_line": 1941
} | module LowParse.Low.Sum
include LowParse.Low.Enum
include LowParse.Spec.Sum
module U32 = FStar.UInt32
module HST = FStar.HyperStack.ST
module B = LowStar.Buffer
module Cast = FStar.Int.Cast
module U64 = FStar.UInt64
inline_for_extraction
let validate_sum_cases_aux
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(vc: ((x: sum_key t) -> Tot (validator (dsnd (pc x)))))
(k: sum_key t)
: Tot (validator (parse_sum_cases t pc k))
= [@inline_let]
let _ = synth_sum_case_injective t k in
validate_synth
(validate_weaken
(weaken_parse_cases_kind t pc)
(vc k)
()
)
(synth_sum_case t k)
()
inline_for_extraction
let validate_sum_cases_t
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot Type
= validator (parse_sum_cases t pc k)
let validate_sum_cases_t_eq
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
(x y : validate_sum_cases_t t pc k)
: GTot Type0
= True
inline_for_extraction
let validate_sum_cases_t_if
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (if_combinator _ (validate_sum_cases_t_eq t pc k))
= fun cond (sv_true: cond_true cond -> Tot (validate_sum_cases_t t pc k)) (sv_false: cond_false cond -> Tot (validate_sum_cases_t t pc k)) #rrel #rel input pos ->
if cond
then sv_true () input pos
else sv_false () input pos
inline_for_extraction
let validate_sum_cases
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(vc: ((x: sum_key t) -> Tot (validator (dsnd (pc x)))))
(destr: dep_enum_destr (sum_enum t) (validate_sum_cases_t t pc))
(k: sum_key t)
: Tot (validator (parse_sum_cases t pc k))
= destr
_
(validate_sum_cases_t_if t pc)
(fun _ _ -> ())
(fun _ _ _ _ -> ())
(validate_sum_cases_aux t pc vc)
k
inline_for_extraction
let validate_sum_aux_payload_t
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
: Tot Type
= (#rrel: _) -> (#rel: _) ->
(input: slice rrel rel) ->
(pos: U64.t) ->
HST.Stack U64.t
(requires (fun h -> live_slice h input /\ U64.v pos <= U32.v input.len))
(ensures (fun h res h' ->
B.modifies B.loc_none h h' /\ (
match k with
| Unknown _ -> is_error res
| Known k' ->
if is_success res
then
valid_pos (dsnd (pc k')) h input (uint64_to_uint32 pos) (uint64_to_uint32 res)
else
(~ (valid (dsnd (pc k')) h input (uint64_to_uint32 pos)))
)))
let validate_sum_aux_payload_eq
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
: Tot (validate_sum_aux_payload_t t pc k -> validate_sum_aux_payload_t t pc k -> GTot Type0)
= fun _ _ -> True
inline_for_extraction
let validate_sum_aux_payload_if'
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
(cond: bool)
(ift: ((cond_true cond) -> Tot (validate_sum_aux_payload_t t pc k)))
(iff: ((cond_false cond) -> Tot (validate_sum_aux_payload_t t pc k)))
: Tot (validate_sum_aux_payload_t t pc k)
= fun #rrel #rel input pos ->
if cond
then begin
(ift () <: validate_sum_aux_payload_t t pc k) input pos
end else
(iff () <: validate_sum_aux_payload_t t pc k) input pos
inline_for_extraction
let validate_sum_aux_payload_if
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
: Tot (if_combinator _ (validate_sum_aux_payload_eq t pc k))
= validate_sum_aux_payload_if' t pc k
#push-options "--z3rlimit 64 --z3cliopt smt.arith.nl=false --using_facts_from '* -FStar.Int.Cast -LowParse.BitFields'"
// --query_stats --smtencoding.elim_box true --smtencoding.l_arith_repr native --z3refresh"
inline_for_extraction
let validate_sum_aux
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(v: validator p)
(p32: leaf_reader p)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(v_payload: ((k: sum_repr_type t)) -> Tot (validate_sum_aux_payload_t t pc (maybe_enum_key_of_repr (sum_enum t) k)))
: Tot (validator (parse_sum t p pc))
= fun #rrel #rel input pos ->
let h = HST.get () in
[@inline_let]
let _ = parse_sum_eq'' t p pc (bytes_of_slice_from h input (uint64_to_uint32 pos)) in
[@inline_let]
let _ = valid_facts (parse_sum t p pc) h input (uint64_to_uint32 pos) in
[@inline_let]
let _ = valid_facts p h input (uint64_to_uint32 pos) in
let len_after_tag = v input pos in
if is_error len_after_tag
then len_after_tag
else begin
let h1 = HST.get () in
let k' = p32 input (uint64_to_uint32 pos) in
[@inline_let]
let _ =
match maybe_enum_key_of_repr (sum_enum t) k' with
| Known k -> valid_facts (dsnd (pc k)) h input (uint64_to_uint32 len_after_tag)
| _ -> ()
in
v_payload k' input len_after_tag
end
#pop-options
inline_for_extraction
let validate_sum_aux_payload'
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (validator (dsnd (pc x)))))
(k: maybe_enum_key (sum_enum t))
: Tot (validate_sum_aux_payload_t t pc k)
= fun #rrel #rel input pos ->
match k with
| Known k ->
[@inline_let]
let _ = synth_sum_case_injective t k in
pc32 k input pos
// validate_synth (pc32 k) (synth_sum_case t k) () input pos
| _ -> validator_error_generic
inline_for_extraction
let validate_sum_aux_payload
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (validator (dsnd (pc x)))))
(destr: dep_maybe_enum_destr_t (sum_enum t) (validate_sum_aux_payload_t t pc))
(k: sum_repr_type t)
: Tot (validate_sum_aux_payload_t t pc (maybe_enum_key_of_repr (sum_enum t) k))
= destr (validate_sum_aux_payload_eq t pc) (validate_sum_aux_payload_if t pc) (fun _ _ -> ()) (fun _ _ _ _ -> ()) (validate_sum_aux_payload' t pc pc32) k
inline_for_extraction
let validate_sum
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(v: validator p)
(p32: leaf_reader p)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (validator (dsnd (pc x)))))
(destr: dep_maybe_enum_destr_t (sum_enum t) (validate_sum_aux_payload_t t pc))
: Tot (validator (parse_sum t p pc))
= validate_sum_aux t v p32 pc (validate_sum_aux_payload t pc pc32 destr)
module HS = FStar.HyperStack
#push-options "--z3rlimit 256 --z3cliopt smt.arith.nl=false --initial_ifuel 8 --max_ifuel 8 --initial_fuel 2 --max_fuel 2"
#restart-solver
let valid_sum_intro
(h: HS.mem)
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: Lemma
(requires (
valid (parse_enum_key p (sum_enum t)) h input pos /\ (
let k = contents (parse_enum_key p (sum_enum t)) h input pos in
valid (dsnd (pc k)) h input (get_valid_pos (parse_enum_key p (sum_enum t)) h input pos)
)))
(ensures (
let k = contents (parse_enum_key p (sum_enum t)) h input pos in
let pos_payload = get_valid_pos (parse_enum_key p (sum_enum t)) h input pos in
valid_content_pos
(parse_sum t p pc) h input pos
(synth_sum_case t k (contents (dsnd (pc k)) h input pos_payload))
(get_valid_pos (dsnd (pc k)) h input pos_payload)
))
= valid_facts (parse_enum_key p (sum_enum t)) h input pos;
let k = contents (parse_enum_key p (sum_enum t)) h input pos in
let pos_payload = get_valid_pos (parse_enum_key p (sum_enum t)) h input pos in
valid_facts (dsnd (pc k)) h input pos_payload;
valid_facts (parse_sum t p pc) h input pos;
parse_sum_eq t p pc (bytes_of_slice_from h input pos)
#pop-options
inline_for_extraction
let finalize_sum_case
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(s: serializer p)
(w: leaf_writer_strong s)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(destr: enum_repr_of_key'_t (sum_enum t))
(k: sum_key t)
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: HST.Stack unit
(requires (fun h ->
let len_tag = serialized_length (serialize_enum_key _ s (sum_enum t)) k in
U32.v pos + len_tag < 4294967296 /\ (
let pos_payload = pos `U32.add` U32.uint_to_t len_tag in
valid (dsnd (pc k)) h input pos_payload /\
writable input.base (U32.v pos) (U32.v pos_payload) h
)))
(ensures (fun h _ h' ->
let len_tag = serialized_length (serialize_enum_key _ s (sum_enum t)) k in
let pos_payload = pos `U32.add` U32.uint_to_t len_tag in
B.modifies (loc_slice_from_to input pos pos_payload) h h' /\
valid_content_pos (parse_sum t p pc) h' input pos (synth_sum_case t k (contents (dsnd (pc k)) h input pos_payload)) (get_valid_pos (dsnd (pc k)) h input pos_payload)
))
= let pos1 = write_enum_key w (sum_enum t) destr k input pos in
let h = HST.get () in
[@inline_let]
let _ = valid_sum_intro h t p pc input pos in
()
inline_for_extraction
let jump_sum_cases_aux
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(vc: ((x: sum_key t) -> Tot (jumper (dsnd (pc x)))))
(k: sum_key t)
: Tot (jumper (parse_sum_cases t pc k))
= [@inline_let]
let _ = synth_sum_case_injective t k in
jump_synth
(jump_weaken
(weaken_parse_cases_kind t pc)
(vc k)
()
)
(synth_sum_case t k)
()
inline_for_extraction
let jump_sum_cases_t
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot Type
= jumper (parse_sum_cases t pc k)
let jump_sum_cases_t_eq
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
(x y : jump_sum_cases_t t pc k)
: GTot Type0
= True
inline_for_extraction
let jump_sum_cases_t_if
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (if_combinator _ (jump_sum_cases_t_eq t pc k))
= fun cond (sv_true: cond_true cond -> Tot (jump_sum_cases_t t pc k)) (sv_false: cond_false cond -> Tot (jump_sum_cases_t t pc k)) #rrel #rel input pos ->
if cond
then sv_true () input pos
else sv_false () input pos
inline_for_extraction
let jump_sum_cases
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(vc: ((x: sum_key t) -> Tot (jumper (dsnd (pc x)))))
(destr: dep_enum_destr (sum_enum t) (jump_sum_cases_t t pc))
(k: sum_key t)
: Tot (jumper (parse_sum_cases t pc k))
= destr
_
(jump_sum_cases_t_if t pc)
(fun _ _ -> ())
(fun _ _ _ _ -> ())
(jump_sum_cases_aux t pc vc)
k
inline_for_extraction
let jump_sum_aux_payload_t
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
: Tot Type
= (#rrel: _) -> (#rel: _) ->
(input: slice rrel rel) ->
(pos: U32.t) ->
HST.Stack U32.t
(requires (fun h -> live_slice h input /\ U32.v pos <= U32.v input.len /\ (
match k with
| Unknown _ -> False
| Known k' -> valid (dsnd (pc k')) h input pos
)))
(ensures (fun h res h' ->
B.modifies B.loc_none h h' /\ (
match k with
| Unknown _ -> False
| Known k' ->
valid_pos (dsnd (pc k')) h input pos res
)))
let jump_sum_aux_payload_eq
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
: Tot (jump_sum_aux_payload_t t pc k -> jump_sum_aux_payload_t t pc k -> GTot Type0)
= fun _ _ -> True
inline_for_extraction
let jump_sum_aux_payload_if'
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
(cond: bool)
(ift: ((cond_true cond) -> Tot (jump_sum_aux_payload_t t pc k)))
(iff: ((cond_false cond) -> Tot (jump_sum_aux_payload_t t pc k)))
: Tot (jump_sum_aux_payload_t t pc k)
= fun #rrel #rel input pos ->
if cond
then begin
(ift () <: jump_sum_aux_payload_t t pc k) input pos
end else
(iff () <: jump_sum_aux_payload_t t pc k) input pos
inline_for_extraction
let jump_sum_aux_payload_if
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
: Tot (if_combinator _ (jump_sum_aux_payload_eq t pc k))
= jump_sum_aux_payload_if' t pc k
let parse_sum_eq3
(#kt: parser_kind)
(t: sum)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(input: bytes)
(k' : sum_repr_type t)
(consumed_k: consumed_length input)
: Lemma
(requires (Some? (parse (parse_sum t p pc) input) /\ parse p input == Some (k', consumed_k)))
(ensures (
let input_k = Seq.slice input consumed_k (Seq.length input) in
let k = maybe_enum_key_of_repr (sum_enum t) k' in
begin match k with
| Known k ->
Some? (parse (dsnd (pc k)) input_k)
| _ -> False
end
))
= parse_sum_eq'' t p pc input
let parse_sum_eq4
(#kt: parser_kind)
(t: sum)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(input: bytes)
(k' : sum_repr_type t)
(consumed_k: consumed_length input)
(consumed_payload: nat)
: Lemma
(requires (Some? (parse (parse_sum t p pc) input) /\ parse p input == Some (k', consumed_k) /\ (
let input_k = Seq.slice input consumed_k (Seq.length input) in
let k = maybe_enum_key_of_repr (sum_enum t) k' in
begin match k with
| Known k ->
Some? (parse (dsnd (pc k)) input_k) /\ (
let Some (_, consumed_payload') = parse (dsnd (pc k)) input_k in
consumed_payload' == consumed_payload
)
| _ -> False
end
)))
(ensures (
let Some (_, consumed) = parse (parse_sum t p pc) input in
consumed == consumed_k + consumed_payload
))
= parse_sum_eq'' t p pc input
#push-options "--z3rlimit 16"
let valid_sum_elim
(h: HS.mem)
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(#rrel: _) (#rel: _)
(input: slice rrel rel)
(pos: U32.t)
: Lemma
(requires (
valid (parse_sum t p pc) h input pos
))
(ensures (
valid p h input pos /\ (
let pos_payload = get_valid_pos p h input pos in
let k' = maybe_enum_key_of_repr (sum_enum t) (contents p h input pos) in
match k' with
| Known k ->
k == sum_tag_of_data t (contents (parse_sum t p pc) h input pos) /\
valid (dsnd (pc k)) h input pos_payload /\
valid_pos
(parse_sum t p pc) h input pos
(get_valid_pos (dsnd (pc k)) h input pos_payload)
| _ -> False
)))
= let sinput = bytes_of_slice_from h input pos in
let _ = parse_sum_eq'' t p pc sinput in
[@inline_let]
let _ = valid_facts (parse_sum t p pc) h input pos in
let Some (k', consumed_k) = parse p sinput in
let pos_after_tag = U32.uint_to_t (U32.v pos + consumed_k) in
[@inline_let]
let _ = valid_facts p h input pos in
assert (valid_content_pos p h input pos k' pos_after_tag);
match maybe_enum_key_of_repr (sum_enum t) k' with
| Known k -> valid_facts (dsnd (pc k)) h input pos_after_tag
| _ -> ()
#pop-options
let valid_sum_elim_tag
(h: HS.mem)
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: Lemma
(requires (
valid (parse_sum t p pc) h input pos
))
(ensures (
valid (parse_enum_key p (sum_enum t)) h input pos /\
contents (parse_enum_key p (sum_enum t)) h input pos == sum_tag_of_data t (contents (parse_sum t p pc) h input pos)
))
= let _ = parse_sum_eq' t p pc (bytes_of_slice_from h input pos) in
let _ = valid_facts (parse_sum t p pc) h input pos in
let _ = valid_facts (parse_enum_key p (sum_enum t)) h input pos in
()
inline_for_extraction
let read_sum_tag
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(p32: leaf_reader p)
(destr: dep_maybe_enum_destr_t (sum_enum t) (read_enum_key_t (sum_enum t)))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: HST.Stack (sum_key t)
(requires (fun h ->
valid (parse_sum t p pc) h input pos
))
(ensures (fun h res h' ->
B.modifies B.loc_none h h' /\
res == sum_tag_of_data t (contents (parse_sum t p pc) h input pos)
))
= let h = HST.get () in
[@inline_let] let _ = valid_sum_elim_tag h t p pc input pos in
read_enum_key p32 (sum_enum t) destr input pos
inline_for_extraction
let jump_sum_aux
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(v: jumper p)
(p32: leaf_reader p)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(v_payload: ((k: sum_repr_type t)) -> Tot (jump_sum_aux_payload_t t pc (maybe_enum_key_of_repr (sum_enum t) k)))
: Tot (jumper (parse_sum t p pc))
= fun #rrel #rel input pos ->
let h = HST.get () in
[@inline_let]
let _ = valid_sum_elim h t p pc input pos in
let pos_after_tag = v input pos in
let k' = p32 input pos in
v_payload k' input pos_after_tag
inline_for_extraction
let jump_sum_aux_payload'
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (jumper (dsnd (pc x)))))
(k: maybe_enum_key (sum_enum t))
: Tot (jump_sum_aux_payload_t t pc k)
= fun #rrel #rel input pos ->
match k with
| Known k ->
[@inline_let]
let _ = synth_sum_case_injective t k in
pc32 k input pos
| _ -> 0ul // dummy, but we MUST NOT remove this branch, otherwise extraction fails
inline_for_extraction
let jump_sum_aux_payload
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (jumper (dsnd (pc x)))))
(destr: dep_maybe_enum_destr_t (sum_enum t) (jump_sum_aux_payload_t t pc))
(k: sum_repr_type t)
: Tot (jump_sum_aux_payload_t t pc (maybe_enum_key_of_repr (sum_enum t) k))
= destr (jump_sum_aux_payload_eq t pc) (jump_sum_aux_payload_if t pc) (fun _ _ -> ()) (fun _ _ _ _ -> ()) (jump_sum_aux_payload' t pc pc32) k
inline_for_extraction
let jump_sum
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(v: jumper p)
(p32: leaf_reader p)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (jumper (dsnd (pc x)))))
(destr: dep_maybe_enum_destr_t (sum_enum t) (jump_sum_aux_payload_t t pc))
: Tot (jumper (parse_sum t p pc))
= jump_sum_aux t v p32 pc (jump_sum_aux_payload t pc pc32 destr)
inline_for_extraction
let read_sum_cases'
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (leaf_reader (dsnd (pc x)))))
(k: sum_key t)
: Tot (leaf_reader (parse_sum_cases' t pc k))
= [@inline_let]
let _ = synth_sum_case_injective t k in
read_synth'
(dsnd (pc k))
(synth_sum_case t k)
(pc32 k)
()
inline_for_extraction
let read_sum_cases_t
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot Type
= leaf_reader (parse_sum_cases' t pc k)
let read_sum_cases_t_eq
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
(x y : read_sum_cases_t t pc k)
: GTot Type0
= True
inline_for_extraction
let read_sum_cases_t_if
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (if_combinator _ (read_sum_cases_t_eq t pc k))
= fun cond (sv_true: cond_true cond -> Tot (read_sum_cases_t t pc k)) (sv_false: cond_false cond -> Tot (read_sum_cases_t t pc k)) #_ #_ input pos ->
if cond
then (sv_true () input pos)
else (sv_false () input pos)
inline_for_extraction
let read_sum_cases
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (leaf_reader (dsnd (pc x)))))
(destr: dep_enum_destr (sum_enum t) (read_sum_cases_t t pc))
(k: sum_key t)
: Tot (leaf_reader (parse_sum_cases' t pc k))
= destr
_
(read_sum_cases_t_if t pc)
(fun _ _ -> ())
(fun _ _ _ _ -> ())
(read_sum_cases' t pc pc32)
k
#push-options "--z3rlimit 32"
inline_for_extraction
let read_sum
(#kt: parser_kind)
(t: sum)
(p: parser kt (sum_repr_type t))
(p32: leaf_reader (parse_enum_key p (sum_enum t)))
(j: jumper p)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (leaf_reader (dsnd (pc x)))))
(destr: dep_enum_destr (sum_enum t) (read_sum_cases_t t pc))
: Tot (leaf_reader (parse_sum t p pc))
=
fun #_ #_ input pos ->
let h = HST.get () in
valid_facts (parse_sum t p pc) h input pos;
parse_sum_eq' t p pc (bytes_of_slice_from h input pos);
valid_facts (parse_enum_key p (sum_enum t)) h input pos;
let k = p32 input pos in
let pos' = jump_enum_key j (sum_enum t) input pos in
valid_facts (parse_sum_cases' t pc k) h input pos' ;
read_sum_cases t pc pc32 destr k input pos'
#pop-options
inline_for_extraction
let serialize32_sum_cases_t
(t: sum)
(#pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(sc: ((x: sum_key t) -> Tot (serializer (dsnd (pc x)))))
(k: sum_key t)
: Tot Type
= serializer32 (serialize_sum_cases t pc sc k)
let serialize32_sum_cases_t_eq
(t: sum)
(#pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(sc: ((x: sum_key t) -> Tot (serializer (dsnd (pc x)))))
(k: sum_key t)
(x y: serialize32_sum_cases_t t sc k)
: GTot Type0
= True
inline_for_extraction
let serialize32_sum_cases_t_if
(t: sum)
(#pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(sc: ((x: sum_key t) -> Tot (serializer (dsnd (pc x)))))
(k: sum_key t)
: Tot (if_combinator _ (serialize32_sum_cases_t_eq t sc k))
= fun cond (sv_true: (cond_true cond -> Tot (serialize32_sum_cases_t t sc k))) (sv_false: (cond_false cond -> Tot (serialize32_sum_cases_t t sc k))) x #rrel #rel b pos ->
if cond
then (sv_true () x b pos)
else (sv_false () x b pos)
inline_for_extraction
let serialize32_sum_cases_aux
(t: sum)
(#pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(sc: ((x: sum_key t) -> Tot (serializer (dsnd (pc x)))))
(sc32: ((x: sum_key t) -> Tot (serializer32 (sc x))))
(k: sum_key t)
: Tot (serializer32 (serialize_sum_cases t pc sc k))
= fun x #rrel #rel b pos ->
[@inline_let] let _ =
Classical.forall_intro (parse_sum_cases_eq' t pc k);
synth_sum_case_injective t k;
synth_sum_case_inverse t k
in
serialize32_synth
(sc32 k)
(synth_sum_case t k)
(synth_sum_case_recip t k)
(fun x -> synth_sum_case_recip t k x)
()
x
b
pos
inline_for_extraction
let serialize32_sum_cases
(t: sum)
(#pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(sc: ((x: sum_key t) -> Tot (serializer (dsnd (pc x)))))
(sc32: ((x: sum_key t) -> Tot (serializer32 (sc x))))
(destr: dep_enum_destr (sum_enum t) (serialize32_sum_cases_t t sc))
(k: sum_key t)
: Tot (serializer32 (serialize_sum_cases t pc sc k))
= destr
_
(serialize32_sum_cases_t_if t sc)
(fun _ _ -> ())
(fun _ _ _ _ -> ())
(serialize32_sum_cases_aux t sc sc32)
k
inline_for_extraction
let serialize32_sum
(#kt: parser_kind)
(t: sum)
(#p: parser kt (sum_repr_type t))
(s: serializer p {kt.parser_kind_subkind == Some ParserStrong})
(s32: serializer32 (serialize_enum_key _ s (sum_enum t)))
(#pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(sc: ((x: sum_key t) -> Tot (serializer (dsnd (pc x)))))
(sc32: ((x: sum_key t) -> Tot (serializer32 (sc x))))
(destr: dep_enum_destr (sum_enum t) (serialize32_sum_cases_t t sc))
: Tot (serializer32 (serialize_sum t s sc))
= fun x #rrel #rel b pos ->
serialize_sum_eq t s sc x;
let tg = sum_tag_of_data t x in
serialize32_nondep_then_aux s32 (serialize32_sum_cases t sc sc32 destr tg) tg x b pos
let clens_sum_tag
(s: sum)
: Tot (clens (sum_type s) (sum_key s))
= {
clens_cond = (fun _ -> True);
clens_get = sum_tag_of_data s;
}
let gaccessor_sum_tag
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
: Tot (gaccessor (parse_sum t p pc) (parse_enum_key p (sum_enum t)) (clens_sum_tag t))
= gaccessor_tagged_union_tag
(parse_enum_key p (sum_enum t))
(sum_tag_of_data t)
(parse_sum_cases t pc)
inline_for_extraction
let accessor_sum_tag
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
: Tot (accessor (gaccessor_sum_tag t p pc))
= accessor_tagged_union_tag
(parse_enum_key p (sum_enum t))
(sum_tag_of_data t)
(parse_sum_cases t pc)
let clens_sum_payload
(s: sum)
(k: sum_key s)
: Tot (clens (sum_type s) (sum_type_of_tag s k))
= {
clens_cond = (fun (x: sum_type s) -> sum_tag_of_data s x == k);
clens_get = (fun (x: sum_type s) -> synth_sum_case_recip s k x <: Ghost (sum_type_of_tag s k) (requires (sum_tag_of_data s x == k)) (ensures (fun _ -> True)));
}
#push-options "--z3rlimit 32"
let gaccessor_clens_sum_payload'
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (gaccessor' (parse_sum t p pc) (dsnd (pc k)) (clens_sum_payload t k))
= fun (input: bytes) ->
parse_sum_eq'' t p pc input;
let res =
match parse p input with
| Some (_, consumed) ->
synth_sum_case_inverse t k;
synth_sum_case_injective t k;
synth_injective_synth_inverse_synth_inverse_recip (synth_sum_case t k) (synth_sum_case_recip t k) ();
(consumed)
| _ -> 0 // dummy
in
(res <: (res: _ { gaccessor_post' (parse_sum t p pc) (dsnd (pc k)) (clens_sum_payload t k) input res } ))
#push-options "--z3rlimit 64"
let gaccessor_clens_sum_payload_injective
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
(sl sl' : bytes)
: Lemma
(requires (
gaccessor_pre (parse_sum t p pc) (dsnd (pc k)) (clens_sum_payload t k) sl /\
gaccessor_pre (parse_sum t p pc) (dsnd (pc k)) (clens_sum_payload t k) sl' /\
injective_precond (parse_sum t p pc) sl sl'
))
(ensures (gaccessor_clens_sum_payload' t p pc k sl == gaccessor_clens_sum_payload' t p pc k sl'))
= parse_sum_eq'' t p pc sl;
parse_sum_eq'' t p pc sl' ;
parse_injective (parse_sum t p pc) sl sl' ;
parse_injective p sl sl'
#pop-options
let gaccessor_clens_sum_payload_no_lookahead
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
(sl sl' : bytes)
: Lemma
(requires (
(parse_sum_kind kt t pc).parser_kind_subkind == Some ParserStrong /\
gaccessor_pre (parse_sum t p pc) (dsnd (pc k)) (clens_sum_payload t k) sl /\
gaccessor_pre (parse_sum t p pc) (dsnd (pc k)) (clens_sum_payload t k) sl' /\
no_lookahead_on_precond (parse_sum t p pc) sl sl'
))
(ensures (gaccessor_clens_sum_payload' t p pc k sl == gaccessor_clens_sum_payload' t p pc k sl'))
= parse_sum_eq'' t p pc sl;
parse_sum_eq'' t p pc sl' ;
parse_strong_prefix (parse_sum t p pc) sl sl' ;
parse_injective p sl sl'
let gaccessor_clens_sum_payload
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (gaccessor (parse_sum t p pc) (dsnd (pc k)) (clens_sum_payload t k))
= Classical.forall_intro_2 (fun x -> Classical.move_requires (gaccessor_clens_sum_payload_injective t p pc k x));
Classical.forall_intro_2 (fun x -> Classical.move_requires (gaccessor_clens_sum_payload_no_lookahead t p pc k x));
gaccessor_prop_equiv (parse_sum t p pc) (dsnd (pc k)) (clens_sum_payload t k) (gaccessor_clens_sum_payload' t p pc k);
gaccessor_clens_sum_payload' t p pc k
inline_for_extraction
let accessor_clens_sum_payload'
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(j: jumper p)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: HST.Stack U32.t
(requires (fun h ->
valid (parse_sum t p pc) h input pos /\
(clens_sum_payload t k).clens_cond (contents (parse_sum t p pc) h input pos)
))
(ensures (fun h pos' h' ->
B.modifies B.loc_none h h' /\
pos' == slice_access h (gaccessor_clens_sum_payload t p pc k) input pos
))
=
let h = HST.get () in
[@inline_let]
let _ =
let pos' = get_valid_pos (parse_sum t p pc) h input pos in
let large = bytes_of_slice_from h input pos in
slice_access_eq h (gaccessor_clens_sum_payload t p pc k) input pos;
valid_facts (parse_sum t p pc) h input pos;
parse_sum_eq'' t p pc large;
valid_facts p h input pos
in
j input pos
#pop-options
inline_for_extraction
let accessor_clens_sum_payload
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(j: jumper p)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (accessor (gaccessor_clens_sum_payload t p pc k))
= fun #rrel #rel -> accessor_clens_sum_payload' t j pc k #rrel #rel
let clens_sum_cases_payload
(s: sum)
(k: sum_key s)
: Tot (clens (sum_cases s k) (sum_type_of_tag s k))
= {
clens_cond = (fun (x: sum_cases s k) -> True);
clens_get = (fun (x: sum_cases s k) -> synth_sum_case_recip s k x <: Ghost (sum_type_of_tag s k) (requires (True)) (ensures (fun _ -> True)));
}
let gaccessor_clens_sum_cases_payload
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (gaccessor (parse_sum_cases' t pc k) (dsnd (pc k)) (clens_sum_cases_payload t k))
= synth_sum_case_injective t k;
synth_sum_case_inverse t k;
synth_injective_synth_inverse_synth_inverse_recip (synth_sum_case t k) (synth_sum_case_recip t k) ();
gaccessor_ext
(gaccessor_synth (dsnd (pc k)) (synth_sum_case t k) (synth_sum_case_recip t k) ())
(clens_sum_cases_payload t k)
()
inline_for_extraction
let accessor_clens_sum_cases_payload
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (accessor (gaccessor_clens_sum_cases_payload t pc k))
= [@inline_let]
let _ =
synth_sum_case_injective t k;
synth_sum_case_inverse t k;
synth_injective_synth_inverse_synth_inverse_recip (synth_sum_case t k) (synth_sum_case_recip t k) ()
in
accessor_ext
(accessor_synth (dsnd (pc k)) (synth_sum_case t k) (synth_sum_case_recip t k) ())
(clens_sum_cases_payload t k)
()
inline_for_extraction
let validate_dsum_cases_t
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(#k: parser_kind)
(g: parser k (dsum_type_of_unknown_tag s))
(x: dsum_key s)
: Tot Type
= validator (parse_dsum_cases' s f g x)
let validate_dsum_cases_eq
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(#k: parser_kind)
(g: parser k (dsum_type_of_unknown_tag s))
(x: dsum_key s)
(v1 v2 : validate_dsum_cases_t s f g x)
: GTot Type0
= True
inline_for_extraction
let validate_dsum_cases_if'
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(#k: parser_kind)
(g: parser k (dsum_type_of_unknown_tag s))
(x: dsum_key s)
(cond: bool)
(ift: (cond_true cond -> Tot (validate_dsum_cases_t s f g x)))
(iff: (cond_false cond -> Tot (validate_dsum_cases_t s f g x)))
: Tot (validate_dsum_cases_t s f g x)
= fun #rrel #rel input len ->
if cond
then (ift () <: validate_dsum_cases_t s f g x) input len
else (iff () <: validate_dsum_cases_t s f g x) input len
inline_for_extraction
let validate_dsum_cases_if
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(#k: parser_kind)
(g: parser k (dsum_type_of_unknown_tag s))
(x: dsum_key s)
: Tot (if_combinator _ (validate_dsum_cases_eq s f g x))
= validate_dsum_cases_if' s f g x
inline_for_extraction
let validate_dsum_cases'
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(f' : (x: dsum_known_key s) -> Tot (validator (dsnd (f x))))
(#k: parser_kind)
(#g: parser k (dsum_type_of_unknown_tag s))
(g' : validator g)
(x: dsum_key s)
: Tot (validate_dsum_cases_t s f g x)
= [@inline_let]
let _ = synth_dsum_case_injective s x in
match x with
| Known x' -> validate_synth (f' x') (synth_dsum_case s (Known x')) () <: validator (parse_dsum_cases' s f g x)
| Unknown x' -> validate_synth g' (synth_dsum_case s (Unknown x')) () <: validator (parse_dsum_cases' s f g x)
inline_for_extraction
let validate_dsum_cases'_destr
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(f' : (x: dsum_known_key s) -> Tot (validator (dsnd (f x))))
(#k: parser_kind)
(#g: parser k (dsum_type_of_unknown_tag s))
(g' : validator g)
(destr: dep_enum_destr _ (fun k -> validate_dsum_cases_t s f g (Known k)))
(x: dsum_key s)
: Tot (validate_dsum_cases_t s f g x)
= fun #rrel #rel input pos ->
match x with
| Known k ->
destr
_
(fun k -> validate_dsum_cases_if s f g (Known k))
(fun _ _ -> ())
(fun _ _ _ _ -> ())
(fun k -> validate_dsum_cases' s f f' g' (Known k))
k
input
pos
| Unknown r -> validate_dsum_cases' s f f' g' (Unknown r) input pos
inline_for_extraction
let validate_dsum_cases
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(f' : (x: dsum_known_key s) -> Tot (validator (dsnd (f x))))
(#k: parser_kind)
(#g: parser k (dsum_type_of_unknown_tag s))
(g' : validator g)
(destr: dep_enum_destr _ (fun k -> validate_dsum_cases_t s f g (Known k)))
(x: dsum_key s)
: Tot (validator (parse_dsum_cases s f g x))
= fun #rrel #rel input pos ->
let h = HST.get () in
[@inline_let]
let _ =
valid_facts (parse_dsum_cases' s f g x) h input (uint64_to_uint32 pos);
valid_facts (parse_dsum_cases s f g x) h input (uint64_to_uint32 pos);
parse_dsum_cases_eq' s f g x (bytes_of_slice_from h input (uint64_to_uint32 pos))
in
validate_dsum_cases'_destr s f f' g' destr x input pos
#push-options "--z3rlimit 40"
inline_for_extraction
let validate_dsum
(#kt: parser_kind)
(t: dsum)
(#p: parser kt (dsum_repr_type t))
(v: validator p)
(p32: leaf_reader p)
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(f32: (x: dsum_known_key t) -> Tot (validator (dsnd (f x))))
(#k': parser_kind)
(#g: parser k' (dsum_type_of_unknown_tag t))
(g32: validator g)
(destr: dep_maybe_enum_destr_t (dsum_enum t) (validate_dsum_cases_t t f g))
: Tot (validator (parse_dsum t p f g))
= fun #rrel #rel input pos ->
let h = HST.get () in
[@inline_let]
let _ = parse_dsum_eq' t p f g (bytes_of_slice_from h input (uint64_to_uint32 pos)) in
[@inline_let]
let _ = valid_facts (parse_dsum t p f g) h input (uint64_to_uint32 pos) in
[@inline_let]
let _ = valid_facts p h input (uint64_to_uint32 pos) in
let pos_after_tag = v input pos in
if is_error pos_after_tag
then pos_after_tag
else
let tg = p32 input (uint64_to_uint32 pos) in
[@inline_let]
let _ = valid_facts (parse_dsum_cases' t f g (maybe_enum_key_of_repr (dsum_enum t) tg)) h input (uint64_to_uint32 pos_after_tag) in
destr (validate_dsum_cases_eq t f g) (validate_dsum_cases_if t f g) (fun _ _ -> ()) (fun _ _ _ _ -> ()) (validate_dsum_cases' t f f32 g32) tg input pos_after_tag
#pop-options
#reset-options "--z3rlimit 64 --z3cliopt smt.arith.nl=false --initial_ifuel 8 --max_ifuel 8 --initial_fuel 2 --max_fuel 2"
let valid_dsum_intro_known
(h: HS.mem)
(t: dsum)
(#kt: parser_kind)
(p: parser kt (dsum_repr_type t))
(f: ((x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x))))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: Lemma
(requires (
valid (parse_maybe_enum_key p (dsum_enum t)) h input pos /\ (
let k' = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
Known? k' /\ (
let Known k = k' in
valid (dsnd (f k)) h input (get_valid_pos (parse_maybe_enum_key p (dsum_enum t)) h input pos)
))))
(ensures (
let Known k = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
let pos_payload = get_valid_pos (parse_maybe_enum_key p (dsum_enum t)) h input pos in
valid_content_pos
(parse_dsum t p f g) h input pos
(synth_dsum_case t (Known k) (contents (dsnd (f k)) h input pos_payload))
(get_valid_pos (dsnd (f k)) h input pos_payload)
))
= valid_facts (parse_maybe_enum_key p (dsum_enum t)) h input pos;
let Known k = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
let pos_payload = get_valid_pos (parse_maybe_enum_key p (dsum_enum t)) h input pos in
valid_facts (dsnd (f k)) h input pos_payload;
valid_facts (parse_dsum t p f g) h input pos;
parse_dsum_eq t p f g (bytes_of_slice_from h input pos)
let valid_dsum_intro_unknown
(h: HS.mem)
(t: dsum)
(#kt: parser_kind)
(p: parser kt (dsum_repr_type t))
(f: ((x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x))))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: Lemma
(requires (
valid (parse_maybe_enum_key p (dsum_enum t)) h input pos /\ (
let k' = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
Unknown? k' /\
valid g h input (get_valid_pos (parse_maybe_enum_key p (dsum_enum t)) h input pos)
)))
(ensures (
let Unknown r = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
let pos_payload = get_valid_pos (parse_maybe_enum_key p (dsum_enum t)) h input pos in
valid_content_pos
(parse_dsum t p f g) h input pos
(synth_dsum_case t (Unknown r) (contents g h input pos_payload))
(get_valid_pos g h input pos_payload)
))
= valid_facts (parse_maybe_enum_key p (dsum_enum t)) h input pos;
let Unknown r = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
let pos_payload = get_valid_pos (parse_maybe_enum_key p (dsum_enum t)) h input pos in
valid_facts g h input pos_payload;
valid_facts (parse_dsum t p f g) h input pos;
parse_dsum_eq t p f g (bytes_of_slice_from h input pos)
#reset-options
inline_for_extraction
let finalize_dsum_case_known
(t: dsum)
(#kt: parser_kind)
(#p: parser kt (dsum_repr_type t))
(s: serializer p)
(w: leaf_writer_strong s)
(f: ((x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x))))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
(destr: enum_repr_of_key'_t (dsum_enum t))
(k: dsum_known_key t)
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: HST.Stack unit
(requires (fun h ->
let len_tag = serialized_length (serialize_enum_key _ s (dsum_enum t)) k in
U32.v pos + len_tag < 4294967296 /\ (
let pos_payload = pos `U32.add` U32.uint_to_t len_tag in
valid (dsnd (f k)) h input pos_payload /\
writable input.base (U32.v pos) (U32.v pos_payload) h
)))
(ensures (fun h _ h' ->
let len_tag = serialized_length (serialize_enum_key _ s (dsum_enum t)) k in
let pos_payload = pos `U32.add` U32.uint_to_t len_tag in
B.modifies (loc_slice_from_to input pos pos_payload) h h' /\
valid_content_pos (parse_dsum t p f g) h' input pos (synth_dsum_case t (Known k) (contents (dsnd (f k)) h input pos_payload)) (get_valid_pos (dsnd (f k)) h input pos_payload)
))
= let pos1 = write_enum_key w (dsum_enum t) destr k input pos in
let h = HST.get () in
[@inline_let]
let _ =
valid_facts (parse_enum_key p (dsum_enum t)) h input pos;
valid_facts (parse_maybe_enum_key p (dsum_enum t)) h input pos;
let sq = bytes_of_slice_from h input pos in
parse_enum_key_eq p (dsum_enum t) sq;
parse_maybe_enum_key_eq p (dsum_enum t) sq;
valid_dsum_intro_known h t p f g input pos
in
()
inline_for_extraction
let finalize_dsum_case_unknown
(t: dsum)
(#kt: parser_kind)
(#p: parser kt (dsum_repr_type t))
(s: serializer p)
(w: leaf_writer_strong s)
(f: ((x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x))))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
(r: unknown_enum_repr (dsum_enum t))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: HST.Stack unit
(requires (fun h ->
let len_tag = serialized_length s r in
U32.v pos + len_tag < 4294967296 /\ (
let pos_payload = pos `U32.add` U32.uint_to_t len_tag in
valid g h input pos_payload /\
writable input.base (U32.v pos) (U32.v pos_payload) h
)))
(ensures (fun h _ h' ->
let len_tag = serialized_length s r in
let pos_payload = pos `U32.add` U32.uint_to_t len_tag in
B.modifies (loc_slice_from_to input pos pos_payload) h h' /\
valid_content_pos (parse_dsum t p f g) h' input pos (synth_dsum_case t (Unknown r) (contents g h input pos_payload)) (get_valid_pos g h input pos_payload)
))
= let pos1 = w r input pos in
let h = HST.get () in
[@inline_let]
let _ =
valid_facts (parse_maybe_enum_key p (dsum_enum t)) h input pos;
valid_facts p h input pos;
let sq = bytes_of_slice_from h input pos in
parse_maybe_enum_key_eq p (dsum_enum t) sq;
valid_dsum_intro_unknown h t p f g input pos
in
()
let valid_dsum_elim_tag
(h: HS.mem)
(t: dsum)
(#kt: parser_kind)
(p: parser kt (dsum_repr_type t))
(f: ((x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x))))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: Lemma
(requires (
valid (parse_dsum t p f g) h input pos
))
(ensures (
valid (parse_maybe_enum_key p (dsum_enum t)) h input pos /\
contents (parse_maybe_enum_key p (dsum_enum t)) h input pos == dsum_tag_of_data t (contents (parse_dsum t p f g) h input pos)
))
= let _ = parse_dsum_eq_ t p f g (bytes_of_slice_from h input pos) in
let _ = valid_facts (parse_dsum t p f g) h input pos in
let _ = valid_facts (parse_maybe_enum_key p (dsum_enum t)) h input pos in
()
inline_for_extraction
let read_dsum_tag
(t: dsum)
(#kt: parser_kind)
(#p: parser kt (dsum_repr_type t))
(p32: leaf_reader p)
(destr: maybe_enum_destr_t (maybe_enum_key (dsum_enum t)) (dsum_enum t))
(f: ((x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x))))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: HST.Stack (dsum_key t)
(requires (fun h ->
valid (parse_dsum t p f g) h input pos
))
(ensures (fun h res h' ->
B.modifies B.loc_none h h' /\
res == dsum_tag_of_data t (contents (parse_dsum t p f g) h input pos)
))
= let h = HST.get () in
[@inline_let] let _ = valid_dsum_elim_tag h t p f g input pos in
read_maybe_enum_key p32 (dsum_enum t) destr input pos
#push-options "--z3rlimit 32"
let valid_dsum_elim_known
(h: HS.mem)
(t: dsum)
(#kt: parser_kind)
(p: parser kt (dsum_repr_type t))
(f: ((x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x))))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: Lemma
(requires (
valid (parse_dsum t p f g) h input pos /\
Known? (dsum_tag_of_data t (contents (parse_dsum t p f g) h input pos))
))
(ensures (
valid (parse_maybe_enum_key p (dsum_enum t)) h input pos /\ (
let k' = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
let pos_payload = get_valid_pos (parse_maybe_enum_key p (dsum_enum t)) h input pos in
Known? k' /\ (
let Known k = k' in
valid (dsnd (f k)) h input pos_payload /\
valid_content_pos
(parse_dsum t p f g) h input pos
(synth_dsum_case t (Known k) (contents (dsnd (f k)) h input pos_payload))
(get_valid_pos (dsnd (f k)) h input pos_payload)
))))
=
valid_facts (parse_dsum t p f g) h input pos;
parse_dsum_eq t p f g (bytes_of_slice_from h input pos);
valid_facts (parse_maybe_enum_key p (dsum_enum t)) h input pos;
let Known k = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
let pos_payload = get_valid_pos (parse_maybe_enum_key p (dsum_enum t)) h input pos in
valid_facts (dsnd (f k)) h input pos_payload
#pop-options
let valid_dsum_elim_unknown
(h: HS.mem)
(t: dsum)
(#kt: parser_kind)
(p: parser kt (dsum_repr_type t))
(f: ((x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x))))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: Lemma
(requires (
valid (parse_dsum t p f g) h input pos /\
Unknown? (dsum_tag_of_data t (contents (parse_dsum t p f g) h input pos))
))
(ensures (
valid (parse_maybe_enum_key p (dsum_enum t)) h input pos /\ (
let k' = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
let pos_payload = get_valid_pos (parse_maybe_enum_key p (dsum_enum t)) h input pos in
Unknown? k' /\ (
let Unknown r = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
valid g h input pos_payload /\
valid_content_pos
(parse_dsum t p f g) h input pos
(synth_dsum_case t (Unknown r) (contents g h input pos_payload))
(get_valid_pos g h input pos_payload)
))))
=
valid_facts (parse_dsum t p f g) h input pos;
parse_dsum_eq t p f g (bytes_of_slice_from h input pos);
valid_facts (parse_maybe_enum_key p (dsum_enum t)) h input pos;
let Unknown r = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
let pos_payload = get_valid_pos (parse_maybe_enum_key p (dsum_enum t)) h input pos in
valid_facts g h input pos_payload
inline_for_extraction
let jump_dsum_cases_t
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(#k: parser_kind)
(g: parser k (dsum_type_of_unknown_tag s))
(x: dsum_key s)
: Tot Type
= jumper (parse_dsum_cases' s f g x)
let jump_dsum_cases_eq
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(#k: parser_kind)
(g: parser k (dsum_type_of_unknown_tag s))
(x: dsum_key s)
(v1 v2 : jump_dsum_cases_t s f g x)
: GTot Type0
= True
inline_for_extraction
let jump_dsum_cases_if'
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(#k: parser_kind)
(g: parser k (dsum_type_of_unknown_tag s))
(x: dsum_key s)
(cond: bool)
(ift: (cond_true cond -> Tot (jump_dsum_cases_t s f g x)))
(iff: (cond_false cond -> Tot (jump_dsum_cases_t s f g x)))
: Tot (jump_dsum_cases_t s f g x)
= fun #rrel #rel input len ->
if cond
then (ift () <: jump_dsum_cases_t s f g x) input len
else (iff () <: jump_dsum_cases_t s f g x) input len
inline_for_extraction
let jump_dsum_cases_if
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(#k: parser_kind)
(g: parser k (dsum_type_of_unknown_tag s))
(x: dsum_key s)
: Tot (if_combinator _ (jump_dsum_cases_eq s f g x))
= jump_dsum_cases_if' s f g x
inline_for_extraction
let jump_dsum_cases'
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(f' : (x: dsum_known_key s) -> Tot (jumper (dsnd (f x))))
(#k: parser_kind)
(#g: parser k (dsum_type_of_unknown_tag s))
(g' : jumper g)
(x: dsum_key s)
: Tot (jump_dsum_cases_t s f g x)
= synth_dsum_case_injective s x;
match x with
| Known x' -> jump_synth (f' x') (synth_dsum_case s (Known x')) () <: jumper (parse_dsum_cases' s f g x)
| Unknown x' -> jump_synth g' (synth_dsum_case s (Unknown x')) () <: jumper (parse_dsum_cases' s f g x)
inline_for_extraction
let jump_dsum_cases'_destr
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(f' : (x: dsum_known_key s) -> Tot (jumper (dsnd (f x))))
(#k: parser_kind)
(#g: parser k (dsum_type_of_unknown_tag s))
(g' : jumper g)
(destr: dep_enum_destr _ (fun k -> jump_dsum_cases_t s f g (Known k)))
(x: dsum_key s)
: Tot (jump_dsum_cases_t s f g x)
= fun #rrel #rel input pos ->
match x with
| Known k ->
destr
_
(fun k -> jump_dsum_cases_if s f g (Known k))
(fun _ _ -> ())
(fun _ _ _ _ -> ())
(fun k -> jump_dsum_cases' s f f' g' (Known k))
k
input
pos
| Unknown r -> jump_dsum_cases' s f f' g' (Unknown r) input pos
inline_for_extraction
let jump_dsum_cases
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(f' : (x: dsum_known_key s) -> Tot (jumper (dsnd (f x))))
(#k: parser_kind)
(#g: parser k (dsum_type_of_unknown_tag s))
(g' : jumper g)
(destr: dep_enum_destr _ (fun k -> jump_dsum_cases_t s f g (Known k)))
(x: dsum_key s)
: Tot (jumper (parse_dsum_cases s f g x))
= fun #rrel #rel input pos ->
let h = HST.get () in
[@inline_let]
let _ =
valid_facts (parse_dsum_cases' s f g x) h input pos;
valid_facts (parse_dsum_cases s f g x) h input pos;
parse_dsum_cases_eq' s f g x (bytes_of_slice_from h input pos)
in
jump_dsum_cases'_destr s f f' g' destr x input pos
#push-options "--z3rlimit 16"
inline_for_extraction
let jump_dsum
(#kt: parser_kind)
(t: dsum)
(#p: parser kt (dsum_repr_type t))
(v: jumper p)
(p32: leaf_reader p)
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(f32: (x: dsum_known_key t) -> Tot (jumper (dsnd (f x))))
(#k': parser_kind)
(#g: parser k' (dsum_type_of_unknown_tag t))
(g32: jumper g)
(destr: dep_maybe_enum_destr_t (dsum_enum t) (jump_dsum_cases_t t f g))
: Tot (jumper (parse_dsum t p f g))
= fun #rrel #rel input pos ->
let h = HST.get () in
[@inline_let]
let _ = parse_dsum_eq' t p f g (bytes_of_slice_from h input pos) in
[@inline_let]
let _ = valid_facts (parse_dsum t p f g) h input pos in
[@inline_let]
let _ = valid_facts p h input pos in
let pos_after_tag = v input pos in
let tg = p32 input pos in
[@inline_let]
let _ = valid_facts (parse_dsum_cases' t f g (maybe_enum_key_of_repr (dsum_enum t) tg)) h input pos_after_tag in
destr (jump_dsum_cases_eq t f g) (jump_dsum_cases_if t f g) (fun _ _ -> ()) (fun _ _ _ _ -> ()) (jump_dsum_cases' t f f32 g32) tg input pos_after_tag
#pop-options
inline_for_extraction
let read_dsum_cases'
(t: dsum)
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(f32: (x: dsum_known_key t) -> Tot (leaf_reader (dsnd (f x))))
(#k': parser_kind)
(g: parser k' (dsum_type_of_unknown_tag t))
(g32: leaf_reader g)
(x: dsum_key t)
: Tot (leaf_reader (parse_dsum_cases' t f g x))
= fun #rrel #rel input pos ->
[@inline_let]
let _ = synth_dsum_case_injective t x in
match x with
| Known x' ->
read_synth'
(dsnd (f x'))
(synth_dsum_case t (Known x'))
(f32 x')
()
input
pos
| Unknown x' ->
read_synth'
g
(synth_dsum_case t (Unknown x'))
g32
()
input
pos
inline_for_extraction
let read_dsum_cases_t
(t: dsum)
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(#k': parser_kind)
(g: parser k' (dsum_type_of_unknown_tag t))
(k: dsum_known_key t)
: Tot Type
= leaf_reader (parse_dsum_cases' t f g (Known k))
let read_dsum_cases_t_eq
(t: dsum)
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(#k': parser_kind)
(g: parser k' (dsum_type_of_unknown_tag t))
(k: dsum_known_key t)
(x y : read_dsum_cases_t t f g k)
: GTot Type0
= True
inline_for_extraction
let read_dsum_cases_t_if
(t: dsum)
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(#k': parser_kind)
(g: parser k' (dsum_type_of_unknown_tag t))
(k: dsum_known_key t)
: Tot (if_combinator _ (read_dsum_cases_t_eq t f g k))
= fun cond (sv_true: cond_true cond -> Tot (read_dsum_cases_t t f g k)) (sv_false: cond_false cond -> Tot (read_dsum_cases_t t f g k)) #_ #_ input pos ->
if cond
then sv_true () input pos
else sv_false () input pos
inline_for_extraction
let read_dsum_cases
(t: dsum)
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(f32: (x: dsum_known_key t) -> Tot (leaf_reader (dsnd (f x))))
(#k': parser_kind)
(g: parser k' (dsum_type_of_unknown_tag t))
(g32: leaf_reader g)
(destr: dep_enum_destr _ (read_dsum_cases_t t f g))
(x: dsum_key t)
: Tot (leaf_reader (parse_dsum_cases' t f g x))
= fun #_ #_ input pos ->
match x with
| Known k ->
destr
_
(read_dsum_cases_t_if t f g)
(fun _ _ -> ())
(fun _ _ _ _ -> ())
(fun k -> read_dsum_cases' t f f32 g g32 (Known k))
k
input
pos
| Unknown r ->
read_dsum_cases' t f f32 g g32 (Unknown r) input pos
#push-options "--z3rlimit 16"
inline_for_extraction
let read_dsum
(#kt: parser_kind)
(t: dsum)
(#p: parser kt (dsum_repr_type t))
(p32: leaf_reader (parse_maybe_enum_key p (dsum_enum t)))
(j: jumper p)
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(f32: (x: dsum_known_key t) -> Tot (leaf_reader (dsnd (f x))))
(#k': parser_kind)
(#g: parser k' (dsum_type_of_unknown_tag t))
(g32: leaf_reader g)
(destr: dep_enum_destr _ (read_dsum_cases_t t f g))
: Tot (leaf_reader (parse_dsum t p f g))
= fun #_ #_ input pos ->
let h = HST.get () in
valid_facts (parse_dsum t p f g) h input pos;
parse_dsum_eq_ t p f g (bytes_of_slice_from h input pos);
valid_facts (parse_maybe_enum_key p (dsum_enum t)) h input pos;
let k = p32 input pos in
let pos' = jump_maybe_enum_key j (dsum_enum t) input pos in
valid_facts (parse_dsum_cases' t f g k) h input pos' ;
read_dsum_cases t f f32 g g32 destr k input pos'
#pop-options
inline_for_extraction
let serialize32_dsum_type_of_tag
(t: dsum)
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(sf: (x: dsum_known_key t) -> Tot (serializer (dsnd (f x))))
(sf32: (x: dsum_known_key t) -> Tot (serializer32 (sf x)))
(#k': parser_kind)
(#g: parser k' (dsum_type_of_unknown_tag t))
(#sg: serializer g)
(sg32: serializer32 sg)
(tg: dsum_key t)
: Tot (serializer32 (serialize_dsum_type_of_tag t f sf g sg tg))
= match tg with
| Known x' -> serialize32_ext (dsnd (f x')) (sf x') (sf32 x') (parse_dsum_type_of_tag t f g tg) ()
| Unknown x' -> serialize32_ext g sg sg32 (parse_dsum_type_of_tag t f g tg) ()
inline_for_extraction
let serialize32_dsum_cases_aux
(t: dsum)
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(sf: (x: dsum_known_key t) -> Tot (serializer (dsnd (f x))))
(sf32: (x: dsum_known_key t) -> Tot (serializer32 (sf x)))
(#k': parser_kind)
(#g: parser k' (dsum_type_of_unknown_tag t))
(#sg: serializer g)
(sg32: serializer32 sg)
(tg: dsum_key t)
: Tot (serializer32 (serialize_dsum_cases t f sf g sg tg))
= [@inline_let]
let _ = synth_dsum_case_injective t tg in
[@inline_let]
let _ = synth_dsum_case_inverse t tg in
serialize32_synth
(serialize32_dsum_type_of_tag t f sf sf32 sg32 tg)
(synth_dsum_case t tg)
(synth_dsum_case_recip t tg)
(fun x -> synth_dsum_case_recip t tg x)
()
inline_for_extraction
let serialize32_dsum_cases_t
(t: dsum)
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(sf: (x: dsum_known_key t) -> Tot (serializer (dsnd (f x))))
(#k': parser_kind)
(g: parser k' (dsum_type_of_unknown_tag t))
(sg: serializer g)
(k: dsum_known_key t)
: Tot Type
= serializer32 (serialize_dsum_cases t f sf g sg (Known k))
let serialize32_dsum_cases_t_eq
(t: dsum)
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(sf: (x: dsum_known_key t) -> Tot (serializer (dsnd (f x))))
(#k': parser_kind)
(g: parser k' (dsum_type_of_unknown_tag t))
(sg: serializer g)
(k: dsum_known_key t)
(x y: serialize32_dsum_cases_t t f sf g sg k)
: GTot Type0
= True
inline_for_extraction
let serialize32_dsum_cases_t_if
(t: dsum)
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(sf: (x: dsum_known_key t) -> Tot (serializer (dsnd (f x))))
(#k': parser_kind)
(g: parser k' (dsum_type_of_unknown_tag t))
(sg: serializer g)
(k: dsum_known_key t)
: Tot (if_combinator _ (serialize32_dsum_cases_t_eq t f sf g sg k))
= fun cond (sv_true: (cond_true cond -> Tot (serialize32_dsum_cases_t t f sf g sg k))) (sv_false: (cond_false cond -> Tot (serialize32_dsum_cases_t t f sf g sg k))) x #rrel #rel output pos ->
if cond
then (sv_true () x output pos)
else (sv_false () x output pos)
inline_for_extraction
let serialize32_dsum_cases
(t: dsum)
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(sf: (x: dsum_known_key t) -> Tot (serializer (dsnd (f x))))
(sf32: (x: dsum_known_key t) -> Tot (serializer32 (sf x)))
(#k': parser_kind)
(#g: parser k' (dsum_type_of_unknown_tag t))
(#sg: serializer g)
(sg32: serializer32 sg)
(destr: dep_enum_destr _ (serialize32_dsum_cases_t t f sf g sg))
(tg: dsum_key t)
: Tot (serializer32 (serialize_dsum_cases t f sf g sg tg))
= fun x #rrel #rel output pos ->
match tg with
| Known k ->
destr
_
(serialize32_dsum_cases_t_if t f sf g sg)
(fun _ _ -> ())
(fun _ _ _ _ -> ())
(fun k -> serialize32_dsum_cases_aux t f sf sf32 sg32 (Known k))
k
x
output
pos
| Unknown r ->
serialize32_dsum_cases_aux t f sf sf32 sg32 (Unknown r) x output pos
inline_for_extraction
let serialize32_dsum
(#kt: parser_kind)
(t: dsum)
(#p: parser kt (dsum_repr_type t))
(s: serializer p {kt.parser_kind_subkind == Some ParserStrong})
(s32: serializer32 (serialize_maybe_enum_key _ s (dsum_enum t)))
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(sf: (x: dsum_known_key t) -> Tot (serializer (dsnd (f x))))
(sf32: (x: dsum_known_key t) -> Tot (serializer32 (sf x)))
(#k': parser_kind)
(#g: parser k' (dsum_type_of_unknown_tag t))
(#sg: serializer g)
(sg32: serializer32 sg)
(destr: dep_enum_destr _ (serialize32_dsum_cases_t t f sf g sg))
: Tot (serializer32 (serialize_dsum t s f sf g sg))
= fun x #_ #_ output pos ->
[@inline_let]
let _ = serialize_dsum_eq' t s f sf g sg x in
let tg = dsum_tag_of_data t x in
serialize32_nondep_then_aux
s32
(serialize32_dsum_cases t f sf sf32 sg32 destr tg)
tg
x
output
pos
let clens_dsum_tag
(s: dsum)
: Tot (clens (dsum_type s) (dsum_key s))
= {
clens_cond = (fun _ -> True);
clens_get = dsum_tag_of_data s;
}
let gaccessor_dsum_tag
(#kt: parser_kind)
(t: dsum)
(p: parser kt (dsum_repr_type t))
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
: Tot (gaccessor (parse_dsum t p f g) (parse_maybe_enum_key p (dsum_enum t)) (clens_dsum_tag t))
= gaccessor_tagged_union_tag
(parse_maybe_enum_key p (dsum_enum t))
(dsum_tag_of_data t)
(parse_dsum_cases t f g)
inline_for_extraction
let accessor_dsum_tag
(#kt: parser_kind)
(t: dsum)
(p: parser kt (dsum_repr_type t))
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
: Tot (accessor (gaccessor_dsum_tag t p f g))
= accessor_tagged_union_tag
(parse_maybe_enum_key p (dsum_enum t))
(dsum_tag_of_data t)
(parse_dsum_cases t f g)
let clens_dsum_payload
(s: dsum)
(k: dsum_key s)
: Tot (clens (dsum_type s) (dsum_type_of_tag s k))
= {
clens_cond = (fun (x: dsum_type s) -> dsum_tag_of_data s x == k);
clens_get = (fun (x: dsum_type s) -> synth_dsum_case_recip s k x <: Ghost (dsum_type_of_tag s k) (requires (dsum_tag_of_data s x == k)) (ensures (fun _ -> True)));
}
let clens_dsum_unknown_payload
(s: dsum)
: Tot (clens (dsum_type s) (dsum_type_of_unknown_tag s))
= {
clens_cond = (fun (x: dsum_type s) -> Unknown? (dsum_tag_of_data s x));
clens_get = (fun (x: dsum_type s) -> synth_dsum_case_recip s (dsum_tag_of_data s x) x <: Ghost (dsum_type_of_unknown_tag s) (requires (Unknown? (dsum_tag_of_data s x))) (ensures (fun _ -> True)));
}
#push-options "--z3rlimit 16"
let gaccessor_clens_dsum_payload'
(#kt: parser_kind)
(t: dsum)
(p: parser kt (dsum_repr_type t))
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
(k: dsum_key t)
: Tot (gaccessor' (parse_dsum t p f g) (parse_dsum_type_of_tag' t f g k) (clens_dsum_payload t k))
= fun (input: bytes) ->
parse_dsum_eq3 t p f g input;
let res =
match parse p input with
| Some (_, consumed) ->
synth_dsum_case_inverse t k;
synth_dsum_case_injective t k;
synth_injective_synth_inverse_synth_inverse_recip (synth_dsum_case t k) (synth_dsum_case_recip t k) ();
(consumed)
| _ -> (0) // dummy
in
(res <: (res: _ { gaccessor_post' (parse_dsum t p f g) (parse_dsum_type_of_tag' t f g k) (clens_dsum_payload t k) input res } ))
let gaccessor_clens_dsum_payload_injective
(#kt: parser_kind)
(t: dsum)
(p: parser kt (dsum_repr_type t))
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
(k: dsum_key t)
(sl sl' : bytes)
: Lemma
(requires (
gaccessor_pre (parse_dsum t p f g) (parse_dsum_type_of_tag' t f g k) (clens_dsum_payload t k) sl /\
gaccessor_pre (parse_dsum t p f g) (parse_dsum_type_of_tag' t f g k) (clens_dsum_payload t k) sl' /\
injective_precond (parse_dsum t p f g) sl sl'
))
(ensures (
gaccessor_clens_dsum_payload' t p f g k sl == gaccessor_clens_dsum_payload' t p f g k sl'
))
=
parse_dsum_eq3 t p f g sl;
parse_dsum_eq3 t p f g sl';
parse_injective (parse_dsum t p f g) sl sl' ;
parse_injective p sl sl'
let gaccessor_clens_dsum_payload_no_lookahead
(#kt: parser_kind)
(t: dsum)
(p: parser kt (dsum_repr_type t))
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
(k: dsum_key t)
(sl sl' : bytes)
: Lemma
(requires (
(parse_dsum_kind kt t f ku).parser_kind_subkind == Some ParserStrong /\
gaccessor_pre (parse_dsum t p f g) (parse_dsum_type_of_tag' t f g k) (clens_dsum_payload t k) sl /\
gaccessor_pre (parse_dsum t p f g) (parse_dsum_type_of_tag' t f g k) (clens_dsum_payload t k) sl' /\
no_lookahead_on_precond (parse_dsum t p f g) sl sl'
))
(ensures (
gaccessor_clens_dsum_payload' t p f g k sl == gaccessor_clens_dsum_payload' t p f g k sl'
))
= parse_dsum_eq3 t p f g sl;
parse_dsum_eq3 t p f g sl';
parse_strong_prefix (parse_dsum t p f g) sl sl' ;
parse_injective p sl sl'
let gaccessor_clens_dsum_payload
(#kt: parser_kind)
(t: dsum)
(p: parser kt (dsum_repr_type t))
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
(k: dsum_key t)
: Tot (gaccessor (parse_dsum t p f g) (parse_dsum_type_of_tag' t f g k) (clens_dsum_payload t k))
= Classical.forall_intro_2 (fun x -> Classical.move_requires (gaccessor_clens_dsum_payload_injective t p f g k x));
Classical.forall_intro_2 (fun x -> Classical.move_requires (gaccessor_clens_dsum_payload_no_lookahead t p f g k x));
gaccessor_prop_equiv (parse_dsum t p f g) (parse_dsum_type_of_tag' t f g k) (clens_dsum_payload t k) (gaccessor_clens_dsum_payload' t p f g k);
gaccessor_clens_dsum_payload' t p f g k
inline_for_extraction
let accessor_clens_dsum_payload'
(#kt: parser_kind)
(t: dsum)
(#p: parser kt (dsum_repr_type t))
(j: jumper p)
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
(k: dsum_key t)
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: HST.Stack U32.t
(requires (fun h ->
valid (parse_dsum t p f g) h input pos /\
(clens_dsum_payload t k).clens_cond (contents (parse_dsum t p f g) h input pos)
))
(ensures (fun h pos' h' ->
B.modifies B.loc_none h h' /\
pos' == slice_access h (gaccessor_clens_dsum_payload t p f g k) input pos
))
=
let h = HST.get () in
[@inline_let]
let _ =
let pos' = get_valid_pos (parse_dsum t p f g) h input pos in
let large = bytes_of_slice_from h input pos in
slice_access_eq h (gaccessor_clens_dsum_payload t p f g k) input pos;
valid_facts (parse_dsum t p f g) h input pos;
parse_dsum_eq3 t p f g large;
valid_facts p h input pos
in
j input pos
#pop-options | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"LowStar.Buffer.fst.checked",
"LowParse.Spec.Sum.fst.checked",
"LowParse.Low.Enum.fst.checked",
"FStar.UInt64.fsti.checked",
"FStar.UInt32.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Int.Cast.fst.checked",
"FStar.HyperStack.ST.fsti.checked",
"FStar.HyperStack.fst.checked",
"FStar.Classical.fsti.checked"
],
"interface_file": false,
"source_file": "LowParse.Low.Sum.fst"
} | [
{
"abbrev": true,
"full_module": "FStar.HyperStack",
"short_module": "HS"
},
{
"abbrev": true,
"full_module": "FStar.UInt64",
"short_module": "U64"
},
{
"abbrev": true,
"full_module": "FStar.Int.Cast",
"short_module": "Cast"
},
{
"abbrev": true,
"full_module": "LowStar.Buffer",
"short_module": "B"
},
{
"abbrev": true,
"full_module": "FStar.HyperStack.ST",
"short_module": "HST"
},
{
"abbrev": true,
"full_module": "FStar.UInt32",
"short_module": "U32"
},
{
"abbrev": false,
"full_module": "LowParse.Spec.Sum",
"short_module": null
},
{
"abbrev": false,
"full_module": "LowParse.Low.Enum",
"short_module": null
},
{
"abbrev": false,
"full_module": "LowParse.Low",
"short_module": null
},
{
"abbrev": false,
"full_module": "LowParse.Low",
"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",
"short_module": null
}
] | {
"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_elim_box": false,
"smtencoding_l_arith_repr": "boxwrap",
"smtencoding_nl_arith_repr": "boxwrap",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": true,
"z3cliopt": [],
"z3refresh": false,
"z3rlimit": 5,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | false |
t: LowParse.Spec.Sum.dsum ->
j: LowParse.Low.Base.jumper p ->
f:
(x: LowParse.Spec.Sum.dsum_known_key t
-> Prims.dtuple2 LowParse.Spec.Base.parser_kind
(fun k -> LowParse.Spec.Base.parser k (LowParse.Spec.Sum.dsum_type_of_known_tag t x))) ->
g: LowParse.Spec.Base.parser ku (LowParse.Spec.Sum.dsum_type_of_unknown_tag t) ->
k: LowParse.Spec.Sum.dsum_key t
-> LowParse.Low.Base.accessor (LowParse.Low.Sum.gaccessor_clens_dsum_payload t p f g k) | Prims.Tot | [
"total"
] | [] | [
"LowParse.Spec.Base.parser_kind",
"LowParse.Spec.Sum.dsum",
"LowParse.Spec.Base.parser",
"LowParse.Spec.Sum.dsum_repr_type",
"LowParse.Low.Base.jumper",
"LowParse.Spec.Sum.dsum_known_key",
"Prims.dtuple2",
"LowParse.Spec.Sum.dsum_type_of_known_tag",
"LowParse.Spec.Sum.dsum_type_of_unknown_tag",
"LowParse.Spec.Sum.dsum_key",
"LowParse.Slice.srel",
"LowParse.Bytes.byte",
"LowParse.Low.Sum.accessor_clens_dsum_payload'",
"LowParse.Slice.slice",
"FStar.UInt32.t",
"FStar.Monotonic.HyperStack.mem",
"Prims.l_and",
"LowParse.Low.Base.Spec.valid",
"LowParse.Spec.Sum.parse_dsum_kind",
"LowParse.Spec.Sum.dsum_type",
"LowParse.Spec.Sum.parse_dsum",
"LowParse.Low.Base.Spec.__proj__Mkclens__item__clens_cond",
"LowParse.Spec.Sum.dsum_type_of_tag",
"LowParse.Low.Sum.clens_dsum_payload",
"LowParse.Low.Base.Spec.contents",
"LowStar.Monotonic.Buffer.modifies",
"LowStar.Monotonic.Buffer.loc_none",
"Prims.eq2",
"LowParse.Low.Base.Spec.slice_access",
"LowParse.Spec.Sum.parse_dsum_cases_kind",
"LowParse.Spec.Sum.parse_dsum_type_of_tag'",
"LowParse.Low.Sum.gaccessor_clens_dsum_payload",
"LowParse.Low.Base.accessor"
] | [] | false | false | false | false | false | let accessor_clens_dsum_payload
(#kt: parser_kind)
(t: dsum)
(#p: parser kt (dsum_repr_type t))
(j: jumper p)
(f: (x: dsum_known_key t -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x))))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
(k: dsum_key t)
: Tot (accessor (gaccessor_clens_dsum_payload t p f g k)) =
| fun #rrel #rel -> accessor_clens_dsum_payload' t j f g k #rrel #rel | false |
Vale.Curve25519.Fast_defs.fst | Vale.Curve25519.Fast_defs.pow2_448 | val pow2_448 : Prims.int | let pow2_448 = 0x10000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000 | {
"file_name": "vale/code/crypto/ecc/curve25519/Vale.Curve25519.Fast_defs.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 137,
"end_line": 15,
"start_col": 7,
"start_line": 15
} | module Vale.Curve25519.Fast_defs
open Vale.Def.Words_s
open Vale.Def.Types_s
open FStar.Mul
unfold let pow2_192 = 0x1000000000000000000000000000000000000000000000000
let _ = assert_norm (pow2 192 = pow2_192)
unfold let pow2_256 = 0x10000000000000000000000000000000000000000000000000000000000000000
let _ = assert_norm (pow2 256 = pow2_256)
unfold let pow2_320 = 0x100000000000000000000000000000000000000000000000000000000000000000000000000000000
let _ = assert_norm (pow2 320 = pow2_320)
unfold let pow2_384 = 0x1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000 | {
"checked_file": "/",
"dependencies": [
"Vale.Def.Words_s.fsti.checked",
"Vale.Def.Types_s.fst.checked",
"Vale.Curve25519.Fast_lemmas_internal.fsti.checked",
"Vale.Arch.Types.fsti.checked",
"prims.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked"
],
"interface_file": false,
"source_file": "Vale.Curve25519.Fast_defs.fst"
} | [
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Def.Types_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Def.Words_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Curve25519",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Curve25519",
"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",
"short_module": null
}
] | {
"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_elim_box": true,
"smtencoding_l_arith_repr": "native",
"smtencoding_nl_arith_repr": "wrapped",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": false,
"z3cliopt": [
"smt.arith.nl=false",
"smt.QI.EAGER_THRESHOLD=100",
"smt.CASE_SPLIT=3"
],
"z3refresh": false,
"z3rlimit": 5,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | false | Prims.int | Prims.Tot | [
"total"
] | [] | [] | [] | false | false | false | true | false | let pow2_448 =
| 0x10000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000 | false |
|
Vale.Curve25519.Fast_defs.fst | Vale.Curve25519.Fast_defs.pow2_512 | val pow2_512 : Prims.int | let pow2_512 = 0x100000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000 | {
"file_name": "vale/code/crypto/ecc/curve25519/Vale.Curve25519.Fast_defs.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 153,
"end_line": 17,
"start_col": 7,
"start_line": 17
} | module Vale.Curve25519.Fast_defs
open Vale.Def.Words_s
open Vale.Def.Types_s
open FStar.Mul
unfold let pow2_192 = 0x1000000000000000000000000000000000000000000000000
let _ = assert_norm (pow2 192 = pow2_192)
unfold let pow2_256 = 0x10000000000000000000000000000000000000000000000000000000000000000
let _ = assert_norm (pow2 256 = pow2_256)
unfold let pow2_320 = 0x100000000000000000000000000000000000000000000000000000000000000000000000000000000
let _ = assert_norm (pow2 320 = pow2_320)
unfold let pow2_384 = 0x1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000
let _ = assert_norm (pow2 384 = pow2_384)
unfold let pow2_448 = 0x10000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000 | {
"checked_file": "/",
"dependencies": [
"Vale.Def.Words_s.fsti.checked",
"Vale.Def.Types_s.fst.checked",
"Vale.Curve25519.Fast_lemmas_internal.fsti.checked",
"Vale.Arch.Types.fsti.checked",
"prims.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked"
],
"interface_file": false,
"source_file": "Vale.Curve25519.Fast_defs.fst"
} | [
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Def.Types_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Def.Words_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Curve25519",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Curve25519",
"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",
"short_module": null
}
] | {
"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_elim_box": true,
"smtencoding_l_arith_repr": "native",
"smtencoding_nl_arith_repr": "wrapped",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": false,
"z3cliopt": [
"smt.arith.nl=false",
"smt.QI.EAGER_THRESHOLD=100",
"smt.CASE_SPLIT=3"
],
"z3refresh": false,
"z3rlimit": 5,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | false | Prims.int | Prims.Tot | [
"total"
] | [] | [] | [] | false | false | false | true | false | let pow2_512 =
| 0x100000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000 | false |
|
LowParse.Low.Sum.fst | LowParse.Low.Sum.jump_dsum_cases | val jump_dsum_cases
(s: dsum)
(f: (x: dsum_known_key s -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x))))
(f': (x: dsum_known_key s -> Tot (jumper (dsnd (f x)))))
(#k: parser_kind)
(#g: parser k (dsum_type_of_unknown_tag s))
(g': jumper g)
(destr: dep_enum_destr _ (fun k -> jump_dsum_cases_t s f g (Known k)))
(x: dsum_key s)
: Tot (jumper (parse_dsum_cases s f g x)) | val jump_dsum_cases
(s: dsum)
(f: (x: dsum_known_key s -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x))))
(f': (x: dsum_known_key s -> Tot (jumper (dsnd (f x)))))
(#k: parser_kind)
(#g: parser k (dsum_type_of_unknown_tag s))
(g': jumper g)
(destr: dep_enum_destr _ (fun k -> jump_dsum_cases_t s f g (Known k)))
(x: dsum_key s)
: Tot (jumper (parse_dsum_cases s f g x)) | let jump_dsum_cases
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(f' : (x: dsum_known_key s) -> Tot (jumper (dsnd (f x))))
(#k: parser_kind)
(#g: parser k (dsum_type_of_unknown_tag s))
(g' : jumper g)
(destr: dep_enum_destr _ (fun k -> jump_dsum_cases_t s f g (Known k)))
(x: dsum_key s)
: Tot (jumper (parse_dsum_cases s f g x))
= fun #rrel #rel input pos ->
let h = HST.get () in
[@inline_let]
let _ =
valid_facts (parse_dsum_cases' s f g x) h input pos;
valid_facts (parse_dsum_cases s f g x) h input pos;
parse_dsum_cases_eq' s f g x (bytes_of_slice_from h input pos)
in
jump_dsum_cases'_destr s f f' g' destr x input pos | {
"file_name": "src/lowparse/LowParse.Low.Sum.fst",
"git_rev": "00217c4a89f5ba56002ba9aa5b4a9d5903bfe9fa",
"git_url": "https://github.com/project-everest/everparse.git",
"project_name": "everparse"
} | {
"end_col": 52,
"end_line": 1478,
"start_col": 0,
"start_line": 1460
} | module LowParse.Low.Sum
include LowParse.Low.Enum
include LowParse.Spec.Sum
module U32 = FStar.UInt32
module HST = FStar.HyperStack.ST
module B = LowStar.Buffer
module Cast = FStar.Int.Cast
module U64 = FStar.UInt64
inline_for_extraction
let validate_sum_cases_aux
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(vc: ((x: sum_key t) -> Tot (validator (dsnd (pc x)))))
(k: sum_key t)
: Tot (validator (parse_sum_cases t pc k))
= [@inline_let]
let _ = synth_sum_case_injective t k in
validate_synth
(validate_weaken
(weaken_parse_cases_kind t pc)
(vc k)
()
)
(synth_sum_case t k)
()
inline_for_extraction
let validate_sum_cases_t
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot Type
= validator (parse_sum_cases t pc k)
let validate_sum_cases_t_eq
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
(x y : validate_sum_cases_t t pc k)
: GTot Type0
= True
inline_for_extraction
let validate_sum_cases_t_if
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (if_combinator _ (validate_sum_cases_t_eq t pc k))
= fun cond (sv_true: cond_true cond -> Tot (validate_sum_cases_t t pc k)) (sv_false: cond_false cond -> Tot (validate_sum_cases_t t pc k)) #rrel #rel input pos ->
if cond
then sv_true () input pos
else sv_false () input pos
inline_for_extraction
let validate_sum_cases
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(vc: ((x: sum_key t) -> Tot (validator (dsnd (pc x)))))
(destr: dep_enum_destr (sum_enum t) (validate_sum_cases_t t pc))
(k: sum_key t)
: Tot (validator (parse_sum_cases t pc k))
= destr
_
(validate_sum_cases_t_if t pc)
(fun _ _ -> ())
(fun _ _ _ _ -> ())
(validate_sum_cases_aux t pc vc)
k
inline_for_extraction
let validate_sum_aux_payload_t
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
: Tot Type
= (#rrel: _) -> (#rel: _) ->
(input: slice rrel rel) ->
(pos: U64.t) ->
HST.Stack U64.t
(requires (fun h -> live_slice h input /\ U64.v pos <= U32.v input.len))
(ensures (fun h res h' ->
B.modifies B.loc_none h h' /\ (
match k with
| Unknown _ -> is_error res
| Known k' ->
if is_success res
then
valid_pos (dsnd (pc k')) h input (uint64_to_uint32 pos) (uint64_to_uint32 res)
else
(~ (valid (dsnd (pc k')) h input (uint64_to_uint32 pos)))
)))
let validate_sum_aux_payload_eq
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
: Tot (validate_sum_aux_payload_t t pc k -> validate_sum_aux_payload_t t pc k -> GTot Type0)
= fun _ _ -> True
inline_for_extraction
let validate_sum_aux_payload_if'
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
(cond: bool)
(ift: ((cond_true cond) -> Tot (validate_sum_aux_payload_t t pc k)))
(iff: ((cond_false cond) -> Tot (validate_sum_aux_payload_t t pc k)))
: Tot (validate_sum_aux_payload_t t pc k)
= fun #rrel #rel input pos ->
if cond
then begin
(ift () <: validate_sum_aux_payload_t t pc k) input pos
end else
(iff () <: validate_sum_aux_payload_t t pc k) input pos
inline_for_extraction
let validate_sum_aux_payload_if
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
: Tot (if_combinator _ (validate_sum_aux_payload_eq t pc k))
= validate_sum_aux_payload_if' t pc k
#push-options "--z3rlimit 64 --z3cliopt smt.arith.nl=false --using_facts_from '* -FStar.Int.Cast -LowParse.BitFields'"
// --query_stats --smtencoding.elim_box true --smtencoding.l_arith_repr native --z3refresh"
inline_for_extraction
let validate_sum_aux
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(v: validator p)
(p32: leaf_reader p)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(v_payload: ((k: sum_repr_type t)) -> Tot (validate_sum_aux_payload_t t pc (maybe_enum_key_of_repr (sum_enum t) k)))
: Tot (validator (parse_sum t p pc))
= fun #rrel #rel input pos ->
let h = HST.get () in
[@inline_let]
let _ = parse_sum_eq'' t p pc (bytes_of_slice_from h input (uint64_to_uint32 pos)) in
[@inline_let]
let _ = valid_facts (parse_sum t p pc) h input (uint64_to_uint32 pos) in
[@inline_let]
let _ = valid_facts p h input (uint64_to_uint32 pos) in
let len_after_tag = v input pos in
if is_error len_after_tag
then len_after_tag
else begin
let h1 = HST.get () in
let k' = p32 input (uint64_to_uint32 pos) in
[@inline_let]
let _ =
match maybe_enum_key_of_repr (sum_enum t) k' with
| Known k -> valid_facts (dsnd (pc k)) h input (uint64_to_uint32 len_after_tag)
| _ -> ()
in
v_payload k' input len_after_tag
end
#pop-options
inline_for_extraction
let validate_sum_aux_payload'
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (validator (dsnd (pc x)))))
(k: maybe_enum_key (sum_enum t))
: Tot (validate_sum_aux_payload_t t pc k)
= fun #rrel #rel input pos ->
match k with
| Known k ->
[@inline_let]
let _ = synth_sum_case_injective t k in
pc32 k input pos
// validate_synth (pc32 k) (synth_sum_case t k) () input pos
| _ -> validator_error_generic
inline_for_extraction
let validate_sum_aux_payload
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (validator (dsnd (pc x)))))
(destr: dep_maybe_enum_destr_t (sum_enum t) (validate_sum_aux_payload_t t pc))
(k: sum_repr_type t)
: Tot (validate_sum_aux_payload_t t pc (maybe_enum_key_of_repr (sum_enum t) k))
= destr (validate_sum_aux_payload_eq t pc) (validate_sum_aux_payload_if t pc) (fun _ _ -> ()) (fun _ _ _ _ -> ()) (validate_sum_aux_payload' t pc pc32) k
inline_for_extraction
let validate_sum
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(v: validator p)
(p32: leaf_reader p)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (validator (dsnd (pc x)))))
(destr: dep_maybe_enum_destr_t (sum_enum t) (validate_sum_aux_payload_t t pc))
: Tot (validator (parse_sum t p pc))
= validate_sum_aux t v p32 pc (validate_sum_aux_payload t pc pc32 destr)
module HS = FStar.HyperStack
#push-options "--z3rlimit 256 --z3cliopt smt.arith.nl=false --initial_ifuel 8 --max_ifuel 8 --initial_fuel 2 --max_fuel 2"
#restart-solver
let valid_sum_intro
(h: HS.mem)
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: Lemma
(requires (
valid (parse_enum_key p (sum_enum t)) h input pos /\ (
let k = contents (parse_enum_key p (sum_enum t)) h input pos in
valid (dsnd (pc k)) h input (get_valid_pos (parse_enum_key p (sum_enum t)) h input pos)
)))
(ensures (
let k = contents (parse_enum_key p (sum_enum t)) h input pos in
let pos_payload = get_valid_pos (parse_enum_key p (sum_enum t)) h input pos in
valid_content_pos
(parse_sum t p pc) h input pos
(synth_sum_case t k (contents (dsnd (pc k)) h input pos_payload))
(get_valid_pos (dsnd (pc k)) h input pos_payload)
))
= valid_facts (parse_enum_key p (sum_enum t)) h input pos;
let k = contents (parse_enum_key p (sum_enum t)) h input pos in
let pos_payload = get_valid_pos (parse_enum_key p (sum_enum t)) h input pos in
valid_facts (dsnd (pc k)) h input pos_payload;
valid_facts (parse_sum t p pc) h input pos;
parse_sum_eq t p pc (bytes_of_slice_from h input pos)
#pop-options
inline_for_extraction
let finalize_sum_case
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(s: serializer p)
(w: leaf_writer_strong s)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(destr: enum_repr_of_key'_t (sum_enum t))
(k: sum_key t)
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: HST.Stack unit
(requires (fun h ->
let len_tag = serialized_length (serialize_enum_key _ s (sum_enum t)) k in
U32.v pos + len_tag < 4294967296 /\ (
let pos_payload = pos `U32.add` U32.uint_to_t len_tag in
valid (dsnd (pc k)) h input pos_payload /\
writable input.base (U32.v pos) (U32.v pos_payload) h
)))
(ensures (fun h _ h' ->
let len_tag = serialized_length (serialize_enum_key _ s (sum_enum t)) k in
let pos_payload = pos `U32.add` U32.uint_to_t len_tag in
B.modifies (loc_slice_from_to input pos pos_payload) h h' /\
valid_content_pos (parse_sum t p pc) h' input pos (synth_sum_case t k (contents (dsnd (pc k)) h input pos_payload)) (get_valid_pos (dsnd (pc k)) h input pos_payload)
))
= let pos1 = write_enum_key w (sum_enum t) destr k input pos in
let h = HST.get () in
[@inline_let]
let _ = valid_sum_intro h t p pc input pos in
()
inline_for_extraction
let jump_sum_cases_aux
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(vc: ((x: sum_key t) -> Tot (jumper (dsnd (pc x)))))
(k: sum_key t)
: Tot (jumper (parse_sum_cases t pc k))
= [@inline_let]
let _ = synth_sum_case_injective t k in
jump_synth
(jump_weaken
(weaken_parse_cases_kind t pc)
(vc k)
()
)
(synth_sum_case t k)
()
inline_for_extraction
let jump_sum_cases_t
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot Type
= jumper (parse_sum_cases t pc k)
let jump_sum_cases_t_eq
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
(x y : jump_sum_cases_t t pc k)
: GTot Type0
= True
inline_for_extraction
let jump_sum_cases_t_if
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (if_combinator _ (jump_sum_cases_t_eq t pc k))
= fun cond (sv_true: cond_true cond -> Tot (jump_sum_cases_t t pc k)) (sv_false: cond_false cond -> Tot (jump_sum_cases_t t pc k)) #rrel #rel input pos ->
if cond
then sv_true () input pos
else sv_false () input pos
inline_for_extraction
let jump_sum_cases
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(vc: ((x: sum_key t) -> Tot (jumper (dsnd (pc x)))))
(destr: dep_enum_destr (sum_enum t) (jump_sum_cases_t t pc))
(k: sum_key t)
: Tot (jumper (parse_sum_cases t pc k))
= destr
_
(jump_sum_cases_t_if t pc)
(fun _ _ -> ())
(fun _ _ _ _ -> ())
(jump_sum_cases_aux t pc vc)
k
inline_for_extraction
let jump_sum_aux_payload_t
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
: Tot Type
= (#rrel: _) -> (#rel: _) ->
(input: slice rrel rel) ->
(pos: U32.t) ->
HST.Stack U32.t
(requires (fun h -> live_slice h input /\ U32.v pos <= U32.v input.len /\ (
match k with
| Unknown _ -> False
| Known k' -> valid (dsnd (pc k')) h input pos
)))
(ensures (fun h res h' ->
B.modifies B.loc_none h h' /\ (
match k with
| Unknown _ -> False
| Known k' ->
valid_pos (dsnd (pc k')) h input pos res
)))
let jump_sum_aux_payload_eq
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
: Tot (jump_sum_aux_payload_t t pc k -> jump_sum_aux_payload_t t pc k -> GTot Type0)
= fun _ _ -> True
inline_for_extraction
let jump_sum_aux_payload_if'
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
(cond: bool)
(ift: ((cond_true cond) -> Tot (jump_sum_aux_payload_t t pc k)))
(iff: ((cond_false cond) -> Tot (jump_sum_aux_payload_t t pc k)))
: Tot (jump_sum_aux_payload_t t pc k)
= fun #rrel #rel input pos ->
if cond
then begin
(ift () <: jump_sum_aux_payload_t t pc k) input pos
end else
(iff () <: jump_sum_aux_payload_t t pc k) input pos
inline_for_extraction
let jump_sum_aux_payload_if
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
: Tot (if_combinator _ (jump_sum_aux_payload_eq t pc k))
= jump_sum_aux_payload_if' t pc k
let parse_sum_eq3
(#kt: parser_kind)
(t: sum)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(input: bytes)
(k' : sum_repr_type t)
(consumed_k: consumed_length input)
: Lemma
(requires (Some? (parse (parse_sum t p pc) input) /\ parse p input == Some (k', consumed_k)))
(ensures (
let input_k = Seq.slice input consumed_k (Seq.length input) in
let k = maybe_enum_key_of_repr (sum_enum t) k' in
begin match k with
| Known k ->
Some? (parse (dsnd (pc k)) input_k)
| _ -> False
end
))
= parse_sum_eq'' t p pc input
let parse_sum_eq4
(#kt: parser_kind)
(t: sum)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(input: bytes)
(k' : sum_repr_type t)
(consumed_k: consumed_length input)
(consumed_payload: nat)
: Lemma
(requires (Some? (parse (parse_sum t p pc) input) /\ parse p input == Some (k', consumed_k) /\ (
let input_k = Seq.slice input consumed_k (Seq.length input) in
let k = maybe_enum_key_of_repr (sum_enum t) k' in
begin match k with
| Known k ->
Some? (parse (dsnd (pc k)) input_k) /\ (
let Some (_, consumed_payload') = parse (dsnd (pc k)) input_k in
consumed_payload' == consumed_payload
)
| _ -> False
end
)))
(ensures (
let Some (_, consumed) = parse (parse_sum t p pc) input in
consumed == consumed_k + consumed_payload
))
= parse_sum_eq'' t p pc input
#push-options "--z3rlimit 16"
let valid_sum_elim
(h: HS.mem)
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(#rrel: _) (#rel: _)
(input: slice rrel rel)
(pos: U32.t)
: Lemma
(requires (
valid (parse_sum t p pc) h input pos
))
(ensures (
valid p h input pos /\ (
let pos_payload = get_valid_pos p h input pos in
let k' = maybe_enum_key_of_repr (sum_enum t) (contents p h input pos) in
match k' with
| Known k ->
k == sum_tag_of_data t (contents (parse_sum t p pc) h input pos) /\
valid (dsnd (pc k)) h input pos_payload /\
valid_pos
(parse_sum t p pc) h input pos
(get_valid_pos (dsnd (pc k)) h input pos_payload)
| _ -> False
)))
= let sinput = bytes_of_slice_from h input pos in
let _ = parse_sum_eq'' t p pc sinput in
[@inline_let]
let _ = valid_facts (parse_sum t p pc) h input pos in
let Some (k', consumed_k) = parse p sinput in
let pos_after_tag = U32.uint_to_t (U32.v pos + consumed_k) in
[@inline_let]
let _ = valid_facts p h input pos in
assert (valid_content_pos p h input pos k' pos_after_tag);
match maybe_enum_key_of_repr (sum_enum t) k' with
| Known k -> valid_facts (dsnd (pc k)) h input pos_after_tag
| _ -> ()
#pop-options
let valid_sum_elim_tag
(h: HS.mem)
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: Lemma
(requires (
valid (parse_sum t p pc) h input pos
))
(ensures (
valid (parse_enum_key p (sum_enum t)) h input pos /\
contents (parse_enum_key p (sum_enum t)) h input pos == sum_tag_of_data t (contents (parse_sum t p pc) h input pos)
))
= let _ = parse_sum_eq' t p pc (bytes_of_slice_from h input pos) in
let _ = valid_facts (parse_sum t p pc) h input pos in
let _ = valid_facts (parse_enum_key p (sum_enum t)) h input pos in
()
inline_for_extraction
let read_sum_tag
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(p32: leaf_reader p)
(destr: dep_maybe_enum_destr_t (sum_enum t) (read_enum_key_t (sum_enum t)))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: HST.Stack (sum_key t)
(requires (fun h ->
valid (parse_sum t p pc) h input pos
))
(ensures (fun h res h' ->
B.modifies B.loc_none h h' /\
res == sum_tag_of_data t (contents (parse_sum t p pc) h input pos)
))
= let h = HST.get () in
[@inline_let] let _ = valid_sum_elim_tag h t p pc input pos in
read_enum_key p32 (sum_enum t) destr input pos
inline_for_extraction
let jump_sum_aux
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(v: jumper p)
(p32: leaf_reader p)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(v_payload: ((k: sum_repr_type t)) -> Tot (jump_sum_aux_payload_t t pc (maybe_enum_key_of_repr (sum_enum t) k)))
: Tot (jumper (parse_sum t p pc))
= fun #rrel #rel input pos ->
let h = HST.get () in
[@inline_let]
let _ = valid_sum_elim h t p pc input pos in
let pos_after_tag = v input pos in
let k' = p32 input pos in
v_payload k' input pos_after_tag
inline_for_extraction
let jump_sum_aux_payload'
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (jumper (dsnd (pc x)))))
(k: maybe_enum_key (sum_enum t))
: Tot (jump_sum_aux_payload_t t pc k)
= fun #rrel #rel input pos ->
match k with
| Known k ->
[@inline_let]
let _ = synth_sum_case_injective t k in
pc32 k input pos
| _ -> 0ul // dummy, but we MUST NOT remove this branch, otherwise extraction fails
inline_for_extraction
let jump_sum_aux_payload
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (jumper (dsnd (pc x)))))
(destr: dep_maybe_enum_destr_t (sum_enum t) (jump_sum_aux_payload_t t pc))
(k: sum_repr_type t)
: Tot (jump_sum_aux_payload_t t pc (maybe_enum_key_of_repr (sum_enum t) k))
= destr (jump_sum_aux_payload_eq t pc) (jump_sum_aux_payload_if t pc) (fun _ _ -> ()) (fun _ _ _ _ -> ()) (jump_sum_aux_payload' t pc pc32) k
inline_for_extraction
let jump_sum
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(v: jumper p)
(p32: leaf_reader p)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (jumper (dsnd (pc x)))))
(destr: dep_maybe_enum_destr_t (sum_enum t) (jump_sum_aux_payload_t t pc))
: Tot (jumper (parse_sum t p pc))
= jump_sum_aux t v p32 pc (jump_sum_aux_payload t pc pc32 destr)
inline_for_extraction
let read_sum_cases'
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (leaf_reader (dsnd (pc x)))))
(k: sum_key t)
: Tot (leaf_reader (parse_sum_cases' t pc k))
= [@inline_let]
let _ = synth_sum_case_injective t k in
read_synth'
(dsnd (pc k))
(synth_sum_case t k)
(pc32 k)
()
inline_for_extraction
let read_sum_cases_t
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot Type
= leaf_reader (parse_sum_cases' t pc k)
let read_sum_cases_t_eq
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
(x y : read_sum_cases_t t pc k)
: GTot Type0
= True
inline_for_extraction
let read_sum_cases_t_if
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (if_combinator _ (read_sum_cases_t_eq t pc k))
= fun cond (sv_true: cond_true cond -> Tot (read_sum_cases_t t pc k)) (sv_false: cond_false cond -> Tot (read_sum_cases_t t pc k)) #_ #_ input pos ->
if cond
then (sv_true () input pos)
else (sv_false () input pos)
inline_for_extraction
let read_sum_cases
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (leaf_reader (dsnd (pc x)))))
(destr: dep_enum_destr (sum_enum t) (read_sum_cases_t t pc))
(k: sum_key t)
: Tot (leaf_reader (parse_sum_cases' t pc k))
= destr
_
(read_sum_cases_t_if t pc)
(fun _ _ -> ())
(fun _ _ _ _ -> ())
(read_sum_cases' t pc pc32)
k
#push-options "--z3rlimit 32"
inline_for_extraction
let read_sum
(#kt: parser_kind)
(t: sum)
(p: parser kt (sum_repr_type t))
(p32: leaf_reader (parse_enum_key p (sum_enum t)))
(j: jumper p)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (leaf_reader (dsnd (pc x)))))
(destr: dep_enum_destr (sum_enum t) (read_sum_cases_t t pc))
: Tot (leaf_reader (parse_sum t p pc))
=
fun #_ #_ input pos ->
let h = HST.get () in
valid_facts (parse_sum t p pc) h input pos;
parse_sum_eq' t p pc (bytes_of_slice_from h input pos);
valid_facts (parse_enum_key p (sum_enum t)) h input pos;
let k = p32 input pos in
let pos' = jump_enum_key j (sum_enum t) input pos in
valid_facts (parse_sum_cases' t pc k) h input pos' ;
read_sum_cases t pc pc32 destr k input pos'
#pop-options
inline_for_extraction
let serialize32_sum_cases_t
(t: sum)
(#pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(sc: ((x: sum_key t) -> Tot (serializer (dsnd (pc x)))))
(k: sum_key t)
: Tot Type
= serializer32 (serialize_sum_cases t pc sc k)
let serialize32_sum_cases_t_eq
(t: sum)
(#pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(sc: ((x: sum_key t) -> Tot (serializer (dsnd (pc x)))))
(k: sum_key t)
(x y: serialize32_sum_cases_t t sc k)
: GTot Type0
= True
inline_for_extraction
let serialize32_sum_cases_t_if
(t: sum)
(#pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(sc: ((x: sum_key t) -> Tot (serializer (dsnd (pc x)))))
(k: sum_key t)
: Tot (if_combinator _ (serialize32_sum_cases_t_eq t sc k))
= fun cond (sv_true: (cond_true cond -> Tot (serialize32_sum_cases_t t sc k))) (sv_false: (cond_false cond -> Tot (serialize32_sum_cases_t t sc k))) x #rrel #rel b pos ->
if cond
then (sv_true () x b pos)
else (sv_false () x b pos)
inline_for_extraction
let serialize32_sum_cases_aux
(t: sum)
(#pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(sc: ((x: sum_key t) -> Tot (serializer (dsnd (pc x)))))
(sc32: ((x: sum_key t) -> Tot (serializer32 (sc x))))
(k: sum_key t)
: Tot (serializer32 (serialize_sum_cases t pc sc k))
= fun x #rrel #rel b pos ->
[@inline_let] let _ =
Classical.forall_intro (parse_sum_cases_eq' t pc k);
synth_sum_case_injective t k;
synth_sum_case_inverse t k
in
serialize32_synth
(sc32 k)
(synth_sum_case t k)
(synth_sum_case_recip t k)
(fun x -> synth_sum_case_recip t k x)
()
x
b
pos
inline_for_extraction
let serialize32_sum_cases
(t: sum)
(#pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(sc: ((x: sum_key t) -> Tot (serializer (dsnd (pc x)))))
(sc32: ((x: sum_key t) -> Tot (serializer32 (sc x))))
(destr: dep_enum_destr (sum_enum t) (serialize32_sum_cases_t t sc))
(k: sum_key t)
: Tot (serializer32 (serialize_sum_cases t pc sc k))
= destr
_
(serialize32_sum_cases_t_if t sc)
(fun _ _ -> ())
(fun _ _ _ _ -> ())
(serialize32_sum_cases_aux t sc sc32)
k
inline_for_extraction
let serialize32_sum
(#kt: parser_kind)
(t: sum)
(#p: parser kt (sum_repr_type t))
(s: serializer p {kt.parser_kind_subkind == Some ParserStrong})
(s32: serializer32 (serialize_enum_key _ s (sum_enum t)))
(#pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(sc: ((x: sum_key t) -> Tot (serializer (dsnd (pc x)))))
(sc32: ((x: sum_key t) -> Tot (serializer32 (sc x))))
(destr: dep_enum_destr (sum_enum t) (serialize32_sum_cases_t t sc))
: Tot (serializer32 (serialize_sum t s sc))
= fun x #rrel #rel b pos ->
serialize_sum_eq t s sc x;
let tg = sum_tag_of_data t x in
serialize32_nondep_then_aux s32 (serialize32_sum_cases t sc sc32 destr tg) tg x b pos
let clens_sum_tag
(s: sum)
: Tot (clens (sum_type s) (sum_key s))
= {
clens_cond = (fun _ -> True);
clens_get = sum_tag_of_data s;
}
let gaccessor_sum_tag
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
: Tot (gaccessor (parse_sum t p pc) (parse_enum_key p (sum_enum t)) (clens_sum_tag t))
= gaccessor_tagged_union_tag
(parse_enum_key p (sum_enum t))
(sum_tag_of_data t)
(parse_sum_cases t pc)
inline_for_extraction
let accessor_sum_tag
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
: Tot (accessor (gaccessor_sum_tag t p pc))
= accessor_tagged_union_tag
(parse_enum_key p (sum_enum t))
(sum_tag_of_data t)
(parse_sum_cases t pc)
let clens_sum_payload
(s: sum)
(k: sum_key s)
: Tot (clens (sum_type s) (sum_type_of_tag s k))
= {
clens_cond = (fun (x: sum_type s) -> sum_tag_of_data s x == k);
clens_get = (fun (x: sum_type s) -> synth_sum_case_recip s k x <: Ghost (sum_type_of_tag s k) (requires (sum_tag_of_data s x == k)) (ensures (fun _ -> True)));
}
#push-options "--z3rlimit 32"
let gaccessor_clens_sum_payload'
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (gaccessor' (parse_sum t p pc) (dsnd (pc k)) (clens_sum_payload t k))
= fun (input: bytes) ->
parse_sum_eq'' t p pc input;
let res =
match parse p input with
| Some (_, consumed) ->
synth_sum_case_inverse t k;
synth_sum_case_injective t k;
synth_injective_synth_inverse_synth_inverse_recip (synth_sum_case t k) (synth_sum_case_recip t k) ();
(consumed)
| _ -> 0 // dummy
in
(res <: (res: _ { gaccessor_post' (parse_sum t p pc) (dsnd (pc k)) (clens_sum_payload t k) input res } ))
#push-options "--z3rlimit 64"
let gaccessor_clens_sum_payload_injective
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
(sl sl' : bytes)
: Lemma
(requires (
gaccessor_pre (parse_sum t p pc) (dsnd (pc k)) (clens_sum_payload t k) sl /\
gaccessor_pre (parse_sum t p pc) (dsnd (pc k)) (clens_sum_payload t k) sl' /\
injective_precond (parse_sum t p pc) sl sl'
))
(ensures (gaccessor_clens_sum_payload' t p pc k sl == gaccessor_clens_sum_payload' t p pc k sl'))
= parse_sum_eq'' t p pc sl;
parse_sum_eq'' t p pc sl' ;
parse_injective (parse_sum t p pc) sl sl' ;
parse_injective p sl sl'
#pop-options
let gaccessor_clens_sum_payload_no_lookahead
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
(sl sl' : bytes)
: Lemma
(requires (
(parse_sum_kind kt t pc).parser_kind_subkind == Some ParserStrong /\
gaccessor_pre (parse_sum t p pc) (dsnd (pc k)) (clens_sum_payload t k) sl /\
gaccessor_pre (parse_sum t p pc) (dsnd (pc k)) (clens_sum_payload t k) sl' /\
no_lookahead_on_precond (parse_sum t p pc) sl sl'
))
(ensures (gaccessor_clens_sum_payload' t p pc k sl == gaccessor_clens_sum_payload' t p pc k sl'))
= parse_sum_eq'' t p pc sl;
parse_sum_eq'' t p pc sl' ;
parse_strong_prefix (parse_sum t p pc) sl sl' ;
parse_injective p sl sl'
let gaccessor_clens_sum_payload
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (gaccessor (parse_sum t p pc) (dsnd (pc k)) (clens_sum_payload t k))
= Classical.forall_intro_2 (fun x -> Classical.move_requires (gaccessor_clens_sum_payload_injective t p pc k x));
Classical.forall_intro_2 (fun x -> Classical.move_requires (gaccessor_clens_sum_payload_no_lookahead t p pc k x));
gaccessor_prop_equiv (parse_sum t p pc) (dsnd (pc k)) (clens_sum_payload t k) (gaccessor_clens_sum_payload' t p pc k);
gaccessor_clens_sum_payload' t p pc k
inline_for_extraction
let accessor_clens_sum_payload'
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(j: jumper p)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: HST.Stack U32.t
(requires (fun h ->
valid (parse_sum t p pc) h input pos /\
(clens_sum_payload t k).clens_cond (contents (parse_sum t p pc) h input pos)
))
(ensures (fun h pos' h' ->
B.modifies B.loc_none h h' /\
pos' == slice_access h (gaccessor_clens_sum_payload t p pc k) input pos
))
=
let h = HST.get () in
[@inline_let]
let _ =
let pos' = get_valid_pos (parse_sum t p pc) h input pos in
let large = bytes_of_slice_from h input pos in
slice_access_eq h (gaccessor_clens_sum_payload t p pc k) input pos;
valid_facts (parse_sum t p pc) h input pos;
parse_sum_eq'' t p pc large;
valid_facts p h input pos
in
j input pos
#pop-options
inline_for_extraction
let accessor_clens_sum_payload
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(j: jumper p)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (accessor (gaccessor_clens_sum_payload t p pc k))
= fun #rrel #rel -> accessor_clens_sum_payload' t j pc k #rrel #rel
let clens_sum_cases_payload
(s: sum)
(k: sum_key s)
: Tot (clens (sum_cases s k) (sum_type_of_tag s k))
= {
clens_cond = (fun (x: sum_cases s k) -> True);
clens_get = (fun (x: sum_cases s k) -> synth_sum_case_recip s k x <: Ghost (sum_type_of_tag s k) (requires (True)) (ensures (fun _ -> True)));
}
let gaccessor_clens_sum_cases_payload
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (gaccessor (parse_sum_cases' t pc k) (dsnd (pc k)) (clens_sum_cases_payload t k))
= synth_sum_case_injective t k;
synth_sum_case_inverse t k;
synth_injective_synth_inverse_synth_inverse_recip (synth_sum_case t k) (synth_sum_case_recip t k) ();
gaccessor_ext
(gaccessor_synth (dsnd (pc k)) (synth_sum_case t k) (synth_sum_case_recip t k) ())
(clens_sum_cases_payload t k)
()
inline_for_extraction
let accessor_clens_sum_cases_payload
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (accessor (gaccessor_clens_sum_cases_payload t pc k))
= [@inline_let]
let _ =
synth_sum_case_injective t k;
synth_sum_case_inverse t k;
synth_injective_synth_inverse_synth_inverse_recip (synth_sum_case t k) (synth_sum_case_recip t k) ()
in
accessor_ext
(accessor_synth (dsnd (pc k)) (synth_sum_case t k) (synth_sum_case_recip t k) ())
(clens_sum_cases_payload t k)
()
inline_for_extraction
let validate_dsum_cases_t
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(#k: parser_kind)
(g: parser k (dsum_type_of_unknown_tag s))
(x: dsum_key s)
: Tot Type
= validator (parse_dsum_cases' s f g x)
let validate_dsum_cases_eq
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(#k: parser_kind)
(g: parser k (dsum_type_of_unknown_tag s))
(x: dsum_key s)
(v1 v2 : validate_dsum_cases_t s f g x)
: GTot Type0
= True
inline_for_extraction
let validate_dsum_cases_if'
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(#k: parser_kind)
(g: parser k (dsum_type_of_unknown_tag s))
(x: dsum_key s)
(cond: bool)
(ift: (cond_true cond -> Tot (validate_dsum_cases_t s f g x)))
(iff: (cond_false cond -> Tot (validate_dsum_cases_t s f g x)))
: Tot (validate_dsum_cases_t s f g x)
= fun #rrel #rel input len ->
if cond
then (ift () <: validate_dsum_cases_t s f g x) input len
else (iff () <: validate_dsum_cases_t s f g x) input len
inline_for_extraction
let validate_dsum_cases_if
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(#k: parser_kind)
(g: parser k (dsum_type_of_unknown_tag s))
(x: dsum_key s)
: Tot (if_combinator _ (validate_dsum_cases_eq s f g x))
= validate_dsum_cases_if' s f g x
inline_for_extraction
let validate_dsum_cases'
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(f' : (x: dsum_known_key s) -> Tot (validator (dsnd (f x))))
(#k: parser_kind)
(#g: parser k (dsum_type_of_unknown_tag s))
(g' : validator g)
(x: dsum_key s)
: Tot (validate_dsum_cases_t s f g x)
= [@inline_let]
let _ = synth_dsum_case_injective s x in
match x with
| Known x' -> validate_synth (f' x') (synth_dsum_case s (Known x')) () <: validator (parse_dsum_cases' s f g x)
| Unknown x' -> validate_synth g' (synth_dsum_case s (Unknown x')) () <: validator (parse_dsum_cases' s f g x)
inline_for_extraction
let validate_dsum_cases'_destr
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(f' : (x: dsum_known_key s) -> Tot (validator (dsnd (f x))))
(#k: parser_kind)
(#g: parser k (dsum_type_of_unknown_tag s))
(g' : validator g)
(destr: dep_enum_destr _ (fun k -> validate_dsum_cases_t s f g (Known k)))
(x: dsum_key s)
: Tot (validate_dsum_cases_t s f g x)
= fun #rrel #rel input pos ->
match x with
| Known k ->
destr
_
(fun k -> validate_dsum_cases_if s f g (Known k))
(fun _ _ -> ())
(fun _ _ _ _ -> ())
(fun k -> validate_dsum_cases' s f f' g' (Known k))
k
input
pos
| Unknown r -> validate_dsum_cases' s f f' g' (Unknown r) input pos
inline_for_extraction
let validate_dsum_cases
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(f' : (x: dsum_known_key s) -> Tot (validator (dsnd (f x))))
(#k: parser_kind)
(#g: parser k (dsum_type_of_unknown_tag s))
(g' : validator g)
(destr: dep_enum_destr _ (fun k -> validate_dsum_cases_t s f g (Known k)))
(x: dsum_key s)
: Tot (validator (parse_dsum_cases s f g x))
= fun #rrel #rel input pos ->
let h = HST.get () in
[@inline_let]
let _ =
valid_facts (parse_dsum_cases' s f g x) h input (uint64_to_uint32 pos);
valid_facts (parse_dsum_cases s f g x) h input (uint64_to_uint32 pos);
parse_dsum_cases_eq' s f g x (bytes_of_slice_from h input (uint64_to_uint32 pos))
in
validate_dsum_cases'_destr s f f' g' destr x input pos
#push-options "--z3rlimit 40"
inline_for_extraction
let validate_dsum
(#kt: parser_kind)
(t: dsum)
(#p: parser kt (dsum_repr_type t))
(v: validator p)
(p32: leaf_reader p)
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(f32: (x: dsum_known_key t) -> Tot (validator (dsnd (f x))))
(#k': parser_kind)
(#g: parser k' (dsum_type_of_unknown_tag t))
(g32: validator g)
(destr: dep_maybe_enum_destr_t (dsum_enum t) (validate_dsum_cases_t t f g))
: Tot (validator (parse_dsum t p f g))
= fun #rrel #rel input pos ->
let h = HST.get () in
[@inline_let]
let _ = parse_dsum_eq' t p f g (bytes_of_slice_from h input (uint64_to_uint32 pos)) in
[@inline_let]
let _ = valid_facts (parse_dsum t p f g) h input (uint64_to_uint32 pos) in
[@inline_let]
let _ = valid_facts p h input (uint64_to_uint32 pos) in
let pos_after_tag = v input pos in
if is_error pos_after_tag
then pos_after_tag
else
let tg = p32 input (uint64_to_uint32 pos) in
[@inline_let]
let _ = valid_facts (parse_dsum_cases' t f g (maybe_enum_key_of_repr (dsum_enum t) tg)) h input (uint64_to_uint32 pos_after_tag) in
destr (validate_dsum_cases_eq t f g) (validate_dsum_cases_if t f g) (fun _ _ -> ()) (fun _ _ _ _ -> ()) (validate_dsum_cases' t f f32 g32) tg input pos_after_tag
#pop-options
#reset-options "--z3rlimit 64 --z3cliopt smt.arith.nl=false --initial_ifuel 8 --max_ifuel 8 --initial_fuel 2 --max_fuel 2"
let valid_dsum_intro_known
(h: HS.mem)
(t: dsum)
(#kt: parser_kind)
(p: parser kt (dsum_repr_type t))
(f: ((x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x))))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: Lemma
(requires (
valid (parse_maybe_enum_key p (dsum_enum t)) h input pos /\ (
let k' = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
Known? k' /\ (
let Known k = k' in
valid (dsnd (f k)) h input (get_valid_pos (parse_maybe_enum_key p (dsum_enum t)) h input pos)
))))
(ensures (
let Known k = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
let pos_payload = get_valid_pos (parse_maybe_enum_key p (dsum_enum t)) h input pos in
valid_content_pos
(parse_dsum t p f g) h input pos
(synth_dsum_case t (Known k) (contents (dsnd (f k)) h input pos_payload))
(get_valid_pos (dsnd (f k)) h input pos_payload)
))
= valid_facts (parse_maybe_enum_key p (dsum_enum t)) h input pos;
let Known k = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
let pos_payload = get_valid_pos (parse_maybe_enum_key p (dsum_enum t)) h input pos in
valid_facts (dsnd (f k)) h input pos_payload;
valid_facts (parse_dsum t p f g) h input pos;
parse_dsum_eq t p f g (bytes_of_slice_from h input pos)
let valid_dsum_intro_unknown
(h: HS.mem)
(t: dsum)
(#kt: parser_kind)
(p: parser kt (dsum_repr_type t))
(f: ((x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x))))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: Lemma
(requires (
valid (parse_maybe_enum_key p (dsum_enum t)) h input pos /\ (
let k' = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
Unknown? k' /\
valid g h input (get_valid_pos (parse_maybe_enum_key p (dsum_enum t)) h input pos)
)))
(ensures (
let Unknown r = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
let pos_payload = get_valid_pos (parse_maybe_enum_key p (dsum_enum t)) h input pos in
valid_content_pos
(parse_dsum t p f g) h input pos
(synth_dsum_case t (Unknown r) (contents g h input pos_payload))
(get_valid_pos g h input pos_payload)
))
= valid_facts (parse_maybe_enum_key p (dsum_enum t)) h input pos;
let Unknown r = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
let pos_payload = get_valid_pos (parse_maybe_enum_key p (dsum_enum t)) h input pos in
valid_facts g h input pos_payload;
valid_facts (parse_dsum t p f g) h input pos;
parse_dsum_eq t p f g (bytes_of_slice_from h input pos)
#reset-options
inline_for_extraction
let finalize_dsum_case_known
(t: dsum)
(#kt: parser_kind)
(#p: parser kt (dsum_repr_type t))
(s: serializer p)
(w: leaf_writer_strong s)
(f: ((x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x))))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
(destr: enum_repr_of_key'_t (dsum_enum t))
(k: dsum_known_key t)
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: HST.Stack unit
(requires (fun h ->
let len_tag = serialized_length (serialize_enum_key _ s (dsum_enum t)) k in
U32.v pos + len_tag < 4294967296 /\ (
let pos_payload = pos `U32.add` U32.uint_to_t len_tag in
valid (dsnd (f k)) h input pos_payload /\
writable input.base (U32.v pos) (U32.v pos_payload) h
)))
(ensures (fun h _ h' ->
let len_tag = serialized_length (serialize_enum_key _ s (dsum_enum t)) k in
let pos_payload = pos `U32.add` U32.uint_to_t len_tag in
B.modifies (loc_slice_from_to input pos pos_payload) h h' /\
valid_content_pos (parse_dsum t p f g) h' input pos (synth_dsum_case t (Known k) (contents (dsnd (f k)) h input pos_payload)) (get_valid_pos (dsnd (f k)) h input pos_payload)
))
= let pos1 = write_enum_key w (dsum_enum t) destr k input pos in
let h = HST.get () in
[@inline_let]
let _ =
valid_facts (parse_enum_key p (dsum_enum t)) h input pos;
valid_facts (parse_maybe_enum_key p (dsum_enum t)) h input pos;
let sq = bytes_of_slice_from h input pos in
parse_enum_key_eq p (dsum_enum t) sq;
parse_maybe_enum_key_eq p (dsum_enum t) sq;
valid_dsum_intro_known h t p f g input pos
in
()
inline_for_extraction
let finalize_dsum_case_unknown
(t: dsum)
(#kt: parser_kind)
(#p: parser kt (dsum_repr_type t))
(s: serializer p)
(w: leaf_writer_strong s)
(f: ((x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x))))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
(r: unknown_enum_repr (dsum_enum t))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: HST.Stack unit
(requires (fun h ->
let len_tag = serialized_length s r in
U32.v pos + len_tag < 4294967296 /\ (
let pos_payload = pos `U32.add` U32.uint_to_t len_tag in
valid g h input pos_payload /\
writable input.base (U32.v pos) (U32.v pos_payload) h
)))
(ensures (fun h _ h' ->
let len_tag = serialized_length s r in
let pos_payload = pos `U32.add` U32.uint_to_t len_tag in
B.modifies (loc_slice_from_to input pos pos_payload) h h' /\
valid_content_pos (parse_dsum t p f g) h' input pos (synth_dsum_case t (Unknown r) (contents g h input pos_payload)) (get_valid_pos g h input pos_payload)
))
= let pos1 = w r input pos in
let h = HST.get () in
[@inline_let]
let _ =
valid_facts (parse_maybe_enum_key p (dsum_enum t)) h input pos;
valid_facts p h input pos;
let sq = bytes_of_slice_from h input pos in
parse_maybe_enum_key_eq p (dsum_enum t) sq;
valid_dsum_intro_unknown h t p f g input pos
in
()
let valid_dsum_elim_tag
(h: HS.mem)
(t: dsum)
(#kt: parser_kind)
(p: parser kt (dsum_repr_type t))
(f: ((x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x))))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: Lemma
(requires (
valid (parse_dsum t p f g) h input pos
))
(ensures (
valid (parse_maybe_enum_key p (dsum_enum t)) h input pos /\
contents (parse_maybe_enum_key p (dsum_enum t)) h input pos == dsum_tag_of_data t (contents (parse_dsum t p f g) h input pos)
))
= let _ = parse_dsum_eq_ t p f g (bytes_of_slice_from h input pos) in
let _ = valid_facts (parse_dsum t p f g) h input pos in
let _ = valid_facts (parse_maybe_enum_key p (dsum_enum t)) h input pos in
()
inline_for_extraction
let read_dsum_tag
(t: dsum)
(#kt: parser_kind)
(#p: parser kt (dsum_repr_type t))
(p32: leaf_reader p)
(destr: maybe_enum_destr_t (maybe_enum_key (dsum_enum t)) (dsum_enum t))
(f: ((x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x))))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: HST.Stack (dsum_key t)
(requires (fun h ->
valid (parse_dsum t p f g) h input pos
))
(ensures (fun h res h' ->
B.modifies B.loc_none h h' /\
res == dsum_tag_of_data t (contents (parse_dsum t p f g) h input pos)
))
= let h = HST.get () in
[@inline_let] let _ = valid_dsum_elim_tag h t p f g input pos in
read_maybe_enum_key p32 (dsum_enum t) destr input pos
#push-options "--z3rlimit 32"
let valid_dsum_elim_known
(h: HS.mem)
(t: dsum)
(#kt: parser_kind)
(p: parser kt (dsum_repr_type t))
(f: ((x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x))))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: Lemma
(requires (
valid (parse_dsum t p f g) h input pos /\
Known? (dsum_tag_of_data t (contents (parse_dsum t p f g) h input pos))
))
(ensures (
valid (parse_maybe_enum_key p (dsum_enum t)) h input pos /\ (
let k' = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
let pos_payload = get_valid_pos (parse_maybe_enum_key p (dsum_enum t)) h input pos in
Known? k' /\ (
let Known k = k' in
valid (dsnd (f k)) h input pos_payload /\
valid_content_pos
(parse_dsum t p f g) h input pos
(synth_dsum_case t (Known k) (contents (dsnd (f k)) h input pos_payload))
(get_valid_pos (dsnd (f k)) h input pos_payload)
))))
=
valid_facts (parse_dsum t p f g) h input pos;
parse_dsum_eq t p f g (bytes_of_slice_from h input pos);
valid_facts (parse_maybe_enum_key p (dsum_enum t)) h input pos;
let Known k = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
let pos_payload = get_valid_pos (parse_maybe_enum_key p (dsum_enum t)) h input pos in
valid_facts (dsnd (f k)) h input pos_payload
#pop-options
let valid_dsum_elim_unknown
(h: HS.mem)
(t: dsum)
(#kt: parser_kind)
(p: parser kt (dsum_repr_type t))
(f: ((x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x))))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: Lemma
(requires (
valid (parse_dsum t p f g) h input pos /\
Unknown? (dsum_tag_of_data t (contents (parse_dsum t p f g) h input pos))
))
(ensures (
valid (parse_maybe_enum_key p (dsum_enum t)) h input pos /\ (
let k' = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
let pos_payload = get_valid_pos (parse_maybe_enum_key p (dsum_enum t)) h input pos in
Unknown? k' /\ (
let Unknown r = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
valid g h input pos_payload /\
valid_content_pos
(parse_dsum t p f g) h input pos
(synth_dsum_case t (Unknown r) (contents g h input pos_payload))
(get_valid_pos g h input pos_payload)
))))
=
valid_facts (parse_dsum t p f g) h input pos;
parse_dsum_eq t p f g (bytes_of_slice_from h input pos);
valid_facts (parse_maybe_enum_key p (dsum_enum t)) h input pos;
let Unknown r = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
let pos_payload = get_valid_pos (parse_maybe_enum_key p (dsum_enum t)) h input pos in
valid_facts g h input pos_payload
inline_for_extraction
let jump_dsum_cases_t
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(#k: parser_kind)
(g: parser k (dsum_type_of_unknown_tag s))
(x: dsum_key s)
: Tot Type
= jumper (parse_dsum_cases' s f g x)
let jump_dsum_cases_eq
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(#k: parser_kind)
(g: parser k (dsum_type_of_unknown_tag s))
(x: dsum_key s)
(v1 v2 : jump_dsum_cases_t s f g x)
: GTot Type0
= True
inline_for_extraction
let jump_dsum_cases_if'
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(#k: parser_kind)
(g: parser k (dsum_type_of_unknown_tag s))
(x: dsum_key s)
(cond: bool)
(ift: (cond_true cond -> Tot (jump_dsum_cases_t s f g x)))
(iff: (cond_false cond -> Tot (jump_dsum_cases_t s f g x)))
: Tot (jump_dsum_cases_t s f g x)
= fun #rrel #rel input len ->
if cond
then (ift () <: jump_dsum_cases_t s f g x) input len
else (iff () <: jump_dsum_cases_t s f g x) input len
inline_for_extraction
let jump_dsum_cases_if
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(#k: parser_kind)
(g: parser k (dsum_type_of_unknown_tag s))
(x: dsum_key s)
: Tot (if_combinator _ (jump_dsum_cases_eq s f g x))
= jump_dsum_cases_if' s f g x
inline_for_extraction
let jump_dsum_cases'
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(f' : (x: dsum_known_key s) -> Tot (jumper (dsnd (f x))))
(#k: parser_kind)
(#g: parser k (dsum_type_of_unknown_tag s))
(g' : jumper g)
(x: dsum_key s)
: Tot (jump_dsum_cases_t s f g x)
= synth_dsum_case_injective s x;
match x with
| Known x' -> jump_synth (f' x') (synth_dsum_case s (Known x')) () <: jumper (parse_dsum_cases' s f g x)
| Unknown x' -> jump_synth g' (synth_dsum_case s (Unknown x')) () <: jumper (parse_dsum_cases' s f g x)
inline_for_extraction
let jump_dsum_cases'_destr
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(f' : (x: dsum_known_key s) -> Tot (jumper (dsnd (f x))))
(#k: parser_kind)
(#g: parser k (dsum_type_of_unknown_tag s))
(g' : jumper g)
(destr: dep_enum_destr _ (fun k -> jump_dsum_cases_t s f g (Known k)))
(x: dsum_key s)
: Tot (jump_dsum_cases_t s f g x)
= fun #rrel #rel input pos ->
match x with
| Known k ->
destr
_
(fun k -> jump_dsum_cases_if s f g (Known k))
(fun _ _ -> ())
(fun _ _ _ _ -> ())
(fun k -> jump_dsum_cases' s f f' g' (Known k))
k
input
pos
| Unknown r -> jump_dsum_cases' s f f' g' (Unknown r) input pos | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"LowStar.Buffer.fst.checked",
"LowParse.Spec.Sum.fst.checked",
"LowParse.Low.Enum.fst.checked",
"FStar.UInt64.fsti.checked",
"FStar.UInt32.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Int.Cast.fst.checked",
"FStar.HyperStack.ST.fsti.checked",
"FStar.HyperStack.fst.checked",
"FStar.Classical.fsti.checked"
],
"interface_file": false,
"source_file": "LowParse.Low.Sum.fst"
} | [
{
"abbrev": true,
"full_module": "FStar.HyperStack",
"short_module": "HS"
},
{
"abbrev": true,
"full_module": "FStar.UInt64",
"short_module": "U64"
},
{
"abbrev": true,
"full_module": "FStar.Int.Cast",
"short_module": "Cast"
},
{
"abbrev": true,
"full_module": "LowStar.Buffer",
"short_module": "B"
},
{
"abbrev": true,
"full_module": "FStar.HyperStack.ST",
"short_module": "HST"
},
{
"abbrev": true,
"full_module": "FStar.UInt32",
"short_module": "U32"
},
{
"abbrev": false,
"full_module": "LowParse.Spec.Sum",
"short_module": null
},
{
"abbrev": false,
"full_module": "LowParse.Low.Enum",
"short_module": null
},
{
"abbrev": false,
"full_module": "LowParse.Low",
"short_module": null
},
{
"abbrev": false,
"full_module": "LowParse.Low",
"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",
"short_module": null
}
] | {
"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_elim_box": false,
"smtencoding_l_arith_repr": "boxwrap",
"smtencoding_nl_arith_repr": "boxwrap",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": true,
"z3cliopt": [],
"z3refresh": false,
"z3rlimit": 5,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | false |
s: LowParse.Spec.Sum.dsum ->
f:
(x: LowParse.Spec.Sum.dsum_known_key s
-> Prims.dtuple2 LowParse.Spec.Base.parser_kind
(fun k -> LowParse.Spec.Base.parser k (LowParse.Spec.Sum.dsum_type_of_known_tag s x))) ->
f':
(x: LowParse.Spec.Sum.dsum_known_key s
-> LowParse.Low.Base.jumper (FStar.Pervasives.dsnd (f x))) ->
g': LowParse.Low.Base.jumper g ->
destr:
LowParse.Spec.Enum.dep_enum_destr (LowParse.Spec.Sum.dsum_enum s)
(fun k -> LowParse.Low.Sum.jump_dsum_cases_t s f g (LowParse.Spec.Enum.Known k)) ->
x: LowParse.Spec.Sum.dsum_key s
-> LowParse.Low.Base.jumper (LowParse.Spec.Sum.parse_dsum_cases s f g x) | Prims.Tot | [
"total"
] | [] | [
"LowParse.Spec.Sum.dsum",
"LowParse.Spec.Sum.dsum_known_key",
"Prims.dtuple2",
"LowParse.Spec.Base.parser_kind",
"LowParse.Spec.Base.parser",
"LowParse.Spec.Sum.dsum_type_of_known_tag",
"LowParse.Low.Base.jumper",
"Prims.__proj__Mkdtuple2__item___1",
"FStar.Pervasives.dsnd",
"LowParse.Spec.Sum.dsum_type_of_unknown_tag",
"LowParse.Spec.Enum.dep_enum_destr",
"LowParse.Spec.Sum.dsum_key_type",
"LowParse.Spec.Sum.dsum_repr_type",
"LowParse.Spec.Sum.dsum_enum",
"LowParse.Spec.Enum.enum_key",
"LowParse.Low.Sum.jump_dsum_cases_t",
"LowParse.Spec.Enum.Known",
"LowParse.Spec.Sum.dsum_key",
"LowParse.Slice.srel",
"LowParse.Bytes.byte",
"LowParse.Slice.slice",
"FStar.UInt32.t",
"LowParse.Low.Sum.jump_dsum_cases'_destr",
"Prims.unit",
"LowParse.Spec.Sum.parse_dsum_cases_eq'",
"LowParse.Slice.bytes_of_slice_from",
"LowParse.Low.Base.Spec.valid_facts",
"LowParse.Spec.Sum.weaken_parse_dsum_cases_kind",
"LowParse.Spec.Sum.dsum_cases",
"LowParse.Spec.Sum.parse_dsum_cases",
"LowParse.Spec.Sum.parse_dsum_cases_kind",
"LowParse.Spec.Sum.parse_dsum_cases'",
"FStar.Monotonic.HyperStack.mem",
"FStar.HyperStack.ST.get"
] | [] | false | false | false | false | false | let jump_dsum_cases
(s: dsum)
(f: (x: dsum_known_key s -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x))))
(f': (x: dsum_known_key s -> Tot (jumper (dsnd (f x)))))
(#k: parser_kind)
(#g: parser k (dsum_type_of_unknown_tag s))
(g': jumper g)
(destr: dep_enum_destr _ (fun k -> jump_dsum_cases_t s f g (Known k)))
(x: dsum_key s)
: Tot (jumper (parse_dsum_cases s f g x)) =
| fun #rrel #rel input pos ->
let h = HST.get () in
[@@ inline_let ]let _ =
valid_facts (parse_dsum_cases' s f g x) h input pos;
valid_facts (parse_dsum_cases s f g x) h input pos;
parse_dsum_cases_eq' s f g x (bytes_of_slice_from h input pos)
in
jump_dsum_cases'_destr s f f' g' destr x input pos | false |
LowParse.Low.Sum.fst | LowParse.Low.Sum.serialize32_dsum_cases_aux | val serialize32_dsum_cases_aux
(t: dsum)
(f: (x: dsum_known_key t -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x))))
(sf: (x: dsum_known_key t -> Tot (serializer (dsnd (f x)))))
(sf32: (x: dsum_known_key t -> Tot (serializer32 (sf x))))
(#k': parser_kind)
(#g: parser k' (dsum_type_of_unknown_tag t))
(#sg: serializer g)
(sg32: serializer32 sg)
(tg: dsum_key t)
: Tot (serializer32 (serialize_dsum_cases t f sf g sg tg)) | val serialize32_dsum_cases_aux
(t: dsum)
(f: (x: dsum_known_key t -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x))))
(sf: (x: dsum_known_key t -> Tot (serializer (dsnd (f x)))))
(sf32: (x: dsum_known_key t -> Tot (serializer32 (sf x))))
(#k': parser_kind)
(#g: parser k' (dsum_type_of_unknown_tag t))
(#sg: serializer g)
(sg32: serializer32 sg)
(tg: dsum_key t)
: Tot (serializer32 (serialize_dsum_cases t f sf g sg tg)) | let serialize32_dsum_cases_aux
(t: dsum)
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(sf: (x: dsum_known_key t) -> Tot (serializer (dsnd (f x))))
(sf32: (x: dsum_known_key t) -> Tot (serializer32 (sf x)))
(#k': parser_kind)
(#g: parser k' (dsum_type_of_unknown_tag t))
(#sg: serializer g)
(sg32: serializer32 sg)
(tg: dsum_key t)
: Tot (serializer32 (serialize_dsum_cases t f sf g sg tg))
= [@inline_let]
let _ = synth_dsum_case_injective t tg in
[@inline_let]
let _ = synth_dsum_case_inverse t tg in
serialize32_synth
(serialize32_dsum_type_of_tag t f sf sf32 sg32 tg)
(synth_dsum_case t tg)
(synth_dsum_case_recip t tg)
(fun x -> synth_dsum_case_recip t tg x)
() | {
"file_name": "src/lowparse/LowParse.Low.Sum.fst",
"git_rev": "00217c4a89f5ba56002ba9aa5b4a9d5903bfe9fa",
"git_url": "https://github.com/project-everest/everparse.git",
"project_name": "everparse"
} | {
"end_col": 6,
"end_line": 1667,
"start_col": 0,
"start_line": 1647
} | module LowParse.Low.Sum
include LowParse.Low.Enum
include LowParse.Spec.Sum
module U32 = FStar.UInt32
module HST = FStar.HyperStack.ST
module B = LowStar.Buffer
module Cast = FStar.Int.Cast
module U64 = FStar.UInt64
inline_for_extraction
let validate_sum_cases_aux
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(vc: ((x: sum_key t) -> Tot (validator (dsnd (pc x)))))
(k: sum_key t)
: Tot (validator (parse_sum_cases t pc k))
= [@inline_let]
let _ = synth_sum_case_injective t k in
validate_synth
(validate_weaken
(weaken_parse_cases_kind t pc)
(vc k)
()
)
(synth_sum_case t k)
()
inline_for_extraction
let validate_sum_cases_t
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot Type
= validator (parse_sum_cases t pc k)
let validate_sum_cases_t_eq
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
(x y : validate_sum_cases_t t pc k)
: GTot Type0
= True
inline_for_extraction
let validate_sum_cases_t_if
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (if_combinator _ (validate_sum_cases_t_eq t pc k))
= fun cond (sv_true: cond_true cond -> Tot (validate_sum_cases_t t pc k)) (sv_false: cond_false cond -> Tot (validate_sum_cases_t t pc k)) #rrel #rel input pos ->
if cond
then sv_true () input pos
else sv_false () input pos
inline_for_extraction
let validate_sum_cases
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(vc: ((x: sum_key t) -> Tot (validator (dsnd (pc x)))))
(destr: dep_enum_destr (sum_enum t) (validate_sum_cases_t t pc))
(k: sum_key t)
: Tot (validator (parse_sum_cases t pc k))
= destr
_
(validate_sum_cases_t_if t pc)
(fun _ _ -> ())
(fun _ _ _ _ -> ())
(validate_sum_cases_aux t pc vc)
k
inline_for_extraction
let validate_sum_aux_payload_t
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
: Tot Type
= (#rrel: _) -> (#rel: _) ->
(input: slice rrel rel) ->
(pos: U64.t) ->
HST.Stack U64.t
(requires (fun h -> live_slice h input /\ U64.v pos <= U32.v input.len))
(ensures (fun h res h' ->
B.modifies B.loc_none h h' /\ (
match k with
| Unknown _ -> is_error res
| Known k' ->
if is_success res
then
valid_pos (dsnd (pc k')) h input (uint64_to_uint32 pos) (uint64_to_uint32 res)
else
(~ (valid (dsnd (pc k')) h input (uint64_to_uint32 pos)))
)))
let validate_sum_aux_payload_eq
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
: Tot (validate_sum_aux_payload_t t pc k -> validate_sum_aux_payload_t t pc k -> GTot Type0)
= fun _ _ -> True
inline_for_extraction
let validate_sum_aux_payload_if'
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
(cond: bool)
(ift: ((cond_true cond) -> Tot (validate_sum_aux_payload_t t pc k)))
(iff: ((cond_false cond) -> Tot (validate_sum_aux_payload_t t pc k)))
: Tot (validate_sum_aux_payload_t t pc k)
= fun #rrel #rel input pos ->
if cond
then begin
(ift () <: validate_sum_aux_payload_t t pc k) input pos
end else
(iff () <: validate_sum_aux_payload_t t pc k) input pos
inline_for_extraction
let validate_sum_aux_payload_if
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
: Tot (if_combinator _ (validate_sum_aux_payload_eq t pc k))
= validate_sum_aux_payload_if' t pc k
#push-options "--z3rlimit 64 --z3cliopt smt.arith.nl=false --using_facts_from '* -FStar.Int.Cast -LowParse.BitFields'"
// --query_stats --smtencoding.elim_box true --smtencoding.l_arith_repr native --z3refresh"
inline_for_extraction
let validate_sum_aux
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(v: validator p)
(p32: leaf_reader p)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(v_payload: ((k: sum_repr_type t)) -> Tot (validate_sum_aux_payload_t t pc (maybe_enum_key_of_repr (sum_enum t) k)))
: Tot (validator (parse_sum t p pc))
= fun #rrel #rel input pos ->
let h = HST.get () in
[@inline_let]
let _ = parse_sum_eq'' t p pc (bytes_of_slice_from h input (uint64_to_uint32 pos)) in
[@inline_let]
let _ = valid_facts (parse_sum t p pc) h input (uint64_to_uint32 pos) in
[@inline_let]
let _ = valid_facts p h input (uint64_to_uint32 pos) in
let len_after_tag = v input pos in
if is_error len_after_tag
then len_after_tag
else begin
let h1 = HST.get () in
let k' = p32 input (uint64_to_uint32 pos) in
[@inline_let]
let _ =
match maybe_enum_key_of_repr (sum_enum t) k' with
| Known k -> valid_facts (dsnd (pc k)) h input (uint64_to_uint32 len_after_tag)
| _ -> ()
in
v_payload k' input len_after_tag
end
#pop-options
inline_for_extraction
let validate_sum_aux_payload'
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (validator (dsnd (pc x)))))
(k: maybe_enum_key (sum_enum t))
: Tot (validate_sum_aux_payload_t t pc k)
= fun #rrel #rel input pos ->
match k with
| Known k ->
[@inline_let]
let _ = synth_sum_case_injective t k in
pc32 k input pos
// validate_synth (pc32 k) (synth_sum_case t k) () input pos
| _ -> validator_error_generic
inline_for_extraction
let validate_sum_aux_payload
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (validator (dsnd (pc x)))))
(destr: dep_maybe_enum_destr_t (sum_enum t) (validate_sum_aux_payload_t t pc))
(k: sum_repr_type t)
: Tot (validate_sum_aux_payload_t t pc (maybe_enum_key_of_repr (sum_enum t) k))
= destr (validate_sum_aux_payload_eq t pc) (validate_sum_aux_payload_if t pc) (fun _ _ -> ()) (fun _ _ _ _ -> ()) (validate_sum_aux_payload' t pc pc32) k
inline_for_extraction
let validate_sum
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(v: validator p)
(p32: leaf_reader p)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (validator (dsnd (pc x)))))
(destr: dep_maybe_enum_destr_t (sum_enum t) (validate_sum_aux_payload_t t pc))
: Tot (validator (parse_sum t p pc))
= validate_sum_aux t v p32 pc (validate_sum_aux_payload t pc pc32 destr)
module HS = FStar.HyperStack
#push-options "--z3rlimit 256 --z3cliopt smt.arith.nl=false --initial_ifuel 8 --max_ifuel 8 --initial_fuel 2 --max_fuel 2"
#restart-solver
let valid_sum_intro
(h: HS.mem)
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: Lemma
(requires (
valid (parse_enum_key p (sum_enum t)) h input pos /\ (
let k = contents (parse_enum_key p (sum_enum t)) h input pos in
valid (dsnd (pc k)) h input (get_valid_pos (parse_enum_key p (sum_enum t)) h input pos)
)))
(ensures (
let k = contents (parse_enum_key p (sum_enum t)) h input pos in
let pos_payload = get_valid_pos (parse_enum_key p (sum_enum t)) h input pos in
valid_content_pos
(parse_sum t p pc) h input pos
(synth_sum_case t k (contents (dsnd (pc k)) h input pos_payload))
(get_valid_pos (dsnd (pc k)) h input pos_payload)
))
= valid_facts (parse_enum_key p (sum_enum t)) h input pos;
let k = contents (parse_enum_key p (sum_enum t)) h input pos in
let pos_payload = get_valid_pos (parse_enum_key p (sum_enum t)) h input pos in
valid_facts (dsnd (pc k)) h input pos_payload;
valid_facts (parse_sum t p pc) h input pos;
parse_sum_eq t p pc (bytes_of_slice_from h input pos)
#pop-options
inline_for_extraction
let finalize_sum_case
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(s: serializer p)
(w: leaf_writer_strong s)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(destr: enum_repr_of_key'_t (sum_enum t))
(k: sum_key t)
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: HST.Stack unit
(requires (fun h ->
let len_tag = serialized_length (serialize_enum_key _ s (sum_enum t)) k in
U32.v pos + len_tag < 4294967296 /\ (
let pos_payload = pos `U32.add` U32.uint_to_t len_tag in
valid (dsnd (pc k)) h input pos_payload /\
writable input.base (U32.v pos) (U32.v pos_payload) h
)))
(ensures (fun h _ h' ->
let len_tag = serialized_length (serialize_enum_key _ s (sum_enum t)) k in
let pos_payload = pos `U32.add` U32.uint_to_t len_tag in
B.modifies (loc_slice_from_to input pos pos_payload) h h' /\
valid_content_pos (parse_sum t p pc) h' input pos (synth_sum_case t k (contents (dsnd (pc k)) h input pos_payload)) (get_valid_pos (dsnd (pc k)) h input pos_payload)
))
= let pos1 = write_enum_key w (sum_enum t) destr k input pos in
let h = HST.get () in
[@inline_let]
let _ = valid_sum_intro h t p pc input pos in
()
inline_for_extraction
let jump_sum_cases_aux
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(vc: ((x: sum_key t) -> Tot (jumper (dsnd (pc x)))))
(k: sum_key t)
: Tot (jumper (parse_sum_cases t pc k))
= [@inline_let]
let _ = synth_sum_case_injective t k in
jump_synth
(jump_weaken
(weaken_parse_cases_kind t pc)
(vc k)
()
)
(synth_sum_case t k)
()
inline_for_extraction
let jump_sum_cases_t
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot Type
= jumper (parse_sum_cases t pc k)
let jump_sum_cases_t_eq
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
(x y : jump_sum_cases_t t pc k)
: GTot Type0
= True
inline_for_extraction
let jump_sum_cases_t_if
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (if_combinator _ (jump_sum_cases_t_eq t pc k))
= fun cond (sv_true: cond_true cond -> Tot (jump_sum_cases_t t pc k)) (sv_false: cond_false cond -> Tot (jump_sum_cases_t t pc k)) #rrel #rel input pos ->
if cond
then sv_true () input pos
else sv_false () input pos
inline_for_extraction
let jump_sum_cases
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(vc: ((x: sum_key t) -> Tot (jumper (dsnd (pc x)))))
(destr: dep_enum_destr (sum_enum t) (jump_sum_cases_t t pc))
(k: sum_key t)
: Tot (jumper (parse_sum_cases t pc k))
= destr
_
(jump_sum_cases_t_if t pc)
(fun _ _ -> ())
(fun _ _ _ _ -> ())
(jump_sum_cases_aux t pc vc)
k
inline_for_extraction
let jump_sum_aux_payload_t
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
: Tot Type
= (#rrel: _) -> (#rel: _) ->
(input: slice rrel rel) ->
(pos: U32.t) ->
HST.Stack U32.t
(requires (fun h -> live_slice h input /\ U32.v pos <= U32.v input.len /\ (
match k with
| Unknown _ -> False
| Known k' -> valid (dsnd (pc k')) h input pos
)))
(ensures (fun h res h' ->
B.modifies B.loc_none h h' /\ (
match k with
| Unknown _ -> False
| Known k' ->
valid_pos (dsnd (pc k')) h input pos res
)))
let jump_sum_aux_payload_eq
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
: Tot (jump_sum_aux_payload_t t pc k -> jump_sum_aux_payload_t t pc k -> GTot Type0)
= fun _ _ -> True
inline_for_extraction
let jump_sum_aux_payload_if'
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
(cond: bool)
(ift: ((cond_true cond) -> Tot (jump_sum_aux_payload_t t pc k)))
(iff: ((cond_false cond) -> Tot (jump_sum_aux_payload_t t pc k)))
: Tot (jump_sum_aux_payload_t t pc k)
= fun #rrel #rel input pos ->
if cond
then begin
(ift () <: jump_sum_aux_payload_t t pc k) input pos
end else
(iff () <: jump_sum_aux_payload_t t pc k) input pos
inline_for_extraction
let jump_sum_aux_payload_if
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
: Tot (if_combinator _ (jump_sum_aux_payload_eq t pc k))
= jump_sum_aux_payload_if' t pc k
let parse_sum_eq3
(#kt: parser_kind)
(t: sum)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(input: bytes)
(k' : sum_repr_type t)
(consumed_k: consumed_length input)
: Lemma
(requires (Some? (parse (parse_sum t p pc) input) /\ parse p input == Some (k', consumed_k)))
(ensures (
let input_k = Seq.slice input consumed_k (Seq.length input) in
let k = maybe_enum_key_of_repr (sum_enum t) k' in
begin match k with
| Known k ->
Some? (parse (dsnd (pc k)) input_k)
| _ -> False
end
))
= parse_sum_eq'' t p pc input
let parse_sum_eq4
(#kt: parser_kind)
(t: sum)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(input: bytes)
(k' : sum_repr_type t)
(consumed_k: consumed_length input)
(consumed_payload: nat)
: Lemma
(requires (Some? (parse (parse_sum t p pc) input) /\ parse p input == Some (k', consumed_k) /\ (
let input_k = Seq.slice input consumed_k (Seq.length input) in
let k = maybe_enum_key_of_repr (sum_enum t) k' in
begin match k with
| Known k ->
Some? (parse (dsnd (pc k)) input_k) /\ (
let Some (_, consumed_payload') = parse (dsnd (pc k)) input_k in
consumed_payload' == consumed_payload
)
| _ -> False
end
)))
(ensures (
let Some (_, consumed) = parse (parse_sum t p pc) input in
consumed == consumed_k + consumed_payload
))
= parse_sum_eq'' t p pc input
#push-options "--z3rlimit 16"
let valid_sum_elim
(h: HS.mem)
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(#rrel: _) (#rel: _)
(input: slice rrel rel)
(pos: U32.t)
: Lemma
(requires (
valid (parse_sum t p pc) h input pos
))
(ensures (
valid p h input pos /\ (
let pos_payload = get_valid_pos p h input pos in
let k' = maybe_enum_key_of_repr (sum_enum t) (contents p h input pos) in
match k' with
| Known k ->
k == sum_tag_of_data t (contents (parse_sum t p pc) h input pos) /\
valid (dsnd (pc k)) h input pos_payload /\
valid_pos
(parse_sum t p pc) h input pos
(get_valid_pos (dsnd (pc k)) h input pos_payload)
| _ -> False
)))
= let sinput = bytes_of_slice_from h input pos in
let _ = parse_sum_eq'' t p pc sinput in
[@inline_let]
let _ = valid_facts (parse_sum t p pc) h input pos in
let Some (k', consumed_k) = parse p sinput in
let pos_after_tag = U32.uint_to_t (U32.v pos + consumed_k) in
[@inline_let]
let _ = valid_facts p h input pos in
assert (valid_content_pos p h input pos k' pos_after_tag);
match maybe_enum_key_of_repr (sum_enum t) k' with
| Known k -> valid_facts (dsnd (pc k)) h input pos_after_tag
| _ -> ()
#pop-options
let valid_sum_elim_tag
(h: HS.mem)
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: Lemma
(requires (
valid (parse_sum t p pc) h input pos
))
(ensures (
valid (parse_enum_key p (sum_enum t)) h input pos /\
contents (parse_enum_key p (sum_enum t)) h input pos == sum_tag_of_data t (contents (parse_sum t p pc) h input pos)
))
= let _ = parse_sum_eq' t p pc (bytes_of_slice_from h input pos) in
let _ = valid_facts (parse_sum t p pc) h input pos in
let _ = valid_facts (parse_enum_key p (sum_enum t)) h input pos in
()
inline_for_extraction
let read_sum_tag
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(p32: leaf_reader p)
(destr: dep_maybe_enum_destr_t (sum_enum t) (read_enum_key_t (sum_enum t)))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: HST.Stack (sum_key t)
(requires (fun h ->
valid (parse_sum t p pc) h input pos
))
(ensures (fun h res h' ->
B.modifies B.loc_none h h' /\
res == sum_tag_of_data t (contents (parse_sum t p pc) h input pos)
))
= let h = HST.get () in
[@inline_let] let _ = valid_sum_elim_tag h t p pc input pos in
read_enum_key p32 (sum_enum t) destr input pos
inline_for_extraction
let jump_sum_aux
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(v: jumper p)
(p32: leaf_reader p)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(v_payload: ((k: sum_repr_type t)) -> Tot (jump_sum_aux_payload_t t pc (maybe_enum_key_of_repr (sum_enum t) k)))
: Tot (jumper (parse_sum t p pc))
= fun #rrel #rel input pos ->
let h = HST.get () in
[@inline_let]
let _ = valid_sum_elim h t p pc input pos in
let pos_after_tag = v input pos in
let k' = p32 input pos in
v_payload k' input pos_after_tag
inline_for_extraction
let jump_sum_aux_payload'
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (jumper (dsnd (pc x)))))
(k: maybe_enum_key (sum_enum t))
: Tot (jump_sum_aux_payload_t t pc k)
= fun #rrel #rel input pos ->
match k with
| Known k ->
[@inline_let]
let _ = synth_sum_case_injective t k in
pc32 k input pos
| _ -> 0ul // dummy, but we MUST NOT remove this branch, otherwise extraction fails
inline_for_extraction
let jump_sum_aux_payload
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (jumper (dsnd (pc x)))))
(destr: dep_maybe_enum_destr_t (sum_enum t) (jump_sum_aux_payload_t t pc))
(k: sum_repr_type t)
: Tot (jump_sum_aux_payload_t t pc (maybe_enum_key_of_repr (sum_enum t) k))
= destr (jump_sum_aux_payload_eq t pc) (jump_sum_aux_payload_if t pc) (fun _ _ -> ()) (fun _ _ _ _ -> ()) (jump_sum_aux_payload' t pc pc32) k
inline_for_extraction
let jump_sum
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(v: jumper p)
(p32: leaf_reader p)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (jumper (dsnd (pc x)))))
(destr: dep_maybe_enum_destr_t (sum_enum t) (jump_sum_aux_payload_t t pc))
: Tot (jumper (parse_sum t p pc))
= jump_sum_aux t v p32 pc (jump_sum_aux_payload t pc pc32 destr)
inline_for_extraction
let read_sum_cases'
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (leaf_reader (dsnd (pc x)))))
(k: sum_key t)
: Tot (leaf_reader (parse_sum_cases' t pc k))
= [@inline_let]
let _ = synth_sum_case_injective t k in
read_synth'
(dsnd (pc k))
(synth_sum_case t k)
(pc32 k)
()
inline_for_extraction
let read_sum_cases_t
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot Type
= leaf_reader (parse_sum_cases' t pc k)
let read_sum_cases_t_eq
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
(x y : read_sum_cases_t t pc k)
: GTot Type0
= True
inline_for_extraction
let read_sum_cases_t_if
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (if_combinator _ (read_sum_cases_t_eq t pc k))
= fun cond (sv_true: cond_true cond -> Tot (read_sum_cases_t t pc k)) (sv_false: cond_false cond -> Tot (read_sum_cases_t t pc k)) #_ #_ input pos ->
if cond
then (sv_true () input pos)
else (sv_false () input pos)
inline_for_extraction
let read_sum_cases
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (leaf_reader (dsnd (pc x)))))
(destr: dep_enum_destr (sum_enum t) (read_sum_cases_t t pc))
(k: sum_key t)
: Tot (leaf_reader (parse_sum_cases' t pc k))
= destr
_
(read_sum_cases_t_if t pc)
(fun _ _ -> ())
(fun _ _ _ _ -> ())
(read_sum_cases' t pc pc32)
k
#push-options "--z3rlimit 32"
inline_for_extraction
let read_sum
(#kt: parser_kind)
(t: sum)
(p: parser kt (sum_repr_type t))
(p32: leaf_reader (parse_enum_key p (sum_enum t)))
(j: jumper p)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (leaf_reader (dsnd (pc x)))))
(destr: dep_enum_destr (sum_enum t) (read_sum_cases_t t pc))
: Tot (leaf_reader (parse_sum t p pc))
=
fun #_ #_ input pos ->
let h = HST.get () in
valid_facts (parse_sum t p pc) h input pos;
parse_sum_eq' t p pc (bytes_of_slice_from h input pos);
valid_facts (parse_enum_key p (sum_enum t)) h input pos;
let k = p32 input pos in
let pos' = jump_enum_key j (sum_enum t) input pos in
valid_facts (parse_sum_cases' t pc k) h input pos' ;
read_sum_cases t pc pc32 destr k input pos'
#pop-options
inline_for_extraction
let serialize32_sum_cases_t
(t: sum)
(#pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(sc: ((x: sum_key t) -> Tot (serializer (dsnd (pc x)))))
(k: sum_key t)
: Tot Type
= serializer32 (serialize_sum_cases t pc sc k)
let serialize32_sum_cases_t_eq
(t: sum)
(#pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(sc: ((x: sum_key t) -> Tot (serializer (dsnd (pc x)))))
(k: sum_key t)
(x y: serialize32_sum_cases_t t sc k)
: GTot Type0
= True
inline_for_extraction
let serialize32_sum_cases_t_if
(t: sum)
(#pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(sc: ((x: sum_key t) -> Tot (serializer (dsnd (pc x)))))
(k: sum_key t)
: Tot (if_combinator _ (serialize32_sum_cases_t_eq t sc k))
= fun cond (sv_true: (cond_true cond -> Tot (serialize32_sum_cases_t t sc k))) (sv_false: (cond_false cond -> Tot (serialize32_sum_cases_t t sc k))) x #rrel #rel b pos ->
if cond
then (sv_true () x b pos)
else (sv_false () x b pos)
inline_for_extraction
let serialize32_sum_cases_aux
(t: sum)
(#pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(sc: ((x: sum_key t) -> Tot (serializer (dsnd (pc x)))))
(sc32: ((x: sum_key t) -> Tot (serializer32 (sc x))))
(k: sum_key t)
: Tot (serializer32 (serialize_sum_cases t pc sc k))
= fun x #rrel #rel b pos ->
[@inline_let] let _ =
Classical.forall_intro (parse_sum_cases_eq' t pc k);
synth_sum_case_injective t k;
synth_sum_case_inverse t k
in
serialize32_synth
(sc32 k)
(synth_sum_case t k)
(synth_sum_case_recip t k)
(fun x -> synth_sum_case_recip t k x)
()
x
b
pos
inline_for_extraction
let serialize32_sum_cases
(t: sum)
(#pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(sc: ((x: sum_key t) -> Tot (serializer (dsnd (pc x)))))
(sc32: ((x: sum_key t) -> Tot (serializer32 (sc x))))
(destr: dep_enum_destr (sum_enum t) (serialize32_sum_cases_t t sc))
(k: sum_key t)
: Tot (serializer32 (serialize_sum_cases t pc sc k))
= destr
_
(serialize32_sum_cases_t_if t sc)
(fun _ _ -> ())
(fun _ _ _ _ -> ())
(serialize32_sum_cases_aux t sc sc32)
k
inline_for_extraction
let serialize32_sum
(#kt: parser_kind)
(t: sum)
(#p: parser kt (sum_repr_type t))
(s: serializer p {kt.parser_kind_subkind == Some ParserStrong})
(s32: serializer32 (serialize_enum_key _ s (sum_enum t)))
(#pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(sc: ((x: sum_key t) -> Tot (serializer (dsnd (pc x)))))
(sc32: ((x: sum_key t) -> Tot (serializer32 (sc x))))
(destr: dep_enum_destr (sum_enum t) (serialize32_sum_cases_t t sc))
: Tot (serializer32 (serialize_sum t s sc))
= fun x #rrel #rel b pos ->
serialize_sum_eq t s sc x;
let tg = sum_tag_of_data t x in
serialize32_nondep_then_aux s32 (serialize32_sum_cases t sc sc32 destr tg) tg x b pos
let clens_sum_tag
(s: sum)
: Tot (clens (sum_type s) (sum_key s))
= {
clens_cond = (fun _ -> True);
clens_get = sum_tag_of_data s;
}
let gaccessor_sum_tag
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
: Tot (gaccessor (parse_sum t p pc) (parse_enum_key p (sum_enum t)) (clens_sum_tag t))
= gaccessor_tagged_union_tag
(parse_enum_key p (sum_enum t))
(sum_tag_of_data t)
(parse_sum_cases t pc)
inline_for_extraction
let accessor_sum_tag
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
: Tot (accessor (gaccessor_sum_tag t p pc))
= accessor_tagged_union_tag
(parse_enum_key p (sum_enum t))
(sum_tag_of_data t)
(parse_sum_cases t pc)
let clens_sum_payload
(s: sum)
(k: sum_key s)
: Tot (clens (sum_type s) (sum_type_of_tag s k))
= {
clens_cond = (fun (x: sum_type s) -> sum_tag_of_data s x == k);
clens_get = (fun (x: sum_type s) -> synth_sum_case_recip s k x <: Ghost (sum_type_of_tag s k) (requires (sum_tag_of_data s x == k)) (ensures (fun _ -> True)));
}
#push-options "--z3rlimit 32"
let gaccessor_clens_sum_payload'
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (gaccessor' (parse_sum t p pc) (dsnd (pc k)) (clens_sum_payload t k))
= fun (input: bytes) ->
parse_sum_eq'' t p pc input;
let res =
match parse p input with
| Some (_, consumed) ->
synth_sum_case_inverse t k;
synth_sum_case_injective t k;
synth_injective_synth_inverse_synth_inverse_recip (synth_sum_case t k) (synth_sum_case_recip t k) ();
(consumed)
| _ -> 0 // dummy
in
(res <: (res: _ { gaccessor_post' (parse_sum t p pc) (dsnd (pc k)) (clens_sum_payload t k) input res } ))
#push-options "--z3rlimit 64"
let gaccessor_clens_sum_payload_injective
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
(sl sl' : bytes)
: Lemma
(requires (
gaccessor_pre (parse_sum t p pc) (dsnd (pc k)) (clens_sum_payload t k) sl /\
gaccessor_pre (parse_sum t p pc) (dsnd (pc k)) (clens_sum_payload t k) sl' /\
injective_precond (parse_sum t p pc) sl sl'
))
(ensures (gaccessor_clens_sum_payload' t p pc k sl == gaccessor_clens_sum_payload' t p pc k sl'))
= parse_sum_eq'' t p pc sl;
parse_sum_eq'' t p pc sl' ;
parse_injective (parse_sum t p pc) sl sl' ;
parse_injective p sl sl'
#pop-options
let gaccessor_clens_sum_payload_no_lookahead
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
(sl sl' : bytes)
: Lemma
(requires (
(parse_sum_kind kt t pc).parser_kind_subkind == Some ParserStrong /\
gaccessor_pre (parse_sum t p pc) (dsnd (pc k)) (clens_sum_payload t k) sl /\
gaccessor_pre (parse_sum t p pc) (dsnd (pc k)) (clens_sum_payload t k) sl' /\
no_lookahead_on_precond (parse_sum t p pc) sl sl'
))
(ensures (gaccessor_clens_sum_payload' t p pc k sl == gaccessor_clens_sum_payload' t p pc k sl'))
= parse_sum_eq'' t p pc sl;
parse_sum_eq'' t p pc sl' ;
parse_strong_prefix (parse_sum t p pc) sl sl' ;
parse_injective p sl sl'
let gaccessor_clens_sum_payload
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (gaccessor (parse_sum t p pc) (dsnd (pc k)) (clens_sum_payload t k))
= Classical.forall_intro_2 (fun x -> Classical.move_requires (gaccessor_clens_sum_payload_injective t p pc k x));
Classical.forall_intro_2 (fun x -> Classical.move_requires (gaccessor_clens_sum_payload_no_lookahead t p pc k x));
gaccessor_prop_equiv (parse_sum t p pc) (dsnd (pc k)) (clens_sum_payload t k) (gaccessor_clens_sum_payload' t p pc k);
gaccessor_clens_sum_payload' t p pc k
inline_for_extraction
let accessor_clens_sum_payload'
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(j: jumper p)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: HST.Stack U32.t
(requires (fun h ->
valid (parse_sum t p pc) h input pos /\
(clens_sum_payload t k).clens_cond (contents (parse_sum t p pc) h input pos)
))
(ensures (fun h pos' h' ->
B.modifies B.loc_none h h' /\
pos' == slice_access h (gaccessor_clens_sum_payload t p pc k) input pos
))
=
let h = HST.get () in
[@inline_let]
let _ =
let pos' = get_valid_pos (parse_sum t p pc) h input pos in
let large = bytes_of_slice_from h input pos in
slice_access_eq h (gaccessor_clens_sum_payload t p pc k) input pos;
valid_facts (parse_sum t p pc) h input pos;
parse_sum_eq'' t p pc large;
valid_facts p h input pos
in
j input pos
#pop-options
inline_for_extraction
let accessor_clens_sum_payload
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(j: jumper p)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (accessor (gaccessor_clens_sum_payload t p pc k))
= fun #rrel #rel -> accessor_clens_sum_payload' t j pc k #rrel #rel
let clens_sum_cases_payload
(s: sum)
(k: sum_key s)
: Tot (clens (sum_cases s k) (sum_type_of_tag s k))
= {
clens_cond = (fun (x: sum_cases s k) -> True);
clens_get = (fun (x: sum_cases s k) -> synth_sum_case_recip s k x <: Ghost (sum_type_of_tag s k) (requires (True)) (ensures (fun _ -> True)));
}
let gaccessor_clens_sum_cases_payload
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (gaccessor (parse_sum_cases' t pc k) (dsnd (pc k)) (clens_sum_cases_payload t k))
= synth_sum_case_injective t k;
synth_sum_case_inverse t k;
synth_injective_synth_inverse_synth_inverse_recip (synth_sum_case t k) (synth_sum_case_recip t k) ();
gaccessor_ext
(gaccessor_synth (dsnd (pc k)) (synth_sum_case t k) (synth_sum_case_recip t k) ())
(clens_sum_cases_payload t k)
()
inline_for_extraction
let accessor_clens_sum_cases_payload
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (accessor (gaccessor_clens_sum_cases_payload t pc k))
= [@inline_let]
let _ =
synth_sum_case_injective t k;
synth_sum_case_inverse t k;
synth_injective_synth_inverse_synth_inverse_recip (synth_sum_case t k) (synth_sum_case_recip t k) ()
in
accessor_ext
(accessor_synth (dsnd (pc k)) (synth_sum_case t k) (synth_sum_case_recip t k) ())
(clens_sum_cases_payload t k)
()
inline_for_extraction
let validate_dsum_cases_t
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(#k: parser_kind)
(g: parser k (dsum_type_of_unknown_tag s))
(x: dsum_key s)
: Tot Type
= validator (parse_dsum_cases' s f g x)
let validate_dsum_cases_eq
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(#k: parser_kind)
(g: parser k (dsum_type_of_unknown_tag s))
(x: dsum_key s)
(v1 v2 : validate_dsum_cases_t s f g x)
: GTot Type0
= True
inline_for_extraction
let validate_dsum_cases_if'
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(#k: parser_kind)
(g: parser k (dsum_type_of_unknown_tag s))
(x: dsum_key s)
(cond: bool)
(ift: (cond_true cond -> Tot (validate_dsum_cases_t s f g x)))
(iff: (cond_false cond -> Tot (validate_dsum_cases_t s f g x)))
: Tot (validate_dsum_cases_t s f g x)
= fun #rrel #rel input len ->
if cond
then (ift () <: validate_dsum_cases_t s f g x) input len
else (iff () <: validate_dsum_cases_t s f g x) input len
inline_for_extraction
let validate_dsum_cases_if
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(#k: parser_kind)
(g: parser k (dsum_type_of_unknown_tag s))
(x: dsum_key s)
: Tot (if_combinator _ (validate_dsum_cases_eq s f g x))
= validate_dsum_cases_if' s f g x
inline_for_extraction
let validate_dsum_cases'
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(f' : (x: dsum_known_key s) -> Tot (validator (dsnd (f x))))
(#k: parser_kind)
(#g: parser k (dsum_type_of_unknown_tag s))
(g' : validator g)
(x: dsum_key s)
: Tot (validate_dsum_cases_t s f g x)
= [@inline_let]
let _ = synth_dsum_case_injective s x in
match x with
| Known x' -> validate_synth (f' x') (synth_dsum_case s (Known x')) () <: validator (parse_dsum_cases' s f g x)
| Unknown x' -> validate_synth g' (synth_dsum_case s (Unknown x')) () <: validator (parse_dsum_cases' s f g x)
inline_for_extraction
let validate_dsum_cases'_destr
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(f' : (x: dsum_known_key s) -> Tot (validator (dsnd (f x))))
(#k: parser_kind)
(#g: parser k (dsum_type_of_unknown_tag s))
(g' : validator g)
(destr: dep_enum_destr _ (fun k -> validate_dsum_cases_t s f g (Known k)))
(x: dsum_key s)
: Tot (validate_dsum_cases_t s f g x)
= fun #rrel #rel input pos ->
match x with
| Known k ->
destr
_
(fun k -> validate_dsum_cases_if s f g (Known k))
(fun _ _ -> ())
(fun _ _ _ _ -> ())
(fun k -> validate_dsum_cases' s f f' g' (Known k))
k
input
pos
| Unknown r -> validate_dsum_cases' s f f' g' (Unknown r) input pos
inline_for_extraction
let validate_dsum_cases
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(f' : (x: dsum_known_key s) -> Tot (validator (dsnd (f x))))
(#k: parser_kind)
(#g: parser k (dsum_type_of_unknown_tag s))
(g' : validator g)
(destr: dep_enum_destr _ (fun k -> validate_dsum_cases_t s f g (Known k)))
(x: dsum_key s)
: Tot (validator (parse_dsum_cases s f g x))
= fun #rrel #rel input pos ->
let h = HST.get () in
[@inline_let]
let _ =
valid_facts (parse_dsum_cases' s f g x) h input (uint64_to_uint32 pos);
valid_facts (parse_dsum_cases s f g x) h input (uint64_to_uint32 pos);
parse_dsum_cases_eq' s f g x (bytes_of_slice_from h input (uint64_to_uint32 pos))
in
validate_dsum_cases'_destr s f f' g' destr x input pos
#push-options "--z3rlimit 40"
inline_for_extraction
let validate_dsum
(#kt: parser_kind)
(t: dsum)
(#p: parser kt (dsum_repr_type t))
(v: validator p)
(p32: leaf_reader p)
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(f32: (x: dsum_known_key t) -> Tot (validator (dsnd (f x))))
(#k': parser_kind)
(#g: parser k' (dsum_type_of_unknown_tag t))
(g32: validator g)
(destr: dep_maybe_enum_destr_t (dsum_enum t) (validate_dsum_cases_t t f g))
: Tot (validator (parse_dsum t p f g))
= fun #rrel #rel input pos ->
let h = HST.get () in
[@inline_let]
let _ = parse_dsum_eq' t p f g (bytes_of_slice_from h input (uint64_to_uint32 pos)) in
[@inline_let]
let _ = valid_facts (parse_dsum t p f g) h input (uint64_to_uint32 pos) in
[@inline_let]
let _ = valid_facts p h input (uint64_to_uint32 pos) in
let pos_after_tag = v input pos in
if is_error pos_after_tag
then pos_after_tag
else
let tg = p32 input (uint64_to_uint32 pos) in
[@inline_let]
let _ = valid_facts (parse_dsum_cases' t f g (maybe_enum_key_of_repr (dsum_enum t) tg)) h input (uint64_to_uint32 pos_after_tag) in
destr (validate_dsum_cases_eq t f g) (validate_dsum_cases_if t f g) (fun _ _ -> ()) (fun _ _ _ _ -> ()) (validate_dsum_cases' t f f32 g32) tg input pos_after_tag
#pop-options
#reset-options "--z3rlimit 64 --z3cliopt smt.arith.nl=false --initial_ifuel 8 --max_ifuel 8 --initial_fuel 2 --max_fuel 2"
let valid_dsum_intro_known
(h: HS.mem)
(t: dsum)
(#kt: parser_kind)
(p: parser kt (dsum_repr_type t))
(f: ((x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x))))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: Lemma
(requires (
valid (parse_maybe_enum_key p (dsum_enum t)) h input pos /\ (
let k' = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
Known? k' /\ (
let Known k = k' in
valid (dsnd (f k)) h input (get_valid_pos (parse_maybe_enum_key p (dsum_enum t)) h input pos)
))))
(ensures (
let Known k = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
let pos_payload = get_valid_pos (parse_maybe_enum_key p (dsum_enum t)) h input pos in
valid_content_pos
(parse_dsum t p f g) h input pos
(synth_dsum_case t (Known k) (contents (dsnd (f k)) h input pos_payload))
(get_valid_pos (dsnd (f k)) h input pos_payload)
))
= valid_facts (parse_maybe_enum_key p (dsum_enum t)) h input pos;
let Known k = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
let pos_payload = get_valid_pos (parse_maybe_enum_key p (dsum_enum t)) h input pos in
valid_facts (dsnd (f k)) h input pos_payload;
valid_facts (parse_dsum t p f g) h input pos;
parse_dsum_eq t p f g (bytes_of_slice_from h input pos)
let valid_dsum_intro_unknown
(h: HS.mem)
(t: dsum)
(#kt: parser_kind)
(p: parser kt (dsum_repr_type t))
(f: ((x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x))))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: Lemma
(requires (
valid (parse_maybe_enum_key p (dsum_enum t)) h input pos /\ (
let k' = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
Unknown? k' /\
valid g h input (get_valid_pos (parse_maybe_enum_key p (dsum_enum t)) h input pos)
)))
(ensures (
let Unknown r = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
let pos_payload = get_valid_pos (parse_maybe_enum_key p (dsum_enum t)) h input pos in
valid_content_pos
(parse_dsum t p f g) h input pos
(synth_dsum_case t (Unknown r) (contents g h input pos_payload))
(get_valid_pos g h input pos_payload)
))
= valid_facts (parse_maybe_enum_key p (dsum_enum t)) h input pos;
let Unknown r = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
let pos_payload = get_valid_pos (parse_maybe_enum_key p (dsum_enum t)) h input pos in
valid_facts g h input pos_payload;
valid_facts (parse_dsum t p f g) h input pos;
parse_dsum_eq t p f g (bytes_of_slice_from h input pos)
#reset-options
inline_for_extraction
let finalize_dsum_case_known
(t: dsum)
(#kt: parser_kind)
(#p: parser kt (dsum_repr_type t))
(s: serializer p)
(w: leaf_writer_strong s)
(f: ((x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x))))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
(destr: enum_repr_of_key'_t (dsum_enum t))
(k: dsum_known_key t)
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: HST.Stack unit
(requires (fun h ->
let len_tag = serialized_length (serialize_enum_key _ s (dsum_enum t)) k in
U32.v pos + len_tag < 4294967296 /\ (
let pos_payload = pos `U32.add` U32.uint_to_t len_tag in
valid (dsnd (f k)) h input pos_payload /\
writable input.base (U32.v pos) (U32.v pos_payload) h
)))
(ensures (fun h _ h' ->
let len_tag = serialized_length (serialize_enum_key _ s (dsum_enum t)) k in
let pos_payload = pos `U32.add` U32.uint_to_t len_tag in
B.modifies (loc_slice_from_to input pos pos_payload) h h' /\
valid_content_pos (parse_dsum t p f g) h' input pos (synth_dsum_case t (Known k) (contents (dsnd (f k)) h input pos_payload)) (get_valid_pos (dsnd (f k)) h input pos_payload)
))
= let pos1 = write_enum_key w (dsum_enum t) destr k input pos in
let h = HST.get () in
[@inline_let]
let _ =
valid_facts (parse_enum_key p (dsum_enum t)) h input pos;
valid_facts (parse_maybe_enum_key p (dsum_enum t)) h input pos;
let sq = bytes_of_slice_from h input pos in
parse_enum_key_eq p (dsum_enum t) sq;
parse_maybe_enum_key_eq p (dsum_enum t) sq;
valid_dsum_intro_known h t p f g input pos
in
()
inline_for_extraction
let finalize_dsum_case_unknown
(t: dsum)
(#kt: parser_kind)
(#p: parser kt (dsum_repr_type t))
(s: serializer p)
(w: leaf_writer_strong s)
(f: ((x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x))))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
(r: unknown_enum_repr (dsum_enum t))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: HST.Stack unit
(requires (fun h ->
let len_tag = serialized_length s r in
U32.v pos + len_tag < 4294967296 /\ (
let pos_payload = pos `U32.add` U32.uint_to_t len_tag in
valid g h input pos_payload /\
writable input.base (U32.v pos) (U32.v pos_payload) h
)))
(ensures (fun h _ h' ->
let len_tag = serialized_length s r in
let pos_payload = pos `U32.add` U32.uint_to_t len_tag in
B.modifies (loc_slice_from_to input pos pos_payload) h h' /\
valid_content_pos (parse_dsum t p f g) h' input pos (synth_dsum_case t (Unknown r) (contents g h input pos_payload)) (get_valid_pos g h input pos_payload)
))
= let pos1 = w r input pos in
let h = HST.get () in
[@inline_let]
let _ =
valid_facts (parse_maybe_enum_key p (dsum_enum t)) h input pos;
valid_facts p h input pos;
let sq = bytes_of_slice_from h input pos in
parse_maybe_enum_key_eq p (dsum_enum t) sq;
valid_dsum_intro_unknown h t p f g input pos
in
()
let valid_dsum_elim_tag
(h: HS.mem)
(t: dsum)
(#kt: parser_kind)
(p: parser kt (dsum_repr_type t))
(f: ((x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x))))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: Lemma
(requires (
valid (parse_dsum t p f g) h input pos
))
(ensures (
valid (parse_maybe_enum_key p (dsum_enum t)) h input pos /\
contents (parse_maybe_enum_key p (dsum_enum t)) h input pos == dsum_tag_of_data t (contents (parse_dsum t p f g) h input pos)
))
= let _ = parse_dsum_eq_ t p f g (bytes_of_slice_from h input pos) in
let _ = valid_facts (parse_dsum t p f g) h input pos in
let _ = valid_facts (parse_maybe_enum_key p (dsum_enum t)) h input pos in
()
inline_for_extraction
let read_dsum_tag
(t: dsum)
(#kt: parser_kind)
(#p: parser kt (dsum_repr_type t))
(p32: leaf_reader p)
(destr: maybe_enum_destr_t (maybe_enum_key (dsum_enum t)) (dsum_enum t))
(f: ((x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x))))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: HST.Stack (dsum_key t)
(requires (fun h ->
valid (parse_dsum t p f g) h input pos
))
(ensures (fun h res h' ->
B.modifies B.loc_none h h' /\
res == dsum_tag_of_data t (contents (parse_dsum t p f g) h input pos)
))
= let h = HST.get () in
[@inline_let] let _ = valid_dsum_elim_tag h t p f g input pos in
read_maybe_enum_key p32 (dsum_enum t) destr input pos
#push-options "--z3rlimit 32"
let valid_dsum_elim_known
(h: HS.mem)
(t: dsum)
(#kt: parser_kind)
(p: parser kt (dsum_repr_type t))
(f: ((x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x))))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: Lemma
(requires (
valid (parse_dsum t p f g) h input pos /\
Known? (dsum_tag_of_data t (contents (parse_dsum t p f g) h input pos))
))
(ensures (
valid (parse_maybe_enum_key p (dsum_enum t)) h input pos /\ (
let k' = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
let pos_payload = get_valid_pos (parse_maybe_enum_key p (dsum_enum t)) h input pos in
Known? k' /\ (
let Known k = k' in
valid (dsnd (f k)) h input pos_payload /\
valid_content_pos
(parse_dsum t p f g) h input pos
(synth_dsum_case t (Known k) (contents (dsnd (f k)) h input pos_payload))
(get_valid_pos (dsnd (f k)) h input pos_payload)
))))
=
valid_facts (parse_dsum t p f g) h input pos;
parse_dsum_eq t p f g (bytes_of_slice_from h input pos);
valid_facts (parse_maybe_enum_key p (dsum_enum t)) h input pos;
let Known k = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
let pos_payload = get_valid_pos (parse_maybe_enum_key p (dsum_enum t)) h input pos in
valid_facts (dsnd (f k)) h input pos_payload
#pop-options
let valid_dsum_elim_unknown
(h: HS.mem)
(t: dsum)
(#kt: parser_kind)
(p: parser kt (dsum_repr_type t))
(f: ((x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x))))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: Lemma
(requires (
valid (parse_dsum t p f g) h input pos /\
Unknown? (dsum_tag_of_data t (contents (parse_dsum t p f g) h input pos))
))
(ensures (
valid (parse_maybe_enum_key p (dsum_enum t)) h input pos /\ (
let k' = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
let pos_payload = get_valid_pos (parse_maybe_enum_key p (dsum_enum t)) h input pos in
Unknown? k' /\ (
let Unknown r = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
valid g h input pos_payload /\
valid_content_pos
(parse_dsum t p f g) h input pos
(synth_dsum_case t (Unknown r) (contents g h input pos_payload))
(get_valid_pos g h input pos_payload)
))))
=
valid_facts (parse_dsum t p f g) h input pos;
parse_dsum_eq t p f g (bytes_of_slice_from h input pos);
valid_facts (parse_maybe_enum_key p (dsum_enum t)) h input pos;
let Unknown r = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
let pos_payload = get_valid_pos (parse_maybe_enum_key p (dsum_enum t)) h input pos in
valid_facts g h input pos_payload
inline_for_extraction
let jump_dsum_cases_t
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(#k: parser_kind)
(g: parser k (dsum_type_of_unknown_tag s))
(x: dsum_key s)
: Tot Type
= jumper (parse_dsum_cases' s f g x)
let jump_dsum_cases_eq
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(#k: parser_kind)
(g: parser k (dsum_type_of_unknown_tag s))
(x: dsum_key s)
(v1 v2 : jump_dsum_cases_t s f g x)
: GTot Type0
= True
inline_for_extraction
let jump_dsum_cases_if'
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(#k: parser_kind)
(g: parser k (dsum_type_of_unknown_tag s))
(x: dsum_key s)
(cond: bool)
(ift: (cond_true cond -> Tot (jump_dsum_cases_t s f g x)))
(iff: (cond_false cond -> Tot (jump_dsum_cases_t s f g x)))
: Tot (jump_dsum_cases_t s f g x)
= fun #rrel #rel input len ->
if cond
then (ift () <: jump_dsum_cases_t s f g x) input len
else (iff () <: jump_dsum_cases_t s f g x) input len
inline_for_extraction
let jump_dsum_cases_if
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(#k: parser_kind)
(g: parser k (dsum_type_of_unknown_tag s))
(x: dsum_key s)
: Tot (if_combinator _ (jump_dsum_cases_eq s f g x))
= jump_dsum_cases_if' s f g x
inline_for_extraction
let jump_dsum_cases'
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(f' : (x: dsum_known_key s) -> Tot (jumper (dsnd (f x))))
(#k: parser_kind)
(#g: parser k (dsum_type_of_unknown_tag s))
(g' : jumper g)
(x: dsum_key s)
: Tot (jump_dsum_cases_t s f g x)
= synth_dsum_case_injective s x;
match x with
| Known x' -> jump_synth (f' x') (synth_dsum_case s (Known x')) () <: jumper (parse_dsum_cases' s f g x)
| Unknown x' -> jump_synth g' (synth_dsum_case s (Unknown x')) () <: jumper (parse_dsum_cases' s f g x)
inline_for_extraction
let jump_dsum_cases'_destr
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(f' : (x: dsum_known_key s) -> Tot (jumper (dsnd (f x))))
(#k: parser_kind)
(#g: parser k (dsum_type_of_unknown_tag s))
(g' : jumper g)
(destr: dep_enum_destr _ (fun k -> jump_dsum_cases_t s f g (Known k)))
(x: dsum_key s)
: Tot (jump_dsum_cases_t s f g x)
= fun #rrel #rel input pos ->
match x with
| Known k ->
destr
_
(fun k -> jump_dsum_cases_if s f g (Known k))
(fun _ _ -> ())
(fun _ _ _ _ -> ())
(fun k -> jump_dsum_cases' s f f' g' (Known k))
k
input
pos
| Unknown r -> jump_dsum_cases' s f f' g' (Unknown r) input pos
inline_for_extraction
let jump_dsum_cases
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(f' : (x: dsum_known_key s) -> Tot (jumper (dsnd (f x))))
(#k: parser_kind)
(#g: parser k (dsum_type_of_unknown_tag s))
(g' : jumper g)
(destr: dep_enum_destr _ (fun k -> jump_dsum_cases_t s f g (Known k)))
(x: dsum_key s)
: Tot (jumper (parse_dsum_cases s f g x))
= fun #rrel #rel input pos ->
let h = HST.get () in
[@inline_let]
let _ =
valid_facts (parse_dsum_cases' s f g x) h input pos;
valid_facts (parse_dsum_cases s f g x) h input pos;
parse_dsum_cases_eq' s f g x (bytes_of_slice_from h input pos)
in
jump_dsum_cases'_destr s f f' g' destr x input pos
#push-options "--z3rlimit 16"
inline_for_extraction
let jump_dsum
(#kt: parser_kind)
(t: dsum)
(#p: parser kt (dsum_repr_type t))
(v: jumper p)
(p32: leaf_reader p)
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(f32: (x: dsum_known_key t) -> Tot (jumper (dsnd (f x))))
(#k': parser_kind)
(#g: parser k' (dsum_type_of_unknown_tag t))
(g32: jumper g)
(destr: dep_maybe_enum_destr_t (dsum_enum t) (jump_dsum_cases_t t f g))
: Tot (jumper (parse_dsum t p f g))
= fun #rrel #rel input pos ->
let h = HST.get () in
[@inline_let]
let _ = parse_dsum_eq' t p f g (bytes_of_slice_from h input pos) in
[@inline_let]
let _ = valid_facts (parse_dsum t p f g) h input pos in
[@inline_let]
let _ = valid_facts p h input pos in
let pos_after_tag = v input pos in
let tg = p32 input pos in
[@inline_let]
let _ = valid_facts (parse_dsum_cases' t f g (maybe_enum_key_of_repr (dsum_enum t) tg)) h input pos_after_tag in
destr (jump_dsum_cases_eq t f g) (jump_dsum_cases_if t f g) (fun _ _ -> ()) (fun _ _ _ _ -> ()) (jump_dsum_cases' t f f32 g32) tg input pos_after_tag
#pop-options
inline_for_extraction
let read_dsum_cases'
(t: dsum)
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(f32: (x: dsum_known_key t) -> Tot (leaf_reader (dsnd (f x))))
(#k': parser_kind)
(g: parser k' (dsum_type_of_unknown_tag t))
(g32: leaf_reader g)
(x: dsum_key t)
: Tot (leaf_reader (parse_dsum_cases' t f g x))
= fun #rrel #rel input pos ->
[@inline_let]
let _ = synth_dsum_case_injective t x in
match x with
| Known x' ->
read_synth'
(dsnd (f x'))
(synth_dsum_case t (Known x'))
(f32 x')
()
input
pos
| Unknown x' ->
read_synth'
g
(synth_dsum_case t (Unknown x'))
g32
()
input
pos
inline_for_extraction
let read_dsum_cases_t
(t: dsum)
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(#k': parser_kind)
(g: parser k' (dsum_type_of_unknown_tag t))
(k: dsum_known_key t)
: Tot Type
= leaf_reader (parse_dsum_cases' t f g (Known k))
let read_dsum_cases_t_eq
(t: dsum)
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(#k': parser_kind)
(g: parser k' (dsum_type_of_unknown_tag t))
(k: dsum_known_key t)
(x y : read_dsum_cases_t t f g k)
: GTot Type0
= True
inline_for_extraction
let read_dsum_cases_t_if
(t: dsum)
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(#k': parser_kind)
(g: parser k' (dsum_type_of_unknown_tag t))
(k: dsum_known_key t)
: Tot (if_combinator _ (read_dsum_cases_t_eq t f g k))
= fun cond (sv_true: cond_true cond -> Tot (read_dsum_cases_t t f g k)) (sv_false: cond_false cond -> Tot (read_dsum_cases_t t f g k)) #_ #_ input pos ->
if cond
then sv_true () input pos
else sv_false () input pos
inline_for_extraction
let read_dsum_cases
(t: dsum)
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(f32: (x: dsum_known_key t) -> Tot (leaf_reader (dsnd (f x))))
(#k': parser_kind)
(g: parser k' (dsum_type_of_unknown_tag t))
(g32: leaf_reader g)
(destr: dep_enum_destr _ (read_dsum_cases_t t f g))
(x: dsum_key t)
: Tot (leaf_reader (parse_dsum_cases' t f g x))
= fun #_ #_ input pos ->
match x with
| Known k ->
destr
_
(read_dsum_cases_t_if t f g)
(fun _ _ -> ())
(fun _ _ _ _ -> ())
(fun k -> read_dsum_cases' t f f32 g g32 (Known k))
k
input
pos
| Unknown r ->
read_dsum_cases' t f f32 g g32 (Unknown r) input pos
#push-options "--z3rlimit 16"
inline_for_extraction
let read_dsum
(#kt: parser_kind)
(t: dsum)
(#p: parser kt (dsum_repr_type t))
(p32: leaf_reader (parse_maybe_enum_key p (dsum_enum t)))
(j: jumper p)
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(f32: (x: dsum_known_key t) -> Tot (leaf_reader (dsnd (f x))))
(#k': parser_kind)
(#g: parser k' (dsum_type_of_unknown_tag t))
(g32: leaf_reader g)
(destr: dep_enum_destr _ (read_dsum_cases_t t f g))
: Tot (leaf_reader (parse_dsum t p f g))
= fun #_ #_ input pos ->
let h = HST.get () in
valid_facts (parse_dsum t p f g) h input pos;
parse_dsum_eq_ t p f g (bytes_of_slice_from h input pos);
valid_facts (parse_maybe_enum_key p (dsum_enum t)) h input pos;
let k = p32 input pos in
let pos' = jump_maybe_enum_key j (dsum_enum t) input pos in
valid_facts (parse_dsum_cases' t f g k) h input pos' ;
read_dsum_cases t f f32 g g32 destr k input pos'
#pop-options
inline_for_extraction
let serialize32_dsum_type_of_tag
(t: dsum)
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(sf: (x: dsum_known_key t) -> Tot (serializer (dsnd (f x))))
(sf32: (x: dsum_known_key t) -> Tot (serializer32 (sf x)))
(#k': parser_kind)
(#g: parser k' (dsum_type_of_unknown_tag t))
(#sg: serializer g)
(sg32: serializer32 sg)
(tg: dsum_key t)
: Tot (serializer32 (serialize_dsum_type_of_tag t f sf g sg tg))
= match tg with
| Known x' -> serialize32_ext (dsnd (f x')) (sf x') (sf32 x') (parse_dsum_type_of_tag t f g tg) ()
| Unknown x' -> serialize32_ext g sg sg32 (parse_dsum_type_of_tag t f g tg) () | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"LowStar.Buffer.fst.checked",
"LowParse.Spec.Sum.fst.checked",
"LowParse.Low.Enum.fst.checked",
"FStar.UInt64.fsti.checked",
"FStar.UInt32.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Int.Cast.fst.checked",
"FStar.HyperStack.ST.fsti.checked",
"FStar.HyperStack.fst.checked",
"FStar.Classical.fsti.checked"
],
"interface_file": false,
"source_file": "LowParse.Low.Sum.fst"
} | [
{
"abbrev": true,
"full_module": "FStar.HyperStack",
"short_module": "HS"
},
{
"abbrev": true,
"full_module": "FStar.UInt64",
"short_module": "U64"
},
{
"abbrev": true,
"full_module": "FStar.Int.Cast",
"short_module": "Cast"
},
{
"abbrev": true,
"full_module": "LowStar.Buffer",
"short_module": "B"
},
{
"abbrev": true,
"full_module": "FStar.HyperStack.ST",
"short_module": "HST"
},
{
"abbrev": true,
"full_module": "FStar.UInt32",
"short_module": "U32"
},
{
"abbrev": false,
"full_module": "LowParse.Spec.Sum",
"short_module": null
},
{
"abbrev": false,
"full_module": "LowParse.Low.Enum",
"short_module": null
},
{
"abbrev": false,
"full_module": "LowParse.Low",
"short_module": null
},
{
"abbrev": false,
"full_module": "LowParse.Low",
"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",
"short_module": null
}
] | {
"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_elim_box": false,
"smtencoding_l_arith_repr": "boxwrap",
"smtencoding_nl_arith_repr": "boxwrap",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": true,
"z3cliopt": [],
"z3refresh": false,
"z3rlimit": 5,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | false |
t: LowParse.Spec.Sum.dsum ->
f:
(x: LowParse.Spec.Sum.dsum_known_key t
-> Prims.dtuple2 LowParse.Spec.Base.parser_kind
(fun k -> LowParse.Spec.Base.parser k (LowParse.Spec.Sum.dsum_type_of_known_tag t x))) ->
sf:
(x: LowParse.Spec.Sum.dsum_known_key t
-> LowParse.Spec.Base.serializer (FStar.Pervasives.dsnd (f x))) ->
sf32: (x: LowParse.Spec.Sum.dsum_known_key t -> LowParse.Low.Base.serializer32 (sf x)) ->
sg32: LowParse.Low.Base.serializer32 sg ->
tg: LowParse.Spec.Sum.dsum_key t
-> LowParse.Low.Base.serializer32 (LowParse.Spec.Sum.serialize_dsum_cases t f sf g sg tg) | Prims.Tot | [
"total"
] | [] | [
"LowParse.Spec.Sum.dsum",
"LowParse.Spec.Sum.dsum_known_key",
"Prims.dtuple2",
"LowParse.Spec.Base.parser_kind",
"LowParse.Spec.Base.parser",
"LowParse.Spec.Sum.dsum_type_of_known_tag",
"LowParse.Spec.Base.serializer",
"Prims.__proj__Mkdtuple2__item___1",
"FStar.Pervasives.dsnd",
"LowParse.Low.Base.serializer32",
"LowParse.Spec.Sum.dsum_type_of_unknown_tag",
"LowParse.Spec.Sum.dsum_key",
"LowParse.Low.Combinators.serialize32_synth",
"LowParse.Spec.Sum.weaken_parse_dsum_cases_kind",
"LowParse.Spec.Sum.dsum_type_of_tag",
"LowParse.Spec.Sum.parse_dsum_type_of_tag",
"LowParse.Spec.Sum.serialize_dsum_type_of_tag",
"LowParse.Low.Sum.serialize32_dsum_type_of_tag",
"LowParse.Spec.Base.refine_with_tag",
"LowParse.Spec.Sum.dsum_type",
"LowParse.Spec.Sum.dsum_tag_of_data",
"LowParse.Spec.Sum.synth_dsum_case",
"LowParse.Spec.Sum.synth_dsum_case_recip",
"Prims.eq2",
"Prims.unit",
"LowParse.Spec.Sum.synth_dsum_case_inverse",
"LowParse.Spec.Sum.synth_dsum_case_injective",
"LowParse.Spec.Sum.dsum_cases",
"LowParse.Spec.Sum.parse_dsum_cases",
"LowParse.Spec.Sum.serialize_dsum_cases"
] | [] | false | false | false | false | false | let serialize32_dsum_cases_aux
(t: dsum)
(f: (x: dsum_known_key t -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x))))
(sf: (x: dsum_known_key t -> Tot (serializer (dsnd (f x)))))
(sf32: (x: dsum_known_key t -> Tot (serializer32 (sf x))))
(#k': parser_kind)
(#g: parser k' (dsum_type_of_unknown_tag t))
(#sg: serializer g)
(sg32: serializer32 sg)
(tg: dsum_key t)
: Tot (serializer32 (serialize_dsum_cases t f sf g sg tg)) =
| [@@ inline_let ]let _ = synth_dsum_case_injective t tg in
[@@ inline_let ]let _ = synth_dsum_case_inverse t tg in
serialize32_synth (serialize32_dsum_type_of_tag t f sf sf32 sg32 tg)
(synth_dsum_case t tg)
(synth_dsum_case_recip t tg)
(fun x -> synth_dsum_case_recip t tg x)
() | false |
LowParse.Low.Sum.fst | LowParse.Low.Sum.valid_dsum_elim_tag | val valid_dsum_elim_tag
(h: HS.mem)
(t: dsum)
(#kt: parser_kind)
(p: parser kt (dsum_repr_type t))
(f: (x: dsum_known_key t -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x))))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: Lemma (requires (valid (parse_dsum t p f g) h input pos))
(ensures
(valid (parse_maybe_enum_key p (dsum_enum t)) h input pos /\
contents (parse_maybe_enum_key p (dsum_enum t)) h input pos ==
dsum_tag_of_data t (contents (parse_dsum t p f g) h input pos))) | val valid_dsum_elim_tag
(h: HS.mem)
(t: dsum)
(#kt: parser_kind)
(p: parser kt (dsum_repr_type t))
(f: (x: dsum_known_key t -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x))))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: Lemma (requires (valid (parse_dsum t p f g) h input pos))
(ensures
(valid (parse_maybe_enum_key p (dsum_enum t)) h input pos /\
contents (parse_maybe_enum_key p (dsum_enum t)) h input pos ==
dsum_tag_of_data t (contents (parse_dsum t p f g) h input pos))) | let valid_dsum_elim_tag
(h: HS.mem)
(t: dsum)
(#kt: parser_kind)
(p: parser kt (dsum_repr_type t))
(f: ((x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x))))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: Lemma
(requires (
valid (parse_dsum t p f g) h input pos
))
(ensures (
valid (parse_maybe_enum_key p (dsum_enum t)) h input pos /\
contents (parse_maybe_enum_key p (dsum_enum t)) h input pos == dsum_tag_of_data t (contents (parse_dsum t p f g) h input pos)
))
= let _ = parse_dsum_eq_ t p f g (bytes_of_slice_from h input pos) in
let _ = valid_facts (parse_dsum t p f g) h input pos in
let _ = valid_facts (parse_maybe_enum_key p (dsum_enum t)) h input pos in
() | {
"file_name": "src/lowparse/LowParse.Low.Sum.fst",
"git_rev": "00217c4a89f5ba56002ba9aa5b4a9d5903bfe9fa",
"git_url": "https://github.com/project-everest/everparse.git",
"project_name": "everparse"
} | {
"end_col": 4,
"end_line": 1272,
"start_col": 0,
"start_line": 1250
} | module LowParse.Low.Sum
include LowParse.Low.Enum
include LowParse.Spec.Sum
module U32 = FStar.UInt32
module HST = FStar.HyperStack.ST
module B = LowStar.Buffer
module Cast = FStar.Int.Cast
module U64 = FStar.UInt64
inline_for_extraction
let validate_sum_cases_aux
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(vc: ((x: sum_key t) -> Tot (validator (dsnd (pc x)))))
(k: sum_key t)
: Tot (validator (parse_sum_cases t pc k))
= [@inline_let]
let _ = synth_sum_case_injective t k in
validate_synth
(validate_weaken
(weaken_parse_cases_kind t pc)
(vc k)
()
)
(synth_sum_case t k)
()
inline_for_extraction
let validate_sum_cases_t
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot Type
= validator (parse_sum_cases t pc k)
let validate_sum_cases_t_eq
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
(x y : validate_sum_cases_t t pc k)
: GTot Type0
= True
inline_for_extraction
let validate_sum_cases_t_if
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (if_combinator _ (validate_sum_cases_t_eq t pc k))
= fun cond (sv_true: cond_true cond -> Tot (validate_sum_cases_t t pc k)) (sv_false: cond_false cond -> Tot (validate_sum_cases_t t pc k)) #rrel #rel input pos ->
if cond
then sv_true () input pos
else sv_false () input pos
inline_for_extraction
let validate_sum_cases
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(vc: ((x: sum_key t) -> Tot (validator (dsnd (pc x)))))
(destr: dep_enum_destr (sum_enum t) (validate_sum_cases_t t pc))
(k: sum_key t)
: Tot (validator (parse_sum_cases t pc k))
= destr
_
(validate_sum_cases_t_if t pc)
(fun _ _ -> ())
(fun _ _ _ _ -> ())
(validate_sum_cases_aux t pc vc)
k
inline_for_extraction
let validate_sum_aux_payload_t
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
: Tot Type
= (#rrel: _) -> (#rel: _) ->
(input: slice rrel rel) ->
(pos: U64.t) ->
HST.Stack U64.t
(requires (fun h -> live_slice h input /\ U64.v pos <= U32.v input.len))
(ensures (fun h res h' ->
B.modifies B.loc_none h h' /\ (
match k with
| Unknown _ -> is_error res
| Known k' ->
if is_success res
then
valid_pos (dsnd (pc k')) h input (uint64_to_uint32 pos) (uint64_to_uint32 res)
else
(~ (valid (dsnd (pc k')) h input (uint64_to_uint32 pos)))
)))
let validate_sum_aux_payload_eq
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
: Tot (validate_sum_aux_payload_t t pc k -> validate_sum_aux_payload_t t pc k -> GTot Type0)
= fun _ _ -> True
inline_for_extraction
let validate_sum_aux_payload_if'
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
(cond: bool)
(ift: ((cond_true cond) -> Tot (validate_sum_aux_payload_t t pc k)))
(iff: ((cond_false cond) -> Tot (validate_sum_aux_payload_t t pc k)))
: Tot (validate_sum_aux_payload_t t pc k)
= fun #rrel #rel input pos ->
if cond
then begin
(ift () <: validate_sum_aux_payload_t t pc k) input pos
end else
(iff () <: validate_sum_aux_payload_t t pc k) input pos
inline_for_extraction
let validate_sum_aux_payload_if
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
: Tot (if_combinator _ (validate_sum_aux_payload_eq t pc k))
= validate_sum_aux_payload_if' t pc k
#push-options "--z3rlimit 64 --z3cliopt smt.arith.nl=false --using_facts_from '* -FStar.Int.Cast -LowParse.BitFields'"
// --query_stats --smtencoding.elim_box true --smtencoding.l_arith_repr native --z3refresh"
inline_for_extraction
let validate_sum_aux
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(v: validator p)
(p32: leaf_reader p)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(v_payload: ((k: sum_repr_type t)) -> Tot (validate_sum_aux_payload_t t pc (maybe_enum_key_of_repr (sum_enum t) k)))
: Tot (validator (parse_sum t p pc))
= fun #rrel #rel input pos ->
let h = HST.get () in
[@inline_let]
let _ = parse_sum_eq'' t p pc (bytes_of_slice_from h input (uint64_to_uint32 pos)) in
[@inline_let]
let _ = valid_facts (parse_sum t p pc) h input (uint64_to_uint32 pos) in
[@inline_let]
let _ = valid_facts p h input (uint64_to_uint32 pos) in
let len_after_tag = v input pos in
if is_error len_after_tag
then len_after_tag
else begin
let h1 = HST.get () in
let k' = p32 input (uint64_to_uint32 pos) in
[@inline_let]
let _ =
match maybe_enum_key_of_repr (sum_enum t) k' with
| Known k -> valid_facts (dsnd (pc k)) h input (uint64_to_uint32 len_after_tag)
| _ -> ()
in
v_payload k' input len_after_tag
end
#pop-options
inline_for_extraction
let validate_sum_aux_payload'
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (validator (dsnd (pc x)))))
(k: maybe_enum_key (sum_enum t))
: Tot (validate_sum_aux_payload_t t pc k)
= fun #rrel #rel input pos ->
match k with
| Known k ->
[@inline_let]
let _ = synth_sum_case_injective t k in
pc32 k input pos
// validate_synth (pc32 k) (synth_sum_case t k) () input pos
| _ -> validator_error_generic
inline_for_extraction
let validate_sum_aux_payload
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (validator (dsnd (pc x)))))
(destr: dep_maybe_enum_destr_t (sum_enum t) (validate_sum_aux_payload_t t pc))
(k: sum_repr_type t)
: Tot (validate_sum_aux_payload_t t pc (maybe_enum_key_of_repr (sum_enum t) k))
= destr (validate_sum_aux_payload_eq t pc) (validate_sum_aux_payload_if t pc) (fun _ _ -> ()) (fun _ _ _ _ -> ()) (validate_sum_aux_payload' t pc pc32) k
inline_for_extraction
let validate_sum
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(v: validator p)
(p32: leaf_reader p)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (validator (dsnd (pc x)))))
(destr: dep_maybe_enum_destr_t (sum_enum t) (validate_sum_aux_payload_t t pc))
: Tot (validator (parse_sum t p pc))
= validate_sum_aux t v p32 pc (validate_sum_aux_payload t pc pc32 destr)
module HS = FStar.HyperStack
#push-options "--z3rlimit 256 --z3cliopt smt.arith.nl=false --initial_ifuel 8 --max_ifuel 8 --initial_fuel 2 --max_fuel 2"
#restart-solver
let valid_sum_intro
(h: HS.mem)
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: Lemma
(requires (
valid (parse_enum_key p (sum_enum t)) h input pos /\ (
let k = contents (parse_enum_key p (sum_enum t)) h input pos in
valid (dsnd (pc k)) h input (get_valid_pos (parse_enum_key p (sum_enum t)) h input pos)
)))
(ensures (
let k = contents (parse_enum_key p (sum_enum t)) h input pos in
let pos_payload = get_valid_pos (parse_enum_key p (sum_enum t)) h input pos in
valid_content_pos
(parse_sum t p pc) h input pos
(synth_sum_case t k (contents (dsnd (pc k)) h input pos_payload))
(get_valid_pos (dsnd (pc k)) h input pos_payload)
))
= valid_facts (parse_enum_key p (sum_enum t)) h input pos;
let k = contents (parse_enum_key p (sum_enum t)) h input pos in
let pos_payload = get_valid_pos (parse_enum_key p (sum_enum t)) h input pos in
valid_facts (dsnd (pc k)) h input pos_payload;
valid_facts (parse_sum t p pc) h input pos;
parse_sum_eq t p pc (bytes_of_slice_from h input pos)
#pop-options
inline_for_extraction
let finalize_sum_case
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(s: serializer p)
(w: leaf_writer_strong s)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(destr: enum_repr_of_key'_t (sum_enum t))
(k: sum_key t)
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: HST.Stack unit
(requires (fun h ->
let len_tag = serialized_length (serialize_enum_key _ s (sum_enum t)) k in
U32.v pos + len_tag < 4294967296 /\ (
let pos_payload = pos `U32.add` U32.uint_to_t len_tag in
valid (dsnd (pc k)) h input pos_payload /\
writable input.base (U32.v pos) (U32.v pos_payload) h
)))
(ensures (fun h _ h' ->
let len_tag = serialized_length (serialize_enum_key _ s (sum_enum t)) k in
let pos_payload = pos `U32.add` U32.uint_to_t len_tag in
B.modifies (loc_slice_from_to input pos pos_payload) h h' /\
valid_content_pos (parse_sum t p pc) h' input pos (synth_sum_case t k (contents (dsnd (pc k)) h input pos_payload)) (get_valid_pos (dsnd (pc k)) h input pos_payload)
))
= let pos1 = write_enum_key w (sum_enum t) destr k input pos in
let h = HST.get () in
[@inline_let]
let _ = valid_sum_intro h t p pc input pos in
()
inline_for_extraction
let jump_sum_cases_aux
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(vc: ((x: sum_key t) -> Tot (jumper (dsnd (pc x)))))
(k: sum_key t)
: Tot (jumper (parse_sum_cases t pc k))
= [@inline_let]
let _ = synth_sum_case_injective t k in
jump_synth
(jump_weaken
(weaken_parse_cases_kind t pc)
(vc k)
()
)
(synth_sum_case t k)
()
inline_for_extraction
let jump_sum_cases_t
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot Type
= jumper (parse_sum_cases t pc k)
let jump_sum_cases_t_eq
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
(x y : jump_sum_cases_t t pc k)
: GTot Type0
= True
inline_for_extraction
let jump_sum_cases_t_if
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (if_combinator _ (jump_sum_cases_t_eq t pc k))
= fun cond (sv_true: cond_true cond -> Tot (jump_sum_cases_t t pc k)) (sv_false: cond_false cond -> Tot (jump_sum_cases_t t pc k)) #rrel #rel input pos ->
if cond
then sv_true () input pos
else sv_false () input pos
inline_for_extraction
let jump_sum_cases
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(vc: ((x: sum_key t) -> Tot (jumper (dsnd (pc x)))))
(destr: dep_enum_destr (sum_enum t) (jump_sum_cases_t t pc))
(k: sum_key t)
: Tot (jumper (parse_sum_cases t pc k))
= destr
_
(jump_sum_cases_t_if t pc)
(fun _ _ -> ())
(fun _ _ _ _ -> ())
(jump_sum_cases_aux t pc vc)
k
inline_for_extraction
let jump_sum_aux_payload_t
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
: Tot Type
= (#rrel: _) -> (#rel: _) ->
(input: slice rrel rel) ->
(pos: U32.t) ->
HST.Stack U32.t
(requires (fun h -> live_slice h input /\ U32.v pos <= U32.v input.len /\ (
match k with
| Unknown _ -> False
| Known k' -> valid (dsnd (pc k')) h input pos
)))
(ensures (fun h res h' ->
B.modifies B.loc_none h h' /\ (
match k with
| Unknown _ -> False
| Known k' ->
valid_pos (dsnd (pc k')) h input pos res
)))
let jump_sum_aux_payload_eq
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
: Tot (jump_sum_aux_payload_t t pc k -> jump_sum_aux_payload_t t pc k -> GTot Type0)
= fun _ _ -> True
inline_for_extraction
let jump_sum_aux_payload_if'
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
(cond: bool)
(ift: ((cond_true cond) -> Tot (jump_sum_aux_payload_t t pc k)))
(iff: ((cond_false cond) -> Tot (jump_sum_aux_payload_t t pc k)))
: Tot (jump_sum_aux_payload_t t pc k)
= fun #rrel #rel input pos ->
if cond
then begin
(ift () <: jump_sum_aux_payload_t t pc k) input pos
end else
(iff () <: jump_sum_aux_payload_t t pc k) input pos
inline_for_extraction
let jump_sum_aux_payload_if
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
: Tot (if_combinator _ (jump_sum_aux_payload_eq t pc k))
= jump_sum_aux_payload_if' t pc k
let parse_sum_eq3
(#kt: parser_kind)
(t: sum)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(input: bytes)
(k' : sum_repr_type t)
(consumed_k: consumed_length input)
: Lemma
(requires (Some? (parse (parse_sum t p pc) input) /\ parse p input == Some (k', consumed_k)))
(ensures (
let input_k = Seq.slice input consumed_k (Seq.length input) in
let k = maybe_enum_key_of_repr (sum_enum t) k' in
begin match k with
| Known k ->
Some? (parse (dsnd (pc k)) input_k)
| _ -> False
end
))
= parse_sum_eq'' t p pc input
let parse_sum_eq4
(#kt: parser_kind)
(t: sum)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(input: bytes)
(k' : sum_repr_type t)
(consumed_k: consumed_length input)
(consumed_payload: nat)
: Lemma
(requires (Some? (parse (parse_sum t p pc) input) /\ parse p input == Some (k', consumed_k) /\ (
let input_k = Seq.slice input consumed_k (Seq.length input) in
let k = maybe_enum_key_of_repr (sum_enum t) k' in
begin match k with
| Known k ->
Some? (parse (dsnd (pc k)) input_k) /\ (
let Some (_, consumed_payload') = parse (dsnd (pc k)) input_k in
consumed_payload' == consumed_payload
)
| _ -> False
end
)))
(ensures (
let Some (_, consumed) = parse (parse_sum t p pc) input in
consumed == consumed_k + consumed_payload
))
= parse_sum_eq'' t p pc input
#push-options "--z3rlimit 16"
let valid_sum_elim
(h: HS.mem)
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(#rrel: _) (#rel: _)
(input: slice rrel rel)
(pos: U32.t)
: Lemma
(requires (
valid (parse_sum t p pc) h input pos
))
(ensures (
valid p h input pos /\ (
let pos_payload = get_valid_pos p h input pos in
let k' = maybe_enum_key_of_repr (sum_enum t) (contents p h input pos) in
match k' with
| Known k ->
k == sum_tag_of_data t (contents (parse_sum t p pc) h input pos) /\
valid (dsnd (pc k)) h input pos_payload /\
valid_pos
(parse_sum t p pc) h input pos
(get_valid_pos (dsnd (pc k)) h input pos_payload)
| _ -> False
)))
= let sinput = bytes_of_slice_from h input pos in
let _ = parse_sum_eq'' t p pc sinput in
[@inline_let]
let _ = valid_facts (parse_sum t p pc) h input pos in
let Some (k', consumed_k) = parse p sinput in
let pos_after_tag = U32.uint_to_t (U32.v pos + consumed_k) in
[@inline_let]
let _ = valid_facts p h input pos in
assert (valid_content_pos p h input pos k' pos_after_tag);
match maybe_enum_key_of_repr (sum_enum t) k' with
| Known k -> valid_facts (dsnd (pc k)) h input pos_after_tag
| _ -> ()
#pop-options
let valid_sum_elim_tag
(h: HS.mem)
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: Lemma
(requires (
valid (parse_sum t p pc) h input pos
))
(ensures (
valid (parse_enum_key p (sum_enum t)) h input pos /\
contents (parse_enum_key p (sum_enum t)) h input pos == sum_tag_of_data t (contents (parse_sum t p pc) h input pos)
))
= let _ = parse_sum_eq' t p pc (bytes_of_slice_from h input pos) in
let _ = valid_facts (parse_sum t p pc) h input pos in
let _ = valid_facts (parse_enum_key p (sum_enum t)) h input pos in
()
inline_for_extraction
let read_sum_tag
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(p32: leaf_reader p)
(destr: dep_maybe_enum_destr_t (sum_enum t) (read_enum_key_t (sum_enum t)))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: HST.Stack (sum_key t)
(requires (fun h ->
valid (parse_sum t p pc) h input pos
))
(ensures (fun h res h' ->
B.modifies B.loc_none h h' /\
res == sum_tag_of_data t (contents (parse_sum t p pc) h input pos)
))
= let h = HST.get () in
[@inline_let] let _ = valid_sum_elim_tag h t p pc input pos in
read_enum_key p32 (sum_enum t) destr input pos
inline_for_extraction
let jump_sum_aux
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(v: jumper p)
(p32: leaf_reader p)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(v_payload: ((k: sum_repr_type t)) -> Tot (jump_sum_aux_payload_t t pc (maybe_enum_key_of_repr (sum_enum t) k)))
: Tot (jumper (parse_sum t p pc))
= fun #rrel #rel input pos ->
let h = HST.get () in
[@inline_let]
let _ = valid_sum_elim h t p pc input pos in
let pos_after_tag = v input pos in
let k' = p32 input pos in
v_payload k' input pos_after_tag
inline_for_extraction
let jump_sum_aux_payload'
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (jumper (dsnd (pc x)))))
(k: maybe_enum_key (sum_enum t))
: Tot (jump_sum_aux_payload_t t pc k)
= fun #rrel #rel input pos ->
match k with
| Known k ->
[@inline_let]
let _ = synth_sum_case_injective t k in
pc32 k input pos
| _ -> 0ul // dummy, but we MUST NOT remove this branch, otherwise extraction fails
inline_for_extraction
let jump_sum_aux_payload
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (jumper (dsnd (pc x)))))
(destr: dep_maybe_enum_destr_t (sum_enum t) (jump_sum_aux_payload_t t pc))
(k: sum_repr_type t)
: Tot (jump_sum_aux_payload_t t pc (maybe_enum_key_of_repr (sum_enum t) k))
= destr (jump_sum_aux_payload_eq t pc) (jump_sum_aux_payload_if t pc) (fun _ _ -> ()) (fun _ _ _ _ -> ()) (jump_sum_aux_payload' t pc pc32) k
inline_for_extraction
let jump_sum
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(v: jumper p)
(p32: leaf_reader p)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (jumper (dsnd (pc x)))))
(destr: dep_maybe_enum_destr_t (sum_enum t) (jump_sum_aux_payload_t t pc))
: Tot (jumper (parse_sum t p pc))
= jump_sum_aux t v p32 pc (jump_sum_aux_payload t pc pc32 destr)
inline_for_extraction
let read_sum_cases'
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (leaf_reader (dsnd (pc x)))))
(k: sum_key t)
: Tot (leaf_reader (parse_sum_cases' t pc k))
= [@inline_let]
let _ = synth_sum_case_injective t k in
read_synth'
(dsnd (pc k))
(synth_sum_case t k)
(pc32 k)
()
inline_for_extraction
let read_sum_cases_t
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot Type
= leaf_reader (parse_sum_cases' t pc k)
let read_sum_cases_t_eq
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
(x y : read_sum_cases_t t pc k)
: GTot Type0
= True
inline_for_extraction
let read_sum_cases_t_if
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (if_combinator _ (read_sum_cases_t_eq t pc k))
= fun cond (sv_true: cond_true cond -> Tot (read_sum_cases_t t pc k)) (sv_false: cond_false cond -> Tot (read_sum_cases_t t pc k)) #_ #_ input pos ->
if cond
then (sv_true () input pos)
else (sv_false () input pos)
inline_for_extraction
let read_sum_cases
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (leaf_reader (dsnd (pc x)))))
(destr: dep_enum_destr (sum_enum t) (read_sum_cases_t t pc))
(k: sum_key t)
: Tot (leaf_reader (parse_sum_cases' t pc k))
= destr
_
(read_sum_cases_t_if t pc)
(fun _ _ -> ())
(fun _ _ _ _ -> ())
(read_sum_cases' t pc pc32)
k
#push-options "--z3rlimit 32"
inline_for_extraction
let read_sum
(#kt: parser_kind)
(t: sum)
(p: parser kt (sum_repr_type t))
(p32: leaf_reader (parse_enum_key p (sum_enum t)))
(j: jumper p)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (leaf_reader (dsnd (pc x)))))
(destr: dep_enum_destr (sum_enum t) (read_sum_cases_t t pc))
: Tot (leaf_reader (parse_sum t p pc))
=
fun #_ #_ input pos ->
let h = HST.get () in
valid_facts (parse_sum t p pc) h input pos;
parse_sum_eq' t p pc (bytes_of_slice_from h input pos);
valid_facts (parse_enum_key p (sum_enum t)) h input pos;
let k = p32 input pos in
let pos' = jump_enum_key j (sum_enum t) input pos in
valid_facts (parse_sum_cases' t pc k) h input pos' ;
read_sum_cases t pc pc32 destr k input pos'
#pop-options
inline_for_extraction
let serialize32_sum_cases_t
(t: sum)
(#pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(sc: ((x: sum_key t) -> Tot (serializer (dsnd (pc x)))))
(k: sum_key t)
: Tot Type
= serializer32 (serialize_sum_cases t pc sc k)
let serialize32_sum_cases_t_eq
(t: sum)
(#pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(sc: ((x: sum_key t) -> Tot (serializer (dsnd (pc x)))))
(k: sum_key t)
(x y: serialize32_sum_cases_t t sc k)
: GTot Type0
= True
inline_for_extraction
let serialize32_sum_cases_t_if
(t: sum)
(#pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(sc: ((x: sum_key t) -> Tot (serializer (dsnd (pc x)))))
(k: sum_key t)
: Tot (if_combinator _ (serialize32_sum_cases_t_eq t sc k))
= fun cond (sv_true: (cond_true cond -> Tot (serialize32_sum_cases_t t sc k))) (sv_false: (cond_false cond -> Tot (serialize32_sum_cases_t t sc k))) x #rrel #rel b pos ->
if cond
then (sv_true () x b pos)
else (sv_false () x b pos)
inline_for_extraction
let serialize32_sum_cases_aux
(t: sum)
(#pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(sc: ((x: sum_key t) -> Tot (serializer (dsnd (pc x)))))
(sc32: ((x: sum_key t) -> Tot (serializer32 (sc x))))
(k: sum_key t)
: Tot (serializer32 (serialize_sum_cases t pc sc k))
= fun x #rrel #rel b pos ->
[@inline_let] let _ =
Classical.forall_intro (parse_sum_cases_eq' t pc k);
synth_sum_case_injective t k;
synth_sum_case_inverse t k
in
serialize32_synth
(sc32 k)
(synth_sum_case t k)
(synth_sum_case_recip t k)
(fun x -> synth_sum_case_recip t k x)
()
x
b
pos
inline_for_extraction
let serialize32_sum_cases
(t: sum)
(#pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(sc: ((x: sum_key t) -> Tot (serializer (dsnd (pc x)))))
(sc32: ((x: sum_key t) -> Tot (serializer32 (sc x))))
(destr: dep_enum_destr (sum_enum t) (serialize32_sum_cases_t t sc))
(k: sum_key t)
: Tot (serializer32 (serialize_sum_cases t pc sc k))
= destr
_
(serialize32_sum_cases_t_if t sc)
(fun _ _ -> ())
(fun _ _ _ _ -> ())
(serialize32_sum_cases_aux t sc sc32)
k
inline_for_extraction
let serialize32_sum
(#kt: parser_kind)
(t: sum)
(#p: parser kt (sum_repr_type t))
(s: serializer p {kt.parser_kind_subkind == Some ParserStrong})
(s32: serializer32 (serialize_enum_key _ s (sum_enum t)))
(#pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(sc: ((x: sum_key t) -> Tot (serializer (dsnd (pc x)))))
(sc32: ((x: sum_key t) -> Tot (serializer32 (sc x))))
(destr: dep_enum_destr (sum_enum t) (serialize32_sum_cases_t t sc))
: Tot (serializer32 (serialize_sum t s sc))
= fun x #rrel #rel b pos ->
serialize_sum_eq t s sc x;
let tg = sum_tag_of_data t x in
serialize32_nondep_then_aux s32 (serialize32_sum_cases t sc sc32 destr tg) tg x b pos
let clens_sum_tag
(s: sum)
: Tot (clens (sum_type s) (sum_key s))
= {
clens_cond = (fun _ -> True);
clens_get = sum_tag_of_data s;
}
let gaccessor_sum_tag
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
: Tot (gaccessor (parse_sum t p pc) (parse_enum_key p (sum_enum t)) (clens_sum_tag t))
= gaccessor_tagged_union_tag
(parse_enum_key p (sum_enum t))
(sum_tag_of_data t)
(parse_sum_cases t pc)
inline_for_extraction
let accessor_sum_tag
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
: Tot (accessor (gaccessor_sum_tag t p pc))
= accessor_tagged_union_tag
(parse_enum_key p (sum_enum t))
(sum_tag_of_data t)
(parse_sum_cases t pc)
let clens_sum_payload
(s: sum)
(k: sum_key s)
: Tot (clens (sum_type s) (sum_type_of_tag s k))
= {
clens_cond = (fun (x: sum_type s) -> sum_tag_of_data s x == k);
clens_get = (fun (x: sum_type s) -> synth_sum_case_recip s k x <: Ghost (sum_type_of_tag s k) (requires (sum_tag_of_data s x == k)) (ensures (fun _ -> True)));
}
#push-options "--z3rlimit 32"
let gaccessor_clens_sum_payload'
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (gaccessor' (parse_sum t p pc) (dsnd (pc k)) (clens_sum_payload t k))
= fun (input: bytes) ->
parse_sum_eq'' t p pc input;
let res =
match parse p input with
| Some (_, consumed) ->
synth_sum_case_inverse t k;
synth_sum_case_injective t k;
synth_injective_synth_inverse_synth_inverse_recip (synth_sum_case t k) (synth_sum_case_recip t k) ();
(consumed)
| _ -> 0 // dummy
in
(res <: (res: _ { gaccessor_post' (parse_sum t p pc) (dsnd (pc k)) (clens_sum_payload t k) input res } ))
#push-options "--z3rlimit 64"
let gaccessor_clens_sum_payload_injective
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
(sl sl' : bytes)
: Lemma
(requires (
gaccessor_pre (parse_sum t p pc) (dsnd (pc k)) (clens_sum_payload t k) sl /\
gaccessor_pre (parse_sum t p pc) (dsnd (pc k)) (clens_sum_payload t k) sl' /\
injective_precond (parse_sum t p pc) sl sl'
))
(ensures (gaccessor_clens_sum_payload' t p pc k sl == gaccessor_clens_sum_payload' t p pc k sl'))
= parse_sum_eq'' t p pc sl;
parse_sum_eq'' t p pc sl' ;
parse_injective (parse_sum t p pc) sl sl' ;
parse_injective p sl sl'
#pop-options
let gaccessor_clens_sum_payload_no_lookahead
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
(sl sl' : bytes)
: Lemma
(requires (
(parse_sum_kind kt t pc).parser_kind_subkind == Some ParserStrong /\
gaccessor_pre (parse_sum t p pc) (dsnd (pc k)) (clens_sum_payload t k) sl /\
gaccessor_pre (parse_sum t p pc) (dsnd (pc k)) (clens_sum_payload t k) sl' /\
no_lookahead_on_precond (parse_sum t p pc) sl sl'
))
(ensures (gaccessor_clens_sum_payload' t p pc k sl == gaccessor_clens_sum_payload' t p pc k sl'))
= parse_sum_eq'' t p pc sl;
parse_sum_eq'' t p pc sl' ;
parse_strong_prefix (parse_sum t p pc) sl sl' ;
parse_injective p sl sl'
let gaccessor_clens_sum_payload
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (gaccessor (parse_sum t p pc) (dsnd (pc k)) (clens_sum_payload t k))
= Classical.forall_intro_2 (fun x -> Classical.move_requires (gaccessor_clens_sum_payload_injective t p pc k x));
Classical.forall_intro_2 (fun x -> Classical.move_requires (gaccessor_clens_sum_payload_no_lookahead t p pc k x));
gaccessor_prop_equiv (parse_sum t p pc) (dsnd (pc k)) (clens_sum_payload t k) (gaccessor_clens_sum_payload' t p pc k);
gaccessor_clens_sum_payload' t p pc k
inline_for_extraction
let accessor_clens_sum_payload'
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(j: jumper p)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: HST.Stack U32.t
(requires (fun h ->
valid (parse_sum t p pc) h input pos /\
(clens_sum_payload t k).clens_cond (contents (parse_sum t p pc) h input pos)
))
(ensures (fun h pos' h' ->
B.modifies B.loc_none h h' /\
pos' == slice_access h (gaccessor_clens_sum_payload t p pc k) input pos
))
=
let h = HST.get () in
[@inline_let]
let _ =
let pos' = get_valid_pos (parse_sum t p pc) h input pos in
let large = bytes_of_slice_from h input pos in
slice_access_eq h (gaccessor_clens_sum_payload t p pc k) input pos;
valid_facts (parse_sum t p pc) h input pos;
parse_sum_eq'' t p pc large;
valid_facts p h input pos
in
j input pos
#pop-options
inline_for_extraction
let accessor_clens_sum_payload
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(j: jumper p)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (accessor (gaccessor_clens_sum_payload t p pc k))
= fun #rrel #rel -> accessor_clens_sum_payload' t j pc k #rrel #rel
let clens_sum_cases_payload
(s: sum)
(k: sum_key s)
: Tot (clens (sum_cases s k) (sum_type_of_tag s k))
= {
clens_cond = (fun (x: sum_cases s k) -> True);
clens_get = (fun (x: sum_cases s k) -> synth_sum_case_recip s k x <: Ghost (sum_type_of_tag s k) (requires (True)) (ensures (fun _ -> True)));
}
let gaccessor_clens_sum_cases_payload
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (gaccessor (parse_sum_cases' t pc k) (dsnd (pc k)) (clens_sum_cases_payload t k))
= synth_sum_case_injective t k;
synth_sum_case_inverse t k;
synth_injective_synth_inverse_synth_inverse_recip (synth_sum_case t k) (synth_sum_case_recip t k) ();
gaccessor_ext
(gaccessor_synth (dsnd (pc k)) (synth_sum_case t k) (synth_sum_case_recip t k) ())
(clens_sum_cases_payload t k)
()
inline_for_extraction
let accessor_clens_sum_cases_payload
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (accessor (gaccessor_clens_sum_cases_payload t pc k))
= [@inline_let]
let _ =
synth_sum_case_injective t k;
synth_sum_case_inverse t k;
synth_injective_synth_inverse_synth_inverse_recip (synth_sum_case t k) (synth_sum_case_recip t k) ()
in
accessor_ext
(accessor_synth (dsnd (pc k)) (synth_sum_case t k) (synth_sum_case_recip t k) ())
(clens_sum_cases_payload t k)
()
inline_for_extraction
let validate_dsum_cases_t
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(#k: parser_kind)
(g: parser k (dsum_type_of_unknown_tag s))
(x: dsum_key s)
: Tot Type
= validator (parse_dsum_cases' s f g x)
let validate_dsum_cases_eq
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(#k: parser_kind)
(g: parser k (dsum_type_of_unknown_tag s))
(x: dsum_key s)
(v1 v2 : validate_dsum_cases_t s f g x)
: GTot Type0
= True
inline_for_extraction
let validate_dsum_cases_if'
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(#k: parser_kind)
(g: parser k (dsum_type_of_unknown_tag s))
(x: dsum_key s)
(cond: bool)
(ift: (cond_true cond -> Tot (validate_dsum_cases_t s f g x)))
(iff: (cond_false cond -> Tot (validate_dsum_cases_t s f g x)))
: Tot (validate_dsum_cases_t s f g x)
= fun #rrel #rel input len ->
if cond
then (ift () <: validate_dsum_cases_t s f g x) input len
else (iff () <: validate_dsum_cases_t s f g x) input len
inline_for_extraction
let validate_dsum_cases_if
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(#k: parser_kind)
(g: parser k (dsum_type_of_unknown_tag s))
(x: dsum_key s)
: Tot (if_combinator _ (validate_dsum_cases_eq s f g x))
= validate_dsum_cases_if' s f g x
inline_for_extraction
let validate_dsum_cases'
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(f' : (x: dsum_known_key s) -> Tot (validator (dsnd (f x))))
(#k: parser_kind)
(#g: parser k (dsum_type_of_unknown_tag s))
(g' : validator g)
(x: dsum_key s)
: Tot (validate_dsum_cases_t s f g x)
= [@inline_let]
let _ = synth_dsum_case_injective s x in
match x with
| Known x' -> validate_synth (f' x') (synth_dsum_case s (Known x')) () <: validator (parse_dsum_cases' s f g x)
| Unknown x' -> validate_synth g' (synth_dsum_case s (Unknown x')) () <: validator (parse_dsum_cases' s f g x)
inline_for_extraction
let validate_dsum_cases'_destr
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(f' : (x: dsum_known_key s) -> Tot (validator (dsnd (f x))))
(#k: parser_kind)
(#g: parser k (dsum_type_of_unknown_tag s))
(g' : validator g)
(destr: dep_enum_destr _ (fun k -> validate_dsum_cases_t s f g (Known k)))
(x: dsum_key s)
: Tot (validate_dsum_cases_t s f g x)
= fun #rrel #rel input pos ->
match x with
| Known k ->
destr
_
(fun k -> validate_dsum_cases_if s f g (Known k))
(fun _ _ -> ())
(fun _ _ _ _ -> ())
(fun k -> validate_dsum_cases' s f f' g' (Known k))
k
input
pos
| Unknown r -> validate_dsum_cases' s f f' g' (Unknown r) input pos
inline_for_extraction
let validate_dsum_cases
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(f' : (x: dsum_known_key s) -> Tot (validator (dsnd (f x))))
(#k: parser_kind)
(#g: parser k (dsum_type_of_unknown_tag s))
(g' : validator g)
(destr: dep_enum_destr _ (fun k -> validate_dsum_cases_t s f g (Known k)))
(x: dsum_key s)
: Tot (validator (parse_dsum_cases s f g x))
= fun #rrel #rel input pos ->
let h = HST.get () in
[@inline_let]
let _ =
valid_facts (parse_dsum_cases' s f g x) h input (uint64_to_uint32 pos);
valid_facts (parse_dsum_cases s f g x) h input (uint64_to_uint32 pos);
parse_dsum_cases_eq' s f g x (bytes_of_slice_from h input (uint64_to_uint32 pos))
in
validate_dsum_cases'_destr s f f' g' destr x input pos
#push-options "--z3rlimit 40"
inline_for_extraction
let validate_dsum
(#kt: parser_kind)
(t: dsum)
(#p: parser kt (dsum_repr_type t))
(v: validator p)
(p32: leaf_reader p)
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(f32: (x: dsum_known_key t) -> Tot (validator (dsnd (f x))))
(#k': parser_kind)
(#g: parser k' (dsum_type_of_unknown_tag t))
(g32: validator g)
(destr: dep_maybe_enum_destr_t (dsum_enum t) (validate_dsum_cases_t t f g))
: Tot (validator (parse_dsum t p f g))
= fun #rrel #rel input pos ->
let h = HST.get () in
[@inline_let]
let _ = parse_dsum_eq' t p f g (bytes_of_slice_from h input (uint64_to_uint32 pos)) in
[@inline_let]
let _ = valid_facts (parse_dsum t p f g) h input (uint64_to_uint32 pos) in
[@inline_let]
let _ = valid_facts p h input (uint64_to_uint32 pos) in
let pos_after_tag = v input pos in
if is_error pos_after_tag
then pos_after_tag
else
let tg = p32 input (uint64_to_uint32 pos) in
[@inline_let]
let _ = valid_facts (parse_dsum_cases' t f g (maybe_enum_key_of_repr (dsum_enum t) tg)) h input (uint64_to_uint32 pos_after_tag) in
destr (validate_dsum_cases_eq t f g) (validate_dsum_cases_if t f g) (fun _ _ -> ()) (fun _ _ _ _ -> ()) (validate_dsum_cases' t f f32 g32) tg input pos_after_tag
#pop-options
#reset-options "--z3rlimit 64 --z3cliopt smt.arith.nl=false --initial_ifuel 8 --max_ifuel 8 --initial_fuel 2 --max_fuel 2"
let valid_dsum_intro_known
(h: HS.mem)
(t: dsum)
(#kt: parser_kind)
(p: parser kt (dsum_repr_type t))
(f: ((x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x))))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: Lemma
(requires (
valid (parse_maybe_enum_key p (dsum_enum t)) h input pos /\ (
let k' = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
Known? k' /\ (
let Known k = k' in
valid (dsnd (f k)) h input (get_valid_pos (parse_maybe_enum_key p (dsum_enum t)) h input pos)
))))
(ensures (
let Known k = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
let pos_payload = get_valid_pos (parse_maybe_enum_key p (dsum_enum t)) h input pos in
valid_content_pos
(parse_dsum t p f g) h input pos
(synth_dsum_case t (Known k) (contents (dsnd (f k)) h input pos_payload))
(get_valid_pos (dsnd (f k)) h input pos_payload)
))
= valid_facts (parse_maybe_enum_key p (dsum_enum t)) h input pos;
let Known k = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
let pos_payload = get_valid_pos (parse_maybe_enum_key p (dsum_enum t)) h input pos in
valid_facts (dsnd (f k)) h input pos_payload;
valid_facts (parse_dsum t p f g) h input pos;
parse_dsum_eq t p f g (bytes_of_slice_from h input pos)
let valid_dsum_intro_unknown
(h: HS.mem)
(t: dsum)
(#kt: parser_kind)
(p: parser kt (dsum_repr_type t))
(f: ((x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x))))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: Lemma
(requires (
valid (parse_maybe_enum_key p (dsum_enum t)) h input pos /\ (
let k' = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
Unknown? k' /\
valid g h input (get_valid_pos (parse_maybe_enum_key p (dsum_enum t)) h input pos)
)))
(ensures (
let Unknown r = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
let pos_payload = get_valid_pos (parse_maybe_enum_key p (dsum_enum t)) h input pos in
valid_content_pos
(parse_dsum t p f g) h input pos
(synth_dsum_case t (Unknown r) (contents g h input pos_payload))
(get_valid_pos g h input pos_payload)
))
= valid_facts (parse_maybe_enum_key p (dsum_enum t)) h input pos;
let Unknown r = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
let pos_payload = get_valid_pos (parse_maybe_enum_key p (dsum_enum t)) h input pos in
valid_facts g h input pos_payload;
valid_facts (parse_dsum t p f g) h input pos;
parse_dsum_eq t p f g (bytes_of_slice_from h input pos)
#reset-options
inline_for_extraction
let finalize_dsum_case_known
(t: dsum)
(#kt: parser_kind)
(#p: parser kt (dsum_repr_type t))
(s: serializer p)
(w: leaf_writer_strong s)
(f: ((x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x))))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
(destr: enum_repr_of_key'_t (dsum_enum t))
(k: dsum_known_key t)
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: HST.Stack unit
(requires (fun h ->
let len_tag = serialized_length (serialize_enum_key _ s (dsum_enum t)) k in
U32.v pos + len_tag < 4294967296 /\ (
let pos_payload = pos `U32.add` U32.uint_to_t len_tag in
valid (dsnd (f k)) h input pos_payload /\
writable input.base (U32.v pos) (U32.v pos_payload) h
)))
(ensures (fun h _ h' ->
let len_tag = serialized_length (serialize_enum_key _ s (dsum_enum t)) k in
let pos_payload = pos `U32.add` U32.uint_to_t len_tag in
B.modifies (loc_slice_from_to input pos pos_payload) h h' /\
valid_content_pos (parse_dsum t p f g) h' input pos (synth_dsum_case t (Known k) (contents (dsnd (f k)) h input pos_payload)) (get_valid_pos (dsnd (f k)) h input pos_payload)
))
= let pos1 = write_enum_key w (dsum_enum t) destr k input pos in
let h = HST.get () in
[@inline_let]
let _ =
valid_facts (parse_enum_key p (dsum_enum t)) h input pos;
valid_facts (parse_maybe_enum_key p (dsum_enum t)) h input pos;
let sq = bytes_of_slice_from h input pos in
parse_enum_key_eq p (dsum_enum t) sq;
parse_maybe_enum_key_eq p (dsum_enum t) sq;
valid_dsum_intro_known h t p f g input pos
in
()
inline_for_extraction
let finalize_dsum_case_unknown
(t: dsum)
(#kt: parser_kind)
(#p: parser kt (dsum_repr_type t))
(s: serializer p)
(w: leaf_writer_strong s)
(f: ((x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x))))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
(r: unknown_enum_repr (dsum_enum t))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: HST.Stack unit
(requires (fun h ->
let len_tag = serialized_length s r in
U32.v pos + len_tag < 4294967296 /\ (
let pos_payload = pos `U32.add` U32.uint_to_t len_tag in
valid g h input pos_payload /\
writable input.base (U32.v pos) (U32.v pos_payload) h
)))
(ensures (fun h _ h' ->
let len_tag = serialized_length s r in
let pos_payload = pos `U32.add` U32.uint_to_t len_tag in
B.modifies (loc_slice_from_to input pos pos_payload) h h' /\
valid_content_pos (parse_dsum t p f g) h' input pos (synth_dsum_case t (Unknown r) (contents g h input pos_payload)) (get_valid_pos g h input pos_payload)
))
= let pos1 = w r input pos in
let h = HST.get () in
[@inline_let]
let _ =
valid_facts (parse_maybe_enum_key p (dsum_enum t)) h input pos;
valid_facts p h input pos;
let sq = bytes_of_slice_from h input pos in
parse_maybe_enum_key_eq p (dsum_enum t) sq;
valid_dsum_intro_unknown h t p f g input pos
in
() | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"LowStar.Buffer.fst.checked",
"LowParse.Spec.Sum.fst.checked",
"LowParse.Low.Enum.fst.checked",
"FStar.UInt64.fsti.checked",
"FStar.UInt32.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Int.Cast.fst.checked",
"FStar.HyperStack.ST.fsti.checked",
"FStar.HyperStack.fst.checked",
"FStar.Classical.fsti.checked"
],
"interface_file": false,
"source_file": "LowParse.Low.Sum.fst"
} | [
{
"abbrev": true,
"full_module": "FStar.HyperStack",
"short_module": "HS"
},
{
"abbrev": true,
"full_module": "FStar.UInt64",
"short_module": "U64"
},
{
"abbrev": true,
"full_module": "FStar.Int.Cast",
"short_module": "Cast"
},
{
"abbrev": true,
"full_module": "LowStar.Buffer",
"short_module": "B"
},
{
"abbrev": true,
"full_module": "FStar.HyperStack.ST",
"short_module": "HST"
},
{
"abbrev": true,
"full_module": "FStar.UInt32",
"short_module": "U32"
},
{
"abbrev": false,
"full_module": "LowParse.Spec.Sum",
"short_module": null
},
{
"abbrev": false,
"full_module": "LowParse.Low.Enum",
"short_module": null
},
{
"abbrev": false,
"full_module": "LowParse.Low",
"short_module": null
},
{
"abbrev": false,
"full_module": "LowParse.Low",
"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",
"short_module": null
}
] | {
"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_elim_box": false,
"smtencoding_l_arith_repr": "boxwrap",
"smtencoding_nl_arith_repr": "boxwrap",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": true,
"z3cliopt": [],
"z3refresh": false,
"z3rlimit": 5,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | false |
h: FStar.Monotonic.HyperStack.mem ->
t: LowParse.Spec.Sum.dsum ->
p: LowParse.Spec.Base.parser kt (LowParse.Spec.Sum.dsum_repr_type t) ->
f:
(x: LowParse.Spec.Sum.dsum_known_key t
-> Prims.dtuple2 LowParse.Spec.Base.parser_kind
(fun k -> LowParse.Spec.Base.parser k (LowParse.Spec.Sum.dsum_type_of_known_tag t x))) ->
g: LowParse.Spec.Base.parser ku (LowParse.Spec.Sum.dsum_type_of_unknown_tag t) ->
input: LowParse.Slice.slice rrel rel ->
pos: FStar.UInt32.t
-> FStar.Pervasives.Lemma
(requires LowParse.Low.Base.Spec.valid (LowParse.Spec.Sum.parse_dsum t p f g) h input pos)
(ensures
LowParse.Low.Base.Spec.valid (LowParse.Spec.Enum.parse_maybe_enum_key p
(LowParse.Spec.Sum.dsum_enum t))
h
input
pos /\
LowParse.Low.Base.Spec.contents (LowParse.Spec.Enum.parse_maybe_enum_key p
(LowParse.Spec.Sum.dsum_enum t))
h
input
pos ==
LowParse.Spec.Sum.dsum_tag_of_data t
(LowParse.Low.Base.Spec.contents (LowParse.Spec.Sum.parse_dsum t p f g) h input pos)) | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"FStar.Monotonic.HyperStack.mem",
"LowParse.Spec.Sum.dsum",
"LowParse.Spec.Base.parser_kind",
"LowParse.Spec.Base.parser",
"LowParse.Spec.Sum.dsum_repr_type",
"LowParse.Spec.Sum.dsum_known_key",
"Prims.dtuple2",
"LowParse.Spec.Sum.dsum_type_of_known_tag",
"LowParse.Spec.Sum.dsum_type_of_unknown_tag",
"LowParse.Slice.srel",
"LowParse.Bytes.byte",
"LowParse.Slice.slice",
"FStar.UInt32.t",
"Prims.unit",
"LowParse.Low.Base.Spec.valid_facts",
"LowParse.Spec.Enum.maybe_enum_key",
"LowParse.Spec.Sum.dsum_key_type",
"LowParse.Spec.Sum.dsum_enum",
"LowParse.Spec.Enum.parse_maybe_enum_key",
"LowParse.Spec.Sum.parse_dsum_kind",
"LowParse.Spec.Sum.dsum_type",
"LowParse.Spec.Sum.parse_dsum",
"LowParse.Spec.Sum.parse_dsum_eq_",
"LowParse.Slice.bytes_of_slice_from",
"LowParse.Low.Base.Spec.valid",
"Prims.squash",
"Prims.l_and",
"Prims.eq2",
"LowParse.Low.Base.Spec.contents",
"LowParse.Spec.Sum.dsum_tag_of_data",
"Prims.Nil",
"FStar.Pervasives.pattern"
] | [] | true | false | true | false | false | let valid_dsum_elim_tag
(h: HS.mem)
(t: dsum)
(#kt: parser_kind)
(p: parser kt (dsum_repr_type t))
(f: (x: dsum_known_key t -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x))))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: Lemma (requires (valid (parse_dsum t p f g) h input pos))
(ensures
(valid (parse_maybe_enum_key p (dsum_enum t)) h input pos /\
contents (parse_maybe_enum_key p (dsum_enum t)) h input pos ==
dsum_tag_of_data t (contents (parse_dsum t p f g) h input pos))) =
| let _ = parse_dsum_eq_ t p f g (bytes_of_slice_from h input pos) in
let _ = valid_facts (parse_dsum t p f g) h input pos in
let _ = valid_facts (parse_maybe_enum_key p (dsum_enum t)) h input pos in
() | false |
LowParse.Low.Sum.fst | LowParse.Low.Sum.validate_dsum | val validate_dsum
(#kt: parser_kind)
(t: dsum)
(#p: parser kt (dsum_repr_type t))
(v: validator p)
(p32: leaf_reader p)
(f: (x: dsum_known_key t -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x))))
(f32: (x: dsum_known_key t -> Tot (validator (dsnd (f x)))))
(#k': parser_kind)
(#g: parser k' (dsum_type_of_unknown_tag t))
(g32: validator g)
(destr: dep_maybe_enum_destr_t (dsum_enum t) (validate_dsum_cases_t t f g))
: Tot (validator (parse_dsum t p f g)) | val validate_dsum
(#kt: parser_kind)
(t: dsum)
(#p: parser kt (dsum_repr_type t))
(v: validator p)
(p32: leaf_reader p)
(f: (x: dsum_known_key t -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x))))
(f32: (x: dsum_known_key t -> Tot (validator (dsnd (f x)))))
(#k': parser_kind)
(#g: parser k' (dsum_type_of_unknown_tag t))
(g32: validator g)
(destr: dep_maybe_enum_destr_t (dsum_enum t) (validate_dsum_cases_t t f g))
: Tot (validator (parse_dsum t p f g)) | let validate_dsum
(#kt: parser_kind)
(t: dsum)
(#p: parser kt (dsum_repr_type t))
(v: validator p)
(p32: leaf_reader p)
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(f32: (x: dsum_known_key t) -> Tot (validator (dsnd (f x))))
(#k': parser_kind)
(#g: parser k' (dsum_type_of_unknown_tag t))
(g32: validator g)
(destr: dep_maybe_enum_destr_t (dsum_enum t) (validate_dsum_cases_t t f g))
: Tot (validator (parse_dsum t p f g))
= fun #rrel #rel input pos ->
let h = HST.get () in
[@inline_let]
let _ = parse_dsum_eq' t p f g (bytes_of_slice_from h input (uint64_to_uint32 pos)) in
[@inline_let]
let _ = valid_facts (parse_dsum t p f g) h input (uint64_to_uint32 pos) in
[@inline_let]
let _ = valid_facts p h input (uint64_to_uint32 pos) in
let pos_after_tag = v input pos in
if is_error pos_after_tag
then pos_after_tag
else
let tg = p32 input (uint64_to_uint32 pos) in
[@inline_let]
let _ = valid_facts (parse_dsum_cases' t f g (maybe_enum_key_of_repr (dsum_enum t) tg)) h input (uint64_to_uint32 pos_after_tag) in
destr (validate_dsum_cases_eq t f g) (validate_dsum_cases_if t f g) (fun _ _ -> ()) (fun _ _ _ _ -> ()) (validate_dsum_cases' t f f32 g32) tg input pos_after_tag | {
"file_name": "src/lowparse/LowParse.Low.Sum.fst",
"git_rev": "00217c4a89f5ba56002ba9aa5b4a9d5903bfe9fa",
"git_url": "https://github.com/project-everest/everparse.git",
"project_name": "everparse"
} | {
"end_col": 165,
"end_line": 1094,
"start_col": 0,
"start_line": 1066
} | module LowParse.Low.Sum
include LowParse.Low.Enum
include LowParse.Spec.Sum
module U32 = FStar.UInt32
module HST = FStar.HyperStack.ST
module B = LowStar.Buffer
module Cast = FStar.Int.Cast
module U64 = FStar.UInt64
inline_for_extraction
let validate_sum_cases_aux
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(vc: ((x: sum_key t) -> Tot (validator (dsnd (pc x)))))
(k: sum_key t)
: Tot (validator (parse_sum_cases t pc k))
= [@inline_let]
let _ = synth_sum_case_injective t k in
validate_synth
(validate_weaken
(weaken_parse_cases_kind t pc)
(vc k)
()
)
(synth_sum_case t k)
()
inline_for_extraction
let validate_sum_cases_t
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot Type
= validator (parse_sum_cases t pc k)
let validate_sum_cases_t_eq
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
(x y : validate_sum_cases_t t pc k)
: GTot Type0
= True
inline_for_extraction
let validate_sum_cases_t_if
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (if_combinator _ (validate_sum_cases_t_eq t pc k))
= fun cond (sv_true: cond_true cond -> Tot (validate_sum_cases_t t pc k)) (sv_false: cond_false cond -> Tot (validate_sum_cases_t t pc k)) #rrel #rel input pos ->
if cond
then sv_true () input pos
else sv_false () input pos
inline_for_extraction
let validate_sum_cases
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(vc: ((x: sum_key t) -> Tot (validator (dsnd (pc x)))))
(destr: dep_enum_destr (sum_enum t) (validate_sum_cases_t t pc))
(k: sum_key t)
: Tot (validator (parse_sum_cases t pc k))
= destr
_
(validate_sum_cases_t_if t pc)
(fun _ _ -> ())
(fun _ _ _ _ -> ())
(validate_sum_cases_aux t pc vc)
k
inline_for_extraction
let validate_sum_aux_payload_t
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
: Tot Type
= (#rrel: _) -> (#rel: _) ->
(input: slice rrel rel) ->
(pos: U64.t) ->
HST.Stack U64.t
(requires (fun h -> live_slice h input /\ U64.v pos <= U32.v input.len))
(ensures (fun h res h' ->
B.modifies B.loc_none h h' /\ (
match k with
| Unknown _ -> is_error res
| Known k' ->
if is_success res
then
valid_pos (dsnd (pc k')) h input (uint64_to_uint32 pos) (uint64_to_uint32 res)
else
(~ (valid (dsnd (pc k')) h input (uint64_to_uint32 pos)))
)))
let validate_sum_aux_payload_eq
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
: Tot (validate_sum_aux_payload_t t pc k -> validate_sum_aux_payload_t t pc k -> GTot Type0)
= fun _ _ -> True
inline_for_extraction
let validate_sum_aux_payload_if'
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
(cond: bool)
(ift: ((cond_true cond) -> Tot (validate_sum_aux_payload_t t pc k)))
(iff: ((cond_false cond) -> Tot (validate_sum_aux_payload_t t pc k)))
: Tot (validate_sum_aux_payload_t t pc k)
= fun #rrel #rel input pos ->
if cond
then begin
(ift () <: validate_sum_aux_payload_t t pc k) input pos
end else
(iff () <: validate_sum_aux_payload_t t pc k) input pos
inline_for_extraction
let validate_sum_aux_payload_if
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
: Tot (if_combinator _ (validate_sum_aux_payload_eq t pc k))
= validate_sum_aux_payload_if' t pc k
#push-options "--z3rlimit 64 --z3cliopt smt.arith.nl=false --using_facts_from '* -FStar.Int.Cast -LowParse.BitFields'"
// --query_stats --smtencoding.elim_box true --smtencoding.l_arith_repr native --z3refresh"
inline_for_extraction
let validate_sum_aux
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(v: validator p)
(p32: leaf_reader p)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(v_payload: ((k: sum_repr_type t)) -> Tot (validate_sum_aux_payload_t t pc (maybe_enum_key_of_repr (sum_enum t) k)))
: Tot (validator (parse_sum t p pc))
= fun #rrel #rel input pos ->
let h = HST.get () in
[@inline_let]
let _ = parse_sum_eq'' t p pc (bytes_of_slice_from h input (uint64_to_uint32 pos)) in
[@inline_let]
let _ = valid_facts (parse_sum t p pc) h input (uint64_to_uint32 pos) in
[@inline_let]
let _ = valid_facts p h input (uint64_to_uint32 pos) in
let len_after_tag = v input pos in
if is_error len_after_tag
then len_after_tag
else begin
let h1 = HST.get () in
let k' = p32 input (uint64_to_uint32 pos) in
[@inline_let]
let _ =
match maybe_enum_key_of_repr (sum_enum t) k' with
| Known k -> valid_facts (dsnd (pc k)) h input (uint64_to_uint32 len_after_tag)
| _ -> ()
in
v_payload k' input len_after_tag
end
#pop-options
inline_for_extraction
let validate_sum_aux_payload'
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (validator (dsnd (pc x)))))
(k: maybe_enum_key (sum_enum t))
: Tot (validate_sum_aux_payload_t t pc k)
= fun #rrel #rel input pos ->
match k with
| Known k ->
[@inline_let]
let _ = synth_sum_case_injective t k in
pc32 k input pos
// validate_synth (pc32 k) (synth_sum_case t k) () input pos
| _ -> validator_error_generic
inline_for_extraction
let validate_sum_aux_payload
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (validator (dsnd (pc x)))))
(destr: dep_maybe_enum_destr_t (sum_enum t) (validate_sum_aux_payload_t t pc))
(k: sum_repr_type t)
: Tot (validate_sum_aux_payload_t t pc (maybe_enum_key_of_repr (sum_enum t) k))
= destr (validate_sum_aux_payload_eq t pc) (validate_sum_aux_payload_if t pc) (fun _ _ -> ()) (fun _ _ _ _ -> ()) (validate_sum_aux_payload' t pc pc32) k
inline_for_extraction
let validate_sum
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(v: validator p)
(p32: leaf_reader p)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (validator (dsnd (pc x)))))
(destr: dep_maybe_enum_destr_t (sum_enum t) (validate_sum_aux_payload_t t pc))
: Tot (validator (parse_sum t p pc))
= validate_sum_aux t v p32 pc (validate_sum_aux_payload t pc pc32 destr)
module HS = FStar.HyperStack
#push-options "--z3rlimit 256 --z3cliopt smt.arith.nl=false --initial_ifuel 8 --max_ifuel 8 --initial_fuel 2 --max_fuel 2"
#restart-solver
let valid_sum_intro
(h: HS.mem)
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: Lemma
(requires (
valid (parse_enum_key p (sum_enum t)) h input pos /\ (
let k = contents (parse_enum_key p (sum_enum t)) h input pos in
valid (dsnd (pc k)) h input (get_valid_pos (parse_enum_key p (sum_enum t)) h input pos)
)))
(ensures (
let k = contents (parse_enum_key p (sum_enum t)) h input pos in
let pos_payload = get_valid_pos (parse_enum_key p (sum_enum t)) h input pos in
valid_content_pos
(parse_sum t p pc) h input pos
(synth_sum_case t k (contents (dsnd (pc k)) h input pos_payload))
(get_valid_pos (dsnd (pc k)) h input pos_payload)
))
= valid_facts (parse_enum_key p (sum_enum t)) h input pos;
let k = contents (parse_enum_key p (sum_enum t)) h input pos in
let pos_payload = get_valid_pos (parse_enum_key p (sum_enum t)) h input pos in
valid_facts (dsnd (pc k)) h input pos_payload;
valid_facts (parse_sum t p pc) h input pos;
parse_sum_eq t p pc (bytes_of_slice_from h input pos)
#pop-options
inline_for_extraction
let finalize_sum_case
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(s: serializer p)
(w: leaf_writer_strong s)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(destr: enum_repr_of_key'_t (sum_enum t))
(k: sum_key t)
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: HST.Stack unit
(requires (fun h ->
let len_tag = serialized_length (serialize_enum_key _ s (sum_enum t)) k in
U32.v pos + len_tag < 4294967296 /\ (
let pos_payload = pos `U32.add` U32.uint_to_t len_tag in
valid (dsnd (pc k)) h input pos_payload /\
writable input.base (U32.v pos) (U32.v pos_payload) h
)))
(ensures (fun h _ h' ->
let len_tag = serialized_length (serialize_enum_key _ s (sum_enum t)) k in
let pos_payload = pos `U32.add` U32.uint_to_t len_tag in
B.modifies (loc_slice_from_to input pos pos_payload) h h' /\
valid_content_pos (parse_sum t p pc) h' input pos (synth_sum_case t k (contents (dsnd (pc k)) h input pos_payload)) (get_valid_pos (dsnd (pc k)) h input pos_payload)
))
= let pos1 = write_enum_key w (sum_enum t) destr k input pos in
let h = HST.get () in
[@inline_let]
let _ = valid_sum_intro h t p pc input pos in
()
inline_for_extraction
let jump_sum_cases_aux
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(vc: ((x: sum_key t) -> Tot (jumper (dsnd (pc x)))))
(k: sum_key t)
: Tot (jumper (parse_sum_cases t pc k))
= [@inline_let]
let _ = synth_sum_case_injective t k in
jump_synth
(jump_weaken
(weaken_parse_cases_kind t pc)
(vc k)
()
)
(synth_sum_case t k)
()
inline_for_extraction
let jump_sum_cases_t
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot Type
= jumper (parse_sum_cases t pc k)
let jump_sum_cases_t_eq
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
(x y : jump_sum_cases_t t pc k)
: GTot Type0
= True
inline_for_extraction
let jump_sum_cases_t_if
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (if_combinator _ (jump_sum_cases_t_eq t pc k))
= fun cond (sv_true: cond_true cond -> Tot (jump_sum_cases_t t pc k)) (sv_false: cond_false cond -> Tot (jump_sum_cases_t t pc k)) #rrel #rel input pos ->
if cond
then sv_true () input pos
else sv_false () input pos
inline_for_extraction
let jump_sum_cases
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(vc: ((x: sum_key t) -> Tot (jumper (dsnd (pc x)))))
(destr: dep_enum_destr (sum_enum t) (jump_sum_cases_t t pc))
(k: sum_key t)
: Tot (jumper (parse_sum_cases t pc k))
= destr
_
(jump_sum_cases_t_if t pc)
(fun _ _ -> ())
(fun _ _ _ _ -> ())
(jump_sum_cases_aux t pc vc)
k
inline_for_extraction
let jump_sum_aux_payload_t
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
: Tot Type
= (#rrel: _) -> (#rel: _) ->
(input: slice rrel rel) ->
(pos: U32.t) ->
HST.Stack U32.t
(requires (fun h -> live_slice h input /\ U32.v pos <= U32.v input.len /\ (
match k with
| Unknown _ -> False
| Known k' -> valid (dsnd (pc k')) h input pos
)))
(ensures (fun h res h' ->
B.modifies B.loc_none h h' /\ (
match k with
| Unknown _ -> False
| Known k' ->
valid_pos (dsnd (pc k')) h input pos res
)))
let jump_sum_aux_payload_eq
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
: Tot (jump_sum_aux_payload_t t pc k -> jump_sum_aux_payload_t t pc k -> GTot Type0)
= fun _ _ -> True
inline_for_extraction
let jump_sum_aux_payload_if'
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
(cond: bool)
(ift: ((cond_true cond) -> Tot (jump_sum_aux_payload_t t pc k)))
(iff: ((cond_false cond) -> Tot (jump_sum_aux_payload_t t pc k)))
: Tot (jump_sum_aux_payload_t t pc k)
= fun #rrel #rel input pos ->
if cond
then begin
(ift () <: jump_sum_aux_payload_t t pc k) input pos
end else
(iff () <: jump_sum_aux_payload_t t pc k) input pos
inline_for_extraction
let jump_sum_aux_payload_if
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
: Tot (if_combinator _ (jump_sum_aux_payload_eq t pc k))
= jump_sum_aux_payload_if' t pc k
let parse_sum_eq3
(#kt: parser_kind)
(t: sum)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(input: bytes)
(k' : sum_repr_type t)
(consumed_k: consumed_length input)
: Lemma
(requires (Some? (parse (parse_sum t p pc) input) /\ parse p input == Some (k', consumed_k)))
(ensures (
let input_k = Seq.slice input consumed_k (Seq.length input) in
let k = maybe_enum_key_of_repr (sum_enum t) k' in
begin match k with
| Known k ->
Some? (parse (dsnd (pc k)) input_k)
| _ -> False
end
))
= parse_sum_eq'' t p pc input
let parse_sum_eq4
(#kt: parser_kind)
(t: sum)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(input: bytes)
(k' : sum_repr_type t)
(consumed_k: consumed_length input)
(consumed_payload: nat)
: Lemma
(requires (Some? (parse (parse_sum t p pc) input) /\ parse p input == Some (k', consumed_k) /\ (
let input_k = Seq.slice input consumed_k (Seq.length input) in
let k = maybe_enum_key_of_repr (sum_enum t) k' in
begin match k with
| Known k ->
Some? (parse (dsnd (pc k)) input_k) /\ (
let Some (_, consumed_payload') = parse (dsnd (pc k)) input_k in
consumed_payload' == consumed_payload
)
| _ -> False
end
)))
(ensures (
let Some (_, consumed) = parse (parse_sum t p pc) input in
consumed == consumed_k + consumed_payload
))
= parse_sum_eq'' t p pc input
#push-options "--z3rlimit 16"
let valid_sum_elim
(h: HS.mem)
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(#rrel: _) (#rel: _)
(input: slice rrel rel)
(pos: U32.t)
: Lemma
(requires (
valid (parse_sum t p pc) h input pos
))
(ensures (
valid p h input pos /\ (
let pos_payload = get_valid_pos p h input pos in
let k' = maybe_enum_key_of_repr (sum_enum t) (contents p h input pos) in
match k' with
| Known k ->
k == sum_tag_of_data t (contents (parse_sum t p pc) h input pos) /\
valid (dsnd (pc k)) h input pos_payload /\
valid_pos
(parse_sum t p pc) h input pos
(get_valid_pos (dsnd (pc k)) h input pos_payload)
| _ -> False
)))
= let sinput = bytes_of_slice_from h input pos in
let _ = parse_sum_eq'' t p pc sinput in
[@inline_let]
let _ = valid_facts (parse_sum t p pc) h input pos in
let Some (k', consumed_k) = parse p sinput in
let pos_after_tag = U32.uint_to_t (U32.v pos + consumed_k) in
[@inline_let]
let _ = valid_facts p h input pos in
assert (valid_content_pos p h input pos k' pos_after_tag);
match maybe_enum_key_of_repr (sum_enum t) k' with
| Known k -> valid_facts (dsnd (pc k)) h input pos_after_tag
| _ -> ()
#pop-options
let valid_sum_elim_tag
(h: HS.mem)
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: Lemma
(requires (
valid (parse_sum t p pc) h input pos
))
(ensures (
valid (parse_enum_key p (sum_enum t)) h input pos /\
contents (parse_enum_key p (sum_enum t)) h input pos == sum_tag_of_data t (contents (parse_sum t p pc) h input pos)
))
= let _ = parse_sum_eq' t p pc (bytes_of_slice_from h input pos) in
let _ = valid_facts (parse_sum t p pc) h input pos in
let _ = valid_facts (parse_enum_key p (sum_enum t)) h input pos in
()
inline_for_extraction
let read_sum_tag
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(p32: leaf_reader p)
(destr: dep_maybe_enum_destr_t (sum_enum t) (read_enum_key_t (sum_enum t)))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: HST.Stack (sum_key t)
(requires (fun h ->
valid (parse_sum t p pc) h input pos
))
(ensures (fun h res h' ->
B.modifies B.loc_none h h' /\
res == sum_tag_of_data t (contents (parse_sum t p pc) h input pos)
))
= let h = HST.get () in
[@inline_let] let _ = valid_sum_elim_tag h t p pc input pos in
read_enum_key p32 (sum_enum t) destr input pos
inline_for_extraction
let jump_sum_aux
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(v: jumper p)
(p32: leaf_reader p)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(v_payload: ((k: sum_repr_type t)) -> Tot (jump_sum_aux_payload_t t pc (maybe_enum_key_of_repr (sum_enum t) k)))
: Tot (jumper (parse_sum t p pc))
= fun #rrel #rel input pos ->
let h = HST.get () in
[@inline_let]
let _ = valid_sum_elim h t p pc input pos in
let pos_after_tag = v input pos in
let k' = p32 input pos in
v_payload k' input pos_after_tag
inline_for_extraction
let jump_sum_aux_payload'
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (jumper (dsnd (pc x)))))
(k: maybe_enum_key (sum_enum t))
: Tot (jump_sum_aux_payload_t t pc k)
= fun #rrel #rel input pos ->
match k with
| Known k ->
[@inline_let]
let _ = synth_sum_case_injective t k in
pc32 k input pos
| _ -> 0ul // dummy, but we MUST NOT remove this branch, otherwise extraction fails
inline_for_extraction
let jump_sum_aux_payload
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (jumper (dsnd (pc x)))))
(destr: dep_maybe_enum_destr_t (sum_enum t) (jump_sum_aux_payload_t t pc))
(k: sum_repr_type t)
: Tot (jump_sum_aux_payload_t t pc (maybe_enum_key_of_repr (sum_enum t) k))
= destr (jump_sum_aux_payload_eq t pc) (jump_sum_aux_payload_if t pc) (fun _ _ -> ()) (fun _ _ _ _ -> ()) (jump_sum_aux_payload' t pc pc32) k
inline_for_extraction
let jump_sum
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(v: jumper p)
(p32: leaf_reader p)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (jumper (dsnd (pc x)))))
(destr: dep_maybe_enum_destr_t (sum_enum t) (jump_sum_aux_payload_t t pc))
: Tot (jumper (parse_sum t p pc))
= jump_sum_aux t v p32 pc (jump_sum_aux_payload t pc pc32 destr)
inline_for_extraction
let read_sum_cases'
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (leaf_reader (dsnd (pc x)))))
(k: sum_key t)
: Tot (leaf_reader (parse_sum_cases' t pc k))
= [@inline_let]
let _ = synth_sum_case_injective t k in
read_synth'
(dsnd (pc k))
(synth_sum_case t k)
(pc32 k)
()
inline_for_extraction
let read_sum_cases_t
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot Type
= leaf_reader (parse_sum_cases' t pc k)
let read_sum_cases_t_eq
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
(x y : read_sum_cases_t t pc k)
: GTot Type0
= True
inline_for_extraction
let read_sum_cases_t_if
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (if_combinator _ (read_sum_cases_t_eq t pc k))
= fun cond (sv_true: cond_true cond -> Tot (read_sum_cases_t t pc k)) (sv_false: cond_false cond -> Tot (read_sum_cases_t t pc k)) #_ #_ input pos ->
if cond
then (sv_true () input pos)
else (sv_false () input pos)
inline_for_extraction
let read_sum_cases
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (leaf_reader (dsnd (pc x)))))
(destr: dep_enum_destr (sum_enum t) (read_sum_cases_t t pc))
(k: sum_key t)
: Tot (leaf_reader (parse_sum_cases' t pc k))
= destr
_
(read_sum_cases_t_if t pc)
(fun _ _ -> ())
(fun _ _ _ _ -> ())
(read_sum_cases' t pc pc32)
k
#push-options "--z3rlimit 32"
inline_for_extraction
let read_sum
(#kt: parser_kind)
(t: sum)
(p: parser kt (sum_repr_type t))
(p32: leaf_reader (parse_enum_key p (sum_enum t)))
(j: jumper p)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (leaf_reader (dsnd (pc x)))))
(destr: dep_enum_destr (sum_enum t) (read_sum_cases_t t pc))
: Tot (leaf_reader (parse_sum t p pc))
=
fun #_ #_ input pos ->
let h = HST.get () in
valid_facts (parse_sum t p pc) h input pos;
parse_sum_eq' t p pc (bytes_of_slice_from h input pos);
valid_facts (parse_enum_key p (sum_enum t)) h input pos;
let k = p32 input pos in
let pos' = jump_enum_key j (sum_enum t) input pos in
valid_facts (parse_sum_cases' t pc k) h input pos' ;
read_sum_cases t pc pc32 destr k input pos'
#pop-options
inline_for_extraction
let serialize32_sum_cases_t
(t: sum)
(#pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(sc: ((x: sum_key t) -> Tot (serializer (dsnd (pc x)))))
(k: sum_key t)
: Tot Type
= serializer32 (serialize_sum_cases t pc sc k)
let serialize32_sum_cases_t_eq
(t: sum)
(#pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(sc: ((x: sum_key t) -> Tot (serializer (dsnd (pc x)))))
(k: sum_key t)
(x y: serialize32_sum_cases_t t sc k)
: GTot Type0
= True
inline_for_extraction
let serialize32_sum_cases_t_if
(t: sum)
(#pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(sc: ((x: sum_key t) -> Tot (serializer (dsnd (pc x)))))
(k: sum_key t)
: Tot (if_combinator _ (serialize32_sum_cases_t_eq t sc k))
= fun cond (sv_true: (cond_true cond -> Tot (serialize32_sum_cases_t t sc k))) (sv_false: (cond_false cond -> Tot (serialize32_sum_cases_t t sc k))) x #rrel #rel b pos ->
if cond
then (sv_true () x b pos)
else (sv_false () x b pos)
inline_for_extraction
let serialize32_sum_cases_aux
(t: sum)
(#pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(sc: ((x: sum_key t) -> Tot (serializer (dsnd (pc x)))))
(sc32: ((x: sum_key t) -> Tot (serializer32 (sc x))))
(k: sum_key t)
: Tot (serializer32 (serialize_sum_cases t pc sc k))
= fun x #rrel #rel b pos ->
[@inline_let] let _ =
Classical.forall_intro (parse_sum_cases_eq' t pc k);
synth_sum_case_injective t k;
synth_sum_case_inverse t k
in
serialize32_synth
(sc32 k)
(synth_sum_case t k)
(synth_sum_case_recip t k)
(fun x -> synth_sum_case_recip t k x)
()
x
b
pos
inline_for_extraction
let serialize32_sum_cases
(t: sum)
(#pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(sc: ((x: sum_key t) -> Tot (serializer (dsnd (pc x)))))
(sc32: ((x: sum_key t) -> Tot (serializer32 (sc x))))
(destr: dep_enum_destr (sum_enum t) (serialize32_sum_cases_t t sc))
(k: sum_key t)
: Tot (serializer32 (serialize_sum_cases t pc sc k))
= destr
_
(serialize32_sum_cases_t_if t sc)
(fun _ _ -> ())
(fun _ _ _ _ -> ())
(serialize32_sum_cases_aux t sc sc32)
k
inline_for_extraction
let serialize32_sum
(#kt: parser_kind)
(t: sum)
(#p: parser kt (sum_repr_type t))
(s: serializer p {kt.parser_kind_subkind == Some ParserStrong})
(s32: serializer32 (serialize_enum_key _ s (sum_enum t)))
(#pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(sc: ((x: sum_key t) -> Tot (serializer (dsnd (pc x)))))
(sc32: ((x: sum_key t) -> Tot (serializer32 (sc x))))
(destr: dep_enum_destr (sum_enum t) (serialize32_sum_cases_t t sc))
: Tot (serializer32 (serialize_sum t s sc))
= fun x #rrel #rel b pos ->
serialize_sum_eq t s sc x;
let tg = sum_tag_of_data t x in
serialize32_nondep_then_aux s32 (serialize32_sum_cases t sc sc32 destr tg) tg x b pos
let clens_sum_tag
(s: sum)
: Tot (clens (sum_type s) (sum_key s))
= {
clens_cond = (fun _ -> True);
clens_get = sum_tag_of_data s;
}
let gaccessor_sum_tag
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
: Tot (gaccessor (parse_sum t p pc) (parse_enum_key p (sum_enum t)) (clens_sum_tag t))
= gaccessor_tagged_union_tag
(parse_enum_key p (sum_enum t))
(sum_tag_of_data t)
(parse_sum_cases t pc)
inline_for_extraction
let accessor_sum_tag
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
: Tot (accessor (gaccessor_sum_tag t p pc))
= accessor_tagged_union_tag
(parse_enum_key p (sum_enum t))
(sum_tag_of_data t)
(parse_sum_cases t pc)
let clens_sum_payload
(s: sum)
(k: sum_key s)
: Tot (clens (sum_type s) (sum_type_of_tag s k))
= {
clens_cond = (fun (x: sum_type s) -> sum_tag_of_data s x == k);
clens_get = (fun (x: sum_type s) -> synth_sum_case_recip s k x <: Ghost (sum_type_of_tag s k) (requires (sum_tag_of_data s x == k)) (ensures (fun _ -> True)));
}
#push-options "--z3rlimit 32"
let gaccessor_clens_sum_payload'
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (gaccessor' (parse_sum t p pc) (dsnd (pc k)) (clens_sum_payload t k))
= fun (input: bytes) ->
parse_sum_eq'' t p pc input;
let res =
match parse p input with
| Some (_, consumed) ->
synth_sum_case_inverse t k;
synth_sum_case_injective t k;
synth_injective_synth_inverse_synth_inverse_recip (synth_sum_case t k) (synth_sum_case_recip t k) ();
(consumed)
| _ -> 0 // dummy
in
(res <: (res: _ { gaccessor_post' (parse_sum t p pc) (dsnd (pc k)) (clens_sum_payload t k) input res } ))
#push-options "--z3rlimit 64"
let gaccessor_clens_sum_payload_injective
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
(sl sl' : bytes)
: Lemma
(requires (
gaccessor_pre (parse_sum t p pc) (dsnd (pc k)) (clens_sum_payload t k) sl /\
gaccessor_pre (parse_sum t p pc) (dsnd (pc k)) (clens_sum_payload t k) sl' /\
injective_precond (parse_sum t p pc) sl sl'
))
(ensures (gaccessor_clens_sum_payload' t p pc k sl == gaccessor_clens_sum_payload' t p pc k sl'))
= parse_sum_eq'' t p pc sl;
parse_sum_eq'' t p pc sl' ;
parse_injective (parse_sum t p pc) sl sl' ;
parse_injective p sl sl'
#pop-options
let gaccessor_clens_sum_payload_no_lookahead
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
(sl sl' : bytes)
: Lemma
(requires (
(parse_sum_kind kt t pc).parser_kind_subkind == Some ParserStrong /\
gaccessor_pre (parse_sum t p pc) (dsnd (pc k)) (clens_sum_payload t k) sl /\
gaccessor_pre (parse_sum t p pc) (dsnd (pc k)) (clens_sum_payload t k) sl' /\
no_lookahead_on_precond (parse_sum t p pc) sl sl'
))
(ensures (gaccessor_clens_sum_payload' t p pc k sl == gaccessor_clens_sum_payload' t p pc k sl'))
= parse_sum_eq'' t p pc sl;
parse_sum_eq'' t p pc sl' ;
parse_strong_prefix (parse_sum t p pc) sl sl' ;
parse_injective p sl sl'
let gaccessor_clens_sum_payload
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (gaccessor (parse_sum t p pc) (dsnd (pc k)) (clens_sum_payload t k))
= Classical.forall_intro_2 (fun x -> Classical.move_requires (gaccessor_clens_sum_payload_injective t p pc k x));
Classical.forall_intro_2 (fun x -> Classical.move_requires (gaccessor_clens_sum_payload_no_lookahead t p pc k x));
gaccessor_prop_equiv (parse_sum t p pc) (dsnd (pc k)) (clens_sum_payload t k) (gaccessor_clens_sum_payload' t p pc k);
gaccessor_clens_sum_payload' t p pc k
inline_for_extraction
let accessor_clens_sum_payload'
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(j: jumper p)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: HST.Stack U32.t
(requires (fun h ->
valid (parse_sum t p pc) h input pos /\
(clens_sum_payload t k).clens_cond (contents (parse_sum t p pc) h input pos)
))
(ensures (fun h pos' h' ->
B.modifies B.loc_none h h' /\
pos' == slice_access h (gaccessor_clens_sum_payload t p pc k) input pos
))
=
let h = HST.get () in
[@inline_let]
let _ =
let pos' = get_valid_pos (parse_sum t p pc) h input pos in
let large = bytes_of_slice_from h input pos in
slice_access_eq h (gaccessor_clens_sum_payload t p pc k) input pos;
valid_facts (parse_sum t p pc) h input pos;
parse_sum_eq'' t p pc large;
valid_facts p h input pos
in
j input pos
#pop-options
inline_for_extraction
let accessor_clens_sum_payload
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(j: jumper p)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (accessor (gaccessor_clens_sum_payload t p pc k))
= fun #rrel #rel -> accessor_clens_sum_payload' t j pc k #rrel #rel
let clens_sum_cases_payload
(s: sum)
(k: sum_key s)
: Tot (clens (sum_cases s k) (sum_type_of_tag s k))
= {
clens_cond = (fun (x: sum_cases s k) -> True);
clens_get = (fun (x: sum_cases s k) -> synth_sum_case_recip s k x <: Ghost (sum_type_of_tag s k) (requires (True)) (ensures (fun _ -> True)));
}
let gaccessor_clens_sum_cases_payload
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (gaccessor (parse_sum_cases' t pc k) (dsnd (pc k)) (clens_sum_cases_payload t k))
= synth_sum_case_injective t k;
synth_sum_case_inverse t k;
synth_injective_synth_inverse_synth_inverse_recip (synth_sum_case t k) (synth_sum_case_recip t k) ();
gaccessor_ext
(gaccessor_synth (dsnd (pc k)) (synth_sum_case t k) (synth_sum_case_recip t k) ())
(clens_sum_cases_payload t k)
()
inline_for_extraction
let accessor_clens_sum_cases_payload
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (accessor (gaccessor_clens_sum_cases_payload t pc k))
= [@inline_let]
let _ =
synth_sum_case_injective t k;
synth_sum_case_inverse t k;
synth_injective_synth_inverse_synth_inverse_recip (synth_sum_case t k) (synth_sum_case_recip t k) ()
in
accessor_ext
(accessor_synth (dsnd (pc k)) (synth_sum_case t k) (synth_sum_case_recip t k) ())
(clens_sum_cases_payload t k)
()
inline_for_extraction
let validate_dsum_cases_t
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(#k: parser_kind)
(g: parser k (dsum_type_of_unknown_tag s))
(x: dsum_key s)
: Tot Type
= validator (parse_dsum_cases' s f g x)
let validate_dsum_cases_eq
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(#k: parser_kind)
(g: parser k (dsum_type_of_unknown_tag s))
(x: dsum_key s)
(v1 v2 : validate_dsum_cases_t s f g x)
: GTot Type0
= True
inline_for_extraction
let validate_dsum_cases_if'
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(#k: parser_kind)
(g: parser k (dsum_type_of_unknown_tag s))
(x: dsum_key s)
(cond: bool)
(ift: (cond_true cond -> Tot (validate_dsum_cases_t s f g x)))
(iff: (cond_false cond -> Tot (validate_dsum_cases_t s f g x)))
: Tot (validate_dsum_cases_t s f g x)
= fun #rrel #rel input len ->
if cond
then (ift () <: validate_dsum_cases_t s f g x) input len
else (iff () <: validate_dsum_cases_t s f g x) input len
inline_for_extraction
let validate_dsum_cases_if
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(#k: parser_kind)
(g: parser k (dsum_type_of_unknown_tag s))
(x: dsum_key s)
: Tot (if_combinator _ (validate_dsum_cases_eq s f g x))
= validate_dsum_cases_if' s f g x
inline_for_extraction
let validate_dsum_cases'
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(f' : (x: dsum_known_key s) -> Tot (validator (dsnd (f x))))
(#k: parser_kind)
(#g: parser k (dsum_type_of_unknown_tag s))
(g' : validator g)
(x: dsum_key s)
: Tot (validate_dsum_cases_t s f g x)
= [@inline_let]
let _ = synth_dsum_case_injective s x in
match x with
| Known x' -> validate_synth (f' x') (synth_dsum_case s (Known x')) () <: validator (parse_dsum_cases' s f g x)
| Unknown x' -> validate_synth g' (synth_dsum_case s (Unknown x')) () <: validator (parse_dsum_cases' s f g x)
inline_for_extraction
let validate_dsum_cases'_destr
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(f' : (x: dsum_known_key s) -> Tot (validator (dsnd (f x))))
(#k: parser_kind)
(#g: parser k (dsum_type_of_unknown_tag s))
(g' : validator g)
(destr: dep_enum_destr _ (fun k -> validate_dsum_cases_t s f g (Known k)))
(x: dsum_key s)
: Tot (validate_dsum_cases_t s f g x)
= fun #rrel #rel input pos ->
match x with
| Known k ->
destr
_
(fun k -> validate_dsum_cases_if s f g (Known k))
(fun _ _ -> ())
(fun _ _ _ _ -> ())
(fun k -> validate_dsum_cases' s f f' g' (Known k))
k
input
pos
| Unknown r -> validate_dsum_cases' s f f' g' (Unknown r) input pos
inline_for_extraction
let validate_dsum_cases
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(f' : (x: dsum_known_key s) -> Tot (validator (dsnd (f x))))
(#k: parser_kind)
(#g: parser k (dsum_type_of_unknown_tag s))
(g' : validator g)
(destr: dep_enum_destr _ (fun k -> validate_dsum_cases_t s f g (Known k)))
(x: dsum_key s)
: Tot (validator (parse_dsum_cases s f g x))
= fun #rrel #rel input pos ->
let h = HST.get () in
[@inline_let]
let _ =
valid_facts (parse_dsum_cases' s f g x) h input (uint64_to_uint32 pos);
valid_facts (parse_dsum_cases s f g x) h input (uint64_to_uint32 pos);
parse_dsum_cases_eq' s f g x (bytes_of_slice_from h input (uint64_to_uint32 pos))
in
validate_dsum_cases'_destr s f f' g' destr x input pos
#push-options "--z3rlimit 40" | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"LowStar.Buffer.fst.checked",
"LowParse.Spec.Sum.fst.checked",
"LowParse.Low.Enum.fst.checked",
"FStar.UInt64.fsti.checked",
"FStar.UInt32.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Int.Cast.fst.checked",
"FStar.HyperStack.ST.fsti.checked",
"FStar.HyperStack.fst.checked",
"FStar.Classical.fsti.checked"
],
"interface_file": false,
"source_file": "LowParse.Low.Sum.fst"
} | [
{
"abbrev": true,
"full_module": "FStar.HyperStack",
"short_module": "HS"
},
{
"abbrev": true,
"full_module": "FStar.UInt64",
"short_module": "U64"
},
{
"abbrev": true,
"full_module": "FStar.Int.Cast",
"short_module": "Cast"
},
{
"abbrev": true,
"full_module": "LowStar.Buffer",
"short_module": "B"
},
{
"abbrev": true,
"full_module": "FStar.HyperStack.ST",
"short_module": "HST"
},
{
"abbrev": true,
"full_module": "FStar.UInt32",
"short_module": "U32"
},
{
"abbrev": false,
"full_module": "LowParse.Spec.Sum",
"short_module": null
},
{
"abbrev": false,
"full_module": "LowParse.Low.Enum",
"short_module": null
},
{
"abbrev": false,
"full_module": "LowParse.Low",
"short_module": null
},
{
"abbrev": false,
"full_module": "LowParse.Low",
"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",
"short_module": null
}
] | {
"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_elim_box": false,
"smtencoding_l_arith_repr": "boxwrap",
"smtencoding_nl_arith_repr": "boxwrap",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": true,
"z3cliopt": [],
"z3refresh": false,
"z3rlimit": 40,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | false |
t: LowParse.Spec.Sum.dsum ->
v: LowParse.Low.Base.validator p ->
p32: LowParse.Low.Base.leaf_reader p ->
f:
(x: LowParse.Spec.Sum.dsum_known_key t
-> Prims.dtuple2 LowParse.Spec.Base.parser_kind
(fun k -> LowParse.Spec.Base.parser k (LowParse.Spec.Sum.dsum_type_of_known_tag t x))) ->
f32:
(x: LowParse.Spec.Sum.dsum_known_key t
-> LowParse.Low.Base.validator (FStar.Pervasives.dsnd (f x))) ->
g32: LowParse.Low.Base.validator g ->
destr:
LowParse.Spec.Enum.dep_maybe_enum_destr_t (LowParse.Spec.Sum.dsum_enum t)
(LowParse.Low.Sum.validate_dsum_cases_t t f g)
-> LowParse.Low.Base.validator (LowParse.Spec.Sum.parse_dsum t p f g) | Prims.Tot | [
"total"
] | [] | [
"LowParse.Spec.Base.parser_kind",
"LowParse.Spec.Sum.dsum",
"LowParse.Spec.Base.parser",
"LowParse.Spec.Sum.dsum_repr_type",
"LowParse.Low.Base.validator",
"LowParse.Low.Base.leaf_reader",
"LowParse.Spec.Sum.dsum_known_key",
"Prims.dtuple2",
"LowParse.Spec.Sum.dsum_type_of_known_tag",
"Prims.__proj__Mkdtuple2__item___1",
"FStar.Pervasives.dsnd",
"LowParse.Spec.Sum.dsum_type_of_unknown_tag",
"LowParse.Spec.Enum.dep_maybe_enum_destr_t",
"LowParse.Spec.Sum.dsum_key_type",
"LowParse.Spec.Sum.dsum_enum",
"LowParse.Low.Sum.validate_dsum_cases_t",
"LowParse.Slice.srel",
"LowParse.Bytes.byte",
"LowParse.Slice.slice",
"FStar.UInt64.t",
"LowParse.Low.ErrorCode.is_error",
"Prims.bool",
"LowParse.Low.Sum.validate_dsum_cases_eq",
"LowParse.Low.Sum.validate_dsum_cases_if",
"LowParse.Spec.Enum.maybe_enum_key",
"Prims.unit",
"LowParse.Low.Sum.validate_dsum_cases'",
"LowParse.Low.Base.Spec.valid_facts",
"LowParse.Spec.Sum.parse_dsum_cases_kind",
"LowParse.Spec.Enum.maybe_enum_key_of_repr",
"LowParse.Spec.Sum.dsum_cases",
"LowParse.Spec.Sum.parse_dsum_cases'",
"LowParse.Low.ErrorCode.uint64_to_uint32",
"LowParse.Spec.Sum.parse_dsum_kind",
"LowParse.Spec.Sum.dsum_type",
"LowParse.Spec.Sum.parse_dsum",
"LowParse.Spec.Sum.parse_dsum_eq'",
"LowParse.Slice.bytes_of_slice_from",
"FStar.Monotonic.HyperStack.mem",
"FStar.HyperStack.ST.get"
] | [] | false | false | false | false | false | let validate_dsum
(#kt: parser_kind)
(t: dsum)
(#p: parser kt (dsum_repr_type t))
(v: validator p)
(p32: leaf_reader p)
(f: (x: dsum_known_key t -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x))))
(f32: (x: dsum_known_key t -> Tot (validator (dsnd (f x)))))
(#k': parser_kind)
(#g: parser k' (dsum_type_of_unknown_tag t))
(g32: validator g)
(destr: dep_maybe_enum_destr_t (dsum_enum t) (validate_dsum_cases_t t f g))
: Tot (validator (parse_dsum t p f g)) =
| fun #rrel #rel input pos ->
let h = HST.get () in
[@@ inline_let ]let _ =
parse_dsum_eq' t p f g (bytes_of_slice_from h input (uint64_to_uint32 pos))
in
[@@ inline_let ]let _ = valid_facts (parse_dsum t p f g) h input (uint64_to_uint32 pos) in
[@@ inline_let ]let _ = valid_facts p h input (uint64_to_uint32 pos) in
let pos_after_tag = v input pos in
if is_error pos_after_tag
then pos_after_tag
else
let tg = p32 input (uint64_to_uint32 pos) in
[@@ inline_let ]let _ =
valid_facts (parse_dsum_cases' t f g (maybe_enum_key_of_repr (dsum_enum t) tg))
h
input
(uint64_to_uint32 pos_after_tag)
in
destr (validate_dsum_cases_eq t f g)
(validate_dsum_cases_if t f g)
(fun _ _ -> ())
(fun _ _ _ _ -> ())
(validate_dsum_cases' t f f32 g32)
tg
input
pos_after_tag | false |
LowParse.Low.Sum.fst | LowParse.Low.Sum.read_dsum_cases | val read_dsum_cases
(t: dsum)
(f: (x: dsum_known_key t -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x))))
(f32: (x: dsum_known_key t -> Tot (leaf_reader (dsnd (f x)))))
(#k': parser_kind)
(g: parser k' (dsum_type_of_unknown_tag t))
(g32: leaf_reader g)
(destr: dep_enum_destr _ (read_dsum_cases_t t f g))
(x: dsum_key t)
: Tot (leaf_reader (parse_dsum_cases' t f g x)) | val read_dsum_cases
(t: dsum)
(f: (x: dsum_known_key t -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x))))
(f32: (x: dsum_known_key t -> Tot (leaf_reader (dsnd (f x)))))
(#k': parser_kind)
(g: parser k' (dsum_type_of_unknown_tag t))
(g32: leaf_reader g)
(destr: dep_enum_destr _ (read_dsum_cases_t t f g))
(x: dsum_key t)
: Tot (leaf_reader (parse_dsum_cases' t f g x)) | let read_dsum_cases
(t: dsum)
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(f32: (x: dsum_known_key t) -> Tot (leaf_reader (dsnd (f x))))
(#k': parser_kind)
(g: parser k' (dsum_type_of_unknown_tag t))
(g32: leaf_reader g)
(destr: dep_enum_destr _ (read_dsum_cases_t t f g))
(x: dsum_key t)
: Tot (leaf_reader (parse_dsum_cases' t f g x))
= fun #_ #_ input pos ->
match x with
| Known k ->
destr
_
(read_dsum_cases_t_if t f g)
(fun _ _ -> ())
(fun _ _ _ _ -> ())
(fun k -> read_dsum_cases' t f f32 g g32 (Known k))
k
input
pos
| Unknown r ->
read_dsum_cases' t f f32 g g32 (Unknown r) input pos | {
"file_name": "src/lowparse/LowParse.Low.Sum.fst",
"git_rev": "00217c4a89f5ba56002ba9aa5b4a9d5903bfe9fa",
"git_url": "https://github.com/project-everest/everparse.git",
"project_name": "everparse"
} | {
"end_col": 56,
"end_line": 1600,
"start_col": 0,
"start_line": 1577
} | module LowParse.Low.Sum
include LowParse.Low.Enum
include LowParse.Spec.Sum
module U32 = FStar.UInt32
module HST = FStar.HyperStack.ST
module B = LowStar.Buffer
module Cast = FStar.Int.Cast
module U64 = FStar.UInt64
inline_for_extraction
let validate_sum_cases_aux
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(vc: ((x: sum_key t) -> Tot (validator (dsnd (pc x)))))
(k: sum_key t)
: Tot (validator (parse_sum_cases t pc k))
= [@inline_let]
let _ = synth_sum_case_injective t k in
validate_synth
(validate_weaken
(weaken_parse_cases_kind t pc)
(vc k)
()
)
(synth_sum_case t k)
()
inline_for_extraction
let validate_sum_cases_t
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot Type
= validator (parse_sum_cases t pc k)
let validate_sum_cases_t_eq
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
(x y : validate_sum_cases_t t pc k)
: GTot Type0
= True
inline_for_extraction
let validate_sum_cases_t_if
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (if_combinator _ (validate_sum_cases_t_eq t pc k))
= fun cond (sv_true: cond_true cond -> Tot (validate_sum_cases_t t pc k)) (sv_false: cond_false cond -> Tot (validate_sum_cases_t t pc k)) #rrel #rel input pos ->
if cond
then sv_true () input pos
else sv_false () input pos
inline_for_extraction
let validate_sum_cases
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(vc: ((x: sum_key t) -> Tot (validator (dsnd (pc x)))))
(destr: dep_enum_destr (sum_enum t) (validate_sum_cases_t t pc))
(k: sum_key t)
: Tot (validator (parse_sum_cases t pc k))
= destr
_
(validate_sum_cases_t_if t pc)
(fun _ _ -> ())
(fun _ _ _ _ -> ())
(validate_sum_cases_aux t pc vc)
k
inline_for_extraction
let validate_sum_aux_payload_t
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
: Tot Type
= (#rrel: _) -> (#rel: _) ->
(input: slice rrel rel) ->
(pos: U64.t) ->
HST.Stack U64.t
(requires (fun h -> live_slice h input /\ U64.v pos <= U32.v input.len))
(ensures (fun h res h' ->
B.modifies B.loc_none h h' /\ (
match k with
| Unknown _ -> is_error res
| Known k' ->
if is_success res
then
valid_pos (dsnd (pc k')) h input (uint64_to_uint32 pos) (uint64_to_uint32 res)
else
(~ (valid (dsnd (pc k')) h input (uint64_to_uint32 pos)))
)))
let validate_sum_aux_payload_eq
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
: Tot (validate_sum_aux_payload_t t pc k -> validate_sum_aux_payload_t t pc k -> GTot Type0)
= fun _ _ -> True
inline_for_extraction
let validate_sum_aux_payload_if'
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
(cond: bool)
(ift: ((cond_true cond) -> Tot (validate_sum_aux_payload_t t pc k)))
(iff: ((cond_false cond) -> Tot (validate_sum_aux_payload_t t pc k)))
: Tot (validate_sum_aux_payload_t t pc k)
= fun #rrel #rel input pos ->
if cond
then begin
(ift () <: validate_sum_aux_payload_t t pc k) input pos
end else
(iff () <: validate_sum_aux_payload_t t pc k) input pos
inline_for_extraction
let validate_sum_aux_payload_if
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
: Tot (if_combinator _ (validate_sum_aux_payload_eq t pc k))
= validate_sum_aux_payload_if' t pc k
#push-options "--z3rlimit 64 --z3cliopt smt.arith.nl=false --using_facts_from '* -FStar.Int.Cast -LowParse.BitFields'"
// --query_stats --smtencoding.elim_box true --smtencoding.l_arith_repr native --z3refresh"
inline_for_extraction
let validate_sum_aux
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(v: validator p)
(p32: leaf_reader p)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(v_payload: ((k: sum_repr_type t)) -> Tot (validate_sum_aux_payload_t t pc (maybe_enum_key_of_repr (sum_enum t) k)))
: Tot (validator (parse_sum t p pc))
= fun #rrel #rel input pos ->
let h = HST.get () in
[@inline_let]
let _ = parse_sum_eq'' t p pc (bytes_of_slice_from h input (uint64_to_uint32 pos)) in
[@inline_let]
let _ = valid_facts (parse_sum t p pc) h input (uint64_to_uint32 pos) in
[@inline_let]
let _ = valid_facts p h input (uint64_to_uint32 pos) in
let len_after_tag = v input pos in
if is_error len_after_tag
then len_after_tag
else begin
let h1 = HST.get () in
let k' = p32 input (uint64_to_uint32 pos) in
[@inline_let]
let _ =
match maybe_enum_key_of_repr (sum_enum t) k' with
| Known k -> valid_facts (dsnd (pc k)) h input (uint64_to_uint32 len_after_tag)
| _ -> ()
in
v_payload k' input len_after_tag
end
#pop-options
inline_for_extraction
let validate_sum_aux_payload'
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (validator (dsnd (pc x)))))
(k: maybe_enum_key (sum_enum t))
: Tot (validate_sum_aux_payload_t t pc k)
= fun #rrel #rel input pos ->
match k with
| Known k ->
[@inline_let]
let _ = synth_sum_case_injective t k in
pc32 k input pos
// validate_synth (pc32 k) (synth_sum_case t k) () input pos
| _ -> validator_error_generic
inline_for_extraction
let validate_sum_aux_payload
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (validator (dsnd (pc x)))))
(destr: dep_maybe_enum_destr_t (sum_enum t) (validate_sum_aux_payload_t t pc))
(k: sum_repr_type t)
: Tot (validate_sum_aux_payload_t t pc (maybe_enum_key_of_repr (sum_enum t) k))
= destr (validate_sum_aux_payload_eq t pc) (validate_sum_aux_payload_if t pc) (fun _ _ -> ()) (fun _ _ _ _ -> ()) (validate_sum_aux_payload' t pc pc32) k
inline_for_extraction
let validate_sum
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(v: validator p)
(p32: leaf_reader p)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (validator (dsnd (pc x)))))
(destr: dep_maybe_enum_destr_t (sum_enum t) (validate_sum_aux_payload_t t pc))
: Tot (validator (parse_sum t p pc))
= validate_sum_aux t v p32 pc (validate_sum_aux_payload t pc pc32 destr)
module HS = FStar.HyperStack
#push-options "--z3rlimit 256 --z3cliopt smt.arith.nl=false --initial_ifuel 8 --max_ifuel 8 --initial_fuel 2 --max_fuel 2"
#restart-solver
let valid_sum_intro
(h: HS.mem)
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: Lemma
(requires (
valid (parse_enum_key p (sum_enum t)) h input pos /\ (
let k = contents (parse_enum_key p (sum_enum t)) h input pos in
valid (dsnd (pc k)) h input (get_valid_pos (parse_enum_key p (sum_enum t)) h input pos)
)))
(ensures (
let k = contents (parse_enum_key p (sum_enum t)) h input pos in
let pos_payload = get_valid_pos (parse_enum_key p (sum_enum t)) h input pos in
valid_content_pos
(parse_sum t p pc) h input pos
(synth_sum_case t k (contents (dsnd (pc k)) h input pos_payload))
(get_valid_pos (dsnd (pc k)) h input pos_payload)
))
= valid_facts (parse_enum_key p (sum_enum t)) h input pos;
let k = contents (parse_enum_key p (sum_enum t)) h input pos in
let pos_payload = get_valid_pos (parse_enum_key p (sum_enum t)) h input pos in
valid_facts (dsnd (pc k)) h input pos_payload;
valid_facts (parse_sum t p pc) h input pos;
parse_sum_eq t p pc (bytes_of_slice_from h input pos)
#pop-options
inline_for_extraction
let finalize_sum_case
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(s: serializer p)
(w: leaf_writer_strong s)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(destr: enum_repr_of_key'_t (sum_enum t))
(k: sum_key t)
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: HST.Stack unit
(requires (fun h ->
let len_tag = serialized_length (serialize_enum_key _ s (sum_enum t)) k in
U32.v pos + len_tag < 4294967296 /\ (
let pos_payload = pos `U32.add` U32.uint_to_t len_tag in
valid (dsnd (pc k)) h input pos_payload /\
writable input.base (U32.v pos) (U32.v pos_payload) h
)))
(ensures (fun h _ h' ->
let len_tag = serialized_length (serialize_enum_key _ s (sum_enum t)) k in
let pos_payload = pos `U32.add` U32.uint_to_t len_tag in
B.modifies (loc_slice_from_to input pos pos_payload) h h' /\
valid_content_pos (parse_sum t p pc) h' input pos (synth_sum_case t k (contents (dsnd (pc k)) h input pos_payload)) (get_valid_pos (dsnd (pc k)) h input pos_payload)
))
= let pos1 = write_enum_key w (sum_enum t) destr k input pos in
let h = HST.get () in
[@inline_let]
let _ = valid_sum_intro h t p pc input pos in
()
inline_for_extraction
let jump_sum_cases_aux
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(vc: ((x: sum_key t) -> Tot (jumper (dsnd (pc x)))))
(k: sum_key t)
: Tot (jumper (parse_sum_cases t pc k))
= [@inline_let]
let _ = synth_sum_case_injective t k in
jump_synth
(jump_weaken
(weaken_parse_cases_kind t pc)
(vc k)
()
)
(synth_sum_case t k)
()
inline_for_extraction
let jump_sum_cases_t
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot Type
= jumper (parse_sum_cases t pc k)
let jump_sum_cases_t_eq
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
(x y : jump_sum_cases_t t pc k)
: GTot Type0
= True
inline_for_extraction
let jump_sum_cases_t_if
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (if_combinator _ (jump_sum_cases_t_eq t pc k))
= fun cond (sv_true: cond_true cond -> Tot (jump_sum_cases_t t pc k)) (sv_false: cond_false cond -> Tot (jump_sum_cases_t t pc k)) #rrel #rel input pos ->
if cond
then sv_true () input pos
else sv_false () input pos
inline_for_extraction
let jump_sum_cases
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(vc: ((x: sum_key t) -> Tot (jumper (dsnd (pc x)))))
(destr: dep_enum_destr (sum_enum t) (jump_sum_cases_t t pc))
(k: sum_key t)
: Tot (jumper (parse_sum_cases t pc k))
= destr
_
(jump_sum_cases_t_if t pc)
(fun _ _ -> ())
(fun _ _ _ _ -> ())
(jump_sum_cases_aux t pc vc)
k
inline_for_extraction
let jump_sum_aux_payload_t
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
: Tot Type
= (#rrel: _) -> (#rel: _) ->
(input: slice rrel rel) ->
(pos: U32.t) ->
HST.Stack U32.t
(requires (fun h -> live_slice h input /\ U32.v pos <= U32.v input.len /\ (
match k with
| Unknown _ -> False
| Known k' -> valid (dsnd (pc k')) h input pos
)))
(ensures (fun h res h' ->
B.modifies B.loc_none h h' /\ (
match k with
| Unknown _ -> False
| Known k' ->
valid_pos (dsnd (pc k')) h input pos res
)))
let jump_sum_aux_payload_eq
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
: Tot (jump_sum_aux_payload_t t pc k -> jump_sum_aux_payload_t t pc k -> GTot Type0)
= fun _ _ -> True
inline_for_extraction
let jump_sum_aux_payload_if'
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
(cond: bool)
(ift: ((cond_true cond) -> Tot (jump_sum_aux_payload_t t pc k)))
(iff: ((cond_false cond) -> Tot (jump_sum_aux_payload_t t pc k)))
: Tot (jump_sum_aux_payload_t t pc k)
= fun #rrel #rel input pos ->
if cond
then begin
(ift () <: jump_sum_aux_payload_t t pc k) input pos
end else
(iff () <: jump_sum_aux_payload_t t pc k) input pos
inline_for_extraction
let jump_sum_aux_payload_if
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
: Tot (if_combinator _ (jump_sum_aux_payload_eq t pc k))
= jump_sum_aux_payload_if' t pc k
let parse_sum_eq3
(#kt: parser_kind)
(t: sum)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(input: bytes)
(k' : sum_repr_type t)
(consumed_k: consumed_length input)
: Lemma
(requires (Some? (parse (parse_sum t p pc) input) /\ parse p input == Some (k', consumed_k)))
(ensures (
let input_k = Seq.slice input consumed_k (Seq.length input) in
let k = maybe_enum_key_of_repr (sum_enum t) k' in
begin match k with
| Known k ->
Some? (parse (dsnd (pc k)) input_k)
| _ -> False
end
))
= parse_sum_eq'' t p pc input
let parse_sum_eq4
(#kt: parser_kind)
(t: sum)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(input: bytes)
(k' : sum_repr_type t)
(consumed_k: consumed_length input)
(consumed_payload: nat)
: Lemma
(requires (Some? (parse (parse_sum t p pc) input) /\ parse p input == Some (k', consumed_k) /\ (
let input_k = Seq.slice input consumed_k (Seq.length input) in
let k = maybe_enum_key_of_repr (sum_enum t) k' in
begin match k with
| Known k ->
Some? (parse (dsnd (pc k)) input_k) /\ (
let Some (_, consumed_payload') = parse (dsnd (pc k)) input_k in
consumed_payload' == consumed_payload
)
| _ -> False
end
)))
(ensures (
let Some (_, consumed) = parse (parse_sum t p pc) input in
consumed == consumed_k + consumed_payload
))
= parse_sum_eq'' t p pc input
#push-options "--z3rlimit 16"
let valid_sum_elim
(h: HS.mem)
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(#rrel: _) (#rel: _)
(input: slice rrel rel)
(pos: U32.t)
: Lemma
(requires (
valid (parse_sum t p pc) h input pos
))
(ensures (
valid p h input pos /\ (
let pos_payload = get_valid_pos p h input pos in
let k' = maybe_enum_key_of_repr (sum_enum t) (contents p h input pos) in
match k' with
| Known k ->
k == sum_tag_of_data t (contents (parse_sum t p pc) h input pos) /\
valid (dsnd (pc k)) h input pos_payload /\
valid_pos
(parse_sum t p pc) h input pos
(get_valid_pos (dsnd (pc k)) h input pos_payload)
| _ -> False
)))
= let sinput = bytes_of_slice_from h input pos in
let _ = parse_sum_eq'' t p pc sinput in
[@inline_let]
let _ = valid_facts (parse_sum t p pc) h input pos in
let Some (k', consumed_k) = parse p sinput in
let pos_after_tag = U32.uint_to_t (U32.v pos + consumed_k) in
[@inline_let]
let _ = valid_facts p h input pos in
assert (valid_content_pos p h input pos k' pos_after_tag);
match maybe_enum_key_of_repr (sum_enum t) k' with
| Known k -> valid_facts (dsnd (pc k)) h input pos_after_tag
| _ -> ()
#pop-options
let valid_sum_elim_tag
(h: HS.mem)
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: Lemma
(requires (
valid (parse_sum t p pc) h input pos
))
(ensures (
valid (parse_enum_key p (sum_enum t)) h input pos /\
contents (parse_enum_key p (sum_enum t)) h input pos == sum_tag_of_data t (contents (parse_sum t p pc) h input pos)
))
= let _ = parse_sum_eq' t p pc (bytes_of_slice_from h input pos) in
let _ = valid_facts (parse_sum t p pc) h input pos in
let _ = valid_facts (parse_enum_key p (sum_enum t)) h input pos in
()
inline_for_extraction
let read_sum_tag
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(p32: leaf_reader p)
(destr: dep_maybe_enum_destr_t (sum_enum t) (read_enum_key_t (sum_enum t)))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: HST.Stack (sum_key t)
(requires (fun h ->
valid (parse_sum t p pc) h input pos
))
(ensures (fun h res h' ->
B.modifies B.loc_none h h' /\
res == sum_tag_of_data t (contents (parse_sum t p pc) h input pos)
))
= let h = HST.get () in
[@inline_let] let _ = valid_sum_elim_tag h t p pc input pos in
read_enum_key p32 (sum_enum t) destr input pos
inline_for_extraction
let jump_sum_aux
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(v: jumper p)
(p32: leaf_reader p)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(v_payload: ((k: sum_repr_type t)) -> Tot (jump_sum_aux_payload_t t pc (maybe_enum_key_of_repr (sum_enum t) k)))
: Tot (jumper (parse_sum t p pc))
= fun #rrel #rel input pos ->
let h = HST.get () in
[@inline_let]
let _ = valid_sum_elim h t p pc input pos in
let pos_after_tag = v input pos in
let k' = p32 input pos in
v_payload k' input pos_after_tag
inline_for_extraction
let jump_sum_aux_payload'
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (jumper (dsnd (pc x)))))
(k: maybe_enum_key (sum_enum t))
: Tot (jump_sum_aux_payload_t t pc k)
= fun #rrel #rel input pos ->
match k with
| Known k ->
[@inline_let]
let _ = synth_sum_case_injective t k in
pc32 k input pos
| _ -> 0ul // dummy, but we MUST NOT remove this branch, otherwise extraction fails
inline_for_extraction
let jump_sum_aux_payload
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (jumper (dsnd (pc x)))))
(destr: dep_maybe_enum_destr_t (sum_enum t) (jump_sum_aux_payload_t t pc))
(k: sum_repr_type t)
: Tot (jump_sum_aux_payload_t t pc (maybe_enum_key_of_repr (sum_enum t) k))
= destr (jump_sum_aux_payload_eq t pc) (jump_sum_aux_payload_if t pc) (fun _ _ -> ()) (fun _ _ _ _ -> ()) (jump_sum_aux_payload' t pc pc32) k
inline_for_extraction
let jump_sum
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(v: jumper p)
(p32: leaf_reader p)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (jumper (dsnd (pc x)))))
(destr: dep_maybe_enum_destr_t (sum_enum t) (jump_sum_aux_payload_t t pc))
: Tot (jumper (parse_sum t p pc))
= jump_sum_aux t v p32 pc (jump_sum_aux_payload t pc pc32 destr)
inline_for_extraction
let read_sum_cases'
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (leaf_reader (dsnd (pc x)))))
(k: sum_key t)
: Tot (leaf_reader (parse_sum_cases' t pc k))
= [@inline_let]
let _ = synth_sum_case_injective t k in
read_synth'
(dsnd (pc k))
(synth_sum_case t k)
(pc32 k)
()
inline_for_extraction
let read_sum_cases_t
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot Type
= leaf_reader (parse_sum_cases' t pc k)
let read_sum_cases_t_eq
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
(x y : read_sum_cases_t t pc k)
: GTot Type0
= True
inline_for_extraction
let read_sum_cases_t_if
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (if_combinator _ (read_sum_cases_t_eq t pc k))
= fun cond (sv_true: cond_true cond -> Tot (read_sum_cases_t t pc k)) (sv_false: cond_false cond -> Tot (read_sum_cases_t t pc k)) #_ #_ input pos ->
if cond
then (sv_true () input pos)
else (sv_false () input pos)
inline_for_extraction
let read_sum_cases
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (leaf_reader (dsnd (pc x)))))
(destr: dep_enum_destr (sum_enum t) (read_sum_cases_t t pc))
(k: sum_key t)
: Tot (leaf_reader (parse_sum_cases' t pc k))
= destr
_
(read_sum_cases_t_if t pc)
(fun _ _ -> ())
(fun _ _ _ _ -> ())
(read_sum_cases' t pc pc32)
k
#push-options "--z3rlimit 32"
inline_for_extraction
let read_sum
(#kt: parser_kind)
(t: sum)
(p: parser kt (sum_repr_type t))
(p32: leaf_reader (parse_enum_key p (sum_enum t)))
(j: jumper p)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (leaf_reader (dsnd (pc x)))))
(destr: dep_enum_destr (sum_enum t) (read_sum_cases_t t pc))
: Tot (leaf_reader (parse_sum t p pc))
=
fun #_ #_ input pos ->
let h = HST.get () in
valid_facts (parse_sum t p pc) h input pos;
parse_sum_eq' t p pc (bytes_of_slice_from h input pos);
valid_facts (parse_enum_key p (sum_enum t)) h input pos;
let k = p32 input pos in
let pos' = jump_enum_key j (sum_enum t) input pos in
valid_facts (parse_sum_cases' t pc k) h input pos' ;
read_sum_cases t pc pc32 destr k input pos'
#pop-options
inline_for_extraction
let serialize32_sum_cases_t
(t: sum)
(#pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(sc: ((x: sum_key t) -> Tot (serializer (dsnd (pc x)))))
(k: sum_key t)
: Tot Type
= serializer32 (serialize_sum_cases t pc sc k)
let serialize32_sum_cases_t_eq
(t: sum)
(#pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(sc: ((x: sum_key t) -> Tot (serializer (dsnd (pc x)))))
(k: sum_key t)
(x y: serialize32_sum_cases_t t sc k)
: GTot Type0
= True
inline_for_extraction
let serialize32_sum_cases_t_if
(t: sum)
(#pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(sc: ((x: sum_key t) -> Tot (serializer (dsnd (pc x)))))
(k: sum_key t)
: Tot (if_combinator _ (serialize32_sum_cases_t_eq t sc k))
= fun cond (sv_true: (cond_true cond -> Tot (serialize32_sum_cases_t t sc k))) (sv_false: (cond_false cond -> Tot (serialize32_sum_cases_t t sc k))) x #rrel #rel b pos ->
if cond
then (sv_true () x b pos)
else (sv_false () x b pos)
inline_for_extraction
let serialize32_sum_cases_aux
(t: sum)
(#pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(sc: ((x: sum_key t) -> Tot (serializer (dsnd (pc x)))))
(sc32: ((x: sum_key t) -> Tot (serializer32 (sc x))))
(k: sum_key t)
: Tot (serializer32 (serialize_sum_cases t pc sc k))
= fun x #rrel #rel b pos ->
[@inline_let] let _ =
Classical.forall_intro (parse_sum_cases_eq' t pc k);
synth_sum_case_injective t k;
synth_sum_case_inverse t k
in
serialize32_synth
(sc32 k)
(synth_sum_case t k)
(synth_sum_case_recip t k)
(fun x -> synth_sum_case_recip t k x)
()
x
b
pos
inline_for_extraction
let serialize32_sum_cases
(t: sum)
(#pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(sc: ((x: sum_key t) -> Tot (serializer (dsnd (pc x)))))
(sc32: ((x: sum_key t) -> Tot (serializer32 (sc x))))
(destr: dep_enum_destr (sum_enum t) (serialize32_sum_cases_t t sc))
(k: sum_key t)
: Tot (serializer32 (serialize_sum_cases t pc sc k))
= destr
_
(serialize32_sum_cases_t_if t sc)
(fun _ _ -> ())
(fun _ _ _ _ -> ())
(serialize32_sum_cases_aux t sc sc32)
k
inline_for_extraction
let serialize32_sum
(#kt: parser_kind)
(t: sum)
(#p: parser kt (sum_repr_type t))
(s: serializer p {kt.parser_kind_subkind == Some ParserStrong})
(s32: serializer32 (serialize_enum_key _ s (sum_enum t)))
(#pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(sc: ((x: sum_key t) -> Tot (serializer (dsnd (pc x)))))
(sc32: ((x: sum_key t) -> Tot (serializer32 (sc x))))
(destr: dep_enum_destr (sum_enum t) (serialize32_sum_cases_t t sc))
: Tot (serializer32 (serialize_sum t s sc))
= fun x #rrel #rel b pos ->
serialize_sum_eq t s sc x;
let tg = sum_tag_of_data t x in
serialize32_nondep_then_aux s32 (serialize32_sum_cases t sc sc32 destr tg) tg x b pos
let clens_sum_tag
(s: sum)
: Tot (clens (sum_type s) (sum_key s))
= {
clens_cond = (fun _ -> True);
clens_get = sum_tag_of_data s;
}
let gaccessor_sum_tag
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
: Tot (gaccessor (parse_sum t p pc) (parse_enum_key p (sum_enum t)) (clens_sum_tag t))
= gaccessor_tagged_union_tag
(parse_enum_key p (sum_enum t))
(sum_tag_of_data t)
(parse_sum_cases t pc)
inline_for_extraction
let accessor_sum_tag
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
: Tot (accessor (gaccessor_sum_tag t p pc))
= accessor_tagged_union_tag
(parse_enum_key p (sum_enum t))
(sum_tag_of_data t)
(parse_sum_cases t pc)
let clens_sum_payload
(s: sum)
(k: sum_key s)
: Tot (clens (sum_type s) (sum_type_of_tag s k))
= {
clens_cond = (fun (x: sum_type s) -> sum_tag_of_data s x == k);
clens_get = (fun (x: sum_type s) -> synth_sum_case_recip s k x <: Ghost (sum_type_of_tag s k) (requires (sum_tag_of_data s x == k)) (ensures (fun _ -> True)));
}
#push-options "--z3rlimit 32"
let gaccessor_clens_sum_payload'
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (gaccessor' (parse_sum t p pc) (dsnd (pc k)) (clens_sum_payload t k))
= fun (input: bytes) ->
parse_sum_eq'' t p pc input;
let res =
match parse p input with
| Some (_, consumed) ->
synth_sum_case_inverse t k;
synth_sum_case_injective t k;
synth_injective_synth_inverse_synth_inverse_recip (synth_sum_case t k) (synth_sum_case_recip t k) ();
(consumed)
| _ -> 0 // dummy
in
(res <: (res: _ { gaccessor_post' (parse_sum t p pc) (dsnd (pc k)) (clens_sum_payload t k) input res } ))
#push-options "--z3rlimit 64"
let gaccessor_clens_sum_payload_injective
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
(sl sl' : bytes)
: Lemma
(requires (
gaccessor_pre (parse_sum t p pc) (dsnd (pc k)) (clens_sum_payload t k) sl /\
gaccessor_pre (parse_sum t p pc) (dsnd (pc k)) (clens_sum_payload t k) sl' /\
injective_precond (parse_sum t p pc) sl sl'
))
(ensures (gaccessor_clens_sum_payload' t p pc k sl == gaccessor_clens_sum_payload' t p pc k sl'))
= parse_sum_eq'' t p pc sl;
parse_sum_eq'' t p pc sl' ;
parse_injective (parse_sum t p pc) sl sl' ;
parse_injective p sl sl'
#pop-options
let gaccessor_clens_sum_payload_no_lookahead
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
(sl sl' : bytes)
: Lemma
(requires (
(parse_sum_kind kt t pc).parser_kind_subkind == Some ParserStrong /\
gaccessor_pre (parse_sum t p pc) (dsnd (pc k)) (clens_sum_payload t k) sl /\
gaccessor_pre (parse_sum t p pc) (dsnd (pc k)) (clens_sum_payload t k) sl' /\
no_lookahead_on_precond (parse_sum t p pc) sl sl'
))
(ensures (gaccessor_clens_sum_payload' t p pc k sl == gaccessor_clens_sum_payload' t p pc k sl'))
= parse_sum_eq'' t p pc sl;
parse_sum_eq'' t p pc sl' ;
parse_strong_prefix (parse_sum t p pc) sl sl' ;
parse_injective p sl sl'
let gaccessor_clens_sum_payload
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (gaccessor (parse_sum t p pc) (dsnd (pc k)) (clens_sum_payload t k))
= Classical.forall_intro_2 (fun x -> Classical.move_requires (gaccessor_clens_sum_payload_injective t p pc k x));
Classical.forall_intro_2 (fun x -> Classical.move_requires (gaccessor_clens_sum_payload_no_lookahead t p pc k x));
gaccessor_prop_equiv (parse_sum t p pc) (dsnd (pc k)) (clens_sum_payload t k) (gaccessor_clens_sum_payload' t p pc k);
gaccessor_clens_sum_payload' t p pc k
inline_for_extraction
let accessor_clens_sum_payload'
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(j: jumper p)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: HST.Stack U32.t
(requires (fun h ->
valid (parse_sum t p pc) h input pos /\
(clens_sum_payload t k).clens_cond (contents (parse_sum t p pc) h input pos)
))
(ensures (fun h pos' h' ->
B.modifies B.loc_none h h' /\
pos' == slice_access h (gaccessor_clens_sum_payload t p pc k) input pos
))
=
let h = HST.get () in
[@inline_let]
let _ =
let pos' = get_valid_pos (parse_sum t p pc) h input pos in
let large = bytes_of_slice_from h input pos in
slice_access_eq h (gaccessor_clens_sum_payload t p pc k) input pos;
valid_facts (parse_sum t p pc) h input pos;
parse_sum_eq'' t p pc large;
valid_facts p h input pos
in
j input pos
#pop-options
inline_for_extraction
let accessor_clens_sum_payload
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(j: jumper p)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (accessor (gaccessor_clens_sum_payload t p pc k))
= fun #rrel #rel -> accessor_clens_sum_payload' t j pc k #rrel #rel
let clens_sum_cases_payload
(s: sum)
(k: sum_key s)
: Tot (clens (sum_cases s k) (sum_type_of_tag s k))
= {
clens_cond = (fun (x: sum_cases s k) -> True);
clens_get = (fun (x: sum_cases s k) -> synth_sum_case_recip s k x <: Ghost (sum_type_of_tag s k) (requires (True)) (ensures (fun _ -> True)));
}
let gaccessor_clens_sum_cases_payload
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (gaccessor (parse_sum_cases' t pc k) (dsnd (pc k)) (clens_sum_cases_payload t k))
= synth_sum_case_injective t k;
synth_sum_case_inverse t k;
synth_injective_synth_inverse_synth_inverse_recip (synth_sum_case t k) (synth_sum_case_recip t k) ();
gaccessor_ext
(gaccessor_synth (dsnd (pc k)) (synth_sum_case t k) (synth_sum_case_recip t k) ())
(clens_sum_cases_payload t k)
()
inline_for_extraction
let accessor_clens_sum_cases_payload
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (accessor (gaccessor_clens_sum_cases_payload t pc k))
= [@inline_let]
let _ =
synth_sum_case_injective t k;
synth_sum_case_inverse t k;
synth_injective_synth_inverse_synth_inverse_recip (synth_sum_case t k) (synth_sum_case_recip t k) ()
in
accessor_ext
(accessor_synth (dsnd (pc k)) (synth_sum_case t k) (synth_sum_case_recip t k) ())
(clens_sum_cases_payload t k)
()
inline_for_extraction
let validate_dsum_cases_t
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(#k: parser_kind)
(g: parser k (dsum_type_of_unknown_tag s))
(x: dsum_key s)
: Tot Type
= validator (parse_dsum_cases' s f g x)
let validate_dsum_cases_eq
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(#k: parser_kind)
(g: parser k (dsum_type_of_unknown_tag s))
(x: dsum_key s)
(v1 v2 : validate_dsum_cases_t s f g x)
: GTot Type0
= True
inline_for_extraction
let validate_dsum_cases_if'
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(#k: parser_kind)
(g: parser k (dsum_type_of_unknown_tag s))
(x: dsum_key s)
(cond: bool)
(ift: (cond_true cond -> Tot (validate_dsum_cases_t s f g x)))
(iff: (cond_false cond -> Tot (validate_dsum_cases_t s f g x)))
: Tot (validate_dsum_cases_t s f g x)
= fun #rrel #rel input len ->
if cond
then (ift () <: validate_dsum_cases_t s f g x) input len
else (iff () <: validate_dsum_cases_t s f g x) input len
inline_for_extraction
let validate_dsum_cases_if
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(#k: parser_kind)
(g: parser k (dsum_type_of_unknown_tag s))
(x: dsum_key s)
: Tot (if_combinator _ (validate_dsum_cases_eq s f g x))
= validate_dsum_cases_if' s f g x
inline_for_extraction
let validate_dsum_cases'
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(f' : (x: dsum_known_key s) -> Tot (validator (dsnd (f x))))
(#k: parser_kind)
(#g: parser k (dsum_type_of_unknown_tag s))
(g' : validator g)
(x: dsum_key s)
: Tot (validate_dsum_cases_t s f g x)
= [@inline_let]
let _ = synth_dsum_case_injective s x in
match x with
| Known x' -> validate_synth (f' x') (synth_dsum_case s (Known x')) () <: validator (parse_dsum_cases' s f g x)
| Unknown x' -> validate_synth g' (synth_dsum_case s (Unknown x')) () <: validator (parse_dsum_cases' s f g x)
inline_for_extraction
let validate_dsum_cases'_destr
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(f' : (x: dsum_known_key s) -> Tot (validator (dsnd (f x))))
(#k: parser_kind)
(#g: parser k (dsum_type_of_unknown_tag s))
(g' : validator g)
(destr: dep_enum_destr _ (fun k -> validate_dsum_cases_t s f g (Known k)))
(x: dsum_key s)
: Tot (validate_dsum_cases_t s f g x)
= fun #rrel #rel input pos ->
match x with
| Known k ->
destr
_
(fun k -> validate_dsum_cases_if s f g (Known k))
(fun _ _ -> ())
(fun _ _ _ _ -> ())
(fun k -> validate_dsum_cases' s f f' g' (Known k))
k
input
pos
| Unknown r -> validate_dsum_cases' s f f' g' (Unknown r) input pos
inline_for_extraction
let validate_dsum_cases
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(f' : (x: dsum_known_key s) -> Tot (validator (dsnd (f x))))
(#k: parser_kind)
(#g: parser k (dsum_type_of_unknown_tag s))
(g' : validator g)
(destr: dep_enum_destr _ (fun k -> validate_dsum_cases_t s f g (Known k)))
(x: dsum_key s)
: Tot (validator (parse_dsum_cases s f g x))
= fun #rrel #rel input pos ->
let h = HST.get () in
[@inline_let]
let _ =
valid_facts (parse_dsum_cases' s f g x) h input (uint64_to_uint32 pos);
valid_facts (parse_dsum_cases s f g x) h input (uint64_to_uint32 pos);
parse_dsum_cases_eq' s f g x (bytes_of_slice_from h input (uint64_to_uint32 pos))
in
validate_dsum_cases'_destr s f f' g' destr x input pos
#push-options "--z3rlimit 40"
inline_for_extraction
let validate_dsum
(#kt: parser_kind)
(t: dsum)
(#p: parser kt (dsum_repr_type t))
(v: validator p)
(p32: leaf_reader p)
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(f32: (x: dsum_known_key t) -> Tot (validator (dsnd (f x))))
(#k': parser_kind)
(#g: parser k' (dsum_type_of_unknown_tag t))
(g32: validator g)
(destr: dep_maybe_enum_destr_t (dsum_enum t) (validate_dsum_cases_t t f g))
: Tot (validator (parse_dsum t p f g))
= fun #rrel #rel input pos ->
let h = HST.get () in
[@inline_let]
let _ = parse_dsum_eq' t p f g (bytes_of_slice_from h input (uint64_to_uint32 pos)) in
[@inline_let]
let _ = valid_facts (parse_dsum t p f g) h input (uint64_to_uint32 pos) in
[@inline_let]
let _ = valid_facts p h input (uint64_to_uint32 pos) in
let pos_after_tag = v input pos in
if is_error pos_after_tag
then pos_after_tag
else
let tg = p32 input (uint64_to_uint32 pos) in
[@inline_let]
let _ = valid_facts (parse_dsum_cases' t f g (maybe_enum_key_of_repr (dsum_enum t) tg)) h input (uint64_to_uint32 pos_after_tag) in
destr (validate_dsum_cases_eq t f g) (validate_dsum_cases_if t f g) (fun _ _ -> ()) (fun _ _ _ _ -> ()) (validate_dsum_cases' t f f32 g32) tg input pos_after_tag
#pop-options
#reset-options "--z3rlimit 64 --z3cliopt smt.arith.nl=false --initial_ifuel 8 --max_ifuel 8 --initial_fuel 2 --max_fuel 2"
let valid_dsum_intro_known
(h: HS.mem)
(t: dsum)
(#kt: parser_kind)
(p: parser kt (dsum_repr_type t))
(f: ((x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x))))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: Lemma
(requires (
valid (parse_maybe_enum_key p (dsum_enum t)) h input pos /\ (
let k' = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
Known? k' /\ (
let Known k = k' in
valid (dsnd (f k)) h input (get_valid_pos (parse_maybe_enum_key p (dsum_enum t)) h input pos)
))))
(ensures (
let Known k = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
let pos_payload = get_valid_pos (parse_maybe_enum_key p (dsum_enum t)) h input pos in
valid_content_pos
(parse_dsum t p f g) h input pos
(synth_dsum_case t (Known k) (contents (dsnd (f k)) h input pos_payload))
(get_valid_pos (dsnd (f k)) h input pos_payload)
))
= valid_facts (parse_maybe_enum_key p (dsum_enum t)) h input pos;
let Known k = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
let pos_payload = get_valid_pos (parse_maybe_enum_key p (dsum_enum t)) h input pos in
valid_facts (dsnd (f k)) h input pos_payload;
valid_facts (parse_dsum t p f g) h input pos;
parse_dsum_eq t p f g (bytes_of_slice_from h input pos)
let valid_dsum_intro_unknown
(h: HS.mem)
(t: dsum)
(#kt: parser_kind)
(p: parser kt (dsum_repr_type t))
(f: ((x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x))))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: Lemma
(requires (
valid (parse_maybe_enum_key p (dsum_enum t)) h input pos /\ (
let k' = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
Unknown? k' /\
valid g h input (get_valid_pos (parse_maybe_enum_key p (dsum_enum t)) h input pos)
)))
(ensures (
let Unknown r = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
let pos_payload = get_valid_pos (parse_maybe_enum_key p (dsum_enum t)) h input pos in
valid_content_pos
(parse_dsum t p f g) h input pos
(synth_dsum_case t (Unknown r) (contents g h input pos_payload))
(get_valid_pos g h input pos_payload)
))
= valid_facts (parse_maybe_enum_key p (dsum_enum t)) h input pos;
let Unknown r = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
let pos_payload = get_valid_pos (parse_maybe_enum_key p (dsum_enum t)) h input pos in
valid_facts g h input pos_payload;
valid_facts (parse_dsum t p f g) h input pos;
parse_dsum_eq t p f g (bytes_of_slice_from h input pos)
#reset-options
inline_for_extraction
let finalize_dsum_case_known
(t: dsum)
(#kt: parser_kind)
(#p: parser kt (dsum_repr_type t))
(s: serializer p)
(w: leaf_writer_strong s)
(f: ((x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x))))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
(destr: enum_repr_of_key'_t (dsum_enum t))
(k: dsum_known_key t)
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: HST.Stack unit
(requires (fun h ->
let len_tag = serialized_length (serialize_enum_key _ s (dsum_enum t)) k in
U32.v pos + len_tag < 4294967296 /\ (
let pos_payload = pos `U32.add` U32.uint_to_t len_tag in
valid (dsnd (f k)) h input pos_payload /\
writable input.base (U32.v pos) (U32.v pos_payload) h
)))
(ensures (fun h _ h' ->
let len_tag = serialized_length (serialize_enum_key _ s (dsum_enum t)) k in
let pos_payload = pos `U32.add` U32.uint_to_t len_tag in
B.modifies (loc_slice_from_to input pos pos_payload) h h' /\
valid_content_pos (parse_dsum t p f g) h' input pos (synth_dsum_case t (Known k) (contents (dsnd (f k)) h input pos_payload)) (get_valid_pos (dsnd (f k)) h input pos_payload)
))
= let pos1 = write_enum_key w (dsum_enum t) destr k input pos in
let h = HST.get () in
[@inline_let]
let _ =
valid_facts (parse_enum_key p (dsum_enum t)) h input pos;
valid_facts (parse_maybe_enum_key p (dsum_enum t)) h input pos;
let sq = bytes_of_slice_from h input pos in
parse_enum_key_eq p (dsum_enum t) sq;
parse_maybe_enum_key_eq p (dsum_enum t) sq;
valid_dsum_intro_known h t p f g input pos
in
()
inline_for_extraction
let finalize_dsum_case_unknown
(t: dsum)
(#kt: parser_kind)
(#p: parser kt (dsum_repr_type t))
(s: serializer p)
(w: leaf_writer_strong s)
(f: ((x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x))))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
(r: unknown_enum_repr (dsum_enum t))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: HST.Stack unit
(requires (fun h ->
let len_tag = serialized_length s r in
U32.v pos + len_tag < 4294967296 /\ (
let pos_payload = pos `U32.add` U32.uint_to_t len_tag in
valid g h input pos_payload /\
writable input.base (U32.v pos) (U32.v pos_payload) h
)))
(ensures (fun h _ h' ->
let len_tag = serialized_length s r in
let pos_payload = pos `U32.add` U32.uint_to_t len_tag in
B.modifies (loc_slice_from_to input pos pos_payload) h h' /\
valid_content_pos (parse_dsum t p f g) h' input pos (synth_dsum_case t (Unknown r) (contents g h input pos_payload)) (get_valid_pos g h input pos_payload)
))
= let pos1 = w r input pos in
let h = HST.get () in
[@inline_let]
let _ =
valid_facts (parse_maybe_enum_key p (dsum_enum t)) h input pos;
valid_facts p h input pos;
let sq = bytes_of_slice_from h input pos in
parse_maybe_enum_key_eq p (dsum_enum t) sq;
valid_dsum_intro_unknown h t p f g input pos
in
()
let valid_dsum_elim_tag
(h: HS.mem)
(t: dsum)
(#kt: parser_kind)
(p: parser kt (dsum_repr_type t))
(f: ((x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x))))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: Lemma
(requires (
valid (parse_dsum t p f g) h input pos
))
(ensures (
valid (parse_maybe_enum_key p (dsum_enum t)) h input pos /\
contents (parse_maybe_enum_key p (dsum_enum t)) h input pos == dsum_tag_of_data t (contents (parse_dsum t p f g) h input pos)
))
= let _ = parse_dsum_eq_ t p f g (bytes_of_slice_from h input pos) in
let _ = valid_facts (parse_dsum t p f g) h input pos in
let _ = valid_facts (parse_maybe_enum_key p (dsum_enum t)) h input pos in
()
inline_for_extraction
let read_dsum_tag
(t: dsum)
(#kt: parser_kind)
(#p: parser kt (dsum_repr_type t))
(p32: leaf_reader p)
(destr: maybe_enum_destr_t (maybe_enum_key (dsum_enum t)) (dsum_enum t))
(f: ((x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x))))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: HST.Stack (dsum_key t)
(requires (fun h ->
valid (parse_dsum t p f g) h input pos
))
(ensures (fun h res h' ->
B.modifies B.loc_none h h' /\
res == dsum_tag_of_data t (contents (parse_dsum t p f g) h input pos)
))
= let h = HST.get () in
[@inline_let] let _ = valid_dsum_elim_tag h t p f g input pos in
read_maybe_enum_key p32 (dsum_enum t) destr input pos
#push-options "--z3rlimit 32"
let valid_dsum_elim_known
(h: HS.mem)
(t: dsum)
(#kt: parser_kind)
(p: parser kt (dsum_repr_type t))
(f: ((x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x))))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: Lemma
(requires (
valid (parse_dsum t p f g) h input pos /\
Known? (dsum_tag_of_data t (contents (parse_dsum t p f g) h input pos))
))
(ensures (
valid (parse_maybe_enum_key p (dsum_enum t)) h input pos /\ (
let k' = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
let pos_payload = get_valid_pos (parse_maybe_enum_key p (dsum_enum t)) h input pos in
Known? k' /\ (
let Known k = k' in
valid (dsnd (f k)) h input pos_payload /\
valid_content_pos
(parse_dsum t p f g) h input pos
(synth_dsum_case t (Known k) (contents (dsnd (f k)) h input pos_payload))
(get_valid_pos (dsnd (f k)) h input pos_payload)
))))
=
valid_facts (parse_dsum t p f g) h input pos;
parse_dsum_eq t p f g (bytes_of_slice_from h input pos);
valid_facts (parse_maybe_enum_key p (dsum_enum t)) h input pos;
let Known k = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
let pos_payload = get_valid_pos (parse_maybe_enum_key p (dsum_enum t)) h input pos in
valid_facts (dsnd (f k)) h input pos_payload
#pop-options
let valid_dsum_elim_unknown
(h: HS.mem)
(t: dsum)
(#kt: parser_kind)
(p: parser kt (dsum_repr_type t))
(f: ((x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x))))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: Lemma
(requires (
valid (parse_dsum t p f g) h input pos /\
Unknown? (dsum_tag_of_data t (contents (parse_dsum t p f g) h input pos))
))
(ensures (
valid (parse_maybe_enum_key p (dsum_enum t)) h input pos /\ (
let k' = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
let pos_payload = get_valid_pos (parse_maybe_enum_key p (dsum_enum t)) h input pos in
Unknown? k' /\ (
let Unknown r = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
valid g h input pos_payload /\
valid_content_pos
(parse_dsum t p f g) h input pos
(synth_dsum_case t (Unknown r) (contents g h input pos_payload))
(get_valid_pos g h input pos_payload)
))))
=
valid_facts (parse_dsum t p f g) h input pos;
parse_dsum_eq t p f g (bytes_of_slice_from h input pos);
valid_facts (parse_maybe_enum_key p (dsum_enum t)) h input pos;
let Unknown r = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
let pos_payload = get_valid_pos (parse_maybe_enum_key p (dsum_enum t)) h input pos in
valid_facts g h input pos_payload
inline_for_extraction
let jump_dsum_cases_t
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(#k: parser_kind)
(g: parser k (dsum_type_of_unknown_tag s))
(x: dsum_key s)
: Tot Type
= jumper (parse_dsum_cases' s f g x)
let jump_dsum_cases_eq
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(#k: parser_kind)
(g: parser k (dsum_type_of_unknown_tag s))
(x: dsum_key s)
(v1 v2 : jump_dsum_cases_t s f g x)
: GTot Type0
= True
inline_for_extraction
let jump_dsum_cases_if'
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(#k: parser_kind)
(g: parser k (dsum_type_of_unknown_tag s))
(x: dsum_key s)
(cond: bool)
(ift: (cond_true cond -> Tot (jump_dsum_cases_t s f g x)))
(iff: (cond_false cond -> Tot (jump_dsum_cases_t s f g x)))
: Tot (jump_dsum_cases_t s f g x)
= fun #rrel #rel input len ->
if cond
then (ift () <: jump_dsum_cases_t s f g x) input len
else (iff () <: jump_dsum_cases_t s f g x) input len
inline_for_extraction
let jump_dsum_cases_if
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(#k: parser_kind)
(g: parser k (dsum_type_of_unknown_tag s))
(x: dsum_key s)
: Tot (if_combinator _ (jump_dsum_cases_eq s f g x))
= jump_dsum_cases_if' s f g x
inline_for_extraction
let jump_dsum_cases'
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(f' : (x: dsum_known_key s) -> Tot (jumper (dsnd (f x))))
(#k: parser_kind)
(#g: parser k (dsum_type_of_unknown_tag s))
(g' : jumper g)
(x: dsum_key s)
: Tot (jump_dsum_cases_t s f g x)
= synth_dsum_case_injective s x;
match x with
| Known x' -> jump_synth (f' x') (synth_dsum_case s (Known x')) () <: jumper (parse_dsum_cases' s f g x)
| Unknown x' -> jump_synth g' (synth_dsum_case s (Unknown x')) () <: jumper (parse_dsum_cases' s f g x)
inline_for_extraction
let jump_dsum_cases'_destr
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(f' : (x: dsum_known_key s) -> Tot (jumper (dsnd (f x))))
(#k: parser_kind)
(#g: parser k (dsum_type_of_unknown_tag s))
(g' : jumper g)
(destr: dep_enum_destr _ (fun k -> jump_dsum_cases_t s f g (Known k)))
(x: dsum_key s)
: Tot (jump_dsum_cases_t s f g x)
= fun #rrel #rel input pos ->
match x with
| Known k ->
destr
_
(fun k -> jump_dsum_cases_if s f g (Known k))
(fun _ _ -> ())
(fun _ _ _ _ -> ())
(fun k -> jump_dsum_cases' s f f' g' (Known k))
k
input
pos
| Unknown r -> jump_dsum_cases' s f f' g' (Unknown r) input pos
inline_for_extraction
let jump_dsum_cases
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(f' : (x: dsum_known_key s) -> Tot (jumper (dsnd (f x))))
(#k: parser_kind)
(#g: parser k (dsum_type_of_unknown_tag s))
(g' : jumper g)
(destr: dep_enum_destr _ (fun k -> jump_dsum_cases_t s f g (Known k)))
(x: dsum_key s)
: Tot (jumper (parse_dsum_cases s f g x))
= fun #rrel #rel input pos ->
let h = HST.get () in
[@inline_let]
let _ =
valid_facts (parse_dsum_cases' s f g x) h input pos;
valid_facts (parse_dsum_cases s f g x) h input pos;
parse_dsum_cases_eq' s f g x (bytes_of_slice_from h input pos)
in
jump_dsum_cases'_destr s f f' g' destr x input pos
#push-options "--z3rlimit 16"
inline_for_extraction
let jump_dsum
(#kt: parser_kind)
(t: dsum)
(#p: parser kt (dsum_repr_type t))
(v: jumper p)
(p32: leaf_reader p)
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(f32: (x: dsum_known_key t) -> Tot (jumper (dsnd (f x))))
(#k': parser_kind)
(#g: parser k' (dsum_type_of_unknown_tag t))
(g32: jumper g)
(destr: dep_maybe_enum_destr_t (dsum_enum t) (jump_dsum_cases_t t f g))
: Tot (jumper (parse_dsum t p f g))
= fun #rrel #rel input pos ->
let h = HST.get () in
[@inline_let]
let _ = parse_dsum_eq' t p f g (bytes_of_slice_from h input pos) in
[@inline_let]
let _ = valid_facts (parse_dsum t p f g) h input pos in
[@inline_let]
let _ = valid_facts p h input pos in
let pos_after_tag = v input pos in
let tg = p32 input pos in
[@inline_let]
let _ = valid_facts (parse_dsum_cases' t f g (maybe_enum_key_of_repr (dsum_enum t) tg)) h input pos_after_tag in
destr (jump_dsum_cases_eq t f g) (jump_dsum_cases_if t f g) (fun _ _ -> ()) (fun _ _ _ _ -> ()) (jump_dsum_cases' t f f32 g32) tg input pos_after_tag
#pop-options
inline_for_extraction
let read_dsum_cases'
(t: dsum)
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(f32: (x: dsum_known_key t) -> Tot (leaf_reader (dsnd (f x))))
(#k': parser_kind)
(g: parser k' (dsum_type_of_unknown_tag t))
(g32: leaf_reader g)
(x: dsum_key t)
: Tot (leaf_reader (parse_dsum_cases' t f g x))
= fun #rrel #rel input pos ->
[@inline_let]
let _ = synth_dsum_case_injective t x in
match x with
| Known x' ->
read_synth'
(dsnd (f x'))
(synth_dsum_case t (Known x'))
(f32 x')
()
input
pos
| Unknown x' ->
read_synth'
g
(synth_dsum_case t (Unknown x'))
g32
()
input
pos
inline_for_extraction
let read_dsum_cases_t
(t: dsum)
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(#k': parser_kind)
(g: parser k' (dsum_type_of_unknown_tag t))
(k: dsum_known_key t)
: Tot Type
= leaf_reader (parse_dsum_cases' t f g (Known k))
let read_dsum_cases_t_eq
(t: dsum)
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(#k': parser_kind)
(g: parser k' (dsum_type_of_unknown_tag t))
(k: dsum_known_key t)
(x y : read_dsum_cases_t t f g k)
: GTot Type0
= True
inline_for_extraction
let read_dsum_cases_t_if
(t: dsum)
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(#k': parser_kind)
(g: parser k' (dsum_type_of_unknown_tag t))
(k: dsum_known_key t)
: Tot (if_combinator _ (read_dsum_cases_t_eq t f g k))
= fun cond (sv_true: cond_true cond -> Tot (read_dsum_cases_t t f g k)) (sv_false: cond_false cond -> Tot (read_dsum_cases_t t f g k)) #_ #_ input pos ->
if cond
then sv_true () input pos
else sv_false () input pos | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"LowStar.Buffer.fst.checked",
"LowParse.Spec.Sum.fst.checked",
"LowParse.Low.Enum.fst.checked",
"FStar.UInt64.fsti.checked",
"FStar.UInt32.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Int.Cast.fst.checked",
"FStar.HyperStack.ST.fsti.checked",
"FStar.HyperStack.fst.checked",
"FStar.Classical.fsti.checked"
],
"interface_file": false,
"source_file": "LowParse.Low.Sum.fst"
} | [
{
"abbrev": true,
"full_module": "FStar.HyperStack",
"short_module": "HS"
},
{
"abbrev": true,
"full_module": "FStar.UInt64",
"short_module": "U64"
},
{
"abbrev": true,
"full_module": "FStar.Int.Cast",
"short_module": "Cast"
},
{
"abbrev": true,
"full_module": "LowStar.Buffer",
"short_module": "B"
},
{
"abbrev": true,
"full_module": "FStar.HyperStack.ST",
"short_module": "HST"
},
{
"abbrev": true,
"full_module": "FStar.UInt32",
"short_module": "U32"
},
{
"abbrev": false,
"full_module": "LowParse.Spec.Sum",
"short_module": null
},
{
"abbrev": false,
"full_module": "LowParse.Low.Enum",
"short_module": null
},
{
"abbrev": false,
"full_module": "LowParse.Low",
"short_module": null
},
{
"abbrev": false,
"full_module": "LowParse.Low",
"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",
"short_module": null
}
] | {
"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_elim_box": false,
"smtencoding_l_arith_repr": "boxwrap",
"smtencoding_nl_arith_repr": "boxwrap",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": true,
"z3cliopt": [],
"z3refresh": false,
"z3rlimit": 5,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | false |
t: LowParse.Spec.Sum.dsum ->
f:
(x: LowParse.Spec.Sum.dsum_known_key t
-> Prims.dtuple2 LowParse.Spec.Base.parser_kind
(fun k -> LowParse.Spec.Base.parser k (LowParse.Spec.Sum.dsum_type_of_known_tag t x))) ->
f32:
(x: LowParse.Spec.Sum.dsum_known_key t
-> LowParse.Low.Base.leaf_reader (FStar.Pervasives.dsnd (f x))) ->
g: LowParse.Spec.Base.parser k' (LowParse.Spec.Sum.dsum_type_of_unknown_tag t) ->
g32: LowParse.Low.Base.leaf_reader g ->
destr:
LowParse.Spec.Enum.dep_enum_destr (LowParse.Spec.Sum.dsum_enum t)
(LowParse.Low.Sum.read_dsum_cases_t t f g) ->
x: LowParse.Spec.Sum.dsum_key t
-> LowParse.Low.Base.leaf_reader (LowParse.Spec.Sum.parse_dsum_cases' t f g x) | Prims.Tot | [
"total"
] | [] | [
"LowParse.Spec.Sum.dsum",
"LowParse.Spec.Sum.dsum_known_key",
"Prims.dtuple2",
"LowParse.Spec.Base.parser_kind",
"LowParse.Spec.Base.parser",
"LowParse.Spec.Sum.dsum_type_of_known_tag",
"LowParse.Low.Base.leaf_reader",
"Prims.__proj__Mkdtuple2__item___1",
"FStar.Pervasives.dsnd",
"LowParse.Spec.Sum.dsum_type_of_unknown_tag",
"LowParse.Spec.Enum.dep_enum_destr",
"LowParse.Spec.Sum.dsum_key_type",
"LowParse.Spec.Sum.dsum_repr_type",
"LowParse.Spec.Sum.dsum_enum",
"LowParse.Low.Sum.read_dsum_cases_t",
"LowParse.Spec.Sum.dsum_key",
"LowParse.Slice.srel",
"LowParse.Bytes.byte",
"LowParse.Slice.slice",
"FStar.UInt32.t",
"LowParse.Spec.Enum.enum_key",
"LowParse.Low.Sum.read_dsum_cases_t_eq",
"LowParse.Low.Sum.read_dsum_cases_t_if",
"Prims.unit",
"LowParse.Low.Sum.read_dsum_cases'",
"LowParse.Spec.Enum.Known",
"LowParse.Spec.Sum.dsum_cases",
"LowParse.Spec.Enum.unknown_enum_repr",
"LowParse.Spec.Enum.Unknown",
"LowParse.Spec.Sum.parse_dsum_cases_kind",
"LowParse.Spec.Sum.parse_dsum_cases'"
] | [] | false | false | false | false | false | let read_dsum_cases
(t: dsum)
(f: (x: dsum_known_key t -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x))))
(f32: (x: dsum_known_key t -> Tot (leaf_reader (dsnd (f x)))))
(#k': parser_kind)
(g: parser k' (dsum_type_of_unknown_tag t))
(g32: leaf_reader g)
(destr: dep_enum_destr _ (read_dsum_cases_t t f g))
(x: dsum_key t)
: Tot (leaf_reader (parse_dsum_cases' t f g x)) =
| fun #_ #_ input pos ->
match x with
| Known k ->
destr _
(read_dsum_cases_t_if t f g)
(fun _ _ -> ())
(fun _ _ _ _ -> ())
(fun k -> read_dsum_cases' t f f32 g g32 (Known k))
k
input
pos
| Unknown r -> read_dsum_cases' t f f32 g g32 (Unknown r) input pos | false |
Vale.Curve25519.Fast_defs.fst | Vale.Curve25519.Fast_defs.bool_bit | val bool_bit (b: bool) : bit | val bool_bit (b: bool) : bit | let bool_bit (b:bool) : bit = if b then 1 else 0 | {
"file_name": "vale/code/crypto/ecc/curve25519/Vale.Curve25519.Fast_defs.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 48,
"end_line": 33,
"start_col": 0,
"start_line": 33
} | module Vale.Curve25519.Fast_defs
open Vale.Def.Words_s
open Vale.Def.Types_s
open FStar.Mul
unfold let pow2_192 = 0x1000000000000000000000000000000000000000000000000
let _ = assert_norm (pow2 192 = pow2_192)
unfold let pow2_256 = 0x10000000000000000000000000000000000000000000000000000000000000000
let _ = assert_norm (pow2 256 = pow2_256)
unfold let pow2_320 = 0x100000000000000000000000000000000000000000000000000000000000000000000000000000000
let _ = assert_norm (pow2 320 = pow2_320)
unfold let pow2_384 = 0x1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000
let _ = assert_norm (pow2 384 = pow2_384)
unfold let pow2_448 = 0x10000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000
let _ = assert_norm (pow2 448 = pow2_448)
unfold let pow2_512 = 0x100000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000
let _ = assert_norm (pow2 512 = pow2_512)
let pow2_two (c0 c1:nat) : nat = c0 + pow2_64 * c1
let pow2_three (c0 c1 c2:nat) : nat = pow2_two c0 c1 + pow2_128 * c2
let pow2_four (c0 c1 c2 c3:nat) : nat = pow2_three c0 c1 c2 + pow2_192 * c3
let pow2_five (c0 c1 c2 c3 c4:nat) : nat = pow2_four c0 c1 c2 c3 + pow2_256 * c4
let pow2_six (c0 c1 c2 c3 c4 c5:nat) : nat = pow2_five c0 c1 c2 c3 c4 + pow2_320 * c5
let pow2_seven (c0 c1 c2 c3 c4 c5 c6:nat) : nat = pow2_six c0 c1 c2 c3 c4 c5 + pow2_384 * c6
let pow2_eight (c0 c1 c2 c3 c4 c5 c6 c7:nat) : nat = pow2_seven c0 c1 c2 c3 c4 c5 c6 + pow2_448 * c7
let pow2_nine (c0 c1 c2 c3 c4 c5 c6 c7 c8:nat) : nat = pow2_eight c0 c1 c2 c3 c4 c5 c6 c7 + pow2_512 * c8
unfold let prime:nat = 57896044618658097711785492504343953926634992332820282019728792003956564819949 //(pow2 255) - 19
type bit = b:nat { b <= 1 } | {
"checked_file": "/",
"dependencies": [
"Vale.Def.Words_s.fsti.checked",
"Vale.Def.Types_s.fst.checked",
"Vale.Curve25519.Fast_lemmas_internal.fsti.checked",
"Vale.Arch.Types.fsti.checked",
"prims.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked"
],
"interface_file": false,
"source_file": "Vale.Curve25519.Fast_defs.fst"
} | [
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Def.Types_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Def.Words_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Curve25519",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Curve25519",
"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",
"short_module": null
}
] | {
"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_elim_box": true,
"smtencoding_l_arith_repr": "native",
"smtencoding_nl_arith_repr": "wrapped",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": false,
"z3cliopt": [
"smt.arith.nl=false",
"smt.QI.EAGER_THRESHOLD=100",
"smt.CASE_SPLIT=3"
],
"z3refresh": false,
"z3rlimit": 5,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | false | b: Prims.bool -> Vale.Curve25519.Fast_defs.bit | Prims.Tot | [
"total"
] | [] | [
"Prims.bool",
"Vale.Curve25519.Fast_defs.bit"
] | [] | false | false | false | true | false | let bool_bit (b: bool) : bit =
| if b then 1 else 0 | false |
Vale.Curve25519.Fast_defs.fst | Vale.Curve25519.Fast_defs.prime | val prime:nat | val prime:nat | let prime:nat = 57896044618658097711785492504343953926634992332820282019728792003956564819949 | {
"file_name": "vale/code/crypto/ecc/curve25519/Vale.Curve25519.Fast_defs.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 100,
"end_line": 29,
"start_col": 7,
"start_line": 29
} | module Vale.Curve25519.Fast_defs
open Vale.Def.Words_s
open Vale.Def.Types_s
open FStar.Mul
unfold let pow2_192 = 0x1000000000000000000000000000000000000000000000000
let _ = assert_norm (pow2 192 = pow2_192)
unfold let pow2_256 = 0x10000000000000000000000000000000000000000000000000000000000000000
let _ = assert_norm (pow2 256 = pow2_256)
unfold let pow2_320 = 0x100000000000000000000000000000000000000000000000000000000000000000000000000000000
let _ = assert_norm (pow2 320 = pow2_320)
unfold let pow2_384 = 0x1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000
let _ = assert_norm (pow2 384 = pow2_384)
unfold let pow2_448 = 0x10000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000
let _ = assert_norm (pow2 448 = pow2_448)
unfold let pow2_512 = 0x100000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000
let _ = assert_norm (pow2 512 = pow2_512)
let pow2_two (c0 c1:nat) : nat = c0 + pow2_64 * c1
let pow2_three (c0 c1 c2:nat) : nat = pow2_two c0 c1 + pow2_128 * c2
let pow2_four (c0 c1 c2 c3:nat) : nat = pow2_three c0 c1 c2 + pow2_192 * c3
let pow2_five (c0 c1 c2 c3 c4:nat) : nat = pow2_four c0 c1 c2 c3 + pow2_256 * c4
let pow2_six (c0 c1 c2 c3 c4 c5:nat) : nat = pow2_five c0 c1 c2 c3 c4 + pow2_320 * c5
let pow2_seven (c0 c1 c2 c3 c4 c5 c6:nat) : nat = pow2_six c0 c1 c2 c3 c4 c5 + pow2_384 * c6
let pow2_eight (c0 c1 c2 c3 c4 c5 c6 c7:nat) : nat = pow2_seven c0 c1 c2 c3 c4 c5 c6 + pow2_448 * c7
let pow2_nine (c0 c1 c2 c3 c4 c5 c6 c7 c8:nat) : nat = pow2_eight c0 c1 c2 c3 c4 c5 c6 c7 + pow2_512 * c8 | {
"checked_file": "/",
"dependencies": [
"Vale.Def.Words_s.fsti.checked",
"Vale.Def.Types_s.fst.checked",
"Vale.Curve25519.Fast_lemmas_internal.fsti.checked",
"Vale.Arch.Types.fsti.checked",
"prims.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked"
],
"interface_file": false,
"source_file": "Vale.Curve25519.Fast_defs.fst"
} | [
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Def.Types_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Def.Words_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Curve25519",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Curve25519",
"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",
"short_module": null
}
] | {
"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_elim_box": true,
"smtencoding_l_arith_repr": "native",
"smtencoding_nl_arith_repr": "wrapped",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": false,
"z3cliopt": [
"smt.arith.nl=false",
"smt.QI.EAGER_THRESHOLD=100",
"smt.CASE_SPLIT=3"
],
"z3refresh": false,
"z3rlimit": 5,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | false | Prims.nat | Prims.Tot | [
"total"
] | [] | [] | [] | false | false | false | true | false | let prime:nat =
| 57896044618658097711785492504343953926634992332820282019728792003956564819949 | false |
LowParse.Low.Sum.fst | LowParse.Low.Sum.serialize32_dsum_cases_t_if | val serialize32_dsum_cases_t_if
(t: dsum)
(f: (x: dsum_known_key t -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x))))
(sf: (x: dsum_known_key t -> Tot (serializer (dsnd (f x)))))
(#k': parser_kind)
(g: parser k' (dsum_type_of_unknown_tag t))
(sg: serializer g)
(k: dsum_known_key t)
: Tot (if_combinator _ (serialize32_dsum_cases_t_eq t f sf g sg k)) | val serialize32_dsum_cases_t_if
(t: dsum)
(f: (x: dsum_known_key t -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x))))
(sf: (x: dsum_known_key t -> Tot (serializer (dsnd (f x)))))
(#k': parser_kind)
(g: parser k' (dsum_type_of_unknown_tag t))
(sg: serializer g)
(k: dsum_known_key t)
: Tot (if_combinator _ (serialize32_dsum_cases_t_eq t f sf g sg k)) | let serialize32_dsum_cases_t_if
(t: dsum)
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(sf: (x: dsum_known_key t) -> Tot (serializer (dsnd (f x))))
(#k': parser_kind)
(g: parser k' (dsum_type_of_unknown_tag t))
(sg: serializer g)
(k: dsum_known_key t)
: Tot (if_combinator _ (serialize32_dsum_cases_t_eq t f sf g sg k))
= fun cond (sv_true: (cond_true cond -> Tot (serialize32_dsum_cases_t t f sf g sg k))) (sv_false: (cond_false cond -> Tot (serialize32_dsum_cases_t t f sf g sg k))) x #rrel #rel output pos ->
if cond
then (sv_true () x output pos)
else (sv_false () x output pos) | {
"file_name": "src/lowparse/LowParse.Low.Sum.fst",
"git_rev": "00217c4a89f5ba56002ba9aa5b4a9d5903bfe9fa",
"git_url": "https://github.com/project-everest/everparse.git",
"project_name": "everparse"
} | {
"end_col": 33,
"end_line": 1706,
"start_col": 0,
"start_line": 1694
} | module LowParse.Low.Sum
include LowParse.Low.Enum
include LowParse.Spec.Sum
module U32 = FStar.UInt32
module HST = FStar.HyperStack.ST
module B = LowStar.Buffer
module Cast = FStar.Int.Cast
module U64 = FStar.UInt64
inline_for_extraction
let validate_sum_cases_aux
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(vc: ((x: sum_key t) -> Tot (validator (dsnd (pc x)))))
(k: sum_key t)
: Tot (validator (parse_sum_cases t pc k))
= [@inline_let]
let _ = synth_sum_case_injective t k in
validate_synth
(validate_weaken
(weaken_parse_cases_kind t pc)
(vc k)
()
)
(synth_sum_case t k)
()
inline_for_extraction
let validate_sum_cases_t
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot Type
= validator (parse_sum_cases t pc k)
let validate_sum_cases_t_eq
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
(x y : validate_sum_cases_t t pc k)
: GTot Type0
= True
inline_for_extraction
let validate_sum_cases_t_if
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (if_combinator _ (validate_sum_cases_t_eq t pc k))
= fun cond (sv_true: cond_true cond -> Tot (validate_sum_cases_t t pc k)) (sv_false: cond_false cond -> Tot (validate_sum_cases_t t pc k)) #rrel #rel input pos ->
if cond
then sv_true () input pos
else sv_false () input pos
inline_for_extraction
let validate_sum_cases
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(vc: ((x: sum_key t) -> Tot (validator (dsnd (pc x)))))
(destr: dep_enum_destr (sum_enum t) (validate_sum_cases_t t pc))
(k: sum_key t)
: Tot (validator (parse_sum_cases t pc k))
= destr
_
(validate_sum_cases_t_if t pc)
(fun _ _ -> ())
(fun _ _ _ _ -> ())
(validate_sum_cases_aux t pc vc)
k
inline_for_extraction
let validate_sum_aux_payload_t
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
: Tot Type
= (#rrel: _) -> (#rel: _) ->
(input: slice rrel rel) ->
(pos: U64.t) ->
HST.Stack U64.t
(requires (fun h -> live_slice h input /\ U64.v pos <= U32.v input.len))
(ensures (fun h res h' ->
B.modifies B.loc_none h h' /\ (
match k with
| Unknown _ -> is_error res
| Known k' ->
if is_success res
then
valid_pos (dsnd (pc k')) h input (uint64_to_uint32 pos) (uint64_to_uint32 res)
else
(~ (valid (dsnd (pc k')) h input (uint64_to_uint32 pos)))
)))
let validate_sum_aux_payload_eq
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
: Tot (validate_sum_aux_payload_t t pc k -> validate_sum_aux_payload_t t pc k -> GTot Type0)
= fun _ _ -> True
inline_for_extraction
let validate_sum_aux_payload_if'
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
(cond: bool)
(ift: ((cond_true cond) -> Tot (validate_sum_aux_payload_t t pc k)))
(iff: ((cond_false cond) -> Tot (validate_sum_aux_payload_t t pc k)))
: Tot (validate_sum_aux_payload_t t pc k)
= fun #rrel #rel input pos ->
if cond
then begin
(ift () <: validate_sum_aux_payload_t t pc k) input pos
end else
(iff () <: validate_sum_aux_payload_t t pc k) input pos
inline_for_extraction
let validate_sum_aux_payload_if
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
: Tot (if_combinator _ (validate_sum_aux_payload_eq t pc k))
= validate_sum_aux_payload_if' t pc k
#push-options "--z3rlimit 64 --z3cliopt smt.arith.nl=false --using_facts_from '* -FStar.Int.Cast -LowParse.BitFields'"
// --query_stats --smtencoding.elim_box true --smtencoding.l_arith_repr native --z3refresh"
inline_for_extraction
let validate_sum_aux
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(v: validator p)
(p32: leaf_reader p)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(v_payload: ((k: sum_repr_type t)) -> Tot (validate_sum_aux_payload_t t pc (maybe_enum_key_of_repr (sum_enum t) k)))
: Tot (validator (parse_sum t p pc))
= fun #rrel #rel input pos ->
let h = HST.get () in
[@inline_let]
let _ = parse_sum_eq'' t p pc (bytes_of_slice_from h input (uint64_to_uint32 pos)) in
[@inline_let]
let _ = valid_facts (parse_sum t p pc) h input (uint64_to_uint32 pos) in
[@inline_let]
let _ = valid_facts p h input (uint64_to_uint32 pos) in
let len_after_tag = v input pos in
if is_error len_after_tag
then len_after_tag
else begin
let h1 = HST.get () in
let k' = p32 input (uint64_to_uint32 pos) in
[@inline_let]
let _ =
match maybe_enum_key_of_repr (sum_enum t) k' with
| Known k -> valid_facts (dsnd (pc k)) h input (uint64_to_uint32 len_after_tag)
| _ -> ()
in
v_payload k' input len_after_tag
end
#pop-options
inline_for_extraction
let validate_sum_aux_payload'
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (validator (dsnd (pc x)))))
(k: maybe_enum_key (sum_enum t))
: Tot (validate_sum_aux_payload_t t pc k)
= fun #rrel #rel input pos ->
match k with
| Known k ->
[@inline_let]
let _ = synth_sum_case_injective t k in
pc32 k input pos
// validate_synth (pc32 k) (synth_sum_case t k) () input pos
| _ -> validator_error_generic
inline_for_extraction
let validate_sum_aux_payload
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (validator (dsnd (pc x)))))
(destr: dep_maybe_enum_destr_t (sum_enum t) (validate_sum_aux_payload_t t pc))
(k: sum_repr_type t)
: Tot (validate_sum_aux_payload_t t pc (maybe_enum_key_of_repr (sum_enum t) k))
= destr (validate_sum_aux_payload_eq t pc) (validate_sum_aux_payload_if t pc) (fun _ _ -> ()) (fun _ _ _ _ -> ()) (validate_sum_aux_payload' t pc pc32) k
inline_for_extraction
let validate_sum
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(v: validator p)
(p32: leaf_reader p)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (validator (dsnd (pc x)))))
(destr: dep_maybe_enum_destr_t (sum_enum t) (validate_sum_aux_payload_t t pc))
: Tot (validator (parse_sum t p pc))
= validate_sum_aux t v p32 pc (validate_sum_aux_payload t pc pc32 destr)
module HS = FStar.HyperStack
#push-options "--z3rlimit 256 --z3cliopt smt.arith.nl=false --initial_ifuel 8 --max_ifuel 8 --initial_fuel 2 --max_fuel 2"
#restart-solver
let valid_sum_intro
(h: HS.mem)
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: Lemma
(requires (
valid (parse_enum_key p (sum_enum t)) h input pos /\ (
let k = contents (parse_enum_key p (sum_enum t)) h input pos in
valid (dsnd (pc k)) h input (get_valid_pos (parse_enum_key p (sum_enum t)) h input pos)
)))
(ensures (
let k = contents (parse_enum_key p (sum_enum t)) h input pos in
let pos_payload = get_valid_pos (parse_enum_key p (sum_enum t)) h input pos in
valid_content_pos
(parse_sum t p pc) h input pos
(synth_sum_case t k (contents (dsnd (pc k)) h input pos_payload))
(get_valid_pos (dsnd (pc k)) h input pos_payload)
))
= valid_facts (parse_enum_key p (sum_enum t)) h input pos;
let k = contents (parse_enum_key p (sum_enum t)) h input pos in
let pos_payload = get_valid_pos (parse_enum_key p (sum_enum t)) h input pos in
valid_facts (dsnd (pc k)) h input pos_payload;
valid_facts (parse_sum t p pc) h input pos;
parse_sum_eq t p pc (bytes_of_slice_from h input pos)
#pop-options
inline_for_extraction
let finalize_sum_case
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(s: serializer p)
(w: leaf_writer_strong s)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(destr: enum_repr_of_key'_t (sum_enum t))
(k: sum_key t)
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: HST.Stack unit
(requires (fun h ->
let len_tag = serialized_length (serialize_enum_key _ s (sum_enum t)) k in
U32.v pos + len_tag < 4294967296 /\ (
let pos_payload = pos `U32.add` U32.uint_to_t len_tag in
valid (dsnd (pc k)) h input pos_payload /\
writable input.base (U32.v pos) (U32.v pos_payload) h
)))
(ensures (fun h _ h' ->
let len_tag = serialized_length (serialize_enum_key _ s (sum_enum t)) k in
let pos_payload = pos `U32.add` U32.uint_to_t len_tag in
B.modifies (loc_slice_from_to input pos pos_payload) h h' /\
valid_content_pos (parse_sum t p pc) h' input pos (synth_sum_case t k (contents (dsnd (pc k)) h input pos_payload)) (get_valid_pos (dsnd (pc k)) h input pos_payload)
))
= let pos1 = write_enum_key w (sum_enum t) destr k input pos in
let h = HST.get () in
[@inline_let]
let _ = valid_sum_intro h t p pc input pos in
()
inline_for_extraction
let jump_sum_cases_aux
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(vc: ((x: sum_key t) -> Tot (jumper (dsnd (pc x)))))
(k: sum_key t)
: Tot (jumper (parse_sum_cases t pc k))
= [@inline_let]
let _ = synth_sum_case_injective t k in
jump_synth
(jump_weaken
(weaken_parse_cases_kind t pc)
(vc k)
()
)
(synth_sum_case t k)
()
inline_for_extraction
let jump_sum_cases_t
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot Type
= jumper (parse_sum_cases t pc k)
let jump_sum_cases_t_eq
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
(x y : jump_sum_cases_t t pc k)
: GTot Type0
= True
inline_for_extraction
let jump_sum_cases_t_if
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (if_combinator _ (jump_sum_cases_t_eq t pc k))
= fun cond (sv_true: cond_true cond -> Tot (jump_sum_cases_t t pc k)) (sv_false: cond_false cond -> Tot (jump_sum_cases_t t pc k)) #rrel #rel input pos ->
if cond
then sv_true () input pos
else sv_false () input pos
inline_for_extraction
let jump_sum_cases
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(vc: ((x: sum_key t) -> Tot (jumper (dsnd (pc x)))))
(destr: dep_enum_destr (sum_enum t) (jump_sum_cases_t t pc))
(k: sum_key t)
: Tot (jumper (parse_sum_cases t pc k))
= destr
_
(jump_sum_cases_t_if t pc)
(fun _ _ -> ())
(fun _ _ _ _ -> ())
(jump_sum_cases_aux t pc vc)
k
inline_for_extraction
let jump_sum_aux_payload_t
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
: Tot Type
= (#rrel: _) -> (#rel: _) ->
(input: slice rrel rel) ->
(pos: U32.t) ->
HST.Stack U32.t
(requires (fun h -> live_slice h input /\ U32.v pos <= U32.v input.len /\ (
match k with
| Unknown _ -> False
| Known k' -> valid (dsnd (pc k')) h input pos
)))
(ensures (fun h res h' ->
B.modifies B.loc_none h h' /\ (
match k with
| Unknown _ -> False
| Known k' ->
valid_pos (dsnd (pc k')) h input pos res
)))
let jump_sum_aux_payload_eq
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
: Tot (jump_sum_aux_payload_t t pc k -> jump_sum_aux_payload_t t pc k -> GTot Type0)
= fun _ _ -> True
inline_for_extraction
let jump_sum_aux_payload_if'
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
(cond: bool)
(ift: ((cond_true cond) -> Tot (jump_sum_aux_payload_t t pc k)))
(iff: ((cond_false cond) -> Tot (jump_sum_aux_payload_t t pc k)))
: Tot (jump_sum_aux_payload_t t pc k)
= fun #rrel #rel input pos ->
if cond
then begin
(ift () <: jump_sum_aux_payload_t t pc k) input pos
end else
(iff () <: jump_sum_aux_payload_t t pc k) input pos
inline_for_extraction
let jump_sum_aux_payload_if
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
: Tot (if_combinator _ (jump_sum_aux_payload_eq t pc k))
= jump_sum_aux_payload_if' t pc k
let parse_sum_eq3
(#kt: parser_kind)
(t: sum)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(input: bytes)
(k' : sum_repr_type t)
(consumed_k: consumed_length input)
: Lemma
(requires (Some? (parse (parse_sum t p pc) input) /\ parse p input == Some (k', consumed_k)))
(ensures (
let input_k = Seq.slice input consumed_k (Seq.length input) in
let k = maybe_enum_key_of_repr (sum_enum t) k' in
begin match k with
| Known k ->
Some? (parse (dsnd (pc k)) input_k)
| _ -> False
end
))
= parse_sum_eq'' t p pc input
let parse_sum_eq4
(#kt: parser_kind)
(t: sum)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(input: bytes)
(k' : sum_repr_type t)
(consumed_k: consumed_length input)
(consumed_payload: nat)
: Lemma
(requires (Some? (parse (parse_sum t p pc) input) /\ parse p input == Some (k', consumed_k) /\ (
let input_k = Seq.slice input consumed_k (Seq.length input) in
let k = maybe_enum_key_of_repr (sum_enum t) k' in
begin match k with
| Known k ->
Some? (parse (dsnd (pc k)) input_k) /\ (
let Some (_, consumed_payload') = parse (dsnd (pc k)) input_k in
consumed_payload' == consumed_payload
)
| _ -> False
end
)))
(ensures (
let Some (_, consumed) = parse (parse_sum t p pc) input in
consumed == consumed_k + consumed_payload
))
= parse_sum_eq'' t p pc input
#push-options "--z3rlimit 16"
let valid_sum_elim
(h: HS.mem)
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(#rrel: _) (#rel: _)
(input: slice rrel rel)
(pos: U32.t)
: Lemma
(requires (
valid (parse_sum t p pc) h input pos
))
(ensures (
valid p h input pos /\ (
let pos_payload = get_valid_pos p h input pos in
let k' = maybe_enum_key_of_repr (sum_enum t) (contents p h input pos) in
match k' with
| Known k ->
k == sum_tag_of_data t (contents (parse_sum t p pc) h input pos) /\
valid (dsnd (pc k)) h input pos_payload /\
valid_pos
(parse_sum t p pc) h input pos
(get_valid_pos (dsnd (pc k)) h input pos_payload)
| _ -> False
)))
= let sinput = bytes_of_slice_from h input pos in
let _ = parse_sum_eq'' t p pc sinput in
[@inline_let]
let _ = valid_facts (parse_sum t p pc) h input pos in
let Some (k', consumed_k) = parse p sinput in
let pos_after_tag = U32.uint_to_t (U32.v pos + consumed_k) in
[@inline_let]
let _ = valid_facts p h input pos in
assert (valid_content_pos p h input pos k' pos_after_tag);
match maybe_enum_key_of_repr (sum_enum t) k' with
| Known k -> valid_facts (dsnd (pc k)) h input pos_after_tag
| _ -> ()
#pop-options
let valid_sum_elim_tag
(h: HS.mem)
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: Lemma
(requires (
valid (parse_sum t p pc) h input pos
))
(ensures (
valid (parse_enum_key p (sum_enum t)) h input pos /\
contents (parse_enum_key p (sum_enum t)) h input pos == sum_tag_of_data t (contents (parse_sum t p pc) h input pos)
))
= let _ = parse_sum_eq' t p pc (bytes_of_slice_from h input pos) in
let _ = valid_facts (parse_sum t p pc) h input pos in
let _ = valid_facts (parse_enum_key p (sum_enum t)) h input pos in
()
inline_for_extraction
let read_sum_tag
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(p32: leaf_reader p)
(destr: dep_maybe_enum_destr_t (sum_enum t) (read_enum_key_t (sum_enum t)))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: HST.Stack (sum_key t)
(requires (fun h ->
valid (parse_sum t p pc) h input pos
))
(ensures (fun h res h' ->
B.modifies B.loc_none h h' /\
res == sum_tag_of_data t (contents (parse_sum t p pc) h input pos)
))
= let h = HST.get () in
[@inline_let] let _ = valid_sum_elim_tag h t p pc input pos in
read_enum_key p32 (sum_enum t) destr input pos
inline_for_extraction
let jump_sum_aux
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(v: jumper p)
(p32: leaf_reader p)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(v_payload: ((k: sum_repr_type t)) -> Tot (jump_sum_aux_payload_t t pc (maybe_enum_key_of_repr (sum_enum t) k)))
: Tot (jumper (parse_sum t p pc))
= fun #rrel #rel input pos ->
let h = HST.get () in
[@inline_let]
let _ = valid_sum_elim h t p pc input pos in
let pos_after_tag = v input pos in
let k' = p32 input pos in
v_payload k' input pos_after_tag
inline_for_extraction
let jump_sum_aux_payload'
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (jumper (dsnd (pc x)))))
(k: maybe_enum_key (sum_enum t))
: Tot (jump_sum_aux_payload_t t pc k)
= fun #rrel #rel input pos ->
match k with
| Known k ->
[@inline_let]
let _ = synth_sum_case_injective t k in
pc32 k input pos
| _ -> 0ul // dummy, but we MUST NOT remove this branch, otherwise extraction fails
inline_for_extraction
let jump_sum_aux_payload
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (jumper (dsnd (pc x)))))
(destr: dep_maybe_enum_destr_t (sum_enum t) (jump_sum_aux_payload_t t pc))
(k: sum_repr_type t)
: Tot (jump_sum_aux_payload_t t pc (maybe_enum_key_of_repr (sum_enum t) k))
= destr (jump_sum_aux_payload_eq t pc) (jump_sum_aux_payload_if t pc) (fun _ _ -> ()) (fun _ _ _ _ -> ()) (jump_sum_aux_payload' t pc pc32) k
inline_for_extraction
let jump_sum
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(v: jumper p)
(p32: leaf_reader p)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (jumper (dsnd (pc x)))))
(destr: dep_maybe_enum_destr_t (sum_enum t) (jump_sum_aux_payload_t t pc))
: Tot (jumper (parse_sum t p pc))
= jump_sum_aux t v p32 pc (jump_sum_aux_payload t pc pc32 destr)
inline_for_extraction
let read_sum_cases'
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (leaf_reader (dsnd (pc x)))))
(k: sum_key t)
: Tot (leaf_reader (parse_sum_cases' t pc k))
= [@inline_let]
let _ = synth_sum_case_injective t k in
read_synth'
(dsnd (pc k))
(synth_sum_case t k)
(pc32 k)
()
inline_for_extraction
let read_sum_cases_t
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot Type
= leaf_reader (parse_sum_cases' t pc k)
let read_sum_cases_t_eq
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
(x y : read_sum_cases_t t pc k)
: GTot Type0
= True
inline_for_extraction
let read_sum_cases_t_if
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (if_combinator _ (read_sum_cases_t_eq t pc k))
= fun cond (sv_true: cond_true cond -> Tot (read_sum_cases_t t pc k)) (sv_false: cond_false cond -> Tot (read_sum_cases_t t pc k)) #_ #_ input pos ->
if cond
then (sv_true () input pos)
else (sv_false () input pos)
inline_for_extraction
let read_sum_cases
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (leaf_reader (dsnd (pc x)))))
(destr: dep_enum_destr (sum_enum t) (read_sum_cases_t t pc))
(k: sum_key t)
: Tot (leaf_reader (parse_sum_cases' t pc k))
= destr
_
(read_sum_cases_t_if t pc)
(fun _ _ -> ())
(fun _ _ _ _ -> ())
(read_sum_cases' t pc pc32)
k
#push-options "--z3rlimit 32"
inline_for_extraction
let read_sum
(#kt: parser_kind)
(t: sum)
(p: parser kt (sum_repr_type t))
(p32: leaf_reader (parse_enum_key p (sum_enum t)))
(j: jumper p)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (leaf_reader (dsnd (pc x)))))
(destr: dep_enum_destr (sum_enum t) (read_sum_cases_t t pc))
: Tot (leaf_reader (parse_sum t p pc))
=
fun #_ #_ input pos ->
let h = HST.get () in
valid_facts (parse_sum t p pc) h input pos;
parse_sum_eq' t p pc (bytes_of_slice_from h input pos);
valid_facts (parse_enum_key p (sum_enum t)) h input pos;
let k = p32 input pos in
let pos' = jump_enum_key j (sum_enum t) input pos in
valid_facts (parse_sum_cases' t pc k) h input pos' ;
read_sum_cases t pc pc32 destr k input pos'
#pop-options
inline_for_extraction
let serialize32_sum_cases_t
(t: sum)
(#pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(sc: ((x: sum_key t) -> Tot (serializer (dsnd (pc x)))))
(k: sum_key t)
: Tot Type
= serializer32 (serialize_sum_cases t pc sc k)
let serialize32_sum_cases_t_eq
(t: sum)
(#pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(sc: ((x: sum_key t) -> Tot (serializer (dsnd (pc x)))))
(k: sum_key t)
(x y: serialize32_sum_cases_t t sc k)
: GTot Type0
= True
inline_for_extraction
let serialize32_sum_cases_t_if
(t: sum)
(#pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(sc: ((x: sum_key t) -> Tot (serializer (dsnd (pc x)))))
(k: sum_key t)
: Tot (if_combinator _ (serialize32_sum_cases_t_eq t sc k))
= fun cond (sv_true: (cond_true cond -> Tot (serialize32_sum_cases_t t sc k))) (sv_false: (cond_false cond -> Tot (serialize32_sum_cases_t t sc k))) x #rrel #rel b pos ->
if cond
then (sv_true () x b pos)
else (sv_false () x b pos)
inline_for_extraction
let serialize32_sum_cases_aux
(t: sum)
(#pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(sc: ((x: sum_key t) -> Tot (serializer (dsnd (pc x)))))
(sc32: ((x: sum_key t) -> Tot (serializer32 (sc x))))
(k: sum_key t)
: Tot (serializer32 (serialize_sum_cases t pc sc k))
= fun x #rrel #rel b pos ->
[@inline_let] let _ =
Classical.forall_intro (parse_sum_cases_eq' t pc k);
synth_sum_case_injective t k;
synth_sum_case_inverse t k
in
serialize32_synth
(sc32 k)
(synth_sum_case t k)
(synth_sum_case_recip t k)
(fun x -> synth_sum_case_recip t k x)
()
x
b
pos
inline_for_extraction
let serialize32_sum_cases
(t: sum)
(#pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(sc: ((x: sum_key t) -> Tot (serializer (dsnd (pc x)))))
(sc32: ((x: sum_key t) -> Tot (serializer32 (sc x))))
(destr: dep_enum_destr (sum_enum t) (serialize32_sum_cases_t t sc))
(k: sum_key t)
: Tot (serializer32 (serialize_sum_cases t pc sc k))
= destr
_
(serialize32_sum_cases_t_if t sc)
(fun _ _ -> ())
(fun _ _ _ _ -> ())
(serialize32_sum_cases_aux t sc sc32)
k
inline_for_extraction
let serialize32_sum
(#kt: parser_kind)
(t: sum)
(#p: parser kt (sum_repr_type t))
(s: serializer p {kt.parser_kind_subkind == Some ParserStrong})
(s32: serializer32 (serialize_enum_key _ s (sum_enum t)))
(#pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(sc: ((x: sum_key t) -> Tot (serializer (dsnd (pc x)))))
(sc32: ((x: sum_key t) -> Tot (serializer32 (sc x))))
(destr: dep_enum_destr (sum_enum t) (serialize32_sum_cases_t t sc))
: Tot (serializer32 (serialize_sum t s sc))
= fun x #rrel #rel b pos ->
serialize_sum_eq t s sc x;
let tg = sum_tag_of_data t x in
serialize32_nondep_then_aux s32 (serialize32_sum_cases t sc sc32 destr tg) tg x b pos
let clens_sum_tag
(s: sum)
: Tot (clens (sum_type s) (sum_key s))
= {
clens_cond = (fun _ -> True);
clens_get = sum_tag_of_data s;
}
let gaccessor_sum_tag
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
: Tot (gaccessor (parse_sum t p pc) (parse_enum_key p (sum_enum t)) (clens_sum_tag t))
= gaccessor_tagged_union_tag
(parse_enum_key p (sum_enum t))
(sum_tag_of_data t)
(parse_sum_cases t pc)
inline_for_extraction
let accessor_sum_tag
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
: Tot (accessor (gaccessor_sum_tag t p pc))
= accessor_tagged_union_tag
(parse_enum_key p (sum_enum t))
(sum_tag_of_data t)
(parse_sum_cases t pc)
let clens_sum_payload
(s: sum)
(k: sum_key s)
: Tot (clens (sum_type s) (sum_type_of_tag s k))
= {
clens_cond = (fun (x: sum_type s) -> sum_tag_of_data s x == k);
clens_get = (fun (x: sum_type s) -> synth_sum_case_recip s k x <: Ghost (sum_type_of_tag s k) (requires (sum_tag_of_data s x == k)) (ensures (fun _ -> True)));
}
#push-options "--z3rlimit 32"
let gaccessor_clens_sum_payload'
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (gaccessor' (parse_sum t p pc) (dsnd (pc k)) (clens_sum_payload t k))
= fun (input: bytes) ->
parse_sum_eq'' t p pc input;
let res =
match parse p input with
| Some (_, consumed) ->
synth_sum_case_inverse t k;
synth_sum_case_injective t k;
synth_injective_synth_inverse_synth_inverse_recip (synth_sum_case t k) (synth_sum_case_recip t k) ();
(consumed)
| _ -> 0 // dummy
in
(res <: (res: _ { gaccessor_post' (parse_sum t p pc) (dsnd (pc k)) (clens_sum_payload t k) input res } ))
#push-options "--z3rlimit 64"
let gaccessor_clens_sum_payload_injective
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
(sl sl' : bytes)
: Lemma
(requires (
gaccessor_pre (parse_sum t p pc) (dsnd (pc k)) (clens_sum_payload t k) sl /\
gaccessor_pre (parse_sum t p pc) (dsnd (pc k)) (clens_sum_payload t k) sl' /\
injective_precond (parse_sum t p pc) sl sl'
))
(ensures (gaccessor_clens_sum_payload' t p pc k sl == gaccessor_clens_sum_payload' t p pc k sl'))
= parse_sum_eq'' t p pc sl;
parse_sum_eq'' t p pc sl' ;
parse_injective (parse_sum t p pc) sl sl' ;
parse_injective p sl sl'
#pop-options
let gaccessor_clens_sum_payload_no_lookahead
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
(sl sl' : bytes)
: Lemma
(requires (
(parse_sum_kind kt t pc).parser_kind_subkind == Some ParserStrong /\
gaccessor_pre (parse_sum t p pc) (dsnd (pc k)) (clens_sum_payload t k) sl /\
gaccessor_pre (parse_sum t p pc) (dsnd (pc k)) (clens_sum_payload t k) sl' /\
no_lookahead_on_precond (parse_sum t p pc) sl sl'
))
(ensures (gaccessor_clens_sum_payload' t p pc k sl == gaccessor_clens_sum_payload' t p pc k sl'))
= parse_sum_eq'' t p pc sl;
parse_sum_eq'' t p pc sl' ;
parse_strong_prefix (parse_sum t p pc) sl sl' ;
parse_injective p sl sl'
let gaccessor_clens_sum_payload
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (gaccessor (parse_sum t p pc) (dsnd (pc k)) (clens_sum_payload t k))
= Classical.forall_intro_2 (fun x -> Classical.move_requires (gaccessor_clens_sum_payload_injective t p pc k x));
Classical.forall_intro_2 (fun x -> Classical.move_requires (gaccessor_clens_sum_payload_no_lookahead t p pc k x));
gaccessor_prop_equiv (parse_sum t p pc) (dsnd (pc k)) (clens_sum_payload t k) (gaccessor_clens_sum_payload' t p pc k);
gaccessor_clens_sum_payload' t p pc k
inline_for_extraction
let accessor_clens_sum_payload'
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(j: jumper p)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: HST.Stack U32.t
(requires (fun h ->
valid (parse_sum t p pc) h input pos /\
(clens_sum_payload t k).clens_cond (contents (parse_sum t p pc) h input pos)
))
(ensures (fun h pos' h' ->
B.modifies B.loc_none h h' /\
pos' == slice_access h (gaccessor_clens_sum_payload t p pc k) input pos
))
=
let h = HST.get () in
[@inline_let]
let _ =
let pos' = get_valid_pos (parse_sum t p pc) h input pos in
let large = bytes_of_slice_from h input pos in
slice_access_eq h (gaccessor_clens_sum_payload t p pc k) input pos;
valid_facts (parse_sum t p pc) h input pos;
parse_sum_eq'' t p pc large;
valid_facts p h input pos
in
j input pos
#pop-options
inline_for_extraction
let accessor_clens_sum_payload
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(j: jumper p)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (accessor (gaccessor_clens_sum_payload t p pc k))
= fun #rrel #rel -> accessor_clens_sum_payload' t j pc k #rrel #rel
let clens_sum_cases_payload
(s: sum)
(k: sum_key s)
: Tot (clens (sum_cases s k) (sum_type_of_tag s k))
= {
clens_cond = (fun (x: sum_cases s k) -> True);
clens_get = (fun (x: sum_cases s k) -> synth_sum_case_recip s k x <: Ghost (sum_type_of_tag s k) (requires (True)) (ensures (fun _ -> True)));
}
let gaccessor_clens_sum_cases_payload
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (gaccessor (parse_sum_cases' t pc k) (dsnd (pc k)) (clens_sum_cases_payload t k))
= synth_sum_case_injective t k;
synth_sum_case_inverse t k;
synth_injective_synth_inverse_synth_inverse_recip (synth_sum_case t k) (synth_sum_case_recip t k) ();
gaccessor_ext
(gaccessor_synth (dsnd (pc k)) (synth_sum_case t k) (synth_sum_case_recip t k) ())
(clens_sum_cases_payload t k)
()
inline_for_extraction
let accessor_clens_sum_cases_payload
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (accessor (gaccessor_clens_sum_cases_payload t pc k))
= [@inline_let]
let _ =
synth_sum_case_injective t k;
synth_sum_case_inverse t k;
synth_injective_synth_inverse_synth_inverse_recip (synth_sum_case t k) (synth_sum_case_recip t k) ()
in
accessor_ext
(accessor_synth (dsnd (pc k)) (synth_sum_case t k) (synth_sum_case_recip t k) ())
(clens_sum_cases_payload t k)
()
inline_for_extraction
let validate_dsum_cases_t
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(#k: parser_kind)
(g: parser k (dsum_type_of_unknown_tag s))
(x: dsum_key s)
: Tot Type
= validator (parse_dsum_cases' s f g x)
let validate_dsum_cases_eq
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(#k: parser_kind)
(g: parser k (dsum_type_of_unknown_tag s))
(x: dsum_key s)
(v1 v2 : validate_dsum_cases_t s f g x)
: GTot Type0
= True
inline_for_extraction
let validate_dsum_cases_if'
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(#k: parser_kind)
(g: parser k (dsum_type_of_unknown_tag s))
(x: dsum_key s)
(cond: bool)
(ift: (cond_true cond -> Tot (validate_dsum_cases_t s f g x)))
(iff: (cond_false cond -> Tot (validate_dsum_cases_t s f g x)))
: Tot (validate_dsum_cases_t s f g x)
= fun #rrel #rel input len ->
if cond
then (ift () <: validate_dsum_cases_t s f g x) input len
else (iff () <: validate_dsum_cases_t s f g x) input len
inline_for_extraction
let validate_dsum_cases_if
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(#k: parser_kind)
(g: parser k (dsum_type_of_unknown_tag s))
(x: dsum_key s)
: Tot (if_combinator _ (validate_dsum_cases_eq s f g x))
= validate_dsum_cases_if' s f g x
inline_for_extraction
let validate_dsum_cases'
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(f' : (x: dsum_known_key s) -> Tot (validator (dsnd (f x))))
(#k: parser_kind)
(#g: parser k (dsum_type_of_unknown_tag s))
(g' : validator g)
(x: dsum_key s)
: Tot (validate_dsum_cases_t s f g x)
= [@inline_let]
let _ = synth_dsum_case_injective s x in
match x with
| Known x' -> validate_synth (f' x') (synth_dsum_case s (Known x')) () <: validator (parse_dsum_cases' s f g x)
| Unknown x' -> validate_synth g' (synth_dsum_case s (Unknown x')) () <: validator (parse_dsum_cases' s f g x)
inline_for_extraction
let validate_dsum_cases'_destr
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(f' : (x: dsum_known_key s) -> Tot (validator (dsnd (f x))))
(#k: parser_kind)
(#g: parser k (dsum_type_of_unknown_tag s))
(g' : validator g)
(destr: dep_enum_destr _ (fun k -> validate_dsum_cases_t s f g (Known k)))
(x: dsum_key s)
: Tot (validate_dsum_cases_t s f g x)
= fun #rrel #rel input pos ->
match x with
| Known k ->
destr
_
(fun k -> validate_dsum_cases_if s f g (Known k))
(fun _ _ -> ())
(fun _ _ _ _ -> ())
(fun k -> validate_dsum_cases' s f f' g' (Known k))
k
input
pos
| Unknown r -> validate_dsum_cases' s f f' g' (Unknown r) input pos
inline_for_extraction
let validate_dsum_cases
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(f' : (x: dsum_known_key s) -> Tot (validator (dsnd (f x))))
(#k: parser_kind)
(#g: parser k (dsum_type_of_unknown_tag s))
(g' : validator g)
(destr: dep_enum_destr _ (fun k -> validate_dsum_cases_t s f g (Known k)))
(x: dsum_key s)
: Tot (validator (parse_dsum_cases s f g x))
= fun #rrel #rel input pos ->
let h = HST.get () in
[@inline_let]
let _ =
valid_facts (parse_dsum_cases' s f g x) h input (uint64_to_uint32 pos);
valid_facts (parse_dsum_cases s f g x) h input (uint64_to_uint32 pos);
parse_dsum_cases_eq' s f g x (bytes_of_slice_from h input (uint64_to_uint32 pos))
in
validate_dsum_cases'_destr s f f' g' destr x input pos
#push-options "--z3rlimit 40"
inline_for_extraction
let validate_dsum
(#kt: parser_kind)
(t: dsum)
(#p: parser kt (dsum_repr_type t))
(v: validator p)
(p32: leaf_reader p)
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(f32: (x: dsum_known_key t) -> Tot (validator (dsnd (f x))))
(#k': parser_kind)
(#g: parser k' (dsum_type_of_unknown_tag t))
(g32: validator g)
(destr: dep_maybe_enum_destr_t (dsum_enum t) (validate_dsum_cases_t t f g))
: Tot (validator (parse_dsum t p f g))
= fun #rrel #rel input pos ->
let h = HST.get () in
[@inline_let]
let _ = parse_dsum_eq' t p f g (bytes_of_slice_from h input (uint64_to_uint32 pos)) in
[@inline_let]
let _ = valid_facts (parse_dsum t p f g) h input (uint64_to_uint32 pos) in
[@inline_let]
let _ = valid_facts p h input (uint64_to_uint32 pos) in
let pos_after_tag = v input pos in
if is_error pos_after_tag
then pos_after_tag
else
let tg = p32 input (uint64_to_uint32 pos) in
[@inline_let]
let _ = valid_facts (parse_dsum_cases' t f g (maybe_enum_key_of_repr (dsum_enum t) tg)) h input (uint64_to_uint32 pos_after_tag) in
destr (validate_dsum_cases_eq t f g) (validate_dsum_cases_if t f g) (fun _ _ -> ()) (fun _ _ _ _ -> ()) (validate_dsum_cases' t f f32 g32) tg input pos_after_tag
#pop-options
#reset-options "--z3rlimit 64 --z3cliopt smt.arith.nl=false --initial_ifuel 8 --max_ifuel 8 --initial_fuel 2 --max_fuel 2"
let valid_dsum_intro_known
(h: HS.mem)
(t: dsum)
(#kt: parser_kind)
(p: parser kt (dsum_repr_type t))
(f: ((x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x))))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: Lemma
(requires (
valid (parse_maybe_enum_key p (dsum_enum t)) h input pos /\ (
let k' = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
Known? k' /\ (
let Known k = k' in
valid (dsnd (f k)) h input (get_valid_pos (parse_maybe_enum_key p (dsum_enum t)) h input pos)
))))
(ensures (
let Known k = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
let pos_payload = get_valid_pos (parse_maybe_enum_key p (dsum_enum t)) h input pos in
valid_content_pos
(parse_dsum t p f g) h input pos
(synth_dsum_case t (Known k) (contents (dsnd (f k)) h input pos_payload))
(get_valid_pos (dsnd (f k)) h input pos_payload)
))
= valid_facts (parse_maybe_enum_key p (dsum_enum t)) h input pos;
let Known k = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
let pos_payload = get_valid_pos (parse_maybe_enum_key p (dsum_enum t)) h input pos in
valid_facts (dsnd (f k)) h input pos_payload;
valid_facts (parse_dsum t p f g) h input pos;
parse_dsum_eq t p f g (bytes_of_slice_from h input pos)
let valid_dsum_intro_unknown
(h: HS.mem)
(t: dsum)
(#kt: parser_kind)
(p: parser kt (dsum_repr_type t))
(f: ((x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x))))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: Lemma
(requires (
valid (parse_maybe_enum_key p (dsum_enum t)) h input pos /\ (
let k' = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
Unknown? k' /\
valid g h input (get_valid_pos (parse_maybe_enum_key p (dsum_enum t)) h input pos)
)))
(ensures (
let Unknown r = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
let pos_payload = get_valid_pos (parse_maybe_enum_key p (dsum_enum t)) h input pos in
valid_content_pos
(parse_dsum t p f g) h input pos
(synth_dsum_case t (Unknown r) (contents g h input pos_payload))
(get_valid_pos g h input pos_payload)
))
= valid_facts (parse_maybe_enum_key p (dsum_enum t)) h input pos;
let Unknown r = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
let pos_payload = get_valid_pos (parse_maybe_enum_key p (dsum_enum t)) h input pos in
valid_facts g h input pos_payload;
valid_facts (parse_dsum t p f g) h input pos;
parse_dsum_eq t p f g (bytes_of_slice_from h input pos)
#reset-options
inline_for_extraction
let finalize_dsum_case_known
(t: dsum)
(#kt: parser_kind)
(#p: parser kt (dsum_repr_type t))
(s: serializer p)
(w: leaf_writer_strong s)
(f: ((x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x))))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
(destr: enum_repr_of_key'_t (dsum_enum t))
(k: dsum_known_key t)
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: HST.Stack unit
(requires (fun h ->
let len_tag = serialized_length (serialize_enum_key _ s (dsum_enum t)) k in
U32.v pos + len_tag < 4294967296 /\ (
let pos_payload = pos `U32.add` U32.uint_to_t len_tag in
valid (dsnd (f k)) h input pos_payload /\
writable input.base (U32.v pos) (U32.v pos_payload) h
)))
(ensures (fun h _ h' ->
let len_tag = serialized_length (serialize_enum_key _ s (dsum_enum t)) k in
let pos_payload = pos `U32.add` U32.uint_to_t len_tag in
B.modifies (loc_slice_from_to input pos pos_payload) h h' /\
valid_content_pos (parse_dsum t p f g) h' input pos (synth_dsum_case t (Known k) (contents (dsnd (f k)) h input pos_payload)) (get_valid_pos (dsnd (f k)) h input pos_payload)
))
= let pos1 = write_enum_key w (dsum_enum t) destr k input pos in
let h = HST.get () in
[@inline_let]
let _ =
valid_facts (parse_enum_key p (dsum_enum t)) h input pos;
valid_facts (parse_maybe_enum_key p (dsum_enum t)) h input pos;
let sq = bytes_of_slice_from h input pos in
parse_enum_key_eq p (dsum_enum t) sq;
parse_maybe_enum_key_eq p (dsum_enum t) sq;
valid_dsum_intro_known h t p f g input pos
in
()
inline_for_extraction
let finalize_dsum_case_unknown
(t: dsum)
(#kt: parser_kind)
(#p: parser kt (dsum_repr_type t))
(s: serializer p)
(w: leaf_writer_strong s)
(f: ((x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x))))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
(r: unknown_enum_repr (dsum_enum t))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: HST.Stack unit
(requires (fun h ->
let len_tag = serialized_length s r in
U32.v pos + len_tag < 4294967296 /\ (
let pos_payload = pos `U32.add` U32.uint_to_t len_tag in
valid g h input pos_payload /\
writable input.base (U32.v pos) (U32.v pos_payload) h
)))
(ensures (fun h _ h' ->
let len_tag = serialized_length s r in
let pos_payload = pos `U32.add` U32.uint_to_t len_tag in
B.modifies (loc_slice_from_to input pos pos_payload) h h' /\
valid_content_pos (parse_dsum t p f g) h' input pos (synth_dsum_case t (Unknown r) (contents g h input pos_payload)) (get_valid_pos g h input pos_payload)
))
= let pos1 = w r input pos in
let h = HST.get () in
[@inline_let]
let _ =
valid_facts (parse_maybe_enum_key p (dsum_enum t)) h input pos;
valid_facts p h input pos;
let sq = bytes_of_slice_from h input pos in
parse_maybe_enum_key_eq p (dsum_enum t) sq;
valid_dsum_intro_unknown h t p f g input pos
in
()
let valid_dsum_elim_tag
(h: HS.mem)
(t: dsum)
(#kt: parser_kind)
(p: parser kt (dsum_repr_type t))
(f: ((x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x))))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: Lemma
(requires (
valid (parse_dsum t p f g) h input pos
))
(ensures (
valid (parse_maybe_enum_key p (dsum_enum t)) h input pos /\
contents (parse_maybe_enum_key p (dsum_enum t)) h input pos == dsum_tag_of_data t (contents (parse_dsum t p f g) h input pos)
))
= let _ = parse_dsum_eq_ t p f g (bytes_of_slice_from h input pos) in
let _ = valid_facts (parse_dsum t p f g) h input pos in
let _ = valid_facts (parse_maybe_enum_key p (dsum_enum t)) h input pos in
()
inline_for_extraction
let read_dsum_tag
(t: dsum)
(#kt: parser_kind)
(#p: parser kt (dsum_repr_type t))
(p32: leaf_reader p)
(destr: maybe_enum_destr_t (maybe_enum_key (dsum_enum t)) (dsum_enum t))
(f: ((x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x))))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: HST.Stack (dsum_key t)
(requires (fun h ->
valid (parse_dsum t p f g) h input pos
))
(ensures (fun h res h' ->
B.modifies B.loc_none h h' /\
res == dsum_tag_of_data t (contents (parse_dsum t p f g) h input pos)
))
= let h = HST.get () in
[@inline_let] let _ = valid_dsum_elim_tag h t p f g input pos in
read_maybe_enum_key p32 (dsum_enum t) destr input pos
#push-options "--z3rlimit 32"
let valid_dsum_elim_known
(h: HS.mem)
(t: dsum)
(#kt: parser_kind)
(p: parser kt (dsum_repr_type t))
(f: ((x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x))))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: Lemma
(requires (
valid (parse_dsum t p f g) h input pos /\
Known? (dsum_tag_of_data t (contents (parse_dsum t p f g) h input pos))
))
(ensures (
valid (parse_maybe_enum_key p (dsum_enum t)) h input pos /\ (
let k' = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
let pos_payload = get_valid_pos (parse_maybe_enum_key p (dsum_enum t)) h input pos in
Known? k' /\ (
let Known k = k' in
valid (dsnd (f k)) h input pos_payload /\
valid_content_pos
(parse_dsum t p f g) h input pos
(synth_dsum_case t (Known k) (contents (dsnd (f k)) h input pos_payload))
(get_valid_pos (dsnd (f k)) h input pos_payload)
))))
=
valid_facts (parse_dsum t p f g) h input pos;
parse_dsum_eq t p f g (bytes_of_slice_from h input pos);
valid_facts (parse_maybe_enum_key p (dsum_enum t)) h input pos;
let Known k = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
let pos_payload = get_valid_pos (parse_maybe_enum_key p (dsum_enum t)) h input pos in
valid_facts (dsnd (f k)) h input pos_payload
#pop-options
let valid_dsum_elim_unknown
(h: HS.mem)
(t: dsum)
(#kt: parser_kind)
(p: parser kt (dsum_repr_type t))
(f: ((x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x))))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: Lemma
(requires (
valid (parse_dsum t p f g) h input pos /\
Unknown? (dsum_tag_of_data t (contents (parse_dsum t p f g) h input pos))
))
(ensures (
valid (parse_maybe_enum_key p (dsum_enum t)) h input pos /\ (
let k' = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
let pos_payload = get_valid_pos (parse_maybe_enum_key p (dsum_enum t)) h input pos in
Unknown? k' /\ (
let Unknown r = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
valid g h input pos_payload /\
valid_content_pos
(parse_dsum t p f g) h input pos
(synth_dsum_case t (Unknown r) (contents g h input pos_payload))
(get_valid_pos g h input pos_payload)
))))
=
valid_facts (parse_dsum t p f g) h input pos;
parse_dsum_eq t p f g (bytes_of_slice_from h input pos);
valid_facts (parse_maybe_enum_key p (dsum_enum t)) h input pos;
let Unknown r = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
let pos_payload = get_valid_pos (parse_maybe_enum_key p (dsum_enum t)) h input pos in
valid_facts g h input pos_payload
inline_for_extraction
let jump_dsum_cases_t
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(#k: parser_kind)
(g: parser k (dsum_type_of_unknown_tag s))
(x: dsum_key s)
: Tot Type
= jumper (parse_dsum_cases' s f g x)
let jump_dsum_cases_eq
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(#k: parser_kind)
(g: parser k (dsum_type_of_unknown_tag s))
(x: dsum_key s)
(v1 v2 : jump_dsum_cases_t s f g x)
: GTot Type0
= True
inline_for_extraction
let jump_dsum_cases_if'
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(#k: parser_kind)
(g: parser k (dsum_type_of_unknown_tag s))
(x: dsum_key s)
(cond: bool)
(ift: (cond_true cond -> Tot (jump_dsum_cases_t s f g x)))
(iff: (cond_false cond -> Tot (jump_dsum_cases_t s f g x)))
: Tot (jump_dsum_cases_t s f g x)
= fun #rrel #rel input len ->
if cond
then (ift () <: jump_dsum_cases_t s f g x) input len
else (iff () <: jump_dsum_cases_t s f g x) input len
inline_for_extraction
let jump_dsum_cases_if
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(#k: parser_kind)
(g: parser k (dsum_type_of_unknown_tag s))
(x: dsum_key s)
: Tot (if_combinator _ (jump_dsum_cases_eq s f g x))
= jump_dsum_cases_if' s f g x
inline_for_extraction
let jump_dsum_cases'
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(f' : (x: dsum_known_key s) -> Tot (jumper (dsnd (f x))))
(#k: parser_kind)
(#g: parser k (dsum_type_of_unknown_tag s))
(g' : jumper g)
(x: dsum_key s)
: Tot (jump_dsum_cases_t s f g x)
= synth_dsum_case_injective s x;
match x with
| Known x' -> jump_synth (f' x') (synth_dsum_case s (Known x')) () <: jumper (parse_dsum_cases' s f g x)
| Unknown x' -> jump_synth g' (synth_dsum_case s (Unknown x')) () <: jumper (parse_dsum_cases' s f g x)
inline_for_extraction
let jump_dsum_cases'_destr
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(f' : (x: dsum_known_key s) -> Tot (jumper (dsnd (f x))))
(#k: parser_kind)
(#g: parser k (dsum_type_of_unknown_tag s))
(g' : jumper g)
(destr: dep_enum_destr _ (fun k -> jump_dsum_cases_t s f g (Known k)))
(x: dsum_key s)
: Tot (jump_dsum_cases_t s f g x)
= fun #rrel #rel input pos ->
match x with
| Known k ->
destr
_
(fun k -> jump_dsum_cases_if s f g (Known k))
(fun _ _ -> ())
(fun _ _ _ _ -> ())
(fun k -> jump_dsum_cases' s f f' g' (Known k))
k
input
pos
| Unknown r -> jump_dsum_cases' s f f' g' (Unknown r) input pos
inline_for_extraction
let jump_dsum_cases
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(f' : (x: dsum_known_key s) -> Tot (jumper (dsnd (f x))))
(#k: parser_kind)
(#g: parser k (dsum_type_of_unknown_tag s))
(g' : jumper g)
(destr: dep_enum_destr _ (fun k -> jump_dsum_cases_t s f g (Known k)))
(x: dsum_key s)
: Tot (jumper (parse_dsum_cases s f g x))
= fun #rrel #rel input pos ->
let h = HST.get () in
[@inline_let]
let _ =
valid_facts (parse_dsum_cases' s f g x) h input pos;
valid_facts (parse_dsum_cases s f g x) h input pos;
parse_dsum_cases_eq' s f g x (bytes_of_slice_from h input pos)
in
jump_dsum_cases'_destr s f f' g' destr x input pos
#push-options "--z3rlimit 16"
inline_for_extraction
let jump_dsum
(#kt: parser_kind)
(t: dsum)
(#p: parser kt (dsum_repr_type t))
(v: jumper p)
(p32: leaf_reader p)
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(f32: (x: dsum_known_key t) -> Tot (jumper (dsnd (f x))))
(#k': parser_kind)
(#g: parser k' (dsum_type_of_unknown_tag t))
(g32: jumper g)
(destr: dep_maybe_enum_destr_t (dsum_enum t) (jump_dsum_cases_t t f g))
: Tot (jumper (parse_dsum t p f g))
= fun #rrel #rel input pos ->
let h = HST.get () in
[@inline_let]
let _ = parse_dsum_eq' t p f g (bytes_of_slice_from h input pos) in
[@inline_let]
let _ = valid_facts (parse_dsum t p f g) h input pos in
[@inline_let]
let _ = valid_facts p h input pos in
let pos_after_tag = v input pos in
let tg = p32 input pos in
[@inline_let]
let _ = valid_facts (parse_dsum_cases' t f g (maybe_enum_key_of_repr (dsum_enum t) tg)) h input pos_after_tag in
destr (jump_dsum_cases_eq t f g) (jump_dsum_cases_if t f g) (fun _ _ -> ()) (fun _ _ _ _ -> ()) (jump_dsum_cases' t f f32 g32) tg input pos_after_tag
#pop-options
inline_for_extraction
let read_dsum_cases'
(t: dsum)
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(f32: (x: dsum_known_key t) -> Tot (leaf_reader (dsnd (f x))))
(#k': parser_kind)
(g: parser k' (dsum_type_of_unknown_tag t))
(g32: leaf_reader g)
(x: dsum_key t)
: Tot (leaf_reader (parse_dsum_cases' t f g x))
= fun #rrel #rel input pos ->
[@inline_let]
let _ = synth_dsum_case_injective t x in
match x with
| Known x' ->
read_synth'
(dsnd (f x'))
(synth_dsum_case t (Known x'))
(f32 x')
()
input
pos
| Unknown x' ->
read_synth'
g
(synth_dsum_case t (Unknown x'))
g32
()
input
pos
inline_for_extraction
let read_dsum_cases_t
(t: dsum)
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(#k': parser_kind)
(g: parser k' (dsum_type_of_unknown_tag t))
(k: dsum_known_key t)
: Tot Type
= leaf_reader (parse_dsum_cases' t f g (Known k))
let read_dsum_cases_t_eq
(t: dsum)
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(#k': parser_kind)
(g: parser k' (dsum_type_of_unknown_tag t))
(k: dsum_known_key t)
(x y : read_dsum_cases_t t f g k)
: GTot Type0
= True
inline_for_extraction
let read_dsum_cases_t_if
(t: dsum)
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(#k': parser_kind)
(g: parser k' (dsum_type_of_unknown_tag t))
(k: dsum_known_key t)
: Tot (if_combinator _ (read_dsum_cases_t_eq t f g k))
= fun cond (sv_true: cond_true cond -> Tot (read_dsum_cases_t t f g k)) (sv_false: cond_false cond -> Tot (read_dsum_cases_t t f g k)) #_ #_ input pos ->
if cond
then sv_true () input pos
else sv_false () input pos
inline_for_extraction
let read_dsum_cases
(t: dsum)
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(f32: (x: dsum_known_key t) -> Tot (leaf_reader (dsnd (f x))))
(#k': parser_kind)
(g: parser k' (dsum_type_of_unknown_tag t))
(g32: leaf_reader g)
(destr: dep_enum_destr _ (read_dsum_cases_t t f g))
(x: dsum_key t)
: Tot (leaf_reader (parse_dsum_cases' t f g x))
= fun #_ #_ input pos ->
match x with
| Known k ->
destr
_
(read_dsum_cases_t_if t f g)
(fun _ _ -> ())
(fun _ _ _ _ -> ())
(fun k -> read_dsum_cases' t f f32 g g32 (Known k))
k
input
pos
| Unknown r ->
read_dsum_cases' t f f32 g g32 (Unknown r) input pos
#push-options "--z3rlimit 16"
inline_for_extraction
let read_dsum
(#kt: parser_kind)
(t: dsum)
(#p: parser kt (dsum_repr_type t))
(p32: leaf_reader (parse_maybe_enum_key p (dsum_enum t)))
(j: jumper p)
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(f32: (x: dsum_known_key t) -> Tot (leaf_reader (dsnd (f x))))
(#k': parser_kind)
(#g: parser k' (dsum_type_of_unknown_tag t))
(g32: leaf_reader g)
(destr: dep_enum_destr _ (read_dsum_cases_t t f g))
: Tot (leaf_reader (parse_dsum t p f g))
= fun #_ #_ input pos ->
let h = HST.get () in
valid_facts (parse_dsum t p f g) h input pos;
parse_dsum_eq_ t p f g (bytes_of_slice_from h input pos);
valid_facts (parse_maybe_enum_key p (dsum_enum t)) h input pos;
let k = p32 input pos in
let pos' = jump_maybe_enum_key j (dsum_enum t) input pos in
valid_facts (parse_dsum_cases' t f g k) h input pos' ;
read_dsum_cases t f f32 g g32 destr k input pos'
#pop-options
inline_for_extraction
let serialize32_dsum_type_of_tag
(t: dsum)
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(sf: (x: dsum_known_key t) -> Tot (serializer (dsnd (f x))))
(sf32: (x: dsum_known_key t) -> Tot (serializer32 (sf x)))
(#k': parser_kind)
(#g: parser k' (dsum_type_of_unknown_tag t))
(#sg: serializer g)
(sg32: serializer32 sg)
(tg: dsum_key t)
: Tot (serializer32 (serialize_dsum_type_of_tag t f sf g sg tg))
= match tg with
| Known x' -> serialize32_ext (dsnd (f x')) (sf x') (sf32 x') (parse_dsum_type_of_tag t f g tg) ()
| Unknown x' -> serialize32_ext g sg sg32 (parse_dsum_type_of_tag t f g tg) ()
inline_for_extraction
let serialize32_dsum_cases_aux
(t: dsum)
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(sf: (x: dsum_known_key t) -> Tot (serializer (dsnd (f x))))
(sf32: (x: dsum_known_key t) -> Tot (serializer32 (sf x)))
(#k': parser_kind)
(#g: parser k' (dsum_type_of_unknown_tag t))
(#sg: serializer g)
(sg32: serializer32 sg)
(tg: dsum_key t)
: Tot (serializer32 (serialize_dsum_cases t f sf g sg tg))
= [@inline_let]
let _ = synth_dsum_case_injective t tg in
[@inline_let]
let _ = synth_dsum_case_inverse t tg in
serialize32_synth
(serialize32_dsum_type_of_tag t f sf sf32 sg32 tg)
(synth_dsum_case t tg)
(synth_dsum_case_recip t tg)
(fun x -> synth_dsum_case_recip t tg x)
()
inline_for_extraction
let serialize32_dsum_cases_t
(t: dsum)
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(sf: (x: dsum_known_key t) -> Tot (serializer (dsnd (f x))))
(#k': parser_kind)
(g: parser k' (dsum_type_of_unknown_tag t))
(sg: serializer g)
(k: dsum_known_key t)
: Tot Type
= serializer32 (serialize_dsum_cases t f sf g sg (Known k))
let serialize32_dsum_cases_t_eq
(t: dsum)
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(sf: (x: dsum_known_key t) -> Tot (serializer (dsnd (f x))))
(#k': parser_kind)
(g: parser k' (dsum_type_of_unknown_tag t))
(sg: serializer g)
(k: dsum_known_key t)
(x y: serialize32_dsum_cases_t t f sf g sg k)
: GTot Type0
= True | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"LowStar.Buffer.fst.checked",
"LowParse.Spec.Sum.fst.checked",
"LowParse.Low.Enum.fst.checked",
"FStar.UInt64.fsti.checked",
"FStar.UInt32.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Int.Cast.fst.checked",
"FStar.HyperStack.ST.fsti.checked",
"FStar.HyperStack.fst.checked",
"FStar.Classical.fsti.checked"
],
"interface_file": false,
"source_file": "LowParse.Low.Sum.fst"
} | [
{
"abbrev": true,
"full_module": "FStar.HyperStack",
"short_module": "HS"
},
{
"abbrev": true,
"full_module": "FStar.UInt64",
"short_module": "U64"
},
{
"abbrev": true,
"full_module": "FStar.Int.Cast",
"short_module": "Cast"
},
{
"abbrev": true,
"full_module": "LowStar.Buffer",
"short_module": "B"
},
{
"abbrev": true,
"full_module": "FStar.HyperStack.ST",
"short_module": "HST"
},
{
"abbrev": true,
"full_module": "FStar.UInt32",
"short_module": "U32"
},
{
"abbrev": false,
"full_module": "LowParse.Spec.Sum",
"short_module": null
},
{
"abbrev": false,
"full_module": "LowParse.Low.Enum",
"short_module": null
},
{
"abbrev": false,
"full_module": "LowParse.Low",
"short_module": null
},
{
"abbrev": false,
"full_module": "LowParse.Low",
"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",
"short_module": null
}
] | {
"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_elim_box": false,
"smtencoding_l_arith_repr": "boxwrap",
"smtencoding_nl_arith_repr": "boxwrap",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": true,
"z3cliopt": [],
"z3refresh": false,
"z3rlimit": 5,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | false |
t: LowParse.Spec.Sum.dsum ->
f:
(x: LowParse.Spec.Sum.dsum_known_key t
-> Prims.dtuple2 LowParse.Spec.Base.parser_kind
(fun k -> LowParse.Spec.Base.parser k (LowParse.Spec.Sum.dsum_type_of_known_tag t x))) ->
sf:
(x: LowParse.Spec.Sum.dsum_known_key t
-> LowParse.Spec.Base.serializer (FStar.Pervasives.dsnd (f x))) ->
g: LowParse.Spec.Base.parser k' (LowParse.Spec.Sum.dsum_type_of_unknown_tag t) ->
sg: LowParse.Spec.Base.serializer g ->
k: LowParse.Spec.Sum.dsum_known_key t
-> LowParse.Spec.Enum.if_combinator (LowParse.Low.Sum.serialize32_dsum_cases_t t f sf g sg k)
(LowParse.Low.Sum.serialize32_dsum_cases_t_eq t f sf g sg k) | Prims.Tot | [
"total"
] | [] | [
"LowParse.Spec.Sum.dsum",
"LowParse.Spec.Sum.dsum_known_key",
"Prims.dtuple2",
"LowParse.Spec.Base.parser_kind",
"LowParse.Spec.Base.parser",
"LowParse.Spec.Sum.dsum_type_of_known_tag",
"LowParse.Spec.Base.serializer",
"Prims.__proj__Mkdtuple2__item___1",
"FStar.Pervasives.dsnd",
"LowParse.Spec.Sum.dsum_type_of_unknown_tag",
"Prims.bool",
"LowParse.Spec.Combinators.cond_true",
"LowParse.Low.Sum.serialize32_dsum_cases_t",
"LowParse.Spec.Combinators.cond_false",
"LowParse.Spec.Sum.dsum_cases",
"LowParse.Spec.Enum.Known",
"LowParse.Spec.Sum.dsum_key_type",
"LowParse.Spec.Sum.dsum_repr_type",
"LowParse.Spec.Sum.dsum_enum",
"LowStar.Monotonic.Buffer.srel",
"LowParse.Bytes.byte",
"LowStar.Monotonic.Buffer.mbuffer",
"FStar.UInt32.t",
"LowParse.Spec.Enum.if_combinator",
"LowParse.Low.Sum.serialize32_dsum_cases_t_eq"
] | [] | false | false | false | false | false | let serialize32_dsum_cases_t_if
(t: dsum)
(f: (x: dsum_known_key t -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x))))
(sf: (x: dsum_known_key t -> Tot (serializer (dsnd (f x)))))
(#k': parser_kind)
(g: parser k' (dsum_type_of_unknown_tag t))
(sg: serializer g)
(k: dsum_known_key t)
: Tot (if_combinator _ (serialize32_dsum_cases_t_eq t f sf g sg k)) =
| fun
cond
(sv_true: (cond_true cond -> Tot (serialize32_dsum_cases_t t f sf g sg k)))
(sv_false: (cond_false cond -> Tot (serialize32_dsum_cases_t t f sf g sg k)))
x
#rrel
#rel
output
pos
->
if cond then (sv_true () x output pos) else (sv_false () x output pos) | false |
LowParse.Low.Sum.fst | LowParse.Low.Sum.serialize32_dsum | val serialize32_dsum
(#kt: parser_kind)
(t: dsum)
(#p: parser kt (dsum_repr_type t))
(s: serializer p {kt.parser_kind_subkind == Some ParserStrong})
(s32: serializer32 (serialize_maybe_enum_key _ s (dsum_enum t)))
(f: (x: dsum_known_key t -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x))))
(sf: (x: dsum_known_key t -> Tot (serializer (dsnd (f x)))))
(sf32: (x: dsum_known_key t -> Tot (serializer32 (sf x))))
(#k': parser_kind)
(#g: parser k' (dsum_type_of_unknown_tag t))
(#sg: serializer g)
(sg32: serializer32 sg)
(destr: dep_enum_destr _ (serialize32_dsum_cases_t t f sf g sg))
: Tot (serializer32 (serialize_dsum t s f sf g sg)) | val serialize32_dsum
(#kt: parser_kind)
(t: dsum)
(#p: parser kt (dsum_repr_type t))
(s: serializer p {kt.parser_kind_subkind == Some ParserStrong})
(s32: serializer32 (serialize_maybe_enum_key _ s (dsum_enum t)))
(f: (x: dsum_known_key t -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x))))
(sf: (x: dsum_known_key t -> Tot (serializer (dsnd (f x)))))
(sf32: (x: dsum_known_key t -> Tot (serializer32 (sf x))))
(#k': parser_kind)
(#g: parser k' (dsum_type_of_unknown_tag t))
(#sg: serializer g)
(sg32: serializer32 sg)
(destr: dep_enum_destr _ (serialize32_dsum_cases_t t f sf g sg))
: Tot (serializer32 (serialize_dsum t s f sf g sg)) | let serialize32_dsum
(#kt: parser_kind)
(t: dsum)
(#p: parser kt (dsum_repr_type t))
(s: serializer p {kt.parser_kind_subkind == Some ParserStrong})
(s32: serializer32 (serialize_maybe_enum_key _ s (dsum_enum t)))
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(sf: (x: dsum_known_key t) -> Tot (serializer (dsnd (f x))))
(sf32: (x: dsum_known_key t) -> Tot (serializer32 (sf x)))
(#k': parser_kind)
(#g: parser k' (dsum_type_of_unknown_tag t))
(#sg: serializer g)
(sg32: serializer32 sg)
(destr: dep_enum_destr _ (serialize32_dsum_cases_t t f sf g sg))
: Tot (serializer32 (serialize_dsum t s f sf g sg))
= fun x #_ #_ output pos ->
[@inline_let]
let _ = serialize_dsum_eq' t s f sf g sg x in
let tg = dsum_tag_of_data t x in
serialize32_nondep_then_aux
s32
(serialize32_dsum_cases t f sf sf32 sg32 destr tg)
tg
x
output
pos | {
"file_name": "src/lowparse/LowParse.Low.Sum.fst",
"git_rev": "00217c4a89f5ba56002ba9aa5b4a9d5903bfe9fa",
"git_url": "https://github.com/project-everest/everparse.git",
"project_name": "everparse"
} | {
"end_col": 7,
"end_line": 1763,
"start_col": 0,
"start_line": 1738
} | module LowParse.Low.Sum
include LowParse.Low.Enum
include LowParse.Spec.Sum
module U32 = FStar.UInt32
module HST = FStar.HyperStack.ST
module B = LowStar.Buffer
module Cast = FStar.Int.Cast
module U64 = FStar.UInt64
inline_for_extraction
let validate_sum_cases_aux
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(vc: ((x: sum_key t) -> Tot (validator (dsnd (pc x)))))
(k: sum_key t)
: Tot (validator (parse_sum_cases t pc k))
= [@inline_let]
let _ = synth_sum_case_injective t k in
validate_synth
(validate_weaken
(weaken_parse_cases_kind t pc)
(vc k)
()
)
(synth_sum_case t k)
()
inline_for_extraction
let validate_sum_cases_t
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot Type
= validator (parse_sum_cases t pc k)
let validate_sum_cases_t_eq
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
(x y : validate_sum_cases_t t pc k)
: GTot Type0
= True
inline_for_extraction
let validate_sum_cases_t_if
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (if_combinator _ (validate_sum_cases_t_eq t pc k))
= fun cond (sv_true: cond_true cond -> Tot (validate_sum_cases_t t pc k)) (sv_false: cond_false cond -> Tot (validate_sum_cases_t t pc k)) #rrel #rel input pos ->
if cond
then sv_true () input pos
else sv_false () input pos
inline_for_extraction
let validate_sum_cases
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(vc: ((x: sum_key t) -> Tot (validator (dsnd (pc x)))))
(destr: dep_enum_destr (sum_enum t) (validate_sum_cases_t t pc))
(k: sum_key t)
: Tot (validator (parse_sum_cases t pc k))
= destr
_
(validate_sum_cases_t_if t pc)
(fun _ _ -> ())
(fun _ _ _ _ -> ())
(validate_sum_cases_aux t pc vc)
k
inline_for_extraction
let validate_sum_aux_payload_t
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
: Tot Type
= (#rrel: _) -> (#rel: _) ->
(input: slice rrel rel) ->
(pos: U64.t) ->
HST.Stack U64.t
(requires (fun h -> live_slice h input /\ U64.v pos <= U32.v input.len))
(ensures (fun h res h' ->
B.modifies B.loc_none h h' /\ (
match k with
| Unknown _ -> is_error res
| Known k' ->
if is_success res
then
valid_pos (dsnd (pc k')) h input (uint64_to_uint32 pos) (uint64_to_uint32 res)
else
(~ (valid (dsnd (pc k')) h input (uint64_to_uint32 pos)))
)))
let validate_sum_aux_payload_eq
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
: Tot (validate_sum_aux_payload_t t pc k -> validate_sum_aux_payload_t t pc k -> GTot Type0)
= fun _ _ -> True
inline_for_extraction
let validate_sum_aux_payload_if'
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
(cond: bool)
(ift: ((cond_true cond) -> Tot (validate_sum_aux_payload_t t pc k)))
(iff: ((cond_false cond) -> Tot (validate_sum_aux_payload_t t pc k)))
: Tot (validate_sum_aux_payload_t t pc k)
= fun #rrel #rel input pos ->
if cond
then begin
(ift () <: validate_sum_aux_payload_t t pc k) input pos
end else
(iff () <: validate_sum_aux_payload_t t pc k) input pos
inline_for_extraction
let validate_sum_aux_payload_if
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
: Tot (if_combinator _ (validate_sum_aux_payload_eq t pc k))
= validate_sum_aux_payload_if' t pc k
#push-options "--z3rlimit 64 --z3cliopt smt.arith.nl=false --using_facts_from '* -FStar.Int.Cast -LowParse.BitFields'"
// --query_stats --smtencoding.elim_box true --smtencoding.l_arith_repr native --z3refresh"
inline_for_extraction
let validate_sum_aux
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(v: validator p)
(p32: leaf_reader p)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(v_payload: ((k: sum_repr_type t)) -> Tot (validate_sum_aux_payload_t t pc (maybe_enum_key_of_repr (sum_enum t) k)))
: Tot (validator (parse_sum t p pc))
= fun #rrel #rel input pos ->
let h = HST.get () in
[@inline_let]
let _ = parse_sum_eq'' t p pc (bytes_of_slice_from h input (uint64_to_uint32 pos)) in
[@inline_let]
let _ = valid_facts (parse_sum t p pc) h input (uint64_to_uint32 pos) in
[@inline_let]
let _ = valid_facts p h input (uint64_to_uint32 pos) in
let len_after_tag = v input pos in
if is_error len_after_tag
then len_after_tag
else begin
let h1 = HST.get () in
let k' = p32 input (uint64_to_uint32 pos) in
[@inline_let]
let _ =
match maybe_enum_key_of_repr (sum_enum t) k' with
| Known k -> valid_facts (dsnd (pc k)) h input (uint64_to_uint32 len_after_tag)
| _ -> ()
in
v_payload k' input len_after_tag
end
#pop-options
inline_for_extraction
let validate_sum_aux_payload'
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (validator (dsnd (pc x)))))
(k: maybe_enum_key (sum_enum t))
: Tot (validate_sum_aux_payload_t t pc k)
= fun #rrel #rel input pos ->
match k with
| Known k ->
[@inline_let]
let _ = synth_sum_case_injective t k in
pc32 k input pos
// validate_synth (pc32 k) (synth_sum_case t k) () input pos
| _ -> validator_error_generic
inline_for_extraction
let validate_sum_aux_payload
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (validator (dsnd (pc x)))))
(destr: dep_maybe_enum_destr_t (sum_enum t) (validate_sum_aux_payload_t t pc))
(k: sum_repr_type t)
: Tot (validate_sum_aux_payload_t t pc (maybe_enum_key_of_repr (sum_enum t) k))
= destr (validate_sum_aux_payload_eq t pc) (validate_sum_aux_payload_if t pc) (fun _ _ -> ()) (fun _ _ _ _ -> ()) (validate_sum_aux_payload' t pc pc32) k
inline_for_extraction
let validate_sum
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(v: validator p)
(p32: leaf_reader p)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (validator (dsnd (pc x)))))
(destr: dep_maybe_enum_destr_t (sum_enum t) (validate_sum_aux_payload_t t pc))
: Tot (validator (parse_sum t p pc))
= validate_sum_aux t v p32 pc (validate_sum_aux_payload t pc pc32 destr)
module HS = FStar.HyperStack
#push-options "--z3rlimit 256 --z3cliopt smt.arith.nl=false --initial_ifuel 8 --max_ifuel 8 --initial_fuel 2 --max_fuel 2"
#restart-solver
let valid_sum_intro
(h: HS.mem)
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: Lemma
(requires (
valid (parse_enum_key p (sum_enum t)) h input pos /\ (
let k = contents (parse_enum_key p (sum_enum t)) h input pos in
valid (dsnd (pc k)) h input (get_valid_pos (parse_enum_key p (sum_enum t)) h input pos)
)))
(ensures (
let k = contents (parse_enum_key p (sum_enum t)) h input pos in
let pos_payload = get_valid_pos (parse_enum_key p (sum_enum t)) h input pos in
valid_content_pos
(parse_sum t p pc) h input pos
(synth_sum_case t k (contents (dsnd (pc k)) h input pos_payload))
(get_valid_pos (dsnd (pc k)) h input pos_payload)
))
= valid_facts (parse_enum_key p (sum_enum t)) h input pos;
let k = contents (parse_enum_key p (sum_enum t)) h input pos in
let pos_payload = get_valid_pos (parse_enum_key p (sum_enum t)) h input pos in
valid_facts (dsnd (pc k)) h input pos_payload;
valid_facts (parse_sum t p pc) h input pos;
parse_sum_eq t p pc (bytes_of_slice_from h input pos)
#pop-options
inline_for_extraction
let finalize_sum_case
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(s: serializer p)
(w: leaf_writer_strong s)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(destr: enum_repr_of_key'_t (sum_enum t))
(k: sum_key t)
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: HST.Stack unit
(requires (fun h ->
let len_tag = serialized_length (serialize_enum_key _ s (sum_enum t)) k in
U32.v pos + len_tag < 4294967296 /\ (
let pos_payload = pos `U32.add` U32.uint_to_t len_tag in
valid (dsnd (pc k)) h input pos_payload /\
writable input.base (U32.v pos) (U32.v pos_payload) h
)))
(ensures (fun h _ h' ->
let len_tag = serialized_length (serialize_enum_key _ s (sum_enum t)) k in
let pos_payload = pos `U32.add` U32.uint_to_t len_tag in
B.modifies (loc_slice_from_to input pos pos_payload) h h' /\
valid_content_pos (parse_sum t p pc) h' input pos (synth_sum_case t k (contents (dsnd (pc k)) h input pos_payload)) (get_valid_pos (dsnd (pc k)) h input pos_payload)
))
= let pos1 = write_enum_key w (sum_enum t) destr k input pos in
let h = HST.get () in
[@inline_let]
let _ = valid_sum_intro h t p pc input pos in
()
inline_for_extraction
let jump_sum_cases_aux
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(vc: ((x: sum_key t) -> Tot (jumper (dsnd (pc x)))))
(k: sum_key t)
: Tot (jumper (parse_sum_cases t pc k))
= [@inline_let]
let _ = synth_sum_case_injective t k in
jump_synth
(jump_weaken
(weaken_parse_cases_kind t pc)
(vc k)
()
)
(synth_sum_case t k)
()
inline_for_extraction
let jump_sum_cases_t
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot Type
= jumper (parse_sum_cases t pc k)
let jump_sum_cases_t_eq
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
(x y : jump_sum_cases_t t pc k)
: GTot Type0
= True
inline_for_extraction
let jump_sum_cases_t_if
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (if_combinator _ (jump_sum_cases_t_eq t pc k))
= fun cond (sv_true: cond_true cond -> Tot (jump_sum_cases_t t pc k)) (sv_false: cond_false cond -> Tot (jump_sum_cases_t t pc k)) #rrel #rel input pos ->
if cond
then sv_true () input pos
else sv_false () input pos
inline_for_extraction
let jump_sum_cases
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(vc: ((x: sum_key t) -> Tot (jumper (dsnd (pc x)))))
(destr: dep_enum_destr (sum_enum t) (jump_sum_cases_t t pc))
(k: sum_key t)
: Tot (jumper (parse_sum_cases t pc k))
= destr
_
(jump_sum_cases_t_if t pc)
(fun _ _ -> ())
(fun _ _ _ _ -> ())
(jump_sum_cases_aux t pc vc)
k
inline_for_extraction
let jump_sum_aux_payload_t
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
: Tot Type
= (#rrel: _) -> (#rel: _) ->
(input: slice rrel rel) ->
(pos: U32.t) ->
HST.Stack U32.t
(requires (fun h -> live_slice h input /\ U32.v pos <= U32.v input.len /\ (
match k with
| Unknown _ -> False
| Known k' -> valid (dsnd (pc k')) h input pos
)))
(ensures (fun h res h' ->
B.modifies B.loc_none h h' /\ (
match k with
| Unknown _ -> False
| Known k' ->
valid_pos (dsnd (pc k')) h input pos res
)))
let jump_sum_aux_payload_eq
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
: Tot (jump_sum_aux_payload_t t pc k -> jump_sum_aux_payload_t t pc k -> GTot Type0)
= fun _ _ -> True
inline_for_extraction
let jump_sum_aux_payload_if'
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
(cond: bool)
(ift: ((cond_true cond) -> Tot (jump_sum_aux_payload_t t pc k)))
(iff: ((cond_false cond) -> Tot (jump_sum_aux_payload_t t pc k)))
: Tot (jump_sum_aux_payload_t t pc k)
= fun #rrel #rel input pos ->
if cond
then begin
(ift () <: jump_sum_aux_payload_t t pc k) input pos
end else
(iff () <: jump_sum_aux_payload_t t pc k) input pos
inline_for_extraction
let jump_sum_aux_payload_if
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
: Tot (if_combinator _ (jump_sum_aux_payload_eq t pc k))
= jump_sum_aux_payload_if' t pc k
let parse_sum_eq3
(#kt: parser_kind)
(t: sum)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(input: bytes)
(k' : sum_repr_type t)
(consumed_k: consumed_length input)
: Lemma
(requires (Some? (parse (parse_sum t p pc) input) /\ parse p input == Some (k', consumed_k)))
(ensures (
let input_k = Seq.slice input consumed_k (Seq.length input) in
let k = maybe_enum_key_of_repr (sum_enum t) k' in
begin match k with
| Known k ->
Some? (parse (dsnd (pc k)) input_k)
| _ -> False
end
))
= parse_sum_eq'' t p pc input
let parse_sum_eq4
(#kt: parser_kind)
(t: sum)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(input: bytes)
(k' : sum_repr_type t)
(consumed_k: consumed_length input)
(consumed_payload: nat)
: Lemma
(requires (Some? (parse (parse_sum t p pc) input) /\ parse p input == Some (k', consumed_k) /\ (
let input_k = Seq.slice input consumed_k (Seq.length input) in
let k = maybe_enum_key_of_repr (sum_enum t) k' in
begin match k with
| Known k ->
Some? (parse (dsnd (pc k)) input_k) /\ (
let Some (_, consumed_payload') = parse (dsnd (pc k)) input_k in
consumed_payload' == consumed_payload
)
| _ -> False
end
)))
(ensures (
let Some (_, consumed) = parse (parse_sum t p pc) input in
consumed == consumed_k + consumed_payload
))
= parse_sum_eq'' t p pc input
#push-options "--z3rlimit 16"
let valid_sum_elim
(h: HS.mem)
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(#rrel: _) (#rel: _)
(input: slice rrel rel)
(pos: U32.t)
: Lemma
(requires (
valid (parse_sum t p pc) h input pos
))
(ensures (
valid p h input pos /\ (
let pos_payload = get_valid_pos p h input pos in
let k' = maybe_enum_key_of_repr (sum_enum t) (contents p h input pos) in
match k' with
| Known k ->
k == sum_tag_of_data t (contents (parse_sum t p pc) h input pos) /\
valid (dsnd (pc k)) h input pos_payload /\
valid_pos
(parse_sum t p pc) h input pos
(get_valid_pos (dsnd (pc k)) h input pos_payload)
| _ -> False
)))
= let sinput = bytes_of_slice_from h input pos in
let _ = parse_sum_eq'' t p pc sinput in
[@inline_let]
let _ = valid_facts (parse_sum t p pc) h input pos in
let Some (k', consumed_k) = parse p sinput in
let pos_after_tag = U32.uint_to_t (U32.v pos + consumed_k) in
[@inline_let]
let _ = valid_facts p h input pos in
assert (valid_content_pos p h input pos k' pos_after_tag);
match maybe_enum_key_of_repr (sum_enum t) k' with
| Known k -> valid_facts (dsnd (pc k)) h input pos_after_tag
| _ -> ()
#pop-options
let valid_sum_elim_tag
(h: HS.mem)
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: Lemma
(requires (
valid (parse_sum t p pc) h input pos
))
(ensures (
valid (parse_enum_key p (sum_enum t)) h input pos /\
contents (parse_enum_key p (sum_enum t)) h input pos == sum_tag_of_data t (contents (parse_sum t p pc) h input pos)
))
= let _ = parse_sum_eq' t p pc (bytes_of_slice_from h input pos) in
let _ = valid_facts (parse_sum t p pc) h input pos in
let _ = valid_facts (parse_enum_key p (sum_enum t)) h input pos in
()
inline_for_extraction
let read_sum_tag
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(p32: leaf_reader p)
(destr: dep_maybe_enum_destr_t (sum_enum t) (read_enum_key_t (sum_enum t)))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: HST.Stack (sum_key t)
(requires (fun h ->
valid (parse_sum t p pc) h input pos
))
(ensures (fun h res h' ->
B.modifies B.loc_none h h' /\
res == sum_tag_of_data t (contents (parse_sum t p pc) h input pos)
))
= let h = HST.get () in
[@inline_let] let _ = valid_sum_elim_tag h t p pc input pos in
read_enum_key p32 (sum_enum t) destr input pos
inline_for_extraction
let jump_sum_aux
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(v: jumper p)
(p32: leaf_reader p)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(v_payload: ((k: sum_repr_type t)) -> Tot (jump_sum_aux_payload_t t pc (maybe_enum_key_of_repr (sum_enum t) k)))
: Tot (jumper (parse_sum t p pc))
= fun #rrel #rel input pos ->
let h = HST.get () in
[@inline_let]
let _ = valid_sum_elim h t p pc input pos in
let pos_after_tag = v input pos in
let k' = p32 input pos in
v_payload k' input pos_after_tag
inline_for_extraction
let jump_sum_aux_payload'
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (jumper (dsnd (pc x)))))
(k: maybe_enum_key (sum_enum t))
: Tot (jump_sum_aux_payload_t t pc k)
= fun #rrel #rel input pos ->
match k with
| Known k ->
[@inline_let]
let _ = synth_sum_case_injective t k in
pc32 k input pos
| _ -> 0ul // dummy, but we MUST NOT remove this branch, otherwise extraction fails
inline_for_extraction
let jump_sum_aux_payload
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (jumper (dsnd (pc x)))))
(destr: dep_maybe_enum_destr_t (sum_enum t) (jump_sum_aux_payload_t t pc))
(k: sum_repr_type t)
: Tot (jump_sum_aux_payload_t t pc (maybe_enum_key_of_repr (sum_enum t) k))
= destr (jump_sum_aux_payload_eq t pc) (jump_sum_aux_payload_if t pc) (fun _ _ -> ()) (fun _ _ _ _ -> ()) (jump_sum_aux_payload' t pc pc32) k
inline_for_extraction
let jump_sum
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(v: jumper p)
(p32: leaf_reader p)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (jumper (dsnd (pc x)))))
(destr: dep_maybe_enum_destr_t (sum_enum t) (jump_sum_aux_payload_t t pc))
: Tot (jumper (parse_sum t p pc))
= jump_sum_aux t v p32 pc (jump_sum_aux_payload t pc pc32 destr)
inline_for_extraction
let read_sum_cases'
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (leaf_reader (dsnd (pc x)))))
(k: sum_key t)
: Tot (leaf_reader (parse_sum_cases' t pc k))
= [@inline_let]
let _ = synth_sum_case_injective t k in
read_synth'
(dsnd (pc k))
(synth_sum_case t k)
(pc32 k)
()
inline_for_extraction
let read_sum_cases_t
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot Type
= leaf_reader (parse_sum_cases' t pc k)
let read_sum_cases_t_eq
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
(x y : read_sum_cases_t t pc k)
: GTot Type0
= True
inline_for_extraction
let read_sum_cases_t_if
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (if_combinator _ (read_sum_cases_t_eq t pc k))
= fun cond (sv_true: cond_true cond -> Tot (read_sum_cases_t t pc k)) (sv_false: cond_false cond -> Tot (read_sum_cases_t t pc k)) #_ #_ input pos ->
if cond
then (sv_true () input pos)
else (sv_false () input pos)
inline_for_extraction
let read_sum_cases
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (leaf_reader (dsnd (pc x)))))
(destr: dep_enum_destr (sum_enum t) (read_sum_cases_t t pc))
(k: sum_key t)
: Tot (leaf_reader (parse_sum_cases' t pc k))
= destr
_
(read_sum_cases_t_if t pc)
(fun _ _ -> ())
(fun _ _ _ _ -> ())
(read_sum_cases' t pc pc32)
k
#push-options "--z3rlimit 32"
inline_for_extraction
let read_sum
(#kt: parser_kind)
(t: sum)
(p: parser kt (sum_repr_type t))
(p32: leaf_reader (parse_enum_key p (sum_enum t)))
(j: jumper p)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (leaf_reader (dsnd (pc x)))))
(destr: dep_enum_destr (sum_enum t) (read_sum_cases_t t pc))
: Tot (leaf_reader (parse_sum t p pc))
=
fun #_ #_ input pos ->
let h = HST.get () in
valid_facts (parse_sum t p pc) h input pos;
parse_sum_eq' t p pc (bytes_of_slice_from h input pos);
valid_facts (parse_enum_key p (sum_enum t)) h input pos;
let k = p32 input pos in
let pos' = jump_enum_key j (sum_enum t) input pos in
valid_facts (parse_sum_cases' t pc k) h input pos' ;
read_sum_cases t pc pc32 destr k input pos'
#pop-options
inline_for_extraction
let serialize32_sum_cases_t
(t: sum)
(#pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(sc: ((x: sum_key t) -> Tot (serializer (dsnd (pc x)))))
(k: sum_key t)
: Tot Type
= serializer32 (serialize_sum_cases t pc sc k)
let serialize32_sum_cases_t_eq
(t: sum)
(#pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(sc: ((x: sum_key t) -> Tot (serializer (dsnd (pc x)))))
(k: sum_key t)
(x y: serialize32_sum_cases_t t sc k)
: GTot Type0
= True
inline_for_extraction
let serialize32_sum_cases_t_if
(t: sum)
(#pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(sc: ((x: sum_key t) -> Tot (serializer (dsnd (pc x)))))
(k: sum_key t)
: Tot (if_combinator _ (serialize32_sum_cases_t_eq t sc k))
= fun cond (sv_true: (cond_true cond -> Tot (serialize32_sum_cases_t t sc k))) (sv_false: (cond_false cond -> Tot (serialize32_sum_cases_t t sc k))) x #rrel #rel b pos ->
if cond
then (sv_true () x b pos)
else (sv_false () x b pos)
inline_for_extraction
let serialize32_sum_cases_aux
(t: sum)
(#pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(sc: ((x: sum_key t) -> Tot (serializer (dsnd (pc x)))))
(sc32: ((x: sum_key t) -> Tot (serializer32 (sc x))))
(k: sum_key t)
: Tot (serializer32 (serialize_sum_cases t pc sc k))
= fun x #rrel #rel b pos ->
[@inline_let] let _ =
Classical.forall_intro (parse_sum_cases_eq' t pc k);
synth_sum_case_injective t k;
synth_sum_case_inverse t k
in
serialize32_synth
(sc32 k)
(synth_sum_case t k)
(synth_sum_case_recip t k)
(fun x -> synth_sum_case_recip t k x)
()
x
b
pos
inline_for_extraction
let serialize32_sum_cases
(t: sum)
(#pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(sc: ((x: sum_key t) -> Tot (serializer (dsnd (pc x)))))
(sc32: ((x: sum_key t) -> Tot (serializer32 (sc x))))
(destr: dep_enum_destr (sum_enum t) (serialize32_sum_cases_t t sc))
(k: sum_key t)
: Tot (serializer32 (serialize_sum_cases t pc sc k))
= destr
_
(serialize32_sum_cases_t_if t sc)
(fun _ _ -> ())
(fun _ _ _ _ -> ())
(serialize32_sum_cases_aux t sc sc32)
k
inline_for_extraction
let serialize32_sum
(#kt: parser_kind)
(t: sum)
(#p: parser kt (sum_repr_type t))
(s: serializer p {kt.parser_kind_subkind == Some ParserStrong})
(s32: serializer32 (serialize_enum_key _ s (sum_enum t)))
(#pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(sc: ((x: sum_key t) -> Tot (serializer (dsnd (pc x)))))
(sc32: ((x: sum_key t) -> Tot (serializer32 (sc x))))
(destr: dep_enum_destr (sum_enum t) (serialize32_sum_cases_t t sc))
: Tot (serializer32 (serialize_sum t s sc))
= fun x #rrel #rel b pos ->
serialize_sum_eq t s sc x;
let tg = sum_tag_of_data t x in
serialize32_nondep_then_aux s32 (serialize32_sum_cases t sc sc32 destr tg) tg x b pos
let clens_sum_tag
(s: sum)
: Tot (clens (sum_type s) (sum_key s))
= {
clens_cond = (fun _ -> True);
clens_get = sum_tag_of_data s;
}
let gaccessor_sum_tag
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
: Tot (gaccessor (parse_sum t p pc) (parse_enum_key p (sum_enum t)) (clens_sum_tag t))
= gaccessor_tagged_union_tag
(parse_enum_key p (sum_enum t))
(sum_tag_of_data t)
(parse_sum_cases t pc)
inline_for_extraction
let accessor_sum_tag
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
: Tot (accessor (gaccessor_sum_tag t p pc))
= accessor_tagged_union_tag
(parse_enum_key p (sum_enum t))
(sum_tag_of_data t)
(parse_sum_cases t pc)
let clens_sum_payload
(s: sum)
(k: sum_key s)
: Tot (clens (sum_type s) (sum_type_of_tag s k))
= {
clens_cond = (fun (x: sum_type s) -> sum_tag_of_data s x == k);
clens_get = (fun (x: sum_type s) -> synth_sum_case_recip s k x <: Ghost (sum_type_of_tag s k) (requires (sum_tag_of_data s x == k)) (ensures (fun _ -> True)));
}
#push-options "--z3rlimit 32"
let gaccessor_clens_sum_payload'
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (gaccessor' (parse_sum t p pc) (dsnd (pc k)) (clens_sum_payload t k))
= fun (input: bytes) ->
parse_sum_eq'' t p pc input;
let res =
match parse p input with
| Some (_, consumed) ->
synth_sum_case_inverse t k;
synth_sum_case_injective t k;
synth_injective_synth_inverse_synth_inverse_recip (synth_sum_case t k) (synth_sum_case_recip t k) ();
(consumed)
| _ -> 0 // dummy
in
(res <: (res: _ { gaccessor_post' (parse_sum t p pc) (dsnd (pc k)) (clens_sum_payload t k) input res } ))
#push-options "--z3rlimit 64"
let gaccessor_clens_sum_payload_injective
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
(sl sl' : bytes)
: Lemma
(requires (
gaccessor_pre (parse_sum t p pc) (dsnd (pc k)) (clens_sum_payload t k) sl /\
gaccessor_pre (parse_sum t p pc) (dsnd (pc k)) (clens_sum_payload t k) sl' /\
injective_precond (parse_sum t p pc) sl sl'
))
(ensures (gaccessor_clens_sum_payload' t p pc k sl == gaccessor_clens_sum_payload' t p pc k sl'))
= parse_sum_eq'' t p pc sl;
parse_sum_eq'' t p pc sl' ;
parse_injective (parse_sum t p pc) sl sl' ;
parse_injective p sl sl'
#pop-options
let gaccessor_clens_sum_payload_no_lookahead
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
(sl sl' : bytes)
: Lemma
(requires (
(parse_sum_kind kt t pc).parser_kind_subkind == Some ParserStrong /\
gaccessor_pre (parse_sum t p pc) (dsnd (pc k)) (clens_sum_payload t k) sl /\
gaccessor_pre (parse_sum t p pc) (dsnd (pc k)) (clens_sum_payload t k) sl' /\
no_lookahead_on_precond (parse_sum t p pc) sl sl'
))
(ensures (gaccessor_clens_sum_payload' t p pc k sl == gaccessor_clens_sum_payload' t p pc k sl'))
= parse_sum_eq'' t p pc sl;
parse_sum_eq'' t p pc sl' ;
parse_strong_prefix (parse_sum t p pc) sl sl' ;
parse_injective p sl sl'
let gaccessor_clens_sum_payload
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (gaccessor (parse_sum t p pc) (dsnd (pc k)) (clens_sum_payload t k))
= Classical.forall_intro_2 (fun x -> Classical.move_requires (gaccessor_clens_sum_payload_injective t p pc k x));
Classical.forall_intro_2 (fun x -> Classical.move_requires (gaccessor_clens_sum_payload_no_lookahead t p pc k x));
gaccessor_prop_equiv (parse_sum t p pc) (dsnd (pc k)) (clens_sum_payload t k) (gaccessor_clens_sum_payload' t p pc k);
gaccessor_clens_sum_payload' t p pc k
inline_for_extraction
let accessor_clens_sum_payload'
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(j: jumper p)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: HST.Stack U32.t
(requires (fun h ->
valid (parse_sum t p pc) h input pos /\
(clens_sum_payload t k).clens_cond (contents (parse_sum t p pc) h input pos)
))
(ensures (fun h pos' h' ->
B.modifies B.loc_none h h' /\
pos' == slice_access h (gaccessor_clens_sum_payload t p pc k) input pos
))
=
let h = HST.get () in
[@inline_let]
let _ =
let pos' = get_valid_pos (parse_sum t p pc) h input pos in
let large = bytes_of_slice_from h input pos in
slice_access_eq h (gaccessor_clens_sum_payload t p pc k) input pos;
valid_facts (parse_sum t p pc) h input pos;
parse_sum_eq'' t p pc large;
valid_facts p h input pos
in
j input pos
#pop-options
inline_for_extraction
let accessor_clens_sum_payload
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(j: jumper p)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (accessor (gaccessor_clens_sum_payload t p pc k))
= fun #rrel #rel -> accessor_clens_sum_payload' t j pc k #rrel #rel
let clens_sum_cases_payload
(s: sum)
(k: sum_key s)
: Tot (clens (sum_cases s k) (sum_type_of_tag s k))
= {
clens_cond = (fun (x: sum_cases s k) -> True);
clens_get = (fun (x: sum_cases s k) -> synth_sum_case_recip s k x <: Ghost (sum_type_of_tag s k) (requires (True)) (ensures (fun _ -> True)));
}
let gaccessor_clens_sum_cases_payload
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (gaccessor (parse_sum_cases' t pc k) (dsnd (pc k)) (clens_sum_cases_payload t k))
= synth_sum_case_injective t k;
synth_sum_case_inverse t k;
synth_injective_synth_inverse_synth_inverse_recip (synth_sum_case t k) (synth_sum_case_recip t k) ();
gaccessor_ext
(gaccessor_synth (dsnd (pc k)) (synth_sum_case t k) (synth_sum_case_recip t k) ())
(clens_sum_cases_payload t k)
()
inline_for_extraction
let accessor_clens_sum_cases_payload
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (accessor (gaccessor_clens_sum_cases_payload t pc k))
= [@inline_let]
let _ =
synth_sum_case_injective t k;
synth_sum_case_inverse t k;
synth_injective_synth_inverse_synth_inverse_recip (synth_sum_case t k) (synth_sum_case_recip t k) ()
in
accessor_ext
(accessor_synth (dsnd (pc k)) (synth_sum_case t k) (synth_sum_case_recip t k) ())
(clens_sum_cases_payload t k)
()
inline_for_extraction
let validate_dsum_cases_t
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(#k: parser_kind)
(g: parser k (dsum_type_of_unknown_tag s))
(x: dsum_key s)
: Tot Type
= validator (parse_dsum_cases' s f g x)
let validate_dsum_cases_eq
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(#k: parser_kind)
(g: parser k (dsum_type_of_unknown_tag s))
(x: dsum_key s)
(v1 v2 : validate_dsum_cases_t s f g x)
: GTot Type0
= True
inline_for_extraction
let validate_dsum_cases_if'
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(#k: parser_kind)
(g: parser k (dsum_type_of_unknown_tag s))
(x: dsum_key s)
(cond: bool)
(ift: (cond_true cond -> Tot (validate_dsum_cases_t s f g x)))
(iff: (cond_false cond -> Tot (validate_dsum_cases_t s f g x)))
: Tot (validate_dsum_cases_t s f g x)
= fun #rrel #rel input len ->
if cond
then (ift () <: validate_dsum_cases_t s f g x) input len
else (iff () <: validate_dsum_cases_t s f g x) input len
inline_for_extraction
let validate_dsum_cases_if
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(#k: parser_kind)
(g: parser k (dsum_type_of_unknown_tag s))
(x: dsum_key s)
: Tot (if_combinator _ (validate_dsum_cases_eq s f g x))
= validate_dsum_cases_if' s f g x
inline_for_extraction
let validate_dsum_cases'
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(f' : (x: dsum_known_key s) -> Tot (validator (dsnd (f x))))
(#k: parser_kind)
(#g: parser k (dsum_type_of_unknown_tag s))
(g' : validator g)
(x: dsum_key s)
: Tot (validate_dsum_cases_t s f g x)
= [@inline_let]
let _ = synth_dsum_case_injective s x in
match x with
| Known x' -> validate_synth (f' x') (synth_dsum_case s (Known x')) () <: validator (parse_dsum_cases' s f g x)
| Unknown x' -> validate_synth g' (synth_dsum_case s (Unknown x')) () <: validator (parse_dsum_cases' s f g x)
inline_for_extraction
let validate_dsum_cases'_destr
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(f' : (x: dsum_known_key s) -> Tot (validator (dsnd (f x))))
(#k: parser_kind)
(#g: parser k (dsum_type_of_unknown_tag s))
(g' : validator g)
(destr: dep_enum_destr _ (fun k -> validate_dsum_cases_t s f g (Known k)))
(x: dsum_key s)
: Tot (validate_dsum_cases_t s f g x)
= fun #rrel #rel input pos ->
match x with
| Known k ->
destr
_
(fun k -> validate_dsum_cases_if s f g (Known k))
(fun _ _ -> ())
(fun _ _ _ _ -> ())
(fun k -> validate_dsum_cases' s f f' g' (Known k))
k
input
pos
| Unknown r -> validate_dsum_cases' s f f' g' (Unknown r) input pos
inline_for_extraction
let validate_dsum_cases
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(f' : (x: dsum_known_key s) -> Tot (validator (dsnd (f x))))
(#k: parser_kind)
(#g: parser k (dsum_type_of_unknown_tag s))
(g' : validator g)
(destr: dep_enum_destr _ (fun k -> validate_dsum_cases_t s f g (Known k)))
(x: dsum_key s)
: Tot (validator (parse_dsum_cases s f g x))
= fun #rrel #rel input pos ->
let h = HST.get () in
[@inline_let]
let _ =
valid_facts (parse_dsum_cases' s f g x) h input (uint64_to_uint32 pos);
valid_facts (parse_dsum_cases s f g x) h input (uint64_to_uint32 pos);
parse_dsum_cases_eq' s f g x (bytes_of_slice_from h input (uint64_to_uint32 pos))
in
validate_dsum_cases'_destr s f f' g' destr x input pos
#push-options "--z3rlimit 40"
inline_for_extraction
let validate_dsum
(#kt: parser_kind)
(t: dsum)
(#p: parser kt (dsum_repr_type t))
(v: validator p)
(p32: leaf_reader p)
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(f32: (x: dsum_known_key t) -> Tot (validator (dsnd (f x))))
(#k': parser_kind)
(#g: parser k' (dsum_type_of_unknown_tag t))
(g32: validator g)
(destr: dep_maybe_enum_destr_t (dsum_enum t) (validate_dsum_cases_t t f g))
: Tot (validator (parse_dsum t p f g))
= fun #rrel #rel input pos ->
let h = HST.get () in
[@inline_let]
let _ = parse_dsum_eq' t p f g (bytes_of_slice_from h input (uint64_to_uint32 pos)) in
[@inline_let]
let _ = valid_facts (parse_dsum t p f g) h input (uint64_to_uint32 pos) in
[@inline_let]
let _ = valid_facts p h input (uint64_to_uint32 pos) in
let pos_after_tag = v input pos in
if is_error pos_after_tag
then pos_after_tag
else
let tg = p32 input (uint64_to_uint32 pos) in
[@inline_let]
let _ = valid_facts (parse_dsum_cases' t f g (maybe_enum_key_of_repr (dsum_enum t) tg)) h input (uint64_to_uint32 pos_after_tag) in
destr (validate_dsum_cases_eq t f g) (validate_dsum_cases_if t f g) (fun _ _ -> ()) (fun _ _ _ _ -> ()) (validate_dsum_cases' t f f32 g32) tg input pos_after_tag
#pop-options
#reset-options "--z3rlimit 64 --z3cliopt smt.arith.nl=false --initial_ifuel 8 --max_ifuel 8 --initial_fuel 2 --max_fuel 2"
let valid_dsum_intro_known
(h: HS.mem)
(t: dsum)
(#kt: parser_kind)
(p: parser kt (dsum_repr_type t))
(f: ((x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x))))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: Lemma
(requires (
valid (parse_maybe_enum_key p (dsum_enum t)) h input pos /\ (
let k' = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
Known? k' /\ (
let Known k = k' in
valid (dsnd (f k)) h input (get_valid_pos (parse_maybe_enum_key p (dsum_enum t)) h input pos)
))))
(ensures (
let Known k = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
let pos_payload = get_valid_pos (parse_maybe_enum_key p (dsum_enum t)) h input pos in
valid_content_pos
(parse_dsum t p f g) h input pos
(synth_dsum_case t (Known k) (contents (dsnd (f k)) h input pos_payload))
(get_valid_pos (dsnd (f k)) h input pos_payload)
))
= valid_facts (parse_maybe_enum_key p (dsum_enum t)) h input pos;
let Known k = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
let pos_payload = get_valid_pos (parse_maybe_enum_key p (dsum_enum t)) h input pos in
valid_facts (dsnd (f k)) h input pos_payload;
valid_facts (parse_dsum t p f g) h input pos;
parse_dsum_eq t p f g (bytes_of_slice_from h input pos)
let valid_dsum_intro_unknown
(h: HS.mem)
(t: dsum)
(#kt: parser_kind)
(p: parser kt (dsum_repr_type t))
(f: ((x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x))))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: Lemma
(requires (
valid (parse_maybe_enum_key p (dsum_enum t)) h input pos /\ (
let k' = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
Unknown? k' /\
valid g h input (get_valid_pos (parse_maybe_enum_key p (dsum_enum t)) h input pos)
)))
(ensures (
let Unknown r = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
let pos_payload = get_valid_pos (parse_maybe_enum_key p (dsum_enum t)) h input pos in
valid_content_pos
(parse_dsum t p f g) h input pos
(synth_dsum_case t (Unknown r) (contents g h input pos_payload))
(get_valid_pos g h input pos_payload)
))
= valid_facts (parse_maybe_enum_key p (dsum_enum t)) h input pos;
let Unknown r = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
let pos_payload = get_valid_pos (parse_maybe_enum_key p (dsum_enum t)) h input pos in
valid_facts g h input pos_payload;
valid_facts (parse_dsum t p f g) h input pos;
parse_dsum_eq t p f g (bytes_of_slice_from h input pos)
#reset-options
inline_for_extraction
let finalize_dsum_case_known
(t: dsum)
(#kt: parser_kind)
(#p: parser kt (dsum_repr_type t))
(s: serializer p)
(w: leaf_writer_strong s)
(f: ((x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x))))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
(destr: enum_repr_of_key'_t (dsum_enum t))
(k: dsum_known_key t)
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: HST.Stack unit
(requires (fun h ->
let len_tag = serialized_length (serialize_enum_key _ s (dsum_enum t)) k in
U32.v pos + len_tag < 4294967296 /\ (
let pos_payload = pos `U32.add` U32.uint_to_t len_tag in
valid (dsnd (f k)) h input pos_payload /\
writable input.base (U32.v pos) (U32.v pos_payload) h
)))
(ensures (fun h _ h' ->
let len_tag = serialized_length (serialize_enum_key _ s (dsum_enum t)) k in
let pos_payload = pos `U32.add` U32.uint_to_t len_tag in
B.modifies (loc_slice_from_to input pos pos_payload) h h' /\
valid_content_pos (parse_dsum t p f g) h' input pos (synth_dsum_case t (Known k) (contents (dsnd (f k)) h input pos_payload)) (get_valid_pos (dsnd (f k)) h input pos_payload)
))
= let pos1 = write_enum_key w (dsum_enum t) destr k input pos in
let h = HST.get () in
[@inline_let]
let _ =
valid_facts (parse_enum_key p (dsum_enum t)) h input pos;
valid_facts (parse_maybe_enum_key p (dsum_enum t)) h input pos;
let sq = bytes_of_slice_from h input pos in
parse_enum_key_eq p (dsum_enum t) sq;
parse_maybe_enum_key_eq p (dsum_enum t) sq;
valid_dsum_intro_known h t p f g input pos
in
()
inline_for_extraction
let finalize_dsum_case_unknown
(t: dsum)
(#kt: parser_kind)
(#p: parser kt (dsum_repr_type t))
(s: serializer p)
(w: leaf_writer_strong s)
(f: ((x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x))))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
(r: unknown_enum_repr (dsum_enum t))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: HST.Stack unit
(requires (fun h ->
let len_tag = serialized_length s r in
U32.v pos + len_tag < 4294967296 /\ (
let pos_payload = pos `U32.add` U32.uint_to_t len_tag in
valid g h input pos_payload /\
writable input.base (U32.v pos) (U32.v pos_payload) h
)))
(ensures (fun h _ h' ->
let len_tag = serialized_length s r in
let pos_payload = pos `U32.add` U32.uint_to_t len_tag in
B.modifies (loc_slice_from_to input pos pos_payload) h h' /\
valid_content_pos (parse_dsum t p f g) h' input pos (synth_dsum_case t (Unknown r) (contents g h input pos_payload)) (get_valid_pos g h input pos_payload)
))
= let pos1 = w r input pos in
let h = HST.get () in
[@inline_let]
let _ =
valid_facts (parse_maybe_enum_key p (dsum_enum t)) h input pos;
valid_facts p h input pos;
let sq = bytes_of_slice_from h input pos in
parse_maybe_enum_key_eq p (dsum_enum t) sq;
valid_dsum_intro_unknown h t p f g input pos
in
()
let valid_dsum_elim_tag
(h: HS.mem)
(t: dsum)
(#kt: parser_kind)
(p: parser kt (dsum_repr_type t))
(f: ((x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x))))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: Lemma
(requires (
valid (parse_dsum t p f g) h input pos
))
(ensures (
valid (parse_maybe_enum_key p (dsum_enum t)) h input pos /\
contents (parse_maybe_enum_key p (dsum_enum t)) h input pos == dsum_tag_of_data t (contents (parse_dsum t p f g) h input pos)
))
= let _ = parse_dsum_eq_ t p f g (bytes_of_slice_from h input pos) in
let _ = valid_facts (parse_dsum t p f g) h input pos in
let _ = valid_facts (parse_maybe_enum_key p (dsum_enum t)) h input pos in
()
inline_for_extraction
let read_dsum_tag
(t: dsum)
(#kt: parser_kind)
(#p: parser kt (dsum_repr_type t))
(p32: leaf_reader p)
(destr: maybe_enum_destr_t (maybe_enum_key (dsum_enum t)) (dsum_enum t))
(f: ((x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x))))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: HST.Stack (dsum_key t)
(requires (fun h ->
valid (parse_dsum t p f g) h input pos
))
(ensures (fun h res h' ->
B.modifies B.loc_none h h' /\
res == dsum_tag_of_data t (contents (parse_dsum t p f g) h input pos)
))
= let h = HST.get () in
[@inline_let] let _ = valid_dsum_elim_tag h t p f g input pos in
read_maybe_enum_key p32 (dsum_enum t) destr input pos
#push-options "--z3rlimit 32"
let valid_dsum_elim_known
(h: HS.mem)
(t: dsum)
(#kt: parser_kind)
(p: parser kt (dsum_repr_type t))
(f: ((x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x))))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: Lemma
(requires (
valid (parse_dsum t p f g) h input pos /\
Known? (dsum_tag_of_data t (contents (parse_dsum t p f g) h input pos))
))
(ensures (
valid (parse_maybe_enum_key p (dsum_enum t)) h input pos /\ (
let k' = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
let pos_payload = get_valid_pos (parse_maybe_enum_key p (dsum_enum t)) h input pos in
Known? k' /\ (
let Known k = k' in
valid (dsnd (f k)) h input pos_payload /\
valid_content_pos
(parse_dsum t p f g) h input pos
(synth_dsum_case t (Known k) (contents (dsnd (f k)) h input pos_payload))
(get_valid_pos (dsnd (f k)) h input pos_payload)
))))
=
valid_facts (parse_dsum t p f g) h input pos;
parse_dsum_eq t p f g (bytes_of_slice_from h input pos);
valid_facts (parse_maybe_enum_key p (dsum_enum t)) h input pos;
let Known k = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
let pos_payload = get_valid_pos (parse_maybe_enum_key p (dsum_enum t)) h input pos in
valid_facts (dsnd (f k)) h input pos_payload
#pop-options
let valid_dsum_elim_unknown
(h: HS.mem)
(t: dsum)
(#kt: parser_kind)
(p: parser kt (dsum_repr_type t))
(f: ((x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x))))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: Lemma
(requires (
valid (parse_dsum t p f g) h input pos /\
Unknown? (dsum_tag_of_data t (contents (parse_dsum t p f g) h input pos))
))
(ensures (
valid (parse_maybe_enum_key p (dsum_enum t)) h input pos /\ (
let k' = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
let pos_payload = get_valid_pos (parse_maybe_enum_key p (dsum_enum t)) h input pos in
Unknown? k' /\ (
let Unknown r = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
valid g h input pos_payload /\
valid_content_pos
(parse_dsum t p f g) h input pos
(synth_dsum_case t (Unknown r) (contents g h input pos_payload))
(get_valid_pos g h input pos_payload)
))))
=
valid_facts (parse_dsum t p f g) h input pos;
parse_dsum_eq t p f g (bytes_of_slice_from h input pos);
valid_facts (parse_maybe_enum_key p (dsum_enum t)) h input pos;
let Unknown r = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
let pos_payload = get_valid_pos (parse_maybe_enum_key p (dsum_enum t)) h input pos in
valid_facts g h input pos_payload
inline_for_extraction
let jump_dsum_cases_t
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(#k: parser_kind)
(g: parser k (dsum_type_of_unknown_tag s))
(x: dsum_key s)
: Tot Type
= jumper (parse_dsum_cases' s f g x)
let jump_dsum_cases_eq
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(#k: parser_kind)
(g: parser k (dsum_type_of_unknown_tag s))
(x: dsum_key s)
(v1 v2 : jump_dsum_cases_t s f g x)
: GTot Type0
= True
inline_for_extraction
let jump_dsum_cases_if'
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(#k: parser_kind)
(g: parser k (dsum_type_of_unknown_tag s))
(x: dsum_key s)
(cond: bool)
(ift: (cond_true cond -> Tot (jump_dsum_cases_t s f g x)))
(iff: (cond_false cond -> Tot (jump_dsum_cases_t s f g x)))
: Tot (jump_dsum_cases_t s f g x)
= fun #rrel #rel input len ->
if cond
then (ift () <: jump_dsum_cases_t s f g x) input len
else (iff () <: jump_dsum_cases_t s f g x) input len
inline_for_extraction
let jump_dsum_cases_if
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(#k: parser_kind)
(g: parser k (dsum_type_of_unknown_tag s))
(x: dsum_key s)
: Tot (if_combinator _ (jump_dsum_cases_eq s f g x))
= jump_dsum_cases_if' s f g x
inline_for_extraction
let jump_dsum_cases'
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(f' : (x: dsum_known_key s) -> Tot (jumper (dsnd (f x))))
(#k: parser_kind)
(#g: parser k (dsum_type_of_unknown_tag s))
(g' : jumper g)
(x: dsum_key s)
: Tot (jump_dsum_cases_t s f g x)
= synth_dsum_case_injective s x;
match x with
| Known x' -> jump_synth (f' x') (synth_dsum_case s (Known x')) () <: jumper (parse_dsum_cases' s f g x)
| Unknown x' -> jump_synth g' (synth_dsum_case s (Unknown x')) () <: jumper (parse_dsum_cases' s f g x)
inline_for_extraction
let jump_dsum_cases'_destr
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(f' : (x: dsum_known_key s) -> Tot (jumper (dsnd (f x))))
(#k: parser_kind)
(#g: parser k (dsum_type_of_unknown_tag s))
(g' : jumper g)
(destr: dep_enum_destr _ (fun k -> jump_dsum_cases_t s f g (Known k)))
(x: dsum_key s)
: Tot (jump_dsum_cases_t s f g x)
= fun #rrel #rel input pos ->
match x with
| Known k ->
destr
_
(fun k -> jump_dsum_cases_if s f g (Known k))
(fun _ _ -> ())
(fun _ _ _ _ -> ())
(fun k -> jump_dsum_cases' s f f' g' (Known k))
k
input
pos
| Unknown r -> jump_dsum_cases' s f f' g' (Unknown r) input pos
inline_for_extraction
let jump_dsum_cases
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(f' : (x: dsum_known_key s) -> Tot (jumper (dsnd (f x))))
(#k: parser_kind)
(#g: parser k (dsum_type_of_unknown_tag s))
(g' : jumper g)
(destr: dep_enum_destr _ (fun k -> jump_dsum_cases_t s f g (Known k)))
(x: dsum_key s)
: Tot (jumper (parse_dsum_cases s f g x))
= fun #rrel #rel input pos ->
let h = HST.get () in
[@inline_let]
let _ =
valid_facts (parse_dsum_cases' s f g x) h input pos;
valid_facts (parse_dsum_cases s f g x) h input pos;
parse_dsum_cases_eq' s f g x (bytes_of_slice_from h input pos)
in
jump_dsum_cases'_destr s f f' g' destr x input pos
#push-options "--z3rlimit 16"
inline_for_extraction
let jump_dsum
(#kt: parser_kind)
(t: dsum)
(#p: parser kt (dsum_repr_type t))
(v: jumper p)
(p32: leaf_reader p)
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(f32: (x: dsum_known_key t) -> Tot (jumper (dsnd (f x))))
(#k': parser_kind)
(#g: parser k' (dsum_type_of_unknown_tag t))
(g32: jumper g)
(destr: dep_maybe_enum_destr_t (dsum_enum t) (jump_dsum_cases_t t f g))
: Tot (jumper (parse_dsum t p f g))
= fun #rrel #rel input pos ->
let h = HST.get () in
[@inline_let]
let _ = parse_dsum_eq' t p f g (bytes_of_slice_from h input pos) in
[@inline_let]
let _ = valid_facts (parse_dsum t p f g) h input pos in
[@inline_let]
let _ = valid_facts p h input pos in
let pos_after_tag = v input pos in
let tg = p32 input pos in
[@inline_let]
let _ = valid_facts (parse_dsum_cases' t f g (maybe_enum_key_of_repr (dsum_enum t) tg)) h input pos_after_tag in
destr (jump_dsum_cases_eq t f g) (jump_dsum_cases_if t f g) (fun _ _ -> ()) (fun _ _ _ _ -> ()) (jump_dsum_cases' t f f32 g32) tg input pos_after_tag
#pop-options
inline_for_extraction
let read_dsum_cases'
(t: dsum)
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(f32: (x: dsum_known_key t) -> Tot (leaf_reader (dsnd (f x))))
(#k': parser_kind)
(g: parser k' (dsum_type_of_unknown_tag t))
(g32: leaf_reader g)
(x: dsum_key t)
: Tot (leaf_reader (parse_dsum_cases' t f g x))
= fun #rrel #rel input pos ->
[@inline_let]
let _ = synth_dsum_case_injective t x in
match x with
| Known x' ->
read_synth'
(dsnd (f x'))
(synth_dsum_case t (Known x'))
(f32 x')
()
input
pos
| Unknown x' ->
read_synth'
g
(synth_dsum_case t (Unknown x'))
g32
()
input
pos
inline_for_extraction
let read_dsum_cases_t
(t: dsum)
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(#k': parser_kind)
(g: parser k' (dsum_type_of_unknown_tag t))
(k: dsum_known_key t)
: Tot Type
= leaf_reader (parse_dsum_cases' t f g (Known k))
let read_dsum_cases_t_eq
(t: dsum)
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(#k': parser_kind)
(g: parser k' (dsum_type_of_unknown_tag t))
(k: dsum_known_key t)
(x y : read_dsum_cases_t t f g k)
: GTot Type0
= True
inline_for_extraction
let read_dsum_cases_t_if
(t: dsum)
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(#k': parser_kind)
(g: parser k' (dsum_type_of_unknown_tag t))
(k: dsum_known_key t)
: Tot (if_combinator _ (read_dsum_cases_t_eq t f g k))
= fun cond (sv_true: cond_true cond -> Tot (read_dsum_cases_t t f g k)) (sv_false: cond_false cond -> Tot (read_dsum_cases_t t f g k)) #_ #_ input pos ->
if cond
then sv_true () input pos
else sv_false () input pos
inline_for_extraction
let read_dsum_cases
(t: dsum)
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(f32: (x: dsum_known_key t) -> Tot (leaf_reader (dsnd (f x))))
(#k': parser_kind)
(g: parser k' (dsum_type_of_unknown_tag t))
(g32: leaf_reader g)
(destr: dep_enum_destr _ (read_dsum_cases_t t f g))
(x: dsum_key t)
: Tot (leaf_reader (parse_dsum_cases' t f g x))
= fun #_ #_ input pos ->
match x with
| Known k ->
destr
_
(read_dsum_cases_t_if t f g)
(fun _ _ -> ())
(fun _ _ _ _ -> ())
(fun k -> read_dsum_cases' t f f32 g g32 (Known k))
k
input
pos
| Unknown r ->
read_dsum_cases' t f f32 g g32 (Unknown r) input pos
#push-options "--z3rlimit 16"
inline_for_extraction
let read_dsum
(#kt: parser_kind)
(t: dsum)
(#p: parser kt (dsum_repr_type t))
(p32: leaf_reader (parse_maybe_enum_key p (dsum_enum t)))
(j: jumper p)
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(f32: (x: dsum_known_key t) -> Tot (leaf_reader (dsnd (f x))))
(#k': parser_kind)
(#g: parser k' (dsum_type_of_unknown_tag t))
(g32: leaf_reader g)
(destr: dep_enum_destr _ (read_dsum_cases_t t f g))
: Tot (leaf_reader (parse_dsum t p f g))
= fun #_ #_ input pos ->
let h = HST.get () in
valid_facts (parse_dsum t p f g) h input pos;
parse_dsum_eq_ t p f g (bytes_of_slice_from h input pos);
valid_facts (parse_maybe_enum_key p (dsum_enum t)) h input pos;
let k = p32 input pos in
let pos' = jump_maybe_enum_key j (dsum_enum t) input pos in
valid_facts (parse_dsum_cases' t f g k) h input pos' ;
read_dsum_cases t f f32 g g32 destr k input pos'
#pop-options
inline_for_extraction
let serialize32_dsum_type_of_tag
(t: dsum)
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(sf: (x: dsum_known_key t) -> Tot (serializer (dsnd (f x))))
(sf32: (x: dsum_known_key t) -> Tot (serializer32 (sf x)))
(#k': parser_kind)
(#g: parser k' (dsum_type_of_unknown_tag t))
(#sg: serializer g)
(sg32: serializer32 sg)
(tg: dsum_key t)
: Tot (serializer32 (serialize_dsum_type_of_tag t f sf g sg tg))
= match tg with
| Known x' -> serialize32_ext (dsnd (f x')) (sf x') (sf32 x') (parse_dsum_type_of_tag t f g tg) ()
| Unknown x' -> serialize32_ext g sg sg32 (parse_dsum_type_of_tag t f g tg) ()
inline_for_extraction
let serialize32_dsum_cases_aux
(t: dsum)
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(sf: (x: dsum_known_key t) -> Tot (serializer (dsnd (f x))))
(sf32: (x: dsum_known_key t) -> Tot (serializer32 (sf x)))
(#k': parser_kind)
(#g: parser k' (dsum_type_of_unknown_tag t))
(#sg: serializer g)
(sg32: serializer32 sg)
(tg: dsum_key t)
: Tot (serializer32 (serialize_dsum_cases t f sf g sg tg))
= [@inline_let]
let _ = synth_dsum_case_injective t tg in
[@inline_let]
let _ = synth_dsum_case_inverse t tg in
serialize32_synth
(serialize32_dsum_type_of_tag t f sf sf32 sg32 tg)
(synth_dsum_case t tg)
(synth_dsum_case_recip t tg)
(fun x -> synth_dsum_case_recip t tg x)
()
inline_for_extraction
let serialize32_dsum_cases_t
(t: dsum)
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(sf: (x: dsum_known_key t) -> Tot (serializer (dsnd (f x))))
(#k': parser_kind)
(g: parser k' (dsum_type_of_unknown_tag t))
(sg: serializer g)
(k: dsum_known_key t)
: Tot Type
= serializer32 (serialize_dsum_cases t f sf g sg (Known k))
let serialize32_dsum_cases_t_eq
(t: dsum)
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(sf: (x: dsum_known_key t) -> Tot (serializer (dsnd (f x))))
(#k': parser_kind)
(g: parser k' (dsum_type_of_unknown_tag t))
(sg: serializer g)
(k: dsum_known_key t)
(x y: serialize32_dsum_cases_t t f sf g sg k)
: GTot Type0
= True
inline_for_extraction
let serialize32_dsum_cases_t_if
(t: dsum)
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(sf: (x: dsum_known_key t) -> Tot (serializer (dsnd (f x))))
(#k': parser_kind)
(g: parser k' (dsum_type_of_unknown_tag t))
(sg: serializer g)
(k: dsum_known_key t)
: Tot (if_combinator _ (serialize32_dsum_cases_t_eq t f sf g sg k))
= fun cond (sv_true: (cond_true cond -> Tot (serialize32_dsum_cases_t t f sf g sg k))) (sv_false: (cond_false cond -> Tot (serialize32_dsum_cases_t t f sf g sg k))) x #rrel #rel output pos ->
if cond
then (sv_true () x output pos)
else (sv_false () x output pos)
inline_for_extraction
let serialize32_dsum_cases
(t: dsum)
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(sf: (x: dsum_known_key t) -> Tot (serializer (dsnd (f x))))
(sf32: (x: dsum_known_key t) -> Tot (serializer32 (sf x)))
(#k': parser_kind)
(#g: parser k' (dsum_type_of_unknown_tag t))
(#sg: serializer g)
(sg32: serializer32 sg)
(destr: dep_enum_destr _ (serialize32_dsum_cases_t t f sf g sg))
(tg: dsum_key t)
: Tot (serializer32 (serialize_dsum_cases t f sf g sg tg))
= fun x #rrel #rel output pos ->
match tg with
| Known k ->
destr
_
(serialize32_dsum_cases_t_if t f sf g sg)
(fun _ _ -> ())
(fun _ _ _ _ -> ())
(fun k -> serialize32_dsum_cases_aux t f sf sf32 sg32 (Known k))
k
x
output
pos
| Unknown r ->
serialize32_dsum_cases_aux t f sf sf32 sg32 (Unknown r) x output pos | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"LowStar.Buffer.fst.checked",
"LowParse.Spec.Sum.fst.checked",
"LowParse.Low.Enum.fst.checked",
"FStar.UInt64.fsti.checked",
"FStar.UInt32.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Int.Cast.fst.checked",
"FStar.HyperStack.ST.fsti.checked",
"FStar.HyperStack.fst.checked",
"FStar.Classical.fsti.checked"
],
"interface_file": false,
"source_file": "LowParse.Low.Sum.fst"
} | [
{
"abbrev": true,
"full_module": "FStar.HyperStack",
"short_module": "HS"
},
{
"abbrev": true,
"full_module": "FStar.UInt64",
"short_module": "U64"
},
{
"abbrev": true,
"full_module": "FStar.Int.Cast",
"short_module": "Cast"
},
{
"abbrev": true,
"full_module": "LowStar.Buffer",
"short_module": "B"
},
{
"abbrev": true,
"full_module": "FStar.HyperStack.ST",
"short_module": "HST"
},
{
"abbrev": true,
"full_module": "FStar.UInt32",
"short_module": "U32"
},
{
"abbrev": false,
"full_module": "LowParse.Spec.Sum",
"short_module": null
},
{
"abbrev": false,
"full_module": "LowParse.Low.Enum",
"short_module": null
},
{
"abbrev": false,
"full_module": "LowParse.Low",
"short_module": null
},
{
"abbrev": false,
"full_module": "LowParse.Low",
"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",
"short_module": null
}
] | {
"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_elim_box": false,
"smtencoding_l_arith_repr": "boxwrap",
"smtencoding_nl_arith_repr": "boxwrap",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": true,
"z3cliopt": [],
"z3refresh": false,
"z3rlimit": 5,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | false |
t: LowParse.Spec.Sum.dsum ->
s:
LowParse.Spec.Base.serializer p
{ Mkparser_kind'?.parser_kind_subkind kt ==
FStar.Pervasives.Native.Some LowParse.Spec.Base.ParserStrong } ->
s32:
LowParse.Low.Base.serializer32 (LowParse.Spec.Enum.serialize_maybe_enum_key p
s
(LowParse.Spec.Sum.dsum_enum t)) ->
f:
(x: LowParse.Spec.Sum.dsum_known_key t
-> Prims.dtuple2 LowParse.Spec.Base.parser_kind
(fun k -> LowParse.Spec.Base.parser k (LowParse.Spec.Sum.dsum_type_of_known_tag t x))) ->
sf:
(x: LowParse.Spec.Sum.dsum_known_key t
-> LowParse.Spec.Base.serializer (FStar.Pervasives.dsnd (f x))) ->
sf32: (x: LowParse.Spec.Sum.dsum_known_key t -> LowParse.Low.Base.serializer32 (sf x)) ->
sg32: LowParse.Low.Base.serializer32 sg ->
destr:
LowParse.Spec.Enum.dep_enum_destr (LowParse.Spec.Sum.dsum_enum t)
(LowParse.Low.Sum.serialize32_dsum_cases_t t f sf g sg)
-> LowParse.Low.Base.serializer32 (LowParse.Spec.Sum.serialize_dsum t s f sf g sg) | Prims.Tot | [
"total"
] | [] | [
"LowParse.Spec.Base.parser_kind",
"LowParse.Spec.Sum.dsum",
"LowParse.Spec.Base.parser",
"LowParse.Spec.Sum.dsum_repr_type",
"LowParse.Spec.Base.serializer",
"Prims.eq2",
"FStar.Pervasives.Native.option",
"LowParse.Spec.Base.parser_subkind",
"LowParse.Spec.Base.__proj__Mkparser_kind'__item__parser_kind_subkind",
"FStar.Pervasives.Native.Some",
"LowParse.Spec.Base.ParserStrong",
"LowParse.Low.Base.serializer32",
"LowParse.Spec.Enum.maybe_enum_key",
"LowParse.Spec.Sum.dsum_key_type",
"LowParse.Spec.Sum.dsum_enum",
"LowParse.Spec.Enum.parse_maybe_enum_key",
"LowParse.Spec.Enum.serialize_maybe_enum_key",
"LowParse.Spec.Sum.dsum_known_key",
"Prims.dtuple2",
"LowParse.Spec.Sum.dsum_type_of_known_tag",
"Prims.__proj__Mkdtuple2__item___1",
"FStar.Pervasives.dsnd",
"LowParse.Spec.Sum.dsum_type_of_unknown_tag",
"LowParse.Spec.Enum.dep_enum_destr",
"LowParse.Low.Sum.serialize32_dsum_cases_t",
"LowParse.Spec.Sum.dsum_type",
"LowStar.Monotonic.Buffer.srel",
"LowParse.Bytes.byte",
"LowStar.Monotonic.Buffer.mbuffer",
"FStar.UInt32.t",
"LowParse.Low.Combinators.serialize32_nondep_then_aux",
"LowParse.Spec.Sum.weaken_parse_dsum_cases_kind",
"LowParse.Spec.Sum.dsum_cases",
"LowParse.Spec.Sum.parse_dsum_cases",
"LowParse.Spec.Sum.serialize_dsum_cases",
"LowParse.Low.Sum.serialize32_dsum_cases",
"LowParse.Spec.Sum.dsum_key",
"LowParse.Spec.Sum.dsum_tag_of_data",
"Prims.unit",
"LowParse.Spec.Sum.serialize_dsum_eq'",
"LowParse.Spec.Sum.parse_dsum_kind",
"LowParse.Spec.Sum.parse_dsum",
"LowParse.Spec.Sum.serialize_dsum"
] | [] | false | false | false | false | false | let serialize32_dsum
(#kt: parser_kind)
(t: dsum)
(#p: parser kt (dsum_repr_type t))
(s: serializer p {kt.parser_kind_subkind == Some ParserStrong})
(s32: serializer32 (serialize_maybe_enum_key _ s (dsum_enum t)))
(f: (x: dsum_known_key t -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x))))
(sf: (x: dsum_known_key t -> Tot (serializer (dsnd (f x)))))
(sf32: (x: dsum_known_key t -> Tot (serializer32 (sf x))))
(#k': parser_kind)
(#g: parser k' (dsum_type_of_unknown_tag t))
(#sg: serializer g)
(sg32: serializer32 sg)
(destr: dep_enum_destr _ (serialize32_dsum_cases_t t f sf g sg))
: Tot (serializer32 (serialize_dsum t s f sf g sg)) =
| fun x #_ #_ output pos ->
[@@ inline_let ]let _ = serialize_dsum_eq' t s f sf g sg x in
let tg = dsum_tag_of_data t x in
serialize32_nondep_then_aux s32 (serialize32_dsum_cases t f sf sf32 sg32 destr tg) tg x output pos | false |
Vale.Curve25519.Fast_defs.fst | Vale.Curve25519.Fast_defs.pow2_two | val pow2_two (c0 c1: nat) : nat | val pow2_two (c0 c1: nat) : nat | let pow2_two (c0 c1:nat) : nat = c0 + pow2_64 * c1 | {
"file_name": "vale/code/crypto/ecc/curve25519/Vale.Curve25519.Fast_defs.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 50,
"end_line": 20,
"start_col": 0,
"start_line": 20
} | module Vale.Curve25519.Fast_defs
open Vale.Def.Words_s
open Vale.Def.Types_s
open FStar.Mul
unfold let pow2_192 = 0x1000000000000000000000000000000000000000000000000
let _ = assert_norm (pow2 192 = pow2_192)
unfold let pow2_256 = 0x10000000000000000000000000000000000000000000000000000000000000000
let _ = assert_norm (pow2 256 = pow2_256)
unfold let pow2_320 = 0x100000000000000000000000000000000000000000000000000000000000000000000000000000000
let _ = assert_norm (pow2 320 = pow2_320)
unfold let pow2_384 = 0x1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000
let _ = assert_norm (pow2 384 = pow2_384)
unfold let pow2_448 = 0x10000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000
let _ = assert_norm (pow2 448 = pow2_448)
unfold let pow2_512 = 0x100000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000
let _ = assert_norm (pow2 512 = pow2_512) | {
"checked_file": "/",
"dependencies": [
"Vale.Def.Words_s.fsti.checked",
"Vale.Def.Types_s.fst.checked",
"Vale.Curve25519.Fast_lemmas_internal.fsti.checked",
"Vale.Arch.Types.fsti.checked",
"prims.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked"
],
"interface_file": false,
"source_file": "Vale.Curve25519.Fast_defs.fst"
} | [
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Def.Types_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Def.Words_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Curve25519",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Curve25519",
"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",
"short_module": null
}
] | {
"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_elim_box": true,
"smtencoding_l_arith_repr": "native",
"smtencoding_nl_arith_repr": "wrapped",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": false,
"z3cliopt": [
"smt.arith.nl=false",
"smt.QI.EAGER_THRESHOLD=100",
"smt.CASE_SPLIT=3"
],
"z3refresh": false,
"z3rlimit": 5,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | false | c0: Prims.nat -> c1: Prims.nat -> Prims.nat | Prims.Tot | [
"total"
] | [] | [
"Prims.nat",
"Prims.op_Addition",
"FStar.Mul.op_Star",
"Vale.Def.Words_s.pow2_64"
] | [] | false | false | false | true | false | let pow2_two (c0 c1: nat) : nat =
| c0 + pow2_64 * c1 | false |
LowParse.Low.Sum.fst | LowParse.Low.Sum.serialize32_dsum_type_of_tag | val serialize32_dsum_type_of_tag
(t: dsum)
(f: (x: dsum_known_key t -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x))))
(sf: (x: dsum_known_key t -> Tot (serializer (dsnd (f x)))))
(sf32: (x: dsum_known_key t -> Tot (serializer32 (sf x))))
(#k': parser_kind)
(#g: parser k' (dsum_type_of_unknown_tag t))
(#sg: serializer g)
(sg32: serializer32 sg)
(tg: dsum_key t)
: Tot (serializer32 (serialize_dsum_type_of_tag t f sf g sg tg)) | val serialize32_dsum_type_of_tag
(t: dsum)
(f: (x: dsum_known_key t -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x))))
(sf: (x: dsum_known_key t -> Tot (serializer (dsnd (f x)))))
(sf32: (x: dsum_known_key t -> Tot (serializer32 (sf x))))
(#k': parser_kind)
(#g: parser k' (dsum_type_of_unknown_tag t))
(#sg: serializer g)
(sg32: serializer32 sg)
(tg: dsum_key t)
: Tot (serializer32 (serialize_dsum_type_of_tag t f sf g sg tg)) | let serialize32_dsum_type_of_tag
(t: dsum)
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(sf: (x: dsum_known_key t) -> Tot (serializer (dsnd (f x))))
(sf32: (x: dsum_known_key t) -> Tot (serializer32 (sf x)))
(#k': parser_kind)
(#g: parser k' (dsum_type_of_unknown_tag t))
(#sg: serializer g)
(sg32: serializer32 sg)
(tg: dsum_key t)
: Tot (serializer32 (serialize_dsum_type_of_tag t f sf g sg tg))
= match tg with
| Known x' -> serialize32_ext (dsnd (f x')) (sf x') (sf32 x') (parse_dsum_type_of_tag t f g tg) ()
| Unknown x' -> serialize32_ext g sg sg32 (parse_dsum_type_of_tag t f g tg) () | {
"file_name": "src/lowparse/LowParse.Low.Sum.fst",
"git_rev": "00217c4a89f5ba56002ba9aa5b4a9d5903bfe9fa",
"git_url": "https://github.com/project-everest/everparse.git",
"project_name": "everparse"
} | {
"end_col": 80,
"end_line": 1644,
"start_col": 0,
"start_line": 1631
} | module LowParse.Low.Sum
include LowParse.Low.Enum
include LowParse.Spec.Sum
module U32 = FStar.UInt32
module HST = FStar.HyperStack.ST
module B = LowStar.Buffer
module Cast = FStar.Int.Cast
module U64 = FStar.UInt64
inline_for_extraction
let validate_sum_cases_aux
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(vc: ((x: sum_key t) -> Tot (validator (dsnd (pc x)))))
(k: sum_key t)
: Tot (validator (parse_sum_cases t pc k))
= [@inline_let]
let _ = synth_sum_case_injective t k in
validate_synth
(validate_weaken
(weaken_parse_cases_kind t pc)
(vc k)
()
)
(synth_sum_case t k)
()
inline_for_extraction
let validate_sum_cases_t
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot Type
= validator (parse_sum_cases t pc k)
let validate_sum_cases_t_eq
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
(x y : validate_sum_cases_t t pc k)
: GTot Type0
= True
inline_for_extraction
let validate_sum_cases_t_if
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (if_combinator _ (validate_sum_cases_t_eq t pc k))
= fun cond (sv_true: cond_true cond -> Tot (validate_sum_cases_t t pc k)) (sv_false: cond_false cond -> Tot (validate_sum_cases_t t pc k)) #rrel #rel input pos ->
if cond
then sv_true () input pos
else sv_false () input pos
inline_for_extraction
let validate_sum_cases
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(vc: ((x: sum_key t) -> Tot (validator (dsnd (pc x)))))
(destr: dep_enum_destr (sum_enum t) (validate_sum_cases_t t pc))
(k: sum_key t)
: Tot (validator (parse_sum_cases t pc k))
= destr
_
(validate_sum_cases_t_if t pc)
(fun _ _ -> ())
(fun _ _ _ _ -> ())
(validate_sum_cases_aux t pc vc)
k
inline_for_extraction
let validate_sum_aux_payload_t
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
: Tot Type
= (#rrel: _) -> (#rel: _) ->
(input: slice rrel rel) ->
(pos: U64.t) ->
HST.Stack U64.t
(requires (fun h -> live_slice h input /\ U64.v pos <= U32.v input.len))
(ensures (fun h res h' ->
B.modifies B.loc_none h h' /\ (
match k with
| Unknown _ -> is_error res
| Known k' ->
if is_success res
then
valid_pos (dsnd (pc k')) h input (uint64_to_uint32 pos) (uint64_to_uint32 res)
else
(~ (valid (dsnd (pc k')) h input (uint64_to_uint32 pos)))
)))
let validate_sum_aux_payload_eq
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
: Tot (validate_sum_aux_payload_t t pc k -> validate_sum_aux_payload_t t pc k -> GTot Type0)
= fun _ _ -> True
inline_for_extraction
let validate_sum_aux_payload_if'
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
(cond: bool)
(ift: ((cond_true cond) -> Tot (validate_sum_aux_payload_t t pc k)))
(iff: ((cond_false cond) -> Tot (validate_sum_aux_payload_t t pc k)))
: Tot (validate_sum_aux_payload_t t pc k)
= fun #rrel #rel input pos ->
if cond
then begin
(ift () <: validate_sum_aux_payload_t t pc k) input pos
end else
(iff () <: validate_sum_aux_payload_t t pc k) input pos
inline_for_extraction
let validate_sum_aux_payload_if
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
: Tot (if_combinator _ (validate_sum_aux_payload_eq t pc k))
= validate_sum_aux_payload_if' t pc k
#push-options "--z3rlimit 64 --z3cliopt smt.arith.nl=false --using_facts_from '* -FStar.Int.Cast -LowParse.BitFields'"
// --query_stats --smtencoding.elim_box true --smtencoding.l_arith_repr native --z3refresh"
inline_for_extraction
let validate_sum_aux
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(v: validator p)
(p32: leaf_reader p)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(v_payload: ((k: sum_repr_type t)) -> Tot (validate_sum_aux_payload_t t pc (maybe_enum_key_of_repr (sum_enum t) k)))
: Tot (validator (parse_sum t p pc))
= fun #rrel #rel input pos ->
let h = HST.get () in
[@inline_let]
let _ = parse_sum_eq'' t p pc (bytes_of_slice_from h input (uint64_to_uint32 pos)) in
[@inline_let]
let _ = valid_facts (parse_sum t p pc) h input (uint64_to_uint32 pos) in
[@inline_let]
let _ = valid_facts p h input (uint64_to_uint32 pos) in
let len_after_tag = v input pos in
if is_error len_after_tag
then len_after_tag
else begin
let h1 = HST.get () in
let k' = p32 input (uint64_to_uint32 pos) in
[@inline_let]
let _ =
match maybe_enum_key_of_repr (sum_enum t) k' with
| Known k -> valid_facts (dsnd (pc k)) h input (uint64_to_uint32 len_after_tag)
| _ -> ()
in
v_payload k' input len_after_tag
end
#pop-options
inline_for_extraction
let validate_sum_aux_payload'
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (validator (dsnd (pc x)))))
(k: maybe_enum_key (sum_enum t))
: Tot (validate_sum_aux_payload_t t pc k)
= fun #rrel #rel input pos ->
match k with
| Known k ->
[@inline_let]
let _ = synth_sum_case_injective t k in
pc32 k input pos
// validate_synth (pc32 k) (synth_sum_case t k) () input pos
| _ -> validator_error_generic
inline_for_extraction
let validate_sum_aux_payload
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (validator (dsnd (pc x)))))
(destr: dep_maybe_enum_destr_t (sum_enum t) (validate_sum_aux_payload_t t pc))
(k: sum_repr_type t)
: Tot (validate_sum_aux_payload_t t pc (maybe_enum_key_of_repr (sum_enum t) k))
= destr (validate_sum_aux_payload_eq t pc) (validate_sum_aux_payload_if t pc) (fun _ _ -> ()) (fun _ _ _ _ -> ()) (validate_sum_aux_payload' t pc pc32) k
inline_for_extraction
let validate_sum
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(v: validator p)
(p32: leaf_reader p)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (validator (dsnd (pc x)))))
(destr: dep_maybe_enum_destr_t (sum_enum t) (validate_sum_aux_payload_t t pc))
: Tot (validator (parse_sum t p pc))
= validate_sum_aux t v p32 pc (validate_sum_aux_payload t pc pc32 destr)
module HS = FStar.HyperStack
#push-options "--z3rlimit 256 --z3cliopt smt.arith.nl=false --initial_ifuel 8 --max_ifuel 8 --initial_fuel 2 --max_fuel 2"
#restart-solver
let valid_sum_intro
(h: HS.mem)
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: Lemma
(requires (
valid (parse_enum_key p (sum_enum t)) h input pos /\ (
let k = contents (parse_enum_key p (sum_enum t)) h input pos in
valid (dsnd (pc k)) h input (get_valid_pos (parse_enum_key p (sum_enum t)) h input pos)
)))
(ensures (
let k = contents (parse_enum_key p (sum_enum t)) h input pos in
let pos_payload = get_valid_pos (parse_enum_key p (sum_enum t)) h input pos in
valid_content_pos
(parse_sum t p pc) h input pos
(synth_sum_case t k (contents (dsnd (pc k)) h input pos_payload))
(get_valid_pos (dsnd (pc k)) h input pos_payload)
))
= valid_facts (parse_enum_key p (sum_enum t)) h input pos;
let k = contents (parse_enum_key p (sum_enum t)) h input pos in
let pos_payload = get_valid_pos (parse_enum_key p (sum_enum t)) h input pos in
valid_facts (dsnd (pc k)) h input pos_payload;
valid_facts (parse_sum t p pc) h input pos;
parse_sum_eq t p pc (bytes_of_slice_from h input pos)
#pop-options
inline_for_extraction
let finalize_sum_case
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(s: serializer p)
(w: leaf_writer_strong s)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(destr: enum_repr_of_key'_t (sum_enum t))
(k: sum_key t)
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: HST.Stack unit
(requires (fun h ->
let len_tag = serialized_length (serialize_enum_key _ s (sum_enum t)) k in
U32.v pos + len_tag < 4294967296 /\ (
let pos_payload = pos `U32.add` U32.uint_to_t len_tag in
valid (dsnd (pc k)) h input pos_payload /\
writable input.base (U32.v pos) (U32.v pos_payload) h
)))
(ensures (fun h _ h' ->
let len_tag = serialized_length (serialize_enum_key _ s (sum_enum t)) k in
let pos_payload = pos `U32.add` U32.uint_to_t len_tag in
B.modifies (loc_slice_from_to input pos pos_payload) h h' /\
valid_content_pos (parse_sum t p pc) h' input pos (synth_sum_case t k (contents (dsnd (pc k)) h input pos_payload)) (get_valid_pos (dsnd (pc k)) h input pos_payload)
))
= let pos1 = write_enum_key w (sum_enum t) destr k input pos in
let h = HST.get () in
[@inline_let]
let _ = valid_sum_intro h t p pc input pos in
()
inline_for_extraction
let jump_sum_cases_aux
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(vc: ((x: sum_key t) -> Tot (jumper (dsnd (pc x)))))
(k: sum_key t)
: Tot (jumper (parse_sum_cases t pc k))
= [@inline_let]
let _ = synth_sum_case_injective t k in
jump_synth
(jump_weaken
(weaken_parse_cases_kind t pc)
(vc k)
()
)
(synth_sum_case t k)
()
inline_for_extraction
let jump_sum_cases_t
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot Type
= jumper (parse_sum_cases t pc k)
let jump_sum_cases_t_eq
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
(x y : jump_sum_cases_t t pc k)
: GTot Type0
= True
inline_for_extraction
let jump_sum_cases_t_if
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (if_combinator _ (jump_sum_cases_t_eq t pc k))
= fun cond (sv_true: cond_true cond -> Tot (jump_sum_cases_t t pc k)) (sv_false: cond_false cond -> Tot (jump_sum_cases_t t pc k)) #rrel #rel input pos ->
if cond
then sv_true () input pos
else sv_false () input pos
inline_for_extraction
let jump_sum_cases
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(vc: ((x: sum_key t) -> Tot (jumper (dsnd (pc x)))))
(destr: dep_enum_destr (sum_enum t) (jump_sum_cases_t t pc))
(k: sum_key t)
: Tot (jumper (parse_sum_cases t pc k))
= destr
_
(jump_sum_cases_t_if t pc)
(fun _ _ -> ())
(fun _ _ _ _ -> ())
(jump_sum_cases_aux t pc vc)
k
inline_for_extraction
let jump_sum_aux_payload_t
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
: Tot Type
= (#rrel: _) -> (#rel: _) ->
(input: slice rrel rel) ->
(pos: U32.t) ->
HST.Stack U32.t
(requires (fun h -> live_slice h input /\ U32.v pos <= U32.v input.len /\ (
match k with
| Unknown _ -> False
| Known k' -> valid (dsnd (pc k')) h input pos
)))
(ensures (fun h res h' ->
B.modifies B.loc_none h h' /\ (
match k with
| Unknown _ -> False
| Known k' ->
valid_pos (dsnd (pc k')) h input pos res
)))
let jump_sum_aux_payload_eq
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
: Tot (jump_sum_aux_payload_t t pc k -> jump_sum_aux_payload_t t pc k -> GTot Type0)
= fun _ _ -> True
inline_for_extraction
let jump_sum_aux_payload_if'
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
(cond: bool)
(ift: ((cond_true cond) -> Tot (jump_sum_aux_payload_t t pc k)))
(iff: ((cond_false cond) -> Tot (jump_sum_aux_payload_t t pc k)))
: Tot (jump_sum_aux_payload_t t pc k)
= fun #rrel #rel input pos ->
if cond
then begin
(ift () <: jump_sum_aux_payload_t t pc k) input pos
end else
(iff () <: jump_sum_aux_payload_t t pc k) input pos
inline_for_extraction
let jump_sum_aux_payload_if
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
: Tot (if_combinator _ (jump_sum_aux_payload_eq t pc k))
= jump_sum_aux_payload_if' t pc k
let parse_sum_eq3
(#kt: parser_kind)
(t: sum)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(input: bytes)
(k' : sum_repr_type t)
(consumed_k: consumed_length input)
: Lemma
(requires (Some? (parse (parse_sum t p pc) input) /\ parse p input == Some (k', consumed_k)))
(ensures (
let input_k = Seq.slice input consumed_k (Seq.length input) in
let k = maybe_enum_key_of_repr (sum_enum t) k' in
begin match k with
| Known k ->
Some? (parse (dsnd (pc k)) input_k)
| _ -> False
end
))
= parse_sum_eq'' t p pc input
let parse_sum_eq4
(#kt: parser_kind)
(t: sum)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(input: bytes)
(k' : sum_repr_type t)
(consumed_k: consumed_length input)
(consumed_payload: nat)
: Lemma
(requires (Some? (parse (parse_sum t p pc) input) /\ parse p input == Some (k', consumed_k) /\ (
let input_k = Seq.slice input consumed_k (Seq.length input) in
let k = maybe_enum_key_of_repr (sum_enum t) k' in
begin match k with
| Known k ->
Some? (parse (dsnd (pc k)) input_k) /\ (
let Some (_, consumed_payload') = parse (dsnd (pc k)) input_k in
consumed_payload' == consumed_payload
)
| _ -> False
end
)))
(ensures (
let Some (_, consumed) = parse (parse_sum t p pc) input in
consumed == consumed_k + consumed_payload
))
= parse_sum_eq'' t p pc input
#push-options "--z3rlimit 16"
let valid_sum_elim
(h: HS.mem)
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(#rrel: _) (#rel: _)
(input: slice rrel rel)
(pos: U32.t)
: Lemma
(requires (
valid (parse_sum t p pc) h input pos
))
(ensures (
valid p h input pos /\ (
let pos_payload = get_valid_pos p h input pos in
let k' = maybe_enum_key_of_repr (sum_enum t) (contents p h input pos) in
match k' with
| Known k ->
k == sum_tag_of_data t (contents (parse_sum t p pc) h input pos) /\
valid (dsnd (pc k)) h input pos_payload /\
valid_pos
(parse_sum t p pc) h input pos
(get_valid_pos (dsnd (pc k)) h input pos_payload)
| _ -> False
)))
= let sinput = bytes_of_slice_from h input pos in
let _ = parse_sum_eq'' t p pc sinput in
[@inline_let]
let _ = valid_facts (parse_sum t p pc) h input pos in
let Some (k', consumed_k) = parse p sinput in
let pos_after_tag = U32.uint_to_t (U32.v pos + consumed_k) in
[@inline_let]
let _ = valid_facts p h input pos in
assert (valid_content_pos p h input pos k' pos_after_tag);
match maybe_enum_key_of_repr (sum_enum t) k' with
| Known k -> valid_facts (dsnd (pc k)) h input pos_after_tag
| _ -> ()
#pop-options
let valid_sum_elim_tag
(h: HS.mem)
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: Lemma
(requires (
valid (parse_sum t p pc) h input pos
))
(ensures (
valid (parse_enum_key p (sum_enum t)) h input pos /\
contents (parse_enum_key p (sum_enum t)) h input pos == sum_tag_of_data t (contents (parse_sum t p pc) h input pos)
))
= let _ = parse_sum_eq' t p pc (bytes_of_slice_from h input pos) in
let _ = valid_facts (parse_sum t p pc) h input pos in
let _ = valid_facts (parse_enum_key p (sum_enum t)) h input pos in
()
inline_for_extraction
let read_sum_tag
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(p32: leaf_reader p)
(destr: dep_maybe_enum_destr_t (sum_enum t) (read_enum_key_t (sum_enum t)))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: HST.Stack (sum_key t)
(requires (fun h ->
valid (parse_sum t p pc) h input pos
))
(ensures (fun h res h' ->
B.modifies B.loc_none h h' /\
res == sum_tag_of_data t (contents (parse_sum t p pc) h input pos)
))
= let h = HST.get () in
[@inline_let] let _ = valid_sum_elim_tag h t p pc input pos in
read_enum_key p32 (sum_enum t) destr input pos
inline_for_extraction
let jump_sum_aux
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(v: jumper p)
(p32: leaf_reader p)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(v_payload: ((k: sum_repr_type t)) -> Tot (jump_sum_aux_payload_t t pc (maybe_enum_key_of_repr (sum_enum t) k)))
: Tot (jumper (parse_sum t p pc))
= fun #rrel #rel input pos ->
let h = HST.get () in
[@inline_let]
let _ = valid_sum_elim h t p pc input pos in
let pos_after_tag = v input pos in
let k' = p32 input pos in
v_payload k' input pos_after_tag
inline_for_extraction
let jump_sum_aux_payload'
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (jumper (dsnd (pc x)))))
(k: maybe_enum_key (sum_enum t))
: Tot (jump_sum_aux_payload_t t pc k)
= fun #rrel #rel input pos ->
match k with
| Known k ->
[@inline_let]
let _ = synth_sum_case_injective t k in
pc32 k input pos
| _ -> 0ul // dummy, but we MUST NOT remove this branch, otherwise extraction fails
inline_for_extraction
let jump_sum_aux_payload
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (jumper (dsnd (pc x)))))
(destr: dep_maybe_enum_destr_t (sum_enum t) (jump_sum_aux_payload_t t pc))
(k: sum_repr_type t)
: Tot (jump_sum_aux_payload_t t pc (maybe_enum_key_of_repr (sum_enum t) k))
= destr (jump_sum_aux_payload_eq t pc) (jump_sum_aux_payload_if t pc) (fun _ _ -> ()) (fun _ _ _ _ -> ()) (jump_sum_aux_payload' t pc pc32) k
inline_for_extraction
let jump_sum
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(v: jumper p)
(p32: leaf_reader p)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (jumper (dsnd (pc x)))))
(destr: dep_maybe_enum_destr_t (sum_enum t) (jump_sum_aux_payload_t t pc))
: Tot (jumper (parse_sum t p pc))
= jump_sum_aux t v p32 pc (jump_sum_aux_payload t pc pc32 destr)
inline_for_extraction
let read_sum_cases'
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (leaf_reader (dsnd (pc x)))))
(k: sum_key t)
: Tot (leaf_reader (parse_sum_cases' t pc k))
= [@inline_let]
let _ = synth_sum_case_injective t k in
read_synth'
(dsnd (pc k))
(synth_sum_case t k)
(pc32 k)
()
inline_for_extraction
let read_sum_cases_t
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot Type
= leaf_reader (parse_sum_cases' t pc k)
let read_sum_cases_t_eq
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
(x y : read_sum_cases_t t pc k)
: GTot Type0
= True
inline_for_extraction
let read_sum_cases_t_if
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (if_combinator _ (read_sum_cases_t_eq t pc k))
= fun cond (sv_true: cond_true cond -> Tot (read_sum_cases_t t pc k)) (sv_false: cond_false cond -> Tot (read_sum_cases_t t pc k)) #_ #_ input pos ->
if cond
then (sv_true () input pos)
else (sv_false () input pos)
inline_for_extraction
let read_sum_cases
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (leaf_reader (dsnd (pc x)))))
(destr: dep_enum_destr (sum_enum t) (read_sum_cases_t t pc))
(k: sum_key t)
: Tot (leaf_reader (parse_sum_cases' t pc k))
= destr
_
(read_sum_cases_t_if t pc)
(fun _ _ -> ())
(fun _ _ _ _ -> ())
(read_sum_cases' t pc pc32)
k
#push-options "--z3rlimit 32"
inline_for_extraction
let read_sum
(#kt: parser_kind)
(t: sum)
(p: parser kt (sum_repr_type t))
(p32: leaf_reader (parse_enum_key p (sum_enum t)))
(j: jumper p)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (leaf_reader (dsnd (pc x)))))
(destr: dep_enum_destr (sum_enum t) (read_sum_cases_t t pc))
: Tot (leaf_reader (parse_sum t p pc))
=
fun #_ #_ input pos ->
let h = HST.get () in
valid_facts (parse_sum t p pc) h input pos;
parse_sum_eq' t p pc (bytes_of_slice_from h input pos);
valid_facts (parse_enum_key p (sum_enum t)) h input pos;
let k = p32 input pos in
let pos' = jump_enum_key j (sum_enum t) input pos in
valid_facts (parse_sum_cases' t pc k) h input pos' ;
read_sum_cases t pc pc32 destr k input pos'
#pop-options
inline_for_extraction
let serialize32_sum_cases_t
(t: sum)
(#pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(sc: ((x: sum_key t) -> Tot (serializer (dsnd (pc x)))))
(k: sum_key t)
: Tot Type
= serializer32 (serialize_sum_cases t pc sc k)
let serialize32_sum_cases_t_eq
(t: sum)
(#pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(sc: ((x: sum_key t) -> Tot (serializer (dsnd (pc x)))))
(k: sum_key t)
(x y: serialize32_sum_cases_t t sc k)
: GTot Type0
= True
inline_for_extraction
let serialize32_sum_cases_t_if
(t: sum)
(#pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(sc: ((x: sum_key t) -> Tot (serializer (dsnd (pc x)))))
(k: sum_key t)
: Tot (if_combinator _ (serialize32_sum_cases_t_eq t sc k))
= fun cond (sv_true: (cond_true cond -> Tot (serialize32_sum_cases_t t sc k))) (sv_false: (cond_false cond -> Tot (serialize32_sum_cases_t t sc k))) x #rrel #rel b pos ->
if cond
then (sv_true () x b pos)
else (sv_false () x b pos)
inline_for_extraction
let serialize32_sum_cases_aux
(t: sum)
(#pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(sc: ((x: sum_key t) -> Tot (serializer (dsnd (pc x)))))
(sc32: ((x: sum_key t) -> Tot (serializer32 (sc x))))
(k: sum_key t)
: Tot (serializer32 (serialize_sum_cases t pc sc k))
= fun x #rrel #rel b pos ->
[@inline_let] let _ =
Classical.forall_intro (parse_sum_cases_eq' t pc k);
synth_sum_case_injective t k;
synth_sum_case_inverse t k
in
serialize32_synth
(sc32 k)
(synth_sum_case t k)
(synth_sum_case_recip t k)
(fun x -> synth_sum_case_recip t k x)
()
x
b
pos
inline_for_extraction
let serialize32_sum_cases
(t: sum)
(#pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(sc: ((x: sum_key t) -> Tot (serializer (dsnd (pc x)))))
(sc32: ((x: sum_key t) -> Tot (serializer32 (sc x))))
(destr: dep_enum_destr (sum_enum t) (serialize32_sum_cases_t t sc))
(k: sum_key t)
: Tot (serializer32 (serialize_sum_cases t pc sc k))
= destr
_
(serialize32_sum_cases_t_if t sc)
(fun _ _ -> ())
(fun _ _ _ _ -> ())
(serialize32_sum_cases_aux t sc sc32)
k
inline_for_extraction
let serialize32_sum
(#kt: parser_kind)
(t: sum)
(#p: parser kt (sum_repr_type t))
(s: serializer p {kt.parser_kind_subkind == Some ParserStrong})
(s32: serializer32 (serialize_enum_key _ s (sum_enum t)))
(#pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(sc: ((x: sum_key t) -> Tot (serializer (dsnd (pc x)))))
(sc32: ((x: sum_key t) -> Tot (serializer32 (sc x))))
(destr: dep_enum_destr (sum_enum t) (serialize32_sum_cases_t t sc))
: Tot (serializer32 (serialize_sum t s sc))
= fun x #rrel #rel b pos ->
serialize_sum_eq t s sc x;
let tg = sum_tag_of_data t x in
serialize32_nondep_then_aux s32 (serialize32_sum_cases t sc sc32 destr tg) tg x b pos
let clens_sum_tag
(s: sum)
: Tot (clens (sum_type s) (sum_key s))
= {
clens_cond = (fun _ -> True);
clens_get = sum_tag_of_data s;
}
let gaccessor_sum_tag
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
: Tot (gaccessor (parse_sum t p pc) (parse_enum_key p (sum_enum t)) (clens_sum_tag t))
= gaccessor_tagged_union_tag
(parse_enum_key p (sum_enum t))
(sum_tag_of_data t)
(parse_sum_cases t pc)
inline_for_extraction
let accessor_sum_tag
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
: Tot (accessor (gaccessor_sum_tag t p pc))
= accessor_tagged_union_tag
(parse_enum_key p (sum_enum t))
(sum_tag_of_data t)
(parse_sum_cases t pc)
let clens_sum_payload
(s: sum)
(k: sum_key s)
: Tot (clens (sum_type s) (sum_type_of_tag s k))
= {
clens_cond = (fun (x: sum_type s) -> sum_tag_of_data s x == k);
clens_get = (fun (x: sum_type s) -> synth_sum_case_recip s k x <: Ghost (sum_type_of_tag s k) (requires (sum_tag_of_data s x == k)) (ensures (fun _ -> True)));
}
#push-options "--z3rlimit 32"
let gaccessor_clens_sum_payload'
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (gaccessor' (parse_sum t p pc) (dsnd (pc k)) (clens_sum_payload t k))
= fun (input: bytes) ->
parse_sum_eq'' t p pc input;
let res =
match parse p input with
| Some (_, consumed) ->
synth_sum_case_inverse t k;
synth_sum_case_injective t k;
synth_injective_synth_inverse_synth_inverse_recip (synth_sum_case t k) (synth_sum_case_recip t k) ();
(consumed)
| _ -> 0 // dummy
in
(res <: (res: _ { gaccessor_post' (parse_sum t p pc) (dsnd (pc k)) (clens_sum_payload t k) input res } ))
#push-options "--z3rlimit 64"
let gaccessor_clens_sum_payload_injective
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
(sl sl' : bytes)
: Lemma
(requires (
gaccessor_pre (parse_sum t p pc) (dsnd (pc k)) (clens_sum_payload t k) sl /\
gaccessor_pre (parse_sum t p pc) (dsnd (pc k)) (clens_sum_payload t k) sl' /\
injective_precond (parse_sum t p pc) sl sl'
))
(ensures (gaccessor_clens_sum_payload' t p pc k sl == gaccessor_clens_sum_payload' t p pc k sl'))
= parse_sum_eq'' t p pc sl;
parse_sum_eq'' t p pc sl' ;
parse_injective (parse_sum t p pc) sl sl' ;
parse_injective p sl sl'
#pop-options
let gaccessor_clens_sum_payload_no_lookahead
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
(sl sl' : bytes)
: Lemma
(requires (
(parse_sum_kind kt t pc).parser_kind_subkind == Some ParserStrong /\
gaccessor_pre (parse_sum t p pc) (dsnd (pc k)) (clens_sum_payload t k) sl /\
gaccessor_pre (parse_sum t p pc) (dsnd (pc k)) (clens_sum_payload t k) sl' /\
no_lookahead_on_precond (parse_sum t p pc) sl sl'
))
(ensures (gaccessor_clens_sum_payload' t p pc k sl == gaccessor_clens_sum_payload' t p pc k sl'))
= parse_sum_eq'' t p pc sl;
parse_sum_eq'' t p pc sl' ;
parse_strong_prefix (parse_sum t p pc) sl sl' ;
parse_injective p sl sl'
let gaccessor_clens_sum_payload
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (gaccessor (parse_sum t p pc) (dsnd (pc k)) (clens_sum_payload t k))
= Classical.forall_intro_2 (fun x -> Classical.move_requires (gaccessor_clens_sum_payload_injective t p pc k x));
Classical.forall_intro_2 (fun x -> Classical.move_requires (gaccessor_clens_sum_payload_no_lookahead t p pc k x));
gaccessor_prop_equiv (parse_sum t p pc) (dsnd (pc k)) (clens_sum_payload t k) (gaccessor_clens_sum_payload' t p pc k);
gaccessor_clens_sum_payload' t p pc k
inline_for_extraction
let accessor_clens_sum_payload'
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(j: jumper p)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: HST.Stack U32.t
(requires (fun h ->
valid (parse_sum t p pc) h input pos /\
(clens_sum_payload t k).clens_cond (contents (parse_sum t p pc) h input pos)
))
(ensures (fun h pos' h' ->
B.modifies B.loc_none h h' /\
pos' == slice_access h (gaccessor_clens_sum_payload t p pc k) input pos
))
=
let h = HST.get () in
[@inline_let]
let _ =
let pos' = get_valid_pos (parse_sum t p pc) h input pos in
let large = bytes_of_slice_from h input pos in
slice_access_eq h (gaccessor_clens_sum_payload t p pc k) input pos;
valid_facts (parse_sum t p pc) h input pos;
parse_sum_eq'' t p pc large;
valid_facts p h input pos
in
j input pos
#pop-options
inline_for_extraction
let accessor_clens_sum_payload
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(j: jumper p)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (accessor (gaccessor_clens_sum_payload t p pc k))
= fun #rrel #rel -> accessor_clens_sum_payload' t j pc k #rrel #rel
let clens_sum_cases_payload
(s: sum)
(k: sum_key s)
: Tot (clens (sum_cases s k) (sum_type_of_tag s k))
= {
clens_cond = (fun (x: sum_cases s k) -> True);
clens_get = (fun (x: sum_cases s k) -> synth_sum_case_recip s k x <: Ghost (sum_type_of_tag s k) (requires (True)) (ensures (fun _ -> True)));
}
let gaccessor_clens_sum_cases_payload
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (gaccessor (parse_sum_cases' t pc k) (dsnd (pc k)) (clens_sum_cases_payload t k))
= synth_sum_case_injective t k;
synth_sum_case_inverse t k;
synth_injective_synth_inverse_synth_inverse_recip (synth_sum_case t k) (synth_sum_case_recip t k) ();
gaccessor_ext
(gaccessor_synth (dsnd (pc k)) (synth_sum_case t k) (synth_sum_case_recip t k) ())
(clens_sum_cases_payload t k)
()
inline_for_extraction
let accessor_clens_sum_cases_payload
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (accessor (gaccessor_clens_sum_cases_payload t pc k))
= [@inline_let]
let _ =
synth_sum_case_injective t k;
synth_sum_case_inverse t k;
synth_injective_synth_inverse_synth_inverse_recip (synth_sum_case t k) (synth_sum_case_recip t k) ()
in
accessor_ext
(accessor_synth (dsnd (pc k)) (synth_sum_case t k) (synth_sum_case_recip t k) ())
(clens_sum_cases_payload t k)
()
inline_for_extraction
let validate_dsum_cases_t
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(#k: parser_kind)
(g: parser k (dsum_type_of_unknown_tag s))
(x: dsum_key s)
: Tot Type
= validator (parse_dsum_cases' s f g x)
let validate_dsum_cases_eq
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(#k: parser_kind)
(g: parser k (dsum_type_of_unknown_tag s))
(x: dsum_key s)
(v1 v2 : validate_dsum_cases_t s f g x)
: GTot Type0
= True
inline_for_extraction
let validate_dsum_cases_if'
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(#k: parser_kind)
(g: parser k (dsum_type_of_unknown_tag s))
(x: dsum_key s)
(cond: bool)
(ift: (cond_true cond -> Tot (validate_dsum_cases_t s f g x)))
(iff: (cond_false cond -> Tot (validate_dsum_cases_t s f g x)))
: Tot (validate_dsum_cases_t s f g x)
= fun #rrel #rel input len ->
if cond
then (ift () <: validate_dsum_cases_t s f g x) input len
else (iff () <: validate_dsum_cases_t s f g x) input len
inline_for_extraction
let validate_dsum_cases_if
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(#k: parser_kind)
(g: parser k (dsum_type_of_unknown_tag s))
(x: dsum_key s)
: Tot (if_combinator _ (validate_dsum_cases_eq s f g x))
= validate_dsum_cases_if' s f g x
inline_for_extraction
let validate_dsum_cases'
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(f' : (x: dsum_known_key s) -> Tot (validator (dsnd (f x))))
(#k: parser_kind)
(#g: parser k (dsum_type_of_unknown_tag s))
(g' : validator g)
(x: dsum_key s)
: Tot (validate_dsum_cases_t s f g x)
= [@inline_let]
let _ = synth_dsum_case_injective s x in
match x with
| Known x' -> validate_synth (f' x') (synth_dsum_case s (Known x')) () <: validator (parse_dsum_cases' s f g x)
| Unknown x' -> validate_synth g' (synth_dsum_case s (Unknown x')) () <: validator (parse_dsum_cases' s f g x)
inline_for_extraction
let validate_dsum_cases'_destr
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(f' : (x: dsum_known_key s) -> Tot (validator (dsnd (f x))))
(#k: parser_kind)
(#g: parser k (dsum_type_of_unknown_tag s))
(g' : validator g)
(destr: dep_enum_destr _ (fun k -> validate_dsum_cases_t s f g (Known k)))
(x: dsum_key s)
: Tot (validate_dsum_cases_t s f g x)
= fun #rrel #rel input pos ->
match x with
| Known k ->
destr
_
(fun k -> validate_dsum_cases_if s f g (Known k))
(fun _ _ -> ())
(fun _ _ _ _ -> ())
(fun k -> validate_dsum_cases' s f f' g' (Known k))
k
input
pos
| Unknown r -> validate_dsum_cases' s f f' g' (Unknown r) input pos
inline_for_extraction
let validate_dsum_cases
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(f' : (x: dsum_known_key s) -> Tot (validator (dsnd (f x))))
(#k: parser_kind)
(#g: parser k (dsum_type_of_unknown_tag s))
(g' : validator g)
(destr: dep_enum_destr _ (fun k -> validate_dsum_cases_t s f g (Known k)))
(x: dsum_key s)
: Tot (validator (parse_dsum_cases s f g x))
= fun #rrel #rel input pos ->
let h = HST.get () in
[@inline_let]
let _ =
valid_facts (parse_dsum_cases' s f g x) h input (uint64_to_uint32 pos);
valid_facts (parse_dsum_cases s f g x) h input (uint64_to_uint32 pos);
parse_dsum_cases_eq' s f g x (bytes_of_slice_from h input (uint64_to_uint32 pos))
in
validate_dsum_cases'_destr s f f' g' destr x input pos
#push-options "--z3rlimit 40"
inline_for_extraction
let validate_dsum
(#kt: parser_kind)
(t: dsum)
(#p: parser kt (dsum_repr_type t))
(v: validator p)
(p32: leaf_reader p)
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(f32: (x: dsum_known_key t) -> Tot (validator (dsnd (f x))))
(#k': parser_kind)
(#g: parser k' (dsum_type_of_unknown_tag t))
(g32: validator g)
(destr: dep_maybe_enum_destr_t (dsum_enum t) (validate_dsum_cases_t t f g))
: Tot (validator (parse_dsum t p f g))
= fun #rrel #rel input pos ->
let h = HST.get () in
[@inline_let]
let _ = parse_dsum_eq' t p f g (bytes_of_slice_from h input (uint64_to_uint32 pos)) in
[@inline_let]
let _ = valid_facts (parse_dsum t p f g) h input (uint64_to_uint32 pos) in
[@inline_let]
let _ = valid_facts p h input (uint64_to_uint32 pos) in
let pos_after_tag = v input pos in
if is_error pos_after_tag
then pos_after_tag
else
let tg = p32 input (uint64_to_uint32 pos) in
[@inline_let]
let _ = valid_facts (parse_dsum_cases' t f g (maybe_enum_key_of_repr (dsum_enum t) tg)) h input (uint64_to_uint32 pos_after_tag) in
destr (validate_dsum_cases_eq t f g) (validate_dsum_cases_if t f g) (fun _ _ -> ()) (fun _ _ _ _ -> ()) (validate_dsum_cases' t f f32 g32) tg input pos_after_tag
#pop-options
#reset-options "--z3rlimit 64 --z3cliopt smt.arith.nl=false --initial_ifuel 8 --max_ifuel 8 --initial_fuel 2 --max_fuel 2"
let valid_dsum_intro_known
(h: HS.mem)
(t: dsum)
(#kt: parser_kind)
(p: parser kt (dsum_repr_type t))
(f: ((x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x))))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: Lemma
(requires (
valid (parse_maybe_enum_key p (dsum_enum t)) h input pos /\ (
let k' = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
Known? k' /\ (
let Known k = k' in
valid (dsnd (f k)) h input (get_valid_pos (parse_maybe_enum_key p (dsum_enum t)) h input pos)
))))
(ensures (
let Known k = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
let pos_payload = get_valid_pos (parse_maybe_enum_key p (dsum_enum t)) h input pos in
valid_content_pos
(parse_dsum t p f g) h input pos
(synth_dsum_case t (Known k) (contents (dsnd (f k)) h input pos_payload))
(get_valid_pos (dsnd (f k)) h input pos_payload)
))
= valid_facts (parse_maybe_enum_key p (dsum_enum t)) h input pos;
let Known k = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
let pos_payload = get_valid_pos (parse_maybe_enum_key p (dsum_enum t)) h input pos in
valid_facts (dsnd (f k)) h input pos_payload;
valid_facts (parse_dsum t p f g) h input pos;
parse_dsum_eq t p f g (bytes_of_slice_from h input pos)
let valid_dsum_intro_unknown
(h: HS.mem)
(t: dsum)
(#kt: parser_kind)
(p: parser kt (dsum_repr_type t))
(f: ((x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x))))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: Lemma
(requires (
valid (parse_maybe_enum_key p (dsum_enum t)) h input pos /\ (
let k' = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
Unknown? k' /\
valid g h input (get_valid_pos (parse_maybe_enum_key p (dsum_enum t)) h input pos)
)))
(ensures (
let Unknown r = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
let pos_payload = get_valid_pos (parse_maybe_enum_key p (dsum_enum t)) h input pos in
valid_content_pos
(parse_dsum t p f g) h input pos
(synth_dsum_case t (Unknown r) (contents g h input pos_payload))
(get_valid_pos g h input pos_payload)
))
= valid_facts (parse_maybe_enum_key p (dsum_enum t)) h input pos;
let Unknown r = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
let pos_payload = get_valid_pos (parse_maybe_enum_key p (dsum_enum t)) h input pos in
valid_facts g h input pos_payload;
valid_facts (parse_dsum t p f g) h input pos;
parse_dsum_eq t p f g (bytes_of_slice_from h input pos)
#reset-options
inline_for_extraction
let finalize_dsum_case_known
(t: dsum)
(#kt: parser_kind)
(#p: parser kt (dsum_repr_type t))
(s: serializer p)
(w: leaf_writer_strong s)
(f: ((x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x))))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
(destr: enum_repr_of_key'_t (dsum_enum t))
(k: dsum_known_key t)
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: HST.Stack unit
(requires (fun h ->
let len_tag = serialized_length (serialize_enum_key _ s (dsum_enum t)) k in
U32.v pos + len_tag < 4294967296 /\ (
let pos_payload = pos `U32.add` U32.uint_to_t len_tag in
valid (dsnd (f k)) h input pos_payload /\
writable input.base (U32.v pos) (U32.v pos_payload) h
)))
(ensures (fun h _ h' ->
let len_tag = serialized_length (serialize_enum_key _ s (dsum_enum t)) k in
let pos_payload = pos `U32.add` U32.uint_to_t len_tag in
B.modifies (loc_slice_from_to input pos pos_payload) h h' /\
valid_content_pos (parse_dsum t p f g) h' input pos (synth_dsum_case t (Known k) (contents (dsnd (f k)) h input pos_payload)) (get_valid_pos (dsnd (f k)) h input pos_payload)
))
= let pos1 = write_enum_key w (dsum_enum t) destr k input pos in
let h = HST.get () in
[@inline_let]
let _ =
valid_facts (parse_enum_key p (dsum_enum t)) h input pos;
valid_facts (parse_maybe_enum_key p (dsum_enum t)) h input pos;
let sq = bytes_of_slice_from h input pos in
parse_enum_key_eq p (dsum_enum t) sq;
parse_maybe_enum_key_eq p (dsum_enum t) sq;
valid_dsum_intro_known h t p f g input pos
in
()
inline_for_extraction
let finalize_dsum_case_unknown
(t: dsum)
(#kt: parser_kind)
(#p: parser kt (dsum_repr_type t))
(s: serializer p)
(w: leaf_writer_strong s)
(f: ((x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x))))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
(r: unknown_enum_repr (dsum_enum t))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: HST.Stack unit
(requires (fun h ->
let len_tag = serialized_length s r in
U32.v pos + len_tag < 4294967296 /\ (
let pos_payload = pos `U32.add` U32.uint_to_t len_tag in
valid g h input pos_payload /\
writable input.base (U32.v pos) (U32.v pos_payload) h
)))
(ensures (fun h _ h' ->
let len_tag = serialized_length s r in
let pos_payload = pos `U32.add` U32.uint_to_t len_tag in
B.modifies (loc_slice_from_to input pos pos_payload) h h' /\
valid_content_pos (parse_dsum t p f g) h' input pos (synth_dsum_case t (Unknown r) (contents g h input pos_payload)) (get_valid_pos g h input pos_payload)
))
= let pos1 = w r input pos in
let h = HST.get () in
[@inline_let]
let _ =
valid_facts (parse_maybe_enum_key p (dsum_enum t)) h input pos;
valid_facts p h input pos;
let sq = bytes_of_slice_from h input pos in
parse_maybe_enum_key_eq p (dsum_enum t) sq;
valid_dsum_intro_unknown h t p f g input pos
in
()
let valid_dsum_elim_tag
(h: HS.mem)
(t: dsum)
(#kt: parser_kind)
(p: parser kt (dsum_repr_type t))
(f: ((x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x))))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: Lemma
(requires (
valid (parse_dsum t p f g) h input pos
))
(ensures (
valid (parse_maybe_enum_key p (dsum_enum t)) h input pos /\
contents (parse_maybe_enum_key p (dsum_enum t)) h input pos == dsum_tag_of_data t (contents (parse_dsum t p f g) h input pos)
))
= let _ = parse_dsum_eq_ t p f g (bytes_of_slice_from h input pos) in
let _ = valid_facts (parse_dsum t p f g) h input pos in
let _ = valid_facts (parse_maybe_enum_key p (dsum_enum t)) h input pos in
()
inline_for_extraction
let read_dsum_tag
(t: dsum)
(#kt: parser_kind)
(#p: parser kt (dsum_repr_type t))
(p32: leaf_reader p)
(destr: maybe_enum_destr_t (maybe_enum_key (dsum_enum t)) (dsum_enum t))
(f: ((x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x))))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: HST.Stack (dsum_key t)
(requires (fun h ->
valid (parse_dsum t p f g) h input pos
))
(ensures (fun h res h' ->
B.modifies B.loc_none h h' /\
res == dsum_tag_of_data t (contents (parse_dsum t p f g) h input pos)
))
= let h = HST.get () in
[@inline_let] let _ = valid_dsum_elim_tag h t p f g input pos in
read_maybe_enum_key p32 (dsum_enum t) destr input pos
#push-options "--z3rlimit 32"
let valid_dsum_elim_known
(h: HS.mem)
(t: dsum)
(#kt: parser_kind)
(p: parser kt (dsum_repr_type t))
(f: ((x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x))))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: Lemma
(requires (
valid (parse_dsum t p f g) h input pos /\
Known? (dsum_tag_of_data t (contents (parse_dsum t p f g) h input pos))
))
(ensures (
valid (parse_maybe_enum_key p (dsum_enum t)) h input pos /\ (
let k' = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
let pos_payload = get_valid_pos (parse_maybe_enum_key p (dsum_enum t)) h input pos in
Known? k' /\ (
let Known k = k' in
valid (dsnd (f k)) h input pos_payload /\
valid_content_pos
(parse_dsum t p f g) h input pos
(synth_dsum_case t (Known k) (contents (dsnd (f k)) h input pos_payload))
(get_valid_pos (dsnd (f k)) h input pos_payload)
))))
=
valid_facts (parse_dsum t p f g) h input pos;
parse_dsum_eq t p f g (bytes_of_slice_from h input pos);
valid_facts (parse_maybe_enum_key p (dsum_enum t)) h input pos;
let Known k = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
let pos_payload = get_valid_pos (parse_maybe_enum_key p (dsum_enum t)) h input pos in
valid_facts (dsnd (f k)) h input pos_payload
#pop-options
let valid_dsum_elim_unknown
(h: HS.mem)
(t: dsum)
(#kt: parser_kind)
(p: parser kt (dsum_repr_type t))
(f: ((x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x))))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: Lemma
(requires (
valid (parse_dsum t p f g) h input pos /\
Unknown? (dsum_tag_of_data t (contents (parse_dsum t p f g) h input pos))
))
(ensures (
valid (parse_maybe_enum_key p (dsum_enum t)) h input pos /\ (
let k' = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
let pos_payload = get_valid_pos (parse_maybe_enum_key p (dsum_enum t)) h input pos in
Unknown? k' /\ (
let Unknown r = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
valid g h input pos_payload /\
valid_content_pos
(parse_dsum t p f g) h input pos
(synth_dsum_case t (Unknown r) (contents g h input pos_payload))
(get_valid_pos g h input pos_payload)
))))
=
valid_facts (parse_dsum t p f g) h input pos;
parse_dsum_eq t p f g (bytes_of_slice_from h input pos);
valid_facts (parse_maybe_enum_key p (dsum_enum t)) h input pos;
let Unknown r = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
let pos_payload = get_valid_pos (parse_maybe_enum_key p (dsum_enum t)) h input pos in
valid_facts g h input pos_payload
inline_for_extraction
let jump_dsum_cases_t
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(#k: parser_kind)
(g: parser k (dsum_type_of_unknown_tag s))
(x: dsum_key s)
: Tot Type
= jumper (parse_dsum_cases' s f g x)
let jump_dsum_cases_eq
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(#k: parser_kind)
(g: parser k (dsum_type_of_unknown_tag s))
(x: dsum_key s)
(v1 v2 : jump_dsum_cases_t s f g x)
: GTot Type0
= True
inline_for_extraction
let jump_dsum_cases_if'
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(#k: parser_kind)
(g: parser k (dsum_type_of_unknown_tag s))
(x: dsum_key s)
(cond: bool)
(ift: (cond_true cond -> Tot (jump_dsum_cases_t s f g x)))
(iff: (cond_false cond -> Tot (jump_dsum_cases_t s f g x)))
: Tot (jump_dsum_cases_t s f g x)
= fun #rrel #rel input len ->
if cond
then (ift () <: jump_dsum_cases_t s f g x) input len
else (iff () <: jump_dsum_cases_t s f g x) input len
inline_for_extraction
let jump_dsum_cases_if
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(#k: parser_kind)
(g: parser k (dsum_type_of_unknown_tag s))
(x: dsum_key s)
: Tot (if_combinator _ (jump_dsum_cases_eq s f g x))
= jump_dsum_cases_if' s f g x
inline_for_extraction
let jump_dsum_cases'
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(f' : (x: dsum_known_key s) -> Tot (jumper (dsnd (f x))))
(#k: parser_kind)
(#g: parser k (dsum_type_of_unknown_tag s))
(g' : jumper g)
(x: dsum_key s)
: Tot (jump_dsum_cases_t s f g x)
= synth_dsum_case_injective s x;
match x with
| Known x' -> jump_synth (f' x') (synth_dsum_case s (Known x')) () <: jumper (parse_dsum_cases' s f g x)
| Unknown x' -> jump_synth g' (synth_dsum_case s (Unknown x')) () <: jumper (parse_dsum_cases' s f g x)
inline_for_extraction
let jump_dsum_cases'_destr
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(f' : (x: dsum_known_key s) -> Tot (jumper (dsnd (f x))))
(#k: parser_kind)
(#g: parser k (dsum_type_of_unknown_tag s))
(g' : jumper g)
(destr: dep_enum_destr _ (fun k -> jump_dsum_cases_t s f g (Known k)))
(x: dsum_key s)
: Tot (jump_dsum_cases_t s f g x)
= fun #rrel #rel input pos ->
match x with
| Known k ->
destr
_
(fun k -> jump_dsum_cases_if s f g (Known k))
(fun _ _ -> ())
(fun _ _ _ _ -> ())
(fun k -> jump_dsum_cases' s f f' g' (Known k))
k
input
pos
| Unknown r -> jump_dsum_cases' s f f' g' (Unknown r) input pos
inline_for_extraction
let jump_dsum_cases
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(f' : (x: dsum_known_key s) -> Tot (jumper (dsnd (f x))))
(#k: parser_kind)
(#g: parser k (dsum_type_of_unknown_tag s))
(g' : jumper g)
(destr: dep_enum_destr _ (fun k -> jump_dsum_cases_t s f g (Known k)))
(x: dsum_key s)
: Tot (jumper (parse_dsum_cases s f g x))
= fun #rrel #rel input pos ->
let h = HST.get () in
[@inline_let]
let _ =
valid_facts (parse_dsum_cases' s f g x) h input pos;
valid_facts (parse_dsum_cases s f g x) h input pos;
parse_dsum_cases_eq' s f g x (bytes_of_slice_from h input pos)
in
jump_dsum_cases'_destr s f f' g' destr x input pos
#push-options "--z3rlimit 16"
inline_for_extraction
let jump_dsum
(#kt: parser_kind)
(t: dsum)
(#p: parser kt (dsum_repr_type t))
(v: jumper p)
(p32: leaf_reader p)
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(f32: (x: dsum_known_key t) -> Tot (jumper (dsnd (f x))))
(#k': parser_kind)
(#g: parser k' (dsum_type_of_unknown_tag t))
(g32: jumper g)
(destr: dep_maybe_enum_destr_t (dsum_enum t) (jump_dsum_cases_t t f g))
: Tot (jumper (parse_dsum t p f g))
= fun #rrel #rel input pos ->
let h = HST.get () in
[@inline_let]
let _ = parse_dsum_eq' t p f g (bytes_of_slice_from h input pos) in
[@inline_let]
let _ = valid_facts (parse_dsum t p f g) h input pos in
[@inline_let]
let _ = valid_facts p h input pos in
let pos_after_tag = v input pos in
let tg = p32 input pos in
[@inline_let]
let _ = valid_facts (parse_dsum_cases' t f g (maybe_enum_key_of_repr (dsum_enum t) tg)) h input pos_after_tag in
destr (jump_dsum_cases_eq t f g) (jump_dsum_cases_if t f g) (fun _ _ -> ()) (fun _ _ _ _ -> ()) (jump_dsum_cases' t f f32 g32) tg input pos_after_tag
#pop-options
inline_for_extraction
let read_dsum_cases'
(t: dsum)
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(f32: (x: dsum_known_key t) -> Tot (leaf_reader (dsnd (f x))))
(#k': parser_kind)
(g: parser k' (dsum_type_of_unknown_tag t))
(g32: leaf_reader g)
(x: dsum_key t)
: Tot (leaf_reader (parse_dsum_cases' t f g x))
= fun #rrel #rel input pos ->
[@inline_let]
let _ = synth_dsum_case_injective t x in
match x with
| Known x' ->
read_synth'
(dsnd (f x'))
(synth_dsum_case t (Known x'))
(f32 x')
()
input
pos
| Unknown x' ->
read_synth'
g
(synth_dsum_case t (Unknown x'))
g32
()
input
pos
inline_for_extraction
let read_dsum_cases_t
(t: dsum)
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(#k': parser_kind)
(g: parser k' (dsum_type_of_unknown_tag t))
(k: dsum_known_key t)
: Tot Type
= leaf_reader (parse_dsum_cases' t f g (Known k))
let read_dsum_cases_t_eq
(t: dsum)
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(#k': parser_kind)
(g: parser k' (dsum_type_of_unknown_tag t))
(k: dsum_known_key t)
(x y : read_dsum_cases_t t f g k)
: GTot Type0
= True
inline_for_extraction
let read_dsum_cases_t_if
(t: dsum)
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(#k': parser_kind)
(g: parser k' (dsum_type_of_unknown_tag t))
(k: dsum_known_key t)
: Tot (if_combinator _ (read_dsum_cases_t_eq t f g k))
= fun cond (sv_true: cond_true cond -> Tot (read_dsum_cases_t t f g k)) (sv_false: cond_false cond -> Tot (read_dsum_cases_t t f g k)) #_ #_ input pos ->
if cond
then sv_true () input pos
else sv_false () input pos
inline_for_extraction
let read_dsum_cases
(t: dsum)
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(f32: (x: dsum_known_key t) -> Tot (leaf_reader (dsnd (f x))))
(#k': parser_kind)
(g: parser k' (dsum_type_of_unknown_tag t))
(g32: leaf_reader g)
(destr: dep_enum_destr _ (read_dsum_cases_t t f g))
(x: dsum_key t)
: Tot (leaf_reader (parse_dsum_cases' t f g x))
= fun #_ #_ input pos ->
match x with
| Known k ->
destr
_
(read_dsum_cases_t_if t f g)
(fun _ _ -> ())
(fun _ _ _ _ -> ())
(fun k -> read_dsum_cases' t f f32 g g32 (Known k))
k
input
pos
| Unknown r ->
read_dsum_cases' t f f32 g g32 (Unknown r) input pos
#push-options "--z3rlimit 16"
inline_for_extraction
let read_dsum
(#kt: parser_kind)
(t: dsum)
(#p: parser kt (dsum_repr_type t))
(p32: leaf_reader (parse_maybe_enum_key p (dsum_enum t)))
(j: jumper p)
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(f32: (x: dsum_known_key t) -> Tot (leaf_reader (dsnd (f x))))
(#k': parser_kind)
(#g: parser k' (dsum_type_of_unknown_tag t))
(g32: leaf_reader g)
(destr: dep_enum_destr _ (read_dsum_cases_t t f g))
: Tot (leaf_reader (parse_dsum t p f g))
= fun #_ #_ input pos ->
let h = HST.get () in
valid_facts (parse_dsum t p f g) h input pos;
parse_dsum_eq_ t p f g (bytes_of_slice_from h input pos);
valid_facts (parse_maybe_enum_key p (dsum_enum t)) h input pos;
let k = p32 input pos in
let pos' = jump_maybe_enum_key j (dsum_enum t) input pos in
valid_facts (parse_dsum_cases' t f g k) h input pos' ;
read_dsum_cases t f f32 g g32 destr k input pos'
#pop-options | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"LowStar.Buffer.fst.checked",
"LowParse.Spec.Sum.fst.checked",
"LowParse.Low.Enum.fst.checked",
"FStar.UInt64.fsti.checked",
"FStar.UInt32.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Int.Cast.fst.checked",
"FStar.HyperStack.ST.fsti.checked",
"FStar.HyperStack.fst.checked",
"FStar.Classical.fsti.checked"
],
"interface_file": false,
"source_file": "LowParse.Low.Sum.fst"
} | [
{
"abbrev": true,
"full_module": "FStar.HyperStack",
"short_module": "HS"
},
{
"abbrev": true,
"full_module": "FStar.UInt64",
"short_module": "U64"
},
{
"abbrev": true,
"full_module": "FStar.Int.Cast",
"short_module": "Cast"
},
{
"abbrev": true,
"full_module": "LowStar.Buffer",
"short_module": "B"
},
{
"abbrev": true,
"full_module": "FStar.HyperStack.ST",
"short_module": "HST"
},
{
"abbrev": true,
"full_module": "FStar.UInt32",
"short_module": "U32"
},
{
"abbrev": false,
"full_module": "LowParse.Spec.Sum",
"short_module": null
},
{
"abbrev": false,
"full_module": "LowParse.Low.Enum",
"short_module": null
},
{
"abbrev": false,
"full_module": "LowParse.Low",
"short_module": null
},
{
"abbrev": false,
"full_module": "LowParse.Low",
"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",
"short_module": null
}
] | {
"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_elim_box": false,
"smtencoding_l_arith_repr": "boxwrap",
"smtencoding_nl_arith_repr": "boxwrap",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": true,
"z3cliopt": [],
"z3refresh": false,
"z3rlimit": 5,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | false |
t: LowParse.Spec.Sum.dsum ->
f:
(x: LowParse.Spec.Sum.dsum_known_key t
-> Prims.dtuple2 LowParse.Spec.Base.parser_kind
(fun k -> LowParse.Spec.Base.parser k (LowParse.Spec.Sum.dsum_type_of_known_tag t x))) ->
sf:
(x: LowParse.Spec.Sum.dsum_known_key t
-> LowParse.Spec.Base.serializer (FStar.Pervasives.dsnd (f x))) ->
sf32: (x: LowParse.Spec.Sum.dsum_known_key t -> LowParse.Low.Base.serializer32 (sf x)) ->
sg32: LowParse.Low.Base.serializer32 sg ->
tg: LowParse.Spec.Sum.dsum_key t
-> LowParse.Low.Base.serializer32 (LowParse.Spec.Sum.serialize_dsum_type_of_tag t f sf g sg tg) | Prims.Tot | [
"total"
] | [] | [
"LowParse.Spec.Sum.dsum",
"LowParse.Spec.Sum.dsum_known_key",
"Prims.dtuple2",
"LowParse.Spec.Base.parser_kind",
"LowParse.Spec.Base.parser",
"LowParse.Spec.Sum.dsum_type_of_known_tag",
"LowParse.Spec.Base.serializer",
"Prims.__proj__Mkdtuple2__item___1",
"FStar.Pervasives.dsnd",
"LowParse.Low.Base.serializer32",
"LowParse.Spec.Sum.dsum_type_of_unknown_tag",
"LowParse.Spec.Sum.dsum_key",
"LowParse.Spec.Enum.enum_key",
"LowParse.Spec.Sum.dsum_key_type",
"LowParse.Spec.Sum.dsum_repr_type",
"LowParse.Spec.Sum.dsum_enum",
"LowParse.Low.Base.serialize32_ext",
"LowParse.Spec.Sum.weaken_parse_dsum_cases_kind",
"LowParse.Spec.Sum.dsum_type_of_tag",
"LowParse.Spec.Sum.parse_dsum_type_of_tag",
"LowParse.Spec.Enum.unknown_enum_repr",
"LowParse.Spec.Sum.serialize_dsum_type_of_tag"
] | [] | false | false | false | false | false | let serialize32_dsum_type_of_tag
(t: dsum)
(f: (x: dsum_known_key t -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x))))
(sf: (x: dsum_known_key t -> Tot (serializer (dsnd (f x)))))
(sf32: (x: dsum_known_key t -> Tot (serializer32 (sf x))))
(#k': parser_kind)
(#g: parser k' (dsum_type_of_unknown_tag t))
(#sg: serializer g)
(sg32: serializer32 sg)
(tg: dsum_key t)
: Tot (serializer32 (serialize_dsum_type_of_tag t f sf g sg tg)) =
| match tg with
| Known x' -> serialize32_ext (dsnd (f x')) (sf x') (sf32 x') (parse_dsum_type_of_tag t f g tg) ()
| Unknown x' -> serialize32_ext g sg sg32 (parse_dsum_type_of_tag t f g tg) () | false |
LowParse.Low.Sum.fst | LowParse.Low.Sum.serialize32_dsum_cases | val serialize32_dsum_cases
(t: dsum)
(f: (x: dsum_known_key t -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x))))
(sf: (x: dsum_known_key t -> Tot (serializer (dsnd (f x)))))
(sf32: (x: dsum_known_key t -> Tot (serializer32 (sf x))))
(#k': parser_kind)
(#g: parser k' (dsum_type_of_unknown_tag t))
(#sg: serializer g)
(sg32: serializer32 sg)
(destr: dep_enum_destr _ (serialize32_dsum_cases_t t f sf g sg))
(tg: dsum_key t)
: Tot (serializer32 (serialize_dsum_cases t f sf g sg tg)) | val serialize32_dsum_cases
(t: dsum)
(f: (x: dsum_known_key t -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x))))
(sf: (x: dsum_known_key t -> Tot (serializer (dsnd (f x)))))
(sf32: (x: dsum_known_key t -> Tot (serializer32 (sf x))))
(#k': parser_kind)
(#g: parser k' (dsum_type_of_unknown_tag t))
(#sg: serializer g)
(sg32: serializer32 sg)
(destr: dep_enum_destr _ (serialize32_dsum_cases_t t f sf g sg))
(tg: dsum_key t)
: Tot (serializer32 (serialize_dsum_cases t f sf g sg tg)) | let serialize32_dsum_cases
(t: dsum)
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(sf: (x: dsum_known_key t) -> Tot (serializer (dsnd (f x))))
(sf32: (x: dsum_known_key t) -> Tot (serializer32 (sf x)))
(#k': parser_kind)
(#g: parser k' (dsum_type_of_unknown_tag t))
(#sg: serializer g)
(sg32: serializer32 sg)
(destr: dep_enum_destr _ (serialize32_dsum_cases_t t f sf g sg))
(tg: dsum_key t)
: Tot (serializer32 (serialize_dsum_cases t f sf g sg tg))
= fun x #rrel #rel output pos ->
match tg with
| Known k ->
destr
_
(serialize32_dsum_cases_t_if t f sf g sg)
(fun _ _ -> ())
(fun _ _ _ _ -> ())
(fun k -> serialize32_dsum_cases_aux t f sf sf32 sg32 (Known k))
k
x
output
pos
| Unknown r ->
serialize32_dsum_cases_aux t f sf sf32 sg32 (Unknown r) x output pos | {
"file_name": "src/lowparse/LowParse.Low.Sum.fst",
"git_rev": "00217c4a89f5ba56002ba9aa5b4a9d5903bfe9fa",
"git_url": "https://github.com/project-everest/everparse.git",
"project_name": "everparse"
} | {
"end_col": 72,
"end_line": 1735,
"start_col": 0,
"start_line": 1709
} | module LowParse.Low.Sum
include LowParse.Low.Enum
include LowParse.Spec.Sum
module U32 = FStar.UInt32
module HST = FStar.HyperStack.ST
module B = LowStar.Buffer
module Cast = FStar.Int.Cast
module U64 = FStar.UInt64
inline_for_extraction
let validate_sum_cases_aux
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(vc: ((x: sum_key t) -> Tot (validator (dsnd (pc x)))))
(k: sum_key t)
: Tot (validator (parse_sum_cases t pc k))
= [@inline_let]
let _ = synth_sum_case_injective t k in
validate_synth
(validate_weaken
(weaken_parse_cases_kind t pc)
(vc k)
()
)
(synth_sum_case t k)
()
inline_for_extraction
let validate_sum_cases_t
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot Type
= validator (parse_sum_cases t pc k)
let validate_sum_cases_t_eq
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
(x y : validate_sum_cases_t t pc k)
: GTot Type0
= True
inline_for_extraction
let validate_sum_cases_t_if
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (if_combinator _ (validate_sum_cases_t_eq t pc k))
= fun cond (sv_true: cond_true cond -> Tot (validate_sum_cases_t t pc k)) (sv_false: cond_false cond -> Tot (validate_sum_cases_t t pc k)) #rrel #rel input pos ->
if cond
then sv_true () input pos
else sv_false () input pos
inline_for_extraction
let validate_sum_cases
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(vc: ((x: sum_key t) -> Tot (validator (dsnd (pc x)))))
(destr: dep_enum_destr (sum_enum t) (validate_sum_cases_t t pc))
(k: sum_key t)
: Tot (validator (parse_sum_cases t pc k))
= destr
_
(validate_sum_cases_t_if t pc)
(fun _ _ -> ())
(fun _ _ _ _ -> ())
(validate_sum_cases_aux t pc vc)
k
inline_for_extraction
let validate_sum_aux_payload_t
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
: Tot Type
= (#rrel: _) -> (#rel: _) ->
(input: slice rrel rel) ->
(pos: U64.t) ->
HST.Stack U64.t
(requires (fun h -> live_slice h input /\ U64.v pos <= U32.v input.len))
(ensures (fun h res h' ->
B.modifies B.loc_none h h' /\ (
match k with
| Unknown _ -> is_error res
| Known k' ->
if is_success res
then
valid_pos (dsnd (pc k')) h input (uint64_to_uint32 pos) (uint64_to_uint32 res)
else
(~ (valid (dsnd (pc k')) h input (uint64_to_uint32 pos)))
)))
let validate_sum_aux_payload_eq
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
: Tot (validate_sum_aux_payload_t t pc k -> validate_sum_aux_payload_t t pc k -> GTot Type0)
= fun _ _ -> True
inline_for_extraction
let validate_sum_aux_payload_if'
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
(cond: bool)
(ift: ((cond_true cond) -> Tot (validate_sum_aux_payload_t t pc k)))
(iff: ((cond_false cond) -> Tot (validate_sum_aux_payload_t t pc k)))
: Tot (validate_sum_aux_payload_t t pc k)
= fun #rrel #rel input pos ->
if cond
then begin
(ift () <: validate_sum_aux_payload_t t pc k) input pos
end else
(iff () <: validate_sum_aux_payload_t t pc k) input pos
inline_for_extraction
let validate_sum_aux_payload_if
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
: Tot (if_combinator _ (validate_sum_aux_payload_eq t pc k))
= validate_sum_aux_payload_if' t pc k
#push-options "--z3rlimit 64 --z3cliopt smt.arith.nl=false --using_facts_from '* -FStar.Int.Cast -LowParse.BitFields'"
// --query_stats --smtencoding.elim_box true --smtencoding.l_arith_repr native --z3refresh"
inline_for_extraction
let validate_sum_aux
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(v: validator p)
(p32: leaf_reader p)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(v_payload: ((k: sum_repr_type t)) -> Tot (validate_sum_aux_payload_t t pc (maybe_enum_key_of_repr (sum_enum t) k)))
: Tot (validator (parse_sum t p pc))
= fun #rrel #rel input pos ->
let h = HST.get () in
[@inline_let]
let _ = parse_sum_eq'' t p pc (bytes_of_slice_from h input (uint64_to_uint32 pos)) in
[@inline_let]
let _ = valid_facts (parse_sum t p pc) h input (uint64_to_uint32 pos) in
[@inline_let]
let _ = valid_facts p h input (uint64_to_uint32 pos) in
let len_after_tag = v input pos in
if is_error len_after_tag
then len_after_tag
else begin
let h1 = HST.get () in
let k' = p32 input (uint64_to_uint32 pos) in
[@inline_let]
let _ =
match maybe_enum_key_of_repr (sum_enum t) k' with
| Known k -> valid_facts (dsnd (pc k)) h input (uint64_to_uint32 len_after_tag)
| _ -> ()
in
v_payload k' input len_after_tag
end
#pop-options
inline_for_extraction
let validate_sum_aux_payload'
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (validator (dsnd (pc x)))))
(k: maybe_enum_key (sum_enum t))
: Tot (validate_sum_aux_payload_t t pc k)
= fun #rrel #rel input pos ->
match k with
| Known k ->
[@inline_let]
let _ = synth_sum_case_injective t k in
pc32 k input pos
// validate_synth (pc32 k) (synth_sum_case t k) () input pos
| _ -> validator_error_generic
inline_for_extraction
let validate_sum_aux_payload
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (validator (dsnd (pc x)))))
(destr: dep_maybe_enum_destr_t (sum_enum t) (validate_sum_aux_payload_t t pc))
(k: sum_repr_type t)
: Tot (validate_sum_aux_payload_t t pc (maybe_enum_key_of_repr (sum_enum t) k))
= destr (validate_sum_aux_payload_eq t pc) (validate_sum_aux_payload_if t pc) (fun _ _ -> ()) (fun _ _ _ _ -> ()) (validate_sum_aux_payload' t pc pc32) k
inline_for_extraction
let validate_sum
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(v: validator p)
(p32: leaf_reader p)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (validator (dsnd (pc x)))))
(destr: dep_maybe_enum_destr_t (sum_enum t) (validate_sum_aux_payload_t t pc))
: Tot (validator (parse_sum t p pc))
= validate_sum_aux t v p32 pc (validate_sum_aux_payload t pc pc32 destr)
module HS = FStar.HyperStack
#push-options "--z3rlimit 256 --z3cliopt smt.arith.nl=false --initial_ifuel 8 --max_ifuel 8 --initial_fuel 2 --max_fuel 2"
#restart-solver
let valid_sum_intro
(h: HS.mem)
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: Lemma
(requires (
valid (parse_enum_key p (sum_enum t)) h input pos /\ (
let k = contents (parse_enum_key p (sum_enum t)) h input pos in
valid (dsnd (pc k)) h input (get_valid_pos (parse_enum_key p (sum_enum t)) h input pos)
)))
(ensures (
let k = contents (parse_enum_key p (sum_enum t)) h input pos in
let pos_payload = get_valid_pos (parse_enum_key p (sum_enum t)) h input pos in
valid_content_pos
(parse_sum t p pc) h input pos
(synth_sum_case t k (contents (dsnd (pc k)) h input pos_payload))
(get_valid_pos (dsnd (pc k)) h input pos_payload)
))
= valid_facts (parse_enum_key p (sum_enum t)) h input pos;
let k = contents (parse_enum_key p (sum_enum t)) h input pos in
let pos_payload = get_valid_pos (parse_enum_key p (sum_enum t)) h input pos in
valid_facts (dsnd (pc k)) h input pos_payload;
valid_facts (parse_sum t p pc) h input pos;
parse_sum_eq t p pc (bytes_of_slice_from h input pos)
#pop-options
inline_for_extraction
let finalize_sum_case
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(s: serializer p)
(w: leaf_writer_strong s)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(destr: enum_repr_of_key'_t (sum_enum t))
(k: sum_key t)
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: HST.Stack unit
(requires (fun h ->
let len_tag = serialized_length (serialize_enum_key _ s (sum_enum t)) k in
U32.v pos + len_tag < 4294967296 /\ (
let pos_payload = pos `U32.add` U32.uint_to_t len_tag in
valid (dsnd (pc k)) h input pos_payload /\
writable input.base (U32.v pos) (U32.v pos_payload) h
)))
(ensures (fun h _ h' ->
let len_tag = serialized_length (serialize_enum_key _ s (sum_enum t)) k in
let pos_payload = pos `U32.add` U32.uint_to_t len_tag in
B.modifies (loc_slice_from_to input pos pos_payload) h h' /\
valid_content_pos (parse_sum t p pc) h' input pos (synth_sum_case t k (contents (dsnd (pc k)) h input pos_payload)) (get_valid_pos (dsnd (pc k)) h input pos_payload)
))
= let pos1 = write_enum_key w (sum_enum t) destr k input pos in
let h = HST.get () in
[@inline_let]
let _ = valid_sum_intro h t p pc input pos in
()
inline_for_extraction
let jump_sum_cases_aux
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(vc: ((x: sum_key t) -> Tot (jumper (dsnd (pc x)))))
(k: sum_key t)
: Tot (jumper (parse_sum_cases t pc k))
= [@inline_let]
let _ = synth_sum_case_injective t k in
jump_synth
(jump_weaken
(weaken_parse_cases_kind t pc)
(vc k)
()
)
(synth_sum_case t k)
()
inline_for_extraction
let jump_sum_cases_t
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot Type
= jumper (parse_sum_cases t pc k)
let jump_sum_cases_t_eq
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
(x y : jump_sum_cases_t t pc k)
: GTot Type0
= True
inline_for_extraction
let jump_sum_cases_t_if
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (if_combinator _ (jump_sum_cases_t_eq t pc k))
= fun cond (sv_true: cond_true cond -> Tot (jump_sum_cases_t t pc k)) (sv_false: cond_false cond -> Tot (jump_sum_cases_t t pc k)) #rrel #rel input pos ->
if cond
then sv_true () input pos
else sv_false () input pos
inline_for_extraction
let jump_sum_cases
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(vc: ((x: sum_key t) -> Tot (jumper (dsnd (pc x)))))
(destr: dep_enum_destr (sum_enum t) (jump_sum_cases_t t pc))
(k: sum_key t)
: Tot (jumper (parse_sum_cases t pc k))
= destr
_
(jump_sum_cases_t_if t pc)
(fun _ _ -> ())
(fun _ _ _ _ -> ())
(jump_sum_cases_aux t pc vc)
k
inline_for_extraction
let jump_sum_aux_payload_t
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
: Tot Type
= (#rrel: _) -> (#rel: _) ->
(input: slice rrel rel) ->
(pos: U32.t) ->
HST.Stack U32.t
(requires (fun h -> live_slice h input /\ U32.v pos <= U32.v input.len /\ (
match k with
| Unknown _ -> False
| Known k' -> valid (dsnd (pc k')) h input pos
)))
(ensures (fun h res h' ->
B.modifies B.loc_none h h' /\ (
match k with
| Unknown _ -> False
| Known k' ->
valid_pos (dsnd (pc k')) h input pos res
)))
let jump_sum_aux_payload_eq
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
: Tot (jump_sum_aux_payload_t t pc k -> jump_sum_aux_payload_t t pc k -> GTot Type0)
= fun _ _ -> True
inline_for_extraction
let jump_sum_aux_payload_if'
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
(cond: bool)
(ift: ((cond_true cond) -> Tot (jump_sum_aux_payload_t t pc k)))
(iff: ((cond_false cond) -> Tot (jump_sum_aux_payload_t t pc k)))
: Tot (jump_sum_aux_payload_t t pc k)
= fun #rrel #rel input pos ->
if cond
then begin
(ift () <: jump_sum_aux_payload_t t pc k) input pos
end else
(iff () <: jump_sum_aux_payload_t t pc k) input pos
inline_for_extraction
let jump_sum_aux_payload_if
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
: Tot (if_combinator _ (jump_sum_aux_payload_eq t pc k))
= jump_sum_aux_payload_if' t pc k
let parse_sum_eq3
(#kt: parser_kind)
(t: sum)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(input: bytes)
(k' : sum_repr_type t)
(consumed_k: consumed_length input)
: Lemma
(requires (Some? (parse (parse_sum t p pc) input) /\ parse p input == Some (k', consumed_k)))
(ensures (
let input_k = Seq.slice input consumed_k (Seq.length input) in
let k = maybe_enum_key_of_repr (sum_enum t) k' in
begin match k with
| Known k ->
Some? (parse (dsnd (pc k)) input_k)
| _ -> False
end
))
= parse_sum_eq'' t p pc input
let parse_sum_eq4
(#kt: parser_kind)
(t: sum)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(input: bytes)
(k' : sum_repr_type t)
(consumed_k: consumed_length input)
(consumed_payload: nat)
: Lemma
(requires (Some? (parse (parse_sum t p pc) input) /\ parse p input == Some (k', consumed_k) /\ (
let input_k = Seq.slice input consumed_k (Seq.length input) in
let k = maybe_enum_key_of_repr (sum_enum t) k' in
begin match k with
| Known k ->
Some? (parse (dsnd (pc k)) input_k) /\ (
let Some (_, consumed_payload') = parse (dsnd (pc k)) input_k in
consumed_payload' == consumed_payload
)
| _ -> False
end
)))
(ensures (
let Some (_, consumed) = parse (parse_sum t p pc) input in
consumed == consumed_k + consumed_payload
))
= parse_sum_eq'' t p pc input
#push-options "--z3rlimit 16"
let valid_sum_elim
(h: HS.mem)
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(#rrel: _) (#rel: _)
(input: slice rrel rel)
(pos: U32.t)
: Lemma
(requires (
valid (parse_sum t p pc) h input pos
))
(ensures (
valid p h input pos /\ (
let pos_payload = get_valid_pos p h input pos in
let k' = maybe_enum_key_of_repr (sum_enum t) (contents p h input pos) in
match k' with
| Known k ->
k == sum_tag_of_data t (contents (parse_sum t p pc) h input pos) /\
valid (dsnd (pc k)) h input pos_payload /\
valid_pos
(parse_sum t p pc) h input pos
(get_valid_pos (dsnd (pc k)) h input pos_payload)
| _ -> False
)))
= let sinput = bytes_of_slice_from h input pos in
let _ = parse_sum_eq'' t p pc sinput in
[@inline_let]
let _ = valid_facts (parse_sum t p pc) h input pos in
let Some (k', consumed_k) = parse p sinput in
let pos_after_tag = U32.uint_to_t (U32.v pos + consumed_k) in
[@inline_let]
let _ = valid_facts p h input pos in
assert (valid_content_pos p h input pos k' pos_after_tag);
match maybe_enum_key_of_repr (sum_enum t) k' with
| Known k -> valid_facts (dsnd (pc k)) h input pos_after_tag
| _ -> ()
#pop-options
let valid_sum_elim_tag
(h: HS.mem)
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: Lemma
(requires (
valid (parse_sum t p pc) h input pos
))
(ensures (
valid (parse_enum_key p (sum_enum t)) h input pos /\
contents (parse_enum_key p (sum_enum t)) h input pos == sum_tag_of_data t (contents (parse_sum t p pc) h input pos)
))
= let _ = parse_sum_eq' t p pc (bytes_of_slice_from h input pos) in
let _ = valid_facts (parse_sum t p pc) h input pos in
let _ = valid_facts (parse_enum_key p (sum_enum t)) h input pos in
()
inline_for_extraction
let read_sum_tag
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(p32: leaf_reader p)
(destr: dep_maybe_enum_destr_t (sum_enum t) (read_enum_key_t (sum_enum t)))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: HST.Stack (sum_key t)
(requires (fun h ->
valid (parse_sum t p pc) h input pos
))
(ensures (fun h res h' ->
B.modifies B.loc_none h h' /\
res == sum_tag_of_data t (contents (parse_sum t p pc) h input pos)
))
= let h = HST.get () in
[@inline_let] let _ = valid_sum_elim_tag h t p pc input pos in
read_enum_key p32 (sum_enum t) destr input pos
inline_for_extraction
let jump_sum_aux
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(v: jumper p)
(p32: leaf_reader p)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(v_payload: ((k: sum_repr_type t)) -> Tot (jump_sum_aux_payload_t t pc (maybe_enum_key_of_repr (sum_enum t) k)))
: Tot (jumper (parse_sum t p pc))
= fun #rrel #rel input pos ->
let h = HST.get () in
[@inline_let]
let _ = valid_sum_elim h t p pc input pos in
let pos_after_tag = v input pos in
let k' = p32 input pos in
v_payload k' input pos_after_tag
inline_for_extraction
let jump_sum_aux_payload'
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (jumper (dsnd (pc x)))))
(k: maybe_enum_key (sum_enum t))
: Tot (jump_sum_aux_payload_t t pc k)
= fun #rrel #rel input pos ->
match k with
| Known k ->
[@inline_let]
let _ = synth_sum_case_injective t k in
pc32 k input pos
| _ -> 0ul // dummy, but we MUST NOT remove this branch, otherwise extraction fails
inline_for_extraction
let jump_sum_aux_payload
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (jumper (dsnd (pc x)))))
(destr: dep_maybe_enum_destr_t (sum_enum t) (jump_sum_aux_payload_t t pc))
(k: sum_repr_type t)
: Tot (jump_sum_aux_payload_t t pc (maybe_enum_key_of_repr (sum_enum t) k))
= destr (jump_sum_aux_payload_eq t pc) (jump_sum_aux_payload_if t pc) (fun _ _ -> ()) (fun _ _ _ _ -> ()) (jump_sum_aux_payload' t pc pc32) k
inline_for_extraction
let jump_sum
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(v: jumper p)
(p32: leaf_reader p)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (jumper (dsnd (pc x)))))
(destr: dep_maybe_enum_destr_t (sum_enum t) (jump_sum_aux_payload_t t pc))
: Tot (jumper (parse_sum t p pc))
= jump_sum_aux t v p32 pc (jump_sum_aux_payload t pc pc32 destr)
inline_for_extraction
let read_sum_cases'
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (leaf_reader (dsnd (pc x)))))
(k: sum_key t)
: Tot (leaf_reader (parse_sum_cases' t pc k))
= [@inline_let]
let _ = synth_sum_case_injective t k in
read_synth'
(dsnd (pc k))
(synth_sum_case t k)
(pc32 k)
()
inline_for_extraction
let read_sum_cases_t
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot Type
= leaf_reader (parse_sum_cases' t pc k)
let read_sum_cases_t_eq
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
(x y : read_sum_cases_t t pc k)
: GTot Type0
= True
inline_for_extraction
let read_sum_cases_t_if
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (if_combinator _ (read_sum_cases_t_eq t pc k))
= fun cond (sv_true: cond_true cond -> Tot (read_sum_cases_t t pc k)) (sv_false: cond_false cond -> Tot (read_sum_cases_t t pc k)) #_ #_ input pos ->
if cond
then (sv_true () input pos)
else (sv_false () input pos)
inline_for_extraction
let read_sum_cases
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (leaf_reader (dsnd (pc x)))))
(destr: dep_enum_destr (sum_enum t) (read_sum_cases_t t pc))
(k: sum_key t)
: Tot (leaf_reader (parse_sum_cases' t pc k))
= destr
_
(read_sum_cases_t_if t pc)
(fun _ _ -> ())
(fun _ _ _ _ -> ())
(read_sum_cases' t pc pc32)
k
#push-options "--z3rlimit 32"
inline_for_extraction
let read_sum
(#kt: parser_kind)
(t: sum)
(p: parser kt (sum_repr_type t))
(p32: leaf_reader (parse_enum_key p (sum_enum t)))
(j: jumper p)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (leaf_reader (dsnd (pc x)))))
(destr: dep_enum_destr (sum_enum t) (read_sum_cases_t t pc))
: Tot (leaf_reader (parse_sum t p pc))
=
fun #_ #_ input pos ->
let h = HST.get () in
valid_facts (parse_sum t p pc) h input pos;
parse_sum_eq' t p pc (bytes_of_slice_from h input pos);
valid_facts (parse_enum_key p (sum_enum t)) h input pos;
let k = p32 input pos in
let pos' = jump_enum_key j (sum_enum t) input pos in
valid_facts (parse_sum_cases' t pc k) h input pos' ;
read_sum_cases t pc pc32 destr k input pos'
#pop-options
inline_for_extraction
let serialize32_sum_cases_t
(t: sum)
(#pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(sc: ((x: sum_key t) -> Tot (serializer (dsnd (pc x)))))
(k: sum_key t)
: Tot Type
= serializer32 (serialize_sum_cases t pc sc k)
let serialize32_sum_cases_t_eq
(t: sum)
(#pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(sc: ((x: sum_key t) -> Tot (serializer (dsnd (pc x)))))
(k: sum_key t)
(x y: serialize32_sum_cases_t t sc k)
: GTot Type0
= True
inline_for_extraction
let serialize32_sum_cases_t_if
(t: sum)
(#pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(sc: ((x: sum_key t) -> Tot (serializer (dsnd (pc x)))))
(k: sum_key t)
: Tot (if_combinator _ (serialize32_sum_cases_t_eq t sc k))
= fun cond (sv_true: (cond_true cond -> Tot (serialize32_sum_cases_t t sc k))) (sv_false: (cond_false cond -> Tot (serialize32_sum_cases_t t sc k))) x #rrel #rel b pos ->
if cond
then (sv_true () x b pos)
else (sv_false () x b pos)
inline_for_extraction
let serialize32_sum_cases_aux
(t: sum)
(#pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(sc: ((x: sum_key t) -> Tot (serializer (dsnd (pc x)))))
(sc32: ((x: sum_key t) -> Tot (serializer32 (sc x))))
(k: sum_key t)
: Tot (serializer32 (serialize_sum_cases t pc sc k))
= fun x #rrel #rel b pos ->
[@inline_let] let _ =
Classical.forall_intro (parse_sum_cases_eq' t pc k);
synth_sum_case_injective t k;
synth_sum_case_inverse t k
in
serialize32_synth
(sc32 k)
(synth_sum_case t k)
(synth_sum_case_recip t k)
(fun x -> synth_sum_case_recip t k x)
()
x
b
pos
inline_for_extraction
let serialize32_sum_cases
(t: sum)
(#pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(sc: ((x: sum_key t) -> Tot (serializer (dsnd (pc x)))))
(sc32: ((x: sum_key t) -> Tot (serializer32 (sc x))))
(destr: dep_enum_destr (sum_enum t) (serialize32_sum_cases_t t sc))
(k: sum_key t)
: Tot (serializer32 (serialize_sum_cases t pc sc k))
= destr
_
(serialize32_sum_cases_t_if t sc)
(fun _ _ -> ())
(fun _ _ _ _ -> ())
(serialize32_sum_cases_aux t sc sc32)
k
inline_for_extraction
let serialize32_sum
(#kt: parser_kind)
(t: sum)
(#p: parser kt (sum_repr_type t))
(s: serializer p {kt.parser_kind_subkind == Some ParserStrong})
(s32: serializer32 (serialize_enum_key _ s (sum_enum t)))
(#pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(sc: ((x: sum_key t) -> Tot (serializer (dsnd (pc x)))))
(sc32: ((x: sum_key t) -> Tot (serializer32 (sc x))))
(destr: dep_enum_destr (sum_enum t) (serialize32_sum_cases_t t sc))
: Tot (serializer32 (serialize_sum t s sc))
= fun x #rrel #rel b pos ->
serialize_sum_eq t s sc x;
let tg = sum_tag_of_data t x in
serialize32_nondep_then_aux s32 (serialize32_sum_cases t sc sc32 destr tg) tg x b pos
let clens_sum_tag
(s: sum)
: Tot (clens (sum_type s) (sum_key s))
= {
clens_cond = (fun _ -> True);
clens_get = sum_tag_of_data s;
}
let gaccessor_sum_tag
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
: Tot (gaccessor (parse_sum t p pc) (parse_enum_key p (sum_enum t)) (clens_sum_tag t))
= gaccessor_tagged_union_tag
(parse_enum_key p (sum_enum t))
(sum_tag_of_data t)
(parse_sum_cases t pc)
inline_for_extraction
let accessor_sum_tag
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
: Tot (accessor (gaccessor_sum_tag t p pc))
= accessor_tagged_union_tag
(parse_enum_key p (sum_enum t))
(sum_tag_of_data t)
(parse_sum_cases t pc)
let clens_sum_payload
(s: sum)
(k: sum_key s)
: Tot (clens (sum_type s) (sum_type_of_tag s k))
= {
clens_cond = (fun (x: sum_type s) -> sum_tag_of_data s x == k);
clens_get = (fun (x: sum_type s) -> synth_sum_case_recip s k x <: Ghost (sum_type_of_tag s k) (requires (sum_tag_of_data s x == k)) (ensures (fun _ -> True)));
}
#push-options "--z3rlimit 32"
let gaccessor_clens_sum_payload'
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (gaccessor' (parse_sum t p pc) (dsnd (pc k)) (clens_sum_payload t k))
= fun (input: bytes) ->
parse_sum_eq'' t p pc input;
let res =
match parse p input with
| Some (_, consumed) ->
synth_sum_case_inverse t k;
synth_sum_case_injective t k;
synth_injective_synth_inverse_synth_inverse_recip (synth_sum_case t k) (synth_sum_case_recip t k) ();
(consumed)
| _ -> 0 // dummy
in
(res <: (res: _ { gaccessor_post' (parse_sum t p pc) (dsnd (pc k)) (clens_sum_payload t k) input res } ))
#push-options "--z3rlimit 64"
let gaccessor_clens_sum_payload_injective
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
(sl sl' : bytes)
: Lemma
(requires (
gaccessor_pre (parse_sum t p pc) (dsnd (pc k)) (clens_sum_payload t k) sl /\
gaccessor_pre (parse_sum t p pc) (dsnd (pc k)) (clens_sum_payload t k) sl' /\
injective_precond (parse_sum t p pc) sl sl'
))
(ensures (gaccessor_clens_sum_payload' t p pc k sl == gaccessor_clens_sum_payload' t p pc k sl'))
= parse_sum_eq'' t p pc sl;
parse_sum_eq'' t p pc sl' ;
parse_injective (parse_sum t p pc) sl sl' ;
parse_injective p sl sl'
#pop-options
let gaccessor_clens_sum_payload_no_lookahead
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
(sl sl' : bytes)
: Lemma
(requires (
(parse_sum_kind kt t pc).parser_kind_subkind == Some ParserStrong /\
gaccessor_pre (parse_sum t p pc) (dsnd (pc k)) (clens_sum_payload t k) sl /\
gaccessor_pre (parse_sum t p pc) (dsnd (pc k)) (clens_sum_payload t k) sl' /\
no_lookahead_on_precond (parse_sum t p pc) sl sl'
))
(ensures (gaccessor_clens_sum_payload' t p pc k sl == gaccessor_clens_sum_payload' t p pc k sl'))
= parse_sum_eq'' t p pc sl;
parse_sum_eq'' t p pc sl' ;
parse_strong_prefix (parse_sum t p pc) sl sl' ;
parse_injective p sl sl'
let gaccessor_clens_sum_payload
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (gaccessor (parse_sum t p pc) (dsnd (pc k)) (clens_sum_payload t k))
= Classical.forall_intro_2 (fun x -> Classical.move_requires (gaccessor_clens_sum_payload_injective t p pc k x));
Classical.forall_intro_2 (fun x -> Classical.move_requires (gaccessor_clens_sum_payload_no_lookahead t p pc k x));
gaccessor_prop_equiv (parse_sum t p pc) (dsnd (pc k)) (clens_sum_payload t k) (gaccessor_clens_sum_payload' t p pc k);
gaccessor_clens_sum_payload' t p pc k
inline_for_extraction
let accessor_clens_sum_payload'
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(j: jumper p)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: HST.Stack U32.t
(requires (fun h ->
valid (parse_sum t p pc) h input pos /\
(clens_sum_payload t k).clens_cond (contents (parse_sum t p pc) h input pos)
))
(ensures (fun h pos' h' ->
B.modifies B.loc_none h h' /\
pos' == slice_access h (gaccessor_clens_sum_payload t p pc k) input pos
))
=
let h = HST.get () in
[@inline_let]
let _ =
let pos' = get_valid_pos (parse_sum t p pc) h input pos in
let large = bytes_of_slice_from h input pos in
slice_access_eq h (gaccessor_clens_sum_payload t p pc k) input pos;
valid_facts (parse_sum t p pc) h input pos;
parse_sum_eq'' t p pc large;
valid_facts p h input pos
in
j input pos
#pop-options
inline_for_extraction
let accessor_clens_sum_payload
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(j: jumper p)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (accessor (gaccessor_clens_sum_payload t p pc k))
= fun #rrel #rel -> accessor_clens_sum_payload' t j pc k #rrel #rel
let clens_sum_cases_payload
(s: sum)
(k: sum_key s)
: Tot (clens (sum_cases s k) (sum_type_of_tag s k))
= {
clens_cond = (fun (x: sum_cases s k) -> True);
clens_get = (fun (x: sum_cases s k) -> synth_sum_case_recip s k x <: Ghost (sum_type_of_tag s k) (requires (True)) (ensures (fun _ -> True)));
}
let gaccessor_clens_sum_cases_payload
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (gaccessor (parse_sum_cases' t pc k) (dsnd (pc k)) (clens_sum_cases_payload t k))
= synth_sum_case_injective t k;
synth_sum_case_inverse t k;
synth_injective_synth_inverse_synth_inverse_recip (synth_sum_case t k) (synth_sum_case_recip t k) ();
gaccessor_ext
(gaccessor_synth (dsnd (pc k)) (synth_sum_case t k) (synth_sum_case_recip t k) ())
(clens_sum_cases_payload t k)
()
inline_for_extraction
let accessor_clens_sum_cases_payload
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (accessor (gaccessor_clens_sum_cases_payload t pc k))
= [@inline_let]
let _ =
synth_sum_case_injective t k;
synth_sum_case_inverse t k;
synth_injective_synth_inverse_synth_inverse_recip (synth_sum_case t k) (synth_sum_case_recip t k) ()
in
accessor_ext
(accessor_synth (dsnd (pc k)) (synth_sum_case t k) (synth_sum_case_recip t k) ())
(clens_sum_cases_payload t k)
()
inline_for_extraction
let validate_dsum_cases_t
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(#k: parser_kind)
(g: parser k (dsum_type_of_unknown_tag s))
(x: dsum_key s)
: Tot Type
= validator (parse_dsum_cases' s f g x)
let validate_dsum_cases_eq
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(#k: parser_kind)
(g: parser k (dsum_type_of_unknown_tag s))
(x: dsum_key s)
(v1 v2 : validate_dsum_cases_t s f g x)
: GTot Type0
= True
inline_for_extraction
let validate_dsum_cases_if'
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(#k: parser_kind)
(g: parser k (dsum_type_of_unknown_tag s))
(x: dsum_key s)
(cond: bool)
(ift: (cond_true cond -> Tot (validate_dsum_cases_t s f g x)))
(iff: (cond_false cond -> Tot (validate_dsum_cases_t s f g x)))
: Tot (validate_dsum_cases_t s f g x)
= fun #rrel #rel input len ->
if cond
then (ift () <: validate_dsum_cases_t s f g x) input len
else (iff () <: validate_dsum_cases_t s f g x) input len
inline_for_extraction
let validate_dsum_cases_if
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(#k: parser_kind)
(g: parser k (dsum_type_of_unknown_tag s))
(x: dsum_key s)
: Tot (if_combinator _ (validate_dsum_cases_eq s f g x))
= validate_dsum_cases_if' s f g x
inline_for_extraction
let validate_dsum_cases'
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(f' : (x: dsum_known_key s) -> Tot (validator (dsnd (f x))))
(#k: parser_kind)
(#g: parser k (dsum_type_of_unknown_tag s))
(g' : validator g)
(x: dsum_key s)
: Tot (validate_dsum_cases_t s f g x)
= [@inline_let]
let _ = synth_dsum_case_injective s x in
match x with
| Known x' -> validate_synth (f' x') (synth_dsum_case s (Known x')) () <: validator (parse_dsum_cases' s f g x)
| Unknown x' -> validate_synth g' (synth_dsum_case s (Unknown x')) () <: validator (parse_dsum_cases' s f g x)
inline_for_extraction
let validate_dsum_cases'_destr
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(f' : (x: dsum_known_key s) -> Tot (validator (dsnd (f x))))
(#k: parser_kind)
(#g: parser k (dsum_type_of_unknown_tag s))
(g' : validator g)
(destr: dep_enum_destr _ (fun k -> validate_dsum_cases_t s f g (Known k)))
(x: dsum_key s)
: Tot (validate_dsum_cases_t s f g x)
= fun #rrel #rel input pos ->
match x with
| Known k ->
destr
_
(fun k -> validate_dsum_cases_if s f g (Known k))
(fun _ _ -> ())
(fun _ _ _ _ -> ())
(fun k -> validate_dsum_cases' s f f' g' (Known k))
k
input
pos
| Unknown r -> validate_dsum_cases' s f f' g' (Unknown r) input pos
inline_for_extraction
let validate_dsum_cases
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(f' : (x: dsum_known_key s) -> Tot (validator (dsnd (f x))))
(#k: parser_kind)
(#g: parser k (dsum_type_of_unknown_tag s))
(g' : validator g)
(destr: dep_enum_destr _ (fun k -> validate_dsum_cases_t s f g (Known k)))
(x: dsum_key s)
: Tot (validator (parse_dsum_cases s f g x))
= fun #rrel #rel input pos ->
let h = HST.get () in
[@inline_let]
let _ =
valid_facts (parse_dsum_cases' s f g x) h input (uint64_to_uint32 pos);
valid_facts (parse_dsum_cases s f g x) h input (uint64_to_uint32 pos);
parse_dsum_cases_eq' s f g x (bytes_of_slice_from h input (uint64_to_uint32 pos))
in
validate_dsum_cases'_destr s f f' g' destr x input pos
#push-options "--z3rlimit 40"
inline_for_extraction
let validate_dsum
(#kt: parser_kind)
(t: dsum)
(#p: parser kt (dsum_repr_type t))
(v: validator p)
(p32: leaf_reader p)
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(f32: (x: dsum_known_key t) -> Tot (validator (dsnd (f x))))
(#k': parser_kind)
(#g: parser k' (dsum_type_of_unknown_tag t))
(g32: validator g)
(destr: dep_maybe_enum_destr_t (dsum_enum t) (validate_dsum_cases_t t f g))
: Tot (validator (parse_dsum t p f g))
= fun #rrel #rel input pos ->
let h = HST.get () in
[@inline_let]
let _ = parse_dsum_eq' t p f g (bytes_of_slice_from h input (uint64_to_uint32 pos)) in
[@inline_let]
let _ = valid_facts (parse_dsum t p f g) h input (uint64_to_uint32 pos) in
[@inline_let]
let _ = valid_facts p h input (uint64_to_uint32 pos) in
let pos_after_tag = v input pos in
if is_error pos_after_tag
then pos_after_tag
else
let tg = p32 input (uint64_to_uint32 pos) in
[@inline_let]
let _ = valid_facts (parse_dsum_cases' t f g (maybe_enum_key_of_repr (dsum_enum t) tg)) h input (uint64_to_uint32 pos_after_tag) in
destr (validate_dsum_cases_eq t f g) (validate_dsum_cases_if t f g) (fun _ _ -> ()) (fun _ _ _ _ -> ()) (validate_dsum_cases' t f f32 g32) tg input pos_after_tag
#pop-options
#reset-options "--z3rlimit 64 --z3cliopt smt.arith.nl=false --initial_ifuel 8 --max_ifuel 8 --initial_fuel 2 --max_fuel 2"
let valid_dsum_intro_known
(h: HS.mem)
(t: dsum)
(#kt: parser_kind)
(p: parser kt (dsum_repr_type t))
(f: ((x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x))))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: Lemma
(requires (
valid (parse_maybe_enum_key p (dsum_enum t)) h input pos /\ (
let k' = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
Known? k' /\ (
let Known k = k' in
valid (dsnd (f k)) h input (get_valid_pos (parse_maybe_enum_key p (dsum_enum t)) h input pos)
))))
(ensures (
let Known k = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
let pos_payload = get_valid_pos (parse_maybe_enum_key p (dsum_enum t)) h input pos in
valid_content_pos
(parse_dsum t p f g) h input pos
(synth_dsum_case t (Known k) (contents (dsnd (f k)) h input pos_payload))
(get_valid_pos (dsnd (f k)) h input pos_payload)
))
= valid_facts (parse_maybe_enum_key p (dsum_enum t)) h input pos;
let Known k = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
let pos_payload = get_valid_pos (parse_maybe_enum_key p (dsum_enum t)) h input pos in
valid_facts (dsnd (f k)) h input pos_payload;
valid_facts (parse_dsum t p f g) h input pos;
parse_dsum_eq t p f g (bytes_of_slice_from h input pos)
let valid_dsum_intro_unknown
(h: HS.mem)
(t: dsum)
(#kt: parser_kind)
(p: parser kt (dsum_repr_type t))
(f: ((x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x))))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: Lemma
(requires (
valid (parse_maybe_enum_key p (dsum_enum t)) h input pos /\ (
let k' = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
Unknown? k' /\
valid g h input (get_valid_pos (parse_maybe_enum_key p (dsum_enum t)) h input pos)
)))
(ensures (
let Unknown r = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
let pos_payload = get_valid_pos (parse_maybe_enum_key p (dsum_enum t)) h input pos in
valid_content_pos
(parse_dsum t p f g) h input pos
(synth_dsum_case t (Unknown r) (contents g h input pos_payload))
(get_valid_pos g h input pos_payload)
))
= valid_facts (parse_maybe_enum_key p (dsum_enum t)) h input pos;
let Unknown r = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
let pos_payload = get_valid_pos (parse_maybe_enum_key p (dsum_enum t)) h input pos in
valid_facts g h input pos_payload;
valid_facts (parse_dsum t p f g) h input pos;
parse_dsum_eq t p f g (bytes_of_slice_from h input pos)
#reset-options
inline_for_extraction
let finalize_dsum_case_known
(t: dsum)
(#kt: parser_kind)
(#p: parser kt (dsum_repr_type t))
(s: serializer p)
(w: leaf_writer_strong s)
(f: ((x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x))))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
(destr: enum_repr_of_key'_t (dsum_enum t))
(k: dsum_known_key t)
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: HST.Stack unit
(requires (fun h ->
let len_tag = serialized_length (serialize_enum_key _ s (dsum_enum t)) k in
U32.v pos + len_tag < 4294967296 /\ (
let pos_payload = pos `U32.add` U32.uint_to_t len_tag in
valid (dsnd (f k)) h input pos_payload /\
writable input.base (U32.v pos) (U32.v pos_payload) h
)))
(ensures (fun h _ h' ->
let len_tag = serialized_length (serialize_enum_key _ s (dsum_enum t)) k in
let pos_payload = pos `U32.add` U32.uint_to_t len_tag in
B.modifies (loc_slice_from_to input pos pos_payload) h h' /\
valid_content_pos (parse_dsum t p f g) h' input pos (synth_dsum_case t (Known k) (contents (dsnd (f k)) h input pos_payload)) (get_valid_pos (dsnd (f k)) h input pos_payload)
))
= let pos1 = write_enum_key w (dsum_enum t) destr k input pos in
let h = HST.get () in
[@inline_let]
let _ =
valid_facts (parse_enum_key p (dsum_enum t)) h input pos;
valid_facts (parse_maybe_enum_key p (dsum_enum t)) h input pos;
let sq = bytes_of_slice_from h input pos in
parse_enum_key_eq p (dsum_enum t) sq;
parse_maybe_enum_key_eq p (dsum_enum t) sq;
valid_dsum_intro_known h t p f g input pos
in
()
inline_for_extraction
let finalize_dsum_case_unknown
(t: dsum)
(#kt: parser_kind)
(#p: parser kt (dsum_repr_type t))
(s: serializer p)
(w: leaf_writer_strong s)
(f: ((x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x))))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
(r: unknown_enum_repr (dsum_enum t))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: HST.Stack unit
(requires (fun h ->
let len_tag = serialized_length s r in
U32.v pos + len_tag < 4294967296 /\ (
let pos_payload = pos `U32.add` U32.uint_to_t len_tag in
valid g h input pos_payload /\
writable input.base (U32.v pos) (U32.v pos_payload) h
)))
(ensures (fun h _ h' ->
let len_tag = serialized_length s r in
let pos_payload = pos `U32.add` U32.uint_to_t len_tag in
B.modifies (loc_slice_from_to input pos pos_payload) h h' /\
valid_content_pos (parse_dsum t p f g) h' input pos (synth_dsum_case t (Unknown r) (contents g h input pos_payload)) (get_valid_pos g h input pos_payload)
))
= let pos1 = w r input pos in
let h = HST.get () in
[@inline_let]
let _ =
valid_facts (parse_maybe_enum_key p (dsum_enum t)) h input pos;
valid_facts p h input pos;
let sq = bytes_of_slice_from h input pos in
parse_maybe_enum_key_eq p (dsum_enum t) sq;
valid_dsum_intro_unknown h t p f g input pos
in
()
let valid_dsum_elim_tag
(h: HS.mem)
(t: dsum)
(#kt: parser_kind)
(p: parser kt (dsum_repr_type t))
(f: ((x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x))))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: Lemma
(requires (
valid (parse_dsum t p f g) h input pos
))
(ensures (
valid (parse_maybe_enum_key p (dsum_enum t)) h input pos /\
contents (parse_maybe_enum_key p (dsum_enum t)) h input pos == dsum_tag_of_data t (contents (parse_dsum t p f g) h input pos)
))
= let _ = parse_dsum_eq_ t p f g (bytes_of_slice_from h input pos) in
let _ = valid_facts (parse_dsum t p f g) h input pos in
let _ = valid_facts (parse_maybe_enum_key p (dsum_enum t)) h input pos in
()
inline_for_extraction
let read_dsum_tag
(t: dsum)
(#kt: parser_kind)
(#p: parser kt (dsum_repr_type t))
(p32: leaf_reader p)
(destr: maybe_enum_destr_t (maybe_enum_key (dsum_enum t)) (dsum_enum t))
(f: ((x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x))))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: HST.Stack (dsum_key t)
(requires (fun h ->
valid (parse_dsum t p f g) h input pos
))
(ensures (fun h res h' ->
B.modifies B.loc_none h h' /\
res == dsum_tag_of_data t (contents (parse_dsum t p f g) h input pos)
))
= let h = HST.get () in
[@inline_let] let _ = valid_dsum_elim_tag h t p f g input pos in
read_maybe_enum_key p32 (dsum_enum t) destr input pos
#push-options "--z3rlimit 32"
let valid_dsum_elim_known
(h: HS.mem)
(t: dsum)
(#kt: parser_kind)
(p: parser kt (dsum_repr_type t))
(f: ((x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x))))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: Lemma
(requires (
valid (parse_dsum t p f g) h input pos /\
Known? (dsum_tag_of_data t (contents (parse_dsum t p f g) h input pos))
))
(ensures (
valid (parse_maybe_enum_key p (dsum_enum t)) h input pos /\ (
let k' = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
let pos_payload = get_valid_pos (parse_maybe_enum_key p (dsum_enum t)) h input pos in
Known? k' /\ (
let Known k = k' in
valid (dsnd (f k)) h input pos_payload /\
valid_content_pos
(parse_dsum t p f g) h input pos
(synth_dsum_case t (Known k) (contents (dsnd (f k)) h input pos_payload))
(get_valid_pos (dsnd (f k)) h input pos_payload)
))))
=
valid_facts (parse_dsum t p f g) h input pos;
parse_dsum_eq t p f g (bytes_of_slice_from h input pos);
valid_facts (parse_maybe_enum_key p (dsum_enum t)) h input pos;
let Known k = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
let pos_payload = get_valid_pos (parse_maybe_enum_key p (dsum_enum t)) h input pos in
valid_facts (dsnd (f k)) h input pos_payload
#pop-options
let valid_dsum_elim_unknown
(h: HS.mem)
(t: dsum)
(#kt: parser_kind)
(p: parser kt (dsum_repr_type t))
(f: ((x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x))))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: Lemma
(requires (
valid (parse_dsum t p f g) h input pos /\
Unknown? (dsum_tag_of_data t (contents (parse_dsum t p f g) h input pos))
))
(ensures (
valid (parse_maybe_enum_key p (dsum_enum t)) h input pos /\ (
let k' = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
let pos_payload = get_valid_pos (parse_maybe_enum_key p (dsum_enum t)) h input pos in
Unknown? k' /\ (
let Unknown r = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
valid g h input pos_payload /\
valid_content_pos
(parse_dsum t p f g) h input pos
(synth_dsum_case t (Unknown r) (contents g h input pos_payload))
(get_valid_pos g h input pos_payload)
))))
=
valid_facts (parse_dsum t p f g) h input pos;
parse_dsum_eq t p f g (bytes_of_slice_from h input pos);
valid_facts (parse_maybe_enum_key p (dsum_enum t)) h input pos;
let Unknown r = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
let pos_payload = get_valid_pos (parse_maybe_enum_key p (dsum_enum t)) h input pos in
valid_facts g h input pos_payload
inline_for_extraction
let jump_dsum_cases_t
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(#k: parser_kind)
(g: parser k (dsum_type_of_unknown_tag s))
(x: dsum_key s)
: Tot Type
= jumper (parse_dsum_cases' s f g x)
let jump_dsum_cases_eq
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(#k: parser_kind)
(g: parser k (dsum_type_of_unknown_tag s))
(x: dsum_key s)
(v1 v2 : jump_dsum_cases_t s f g x)
: GTot Type0
= True
inline_for_extraction
let jump_dsum_cases_if'
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(#k: parser_kind)
(g: parser k (dsum_type_of_unknown_tag s))
(x: dsum_key s)
(cond: bool)
(ift: (cond_true cond -> Tot (jump_dsum_cases_t s f g x)))
(iff: (cond_false cond -> Tot (jump_dsum_cases_t s f g x)))
: Tot (jump_dsum_cases_t s f g x)
= fun #rrel #rel input len ->
if cond
then (ift () <: jump_dsum_cases_t s f g x) input len
else (iff () <: jump_dsum_cases_t s f g x) input len
inline_for_extraction
let jump_dsum_cases_if
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(#k: parser_kind)
(g: parser k (dsum_type_of_unknown_tag s))
(x: dsum_key s)
: Tot (if_combinator _ (jump_dsum_cases_eq s f g x))
= jump_dsum_cases_if' s f g x
inline_for_extraction
let jump_dsum_cases'
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(f' : (x: dsum_known_key s) -> Tot (jumper (dsnd (f x))))
(#k: parser_kind)
(#g: parser k (dsum_type_of_unknown_tag s))
(g' : jumper g)
(x: dsum_key s)
: Tot (jump_dsum_cases_t s f g x)
= synth_dsum_case_injective s x;
match x with
| Known x' -> jump_synth (f' x') (synth_dsum_case s (Known x')) () <: jumper (parse_dsum_cases' s f g x)
| Unknown x' -> jump_synth g' (synth_dsum_case s (Unknown x')) () <: jumper (parse_dsum_cases' s f g x)
inline_for_extraction
let jump_dsum_cases'_destr
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(f' : (x: dsum_known_key s) -> Tot (jumper (dsnd (f x))))
(#k: parser_kind)
(#g: parser k (dsum_type_of_unknown_tag s))
(g' : jumper g)
(destr: dep_enum_destr _ (fun k -> jump_dsum_cases_t s f g (Known k)))
(x: dsum_key s)
: Tot (jump_dsum_cases_t s f g x)
= fun #rrel #rel input pos ->
match x with
| Known k ->
destr
_
(fun k -> jump_dsum_cases_if s f g (Known k))
(fun _ _ -> ())
(fun _ _ _ _ -> ())
(fun k -> jump_dsum_cases' s f f' g' (Known k))
k
input
pos
| Unknown r -> jump_dsum_cases' s f f' g' (Unknown r) input pos
inline_for_extraction
let jump_dsum_cases
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(f' : (x: dsum_known_key s) -> Tot (jumper (dsnd (f x))))
(#k: parser_kind)
(#g: parser k (dsum_type_of_unknown_tag s))
(g' : jumper g)
(destr: dep_enum_destr _ (fun k -> jump_dsum_cases_t s f g (Known k)))
(x: dsum_key s)
: Tot (jumper (parse_dsum_cases s f g x))
= fun #rrel #rel input pos ->
let h = HST.get () in
[@inline_let]
let _ =
valid_facts (parse_dsum_cases' s f g x) h input pos;
valid_facts (parse_dsum_cases s f g x) h input pos;
parse_dsum_cases_eq' s f g x (bytes_of_slice_from h input pos)
in
jump_dsum_cases'_destr s f f' g' destr x input pos
#push-options "--z3rlimit 16"
inline_for_extraction
let jump_dsum
(#kt: parser_kind)
(t: dsum)
(#p: parser kt (dsum_repr_type t))
(v: jumper p)
(p32: leaf_reader p)
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(f32: (x: dsum_known_key t) -> Tot (jumper (dsnd (f x))))
(#k': parser_kind)
(#g: parser k' (dsum_type_of_unknown_tag t))
(g32: jumper g)
(destr: dep_maybe_enum_destr_t (dsum_enum t) (jump_dsum_cases_t t f g))
: Tot (jumper (parse_dsum t p f g))
= fun #rrel #rel input pos ->
let h = HST.get () in
[@inline_let]
let _ = parse_dsum_eq' t p f g (bytes_of_slice_from h input pos) in
[@inline_let]
let _ = valid_facts (parse_dsum t p f g) h input pos in
[@inline_let]
let _ = valid_facts p h input pos in
let pos_after_tag = v input pos in
let tg = p32 input pos in
[@inline_let]
let _ = valid_facts (parse_dsum_cases' t f g (maybe_enum_key_of_repr (dsum_enum t) tg)) h input pos_after_tag in
destr (jump_dsum_cases_eq t f g) (jump_dsum_cases_if t f g) (fun _ _ -> ()) (fun _ _ _ _ -> ()) (jump_dsum_cases' t f f32 g32) tg input pos_after_tag
#pop-options
inline_for_extraction
let read_dsum_cases'
(t: dsum)
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(f32: (x: dsum_known_key t) -> Tot (leaf_reader (dsnd (f x))))
(#k': parser_kind)
(g: parser k' (dsum_type_of_unknown_tag t))
(g32: leaf_reader g)
(x: dsum_key t)
: Tot (leaf_reader (parse_dsum_cases' t f g x))
= fun #rrel #rel input pos ->
[@inline_let]
let _ = synth_dsum_case_injective t x in
match x with
| Known x' ->
read_synth'
(dsnd (f x'))
(synth_dsum_case t (Known x'))
(f32 x')
()
input
pos
| Unknown x' ->
read_synth'
g
(synth_dsum_case t (Unknown x'))
g32
()
input
pos
inline_for_extraction
let read_dsum_cases_t
(t: dsum)
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(#k': parser_kind)
(g: parser k' (dsum_type_of_unknown_tag t))
(k: dsum_known_key t)
: Tot Type
= leaf_reader (parse_dsum_cases' t f g (Known k))
let read_dsum_cases_t_eq
(t: dsum)
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(#k': parser_kind)
(g: parser k' (dsum_type_of_unknown_tag t))
(k: dsum_known_key t)
(x y : read_dsum_cases_t t f g k)
: GTot Type0
= True
inline_for_extraction
let read_dsum_cases_t_if
(t: dsum)
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(#k': parser_kind)
(g: parser k' (dsum_type_of_unknown_tag t))
(k: dsum_known_key t)
: Tot (if_combinator _ (read_dsum_cases_t_eq t f g k))
= fun cond (sv_true: cond_true cond -> Tot (read_dsum_cases_t t f g k)) (sv_false: cond_false cond -> Tot (read_dsum_cases_t t f g k)) #_ #_ input pos ->
if cond
then sv_true () input pos
else sv_false () input pos
inline_for_extraction
let read_dsum_cases
(t: dsum)
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(f32: (x: dsum_known_key t) -> Tot (leaf_reader (dsnd (f x))))
(#k': parser_kind)
(g: parser k' (dsum_type_of_unknown_tag t))
(g32: leaf_reader g)
(destr: dep_enum_destr _ (read_dsum_cases_t t f g))
(x: dsum_key t)
: Tot (leaf_reader (parse_dsum_cases' t f g x))
= fun #_ #_ input pos ->
match x with
| Known k ->
destr
_
(read_dsum_cases_t_if t f g)
(fun _ _ -> ())
(fun _ _ _ _ -> ())
(fun k -> read_dsum_cases' t f f32 g g32 (Known k))
k
input
pos
| Unknown r ->
read_dsum_cases' t f f32 g g32 (Unknown r) input pos
#push-options "--z3rlimit 16"
inline_for_extraction
let read_dsum
(#kt: parser_kind)
(t: dsum)
(#p: parser kt (dsum_repr_type t))
(p32: leaf_reader (parse_maybe_enum_key p (dsum_enum t)))
(j: jumper p)
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(f32: (x: dsum_known_key t) -> Tot (leaf_reader (dsnd (f x))))
(#k': parser_kind)
(#g: parser k' (dsum_type_of_unknown_tag t))
(g32: leaf_reader g)
(destr: dep_enum_destr _ (read_dsum_cases_t t f g))
: Tot (leaf_reader (parse_dsum t p f g))
= fun #_ #_ input pos ->
let h = HST.get () in
valid_facts (parse_dsum t p f g) h input pos;
parse_dsum_eq_ t p f g (bytes_of_slice_from h input pos);
valid_facts (parse_maybe_enum_key p (dsum_enum t)) h input pos;
let k = p32 input pos in
let pos' = jump_maybe_enum_key j (dsum_enum t) input pos in
valid_facts (parse_dsum_cases' t f g k) h input pos' ;
read_dsum_cases t f f32 g g32 destr k input pos'
#pop-options
inline_for_extraction
let serialize32_dsum_type_of_tag
(t: dsum)
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(sf: (x: dsum_known_key t) -> Tot (serializer (dsnd (f x))))
(sf32: (x: dsum_known_key t) -> Tot (serializer32 (sf x)))
(#k': parser_kind)
(#g: parser k' (dsum_type_of_unknown_tag t))
(#sg: serializer g)
(sg32: serializer32 sg)
(tg: dsum_key t)
: Tot (serializer32 (serialize_dsum_type_of_tag t f sf g sg tg))
= match tg with
| Known x' -> serialize32_ext (dsnd (f x')) (sf x') (sf32 x') (parse_dsum_type_of_tag t f g tg) ()
| Unknown x' -> serialize32_ext g sg sg32 (parse_dsum_type_of_tag t f g tg) ()
inline_for_extraction
let serialize32_dsum_cases_aux
(t: dsum)
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(sf: (x: dsum_known_key t) -> Tot (serializer (dsnd (f x))))
(sf32: (x: dsum_known_key t) -> Tot (serializer32 (sf x)))
(#k': parser_kind)
(#g: parser k' (dsum_type_of_unknown_tag t))
(#sg: serializer g)
(sg32: serializer32 sg)
(tg: dsum_key t)
: Tot (serializer32 (serialize_dsum_cases t f sf g sg tg))
= [@inline_let]
let _ = synth_dsum_case_injective t tg in
[@inline_let]
let _ = synth_dsum_case_inverse t tg in
serialize32_synth
(serialize32_dsum_type_of_tag t f sf sf32 sg32 tg)
(synth_dsum_case t tg)
(synth_dsum_case_recip t tg)
(fun x -> synth_dsum_case_recip t tg x)
()
inline_for_extraction
let serialize32_dsum_cases_t
(t: dsum)
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(sf: (x: dsum_known_key t) -> Tot (serializer (dsnd (f x))))
(#k': parser_kind)
(g: parser k' (dsum_type_of_unknown_tag t))
(sg: serializer g)
(k: dsum_known_key t)
: Tot Type
= serializer32 (serialize_dsum_cases t f sf g sg (Known k))
let serialize32_dsum_cases_t_eq
(t: dsum)
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(sf: (x: dsum_known_key t) -> Tot (serializer (dsnd (f x))))
(#k': parser_kind)
(g: parser k' (dsum_type_of_unknown_tag t))
(sg: serializer g)
(k: dsum_known_key t)
(x y: serialize32_dsum_cases_t t f sf g sg k)
: GTot Type0
= True
inline_for_extraction
let serialize32_dsum_cases_t_if
(t: dsum)
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(sf: (x: dsum_known_key t) -> Tot (serializer (dsnd (f x))))
(#k': parser_kind)
(g: parser k' (dsum_type_of_unknown_tag t))
(sg: serializer g)
(k: dsum_known_key t)
: Tot (if_combinator _ (serialize32_dsum_cases_t_eq t f sf g sg k))
= fun cond (sv_true: (cond_true cond -> Tot (serialize32_dsum_cases_t t f sf g sg k))) (sv_false: (cond_false cond -> Tot (serialize32_dsum_cases_t t f sf g sg k))) x #rrel #rel output pos ->
if cond
then (sv_true () x output pos)
else (sv_false () x output pos) | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"LowStar.Buffer.fst.checked",
"LowParse.Spec.Sum.fst.checked",
"LowParse.Low.Enum.fst.checked",
"FStar.UInt64.fsti.checked",
"FStar.UInt32.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Int.Cast.fst.checked",
"FStar.HyperStack.ST.fsti.checked",
"FStar.HyperStack.fst.checked",
"FStar.Classical.fsti.checked"
],
"interface_file": false,
"source_file": "LowParse.Low.Sum.fst"
} | [
{
"abbrev": true,
"full_module": "FStar.HyperStack",
"short_module": "HS"
},
{
"abbrev": true,
"full_module": "FStar.UInt64",
"short_module": "U64"
},
{
"abbrev": true,
"full_module": "FStar.Int.Cast",
"short_module": "Cast"
},
{
"abbrev": true,
"full_module": "LowStar.Buffer",
"short_module": "B"
},
{
"abbrev": true,
"full_module": "FStar.HyperStack.ST",
"short_module": "HST"
},
{
"abbrev": true,
"full_module": "FStar.UInt32",
"short_module": "U32"
},
{
"abbrev": false,
"full_module": "LowParse.Spec.Sum",
"short_module": null
},
{
"abbrev": false,
"full_module": "LowParse.Low.Enum",
"short_module": null
},
{
"abbrev": false,
"full_module": "LowParse.Low",
"short_module": null
},
{
"abbrev": false,
"full_module": "LowParse.Low",
"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",
"short_module": null
}
] | {
"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_elim_box": false,
"smtencoding_l_arith_repr": "boxwrap",
"smtencoding_nl_arith_repr": "boxwrap",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": true,
"z3cliopt": [],
"z3refresh": false,
"z3rlimit": 5,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | false |
t: LowParse.Spec.Sum.dsum ->
f:
(x: LowParse.Spec.Sum.dsum_known_key t
-> Prims.dtuple2 LowParse.Spec.Base.parser_kind
(fun k -> LowParse.Spec.Base.parser k (LowParse.Spec.Sum.dsum_type_of_known_tag t x))) ->
sf:
(x: LowParse.Spec.Sum.dsum_known_key t
-> LowParse.Spec.Base.serializer (FStar.Pervasives.dsnd (f x))) ->
sf32: (x: LowParse.Spec.Sum.dsum_known_key t -> LowParse.Low.Base.serializer32 (sf x)) ->
sg32: LowParse.Low.Base.serializer32 sg ->
destr:
LowParse.Spec.Enum.dep_enum_destr (LowParse.Spec.Sum.dsum_enum t)
(LowParse.Low.Sum.serialize32_dsum_cases_t t f sf g sg) ->
tg: LowParse.Spec.Sum.dsum_key t
-> LowParse.Low.Base.serializer32 (LowParse.Spec.Sum.serialize_dsum_cases t f sf g sg tg) | Prims.Tot | [
"total"
] | [] | [
"LowParse.Spec.Sum.dsum",
"LowParse.Spec.Sum.dsum_known_key",
"Prims.dtuple2",
"LowParse.Spec.Base.parser_kind",
"LowParse.Spec.Base.parser",
"LowParse.Spec.Sum.dsum_type_of_known_tag",
"LowParse.Spec.Base.serializer",
"Prims.__proj__Mkdtuple2__item___1",
"FStar.Pervasives.dsnd",
"LowParse.Low.Base.serializer32",
"LowParse.Spec.Sum.dsum_type_of_unknown_tag",
"LowParse.Spec.Enum.dep_enum_destr",
"LowParse.Spec.Sum.dsum_key_type",
"LowParse.Spec.Sum.dsum_repr_type",
"LowParse.Spec.Sum.dsum_enum",
"LowParse.Low.Sum.serialize32_dsum_cases_t",
"LowParse.Spec.Sum.dsum_key",
"LowParse.Spec.Sum.dsum_cases",
"LowStar.Monotonic.Buffer.srel",
"LowParse.Bytes.byte",
"LowStar.Monotonic.Buffer.mbuffer",
"FStar.UInt32.t",
"LowParse.Spec.Enum.enum_key",
"LowParse.Low.Sum.serialize32_dsum_cases_t_eq",
"LowParse.Low.Sum.serialize32_dsum_cases_t_if",
"Prims.unit",
"LowParse.Low.Sum.serialize32_dsum_cases_aux",
"LowParse.Spec.Enum.Known",
"LowParse.Spec.Enum.unknown_enum_repr",
"LowParse.Spec.Enum.Unknown",
"LowParse.Spec.Sum.weaken_parse_dsum_cases_kind",
"LowParse.Spec.Sum.parse_dsum_cases",
"LowParse.Spec.Sum.serialize_dsum_cases"
] | [] | false | false | false | false | false | let serialize32_dsum_cases
(t: dsum)
(f: (x: dsum_known_key t -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x))))
(sf: (x: dsum_known_key t -> Tot (serializer (dsnd (f x)))))
(sf32: (x: dsum_known_key t -> Tot (serializer32 (sf x))))
(#k': parser_kind)
(#g: parser k' (dsum_type_of_unknown_tag t))
(#sg: serializer g)
(sg32: serializer32 sg)
(destr: dep_enum_destr _ (serialize32_dsum_cases_t t f sf g sg))
(tg: dsum_key t)
: Tot (serializer32 (serialize_dsum_cases t f sf g sg tg)) =
| fun x #rrel #rel output pos ->
match tg with
| Known k ->
destr _
(serialize32_dsum_cases_t_if t f sf g sg)
(fun _ _ -> ())
(fun _ _ _ _ -> ())
(fun k -> serialize32_dsum_cases_aux t f sf sf32 sg32 (Known k))
k
x
output
pos
| Unknown r -> serialize32_dsum_cases_aux t f sf sf32 sg32 (Unknown r) x output pos | false |
LowParse.Low.Sum.fst | LowParse.Low.Sum.finalize_dsum_case_known | val finalize_dsum_case_known
(t: dsum)
(#kt: parser_kind)
(#p: parser kt (dsum_repr_type t))
(s: serializer p)
(w: leaf_writer_strong s)
(f: (x: dsum_known_key t -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x))))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
(destr: enum_repr_of_key'_t (dsum_enum t))
(k: dsum_known_key t)
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: HST.Stack unit
(requires
(fun h ->
let len_tag = serialized_length (serialize_enum_key _ s (dsum_enum t)) k in
U32.v pos + len_tag < 4294967296 /\
(let pos_payload = pos `U32.add` (U32.uint_to_t len_tag) in
valid (dsnd (f k)) h input pos_payload /\
writable input.base (U32.v pos) (U32.v pos_payload) h)))
(ensures
(fun h _ h' ->
let len_tag = serialized_length (serialize_enum_key _ s (dsum_enum t)) k in
let pos_payload = pos `U32.add` (U32.uint_to_t len_tag) in
B.modifies (loc_slice_from_to input pos pos_payload) h h' /\
valid_content_pos (parse_dsum t p f g)
h'
input
pos
(synth_dsum_case t (Known k) (contents (dsnd (f k)) h input pos_payload))
(get_valid_pos (dsnd (f k)) h input pos_payload))) | val finalize_dsum_case_known
(t: dsum)
(#kt: parser_kind)
(#p: parser kt (dsum_repr_type t))
(s: serializer p)
(w: leaf_writer_strong s)
(f: (x: dsum_known_key t -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x))))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
(destr: enum_repr_of_key'_t (dsum_enum t))
(k: dsum_known_key t)
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: HST.Stack unit
(requires
(fun h ->
let len_tag = serialized_length (serialize_enum_key _ s (dsum_enum t)) k in
U32.v pos + len_tag < 4294967296 /\
(let pos_payload = pos `U32.add` (U32.uint_to_t len_tag) in
valid (dsnd (f k)) h input pos_payload /\
writable input.base (U32.v pos) (U32.v pos_payload) h)))
(ensures
(fun h _ h' ->
let len_tag = serialized_length (serialize_enum_key _ s (dsum_enum t)) k in
let pos_payload = pos `U32.add` (U32.uint_to_t len_tag) in
B.modifies (loc_slice_from_to input pos pos_payload) h h' /\
valid_content_pos (parse_dsum t p f g)
h'
input
pos
(synth_dsum_case t (Known k) (contents (dsnd (f k)) h input pos_payload))
(get_valid_pos (dsnd (f k)) h input pos_payload))) | let finalize_dsum_case_known
(t: dsum)
(#kt: parser_kind)
(#p: parser kt (dsum_repr_type t))
(s: serializer p)
(w: leaf_writer_strong s)
(f: ((x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x))))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
(destr: enum_repr_of_key'_t (dsum_enum t))
(k: dsum_known_key t)
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: HST.Stack unit
(requires (fun h ->
let len_tag = serialized_length (serialize_enum_key _ s (dsum_enum t)) k in
U32.v pos + len_tag < 4294967296 /\ (
let pos_payload = pos `U32.add` U32.uint_to_t len_tag in
valid (dsnd (f k)) h input pos_payload /\
writable input.base (U32.v pos) (U32.v pos_payload) h
)))
(ensures (fun h _ h' ->
let len_tag = serialized_length (serialize_enum_key _ s (dsum_enum t)) k in
let pos_payload = pos `U32.add` U32.uint_to_t len_tag in
B.modifies (loc_slice_from_to input pos pos_payload) h h' /\
valid_content_pos (parse_dsum t p f g) h' input pos (synth_dsum_case t (Known k) (contents (dsnd (f k)) h input pos_payload)) (get_valid_pos (dsnd (f k)) h input pos_payload)
))
= let pos1 = write_enum_key w (dsum_enum t) destr k input pos in
let h = HST.get () in
[@inline_let]
let _ =
valid_facts (parse_enum_key p (dsum_enum t)) h input pos;
valid_facts (parse_maybe_enum_key p (dsum_enum t)) h input pos;
let sq = bytes_of_slice_from h input pos in
parse_enum_key_eq p (dsum_enum t) sq;
parse_maybe_enum_key_eq p (dsum_enum t) sq;
valid_dsum_intro_known h t p f g input pos
in
() | {
"file_name": "src/lowparse/LowParse.Low.Sum.fst",
"git_rev": "00217c4a89f5ba56002ba9aa5b4a9d5903bfe9fa",
"git_url": "https://github.com/project-everest/everparse.git",
"project_name": "everparse"
} | {
"end_col": 4,
"end_line": 1208,
"start_col": 0,
"start_line": 1169
} | module LowParse.Low.Sum
include LowParse.Low.Enum
include LowParse.Spec.Sum
module U32 = FStar.UInt32
module HST = FStar.HyperStack.ST
module B = LowStar.Buffer
module Cast = FStar.Int.Cast
module U64 = FStar.UInt64
inline_for_extraction
let validate_sum_cases_aux
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(vc: ((x: sum_key t) -> Tot (validator (dsnd (pc x)))))
(k: sum_key t)
: Tot (validator (parse_sum_cases t pc k))
= [@inline_let]
let _ = synth_sum_case_injective t k in
validate_synth
(validate_weaken
(weaken_parse_cases_kind t pc)
(vc k)
()
)
(synth_sum_case t k)
()
inline_for_extraction
let validate_sum_cases_t
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot Type
= validator (parse_sum_cases t pc k)
let validate_sum_cases_t_eq
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
(x y : validate_sum_cases_t t pc k)
: GTot Type0
= True
inline_for_extraction
let validate_sum_cases_t_if
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (if_combinator _ (validate_sum_cases_t_eq t pc k))
= fun cond (sv_true: cond_true cond -> Tot (validate_sum_cases_t t pc k)) (sv_false: cond_false cond -> Tot (validate_sum_cases_t t pc k)) #rrel #rel input pos ->
if cond
then sv_true () input pos
else sv_false () input pos
inline_for_extraction
let validate_sum_cases
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(vc: ((x: sum_key t) -> Tot (validator (dsnd (pc x)))))
(destr: dep_enum_destr (sum_enum t) (validate_sum_cases_t t pc))
(k: sum_key t)
: Tot (validator (parse_sum_cases t pc k))
= destr
_
(validate_sum_cases_t_if t pc)
(fun _ _ -> ())
(fun _ _ _ _ -> ())
(validate_sum_cases_aux t pc vc)
k
inline_for_extraction
let validate_sum_aux_payload_t
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
: Tot Type
= (#rrel: _) -> (#rel: _) ->
(input: slice rrel rel) ->
(pos: U64.t) ->
HST.Stack U64.t
(requires (fun h -> live_slice h input /\ U64.v pos <= U32.v input.len))
(ensures (fun h res h' ->
B.modifies B.loc_none h h' /\ (
match k with
| Unknown _ -> is_error res
| Known k' ->
if is_success res
then
valid_pos (dsnd (pc k')) h input (uint64_to_uint32 pos) (uint64_to_uint32 res)
else
(~ (valid (dsnd (pc k')) h input (uint64_to_uint32 pos)))
)))
let validate_sum_aux_payload_eq
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
: Tot (validate_sum_aux_payload_t t pc k -> validate_sum_aux_payload_t t pc k -> GTot Type0)
= fun _ _ -> True
inline_for_extraction
let validate_sum_aux_payload_if'
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
(cond: bool)
(ift: ((cond_true cond) -> Tot (validate_sum_aux_payload_t t pc k)))
(iff: ((cond_false cond) -> Tot (validate_sum_aux_payload_t t pc k)))
: Tot (validate_sum_aux_payload_t t pc k)
= fun #rrel #rel input pos ->
if cond
then begin
(ift () <: validate_sum_aux_payload_t t pc k) input pos
end else
(iff () <: validate_sum_aux_payload_t t pc k) input pos
inline_for_extraction
let validate_sum_aux_payload_if
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
: Tot (if_combinator _ (validate_sum_aux_payload_eq t pc k))
= validate_sum_aux_payload_if' t pc k
#push-options "--z3rlimit 64 --z3cliopt smt.arith.nl=false --using_facts_from '* -FStar.Int.Cast -LowParse.BitFields'"
// --query_stats --smtencoding.elim_box true --smtencoding.l_arith_repr native --z3refresh"
inline_for_extraction
let validate_sum_aux
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(v: validator p)
(p32: leaf_reader p)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(v_payload: ((k: sum_repr_type t)) -> Tot (validate_sum_aux_payload_t t pc (maybe_enum_key_of_repr (sum_enum t) k)))
: Tot (validator (parse_sum t p pc))
= fun #rrel #rel input pos ->
let h = HST.get () in
[@inline_let]
let _ = parse_sum_eq'' t p pc (bytes_of_slice_from h input (uint64_to_uint32 pos)) in
[@inline_let]
let _ = valid_facts (parse_sum t p pc) h input (uint64_to_uint32 pos) in
[@inline_let]
let _ = valid_facts p h input (uint64_to_uint32 pos) in
let len_after_tag = v input pos in
if is_error len_after_tag
then len_after_tag
else begin
let h1 = HST.get () in
let k' = p32 input (uint64_to_uint32 pos) in
[@inline_let]
let _ =
match maybe_enum_key_of_repr (sum_enum t) k' with
| Known k -> valid_facts (dsnd (pc k)) h input (uint64_to_uint32 len_after_tag)
| _ -> ()
in
v_payload k' input len_after_tag
end
#pop-options
inline_for_extraction
let validate_sum_aux_payload'
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (validator (dsnd (pc x)))))
(k: maybe_enum_key (sum_enum t))
: Tot (validate_sum_aux_payload_t t pc k)
= fun #rrel #rel input pos ->
match k with
| Known k ->
[@inline_let]
let _ = synth_sum_case_injective t k in
pc32 k input pos
// validate_synth (pc32 k) (synth_sum_case t k) () input pos
| _ -> validator_error_generic
inline_for_extraction
let validate_sum_aux_payload
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (validator (dsnd (pc x)))))
(destr: dep_maybe_enum_destr_t (sum_enum t) (validate_sum_aux_payload_t t pc))
(k: sum_repr_type t)
: Tot (validate_sum_aux_payload_t t pc (maybe_enum_key_of_repr (sum_enum t) k))
= destr (validate_sum_aux_payload_eq t pc) (validate_sum_aux_payload_if t pc) (fun _ _ -> ()) (fun _ _ _ _ -> ()) (validate_sum_aux_payload' t pc pc32) k
inline_for_extraction
let validate_sum
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(v: validator p)
(p32: leaf_reader p)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (validator (dsnd (pc x)))))
(destr: dep_maybe_enum_destr_t (sum_enum t) (validate_sum_aux_payload_t t pc))
: Tot (validator (parse_sum t p pc))
= validate_sum_aux t v p32 pc (validate_sum_aux_payload t pc pc32 destr)
module HS = FStar.HyperStack
#push-options "--z3rlimit 256 --z3cliopt smt.arith.nl=false --initial_ifuel 8 --max_ifuel 8 --initial_fuel 2 --max_fuel 2"
#restart-solver
let valid_sum_intro
(h: HS.mem)
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: Lemma
(requires (
valid (parse_enum_key p (sum_enum t)) h input pos /\ (
let k = contents (parse_enum_key p (sum_enum t)) h input pos in
valid (dsnd (pc k)) h input (get_valid_pos (parse_enum_key p (sum_enum t)) h input pos)
)))
(ensures (
let k = contents (parse_enum_key p (sum_enum t)) h input pos in
let pos_payload = get_valid_pos (parse_enum_key p (sum_enum t)) h input pos in
valid_content_pos
(parse_sum t p pc) h input pos
(synth_sum_case t k (contents (dsnd (pc k)) h input pos_payload))
(get_valid_pos (dsnd (pc k)) h input pos_payload)
))
= valid_facts (parse_enum_key p (sum_enum t)) h input pos;
let k = contents (parse_enum_key p (sum_enum t)) h input pos in
let pos_payload = get_valid_pos (parse_enum_key p (sum_enum t)) h input pos in
valid_facts (dsnd (pc k)) h input pos_payload;
valid_facts (parse_sum t p pc) h input pos;
parse_sum_eq t p pc (bytes_of_slice_from h input pos)
#pop-options
inline_for_extraction
let finalize_sum_case
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(s: serializer p)
(w: leaf_writer_strong s)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(destr: enum_repr_of_key'_t (sum_enum t))
(k: sum_key t)
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: HST.Stack unit
(requires (fun h ->
let len_tag = serialized_length (serialize_enum_key _ s (sum_enum t)) k in
U32.v pos + len_tag < 4294967296 /\ (
let pos_payload = pos `U32.add` U32.uint_to_t len_tag in
valid (dsnd (pc k)) h input pos_payload /\
writable input.base (U32.v pos) (U32.v pos_payload) h
)))
(ensures (fun h _ h' ->
let len_tag = serialized_length (serialize_enum_key _ s (sum_enum t)) k in
let pos_payload = pos `U32.add` U32.uint_to_t len_tag in
B.modifies (loc_slice_from_to input pos pos_payload) h h' /\
valid_content_pos (parse_sum t p pc) h' input pos (synth_sum_case t k (contents (dsnd (pc k)) h input pos_payload)) (get_valid_pos (dsnd (pc k)) h input pos_payload)
))
= let pos1 = write_enum_key w (sum_enum t) destr k input pos in
let h = HST.get () in
[@inline_let]
let _ = valid_sum_intro h t p pc input pos in
()
inline_for_extraction
let jump_sum_cases_aux
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(vc: ((x: sum_key t) -> Tot (jumper (dsnd (pc x)))))
(k: sum_key t)
: Tot (jumper (parse_sum_cases t pc k))
= [@inline_let]
let _ = synth_sum_case_injective t k in
jump_synth
(jump_weaken
(weaken_parse_cases_kind t pc)
(vc k)
()
)
(synth_sum_case t k)
()
inline_for_extraction
let jump_sum_cases_t
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot Type
= jumper (parse_sum_cases t pc k)
let jump_sum_cases_t_eq
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
(x y : jump_sum_cases_t t pc k)
: GTot Type0
= True
inline_for_extraction
let jump_sum_cases_t_if
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (if_combinator _ (jump_sum_cases_t_eq t pc k))
= fun cond (sv_true: cond_true cond -> Tot (jump_sum_cases_t t pc k)) (sv_false: cond_false cond -> Tot (jump_sum_cases_t t pc k)) #rrel #rel input pos ->
if cond
then sv_true () input pos
else sv_false () input pos
inline_for_extraction
let jump_sum_cases
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(vc: ((x: sum_key t) -> Tot (jumper (dsnd (pc x)))))
(destr: dep_enum_destr (sum_enum t) (jump_sum_cases_t t pc))
(k: sum_key t)
: Tot (jumper (parse_sum_cases t pc k))
= destr
_
(jump_sum_cases_t_if t pc)
(fun _ _ -> ())
(fun _ _ _ _ -> ())
(jump_sum_cases_aux t pc vc)
k
inline_for_extraction
let jump_sum_aux_payload_t
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
: Tot Type
= (#rrel: _) -> (#rel: _) ->
(input: slice rrel rel) ->
(pos: U32.t) ->
HST.Stack U32.t
(requires (fun h -> live_slice h input /\ U32.v pos <= U32.v input.len /\ (
match k with
| Unknown _ -> False
| Known k' -> valid (dsnd (pc k')) h input pos
)))
(ensures (fun h res h' ->
B.modifies B.loc_none h h' /\ (
match k with
| Unknown _ -> False
| Known k' ->
valid_pos (dsnd (pc k')) h input pos res
)))
let jump_sum_aux_payload_eq
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
: Tot (jump_sum_aux_payload_t t pc k -> jump_sum_aux_payload_t t pc k -> GTot Type0)
= fun _ _ -> True
inline_for_extraction
let jump_sum_aux_payload_if'
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
(cond: bool)
(ift: ((cond_true cond) -> Tot (jump_sum_aux_payload_t t pc k)))
(iff: ((cond_false cond) -> Tot (jump_sum_aux_payload_t t pc k)))
: Tot (jump_sum_aux_payload_t t pc k)
= fun #rrel #rel input pos ->
if cond
then begin
(ift () <: jump_sum_aux_payload_t t pc k) input pos
end else
(iff () <: jump_sum_aux_payload_t t pc k) input pos
inline_for_extraction
let jump_sum_aux_payload_if
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
: Tot (if_combinator _ (jump_sum_aux_payload_eq t pc k))
= jump_sum_aux_payload_if' t pc k
let parse_sum_eq3
(#kt: parser_kind)
(t: sum)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(input: bytes)
(k' : sum_repr_type t)
(consumed_k: consumed_length input)
: Lemma
(requires (Some? (parse (parse_sum t p pc) input) /\ parse p input == Some (k', consumed_k)))
(ensures (
let input_k = Seq.slice input consumed_k (Seq.length input) in
let k = maybe_enum_key_of_repr (sum_enum t) k' in
begin match k with
| Known k ->
Some? (parse (dsnd (pc k)) input_k)
| _ -> False
end
))
= parse_sum_eq'' t p pc input
let parse_sum_eq4
(#kt: parser_kind)
(t: sum)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(input: bytes)
(k' : sum_repr_type t)
(consumed_k: consumed_length input)
(consumed_payload: nat)
: Lemma
(requires (Some? (parse (parse_sum t p pc) input) /\ parse p input == Some (k', consumed_k) /\ (
let input_k = Seq.slice input consumed_k (Seq.length input) in
let k = maybe_enum_key_of_repr (sum_enum t) k' in
begin match k with
| Known k ->
Some? (parse (dsnd (pc k)) input_k) /\ (
let Some (_, consumed_payload') = parse (dsnd (pc k)) input_k in
consumed_payload' == consumed_payload
)
| _ -> False
end
)))
(ensures (
let Some (_, consumed) = parse (parse_sum t p pc) input in
consumed == consumed_k + consumed_payload
))
= parse_sum_eq'' t p pc input
#push-options "--z3rlimit 16"
let valid_sum_elim
(h: HS.mem)
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(#rrel: _) (#rel: _)
(input: slice rrel rel)
(pos: U32.t)
: Lemma
(requires (
valid (parse_sum t p pc) h input pos
))
(ensures (
valid p h input pos /\ (
let pos_payload = get_valid_pos p h input pos in
let k' = maybe_enum_key_of_repr (sum_enum t) (contents p h input pos) in
match k' with
| Known k ->
k == sum_tag_of_data t (contents (parse_sum t p pc) h input pos) /\
valid (dsnd (pc k)) h input pos_payload /\
valid_pos
(parse_sum t p pc) h input pos
(get_valid_pos (dsnd (pc k)) h input pos_payload)
| _ -> False
)))
= let sinput = bytes_of_slice_from h input pos in
let _ = parse_sum_eq'' t p pc sinput in
[@inline_let]
let _ = valid_facts (parse_sum t p pc) h input pos in
let Some (k', consumed_k) = parse p sinput in
let pos_after_tag = U32.uint_to_t (U32.v pos + consumed_k) in
[@inline_let]
let _ = valid_facts p h input pos in
assert (valid_content_pos p h input pos k' pos_after_tag);
match maybe_enum_key_of_repr (sum_enum t) k' with
| Known k -> valid_facts (dsnd (pc k)) h input pos_after_tag
| _ -> ()
#pop-options
let valid_sum_elim_tag
(h: HS.mem)
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: Lemma
(requires (
valid (parse_sum t p pc) h input pos
))
(ensures (
valid (parse_enum_key p (sum_enum t)) h input pos /\
contents (parse_enum_key p (sum_enum t)) h input pos == sum_tag_of_data t (contents (parse_sum t p pc) h input pos)
))
= let _ = parse_sum_eq' t p pc (bytes_of_slice_from h input pos) in
let _ = valid_facts (parse_sum t p pc) h input pos in
let _ = valid_facts (parse_enum_key p (sum_enum t)) h input pos in
()
inline_for_extraction
let read_sum_tag
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(p32: leaf_reader p)
(destr: dep_maybe_enum_destr_t (sum_enum t) (read_enum_key_t (sum_enum t)))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: HST.Stack (sum_key t)
(requires (fun h ->
valid (parse_sum t p pc) h input pos
))
(ensures (fun h res h' ->
B.modifies B.loc_none h h' /\
res == sum_tag_of_data t (contents (parse_sum t p pc) h input pos)
))
= let h = HST.get () in
[@inline_let] let _ = valid_sum_elim_tag h t p pc input pos in
read_enum_key p32 (sum_enum t) destr input pos
inline_for_extraction
let jump_sum_aux
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(v: jumper p)
(p32: leaf_reader p)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(v_payload: ((k: sum_repr_type t)) -> Tot (jump_sum_aux_payload_t t pc (maybe_enum_key_of_repr (sum_enum t) k)))
: Tot (jumper (parse_sum t p pc))
= fun #rrel #rel input pos ->
let h = HST.get () in
[@inline_let]
let _ = valid_sum_elim h t p pc input pos in
let pos_after_tag = v input pos in
let k' = p32 input pos in
v_payload k' input pos_after_tag
inline_for_extraction
let jump_sum_aux_payload'
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (jumper (dsnd (pc x)))))
(k: maybe_enum_key (sum_enum t))
: Tot (jump_sum_aux_payload_t t pc k)
= fun #rrel #rel input pos ->
match k with
| Known k ->
[@inline_let]
let _ = synth_sum_case_injective t k in
pc32 k input pos
| _ -> 0ul // dummy, but we MUST NOT remove this branch, otherwise extraction fails
inline_for_extraction
let jump_sum_aux_payload
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (jumper (dsnd (pc x)))))
(destr: dep_maybe_enum_destr_t (sum_enum t) (jump_sum_aux_payload_t t pc))
(k: sum_repr_type t)
: Tot (jump_sum_aux_payload_t t pc (maybe_enum_key_of_repr (sum_enum t) k))
= destr (jump_sum_aux_payload_eq t pc) (jump_sum_aux_payload_if t pc) (fun _ _ -> ()) (fun _ _ _ _ -> ()) (jump_sum_aux_payload' t pc pc32) k
inline_for_extraction
let jump_sum
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(v: jumper p)
(p32: leaf_reader p)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (jumper (dsnd (pc x)))))
(destr: dep_maybe_enum_destr_t (sum_enum t) (jump_sum_aux_payload_t t pc))
: Tot (jumper (parse_sum t p pc))
= jump_sum_aux t v p32 pc (jump_sum_aux_payload t pc pc32 destr)
inline_for_extraction
let read_sum_cases'
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (leaf_reader (dsnd (pc x)))))
(k: sum_key t)
: Tot (leaf_reader (parse_sum_cases' t pc k))
= [@inline_let]
let _ = synth_sum_case_injective t k in
read_synth'
(dsnd (pc k))
(synth_sum_case t k)
(pc32 k)
()
inline_for_extraction
let read_sum_cases_t
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot Type
= leaf_reader (parse_sum_cases' t pc k)
let read_sum_cases_t_eq
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
(x y : read_sum_cases_t t pc k)
: GTot Type0
= True
inline_for_extraction
let read_sum_cases_t_if
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (if_combinator _ (read_sum_cases_t_eq t pc k))
= fun cond (sv_true: cond_true cond -> Tot (read_sum_cases_t t pc k)) (sv_false: cond_false cond -> Tot (read_sum_cases_t t pc k)) #_ #_ input pos ->
if cond
then (sv_true () input pos)
else (sv_false () input pos)
inline_for_extraction
let read_sum_cases
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (leaf_reader (dsnd (pc x)))))
(destr: dep_enum_destr (sum_enum t) (read_sum_cases_t t pc))
(k: sum_key t)
: Tot (leaf_reader (parse_sum_cases' t pc k))
= destr
_
(read_sum_cases_t_if t pc)
(fun _ _ -> ())
(fun _ _ _ _ -> ())
(read_sum_cases' t pc pc32)
k
#push-options "--z3rlimit 32"
inline_for_extraction
let read_sum
(#kt: parser_kind)
(t: sum)
(p: parser kt (sum_repr_type t))
(p32: leaf_reader (parse_enum_key p (sum_enum t)))
(j: jumper p)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (leaf_reader (dsnd (pc x)))))
(destr: dep_enum_destr (sum_enum t) (read_sum_cases_t t pc))
: Tot (leaf_reader (parse_sum t p pc))
=
fun #_ #_ input pos ->
let h = HST.get () in
valid_facts (parse_sum t p pc) h input pos;
parse_sum_eq' t p pc (bytes_of_slice_from h input pos);
valid_facts (parse_enum_key p (sum_enum t)) h input pos;
let k = p32 input pos in
let pos' = jump_enum_key j (sum_enum t) input pos in
valid_facts (parse_sum_cases' t pc k) h input pos' ;
read_sum_cases t pc pc32 destr k input pos'
#pop-options
inline_for_extraction
let serialize32_sum_cases_t
(t: sum)
(#pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(sc: ((x: sum_key t) -> Tot (serializer (dsnd (pc x)))))
(k: sum_key t)
: Tot Type
= serializer32 (serialize_sum_cases t pc sc k)
let serialize32_sum_cases_t_eq
(t: sum)
(#pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(sc: ((x: sum_key t) -> Tot (serializer (dsnd (pc x)))))
(k: sum_key t)
(x y: serialize32_sum_cases_t t sc k)
: GTot Type0
= True
inline_for_extraction
let serialize32_sum_cases_t_if
(t: sum)
(#pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(sc: ((x: sum_key t) -> Tot (serializer (dsnd (pc x)))))
(k: sum_key t)
: Tot (if_combinator _ (serialize32_sum_cases_t_eq t sc k))
= fun cond (sv_true: (cond_true cond -> Tot (serialize32_sum_cases_t t sc k))) (sv_false: (cond_false cond -> Tot (serialize32_sum_cases_t t sc k))) x #rrel #rel b pos ->
if cond
then (sv_true () x b pos)
else (sv_false () x b pos)
inline_for_extraction
let serialize32_sum_cases_aux
(t: sum)
(#pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(sc: ((x: sum_key t) -> Tot (serializer (dsnd (pc x)))))
(sc32: ((x: sum_key t) -> Tot (serializer32 (sc x))))
(k: sum_key t)
: Tot (serializer32 (serialize_sum_cases t pc sc k))
= fun x #rrel #rel b pos ->
[@inline_let] let _ =
Classical.forall_intro (parse_sum_cases_eq' t pc k);
synth_sum_case_injective t k;
synth_sum_case_inverse t k
in
serialize32_synth
(sc32 k)
(synth_sum_case t k)
(synth_sum_case_recip t k)
(fun x -> synth_sum_case_recip t k x)
()
x
b
pos
inline_for_extraction
let serialize32_sum_cases
(t: sum)
(#pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(sc: ((x: sum_key t) -> Tot (serializer (dsnd (pc x)))))
(sc32: ((x: sum_key t) -> Tot (serializer32 (sc x))))
(destr: dep_enum_destr (sum_enum t) (serialize32_sum_cases_t t sc))
(k: sum_key t)
: Tot (serializer32 (serialize_sum_cases t pc sc k))
= destr
_
(serialize32_sum_cases_t_if t sc)
(fun _ _ -> ())
(fun _ _ _ _ -> ())
(serialize32_sum_cases_aux t sc sc32)
k
inline_for_extraction
let serialize32_sum
(#kt: parser_kind)
(t: sum)
(#p: parser kt (sum_repr_type t))
(s: serializer p {kt.parser_kind_subkind == Some ParserStrong})
(s32: serializer32 (serialize_enum_key _ s (sum_enum t)))
(#pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(sc: ((x: sum_key t) -> Tot (serializer (dsnd (pc x)))))
(sc32: ((x: sum_key t) -> Tot (serializer32 (sc x))))
(destr: dep_enum_destr (sum_enum t) (serialize32_sum_cases_t t sc))
: Tot (serializer32 (serialize_sum t s sc))
= fun x #rrel #rel b pos ->
serialize_sum_eq t s sc x;
let tg = sum_tag_of_data t x in
serialize32_nondep_then_aux s32 (serialize32_sum_cases t sc sc32 destr tg) tg x b pos
let clens_sum_tag
(s: sum)
: Tot (clens (sum_type s) (sum_key s))
= {
clens_cond = (fun _ -> True);
clens_get = sum_tag_of_data s;
}
let gaccessor_sum_tag
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
: Tot (gaccessor (parse_sum t p pc) (parse_enum_key p (sum_enum t)) (clens_sum_tag t))
= gaccessor_tagged_union_tag
(parse_enum_key p (sum_enum t))
(sum_tag_of_data t)
(parse_sum_cases t pc)
inline_for_extraction
let accessor_sum_tag
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
: Tot (accessor (gaccessor_sum_tag t p pc))
= accessor_tagged_union_tag
(parse_enum_key p (sum_enum t))
(sum_tag_of_data t)
(parse_sum_cases t pc)
let clens_sum_payload
(s: sum)
(k: sum_key s)
: Tot (clens (sum_type s) (sum_type_of_tag s k))
= {
clens_cond = (fun (x: sum_type s) -> sum_tag_of_data s x == k);
clens_get = (fun (x: sum_type s) -> synth_sum_case_recip s k x <: Ghost (sum_type_of_tag s k) (requires (sum_tag_of_data s x == k)) (ensures (fun _ -> True)));
}
#push-options "--z3rlimit 32"
let gaccessor_clens_sum_payload'
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (gaccessor' (parse_sum t p pc) (dsnd (pc k)) (clens_sum_payload t k))
= fun (input: bytes) ->
parse_sum_eq'' t p pc input;
let res =
match parse p input with
| Some (_, consumed) ->
synth_sum_case_inverse t k;
synth_sum_case_injective t k;
synth_injective_synth_inverse_synth_inverse_recip (synth_sum_case t k) (synth_sum_case_recip t k) ();
(consumed)
| _ -> 0 // dummy
in
(res <: (res: _ { gaccessor_post' (parse_sum t p pc) (dsnd (pc k)) (clens_sum_payload t k) input res } ))
#push-options "--z3rlimit 64"
let gaccessor_clens_sum_payload_injective
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
(sl sl' : bytes)
: Lemma
(requires (
gaccessor_pre (parse_sum t p pc) (dsnd (pc k)) (clens_sum_payload t k) sl /\
gaccessor_pre (parse_sum t p pc) (dsnd (pc k)) (clens_sum_payload t k) sl' /\
injective_precond (parse_sum t p pc) sl sl'
))
(ensures (gaccessor_clens_sum_payload' t p pc k sl == gaccessor_clens_sum_payload' t p pc k sl'))
= parse_sum_eq'' t p pc sl;
parse_sum_eq'' t p pc sl' ;
parse_injective (parse_sum t p pc) sl sl' ;
parse_injective p sl sl'
#pop-options
let gaccessor_clens_sum_payload_no_lookahead
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
(sl sl' : bytes)
: Lemma
(requires (
(parse_sum_kind kt t pc).parser_kind_subkind == Some ParserStrong /\
gaccessor_pre (parse_sum t p pc) (dsnd (pc k)) (clens_sum_payload t k) sl /\
gaccessor_pre (parse_sum t p pc) (dsnd (pc k)) (clens_sum_payload t k) sl' /\
no_lookahead_on_precond (parse_sum t p pc) sl sl'
))
(ensures (gaccessor_clens_sum_payload' t p pc k sl == gaccessor_clens_sum_payload' t p pc k sl'))
= parse_sum_eq'' t p pc sl;
parse_sum_eq'' t p pc sl' ;
parse_strong_prefix (parse_sum t p pc) sl sl' ;
parse_injective p sl sl'
let gaccessor_clens_sum_payload
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (gaccessor (parse_sum t p pc) (dsnd (pc k)) (clens_sum_payload t k))
= Classical.forall_intro_2 (fun x -> Classical.move_requires (gaccessor_clens_sum_payload_injective t p pc k x));
Classical.forall_intro_2 (fun x -> Classical.move_requires (gaccessor_clens_sum_payload_no_lookahead t p pc k x));
gaccessor_prop_equiv (parse_sum t p pc) (dsnd (pc k)) (clens_sum_payload t k) (gaccessor_clens_sum_payload' t p pc k);
gaccessor_clens_sum_payload' t p pc k
inline_for_extraction
let accessor_clens_sum_payload'
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(j: jumper p)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: HST.Stack U32.t
(requires (fun h ->
valid (parse_sum t p pc) h input pos /\
(clens_sum_payload t k).clens_cond (contents (parse_sum t p pc) h input pos)
))
(ensures (fun h pos' h' ->
B.modifies B.loc_none h h' /\
pos' == slice_access h (gaccessor_clens_sum_payload t p pc k) input pos
))
=
let h = HST.get () in
[@inline_let]
let _ =
let pos' = get_valid_pos (parse_sum t p pc) h input pos in
let large = bytes_of_slice_from h input pos in
slice_access_eq h (gaccessor_clens_sum_payload t p pc k) input pos;
valid_facts (parse_sum t p pc) h input pos;
parse_sum_eq'' t p pc large;
valid_facts p h input pos
in
j input pos
#pop-options
inline_for_extraction
let accessor_clens_sum_payload
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(j: jumper p)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (accessor (gaccessor_clens_sum_payload t p pc k))
= fun #rrel #rel -> accessor_clens_sum_payload' t j pc k #rrel #rel
let clens_sum_cases_payload
(s: sum)
(k: sum_key s)
: Tot (clens (sum_cases s k) (sum_type_of_tag s k))
= {
clens_cond = (fun (x: sum_cases s k) -> True);
clens_get = (fun (x: sum_cases s k) -> synth_sum_case_recip s k x <: Ghost (sum_type_of_tag s k) (requires (True)) (ensures (fun _ -> True)));
}
let gaccessor_clens_sum_cases_payload
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (gaccessor (parse_sum_cases' t pc k) (dsnd (pc k)) (clens_sum_cases_payload t k))
= synth_sum_case_injective t k;
synth_sum_case_inverse t k;
synth_injective_synth_inverse_synth_inverse_recip (synth_sum_case t k) (synth_sum_case_recip t k) ();
gaccessor_ext
(gaccessor_synth (dsnd (pc k)) (synth_sum_case t k) (synth_sum_case_recip t k) ())
(clens_sum_cases_payload t k)
()
inline_for_extraction
let accessor_clens_sum_cases_payload
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (accessor (gaccessor_clens_sum_cases_payload t pc k))
= [@inline_let]
let _ =
synth_sum_case_injective t k;
synth_sum_case_inverse t k;
synth_injective_synth_inverse_synth_inverse_recip (synth_sum_case t k) (synth_sum_case_recip t k) ()
in
accessor_ext
(accessor_synth (dsnd (pc k)) (synth_sum_case t k) (synth_sum_case_recip t k) ())
(clens_sum_cases_payload t k)
()
inline_for_extraction
let validate_dsum_cases_t
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(#k: parser_kind)
(g: parser k (dsum_type_of_unknown_tag s))
(x: dsum_key s)
: Tot Type
= validator (parse_dsum_cases' s f g x)
let validate_dsum_cases_eq
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(#k: parser_kind)
(g: parser k (dsum_type_of_unknown_tag s))
(x: dsum_key s)
(v1 v2 : validate_dsum_cases_t s f g x)
: GTot Type0
= True
inline_for_extraction
let validate_dsum_cases_if'
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(#k: parser_kind)
(g: parser k (dsum_type_of_unknown_tag s))
(x: dsum_key s)
(cond: bool)
(ift: (cond_true cond -> Tot (validate_dsum_cases_t s f g x)))
(iff: (cond_false cond -> Tot (validate_dsum_cases_t s f g x)))
: Tot (validate_dsum_cases_t s f g x)
= fun #rrel #rel input len ->
if cond
then (ift () <: validate_dsum_cases_t s f g x) input len
else (iff () <: validate_dsum_cases_t s f g x) input len
inline_for_extraction
let validate_dsum_cases_if
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(#k: parser_kind)
(g: parser k (dsum_type_of_unknown_tag s))
(x: dsum_key s)
: Tot (if_combinator _ (validate_dsum_cases_eq s f g x))
= validate_dsum_cases_if' s f g x
inline_for_extraction
let validate_dsum_cases'
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(f' : (x: dsum_known_key s) -> Tot (validator (dsnd (f x))))
(#k: parser_kind)
(#g: parser k (dsum_type_of_unknown_tag s))
(g' : validator g)
(x: dsum_key s)
: Tot (validate_dsum_cases_t s f g x)
= [@inline_let]
let _ = synth_dsum_case_injective s x in
match x with
| Known x' -> validate_synth (f' x') (synth_dsum_case s (Known x')) () <: validator (parse_dsum_cases' s f g x)
| Unknown x' -> validate_synth g' (synth_dsum_case s (Unknown x')) () <: validator (parse_dsum_cases' s f g x)
inline_for_extraction
let validate_dsum_cases'_destr
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(f' : (x: dsum_known_key s) -> Tot (validator (dsnd (f x))))
(#k: parser_kind)
(#g: parser k (dsum_type_of_unknown_tag s))
(g' : validator g)
(destr: dep_enum_destr _ (fun k -> validate_dsum_cases_t s f g (Known k)))
(x: dsum_key s)
: Tot (validate_dsum_cases_t s f g x)
= fun #rrel #rel input pos ->
match x with
| Known k ->
destr
_
(fun k -> validate_dsum_cases_if s f g (Known k))
(fun _ _ -> ())
(fun _ _ _ _ -> ())
(fun k -> validate_dsum_cases' s f f' g' (Known k))
k
input
pos
| Unknown r -> validate_dsum_cases' s f f' g' (Unknown r) input pos
inline_for_extraction
let validate_dsum_cases
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(f' : (x: dsum_known_key s) -> Tot (validator (dsnd (f x))))
(#k: parser_kind)
(#g: parser k (dsum_type_of_unknown_tag s))
(g' : validator g)
(destr: dep_enum_destr _ (fun k -> validate_dsum_cases_t s f g (Known k)))
(x: dsum_key s)
: Tot (validator (parse_dsum_cases s f g x))
= fun #rrel #rel input pos ->
let h = HST.get () in
[@inline_let]
let _ =
valid_facts (parse_dsum_cases' s f g x) h input (uint64_to_uint32 pos);
valid_facts (parse_dsum_cases s f g x) h input (uint64_to_uint32 pos);
parse_dsum_cases_eq' s f g x (bytes_of_slice_from h input (uint64_to_uint32 pos))
in
validate_dsum_cases'_destr s f f' g' destr x input pos
#push-options "--z3rlimit 40"
inline_for_extraction
let validate_dsum
(#kt: parser_kind)
(t: dsum)
(#p: parser kt (dsum_repr_type t))
(v: validator p)
(p32: leaf_reader p)
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(f32: (x: dsum_known_key t) -> Tot (validator (dsnd (f x))))
(#k': parser_kind)
(#g: parser k' (dsum_type_of_unknown_tag t))
(g32: validator g)
(destr: dep_maybe_enum_destr_t (dsum_enum t) (validate_dsum_cases_t t f g))
: Tot (validator (parse_dsum t p f g))
= fun #rrel #rel input pos ->
let h = HST.get () in
[@inline_let]
let _ = parse_dsum_eq' t p f g (bytes_of_slice_from h input (uint64_to_uint32 pos)) in
[@inline_let]
let _ = valid_facts (parse_dsum t p f g) h input (uint64_to_uint32 pos) in
[@inline_let]
let _ = valid_facts p h input (uint64_to_uint32 pos) in
let pos_after_tag = v input pos in
if is_error pos_after_tag
then pos_after_tag
else
let tg = p32 input (uint64_to_uint32 pos) in
[@inline_let]
let _ = valid_facts (parse_dsum_cases' t f g (maybe_enum_key_of_repr (dsum_enum t) tg)) h input (uint64_to_uint32 pos_after_tag) in
destr (validate_dsum_cases_eq t f g) (validate_dsum_cases_if t f g) (fun _ _ -> ()) (fun _ _ _ _ -> ()) (validate_dsum_cases' t f f32 g32) tg input pos_after_tag
#pop-options
#reset-options "--z3rlimit 64 --z3cliopt smt.arith.nl=false --initial_ifuel 8 --max_ifuel 8 --initial_fuel 2 --max_fuel 2"
let valid_dsum_intro_known
(h: HS.mem)
(t: dsum)
(#kt: parser_kind)
(p: parser kt (dsum_repr_type t))
(f: ((x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x))))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: Lemma
(requires (
valid (parse_maybe_enum_key p (dsum_enum t)) h input pos /\ (
let k' = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
Known? k' /\ (
let Known k = k' in
valid (dsnd (f k)) h input (get_valid_pos (parse_maybe_enum_key p (dsum_enum t)) h input pos)
))))
(ensures (
let Known k = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
let pos_payload = get_valid_pos (parse_maybe_enum_key p (dsum_enum t)) h input pos in
valid_content_pos
(parse_dsum t p f g) h input pos
(synth_dsum_case t (Known k) (contents (dsnd (f k)) h input pos_payload))
(get_valid_pos (dsnd (f k)) h input pos_payload)
))
= valid_facts (parse_maybe_enum_key p (dsum_enum t)) h input pos;
let Known k = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
let pos_payload = get_valid_pos (parse_maybe_enum_key p (dsum_enum t)) h input pos in
valid_facts (dsnd (f k)) h input pos_payload;
valid_facts (parse_dsum t p f g) h input pos;
parse_dsum_eq t p f g (bytes_of_slice_from h input pos)
let valid_dsum_intro_unknown
(h: HS.mem)
(t: dsum)
(#kt: parser_kind)
(p: parser kt (dsum_repr_type t))
(f: ((x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x))))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: Lemma
(requires (
valid (parse_maybe_enum_key p (dsum_enum t)) h input pos /\ (
let k' = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
Unknown? k' /\
valid g h input (get_valid_pos (parse_maybe_enum_key p (dsum_enum t)) h input pos)
)))
(ensures (
let Unknown r = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
let pos_payload = get_valid_pos (parse_maybe_enum_key p (dsum_enum t)) h input pos in
valid_content_pos
(parse_dsum t p f g) h input pos
(synth_dsum_case t (Unknown r) (contents g h input pos_payload))
(get_valid_pos g h input pos_payload)
))
= valid_facts (parse_maybe_enum_key p (dsum_enum t)) h input pos;
let Unknown r = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
let pos_payload = get_valid_pos (parse_maybe_enum_key p (dsum_enum t)) h input pos in
valid_facts g h input pos_payload;
valid_facts (parse_dsum t p f g) h input pos;
parse_dsum_eq t p f g (bytes_of_slice_from h input pos)
#reset-options | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"LowStar.Buffer.fst.checked",
"LowParse.Spec.Sum.fst.checked",
"LowParse.Low.Enum.fst.checked",
"FStar.UInt64.fsti.checked",
"FStar.UInt32.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Int.Cast.fst.checked",
"FStar.HyperStack.ST.fsti.checked",
"FStar.HyperStack.fst.checked",
"FStar.Classical.fsti.checked"
],
"interface_file": false,
"source_file": "LowParse.Low.Sum.fst"
} | [
{
"abbrev": true,
"full_module": "FStar.HyperStack",
"short_module": "HS"
},
{
"abbrev": true,
"full_module": "FStar.UInt64",
"short_module": "U64"
},
{
"abbrev": true,
"full_module": "FStar.Int.Cast",
"short_module": "Cast"
},
{
"abbrev": true,
"full_module": "LowStar.Buffer",
"short_module": "B"
},
{
"abbrev": true,
"full_module": "FStar.HyperStack.ST",
"short_module": "HST"
},
{
"abbrev": true,
"full_module": "FStar.UInt32",
"short_module": "U32"
},
{
"abbrev": false,
"full_module": "LowParse.Spec.Sum",
"short_module": null
},
{
"abbrev": false,
"full_module": "LowParse.Low.Enum",
"short_module": null
},
{
"abbrev": false,
"full_module": "LowParse.Low",
"short_module": null
},
{
"abbrev": false,
"full_module": "LowParse.Low",
"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",
"short_module": null
}
] | {
"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_elim_box": false,
"smtencoding_l_arith_repr": "boxwrap",
"smtencoding_nl_arith_repr": "boxwrap",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": true,
"z3cliopt": [],
"z3refresh": false,
"z3rlimit": 5,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | false |
t: LowParse.Spec.Sum.dsum ->
s: LowParse.Spec.Base.serializer p ->
w: LowParse.Low.Base.leaf_writer_strong s ->
f:
(x: LowParse.Spec.Sum.dsum_known_key t
-> Prims.dtuple2 LowParse.Spec.Base.parser_kind
(fun k -> LowParse.Spec.Base.parser k (LowParse.Spec.Sum.dsum_type_of_known_tag t x))) ->
g: LowParse.Spec.Base.parser ku (LowParse.Spec.Sum.dsum_type_of_unknown_tag t) ->
destr: LowParse.Spec.Enum.enum_repr_of_key'_t (LowParse.Spec.Sum.dsum_enum t) ->
k: LowParse.Spec.Sum.dsum_known_key t ->
input: LowParse.Slice.slice rrel rel ->
pos: FStar.UInt32.t
-> FStar.HyperStack.ST.Stack Prims.unit | FStar.HyperStack.ST.Stack | [] | [] | [
"LowParse.Spec.Sum.dsum",
"LowParse.Spec.Base.parser_kind",
"LowParse.Spec.Base.parser",
"LowParse.Spec.Sum.dsum_repr_type",
"LowParse.Spec.Base.serializer",
"LowParse.Low.Base.leaf_writer_strong",
"LowParse.Spec.Sum.dsum_known_key",
"Prims.dtuple2",
"LowParse.Spec.Sum.dsum_type_of_known_tag",
"LowParse.Spec.Sum.dsum_type_of_unknown_tag",
"LowParse.Spec.Enum.enum_repr_of_key'_t",
"LowParse.Spec.Sum.dsum_key_type",
"LowParse.Spec.Sum.dsum_enum",
"LowParse.Slice.srel",
"LowParse.Bytes.byte",
"LowParse.Slice.slice",
"FStar.UInt32.t",
"Prims.unit",
"LowParse.Low.Sum.valid_dsum_intro_known",
"LowParse.Spec.Enum.parse_maybe_enum_key_eq",
"LowParse.Spec.Enum.parse_enum_key_eq",
"LowParse.Bytes.bytes",
"LowParse.Slice.bytes_of_slice_from",
"LowParse.Low.Base.Spec.valid_facts",
"LowParse.Spec.Enum.maybe_enum_key",
"LowParse.Spec.Enum.parse_maybe_enum_key",
"LowParse.Spec.Combinators.parse_filter_kind",
"LowParse.Spec.Enum.enum_key",
"LowParse.Spec.Enum.parse_enum_key",
"FStar.Monotonic.HyperStack.mem",
"FStar.HyperStack.ST.get",
"LowParse.Low.Enum.write_enum_key",
"Prims.l_and",
"Prims.b2t",
"Prims.op_LessThan",
"Prims.op_Addition",
"FStar.UInt32.v",
"LowParse.Low.Base.Spec.valid",
"Prims.__proj__Mkdtuple2__item___1",
"FStar.Pervasives.dsnd",
"LowParse.Low.Base.writable",
"LowParse.Slice.buffer_srel_of_srel",
"LowParse.Slice.__proj__Mkslice__item__base",
"FStar.UInt32.add",
"FStar.UInt32.uint_to_t",
"Prims.nat",
"LowParse.Low.Base.Spec.serialized_length",
"LowParse.Spec.Enum.serialize_enum_key",
"LowStar.Monotonic.Buffer.modifies",
"LowParse.Slice.loc_slice_from_to",
"LowParse.Low.Base.Spec.valid_content_pos",
"LowParse.Spec.Sum.parse_dsum_kind",
"LowParse.Spec.Sum.dsum_type",
"LowParse.Spec.Sum.parse_dsum",
"LowParse.Spec.Sum.synth_dsum_case",
"LowParse.Spec.Enum.Known",
"LowParse.Low.Base.Spec.contents",
"LowParse.Low.Base.Spec.get_valid_pos"
] | [] | false | true | false | false | false | let finalize_dsum_case_known
(t: dsum)
(#kt: parser_kind)
(#p: parser kt (dsum_repr_type t))
(s: serializer p)
(w: leaf_writer_strong s)
(f: (x: dsum_known_key t -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x))))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
(destr: enum_repr_of_key'_t (dsum_enum t))
(k: dsum_known_key t)
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: HST.Stack unit
(requires
(fun h ->
let len_tag = serialized_length (serialize_enum_key _ s (dsum_enum t)) k in
U32.v pos + len_tag < 4294967296 /\
(let pos_payload = pos `U32.add` (U32.uint_to_t len_tag) in
valid (dsnd (f k)) h input pos_payload /\
writable input.base (U32.v pos) (U32.v pos_payload) h)))
(ensures
(fun h _ h' ->
let len_tag = serialized_length (serialize_enum_key _ s (dsum_enum t)) k in
let pos_payload = pos `U32.add` (U32.uint_to_t len_tag) in
B.modifies (loc_slice_from_to input pos pos_payload) h h' /\
valid_content_pos (parse_dsum t p f g)
h'
input
pos
(synth_dsum_case t (Known k) (contents (dsnd (f k)) h input pos_payload))
(get_valid_pos (dsnd (f k)) h input pos_payload))) =
| let pos1 = write_enum_key w (dsum_enum t) destr k input pos in
let h = HST.get () in
[@@ inline_let ]let _ =
valid_facts (parse_enum_key p (dsum_enum t)) h input pos;
valid_facts (parse_maybe_enum_key p (dsum_enum t)) h input pos;
let sq = bytes_of_slice_from h input pos in
parse_enum_key_eq p (dsum_enum t) sq;
parse_maybe_enum_key_eq p (dsum_enum t) sq;
valid_dsum_intro_known h t p f g input pos
in
() | false |
Vale.Curve25519.Fast_defs.fst | Vale.Curve25519.Fast_defs.pow2_three | val pow2_three (c0 c1 c2: nat) : nat | val pow2_three (c0 c1 c2: nat) : nat | let pow2_three (c0 c1 c2:nat) : nat = pow2_two c0 c1 + pow2_128 * c2 | {
"file_name": "vale/code/crypto/ecc/curve25519/Vale.Curve25519.Fast_defs.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 68,
"end_line": 21,
"start_col": 0,
"start_line": 21
} | module Vale.Curve25519.Fast_defs
open Vale.Def.Words_s
open Vale.Def.Types_s
open FStar.Mul
unfold let pow2_192 = 0x1000000000000000000000000000000000000000000000000
let _ = assert_norm (pow2 192 = pow2_192)
unfold let pow2_256 = 0x10000000000000000000000000000000000000000000000000000000000000000
let _ = assert_norm (pow2 256 = pow2_256)
unfold let pow2_320 = 0x100000000000000000000000000000000000000000000000000000000000000000000000000000000
let _ = assert_norm (pow2 320 = pow2_320)
unfold let pow2_384 = 0x1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000
let _ = assert_norm (pow2 384 = pow2_384)
unfold let pow2_448 = 0x10000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000
let _ = assert_norm (pow2 448 = pow2_448)
unfold let pow2_512 = 0x100000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000
let _ = assert_norm (pow2 512 = pow2_512) | {
"checked_file": "/",
"dependencies": [
"Vale.Def.Words_s.fsti.checked",
"Vale.Def.Types_s.fst.checked",
"Vale.Curve25519.Fast_lemmas_internal.fsti.checked",
"Vale.Arch.Types.fsti.checked",
"prims.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked"
],
"interface_file": false,
"source_file": "Vale.Curve25519.Fast_defs.fst"
} | [
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Def.Types_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Def.Words_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Curve25519",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Curve25519",
"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",
"short_module": null
}
] | {
"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_elim_box": true,
"smtencoding_l_arith_repr": "native",
"smtencoding_nl_arith_repr": "wrapped",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": false,
"z3cliopt": [
"smt.arith.nl=false",
"smt.QI.EAGER_THRESHOLD=100",
"smt.CASE_SPLIT=3"
],
"z3refresh": false,
"z3rlimit": 5,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | false | c0: Prims.nat -> c1: Prims.nat -> c2: Prims.nat -> Prims.nat | Prims.Tot | [
"total"
] | [] | [
"Prims.nat",
"Prims.op_Addition",
"Vale.Curve25519.Fast_defs.pow2_two",
"FStar.Mul.op_Star",
"Vale.Def.Words_s.pow2_128"
] | [] | false | false | false | true | false | let pow2_three (c0 c1 c2: nat) : nat =
| pow2_two c0 c1 + pow2_128 * c2 | false |
LowParse.Low.Sum.fst | LowParse.Low.Sum.clens_dsum_payload | val clens_dsum_payload (s: dsum) (k: dsum_key s) : Tot (clens (dsum_type s) (dsum_type_of_tag s k)) | val clens_dsum_payload (s: dsum) (k: dsum_key s) : Tot (clens (dsum_type s) (dsum_type_of_tag s k)) | let clens_dsum_payload
(s: dsum)
(k: dsum_key s)
: Tot (clens (dsum_type s) (dsum_type_of_tag s k))
= {
clens_cond = (fun (x: dsum_type s) -> dsum_tag_of_data s x == k);
clens_get = (fun (x: dsum_type s) -> synth_dsum_case_recip s k x <: Ghost (dsum_type_of_tag s k) (requires (dsum_tag_of_data s x == k)) (ensures (fun _ -> True)));
} | {
"file_name": "src/lowparse/LowParse.Low.Sum.fst",
"git_rev": "00217c4a89f5ba56002ba9aa5b4a9d5903bfe9fa",
"git_url": "https://github.com/project-everest/everparse.git",
"project_name": "everparse"
} | {
"end_col": 3,
"end_line": 1807,
"start_col": 0,
"start_line": 1800
} | module LowParse.Low.Sum
include LowParse.Low.Enum
include LowParse.Spec.Sum
module U32 = FStar.UInt32
module HST = FStar.HyperStack.ST
module B = LowStar.Buffer
module Cast = FStar.Int.Cast
module U64 = FStar.UInt64
inline_for_extraction
let validate_sum_cases_aux
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(vc: ((x: sum_key t) -> Tot (validator (dsnd (pc x)))))
(k: sum_key t)
: Tot (validator (parse_sum_cases t pc k))
= [@inline_let]
let _ = synth_sum_case_injective t k in
validate_synth
(validate_weaken
(weaken_parse_cases_kind t pc)
(vc k)
()
)
(synth_sum_case t k)
()
inline_for_extraction
let validate_sum_cases_t
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot Type
= validator (parse_sum_cases t pc k)
let validate_sum_cases_t_eq
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
(x y : validate_sum_cases_t t pc k)
: GTot Type0
= True
inline_for_extraction
let validate_sum_cases_t_if
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (if_combinator _ (validate_sum_cases_t_eq t pc k))
= fun cond (sv_true: cond_true cond -> Tot (validate_sum_cases_t t pc k)) (sv_false: cond_false cond -> Tot (validate_sum_cases_t t pc k)) #rrel #rel input pos ->
if cond
then sv_true () input pos
else sv_false () input pos
inline_for_extraction
let validate_sum_cases
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(vc: ((x: sum_key t) -> Tot (validator (dsnd (pc x)))))
(destr: dep_enum_destr (sum_enum t) (validate_sum_cases_t t pc))
(k: sum_key t)
: Tot (validator (parse_sum_cases t pc k))
= destr
_
(validate_sum_cases_t_if t pc)
(fun _ _ -> ())
(fun _ _ _ _ -> ())
(validate_sum_cases_aux t pc vc)
k
inline_for_extraction
let validate_sum_aux_payload_t
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
: Tot Type
= (#rrel: _) -> (#rel: _) ->
(input: slice rrel rel) ->
(pos: U64.t) ->
HST.Stack U64.t
(requires (fun h -> live_slice h input /\ U64.v pos <= U32.v input.len))
(ensures (fun h res h' ->
B.modifies B.loc_none h h' /\ (
match k with
| Unknown _ -> is_error res
| Known k' ->
if is_success res
then
valid_pos (dsnd (pc k')) h input (uint64_to_uint32 pos) (uint64_to_uint32 res)
else
(~ (valid (dsnd (pc k')) h input (uint64_to_uint32 pos)))
)))
let validate_sum_aux_payload_eq
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
: Tot (validate_sum_aux_payload_t t pc k -> validate_sum_aux_payload_t t pc k -> GTot Type0)
= fun _ _ -> True
inline_for_extraction
let validate_sum_aux_payload_if'
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
(cond: bool)
(ift: ((cond_true cond) -> Tot (validate_sum_aux_payload_t t pc k)))
(iff: ((cond_false cond) -> Tot (validate_sum_aux_payload_t t pc k)))
: Tot (validate_sum_aux_payload_t t pc k)
= fun #rrel #rel input pos ->
if cond
then begin
(ift () <: validate_sum_aux_payload_t t pc k) input pos
end else
(iff () <: validate_sum_aux_payload_t t pc k) input pos
inline_for_extraction
let validate_sum_aux_payload_if
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
: Tot (if_combinator _ (validate_sum_aux_payload_eq t pc k))
= validate_sum_aux_payload_if' t pc k
#push-options "--z3rlimit 64 --z3cliopt smt.arith.nl=false --using_facts_from '* -FStar.Int.Cast -LowParse.BitFields'"
// --query_stats --smtencoding.elim_box true --smtencoding.l_arith_repr native --z3refresh"
inline_for_extraction
let validate_sum_aux
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(v: validator p)
(p32: leaf_reader p)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(v_payload: ((k: sum_repr_type t)) -> Tot (validate_sum_aux_payload_t t pc (maybe_enum_key_of_repr (sum_enum t) k)))
: Tot (validator (parse_sum t p pc))
= fun #rrel #rel input pos ->
let h = HST.get () in
[@inline_let]
let _ = parse_sum_eq'' t p pc (bytes_of_slice_from h input (uint64_to_uint32 pos)) in
[@inline_let]
let _ = valid_facts (parse_sum t p pc) h input (uint64_to_uint32 pos) in
[@inline_let]
let _ = valid_facts p h input (uint64_to_uint32 pos) in
let len_after_tag = v input pos in
if is_error len_after_tag
then len_after_tag
else begin
let h1 = HST.get () in
let k' = p32 input (uint64_to_uint32 pos) in
[@inline_let]
let _ =
match maybe_enum_key_of_repr (sum_enum t) k' with
| Known k -> valid_facts (dsnd (pc k)) h input (uint64_to_uint32 len_after_tag)
| _ -> ()
in
v_payload k' input len_after_tag
end
#pop-options
inline_for_extraction
let validate_sum_aux_payload'
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (validator (dsnd (pc x)))))
(k: maybe_enum_key (sum_enum t))
: Tot (validate_sum_aux_payload_t t pc k)
= fun #rrel #rel input pos ->
match k with
| Known k ->
[@inline_let]
let _ = synth_sum_case_injective t k in
pc32 k input pos
// validate_synth (pc32 k) (synth_sum_case t k) () input pos
| _ -> validator_error_generic
inline_for_extraction
let validate_sum_aux_payload
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (validator (dsnd (pc x)))))
(destr: dep_maybe_enum_destr_t (sum_enum t) (validate_sum_aux_payload_t t pc))
(k: sum_repr_type t)
: Tot (validate_sum_aux_payload_t t pc (maybe_enum_key_of_repr (sum_enum t) k))
= destr (validate_sum_aux_payload_eq t pc) (validate_sum_aux_payload_if t pc) (fun _ _ -> ()) (fun _ _ _ _ -> ()) (validate_sum_aux_payload' t pc pc32) k
inline_for_extraction
let validate_sum
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(v: validator p)
(p32: leaf_reader p)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (validator (dsnd (pc x)))))
(destr: dep_maybe_enum_destr_t (sum_enum t) (validate_sum_aux_payload_t t pc))
: Tot (validator (parse_sum t p pc))
= validate_sum_aux t v p32 pc (validate_sum_aux_payload t pc pc32 destr)
module HS = FStar.HyperStack
#push-options "--z3rlimit 256 --z3cliopt smt.arith.nl=false --initial_ifuel 8 --max_ifuel 8 --initial_fuel 2 --max_fuel 2"
#restart-solver
let valid_sum_intro
(h: HS.mem)
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: Lemma
(requires (
valid (parse_enum_key p (sum_enum t)) h input pos /\ (
let k = contents (parse_enum_key p (sum_enum t)) h input pos in
valid (dsnd (pc k)) h input (get_valid_pos (parse_enum_key p (sum_enum t)) h input pos)
)))
(ensures (
let k = contents (parse_enum_key p (sum_enum t)) h input pos in
let pos_payload = get_valid_pos (parse_enum_key p (sum_enum t)) h input pos in
valid_content_pos
(parse_sum t p pc) h input pos
(synth_sum_case t k (contents (dsnd (pc k)) h input pos_payload))
(get_valid_pos (dsnd (pc k)) h input pos_payload)
))
= valid_facts (parse_enum_key p (sum_enum t)) h input pos;
let k = contents (parse_enum_key p (sum_enum t)) h input pos in
let pos_payload = get_valid_pos (parse_enum_key p (sum_enum t)) h input pos in
valid_facts (dsnd (pc k)) h input pos_payload;
valid_facts (parse_sum t p pc) h input pos;
parse_sum_eq t p pc (bytes_of_slice_from h input pos)
#pop-options
inline_for_extraction
let finalize_sum_case
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(s: serializer p)
(w: leaf_writer_strong s)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(destr: enum_repr_of_key'_t (sum_enum t))
(k: sum_key t)
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: HST.Stack unit
(requires (fun h ->
let len_tag = serialized_length (serialize_enum_key _ s (sum_enum t)) k in
U32.v pos + len_tag < 4294967296 /\ (
let pos_payload = pos `U32.add` U32.uint_to_t len_tag in
valid (dsnd (pc k)) h input pos_payload /\
writable input.base (U32.v pos) (U32.v pos_payload) h
)))
(ensures (fun h _ h' ->
let len_tag = serialized_length (serialize_enum_key _ s (sum_enum t)) k in
let pos_payload = pos `U32.add` U32.uint_to_t len_tag in
B.modifies (loc_slice_from_to input pos pos_payload) h h' /\
valid_content_pos (parse_sum t p pc) h' input pos (synth_sum_case t k (contents (dsnd (pc k)) h input pos_payload)) (get_valid_pos (dsnd (pc k)) h input pos_payload)
))
= let pos1 = write_enum_key w (sum_enum t) destr k input pos in
let h = HST.get () in
[@inline_let]
let _ = valid_sum_intro h t p pc input pos in
()
inline_for_extraction
let jump_sum_cases_aux
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(vc: ((x: sum_key t) -> Tot (jumper (dsnd (pc x)))))
(k: sum_key t)
: Tot (jumper (parse_sum_cases t pc k))
= [@inline_let]
let _ = synth_sum_case_injective t k in
jump_synth
(jump_weaken
(weaken_parse_cases_kind t pc)
(vc k)
()
)
(synth_sum_case t k)
()
inline_for_extraction
let jump_sum_cases_t
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot Type
= jumper (parse_sum_cases t pc k)
let jump_sum_cases_t_eq
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
(x y : jump_sum_cases_t t pc k)
: GTot Type0
= True
inline_for_extraction
let jump_sum_cases_t_if
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (if_combinator _ (jump_sum_cases_t_eq t pc k))
= fun cond (sv_true: cond_true cond -> Tot (jump_sum_cases_t t pc k)) (sv_false: cond_false cond -> Tot (jump_sum_cases_t t pc k)) #rrel #rel input pos ->
if cond
then sv_true () input pos
else sv_false () input pos
inline_for_extraction
let jump_sum_cases
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(vc: ((x: sum_key t) -> Tot (jumper (dsnd (pc x)))))
(destr: dep_enum_destr (sum_enum t) (jump_sum_cases_t t pc))
(k: sum_key t)
: Tot (jumper (parse_sum_cases t pc k))
= destr
_
(jump_sum_cases_t_if t pc)
(fun _ _ -> ())
(fun _ _ _ _ -> ())
(jump_sum_cases_aux t pc vc)
k
inline_for_extraction
let jump_sum_aux_payload_t
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
: Tot Type
= (#rrel: _) -> (#rel: _) ->
(input: slice rrel rel) ->
(pos: U32.t) ->
HST.Stack U32.t
(requires (fun h -> live_slice h input /\ U32.v pos <= U32.v input.len /\ (
match k with
| Unknown _ -> False
| Known k' -> valid (dsnd (pc k')) h input pos
)))
(ensures (fun h res h' ->
B.modifies B.loc_none h h' /\ (
match k with
| Unknown _ -> False
| Known k' ->
valid_pos (dsnd (pc k')) h input pos res
)))
let jump_sum_aux_payload_eq
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
: Tot (jump_sum_aux_payload_t t pc k -> jump_sum_aux_payload_t t pc k -> GTot Type0)
= fun _ _ -> True
inline_for_extraction
let jump_sum_aux_payload_if'
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
(cond: bool)
(ift: ((cond_true cond) -> Tot (jump_sum_aux_payload_t t pc k)))
(iff: ((cond_false cond) -> Tot (jump_sum_aux_payload_t t pc k)))
: Tot (jump_sum_aux_payload_t t pc k)
= fun #rrel #rel input pos ->
if cond
then begin
(ift () <: jump_sum_aux_payload_t t pc k) input pos
end else
(iff () <: jump_sum_aux_payload_t t pc k) input pos
inline_for_extraction
let jump_sum_aux_payload_if
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
: Tot (if_combinator _ (jump_sum_aux_payload_eq t pc k))
= jump_sum_aux_payload_if' t pc k
let parse_sum_eq3
(#kt: parser_kind)
(t: sum)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(input: bytes)
(k' : sum_repr_type t)
(consumed_k: consumed_length input)
: Lemma
(requires (Some? (parse (parse_sum t p pc) input) /\ parse p input == Some (k', consumed_k)))
(ensures (
let input_k = Seq.slice input consumed_k (Seq.length input) in
let k = maybe_enum_key_of_repr (sum_enum t) k' in
begin match k with
| Known k ->
Some? (parse (dsnd (pc k)) input_k)
| _ -> False
end
))
= parse_sum_eq'' t p pc input
let parse_sum_eq4
(#kt: parser_kind)
(t: sum)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(input: bytes)
(k' : sum_repr_type t)
(consumed_k: consumed_length input)
(consumed_payload: nat)
: Lemma
(requires (Some? (parse (parse_sum t p pc) input) /\ parse p input == Some (k', consumed_k) /\ (
let input_k = Seq.slice input consumed_k (Seq.length input) in
let k = maybe_enum_key_of_repr (sum_enum t) k' in
begin match k with
| Known k ->
Some? (parse (dsnd (pc k)) input_k) /\ (
let Some (_, consumed_payload') = parse (dsnd (pc k)) input_k in
consumed_payload' == consumed_payload
)
| _ -> False
end
)))
(ensures (
let Some (_, consumed) = parse (parse_sum t p pc) input in
consumed == consumed_k + consumed_payload
))
= parse_sum_eq'' t p pc input
#push-options "--z3rlimit 16"
let valid_sum_elim
(h: HS.mem)
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(#rrel: _) (#rel: _)
(input: slice rrel rel)
(pos: U32.t)
: Lemma
(requires (
valid (parse_sum t p pc) h input pos
))
(ensures (
valid p h input pos /\ (
let pos_payload = get_valid_pos p h input pos in
let k' = maybe_enum_key_of_repr (sum_enum t) (contents p h input pos) in
match k' with
| Known k ->
k == sum_tag_of_data t (contents (parse_sum t p pc) h input pos) /\
valid (dsnd (pc k)) h input pos_payload /\
valid_pos
(parse_sum t p pc) h input pos
(get_valid_pos (dsnd (pc k)) h input pos_payload)
| _ -> False
)))
= let sinput = bytes_of_slice_from h input pos in
let _ = parse_sum_eq'' t p pc sinput in
[@inline_let]
let _ = valid_facts (parse_sum t p pc) h input pos in
let Some (k', consumed_k) = parse p sinput in
let pos_after_tag = U32.uint_to_t (U32.v pos + consumed_k) in
[@inline_let]
let _ = valid_facts p h input pos in
assert (valid_content_pos p h input pos k' pos_after_tag);
match maybe_enum_key_of_repr (sum_enum t) k' with
| Known k -> valid_facts (dsnd (pc k)) h input pos_after_tag
| _ -> ()
#pop-options
let valid_sum_elim_tag
(h: HS.mem)
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: Lemma
(requires (
valid (parse_sum t p pc) h input pos
))
(ensures (
valid (parse_enum_key p (sum_enum t)) h input pos /\
contents (parse_enum_key p (sum_enum t)) h input pos == sum_tag_of_data t (contents (parse_sum t p pc) h input pos)
))
= let _ = parse_sum_eq' t p pc (bytes_of_slice_from h input pos) in
let _ = valid_facts (parse_sum t p pc) h input pos in
let _ = valid_facts (parse_enum_key p (sum_enum t)) h input pos in
()
inline_for_extraction
let read_sum_tag
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(p32: leaf_reader p)
(destr: dep_maybe_enum_destr_t (sum_enum t) (read_enum_key_t (sum_enum t)))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: HST.Stack (sum_key t)
(requires (fun h ->
valid (parse_sum t p pc) h input pos
))
(ensures (fun h res h' ->
B.modifies B.loc_none h h' /\
res == sum_tag_of_data t (contents (parse_sum t p pc) h input pos)
))
= let h = HST.get () in
[@inline_let] let _ = valid_sum_elim_tag h t p pc input pos in
read_enum_key p32 (sum_enum t) destr input pos
inline_for_extraction
let jump_sum_aux
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(v: jumper p)
(p32: leaf_reader p)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(v_payload: ((k: sum_repr_type t)) -> Tot (jump_sum_aux_payload_t t pc (maybe_enum_key_of_repr (sum_enum t) k)))
: Tot (jumper (parse_sum t p pc))
= fun #rrel #rel input pos ->
let h = HST.get () in
[@inline_let]
let _ = valid_sum_elim h t p pc input pos in
let pos_after_tag = v input pos in
let k' = p32 input pos in
v_payload k' input pos_after_tag
inline_for_extraction
let jump_sum_aux_payload'
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (jumper (dsnd (pc x)))))
(k: maybe_enum_key (sum_enum t))
: Tot (jump_sum_aux_payload_t t pc k)
= fun #rrel #rel input pos ->
match k with
| Known k ->
[@inline_let]
let _ = synth_sum_case_injective t k in
pc32 k input pos
| _ -> 0ul // dummy, but we MUST NOT remove this branch, otherwise extraction fails
inline_for_extraction
let jump_sum_aux_payload
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (jumper (dsnd (pc x)))))
(destr: dep_maybe_enum_destr_t (sum_enum t) (jump_sum_aux_payload_t t pc))
(k: sum_repr_type t)
: Tot (jump_sum_aux_payload_t t pc (maybe_enum_key_of_repr (sum_enum t) k))
= destr (jump_sum_aux_payload_eq t pc) (jump_sum_aux_payload_if t pc) (fun _ _ -> ()) (fun _ _ _ _ -> ()) (jump_sum_aux_payload' t pc pc32) k
inline_for_extraction
let jump_sum
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(v: jumper p)
(p32: leaf_reader p)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (jumper (dsnd (pc x)))))
(destr: dep_maybe_enum_destr_t (sum_enum t) (jump_sum_aux_payload_t t pc))
: Tot (jumper (parse_sum t p pc))
= jump_sum_aux t v p32 pc (jump_sum_aux_payload t pc pc32 destr)
inline_for_extraction
let read_sum_cases'
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (leaf_reader (dsnd (pc x)))))
(k: sum_key t)
: Tot (leaf_reader (parse_sum_cases' t pc k))
= [@inline_let]
let _ = synth_sum_case_injective t k in
read_synth'
(dsnd (pc k))
(synth_sum_case t k)
(pc32 k)
()
inline_for_extraction
let read_sum_cases_t
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot Type
= leaf_reader (parse_sum_cases' t pc k)
let read_sum_cases_t_eq
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
(x y : read_sum_cases_t t pc k)
: GTot Type0
= True
inline_for_extraction
let read_sum_cases_t_if
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (if_combinator _ (read_sum_cases_t_eq t pc k))
= fun cond (sv_true: cond_true cond -> Tot (read_sum_cases_t t pc k)) (sv_false: cond_false cond -> Tot (read_sum_cases_t t pc k)) #_ #_ input pos ->
if cond
then (sv_true () input pos)
else (sv_false () input pos)
inline_for_extraction
let read_sum_cases
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (leaf_reader (dsnd (pc x)))))
(destr: dep_enum_destr (sum_enum t) (read_sum_cases_t t pc))
(k: sum_key t)
: Tot (leaf_reader (parse_sum_cases' t pc k))
= destr
_
(read_sum_cases_t_if t pc)
(fun _ _ -> ())
(fun _ _ _ _ -> ())
(read_sum_cases' t pc pc32)
k
#push-options "--z3rlimit 32"
inline_for_extraction
let read_sum
(#kt: parser_kind)
(t: sum)
(p: parser kt (sum_repr_type t))
(p32: leaf_reader (parse_enum_key p (sum_enum t)))
(j: jumper p)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (leaf_reader (dsnd (pc x)))))
(destr: dep_enum_destr (sum_enum t) (read_sum_cases_t t pc))
: Tot (leaf_reader (parse_sum t p pc))
=
fun #_ #_ input pos ->
let h = HST.get () in
valid_facts (parse_sum t p pc) h input pos;
parse_sum_eq' t p pc (bytes_of_slice_from h input pos);
valid_facts (parse_enum_key p (sum_enum t)) h input pos;
let k = p32 input pos in
let pos' = jump_enum_key j (sum_enum t) input pos in
valid_facts (parse_sum_cases' t pc k) h input pos' ;
read_sum_cases t pc pc32 destr k input pos'
#pop-options
inline_for_extraction
let serialize32_sum_cases_t
(t: sum)
(#pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(sc: ((x: sum_key t) -> Tot (serializer (dsnd (pc x)))))
(k: sum_key t)
: Tot Type
= serializer32 (serialize_sum_cases t pc sc k)
let serialize32_sum_cases_t_eq
(t: sum)
(#pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(sc: ((x: sum_key t) -> Tot (serializer (dsnd (pc x)))))
(k: sum_key t)
(x y: serialize32_sum_cases_t t sc k)
: GTot Type0
= True
inline_for_extraction
let serialize32_sum_cases_t_if
(t: sum)
(#pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(sc: ((x: sum_key t) -> Tot (serializer (dsnd (pc x)))))
(k: sum_key t)
: Tot (if_combinator _ (serialize32_sum_cases_t_eq t sc k))
= fun cond (sv_true: (cond_true cond -> Tot (serialize32_sum_cases_t t sc k))) (sv_false: (cond_false cond -> Tot (serialize32_sum_cases_t t sc k))) x #rrel #rel b pos ->
if cond
then (sv_true () x b pos)
else (sv_false () x b pos)
inline_for_extraction
let serialize32_sum_cases_aux
(t: sum)
(#pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(sc: ((x: sum_key t) -> Tot (serializer (dsnd (pc x)))))
(sc32: ((x: sum_key t) -> Tot (serializer32 (sc x))))
(k: sum_key t)
: Tot (serializer32 (serialize_sum_cases t pc sc k))
= fun x #rrel #rel b pos ->
[@inline_let] let _ =
Classical.forall_intro (parse_sum_cases_eq' t pc k);
synth_sum_case_injective t k;
synth_sum_case_inverse t k
in
serialize32_synth
(sc32 k)
(synth_sum_case t k)
(synth_sum_case_recip t k)
(fun x -> synth_sum_case_recip t k x)
()
x
b
pos
inline_for_extraction
let serialize32_sum_cases
(t: sum)
(#pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(sc: ((x: sum_key t) -> Tot (serializer (dsnd (pc x)))))
(sc32: ((x: sum_key t) -> Tot (serializer32 (sc x))))
(destr: dep_enum_destr (sum_enum t) (serialize32_sum_cases_t t sc))
(k: sum_key t)
: Tot (serializer32 (serialize_sum_cases t pc sc k))
= destr
_
(serialize32_sum_cases_t_if t sc)
(fun _ _ -> ())
(fun _ _ _ _ -> ())
(serialize32_sum_cases_aux t sc sc32)
k
inline_for_extraction
let serialize32_sum
(#kt: parser_kind)
(t: sum)
(#p: parser kt (sum_repr_type t))
(s: serializer p {kt.parser_kind_subkind == Some ParserStrong})
(s32: serializer32 (serialize_enum_key _ s (sum_enum t)))
(#pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(sc: ((x: sum_key t) -> Tot (serializer (dsnd (pc x)))))
(sc32: ((x: sum_key t) -> Tot (serializer32 (sc x))))
(destr: dep_enum_destr (sum_enum t) (serialize32_sum_cases_t t sc))
: Tot (serializer32 (serialize_sum t s sc))
= fun x #rrel #rel b pos ->
serialize_sum_eq t s sc x;
let tg = sum_tag_of_data t x in
serialize32_nondep_then_aux s32 (serialize32_sum_cases t sc sc32 destr tg) tg x b pos
let clens_sum_tag
(s: sum)
: Tot (clens (sum_type s) (sum_key s))
= {
clens_cond = (fun _ -> True);
clens_get = sum_tag_of_data s;
}
let gaccessor_sum_tag
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
: Tot (gaccessor (parse_sum t p pc) (parse_enum_key p (sum_enum t)) (clens_sum_tag t))
= gaccessor_tagged_union_tag
(parse_enum_key p (sum_enum t))
(sum_tag_of_data t)
(parse_sum_cases t pc)
inline_for_extraction
let accessor_sum_tag
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
: Tot (accessor (gaccessor_sum_tag t p pc))
= accessor_tagged_union_tag
(parse_enum_key p (sum_enum t))
(sum_tag_of_data t)
(parse_sum_cases t pc)
let clens_sum_payload
(s: sum)
(k: sum_key s)
: Tot (clens (sum_type s) (sum_type_of_tag s k))
= {
clens_cond = (fun (x: sum_type s) -> sum_tag_of_data s x == k);
clens_get = (fun (x: sum_type s) -> synth_sum_case_recip s k x <: Ghost (sum_type_of_tag s k) (requires (sum_tag_of_data s x == k)) (ensures (fun _ -> True)));
}
#push-options "--z3rlimit 32"
let gaccessor_clens_sum_payload'
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (gaccessor' (parse_sum t p pc) (dsnd (pc k)) (clens_sum_payload t k))
= fun (input: bytes) ->
parse_sum_eq'' t p pc input;
let res =
match parse p input with
| Some (_, consumed) ->
synth_sum_case_inverse t k;
synth_sum_case_injective t k;
synth_injective_synth_inverse_synth_inverse_recip (synth_sum_case t k) (synth_sum_case_recip t k) ();
(consumed)
| _ -> 0 // dummy
in
(res <: (res: _ { gaccessor_post' (parse_sum t p pc) (dsnd (pc k)) (clens_sum_payload t k) input res } ))
#push-options "--z3rlimit 64"
let gaccessor_clens_sum_payload_injective
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
(sl sl' : bytes)
: Lemma
(requires (
gaccessor_pre (parse_sum t p pc) (dsnd (pc k)) (clens_sum_payload t k) sl /\
gaccessor_pre (parse_sum t p pc) (dsnd (pc k)) (clens_sum_payload t k) sl' /\
injective_precond (parse_sum t p pc) sl sl'
))
(ensures (gaccessor_clens_sum_payload' t p pc k sl == gaccessor_clens_sum_payload' t p pc k sl'))
= parse_sum_eq'' t p pc sl;
parse_sum_eq'' t p pc sl' ;
parse_injective (parse_sum t p pc) sl sl' ;
parse_injective p sl sl'
#pop-options
let gaccessor_clens_sum_payload_no_lookahead
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
(sl sl' : bytes)
: Lemma
(requires (
(parse_sum_kind kt t pc).parser_kind_subkind == Some ParserStrong /\
gaccessor_pre (parse_sum t p pc) (dsnd (pc k)) (clens_sum_payload t k) sl /\
gaccessor_pre (parse_sum t p pc) (dsnd (pc k)) (clens_sum_payload t k) sl' /\
no_lookahead_on_precond (parse_sum t p pc) sl sl'
))
(ensures (gaccessor_clens_sum_payload' t p pc k sl == gaccessor_clens_sum_payload' t p pc k sl'))
= parse_sum_eq'' t p pc sl;
parse_sum_eq'' t p pc sl' ;
parse_strong_prefix (parse_sum t p pc) sl sl' ;
parse_injective p sl sl'
let gaccessor_clens_sum_payload
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (gaccessor (parse_sum t p pc) (dsnd (pc k)) (clens_sum_payload t k))
= Classical.forall_intro_2 (fun x -> Classical.move_requires (gaccessor_clens_sum_payload_injective t p pc k x));
Classical.forall_intro_2 (fun x -> Classical.move_requires (gaccessor_clens_sum_payload_no_lookahead t p pc k x));
gaccessor_prop_equiv (parse_sum t p pc) (dsnd (pc k)) (clens_sum_payload t k) (gaccessor_clens_sum_payload' t p pc k);
gaccessor_clens_sum_payload' t p pc k
inline_for_extraction
let accessor_clens_sum_payload'
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(j: jumper p)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: HST.Stack U32.t
(requires (fun h ->
valid (parse_sum t p pc) h input pos /\
(clens_sum_payload t k).clens_cond (contents (parse_sum t p pc) h input pos)
))
(ensures (fun h pos' h' ->
B.modifies B.loc_none h h' /\
pos' == slice_access h (gaccessor_clens_sum_payload t p pc k) input pos
))
=
let h = HST.get () in
[@inline_let]
let _ =
let pos' = get_valid_pos (parse_sum t p pc) h input pos in
let large = bytes_of_slice_from h input pos in
slice_access_eq h (gaccessor_clens_sum_payload t p pc k) input pos;
valid_facts (parse_sum t p pc) h input pos;
parse_sum_eq'' t p pc large;
valid_facts p h input pos
in
j input pos
#pop-options
inline_for_extraction
let accessor_clens_sum_payload
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(j: jumper p)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (accessor (gaccessor_clens_sum_payload t p pc k))
= fun #rrel #rel -> accessor_clens_sum_payload' t j pc k #rrel #rel
let clens_sum_cases_payload
(s: sum)
(k: sum_key s)
: Tot (clens (sum_cases s k) (sum_type_of_tag s k))
= {
clens_cond = (fun (x: sum_cases s k) -> True);
clens_get = (fun (x: sum_cases s k) -> synth_sum_case_recip s k x <: Ghost (sum_type_of_tag s k) (requires (True)) (ensures (fun _ -> True)));
}
let gaccessor_clens_sum_cases_payload
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (gaccessor (parse_sum_cases' t pc k) (dsnd (pc k)) (clens_sum_cases_payload t k))
= synth_sum_case_injective t k;
synth_sum_case_inverse t k;
synth_injective_synth_inverse_synth_inverse_recip (synth_sum_case t k) (synth_sum_case_recip t k) ();
gaccessor_ext
(gaccessor_synth (dsnd (pc k)) (synth_sum_case t k) (synth_sum_case_recip t k) ())
(clens_sum_cases_payload t k)
()
inline_for_extraction
let accessor_clens_sum_cases_payload
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (accessor (gaccessor_clens_sum_cases_payload t pc k))
= [@inline_let]
let _ =
synth_sum_case_injective t k;
synth_sum_case_inverse t k;
synth_injective_synth_inverse_synth_inverse_recip (synth_sum_case t k) (synth_sum_case_recip t k) ()
in
accessor_ext
(accessor_synth (dsnd (pc k)) (synth_sum_case t k) (synth_sum_case_recip t k) ())
(clens_sum_cases_payload t k)
()
inline_for_extraction
let validate_dsum_cases_t
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(#k: parser_kind)
(g: parser k (dsum_type_of_unknown_tag s))
(x: dsum_key s)
: Tot Type
= validator (parse_dsum_cases' s f g x)
let validate_dsum_cases_eq
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(#k: parser_kind)
(g: parser k (dsum_type_of_unknown_tag s))
(x: dsum_key s)
(v1 v2 : validate_dsum_cases_t s f g x)
: GTot Type0
= True
inline_for_extraction
let validate_dsum_cases_if'
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(#k: parser_kind)
(g: parser k (dsum_type_of_unknown_tag s))
(x: dsum_key s)
(cond: bool)
(ift: (cond_true cond -> Tot (validate_dsum_cases_t s f g x)))
(iff: (cond_false cond -> Tot (validate_dsum_cases_t s f g x)))
: Tot (validate_dsum_cases_t s f g x)
= fun #rrel #rel input len ->
if cond
then (ift () <: validate_dsum_cases_t s f g x) input len
else (iff () <: validate_dsum_cases_t s f g x) input len
inline_for_extraction
let validate_dsum_cases_if
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(#k: parser_kind)
(g: parser k (dsum_type_of_unknown_tag s))
(x: dsum_key s)
: Tot (if_combinator _ (validate_dsum_cases_eq s f g x))
= validate_dsum_cases_if' s f g x
inline_for_extraction
let validate_dsum_cases'
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(f' : (x: dsum_known_key s) -> Tot (validator (dsnd (f x))))
(#k: parser_kind)
(#g: parser k (dsum_type_of_unknown_tag s))
(g' : validator g)
(x: dsum_key s)
: Tot (validate_dsum_cases_t s f g x)
= [@inline_let]
let _ = synth_dsum_case_injective s x in
match x with
| Known x' -> validate_synth (f' x') (synth_dsum_case s (Known x')) () <: validator (parse_dsum_cases' s f g x)
| Unknown x' -> validate_synth g' (synth_dsum_case s (Unknown x')) () <: validator (parse_dsum_cases' s f g x)
inline_for_extraction
let validate_dsum_cases'_destr
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(f' : (x: dsum_known_key s) -> Tot (validator (dsnd (f x))))
(#k: parser_kind)
(#g: parser k (dsum_type_of_unknown_tag s))
(g' : validator g)
(destr: dep_enum_destr _ (fun k -> validate_dsum_cases_t s f g (Known k)))
(x: dsum_key s)
: Tot (validate_dsum_cases_t s f g x)
= fun #rrel #rel input pos ->
match x with
| Known k ->
destr
_
(fun k -> validate_dsum_cases_if s f g (Known k))
(fun _ _ -> ())
(fun _ _ _ _ -> ())
(fun k -> validate_dsum_cases' s f f' g' (Known k))
k
input
pos
| Unknown r -> validate_dsum_cases' s f f' g' (Unknown r) input pos
inline_for_extraction
let validate_dsum_cases
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(f' : (x: dsum_known_key s) -> Tot (validator (dsnd (f x))))
(#k: parser_kind)
(#g: parser k (dsum_type_of_unknown_tag s))
(g' : validator g)
(destr: dep_enum_destr _ (fun k -> validate_dsum_cases_t s f g (Known k)))
(x: dsum_key s)
: Tot (validator (parse_dsum_cases s f g x))
= fun #rrel #rel input pos ->
let h = HST.get () in
[@inline_let]
let _ =
valid_facts (parse_dsum_cases' s f g x) h input (uint64_to_uint32 pos);
valid_facts (parse_dsum_cases s f g x) h input (uint64_to_uint32 pos);
parse_dsum_cases_eq' s f g x (bytes_of_slice_from h input (uint64_to_uint32 pos))
in
validate_dsum_cases'_destr s f f' g' destr x input pos
#push-options "--z3rlimit 40"
inline_for_extraction
let validate_dsum
(#kt: parser_kind)
(t: dsum)
(#p: parser kt (dsum_repr_type t))
(v: validator p)
(p32: leaf_reader p)
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(f32: (x: dsum_known_key t) -> Tot (validator (dsnd (f x))))
(#k': parser_kind)
(#g: parser k' (dsum_type_of_unknown_tag t))
(g32: validator g)
(destr: dep_maybe_enum_destr_t (dsum_enum t) (validate_dsum_cases_t t f g))
: Tot (validator (parse_dsum t p f g))
= fun #rrel #rel input pos ->
let h = HST.get () in
[@inline_let]
let _ = parse_dsum_eq' t p f g (bytes_of_slice_from h input (uint64_to_uint32 pos)) in
[@inline_let]
let _ = valid_facts (parse_dsum t p f g) h input (uint64_to_uint32 pos) in
[@inline_let]
let _ = valid_facts p h input (uint64_to_uint32 pos) in
let pos_after_tag = v input pos in
if is_error pos_after_tag
then pos_after_tag
else
let tg = p32 input (uint64_to_uint32 pos) in
[@inline_let]
let _ = valid_facts (parse_dsum_cases' t f g (maybe_enum_key_of_repr (dsum_enum t) tg)) h input (uint64_to_uint32 pos_after_tag) in
destr (validate_dsum_cases_eq t f g) (validate_dsum_cases_if t f g) (fun _ _ -> ()) (fun _ _ _ _ -> ()) (validate_dsum_cases' t f f32 g32) tg input pos_after_tag
#pop-options
#reset-options "--z3rlimit 64 --z3cliopt smt.arith.nl=false --initial_ifuel 8 --max_ifuel 8 --initial_fuel 2 --max_fuel 2"
let valid_dsum_intro_known
(h: HS.mem)
(t: dsum)
(#kt: parser_kind)
(p: parser kt (dsum_repr_type t))
(f: ((x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x))))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: Lemma
(requires (
valid (parse_maybe_enum_key p (dsum_enum t)) h input pos /\ (
let k' = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
Known? k' /\ (
let Known k = k' in
valid (dsnd (f k)) h input (get_valid_pos (parse_maybe_enum_key p (dsum_enum t)) h input pos)
))))
(ensures (
let Known k = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
let pos_payload = get_valid_pos (parse_maybe_enum_key p (dsum_enum t)) h input pos in
valid_content_pos
(parse_dsum t p f g) h input pos
(synth_dsum_case t (Known k) (contents (dsnd (f k)) h input pos_payload))
(get_valid_pos (dsnd (f k)) h input pos_payload)
))
= valid_facts (parse_maybe_enum_key p (dsum_enum t)) h input pos;
let Known k = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
let pos_payload = get_valid_pos (parse_maybe_enum_key p (dsum_enum t)) h input pos in
valid_facts (dsnd (f k)) h input pos_payload;
valid_facts (parse_dsum t p f g) h input pos;
parse_dsum_eq t p f g (bytes_of_slice_from h input pos)
let valid_dsum_intro_unknown
(h: HS.mem)
(t: dsum)
(#kt: parser_kind)
(p: parser kt (dsum_repr_type t))
(f: ((x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x))))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: Lemma
(requires (
valid (parse_maybe_enum_key p (dsum_enum t)) h input pos /\ (
let k' = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
Unknown? k' /\
valid g h input (get_valid_pos (parse_maybe_enum_key p (dsum_enum t)) h input pos)
)))
(ensures (
let Unknown r = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
let pos_payload = get_valid_pos (parse_maybe_enum_key p (dsum_enum t)) h input pos in
valid_content_pos
(parse_dsum t p f g) h input pos
(synth_dsum_case t (Unknown r) (contents g h input pos_payload))
(get_valid_pos g h input pos_payload)
))
= valid_facts (parse_maybe_enum_key p (dsum_enum t)) h input pos;
let Unknown r = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
let pos_payload = get_valid_pos (parse_maybe_enum_key p (dsum_enum t)) h input pos in
valid_facts g h input pos_payload;
valid_facts (parse_dsum t p f g) h input pos;
parse_dsum_eq t p f g (bytes_of_slice_from h input pos)
#reset-options
inline_for_extraction
let finalize_dsum_case_known
(t: dsum)
(#kt: parser_kind)
(#p: parser kt (dsum_repr_type t))
(s: serializer p)
(w: leaf_writer_strong s)
(f: ((x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x))))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
(destr: enum_repr_of_key'_t (dsum_enum t))
(k: dsum_known_key t)
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: HST.Stack unit
(requires (fun h ->
let len_tag = serialized_length (serialize_enum_key _ s (dsum_enum t)) k in
U32.v pos + len_tag < 4294967296 /\ (
let pos_payload = pos `U32.add` U32.uint_to_t len_tag in
valid (dsnd (f k)) h input pos_payload /\
writable input.base (U32.v pos) (U32.v pos_payload) h
)))
(ensures (fun h _ h' ->
let len_tag = serialized_length (serialize_enum_key _ s (dsum_enum t)) k in
let pos_payload = pos `U32.add` U32.uint_to_t len_tag in
B.modifies (loc_slice_from_to input pos pos_payload) h h' /\
valid_content_pos (parse_dsum t p f g) h' input pos (synth_dsum_case t (Known k) (contents (dsnd (f k)) h input pos_payload)) (get_valid_pos (dsnd (f k)) h input pos_payload)
))
= let pos1 = write_enum_key w (dsum_enum t) destr k input pos in
let h = HST.get () in
[@inline_let]
let _ =
valid_facts (parse_enum_key p (dsum_enum t)) h input pos;
valid_facts (parse_maybe_enum_key p (dsum_enum t)) h input pos;
let sq = bytes_of_slice_from h input pos in
parse_enum_key_eq p (dsum_enum t) sq;
parse_maybe_enum_key_eq p (dsum_enum t) sq;
valid_dsum_intro_known h t p f g input pos
in
()
inline_for_extraction
let finalize_dsum_case_unknown
(t: dsum)
(#kt: parser_kind)
(#p: parser kt (dsum_repr_type t))
(s: serializer p)
(w: leaf_writer_strong s)
(f: ((x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x))))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
(r: unknown_enum_repr (dsum_enum t))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: HST.Stack unit
(requires (fun h ->
let len_tag = serialized_length s r in
U32.v pos + len_tag < 4294967296 /\ (
let pos_payload = pos `U32.add` U32.uint_to_t len_tag in
valid g h input pos_payload /\
writable input.base (U32.v pos) (U32.v pos_payload) h
)))
(ensures (fun h _ h' ->
let len_tag = serialized_length s r in
let pos_payload = pos `U32.add` U32.uint_to_t len_tag in
B.modifies (loc_slice_from_to input pos pos_payload) h h' /\
valid_content_pos (parse_dsum t p f g) h' input pos (synth_dsum_case t (Unknown r) (contents g h input pos_payload)) (get_valid_pos g h input pos_payload)
))
= let pos1 = w r input pos in
let h = HST.get () in
[@inline_let]
let _ =
valid_facts (parse_maybe_enum_key p (dsum_enum t)) h input pos;
valid_facts p h input pos;
let sq = bytes_of_slice_from h input pos in
parse_maybe_enum_key_eq p (dsum_enum t) sq;
valid_dsum_intro_unknown h t p f g input pos
in
()
let valid_dsum_elim_tag
(h: HS.mem)
(t: dsum)
(#kt: parser_kind)
(p: parser kt (dsum_repr_type t))
(f: ((x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x))))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: Lemma
(requires (
valid (parse_dsum t p f g) h input pos
))
(ensures (
valid (parse_maybe_enum_key p (dsum_enum t)) h input pos /\
contents (parse_maybe_enum_key p (dsum_enum t)) h input pos == dsum_tag_of_data t (contents (parse_dsum t p f g) h input pos)
))
= let _ = parse_dsum_eq_ t p f g (bytes_of_slice_from h input pos) in
let _ = valid_facts (parse_dsum t p f g) h input pos in
let _ = valid_facts (parse_maybe_enum_key p (dsum_enum t)) h input pos in
()
inline_for_extraction
let read_dsum_tag
(t: dsum)
(#kt: parser_kind)
(#p: parser kt (dsum_repr_type t))
(p32: leaf_reader p)
(destr: maybe_enum_destr_t (maybe_enum_key (dsum_enum t)) (dsum_enum t))
(f: ((x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x))))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: HST.Stack (dsum_key t)
(requires (fun h ->
valid (parse_dsum t p f g) h input pos
))
(ensures (fun h res h' ->
B.modifies B.loc_none h h' /\
res == dsum_tag_of_data t (contents (parse_dsum t p f g) h input pos)
))
= let h = HST.get () in
[@inline_let] let _ = valid_dsum_elim_tag h t p f g input pos in
read_maybe_enum_key p32 (dsum_enum t) destr input pos
#push-options "--z3rlimit 32"
let valid_dsum_elim_known
(h: HS.mem)
(t: dsum)
(#kt: parser_kind)
(p: parser kt (dsum_repr_type t))
(f: ((x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x))))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: Lemma
(requires (
valid (parse_dsum t p f g) h input pos /\
Known? (dsum_tag_of_data t (contents (parse_dsum t p f g) h input pos))
))
(ensures (
valid (parse_maybe_enum_key p (dsum_enum t)) h input pos /\ (
let k' = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
let pos_payload = get_valid_pos (parse_maybe_enum_key p (dsum_enum t)) h input pos in
Known? k' /\ (
let Known k = k' in
valid (dsnd (f k)) h input pos_payload /\
valid_content_pos
(parse_dsum t p f g) h input pos
(synth_dsum_case t (Known k) (contents (dsnd (f k)) h input pos_payload))
(get_valid_pos (dsnd (f k)) h input pos_payload)
))))
=
valid_facts (parse_dsum t p f g) h input pos;
parse_dsum_eq t p f g (bytes_of_slice_from h input pos);
valid_facts (parse_maybe_enum_key p (dsum_enum t)) h input pos;
let Known k = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
let pos_payload = get_valid_pos (parse_maybe_enum_key p (dsum_enum t)) h input pos in
valid_facts (dsnd (f k)) h input pos_payload
#pop-options
let valid_dsum_elim_unknown
(h: HS.mem)
(t: dsum)
(#kt: parser_kind)
(p: parser kt (dsum_repr_type t))
(f: ((x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x))))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: Lemma
(requires (
valid (parse_dsum t p f g) h input pos /\
Unknown? (dsum_tag_of_data t (contents (parse_dsum t p f g) h input pos))
))
(ensures (
valid (parse_maybe_enum_key p (dsum_enum t)) h input pos /\ (
let k' = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
let pos_payload = get_valid_pos (parse_maybe_enum_key p (dsum_enum t)) h input pos in
Unknown? k' /\ (
let Unknown r = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
valid g h input pos_payload /\
valid_content_pos
(parse_dsum t p f g) h input pos
(synth_dsum_case t (Unknown r) (contents g h input pos_payload))
(get_valid_pos g h input pos_payload)
))))
=
valid_facts (parse_dsum t p f g) h input pos;
parse_dsum_eq t p f g (bytes_of_slice_from h input pos);
valid_facts (parse_maybe_enum_key p (dsum_enum t)) h input pos;
let Unknown r = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
let pos_payload = get_valid_pos (parse_maybe_enum_key p (dsum_enum t)) h input pos in
valid_facts g h input pos_payload
inline_for_extraction
let jump_dsum_cases_t
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(#k: parser_kind)
(g: parser k (dsum_type_of_unknown_tag s))
(x: dsum_key s)
: Tot Type
= jumper (parse_dsum_cases' s f g x)
let jump_dsum_cases_eq
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(#k: parser_kind)
(g: parser k (dsum_type_of_unknown_tag s))
(x: dsum_key s)
(v1 v2 : jump_dsum_cases_t s f g x)
: GTot Type0
= True
inline_for_extraction
let jump_dsum_cases_if'
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(#k: parser_kind)
(g: parser k (dsum_type_of_unknown_tag s))
(x: dsum_key s)
(cond: bool)
(ift: (cond_true cond -> Tot (jump_dsum_cases_t s f g x)))
(iff: (cond_false cond -> Tot (jump_dsum_cases_t s f g x)))
: Tot (jump_dsum_cases_t s f g x)
= fun #rrel #rel input len ->
if cond
then (ift () <: jump_dsum_cases_t s f g x) input len
else (iff () <: jump_dsum_cases_t s f g x) input len
inline_for_extraction
let jump_dsum_cases_if
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(#k: parser_kind)
(g: parser k (dsum_type_of_unknown_tag s))
(x: dsum_key s)
: Tot (if_combinator _ (jump_dsum_cases_eq s f g x))
= jump_dsum_cases_if' s f g x
inline_for_extraction
let jump_dsum_cases'
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(f' : (x: dsum_known_key s) -> Tot (jumper (dsnd (f x))))
(#k: parser_kind)
(#g: parser k (dsum_type_of_unknown_tag s))
(g' : jumper g)
(x: dsum_key s)
: Tot (jump_dsum_cases_t s f g x)
= synth_dsum_case_injective s x;
match x with
| Known x' -> jump_synth (f' x') (synth_dsum_case s (Known x')) () <: jumper (parse_dsum_cases' s f g x)
| Unknown x' -> jump_synth g' (synth_dsum_case s (Unknown x')) () <: jumper (parse_dsum_cases' s f g x)
inline_for_extraction
let jump_dsum_cases'_destr
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(f' : (x: dsum_known_key s) -> Tot (jumper (dsnd (f x))))
(#k: parser_kind)
(#g: parser k (dsum_type_of_unknown_tag s))
(g' : jumper g)
(destr: dep_enum_destr _ (fun k -> jump_dsum_cases_t s f g (Known k)))
(x: dsum_key s)
: Tot (jump_dsum_cases_t s f g x)
= fun #rrel #rel input pos ->
match x with
| Known k ->
destr
_
(fun k -> jump_dsum_cases_if s f g (Known k))
(fun _ _ -> ())
(fun _ _ _ _ -> ())
(fun k -> jump_dsum_cases' s f f' g' (Known k))
k
input
pos
| Unknown r -> jump_dsum_cases' s f f' g' (Unknown r) input pos
inline_for_extraction
let jump_dsum_cases
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(f' : (x: dsum_known_key s) -> Tot (jumper (dsnd (f x))))
(#k: parser_kind)
(#g: parser k (dsum_type_of_unknown_tag s))
(g' : jumper g)
(destr: dep_enum_destr _ (fun k -> jump_dsum_cases_t s f g (Known k)))
(x: dsum_key s)
: Tot (jumper (parse_dsum_cases s f g x))
= fun #rrel #rel input pos ->
let h = HST.get () in
[@inline_let]
let _ =
valid_facts (parse_dsum_cases' s f g x) h input pos;
valid_facts (parse_dsum_cases s f g x) h input pos;
parse_dsum_cases_eq' s f g x (bytes_of_slice_from h input pos)
in
jump_dsum_cases'_destr s f f' g' destr x input pos
#push-options "--z3rlimit 16"
inline_for_extraction
let jump_dsum
(#kt: parser_kind)
(t: dsum)
(#p: parser kt (dsum_repr_type t))
(v: jumper p)
(p32: leaf_reader p)
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(f32: (x: dsum_known_key t) -> Tot (jumper (dsnd (f x))))
(#k': parser_kind)
(#g: parser k' (dsum_type_of_unknown_tag t))
(g32: jumper g)
(destr: dep_maybe_enum_destr_t (dsum_enum t) (jump_dsum_cases_t t f g))
: Tot (jumper (parse_dsum t p f g))
= fun #rrel #rel input pos ->
let h = HST.get () in
[@inline_let]
let _ = parse_dsum_eq' t p f g (bytes_of_slice_from h input pos) in
[@inline_let]
let _ = valid_facts (parse_dsum t p f g) h input pos in
[@inline_let]
let _ = valid_facts p h input pos in
let pos_after_tag = v input pos in
let tg = p32 input pos in
[@inline_let]
let _ = valid_facts (parse_dsum_cases' t f g (maybe_enum_key_of_repr (dsum_enum t) tg)) h input pos_after_tag in
destr (jump_dsum_cases_eq t f g) (jump_dsum_cases_if t f g) (fun _ _ -> ()) (fun _ _ _ _ -> ()) (jump_dsum_cases' t f f32 g32) tg input pos_after_tag
#pop-options
inline_for_extraction
let read_dsum_cases'
(t: dsum)
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(f32: (x: dsum_known_key t) -> Tot (leaf_reader (dsnd (f x))))
(#k': parser_kind)
(g: parser k' (dsum_type_of_unknown_tag t))
(g32: leaf_reader g)
(x: dsum_key t)
: Tot (leaf_reader (parse_dsum_cases' t f g x))
= fun #rrel #rel input pos ->
[@inline_let]
let _ = synth_dsum_case_injective t x in
match x with
| Known x' ->
read_synth'
(dsnd (f x'))
(synth_dsum_case t (Known x'))
(f32 x')
()
input
pos
| Unknown x' ->
read_synth'
g
(synth_dsum_case t (Unknown x'))
g32
()
input
pos
inline_for_extraction
let read_dsum_cases_t
(t: dsum)
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(#k': parser_kind)
(g: parser k' (dsum_type_of_unknown_tag t))
(k: dsum_known_key t)
: Tot Type
= leaf_reader (parse_dsum_cases' t f g (Known k))
let read_dsum_cases_t_eq
(t: dsum)
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(#k': parser_kind)
(g: parser k' (dsum_type_of_unknown_tag t))
(k: dsum_known_key t)
(x y : read_dsum_cases_t t f g k)
: GTot Type0
= True
inline_for_extraction
let read_dsum_cases_t_if
(t: dsum)
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(#k': parser_kind)
(g: parser k' (dsum_type_of_unknown_tag t))
(k: dsum_known_key t)
: Tot (if_combinator _ (read_dsum_cases_t_eq t f g k))
= fun cond (sv_true: cond_true cond -> Tot (read_dsum_cases_t t f g k)) (sv_false: cond_false cond -> Tot (read_dsum_cases_t t f g k)) #_ #_ input pos ->
if cond
then sv_true () input pos
else sv_false () input pos
inline_for_extraction
let read_dsum_cases
(t: dsum)
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(f32: (x: dsum_known_key t) -> Tot (leaf_reader (dsnd (f x))))
(#k': parser_kind)
(g: parser k' (dsum_type_of_unknown_tag t))
(g32: leaf_reader g)
(destr: dep_enum_destr _ (read_dsum_cases_t t f g))
(x: dsum_key t)
: Tot (leaf_reader (parse_dsum_cases' t f g x))
= fun #_ #_ input pos ->
match x with
| Known k ->
destr
_
(read_dsum_cases_t_if t f g)
(fun _ _ -> ())
(fun _ _ _ _ -> ())
(fun k -> read_dsum_cases' t f f32 g g32 (Known k))
k
input
pos
| Unknown r ->
read_dsum_cases' t f f32 g g32 (Unknown r) input pos
#push-options "--z3rlimit 16"
inline_for_extraction
let read_dsum
(#kt: parser_kind)
(t: dsum)
(#p: parser kt (dsum_repr_type t))
(p32: leaf_reader (parse_maybe_enum_key p (dsum_enum t)))
(j: jumper p)
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(f32: (x: dsum_known_key t) -> Tot (leaf_reader (dsnd (f x))))
(#k': parser_kind)
(#g: parser k' (dsum_type_of_unknown_tag t))
(g32: leaf_reader g)
(destr: dep_enum_destr _ (read_dsum_cases_t t f g))
: Tot (leaf_reader (parse_dsum t p f g))
= fun #_ #_ input pos ->
let h = HST.get () in
valid_facts (parse_dsum t p f g) h input pos;
parse_dsum_eq_ t p f g (bytes_of_slice_from h input pos);
valid_facts (parse_maybe_enum_key p (dsum_enum t)) h input pos;
let k = p32 input pos in
let pos' = jump_maybe_enum_key j (dsum_enum t) input pos in
valid_facts (parse_dsum_cases' t f g k) h input pos' ;
read_dsum_cases t f f32 g g32 destr k input pos'
#pop-options
inline_for_extraction
let serialize32_dsum_type_of_tag
(t: dsum)
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(sf: (x: dsum_known_key t) -> Tot (serializer (dsnd (f x))))
(sf32: (x: dsum_known_key t) -> Tot (serializer32 (sf x)))
(#k': parser_kind)
(#g: parser k' (dsum_type_of_unknown_tag t))
(#sg: serializer g)
(sg32: serializer32 sg)
(tg: dsum_key t)
: Tot (serializer32 (serialize_dsum_type_of_tag t f sf g sg tg))
= match tg with
| Known x' -> serialize32_ext (dsnd (f x')) (sf x') (sf32 x') (parse_dsum_type_of_tag t f g tg) ()
| Unknown x' -> serialize32_ext g sg sg32 (parse_dsum_type_of_tag t f g tg) ()
inline_for_extraction
let serialize32_dsum_cases_aux
(t: dsum)
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(sf: (x: dsum_known_key t) -> Tot (serializer (dsnd (f x))))
(sf32: (x: dsum_known_key t) -> Tot (serializer32 (sf x)))
(#k': parser_kind)
(#g: parser k' (dsum_type_of_unknown_tag t))
(#sg: serializer g)
(sg32: serializer32 sg)
(tg: dsum_key t)
: Tot (serializer32 (serialize_dsum_cases t f sf g sg tg))
= [@inline_let]
let _ = synth_dsum_case_injective t tg in
[@inline_let]
let _ = synth_dsum_case_inverse t tg in
serialize32_synth
(serialize32_dsum_type_of_tag t f sf sf32 sg32 tg)
(synth_dsum_case t tg)
(synth_dsum_case_recip t tg)
(fun x -> synth_dsum_case_recip t tg x)
()
inline_for_extraction
let serialize32_dsum_cases_t
(t: dsum)
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(sf: (x: dsum_known_key t) -> Tot (serializer (dsnd (f x))))
(#k': parser_kind)
(g: parser k' (dsum_type_of_unknown_tag t))
(sg: serializer g)
(k: dsum_known_key t)
: Tot Type
= serializer32 (serialize_dsum_cases t f sf g sg (Known k))
let serialize32_dsum_cases_t_eq
(t: dsum)
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(sf: (x: dsum_known_key t) -> Tot (serializer (dsnd (f x))))
(#k': parser_kind)
(g: parser k' (dsum_type_of_unknown_tag t))
(sg: serializer g)
(k: dsum_known_key t)
(x y: serialize32_dsum_cases_t t f sf g sg k)
: GTot Type0
= True
inline_for_extraction
let serialize32_dsum_cases_t_if
(t: dsum)
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(sf: (x: dsum_known_key t) -> Tot (serializer (dsnd (f x))))
(#k': parser_kind)
(g: parser k' (dsum_type_of_unknown_tag t))
(sg: serializer g)
(k: dsum_known_key t)
: Tot (if_combinator _ (serialize32_dsum_cases_t_eq t f sf g sg k))
= fun cond (sv_true: (cond_true cond -> Tot (serialize32_dsum_cases_t t f sf g sg k))) (sv_false: (cond_false cond -> Tot (serialize32_dsum_cases_t t f sf g sg k))) x #rrel #rel output pos ->
if cond
then (sv_true () x output pos)
else (sv_false () x output pos)
inline_for_extraction
let serialize32_dsum_cases
(t: dsum)
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(sf: (x: dsum_known_key t) -> Tot (serializer (dsnd (f x))))
(sf32: (x: dsum_known_key t) -> Tot (serializer32 (sf x)))
(#k': parser_kind)
(#g: parser k' (dsum_type_of_unknown_tag t))
(#sg: serializer g)
(sg32: serializer32 sg)
(destr: dep_enum_destr _ (serialize32_dsum_cases_t t f sf g sg))
(tg: dsum_key t)
: Tot (serializer32 (serialize_dsum_cases t f sf g sg tg))
= fun x #rrel #rel output pos ->
match tg with
| Known k ->
destr
_
(serialize32_dsum_cases_t_if t f sf g sg)
(fun _ _ -> ())
(fun _ _ _ _ -> ())
(fun k -> serialize32_dsum_cases_aux t f sf sf32 sg32 (Known k))
k
x
output
pos
| Unknown r ->
serialize32_dsum_cases_aux t f sf sf32 sg32 (Unknown r) x output pos
inline_for_extraction
let serialize32_dsum
(#kt: parser_kind)
(t: dsum)
(#p: parser kt (dsum_repr_type t))
(s: serializer p {kt.parser_kind_subkind == Some ParserStrong})
(s32: serializer32 (serialize_maybe_enum_key _ s (dsum_enum t)))
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(sf: (x: dsum_known_key t) -> Tot (serializer (dsnd (f x))))
(sf32: (x: dsum_known_key t) -> Tot (serializer32 (sf x)))
(#k': parser_kind)
(#g: parser k' (dsum_type_of_unknown_tag t))
(#sg: serializer g)
(sg32: serializer32 sg)
(destr: dep_enum_destr _ (serialize32_dsum_cases_t t f sf g sg))
: Tot (serializer32 (serialize_dsum t s f sf g sg))
= fun x #_ #_ output pos ->
[@inline_let]
let _ = serialize_dsum_eq' t s f sf g sg x in
let tg = dsum_tag_of_data t x in
serialize32_nondep_then_aux
s32
(serialize32_dsum_cases t f sf sf32 sg32 destr tg)
tg
x
output
pos
let clens_dsum_tag
(s: dsum)
: Tot (clens (dsum_type s) (dsum_key s))
= {
clens_cond = (fun _ -> True);
clens_get = dsum_tag_of_data s;
}
let gaccessor_dsum_tag
(#kt: parser_kind)
(t: dsum)
(p: parser kt (dsum_repr_type t))
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
: Tot (gaccessor (parse_dsum t p f g) (parse_maybe_enum_key p (dsum_enum t)) (clens_dsum_tag t))
= gaccessor_tagged_union_tag
(parse_maybe_enum_key p (dsum_enum t))
(dsum_tag_of_data t)
(parse_dsum_cases t f g)
inline_for_extraction
let accessor_dsum_tag
(#kt: parser_kind)
(t: dsum)
(p: parser kt (dsum_repr_type t))
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
: Tot (accessor (gaccessor_dsum_tag t p f g))
= accessor_tagged_union_tag
(parse_maybe_enum_key p (dsum_enum t))
(dsum_tag_of_data t)
(parse_dsum_cases t f g) | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"LowStar.Buffer.fst.checked",
"LowParse.Spec.Sum.fst.checked",
"LowParse.Low.Enum.fst.checked",
"FStar.UInt64.fsti.checked",
"FStar.UInt32.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Int.Cast.fst.checked",
"FStar.HyperStack.ST.fsti.checked",
"FStar.HyperStack.fst.checked",
"FStar.Classical.fsti.checked"
],
"interface_file": false,
"source_file": "LowParse.Low.Sum.fst"
} | [
{
"abbrev": true,
"full_module": "FStar.HyperStack",
"short_module": "HS"
},
{
"abbrev": true,
"full_module": "FStar.UInt64",
"short_module": "U64"
},
{
"abbrev": true,
"full_module": "FStar.Int.Cast",
"short_module": "Cast"
},
{
"abbrev": true,
"full_module": "LowStar.Buffer",
"short_module": "B"
},
{
"abbrev": true,
"full_module": "FStar.HyperStack.ST",
"short_module": "HST"
},
{
"abbrev": true,
"full_module": "FStar.UInt32",
"short_module": "U32"
},
{
"abbrev": false,
"full_module": "LowParse.Spec.Sum",
"short_module": null
},
{
"abbrev": false,
"full_module": "LowParse.Low.Enum",
"short_module": null
},
{
"abbrev": false,
"full_module": "LowParse.Low",
"short_module": null
},
{
"abbrev": false,
"full_module": "LowParse.Low",
"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",
"short_module": null
}
] | {
"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_elim_box": false,
"smtencoding_l_arith_repr": "boxwrap",
"smtencoding_nl_arith_repr": "boxwrap",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": true,
"z3cliopt": [],
"z3refresh": false,
"z3rlimit": 5,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | false | s: LowParse.Spec.Sum.dsum -> k: LowParse.Spec.Sum.dsum_key s
-> LowParse.Low.Base.Spec.clens (LowParse.Spec.Sum.dsum_type s)
(LowParse.Spec.Sum.dsum_type_of_tag s k) | Prims.Tot | [
"total"
] | [] | [
"LowParse.Spec.Sum.dsum",
"LowParse.Spec.Sum.dsum_key",
"LowParse.Low.Base.Spec.Mkclens",
"LowParse.Spec.Sum.dsum_type",
"LowParse.Spec.Sum.dsum_type_of_tag",
"Prims.eq2",
"LowParse.Spec.Sum.dsum_tag_of_data",
"LowParse.Spec.Sum.synth_dsum_case_recip",
"Prims.l_True",
"LowParse.Low.Base.Spec.clens"
] | [] | false | false | false | false | false | let clens_dsum_payload (s: dsum) (k: dsum_key s) : Tot (clens (dsum_type s) (dsum_type_of_tag s k)) =
| {
clens_cond = (fun (x: dsum_type s) -> dsum_tag_of_data s x == k);
clens_get
=
(fun (x: dsum_type s) ->
synth_dsum_case_recip s k x
<:
Ghost (dsum_type_of_tag s k) (requires (dsum_tag_of_data s x == k)) (ensures (fun _ -> True)))
} | false |
Vale.Curve25519.Fast_defs.fst | Vale.Curve25519.Fast_defs.pow2_four | val pow2_four (c0 c1 c2 c3: nat) : nat | val pow2_four (c0 c1 c2 c3: nat) : nat | let pow2_four (c0 c1 c2 c3:nat) : nat = pow2_three c0 c1 c2 + pow2_192 * c3 | {
"file_name": "vale/code/crypto/ecc/curve25519/Vale.Curve25519.Fast_defs.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 75,
"end_line": 22,
"start_col": 0,
"start_line": 22
} | module Vale.Curve25519.Fast_defs
open Vale.Def.Words_s
open Vale.Def.Types_s
open FStar.Mul
unfold let pow2_192 = 0x1000000000000000000000000000000000000000000000000
let _ = assert_norm (pow2 192 = pow2_192)
unfold let pow2_256 = 0x10000000000000000000000000000000000000000000000000000000000000000
let _ = assert_norm (pow2 256 = pow2_256)
unfold let pow2_320 = 0x100000000000000000000000000000000000000000000000000000000000000000000000000000000
let _ = assert_norm (pow2 320 = pow2_320)
unfold let pow2_384 = 0x1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000
let _ = assert_norm (pow2 384 = pow2_384)
unfold let pow2_448 = 0x10000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000
let _ = assert_norm (pow2 448 = pow2_448)
unfold let pow2_512 = 0x100000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000
let _ = assert_norm (pow2 512 = pow2_512)
let pow2_two (c0 c1:nat) : nat = c0 + pow2_64 * c1 | {
"checked_file": "/",
"dependencies": [
"Vale.Def.Words_s.fsti.checked",
"Vale.Def.Types_s.fst.checked",
"Vale.Curve25519.Fast_lemmas_internal.fsti.checked",
"Vale.Arch.Types.fsti.checked",
"prims.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked"
],
"interface_file": false,
"source_file": "Vale.Curve25519.Fast_defs.fst"
} | [
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Def.Types_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Def.Words_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Curve25519",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Curve25519",
"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",
"short_module": null
}
] | {
"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_elim_box": true,
"smtencoding_l_arith_repr": "native",
"smtencoding_nl_arith_repr": "wrapped",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": false,
"z3cliopt": [
"smt.arith.nl=false",
"smt.QI.EAGER_THRESHOLD=100",
"smt.CASE_SPLIT=3"
],
"z3refresh": false,
"z3rlimit": 5,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | false | c0: Prims.nat -> c1: Prims.nat -> c2: Prims.nat -> c3: Prims.nat -> Prims.nat | Prims.Tot | [
"total"
] | [] | [
"Prims.nat",
"Prims.op_Addition",
"Vale.Curve25519.Fast_defs.pow2_three",
"FStar.Mul.op_Star",
"Vale.Curve25519.Fast_defs.pow2_192"
] | [] | false | false | false | true | false | let pow2_four (c0 c1 c2 c3: nat) : nat =
| pow2_three c0 c1 c2 + pow2_192 * c3 | false |
Vale.Curve25519.Fast_defs.fst | Vale.Curve25519.Fast_defs.pow2_six | val pow2_six (c0 c1 c2 c3 c4 c5: nat) : nat | val pow2_six (c0 c1 c2 c3 c4 c5: nat) : nat | let pow2_six (c0 c1 c2 c3 c4 c5:nat) : nat = pow2_five c0 c1 c2 c3 c4 + pow2_320 * c5 | {
"file_name": "vale/code/crypto/ecc/curve25519/Vale.Curve25519.Fast_defs.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 85,
"end_line": 24,
"start_col": 0,
"start_line": 24
} | module Vale.Curve25519.Fast_defs
open Vale.Def.Words_s
open Vale.Def.Types_s
open FStar.Mul
unfold let pow2_192 = 0x1000000000000000000000000000000000000000000000000
let _ = assert_norm (pow2 192 = pow2_192)
unfold let pow2_256 = 0x10000000000000000000000000000000000000000000000000000000000000000
let _ = assert_norm (pow2 256 = pow2_256)
unfold let pow2_320 = 0x100000000000000000000000000000000000000000000000000000000000000000000000000000000
let _ = assert_norm (pow2 320 = pow2_320)
unfold let pow2_384 = 0x1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000
let _ = assert_norm (pow2 384 = pow2_384)
unfold let pow2_448 = 0x10000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000
let _ = assert_norm (pow2 448 = pow2_448)
unfold let pow2_512 = 0x100000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000
let _ = assert_norm (pow2 512 = pow2_512)
let pow2_two (c0 c1:nat) : nat = c0 + pow2_64 * c1
let pow2_three (c0 c1 c2:nat) : nat = pow2_two c0 c1 + pow2_128 * c2
let pow2_four (c0 c1 c2 c3:nat) : nat = pow2_three c0 c1 c2 + pow2_192 * c3 | {
"checked_file": "/",
"dependencies": [
"Vale.Def.Words_s.fsti.checked",
"Vale.Def.Types_s.fst.checked",
"Vale.Curve25519.Fast_lemmas_internal.fsti.checked",
"Vale.Arch.Types.fsti.checked",
"prims.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked"
],
"interface_file": false,
"source_file": "Vale.Curve25519.Fast_defs.fst"
} | [
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Def.Types_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Def.Words_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Curve25519",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Curve25519",
"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",
"short_module": null
}
] | {
"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_elim_box": true,
"smtencoding_l_arith_repr": "native",
"smtencoding_nl_arith_repr": "wrapped",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": false,
"z3cliopt": [
"smt.arith.nl=false",
"smt.QI.EAGER_THRESHOLD=100",
"smt.CASE_SPLIT=3"
],
"z3refresh": false,
"z3rlimit": 5,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | false | c0: Prims.nat -> c1: Prims.nat -> c2: Prims.nat -> c3: Prims.nat -> c4: Prims.nat -> c5: Prims.nat
-> Prims.nat | Prims.Tot | [
"total"
] | [] | [
"Prims.nat",
"Prims.op_Addition",
"Vale.Curve25519.Fast_defs.pow2_five",
"FStar.Mul.op_Star",
"Vale.Curve25519.Fast_defs.pow2_320"
] | [] | false | false | false | true | false | let pow2_six (c0 c1 c2 c3 c4 c5: nat) : nat =
| pow2_five c0 c1 c2 c3 c4 + pow2_320 * c5 | false |
Vale.Curve25519.Fast_defs.fst | Vale.Curve25519.Fast_defs.pow2_five | val pow2_five (c0 c1 c2 c3 c4: nat) : nat | val pow2_five (c0 c1 c2 c3 c4: nat) : nat | let pow2_five (c0 c1 c2 c3 c4:nat) : nat = pow2_four c0 c1 c2 c3 + pow2_256 * c4 | {
"file_name": "vale/code/crypto/ecc/curve25519/Vale.Curve25519.Fast_defs.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 80,
"end_line": 23,
"start_col": 0,
"start_line": 23
} | module Vale.Curve25519.Fast_defs
open Vale.Def.Words_s
open Vale.Def.Types_s
open FStar.Mul
unfold let pow2_192 = 0x1000000000000000000000000000000000000000000000000
let _ = assert_norm (pow2 192 = pow2_192)
unfold let pow2_256 = 0x10000000000000000000000000000000000000000000000000000000000000000
let _ = assert_norm (pow2 256 = pow2_256)
unfold let pow2_320 = 0x100000000000000000000000000000000000000000000000000000000000000000000000000000000
let _ = assert_norm (pow2 320 = pow2_320)
unfold let pow2_384 = 0x1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000
let _ = assert_norm (pow2 384 = pow2_384)
unfold let pow2_448 = 0x10000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000
let _ = assert_norm (pow2 448 = pow2_448)
unfold let pow2_512 = 0x100000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000
let _ = assert_norm (pow2 512 = pow2_512)
let pow2_two (c0 c1:nat) : nat = c0 + pow2_64 * c1
let pow2_three (c0 c1 c2:nat) : nat = pow2_two c0 c1 + pow2_128 * c2 | {
"checked_file": "/",
"dependencies": [
"Vale.Def.Words_s.fsti.checked",
"Vale.Def.Types_s.fst.checked",
"Vale.Curve25519.Fast_lemmas_internal.fsti.checked",
"Vale.Arch.Types.fsti.checked",
"prims.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked"
],
"interface_file": false,
"source_file": "Vale.Curve25519.Fast_defs.fst"
} | [
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Def.Types_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Def.Words_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Curve25519",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Curve25519",
"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",
"short_module": null
}
] | {
"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_elim_box": true,
"smtencoding_l_arith_repr": "native",
"smtencoding_nl_arith_repr": "wrapped",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": false,
"z3cliopt": [
"smt.arith.nl=false",
"smt.QI.EAGER_THRESHOLD=100",
"smt.CASE_SPLIT=3"
],
"z3refresh": false,
"z3rlimit": 5,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | false | c0: Prims.nat -> c1: Prims.nat -> c2: Prims.nat -> c3: Prims.nat -> c4: Prims.nat -> Prims.nat | Prims.Tot | [
"total"
] | [] | [
"Prims.nat",
"Prims.op_Addition",
"Vale.Curve25519.Fast_defs.pow2_four",
"FStar.Mul.op_Star",
"Vale.Curve25519.Fast_defs.pow2_256"
] | [] | false | false | false | true | false | let pow2_five (c0 c1 c2 c3 c4: nat) : nat =
| pow2_four c0 c1 c2 c3 + pow2_256 * c4 | false |
Vale.Curve25519.Fast_defs.fst | Vale.Curve25519.Fast_defs.pow2_seven | val pow2_seven (c0 c1 c2 c3 c4 c5 c6: nat) : nat | val pow2_seven (c0 c1 c2 c3 c4 c5 c6: nat) : nat | let pow2_seven (c0 c1 c2 c3 c4 c5 c6:nat) : nat = pow2_six c0 c1 c2 c3 c4 c5 + pow2_384 * c6 | {
"file_name": "vale/code/crypto/ecc/curve25519/Vale.Curve25519.Fast_defs.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 92,
"end_line": 25,
"start_col": 0,
"start_line": 25
} | module Vale.Curve25519.Fast_defs
open Vale.Def.Words_s
open Vale.Def.Types_s
open FStar.Mul
unfold let pow2_192 = 0x1000000000000000000000000000000000000000000000000
let _ = assert_norm (pow2 192 = pow2_192)
unfold let pow2_256 = 0x10000000000000000000000000000000000000000000000000000000000000000
let _ = assert_norm (pow2 256 = pow2_256)
unfold let pow2_320 = 0x100000000000000000000000000000000000000000000000000000000000000000000000000000000
let _ = assert_norm (pow2 320 = pow2_320)
unfold let pow2_384 = 0x1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000
let _ = assert_norm (pow2 384 = pow2_384)
unfold let pow2_448 = 0x10000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000
let _ = assert_norm (pow2 448 = pow2_448)
unfold let pow2_512 = 0x100000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000
let _ = assert_norm (pow2 512 = pow2_512)
let pow2_two (c0 c1:nat) : nat = c0 + pow2_64 * c1
let pow2_three (c0 c1 c2:nat) : nat = pow2_two c0 c1 + pow2_128 * c2
let pow2_four (c0 c1 c2 c3:nat) : nat = pow2_three c0 c1 c2 + pow2_192 * c3
let pow2_five (c0 c1 c2 c3 c4:nat) : nat = pow2_four c0 c1 c2 c3 + pow2_256 * c4 | {
"checked_file": "/",
"dependencies": [
"Vale.Def.Words_s.fsti.checked",
"Vale.Def.Types_s.fst.checked",
"Vale.Curve25519.Fast_lemmas_internal.fsti.checked",
"Vale.Arch.Types.fsti.checked",
"prims.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked"
],
"interface_file": false,
"source_file": "Vale.Curve25519.Fast_defs.fst"
} | [
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Def.Types_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Def.Words_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Curve25519",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Curve25519",
"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",
"short_module": null
}
] | {
"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_elim_box": true,
"smtencoding_l_arith_repr": "native",
"smtencoding_nl_arith_repr": "wrapped",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": false,
"z3cliopt": [
"smt.arith.nl=false",
"smt.QI.EAGER_THRESHOLD=100",
"smt.CASE_SPLIT=3"
],
"z3refresh": false,
"z3rlimit": 5,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | false |
c0: Prims.nat ->
c1: Prims.nat ->
c2: Prims.nat ->
c3: Prims.nat ->
c4: Prims.nat ->
c5: Prims.nat ->
c6: Prims.nat
-> Prims.nat | Prims.Tot | [
"total"
] | [] | [
"Prims.nat",
"Prims.op_Addition",
"Vale.Curve25519.Fast_defs.pow2_six",
"FStar.Mul.op_Star",
"Vale.Curve25519.Fast_defs.pow2_384"
] | [] | false | false | false | true | false | let pow2_seven (c0 c1 c2 c3 c4 c5 c6: nat) : nat =
| pow2_six c0 c1 c2 c3 c4 c5 + pow2_384 * c6 | false |
Vale.Curve25519.Fast_defs.fst | Vale.Curve25519.Fast_defs.pow2_eight | val pow2_eight (c0 c1 c2 c3 c4 c5 c6 c7: nat) : nat | val pow2_eight (c0 c1 c2 c3 c4 c5 c6 c7: nat) : nat | let pow2_eight (c0 c1 c2 c3 c4 c5 c6 c7:nat) : nat = pow2_seven c0 c1 c2 c3 c4 c5 c6 + pow2_448 * c7 | {
"file_name": "vale/code/crypto/ecc/curve25519/Vale.Curve25519.Fast_defs.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 100,
"end_line": 26,
"start_col": 0,
"start_line": 26
} | module Vale.Curve25519.Fast_defs
open Vale.Def.Words_s
open Vale.Def.Types_s
open FStar.Mul
unfold let pow2_192 = 0x1000000000000000000000000000000000000000000000000
let _ = assert_norm (pow2 192 = pow2_192)
unfold let pow2_256 = 0x10000000000000000000000000000000000000000000000000000000000000000
let _ = assert_norm (pow2 256 = pow2_256)
unfold let pow2_320 = 0x100000000000000000000000000000000000000000000000000000000000000000000000000000000
let _ = assert_norm (pow2 320 = pow2_320)
unfold let pow2_384 = 0x1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000
let _ = assert_norm (pow2 384 = pow2_384)
unfold let pow2_448 = 0x10000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000
let _ = assert_norm (pow2 448 = pow2_448)
unfold let pow2_512 = 0x100000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000
let _ = assert_norm (pow2 512 = pow2_512)
let pow2_two (c0 c1:nat) : nat = c0 + pow2_64 * c1
let pow2_three (c0 c1 c2:nat) : nat = pow2_two c0 c1 + pow2_128 * c2
let pow2_four (c0 c1 c2 c3:nat) : nat = pow2_three c0 c1 c2 + pow2_192 * c3
let pow2_five (c0 c1 c2 c3 c4:nat) : nat = pow2_four c0 c1 c2 c3 + pow2_256 * c4
let pow2_six (c0 c1 c2 c3 c4 c5:nat) : nat = pow2_five c0 c1 c2 c3 c4 + pow2_320 * c5 | {
"checked_file": "/",
"dependencies": [
"Vale.Def.Words_s.fsti.checked",
"Vale.Def.Types_s.fst.checked",
"Vale.Curve25519.Fast_lemmas_internal.fsti.checked",
"Vale.Arch.Types.fsti.checked",
"prims.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked"
],
"interface_file": false,
"source_file": "Vale.Curve25519.Fast_defs.fst"
} | [
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Def.Types_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Def.Words_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Curve25519",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Curve25519",
"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",
"short_module": null
}
] | {
"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_elim_box": true,
"smtencoding_l_arith_repr": "native",
"smtencoding_nl_arith_repr": "wrapped",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": false,
"z3cliopt": [
"smt.arith.nl=false",
"smt.QI.EAGER_THRESHOLD=100",
"smt.CASE_SPLIT=3"
],
"z3refresh": false,
"z3rlimit": 5,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | false |
c0: Prims.nat ->
c1: Prims.nat ->
c2: Prims.nat ->
c3: Prims.nat ->
c4: Prims.nat ->
c5: Prims.nat ->
c6: Prims.nat ->
c7: Prims.nat
-> Prims.nat | Prims.Tot | [
"total"
] | [] | [
"Prims.nat",
"Prims.op_Addition",
"Vale.Curve25519.Fast_defs.pow2_seven",
"FStar.Mul.op_Star",
"Vale.Curve25519.Fast_defs.pow2_448"
] | [] | false | false | false | true | false | let pow2_eight (c0 c1 c2 c3 c4 c5 c6 c7: nat) : nat =
| pow2_seven c0 c1 c2 c3 c4 c5 c6 + pow2_448 * c7 | false |
Vale.Curve25519.Fast_defs.fst | Vale.Curve25519.Fast_defs.mul_nats | val mul_nats (x y: nat) : nat | val mul_nats (x y: nat) : nat | let mul_nats (x y:nat) : nat =
let prod = x * y in
Vale.Curve25519.Fast_lemmas_internal.lemma_mul_bounds_le 0 x 0 y;
prod | {
"file_name": "vale/code/crypto/ecc/curve25519/Vale.Curve25519.Fast_defs.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 6,
"end_line": 38,
"start_col": 0,
"start_line": 35
} | module Vale.Curve25519.Fast_defs
open Vale.Def.Words_s
open Vale.Def.Types_s
open FStar.Mul
unfold let pow2_192 = 0x1000000000000000000000000000000000000000000000000
let _ = assert_norm (pow2 192 = pow2_192)
unfold let pow2_256 = 0x10000000000000000000000000000000000000000000000000000000000000000
let _ = assert_norm (pow2 256 = pow2_256)
unfold let pow2_320 = 0x100000000000000000000000000000000000000000000000000000000000000000000000000000000
let _ = assert_norm (pow2 320 = pow2_320)
unfold let pow2_384 = 0x1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000
let _ = assert_norm (pow2 384 = pow2_384)
unfold let pow2_448 = 0x10000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000
let _ = assert_norm (pow2 448 = pow2_448)
unfold let pow2_512 = 0x100000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000
let _ = assert_norm (pow2 512 = pow2_512)
let pow2_two (c0 c1:nat) : nat = c0 + pow2_64 * c1
let pow2_three (c0 c1 c2:nat) : nat = pow2_two c0 c1 + pow2_128 * c2
let pow2_four (c0 c1 c2 c3:nat) : nat = pow2_three c0 c1 c2 + pow2_192 * c3
let pow2_five (c0 c1 c2 c3 c4:nat) : nat = pow2_four c0 c1 c2 c3 + pow2_256 * c4
let pow2_six (c0 c1 c2 c3 c4 c5:nat) : nat = pow2_five c0 c1 c2 c3 c4 + pow2_320 * c5
let pow2_seven (c0 c1 c2 c3 c4 c5 c6:nat) : nat = pow2_six c0 c1 c2 c3 c4 c5 + pow2_384 * c6
let pow2_eight (c0 c1 c2 c3 c4 c5 c6 c7:nat) : nat = pow2_seven c0 c1 c2 c3 c4 c5 c6 + pow2_448 * c7
let pow2_nine (c0 c1 c2 c3 c4 c5 c6 c7 c8:nat) : nat = pow2_eight c0 c1 c2 c3 c4 c5 c6 c7 + pow2_512 * c8
unfold let prime:nat = 57896044618658097711785492504343953926634992332820282019728792003956564819949 //(pow2 255) - 19
type bit = b:nat { b <= 1 }
let bool_bit (b:bool) : bit = if b then 1 else 0 | {
"checked_file": "/",
"dependencies": [
"Vale.Def.Words_s.fsti.checked",
"Vale.Def.Types_s.fst.checked",
"Vale.Curve25519.Fast_lemmas_internal.fsti.checked",
"Vale.Arch.Types.fsti.checked",
"prims.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked"
],
"interface_file": false,
"source_file": "Vale.Curve25519.Fast_defs.fst"
} | [
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Def.Types_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Def.Words_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Curve25519",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Curve25519",
"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",
"short_module": null
}
] | {
"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_elim_box": true,
"smtencoding_l_arith_repr": "native",
"smtencoding_nl_arith_repr": "wrapped",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": false,
"z3cliopt": [
"smt.arith.nl=false",
"smt.QI.EAGER_THRESHOLD=100",
"smt.CASE_SPLIT=3"
],
"z3refresh": false,
"z3rlimit": 5,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | false | x: Prims.nat -> y: Prims.nat -> Prims.nat | Prims.Tot | [
"total"
] | [] | [
"Prims.nat",
"Prims.unit",
"Vale.Curve25519.Fast_lemmas_internal.lemma_mul_bounds_le",
"Prims.int",
"FStar.Mul.op_Star"
] | [] | false | false | false | true | false | let mul_nats (x y: nat) : nat =
| let prod = x * y in
Vale.Curve25519.Fast_lemmas_internal.lemma_mul_bounds_le 0 x 0 y;
prod | false |
LowParse.Low.Sum.fst | LowParse.Low.Sum.accessor_clens_dsum_unknown_payload | val accessor_clens_dsum_unknown_payload
(#kt: parser_kind)
(t: dsum)
(#p: parser kt (dsum_repr_type t))
(j: jumper p {kt.parser_kind_subkind == Some ParserStrong})
(f: (x: dsum_known_key t -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x))))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
: Tot (accessor (gaccessor_clens_dsum_unknown_payload t p f g)) | val accessor_clens_dsum_unknown_payload
(#kt: parser_kind)
(t: dsum)
(#p: parser kt (dsum_repr_type t))
(j: jumper p {kt.parser_kind_subkind == Some ParserStrong})
(f: (x: dsum_known_key t -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x))))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
: Tot (accessor (gaccessor_clens_dsum_unknown_payload t p f g)) | let accessor_clens_dsum_unknown_payload
(#kt: parser_kind)
(t: dsum)
(#p: parser kt (dsum_repr_type t))
(j: jumper p { kt.parser_kind_subkind == Some ParserStrong })
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
: Tot (accessor (gaccessor_clens_dsum_unknown_payload t p f g))
= fun #rrel #rel -> accessor_clens_dsum_unknown_payload' t j f g #rrel #rel | {
"file_name": "src/lowparse/LowParse.Low.Sum.fst",
"git_rev": "00217c4a89f5ba56002ba9aa5b4a9d5903bfe9fa",
"git_url": "https://github.com/project-everest/everparse.git",
"project_name": "everparse"
} | {
"end_col": 75,
"end_line": 2078,
"start_col": 0,
"start_line": 2069
} | module LowParse.Low.Sum
include LowParse.Low.Enum
include LowParse.Spec.Sum
module U32 = FStar.UInt32
module HST = FStar.HyperStack.ST
module B = LowStar.Buffer
module Cast = FStar.Int.Cast
module U64 = FStar.UInt64
inline_for_extraction
let validate_sum_cases_aux
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(vc: ((x: sum_key t) -> Tot (validator (dsnd (pc x)))))
(k: sum_key t)
: Tot (validator (parse_sum_cases t pc k))
= [@inline_let]
let _ = synth_sum_case_injective t k in
validate_synth
(validate_weaken
(weaken_parse_cases_kind t pc)
(vc k)
()
)
(synth_sum_case t k)
()
inline_for_extraction
let validate_sum_cases_t
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot Type
= validator (parse_sum_cases t pc k)
let validate_sum_cases_t_eq
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
(x y : validate_sum_cases_t t pc k)
: GTot Type0
= True
inline_for_extraction
let validate_sum_cases_t_if
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (if_combinator _ (validate_sum_cases_t_eq t pc k))
= fun cond (sv_true: cond_true cond -> Tot (validate_sum_cases_t t pc k)) (sv_false: cond_false cond -> Tot (validate_sum_cases_t t pc k)) #rrel #rel input pos ->
if cond
then sv_true () input pos
else sv_false () input pos
inline_for_extraction
let validate_sum_cases
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(vc: ((x: sum_key t) -> Tot (validator (dsnd (pc x)))))
(destr: dep_enum_destr (sum_enum t) (validate_sum_cases_t t pc))
(k: sum_key t)
: Tot (validator (parse_sum_cases t pc k))
= destr
_
(validate_sum_cases_t_if t pc)
(fun _ _ -> ())
(fun _ _ _ _ -> ())
(validate_sum_cases_aux t pc vc)
k
inline_for_extraction
let validate_sum_aux_payload_t
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
: Tot Type
= (#rrel: _) -> (#rel: _) ->
(input: slice rrel rel) ->
(pos: U64.t) ->
HST.Stack U64.t
(requires (fun h -> live_slice h input /\ U64.v pos <= U32.v input.len))
(ensures (fun h res h' ->
B.modifies B.loc_none h h' /\ (
match k with
| Unknown _ -> is_error res
| Known k' ->
if is_success res
then
valid_pos (dsnd (pc k')) h input (uint64_to_uint32 pos) (uint64_to_uint32 res)
else
(~ (valid (dsnd (pc k')) h input (uint64_to_uint32 pos)))
)))
let validate_sum_aux_payload_eq
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
: Tot (validate_sum_aux_payload_t t pc k -> validate_sum_aux_payload_t t pc k -> GTot Type0)
= fun _ _ -> True
inline_for_extraction
let validate_sum_aux_payload_if'
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
(cond: bool)
(ift: ((cond_true cond) -> Tot (validate_sum_aux_payload_t t pc k)))
(iff: ((cond_false cond) -> Tot (validate_sum_aux_payload_t t pc k)))
: Tot (validate_sum_aux_payload_t t pc k)
= fun #rrel #rel input pos ->
if cond
then begin
(ift () <: validate_sum_aux_payload_t t pc k) input pos
end else
(iff () <: validate_sum_aux_payload_t t pc k) input pos
inline_for_extraction
let validate_sum_aux_payload_if
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
: Tot (if_combinator _ (validate_sum_aux_payload_eq t pc k))
= validate_sum_aux_payload_if' t pc k
#push-options "--z3rlimit 64 --z3cliopt smt.arith.nl=false --using_facts_from '* -FStar.Int.Cast -LowParse.BitFields'"
// --query_stats --smtencoding.elim_box true --smtencoding.l_arith_repr native --z3refresh"
inline_for_extraction
let validate_sum_aux
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(v: validator p)
(p32: leaf_reader p)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(v_payload: ((k: sum_repr_type t)) -> Tot (validate_sum_aux_payload_t t pc (maybe_enum_key_of_repr (sum_enum t) k)))
: Tot (validator (parse_sum t p pc))
= fun #rrel #rel input pos ->
let h = HST.get () in
[@inline_let]
let _ = parse_sum_eq'' t p pc (bytes_of_slice_from h input (uint64_to_uint32 pos)) in
[@inline_let]
let _ = valid_facts (parse_sum t p pc) h input (uint64_to_uint32 pos) in
[@inline_let]
let _ = valid_facts p h input (uint64_to_uint32 pos) in
let len_after_tag = v input pos in
if is_error len_after_tag
then len_after_tag
else begin
let h1 = HST.get () in
let k' = p32 input (uint64_to_uint32 pos) in
[@inline_let]
let _ =
match maybe_enum_key_of_repr (sum_enum t) k' with
| Known k -> valid_facts (dsnd (pc k)) h input (uint64_to_uint32 len_after_tag)
| _ -> ()
in
v_payload k' input len_after_tag
end
#pop-options
inline_for_extraction
let validate_sum_aux_payload'
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (validator (dsnd (pc x)))))
(k: maybe_enum_key (sum_enum t))
: Tot (validate_sum_aux_payload_t t pc k)
= fun #rrel #rel input pos ->
match k with
| Known k ->
[@inline_let]
let _ = synth_sum_case_injective t k in
pc32 k input pos
// validate_synth (pc32 k) (synth_sum_case t k) () input pos
| _ -> validator_error_generic
inline_for_extraction
let validate_sum_aux_payload
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (validator (dsnd (pc x)))))
(destr: dep_maybe_enum_destr_t (sum_enum t) (validate_sum_aux_payload_t t pc))
(k: sum_repr_type t)
: Tot (validate_sum_aux_payload_t t pc (maybe_enum_key_of_repr (sum_enum t) k))
= destr (validate_sum_aux_payload_eq t pc) (validate_sum_aux_payload_if t pc) (fun _ _ -> ()) (fun _ _ _ _ -> ()) (validate_sum_aux_payload' t pc pc32) k
inline_for_extraction
let validate_sum
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(v: validator p)
(p32: leaf_reader p)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (validator (dsnd (pc x)))))
(destr: dep_maybe_enum_destr_t (sum_enum t) (validate_sum_aux_payload_t t pc))
: Tot (validator (parse_sum t p pc))
= validate_sum_aux t v p32 pc (validate_sum_aux_payload t pc pc32 destr)
module HS = FStar.HyperStack
#push-options "--z3rlimit 256 --z3cliopt smt.arith.nl=false --initial_ifuel 8 --max_ifuel 8 --initial_fuel 2 --max_fuel 2"
#restart-solver
let valid_sum_intro
(h: HS.mem)
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: Lemma
(requires (
valid (parse_enum_key p (sum_enum t)) h input pos /\ (
let k = contents (parse_enum_key p (sum_enum t)) h input pos in
valid (dsnd (pc k)) h input (get_valid_pos (parse_enum_key p (sum_enum t)) h input pos)
)))
(ensures (
let k = contents (parse_enum_key p (sum_enum t)) h input pos in
let pos_payload = get_valid_pos (parse_enum_key p (sum_enum t)) h input pos in
valid_content_pos
(parse_sum t p pc) h input pos
(synth_sum_case t k (contents (dsnd (pc k)) h input pos_payload))
(get_valid_pos (dsnd (pc k)) h input pos_payload)
))
= valid_facts (parse_enum_key p (sum_enum t)) h input pos;
let k = contents (parse_enum_key p (sum_enum t)) h input pos in
let pos_payload = get_valid_pos (parse_enum_key p (sum_enum t)) h input pos in
valid_facts (dsnd (pc k)) h input pos_payload;
valid_facts (parse_sum t p pc) h input pos;
parse_sum_eq t p pc (bytes_of_slice_from h input pos)
#pop-options
inline_for_extraction
let finalize_sum_case
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(s: serializer p)
(w: leaf_writer_strong s)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(destr: enum_repr_of_key'_t (sum_enum t))
(k: sum_key t)
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: HST.Stack unit
(requires (fun h ->
let len_tag = serialized_length (serialize_enum_key _ s (sum_enum t)) k in
U32.v pos + len_tag < 4294967296 /\ (
let pos_payload = pos `U32.add` U32.uint_to_t len_tag in
valid (dsnd (pc k)) h input pos_payload /\
writable input.base (U32.v pos) (U32.v pos_payload) h
)))
(ensures (fun h _ h' ->
let len_tag = serialized_length (serialize_enum_key _ s (sum_enum t)) k in
let pos_payload = pos `U32.add` U32.uint_to_t len_tag in
B.modifies (loc_slice_from_to input pos pos_payload) h h' /\
valid_content_pos (parse_sum t p pc) h' input pos (synth_sum_case t k (contents (dsnd (pc k)) h input pos_payload)) (get_valid_pos (dsnd (pc k)) h input pos_payload)
))
= let pos1 = write_enum_key w (sum_enum t) destr k input pos in
let h = HST.get () in
[@inline_let]
let _ = valid_sum_intro h t p pc input pos in
()
inline_for_extraction
let jump_sum_cases_aux
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(vc: ((x: sum_key t) -> Tot (jumper (dsnd (pc x)))))
(k: sum_key t)
: Tot (jumper (parse_sum_cases t pc k))
= [@inline_let]
let _ = synth_sum_case_injective t k in
jump_synth
(jump_weaken
(weaken_parse_cases_kind t pc)
(vc k)
()
)
(synth_sum_case t k)
()
inline_for_extraction
let jump_sum_cases_t
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot Type
= jumper (parse_sum_cases t pc k)
let jump_sum_cases_t_eq
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
(x y : jump_sum_cases_t t pc k)
: GTot Type0
= True
inline_for_extraction
let jump_sum_cases_t_if
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (if_combinator _ (jump_sum_cases_t_eq t pc k))
= fun cond (sv_true: cond_true cond -> Tot (jump_sum_cases_t t pc k)) (sv_false: cond_false cond -> Tot (jump_sum_cases_t t pc k)) #rrel #rel input pos ->
if cond
then sv_true () input pos
else sv_false () input pos
inline_for_extraction
let jump_sum_cases
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(vc: ((x: sum_key t) -> Tot (jumper (dsnd (pc x)))))
(destr: dep_enum_destr (sum_enum t) (jump_sum_cases_t t pc))
(k: sum_key t)
: Tot (jumper (parse_sum_cases t pc k))
= destr
_
(jump_sum_cases_t_if t pc)
(fun _ _ -> ())
(fun _ _ _ _ -> ())
(jump_sum_cases_aux t pc vc)
k
inline_for_extraction
let jump_sum_aux_payload_t
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
: Tot Type
= (#rrel: _) -> (#rel: _) ->
(input: slice rrel rel) ->
(pos: U32.t) ->
HST.Stack U32.t
(requires (fun h -> live_slice h input /\ U32.v pos <= U32.v input.len /\ (
match k with
| Unknown _ -> False
| Known k' -> valid (dsnd (pc k')) h input pos
)))
(ensures (fun h res h' ->
B.modifies B.loc_none h h' /\ (
match k with
| Unknown _ -> False
| Known k' ->
valid_pos (dsnd (pc k')) h input pos res
)))
let jump_sum_aux_payload_eq
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
: Tot (jump_sum_aux_payload_t t pc k -> jump_sum_aux_payload_t t pc k -> GTot Type0)
= fun _ _ -> True
inline_for_extraction
let jump_sum_aux_payload_if'
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
(cond: bool)
(ift: ((cond_true cond) -> Tot (jump_sum_aux_payload_t t pc k)))
(iff: ((cond_false cond) -> Tot (jump_sum_aux_payload_t t pc k)))
: Tot (jump_sum_aux_payload_t t pc k)
= fun #rrel #rel input pos ->
if cond
then begin
(ift () <: jump_sum_aux_payload_t t pc k) input pos
end else
(iff () <: jump_sum_aux_payload_t t pc k) input pos
inline_for_extraction
let jump_sum_aux_payload_if
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
: Tot (if_combinator _ (jump_sum_aux_payload_eq t pc k))
= jump_sum_aux_payload_if' t pc k
let parse_sum_eq3
(#kt: parser_kind)
(t: sum)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(input: bytes)
(k' : sum_repr_type t)
(consumed_k: consumed_length input)
: Lemma
(requires (Some? (parse (parse_sum t p pc) input) /\ parse p input == Some (k', consumed_k)))
(ensures (
let input_k = Seq.slice input consumed_k (Seq.length input) in
let k = maybe_enum_key_of_repr (sum_enum t) k' in
begin match k with
| Known k ->
Some? (parse (dsnd (pc k)) input_k)
| _ -> False
end
))
= parse_sum_eq'' t p pc input
let parse_sum_eq4
(#kt: parser_kind)
(t: sum)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(input: bytes)
(k' : sum_repr_type t)
(consumed_k: consumed_length input)
(consumed_payload: nat)
: Lemma
(requires (Some? (parse (parse_sum t p pc) input) /\ parse p input == Some (k', consumed_k) /\ (
let input_k = Seq.slice input consumed_k (Seq.length input) in
let k = maybe_enum_key_of_repr (sum_enum t) k' in
begin match k with
| Known k ->
Some? (parse (dsnd (pc k)) input_k) /\ (
let Some (_, consumed_payload') = parse (dsnd (pc k)) input_k in
consumed_payload' == consumed_payload
)
| _ -> False
end
)))
(ensures (
let Some (_, consumed) = parse (parse_sum t p pc) input in
consumed == consumed_k + consumed_payload
))
= parse_sum_eq'' t p pc input
#push-options "--z3rlimit 16"
let valid_sum_elim
(h: HS.mem)
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(#rrel: _) (#rel: _)
(input: slice rrel rel)
(pos: U32.t)
: Lemma
(requires (
valid (parse_sum t p pc) h input pos
))
(ensures (
valid p h input pos /\ (
let pos_payload = get_valid_pos p h input pos in
let k' = maybe_enum_key_of_repr (sum_enum t) (contents p h input pos) in
match k' with
| Known k ->
k == sum_tag_of_data t (contents (parse_sum t p pc) h input pos) /\
valid (dsnd (pc k)) h input pos_payload /\
valid_pos
(parse_sum t p pc) h input pos
(get_valid_pos (dsnd (pc k)) h input pos_payload)
| _ -> False
)))
= let sinput = bytes_of_slice_from h input pos in
let _ = parse_sum_eq'' t p pc sinput in
[@inline_let]
let _ = valid_facts (parse_sum t p pc) h input pos in
let Some (k', consumed_k) = parse p sinput in
let pos_after_tag = U32.uint_to_t (U32.v pos + consumed_k) in
[@inline_let]
let _ = valid_facts p h input pos in
assert (valid_content_pos p h input pos k' pos_after_tag);
match maybe_enum_key_of_repr (sum_enum t) k' with
| Known k -> valid_facts (dsnd (pc k)) h input pos_after_tag
| _ -> ()
#pop-options
let valid_sum_elim_tag
(h: HS.mem)
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: Lemma
(requires (
valid (parse_sum t p pc) h input pos
))
(ensures (
valid (parse_enum_key p (sum_enum t)) h input pos /\
contents (parse_enum_key p (sum_enum t)) h input pos == sum_tag_of_data t (contents (parse_sum t p pc) h input pos)
))
= let _ = parse_sum_eq' t p pc (bytes_of_slice_from h input pos) in
let _ = valid_facts (parse_sum t p pc) h input pos in
let _ = valid_facts (parse_enum_key p (sum_enum t)) h input pos in
()
inline_for_extraction
let read_sum_tag
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(p32: leaf_reader p)
(destr: dep_maybe_enum_destr_t (sum_enum t) (read_enum_key_t (sum_enum t)))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: HST.Stack (sum_key t)
(requires (fun h ->
valid (parse_sum t p pc) h input pos
))
(ensures (fun h res h' ->
B.modifies B.loc_none h h' /\
res == sum_tag_of_data t (contents (parse_sum t p pc) h input pos)
))
= let h = HST.get () in
[@inline_let] let _ = valid_sum_elim_tag h t p pc input pos in
read_enum_key p32 (sum_enum t) destr input pos
inline_for_extraction
let jump_sum_aux
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(v: jumper p)
(p32: leaf_reader p)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(v_payload: ((k: sum_repr_type t)) -> Tot (jump_sum_aux_payload_t t pc (maybe_enum_key_of_repr (sum_enum t) k)))
: Tot (jumper (parse_sum t p pc))
= fun #rrel #rel input pos ->
let h = HST.get () in
[@inline_let]
let _ = valid_sum_elim h t p pc input pos in
let pos_after_tag = v input pos in
let k' = p32 input pos in
v_payload k' input pos_after_tag
inline_for_extraction
let jump_sum_aux_payload'
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (jumper (dsnd (pc x)))))
(k: maybe_enum_key (sum_enum t))
: Tot (jump_sum_aux_payload_t t pc k)
= fun #rrel #rel input pos ->
match k with
| Known k ->
[@inline_let]
let _ = synth_sum_case_injective t k in
pc32 k input pos
| _ -> 0ul // dummy, but we MUST NOT remove this branch, otherwise extraction fails
inline_for_extraction
let jump_sum_aux_payload
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (jumper (dsnd (pc x)))))
(destr: dep_maybe_enum_destr_t (sum_enum t) (jump_sum_aux_payload_t t pc))
(k: sum_repr_type t)
: Tot (jump_sum_aux_payload_t t pc (maybe_enum_key_of_repr (sum_enum t) k))
= destr (jump_sum_aux_payload_eq t pc) (jump_sum_aux_payload_if t pc) (fun _ _ -> ()) (fun _ _ _ _ -> ()) (jump_sum_aux_payload' t pc pc32) k
inline_for_extraction
let jump_sum
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(v: jumper p)
(p32: leaf_reader p)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (jumper (dsnd (pc x)))))
(destr: dep_maybe_enum_destr_t (sum_enum t) (jump_sum_aux_payload_t t pc))
: Tot (jumper (parse_sum t p pc))
= jump_sum_aux t v p32 pc (jump_sum_aux_payload t pc pc32 destr)
inline_for_extraction
let read_sum_cases'
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (leaf_reader (dsnd (pc x)))))
(k: sum_key t)
: Tot (leaf_reader (parse_sum_cases' t pc k))
= [@inline_let]
let _ = synth_sum_case_injective t k in
read_synth'
(dsnd (pc k))
(synth_sum_case t k)
(pc32 k)
()
inline_for_extraction
let read_sum_cases_t
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot Type
= leaf_reader (parse_sum_cases' t pc k)
let read_sum_cases_t_eq
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
(x y : read_sum_cases_t t pc k)
: GTot Type0
= True
inline_for_extraction
let read_sum_cases_t_if
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (if_combinator _ (read_sum_cases_t_eq t pc k))
= fun cond (sv_true: cond_true cond -> Tot (read_sum_cases_t t pc k)) (sv_false: cond_false cond -> Tot (read_sum_cases_t t pc k)) #_ #_ input pos ->
if cond
then (sv_true () input pos)
else (sv_false () input pos)
inline_for_extraction
let read_sum_cases
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (leaf_reader (dsnd (pc x)))))
(destr: dep_enum_destr (sum_enum t) (read_sum_cases_t t pc))
(k: sum_key t)
: Tot (leaf_reader (parse_sum_cases' t pc k))
= destr
_
(read_sum_cases_t_if t pc)
(fun _ _ -> ())
(fun _ _ _ _ -> ())
(read_sum_cases' t pc pc32)
k
#push-options "--z3rlimit 32"
inline_for_extraction
let read_sum
(#kt: parser_kind)
(t: sum)
(p: parser kt (sum_repr_type t))
(p32: leaf_reader (parse_enum_key p (sum_enum t)))
(j: jumper p)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (leaf_reader (dsnd (pc x)))))
(destr: dep_enum_destr (sum_enum t) (read_sum_cases_t t pc))
: Tot (leaf_reader (parse_sum t p pc))
=
fun #_ #_ input pos ->
let h = HST.get () in
valid_facts (parse_sum t p pc) h input pos;
parse_sum_eq' t p pc (bytes_of_slice_from h input pos);
valid_facts (parse_enum_key p (sum_enum t)) h input pos;
let k = p32 input pos in
let pos' = jump_enum_key j (sum_enum t) input pos in
valid_facts (parse_sum_cases' t pc k) h input pos' ;
read_sum_cases t pc pc32 destr k input pos'
#pop-options
inline_for_extraction
let serialize32_sum_cases_t
(t: sum)
(#pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(sc: ((x: sum_key t) -> Tot (serializer (dsnd (pc x)))))
(k: sum_key t)
: Tot Type
= serializer32 (serialize_sum_cases t pc sc k)
let serialize32_sum_cases_t_eq
(t: sum)
(#pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(sc: ((x: sum_key t) -> Tot (serializer (dsnd (pc x)))))
(k: sum_key t)
(x y: serialize32_sum_cases_t t sc k)
: GTot Type0
= True
inline_for_extraction
let serialize32_sum_cases_t_if
(t: sum)
(#pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(sc: ((x: sum_key t) -> Tot (serializer (dsnd (pc x)))))
(k: sum_key t)
: Tot (if_combinator _ (serialize32_sum_cases_t_eq t sc k))
= fun cond (sv_true: (cond_true cond -> Tot (serialize32_sum_cases_t t sc k))) (sv_false: (cond_false cond -> Tot (serialize32_sum_cases_t t sc k))) x #rrel #rel b pos ->
if cond
then (sv_true () x b pos)
else (sv_false () x b pos)
inline_for_extraction
let serialize32_sum_cases_aux
(t: sum)
(#pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(sc: ((x: sum_key t) -> Tot (serializer (dsnd (pc x)))))
(sc32: ((x: sum_key t) -> Tot (serializer32 (sc x))))
(k: sum_key t)
: Tot (serializer32 (serialize_sum_cases t pc sc k))
= fun x #rrel #rel b pos ->
[@inline_let] let _ =
Classical.forall_intro (parse_sum_cases_eq' t pc k);
synth_sum_case_injective t k;
synth_sum_case_inverse t k
in
serialize32_synth
(sc32 k)
(synth_sum_case t k)
(synth_sum_case_recip t k)
(fun x -> synth_sum_case_recip t k x)
()
x
b
pos
inline_for_extraction
let serialize32_sum_cases
(t: sum)
(#pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(sc: ((x: sum_key t) -> Tot (serializer (dsnd (pc x)))))
(sc32: ((x: sum_key t) -> Tot (serializer32 (sc x))))
(destr: dep_enum_destr (sum_enum t) (serialize32_sum_cases_t t sc))
(k: sum_key t)
: Tot (serializer32 (serialize_sum_cases t pc sc k))
= destr
_
(serialize32_sum_cases_t_if t sc)
(fun _ _ -> ())
(fun _ _ _ _ -> ())
(serialize32_sum_cases_aux t sc sc32)
k
inline_for_extraction
let serialize32_sum
(#kt: parser_kind)
(t: sum)
(#p: parser kt (sum_repr_type t))
(s: serializer p {kt.parser_kind_subkind == Some ParserStrong})
(s32: serializer32 (serialize_enum_key _ s (sum_enum t)))
(#pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(sc: ((x: sum_key t) -> Tot (serializer (dsnd (pc x)))))
(sc32: ((x: sum_key t) -> Tot (serializer32 (sc x))))
(destr: dep_enum_destr (sum_enum t) (serialize32_sum_cases_t t sc))
: Tot (serializer32 (serialize_sum t s sc))
= fun x #rrel #rel b pos ->
serialize_sum_eq t s sc x;
let tg = sum_tag_of_data t x in
serialize32_nondep_then_aux s32 (serialize32_sum_cases t sc sc32 destr tg) tg x b pos
let clens_sum_tag
(s: sum)
: Tot (clens (sum_type s) (sum_key s))
= {
clens_cond = (fun _ -> True);
clens_get = sum_tag_of_data s;
}
let gaccessor_sum_tag
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
: Tot (gaccessor (parse_sum t p pc) (parse_enum_key p (sum_enum t)) (clens_sum_tag t))
= gaccessor_tagged_union_tag
(parse_enum_key p (sum_enum t))
(sum_tag_of_data t)
(parse_sum_cases t pc)
inline_for_extraction
let accessor_sum_tag
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
: Tot (accessor (gaccessor_sum_tag t p pc))
= accessor_tagged_union_tag
(parse_enum_key p (sum_enum t))
(sum_tag_of_data t)
(parse_sum_cases t pc)
let clens_sum_payload
(s: sum)
(k: sum_key s)
: Tot (clens (sum_type s) (sum_type_of_tag s k))
= {
clens_cond = (fun (x: sum_type s) -> sum_tag_of_data s x == k);
clens_get = (fun (x: sum_type s) -> synth_sum_case_recip s k x <: Ghost (sum_type_of_tag s k) (requires (sum_tag_of_data s x == k)) (ensures (fun _ -> True)));
}
#push-options "--z3rlimit 32"
let gaccessor_clens_sum_payload'
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (gaccessor' (parse_sum t p pc) (dsnd (pc k)) (clens_sum_payload t k))
= fun (input: bytes) ->
parse_sum_eq'' t p pc input;
let res =
match parse p input with
| Some (_, consumed) ->
synth_sum_case_inverse t k;
synth_sum_case_injective t k;
synth_injective_synth_inverse_synth_inverse_recip (synth_sum_case t k) (synth_sum_case_recip t k) ();
(consumed)
| _ -> 0 // dummy
in
(res <: (res: _ { gaccessor_post' (parse_sum t p pc) (dsnd (pc k)) (clens_sum_payload t k) input res } ))
#push-options "--z3rlimit 64"
let gaccessor_clens_sum_payload_injective
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
(sl sl' : bytes)
: Lemma
(requires (
gaccessor_pre (parse_sum t p pc) (dsnd (pc k)) (clens_sum_payload t k) sl /\
gaccessor_pre (parse_sum t p pc) (dsnd (pc k)) (clens_sum_payload t k) sl' /\
injective_precond (parse_sum t p pc) sl sl'
))
(ensures (gaccessor_clens_sum_payload' t p pc k sl == gaccessor_clens_sum_payload' t p pc k sl'))
= parse_sum_eq'' t p pc sl;
parse_sum_eq'' t p pc sl' ;
parse_injective (parse_sum t p pc) sl sl' ;
parse_injective p sl sl'
#pop-options
let gaccessor_clens_sum_payload_no_lookahead
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
(sl sl' : bytes)
: Lemma
(requires (
(parse_sum_kind kt t pc).parser_kind_subkind == Some ParserStrong /\
gaccessor_pre (parse_sum t p pc) (dsnd (pc k)) (clens_sum_payload t k) sl /\
gaccessor_pre (parse_sum t p pc) (dsnd (pc k)) (clens_sum_payload t k) sl' /\
no_lookahead_on_precond (parse_sum t p pc) sl sl'
))
(ensures (gaccessor_clens_sum_payload' t p pc k sl == gaccessor_clens_sum_payload' t p pc k sl'))
= parse_sum_eq'' t p pc sl;
parse_sum_eq'' t p pc sl' ;
parse_strong_prefix (parse_sum t p pc) sl sl' ;
parse_injective p sl sl'
let gaccessor_clens_sum_payload
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (gaccessor (parse_sum t p pc) (dsnd (pc k)) (clens_sum_payload t k))
= Classical.forall_intro_2 (fun x -> Classical.move_requires (gaccessor_clens_sum_payload_injective t p pc k x));
Classical.forall_intro_2 (fun x -> Classical.move_requires (gaccessor_clens_sum_payload_no_lookahead t p pc k x));
gaccessor_prop_equiv (parse_sum t p pc) (dsnd (pc k)) (clens_sum_payload t k) (gaccessor_clens_sum_payload' t p pc k);
gaccessor_clens_sum_payload' t p pc k
inline_for_extraction
let accessor_clens_sum_payload'
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(j: jumper p)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: HST.Stack U32.t
(requires (fun h ->
valid (parse_sum t p pc) h input pos /\
(clens_sum_payload t k).clens_cond (contents (parse_sum t p pc) h input pos)
))
(ensures (fun h pos' h' ->
B.modifies B.loc_none h h' /\
pos' == slice_access h (gaccessor_clens_sum_payload t p pc k) input pos
))
=
let h = HST.get () in
[@inline_let]
let _ =
let pos' = get_valid_pos (parse_sum t p pc) h input pos in
let large = bytes_of_slice_from h input pos in
slice_access_eq h (gaccessor_clens_sum_payload t p pc k) input pos;
valid_facts (parse_sum t p pc) h input pos;
parse_sum_eq'' t p pc large;
valid_facts p h input pos
in
j input pos
#pop-options
inline_for_extraction
let accessor_clens_sum_payload
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(j: jumper p)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (accessor (gaccessor_clens_sum_payload t p pc k))
= fun #rrel #rel -> accessor_clens_sum_payload' t j pc k #rrel #rel
let clens_sum_cases_payload
(s: sum)
(k: sum_key s)
: Tot (clens (sum_cases s k) (sum_type_of_tag s k))
= {
clens_cond = (fun (x: sum_cases s k) -> True);
clens_get = (fun (x: sum_cases s k) -> synth_sum_case_recip s k x <: Ghost (sum_type_of_tag s k) (requires (True)) (ensures (fun _ -> True)));
}
let gaccessor_clens_sum_cases_payload
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (gaccessor (parse_sum_cases' t pc k) (dsnd (pc k)) (clens_sum_cases_payload t k))
= synth_sum_case_injective t k;
synth_sum_case_inverse t k;
synth_injective_synth_inverse_synth_inverse_recip (synth_sum_case t k) (synth_sum_case_recip t k) ();
gaccessor_ext
(gaccessor_synth (dsnd (pc k)) (synth_sum_case t k) (synth_sum_case_recip t k) ())
(clens_sum_cases_payload t k)
()
inline_for_extraction
let accessor_clens_sum_cases_payload
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (accessor (gaccessor_clens_sum_cases_payload t pc k))
= [@inline_let]
let _ =
synth_sum_case_injective t k;
synth_sum_case_inverse t k;
synth_injective_synth_inverse_synth_inverse_recip (synth_sum_case t k) (synth_sum_case_recip t k) ()
in
accessor_ext
(accessor_synth (dsnd (pc k)) (synth_sum_case t k) (synth_sum_case_recip t k) ())
(clens_sum_cases_payload t k)
()
inline_for_extraction
let validate_dsum_cases_t
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(#k: parser_kind)
(g: parser k (dsum_type_of_unknown_tag s))
(x: dsum_key s)
: Tot Type
= validator (parse_dsum_cases' s f g x)
let validate_dsum_cases_eq
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(#k: parser_kind)
(g: parser k (dsum_type_of_unknown_tag s))
(x: dsum_key s)
(v1 v2 : validate_dsum_cases_t s f g x)
: GTot Type0
= True
inline_for_extraction
let validate_dsum_cases_if'
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(#k: parser_kind)
(g: parser k (dsum_type_of_unknown_tag s))
(x: dsum_key s)
(cond: bool)
(ift: (cond_true cond -> Tot (validate_dsum_cases_t s f g x)))
(iff: (cond_false cond -> Tot (validate_dsum_cases_t s f g x)))
: Tot (validate_dsum_cases_t s f g x)
= fun #rrel #rel input len ->
if cond
then (ift () <: validate_dsum_cases_t s f g x) input len
else (iff () <: validate_dsum_cases_t s f g x) input len
inline_for_extraction
let validate_dsum_cases_if
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(#k: parser_kind)
(g: parser k (dsum_type_of_unknown_tag s))
(x: dsum_key s)
: Tot (if_combinator _ (validate_dsum_cases_eq s f g x))
= validate_dsum_cases_if' s f g x
inline_for_extraction
let validate_dsum_cases'
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(f' : (x: dsum_known_key s) -> Tot (validator (dsnd (f x))))
(#k: parser_kind)
(#g: parser k (dsum_type_of_unknown_tag s))
(g' : validator g)
(x: dsum_key s)
: Tot (validate_dsum_cases_t s f g x)
= [@inline_let]
let _ = synth_dsum_case_injective s x in
match x with
| Known x' -> validate_synth (f' x') (synth_dsum_case s (Known x')) () <: validator (parse_dsum_cases' s f g x)
| Unknown x' -> validate_synth g' (synth_dsum_case s (Unknown x')) () <: validator (parse_dsum_cases' s f g x)
inline_for_extraction
let validate_dsum_cases'_destr
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(f' : (x: dsum_known_key s) -> Tot (validator (dsnd (f x))))
(#k: parser_kind)
(#g: parser k (dsum_type_of_unknown_tag s))
(g' : validator g)
(destr: dep_enum_destr _ (fun k -> validate_dsum_cases_t s f g (Known k)))
(x: dsum_key s)
: Tot (validate_dsum_cases_t s f g x)
= fun #rrel #rel input pos ->
match x with
| Known k ->
destr
_
(fun k -> validate_dsum_cases_if s f g (Known k))
(fun _ _ -> ())
(fun _ _ _ _ -> ())
(fun k -> validate_dsum_cases' s f f' g' (Known k))
k
input
pos
| Unknown r -> validate_dsum_cases' s f f' g' (Unknown r) input pos
inline_for_extraction
let validate_dsum_cases
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(f' : (x: dsum_known_key s) -> Tot (validator (dsnd (f x))))
(#k: parser_kind)
(#g: parser k (dsum_type_of_unknown_tag s))
(g' : validator g)
(destr: dep_enum_destr _ (fun k -> validate_dsum_cases_t s f g (Known k)))
(x: dsum_key s)
: Tot (validator (parse_dsum_cases s f g x))
= fun #rrel #rel input pos ->
let h = HST.get () in
[@inline_let]
let _ =
valid_facts (parse_dsum_cases' s f g x) h input (uint64_to_uint32 pos);
valid_facts (parse_dsum_cases s f g x) h input (uint64_to_uint32 pos);
parse_dsum_cases_eq' s f g x (bytes_of_slice_from h input (uint64_to_uint32 pos))
in
validate_dsum_cases'_destr s f f' g' destr x input pos
#push-options "--z3rlimit 40"
inline_for_extraction
let validate_dsum
(#kt: parser_kind)
(t: dsum)
(#p: parser kt (dsum_repr_type t))
(v: validator p)
(p32: leaf_reader p)
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(f32: (x: dsum_known_key t) -> Tot (validator (dsnd (f x))))
(#k': parser_kind)
(#g: parser k' (dsum_type_of_unknown_tag t))
(g32: validator g)
(destr: dep_maybe_enum_destr_t (dsum_enum t) (validate_dsum_cases_t t f g))
: Tot (validator (parse_dsum t p f g))
= fun #rrel #rel input pos ->
let h = HST.get () in
[@inline_let]
let _ = parse_dsum_eq' t p f g (bytes_of_slice_from h input (uint64_to_uint32 pos)) in
[@inline_let]
let _ = valid_facts (parse_dsum t p f g) h input (uint64_to_uint32 pos) in
[@inline_let]
let _ = valid_facts p h input (uint64_to_uint32 pos) in
let pos_after_tag = v input pos in
if is_error pos_after_tag
then pos_after_tag
else
let tg = p32 input (uint64_to_uint32 pos) in
[@inline_let]
let _ = valid_facts (parse_dsum_cases' t f g (maybe_enum_key_of_repr (dsum_enum t) tg)) h input (uint64_to_uint32 pos_after_tag) in
destr (validate_dsum_cases_eq t f g) (validate_dsum_cases_if t f g) (fun _ _ -> ()) (fun _ _ _ _ -> ()) (validate_dsum_cases' t f f32 g32) tg input pos_after_tag
#pop-options
#reset-options "--z3rlimit 64 --z3cliopt smt.arith.nl=false --initial_ifuel 8 --max_ifuel 8 --initial_fuel 2 --max_fuel 2"
let valid_dsum_intro_known
(h: HS.mem)
(t: dsum)
(#kt: parser_kind)
(p: parser kt (dsum_repr_type t))
(f: ((x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x))))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: Lemma
(requires (
valid (parse_maybe_enum_key p (dsum_enum t)) h input pos /\ (
let k' = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
Known? k' /\ (
let Known k = k' in
valid (dsnd (f k)) h input (get_valid_pos (parse_maybe_enum_key p (dsum_enum t)) h input pos)
))))
(ensures (
let Known k = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
let pos_payload = get_valid_pos (parse_maybe_enum_key p (dsum_enum t)) h input pos in
valid_content_pos
(parse_dsum t p f g) h input pos
(synth_dsum_case t (Known k) (contents (dsnd (f k)) h input pos_payload))
(get_valid_pos (dsnd (f k)) h input pos_payload)
))
= valid_facts (parse_maybe_enum_key p (dsum_enum t)) h input pos;
let Known k = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
let pos_payload = get_valid_pos (parse_maybe_enum_key p (dsum_enum t)) h input pos in
valid_facts (dsnd (f k)) h input pos_payload;
valid_facts (parse_dsum t p f g) h input pos;
parse_dsum_eq t p f g (bytes_of_slice_from h input pos)
let valid_dsum_intro_unknown
(h: HS.mem)
(t: dsum)
(#kt: parser_kind)
(p: parser kt (dsum_repr_type t))
(f: ((x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x))))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: Lemma
(requires (
valid (parse_maybe_enum_key p (dsum_enum t)) h input pos /\ (
let k' = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
Unknown? k' /\
valid g h input (get_valid_pos (parse_maybe_enum_key p (dsum_enum t)) h input pos)
)))
(ensures (
let Unknown r = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
let pos_payload = get_valid_pos (parse_maybe_enum_key p (dsum_enum t)) h input pos in
valid_content_pos
(parse_dsum t p f g) h input pos
(synth_dsum_case t (Unknown r) (contents g h input pos_payload))
(get_valid_pos g h input pos_payload)
))
= valid_facts (parse_maybe_enum_key p (dsum_enum t)) h input pos;
let Unknown r = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
let pos_payload = get_valid_pos (parse_maybe_enum_key p (dsum_enum t)) h input pos in
valid_facts g h input pos_payload;
valid_facts (parse_dsum t p f g) h input pos;
parse_dsum_eq t p f g (bytes_of_slice_from h input pos)
#reset-options
inline_for_extraction
let finalize_dsum_case_known
(t: dsum)
(#kt: parser_kind)
(#p: parser kt (dsum_repr_type t))
(s: serializer p)
(w: leaf_writer_strong s)
(f: ((x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x))))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
(destr: enum_repr_of_key'_t (dsum_enum t))
(k: dsum_known_key t)
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: HST.Stack unit
(requires (fun h ->
let len_tag = serialized_length (serialize_enum_key _ s (dsum_enum t)) k in
U32.v pos + len_tag < 4294967296 /\ (
let pos_payload = pos `U32.add` U32.uint_to_t len_tag in
valid (dsnd (f k)) h input pos_payload /\
writable input.base (U32.v pos) (U32.v pos_payload) h
)))
(ensures (fun h _ h' ->
let len_tag = serialized_length (serialize_enum_key _ s (dsum_enum t)) k in
let pos_payload = pos `U32.add` U32.uint_to_t len_tag in
B.modifies (loc_slice_from_to input pos pos_payload) h h' /\
valid_content_pos (parse_dsum t p f g) h' input pos (synth_dsum_case t (Known k) (contents (dsnd (f k)) h input pos_payload)) (get_valid_pos (dsnd (f k)) h input pos_payload)
))
= let pos1 = write_enum_key w (dsum_enum t) destr k input pos in
let h = HST.get () in
[@inline_let]
let _ =
valid_facts (parse_enum_key p (dsum_enum t)) h input pos;
valid_facts (parse_maybe_enum_key p (dsum_enum t)) h input pos;
let sq = bytes_of_slice_from h input pos in
parse_enum_key_eq p (dsum_enum t) sq;
parse_maybe_enum_key_eq p (dsum_enum t) sq;
valid_dsum_intro_known h t p f g input pos
in
()
inline_for_extraction
let finalize_dsum_case_unknown
(t: dsum)
(#kt: parser_kind)
(#p: parser kt (dsum_repr_type t))
(s: serializer p)
(w: leaf_writer_strong s)
(f: ((x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x))))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
(r: unknown_enum_repr (dsum_enum t))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: HST.Stack unit
(requires (fun h ->
let len_tag = serialized_length s r in
U32.v pos + len_tag < 4294967296 /\ (
let pos_payload = pos `U32.add` U32.uint_to_t len_tag in
valid g h input pos_payload /\
writable input.base (U32.v pos) (U32.v pos_payload) h
)))
(ensures (fun h _ h' ->
let len_tag = serialized_length s r in
let pos_payload = pos `U32.add` U32.uint_to_t len_tag in
B.modifies (loc_slice_from_to input pos pos_payload) h h' /\
valid_content_pos (parse_dsum t p f g) h' input pos (synth_dsum_case t (Unknown r) (contents g h input pos_payload)) (get_valid_pos g h input pos_payload)
))
= let pos1 = w r input pos in
let h = HST.get () in
[@inline_let]
let _ =
valid_facts (parse_maybe_enum_key p (dsum_enum t)) h input pos;
valid_facts p h input pos;
let sq = bytes_of_slice_from h input pos in
parse_maybe_enum_key_eq p (dsum_enum t) sq;
valid_dsum_intro_unknown h t p f g input pos
in
()
let valid_dsum_elim_tag
(h: HS.mem)
(t: dsum)
(#kt: parser_kind)
(p: parser kt (dsum_repr_type t))
(f: ((x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x))))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: Lemma
(requires (
valid (parse_dsum t p f g) h input pos
))
(ensures (
valid (parse_maybe_enum_key p (dsum_enum t)) h input pos /\
contents (parse_maybe_enum_key p (dsum_enum t)) h input pos == dsum_tag_of_data t (contents (parse_dsum t p f g) h input pos)
))
= let _ = parse_dsum_eq_ t p f g (bytes_of_slice_from h input pos) in
let _ = valid_facts (parse_dsum t p f g) h input pos in
let _ = valid_facts (parse_maybe_enum_key p (dsum_enum t)) h input pos in
()
inline_for_extraction
let read_dsum_tag
(t: dsum)
(#kt: parser_kind)
(#p: parser kt (dsum_repr_type t))
(p32: leaf_reader p)
(destr: maybe_enum_destr_t (maybe_enum_key (dsum_enum t)) (dsum_enum t))
(f: ((x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x))))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: HST.Stack (dsum_key t)
(requires (fun h ->
valid (parse_dsum t p f g) h input pos
))
(ensures (fun h res h' ->
B.modifies B.loc_none h h' /\
res == dsum_tag_of_data t (contents (parse_dsum t p f g) h input pos)
))
= let h = HST.get () in
[@inline_let] let _ = valid_dsum_elim_tag h t p f g input pos in
read_maybe_enum_key p32 (dsum_enum t) destr input pos
#push-options "--z3rlimit 32"
let valid_dsum_elim_known
(h: HS.mem)
(t: dsum)
(#kt: parser_kind)
(p: parser kt (dsum_repr_type t))
(f: ((x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x))))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: Lemma
(requires (
valid (parse_dsum t p f g) h input pos /\
Known? (dsum_tag_of_data t (contents (parse_dsum t p f g) h input pos))
))
(ensures (
valid (parse_maybe_enum_key p (dsum_enum t)) h input pos /\ (
let k' = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
let pos_payload = get_valid_pos (parse_maybe_enum_key p (dsum_enum t)) h input pos in
Known? k' /\ (
let Known k = k' in
valid (dsnd (f k)) h input pos_payload /\
valid_content_pos
(parse_dsum t p f g) h input pos
(synth_dsum_case t (Known k) (contents (dsnd (f k)) h input pos_payload))
(get_valid_pos (dsnd (f k)) h input pos_payload)
))))
=
valid_facts (parse_dsum t p f g) h input pos;
parse_dsum_eq t p f g (bytes_of_slice_from h input pos);
valid_facts (parse_maybe_enum_key p (dsum_enum t)) h input pos;
let Known k = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
let pos_payload = get_valid_pos (parse_maybe_enum_key p (dsum_enum t)) h input pos in
valid_facts (dsnd (f k)) h input pos_payload
#pop-options
let valid_dsum_elim_unknown
(h: HS.mem)
(t: dsum)
(#kt: parser_kind)
(p: parser kt (dsum_repr_type t))
(f: ((x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x))))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: Lemma
(requires (
valid (parse_dsum t p f g) h input pos /\
Unknown? (dsum_tag_of_data t (contents (parse_dsum t p f g) h input pos))
))
(ensures (
valid (parse_maybe_enum_key p (dsum_enum t)) h input pos /\ (
let k' = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
let pos_payload = get_valid_pos (parse_maybe_enum_key p (dsum_enum t)) h input pos in
Unknown? k' /\ (
let Unknown r = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
valid g h input pos_payload /\
valid_content_pos
(parse_dsum t p f g) h input pos
(synth_dsum_case t (Unknown r) (contents g h input pos_payload))
(get_valid_pos g h input pos_payload)
))))
=
valid_facts (parse_dsum t p f g) h input pos;
parse_dsum_eq t p f g (bytes_of_slice_from h input pos);
valid_facts (parse_maybe_enum_key p (dsum_enum t)) h input pos;
let Unknown r = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
let pos_payload = get_valid_pos (parse_maybe_enum_key p (dsum_enum t)) h input pos in
valid_facts g h input pos_payload
inline_for_extraction
let jump_dsum_cases_t
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(#k: parser_kind)
(g: parser k (dsum_type_of_unknown_tag s))
(x: dsum_key s)
: Tot Type
= jumper (parse_dsum_cases' s f g x)
let jump_dsum_cases_eq
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(#k: parser_kind)
(g: parser k (dsum_type_of_unknown_tag s))
(x: dsum_key s)
(v1 v2 : jump_dsum_cases_t s f g x)
: GTot Type0
= True
inline_for_extraction
let jump_dsum_cases_if'
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(#k: parser_kind)
(g: parser k (dsum_type_of_unknown_tag s))
(x: dsum_key s)
(cond: bool)
(ift: (cond_true cond -> Tot (jump_dsum_cases_t s f g x)))
(iff: (cond_false cond -> Tot (jump_dsum_cases_t s f g x)))
: Tot (jump_dsum_cases_t s f g x)
= fun #rrel #rel input len ->
if cond
then (ift () <: jump_dsum_cases_t s f g x) input len
else (iff () <: jump_dsum_cases_t s f g x) input len
inline_for_extraction
let jump_dsum_cases_if
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(#k: parser_kind)
(g: parser k (dsum_type_of_unknown_tag s))
(x: dsum_key s)
: Tot (if_combinator _ (jump_dsum_cases_eq s f g x))
= jump_dsum_cases_if' s f g x
inline_for_extraction
let jump_dsum_cases'
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(f' : (x: dsum_known_key s) -> Tot (jumper (dsnd (f x))))
(#k: parser_kind)
(#g: parser k (dsum_type_of_unknown_tag s))
(g' : jumper g)
(x: dsum_key s)
: Tot (jump_dsum_cases_t s f g x)
= synth_dsum_case_injective s x;
match x with
| Known x' -> jump_synth (f' x') (synth_dsum_case s (Known x')) () <: jumper (parse_dsum_cases' s f g x)
| Unknown x' -> jump_synth g' (synth_dsum_case s (Unknown x')) () <: jumper (parse_dsum_cases' s f g x)
inline_for_extraction
let jump_dsum_cases'_destr
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(f' : (x: dsum_known_key s) -> Tot (jumper (dsnd (f x))))
(#k: parser_kind)
(#g: parser k (dsum_type_of_unknown_tag s))
(g' : jumper g)
(destr: dep_enum_destr _ (fun k -> jump_dsum_cases_t s f g (Known k)))
(x: dsum_key s)
: Tot (jump_dsum_cases_t s f g x)
= fun #rrel #rel input pos ->
match x with
| Known k ->
destr
_
(fun k -> jump_dsum_cases_if s f g (Known k))
(fun _ _ -> ())
(fun _ _ _ _ -> ())
(fun k -> jump_dsum_cases' s f f' g' (Known k))
k
input
pos
| Unknown r -> jump_dsum_cases' s f f' g' (Unknown r) input pos
inline_for_extraction
let jump_dsum_cases
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(f' : (x: dsum_known_key s) -> Tot (jumper (dsnd (f x))))
(#k: parser_kind)
(#g: parser k (dsum_type_of_unknown_tag s))
(g' : jumper g)
(destr: dep_enum_destr _ (fun k -> jump_dsum_cases_t s f g (Known k)))
(x: dsum_key s)
: Tot (jumper (parse_dsum_cases s f g x))
= fun #rrel #rel input pos ->
let h = HST.get () in
[@inline_let]
let _ =
valid_facts (parse_dsum_cases' s f g x) h input pos;
valid_facts (parse_dsum_cases s f g x) h input pos;
parse_dsum_cases_eq' s f g x (bytes_of_slice_from h input pos)
in
jump_dsum_cases'_destr s f f' g' destr x input pos
#push-options "--z3rlimit 16"
inline_for_extraction
let jump_dsum
(#kt: parser_kind)
(t: dsum)
(#p: parser kt (dsum_repr_type t))
(v: jumper p)
(p32: leaf_reader p)
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(f32: (x: dsum_known_key t) -> Tot (jumper (dsnd (f x))))
(#k': parser_kind)
(#g: parser k' (dsum_type_of_unknown_tag t))
(g32: jumper g)
(destr: dep_maybe_enum_destr_t (dsum_enum t) (jump_dsum_cases_t t f g))
: Tot (jumper (parse_dsum t p f g))
= fun #rrel #rel input pos ->
let h = HST.get () in
[@inline_let]
let _ = parse_dsum_eq' t p f g (bytes_of_slice_from h input pos) in
[@inline_let]
let _ = valid_facts (parse_dsum t p f g) h input pos in
[@inline_let]
let _ = valid_facts p h input pos in
let pos_after_tag = v input pos in
let tg = p32 input pos in
[@inline_let]
let _ = valid_facts (parse_dsum_cases' t f g (maybe_enum_key_of_repr (dsum_enum t) tg)) h input pos_after_tag in
destr (jump_dsum_cases_eq t f g) (jump_dsum_cases_if t f g) (fun _ _ -> ()) (fun _ _ _ _ -> ()) (jump_dsum_cases' t f f32 g32) tg input pos_after_tag
#pop-options
inline_for_extraction
let read_dsum_cases'
(t: dsum)
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(f32: (x: dsum_known_key t) -> Tot (leaf_reader (dsnd (f x))))
(#k': parser_kind)
(g: parser k' (dsum_type_of_unknown_tag t))
(g32: leaf_reader g)
(x: dsum_key t)
: Tot (leaf_reader (parse_dsum_cases' t f g x))
= fun #rrel #rel input pos ->
[@inline_let]
let _ = synth_dsum_case_injective t x in
match x with
| Known x' ->
read_synth'
(dsnd (f x'))
(synth_dsum_case t (Known x'))
(f32 x')
()
input
pos
| Unknown x' ->
read_synth'
g
(synth_dsum_case t (Unknown x'))
g32
()
input
pos
inline_for_extraction
let read_dsum_cases_t
(t: dsum)
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(#k': parser_kind)
(g: parser k' (dsum_type_of_unknown_tag t))
(k: dsum_known_key t)
: Tot Type
= leaf_reader (parse_dsum_cases' t f g (Known k))
let read_dsum_cases_t_eq
(t: dsum)
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(#k': parser_kind)
(g: parser k' (dsum_type_of_unknown_tag t))
(k: dsum_known_key t)
(x y : read_dsum_cases_t t f g k)
: GTot Type0
= True
inline_for_extraction
let read_dsum_cases_t_if
(t: dsum)
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(#k': parser_kind)
(g: parser k' (dsum_type_of_unknown_tag t))
(k: dsum_known_key t)
: Tot (if_combinator _ (read_dsum_cases_t_eq t f g k))
= fun cond (sv_true: cond_true cond -> Tot (read_dsum_cases_t t f g k)) (sv_false: cond_false cond -> Tot (read_dsum_cases_t t f g k)) #_ #_ input pos ->
if cond
then sv_true () input pos
else sv_false () input pos
inline_for_extraction
let read_dsum_cases
(t: dsum)
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(f32: (x: dsum_known_key t) -> Tot (leaf_reader (dsnd (f x))))
(#k': parser_kind)
(g: parser k' (dsum_type_of_unknown_tag t))
(g32: leaf_reader g)
(destr: dep_enum_destr _ (read_dsum_cases_t t f g))
(x: dsum_key t)
: Tot (leaf_reader (parse_dsum_cases' t f g x))
= fun #_ #_ input pos ->
match x with
| Known k ->
destr
_
(read_dsum_cases_t_if t f g)
(fun _ _ -> ())
(fun _ _ _ _ -> ())
(fun k -> read_dsum_cases' t f f32 g g32 (Known k))
k
input
pos
| Unknown r ->
read_dsum_cases' t f f32 g g32 (Unknown r) input pos
#push-options "--z3rlimit 16"
inline_for_extraction
let read_dsum
(#kt: parser_kind)
(t: dsum)
(#p: parser kt (dsum_repr_type t))
(p32: leaf_reader (parse_maybe_enum_key p (dsum_enum t)))
(j: jumper p)
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(f32: (x: dsum_known_key t) -> Tot (leaf_reader (dsnd (f x))))
(#k': parser_kind)
(#g: parser k' (dsum_type_of_unknown_tag t))
(g32: leaf_reader g)
(destr: dep_enum_destr _ (read_dsum_cases_t t f g))
: Tot (leaf_reader (parse_dsum t p f g))
= fun #_ #_ input pos ->
let h = HST.get () in
valid_facts (parse_dsum t p f g) h input pos;
parse_dsum_eq_ t p f g (bytes_of_slice_from h input pos);
valid_facts (parse_maybe_enum_key p (dsum_enum t)) h input pos;
let k = p32 input pos in
let pos' = jump_maybe_enum_key j (dsum_enum t) input pos in
valid_facts (parse_dsum_cases' t f g k) h input pos' ;
read_dsum_cases t f f32 g g32 destr k input pos'
#pop-options
inline_for_extraction
let serialize32_dsum_type_of_tag
(t: dsum)
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(sf: (x: dsum_known_key t) -> Tot (serializer (dsnd (f x))))
(sf32: (x: dsum_known_key t) -> Tot (serializer32 (sf x)))
(#k': parser_kind)
(#g: parser k' (dsum_type_of_unknown_tag t))
(#sg: serializer g)
(sg32: serializer32 sg)
(tg: dsum_key t)
: Tot (serializer32 (serialize_dsum_type_of_tag t f sf g sg tg))
= match tg with
| Known x' -> serialize32_ext (dsnd (f x')) (sf x') (sf32 x') (parse_dsum_type_of_tag t f g tg) ()
| Unknown x' -> serialize32_ext g sg sg32 (parse_dsum_type_of_tag t f g tg) ()
inline_for_extraction
let serialize32_dsum_cases_aux
(t: dsum)
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(sf: (x: dsum_known_key t) -> Tot (serializer (dsnd (f x))))
(sf32: (x: dsum_known_key t) -> Tot (serializer32 (sf x)))
(#k': parser_kind)
(#g: parser k' (dsum_type_of_unknown_tag t))
(#sg: serializer g)
(sg32: serializer32 sg)
(tg: dsum_key t)
: Tot (serializer32 (serialize_dsum_cases t f sf g sg tg))
= [@inline_let]
let _ = synth_dsum_case_injective t tg in
[@inline_let]
let _ = synth_dsum_case_inverse t tg in
serialize32_synth
(serialize32_dsum_type_of_tag t f sf sf32 sg32 tg)
(synth_dsum_case t tg)
(synth_dsum_case_recip t tg)
(fun x -> synth_dsum_case_recip t tg x)
()
inline_for_extraction
let serialize32_dsum_cases_t
(t: dsum)
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(sf: (x: dsum_known_key t) -> Tot (serializer (dsnd (f x))))
(#k': parser_kind)
(g: parser k' (dsum_type_of_unknown_tag t))
(sg: serializer g)
(k: dsum_known_key t)
: Tot Type
= serializer32 (serialize_dsum_cases t f sf g sg (Known k))
let serialize32_dsum_cases_t_eq
(t: dsum)
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(sf: (x: dsum_known_key t) -> Tot (serializer (dsnd (f x))))
(#k': parser_kind)
(g: parser k' (dsum_type_of_unknown_tag t))
(sg: serializer g)
(k: dsum_known_key t)
(x y: serialize32_dsum_cases_t t f sf g sg k)
: GTot Type0
= True
inline_for_extraction
let serialize32_dsum_cases_t_if
(t: dsum)
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(sf: (x: dsum_known_key t) -> Tot (serializer (dsnd (f x))))
(#k': parser_kind)
(g: parser k' (dsum_type_of_unknown_tag t))
(sg: serializer g)
(k: dsum_known_key t)
: Tot (if_combinator _ (serialize32_dsum_cases_t_eq t f sf g sg k))
= fun cond (sv_true: (cond_true cond -> Tot (serialize32_dsum_cases_t t f sf g sg k))) (sv_false: (cond_false cond -> Tot (serialize32_dsum_cases_t t f sf g sg k))) x #rrel #rel output pos ->
if cond
then (sv_true () x output pos)
else (sv_false () x output pos)
inline_for_extraction
let serialize32_dsum_cases
(t: dsum)
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(sf: (x: dsum_known_key t) -> Tot (serializer (dsnd (f x))))
(sf32: (x: dsum_known_key t) -> Tot (serializer32 (sf x)))
(#k': parser_kind)
(#g: parser k' (dsum_type_of_unknown_tag t))
(#sg: serializer g)
(sg32: serializer32 sg)
(destr: dep_enum_destr _ (serialize32_dsum_cases_t t f sf g sg))
(tg: dsum_key t)
: Tot (serializer32 (serialize_dsum_cases t f sf g sg tg))
= fun x #rrel #rel output pos ->
match tg with
| Known k ->
destr
_
(serialize32_dsum_cases_t_if t f sf g sg)
(fun _ _ -> ())
(fun _ _ _ _ -> ())
(fun k -> serialize32_dsum_cases_aux t f sf sf32 sg32 (Known k))
k
x
output
pos
| Unknown r ->
serialize32_dsum_cases_aux t f sf sf32 sg32 (Unknown r) x output pos
inline_for_extraction
let serialize32_dsum
(#kt: parser_kind)
(t: dsum)
(#p: parser kt (dsum_repr_type t))
(s: serializer p {kt.parser_kind_subkind == Some ParserStrong})
(s32: serializer32 (serialize_maybe_enum_key _ s (dsum_enum t)))
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(sf: (x: dsum_known_key t) -> Tot (serializer (dsnd (f x))))
(sf32: (x: dsum_known_key t) -> Tot (serializer32 (sf x)))
(#k': parser_kind)
(#g: parser k' (dsum_type_of_unknown_tag t))
(#sg: serializer g)
(sg32: serializer32 sg)
(destr: dep_enum_destr _ (serialize32_dsum_cases_t t f sf g sg))
: Tot (serializer32 (serialize_dsum t s f sf g sg))
= fun x #_ #_ output pos ->
[@inline_let]
let _ = serialize_dsum_eq' t s f sf g sg x in
let tg = dsum_tag_of_data t x in
serialize32_nondep_then_aux
s32
(serialize32_dsum_cases t f sf sf32 sg32 destr tg)
tg
x
output
pos
let clens_dsum_tag
(s: dsum)
: Tot (clens (dsum_type s) (dsum_key s))
= {
clens_cond = (fun _ -> True);
clens_get = dsum_tag_of_data s;
}
let gaccessor_dsum_tag
(#kt: parser_kind)
(t: dsum)
(p: parser kt (dsum_repr_type t))
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
: Tot (gaccessor (parse_dsum t p f g) (parse_maybe_enum_key p (dsum_enum t)) (clens_dsum_tag t))
= gaccessor_tagged_union_tag
(parse_maybe_enum_key p (dsum_enum t))
(dsum_tag_of_data t)
(parse_dsum_cases t f g)
inline_for_extraction
let accessor_dsum_tag
(#kt: parser_kind)
(t: dsum)
(p: parser kt (dsum_repr_type t))
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
: Tot (accessor (gaccessor_dsum_tag t p f g))
= accessor_tagged_union_tag
(parse_maybe_enum_key p (dsum_enum t))
(dsum_tag_of_data t)
(parse_dsum_cases t f g)
let clens_dsum_payload
(s: dsum)
(k: dsum_key s)
: Tot (clens (dsum_type s) (dsum_type_of_tag s k))
= {
clens_cond = (fun (x: dsum_type s) -> dsum_tag_of_data s x == k);
clens_get = (fun (x: dsum_type s) -> synth_dsum_case_recip s k x <: Ghost (dsum_type_of_tag s k) (requires (dsum_tag_of_data s x == k)) (ensures (fun _ -> True)));
}
let clens_dsum_unknown_payload
(s: dsum)
: Tot (clens (dsum_type s) (dsum_type_of_unknown_tag s))
= {
clens_cond = (fun (x: dsum_type s) -> Unknown? (dsum_tag_of_data s x));
clens_get = (fun (x: dsum_type s) -> synth_dsum_case_recip s (dsum_tag_of_data s x) x <: Ghost (dsum_type_of_unknown_tag s) (requires (Unknown? (dsum_tag_of_data s x))) (ensures (fun _ -> True)));
}
#push-options "--z3rlimit 16"
let gaccessor_clens_dsum_payload'
(#kt: parser_kind)
(t: dsum)
(p: parser kt (dsum_repr_type t))
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
(k: dsum_key t)
: Tot (gaccessor' (parse_dsum t p f g) (parse_dsum_type_of_tag' t f g k) (clens_dsum_payload t k))
= fun (input: bytes) ->
parse_dsum_eq3 t p f g input;
let res =
match parse p input with
| Some (_, consumed) ->
synth_dsum_case_inverse t k;
synth_dsum_case_injective t k;
synth_injective_synth_inverse_synth_inverse_recip (synth_dsum_case t k) (synth_dsum_case_recip t k) ();
(consumed)
| _ -> (0) // dummy
in
(res <: (res: _ { gaccessor_post' (parse_dsum t p f g) (parse_dsum_type_of_tag' t f g k) (clens_dsum_payload t k) input res } ))
let gaccessor_clens_dsum_payload_injective
(#kt: parser_kind)
(t: dsum)
(p: parser kt (dsum_repr_type t))
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
(k: dsum_key t)
(sl sl' : bytes)
: Lemma
(requires (
gaccessor_pre (parse_dsum t p f g) (parse_dsum_type_of_tag' t f g k) (clens_dsum_payload t k) sl /\
gaccessor_pre (parse_dsum t p f g) (parse_dsum_type_of_tag' t f g k) (clens_dsum_payload t k) sl' /\
injective_precond (parse_dsum t p f g) sl sl'
))
(ensures (
gaccessor_clens_dsum_payload' t p f g k sl == gaccessor_clens_dsum_payload' t p f g k sl'
))
=
parse_dsum_eq3 t p f g sl;
parse_dsum_eq3 t p f g sl';
parse_injective (parse_dsum t p f g) sl sl' ;
parse_injective p sl sl'
let gaccessor_clens_dsum_payload_no_lookahead
(#kt: parser_kind)
(t: dsum)
(p: parser kt (dsum_repr_type t))
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
(k: dsum_key t)
(sl sl' : bytes)
: Lemma
(requires (
(parse_dsum_kind kt t f ku).parser_kind_subkind == Some ParserStrong /\
gaccessor_pre (parse_dsum t p f g) (parse_dsum_type_of_tag' t f g k) (clens_dsum_payload t k) sl /\
gaccessor_pre (parse_dsum t p f g) (parse_dsum_type_of_tag' t f g k) (clens_dsum_payload t k) sl' /\
no_lookahead_on_precond (parse_dsum t p f g) sl sl'
))
(ensures (
gaccessor_clens_dsum_payload' t p f g k sl == gaccessor_clens_dsum_payload' t p f g k sl'
))
= parse_dsum_eq3 t p f g sl;
parse_dsum_eq3 t p f g sl';
parse_strong_prefix (parse_dsum t p f g) sl sl' ;
parse_injective p sl sl'
let gaccessor_clens_dsum_payload
(#kt: parser_kind)
(t: dsum)
(p: parser kt (dsum_repr_type t))
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
(k: dsum_key t)
: Tot (gaccessor (parse_dsum t p f g) (parse_dsum_type_of_tag' t f g k) (clens_dsum_payload t k))
= Classical.forall_intro_2 (fun x -> Classical.move_requires (gaccessor_clens_dsum_payload_injective t p f g k x));
Classical.forall_intro_2 (fun x -> Classical.move_requires (gaccessor_clens_dsum_payload_no_lookahead t p f g k x));
gaccessor_prop_equiv (parse_dsum t p f g) (parse_dsum_type_of_tag' t f g k) (clens_dsum_payload t k) (gaccessor_clens_dsum_payload' t p f g k);
gaccessor_clens_dsum_payload' t p f g k
inline_for_extraction
let accessor_clens_dsum_payload'
(#kt: parser_kind)
(t: dsum)
(#p: parser kt (dsum_repr_type t))
(j: jumper p)
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
(k: dsum_key t)
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: HST.Stack U32.t
(requires (fun h ->
valid (parse_dsum t p f g) h input pos /\
(clens_dsum_payload t k).clens_cond (contents (parse_dsum t p f g) h input pos)
))
(ensures (fun h pos' h' ->
B.modifies B.loc_none h h' /\
pos' == slice_access h (gaccessor_clens_dsum_payload t p f g k) input pos
))
=
let h = HST.get () in
[@inline_let]
let _ =
let pos' = get_valid_pos (parse_dsum t p f g) h input pos in
let large = bytes_of_slice_from h input pos in
slice_access_eq h (gaccessor_clens_dsum_payload t p f g k) input pos;
valid_facts (parse_dsum t p f g) h input pos;
parse_dsum_eq3 t p f g large;
valid_facts p h input pos
in
j input pos
#pop-options
inline_for_extraction
let accessor_clens_dsum_payload
(#kt: parser_kind)
(t: dsum)
(#p: parser kt (dsum_repr_type t))
(j: jumper p)
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
(k: dsum_key t)
: Tot (accessor (gaccessor_clens_dsum_payload t p f g k))
= fun #rrel #rel -> accessor_clens_dsum_payload' t j f g k #rrel #rel
#push-options "--z3rlimit 16"
let gaccessor_clens_dsum_unknown_payload'
(#kt: parser_kind)
(t: dsum)
(p: parser kt (dsum_repr_type t))
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
: Tot (gaccessor' (parse_dsum t p f g) g (clens_dsum_unknown_payload t))
= fun (input: bytes) ->
parse_dsum_eq3 t p f g input;
let res =
match parse p input with
| Some (tg, consumed) ->
let k = maybe_enum_key_of_repr (dsum_enum t) tg in
synth_dsum_case_inverse t k;
synth_dsum_case_injective t k;
synth_injective_synth_inverse_synth_inverse_recip (synth_dsum_case t k) (synth_dsum_case_recip t k) ();
(consumed)
| _ -> (0) // dummy
in
(res <: (res: _ { gaccessor_post' (parse_dsum t p f g) g (clens_dsum_unknown_payload t) input res } ))
let gaccessor_clens_dsum_unknown_payload_injective
(#kt: parser_kind)
(t: dsum)
(p: parser kt (dsum_repr_type t))
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
(sl sl' : bytes)
: Lemma
(requires (
gaccessor_pre (parse_dsum t p f g) g (clens_dsum_unknown_payload t) sl /\
gaccessor_pre (parse_dsum t p f g) g (clens_dsum_unknown_payload t) sl' /\
injective_precond (parse_dsum t p f g) sl sl'
))
(ensures (gaccessor_clens_dsum_unknown_payload' t p f g sl == gaccessor_clens_dsum_unknown_payload' t p f g sl'))
= parse_dsum_eq3 t p f g sl;
parse_dsum_eq3 t p f g sl';
parse_injective (parse_dsum t p f g) sl sl' ;
parse_injective p sl sl'
let gaccessor_clens_dsum_unknown_payload_no_lookahead
(#kt: parser_kind)
(t: dsum)
(p: parser kt (dsum_repr_type t))
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
(sl sl' : bytes)
: Lemma
(requires (
(parse_dsum_kind kt t f ku).parser_kind_subkind == Some ParserStrong /\
gaccessor_pre (parse_dsum t p f g) g (clens_dsum_unknown_payload t) sl /\
gaccessor_pre (parse_dsum t p f g) g (clens_dsum_unknown_payload t) sl' /\
no_lookahead_on_precond (parse_dsum t p f g) sl sl'
))
(ensures (gaccessor_clens_dsum_unknown_payload' t p f g sl == gaccessor_clens_dsum_unknown_payload' t p f g sl'))
=
parse_dsum_eq3 t p f g sl;
parse_dsum_eq3 t p f g sl';
parse_strong_prefix (parse_dsum t p f g) sl sl' ;
parse_injective p sl sl'
let gaccessor_clens_dsum_unknown_payload
(#kt: parser_kind)
(t: dsum)
(p: parser kt (dsum_repr_type t))
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
: Tot (gaccessor (parse_dsum t p f g) g (clens_dsum_unknown_payload t))
= Classical.forall_intro_2 (fun x -> Classical.move_requires (gaccessor_clens_dsum_unknown_payload_injective t p f g x));
Classical.forall_intro_2 (fun x -> Classical.move_requires (gaccessor_clens_dsum_unknown_payload_no_lookahead t p f g x));
gaccessor_prop_equiv (parse_dsum t p f g) g (clens_dsum_unknown_payload t) (gaccessor_clens_dsum_unknown_payload' t p f g);
gaccessor_clens_dsum_unknown_payload' t p f g
inline_for_extraction
let accessor_clens_dsum_unknown_payload'
(#kt: parser_kind)
(t: dsum)
(#p: parser kt (dsum_repr_type t))
(j: jumper p)
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: HST.Stack U32.t
(requires (fun h ->
valid (parse_dsum t p f g) h input pos /\
(clens_dsum_unknown_payload t).clens_cond (contents (parse_dsum t p f g) h input pos)
))
(ensures (fun h pos' h' ->
B.modifies B.loc_none h h' /\
pos' == slice_access h (gaccessor_clens_dsum_unknown_payload t p f g) input pos
))
=
let h = HST.get () in
[@inline_let]
let _ =
let pos' = get_valid_pos (parse_dsum t p f g) h input pos in
let large = bytes_of_slice_from h input pos in
slice_access_eq h (gaccessor_clens_dsum_unknown_payload t p f g) input pos;
valid_facts (parse_dsum t p f g) h input pos;
parse_dsum_eq3 t p f g large;
valid_facts p h input pos
in
j input pos
#pop-options | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"LowStar.Buffer.fst.checked",
"LowParse.Spec.Sum.fst.checked",
"LowParse.Low.Enum.fst.checked",
"FStar.UInt64.fsti.checked",
"FStar.UInt32.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Int.Cast.fst.checked",
"FStar.HyperStack.ST.fsti.checked",
"FStar.HyperStack.fst.checked",
"FStar.Classical.fsti.checked"
],
"interface_file": false,
"source_file": "LowParse.Low.Sum.fst"
} | [
{
"abbrev": true,
"full_module": "FStar.HyperStack",
"short_module": "HS"
},
{
"abbrev": true,
"full_module": "FStar.UInt64",
"short_module": "U64"
},
{
"abbrev": true,
"full_module": "FStar.Int.Cast",
"short_module": "Cast"
},
{
"abbrev": true,
"full_module": "LowStar.Buffer",
"short_module": "B"
},
{
"abbrev": true,
"full_module": "FStar.HyperStack.ST",
"short_module": "HST"
},
{
"abbrev": true,
"full_module": "FStar.UInt32",
"short_module": "U32"
},
{
"abbrev": false,
"full_module": "LowParse.Spec.Sum",
"short_module": null
},
{
"abbrev": false,
"full_module": "LowParse.Low.Enum",
"short_module": null
},
{
"abbrev": false,
"full_module": "LowParse.Low",
"short_module": null
},
{
"abbrev": false,
"full_module": "LowParse.Low",
"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",
"short_module": null
}
] | {
"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_elim_box": false,
"smtencoding_l_arith_repr": "boxwrap",
"smtencoding_nl_arith_repr": "boxwrap",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": true,
"z3cliopt": [],
"z3refresh": false,
"z3rlimit": 5,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | false |
t: LowParse.Spec.Sum.dsum ->
j:
LowParse.Low.Base.jumper p
{ Mkparser_kind'?.parser_kind_subkind kt ==
FStar.Pervasives.Native.Some LowParse.Spec.Base.ParserStrong } ->
f:
(x: LowParse.Spec.Sum.dsum_known_key t
-> Prims.dtuple2 LowParse.Spec.Base.parser_kind
(fun k -> LowParse.Spec.Base.parser k (LowParse.Spec.Sum.dsum_type_of_known_tag t x))) ->
g: LowParse.Spec.Base.parser ku (LowParse.Spec.Sum.dsum_type_of_unknown_tag t)
-> LowParse.Low.Base.accessor (LowParse.Low.Sum.gaccessor_clens_dsum_unknown_payload t p f g) | Prims.Tot | [
"total"
] | [] | [
"LowParse.Spec.Base.parser_kind",
"LowParse.Spec.Sum.dsum",
"LowParse.Spec.Base.parser",
"LowParse.Spec.Sum.dsum_repr_type",
"LowParse.Low.Base.jumper",
"Prims.eq2",
"FStar.Pervasives.Native.option",
"LowParse.Spec.Base.parser_subkind",
"LowParse.Spec.Base.__proj__Mkparser_kind'__item__parser_kind_subkind",
"FStar.Pervasives.Native.Some",
"LowParse.Spec.Base.ParserStrong",
"LowParse.Spec.Sum.dsum_known_key",
"Prims.dtuple2",
"LowParse.Spec.Sum.dsum_type_of_known_tag",
"LowParse.Spec.Sum.dsum_type_of_unknown_tag",
"LowParse.Slice.srel",
"LowParse.Bytes.byte",
"LowParse.Low.Sum.accessor_clens_dsum_unknown_payload'",
"LowParse.Slice.slice",
"FStar.UInt32.t",
"FStar.Monotonic.HyperStack.mem",
"Prims.l_and",
"LowParse.Low.Base.Spec.valid",
"LowParse.Spec.Sum.parse_dsum_kind",
"LowParse.Spec.Sum.dsum_type",
"LowParse.Spec.Sum.parse_dsum",
"LowParse.Low.Base.Spec.__proj__Mkclens__item__clens_cond",
"LowParse.Low.Sum.clens_dsum_unknown_payload",
"LowParse.Low.Base.Spec.contents",
"LowStar.Monotonic.Buffer.modifies",
"LowStar.Monotonic.Buffer.loc_none",
"LowParse.Low.Base.Spec.slice_access",
"LowParse.Low.Sum.gaccessor_clens_dsum_unknown_payload",
"LowParse.Low.Base.accessor"
] | [] | false | false | false | false | false | let accessor_clens_dsum_unknown_payload
(#kt: parser_kind)
(t: dsum)
(#p: parser kt (dsum_repr_type t))
(j: jumper p {kt.parser_kind_subkind == Some ParserStrong})
(f: (x: dsum_known_key t -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x))))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
: Tot (accessor (gaccessor_clens_dsum_unknown_payload t p f g)) =
| fun #rrel #rel -> accessor_clens_dsum_unknown_payload' t j f g #rrel #rel | false |
Vale.Curve25519.Fast_defs.fst | Vale.Curve25519.Fast_defs.pow2_nine | val pow2_nine (c0 c1 c2 c3 c4 c5 c6 c7 c8: nat) : nat | val pow2_nine (c0 c1 c2 c3 c4 c5 c6 c7 c8: nat) : nat | let pow2_nine (c0 c1 c2 c3 c4 c5 c6 c7 c8:nat) : nat = pow2_eight c0 c1 c2 c3 c4 c5 c6 c7 + pow2_512 * c8 | {
"file_name": "vale/code/crypto/ecc/curve25519/Vale.Curve25519.Fast_defs.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 105,
"end_line": 27,
"start_col": 0,
"start_line": 27
} | module Vale.Curve25519.Fast_defs
open Vale.Def.Words_s
open Vale.Def.Types_s
open FStar.Mul
unfold let pow2_192 = 0x1000000000000000000000000000000000000000000000000
let _ = assert_norm (pow2 192 = pow2_192)
unfold let pow2_256 = 0x10000000000000000000000000000000000000000000000000000000000000000
let _ = assert_norm (pow2 256 = pow2_256)
unfold let pow2_320 = 0x100000000000000000000000000000000000000000000000000000000000000000000000000000000
let _ = assert_norm (pow2 320 = pow2_320)
unfold let pow2_384 = 0x1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000
let _ = assert_norm (pow2 384 = pow2_384)
unfold let pow2_448 = 0x10000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000
let _ = assert_norm (pow2 448 = pow2_448)
unfold let pow2_512 = 0x100000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000
let _ = assert_norm (pow2 512 = pow2_512)
let pow2_two (c0 c1:nat) : nat = c0 + pow2_64 * c1
let pow2_three (c0 c1 c2:nat) : nat = pow2_two c0 c1 + pow2_128 * c2
let pow2_four (c0 c1 c2 c3:nat) : nat = pow2_three c0 c1 c2 + pow2_192 * c3
let pow2_five (c0 c1 c2 c3 c4:nat) : nat = pow2_four c0 c1 c2 c3 + pow2_256 * c4
let pow2_six (c0 c1 c2 c3 c4 c5:nat) : nat = pow2_five c0 c1 c2 c3 c4 + pow2_320 * c5
let pow2_seven (c0 c1 c2 c3 c4 c5 c6:nat) : nat = pow2_six c0 c1 c2 c3 c4 c5 + pow2_384 * c6 | {
"checked_file": "/",
"dependencies": [
"Vale.Def.Words_s.fsti.checked",
"Vale.Def.Types_s.fst.checked",
"Vale.Curve25519.Fast_lemmas_internal.fsti.checked",
"Vale.Arch.Types.fsti.checked",
"prims.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked"
],
"interface_file": false,
"source_file": "Vale.Curve25519.Fast_defs.fst"
} | [
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Def.Types_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Def.Words_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Curve25519",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Curve25519",
"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",
"short_module": null
}
] | {
"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_elim_box": true,
"smtencoding_l_arith_repr": "native",
"smtencoding_nl_arith_repr": "wrapped",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": false,
"z3cliopt": [
"smt.arith.nl=false",
"smt.QI.EAGER_THRESHOLD=100",
"smt.CASE_SPLIT=3"
],
"z3refresh": false,
"z3rlimit": 5,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | false |
c0: Prims.nat ->
c1: Prims.nat ->
c2: Prims.nat ->
c3: Prims.nat ->
c4: Prims.nat ->
c5: Prims.nat ->
c6: Prims.nat ->
c7: Prims.nat ->
c8: Prims.nat
-> Prims.nat | Prims.Tot | [
"total"
] | [] | [
"Prims.nat",
"Prims.op_Addition",
"Vale.Curve25519.Fast_defs.pow2_eight",
"FStar.Mul.op_Star",
"Vale.Curve25519.Fast_defs.pow2_512"
] | [] | false | false | false | true | false | let pow2_nine (c0 c1 c2 c3 c4 c5 c6 c7 c8: nat) : nat =
| pow2_eight c0 c1 c2 c3 c4 c5 c6 c7 + pow2_512 * c8 | false |
LowParse.Low.Sum.fst | LowParse.Low.Sum.clens_dsum_cases_payload | val clens_dsum_cases_payload (s: dsum) (k: dsum_key s)
: Tot (clens (dsum_cases s k) (dsum_type_of_tag s k)) | val clens_dsum_cases_payload (s: dsum) (k: dsum_key s)
: Tot (clens (dsum_cases s k) (dsum_type_of_tag s k)) | let clens_dsum_cases_payload
(s: dsum)
(k: dsum_key s)
: Tot (clens (dsum_cases s k) (dsum_type_of_tag s k))
= {
clens_cond = (fun (x: dsum_cases s k) -> True);
clens_get = (fun (x: dsum_cases s k) -> synth_dsum_case_recip s k x <: Ghost (dsum_type_of_tag s k) (requires (True)) (ensures (fun _ -> True)));
} | {
"file_name": "src/lowparse/LowParse.Low.Sum.fst",
"git_rev": "00217c4a89f5ba56002ba9aa5b4a9d5903bfe9fa",
"git_url": "https://github.com/project-everest/everparse.git",
"project_name": "everparse"
} | {
"end_col": 3,
"end_line": 2087,
"start_col": 0,
"start_line": 2080
} | module LowParse.Low.Sum
include LowParse.Low.Enum
include LowParse.Spec.Sum
module U32 = FStar.UInt32
module HST = FStar.HyperStack.ST
module B = LowStar.Buffer
module Cast = FStar.Int.Cast
module U64 = FStar.UInt64
inline_for_extraction
let validate_sum_cases_aux
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(vc: ((x: sum_key t) -> Tot (validator (dsnd (pc x)))))
(k: sum_key t)
: Tot (validator (parse_sum_cases t pc k))
= [@inline_let]
let _ = synth_sum_case_injective t k in
validate_synth
(validate_weaken
(weaken_parse_cases_kind t pc)
(vc k)
()
)
(synth_sum_case t k)
()
inline_for_extraction
let validate_sum_cases_t
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot Type
= validator (parse_sum_cases t pc k)
let validate_sum_cases_t_eq
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
(x y : validate_sum_cases_t t pc k)
: GTot Type0
= True
inline_for_extraction
let validate_sum_cases_t_if
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (if_combinator _ (validate_sum_cases_t_eq t pc k))
= fun cond (sv_true: cond_true cond -> Tot (validate_sum_cases_t t pc k)) (sv_false: cond_false cond -> Tot (validate_sum_cases_t t pc k)) #rrel #rel input pos ->
if cond
then sv_true () input pos
else sv_false () input pos
inline_for_extraction
let validate_sum_cases
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(vc: ((x: sum_key t) -> Tot (validator (dsnd (pc x)))))
(destr: dep_enum_destr (sum_enum t) (validate_sum_cases_t t pc))
(k: sum_key t)
: Tot (validator (parse_sum_cases t pc k))
= destr
_
(validate_sum_cases_t_if t pc)
(fun _ _ -> ())
(fun _ _ _ _ -> ())
(validate_sum_cases_aux t pc vc)
k
inline_for_extraction
let validate_sum_aux_payload_t
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
: Tot Type
= (#rrel: _) -> (#rel: _) ->
(input: slice rrel rel) ->
(pos: U64.t) ->
HST.Stack U64.t
(requires (fun h -> live_slice h input /\ U64.v pos <= U32.v input.len))
(ensures (fun h res h' ->
B.modifies B.loc_none h h' /\ (
match k with
| Unknown _ -> is_error res
| Known k' ->
if is_success res
then
valid_pos (dsnd (pc k')) h input (uint64_to_uint32 pos) (uint64_to_uint32 res)
else
(~ (valid (dsnd (pc k')) h input (uint64_to_uint32 pos)))
)))
let validate_sum_aux_payload_eq
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
: Tot (validate_sum_aux_payload_t t pc k -> validate_sum_aux_payload_t t pc k -> GTot Type0)
= fun _ _ -> True
inline_for_extraction
let validate_sum_aux_payload_if'
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
(cond: bool)
(ift: ((cond_true cond) -> Tot (validate_sum_aux_payload_t t pc k)))
(iff: ((cond_false cond) -> Tot (validate_sum_aux_payload_t t pc k)))
: Tot (validate_sum_aux_payload_t t pc k)
= fun #rrel #rel input pos ->
if cond
then begin
(ift () <: validate_sum_aux_payload_t t pc k) input pos
end else
(iff () <: validate_sum_aux_payload_t t pc k) input pos
inline_for_extraction
let validate_sum_aux_payload_if
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
: Tot (if_combinator _ (validate_sum_aux_payload_eq t pc k))
= validate_sum_aux_payload_if' t pc k
#push-options "--z3rlimit 64 --z3cliopt smt.arith.nl=false --using_facts_from '* -FStar.Int.Cast -LowParse.BitFields'"
// --query_stats --smtencoding.elim_box true --smtencoding.l_arith_repr native --z3refresh"
inline_for_extraction
let validate_sum_aux
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(v: validator p)
(p32: leaf_reader p)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(v_payload: ((k: sum_repr_type t)) -> Tot (validate_sum_aux_payload_t t pc (maybe_enum_key_of_repr (sum_enum t) k)))
: Tot (validator (parse_sum t p pc))
= fun #rrel #rel input pos ->
let h = HST.get () in
[@inline_let]
let _ = parse_sum_eq'' t p pc (bytes_of_slice_from h input (uint64_to_uint32 pos)) in
[@inline_let]
let _ = valid_facts (parse_sum t p pc) h input (uint64_to_uint32 pos) in
[@inline_let]
let _ = valid_facts p h input (uint64_to_uint32 pos) in
let len_after_tag = v input pos in
if is_error len_after_tag
then len_after_tag
else begin
let h1 = HST.get () in
let k' = p32 input (uint64_to_uint32 pos) in
[@inline_let]
let _ =
match maybe_enum_key_of_repr (sum_enum t) k' with
| Known k -> valid_facts (dsnd (pc k)) h input (uint64_to_uint32 len_after_tag)
| _ -> ()
in
v_payload k' input len_after_tag
end
#pop-options
inline_for_extraction
let validate_sum_aux_payload'
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (validator (dsnd (pc x)))))
(k: maybe_enum_key (sum_enum t))
: Tot (validate_sum_aux_payload_t t pc k)
= fun #rrel #rel input pos ->
match k with
| Known k ->
[@inline_let]
let _ = synth_sum_case_injective t k in
pc32 k input pos
// validate_synth (pc32 k) (synth_sum_case t k) () input pos
| _ -> validator_error_generic
inline_for_extraction
let validate_sum_aux_payload
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (validator (dsnd (pc x)))))
(destr: dep_maybe_enum_destr_t (sum_enum t) (validate_sum_aux_payload_t t pc))
(k: sum_repr_type t)
: Tot (validate_sum_aux_payload_t t pc (maybe_enum_key_of_repr (sum_enum t) k))
= destr (validate_sum_aux_payload_eq t pc) (validate_sum_aux_payload_if t pc) (fun _ _ -> ()) (fun _ _ _ _ -> ()) (validate_sum_aux_payload' t pc pc32) k
inline_for_extraction
let validate_sum
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(v: validator p)
(p32: leaf_reader p)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (validator (dsnd (pc x)))))
(destr: dep_maybe_enum_destr_t (sum_enum t) (validate_sum_aux_payload_t t pc))
: Tot (validator (parse_sum t p pc))
= validate_sum_aux t v p32 pc (validate_sum_aux_payload t pc pc32 destr)
module HS = FStar.HyperStack
#push-options "--z3rlimit 256 --z3cliopt smt.arith.nl=false --initial_ifuel 8 --max_ifuel 8 --initial_fuel 2 --max_fuel 2"
#restart-solver
let valid_sum_intro
(h: HS.mem)
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: Lemma
(requires (
valid (parse_enum_key p (sum_enum t)) h input pos /\ (
let k = contents (parse_enum_key p (sum_enum t)) h input pos in
valid (dsnd (pc k)) h input (get_valid_pos (parse_enum_key p (sum_enum t)) h input pos)
)))
(ensures (
let k = contents (parse_enum_key p (sum_enum t)) h input pos in
let pos_payload = get_valid_pos (parse_enum_key p (sum_enum t)) h input pos in
valid_content_pos
(parse_sum t p pc) h input pos
(synth_sum_case t k (contents (dsnd (pc k)) h input pos_payload))
(get_valid_pos (dsnd (pc k)) h input pos_payload)
))
= valid_facts (parse_enum_key p (sum_enum t)) h input pos;
let k = contents (parse_enum_key p (sum_enum t)) h input pos in
let pos_payload = get_valid_pos (parse_enum_key p (sum_enum t)) h input pos in
valid_facts (dsnd (pc k)) h input pos_payload;
valid_facts (parse_sum t p pc) h input pos;
parse_sum_eq t p pc (bytes_of_slice_from h input pos)
#pop-options
inline_for_extraction
let finalize_sum_case
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(s: serializer p)
(w: leaf_writer_strong s)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(destr: enum_repr_of_key'_t (sum_enum t))
(k: sum_key t)
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: HST.Stack unit
(requires (fun h ->
let len_tag = serialized_length (serialize_enum_key _ s (sum_enum t)) k in
U32.v pos + len_tag < 4294967296 /\ (
let pos_payload = pos `U32.add` U32.uint_to_t len_tag in
valid (dsnd (pc k)) h input pos_payload /\
writable input.base (U32.v pos) (U32.v pos_payload) h
)))
(ensures (fun h _ h' ->
let len_tag = serialized_length (serialize_enum_key _ s (sum_enum t)) k in
let pos_payload = pos `U32.add` U32.uint_to_t len_tag in
B.modifies (loc_slice_from_to input pos pos_payload) h h' /\
valid_content_pos (parse_sum t p pc) h' input pos (synth_sum_case t k (contents (dsnd (pc k)) h input pos_payload)) (get_valid_pos (dsnd (pc k)) h input pos_payload)
))
= let pos1 = write_enum_key w (sum_enum t) destr k input pos in
let h = HST.get () in
[@inline_let]
let _ = valid_sum_intro h t p pc input pos in
()
inline_for_extraction
let jump_sum_cases_aux
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(vc: ((x: sum_key t) -> Tot (jumper (dsnd (pc x)))))
(k: sum_key t)
: Tot (jumper (parse_sum_cases t pc k))
= [@inline_let]
let _ = synth_sum_case_injective t k in
jump_synth
(jump_weaken
(weaken_parse_cases_kind t pc)
(vc k)
()
)
(synth_sum_case t k)
()
inline_for_extraction
let jump_sum_cases_t
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot Type
= jumper (parse_sum_cases t pc k)
let jump_sum_cases_t_eq
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
(x y : jump_sum_cases_t t pc k)
: GTot Type0
= True
inline_for_extraction
let jump_sum_cases_t_if
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (if_combinator _ (jump_sum_cases_t_eq t pc k))
= fun cond (sv_true: cond_true cond -> Tot (jump_sum_cases_t t pc k)) (sv_false: cond_false cond -> Tot (jump_sum_cases_t t pc k)) #rrel #rel input pos ->
if cond
then sv_true () input pos
else sv_false () input pos
inline_for_extraction
let jump_sum_cases
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(vc: ((x: sum_key t) -> Tot (jumper (dsnd (pc x)))))
(destr: dep_enum_destr (sum_enum t) (jump_sum_cases_t t pc))
(k: sum_key t)
: Tot (jumper (parse_sum_cases t pc k))
= destr
_
(jump_sum_cases_t_if t pc)
(fun _ _ -> ())
(fun _ _ _ _ -> ())
(jump_sum_cases_aux t pc vc)
k
inline_for_extraction
let jump_sum_aux_payload_t
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
: Tot Type
= (#rrel: _) -> (#rel: _) ->
(input: slice rrel rel) ->
(pos: U32.t) ->
HST.Stack U32.t
(requires (fun h -> live_slice h input /\ U32.v pos <= U32.v input.len /\ (
match k with
| Unknown _ -> False
| Known k' -> valid (dsnd (pc k')) h input pos
)))
(ensures (fun h res h' ->
B.modifies B.loc_none h h' /\ (
match k with
| Unknown _ -> False
| Known k' ->
valid_pos (dsnd (pc k')) h input pos res
)))
let jump_sum_aux_payload_eq
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
: Tot (jump_sum_aux_payload_t t pc k -> jump_sum_aux_payload_t t pc k -> GTot Type0)
= fun _ _ -> True
inline_for_extraction
let jump_sum_aux_payload_if'
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
(cond: bool)
(ift: ((cond_true cond) -> Tot (jump_sum_aux_payload_t t pc k)))
(iff: ((cond_false cond) -> Tot (jump_sum_aux_payload_t t pc k)))
: Tot (jump_sum_aux_payload_t t pc k)
= fun #rrel #rel input pos ->
if cond
then begin
(ift () <: jump_sum_aux_payload_t t pc k) input pos
end else
(iff () <: jump_sum_aux_payload_t t pc k) input pos
inline_for_extraction
let jump_sum_aux_payload_if
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
: Tot (if_combinator _ (jump_sum_aux_payload_eq t pc k))
= jump_sum_aux_payload_if' t pc k
let parse_sum_eq3
(#kt: parser_kind)
(t: sum)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(input: bytes)
(k' : sum_repr_type t)
(consumed_k: consumed_length input)
: Lemma
(requires (Some? (parse (parse_sum t p pc) input) /\ parse p input == Some (k', consumed_k)))
(ensures (
let input_k = Seq.slice input consumed_k (Seq.length input) in
let k = maybe_enum_key_of_repr (sum_enum t) k' in
begin match k with
| Known k ->
Some? (parse (dsnd (pc k)) input_k)
| _ -> False
end
))
= parse_sum_eq'' t p pc input
let parse_sum_eq4
(#kt: parser_kind)
(t: sum)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(input: bytes)
(k' : sum_repr_type t)
(consumed_k: consumed_length input)
(consumed_payload: nat)
: Lemma
(requires (Some? (parse (parse_sum t p pc) input) /\ parse p input == Some (k', consumed_k) /\ (
let input_k = Seq.slice input consumed_k (Seq.length input) in
let k = maybe_enum_key_of_repr (sum_enum t) k' in
begin match k with
| Known k ->
Some? (parse (dsnd (pc k)) input_k) /\ (
let Some (_, consumed_payload') = parse (dsnd (pc k)) input_k in
consumed_payload' == consumed_payload
)
| _ -> False
end
)))
(ensures (
let Some (_, consumed) = parse (parse_sum t p pc) input in
consumed == consumed_k + consumed_payload
))
= parse_sum_eq'' t p pc input
#push-options "--z3rlimit 16"
let valid_sum_elim
(h: HS.mem)
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(#rrel: _) (#rel: _)
(input: slice rrel rel)
(pos: U32.t)
: Lemma
(requires (
valid (parse_sum t p pc) h input pos
))
(ensures (
valid p h input pos /\ (
let pos_payload = get_valid_pos p h input pos in
let k' = maybe_enum_key_of_repr (sum_enum t) (contents p h input pos) in
match k' with
| Known k ->
k == sum_tag_of_data t (contents (parse_sum t p pc) h input pos) /\
valid (dsnd (pc k)) h input pos_payload /\
valid_pos
(parse_sum t p pc) h input pos
(get_valid_pos (dsnd (pc k)) h input pos_payload)
| _ -> False
)))
= let sinput = bytes_of_slice_from h input pos in
let _ = parse_sum_eq'' t p pc sinput in
[@inline_let]
let _ = valid_facts (parse_sum t p pc) h input pos in
let Some (k', consumed_k) = parse p sinput in
let pos_after_tag = U32.uint_to_t (U32.v pos + consumed_k) in
[@inline_let]
let _ = valid_facts p h input pos in
assert (valid_content_pos p h input pos k' pos_after_tag);
match maybe_enum_key_of_repr (sum_enum t) k' with
| Known k -> valid_facts (dsnd (pc k)) h input pos_after_tag
| _ -> ()
#pop-options
let valid_sum_elim_tag
(h: HS.mem)
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: Lemma
(requires (
valid (parse_sum t p pc) h input pos
))
(ensures (
valid (parse_enum_key p (sum_enum t)) h input pos /\
contents (parse_enum_key p (sum_enum t)) h input pos == sum_tag_of_data t (contents (parse_sum t p pc) h input pos)
))
= let _ = parse_sum_eq' t p pc (bytes_of_slice_from h input pos) in
let _ = valid_facts (parse_sum t p pc) h input pos in
let _ = valid_facts (parse_enum_key p (sum_enum t)) h input pos in
()
inline_for_extraction
let read_sum_tag
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(p32: leaf_reader p)
(destr: dep_maybe_enum_destr_t (sum_enum t) (read_enum_key_t (sum_enum t)))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: HST.Stack (sum_key t)
(requires (fun h ->
valid (parse_sum t p pc) h input pos
))
(ensures (fun h res h' ->
B.modifies B.loc_none h h' /\
res == sum_tag_of_data t (contents (parse_sum t p pc) h input pos)
))
= let h = HST.get () in
[@inline_let] let _ = valid_sum_elim_tag h t p pc input pos in
read_enum_key p32 (sum_enum t) destr input pos
inline_for_extraction
let jump_sum_aux
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(v: jumper p)
(p32: leaf_reader p)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(v_payload: ((k: sum_repr_type t)) -> Tot (jump_sum_aux_payload_t t pc (maybe_enum_key_of_repr (sum_enum t) k)))
: Tot (jumper (parse_sum t p pc))
= fun #rrel #rel input pos ->
let h = HST.get () in
[@inline_let]
let _ = valid_sum_elim h t p pc input pos in
let pos_after_tag = v input pos in
let k' = p32 input pos in
v_payload k' input pos_after_tag
inline_for_extraction
let jump_sum_aux_payload'
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (jumper (dsnd (pc x)))))
(k: maybe_enum_key (sum_enum t))
: Tot (jump_sum_aux_payload_t t pc k)
= fun #rrel #rel input pos ->
match k with
| Known k ->
[@inline_let]
let _ = synth_sum_case_injective t k in
pc32 k input pos
| _ -> 0ul // dummy, but we MUST NOT remove this branch, otherwise extraction fails
inline_for_extraction
let jump_sum_aux_payload
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (jumper (dsnd (pc x)))))
(destr: dep_maybe_enum_destr_t (sum_enum t) (jump_sum_aux_payload_t t pc))
(k: sum_repr_type t)
: Tot (jump_sum_aux_payload_t t pc (maybe_enum_key_of_repr (sum_enum t) k))
= destr (jump_sum_aux_payload_eq t pc) (jump_sum_aux_payload_if t pc) (fun _ _ -> ()) (fun _ _ _ _ -> ()) (jump_sum_aux_payload' t pc pc32) k
inline_for_extraction
let jump_sum
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(v: jumper p)
(p32: leaf_reader p)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (jumper (dsnd (pc x)))))
(destr: dep_maybe_enum_destr_t (sum_enum t) (jump_sum_aux_payload_t t pc))
: Tot (jumper (parse_sum t p pc))
= jump_sum_aux t v p32 pc (jump_sum_aux_payload t pc pc32 destr)
inline_for_extraction
let read_sum_cases'
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (leaf_reader (dsnd (pc x)))))
(k: sum_key t)
: Tot (leaf_reader (parse_sum_cases' t pc k))
= [@inline_let]
let _ = synth_sum_case_injective t k in
read_synth'
(dsnd (pc k))
(synth_sum_case t k)
(pc32 k)
()
inline_for_extraction
let read_sum_cases_t
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot Type
= leaf_reader (parse_sum_cases' t pc k)
let read_sum_cases_t_eq
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
(x y : read_sum_cases_t t pc k)
: GTot Type0
= True
inline_for_extraction
let read_sum_cases_t_if
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (if_combinator _ (read_sum_cases_t_eq t pc k))
= fun cond (sv_true: cond_true cond -> Tot (read_sum_cases_t t pc k)) (sv_false: cond_false cond -> Tot (read_sum_cases_t t pc k)) #_ #_ input pos ->
if cond
then (sv_true () input pos)
else (sv_false () input pos)
inline_for_extraction
let read_sum_cases
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (leaf_reader (dsnd (pc x)))))
(destr: dep_enum_destr (sum_enum t) (read_sum_cases_t t pc))
(k: sum_key t)
: Tot (leaf_reader (parse_sum_cases' t pc k))
= destr
_
(read_sum_cases_t_if t pc)
(fun _ _ -> ())
(fun _ _ _ _ -> ())
(read_sum_cases' t pc pc32)
k
#push-options "--z3rlimit 32"
inline_for_extraction
let read_sum
(#kt: parser_kind)
(t: sum)
(p: parser kt (sum_repr_type t))
(p32: leaf_reader (parse_enum_key p (sum_enum t)))
(j: jumper p)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (leaf_reader (dsnd (pc x)))))
(destr: dep_enum_destr (sum_enum t) (read_sum_cases_t t pc))
: Tot (leaf_reader (parse_sum t p pc))
=
fun #_ #_ input pos ->
let h = HST.get () in
valid_facts (parse_sum t p pc) h input pos;
parse_sum_eq' t p pc (bytes_of_slice_from h input pos);
valid_facts (parse_enum_key p (sum_enum t)) h input pos;
let k = p32 input pos in
let pos' = jump_enum_key j (sum_enum t) input pos in
valid_facts (parse_sum_cases' t pc k) h input pos' ;
read_sum_cases t pc pc32 destr k input pos'
#pop-options
inline_for_extraction
let serialize32_sum_cases_t
(t: sum)
(#pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(sc: ((x: sum_key t) -> Tot (serializer (dsnd (pc x)))))
(k: sum_key t)
: Tot Type
= serializer32 (serialize_sum_cases t pc sc k)
let serialize32_sum_cases_t_eq
(t: sum)
(#pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(sc: ((x: sum_key t) -> Tot (serializer (dsnd (pc x)))))
(k: sum_key t)
(x y: serialize32_sum_cases_t t sc k)
: GTot Type0
= True
inline_for_extraction
let serialize32_sum_cases_t_if
(t: sum)
(#pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(sc: ((x: sum_key t) -> Tot (serializer (dsnd (pc x)))))
(k: sum_key t)
: Tot (if_combinator _ (serialize32_sum_cases_t_eq t sc k))
= fun cond (sv_true: (cond_true cond -> Tot (serialize32_sum_cases_t t sc k))) (sv_false: (cond_false cond -> Tot (serialize32_sum_cases_t t sc k))) x #rrel #rel b pos ->
if cond
then (sv_true () x b pos)
else (sv_false () x b pos)
inline_for_extraction
let serialize32_sum_cases_aux
(t: sum)
(#pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(sc: ((x: sum_key t) -> Tot (serializer (dsnd (pc x)))))
(sc32: ((x: sum_key t) -> Tot (serializer32 (sc x))))
(k: sum_key t)
: Tot (serializer32 (serialize_sum_cases t pc sc k))
= fun x #rrel #rel b pos ->
[@inline_let] let _ =
Classical.forall_intro (parse_sum_cases_eq' t pc k);
synth_sum_case_injective t k;
synth_sum_case_inverse t k
in
serialize32_synth
(sc32 k)
(synth_sum_case t k)
(synth_sum_case_recip t k)
(fun x -> synth_sum_case_recip t k x)
()
x
b
pos
inline_for_extraction
let serialize32_sum_cases
(t: sum)
(#pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(sc: ((x: sum_key t) -> Tot (serializer (dsnd (pc x)))))
(sc32: ((x: sum_key t) -> Tot (serializer32 (sc x))))
(destr: dep_enum_destr (sum_enum t) (serialize32_sum_cases_t t sc))
(k: sum_key t)
: Tot (serializer32 (serialize_sum_cases t pc sc k))
= destr
_
(serialize32_sum_cases_t_if t sc)
(fun _ _ -> ())
(fun _ _ _ _ -> ())
(serialize32_sum_cases_aux t sc sc32)
k
inline_for_extraction
let serialize32_sum
(#kt: parser_kind)
(t: sum)
(#p: parser kt (sum_repr_type t))
(s: serializer p {kt.parser_kind_subkind == Some ParserStrong})
(s32: serializer32 (serialize_enum_key _ s (sum_enum t)))
(#pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(sc: ((x: sum_key t) -> Tot (serializer (dsnd (pc x)))))
(sc32: ((x: sum_key t) -> Tot (serializer32 (sc x))))
(destr: dep_enum_destr (sum_enum t) (serialize32_sum_cases_t t sc))
: Tot (serializer32 (serialize_sum t s sc))
= fun x #rrel #rel b pos ->
serialize_sum_eq t s sc x;
let tg = sum_tag_of_data t x in
serialize32_nondep_then_aux s32 (serialize32_sum_cases t sc sc32 destr tg) tg x b pos
let clens_sum_tag
(s: sum)
: Tot (clens (sum_type s) (sum_key s))
= {
clens_cond = (fun _ -> True);
clens_get = sum_tag_of_data s;
}
let gaccessor_sum_tag
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
: Tot (gaccessor (parse_sum t p pc) (parse_enum_key p (sum_enum t)) (clens_sum_tag t))
= gaccessor_tagged_union_tag
(parse_enum_key p (sum_enum t))
(sum_tag_of_data t)
(parse_sum_cases t pc)
inline_for_extraction
let accessor_sum_tag
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
: Tot (accessor (gaccessor_sum_tag t p pc))
= accessor_tagged_union_tag
(parse_enum_key p (sum_enum t))
(sum_tag_of_data t)
(parse_sum_cases t pc)
let clens_sum_payload
(s: sum)
(k: sum_key s)
: Tot (clens (sum_type s) (sum_type_of_tag s k))
= {
clens_cond = (fun (x: sum_type s) -> sum_tag_of_data s x == k);
clens_get = (fun (x: sum_type s) -> synth_sum_case_recip s k x <: Ghost (sum_type_of_tag s k) (requires (sum_tag_of_data s x == k)) (ensures (fun _ -> True)));
}
#push-options "--z3rlimit 32"
let gaccessor_clens_sum_payload'
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (gaccessor' (parse_sum t p pc) (dsnd (pc k)) (clens_sum_payload t k))
= fun (input: bytes) ->
parse_sum_eq'' t p pc input;
let res =
match parse p input with
| Some (_, consumed) ->
synth_sum_case_inverse t k;
synth_sum_case_injective t k;
synth_injective_synth_inverse_synth_inverse_recip (synth_sum_case t k) (synth_sum_case_recip t k) ();
(consumed)
| _ -> 0 // dummy
in
(res <: (res: _ { gaccessor_post' (parse_sum t p pc) (dsnd (pc k)) (clens_sum_payload t k) input res } ))
#push-options "--z3rlimit 64"
let gaccessor_clens_sum_payload_injective
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
(sl sl' : bytes)
: Lemma
(requires (
gaccessor_pre (parse_sum t p pc) (dsnd (pc k)) (clens_sum_payload t k) sl /\
gaccessor_pre (parse_sum t p pc) (dsnd (pc k)) (clens_sum_payload t k) sl' /\
injective_precond (parse_sum t p pc) sl sl'
))
(ensures (gaccessor_clens_sum_payload' t p pc k sl == gaccessor_clens_sum_payload' t p pc k sl'))
= parse_sum_eq'' t p pc sl;
parse_sum_eq'' t p pc sl' ;
parse_injective (parse_sum t p pc) sl sl' ;
parse_injective p sl sl'
#pop-options
let gaccessor_clens_sum_payload_no_lookahead
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
(sl sl' : bytes)
: Lemma
(requires (
(parse_sum_kind kt t pc).parser_kind_subkind == Some ParserStrong /\
gaccessor_pre (parse_sum t p pc) (dsnd (pc k)) (clens_sum_payload t k) sl /\
gaccessor_pre (parse_sum t p pc) (dsnd (pc k)) (clens_sum_payload t k) sl' /\
no_lookahead_on_precond (parse_sum t p pc) sl sl'
))
(ensures (gaccessor_clens_sum_payload' t p pc k sl == gaccessor_clens_sum_payload' t p pc k sl'))
= parse_sum_eq'' t p pc sl;
parse_sum_eq'' t p pc sl' ;
parse_strong_prefix (parse_sum t p pc) sl sl' ;
parse_injective p sl sl'
let gaccessor_clens_sum_payload
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (gaccessor (parse_sum t p pc) (dsnd (pc k)) (clens_sum_payload t k))
= Classical.forall_intro_2 (fun x -> Classical.move_requires (gaccessor_clens_sum_payload_injective t p pc k x));
Classical.forall_intro_2 (fun x -> Classical.move_requires (gaccessor_clens_sum_payload_no_lookahead t p pc k x));
gaccessor_prop_equiv (parse_sum t p pc) (dsnd (pc k)) (clens_sum_payload t k) (gaccessor_clens_sum_payload' t p pc k);
gaccessor_clens_sum_payload' t p pc k
inline_for_extraction
let accessor_clens_sum_payload'
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(j: jumper p)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: HST.Stack U32.t
(requires (fun h ->
valid (parse_sum t p pc) h input pos /\
(clens_sum_payload t k).clens_cond (contents (parse_sum t p pc) h input pos)
))
(ensures (fun h pos' h' ->
B.modifies B.loc_none h h' /\
pos' == slice_access h (gaccessor_clens_sum_payload t p pc k) input pos
))
=
let h = HST.get () in
[@inline_let]
let _ =
let pos' = get_valid_pos (parse_sum t p pc) h input pos in
let large = bytes_of_slice_from h input pos in
slice_access_eq h (gaccessor_clens_sum_payload t p pc k) input pos;
valid_facts (parse_sum t p pc) h input pos;
parse_sum_eq'' t p pc large;
valid_facts p h input pos
in
j input pos
#pop-options
inline_for_extraction
let accessor_clens_sum_payload
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(j: jumper p)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (accessor (gaccessor_clens_sum_payload t p pc k))
= fun #rrel #rel -> accessor_clens_sum_payload' t j pc k #rrel #rel
let clens_sum_cases_payload
(s: sum)
(k: sum_key s)
: Tot (clens (sum_cases s k) (sum_type_of_tag s k))
= {
clens_cond = (fun (x: sum_cases s k) -> True);
clens_get = (fun (x: sum_cases s k) -> synth_sum_case_recip s k x <: Ghost (sum_type_of_tag s k) (requires (True)) (ensures (fun _ -> True)));
}
let gaccessor_clens_sum_cases_payload
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (gaccessor (parse_sum_cases' t pc k) (dsnd (pc k)) (clens_sum_cases_payload t k))
= synth_sum_case_injective t k;
synth_sum_case_inverse t k;
synth_injective_synth_inverse_synth_inverse_recip (synth_sum_case t k) (synth_sum_case_recip t k) ();
gaccessor_ext
(gaccessor_synth (dsnd (pc k)) (synth_sum_case t k) (synth_sum_case_recip t k) ())
(clens_sum_cases_payload t k)
()
inline_for_extraction
let accessor_clens_sum_cases_payload
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (accessor (gaccessor_clens_sum_cases_payload t pc k))
= [@inline_let]
let _ =
synth_sum_case_injective t k;
synth_sum_case_inverse t k;
synth_injective_synth_inverse_synth_inverse_recip (synth_sum_case t k) (synth_sum_case_recip t k) ()
in
accessor_ext
(accessor_synth (dsnd (pc k)) (synth_sum_case t k) (synth_sum_case_recip t k) ())
(clens_sum_cases_payload t k)
()
inline_for_extraction
let validate_dsum_cases_t
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(#k: parser_kind)
(g: parser k (dsum_type_of_unknown_tag s))
(x: dsum_key s)
: Tot Type
= validator (parse_dsum_cases' s f g x)
let validate_dsum_cases_eq
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(#k: parser_kind)
(g: parser k (dsum_type_of_unknown_tag s))
(x: dsum_key s)
(v1 v2 : validate_dsum_cases_t s f g x)
: GTot Type0
= True
inline_for_extraction
let validate_dsum_cases_if'
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(#k: parser_kind)
(g: parser k (dsum_type_of_unknown_tag s))
(x: dsum_key s)
(cond: bool)
(ift: (cond_true cond -> Tot (validate_dsum_cases_t s f g x)))
(iff: (cond_false cond -> Tot (validate_dsum_cases_t s f g x)))
: Tot (validate_dsum_cases_t s f g x)
= fun #rrel #rel input len ->
if cond
then (ift () <: validate_dsum_cases_t s f g x) input len
else (iff () <: validate_dsum_cases_t s f g x) input len
inline_for_extraction
let validate_dsum_cases_if
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(#k: parser_kind)
(g: parser k (dsum_type_of_unknown_tag s))
(x: dsum_key s)
: Tot (if_combinator _ (validate_dsum_cases_eq s f g x))
= validate_dsum_cases_if' s f g x
inline_for_extraction
let validate_dsum_cases'
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(f' : (x: dsum_known_key s) -> Tot (validator (dsnd (f x))))
(#k: parser_kind)
(#g: parser k (dsum_type_of_unknown_tag s))
(g' : validator g)
(x: dsum_key s)
: Tot (validate_dsum_cases_t s f g x)
= [@inline_let]
let _ = synth_dsum_case_injective s x in
match x with
| Known x' -> validate_synth (f' x') (synth_dsum_case s (Known x')) () <: validator (parse_dsum_cases' s f g x)
| Unknown x' -> validate_synth g' (synth_dsum_case s (Unknown x')) () <: validator (parse_dsum_cases' s f g x)
inline_for_extraction
let validate_dsum_cases'_destr
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(f' : (x: dsum_known_key s) -> Tot (validator (dsnd (f x))))
(#k: parser_kind)
(#g: parser k (dsum_type_of_unknown_tag s))
(g' : validator g)
(destr: dep_enum_destr _ (fun k -> validate_dsum_cases_t s f g (Known k)))
(x: dsum_key s)
: Tot (validate_dsum_cases_t s f g x)
= fun #rrel #rel input pos ->
match x with
| Known k ->
destr
_
(fun k -> validate_dsum_cases_if s f g (Known k))
(fun _ _ -> ())
(fun _ _ _ _ -> ())
(fun k -> validate_dsum_cases' s f f' g' (Known k))
k
input
pos
| Unknown r -> validate_dsum_cases' s f f' g' (Unknown r) input pos
inline_for_extraction
let validate_dsum_cases
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(f' : (x: dsum_known_key s) -> Tot (validator (dsnd (f x))))
(#k: parser_kind)
(#g: parser k (dsum_type_of_unknown_tag s))
(g' : validator g)
(destr: dep_enum_destr _ (fun k -> validate_dsum_cases_t s f g (Known k)))
(x: dsum_key s)
: Tot (validator (parse_dsum_cases s f g x))
= fun #rrel #rel input pos ->
let h = HST.get () in
[@inline_let]
let _ =
valid_facts (parse_dsum_cases' s f g x) h input (uint64_to_uint32 pos);
valid_facts (parse_dsum_cases s f g x) h input (uint64_to_uint32 pos);
parse_dsum_cases_eq' s f g x (bytes_of_slice_from h input (uint64_to_uint32 pos))
in
validate_dsum_cases'_destr s f f' g' destr x input pos
#push-options "--z3rlimit 40"
inline_for_extraction
let validate_dsum
(#kt: parser_kind)
(t: dsum)
(#p: parser kt (dsum_repr_type t))
(v: validator p)
(p32: leaf_reader p)
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(f32: (x: dsum_known_key t) -> Tot (validator (dsnd (f x))))
(#k': parser_kind)
(#g: parser k' (dsum_type_of_unknown_tag t))
(g32: validator g)
(destr: dep_maybe_enum_destr_t (dsum_enum t) (validate_dsum_cases_t t f g))
: Tot (validator (parse_dsum t p f g))
= fun #rrel #rel input pos ->
let h = HST.get () in
[@inline_let]
let _ = parse_dsum_eq' t p f g (bytes_of_slice_from h input (uint64_to_uint32 pos)) in
[@inline_let]
let _ = valid_facts (parse_dsum t p f g) h input (uint64_to_uint32 pos) in
[@inline_let]
let _ = valid_facts p h input (uint64_to_uint32 pos) in
let pos_after_tag = v input pos in
if is_error pos_after_tag
then pos_after_tag
else
let tg = p32 input (uint64_to_uint32 pos) in
[@inline_let]
let _ = valid_facts (parse_dsum_cases' t f g (maybe_enum_key_of_repr (dsum_enum t) tg)) h input (uint64_to_uint32 pos_after_tag) in
destr (validate_dsum_cases_eq t f g) (validate_dsum_cases_if t f g) (fun _ _ -> ()) (fun _ _ _ _ -> ()) (validate_dsum_cases' t f f32 g32) tg input pos_after_tag
#pop-options
#reset-options "--z3rlimit 64 --z3cliopt smt.arith.nl=false --initial_ifuel 8 --max_ifuel 8 --initial_fuel 2 --max_fuel 2"
let valid_dsum_intro_known
(h: HS.mem)
(t: dsum)
(#kt: parser_kind)
(p: parser kt (dsum_repr_type t))
(f: ((x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x))))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: Lemma
(requires (
valid (parse_maybe_enum_key p (dsum_enum t)) h input pos /\ (
let k' = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
Known? k' /\ (
let Known k = k' in
valid (dsnd (f k)) h input (get_valid_pos (parse_maybe_enum_key p (dsum_enum t)) h input pos)
))))
(ensures (
let Known k = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
let pos_payload = get_valid_pos (parse_maybe_enum_key p (dsum_enum t)) h input pos in
valid_content_pos
(parse_dsum t p f g) h input pos
(synth_dsum_case t (Known k) (contents (dsnd (f k)) h input pos_payload))
(get_valid_pos (dsnd (f k)) h input pos_payload)
))
= valid_facts (parse_maybe_enum_key p (dsum_enum t)) h input pos;
let Known k = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
let pos_payload = get_valid_pos (parse_maybe_enum_key p (dsum_enum t)) h input pos in
valid_facts (dsnd (f k)) h input pos_payload;
valid_facts (parse_dsum t p f g) h input pos;
parse_dsum_eq t p f g (bytes_of_slice_from h input pos)
let valid_dsum_intro_unknown
(h: HS.mem)
(t: dsum)
(#kt: parser_kind)
(p: parser kt (dsum_repr_type t))
(f: ((x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x))))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: Lemma
(requires (
valid (parse_maybe_enum_key p (dsum_enum t)) h input pos /\ (
let k' = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
Unknown? k' /\
valid g h input (get_valid_pos (parse_maybe_enum_key p (dsum_enum t)) h input pos)
)))
(ensures (
let Unknown r = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
let pos_payload = get_valid_pos (parse_maybe_enum_key p (dsum_enum t)) h input pos in
valid_content_pos
(parse_dsum t p f g) h input pos
(synth_dsum_case t (Unknown r) (contents g h input pos_payload))
(get_valid_pos g h input pos_payload)
))
= valid_facts (parse_maybe_enum_key p (dsum_enum t)) h input pos;
let Unknown r = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
let pos_payload = get_valid_pos (parse_maybe_enum_key p (dsum_enum t)) h input pos in
valid_facts g h input pos_payload;
valid_facts (parse_dsum t p f g) h input pos;
parse_dsum_eq t p f g (bytes_of_slice_from h input pos)
#reset-options
inline_for_extraction
let finalize_dsum_case_known
(t: dsum)
(#kt: parser_kind)
(#p: parser kt (dsum_repr_type t))
(s: serializer p)
(w: leaf_writer_strong s)
(f: ((x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x))))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
(destr: enum_repr_of_key'_t (dsum_enum t))
(k: dsum_known_key t)
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: HST.Stack unit
(requires (fun h ->
let len_tag = serialized_length (serialize_enum_key _ s (dsum_enum t)) k in
U32.v pos + len_tag < 4294967296 /\ (
let pos_payload = pos `U32.add` U32.uint_to_t len_tag in
valid (dsnd (f k)) h input pos_payload /\
writable input.base (U32.v pos) (U32.v pos_payload) h
)))
(ensures (fun h _ h' ->
let len_tag = serialized_length (serialize_enum_key _ s (dsum_enum t)) k in
let pos_payload = pos `U32.add` U32.uint_to_t len_tag in
B.modifies (loc_slice_from_to input pos pos_payload) h h' /\
valid_content_pos (parse_dsum t p f g) h' input pos (synth_dsum_case t (Known k) (contents (dsnd (f k)) h input pos_payload)) (get_valid_pos (dsnd (f k)) h input pos_payload)
))
= let pos1 = write_enum_key w (dsum_enum t) destr k input pos in
let h = HST.get () in
[@inline_let]
let _ =
valid_facts (parse_enum_key p (dsum_enum t)) h input pos;
valid_facts (parse_maybe_enum_key p (dsum_enum t)) h input pos;
let sq = bytes_of_slice_from h input pos in
parse_enum_key_eq p (dsum_enum t) sq;
parse_maybe_enum_key_eq p (dsum_enum t) sq;
valid_dsum_intro_known h t p f g input pos
in
()
inline_for_extraction
let finalize_dsum_case_unknown
(t: dsum)
(#kt: parser_kind)
(#p: parser kt (dsum_repr_type t))
(s: serializer p)
(w: leaf_writer_strong s)
(f: ((x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x))))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
(r: unknown_enum_repr (dsum_enum t))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: HST.Stack unit
(requires (fun h ->
let len_tag = serialized_length s r in
U32.v pos + len_tag < 4294967296 /\ (
let pos_payload = pos `U32.add` U32.uint_to_t len_tag in
valid g h input pos_payload /\
writable input.base (U32.v pos) (U32.v pos_payload) h
)))
(ensures (fun h _ h' ->
let len_tag = serialized_length s r in
let pos_payload = pos `U32.add` U32.uint_to_t len_tag in
B.modifies (loc_slice_from_to input pos pos_payload) h h' /\
valid_content_pos (parse_dsum t p f g) h' input pos (synth_dsum_case t (Unknown r) (contents g h input pos_payload)) (get_valid_pos g h input pos_payload)
))
= let pos1 = w r input pos in
let h = HST.get () in
[@inline_let]
let _ =
valid_facts (parse_maybe_enum_key p (dsum_enum t)) h input pos;
valid_facts p h input pos;
let sq = bytes_of_slice_from h input pos in
parse_maybe_enum_key_eq p (dsum_enum t) sq;
valid_dsum_intro_unknown h t p f g input pos
in
()
let valid_dsum_elim_tag
(h: HS.mem)
(t: dsum)
(#kt: parser_kind)
(p: parser kt (dsum_repr_type t))
(f: ((x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x))))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: Lemma
(requires (
valid (parse_dsum t p f g) h input pos
))
(ensures (
valid (parse_maybe_enum_key p (dsum_enum t)) h input pos /\
contents (parse_maybe_enum_key p (dsum_enum t)) h input pos == dsum_tag_of_data t (contents (parse_dsum t p f g) h input pos)
))
= let _ = parse_dsum_eq_ t p f g (bytes_of_slice_from h input pos) in
let _ = valid_facts (parse_dsum t p f g) h input pos in
let _ = valid_facts (parse_maybe_enum_key p (dsum_enum t)) h input pos in
()
inline_for_extraction
let read_dsum_tag
(t: dsum)
(#kt: parser_kind)
(#p: parser kt (dsum_repr_type t))
(p32: leaf_reader p)
(destr: maybe_enum_destr_t (maybe_enum_key (dsum_enum t)) (dsum_enum t))
(f: ((x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x))))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: HST.Stack (dsum_key t)
(requires (fun h ->
valid (parse_dsum t p f g) h input pos
))
(ensures (fun h res h' ->
B.modifies B.loc_none h h' /\
res == dsum_tag_of_data t (contents (parse_dsum t p f g) h input pos)
))
= let h = HST.get () in
[@inline_let] let _ = valid_dsum_elim_tag h t p f g input pos in
read_maybe_enum_key p32 (dsum_enum t) destr input pos
#push-options "--z3rlimit 32"
let valid_dsum_elim_known
(h: HS.mem)
(t: dsum)
(#kt: parser_kind)
(p: parser kt (dsum_repr_type t))
(f: ((x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x))))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: Lemma
(requires (
valid (parse_dsum t p f g) h input pos /\
Known? (dsum_tag_of_data t (contents (parse_dsum t p f g) h input pos))
))
(ensures (
valid (parse_maybe_enum_key p (dsum_enum t)) h input pos /\ (
let k' = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
let pos_payload = get_valid_pos (parse_maybe_enum_key p (dsum_enum t)) h input pos in
Known? k' /\ (
let Known k = k' in
valid (dsnd (f k)) h input pos_payload /\
valid_content_pos
(parse_dsum t p f g) h input pos
(synth_dsum_case t (Known k) (contents (dsnd (f k)) h input pos_payload))
(get_valid_pos (dsnd (f k)) h input pos_payload)
))))
=
valid_facts (parse_dsum t p f g) h input pos;
parse_dsum_eq t p f g (bytes_of_slice_from h input pos);
valid_facts (parse_maybe_enum_key p (dsum_enum t)) h input pos;
let Known k = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
let pos_payload = get_valid_pos (parse_maybe_enum_key p (dsum_enum t)) h input pos in
valid_facts (dsnd (f k)) h input pos_payload
#pop-options
let valid_dsum_elim_unknown
(h: HS.mem)
(t: dsum)
(#kt: parser_kind)
(p: parser kt (dsum_repr_type t))
(f: ((x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x))))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: Lemma
(requires (
valid (parse_dsum t p f g) h input pos /\
Unknown? (dsum_tag_of_data t (contents (parse_dsum t p f g) h input pos))
))
(ensures (
valid (parse_maybe_enum_key p (dsum_enum t)) h input pos /\ (
let k' = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
let pos_payload = get_valid_pos (parse_maybe_enum_key p (dsum_enum t)) h input pos in
Unknown? k' /\ (
let Unknown r = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
valid g h input pos_payload /\
valid_content_pos
(parse_dsum t p f g) h input pos
(synth_dsum_case t (Unknown r) (contents g h input pos_payload))
(get_valid_pos g h input pos_payload)
))))
=
valid_facts (parse_dsum t p f g) h input pos;
parse_dsum_eq t p f g (bytes_of_slice_from h input pos);
valid_facts (parse_maybe_enum_key p (dsum_enum t)) h input pos;
let Unknown r = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
let pos_payload = get_valid_pos (parse_maybe_enum_key p (dsum_enum t)) h input pos in
valid_facts g h input pos_payload
inline_for_extraction
let jump_dsum_cases_t
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(#k: parser_kind)
(g: parser k (dsum_type_of_unknown_tag s))
(x: dsum_key s)
: Tot Type
= jumper (parse_dsum_cases' s f g x)
let jump_dsum_cases_eq
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(#k: parser_kind)
(g: parser k (dsum_type_of_unknown_tag s))
(x: dsum_key s)
(v1 v2 : jump_dsum_cases_t s f g x)
: GTot Type0
= True
inline_for_extraction
let jump_dsum_cases_if'
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(#k: parser_kind)
(g: parser k (dsum_type_of_unknown_tag s))
(x: dsum_key s)
(cond: bool)
(ift: (cond_true cond -> Tot (jump_dsum_cases_t s f g x)))
(iff: (cond_false cond -> Tot (jump_dsum_cases_t s f g x)))
: Tot (jump_dsum_cases_t s f g x)
= fun #rrel #rel input len ->
if cond
then (ift () <: jump_dsum_cases_t s f g x) input len
else (iff () <: jump_dsum_cases_t s f g x) input len
inline_for_extraction
let jump_dsum_cases_if
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(#k: parser_kind)
(g: parser k (dsum_type_of_unknown_tag s))
(x: dsum_key s)
: Tot (if_combinator _ (jump_dsum_cases_eq s f g x))
= jump_dsum_cases_if' s f g x
inline_for_extraction
let jump_dsum_cases'
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(f' : (x: dsum_known_key s) -> Tot (jumper (dsnd (f x))))
(#k: parser_kind)
(#g: parser k (dsum_type_of_unknown_tag s))
(g' : jumper g)
(x: dsum_key s)
: Tot (jump_dsum_cases_t s f g x)
= synth_dsum_case_injective s x;
match x with
| Known x' -> jump_synth (f' x') (synth_dsum_case s (Known x')) () <: jumper (parse_dsum_cases' s f g x)
| Unknown x' -> jump_synth g' (synth_dsum_case s (Unknown x')) () <: jumper (parse_dsum_cases' s f g x)
inline_for_extraction
let jump_dsum_cases'_destr
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(f' : (x: dsum_known_key s) -> Tot (jumper (dsnd (f x))))
(#k: parser_kind)
(#g: parser k (dsum_type_of_unknown_tag s))
(g' : jumper g)
(destr: dep_enum_destr _ (fun k -> jump_dsum_cases_t s f g (Known k)))
(x: dsum_key s)
: Tot (jump_dsum_cases_t s f g x)
= fun #rrel #rel input pos ->
match x with
| Known k ->
destr
_
(fun k -> jump_dsum_cases_if s f g (Known k))
(fun _ _ -> ())
(fun _ _ _ _ -> ())
(fun k -> jump_dsum_cases' s f f' g' (Known k))
k
input
pos
| Unknown r -> jump_dsum_cases' s f f' g' (Unknown r) input pos
inline_for_extraction
let jump_dsum_cases
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(f' : (x: dsum_known_key s) -> Tot (jumper (dsnd (f x))))
(#k: parser_kind)
(#g: parser k (dsum_type_of_unknown_tag s))
(g' : jumper g)
(destr: dep_enum_destr _ (fun k -> jump_dsum_cases_t s f g (Known k)))
(x: dsum_key s)
: Tot (jumper (parse_dsum_cases s f g x))
= fun #rrel #rel input pos ->
let h = HST.get () in
[@inline_let]
let _ =
valid_facts (parse_dsum_cases' s f g x) h input pos;
valid_facts (parse_dsum_cases s f g x) h input pos;
parse_dsum_cases_eq' s f g x (bytes_of_slice_from h input pos)
in
jump_dsum_cases'_destr s f f' g' destr x input pos
#push-options "--z3rlimit 16"
inline_for_extraction
let jump_dsum
(#kt: parser_kind)
(t: dsum)
(#p: parser kt (dsum_repr_type t))
(v: jumper p)
(p32: leaf_reader p)
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(f32: (x: dsum_known_key t) -> Tot (jumper (dsnd (f x))))
(#k': parser_kind)
(#g: parser k' (dsum_type_of_unknown_tag t))
(g32: jumper g)
(destr: dep_maybe_enum_destr_t (dsum_enum t) (jump_dsum_cases_t t f g))
: Tot (jumper (parse_dsum t p f g))
= fun #rrel #rel input pos ->
let h = HST.get () in
[@inline_let]
let _ = parse_dsum_eq' t p f g (bytes_of_slice_from h input pos) in
[@inline_let]
let _ = valid_facts (parse_dsum t p f g) h input pos in
[@inline_let]
let _ = valid_facts p h input pos in
let pos_after_tag = v input pos in
let tg = p32 input pos in
[@inline_let]
let _ = valid_facts (parse_dsum_cases' t f g (maybe_enum_key_of_repr (dsum_enum t) tg)) h input pos_after_tag in
destr (jump_dsum_cases_eq t f g) (jump_dsum_cases_if t f g) (fun _ _ -> ()) (fun _ _ _ _ -> ()) (jump_dsum_cases' t f f32 g32) tg input pos_after_tag
#pop-options
inline_for_extraction
let read_dsum_cases'
(t: dsum)
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(f32: (x: dsum_known_key t) -> Tot (leaf_reader (dsnd (f x))))
(#k': parser_kind)
(g: parser k' (dsum_type_of_unknown_tag t))
(g32: leaf_reader g)
(x: dsum_key t)
: Tot (leaf_reader (parse_dsum_cases' t f g x))
= fun #rrel #rel input pos ->
[@inline_let]
let _ = synth_dsum_case_injective t x in
match x with
| Known x' ->
read_synth'
(dsnd (f x'))
(synth_dsum_case t (Known x'))
(f32 x')
()
input
pos
| Unknown x' ->
read_synth'
g
(synth_dsum_case t (Unknown x'))
g32
()
input
pos
inline_for_extraction
let read_dsum_cases_t
(t: dsum)
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(#k': parser_kind)
(g: parser k' (dsum_type_of_unknown_tag t))
(k: dsum_known_key t)
: Tot Type
= leaf_reader (parse_dsum_cases' t f g (Known k))
let read_dsum_cases_t_eq
(t: dsum)
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(#k': parser_kind)
(g: parser k' (dsum_type_of_unknown_tag t))
(k: dsum_known_key t)
(x y : read_dsum_cases_t t f g k)
: GTot Type0
= True
inline_for_extraction
let read_dsum_cases_t_if
(t: dsum)
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(#k': parser_kind)
(g: parser k' (dsum_type_of_unknown_tag t))
(k: dsum_known_key t)
: Tot (if_combinator _ (read_dsum_cases_t_eq t f g k))
= fun cond (sv_true: cond_true cond -> Tot (read_dsum_cases_t t f g k)) (sv_false: cond_false cond -> Tot (read_dsum_cases_t t f g k)) #_ #_ input pos ->
if cond
then sv_true () input pos
else sv_false () input pos
inline_for_extraction
let read_dsum_cases
(t: dsum)
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(f32: (x: dsum_known_key t) -> Tot (leaf_reader (dsnd (f x))))
(#k': parser_kind)
(g: parser k' (dsum_type_of_unknown_tag t))
(g32: leaf_reader g)
(destr: dep_enum_destr _ (read_dsum_cases_t t f g))
(x: dsum_key t)
: Tot (leaf_reader (parse_dsum_cases' t f g x))
= fun #_ #_ input pos ->
match x with
| Known k ->
destr
_
(read_dsum_cases_t_if t f g)
(fun _ _ -> ())
(fun _ _ _ _ -> ())
(fun k -> read_dsum_cases' t f f32 g g32 (Known k))
k
input
pos
| Unknown r ->
read_dsum_cases' t f f32 g g32 (Unknown r) input pos
#push-options "--z3rlimit 16"
inline_for_extraction
let read_dsum
(#kt: parser_kind)
(t: dsum)
(#p: parser kt (dsum_repr_type t))
(p32: leaf_reader (parse_maybe_enum_key p (dsum_enum t)))
(j: jumper p)
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(f32: (x: dsum_known_key t) -> Tot (leaf_reader (dsnd (f x))))
(#k': parser_kind)
(#g: parser k' (dsum_type_of_unknown_tag t))
(g32: leaf_reader g)
(destr: dep_enum_destr _ (read_dsum_cases_t t f g))
: Tot (leaf_reader (parse_dsum t p f g))
= fun #_ #_ input pos ->
let h = HST.get () in
valid_facts (parse_dsum t p f g) h input pos;
parse_dsum_eq_ t p f g (bytes_of_slice_from h input pos);
valid_facts (parse_maybe_enum_key p (dsum_enum t)) h input pos;
let k = p32 input pos in
let pos' = jump_maybe_enum_key j (dsum_enum t) input pos in
valid_facts (parse_dsum_cases' t f g k) h input pos' ;
read_dsum_cases t f f32 g g32 destr k input pos'
#pop-options
inline_for_extraction
let serialize32_dsum_type_of_tag
(t: dsum)
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(sf: (x: dsum_known_key t) -> Tot (serializer (dsnd (f x))))
(sf32: (x: dsum_known_key t) -> Tot (serializer32 (sf x)))
(#k': parser_kind)
(#g: parser k' (dsum_type_of_unknown_tag t))
(#sg: serializer g)
(sg32: serializer32 sg)
(tg: dsum_key t)
: Tot (serializer32 (serialize_dsum_type_of_tag t f sf g sg tg))
= match tg with
| Known x' -> serialize32_ext (dsnd (f x')) (sf x') (sf32 x') (parse_dsum_type_of_tag t f g tg) ()
| Unknown x' -> serialize32_ext g sg sg32 (parse_dsum_type_of_tag t f g tg) ()
inline_for_extraction
let serialize32_dsum_cases_aux
(t: dsum)
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(sf: (x: dsum_known_key t) -> Tot (serializer (dsnd (f x))))
(sf32: (x: dsum_known_key t) -> Tot (serializer32 (sf x)))
(#k': parser_kind)
(#g: parser k' (dsum_type_of_unknown_tag t))
(#sg: serializer g)
(sg32: serializer32 sg)
(tg: dsum_key t)
: Tot (serializer32 (serialize_dsum_cases t f sf g sg tg))
= [@inline_let]
let _ = synth_dsum_case_injective t tg in
[@inline_let]
let _ = synth_dsum_case_inverse t tg in
serialize32_synth
(serialize32_dsum_type_of_tag t f sf sf32 sg32 tg)
(synth_dsum_case t tg)
(synth_dsum_case_recip t tg)
(fun x -> synth_dsum_case_recip t tg x)
()
inline_for_extraction
let serialize32_dsum_cases_t
(t: dsum)
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(sf: (x: dsum_known_key t) -> Tot (serializer (dsnd (f x))))
(#k': parser_kind)
(g: parser k' (dsum_type_of_unknown_tag t))
(sg: serializer g)
(k: dsum_known_key t)
: Tot Type
= serializer32 (serialize_dsum_cases t f sf g sg (Known k))
let serialize32_dsum_cases_t_eq
(t: dsum)
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(sf: (x: dsum_known_key t) -> Tot (serializer (dsnd (f x))))
(#k': parser_kind)
(g: parser k' (dsum_type_of_unknown_tag t))
(sg: serializer g)
(k: dsum_known_key t)
(x y: serialize32_dsum_cases_t t f sf g sg k)
: GTot Type0
= True
inline_for_extraction
let serialize32_dsum_cases_t_if
(t: dsum)
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(sf: (x: dsum_known_key t) -> Tot (serializer (dsnd (f x))))
(#k': parser_kind)
(g: parser k' (dsum_type_of_unknown_tag t))
(sg: serializer g)
(k: dsum_known_key t)
: Tot (if_combinator _ (serialize32_dsum_cases_t_eq t f sf g sg k))
= fun cond (sv_true: (cond_true cond -> Tot (serialize32_dsum_cases_t t f sf g sg k))) (sv_false: (cond_false cond -> Tot (serialize32_dsum_cases_t t f sf g sg k))) x #rrel #rel output pos ->
if cond
then (sv_true () x output pos)
else (sv_false () x output pos)
inline_for_extraction
let serialize32_dsum_cases
(t: dsum)
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(sf: (x: dsum_known_key t) -> Tot (serializer (dsnd (f x))))
(sf32: (x: dsum_known_key t) -> Tot (serializer32 (sf x)))
(#k': parser_kind)
(#g: parser k' (dsum_type_of_unknown_tag t))
(#sg: serializer g)
(sg32: serializer32 sg)
(destr: dep_enum_destr _ (serialize32_dsum_cases_t t f sf g sg))
(tg: dsum_key t)
: Tot (serializer32 (serialize_dsum_cases t f sf g sg tg))
= fun x #rrel #rel output pos ->
match tg with
| Known k ->
destr
_
(serialize32_dsum_cases_t_if t f sf g sg)
(fun _ _ -> ())
(fun _ _ _ _ -> ())
(fun k -> serialize32_dsum_cases_aux t f sf sf32 sg32 (Known k))
k
x
output
pos
| Unknown r ->
serialize32_dsum_cases_aux t f sf sf32 sg32 (Unknown r) x output pos
inline_for_extraction
let serialize32_dsum
(#kt: parser_kind)
(t: dsum)
(#p: parser kt (dsum_repr_type t))
(s: serializer p {kt.parser_kind_subkind == Some ParserStrong})
(s32: serializer32 (serialize_maybe_enum_key _ s (dsum_enum t)))
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(sf: (x: dsum_known_key t) -> Tot (serializer (dsnd (f x))))
(sf32: (x: dsum_known_key t) -> Tot (serializer32 (sf x)))
(#k': parser_kind)
(#g: parser k' (dsum_type_of_unknown_tag t))
(#sg: serializer g)
(sg32: serializer32 sg)
(destr: dep_enum_destr _ (serialize32_dsum_cases_t t f sf g sg))
: Tot (serializer32 (serialize_dsum t s f sf g sg))
= fun x #_ #_ output pos ->
[@inline_let]
let _ = serialize_dsum_eq' t s f sf g sg x in
let tg = dsum_tag_of_data t x in
serialize32_nondep_then_aux
s32
(serialize32_dsum_cases t f sf sf32 sg32 destr tg)
tg
x
output
pos
let clens_dsum_tag
(s: dsum)
: Tot (clens (dsum_type s) (dsum_key s))
= {
clens_cond = (fun _ -> True);
clens_get = dsum_tag_of_data s;
}
let gaccessor_dsum_tag
(#kt: parser_kind)
(t: dsum)
(p: parser kt (dsum_repr_type t))
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
: Tot (gaccessor (parse_dsum t p f g) (parse_maybe_enum_key p (dsum_enum t)) (clens_dsum_tag t))
= gaccessor_tagged_union_tag
(parse_maybe_enum_key p (dsum_enum t))
(dsum_tag_of_data t)
(parse_dsum_cases t f g)
inline_for_extraction
let accessor_dsum_tag
(#kt: parser_kind)
(t: dsum)
(p: parser kt (dsum_repr_type t))
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
: Tot (accessor (gaccessor_dsum_tag t p f g))
= accessor_tagged_union_tag
(parse_maybe_enum_key p (dsum_enum t))
(dsum_tag_of_data t)
(parse_dsum_cases t f g)
let clens_dsum_payload
(s: dsum)
(k: dsum_key s)
: Tot (clens (dsum_type s) (dsum_type_of_tag s k))
= {
clens_cond = (fun (x: dsum_type s) -> dsum_tag_of_data s x == k);
clens_get = (fun (x: dsum_type s) -> synth_dsum_case_recip s k x <: Ghost (dsum_type_of_tag s k) (requires (dsum_tag_of_data s x == k)) (ensures (fun _ -> True)));
}
let clens_dsum_unknown_payload
(s: dsum)
: Tot (clens (dsum_type s) (dsum_type_of_unknown_tag s))
= {
clens_cond = (fun (x: dsum_type s) -> Unknown? (dsum_tag_of_data s x));
clens_get = (fun (x: dsum_type s) -> synth_dsum_case_recip s (dsum_tag_of_data s x) x <: Ghost (dsum_type_of_unknown_tag s) (requires (Unknown? (dsum_tag_of_data s x))) (ensures (fun _ -> True)));
}
#push-options "--z3rlimit 16"
let gaccessor_clens_dsum_payload'
(#kt: parser_kind)
(t: dsum)
(p: parser kt (dsum_repr_type t))
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
(k: dsum_key t)
: Tot (gaccessor' (parse_dsum t p f g) (parse_dsum_type_of_tag' t f g k) (clens_dsum_payload t k))
= fun (input: bytes) ->
parse_dsum_eq3 t p f g input;
let res =
match parse p input with
| Some (_, consumed) ->
synth_dsum_case_inverse t k;
synth_dsum_case_injective t k;
synth_injective_synth_inverse_synth_inverse_recip (synth_dsum_case t k) (synth_dsum_case_recip t k) ();
(consumed)
| _ -> (0) // dummy
in
(res <: (res: _ { gaccessor_post' (parse_dsum t p f g) (parse_dsum_type_of_tag' t f g k) (clens_dsum_payload t k) input res } ))
let gaccessor_clens_dsum_payload_injective
(#kt: parser_kind)
(t: dsum)
(p: parser kt (dsum_repr_type t))
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
(k: dsum_key t)
(sl sl' : bytes)
: Lemma
(requires (
gaccessor_pre (parse_dsum t p f g) (parse_dsum_type_of_tag' t f g k) (clens_dsum_payload t k) sl /\
gaccessor_pre (parse_dsum t p f g) (parse_dsum_type_of_tag' t f g k) (clens_dsum_payload t k) sl' /\
injective_precond (parse_dsum t p f g) sl sl'
))
(ensures (
gaccessor_clens_dsum_payload' t p f g k sl == gaccessor_clens_dsum_payload' t p f g k sl'
))
=
parse_dsum_eq3 t p f g sl;
parse_dsum_eq3 t p f g sl';
parse_injective (parse_dsum t p f g) sl sl' ;
parse_injective p sl sl'
let gaccessor_clens_dsum_payload_no_lookahead
(#kt: parser_kind)
(t: dsum)
(p: parser kt (dsum_repr_type t))
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
(k: dsum_key t)
(sl sl' : bytes)
: Lemma
(requires (
(parse_dsum_kind kt t f ku).parser_kind_subkind == Some ParserStrong /\
gaccessor_pre (parse_dsum t p f g) (parse_dsum_type_of_tag' t f g k) (clens_dsum_payload t k) sl /\
gaccessor_pre (parse_dsum t p f g) (parse_dsum_type_of_tag' t f g k) (clens_dsum_payload t k) sl' /\
no_lookahead_on_precond (parse_dsum t p f g) sl sl'
))
(ensures (
gaccessor_clens_dsum_payload' t p f g k sl == gaccessor_clens_dsum_payload' t p f g k sl'
))
= parse_dsum_eq3 t p f g sl;
parse_dsum_eq3 t p f g sl';
parse_strong_prefix (parse_dsum t p f g) sl sl' ;
parse_injective p sl sl'
let gaccessor_clens_dsum_payload
(#kt: parser_kind)
(t: dsum)
(p: parser kt (dsum_repr_type t))
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
(k: dsum_key t)
: Tot (gaccessor (parse_dsum t p f g) (parse_dsum_type_of_tag' t f g k) (clens_dsum_payload t k))
= Classical.forall_intro_2 (fun x -> Classical.move_requires (gaccessor_clens_dsum_payload_injective t p f g k x));
Classical.forall_intro_2 (fun x -> Classical.move_requires (gaccessor_clens_dsum_payload_no_lookahead t p f g k x));
gaccessor_prop_equiv (parse_dsum t p f g) (parse_dsum_type_of_tag' t f g k) (clens_dsum_payload t k) (gaccessor_clens_dsum_payload' t p f g k);
gaccessor_clens_dsum_payload' t p f g k
inline_for_extraction
let accessor_clens_dsum_payload'
(#kt: parser_kind)
(t: dsum)
(#p: parser kt (dsum_repr_type t))
(j: jumper p)
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
(k: dsum_key t)
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: HST.Stack U32.t
(requires (fun h ->
valid (parse_dsum t p f g) h input pos /\
(clens_dsum_payload t k).clens_cond (contents (parse_dsum t p f g) h input pos)
))
(ensures (fun h pos' h' ->
B.modifies B.loc_none h h' /\
pos' == slice_access h (gaccessor_clens_dsum_payload t p f g k) input pos
))
=
let h = HST.get () in
[@inline_let]
let _ =
let pos' = get_valid_pos (parse_dsum t p f g) h input pos in
let large = bytes_of_slice_from h input pos in
slice_access_eq h (gaccessor_clens_dsum_payload t p f g k) input pos;
valid_facts (parse_dsum t p f g) h input pos;
parse_dsum_eq3 t p f g large;
valid_facts p h input pos
in
j input pos
#pop-options
inline_for_extraction
let accessor_clens_dsum_payload
(#kt: parser_kind)
(t: dsum)
(#p: parser kt (dsum_repr_type t))
(j: jumper p)
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
(k: dsum_key t)
: Tot (accessor (gaccessor_clens_dsum_payload t p f g k))
= fun #rrel #rel -> accessor_clens_dsum_payload' t j f g k #rrel #rel
#push-options "--z3rlimit 16"
let gaccessor_clens_dsum_unknown_payload'
(#kt: parser_kind)
(t: dsum)
(p: parser kt (dsum_repr_type t))
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
: Tot (gaccessor' (parse_dsum t p f g) g (clens_dsum_unknown_payload t))
= fun (input: bytes) ->
parse_dsum_eq3 t p f g input;
let res =
match parse p input with
| Some (tg, consumed) ->
let k = maybe_enum_key_of_repr (dsum_enum t) tg in
synth_dsum_case_inverse t k;
synth_dsum_case_injective t k;
synth_injective_synth_inverse_synth_inverse_recip (synth_dsum_case t k) (synth_dsum_case_recip t k) ();
(consumed)
| _ -> (0) // dummy
in
(res <: (res: _ { gaccessor_post' (parse_dsum t p f g) g (clens_dsum_unknown_payload t) input res } ))
let gaccessor_clens_dsum_unknown_payload_injective
(#kt: parser_kind)
(t: dsum)
(p: parser kt (dsum_repr_type t))
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
(sl sl' : bytes)
: Lemma
(requires (
gaccessor_pre (parse_dsum t p f g) g (clens_dsum_unknown_payload t) sl /\
gaccessor_pre (parse_dsum t p f g) g (clens_dsum_unknown_payload t) sl' /\
injective_precond (parse_dsum t p f g) sl sl'
))
(ensures (gaccessor_clens_dsum_unknown_payload' t p f g sl == gaccessor_clens_dsum_unknown_payload' t p f g sl'))
= parse_dsum_eq3 t p f g sl;
parse_dsum_eq3 t p f g sl';
parse_injective (parse_dsum t p f g) sl sl' ;
parse_injective p sl sl'
let gaccessor_clens_dsum_unknown_payload_no_lookahead
(#kt: parser_kind)
(t: dsum)
(p: parser kt (dsum_repr_type t))
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
(sl sl' : bytes)
: Lemma
(requires (
(parse_dsum_kind kt t f ku).parser_kind_subkind == Some ParserStrong /\
gaccessor_pre (parse_dsum t p f g) g (clens_dsum_unknown_payload t) sl /\
gaccessor_pre (parse_dsum t p f g) g (clens_dsum_unknown_payload t) sl' /\
no_lookahead_on_precond (parse_dsum t p f g) sl sl'
))
(ensures (gaccessor_clens_dsum_unknown_payload' t p f g sl == gaccessor_clens_dsum_unknown_payload' t p f g sl'))
=
parse_dsum_eq3 t p f g sl;
parse_dsum_eq3 t p f g sl';
parse_strong_prefix (parse_dsum t p f g) sl sl' ;
parse_injective p sl sl'
let gaccessor_clens_dsum_unknown_payload
(#kt: parser_kind)
(t: dsum)
(p: parser kt (dsum_repr_type t))
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
: Tot (gaccessor (parse_dsum t p f g) g (clens_dsum_unknown_payload t))
= Classical.forall_intro_2 (fun x -> Classical.move_requires (gaccessor_clens_dsum_unknown_payload_injective t p f g x));
Classical.forall_intro_2 (fun x -> Classical.move_requires (gaccessor_clens_dsum_unknown_payload_no_lookahead t p f g x));
gaccessor_prop_equiv (parse_dsum t p f g) g (clens_dsum_unknown_payload t) (gaccessor_clens_dsum_unknown_payload' t p f g);
gaccessor_clens_dsum_unknown_payload' t p f g
inline_for_extraction
let accessor_clens_dsum_unknown_payload'
(#kt: parser_kind)
(t: dsum)
(#p: parser kt (dsum_repr_type t))
(j: jumper p)
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: HST.Stack U32.t
(requires (fun h ->
valid (parse_dsum t p f g) h input pos /\
(clens_dsum_unknown_payload t).clens_cond (contents (parse_dsum t p f g) h input pos)
))
(ensures (fun h pos' h' ->
B.modifies B.loc_none h h' /\
pos' == slice_access h (gaccessor_clens_dsum_unknown_payload t p f g) input pos
))
=
let h = HST.get () in
[@inline_let]
let _ =
let pos' = get_valid_pos (parse_dsum t p f g) h input pos in
let large = bytes_of_slice_from h input pos in
slice_access_eq h (gaccessor_clens_dsum_unknown_payload t p f g) input pos;
valid_facts (parse_dsum t p f g) h input pos;
parse_dsum_eq3 t p f g large;
valid_facts p h input pos
in
j input pos
#pop-options
inline_for_extraction
let accessor_clens_dsum_unknown_payload
(#kt: parser_kind)
(t: dsum)
(#p: parser kt (dsum_repr_type t))
(j: jumper p { kt.parser_kind_subkind == Some ParserStrong })
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
: Tot (accessor (gaccessor_clens_dsum_unknown_payload t p f g))
= fun #rrel #rel -> accessor_clens_dsum_unknown_payload' t j f g #rrel #rel | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"LowStar.Buffer.fst.checked",
"LowParse.Spec.Sum.fst.checked",
"LowParse.Low.Enum.fst.checked",
"FStar.UInt64.fsti.checked",
"FStar.UInt32.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Int.Cast.fst.checked",
"FStar.HyperStack.ST.fsti.checked",
"FStar.HyperStack.fst.checked",
"FStar.Classical.fsti.checked"
],
"interface_file": false,
"source_file": "LowParse.Low.Sum.fst"
} | [
{
"abbrev": true,
"full_module": "FStar.HyperStack",
"short_module": "HS"
},
{
"abbrev": true,
"full_module": "FStar.UInt64",
"short_module": "U64"
},
{
"abbrev": true,
"full_module": "FStar.Int.Cast",
"short_module": "Cast"
},
{
"abbrev": true,
"full_module": "LowStar.Buffer",
"short_module": "B"
},
{
"abbrev": true,
"full_module": "FStar.HyperStack.ST",
"short_module": "HST"
},
{
"abbrev": true,
"full_module": "FStar.UInt32",
"short_module": "U32"
},
{
"abbrev": false,
"full_module": "LowParse.Spec.Sum",
"short_module": null
},
{
"abbrev": false,
"full_module": "LowParse.Low.Enum",
"short_module": null
},
{
"abbrev": false,
"full_module": "LowParse.Low",
"short_module": null
},
{
"abbrev": false,
"full_module": "LowParse.Low",
"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",
"short_module": null
}
] | {
"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_elim_box": false,
"smtencoding_l_arith_repr": "boxwrap",
"smtencoding_nl_arith_repr": "boxwrap",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": true,
"z3cliopt": [],
"z3refresh": false,
"z3rlimit": 5,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | false | s: LowParse.Spec.Sum.dsum -> k: LowParse.Spec.Sum.dsum_key s
-> LowParse.Low.Base.Spec.clens (LowParse.Spec.Sum.dsum_cases s k)
(LowParse.Spec.Sum.dsum_type_of_tag s k) | Prims.Tot | [
"total"
] | [] | [
"LowParse.Spec.Sum.dsum",
"LowParse.Spec.Sum.dsum_key",
"LowParse.Low.Base.Spec.Mkclens",
"LowParse.Spec.Sum.dsum_cases",
"LowParse.Spec.Sum.dsum_type_of_tag",
"Prims.l_True",
"LowParse.Spec.Sum.synth_dsum_case_recip",
"LowParse.Low.Base.Spec.clens"
] | [] | false | false | false | false | false | let clens_dsum_cases_payload (s: dsum) (k: dsum_key s)
: Tot (clens (dsum_cases s k) (dsum_type_of_tag s k)) =
| {
clens_cond = (fun (x: dsum_cases s k) -> True);
clens_get
=
(fun (x: dsum_cases s k) ->
synth_dsum_case_recip s k x
<:
Ghost (dsum_type_of_tag s k) (requires (True)) (ensures (fun _ -> True)))
} | false |
Vale.Curve25519.Fast_defs.fst | Vale.Curve25519.Fast_defs.add_carry | val add_carry (x y: nat64) (c: bit) : nat64 & (c': nat{c = 0 || c = 1}) | val add_carry (x y: nat64) (c: bit) : nat64 & (c': nat{c = 0 || c = 1}) | let add_carry (x y:nat64) (c:bit) : nat64 & (c':nat{c = 0 || c = 1})
=
add_wrap64 (add_wrap64 x y) c,
(if x + y + c >= pow2_64 then 1 else 0) | {
"file_name": "vale/code/crypto/ecc/curve25519/Vale.Curve25519.Fast_defs.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 41,
"end_line": 44,
"start_col": 0,
"start_line": 41
} | module Vale.Curve25519.Fast_defs
open Vale.Def.Words_s
open Vale.Def.Types_s
open FStar.Mul
unfold let pow2_192 = 0x1000000000000000000000000000000000000000000000000
let _ = assert_norm (pow2 192 = pow2_192)
unfold let pow2_256 = 0x10000000000000000000000000000000000000000000000000000000000000000
let _ = assert_norm (pow2 256 = pow2_256)
unfold let pow2_320 = 0x100000000000000000000000000000000000000000000000000000000000000000000000000000000
let _ = assert_norm (pow2 320 = pow2_320)
unfold let pow2_384 = 0x1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000
let _ = assert_norm (pow2 384 = pow2_384)
unfold let pow2_448 = 0x10000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000
let _ = assert_norm (pow2 448 = pow2_448)
unfold let pow2_512 = 0x100000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000
let _ = assert_norm (pow2 512 = pow2_512)
let pow2_two (c0 c1:nat) : nat = c0 + pow2_64 * c1
let pow2_three (c0 c1 c2:nat) : nat = pow2_two c0 c1 + pow2_128 * c2
let pow2_four (c0 c1 c2 c3:nat) : nat = pow2_three c0 c1 c2 + pow2_192 * c3
let pow2_five (c0 c1 c2 c3 c4:nat) : nat = pow2_four c0 c1 c2 c3 + pow2_256 * c4
let pow2_six (c0 c1 c2 c3 c4 c5:nat) : nat = pow2_five c0 c1 c2 c3 c4 + pow2_320 * c5
let pow2_seven (c0 c1 c2 c3 c4 c5 c6:nat) : nat = pow2_six c0 c1 c2 c3 c4 c5 + pow2_384 * c6
let pow2_eight (c0 c1 c2 c3 c4 c5 c6 c7:nat) : nat = pow2_seven c0 c1 c2 c3 c4 c5 c6 + pow2_448 * c7
let pow2_nine (c0 c1 c2 c3 c4 c5 c6 c7 c8:nat) : nat = pow2_eight c0 c1 c2 c3 c4 c5 c6 c7 + pow2_512 * c8
unfold let prime:nat = 57896044618658097711785492504343953926634992332820282019728792003956564819949 //(pow2 255) - 19
type bit = b:nat { b <= 1 }
let bool_bit (b:bool) : bit = if b then 1 else 0
let mul_nats (x y:nat) : nat =
let prod = x * y in
Vale.Curve25519.Fast_lemmas_internal.lemma_mul_bounds_le 0 x 0 y;
prod | {
"checked_file": "/",
"dependencies": [
"Vale.Def.Words_s.fsti.checked",
"Vale.Def.Types_s.fst.checked",
"Vale.Curve25519.Fast_lemmas_internal.fsti.checked",
"Vale.Arch.Types.fsti.checked",
"prims.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked"
],
"interface_file": false,
"source_file": "Vale.Curve25519.Fast_defs.fst"
} | [
{
"abbrev": false,
"full_module": "Vale.Arch.Types",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Def.Types_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Def.Words_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Curve25519",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Curve25519",
"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",
"short_module": null
}
] | {
"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_elim_box": true,
"smtencoding_l_arith_repr": "native",
"smtencoding_nl_arith_repr": "wrapped",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": false,
"z3cliopt": [
"smt.arith.nl=false",
"smt.QI.EAGER_THRESHOLD=100",
"smt.CASE_SPLIT=3"
],
"z3refresh": false,
"z3rlimit": 5,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | false | x: Vale.Def.Types_s.nat64 -> y: Vale.Def.Types_s.nat64 -> c: Vale.Curve25519.Fast_defs.bit
-> Vale.Def.Types_s.nat64 * c': Prims.nat{c = 0 || c = 1} | Prims.Tot | [
"total"
] | [] | [
"Vale.Def.Types_s.nat64",
"Vale.Curve25519.Fast_defs.bit",
"FStar.Pervasives.Native.Mktuple2",
"Prims.nat",
"Prims.b2t",
"Prims.op_BarBar",
"Prims.op_Equality",
"Prims.int",
"Vale.Arch.Types.add_wrap64",
"Prims.op_GreaterThanOrEqual",
"Prims.op_Addition",
"Vale.Def.Words_s.pow2_64",
"Prims.bool",
"FStar.Pervasives.Native.tuple2"
] | [] | false | false | false | false | false | let add_carry (x y: nat64) (c: bit) : nat64 & (c': nat{c = 0 || c = 1}) =
| add_wrap64 (add_wrap64 x y) c, (if x + y + c >= pow2_64 then 1 else 0) | false |
LowParse.Low.Sum.fst | LowParse.Low.Sum.clens_dsum_unknown_payload | val clens_dsum_unknown_payload (s: dsum) : Tot (clens (dsum_type s) (dsum_type_of_unknown_tag s)) | val clens_dsum_unknown_payload (s: dsum) : Tot (clens (dsum_type s) (dsum_type_of_unknown_tag s)) | let clens_dsum_unknown_payload
(s: dsum)
: Tot (clens (dsum_type s) (dsum_type_of_unknown_tag s))
= {
clens_cond = (fun (x: dsum_type s) -> Unknown? (dsum_tag_of_data s x));
clens_get = (fun (x: dsum_type s) -> synth_dsum_case_recip s (dsum_tag_of_data s x) x <: Ghost (dsum_type_of_unknown_tag s) (requires (Unknown? (dsum_tag_of_data s x))) (ensures (fun _ -> True)));
} | {
"file_name": "src/lowparse/LowParse.Low.Sum.fst",
"git_rev": "00217c4a89f5ba56002ba9aa5b4a9d5903bfe9fa",
"git_url": "https://github.com/project-everest/everparse.git",
"project_name": "everparse"
} | {
"end_col": 3,
"end_line": 1815,
"start_col": 0,
"start_line": 1809
} | module LowParse.Low.Sum
include LowParse.Low.Enum
include LowParse.Spec.Sum
module U32 = FStar.UInt32
module HST = FStar.HyperStack.ST
module B = LowStar.Buffer
module Cast = FStar.Int.Cast
module U64 = FStar.UInt64
inline_for_extraction
let validate_sum_cases_aux
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(vc: ((x: sum_key t) -> Tot (validator (dsnd (pc x)))))
(k: sum_key t)
: Tot (validator (parse_sum_cases t pc k))
= [@inline_let]
let _ = synth_sum_case_injective t k in
validate_synth
(validate_weaken
(weaken_parse_cases_kind t pc)
(vc k)
()
)
(synth_sum_case t k)
()
inline_for_extraction
let validate_sum_cases_t
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot Type
= validator (parse_sum_cases t pc k)
let validate_sum_cases_t_eq
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
(x y : validate_sum_cases_t t pc k)
: GTot Type0
= True
inline_for_extraction
let validate_sum_cases_t_if
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (if_combinator _ (validate_sum_cases_t_eq t pc k))
= fun cond (sv_true: cond_true cond -> Tot (validate_sum_cases_t t pc k)) (sv_false: cond_false cond -> Tot (validate_sum_cases_t t pc k)) #rrel #rel input pos ->
if cond
then sv_true () input pos
else sv_false () input pos
inline_for_extraction
let validate_sum_cases
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(vc: ((x: sum_key t) -> Tot (validator (dsnd (pc x)))))
(destr: dep_enum_destr (sum_enum t) (validate_sum_cases_t t pc))
(k: sum_key t)
: Tot (validator (parse_sum_cases t pc k))
= destr
_
(validate_sum_cases_t_if t pc)
(fun _ _ -> ())
(fun _ _ _ _ -> ())
(validate_sum_cases_aux t pc vc)
k
inline_for_extraction
let validate_sum_aux_payload_t
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
: Tot Type
= (#rrel: _) -> (#rel: _) ->
(input: slice rrel rel) ->
(pos: U64.t) ->
HST.Stack U64.t
(requires (fun h -> live_slice h input /\ U64.v pos <= U32.v input.len))
(ensures (fun h res h' ->
B.modifies B.loc_none h h' /\ (
match k with
| Unknown _ -> is_error res
| Known k' ->
if is_success res
then
valid_pos (dsnd (pc k')) h input (uint64_to_uint32 pos) (uint64_to_uint32 res)
else
(~ (valid (dsnd (pc k')) h input (uint64_to_uint32 pos)))
)))
let validate_sum_aux_payload_eq
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
: Tot (validate_sum_aux_payload_t t pc k -> validate_sum_aux_payload_t t pc k -> GTot Type0)
= fun _ _ -> True
inline_for_extraction
let validate_sum_aux_payload_if'
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
(cond: bool)
(ift: ((cond_true cond) -> Tot (validate_sum_aux_payload_t t pc k)))
(iff: ((cond_false cond) -> Tot (validate_sum_aux_payload_t t pc k)))
: Tot (validate_sum_aux_payload_t t pc k)
= fun #rrel #rel input pos ->
if cond
then begin
(ift () <: validate_sum_aux_payload_t t pc k) input pos
end else
(iff () <: validate_sum_aux_payload_t t pc k) input pos
inline_for_extraction
let validate_sum_aux_payload_if
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
: Tot (if_combinator _ (validate_sum_aux_payload_eq t pc k))
= validate_sum_aux_payload_if' t pc k
#push-options "--z3rlimit 64 --z3cliopt smt.arith.nl=false --using_facts_from '* -FStar.Int.Cast -LowParse.BitFields'"
// --query_stats --smtencoding.elim_box true --smtencoding.l_arith_repr native --z3refresh"
inline_for_extraction
let validate_sum_aux
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(v: validator p)
(p32: leaf_reader p)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(v_payload: ((k: sum_repr_type t)) -> Tot (validate_sum_aux_payload_t t pc (maybe_enum_key_of_repr (sum_enum t) k)))
: Tot (validator (parse_sum t p pc))
= fun #rrel #rel input pos ->
let h = HST.get () in
[@inline_let]
let _ = parse_sum_eq'' t p pc (bytes_of_slice_from h input (uint64_to_uint32 pos)) in
[@inline_let]
let _ = valid_facts (parse_sum t p pc) h input (uint64_to_uint32 pos) in
[@inline_let]
let _ = valid_facts p h input (uint64_to_uint32 pos) in
let len_after_tag = v input pos in
if is_error len_after_tag
then len_after_tag
else begin
let h1 = HST.get () in
let k' = p32 input (uint64_to_uint32 pos) in
[@inline_let]
let _ =
match maybe_enum_key_of_repr (sum_enum t) k' with
| Known k -> valid_facts (dsnd (pc k)) h input (uint64_to_uint32 len_after_tag)
| _ -> ()
in
v_payload k' input len_after_tag
end
#pop-options
inline_for_extraction
let validate_sum_aux_payload'
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (validator (dsnd (pc x)))))
(k: maybe_enum_key (sum_enum t))
: Tot (validate_sum_aux_payload_t t pc k)
= fun #rrel #rel input pos ->
match k with
| Known k ->
[@inline_let]
let _ = synth_sum_case_injective t k in
pc32 k input pos
// validate_synth (pc32 k) (synth_sum_case t k) () input pos
| _ -> validator_error_generic
inline_for_extraction
let validate_sum_aux_payload
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (validator (dsnd (pc x)))))
(destr: dep_maybe_enum_destr_t (sum_enum t) (validate_sum_aux_payload_t t pc))
(k: sum_repr_type t)
: Tot (validate_sum_aux_payload_t t pc (maybe_enum_key_of_repr (sum_enum t) k))
= destr (validate_sum_aux_payload_eq t pc) (validate_sum_aux_payload_if t pc) (fun _ _ -> ()) (fun _ _ _ _ -> ()) (validate_sum_aux_payload' t pc pc32) k
inline_for_extraction
let validate_sum
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(v: validator p)
(p32: leaf_reader p)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (validator (dsnd (pc x)))))
(destr: dep_maybe_enum_destr_t (sum_enum t) (validate_sum_aux_payload_t t pc))
: Tot (validator (parse_sum t p pc))
= validate_sum_aux t v p32 pc (validate_sum_aux_payload t pc pc32 destr)
module HS = FStar.HyperStack
#push-options "--z3rlimit 256 --z3cliopt smt.arith.nl=false --initial_ifuel 8 --max_ifuel 8 --initial_fuel 2 --max_fuel 2"
#restart-solver
let valid_sum_intro
(h: HS.mem)
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: Lemma
(requires (
valid (parse_enum_key p (sum_enum t)) h input pos /\ (
let k = contents (parse_enum_key p (sum_enum t)) h input pos in
valid (dsnd (pc k)) h input (get_valid_pos (parse_enum_key p (sum_enum t)) h input pos)
)))
(ensures (
let k = contents (parse_enum_key p (sum_enum t)) h input pos in
let pos_payload = get_valid_pos (parse_enum_key p (sum_enum t)) h input pos in
valid_content_pos
(parse_sum t p pc) h input pos
(synth_sum_case t k (contents (dsnd (pc k)) h input pos_payload))
(get_valid_pos (dsnd (pc k)) h input pos_payload)
))
= valid_facts (parse_enum_key p (sum_enum t)) h input pos;
let k = contents (parse_enum_key p (sum_enum t)) h input pos in
let pos_payload = get_valid_pos (parse_enum_key p (sum_enum t)) h input pos in
valid_facts (dsnd (pc k)) h input pos_payload;
valid_facts (parse_sum t p pc) h input pos;
parse_sum_eq t p pc (bytes_of_slice_from h input pos)
#pop-options
inline_for_extraction
let finalize_sum_case
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(s: serializer p)
(w: leaf_writer_strong s)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(destr: enum_repr_of_key'_t (sum_enum t))
(k: sum_key t)
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: HST.Stack unit
(requires (fun h ->
let len_tag = serialized_length (serialize_enum_key _ s (sum_enum t)) k in
U32.v pos + len_tag < 4294967296 /\ (
let pos_payload = pos `U32.add` U32.uint_to_t len_tag in
valid (dsnd (pc k)) h input pos_payload /\
writable input.base (U32.v pos) (U32.v pos_payload) h
)))
(ensures (fun h _ h' ->
let len_tag = serialized_length (serialize_enum_key _ s (sum_enum t)) k in
let pos_payload = pos `U32.add` U32.uint_to_t len_tag in
B.modifies (loc_slice_from_to input pos pos_payload) h h' /\
valid_content_pos (parse_sum t p pc) h' input pos (synth_sum_case t k (contents (dsnd (pc k)) h input pos_payload)) (get_valid_pos (dsnd (pc k)) h input pos_payload)
))
= let pos1 = write_enum_key w (sum_enum t) destr k input pos in
let h = HST.get () in
[@inline_let]
let _ = valid_sum_intro h t p pc input pos in
()
inline_for_extraction
let jump_sum_cases_aux
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(vc: ((x: sum_key t) -> Tot (jumper (dsnd (pc x)))))
(k: sum_key t)
: Tot (jumper (parse_sum_cases t pc k))
= [@inline_let]
let _ = synth_sum_case_injective t k in
jump_synth
(jump_weaken
(weaken_parse_cases_kind t pc)
(vc k)
()
)
(synth_sum_case t k)
()
inline_for_extraction
let jump_sum_cases_t
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot Type
= jumper (parse_sum_cases t pc k)
let jump_sum_cases_t_eq
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
(x y : jump_sum_cases_t t pc k)
: GTot Type0
= True
inline_for_extraction
let jump_sum_cases_t_if
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (if_combinator _ (jump_sum_cases_t_eq t pc k))
= fun cond (sv_true: cond_true cond -> Tot (jump_sum_cases_t t pc k)) (sv_false: cond_false cond -> Tot (jump_sum_cases_t t pc k)) #rrel #rel input pos ->
if cond
then sv_true () input pos
else sv_false () input pos
inline_for_extraction
let jump_sum_cases
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(vc: ((x: sum_key t) -> Tot (jumper (dsnd (pc x)))))
(destr: dep_enum_destr (sum_enum t) (jump_sum_cases_t t pc))
(k: sum_key t)
: Tot (jumper (parse_sum_cases t pc k))
= destr
_
(jump_sum_cases_t_if t pc)
(fun _ _ -> ())
(fun _ _ _ _ -> ())
(jump_sum_cases_aux t pc vc)
k
inline_for_extraction
let jump_sum_aux_payload_t
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
: Tot Type
= (#rrel: _) -> (#rel: _) ->
(input: slice rrel rel) ->
(pos: U32.t) ->
HST.Stack U32.t
(requires (fun h -> live_slice h input /\ U32.v pos <= U32.v input.len /\ (
match k with
| Unknown _ -> False
| Known k' -> valid (dsnd (pc k')) h input pos
)))
(ensures (fun h res h' ->
B.modifies B.loc_none h h' /\ (
match k with
| Unknown _ -> False
| Known k' ->
valid_pos (dsnd (pc k')) h input pos res
)))
let jump_sum_aux_payload_eq
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
: Tot (jump_sum_aux_payload_t t pc k -> jump_sum_aux_payload_t t pc k -> GTot Type0)
= fun _ _ -> True
inline_for_extraction
let jump_sum_aux_payload_if'
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
(cond: bool)
(ift: ((cond_true cond) -> Tot (jump_sum_aux_payload_t t pc k)))
(iff: ((cond_false cond) -> Tot (jump_sum_aux_payload_t t pc k)))
: Tot (jump_sum_aux_payload_t t pc k)
= fun #rrel #rel input pos ->
if cond
then begin
(ift () <: jump_sum_aux_payload_t t pc k) input pos
end else
(iff () <: jump_sum_aux_payload_t t pc k) input pos
inline_for_extraction
let jump_sum_aux_payload_if
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
: Tot (if_combinator _ (jump_sum_aux_payload_eq t pc k))
= jump_sum_aux_payload_if' t pc k
let parse_sum_eq3
(#kt: parser_kind)
(t: sum)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(input: bytes)
(k' : sum_repr_type t)
(consumed_k: consumed_length input)
: Lemma
(requires (Some? (parse (parse_sum t p pc) input) /\ parse p input == Some (k', consumed_k)))
(ensures (
let input_k = Seq.slice input consumed_k (Seq.length input) in
let k = maybe_enum_key_of_repr (sum_enum t) k' in
begin match k with
| Known k ->
Some? (parse (dsnd (pc k)) input_k)
| _ -> False
end
))
= parse_sum_eq'' t p pc input
let parse_sum_eq4
(#kt: parser_kind)
(t: sum)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(input: bytes)
(k' : sum_repr_type t)
(consumed_k: consumed_length input)
(consumed_payload: nat)
: Lemma
(requires (Some? (parse (parse_sum t p pc) input) /\ parse p input == Some (k', consumed_k) /\ (
let input_k = Seq.slice input consumed_k (Seq.length input) in
let k = maybe_enum_key_of_repr (sum_enum t) k' in
begin match k with
| Known k ->
Some? (parse (dsnd (pc k)) input_k) /\ (
let Some (_, consumed_payload') = parse (dsnd (pc k)) input_k in
consumed_payload' == consumed_payload
)
| _ -> False
end
)))
(ensures (
let Some (_, consumed) = parse (parse_sum t p pc) input in
consumed == consumed_k + consumed_payload
))
= parse_sum_eq'' t p pc input
#push-options "--z3rlimit 16"
let valid_sum_elim
(h: HS.mem)
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(#rrel: _) (#rel: _)
(input: slice rrel rel)
(pos: U32.t)
: Lemma
(requires (
valid (parse_sum t p pc) h input pos
))
(ensures (
valid p h input pos /\ (
let pos_payload = get_valid_pos p h input pos in
let k' = maybe_enum_key_of_repr (sum_enum t) (contents p h input pos) in
match k' with
| Known k ->
k == sum_tag_of_data t (contents (parse_sum t p pc) h input pos) /\
valid (dsnd (pc k)) h input pos_payload /\
valid_pos
(parse_sum t p pc) h input pos
(get_valid_pos (dsnd (pc k)) h input pos_payload)
| _ -> False
)))
= let sinput = bytes_of_slice_from h input pos in
let _ = parse_sum_eq'' t p pc sinput in
[@inline_let]
let _ = valid_facts (parse_sum t p pc) h input pos in
let Some (k', consumed_k) = parse p sinput in
let pos_after_tag = U32.uint_to_t (U32.v pos + consumed_k) in
[@inline_let]
let _ = valid_facts p h input pos in
assert (valid_content_pos p h input pos k' pos_after_tag);
match maybe_enum_key_of_repr (sum_enum t) k' with
| Known k -> valid_facts (dsnd (pc k)) h input pos_after_tag
| _ -> ()
#pop-options
let valid_sum_elim_tag
(h: HS.mem)
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: Lemma
(requires (
valid (parse_sum t p pc) h input pos
))
(ensures (
valid (parse_enum_key p (sum_enum t)) h input pos /\
contents (parse_enum_key p (sum_enum t)) h input pos == sum_tag_of_data t (contents (parse_sum t p pc) h input pos)
))
= let _ = parse_sum_eq' t p pc (bytes_of_slice_from h input pos) in
let _ = valid_facts (parse_sum t p pc) h input pos in
let _ = valid_facts (parse_enum_key p (sum_enum t)) h input pos in
()
inline_for_extraction
let read_sum_tag
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(p32: leaf_reader p)
(destr: dep_maybe_enum_destr_t (sum_enum t) (read_enum_key_t (sum_enum t)))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: HST.Stack (sum_key t)
(requires (fun h ->
valid (parse_sum t p pc) h input pos
))
(ensures (fun h res h' ->
B.modifies B.loc_none h h' /\
res == sum_tag_of_data t (contents (parse_sum t p pc) h input pos)
))
= let h = HST.get () in
[@inline_let] let _ = valid_sum_elim_tag h t p pc input pos in
read_enum_key p32 (sum_enum t) destr input pos
inline_for_extraction
let jump_sum_aux
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(v: jumper p)
(p32: leaf_reader p)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(v_payload: ((k: sum_repr_type t)) -> Tot (jump_sum_aux_payload_t t pc (maybe_enum_key_of_repr (sum_enum t) k)))
: Tot (jumper (parse_sum t p pc))
= fun #rrel #rel input pos ->
let h = HST.get () in
[@inline_let]
let _ = valid_sum_elim h t p pc input pos in
let pos_after_tag = v input pos in
let k' = p32 input pos in
v_payload k' input pos_after_tag
inline_for_extraction
let jump_sum_aux_payload'
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (jumper (dsnd (pc x)))))
(k: maybe_enum_key (sum_enum t))
: Tot (jump_sum_aux_payload_t t pc k)
= fun #rrel #rel input pos ->
match k with
| Known k ->
[@inline_let]
let _ = synth_sum_case_injective t k in
pc32 k input pos
| _ -> 0ul // dummy, but we MUST NOT remove this branch, otherwise extraction fails
inline_for_extraction
let jump_sum_aux_payload
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (jumper (dsnd (pc x)))))
(destr: dep_maybe_enum_destr_t (sum_enum t) (jump_sum_aux_payload_t t pc))
(k: sum_repr_type t)
: Tot (jump_sum_aux_payload_t t pc (maybe_enum_key_of_repr (sum_enum t) k))
= destr (jump_sum_aux_payload_eq t pc) (jump_sum_aux_payload_if t pc) (fun _ _ -> ()) (fun _ _ _ _ -> ()) (jump_sum_aux_payload' t pc pc32) k
inline_for_extraction
let jump_sum
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(v: jumper p)
(p32: leaf_reader p)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (jumper (dsnd (pc x)))))
(destr: dep_maybe_enum_destr_t (sum_enum t) (jump_sum_aux_payload_t t pc))
: Tot (jumper (parse_sum t p pc))
= jump_sum_aux t v p32 pc (jump_sum_aux_payload t pc pc32 destr)
inline_for_extraction
let read_sum_cases'
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (leaf_reader (dsnd (pc x)))))
(k: sum_key t)
: Tot (leaf_reader (parse_sum_cases' t pc k))
= [@inline_let]
let _ = synth_sum_case_injective t k in
read_synth'
(dsnd (pc k))
(synth_sum_case t k)
(pc32 k)
()
inline_for_extraction
let read_sum_cases_t
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot Type
= leaf_reader (parse_sum_cases' t pc k)
let read_sum_cases_t_eq
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
(x y : read_sum_cases_t t pc k)
: GTot Type0
= True
inline_for_extraction
let read_sum_cases_t_if
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (if_combinator _ (read_sum_cases_t_eq t pc k))
= fun cond (sv_true: cond_true cond -> Tot (read_sum_cases_t t pc k)) (sv_false: cond_false cond -> Tot (read_sum_cases_t t pc k)) #_ #_ input pos ->
if cond
then (sv_true () input pos)
else (sv_false () input pos)
inline_for_extraction
let read_sum_cases
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (leaf_reader (dsnd (pc x)))))
(destr: dep_enum_destr (sum_enum t) (read_sum_cases_t t pc))
(k: sum_key t)
: Tot (leaf_reader (parse_sum_cases' t pc k))
= destr
_
(read_sum_cases_t_if t pc)
(fun _ _ -> ())
(fun _ _ _ _ -> ())
(read_sum_cases' t pc pc32)
k
#push-options "--z3rlimit 32"
inline_for_extraction
let read_sum
(#kt: parser_kind)
(t: sum)
(p: parser kt (sum_repr_type t))
(p32: leaf_reader (parse_enum_key p (sum_enum t)))
(j: jumper p)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (leaf_reader (dsnd (pc x)))))
(destr: dep_enum_destr (sum_enum t) (read_sum_cases_t t pc))
: Tot (leaf_reader (parse_sum t p pc))
=
fun #_ #_ input pos ->
let h = HST.get () in
valid_facts (parse_sum t p pc) h input pos;
parse_sum_eq' t p pc (bytes_of_slice_from h input pos);
valid_facts (parse_enum_key p (sum_enum t)) h input pos;
let k = p32 input pos in
let pos' = jump_enum_key j (sum_enum t) input pos in
valid_facts (parse_sum_cases' t pc k) h input pos' ;
read_sum_cases t pc pc32 destr k input pos'
#pop-options
inline_for_extraction
let serialize32_sum_cases_t
(t: sum)
(#pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(sc: ((x: sum_key t) -> Tot (serializer (dsnd (pc x)))))
(k: sum_key t)
: Tot Type
= serializer32 (serialize_sum_cases t pc sc k)
let serialize32_sum_cases_t_eq
(t: sum)
(#pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(sc: ((x: sum_key t) -> Tot (serializer (dsnd (pc x)))))
(k: sum_key t)
(x y: serialize32_sum_cases_t t sc k)
: GTot Type0
= True
inline_for_extraction
let serialize32_sum_cases_t_if
(t: sum)
(#pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(sc: ((x: sum_key t) -> Tot (serializer (dsnd (pc x)))))
(k: sum_key t)
: Tot (if_combinator _ (serialize32_sum_cases_t_eq t sc k))
= fun cond (sv_true: (cond_true cond -> Tot (serialize32_sum_cases_t t sc k))) (sv_false: (cond_false cond -> Tot (serialize32_sum_cases_t t sc k))) x #rrel #rel b pos ->
if cond
then (sv_true () x b pos)
else (sv_false () x b pos)
inline_for_extraction
let serialize32_sum_cases_aux
(t: sum)
(#pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(sc: ((x: sum_key t) -> Tot (serializer (dsnd (pc x)))))
(sc32: ((x: sum_key t) -> Tot (serializer32 (sc x))))
(k: sum_key t)
: Tot (serializer32 (serialize_sum_cases t pc sc k))
= fun x #rrel #rel b pos ->
[@inline_let] let _ =
Classical.forall_intro (parse_sum_cases_eq' t pc k);
synth_sum_case_injective t k;
synth_sum_case_inverse t k
in
serialize32_synth
(sc32 k)
(synth_sum_case t k)
(synth_sum_case_recip t k)
(fun x -> synth_sum_case_recip t k x)
()
x
b
pos
inline_for_extraction
let serialize32_sum_cases
(t: sum)
(#pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(sc: ((x: sum_key t) -> Tot (serializer (dsnd (pc x)))))
(sc32: ((x: sum_key t) -> Tot (serializer32 (sc x))))
(destr: dep_enum_destr (sum_enum t) (serialize32_sum_cases_t t sc))
(k: sum_key t)
: Tot (serializer32 (serialize_sum_cases t pc sc k))
= destr
_
(serialize32_sum_cases_t_if t sc)
(fun _ _ -> ())
(fun _ _ _ _ -> ())
(serialize32_sum_cases_aux t sc sc32)
k
inline_for_extraction
let serialize32_sum
(#kt: parser_kind)
(t: sum)
(#p: parser kt (sum_repr_type t))
(s: serializer p {kt.parser_kind_subkind == Some ParserStrong})
(s32: serializer32 (serialize_enum_key _ s (sum_enum t)))
(#pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(sc: ((x: sum_key t) -> Tot (serializer (dsnd (pc x)))))
(sc32: ((x: sum_key t) -> Tot (serializer32 (sc x))))
(destr: dep_enum_destr (sum_enum t) (serialize32_sum_cases_t t sc))
: Tot (serializer32 (serialize_sum t s sc))
= fun x #rrel #rel b pos ->
serialize_sum_eq t s sc x;
let tg = sum_tag_of_data t x in
serialize32_nondep_then_aux s32 (serialize32_sum_cases t sc sc32 destr tg) tg x b pos
let clens_sum_tag
(s: sum)
: Tot (clens (sum_type s) (sum_key s))
= {
clens_cond = (fun _ -> True);
clens_get = sum_tag_of_data s;
}
let gaccessor_sum_tag
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
: Tot (gaccessor (parse_sum t p pc) (parse_enum_key p (sum_enum t)) (clens_sum_tag t))
= gaccessor_tagged_union_tag
(parse_enum_key p (sum_enum t))
(sum_tag_of_data t)
(parse_sum_cases t pc)
inline_for_extraction
let accessor_sum_tag
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
: Tot (accessor (gaccessor_sum_tag t p pc))
= accessor_tagged_union_tag
(parse_enum_key p (sum_enum t))
(sum_tag_of_data t)
(parse_sum_cases t pc)
let clens_sum_payload
(s: sum)
(k: sum_key s)
: Tot (clens (sum_type s) (sum_type_of_tag s k))
= {
clens_cond = (fun (x: sum_type s) -> sum_tag_of_data s x == k);
clens_get = (fun (x: sum_type s) -> synth_sum_case_recip s k x <: Ghost (sum_type_of_tag s k) (requires (sum_tag_of_data s x == k)) (ensures (fun _ -> True)));
}
#push-options "--z3rlimit 32"
let gaccessor_clens_sum_payload'
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (gaccessor' (parse_sum t p pc) (dsnd (pc k)) (clens_sum_payload t k))
= fun (input: bytes) ->
parse_sum_eq'' t p pc input;
let res =
match parse p input with
| Some (_, consumed) ->
synth_sum_case_inverse t k;
synth_sum_case_injective t k;
synth_injective_synth_inverse_synth_inverse_recip (synth_sum_case t k) (synth_sum_case_recip t k) ();
(consumed)
| _ -> 0 // dummy
in
(res <: (res: _ { gaccessor_post' (parse_sum t p pc) (dsnd (pc k)) (clens_sum_payload t k) input res } ))
#push-options "--z3rlimit 64"
let gaccessor_clens_sum_payload_injective
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
(sl sl' : bytes)
: Lemma
(requires (
gaccessor_pre (parse_sum t p pc) (dsnd (pc k)) (clens_sum_payload t k) sl /\
gaccessor_pre (parse_sum t p pc) (dsnd (pc k)) (clens_sum_payload t k) sl' /\
injective_precond (parse_sum t p pc) sl sl'
))
(ensures (gaccessor_clens_sum_payload' t p pc k sl == gaccessor_clens_sum_payload' t p pc k sl'))
= parse_sum_eq'' t p pc sl;
parse_sum_eq'' t p pc sl' ;
parse_injective (parse_sum t p pc) sl sl' ;
parse_injective p sl sl'
#pop-options
let gaccessor_clens_sum_payload_no_lookahead
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
(sl sl' : bytes)
: Lemma
(requires (
(parse_sum_kind kt t pc).parser_kind_subkind == Some ParserStrong /\
gaccessor_pre (parse_sum t p pc) (dsnd (pc k)) (clens_sum_payload t k) sl /\
gaccessor_pre (parse_sum t p pc) (dsnd (pc k)) (clens_sum_payload t k) sl' /\
no_lookahead_on_precond (parse_sum t p pc) sl sl'
))
(ensures (gaccessor_clens_sum_payload' t p pc k sl == gaccessor_clens_sum_payload' t p pc k sl'))
= parse_sum_eq'' t p pc sl;
parse_sum_eq'' t p pc sl' ;
parse_strong_prefix (parse_sum t p pc) sl sl' ;
parse_injective p sl sl'
let gaccessor_clens_sum_payload
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (gaccessor (parse_sum t p pc) (dsnd (pc k)) (clens_sum_payload t k))
= Classical.forall_intro_2 (fun x -> Classical.move_requires (gaccessor_clens_sum_payload_injective t p pc k x));
Classical.forall_intro_2 (fun x -> Classical.move_requires (gaccessor_clens_sum_payload_no_lookahead t p pc k x));
gaccessor_prop_equiv (parse_sum t p pc) (dsnd (pc k)) (clens_sum_payload t k) (gaccessor_clens_sum_payload' t p pc k);
gaccessor_clens_sum_payload' t p pc k
inline_for_extraction
let accessor_clens_sum_payload'
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(j: jumper p)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: HST.Stack U32.t
(requires (fun h ->
valid (parse_sum t p pc) h input pos /\
(clens_sum_payload t k).clens_cond (contents (parse_sum t p pc) h input pos)
))
(ensures (fun h pos' h' ->
B.modifies B.loc_none h h' /\
pos' == slice_access h (gaccessor_clens_sum_payload t p pc k) input pos
))
=
let h = HST.get () in
[@inline_let]
let _ =
let pos' = get_valid_pos (parse_sum t p pc) h input pos in
let large = bytes_of_slice_from h input pos in
slice_access_eq h (gaccessor_clens_sum_payload t p pc k) input pos;
valid_facts (parse_sum t p pc) h input pos;
parse_sum_eq'' t p pc large;
valid_facts p h input pos
in
j input pos
#pop-options
inline_for_extraction
let accessor_clens_sum_payload
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(j: jumper p)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (accessor (gaccessor_clens_sum_payload t p pc k))
= fun #rrel #rel -> accessor_clens_sum_payload' t j pc k #rrel #rel
let clens_sum_cases_payload
(s: sum)
(k: sum_key s)
: Tot (clens (sum_cases s k) (sum_type_of_tag s k))
= {
clens_cond = (fun (x: sum_cases s k) -> True);
clens_get = (fun (x: sum_cases s k) -> synth_sum_case_recip s k x <: Ghost (sum_type_of_tag s k) (requires (True)) (ensures (fun _ -> True)));
}
let gaccessor_clens_sum_cases_payload
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (gaccessor (parse_sum_cases' t pc k) (dsnd (pc k)) (clens_sum_cases_payload t k))
= synth_sum_case_injective t k;
synth_sum_case_inverse t k;
synth_injective_synth_inverse_synth_inverse_recip (synth_sum_case t k) (synth_sum_case_recip t k) ();
gaccessor_ext
(gaccessor_synth (dsnd (pc k)) (synth_sum_case t k) (synth_sum_case_recip t k) ())
(clens_sum_cases_payload t k)
()
inline_for_extraction
let accessor_clens_sum_cases_payload
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (accessor (gaccessor_clens_sum_cases_payload t pc k))
= [@inline_let]
let _ =
synth_sum_case_injective t k;
synth_sum_case_inverse t k;
synth_injective_synth_inverse_synth_inverse_recip (synth_sum_case t k) (synth_sum_case_recip t k) ()
in
accessor_ext
(accessor_synth (dsnd (pc k)) (synth_sum_case t k) (synth_sum_case_recip t k) ())
(clens_sum_cases_payload t k)
()
inline_for_extraction
let validate_dsum_cases_t
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(#k: parser_kind)
(g: parser k (dsum_type_of_unknown_tag s))
(x: dsum_key s)
: Tot Type
= validator (parse_dsum_cases' s f g x)
let validate_dsum_cases_eq
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(#k: parser_kind)
(g: parser k (dsum_type_of_unknown_tag s))
(x: dsum_key s)
(v1 v2 : validate_dsum_cases_t s f g x)
: GTot Type0
= True
inline_for_extraction
let validate_dsum_cases_if'
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(#k: parser_kind)
(g: parser k (dsum_type_of_unknown_tag s))
(x: dsum_key s)
(cond: bool)
(ift: (cond_true cond -> Tot (validate_dsum_cases_t s f g x)))
(iff: (cond_false cond -> Tot (validate_dsum_cases_t s f g x)))
: Tot (validate_dsum_cases_t s f g x)
= fun #rrel #rel input len ->
if cond
then (ift () <: validate_dsum_cases_t s f g x) input len
else (iff () <: validate_dsum_cases_t s f g x) input len
inline_for_extraction
let validate_dsum_cases_if
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(#k: parser_kind)
(g: parser k (dsum_type_of_unknown_tag s))
(x: dsum_key s)
: Tot (if_combinator _ (validate_dsum_cases_eq s f g x))
= validate_dsum_cases_if' s f g x
inline_for_extraction
let validate_dsum_cases'
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(f' : (x: dsum_known_key s) -> Tot (validator (dsnd (f x))))
(#k: parser_kind)
(#g: parser k (dsum_type_of_unknown_tag s))
(g' : validator g)
(x: dsum_key s)
: Tot (validate_dsum_cases_t s f g x)
= [@inline_let]
let _ = synth_dsum_case_injective s x in
match x with
| Known x' -> validate_synth (f' x') (synth_dsum_case s (Known x')) () <: validator (parse_dsum_cases' s f g x)
| Unknown x' -> validate_synth g' (synth_dsum_case s (Unknown x')) () <: validator (parse_dsum_cases' s f g x)
inline_for_extraction
let validate_dsum_cases'_destr
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(f' : (x: dsum_known_key s) -> Tot (validator (dsnd (f x))))
(#k: parser_kind)
(#g: parser k (dsum_type_of_unknown_tag s))
(g' : validator g)
(destr: dep_enum_destr _ (fun k -> validate_dsum_cases_t s f g (Known k)))
(x: dsum_key s)
: Tot (validate_dsum_cases_t s f g x)
= fun #rrel #rel input pos ->
match x with
| Known k ->
destr
_
(fun k -> validate_dsum_cases_if s f g (Known k))
(fun _ _ -> ())
(fun _ _ _ _ -> ())
(fun k -> validate_dsum_cases' s f f' g' (Known k))
k
input
pos
| Unknown r -> validate_dsum_cases' s f f' g' (Unknown r) input pos
inline_for_extraction
let validate_dsum_cases
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(f' : (x: dsum_known_key s) -> Tot (validator (dsnd (f x))))
(#k: parser_kind)
(#g: parser k (dsum_type_of_unknown_tag s))
(g' : validator g)
(destr: dep_enum_destr _ (fun k -> validate_dsum_cases_t s f g (Known k)))
(x: dsum_key s)
: Tot (validator (parse_dsum_cases s f g x))
= fun #rrel #rel input pos ->
let h = HST.get () in
[@inline_let]
let _ =
valid_facts (parse_dsum_cases' s f g x) h input (uint64_to_uint32 pos);
valid_facts (parse_dsum_cases s f g x) h input (uint64_to_uint32 pos);
parse_dsum_cases_eq' s f g x (bytes_of_slice_from h input (uint64_to_uint32 pos))
in
validate_dsum_cases'_destr s f f' g' destr x input pos
#push-options "--z3rlimit 40"
inline_for_extraction
let validate_dsum
(#kt: parser_kind)
(t: dsum)
(#p: parser kt (dsum_repr_type t))
(v: validator p)
(p32: leaf_reader p)
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(f32: (x: dsum_known_key t) -> Tot (validator (dsnd (f x))))
(#k': parser_kind)
(#g: parser k' (dsum_type_of_unknown_tag t))
(g32: validator g)
(destr: dep_maybe_enum_destr_t (dsum_enum t) (validate_dsum_cases_t t f g))
: Tot (validator (parse_dsum t p f g))
= fun #rrel #rel input pos ->
let h = HST.get () in
[@inline_let]
let _ = parse_dsum_eq' t p f g (bytes_of_slice_from h input (uint64_to_uint32 pos)) in
[@inline_let]
let _ = valid_facts (parse_dsum t p f g) h input (uint64_to_uint32 pos) in
[@inline_let]
let _ = valid_facts p h input (uint64_to_uint32 pos) in
let pos_after_tag = v input pos in
if is_error pos_after_tag
then pos_after_tag
else
let tg = p32 input (uint64_to_uint32 pos) in
[@inline_let]
let _ = valid_facts (parse_dsum_cases' t f g (maybe_enum_key_of_repr (dsum_enum t) tg)) h input (uint64_to_uint32 pos_after_tag) in
destr (validate_dsum_cases_eq t f g) (validate_dsum_cases_if t f g) (fun _ _ -> ()) (fun _ _ _ _ -> ()) (validate_dsum_cases' t f f32 g32) tg input pos_after_tag
#pop-options
#reset-options "--z3rlimit 64 --z3cliopt smt.arith.nl=false --initial_ifuel 8 --max_ifuel 8 --initial_fuel 2 --max_fuel 2"
let valid_dsum_intro_known
(h: HS.mem)
(t: dsum)
(#kt: parser_kind)
(p: parser kt (dsum_repr_type t))
(f: ((x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x))))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: Lemma
(requires (
valid (parse_maybe_enum_key p (dsum_enum t)) h input pos /\ (
let k' = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
Known? k' /\ (
let Known k = k' in
valid (dsnd (f k)) h input (get_valid_pos (parse_maybe_enum_key p (dsum_enum t)) h input pos)
))))
(ensures (
let Known k = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
let pos_payload = get_valid_pos (parse_maybe_enum_key p (dsum_enum t)) h input pos in
valid_content_pos
(parse_dsum t p f g) h input pos
(synth_dsum_case t (Known k) (contents (dsnd (f k)) h input pos_payload))
(get_valid_pos (dsnd (f k)) h input pos_payload)
))
= valid_facts (parse_maybe_enum_key p (dsum_enum t)) h input pos;
let Known k = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
let pos_payload = get_valid_pos (parse_maybe_enum_key p (dsum_enum t)) h input pos in
valid_facts (dsnd (f k)) h input pos_payload;
valid_facts (parse_dsum t p f g) h input pos;
parse_dsum_eq t p f g (bytes_of_slice_from h input pos)
let valid_dsum_intro_unknown
(h: HS.mem)
(t: dsum)
(#kt: parser_kind)
(p: parser kt (dsum_repr_type t))
(f: ((x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x))))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: Lemma
(requires (
valid (parse_maybe_enum_key p (dsum_enum t)) h input pos /\ (
let k' = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
Unknown? k' /\
valid g h input (get_valid_pos (parse_maybe_enum_key p (dsum_enum t)) h input pos)
)))
(ensures (
let Unknown r = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
let pos_payload = get_valid_pos (parse_maybe_enum_key p (dsum_enum t)) h input pos in
valid_content_pos
(parse_dsum t p f g) h input pos
(synth_dsum_case t (Unknown r) (contents g h input pos_payload))
(get_valid_pos g h input pos_payload)
))
= valid_facts (parse_maybe_enum_key p (dsum_enum t)) h input pos;
let Unknown r = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
let pos_payload = get_valid_pos (parse_maybe_enum_key p (dsum_enum t)) h input pos in
valid_facts g h input pos_payload;
valid_facts (parse_dsum t p f g) h input pos;
parse_dsum_eq t p f g (bytes_of_slice_from h input pos)
#reset-options
inline_for_extraction
let finalize_dsum_case_known
(t: dsum)
(#kt: parser_kind)
(#p: parser kt (dsum_repr_type t))
(s: serializer p)
(w: leaf_writer_strong s)
(f: ((x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x))))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
(destr: enum_repr_of_key'_t (dsum_enum t))
(k: dsum_known_key t)
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: HST.Stack unit
(requires (fun h ->
let len_tag = serialized_length (serialize_enum_key _ s (dsum_enum t)) k in
U32.v pos + len_tag < 4294967296 /\ (
let pos_payload = pos `U32.add` U32.uint_to_t len_tag in
valid (dsnd (f k)) h input pos_payload /\
writable input.base (U32.v pos) (U32.v pos_payload) h
)))
(ensures (fun h _ h' ->
let len_tag = serialized_length (serialize_enum_key _ s (dsum_enum t)) k in
let pos_payload = pos `U32.add` U32.uint_to_t len_tag in
B.modifies (loc_slice_from_to input pos pos_payload) h h' /\
valid_content_pos (parse_dsum t p f g) h' input pos (synth_dsum_case t (Known k) (contents (dsnd (f k)) h input pos_payload)) (get_valid_pos (dsnd (f k)) h input pos_payload)
))
= let pos1 = write_enum_key w (dsum_enum t) destr k input pos in
let h = HST.get () in
[@inline_let]
let _ =
valid_facts (parse_enum_key p (dsum_enum t)) h input pos;
valid_facts (parse_maybe_enum_key p (dsum_enum t)) h input pos;
let sq = bytes_of_slice_from h input pos in
parse_enum_key_eq p (dsum_enum t) sq;
parse_maybe_enum_key_eq p (dsum_enum t) sq;
valid_dsum_intro_known h t p f g input pos
in
()
inline_for_extraction
let finalize_dsum_case_unknown
(t: dsum)
(#kt: parser_kind)
(#p: parser kt (dsum_repr_type t))
(s: serializer p)
(w: leaf_writer_strong s)
(f: ((x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x))))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
(r: unknown_enum_repr (dsum_enum t))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: HST.Stack unit
(requires (fun h ->
let len_tag = serialized_length s r in
U32.v pos + len_tag < 4294967296 /\ (
let pos_payload = pos `U32.add` U32.uint_to_t len_tag in
valid g h input pos_payload /\
writable input.base (U32.v pos) (U32.v pos_payload) h
)))
(ensures (fun h _ h' ->
let len_tag = serialized_length s r in
let pos_payload = pos `U32.add` U32.uint_to_t len_tag in
B.modifies (loc_slice_from_to input pos pos_payload) h h' /\
valid_content_pos (parse_dsum t p f g) h' input pos (synth_dsum_case t (Unknown r) (contents g h input pos_payload)) (get_valid_pos g h input pos_payload)
))
= let pos1 = w r input pos in
let h = HST.get () in
[@inline_let]
let _ =
valid_facts (parse_maybe_enum_key p (dsum_enum t)) h input pos;
valid_facts p h input pos;
let sq = bytes_of_slice_from h input pos in
parse_maybe_enum_key_eq p (dsum_enum t) sq;
valid_dsum_intro_unknown h t p f g input pos
in
()
let valid_dsum_elim_tag
(h: HS.mem)
(t: dsum)
(#kt: parser_kind)
(p: parser kt (dsum_repr_type t))
(f: ((x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x))))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: Lemma
(requires (
valid (parse_dsum t p f g) h input pos
))
(ensures (
valid (parse_maybe_enum_key p (dsum_enum t)) h input pos /\
contents (parse_maybe_enum_key p (dsum_enum t)) h input pos == dsum_tag_of_data t (contents (parse_dsum t p f g) h input pos)
))
= let _ = parse_dsum_eq_ t p f g (bytes_of_slice_from h input pos) in
let _ = valid_facts (parse_dsum t p f g) h input pos in
let _ = valid_facts (parse_maybe_enum_key p (dsum_enum t)) h input pos in
()
inline_for_extraction
let read_dsum_tag
(t: dsum)
(#kt: parser_kind)
(#p: parser kt (dsum_repr_type t))
(p32: leaf_reader p)
(destr: maybe_enum_destr_t (maybe_enum_key (dsum_enum t)) (dsum_enum t))
(f: ((x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x))))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: HST.Stack (dsum_key t)
(requires (fun h ->
valid (parse_dsum t p f g) h input pos
))
(ensures (fun h res h' ->
B.modifies B.loc_none h h' /\
res == dsum_tag_of_data t (contents (parse_dsum t p f g) h input pos)
))
= let h = HST.get () in
[@inline_let] let _ = valid_dsum_elim_tag h t p f g input pos in
read_maybe_enum_key p32 (dsum_enum t) destr input pos
#push-options "--z3rlimit 32"
let valid_dsum_elim_known
(h: HS.mem)
(t: dsum)
(#kt: parser_kind)
(p: parser kt (dsum_repr_type t))
(f: ((x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x))))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: Lemma
(requires (
valid (parse_dsum t p f g) h input pos /\
Known? (dsum_tag_of_data t (contents (parse_dsum t p f g) h input pos))
))
(ensures (
valid (parse_maybe_enum_key p (dsum_enum t)) h input pos /\ (
let k' = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
let pos_payload = get_valid_pos (parse_maybe_enum_key p (dsum_enum t)) h input pos in
Known? k' /\ (
let Known k = k' in
valid (dsnd (f k)) h input pos_payload /\
valid_content_pos
(parse_dsum t p f g) h input pos
(synth_dsum_case t (Known k) (contents (dsnd (f k)) h input pos_payload))
(get_valid_pos (dsnd (f k)) h input pos_payload)
))))
=
valid_facts (parse_dsum t p f g) h input pos;
parse_dsum_eq t p f g (bytes_of_slice_from h input pos);
valid_facts (parse_maybe_enum_key p (dsum_enum t)) h input pos;
let Known k = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
let pos_payload = get_valid_pos (parse_maybe_enum_key p (dsum_enum t)) h input pos in
valid_facts (dsnd (f k)) h input pos_payload
#pop-options
let valid_dsum_elim_unknown
(h: HS.mem)
(t: dsum)
(#kt: parser_kind)
(p: parser kt (dsum_repr_type t))
(f: ((x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x))))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: Lemma
(requires (
valid (parse_dsum t p f g) h input pos /\
Unknown? (dsum_tag_of_data t (contents (parse_dsum t p f g) h input pos))
))
(ensures (
valid (parse_maybe_enum_key p (dsum_enum t)) h input pos /\ (
let k' = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
let pos_payload = get_valid_pos (parse_maybe_enum_key p (dsum_enum t)) h input pos in
Unknown? k' /\ (
let Unknown r = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
valid g h input pos_payload /\
valid_content_pos
(parse_dsum t p f g) h input pos
(synth_dsum_case t (Unknown r) (contents g h input pos_payload))
(get_valid_pos g h input pos_payload)
))))
=
valid_facts (parse_dsum t p f g) h input pos;
parse_dsum_eq t p f g (bytes_of_slice_from h input pos);
valid_facts (parse_maybe_enum_key p (dsum_enum t)) h input pos;
let Unknown r = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
let pos_payload = get_valid_pos (parse_maybe_enum_key p (dsum_enum t)) h input pos in
valid_facts g h input pos_payload
inline_for_extraction
let jump_dsum_cases_t
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(#k: parser_kind)
(g: parser k (dsum_type_of_unknown_tag s))
(x: dsum_key s)
: Tot Type
= jumper (parse_dsum_cases' s f g x)
let jump_dsum_cases_eq
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(#k: parser_kind)
(g: parser k (dsum_type_of_unknown_tag s))
(x: dsum_key s)
(v1 v2 : jump_dsum_cases_t s f g x)
: GTot Type0
= True
inline_for_extraction
let jump_dsum_cases_if'
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(#k: parser_kind)
(g: parser k (dsum_type_of_unknown_tag s))
(x: dsum_key s)
(cond: bool)
(ift: (cond_true cond -> Tot (jump_dsum_cases_t s f g x)))
(iff: (cond_false cond -> Tot (jump_dsum_cases_t s f g x)))
: Tot (jump_dsum_cases_t s f g x)
= fun #rrel #rel input len ->
if cond
then (ift () <: jump_dsum_cases_t s f g x) input len
else (iff () <: jump_dsum_cases_t s f g x) input len
inline_for_extraction
let jump_dsum_cases_if
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(#k: parser_kind)
(g: parser k (dsum_type_of_unknown_tag s))
(x: dsum_key s)
: Tot (if_combinator _ (jump_dsum_cases_eq s f g x))
= jump_dsum_cases_if' s f g x
inline_for_extraction
let jump_dsum_cases'
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(f' : (x: dsum_known_key s) -> Tot (jumper (dsnd (f x))))
(#k: parser_kind)
(#g: parser k (dsum_type_of_unknown_tag s))
(g' : jumper g)
(x: dsum_key s)
: Tot (jump_dsum_cases_t s f g x)
= synth_dsum_case_injective s x;
match x with
| Known x' -> jump_synth (f' x') (synth_dsum_case s (Known x')) () <: jumper (parse_dsum_cases' s f g x)
| Unknown x' -> jump_synth g' (synth_dsum_case s (Unknown x')) () <: jumper (parse_dsum_cases' s f g x)
inline_for_extraction
let jump_dsum_cases'_destr
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(f' : (x: dsum_known_key s) -> Tot (jumper (dsnd (f x))))
(#k: parser_kind)
(#g: parser k (dsum_type_of_unknown_tag s))
(g' : jumper g)
(destr: dep_enum_destr _ (fun k -> jump_dsum_cases_t s f g (Known k)))
(x: dsum_key s)
: Tot (jump_dsum_cases_t s f g x)
= fun #rrel #rel input pos ->
match x with
| Known k ->
destr
_
(fun k -> jump_dsum_cases_if s f g (Known k))
(fun _ _ -> ())
(fun _ _ _ _ -> ())
(fun k -> jump_dsum_cases' s f f' g' (Known k))
k
input
pos
| Unknown r -> jump_dsum_cases' s f f' g' (Unknown r) input pos
inline_for_extraction
let jump_dsum_cases
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(f' : (x: dsum_known_key s) -> Tot (jumper (dsnd (f x))))
(#k: parser_kind)
(#g: parser k (dsum_type_of_unknown_tag s))
(g' : jumper g)
(destr: dep_enum_destr _ (fun k -> jump_dsum_cases_t s f g (Known k)))
(x: dsum_key s)
: Tot (jumper (parse_dsum_cases s f g x))
= fun #rrel #rel input pos ->
let h = HST.get () in
[@inline_let]
let _ =
valid_facts (parse_dsum_cases' s f g x) h input pos;
valid_facts (parse_dsum_cases s f g x) h input pos;
parse_dsum_cases_eq' s f g x (bytes_of_slice_from h input pos)
in
jump_dsum_cases'_destr s f f' g' destr x input pos
#push-options "--z3rlimit 16"
inline_for_extraction
let jump_dsum
(#kt: parser_kind)
(t: dsum)
(#p: parser kt (dsum_repr_type t))
(v: jumper p)
(p32: leaf_reader p)
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(f32: (x: dsum_known_key t) -> Tot (jumper (dsnd (f x))))
(#k': parser_kind)
(#g: parser k' (dsum_type_of_unknown_tag t))
(g32: jumper g)
(destr: dep_maybe_enum_destr_t (dsum_enum t) (jump_dsum_cases_t t f g))
: Tot (jumper (parse_dsum t p f g))
= fun #rrel #rel input pos ->
let h = HST.get () in
[@inline_let]
let _ = parse_dsum_eq' t p f g (bytes_of_slice_from h input pos) in
[@inline_let]
let _ = valid_facts (parse_dsum t p f g) h input pos in
[@inline_let]
let _ = valid_facts p h input pos in
let pos_after_tag = v input pos in
let tg = p32 input pos in
[@inline_let]
let _ = valid_facts (parse_dsum_cases' t f g (maybe_enum_key_of_repr (dsum_enum t) tg)) h input pos_after_tag in
destr (jump_dsum_cases_eq t f g) (jump_dsum_cases_if t f g) (fun _ _ -> ()) (fun _ _ _ _ -> ()) (jump_dsum_cases' t f f32 g32) tg input pos_after_tag
#pop-options
inline_for_extraction
let read_dsum_cases'
(t: dsum)
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(f32: (x: dsum_known_key t) -> Tot (leaf_reader (dsnd (f x))))
(#k': parser_kind)
(g: parser k' (dsum_type_of_unknown_tag t))
(g32: leaf_reader g)
(x: dsum_key t)
: Tot (leaf_reader (parse_dsum_cases' t f g x))
= fun #rrel #rel input pos ->
[@inline_let]
let _ = synth_dsum_case_injective t x in
match x with
| Known x' ->
read_synth'
(dsnd (f x'))
(synth_dsum_case t (Known x'))
(f32 x')
()
input
pos
| Unknown x' ->
read_synth'
g
(synth_dsum_case t (Unknown x'))
g32
()
input
pos
inline_for_extraction
let read_dsum_cases_t
(t: dsum)
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(#k': parser_kind)
(g: parser k' (dsum_type_of_unknown_tag t))
(k: dsum_known_key t)
: Tot Type
= leaf_reader (parse_dsum_cases' t f g (Known k))
let read_dsum_cases_t_eq
(t: dsum)
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(#k': parser_kind)
(g: parser k' (dsum_type_of_unknown_tag t))
(k: dsum_known_key t)
(x y : read_dsum_cases_t t f g k)
: GTot Type0
= True
inline_for_extraction
let read_dsum_cases_t_if
(t: dsum)
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(#k': parser_kind)
(g: parser k' (dsum_type_of_unknown_tag t))
(k: dsum_known_key t)
: Tot (if_combinator _ (read_dsum_cases_t_eq t f g k))
= fun cond (sv_true: cond_true cond -> Tot (read_dsum_cases_t t f g k)) (sv_false: cond_false cond -> Tot (read_dsum_cases_t t f g k)) #_ #_ input pos ->
if cond
then sv_true () input pos
else sv_false () input pos
inline_for_extraction
let read_dsum_cases
(t: dsum)
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(f32: (x: dsum_known_key t) -> Tot (leaf_reader (dsnd (f x))))
(#k': parser_kind)
(g: parser k' (dsum_type_of_unknown_tag t))
(g32: leaf_reader g)
(destr: dep_enum_destr _ (read_dsum_cases_t t f g))
(x: dsum_key t)
: Tot (leaf_reader (parse_dsum_cases' t f g x))
= fun #_ #_ input pos ->
match x with
| Known k ->
destr
_
(read_dsum_cases_t_if t f g)
(fun _ _ -> ())
(fun _ _ _ _ -> ())
(fun k -> read_dsum_cases' t f f32 g g32 (Known k))
k
input
pos
| Unknown r ->
read_dsum_cases' t f f32 g g32 (Unknown r) input pos
#push-options "--z3rlimit 16"
inline_for_extraction
let read_dsum
(#kt: parser_kind)
(t: dsum)
(#p: parser kt (dsum_repr_type t))
(p32: leaf_reader (parse_maybe_enum_key p (dsum_enum t)))
(j: jumper p)
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(f32: (x: dsum_known_key t) -> Tot (leaf_reader (dsnd (f x))))
(#k': parser_kind)
(#g: parser k' (dsum_type_of_unknown_tag t))
(g32: leaf_reader g)
(destr: dep_enum_destr _ (read_dsum_cases_t t f g))
: Tot (leaf_reader (parse_dsum t p f g))
= fun #_ #_ input pos ->
let h = HST.get () in
valid_facts (parse_dsum t p f g) h input pos;
parse_dsum_eq_ t p f g (bytes_of_slice_from h input pos);
valid_facts (parse_maybe_enum_key p (dsum_enum t)) h input pos;
let k = p32 input pos in
let pos' = jump_maybe_enum_key j (dsum_enum t) input pos in
valid_facts (parse_dsum_cases' t f g k) h input pos' ;
read_dsum_cases t f f32 g g32 destr k input pos'
#pop-options
inline_for_extraction
let serialize32_dsum_type_of_tag
(t: dsum)
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(sf: (x: dsum_known_key t) -> Tot (serializer (dsnd (f x))))
(sf32: (x: dsum_known_key t) -> Tot (serializer32 (sf x)))
(#k': parser_kind)
(#g: parser k' (dsum_type_of_unknown_tag t))
(#sg: serializer g)
(sg32: serializer32 sg)
(tg: dsum_key t)
: Tot (serializer32 (serialize_dsum_type_of_tag t f sf g sg tg))
= match tg with
| Known x' -> serialize32_ext (dsnd (f x')) (sf x') (sf32 x') (parse_dsum_type_of_tag t f g tg) ()
| Unknown x' -> serialize32_ext g sg sg32 (parse_dsum_type_of_tag t f g tg) ()
inline_for_extraction
let serialize32_dsum_cases_aux
(t: dsum)
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(sf: (x: dsum_known_key t) -> Tot (serializer (dsnd (f x))))
(sf32: (x: dsum_known_key t) -> Tot (serializer32 (sf x)))
(#k': parser_kind)
(#g: parser k' (dsum_type_of_unknown_tag t))
(#sg: serializer g)
(sg32: serializer32 sg)
(tg: dsum_key t)
: Tot (serializer32 (serialize_dsum_cases t f sf g sg tg))
= [@inline_let]
let _ = synth_dsum_case_injective t tg in
[@inline_let]
let _ = synth_dsum_case_inverse t tg in
serialize32_synth
(serialize32_dsum_type_of_tag t f sf sf32 sg32 tg)
(synth_dsum_case t tg)
(synth_dsum_case_recip t tg)
(fun x -> synth_dsum_case_recip t tg x)
()
inline_for_extraction
let serialize32_dsum_cases_t
(t: dsum)
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(sf: (x: dsum_known_key t) -> Tot (serializer (dsnd (f x))))
(#k': parser_kind)
(g: parser k' (dsum_type_of_unknown_tag t))
(sg: serializer g)
(k: dsum_known_key t)
: Tot Type
= serializer32 (serialize_dsum_cases t f sf g sg (Known k))
let serialize32_dsum_cases_t_eq
(t: dsum)
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(sf: (x: dsum_known_key t) -> Tot (serializer (dsnd (f x))))
(#k': parser_kind)
(g: parser k' (dsum_type_of_unknown_tag t))
(sg: serializer g)
(k: dsum_known_key t)
(x y: serialize32_dsum_cases_t t f sf g sg k)
: GTot Type0
= True
inline_for_extraction
let serialize32_dsum_cases_t_if
(t: dsum)
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(sf: (x: dsum_known_key t) -> Tot (serializer (dsnd (f x))))
(#k': parser_kind)
(g: parser k' (dsum_type_of_unknown_tag t))
(sg: serializer g)
(k: dsum_known_key t)
: Tot (if_combinator _ (serialize32_dsum_cases_t_eq t f sf g sg k))
= fun cond (sv_true: (cond_true cond -> Tot (serialize32_dsum_cases_t t f sf g sg k))) (sv_false: (cond_false cond -> Tot (serialize32_dsum_cases_t t f sf g sg k))) x #rrel #rel output pos ->
if cond
then (sv_true () x output pos)
else (sv_false () x output pos)
inline_for_extraction
let serialize32_dsum_cases
(t: dsum)
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(sf: (x: dsum_known_key t) -> Tot (serializer (dsnd (f x))))
(sf32: (x: dsum_known_key t) -> Tot (serializer32 (sf x)))
(#k': parser_kind)
(#g: parser k' (dsum_type_of_unknown_tag t))
(#sg: serializer g)
(sg32: serializer32 sg)
(destr: dep_enum_destr _ (serialize32_dsum_cases_t t f sf g sg))
(tg: dsum_key t)
: Tot (serializer32 (serialize_dsum_cases t f sf g sg tg))
= fun x #rrel #rel output pos ->
match tg with
| Known k ->
destr
_
(serialize32_dsum_cases_t_if t f sf g sg)
(fun _ _ -> ())
(fun _ _ _ _ -> ())
(fun k -> serialize32_dsum_cases_aux t f sf sf32 sg32 (Known k))
k
x
output
pos
| Unknown r ->
serialize32_dsum_cases_aux t f sf sf32 sg32 (Unknown r) x output pos
inline_for_extraction
let serialize32_dsum
(#kt: parser_kind)
(t: dsum)
(#p: parser kt (dsum_repr_type t))
(s: serializer p {kt.parser_kind_subkind == Some ParserStrong})
(s32: serializer32 (serialize_maybe_enum_key _ s (dsum_enum t)))
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(sf: (x: dsum_known_key t) -> Tot (serializer (dsnd (f x))))
(sf32: (x: dsum_known_key t) -> Tot (serializer32 (sf x)))
(#k': parser_kind)
(#g: parser k' (dsum_type_of_unknown_tag t))
(#sg: serializer g)
(sg32: serializer32 sg)
(destr: dep_enum_destr _ (serialize32_dsum_cases_t t f sf g sg))
: Tot (serializer32 (serialize_dsum t s f sf g sg))
= fun x #_ #_ output pos ->
[@inline_let]
let _ = serialize_dsum_eq' t s f sf g sg x in
let tg = dsum_tag_of_data t x in
serialize32_nondep_then_aux
s32
(serialize32_dsum_cases t f sf sf32 sg32 destr tg)
tg
x
output
pos
let clens_dsum_tag
(s: dsum)
: Tot (clens (dsum_type s) (dsum_key s))
= {
clens_cond = (fun _ -> True);
clens_get = dsum_tag_of_data s;
}
let gaccessor_dsum_tag
(#kt: parser_kind)
(t: dsum)
(p: parser kt (dsum_repr_type t))
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
: Tot (gaccessor (parse_dsum t p f g) (parse_maybe_enum_key p (dsum_enum t)) (clens_dsum_tag t))
= gaccessor_tagged_union_tag
(parse_maybe_enum_key p (dsum_enum t))
(dsum_tag_of_data t)
(parse_dsum_cases t f g)
inline_for_extraction
let accessor_dsum_tag
(#kt: parser_kind)
(t: dsum)
(p: parser kt (dsum_repr_type t))
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
: Tot (accessor (gaccessor_dsum_tag t p f g))
= accessor_tagged_union_tag
(parse_maybe_enum_key p (dsum_enum t))
(dsum_tag_of_data t)
(parse_dsum_cases t f g)
let clens_dsum_payload
(s: dsum)
(k: dsum_key s)
: Tot (clens (dsum_type s) (dsum_type_of_tag s k))
= {
clens_cond = (fun (x: dsum_type s) -> dsum_tag_of_data s x == k);
clens_get = (fun (x: dsum_type s) -> synth_dsum_case_recip s k x <: Ghost (dsum_type_of_tag s k) (requires (dsum_tag_of_data s x == k)) (ensures (fun _ -> True)));
} | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"LowStar.Buffer.fst.checked",
"LowParse.Spec.Sum.fst.checked",
"LowParse.Low.Enum.fst.checked",
"FStar.UInt64.fsti.checked",
"FStar.UInt32.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Int.Cast.fst.checked",
"FStar.HyperStack.ST.fsti.checked",
"FStar.HyperStack.fst.checked",
"FStar.Classical.fsti.checked"
],
"interface_file": false,
"source_file": "LowParse.Low.Sum.fst"
} | [
{
"abbrev": true,
"full_module": "FStar.HyperStack",
"short_module": "HS"
},
{
"abbrev": true,
"full_module": "FStar.UInt64",
"short_module": "U64"
},
{
"abbrev": true,
"full_module": "FStar.Int.Cast",
"short_module": "Cast"
},
{
"abbrev": true,
"full_module": "LowStar.Buffer",
"short_module": "B"
},
{
"abbrev": true,
"full_module": "FStar.HyperStack.ST",
"short_module": "HST"
},
{
"abbrev": true,
"full_module": "FStar.UInt32",
"short_module": "U32"
},
{
"abbrev": false,
"full_module": "LowParse.Spec.Sum",
"short_module": null
},
{
"abbrev": false,
"full_module": "LowParse.Low.Enum",
"short_module": null
},
{
"abbrev": false,
"full_module": "LowParse.Low",
"short_module": null
},
{
"abbrev": false,
"full_module": "LowParse.Low",
"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",
"short_module": null
}
] | {
"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_elim_box": false,
"smtencoding_l_arith_repr": "boxwrap",
"smtencoding_nl_arith_repr": "boxwrap",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": true,
"z3cliopt": [],
"z3refresh": false,
"z3rlimit": 5,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | false | s: LowParse.Spec.Sum.dsum
-> LowParse.Low.Base.Spec.clens (LowParse.Spec.Sum.dsum_type s)
(LowParse.Spec.Sum.dsum_type_of_unknown_tag s) | Prims.Tot | [
"total"
] | [] | [
"LowParse.Spec.Sum.dsum",
"LowParse.Low.Base.Spec.Mkclens",
"LowParse.Spec.Sum.dsum_type",
"LowParse.Spec.Sum.dsum_type_of_unknown_tag",
"Prims.b2t",
"LowParse.Spec.Enum.uu___is_Unknown",
"LowParse.Spec.Sum.dsum_key_type",
"LowParse.Spec.Sum.dsum_repr_type",
"LowParse.Spec.Sum.dsum_enum",
"LowParse.Spec.Sum.dsum_tag_of_data",
"LowParse.Spec.Sum.synth_dsum_case_recip",
"Prims.l_True",
"LowParse.Low.Base.Spec.clens"
] | [] | false | false | false | false | false | let clens_dsum_unknown_payload (s: dsum) : Tot (clens (dsum_type s) (dsum_type_of_unknown_tag s)) =
| {
clens_cond = (fun (x: dsum_type s) -> Unknown? (dsum_tag_of_data s x));
clens_get
=
(fun (x: dsum_type s) ->
synth_dsum_case_recip s (dsum_tag_of_data s x) x
<:
Ghost (dsum_type_of_unknown_tag s)
(requires (Unknown? (dsum_tag_of_data s x)))
(ensures (fun _ -> True)))
} | false |
SimplePrintfReify.fst | SimplePrintfReify.ex | val ex : a: Type -> Type | let ex (a:Type) = unit -> M (option a) | {
"file_name": "examples/printf/SimplePrintfReify.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 38,
"end_line": 30,
"start_col": 0,
"start_line": 30
} | (*
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 agreed to in writing, software
distributed under the License is distributed on an "AS IS" BASIS,
WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
See the License for the specific language governing permissions and
limitations under the License.
*)
module SimplePrintfReify
open FStar.Char
open FStar.String
module List = FStar.List.Tot
// A variant of SimplePrintf that uses reify on the Ex implementation
// of parse_format
// For a start here's an alpha renamed version of Ex to avoid clashes
// with the prims variant of Ex (which is not defined using dm4free
// and is not marked as `total`) | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.String.fsti.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.fst.checked",
"FStar.Char.fsti.checked"
],
"interface_file": false,
"source_file": "SimplePrintfReify.fst"
} | [
{
"abbrev": true,
"full_module": "FStar.List.Tot",
"short_module": "List"
},
{
"abbrev": false,
"full_module": "FStar.String",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Char",
"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",
"short_module": null
}
] | {
"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_elim_box": false,
"smtencoding_l_arith_repr": "boxwrap",
"smtencoding_nl_arith_repr": "boxwrap",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": true,
"z3cliopt": [],
"z3refresh": false,
"z3rlimit": 5,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | false | a: Type -> Type | Prims.Tot | [
"total"
] | [] | [
"Prims.unit",
"FStar.Pervasives.Native.option"
] | [] | false | false | false | true | true | let ex (a: Type) =
| unit -> M (option a) | false |
|
SimplePrintfReify.fst | SimplePrintfReify.return_ex | val return_ex : (a:Type) -> (x:a) -> Tot (ex a) | val return_ex : (a:Type) -> (x:a) -> Tot (ex a) | let return_ex a x = fun _ -> Some x | {
"file_name": "examples/printf/SimplePrintfReify.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 35,
"end_line": 34,
"start_col": 0,
"start_line": 34
} | (*
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 agreed to in writing, software
distributed under the License is distributed on an "AS IS" BASIS,
WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
See the License for the specific language governing permissions and
limitations under the License.
*)
module SimplePrintfReify
open FStar.Char
open FStar.String
module List = FStar.List.Tot
// A variant of SimplePrintf that uses reify on the Ex implementation
// of parse_format
// For a start here's an alpha renamed version of Ex to avoid clashes
// with the prims variant of Ex (which is not defined using dm4free
// and is not marked as `total`)
(* The underlying representation type *)
let ex (a:Type) = unit -> M (option a)
(* Monad definition *) | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.String.fsti.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.fst.checked",
"FStar.Char.fsti.checked"
],
"interface_file": false,
"source_file": "SimplePrintfReify.fst"
} | [
{
"abbrev": true,
"full_module": "FStar.List.Tot",
"short_module": "List"
},
{
"abbrev": false,
"full_module": "FStar.String",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Char",
"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",
"short_module": null
}
] | {
"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_elim_box": false,
"smtencoding_l_arith_repr": "boxwrap",
"smtencoding_nl_arith_repr": "boxwrap",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": true,
"z3cliopt": [],
"z3refresh": false,
"z3rlimit": 5,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | false | a: Type -> x: a -> SimplePrintfReify.ex a | Prims.Tot | [
"total"
] | [] | [
"Prims.unit",
"FStar.Pervasives.Native.Some",
"FStar.Pervasives.Native.option"
] | [] | false | false | false | true | false | let return_ex a x =
| fun _ -> Some x | false |
SimplePrintfReify.fst | SimplePrintfReify.raise_ex | val raise_ex: exn -> Tot (ex False) | val raise_ex: exn -> Tot (ex False) | let raise_ex (_:exn) : Tot (ex False) = fun _ -> None | {
"file_name": "examples/printf/SimplePrintfReify.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 53,
"end_line": 45,
"start_col": 0,
"start_line": 45
} | (*
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 agreed to in writing, software
distributed under the License is distributed on an "AS IS" BASIS,
WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
See the License for the specific language governing permissions and
limitations under the License.
*)
module SimplePrintfReify
open FStar.Char
open FStar.String
module List = FStar.List.Tot
// A variant of SimplePrintf that uses reify on the Ex implementation
// of parse_format
// For a start here's an alpha renamed version of Ex to avoid clashes
// with the prims variant of Ex (which is not defined using dm4free
// and is not marked as `total`)
(* The underlying representation type *)
let ex (a:Type) = unit -> M (option a)
(* Monad definition *)
val return_ex : (a:Type) -> (x:a) -> Tot (ex a)
let return_ex a x = fun _ -> Some x
val bind_ex : (a:Type) -> (b:Type) -> (f:ex a) -> (g:a -> Tot (ex b)) -> Tot (ex b)
let bind_ex a b f g = fun _ ->
let r = f () in
match r with
| None -> None
| Some x -> g x ()
(* DMFF does not support yet polymorphic actions *) | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.String.fsti.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.fst.checked",
"FStar.Char.fsti.checked"
],
"interface_file": false,
"source_file": "SimplePrintfReify.fst"
} | [
{
"abbrev": true,
"full_module": "FStar.List.Tot",
"short_module": "List"
},
{
"abbrev": false,
"full_module": "FStar.String",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Char",
"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",
"short_module": null
}
] | {
"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_elim_box": false,
"smtencoding_l_arith_repr": "boxwrap",
"smtencoding_nl_arith_repr": "boxwrap",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": true,
"z3cliopt": [],
"z3refresh": false,
"z3rlimit": 5,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | false | _: Prims.exn -> SimplePrintfReify.ex Prims.l_False | Prims.Tot | [
"total"
] | [] | [
"Prims.exn",
"Prims.unit",
"FStar.Pervasives.Native.None",
"Prims.l_False",
"FStar.Pervasives.Native.option",
"SimplePrintfReify.ex"
] | [] | false | false | false | true | false | let raise_ex (_: exn) : Tot (ex False) =
| fun _ -> None | false |
SimplePrintfReify.fst | SimplePrintfReify.dir_type' | val dir_type' : ds: Prims.list SimplePrintfReify.dir -> Type0 | let dir_type' ds = dir_type ds | {
"file_name": "examples/printf/SimplePrintfReify.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 30,
"end_line": 98,
"start_col": 0,
"start_line": 98
} | (*
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 agreed to in writing, software
distributed under the License is distributed on an "AS IS" BASIS,
WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
See the License for the specific language governing permissions and
limitations under the License.
*)
module SimplePrintfReify
open FStar.Char
open FStar.String
module List = FStar.List.Tot
// A variant of SimplePrintf that uses reify on the Ex implementation
// of parse_format
// For a start here's an alpha renamed version of Ex to avoid clashes
// with the prims variant of Ex (which is not defined using dm4free
// and is not marked as `total`)
(* The underlying representation type *)
let ex (a:Type) = unit -> M (option a)
(* Monad definition *)
val return_ex : (a:Type) -> (x:a) -> Tot (ex a)
let return_ex a x = fun _ -> Some x
val bind_ex : (a:Type) -> (b:Type) -> (f:ex a) -> (g:a -> Tot (ex b)) -> Tot (ex b)
let bind_ex a b f g = fun _ ->
let r = f () in
match r with
| None -> None
| Some x -> g x ()
(* DMFF does not support yet polymorphic actions *)
(* Returning something in [False] allow to derive the usual raise below *)
let raise_ex (_:exn) : Tot (ex False) = fun _ -> None
(* Define the new effect using DM4F *)
total reifiable reflectable new_effect {
XEXN : (a:Type) -> Effect
with repr = ex
; bind = bind_ex
; return = return_ex
; raise = raise_ex
}
(* A lift from `Pure´ into the new effect *)
(* unfold let lift_pure_ex_wp (a:Type) (wp:pure_wp a) (_:unit) (p:XEXN?.post a) = *)
(* wp (fun a -> p (Some a)) *)
(* sub_effect PURE ~> XEXN = lift_pure_ex_wp *)
reifiable
let raise (#a:Type0) (e:exn) : XEXN a (fun _ p -> p None)
= let x = XEXN?.raise e in begin match x with end
(* An effect to alias easily write pre- and postconditions *)
(* Note: we use Type0 instead of XEXN.pre to avoid having to thunk everything. *)
effect Xexn (a:Type) (pre:Type0) (post:XEXN?.post a) =
XEXN a (fun (_:unit) (p:XEXN?.post a) -> pre /\
(forall (r:option a). (pre /\ post r) ==> p r))
(* Another alias. Ex a is the effect type for total exception-throwing
* programs. i.e. Any program of type `Ex a´ will throw or finish
* correctly, but never loop. *)
effect Xex (a:Type) = XEXN a (fun _ p -> forall (x:option a). p x)
// arguments to printf
type arg =
| Bool | Int | Char | String
// directives to printf
type dir =
| Lit : char -> dir
| Arg : arg -> dir
let arg_type (a:arg) : Tot Type0 =
match a with
| Bool -> bool
| Int -> int
| Char -> char
| String -> string
let rec dir_type (ds:list dir) : Tot Type0 =
match ds with
| [] -> string
| Lit c :: ds' -> dir_type ds'
| Arg a :: ds' -> arg_type a -> Tot (dir_type ds') | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.String.fsti.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.fst.checked",
"FStar.Char.fsti.checked"
],
"interface_file": false,
"source_file": "SimplePrintfReify.fst"
} | [
{
"abbrev": true,
"full_module": "FStar.List.Tot",
"short_module": "List"
},
{
"abbrev": false,
"full_module": "FStar.String",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Char",
"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",
"short_module": null
}
] | {
"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_elim_box": false,
"smtencoding_l_arith_repr": "boxwrap",
"smtencoding_nl_arith_repr": "boxwrap",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": true,
"z3cliopt": [],
"z3refresh": false,
"z3rlimit": 5,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | false | ds: Prims.list SimplePrintfReify.dir -> Type0 | Prims.Tot | [
"total"
] | [] | [
"Prims.list",
"SimplePrintfReify.dir",
"SimplePrintfReify.dir_type"
] | [] | false | false | false | true | true | let dir_type' ds =
| dir_type ds | false |
|
SimplePrintfReify.fst | SimplePrintfReify.example1 | val example1:string | val example1:string | let example1 : string =
string_of_dirs [Arg Int; Arg String] (fun s -> s) 42 " answer" | {
"file_name": "examples/printf/SimplePrintfReify.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 64,
"end_line": 116,
"start_col": 0,
"start_line": 115
} | (*
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 agreed to in writing, software
distributed under the License is distributed on an "AS IS" BASIS,
WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
See the License for the specific language governing permissions and
limitations under the License.
*)
module SimplePrintfReify
open FStar.Char
open FStar.String
module List = FStar.List.Tot
// A variant of SimplePrintf that uses reify on the Ex implementation
// of parse_format
// For a start here's an alpha renamed version of Ex to avoid clashes
// with the prims variant of Ex (which is not defined using dm4free
// and is not marked as `total`)
(* The underlying representation type *)
let ex (a:Type) = unit -> M (option a)
(* Monad definition *)
val return_ex : (a:Type) -> (x:a) -> Tot (ex a)
let return_ex a x = fun _ -> Some x
val bind_ex : (a:Type) -> (b:Type) -> (f:ex a) -> (g:a -> Tot (ex b)) -> Tot (ex b)
let bind_ex a b f g = fun _ ->
let r = f () in
match r with
| None -> None
| Some x -> g x ()
(* DMFF does not support yet polymorphic actions *)
(* Returning something in [False] allow to derive the usual raise below *)
let raise_ex (_:exn) : Tot (ex False) = fun _ -> None
(* Define the new effect using DM4F *)
total reifiable reflectable new_effect {
XEXN : (a:Type) -> Effect
with repr = ex
; bind = bind_ex
; return = return_ex
; raise = raise_ex
}
(* A lift from `Pure´ into the new effect *)
(* unfold let lift_pure_ex_wp (a:Type) (wp:pure_wp a) (_:unit) (p:XEXN?.post a) = *)
(* wp (fun a -> p (Some a)) *)
(* sub_effect PURE ~> XEXN = lift_pure_ex_wp *)
reifiable
let raise (#a:Type0) (e:exn) : XEXN a (fun _ p -> p None)
= let x = XEXN?.raise e in begin match x with end
(* An effect to alias easily write pre- and postconditions *)
(* Note: we use Type0 instead of XEXN.pre to avoid having to thunk everything. *)
effect Xexn (a:Type) (pre:Type0) (post:XEXN?.post a) =
XEXN a (fun (_:unit) (p:XEXN?.post a) -> pre /\
(forall (r:option a). (pre /\ post r) ==> p r))
(* Another alias. Ex a is the effect type for total exception-throwing
* programs. i.e. Any program of type `Ex a´ will throw or finish
* correctly, but never loop. *)
effect Xex (a:Type) = XEXN a (fun _ p -> forall (x:option a). p x)
// arguments to printf
type arg =
| Bool | Int | Char | String
// directives to printf
type dir =
| Lit : char -> dir
| Arg : arg -> dir
let arg_type (a:arg) : Tot Type0 =
match a with
| Bool -> bool
| Int -> int
| Char -> char
| String -> string
let rec dir_type (ds:list dir) : Tot Type0 =
match ds with
| [] -> string
| Lit c :: ds' -> dir_type ds'
| Arg a :: ds' -> arg_type a -> Tot (dir_type ds')
let dir_type' ds = dir_type ds
let rec string_of_dirs ds (k:string -> Tot string) : Tot (dir_type ds) =
match ds with
| [] -> k ""
| Lit c :: ds' ->
coerce_eq () (
string_of_dirs ds' (fun res -> k (string_of_char c ^ res))
)
| Arg a :: ds' -> fun (x : arg_type a) ->
string_of_dirs ds' (fun res -> k (match a with
| Bool -> string_of_bool x
| Int -> string_of_int x
| Char -> string_of_char x
| String -> x) ^ res) | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.String.fsti.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.fst.checked",
"FStar.Char.fsti.checked"
],
"interface_file": false,
"source_file": "SimplePrintfReify.fst"
} | [
{
"abbrev": true,
"full_module": "FStar.List.Tot",
"short_module": "List"
},
{
"abbrev": false,
"full_module": "FStar.String",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Char",
"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",
"short_module": null
}
] | {
"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_elim_box": false,
"smtencoding_l_arith_repr": "boxwrap",
"smtencoding_nl_arith_repr": "boxwrap",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": true,
"z3cliopt": [],
"z3refresh": false,
"z3rlimit": 5,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | false | Prims.string | Prims.Tot | [
"total"
] | [] | [
"SimplePrintfReify.string_of_dirs",
"Prims.Cons",
"SimplePrintfReify.dir",
"SimplePrintfReify.Arg",
"SimplePrintfReify.Int",
"SimplePrintfReify.String",
"Prims.Nil",
"Prims.string"
] | [] | false | false | false | true | false | let example1:string =
| string_of_dirs [Arg Int; Arg String] (fun s -> s) 42 " answer" | false |
Steel.HigherReference.fst | Steel.HigherReference.share_atomic_raw_gen | val share_atomic_raw_gen
(#a #uses: _)
(#p: perm)
(r: ref a {perm_ok p})
(v0: erased a)
(p1 p2: perm)
: SteelGhost unit
uses
(pts_to_raw r p v0)
(fun _ -> (pts_to_raw r p1 v0) `star` (pts_to_raw r p2 v0))
(fun _ -> p == p1 `sum_perm` p2)
(fun _ _ _ -> True) | val share_atomic_raw_gen
(#a #uses: _)
(#p: perm)
(r: ref a {perm_ok p})
(v0: erased a)
(p1 p2: perm)
: SteelGhost unit
uses
(pts_to_raw r p v0)
(fun _ -> (pts_to_raw r p1 v0) `star` (pts_to_raw r p2 v0))
(fun _ -> p == p1 `sum_perm` p2)
(fun _ _ _ -> True) | let share_atomic_raw_gen #a #uses (#p:perm) (r:ref a{perm_ok p}) (v0:erased a) (p1 p2: perm)
: SteelGhost unit uses
(pts_to_raw r p v0)
(fun _ -> pts_to_raw r p1 v0 `star` pts_to_raw r p2 v0)
(fun _ -> p == p1 `sum_perm` p2)
(fun _ _ _ -> True)
= rewrite_slprop
(pts_to_raw r p v0)
(RP.pts_to r _)
(fun _ -> ());
RP.split r (Some (Ghost.reveal v0, p)) (Some (Ghost.reveal v0, p1)) (Some (Ghost.reveal v0, p2));
rewrite_slprop
(RP.pts_to r _)
(pts_to_raw r p1 v0)
(fun _ -> ());
rewrite_slprop
(RP.pts_to r _)
(pts_to_raw r p2 v0)
(fun _ -> ()) | {
"file_name": "lib/steel/Steel.HigherReference.fst",
"git_rev": "f984200f79bdc452374ae994a5ca837496476c41",
"git_url": "https://github.com/FStarLang/steel.git",
"project_name": "steel"
} | {
"end_col": 19,
"end_line": 241,
"start_col": 0,
"start_line": 223
} | (*
Copyright 2020 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 in writing, software
distributed under the License is distributed on an "AS IS" BASIS,
WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
See the License for the specific language governing permissions and
limitations under the License.
*)
module Steel.HigherReference
open FStar.Ghost
open Steel.Memory
open Steel.Effect.Atomic
open Steel.Effect
open FStar.PCM
open Steel.PCMFrac
open FStar.Real
module RP = Steel.PCMReference
#set-options "--ide_id_info_off"
module Mem = Steel.Memory
let ref a = Mem.ref (fractional a) pcm_frac
let null #a = Mem.null #(fractional a) #pcm_frac
let is_null #a r = Mem.is_null #(fractional a) #pcm_frac r
let perm_ok p : prop = (p.v <=. one == true) /\ True
let pts_to_raw_sl (#a:Type) (r:ref a) (p:perm) (v:erased a) : slprop =
Mem.pts_to r (Some (Ghost.reveal v, p))
let pts_to_raw (#a:Type) (r:ref a) (p:perm) (v:erased a) : vprop =
to_vprop (Mem.pts_to r (Some (Ghost.reveal v, p)))
[@@__reduce__]
let pts_to' (#a:Type u#1) (r:ref a) (p:perm) (v:erased a) : vprop = pts_to_raw r p v `star` pure (perm_ok p)
let pts_to_sl #a r p v = hp_of (pts_to' r p v)
let abcd_acbd (a b c d:slprop)
: Lemma (Mem.(((a `star` b) `star` (c `star` d)) `equiv`
((a `star` c) `star` (b `star` d))))
= let open Steel.Memory in
calc (equiv) {
((a `star` b) `star` (c `star` d));
(equiv) { star_associative a b (c `star` d) }
((a `star` (b `star` (c `star` d))));
(equiv) { star_associative b c d;
star_congruence a (b `star` (c `star` d))
a ((b `star` c) `star` d) }
(a `star` ((b `star` c) `star` d));
(equiv) { star_commutative b c;
star_congruence (b `star` c) d (c `star` b) d;
star_congruence a ((b `star` c) `star` d)
a ((c `star` b) `star` d) }
(a `star` ((c `star` b) `star` d));
(equiv) { star_associative c b d;
star_congruence a ((c `star` b) `star` d)
a (c `star` (b `star` d)) }
(a `star` (c `star` (b `star` d)));
(equiv) { star_associative a c (b `star` d) }
((a `star` c) `star` (b `star` d));
}
let pts_to_ref_injective
(#a: Type u#1)
(r: ref a)
(p0 p1:perm)
(v0 v1:a)
(m:mem)
: Lemma
(requires
interp (pts_to_sl r p0 v0 `Mem.star` pts_to_sl r p1 v1) m)
(ensures v0 == v1)
= let open Steel.Memory in
abcd_acbd (hp_of (pts_to_raw r p0 v0))
(pure (perm_ok p0))
(hp_of (pts_to_raw r p1 v1))
(pure (perm_ok p1));
Mem.affine_star (hp_of (pts_to_raw r p0 v0) `star` hp_of (pts_to_raw r p1 v1))
(pure (perm_ok p0) `star` pure (perm_ok p1)) m;
Mem.pts_to_compatible r (Some (Ghost.reveal v0, p0))
(Some (Ghost.reveal v1, p1))
m
let pts_to_not_null (#a:Type u#1)
(r:ref a)
(p:perm)
(v:a)
(m:mem)
: Lemma (requires interp (pts_to_sl r p v) m)
(ensures r =!= null)
= Mem.affine_star (hp_of (pts_to_raw r p v)) (Mem.pure (perm_ok p)) m;
Mem.pts_to_not_null r (Some (Ghost.reveal v, p)) m
let pts_to_witinv (#a:Type) (r:ref a) (p:perm) : Lemma (is_witness_invariant (pts_to_sl r p)) =
let aux (x y : erased a) (m:mem)
: Lemma (requires (interp (pts_to_sl r p x) m /\ interp (pts_to_sl r p y) m))
(ensures (x == y))
=
Mem.pts_to_join r (Some (Ghost.reveal x, p)) (Some (Ghost.reveal y, p)) m
in
Classical.forall_intro_3 (fun x y -> Classical.move_requires (aux x y))
let higher_ref_pts_to_injective_eq #a #opened #p0 #p1 #v0 #v1 r =
extract_info_raw (pts_to r p0 v0 `star` pts_to r p1 v1) (v0 == v1)
(fun m -> pts_to_ref_injective r p0 p1 v0 v1 m);
rewrite_slprop (pts_to r p1 v1) (pts_to r p1 v0) (fun _ -> ())
let pts_to_framon (#a:Type) (r:ref a) (p:perm) : Lemma (is_frame_monotonic (pts_to_sl r p)) =
pts_to_witinv r p
let intro_pts_to (p:perm) #a #uses (#v:erased a) (r:ref a)
: SteelGhost unit uses
(pts_to_raw r p v)
(fun _ -> pts_to r p v)
(requires fun _ -> perm_ok p)
(ensures fun _ _ _ -> True)
= intro_pure (perm_ok p);
rewrite_slprop (pts_to' r p v) (pts_to r p v) (fun _ -> ())
let pts_to_perm
#_ #_ #p #v r
= rewrite_slprop (pts_to r p v) (pts_to' r p v) (fun _ -> ());
elim_pure (perm_ok p);
intro_pure (perm_ok p);
rewrite_slprop (pts_to' r p v) (pts_to r p v) (fun _ -> ())
let alloc #a x =
let v = Some (x, full_perm) in
assert (FStar.PCM.composable pcm_frac v None);
assert (compatible pcm_frac v v);
let r = RP.alloc v in
rewrite_slprop (RP.pts_to r v) (pts_to r full_perm x)
(fun m ->
emp_unit (hp_of (pts_to_raw r full_perm x));
pure_star_interp (hp_of (pts_to_raw r full_perm x)) (perm_ok full_perm) m
);
extract_info_raw (pts_to r full_perm x) (~ (is_null r))
(fun m -> pts_to_not_null r full_perm x m);
return r
let read (#a:Type) (#p:perm) (#v:erased a) (r:ref a)
= let v1 : erased (fractional a) = Ghost.hide (Some (Ghost.reveal v, p)) in
rewrite_slprop (pts_to r p v) (RP.pts_to r v1 `star` pure (perm_ok p)) (fun _ -> ());
elim_pure (perm_ok p);
let v2 = RP.read r v1 in
rewrite_slprop (RP.pts_to r v1) (pts_to r p v)
(fun m ->
emp_unit (hp_of (pts_to_raw r p v));
pure_star_interp (hp_of (pts_to_raw r p v)) (perm_ok p) m);
assert (compatible pcm_frac v1 v2);
let Some (x, _) = v2 in
rewrite_slprop (pts_to r p v) (pts_to r p x) (fun _ -> ());
return x
let atomic_read (#opened:_) (#a:Type) (#p:perm) (#v:erased a) (r:ref a)
= let v1 : erased (fractional a) = Ghost.hide (Some (Ghost.reveal v, p)) in
rewrite_slprop (pts_to r p v) (RP.pts_to r v1 `star` pure (perm_ok p)) (fun _ -> ());
elim_pure (perm_ok p);
let v2 = RP.atomic_read r v1 in
rewrite_slprop (RP.pts_to r v1) (pts_to r p v)
(fun m ->
emp_unit (hp_of (pts_to_raw r p v));
pure_star_interp (hp_of (pts_to_raw r p v)) (perm_ok p) m);
assert (compatible pcm_frac v1 v2);
let Some (x, _) = v2 in
rewrite_slprop (pts_to r p v) (pts_to r p x) (fun _ -> ());
return x
let read_refine (#a:Type) (#p:perm) (q:a -> vprop) (r:ref a)
: SteelT a (h_exists (fun (v:a) -> pts_to r p v `star` q v))
(fun v -> pts_to r p v `star` q v)
= let vs:erased a = witness_exists () in
rewrite_slprop (pts_to r p (Ghost.hide (Ghost.reveal vs))) (pts_to r p vs) (fun _ -> ());
let v = read r in
rewrite_slprop (q vs) (q v) (fun _ -> ());
return v
let write (#a:Type) (#v:erased a) (r:ref a) (x:a)
: SteelT unit (pts_to r full_perm v) (fun _ -> pts_to r full_perm x)
= let v_old : erased (fractional a) = Ghost.hide (Some (Ghost.reveal v, full_perm)) in
let v_new : fractional a = Some (x, full_perm) in
rewrite_slprop (pts_to r full_perm v) (RP.pts_to r v_old `star` pure (perm_ok full_perm)) (fun _ -> ());
elim_pure (perm_ok full_perm);
RP.write r v_old v_new;
rewrite_slprop (RP.pts_to r v_new) (pts_to r full_perm x)
(fun m -> emp_unit (hp_of (pts_to_raw r full_perm x));
pure_star_interp (hp_of (pts_to_raw r full_perm x)) (perm_ok full_perm) m)
let atomic_write #opened #a #v r x
= let v_old : erased (fractional a) = Ghost.hide (Some (Ghost.reveal v, full_perm)) in
let v_new : fractional a = Some (x, full_perm) in
rewrite_slprop (pts_to r full_perm v) (RP.pts_to r v_old `star` pure (perm_ok full_perm)) (fun _ -> ());
elim_pure (perm_ok full_perm);
RP.atomic_write r v_old v_new;
rewrite_slprop (RP.pts_to r v_new) (pts_to r full_perm x)
(fun m -> emp_unit (hp_of (pts_to_raw r full_perm x));
pure_star_interp (hp_of (pts_to_raw r full_perm x)) (perm_ok full_perm) m)
let free (#a:Type) (#v:erased a) (r:ref a)
: SteelT unit (pts_to r full_perm v) (fun _ -> emp)
= let v_old : erased (fractional a) = Ghost.hide (Some (Ghost.reveal v, full_perm)) in
rewrite_slprop
(pts_to r full_perm v)
(RP.pts_to r v_old `star` pure (perm_ok full_perm))
(fun _ -> ());
elim_pure (perm_ok full_perm);
RP.free r v_old;
drop (RP.pts_to r (Mkpcm'?.one (Mkpcm?.p pcm_frac))) | {
"checked_file": "/",
"dependencies": [
"Steel.PCMReference.fsti.checked",
"Steel.PCMFrac.fst.checked",
"Steel.Memory.fsti.checked",
"Steel.Effect.Atomic.fsti.checked",
"Steel.Effect.fsti.checked",
"prims.fst.checked",
"FStar.Real.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.PCM.fst.checked",
"FStar.NMSTTotal.fst.checked",
"FStar.Ghost.fsti.checked",
"FStar.Classical.fsti.checked",
"FStar.Calc.fsti.checked"
],
"interface_file": true,
"source_file": "Steel.HigherReference.fst"
} | [
{
"abbrev": true,
"full_module": "Steel.Memory",
"short_module": "Mem"
},
{
"abbrev": true,
"full_module": "Steel.PCMReference",
"short_module": "RP"
},
{
"abbrev": false,
"full_module": "FStar.Real",
"short_module": null
},
{
"abbrev": false,
"full_module": "Steel.PCMFrac",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.PCM",
"short_module": null
},
{
"abbrev": false,
"full_module": "Steel.Effect",
"short_module": null
},
{
"abbrev": false,
"full_module": "Steel.Effect.Atomic",
"short_module": null
},
{
"abbrev": false,
"full_module": "Steel.Memory",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Ghost",
"short_module": null
},
{
"abbrev": true,
"full_module": "Steel.Memory",
"short_module": "Mem"
},
{
"abbrev": false,
"full_module": "Steel.Effect",
"short_module": null
},
{
"abbrev": false,
"full_module": "Steel.Effect.Atomic",
"short_module": null
},
{
"abbrev": false,
"full_module": "Steel.Memory",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Ghost",
"short_module": null
},
{
"abbrev": false,
"full_module": "Steel.FractionalPermission",
"short_module": null
},
{
"abbrev": false,
"full_module": "Steel",
"short_module": null
},
{
"abbrev": false,
"full_module": "Steel",
"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",
"short_module": null
}
] | {
"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_elim_box": false,
"smtencoding_l_arith_repr": "boxwrap",
"smtencoding_nl_arith_repr": "boxwrap",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": true,
"z3cliopt": [],
"z3refresh": false,
"z3rlimit": 5,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | false |
r: Steel.HigherReference.ref a {Steel.HigherReference.perm_ok p} ->
v0: FStar.Ghost.erased a ->
p1: Steel.FractionalPermission.perm ->
p2: Steel.FractionalPermission.perm
-> Steel.Effect.Atomic.SteelGhost Prims.unit | Steel.Effect.Atomic.SteelGhost | [] | [] | [
"Steel.Memory.inames",
"Steel.FractionalPermission.perm",
"Steel.HigherReference.ref",
"Steel.HigherReference.perm_ok",
"FStar.Ghost.erased",
"Steel.Effect.Atomic.rewrite_slprop",
"Steel.PCMReference.pts_to",
"Steel.PCMFrac.fractional",
"Steel.PCMFrac.pcm_frac",
"FStar.Pervasives.Native.Some",
"FStar.Pervasives.Native.tuple2",
"FStar.Pervasives.Native.Mktuple2",
"FStar.Ghost.reveal",
"Steel.HigherReference.pts_to_raw",
"Steel.Memory.mem",
"Prims.unit",
"Steel.PCMReference.split",
"FStar.Ghost.hide",
"Steel.Effect.Common.star",
"Steel.Effect.Common.vprop",
"Steel.Effect.Common.rmem",
"Prims.eq2",
"Steel.FractionalPermission.sum_perm",
"Prims.l_True"
] | [] | false | true | false | false | false | let share_atomic_raw_gen
#a
#uses
(#p: perm)
(r: ref a {perm_ok p})
(v0: erased a)
(p1: perm)
(p2: perm)
: SteelGhost unit
uses
(pts_to_raw r p v0)
(fun _ -> (pts_to_raw r p1 v0) `star` (pts_to_raw r p2 v0))
(fun _ -> p == p1 `sum_perm` p2)
(fun _ _ _ -> True) =
| rewrite_slprop (pts_to_raw r p v0) (RP.pts_to r _) (fun _ -> ());
RP.split r (Some (Ghost.reveal v0, p)) (Some (Ghost.reveal v0, p1)) (Some (Ghost.reveal v0, p2));
rewrite_slprop (RP.pts_to r _) (pts_to_raw r p1 v0) (fun _ -> ());
rewrite_slprop (RP.pts_to r _) (pts_to_raw r p2 v0) (fun _ -> ()) | false |
SimplePrintfReify.fst | SimplePrintfReify.parse_format_pure | val parse_format_pure (s: list char) : option (list dir) | val parse_format_pure (s: list char) : option (list dir) | let parse_format_pure (s:list char) : option (list dir) =
reify (parse_format s) () | {
"file_name": "examples/printf/SimplePrintfReify.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 27,
"end_line": 138,
"start_col": 0,
"start_line": 137
} | (*
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 agreed to in writing, software
distributed under the License is distributed on an "AS IS" BASIS,
WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
See the License for the specific language governing permissions and
limitations under the License.
*)
module SimplePrintfReify
open FStar.Char
open FStar.String
module List = FStar.List.Tot
// A variant of SimplePrintf that uses reify on the Ex implementation
// of parse_format
// For a start here's an alpha renamed version of Ex to avoid clashes
// with the prims variant of Ex (which is not defined using dm4free
// and is not marked as `total`)
(* The underlying representation type *)
let ex (a:Type) = unit -> M (option a)
(* Monad definition *)
val return_ex : (a:Type) -> (x:a) -> Tot (ex a)
let return_ex a x = fun _ -> Some x
val bind_ex : (a:Type) -> (b:Type) -> (f:ex a) -> (g:a -> Tot (ex b)) -> Tot (ex b)
let bind_ex a b f g = fun _ ->
let r = f () in
match r with
| None -> None
| Some x -> g x ()
(* DMFF does not support yet polymorphic actions *)
(* Returning something in [False] allow to derive the usual raise below *)
let raise_ex (_:exn) : Tot (ex False) = fun _ -> None
(* Define the new effect using DM4F *)
total reifiable reflectable new_effect {
XEXN : (a:Type) -> Effect
with repr = ex
; bind = bind_ex
; return = return_ex
; raise = raise_ex
}
(* A lift from `Pure´ into the new effect *)
(* unfold let lift_pure_ex_wp (a:Type) (wp:pure_wp a) (_:unit) (p:XEXN?.post a) = *)
(* wp (fun a -> p (Some a)) *)
(* sub_effect PURE ~> XEXN = lift_pure_ex_wp *)
reifiable
let raise (#a:Type0) (e:exn) : XEXN a (fun _ p -> p None)
= let x = XEXN?.raise e in begin match x with end
(* An effect to alias easily write pre- and postconditions *)
(* Note: we use Type0 instead of XEXN.pre to avoid having to thunk everything. *)
effect Xexn (a:Type) (pre:Type0) (post:XEXN?.post a) =
XEXN a (fun (_:unit) (p:XEXN?.post a) -> pre /\
(forall (r:option a). (pre /\ post r) ==> p r))
(* Another alias. Ex a is the effect type for total exception-throwing
* programs. i.e. Any program of type `Ex a´ will throw or finish
* correctly, but never loop. *)
effect Xex (a:Type) = XEXN a (fun _ p -> forall (x:option a). p x)
// arguments to printf
type arg =
| Bool | Int | Char | String
// directives to printf
type dir =
| Lit : char -> dir
| Arg : arg -> dir
let arg_type (a:arg) : Tot Type0 =
match a with
| Bool -> bool
| Int -> int
| Char -> char
| String -> string
let rec dir_type (ds:list dir) : Tot Type0 =
match ds with
| [] -> string
| Lit c :: ds' -> dir_type ds'
| Arg a :: ds' -> arg_type a -> Tot (dir_type ds')
let dir_type' ds = dir_type ds
let rec string_of_dirs ds (k:string -> Tot string) : Tot (dir_type ds) =
match ds with
| [] -> k ""
| Lit c :: ds' ->
coerce_eq () (
string_of_dirs ds' (fun res -> k (string_of_char c ^ res))
)
| Arg a :: ds' -> fun (x : arg_type a) ->
string_of_dirs ds' (fun res -> k (match a with
| Bool -> string_of_bool x
| Int -> string_of_int x
| Char -> string_of_char x
| String -> x) ^ res)
let example1 : string =
string_of_dirs [Arg Int; Arg String] (fun s -> s) 42 " answer"
exception InvalidFormatString
(* TODO: can we get rid of the two `let x` or are they really required? *)
reifiable let rec parse_format (s:list char) : Xex (list dir) =
match s with
| [] -> []
| '%' :: c :: s' ->
let d =
match c with
| '%' -> Lit '%'
| 'b' -> Arg Bool
| 'd' -> Arg Int
| 'c' -> Arg Char
| 's' -> Arg String
| _ -> raise InvalidFormatString
in let x = parse_format s' in d :: x
| '%' :: [] -> raise InvalidFormatString
| c :: s' -> let x = parse_format s' in Lit c :: x | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.String.fsti.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.fst.checked",
"FStar.Char.fsti.checked"
],
"interface_file": false,
"source_file": "SimplePrintfReify.fst"
} | [
{
"abbrev": true,
"full_module": "FStar.List.Tot",
"short_module": "List"
},
{
"abbrev": false,
"full_module": "FStar.String",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Char",
"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",
"short_module": null
}
] | {
"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_elim_box": false,
"smtencoding_l_arith_repr": "boxwrap",
"smtencoding_nl_arith_repr": "boxwrap",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": true,
"z3cliopt": [],
"z3refresh": false,
"z3rlimit": 5,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | false | s: Prims.list FStar.String.char -> FStar.Pervasives.Native.option (Prims.list SimplePrintfReify.dir) | Prims.Tot | [
"total"
] | [] | [
"Prims.list",
"FStar.String.char",
"SimplePrintfReify.parse_format",
"SimplePrintfReify.dir",
"FStar.Pervasives.Native.option"
] | [] | false | false | false | true | false | let parse_format_pure (s: list char) : option (list dir) =
| reify (parse_format s) () | false |
LowParse.Low.Sum.fst | LowParse.Low.Sum.read_dsum | val read_dsum
(#kt: parser_kind)
(t: dsum)
(#p: parser kt (dsum_repr_type t))
(p32: leaf_reader (parse_maybe_enum_key p (dsum_enum t)))
(j: jumper p)
(f: (x: dsum_known_key t -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x))))
(f32: (x: dsum_known_key t -> Tot (leaf_reader (dsnd (f x)))))
(#k': parser_kind)
(#g: parser k' (dsum_type_of_unknown_tag t))
(g32: leaf_reader g)
(destr: dep_enum_destr _ (read_dsum_cases_t t f g))
: Tot (leaf_reader (parse_dsum t p f g)) | val read_dsum
(#kt: parser_kind)
(t: dsum)
(#p: parser kt (dsum_repr_type t))
(p32: leaf_reader (parse_maybe_enum_key p (dsum_enum t)))
(j: jumper p)
(f: (x: dsum_known_key t -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x))))
(f32: (x: dsum_known_key t -> Tot (leaf_reader (dsnd (f x)))))
(#k': parser_kind)
(#g: parser k' (dsum_type_of_unknown_tag t))
(g32: leaf_reader g)
(destr: dep_enum_destr _ (read_dsum_cases_t t f g))
: Tot (leaf_reader (parse_dsum t p f g)) | let read_dsum
(#kt: parser_kind)
(t: dsum)
(#p: parser kt (dsum_repr_type t))
(p32: leaf_reader (parse_maybe_enum_key p (dsum_enum t)))
(j: jumper p)
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(f32: (x: dsum_known_key t) -> Tot (leaf_reader (dsnd (f x))))
(#k': parser_kind)
(#g: parser k' (dsum_type_of_unknown_tag t))
(g32: leaf_reader g)
(destr: dep_enum_destr _ (read_dsum_cases_t t f g))
: Tot (leaf_reader (parse_dsum t p f g))
= fun #_ #_ input pos ->
let h = HST.get () in
valid_facts (parse_dsum t p f g) h input pos;
parse_dsum_eq_ t p f g (bytes_of_slice_from h input pos);
valid_facts (parse_maybe_enum_key p (dsum_enum t)) h input pos;
let k = p32 input pos in
let pos' = jump_maybe_enum_key j (dsum_enum t) input pos in
valid_facts (parse_dsum_cases' t f g k) h input pos' ;
read_dsum_cases t f f32 g g32 destr k input pos' | {
"file_name": "src/lowparse/LowParse.Low.Sum.fst",
"git_rev": "00217c4a89f5ba56002ba9aa5b4a9d5903bfe9fa",
"git_url": "https://github.com/project-everest/everparse.git",
"project_name": "everparse"
} | {
"end_col": 50,
"end_line": 1626,
"start_col": 0,
"start_line": 1605
} | module LowParse.Low.Sum
include LowParse.Low.Enum
include LowParse.Spec.Sum
module U32 = FStar.UInt32
module HST = FStar.HyperStack.ST
module B = LowStar.Buffer
module Cast = FStar.Int.Cast
module U64 = FStar.UInt64
inline_for_extraction
let validate_sum_cases_aux
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(vc: ((x: sum_key t) -> Tot (validator (dsnd (pc x)))))
(k: sum_key t)
: Tot (validator (parse_sum_cases t pc k))
= [@inline_let]
let _ = synth_sum_case_injective t k in
validate_synth
(validate_weaken
(weaken_parse_cases_kind t pc)
(vc k)
()
)
(synth_sum_case t k)
()
inline_for_extraction
let validate_sum_cases_t
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot Type
= validator (parse_sum_cases t pc k)
let validate_sum_cases_t_eq
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
(x y : validate_sum_cases_t t pc k)
: GTot Type0
= True
inline_for_extraction
let validate_sum_cases_t_if
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (if_combinator _ (validate_sum_cases_t_eq t pc k))
= fun cond (sv_true: cond_true cond -> Tot (validate_sum_cases_t t pc k)) (sv_false: cond_false cond -> Tot (validate_sum_cases_t t pc k)) #rrel #rel input pos ->
if cond
then sv_true () input pos
else sv_false () input pos
inline_for_extraction
let validate_sum_cases
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(vc: ((x: sum_key t) -> Tot (validator (dsnd (pc x)))))
(destr: dep_enum_destr (sum_enum t) (validate_sum_cases_t t pc))
(k: sum_key t)
: Tot (validator (parse_sum_cases t pc k))
= destr
_
(validate_sum_cases_t_if t pc)
(fun _ _ -> ())
(fun _ _ _ _ -> ())
(validate_sum_cases_aux t pc vc)
k
inline_for_extraction
let validate_sum_aux_payload_t
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
: Tot Type
= (#rrel: _) -> (#rel: _) ->
(input: slice rrel rel) ->
(pos: U64.t) ->
HST.Stack U64.t
(requires (fun h -> live_slice h input /\ U64.v pos <= U32.v input.len))
(ensures (fun h res h' ->
B.modifies B.loc_none h h' /\ (
match k with
| Unknown _ -> is_error res
| Known k' ->
if is_success res
then
valid_pos (dsnd (pc k')) h input (uint64_to_uint32 pos) (uint64_to_uint32 res)
else
(~ (valid (dsnd (pc k')) h input (uint64_to_uint32 pos)))
)))
let validate_sum_aux_payload_eq
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
: Tot (validate_sum_aux_payload_t t pc k -> validate_sum_aux_payload_t t pc k -> GTot Type0)
= fun _ _ -> True
inline_for_extraction
let validate_sum_aux_payload_if'
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
(cond: bool)
(ift: ((cond_true cond) -> Tot (validate_sum_aux_payload_t t pc k)))
(iff: ((cond_false cond) -> Tot (validate_sum_aux_payload_t t pc k)))
: Tot (validate_sum_aux_payload_t t pc k)
= fun #rrel #rel input pos ->
if cond
then begin
(ift () <: validate_sum_aux_payload_t t pc k) input pos
end else
(iff () <: validate_sum_aux_payload_t t pc k) input pos
inline_for_extraction
let validate_sum_aux_payload_if
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
: Tot (if_combinator _ (validate_sum_aux_payload_eq t pc k))
= validate_sum_aux_payload_if' t pc k
#push-options "--z3rlimit 64 --z3cliopt smt.arith.nl=false --using_facts_from '* -FStar.Int.Cast -LowParse.BitFields'"
// --query_stats --smtencoding.elim_box true --smtencoding.l_arith_repr native --z3refresh"
inline_for_extraction
let validate_sum_aux
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(v: validator p)
(p32: leaf_reader p)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(v_payload: ((k: sum_repr_type t)) -> Tot (validate_sum_aux_payload_t t pc (maybe_enum_key_of_repr (sum_enum t) k)))
: Tot (validator (parse_sum t p pc))
= fun #rrel #rel input pos ->
let h = HST.get () in
[@inline_let]
let _ = parse_sum_eq'' t p pc (bytes_of_slice_from h input (uint64_to_uint32 pos)) in
[@inline_let]
let _ = valid_facts (parse_sum t p pc) h input (uint64_to_uint32 pos) in
[@inline_let]
let _ = valid_facts p h input (uint64_to_uint32 pos) in
let len_after_tag = v input pos in
if is_error len_after_tag
then len_after_tag
else begin
let h1 = HST.get () in
let k' = p32 input (uint64_to_uint32 pos) in
[@inline_let]
let _ =
match maybe_enum_key_of_repr (sum_enum t) k' with
| Known k -> valid_facts (dsnd (pc k)) h input (uint64_to_uint32 len_after_tag)
| _ -> ()
in
v_payload k' input len_after_tag
end
#pop-options
inline_for_extraction
let validate_sum_aux_payload'
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (validator (dsnd (pc x)))))
(k: maybe_enum_key (sum_enum t))
: Tot (validate_sum_aux_payload_t t pc k)
= fun #rrel #rel input pos ->
match k with
| Known k ->
[@inline_let]
let _ = synth_sum_case_injective t k in
pc32 k input pos
// validate_synth (pc32 k) (synth_sum_case t k) () input pos
| _ -> validator_error_generic
inline_for_extraction
let validate_sum_aux_payload
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (validator (dsnd (pc x)))))
(destr: dep_maybe_enum_destr_t (sum_enum t) (validate_sum_aux_payload_t t pc))
(k: sum_repr_type t)
: Tot (validate_sum_aux_payload_t t pc (maybe_enum_key_of_repr (sum_enum t) k))
= destr (validate_sum_aux_payload_eq t pc) (validate_sum_aux_payload_if t pc) (fun _ _ -> ()) (fun _ _ _ _ -> ()) (validate_sum_aux_payload' t pc pc32) k
inline_for_extraction
let validate_sum
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(v: validator p)
(p32: leaf_reader p)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (validator (dsnd (pc x)))))
(destr: dep_maybe_enum_destr_t (sum_enum t) (validate_sum_aux_payload_t t pc))
: Tot (validator (parse_sum t p pc))
= validate_sum_aux t v p32 pc (validate_sum_aux_payload t pc pc32 destr)
module HS = FStar.HyperStack
#push-options "--z3rlimit 256 --z3cliopt smt.arith.nl=false --initial_ifuel 8 --max_ifuel 8 --initial_fuel 2 --max_fuel 2"
#restart-solver
let valid_sum_intro
(h: HS.mem)
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: Lemma
(requires (
valid (parse_enum_key p (sum_enum t)) h input pos /\ (
let k = contents (parse_enum_key p (sum_enum t)) h input pos in
valid (dsnd (pc k)) h input (get_valid_pos (parse_enum_key p (sum_enum t)) h input pos)
)))
(ensures (
let k = contents (parse_enum_key p (sum_enum t)) h input pos in
let pos_payload = get_valid_pos (parse_enum_key p (sum_enum t)) h input pos in
valid_content_pos
(parse_sum t p pc) h input pos
(synth_sum_case t k (contents (dsnd (pc k)) h input pos_payload))
(get_valid_pos (dsnd (pc k)) h input pos_payload)
))
= valid_facts (parse_enum_key p (sum_enum t)) h input pos;
let k = contents (parse_enum_key p (sum_enum t)) h input pos in
let pos_payload = get_valid_pos (parse_enum_key p (sum_enum t)) h input pos in
valid_facts (dsnd (pc k)) h input pos_payload;
valid_facts (parse_sum t p pc) h input pos;
parse_sum_eq t p pc (bytes_of_slice_from h input pos)
#pop-options
inline_for_extraction
let finalize_sum_case
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(s: serializer p)
(w: leaf_writer_strong s)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(destr: enum_repr_of_key'_t (sum_enum t))
(k: sum_key t)
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: HST.Stack unit
(requires (fun h ->
let len_tag = serialized_length (serialize_enum_key _ s (sum_enum t)) k in
U32.v pos + len_tag < 4294967296 /\ (
let pos_payload = pos `U32.add` U32.uint_to_t len_tag in
valid (dsnd (pc k)) h input pos_payload /\
writable input.base (U32.v pos) (U32.v pos_payload) h
)))
(ensures (fun h _ h' ->
let len_tag = serialized_length (serialize_enum_key _ s (sum_enum t)) k in
let pos_payload = pos `U32.add` U32.uint_to_t len_tag in
B.modifies (loc_slice_from_to input pos pos_payload) h h' /\
valid_content_pos (parse_sum t p pc) h' input pos (synth_sum_case t k (contents (dsnd (pc k)) h input pos_payload)) (get_valid_pos (dsnd (pc k)) h input pos_payload)
))
= let pos1 = write_enum_key w (sum_enum t) destr k input pos in
let h = HST.get () in
[@inline_let]
let _ = valid_sum_intro h t p pc input pos in
()
inline_for_extraction
let jump_sum_cases_aux
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(vc: ((x: sum_key t) -> Tot (jumper (dsnd (pc x)))))
(k: sum_key t)
: Tot (jumper (parse_sum_cases t pc k))
= [@inline_let]
let _ = synth_sum_case_injective t k in
jump_synth
(jump_weaken
(weaken_parse_cases_kind t pc)
(vc k)
()
)
(synth_sum_case t k)
()
inline_for_extraction
let jump_sum_cases_t
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot Type
= jumper (parse_sum_cases t pc k)
let jump_sum_cases_t_eq
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
(x y : jump_sum_cases_t t pc k)
: GTot Type0
= True
inline_for_extraction
let jump_sum_cases_t_if
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (if_combinator _ (jump_sum_cases_t_eq t pc k))
= fun cond (sv_true: cond_true cond -> Tot (jump_sum_cases_t t pc k)) (sv_false: cond_false cond -> Tot (jump_sum_cases_t t pc k)) #rrel #rel input pos ->
if cond
then sv_true () input pos
else sv_false () input pos
inline_for_extraction
let jump_sum_cases
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(vc: ((x: sum_key t) -> Tot (jumper (dsnd (pc x)))))
(destr: dep_enum_destr (sum_enum t) (jump_sum_cases_t t pc))
(k: sum_key t)
: Tot (jumper (parse_sum_cases t pc k))
= destr
_
(jump_sum_cases_t_if t pc)
(fun _ _ -> ())
(fun _ _ _ _ -> ())
(jump_sum_cases_aux t pc vc)
k
inline_for_extraction
let jump_sum_aux_payload_t
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
: Tot Type
= (#rrel: _) -> (#rel: _) ->
(input: slice rrel rel) ->
(pos: U32.t) ->
HST.Stack U32.t
(requires (fun h -> live_slice h input /\ U32.v pos <= U32.v input.len /\ (
match k with
| Unknown _ -> False
| Known k' -> valid (dsnd (pc k')) h input pos
)))
(ensures (fun h res h' ->
B.modifies B.loc_none h h' /\ (
match k with
| Unknown _ -> False
| Known k' ->
valid_pos (dsnd (pc k')) h input pos res
)))
let jump_sum_aux_payload_eq
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
: Tot (jump_sum_aux_payload_t t pc k -> jump_sum_aux_payload_t t pc k -> GTot Type0)
= fun _ _ -> True
inline_for_extraction
let jump_sum_aux_payload_if'
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
(cond: bool)
(ift: ((cond_true cond) -> Tot (jump_sum_aux_payload_t t pc k)))
(iff: ((cond_false cond) -> Tot (jump_sum_aux_payload_t t pc k)))
: Tot (jump_sum_aux_payload_t t pc k)
= fun #rrel #rel input pos ->
if cond
then begin
(ift () <: jump_sum_aux_payload_t t pc k) input pos
end else
(iff () <: jump_sum_aux_payload_t t pc k) input pos
inline_for_extraction
let jump_sum_aux_payload_if
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
: Tot (if_combinator _ (jump_sum_aux_payload_eq t pc k))
= jump_sum_aux_payload_if' t pc k
let parse_sum_eq3
(#kt: parser_kind)
(t: sum)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(input: bytes)
(k' : sum_repr_type t)
(consumed_k: consumed_length input)
: Lemma
(requires (Some? (parse (parse_sum t p pc) input) /\ parse p input == Some (k', consumed_k)))
(ensures (
let input_k = Seq.slice input consumed_k (Seq.length input) in
let k = maybe_enum_key_of_repr (sum_enum t) k' in
begin match k with
| Known k ->
Some? (parse (dsnd (pc k)) input_k)
| _ -> False
end
))
= parse_sum_eq'' t p pc input
let parse_sum_eq4
(#kt: parser_kind)
(t: sum)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(input: bytes)
(k' : sum_repr_type t)
(consumed_k: consumed_length input)
(consumed_payload: nat)
: Lemma
(requires (Some? (parse (parse_sum t p pc) input) /\ parse p input == Some (k', consumed_k) /\ (
let input_k = Seq.slice input consumed_k (Seq.length input) in
let k = maybe_enum_key_of_repr (sum_enum t) k' in
begin match k with
| Known k ->
Some? (parse (dsnd (pc k)) input_k) /\ (
let Some (_, consumed_payload') = parse (dsnd (pc k)) input_k in
consumed_payload' == consumed_payload
)
| _ -> False
end
)))
(ensures (
let Some (_, consumed) = parse (parse_sum t p pc) input in
consumed == consumed_k + consumed_payload
))
= parse_sum_eq'' t p pc input
#push-options "--z3rlimit 16"
let valid_sum_elim
(h: HS.mem)
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(#rrel: _) (#rel: _)
(input: slice rrel rel)
(pos: U32.t)
: Lemma
(requires (
valid (parse_sum t p pc) h input pos
))
(ensures (
valid p h input pos /\ (
let pos_payload = get_valid_pos p h input pos in
let k' = maybe_enum_key_of_repr (sum_enum t) (contents p h input pos) in
match k' with
| Known k ->
k == sum_tag_of_data t (contents (parse_sum t p pc) h input pos) /\
valid (dsnd (pc k)) h input pos_payload /\
valid_pos
(parse_sum t p pc) h input pos
(get_valid_pos (dsnd (pc k)) h input pos_payload)
| _ -> False
)))
= let sinput = bytes_of_slice_from h input pos in
let _ = parse_sum_eq'' t p pc sinput in
[@inline_let]
let _ = valid_facts (parse_sum t p pc) h input pos in
let Some (k', consumed_k) = parse p sinput in
let pos_after_tag = U32.uint_to_t (U32.v pos + consumed_k) in
[@inline_let]
let _ = valid_facts p h input pos in
assert (valid_content_pos p h input pos k' pos_after_tag);
match maybe_enum_key_of_repr (sum_enum t) k' with
| Known k -> valid_facts (dsnd (pc k)) h input pos_after_tag
| _ -> ()
#pop-options
let valid_sum_elim_tag
(h: HS.mem)
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: Lemma
(requires (
valid (parse_sum t p pc) h input pos
))
(ensures (
valid (parse_enum_key p (sum_enum t)) h input pos /\
contents (parse_enum_key p (sum_enum t)) h input pos == sum_tag_of_data t (contents (parse_sum t p pc) h input pos)
))
= let _ = parse_sum_eq' t p pc (bytes_of_slice_from h input pos) in
let _ = valid_facts (parse_sum t p pc) h input pos in
let _ = valid_facts (parse_enum_key p (sum_enum t)) h input pos in
()
inline_for_extraction
let read_sum_tag
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(p32: leaf_reader p)
(destr: dep_maybe_enum_destr_t (sum_enum t) (read_enum_key_t (sum_enum t)))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: HST.Stack (sum_key t)
(requires (fun h ->
valid (parse_sum t p pc) h input pos
))
(ensures (fun h res h' ->
B.modifies B.loc_none h h' /\
res == sum_tag_of_data t (contents (parse_sum t p pc) h input pos)
))
= let h = HST.get () in
[@inline_let] let _ = valid_sum_elim_tag h t p pc input pos in
read_enum_key p32 (sum_enum t) destr input pos
inline_for_extraction
let jump_sum_aux
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(v: jumper p)
(p32: leaf_reader p)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(v_payload: ((k: sum_repr_type t)) -> Tot (jump_sum_aux_payload_t t pc (maybe_enum_key_of_repr (sum_enum t) k)))
: Tot (jumper (parse_sum t p pc))
= fun #rrel #rel input pos ->
let h = HST.get () in
[@inline_let]
let _ = valid_sum_elim h t p pc input pos in
let pos_after_tag = v input pos in
let k' = p32 input pos in
v_payload k' input pos_after_tag
inline_for_extraction
let jump_sum_aux_payload'
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (jumper (dsnd (pc x)))))
(k: maybe_enum_key (sum_enum t))
: Tot (jump_sum_aux_payload_t t pc k)
= fun #rrel #rel input pos ->
match k with
| Known k ->
[@inline_let]
let _ = synth_sum_case_injective t k in
pc32 k input pos
| _ -> 0ul // dummy, but we MUST NOT remove this branch, otherwise extraction fails
inline_for_extraction
let jump_sum_aux_payload
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (jumper (dsnd (pc x)))))
(destr: dep_maybe_enum_destr_t (sum_enum t) (jump_sum_aux_payload_t t pc))
(k: sum_repr_type t)
: Tot (jump_sum_aux_payload_t t pc (maybe_enum_key_of_repr (sum_enum t) k))
= destr (jump_sum_aux_payload_eq t pc) (jump_sum_aux_payload_if t pc) (fun _ _ -> ()) (fun _ _ _ _ -> ()) (jump_sum_aux_payload' t pc pc32) k
inline_for_extraction
let jump_sum
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(v: jumper p)
(p32: leaf_reader p)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (jumper (dsnd (pc x)))))
(destr: dep_maybe_enum_destr_t (sum_enum t) (jump_sum_aux_payload_t t pc))
: Tot (jumper (parse_sum t p pc))
= jump_sum_aux t v p32 pc (jump_sum_aux_payload t pc pc32 destr)
inline_for_extraction
let read_sum_cases'
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (leaf_reader (dsnd (pc x)))))
(k: sum_key t)
: Tot (leaf_reader (parse_sum_cases' t pc k))
= [@inline_let]
let _ = synth_sum_case_injective t k in
read_synth'
(dsnd (pc k))
(synth_sum_case t k)
(pc32 k)
()
inline_for_extraction
let read_sum_cases_t
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot Type
= leaf_reader (parse_sum_cases' t pc k)
let read_sum_cases_t_eq
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
(x y : read_sum_cases_t t pc k)
: GTot Type0
= True
inline_for_extraction
let read_sum_cases_t_if
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (if_combinator _ (read_sum_cases_t_eq t pc k))
= fun cond (sv_true: cond_true cond -> Tot (read_sum_cases_t t pc k)) (sv_false: cond_false cond -> Tot (read_sum_cases_t t pc k)) #_ #_ input pos ->
if cond
then (sv_true () input pos)
else (sv_false () input pos)
inline_for_extraction
let read_sum_cases
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (leaf_reader (dsnd (pc x)))))
(destr: dep_enum_destr (sum_enum t) (read_sum_cases_t t pc))
(k: sum_key t)
: Tot (leaf_reader (parse_sum_cases' t pc k))
= destr
_
(read_sum_cases_t_if t pc)
(fun _ _ -> ())
(fun _ _ _ _ -> ())
(read_sum_cases' t pc pc32)
k
#push-options "--z3rlimit 32"
inline_for_extraction
let read_sum
(#kt: parser_kind)
(t: sum)
(p: parser kt (sum_repr_type t))
(p32: leaf_reader (parse_enum_key p (sum_enum t)))
(j: jumper p)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (leaf_reader (dsnd (pc x)))))
(destr: dep_enum_destr (sum_enum t) (read_sum_cases_t t pc))
: Tot (leaf_reader (parse_sum t p pc))
=
fun #_ #_ input pos ->
let h = HST.get () in
valid_facts (parse_sum t p pc) h input pos;
parse_sum_eq' t p pc (bytes_of_slice_from h input pos);
valid_facts (parse_enum_key p (sum_enum t)) h input pos;
let k = p32 input pos in
let pos' = jump_enum_key j (sum_enum t) input pos in
valid_facts (parse_sum_cases' t pc k) h input pos' ;
read_sum_cases t pc pc32 destr k input pos'
#pop-options
inline_for_extraction
let serialize32_sum_cases_t
(t: sum)
(#pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(sc: ((x: sum_key t) -> Tot (serializer (dsnd (pc x)))))
(k: sum_key t)
: Tot Type
= serializer32 (serialize_sum_cases t pc sc k)
let serialize32_sum_cases_t_eq
(t: sum)
(#pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(sc: ((x: sum_key t) -> Tot (serializer (dsnd (pc x)))))
(k: sum_key t)
(x y: serialize32_sum_cases_t t sc k)
: GTot Type0
= True
inline_for_extraction
let serialize32_sum_cases_t_if
(t: sum)
(#pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(sc: ((x: sum_key t) -> Tot (serializer (dsnd (pc x)))))
(k: sum_key t)
: Tot (if_combinator _ (serialize32_sum_cases_t_eq t sc k))
= fun cond (sv_true: (cond_true cond -> Tot (serialize32_sum_cases_t t sc k))) (sv_false: (cond_false cond -> Tot (serialize32_sum_cases_t t sc k))) x #rrel #rel b pos ->
if cond
then (sv_true () x b pos)
else (sv_false () x b pos)
inline_for_extraction
let serialize32_sum_cases_aux
(t: sum)
(#pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(sc: ((x: sum_key t) -> Tot (serializer (dsnd (pc x)))))
(sc32: ((x: sum_key t) -> Tot (serializer32 (sc x))))
(k: sum_key t)
: Tot (serializer32 (serialize_sum_cases t pc sc k))
= fun x #rrel #rel b pos ->
[@inline_let] let _ =
Classical.forall_intro (parse_sum_cases_eq' t pc k);
synth_sum_case_injective t k;
synth_sum_case_inverse t k
in
serialize32_synth
(sc32 k)
(synth_sum_case t k)
(synth_sum_case_recip t k)
(fun x -> synth_sum_case_recip t k x)
()
x
b
pos
inline_for_extraction
let serialize32_sum_cases
(t: sum)
(#pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(sc: ((x: sum_key t) -> Tot (serializer (dsnd (pc x)))))
(sc32: ((x: sum_key t) -> Tot (serializer32 (sc x))))
(destr: dep_enum_destr (sum_enum t) (serialize32_sum_cases_t t sc))
(k: sum_key t)
: Tot (serializer32 (serialize_sum_cases t pc sc k))
= destr
_
(serialize32_sum_cases_t_if t sc)
(fun _ _ -> ())
(fun _ _ _ _ -> ())
(serialize32_sum_cases_aux t sc sc32)
k
inline_for_extraction
let serialize32_sum
(#kt: parser_kind)
(t: sum)
(#p: parser kt (sum_repr_type t))
(s: serializer p {kt.parser_kind_subkind == Some ParserStrong})
(s32: serializer32 (serialize_enum_key _ s (sum_enum t)))
(#pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(sc: ((x: sum_key t) -> Tot (serializer (dsnd (pc x)))))
(sc32: ((x: sum_key t) -> Tot (serializer32 (sc x))))
(destr: dep_enum_destr (sum_enum t) (serialize32_sum_cases_t t sc))
: Tot (serializer32 (serialize_sum t s sc))
= fun x #rrel #rel b pos ->
serialize_sum_eq t s sc x;
let tg = sum_tag_of_data t x in
serialize32_nondep_then_aux s32 (serialize32_sum_cases t sc sc32 destr tg) tg x b pos
let clens_sum_tag
(s: sum)
: Tot (clens (sum_type s) (sum_key s))
= {
clens_cond = (fun _ -> True);
clens_get = sum_tag_of_data s;
}
let gaccessor_sum_tag
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
: Tot (gaccessor (parse_sum t p pc) (parse_enum_key p (sum_enum t)) (clens_sum_tag t))
= gaccessor_tagged_union_tag
(parse_enum_key p (sum_enum t))
(sum_tag_of_data t)
(parse_sum_cases t pc)
inline_for_extraction
let accessor_sum_tag
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
: Tot (accessor (gaccessor_sum_tag t p pc))
= accessor_tagged_union_tag
(parse_enum_key p (sum_enum t))
(sum_tag_of_data t)
(parse_sum_cases t pc)
let clens_sum_payload
(s: sum)
(k: sum_key s)
: Tot (clens (sum_type s) (sum_type_of_tag s k))
= {
clens_cond = (fun (x: sum_type s) -> sum_tag_of_data s x == k);
clens_get = (fun (x: sum_type s) -> synth_sum_case_recip s k x <: Ghost (sum_type_of_tag s k) (requires (sum_tag_of_data s x == k)) (ensures (fun _ -> True)));
}
#push-options "--z3rlimit 32"
let gaccessor_clens_sum_payload'
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (gaccessor' (parse_sum t p pc) (dsnd (pc k)) (clens_sum_payload t k))
= fun (input: bytes) ->
parse_sum_eq'' t p pc input;
let res =
match parse p input with
| Some (_, consumed) ->
synth_sum_case_inverse t k;
synth_sum_case_injective t k;
synth_injective_synth_inverse_synth_inverse_recip (synth_sum_case t k) (synth_sum_case_recip t k) ();
(consumed)
| _ -> 0 // dummy
in
(res <: (res: _ { gaccessor_post' (parse_sum t p pc) (dsnd (pc k)) (clens_sum_payload t k) input res } ))
#push-options "--z3rlimit 64"
let gaccessor_clens_sum_payload_injective
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
(sl sl' : bytes)
: Lemma
(requires (
gaccessor_pre (parse_sum t p pc) (dsnd (pc k)) (clens_sum_payload t k) sl /\
gaccessor_pre (parse_sum t p pc) (dsnd (pc k)) (clens_sum_payload t k) sl' /\
injective_precond (parse_sum t p pc) sl sl'
))
(ensures (gaccessor_clens_sum_payload' t p pc k sl == gaccessor_clens_sum_payload' t p pc k sl'))
= parse_sum_eq'' t p pc sl;
parse_sum_eq'' t p pc sl' ;
parse_injective (parse_sum t p pc) sl sl' ;
parse_injective p sl sl'
#pop-options
let gaccessor_clens_sum_payload_no_lookahead
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
(sl sl' : bytes)
: Lemma
(requires (
(parse_sum_kind kt t pc).parser_kind_subkind == Some ParserStrong /\
gaccessor_pre (parse_sum t p pc) (dsnd (pc k)) (clens_sum_payload t k) sl /\
gaccessor_pre (parse_sum t p pc) (dsnd (pc k)) (clens_sum_payload t k) sl' /\
no_lookahead_on_precond (parse_sum t p pc) sl sl'
))
(ensures (gaccessor_clens_sum_payload' t p pc k sl == gaccessor_clens_sum_payload' t p pc k sl'))
= parse_sum_eq'' t p pc sl;
parse_sum_eq'' t p pc sl' ;
parse_strong_prefix (parse_sum t p pc) sl sl' ;
parse_injective p sl sl'
let gaccessor_clens_sum_payload
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (gaccessor (parse_sum t p pc) (dsnd (pc k)) (clens_sum_payload t k))
= Classical.forall_intro_2 (fun x -> Classical.move_requires (gaccessor_clens_sum_payload_injective t p pc k x));
Classical.forall_intro_2 (fun x -> Classical.move_requires (gaccessor_clens_sum_payload_no_lookahead t p pc k x));
gaccessor_prop_equiv (parse_sum t p pc) (dsnd (pc k)) (clens_sum_payload t k) (gaccessor_clens_sum_payload' t p pc k);
gaccessor_clens_sum_payload' t p pc k
inline_for_extraction
let accessor_clens_sum_payload'
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(j: jumper p)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: HST.Stack U32.t
(requires (fun h ->
valid (parse_sum t p pc) h input pos /\
(clens_sum_payload t k).clens_cond (contents (parse_sum t p pc) h input pos)
))
(ensures (fun h pos' h' ->
B.modifies B.loc_none h h' /\
pos' == slice_access h (gaccessor_clens_sum_payload t p pc k) input pos
))
=
let h = HST.get () in
[@inline_let]
let _ =
let pos' = get_valid_pos (parse_sum t p pc) h input pos in
let large = bytes_of_slice_from h input pos in
slice_access_eq h (gaccessor_clens_sum_payload t p pc k) input pos;
valid_facts (parse_sum t p pc) h input pos;
parse_sum_eq'' t p pc large;
valid_facts p h input pos
in
j input pos
#pop-options
inline_for_extraction
let accessor_clens_sum_payload
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(j: jumper p)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (accessor (gaccessor_clens_sum_payload t p pc k))
= fun #rrel #rel -> accessor_clens_sum_payload' t j pc k #rrel #rel
let clens_sum_cases_payload
(s: sum)
(k: sum_key s)
: Tot (clens (sum_cases s k) (sum_type_of_tag s k))
= {
clens_cond = (fun (x: sum_cases s k) -> True);
clens_get = (fun (x: sum_cases s k) -> synth_sum_case_recip s k x <: Ghost (sum_type_of_tag s k) (requires (True)) (ensures (fun _ -> True)));
}
let gaccessor_clens_sum_cases_payload
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (gaccessor (parse_sum_cases' t pc k) (dsnd (pc k)) (clens_sum_cases_payload t k))
= synth_sum_case_injective t k;
synth_sum_case_inverse t k;
synth_injective_synth_inverse_synth_inverse_recip (synth_sum_case t k) (synth_sum_case_recip t k) ();
gaccessor_ext
(gaccessor_synth (dsnd (pc k)) (synth_sum_case t k) (synth_sum_case_recip t k) ())
(clens_sum_cases_payload t k)
()
inline_for_extraction
let accessor_clens_sum_cases_payload
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (accessor (gaccessor_clens_sum_cases_payload t pc k))
= [@inline_let]
let _ =
synth_sum_case_injective t k;
synth_sum_case_inverse t k;
synth_injective_synth_inverse_synth_inverse_recip (synth_sum_case t k) (synth_sum_case_recip t k) ()
in
accessor_ext
(accessor_synth (dsnd (pc k)) (synth_sum_case t k) (synth_sum_case_recip t k) ())
(clens_sum_cases_payload t k)
()
inline_for_extraction
let validate_dsum_cases_t
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(#k: parser_kind)
(g: parser k (dsum_type_of_unknown_tag s))
(x: dsum_key s)
: Tot Type
= validator (parse_dsum_cases' s f g x)
let validate_dsum_cases_eq
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(#k: parser_kind)
(g: parser k (dsum_type_of_unknown_tag s))
(x: dsum_key s)
(v1 v2 : validate_dsum_cases_t s f g x)
: GTot Type0
= True
inline_for_extraction
let validate_dsum_cases_if'
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(#k: parser_kind)
(g: parser k (dsum_type_of_unknown_tag s))
(x: dsum_key s)
(cond: bool)
(ift: (cond_true cond -> Tot (validate_dsum_cases_t s f g x)))
(iff: (cond_false cond -> Tot (validate_dsum_cases_t s f g x)))
: Tot (validate_dsum_cases_t s f g x)
= fun #rrel #rel input len ->
if cond
then (ift () <: validate_dsum_cases_t s f g x) input len
else (iff () <: validate_dsum_cases_t s f g x) input len
inline_for_extraction
let validate_dsum_cases_if
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(#k: parser_kind)
(g: parser k (dsum_type_of_unknown_tag s))
(x: dsum_key s)
: Tot (if_combinator _ (validate_dsum_cases_eq s f g x))
= validate_dsum_cases_if' s f g x
inline_for_extraction
let validate_dsum_cases'
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(f' : (x: dsum_known_key s) -> Tot (validator (dsnd (f x))))
(#k: parser_kind)
(#g: parser k (dsum_type_of_unknown_tag s))
(g' : validator g)
(x: dsum_key s)
: Tot (validate_dsum_cases_t s f g x)
= [@inline_let]
let _ = synth_dsum_case_injective s x in
match x with
| Known x' -> validate_synth (f' x') (synth_dsum_case s (Known x')) () <: validator (parse_dsum_cases' s f g x)
| Unknown x' -> validate_synth g' (synth_dsum_case s (Unknown x')) () <: validator (parse_dsum_cases' s f g x)
inline_for_extraction
let validate_dsum_cases'_destr
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(f' : (x: dsum_known_key s) -> Tot (validator (dsnd (f x))))
(#k: parser_kind)
(#g: parser k (dsum_type_of_unknown_tag s))
(g' : validator g)
(destr: dep_enum_destr _ (fun k -> validate_dsum_cases_t s f g (Known k)))
(x: dsum_key s)
: Tot (validate_dsum_cases_t s f g x)
= fun #rrel #rel input pos ->
match x with
| Known k ->
destr
_
(fun k -> validate_dsum_cases_if s f g (Known k))
(fun _ _ -> ())
(fun _ _ _ _ -> ())
(fun k -> validate_dsum_cases' s f f' g' (Known k))
k
input
pos
| Unknown r -> validate_dsum_cases' s f f' g' (Unknown r) input pos
inline_for_extraction
let validate_dsum_cases
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(f' : (x: dsum_known_key s) -> Tot (validator (dsnd (f x))))
(#k: parser_kind)
(#g: parser k (dsum_type_of_unknown_tag s))
(g' : validator g)
(destr: dep_enum_destr _ (fun k -> validate_dsum_cases_t s f g (Known k)))
(x: dsum_key s)
: Tot (validator (parse_dsum_cases s f g x))
= fun #rrel #rel input pos ->
let h = HST.get () in
[@inline_let]
let _ =
valid_facts (parse_dsum_cases' s f g x) h input (uint64_to_uint32 pos);
valid_facts (parse_dsum_cases s f g x) h input (uint64_to_uint32 pos);
parse_dsum_cases_eq' s f g x (bytes_of_slice_from h input (uint64_to_uint32 pos))
in
validate_dsum_cases'_destr s f f' g' destr x input pos
#push-options "--z3rlimit 40"
inline_for_extraction
let validate_dsum
(#kt: parser_kind)
(t: dsum)
(#p: parser kt (dsum_repr_type t))
(v: validator p)
(p32: leaf_reader p)
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(f32: (x: dsum_known_key t) -> Tot (validator (dsnd (f x))))
(#k': parser_kind)
(#g: parser k' (dsum_type_of_unknown_tag t))
(g32: validator g)
(destr: dep_maybe_enum_destr_t (dsum_enum t) (validate_dsum_cases_t t f g))
: Tot (validator (parse_dsum t p f g))
= fun #rrel #rel input pos ->
let h = HST.get () in
[@inline_let]
let _ = parse_dsum_eq' t p f g (bytes_of_slice_from h input (uint64_to_uint32 pos)) in
[@inline_let]
let _ = valid_facts (parse_dsum t p f g) h input (uint64_to_uint32 pos) in
[@inline_let]
let _ = valid_facts p h input (uint64_to_uint32 pos) in
let pos_after_tag = v input pos in
if is_error pos_after_tag
then pos_after_tag
else
let tg = p32 input (uint64_to_uint32 pos) in
[@inline_let]
let _ = valid_facts (parse_dsum_cases' t f g (maybe_enum_key_of_repr (dsum_enum t) tg)) h input (uint64_to_uint32 pos_after_tag) in
destr (validate_dsum_cases_eq t f g) (validate_dsum_cases_if t f g) (fun _ _ -> ()) (fun _ _ _ _ -> ()) (validate_dsum_cases' t f f32 g32) tg input pos_after_tag
#pop-options
#reset-options "--z3rlimit 64 --z3cliopt smt.arith.nl=false --initial_ifuel 8 --max_ifuel 8 --initial_fuel 2 --max_fuel 2"
let valid_dsum_intro_known
(h: HS.mem)
(t: dsum)
(#kt: parser_kind)
(p: parser kt (dsum_repr_type t))
(f: ((x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x))))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: Lemma
(requires (
valid (parse_maybe_enum_key p (dsum_enum t)) h input pos /\ (
let k' = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
Known? k' /\ (
let Known k = k' in
valid (dsnd (f k)) h input (get_valid_pos (parse_maybe_enum_key p (dsum_enum t)) h input pos)
))))
(ensures (
let Known k = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
let pos_payload = get_valid_pos (parse_maybe_enum_key p (dsum_enum t)) h input pos in
valid_content_pos
(parse_dsum t p f g) h input pos
(synth_dsum_case t (Known k) (contents (dsnd (f k)) h input pos_payload))
(get_valid_pos (dsnd (f k)) h input pos_payload)
))
= valid_facts (parse_maybe_enum_key p (dsum_enum t)) h input pos;
let Known k = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
let pos_payload = get_valid_pos (parse_maybe_enum_key p (dsum_enum t)) h input pos in
valid_facts (dsnd (f k)) h input pos_payload;
valid_facts (parse_dsum t p f g) h input pos;
parse_dsum_eq t p f g (bytes_of_slice_from h input pos)
let valid_dsum_intro_unknown
(h: HS.mem)
(t: dsum)
(#kt: parser_kind)
(p: parser kt (dsum_repr_type t))
(f: ((x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x))))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: Lemma
(requires (
valid (parse_maybe_enum_key p (dsum_enum t)) h input pos /\ (
let k' = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
Unknown? k' /\
valid g h input (get_valid_pos (parse_maybe_enum_key p (dsum_enum t)) h input pos)
)))
(ensures (
let Unknown r = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
let pos_payload = get_valid_pos (parse_maybe_enum_key p (dsum_enum t)) h input pos in
valid_content_pos
(parse_dsum t p f g) h input pos
(synth_dsum_case t (Unknown r) (contents g h input pos_payload))
(get_valid_pos g h input pos_payload)
))
= valid_facts (parse_maybe_enum_key p (dsum_enum t)) h input pos;
let Unknown r = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
let pos_payload = get_valid_pos (parse_maybe_enum_key p (dsum_enum t)) h input pos in
valid_facts g h input pos_payload;
valid_facts (parse_dsum t p f g) h input pos;
parse_dsum_eq t p f g (bytes_of_slice_from h input pos)
#reset-options
inline_for_extraction
let finalize_dsum_case_known
(t: dsum)
(#kt: parser_kind)
(#p: parser kt (dsum_repr_type t))
(s: serializer p)
(w: leaf_writer_strong s)
(f: ((x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x))))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
(destr: enum_repr_of_key'_t (dsum_enum t))
(k: dsum_known_key t)
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: HST.Stack unit
(requires (fun h ->
let len_tag = serialized_length (serialize_enum_key _ s (dsum_enum t)) k in
U32.v pos + len_tag < 4294967296 /\ (
let pos_payload = pos `U32.add` U32.uint_to_t len_tag in
valid (dsnd (f k)) h input pos_payload /\
writable input.base (U32.v pos) (U32.v pos_payload) h
)))
(ensures (fun h _ h' ->
let len_tag = serialized_length (serialize_enum_key _ s (dsum_enum t)) k in
let pos_payload = pos `U32.add` U32.uint_to_t len_tag in
B.modifies (loc_slice_from_to input pos pos_payload) h h' /\
valid_content_pos (parse_dsum t p f g) h' input pos (synth_dsum_case t (Known k) (contents (dsnd (f k)) h input pos_payload)) (get_valid_pos (dsnd (f k)) h input pos_payload)
))
= let pos1 = write_enum_key w (dsum_enum t) destr k input pos in
let h = HST.get () in
[@inline_let]
let _ =
valid_facts (parse_enum_key p (dsum_enum t)) h input pos;
valid_facts (parse_maybe_enum_key p (dsum_enum t)) h input pos;
let sq = bytes_of_slice_from h input pos in
parse_enum_key_eq p (dsum_enum t) sq;
parse_maybe_enum_key_eq p (dsum_enum t) sq;
valid_dsum_intro_known h t p f g input pos
in
()
inline_for_extraction
let finalize_dsum_case_unknown
(t: dsum)
(#kt: parser_kind)
(#p: parser kt (dsum_repr_type t))
(s: serializer p)
(w: leaf_writer_strong s)
(f: ((x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x))))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
(r: unknown_enum_repr (dsum_enum t))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: HST.Stack unit
(requires (fun h ->
let len_tag = serialized_length s r in
U32.v pos + len_tag < 4294967296 /\ (
let pos_payload = pos `U32.add` U32.uint_to_t len_tag in
valid g h input pos_payload /\
writable input.base (U32.v pos) (U32.v pos_payload) h
)))
(ensures (fun h _ h' ->
let len_tag = serialized_length s r in
let pos_payload = pos `U32.add` U32.uint_to_t len_tag in
B.modifies (loc_slice_from_to input pos pos_payload) h h' /\
valid_content_pos (parse_dsum t p f g) h' input pos (synth_dsum_case t (Unknown r) (contents g h input pos_payload)) (get_valid_pos g h input pos_payload)
))
= let pos1 = w r input pos in
let h = HST.get () in
[@inline_let]
let _ =
valid_facts (parse_maybe_enum_key p (dsum_enum t)) h input pos;
valid_facts p h input pos;
let sq = bytes_of_slice_from h input pos in
parse_maybe_enum_key_eq p (dsum_enum t) sq;
valid_dsum_intro_unknown h t p f g input pos
in
()
let valid_dsum_elim_tag
(h: HS.mem)
(t: dsum)
(#kt: parser_kind)
(p: parser kt (dsum_repr_type t))
(f: ((x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x))))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: Lemma
(requires (
valid (parse_dsum t p f g) h input pos
))
(ensures (
valid (parse_maybe_enum_key p (dsum_enum t)) h input pos /\
contents (parse_maybe_enum_key p (dsum_enum t)) h input pos == dsum_tag_of_data t (contents (parse_dsum t p f g) h input pos)
))
= let _ = parse_dsum_eq_ t p f g (bytes_of_slice_from h input pos) in
let _ = valid_facts (parse_dsum t p f g) h input pos in
let _ = valid_facts (parse_maybe_enum_key p (dsum_enum t)) h input pos in
()
inline_for_extraction
let read_dsum_tag
(t: dsum)
(#kt: parser_kind)
(#p: parser kt (dsum_repr_type t))
(p32: leaf_reader p)
(destr: maybe_enum_destr_t (maybe_enum_key (dsum_enum t)) (dsum_enum t))
(f: ((x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x))))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: HST.Stack (dsum_key t)
(requires (fun h ->
valid (parse_dsum t p f g) h input pos
))
(ensures (fun h res h' ->
B.modifies B.loc_none h h' /\
res == dsum_tag_of_data t (contents (parse_dsum t p f g) h input pos)
))
= let h = HST.get () in
[@inline_let] let _ = valid_dsum_elim_tag h t p f g input pos in
read_maybe_enum_key p32 (dsum_enum t) destr input pos
#push-options "--z3rlimit 32"
let valid_dsum_elim_known
(h: HS.mem)
(t: dsum)
(#kt: parser_kind)
(p: parser kt (dsum_repr_type t))
(f: ((x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x))))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: Lemma
(requires (
valid (parse_dsum t p f g) h input pos /\
Known? (dsum_tag_of_data t (contents (parse_dsum t p f g) h input pos))
))
(ensures (
valid (parse_maybe_enum_key p (dsum_enum t)) h input pos /\ (
let k' = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
let pos_payload = get_valid_pos (parse_maybe_enum_key p (dsum_enum t)) h input pos in
Known? k' /\ (
let Known k = k' in
valid (dsnd (f k)) h input pos_payload /\
valid_content_pos
(parse_dsum t p f g) h input pos
(synth_dsum_case t (Known k) (contents (dsnd (f k)) h input pos_payload))
(get_valid_pos (dsnd (f k)) h input pos_payload)
))))
=
valid_facts (parse_dsum t p f g) h input pos;
parse_dsum_eq t p f g (bytes_of_slice_from h input pos);
valid_facts (parse_maybe_enum_key p (dsum_enum t)) h input pos;
let Known k = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
let pos_payload = get_valid_pos (parse_maybe_enum_key p (dsum_enum t)) h input pos in
valid_facts (dsnd (f k)) h input pos_payload
#pop-options
let valid_dsum_elim_unknown
(h: HS.mem)
(t: dsum)
(#kt: parser_kind)
(p: parser kt (dsum_repr_type t))
(f: ((x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x))))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: Lemma
(requires (
valid (parse_dsum t p f g) h input pos /\
Unknown? (dsum_tag_of_data t (contents (parse_dsum t p f g) h input pos))
))
(ensures (
valid (parse_maybe_enum_key p (dsum_enum t)) h input pos /\ (
let k' = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
let pos_payload = get_valid_pos (parse_maybe_enum_key p (dsum_enum t)) h input pos in
Unknown? k' /\ (
let Unknown r = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
valid g h input pos_payload /\
valid_content_pos
(parse_dsum t p f g) h input pos
(synth_dsum_case t (Unknown r) (contents g h input pos_payload))
(get_valid_pos g h input pos_payload)
))))
=
valid_facts (parse_dsum t p f g) h input pos;
parse_dsum_eq t p f g (bytes_of_slice_from h input pos);
valid_facts (parse_maybe_enum_key p (dsum_enum t)) h input pos;
let Unknown r = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
let pos_payload = get_valid_pos (parse_maybe_enum_key p (dsum_enum t)) h input pos in
valid_facts g h input pos_payload
inline_for_extraction
let jump_dsum_cases_t
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(#k: parser_kind)
(g: parser k (dsum_type_of_unknown_tag s))
(x: dsum_key s)
: Tot Type
= jumper (parse_dsum_cases' s f g x)
let jump_dsum_cases_eq
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(#k: parser_kind)
(g: parser k (dsum_type_of_unknown_tag s))
(x: dsum_key s)
(v1 v2 : jump_dsum_cases_t s f g x)
: GTot Type0
= True
inline_for_extraction
let jump_dsum_cases_if'
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(#k: parser_kind)
(g: parser k (dsum_type_of_unknown_tag s))
(x: dsum_key s)
(cond: bool)
(ift: (cond_true cond -> Tot (jump_dsum_cases_t s f g x)))
(iff: (cond_false cond -> Tot (jump_dsum_cases_t s f g x)))
: Tot (jump_dsum_cases_t s f g x)
= fun #rrel #rel input len ->
if cond
then (ift () <: jump_dsum_cases_t s f g x) input len
else (iff () <: jump_dsum_cases_t s f g x) input len
inline_for_extraction
let jump_dsum_cases_if
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(#k: parser_kind)
(g: parser k (dsum_type_of_unknown_tag s))
(x: dsum_key s)
: Tot (if_combinator _ (jump_dsum_cases_eq s f g x))
= jump_dsum_cases_if' s f g x
inline_for_extraction
let jump_dsum_cases'
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(f' : (x: dsum_known_key s) -> Tot (jumper (dsnd (f x))))
(#k: parser_kind)
(#g: parser k (dsum_type_of_unknown_tag s))
(g' : jumper g)
(x: dsum_key s)
: Tot (jump_dsum_cases_t s f g x)
= synth_dsum_case_injective s x;
match x with
| Known x' -> jump_synth (f' x') (synth_dsum_case s (Known x')) () <: jumper (parse_dsum_cases' s f g x)
| Unknown x' -> jump_synth g' (synth_dsum_case s (Unknown x')) () <: jumper (parse_dsum_cases' s f g x)
inline_for_extraction
let jump_dsum_cases'_destr
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(f' : (x: dsum_known_key s) -> Tot (jumper (dsnd (f x))))
(#k: parser_kind)
(#g: parser k (dsum_type_of_unknown_tag s))
(g' : jumper g)
(destr: dep_enum_destr _ (fun k -> jump_dsum_cases_t s f g (Known k)))
(x: dsum_key s)
: Tot (jump_dsum_cases_t s f g x)
= fun #rrel #rel input pos ->
match x with
| Known k ->
destr
_
(fun k -> jump_dsum_cases_if s f g (Known k))
(fun _ _ -> ())
(fun _ _ _ _ -> ())
(fun k -> jump_dsum_cases' s f f' g' (Known k))
k
input
pos
| Unknown r -> jump_dsum_cases' s f f' g' (Unknown r) input pos
inline_for_extraction
let jump_dsum_cases
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(f' : (x: dsum_known_key s) -> Tot (jumper (dsnd (f x))))
(#k: parser_kind)
(#g: parser k (dsum_type_of_unknown_tag s))
(g' : jumper g)
(destr: dep_enum_destr _ (fun k -> jump_dsum_cases_t s f g (Known k)))
(x: dsum_key s)
: Tot (jumper (parse_dsum_cases s f g x))
= fun #rrel #rel input pos ->
let h = HST.get () in
[@inline_let]
let _ =
valid_facts (parse_dsum_cases' s f g x) h input pos;
valid_facts (parse_dsum_cases s f g x) h input pos;
parse_dsum_cases_eq' s f g x (bytes_of_slice_from h input pos)
in
jump_dsum_cases'_destr s f f' g' destr x input pos
#push-options "--z3rlimit 16"
inline_for_extraction
let jump_dsum
(#kt: parser_kind)
(t: dsum)
(#p: parser kt (dsum_repr_type t))
(v: jumper p)
(p32: leaf_reader p)
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(f32: (x: dsum_known_key t) -> Tot (jumper (dsnd (f x))))
(#k': parser_kind)
(#g: parser k' (dsum_type_of_unknown_tag t))
(g32: jumper g)
(destr: dep_maybe_enum_destr_t (dsum_enum t) (jump_dsum_cases_t t f g))
: Tot (jumper (parse_dsum t p f g))
= fun #rrel #rel input pos ->
let h = HST.get () in
[@inline_let]
let _ = parse_dsum_eq' t p f g (bytes_of_slice_from h input pos) in
[@inline_let]
let _ = valid_facts (parse_dsum t p f g) h input pos in
[@inline_let]
let _ = valid_facts p h input pos in
let pos_after_tag = v input pos in
let tg = p32 input pos in
[@inline_let]
let _ = valid_facts (parse_dsum_cases' t f g (maybe_enum_key_of_repr (dsum_enum t) tg)) h input pos_after_tag in
destr (jump_dsum_cases_eq t f g) (jump_dsum_cases_if t f g) (fun _ _ -> ()) (fun _ _ _ _ -> ()) (jump_dsum_cases' t f f32 g32) tg input pos_after_tag
#pop-options
inline_for_extraction
let read_dsum_cases'
(t: dsum)
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(f32: (x: dsum_known_key t) -> Tot (leaf_reader (dsnd (f x))))
(#k': parser_kind)
(g: parser k' (dsum_type_of_unknown_tag t))
(g32: leaf_reader g)
(x: dsum_key t)
: Tot (leaf_reader (parse_dsum_cases' t f g x))
= fun #rrel #rel input pos ->
[@inline_let]
let _ = synth_dsum_case_injective t x in
match x with
| Known x' ->
read_synth'
(dsnd (f x'))
(synth_dsum_case t (Known x'))
(f32 x')
()
input
pos
| Unknown x' ->
read_synth'
g
(synth_dsum_case t (Unknown x'))
g32
()
input
pos
inline_for_extraction
let read_dsum_cases_t
(t: dsum)
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(#k': parser_kind)
(g: parser k' (dsum_type_of_unknown_tag t))
(k: dsum_known_key t)
: Tot Type
= leaf_reader (parse_dsum_cases' t f g (Known k))
let read_dsum_cases_t_eq
(t: dsum)
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(#k': parser_kind)
(g: parser k' (dsum_type_of_unknown_tag t))
(k: dsum_known_key t)
(x y : read_dsum_cases_t t f g k)
: GTot Type0
= True
inline_for_extraction
let read_dsum_cases_t_if
(t: dsum)
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(#k': parser_kind)
(g: parser k' (dsum_type_of_unknown_tag t))
(k: dsum_known_key t)
: Tot (if_combinator _ (read_dsum_cases_t_eq t f g k))
= fun cond (sv_true: cond_true cond -> Tot (read_dsum_cases_t t f g k)) (sv_false: cond_false cond -> Tot (read_dsum_cases_t t f g k)) #_ #_ input pos ->
if cond
then sv_true () input pos
else sv_false () input pos
inline_for_extraction
let read_dsum_cases
(t: dsum)
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(f32: (x: dsum_known_key t) -> Tot (leaf_reader (dsnd (f x))))
(#k': parser_kind)
(g: parser k' (dsum_type_of_unknown_tag t))
(g32: leaf_reader g)
(destr: dep_enum_destr _ (read_dsum_cases_t t f g))
(x: dsum_key t)
: Tot (leaf_reader (parse_dsum_cases' t f g x))
= fun #_ #_ input pos ->
match x with
| Known k ->
destr
_
(read_dsum_cases_t_if t f g)
(fun _ _ -> ())
(fun _ _ _ _ -> ())
(fun k -> read_dsum_cases' t f f32 g g32 (Known k))
k
input
pos
| Unknown r ->
read_dsum_cases' t f f32 g g32 (Unknown r) input pos
#push-options "--z3rlimit 16" | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"LowStar.Buffer.fst.checked",
"LowParse.Spec.Sum.fst.checked",
"LowParse.Low.Enum.fst.checked",
"FStar.UInt64.fsti.checked",
"FStar.UInt32.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Int.Cast.fst.checked",
"FStar.HyperStack.ST.fsti.checked",
"FStar.HyperStack.fst.checked",
"FStar.Classical.fsti.checked"
],
"interface_file": false,
"source_file": "LowParse.Low.Sum.fst"
} | [
{
"abbrev": true,
"full_module": "FStar.HyperStack",
"short_module": "HS"
},
{
"abbrev": true,
"full_module": "FStar.UInt64",
"short_module": "U64"
},
{
"abbrev": true,
"full_module": "FStar.Int.Cast",
"short_module": "Cast"
},
{
"abbrev": true,
"full_module": "LowStar.Buffer",
"short_module": "B"
},
{
"abbrev": true,
"full_module": "FStar.HyperStack.ST",
"short_module": "HST"
},
{
"abbrev": true,
"full_module": "FStar.UInt32",
"short_module": "U32"
},
{
"abbrev": false,
"full_module": "LowParse.Spec.Sum",
"short_module": null
},
{
"abbrev": false,
"full_module": "LowParse.Low.Enum",
"short_module": null
},
{
"abbrev": false,
"full_module": "LowParse.Low",
"short_module": null
},
{
"abbrev": false,
"full_module": "LowParse.Low",
"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",
"short_module": null
}
] | {
"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_elim_box": false,
"smtencoding_l_arith_repr": "boxwrap",
"smtencoding_nl_arith_repr": "boxwrap",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": true,
"z3cliopt": [],
"z3refresh": false,
"z3rlimit": 16,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | false |
t: LowParse.Spec.Sum.dsum ->
p32:
LowParse.Low.Base.leaf_reader (LowParse.Spec.Enum.parse_maybe_enum_key p
(LowParse.Spec.Sum.dsum_enum t)) ->
j: LowParse.Low.Base.jumper p ->
f:
(x: LowParse.Spec.Sum.dsum_known_key t
-> Prims.dtuple2 LowParse.Spec.Base.parser_kind
(fun k -> LowParse.Spec.Base.parser k (LowParse.Spec.Sum.dsum_type_of_known_tag t x))) ->
f32:
(x: LowParse.Spec.Sum.dsum_known_key t
-> LowParse.Low.Base.leaf_reader (FStar.Pervasives.dsnd (f x))) ->
g32: LowParse.Low.Base.leaf_reader g ->
destr:
LowParse.Spec.Enum.dep_enum_destr (LowParse.Spec.Sum.dsum_enum t)
(LowParse.Low.Sum.read_dsum_cases_t t f g)
-> LowParse.Low.Base.leaf_reader (LowParse.Spec.Sum.parse_dsum t p f g) | Prims.Tot | [
"total"
] | [] | [
"LowParse.Spec.Base.parser_kind",
"LowParse.Spec.Sum.dsum",
"LowParse.Spec.Base.parser",
"LowParse.Spec.Sum.dsum_repr_type",
"LowParse.Low.Base.leaf_reader",
"LowParse.Spec.Enum.maybe_enum_key",
"LowParse.Spec.Sum.dsum_key_type",
"LowParse.Spec.Sum.dsum_enum",
"LowParse.Spec.Enum.parse_maybe_enum_key",
"LowParse.Low.Base.jumper",
"LowParse.Spec.Sum.dsum_known_key",
"Prims.dtuple2",
"LowParse.Spec.Sum.dsum_type_of_known_tag",
"Prims.__proj__Mkdtuple2__item___1",
"FStar.Pervasives.dsnd",
"LowParse.Spec.Sum.dsum_type_of_unknown_tag",
"LowParse.Spec.Enum.dep_enum_destr",
"LowParse.Low.Sum.read_dsum_cases_t",
"LowParse.Slice.srel",
"LowParse.Bytes.byte",
"LowParse.Slice.slice",
"FStar.UInt32.t",
"LowParse.Low.Sum.read_dsum_cases",
"LowParse.Spec.Sum.dsum_cases",
"Prims.unit",
"LowParse.Low.Base.Spec.valid_facts",
"LowParse.Spec.Sum.parse_dsum_cases_kind",
"LowParse.Spec.Sum.parse_dsum_cases'",
"LowParse.Spec.Sum.dsum_type",
"LowParse.Low.Enum.jump_maybe_enum_key",
"LowParse.Spec.Sum.parse_dsum_eq_",
"LowParse.Slice.bytes_of_slice_from",
"LowParse.Spec.Sum.parse_dsum_kind",
"LowParse.Spec.Sum.parse_dsum",
"FStar.Monotonic.HyperStack.mem",
"FStar.HyperStack.ST.get"
] | [] | false | false | false | false | false | let read_dsum
(#kt: parser_kind)
(t: dsum)
(#p: parser kt (dsum_repr_type t))
(p32: leaf_reader (parse_maybe_enum_key p (dsum_enum t)))
(j: jumper p)
(f: (x: dsum_known_key t -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x))))
(f32: (x: dsum_known_key t -> Tot (leaf_reader (dsnd (f x)))))
(#k': parser_kind)
(#g: parser k' (dsum_type_of_unknown_tag t))
(g32: leaf_reader g)
(destr: dep_enum_destr _ (read_dsum_cases_t t f g))
: Tot (leaf_reader (parse_dsum t p f g)) =
| fun #_ #_ input pos ->
let h = HST.get () in
valid_facts (parse_dsum t p f g) h input pos;
parse_dsum_eq_ t p f g (bytes_of_slice_from h input pos);
valid_facts (parse_maybe_enum_key p (dsum_enum t)) h input pos;
let k = p32 input pos in
let pos' = jump_maybe_enum_key j (dsum_enum t) input pos in
valid_facts (parse_dsum_cases' t f g k) h input pos';
read_dsum_cases t f f32 g g32 destr k input pos' | false |
SimplePrintfReify.fst | SimplePrintfReify.arg_type | val arg_type (a: arg) : Tot Type0 | val arg_type (a: arg) : Tot Type0 | let arg_type (a:arg) : Tot Type0 =
match a with
| Bool -> bool
| Int -> int
| Char -> char
| String -> string | {
"file_name": "examples/printf/SimplePrintfReify.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 20,
"end_line": 90,
"start_col": 0,
"start_line": 85
} | (*
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 agreed to in writing, software
distributed under the License is distributed on an "AS IS" BASIS,
WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
See the License for the specific language governing permissions and
limitations under the License.
*)
module SimplePrintfReify
open FStar.Char
open FStar.String
module List = FStar.List.Tot
// A variant of SimplePrintf that uses reify on the Ex implementation
// of parse_format
// For a start here's an alpha renamed version of Ex to avoid clashes
// with the prims variant of Ex (which is not defined using dm4free
// and is not marked as `total`)
(* The underlying representation type *)
let ex (a:Type) = unit -> M (option a)
(* Monad definition *)
val return_ex : (a:Type) -> (x:a) -> Tot (ex a)
let return_ex a x = fun _ -> Some x
val bind_ex : (a:Type) -> (b:Type) -> (f:ex a) -> (g:a -> Tot (ex b)) -> Tot (ex b)
let bind_ex a b f g = fun _ ->
let r = f () in
match r with
| None -> None
| Some x -> g x ()
(* DMFF does not support yet polymorphic actions *)
(* Returning something in [False] allow to derive the usual raise below *)
let raise_ex (_:exn) : Tot (ex False) = fun _ -> None
(* Define the new effect using DM4F *)
total reifiable reflectable new_effect {
XEXN : (a:Type) -> Effect
with repr = ex
; bind = bind_ex
; return = return_ex
; raise = raise_ex
}
(* A lift from `Pure´ into the new effect *)
(* unfold let lift_pure_ex_wp (a:Type) (wp:pure_wp a) (_:unit) (p:XEXN?.post a) = *)
(* wp (fun a -> p (Some a)) *)
(* sub_effect PURE ~> XEXN = lift_pure_ex_wp *)
reifiable
let raise (#a:Type0) (e:exn) : XEXN a (fun _ p -> p None)
= let x = XEXN?.raise e in begin match x with end
(* An effect to alias easily write pre- and postconditions *)
(* Note: we use Type0 instead of XEXN.pre to avoid having to thunk everything. *)
effect Xexn (a:Type) (pre:Type0) (post:XEXN?.post a) =
XEXN a (fun (_:unit) (p:XEXN?.post a) -> pre /\
(forall (r:option a). (pre /\ post r) ==> p r))
(* Another alias. Ex a is the effect type for total exception-throwing
* programs. i.e. Any program of type `Ex a´ will throw or finish
* correctly, but never loop. *)
effect Xex (a:Type) = XEXN a (fun _ p -> forall (x:option a). p x)
// arguments to printf
type arg =
| Bool | Int | Char | String
// directives to printf
type dir =
| Lit : char -> dir
| Arg : arg -> dir | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.String.fsti.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.fst.checked",
"FStar.Char.fsti.checked"
],
"interface_file": false,
"source_file": "SimplePrintfReify.fst"
} | [
{
"abbrev": true,
"full_module": "FStar.List.Tot",
"short_module": "List"
},
{
"abbrev": false,
"full_module": "FStar.String",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Char",
"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",
"short_module": null
}
] | {
"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_elim_box": false,
"smtencoding_l_arith_repr": "boxwrap",
"smtencoding_nl_arith_repr": "boxwrap",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": true,
"z3cliopt": [],
"z3refresh": false,
"z3rlimit": 5,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | false | a: SimplePrintfReify.arg -> Type0 | Prims.Tot | [
"total"
] | [] | [
"SimplePrintfReify.arg",
"Prims.bool",
"Prims.int",
"FStar.String.char",
"Prims.string"
] | [] | false | false | false | true | true | let arg_type (a: arg) : Tot Type0 =
| match a with
| Bool -> bool
| Int -> int
| Char -> char
| String -> string | false |
SimplePrintfReify.fst | SimplePrintfReify.parse_format_string | val parse_format_string (s: string) : Tot (option (list dir)) | val parse_format_string (s: string) : Tot (option (list dir)) | let rec parse_format_string (s:string) : Tot (option (list dir)) =
parse_format_pure (list_of_string s) | {
"file_name": "examples/printf/SimplePrintfReify.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 38,
"end_line": 141,
"start_col": 0,
"start_line": 140
} | (*
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 agreed to in writing, software
distributed under the License is distributed on an "AS IS" BASIS,
WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
See the License for the specific language governing permissions and
limitations under the License.
*)
module SimplePrintfReify
open FStar.Char
open FStar.String
module List = FStar.List.Tot
// A variant of SimplePrintf that uses reify on the Ex implementation
// of parse_format
// For a start here's an alpha renamed version of Ex to avoid clashes
// with the prims variant of Ex (which is not defined using dm4free
// and is not marked as `total`)
(* The underlying representation type *)
let ex (a:Type) = unit -> M (option a)
(* Monad definition *)
val return_ex : (a:Type) -> (x:a) -> Tot (ex a)
let return_ex a x = fun _ -> Some x
val bind_ex : (a:Type) -> (b:Type) -> (f:ex a) -> (g:a -> Tot (ex b)) -> Tot (ex b)
let bind_ex a b f g = fun _ ->
let r = f () in
match r with
| None -> None
| Some x -> g x ()
(* DMFF does not support yet polymorphic actions *)
(* Returning something in [False] allow to derive the usual raise below *)
let raise_ex (_:exn) : Tot (ex False) = fun _ -> None
(* Define the new effect using DM4F *)
total reifiable reflectable new_effect {
XEXN : (a:Type) -> Effect
with repr = ex
; bind = bind_ex
; return = return_ex
; raise = raise_ex
}
(* A lift from `Pure´ into the new effect *)
(* unfold let lift_pure_ex_wp (a:Type) (wp:pure_wp a) (_:unit) (p:XEXN?.post a) = *)
(* wp (fun a -> p (Some a)) *)
(* sub_effect PURE ~> XEXN = lift_pure_ex_wp *)
reifiable
let raise (#a:Type0) (e:exn) : XEXN a (fun _ p -> p None)
= let x = XEXN?.raise e in begin match x with end
(* An effect to alias easily write pre- and postconditions *)
(* Note: we use Type0 instead of XEXN.pre to avoid having to thunk everything. *)
effect Xexn (a:Type) (pre:Type0) (post:XEXN?.post a) =
XEXN a (fun (_:unit) (p:XEXN?.post a) -> pre /\
(forall (r:option a). (pre /\ post r) ==> p r))
(* Another alias. Ex a is the effect type for total exception-throwing
* programs. i.e. Any program of type `Ex a´ will throw or finish
* correctly, but never loop. *)
effect Xex (a:Type) = XEXN a (fun _ p -> forall (x:option a). p x)
// arguments to printf
type arg =
| Bool | Int | Char | String
// directives to printf
type dir =
| Lit : char -> dir
| Arg : arg -> dir
let arg_type (a:arg) : Tot Type0 =
match a with
| Bool -> bool
| Int -> int
| Char -> char
| String -> string
let rec dir_type (ds:list dir) : Tot Type0 =
match ds with
| [] -> string
| Lit c :: ds' -> dir_type ds'
| Arg a :: ds' -> arg_type a -> Tot (dir_type ds')
let dir_type' ds = dir_type ds
let rec string_of_dirs ds (k:string -> Tot string) : Tot (dir_type ds) =
match ds with
| [] -> k ""
| Lit c :: ds' ->
coerce_eq () (
string_of_dirs ds' (fun res -> k (string_of_char c ^ res))
)
| Arg a :: ds' -> fun (x : arg_type a) ->
string_of_dirs ds' (fun res -> k (match a with
| Bool -> string_of_bool x
| Int -> string_of_int x
| Char -> string_of_char x
| String -> x) ^ res)
let example1 : string =
string_of_dirs [Arg Int; Arg String] (fun s -> s) 42 " answer"
exception InvalidFormatString
(* TODO: can we get rid of the two `let x` or are they really required? *)
reifiable let rec parse_format (s:list char) : Xex (list dir) =
match s with
| [] -> []
| '%' :: c :: s' ->
let d =
match c with
| '%' -> Lit '%'
| 'b' -> Arg Bool
| 'd' -> Arg Int
| 'c' -> Arg Char
| 's' -> Arg String
| _ -> raise InvalidFormatString
in let x = parse_format s' in d :: x
| '%' :: [] -> raise InvalidFormatString
| c :: s' -> let x = parse_format s' in Lit c :: x
let parse_format_pure (s:list char) : option (list dir) =
reify (parse_format s) () | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.String.fsti.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.fst.checked",
"FStar.Char.fsti.checked"
],
"interface_file": false,
"source_file": "SimplePrintfReify.fst"
} | [
{
"abbrev": true,
"full_module": "FStar.List.Tot",
"short_module": "List"
},
{
"abbrev": false,
"full_module": "FStar.String",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Char",
"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",
"short_module": null
}
] | {
"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_elim_box": false,
"smtencoding_l_arith_repr": "boxwrap",
"smtencoding_nl_arith_repr": "boxwrap",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": true,
"z3cliopt": [],
"z3refresh": false,
"z3rlimit": 5,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | false | s: Prims.string -> FStar.Pervasives.Native.option (Prims.list SimplePrintfReify.dir) | Prims.Tot | [
"total"
] | [] | [
"Prims.string",
"SimplePrintfReify.parse_format_pure",
"FStar.String.list_of_string",
"FStar.Pervasives.Native.option",
"Prims.list",
"SimplePrintfReify.dir"
] | [
"recursion"
] | false | false | false | true | false | let rec parse_format_string (s: string) : Tot (option (list dir)) =
| parse_format_pure (list_of_string s) | false |
LowParse.Low.Sum.fst | LowParse.Low.Sum.gaccessor_clens_dsum_payload | val gaccessor_clens_dsum_payload
(#kt: parser_kind)
(t: dsum)
(p: parser kt (dsum_repr_type t))
(f: (x: dsum_known_key t -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x))))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
(k: dsum_key t)
: Tot
(gaccessor (parse_dsum t p f g) (parse_dsum_type_of_tag' t f g k) (clens_dsum_payload t k)) | val gaccessor_clens_dsum_payload
(#kt: parser_kind)
(t: dsum)
(p: parser kt (dsum_repr_type t))
(f: (x: dsum_known_key t -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x))))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
(k: dsum_key t)
: Tot
(gaccessor (parse_dsum t p f g) (parse_dsum_type_of_tag' t f g k) (clens_dsum_payload t k)) | let gaccessor_clens_dsum_payload
(#kt: parser_kind)
(t: dsum)
(p: parser kt (dsum_repr_type t))
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
(k: dsum_key t)
: Tot (gaccessor (parse_dsum t p f g) (parse_dsum_type_of_tag' t f g k) (clens_dsum_payload t k))
= Classical.forall_intro_2 (fun x -> Classical.move_requires (gaccessor_clens_dsum_payload_injective t p f g k x));
Classical.forall_intro_2 (fun x -> Classical.move_requires (gaccessor_clens_dsum_payload_no_lookahead t p f g k x));
gaccessor_prop_equiv (parse_dsum t p f g) (parse_dsum_type_of_tag' t f g k) (clens_dsum_payload t k) (gaccessor_clens_dsum_payload' t p f g k);
gaccessor_clens_dsum_payload' t p f g k | {
"file_name": "src/lowparse/LowParse.Low.Sum.fst",
"git_rev": "00217c4a89f5ba56002ba9aa5b4a9d5903bfe9fa",
"git_url": "https://github.com/project-everest/everparse.git",
"project_name": "everparse"
} | {
"end_col": 41,
"end_line": 1901,
"start_col": 0,
"start_line": 1889
} | module LowParse.Low.Sum
include LowParse.Low.Enum
include LowParse.Spec.Sum
module U32 = FStar.UInt32
module HST = FStar.HyperStack.ST
module B = LowStar.Buffer
module Cast = FStar.Int.Cast
module U64 = FStar.UInt64
inline_for_extraction
let validate_sum_cases_aux
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(vc: ((x: sum_key t) -> Tot (validator (dsnd (pc x)))))
(k: sum_key t)
: Tot (validator (parse_sum_cases t pc k))
= [@inline_let]
let _ = synth_sum_case_injective t k in
validate_synth
(validate_weaken
(weaken_parse_cases_kind t pc)
(vc k)
()
)
(synth_sum_case t k)
()
inline_for_extraction
let validate_sum_cases_t
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot Type
= validator (parse_sum_cases t pc k)
let validate_sum_cases_t_eq
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
(x y : validate_sum_cases_t t pc k)
: GTot Type0
= True
inline_for_extraction
let validate_sum_cases_t_if
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (if_combinator _ (validate_sum_cases_t_eq t pc k))
= fun cond (sv_true: cond_true cond -> Tot (validate_sum_cases_t t pc k)) (sv_false: cond_false cond -> Tot (validate_sum_cases_t t pc k)) #rrel #rel input pos ->
if cond
then sv_true () input pos
else sv_false () input pos
inline_for_extraction
let validate_sum_cases
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(vc: ((x: sum_key t) -> Tot (validator (dsnd (pc x)))))
(destr: dep_enum_destr (sum_enum t) (validate_sum_cases_t t pc))
(k: sum_key t)
: Tot (validator (parse_sum_cases t pc k))
= destr
_
(validate_sum_cases_t_if t pc)
(fun _ _ -> ())
(fun _ _ _ _ -> ())
(validate_sum_cases_aux t pc vc)
k
inline_for_extraction
let validate_sum_aux_payload_t
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
: Tot Type
= (#rrel: _) -> (#rel: _) ->
(input: slice rrel rel) ->
(pos: U64.t) ->
HST.Stack U64.t
(requires (fun h -> live_slice h input /\ U64.v pos <= U32.v input.len))
(ensures (fun h res h' ->
B.modifies B.loc_none h h' /\ (
match k with
| Unknown _ -> is_error res
| Known k' ->
if is_success res
then
valid_pos (dsnd (pc k')) h input (uint64_to_uint32 pos) (uint64_to_uint32 res)
else
(~ (valid (dsnd (pc k')) h input (uint64_to_uint32 pos)))
)))
let validate_sum_aux_payload_eq
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
: Tot (validate_sum_aux_payload_t t pc k -> validate_sum_aux_payload_t t pc k -> GTot Type0)
= fun _ _ -> True
inline_for_extraction
let validate_sum_aux_payload_if'
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
(cond: bool)
(ift: ((cond_true cond) -> Tot (validate_sum_aux_payload_t t pc k)))
(iff: ((cond_false cond) -> Tot (validate_sum_aux_payload_t t pc k)))
: Tot (validate_sum_aux_payload_t t pc k)
= fun #rrel #rel input pos ->
if cond
then begin
(ift () <: validate_sum_aux_payload_t t pc k) input pos
end else
(iff () <: validate_sum_aux_payload_t t pc k) input pos
inline_for_extraction
let validate_sum_aux_payload_if
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
: Tot (if_combinator _ (validate_sum_aux_payload_eq t pc k))
= validate_sum_aux_payload_if' t pc k
#push-options "--z3rlimit 64 --z3cliopt smt.arith.nl=false --using_facts_from '* -FStar.Int.Cast -LowParse.BitFields'"
// --query_stats --smtencoding.elim_box true --smtencoding.l_arith_repr native --z3refresh"
inline_for_extraction
let validate_sum_aux
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(v: validator p)
(p32: leaf_reader p)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(v_payload: ((k: sum_repr_type t)) -> Tot (validate_sum_aux_payload_t t pc (maybe_enum_key_of_repr (sum_enum t) k)))
: Tot (validator (parse_sum t p pc))
= fun #rrel #rel input pos ->
let h = HST.get () in
[@inline_let]
let _ = parse_sum_eq'' t p pc (bytes_of_slice_from h input (uint64_to_uint32 pos)) in
[@inline_let]
let _ = valid_facts (parse_sum t p pc) h input (uint64_to_uint32 pos) in
[@inline_let]
let _ = valid_facts p h input (uint64_to_uint32 pos) in
let len_after_tag = v input pos in
if is_error len_after_tag
then len_after_tag
else begin
let h1 = HST.get () in
let k' = p32 input (uint64_to_uint32 pos) in
[@inline_let]
let _ =
match maybe_enum_key_of_repr (sum_enum t) k' with
| Known k -> valid_facts (dsnd (pc k)) h input (uint64_to_uint32 len_after_tag)
| _ -> ()
in
v_payload k' input len_after_tag
end
#pop-options
inline_for_extraction
let validate_sum_aux_payload'
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (validator (dsnd (pc x)))))
(k: maybe_enum_key (sum_enum t))
: Tot (validate_sum_aux_payload_t t pc k)
= fun #rrel #rel input pos ->
match k with
| Known k ->
[@inline_let]
let _ = synth_sum_case_injective t k in
pc32 k input pos
// validate_synth (pc32 k) (synth_sum_case t k) () input pos
| _ -> validator_error_generic
inline_for_extraction
let validate_sum_aux_payload
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (validator (dsnd (pc x)))))
(destr: dep_maybe_enum_destr_t (sum_enum t) (validate_sum_aux_payload_t t pc))
(k: sum_repr_type t)
: Tot (validate_sum_aux_payload_t t pc (maybe_enum_key_of_repr (sum_enum t) k))
= destr (validate_sum_aux_payload_eq t pc) (validate_sum_aux_payload_if t pc) (fun _ _ -> ()) (fun _ _ _ _ -> ()) (validate_sum_aux_payload' t pc pc32) k
inline_for_extraction
let validate_sum
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(v: validator p)
(p32: leaf_reader p)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (validator (dsnd (pc x)))))
(destr: dep_maybe_enum_destr_t (sum_enum t) (validate_sum_aux_payload_t t pc))
: Tot (validator (parse_sum t p pc))
= validate_sum_aux t v p32 pc (validate_sum_aux_payload t pc pc32 destr)
module HS = FStar.HyperStack
#push-options "--z3rlimit 256 --z3cliopt smt.arith.nl=false --initial_ifuel 8 --max_ifuel 8 --initial_fuel 2 --max_fuel 2"
#restart-solver
let valid_sum_intro
(h: HS.mem)
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: Lemma
(requires (
valid (parse_enum_key p (sum_enum t)) h input pos /\ (
let k = contents (parse_enum_key p (sum_enum t)) h input pos in
valid (dsnd (pc k)) h input (get_valid_pos (parse_enum_key p (sum_enum t)) h input pos)
)))
(ensures (
let k = contents (parse_enum_key p (sum_enum t)) h input pos in
let pos_payload = get_valid_pos (parse_enum_key p (sum_enum t)) h input pos in
valid_content_pos
(parse_sum t p pc) h input pos
(synth_sum_case t k (contents (dsnd (pc k)) h input pos_payload))
(get_valid_pos (dsnd (pc k)) h input pos_payload)
))
= valid_facts (parse_enum_key p (sum_enum t)) h input pos;
let k = contents (parse_enum_key p (sum_enum t)) h input pos in
let pos_payload = get_valid_pos (parse_enum_key p (sum_enum t)) h input pos in
valid_facts (dsnd (pc k)) h input pos_payload;
valid_facts (parse_sum t p pc) h input pos;
parse_sum_eq t p pc (bytes_of_slice_from h input pos)
#pop-options
inline_for_extraction
let finalize_sum_case
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(s: serializer p)
(w: leaf_writer_strong s)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(destr: enum_repr_of_key'_t (sum_enum t))
(k: sum_key t)
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: HST.Stack unit
(requires (fun h ->
let len_tag = serialized_length (serialize_enum_key _ s (sum_enum t)) k in
U32.v pos + len_tag < 4294967296 /\ (
let pos_payload = pos `U32.add` U32.uint_to_t len_tag in
valid (dsnd (pc k)) h input pos_payload /\
writable input.base (U32.v pos) (U32.v pos_payload) h
)))
(ensures (fun h _ h' ->
let len_tag = serialized_length (serialize_enum_key _ s (sum_enum t)) k in
let pos_payload = pos `U32.add` U32.uint_to_t len_tag in
B.modifies (loc_slice_from_to input pos pos_payload) h h' /\
valid_content_pos (parse_sum t p pc) h' input pos (synth_sum_case t k (contents (dsnd (pc k)) h input pos_payload)) (get_valid_pos (dsnd (pc k)) h input pos_payload)
))
= let pos1 = write_enum_key w (sum_enum t) destr k input pos in
let h = HST.get () in
[@inline_let]
let _ = valid_sum_intro h t p pc input pos in
()
inline_for_extraction
let jump_sum_cases_aux
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(vc: ((x: sum_key t) -> Tot (jumper (dsnd (pc x)))))
(k: sum_key t)
: Tot (jumper (parse_sum_cases t pc k))
= [@inline_let]
let _ = synth_sum_case_injective t k in
jump_synth
(jump_weaken
(weaken_parse_cases_kind t pc)
(vc k)
()
)
(synth_sum_case t k)
()
inline_for_extraction
let jump_sum_cases_t
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot Type
= jumper (parse_sum_cases t pc k)
let jump_sum_cases_t_eq
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
(x y : jump_sum_cases_t t pc k)
: GTot Type0
= True
inline_for_extraction
let jump_sum_cases_t_if
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (if_combinator _ (jump_sum_cases_t_eq t pc k))
= fun cond (sv_true: cond_true cond -> Tot (jump_sum_cases_t t pc k)) (sv_false: cond_false cond -> Tot (jump_sum_cases_t t pc k)) #rrel #rel input pos ->
if cond
then sv_true () input pos
else sv_false () input pos
inline_for_extraction
let jump_sum_cases
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(vc: ((x: sum_key t) -> Tot (jumper (dsnd (pc x)))))
(destr: dep_enum_destr (sum_enum t) (jump_sum_cases_t t pc))
(k: sum_key t)
: Tot (jumper (parse_sum_cases t pc k))
= destr
_
(jump_sum_cases_t_if t pc)
(fun _ _ -> ())
(fun _ _ _ _ -> ())
(jump_sum_cases_aux t pc vc)
k
inline_for_extraction
let jump_sum_aux_payload_t
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
: Tot Type
= (#rrel: _) -> (#rel: _) ->
(input: slice rrel rel) ->
(pos: U32.t) ->
HST.Stack U32.t
(requires (fun h -> live_slice h input /\ U32.v pos <= U32.v input.len /\ (
match k with
| Unknown _ -> False
| Known k' -> valid (dsnd (pc k')) h input pos
)))
(ensures (fun h res h' ->
B.modifies B.loc_none h h' /\ (
match k with
| Unknown _ -> False
| Known k' ->
valid_pos (dsnd (pc k')) h input pos res
)))
let jump_sum_aux_payload_eq
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
: Tot (jump_sum_aux_payload_t t pc k -> jump_sum_aux_payload_t t pc k -> GTot Type0)
= fun _ _ -> True
inline_for_extraction
let jump_sum_aux_payload_if'
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
(cond: bool)
(ift: ((cond_true cond) -> Tot (jump_sum_aux_payload_t t pc k)))
(iff: ((cond_false cond) -> Tot (jump_sum_aux_payload_t t pc k)))
: Tot (jump_sum_aux_payload_t t pc k)
= fun #rrel #rel input pos ->
if cond
then begin
(ift () <: jump_sum_aux_payload_t t pc k) input pos
end else
(iff () <: jump_sum_aux_payload_t t pc k) input pos
inline_for_extraction
let jump_sum_aux_payload_if
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
: Tot (if_combinator _ (jump_sum_aux_payload_eq t pc k))
= jump_sum_aux_payload_if' t pc k
let parse_sum_eq3
(#kt: parser_kind)
(t: sum)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(input: bytes)
(k' : sum_repr_type t)
(consumed_k: consumed_length input)
: Lemma
(requires (Some? (parse (parse_sum t p pc) input) /\ parse p input == Some (k', consumed_k)))
(ensures (
let input_k = Seq.slice input consumed_k (Seq.length input) in
let k = maybe_enum_key_of_repr (sum_enum t) k' in
begin match k with
| Known k ->
Some? (parse (dsnd (pc k)) input_k)
| _ -> False
end
))
= parse_sum_eq'' t p pc input
let parse_sum_eq4
(#kt: parser_kind)
(t: sum)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(input: bytes)
(k' : sum_repr_type t)
(consumed_k: consumed_length input)
(consumed_payload: nat)
: Lemma
(requires (Some? (parse (parse_sum t p pc) input) /\ parse p input == Some (k', consumed_k) /\ (
let input_k = Seq.slice input consumed_k (Seq.length input) in
let k = maybe_enum_key_of_repr (sum_enum t) k' in
begin match k with
| Known k ->
Some? (parse (dsnd (pc k)) input_k) /\ (
let Some (_, consumed_payload') = parse (dsnd (pc k)) input_k in
consumed_payload' == consumed_payload
)
| _ -> False
end
)))
(ensures (
let Some (_, consumed) = parse (parse_sum t p pc) input in
consumed == consumed_k + consumed_payload
))
= parse_sum_eq'' t p pc input
#push-options "--z3rlimit 16"
let valid_sum_elim
(h: HS.mem)
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(#rrel: _) (#rel: _)
(input: slice rrel rel)
(pos: U32.t)
: Lemma
(requires (
valid (parse_sum t p pc) h input pos
))
(ensures (
valid p h input pos /\ (
let pos_payload = get_valid_pos p h input pos in
let k' = maybe_enum_key_of_repr (sum_enum t) (contents p h input pos) in
match k' with
| Known k ->
k == sum_tag_of_data t (contents (parse_sum t p pc) h input pos) /\
valid (dsnd (pc k)) h input pos_payload /\
valid_pos
(parse_sum t p pc) h input pos
(get_valid_pos (dsnd (pc k)) h input pos_payload)
| _ -> False
)))
= let sinput = bytes_of_slice_from h input pos in
let _ = parse_sum_eq'' t p pc sinput in
[@inline_let]
let _ = valid_facts (parse_sum t p pc) h input pos in
let Some (k', consumed_k) = parse p sinput in
let pos_after_tag = U32.uint_to_t (U32.v pos + consumed_k) in
[@inline_let]
let _ = valid_facts p h input pos in
assert (valid_content_pos p h input pos k' pos_after_tag);
match maybe_enum_key_of_repr (sum_enum t) k' with
| Known k -> valid_facts (dsnd (pc k)) h input pos_after_tag
| _ -> ()
#pop-options
let valid_sum_elim_tag
(h: HS.mem)
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: Lemma
(requires (
valid (parse_sum t p pc) h input pos
))
(ensures (
valid (parse_enum_key p (sum_enum t)) h input pos /\
contents (parse_enum_key p (sum_enum t)) h input pos == sum_tag_of_data t (contents (parse_sum t p pc) h input pos)
))
= let _ = parse_sum_eq' t p pc (bytes_of_slice_from h input pos) in
let _ = valid_facts (parse_sum t p pc) h input pos in
let _ = valid_facts (parse_enum_key p (sum_enum t)) h input pos in
()
inline_for_extraction
let read_sum_tag
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(p32: leaf_reader p)
(destr: dep_maybe_enum_destr_t (sum_enum t) (read_enum_key_t (sum_enum t)))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: HST.Stack (sum_key t)
(requires (fun h ->
valid (parse_sum t p pc) h input pos
))
(ensures (fun h res h' ->
B.modifies B.loc_none h h' /\
res == sum_tag_of_data t (contents (parse_sum t p pc) h input pos)
))
= let h = HST.get () in
[@inline_let] let _ = valid_sum_elim_tag h t p pc input pos in
read_enum_key p32 (sum_enum t) destr input pos
inline_for_extraction
let jump_sum_aux
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(v: jumper p)
(p32: leaf_reader p)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(v_payload: ((k: sum_repr_type t)) -> Tot (jump_sum_aux_payload_t t pc (maybe_enum_key_of_repr (sum_enum t) k)))
: Tot (jumper (parse_sum t p pc))
= fun #rrel #rel input pos ->
let h = HST.get () in
[@inline_let]
let _ = valid_sum_elim h t p pc input pos in
let pos_after_tag = v input pos in
let k' = p32 input pos in
v_payload k' input pos_after_tag
inline_for_extraction
let jump_sum_aux_payload'
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (jumper (dsnd (pc x)))))
(k: maybe_enum_key (sum_enum t))
: Tot (jump_sum_aux_payload_t t pc k)
= fun #rrel #rel input pos ->
match k with
| Known k ->
[@inline_let]
let _ = synth_sum_case_injective t k in
pc32 k input pos
| _ -> 0ul // dummy, but we MUST NOT remove this branch, otherwise extraction fails
inline_for_extraction
let jump_sum_aux_payload
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (jumper (dsnd (pc x)))))
(destr: dep_maybe_enum_destr_t (sum_enum t) (jump_sum_aux_payload_t t pc))
(k: sum_repr_type t)
: Tot (jump_sum_aux_payload_t t pc (maybe_enum_key_of_repr (sum_enum t) k))
= destr (jump_sum_aux_payload_eq t pc) (jump_sum_aux_payload_if t pc) (fun _ _ -> ()) (fun _ _ _ _ -> ()) (jump_sum_aux_payload' t pc pc32) k
inline_for_extraction
let jump_sum
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(v: jumper p)
(p32: leaf_reader p)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (jumper (dsnd (pc x)))))
(destr: dep_maybe_enum_destr_t (sum_enum t) (jump_sum_aux_payload_t t pc))
: Tot (jumper (parse_sum t p pc))
= jump_sum_aux t v p32 pc (jump_sum_aux_payload t pc pc32 destr)
inline_for_extraction
let read_sum_cases'
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (leaf_reader (dsnd (pc x)))))
(k: sum_key t)
: Tot (leaf_reader (parse_sum_cases' t pc k))
= [@inline_let]
let _ = synth_sum_case_injective t k in
read_synth'
(dsnd (pc k))
(synth_sum_case t k)
(pc32 k)
()
inline_for_extraction
let read_sum_cases_t
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot Type
= leaf_reader (parse_sum_cases' t pc k)
let read_sum_cases_t_eq
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
(x y : read_sum_cases_t t pc k)
: GTot Type0
= True
inline_for_extraction
let read_sum_cases_t_if
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (if_combinator _ (read_sum_cases_t_eq t pc k))
= fun cond (sv_true: cond_true cond -> Tot (read_sum_cases_t t pc k)) (sv_false: cond_false cond -> Tot (read_sum_cases_t t pc k)) #_ #_ input pos ->
if cond
then (sv_true () input pos)
else (sv_false () input pos)
inline_for_extraction
let read_sum_cases
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (leaf_reader (dsnd (pc x)))))
(destr: dep_enum_destr (sum_enum t) (read_sum_cases_t t pc))
(k: sum_key t)
: Tot (leaf_reader (parse_sum_cases' t pc k))
= destr
_
(read_sum_cases_t_if t pc)
(fun _ _ -> ())
(fun _ _ _ _ -> ())
(read_sum_cases' t pc pc32)
k
#push-options "--z3rlimit 32"
inline_for_extraction
let read_sum
(#kt: parser_kind)
(t: sum)
(p: parser kt (sum_repr_type t))
(p32: leaf_reader (parse_enum_key p (sum_enum t)))
(j: jumper p)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (leaf_reader (dsnd (pc x)))))
(destr: dep_enum_destr (sum_enum t) (read_sum_cases_t t pc))
: Tot (leaf_reader (parse_sum t p pc))
=
fun #_ #_ input pos ->
let h = HST.get () in
valid_facts (parse_sum t p pc) h input pos;
parse_sum_eq' t p pc (bytes_of_slice_from h input pos);
valid_facts (parse_enum_key p (sum_enum t)) h input pos;
let k = p32 input pos in
let pos' = jump_enum_key j (sum_enum t) input pos in
valid_facts (parse_sum_cases' t pc k) h input pos' ;
read_sum_cases t pc pc32 destr k input pos'
#pop-options
inline_for_extraction
let serialize32_sum_cases_t
(t: sum)
(#pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(sc: ((x: sum_key t) -> Tot (serializer (dsnd (pc x)))))
(k: sum_key t)
: Tot Type
= serializer32 (serialize_sum_cases t pc sc k)
let serialize32_sum_cases_t_eq
(t: sum)
(#pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(sc: ((x: sum_key t) -> Tot (serializer (dsnd (pc x)))))
(k: sum_key t)
(x y: serialize32_sum_cases_t t sc k)
: GTot Type0
= True
inline_for_extraction
let serialize32_sum_cases_t_if
(t: sum)
(#pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(sc: ((x: sum_key t) -> Tot (serializer (dsnd (pc x)))))
(k: sum_key t)
: Tot (if_combinator _ (serialize32_sum_cases_t_eq t sc k))
= fun cond (sv_true: (cond_true cond -> Tot (serialize32_sum_cases_t t sc k))) (sv_false: (cond_false cond -> Tot (serialize32_sum_cases_t t sc k))) x #rrel #rel b pos ->
if cond
then (sv_true () x b pos)
else (sv_false () x b pos)
inline_for_extraction
let serialize32_sum_cases_aux
(t: sum)
(#pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(sc: ((x: sum_key t) -> Tot (serializer (dsnd (pc x)))))
(sc32: ((x: sum_key t) -> Tot (serializer32 (sc x))))
(k: sum_key t)
: Tot (serializer32 (serialize_sum_cases t pc sc k))
= fun x #rrel #rel b pos ->
[@inline_let] let _ =
Classical.forall_intro (parse_sum_cases_eq' t pc k);
synth_sum_case_injective t k;
synth_sum_case_inverse t k
in
serialize32_synth
(sc32 k)
(synth_sum_case t k)
(synth_sum_case_recip t k)
(fun x -> synth_sum_case_recip t k x)
()
x
b
pos
inline_for_extraction
let serialize32_sum_cases
(t: sum)
(#pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(sc: ((x: sum_key t) -> Tot (serializer (dsnd (pc x)))))
(sc32: ((x: sum_key t) -> Tot (serializer32 (sc x))))
(destr: dep_enum_destr (sum_enum t) (serialize32_sum_cases_t t sc))
(k: sum_key t)
: Tot (serializer32 (serialize_sum_cases t pc sc k))
= destr
_
(serialize32_sum_cases_t_if t sc)
(fun _ _ -> ())
(fun _ _ _ _ -> ())
(serialize32_sum_cases_aux t sc sc32)
k
inline_for_extraction
let serialize32_sum
(#kt: parser_kind)
(t: sum)
(#p: parser kt (sum_repr_type t))
(s: serializer p {kt.parser_kind_subkind == Some ParserStrong})
(s32: serializer32 (serialize_enum_key _ s (sum_enum t)))
(#pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(sc: ((x: sum_key t) -> Tot (serializer (dsnd (pc x)))))
(sc32: ((x: sum_key t) -> Tot (serializer32 (sc x))))
(destr: dep_enum_destr (sum_enum t) (serialize32_sum_cases_t t sc))
: Tot (serializer32 (serialize_sum t s sc))
= fun x #rrel #rel b pos ->
serialize_sum_eq t s sc x;
let tg = sum_tag_of_data t x in
serialize32_nondep_then_aux s32 (serialize32_sum_cases t sc sc32 destr tg) tg x b pos
let clens_sum_tag
(s: sum)
: Tot (clens (sum_type s) (sum_key s))
= {
clens_cond = (fun _ -> True);
clens_get = sum_tag_of_data s;
}
let gaccessor_sum_tag
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
: Tot (gaccessor (parse_sum t p pc) (parse_enum_key p (sum_enum t)) (clens_sum_tag t))
= gaccessor_tagged_union_tag
(parse_enum_key p (sum_enum t))
(sum_tag_of_data t)
(parse_sum_cases t pc)
inline_for_extraction
let accessor_sum_tag
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
: Tot (accessor (gaccessor_sum_tag t p pc))
= accessor_tagged_union_tag
(parse_enum_key p (sum_enum t))
(sum_tag_of_data t)
(parse_sum_cases t pc)
let clens_sum_payload
(s: sum)
(k: sum_key s)
: Tot (clens (sum_type s) (sum_type_of_tag s k))
= {
clens_cond = (fun (x: sum_type s) -> sum_tag_of_data s x == k);
clens_get = (fun (x: sum_type s) -> synth_sum_case_recip s k x <: Ghost (sum_type_of_tag s k) (requires (sum_tag_of_data s x == k)) (ensures (fun _ -> True)));
}
#push-options "--z3rlimit 32"
let gaccessor_clens_sum_payload'
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (gaccessor' (parse_sum t p pc) (dsnd (pc k)) (clens_sum_payload t k))
= fun (input: bytes) ->
parse_sum_eq'' t p pc input;
let res =
match parse p input with
| Some (_, consumed) ->
synth_sum_case_inverse t k;
synth_sum_case_injective t k;
synth_injective_synth_inverse_synth_inverse_recip (synth_sum_case t k) (synth_sum_case_recip t k) ();
(consumed)
| _ -> 0 // dummy
in
(res <: (res: _ { gaccessor_post' (parse_sum t p pc) (dsnd (pc k)) (clens_sum_payload t k) input res } ))
#push-options "--z3rlimit 64"
let gaccessor_clens_sum_payload_injective
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
(sl sl' : bytes)
: Lemma
(requires (
gaccessor_pre (parse_sum t p pc) (dsnd (pc k)) (clens_sum_payload t k) sl /\
gaccessor_pre (parse_sum t p pc) (dsnd (pc k)) (clens_sum_payload t k) sl' /\
injective_precond (parse_sum t p pc) sl sl'
))
(ensures (gaccessor_clens_sum_payload' t p pc k sl == gaccessor_clens_sum_payload' t p pc k sl'))
= parse_sum_eq'' t p pc sl;
parse_sum_eq'' t p pc sl' ;
parse_injective (parse_sum t p pc) sl sl' ;
parse_injective p sl sl'
#pop-options
let gaccessor_clens_sum_payload_no_lookahead
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
(sl sl' : bytes)
: Lemma
(requires (
(parse_sum_kind kt t pc).parser_kind_subkind == Some ParserStrong /\
gaccessor_pre (parse_sum t p pc) (dsnd (pc k)) (clens_sum_payload t k) sl /\
gaccessor_pre (parse_sum t p pc) (dsnd (pc k)) (clens_sum_payload t k) sl' /\
no_lookahead_on_precond (parse_sum t p pc) sl sl'
))
(ensures (gaccessor_clens_sum_payload' t p pc k sl == gaccessor_clens_sum_payload' t p pc k sl'))
= parse_sum_eq'' t p pc sl;
parse_sum_eq'' t p pc sl' ;
parse_strong_prefix (parse_sum t p pc) sl sl' ;
parse_injective p sl sl'
let gaccessor_clens_sum_payload
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (gaccessor (parse_sum t p pc) (dsnd (pc k)) (clens_sum_payload t k))
= Classical.forall_intro_2 (fun x -> Classical.move_requires (gaccessor_clens_sum_payload_injective t p pc k x));
Classical.forall_intro_2 (fun x -> Classical.move_requires (gaccessor_clens_sum_payload_no_lookahead t p pc k x));
gaccessor_prop_equiv (parse_sum t p pc) (dsnd (pc k)) (clens_sum_payload t k) (gaccessor_clens_sum_payload' t p pc k);
gaccessor_clens_sum_payload' t p pc k
inline_for_extraction
let accessor_clens_sum_payload'
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(j: jumper p)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: HST.Stack U32.t
(requires (fun h ->
valid (parse_sum t p pc) h input pos /\
(clens_sum_payload t k).clens_cond (contents (parse_sum t p pc) h input pos)
))
(ensures (fun h pos' h' ->
B.modifies B.loc_none h h' /\
pos' == slice_access h (gaccessor_clens_sum_payload t p pc k) input pos
))
=
let h = HST.get () in
[@inline_let]
let _ =
let pos' = get_valid_pos (parse_sum t p pc) h input pos in
let large = bytes_of_slice_from h input pos in
slice_access_eq h (gaccessor_clens_sum_payload t p pc k) input pos;
valid_facts (parse_sum t p pc) h input pos;
parse_sum_eq'' t p pc large;
valid_facts p h input pos
in
j input pos
#pop-options
inline_for_extraction
let accessor_clens_sum_payload
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(j: jumper p)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (accessor (gaccessor_clens_sum_payload t p pc k))
= fun #rrel #rel -> accessor_clens_sum_payload' t j pc k #rrel #rel
let clens_sum_cases_payload
(s: sum)
(k: sum_key s)
: Tot (clens (sum_cases s k) (sum_type_of_tag s k))
= {
clens_cond = (fun (x: sum_cases s k) -> True);
clens_get = (fun (x: sum_cases s k) -> synth_sum_case_recip s k x <: Ghost (sum_type_of_tag s k) (requires (True)) (ensures (fun _ -> True)));
}
let gaccessor_clens_sum_cases_payload
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (gaccessor (parse_sum_cases' t pc k) (dsnd (pc k)) (clens_sum_cases_payload t k))
= synth_sum_case_injective t k;
synth_sum_case_inverse t k;
synth_injective_synth_inverse_synth_inverse_recip (synth_sum_case t k) (synth_sum_case_recip t k) ();
gaccessor_ext
(gaccessor_synth (dsnd (pc k)) (synth_sum_case t k) (synth_sum_case_recip t k) ())
(clens_sum_cases_payload t k)
()
inline_for_extraction
let accessor_clens_sum_cases_payload
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (accessor (gaccessor_clens_sum_cases_payload t pc k))
= [@inline_let]
let _ =
synth_sum_case_injective t k;
synth_sum_case_inverse t k;
synth_injective_synth_inverse_synth_inverse_recip (synth_sum_case t k) (synth_sum_case_recip t k) ()
in
accessor_ext
(accessor_synth (dsnd (pc k)) (synth_sum_case t k) (synth_sum_case_recip t k) ())
(clens_sum_cases_payload t k)
()
inline_for_extraction
let validate_dsum_cases_t
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(#k: parser_kind)
(g: parser k (dsum_type_of_unknown_tag s))
(x: dsum_key s)
: Tot Type
= validator (parse_dsum_cases' s f g x)
let validate_dsum_cases_eq
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(#k: parser_kind)
(g: parser k (dsum_type_of_unknown_tag s))
(x: dsum_key s)
(v1 v2 : validate_dsum_cases_t s f g x)
: GTot Type0
= True
inline_for_extraction
let validate_dsum_cases_if'
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(#k: parser_kind)
(g: parser k (dsum_type_of_unknown_tag s))
(x: dsum_key s)
(cond: bool)
(ift: (cond_true cond -> Tot (validate_dsum_cases_t s f g x)))
(iff: (cond_false cond -> Tot (validate_dsum_cases_t s f g x)))
: Tot (validate_dsum_cases_t s f g x)
= fun #rrel #rel input len ->
if cond
then (ift () <: validate_dsum_cases_t s f g x) input len
else (iff () <: validate_dsum_cases_t s f g x) input len
inline_for_extraction
let validate_dsum_cases_if
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(#k: parser_kind)
(g: parser k (dsum_type_of_unknown_tag s))
(x: dsum_key s)
: Tot (if_combinator _ (validate_dsum_cases_eq s f g x))
= validate_dsum_cases_if' s f g x
inline_for_extraction
let validate_dsum_cases'
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(f' : (x: dsum_known_key s) -> Tot (validator (dsnd (f x))))
(#k: parser_kind)
(#g: parser k (dsum_type_of_unknown_tag s))
(g' : validator g)
(x: dsum_key s)
: Tot (validate_dsum_cases_t s f g x)
= [@inline_let]
let _ = synth_dsum_case_injective s x in
match x with
| Known x' -> validate_synth (f' x') (synth_dsum_case s (Known x')) () <: validator (parse_dsum_cases' s f g x)
| Unknown x' -> validate_synth g' (synth_dsum_case s (Unknown x')) () <: validator (parse_dsum_cases' s f g x)
inline_for_extraction
let validate_dsum_cases'_destr
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(f' : (x: dsum_known_key s) -> Tot (validator (dsnd (f x))))
(#k: parser_kind)
(#g: parser k (dsum_type_of_unknown_tag s))
(g' : validator g)
(destr: dep_enum_destr _ (fun k -> validate_dsum_cases_t s f g (Known k)))
(x: dsum_key s)
: Tot (validate_dsum_cases_t s f g x)
= fun #rrel #rel input pos ->
match x with
| Known k ->
destr
_
(fun k -> validate_dsum_cases_if s f g (Known k))
(fun _ _ -> ())
(fun _ _ _ _ -> ())
(fun k -> validate_dsum_cases' s f f' g' (Known k))
k
input
pos
| Unknown r -> validate_dsum_cases' s f f' g' (Unknown r) input pos
inline_for_extraction
let validate_dsum_cases
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(f' : (x: dsum_known_key s) -> Tot (validator (dsnd (f x))))
(#k: parser_kind)
(#g: parser k (dsum_type_of_unknown_tag s))
(g' : validator g)
(destr: dep_enum_destr _ (fun k -> validate_dsum_cases_t s f g (Known k)))
(x: dsum_key s)
: Tot (validator (parse_dsum_cases s f g x))
= fun #rrel #rel input pos ->
let h = HST.get () in
[@inline_let]
let _ =
valid_facts (parse_dsum_cases' s f g x) h input (uint64_to_uint32 pos);
valid_facts (parse_dsum_cases s f g x) h input (uint64_to_uint32 pos);
parse_dsum_cases_eq' s f g x (bytes_of_slice_from h input (uint64_to_uint32 pos))
in
validate_dsum_cases'_destr s f f' g' destr x input pos
#push-options "--z3rlimit 40"
inline_for_extraction
let validate_dsum
(#kt: parser_kind)
(t: dsum)
(#p: parser kt (dsum_repr_type t))
(v: validator p)
(p32: leaf_reader p)
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(f32: (x: dsum_known_key t) -> Tot (validator (dsnd (f x))))
(#k': parser_kind)
(#g: parser k' (dsum_type_of_unknown_tag t))
(g32: validator g)
(destr: dep_maybe_enum_destr_t (dsum_enum t) (validate_dsum_cases_t t f g))
: Tot (validator (parse_dsum t p f g))
= fun #rrel #rel input pos ->
let h = HST.get () in
[@inline_let]
let _ = parse_dsum_eq' t p f g (bytes_of_slice_from h input (uint64_to_uint32 pos)) in
[@inline_let]
let _ = valid_facts (parse_dsum t p f g) h input (uint64_to_uint32 pos) in
[@inline_let]
let _ = valid_facts p h input (uint64_to_uint32 pos) in
let pos_after_tag = v input pos in
if is_error pos_after_tag
then pos_after_tag
else
let tg = p32 input (uint64_to_uint32 pos) in
[@inline_let]
let _ = valid_facts (parse_dsum_cases' t f g (maybe_enum_key_of_repr (dsum_enum t) tg)) h input (uint64_to_uint32 pos_after_tag) in
destr (validate_dsum_cases_eq t f g) (validate_dsum_cases_if t f g) (fun _ _ -> ()) (fun _ _ _ _ -> ()) (validate_dsum_cases' t f f32 g32) tg input pos_after_tag
#pop-options
#reset-options "--z3rlimit 64 --z3cliopt smt.arith.nl=false --initial_ifuel 8 --max_ifuel 8 --initial_fuel 2 --max_fuel 2"
let valid_dsum_intro_known
(h: HS.mem)
(t: dsum)
(#kt: parser_kind)
(p: parser kt (dsum_repr_type t))
(f: ((x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x))))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: Lemma
(requires (
valid (parse_maybe_enum_key p (dsum_enum t)) h input pos /\ (
let k' = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
Known? k' /\ (
let Known k = k' in
valid (dsnd (f k)) h input (get_valid_pos (parse_maybe_enum_key p (dsum_enum t)) h input pos)
))))
(ensures (
let Known k = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
let pos_payload = get_valid_pos (parse_maybe_enum_key p (dsum_enum t)) h input pos in
valid_content_pos
(parse_dsum t p f g) h input pos
(synth_dsum_case t (Known k) (contents (dsnd (f k)) h input pos_payload))
(get_valid_pos (dsnd (f k)) h input pos_payload)
))
= valid_facts (parse_maybe_enum_key p (dsum_enum t)) h input pos;
let Known k = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
let pos_payload = get_valid_pos (parse_maybe_enum_key p (dsum_enum t)) h input pos in
valid_facts (dsnd (f k)) h input pos_payload;
valid_facts (parse_dsum t p f g) h input pos;
parse_dsum_eq t p f g (bytes_of_slice_from h input pos)
let valid_dsum_intro_unknown
(h: HS.mem)
(t: dsum)
(#kt: parser_kind)
(p: parser kt (dsum_repr_type t))
(f: ((x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x))))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: Lemma
(requires (
valid (parse_maybe_enum_key p (dsum_enum t)) h input pos /\ (
let k' = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
Unknown? k' /\
valid g h input (get_valid_pos (parse_maybe_enum_key p (dsum_enum t)) h input pos)
)))
(ensures (
let Unknown r = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
let pos_payload = get_valid_pos (parse_maybe_enum_key p (dsum_enum t)) h input pos in
valid_content_pos
(parse_dsum t p f g) h input pos
(synth_dsum_case t (Unknown r) (contents g h input pos_payload))
(get_valid_pos g h input pos_payload)
))
= valid_facts (parse_maybe_enum_key p (dsum_enum t)) h input pos;
let Unknown r = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
let pos_payload = get_valid_pos (parse_maybe_enum_key p (dsum_enum t)) h input pos in
valid_facts g h input pos_payload;
valid_facts (parse_dsum t p f g) h input pos;
parse_dsum_eq t p f g (bytes_of_slice_from h input pos)
#reset-options
inline_for_extraction
let finalize_dsum_case_known
(t: dsum)
(#kt: parser_kind)
(#p: parser kt (dsum_repr_type t))
(s: serializer p)
(w: leaf_writer_strong s)
(f: ((x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x))))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
(destr: enum_repr_of_key'_t (dsum_enum t))
(k: dsum_known_key t)
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: HST.Stack unit
(requires (fun h ->
let len_tag = serialized_length (serialize_enum_key _ s (dsum_enum t)) k in
U32.v pos + len_tag < 4294967296 /\ (
let pos_payload = pos `U32.add` U32.uint_to_t len_tag in
valid (dsnd (f k)) h input pos_payload /\
writable input.base (U32.v pos) (U32.v pos_payload) h
)))
(ensures (fun h _ h' ->
let len_tag = serialized_length (serialize_enum_key _ s (dsum_enum t)) k in
let pos_payload = pos `U32.add` U32.uint_to_t len_tag in
B.modifies (loc_slice_from_to input pos pos_payload) h h' /\
valid_content_pos (parse_dsum t p f g) h' input pos (synth_dsum_case t (Known k) (contents (dsnd (f k)) h input pos_payload)) (get_valid_pos (dsnd (f k)) h input pos_payload)
))
= let pos1 = write_enum_key w (dsum_enum t) destr k input pos in
let h = HST.get () in
[@inline_let]
let _ =
valid_facts (parse_enum_key p (dsum_enum t)) h input pos;
valid_facts (parse_maybe_enum_key p (dsum_enum t)) h input pos;
let sq = bytes_of_slice_from h input pos in
parse_enum_key_eq p (dsum_enum t) sq;
parse_maybe_enum_key_eq p (dsum_enum t) sq;
valid_dsum_intro_known h t p f g input pos
in
()
inline_for_extraction
let finalize_dsum_case_unknown
(t: dsum)
(#kt: parser_kind)
(#p: parser kt (dsum_repr_type t))
(s: serializer p)
(w: leaf_writer_strong s)
(f: ((x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x))))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
(r: unknown_enum_repr (dsum_enum t))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: HST.Stack unit
(requires (fun h ->
let len_tag = serialized_length s r in
U32.v pos + len_tag < 4294967296 /\ (
let pos_payload = pos `U32.add` U32.uint_to_t len_tag in
valid g h input pos_payload /\
writable input.base (U32.v pos) (U32.v pos_payload) h
)))
(ensures (fun h _ h' ->
let len_tag = serialized_length s r in
let pos_payload = pos `U32.add` U32.uint_to_t len_tag in
B.modifies (loc_slice_from_to input pos pos_payload) h h' /\
valid_content_pos (parse_dsum t p f g) h' input pos (synth_dsum_case t (Unknown r) (contents g h input pos_payload)) (get_valid_pos g h input pos_payload)
))
= let pos1 = w r input pos in
let h = HST.get () in
[@inline_let]
let _ =
valid_facts (parse_maybe_enum_key p (dsum_enum t)) h input pos;
valid_facts p h input pos;
let sq = bytes_of_slice_from h input pos in
parse_maybe_enum_key_eq p (dsum_enum t) sq;
valid_dsum_intro_unknown h t p f g input pos
in
()
let valid_dsum_elim_tag
(h: HS.mem)
(t: dsum)
(#kt: parser_kind)
(p: parser kt (dsum_repr_type t))
(f: ((x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x))))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: Lemma
(requires (
valid (parse_dsum t p f g) h input pos
))
(ensures (
valid (parse_maybe_enum_key p (dsum_enum t)) h input pos /\
contents (parse_maybe_enum_key p (dsum_enum t)) h input pos == dsum_tag_of_data t (contents (parse_dsum t p f g) h input pos)
))
= let _ = parse_dsum_eq_ t p f g (bytes_of_slice_from h input pos) in
let _ = valid_facts (parse_dsum t p f g) h input pos in
let _ = valid_facts (parse_maybe_enum_key p (dsum_enum t)) h input pos in
()
inline_for_extraction
let read_dsum_tag
(t: dsum)
(#kt: parser_kind)
(#p: parser kt (dsum_repr_type t))
(p32: leaf_reader p)
(destr: maybe_enum_destr_t (maybe_enum_key (dsum_enum t)) (dsum_enum t))
(f: ((x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x))))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: HST.Stack (dsum_key t)
(requires (fun h ->
valid (parse_dsum t p f g) h input pos
))
(ensures (fun h res h' ->
B.modifies B.loc_none h h' /\
res == dsum_tag_of_data t (contents (parse_dsum t p f g) h input pos)
))
= let h = HST.get () in
[@inline_let] let _ = valid_dsum_elim_tag h t p f g input pos in
read_maybe_enum_key p32 (dsum_enum t) destr input pos
#push-options "--z3rlimit 32"
let valid_dsum_elim_known
(h: HS.mem)
(t: dsum)
(#kt: parser_kind)
(p: parser kt (dsum_repr_type t))
(f: ((x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x))))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: Lemma
(requires (
valid (parse_dsum t p f g) h input pos /\
Known? (dsum_tag_of_data t (contents (parse_dsum t p f g) h input pos))
))
(ensures (
valid (parse_maybe_enum_key p (dsum_enum t)) h input pos /\ (
let k' = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
let pos_payload = get_valid_pos (parse_maybe_enum_key p (dsum_enum t)) h input pos in
Known? k' /\ (
let Known k = k' in
valid (dsnd (f k)) h input pos_payload /\
valid_content_pos
(parse_dsum t p f g) h input pos
(synth_dsum_case t (Known k) (contents (dsnd (f k)) h input pos_payload))
(get_valid_pos (dsnd (f k)) h input pos_payload)
))))
=
valid_facts (parse_dsum t p f g) h input pos;
parse_dsum_eq t p f g (bytes_of_slice_from h input pos);
valid_facts (parse_maybe_enum_key p (dsum_enum t)) h input pos;
let Known k = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
let pos_payload = get_valid_pos (parse_maybe_enum_key p (dsum_enum t)) h input pos in
valid_facts (dsnd (f k)) h input pos_payload
#pop-options
let valid_dsum_elim_unknown
(h: HS.mem)
(t: dsum)
(#kt: parser_kind)
(p: parser kt (dsum_repr_type t))
(f: ((x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x))))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: Lemma
(requires (
valid (parse_dsum t p f g) h input pos /\
Unknown? (dsum_tag_of_data t (contents (parse_dsum t p f g) h input pos))
))
(ensures (
valid (parse_maybe_enum_key p (dsum_enum t)) h input pos /\ (
let k' = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
let pos_payload = get_valid_pos (parse_maybe_enum_key p (dsum_enum t)) h input pos in
Unknown? k' /\ (
let Unknown r = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
valid g h input pos_payload /\
valid_content_pos
(parse_dsum t p f g) h input pos
(synth_dsum_case t (Unknown r) (contents g h input pos_payload))
(get_valid_pos g h input pos_payload)
))))
=
valid_facts (parse_dsum t p f g) h input pos;
parse_dsum_eq t p f g (bytes_of_slice_from h input pos);
valid_facts (parse_maybe_enum_key p (dsum_enum t)) h input pos;
let Unknown r = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
let pos_payload = get_valid_pos (parse_maybe_enum_key p (dsum_enum t)) h input pos in
valid_facts g h input pos_payload
inline_for_extraction
let jump_dsum_cases_t
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(#k: parser_kind)
(g: parser k (dsum_type_of_unknown_tag s))
(x: dsum_key s)
: Tot Type
= jumper (parse_dsum_cases' s f g x)
let jump_dsum_cases_eq
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(#k: parser_kind)
(g: parser k (dsum_type_of_unknown_tag s))
(x: dsum_key s)
(v1 v2 : jump_dsum_cases_t s f g x)
: GTot Type0
= True
inline_for_extraction
let jump_dsum_cases_if'
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(#k: parser_kind)
(g: parser k (dsum_type_of_unknown_tag s))
(x: dsum_key s)
(cond: bool)
(ift: (cond_true cond -> Tot (jump_dsum_cases_t s f g x)))
(iff: (cond_false cond -> Tot (jump_dsum_cases_t s f g x)))
: Tot (jump_dsum_cases_t s f g x)
= fun #rrel #rel input len ->
if cond
then (ift () <: jump_dsum_cases_t s f g x) input len
else (iff () <: jump_dsum_cases_t s f g x) input len
inline_for_extraction
let jump_dsum_cases_if
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(#k: parser_kind)
(g: parser k (dsum_type_of_unknown_tag s))
(x: dsum_key s)
: Tot (if_combinator _ (jump_dsum_cases_eq s f g x))
= jump_dsum_cases_if' s f g x
inline_for_extraction
let jump_dsum_cases'
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(f' : (x: dsum_known_key s) -> Tot (jumper (dsnd (f x))))
(#k: parser_kind)
(#g: parser k (dsum_type_of_unknown_tag s))
(g' : jumper g)
(x: dsum_key s)
: Tot (jump_dsum_cases_t s f g x)
= synth_dsum_case_injective s x;
match x with
| Known x' -> jump_synth (f' x') (synth_dsum_case s (Known x')) () <: jumper (parse_dsum_cases' s f g x)
| Unknown x' -> jump_synth g' (synth_dsum_case s (Unknown x')) () <: jumper (parse_dsum_cases' s f g x)
inline_for_extraction
let jump_dsum_cases'_destr
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(f' : (x: dsum_known_key s) -> Tot (jumper (dsnd (f x))))
(#k: parser_kind)
(#g: parser k (dsum_type_of_unknown_tag s))
(g' : jumper g)
(destr: dep_enum_destr _ (fun k -> jump_dsum_cases_t s f g (Known k)))
(x: dsum_key s)
: Tot (jump_dsum_cases_t s f g x)
= fun #rrel #rel input pos ->
match x with
| Known k ->
destr
_
(fun k -> jump_dsum_cases_if s f g (Known k))
(fun _ _ -> ())
(fun _ _ _ _ -> ())
(fun k -> jump_dsum_cases' s f f' g' (Known k))
k
input
pos
| Unknown r -> jump_dsum_cases' s f f' g' (Unknown r) input pos
inline_for_extraction
let jump_dsum_cases
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(f' : (x: dsum_known_key s) -> Tot (jumper (dsnd (f x))))
(#k: parser_kind)
(#g: parser k (dsum_type_of_unknown_tag s))
(g' : jumper g)
(destr: dep_enum_destr _ (fun k -> jump_dsum_cases_t s f g (Known k)))
(x: dsum_key s)
: Tot (jumper (parse_dsum_cases s f g x))
= fun #rrel #rel input pos ->
let h = HST.get () in
[@inline_let]
let _ =
valid_facts (parse_dsum_cases' s f g x) h input pos;
valid_facts (parse_dsum_cases s f g x) h input pos;
parse_dsum_cases_eq' s f g x (bytes_of_slice_from h input pos)
in
jump_dsum_cases'_destr s f f' g' destr x input pos
#push-options "--z3rlimit 16"
inline_for_extraction
let jump_dsum
(#kt: parser_kind)
(t: dsum)
(#p: parser kt (dsum_repr_type t))
(v: jumper p)
(p32: leaf_reader p)
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(f32: (x: dsum_known_key t) -> Tot (jumper (dsnd (f x))))
(#k': parser_kind)
(#g: parser k' (dsum_type_of_unknown_tag t))
(g32: jumper g)
(destr: dep_maybe_enum_destr_t (dsum_enum t) (jump_dsum_cases_t t f g))
: Tot (jumper (parse_dsum t p f g))
= fun #rrel #rel input pos ->
let h = HST.get () in
[@inline_let]
let _ = parse_dsum_eq' t p f g (bytes_of_slice_from h input pos) in
[@inline_let]
let _ = valid_facts (parse_dsum t p f g) h input pos in
[@inline_let]
let _ = valid_facts p h input pos in
let pos_after_tag = v input pos in
let tg = p32 input pos in
[@inline_let]
let _ = valid_facts (parse_dsum_cases' t f g (maybe_enum_key_of_repr (dsum_enum t) tg)) h input pos_after_tag in
destr (jump_dsum_cases_eq t f g) (jump_dsum_cases_if t f g) (fun _ _ -> ()) (fun _ _ _ _ -> ()) (jump_dsum_cases' t f f32 g32) tg input pos_after_tag
#pop-options
inline_for_extraction
let read_dsum_cases'
(t: dsum)
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(f32: (x: dsum_known_key t) -> Tot (leaf_reader (dsnd (f x))))
(#k': parser_kind)
(g: parser k' (dsum_type_of_unknown_tag t))
(g32: leaf_reader g)
(x: dsum_key t)
: Tot (leaf_reader (parse_dsum_cases' t f g x))
= fun #rrel #rel input pos ->
[@inline_let]
let _ = synth_dsum_case_injective t x in
match x with
| Known x' ->
read_synth'
(dsnd (f x'))
(synth_dsum_case t (Known x'))
(f32 x')
()
input
pos
| Unknown x' ->
read_synth'
g
(synth_dsum_case t (Unknown x'))
g32
()
input
pos
inline_for_extraction
let read_dsum_cases_t
(t: dsum)
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(#k': parser_kind)
(g: parser k' (dsum_type_of_unknown_tag t))
(k: dsum_known_key t)
: Tot Type
= leaf_reader (parse_dsum_cases' t f g (Known k))
let read_dsum_cases_t_eq
(t: dsum)
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(#k': parser_kind)
(g: parser k' (dsum_type_of_unknown_tag t))
(k: dsum_known_key t)
(x y : read_dsum_cases_t t f g k)
: GTot Type0
= True
inline_for_extraction
let read_dsum_cases_t_if
(t: dsum)
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(#k': parser_kind)
(g: parser k' (dsum_type_of_unknown_tag t))
(k: dsum_known_key t)
: Tot (if_combinator _ (read_dsum_cases_t_eq t f g k))
= fun cond (sv_true: cond_true cond -> Tot (read_dsum_cases_t t f g k)) (sv_false: cond_false cond -> Tot (read_dsum_cases_t t f g k)) #_ #_ input pos ->
if cond
then sv_true () input pos
else sv_false () input pos
inline_for_extraction
let read_dsum_cases
(t: dsum)
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(f32: (x: dsum_known_key t) -> Tot (leaf_reader (dsnd (f x))))
(#k': parser_kind)
(g: parser k' (dsum_type_of_unknown_tag t))
(g32: leaf_reader g)
(destr: dep_enum_destr _ (read_dsum_cases_t t f g))
(x: dsum_key t)
: Tot (leaf_reader (parse_dsum_cases' t f g x))
= fun #_ #_ input pos ->
match x with
| Known k ->
destr
_
(read_dsum_cases_t_if t f g)
(fun _ _ -> ())
(fun _ _ _ _ -> ())
(fun k -> read_dsum_cases' t f f32 g g32 (Known k))
k
input
pos
| Unknown r ->
read_dsum_cases' t f f32 g g32 (Unknown r) input pos
#push-options "--z3rlimit 16"
inline_for_extraction
let read_dsum
(#kt: parser_kind)
(t: dsum)
(#p: parser kt (dsum_repr_type t))
(p32: leaf_reader (parse_maybe_enum_key p (dsum_enum t)))
(j: jumper p)
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(f32: (x: dsum_known_key t) -> Tot (leaf_reader (dsnd (f x))))
(#k': parser_kind)
(#g: parser k' (dsum_type_of_unknown_tag t))
(g32: leaf_reader g)
(destr: dep_enum_destr _ (read_dsum_cases_t t f g))
: Tot (leaf_reader (parse_dsum t p f g))
= fun #_ #_ input pos ->
let h = HST.get () in
valid_facts (parse_dsum t p f g) h input pos;
parse_dsum_eq_ t p f g (bytes_of_slice_from h input pos);
valid_facts (parse_maybe_enum_key p (dsum_enum t)) h input pos;
let k = p32 input pos in
let pos' = jump_maybe_enum_key j (dsum_enum t) input pos in
valid_facts (parse_dsum_cases' t f g k) h input pos' ;
read_dsum_cases t f f32 g g32 destr k input pos'
#pop-options
inline_for_extraction
let serialize32_dsum_type_of_tag
(t: dsum)
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(sf: (x: dsum_known_key t) -> Tot (serializer (dsnd (f x))))
(sf32: (x: dsum_known_key t) -> Tot (serializer32 (sf x)))
(#k': parser_kind)
(#g: parser k' (dsum_type_of_unknown_tag t))
(#sg: serializer g)
(sg32: serializer32 sg)
(tg: dsum_key t)
: Tot (serializer32 (serialize_dsum_type_of_tag t f sf g sg tg))
= match tg with
| Known x' -> serialize32_ext (dsnd (f x')) (sf x') (sf32 x') (parse_dsum_type_of_tag t f g tg) ()
| Unknown x' -> serialize32_ext g sg sg32 (parse_dsum_type_of_tag t f g tg) ()
inline_for_extraction
let serialize32_dsum_cases_aux
(t: dsum)
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(sf: (x: dsum_known_key t) -> Tot (serializer (dsnd (f x))))
(sf32: (x: dsum_known_key t) -> Tot (serializer32 (sf x)))
(#k': parser_kind)
(#g: parser k' (dsum_type_of_unknown_tag t))
(#sg: serializer g)
(sg32: serializer32 sg)
(tg: dsum_key t)
: Tot (serializer32 (serialize_dsum_cases t f sf g sg tg))
= [@inline_let]
let _ = synth_dsum_case_injective t tg in
[@inline_let]
let _ = synth_dsum_case_inverse t tg in
serialize32_synth
(serialize32_dsum_type_of_tag t f sf sf32 sg32 tg)
(synth_dsum_case t tg)
(synth_dsum_case_recip t tg)
(fun x -> synth_dsum_case_recip t tg x)
()
inline_for_extraction
let serialize32_dsum_cases_t
(t: dsum)
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(sf: (x: dsum_known_key t) -> Tot (serializer (dsnd (f x))))
(#k': parser_kind)
(g: parser k' (dsum_type_of_unknown_tag t))
(sg: serializer g)
(k: dsum_known_key t)
: Tot Type
= serializer32 (serialize_dsum_cases t f sf g sg (Known k))
let serialize32_dsum_cases_t_eq
(t: dsum)
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(sf: (x: dsum_known_key t) -> Tot (serializer (dsnd (f x))))
(#k': parser_kind)
(g: parser k' (dsum_type_of_unknown_tag t))
(sg: serializer g)
(k: dsum_known_key t)
(x y: serialize32_dsum_cases_t t f sf g sg k)
: GTot Type0
= True
inline_for_extraction
let serialize32_dsum_cases_t_if
(t: dsum)
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(sf: (x: dsum_known_key t) -> Tot (serializer (dsnd (f x))))
(#k': parser_kind)
(g: parser k' (dsum_type_of_unknown_tag t))
(sg: serializer g)
(k: dsum_known_key t)
: Tot (if_combinator _ (serialize32_dsum_cases_t_eq t f sf g sg k))
= fun cond (sv_true: (cond_true cond -> Tot (serialize32_dsum_cases_t t f sf g sg k))) (sv_false: (cond_false cond -> Tot (serialize32_dsum_cases_t t f sf g sg k))) x #rrel #rel output pos ->
if cond
then (sv_true () x output pos)
else (sv_false () x output pos)
inline_for_extraction
let serialize32_dsum_cases
(t: dsum)
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(sf: (x: dsum_known_key t) -> Tot (serializer (dsnd (f x))))
(sf32: (x: dsum_known_key t) -> Tot (serializer32 (sf x)))
(#k': parser_kind)
(#g: parser k' (dsum_type_of_unknown_tag t))
(#sg: serializer g)
(sg32: serializer32 sg)
(destr: dep_enum_destr _ (serialize32_dsum_cases_t t f sf g sg))
(tg: dsum_key t)
: Tot (serializer32 (serialize_dsum_cases t f sf g sg tg))
= fun x #rrel #rel output pos ->
match tg with
| Known k ->
destr
_
(serialize32_dsum_cases_t_if t f sf g sg)
(fun _ _ -> ())
(fun _ _ _ _ -> ())
(fun k -> serialize32_dsum_cases_aux t f sf sf32 sg32 (Known k))
k
x
output
pos
| Unknown r ->
serialize32_dsum_cases_aux t f sf sf32 sg32 (Unknown r) x output pos
inline_for_extraction
let serialize32_dsum
(#kt: parser_kind)
(t: dsum)
(#p: parser kt (dsum_repr_type t))
(s: serializer p {kt.parser_kind_subkind == Some ParserStrong})
(s32: serializer32 (serialize_maybe_enum_key _ s (dsum_enum t)))
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(sf: (x: dsum_known_key t) -> Tot (serializer (dsnd (f x))))
(sf32: (x: dsum_known_key t) -> Tot (serializer32 (sf x)))
(#k': parser_kind)
(#g: parser k' (dsum_type_of_unknown_tag t))
(#sg: serializer g)
(sg32: serializer32 sg)
(destr: dep_enum_destr _ (serialize32_dsum_cases_t t f sf g sg))
: Tot (serializer32 (serialize_dsum t s f sf g sg))
= fun x #_ #_ output pos ->
[@inline_let]
let _ = serialize_dsum_eq' t s f sf g sg x in
let tg = dsum_tag_of_data t x in
serialize32_nondep_then_aux
s32
(serialize32_dsum_cases t f sf sf32 sg32 destr tg)
tg
x
output
pos
let clens_dsum_tag
(s: dsum)
: Tot (clens (dsum_type s) (dsum_key s))
= {
clens_cond = (fun _ -> True);
clens_get = dsum_tag_of_data s;
}
let gaccessor_dsum_tag
(#kt: parser_kind)
(t: dsum)
(p: parser kt (dsum_repr_type t))
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
: Tot (gaccessor (parse_dsum t p f g) (parse_maybe_enum_key p (dsum_enum t)) (clens_dsum_tag t))
= gaccessor_tagged_union_tag
(parse_maybe_enum_key p (dsum_enum t))
(dsum_tag_of_data t)
(parse_dsum_cases t f g)
inline_for_extraction
let accessor_dsum_tag
(#kt: parser_kind)
(t: dsum)
(p: parser kt (dsum_repr_type t))
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
: Tot (accessor (gaccessor_dsum_tag t p f g))
= accessor_tagged_union_tag
(parse_maybe_enum_key p (dsum_enum t))
(dsum_tag_of_data t)
(parse_dsum_cases t f g)
let clens_dsum_payload
(s: dsum)
(k: dsum_key s)
: Tot (clens (dsum_type s) (dsum_type_of_tag s k))
= {
clens_cond = (fun (x: dsum_type s) -> dsum_tag_of_data s x == k);
clens_get = (fun (x: dsum_type s) -> synth_dsum_case_recip s k x <: Ghost (dsum_type_of_tag s k) (requires (dsum_tag_of_data s x == k)) (ensures (fun _ -> True)));
}
let clens_dsum_unknown_payload
(s: dsum)
: Tot (clens (dsum_type s) (dsum_type_of_unknown_tag s))
= {
clens_cond = (fun (x: dsum_type s) -> Unknown? (dsum_tag_of_data s x));
clens_get = (fun (x: dsum_type s) -> synth_dsum_case_recip s (dsum_tag_of_data s x) x <: Ghost (dsum_type_of_unknown_tag s) (requires (Unknown? (dsum_tag_of_data s x))) (ensures (fun _ -> True)));
}
#push-options "--z3rlimit 16"
let gaccessor_clens_dsum_payload'
(#kt: parser_kind)
(t: dsum)
(p: parser kt (dsum_repr_type t))
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
(k: dsum_key t)
: Tot (gaccessor' (parse_dsum t p f g) (parse_dsum_type_of_tag' t f g k) (clens_dsum_payload t k))
= fun (input: bytes) ->
parse_dsum_eq3 t p f g input;
let res =
match parse p input with
| Some (_, consumed) ->
synth_dsum_case_inverse t k;
synth_dsum_case_injective t k;
synth_injective_synth_inverse_synth_inverse_recip (synth_dsum_case t k) (synth_dsum_case_recip t k) ();
(consumed)
| _ -> (0) // dummy
in
(res <: (res: _ { gaccessor_post' (parse_dsum t p f g) (parse_dsum_type_of_tag' t f g k) (clens_dsum_payload t k) input res } ))
let gaccessor_clens_dsum_payload_injective
(#kt: parser_kind)
(t: dsum)
(p: parser kt (dsum_repr_type t))
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
(k: dsum_key t)
(sl sl' : bytes)
: Lemma
(requires (
gaccessor_pre (parse_dsum t p f g) (parse_dsum_type_of_tag' t f g k) (clens_dsum_payload t k) sl /\
gaccessor_pre (parse_dsum t p f g) (parse_dsum_type_of_tag' t f g k) (clens_dsum_payload t k) sl' /\
injective_precond (parse_dsum t p f g) sl sl'
))
(ensures (
gaccessor_clens_dsum_payload' t p f g k sl == gaccessor_clens_dsum_payload' t p f g k sl'
))
=
parse_dsum_eq3 t p f g sl;
parse_dsum_eq3 t p f g sl';
parse_injective (parse_dsum t p f g) sl sl' ;
parse_injective p sl sl'
let gaccessor_clens_dsum_payload_no_lookahead
(#kt: parser_kind)
(t: dsum)
(p: parser kt (dsum_repr_type t))
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
(k: dsum_key t)
(sl sl' : bytes)
: Lemma
(requires (
(parse_dsum_kind kt t f ku).parser_kind_subkind == Some ParserStrong /\
gaccessor_pre (parse_dsum t p f g) (parse_dsum_type_of_tag' t f g k) (clens_dsum_payload t k) sl /\
gaccessor_pre (parse_dsum t p f g) (parse_dsum_type_of_tag' t f g k) (clens_dsum_payload t k) sl' /\
no_lookahead_on_precond (parse_dsum t p f g) sl sl'
))
(ensures (
gaccessor_clens_dsum_payload' t p f g k sl == gaccessor_clens_dsum_payload' t p f g k sl'
))
= parse_dsum_eq3 t p f g sl;
parse_dsum_eq3 t p f g sl';
parse_strong_prefix (parse_dsum t p f g) sl sl' ;
parse_injective p sl sl' | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"LowStar.Buffer.fst.checked",
"LowParse.Spec.Sum.fst.checked",
"LowParse.Low.Enum.fst.checked",
"FStar.UInt64.fsti.checked",
"FStar.UInt32.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Int.Cast.fst.checked",
"FStar.HyperStack.ST.fsti.checked",
"FStar.HyperStack.fst.checked",
"FStar.Classical.fsti.checked"
],
"interface_file": false,
"source_file": "LowParse.Low.Sum.fst"
} | [
{
"abbrev": true,
"full_module": "FStar.HyperStack",
"short_module": "HS"
},
{
"abbrev": true,
"full_module": "FStar.UInt64",
"short_module": "U64"
},
{
"abbrev": true,
"full_module": "FStar.Int.Cast",
"short_module": "Cast"
},
{
"abbrev": true,
"full_module": "LowStar.Buffer",
"short_module": "B"
},
{
"abbrev": true,
"full_module": "FStar.HyperStack.ST",
"short_module": "HST"
},
{
"abbrev": true,
"full_module": "FStar.UInt32",
"short_module": "U32"
},
{
"abbrev": false,
"full_module": "LowParse.Spec.Sum",
"short_module": null
},
{
"abbrev": false,
"full_module": "LowParse.Low.Enum",
"short_module": null
},
{
"abbrev": false,
"full_module": "LowParse.Low",
"short_module": null
},
{
"abbrev": false,
"full_module": "LowParse.Low",
"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",
"short_module": null
}
] | {
"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_elim_box": false,
"smtencoding_l_arith_repr": "boxwrap",
"smtencoding_nl_arith_repr": "boxwrap",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": true,
"z3cliopt": [],
"z3refresh": false,
"z3rlimit": 16,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | false |
t: LowParse.Spec.Sum.dsum ->
p: LowParse.Spec.Base.parser kt (LowParse.Spec.Sum.dsum_repr_type t) ->
f:
(x: LowParse.Spec.Sum.dsum_known_key t
-> Prims.dtuple2 LowParse.Spec.Base.parser_kind
(fun k -> LowParse.Spec.Base.parser k (LowParse.Spec.Sum.dsum_type_of_known_tag t x))) ->
g: LowParse.Spec.Base.parser ku (LowParse.Spec.Sum.dsum_type_of_unknown_tag t) ->
k: LowParse.Spec.Sum.dsum_key t
-> LowParse.Low.Base.Spec.gaccessor (LowParse.Spec.Sum.parse_dsum t p f g)
(LowParse.Spec.Sum.parse_dsum_type_of_tag' t f g k)
(LowParse.Low.Sum.clens_dsum_payload t k) | Prims.Tot | [
"total"
] | [] | [
"LowParse.Spec.Base.parser_kind",
"LowParse.Spec.Sum.dsum",
"LowParse.Spec.Base.parser",
"LowParse.Spec.Sum.dsum_repr_type",
"LowParse.Spec.Sum.dsum_known_key",
"Prims.dtuple2",
"LowParse.Spec.Sum.dsum_type_of_known_tag",
"LowParse.Spec.Sum.dsum_type_of_unknown_tag",
"LowParse.Spec.Sum.dsum_key",
"LowParse.Low.Sum.gaccessor_clens_dsum_payload'",
"Prims.unit",
"LowParse.Low.Base.Spec.gaccessor_prop_equiv",
"LowParse.Spec.Sum.parse_dsum_kind",
"LowParse.Spec.Sum.dsum_type",
"LowParse.Spec.Sum.parse_dsum",
"LowParse.Spec.Sum.parse_dsum_cases_kind",
"LowParse.Spec.Sum.dsum_type_of_tag",
"LowParse.Spec.Sum.parse_dsum_type_of_tag'",
"LowParse.Low.Sum.clens_dsum_payload",
"FStar.Classical.forall_intro_2",
"LowParse.Bytes.bytes",
"Prims.l_imp",
"Prims.l_and",
"Prims.eq2",
"FStar.Pervasives.Native.option",
"LowParse.Spec.Base.parser_subkind",
"LowParse.Spec.Base.__proj__Mkparser_kind'__item__parser_kind_subkind",
"FStar.Pervasives.Native.Some",
"LowParse.Spec.Base.ParserStrong",
"LowParse.Low.Base.Spec.gaccessor_pre",
"LowParse.Spec.Base.no_lookahead_on_precond",
"Prims.nat",
"FStar.Classical.move_requires",
"LowParse.Low.Sum.gaccessor_clens_dsum_payload_no_lookahead",
"Prims.l_True",
"Prims.squash",
"Prims.Nil",
"FStar.Pervasives.pattern",
"LowParse.Spec.Base.injective_precond",
"LowParse.Low.Sum.gaccessor_clens_dsum_payload_injective",
"LowParse.Low.Base.Spec.gaccessor"
] | [] | false | false | false | false | false | let gaccessor_clens_dsum_payload
(#kt: parser_kind)
(t: dsum)
(p: parser kt (dsum_repr_type t))
(f: (x: dsum_known_key t -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x))))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
(k: dsum_key t)
: Tot
(gaccessor (parse_dsum t p f g) (parse_dsum_type_of_tag' t f g k) (clens_dsum_payload t k)) =
| Classical.forall_intro_2 (fun x ->
Classical.move_requires (gaccessor_clens_dsum_payload_injective t p f g k x));
Classical.forall_intro_2 (fun x ->
Classical.move_requires (gaccessor_clens_dsum_payload_no_lookahead t p f g k x));
gaccessor_prop_equiv (parse_dsum t p f g)
(parse_dsum_type_of_tag' t f g k)
(clens_dsum_payload t k)
(gaccessor_clens_dsum_payload' t p f g k);
gaccessor_clens_dsum_payload' t p f g k | false |
SimplePrintfReify.fst | SimplePrintfReify.bind_ex | val bind_ex : (a:Type) -> (b:Type) -> (f:ex a) -> (g:a -> Tot (ex b)) -> Tot (ex b) | val bind_ex : (a:Type) -> (b:Type) -> (f:ex a) -> (g:a -> Tot (ex b)) -> Tot (ex b) | let bind_ex a b f g = fun _ ->
let r = f () in
match r with
| None -> None
| Some x -> g x () | {
"file_name": "examples/printf/SimplePrintfReify.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 20,
"end_line": 41,
"start_col": 0,
"start_line": 37
} | (*
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 agreed to in writing, software
distributed under the License is distributed on an "AS IS" BASIS,
WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
See the License for the specific language governing permissions and
limitations under the License.
*)
module SimplePrintfReify
open FStar.Char
open FStar.String
module List = FStar.List.Tot
// A variant of SimplePrintf that uses reify on the Ex implementation
// of parse_format
// For a start here's an alpha renamed version of Ex to avoid clashes
// with the prims variant of Ex (which is not defined using dm4free
// and is not marked as `total`)
(* The underlying representation type *)
let ex (a:Type) = unit -> M (option a)
(* Monad definition *)
val return_ex : (a:Type) -> (x:a) -> Tot (ex a)
let return_ex a x = fun _ -> Some x | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.String.fsti.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.fst.checked",
"FStar.Char.fsti.checked"
],
"interface_file": false,
"source_file": "SimplePrintfReify.fst"
} | [
{
"abbrev": true,
"full_module": "FStar.List.Tot",
"short_module": "List"
},
{
"abbrev": false,
"full_module": "FStar.String",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Char",
"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",
"short_module": null
}
] | {
"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_elim_box": false,
"smtencoding_l_arith_repr": "boxwrap",
"smtencoding_nl_arith_repr": "boxwrap",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": true,
"z3cliopt": [],
"z3refresh": false,
"z3rlimit": 5,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | false | a: Type -> b: Type -> f: SimplePrintfReify.ex a -> g: (g: a -> SimplePrintfReify.ex b)
-> SimplePrintfReify.ex b | Prims.Tot | [
"total"
] | [] | [
"SimplePrintfReify.ex",
"Prims.unit",
"FStar.Pervasives.Native.None",
"FStar.Pervasives.Native.option"
] | [] | false | false | false | true | false | let bind_ex a b f g =
| fun _ ->
let r = f () in
match r with
| None -> None
| Some x -> g x () | false |
SimplePrintfReify.fst | SimplePrintfReify.dir_type | val dir_type (ds: list dir) : Tot Type0 | val dir_type (ds: list dir) : Tot Type0 | let rec dir_type (ds:list dir) : Tot Type0 =
match ds with
| [] -> string
| Lit c :: ds' -> dir_type ds'
| Arg a :: ds' -> arg_type a -> Tot (dir_type ds') | {
"file_name": "examples/printf/SimplePrintfReify.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 52,
"end_line": 96,
"start_col": 0,
"start_line": 92
} | (*
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 agreed to in writing, software
distributed under the License is distributed on an "AS IS" BASIS,
WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
See the License for the specific language governing permissions and
limitations under the License.
*)
module SimplePrintfReify
open FStar.Char
open FStar.String
module List = FStar.List.Tot
// A variant of SimplePrintf that uses reify on the Ex implementation
// of parse_format
// For a start here's an alpha renamed version of Ex to avoid clashes
// with the prims variant of Ex (which is not defined using dm4free
// and is not marked as `total`)
(* The underlying representation type *)
let ex (a:Type) = unit -> M (option a)
(* Monad definition *)
val return_ex : (a:Type) -> (x:a) -> Tot (ex a)
let return_ex a x = fun _ -> Some x
val bind_ex : (a:Type) -> (b:Type) -> (f:ex a) -> (g:a -> Tot (ex b)) -> Tot (ex b)
let bind_ex a b f g = fun _ ->
let r = f () in
match r with
| None -> None
| Some x -> g x ()
(* DMFF does not support yet polymorphic actions *)
(* Returning something in [False] allow to derive the usual raise below *)
let raise_ex (_:exn) : Tot (ex False) = fun _ -> None
(* Define the new effect using DM4F *)
total reifiable reflectable new_effect {
XEXN : (a:Type) -> Effect
with repr = ex
; bind = bind_ex
; return = return_ex
; raise = raise_ex
}
(* A lift from `Pure´ into the new effect *)
(* unfold let lift_pure_ex_wp (a:Type) (wp:pure_wp a) (_:unit) (p:XEXN?.post a) = *)
(* wp (fun a -> p (Some a)) *)
(* sub_effect PURE ~> XEXN = lift_pure_ex_wp *)
reifiable
let raise (#a:Type0) (e:exn) : XEXN a (fun _ p -> p None)
= let x = XEXN?.raise e in begin match x with end
(* An effect to alias easily write pre- and postconditions *)
(* Note: we use Type0 instead of XEXN.pre to avoid having to thunk everything. *)
effect Xexn (a:Type) (pre:Type0) (post:XEXN?.post a) =
XEXN a (fun (_:unit) (p:XEXN?.post a) -> pre /\
(forall (r:option a). (pre /\ post r) ==> p r))
(* Another alias. Ex a is the effect type for total exception-throwing
* programs. i.e. Any program of type `Ex a´ will throw or finish
* correctly, but never loop. *)
effect Xex (a:Type) = XEXN a (fun _ p -> forall (x:option a). p x)
// arguments to printf
type arg =
| Bool | Int | Char | String
// directives to printf
type dir =
| Lit : char -> dir
| Arg : arg -> dir
let arg_type (a:arg) : Tot Type0 =
match a with
| Bool -> bool
| Int -> int
| Char -> char
| String -> string | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.String.fsti.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.fst.checked",
"FStar.Char.fsti.checked"
],
"interface_file": false,
"source_file": "SimplePrintfReify.fst"
} | [
{
"abbrev": true,
"full_module": "FStar.List.Tot",
"short_module": "List"
},
{
"abbrev": false,
"full_module": "FStar.String",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Char",
"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",
"short_module": null
}
] | {
"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_elim_box": false,
"smtencoding_l_arith_repr": "boxwrap",
"smtencoding_nl_arith_repr": "boxwrap",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": true,
"z3cliopt": [],
"z3refresh": false,
"z3rlimit": 5,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | false | ds: Prims.list SimplePrintfReify.dir -> Type0 | Prims.Tot | [
"total"
] | [] | [
"Prims.list",
"SimplePrintfReify.dir",
"Prims.string",
"FStar.String.char",
"SimplePrintfReify.dir_type",
"SimplePrintfReify.arg",
"SimplePrintfReify.arg_type"
] | [
"recursion"
] | false | false | false | true | true | let rec dir_type (ds: list dir) : Tot Type0 =
| match ds with
| [] -> string
| Lit c :: ds' -> dir_type ds'
| Arg a :: ds' -> arg_type a -> Tot (dir_type ds') | false |
SimplePrintfReify.fst | SimplePrintfReify.parse_format | val parse_format (s: list char) : Xex (list dir) | val parse_format (s: list char) : Xex (list dir) | let rec parse_format (s:list char) : Xex (list dir) =
match s with
| [] -> []
| '%' :: c :: s' ->
let d =
match c with
| '%' -> Lit '%'
| 'b' -> Arg Bool
| 'd' -> Arg Int
| 'c' -> Arg Char
| 's' -> Arg String
| _ -> raise InvalidFormatString
in let x = parse_format s' in d :: x
| '%' :: [] -> raise InvalidFormatString
| c :: s' -> let x = parse_format s' in Lit c :: x | {
"file_name": "examples/printf/SimplePrintfReify.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 52,
"end_line": 135,
"start_col": 10,
"start_line": 121
} | (*
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 agreed to in writing, software
distributed under the License is distributed on an "AS IS" BASIS,
WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
See the License for the specific language governing permissions and
limitations under the License.
*)
module SimplePrintfReify
open FStar.Char
open FStar.String
module List = FStar.List.Tot
// A variant of SimplePrintf that uses reify on the Ex implementation
// of parse_format
// For a start here's an alpha renamed version of Ex to avoid clashes
// with the prims variant of Ex (which is not defined using dm4free
// and is not marked as `total`)
(* The underlying representation type *)
let ex (a:Type) = unit -> M (option a)
(* Monad definition *)
val return_ex : (a:Type) -> (x:a) -> Tot (ex a)
let return_ex a x = fun _ -> Some x
val bind_ex : (a:Type) -> (b:Type) -> (f:ex a) -> (g:a -> Tot (ex b)) -> Tot (ex b)
let bind_ex a b f g = fun _ ->
let r = f () in
match r with
| None -> None
| Some x -> g x ()
(* DMFF does not support yet polymorphic actions *)
(* Returning something in [False] allow to derive the usual raise below *)
let raise_ex (_:exn) : Tot (ex False) = fun _ -> None
(* Define the new effect using DM4F *)
total reifiable reflectable new_effect {
XEXN : (a:Type) -> Effect
with repr = ex
; bind = bind_ex
; return = return_ex
; raise = raise_ex
}
(* A lift from `Pure´ into the new effect *)
(* unfold let lift_pure_ex_wp (a:Type) (wp:pure_wp a) (_:unit) (p:XEXN?.post a) = *)
(* wp (fun a -> p (Some a)) *)
(* sub_effect PURE ~> XEXN = lift_pure_ex_wp *)
reifiable
let raise (#a:Type0) (e:exn) : XEXN a (fun _ p -> p None)
= let x = XEXN?.raise e in begin match x with end
(* An effect to alias easily write pre- and postconditions *)
(* Note: we use Type0 instead of XEXN.pre to avoid having to thunk everything. *)
effect Xexn (a:Type) (pre:Type0) (post:XEXN?.post a) =
XEXN a (fun (_:unit) (p:XEXN?.post a) -> pre /\
(forall (r:option a). (pre /\ post r) ==> p r))
(* Another alias. Ex a is the effect type for total exception-throwing
* programs. i.e. Any program of type `Ex a´ will throw or finish
* correctly, but never loop. *)
effect Xex (a:Type) = XEXN a (fun _ p -> forall (x:option a). p x)
// arguments to printf
type arg =
| Bool | Int | Char | String
// directives to printf
type dir =
| Lit : char -> dir
| Arg : arg -> dir
let arg_type (a:arg) : Tot Type0 =
match a with
| Bool -> bool
| Int -> int
| Char -> char
| String -> string
let rec dir_type (ds:list dir) : Tot Type0 =
match ds with
| [] -> string
| Lit c :: ds' -> dir_type ds'
| Arg a :: ds' -> arg_type a -> Tot (dir_type ds')
let dir_type' ds = dir_type ds
let rec string_of_dirs ds (k:string -> Tot string) : Tot (dir_type ds) =
match ds with
| [] -> k ""
| Lit c :: ds' ->
coerce_eq () (
string_of_dirs ds' (fun res -> k (string_of_char c ^ res))
)
| Arg a :: ds' -> fun (x : arg_type a) ->
string_of_dirs ds' (fun res -> k (match a with
| Bool -> string_of_bool x
| Int -> string_of_int x
| Char -> string_of_char x
| String -> x) ^ res)
let example1 : string =
string_of_dirs [Arg Int; Arg String] (fun s -> s) 42 " answer"
exception InvalidFormatString | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.String.fsti.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.fst.checked",
"FStar.Char.fsti.checked"
],
"interface_file": false,
"source_file": "SimplePrintfReify.fst"
} | [
{
"abbrev": true,
"full_module": "FStar.List.Tot",
"short_module": "List"
},
{
"abbrev": false,
"full_module": "FStar.String",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Char",
"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",
"short_module": null
}
] | {
"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_elim_box": false,
"smtencoding_l_arith_repr": "boxwrap",
"smtencoding_nl_arith_repr": "boxwrap",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": true,
"z3cliopt": [],
"z3refresh": false,
"z3rlimit": 5,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | false | s: Prims.list FStar.String.char -> SimplePrintfReify.Xex (Prims.list SimplePrintfReify.dir) | SimplePrintfReify.Xex | [] | [] | [
"Prims.list",
"FStar.String.char",
"Prims.Nil",
"SimplePrintfReify.dir",
"Prims.Cons",
"SimplePrintfReify.parse_format",
"SimplePrintfReify.Lit",
"SimplePrintfReify.Arg",
"SimplePrintfReify.Bool",
"SimplePrintfReify.Int",
"SimplePrintfReify.Char",
"SimplePrintfReify.String",
"FStar.Char.char",
"SimplePrintfReify.raise",
"SimplePrintfReify.InvalidFormatString"
] | [
"recursion"
] | false | true | false | false | false | let rec parse_format (s: list char) : Xex (list dir) =
| match s with
| [] -> []
| '%' :: c :: s' ->
let d =
match c with
| '%' -> Lit '%'
| 'b' -> Arg Bool
| 'd' -> Arg Int
| 'c' -> Arg Char
| 's' -> Arg String
| _ -> raise InvalidFormatString
in
let x = parse_format s' in
d :: x
| '%' :: [] -> raise InvalidFormatString
| c :: s' ->
let x = parse_format s' in
Lit c :: x | false |
SimplePrintfReify.fst | SimplePrintfReify.yyy | val yyy : Prims.logical | let yyy = parse_format_pure ['%'] == None | {
"file_name": "examples/printf/SimplePrintfReify.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 41,
"end_line": 147,
"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 agreed to in writing, software
distributed under the License is distributed on an "AS IS" BASIS,
WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
See the License for the specific language governing permissions and
limitations under the License.
*)
module SimplePrintfReify
open FStar.Char
open FStar.String
module List = FStar.List.Tot
// A variant of SimplePrintf that uses reify on the Ex implementation
// of parse_format
// For a start here's an alpha renamed version of Ex to avoid clashes
// with the prims variant of Ex (which is not defined using dm4free
// and is not marked as `total`)
(* The underlying representation type *)
let ex (a:Type) = unit -> M (option a)
(* Monad definition *)
val return_ex : (a:Type) -> (x:a) -> Tot (ex a)
let return_ex a x = fun _ -> Some x
val bind_ex : (a:Type) -> (b:Type) -> (f:ex a) -> (g:a -> Tot (ex b)) -> Tot (ex b)
let bind_ex a b f g = fun _ ->
let r = f () in
match r with
| None -> None
| Some x -> g x ()
(* DMFF does not support yet polymorphic actions *)
(* Returning something in [False] allow to derive the usual raise below *)
let raise_ex (_:exn) : Tot (ex False) = fun _ -> None
(* Define the new effect using DM4F *)
total reifiable reflectable new_effect {
XEXN : (a:Type) -> Effect
with repr = ex
; bind = bind_ex
; return = return_ex
; raise = raise_ex
}
(* A lift from `Pure´ into the new effect *)
(* unfold let lift_pure_ex_wp (a:Type) (wp:pure_wp a) (_:unit) (p:XEXN?.post a) = *)
(* wp (fun a -> p (Some a)) *)
(* sub_effect PURE ~> XEXN = lift_pure_ex_wp *)
reifiable
let raise (#a:Type0) (e:exn) : XEXN a (fun _ p -> p None)
= let x = XEXN?.raise e in begin match x with end
(* An effect to alias easily write pre- and postconditions *)
(* Note: we use Type0 instead of XEXN.pre to avoid having to thunk everything. *)
effect Xexn (a:Type) (pre:Type0) (post:XEXN?.post a) =
XEXN a (fun (_:unit) (p:XEXN?.post a) -> pre /\
(forall (r:option a). (pre /\ post r) ==> p r))
(* Another alias. Ex a is the effect type for total exception-throwing
* programs. i.e. Any program of type `Ex a´ will throw or finish
* correctly, but never loop. *)
effect Xex (a:Type) = XEXN a (fun _ p -> forall (x:option a). p x)
// arguments to printf
type arg =
| Bool | Int | Char | String
// directives to printf
type dir =
| Lit : char -> dir
| Arg : arg -> dir
let arg_type (a:arg) : Tot Type0 =
match a with
| Bool -> bool
| Int -> int
| Char -> char
| String -> string
let rec dir_type (ds:list dir) : Tot Type0 =
match ds with
| [] -> string
| Lit c :: ds' -> dir_type ds'
| Arg a :: ds' -> arg_type a -> Tot (dir_type ds')
let dir_type' ds = dir_type ds
let rec string_of_dirs ds (k:string -> Tot string) : Tot (dir_type ds) =
match ds with
| [] -> k ""
| Lit c :: ds' ->
coerce_eq () (
string_of_dirs ds' (fun res -> k (string_of_char c ^ res))
)
| Arg a :: ds' -> fun (x : arg_type a) ->
string_of_dirs ds' (fun res -> k (match a with
| Bool -> string_of_bool x
| Int -> string_of_int x
| Char -> string_of_char x
| String -> x) ^ res)
let example1 : string =
string_of_dirs [Arg Int; Arg String] (fun s -> s) 42 " answer"
exception InvalidFormatString
(* TODO: can we get rid of the two `let x` or are they really required? *)
reifiable let rec parse_format (s:list char) : Xex (list dir) =
match s with
| [] -> []
| '%' :: c :: s' ->
let d =
match c with
| '%' -> Lit '%'
| 'b' -> Arg Bool
| 'd' -> Arg Int
| 'c' -> Arg Char
| 's' -> Arg String
| _ -> raise InvalidFormatString
in let x = parse_format s' in d :: x
| '%' :: [] -> raise InvalidFormatString
| c :: s' -> let x = parse_format s' in Lit c :: x
let parse_format_pure (s:list char) : option (list dir) =
reify (parse_format s) ()
let rec parse_format_string (s:string) : Tot (option (list dir)) =
parse_format_pure (list_of_string s)
let sprintf (s:string{normalize_term #bool (Some? (parse_format_string s))})
: Tot (normalize_term (dir_type (Some?.v (parse_format_string s)))) =
string_of_dirs (Some?.v (parse_format_string s)) (fun s -> s) | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.String.fsti.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.fst.checked",
"FStar.Char.fsti.checked"
],
"interface_file": false,
"source_file": "SimplePrintfReify.fst"
} | [
{
"abbrev": true,
"full_module": "FStar.List.Tot",
"short_module": "List"
},
{
"abbrev": false,
"full_module": "FStar.String",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Char",
"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",
"short_module": null
}
] | {
"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_elim_box": false,
"smtencoding_l_arith_repr": "boxwrap",
"smtencoding_nl_arith_repr": "boxwrap",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": true,
"z3cliopt": [],
"z3refresh": false,
"z3rlimit": 5,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | false | Prims.logical | Prims.Tot | [
"total"
] | [] | [
"Prims.eq2",
"FStar.Pervasives.Native.option",
"Prims.list",
"SimplePrintfReify.dir",
"SimplePrintfReify.parse_format_pure",
"Prims.Cons",
"FStar.String.char",
"Prims.Nil",
"FStar.Pervasives.Native.None"
] | [] | false | false | false | true | true | let yyy =
| parse_format_pure ['%'] == None | false |
|
LowParse.Low.Sum.fst | LowParse.Low.Sum.gaccessor_clens_dsum_unknown_payload | val gaccessor_clens_dsum_unknown_payload
(#kt: parser_kind)
(t: dsum)
(p: parser kt (dsum_repr_type t))
(f: (x: dsum_known_key t -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x))))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
: Tot (gaccessor (parse_dsum t p f g) g (clens_dsum_unknown_payload t)) | val gaccessor_clens_dsum_unknown_payload
(#kt: parser_kind)
(t: dsum)
(p: parser kt (dsum_repr_type t))
(f: (x: dsum_known_key t -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x))))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
: Tot (gaccessor (parse_dsum t p f g) g (clens_dsum_unknown_payload t)) | let gaccessor_clens_dsum_unknown_payload
(#kt: parser_kind)
(t: dsum)
(p: parser kt (dsum_repr_type t))
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
: Tot (gaccessor (parse_dsum t p f g) g (clens_dsum_unknown_payload t))
= Classical.forall_intro_2 (fun x -> Classical.move_requires (gaccessor_clens_dsum_unknown_payload_injective t p f g x));
Classical.forall_intro_2 (fun x -> Classical.move_requires (gaccessor_clens_dsum_unknown_payload_no_lookahead t p f g x));
gaccessor_prop_equiv (parse_dsum t p f g) g (clens_dsum_unknown_payload t) (gaccessor_clens_dsum_unknown_payload' t p f g);
gaccessor_clens_dsum_unknown_payload' t p f g | {
"file_name": "src/lowparse/LowParse.Low.Sum.fst",
"git_rev": "00217c4a89f5ba56002ba9aa5b4a9d5903bfe9fa",
"git_url": "https://github.com/project-everest/everparse.git",
"project_name": "everparse"
} | {
"end_col": 47,
"end_line": 2030,
"start_col": 0,
"start_line": 2019
} | module LowParse.Low.Sum
include LowParse.Low.Enum
include LowParse.Spec.Sum
module U32 = FStar.UInt32
module HST = FStar.HyperStack.ST
module B = LowStar.Buffer
module Cast = FStar.Int.Cast
module U64 = FStar.UInt64
inline_for_extraction
let validate_sum_cases_aux
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(vc: ((x: sum_key t) -> Tot (validator (dsnd (pc x)))))
(k: sum_key t)
: Tot (validator (parse_sum_cases t pc k))
= [@inline_let]
let _ = synth_sum_case_injective t k in
validate_synth
(validate_weaken
(weaken_parse_cases_kind t pc)
(vc k)
()
)
(synth_sum_case t k)
()
inline_for_extraction
let validate_sum_cases_t
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot Type
= validator (parse_sum_cases t pc k)
let validate_sum_cases_t_eq
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
(x y : validate_sum_cases_t t pc k)
: GTot Type0
= True
inline_for_extraction
let validate_sum_cases_t_if
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (if_combinator _ (validate_sum_cases_t_eq t pc k))
= fun cond (sv_true: cond_true cond -> Tot (validate_sum_cases_t t pc k)) (sv_false: cond_false cond -> Tot (validate_sum_cases_t t pc k)) #rrel #rel input pos ->
if cond
then sv_true () input pos
else sv_false () input pos
inline_for_extraction
let validate_sum_cases
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(vc: ((x: sum_key t) -> Tot (validator (dsnd (pc x)))))
(destr: dep_enum_destr (sum_enum t) (validate_sum_cases_t t pc))
(k: sum_key t)
: Tot (validator (parse_sum_cases t pc k))
= destr
_
(validate_sum_cases_t_if t pc)
(fun _ _ -> ())
(fun _ _ _ _ -> ())
(validate_sum_cases_aux t pc vc)
k
inline_for_extraction
let validate_sum_aux_payload_t
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
: Tot Type
= (#rrel: _) -> (#rel: _) ->
(input: slice rrel rel) ->
(pos: U64.t) ->
HST.Stack U64.t
(requires (fun h -> live_slice h input /\ U64.v pos <= U32.v input.len))
(ensures (fun h res h' ->
B.modifies B.loc_none h h' /\ (
match k with
| Unknown _ -> is_error res
| Known k' ->
if is_success res
then
valid_pos (dsnd (pc k')) h input (uint64_to_uint32 pos) (uint64_to_uint32 res)
else
(~ (valid (dsnd (pc k')) h input (uint64_to_uint32 pos)))
)))
let validate_sum_aux_payload_eq
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
: Tot (validate_sum_aux_payload_t t pc k -> validate_sum_aux_payload_t t pc k -> GTot Type0)
= fun _ _ -> True
inline_for_extraction
let validate_sum_aux_payload_if'
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
(cond: bool)
(ift: ((cond_true cond) -> Tot (validate_sum_aux_payload_t t pc k)))
(iff: ((cond_false cond) -> Tot (validate_sum_aux_payload_t t pc k)))
: Tot (validate_sum_aux_payload_t t pc k)
= fun #rrel #rel input pos ->
if cond
then begin
(ift () <: validate_sum_aux_payload_t t pc k) input pos
end else
(iff () <: validate_sum_aux_payload_t t pc k) input pos
inline_for_extraction
let validate_sum_aux_payload_if
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
: Tot (if_combinator _ (validate_sum_aux_payload_eq t pc k))
= validate_sum_aux_payload_if' t pc k
#push-options "--z3rlimit 64 --z3cliopt smt.arith.nl=false --using_facts_from '* -FStar.Int.Cast -LowParse.BitFields'"
// --query_stats --smtencoding.elim_box true --smtencoding.l_arith_repr native --z3refresh"
inline_for_extraction
let validate_sum_aux
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(v: validator p)
(p32: leaf_reader p)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(v_payload: ((k: sum_repr_type t)) -> Tot (validate_sum_aux_payload_t t pc (maybe_enum_key_of_repr (sum_enum t) k)))
: Tot (validator (parse_sum t p pc))
= fun #rrel #rel input pos ->
let h = HST.get () in
[@inline_let]
let _ = parse_sum_eq'' t p pc (bytes_of_slice_from h input (uint64_to_uint32 pos)) in
[@inline_let]
let _ = valid_facts (parse_sum t p pc) h input (uint64_to_uint32 pos) in
[@inline_let]
let _ = valid_facts p h input (uint64_to_uint32 pos) in
let len_after_tag = v input pos in
if is_error len_after_tag
then len_after_tag
else begin
let h1 = HST.get () in
let k' = p32 input (uint64_to_uint32 pos) in
[@inline_let]
let _ =
match maybe_enum_key_of_repr (sum_enum t) k' with
| Known k -> valid_facts (dsnd (pc k)) h input (uint64_to_uint32 len_after_tag)
| _ -> ()
in
v_payload k' input len_after_tag
end
#pop-options
inline_for_extraction
let validate_sum_aux_payload'
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (validator (dsnd (pc x)))))
(k: maybe_enum_key (sum_enum t))
: Tot (validate_sum_aux_payload_t t pc k)
= fun #rrel #rel input pos ->
match k with
| Known k ->
[@inline_let]
let _ = synth_sum_case_injective t k in
pc32 k input pos
// validate_synth (pc32 k) (synth_sum_case t k) () input pos
| _ -> validator_error_generic
inline_for_extraction
let validate_sum_aux_payload
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (validator (dsnd (pc x)))))
(destr: dep_maybe_enum_destr_t (sum_enum t) (validate_sum_aux_payload_t t pc))
(k: sum_repr_type t)
: Tot (validate_sum_aux_payload_t t pc (maybe_enum_key_of_repr (sum_enum t) k))
= destr (validate_sum_aux_payload_eq t pc) (validate_sum_aux_payload_if t pc) (fun _ _ -> ()) (fun _ _ _ _ -> ()) (validate_sum_aux_payload' t pc pc32) k
inline_for_extraction
let validate_sum
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(v: validator p)
(p32: leaf_reader p)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (validator (dsnd (pc x)))))
(destr: dep_maybe_enum_destr_t (sum_enum t) (validate_sum_aux_payload_t t pc))
: Tot (validator (parse_sum t p pc))
= validate_sum_aux t v p32 pc (validate_sum_aux_payload t pc pc32 destr)
module HS = FStar.HyperStack
#push-options "--z3rlimit 256 --z3cliopt smt.arith.nl=false --initial_ifuel 8 --max_ifuel 8 --initial_fuel 2 --max_fuel 2"
#restart-solver
let valid_sum_intro
(h: HS.mem)
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: Lemma
(requires (
valid (parse_enum_key p (sum_enum t)) h input pos /\ (
let k = contents (parse_enum_key p (sum_enum t)) h input pos in
valid (dsnd (pc k)) h input (get_valid_pos (parse_enum_key p (sum_enum t)) h input pos)
)))
(ensures (
let k = contents (parse_enum_key p (sum_enum t)) h input pos in
let pos_payload = get_valid_pos (parse_enum_key p (sum_enum t)) h input pos in
valid_content_pos
(parse_sum t p pc) h input pos
(synth_sum_case t k (contents (dsnd (pc k)) h input pos_payload))
(get_valid_pos (dsnd (pc k)) h input pos_payload)
))
= valid_facts (parse_enum_key p (sum_enum t)) h input pos;
let k = contents (parse_enum_key p (sum_enum t)) h input pos in
let pos_payload = get_valid_pos (parse_enum_key p (sum_enum t)) h input pos in
valid_facts (dsnd (pc k)) h input pos_payload;
valid_facts (parse_sum t p pc) h input pos;
parse_sum_eq t p pc (bytes_of_slice_from h input pos)
#pop-options
inline_for_extraction
let finalize_sum_case
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(s: serializer p)
(w: leaf_writer_strong s)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(destr: enum_repr_of_key'_t (sum_enum t))
(k: sum_key t)
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: HST.Stack unit
(requires (fun h ->
let len_tag = serialized_length (serialize_enum_key _ s (sum_enum t)) k in
U32.v pos + len_tag < 4294967296 /\ (
let pos_payload = pos `U32.add` U32.uint_to_t len_tag in
valid (dsnd (pc k)) h input pos_payload /\
writable input.base (U32.v pos) (U32.v pos_payload) h
)))
(ensures (fun h _ h' ->
let len_tag = serialized_length (serialize_enum_key _ s (sum_enum t)) k in
let pos_payload = pos `U32.add` U32.uint_to_t len_tag in
B.modifies (loc_slice_from_to input pos pos_payload) h h' /\
valid_content_pos (parse_sum t p pc) h' input pos (synth_sum_case t k (contents (dsnd (pc k)) h input pos_payload)) (get_valid_pos (dsnd (pc k)) h input pos_payload)
))
= let pos1 = write_enum_key w (sum_enum t) destr k input pos in
let h = HST.get () in
[@inline_let]
let _ = valid_sum_intro h t p pc input pos in
()
inline_for_extraction
let jump_sum_cases_aux
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(vc: ((x: sum_key t) -> Tot (jumper (dsnd (pc x)))))
(k: sum_key t)
: Tot (jumper (parse_sum_cases t pc k))
= [@inline_let]
let _ = synth_sum_case_injective t k in
jump_synth
(jump_weaken
(weaken_parse_cases_kind t pc)
(vc k)
()
)
(synth_sum_case t k)
()
inline_for_extraction
let jump_sum_cases_t
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot Type
= jumper (parse_sum_cases t pc k)
let jump_sum_cases_t_eq
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
(x y : jump_sum_cases_t t pc k)
: GTot Type0
= True
inline_for_extraction
let jump_sum_cases_t_if
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (if_combinator _ (jump_sum_cases_t_eq t pc k))
= fun cond (sv_true: cond_true cond -> Tot (jump_sum_cases_t t pc k)) (sv_false: cond_false cond -> Tot (jump_sum_cases_t t pc k)) #rrel #rel input pos ->
if cond
then sv_true () input pos
else sv_false () input pos
inline_for_extraction
let jump_sum_cases
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(vc: ((x: sum_key t) -> Tot (jumper (dsnd (pc x)))))
(destr: dep_enum_destr (sum_enum t) (jump_sum_cases_t t pc))
(k: sum_key t)
: Tot (jumper (parse_sum_cases t pc k))
= destr
_
(jump_sum_cases_t_if t pc)
(fun _ _ -> ())
(fun _ _ _ _ -> ())
(jump_sum_cases_aux t pc vc)
k
inline_for_extraction
let jump_sum_aux_payload_t
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
: Tot Type
= (#rrel: _) -> (#rel: _) ->
(input: slice rrel rel) ->
(pos: U32.t) ->
HST.Stack U32.t
(requires (fun h -> live_slice h input /\ U32.v pos <= U32.v input.len /\ (
match k with
| Unknown _ -> False
| Known k' -> valid (dsnd (pc k')) h input pos
)))
(ensures (fun h res h' ->
B.modifies B.loc_none h h' /\ (
match k with
| Unknown _ -> False
| Known k' ->
valid_pos (dsnd (pc k')) h input pos res
)))
let jump_sum_aux_payload_eq
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
: Tot (jump_sum_aux_payload_t t pc k -> jump_sum_aux_payload_t t pc k -> GTot Type0)
= fun _ _ -> True
inline_for_extraction
let jump_sum_aux_payload_if'
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
(cond: bool)
(ift: ((cond_true cond) -> Tot (jump_sum_aux_payload_t t pc k)))
(iff: ((cond_false cond) -> Tot (jump_sum_aux_payload_t t pc k)))
: Tot (jump_sum_aux_payload_t t pc k)
= fun #rrel #rel input pos ->
if cond
then begin
(ift () <: jump_sum_aux_payload_t t pc k) input pos
end else
(iff () <: jump_sum_aux_payload_t t pc k) input pos
inline_for_extraction
let jump_sum_aux_payload_if
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
: Tot (if_combinator _ (jump_sum_aux_payload_eq t pc k))
= jump_sum_aux_payload_if' t pc k
let parse_sum_eq3
(#kt: parser_kind)
(t: sum)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(input: bytes)
(k' : sum_repr_type t)
(consumed_k: consumed_length input)
: Lemma
(requires (Some? (parse (parse_sum t p pc) input) /\ parse p input == Some (k', consumed_k)))
(ensures (
let input_k = Seq.slice input consumed_k (Seq.length input) in
let k = maybe_enum_key_of_repr (sum_enum t) k' in
begin match k with
| Known k ->
Some? (parse (dsnd (pc k)) input_k)
| _ -> False
end
))
= parse_sum_eq'' t p pc input
let parse_sum_eq4
(#kt: parser_kind)
(t: sum)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(input: bytes)
(k' : sum_repr_type t)
(consumed_k: consumed_length input)
(consumed_payload: nat)
: Lemma
(requires (Some? (parse (parse_sum t p pc) input) /\ parse p input == Some (k', consumed_k) /\ (
let input_k = Seq.slice input consumed_k (Seq.length input) in
let k = maybe_enum_key_of_repr (sum_enum t) k' in
begin match k with
| Known k ->
Some? (parse (dsnd (pc k)) input_k) /\ (
let Some (_, consumed_payload') = parse (dsnd (pc k)) input_k in
consumed_payload' == consumed_payload
)
| _ -> False
end
)))
(ensures (
let Some (_, consumed) = parse (parse_sum t p pc) input in
consumed == consumed_k + consumed_payload
))
= parse_sum_eq'' t p pc input
#push-options "--z3rlimit 16"
let valid_sum_elim
(h: HS.mem)
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(#rrel: _) (#rel: _)
(input: slice rrel rel)
(pos: U32.t)
: Lemma
(requires (
valid (parse_sum t p pc) h input pos
))
(ensures (
valid p h input pos /\ (
let pos_payload = get_valid_pos p h input pos in
let k' = maybe_enum_key_of_repr (sum_enum t) (contents p h input pos) in
match k' with
| Known k ->
k == sum_tag_of_data t (contents (parse_sum t p pc) h input pos) /\
valid (dsnd (pc k)) h input pos_payload /\
valid_pos
(parse_sum t p pc) h input pos
(get_valid_pos (dsnd (pc k)) h input pos_payload)
| _ -> False
)))
= let sinput = bytes_of_slice_from h input pos in
let _ = parse_sum_eq'' t p pc sinput in
[@inline_let]
let _ = valid_facts (parse_sum t p pc) h input pos in
let Some (k', consumed_k) = parse p sinput in
let pos_after_tag = U32.uint_to_t (U32.v pos + consumed_k) in
[@inline_let]
let _ = valid_facts p h input pos in
assert (valid_content_pos p h input pos k' pos_after_tag);
match maybe_enum_key_of_repr (sum_enum t) k' with
| Known k -> valid_facts (dsnd (pc k)) h input pos_after_tag
| _ -> ()
#pop-options
let valid_sum_elim_tag
(h: HS.mem)
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: Lemma
(requires (
valid (parse_sum t p pc) h input pos
))
(ensures (
valid (parse_enum_key p (sum_enum t)) h input pos /\
contents (parse_enum_key p (sum_enum t)) h input pos == sum_tag_of_data t (contents (parse_sum t p pc) h input pos)
))
= let _ = parse_sum_eq' t p pc (bytes_of_slice_from h input pos) in
let _ = valid_facts (parse_sum t p pc) h input pos in
let _ = valid_facts (parse_enum_key p (sum_enum t)) h input pos in
()
inline_for_extraction
let read_sum_tag
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(p32: leaf_reader p)
(destr: dep_maybe_enum_destr_t (sum_enum t) (read_enum_key_t (sum_enum t)))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: HST.Stack (sum_key t)
(requires (fun h ->
valid (parse_sum t p pc) h input pos
))
(ensures (fun h res h' ->
B.modifies B.loc_none h h' /\
res == sum_tag_of_data t (contents (parse_sum t p pc) h input pos)
))
= let h = HST.get () in
[@inline_let] let _ = valid_sum_elim_tag h t p pc input pos in
read_enum_key p32 (sum_enum t) destr input pos
inline_for_extraction
let jump_sum_aux
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(v: jumper p)
(p32: leaf_reader p)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(v_payload: ((k: sum_repr_type t)) -> Tot (jump_sum_aux_payload_t t pc (maybe_enum_key_of_repr (sum_enum t) k)))
: Tot (jumper (parse_sum t p pc))
= fun #rrel #rel input pos ->
let h = HST.get () in
[@inline_let]
let _ = valid_sum_elim h t p pc input pos in
let pos_after_tag = v input pos in
let k' = p32 input pos in
v_payload k' input pos_after_tag
inline_for_extraction
let jump_sum_aux_payload'
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (jumper (dsnd (pc x)))))
(k: maybe_enum_key (sum_enum t))
: Tot (jump_sum_aux_payload_t t pc k)
= fun #rrel #rel input pos ->
match k with
| Known k ->
[@inline_let]
let _ = synth_sum_case_injective t k in
pc32 k input pos
| _ -> 0ul // dummy, but we MUST NOT remove this branch, otherwise extraction fails
inline_for_extraction
let jump_sum_aux_payload
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (jumper (dsnd (pc x)))))
(destr: dep_maybe_enum_destr_t (sum_enum t) (jump_sum_aux_payload_t t pc))
(k: sum_repr_type t)
: Tot (jump_sum_aux_payload_t t pc (maybe_enum_key_of_repr (sum_enum t) k))
= destr (jump_sum_aux_payload_eq t pc) (jump_sum_aux_payload_if t pc) (fun _ _ -> ()) (fun _ _ _ _ -> ()) (jump_sum_aux_payload' t pc pc32) k
inline_for_extraction
let jump_sum
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(v: jumper p)
(p32: leaf_reader p)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (jumper (dsnd (pc x)))))
(destr: dep_maybe_enum_destr_t (sum_enum t) (jump_sum_aux_payload_t t pc))
: Tot (jumper (parse_sum t p pc))
= jump_sum_aux t v p32 pc (jump_sum_aux_payload t pc pc32 destr)
inline_for_extraction
let read_sum_cases'
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (leaf_reader (dsnd (pc x)))))
(k: sum_key t)
: Tot (leaf_reader (parse_sum_cases' t pc k))
= [@inline_let]
let _ = synth_sum_case_injective t k in
read_synth'
(dsnd (pc k))
(synth_sum_case t k)
(pc32 k)
()
inline_for_extraction
let read_sum_cases_t
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot Type
= leaf_reader (parse_sum_cases' t pc k)
let read_sum_cases_t_eq
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
(x y : read_sum_cases_t t pc k)
: GTot Type0
= True
inline_for_extraction
let read_sum_cases_t_if
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (if_combinator _ (read_sum_cases_t_eq t pc k))
= fun cond (sv_true: cond_true cond -> Tot (read_sum_cases_t t pc k)) (sv_false: cond_false cond -> Tot (read_sum_cases_t t pc k)) #_ #_ input pos ->
if cond
then (sv_true () input pos)
else (sv_false () input pos)
inline_for_extraction
let read_sum_cases
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (leaf_reader (dsnd (pc x)))))
(destr: dep_enum_destr (sum_enum t) (read_sum_cases_t t pc))
(k: sum_key t)
: Tot (leaf_reader (parse_sum_cases' t pc k))
= destr
_
(read_sum_cases_t_if t pc)
(fun _ _ -> ())
(fun _ _ _ _ -> ())
(read_sum_cases' t pc pc32)
k
#push-options "--z3rlimit 32"
inline_for_extraction
let read_sum
(#kt: parser_kind)
(t: sum)
(p: parser kt (sum_repr_type t))
(p32: leaf_reader (parse_enum_key p (sum_enum t)))
(j: jumper p)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (leaf_reader (dsnd (pc x)))))
(destr: dep_enum_destr (sum_enum t) (read_sum_cases_t t pc))
: Tot (leaf_reader (parse_sum t p pc))
=
fun #_ #_ input pos ->
let h = HST.get () in
valid_facts (parse_sum t p pc) h input pos;
parse_sum_eq' t p pc (bytes_of_slice_from h input pos);
valid_facts (parse_enum_key p (sum_enum t)) h input pos;
let k = p32 input pos in
let pos' = jump_enum_key j (sum_enum t) input pos in
valid_facts (parse_sum_cases' t pc k) h input pos' ;
read_sum_cases t pc pc32 destr k input pos'
#pop-options
inline_for_extraction
let serialize32_sum_cases_t
(t: sum)
(#pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(sc: ((x: sum_key t) -> Tot (serializer (dsnd (pc x)))))
(k: sum_key t)
: Tot Type
= serializer32 (serialize_sum_cases t pc sc k)
let serialize32_sum_cases_t_eq
(t: sum)
(#pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(sc: ((x: sum_key t) -> Tot (serializer (dsnd (pc x)))))
(k: sum_key t)
(x y: serialize32_sum_cases_t t sc k)
: GTot Type0
= True
inline_for_extraction
let serialize32_sum_cases_t_if
(t: sum)
(#pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(sc: ((x: sum_key t) -> Tot (serializer (dsnd (pc x)))))
(k: sum_key t)
: Tot (if_combinator _ (serialize32_sum_cases_t_eq t sc k))
= fun cond (sv_true: (cond_true cond -> Tot (serialize32_sum_cases_t t sc k))) (sv_false: (cond_false cond -> Tot (serialize32_sum_cases_t t sc k))) x #rrel #rel b pos ->
if cond
then (sv_true () x b pos)
else (sv_false () x b pos)
inline_for_extraction
let serialize32_sum_cases_aux
(t: sum)
(#pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(sc: ((x: sum_key t) -> Tot (serializer (dsnd (pc x)))))
(sc32: ((x: sum_key t) -> Tot (serializer32 (sc x))))
(k: sum_key t)
: Tot (serializer32 (serialize_sum_cases t pc sc k))
= fun x #rrel #rel b pos ->
[@inline_let] let _ =
Classical.forall_intro (parse_sum_cases_eq' t pc k);
synth_sum_case_injective t k;
synth_sum_case_inverse t k
in
serialize32_synth
(sc32 k)
(synth_sum_case t k)
(synth_sum_case_recip t k)
(fun x -> synth_sum_case_recip t k x)
()
x
b
pos
inline_for_extraction
let serialize32_sum_cases
(t: sum)
(#pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(sc: ((x: sum_key t) -> Tot (serializer (dsnd (pc x)))))
(sc32: ((x: sum_key t) -> Tot (serializer32 (sc x))))
(destr: dep_enum_destr (sum_enum t) (serialize32_sum_cases_t t sc))
(k: sum_key t)
: Tot (serializer32 (serialize_sum_cases t pc sc k))
= destr
_
(serialize32_sum_cases_t_if t sc)
(fun _ _ -> ())
(fun _ _ _ _ -> ())
(serialize32_sum_cases_aux t sc sc32)
k
inline_for_extraction
let serialize32_sum
(#kt: parser_kind)
(t: sum)
(#p: parser kt (sum_repr_type t))
(s: serializer p {kt.parser_kind_subkind == Some ParserStrong})
(s32: serializer32 (serialize_enum_key _ s (sum_enum t)))
(#pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(sc: ((x: sum_key t) -> Tot (serializer (dsnd (pc x)))))
(sc32: ((x: sum_key t) -> Tot (serializer32 (sc x))))
(destr: dep_enum_destr (sum_enum t) (serialize32_sum_cases_t t sc))
: Tot (serializer32 (serialize_sum t s sc))
= fun x #rrel #rel b pos ->
serialize_sum_eq t s sc x;
let tg = sum_tag_of_data t x in
serialize32_nondep_then_aux s32 (serialize32_sum_cases t sc sc32 destr tg) tg x b pos
let clens_sum_tag
(s: sum)
: Tot (clens (sum_type s) (sum_key s))
= {
clens_cond = (fun _ -> True);
clens_get = sum_tag_of_data s;
}
let gaccessor_sum_tag
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
: Tot (gaccessor (parse_sum t p pc) (parse_enum_key p (sum_enum t)) (clens_sum_tag t))
= gaccessor_tagged_union_tag
(parse_enum_key p (sum_enum t))
(sum_tag_of_data t)
(parse_sum_cases t pc)
inline_for_extraction
let accessor_sum_tag
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
: Tot (accessor (gaccessor_sum_tag t p pc))
= accessor_tagged_union_tag
(parse_enum_key p (sum_enum t))
(sum_tag_of_data t)
(parse_sum_cases t pc)
let clens_sum_payload
(s: sum)
(k: sum_key s)
: Tot (clens (sum_type s) (sum_type_of_tag s k))
= {
clens_cond = (fun (x: sum_type s) -> sum_tag_of_data s x == k);
clens_get = (fun (x: sum_type s) -> synth_sum_case_recip s k x <: Ghost (sum_type_of_tag s k) (requires (sum_tag_of_data s x == k)) (ensures (fun _ -> True)));
}
#push-options "--z3rlimit 32"
let gaccessor_clens_sum_payload'
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (gaccessor' (parse_sum t p pc) (dsnd (pc k)) (clens_sum_payload t k))
= fun (input: bytes) ->
parse_sum_eq'' t p pc input;
let res =
match parse p input with
| Some (_, consumed) ->
synth_sum_case_inverse t k;
synth_sum_case_injective t k;
synth_injective_synth_inverse_synth_inverse_recip (synth_sum_case t k) (synth_sum_case_recip t k) ();
(consumed)
| _ -> 0 // dummy
in
(res <: (res: _ { gaccessor_post' (parse_sum t p pc) (dsnd (pc k)) (clens_sum_payload t k) input res } ))
#push-options "--z3rlimit 64"
let gaccessor_clens_sum_payload_injective
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
(sl sl' : bytes)
: Lemma
(requires (
gaccessor_pre (parse_sum t p pc) (dsnd (pc k)) (clens_sum_payload t k) sl /\
gaccessor_pre (parse_sum t p pc) (dsnd (pc k)) (clens_sum_payload t k) sl' /\
injective_precond (parse_sum t p pc) sl sl'
))
(ensures (gaccessor_clens_sum_payload' t p pc k sl == gaccessor_clens_sum_payload' t p pc k sl'))
= parse_sum_eq'' t p pc sl;
parse_sum_eq'' t p pc sl' ;
parse_injective (parse_sum t p pc) sl sl' ;
parse_injective p sl sl'
#pop-options
let gaccessor_clens_sum_payload_no_lookahead
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
(sl sl' : bytes)
: Lemma
(requires (
(parse_sum_kind kt t pc).parser_kind_subkind == Some ParserStrong /\
gaccessor_pre (parse_sum t p pc) (dsnd (pc k)) (clens_sum_payload t k) sl /\
gaccessor_pre (parse_sum t p pc) (dsnd (pc k)) (clens_sum_payload t k) sl' /\
no_lookahead_on_precond (parse_sum t p pc) sl sl'
))
(ensures (gaccessor_clens_sum_payload' t p pc k sl == gaccessor_clens_sum_payload' t p pc k sl'))
= parse_sum_eq'' t p pc sl;
parse_sum_eq'' t p pc sl' ;
parse_strong_prefix (parse_sum t p pc) sl sl' ;
parse_injective p sl sl'
let gaccessor_clens_sum_payload
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (gaccessor (parse_sum t p pc) (dsnd (pc k)) (clens_sum_payload t k))
= Classical.forall_intro_2 (fun x -> Classical.move_requires (gaccessor_clens_sum_payload_injective t p pc k x));
Classical.forall_intro_2 (fun x -> Classical.move_requires (gaccessor_clens_sum_payload_no_lookahead t p pc k x));
gaccessor_prop_equiv (parse_sum t p pc) (dsnd (pc k)) (clens_sum_payload t k) (gaccessor_clens_sum_payload' t p pc k);
gaccessor_clens_sum_payload' t p pc k
inline_for_extraction
let accessor_clens_sum_payload'
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(j: jumper p)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: HST.Stack U32.t
(requires (fun h ->
valid (parse_sum t p pc) h input pos /\
(clens_sum_payload t k).clens_cond (contents (parse_sum t p pc) h input pos)
))
(ensures (fun h pos' h' ->
B.modifies B.loc_none h h' /\
pos' == slice_access h (gaccessor_clens_sum_payload t p pc k) input pos
))
=
let h = HST.get () in
[@inline_let]
let _ =
let pos' = get_valid_pos (parse_sum t p pc) h input pos in
let large = bytes_of_slice_from h input pos in
slice_access_eq h (gaccessor_clens_sum_payload t p pc k) input pos;
valid_facts (parse_sum t p pc) h input pos;
parse_sum_eq'' t p pc large;
valid_facts p h input pos
in
j input pos
#pop-options
inline_for_extraction
let accessor_clens_sum_payload
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(j: jumper p)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (accessor (gaccessor_clens_sum_payload t p pc k))
= fun #rrel #rel -> accessor_clens_sum_payload' t j pc k #rrel #rel
let clens_sum_cases_payload
(s: sum)
(k: sum_key s)
: Tot (clens (sum_cases s k) (sum_type_of_tag s k))
= {
clens_cond = (fun (x: sum_cases s k) -> True);
clens_get = (fun (x: sum_cases s k) -> synth_sum_case_recip s k x <: Ghost (sum_type_of_tag s k) (requires (True)) (ensures (fun _ -> True)));
}
let gaccessor_clens_sum_cases_payload
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (gaccessor (parse_sum_cases' t pc k) (dsnd (pc k)) (clens_sum_cases_payload t k))
= synth_sum_case_injective t k;
synth_sum_case_inverse t k;
synth_injective_synth_inverse_synth_inverse_recip (synth_sum_case t k) (synth_sum_case_recip t k) ();
gaccessor_ext
(gaccessor_synth (dsnd (pc k)) (synth_sum_case t k) (synth_sum_case_recip t k) ())
(clens_sum_cases_payload t k)
()
inline_for_extraction
let accessor_clens_sum_cases_payload
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (accessor (gaccessor_clens_sum_cases_payload t pc k))
= [@inline_let]
let _ =
synth_sum_case_injective t k;
synth_sum_case_inverse t k;
synth_injective_synth_inverse_synth_inverse_recip (synth_sum_case t k) (synth_sum_case_recip t k) ()
in
accessor_ext
(accessor_synth (dsnd (pc k)) (synth_sum_case t k) (synth_sum_case_recip t k) ())
(clens_sum_cases_payload t k)
()
inline_for_extraction
let validate_dsum_cases_t
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(#k: parser_kind)
(g: parser k (dsum_type_of_unknown_tag s))
(x: dsum_key s)
: Tot Type
= validator (parse_dsum_cases' s f g x)
let validate_dsum_cases_eq
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(#k: parser_kind)
(g: parser k (dsum_type_of_unknown_tag s))
(x: dsum_key s)
(v1 v2 : validate_dsum_cases_t s f g x)
: GTot Type0
= True
inline_for_extraction
let validate_dsum_cases_if'
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(#k: parser_kind)
(g: parser k (dsum_type_of_unknown_tag s))
(x: dsum_key s)
(cond: bool)
(ift: (cond_true cond -> Tot (validate_dsum_cases_t s f g x)))
(iff: (cond_false cond -> Tot (validate_dsum_cases_t s f g x)))
: Tot (validate_dsum_cases_t s f g x)
= fun #rrel #rel input len ->
if cond
then (ift () <: validate_dsum_cases_t s f g x) input len
else (iff () <: validate_dsum_cases_t s f g x) input len
inline_for_extraction
let validate_dsum_cases_if
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(#k: parser_kind)
(g: parser k (dsum_type_of_unknown_tag s))
(x: dsum_key s)
: Tot (if_combinator _ (validate_dsum_cases_eq s f g x))
= validate_dsum_cases_if' s f g x
inline_for_extraction
let validate_dsum_cases'
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(f' : (x: dsum_known_key s) -> Tot (validator (dsnd (f x))))
(#k: parser_kind)
(#g: parser k (dsum_type_of_unknown_tag s))
(g' : validator g)
(x: dsum_key s)
: Tot (validate_dsum_cases_t s f g x)
= [@inline_let]
let _ = synth_dsum_case_injective s x in
match x with
| Known x' -> validate_synth (f' x') (synth_dsum_case s (Known x')) () <: validator (parse_dsum_cases' s f g x)
| Unknown x' -> validate_synth g' (synth_dsum_case s (Unknown x')) () <: validator (parse_dsum_cases' s f g x)
inline_for_extraction
let validate_dsum_cases'_destr
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(f' : (x: dsum_known_key s) -> Tot (validator (dsnd (f x))))
(#k: parser_kind)
(#g: parser k (dsum_type_of_unknown_tag s))
(g' : validator g)
(destr: dep_enum_destr _ (fun k -> validate_dsum_cases_t s f g (Known k)))
(x: dsum_key s)
: Tot (validate_dsum_cases_t s f g x)
= fun #rrel #rel input pos ->
match x with
| Known k ->
destr
_
(fun k -> validate_dsum_cases_if s f g (Known k))
(fun _ _ -> ())
(fun _ _ _ _ -> ())
(fun k -> validate_dsum_cases' s f f' g' (Known k))
k
input
pos
| Unknown r -> validate_dsum_cases' s f f' g' (Unknown r) input pos
inline_for_extraction
let validate_dsum_cases
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(f' : (x: dsum_known_key s) -> Tot (validator (dsnd (f x))))
(#k: parser_kind)
(#g: parser k (dsum_type_of_unknown_tag s))
(g' : validator g)
(destr: dep_enum_destr _ (fun k -> validate_dsum_cases_t s f g (Known k)))
(x: dsum_key s)
: Tot (validator (parse_dsum_cases s f g x))
= fun #rrel #rel input pos ->
let h = HST.get () in
[@inline_let]
let _ =
valid_facts (parse_dsum_cases' s f g x) h input (uint64_to_uint32 pos);
valid_facts (parse_dsum_cases s f g x) h input (uint64_to_uint32 pos);
parse_dsum_cases_eq' s f g x (bytes_of_slice_from h input (uint64_to_uint32 pos))
in
validate_dsum_cases'_destr s f f' g' destr x input pos
#push-options "--z3rlimit 40"
inline_for_extraction
let validate_dsum
(#kt: parser_kind)
(t: dsum)
(#p: parser kt (dsum_repr_type t))
(v: validator p)
(p32: leaf_reader p)
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(f32: (x: dsum_known_key t) -> Tot (validator (dsnd (f x))))
(#k': parser_kind)
(#g: parser k' (dsum_type_of_unknown_tag t))
(g32: validator g)
(destr: dep_maybe_enum_destr_t (dsum_enum t) (validate_dsum_cases_t t f g))
: Tot (validator (parse_dsum t p f g))
= fun #rrel #rel input pos ->
let h = HST.get () in
[@inline_let]
let _ = parse_dsum_eq' t p f g (bytes_of_slice_from h input (uint64_to_uint32 pos)) in
[@inline_let]
let _ = valid_facts (parse_dsum t p f g) h input (uint64_to_uint32 pos) in
[@inline_let]
let _ = valid_facts p h input (uint64_to_uint32 pos) in
let pos_after_tag = v input pos in
if is_error pos_after_tag
then pos_after_tag
else
let tg = p32 input (uint64_to_uint32 pos) in
[@inline_let]
let _ = valid_facts (parse_dsum_cases' t f g (maybe_enum_key_of_repr (dsum_enum t) tg)) h input (uint64_to_uint32 pos_after_tag) in
destr (validate_dsum_cases_eq t f g) (validate_dsum_cases_if t f g) (fun _ _ -> ()) (fun _ _ _ _ -> ()) (validate_dsum_cases' t f f32 g32) tg input pos_after_tag
#pop-options
#reset-options "--z3rlimit 64 --z3cliopt smt.arith.nl=false --initial_ifuel 8 --max_ifuel 8 --initial_fuel 2 --max_fuel 2"
let valid_dsum_intro_known
(h: HS.mem)
(t: dsum)
(#kt: parser_kind)
(p: parser kt (dsum_repr_type t))
(f: ((x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x))))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: Lemma
(requires (
valid (parse_maybe_enum_key p (dsum_enum t)) h input pos /\ (
let k' = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
Known? k' /\ (
let Known k = k' in
valid (dsnd (f k)) h input (get_valid_pos (parse_maybe_enum_key p (dsum_enum t)) h input pos)
))))
(ensures (
let Known k = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
let pos_payload = get_valid_pos (parse_maybe_enum_key p (dsum_enum t)) h input pos in
valid_content_pos
(parse_dsum t p f g) h input pos
(synth_dsum_case t (Known k) (contents (dsnd (f k)) h input pos_payload))
(get_valid_pos (dsnd (f k)) h input pos_payload)
))
= valid_facts (parse_maybe_enum_key p (dsum_enum t)) h input pos;
let Known k = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
let pos_payload = get_valid_pos (parse_maybe_enum_key p (dsum_enum t)) h input pos in
valid_facts (dsnd (f k)) h input pos_payload;
valid_facts (parse_dsum t p f g) h input pos;
parse_dsum_eq t p f g (bytes_of_slice_from h input pos)
let valid_dsum_intro_unknown
(h: HS.mem)
(t: dsum)
(#kt: parser_kind)
(p: parser kt (dsum_repr_type t))
(f: ((x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x))))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: Lemma
(requires (
valid (parse_maybe_enum_key p (dsum_enum t)) h input pos /\ (
let k' = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
Unknown? k' /\
valid g h input (get_valid_pos (parse_maybe_enum_key p (dsum_enum t)) h input pos)
)))
(ensures (
let Unknown r = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
let pos_payload = get_valid_pos (parse_maybe_enum_key p (dsum_enum t)) h input pos in
valid_content_pos
(parse_dsum t p f g) h input pos
(synth_dsum_case t (Unknown r) (contents g h input pos_payload))
(get_valid_pos g h input pos_payload)
))
= valid_facts (parse_maybe_enum_key p (dsum_enum t)) h input pos;
let Unknown r = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
let pos_payload = get_valid_pos (parse_maybe_enum_key p (dsum_enum t)) h input pos in
valid_facts g h input pos_payload;
valid_facts (parse_dsum t p f g) h input pos;
parse_dsum_eq t p f g (bytes_of_slice_from h input pos)
#reset-options
inline_for_extraction
let finalize_dsum_case_known
(t: dsum)
(#kt: parser_kind)
(#p: parser kt (dsum_repr_type t))
(s: serializer p)
(w: leaf_writer_strong s)
(f: ((x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x))))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
(destr: enum_repr_of_key'_t (dsum_enum t))
(k: dsum_known_key t)
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: HST.Stack unit
(requires (fun h ->
let len_tag = serialized_length (serialize_enum_key _ s (dsum_enum t)) k in
U32.v pos + len_tag < 4294967296 /\ (
let pos_payload = pos `U32.add` U32.uint_to_t len_tag in
valid (dsnd (f k)) h input pos_payload /\
writable input.base (U32.v pos) (U32.v pos_payload) h
)))
(ensures (fun h _ h' ->
let len_tag = serialized_length (serialize_enum_key _ s (dsum_enum t)) k in
let pos_payload = pos `U32.add` U32.uint_to_t len_tag in
B.modifies (loc_slice_from_to input pos pos_payload) h h' /\
valid_content_pos (parse_dsum t p f g) h' input pos (synth_dsum_case t (Known k) (contents (dsnd (f k)) h input pos_payload)) (get_valid_pos (dsnd (f k)) h input pos_payload)
))
= let pos1 = write_enum_key w (dsum_enum t) destr k input pos in
let h = HST.get () in
[@inline_let]
let _ =
valid_facts (parse_enum_key p (dsum_enum t)) h input pos;
valid_facts (parse_maybe_enum_key p (dsum_enum t)) h input pos;
let sq = bytes_of_slice_from h input pos in
parse_enum_key_eq p (dsum_enum t) sq;
parse_maybe_enum_key_eq p (dsum_enum t) sq;
valid_dsum_intro_known h t p f g input pos
in
()
inline_for_extraction
let finalize_dsum_case_unknown
(t: dsum)
(#kt: parser_kind)
(#p: parser kt (dsum_repr_type t))
(s: serializer p)
(w: leaf_writer_strong s)
(f: ((x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x))))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
(r: unknown_enum_repr (dsum_enum t))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: HST.Stack unit
(requires (fun h ->
let len_tag = serialized_length s r in
U32.v pos + len_tag < 4294967296 /\ (
let pos_payload = pos `U32.add` U32.uint_to_t len_tag in
valid g h input pos_payload /\
writable input.base (U32.v pos) (U32.v pos_payload) h
)))
(ensures (fun h _ h' ->
let len_tag = serialized_length s r in
let pos_payload = pos `U32.add` U32.uint_to_t len_tag in
B.modifies (loc_slice_from_to input pos pos_payload) h h' /\
valid_content_pos (parse_dsum t p f g) h' input pos (synth_dsum_case t (Unknown r) (contents g h input pos_payload)) (get_valid_pos g h input pos_payload)
))
= let pos1 = w r input pos in
let h = HST.get () in
[@inline_let]
let _ =
valid_facts (parse_maybe_enum_key p (dsum_enum t)) h input pos;
valid_facts p h input pos;
let sq = bytes_of_slice_from h input pos in
parse_maybe_enum_key_eq p (dsum_enum t) sq;
valid_dsum_intro_unknown h t p f g input pos
in
()
let valid_dsum_elim_tag
(h: HS.mem)
(t: dsum)
(#kt: parser_kind)
(p: parser kt (dsum_repr_type t))
(f: ((x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x))))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: Lemma
(requires (
valid (parse_dsum t p f g) h input pos
))
(ensures (
valid (parse_maybe_enum_key p (dsum_enum t)) h input pos /\
contents (parse_maybe_enum_key p (dsum_enum t)) h input pos == dsum_tag_of_data t (contents (parse_dsum t p f g) h input pos)
))
= let _ = parse_dsum_eq_ t p f g (bytes_of_slice_from h input pos) in
let _ = valid_facts (parse_dsum t p f g) h input pos in
let _ = valid_facts (parse_maybe_enum_key p (dsum_enum t)) h input pos in
()
inline_for_extraction
let read_dsum_tag
(t: dsum)
(#kt: parser_kind)
(#p: parser kt (dsum_repr_type t))
(p32: leaf_reader p)
(destr: maybe_enum_destr_t (maybe_enum_key (dsum_enum t)) (dsum_enum t))
(f: ((x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x))))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: HST.Stack (dsum_key t)
(requires (fun h ->
valid (parse_dsum t p f g) h input pos
))
(ensures (fun h res h' ->
B.modifies B.loc_none h h' /\
res == dsum_tag_of_data t (contents (parse_dsum t p f g) h input pos)
))
= let h = HST.get () in
[@inline_let] let _ = valid_dsum_elim_tag h t p f g input pos in
read_maybe_enum_key p32 (dsum_enum t) destr input pos
#push-options "--z3rlimit 32"
let valid_dsum_elim_known
(h: HS.mem)
(t: dsum)
(#kt: parser_kind)
(p: parser kt (dsum_repr_type t))
(f: ((x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x))))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: Lemma
(requires (
valid (parse_dsum t p f g) h input pos /\
Known? (dsum_tag_of_data t (contents (parse_dsum t p f g) h input pos))
))
(ensures (
valid (parse_maybe_enum_key p (dsum_enum t)) h input pos /\ (
let k' = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
let pos_payload = get_valid_pos (parse_maybe_enum_key p (dsum_enum t)) h input pos in
Known? k' /\ (
let Known k = k' in
valid (dsnd (f k)) h input pos_payload /\
valid_content_pos
(parse_dsum t p f g) h input pos
(synth_dsum_case t (Known k) (contents (dsnd (f k)) h input pos_payload))
(get_valid_pos (dsnd (f k)) h input pos_payload)
))))
=
valid_facts (parse_dsum t p f g) h input pos;
parse_dsum_eq t p f g (bytes_of_slice_from h input pos);
valid_facts (parse_maybe_enum_key p (dsum_enum t)) h input pos;
let Known k = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
let pos_payload = get_valid_pos (parse_maybe_enum_key p (dsum_enum t)) h input pos in
valid_facts (dsnd (f k)) h input pos_payload
#pop-options
let valid_dsum_elim_unknown
(h: HS.mem)
(t: dsum)
(#kt: parser_kind)
(p: parser kt (dsum_repr_type t))
(f: ((x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x))))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: Lemma
(requires (
valid (parse_dsum t p f g) h input pos /\
Unknown? (dsum_tag_of_data t (contents (parse_dsum t p f g) h input pos))
))
(ensures (
valid (parse_maybe_enum_key p (dsum_enum t)) h input pos /\ (
let k' = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
let pos_payload = get_valid_pos (parse_maybe_enum_key p (dsum_enum t)) h input pos in
Unknown? k' /\ (
let Unknown r = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
valid g h input pos_payload /\
valid_content_pos
(parse_dsum t p f g) h input pos
(synth_dsum_case t (Unknown r) (contents g h input pos_payload))
(get_valid_pos g h input pos_payload)
))))
=
valid_facts (parse_dsum t p f g) h input pos;
parse_dsum_eq t p f g (bytes_of_slice_from h input pos);
valid_facts (parse_maybe_enum_key p (dsum_enum t)) h input pos;
let Unknown r = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
let pos_payload = get_valid_pos (parse_maybe_enum_key p (dsum_enum t)) h input pos in
valid_facts g h input pos_payload
inline_for_extraction
let jump_dsum_cases_t
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(#k: parser_kind)
(g: parser k (dsum_type_of_unknown_tag s))
(x: dsum_key s)
: Tot Type
= jumper (parse_dsum_cases' s f g x)
let jump_dsum_cases_eq
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(#k: parser_kind)
(g: parser k (dsum_type_of_unknown_tag s))
(x: dsum_key s)
(v1 v2 : jump_dsum_cases_t s f g x)
: GTot Type0
= True
inline_for_extraction
let jump_dsum_cases_if'
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(#k: parser_kind)
(g: parser k (dsum_type_of_unknown_tag s))
(x: dsum_key s)
(cond: bool)
(ift: (cond_true cond -> Tot (jump_dsum_cases_t s f g x)))
(iff: (cond_false cond -> Tot (jump_dsum_cases_t s f g x)))
: Tot (jump_dsum_cases_t s f g x)
= fun #rrel #rel input len ->
if cond
then (ift () <: jump_dsum_cases_t s f g x) input len
else (iff () <: jump_dsum_cases_t s f g x) input len
inline_for_extraction
let jump_dsum_cases_if
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(#k: parser_kind)
(g: parser k (dsum_type_of_unknown_tag s))
(x: dsum_key s)
: Tot (if_combinator _ (jump_dsum_cases_eq s f g x))
= jump_dsum_cases_if' s f g x
inline_for_extraction
let jump_dsum_cases'
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(f' : (x: dsum_known_key s) -> Tot (jumper (dsnd (f x))))
(#k: parser_kind)
(#g: parser k (dsum_type_of_unknown_tag s))
(g' : jumper g)
(x: dsum_key s)
: Tot (jump_dsum_cases_t s f g x)
= synth_dsum_case_injective s x;
match x with
| Known x' -> jump_synth (f' x') (synth_dsum_case s (Known x')) () <: jumper (parse_dsum_cases' s f g x)
| Unknown x' -> jump_synth g' (synth_dsum_case s (Unknown x')) () <: jumper (parse_dsum_cases' s f g x)
inline_for_extraction
let jump_dsum_cases'_destr
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(f' : (x: dsum_known_key s) -> Tot (jumper (dsnd (f x))))
(#k: parser_kind)
(#g: parser k (dsum_type_of_unknown_tag s))
(g' : jumper g)
(destr: dep_enum_destr _ (fun k -> jump_dsum_cases_t s f g (Known k)))
(x: dsum_key s)
: Tot (jump_dsum_cases_t s f g x)
= fun #rrel #rel input pos ->
match x with
| Known k ->
destr
_
(fun k -> jump_dsum_cases_if s f g (Known k))
(fun _ _ -> ())
(fun _ _ _ _ -> ())
(fun k -> jump_dsum_cases' s f f' g' (Known k))
k
input
pos
| Unknown r -> jump_dsum_cases' s f f' g' (Unknown r) input pos
inline_for_extraction
let jump_dsum_cases
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(f' : (x: dsum_known_key s) -> Tot (jumper (dsnd (f x))))
(#k: parser_kind)
(#g: parser k (dsum_type_of_unknown_tag s))
(g' : jumper g)
(destr: dep_enum_destr _ (fun k -> jump_dsum_cases_t s f g (Known k)))
(x: dsum_key s)
: Tot (jumper (parse_dsum_cases s f g x))
= fun #rrel #rel input pos ->
let h = HST.get () in
[@inline_let]
let _ =
valid_facts (parse_dsum_cases' s f g x) h input pos;
valid_facts (parse_dsum_cases s f g x) h input pos;
parse_dsum_cases_eq' s f g x (bytes_of_slice_from h input pos)
in
jump_dsum_cases'_destr s f f' g' destr x input pos
#push-options "--z3rlimit 16"
inline_for_extraction
let jump_dsum
(#kt: parser_kind)
(t: dsum)
(#p: parser kt (dsum_repr_type t))
(v: jumper p)
(p32: leaf_reader p)
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(f32: (x: dsum_known_key t) -> Tot (jumper (dsnd (f x))))
(#k': parser_kind)
(#g: parser k' (dsum_type_of_unknown_tag t))
(g32: jumper g)
(destr: dep_maybe_enum_destr_t (dsum_enum t) (jump_dsum_cases_t t f g))
: Tot (jumper (parse_dsum t p f g))
= fun #rrel #rel input pos ->
let h = HST.get () in
[@inline_let]
let _ = parse_dsum_eq' t p f g (bytes_of_slice_from h input pos) in
[@inline_let]
let _ = valid_facts (parse_dsum t p f g) h input pos in
[@inline_let]
let _ = valid_facts p h input pos in
let pos_after_tag = v input pos in
let tg = p32 input pos in
[@inline_let]
let _ = valid_facts (parse_dsum_cases' t f g (maybe_enum_key_of_repr (dsum_enum t) tg)) h input pos_after_tag in
destr (jump_dsum_cases_eq t f g) (jump_dsum_cases_if t f g) (fun _ _ -> ()) (fun _ _ _ _ -> ()) (jump_dsum_cases' t f f32 g32) tg input pos_after_tag
#pop-options
inline_for_extraction
let read_dsum_cases'
(t: dsum)
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(f32: (x: dsum_known_key t) -> Tot (leaf_reader (dsnd (f x))))
(#k': parser_kind)
(g: parser k' (dsum_type_of_unknown_tag t))
(g32: leaf_reader g)
(x: dsum_key t)
: Tot (leaf_reader (parse_dsum_cases' t f g x))
= fun #rrel #rel input pos ->
[@inline_let]
let _ = synth_dsum_case_injective t x in
match x with
| Known x' ->
read_synth'
(dsnd (f x'))
(synth_dsum_case t (Known x'))
(f32 x')
()
input
pos
| Unknown x' ->
read_synth'
g
(synth_dsum_case t (Unknown x'))
g32
()
input
pos
inline_for_extraction
let read_dsum_cases_t
(t: dsum)
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(#k': parser_kind)
(g: parser k' (dsum_type_of_unknown_tag t))
(k: dsum_known_key t)
: Tot Type
= leaf_reader (parse_dsum_cases' t f g (Known k))
let read_dsum_cases_t_eq
(t: dsum)
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(#k': parser_kind)
(g: parser k' (dsum_type_of_unknown_tag t))
(k: dsum_known_key t)
(x y : read_dsum_cases_t t f g k)
: GTot Type0
= True
inline_for_extraction
let read_dsum_cases_t_if
(t: dsum)
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(#k': parser_kind)
(g: parser k' (dsum_type_of_unknown_tag t))
(k: dsum_known_key t)
: Tot (if_combinator _ (read_dsum_cases_t_eq t f g k))
= fun cond (sv_true: cond_true cond -> Tot (read_dsum_cases_t t f g k)) (sv_false: cond_false cond -> Tot (read_dsum_cases_t t f g k)) #_ #_ input pos ->
if cond
then sv_true () input pos
else sv_false () input pos
inline_for_extraction
let read_dsum_cases
(t: dsum)
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(f32: (x: dsum_known_key t) -> Tot (leaf_reader (dsnd (f x))))
(#k': parser_kind)
(g: parser k' (dsum_type_of_unknown_tag t))
(g32: leaf_reader g)
(destr: dep_enum_destr _ (read_dsum_cases_t t f g))
(x: dsum_key t)
: Tot (leaf_reader (parse_dsum_cases' t f g x))
= fun #_ #_ input pos ->
match x with
| Known k ->
destr
_
(read_dsum_cases_t_if t f g)
(fun _ _ -> ())
(fun _ _ _ _ -> ())
(fun k -> read_dsum_cases' t f f32 g g32 (Known k))
k
input
pos
| Unknown r ->
read_dsum_cases' t f f32 g g32 (Unknown r) input pos
#push-options "--z3rlimit 16"
inline_for_extraction
let read_dsum
(#kt: parser_kind)
(t: dsum)
(#p: parser kt (dsum_repr_type t))
(p32: leaf_reader (parse_maybe_enum_key p (dsum_enum t)))
(j: jumper p)
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(f32: (x: dsum_known_key t) -> Tot (leaf_reader (dsnd (f x))))
(#k': parser_kind)
(#g: parser k' (dsum_type_of_unknown_tag t))
(g32: leaf_reader g)
(destr: dep_enum_destr _ (read_dsum_cases_t t f g))
: Tot (leaf_reader (parse_dsum t p f g))
= fun #_ #_ input pos ->
let h = HST.get () in
valid_facts (parse_dsum t p f g) h input pos;
parse_dsum_eq_ t p f g (bytes_of_slice_from h input pos);
valid_facts (parse_maybe_enum_key p (dsum_enum t)) h input pos;
let k = p32 input pos in
let pos' = jump_maybe_enum_key j (dsum_enum t) input pos in
valid_facts (parse_dsum_cases' t f g k) h input pos' ;
read_dsum_cases t f f32 g g32 destr k input pos'
#pop-options
inline_for_extraction
let serialize32_dsum_type_of_tag
(t: dsum)
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(sf: (x: dsum_known_key t) -> Tot (serializer (dsnd (f x))))
(sf32: (x: dsum_known_key t) -> Tot (serializer32 (sf x)))
(#k': parser_kind)
(#g: parser k' (dsum_type_of_unknown_tag t))
(#sg: serializer g)
(sg32: serializer32 sg)
(tg: dsum_key t)
: Tot (serializer32 (serialize_dsum_type_of_tag t f sf g sg tg))
= match tg with
| Known x' -> serialize32_ext (dsnd (f x')) (sf x') (sf32 x') (parse_dsum_type_of_tag t f g tg) ()
| Unknown x' -> serialize32_ext g sg sg32 (parse_dsum_type_of_tag t f g tg) ()
inline_for_extraction
let serialize32_dsum_cases_aux
(t: dsum)
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(sf: (x: dsum_known_key t) -> Tot (serializer (dsnd (f x))))
(sf32: (x: dsum_known_key t) -> Tot (serializer32 (sf x)))
(#k': parser_kind)
(#g: parser k' (dsum_type_of_unknown_tag t))
(#sg: serializer g)
(sg32: serializer32 sg)
(tg: dsum_key t)
: Tot (serializer32 (serialize_dsum_cases t f sf g sg tg))
= [@inline_let]
let _ = synth_dsum_case_injective t tg in
[@inline_let]
let _ = synth_dsum_case_inverse t tg in
serialize32_synth
(serialize32_dsum_type_of_tag t f sf sf32 sg32 tg)
(synth_dsum_case t tg)
(synth_dsum_case_recip t tg)
(fun x -> synth_dsum_case_recip t tg x)
()
inline_for_extraction
let serialize32_dsum_cases_t
(t: dsum)
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(sf: (x: dsum_known_key t) -> Tot (serializer (dsnd (f x))))
(#k': parser_kind)
(g: parser k' (dsum_type_of_unknown_tag t))
(sg: serializer g)
(k: dsum_known_key t)
: Tot Type
= serializer32 (serialize_dsum_cases t f sf g sg (Known k))
let serialize32_dsum_cases_t_eq
(t: dsum)
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(sf: (x: dsum_known_key t) -> Tot (serializer (dsnd (f x))))
(#k': parser_kind)
(g: parser k' (dsum_type_of_unknown_tag t))
(sg: serializer g)
(k: dsum_known_key t)
(x y: serialize32_dsum_cases_t t f sf g sg k)
: GTot Type0
= True
inline_for_extraction
let serialize32_dsum_cases_t_if
(t: dsum)
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(sf: (x: dsum_known_key t) -> Tot (serializer (dsnd (f x))))
(#k': parser_kind)
(g: parser k' (dsum_type_of_unknown_tag t))
(sg: serializer g)
(k: dsum_known_key t)
: Tot (if_combinator _ (serialize32_dsum_cases_t_eq t f sf g sg k))
= fun cond (sv_true: (cond_true cond -> Tot (serialize32_dsum_cases_t t f sf g sg k))) (sv_false: (cond_false cond -> Tot (serialize32_dsum_cases_t t f sf g sg k))) x #rrel #rel output pos ->
if cond
then (sv_true () x output pos)
else (sv_false () x output pos)
inline_for_extraction
let serialize32_dsum_cases
(t: dsum)
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(sf: (x: dsum_known_key t) -> Tot (serializer (dsnd (f x))))
(sf32: (x: dsum_known_key t) -> Tot (serializer32 (sf x)))
(#k': parser_kind)
(#g: parser k' (dsum_type_of_unknown_tag t))
(#sg: serializer g)
(sg32: serializer32 sg)
(destr: dep_enum_destr _ (serialize32_dsum_cases_t t f sf g sg))
(tg: dsum_key t)
: Tot (serializer32 (serialize_dsum_cases t f sf g sg tg))
= fun x #rrel #rel output pos ->
match tg with
| Known k ->
destr
_
(serialize32_dsum_cases_t_if t f sf g sg)
(fun _ _ -> ())
(fun _ _ _ _ -> ())
(fun k -> serialize32_dsum_cases_aux t f sf sf32 sg32 (Known k))
k
x
output
pos
| Unknown r ->
serialize32_dsum_cases_aux t f sf sf32 sg32 (Unknown r) x output pos
inline_for_extraction
let serialize32_dsum
(#kt: parser_kind)
(t: dsum)
(#p: parser kt (dsum_repr_type t))
(s: serializer p {kt.parser_kind_subkind == Some ParserStrong})
(s32: serializer32 (serialize_maybe_enum_key _ s (dsum_enum t)))
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(sf: (x: dsum_known_key t) -> Tot (serializer (dsnd (f x))))
(sf32: (x: dsum_known_key t) -> Tot (serializer32 (sf x)))
(#k': parser_kind)
(#g: parser k' (dsum_type_of_unknown_tag t))
(#sg: serializer g)
(sg32: serializer32 sg)
(destr: dep_enum_destr _ (serialize32_dsum_cases_t t f sf g sg))
: Tot (serializer32 (serialize_dsum t s f sf g sg))
= fun x #_ #_ output pos ->
[@inline_let]
let _ = serialize_dsum_eq' t s f sf g sg x in
let tg = dsum_tag_of_data t x in
serialize32_nondep_then_aux
s32
(serialize32_dsum_cases t f sf sf32 sg32 destr tg)
tg
x
output
pos
let clens_dsum_tag
(s: dsum)
: Tot (clens (dsum_type s) (dsum_key s))
= {
clens_cond = (fun _ -> True);
clens_get = dsum_tag_of_data s;
}
let gaccessor_dsum_tag
(#kt: parser_kind)
(t: dsum)
(p: parser kt (dsum_repr_type t))
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
: Tot (gaccessor (parse_dsum t p f g) (parse_maybe_enum_key p (dsum_enum t)) (clens_dsum_tag t))
= gaccessor_tagged_union_tag
(parse_maybe_enum_key p (dsum_enum t))
(dsum_tag_of_data t)
(parse_dsum_cases t f g)
inline_for_extraction
let accessor_dsum_tag
(#kt: parser_kind)
(t: dsum)
(p: parser kt (dsum_repr_type t))
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
: Tot (accessor (gaccessor_dsum_tag t p f g))
= accessor_tagged_union_tag
(parse_maybe_enum_key p (dsum_enum t))
(dsum_tag_of_data t)
(parse_dsum_cases t f g)
let clens_dsum_payload
(s: dsum)
(k: dsum_key s)
: Tot (clens (dsum_type s) (dsum_type_of_tag s k))
= {
clens_cond = (fun (x: dsum_type s) -> dsum_tag_of_data s x == k);
clens_get = (fun (x: dsum_type s) -> synth_dsum_case_recip s k x <: Ghost (dsum_type_of_tag s k) (requires (dsum_tag_of_data s x == k)) (ensures (fun _ -> True)));
}
let clens_dsum_unknown_payload
(s: dsum)
: Tot (clens (dsum_type s) (dsum_type_of_unknown_tag s))
= {
clens_cond = (fun (x: dsum_type s) -> Unknown? (dsum_tag_of_data s x));
clens_get = (fun (x: dsum_type s) -> synth_dsum_case_recip s (dsum_tag_of_data s x) x <: Ghost (dsum_type_of_unknown_tag s) (requires (Unknown? (dsum_tag_of_data s x))) (ensures (fun _ -> True)));
}
#push-options "--z3rlimit 16"
let gaccessor_clens_dsum_payload'
(#kt: parser_kind)
(t: dsum)
(p: parser kt (dsum_repr_type t))
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
(k: dsum_key t)
: Tot (gaccessor' (parse_dsum t p f g) (parse_dsum_type_of_tag' t f g k) (clens_dsum_payload t k))
= fun (input: bytes) ->
parse_dsum_eq3 t p f g input;
let res =
match parse p input with
| Some (_, consumed) ->
synth_dsum_case_inverse t k;
synth_dsum_case_injective t k;
synth_injective_synth_inverse_synth_inverse_recip (synth_dsum_case t k) (synth_dsum_case_recip t k) ();
(consumed)
| _ -> (0) // dummy
in
(res <: (res: _ { gaccessor_post' (parse_dsum t p f g) (parse_dsum_type_of_tag' t f g k) (clens_dsum_payload t k) input res } ))
let gaccessor_clens_dsum_payload_injective
(#kt: parser_kind)
(t: dsum)
(p: parser kt (dsum_repr_type t))
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
(k: dsum_key t)
(sl sl' : bytes)
: Lemma
(requires (
gaccessor_pre (parse_dsum t p f g) (parse_dsum_type_of_tag' t f g k) (clens_dsum_payload t k) sl /\
gaccessor_pre (parse_dsum t p f g) (parse_dsum_type_of_tag' t f g k) (clens_dsum_payload t k) sl' /\
injective_precond (parse_dsum t p f g) sl sl'
))
(ensures (
gaccessor_clens_dsum_payload' t p f g k sl == gaccessor_clens_dsum_payload' t p f g k sl'
))
=
parse_dsum_eq3 t p f g sl;
parse_dsum_eq3 t p f g sl';
parse_injective (parse_dsum t p f g) sl sl' ;
parse_injective p sl sl'
let gaccessor_clens_dsum_payload_no_lookahead
(#kt: parser_kind)
(t: dsum)
(p: parser kt (dsum_repr_type t))
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
(k: dsum_key t)
(sl sl' : bytes)
: Lemma
(requires (
(parse_dsum_kind kt t f ku).parser_kind_subkind == Some ParserStrong /\
gaccessor_pre (parse_dsum t p f g) (parse_dsum_type_of_tag' t f g k) (clens_dsum_payload t k) sl /\
gaccessor_pre (parse_dsum t p f g) (parse_dsum_type_of_tag' t f g k) (clens_dsum_payload t k) sl' /\
no_lookahead_on_precond (parse_dsum t p f g) sl sl'
))
(ensures (
gaccessor_clens_dsum_payload' t p f g k sl == gaccessor_clens_dsum_payload' t p f g k sl'
))
= parse_dsum_eq3 t p f g sl;
parse_dsum_eq3 t p f g sl';
parse_strong_prefix (parse_dsum t p f g) sl sl' ;
parse_injective p sl sl'
let gaccessor_clens_dsum_payload
(#kt: parser_kind)
(t: dsum)
(p: parser kt (dsum_repr_type t))
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
(k: dsum_key t)
: Tot (gaccessor (parse_dsum t p f g) (parse_dsum_type_of_tag' t f g k) (clens_dsum_payload t k))
= Classical.forall_intro_2 (fun x -> Classical.move_requires (gaccessor_clens_dsum_payload_injective t p f g k x));
Classical.forall_intro_2 (fun x -> Classical.move_requires (gaccessor_clens_dsum_payload_no_lookahead t p f g k x));
gaccessor_prop_equiv (parse_dsum t p f g) (parse_dsum_type_of_tag' t f g k) (clens_dsum_payload t k) (gaccessor_clens_dsum_payload' t p f g k);
gaccessor_clens_dsum_payload' t p f g k
inline_for_extraction
let accessor_clens_dsum_payload'
(#kt: parser_kind)
(t: dsum)
(#p: parser kt (dsum_repr_type t))
(j: jumper p)
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
(k: dsum_key t)
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: HST.Stack U32.t
(requires (fun h ->
valid (parse_dsum t p f g) h input pos /\
(clens_dsum_payload t k).clens_cond (contents (parse_dsum t p f g) h input pos)
))
(ensures (fun h pos' h' ->
B.modifies B.loc_none h h' /\
pos' == slice_access h (gaccessor_clens_dsum_payload t p f g k) input pos
))
=
let h = HST.get () in
[@inline_let]
let _ =
let pos' = get_valid_pos (parse_dsum t p f g) h input pos in
let large = bytes_of_slice_from h input pos in
slice_access_eq h (gaccessor_clens_dsum_payload t p f g k) input pos;
valid_facts (parse_dsum t p f g) h input pos;
parse_dsum_eq3 t p f g large;
valid_facts p h input pos
in
j input pos
#pop-options
inline_for_extraction
let accessor_clens_dsum_payload
(#kt: parser_kind)
(t: dsum)
(#p: parser kt (dsum_repr_type t))
(j: jumper p)
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
(k: dsum_key t)
: Tot (accessor (gaccessor_clens_dsum_payload t p f g k))
= fun #rrel #rel -> accessor_clens_dsum_payload' t j f g k #rrel #rel
#push-options "--z3rlimit 16"
let gaccessor_clens_dsum_unknown_payload'
(#kt: parser_kind)
(t: dsum)
(p: parser kt (dsum_repr_type t))
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
: Tot (gaccessor' (parse_dsum t p f g) g (clens_dsum_unknown_payload t))
= fun (input: bytes) ->
parse_dsum_eq3 t p f g input;
let res =
match parse p input with
| Some (tg, consumed) ->
let k = maybe_enum_key_of_repr (dsum_enum t) tg in
synth_dsum_case_inverse t k;
synth_dsum_case_injective t k;
synth_injective_synth_inverse_synth_inverse_recip (synth_dsum_case t k) (synth_dsum_case_recip t k) ();
(consumed)
| _ -> (0) // dummy
in
(res <: (res: _ { gaccessor_post' (parse_dsum t p f g) g (clens_dsum_unknown_payload t) input res } ))
let gaccessor_clens_dsum_unknown_payload_injective
(#kt: parser_kind)
(t: dsum)
(p: parser kt (dsum_repr_type t))
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
(sl sl' : bytes)
: Lemma
(requires (
gaccessor_pre (parse_dsum t p f g) g (clens_dsum_unknown_payload t) sl /\
gaccessor_pre (parse_dsum t p f g) g (clens_dsum_unknown_payload t) sl' /\
injective_precond (parse_dsum t p f g) sl sl'
))
(ensures (gaccessor_clens_dsum_unknown_payload' t p f g sl == gaccessor_clens_dsum_unknown_payload' t p f g sl'))
= parse_dsum_eq3 t p f g sl;
parse_dsum_eq3 t p f g sl';
parse_injective (parse_dsum t p f g) sl sl' ;
parse_injective p sl sl'
let gaccessor_clens_dsum_unknown_payload_no_lookahead
(#kt: parser_kind)
(t: dsum)
(p: parser kt (dsum_repr_type t))
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
(sl sl' : bytes)
: Lemma
(requires (
(parse_dsum_kind kt t f ku).parser_kind_subkind == Some ParserStrong /\
gaccessor_pre (parse_dsum t p f g) g (clens_dsum_unknown_payload t) sl /\
gaccessor_pre (parse_dsum t p f g) g (clens_dsum_unknown_payload t) sl' /\
no_lookahead_on_precond (parse_dsum t p f g) sl sl'
))
(ensures (gaccessor_clens_dsum_unknown_payload' t p f g sl == gaccessor_clens_dsum_unknown_payload' t p f g sl'))
=
parse_dsum_eq3 t p f g sl;
parse_dsum_eq3 t p f g sl';
parse_strong_prefix (parse_dsum t p f g) sl sl' ;
parse_injective p sl sl' | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"LowStar.Buffer.fst.checked",
"LowParse.Spec.Sum.fst.checked",
"LowParse.Low.Enum.fst.checked",
"FStar.UInt64.fsti.checked",
"FStar.UInt32.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Int.Cast.fst.checked",
"FStar.HyperStack.ST.fsti.checked",
"FStar.HyperStack.fst.checked",
"FStar.Classical.fsti.checked"
],
"interface_file": false,
"source_file": "LowParse.Low.Sum.fst"
} | [
{
"abbrev": true,
"full_module": "FStar.HyperStack",
"short_module": "HS"
},
{
"abbrev": true,
"full_module": "FStar.UInt64",
"short_module": "U64"
},
{
"abbrev": true,
"full_module": "FStar.Int.Cast",
"short_module": "Cast"
},
{
"abbrev": true,
"full_module": "LowStar.Buffer",
"short_module": "B"
},
{
"abbrev": true,
"full_module": "FStar.HyperStack.ST",
"short_module": "HST"
},
{
"abbrev": true,
"full_module": "FStar.UInt32",
"short_module": "U32"
},
{
"abbrev": false,
"full_module": "LowParse.Spec.Sum",
"short_module": null
},
{
"abbrev": false,
"full_module": "LowParse.Low.Enum",
"short_module": null
},
{
"abbrev": false,
"full_module": "LowParse.Low",
"short_module": null
},
{
"abbrev": false,
"full_module": "LowParse.Low",
"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",
"short_module": null
}
] | {
"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_elim_box": false,
"smtencoding_l_arith_repr": "boxwrap",
"smtencoding_nl_arith_repr": "boxwrap",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": true,
"z3cliopt": [],
"z3refresh": false,
"z3rlimit": 16,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | false |
t: LowParse.Spec.Sum.dsum ->
p: LowParse.Spec.Base.parser kt (LowParse.Spec.Sum.dsum_repr_type t) ->
f:
(x: LowParse.Spec.Sum.dsum_known_key t
-> Prims.dtuple2 LowParse.Spec.Base.parser_kind
(fun k -> LowParse.Spec.Base.parser k (LowParse.Spec.Sum.dsum_type_of_known_tag t x))) ->
g: LowParse.Spec.Base.parser ku (LowParse.Spec.Sum.dsum_type_of_unknown_tag t)
-> LowParse.Low.Base.Spec.gaccessor (LowParse.Spec.Sum.parse_dsum t p f g)
g
(LowParse.Low.Sum.clens_dsum_unknown_payload t) | Prims.Tot | [
"total"
] | [] | [
"LowParse.Spec.Base.parser_kind",
"LowParse.Spec.Sum.dsum",
"LowParse.Spec.Base.parser",
"LowParse.Spec.Sum.dsum_repr_type",
"LowParse.Spec.Sum.dsum_known_key",
"Prims.dtuple2",
"LowParse.Spec.Sum.dsum_type_of_known_tag",
"LowParse.Spec.Sum.dsum_type_of_unknown_tag",
"LowParse.Low.Sum.gaccessor_clens_dsum_unknown_payload'",
"Prims.unit",
"LowParse.Low.Base.Spec.gaccessor_prop_equiv",
"LowParse.Spec.Sum.parse_dsum_kind",
"LowParse.Spec.Sum.dsum_type",
"LowParse.Spec.Sum.parse_dsum",
"LowParse.Low.Sum.clens_dsum_unknown_payload",
"FStar.Classical.forall_intro_2",
"LowParse.Bytes.bytes",
"Prims.l_imp",
"Prims.l_and",
"Prims.eq2",
"FStar.Pervasives.Native.option",
"LowParse.Spec.Base.parser_subkind",
"LowParse.Spec.Base.__proj__Mkparser_kind'__item__parser_kind_subkind",
"FStar.Pervasives.Native.Some",
"LowParse.Spec.Base.ParserStrong",
"LowParse.Low.Base.Spec.gaccessor_pre",
"LowParse.Spec.Base.no_lookahead_on_precond",
"Prims.nat",
"FStar.Classical.move_requires",
"LowParse.Low.Sum.gaccessor_clens_dsum_unknown_payload_no_lookahead",
"Prims.l_True",
"Prims.squash",
"Prims.Nil",
"FStar.Pervasives.pattern",
"LowParse.Spec.Base.injective_precond",
"LowParse.Low.Sum.gaccessor_clens_dsum_unknown_payload_injective",
"LowParse.Low.Base.Spec.gaccessor"
] | [] | false | false | false | false | false | let gaccessor_clens_dsum_unknown_payload
(#kt: parser_kind)
(t: dsum)
(p: parser kt (dsum_repr_type t))
(f: (x: dsum_known_key t -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x))))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
: Tot (gaccessor (parse_dsum t p f g) g (clens_dsum_unknown_payload t)) =
| Classical.forall_intro_2 (fun x ->
Classical.move_requires (gaccessor_clens_dsum_unknown_payload_injective t p f g x));
Classical.forall_intro_2 (fun x ->
Classical.move_requires (gaccessor_clens_dsum_unknown_payload_no_lookahead t p f g x));
gaccessor_prop_equiv (parse_dsum t p f g)
g
(clens_dsum_unknown_payload t)
(gaccessor_clens_dsum_unknown_payload' t p f g);
gaccessor_clens_dsum_unknown_payload' t p f g | false |
SimplePrintfReify.fst | SimplePrintfReify.example4_lemma | val example4_lemma: Prims.unit
-> Lemma (parse_format_string "%d=%s" == Some [Arg Int; Lit '='; Arg String]) | val example4_lemma: Prims.unit
-> Lemma (parse_format_string "%d=%s" == Some [Arg Int; Lit '='; Arg String]) | let example4_lemma () :
Lemma (parse_format_string "%d=%s" == Some [Arg Int; Lit '='; Arg String]) =
assert_norm (parse_format_string "%d=%s" == Some [Arg Int; Lit '='; Arg String]) | {
"file_name": "examples/printf/SimplePrintfReify.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 82,
"end_line": 164,
"start_col": 0,
"start_line": 162
} | (*
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 agreed to in writing, software
distributed under the License is distributed on an "AS IS" BASIS,
WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
See the License for the specific language governing permissions and
limitations under the License.
*)
module SimplePrintfReify
open FStar.Char
open FStar.String
module List = FStar.List.Tot
// A variant of SimplePrintf that uses reify on the Ex implementation
// of parse_format
// For a start here's an alpha renamed version of Ex to avoid clashes
// with the prims variant of Ex (which is not defined using dm4free
// and is not marked as `total`)
(* The underlying representation type *)
let ex (a:Type) = unit -> M (option a)
(* Monad definition *)
val return_ex : (a:Type) -> (x:a) -> Tot (ex a)
let return_ex a x = fun _ -> Some x
val bind_ex : (a:Type) -> (b:Type) -> (f:ex a) -> (g:a -> Tot (ex b)) -> Tot (ex b)
let bind_ex a b f g = fun _ ->
let r = f () in
match r with
| None -> None
| Some x -> g x ()
(* DMFF does not support yet polymorphic actions *)
(* Returning something in [False] allow to derive the usual raise below *)
let raise_ex (_:exn) : Tot (ex False) = fun _ -> None
(* Define the new effect using DM4F *)
total reifiable reflectable new_effect {
XEXN : (a:Type) -> Effect
with repr = ex
; bind = bind_ex
; return = return_ex
; raise = raise_ex
}
(* A lift from `Pure´ into the new effect *)
(* unfold let lift_pure_ex_wp (a:Type) (wp:pure_wp a) (_:unit) (p:XEXN?.post a) = *)
(* wp (fun a -> p (Some a)) *)
(* sub_effect PURE ~> XEXN = lift_pure_ex_wp *)
reifiable
let raise (#a:Type0) (e:exn) : XEXN a (fun _ p -> p None)
= let x = XEXN?.raise e in begin match x with end
(* An effect to alias easily write pre- and postconditions *)
(* Note: we use Type0 instead of XEXN.pre to avoid having to thunk everything. *)
effect Xexn (a:Type) (pre:Type0) (post:XEXN?.post a) =
XEXN a (fun (_:unit) (p:XEXN?.post a) -> pre /\
(forall (r:option a). (pre /\ post r) ==> p r))
(* Another alias. Ex a is the effect type for total exception-throwing
* programs. i.e. Any program of type `Ex a´ will throw or finish
* correctly, but never loop. *)
effect Xex (a:Type) = XEXN a (fun _ p -> forall (x:option a). p x)
// arguments to printf
type arg =
| Bool | Int | Char | String
// directives to printf
type dir =
| Lit : char -> dir
| Arg : arg -> dir
let arg_type (a:arg) : Tot Type0 =
match a with
| Bool -> bool
| Int -> int
| Char -> char
| String -> string
let rec dir_type (ds:list dir) : Tot Type0 =
match ds with
| [] -> string
| Lit c :: ds' -> dir_type ds'
| Arg a :: ds' -> arg_type a -> Tot (dir_type ds')
let dir_type' ds = dir_type ds
let rec string_of_dirs ds (k:string -> Tot string) : Tot (dir_type ds) =
match ds with
| [] -> k ""
| Lit c :: ds' ->
coerce_eq () (
string_of_dirs ds' (fun res -> k (string_of_char c ^ res))
)
| Arg a :: ds' -> fun (x : arg_type a) ->
string_of_dirs ds' (fun res -> k (match a with
| Bool -> string_of_bool x
| Int -> string_of_int x
| Char -> string_of_char x
| String -> x) ^ res)
let example1 : string =
string_of_dirs [Arg Int; Arg String] (fun s -> s) 42 " answer"
exception InvalidFormatString
(* TODO: can we get rid of the two `let x` or are they really required? *)
reifiable let rec parse_format (s:list char) : Xex (list dir) =
match s with
| [] -> []
| '%' :: c :: s' ->
let d =
match c with
| '%' -> Lit '%'
| 'b' -> Arg Bool
| 'd' -> Arg Int
| 'c' -> Arg Char
| 's' -> Arg String
| _ -> raise InvalidFormatString
in let x = parse_format s' in d :: x
| '%' :: [] -> raise InvalidFormatString
| c :: s' -> let x = parse_format s' in Lit c :: x
let parse_format_pure (s:list char) : option (list dir) =
reify (parse_format s) ()
let rec parse_format_string (s:string) : Tot (option (list dir)) =
parse_format_pure (list_of_string s)
let sprintf (s:string{normalize_term #bool (Some? (parse_format_string s))})
: Tot (normalize_term (dir_type (Some?.v (parse_format_string s)))) =
string_of_dirs (Some?.v (parse_format_string s)) (fun s -> s)
let yyy = parse_format_pure ['%'] == None
let xxx = parse_format_pure ['%'; 'd'; '='; '%'; 's']
let example_error_lemma () :
Lemma (parse_format_pure ['%'] == None) =
()
(* Bad interaction with raise, results in a Failure("Impossible") *)
(* assert_norm (parse_format_pure ['%'] == None) *)
let example3_lemma () :
Lemma (parse_format_pure ['%'; 'd'; '='; '%'; 's']
== Some [Arg Int; Lit '='; Arg String]) =
assert_norm (parse_format_pure ['%'; 'd'; '='; '%'; 's']
== Some [Arg Int; Lit '='; Arg String]) | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.String.fsti.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.fst.checked",
"FStar.Char.fsti.checked"
],
"interface_file": false,
"source_file": "SimplePrintfReify.fst"
} | [
{
"abbrev": true,
"full_module": "FStar.List.Tot",
"short_module": "List"
},
{
"abbrev": false,
"full_module": "FStar.String",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Char",
"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",
"short_module": null
}
] | {
"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_elim_box": false,
"smtencoding_l_arith_repr": "boxwrap",
"smtencoding_nl_arith_repr": "boxwrap",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": true,
"z3cliopt": [],
"z3refresh": false,
"z3rlimit": 5,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | false | _: Prims.unit
-> FStar.Pervasives.Lemma
(ensures
SimplePrintfReify.parse_format_string "%d=%s" ==
FStar.Pervasives.Native.Some
[
SimplePrintfReify.Arg SimplePrintfReify.Int;
SimplePrintfReify.Lit '=';
SimplePrintfReify.Arg SimplePrintfReify.String
]) | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Prims.unit",
"FStar.Pervasives.assert_norm",
"Prims.eq2",
"FStar.Pervasives.Native.option",
"Prims.list",
"SimplePrintfReify.dir",
"SimplePrintfReify.parse_format_string",
"FStar.Pervasives.Native.Some",
"Prims.Cons",
"SimplePrintfReify.Arg",
"SimplePrintfReify.Int",
"SimplePrintfReify.Lit",
"SimplePrintfReify.String",
"Prims.Nil",
"Prims.l_True",
"Prims.squash",
"FStar.Pervasives.pattern"
] | [] | true | false | true | false | false | let example4_lemma () : Lemma (parse_format_string "%d=%s" == Some [Arg Int; Lit '='; Arg String]) =
| assert_norm (parse_format_string "%d=%s" == Some [Arg Int; Lit '='; Arg String]) | false |
SimplePrintfReify.fst | SimplePrintfReify.string_of_dirs | val string_of_dirs (ds: _) (k: (string -> Tot string)) : Tot (dir_type ds) | val string_of_dirs (ds: _) (k: (string -> Tot string)) : Tot (dir_type ds) | let rec string_of_dirs ds (k:string -> Tot string) : Tot (dir_type ds) =
match ds with
| [] -> k ""
| Lit c :: ds' ->
coerce_eq () (
string_of_dirs ds' (fun res -> k (string_of_char c ^ res))
)
| Arg a :: ds' -> fun (x : arg_type a) ->
string_of_dirs ds' (fun res -> k (match a with
| Bool -> string_of_bool x
| Int -> string_of_int x
| Char -> string_of_char x
| String -> x) ^ res) | {
"file_name": "examples/printf/SimplePrintfReify.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 61,
"end_line": 113,
"start_col": 0,
"start_line": 100
} | (*
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 agreed to in writing, software
distributed under the License is distributed on an "AS IS" BASIS,
WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
See the License for the specific language governing permissions and
limitations under the License.
*)
module SimplePrintfReify
open FStar.Char
open FStar.String
module List = FStar.List.Tot
// A variant of SimplePrintf that uses reify on the Ex implementation
// of parse_format
// For a start here's an alpha renamed version of Ex to avoid clashes
// with the prims variant of Ex (which is not defined using dm4free
// and is not marked as `total`)
(* The underlying representation type *)
let ex (a:Type) = unit -> M (option a)
(* Monad definition *)
val return_ex : (a:Type) -> (x:a) -> Tot (ex a)
let return_ex a x = fun _ -> Some x
val bind_ex : (a:Type) -> (b:Type) -> (f:ex a) -> (g:a -> Tot (ex b)) -> Tot (ex b)
let bind_ex a b f g = fun _ ->
let r = f () in
match r with
| None -> None
| Some x -> g x ()
(* DMFF does not support yet polymorphic actions *)
(* Returning something in [False] allow to derive the usual raise below *)
let raise_ex (_:exn) : Tot (ex False) = fun _ -> None
(* Define the new effect using DM4F *)
total reifiable reflectable new_effect {
XEXN : (a:Type) -> Effect
with repr = ex
; bind = bind_ex
; return = return_ex
; raise = raise_ex
}
(* A lift from `Pure´ into the new effect *)
(* unfold let lift_pure_ex_wp (a:Type) (wp:pure_wp a) (_:unit) (p:XEXN?.post a) = *)
(* wp (fun a -> p (Some a)) *)
(* sub_effect PURE ~> XEXN = lift_pure_ex_wp *)
reifiable
let raise (#a:Type0) (e:exn) : XEXN a (fun _ p -> p None)
= let x = XEXN?.raise e in begin match x with end
(* An effect to alias easily write pre- and postconditions *)
(* Note: we use Type0 instead of XEXN.pre to avoid having to thunk everything. *)
effect Xexn (a:Type) (pre:Type0) (post:XEXN?.post a) =
XEXN a (fun (_:unit) (p:XEXN?.post a) -> pre /\
(forall (r:option a). (pre /\ post r) ==> p r))
(* Another alias. Ex a is the effect type for total exception-throwing
* programs. i.e. Any program of type `Ex a´ will throw or finish
* correctly, but never loop. *)
effect Xex (a:Type) = XEXN a (fun _ p -> forall (x:option a). p x)
// arguments to printf
type arg =
| Bool | Int | Char | String
// directives to printf
type dir =
| Lit : char -> dir
| Arg : arg -> dir
let arg_type (a:arg) : Tot Type0 =
match a with
| Bool -> bool
| Int -> int
| Char -> char
| String -> string
let rec dir_type (ds:list dir) : Tot Type0 =
match ds with
| [] -> string
| Lit c :: ds' -> dir_type ds'
| Arg a :: ds' -> arg_type a -> Tot (dir_type ds')
let dir_type' ds = dir_type ds | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.String.fsti.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.fst.checked",
"FStar.Char.fsti.checked"
],
"interface_file": false,
"source_file": "SimplePrintfReify.fst"
} | [
{
"abbrev": true,
"full_module": "FStar.List.Tot",
"short_module": "List"
},
{
"abbrev": false,
"full_module": "FStar.String",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Char",
"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",
"short_module": null
}
] | {
"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_elim_box": false,
"smtencoding_l_arith_repr": "boxwrap",
"smtencoding_nl_arith_repr": "boxwrap",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": true,
"z3cliopt": [],
"z3refresh": false,
"z3rlimit": 5,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | false | ds: Prims.list SimplePrintfReify.dir -> k: (_: Prims.string -> Prims.string)
-> SimplePrintfReify.dir_type ds | Prims.Tot | [
"total"
] | [] | [
"Prims.list",
"SimplePrintfReify.dir",
"Prims.string",
"FStar.String.char",
"FStar.Pervasives.coerce_eq",
"SimplePrintfReify.dir_type",
"SimplePrintfReify.string_of_dirs",
"Prims.op_Hat",
"FStar.String.string_of_char",
"SimplePrintfReify.arg",
"SimplePrintfReify.arg_type",
"Prims.string_of_bool",
"Prims.string_of_int"
] | [
"recursion"
] | false | false | false | false | false | let rec string_of_dirs ds (k: (string -> Tot string)) : Tot (dir_type ds) =
| match ds with
| [] -> k ""
| Lit c :: ds' -> coerce_eq () (string_of_dirs ds' (fun res -> k (string_of_char c ^ res)))
| Arg a :: ds' ->
fun (x: arg_type a) ->
string_of_dirs ds'
(fun res ->
k (match a with
| Bool -> string_of_bool x
| Int -> string_of_int x
| Char -> string_of_char x
| String -> x) ^
res) | false |
SimplePrintfReify.fst | SimplePrintfReify.xxx | val xxx : FStar.Pervasives.Native.option (Prims.list SimplePrintfReify.dir) | let xxx = parse_format_pure ['%'; 'd'; '='; '%'; 's'] | {
"file_name": "examples/printf/SimplePrintfReify.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 53,
"end_line": 148,
"start_col": 0,
"start_line": 148
} | (*
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 agreed to in writing, software
distributed under the License is distributed on an "AS IS" BASIS,
WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
See the License for the specific language governing permissions and
limitations under the License.
*)
module SimplePrintfReify
open FStar.Char
open FStar.String
module List = FStar.List.Tot
// A variant of SimplePrintf that uses reify on the Ex implementation
// of parse_format
// For a start here's an alpha renamed version of Ex to avoid clashes
// with the prims variant of Ex (which is not defined using dm4free
// and is not marked as `total`)
(* The underlying representation type *)
let ex (a:Type) = unit -> M (option a)
(* Monad definition *)
val return_ex : (a:Type) -> (x:a) -> Tot (ex a)
let return_ex a x = fun _ -> Some x
val bind_ex : (a:Type) -> (b:Type) -> (f:ex a) -> (g:a -> Tot (ex b)) -> Tot (ex b)
let bind_ex a b f g = fun _ ->
let r = f () in
match r with
| None -> None
| Some x -> g x ()
(* DMFF does not support yet polymorphic actions *)
(* Returning something in [False] allow to derive the usual raise below *)
let raise_ex (_:exn) : Tot (ex False) = fun _ -> None
(* Define the new effect using DM4F *)
total reifiable reflectable new_effect {
XEXN : (a:Type) -> Effect
with repr = ex
; bind = bind_ex
; return = return_ex
; raise = raise_ex
}
(* A lift from `Pure´ into the new effect *)
(* unfold let lift_pure_ex_wp (a:Type) (wp:pure_wp a) (_:unit) (p:XEXN?.post a) = *)
(* wp (fun a -> p (Some a)) *)
(* sub_effect PURE ~> XEXN = lift_pure_ex_wp *)
reifiable
let raise (#a:Type0) (e:exn) : XEXN a (fun _ p -> p None)
= let x = XEXN?.raise e in begin match x with end
(* An effect to alias easily write pre- and postconditions *)
(* Note: we use Type0 instead of XEXN.pre to avoid having to thunk everything. *)
effect Xexn (a:Type) (pre:Type0) (post:XEXN?.post a) =
XEXN a (fun (_:unit) (p:XEXN?.post a) -> pre /\
(forall (r:option a). (pre /\ post r) ==> p r))
(* Another alias. Ex a is the effect type for total exception-throwing
* programs. i.e. Any program of type `Ex a´ will throw or finish
* correctly, but never loop. *)
effect Xex (a:Type) = XEXN a (fun _ p -> forall (x:option a). p x)
// arguments to printf
type arg =
| Bool | Int | Char | String
// directives to printf
type dir =
| Lit : char -> dir
| Arg : arg -> dir
let arg_type (a:arg) : Tot Type0 =
match a with
| Bool -> bool
| Int -> int
| Char -> char
| String -> string
let rec dir_type (ds:list dir) : Tot Type0 =
match ds with
| [] -> string
| Lit c :: ds' -> dir_type ds'
| Arg a :: ds' -> arg_type a -> Tot (dir_type ds')
let dir_type' ds = dir_type ds
let rec string_of_dirs ds (k:string -> Tot string) : Tot (dir_type ds) =
match ds with
| [] -> k ""
| Lit c :: ds' ->
coerce_eq () (
string_of_dirs ds' (fun res -> k (string_of_char c ^ res))
)
| Arg a :: ds' -> fun (x : arg_type a) ->
string_of_dirs ds' (fun res -> k (match a with
| Bool -> string_of_bool x
| Int -> string_of_int x
| Char -> string_of_char x
| String -> x) ^ res)
let example1 : string =
string_of_dirs [Arg Int; Arg String] (fun s -> s) 42 " answer"
exception InvalidFormatString
(* TODO: can we get rid of the two `let x` or are they really required? *)
reifiable let rec parse_format (s:list char) : Xex (list dir) =
match s with
| [] -> []
| '%' :: c :: s' ->
let d =
match c with
| '%' -> Lit '%'
| 'b' -> Arg Bool
| 'd' -> Arg Int
| 'c' -> Arg Char
| 's' -> Arg String
| _ -> raise InvalidFormatString
in let x = parse_format s' in d :: x
| '%' :: [] -> raise InvalidFormatString
| c :: s' -> let x = parse_format s' in Lit c :: x
let parse_format_pure (s:list char) : option (list dir) =
reify (parse_format s) ()
let rec parse_format_string (s:string) : Tot (option (list dir)) =
parse_format_pure (list_of_string s)
let sprintf (s:string{normalize_term #bool (Some? (parse_format_string s))})
: Tot (normalize_term (dir_type (Some?.v (parse_format_string s)))) =
string_of_dirs (Some?.v (parse_format_string s)) (fun s -> s) | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.String.fsti.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.fst.checked",
"FStar.Char.fsti.checked"
],
"interface_file": false,
"source_file": "SimplePrintfReify.fst"
} | [
{
"abbrev": true,
"full_module": "FStar.List.Tot",
"short_module": "List"
},
{
"abbrev": false,
"full_module": "FStar.String",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Char",
"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",
"short_module": null
}
] | {
"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_elim_box": false,
"smtencoding_l_arith_repr": "boxwrap",
"smtencoding_nl_arith_repr": "boxwrap",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": true,
"z3cliopt": [],
"z3refresh": false,
"z3rlimit": 5,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | false | FStar.Pervasives.Native.option (Prims.list SimplePrintfReify.dir) | Prims.Tot | [
"total"
] | [] | [
"SimplePrintfReify.parse_format_pure",
"Prims.Cons",
"FStar.String.char",
"Prims.Nil"
] | [] | false | false | false | true | false | let xxx =
| parse_format_pure ['%'; 'd'; '='; '%'; 's'] | false |
|
SimplePrintfReify.fst | SimplePrintfReify.example5 | val example5:string | val example5:string | let example5 : string =
sprintf "%d=%s" 42 " answer" | {
"file_name": "examples/printf/SimplePrintfReify.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 30,
"end_line": 167,
"start_col": 0,
"start_line": 166
} | (*
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 agreed to in writing, software
distributed under the License is distributed on an "AS IS" BASIS,
WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
See the License for the specific language governing permissions and
limitations under the License.
*)
module SimplePrintfReify
open FStar.Char
open FStar.String
module List = FStar.List.Tot
// A variant of SimplePrintf that uses reify on the Ex implementation
// of parse_format
// For a start here's an alpha renamed version of Ex to avoid clashes
// with the prims variant of Ex (which is not defined using dm4free
// and is not marked as `total`)
(* The underlying representation type *)
let ex (a:Type) = unit -> M (option a)
(* Monad definition *)
val return_ex : (a:Type) -> (x:a) -> Tot (ex a)
let return_ex a x = fun _ -> Some x
val bind_ex : (a:Type) -> (b:Type) -> (f:ex a) -> (g:a -> Tot (ex b)) -> Tot (ex b)
let bind_ex a b f g = fun _ ->
let r = f () in
match r with
| None -> None
| Some x -> g x ()
(* DMFF does not support yet polymorphic actions *)
(* Returning something in [False] allow to derive the usual raise below *)
let raise_ex (_:exn) : Tot (ex False) = fun _ -> None
(* Define the new effect using DM4F *)
total reifiable reflectable new_effect {
XEXN : (a:Type) -> Effect
with repr = ex
; bind = bind_ex
; return = return_ex
; raise = raise_ex
}
(* A lift from `Pure´ into the new effect *)
(* unfold let lift_pure_ex_wp (a:Type) (wp:pure_wp a) (_:unit) (p:XEXN?.post a) = *)
(* wp (fun a -> p (Some a)) *)
(* sub_effect PURE ~> XEXN = lift_pure_ex_wp *)
reifiable
let raise (#a:Type0) (e:exn) : XEXN a (fun _ p -> p None)
= let x = XEXN?.raise e in begin match x with end
(* An effect to alias easily write pre- and postconditions *)
(* Note: we use Type0 instead of XEXN.pre to avoid having to thunk everything. *)
effect Xexn (a:Type) (pre:Type0) (post:XEXN?.post a) =
XEXN a (fun (_:unit) (p:XEXN?.post a) -> pre /\
(forall (r:option a). (pre /\ post r) ==> p r))
(* Another alias. Ex a is the effect type for total exception-throwing
* programs. i.e. Any program of type `Ex a´ will throw or finish
* correctly, but never loop. *)
effect Xex (a:Type) = XEXN a (fun _ p -> forall (x:option a). p x)
// arguments to printf
type arg =
| Bool | Int | Char | String
// directives to printf
type dir =
| Lit : char -> dir
| Arg : arg -> dir
let arg_type (a:arg) : Tot Type0 =
match a with
| Bool -> bool
| Int -> int
| Char -> char
| String -> string
let rec dir_type (ds:list dir) : Tot Type0 =
match ds with
| [] -> string
| Lit c :: ds' -> dir_type ds'
| Arg a :: ds' -> arg_type a -> Tot (dir_type ds')
let dir_type' ds = dir_type ds
let rec string_of_dirs ds (k:string -> Tot string) : Tot (dir_type ds) =
match ds with
| [] -> k ""
| Lit c :: ds' ->
coerce_eq () (
string_of_dirs ds' (fun res -> k (string_of_char c ^ res))
)
| Arg a :: ds' -> fun (x : arg_type a) ->
string_of_dirs ds' (fun res -> k (match a with
| Bool -> string_of_bool x
| Int -> string_of_int x
| Char -> string_of_char x
| String -> x) ^ res)
let example1 : string =
string_of_dirs [Arg Int; Arg String] (fun s -> s) 42 " answer"
exception InvalidFormatString
(* TODO: can we get rid of the two `let x` or are they really required? *)
reifiable let rec parse_format (s:list char) : Xex (list dir) =
match s with
| [] -> []
| '%' :: c :: s' ->
let d =
match c with
| '%' -> Lit '%'
| 'b' -> Arg Bool
| 'd' -> Arg Int
| 'c' -> Arg Char
| 's' -> Arg String
| _ -> raise InvalidFormatString
in let x = parse_format s' in d :: x
| '%' :: [] -> raise InvalidFormatString
| c :: s' -> let x = parse_format s' in Lit c :: x
let parse_format_pure (s:list char) : option (list dir) =
reify (parse_format s) ()
let rec parse_format_string (s:string) : Tot (option (list dir)) =
parse_format_pure (list_of_string s)
let sprintf (s:string{normalize_term #bool (Some? (parse_format_string s))})
: Tot (normalize_term (dir_type (Some?.v (parse_format_string s)))) =
string_of_dirs (Some?.v (parse_format_string s)) (fun s -> s)
let yyy = parse_format_pure ['%'] == None
let xxx = parse_format_pure ['%'; 'd'; '='; '%'; 's']
let example_error_lemma () :
Lemma (parse_format_pure ['%'] == None) =
()
(* Bad interaction with raise, results in a Failure("Impossible") *)
(* assert_norm (parse_format_pure ['%'] == None) *)
let example3_lemma () :
Lemma (parse_format_pure ['%'; 'd'; '='; '%'; 's']
== Some [Arg Int; Lit '='; Arg String]) =
assert_norm (parse_format_pure ['%'; 'd'; '='; '%'; 's']
== Some [Arg Int; Lit '='; Arg String])
let example4_lemma () :
Lemma (parse_format_string "%d=%s" == Some [Arg Int; Lit '='; Arg String]) =
assert_norm (parse_format_string "%d=%s" == Some [Arg Int; Lit '='; Arg String]) | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.String.fsti.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.fst.checked",
"FStar.Char.fsti.checked"
],
"interface_file": false,
"source_file": "SimplePrintfReify.fst"
} | [
{
"abbrev": true,
"full_module": "FStar.List.Tot",
"short_module": "List"
},
{
"abbrev": false,
"full_module": "FStar.String",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Char",
"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",
"short_module": null
}
] | {
"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_elim_box": false,
"smtencoding_l_arith_repr": "boxwrap",
"smtencoding_nl_arith_repr": "boxwrap",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": true,
"z3cliopt": [],
"z3refresh": false,
"z3rlimit": 5,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | false | Prims.string | Prims.Tot | [
"total"
] | [] | [
"SimplePrintfReify.sprintf"
] | [] | false | false | false | true | false | let example5:string =
| sprintf "%d=%s" 42 " answer" | false |
SimplePrintfReify.fst | SimplePrintfReify.example3_lemma | val example3_lemma: Prims.unit
-> Lemma (parse_format_pure ['%'; 'd'; '='; '%'; 's'] == Some [Arg Int; Lit '='; Arg String]) | val example3_lemma: Prims.unit
-> Lemma (parse_format_pure ['%'; 'd'; '='; '%'; 's'] == Some [Arg Int; Lit '='; Arg String]) | let example3_lemma () :
Lemma (parse_format_pure ['%'; 'd'; '='; '%'; 's']
== Some [Arg Int; Lit '='; Arg String]) =
assert_norm (parse_format_pure ['%'; 'd'; '='; '%'; 's']
== Some [Arg Int; Lit '='; Arg String]) | {
"file_name": "examples/printf/SimplePrintfReify.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 54,
"end_line": 160,
"start_col": 0,
"start_line": 156
} | (*
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 agreed to in writing, software
distributed under the License is distributed on an "AS IS" BASIS,
WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
See the License for the specific language governing permissions and
limitations under the License.
*)
module SimplePrintfReify
open FStar.Char
open FStar.String
module List = FStar.List.Tot
// A variant of SimplePrintf that uses reify on the Ex implementation
// of parse_format
// For a start here's an alpha renamed version of Ex to avoid clashes
// with the prims variant of Ex (which is not defined using dm4free
// and is not marked as `total`)
(* The underlying representation type *)
let ex (a:Type) = unit -> M (option a)
(* Monad definition *)
val return_ex : (a:Type) -> (x:a) -> Tot (ex a)
let return_ex a x = fun _ -> Some x
val bind_ex : (a:Type) -> (b:Type) -> (f:ex a) -> (g:a -> Tot (ex b)) -> Tot (ex b)
let bind_ex a b f g = fun _ ->
let r = f () in
match r with
| None -> None
| Some x -> g x ()
(* DMFF does not support yet polymorphic actions *)
(* Returning something in [False] allow to derive the usual raise below *)
let raise_ex (_:exn) : Tot (ex False) = fun _ -> None
(* Define the new effect using DM4F *)
total reifiable reflectable new_effect {
XEXN : (a:Type) -> Effect
with repr = ex
; bind = bind_ex
; return = return_ex
; raise = raise_ex
}
(* A lift from `Pure´ into the new effect *)
(* unfold let lift_pure_ex_wp (a:Type) (wp:pure_wp a) (_:unit) (p:XEXN?.post a) = *)
(* wp (fun a -> p (Some a)) *)
(* sub_effect PURE ~> XEXN = lift_pure_ex_wp *)
reifiable
let raise (#a:Type0) (e:exn) : XEXN a (fun _ p -> p None)
= let x = XEXN?.raise e in begin match x with end
(* An effect to alias easily write pre- and postconditions *)
(* Note: we use Type0 instead of XEXN.pre to avoid having to thunk everything. *)
effect Xexn (a:Type) (pre:Type0) (post:XEXN?.post a) =
XEXN a (fun (_:unit) (p:XEXN?.post a) -> pre /\
(forall (r:option a). (pre /\ post r) ==> p r))
(* Another alias. Ex a is the effect type for total exception-throwing
* programs. i.e. Any program of type `Ex a´ will throw or finish
* correctly, but never loop. *)
effect Xex (a:Type) = XEXN a (fun _ p -> forall (x:option a). p x)
// arguments to printf
type arg =
| Bool | Int | Char | String
// directives to printf
type dir =
| Lit : char -> dir
| Arg : arg -> dir
let arg_type (a:arg) : Tot Type0 =
match a with
| Bool -> bool
| Int -> int
| Char -> char
| String -> string
let rec dir_type (ds:list dir) : Tot Type0 =
match ds with
| [] -> string
| Lit c :: ds' -> dir_type ds'
| Arg a :: ds' -> arg_type a -> Tot (dir_type ds')
let dir_type' ds = dir_type ds
let rec string_of_dirs ds (k:string -> Tot string) : Tot (dir_type ds) =
match ds with
| [] -> k ""
| Lit c :: ds' ->
coerce_eq () (
string_of_dirs ds' (fun res -> k (string_of_char c ^ res))
)
| Arg a :: ds' -> fun (x : arg_type a) ->
string_of_dirs ds' (fun res -> k (match a with
| Bool -> string_of_bool x
| Int -> string_of_int x
| Char -> string_of_char x
| String -> x) ^ res)
let example1 : string =
string_of_dirs [Arg Int; Arg String] (fun s -> s) 42 " answer"
exception InvalidFormatString
(* TODO: can we get rid of the two `let x` or are they really required? *)
reifiable let rec parse_format (s:list char) : Xex (list dir) =
match s with
| [] -> []
| '%' :: c :: s' ->
let d =
match c with
| '%' -> Lit '%'
| 'b' -> Arg Bool
| 'd' -> Arg Int
| 'c' -> Arg Char
| 's' -> Arg String
| _ -> raise InvalidFormatString
in let x = parse_format s' in d :: x
| '%' :: [] -> raise InvalidFormatString
| c :: s' -> let x = parse_format s' in Lit c :: x
let parse_format_pure (s:list char) : option (list dir) =
reify (parse_format s) ()
let rec parse_format_string (s:string) : Tot (option (list dir)) =
parse_format_pure (list_of_string s)
let sprintf (s:string{normalize_term #bool (Some? (parse_format_string s))})
: Tot (normalize_term (dir_type (Some?.v (parse_format_string s)))) =
string_of_dirs (Some?.v (parse_format_string s)) (fun s -> s)
let yyy = parse_format_pure ['%'] == None
let xxx = parse_format_pure ['%'; 'd'; '='; '%'; 's']
let example_error_lemma () :
Lemma (parse_format_pure ['%'] == None) =
()
(* Bad interaction with raise, results in a Failure("Impossible") *)
(* assert_norm (parse_format_pure ['%'] == None) *) | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.String.fsti.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.fst.checked",
"FStar.Char.fsti.checked"
],
"interface_file": false,
"source_file": "SimplePrintfReify.fst"
} | [
{
"abbrev": true,
"full_module": "FStar.List.Tot",
"short_module": "List"
},
{
"abbrev": false,
"full_module": "FStar.String",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Char",
"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",
"short_module": null
}
] | {
"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_elim_box": false,
"smtencoding_l_arith_repr": "boxwrap",
"smtencoding_nl_arith_repr": "boxwrap",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": true,
"z3cliopt": [],
"z3refresh": false,
"z3rlimit": 5,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | false | _: Prims.unit
-> FStar.Pervasives.Lemma
(ensures
SimplePrintfReify.parse_format_pure ['%'; 'd'; '='; '%'; 's'] ==
FStar.Pervasives.Native.Some
[
SimplePrintfReify.Arg SimplePrintfReify.Int;
SimplePrintfReify.Lit '=';
SimplePrintfReify.Arg SimplePrintfReify.String
]) | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Prims.unit",
"FStar.Pervasives.assert_norm",
"Prims.eq2",
"FStar.Pervasives.Native.option",
"Prims.list",
"SimplePrintfReify.dir",
"SimplePrintfReify.parse_format_pure",
"Prims.Cons",
"FStar.String.char",
"Prims.Nil",
"FStar.Pervasives.Native.Some",
"SimplePrintfReify.Arg",
"SimplePrintfReify.Int",
"SimplePrintfReify.Lit",
"SimplePrintfReify.String",
"Prims.l_True",
"Prims.squash",
"FStar.Pervasives.pattern"
] | [] | true | false | true | false | false | let example3_lemma ()
: Lemma (parse_format_pure ['%'; 'd'; '='; '%'; 's'] == Some [Arg Int; Lit '='; Arg String]) =
| assert_norm (parse_format_pure ['%'; 'd'; '='; '%'; 's'] == Some [Arg Int; Lit '='; Arg String]) | false |
LowParse.Low.Sum.fst | LowParse.Low.Sum.jump_dsum | val jump_dsum
(#kt: parser_kind)
(t: dsum)
(#p: parser kt (dsum_repr_type t))
(v: jumper p)
(p32: leaf_reader p)
(f: (x: dsum_known_key t -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x))))
(f32: (x: dsum_known_key t -> Tot (jumper (dsnd (f x)))))
(#k': parser_kind)
(#g: parser k' (dsum_type_of_unknown_tag t))
(g32: jumper g)
(destr: dep_maybe_enum_destr_t (dsum_enum t) (jump_dsum_cases_t t f g))
: Tot (jumper (parse_dsum t p f g)) | val jump_dsum
(#kt: parser_kind)
(t: dsum)
(#p: parser kt (dsum_repr_type t))
(v: jumper p)
(p32: leaf_reader p)
(f: (x: dsum_known_key t -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x))))
(f32: (x: dsum_known_key t -> Tot (jumper (dsnd (f x)))))
(#k': parser_kind)
(#g: parser k' (dsum_type_of_unknown_tag t))
(g32: jumper g)
(destr: dep_maybe_enum_destr_t (dsum_enum t) (jump_dsum_cases_t t f g))
: Tot (jumper (parse_dsum t p f g)) | let jump_dsum
(#kt: parser_kind)
(t: dsum)
(#p: parser kt (dsum_repr_type t))
(v: jumper p)
(p32: leaf_reader p)
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(f32: (x: dsum_known_key t) -> Tot (jumper (dsnd (f x))))
(#k': parser_kind)
(#g: parser k' (dsum_type_of_unknown_tag t))
(g32: jumper g)
(destr: dep_maybe_enum_destr_t (dsum_enum t) (jump_dsum_cases_t t f g))
: Tot (jumper (parse_dsum t p f g))
= fun #rrel #rel input pos ->
let h = HST.get () in
[@inline_let]
let _ = parse_dsum_eq' t p f g (bytes_of_slice_from h input pos) in
[@inline_let]
let _ = valid_facts (parse_dsum t p f g) h input pos in
[@inline_let]
let _ = valid_facts p h input pos in
let pos_after_tag = v input pos in
let tg = p32 input pos in
[@inline_let]
let _ = valid_facts (parse_dsum_cases' t f g (maybe_enum_key_of_repr (dsum_enum t) tg)) h input pos_after_tag in
destr (jump_dsum_cases_eq t f g) (jump_dsum_cases_if t f g) (fun _ _ -> ()) (fun _ _ _ _ -> ()) (jump_dsum_cases' t f f32 g32) tg input pos_after_tag | {
"file_name": "src/lowparse/LowParse.Low.Sum.fst",
"git_rev": "00217c4a89f5ba56002ba9aa5b4a9d5903bfe9fa",
"git_url": "https://github.com/project-everest/everparse.git",
"project_name": "everparse"
} | {
"end_col": 151,
"end_line": 1508,
"start_col": 0,
"start_line": 1483
} | module LowParse.Low.Sum
include LowParse.Low.Enum
include LowParse.Spec.Sum
module U32 = FStar.UInt32
module HST = FStar.HyperStack.ST
module B = LowStar.Buffer
module Cast = FStar.Int.Cast
module U64 = FStar.UInt64
inline_for_extraction
let validate_sum_cases_aux
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(vc: ((x: sum_key t) -> Tot (validator (dsnd (pc x)))))
(k: sum_key t)
: Tot (validator (parse_sum_cases t pc k))
= [@inline_let]
let _ = synth_sum_case_injective t k in
validate_synth
(validate_weaken
(weaken_parse_cases_kind t pc)
(vc k)
()
)
(synth_sum_case t k)
()
inline_for_extraction
let validate_sum_cases_t
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot Type
= validator (parse_sum_cases t pc k)
let validate_sum_cases_t_eq
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
(x y : validate_sum_cases_t t pc k)
: GTot Type0
= True
inline_for_extraction
let validate_sum_cases_t_if
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (if_combinator _ (validate_sum_cases_t_eq t pc k))
= fun cond (sv_true: cond_true cond -> Tot (validate_sum_cases_t t pc k)) (sv_false: cond_false cond -> Tot (validate_sum_cases_t t pc k)) #rrel #rel input pos ->
if cond
then sv_true () input pos
else sv_false () input pos
inline_for_extraction
let validate_sum_cases
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(vc: ((x: sum_key t) -> Tot (validator (dsnd (pc x)))))
(destr: dep_enum_destr (sum_enum t) (validate_sum_cases_t t pc))
(k: sum_key t)
: Tot (validator (parse_sum_cases t pc k))
= destr
_
(validate_sum_cases_t_if t pc)
(fun _ _ -> ())
(fun _ _ _ _ -> ())
(validate_sum_cases_aux t pc vc)
k
inline_for_extraction
let validate_sum_aux_payload_t
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
: Tot Type
= (#rrel: _) -> (#rel: _) ->
(input: slice rrel rel) ->
(pos: U64.t) ->
HST.Stack U64.t
(requires (fun h -> live_slice h input /\ U64.v pos <= U32.v input.len))
(ensures (fun h res h' ->
B.modifies B.loc_none h h' /\ (
match k with
| Unknown _ -> is_error res
| Known k' ->
if is_success res
then
valid_pos (dsnd (pc k')) h input (uint64_to_uint32 pos) (uint64_to_uint32 res)
else
(~ (valid (dsnd (pc k')) h input (uint64_to_uint32 pos)))
)))
let validate_sum_aux_payload_eq
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
: Tot (validate_sum_aux_payload_t t pc k -> validate_sum_aux_payload_t t pc k -> GTot Type0)
= fun _ _ -> True
inline_for_extraction
let validate_sum_aux_payload_if'
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
(cond: bool)
(ift: ((cond_true cond) -> Tot (validate_sum_aux_payload_t t pc k)))
(iff: ((cond_false cond) -> Tot (validate_sum_aux_payload_t t pc k)))
: Tot (validate_sum_aux_payload_t t pc k)
= fun #rrel #rel input pos ->
if cond
then begin
(ift () <: validate_sum_aux_payload_t t pc k) input pos
end else
(iff () <: validate_sum_aux_payload_t t pc k) input pos
inline_for_extraction
let validate_sum_aux_payload_if
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
: Tot (if_combinator _ (validate_sum_aux_payload_eq t pc k))
= validate_sum_aux_payload_if' t pc k
#push-options "--z3rlimit 64 --z3cliopt smt.arith.nl=false --using_facts_from '* -FStar.Int.Cast -LowParse.BitFields'"
// --query_stats --smtencoding.elim_box true --smtencoding.l_arith_repr native --z3refresh"
inline_for_extraction
let validate_sum_aux
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(v: validator p)
(p32: leaf_reader p)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(v_payload: ((k: sum_repr_type t)) -> Tot (validate_sum_aux_payload_t t pc (maybe_enum_key_of_repr (sum_enum t) k)))
: Tot (validator (parse_sum t p pc))
= fun #rrel #rel input pos ->
let h = HST.get () in
[@inline_let]
let _ = parse_sum_eq'' t p pc (bytes_of_slice_from h input (uint64_to_uint32 pos)) in
[@inline_let]
let _ = valid_facts (parse_sum t p pc) h input (uint64_to_uint32 pos) in
[@inline_let]
let _ = valid_facts p h input (uint64_to_uint32 pos) in
let len_after_tag = v input pos in
if is_error len_after_tag
then len_after_tag
else begin
let h1 = HST.get () in
let k' = p32 input (uint64_to_uint32 pos) in
[@inline_let]
let _ =
match maybe_enum_key_of_repr (sum_enum t) k' with
| Known k -> valid_facts (dsnd (pc k)) h input (uint64_to_uint32 len_after_tag)
| _ -> ()
in
v_payload k' input len_after_tag
end
#pop-options
inline_for_extraction
let validate_sum_aux_payload'
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (validator (dsnd (pc x)))))
(k: maybe_enum_key (sum_enum t))
: Tot (validate_sum_aux_payload_t t pc k)
= fun #rrel #rel input pos ->
match k with
| Known k ->
[@inline_let]
let _ = synth_sum_case_injective t k in
pc32 k input pos
// validate_synth (pc32 k) (synth_sum_case t k) () input pos
| _ -> validator_error_generic
inline_for_extraction
let validate_sum_aux_payload
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (validator (dsnd (pc x)))))
(destr: dep_maybe_enum_destr_t (sum_enum t) (validate_sum_aux_payload_t t pc))
(k: sum_repr_type t)
: Tot (validate_sum_aux_payload_t t pc (maybe_enum_key_of_repr (sum_enum t) k))
= destr (validate_sum_aux_payload_eq t pc) (validate_sum_aux_payload_if t pc) (fun _ _ -> ()) (fun _ _ _ _ -> ()) (validate_sum_aux_payload' t pc pc32) k
inline_for_extraction
let validate_sum
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(v: validator p)
(p32: leaf_reader p)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (validator (dsnd (pc x)))))
(destr: dep_maybe_enum_destr_t (sum_enum t) (validate_sum_aux_payload_t t pc))
: Tot (validator (parse_sum t p pc))
= validate_sum_aux t v p32 pc (validate_sum_aux_payload t pc pc32 destr)
module HS = FStar.HyperStack
#push-options "--z3rlimit 256 --z3cliopt smt.arith.nl=false --initial_ifuel 8 --max_ifuel 8 --initial_fuel 2 --max_fuel 2"
#restart-solver
let valid_sum_intro
(h: HS.mem)
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: Lemma
(requires (
valid (parse_enum_key p (sum_enum t)) h input pos /\ (
let k = contents (parse_enum_key p (sum_enum t)) h input pos in
valid (dsnd (pc k)) h input (get_valid_pos (parse_enum_key p (sum_enum t)) h input pos)
)))
(ensures (
let k = contents (parse_enum_key p (sum_enum t)) h input pos in
let pos_payload = get_valid_pos (parse_enum_key p (sum_enum t)) h input pos in
valid_content_pos
(parse_sum t p pc) h input pos
(synth_sum_case t k (contents (dsnd (pc k)) h input pos_payload))
(get_valid_pos (dsnd (pc k)) h input pos_payload)
))
= valid_facts (parse_enum_key p (sum_enum t)) h input pos;
let k = contents (parse_enum_key p (sum_enum t)) h input pos in
let pos_payload = get_valid_pos (parse_enum_key p (sum_enum t)) h input pos in
valid_facts (dsnd (pc k)) h input pos_payload;
valid_facts (parse_sum t p pc) h input pos;
parse_sum_eq t p pc (bytes_of_slice_from h input pos)
#pop-options
inline_for_extraction
let finalize_sum_case
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(s: serializer p)
(w: leaf_writer_strong s)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(destr: enum_repr_of_key'_t (sum_enum t))
(k: sum_key t)
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: HST.Stack unit
(requires (fun h ->
let len_tag = serialized_length (serialize_enum_key _ s (sum_enum t)) k in
U32.v pos + len_tag < 4294967296 /\ (
let pos_payload = pos `U32.add` U32.uint_to_t len_tag in
valid (dsnd (pc k)) h input pos_payload /\
writable input.base (U32.v pos) (U32.v pos_payload) h
)))
(ensures (fun h _ h' ->
let len_tag = serialized_length (serialize_enum_key _ s (sum_enum t)) k in
let pos_payload = pos `U32.add` U32.uint_to_t len_tag in
B.modifies (loc_slice_from_to input pos pos_payload) h h' /\
valid_content_pos (parse_sum t p pc) h' input pos (synth_sum_case t k (contents (dsnd (pc k)) h input pos_payload)) (get_valid_pos (dsnd (pc k)) h input pos_payload)
))
= let pos1 = write_enum_key w (sum_enum t) destr k input pos in
let h = HST.get () in
[@inline_let]
let _ = valid_sum_intro h t p pc input pos in
()
inline_for_extraction
let jump_sum_cases_aux
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(vc: ((x: sum_key t) -> Tot (jumper (dsnd (pc x)))))
(k: sum_key t)
: Tot (jumper (parse_sum_cases t pc k))
= [@inline_let]
let _ = synth_sum_case_injective t k in
jump_synth
(jump_weaken
(weaken_parse_cases_kind t pc)
(vc k)
()
)
(synth_sum_case t k)
()
inline_for_extraction
let jump_sum_cases_t
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot Type
= jumper (parse_sum_cases t pc k)
let jump_sum_cases_t_eq
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
(x y : jump_sum_cases_t t pc k)
: GTot Type0
= True
inline_for_extraction
let jump_sum_cases_t_if
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (if_combinator _ (jump_sum_cases_t_eq t pc k))
= fun cond (sv_true: cond_true cond -> Tot (jump_sum_cases_t t pc k)) (sv_false: cond_false cond -> Tot (jump_sum_cases_t t pc k)) #rrel #rel input pos ->
if cond
then sv_true () input pos
else sv_false () input pos
inline_for_extraction
let jump_sum_cases
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(vc: ((x: sum_key t) -> Tot (jumper (dsnd (pc x)))))
(destr: dep_enum_destr (sum_enum t) (jump_sum_cases_t t pc))
(k: sum_key t)
: Tot (jumper (parse_sum_cases t pc k))
= destr
_
(jump_sum_cases_t_if t pc)
(fun _ _ -> ())
(fun _ _ _ _ -> ())
(jump_sum_cases_aux t pc vc)
k
inline_for_extraction
let jump_sum_aux_payload_t
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
: Tot Type
= (#rrel: _) -> (#rel: _) ->
(input: slice rrel rel) ->
(pos: U32.t) ->
HST.Stack U32.t
(requires (fun h -> live_slice h input /\ U32.v pos <= U32.v input.len /\ (
match k with
| Unknown _ -> False
| Known k' -> valid (dsnd (pc k')) h input pos
)))
(ensures (fun h res h' ->
B.modifies B.loc_none h h' /\ (
match k with
| Unknown _ -> False
| Known k' ->
valid_pos (dsnd (pc k')) h input pos res
)))
let jump_sum_aux_payload_eq
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
: Tot (jump_sum_aux_payload_t t pc k -> jump_sum_aux_payload_t t pc k -> GTot Type0)
= fun _ _ -> True
inline_for_extraction
let jump_sum_aux_payload_if'
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
(cond: bool)
(ift: ((cond_true cond) -> Tot (jump_sum_aux_payload_t t pc k)))
(iff: ((cond_false cond) -> Tot (jump_sum_aux_payload_t t pc k)))
: Tot (jump_sum_aux_payload_t t pc k)
= fun #rrel #rel input pos ->
if cond
then begin
(ift () <: jump_sum_aux_payload_t t pc k) input pos
end else
(iff () <: jump_sum_aux_payload_t t pc k) input pos
inline_for_extraction
let jump_sum_aux_payload_if
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
: Tot (if_combinator _ (jump_sum_aux_payload_eq t pc k))
= jump_sum_aux_payload_if' t pc k
let parse_sum_eq3
(#kt: parser_kind)
(t: sum)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(input: bytes)
(k' : sum_repr_type t)
(consumed_k: consumed_length input)
: Lemma
(requires (Some? (parse (parse_sum t p pc) input) /\ parse p input == Some (k', consumed_k)))
(ensures (
let input_k = Seq.slice input consumed_k (Seq.length input) in
let k = maybe_enum_key_of_repr (sum_enum t) k' in
begin match k with
| Known k ->
Some? (parse (dsnd (pc k)) input_k)
| _ -> False
end
))
= parse_sum_eq'' t p pc input
let parse_sum_eq4
(#kt: parser_kind)
(t: sum)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(input: bytes)
(k' : sum_repr_type t)
(consumed_k: consumed_length input)
(consumed_payload: nat)
: Lemma
(requires (Some? (parse (parse_sum t p pc) input) /\ parse p input == Some (k', consumed_k) /\ (
let input_k = Seq.slice input consumed_k (Seq.length input) in
let k = maybe_enum_key_of_repr (sum_enum t) k' in
begin match k with
| Known k ->
Some? (parse (dsnd (pc k)) input_k) /\ (
let Some (_, consumed_payload') = parse (dsnd (pc k)) input_k in
consumed_payload' == consumed_payload
)
| _ -> False
end
)))
(ensures (
let Some (_, consumed) = parse (parse_sum t p pc) input in
consumed == consumed_k + consumed_payload
))
= parse_sum_eq'' t p pc input
#push-options "--z3rlimit 16"
let valid_sum_elim
(h: HS.mem)
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(#rrel: _) (#rel: _)
(input: slice rrel rel)
(pos: U32.t)
: Lemma
(requires (
valid (parse_sum t p pc) h input pos
))
(ensures (
valid p h input pos /\ (
let pos_payload = get_valid_pos p h input pos in
let k' = maybe_enum_key_of_repr (sum_enum t) (contents p h input pos) in
match k' with
| Known k ->
k == sum_tag_of_data t (contents (parse_sum t p pc) h input pos) /\
valid (dsnd (pc k)) h input pos_payload /\
valid_pos
(parse_sum t p pc) h input pos
(get_valid_pos (dsnd (pc k)) h input pos_payload)
| _ -> False
)))
= let sinput = bytes_of_slice_from h input pos in
let _ = parse_sum_eq'' t p pc sinput in
[@inline_let]
let _ = valid_facts (parse_sum t p pc) h input pos in
let Some (k', consumed_k) = parse p sinput in
let pos_after_tag = U32.uint_to_t (U32.v pos + consumed_k) in
[@inline_let]
let _ = valid_facts p h input pos in
assert (valid_content_pos p h input pos k' pos_after_tag);
match maybe_enum_key_of_repr (sum_enum t) k' with
| Known k -> valid_facts (dsnd (pc k)) h input pos_after_tag
| _ -> ()
#pop-options
let valid_sum_elim_tag
(h: HS.mem)
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: Lemma
(requires (
valid (parse_sum t p pc) h input pos
))
(ensures (
valid (parse_enum_key p (sum_enum t)) h input pos /\
contents (parse_enum_key p (sum_enum t)) h input pos == sum_tag_of_data t (contents (parse_sum t p pc) h input pos)
))
= let _ = parse_sum_eq' t p pc (bytes_of_slice_from h input pos) in
let _ = valid_facts (parse_sum t p pc) h input pos in
let _ = valid_facts (parse_enum_key p (sum_enum t)) h input pos in
()
inline_for_extraction
let read_sum_tag
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(p32: leaf_reader p)
(destr: dep_maybe_enum_destr_t (sum_enum t) (read_enum_key_t (sum_enum t)))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: HST.Stack (sum_key t)
(requires (fun h ->
valid (parse_sum t p pc) h input pos
))
(ensures (fun h res h' ->
B.modifies B.loc_none h h' /\
res == sum_tag_of_data t (contents (parse_sum t p pc) h input pos)
))
= let h = HST.get () in
[@inline_let] let _ = valid_sum_elim_tag h t p pc input pos in
read_enum_key p32 (sum_enum t) destr input pos
inline_for_extraction
let jump_sum_aux
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(v: jumper p)
(p32: leaf_reader p)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(v_payload: ((k: sum_repr_type t)) -> Tot (jump_sum_aux_payload_t t pc (maybe_enum_key_of_repr (sum_enum t) k)))
: Tot (jumper (parse_sum t p pc))
= fun #rrel #rel input pos ->
let h = HST.get () in
[@inline_let]
let _ = valid_sum_elim h t p pc input pos in
let pos_after_tag = v input pos in
let k' = p32 input pos in
v_payload k' input pos_after_tag
inline_for_extraction
let jump_sum_aux_payload'
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (jumper (dsnd (pc x)))))
(k: maybe_enum_key (sum_enum t))
: Tot (jump_sum_aux_payload_t t pc k)
= fun #rrel #rel input pos ->
match k with
| Known k ->
[@inline_let]
let _ = synth_sum_case_injective t k in
pc32 k input pos
| _ -> 0ul // dummy, but we MUST NOT remove this branch, otherwise extraction fails
inline_for_extraction
let jump_sum_aux_payload
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (jumper (dsnd (pc x)))))
(destr: dep_maybe_enum_destr_t (sum_enum t) (jump_sum_aux_payload_t t pc))
(k: sum_repr_type t)
: Tot (jump_sum_aux_payload_t t pc (maybe_enum_key_of_repr (sum_enum t) k))
= destr (jump_sum_aux_payload_eq t pc) (jump_sum_aux_payload_if t pc) (fun _ _ -> ()) (fun _ _ _ _ -> ()) (jump_sum_aux_payload' t pc pc32) k
inline_for_extraction
let jump_sum
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(v: jumper p)
(p32: leaf_reader p)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (jumper (dsnd (pc x)))))
(destr: dep_maybe_enum_destr_t (sum_enum t) (jump_sum_aux_payload_t t pc))
: Tot (jumper (parse_sum t p pc))
= jump_sum_aux t v p32 pc (jump_sum_aux_payload t pc pc32 destr)
inline_for_extraction
let read_sum_cases'
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (leaf_reader (dsnd (pc x)))))
(k: sum_key t)
: Tot (leaf_reader (parse_sum_cases' t pc k))
= [@inline_let]
let _ = synth_sum_case_injective t k in
read_synth'
(dsnd (pc k))
(synth_sum_case t k)
(pc32 k)
()
inline_for_extraction
let read_sum_cases_t
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot Type
= leaf_reader (parse_sum_cases' t pc k)
let read_sum_cases_t_eq
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
(x y : read_sum_cases_t t pc k)
: GTot Type0
= True
inline_for_extraction
let read_sum_cases_t_if
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (if_combinator _ (read_sum_cases_t_eq t pc k))
= fun cond (sv_true: cond_true cond -> Tot (read_sum_cases_t t pc k)) (sv_false: cond_false cond -> Tot (read_sum_cases_t t pc k)) #_ #_ input pos ->
if cond
then (sv_true () input pos)
else (sv_false () input pos)
inline_for_extraction
let read_sum_cases
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (leaf_reader (dsnd (pc x)))))
(destr: dep_enum_destr (sum_enum t) (read_sum_cases_t t pc))
(k: sum_key t)
: Tot (leaf_reader (parse_sum_cases' t pc k))
= destr
_
(read_sum_cases_t_if t pc)
(fun _ _ -> ())
(fun _ _ _ _ -> ())
(read_sum_cases' t pc pc32)
k
#push-options "--z3rlimit 32"
inline_for_extraction
let read_sum
(#kt: parser_kind)
(t: sum)
(p: parser kt (sum_repr_type t))
(p32: leaf_reader (parse_enum_key p (sum_enum t)))
(j: jumper p)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (leaf_reader (dsnd (pc x)))))
(destr: dep_enum_destr (sum_enum t) (read_sum_cases_t t pc))
: Tot (leaf_reader (parse_sum t p pc))
=
fun #_ #_ input pos ->
let h = HST.get () in
valid_facts (parse_sum t p pc) h input pos;
parse_sum_eq' t p pc (bytes_of_slice_from h input pos);
valid_facts (parse_enum_key p (sum_enum t)) h input pos;
let k = p32 input pos in
let pos' = jump_enum_key j (sum_enum t) input pos in
valid_facts (parse_sum_cases' t pc k) h input pos' ;
read_sum_cases t pc pc32 destr k input pos'
#pop-options
inline_for_extraction
let serialize32_sum_cases_t
(t: sum)
(#pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(sc: ((x: sum_key t) -> Tot (serializer (dsnd (pc x)))))
(k: sum_key t)
: Tot Type
= serializer32 (serialize_sum_cases t pc sc k)
let serialize32_sum_cases_t_eq
(t: sum)
(#pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(sc: ((x: sum_key t) -> Tot (serializer (dsnd (pc x)))))
(k: sum_key t)
(x y: serialize32_sum_cases_t t sc k)
: GTot Type0
= True
inline_for_extraction
let serialize32_sum_cases_t_if
(t: sum)
(#pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(sc: ((x: sum_key t) -> Tot (serializer (dsnd (pc x)))))
(k: sum_key t)
: Tot (if_combinator _ (serialize32_sum_cases_t_eq t sc k))
= fun cond (sv_true: (cond_true cond -> Tot (serialize32_sum_cases_t t sc k))) (sv_false: (cond_false cond -> Tot (serialize32_sum_cases_t t sc k))) x #rrel #rel b pos ->
if cond
then (sv_true () x b pos)
else (sv_false () x b pos)
inline_for_extraction
let serialize32_sum_cases_aux
(t: sum)
(#pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(sc: ((x: sum_key t) -> Tot (serializer (dsnd (pc x)))))
(sc32: ((x: sum_key t) -> Tot (serializer32 (sc x))))
(k: sum_key t)
: Tot (serializer32 (serialize_sum_cases t pc sc k))
= fun x #rrel #rel b pos ->
[@inline_let] let _ =
Classical.forall_intro (parse_sum_cases_eq' t pc k);
synth_sum_case_injective t k;
synth_sum_case_inverse t k
in
serialize32_synth
(sc32 k)
(synth_sum_case t k)
(synth_sum_case_recip t k)
(fun x -> synth_sum_case_recip t k x)
()
x
b
pos
inline_for_extraction
let serialize32_sum_cases
(t: sum)
(#pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(sc: ((x: sum_key t) -> Tot (serializer (dsnd (pc x)))))
(sc32: ((x: sum_key t) -> Tot (serializer32 (sc x))))
(destr: dep_enum_destr (sum_enum t) (serialize32_sum_cases_t t sc))
(k: sum_key t)
: Tot (serializer32 (serialize_sum_cases t pc sc k))
= destr
_
(serialize32_sum_cases_t_if t sc)
(fun _ _ -> ())
(fun _ _ _ _ -> ())
(serialize32_sum_cases_aux t sc sc32)
k
inline_for_extraction
let serialize32_sum
(#kt: parser_kind)
(t: sum)
(#p: parser kt (sum_repr_type t))
(s: serializer p {kt.parser_kind_subkind == Some ParserStrong})
(s32: serializer32 (serialize_enum_key _ s (sum_enum t)))
(#pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(sc: ((x: sum_key t) -> Tot (serializer (dsnd (pc x)))))
(sc32: ((x: sum_key t) -> Tot (serializer32 (sc x))))
(destr: dep_enum_destr (sum_enum t) (serialize32_sum_cases_t t sc))
: Tot (serializer32 (serialize_sum t s sc))
= fun x #rrel #rel b pos ->
serialize_sum_eq t s sc x;
let tg = sum_tag_of_data t x in
serialize32_nondep_then_aux s32 (serialize32_sum_cases t sc sc32 destr tg) tg x b pos
let clens_sum_tag
(s: sum)
: Tot (clens (sum_type s) (sum_key s))
= {
clens_cond = (fun _ -> True);
clens_get = sum_tag_of_data s;
}
let gaccessor_sum_tag
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
: Tot (gaccessor (parse_sum t p pc) (parse_enum_key p (sum_enum t)) (clens_sum_tag t))
= gaccessor_tagged_union_tag
(parse_enum_key p (sum_enum t))
(sum_tag_of_data t)
(parse_sum_cases t pc)
inline_for_extraction
let accessor_sum_tag
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
: Tot (accessor (gaccessor_sum_tag t p pc))
= accessor_tagged_union_tag
(parse_enum_key p (sum_enum t))
(sum_tag_of_data t)
(parse_sum_cases t pc)
let clens_sum_payload
(s: sum)
(k: sum_key s)
: Tot (clens (sum_type s) (sum_type_of_tag s k))
= {
clens_cond = (fun (x: sum_type s) -> sum_tag_of_data s x == k);
clens_get = (fun (x: sum_type s) -> synth_sum_case_recip s k x <: Ghost (sum_type_of_tag s k) (requires (sum_tag_of_data s x == k)) (ensures (fun _ -> True)));
}
#push-options "--z3rlimit 32"
let gaccessor_clens_sum_payload'
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (gaccessor' (parse_sum t p pc) (dsnd (pc k)) (clens_sum_payload t k))
= fun (input: bytes) ->
parse_sum_eq'' t p pc input;
let res =
match parse p input with
| Some (_, consumed) ->
synth_sum_case_inverse t k;
synth_sum_case_injective t k;
synth_injective_synth_inverse_synth_inverse_recip (synth_sum_case t k) (synth_sum_case_recip t k) ();
(consumed)
| _ -> 0 // dummy
in
(res <: (res: _ { gaccessor_post' (parse_sum t p pc) (dsnd (pc k)) (clens_sum_payload t k) input res } ))
#push-options "--z3rlimit 64"
let gaccessor_clens_sum_payload_injective
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
(sl sl' : bytes)
: Lemma
(requires (
gaccessor_pre (parse_sum t p pc) (dsnd (pc k)) (clens_sum_payload t k) sl /\
gaccessor_pre (parse_sum t p pc) (dsnd (pc k)) (clens_sum_payload t k) sl' /\
injective_precond (parse_sum t p pc) sl sl'
))
(ensures (gaccessor_clens_sum_payload' t p pc k sl == gaccessor_clens_sum_payload' t p pc k sl'))
= parse_sum_eq'' t p pc sl;
parse_sum_eq'' t p pc sl' ;
parse_injective (parse_sum t p pc) sl sl' ;
parse_injective p sl sl'
#pop-options
let gaccessor_clens_sum_payload_no_lookahead
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
(sl sl' : bytes)
: Lemma
(requires (
(parse_sum_kind kt t pc).parser_kind_subkind == Some ParserStrong /\
gaccessor_pre (parse_sum t p pc) (dsnd (pc k)) (clens_sum_payload t k) sl /\
gaccessor_pre (parse_sum t p pc) (dsnd (pc k)) (clens_sum_payload t k) sl' /\
no_lookahead_on_precond (parse_sum t p pc) sl sl'
))
(ensures (gaccessor_clens_sum_payload' t p pc k sl == gaccessor_clens_sum_payload' t p pc k sl'))
= parse_sum_eq'' t p pc sl;
parse_sum_eq'' t p pc sl' ;
parse_strong_prefix (parse_sum t p pc) sl sl' ;
parse_injective p sl sl'
let gaccessor_clens_sum_payload
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (gaccessor (parse_sum t p pc) (dsnd (pc k)) (clens_sum_payload t k))
= Classical.forall_intro_2 (fun x -> Classical.move_requires (gaccessor_clens_sum_payload_injective t p pc k x));
Classical.forall_intro_2 (fun x -> Classical.move_requires (gaccessor_clens_sum_payload_no_lookahead t p pc k x));
gaccessor_prop_equiv (parse_sum t p pc) (dsnd (pc k)) (clens_sum_payload t k) (gaccessor_clens_sum_payload' t p pc k);
gaccessor_clens_sum_payload' t p pc k
inline_for_extraction
let accessor_clens_sum_payload'
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(j: jumper p)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: HST.Stack U32.t
(requires (fun h ->
valid (parse_sum t p pc) h input pos /\
(clens_sum_payload t k).clens_cond (contents (parse_sum t p pc) h input pos)
))
(ensures (fun h pos' h' ->
B.modifies B.loc_none h h' /\
pos' == slice_access h (gaccessor_clens_sum_payload t p pc k) input pos
))
=
let h = HST.get () in
[@inline_let]
let _ =
let pos' = get_valid_pos (parse_sum t p pc) h input pos in
let large = bytes_of_slice_from h input pos in
slice_access_eq h (gaccessor_clens_sum_payload t p pc k) input pos;
valid_facts (parse_sum t p pc) h input pos;
parse_sum_eq'' t p pc large;
valid_facts p h input pos
in
j input pos
#pop-options
inline_for_extraction
let accessor_clens_sum_payload
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(j: jumper p)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (accessor (gaccessor_clens_sum_payload t p pc k))
= fun #rrel #rel -> accessor_clens_sum_payload' t j pc k #rrel #rel
let clens_sum_cases_payload
(s: sum)
(k: sum_key s)
: Tot (clens (sum_cases s k) (sum_type_of_tag s k))
= {
clens_cond = (fun (x: sum_cases s k) -> True);
clens_get = (fun (x: sum_cases s k) -> synth_sum_case_recip s k x <: Ghost (sum_type_of_tag s k) (requires (True)) (ensures (fun _ -> True)));
}
let gaccessor_clens_sum_cases_payload
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (gaccessor (parse_sum_cases' t pc k) (dsnd (pc k)) (clens_sum_cases_payload t k))
= synth_sum_case_injective t k;
synth_sum_case_inverse t k;
synth_injective_synth_inverse_synth_inverse_recip (synth_sum_case t k) (synth_sum_case_recip t k) ();
gaccessor_ext
(gaccessor_synth (dsnd (pc k)) (synth_sum_case t k) (synth_sum_case_recip t k) ())
(clens_sum_cases_payload t k)
()
inline_for_extraction
let accessor_clens_sum_cases_payload
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (accessor (gaccessor_clens_sum_cases_payload t pc k))
= [@inline_let]
let _ =
synth_sum_case_injective t k;
synth_sum_case_inverse t k;
synth_injective_synth_inverse_synth_inverse_recip (synth_sum_case t k) (synth_sum_case_recip t k) ()
in
accessor_ext
(accessor_synth (dsnd (pc k)) (synth_sum_case t k) (synth_sum_case_recip t k) ())
(clens_sum_cases_payload t k)
()
inline_for_extraction
let validate_dsum_cases_t
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(#k: parser_kind)
(g: parser k (dsum_type_of_unknown_tag s))
(x: dsum_key s)
: Tot Type
= validator (parse_dsum_cases' s f g x)
let validate_dsum_cases_eq
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(#k: parser_kind)
(g: parser k (dsum_type_of_unknown_tag s))
(x: dsum_key s)
(v1 v2 : validate_dsum_cases_t s f g x)
: GTot Type0
= True
inline_for_extraction
let validate_dsum_cases_if'
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(#k: parser_kind)
(g: parser k (dsum_type_of_unknown_tag s))
(x: dsum_key s)
(cond: bool)
(ift: (cond_true cond -> Tot (validate_dsum_cases_t s f g x)))
(iff: (cond_false cond -> Tot (validate_dsum_cases_t s f g x)))
: Tot (validate_dsum_cases_t s f g x)
= fun #rrel #rel input len ->
if cond
then (ift () <: validate_dsum_cases_t s f g x) input len
else (iff () <: validate_dsum_cases_t s f g x) input len
inline_for_extraction
let validate_dsum_cases_if
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(#k: parser_kind)
(g: parser k (dsum_type_of_unknown_tag s))
(x: dsum_key s)
: Tot (if_combinator _ (validate_dsum_cases_eq s f g x))
= validate_dsum_cases_if' s f g x
inline_for_extraction
let validate_dsum_cases'
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(f' : (x: dsum_known_key s) -> Tot (validator (dsnd (f x))))
(#k: parser_kind)
(#g: parser k (dsum_type_of_unknown_tag s))
(g' : validator g)
(x: dsum_key s)
: Tot (validate_dsum_cases_t s f g x)
= [@inline_let]
let _ = synth_dsum_case_injective s x in
match x with
| Known x' -> validate_synth (f' x') (synth_dsum_case s (Known x')) () <: validator (parse_dsum_cases' s f g x)
| Unknown x' -> validate_synth g' (synth_dsum_case s (Unknown x')) () <: validator (parse_dsum_cases' s f g x)
inline_for_extraction
let validate_dsum_cases'_destr
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(f' : (x: dsum_known_key s) -> Tot (validator (dsnd (f x))))
(#k: parser_kind)
(#g: parser k (dsum_type_of_unknown_tag s))
(g' : validator g)
(destr: dep_enum_destr _ (fun k -> validate_dsum_cases_t s f g (Known k)))
(x: dsum_key s)
: Tot (validate_dsum_cases_t s f g x)
= fun #rrel #rel input pos ->
match x with
| Known k ->
destr
_
(fun k -> validate_dsum_cases_if s f g (Known k))
(fun _ _ -> ())
(fun _ _ _ _ -> ())
(fun k -> validate_dsum_cases' s f f' g' (Known k))
k
input
pos
| Unknown r -> validate_dsum_cases' s f f' g' (Unknown r) input pos
inline_for_extraction
let validate_dsum_cases
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(f' : (x: dsum_known_key s) -> Tot (validator (dsnd (f x))))
(#k: parser_kind)
(#g: parser k (dsum_type_of_unknown_tag s))
(g' : validator g)
(destr: dep_enum_destr _ (fun k -> validate_dsum_cases_t s f g (Known k)))
(x: dsum_key s)
: Tot (validator (parse_dsum_cases s f g x))
= fun #rrel #rel input pos ->
let h = HST.get () in
[@inline_let]
let _ =
valid_facts (parse_dsum_cases' s f g x) h input (uint64_to_uint32 pos);
valid_facts (parse_dsum_cases s f g x) h input (uint64_to_uint32 pos);
parse_dsum_cases_eq' s f g x (bytes_of_slice_from h input (uint64_to_uint32 pos))
in
validate_dsum_cases'_destr s f f' g' destr x input pos
#push-options "--z3rlimit 40"
inline_for_extraction
let validate_dsum
(#kt: parser_kind)
(t: dsum)
(#p: parser kt (dsum_repr_type t))
(v: validator p)
(p32: leaf_reader p)
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(f32: (x: dsum_known_key t) -> Tot (validator (dsnd (f x))))
(#k': parser_kind)
(#g: parser k' (dsum_type_of_unknown_tag t))
(g32: validator g)
(destr: dep_maybe_enum_destr_t (dsum_enum t) (validate_dsum_cases_t t f g))
: Tot (validator (parse_dsum t p f g))
= fun #rrel #rel input pos ->
let h = HST.get () in
[@inline_let]
let _ = parse_dsum_eq' t p f g (bytes_of_slice_from h input (uint64_to_uint32 pos)) in
[@inline_let]
let _ = valid_facts (parse_dsum t p f g) h input (uint64_to_uint32 pos) in
[@inline_let]
let _ = valid_facts p h input (uint64_to_uint32 pos) in
let pos_after_tag = v input pos in
if is_error pos_after_tag
then pos_after_tag
else
let tg = p32 input (uint64_to_uint32 pos) in
[@inline_let]
let _ = valid_facts (parse_dsum_cases' t f g (maybe_enum_key_of_repr (dsum_enum t) tg)) h input (uint64_to_uint32 pos_after_tag) in
destr (validate_dsum_cases_eq t f g) (validate_dsum_cases_if t f g) (fun _ _ -> ()) (fun _ _ _ _ -> ()) (validate_dsum_cases' t f f32 g32) tg input pos_after_tag
#pop-options
#reset-options "--z3rlimit 64 --z3cliopt smt.arith.nl=false --initial_ifuel 8 --max_ifuel 8 --initial_fuel 2 --max_fuel 2"
let valid_dsum_intro_known
(h: HS.mem)
(t: dsum)
(#kt: parser_kind)
(p: parser kt (dsum_repr_type t))
(f: ((x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x))))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: Lemma
(requires (
valid (parse_maybe_enum_key p (dsum_enum t)) h input pos /\ (
let k' = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
Known? k' /\ (
let Known k = k' in
valid (dsnd (f k)) h input (get_valid_pos (parse_maybe_enum_key p (dsum_enum t)) h input pos)
))))
(ensures (
let Known k = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
let pos_payload = get_valid_pos (parse_maybe_enum_key p (dsum_enum t)) h input pos in
valid_content_pos
(parse_dsum t p f g) h input pos
(synth_dsum_case t (Known k) (contents (dsnd (f k)) h input pos_payload))
(get_valid_pos (dsnd (f k)) h input pos_payload)
))
= valid_facts (parse_maybe_enum_key p (dsum_enum t)) h input pos;
let Known k = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
let pos_payload = get_valid_pos (parse_maybe_enum_key p (dsum_enum t)) h input pos in
valid_facts (dsnd (f k)) h input pos_payload;
valid_facts (parse_dsum t p f g) h input pos;
parse_dsum_eq t p f g (bytes_of_slice_from h input pos)
let valid_dsum_intro_unknown
(h: HS.mem)
(t: dsum)
(#kt: parser_kind)
(p: parser kt (dsum_repr_type t))
(f: ((x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x))))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: Lemma
(requires (
valid (parse_maybe_enum_key p (dsum_enum t)) h input pos /\ (
let k' = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
Unknown? k' /\
valid g h input (get_valid_pos (parse_maybe_enum_key p (dsum_enum t)) h input pos)
)))
(ensures (
let Unknown r = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
let pos_payload = get_valid_pos (parse_maybe_enum_key p (dsum_enum t)) h input pos in
valid_content_pos
(parse_dsum t p f g) h input pos
(synth_dsum_case t (Unknown r) (contents g h input pos_payload))
(get_valid_pos g h input pos_payload)
))
= valid_facts (parse_maybe_enum_key p (dsum_enum t)) h input pos;
let Unknown r = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
let pos_payload = get_valid_pos (parse_maybe_enum_key p (dsum_enum t)) h input pos in
valid_facts g h input pos_payload;
valid_facts (parse_dsum t p f g) h input pos;
parse_dsum_eq t p f g (bytes_of_slice_from h input pos)
#reset-options
inline_for_extraction
let finalize_dsum_case_known
(t: dsum)
(#kt: parser_kind)
(#p: parser kt (dsum_repr_type t))
(s: serializer p)
(w: leaf_writer_strong s)
(f: ((x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x))))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
(destr: enum_repr_of_key'_t (dsum_enum t))
(k: dsum_known_key t)
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: HST.Stack unit
(requires (fun h ->
let len_tag = serialized_length (serialize_enum_key _ s (dsum_enum t)) k in
U32.v pos + len_tag < 4294967296 /\ (
let pos_payload = pos `U32.add` U32.uint_to_t len_tag in
valid (dsnd (f k)) h input pos_payload /\
writable input.base (U32.v pos) (U32.v pos_payload) h
)))
(ensures (fun h _ h' ->
let len_tag = serialized_length (serialize_enum_key _ s (dsum_enum t)) k in
let pos_payload = pos `U32.add` U32.uint_to_t len_tag in
B.modifies (loc_slice_from_to input pos pos_payload) h h' /\
valid_content_pos (parse_dsum t p f g) h' input pos (synth_dsum_case t (Known k) (contents (dsnd (f k)) h input pos_payload)) (get_valid_pos (dsnd (f k)) h input pos_payload)
))
= let pos1 = write_enum_key w (dsum_enum t) destr k input pos in
let h = HST.get () in
[@inline_let]
let _ =
valid_facts (parse_enum_key p (dsum_enum t)) h input pos;
valid_facts (parse_maybe_enum_key p (dsum_enum t)) h input pos;
let sq = bytes_of_slice_from h input pos in
parse_enum_key_eq p (dsum_enum t) sq;
parse_maybe_enum_key_eq p (dsum_enum t) sq;
valid_dsum_intro_known h t p f g input pos
in
()
inline_for_extraction
let finalize_dsum_case_unknown
(t: dsum)
(#kt: parser_kind)
(#p: parser kt (dsum_repr_type t))
(s: serializer p)
(w: leaf_writer_strong s)
(f: ((x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x))))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
(r: unknown_enum_repr (dsum_enum t))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: HST.Stack unit
(requires (fun h ->
let len_tag = serialized_length s r in
U32.v pos + len_tag < 4294967296 /\ (
let pos_payload = pos `U32.add` U32.uint_to_t len_tag in
valid g h input pos_payload /\
writable input.base (U32.v pos) (U32.v pos_payload) h
)))
(ensures (fun h _ h' ->
let len_tag = serialized_length s r in
let pos_payload = pos `U32.add` U32.uint_to_t len_tag in
B.modifies (loc_slice_from_to input pos pos_payload) h h' /\
valid_content_pos (parse_dsum t p f g) h' input pos (synth_dsum_case t (Unknown r) (contents g h input pos_payload)) (get_valid_pos g h input pos_payload)
))
= let pos1 = w r input pos in
let h = HST.get () in
[@inline_let]
let _ =
valid_facts (parse_maybe_enum_key p (dsum_enum t)) h input pos;
valid_facts p h input pos;
let sq = bytes_of_slice_from h input pos in
parse_maybe_enum_key_eq p (dsum_enum t) sq;
valid_dsum_intro_unknown h t p f g input pos
in
()
let valid_dsum_elim_tag
(h: HS.mem)
(t: dsum)
(#kt: parser_kind)
(p: parser kt (dsum_repr_type t))
(f: ((x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x))))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: Lemma
(requires (
valid (parse_dsum t p f g) h input pos
))
(ensures (
valid (parse_maybe_enum_key p (dsum_enum t)) h input pos /\
contents (parse_maybe_enum_key p (dsum_enum t)) h input pos == dsum_tag_of_data t (contents (parse_dsum t p f g) h input pos)
))
= let _ = parse_dsum_eq_ t p f g (bytes_of_slice_from h input pos) in
let _ = valid_facts (parse_dsum t p f g) h input pos in
let _ = valid_facts (parse_maybe_enum_key p (dsum_enum t)) h input pos in
()
inline_for_extraction
let read_dsum_tag
(t: dsum)
(#kt: parser_kind)
(#p: parser kt (dsum_repr_type t))
(p32: leaf_reader p)
(destr: maybe_enum_destr_t (maybe_enum_key (dsum_enum t)) (dsum_enum t))
(f: ((x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x))))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: HST.Stack (dsum_key t)
(requires (fun h ->
valid (parse_dsum t p f g) h input pos
))
(ensures (fun h res h' ->
B.modifies B.loc_none h h' /\
res == dsum_tag_of_data t (contents (parse_dsum t p f g) h input pos)
))
= let h = HST.get () in
[@inline_let] let _ = valid_dsum_elim_tag h t p f g input pos in
read_maybe_enum_key p32 (dsum_enum t) destr input pos
#push-options "--z3rlimit 32"
let valid_dsum_elim_known
(h: HS.mem)
(t: dsum)
(#kt: parser_kind)
(p: parser kt (dsum_repr_type t))
(f: ((x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x))))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: Lemma
(requires (
valid (parse_dsum t p f g) h input pos /\
Known? (dsum_tag_of_data t (contents (parse_dsum t p f g) h input pos))
))
(ensures (
valid (parse_maybe_enum_key p (dsum_enum t)) h input pos /\ (
let k' = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
let pos_payload = get_valid_pos (parse_maybe_enum_key p (dsum_enum t)) h input pos in
Known? k' /\ (
let Known k = k' in
valid (dsnd (f k)) h input pos_payload /\
valid_content_pos
(parse_dsum t p f g) h input pos
(synth_dsum_case t (Known k) (contents (dsnd (f k)) h input pos_payload))
(get_valid_pos (dsnd (f k)) h input pos_payload)
))))
=
valid_facts (parse_dsum t p f g) h input pos;
parse_dsum_eq t p f g (bytes_of_slice_from h input pos);
valid_facts (parse_maybe_enum_key p (dsum_enum t)) h input pos;
let Known k = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
let pos_payload = get_valid_pos (parse_maybe_enum_key p (dsum_enum t)) h input pos in
valid_facts (dsnd (f k)) h input pos_payload
#pop-options
let valid_dsum_elim_unknown
(h: HS.mem)
(t: dsum)
(#kt: parser_kind)
(p: parser kt (dsum_repr_type t))
(f: ((x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x))))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: Lemma
(requires (
valid (parse_dsum t p f g) h input pos /\
Unknown? (dsum_tag_of_data t (contents (parse_dsum t p f g) h input pos))
))
(ensures (
valid (parse_maybe_enum_key p (dsum_enum t)) h input pos /\ (
let k' = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
let pos_payload = get_valid_pos (parse_maybe_enum_key p (dsum_enum t)) h input pos in
Unknown? k' /\ (
let Unknown r = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
valid g h input pos_payload /\
valid_content_pos
(parse_dsum t p f g) h input pos
(synth_dsum_case t (Unknown r) (contents g h input pos_payload))
(get_valid_pos g h input pos_payload)
))))
=
valid_facts (parse_dsum t p f g) h input pos;
parse_dsum_eq t p f g (bytes_of_slice_from h input pos);
valid_facts (parse_maybe_enum_key p (dsum_enum t)) h input pos;
let Unknown r = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
let pos_payload = get_valid_pos (parse_maybe_enum_key p (dsum_enum t)) h input pos in
valid_facts g h input pos_payload
inline_for_extraction
let jump_dsum_cases_t
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(#k: parser_kind)
(g: parser k (dsum_type_of_unknown_tag s))
(x: dsum_key s)
: Tot Type
= jumper (parse_dsum_cases' s f g x)
let jump_dsum_cases_eq
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(#k: parser_kind)
(g: parser k (dsum_type_of_unknown_tag s))
(x: dsum_key s)
(v1 v2 : jump_dsum_cases_t s f g x)
: GTot Type0
= True
inline_for_extraction
let jump_dsum_cases_if'
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(#k: parser_kind)
(g: parser k (dsum_type_of_unknown_tag s))
(x: dsum_key s)
(cond: bool)
(ift: (cond_true cond -> Tot (jump_dsum_cases_t s f g x)))
(iff: (cond_false cond -> Tot (jump_dsum_cases_t s f g x)))
: Tot (jump_dsum_cases_t s f g x)
= fun #rrel #rel input len ->
if cond
then (ift () <: jump_dsum_cases_t s f g x) input len
else (iff () <: jump_dsum_cases_t s f g x) input len
inline_for_extraction
let jump_dsum_cases_if
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(#k: parser_kind)
(g: parser k (dsum_type_of_unknown_tag s))
(x: dsum_key s)
: Tot (if_combinator _ (jump_dsum_cases_eq s f g x))
= jump_dsum_cases_if' s f g x
inline_for_extraction
let jump_dsum_cases'
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(f' : (x: dsum_known_key s) -> Tot (jumper (dsnd (f x))))
(#k: parser_kind)
(#g: parser k (dsum_type_of_unknown_tag s))
(g' : jumper g)
(x: dsum_key s)
: Tot (jump_dsum_cases_t s f g x)
= synth_dsum_case_injective s x;
match x with
| Known x' -> jump_synth (f' x') (synth_dsum_case s (Known x')) () <: jumper (parse_dsum_cases' s f g x)
| Unknown x' -> jump_synth g' (synth_dsum_case s (Unknown x')) () <: jumper (parse_dsum_cases' s f g x)
inline_for_extraction
let jump_dsum_cases'_destr
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(f' : (x: dsum_known_key s) -> Tot (jumper (dsnd (f x))))
(#k: parser_kind)
(#g: parser k (dsum_type_of_unknown_tag s))
(g' : jumper g)
(destr: dep_enum_destr _ (fun k -> jump_dsum_cases_t s f g (Known k)))
(x: dsum_key s)
: Tot (jump_dsum_cases_t s f g x)
= fun #rrel #rel input pos ->
match x with
| Known k ->
destr
_
(fun k -> jump_dsum_cases_if s f g (Known k))
(fun _ _ -> ())
(fun _ _ _ _ -> ())
(fun k -> jump_dsum_cases' s f f' g' (Known k))
k
input
pos
| Unknown r -> jump_dsum_cases' s f f' g' (Unknown r) input pos
inline_for_extraction
let jump_dsum_cases
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(f' : (x: dsum_known_key s) -> Tot (jumper (dsnd (f x))))
(#k: parser_kind)
(#g: parser k (dsum_type_of_unknown_tag s))
(g' : jumper g)
(destr: dep_enum_destr _ (fun k -> jump_dsum_cases_t s f g (Known k)))
(x: dsum_key s)
: Tot (jumper (parse_dsum_cases s f g x))
= fun #rrel #rel input pos ->
let h = HST.get () in
[@inline_let]
let _ =
valid_facts (parse_dsum_cases' s f g x) h input pos;
valid_facts (parse_dsum_cases s f g x) h input pos;
parse_dsum_cases_eq' s f g x (bytes_of_slice_from h input pos)
in
jump_dsum_cases'_destr s f f' g' destr x input pos
#push-options "--z3rlimit 16" | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"LowStar.Buffer.fst.checked",
"LowParse.Spec.Sum.fst.checked",
"LowParse.Low.Enum.fst.checked",
"FStar.UInt64.fsti.checked",
"FStar.UInt32.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Int.Cast.fst.checked",
"FStar.HyperStack.ST.fsti.checked",
"FStar.HyperStack.fst.checked",
"FStar.Classical.fsti.checked"
],
"interface_file": false,
"source_file": "LowParse.Low.Sum.fst"
} | [
{
"abbrev": true,
"full_module": "FStar.HyperStack",
"short_module": "HS"
},
{
"abbrev": true,
"full_module": "FStar.UInt64",
"short_module": "U64"
},
{
"abbrev": true,
"full_module": "FStar.Int.Cast",
"short_module": "Cast"
},
{
"abbrev": true,
"full_module": "LowStar.Buffer",
"short_module": "B"
},
{
"abbrev": true,
"full_module": "FStar.HyperStack.ST",
"short_module": "HST"
},
{
"abbrev": true,
"full_module": "FStar.UInt32",
"short_module": "U32"
},
{
"abbrev": false,
"full_module": "LowParse.Spec.Sum",
"short_module": null
},
{
"abbrev": false,
"full_module": "LowParse.Low.Enum",
"short_module": null
},
{
"abbrev": false,
"full_module": "LowParse.Low",
"short_module": null
},
{
"abbrev": false,
"full_module": "LowParse.Low",
"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",
"short_module": null
}
] | {
"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_elim_box": false,
"smtencoding_l_arith_repr": "boxwrap",
"smtencoding_nl_arith_repr": "boxwrap",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": true,
"z3cliopt": [],
"z3refresh": false,
"z3rlimit": 16,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | false |
t: LowParse.Spec.Sum.dsum ->
v: LowParse.Low.Base.jumper p ->
p32: LowParse.Low.Base.leaf_reader p ->
f:
(x: LowParse.Spec.Sum.dsum_known_key t
-> Prims.dtuple2 LowParse.Spec.Base.parser_kind
(fun k -> LowParse.Spec.Base.parser k (LowParse.Spec.Sum.dsum_type_of_known_tag t x))) ->
f32:
(x: LowParse.Spec.Sum.dsum_known_key t
-> LowParse.Low.Base.jumper (FStar.Pervasives.dsnd (f x))) ->
g32: LowParse.Low.Base.jumper g ->
destr:
LowParse.Spec.Enum.dep_maybe_enum_destr_t (LowParse.Spec.Sum.dsum_enum t)
(LowParse.Low.Sum.jump_dsum_cases_t t f g)
-> LowParse.Low.Base.jumper (LowParse.Spec.Sum.parse_dsum t p f g) | Prims.Tot | [
"total"
] | [] | [
"LowParse.Spec.Base.parser_kind",
"LowParse.Spec.Sum.dsum",
"LowParse.Spec.Base.parser",
"LowParse.Spec.Sum.dsum_repr_type",
"LowParse.Low.Base.jumper",
"LowParse.Low.Base.leaf_reader",
"LowParse.Spec.Sum.dsum_known_key",
"Prims.dtuple2",
"LowParse.Spec.Sum.dsum_type_of_known_tag",
"Prims.__proj__Mkdtuple2__item___1",
"FStar.Pervasives.dsnd",
"LowParse.Spec.Sum.dsum_type_of_unknown_tag",
"LowParse.Spec.Enum.dep_maybe_enum_destr_t",
"LowParse.Spec.Sum.dsum_key_type",
"LowParse.Spec.Sum.dsum_enum",
"LowParse.Low.Sum.jump_dsum_cases_t",
"LowParse.Slice.srel",
"LowParse.Bytes.byte",
"LowParse.Slice.slice",
"FStar.UInt32.t",
"LowParse.Low.Sum.jump_dsum_cases_eq",
"LowParse.Low.Sum.jump_dsum_cases_if",
"LowParse.Spec.Enum.maybe_enum_key",
"Prims.unit",
"LowParse.Low.Sum.jump_dsum_cases'",
"LowParse.Low.Base.Spec.valid_facts",
"LowParse.Spec.Sum.parse_dsum_cases_kind",
"LowParse.Spec.Enum.maybe_enum_key_of_repr",
"LowParse.Spec.Sum.dsum_cases",
"LowParse.Spec.Sum.parse_dsum_cases'",
"LowParse.Spec.Sum.parse_dsum_kind",
"LowParse.Spec.Sum.dsum_type",
"LowParse.Spec.Sum.parse_dsum",
"LowParse.Spec.Sum.parse_dsum_eq'",
"LowParse.Slice.bytes_of_slice_from",
"FStar.Monotonic.HyperStack.mem",
"FStar.HyperStack.ST.get"
] | [] | false | false | false | false | false | let jump_dsum
(#kt: parser_kind)
(t: dsum)
(#p: parser kt (dsum_repr_type t))
(v: jumper p)
(p32: leaf_reader p)
(f: (x: dsum_known_key t -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x))))
(f32: (x: dsum_known_key t -> Tot (jumper (dsnd (f x)))))
(#k': parser_kind)
(#g: parser k' (dsum_type_of_unknown_tag t))
(g32: jumper g)
(destr: dep_maybe_enum_destr_t (dsum_enum t) (jump_dsum_cases_t t f g))
: Tot (jumper (parse_dsum t p f g)) =
| fun #rrel #rel input pos ->
let h = HST.get () in
[@@ inline_let ]let _ = parse_dsum_eq' t p f g (bytes_of_slice_from h input pos) in
[@@ inline_let ]let _ = valid_facts (parse_dsum t p f g) h input pos in
[@@ inline_let ]let _ = valid_facts p h input pos in
let pos_after_tag = v input pos in
let tg = p32 input pos in
[@@ inline_let ]let _ =
valid_facts (parse_dsum_cases' t f g (maybe_enum_key_of_repr (dsum_enum t) tg))
h
input
pos_after_tag
in
destr (jump_dsum_cases_eq t f g)
(jump_dsum_cases_if t f g)
(fun _ _ -> ())
(fun _ _ _ _ -> ())
(jump_dsum_cases' t f f32 g32)
tg
input
pos_after_tag | false |
LowParse.Low.Sum.fst | LowParse.Low.Sum.validate_sum_aux | val validate_sum_aux
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(v: validator p)
(p32: leaf_reader p)
(pc: (x: sum_key t -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(v_payload:
(k: sum_repr_type t
-> Tot (validate_sum_aux_payload_t t pc (maybe_enum_key_of_repr (sum_enum t) k))))
: Tot (validator (parse_sum t p pc)) | val validate_sum_aux
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(v: validator p)
(p32: leaf_reader p)
(pc: (x: sum_key t -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(v_payload:
(k: sum_repr_type t
-> Tot (validate_sum_aux_payload_t t pc (maybe_enum_key_of_repr (sum_enum t) k))))
: Tot (validator (parse_sum t p pc)) | let validate_sum_aux
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(v: validator p)
(p32: leaf_reader p)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(v_payload: ((k: sum_repr_type t)) -> Tot (validate_sum_aux_payload_t t pc (maybe_enum_key_of_repr (sum_enum t) k)))
: Tot (validator (parse_sum t p pc))
= fun #rrel #rel input pos ->
let h = HST.get () in
[@inline_let]
let _ = parse_sum_eq'' t p pc (bytes_of_slice_from h input (uint64_to_uint32 pos)) in
[@inline_let]
let _ = valid_facts (parse_sum t p pc) h input (uint64_to_uint32 pos) in
[@inline_let]
let _ = valid_facts p h input (uint64_to_uint32 pos) in
let len_after_tag = v input pos in
if is_error len_after_tag
then len_after_tag
else begin
let h1 = HST.get () in
let k' = p32 input (uint64_to_uint32 pos) in
[@inline_let]
let _ =
match maybe_enum_key_of_repr (sum_enum t) k' with
| Known k -> valid_facts (dsnd (pc k)) h input (uint64_to_uint32 len_after_tag)
| _ -> ()
in
v_payload k' input len_after_tag
end | {
"file_name": "src/lowparse/LowParse.Low.Sum.fst",
"git_rev": "00217c4a89f5ba56002ba9aa5b4a9d5903bfe9fa",
"git_url": "https://github.com/project-everest/everparse.git",
"project_name": "everparse"
} | {
"end_col": 5,
"end_line": 161,
"start_col": 0,
"start_line": 131
} | module LowParse.Low.Sum
include LowParse.Low.Enum
include LowParse.Spec.Sum
module U32 = FStar.UInt32
module HST = FStar.HyperStack.ST
module B = LowStar.Buffer
module Cast = FStar.Int.Cast
module U64 = FStar.UInt64
inline_for_extraction
let validate_sum_cases_aux
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(vc: ((x: sum_key t) -> Tot (validator (dsnd (pc x)))))
(k: sum_key t)
: Tot (validator (parse_sum_cases t pc k))
= [@inline_let]
let _ = synth_sum_case_injective t k in
validate_synth
(validate_weaken
(weaken_parse_cases_kind t pc)
(vc k)
()
)
(synth_sum_case t k)
()
inline_for_extraction
let validate_sum_cases_t
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot Type
= validator (parse_sum_cases t pc k)
let validate_sum_cases_t_eq
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
(x y : validate_sum_cases_t t pc k)
: GTot Type0
= True
inline_for_extraction
let validate_sum_cases_t_if
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (if_combinator _ (validate_sum_cases_t_eq t pc k))
= fun cond (sv_true: cond_true cond -> Tot (validate_sum_cases_t t pc k)) (sv_false: cond_false cond -> Tot (validate_sum_cases_t t pc k)) #rrel #rel input pos ->
if cond
then sv_true () input pos
else sv_false () input pos
inline_for_extraction
let validate_sum_cases
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(vc: ((x: sum_key t) -> Tot (validator (dsnd (pc x)))))
(destr: dep_enum_destr (sum_enum t) (validate_sum_cases_t t pc))
(k: sum_key t)
: Tot (validator (parse_sum_cases t pc k))
= destr
_
(validate_sum_cases_t_if t pc)
(fun _ _ -> ())
(fun _ _ _ _ -> ())
(validate_sum_cases_aux t pc vc)
k
inline_for_extraction
let validate_sum_aux_payload_t
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
: Tot Type
= (#rrel: _) -> (#rel: _) ->
(input: slice rrel rel) ->
(pos: U64.t) ->
HST.Stack U64.t
(requires (fun h -> live_slice h input /\ U64.v pos <= U32.v input.len))
(ensures (fun h res h' ->
B.modifies B.loc_none h h' /\ (
match k with
| Unknown _ -> is_error res
| Known k' ->
if is_success res
then
valid_pos (dsnd (pc k')) h input (uint64_to_uint32 pos) (uint64_to_uint32 res)
else
(~ (valid (dsnd (pc k')) h input (uint64_to_uint32 pos)))
)))
let validate_sum_aux_payload_eq
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
: Tot (validate_sum_aux_payload_t t pc k -> validate_sum_aux_payload_t t pc k -> GTot Type0)
= fun _ _ -> True
inline_for_extraction
let validate_sum_aux_payload_if'
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
(cond: bool)
(ift: ((cond_true cond) -> Tot (validate_sum_aux_payload_t t pc k)))
(iff: ((cond_false cond) -> Tot (validate_sum_aux_payload_t t pc k)))
: Tot (validate_sum_aux_payload_t t pc k)
= fun #rrel #rel input pos ->
if cond
then begin
(ift () <: validate_sum_aux_payload_t t pc k) input pos
end else
(iff () <: validate_sum_aux_payload_t t pc k) input pos
inline_for_extraction
let validate_sum_aux_payload_if
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
: Tot (if_combinator _ (validate_sum_aux_payload_eq t pc k))
= validate_sum_aux_payload_if' t pc k
#push-options "--z3rlimit 64 --z3cliopt smt.arith.nl=false --using_facts_from '* -FStar.Int.Cast -LowParse.BitFields'"
// --query_stats --smtencoding.elim_box true --smtencoding.l_arith_repr native --z3refresh" | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"LowStar.Buffer.fst.checked",
"LowParse.Spec.Sum.fst.checked",
"LowParse.Low.Enum.fst.checked",
"FStar.UInt64.fsti.checked",
"FStar.UInt32.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Int.Cast.fst.checked",
"FStar.HyperStack.ST.fsti.checked",
"FStar.HyperStack.fst.checked",
"FStar.Classical.fsti.checked"
],
"interface_file": false,
"source_file": "LowParse.Low.Sum.fst"
} | [
{
"abbrev": true,
"full_module": "FStar.UInt64",
"short_module": "U64"
},
{
"abbrev": true,
"full_module": "FStar.Int.Cast",
"short_module": "Cast"
},
{
"abbrev": true,
"full_module": "LowStar.Buffer",
"short_module": "B"
},
{
"abbrev": true,
"full_module": "FStar.HyperStack.ST",
"short_module": "HST"
},
{
"abbrev": true,
"full_module": "FStar.UInt32",
"short_module": "U32"
},
{
"abbrev": false,
"full_module": "LowParse.Spec.Sum",
"short_module": null
},
{
"abbrev": false,
"full_module": "LowParse.Low.Enum",
"short_module": null
},
{
"abbrev": false,
"full_module": "LowParse.Low",
"short_module": null
},
{
"abbrev": false,
"full_module": "LowParse.Low",
"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",
"short_module": null
}
] | {
"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_elim_box": false,
"smtencoding_l_arith_repr": "boxwrap",
"smtencoding_nl_arith_repr": "boxwrap",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": true,
"z3cliopt": [
"smt.arith.nl=false"
],
"z3refresh": false,
"z3rlimit": 64,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | false |
t: LowParse.Spec.Sum.sum ->
v: LowParse.Low.Base.validator p ->
p32: LowParse.Low.Base.leaf_reader p ->
pc:
(x: LowParse.Spec.Sum.sum_key t
-> Prims.dtuple2 LowParse.Spec.Base.parser_kind
(fun k -> LowParse.Spec.Base.parser k (LowParse.Spec.Sum.sum_type_of_tag t x))) ->
v_payload:
(k: LowParse.Spec.Sum.sum_repr_type t
-> LowParse.Low.Sum.validate_sum_aux_payload_t t
pc
(LowParse.Spec.Enum.maybe_enum_key_of_repr (LowParse.Spec.Sum.sum_enum t) k))
-> LowParse.Low.Base.validator (LowParse.Spec.Sum.parse_sum t p pc) | Prims.Tot | [
"total"
] | [] | [
"LowParse.Spec.Sum.sum",
"LowParse.Spec.Base.parser_kind",
"LowParse.Spec.Base.parser",
"LowParse.Spec.Sum.sum_repr_type",
"LowParse.Low.Base.validator",
"LowParse.Low.Base.leaf_reader",
"LowParse.Spec.Sum.sum_key",
"Prims.dtuple2",
"LowParse.Spec.Sum.sum_type_of_tag",
"LowParse.Low.Sum.validate_sum_aux_payload_t",
"LowParse.Spec.Enum.maybe_enum_key_of_repr",
"LowParse.Spec.Sum.sum_key_type",
"LowParse.Spec.Sum.sum_enum",
"LowParse.Slice.srel",
"LowParse.Bytes.byte",
"LowParse.Slice.slice",
"FStar.UInt64.t",
"LowParse.Low.ErrorCode.is_error",
"Prims.bool",
"Prims.unit",
"LowParse.Spec.Enum.enum_key",
"LowParse.Low.Base.Spec.valid_facts",
"Prims.__proj__Mkdtuple2__item___1",
"FStar.Pervasives.dsnd",
"LowParse.Low.ErrorCode.uint64_to_uint32",
"LowParse.Spec.Enum.maybe_enum_key",
"FStar.Monotonic.HyperStack.mem",
"FStar.HyperStack.ST.get",
"LowParse.Spec.Sum.parse_sum_kind",
"LowParse.Spec.Sum.sum_type",
"LowParse.Spec.Sum.parse_sum",
"LowParse.Spec.Sum.parse_sum_eq''",
"LowParse.Slice.bytes_of_slice_from"
] | [] | false | false | false | false | false | let validate_sum_aux
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(v: validator p)
(p32: leaf_reader p)
(pc: (x: sum_key t -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(v_payload:
(k: sum_repr_type t
-> Tot (validate_sum_aux_payload_t t pc (maybe_enum_key_of_repr (sum_enum t) k))))
: Tot (validator (parse_sum t p pc)) =
| fun #rrel #rel input pos ->
let h = HST.get () in
[@@ inline_let ]let _ =
parse_sum_eq'' t p pc (bytes_of_slice_from h input (uint64_to_uint32 pos))
in
[@@ inline_let ]let _ = valid_facts (parse_sum t p pc) h input (uint64_to_uint32 pos) in
[@@ inline_let ]let _ = valid_facts p h input (uint64_to_uint32 pos) in
let len_after_tag = v input pos in
if is_error len_after_tag
then len_after_tag
else
let h1 = HST.get () in
let k' = p32 input (uint64_to_uint32 pos) in
[@@ inline_let ]let _ =
match maybe_enum_key_of_repr (sum_enum t) k' with
| Known k -> valid_facts (dsnd (pc k)) h input (uint64_to_uint32 len_after_tag)
| _ -> ()
in
v_payload k' input len_after_tag | false |
LowParse.Low.Sum.fst | LowParse.Low.Sum.accessor_clens_dsum_payload' | val accessor_clens_dsum_payload'
(#kt: parser_kind)
(t: dsum)
(#p: parser kt (dsum_repr_type t))
(j: jumper p)
(f: (x: dsum_known_key t -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x))))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
(k: dsum_key t)
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: HST.Stack U32.t
(requires
(fun h ->
valid (parse_dsum t p f g) h input pos /\
(clens_dsum_payload t k).clens_cond (contents (parse_dsum t p f g) h input pos)))
(ensures
(fun h pos' h' ->
B.modifies B.loc_none h h' /\
pos' == slice_access h (gaccessor_clens_dsum_payload t p f g k) input pos)) | val accessor_clens_dsum_payload'
(#kt: parser_kind)
(t: dsum)
(#p: parser kt (dsum_repr_type t))
(j: jumper p)
(f: (x: dsum_known_key t -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x))))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
(k: dsum_key t)
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: HST.Stack U32.t
(requires
(fun h ->
valid (parse_dsum t p f g) h input pos /\
(clens_dsum_payload t k).clens_cond (contents (parse_dsum t p f g) h input pos)))
(ensures
(fun h pos' h' ->
B.modifies B.loc_none h h' /\
pos' == slice_access h (gaccessor_clens_dsum_payload t p f g k) input pos)) | let accessor_clens_dsum_payload'
(#kt: parser_kind)
(t: dsum)
(#p: parser kt (dsum_repr_type t))
(j: jumper p)
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
(k: dsum_key t)
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: HST.Stack U32.t
(requires (fun h ->
valid (parse_dsum t p f g) h input pos /\
(clens_dsum_payload t k).clens_cond (contents (parse_dsum t p f g) h input pos)
))
(ensures (fun h pos' h' ->
B.modifies B.loc_none h h' /\
pos' == slice_access h (gaccessor_clens_dsum_payload t p f g k) input pos
))
=
let h = HST.get () in
[@inline_let]
let _ =
let pos' = get_valid_pos (parse_dsum t p f g) h input pos in
let large = bytes_of_slice_from h input pos in
slice_access_eq h (gaccessor_clens_dsum_payload t p f g k) input pos;
valid_facts (parse_dsum t p f g) h input pos;
parse_dsum_eq3 t p f g large;
valid_facts p h input pos
in
j input pos | {
"file_name": "src/lowparse/LowParse.Low.Sum.fst",
"git_rev": "00217c4a89f5ba56002ba9aa5b4a9d5903bfe9fa",
"git_url": "https://github.com/project-everest/everparse.git",
"project_name": "everparse"
} | {
"end_col": 13,
"end_line": 1936,
"start_col": 0,
"start_line": 1904
} | module LowParse.Low.Sum
include LowParse.Low.Enum
include LowParse.Spec.Sum
module U32 = FStar.UInt32
module HST = FStar.HyperStack.ST
module B = LowStar.Buffer
module Cast = FStar.Int.Cast
module U64 = FStar.UInt64
inline_for_extraction
let validate_sum_cases_aux
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(vc: ((x: sum_key t) -> Tot (validator (dsnd (pc x)))))
(k: sum_key t)
: Tot (validator (parse_sum_cases t pc k))
= [@inline_let]
let _ = synth_sum_case_injective t k in
validate_synth
(validate_weaken
(weaken_parse_cases_kind t pc)
(vc k)
()
)
(synth_sum_case t k)
()
inline_for_extraction
let validate_sum_cases_t
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot Type
= validator (parse_sum_cases t pc k)
let validate_sum_cases_t_eq
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
(x y : validate_sum_cases_t t pc k)
: GTot Type0
= True
inline_for_extraction
let validate_sum_cases_t_if
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (if_combinator _ (validate_sum_cases_t_eq t pc k))
= fun cond (sv_true: cond_true cond -> Tot (validate_sum_cases_t t pc k)) (sv_false: cond_false cond -> Tot (validate_sum_cases_t t pc k)) #rrel #rel input pos ->
if cond
then sv_true () input pos
else sv_false () input pos
inline_for_extraction
let validate_sum_cases
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(vc: ((x: sum_key t) -> Tot (validator (dsnd (pc x)))))
(destr: dep_enum_destr (sum_enum t) (validate_sum_cases_t t pc))
(k: sum_key t)
: Tot (validator (parse_sum_cases t pc k))
= destr
_
(validate_sum_cases_t_if t pc)
(fun _ _ -> ())
(fun _ _ _ _ -> ())
(validate_sum_cases_aux t pc vc)
k
inline_for_extraction
let validate_sum_aux_payload_t
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
: Tot Type
= (#rrel: _) -> (#rel: _) ->
(input: slice rrel rel) ->
(pos: U64.t) ->
HST.Stack U64.t
(requires (fun h -> live_slice h input /\ U64.v pos <= U32.v input.len))
(ensures (fun h res h' ->
B.modifies B.loc_none h h' /\ (
match k with
| Unknown _ -> is_error res
| Known k' ->
if is_success res
then
valid_pos (dsnd (pc k')) h input (uint64_to_uint32 pos) (uint64_to_uint32 res)
else
(~ (valid (dsnd (pc k')) h input (uint64_to_uint32 pos)))
)))
let validate_sum_aux_payload_eq
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
: Tot (validate_sum_aux_payload_t t pc k -> validate_sum_aux_payload_t t pc k -> GTot Type0)
= fun _ _ -> True
inline_for_extraction
let validate_sum_aux_payload_if'
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
(cond: bool)
(ift: ((cond_true cond) -> Tot (validate_sum_aux_payload_t t pc k)))
(iff: ((cond_false cond) -> Tot (validate_sum_aux_payload_t t pc k)))
: Tot (validate_sum_aux_payload_t t pc k)
= fun #rrel #rel input pos ->
if cond
then begin
(ift () <: validate_sum_aux_payload_t t pc k) input pos
end else
(iff () <: validate_sum_aux_payload_t t pc k) input pos
inline_for_extraction
let validate_sum_aux_payload_if
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
: Tot (if_combinator _ (validate_sum_aux_payload_eq t pc k))
= validate_sum_aux_payload_if' t pc k
#push-options "--z3rlimit 64 --z3cliopt smt.arith.nl=false --using_facts_from '* -FStar.Int.Cast -LowParse.BitFields'"
// --query_stats --smtencoding.elim_box true --smtencoding.l_arith_repr native --z3refresh"
inline_for_extraction
let validate_sum_aux
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(v: validator p)
(p32: leaf_reader p)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(v_payload: ((k: sum_repr_type t)) -> Tot (validate_sum_aux_payload_t t pc (maybe_enum_key_of_repr (sum_enum t) k)))
: Tot (validator (parse_sum t p pc))
= fun #rrel #rel input pos ->
let h = HST.get () in
[@inline_let]
let _ = parse_sum_eq'' t p pc (bytes_of_slice_from h input (uint64_to_uint32 pos)) in
[@inline_let]
let _ = valid_facts (parse_sum t p pc) h input (uint64_to_uint32 pos) in
[@inline_let]
let _ = valid_facts p h input (uint64_to_uint32 pos) in
let len_after_tag = v input pos in
if is_error len_after_tag
then len_after_tag
else begin
let h1 = HST.get () in
let k' = p32 input (uint64_to_uint32 pos) in
[@inline_let]
let _ =
match maybe_enum_key_of_repr (sum_enum t) k' with
| Known k -> valid_facts (dsnd (pc k)) h input (uint64_to_uint32 len_after_tag)
| _ -> ()
in
v_payload k' input len_after_tag
end
#pop-options
inline_for_extraction
let validate_sum_aux_payload'
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (validator (dsnd (pc x)))))
(k: maybe_enum_key (sum_enum t))
: Tot (validate_sum_aux_payload_t t pc k)
= fun #rrel #rel input pos ->
match k with
| Known k ->
[@inline_let]
let _ = synth_sum_case_injective t k in
pc32 k input pos
// validate_synth (pc32 k) (synth_sum_case t k) () input pos
| _ -> validator_error_generic
inline_for_extraction
let validate_sum_aux_payload
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (validator (dsnd (pc x)))))
(destr: dep_maybe_enum_destr_t (sum_enum t) (validate_sum_aux_payload_t t pc))
(k: sum_repr_type t)
: Tot (validate_sum_aux_payload_t t pc (maybe_enum_key_of_repr (sum_enum t) k))
= destr (validate_sum_aux_payload_eq t pc) (validate_sum_aux_payload_if t pc) (fun _ _ -> ()) (fun _ _ _ _ -> ()) (validate_sum_aux_payload' t pc pc32) k
inline_for_extraction
let validate_sum
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(v: validator p)
(p32: leaf_reader p)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (validator (dsnd (pc x)))))
(destr: dep_maybe_enum_destr_t (sum_enum t) (validate_sum_aux_payload_t t pc))
: Tot (validator (parse_sum t p pc))
= validate_sum_aux t v p32 pc (validate_sum_aux_payload t pc pc32 destr)
module HS = FStar.HyperStack
#push-options "--z3rlimit 256 --z3cliopt smt.arith.nl=false --initial_ifuel 8 --max_ifuel 8 --initial_fuel 2 --max_fuel 2"
#restart-solver
let valid_sum_intro
(h: HS.mem)
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: Lemma
(requires (
valid (parse_enum_key p (sum_enum t)) h input pos /\ (
let k = contents (parse_enum_key p (sum_enum t)) h input pos in
valid (dsnd (pc k)) h input (get_valid_pos (parse_enum_key p (sum_enum t)) h input pos)
)))
(ensures (
let k = contents (parse_enum_key p (sum_enum t)) h input pos in
let pos_payload = get_valid_pos (parse_enum_key p (sum_enum t)) h input pos in
valid_content_pos
(parse_sum t p pc) h input pos
(synth_sum_case t k (contents (dsnd (pc k)) h input pos_payload))
(get_valid_pos (dsnd (pc k)) h input pos_payload)
))
= valid_facts (parse_enum_key p (sum_enum t)) h input pos;
let k = contents (parse_enum_key p (sum_enum t)) h input pos in
let pos_payload = get_valid_pos (parse_enum_key p (sum_enum t)) h input pos in
valid_facts (dsnd (pc k)) h input pos_payload;
valid_facts (parse_sum t p pc) h input pos;
parse_sum_eq t p pc (bytes_of_slice_from h input pos)
#pop-options
inline_for_extraction
let finalize_sum_case
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(s: serializer p)
(w: leaf_writer_strong s)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(destr: enum_repr_of_key'_t (sum_enum t))
(k: sum_key t)
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: HST.Stack unit
(requires (fun h ->
let len_tag = serialized_length (serialize_enum_key _ s (sum_enum t)) k in
U32.v pos + len_tag < 4294967296 /\ (
let pos_payload = pos `U32.add` U32.uint_to_t len_tag in
valid (dsnd (pc k)) h input pos_payload /\
writable input.base (U32.v pos) (U32.v pos_payload) h
)))
(ensures (fun h _ h' ->
let len_tag = serialized_length (serialize_enum_key _ s (sum_enum t)) k in
let pos_payload = pos `U32.add` U32.uint_to_t len_tag in
B.modifies (loc_slice_from_to input pos pos_payload) h h' /\
valid_content_pos (parse_sum t p pc) h' input pos (synth_sum_case t k (contents (dsnd (pc k)) h input pos_payload)) (get_valid_pos (dsnd (pc k)) h input pos_payload)
))
= let pos1 = write_enum_key w (sum_enum t) destr k input pos in
let h = HST.get () in
[@inline_let]
let _ = valid_sum_intro h t p pc input pos in
()
inline_for_extraction
let jump_sum_cases_aux
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(vc: ((x: sum_key t) -> Tot (jumper (dsnd (pc x)))))
(k: sum_key t)
: Tot (jumper (parse_sum_cases t pc k))
= [@inline_let]
let _ = synth_sum_case_injective t k in
jump_synth
(jump_weaken
(weaken_parse_cases_kind t pc)
(vc k)
()
)
(synth_sum_case t k)
()
inline_for_extraction
let jump_sum_cases_t
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot Type
= jumper (parse_sum_cases t pc k)
let jump_sum_cases_t_eq
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
(x y : jump_sum_cases_t t pc k)
: GTot Type0
= True
inline_for_extraction
let jump_sum_cases_t_if
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (if_combinator _ (jump_sum_cases_t_eq t pc k))
= fun cond (sv_true: cond_true cond -> Tot (jump_sum_cases_t t pc k)) (sv_false: cond_false cond -> Tot (jump_sum_cases_t t pc k)) #rrel #rel input pos ->
if cond
then sv_true () input pos
else sv_false () input pos
inline_for_extraction
let jump_sum_cases
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(vc: ((x: sum_key t) -> Tot (jumper (dsnd (pc x)))))
(destr: dep_enum_destr (sum_enum t) (jump_sum_cases_t t pc))
(k: sum_key t)
: Tot (jumper (parse_sum_cases t pc k))
= destr
_
(jump_sum_cases_t_if t pc)
(fun _ _ -> ())
(fun _ _ _ _ -> ())
(jump_sum_cases_aux t pc vc)
k
inline_for_extraction
let jump_sum_aux_payload_t
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
: Tot Type
= (#rrel: _) -> (#rel: _) ->
(input: slice rrel rel) ->
(pos: U32.t) ->
HST.Stack U32.t
(requires (fun h -> live_slice h input /\ U32.v pos <= U32.v input.len /\ (
match k with
| Unknown _ -> False
| Known k' -> valid (dsnd (pc k')) h input pos
)))
(ensures (fun h res h' ->
B.modifies B.loc_none h h' /\ (
match k with
| Unknown _ -> False
| Known k' ->
valid_pos (dsnd (pc k')) h input pos res
)))
let jump_sum_aux_payload_eq
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
: Tot (jump_sum_aux_payload_t t pc k -> jump_sum_aux_payload_t t pc k -> GTot Type0)
= fun _ _ -> True
inline_for_extraction
let jump_sum_aux_payload_if'
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
(cond: bool)
(ift: ((cond_true cond) -> Tot (jump_sum_aux_payload_t t pc k)))
(iff: ((cond_false cond) -> Tot (jump_sum_aux_payload_t t pc k)))
: Tot (jump_sum_aux_payload_t t pc k)
= fun #rrel #rel input pos ->
if cond
then begin
(ift () <: jump_sum_aux_payload_t t pc k) input pos
end else
(iff () <: jump_sum_aux_payload_t t pc k) input pos
inline_for_extraction
let jump_sum_aux_payload_if
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
: Tot (if_combinator _ (jump_sum_aux_payload_eq t pc k))
= jump_sum_aux_payload_if' t pc k
let parse_sum_eq3
(#kt: parser_kind)
(t: sum)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(input: bytes)
(k' : sum_repr_type t)
(consumed_k: consumed_length input)
: Lemma
(requires (Some? (parse (parse_sum t p pc) input) /\ parse p input == Some (k', consumed_k)))
(ensures (
let input_k = Seq.slice input consumed_k (Seq.length input) in
let k = maybe_enum_key_of_repr (sum_enum t) k' in
begin match k with
| Known k ->
Some? (parse (dsnd (pc k)) input_k)
| _ -> False
end
))
= parse_sum_eq'' t p pc input
let parse_sum_eq4
(#kt: parser_kind)
(t: sum)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(input: bytes)
(k' : sum_repr_type t)
(consumed_k: consumed_length input)
(consumed_payload: nat)
: Lemma
(requires (Some? (parse (parse_sum t p pc) input) /\ parse p input == Some (k', consumed_k) /\ (
let input_k = Seq.slice input consumed_k (Seq.length input) in
let k = maybe_enum_key_of_repr (sum_enum t) k' in
begin match k with
| Known k ->
Some? (parse (dsnd (pc k)) input_k) /\ (
let Some (_, consumed_payload') = parse (dsnd (pc k)) input_k in
consumed_payload' == consumed_payload
)
| _ -> False
end
)))
(ensures (
let Some (_, consumed) = parse (parse_sum t p pc) input in
consumed == consumed_k + consumed_payload
))
= parse_sum_eq'' t p pc input
#push-options "--z3rlimit 16"
let valid_sum_elim
(h: HS.mem)
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(#rrel: _) (#rel: _)
(input: slice rrel rel)
(pos: U32.t)
: Lemma
(requires (
valid (parse_sum t p pc) h input pos
))
(ensures (
valid p h input pos /\ (
let pos_payload = get_valid_pos p h input pos in
let k' = maybe_enum_key_of_repr (sum_enum t) (contents p h input pos) in
match k' with
| Known k ->
k == sum_tag_of_data t (contents (parse_sum t p pc) h input pos) /\
valid (dsnd (pc k)) h input pos_payload /\
valid_pos
(parse_sum t p pc) h input pos
(get_valid_pos (dsnd (pc k)) h input pos_payload)
| _ -> False
)))
= let sinput = bytes_of_slice_from h input pos in
let _ = parse_sum_eq'' t p pc sinput in
[@inline_let]
let _ = valid_facts (parse_sum t p pc) h input pos in
let Some (k', consumed_k) = parse p sinput in
let pos_after_tag = U32.uint_to_t (U32.v pos + consumed_k) in
[@inline_let]
let _ = valid_facts p h input pos in
assert (valid_content_pos p h input pos k' pos_after_tag);
match maybe_enum_key_of_repr (sum_enum t) k' with
| Known k -> valid_facts (dsnd (pc k)) h input pos_after_tag
| _ -> ()
#pop-options
let valid_sum_elim_tag
(h: HS.mem)
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: Lemma
(requires (
valid (parse_sum t p pc) h input pos
))
(ensures (
valid (parse_enum_key p (sum_enum t)) h input pos /\
contents (parse_enum_key p (sum_enum t)) h input pos == sum_tag_of_data t (contents (parse_sum t p pc) h input pos)
))
= let _ = parse_sum_eq' t p pc (bytes_of_slice_from h input pos) in
let _ = valid_facts (parse_sum t p pc) h input pos in
let _ = valid_facts (parse_enum_key p (sum_enum t)) h input pos in
()
inline_for_extraction
let read_sum_tag
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(p32: leaf_reader p)
(destr: dep_maybe_enum_destr_t (sum_enum t) (read_enum_key_t (sum_enum t)))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: HST.Stack (sum_key t)
(requires (fun h ->
valid (parse_sum t p pc) h input pos
))
(ensures (fun h res h' ->
B.modifies B.loc_none h h' /\
res == sum_tag_of_data t (contents (parse_sum t p pc) h input pos)
))
= let h = HST.get () in
[@inline_let] let _ = valid_sum_elim_tag h t p pc input pos in
read_enum_key p32 (sum_enum t) destr input pos
inline_for_extraction
let jump_sum_aux
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(v: jumper p)
(p32: leaf_reader p)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(v_payload: ((k: sum_repr_type t)) -> Tot (jump_sum_aux_payload_t t pc (maybe_enum_key_of_repr (sum_enum t) k)))
: Tot (jumper (parse_sum t p pc))
= fun #rrel #rel input pos ->
let h = HST.get () in
[@inline_let]
let _ = valid_sum_elim h t p pc input pos in
let pos_after_tag = v input pos in
let k' = p32 input pos in
v_payload k' input pos_after_tag
inline_for_extraction
let jump_sum_aux_payload'
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (jumper (dsnd (pc x)))))
(k: maybe_enum_key (sum_enum t))
: Tot (jump_sum_aux_payload_t t pc k)
= fun #rrel #rel input pos ->
match k with
| Known k ->
[@inline_let]
let _ = synth_sum_case_injective t k in
pc32 k input pos
| _ -> 0ul // dummy, but we MUST NOT remove this branch, otherwise extraction fails
inline_for_extraction
let jump_sum_aux_payload
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (jumper (dsnd (pc x)))))
(destr: dep_maybe_enum_destr_t (sum_enum t) (jump_sum_aux_payload_t t pc))
(k: sum_repr_type t)
: Tot (jump_sum_aux_payload_t t pc (maybe_enum_key_of_repr (sum_enum t) k))
= destr (jump_sum_aux_payload_eq t pc) (jump_sum_aux_payload_if t pc) (fun _ _ -> ()) (fun _ _ _ _ -> ()) (jump_sum_aux_payload' t pc pc32) k
inline_for_extraction
let jump_sum
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(v: jumper p)
(p32: leaf_reader p)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (jumper (dsnd (pc x)))))
(destr: dep_maybe_enum_destr_t (sum_enum t) (jump_sum_aux_payload_t t pc))
: Tot (jumper (parse_sum t p pc))
= jump_sum_aux t v p32 pc (jump_sum_aux_payload t pc pc32 destr)
inline_for_extraction
let read_sum_cases'
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (leaf_reader (dsnd (pc x)))))
(k: sum_key t)
: Tot (leaf_reader (parse_sum_cases' t pc k))
= [@inline_let]
let _ = synth_sum_case_injective t k in
read_synth'
(dsnd (pc k))
(synth_sum_case t k)
(pc32 k)
()
inline_for_extraction
let read_sum_cases_t
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot Type
= leaf_reader (parse_sum_cases' t pc k)
let read_sum_cases_t_eq
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
(x y : read_sum_cases_t t pc k)
: GTot Type0
= True
inline_for_extraction
let read_sum_cases_t_if
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (if_combinator _ (read_sum_cases_t_eq t pc k))
= fun cond (sv_true: cond_true cond -> Tot (read_sum_cases_t t pc k)) (sv_false: cond_false cond -> Tot (read_sum_cases_t t pc k)) #_ #_ input pos ->
if cond
then (sv_true () input pos)
else (sv_false () input pos)
inline_for_extraction
let read_sum_cases
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (leaf_reader (dsnd (pc x)))))
(destr: dep_enum_destr (sum_enum t) (read_sum_cases_t t pc))
(k: sum_key t)
: Tot (leaf_reader (parse_sum_cases' t pc k))
= destr
_
(read_sum_cases_t_if t pc)
(fun _ _ -> ())
(fun _ _ _ _ -> ())
(read_sum_cases' t pc pc32)
k
#push-options "--z3rlimit 32"
inline_for_extraction
let read_sum
(#kt: parser_kind)
(t: sum)
(p: parser kt (sum_repr_type t))
(p32: leaf_reader (parse_enum_key p (sum_enum t)))
(j: jumper p)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (leaf_reader (dsnd (pc x)))))
(destr: dep_enum_destr (sum_enum t) (read_sum_cases_t t pc))
: Tot (leaf_reader (parse_sum t p pc))
=
fun #_ #_ input pos ->
let h = HST.get () in
valid_facts (parse_sum t p pc) h input pos;
parse_sum_eq' t p pc (bytes_of_slice_from h input pos);
valid_facts (parse_enum_key p (sum_enum t)) h input pos;
let k = p32 input pos in
let pos' = jump_enum_key j (sum_enum t) input pos in
valid_facts (parse_sum_cases' t pc k) h input pos' ;
read_sum_cases t pc pc32 destr k input pos'
#pop-options
inline_for_extraction
let serialize32_sum_cases_t
(t: sum)
(#pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(sc: ((x: sum_key t) -> Tot (serializer (dsnd (pc x)))))
(k: sum_key t)
: Tot Type
= serializer32 (serialize_sum_cases t pc sc k)
let serialize32_sum_cases_t_eq
(t: sum)
(#pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(sc: ((x: sum_key t) -> Tot (serializer (dsnd (pc x)))))
(k: sum_key t)
(x y: serialize32_sum_cases_t t sc k)
: GTot Type0
= True
inline_for_extraction
let serialize32_sum_cases_t_if
(t: sum)
(#pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(sc: ((x: sum_key t) -> Tot (serializer (dsnd (pc x)))))
(k: sum_key t)
: Tot (if_combinator _ (serialize32_sum_cases_t_eq t sc k))
= fun cond (sv_true: (cond_true cond -> Tot (serialize32_sum_cases_t t sc k))) (sv_false: (cond_false cond -> Tot (serialize32_sum_cases_t t sc k))) x #rrel #rel b pos ->
if cond
then (sv_true () x b pos)
else (sv_false () x b pos)
inline_for_extraction
let serialize32_sum_cases_aux
(t: sum)
(#pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(sc: ((x: sum_key t) -> Tot (serializer (dsnd (pc x)))))
(sc32: ((x: sum_key t) -> Tot (serializer32 (sc x))))
(k: sum_key t)
: Tot (serializer32 (serialize_sum_cases t pc sc k))
= fun x #rrel #rel b pos ->
[@inline_let] let _ =
Classical.forall_intro (parse_sum_cases_eq' t pc k);
synth_sum_case_injective t k;
synth_sum_case_inverse t k
in
serialize32_synth
(sc32 k)
(synth_sum_case t k)
(synth_sum_case_recip t k)
(fun x -> synth_sum_case_recip t k x)
()
x
b
pos
inline_for_extraction
let serialize32_sum_cases
(t: sum)
(#pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(sc: ((x: sum_key t) -> Tot (serializer (dsnd (pc x)))))
(sc32: ((x: sum_key t) -> Tot (serializer32 (sc x))))
(destr: dep_enum_destr (sum_enum t) (serialize32_sum_cases_t t sc))
(k: sum_key t)
: Tot (serializer32 (serialize_sum_cases t pc sc k))
= destr
_
(serialize32_sum_cases_t_if t sc)
(fun _ _ -> ())
(fun _ _ _ _ -> ())
(serialize32_sum_cases_aux t sc sc32)
k
inline_for_extraction
let serialize32_sum
(#kt: parser_kind)
(t: sum)
(#p: parser kt (sum_repr_type t))
(s: serializer p {kt.parser_kind_subkind == Some ParserStrong})
(s32: serializer32 (serialize_enum_key _ s (sum_enum t)))
(#pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(sc: ((x: sum_key t) -> Tot (serializer (dsnd (pc x)))))
(sc32: ((x: sum_key t) -> Tot (serializer32 (sc x))))
(destr: dep_enum_destr (sum_enum t) (serialize32_sum_cases_t t sc))
: Tot (serializer32 (serialize_sum t s sc))
= fun x #rrel #rel b pos ->
serialize_sum_eq t s sc x;
let tg = sum_tag_of_data t x in
serialize32_nondep_then_aux s32 (serialize32_sum_cases t sc sc32 destr tg) tg x b pos
let clens_sum_tag
(s: sum)
: Tot (clens (sum_type s) (sum_key s))
= {
clens_cond = (fun _ -> True);
clens_get = sum_tag_of_data s;
}
let gaccessor_sum_tag
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
: Tot (gaccessor (parse_sum t p pc) (parse_enum_key p (sum_enum t)) (clens_sum_tag t))
= gaccessor_tagged_union_tag
(parse_enum_key p (sum_enum t))
(sum_tag_of_data t)
(parse_sum_cases t pc)
inline_for_extraction
let accessor_sum_tag
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
: Tot (accessor (gaccessor_sum_tag t p pc))
= accessor_tagged_union_tag
(parse_enum_key p (sum_enum t))
(sum_tag_of_data t)
(parse_sum_cases t pc)
let clens_sum_payload
(s: sum)
(k: sum_key s)
: Tot (clens (sum_type s) (sum_type_of_tag s k))
= {
clens_cond = (fun (x: sum_type s) -> sum_tag_of_data s x == k);
clens_get = (fun (x: sum_type s) -> synth_sum_case_recip s k x <: Ghost (sum_type_of_tag s k) (requires (sum_tag_of_data s x == k)) (ensures (fun _ -> True)));
}
#push-options "--z3rlimit 32"
let gaccessor_clens_sum_payload'
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (gaccessor' (parse_sum t p pc) (dsnd (pc k)) (clens_sum_payload t k))
= fun (input: bytes) ->
parse_sum_eq'' t p pc input;
let res =
match parse p input with
| Some (_, consumed) ->
synth_sum_case_inverse t k;
synth_sum_case_injective t k;
synth_injective_synth_inverse_synth_inverse_recip (synth_sum_case t k) (synth_sum_case_recip t k) ();
(consumed)
| _ -> 0 // dummy
in
(res <: (res: _ { gaccessor_post' (parse_sum t p pc) (dsnd (pc k)) (clens_sum_payload t k) input res } ))
#push-options "--z3rlimit 64"
let gaccessor_clens_sum_payload_injective
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
(sl sl' : bytes)
: Lemma
(requires (
gaccessor_pre (parse_sum t p pc) (dsnd (pc k)) (clens_sum_payload t k) sl /\
gaccessor_pre (parse_sum t p pc) (dsnd (pc k)) (clens_sum_payload t k) sl' /\
injective_precond (parse_sum t p pc) sl sl'
))
(ensures (gaccessor_clens_sum_payload' t p pc k sl == gaccessor_clens_sum_payload' t p pc k sl'))
= parse_sum_eq'' t p pc sl;
parse_sum_eq'' t p pc sl' ;
parse_injective (parse_sum t p pc) sl sl' ;
parse_injective p sl sl'
#pop-options
let gaccessor_clens_sum_payload_no_lookahead
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
(sl sl' : bytes)
: Lemma
(requires (
(parse_sum_kind kt t pc).parser_kind_subkind == Some ParserStrong /\
gaccessor_pre (parse_sum t p pc) (dsnd (pc k)) (clens_sum_payload t k) sl /\
gaccessor_pre (parse_sum t p pc) (dsnd (pc k)) (clens_sum_payload t k) sl' /\
no_lookahead_on_precond (parse_sum t p pc) sl sl'
))
(ensures (gaccessor_clens_sum_payload' t p pc k sl == gaccessor_clens_sum_payload' t p pc k sl'))
= parse_sum_eq'' t p pc sl;
parse_sum_eq'' t p pc sl' ;
parse_strong_prefix (parse_sum t p pc) sl sl' ;
parse_injective p sl sl'
let gaccessor_clens_sum_payload
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (gaccessor (parse_sum t p pc) (dsnd (pc k)) (clens_sum_payload t k))
= Classical.forall_intro_2 (fun x -> Classical.move_requires (gaccessor_clens_sum_payload_injective t p pc k x));
Classical.forall_intro_2 (fun x -> Classical.move_requires (gaccessor_clens_sum_payload_no_lookahead t p pc k x));
gaccessor_prop_equiv (parse_sum t p pc) (dsnd (pc k)) (clens_sum_payload t k) (gaccessor_clens_sum_payload' t p pc k);
gaccessor_clens_sum_payload' t p pc k
inline_for_extraction
let accessor_clens_sum_payload'
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(j: jumper p)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: HST.Stack U32.t
(requires (fun h ->
valid (parse_sum t p pc) h input pos /\
(clens_sum_payload t k).clens_cond (contents (parse_sum t p pc) h input pos)
))
(ensures (fun h pos' h' ->
B.modifies B.loc_none h h' /\
pos' == slice_access h (gaccessor_clens_sum_payload t p pc k) input pos
))
=
let h = HST.get () in
[@inline_let]
let _ =
let pos' = get_valid_pos (parse_sum t p pc) h input pos in
let large = bytes_of_slice_from h input pos in
slice_access_eq h (gaccessor_clens_sum_payload t p pc k) input pos;
valid_facts (parse_sum t p pc) h input pos;
parse_sum_eq'' t p pc large;
valid_facts p h input pos
in
j input pos
#pop-options
inline_for_extraction
let accessor_clens_sum_payload
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(j: jumper p)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (accessor (gaccessor_clens_sum_payload t p pc k))
= fun #rrel #rel -> accessor_clens_sum_payload' t j pc k #rrel #rel
let clens_sum_cases_payload
(s: sum)
(k: sum_key s)
: Tot (clens (sum_cases s k) (sum_type_of_tag s k))
= {
clens_cond = (fun (x: sum_cases s k) -> True);
clens_get = (fun (x: sum_cases s k) -> synth_sum_case_recip s k x <: Ghost (sum_type_of_tag s k) (requires (True)) (ensures (fun _ -> True)));
}
let gaccessor_clens_sum_cases_payload
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (gaccessor (parse_sum_cases' t pc k) (dsnd (pc k)) (clens_sum_cases_payload t k))
= synth_sum_case_injective t k;
synth_sum_case_inverse t k;
synth_injective_synth_inverse_synth_inverse_recip (synth_sum_case t k) (synth_sum_case_recip t k) ();
gaccessor_ext
(gaccessor_synth (dsnd (pc k)) (synth_sum_case t k) (synth_sum_case_recip t k) ())
(clens_sum_cases_payload t k)
()
inline_for_extraction
let accessor_clens_sum_cases_payload
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (accessor (gaccessor_clens_sum_cases_payload t pc k))
= [@inline_let]
let _ =
synth_sum_case_injective t k;
synth_sum_case_inverse t k;
synth_injective_synth_inverse_synth_inverse_recip (synth_sum_case t k) (synth_sum_case_recip t k) ()
in
accessor_ext
(accessor_synth (dsnd (pc k)) (synth_sum_case t k) (synth_sum_case_recip t k) ())
(clens_sum_cases_payload t k)
()
inline_for_extraction
let validate_dsum_cases_t
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(#k: parser_kind)
(g: parser k (dsum_type_of_unknown_tag s))
(x: dsum_key s)
: Tot Type
= validator (parse_dsum_cases' s f g x)
let validate_dsum_cases_eq
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(#k: parser_kind)
(g: parser k (dsum_type_of_unknown_tag s))
(x: dsum_key s)
(v1 v2 : validate_dsum_cases_t s f g x)
: GTot Type0
= True
inline_for_extraction
let validate_dsum_cases_if'
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(#k: parser_kind)
(g: parser k (dsum_type_of_unknown_tag s))
(x: dsum_key s)
(cond: bool)
(ift: (cond_true cond -> Tot (validate_dsum_cases_t s f g x)))
(iff: (cond_false cond -> Tot (validate_dsum_cases_t s f g x)))
: Tot (validate_dsum_cases_t s f g x)
= fun #rrel #rel input len ->
if cond
then (ift () <: validate_dsum_cases_t s f g x) input len
else (iff () <: validate_dsum_cases_t s f g x) input len
inline_for_extraction
let validate_dsum_cases_if
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(#k: parser_kind)
(g: parser k (dsum_type_of_unknown_tag s))
(x: dsum_key s)
: Tot (if_combinator _ (validate_dsum_cases_eq s f g x))
= validate_dsum_cases_if' s f g x
inline_for_extraction
let validate_dsum_cases'
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(f' : (x: dsum_known_key s) -> Tot (validator (dsnd (f x))))
(#k: parser_kind)
(#g: parser k (dsum_type_of_unknown_tag s))
(g' : validator g)
(x: dsum_key s)
: Tot (validate_dsum_cases_t s f g x)
= [@inline_let]
let _ = synth_dsum_case_injective s x in
match x with
| Known x' -> validate_synth (f' x') (synth_dsum_case s (Known x')) () <: validator (parse_dsum_cases' s f g x)
| Unknown x' -> validate_synth g' (synth_dsum_case s (Unknown x')) () <: validator (parse_dsum_cases' s f g x)
inline_for_extraction
let validate_dsum_cases'_destr
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(f' : (x: dsum_known_key s) -> Tot (validator (dsnd (f x))))
(#k: parser_kind)
(#g: parser k (dsum_type_of_unknown_tag s))
(g' : validator g)
(destr: dep_enum_destr _ (fun k -> validate_dsum_cases_t s f g (Known k)))
(x: dsum_key s)
: Tot (validate_dsum_cases_t s f g x)
= fun #rrel #rel input pos ->
match x with
| Known k ->
destr
_
(fun k -> validate_dsum_cases_if s f g (Known k))
(fun _ _ -> ())
(fun _ _ _ _ -> ())
(fun k -> validate_dsum_cases' s f f' g' (Known k))
k
input
pos
| Unknown r -> validate_dsum_cases' s f f' g' (Unknown r) input pos
inline_for_extraction
let validate_dsum_cases
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(f' : (x: dsum_known_key s) -> Tot (validator (dsnd (f x))))
(#k: parser_kind)
(#g: parser k (dsum_type_of_unknown_tag s))
(g' : validator g)
(destr: dep_enum_destr _ (fun k -> validate_dsum_cases_t s f g (Known k)))
(x: dsum_key s)
: Tot (validator (parse_dsum_cases s f g x))
= fun #rrel #rel input pos ->
let h = HST.get () in
[@inline_let]
let _ =
valid_facts (parse_dsum_cases' s f g x) h input (uint64_to_uint32 pos);
valid_facts (parse_dsum_cases s f g x) h input (uint64_to_uint32 pos);
parse_dsum_cases_eq' s f g x (bytes_of_slice_from h input (uint64_to_uint32 pos))
in
validate_dsum_cases'_destr s f f' g' destr x input pos
#push-options "--z3rlimit 40"
inline_for_extraction
let validate_dsum
(#kt: parser_kind)
(t: dsum)
(#p: parser kt (dsum_repr_type t))
(v: validator p)
(p32: leaf_reader p)
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(f32: (x: dsum_known_key t) -> Tot (validator (dsnd (f x))))
(#k': parser_kind)
(#g: parser k' (dsum_type_of_unknown_tag t))
(g32: validator g)
(destr: dep_maybe_enum_destr_t (dsum_enum t) (validate_dsum_cases_t t f g))
: Tot (validator (parse_dsum t p f g))
= fun #rrel #rel input pos ->
let h = HST.get () in
[@inline_let]
let _ = parse_dsum_eq' t p f g (bytes_of_slice_from h input (uint64_to_uint32 pos)) in
[@inline_let]
let _ = valid_facts (parse_dsum t p f g) h input (uint64_to_uint32 pos) in
[@inline_let]
let _ = valid_facts p h input (uint64_to_uint32 pos) in
let pos_after_tag = v input pos in
if is_error pos_after_tag
then pos_after_tag
else
let tg = p32 input (uint64_to_uint32 pos) in
[@inline_let]
let _ = valid_facts (parse_dsum_cases' t f g (maybe_enum_key_of_repr (dsum_enum t) tg)) h input (uint64_to_uint32 pos_after_tag) in
destr (validate_dsum_cases_eq t f g) (validate_dsum_cases_if t f g) (fun _ _ -> ()) (fun _ _ _ _ -> ()) (validate_dsum_cases' t f f32 g32) tg input pos_after_tag
#pop-options
#reset-options "--z3rlimit 64 --z3cliopt smt.arith.nl=false --initial_ifuel 8 --max_ifuel 8 --initial_fuel 2 --max_fuel 2"
let valid_dsum_intro_known
(h: HS.mem)
(t: dsum)
(#kt: parser_kind)
(p: parser kt (dsum_repr_type t))
(f: ((x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x))))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: Lemma
(requires (
valid (parse_maybe_enum_key p (dsum_enum t)) h input pos /\ (
let k' = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
Known? k' /\ (
let Known k = k' in
valid (dsnd (f k)) h input (get_valid_pos (parse_maybe_enum_key p (dsum_enum t)) h input pos)
))))
(ensures (
let Known k = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
let pos_payload = get_valid_pos (parse_maybe_enum_key p (dsum_enum t)) h input pos in
valid_content_pos
(parse_dsum t p f g) h input pos
(synth_dsum_case t (Known k) (contents (dsnd (f k)) h input pos_payload))
(get_valid_pos (dsnd (f k)) h input pos_payload)
))
= valid_facts (parse_maybe_enum_key p (dsum_enum t)) h input pos;
let Known k = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
let pos_payload = get_valid_pos (parse_maybe_enum_key p (dsum_enum t)) h input pos in
valid_facts (dsnd (f k)) h input pos_payload;
valid_facts (parse_dsum t p f g) h input pos;
parse_dsum_eq t p f g (bytes_of_slice_from h input pos)
let valid_dsum_intro_unknown
(h: HS.mem)
(t: dsum)
(#kt: parser_kind)
(p: parser kt (dsum_repr_type t))
(f: ((x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x))))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: Lemma
(requires (
valid (parse_maybe_enum_key p (dsum_enum t)) h input pos /\ (
let k' = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
Unknown? k' /\
valid g h input (get_valid_pos (parse_maybe_enum_key p (dsum_enum t)) h input pos)
)))
(ensures (
let Unknown r = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
let pos_payload = get_valid_pos (parse_maybe_enum_key p (dsum_enum t)) h input pos in
valid_content_pos
(parse_dsum t p f g) h input pos
(synth_dsum_case t (Unknown r) (contents g h input pos_payload))
(get_valid_pos g h input pos_payload)
))
= valid_facts (parse_maybe_enum_key p (dsum_enum t)) h input pos;
let Unknown r = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
let pos_payload = get_valid_pos (parse_maybe_enum_key p (dsum_enum t)) h input pos in
valid_facts g h input pos_payload;
valid_facts (parse_dsum t p f g) h input pos;
parse_dsum_eq t p f g (bytes_of_slice_from h input pos)
#reset-options
inline_for_extraction
let finalize_dsum_case_known
(t: dsum)
(#kt: parser_kind)
(#p: parser kt (dsum_repr_type t))
(s: serializer p)
(w: leaf_writer_strong s)
(f: ((x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x))))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
(destr: enum_repr_of_key'_t (dsum_enum t))
(k: dsum_known_key t)
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: HST.Stack unit
(requires (fun h ->
let len_tag = serialized_length (serialize_enum_key _ s (dsum_enum t)) k in
U32.v pos + len_tag < 4294967296 /\ (
let pos_payload = pos `U32.add` U32.uint_to_t len_tag in
valid (dsnd (f k)) h input pos_payload /\
writable input.base (U32.v pos) (U32.v pos_payload) h
)))
(ensures (fun h _ h' ->
let len_tag = serialized_length (serialize_enum_key _ s (dsum_enum t)) k in
let pos_payload = pos `U32.add` U32.uint_to_t len_tag in
B.modifies (loc_slice_from_to input pos pos_payload) h h' /\
valid_content_pos (parse_dsum t p f g) h' input pos (synth_dsum_case t (Known k) (contents (dsnd (f k)) h input pos_payload)) (get_valid_pos (dsnd (f k)) h input pos_payload)
))
= let pos1 = write_enum_key w (dsum_enum t) destr k input pos in
let h = HST.get () in
[@inline_let]
let _ =
valid_facts (parse_enum_key p (dsum_enum t)) h input pos;
valid_facts (parse_maybe_enum_key p (dsum_enum t)) h input pos;
let sq = bytes_of_slice_from h input pos in
parse_enum_key_eq p (dsum_enum t) sq;
parse_maybe_enum_key_eq p (dsum_enum t) sq;
valid_dsum_intro_known h t p f g input pos
in
()
inline_for_extraction
let finalize_dsum_case_unknown
(t: dsum)
(#kt: parser_kind)
(#p: parser kt (dsum_repr_type t))
(s: serializer p)
(w: leaf_writer_strong s)
(f: ((x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x))))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
(r: unknown_enum_repr (dsum_enum t))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: HST.Stack unit
(requires (fun h ->
let len_tag = serialized_length s r in
U32.v pos + len_tag < 4294967296 /\ (
let pos_payload = pos `U32.add` U32.uint_to_t len_tag in
valid g h input pos_payload /\
writable input.base (U32.v pos) (U32.v pos_payload) h
)))
(ensures (fun h _ h' ->
let len_tag = serialized_length s r in
let pos_payload = pos `U32.add` U32.uint_to_t len_tag in
B.modifies (loc_slice_from_to input pos pos_payload) h h' /\
valid_content_pos (parse_dsum t p f g) h' input pos (synth_dsum_case t (Unknown r) (contents g h input pos_payload)) (get_valid_pos g h input pos_payload)
))
= let pos1 = w r input pos in
let h = HST.get () in
[@inline_let]
let _ =
valid_facts (parse_maybe_enum_key p (dsum_enum t)) h input pos;
valid_facts p h input pos;
let sq = bytes_of_slice_from h input pos in
parse_maybe_enum_key_eq p (dsum_enum t) sq;
valid_dsum_intro_unknown h t p f g input pos
in
()
let valid_dsum_elim_tag
(h: HS.mem)
(t: dsum)
(#kt: parser_kind)
(p: parser kt (dsum_repr_type t))
(f: ((x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x))))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: Lemma
(requires (
valid (parse_dsum t p f g) h input pos
))
(ensures (
valid (parse_maybe_enum_key p (dsum_enum t)) h input pos /\
contents (parse_maybe_enum_key p (dsum_enum t)) h input pos == dsum_tag_of_data t (contents (parse_dsum t p f g) h input pos)
))
= let _ = parse_dsum_eq_ t p f g (bytes_of_slice_from h input pos) in
let _ = valid_facts (parse_dsum t p f g) h input pos in
let _ = valid_facts (parse_maybe_enum_key p (dsum_enum t)) h input pos in
()
inline_for_extraction
let read_dsum_tag
(t: dsum)
(#kt: parser_kind)
(#p: parser kt (dsum_repr_type t))
(p32: leaf_reader p)
(destr: maybe_enum_destr_t (maybe_enum_key (dsum_enum t)) (dsum_enum t))
(f: ((x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x))))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: HST.Stack (dsum_key t)
(requires (fun h ->
valid (parse_dsum t p f g) h input pos
))
(ensures (fun h res h' ->
B.modifies B.loc_none h h' /\
res == dsum_tag_of_data t (contents (parse_dsum t p f g) h input pos)
))
= let h = HST.get () in
[@inline_let] let _ = valid_dsum_elim_tag h t p f g input pos in
read_maybe_enum_key p32 (dsum_enum t) destr input pos
#push-options "--z3rlimit 32"
let valid_dsum_elim_known
(h: HS.mem)
(t: dsum)
(#kt: parser_kind)
(p: parser kt (dsum_repr_type t))
(f: ((x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x))))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: Lemma
(requires (
valid (parse_dsum t p f g) h input pos /\
Known? (dsum_tag_of_data t (contents (parse_dsum t p f g) h input pos))
))
(ensures (
valid (parse_maybe_enum_key p (dsum_enum t)) h input pos /\ (
let k' = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
let pos_payload = get_valid_pos (parse_maybe_enum_key p (dsum_enum t)) h input pos in
Known? k' /\ (
let Known k = k' in
valid (dsnd (f k)) h input pos_payload /\
valid_content_pos
(parse_dsum t p f g) h input pos
(synth_dsum_case t (Known k) (contents (dsnd (f k)) h input pos_payload))
(get_valid_pos (dsnd (f k)) h input pos_payload)
))))
=
valid_facts (parse_dsum t p f g) h input pos;
parse_dsum_eq t p f g (bytes_of_slice_from h input pos);
valid_facts (parse_maybe_enum_key p (dsum_enum t)) h input pos;
let Known k = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
let pos_payload = get_valid_pos (parse_maybe_enum_key p (dsum_enum t)) h input pos in
valid_facts (dsnd (f k)) h input pos_payload
#pop-options
let valid_dsum_elim_unknown
(h: HS.mem)
(t: dsum)
(#kt: parser_kind)
(p: parser kt (dsum_repr_type t))
(f: ((x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x))))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: Lemma
(requires (
valid (parse_dsum t p f g) h input pos /\
Unknown? (dsum_tag_of_data t (contents (parse_dsum t p f g) h input pos))
))
(ensures (
valid (parse_maybe_enum_key p (dsum_enum t)) h input pos /\ (
let k' = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
let pos_payload = get_valid_pos (parse_maybe_enum_key p (dsum_enum t)) h input pos in
Unknown? k' /\ (
let Unknown r = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
valid g h input pos_payload /\
valid_content_pos
(parse_dsum t p f g) h input pos
(synth_dsum_case t (Unknown r) (contents g h input pos_payload))
(get_valid_pos g h input pos_payload)
))))
=
valid_facts (parse_dsum t p f g) h input pos;
parse_dsum_eq t p f g (bytes_of_slice_from h input pos);
valid_facts (parse_maybe_enum_key p (dsum_enum t)) h input pos;
let Unknown r = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
let pos_payload = get_valid_pos (parse_maybe_enum_key p (dsum_enum t)) h input pos in
valid_facts g h input pos_payload
inline_for_extraction
let jump_dsum_cases_t
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(#k: parser_kind)
(g: parser k (dsum_type_of_unknown_tag s))
(x: dsum_key s)
: Tot Type
= jumper (parse_dsum_cases' s f g x)
let jump_dsum_cases_eq
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(#k: parser_kind)
(g: parser k (dsum_type_of_unknown_tag s))
(x: dsum_key s)
(v1 v2 : jump_dsum_cases_t s f g x)
: GTot Type0
= True
inline_for_extraction
let jump_dsum_cases_if'
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(#k: parser_kind)
(g: parser k (dsum_type_of_unknown_tag s))
(x: dsum_key s)
(cond: bool)
(ift: (cond_true cond -> Tot (jump_dsum_cases_t s f g x)))
(iff: (cond_false cond -> Tot (jump_dsum_cases_t s f g x)))
: Tot (jump_dsum_cases_t s f g x)
= fun #rrel #rel input len ->
if cond
then (ift () <: jump_dsum_cases_t s f g x) input len
else (iff () <: jump_dsum_cases_t s f g x) input len
inline_for_extraction
let jump_dsum_cases_if
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(#k: parser_kind)
(g: parser k (dsum_type_of_unknown_tag s))
(x: dsum_key s)
: Tot (if_combinator _ (jump_dsum_cases_eq s f g x))
= jump_dsum_cases_if' s f g x
inline_for_extraction
let jump_dsum_cases'
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(f' : (x: dsum_known_key s) -> Tot (jumper (dsnd (f x))))
(#k: parser_kind)
(#g: parser k (dsum_type_of_unknown_tag s))
(g' : jumper g)
(x: dsum_key s)
: Tot (jump_dsum_cases_t s f g x)
= synth_dsum_case_injective s x;
match x with
| Known x' -> jump_synth (f' x') (synth_dsum_case s (Known x')) () <: jumper (parse_dsum_cases' s f g x)
| Unknown x' -> jump_synth g' (synth_dsum_case s (Unknown x')) () <: jumper (parse_dsum_cases' s f g x)
inline_for_extraction
let jump_dsum_cases'_destr
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(f' : (x: dsum_known_key s) -> Tot (jumper (dsnd (f x))))
(#k: parser_kind)
(#g: parser k (dsum_type_of_unknown_tag s))
(g' : jumper g)
(destr: dep_enum_destr _ (fun k -> jump_dsum_cases_t s f g (Known k)))
(x: dsum_key s)
: Tot (jump_dsum_cases_t s f g x)
= fun #rrel #rel input pos ->
match x with
| Known k ->
destr
_
(fun k -> jump_dsum_cases_if s f g (Known k))
(fun _ _ -> ())
(fun _ _ _ _ -> ())
(fun k -> jump_dsum_cases' s f f' g' (Known k))
k
input
pos
| Unknown r -> jump_dsum_cases' s f f' g' (Unknown r) input pos
inline_for_extraction
let jump_dsum_cases
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(f' : (x: dsum_known_key s) -> Tot (jumper (dsnd (f x))))
(#k: parser_kind)
(#g: parser k (dsum_type_of_unknown_tag s))
(g' : jumper g)
(destr: dep_enum_destr _ (fun k -> jump_dsum_cases_t s f g (Known k)))
(x: dsum_key s)
: Tot (jumper (parse_dsum_cases s f g x))
= fun #rrel #rel input pos ->
let h = HST.get () in
[@inline_let]
let _ =
valid_facts (parse_dsum_cases' s f g x) h input pos;
valid_facts (parse_dsum_cases s f g x) h input pos;
parse_dsum_cases_eq' s f g x (bytes_of_slice_from h input pos)
in
jump_dsum_cases'_destr s f f' g' destr x input pos
#push-options "--z3rlimit 16"
inline_for_extraction
let jump_dsum
(#kt: parser_kind)
(t: dsum)
(#p: parser kt (dsum_repr_type t))
(v: jumper p)
(p32: leaf_reader p)
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(f32: (x: dsum_known_key t) -> Tot (jumper (dsnd (f x))))
(#k': parser_kind)
(#g: parser k' (dsum_type_of_unknown_tag t))
(g32: jumper g)
(destr: dep_maybe_enum_destr_t (dsum_enum t) (jump_dsum_cases_t t f g))
: Tot (jumper (parse_dsum t p f g))
= fun #rrel #rel input pos ->
let h = HST.get () in
[@inline_let]
let _ = parse_dsum_eq' t p f g (bytes_of_slice_from h input pos) in
[@inline_let]
let _ = valid_facts (parse_dsum t p f g) h input pos in
[@inline_let]
let _ = valid_facts p h input pos in
let pos_after_tag = v input pos in
let tg = p32 input pos in
[@inline_let]
let _ = valid_facts (parse_dsum_cases' t f g (maybe_enum_key_of_repr (dsum_enum t) tg)) h input pos_after_tag in
destr (jump_dsum_cases_eq t f g) (jump_dsum_cases_if t f g) (fun _ _ -> ()) (fun _ _ _ _ -> ()) (jump_dsum_cases' t f f32 g32) tg input pos_after_tag
#pop-options
inline_for_extraction
let read_dsum_cases'
(t: dsum)
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(f32: (x: dsum_known_key t) -> Tot (leaf_reader (dsnd (f x))))
(#k': parser_kind)
(g: parser k' (dsum_type_of_unknown_tag t))
(g32: leaf_reader g)
(x: dsum_key t)
: Tot (leaf_reader (parse_dsum_cases' t f g x))
= fun #rrel #rel input pos ->
[@inline_let]
let _ = synth_dsum_case_injective t x in
match x with
| Known x' ->
read_synth'
(dsnd (f x'))
(synth_dsum_case t (Known x'))
(f32 x')
()
input
pos
| Unknown x' ->
read_synth'
g
(synth_dsum_case t (Unknown x'))
g32
()
input
pos
inline_for_extraction
let read_dsum_cases_t
(t: dsum)
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(#k': parser_kind)
(g: parser k' (dsum_type_of_unknown_tag t))
(k: dsum_known_key t)
: Tot Type
= leaf_reader (parse_dsum_cases' t f g (Known k))
let read_dsum_cases_t_eq
(t: dsum)
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(#k': parser_kind)
(g: parser k' (dsum_type_of_unknown_tag t))
(k: dsum_known_key t)
(x y : read_dsum_cases_t t f g k)
: GTot Type0
= True
inline_for_extraction
let read_dsum_cases_t_if
(t: dsum)
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(#k': parser_kind)
(g: parser k' (dsum_type_of_unknown_tag t))
(k: dsum_known_key t)
: Tot (if_combinator _ (read_dsum_cases_t_eq t f g k))
= fun cond (sv_true: cond_true cond -> Tot (read_dsum_cases_t t f g k)) (sv_false: cond_false cond -> Tot (read_dsum_cases_t t f g k)) #_ #_ input pos ->
if cond
then sv_true () input pos
else sv_false () input pos
inline_for_extraction
let read_dsum_cases
(t: dsum)
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(f32: (x: dsum_known_key t) -> Tot (leaf_reader (dsnd (f x))))
(#k': parser_kind)
(g: parser k' (dsum_type_of_unknown_tag t))
(g32: leaf_reader g)
(destr: dep_enum_destr _ (read_dsum_cases_t t f g))
(x: dsum_key t)
: Tot (leaf_reader (parse_dsum_cases' t f g x))
= fun #_ #_ input pos ->
match x with
| Known k ->
destr
_
(read_dsum_cases_t_if t f g)
(fun _ _ -> ())
(fun _ _ _ _ -> ())
(fun k -> read_dsum_cases' t f f32 g g32 (Known k))
k
input
pos
| Unknown r ->
read_dsum_cases' t f f32 g g32 (Unknown r) input pos
#push-options "--z3rlimit 16"
inline_for_extraction
let read_dsum
(#kt: parser_kind)
(t: dsum)
(#p: parser kt (dsum_repr_type t))
(p32: leaf_reader (parse_maybe_enum_key p (dsum_enum t)))
(j: jumper p)
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(f32: (x: dsum_known_key t) -> Tot (leaf_reader (dsnd (f x))))
(#k': parser_kind)
(#g: parser k' (dsum_type_of_unknown_tag t))
(g32: leaf_reader g)
(destr: dep_enum_destr _ (read_dsum_cases_t t f g))
: Tot (leaf_reader (parse_dsum t p f g))
= fun #_ #_ input pos ->
let h = HST.get () in
valid_facts (parse_dsum t p f g) h input pos;
parse_dsum_eq_ t p f g (bytes_of_slice_from h input pos);
valid_facts (parse_maybe_enum_key p (dsum_enum t)) h input pos;
let k = p32 input pos in
let pos' = jump_maybe_enum_key j (dsum_enum t) input pos in
valid_facts (parse_dsum_cases' t f g k) h input pos' ;
read_dsum_cases t f f32 g g32 destr k input pos'
#pop-options
inline_for_extraction
let serialize32_dsum_type_of_tag
(t: dsum)
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(sf: (x: dsum_known_key t) -> Tot (serializer (dsnd (f x))))
(sf32: (x: dsum_known_key t) -> Tot (serializer32 (sf x)))
(#k': parser_kind)
(#g: parser k' (dsum_type_of_unknown_tag t))
(#sg: serializer g)
(sg32: serializer32 sg)
(tg: dsum_key t)
: Tot (serializer32 (serialize_dsum_type_of_tag t f sf g sg tg))
= match tg with
| Known x' -> serialize32_ext (dsnd (f x')) (sf x') (sf32 x') (parse_dsum_type_of_tag t f g tg) ()
| Unknown x' -> serialize32_ext g sg sg32 (parse_dsum_type_of_tag t f g tg) ()
inline_for_extraction
let serialize32_dsum_cases_aux
(t: dsum)
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(sf: (x: dsum_known_key t) -> Tot (serializer (dsnd (f x))))
(sf32: (x: dsum_known_key t) -> Tot (serializer32 (sf x)))
(#k': parser_kind)
(#g: parser k' (dsum_type_of_unknown_tag t))
(#sg: serializer g)
(sg32: serializer32 sg)
(tg: dsum_key t)
: Tot (serializer32 (serialize_dsum_cases t f sf g sg tg))
= [@inline_let]
let _ = synth_dsum_case_injective t tg in
[@inline_let]
let _ = synth_dsum_case_inverse t tg in
serialize32_synth
(serialize32_dsum_type_of_tag t f sf sf32 sg32 tg)
(synth_dsum_case t tg)
(synth_dsum_case_recip t tg)
(fun x -> synth_dsum_case_recip t tg x)
()
inline_for_extraction
let serialize32_dsum_cases_t
(t: dsum)
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(sf: (x: dsum_known_key t) -> Tot (serializer (dsnd (f x))))
(#k': parser_kind)
(g: parser k' (dsum_type_of_unknown_tag t))
(sg: serializer g)
(k: dsum_known_key t)
: Tot Type
= serializer32 (serialize_dsum_cases t f sf g sg (Known k))
let serialize32_dsum_cases_t_eq
(t: dsum)
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(sf: (x: dsum_known_key t) -> Tot (serializer (dsnd (f x))))
(#k': parser_kind)
(g: parser k' (dsum_type_of_unknown_tag t))
(sg: serializer g)
(k: dsum_known_key t)
(x y: serialize32_dsum_cases_t t f sf g sg k)
: GTot Type0
= True
inline_for_extraction
let serialize32_dsum_cases_t_if
(t: dsum)
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(sf: (x: dsum_known_key t) -> Tot (serializer (dsnd (f x))))
(#k': parser_kind)
(g: parser k' (dsum_type_of_unknown_tag t))
(sg: serializer g)
(k: dsum_known_key t)
: Tot (if_combinator _ (serialize32_dsum_cases_t_eq t f sf g sg k))
= fun cond (sv_true: (cond_true cond -> Tot (serialize32_dsum_cases_t t f sf g sg k))) (sv_false: (cond_false cond -> Tot (serialize32_dsum_cases_t t f sf g sg k))) x #rrel #rel output pos ->
if cond
then (sv_true () x output pos)
else (sv_false () x output pos)
inline_for_extraction
let serialize32_dsum_cases
(t: dsum)
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(sf: (x: dsum_known_key t) -> Tot (serializer (dsnd (f x))))
(sf32: (x: dsum_known_key t) -> Tot (serializer32 (sf x)))
(#k': parser_kind)
(#g: parser k' (dsum_type_of_unknown_tag t))
(#sg: serializer g)
(sg32: serializer32 sg)
(destr: dep_enum_destr _ (serialize32_dsum_cases_t t f sf g sg))
(tg: dsum_key t)
: Tot (serializer32 (serialize_dsum_cases t f sf g sg tg))
= fun x #rrel #rel output pos ->
match tg with
| Known k ->
destr
_
(serialize32_dsum_cases_t_if t f sf g sg)
(fun _ _ -> ())
(fun _ _ _ _ -> ())
(fun k -> serialize32_dsum_cases_aux t f sf sf32 sg32 (Known k))
k
x
output
pos
| Unknown r ->
serialize32_dsum_cases_aux t f sf sf32 sg32 (Unknown r) x output pos
inline_for_extraction
let serialize32_dsum
(#kt: parser_kind)
(t: dsum)
(#p: parser kt (dsum_repr_type t))
(s: serializer p {kt.parser_kind_subkind == Some ParserStrong})
(s32: serializer32 (serialize_maybe_enum_key _ s (dsum_enum t)))
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(sf: (x: dsum_known_key t) -> Tot (serializer (dsnd (f x))))
(sf32: (x: dsum_known_key t) -> Tot (serializer32 (sf x)))
(#k': parser_kind)
(#g: parser k' (dsum_type_of_unknown_tag t))
(#sg: serializer g)
(sg32: serializer32 sg)
(destr: dep_enum_destr _ (serialize32_dsum_cases_t t f sf g sg))
: Tot (serializer32 (serialize_dsum t s f sf g sg))
= fun x #_ #_ output pos ->
[@inline_let]
let _ = serialize_dsum_eq' t s f sf g sg x in
let tg = dsum_tag_of_data t x in
serialize32_nondep_then_aux
s32
(serialize32_dsum_cases t f sf sf32 sg32 destr tg)
tg
x
output
pos
let clens_dsum_tag
(s: dsum)
: Tot (clens (dsum_type s) (dsum_key s))
= {
clens_cond = (fun _ -> True);
clens_get = dsum_tag_of_data s;
}
let gaccessor_dsum_tag
(#kt: parser_kind)
(t: dsum)
(p: parser kt (dsum_repr_type t))
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
: Tot (gaccessor (parse_dsum t p f g) (parse_maybe_enum_key p (dsum_enum t)) (clens_dsum_tag t))
= gaccessor_tagged_union_tag
(parse_maybe_enum_key p (dsum_enum t))
(dsum_tag_of_data t)
(parse_dsum_cases t f g)
inline_for_extraction
let accessor_dsum_tag
(#kt: parser_kind)
(t: dsum)
(p: parser kt (dsum_repr_type t))
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
: Tot (accessor (gaccessor_dsum_tag t p f g))
= accessor_tagged_union_tag
(parse_maybe_enum_key p (dsum_enum t))
(dsum_tag_of_data t)
(parse_dsum_cases t f g)
let clens_dsum_payload
(s: dsum)
(k: dsum_key s)
: Tot (clens (dsum_type s) (dsum_type_of_tag s k))
= {
clens_cond = (fun (x: dsum_type s) -> dsum_tag_of_data s x == k);
clens_get = (fun (x: dsum_type s) -> synth_dsum_case_recip s k x <: Ghost (dsum_type_of_tag s k) (requires (dsum_tag_of_data s x == k)) (ensures (fun _ -> True)));
}
let clens_dsum_unknown_payload
(s: dsum)
: Tot (clens (dsum_type s) (dsum_type_of_unknown_tag s))
= {
clens_cond = (fun (x: dsum_type s) -> Unknown? (dsum_tag_of_data s x));
clens_get = (fun (x: dsum_type s) -> synth_dsum_case_recip s (dsum_tag_of_data s x) x <: Ghost (dsum_type_of_unknown_tag s) (requires (Unknown? (dsum_tag_of_data s x))) (ensures (fun _ -> True)));
}
#push-options "--z3rlimit 16"
let gaccessor_clens_dsum_payload'
(#kt: parser_kind)
(t: dsum)
(p: parser kt (dsum_repr_type t))
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
(k: dsum_key t)
: Tot (gaccessor' (parse_dsum t p f g) (parse_dsum_type_of_tag' t f g k) (clens_dsum_payload t k))
= fun (input: bytes) ->
parse_dsum_eq3 t p f g input;
let res =
match parse p input with
| Some (_, consumed) ->
synth_dsum_case_inverse t k;
synth_dsum_case_injective t k;
synth_injective_synth_inverse_synth_inverse_recip (synth_dsum_case t k) (synth_dsum_case_recip t k) ();
(consumed)
| _ -> (0) // dummy
in
(res <: (res: _ { gaccessor_post' (parse_dsum t p f g) (parse_dsum_type_of_tag' t f g k) (clens_dsum_payload t k) input res } ))
let gaccessor_clens_dsum_payload_injective
(#kt: parser_kind)
(t: dsum)
(p: parser kt (dsum_repr_type t))
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
(k: dsum_key t)
(sl sl' : bytes)
: Lemma
(requires (
gaccessor_pre (parse_dsum t p f g) (parse_dsum_type_of_tag' t f g k) (clens_dsum_payload t k) sl /\
gaccessor_pre (parse_dsum t p f g) (parse_dsum_type_of_tag' t f g k) (clens_dsum_payload t k) sl' /\
injective_precond (parse_dsum t p f g) sl sl'
))
(ensures (
gaccessor_clens_dsum_payload' t p f g k sl == gaccessor_clens_dsum_payload' t p f g k sl'
))
=
parse_dsum_eq3 t p f g sl;
parse_dsum_eq3 t p f g sl';
parse_injective (parse_dsum t p f g) sl sl' ;
parse_injective p sl sl'
let gaccessor_clens_dsum_payload_no_lookahead
(#kt: parser_kind)
(t: dsum)
(p: parser kt (dsum_repr_type t))
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
(k: dsum_key t)
(sl sl' : bytes)
: Lemma
(requires (
(parse_dsum_kind kt t f ku).parser_kind_subkind == Some ParserStrong /\
gaccessor_pre (parse_dsum t p f g) (parse_dsum_type_of_tag' t f g k) (clens_dsum_payload t k) sl /\
gaccessor_pre (parse_dsum t p f g) (parse_dsum_type_of_tag' t f g k) (clens_dsum_payload t k) sl' /\
no_lookahead_on_precond (parse_dsum t p f g) sl sl'
))
(ensures (
gaccessor_clens_dsum_payload' t p f g k sl == gaccessor_clens_dsum_payload' t p f g k sl'
))
= parse_dsum_eq3 t p f g sl;
parse_dsum_eq3 t p f g sl';
parse_strong_prefix (parse_dsum t p f g) sl sl' ;
parse_injective p sl sl'
let gaccessor_clens_dsum_payload
(#kt: parser_kind)
(t: dsum)
(p: parser kt (dsum_repr_type t))
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
(k: dsum_key t)
: Tot (gaccessor (parse_dsum t p f g) (parse_dsum_type_of_tag' t f g k) (clens_dsum_payload t k))
= Classical.forall_intro_2 (fun x -> Classical.move_requires (gaccessor_clens_dsum_payload_injective t p f g k x));
Classical.forall_intro_2 (fun x -> Classical.move_requires (gaccessor_clens_dsum_payload_no_lookahead t p f g k x));
gaccessor_prop_equiv (parse_dsum t p f g) (parse_dsum_type_of_tag' t f g k) (clens_dsum_payload t k) (gaccessor_clens_dsum_payload' t p f g k);
gaccessor_clens_dsum_payload' t p f g k | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"LowStar.Buffer.fst.checked",
"LowParse.Spec.Sum.fst.checked",
"LowParse.Low.Enum.fst.checked",
"FStar.UInt64.fsti.checked",
"FStar.UInt32.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Int.Cast.fst.checked",
"FStar.HyperStack.ST.fsti.checked",
"FStar.HyperStack.fst.checked",
"FStar.Classical.fsti.checked"
],
"interface_file": false,
"source_file": "LowParse.Low.Sum.fst"
} | [
{
"abbrev": true,
"full_module": "FStar.HyperStack",
"short_module": "HS"
},
{
"abbrev": true,
"full_module": "FStar.UInt64",
"short_module": "U64"
},
{
"abbrev": true,
"full_module": "FStar.Int.Cast",
"short_module": "Cast"
},
{
"abbrev": true,
"full_module": "LowStar.Buffer",
"short_module": "B"
},
{
"abbrev": true,
"full_module": "FStar.HyperStack.ST",
"short_module": "HST"
},
{
"abbrev": true,
"full_module": "FStar.UInt32",
"short_module": "U32"
},
{
"abbrev": false,
"full_module": "LowParse.Spec.Sum",
"short_module": null
},
{
"abbrev": false,
"full_module": "LowParse.Low.Enum",
"short_module": null
},
{
"abbrev": false,
"full_module": "LowParse.Low",
"short_module": null
},
{
"abbrev": false,
"full_module": "LowParse.Low",
"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",
"short_module": null
}
] | {
"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_elim_box": false,
"smtencoding_l_arith_repr": "boxwrap",
"smtencoding_nl_arith_repr": "boxwrap",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": true,
"z3cliopt": [],
"z3refresh": false,
"z3rlimit": 16,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | false |
t: LowParse.Spec.Sum.dsum ->
j: LowParse.Low.Base.jumper p ->
f:
(x: LowParse.Spec.Sum.dsum_known_key t
-> Prims.dtuple2 LowParse.Spec.Base.parser_kind
(fun k -> LowParse.Spec.Base.parser k (LowParse.Spec.Sum.dsum_type_of_known_tag t x))) ->
g: LowParse.Spec.Base.parser ku (LowParse.Spec.Sum.dsum_type_of_unknown_tag t) ->
k: LowParse.Spec.Sum.dsum_key t ->
input: LowParse.Slice.slice rrel rel ->
pos: FStar.UInt32.t
-> FStar.HyperStack.ST.Stack FStar.UInt32.t | FStar.HyperStack.ST.Stack | [] | [] | [
"LowParse.Spec.Base.parser_kind",
"LowParse.Spec.Sum.dsum",
"LowParse.Spec.Base.parser",
"LowParse.Spec.Sum.dsum_repr_type",
"LowParse.Low.Base.jumper",
"LowParse.Spec.Sum.dsum_known_key",
"Prims.dtuple2",
"LowParse.Spec.Sum.dsum_type_of_known_tag",
"LowParse.Spec.Sum.dsum_type_of_unknown_tag",
"LowParse.Spec.Sum.dsum_key",
"LowParse.Slice.srel",
"LowParse.Bytes.byte",
"LowParse.Slice.slice",
"FStar.UInt32.t",
"Prims.unit",
"LowParse.Low.Base.Spec.valid_facts",
"LowParse.Spec.Sum.parse_dsum_eq3",
"LowParse.Spec.Sum.parse_dsum_kind",
"LowParse.Spec.Sum.dsum_type",
"LowParse.Spec.Sum.parse_dsum",
"LowParse.Low.Base.Spec.slice_access_eq",
"LowParse.Spec.Sum.parse_dsum_cases_kind",
"LowParse.Spec.Sum.dsum_type_of_tag",
"LowParse.Spec.Sum.parse_dsum_type_of_tag'",
"LowParse.Low.Sum.clens_dsum_payload",
"LowParse.Low.Sum.gaccessor_clens_dsum_payload",
"LowParse.Bytes.bytes",
"LowParse.Slice.bytes_of_slice_from",
"LowParse.Low.Base.Spec.get_valid_pos",
"FStar.Monotonic.HyperStack.mem",
"FStar.HyperStack.ST.get",
"Prims.l_and",
"LowParse.Low.Base.Spec.valid",
"LowParse.Low.Base.Spec.__proj__Mkclens__item__clens_cond",
"LowParse.Low.Base.Spec.contents",
"LowStar.Monotonic.Buffer.modifies",
"LowStar.Monotonic.Buffer.loc_none",
"Prims.eq2",
"LowParse.Low.Base.Spec.slice_access"
] | [] | false | true | false | false | false | let accessor_clens_dsum_payload'
(#kt: parser_kind)
(t: dsum)
(#p: parser kt (dsum_repr_type t))
(j: jumper p)
(f: (x: dsum_known_key t -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x))))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
(k: dsum_key t)
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: HST.Stack U32.t
(requires
(fun h ->
valid (parse_dsum t p f g) h input pos /\
(clens_dsum_payload t k).clens_cond (contents (parse_dsum t p f g) h input pos)))
(ensures
(fun h pos' h' ->
B.modifies B.loc_none h h' /\
pos' == slice_access h (gaccessor_clens_dsum_payload t p f g k) input pos)) =
| let h = HST.get () in
[@@ inline_let ]let _ =
let pos' = get_valid_pos (parse_dsum t p f g) h input pos in
let large = bytes_of_slice_from h input pos in
slice_access_eq h (gaccessor_clens_dsum_payload t p f g k) input pos;
valid_facts (parse_dsum t p f g) h input pos;
parse_dsum_eq3 t p f g large;
valid_facts p h input pos
in
j input pos | false |
LowParse.Low.Sum.fst | LowParse.Low.Sum.valid_dsum_elim_unknown | val valid_dsum_elim_unknown
(h: HS.mem)
(t: dsum)
(#kt: parser_kind)
(p: parser kt (dsum_repr_type t))
(f: (x: dsum_known_key t -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x))))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: Lemma
(requires
(valid (parse_dsum t p f g) h input pos /\
Unknown? (dsum_tag_of_data t (contents (parse_dsum t p f g) h input pos))))
(ensures
(valid (parse_maybe_enum_key p (dsum_enum t)) h input pos /\
(let k' = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
let pos_payload = get_valid_pos (parse_maybe_enum_key p (dsum_enum t)) h input pos in
Unknown? k' /\
(let Unknown r = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
valid g h input pos_payload /\
valid_content_pos (parse_dsum t p f g)
h
input
pos
(synth_dsum_case t (Unknown r) (contents g h input pos_payload))
(get_valid_pos g h input pos_payload))))) | val valid_dsum_elim_unknown
(h: HS.mem)
(t: dsum)
(#kt: parser_kind)
(p: parser kt (dsum_repr_type t))
(f: (x: dsum_known_key t -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x))))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: Lemma
(requires
(valid (parse_dsum t p f g) h input pos /\
Unknown? (dsum_tag_of_data t (contents (parse_dsum t p f g) h input pos))))
(ensures
(valid (parse_maybe_enum_key p (dsum_enum t)) h input pos /\
(let k' = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
let pos_payload = get_valid_pos (parse_maybe_enum_key p (dsum_enum t)) h input pos in
Unknown? k' /\
(let Unknown r = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
valid g h input pos_payload /\
valid_content_pos (parse_dsum t p f g)
h
input
pos
(synth_dsum_case t (Unknown r) (contents g h input pos_payload))
(get_valid_pos g h input pos_payload))))) | let valid_dsum_elim_unknown
(h: HS.mem)
(t: dsum)
(#kt: parser_kind)
(p: parser kt (dsum_repr_type t))
(f: ((x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x))))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: Lemma
(requires (
valid (parse_dsum t p f g) h input pos /\
Unknown? (dsum_tag_of_data t (contents (parse_dsum t p f g) h input pos))
))
(ensures (
valid (parse_maybe_enum_key p (dsum_enum t)) h input pos /\ (
let k' = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
let pos_payload = get_valid_pos (parse_maybe_enum_key p (dsum_enum t)) h input pos in
Unknown? k' /\ (
let Unknown r = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
valid g h input pos_payload /\
valid_content_pos
(parse_dsum t p f g) h input pos
(synth_dsum_case t (Unknown r) (contents g h input pos_payload))
(get_valid_pos g h input pos_payload)
))))
=
valid_facts (parse_dsum t p f g) h input pos;
parse_dsum_eq t p f g (bytes_of_slice_from h input pos);
valid_facts (parse_maybe_enum_key p (dsum_enum t)) h input pos;
let Unknown r = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
let pos_payload = get_valid_pos (parse_maybe_enum_key p (dsum_enum t)) h input pos in
valid_facts g h input pos_payload | {
"file_name": "src/lowparse/LowParse.Low.Sum.fst",
"git_rev": "00217c4a89f5ba56002ba9aa5b4a9d5903bfe9fa",
"git_url": "https://github.com/project-everest/everparse.git",
"project_name": "everparse"
} | {
"end_col": 35,
"end_line": 1371,
"start_col": 0,
"start_line": 1337
} | module LowParse.Low.Sum
include LowParse.Low.Enum
include LowParse.Spec.Sum
module U32 = FStar.UInt32
module HST = FStar.HyperStack.ST
module B = LowStar.Buffer
module Cast = FStar.Int.Cast
module U64 = FStar.UInt64
inline_for_extraction
let validate_sum_cases_aux
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(vc: ((x: sum_key t) -> Tot (validator (dsnd (pc x)))))
(k: sum_key t)
: Tot (validator (parse_sum_cases t pc k))
= [@inline_let]
let _ = synth_sum_case_injective t k in
validate_synth
(validate_weaken
(weaken_parse_cases_kind t pc)
(vc k)
()
)
(synth_sum_case t k)
()
inline_for_extraction
let validate_sum_cases_t
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot Type
= validator (parse_sum_cases t pc k)
let validate_sum_cases_t_eq
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
(x y : validate_sum_cases_t t pc k)
: GTot Type0
= True
inline_for_extraction
let validate_sum_cases_t_if
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (if_combinator _ (validate_sum_cases_t_eq t pc k))
= fun cond (sv_true: cond_true cond -> Tot (validate_sum_cases_t t pc k)) (sv_false: cond_false cond -> Tot (validate_sum_cases_t t pc k)) #rrel #rel input pos ->
if cond
then sv_true () input pos
else sv_false () input pos
inline_for_extraction
let validate_sum_cases
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(vc: ((x: sum_key t) -> Tot (validator (dsnd (pc x)))))
(destr: dep_enum_destr (sum_enum t) (validate_sum_cases_t t pc))
(k: sum_key t)
: Tot (validator (parse_sum_cases t pc k))
= destr
_
(validate_sum_cases_t_if t pc)
(fun _ _ -> ())
(fun _ _ _ _ -> ())
(validate_sum_cases_aux t pc vc)
k
inline_for_extraction
let validate_sum_aux_payload_t
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
: Tot Type
= (#rrel: _) -> (#rel: _) ->
(input: slice rrel rel) ->
(pos: U64.t) ->
HST.Stack U64.t
(requires (fun h -> live_slice h input /\ U64.v pos <= U32.v input.len))
(ensures (fun h res h' ->
B.modifies B.loc_none h h' /\ (
match k with
| Unknown _ -> is_error res
| Known k' ->
if is_success res
then
valid_pos (dsnd (pc k')) h input (uint64_to_uint32 pos) (uint64_to_uint32 res)
else
(~ (valid (dsnd (pc k')) h input (uint64_to_uint32 pos)))
)))
let validate_sum_aux_payload_eq
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
: Tot (validate_sum_aux_payload_t t pc k -> validate_sum_aux_payload_t t pc k -> GTot Type0)
= fun _ _ -> True
inline_for_extraction
let validate_sum_aux_payload_if'
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
(cond: bool)
(ift: ((cond_true cond) -> Tot (validate_sum_aux_payload_t t pc k)))
(iff: ((cond_false cond) -> Tot (validate_sum_aux_payload_t t pc k)))
: Tot (validate_sum_aux_payload_t t pc k)
= fun #rrel #rel input pos ->
if cond
then begin
(ift () <: validate_sum_aux_payload_t t pc k) input pos
end else
(iff () <: validate_sum_aux_payload_t t pc k) input pos
inline_for_extraction
let validate_sum_aux_payload_if
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
: Tot (if_combinator _ (validate_sum_aux_payload_eq t pc k))
= validate_sum_aux_payload_if' t pc k
#push-options "--z3rlimit 64 --z3cliopt smt.arith.nl=false --using_facts_from '* -FStar.Int.Cast -LowParse.BitFields'"
// --query_stats --smtencoding.elim_box true --smtencoding.l_arith_repr native --z3refresh"
inline_for_extraction
let validate_sum_aux
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(v: validator p)
(p32: leaf_reader p)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(v_payload: ((k: sum_repr_type t)) -> Tot (validate_sum_aux_payload_t t pc (maybe_enum_key_of_repr (sum_enum t) k)))
: Tot (validator (parse_sum t p pc))
= fun #rrel #rel input pos ->
let h = HST.get () in
[@inline_let]
let _ = parse_sum_eq'' t p pc (bytes_of_slice_from h input (uint64_to_uint32 pos)) in
[@inline_let]
let _ = valid_facts (parse_sum t p pc) h input (uint64_to_uint32 pos) in
[@inline_let]
let _ = valid_facts p h input (uint64_to_uint32 pos) in
let len_after_tag = v input pos in
if is_error len_after_tag
then len_after_tag
else begin
let h1 = HST.get () in
let k' = p32 input (uint64_to_uint32 pos) in
[@inline_let]
let _ =
match maybe_enum_key_of_repr (sum_enum t) k' with
| Known k -> valid_facts (dsnd (pc k)) h input (uint64_to_uint32 len_after_tag)
| _ -> ()
in
v_payload k' input len_after_tag
end
#pop-options
inline_for_extraction
let validate_sum_aux_payload'
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (validator (dsnd (pc x)))))
(k: maybe_enum_key (sum_enum t))
: Tot (validate_sum_aux_payload_t t pc k)
= fun #rrel #rel input pos ->
match k with
| Known k ->
[@inline_let]
let _ = synth_sum_case_injective t k in
pc32 k input pos
// validate_synth (pc32 k) (synth_sum_case t k) () input pos
| _ -> validator_error_generic
inline_for_extraction
let validate_sum_aux_payload
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (validator (dsnd (pc x)))))
(destr: dep_maybe_enum_destr_t (sum_enum t) (validate_sum_aux_payload_t t pc))
(k: sum_repr_type t)
: Tot (validate_sum_aux_payload_t t pc (maybe_enum_key_of_repr (sum_enum t) k))
= destr (validate_sum_aux_payload_eq t pc) (validate_sum_aux_payload_if t pc) (fun _ _ -> ()) (fun _ _ _ _ -> ()) (validate_sum_aux_payload' t pc pc32) k
inline_for_extraction
let validate_sum
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(v: validator p)
(p32: leaf_reader p)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (validator (dsnd (pc x)))))
(destr: dep_maybe_enum_destr_t (sum_enum t) (validate_sum_aux_payload_t t pc))
: Tot (validator (parse_sum t p pc))
= validate_sum_aux t v p32 pc (validate_sum_aux_payload t pc pc32 destr)
module HS = FStar.HyperStack
#push-options "--z3rlimit 256 --z3cliopt smt.arith.nl=false --initial_ifuel 8 --max_ifuel 8 --initial_fuel 2 --max_fuel 2"
#restart-solver
let valid_sum_intro
(h: HS.mem)
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: Lemma
(requires (
valid (parse_enum_key p (sum_enum t)) h input pos /\ (
let k = contents (parse_enum_key p (sum_enum t)) h input pos in
valid (dsnd (pc k)) h input (get_valid_pos (parse_enum_key p (sum_enum t)) h input pos)
)))
(ensures (
let k = contents (parse_enum_key p (sum_enum t)) h input pos in
let pos_payload = get_valid_pos (parse_enum_key p (sum_enum t)) h input pos in
valid_content_pos
(parse_sum t p pc) h input pos
(synth_sum_case t k (contents (dsnd (pc k)) h input pos_payload))
(get_valid_pos (dsnd (pc k)) h input pos_payload)
))
= valid_facts (parse_enum_key p (sum_enum t)) h input pos;
let k = contents (parse_enum_key p (sum_enum t)) h input pos in
let pos_payload = get_valid_pos (parse_enum_key p (sum_enum t)) h input pos in
valid_facts (dsnd (pc k)) h input pos_payload;
valid_facts (parse_sum t p pc) h input pos;
parse_sum_eq t p pc (bytes_of_slice_from h input pos)
#pop-options
inline_for_extraction
let finalize_sum_case
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(s: serializer p)
(w: leaf_writer_strong s)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(destr: enum_repr_of_key'_t (sum_enum t))
(k: sum_key t)
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: HST.Stack unit
(requires (fun h ->
let len_tag = serialized_length (serialize_enum_key _ s (sum_enum t)) k in
U32.v pos + len_tag < 4294967296 /\ (
let pos_payload = pos `U32.add` U32.uint_to_t len_tag in
valid (dsnd (pc k)) h input pos_payload /\
writable input.base (U32.v pos) (U32.v pos_payload) h
)))
(ensures (fun h _ h' ->
let len_tag = serialized_length (serialize_enum_key _ s (sum_enum t)) k in
let pos_payload = pos `U32.add` U32.uint_to_t len_tag in
B.modifies (loc_slice_from_to input pos pos_payload) h h' /\
valid_content_pos (parse_sum t p pc) h' input pos (synth_sum_case t k (contents (dsnd (pc k)) h input pos_payload)) (get_valid_pos (dsnd (pc k)) h input pos_payload)
))
= let pos1 = write_enum_key w (sum_enum t) destr k input pos in
let h = HST.get () in
[@inline_let]
let _ = valid_sum_intro h t p pc input pos in
()
inline_for_extraction
let jump_sum_cases_aux
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(vc: ((x: sum_key t) -> Tot (jumper (dsnd (pc x)))))
(k: sum_key t)
: Tot (jumper (parse_sum_cases t pc k))
= [@inline_let]
let _ = synth_sum_case_injective t k in
jump_synth
(jump_weaken
(weaken_parse_cases_kind t pc)
(vc k)
()
)
(synth_sum_case t k)
()
inline_for_extraction
let jump_sum_cases_t
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot Type
= jumper (parse_sum_cases t pc k)
let jump_sum_cases_t_eq
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
(x y : jump_sum_cases_t t pc k)
: GTot Type0
= True
inline_for_extraction
let jump_sum_cases_t_if
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (if_combinator _ (jump_sum_cases_t_eq t pc k))
= fun cond (sv_true: cond_true cond -> Tot (jump_sum_cases_t t pc k)) (sv_false: cond_false cond -> Tot (jump_sum_cases_t t pc k)) #rrel #rel input pos ->
if cond
then sv_true () input pos
else sv_false () input pos
inline_for_extraction
let jump_sum_cases
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(vc: ((x: sum_key t) -> Tot (jumper (dsnd (pc x)))))
(destr: dep_enum_destr (sum_enum t) (jump_sum_cases_t t pc))
(k: sum_key t)
: Tot (jumper (parse_sum_cases t pc k))
= destr
_
(jump_sum_cases_t_if t pc)
(fun _ _ -> ())
(fun _ _ _ _ -> ())
(jump_sum_cases_aux t pc vc)
k
inline_for_extraction
let jump_sum_aux_payload_t
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
: Tot Type
= (#rrel: _) -> (#rel: _) ->
(input: slice rrel rel) ->
(pos: U32.t) ->
HST.Stack U32.t
(requires (fun h -> live_slice h input /\ U32.v pos <= U32.v input.len /\ (
match k with
| Unknown _ -> False
| Known k' -> valid (dsnd (pc k')) h input pos
)))
(ensures (fun h res h' ->
B.modifies B.loc_none h h' /\ (
match k with
| Unknown _ -> False
| Known k' ->
valid_pos (dsnd (pc k')) h input pos res
)))
let jump_sum_aux_payload_eq
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
: Tot (jump_sum_aux_payload_t t pc k -> jump_sum_aux_payload_t t pc k -> GTot Type0)
= fun _ _ -> True
inline_for_extraction
let jump_sum_aux_payload_if'
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
(cond: bool)
(ift: ((cond_true cond) -> Tot (jump_sum_aux_payload_t t pc k)))
(iff: ((cond_false cond) -> Tot (jump_sum_aux_payload_t t pc k)))
: Tot (jump_sum_aux_payload_t t pc k)
= fun #rrel #rel input pos ->
if cond
then begin
(ift () <: jump_sum_aux_payload_t t pc k) input pos
end else
(iff () <: jump_sum_aux_payload_t t pc k) input pos
inline_for_extraction
let jump_sum_aux_payload_if
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
: Tot (if_combinator _ (jump_sum_aux_payload_eq t pc k))
= jump_sum_aux_payload_if' t pc k
let parse_sum_eq3
(#kt: parser_kind)
(t: sum)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(input: bytes)
(k' : sum_repr_type t)
(consumed_k: consumed_length input)
: Lemma
(requires (Some? (parse (parse_sum t p pc) input) /\ parse p input == Some (k', consumed_k)))
(ensures (
let input_k = Seq.slice input consumed_k (Seq.length input) in
let k = maybe_enum_key_of_repr (sum_enum t) k' in
begin match k with
| Known k ->
Some? (parse (dsnd (pc k)) input_k)
| _ -> False
end
))
= parse_sum_eq'' t p pc input
let parse_sum_eq4
(#kt: parser_kind)
(t: sum)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(input: bytes)
(k' : sum_repr_type t)
(consumed_k: consumed_length input)
(consumed_payload: nat)
: Lemma
(requires (Some? (parse (parse_sum t p pc) input) /\ parse p input == Some (k', consumed_k) /\ (
let input_k = Seq.slice input consumed_k (Seq.length input) in
let k = maybe_enum_key_of_repr (sum_enum t) k' in
begin match k with
| Known k ->
Some? (parse (dsnd (pc k)) input_k) /\ (
let Some (_, consumed_payload') = parse (dsnd (pc k)) input_k in
consumed_payload' == consumed_payload
)
| _ -> False
end
)))
(ensures (
let Some (_, consumed) = parse (parse_sum t p pc) input in
consumed == consumed_k + consumed_payload
))
= parse_sum_eq'' t p pc input
#push-options "--z3rlimit 16"
let valid_sum_elim
(h: HS.mem)
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(#rrel: _) (#rel: _)
(input: slice rrel rel)
(pos: U32.t)
: Lemma
(requires (
valid (parse_sum t p pc) h input pos
))
(ensures (
valid p h input pos /\ (
let pos_payload = get_valid_pos p h input pos in
let k' = maybe_enum_key_of_repr (sum_enum t) (contents p h input pos) in
match k' with
| Known k ->
k == sum_tag_of_data t (contents (parse_sum t p pc) h input pos) /\
valid (dsnd (pc k)) h input pos_payload /\
valid_pos
(parse_sum t p pc) h input pos
(get_valid_pos (dsnd (pc k)) h input pos_payload)
| _ -> False
)))
= let sinput = bytes_of_slice_from h input pos in
let _ = parse_sum_eq'' t p pc sinput in
[@inline_let]
let _ = valid_facts (parse_sum t p pc) h input pos in
let Some (k', consumed_k) = parse p sinput in
let pos_after_tag = U32.uint_to_t (U32.v pos + consumed_k) in
[@inline_let]
let _ = valid_facts p h input pos in
assert (valid_content_pos p h input pos k' pos_after_tag);
match maybe_enum_key_of_repr (sum_enum t) k' with
| Known k -> valid_facts (dsnd (pc k)) h input pos_after_tag
| _ -> ()
#pop-options
let valid_sum_elim_tag
(h: HS.mem)
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: Lemma
(requires (
valid (parse_sum t p pc) h input pos
))
(ensures (
valid (parse_enum_key p (sum_enum t)) h input pos /\
contents (parse_enum_key p (sum_enum t)) h input pos == sum_tag_of_data t (contents (parse_sum t p pc) h input pos)
))
= let _ = parse_sum_eq' t p pc (bytes_of_slice_from h input pos) in
let _ = valid_facts (parse_sum t p pc) h input pos in
let _ = valid_facts (parse_enum_key p (sum_enum t)) h input pos in
()
inline_for_extraction
let read_sum_tag
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(p32: leaf_reader p)
(destr: dep_maybe_enum_destr_t (sum_enum t) (read_enum_key_t (sum_enum t)))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: HST.Stack (sum_key t)
(requires (fun h ->
valid (parse_sum t p pc) h input pos
))
(ensures (fun h res h' ->
B.modifies B.loc_none h h' /\
res == sum_tag_of_data t (contents (parse_sum t p pc) h input pos)
))
= let h = HST.get () in
[@inline_let] let _ = valid_sum_elim_tag h t p pc input pos in
read_enum_key p32 (sum_enum t) destr input pos
inline_for_extraction
let jump_sum_aux
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(v: jumper p)
(p32: leaf_reader p)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(v_payload: ((k: sum_repr_type t)) -> Tot (jump_sum_aux_payload_t t pc (maybe_enum_key_of_repr (sum_enum t) k)))
: Tot (jumper (parse_sum t p pc))
= fun #rrel #rel input pos ->
let h = HST.get () in
[@inline_let]
let _ = valid_sum_elim h t p pc input pos in
let pos_after_tag = v input pos in
let k' = p32 input pos in
v_payload k' input pos_after_tag
inline_for_extraction
let jump_sum_aux_payload'
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (jumper (dsnd (pc x)))))
(k: maybe_enum_key (sum_enum t))
: Tot (jump_sum_aux_payload_t t pc k)
= fun #rrel #rel input pos ->
match k with
| Known k ->
[@inline_let]
let _ = synth_sum_case_injective t k in
pc32 k input pos
| _ -> 0ul // dummy, but we MUST NOT remove this branch, otherwise extraction fails
inline_for_extraction
let jump_sum_aux_payload
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (jumper (dsnd (pc x)))))
(destr: dep_maybe_enum_destr_t (sum_enum t) (jump_sum_aux_payload_t t pc))
(k: sum_repr_type t)
: Tot (jump_sum_aux_payload_t t pc (maybe_enum_key_of_repr (sum_enum t) k))
= destr (jump_sum_aux_payload_eq t pc) (jump_sum_aux_payload_if t pc) (fun _ _ -> ()) (fun _ _ _ _ -> ()) (jump_sum_aux_payload' t pc pc32) k
inline_for_extraction
let jump_sum
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(v: jumper p)
(p32: leaf_reader p)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (jumper (dsnd (pc x)))))
(destr: dep_maybe_enum_destr_t (sum_enum t) (jump_sum_aux_payload_t t pc))
: Tot (jumper (parse_sum t p pc))
= jump_sum_aux t v p32 pc (jump_sum_aux_payload t pc pc32 destr)
inline_for_extraction
let read_sum_cases'
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (leaf_reader (dsnd (pc x)))))
(k: sum_key t)
: Tot (leaf_reader (parse_sum_cases' t pc k))
= [@inline_let]
let _ = synth_sum_case_injective t k in
read_synth'
(dsnd (pc k))
(synth_sum_case t k)
(pc32 k)
()
inline_for_extraction
let read_sum_cases_t
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot Type
= leaf_reader (parse_sum_cases' t pc k)
let read_sum_cases_t_eq
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
(x y : read_sum_cases_t t pc k)
: GTot Type0
= True
inline_for_extraction
let read_sum_cases_t_if
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (if_combinator _ (read_sum_cases_t_eq t pc k))
= fun cond (sv_true: cond_true cond -> Tot (read_sum_cases_t t pc k)) (sv_false: cond_false cond -> Tot (read_sum_cases_t t pc k)) #_ #_ input pos ->
if cond
then (sv_true () input pos)
else (sv_false () input pos)
inline_for_extraction
let read_sum_cases
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (leaf_reader (dsnd (pc x)))))
(destr: dep_enum_destr (sum_enum t) (read_sum_cases_t t pc))
(k: sum_key t)
: Tot (leaf_reader (parse_sum_cases' t pc k))
= destr
_
(read_sum_cases_t_if t pc)
(fun _ _ -> ())
(fun _ _ _ _ -> ())
(read_sum_cases' t pc pc32)
k
#push-options "--z3rlimit 32"
inline_for_extraction
let read_sum
(#kt: parser_kind)
(t: sum)
(p: parser kt (sum_repr_type t))
(p32: leaf_reader (parse_enum_key p (sum_enum t)))
(j: jumper p)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (leaf_reader (dsnd (pc x)))))
(destr: dep_enum_destr (sum_enum t) (read_sum_cases_t t pc))
: Tot (leaf_reader (parse_sum t p pc))
=
fun #_ #_ input pos ->
let h = HST.get () in
valid_facts (parse_sum t p pc) h input pos;
parse_sum_eq' t p pc (bytes_of_slice_from h input pos);
valid_facts (parse_enum_key p (sum_enum t)) h input pos;
let k = p32 input pos in
let pos' = jump_enum_key j (sum_enum t) input pos in
valid_facts (parse_sum_cases' t pc k) h input pos' ;
read_sum_cases t pc pc32 destr k input pos'
#pop-options
inline_for_extraction
let serialize32_sum_cases_t
(t: sum)
(#pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(sc: ((x: sum_key t) -> Tot (serializer (dsnd (pc x)))))
(k: sum_key t)
: Tot Type
= serializer32 (serialize_sum_cases t pc sc k)
let serialize32_sum_cases_t_eq
(t: sum)
(#pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(sc: ((x: sum_key t) -> Tot (serializer (dsnd (pc x)))))
(k: sum_key t)
(x y: serialize32_sum_cases_t t sc k)
: GTot Type0
= True
inline_for_extraction
let serialize32_sum_cases_t_if
(t: sum)
(#pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(sc: ((x: sum_key t) -> Tot (serializer (dsnd (pc x)))))
(k: sum_key t)
: Tot (if_combinator _ (serialize32_sum_cases_t_eq t sc k))
= fun cond (sv_true: (cond_true cond -> Tot (serialize32_sum_cases_t t sc k))) (sv_false: (cond_false cond -> Tot (serialize32_sum_cases_t t sc k))) x #rrel #rel b pos ->
if cond
then (sv_true () x b pos)
else (sv_false () x b pos)
inline_for_extraction
let serialize32_sum_cases_aux
(t: sum)
(#pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(sc: ((x: sum_key t) -> Tot (serializer (dsnd (pc x)))))
(sc32: ((x: sum_key t) -> Tot (serializer32 (sc x))))
(k: sum_key t)
: Tot (serializer32 (serialize_sum_cases t pc sc k))
= fun x #rrel #rel b pos ->
[@inline_let] let _ =
Classical.forall_intro (parse_sum_cases_eq' t pc k);
synth_sum_case_injective t k;
synth_sum_case_inverse t k
in
serialize32_synth
(sc32 k)
(synth_sum_case t k)
(synth_sum_case_recip t k)
(fun x -> synth_sum_case_recip t k x)
()
x
b
pos
inline_for_extraction
let serialize32_sum_cases
(t: sum)
(#pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(sc: ((x: sum_key t) -> Tot (serializer (dsnd (pc x)))))
(sc32: ((x: sum_key t) -> Tot (serializer32 (sc x))))
(destr: dep_enum_destr (sum_enum t) (serialize32_sum_cases_t t sc))
(k: sum_key t)
: Tot (serializer32 (serialize_sum_cases t pc sc k))
= destr
_
(serialize32_sum_cases_t_if t sc)
(fun _ _ -> ())
(fun _ _ _ _ -> ())
(serialize32_sum_cases_aux t sc sc32)
k
inline_for_extraction
let serialize32_sum
(#kt: parser_kind)
(t: sum)
(#p: parser kt (sum_repr_type t))
(s: serializer p {kt.parser_kind_subkind == Some ParserStrong})
(s32: serializer32 (serialize_enum_key _ s (sum_enum t)))
(#pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(sc: ((x: sum_key t) -> Tot (serializer (dsnd (pc x)))))
(sc32: ((x: sum_key t) -> Tot (serializer32 (sc x))))
(destr: dep_enum_destr (sum_enum t) (serialize32_sum_cases_t t sc))
: Tot (serializer32 (serialize_sum t s sc))
= fun x #rrel #rel b pos ->
serialize_sum_eq t s sc x;
let tg = sum_tag_of_data t x in
serialize32_nondep_then_aux s32 (serialize32_sum_cases t sc sc32 destr tg) tg x b pos
let clens_sum_tag
(s: sum)
: Tot (clens (sum_type s) (sum_key s))
= {
clens_cond = (fun _ -> True);
clens_get = sum_tag_of_data s;
}
let gaccessor_sum_tag
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
: Tot (gaccessor (parse_sum t p pc) (parse_enum_key p (sum_enum t)) (clens_sum_tag t))
= gaccessor_tagged_union_tag
(parse_enum_key p (sum_enum t))
(sum_tag_of_data t)
(parse_sum_cases t pc)
inline_for_extraction
let accessor_sum_tag
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
: Tot (accessor (gaccessor_sum_tag t p pc))
= accessor_tagged_union_tag
(parse_enum_key p (sum_enum t))
(sum_tag_of_data t)
(parse_sum_cases t pc)
let clens_sum_payload
(s: sum)
(k: sum_key s)
: Tot (clens (sum_type s) (sum_type_of_tag s k))
= {
clens_cond = (fun (x: sum_type s) -> sum_tag_of_data s x == k);
clens_get = (fun (x: sum_type s) -> synth_sum_case_recip s k x <: Ghost (sum_type_of_tag s k) (requires (sum_tag_of_data s x == k)) (ensures (fun _ -> True)));
}
#push-options "--z3rlimit 32"
let gaccessor_clens_sum_payload'
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (gaccessor' (parse_sum t p pc) (dsnd (pc k)) (clens_sum_payload t k))
= fun (input: bytes) ->
parse_sum_eq'' t p pc input;
let res =
match parse p input with
| Some (_, consumed) ->
synth_sum_case_inverse t k;
synth_sum_case_injective t k;
synth_injective_synth_inverse_synth_inverse_recip (synth_sum_case t k) (synth_sum_case_recip t k) ();
(consumed)
| _ -> 0 // dummy
in
(res <: (res: _ { gaccessor_post' (parse_sum t p pc) (dsnd (pc k)) (clens_sum_payload t k) input res } ))
#push-options "--z3rlimit 64"
let gaccessor_clens_sum_payload_injective
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
(sl sl' : bytes)
: Lemma
(requires (
gaccessor_pre (parse_sum t p pc) (dsnd (pc k)) (clens_sum_payload t k) sl /\
gaccessor_pre (parse_sum t p pc) (dsnd (pc k)) (clens_sum_payload t k) sl' /\
injective_precond (parse_sum t p pc) sl sl'
))
(ensures (gaccessor_clens_sum_payload' t p pc k sl == gaccessor_clens_sum_payload' t p pc k sl'))
= parse_sum_eq'' t p pc sl;
parse_sum_eq'' t p pc sl' ;
parse_injective (parse_sum t p pc) sl sl' ;
parse_injective p sl sl'
#pop-options
let gaccessor_clens_sum_payload_no_lookahead
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
(sl sl' : bytes)
: Lemma
(requires (
(parse_sum_kind kt t pc).parser_kind_subkind == Some ParserStrong /\
gaccessor_pre (parse_sum t p pc) (dsnd (pc k)) (clens_sum_payload t k) sl /\
gaccessor_pre (parse_sum t p pc) (dsnd (pc k)) (clens_sum_payload t k) sl' /\
no_lookahead_on_precond (parse_sum t p pc) sl sl'
))
(ensures (gaccessor_clens_sum_payload' t p pc k sl == gaccessor_clens_sum_payload' t p pc k sl'))
= parse_sum_eq'' t p pc sl;
parse_sum_eq'' t p pc sl' ;
parse_strong_prefix (parse_sum t p pc) sl sl' ;
parse_injective p sl sl'
let gaccessor_clens_sum_payload
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (gaccessor (parse_sum t p pc) (dsnd (pc k)) (clens_sum_payload t k))
= Classical.forall_intro_2 (fun x -> Classical.move_requires (gaccessor_clens_sum_payload_injective t p pc k x));
Classical.forall_intro_2 (fun x -> Classical.move_requires (gaccessor_clens_sum_payload_no_lookahead t p pc k x));
gaccessor_prop_equiv (parse_sum t p pc) (dsnd (pc k)) (clens_sum_payload t k) (gaccessor_clens_sum_payload' t p pc k);
gaccessor_clens_sum_payload' t p pc k
inline_for_extraction
let accessor_clens_sum_payload'
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(j: jumper p)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: HST.Stack U32.t
(requires (fun h ->
valid (parse_sum t p pc) h input pos /\
(clens_sum_payload t k).clens_cond (contents (parse_sum t p pc) h input pos)
))
(ensures (fun h pos' h' ->
B.modifies B.loc_none h h' /\
pos' == slice_access h (gaccessor_clens_sum_payload t p pc k) input pos
))
=
let h = HST.get () in
[@inline_let]
let _ =
let pos' = get_valid_pos (parse_sum t p pc) h input pos in
let large = bytes_of_slice_from h input pos in
slice_access_eq h (gaccessor_clens_sum_payload t p pc k) input pos;
valid_facts (parse_sum t p pc) h input pos;
parse_sum_eq'' t p pc large;
valid_facts p h input pos
in
j input pos
#pop-options
inline_for_extraction
let accessor_clens_sum_payload
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(j: jumper p)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (accessor (gaccessor_clens_sum_payload t p pc k))
= fun #rrel #rel -> accessor_clens_sum_payload' t j pc k #rrel #rel
let clens_sum_cases_payload
(s: sum)
(k: sum_key s)
: Tot (clens (sum_cases s k) (sum_type_of_tag s k))
= {
clens_cond = (fun (x: sum_cases s k) -> True);
clens_get = (fun (x: sum_cases s k) -> synth_sum_case_recip s k x <: Ghost (sum_type_of_tag s k) (requires (True)) (ensures (fun _ -> True)));
}
let gaccessor_clens_sum_cases_payload
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (gaccessor (parse_sum_cases' t pc k) (dsnd (pc k)) (clens_sum_cases_payload t k))
= synth_sum_case_injective t k;
synth_sum_case_inverse t k;
synth_injective_synth_inverse_synth_inverse_recip (synth_sum_case t k) (synth_sum_case_recip t k) ();
gaccessor_ext
(gaccessor_synth (dsnd (pc k)) (synth_sum_case t k) (synth_sum_case_recip t k) ())
(clens_sum_cases_payload t k)
()
inline_for_extraction
let accessor_clens_sum_cases_payload
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (accessor (gaccessor_clens_sum_cases_payload t pc k))
= [@inline_let]
let _ =
synth_sum_case_injective t k;
synth_sum_case_inverse t k;
synth_injective_synth_inverse_synth_inverse_recip (synth_sum_case t k) (synth_sum_case_recip t k) ()
in
accessor_ext
(accessor_synth (dsnd (pc k)) (synth_sum_case t k) (synth_sum_case_recip t k) ())
(clens_sum_cases_payload t k)
()
inline_for_extraction
let validate_dsum_cases_t
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(#k: parser_kind)
(g: parser k (dsum_type_of_unknown_tag s))
(x: dsum_key s)
: Tot Type
= validator (parse_dsum_cases' s f g x)
let validate_dsum_cases_eq
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(#k: parser_kind)
(g: parser k (dsum_type_of_unknown_tag s))
(x: dsum_key s)
(v1 v2 : validate_dsum_cases_t s f g x)
: GTot Type0
= True
inline_for_extraction
let validate_dsum_cases_if'
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(#k: parser_kind)
(g: parser k (dsum_type_of_unknown_tag s))
(x: dsum_key s)
(cond: bool)
(ift: (cond_true cond -> Tot (validate_dsum_cases_t s f g x)))
(iff: (cond_false cond -> Tot (validate_dsum_cases_t s f g x)))
: Tot (validate_dsum_cases_t s f g x)
= fun #rrel #rel input len ->
if cond
then (ift () <: validate_dsum_cases_t s f g x) input len
else (iff () <: validate_dsum_cases_t s f g x) input len
inline_for_extraction
let validate_dsum_cases_if
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(#k: parser_kind)
(g: parser k (dsum_type_of_unknown_tag s))
(x: dsum_key s)
: Tot (if_combinator _ (validate_dsum_cases_eq s f g x))
= validate_dsum_cases_if' s f g x
inline_for_extraction
let validate_dsum_cases'
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(f' : (x: dsum_known_key s) -> Tot (validator (dsnd (f x))))
(#k: parser_kind)
(#g: parser k (dsum_type_of_unknown_tag s))
(g' : validator g)
(x: dsum_key s)
: Tot (validate_dsum_cases_t s f g x)
= [@inline_let]
let _ = synth_dsum_case_injective s x in
match x with
| Known x' -> validate_synth (f' x') (synth_dsum_case s (Known x')) () <: validator (parse_dsum_cases' s f g x)
| Unknown x' -> validate_synth g' (synth_dsum_case s (Unknown x')) () <: validator (parse_dsum_cases' s f g x)
inline_for_extraction
let validate_dsum_cases'_destr
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(f' : (x: dsum_known_key s) -> Tot (validator (dsnd (f x))))
(#k: parser_kind)
(#g: parser k (dsum_type_of_unknown_tag s))
(g' : validator g)
(destr: dep_enum_destr _ (fun k -> validate_dsum_cases_t s f g (Known k)))
(x: dsum_key s)
: Tot (validate_dsum_cases_t s f g x)
= fun #rrel #rel input pos ->
match x with
| Known k ->
destr
_
(fun k -> validate_dsum_cases_if s f g (Known k))
(fun _ _ -> ())
(fun _ _ _ _ -> ())
(fun k -> validate_dsum_cases' s f f' g' (Known k))
k
input
pos
| Unknown r -> validate_dsum_cases' s f f' g' (Unknown r) input pos
inline_for_extraction
let validate_dsum_cases
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(f' : (x: dsum_known_key s) -> Tot (validator (dsnd (f x))))
(#k: parser_kind)
(#g: parser k (dsum_type_of_unknown_tag s))
(g' : validator g)
(destr: dep_enum_destr _ (fun k -> validate_dsum_cases_t s f g (Known k)))
(x: dsum_key s)
: Tot (validator (parse_dsum_cases s f g x))
= fun #rrel #rel input pos ->
let h = HST.get () in
[@inline_let]
let _ =
valid_facts (parse_dsum_cases' s f g x) h input (uint64_to_uint32 pos);
valid_facts (parse_dsum_cases s f g x) h input (uint64_to_uint32 pos);
parse_dsum_cases_eq' s f g x (bytes_of_slice_from h input (uint64_to_uint32 pos))
in
validate_dsum_cases'_destr s f f' g' destr x input pos
#push-options "--z3rlimit 40"
inline_for_extraction
let validate_dsum
(#kt: parser_kind)
(t: dsum)
(#p: parser kt (dsum_repr_type t))
(v: validator p)
(p32: leaf_reader p)
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(f32: (x: dsum_known_key t) -> Tot (validator (dsnd (f x))))
(#k': parser_kind)
(#g: parser k' (dsum_type_of_unknown_tag t))
(g32: validator g)
(destr: dep_maybe_enum_destr_t (dsum_enum t) (validate_dsum_cases_t t f g))
: Tot (validator (parse_dsum t p f g))
= fun #rrel #rel input pos ->
let h = HST.get () in
[@inline_let]
let _ = parse_dsum_eq' t p f g (bytes_of_slice_from h input (uint64_to_uint32 pos)) in
[@inline_let]
let _ = valid_facts (parse_dsum t p f g) h input (uint64_to_uint32 pos) in
[@inline_let]
let _ = valid_facts p h input (uint64_to_uint32 pos) in
let pos_after_tag = v input pos in
if is_error pos_after_tag
then pos_after_tag
else
let tg = p32 input (uint64_to_uint32 pos) in
[@inline_let]
let _ = valid_facts (parse_dsum_cases' t f g (maybe_enum_key_of_repr (dsum_enum t) tg)) h input (uint64_to_uint32 pos_after_tag) in
destr (validate_dsum_cases_eq t f g) (validate_dsum_cases_if t f g) (fun _ _ -> ()) (fun _ _ _ _ -> ()) (validate_dsum_cases' t f f32 g32) tg input pos_after_tag
#pop-options
#reset-options "--z3rlimit 64 --z3cliopt smt.arith.nl=false --initial_ifuel 8 --max_ifuel 8 --initial_fuel 2 --max_fuel 2"
let valid_dsum_intro_known
(h: HS.mem)
(t: dsum)
(#kt: parser_kind)
(p: parser kt (dsum_repr_type t))
(f: ((x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x))))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: Lemma
(requires (
valid (parse_maybe_enum_key p (dsum_enum t)) h input pos /\ (
let k' = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
Known? k' /\ (
let Known k = k' in
valid (dsnd (f k)) h input (get_valid_pos (parse_maybe_enum_key p (dsum_enum t)) h input pos)
))))
(ensures (
let Known k = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
let pos_payload = get_valid_pos (parse_maybe_enum_key p (dsum_enum t)) h input pos in
valid_content_pos
(parse_dsum t p f g) h input pos
(synth_dsum_case t (Known k) (contents (dsnd (f k)) h input pos_payload))
(get_valid_pos (dsnd (f k)) h input pos_payload)
))
= valid_facts (parse_maybe_enum_key p (dsum_enum t)) h input pos;
let Known k = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
let pos_payload = get_valid_pos (parse_maybe_enum_key p (dsum_enum t)) h input pos in
valid_facts (dsnd (f k)) h input pos_payload;
valid_facts (parse_dsum t p f g) h input pos;
parse_dsum_eq t p f g (bytes_of_slice_from h input pos)
let valid_dsum_intro_unknown
(h: HS.mem)
(t: dsum)
(#kt: parser_kind)
(p: parser kt (dsum_repr_type t))
(f: ((x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x))))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: Lemma
(requires (
valid (parse_maybe_enum_key p (dsum_enum t)) h input pos /\ (
let k' = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
Unknown? k' /\
valid g h input (get_valid_pos (parse_maybe_enum_key p (dsum_enum t)) h input pos)
)))
(ensures (
let Unknown r = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
let pos_payload = get_valid_pos (parse_maybe_enum_key p (dsum_enum t)) h input pos in
valid_content_pos
(parse_dsum t p f g) h input pos
(synth_dsum_case t (Unknown r) (contents g h input pos_payload))
(get_valid_pos g h input pos_payload)
))
= valid_facts (parse_maybe_enum_key p (dsum_enum t)) h input pos;
let Unknown r = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
let pos_payload = get_valid_pos (parse_maybe_enum_key p (dsum_enum t)) h input pos in
valid_facts g h input pos_payload;
valid_facts (parse_dsum t p f g) h input pos;
parse_dsum_eq t p f g (bytes_of_slice_from h input pos)
#reset-options
inline_for_extraction
let finalize_dsum_case_known
(t: dsum)
(#kt: parser_kind)
(#p: parser kt (dsum_repr_type t))
(s: serializer p)
(w: leaf_writer_strong s)
(f: ((x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x))))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
(destr: enum_repr_of_key'_t (dsum_enum t))
(k: dsum_known_key t)
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: HST.Stack unit
(requires (fun h ->
let len_tag = serialized_length (serialize_enum_key _ s (dsum_enum t)) k in
U32.v pos + len_tag < 4294967296 /\ (
let pos_payload = pos `U32.add` U32.uint_to_t len_tag in
valid (dsnd (f k)) h input pos_payload /\
writable input.base (U32.v pos) (U32.v pos_payload) h
)))
(ensures (fun h _ h' ->
let len_tag = serialized_length (serialize_enum_key _ s (dsum_enum t)) k in
let pos_payload = pos `U32.add` U32.uint_to_t len_tag in
B.modifies (loc_slice_from_to input pos pos_payload) h h' /\
valid_content_pos (parse_dsum t p f g) h' input pos (synth_dsum_case t (Known k) (contents (dsnd (f k)) h input pos_payload)) (get_valid_pos (dsnd (f k)) h input pos_payload)
))
= let pos1 = write_enum_key w (dsum_enum t) destr k input pos in
let h = HST.get () in
[@inline_let]
let _ =
valid_facts (parse_enum_key p (dsum_enum t)) h input pos;
valid_facts (parse_maybe_enum_key p (dsum_enum t)) h input pos;
let sq = bytes_of_slice_from h input pos in
parse_enum_key_eq p (dsum_enum t) sq;
parse_maybe_enum_key_eq p (dsum_enum t) sq;
valid_dsum_intro_known h t p f g input pos
in
()
inline_for_extraction
let finalize_dsum_case_unknown
(t: dsum)
(#kt: parser_kind)
(#p: parser kt (dsum_repr_type t))
(s: serializer p)
(w: leaf_writer_strong s)
(f: ((x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x))))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
(r: unknown_enum_repr (dsum_enum t))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: HST.Stack unit
(requires (fun h ->
let len_tag = serialized_length s r in
U32.v pos + len_tag < 4294967296 /\ (
let pos_payload = pos `U32.add` U32.uint_to_t len_tag in
valid g h input pos_payload /\
writable input.base (U32.v pos) (U32.v pos_payload) h
)))
(ensures (fun h _ h' ->
let len_tag = serialized_length s r in
let pos_payload = pos `U32.add` U32.uint_to_t len_tag in
B.modifies (loc_slice_from_to input pos pos_payload) h h' /\
valid_content_pos (parse_dsum t p f g) h' input pos (synth_dsum_case t (Unknown r) (contents g h input pos_payload)) (get_valid_pos g h input pos_payload)
))
= let pos1 = w r input pos in
let h = HST.get () in
[@inline_let]
let _ =
valid_facts (parse_maybe_enum_key p (dsum_enum t)) h input pos;
valid_facts p h input pos;
let sq = bytes_of_slice_from h input pos in
parse_maybe_enum_key_eq p (dsum_enum t) sq;
valid_dsum_intro_unknown h t p f g input pos
in
()
let valid_dsum_elim_tag
(h: HS.mem)
(t: dsum)
(#kt: parser_kind)
(p: parser kt (dsum_repr_type t))
(f: ((x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x))))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: Lemma
(requires (
valid (parse_dsum t p f g) h input pos
))
(ensures (
valid (parse_maybe_enum_key p (dsum_enum t)) h input pos /\
contents (parse_maybe_enum_key p (dsum_enum t)) h input pos == dsum_tag_of_data t (contents (parse_dsum t p f g) h input pos)
))
= let _ = parse_dsum_eq_ t p f g (bytes_of_slice_from h input pos) in
let _ = valid_facts (parse_dsum t p f g) h input pos in
let _ = valid_facts (parse_maybe_enum_key p (dsum_enum t)) h input pos in
()
inline_for_extraction
let read_dsum_tag
(t: dsum)
(#kt: parser_kind)
(#p: parser kt (dsum_repr_type t))
(p32: leaf_reader p)
(destr: maybe_enum_destr_t (maybe_enum_key (dsum_enum t)) (dsum_enum t))
(f: ((x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x))))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: HST.Stack (dsum_key t)
(requires (fun h ->
valid (parse_dsum t p f g) h input pos
))
(ensures (fun h res h' ->
B.modifies B.loc_none h h' /\
res == dsum_tag_of_data t (contents (parse_dsum t p f g) h input pos)
))
= let h = HST.get () in
[@inline_let] let _ = valid_dsum_elim_tag h t p f g input pos in
read_maybe_enum_key p32 (dsum_enum t) destr input pos
#push-options "--z3rlimit 32"
let valid_dsum_elim_known
(h: HS.mem)
(t: dsum)
(#kt: parser_kind)
(p: parser kt (dsum_repr_type t))
(f: ((x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x))))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: Lemma
(requires (
valid (parse_dsum t p f g) h input pos /\
Known? (dsum_tag_of_data t (contents (parse_dsum t p f g) h input pos))
))
(ensures (
valid (parse_maybe_enum_key p (dsum_enum t)) h input pos /\ (
let k' = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
let pos_payload = get_valid_pos (parse_maybe_enum_key p (dsum_enum t)) h input pos in
Known? k' /\ (
let Known k = k' in
valid (dsnd (f k)) h input pos_payload /\
valid_content_pos
(parse_dsum t p f g) h input pos
(synth_dsum_case t (Known k) (contents (dsnd (f k)) h input pos_payload))
(get_valid_pos (dsnd (f k)) h input pos_payload)
))))
=
valid_facts (parse_dsum t p f g) h input pos;
parse_dsum_eq t p f g (bytes_of_slice_from h input pos);
valid_facts (parse_maybe_enum_key p (dsum_enum t)) h input pos;
let Known k = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
let pos_payload = get_valid_pos (parse_maybe_enum_key p (dsum_enum t)) h input pos in
valid_facts (dsnd (f k)) h input pos_payload
#pop-options | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"LowStar.Buffer.fst.checked",
"LowParse.Spec.Sum.fst.checked",
"LowParse.Low.Enum.fst.checked",
"FStar.UInt64.fsti.checked",
"FStar.UInt32.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Int.Cast.fst.checked",
"FStar.HyperStack.ST.fsti.checked",
"FStar.HyperStack.fst.checked",
"FStar.Classical.fsti.checked"
],
"interface_file": false,
"source_file": "LowParse.Low.Sum.fst"
} | [
{
"abbrev": true,
"full_module": "FStar.HyperStack",
"short_module": "HS"
},
{
"abbrev": true,
"full_module": "FStar.UInt64",
"short_module": "U64"
},
{
"abbrev": true,
"full_module": "FStar.Int.Cast",
"short_module": "Cast"
},
{
"abbrev": true,
"full_module": "LowStar.Buffer",
"short_module": "B"
},
{
"abbrev": true,
"full_module": "FStar.HyperStack.ST",
"short_module": "HST"
},
{
"abbrev": true,
"full_module": "FStar.UInt32",
"short_module": "U32"
},
{
"abbrev": false,
"full_module": "LowParse.Spec.Sum",
"short_module": null
},
{
"abbrev": false,
"full_module": "LowParse.Low.Enum",
"short_module": null
},
{
"abbrev": false,
"full_module": "LowParse.Low",
"short_module": null
},
{
"abbrev": false,
"full_module": "LowParse.Low",
"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",
"short_module": null
}
] | {
"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_elim_box": false,
"smtencoding_l_arith_repr": "boxwrap",
"smtencoding_nl_arith_repr": "boxwrap",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": true,
"z3cliopt": [],
"z3refresh": false,
"z3rlimit": 5,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | false |
h: FStar.Monotonic.HyperStack.mem ->
t: LowParse.Spec.Sum.dsum ->
p: LowParse.Spec.Base.parser kt (LowParse.Spec.Sum.dsum_repr_type t) ->
f:
(x: LowParse.Spec.Sum.dsum_known_key t
-> Prims.dtuple2 LowParse.Spec.Base.parser_kind
(fun k -> LowParse.Spec.Base.parser k (LowParse.Spec.Sum.dsum_type_of_known_tag t x))) ->
g: LowParse.Spec.Base.parser ku (LowParse.Spec.Sum.dsum_type_of_unknown_tag t) ->
input: LowParse.Slice.slice rrel rel ->
pos: FStar.UInt32.t
-> FStar.Pervasives.Lemma
(requires
LowParse.Low.Base.Spec.valid (LowParse.Spec.Sum.parse_dsum t p f g) h input pos /\
Unknown? (LowParse.Spec.Sum.dsum_tag_of_data t
(LowParse.Low.Base.Spec.contents (LowParse.Spec.Sum.parse_dsum t p f g) h input pos)))
(ensures
LowParse.Low.Base.Spec.valid (LowParse.Spec.Enum.parse_maybe_enum_key p
(LowParse.Spec.Sum.dsum_enum t))
h
input
pos /\
(let k' =
LowParse.Low.Base.Spec.contents (LowParse.Spec.Enum.parse_maybe_enum_key p
(LowParse.Spec.Sum.dsum_enum t))
h
input
pos
in
let pos_payload =
LowParse.Low.Base.Spec.get_valid_pos (LowParse.Spec.Enum.parse_maybe_enum_key p
(LowParse.Spec.Sum.dsum_enum t))
h
input
pos
in
Unknown? k' /\
(let _ =
LowParse.Low.Base.Spec.contents (LowParse.Spec.Enum.parse_maybe_enum_key p
(LowParse.Spec.Sum.dsum_enum t))
h
input
pos
in
(let LowParse.Spec.Enum.Unknown #_ #_ #_ r = _ in
LowParse.Low.Base.Spec.valid g h input pos_payload /\
LowParse.Low.Base.Spec.valid_content_pos (LowParse.Spec.Sum.parse_dsum t p f g)
h
input
pos
(LowParse.Spec.Sum.synth_dsum_case t
(LowParse.Spec.Enum.Unknown r)
(LowParse.Low.Base.Spec.contents g h input pos_payload))
(LowParse.Low.Base.Spec.get_valid_pos g h input pos_payload))
<:
Prims.logical))) | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"FStar.Monotonic.HyperStack.mem",
"LowParse.Spec.Sum.dsum",
"LowParse.Spec.Base.parser_kind",
"LowParse.Spec.Base.parser",
"LowParse.Spec.Sum.dsum_repr_type",
"LowParse.Spec.Sum.dsum_known_key",
"Prims.dtuple2",
"LowParse.Spec.Sum.dsum_type_of_known_tag",
"LowParse.Spec.Sum.dsum_type_of_unknown_tag",
"LowParse.Slice.srel",
"LowParse.Bytes.byte",
"LowParse.Slice.slice",
"FStar.UInt32.t",
"LowParse.Spec.Enum.unknown_enum_repr",
"LowParse.Spec.Sum.dsum_key_type",
"LowParse.Spec.Sum.dsum_enum",
"LowParse.Low.Base.Spec.valid_facts",
"LowParse.Low.Base.Spec.get_valid_pos",
"LowParse.Spec.Enum.maybe_enum_key",
"LowParse.Spec.Enum.parse_maybe_enum_key",
"Prims.unit",
"LowParse.Low.Base.Spec.contents",
"LowParse.Spec.Sum.parse_dsum_eq",
"LowParse.Slice.bytes_of_slice_from",
"LowParse.Spec.Sum.parse_dsum_kind",
"LowParse.Spec.Sum.dsum_type",
"LowParse.Spec.Sum.parse_dsum",
"Prims.l_and",
"LowParse.Low.Base.Spec.valid",
"Prims.b2t",
"LowParse.Spec.Enum.uu___is_Unknown",
"LowParse.Spec.Sum.dsum_tag_of_data",
"Prims.squash",
"LowParse.Low.Base.Spec.valid_content_pos",
"LowParse.Spec.Sum.synth_dsum_case",
"LowParse.Spec.Enum.Unknown",
"Prims.logical",
"Prims.Nil",
"FStar.Pervasives.pattern"
] | [] | false | false | true | false | false | let valid_dsum_elim_unknown
(h: HS.mem)
(t: dsum)
(#kt: parser_kind)
(p: parser kt (dsum_repr_type t))
(f: (x: dsum_known_key t -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x))))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: Lemma
(requires
(valid (parse_dsum t p f g) h input pos /\
Unknown? (dsum_tag_of_data t (contents (parse_dsum t p f g) h input pos))))
(ensures
(valid (parse_maybe_enum_key p (dsum_enum t)) h input pos /\
(let k' = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
let pos_payload = get_valid_pos (parse_maybe_enum_key p (dsum_enum t)) h input pos in
Unknown? k' /\
(let Unknown r = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
valid g h input pos_payload /\
valid_content_pos (parse_dsum t p f g)
h
input
pos
(synth_dsum_case t (Unknown r) (contents g h input pos_payload))
(get_valid_pos g h input pos_payload))))) =
| valid_facts (parse_dsum t p f g) h input pos;
parse_dsum_eq t p f g (bytes_of_slice_from h input pos);
valid_facts (parse_maybe_enum_key p (dsum_enum t)) h input pos;
let Unknown r = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
let pos_payload = get_valid_pos (parse_maybe_enum_key p (dsum_enum t)) h input pos in
valid_facts g h input pos_payload | false |
SimplePrintfReify.fst | SimplePrintfReify.sprintf | val sprintf (s: string{normalize_term #bool (Some? (parse_format_string s))})
: Tot (normalize_term (dir_type (Some?.v (parse_format_string s)))) | val sprintf (s: string{normalize_term #bool (Some? (parse_format_string s))})
: Tot (normalize_term (dir_type (Some?.v (parse_format_string s)))) | let sprintf (s:string{normalize_term #bool (Some? (parse_format_string s))})
: Tot (normalize_term (dir_type (Some?.v (parse_format_string s)))) =
string_of_dirs (Some?.v (parse_format_string s)) (fun s -> s) | {
"file_name": "examples/printf/SimplePrintfReify.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 63,
"end_line": 145,
"start_col": 0,
"start_line": 143
} | (*
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 agreed to in writing, software
distributed under the License is distributed on an "AS IS" BASIS,
WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
See the License for the specific language governing permissions and
limitations under the License.
*)
module SimplePrintfReify
open FStar.Char
open FStar.String
module List = FStar.List.Tot
// A variant of SimplePrintf that uses reify on the Ex implementation
// of parse_format
// For a start here's an alpha renamed version of Ex to avoid clashes
// with the prims variant of Ex (which is not defined using dm4free
// and is not marked as `total`)
(* The underlying representation type *)
let ex (a:Type) = unit -> M (option a)
(* Monad definition *)
val return_ex : (a:Type) -> (x:a) -> Tot (ex a)
let return_ex a x = fun _ -> Some x
val bind_ex : (a:Type) -> (b:Type) -> (f:ex a) -> (g:a -> Tot (ex b)) -> Tot (ex b)
let bind_ex a b f g = fun _ ->
let r = f () in
match r with
| None -> None
| Some x -> g x ()
(* DMFF does not support yet polymorphic actions *)
(* Returning something in [False] allow to derive the usual raise below *)
let raise_ex (_:exn) : Tot (ex False) = fun _ -> None
(* Define the new effect using DM4F *)
total reifiable reflectable new_effect {
XEXN : (a:Type) -> Effect
with repr = ex
; bind = bind_ex
; return = return_ex
; raise = raise_ex
}
(* A lift from `Pure´ into the new effect *)
(* unfold let lift_pure_ex_wp (a:Type) (wp:pure_wp a) (_:unit) (p:XEXN?.post a) = *)
(* wp (fun a -> p (Some a)) *)
(* sub_effect PURE ~> XEXN = lift_pure_ex_wp *)
reifiable
let raise (#a:Type0) (e:exn) : XEXN a (fun _ p -> p None)
= let x = XEXN?.raise e in begin match x with end
(* An effect to alias easily write pre- and postconditions *)
(* Note: we use Type0 instead of XEXN.pre to avoid having to thunk everything. *)
effect Xexn (a:Type) (pre:Type0) (post:XEXN?.post a) =
XEXN a (fun (_:unit) (p:XEXN?.post a) -> pre /\
(forall (r:option a). (pre /\ post r) ==> p r))
(* Another alias. Ex a is the effect type for total exception-throwing
* programs. i.e. Any program of type `Ex a´ will throw or finish
* correctly, but never loop. *)
effect Xex (a:Type) = XEXN a (fun _ p -> forall (x:option a). p x)
// arguments to printf
type arg =
| Bool | Int | Char | String
// directives to printf
type dir =
| Lit : char -> dir
| Arg : arg -> dir
let arg_type (a:arg) : Tot Type0 =
match a with
| Bool -> bool
| Int -> int
| Char -> char
| String -> string
let rec dir_type (ds:list dir) : Tot Type0 =
match ds with
| [] -> string
| Lit c :: ds' -> dir_type ds'
| Arg a :: ds' -> arg_type a -> Tot (dir_type ds')
let dir_type' ds = dir_type ds
let rec string_of_dirs ds (k:string -> Tot string) : Tot (dir_type ds) =
match ds with
| [] -> k ""
| Lit c :: ds' ->
coerce_eq () (
string_of_dirs ds' (fun res -> k (string_of_char c ^ res))
)
| Arg a :: ds' -> fun (x : arg_type a) ->
string_of_dirs ds' (fun res -> k (match a with
| Bool -> string_of_bool x
| Int -> string_of_int x
| Char -> string_of_char x
| String -> x) ^ res)
let example1 : string =
string_of_dirs [Arg Int; Arg String] (fun s -> s) 42 " answer"
exception InvalidFormatString
(* TODO: can we get rid of the two `let x` or are they really required? *)
reifiable let rec parse_format (s:list char) : Xex (list dir) =
match s with
| [] -> []
| '%' :: c :: s' ->
let d =
match c with
| '%' -> Lit '%'
| 'b' -> Arg Bool
| 'd' -> Arg Int
| 'c' -> Arg Char
| 's' -> Arg String
| _ -> raise InvalidFormatString
in let x = parse_format s' in d :: x
| '%' :: [] -> raise InvalidFormatString
| c :: s' -> let x = parse_format s' in Lit c :: x
let parse_format_pure (s:list char) : option (list dir) =
reify (parse_format s) ()
let rec parse_format_string (s:string) : Tot (option (list dir)) =
parse_format_pure (list_of_string s) | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.String.fsti.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.fst.checked",
"FStar.Char.fsti.checked"
],
"interface_file": false,
"source_file": "SimplePrintfReify.fst"
} | [
{
"abbrev": true,
"full_module": "FStar.List.Tot",
"short_module": "List"
},
{
"abbrev": false,
"full_module": "FStar.String",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Char",
"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",
"short_module": null
}
] | {
"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_elim_box": false,
"smtencoding_l_arith_repr": "boxwrap",
"smtencoding_nl_arith_repr": "boxwrap",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": true,
"z3cliopt": [],
"z3refresh": false,
"z3rlimit": 5,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | false | s: Prims.string{FStar.Pervasives.normalize_term (Some? (SimplePrintfReify.parse_format_string s))}
-> FStar.Pervasives.normalize_term (SimplePrintfReify.dir_type (Some?.v (SimplePrintfReify.parse_format_string
s))) | Prims.Tot | [
"total"
] | [] | [
"Prims.string",
"Prims.b2t",
"FStar.Pervasives.normalize_term",
"Prims.bool",
"FStar.Pervasives.Native.uu___is_Some",
"Prims.list",
"SimplePrintfReify.dir",
"SimplePrintfReify.parse_format_string",
"SimplePrintfReify.string_of_dirs",
"FStar.Pervasives.Native.__proj__Some__item__v",
"SimplePrintfReify.dir_type"
] | [] | false | false | false | false | false | let sprintf (s: string{normalize_term #bool (Some? (parse_format_string s))})
: Tot (normalize_term (dir_type (Some?.v (parse_format_string s)))) =
| string_of_dirs (Some?.v (parse_format_string s)) (fun s -> s) | false |
PulseCore.Atomic.fst | PulseCore.Atomic.stt_atomic | val stt_atomic
(a:Type u#a)
(#obs:observability)
(opens:inames)
(pre:slprop)
(post:a -> slprop)
: Type u#(max 2 a) | val stt_atomic
(a:Type u#a)
(#obs:observability)
(opens:inames)
(pre:slprop)
(post:a -> slprop)
: Type u#(max 2 a) | let stt_atomic a #obs opens pre post =
A.act a opens pre post | {
"file_name": "lib/pulse_core/PulseCore.Atomic.fst",
"git_rev": "f984200f79bdc452374ae994a5ca837496476c41",
"git_url": "https://github.com/FStarLang/steel.git",
"project_name": "steel"
} | {
"end_col": 24,
"end_line": 8,
"start_col": 0,
"start_line": 7
} | module PulseCore.Atomic
module I = PulseCore.InstantiatedSemantics
module A = PulseCore.Action
open PulseCore.InstantiatedSemantics
open PulseCore.Action | {
"checked_file": "/",
"dependencies": [
"PulseCore.InstantiatedSemantics.fsti.checked",
"PulseCore.Action.fsti.checked",
"prims.fst.checked",
"FStar.Squash.fsti.checked",
"FStar.Set.fsti.checked",
"FStar.PropositionalExtensionality.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.PCM.fst.checked",
"FStar.Ghost.Pull.fsti.checked",
"FStar.Ghost.fsti.checked",
"FStar.Calc.fsti.checked"
],
"interface_file": true,
"source_file": "PulseCore.Atomic.fst"
} | [
{
"abbrev": false,
"full_module": "PulseCore.Action",
"short_module": null
},
{
"abbrev": false,
"full_module": "PulseCore.InstantiatedSemantics",
"short_module": null
},
{
"abbrev": true,
"full_module": "PulseCore.Action",
"short_module": "A"
},
{
"abbrev": true,
"full_module": "PulseCore.InstantiatedSemantics",
"short_module": "I"
},
{
"abbrev": false,
"full_module": "FStar.Ghost",
"short_module": null
},
{
"abbrev": false,
"full_module": "PulseCore.Observability",
"short_module": null
},
{
"abbrev": false,
"full_module": "PulseCore.Action",
"short_module": null
},
{
"abbrev": false,
"full_module": "PulseCore.InstantiatedSemantics",
"short_module": null
},
{
"abbrev": false,
"full_module": "PulseCore",
"short_module": null
},
{
"abbrev": false,
"full_module": "PulseCore",
"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",
"short_module": null
}
] | {
"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_elim_box": false,
"smtencoding_l_arith_repr": "boxwrap",
"smtencoding_nl_arith_repr": "boxwrap",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": true,
"z3cliopt": [],
"z3refresh": false,
"z3rlimit": 5,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | false |
a: Type ->
opens: PulseCore.Action.inames ->
pre: PulseCore.InstantiatedSemantics.slprop ->
post: (_: a -> PulseCore.InstantiatedSemantics.slprop)
-> Type | Prims.Tot | [
"total"
] | [] | [
"PulseCore.Observability.observability",
"PulseCore.Action.inames",
"PulseCore.InstantiatedSemantics.slprop",
"PulseCore.Action.act"
] | [] | false | false | false | true | true | let stt_atomic a #obs opens pre post =
| A.act a opens pre post | false |
LowStar.Lens.Buffer.fst | LowStar.Lens.Buffer.elim_inv | val elim_inv (#a:_) (#p:_) (#q:_)
(#b:B.mbuffer a p q)
(#f:flavor b)
(bl:buffer_lens b f)
: Lemma (reveal_inv();
(forall (h:HS.mem).{:pattern (lens_of bl).invariant (lens_of bl).x h}
let l = lens_of bl in
(exists h'.{:pattern mk b f h'} B.live h' b /\ bl == mk b f h') /\
(lens_of bl).invariant (lens_of bl).x h ==>
B.live h b /\
view (snap l h) h ==
(match f with
| Pointer -> B.get h b 0
| Buffer -> B.as_seq h b))) | val elim_inv (#a:_) (#p:_) (#q:_)
(#b:B.mbuffer a p q)
(#f:flavor b)
(bl:buffer_lens b f)
: Lemma (reveal_inv();
(forall (h:HS.mem).{:pattern (lens_of bl).invariant (lens_of bl).x h}
let l = lens_of bl in
(exists h'.{:pattern mk b f h'} B.live h' b /\ bl == mk b f h') /\
(lens_of bl).invariant (lens_of bl).x h ==>
B.live h b /\
view (snap l h) h ==
(match f with
| Pointer -> B.get h b 0
| Buffer -> B.as_seq h b))) | let elim_inv #a #p #q
(#b:B.mbuffer a p q)
(#f:flavor b)
(bl:buffer_lens b f)
: Lemma (reveal_inv();
(forall (h:HS.mem).{:pattern (lens_of bl).invariant (lens_of bl).x h}
let l = lens_of bl in
(exists h'.{:pattern mk b f h'} B.live h' b /\ bl == mk b f h') /\
(lens_of bl).invariant (lens_of bl).x h ==>
B.live h b /\
view (snap l h) h ==
(match f with
| Pointer -> B.get h b 0
| Buffer -> B.as_seq h b)))
= reveal_inv () | {
"file_name": "examples/data_structures/LowStar.Lens.Buffer.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 17,
"end_line": 84,
"start_col": 0,
"start_line": 70
} | (*
Copyright 2008-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 in writing, software
distributed under the License is distributed on an "AS IS" BASIS,
WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
See the License for the specific language governing permissions and
limitations under the License.
*)
module LowStar.Lens.Buffer
open LowStar.Lens
open FStar.HyperStack.ST
module B = LowStar.Buffer
module HS = FStar.HyperStack
module HST = FStar.HyperStack.ST
open FStar.Integers
let mk #a #p #q (b:B.mbuffer a p q) (f:flavor b) (snap:HS.mem{B.live snap b})
: Tot (l:buffer_lens b f{(lens_of l).snapshot == snap})
= let blens : buffer_hs_lens b f =
FStar.Classical.forall_intro_2 (B.g_upd_seq_as_seq b);
let invariant (x:B.mbuffer a p q) (h:HS.mem) =
B.live h x
in
let fp = Ghost.hide (B.loc_buffer b) in
let get : get_t (imem (invariant b)) (view_type_of f) =
fun h ->
match f with
| Buffer -> B.as_seq h b
| Pointer -> B.get h b 0
in
let put : put_t (imem (invariant b)) (view_type_of f) =
fun v h ->
match f with
| Buffer -> B.g_upd_seq b v h
| Pointer -> B.g_upd b 0 v h
in
let l : imem_lens (invariant b) (view_type_of f) fp = {
get = get;
put = put;
lens_laws = ()
}
in
{
footprint = fp;
invariant = invariant;
x = b;
snapshot = snap;
l = l
}
in
let reader : with_state blens (reader_t f id_lens) =
fun s i ->
reveal_inv();
B.index b i
in
let writer : with_state blens (writer_t f id_lens) =
fun s i v ->
reveal_inv();
B.upd b i v
in
Mk blens reader writer | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"LowStar.Lens.fsti.checked",
"LowStar.Buffer.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Integers.fst.checked",
"FStar.HyperStack.ST.fsti.checked",
"FStar.HyperStack.fst.checked",
"FStar.Ghost.fsti.checked",
"FStar.Classical.fsti.checked"
],
"interface_file": true,
"source_file": "LowStar.Lens.Buffer.fst"
} | [
{
"abbrev": true,
"full_module": "LowStar.Lens",
"short_module": "LL"
},
{
"abbrev": false,
"full_module": "FStar.Integers",
"short_module": null
},
{
"abbrev": true,
"full_module": "FStar.HyperStack.ST",
"short_module": "HST"
},
{
"abbrev": true,
"full_module": "FStar.HyperStack",
"short_module": "HS"
},
{
"abbrev": true,
"full_module": "LowStar.Buffer",
"short_module": "B"
},
{
"abbrev": false,
"full_module": "FStar.HyperStack.ST",
"short_module": null
},
{
"abbrev": false,
"full_module": "LowStar.Lens",
"short_module": null
},
{
"abbrev": false,
"full_module": "LowStar.Lens",
"short_module": null
},
{
"abbrev": false,
"full_module": "LowStar.Lens",
"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",
"short_module": null
}
] | {
"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_elim_box": false,
"smtencoding_l_arith_repr": "boxwrap",
"smtencoding_nl_arith_repr": "boxwrap",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": true,
"z3cliopt": [],
"z3refresh": false,
"z3rlimit": 5,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | false | bl: LowStar.Lens.Buffer.buffer_lens b f
-> FStar.Pervasives.Lemma
(ensures
(LowStar.Lens.reveal_inv ();
forall (h: FStar.Monotonic.HyperStack.mem).
{:pattern
Mkhs_lens?.invariant (LowStar.Lens.Buffer.lens_of bl)
(Mkhs_lens?.x (LowStar.Lens.Buffer.lens_of bl))
h}
let l = LowStar.Lens.Buffer.lens_of bl in
(exists (h': snap: FStar.Monotonic.HyperStack.mem{LowStar.Monotonic.Buffer.live snap b}).
{:pattern LowStar.Lens.Buffer.mk b f h'}
LowStar.Monotonic.Buffer.live h' b /\ bl == LowStar.Lens.Buffer.mk b f h') /\
Mkhs_lens?.invariant (LowStar.Lens.Buffer.lens_of bl)
(Mkhs_lens?.x (LowStar.Lens.Buffer.lens_of bl))
h ==>
LowStar.Monotonic.Buffer.live h b /\
LowStar.Lens.view (LowStar.Lens.snap l h) h ==
((match f with
| LowStar.Lens.Buffer.Pointer -> LowStar.Monotonic.Buffer.get h b 0
| LowStar.Lens.Buffer.Buffer -> LowStar.Monotonic.Buffer.as_seq h b)
<:
LowStar.Lens.Buffer.view_type_of f))) | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"LowStar.Monotonic.Buffer.srel",
"LowStar.Monotonic.Buffer.mbuffer",
"LowStar.Lens.Buffer.flavor",
"LowStar.Lens.Buffer.buffer_lens",
"LowStar.Lens.reveal_inv",
"Prims.unit",
"Prims.l_True",
"Prims.squash",
"Prims.l_Forall",
"FStar.Monotonic.HyperStack.mem",
"Prims.l_imp",
"Prims.l_and",
"Prims.l_Exists",
"LowStar.Monotonic.Buffer.live",
"Prims.eq2",
"LowStar.Lens.Buffer.mk",
"LowStar.Lens.__proj__Mkhs_lens__item__invariant",
"LowStar.Lens.Buffer.view_type_of",
"LowStar.Lens.Buffer.lens_of",
"LowStar.Lens.__proj__Mkhs_lens__item__x",
"LowStar.Lens.view",
"LowStar.Lens.snap",
"LowStar.Monotonic.Buffer.get",
"LowStar.Monotonic.Buffer.as_seq",
"LowStar.Lens.Buffer.buffer_hs_lens",
"Prims.Nil",
"FStar.Pervasives.pattern"
] | [] | true | false | true | false | false | let elim_inv #a #p #q (#b: B.mbuffer a p q) (#f: flavor b) (bl: buffer_lens b f)
: Lemma
(reveal_inv ();
(forall (h: HS.mem). {:pattern (lens_of bl).invariant (lens_of bl).x h}
let l = lens_of bl in
(exists h'. {:pattern mk b f h'} B.live h' b /\ bl == mk b f h') /\
(lens_of bl).invariant (lens_of bl).x h ==>
B.live h b /\
view (snap l h) h ==
(match f with
| Pointer -> B.get h b 0
| Buffer -> B.as_seq h b))) =
| reveal_inv () | false |
Selectors.LList2.fst | Selectors.LList2.tail | val tail (#a:Type0) (ptr:t a)
: Steel (t a) (llist ptr)
(fun n -> vptr ptr `star` llist n)
(requires fun _ -> ptr =!= null_llist)
(ensures fun h0 n h1 ->
Cons? (v_llist ptr h0) /\
sel ptr h1 == mk_cell n (L.hd (v_llist ptr h0)) /\
v_llist n h1 == L.tl (v_llist ptr h0)) | val tail (#a:Type0) (ptr:t a)
: Steel (t a) (llist ptr)
(fun n -> vptr ptr `star` llist n)
(requires fun _ -> ptr =!= null_llist)
(ensures fun h0 n h1 ->
Cons? (v_llist ptr h0) /\
sel ptr h1 == mk_cell n (L.hd (v_llist ptr h0)) /\
v_llist n h1 == L.tl (v_llist ptr h0)) | let tail
#a ptr
=
llist0_of_llist ptr;
change_equal_slprop
(llist0 ptr)
((vptr ptr `vdep` llist_vdep ptr) `vrewrite` llist_vrewrite ptr);
elim_vrewrite (vptr ptr `vdep` llist_vdep ptr) (llist_vrewrite ptr);
let gc = elim_vdep (vptr ptr) (llist_vdep ptr) in
(* reset tail fuel to match mk_cell *)
let c = read ptr in
let c' = {c with tail_fuel = Ghost.hide 0} in
write ptr c' ;
(* actually destruct the list *)
change_equal_slprop
(llist_vdep ptr (Ghost.reveal gc))
(nllist a c.tail_fuel c.next);
llist0_of_nllist c.tail_fuel c.next;
llist_of_llist0 c.next;
return c.next | {
"file_name": "share/steel/examples/steel/Selectors.LList2.fst",
"git_rev": "f984200f79bdc452374ae994a5ca837496476c41",
"git_url": "https://github.com/FStarLang/steel.git",
"project_name": "steel"
} | {
"end_col": 15,
"end_line": 314,
"start_col": 0,
"start_line": 295
} | module Selectors.LList2
open Steel.FractionalPermission
module Mem = Steel.Memory
#push-options "--__no_positivity"
noeq
type cell (a: Type0) = {
tail_fuel: Ghost.erased nat;
next: ref (cell a);
data: a;
}
#pop-options
let next #a (c:cell a) : t a = c.next
let data #a (c:cell a) : a = c.data
let mk_cell #a (n: t a) (d:a) = {
tail_fuel = Ghost.hide 0;
next = n;
data = d
}
let null_llist #a = null
let is_null #a ptr = is_null ptr
let v_null_rewrite
(a: Type0)
(_: t_of emp)
: GTot (list a)
= []
let v_c
(n: Ghost.erased nat)
(#a: Type0)
(r: t a)
(c: normal (t_of (vptr r)))
: GTot prop
= (Ghost.reveal c.tail_fuel < Ghost.reveal n) == true // to ensure vprop termination
let v_c_dep
(n: Ghost.erased nat)
(#a: Type0)
(r: t a)
(nllist: (n': Ghost.erased nat) -> (r: t a { Ghost.reveal n' < Ghost.reveal n }) -> Pure vprop (requires True) (ensures (fun y -> t_of y == list a)))
(c: normal (t_of (vrefine (vptr r) (v_c n r))))
: Tot vprop
= nllist c.tail_fuel c.next
let v_c_l_rewrite
(n: Ghost.erased nat)
(#a: Type0)
(r: t a)
(nllist: (n': Ghost.erased nat) -> (r: t a { Ghost.reveal n' < Ghost.reveal n }) -> Pure vprop (requires True) (ensures (fun y -> t_of y == list a)))
(res: normal (t_of ((vptr r `vrefine` v_c n r) `vdep` v_c_dep n r nllist)))
: Tot (list a)
= let (| c, l |) = res in
c.data :: l
let rec nllist
(a: Type0)
(n: Ghost.erased nat)
(r: t a)
: Pure vprop
(requires True)
(ensures (fun y -> t_of y == list a))
(decreases (Ghost.reveal n))
= if is_null r
then emp `vrewrite` v_null_rewrite a
else ((vptr r `vrefine` v_c n r) `vdep` v_c_dep n r (nllist a)) `vrewrite` v_c_l_rewrite n r (nllist a)
let nllist_eq_not_null
(a: Type0)
(n: Ghost.erased nat)
(r: t a)
: Lemma
(requires (is_null r == false))
(ensures (
nllist a n r == ((vptr r `vrefine` v_c n r) `vdep` v_c_dep n r (nllist a)) `vrewrite` v_c_l_rewrite n r (nllist a)
))
= assert_norm (nllist a n r ==
begin if is_null r
then emp `vrewrite` v_null_rewrite a
else ((vptr r `vrefine` v_c n r) `vdep` v_c_dep n r (nllist a)) `vrewrite` v_c_l_rewrite n r (nllist a)
end
)
let llist_vdep
(#a: Type0)
(r: t a)
(c: normal (t_of (vptr r)))
: Tot vprop
= nllist a c.tail_fuel c.next
let llist_vrewrite
(#a: Type0)
(r: t a)
(cl: normal (t_of (vptr r `vdep` llist_vdep r)))
: GTot (list a)
= (dfst cl).data :: dsnd cl
let llist0
(#a: Type0)
(r: t a)
: Pure vprop
(requires True)
(ensures (fun y -> t_of y == list a))
= if is_null r
then emp `vrewrite` v_null_rewrite a
else (vptr r `vdep` llist_vdep r) `vrewrite` llist_vrewrite r
let nllist_of_llist0
(#opened: _)
(#a: Type0)
(r: t a)
: SteelGhost (Ghost.erased nat) opened
(llist0 r)
(fun res -> nllist a res r)
(fun _ -> True)
(fun h0 res h1 ->
h0 (llist0 r) == h1 (nllist a res r)
)
=
if is_null r
then begin
let res = Ghost.hide 0 in
change_equal_slprop
(llist0 r)
(nllist a res r);
res
end else begin
change_equal_slprop
(llist0 r)
((vptr r `vdep` llist_vdep r) `vrewrite` llist_vrewrite r);
elim_vrewrite (vptr r `vdep` llist_vdep r) (llist_vrewrite r);
let gk : normal (Ghost.erased (t_of (vptr r))) = elim_vdep (vptr r) (llist_vdep r) in
let res = Ghost.hide (Ghost.reveal (Ghost.reveal gk).tail_fuel + 1) in
intro_vrefine (vptr r) (v_c res r);
intro_vdep
(vptr r `vrefine` v_c res r)
(llist_vdep r (Ghost.reveal gk))
(v_c_dep res r (nllist a));
intro_vrewrite ((vptr r `vrefine` v_c res r) `vdep` v_c_dep res r (nllist a)) (v_c_l_rewrite res r (nllist a));
nllist_eq_not_null a res r;
change_equal_slprop
(((vptr r `vrefine` v_c res r) `vdep` v_c_dep res r (nllist a)) `vrewrite` v_c_l_rewrite res r (nllist a))
(nllist a res r);
res
end
let llist0_of_nllist
(#opened: _)
(#a: Type0)
(n: Ghost.erased nat)
(r: t a)
: SteelGhost unit opened
(nllist a n r)
(fun _ -> llist0 r)
(fun _ -> True)
(fun h0 res h1 ->
h1 (llist0 r) == h0 (nllist a n r)
)
=
if is_null r
then begin
change_equal_slprop
(nllist a n r)
(llist0 r);
()
end else begin
nllist_eq_not_null a n r;
change_equal_slprop
(nllist a n r)
(((vptr r `vrefine` v_c n r) `vdep` v_c_dep n r (nllist a)) `vrewrite` v_c_l_rewrite n r (nllist a));
elim_vrewrite ((vptr r `vrefine` v_c n r) `vdep` v_c_dep n r (nllist a)) (v_c_l_rewrite n r (nllist a));
let gk = elim_vdep (vptr r `vrefine` v_c n r) (v_c_dep n r (nllist a)) in
elim_vrefine (vptr r) (v_c n r);
intro_vdep
(vptr r)
(v_c_dep n r (nllist a) (Ghost.reveal gk))
(llist_vdep r);
intro_vrewrite (vptr r `vdep` llist_vdep r) (llist_vrewrite r);
change_equal_slprop
((vptr r `vdep` llist_vdep r) `vrewrite` llist_vrewrite r)
(llist0 r)
end
let llist_sl
#a r
= hp_of (llist0 r)
let llist_sel
#a r
= fun m -> sel_of (llist0 r) m // eta necessary because sel_of is GTot
let llist_of_llist0
(#opened: _)
(#a: Type)
(r: t a)
: SteelGhost unit opened
(llist0 r)
(fun _ -> llist r)
(fun _ -> True)
(fun h0 _ h1 -> h1 (llist r) == h0 (llist0 r))
=
change_slprop_rel
(llist0 r)
(llist r)
(fun x y -> x == y)
(fun _ -> ())
let llist0_of_llist
(#opened: _)
(#a: Type)
(r: t a)
: SteelGhost unit opened
(llist r)
(fun _ -> llist0 r)
(fun _ -> True)
(fun h0 _ h1 -> h1 (llist0 r) == h0 (llist r))
=
change_slprop_rel
(llist r)
(llist0 r)
(fun x y -> x == y)
(fun _ -> ())
let intro_llist_nil a =
intro_vrewrite emp (v_null_rewrite a);
change_equal_slprop
(emp `vrewrite` v_null_rewrite a)
(llist0 (null_llist #a));
llist_of_llist0 (null_llist #a)
let is_nil' (#opened: _) (#a:Type0) (ptr:t a)
: SteelGhost unit opened (llist ptr) (fun _ -> llist ptr)
(requires fun _ -> True)
(ensures fun h0 _ h1 ->
let res = is_null ptr in
(res == true <==> ptr == null_llist #a) /\
v_llist ptr h0 == v_llist ptr h1 /\
res == Nil? (v_llist ptr h1))
=
let res = is_null ptr in
llist0_of_llist ptr;
if res
then begin
change_equal_slprop
(llist0 ptr)
(emp `vrewrite` v_null_rewrite a);
elim_vrewrite emp (v_null_rewrite a);
intro_vrewrite emp (v_null_rewrite a);
change_equal_slprop
(emp `vrewrite` v_null_rewrite a)
(llist0 ptr)
end else begin
change_equal_slprop
(llist0 ptr)
((vptr ptr `vdep` llist_vdep ptr) `vrewrite` llist_vrewrite ptr);
elim_vrewrite (vptr ptr `vdep` llist_vdep ptr) (llist_vrewrite ptr);
intro_vrewrite (vptr ptr `vdep` llist_vdep ptr) (llist_vrewrite ptr);
change_equal_slprop
((vptr ptr `vdep` llist_vdep ptr) `vrewrite` llist_vrewrite ptr)
(llist0 ptr)
end;
llist_of_llist0 ptr
let is_nil
#a ptr
= is_nil' ptr;
return (is_null ptr)
let intro_llist_cons
#a ptr1 ptr2
=
llist0_of_llist ptr2;
let n = nllist_of_llist0 ptr2 in
(* set the fuel of the new cons cell *)
let c = read ptr1 in
let c' = {c with tail_fuel = n} in
write ptr1 c' ;
(* actually cons the cell *)
vptr_not_null ptr1;
intro_vdep
(vptr ptr1)
(nllist a n ptr2)
(llist_vdep ptr1);
intro_vrewrite
(vptr ptr1 `vdep` llist_vdep ptr1)
(llist_vrewrite ptr1);
change_equal_slprop
((vptr ptr1 `vdep` llist_vdep ptr1) `vrewrite` llist_vrewrite ptr1)
(llist0 ptr1);
llist_of_llist0 ptr1 | {
"checked_file": "/",
"dependencies": [
"Steel.Memory.fsti.checked",
"Steel.FractionalPermission.fst.checked",
"prims.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Ghost.fsti.checked"
],
"interface_file": true,
"source_file": "Selectors.LList2.fst"
} | [
{
"abbrev": true,
"full_module": "Steel.Memory",
"short_module": "Mem"
},
{
"abbrev": false,
"full_module": "Steel.FractionalPermission",
"short_module": null
},
{
"abbrev": true,
"full_module": "FStar.List.Tot",
"short_module": "L"
},
{
"abbrev": false,
"full_module": "Steel.Reference",
"short_module": null
},
{
"abbrev": false,
"full_module": "Steel.Effect",
"short_module": null
},
{
"abbrev": false,
"full_module": "Steel.Effect.Atomic",
"short_module": null
},
{
"abbrev": false,
"full_module": "Steel.Memory",
"short_module": null
},
{
"abbrev": false,
"full_module": "Selectors",
"short_module": null
},
{
"abbrev": false,
"full_module": "Selectors",
"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",
"short_module": null
}
] | {
"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_elim_box": false,
"smtencoding_l_arith_repr": "boxwrap",
"smtencoding_nl_arith_repr": "boxwrap",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": true,
"z3cliopt": [],
"z3refresh": false,
"z3rlimit": 5,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | false | ptr: Selectors.LList2.t a -> Steel.Effect.Steel (Selectors.LList2.t a) | Steel.Effect.Steel | [] | [] | [
"Selectors.LList2.t",
"Steel.Effect.Atomic.return",
"FStar.Ghost.hide",
"FStar.Set.set",
"Steel.Memory.iname",
"FStar.Set.empty",
"Steel.Effect.Common.VStar",
"Steel.Reference.vptrp",
"Selectors.LList2.cell",
"Steel.FractionalPermission.full_perm",
"Selectors.LList2.llist",
"Steel.Effect.Common.vprop",
"Selectors.LList2.__proj__Mkcell__item__next",
"Prims.unit",
"Selectors.LList2.llist_of_llist0",
"Selectors.LList2.llist0_of_nllist",
"Selectors.LList2.__proj__Mkcell__item__tail_fuel",
"Steel.Effect.Atomic.change_equal_slprop",
"Selectors.LList2.llist_vdep",
"FStar.Ghost.reveal",
"Steel.Effect.Common.t_of",
"Steel.Reference.vptr",
"Selectors.LList2.nllist",
"Steel.Reference.write",
"Selectors.LList2.Mkcell",
"Prims.nat",
"Selectors.LList2.__proj__Mkcell__item__data",
"Steel.Reference.read",
"FStar.Ghost.erased",
"Steel.Effect.Common.VUnit",
"Steel.Reference.vptr'",
"Steel.Effect.Atomic.elim_vdep",
"Steel.Effect.Atomic.elim_vrewrite",
"Steel.Effect.Common.vdep",
"Prims.list",
"Selectors.LList2.llist_vrewrite",
"Selectors.LList2.llist0",
"Steel.Effect.Common.vrewrite",
"Selectors.LList2.llist0_of_llist"
] | [] | false | true | false | false | false | let tail #a ptr =
| llist0_of_llist ptr;
change_equal_slprop (llist0 ptr)
(((vptr ptr) `vdep` (llist_vdep ptr)) `vrewrite` (llist_vrewrite ptr));
elim_vrewrite ((vptr ptr) `vdep` (llist_vdep ptr)) (llist_vrewrite ptr);
let gc = elim_vdep (vptr ptr) (llist_vdep ptr) in
let c = read ptr in
let c' = { c with tail_fuel = Ghost.hide 0 } in
write ptr c';
change_equal_slprop (llist_vdep ptr (Ghost.reveal gc)) (nllist a c.tail_fuel c.next);
llist0_of_nllist c.tail_fuel c.next;
llist_of_llist0 c.next;
return c.next | false |
LowParse.Low.Sum.fst | LowParse.Low.Sum.accessor_clens_dsum_unknown_payload' | val accessor_clens_dsum_unknown_payload'
(#kt: parser_kind)
(t: dsum)
(#p: parser kt (dsum_repr_type t))
(j: jumper p)
(f: (x: dsum_known_key t -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x))))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: HST.Stack U32.t
(requires
(fun h ->
valid (parse_dsum t p f g) h input pos /\
(clens_dsum_unknown_payload t).clens_cond (contents (parse_dsum t p f g) h input pos)))
(ensures
(fun h pos' h' ->
B.modifies B.loc_none h h' /\
pos' == slice_access h (gaccessor_clens_dsum_unknown_payload t p f g) input pos)) | val accessor_clens_dsum_unknown_payload'
(#kt: parser_kind)
(t: dsum)
(#p: parser kt (dsum_repr_type t))
(j: jumper p)
(f: (x: dsum_known_key t -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x))))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: HST.Stack U32.t
(requires
(fun h ->
valid (parse_dsum t p f g) h input pos /\
(clens_dsum_unknown_payload t).clens_cond (contents (parse_dsum t p f g) h input pos)))
(ensures
(fun h pos' h' ->
B.modifies B.loc_none h h' /\
pos' == slice_access h (gaccessor_clens_dsum_unknown_payload t p f g) input pos)) | let accessor_clens_dsum_unknown_payload'
(#kt: parser_kind)
(t: dsum)
(#p: parser kt (dsum_repr_type t))
(j: jumper p)
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: HST.Stack U32.t
(requires (fun h ->
valid (parse_dsum t p f g) h input pos /\
(clens_dsum_unknown_payload t).clens_cond (contents (parse_dsum t p f g) h input pos)
))
(ensures (fun h pos' h' ->
B.modifies B.loc_none h h' /\
pos' == slice_access h (gaccessor_clens_dsum_unknown_payload t p f g) input pos
))
=
let h = HST.get () in
[@inline_let]
let _ =
let pos' = get_valid_pos (parse_dsum t p f g) h input pos in
let large = bytes_of_slice_from h input pos in
slice_access_eq h (gaccessor_clens_dsum_unknown_payload t p f g) input pos;
valid_facts (parse_dsum t p f g) h input pos;
parse_dsum_eq3 t p f g large;
valid_facts p h input pos
in
j input pos | {
"file_name": "src/lowparse/LowParse.Low.Sum.fst",
"git_rev": "00217c4a89f5ba56002ba9aa5b4a9d5903bfe9fa",
"git_url": "https://github.com/project-everest/everparse.git",
"project_name": "everparse"
} | {
"end_col": 13,
"end_line": 2064,
"start_col": 0,
"start_line": 2033
} | module LowParse.Low.Sum
include LowParse.Low.Enum
include LowParse.Spec.Sum
module U32 = FStar.UInt32
module HST = FStar.HyperStack.ST
module B = LowStar.Buffer
module Cast = FStar.Int.Cast
module U64 = FStar.UInt64
inline_for_extraction
let validate_sum_cases_aux
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(vc: ((x: sum_key t) -> Tot (validator (dsnd (pc x)))))
(k: sum_key t)
: Tot (validator (parse_sum_cases t pc k))
= [@inline_let]
let _ = synth_sum_case_injective t k in
validate_synth
(validate_weaken
(weaken_parse_cases_kind t pc)
(vc k)
()
)
(synth_sum_case t k)
()
inline_for_extraction
let validate_sum_cases_t
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot Type
= validator (parse_sum_cases t pc k)
let validate_sum_cases_t_eq
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
(x y : validate_sum_cases_t t pc k)
: GTot Type0
= True
inline_for_extraction
let validate_sum_cases_t_if
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (if_combinator _ (validate_sum_cases_t_eq t pc k))
= fun cond (sv_true: cond_true cond -> Tot (validate_sum_cases_t t pc k)) (sv_false: cond_false cond -> Tot (validate_sum_cases_t t pc k)) #rrel #rel input pos ->
if cond
then sv_true () input pos
else sv_false () input pos
inline_for_extraction
let validate_sum_cases
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(vc: ((x: sum_key t) -> Tot (validator (dsnd (pc x)))))
(destr: dep_enum_destr (sum_enum t) (validate_sum_cases_t t pc))
(k: sum_key t)
: Tot (validator (parse_sum_cases t pc k))
= destr
_
(validate_sum_cases_t_if t pc)
(fun _ _ -> ())
(fun _ _ _ _ -> ())
(validate_sum_cases_aux t pc vc)
k
inline_for_extraction
let validate_sum_aux_payload_t
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
: Tot Type
= (#rrel: _) -> (#rel: _) ->
(input: slice rrel rel) ->
(pos: U64.t) ->
HST.Stack U64.t
(requires (fun h -> live_slice h input /\ U64.v pos <= U32.v input.len))
(ensures (fun h res h' ->
B.modifies B.loc_none h h' /\ (
match k with
| Unknown _ -> is_error res
| Known k' ->
if is_success res
then
valid_pos (dsnd (pc k')) h input (uint64_to_uint32 pos) (uint64_to_uint32 res)
else
(~ (valid (dsnd (pc k')) h input (uint64_to_uint32 pos)))
)))
let validate_sum_aux_payload_eq
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
: Tot (validate_sum_aux_payload_t t pc k -> validate_sum_aux_payload_t t pc k -> GTot Type0)
= fun _ _ -> True
inline_for_extraction
let validate_sum_aux_payload_if'
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
(cond: bool)
(ift: ((cond_true cond) -> Tot (validate_sum_aux_payload_t t pc k)))
(iff: ((cond_false cond) -> Tot (validate_sum_aux_payload_t t pc k)))
: Tot (validate_sum_aux_payload_t t pc k)
= fun #rrel #rel input pos ->
if cond
then begin
(ift () <: validate_sum_aux_payload_t t pc k) input pos
end else
(iff () <: validate_sum_aux_payload_t t pc k) input pos
inline_for_extraction
let validate_sum_aux_payload_if
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
: Tot (if_combinator _ (validate_sum_aux_payload_eq t pc k))
= validate_sum_aux_payload_if' t pc k
#push-options "--z3rlimit 64 --z3cliopt smt.arith.nl=false --using_facts_from '* -FStar.Int.Cast -LowParse.BitFields'"
// --query_stats --smtencoding.elim_box true --smtencoding.l_arith_repr native --z3refresh"
inline_for_extraction
let validate_sum_aux
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(v: validator p)
(p32: leaf_reader p)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(v_payload: ((k: sum_repr_type t)) -> Tot (validate_sum_aux_payload_t t pc (maybe_enum_key_of_repr (sum_enum t) k)))
: Tot (validator (parse_sum t p pc))
= fun #rrel #rel input pos ->
let h = HST.get () in
[@inline_let]
let _ = parse_sum_eq'' t p pc (bytes_of_slice_from h input (uint64_to_uint32 pos)) in
[@inline_let]
let _ = valid_facts (parse_sum t p pc) h input (uint64_to_uint32 pos) in
[@inline_let]
let _ = valid_facts p h input (uint64_to_uint32 pos) in
let len_after_tag = v input pos in
if is_error len_after_tag
then len_after_tag
else begin
let h1 = HST.get () in
let k' = p32 input (uint64_to_uint32 pos) in
[@inline_let]
let _ =
match maybe_enum_key_of_repr (sum_enum t) k' with
| Known k -> valid_facts (dsnd (pc k)) h input (uint64_to_uint32 len_after_tag)
| _ -> ()
in
v_payload k' input len_after_tag
end
#pop-options
inline_for_extraction
let validate_sum_aux_payload'
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (validator (dsnd (pc x)))))
(k: maybe_enum_key (sum_enum t))
: Tot (validate_sum_aux_payload_t t pc k)
= fun #rrel #rel input pos ->
match k with
| Known k ->
[@inline_let]
let _ = synth_sum_case_injective t k in
pc32 k input pos
// validate_synth (pc32 k) (synth_sum_case t k) () input pos
| _ -> validator_error_generic
inline_for_extraction
let validate_sum_aux_payload
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (validator (dsnd (pc x)))))
(destr: dep_maybe_enum_destr_t (sum_enum t) (validate_sum_aux_payload_t t pc))
(k: sum_repr_type t)
: Tot (validate_sum_aux_payload_t t pc (maybe_enum_key_of_repr (sum_enum t) k))
= destr (validate_sum_aux_payload_eq t pc) (validate_sum_aux_payload_if t pc) (fun _ _ -> ()) (fun _ _ _ _ -> ()) (validate_sum_aux_payload' t pc pc32) k
inline_for_extraction
let validate_sum
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(v: validator p)
(p32: leaf_reader p)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (validator (dsnd (pc x)))))
(destr: dep_maybe_enum_destr_t (sum_enum t) (validate_sum_aux_payload_t t pc))
: Tot (validator (parse_sum t p pc))
= validate_sum_aux t v p32 pc (validate_sum_aux_payload t pc pc32 destr)
module HS = FStar.HyperStack
#push-options "--z3rlimit 256 --z3cliopt smt.arith.nl=false --initial_ifuel 8 --max_ifuel 8 --initial_fuel 2 --max_fuel 2"
#restart-solver
let valid_sum_intro
(h: HS.mem)
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: Lemma
(requires (
valid (parse_enum_key p (sum_enum t)) h input pos /\ (
let k = contents (parse_enum_key p (sum_enum t)) h input pos in
valid (dsnd (pc k)) h input (get_valid_pos (parse_enum_key p (sum_enum t)) h input pos)
)))
(ensures (
let k = contents (parse_enum_key p (sum_enum t)) h input pos in
let pos_payload = get_valid_pos (parse_enum_key p (sum_enum t)) h input pos in
valid_content_pos
(parse_sum t p pc) h input pos
(synth_sum_case t k (contents (dsnd (pc k)) h input pos_payload))
(get_valid_pos (dsnd (pc k)) h input pos_payload)
))
= valid_facts (parse_enum_key p (sum_enum t)) h input pos;
let k = contents (parse_enum_key p (sum_enum t)) h input pos in
let pos_payload = get_valid_pos (parse_enum_key p (sum_enum t)) h input pos in
valid_facts (dsnd (pc k)) h input pos_payload;
valid_facts (parse_sum t p pc) h input pos;
parse_sum_eq t p pc (bytes_of_slice_from h input pos)
#pop-options
inline_for_extraction
let finalize_sum_case
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(s: serializer p)
(w: leaf_writer_strong s)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(destr: enum_repr_of_key'_t (sum_enum t))
(k: sum_key t)
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: HST.Stack unit
(requires (fun h ->
let len_tag = serialized_length (serialize_enum_key _ s (sum_enum t)) k in
U32.v pos + len_tag < 4294967296 /\ (
let pos_payload = pos `U32.add` U32.uint_to_t len_tag in
valid (dsnd (pc k)) h input pos_payload /\
writable input.base (U32.v pos) (U32.v pos_payload) h
)))
(ensures (fun h _ h' ->
let len_tag = serialized_length (serialize_enum_key _ s (sum_enum t)) k in
let pos_payload = pos `U32.add` U32.uint_to_t len_tag in
B.modifies (loc_slice_from_to input pos pos_payload) h h' /\
valid_content_pos (parse_sum t p pc) h' input pos (synth_sum_case t k (contents (dsnd (pc k)) h input pos_payload)) (get_valid_pos (dsnd (pc k)) h input pos_payload)
))
= let pos1 = write_enum_key w (sum_enum t) destr k input pos in
let h = HST.get () in
[@inline_let]
let _ = valid_sum_intro h t p pc input pos in
()
inline_for_extraction
let jump_sum_cases_aux
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(vc: ((x: sum_key t) -> Tot (jumper (dsnd (pc x)))))
(k: sum_key t)
: Tot (jumper (parse_sum_cases t pc k))
= [@inline_let]
let _ = synth_sum_case_injective t k in
jump_synth
(jump_weaken
(weaken_parse_cases_kind t pc)
(vc k)
()
)
(synth_sum_case t k)
()
inline_for_extraction
let jump_sum_cases_t
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot Type
= jumper (parse_sum_cases t pc k)
let jump_sum_cases_t_eq
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
(x y : jump_sum_cases_t t pc k)
: GTot Type0
= True
inline_for_extraction
let jump_sum_cases_t_if
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (if_combinator _ (jump_sum_cases_t_eq t pc k))
= fun cond (sv_true: cond_true cond -> Tot (jump_sum_cases_t t pc k)) (sv_false: cond_false cond -> Tot (jump_sum_cases_t t pc k)) #rrel #rel input pos ->
if cond
then sv_true () input pos
else sv_false () input pos
inline_for_extraction
let jump_sum_cases
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(vc: ((x: sum_key t) -> Tot (jumper (dsnd (pc x)))))
(destr: dep_enum_destr (sum_enum t) (jump_sum_cases_t t pc))
(k: sum_key t)
: Tot (jumper (parse_sum_cases t pc k))
= destr
_
(jump_sum_cases_t_if t pc)
(fun _ _ -> ())
(fun _ _ _ _ -> ())
(jump_sum_cases_aux t pc vc)
k
inline_for_extraction
let jump_sum_aux_payload_t
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
: Tot Type
= (#rrel: _) -> (#rel: _) ->
(input: slice rrel rel) ->
(pos: U32.t) ->
HST.Stack U32.t
(requires (fun h -> live_slice h input /\ U32.v pos <= U32.v input.len /\ (
match k with
| Unknown _ -> False
| Known k' -> valid (dsnd (pc k')) h input pos
)))
(ensures (fun h res h' ->
B.modifies B.loc_none h h' /\ (
match k with
| Unknown _ -> False
| Known k' ->
valid_pos (dsnd (pc k')) h input pos res
)))
let jump_sum_aux_payload_eq
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
: Tot (jump_sum_aux_payload_t t pc k -> jump_sum_aux_payload_t t pc k -> GTot Type0)
= fun _ _ -> True
inline_for_extraction
let jump_sum_aux_payload_if'
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
(cond: bool)
(ift: ((cond_true cond) -> Tot (jump_sum_aux_payload_t t pc k)))
(iff: ((cond_false cond) -> Tot (jump_sum_aux_payload_t t pc k)))
: Tot (jump_sum_aux_payload_t t pc k)
= fun #rrel #rel input pos ->
if cond
then begin
(ift () <: jump_sum_aux_payload_t t pc k) input pos
end else
(iff () <: jump_sum_aux_payload_t t pc k) input pos
inline_for_extraction
let jump_sum_aux_payload_if
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
: Tot (if_combinator _ (jump_sum_aux_payload_eq t pc k))
= jump_sum_aux_payload_if' t pc k
let parse_sum_eq3
(#kt: parser_kind)
(t: sum)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(input: bytes)
(k' : sum_repr_type t)
(consumed_k: consumed_length input)
: Lemma
(requires (Some? (parse (parse_sum t p pc) input) /\ parse p input == Some (k', consumed_k)))
(ensures (
let input_k = Seq.slice input consumed_k (Seq.length input) in
let k = maybe_enum_key_of_repr (sum_enum t) k' in
begin match k with
| Known k ->
Some? (parse (dsnd (pc k)) input_k)
| _ -> False
end
))
= parse_sum_eq'' t p pc input
let parse_sum_eq4
(#kt: parser_kind)
(t: sum)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(input: bytes)
(k' : sum_repr_type t)
(consumed_k: consumed_length input)
(consumed_payload: nat)
: Lemma
(requires (Some? (parse (parse_sum t p pc) input) /\ parse p input == Some (k', consumed_k) /\ (
let input_k = Seq.slice input consumed_k (Seq.length input) in
let k = maybe_enum_key_of_repr (sum_enum t) k' in
begin match k with
| Known k ->
Some? (parse (dsnd (pc k)) input_k) /\ (
let Some (_, consumed_payload') = parse (dsnd (pc k)) input_k in
consumed_payload' == consumed_payload
)
| _ -> False
end
)))
(ensures (
let Some (_, consumed) = parse (parse_sum t p pc) input in
consumed == consumed_k + consumed_payload
))
= parse_sum_eq'' t p pc input
#push-options "--z3rlimit 16"
let valid_sum_elim
(h: HS.mem)
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(#rrel: _) (#rel: _)
(input: slice rrel rel)
(pos: U32.t)
: Lemma
(requires (
valid (parse_sum t p pc) h input pos
))
(ensures (
valid p h input pos /\ (
let pos_payload = get_valid_pos p h input pos in
let k' = maybe_enum_key_of_repr (sum_enum t) (contents p h input pos) in
match k' with
| Known k ->
k == sum_tag_of_data t (contents (parse_sum t p pc) h input pos) /\
valid (dsnd (pc k)) h input pos_payload /\
valid_pos
(parse_sum t p pc) h input pos
(get_valid_pos (dsnd (pc k)) h input pos_payload)
| _ -> False
)))
= let sinput = bytes_of_slice_from h input pos in
let _ = parse_sum_eq'' t p pc sinput in
[@inline_let]
let _ = valid_facts (parse_sum t p pc) h input pos in
let Some (k', consumed_k) = parse p sinput in
let pos_after_tag = U32.uint_to_t (U32.v pos + consumed_k) in
[@inline_let]
let _ = valid_facts p h input pos in
assert (valid_content_pos p h input pos k' pos_after_tag);
match maybe_enum_key_of_repr (sum_enum t) k' with
| Known k -> valid_facts (dsnd (pc k)) h input pos_after_tag
| _ -> ()
#pop-options
let valid_sum_elim_tag
(h: HS.mem)
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: Lemma
(requires (
valid (parse_sum t p pc) h input pos
))
(ensures (
valid (parse_enum_key p (sum_enum t)) h input pos /\
contents (parse_enum_key p (sum_enum t)) h input pos == sum_tag_of_data t (contents (parse_sum t p pc) h input pos)
))
= let _ = parse_sum_eq' t p pc (bytes_of_slice_from h input pos) in
let _ = valid_facts (parse_sum t p pc) h input pos in
let _ = valid_facts (parse_enum_key p (sum_enum t)) h input pos in
()
inline_for_extraction
let read_sum_tag
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(p32: leaf_reader p)
(destr: dep_maybe_enum_destr_t (sum_enum t) (read_enum_key_t (sum_enum t)))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: HST.Stack (sum_key t)
(requires (fun h ->
valid (parse_sum t p pc) h input pos
))
(ensures (fun h res h' ->
B.modifies B.loc_none h h' /\
res == sum_tag_of_data t (contents (parse_sum t p pc) h input pos)
))
= let h = HST.get () in
[@inline_let] let _ = valid_sum_elim_tag h t p pc input pos in
read_enum_key p32 (sum_enum t) destr input pos
inline_for_extraction
let jump_sum_aux
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(v: jumper p)
(p32: leaf_reader p)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(v_payload: ((k: sum_repr_type t)) -> Tot (jump_sum_aux_payload_t t pc (maybe_enum_key_of_repr (sum_enum t) k)))
: Tot (jumper (parse_sum t p pc))
= fun #rrel #rel input pos ->
let h = HST.get () in
[@inline_let]
let _ = valid_sum_elim h t p pc input pos in
let pos_after_tag = v input pos in
let k' = p32 input pos in
v_payload k' input pos_after_tag
inline_for_extraction
let jump_sum_aux_payload'
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (jumper (dsnd (pc x)))))
(k: maybe_enum_key (sum_enum t))
: Tot (jump_sum_aux_payload_t t pc k)
= fun #rrel #rel input pos ->
match k with
| Known k ->
[@inline_let]
let _ = synth_sum_case_injective t k in
pc32 k input pos
| _ -> 0ul // dummy, but we MUST NOT remove this branch, otherwise extraction fails
inline_for_extraction
let jump_sum_aux_payload
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (jumper (dsnd (pc x)))))
(destr: dep_maybe_enum_destr_t (sum_enum t) (jump_sum_aux_payload_t t pc))
(k: sum_repr_type t)
: Tot (jump_sum_aux_payload_t t pc (maybe_enum_key_of_repr (sum_enum t) k))
= destr (jump_sum_aux_payload_eq t pc) (jump_sum_aux_payload_if t pc) (fun _ _ -> ()) (fun _ _ _ _ -> ()) (jump_sum_aux_payload' t pc pc32) k
inline_for_extraction
let jump_sum
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(v: jumper p)
(p32: leaf_reader p)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (jumper (dsnd (pc x)))))
(destr: dep_maybe_enum_destr_t (sum_enum t) (jump_sum_aux_payload_t t pc))
: Tot (jumper (parse_sum t p pc))
= jump_sum_aux t v p32 pc (jump_sum_aux_payload t pc pc32 destr)
inline_for_extraction
let read_sum_cases'
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (leaf_reader (dsnd (pc x)))))
(k: sum_key t)
: Tot (leaf_reader (parse_sum_cases' t pc k))
= [@inline_let]
let _ = synth_sum_case_injective t k in
read_synth'
(dsnd (pc k))
(synth_sum_case t k)
(pc32 k)
()
inline_for_extraction
let read_sum_cases_t
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot Type
= leaf_reader (parse_sum_cases' t pc k)
let read_sum_cases_t_eq
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
(x y : read_sum_cases_t t pc k)
: GTot Type0
= True
inline_for_extraction
let read_sum_cases_t_if
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (if_combinator _ (read_sum_cases_t_eq t pc k))
= fun cond (sv_true: cond_true cond -> Tot (read_sum_cases_t t pc k)) (sv_false: cond_false cond -> Tot (read_sum_cases_t t pc k)) #_ #_ input pos ->
if cond
then (sv_true () input pos)
else (sv_false () input pos)
inline_for_extraction
let read_sum_cases
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (leaf_reader (dsnd (pc x)))))
(destr: dep_enum_destr (sum_enum t) (read_sum_cases_t t pc))
(k: sum_key t)
: Tot (leaf_reader (parse_sum_cases' t pc k))
= destr
_
(read_sum_cases_t_if t pc)
(fun _ _ -> ())
(fun _ _ _ _ -> ())
(read_sum_cases' t pc pc32)
k
#push-options "--z3rlimit 32"
inline_for_extraction
let read_sum
(#kt: parser_kind)
(t: sum)
(p: parser kt (sum_repr_type t))
(p32: leaf_reader (parse_enum_key p (sum_enum t)))
(j: jumper p)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (leaf_reader (dsnd (pc x)))))
(destr: dep_enum_destr (sum_enum t) (read_sum_cases_t t pc))
: Tot (leaf_reader (parse_sum t p pc))
=
fun #_ #_ input pos ->
let h = HST.get () in
valid_facts (parse_sum t p pc) h input pos;
parse_sum_eq' t p pc (bytes_of_slice_from h input pos);
valid_facts (parse_enum_key p (sum_enum t)) h input pos;
let k = p32 input pos in
let pos' = jump_enum_key j (sum_enum t) input pos in
valid_facts (parse_sum_cases' t pc k) h input pos' ;
read_sum_cases t pc pc32 destr k input pos'
#pop-options
inline_for_extraction
let serialize32_sum_cases_t
(t: sum)
(#pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(sc: ((x: sum_key t) -> Tot (serializer (dsnd (pc x)))))
(k: sum_key t)
: Tot Type
= serializer32 (serialize_sum_cases t pc sc k)
let serialize32_sum_cases_t_eq
(t: sum)
(#pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(sc: ((x: sum_key t) -> Tot (serializer (dsnd (pc x)))))
(k: sum_key t)
(x y: serialize32_sum_cases_t t sc k)
: GTot Type0
= True
inline_for_extraction
let serialize32_sum_cases_t_if
(t: sum)
(#pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(sc: ((x: sum_key t) -> Tot (serializer (dsnd (pc x)))))
(k: sum_key t)
: Tot (if_combinator _ (serialize32_sum_cases_t_eq t sc k))
= fun cond (sv_true: (cond_true cond -> Tot (serialize32_sum_cases_t t sc k))) (sv_false: (cond_false cond -> Tot (serialize32_sum_cases_t t sc k))) x #rrel #rel b pos ->
if cond
then (sv_true () x b pos)
else (sv_false () x b pos)
inline_for_extraction
let serialize32_sum_cases_aux
(t: sum)
(#pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(sc: ((x: sum_key t) -> Tot (serializer (dsnd (pc x)))))
(sc32: ((x: sum_key t) -> Tot (serializer32 (sc x))))
(k: sum_key t)
: Tot (serializer32 (serialize_sum_cases t pc sc k))
= fun x #rrel #rel b pos ->
[@inline_let] let _ =
Classical.forall_intro (parse_sum_cases_eq' t pc k);
synth_sum_case_injective t k;
synth_sum_case_inverse t k
in
serialize32_synth
(sc32 k)
(synth_sum_case t k)
(synth_sum_case_recip t k)
(fun x -> synth_sum_case_recip t k x)
()
x
b
pos
inline_for_extraction
let serialize32_sum_cases
(t: sum)
(#pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(sc: ((x: sum_key t) -> Tot (serializer (dsnd (pc x)))))
(sc32: ((x: sum_key t) -> Tot (serializer32 (sc x))))
(destr: dep_enum_destr (sum_enum t) (serialize32_sum_cases_t t sc))
(k: sum_key t)
: Tot (serializer32 (serialize_sum_cases t pc sc k))
= destr
_
(serialize32_sum_cases_t_if t sc)
(fun _ _ -> ())
(fun _ _ _ _ -> ())
(serialize32_sum_cases_aux t sc sc32)
k
inline_for_extraction
let serialize32_sum
(#kt: parser_kind)
(t: sum)
(#p: parser kt (sum_repr_type t))
(s: serializer p {kt.parser_kind_subkind == Some ParserStrong})
(s32: serializer32 (serialize_enum_key _ s (sum_enum t)))
(#pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(sc: ((x: sum_key t) -> Tot (serializer (dsnd (pc x)))))
(sc32: ((x: sum_key t) -> Tot (serializer32 (sc x))))
(destr: dep_enum_destr (sum_enum t) (serialize32_sum_cases_t t sc))
: Tot (serializer32 (serialize_sum t s sc))
= fun x #rrel #rel b pos ->
serialize_sum_eq t s sc x;
let tg = sum_tag_of_data t x in
serialize32_nondep_then_aux s32 (serialize32_sum_cases t sc sc32 destr tg) tg x b pos
let clens_sum_tag
(s: sum)
: Tot (clens (sum_type s) (sum_key s))
= {
clens_cond = (fun _ -> True);
clens_get = sum_tag_of_data s;
}
let gaccessor_sum_tag
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
: Tot (gaccessor (parse_sum t p pc) (parse_enum_key p (sum_enum t)) (clens_sum_tag t))
= gaccessor_tagged_union_tag
(parse_enum_key p (sum_enum t))
(sum_tag_of_data t)
(parse_sum_cases t pc)
inline_for_extraction
let accessor_sum_tag
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
: Tot (accessor (gaccessor_sum_tag t p pc))
= accessor_tagged_union_tag
(parse_enum_key p (sum_enum t))
(sum_tag_of_data t)
(parse_sum_cases t pc)
let clens_sum_payload
(s: sum)
(k: sum_key s)
: Tot (clens (sum_type s) (sum_type_of_tag s k))
= {
clens_cond = (fun (x: sum_type s) -> sum_tag_of_data s x == k);
clens_get = (fun (x: sum_type s) -> synth_sum_case_recip s k x <: Ghost (sum_type_of_tag s k) (requires (sum_tag_of_data s x == k)) (ensures (fun _ -> True)));
}
#push-options "--z3rlimit 32"
let gaccessor_clens_sum_payload'
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (gaccessor' (parse_sum t p pc) (dsnd (pc k)) (clens_sum_payload t k))
= fun (input: bytes) ->
parse_sum_eq'' t p pc input;
let res =
match parse p input with
| Some (_, consumed) ->
synth_sum_case_inverse t k;
synth_sum_case_injective t k;
synth_injective_synth_inverse_synth_inverse_recip (synth_sum_case t k) (synth_sum_case_recip t k) ();
(consumed)
| _ -> 0 // dummy
in
(res <: (res: _ { gaccessor_post' (parse_sum t p pc) (dsnd (pc k)) (clens_sum_payload t k) input res } ))
#push-options "--z3rlimit 64"
let gaccessor_clens_sum_payload_injective
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
(sl sl' : bytes)
: Lemma
(requires (
gaccessor_pre (parse_sum t p pc) (dsnd (pc k)) (clens_sum_payload t k) sl /\
gaccessor_pre (parse_sum t p pc) (dsnd (pc k)) (clens_sum_payload t k) sl' /\
injective_precond (parse_sum t p pc) sl sl'
))
(ensures (gaccessor_clens_sum_payload' t p pc k sl == gaccessor_clens_sum_payload' t p pc k sl'))
= parse_sum_eq'' t p pc sl;
parse_sum_eq'' t p pc sl' ;
parse_injective (parse_sum t p pc) sl sl' ;
parse_injective p sl sl'
#pop-options
let gaccessor_clens_sum_payload_no_lookahead
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
(sl sl' : bytes)
: Lemma
(requires (
(parse_sum_kind kt t pc).parser_kind_subkind == Some ParserStrong /\
gaccessor_pre (parse_sum t p pc) (dsnd (pc k)) (clens_sum_payload t k) sl /\
gaccessor_pre (parse_sum t p pc) (dsnd (pc k)) (clens_sum_payload t k) sl' /\
no_lookahead_on_precond (parse_sum t p pc) sl sl'
))
(ensures (gaccessor_clens_sum_payload' t p pc k sl == gaccessor_clens_sum_payload' t p pc k sl'))
= parse_sum_eq'' t p pc sl;
parse_sum_eq'' t p pc sl' ;
parse_strong_prefix (parse_sum t p pc) sl sl' ;
parse_injective p sl sl'
let gaccessor_clens_sum_payload
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (gaccessor (parse_sum t p pc) (dsnd (pc k)) (clens_sum_payload t k))
= Classical.forall_intro_2 (fun x -> Classical.move_requires (gaccessor_clens_sum_payload_injective t p pc k x));
Classical.forall_intro_2 (fun x -> Classical.move_requires (gaccessor_clens_sum_payload_no_lookahead t p pc k x));
gaccessor_prop_equiv (parse_sum t p pc) (dsnd (pc k)) (clens_sum_payload t k) (gaccessor_clens_sum_payload' t p pc k);
gaccessor_clens_sum_payload' t p pc k
inline_for_extraction
let accessor_clens_sum_payload'
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(j: jumper p)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: HST.Stack U32.t
(requires (fun h ->
valid (parse_sum t p pc) h input pos /\
(clens_sum_payload t k).clens_cond (contents (parse_sum t p pc) h input pos)
))
(ensures (fun h pos' h' ->
B.modifies B.loc_none h h' /\
pos' == slice_access h (gaccessor_clens_sum_payload t p pc k) input pos
))
=
let h = HST.get () in
[@inline_let]
let _ =
let pos' = get_valid_pos (parse_sum t p pc) h input pos in
let large = bytes_of_slice_from h input pos in
slice_access_eq h (gaccessor_clens_sum_payload t p pc k) input pos;
valid_facts (parse_sum t p pc) h input pos;
parse_sum_eq'' t p pc large;
valid_facts p h input pos
in
j input pos
#pop-options
inline_for_extraction
let accessor_clens_sum_payload
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(j: jumper p)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (accessor (gaccessor_clens_sum_payload t p pc k))
= fun #rrel #rel -> accessor_clens_sum_payload' t j pc k #rrel #rel
let clens_sum_cases_payload
(s: sum)
(k: sum_key s)
: Tot (clens (sum_cases s k) (sum_type_of_tag s k))
= {
clens_cond = (fun (x: sum_cases s k) -> True);
clens_get = (fun (x: sum_cases s k) -> synth_sum_case_recip s k x <: Ghost (sum_type_of_tag s k) (requires (True)) (ensures (fun _ -> True)));
}
let gaccessor_clens_sum_cases_payload
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (gaccessor (parse_sum_cases' t pc k) (dsnd (pc k)) (clens_sum_cases_payload t k))
= synth_sum_case_injective t k;
synth_sum_case_inverse t k;
synth_injective_synth_inverse_synth_inverse_recip (synth_sum_case t k) (synth_sum_case_recip t k) ();
gaccessor_ext
(gaccessor_synth (dsnd (pc k)) (synth_sum_case t k) (synth_sum_case_recip t k) ())
(clens_sum_cases_payload t k)
()
inline_for_extraction
let accessor_clens_sum_cases_payload
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (accessor (gaccessor_clens_sum_cases_payload t pc k))
= [@inline_let]
let _ =
synth_sum_case_injective t k;
synth_sum_case_inverse t k;
synth_injective_synth_inverse_synth_inverse_recip (synth_sum_case t k) (synth_sum_case_recip t k) ()
in
accessor_ext
(accessor_synth (dsnd (pc k)) (synth_sum_case t k) (synth_sum_case_recip t k) ())
(clens_sum_cases_payload t k)
()
inline_for_extraction
let validate_dsum_cases_t
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(#k: parser_kind)
(g: parser k (dsum_type_of_unknown_tag s))
(x: dsum_key s)
: Tot Type
= validator (parse_dsum_cases' s f g x)
let validate_dsum_cases_eq
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(#k: parser_kind)
(g: parser k (dsum_type_of_unknown_tag s))
(x: dsum_key s)
(v1 v2 : validate_dsum_cases_t s f g x)
: GTot Type0
= True
inline_for_extraction
let validate_dsum_cases_if'
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(#k: parser_kind)
(g: parser k (dsum_type_of_unknown_tag s))
(x: dsum_key s)
(cond: bool)
(ift: (cond_true cond -> Tot (validate_dsum_cases_t s f g x)))
(iff: (cond_false cond -> Tot (validate_dsum_cases_t s f g x)))
: Tot (validate_dsum_cases_t s f g x)
= fun #rrel #rel input len ->
if cond
then (ift () <: validate_dsum_cases_t s f g x) input len
else (iff () <: validate_dsum_cases_t s f g x) input len
inline_for_extraction
let validate_dsum_cases_if
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(#k: parser_kind)
(g: parser k (dsum_type_of_unknown_tag s))
(x: dsum_key s)
: Tot (if_combinator _ (validate_dsum_cases_eq s f g x))
= validate_dsum_cases_if' s f g x
inline_for_extraction
let validate_dsum_cases'
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(f' : (x: dsum_known_key s) -> Tot (validator (dsnd (f x))))
(#k: parser_kind)
(#g: parser k (dsum_type_of_unknown_tag s))
(g' : validator g)
(x: dsum_key s)
: Tot (validate_dsum_cases_t s f g x)
= [@inline_let]
let _ = synth_dsum_case_injective s x in
match x with
| Known x' -> validate_synth (f' x') (synth_dsum_case s (Known x')) () <: validator (parse_dsum_cases' s f g x)
| Unknown x' -> validate_synth g' (synth_dsum_case s (Unknown x')) () <: validator (parse_dsum_cases' s f g x)
inline_for_extraction
let validate_dsum_cases'_destr
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(f' : (x: dsum_known_key s) -> Tot (validator (dsnd (f x))))
(#k: parser_kind)
(#g: parser k (dsum_type_of_unknown_tag s))
(g' : validator g)
(destr: dep_enum_destr _ (fun k -> validate_dsum_cases_t s f g (Known k)))
(x: dsum_key s)
: Tot (validate_dsum_cases_t s f g x)
= fun #rrel #rel input pos ->
match x with
| Known k ->
destr
_
(fun k -> validate_dsum_cases_if s f g (Known k))
(fun _ _ -> ())
(fun _ _ _ _ -> ())
(fun k -> validate_dsum_cases' s f f' g' (Known k))
k
input
pos
| Unknown r -> validate_dsum_cases' s f f' g' (Unknown r) input pos
inline_for_extraction
let validate_dsum_cases
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(f' : (x: dsum_known_key s) -> Tot (validator (dsnd (f x))))
(#k: parser_kind)
(#g: parser k (dsum_type_of_unknown_tag s))
(g' : validator g)
(destr: dep_enum_destr _ (fun k -> validate_dsum_cases_t s f g (Known k)))
(x: dsum_key s)
: Tot (validator (parse_dsum_cases s f g x))
= fun #rrel #rel input pos ->
let h = HST.get () in
[@inline_let]
let _ =
valid_facts (parse_dsum_cases' s f g x) h input (uint64_to_uint32 pos);
valid_facts (parse_dsum_cases s f g x) h input (uint64_to_uint32 pos);
parse_dsum_cases_eq' s f g x (bytes_of_slice_from h input (uint64_to_uint32 pos))
in
validate_dsum_cases'_destr s f f' g' destr x input pos
#push-options "--z3rlimit 40"
inline_for_extraction
let validate_dsum
(#kt: parser_kind)
(t: dsum)
(#p: parser kt (dsum_repr_type t))
(v: validator p)
(p32: leaf_reader p)
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(f32: (x: dsum_known_key t) -> Tot (validator (dsnd (f x))))
(#k': parser_kind)
(#g: parser k' (dsum_type_of_unknown_tag t))
(g32: validator g)
(destr: dep_maybe_enum_destr_t (dsum_enum t) (validate_dsum_cases_t t f g))
: Tot (validator (parse_dsum t p f g))
= fun #rrel #rel input pos ->
let h = HST.get () in
[@inline_let]
let _ = parse_dsum_eq' t p f g (bytes_of_slice_from h input (uint64_to_uint32 pos)) in
[@inline_let]
let _ = valid_facts (parse_dsum t p f g) h input (uint64_to_uint32 pos) in
[@inline_let]
let _ = valid_facts p h input (uint64_to_uint32 pos) in
let pos_after_tag = v input pos in
if is_error pos_after_tag
then pos_after_tag
else
let tg = p32 input (uint64_to_uint32 pos) in
[@inline_let]
let _ = valid_facts (parse_dsum_cases' t f g (maybe_enum_key_of_repr (dsum_enum t) tg)) h input (uint64_to_uint32 pos_after_tag) in
destr (validate_dsum_cases_eq t f g) (validate_dsum_cases_if t f g) (fun _ _ -> ()) (fun _ _ _ _ -> ()) (validate_dsum_cases' t f f32 g32) tg input pos_after_tag
#pop-options
#reset-options "--z3rlimit 64 --z3cliopt smt.arith.nl=false --initial_ifuel 8 --max_ifuel 8 --initial_fuel 2 --max_fuel 2"
let valid_dsum_intro_known
(h: HS.mem)
(t: dsum)
(#kt: parser_kind)
(p: parser kt (dsum_repr_type t))
(f: ((x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x))))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: Lemma
(requires (
valid (parse_maybe_enum_key p (dsum_enum t)) h input pos /\ (
let k' = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
Known? k' /\ (
let Known k = k' in
valid (dsnd (f k)) h input (get_valid_pos (parse_maybe_enum_key p (dsum_enum t)) h input pos)
))))
(ensures (
let Known k = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
let pos_payload = get_valid_pos (parse_maybe_enum_key p (dsum_enum t)) h input pos in
valid_content_pos
(parse_dsum t p f g) h input pos
(synth_dsum_case t (Known k) (contents (dsnd (f k)) h input pos_payload))
(get_valid_pos (dsnd (f k)) h input pos_payload)
))
= valid_facts (parse_maybe_enum_key p (dsum_enum t)) h input pos;
let Known k = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
let pos_payload = get_valid_pos (parse_maybe_enum_key p (dsum_enum t)) h input pos in
valid_facts (dsnd (f k)) h input pos_payload;
valid_facts (parse_dsum t p f g) h input pos;
parse_dsum_eq t p f g (bytes_of_slice_from h input pos)
let valid_dsum_intro_unknown
(h: HS.mem)
(t: dsum)
(#kt: parser_kind)
(p: parser kt (dsum_repr_type t))
(f: ((x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x))))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: Lemma
(requires (
valid (parse_maybe_enum_key p (dsum_enum t)) h input pos /\ (
let k' = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
Unknown? k' /\
valid g h input (get_valid_pos (parse_maybe_enum_key p (dsum_enum t)) h input pos)
)))
(ensures (
let Unknown r = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
let pos_payload = get_valid_pos (parse_maybe_enum_key p (dsum_enum t)) h input pos in
valid_content_pos
(parse_dsum t p f g) h input pos
(synth_dsum_case t (Unknown r) (contents g h input pos_payload))
(get_valid_pos g h input pos_payload)
))
= valid_facts (parse_maybe_enum_key p (dsum_enum t)) h input pos;
let Unknown r = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
let pos_payload = get_valid_pos (parse_maybe_enum_key p (dsum_enum t)) h input pos in
valid_facts g h input pos_payload;
valid_facts (parse_dsum t p f g) h input pos;
parse_dsum_eq t p f g (bytes_of_slice_from h input pos)
#reset-options
inline_for_extraction
let finalize_dsum_case_known
(t: dsum)
(#kt: parser_kind)
(#p: parser kt (dsum_repr_type t))
(s: serializer p)
(w: leaf_writer_strong s)
(f: ((x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x))))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
(destr: enum_repr_of_key'_t (dsum_enum t))
(k: dsum_known_key t)
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: HST.Stack unit
(requires (fun h ->
let len_tag = serialized_length (serialize_enum_key _ s (dsum_enum t)) k in
U32.v pos + len_tag < 4294967296 /\ (
let pos_payload = pos `U32.add` U32.uint_to_t len_tag in
valid (dsnd (f k)) h input pos_payload /\
writable input.base (U32.v pos) (U32.v pos_payload) h
)))
(ensures (fun h _ h' ->
let len_tag = serialized_length (serialize_enum_key _ s (dsum_enum t)) k in
let pos_payload = pos `U32.add` U32.uint_to_t len_tag in
B.modifies (loc_slice_from_to input pos pos_payload) h h' /\
valid_content_pos (parse_dsum t p f g) h' input pos (synth_dsum_case t (Known k) (contents (dsnd (f k)) h input pos_payload)) (get_valid_pos (dsnd (f k)) h input pos_payload)
))
= let pos1 = write_enum_key w (dsum_enum t) destr k input pos in
let h = HST.get () in
[@inline_let]
let _ =
valid_facts (parse_enum_key p (dsum_enum t)) h input pos;
valid_facts (parse_maybe_enum_key p (dsum_enum t)) h input pos;
let sq = bytes_of_slice_from h input pos in
parse_enum_key_eq p (dsum_enum t) sq;
parse_maybe_enum_key_eq p (dsum_enum t) sq;
valid_dsum_intro_known h t p f g input pos
in
()
inline_for_extraction
let finalize_dsum_case_unknown
(t: dsum)
(#kt: parser_kind)
(#p: parser kt (dsum_repr_type t))
(s: serializer p)
(w: leaf_writer_strong s)
(f: ((x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x))))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
(r: unknown_enum_repr (dsum_enum t))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: HST.Stack unit
(requires (fun h ->
let len_tag = serialized_length s r in
U32.v pos + len_tag < 4294967296 /\ (
let pos_payload = pos `U32.add` U32.uint_to_t len_tag in
valid g h input pos_payload /\
writable input.base (U32.v pos) (U32.v pos_payload) h
)))
(ensures (fun h _ h' ->
let len_tag = serialized_length s r in
let pos_payload = pos `U32.add` U32.uint_to_t len_tag in
B.modifies (loc_slice_from_to input pos pos_payload) h h' /\
valid_content_pos (parse_dsum t p f g) h' input pos (synth_dsum_case t (Unknown r) (contents g h input pos_payload)) (get_valid_pos g h input pos_payload)
))
= let pos1 = w r input pos in
let h = HST.get () in
[@inline_let]
let _ =
valid_facts (parse_maybe_enum_key p (dsum_enum t)) h input pos;
valid_facts p h input pos;
let sq = bytes_of_slice_from h input pos in
parse_maybe_enum_key_eq p (dsum_enum t) sq;
valid_dsum_intro_unknown h t p f g input pos
in
()
let valid_dsum_elim_tag
(h: HS.mem)
(t: dsum)
(#kt: parser_kind)
(p: parser kt (dsum_repr_type t))
(f: ((x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x))))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: Lemma
(requires (
valid (parse_dsum t p f g) h input pos
))
(ensures (
valid (parse_maybe_enum_key p (dsum_enum t)) h input pos /\
contents (parse_maybe_enum_key p (dsum_enum t)) h input pos == dsum_tag_of_data t (contents (parse_dsum t p f g) h input pos)
))
= let _ = parse_dsum_eq_ t p f g (bytes_of_slice_from h input pos) in
let _ = valid_facts (parse_dsum t p f g) h input pos in
let _ = valid_facts (parse_maybe_enum_key p (dsum_enum t)) h input pos in
()
inline_for_extraction
let read_dsum_tag
(t: dsum)
(#kt: parser_kind)
(#p: parser kt (dsum_repr_type t))
(p32: leaf_reader p)
(destr: maybe_enum_destr_t (maybe_enum_key (dsum_enum t)) (dsum_enum t))
(f: ((x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x))))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: HST.Stack (dsum_key t)
(requires (fun h ->
valid (parse_dsum t p f g) h input pos
))
(ensures (fun h res h' ->
B.modifies B.loc_none h h' /\
res == dsum_tag_of_data t (contents (parse_dsum t p f g) h input pos)
))
= let h = HST.get () in
[@inline_let] let _ = valid_dsum_elim_tag h t p f g input pos in
read_maybe_enum_key p32 (dsum_enum t) destr input pos
#push-options "--z3rlimit 32"
let valid_dsum_elim_known
(h: HS.mem)
(t: dsum)
(#kt: parser_kind)
(p: parser kt (dsum_repr_type t))
(f: ((x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x))))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: Lemma
(requires (
valid (parse_dsum t p f g) h input pos /\
Known? (dsum_tag_of_data t (contents (parse_dsum t p f g) h input pos))
))
(ensures (
valid (parse_maybe_enum_key p (dsum_enum t)) h input pos /\ (
let k' = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
let pos_payload = get_valid_pos (parse_maybe_enum_key p (dsum_enum t)) h input pos in
Known? k' /\ (
let Known k = k' in
valid (dsnd (f k)) h input pos_payload /\
valid_content_pos
(parse_dsum t p f g) h input pos
(synth_dsum_case t (Known k) (contents (dsnd (f k)) h input pos_payload))
(get_valid_pos (dsnd (f k)) h input pos_payload)
))))
=
valid_facts (parse_dsum t p f g) h input pos;
parse_dsum_eq t p f g (bytes_of_slice_from h input pos);
valid_facts (parse_maybe_enum_key p (dsum_enum t)) h input pos;
let Known k = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
let pos_payload = get_valid_pos (parse_maybe_enum_key p (dsum_enum t)) h input pos in
valid_facts (dsnd (f k)) h input pos_payload
#pop-options
let valid_dsum_elim_unknown
(h: HS.mem)
(t: dsum)
(#kt: parser_kind)
(p: parser kt (dsum_repr_type t))
(f: ((x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x))))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: Lemma
(requires (
valid (parse_dsum t p f g) h input pos /\
Unknown? (dsum_tag_of_data t (contents (parse_dsum t p f g) h input pos))
))
(ensures (
valid (parse_maybe_enum_key p (dsum_enum t)) h input pos /\ (
let k' = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
let pos_payload = get_valid_pos (parse_maybe_enum_key p (dsum_enum t)) h input pos in
Unknown? k' /\ (
let Unknown r = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
valid g h input pos_payload /\
valid_content_pos
(parse_dsum t p f g) h input pos
(synth_dsum_case t (Unknown r) (contents g h input pos_payload))
(get_valid_pos g h input pos_payload)
))))
=
valid_facts (parse_dsum t p f g) h input pos;
parse_dsum_eq t p f g (bytes_of_slice_from h input pos);
valid_facts (parse_maybe_enum_key p (dsum_enum t)) h input pos;
let Unknown r = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
let pos_payload = get_valid_pos (parse_maybe_enum_key p (dsum_enum t)) h input pos in
valid_facts g h input pos_payload
inline_for_extraction
let jump_dsum_cases_t
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(#k: parser_kind)
(g: parser k (dsum_type_of_unknown_tag s))
(x: dsum_key s)
: Tot Type
= jumper (parse_dsum_cases' s f g x)
let jump_dsum_cases_eq
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(#k: parser_kind)
(g: parser k (dsum_type_of_unknown_tag s))
(x: dsum_key s)
(v1 v2 : jump_dsum_cases_t s f g x)
: GTot Type0
= True
inline_for_extraction
let jump_dsum_cases_if'
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(#k: parser_kind)
(g: parser k (dsum_type_of_unknown_tag s))
(x: dsum_key s)
(cond: bool)
(ift: (cond_true cond -> Tot (jump_dsum_cases_t s f g x)))
(iff: (cond_false cond -> Tot (jump_dsum_cases_t s f g x)))
: Tot (jump_dsum_cases_t s f g x)
= fun #rrel #rel input len ->
if cond
then (ift () <: jump_dsum_cases_t s f g x) input len
else (iff () <: jump_dsum_cases_t s f g x) input len
inline_for_extraction
let jump_dsum_cases_if
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(#k: parser_kind)
(g: parser k (dsum_type_of_unknown_tag s))
(x: dsum_key s)
: Tot (if_combinator _ (jump_dsum_cases_eq s f g x))
= jump_dsum_cases_if' s f g x
inline_for_extraction
let jump_dsum_cases'
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(f' : (x: dsum_known_key s) -> Tot (jumper (dsnd (f x))))
(#k: parser_kind)
(#g: parser k (dsum_type_of_unknown_tag s))
(g' : jumper g)
(x: dsum_key s)
: Tot (jump_dsum_cases_t s f g x)
= synth_dsum_case_injective s x;
match x with
| Known x' -> jump_synth (f' x') (synth_dsum_case s (Known x')) () <: jumper (parse_dsum_cases' s f g x)
| Unknown x' -> jump_synth g' (synth_dsum_case s (Unknown x')) () <: jumper (parse_dsum_cases' s f g x)
inline_for_extraction
let jump_dsum_cases'_destr
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(f' : (x: dsum_known_key s) -> Tot (jumper (dsnd (f x))))
(#k: parser_kind)
(#g: parser k (dsum_type_of_unknown_tag s))
(g' : jumper g)
(destr: dep_enum_destr _ (fun k -> jump_dsum_cases_t s f g (Known k)))
(x: dsum_key s)
: Tot (jump_dsum_cases_t s f g x)
= fun #rrel #rel input pos ->
match x with
| Known k ->
destr
_
(fun k -> jump_dsum_cases_if s f g (Known k))
(fun _ _ -> ())
(fun _ _ _ _ -> ())
(fun k -> jump_dsum_cases' s f f' g' (Known k))
k
input
pos
| Unknown r -> jump_dsum_cases' s f f' g' (Unknown r) input pos
inline_for_extraction
let jump_dsum_cases
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(f' : (x: dsum_known_key s) -> Tot (jumper (dsnd (f x))))
(#k: parser_kind)
(#g: parser k (dsum_type_of_unknown_tag s))
(g' : jumper g)
(destr: dep_enum_destr _ (fun k -> jump_dsum_cases_t s f g (Known k)))
(x: dsum_key s)
: Tot (jumper (parse_dsum_cases s f g x))
= fun #rrel #rel input pos ->
let h = HST.get () in
[@inline_let]
let _ =
valid_facts (parse_dsum_cases' s f g x) h input pos;
valid_facts (parse_dsum_cases s f g x) h input pos;
parse_dsum_cases_eq' s f g x (bytes_of_slice_from h input pos)
in
jump_dsum_cases'_destr s f f' g' destr x input pos
#push-options "--z3rlimit 16"
inline_for_extraction
let jump_dsum
(#kt: parser_kind)
(t: dsum)
(#p: parser kt (dsum_repr_type t))
(v: jumper p)
(p32: leaf_reader p)
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(f32: (x: dsum_known_key t) -> Tot (jumper (dsnd (f x))))
(#k': parser_kind)
(#g: parser k' (dsum_type_of_unknown_tag t))
(g32: jumper g)
(destr: dep_maybe_enum_destr_t (dsum_enum t) (jump_dsum_cases_t t f g))
: Tot (jumper (parse_dsum t p f g))
= fun #rrel #rel input pos ->
let h = HST.get () in
[@inline_let]
let _ = parse_dsum_eq' t p f g (bytes_of_slice_from h input pos) in
[@inline_let]
let _ = valid_facts (parse_dsum t p f g) h input pos in
[@inline_let]
let _ = valid_facts p h input pos in
let pos_after_tag = v input pos in
let tg = p32 input pos in
[@inline_let]
let _ = valid_facts (parse_dsum_cases' t f g (maybe_enum_key_of_repr (dsum_enum t) tg)) h input pos_after_tag in
destr (jump_dsum_cases_eq t f g) (jump_dsum_cases_if t f g) (fun _ _ -> ()) (fun _ _ _ _ -> ()) (jump_dsum_cases' t f f32 g32) tg input pos_after_tag
#pop-options
inline_for_extraction
let read_dsum_cases'
(t: dsum)
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(f32: (x: dsum_known_key t) -> Tot (leaf_reader (dsnd (f x))))
(#k': parser_kind)
(g: parser k' (dsum_type_of_unknown_tag t))
(g32: leaf_reader g)
(x: dsum_key t)
: Tot (leaf_reader (parse_dsum_cases' t f g x))
= fun #rrel #rel input pos ->
[@inline_let]
let _ = synth_dsum_case_injective t x in
match x with
| Known x' ->
read_synth'
(dsnd (f x'))
(synth_dsum_case t (Known x'))
(f32 x')
()
input
pos
| Unknown x' ->
read_synth'
g
(synth_dsum_case t (Unknown x'))
g32
()
input
pos
inline_for_extraction
let read_dsum_cases_t
(t: dsum)
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(#k': parser_kind)
(g: parser k' (dsum_type_of_unknown_tag t))
(k: dsum_known_key t)
: Tot Type
= leaf_reader (parse_dsum_cases' t f g (Known k))
let read_dsum_cases_t_eq
(t: dsum)
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(#k': parser_kind)
(g: parser k' (dsum_type_of_unknown_tag t))
(k: dsum_known_key t)
(x y : read_dsum_cases_t t f g k)
: GTot Type0
= True
inline_for_extraction
let read_dsum_cases_t_if
(t: dsum)
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(#k': parser_kind)
(g: parser k' (dsum_type_of_unknown_tag t))
(k: dsum_known_key t)
: Tot (if_combinator _ (read_dsum_cases_t_eq t f g k))
= fun cond (sv_true: cond_true cond -> Tot (read_dsum_cases_t t f g k)) (sv_false: cond_false cond -> Tot (read_dsum_cases_t t f g k)) #_ #_ input pos ->
if cond
then sv_true () input pos
else sv_false () input pos
inline_for_extraction
let read_dsum_cases
(t: dsum)
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(f32: (x: dsum_known_key t) -> Tot (leaf_reader (dsnd (f x))))
(#k': parser_kind)
(g: parser k' (dsum_type_of_unknown_tag t))
(g32: leaf_reader g)
(destr: dep_enum_destr _ (read_dsum_cases_t t f g))
(x: dsum_key t)
: Tot (leaf_reader (parse_dsum_cases' t f g x))
= fun #_ #_ input pos ->
match x with
| Known k ->
destr
_
(read_dsum_cases_t_if t f g)
(fun _ _ -> ())
(fun _ _ _ _ -> ())
(fun k -> read_dsum_cases' t f f32 g g32 (Known k))
k
input
pos
| Unknown r ->
read_dsum_cases' t f f32 g g32 (Unknown r) input pos
#push-options "--z3rlimit 16"
inline_for_extraction
let read_dsum
(#kt: parser_kind)
(t: dsum)
(#p: parser kt (dsum_repr_type t))
(p32: leaf_reader (parse_maybe_enum_key p (dsum_enum t)))
(j: jumper p)
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(f32: (x: dsum_known_key t) -> Tot (leaf_reader (dsnd (f x))))
(#k': parser_kind)
(#g: parser k' (dsum_type_of_unknown_tag t))
(g32: leaf_reader g)
(destr: dep_enum_destr _ (read_dsum_cases_t t f g))
: Tot (leaf_reader (parse_dsum t p f g))
= fun #_ #_ input pos ->
let h = HST.get () in
valid_facts (parse_dsum t p f g) h input pos;
parse_dsum_eq_ t p f g (bytes_of_slice_from h input pos);
valid_facts (parse_maybe_enum_key p (dsum_enum t)) h input pos;
let k = p32 input pos in
let pos' = jump_maybe_enum_key j (dsum_enum t) input pos in
valid_facts (parse_dsum_cases' t f g k) h input pos' ;
read_dsum_cases t f f32 g g32 destr k input pos'
#pop-options
inline_for_extraction
let serialize32_dsum_type_of_tag
(t: dsum)
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(sf: (x: dsum_known_key t) -> Tot (serializer (dsnd (f x))))
(sf32: (x: dsum_known_key t) -> Tot (serializer32 (sf x)))
(#k': parser_kind)
(#g: parser k' (dsum_type_of_unknown_tag t))
(#sg: serializer g)
(sg32: serializer32 sg)
(tg: dsum_key t)
: Tot (serializer32 (serialize_dsum_type_of_tag t f sf g sg tg))
= match tg with
| Known x' -> serialize32_ext (dsnd (f x')) (sf x') (sf32 x') (parse_dsum_type_of_tag t f g tg) ()
| Unknown x' -> serialize32_ext g sg sg32 (parse_dsum_type_of_tag t f g tg) ()
inline_for_extraction
let serialize32_dsum_cases_aux
(t: dsum)
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(sf: (x: dsum_known_key t) -> Tot (serializer (dsnd (f x))))
(sf32: (x: dsum_known_key t) -> Tot (serializer32 (sf x)))
(#k': parser_kind)
(#g: parser k' (dsum_type_of_unknown_tag t))
(#sg: serializer g)
(sg32: serializer32 sg)
(tg: dsum_key t)
: Tot (serializer32 (serialize_dsum_cases t f sf g sg tg))
= [@inline_let]
let _ = synth_dsum_case_injective t tg in
[@inline_let]
let _ = synth_dsum_case_inverse t tg in
serialize32_synth
(serialize32_dsum_type_of_tag t f sf sf32 sg32 tg)
(synth_dsum_case t tg)
(synth_dsum_case_recip t tg)
(fun x -> synth_dsum_case_recip t tg x)
()
inline_for_extraction
let serialize32_dsum_cases_t
(t: dsum)
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(sf: (x: dsum_known_key t) -> Tot (serializer (dsnd (f x))))
(#k': parser_kind)
(g: parser k' (dsum_type_of_unknown_tag t))
(sg: serializer g)
(k: dsum_known_key t)
: Tot Type
= serializer32 (serialize_dsum_cases t f sf g sg (Known k))
let serialize32_dsum_cases_t_eq
(t: dsum)
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(sf: (x: dsum_known_key t) -> Tot (serializer (dsnd (f x))))
(#k': parser_kind)
(g: parser k' (dsum_type_of_unknown_tag t))
(sg: serializer g)
(k: dsum_known_key t)
(x y: serialize32_dsum_cases_t t f sf g sg k)
: GTot Type0
= True
inline_for_extraction
let serialize32_dsum_cases_t_if
(t: dsum)
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(sf: (x: dsum_known_key t) -> Tot (serializer (dsnd (f x))))
(#k': parser_kind)
(g: parser k' (dsum_type_of_unknown_tag t))
(sg: serializer g)
(k: dsum_known_key t)
: Tot (if_combinator _ (serialize32_dsum_cases_t_eq t f sf g sg k))
= fun cond (sv_true: (cond_true cond -> Tot (serialize32_dsum_cases_t t f sf g sg k))) (sv_false: (cond_false cond -> Tot (serialize32_dsum_cases_t t f sf g sg k))) x #rrel #rel output pos ->
if cond
then (sv_true () x output pos)
else (sv_false () x output pos)
inline_for_extraction
let serialize32_dsum_cases
(t: dsum)
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(sf: (x: dsum_known_key t) -> Tot (serializer (dsnd (f x))))
(sf32: (x: dsum_known_key t) -> Tot (serializer32 (sf x)))
(#k': parser_kind)
(#g: parser k' (dsum_type_of_unknown_tag t))
(#sg: serializer g)
(sg32: serializer32 sg)
(destr: dep_enum_destr _ (serialize32_dsum_cases_t t f sf g sg))
(tg: dsum_key t)
: Tot (serializer32 (serialize_dsum_cases t f sf g sg tg))
= fun x #rrel #rel output pos ->
match tg with
| Known k ->
destr
_
(serialize32_dsum_cases_t_if t f sf g sg)
(fun _ _ -> ())
(fun _ _ _ _ -> ())
(fun k -> serialize32_dsum_cases_aux t f sf sf32 sg32 (Known k))
k
x
output
pos
| Unknown r ->
serialize32_dsum_cases_aux t f sf sf32 sg32 (Unknown r) x output pos
inline_for_extraction
let serialize32_dsum
(#kt: parser_kind)
(t: dsum)
(#p: parser kt (dsum_repr_type t))
(s: serializer p {kt.parser_kind_subkind == Some ParserStrong})
(s32: serializer32 (serialize_maybe_enum_key _ s (dsum_enum t)))
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(sf: (x: dsum_known_key t) -> Tot (serializer (dsnd (f x))))
(sf32: (x: dsum_known_key t) -> Tot (serializer32 (sf x)))
(#k': parser_kind)
(#g: parser k' (dsum_type_of_unknown_tag t))
(#sg: serializer g)
(sg32: serializer32 sg)
(destr: dep_enum_destr _ (serialize32_dsum_cases_t t f sf g sg))
: Tot (serializer32 (serialize_dsum t s f sf g sg))
= fun x #_ #_ output pos ->
[@inline_let]
let _ = serialize_dsum_eq' t s f sf g sg x in
let tg = dsum_tag_of_data t x in
serialize32_nondep_then_aux
s32
(serialize32_dsum_cases t f sf sf32 sg32 destr tg)
tg
x
output
pos
let clens_dsum_tag
(s: dsum)
: Tot (clens (dsum_type s) (dsum_key s))
= {
clens_cond = (fun _ -> True);
clens_get = dsum_tag_of_data s;
}
let gaccessor_dsum_tag
(#kt: parser_kind)
(t: dsum)
(p: parser kt (dsum_repr_type t))
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
: Tot (gaccessor (parse_dsum t p f g) (parse_maybe_enum_key p (dsum_enum t)) (clens_dsum_tag t))
= gaccessor_tagged_union_tag
(parse_maybe_enum_key p (dsum_enum t))
(dsum_tag_of_data t)
(parse_dsum_cases t f g)
inline_for_extraction
let accessor_dsum_tag
(#kt: parser_kind)
(t: dsum)
(p: parser kt (dsum_repr_type t))
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
: Tot (accessor (gaccessor_dsum_tag t p f g))
= accessor_tagged_union_tag
(parse_maybe_enum_key p (dsum_enum t))
(dsum_tag_of_data t)
(parse_dsum_cases t f g)
let clens_dsum_payload
(s: dsum)
(k: dsum_key s)
: Tot (clens (dsum_type s) (dsum_type_of_tag s k))
= {
clens_cond = (fun (x: dsum_type s) -> dsum_tag_of_data s x == k);
clens_get = (fun (x: dsum_type s) -> synth_dsum_case_recip s k x <: Ghost (dsum_type_of_tag s k) (requires (dsum_tag_of_data s x == k)) (ensures (fun _ -> True)));
}
let clens_dsum_unknown_payload
(s: dsum)
: Tot (clens (dsum_type s) (dsum_type_of_unknown_tag s))
= {
clens_cond = (fun (x: dsum_type s) -> Unknown? (dsum_tag_of_data s x));
clens_get = (fun (x: dsum_type s) -> synth_dsum_case_recip s (dsum_tag_of_data s x) x <: Ghost (dsum_type_of_unknown_tag s) (requires (Unknown? (dsum_tag_of_data s x))) (ensures (fun _ -> True)));
}
#push-options "--z3rlimit 16"
let gaccessor_clens_dsum_payload'
(#kt: parser_kind)
(t: dsum)
(p: parser kt (dsum_repr_type t))
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
(k: dsum_key t)
: Tot (gaccessor' (parse_dsum t p f g) (parse_dsum_type_of_tag' t f g k) (clens_dsum_payload t k))
= fun (input: bytes) ->
parse_dsum_eq3 t p f g input;
let res =
match parse p input with
| Some (_, consumed) ->
synth_dsum_case_inverse t k;
synth_dsum_case_injective t k;
synth_injective_synth_inverse_synth_inverse_recip (synth_dsum_case t k) (synth_dsum_case_recip t k) ();
(consumed)
| _ -> (0) // dummy
in
(res <: (res: _ { gaccessor_post' (parse_dsum t p f g) (parse_dsum_type_of_tag' t f g k) (clens_dsum_payload t k) input res } ))
let gaccessor_clens_dsum_payload_injective
(#kt: parser_kind)
(t: dsum)
(p: parser kt (dsum_repr_type t))
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
(k: dsum_key t)
(sl sl' : bytes)
: Lemma
(requires (
gaccessor_pre (parse_dsum t p f g) (parse_dsum_type_of_tag' t f g k) (clens_dsum_payload t k) sl /\
gaccessor_pre (parse_dsum t p f g) (parse_dsum_type_of_tag' t f g k) (clens_dsum_payload t k) sl' /\
injective_precond (parse_dsum t p f g) sl sl'
))
(ensures (
gaccessor_clens_dsum_payload' t p f g k sl == gaccessor_clens_dsum_payload' t p f g k sl'
))
=
parse_dsum_eq3 t p f g sl;
parse_dsum_eq3 t p f g sl';
parse_injective (parse_dsum t p f g) sl sl' ;
parse_injective p sl sl'
let gaccessor_clens_dsum_payload_no_lookahead
(#kt: parser_kind)
(t: dsum)
(p: parser kt (dsum_repr_type t))
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
(k: dsum_key t)
(sl sl' : bytes)
: Lemma
(requires (
(parse_dsum_kind kt t f ku).parser_kind_subkind == Some ParserStrong /\
gaccessor_pre (parse_dsum t p f g) (parse_dsum_type_of_tag' t f g k) (clens_dsum_payload t k) sl /\
gaccessor_pre (parse_dsum t p f g) (parse_dsum_type_of_tag' t f g k) (clens_dsum_payload t k) sl' /\
no_lookahead_on_precond (parse_dsum t p f g) sl sl'
))
(ensures (
gaccessor_clens_dsum_payload' t p f g k sl == gaccessor_clens_dsum_payload' t p f g k sl'
))
= parse_dsum_eq3 t p f g sl;
parse_dsum_eq3 t p f g sl';
parse_strong_prefix (parse_dsum t p f g) sl sl' ;
parse_injective p sl sl'
let gaccessor_clens_dsum_payload
(#kt: parser_kind)
(t: dsum)
(p: parser kt (dsum_repr_type t))
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
(k: dsum_key t)
: Tot (gaccessor (parse_dsum t p f g) (parse_dsum_type_of_tag' t f g k) (clens_dsum_payload t k))
= Classical.forall_intro_2 (fun x -> Classical.move_requires (gaccessor_clens_dsum_payload_injective t p f g k x));
Classical.forall_intro_2 (fun x -> Classical.move_requires (gaccessor_clens_dsum_payload_no_lookahead t p f g k x));
gaccessor_prop_equiv (parse_dsum t p f g) (parse_dsum_type_of_tag' t f g k) (clens_dsum_payload t k) (gaccessor_clens_dsum_payload' t p f g k);
gaccessor_clens_dsum_payload' t p f g k
inline_for_extraction
let accessor_clens_dsum_payload'
(#kt: parser_kind)
(t: dsum)
(#p: parser kt (dsum_repr_type t))
(j: jumper p)
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
(k: dsum_key t)
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: HST.Stack U32.t
(requires (fun h ->
valid (parse_dsum t p f g) h input pos /\
(clens_dsum_payload t k).clens_cond (contents (parse_dsum t p f g) h input pos)
))
(ensures (fun h pos' h' ->
B.modifies B.loc_none h h' /\
pos' == slice_access h (gaccessor_clens_dsum_payload t p f g k) input pos
))
=
let h = HST.get () in
[@inline_let]
let _ =
let pos' = get_valid_pos (parse_dsum t p f g) h input pos in
let large = bytes_of_slice_from h input pos in
slice_access_eq h (gaccessor_clens_dsum_payload t p f g k) input pos;
valid_facts (parse_dsum t p f g) h input pos;
parse_dsum_eq3 t p f g large;
valid_facts p h input pos
in
j input pos
#pop-options
inline_for_extraction
let accessor_clens_dsum_payload
(#kt: parser_kind)
(t: dsum)
(#p: parser kt (dsum_repr_type t))
(j: jumper p)
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
(k: dsum_key t)
: Tot (accessor (gaccessor_clens_dsum_payload t p f g k))
= fun #rrel #rel -> accessor_clens_dsum_payload' t j f g k #rrel #rel
#push-options "--z3rlimit 16"
let gaccessor_clens_dsum_unknown_payload'
(#kt: parser_kind)
(t: dsum)
(p: parser kt (dsum_repr_type t))
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
: Tot (gaccessor' (parse_dsum t p f g) g (clens_dsum_unknown_payload t))
= fun (input: bytes) ->
parse_dsum_eq3 t p f g input;
let res =
match parse p input with
| Some (tg, consumed) ->
let k = maybe_enum_key_of_repr (dsum_enum t) tg in
synth_dsum_case_inverse t k;
synth_dsum_case_injective t k;
synth_injective_synth_inverse_synth_inverse_recip (synth_dsum_case t k) (synth_dsum_case_recip t k) ();
(consumed)
| _ -> (0) // dummy
in
(res <: (res: _ { gaccessor_post' (parse_dsum t p f g) g (clens_dsum_unknown_payload t) input res } ))
let gaccessor_clens_dsum_unknown_payload_injective
(#kt: parser_kind)
(t: dsum)
(p: parser kt (dsum_repr_type t))
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
(sl sl' : bytes)
: Lemma
(requires (
gaccessor_pre (parse_dsum t p f g) g (clens_dsum_unknown_payload t) sl /\
gaccessor_pre (parse_dsum t p f g) g (clens_dsum_unknown_payload t) sl' /\
injective_precond (parse_dsum t p f g) sl sl'
))
(ensures (gaccessor_clens_dsum_unknown_payload' t p f g sl == gaccessor_clens_dsum_unknown_payload' t p f g sl'))
= parse_dsum_eq3 t p f g sl;
parse_dsum_eq3 t p f g sl';
parse_injective (parse_dsum t p f g) sl sl' ;
parse_injective p sl sl'
let gaccessor_clens_dsum_unknown_payload_no_lookahead
(#kt: parser_kind)
(t: dsum)
(p: parser kt (dsum_repr_type t))
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
(sl sl' : bytes)
: Lemma
(requires (
(parse_dsum_kind kt t f ku).parser_kind_subkind == Some ParserStrong /\
gaccessor_pre (parse_dsum t p f g) g (clens_dsum_unknown_payload t) sl /\
gaccessor_pre (parse_dsum t p f g) g (clens_dsum_unknown_payload t) sl' /\
no_lookahead_on_precond (parse_dsum t p f g) sl sl'
))
(ensures (gaccessor_clens_dsum_unknown_payload' t p f g sl == gaccessor_clens_dsum_unknown_payload' t p f g sl'))
=
parse_dsum_eq3 t p f g sl;
parse_dsum_eq3 t p f g sl';
parse_strong_prefix (parse_dsum t p f g) sl sl' ;
parse_injective p sl sl'
let gaccessor_clens_dsum_unknown_payload
(#kt: parser_kind)
(t: dsum)
(p: parser kt (dsum_repr_type t))
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
: Tot (gaccessor (parse_dsum t p f g) g (clens_dsum_unknown_payload t))
= Classical.forall_intro_2 (fun x -> Classical.move_requires (gaccessor_clens_dsum_unknown_payload_injective t p f g x));
Classical.forall_intro_2 (fun x -> Classical.move_requires (gaccessor_clens_dsum_unknown_payload_no_lookahead t p f g x));
gaccessor_prop_equiv (parse_dsum t p f g) g (clens_dsum_unknown_payload t) (gaccessor_clens_dsum_unknown_payload' t p f g);
gaccessor_clens_dsum_unknown_payload' t p f g | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"LowStar.Buffer.fst.checked",
"LowParse.Spec.Sum.fst.checked",
"LowParse.Low.Enum.fst.checked",
"FStar.UInt64.fsti.checked",
"FStar.UInt32.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Int.Cast.fst.checked",
"FStar.HyperStack.ST.fsti.checked",
"FStar.HyperStack.fst.checked",
"FStar.Classical.fsti.checked"
],
"interface_file": false,
"source_file": "LowParse.Low.Sum.fst"
} | [
{
"abbrev": true,
"full_module": "FStar.HyperStack",
"short_module": "HS"
},
{
"abbrev": true,
"full_module": "FStar.UInt64",
"short_module": "U64"
},
{
"abbrev": true,
"full_module": "FStar.Int.Cast",
"short_module": "Cast"
},
{
"abbrev": true,
"full_module": "LowStar.Buffer",
"short_module": "B"
},
{
"abbrev": true,
"full_module": "FStar.HyperStack.ST",
"short_module": "HST"
},
{
"abbrev": true,
"full_module": "FStar.UInt32",
"short_module": "U32"
},
{
"abbrev": false,
"full_module": "LowParse.Spec.Sum",
"short_module": null
},
{
"abbrev": false,
"full_module": "LowParse.Low.Enum",
"short_module": null
},
{
"abbrev": false,
"full_module": "LowParse.Low",
"short_module": null
},
{
"abbrev": false,
"full_module": "LowParse.Low",
"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",
"short_module": null
}
] | {
"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_elim_box": false,
"smtencoding_l_arith_repr": "boxwrap",
"smtencoding_nl_arith_repr": "boxwrap",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": true,
"z3cliopt": [],
"z3refresh": false,
"z3rlimit": 16,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | false |
t: LowParse.Spec.Sum.dsum ->
j: LowParse.Low.Base.jumper p ->
f:
(x: LowParse.Spec.Sum.dsum_known_key t
-> Prims.dtuple2 LowParse.Spec.Base.parser_kind
(fun k -> LowParse.Spec.Base.parser k (LowParse.Spec.Sum.dsum_type_of_known_tag t x))) ->
g: LowParse.Spec.Base.parser ku (LowParse.Spec.Sum.dsum_type_of_unknown_tag t) ->
input: LowParse.Slice.slice rrel rel ->
pos: FStar.UInt32.t
-> FStar.HyperStack.ST.Stack FStar.UInt32.t | FStar.HyperStack.ST.Stack | [] | [] | [
"LowParse.Spec.Base.parser_kind",
"LowParse.Spec.Sum.dsum",
"LowParse.Spec.Base.parser",
"LowParse.Spec.Sum.dsum_repr_type",
"LowParse.Low.Base.jumper",
"LowParse.Spec.Sum.dsum_known_key",
"Prims.dtuple2",
"LowParse.Spec.Sum.dsum_type_of_known_tag",
"LowParse.Spec.Sum.dsum_type_of_unknown_tag",
"LowParse.Slice.srel",
"LowParse.Bytes.byte",
"LowParse.Slice.slice",
"FStar.UInt32.t",
"Prims.unit",
"LowParse.Low.Base.Spec.valid_facts",
"LowParse.Spec.Sum.parse_dsum_eq3",
"LowParse.Spec.Sum.parse_dsum_kind",
"LowParse.Spec.Sum.dsum_type",
"LowParse.Spec.Sum.parse_dsum",
"LowParse.Low.Base.Spec.slice_access_eq",
"LowParse.Low.Sum.clens_dsum_unknown_payload",
"LowParse.Low.Sum.gaccessor_clens_dsum_unknown_payload",
"LowParse.Bytes.bytes",
"LowParse.Slice.bytes_of_slice_from",
"LowParse.Low.Base.Spec.get_valid_pos",
"FStar.Monotonic.HyperStack.mem",
"FStar.HyperStack.ST.get",
"Prims.l_and",
"LowParse.Low.Base.Spec.valid",
"LowParse.Low.Base.Spec.__proj__Mkclens__item__clens_cond",
"LowParse.Low.Base.Spec.contents",
"LowStar.Monotonic.Buffer.modifies",
"LowStar.Monotonic.Buffer.loc_none",
"Prims.eq2",
"LowParse.Low.Base.Spec.slice_access"
] | [] | false | true | false | false | false | let accessor_clens_dsum_unknown_payload'
(#kt: parser_kind)
(t: dsum)
(#p: parser kt (dsum_repr_type t))
(j: jumper p)
(f: (x: dsum_known_key t -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x))))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: HST.Stack U32.t
(requires
(fun h ->
valid (parse_dsum t p f g) h input pos /\
(clens_dsum_unknown_payload t).clens_cond (contents (parse_dsum t p f g) h input pos)))
(ensures
(fun h pos' h' ->
B.modifies B.loc_none h h' /\
pos' == slice_access h (gaccessor_clens_dsum_unknown_payload t p f g) input pos)) =
| let h = HST.get () in
[@@ inline_let ]let _ =
let pos' = get_valid_pos (parse_dsum t p f g) h input pos in
let large = bytes_of_slice_from h input pos in
slice_access_eq h (gaccessor_clens_dsum_unknown_payload t p f g) input pos;
valid_facts (parse_dsum t p f g) h input pos;
parse_dsum_eq3 t p f g large;
valid_facts p h input pos
in
j input pos | false |
LowParse.Low.Sum.fst | LowParse.Low.Sum.read_sum | val read_sum
(#kt: parser_kind)
(t: sum)
(p: parser kt (sum_repr_type t))
(p32: leaf_reader (parse_enum_key p (sum_enum t)))
(j: jumper p)
(pc: (x: sum_key t -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: (x: sum_key t -> Tot (leaf_reader (dsnd (pc x)))))
(destr: dep_enum_destr (sum_enum t) (read_sum_cases_t t pc))
: Tot (leaf_reader (parse_sum t p pc)) | val read_sum
(#kt: parser_kind)
(t: sum)
(p: parser kt (sum_repr_type t))
(p32: leaf_reader (parse_enum_key p (sum_enum t)))
(j: jumper p)
(pc: (x: sum_key t -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: (x: sum_key t -> Tot (leaf_reader (dsnd (pc x)))))
(destr: dep_enum_destr (sum_enum t) (read_sum_cases_t t pc))
: Tot (leaf_reader (parse_sum t p pc)) | let read_sum
(#kt: parser_kind)
(t: sum)
(p: parser kt (sum_repr_type t))
(p32: leaf_reader (parse_enum_key p (sum_enum t)))
(j: jumper p)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (leaf_reader (dsnd (pc x)))))
(destr: dep_enum_destr (sum_enum t) (read_sum_cases_t t pc))
: Tot (leaf_reader (parse_sum t p pc))
=
fun #_ #_ input pos ->
let h = HST.get () in
valid_facts (parse_sum t p pc) h input pos;
parse_sum_eq' t p pc (bytes_of_slice_from h input pos);
valid_facts (parse_enum_key p (sum_enum t)) h input pos;
let k = p32 input pos in
let pos' = jump_enum_key j (sum_enum t) input pos in
valid_facts (parse_sum_cases' t pc k) h input pos' ;
read_sum_cases t pc pc32 destr k input pos' | {
"file_name": "src/lowparse/LowParse.Low.Sum.fst",
"git_rev": "00217c4a89f5ba56002ba9aa5b4a9d5903bfe9fa",
"git_url": "https://github.com/project-everest/everparse.git",
"project_name": "everparse"
} | {
"end_col": 47,
"end_line": 662,
"start_col": 0,
"start_line": 643
} | module LowParse.Low.Sum
include LowParse.Low.Enum
include LowParse.Spec.Sum
module U32 = FStar.UInt32
module HST = FStar.HyperStack.ST
module B = LowStar.Buffer
module Cast = FStar.Int.Cast
module U64 = FStar.UInt64
inline_for_extraction
let validate_sum_cases_aux
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(vc: ((x: sum_key t) -> Tot (validator (dsnd (pc x)))))
(k: sum_key t)
: Tot (validator (parse_sum_cases t pc k))
= [@inline_let]
let _ = synth_sum_case_injective t k in
validate_synth
(validate_weaken
(weaken_parse_cases_kind t pc)
(vc k)
()
)
(synth_sum_case t k)
()
inline_for_extraction
let validate_sum_cases_t
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot Type
= validator (parse_sum_cases t pc k)
let validate_sum_cases_t_eq
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
(x y : validate_sum_cases_t t pc k)
: GTot Type0
= True
inline_for_extraction
let validate_sum_cases_t_if
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (if_combinator _ (validate_sum_cases_t_eq t pc k))
= fun cond (sv_true: cond_true cond -> Tot (validate_sum_cases_t t pc k)) (sv_false: cond_false cond -> Tot (validate_sum_cases_t t pc k)) #rrel #rel input pos ->
if cond
then sv_true () input pos
else sv_false () input pos
inline_for_extraction
let validate_sum_cases
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(vc: ((x: sum_key t) -> Tot (validator (dsnd (pc x)))))
(destr: dep_enum_destr (sum_enum t) (validate_sum_cases_t t pc))
(k: sum_key t)
: Tot (validator (parse_sum_cases t pc k))
= destr
_
(validate_sum_cases_t_if t pc)
(fun _ _ -> ())
(fun _ _ _ _ -> ())
(validate_sum_cases_aux t pc vc)
k
inline_for_extraction
let validate_sum_aux_payload_t
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
: Tot Type
= (#rrel: _) -> (#rel: _) ->
(input: slice rrel rel) ->
(pos: U64.t) ->
HST.Stack U64.t
(requires (fun h -> live_slice h input /\ U64.v pos <= U32.v input.len))
(ensures (fun h res h' ->
B.modifies B.loc_none h h' /\ (
match k with
| Unknown _ -> is_error res
| Known k' ->
if is_success res
then
valid_pos (dsnd (pc k')) h input (uint64_to_uint32 pos) (uint64_to_uint32 res)
else
(~ (valid (dsnd (pc k')) h input (uint64_to_uint32 pos)))
)))
let validate_sum_aux_payload_eq
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
: Tot (validate_sum_aux_payload_t t pc k -> validate_sum_aux_payload_t t pc k -> GTot Type0)
= fun _ _ -> True
inline_for_extraction
let validate_sum_aux_payload_if'
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
(cond: bool)
(ift: ((cond_true cond) -> Tot (validate_sum_aux_payload_t t pc k)))
(iff: ((cond_false cond) -> Tot (validate_sum_aux_payload_t t pc k)))
: Tot (validate_sum_aux_payload_t t pc k)
= fun #rrel #rel input pos ->
if cond
then begin
(ift () <: validate_sum_aux_payload_t t pc k) input pos
end else
(iff () <: validate_sum_aux_payload_t t pc k) input pos
inline_for_extraction
let validate_sum_aux_payload_if
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
: Tot (if_combinator _ (validate_sum_aux_payload_eq t pc k))
= validate_sum_aux_payload_if' t pc k
#push-options "--z3rlimit 64 --z3cliopt smt.arith.nl=false --using_facts_from '* -FStar.Int.Cast -LowParse.BitFields'"
// --query_stats --smtencoding.elim_box true --smtencoding.l_arith_repr native --z3refresh"
inline_for_extraction
let validate_sum_aux
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(v: validator p)
(p32: leaf_reader p)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(v_payload: ((k: sum_repr_type t)) -> Tot (validate_sum_aux_payload_t t pc (maybe_enum_key_of_repr (sum_enum t) k)))
: Tot (validator (parse_sum t p pc))
= fun #rrel #rel input pos ->
let h = HST.get () in
[@inline_let]
let _ = parse_sum_eq'' t p pc (bytes_of_slice_from h input (uint64_to_uint32 pos)) in
[@inline_let]
let _ = valid_facts (parse_sum t p pc) h input (uint64_to_uint32 pos) in
[@inline_let]
let _ = valid_facts p h input (uint64_to_uint32 pos) in
let len_after_tag = v input pos in
if is_error len_after_tag
then len_after_tag
else begin
let h1 = HST.get () in
let k' = p32 input (uint64_to_uint32 pos) in
[@inline_let]
let _ =
match maybe_enum_key_of_repr (sum_enum t) k' with
| Known k -> valid_facts (dsnd (pc k)) h input (uint64_to_uint32 len_after_tag)
| _ -> ()
in
v_payload k' input len_after_tag
end
#pop-options
inline_for_extraction
let validate_sum_aux_payload'
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (validator (dsnd (pc x)))))
(k: maybe_enum_key (sum_enum t))
: Tot (validate_sum_aux_payload_t t pc k)
= fun #rrel #rel input pos ->
match k with
| Known k ->
[@inline_let]
let _ = synth_sum_case_injective t k in
pc32 k input pos
// validate_synth (pc32 k) (synth_sum_case t k) () input pos
| _ -> validator_error_generic
inline_for_extraction
let validate_sum_aux_payload
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (validator (dsnd (pc x)))))
(destr: dep_maybe_enum_destr_t (sum_enum t) (validate_sum_aux_payload_t t pc))
(k: sum_repr_type t)
: Tot (validate_sum_aux_payload_t t pc (maybe_enum_key_of_repr (sum_enum t) k))
= destr (validate_sum_aux_payload_eq t pc) (validate_sum_aux_payload_if t pc) (fun _ _ -> ()) (fun _ _ _ _ -> ()) (validate_sum_aux_payload' t pc pc32) k
inline_for_extraction
let validate_sum
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(v: validator p)
(p32: leaf_reader p)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (validator (dsnd (pc x)))))
(destr: dep_maybe_enum_destr_t (sum_enum t) (validate_sum_aux_payload_t t pc))
: Tot (validator (parse_sum t p pc))
= validate_sum_aux t v p32 pc (validate_sum_aux_payload t pc pc32 destr)
module HS = FStar.HyperStack
#push-options "--z3rlimit 256 --z3cliopt smt.arith.nl=false --initial_ifuel 8 --max_ifuel 8 --initial_fuel 2 --max_fuel 2"
#restart-solver
let valid_sum_intro
(h: HS.mem)
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: Lemma
(requires (
valid (parse_enum_key p (sum_enum t)) h input pos /\ (
let k = contents (parse_enum_key p (sum_enum t)) h input pos in
valid (dsnd (pc k)) h input (get_valid_pos (parse_enum_key p (sum_enum t)) h input pos)
)))
(ensures (
let k = contents (parse_enum_key p (sum_enum t)) h input pos in
let pos_payload = get_valid_pos (parse_enum_key p (sum_enum t)) h input pos in
valid_content_pos
(parse_sum t p pc) h input pos
(synth_sum_case t k (contents (dsnd (pc k)) h input pos_payload))
(get_valid_pos (dsnd (pc k)) h input pos_payload)
))
= valid_facts (parse_enum_key p (sum_enum t)) h input pos;
let k = contents (parse_enum_key p (sum_enum t)) h input pos in
let pos_payload = get_valid_pos (parse_enum_key p (sum_enum t)) h input pos in
valid_facts (dsnd (pc k)) h input pos_payload;
valid_facts (parse_sum t p pc) h input pos;
parse_sum_eq t p pc (bytes_of_slice_from h input pos)
#pop-options
inline_for_extraction
let finalize_sum_case
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(s: serializer p)
(w: leaf_writer_strong s)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(destr: enum_repr_of_key'_t (sum_enum t))
(k: sum_key t)
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: HST.Stack unit
(requires (fun h ->
let len_tag = serialized_length (serialize_enum_key _ s (sum_enum t)) k in
U32.v pos + len_tag < 4294967296 /\ (
let pos_payload = pos `U32.add` U32.uint_to_t len_tag in
valid (dsnd (pc k)) h input pos_payload /\
writable input.base (U32.v pos) (U32.v pos_payload) h
)))
(ensures (fun h _ h' ->
let len_tag = serialized_length (serialize_enum_key _ s (sum_enum t)) k in
let pos_payload = pos `U32.add` U32.uint_to_t len_tag in
B.modifies (loc_slice_from_to input pos pos_payload) h h' /\
valid_content_pos (parse_sum t p pc) h' input pos (synth_sum_case t k (contents (dsnd (pc k)) h input pos_payload)) (get_valid_pos (dsnd (pc k)) h input pos_payload)
))
= let pos1 = write_enum_key w (sum_enum t) destr k input pos in
let h = HST.get () in
[@inline_let]
let _ = valid_sum_intro h t p pc input pos in
()
inline_for_extraction
let jump_sum_cases_aux
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(vc: ((x: sum_key t) -> Tot (jumper (dsnd (pc x)))))
(k: sum_key t)
: Tot (jumper (parse_sum_cases t pc k))
= [@inline_let]
let _ = synth_sum_case_injective t k in
jump_synth
(jump_weaken
(weaken_parse_cases_kind t pc)
(vc k)
()
)
(synth_sum_case t k)
()
inline_for_extraction
let jump_sum_cases_t
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot Type
= jumper (parse_sum_cases t pc k)
let jump_sum_cases_t_eq
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
(x y : jump_sum_cases_t t pc k)
: GTot Type0
= True
inline_for_extraction
let jump_sum_cases_t_if
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (if_combinator _ (jump_sum_cases_t_eq t pc k))
= fun cond (sv_true: cond_true cond -> Tot (jump_sum_cases_t t pc k)) (sv_false: cond_false cond -> Tot (jump_sum_cases_t t pc k)) #rrel #rel input pos ->
if cond
then sv_true () input pos
else sv_false () input pos
inline_for_extraction
let jump_sum_cases
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(vc: ((x: sum_key t) -> Tot (jumper (dsnd (pc x)))))
(destr: dep_enum_destr (sum_enum t) (jump_sum_cases_t t pc))
(k: sum_key t)
: Tot (jumper (parse_sum_cases t pc k))
= destr
_
(jump_sum_cases_t_if t pc)
(fun _ _ -> ())
(fun _ _ _ _ -> ())
(jump_sum_cases_aux t pc vc)
k
inline_for_extraction
let jump_sum_aux_payload_t
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
: Tot Type
= (#rrel: _) -> (#rel: _) ->
(input: slice rrel rel) ->
(pos: U32.t) ->
HST.Stack U32.t
(requires (fun h -> live_slice h input /\ U32.v pos <= U32.v input.len /\ (
match k with
| Unknown _ -> False
| Known k' -> valid (dsnd (pc k')) h input pos
)))
(ensures (fun h res h' ->
B.modifies B.loc_none h h' /\ (
match k with
| Unknown _ -> False
| Known k' ->
valid_pos (dsnd (pc k')) h input pos res
)))
let jump_sum_aux_payload_eq
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
: Tot (jump_sum_aux_payload_t t pc k -> jump_sum_aux_payload_t t pc k -> GTot Type0)
= fun _ _ -> True
inline_for_extraction
let jump_sum_aux_payload_if'
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
(cond: bool)
(ift: ((cond_true cond) -> Tot (jump_sum_aux_payload_t t pc k)))
(iff: ((cond_false cond) -> Tot (jump_sum_aux_payload_t t pc k)))
: Tot (jump_sum_aux_payload_t t pc k)
= fun #rrel #rel input pos ->
if cond
then begin
(ift () <: jump_sum_aux_payload_t t pc k) input pos
end else
(iff () <: jump_sum_aux_payload_t t pc k) input pos
inline_for_extraction
let jump_sum_aux_payload_if
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
: Tot (if_combinator _ (jump_sum_aux_payload_eq t pc k))
= jump_sum_aux_payload_if' t pc k
let parse_sum_eq3
(#kt: parser_kind)
(t: sum)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(input: bytes)
(k' : sum_repr_type t)
(consumed_k: consumed_length input)
: Lemma
(requires (Some? (parse (parse_sum t p pc) input) /\ parse p input == Some (k', consumed_k)))
(ensures (
let input_k = Seq.slice input consumed_k (Seq.length input) in
let k = maybe_enum_key_of_repr (sum_enum t) k' in
begin match k with
| Known k ->
Some? (parse (dsnd (pc k)) input_k)
| _ -> False
end
))
= parse_sum_eq'' t p pc input
let parse_sum_eq4
(#kt: parser_kind)
(t: sum)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(input: bytes)
(k' : sum_repr_type t)
(consumed_k: consumed_length input)
(consumed_payload: nat)
: Lemma
(requires (Some? (parse (parse_sum t p pc) input) /\ parse p input == Some (k', consumed_k) /\ (
let input_k = Seq.slice input consumed_k (Seq.length input) in
let k = maybe_enum_key_of_repr (sum_enum t) k' in
begin match k with
| Known k ->
Some? (parse (dsnd (pc k)) input_k) /\ (
let Some (_, consumed_payload') = parse (dsnd (pc k)) input_k in
consumed_payload' == consumed_payload
)
| _ -> False
end
)))
(ensures (
let Some (_, consumed) = parse (parse_sum t p pc) input in
consumed == consumed_k + consumed_payload
))
= parse_sum_eq'' t p pc input
#push-options "--z3rlimit 16"
let valid_sum_elim
(h: HS.mem)
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(#rrel: _) (#rel: _)
(input: slice rrel rel)
(pos: U32.t)
: Lemma
(requires (
valid (parse_sum t p pc) h input pos
))
(ensures (
valid p h input pos /\ (
let pos_payload = get_valid_pos p h input pos in
let k' = maybe_enum_key_of_repr (sum_enum t) (contents p h input pos) in
match k' with
| Known k ->
k == sum_tag_of_data t (contents (parse_sum t p pc) h input pos) /\
valid (dsnd (pc k)) h input pos_payload /\
valid_pos
(parse_sum t p pc) h input pos
(get_valid_pos (dsnd (pc k)) h input pos_payload)
| _ -> False
)))
= let sinput = bytes_of_slice_from h input pos in
let _ = parse_sum_eq'' t p pc sinput in
[@inline_let]
let _ = valid_facts (parse_sum t p pc) h input pos in
let Some (k', consumed_k) = parse p sinput in
let pos_after_tag = U32.uint_to_t (U32.v pos + consumed_k) in
[@inline_let]
let _ = valid_facts p h input pos in
assert (valid_content_pos p h input pos k' pos_after_tag);
match maybe_enum_key_of_repr (sum_enum t) k' with
| Known k -> valid_facts (dsnd (pc k)) h input pos_after_tag
| _ -> ()
#pop-options
let valid_sum_elim_tag
(h: HS.mem)
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: Lemma
(requires (
valid (parse_sum t p pc) h input pos
))
(ensures (
valid (parse_enum_key p (sum_enum t)) h input pos /\
contents (parse_enum_key p (sum_enum t)) h input pos == sum_tag_of_data t (contents (parse_sum t p pc) h input pos)
))
= let _ = parse_sum_eq' t p pc (bytes_of_slice_from h input pos) in
let _ = valid_facts (parse_sum t p pc) h input pos in
let _ = valid_facts (parse_enum_key p (sum_enum t)) h input pos in
()
inline_for_extraction
let read_sum_tag
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(p32: leaf_reader p)
(destr: dep_maybe_enum_destr_t (sum_enum t) (read_enum_key_t (sum_enum t)))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: HST.Stack (sum_key t)
(requires (fun h ->
valid (parse_sum t p pc) h input pos
))
(ensures (fun h res h' ->
B.modifies B.loc_none h h' /\
res == sum_tag_of_data t (contents (parse_sum t p pc) h input pos)
))
= let h = HST.get () in
[@inline_let] let _ = valid_sum_elim_tag h t p pc input pos in
read_enum_key p32 (sum_enum t) destr input pos
inline_for_extraction
let jump_sum_aux
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(v: jumper p)
(p32: leaf_reader p)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(v_payload: ((k: sum_repr_type t)) -> Tot (jump_sum_aux_payload_t t pc (maybe_enum_key_of_repr (sum_enum t) k)))
: Tot (jumper (parse_sum t p pc))
= fun #rrel #rel input pos ->
let h = HST.get () in
[@inline_let]
let _ = valid_sum_elim h t p pc input pos in
let pos_after_tag = v input pos in
let k' = p32 input pos in
v_payload k' input pos_after_tag
inline_for_extraction
let jump_sum_aux_payload'
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (jumper (dsnd (pc x)))))
(k: maybe_enum_key (sum_enum t))
: Tot (jump_sum_aux_payload_t t pc k)
= fun #rrel #rel input pos ->
match k with
| Known k ->
[@inline_let]
let _ = synth_sum_case_injective t k in
pc32 k input pos
| _ -> 0ul // dummy, but we MUST NOT remove this branch, otherwise extraction fails
inline_for_extraction
let jump_sum_aux_payload
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (jumper (dsnd (pc x)))))
(destr: dep_maybe_enum_destr_t (sum_enum t) (jump_sum_aux_payload_t t pc))
(k: sum_repr_type t)
: Tot (jump_sum_aux_payload_t t pc (maybe_enum_key_of_repr (sum_enum t) k))
= destr (jump_sum_aux_payload_eq t pc) (jump_sum_aux_payload_if t pc) (fun _ _ -> ()) (fun _ _ _ _ -> ()) (jump_sum_aux_payload' t pc pc32) k
inline_for_extraction
let jump_sum
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(v: jumper p)
(p32: leaf_reader p)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (jumper (dsnd (pc x)))))
(destr: dep_maybe_enum_destr_t (sum_enum t) (jump_sum_aux_payload_t t pc))
: Tot (jumper (parse_sum t p pc))
= jump_sum_aux t v p32 pc (jump_sum_aux_payload t pc pc32 destr)
inline_for_extraction
let read_sum_cases'
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (leaf_reader (dsnd (pc x)))))
(k: sum_key t)
: Tot (leaf_reader (parse_sum_cases' t pc k))
= [@inline_let]
let _ = synth_sum_case_injective t k in
read_synth'
(dsnd (pc k))
(synth_sum_case t k)
(pc32 k)
()
inline_for_extraction
let read_sum_cases_t
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot Type
= leaf_reader (parse_sum_cases' t pc k)
let read_sum_cases_t_eq
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
(x y : read_sum_cases_t t pc k)
: GTot Type0
= True
inline_for_extraction
let read_sum_cases_t_if
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (if_combinator _ (read_sum_cases_t_eq t pc k))
= fun cond (sv_true: cond_true cond -> Tot (read_sum_cases_t t pc k)) (sv_false: cond_false cond -> Tot (read_sum_cases_t t pc k)) #_ #_ input pos ->
if cond
then (sv_true () input pos)
else (sv_false () input pos)
inline_for_extraction
let read_sum_cases
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (leaf_reader (dsnd (pc x)))))
(destr: dep_enum_destr (sum_enum t) (read_sum_cases_t t pc))
(k: sum_key t)
: Tot (leaf_reader (parse_sum_cases' t pc k))
= destr
_
(read_sum_cases_t_if t pc)
(fun _ _ -> ())
(fun _ _ _ _ -> ())
(read_sum_cases' t pc pc32)
k
#push-options "--z3rlimit 32" | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"LowStar.Buffer.fst.checked",
"LowParse.Spec.Sum.fst.checked",
"LowParse.Low.Enum.fst.checked",
"FStar.UInt64.fsti.checked",
"FStar.UInt32.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Int.Cast.fst.checked",
"FStar.HyperStack.ST.fsti.checked",
"FStar.HyperStack.fst.checked",
"FStar.Classical.fsti.checked"
],
"interface_file": false,
"source_file": "LowParse.Low.Sum.fst"
} | [
{
"abbrev": true,
"full_module": "FStar.HyperStack",
"short_module": "HS"
},
{
"abbrev": true,
"full_module": "FStar.UInt64",
"short_module": "U64"
},
{
"abbrev": true,
"full_module": "FStar.Int.Cast",
"short_module": "Cast"
},
{
"abbrev": true,
"full_module": "LowStar.Buffer",
"short_module": "B"
},
{
"abbrev": true,
"full_module": "FStar.HyperStack.ST",
"short_module": "HST"
},
{
"abbrev": true,
"full_module": "FStar.UInt32",
"short_module": "U32"
},
{
"abbrev": false,
"full_module": "LowParse.Spec.Sum",
"short_module": null
},
{
"abbrev": false,
"full_module": "LowParse.Low.Enum",
"short_module": null
},
{
"abbrev": false,
"full_module": "LowParse.Low",
"short_module": null
},
{
"abbrev": false,
"full_module": "LowParse.Low",
"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",
"short_module": null
}
] | {
"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_elim_box": false,
"smtencoding_l_arith_repr": "boxwrap",
"smtencoding_nl_arith_repr": "boxwrap",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": true,
"z3cliopt": [],
"z3refresh": false,
"z3rlimit": 32,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | false |
t: LowParse.Spec.Sum.sum ->
p: LowParse.Spec.Base.parser kt (LowParse.Spec.Sum.sum_repr_type t) ->
p32:
LowParse.Low.Base.leaf_reader (LowParse.Spec.Enum.parse_enum_key p
(LowParse.Spec.Sum.sum_enum t)) ->
j: LowParse.Low.Base.jumper p ->
pc:
(x: LowParse.Spec.Sum.sum_key t
-> Prims.dtuple2 LowParse.Spec.Base.parser_kind
(fun k -> LowParse.Spec.Base.parser k (LowParse.Spec.Sum.sum_type_of_tag t x))) ->
pc32:
(x: LowParse.Spec.Sum.sum_key t
-> LowParse.Low.Base.leaf_reader (FStar.Pervasives.dsnd (pc x))) ->
destr:
LowParse.Spec.Enum.dep_enum_destr (LowParse.Spec.Sum.sum_enum t)
(LowParse.Low.Sum.read_sum_cases_t t pc)
-> LowParse.Low.Base.leaf_reader (LowParse.Spec.Sum.parse_sum t p pc) | Prims.Tot | [
"total"
] | [] | [
"LowParse.Spec.Base.parser_kind",
"LowParse.Spec.Sum.sum",
"LowParse.Spec.Base.parser",
"LowParse.Spec.Sum.sum_repr_type",
"LowParse.Low.Base.leaf_reader",
"LowParse.Spec.Combinators.parse_filter_kind",
"LowParse.Spec.Enum.enum_key",
"LowParse.Spec.Sum.sum_key_type",
"LowParse.Spec.Sum.sum_enum",
"LowParse.Spec.Enum.parse_enum_key",
"LowParse.Low.Base.jumper",
"LowParse.Spec.Sum.sum_key",
"Prims.dtuple2",
"LowParse.Spec.Sum.sum_type_of_tag",
"Prims.__proj__Mkdtuple2__item___1",
"FStar.Pervasives.dsnd",
"LowParse.Spec.Enum.dep_enum_destr",
"LowParse.Low.Sum.read_sum_cases_t",
"LowParse.Slice.srel",
"LowParse.Bytes.byte",
"LowParse.Slice.slice",
"FStar.UInt32.t",
"LowParse.Low.Sum.read_sum_cases",
"LowParse.Spec.Sum.sum_cases",
"Prims.unit",
"LowParse.Low.Base.Spec.valid_facts",
"FStar.Pervasives.dfst",
"LowParse.Spec.Sum.parse_sum_cases'",
"LowParse.Spec.Sum.sum_type",
"LowParse.Low.Enum.jump_enum_key",
"LowParse.Spec.Sum.parse_sum_eq'",
"LowParse.Slice.bytes_of_slice_from",
"LowParse.Spec.Sum.parse_sum_kind",
"LowParse.Spec.Sum.parse_sum",
"FStar.Monotonic.HyperStack.mem",
"FStar.HyperStack.ST.get"
] | [] | false | false | false | false | false | let read_sum
(#kt: parser_kind)
(t: sum)
(p: parser kt (sum_repr_type t))
(p32: leaf_reader (parse_enum_key p (sum_enum t)))
(j: jumper p)
(pc: (x: sum_key t -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: (x: sum_key t -> Tot (leaf_reader (dsnd (pc x)))))
(destr: dep_enum_destr (sum_enum t) (read_sum_cases_t t pc))
: Tot (leaf_reader (parse_sum t p pc)) =
| fun #_ #_ input pos ->
let h = HST.get () in
valid_facts (parse_sum t p pc) h input pos;
parse_sum_eq' t p pc (bytes_of_slice_from h input pos);
valid_facts (parse_enum_key p (sum_enum t)) h input pos;
let k = p32 input pos in
let pos' = jump_enum_key j (sum_enum t) input pos in
valid_facts (parse_sum_cases' t pc k) h input pos';
read_sum_cases t pc pc32 destr k input pos' | false |
PulseCore.Atomic.fst | PulseCore.Atomic.return_atomic' | val return_atomic' (#a x post: _)
: stt_atomic a
#Unobservable
emp_inames
(post x ** pure (x == x))
(fun r -> post r ** pure (r == x)) | val return_atomic' (#a x post: _)
: stt_atomic a
#Unobservable
emp_inames
(post x ** pure (x == x))
(fun r -> post r ** pure (r == x)) | let return_atomic' #a x post
: stt_atomic a #Unobservable emp_inames
(post x ** pure (x == x))
(fun r -> post r ** pure (r == x))
= A.return #a #(fun r -> post r ** pure (r == x)) x | {
"file_name": "lib/pulse_core/PulseCore.Atomic.fst",
"git_rev": "f984200f79bdc452374ae994a5ca837496476c41",
"git_url": "https://github.com/FStarLang/steel.git",
"project_name": "steel"
} | {
"end_col": 51,
"end_line": 44,
"start_col": 0,
"start_line": 40
} | module PulseCore.Atomic
module I = PulseCore.InstantiatedSemantics
module A = PulseCore.Action
open PulseCore.InstantiatedSemantics
open PulseCore.Action
let stt_atomic a #obs opens pre post =
A.act a opens pre post
let pure_equiv (p q:prop) (_:squash (p <==> q))
: slprop_equiv (pure p) (pure q)
= FStar.PropositionalExtensionality.apply p q;
slprop_equiv_refl (pure p)
let equiv (#p #q:slprop) (pf:slprop_equiv p q)
: squash (p == q)
= let _ : squash (slprop_equiv p q) = FStar.Squash.return_squash pf in
I.slprop_equiv_elim p q
let pure_trivial (p:prop) (_:squash p)
: squash (pure p == emp)
= calc (==) {
pure p;
(==) { equiv (pure_equiv p True ()) }
pure True;
(==) { equiv (A.pure_true ()) }
emp;
}
let emp_unit_r (p:slprop)
: squash (p ** emp == p)
= calc (==) {
(p ** emp);
(==) { equiv (slprop_equiv_comm p emp) }
(emp ** p);
(==) { equiv (slprop_equiv_unit p) }
p;
} | {
"checked_file": "/",
"dependencies": [
"PulseCore.InstantiatedSemantics.fsti.checked",
"PulseCore.Action.fsti.checked",
"prims.fst.checked",
"FStar.Squash.fsti.checked",
"FStar.Set.fsti.checked",
"FStar.PropositionalExtensionality.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.PCM.fst.checked",
"FStar.Ghost.Pull.fsti.checked",
"FStar.Ghost.fsti.checked",
"FStar.Calc.fsti.checked"
],
"interface_file": true,
"source_file": "PulseCore.Atomic.fst"
} | [
{
"abbrev": false,
"full_module": "PulseCore.Action",
"short_module": null
},
{
"abbrev": false,
"full_module": "PulseCore.InstantiatedSemantics",
"short_module": null
},
{
"abbrev": true,
"full_module": "PulseCore.Action",
"short_module": "A"
},
{
"abbrev": true,
"full_module": "PulseCore.InstantiatedSemantics",
"short_module": "I"
},
{
"abbrev": false,
"full_module": "FStar.Ghost",
"short_module": null
},
{
"abbrev": false,
"full_module": "PulseCore.Observability",
"short_module": null
},
{
"abbrev": false,
"full_module": "PulseCore.Action",
"short_module": null
},
{
"abbrev": false,
"full_module": "PulseCore.InstantiatedSemantics",
"short_module": null
},
{
"abbrev": false,
"full_module": "PulseCore",
"short_module": null
},
{
"abbrev": false,
"full_module": "PulseCore",
"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",
"short_module": null
}
] | {
"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_elim_box": false,
"smtencoding_l_arith_repr": "boxwrap",
"smtencoding_nl_arith_repr": "boxwrap",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": true,
"z3cliopt": [],
"z3refresh": false,
"z3rlimit": 5,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | false | x: a -> post: (_: a -> PulseCore.InstantiatedSemantics.slprop)
-> PulseCore.Atomic.stt_atomic a
PulseCore.Action.emp_inames
(post x ** PulseCore.InstantiatedSemantics.pure (x == x))
(fun r -> post r ** PulseCore.InstantiatedSemantics.pure (r == x)) | Prims.Tot | [
"total"
] | [] | [
"PulseCore.InstantiatedSemantics.slprop",
"PulseCore.Action.return",
"PulseCore.InstantiatedSemantics.op_Star_Star",
"PulseCore.InstantiatedSemantics.pure",
"Prims.eq2",
"PulseCore.Atomic.stt_atomic",
"PulseCore.Observability.Unobservable",
"PulseCore.Action.emp_inames"
] | [] | false | false | false | false | false | let return_atomic' #a x post
: stt_atomic a
#Unobservable
emp_inames
(post x ** pure (x == x))
(fun r -> post r ** pure (r == x)) =
| A.return #a #(fun r -> post r ** pure (r == x)) x | false |
PulseCore.Atomic.fst | PulseCore.Atomic.return_atomic_noeq | val return_atomic_noeq
(#a:Type u#a)
(x:a)
(p:a -> slprop)
: stt_atomic a #Neutral emp_inames (p x) p | val return_atomic_noeq
(#a:Type u#a)
(x:a)
(p:a -> slprop)
: stt_atomic a #Neutral emp_inames (p x) p | let return_atomic_noeq #a x post = A.return #a #post x | {
"file_name": "lib/pulse_core/PulseCore.Atomic.fst",
"git_rev": "f984200f79bdc452374ae994a5ca837496476c41",
"git_url": "https://github.com/FStarLang/steel.git",
"project_name": "steel"
} | {
"end_col": 54,
"end_line": 54,
"start_col": 0,
"start_line": 54
} | module PulseCore.Atomic
module I = PulseCore.InstantiatedSemantics
module A = PulseCore.Action
open PulseCore.InstantiatedSemantics
open PulseCore.Action
let stt_atomic a #obs opens pre post =
A.act a opens pre post
let pure_equiv (p q:prop) (_:squash (p <==> q))
: slprop_equiv (pure p) (pure q)
= FStar.PropositionalExtensionality.apply p q;
slprop_equiv_refl (pure p)
let equiv (#p #q:slprop) (pf:slprop_equiv p q)
: squash (p == q)
= let _ : squash (slprop_equiv p q) = FStar.Squash.return_squash pf in
I.slprop_equiv_elim p q
let pure_trivial (p:prop) (_:squash p)
: squash (pure p == emp)
= calc (==) {
pure p;
(==) { equiv (pure_equiv p True ()) }
pure True;
(==) { equiv (A.pure_true ()) }
emp;
}
let emp_unit_r (p:slprop)
: squash (p ** emp == p)
= calc (==) {
(p ** emp);
(==) { equiv (slprop_equiv_comm p emp) }
(emp ** p);
(==) { equiv (slprop_equiv_unit p) }
p;
}
let return_atomic' #a x post
: stt_atomic a #Unobservable emp_inames
(post x ** pure (x == x))
(fun r -> post r ** pure (r == x))
= A.return #a #(fun r -> post r ** pure (r == x)) x
let return_atomic #a x post
: stt_atomic a #Neutral emp_inames
(post x)
(fun r -> post r ** pure (r == x))
= emp_unit_r (post x);
pure_trivial (x == x) ();
coerce_eq () (return_atomic' #a x post) | {
"checked_file": "/",
"dependencies": [
"PulseCore.InstantiatedSemantics.fsti.checked",
"PulseCore.Action.fsti.checked",
"prims.fst.checked",
"FStar.Squash.fsti.checked",
"FStar.Set.fsti.checked",
"FStar.PropositionalExtensionality.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.PCM.fst.checked",
"FStar.Ghost.Pull.fsti.checked",
"FStar.Ghost.fsti.checked",
"FStar.Calc.fsti.checked"
],
"interface_file": true,
"source_file": "PulseCore.Atomic.fst"
} | [
{
"abbrev": false,
"full_module": "PulseCore.Action",
"short_module": null
},
{
"abbrev": false,
"full_module": "PulseCore.InstantiatedSemantics",
"short_module": null
},
{
"abbrev": true,
"full_module": "PulseCore.Action",
"short_module": "A"
},
{
"abbrev": true,
"full_module": "PulseCore.InstantiatedSemantics",
"short_module": "I"
},
{
"abbrev": false,
"full_module": "FStar.Ghost",
"short_module": null
},
{
"abbrev": false,
"full_module": "PulseCore.Observability",
"short_module": null
},
{
"abbrev": false,
"full_module": "PulseCore.Action",
"short_module": null
},
{
"abbrev": false,
"full_module": "PulseCore.InstantiatedSemantics",
"short_module": null
},
{
"abbrev": false,
"full_module": "PulseCore",
"short_module": null
},
{
"abbrev": false,
"full_module": "PulseCore",
"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",
"short_module": null
}
] | {
"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_elim_box": false,
"smtencoding_l_arith_repr": "boxwrap",
"smtencoding_nl_arith_repr": "boxwrap",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": true,
"z3cliopt": [],
"z3refresh": false,
"z3rlimit": 5,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | false | x: a -> p: (_: a -> PulseCore.InstantiatedSemantics.slprop)
-> PulseCore.Atomic.stt_atomic a PulseCore.Action.emp_inames (p x) p | Prims.Tot | [
"total"
] | [] | [
"PulseCore.InstantiatedSemantics.slprop",
"PulseCore.Action.return",
"PulseCore.Atomic.stt_atomic",
"PulseCore.Observability.Neutral",
"PulseCore.Action.emp_inames"
] | [] | false | false | false | false | false | let return_atomic_noeq #a x post =
| A.return #a #post x | false |
PulseCore.Atomic.fst | PulseCore.Atomic.lift_observability | val lift_observability
(#a:Type u#a)
(#obs #obs':_)
(#opens:inames)
(#pre:slprop)
(#post:a -> slprop)
(e1:stt_atomic a #obs opens pre post)
: stt_atomic a #(join_obs obs obs') opens pre post | val lift_observability
(#a:Type u#a)
(#obs #obs':_)
(#opens:inames)
(#pre:slprop)
(#post:a -> slprop)
(e1:stt_atomic a #obs opens pre post)
: stt_atomic a #(join_obs obs obs') opens pre post | let lift_observability
(#a:Type u#a)
(#obs #obs':_)
(#opens:inames)
(#pre:slprop)
(#post:a -> slprop)
(e:stt_atomic a #obs opens pre post)
= e | {
"file_name": "lib/pulse_core/PulseCore.Atomic.fst",
"git_rev": "f984200f79bdc452374ae994a5ca837496476c41",
"git_url": "https://github.com/FStarLang/steel.git",
"project_name": "steel"
} | {
"end_col": 3,
"end_line": 76,
"start_col": 0,
"start_line": 69
} | module PulseCore.Atomic
module I = PulseCore.InstantiatedSemantics
module A = PulseCore.Action
open PulseCore.InstantiatedSemantics
open PulseCore.Action
let stt_atomic a #obs opens pre post =
A.act a opens pre post
let pure_equiv (p q:prop) (_:squash (p <==> q))
: slprop_equiv (pure p) (pure q)
= FStar.PropositionalExtensionality.apply p q;
slprop_equiv_refl (pure p)
let equiv (#p #q:slprop) (pf:slprop_equiv p q)
: squash (p == q)
= let _ : squash (slprop_equiv p q) = FStar.Squash.return_squash pf in
I.slprop_equiv_elim p q
let pure_trivial (p:prop) (_:squash p)
: squash (pure p == emp)
= calc (==) {
pure p;
(==) { equiv (pure_equiv p True ()) }
pure True;
(==) { equiv (A.pure_true ()) }
emp;
}
let emp_unit_r (p:slprop)
: squash (p ** emp == p)
= calc (==) {
(p ** emp);
(==) { equiv (slprop_equiv_comm p emp) }
(emp ** p);
(==) { equiv (slprop_equiv_unit p) }
p;
}
let return_atomic' #a x post
: stt_atomic a #Unobservable emp_inames
(post x ** pure (x == x))
(fun r -> post r ** pure (r == x))
= A.return #a #(fun r -> post r ** pure (r == x)) x
let return_atomic #a x post
: stt_atomic a #Neutral emp_inames
(post x)
(fun r -> post r ** pure (r == x))
= emp_unit_r (post x);
pure_trivial (x == x) ();
coerce_eq () (return_atomic' #a x post)
let return_atomic_noeq #a x post = A.return #a #post x
let bind_atomic
(#a:Type u#a)
(#b:Type u#b)
(#obs1:_)
(#obs2:observability { at_most_one_observable obs1 obs2 })
(#opens:inames)
(#pre1:slprop)
(#post1:a -> slprop)
(#post2:b -> slprop)
(e1:stt_atomic a #obs1 opens pre1 post1)
(e2:(x:a -> stt_atomic b #obs2 opens (post1 x) post2))
= A.bind e1 e2 | {
"checked_file": "/",
"dependencies": [
"PulseCore.InstantiatedSemantics.fsti.checked",
"PulseCore.Action.fsti.checked",
"prims.fst.checked",
"FStar.Squash.fsti.checked",
"FStar.Set.fsti.checked",
"FStar.PropositionalExtensionality.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.PCM.fst.checked",
"FStar.Ghost.Pull.fsti.checked",
"FStar.Ghost.fsti.checked",
"FStar.Calc.fsti.checked"
],
"interface_file": true,
"source_file": "PulseCore.Atomic.fst"
} | [
{
"abbrev": false,
"full_module": "PulseCore.Action",
"short_module": null
},
{
"abbrev": false,
"full_module": "PulseCore.InstantiatedSemantics",
"short_module": null
},
{
"abbrev": true,
"full_module": "PulseCore.Action",
"short_module": "A"
},
{
"abbrev": true,
"full_module": "PulseCore.InstantiatedSemantics",
"short_module": "I"
},
{
"abbrev": false,
"full_module": "FStar.Ghost",
"short_module": null
},
{
"abbrev": false,
"full_module": "PulseCore.Observability",
"short_module": null
},
{
"abbrev": false,
"full_module": "PulseCore.Action",
"short_module": null
},
{
"abbrev": false,
"full_module": "PulseCore.InstantiatedSemantics",
"short_module": null
},
{
"abbrev": false,
"full_module": "PulseCore",
"short_module": null
},
{
"abbrev": false,
"full_module": "PulseCore",
"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",
"short_module": null
}
] | {
"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_elim_box": false,
"smtencoding_l_arith_repr": "boxwrap",
"smtencoding_nl_arith_repr": "boxwrap",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": true,
"z3cliopt": [],
"z3refresh": false,
"z3rlimit": 5,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | false | e1: PulseCore.Atomic.stt_atomic a opens pre post -> PulseCore.Atomic.stt_atomic a opens pre post | Prims.Tot | [
"total"
] | [] | [
"PulseCore.Observability.observability",
"PulseCore.Action.inames",
"PulseCore.InstantiatedSemantics.slprop",
"PulseCore.Atomic.stt_atomic",
"PulseCore.Observability.join_obs"
] | [] | false | false | false | false | false | let lift_observability
(#a: Type u#a)
(#obs #obs': _)
(#opens: inames)
(#pre: slprop)
(#post: (a -> slprop))
(e: stt_atomic a #obs opens pre post)
=
| e | false |
PulseCore.Atomic.fst | PulseCore.Atomic.lift_atomic0 | val lift_atomic0
(#a:Type u#0)
(#obs:_)
(#opens:inames)
(#pre:slprop)
(#post:a -> slprop)
(e:stt_atomic a #obs opens pre post)
: stt a pre post | val lift_atomic0
(#a:Type u#0)
(#obs:_)
(#opens:inames)
(#pre:slprop)
(#post:a -> slprop)
(e:stt_atomic a #obs opens pre post)
: stt a pre post | let lift_atomic0
(#a:Type u#0)
(#obs:_)
(#opens:inames)
(#pre:slprop)
(#post:a -> slprop)
(e:stt_atomic a #obs opens pre post)
: stt a pre post
= A.lift0 e | {
"file_name": "lib/pulse_core/PulseCore.Atomic.fst",
"git_rev": "f984200f79bdc452374ae994a5ca837496476c41",
"git_url": "https://github.com/FStarLang/steel.git",
"project_name": "steel"
} | {
"end_col": 11,
"end_line": 86,
"start_col": 0,
"start_line": 78
} | module PulseCore.Atomic
module I = PulseCore.InstantiatedSemantics
module A = PulseCore.Action
open PulseCore.InstantiatedSemantics
open PulseCore.Action
let stt_atomic a #obs opens pre post =
A.act a opens pre post
let pure_equiv (p q:prop) (_:squash (p <==> q))
: slprop_equiv (pure p) (pure q)
= FStar.PropositionalExtensionality.apply p q;
slprop_equiv_refl (pure p)
let equiv (#p #q:slprop) (pf:slprop_equiv p q)
: squash (p == q)
= let _ : squash (slprop_equiv p q) = FStar.Squash.return_squash pf in
I.slprop_equiv_elim p q
let pure_trivial (p:prop) (_:squash p)
: squash (pure p == emp)
= calc (==) {
pure p;
(==) { equiv (pure_equiv p True ()) }
pure True;
(==) { equiv (A.pure_true ()) }
emp;
}
let emp_unit_r (p:slprop)
: squash (p ** emp == p)
= calc (==) {
(p ** emp);
(==) { equiv (slprop_equiv_comm p emp) }
(emp ** p);
(==) { equiv (slprop_equiv_unit p) }
p;
}
let return_atomic' #a x post
: stt_atomic a #Unobservable emp_inames
(post x ** pure (x == x))
(fun r -> post r ** pure (r == x))
= A.return #a #(fun r -> post r ** pure (r == x)) x
let return_atomic #a x post
: stt_atomic a #Neutral emp_inames
(post x)
(fun r -> post r ** pure (r == x))
= emp_unit_r (post x);
pure_trivial (x == x) ();
coerce_eq () (return_atomic' #a x post)
let return_atomic_noeq #a x post = A.return #a #post x
let bind_atomic
(#a:Type u#a)
(#b:Type u#b)
(#obs1:_)
(#obs2:observability { at_most_one_observable obs1 obs2 })
(#opens:inames)
(#pre1:slprop)
(#post1:a -> slprop)
(#post2:b -> slprop)
(e1:stt_atomic a #obs1 opens pre1 post1)
(e2:(x:a -> stt_atomic b #obs2 opens (post1 x) post2))
= A.bind e1 e2
let lift_observability
(#a:Type u#a)
(#obs #obs':_)
(#opens:inames)
(#pre:slprop)
(#post:a -> slprop)
(e:stt_atomic a #obs opens pre post)
= e | {
"checked_file": "/",
"dependencies": [
"PulseCore.InstantiatedSemantics.fsti.checked",
"PulseCore.Action.fsti.checked",
"prims.fst.checked",
"FStar.Squash.fsti.checked",
"FStar.Set.fsti.checked",
"FStar.PropositionalExtensionality.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.PCM.fst.checked",
"FStar.Ghost.Pull.fsti.checked",
"FStar.Ghost.fsti.checked",
"FStar.Calc.fsti.checked"
],
"interface_file": true,
"source_file": "PulseCore.Atomic.fst"
} | [
{
"abbrev": false,
"full_module": "PulseCore.Action",
"short_module": null
},
{
"abbrev": false,
"full_module": "PulseCore.InstantiatedSemantics",
"short_module": null
},
{
"abbrev": true,
"full_module": "PulseCore.Action",
"short_module": "A"
},
{
"abbrev": true,
"full_module": "PulseCore.InstantiatedSemantics",
"short_module": "I"
},
{
"abbrev": false,
"full_module": "FStar.Ghost",
"short_module": null
},
{
"abbrev": false,
"full_module": "PulseCore.Observability",
"short_module": null
},
{
"abbrev": false,
"full_module": "PulseCore.Action",
"short_module": null
},
{
"abbrev": false,
"full_module": "PulseCore.InstantiatedSemantics",
"short_module": null
},
{
"abbrev": false,
"full_module": "PulseCore",
"short_module": null
},
{
"abbrev": false,
"full_module": "PulseCore",
"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",
"short_module": null
}
] | {
"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_elim_box": false,
"smtencoding_l_arith_repr": "boxwrap",
"smtencoding_nl_arith_repr": "boxwrap",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": true,
"z3cliopt": [],
"z3refresh": false,
"z3rlimit": 5,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | false | e: PulseCore.Atomic.stt_atomic a opens pre post -> PulseCore.InstantiatedSemantics.stt a pre post | Prims.Tot | [
"total"
] | [] | [
"PulseCore.Observability.observability",
"PulseCore.Action.inames",
"PulseCore.InstantiatedSemantics.slprop",
"PulseCore.Atomic.stt_atomic",
"PulseCore.Action.lift0",
"PulseCore.InstantiatedSemantics.stt"
] | [] | false | false | false | false | false | let lift_atomic0
(#a: Type u#0)
(#obs: _)
(#opens: inames)
(#pre: slprop)
(#post: (a -> slprop))
(e: stt_atomic a #obs opens pre post)
: stt a pre post =
| A.lift0 e | false |
LowParse.Low.Sum.fst | LowParse.Low.Sum.accessor_clens_dsum_cases_unknown_payload | val accessor_clens_dsum_cases_unknown_payload
(t: dsum)
(f: (x: dsum_known_key t -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x))))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
(k: dsum_unknown_key t)
: Tot (accessor (gaccessor_clens_dsum_cases_unknown_payload t f g k)) | val accessor_clens_dsum_cases_unknown_payload
(t: dsum)
(f: (x: dsum_known_key t -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x))))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
(k: dsum_unknown_key t)
: Tot (accessor (gaccessor_clens_dsum_cases_unknown_payload t f g k)) | let accessor_clens_dsum_cases_unknown_payload
(t: dsum)
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
(k: dsum_unknown_key t)
: Tot (accessor (gaccessor_clens_dsum_cases_unknown_payload t f g k))
= [@inline_let]
let _ =
synth_dsum_case_injective t (Unknown k);
synth_dsum_case_inverse t (Unknown k);
synth_injective_synth_inverse_synth_inverse_recip (synth_dsum_case t (Unknown k)) (synth_dsum_case_recip t (Unknown k)) ()
in
accessor_ext
(accessor_synth g (synth_dsum_case t (Unknown k)) (synth_dsum_case_recip t (Unknown k)) ())
(clens_dsum_cases_payload t (Unknown k))
() | {
"file_name": "src/lowparse/LowParse.Low.Sum.fst",
"git_rev": "00217c4a89f5ba56002ba9aa5b4a9d5903bfe9fa",
"git_url": "https://github.com/project-everest/everparse.git",
"project_name": "everparse"
} | {
"end_col": 6,
"end_line": 2155,
"start_col": 0,
"start_line": 2139
} | module LowParse.Low.Sum
include LowParse.Low.Enum
include LowParse.Spec.Sum
module U32 = FStar.UInt32
module HST = FStar.HyperStack.ST
module B = LowStar.Buffer
module Cast = FStar.Int.Cast
module U64 = FStar.UInt64
inline_for_extraction
let validate_sum_cases_aux
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(vc: ((x: sum_key t) -> Tot (validator (dsnd (pc x)))))
(k: sum_key t)
: Tot (validator (parse_sum_cases t pc k))
= [@inline_let]
let _ = synth_sum_case_injective t k in
validate_synth
(validate_weaken
(weaken_parse_cases_kind t pc)
(vc k)
()
)
(synth_sum_case t k)
()
inline_for_extraction
let validate_sum_cases_t
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot Type
= validator (parse_sum_cases t pc k)
let validate_sum_cases_t_eq
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
(x y : validate_sum_cases_t t pc k)
: GTot Type0
= True
inline_for_extraction
let validate_sum_cases_t_if
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (if_combinator _ (validate_sum_cases_t_eq t pc k))
= fun cond (sv_true: cond_true cond -> Tot (validate_sum_cases_t t pc k)) (sv_false: cond_false cond -> Tot (validate_sum_cases_t t pc k)) #rrel #rel input pos ->
if cond
then sv_true () input pos
else sv_false () input pos
inline_for_extraction
let validate_sum_cases
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(vc: ((x: sum_key t) -> Tot (validator (dsnd (pc x)))))
(destr: dep_enum_destr (sum_enum t) (validate_sum_cases_t t pc))
(k: sum_key t)
: Tot (validator (parse_sum_cases t pc k))
= destr
_
(validate_sum_cases_t_if t pc)
(fun _ _ -> ())
(fun _ _ _ _ -> ())
(validate_sum_cases_aux t pc vc)
k
inline_for_extraction
let validate_sum_aux_payload_t
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
: Tot Type
= (#rrel: _) -> (#rel: _) ->
(input: slice rrel rel) ->
(pos: U64.t) ->
HST.Stack U64.t
(requires (fun h -> live_slice h input /\ U64.v pos <= U32.v input.len))
(ensures (fun h res h' ->
B.modifies B.loc_none h h' /\ (
match k with
| Unknown _ -> is_error res
| Known k' ->
if is_success res
then
valid_pos (dsnd (pc k')) h input (uint64_to_uint32 pos) (uint64_to_uint32 res)
else
(~ (valid (dsnd (pc k')) h input (uint64_to_uint32 pos)))
)))
let validate_sum_aux_payload_eq
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
: Tot (validate_sum_aux_payload_t t pc k -> validate_sum_aux_payload_t t pc k -> GTot Type0)
= fun _ _ -> True
inline_for_extraction
let validate_sum_aux_payload_if'
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
(cond: bool)
(ift: ((cond_true cond) -> Tot (validate_sum_aux_payload_t t pc k)))
(iff: ((cond_false cond) -> Tot (validate_sum_aux_payload_t t pc k)))
: Tot (validate_sum_aux_payload_t t pc k)
= fun #rrel #rel input pos ->
if cond
then begin
(ift () <: validate_sum_aux_payload_t t pc k) input pos
end else
(iff () <: validate_sum_aux_payload_t t pc k) input pos
inline_for_extraction
let validate_sum_aux_payload_if
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
: Tot (if_combinator _ (validate_sum_aux_payload_eq t pc k))
= validate_sum_aux_payload_if' t pc k
#push-options "--z3rlimit 64 --z3cliopt smt.arith.nl=false --using_facts_from '* -FStar.Int.Cast -LowParse.BitFields'"
// --query_stats --smtencoding.elim_box true --smtencoding.l_arith_repr native --z3refresh"
inline_for_extraction
let validate_sum_aux
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(v: validator p)
(p32: leaf_reader p)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(v_payload: ((k: sum_repr_type t)) -> Tot (validate_sum_aux_payload_t t pc (maybe_enum_key_of_repr (sum_enum t) k)))
: Tot (validator (parse_sum t p pc))
= fun #rrel #rel input pos ->
let h = HST.get () in
[@inline_let]
let _ = parse_sum_eq'' t p pc (bytes_of_slice_from h input (uint64_to_uint32 pos)) in
[@inline_let]
let _ = valid_facts (parse_sum t p pc) h input (uint64_to_uint32 pos) in
[@inline_let]
let _ = valid_facts p h input (uint64_to_uint32 pos) in
let len_after_tag = v input pos in
if is_error len_after_tag
then len_after_tag
else begin
let h1 = HST.get () in
let k' = p32 input (uint64_to_uint32 pos) in
[@inline_let]
let _ =
match maybe_enum_key_of_repr (sum_enum t) k' with
| Known k -> valid_facts (dsnd (pc k)) h input (uint64_to_uint32 len_after_tag)
| _ -> ()
in
v_payload k' input len_after_tag
end
#pop-options
inline_for_extraction
let validate_sum_aux_payload'
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (validator (dsnd (pc x)))))
(k: maybe_enum_key (sum_enum t))
: Tot (validate_sum_aux_payload_t t pc k)
= fun #rrel #rel input pos ->
match k with
| Known k ->
[@inline_let]
let _ = synth_sum_case_injective t k in
pc32 k input pos
// validate_synth (pc32 k) (synth_sum_case t k) () input pos
| _ -> validator_error_generic
inline_for_extraction
let validate_sum_aux_payload
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (validator (dsnd (pc x)))))
(destr: dep_maybe_enum_destr_t (sum_enum t) (validate_sum_aux_payload_t t pc))
(k: sum_repr_type t)
: Tot (validate_sum_aux_payload_t t pc (maybe_enum_key_of_repr (sum_enum t) k))
= destr (validate_sum_aux_payload_eq t pc) (validate_sum_aux_payload_if t pc) (fun _ _ -> ()) (fun _ _ _ _ -> ()) (validate_sum_aux_payload' t pc pc32) k
inline_for_extraction
let validate_sum
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(v: validator p)
(p32: leaf_reader p)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (validator (dsnd (pc x)))))
(destr: dep_maybe_enum_destr_t (sum_enum t) (validate_sum_aux_payload_t t pc))
: Tot (validator (parse_sum t p pc))
= validate_sum_aux t v p32 pc (validate_sum_aux_payload t pc pc32 destr)
module HS = FStar.HyperStack
#push-options "--z3rlimit 256 --z3cliopt smt.arith.nl=false --initial_ifuel 8 --max_ifuel 8 --initial_fuel 2 --max_fuel 2"
#restart-solver
let valid_sum_intro
(h: HS.mem)
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: Lemma
(requires (
valid (parse_enum_key p (sum_enum t)) h input pos /\ (
let k = contents (parse_enum_key p (sum_enum t)) h input pos in
valid (dsnd (pc k)) h input (get_valid_pos (parse_enum_key p (sum_enum t)) h input pos)
)))
(ensures (
let k = contents (parse_enum_key p (sum_enum t)) h input pos in
let pos_payload = get_valid_pos (parse_enum_key p (sum_enum t)) h input pos in
valid_content_pos
(parse_sum t p pc) h input pos
(synth_sum_case t k (contents (dsnd (pc k)) h input pos_payload))
(get_valid_pos (dsnd (pc k)) h input pos_payload)
))
= valid_facts (parse_enum_key p (sum_enum t)) h input pos;
let k = contents (parse_enum_key p (sum_enum t)) h input pos in
let pos_payload = get_valid_pos (parse_enum_key p (sum_enum t)) h input pos in
valid_facts (dsnd (pc k)) h input pos_payload;
valid_facts (parse_sum t p pc) h input pos;
parse_sum_eq t p pc (bytes_of_slice_from h input pos)
#pop-options
inline_for_extraction
let finalize_sum_case
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(s: serializer p)
(w: leaf_writer_strong s)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(destr: enum_repr_of_key'_t (sum_enum t))
(k: sum_key t)
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: HST.Stack unit
(requires (fun h ->
let len_tag = serialized_length (serialize_enum_key _ s (sum_enum t)) k in
U32.v pos + len_tag < 4294967296 /\ (
let pos_payload = pos `U32.add` U32.uint_to_t len_tag in
valid (dsnd (pc k)) h input pos_payload /\
writable input.base (U32.v pos) (U32.v pos_payload) h
)))
(ensures (fun h _ h' ->
let len_tag = serialized_length (serialize_enum_key _ s (sum_enum t)) k in
let pos_payload = pos `U32.add` U32.uint_to_t len_tag in
B.modifies (loc_slice_from_to input pos pos_payload) h h' /\
valid_content_pos (parse_sum t p pc) h' input pos (synth_sum_case t k (contents (dsnd (pc k)) h input pos_payload)) (get_valid_pos (dsnd (pc k)) h input pos_payload)
))
= let pos1 = write_enum_key w (sum_enum t) destr k input pos in
let h = HST.get () in
[@inline_let]
let _ = valid_sum_intro h t p pc input pos in
()
inline_for_extraction
let jump_sum_cases_aux
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(vc: ((x: sum_key t) -> Tot (jumper (dsnd (pc x)))))
(k: sum_key t)
: Tot (jumper (parse_sum_cases t pc k))
= [@inline_let]
let _ = synth_sum_case_injective t k in
jump_synth
(jump_weaken
(weaken_parse_cases_kind t pc)
(vc k)
()
)
(synth_sum_case t k)
()
inline_for_extraction
let jump_sum_cases_t
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot Type
= jumper (parse_sum_cases t pc k)
let jump_sum_cases_t_eq
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
(x y : jump_sum_cases_t t pc k)
: GTot Type0
= True
inline_for_extraction
let jump_sum_cases_t_if
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (if_combinator _ (jump_sum_cases_t_eq t pc k))
= fun cond (sv_true: cond_true cond -> Tot (jump_sum_cases_t t pc k)) (sv_false: cond_false cond -> Tot (jump_sum_cases_t t pc k)) #rrel #rel input pos ->
if cond
then sv_true () input pos
else sv_false () input pos
inline_for_extraction
let jump_sum_cases
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(vc: ((x: sum_key t) -> Tot (jumper (dsnd (pc x)))))
(destr: dep_enum_destr (sum_enum t) (jump_sum_cases_t t pc))
(k: sum_key t)
: Tot (jumper (parse_sum_cases t pc k))
= destr
_
(jump_sum_cases_t_if t pc)
(fun _ _ -> ())
(fun _ _ _ _ -> ())
(jump_sum_cases_aux t pc vc)
k
inline_for_extraction
let jump_sum_aux_payload_t
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
: Tot Type
= (#rrel: _) -> (#rel: _) ->
(input: slice rrel rel) ->
(pos: U32.t) ->
HST.Stack U32.t
(requires (fun h -> live_slice h input /\ U32.v pos <= U32.v input.len /\ (
match k with
| Unknown _ -> False
| Known k' -> valid (dsnd (pc k')) h input pos
)))
(ensures (fun h res h' ->
B.modifies B.loc_none h h' /\ (
match k with
| Unknown _ -> False
| Known k' ->
valid_pos (dsnd (pc k')) h input pos res
)))
let jump_sum_aux_payload_eq
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
: Tot (jump_sum_aux_payload_t t pc k -> jump_sum_aux_payload_t t pc k -> GTot Type0)
= fun _ _ -> True
inline_for_extraction
let jump_sum_aux_payload_if'
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
(cond: bool)
(ift: ((cond_true cond) -> Tot (jump_sum_aux_payload_t t pc k)))
(iff: ((cond_false cond) -> Tot (jump_sum_aux_payload_t t pc k)))
: Tot (jump_sum_aux_payload_t t pc k)
= fun #rrel #rel input pos ->
if cond
then begin
(ift () <: jump_sum_aux_payload_t t pc k) input pos
end else
(iff () <: jump_sum_aux_payload_t t pc k) input pos
inline_for_extraction
let jump_sum_aux_payload_if
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
: Tot (if_combinator _ (jump_sum_aux_payload_eq t pc k))
= jump_sum_aux_payload_if' t pc k
let parse_sum_eq3
(#kt: parser_kind)
(t: sum)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(input: bytes)
(k' : sum_repr_type t)
(consumed_k: consumed_length input)
: Lemma
(requires (Some? (parse (parse_sum t p pc) input) /\ parse p input == Some (k', consumed_k)))
(ensures (
let input_k = Seq.slice input consumed_k (Seq.length input) in
let k = maybe_enum_key_of_repr (sum_enum t) k' in
begin match k with
| Known k ->
Some? (parse (dsnd (pc k)) input_k)
| _ -> False
end
))
= parse_sum_eq'' t p pc input
let parse_sum_eq4
(#kt: parser_kind)
(t: sum)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(input: bytes)
(k' : sum_repr_type t)
(consumed_k: consumed_length input)
(consumed_payload: nat)
: Lemma
(requires (Some? (parse (parse_sum t p pc) input) /\ parse p input == Some (k', consumed_k) /\ (
let input_k = Seq.slice input consumed_k (Seq.length input) in
let k = maybe_enum_key_of_repr (sum_enum t) k' in
begin match k with
| Known k ->
Some? (parse (dsnd (pc k)) input_k) /\ (
let Some (_, consumed_payload') = parse (dsnd (pc k)) input_k in
consumed_payload' == consumed_payload
)
| _ -> False
end
)))
(ensures (
let Some (_, consumed) = parse (parse_sum t p pc) input in
consumed == consumed_k + consumed_payload
))
= parse_sum_eq'' t p pc input
#push-options "--z3rlimit 16"
let valid_sum_elim
(h: HS.mem)
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(#rrel: _) (#rel: _)
(input: slice rrel rel)
(pos: U32.t)
: Lemma
(requires (
valid (parse_sum t p pc) h input pos
))
(ensures (
valid p h input pos /\ (
let pos_payload = get_valid_pos p h input pos in
let k' = maybe_enum_key_of_repr (sum_enum t) (contents p h input pos) in
match k' with
| Known k ->
k == sum_tag_of_data t (contents (parse_sum t p pc) h input pos) /\
valid (dsnd (pc k)) h input pos_payload /\
valid_pos
(parse_sum t p pc) h input pos
(get_valid_pos (dsnd (pc k)) h input pos_payload)
| _ -> False
)))
= let sinput = bytes_of_slice_from h input pos in
let _ = parse_sum_eq'' t p pc sinput in
[@inline_let]
let _ = valid_facts (parse_sum t p pc) h input pos in
let Some (k', consumed_k) = parse p sinput in
let pos_after_tag = U32.uint_to_t (U32.v pos + consumed_k) in
[@inline_let]
let _ = valid_facts p h input pos in
assert (valid_content_pos p h input pos k' pos_after_tag);
match maybe_enum_key_of_repr (sum_enum t) k' with
| Known k -> valid_facts (dsnd (pc k)) h input pos_after_tag
| _ -> ()
#pop-options
let valid_sum_elim_tag
(h: HS.mem)
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: Lemma
(requires (
valid (parse_sum t p pc) h input pos
))
(ensures (
valid (parse_enum_key p (sum_enum t)) h input pos /\
contents (parse_enum_key p (sum_enum t)) h input pos == sum_tag_of_data t (contents (parse_sum t p pc) h input pos)
))
= let _ = parse_sum_eq' t p pc (bytes_of_slice_from h input pos) in
let _ = valid_facts (parse_sum t p pc) h input pos in
let _ = valid_facts (parse_enum_key p (sum_enum t)) h input pos in
()
inline_for_extraction
let read_sum_tag
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(p32: leaf_reader p)
(destr: dep_maybe_enum_destr_t (sum_enum t) (read_enum_key_t (sum_enum t)))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: HST.Stack (sum_key t)
(requires (fun h ->
valid (parse_sum t p pc) h input pos
))
(ensures (fun h res h' ->
B.modifies B.loc_none h h' /\
res == sum_tag_of_data t (contents (parse_sum t p pc) h input pos)
))
= let h = HST.get () in
[@inline_let] let _ = valid_sum_elim_tag h t p pc input pos in
read_enum_key p32 (sum_enum t) destr input pos
inline_for_extraction
let jump_sum_aux
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(v: jumper p)
(p32: leaf_reader p)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(v_payload: ((k: sum_repr_type t)) -> Tot (jump_sum_aux_payload_t t pc (maybe_enum_key_of_repr (sum_enum t) k)))
: Tot (jumper (parse_sum t p pc))
= fun #rrel #rel input pos ->
let h = HST.get () in
[@inline_let]
let _ = valid_sum_elim h t p pc input pos in
let pos_after_tag = v input pos in
let k' = p32 input pos in
v_payload k' input pos_after_tag
inline_for_extraction
let jump_sum_aux_payload'
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (jumper (dsnd (pc x)))))
(k: maybe_enum_key (sum_enum t))
: Tot (jump_sum_aux_payload_t t pc k)
= fun #rrel #rel input pos ->
match k with
| Known k ->
[@inline_let]
let _ = synth_sum_case_injective t k in
pc32 k input pos
| _ -> 0ul // dummy, but we MUST NOT remove this branch, otherwise extraction fails
inline_for_extraction
let jump_sum_aux_payload
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (jumper (dsnd (pc x)))))
(destr: dep_maybe_enum_destr_t (sum_enum t) (jump_sum_aux_payload_t t pc))
(k: sum_repr_type t)
: Tot (jump_sum_aux_payload_t t pc (maybe_enum_key_of_repr (sum_enum t) k))
= destr (jump_sum_aux_payload_eq t pc) (jump_sum_aux_payload_if t pc) (fun _ _ -> ()) (fun _ _ _ _ -> ()) (jump_sum_aux_payload' t pc pc32) k
inline_for_extraction
let jump_sum
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(v: jumper p)
(p32: leaf_reader p)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (jumper (dsnd (pc x)))))
(destr: dep_maybe_enum_destr_t (sum_enum t) (jump_sum_aux_payload_t t pc))
: Tot (jumper (parse_sum t p pc))
= jump_sum_aux t v p32 pc (jump_sum_aux_payload t pc pc32 destr)
inline_for_extraction
let read_sum_cases'
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (leaf_reader (dsnd (pc x)))))
(k: sum_key t)
: Tot (leaf_reader (parse_sum_cases' t pc k))
= [@inline_let]
let _ = synth_sum_case_injective t k in
read_synth'
(dsnd (pc k))
(synth_sum_case t k)
(pc32 k)
()
inline_for_extraction
let read_sum_cases_t
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot Type
= leaf_reader (parse_sum_cases' t pc k)
let read_sum_cases_t_eq
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
(x y : read_sum_cases_t t pc k)
: GTot Type0
= True
inline_for_extraction
let read_sum_cases_t_if
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (if_combinator _ (read_sum_cases_t_eq t pc k))
= fun cond (sv_true: cond_true cond -> Tot (read_sum_cases_t t pc k)) (sv_false: cond_false cond -> Tot (read_sum_cases_t t pc k)) #_ #_ input pos ->
if cond
then (sv_true () input pos)
else (sv_false () input pos)
inline_for_extraction
let read_sum_cases
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (leaf_reader (dsnd (pc x)))))
(destr: dep_enum_destr (sum_enum t) (read_sum_cases_t t pc))
(k: sum_key t)
: Tot (leaf_reader (parse_sum_cases' t pc k))
= destr
_
(read_sum_cases_t_if t pc)
(fun _ _ -> ())
(fun _ _ _ _ -> ())
(read_sum_cases' t pc pc32)
k
#push-options "--z3rlimit 32"
inline_for_extraction
let read_sum
(#kt: parser_kind)
(t: sum)
(p: parser kt (sum_repr_type t))
(p32: leaf_reader (parse_enum_key p (sum_enum t)))
(j: jumper p)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (leaf_reader (dsnd (pc x)))))
(destr: dep_enum_destr (sum_enum t) (read_sum_cases_t t pc))
: Tot (leaf_reader (parse_sum t p pc))
=
fun #_ #_ input pos ->
let h = HST.get () in
valid_facts (parse_sum t p pc) h input pos;
parse_sum_eq' t p pc (bytes_of_slice_from h input pos);
valid_facts (parse_enum_key p (sum_enum t)) h input pos;
let k = p32 input pos in
let pos' = jump_enum_key j (sum_enum t) input pos in
valid_facts (parse_sum_cases' t pc k) h input pos' ;
read_sum_cases t pc pc32 destr k input pos'
#pop-options
inline_for_extraction
let serialize32_sum_cases_t
(t: sum)
(#pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(sc: ((x: sum_key t) -> Tot (serializer (dsnd (pc x)))))
(k: sum_key t)
: Tot Type
= serializer32 (serialize_sum_cases t pc sc k)
let serialize32_sum_cases_t_eq
(t: sum)
(#pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(sc: ((x: sum_key t) -> Tot (serializer (dsnd (pc x)))))
(k: sum_key t)
(x y: serialize32_sum_cases_t t sc k)
: GTot Type0
= True
inline_for_extraction
let serialize32_sum_cases_t_if
(t: sum)
(#pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(sc: ((x: sum_key t) -> Tot (serializer (dsnd (pc x)))))
(k: sum_key t)
: Tot (if_combinator _ (serialize32_sum_cases_t_eq t sc k))
= fun cond (sv_true: (cond_true cond -> Tot (serialize32_sum_cases_t t sc k))) (sv_false: (cond_false cond -> Tot (serialize32_sum_cases_t t sc k))) x #rrel #rel b pos ->
if cond
then (sv_true () x b pos)
else (sv_false () x b pos)
inline_for_extraction
let serialize32_sum_cases_aux
(t: sum)
(#pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(sc: ((x: sum_key t) -> Tot (serializer (dsnd (pc x)))))
(sc32: ((x: sum_key t) -> Tot (serializer32 (sc x))))
(k: sum_key t)
: Tot (serializer32 (serialize_sum_cases t pc sc k))
= fun x #rrel #rel b pos ->
[@inline_let] let _ =
Classical.forall_intro (parse_sum_cases_eq' t pc k);
synth_sum_case_injective t k;
synth_sum_case_inverse t k
in
serialize32_synth
(sc32 k)
(synth_sum_case t k)
(synth_sum_case_recip t k)
(fun x -> synth_sum_case_recip t k x)
()
x
b
pos
inline_for_extraction
let serialize32_sum_cases
(t: sum)
(#pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(sc: ((x: sum_key t) -> Tot (serializer (dsnd (pc x)))))
(sc32: ((x: sum_key t) -> Tot (serializer32 (sc x))))
(destr: dep_enum_destr (sum_enum t) (serialize32_sum_cases_t t sc))
(k: sum_key t)
: Tot (serializer32 (serialize_sum_cases t pc sc k))
= destr
_
(serialize32_sum_cases_t_if t sc)
(fun _ _ -> ())
(fun _ _ _ _ -> ())
(serialize32_sum_cases_aux t sc sc32)
k
inline_for_extraction
let serialize32_sum
(#kt: parser_kind)
(t: sum)
(#p: parser kt (sum_repr_type t))
(s: serializer p {kt.parser_kind_subkind == Some ParserStrong})
(s32: serializer32 (serialize_enum_key _ s (sum_enum t)))
(#pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(sc: ((x: sum_key t) -> Tot (serializer (dsnd (pc x)))))
(sc32: ((x: sum_key t) -> Tot (serializer32 (sc x))))
(destr: dep_enum_destr (sum_enum t) (serialize32_sum_cases_t t sc))
: Tot (serializer32 (serialize_sum t s sc))
= fun x #rrel #rel b pos ->
serialize_sum_eq t s sc x;
let tg = sum_tag_of_data t x in
serialize32_nondep_then_aux s32 (serialize32_sum_cases t sc sc32 destr tg) tg x b pos
let clens_sum_tag
(s: sum)
: Tot (clens (sum_type s) (sum_key s))
= {
clens_cond = (fun _ -> True);
clens_get = sum_tag_of_data s;
}
let gaccessor_sum_tag
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
: Tot (gaccessor (parse_sum t p pc) (parse_enum_key p (sum_enum t)) (clens_sum_tag t))
= gaccessor_tagged_union_tag
(parse_enum_key p (sum_enum t))
(sum_tag_of_data t)
(parse_sum_cases t pc)
inline_for_extraction
let accessor_sum_tag
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
: Tot (accessor (gaccessor_sum_tag t p pc))
= accessor_tagged_union_tag
(parse_enum_key p (sum_enum t))
(sum_tag_of_data t)
(parse_sum_cases t pc)
let clens_sum_payload
(s: sum)
(k: sum_key s)
: Tot (clens (sum_type s) (sum_type_of_tag s k))
= {
clens_cond = (fun (x: sum_type s) -> sum_tag_of_data s x == k);
clens_get = (fun (x: sum_type s) -> synth_sum_case_recip s k x <: Ghost (sum_type_of_tag s k) (requires (sum_tag_of_data s x == k)) (ensures (fun _ -> True)));
}
#push-options "--z3rlimit 32"
let gaccessor_clens_sum_payload'
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (gaccessor' (parse_sum t p pc) (dsnd (pc k)) (clens_sum_payload t k))
= fun (input: bytes) ->
parse_sum_eq'' t p pc input;
let res =
match parse p input with
| Some (_, consumed) ->
synth_sum_case_inverse t k;
synth_sum_case_injective t k;
synth_injective_synth_inverse_synth_inverse_recip (synth_sum_case t k) (synth_sum_case_recip t k) ();
(consumed)
| _ -> 0 // dummy
in
(res <: (res: _ { gaccessor_post' (parse_sum t p pc) (dsnd (pc k)) (clens_sum_payload t k) input res } ))
#push-options "--z3rlimit 64"
let gaccessor_clens_sum_payload_injective
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
(sl sl' : bytes)
: Lemma
(requires (
gaccessor_pre (parse_sum t p pc) (dsnd (pc k)) (clens_sum_payload t k) sl /\
gaccessor_pre (parse_sum t p pc) (dsnd (pc k)) (clens_sum_payload t k) sl' /\
injective_precond (parse_sum t p pc) sl sl'
))
(ensures (gaccessor_clens_sum_payload' t p pc k sl == gaccessor_clens_sum_payload' t p pc k sl'))
= parse_sum_eq'' t p pc sl;
parse_sum_eq'' t p pc sl' ;
parse_injective (parse_sum t p pc) sl sl' ;
parse_injective p sl sl'
#pop-options
let gaccessor_clens_sum_payload_no_lookahead
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
(sl sl' : bytes)
: Lemma
(requires (
(parse_sum_kind kt t pc).parser_kind_subkind == Some ParserStrong /\
gaccessor_pre (parse_sum t p pc) (dsnd (pc k)) (clens_sum_payload t k) sl /\
gaccessor_pre (parse_sum t p pc) (dsnd (pc k)) (clens_sum_payload t k) sl' /\
no_lookahead_on_precond (parse_sum t p pc) sl sl'
))
(ensures (gaccessor_clens_sum_payload' t p pc k sl == gaccessor_clens_sum_payload' t p pc k sl'))
= parse_sum_eq'' t p pc sl;
parse_sum_eq'' t p pc sl' ;
parse_strong_prefix (parse_sum t p pc) sl sl' ;
parse_injective p sl sl'
let gaccessor_clens_sum_payload
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (gaccessor (parse_sum t p pc) (dsnd (pc k)) (clens_sum_payload t k))
= Classical.forall_intro_2 (fun x -> Classical.move_requires (gaccessor_clens_sum_payload_injective t p pc k x));
Classical.forall_intro_2 (fun x -> Classical.move_requires (gaccessor_clens_sum_payload_no_lookahead t p pc k x));
gaccessor_prop_equiv (parse_sum t p pc) (dsnd (pc k)) (clens_sum_payload t k) (gaccessor_clens_sum_payload' t p pc k);
gaccessor_clens_sum_payload' t p pc k
inline_for_extraction
let accessor_clens_sum_payload'
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(j: jumper p)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: HST.Stack U32.t
(requires (fun h ->
valid (parse_sum t p pc) h input pos /\
(clens_sum_payload t k).clens_cond (contents (parse_sum t p pc) h input pos)
))
(ensures (fun h pos' h' ->
B.modifies B.loc_none h h' /\
pos' == slice_access h (gaccessor_clens_sum_payload t p pc k) input pos
))
=
let h = HST.get () in
[@inline_let]
let _ =
let pos' = get_valid_pos (parse_sum t p pc) h input pos in
let large = bytes_of_slice_from h input pos in
slice_access_eq h (gaccessor_clens_sum_payload t p pc k) input pos;
valid_facts (parse_sum t p pc) h input pos;
parse_sum_eq'' t p pc large;
valid_facts p h input pos
in
j input pos
#pop-options
inline_for_extraction
let accessor_clens_sum_payload
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(j: jumper p)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (accessor (gaccessor_clens_sum_payload t p pc k))
= fun #rrel #rel -> accessor_clens_sum_payload' t j pc k #rrel #rel
let clens_sum_cases_payload
(s: sum)
(k: sum_key s)
: Tot (clens (sum_cases s k) (sum_type_of_tag s k))
= {
clens_cond = (fun (x: sum_cases s k) -> True);
clens_get = (fun (x: sum_cases s k) -> synth_sum_case_recip s k x <: Ghost (sum_type_of_tag s k) (requires (True)) (ensures (fun _ -> True)));
}
let gaccessor_clens_sum_cases_payload
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (gaccessor (parse_sum_cases' t pc k) (dsnd (pc k)) (clens_sum_cases_payload t k))
= synth_sum_case_injective t k;
synth_sum_case_inverse t k;
synth_injective_synth_inverse_synth_inverse_recip (synth_sum_case t k) (synth_sum_case_recip t k) ();
gaccessor_ext
(gaccessor_synth (dsnd (pc k)) (synth_sum_case t k) (synth_sum_case_recip t k) ())
(clens_sum_cases_payload t k)
()
inline_for_extraction
let accessor_clens_sum_cases_payload
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (accessor (gaccessor_clens_sum_cases_payload t pc k))
= [@inline_let]
let _ =
synth_sum_case_injective t k;
synth_sum_case_inverse t k;
synth_injective_synth_inverse_synth_inverse_recip (synth_sum_case t k) (synth_sum_case_recip t k) ()
in
accessor_ext
(accessor_synth (dsnd (pc k)) (synth_sum_case t k) (synth_sum_case_recip t k) ())
(clens_sum_cases_payload t k)
()
inline_for_extraction
let validate_dsum_cases_t
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(#k: parser_kind)
(g: parser k (dsum_type_of_unknown_tag s))
(x: dsum_key s)
: Tot Type
= validator (parse_dsum_cases' s f g x)
let validate_dsum_cases_eq
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(#k: parser_kind)
(g: parser k (dsum_type_of_unknown_tag s))
(x: dsum_key s)
(v1 v2 : validate_dsum_cases_t s f g x)
: GTot Type0
= True
inline_for_extraction
let validate_dsum_cases_if'
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(#k: parser_kind)
(g: parser k (dsum_type_of_unknown_tag s))
(x: dsum_key s)
(cond: bool)
(ift: (cond_true cond -> Tot (validate_dsum_cases_t s f g x)))
(iff: (cond_false cond -> Tot (validate_dsum_cases_t s f g x)))
: Tot (validate_dsum_cases_t s f g x)
= fun #rrel #rel input len ->
if cond
then (ift () <: validate_dsum_cases_t s f g x) input len
else (iff () <: validate_dsum_cases_t s f g x) input len
inline_for_extraction
let validate_dsum_cases_if
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(#k: parser_kind)
(g: parser k (dsum_type_of_unknown_tag s))
(x: dsum_key s)
: Tot (if_combinator _ (validate_dsum_cases_eq s f g x))
= validate_dsum_cases_if' s f g x
inline_for_extraction
let validate_dsum_cases'
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(f' : (x: dsum_known_key s) -> Tot (validator (dsnd (f x))))
(#k: parser_kind)
(#g: parser k (dsum_type_of_unknown_tag s))
(g' : validator g)
(x: dsum_key s)
: Tot (validate_dsum_cases_t s f g x)
= [@inline_let]
let _ = synth_dsum_case_injective s x in
match x with
| Known x' -> validate_synth (f' x') (synth_dsum_case s (Known x')) () <: validator (parse_dsum_cases' s f g x)
| Unknown x' -> validate_synth g' (synth_dsum_case s (Unknown x')) () <: validator (parse_dsum_cases' s f g x)
inline_for_extraction
let validate_dsum_cases'_destr
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(f' : (x: dsum_known_key s) -> Tot (validator (dsnd (f x))))
(#k: parser_kind)
(#g: parser k (dsum_type_of_unknown_tag s))
(g' : validator g)
(destr: dep_enum_destr _ (fun k -> validate_dsum_cases_t s f g (Known k)))
(x: dsum_key s)
: Tot (validate_dsum_cases_t s f g x)
= fun #rrel #rel input pos ->
match x with
| Known k ->
destr
_
(fun k -> validate_dsum_cases_if s f g (Known k))
(fun _ _ -> ())
(fun _ _ _ _ -> ())
(fun k -> validate_dsum_cases' s f f' g' (Known k))
k
input
pos
| Unknown r -> validate_dsum_cases' s f f' g' (Unknown r) input pos
inline_for_extraction
let validate_dsum_cases
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(f' : (x: dsum_known_key s) -> Tot (validator (dsnd (f x))))
(#k: parser_kind)
(#g: parser k (dsum_type_of_unknown_tag s))
(g' : validator g)
(destr: dep_enum_destr _ (fun k -> validate_dsum_cases_t s f g (Known k)))
(x: dsum_key s)
: Tot (validator (parse_dsum_cases s f g x))
= fun #rrel #rel input pos ->
let h = HST.get () in
[@inline_let]
let _ =
valid_facts (parse_dsum_cases' s f g x) h input (uint64_to_uint32 pos);
valid_facts (parse_dsum_cases s f g x) h input (uint64_to_uint32 pos);
parse_dsum_cases_eq' s f g x (bytes_of_slice_from h input (uint64_to_uint32 pos))
in
validate_dsum_cases'_destr s f f' g' destr x input pos
#push-options "--z3rlimit 40"
inline_for_extraction
let validate_dsum
(#kt: parser_kind)
(t: dsum)
(#p: parser kt (dsum_repr_type t))
(v: validator p)
(p32: leaf_reader p)
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(f32: (x: dsum_known_key t) -> Tot (validator (dsnd (f x))))
(#k': parser_kind)
(#g: parser k' (dsum_type_of_unknown_tag t))
(g32: validator g)
(destr: dep_maybe_enum_destr_t (dsum_enum t) (validate_dsum_cases_t t f g))
: Tot (validator (parse_dsum t p f g))
= fun #rrel #rel input pos ->
let h = HST.get () in
[@inline_let]
let _ = parse_dsum_eq' t p f g (bytes_of_slice_from h input (uint64_to_uint32 pos)) in
[@inline_let]
let _ = valid_facts (parse_dsum t p f g) h input (uint64_to_uint32 pos) in
[@inline_let]
let _ = valid_facts p h input (uint64_to_uint32 pos) in
let pos_after_tag = v input pos in
if is_error pos_after_tag
then pos_after_tag
else
let tg = p32 input (uint64_to_uint32 pos) in
[@inline_let]
let _ = valid_facts (parse_dsum_cases' t f g (maybe_enum_key_of_repr (dsum_enum t) tg)) h input (uint64_to_uint32 pos_after_tag) in
destr (validate_dsum_cases_eq t f g) (validate_dsum_cases_if t f g) (fun _ _ -> ()) (fun _ _ _ _ -> ()) (validate_dsum_cases' t f f32 g32) tg input pos_after_tag
#pop-options
#reset-options "--z3rlimit 64 --z3cliopt smt.arith.nl=false --initial_ifuel 8 --max_ifuel 8 --initial_fuel 2 --max_fuel 2"
let valid_dsum_intro_known
(h: HS.mem)
(t: dsum)
(#kt: parser_kind)
(p: parser kt (dsum_repr_type t))
(f: ((x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x))))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: Lemma
(requires (
valid (parse_maybe_enum_key p (dsum_enum t)) h input pos /\ (
let k' = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
Known? k' /\ (
let Known k = k' in
valid (dsnd (f k)) h input (get_valid_pos (parse_maybe_enum_key p (dsum_enum t)) h input pos)
))))
(ensures (
let Known k = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
let pos_payload = get_valid_pos (parse_maybe_enum_key p (dsum_enum t)) h input pos in
valid_content_pos
(parse_dsum t p f g) h input pos
(synth_dsum_case t (Known k) (contents (dsnd (f k)) h input pos_payload))
(get_valid_pos (dsnd (f k)) h input pos_payload)
))
= valid_facts (parse_maybe_enum_key p (dsum_enum t)) h input pos;
let Known k = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
let pos_payload = get_valid_pos (parse_maybe_enum_key p (dsum_enum t)) h input pos in
valid_facts (dsnd (f k)) h input pos_payload;
valid_facts (parse_dsum t p f g) h input pos;
parse_dsum_eq t p f g (bytes_of_slice_from h input pos)
let valid_dsum_intro_unknown
(h: HS.mem)
(t: dsum)
(#kt: parser_kind)
(p: parser kt (dsum_repr_type t))
(f: ((x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x))))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: Lemma
(requires (
valid (parse_maybe_enum_key p (dsum_enum t)) h input pos /\ (
let k' = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
Unknown? k' /\
valid g h input (get_valid_pos (parse_maybe_enum_key p (dsum_enum t)) h input pos)
)))
(ensures (
let Unknown r = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
let pos_payload = get_valid_pos (parse_maybe_enum_key p (dsum_enum t)) h input pos in
valid_content_pos
(parse_dsum t p f g) h input pos
(synth_dsum_case t (Unknown r) (contents g h input pos_payload))
(get_valid_pos g h input pos_payload)
))
= valid_facts (parse_maybe_enum_key p (dsum_enum t)) h input pos;
let Unknown r = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
let pos_payload = get_valid_pos (parse_maybe_enum_key p (dsum_enum t)) h input pos in
valid_facts g h input pos_payload;
valid_facts (parse_dsum t p f g) h input pos;
parse_dsum_eq t p f g (bytes_of_slice_from h input pos)
#reset-options
inline_for_extraction
let finalize_dsum_case_known
(t: dsum)
(#kt: parser_kind)
(#p: parser kt (dsum_repr_type t))
(s: serializer p)
(w: leaf_writer_strong s)
(f: ((x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x))))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
(destr: enum_repr_of_key'_t (dsum_enum t))
(k: dsum_known_key t)
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: HST.Stack unit
(requires (fun h ->
let len_tag = serialized_length (serialize_enum_key _ s (dsum_enum t)) k in
U32.v pos + len_tag < 4294967296 /\ (
let pos_payload = pos `U32.add` U32.uint_to_t len_tag in
valid (dsnd (f k)) h input pos_payload /\
writable input.base (U32.v pos) (U32.v pos_payload) h
)))
(ensures (fun h _ h' ->
let len_tag = serialized_length (serialize_enum_key _ s (dsum_enum t)) k in
let pos_payload = pos `U32.add` U32.uint_to_t len_tag in
B.modifies (loc_slice_from_to input pos pos_payload) h h' /\
valid_content_pos (parse_dsum t p f g) h' input pos (synth_dsum_case t (Known k) (contents (dsnd (f k)) h input pos_payload)) (get_valid_pos (dsnd (f k)) h input pos_payload)
))
= let pos1 = write_enum_key w (dsum_enum t) destr k input pos in
let h = HST.get () in
[@inline_let]
let _ =
valid_facts (parse_enum_key p (dsum_enum t)) h input pos;
valid_facts (parse_maybe_enum_key p (dsum_enum t)) h input pos;
let sq = bytes_of_slice_from h input pos in
parse_enum_key_eq p (dsum_enum t) sq;
parse_maybe_enum_key_eq p (dsum_enum t) sq;
valid_dsum_intro_known h t p f g input pos
in
()
inline_for_extraction
let finalize_dsum_case_unknown
(t: dsum)
(#kt: parser_kind)
(#p: parser kt (dsum_repr_type t))
(s: serializer p)
(w: leaf_writer_strong s)
(f: ((x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x))))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
(r: unknown_enum_repr (dsum_enum t))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: HST.Stack unit
(requires (fun h ->
let len_tag = serialized_length s r in
U32.v pos + len_tag < 4294967296 /\ (
let pos_payload = pos `U32.add` U32.uint_to_t len_tag in
valid g h input pos_payload /\
writable input.base (U32.v pos) (U32.v pos_payload) h
)))
(ensures (fun h _ h' ->
let len_tag = serialized_length s r in
let pos_payload = pos `U32.add` U32.uint_to_t len_tag in
B.modifies (loc_slice_from_to input pos pos_payload) h h' /\
valid_content_pos (parse_dsum t p f g) h' input pos (synth_dsum_case t (Unknown r) (contents g h input pos_payload)) (get_valid_pos g h input pos_payload)
))
= let pos1 = w r input pos in
let h = HST.get () in
[@inline_let]
let _ =
valid_facts (parse_maybe_enum_key p (dsum_enum t)) h input pos;
valid_facts p h input pos;
let sq = bytes_of_slice_from h input pos in
parse_maybe_enum_key_eq p (dsum_enum t) sq;
valid_dsum_intro_unknown h t p f g input pos
in
()
let valid_dsum_elim_tag
(h: HS.mem)
(t: dsum)
(#kt: parser_kind)
(p: parser kt (dsum_repr_type t))
(f: ((x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x))))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: Lemma
(requires (
valid (parse_dsum t p f g) h input pos
))
(ensures (
valid (parse_maybe_enum_key p (dsum_enum t)) h input pos /\
contents (parse_maybe_enum_key p (dsum_enum t)) h input pos == dsum_tag_of_data t (contents (parse_dsum t p f g) h input pos)
))
= let _ = parse_dsum_eq_ t p f g (bytes_of_slice_from h input pos) in
let _ = valid_facts (parse_dsum t p f g) h input pos in
let _ = valid_facts (parse_maybe_enum_key p (dsum_enum t)) h input pos in
()
inline_for_extraction
let read_dsum_tag
(t: dsum)
(#kt: parser_kind)
(#p: parser kt (dsum_repr_type t))
(p32: leaf_reader p)
(destr: maybe_enum_destr_t (maybe_enum_key (dsum_enum t)) (dsum_enum t))
(f: ((x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x))))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: HST.Stack (dsum_key t)
(requires (fun h ->
valid (parse_dsum t p f g) h input pos
))
(ensures (fun h res h' ->
B.modifies B.loc_none h h' /\
res == dsum_tag_of_data t (contents (parse_dsum t p f g) h input pos)
))
= let h = HST.get () in
[@inline_let] let _ = valid_dsum_elim_tag h t p f g input pos in
read_maybe_enum_key p32 (dsum_enum t) destr input pos
#push-options "--z3rlimit 32"
let valid_dsum_elim_known
(h: HS.mem)
(t: dsum)
(#kt: parser_kind)
(p: parser kt (dsum_repr_type t))
(f: ((x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x))))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: Lemma
(requires (
valid (parse_dsum t p f g) h input pos /\
Known? (dsum_tag_of_data t (contents (parse_dsum t p f g) h input pos))
))
(ensures (
valid (parse_maybe_enum_key p (dsum_enum t)) h input pos /\ (
let k' = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
let pos_payload = get_valid_pos (parse_maybe_enum_key p (dsum_enum t)) h input pos in
Known? k' /\ (
let Known k = k' in
valid (dsnd (f k)) h input pos_payload /\
valid_content_pos
(parse_dsum t p f g) h input pos
(synth_dsum_case t (Known k) (contents (dsnd (f k)) h input pos_payload))
(get_valid_pos (dsnd (f k)) h input pos_payload)
))))
=
valid_facts (parse_dsum t p f g) h input pos;
parse_dsum_eq t p f g (bytes_of_slice_from h input pos);
valid_facts (parse_maybe_enum_key p (dsum_enum t)) h input pos;
let Known k = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
let pos_payload = get_valid_pos (parse_maybe_enum_key p (dsum_enum t)) h input pos in
valid_facts (dsnd (f k)) h input pos_payload
#pop-options
let valid_dsum_elim_unknown
(h: HS.mem)
(t: dsum)
(#kt: parser_kind)
(p: parser kt (dsum_repr_type t))
(f: ((x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x))))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: Lemma
(requires (
valid (parse_dsum t p f g) h input pos /\
Unknown? (dsum_tag_of_data t (contents (parse_dsum t p f g) h input pos))
))
(ensures (
valid (parse_maybe_enum_key p (dsum_enum t)) h input pos /\ (
let k' = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
let pos_payload = get_valid_pos (parse_maybe_enum_key p (dsum_enum t)) h input pos in
Unknown? k' /\ (
let Unknown r = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
valid g h input pos_payload /\
valid_content_pos
(parse_dsum t p f g) h input pos
(synth_dsum_case t (Unknown r) (contents g h input pos_payload))
(get_valid_pos g h input pos_payload)
))))
=
valid_facts (parse_dsum t p f g) h input pos;
parse_dsum_eq t p f g (bytes_of_slice_from h input pos);
valid_facts (parse_maybe_enum_key p (dsum_enum t)) h input pos;
let Unknown r = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
let pos_payload = get_valid_pos (parse_maybe_enum_key p (dsum_enum t)) h input pos in
valid_facts g h input pos_payload
inline_for_extraction
let jump_dsum_cases_t
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(#k: parser_kind)
(g: parser k (dsum_type_of_unknown_tag s))
(x: dsum_key s)
: Tot Type
= jumper (parse_dsum_cases' s f g x)
let jump_dsum_cases_eq
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(#k: parser_kind)
(g: parser k (dsum_type_of_unknown_tag s))
(x: dsum_key s)
(v1 v2 : jump_dsum_cases_t s f g x)
: GTot Type0
= True
inline_for_extraction
let jump_dsum_cases_if'
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(#k: parser_kind)
(g: parser k (dsum_type_of_unknown_tag s))
(x: dsum_key s)
(cond: bool)
(ift: (cond_true cond -> Tot (jump_dsum_cases_t s f g x)))
(iff: (cond_false cond -> Tot (jump_dsum_cases_t s f g x)))
: Tot (jump_dsum_cases_t s f g x)
= fun #rrel #rel input len ->
if cond
then (ift () <: jump_dsum_cases_t s f g x) input len
else (iff () <: jump_dsum_cases_t s f g x) input len
inline_for_extraction
let jump_dsum_cases_if
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(#k: parser_kind)
(g: parser k (dsum_type_of_unknown_tag s))
(x: dsum_key s)
: Tot (if_combinator _ (jump_dsum_cases_eq s f g x))
= jump_dsum_cases_if' s f g x
inline_for_extraction
let jump_dsum_cases'
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(f' : (x: dsum_known_key s) -> Tot (jumper (dsnd (f x))))
(#k: parser_kind)
(#g: parser k (dsum_type_of_unknown_tag s))
(g' : jumper g)
(x: dsum_key s)
: Tot (jump_dsum_cases_t s f g x)
= synth_dsum_case_injective s x;
match x with
| Known x' -> jump_synth (f' x') (synth_dsum_case s (Known x')) () <: jumper (parse_dsum_cases' s f g x)
| Unknown x' -> jump_synth g' (synth_dsum_case s (Unknown x')) () <: jumper (parse_dsum_cases' s f g x)
inline_for_extraction
let jump_dsum_cases'_destr
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(f' : (x: dsum_known_key s) -> Tot (jumper (dsnd (f x))))
(#k: parser_kind)
(#g: parser k (dsum_type_of_unknown_tag s))
(g' : jumper g)
(destr: dep_enum_destr _ (fun k -> jump_dsum_cases_t s f g (Known k)))
(x: dsum_key s)
: Tot (jump_dsum_cases_t s f g x)
= fun #rrel #rel input pos ->
match x with
| Known k ->
destr
_
(fun k -> jump_dsum_cases_if s f g (Known k))
(fun _ _ -> ())
(fun _ _ _ _ -> ())
(fun k -> jump_dsum_cases' s f f' g' (Known k))
k
input
pos
| Unknown r -> jump_dsum_cases' s f f' g' (Unknown r) input pos
inline_for_extraction
let jump_dsum_cases
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(f' : (x: dsum_known_key s) -> Tot (jumper (dsnd (f x))))
(#k: parser_kind)
(#g: parser k (dsum_type_of_unknown_tag s))
(g' : jumper g)
(destr: dep_enum_destr _ (fun k -> jump_dsum_cases_t s f g (Known k)))
(x: dsum_key s)
: Tot (jumper (parse_dsum_cases s f g x))
= fun #rrel #rel input pos ->
let h = HST.get () in
[@inline_let]
let _ =
valid_facts (parse_dsum_cases' s f g x) h input pos;
valid_facts (parse_dsum_cases s f g x) h input pos;
parse_dsum_cases_eq' s f g x (bytes_of_slice_from h input pos)
in
jump_dsum_cases'_destr s f f' g' destr x input pos
#push-options "--z3rlimit 16"
inline_for_extraction
let jump_dsum
(#kt: parser_kind)
(t: dsum)
(#p: parser kt (dsum_repr_type t))
(v: jumper p)
(p32: leaf_reader p)
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(f32: (x: dsum_known_key t) -> Tot (jumper (dsnd (f x))))
(#k': parser_kind)
(#g: parser k' (dsum_type_of_unknown_tag t))
(g32: jumper g)
(destr: dep_maybe_enum_destr_t (dsum_enum t) (jump_dsum_cases_t t f g))
: Tot (jumper (parse_dsum t p f g))
= fun #rrel #rel input pos ->
let h = HST.get () in
[@inline_let]
let _ = parse_dsum_eq' t p f g (bytes_of_slice_from h input pos) in
[@inline_let]
let _ = valid_facts (parse_dsum t p f g) h input pos in
[@inline_let]
let _ = valid_facts p h input pos in
let pos_after_tag = v input pos in
let tg = p32 input pos in
[@inline_let]
let _ = valid_facts (parse_dsum_cases' t f g (maybe_enum_key_of_repr (dsum_enum t) tg)) h input pos_after_tag in
destr (jump_dsum_cases_eq t f g) (jump_dsum_cases_if t f g) (fun _ _ -> ()) (fun _ _ _ _ -> ()) (jump_dsum_cases' t f f32 g32) tg input pos_after_tag
#pop-options
inline_for_extraction
let read_dsum_cases'
(t: dsum)
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(f32: (x: dsum_known_key t) -> Tot (leaf_reader (dsnd (f x))))
(#k': parser_kind)
(g: parser k' (dsum_type_of_unknown_tag t))
(g32: leaf_reader g)
(x: dsum_key t)
: Tot (leaf_reader (parse_dsum_cases' t f g x))
= fun #rrel #rel input pos ->
[@inline_let]
let _ = synth_dsum_case_injective t x in
match x with
| Known x' ->
read_synth'
(dsnd (f x'))
(synth_dsum_case t (Known x'))
(f32 x')
()
input
pos
| Unknown x' ->
read_synth'
g
(synth_dsum_case t (Unknown x'))
g32
()
input
pos
inline_for_extraction
let read_dsum_cases_t
(t: dsum)
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(#k': parser_kind)
(g: parser k' (dsum_type_of_unknown_tag t))
(k: dsum_known_key t)
: Tot Type
= leaf_reader (parse_dsum_cases' t f g (Known k))
let read_dsum_cases_t_eq
(t: dsum)
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(#k': parser_kind)
(g: parser k' (dsum_type_of_unknown_tag t))
(k: dsum_known_key t)
(x y : read_dsum_cases_t t f g k)
: GTot Type0
= True
inline_for_extraction
let read_dsum_cases_t_if
(t: dsum)
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(#k': parser_kind)
(g: parser k' (dsum_type_of_unknown_tag t))
(k: dsum_known_key t)
: Tot (if_combinator _ (read_dsum_cases_t_eq t f g k))
= fun cond (sv_true: cond_true cond -> Tot (read_dsum_cases_t t f g k)) (sv_false: cond_false cond -> Tot (read_dsum_cases_t t f g k)) #_ #_ input pos ->
if cond
then sv_true () input pos
else sv_false () input pos
inline_for_extraction
let read_dsum_cases
(t: dsum)
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(f32: (x: dsum_known_key t) -> Tot (leaf_reader (dsnd (f x))))
(#k': parser_kind)
(g: parser k' (dsum_type_of_unknown_tag t))
(g32: leaf_reader g)
(destr: dep_enum_destr _ (read_dsum_cases_t t f g))
(x: dsum_key t)
: Tot (leaf_reader (parse_dsum_cases' t f g x))
= fun #_ #_ input pos ->
match x with
| Known k ->
destr
_
(read_dsum_cases_t_if t f g)
(fun _ _ -> ())
(fun _ _ _ _ -> ())
(fun k -> read_dsum_cases' t f f32 g g32 (Known k))
k
input
pos
| Unknown r ->
read_dsum_cases' t f f32 g g32 (Unknown r) input pos
#push-options "--z3rlimit 16"
inline_for_extraction
let read_dsum
(#kt: parser_kind)
(t: dsum)
(#p: parser kt (dsum_repr_type t))
(p32: leaf_reader (parse_maybe_enum_key p (dsum_enum t)))
(j: jumper p)
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(f32: (x: dsum_known_key t) -> Tot (leaf_reader (dsnd (f x))))
(#k': parser_kind)
(#g: parser k' (dsum_type_of_unknown_tag t))
(g32: leaf_reader g)
(destr: dep_enum_destr _ (read_dsum_cases_t t f g))
: Tot (leaf_reader (parse_dsum t p f g))
= fun #_ #_ input pos ->
let h = HST.get () in
valid_facts (parse_dsum t p f g) h input pos;
parse_dsum_eq_ t p f g (bytes_of_slice_from h input pos);
valid_facts (parse_maybe_enum_key p (dsum_enum t)) h input pos;
let k = p32 input pos in
let pos' = jump_maybe_enum_key j (dsum_enum t) input pos in
valid_facts (parse_dsum_cases' t f g k) h input pos' ;
read_dsum_cases t f f32 g g32 destr k input pos'
#pop-options
inline_for_extraction
let serialize32_dsum_type_of_tag
(t: dsum)
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(sf: (x: dsum_known_key t) -> Tot (serializer (dsnd (f x))))
(sf32: (x: dsum_known_key t) -> Tot (serializer32 (sf x)))
(#k': parser_kind)
(#g: parser k' (dsum_type_of_unknown_tag t))
(#sg: serializer g)
(sg32: serializer32 sg)
(tg: dsum_key t)
: Tot (serializer32 (serialize_dsum_type_of_tag t f sf g sg tg))
= match tg with
| Known x' -> serialize32_ext (dsnd (f x')) (sf x') (sf32 x') (parse_dsum_type_of_tag t f g tg) ()
| Unknown x' -> serialize32_ext g sg sg32 (parse_dsum_type_of_tag t f g tg) ()
inline_for_extraction
let serialize32_dsum_cases_aux
(t: dsum)
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(sf: (x: dsum_known_key t) -> Tot (serializer (dsnd (f x))))
(sf32: (x: dsum_known_key t) -> Tot (serializer32 (sf x)))
(#k': parser_kind)
(#g: parser k' (dsum_type_of_unknown_tag t))
(#sg: serializer g)
(sg32: serializer32 sg)
(tg: dsum_key t)
: Tot (serializer32 (serialize_dsum_cases t f sf g sg tg))
= [@inline_let]
let _ = synth_dsum_case_injective t tg in
[@inline_let]
let _ = synth_dsum_case_inverse t tg in
serialize32_synth
(serialize32_dsum_type_of_tag t f sf sf32 sg32 tg)
(synth_dsum_case t tg)
(synth_dsum_case_recip t tg)
(fun x -> synth_dsum_case_recip t tg x)
()
inline_for_extraction
let serialize32_dsum_cases_t
(t: dsum)
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(sf: (x: dsum_known_key t) -> Tot (serializer (dsnd (f x))))
(#k': parser_kind)
(g: parser k' (dsum_type_of_unknown_tag t))
(sg: serializer g)
(k: dsum_known_key t)
: Tot Type
= serializer32 (serialize_dsum_cases t f sf g sg (Known k))
let serialize32_dsum_cases_t_eq
(t: dsum)
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(sf: (x: dsum_known_key t) -> Tot (serializer (dsnd (f x))))
(#k': parser_kind)
(g: parser k' (dsum_type_of_unknown_tag t))
(sg: serializer g)
(k: dsum_known_key t)
(x y: serialize32_dsum_cases_t t f sf g sg k)
: GTot Type0
= True
inline_for_extraction
let serialize32_dsum_cases_t_if
(t: dsum)
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(sf: (x: dsum_known_key t) -> Tot (serializer (dsnd (f x))))
(#k': parser_kind)
(g: parser k' (dsum_type_of_unknown_tag t))
(sg: serializer g)
(k: dsum_known_key t)
: Tot (if_combinator _ (serialize32_dsum_cases_t_eq t f sf g sg k))
= fun cond (sv_true: (cond_true cond -> Tot (serialize32_dsum_cases_t t f sf g sg k))) (sv_false: (cond_false cond -> Tot (serialize32_dsum_cases_t t f sf g sg k))) x #rrel #rel output pos ->
if cond
then (sv_true () x output pos)
else (sv_false () x output pos)
inline_for_extraction
let serialize32_dsum_cases
(t: dsum)
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(sf: (x: dsum_known_key t) -> Tot (serializer (dsnd (f x))))
(sf32: (x: dsum_known_key t) -> Tot (serializer32 (sf x)))
(#k': parser_kind)
(#g: parser k' (dsum_type_of_unknown_tag t))
(#sg: serializer g)
(sg32: serializer32 sg)
(destr: dep_enum_destr _ (serialize32_dsum_cases_t t f sf g sg))
(tg: dsum_key t)
: Tot (serializer32 (serialize_dsum_cases t f sf g sg tg))
= fun x #rrel #rel output pos ->
match tg with
| Known k ->
destr
_
(serialize32_dsum_cases_t_if t f sf g sg)
(fun _ _ -> ())
(fun _ _ _ _ -> ())
(fun k -> serialize32_dsum_cases_aux t f sf sf32 sg32 (Known k))
k
x
output
pos
| Unknown r ->
serialize32_dsum_cases_aux t f sf sf32 sg32 (Unknown r) x output pos
inline_for_extraction
let serialize32_dsum
(#kt: parser_kind)
(t: dsum)
(#p: parser kt (dsum_repr_type t))
(s: serializer p {kt.parser_kind_subkind == Some ParserStrong})
(s32: serializer32 (serialize_maybe_enum_key _ s (dsum_enum t)))
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(sf: (x: dsum_known_key t) -> Tot (serializer (dsnd (f x))))
(sf32: (x: dsum_known_key t) -> Tot (serializer32 (sf x)))
(#k': parser_kind)
(#g: parser k' (dsum_type_of_unknown_tag t))
(#sg: serializer g)
(sg32: serializer32 sg)
(destr: dep_enum_destr _ (serialize32_dsum_cases_t t f sf g sg))
: Tot (serializer32 (serialize_dsum t s f sf g sg))
= fun x #_ #_ output pos ->
[@inline_let]
let _ = serialize_dsum_eq' t s f sf g sg x in
let tg = dsum_tag_of_data t x in
serialize32_nondep_then_aux
s32
(serialize32_dsum_cases t f sf sf32 sg32 destr tg)
tg
x
output
pos
let clens_dsum_tag
(s: dsum)
: Tot (clens (dsum_type s) (dsum_key s))
= {
clens_cond = (fun _ -> True);
clens_get = dsum_tag_of_data s;
}
let gaccessor_dsum_tag
(#kt: parser_kind)
(t: dsum)
(p: parser kt (dsum_repr_type t))
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
: Tot (gaccessor (parse_dsum t p f g) (parse_maybe_enum_key p (dsum_enum t)) (clens_dsum_tag t))
= gaccessor_tagged_union_tag
(parse_maybe_enum_key p (dsum_enum t))
(dsum_tag_of_data t)
(parse_dsum_cases t f g)
inline_for_extraction
let accessor_dsum_tag
(#kt: parser_kind)
(t: dsum)
(p: parser kt (dsum_repr_type t))
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
: Tot (accessor (gaccessor_dsum_tag t p f g))
= accessor_tagged_union_tag
(parse_maybe_enum_key p (dsum_enum t))
(dsum_tag_of_data t)
(parse_dsum_cases t f g)
let clens_dsum_payload
(s: dsum)
(k: dsum_key s)
: Tot (clens (dsum_type s) (dsum_type_of_tag s k))
= {
clens_cond = (fun (x: dsum_type s) -> dsum_tag_of_data s x == k);
clens_get = (fun (x: dsum_type s) -> synth_dsum_case_recip s k x <: Ghost (dsum_type_of_tag s k) (requires (dsum_tag_of_data s x == k)) (ensures (fun _ -> True)));
}
let clens_dsum_unknown_payload
(s: dsum)
: Tot (clens (dsum_type s) (dsum_type_of_unknown_tag s))
= {
clens_cond = (fun (x: dsum_type s) -> Unknown? (dsum_tag_of_data s x));
clens_get = (fun (x: dsum_type s) -> synth_dsum_case_recip s (dsum_tag_of_data s x) x <: Ghost (dsum_type_of_unknown_tag s) (requires (Unknown? (dsum_tag_of_data s x))) (ensures (fun _ -> True)));
}
#push-options "--z3rlimit 16"
let gaccessor_clens_dsum_payload'
(#kt: parser_kind)
(t: dsum)
(p: parser kt (dsum_repr_type t))
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
(k: dsum_key t)
: Tot (gaccessor' (parse_dsum t p f g) (parse_dsum_type_of_tag' t f g k) (clens_dsum_payload t k))
= fun (input: bytes) ->
parse_dsum_eq3 t p f g input;
let res =
match parse p input with
| Some (_, consumed) ->
synth_dsum_case_inverse t k;
synth_dsum_case_injective t k;
synth_injective_synth_inverse_synth_inverse_recip (synth_dsum_case t k) (synth_dsum_case_recip t k) ();
(consumed)
| _ -> (0) // dummy
in
(res <: (res: _ { gaccessor_post' (parse_dsum t p f g) (parse_dsum_type_of_tag' t f g k) (clens_dsum_payload t k) input res } ))
let gaccessor_clens_dsum_payload_injective
(#kt: parser_kind)
(t: dsum)
(p: parser kt (dsum_repr_type t))
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
(k: dsum_key t)
(sl sl' : bytes)
: Lemma
(requires (
gaccessor_pre (parse_dsum t p f g) (parse_dsum_type_of_tag' t f g k) (clens_dsum_payload t k) sl /\
gaccessor_pre (parse_dsum t p f g) (parse_dsum_type_of_tag' t f g k) (clens_dsum_payload t k) sl' /\
injective_precond (parse_dsum t p f g) sl sl'
))
(ensures (
gaccessor_clens_dsum_payload' t p f g k sl == gaccessor_clens_dsum_payload' t p f g k sl'
))
=
parse_dsum_eq3 t p f g sl;
parse_dsum_eq3 t p f g sl';
parse_injective (parse_dsum t p f g) sl sl' ;
parse_injective p sl sl'
let gaccessor_clens_dsum_payload_no_lookahead
(#kt: parser_kind)
(t: dsum)
(p: parser kt (dsum_repr_type t))
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
(k: dsum_key t)
(sl sl' : bytes)
: Lemma
(requires (
(parse_dsum_kind kt t f ku).parser_kind_subkind == Some ParserStrong /\
gaccessor_pre (parse_dsum t p f g) (parse_dsum_type_of_tag' t f g k) (clens_dsum_payload t k) sl /\
gaccessor_pre (parse_dsum t p f g) (parse_dsum_type_of_tag' t f g k) (clens_dsum_payload t k) sl' /\
no_lookahead_on_precond (parse_dsum t p f g) sl sl'
))
(ensures (
gaccessor_clens_dsum_payload' t p f g k sl == gaccessor_clens_dsum_payload' t p f g k sl'
))
= parse_dsum_eq3 t p f g sl;
parse_dsum_eq3 t p f g sl';
parse_strong_prefix (parse_dsum t p f g) sl sl' ;
parse_injective p sl sl'
let gaccessor_clens_dsum_payload
(#kt: parser_kind)
(t: dsum)
(p: parser kt (dsum_repr_type t))
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
(k: dsum_key t)
: Tot (gaccessor (parse_dsum t p f g) (parse_dsum_type_of_tag' t f g k) (clens_dsum_payload t k))
= Classical.forall_intro_2 (fun x -> Classical.move_requires (gaccessor_clens_dsum_payload_injective t p f g k x));
Classical.forall_intro_2 (fun x -> Classical.move_requires (gaccessor_clens_dsum_payload_no_lookahead t p f g k x));
gaccessor_prop_equiv (parse_dsum t p f g) (parse_dsum_type_of_tag' t f g k) (clens_dsum_payload t k) (gaccessor_clens_dsum_payload' t p f g k);
gaccessor_clens_dsum_payload' t p f g k
inline_for_extraction
let accessor_clens_dsum_payload'
(#kt: parser_kind)
(t: dsum)
(#p: parser kt (dsum_repr_type t))
(j: jumper p)
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
(k: dsum_key t)
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: HST.Stack U32.t
(requires (fun h ->
valid (parse_dsum t p f g) h input pos /\
(clens_dsum_payload t k).clens_cond (contents (parse_dsum t p f g) h input pos)
))
(ensures (fun h pos' h' ->
B.modifies B.loc_none h h' /\
pos' == slice_access h (gaccessor_clens_dsum_payload t p f g k) input pos
))
=
let h = HST.get () in
[@inline_let]
let _ =
let pos' = get_valid_pos (parse_dsum t p f g) h input pos in
let large = bytes_of_slice_from h input pos in
slice_access_eq h (gaccessor_clens_dsum_payload t p f g k) input pos;
valid_facts (parse_dsum t p f g) h input pos;
parse_dsum_eq3 t p f g large;
valid_facts p h input pos
in
j input pos
#pop-options
inline_for_extraction
let accessor_clens_dsum_payload
(#kt: parser_kind)
(t: dsum)
(#p: parser kt (dsum_repr_type t))
(j: jumper p)
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
(k: dsum_key t)
: Tot (accessor (gaccessor_clens_dsum_payload t p f g k))
= fun #rrel #rel -> accessor_clens_dsum_payload' t j f g k #rrel #rel
#push-options "--z3rlimit 16"
let gaccessor_clens_dsum_unknown_payload'
(#kt: parser_kind)
(t: dsum)
(p: parser kt (dsum_repr_type t))
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
: Tot (gaccessor' (parse_dsum t p f g) g (clens_dsum_unknown_payload t))
= fun (input: bytes) ->
parse_dsum_eq3 t p f g input;
let res =
match parse p input with
| Some (tg, consumed) ->
let k = maybe_enum_key_of_repr (dsum_enum t) tg in
synth_dsum_case_inverse t k;
synth_dsum_case_injective t k;
synth_injective_synth_inverse_synth_inverse_recip (synth_dsum_case t k) (synth_dsum_case_recip t k) ();
(consumed)
| _ -> (0) // dummy
in
(res <: (res: _ { gaccessor_post' (parse_dsum t p f g) g (clens_dsum_unknown_payload t) input res } ))
let gaccessor_clens_dsum_unknown_payload_injective
(#kt: parser_kind)
(t: dsum)
(p: parser kt (dsum_repr_type t))
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
(sl sl' : bytes)
: Lemma
(requires (
gaccessor_pre (parse_dsum t p f g) g (clens_dsum_unknown_payload t) sl /\
gaccessor_pre (parse_dsum t p f g) g (clens_dsum_unknown_payload t) sl' /\
injective_precond (parse_dsum t p f g) sl sl'
))
(ensures (gaccessor_clens_dsum_unknown_payload' t p f g sl == gaccessor_clens_dsum_unknown_payload' t p f g sl'))
= parse_dsum_eq3 t p f g sl;
parse_dsum_eq3 t p f g sl';
parse_injective (parse_dsum t p f g) sl sl' ;
parse_injective p sl sl'
let gaccessor_clens_dsum_unknown_payload_no_lookahead
(#kt: parser_kind)
(t: dsum)
(p: parser kt (dsum_repr_type t))
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
(sl sl' : bytes)
: Lemma
(requires (
(parse_dsum_kind kt t f ku).parser_kind_subkind == Some ParserStrong /\
gaccessor_pre (parse_dsum t p f g) g (clens_dsum_unknown_payload t) sl /\
gaccessor_pre (parse_dsum t p f g) g (clens_dsum_unknown_payload t) sl' /\
no_lookahead_on_precond (parse_dsum t p f g) sl sl'
))
(ensures (gaccessor_clens_dsum_unknown_payload' t p f g sl == gaccessor_clens_dsum_unknown_payload' t p f g sl'))
=
parse_dsum_eq3 t p f g sl;
parse_dsum_eq3 t p f g sl';
parse_strong_prefix (parse_dsum t p f g) sl sl' ;
parse_injective p sl sl'
let gaccessor_clens_dsum_unknown_payload
(#kt: parser_kind)
(t: dsum)
(p: parser kt (dsum_repr_type t))
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
: Tot (gaccessor (parse_dsum t p f g) g (clens_dsum_unknown_payload t))
= Classical.forall_intro_2 (fun x -> Classical.move_requires (gaccessor_clens_dsum_unknown_payload_injective t p f g x));
Classical.forall_intro_2 (fun x -> Classical.move_requires (gaccessor_clens_dsum_unknown_payload_no_lookahead t p f g x));
gaccessor_prop_equiv (parse_dsum t p f g) g (clens_dsum_unknown_payload t) (gaccessor_clens_dsum_unknown_payload' t p f g);
gaccessor_clens_dsum_unknown_payload' t p f g
inline_for_extraction
let accessor_clens_dsum_unknown_payload'
(#kt: parser_kind)
(t: dsum)
(#p: parser kt (dsum_repr_type t))
(j: jumper p)
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: HST.Stack U32.t
(requires (fun h ->
valid (parse_dsum t p f g) h input pos /\
(clens_dsum_unknown_payload t).clens_cond (contents (parse_dsum t p f g) h input pos)
))
(ensures (fun h pos' h' ->
B.modifies B.loc_none h h' /\
pos' == slice_access h (gaccessor_clens_dsum_unknown_payload t p f g) input pos
))
=
let h = HST.get () in
[@inline_let]
let _ =
let pos' = get_valid_pos (parse_dsum t p f g) h input pos in
let large = bytes_of_slice_from h input pos in
slice_access_eq h (gaccessor_clens_dsum_unknown_payload t p f g) input pos;
valid_facts (parse_dsum t p f g) h input pos;
parse_dsum_eq3 t p f g large;
valid_facts p h input pos
in
j input pos
#pop-options
inline_for_extraction
let accessor_clens_dsum_unknown_payload
(#kt: parser_kind)
(t: dsum)
(#p: parser kt (dsum_repr_type t))
(j: jumper p { kt.parser_kind_subkind == Some ParserStrong })
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
: Tot (accessor (gaccessor_clens_dsum_unknown_payload t p f g))
= fun #rrel #rel -> accessor_clens_dsum_unknown_payload' t j f g #rrel #rel
let clens_dsum_cases_payload
(s: dsum)
(k: dsum_key s)
: Tot (clens (dsum_cases s k) (dsum_type_of_tag s k))
= {
clens_cond = (fun (x: dsum_cases s k) -> True);
clens_get = (fun (x: dsum_cases s k) -> synth_dsum_case_recip s k x <: Ghost (dsum_type_of_tag s k) (requires (True)) (ensures (fun _ -> True)));
}
let gaccessor_clens_dsum_cases_known_payload
(t: dsum)
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
(k: dsum_known_key t)
: Tot (gaccessor (parse_dsum_cases' t f g (Known k)) (dsnd (f k)) (clens_dsum_cases_payload t (Known k)))
= synth_dsum_case_injective t (Known k);
synth_dsum_case_inverse t (Known k);
synth_injective_synth_inverse_synth_inverse_recip (synth_dsum_case t (Known k)) (synth_dsum_case_recip t (Known k)) ();
gaccessor_ext
(gaccessor_synth (dsnd (f k)) (synth_dsum_case t (Known k)) (synth_dsum_case_recip t (Known k)) ())
(clens_dsum_cases_payload t (Known k))
()
inline_for_extraction
let accessor_clens_dsum_cases_known_payload
(t: dsum)
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
(k: dsum_known_key t)
: Tot (accessor (gaccessor_clens_dsum_cases_known_payload t f g k))
= [@inline_let]
let _ =
synth_dsum_case_injective t (Known k);
synth_dsum_case_inverse t (Known k);
synth_injective_synth_inverse_synth_inverse_recip (synth_dsum_case t (Known k)) (synth_dsum_case_recip t (Known k)) ()
in
accessor_ext
(accessor_synth (dsnd (f k)) (synth_dsum_case t (Known k)) (synth_dsum_case_recip t (Known k)) ())
(clens_dsum_cases_payload t (Known k))
()
let gaccessor_clens_dsum_cases_unknown_payload
(t: dsum)
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
(k: dsum_unknown_key t)
: Tot (gaccessor (parse_dsum_cases' t f g (Unknown k)) g (clens_dsum_cases_payload t (Unknown k)))
= synth_dsum_case_injective t (Unknown k);
synth_dsum_case_inverse t (Unknown k);
synth_injective_synth_inverse_synth_inverse_recip (synth_dsum_case t (Unknown k)) (synth_dsum_case_recip t (Unknown k)) ();
gaccessor_ext
(gaccessor_synth g (synth_dsum_case t (Unknown k)) (synth_dsum_case_recip t (Unknown k)) ())
(clens_dsum_cases_payload t (Unknown k))
() | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"LowStar.Buffer.fst.checked",
"LowParse.Spec.Sum.fst.checked",
"LowParse.Low.Enum.fst.checked",
"FStar.UInt64.fsti.checked",
"FStar.UInt32.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Int.Cast.fst.checked",
"FStar.HyperStack.ST.fsti.checked",
"FStar.HyperStack.fst.checked",
"FStar.Classical.fsti.checked"
],
"interface_file": false,
"source_file": "LowParse.Low.Sum.fst"
} | [
{
"abbrev": true,
"full_module": "FStar.HyperStack",
"short_module": "HS"
},
{
"abbrev": true,
"full_module": "FStar.UInt64",
"short_module": "U64"
},
{
"abbrev": true,
"full_module": "FStar.Int.Cast",
"short_module": "Cast"
},
{
"abbrev": true,
"full_module": "LowStar.Buffer",
"short_module": "B"
},
{
"abbrev": true,
"full_module": "FStar.HyperStack.ST",
"short_module": "HST"
},
{
"abbrev": true,
"full_module": "FStar.UInt32",
"short_module": "U32"
},
{
"abbrev": false,
"full_module": "LowParse.Spec.Sum",
"short_module": null
},
{
"abbrev": false,
"full_module": "LowParse.Low.Enum",
"short_module": null
},
{
"abbrev": false,
"full_module": "LowParse.Low",
"short_module": null
},
{
"abbrev": false,
"full_module": "LowParse.Low",
"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",
"short_module": null
}
] | {
"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_elim_box": false,
"smtencoding_l_arith_repr": "boxwrap",
"smtencoding_nl_arith_repr": "boxwrap",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": true,
"z3cliopt": [],
"z3refresh": false,
"z3rlimit": 5,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | false |
t: LowParse.Spec.Sum.dsum ->
f:
(x: LowParse.Spec.Sum.dsum_known_key t
-> Prims.dtuple2 LowParse.Spec.Base.parser_kind
(fun k -> LowParse.Spec.Base.parser k (LowParse.Spec.Sum.dsum_type_of_known_tag t x))) ->
g: LowParse.Spec.Base.parser ku (LowParse.Spec.Sum.dsum_type_of_unknown_tag t) ->
k: LowParse.Spec.Sum.dsum_unknown_key t
-> LowParse.Low.Base.accessor (LowParse.Low.Sum.gaccessor_clens_dsum_cases_unknown_payload t f g k
) | Prims.Tot | [
"total"
] | [] | [
"LowParse.Spec.Sum.dsum",
"LowParse.Spec.Sum.dsum_known_key",
"Prims.dtuple2",
"LowParse.Spec.Base.parser_kind",
"LowParse.Spec.Base.parser",
"LowParse.Spec.Sum.dsum_type_of_known_tag",
"LowParse.Spec.Sum.dsum_type_of_unknown_tag",
"LowParse.Spec.Sum.dsum_unknown_key",
"LowParse.Low.Base.accessor_ext",
"LowParse.Spec.Sum.dsum_cases",
"LowParse.Spec.Enum.Unknown",
"LowParse.Spec.Sum.dsum_key_type",
"LowParse.Spec.Sum.dsum_repr_type",
"LowParse.Spec.Sum.dsum_enum",
"LowParse.Spec.Combinators.parse_synth",
"LowParse.Spec.Sum.synth_dsum_case",
"LowParse.Low.Combinators.clens_synth",
"LowParse.Spec.Sum.synth_dsum_case_recip",
"LowParse.Low.Combinators.gaccessor_synth",
"LowParse.Low.Combinators.accessor_synth",
"LowParse.Low.Sum.clens_dsum_cases_payload",
"Prims.squash",
"LowParse.Spec.Combinators.synth_inverse",
"LowParse.Spec.Base.refine_with_tag",
"LowParse.Spec.Sum.dsum_key",
"LowParse.Spec.Sum.dsum_type",
"LowParse.Spec.Sum.dsum_tag_of_data",
"LowParse.Spec.Sum.dsum_type_of_tag",
"LowParse.Spec.Combinators.synth_injective_synth_inverse_synth_inverse_recip",
"Prims.unit",
"LowParse.Spec.Sum.synth_dsum_case_inverse",
"LowParse.Spec.Sum.synth_dsum_case_injective",
"LowParse.Low.Base.accessor",
"LowParse.Spec.Sum.parse_dsum_cases_kind",
"LowParse.Spec.Sum.parse_dsum_cases'",
"LowParse.Low.Sum.gaccessor_clens_dsum_cases_unknown_payload"
] | [] | false | false | false | false | false | let accessor_clens_dsum_cases_unknown_payload
(t: dsum)
(f: (x: dsum_known_key t -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x))))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
(k: dsum_unknown_key t)
: Tot (accessor (gaccessor_clens_dsum_cases_unknown_payload t f g k)) =
| [@@ inline_let ]let _ =
synth_dsum_case_injective t (Unknown k);
synth_dsum_case_inverse t (Unknown k);
synth_injective_synth_inverse_synth_inverse_recip (synth_dsum_case t (Unknown k))
(synth_dsum_case_recip t (Unknown k))
()
in
accessor_ext (accessor_synth g
(synth_dsum_case t (Unknown k))
(synth_dsum_case_recip t (Unknown k))
())
(clens_dsum_cases_payload t (Unknown k))
() | false |
LowStar.Lens.Buffer.fst | LowStar.Lens.Buffer.mk | val mk (#a:_) (#p:_) (#q:_) (b:B.mbuffer a p q) (f:flavor b) (snap:HS.mem{B.live snap b})
: Tot (l:buffer_lens b f{(lens_of l).snapshot == snap}) | val mk (#a:_) (#p:_) (#q:_) (b:B.mbuffer a p q) (f:flavor b) (snap:HS.mem{B.live snap b})
: Tot (l:buffer_lens b f{(lens_of l).snapshot == snap}) | let mk #a #p #q (b:B.mbuffer a p q) (f:flavor b) (snap:HS.mem{B.live snap b})
: Tot (l:buffer_lens b f{(lens_of l).snapshot == snap})
= let blens : buffer_hs_lens b f =
FStar.Classical.forall_intro_2 (B.g_upd_seq_as_seq b);
let invariant (x:B.mbuffer a p q) (h:HS.mem) =
B.live h x
in
let fp = Ghost.hide (B.loc_buffer b) in
let get : get_t (imem (invariant b)) (view_type_of f) =
fun h ->
match f with
| Buffer -> B.as_seq h b
| Pointer -> B.get h b 0
in
let put : put_t (imem (invariant b)) (view_type_of f) =
fun v h ->
match f with
| Buffer -> B.g_upd_seq b v h
| Pointer -> B.g_upd b 0 v h
in
let l : imem_lens (invariant b) (view_type_of f) fp = {
get = get;
put = put;
lens_laws = ()
}
in
{
footprint = fp;
invariant = invariant;
x = b;
snapshot = snap;
l = l
}
in
let reader : with_state blens (reader_t f id_lens) =
fun s i ->
reveal_inv();
B.index b i
in
let writer : with_state blens (writer_t f id_lens) =
fun s i v ->
reveal_inv();
B.upd b i v
in
Mk blens reader writer | {
"file_name": "examples/data_structures/LowStar.Lens.Buffer.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 26,
"end_line": 68,
"start_col": 0,
"start_line": 24
} | (*
Copyright 2008-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 in writing, software
distributed under the License is distributed on an "AS IS" BASIS,
WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
See the License for the specific language governing permissions and
limitations under the License.
*)
module LowStar.Lens.Buffer
open LowStar.Lens
open FStar.HyperStack.ST
module B = LowStar.Buffer
module HS = FStar.HyperStack
module HST = FStar.HyperStack.ST
open FStar.Integers | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"LowStar.Lens.fsti.checked",
"LowStar.Buffer.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Integers.fst.checked",
"FStar.HyperStack.ST.fsti.checked",
"FStar.HyperStack.fst.checked",
"FStar.Ghost.fsti.checked",
"FStar.Classical.fsti.checked"
],
"interface_file": true,
"source_file": "LowStar.Lens.Buffer.fst"
} | [
{
"abbrev": true,
"full_module": "LowStar.Lens",
"short_module": "LL"
},
{
"abbrev": false,
"full_module": "FStar.Integers",
"short_module": null
},
{
"abbrev": true,
"full_module": "FStar.HyperStack.ST",
"short_module": "HST"
},
{
"abbrev": true,
"full_module": "FStar.HyperStack",
"short_module": "HS"
},
{
"abbrev": true,
"full_module": "LowStar.Buffer",
"short_module": "B"
},
{
"abbrev": false,
"full_module": "FStar.HyperStack.ST",
"short_module": null
},
{
"abbrev": false,
"full_module": "LowStar.Lens",
"short_module": null
},
{
"abbrev": false,
"full_module": "LowStar.Lens",
"short_module": null
},
{
"abbrev": false,
"full_module": "LowStar.Lens",
"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",
"short_module": null
}
] | {
"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_elim_box": false,
"smtencoding_l_arith_repr": "boxwrap",
"smtencoding_nl_arith_repr": "boxwrap",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": true,
"z3cliopt": [],
"z3refresh": false,
"z3rlimit": 5,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | false |
b: LowStar.Monotonic.Buffer.mbuffer a p q ->
f: LowStar.Lens.Buffer.flavor b ->
snap: FStar.Monotonic.HyperStack.mem{LowStar.Monotonic.Buffer.live snap b}
-> l:
LowStar.Lens.Buffer.buffer_lens b f
{Mkhs_lens?.snapshot (LowStar.Lens.Buffer.lens_of l) == snap} | Prims.Tot | [
"total"
] | [] | [
"LowStar.Monotonic.Buffer.srel",
"LowStar.Monotonic.Buffer.mbuffer",
"LowStar.Lens.Buffer.flavor",
"FStar.Monotonic.HyperStack.mem",
"LowStar.Monotonic.Buffer.live",
"LowStar.Lens.Buffer.Mk",
"LowStar.Lens.Buffer.with_state",
"LowStar.Lens.Buffer.view_type_of",
"LowStar.Lens.Buffer.writer_t",
"LowStar.Lens.Mklens",
"LowStar.Lens.imem",
"LowStar.Lens.__proj__Mkhs_lens__item__invariant",
"LowStar.Lens.__proj__Mkhs_lens__item__x",
"LowStar.Lens.Buffer.ix",
"LowStar.Monotonic.Buffer.upd",
"Prims.unit",
"LowStar.Lens.reveal_inv",
"LowStar.Lens.Buffer.reader_t",
"LowStar.Monotonic.Buffer.index",
"LowStar.Lens.Buffer.buffer_hs_lens",
"LowStar.Lens.Mkhs_lens",
"LowStar.Lens.imem_lens",
"LowStar.Lens.put_t",
"LowStar.Monotonic.Buffer.g_upd_seq",
"LowStar.Monotonic.Buffer.g_upd",
"LowStar.Lens.get_t",
"LowStar.Monotonic.Buffer.as_seq",
"LowStar.Monotonic.Buffer.get",
"FStar.Ghost.erased",
"LowStar.Monotonic.Buffer.loc",
"FStar.Ghost.hide",
"LowStar.Monotonic.Buffer.loc_buffer",
"FStar.Classical.forall_intro_2",
"FStar.Seq.Properties.lseq",
"LowStar.Monotonic.Buffer.length",
"Prims.l_and",
"Prims.l_imp",
"Prims.b2t",
"Prims.op_GreaterThan",
"FStar.Seq.Base.length",
"Prims.op_Negation",
"LowStar.Monotonic.Buffer.g_is_null",
"LowStar.Monotonic.Buffer.modifies",
"FStar.HyperStack.ST.equal_domains",
"Prims.eq2",
"FStar.Seq.Base.seq",
"LowStar.Monotonic.Buffer.g_upd_seq_as_seq",
"LowStar.Lens.Buffer.buffer_lens",
"Prims.l_or",
"LowStar.Lens.Buffer.lens_of",
"LowStar.Lens.__proj__Mkhs_lens__item__snapshot"
] | [] | false | false | false | false | false | let mk #a #p #q (b: B.mbuffer a p q) (f: flavor b) (snap: HS.mem{B.live snap b})
: Tot (l: buffer_lens b f {(lens_of l).snapshot == snap}) =
| let blens:buffer_hs_lens b f =
FStar.Classical.forall_intro_2 (B.g_upd_seq_as_seq b);
let invariant (x: B.mbuffer a p q) (h: HS.mem) = B.live h x in
let fp = Ghost.hide (B.loc_buffer b) in
let get:get_t (imem (invariant b)) (view_type_of f) =
fun h ->
match f with
| Buffer -> B.as_seq h b
| Pointer -> B.get h b 0
in
let put:put_t (imem (invariant b)) (view_type_of f) =
fun v h ->
match f with
| Buffer -> B.g_upd_seq b v h
| Pointer -> B.g_upd b 0 v h
in
let l:imem_lens (invariant b) (view_type_of f) fp = { get = get; put = put; lens_laws = () } in
{ footprint = fp; invariant = invariant; x = b; snapshot = snap; l = l }
in
let reader:with_state blens (reader_t f id_lens) =
fun s i ->
reveal_inv ();
B.index b i
in
let writer:with_state blens (writer_t f id_lens) =
fun s i v ->
reveal_inv ();
B.upd b i v
in
Mk blens reader writer | false |
LowParse.Low.Sum.fst | LowParse.Low.Sum.gaccessor_clens_dsum_cases_unknown_payload | val gaccessor_clens_dsum_cases_unknown_payload
(t: dsum)
(f: (x: dsum_known_key t -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x))))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
(k: dsum_unknown_key t)
: Tot
(gaccessor (parse_dsum_cases' t f g (Unknown k)) g (clens_dsum_cases_payload t (Unknown k))) | val gaccessor_clens_dsum_cases_unknown_payload
(t: dsum)
(f: (x: dsum_known_key t -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x))))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
(k: dsum_unknown_key t)
: Tot
(gaccessor (parse_dsum_cases' t f g (Unknown k)) g (clens_dsum_cases_payload t (Unknown k))) | let gaccessor_clens_dsum_cases_unknown_payload
(t: dsum)
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
(k: dsum_unknown_key t)
: Tot (gaccessor (parse_dsum_cases' t f g (Unknown k)) g (clens_dsum_cases_payload t (Unknown k)))
= synth_dsum_case_injective t (Unknown k);
synth_dsum_case_inverse t (Unknown k);
synth_injective_synth_inverse_synth_inverse_recip (synth_dsum_case t (Unknown k)) (synth_dsum_case_recip t (Unknown k)) ();
gaccessor_ext
(gaccessor_synth g (synth_dsum_case t (Unknown k)) (synth_dsum_case_recip t (Unknown k)) ())
(clens_dsum_cases_payload t (Unknown k))
() | {
"file_name": "src/lowparse/LowParse.Low.Sum.fst",
"git_rev": "00217c4a89f5ba56002ba9aa5b4a9d5903bfe9fa",
"git_url": "https://github.com/project-everest/everparse.git",
"project_name": "everparse"
} | {
"end_col": 6,
"end_line": 2136,
"start_col": 0,
"start_line": 2123
} | module LowParse.Low.Sum
include LowParse.Low.Enum
include LowParse.Spec.Sum
module U32 = FStar.UInt32
module HST = FStar.HyperStack.ST
module B = LowStar.Buffer
module Cast = FStar.Int.Cast
module U64 = FStar.UInt64
inline_for_extraction
let validate_sum_cases_aux
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(vc: ((x: sum_key t) -> Tot (validator (dsnd (pc x)))))
(k: sum_key t)
: Tot (validator (parse_sum_cases t pc k))
= [@inline_let]
let _ = synth_sum_case_injective t k in
validate_synth
(validate_weaken
(weaken_parse_cases_kind t pc)
(vc k)
()
)
(synth_sum_case t k)
()
inline_for_extraction
let validate_sum_cases_t
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot Type
= validator (parse_sum_cases t pc k)
let validate_sum_cases_t_eq
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
(x y : validate_sum_cases_t t pc k)
: GTot Type0
= True
inline_for_extraction
let validate_sum_cases_t_if
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (if_combinator _ (validate_sum_cases_t_eq t pc k))
= fun cond (sv_true: cond_true cond -> Tot (validate_sum_cases_t t pc k)) (sv_false: cond_false cond -> Tot (validate_sum_cases_t t pc k)) #rrel #rel input pos ->
if cond
then sv_true () input pos
else sv_false () input pos
inline_for_extraction
let validate_sum_cases
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(vc: ((x: sum_key t) -> Tot (validator (dsnd (pc x)))))
(destr: dep_enum_destr (sum_enum t) (validate_sum_cases_t t pc))
(k: sum_key t)
: Tot (validator (parse_sum_cases t pc k))
= destr
_
(validate_sum_cases_t_if t pc)
(fun _ _ -> ())
(fun _ _ _ _ -> ())
(validate_sum_cases_aux t pc vc)
k
inline_for_extraction
let validate_sum_aux_payload_t
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
: Tot Type
= (#rrel: _) -> (#rel: _) ->
(input: slice rrel rel) ->
(pos: U64.t) ->
HST.Stack U64.t
(requires (fun h -> live_slice h input /\ U64.v pos <= U32.v input.len))
(ensures (fun h res h' ->
B.modifies B.loc_none h h' /\ (
match k with
| Unknown _ -> is_error res
| Known k' ->
if is_success res
then
valid_pos (dsnd (pc k')) h input (uint64_to_uint32 pos) (uint64_to_uint32 res)
else
(~ (valid (dsnd (pc k')) h input (uint64_to_uint32 pos)))
)))
let validate_sum_aux_payload_eq
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
: Tot (validate_sum_aux_payload_t t pc k -> validate_sum_aux_payload_t t pc k -> GTot Type0)
= fun _ _ -> True
inline_for_extraction
let validate_sum_aux_payload_if'
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
(cond: bool)
(ift: ((cond_true cond) -> Tot (validate_sum_aux_payload_t t pc k)))
(iff: ((cond_false cond) -> Tot (validate_sum_aux_payload_t t pc k)))
: Tot (validate_sum_aux_payload_t t pc k)
= fun #rrel #rel input pos ->
if cond
then begin
(ift () <: validate_sum_aux_payload_t t pc k) input pos
end else
(iff () <: validate_sum_aux_payload_t t pc k) input pos
inline_for_extraction
let validate_sum_aux_payload_if
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
: Tot (if_combinator _ (validate_sum_aux_payload_eq t pc k))
= validate_sum_aux_payload_if' t pc k
#push-options "--z3rlimit 64 --z3cliopt smt.arith.nl=false --using_facts_from '* -FStar.Int.Cast -LowParse.BitFields'"
// --query_stats --smtencoding.elim_box true --smtencoding.l_arith_repr native --z3refresh"
inline_for_extraction
let validate_sum_aux
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(v: validator p)
(p32: leaf_reader p)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(v_payload: ((k: sum_repr_type t)) -> Tot (validate_sum_aux_payload_t t pc (maybe_enum_key_of_repr (sum_enum t) k)))
: Tot (validator (parse_sum t p pc))
= fun #rrel #rel input pos ->
let h = HST.get () in
[@inline_let]
let _ = parse_sum_eq'' t p pc (bytes_of_slice_from h input (uint64_to_uint32 pos)) in
[@inline_let]
let _ = valid_facts (parse_sum t p pc) h input (uint64_to_uint32 pos) in
[@inline_let]
let _ = valid_facts p h input (uint64_to_uint32 pos) in
let len_after_tag = v input pos in
if is_error len_after_tag
then len_after_tag
else begin
let h1 = HST.get () in
let k' = p32 input (uint64_to_uint32 pos) in
[@inline_let]
let _ =
match maybe_enum_key_of_repr (sum_enum t) k' with
| Known k -> valid_facts (dsnd (pc k)) h input (uint64_to_uint32 len_after_tag)
| _ -> ()
in
v_payload k' input len_after_tag
end
#pop-options
inline_for_extraction
let validate_sum_aux_payload'
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (validator (dsnd (pc x)))))
(k: maybe_enum_key (sum_enum t))
: Tot (validate_sum_aux_payload_t t pc k)
= fun #rrel #rel input pos ->
match k with
| Known k ->
[@inline_let]
let _ = synth_sum_case_injective t k in
pc32 k input pos
// validate_synth (pc32 k) (synth_sum_case t k) () input pos
| _ -> validator_error_generic
inline_for_extraction
let validate_sum_aux_payload
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (validator (dsnd (pc x)))))
(destr: dep_maybe_enum_destr_t (sum_enum t) (validate_sum_aux_payload_t t pc))
(k: sum_repr_type t)
: Tot (validate_sum_aux_payload_t t pc (maybe_enum_key_of_repr (sum_enum t) k))
= destr (validate_sum_aux_payload_eq t pc) (validate_sum_aux_payload_if t pc) (fun _ _ -> ()) (fun _ _ _ _ -> ()) (validate_sum_aux_payload' t pc pc32) k
inline_for_extraction
let validate_sum
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(v: validator p)
(p32: leaf_reader p)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (validator (dsnd (pc x)))))
(destr: dep_maybe_enum_destr_t (sum_enum t) (validate_sum_aux_payload_t t pc))
: Tot (validator (parse_sum t p pc))
= validate_sum_aux t v p32 pc (validate_sum_aux_payload t pc pc32 destr)
module HS = FStar.HyperStack
#push-options "--z3rlimit 256 --z3cliopt smt.arith.nl=false --initial_ifuel 8 --max_ifuel 8 --initial_fuel 2 --max_fuel 2"
#restart-solver
let valid_sum_intro
(h: HS.mem)
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: Lemma
(requires (
valid (parse_enum_key p (sum_enum t)) h input pos /\ (
let k = contents (parse_enum_key p (sum_enum t)) h input pos in
valid (dsnd (pc k)) h input (get_valid_pos (parse_enum_key p (sum_enum t)) h input pos)
)))
(ensures (
let k = contents (parse_enum_key p (sum_enum t)) h input pos in
let pos_payload = get_valid_pos (parse_enum_key p (sum_enum t)) h input pos in
valid_content_pos
(parse_sum t p pc) h input pos
(synth_sum_case t k (contents (dsnd (pc k)) h input pos_payload))
(get_valid_pos (dsnd (pc k)) h input pos_payload)
))
= valid_facts (parse_enum_key p (sum_enum t)) h input pos;
let k = contents (parse_enum_key p (sum_enum t)) h input pos in
let pos_payload = get_valid_pos (parse_enum_key p (sum_enum t)) h input pos in
valid_facts (dsnd (pc k)) h input pos_payload;
valid_facts (parse_sum t p pc) h input pos;
parse_sum_eq t p pc (bytes_of_slice_from h input pos)
#pop-options
inline_for_extraction
let finalize_sum_case
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(s: serializer p)
(w: leaf_writer_strong s)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(destr: enum_repr_of_key'_t (sum_enum t))
(k: sum_key t)
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: HST.Stack unit
(requires (fun h ->
let len_tag = serialized_length (serialize_enum_key _ s (sum_enum t)) k in
U32.v pos + len_tag < 4294967296 /\ (
let pos_payload = pos `U32.add` U32.uint_to_t len_tag in
valid (dsnd (pc k)) h input pos_payload /\
writable input.base (U32.v pos) (U32.v pos_payload) h
)))
(ensures (fun h _ h' ->
let len_tag = serialized_length (serialize_enum_key _ s (sum_enum t)) k in
let pos_payload = pos `U32.add` U32.uint_to_t len_tag in
B.modifies (loc_slice_from_to input pos pos_payload) h h' /\
valid_content_pos (parse_sum t p pc) h' input pos (synth_sum_case t k (contents (dsnd (pc k)) h input pos_payload)) (get_valid_pos (dsnd (pc k)) h input pos_payload)
))
= let pos1 = write_enum_key w (sum_enum t) destr k input pos in
let h = HST.get () in
[@inline_let]
let _ = valid_sum_intro h t p pc input pos in
()
inline_for_extraction
let jump_sum_cases_aux
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(vc: ((x: sum_key t) -> Tot (jumper (dsnd (pc x)))))
(k: sum_key t)
: Tot (jumper (parse_sum_cases t pc k))
= [@inline_let]
let _ = synth_sum_case_injective t k in
jump_synth
(jump_weaken
(weaken_parse_cases_kind t pc)
(vc k)
()
)
(synth_sum_case t k)
()
inline_for_extraction
let jump_sum_cases_t
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot Type
= jumper (parse_sum_cases t pc k)
let jump_sum_cases_t_eq
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
(x y : jump_sum_cases_t t pc k)
: GTot Type0
= True
inline_for_extraction
let jump_sum_cases_t_if
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (if_combinator _ (jump_sum_cases_t_eq t pc k))
= fun cond (sv_true: cond_true cond -> Tot (jump_sum_cases_t t pc k)) (sv_false: cond_false cond -> Tot (jump_sum_cases_t t pc k)) #rrel #rel input pos ->
if cond
then sv_true () input pos
else sv_false () input pos
inline_for_extraction
let jump_sum_cases
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(vc: ((x: sum_key t) -> Tot (jumper (dsnd (pc x)))))
(destr: dep_enum_destr (sum_enum t) (jump_sum_cases_t t pc))
(k: sum_key t)
: Tot (jumper (parse_sum_cases t pc k))
= destr
_
(jump_sum_cases_t_if t pc)
(fun _ _ -> ())
(fun _ _ _ _ -> ())
(jump_sum_cases_aux t pc vc)
k
inline_for_extraction
let jump_sum_aux_payload_t
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
: Tot Type
= (#rrel: _) -> (#rel: _) ->
(input: slice rrel rel) ->
(pos: U32.t) ->
HST.Stack U32.t
(requires (fun h -> live_slice h input /\ U32.v pos <= U32.v input.len /\ (
match k with
| Unknown _ -> False
| Known k' -> valid (dsnd (pc k')) h input pos
)))
(ensures (fun h res h' ->
B.modifies B.loc_none h h' /\ (
match k with
| Unknown _ -> False
| Known k' ->
valid_pos (dsnd (pc k')) h input pos res
)))
let jump_sum_aux_payload_eq
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
: Tot (jump_sum_aux_payload_t t pc k -> jump_sum_aux_payload_t t pc k -> GTot Type0)
= fun _ _ -> True
inline_for_extraction
let jump_sum_aux_payload_if'
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
(cond: bool)
(ift: ((cond_true cond) -> Tot (jump_sum_aux_payload_t t pc k)))
(iff: ((cond_false cond) -> Tot (jump_sum_aux_payload_t t pc k)))
: Tot (jump_sum_aux_payload_t t pc k)
= fun #rrel #rel input pos ->
if cond
then begin
(ift () <: jump_sum_aux_payload_t t pc k) input pos
end else
(iff () <: jump_sum_aux_payload_t t pc k) input pos
inline_for_extraction
let jump_sum_aux_payload_if
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: maybe_enum_key (sum_enum t))
: Tot (if_combinator _ (jump_sum_aux_payload_eq t pc k))
= jump_sum_aux_payload_if' t pc k
let parse_sum_eq3
(#kt: parser_kind)
(t: sum)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(input: bytes)
(k' : sum_repr_type t)
(consumed_k: consumed_length input)
: Lemma
(requires (Some? (parse (parse_sum t p pc) input) /\ parse p input == Some (k', consumed_k)))
(ensures (
let input_k = Seq.slice input consumed_k (Seq.length input) in
let k = maybe_enum_key_of_repr (sum_enum t) k' in
begin match k with
| Known k ->
Some? (parse (dsnd (pc k)) input_k)
| _ -> False
end
))
= parse_sum_eq'' t p pc input
let parse_sum_eq4
(#kt: parser_kind)
(t: sum)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(input: bytes)
(k' : sum_repr_type t)
(consumed_k: consumed_length input)
(consumed_payload: nat)
: Lemma
(requires (Some? (parse (parse_sum t p pc) input) /\ parse p input == Some (k', consumed_k) /\ (
let input_k = Seq.slice input consumed_k (Seq.length input) in
let k = maybe_enum_key_of_repr (sum_enum t) k' in
begin match k with
| Known k ->
Some? (parse (dsnd (pc k)) input_k) /\ (
let Some (_, consumed_payload') = parse (dsnd (pc k)) input_k in
consumed_payload' == consumed_payload
)
| _ -> False
end
)))
(ensures (
let Some (_, consumed) = parse (parse_sum t p pc) input in
consumed == consumed_k + consumed_payload
))
= parse_sum_eq'' t p pc input
#push-options "--z3rlimit 16"
let valid_sum_elim
(h: HS.mem)
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(#rrel: _) (#rel: _)
(input: slice rrel rel)
(pos: U32.t)
: Lemma
(requires (
valid (parse_sum t p pc) h input pos
))
(ensures (
valid p h input pos /\ (
let pos_payload = get_valid_pos p h input pos in
let k' = maybe_enum_key_of_repr (sum_enum t) (contents p h input pos) in
match k' with
| Known k ->
k == sum_tag_of_data t (contents (parse_sum t p pc) h input pos) /\
valid (dsnd (pc k)) h input pos_payload /\
valid_pos
(parse_sum t p pc) h input pos
(get_valid_pos (dsnd (pc k)) h input pos_payload)
| _ -> False
)))
= let sinput = bytes_of_slice_from h input pos in
let _ = parse_sum_eq'' t p pc sinput in
[@inline_let]
let _ = valid_facts (parse_sum t p pc) h input pos in
let Some (k', consumed_k) = parse p sinput in
let pos_after_tag = U32.uint_to_t (U32.v pos + consumed_k) in
[@inline_let]
let _ = valid_facts p h input pos in
assert (valid_content_pos p h input pos k' pos_after_tag);
match maybe_enum_key_of_repr (sum_enum t) k' with
| Known k -> valid_facts (dsnd (pc k)) h input pos_after_tag
| _ -> ()
#pop-options
let valid_sum_elim_tag
(h: HS.mem)
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: Lemma
(requires (
valid (parse_sum t p pc) h input pos
))
(ensures (
valid (parse_enum_key p (sum_enum t)) h input pos /\
contents (parse_enum_key p (sum_enum t)) h input pos == sum_tag_of_data t (contents (parse_sum t p pc) h input pos)
))
= let _ = parse_sum_eq' t p pc (bytes_of_slice_from h input pos) in
let _ = valid_facts (parse_sum t p pc) h input pos in
let _ = valid_facts (parse_enum_key p (sum_enum t)) h input pos in
()
inline_for_extraction
let read_sum_tag
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(p32: leaf_reader p)
(destr: dep_maybe_enum_destr_t (sum_enum t) (read_enum_key_t (sum_enum t)))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: HST.Stack (sum_key t)
(requires (fun h ->
valid (parse_sum t p pc) h input pos
))
(ensures (fun h res h' ->
B.modifies B.loc_none h h' /\
res == sum_tag_of_data t (contents (parse_sum t p pc) h input pos)
))
= let h = HST.get () in
[@inline_let] let _ = valid_sum_elim_tag h t p pc input pos in
read_enum_key p32 (sum_enum t) destr input pos
inline_for_extraction
let jump_sum_aux
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(v: jumper p)
(p32: leaf_reader p)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(v_payload: ((k: sum_repr_type t)) -> Tot (jump_sum_aux_payload_t t pc (maybe_enum_key_of_repr (sum_enum t) k)))
: Tot (jumper (parse_sum t p pc))
= fun #rrel #rel input pos ->
let h = HST.get () in
[@inline_let]
let _ = valid_sum_elim h t p pc input pos in
let pos_after_tag = v input pos in
let k' = p32 input pos in
v_payload k' input pos_after_tag
inline_for_extraction
let jump_sum_aux_payload'
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (jumper (dsnd (pc x)))))
(k: maybe_enum_key (sum_enum t))
: Tot (jump_sum_aux_payload_t t pc k)
= fun #rrel #rel input pos ->
match k with
| Known k ->
[@inline_let]
let _ = synth_sum_case_injective t k in
pc32 k input pos
| _ -> 0ul // dummy, but we MUST NOT remove this branch, otherwise extraction fails
inline_for_extraction
let jump_sum_aux_payload
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (jumper (dsnd (pc x)))))
(destr: dep_maybe_enum_destr_t (sum_enum t) (jump_sum_aux_payload_t t pc))
(k: sum_repr_type t)
: Tot (jump_sum_aux_payload_t t pc (maybe_enum_key_of_repr (sum_enum t) k))
= destr (jump_sum_aux_payload_eq t pc) (jump_sum_aux_payload_if t pc) (fun _ _ -> ()) (fun _ _ _ _ -> ()) (jump_sum_aux_payload' t pc pc32) k
inline_for_extraction
let jump_sum
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(v: jumper p)
(p32: leaf_reader p)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (jumper (dsnd (pc x)))))
(destr: dep_maybe_enum_destr_t (sum_enum t) (jump_sum_aux_payload_t t pc))
: Tot (jumper (parse_sum t p pc))
= jump_sum_aux t v p32 pc (jump_sum_aux_payload t pc pc32 destr)
inline_for_extraction
let read_sum_cases'
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (leaf_reader (dsnd (pc x)))))
(k: sum_key t)
: Tot (leaf_reader (parse_sum_cases' t pc k))
= [@inline_let]
let _ = synth_sum_case_injective t k in
read_synth'
(dsnd (pc k))
(synth_sum_case t k)
(pc32 k)
()
inline_for_extraction
let read_sum_cases_t
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot Type
= leaf_reader (parse_sum_cases' t pc k)
let read_sum_cases_t_eq
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
(x y : read_sum_cases_t t pc k)
: GTot Type0
= True
inline_for_extraction
let read_sum_cases_t_if
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (if_combinator _ (read_sum_cases_t_eq t pc k))
= fun cond (sv_true: cond_true cond -> Tot (read_sum_cases_t t pc k)) (sv_false: cond_false cond -> Tot (read_sum_cases_t t pc k)) #_ #_ input pos ->
if cond
then (sv_true () input pos)
else (sv_false () input pos)
inline_for_extraction
let read_sum_cases
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (leaf_reader (dsnd (pc x)))))
(destr: dep_enum_destr (sum_enum t) (read_sum_cases_t t pc))
(k: sum_key t)
: Tot (leaf_reader (parse_sum_cases' t pc k))
= destr
_
(read_sum_cases_t_if t pc)
(fun _ _ -> ())
(fun _ _ _ _ -> ())
(read_sum_cases' t pc pc32)
k
#push-options "--z3rlimit 32"
inline_for_extraction
let read_sum
(#kt: parser_kind)
(t: sum)
(p: parser kt (sum_repr_type t))
(p32: leaf_reader (parse_enum_key p (sum_enum t)))
(j: jumper p)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(pc32: ((x: sum_key t) -> Tot (leaf_reader (dsnd (pc x)))))
(destr: dep_enum_destr (sum_enum t) (read_sum_cases_t t pc))
: Tot (leaf_reader (parse_sum t p pc))
=
fun #_ #_ input pos ->
let h = HST.get () in
valid_facts (parse_sum t p pc) h input pos;
parse_sum_eq' t p pc (bytes_of_slice_from h input pos);
valid_facts (parse_enum_key p (sum_enum t)) h input pos;
let k = p32 input pos in
let pos' = jump_enum_key j (sum_enum t) input pos in
valid_facts (parse_sum_cases' t pc k) h input pos' ;
read_sum_cases t pc pc32 destr k input pos'
#pop-options
inline_for_extraction
let serialize32_sum_cases_t
(t: sum)
(#pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(sc: ((x: sum_key t) -> Tot (serializer (dsnd (pc x)))))
(k: sum_key t)
: Tot Type
= serializer32 (serialize_sum_cases t pc sc k)
let serialize32_sum_cases_t_eq
(t: sum)
(#pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(sc: ((x: sum_key t) -> Tot (serializer (dsnd (pc x)))))
(k: sum_key t)
(x y: serialize32_sum_cases_t t sc k)
: GTot Type0
= True
inline_for_extraction
let serialize32_sum_cases_t_if
(t: sum)
(#pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(sc: ((x: sum_key t) -> Tot (serializer (dsnd (pc x)))))
(k: sum_key t)
: Tot (if_combinator _ (serialize32_sum_cases_t_eq t sc k))
= fun cond (sv_true: (cond_true cond -> Tot (serialize32_sum_cases_t t sc k))) (sv_false: (cond_false cond -> Tot (serialize32_sum_cases_t t sc k))) x #rrel #rel b pos ->
if cond
then (sv_true () x b pos)
else (sv_false () x b pos)
inline_for_extraction
let serialize32_sum_cases_aux
(t: sum)
(#pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(sc: ((x: sum_key t) -> Tot (serializer (dsnd (pc x)))))
(sc32: ((x: sum_key t) -> Tot (serializer32 (sc x))))
(k: sum_key t)
: Tot (serializer32 (serialize_sum_cases t pc sc k))
= fun x #rrel #rel b pos ->
[@inline_let] let _ =
Classical.forall_intro (parse_sum_cases_eq' t pc k);
synth_sum_case_injective t k;
synth_sum_case_inverse t k
in
serialize32_synth
(sc32 k)
(synth_sum_case t k)
(synth_sum_case_recip t k)
(fun x -> synth_sum_case_recip t k x)
()
x
b
pos
inline_for_extraction
let serialize32_sum_cases
(t: sum)
(#pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(sc: ((x: sum_key t) -> Tot (serializer (dsnd (pc x)))))
(sc32: ((x: sum_key t) -> Tot (serializer32 (sc x))))
(destr: dep_enum_destr (sum_enum t) (serialize32_sum_cases_t t sc))
(k: sum_key t)
: Tot (serializer32 (serialize_sum_cases t pc sc k))
= destr
_
(serialize32_sum_cases_t_if t sc)
(fun _ _ -> ())
(fun _ _ _ _ -> ())
(serialize32_sum_cases_aux t sc sc32)
k
inline_for_extraction
let serialize32_sum
(#kt: parser_kind)
(t: sum)
(#p: parser kt (sum_repr_type t))
(s: serializer p {kt.parser_kind_subkind == Some ParserStrong})
(s32: serializer32 (serialize_enum_key _ s (sum_enum t)))
(#pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(sc: ((x: sum_key t) -> Tot (serializer (dsnd (pc x)))))
(sc32: ((x: sum_key t) -> Tot (serializer32 (sc x))))
(destr: dep_enum_destr (sum_enum t) (serialize32_sum_cases_t t sc))
: Tot (serializer32 (serialize_sum t s sc))
= fun x #rrel #rel b pos ->
serialize_sum_eq t s sc x;
let tg = sum_tag_of_data t x in
serialize32_nondep_then_aux s32 (serialize32_sum_cases t sc sc32 destr tg) tg x b pos
let clens_sum_tag
(s: sum)
: Tot (clens (sum_type s) (sum_key s))
= {
clens_cond = (fun _ -> True);
clens_get = sum_tag_of_data s;
}
let gaccessor_sum_tag
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
: Tot (gaccessor (parse_sum t p pc) (parse_enum_key p (sum_enum t)) (clens_sum_tag t))
= gaccessor_tagged_union_tag
(parse_enum_key p (sum_enum t))
(sum_tag_of_data t)
(parse_sum_cases t pc)
inline_for_extraction
let accessor_sum_tag
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
: Tot (accessor (gaccessor_sum_tag t p pc))
= accessor_tagged_union_tag
(parse_enum_key p (sum_enum t))
(sum_tag_of_data t)
(parse_sum_cases t pc)
let clens_sum_payload
(s: sum)
(k: sum_key s)
: Tot (clens (sum_type s) (sum_type_of_tag s k))
= {
clens_cond = (fun (x: sum_type s) -> sum_tag_of_data s x == k);
clens_get = (fun (x: sum_type s) -> synth_sum_case_recip s k x <: Ghost (sum_type_of_tag s k) (requires (sum_tag_of_data s x == k)) (ensures (fun _ -> True)));
}
#push-options "--z3rlimit 32"
let gaccessor_clens_sum_payload'
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (gaccessor' (parse_sum t p pc) (dsnd (pc k)) (clens_sum_payload t k))
= fun (input: bytes) ->
parse_sum_eq'' t p pc input;
let res =
match parse p input with
| Some (_, consumed) ->
synth_sum_case_inverse t k;
synth_sum_case_injective t k;
synth_injective_synth_inverse_synth_inverse_recip (synth_sum_case t k) (synth_sum_case_recip t k) ();
(consumed)
| _ -> 0 // dummy
in
(res <: (res: _ { gaccessor_post' (parse_sum t p pc) (dsnd (pc k)) (clens_sum_payload t k) input res } ))
#push-options "--z3rlimit 64"
let gaccessor_clens_sum_payload_injective
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
(sl sl' : bytes)
: Lemma
(requires (
gaccessor_pre (parse_sum t p pc) (dsnd (pc k)) (clens_sum_payload t k) sl /\
gaccessor_pre (parse_sum t p pc) (dsnd (pc k)) (clens_sum_payload t k) sl' /\
injective_precond (parse_sum t p pc) sl sl'
))
(ensures (gaccessor_clens_sum_payload' t p pc k sl == gaccessor_clens_sum_payload' t p pc k sl'))
= parse_sum_eq'' t p pc sl;
parse_sum_eq'' t p pc sl' ;
parse_injective (parse_sum t p pc) sl sl' ;
parse_injective p sl sl'
#pop-options
let gaccessor_clens_sum_payload_no_lookahead
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
(sl sl' : bytes)
: Lemma
(requires (
(parse_sum_kind kt t pc).parser_kind_subkind == Some ParserStrong /\
gaccessor_pre (parse_sum t p pc) (dsnd (pc k)) (clens_sum_payload t k) sl /\
gaccessor_pre (parse_sum t p pc) (dsnd (pc k)) (clens_sum_payload t k) sl' /\
no_lookahead_on_precond (parse_sum t p pc) sl sl'
))
(ensures (gaccessor_clens_sum_payload' t p pc k sl == gaccessor_clens_sum_payload' t p pc k sl'))
= parse_sum_eq'' t p pc sl;
parse_sum_eq'' t p pc sl' ;
parse_strong_prefix (parse_sum t p pc) sl sl' ;
parse_injective p sl sl'
let gaccessor_clens_sum_payload
(t: sum)
(#kt: parser_kind)
(p: parser kt (sum_repr_type t))
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (gaccessor (parse_sum t p pc) (dsnd (pc k)) (clens_sum_payload t k))
= Classical.forall_intro_2 (fun x -> Classical.move_requires (gaccessor_clens_sum_payload_injective t p pc k x));
Classical.forall_intro_2 (fun x -> Classical.move_requires (gaccessor_clens_sum_payload_no_lookahead t p pc k x));
gaccessor_prop_equiv (parse_sum t p pc) (dsnd (pc k)) (clens_sum_payload t k) (gaccessor_clens_sum_payload' t p pc k);
gaccessor_clens_sum_payload' t p pc k
inline_for_extraction
let accessor_clens_sum_payload'
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(j: jumper p)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: HST.Stack U32.t
(requires (fun h ->
valid (parse_sum t p pc) h input pos /\
(clens_sum_payload t k).clens_cond (contents (parse_sum t p pc) h input pos)
))
(ensures (fun h pos' h' ->
B.modifies B.loc_none h h' /\
pos' == slice_access h (gaccessor_clens_sum_payload t p pc k) input pos
))
=
let h = HST.get () in
[@inline_let]
let _ =
let pos' = get_valid_pos (parse_sum t p pc) h input pos in
let large = bytes_of_slice_from h input pos in
slice_access_eq h (gaccessor_clens_sum_payload t p pc k) input pos;
valid_facts (parse_sum t p pc) h input pos;
parse_sum_eq'' t p pc large;
valid_facts p h input pos
in
j input pos
#pop-options
inline_for_extraction
let accessor_clens_sum_payload
(t: sum)
(#kt: parser_kind)
(#p: parser kt (sum_repr_type t))
(j: jumper p)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (accessor (gaccessor_clens_sum_payload t p pc k))
= fun #rrel #rel -> accessor_clens_sum_payload' t j pc k #rrel #rel
let clens_sum_cases_payload
(s: sum)
(k: sum_key s)
: Tot (clens (sum_cases s k) (sum_type_of_tag s k))
= {
clens_cond = (fun (x: sum_cases s k) -> True);
clens_get = (fun (x: sum_cases s k) -> synth_sum_case_recip s k x <: Ghost (sum_type_of_tag s k) (requires (True)) (ensures (fun _ -> True)));
}
let gaccessor_clens_sum_cases_payload
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (gaccessor (parse_sum_cases' t pc k) (dsnd (pc k)) (clens_sum_cases_payload t k))
= synth_sum_case_injective t k;
synth_sum_case_inverse t k;
synth_injective_synth_inverse_synth_inverse_recip (synth_sum_case t k) (synth_sum_case_recip t k) ();
gaccessor_ext
(gaccessor_synth (dsnd (pc k)) (synth_sum_case t k) (synth_sum_case_recip t k) ())
(clens_sum_cases_payload t k)
()
inline_for_extraction
let accessor_clens_sum_cases_payload
(t: sum)
(pc: ((x: sum_key t) -> Tot (k: parser_kind & parser k (sum_type_of_tag t x))))
(k: sum_key t)
: Tot (accessor (gaccessor_clens_sum_cases_payload t pc k))
= [@inline_let]
let _ =
synth_sum_case_injective t k;
synth_sum_case_inverse t k;
synth_injective_synth_inverse_synth_inverse_recip (synth_sum_case t k) (synth_sum_case_recip t k) ()
in
accessor_ext
(accessor_synth (dsnd (pc k)) (synth_sum_case t k) (synth_sum_case_recip t k) ())
(clens_sum_cases_payload t k)
()
inline_for_extraction
let validate_dsum_cases_t
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(#k: parser_kind)
(g: parser k (dsum_type_of_unknown_tag s))
(x: dsum_key s)
: Tot Type
= validator (parse_dsum_cases' s f g x)
let validate_dsum_cases_eq
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(#k: parser_kind)
(g: parser k (dsum_type_of_unknown_tag s))
(x: dsum_key s)
(v1 v2 : validate_dsum_cases_t s f g x)
: GTot Type0
= True
inline_for_extraction
let validate_dsum_cases_if'
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(#k: parser_kind)
(g: parser k (dsum_type_of_unknown_tag s))
(x: dsum_key s)
(cond: bool)
(ift: (cond_true cond -> Tot (validate_dsum_cases_t s f g x)))
(iff: (cond_false cond -> Tot (validate_dsum_cases_t s f g x)))
: Tot (validate_dsum_cases_t s f g x)
= fun #rrel #rel input len ->
if cond
then (ift () <: validate_dsum_cases_t s f g x) input len
else (iff () <: validate_dsum_cases_t s f g x) input len
inline_for_extraction
let validate_dsum_cases_if
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(#k: parser_kind)
(g: parser k (dsum_type_of_unknown_tag s))
(x: dsum_key s)
: Tot (if_combinator _ (validate_dsum_cases_eq s f g x))
= validate_dsum_cases_if' s f g x
inline_for_extraction
let validate_dsum_cases'
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(f' : (x: dsum_known_key s) -> Tot (validator (dsnd (f x))))
(#k: parser_kind)
(#g: parser k (dsum_type_of_unknown_tag s))
(g' : validator g)
(x: dsum_key s)
: Tot (validate_dsum_cases_t s f g x)
= [@inline_let]
let _ = synth_dsum_case_injective s x in
match x with
| Known x' -> validate_synth (f' x') (synth_dsum_case s (Known x')) () <: validator (parse_dsum_cases' s f g x)
| Unknown x' -> validate_synth g' (synth_dsum_case s (Unknown x')) () <: validator (parse_dsum_cases' s f g x)
inline_for_extraction
let validate_dsum_cases'_destr
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(f' : (x: dsum_known_key s) -> Tot (validator (dsnd (f x))))
(#k: parser_kind)
(#g: parser k (dsum_type_of_unknown_tag s))
(g' : validator g)
(destr: dep_enum_destr _ (fun k -> validate_dsum_cases_t s f g (Known k)))
(x: dsum_key s)
: Tot (validate_dsum_cases_t s f g x)
= fun #rrel #rel input pos ->
match x with
| Known k ->
destr
_
(fun k -> validate_dsum_cases_if s f g (Known k))
(fun _ _ -> ())
(fun _ _ _ _ -> ())
(fun k -> validate_dsum_cases' s f f' g' (Known k))
k
input
pos
| Unknown r -> validate_dsum_cases' s f f' g' (Unknown r) input pos
inline_for_extraction
let validate_dsum_cases
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(f' : (x: dsum_known_key s) -> Tot (validator (dsnd (f x))))
(#k: parser_kind)
(#g: parser k (dsum_type_of_unknown_tag s))
(g' : validator g)
(destr: dep_enum_destr _ (fun k -> validate_dsum_cases_t s f g (Known k)))
(x: dsum_key s)
: Tot (validator (parse_dsum_cases s f g x))
= fun #rrel #rel input pos ->
let h = HST.get () in
[@inline_let]
let _ =
valid_facts (parse_dsum_cases' s f g x) h input (uint64_to_uint32 pos);
valid_facts (parse_dsum_cases s f g x) h input (uint64_to_uint32 pos);
parse_dsum_cases_eq' s f g x (bytes_of_slice_from h input (uint64_to_uint32 pos))
in
validate_dsum_cases'_destr s f f' g' destr x input pos
#push-options "--z3rlimit 40"
inline_for_extraction
let validate_dsum
(#kt: parser_kind)
(t: dsum)
(#p: parser kt (dsum_repr_type t))
(v: validator p)
(p32: leaf_reader p)
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(f32: (x: dsum_known_key t) -> Tot (validator (dsnd (f x))))
(#k': parser_kind)
(#g: parser k' (dsum_type_of_unknown_tag t))
(g32: validator g)
(destr: dep_maybe_enum_destr_t (dsum_enum t) (validate_dsum_cases_t t f g))
: Tot (validator (parse_dsum t p f g))
= fun #rrel #rel input pos ->
let h = HST.get () in
[@inline_let]
let _ = parse_dsum_eq' t p f g (bytes_of_slice_from h input (uint64_to_uint32 pos)) in
[@inline_let]
let _ = valid_facts (parse_dsum t p f g) h input (uint64_to_uint32 pos) in
[@inline_let]
let _ = valid_facts p h input (uint64_to_uint32 pos) in
let pos_after_tag = v input pos in
if is_error pos_after_tag
then pos_after_tag
else
let tg = p32 input (uint64_to_uint32 pos) in
[@inline_let]
let _ = valid_facts (parse_dsum_cases' t f g (maybe_enum_key_of_repr (dsum_enum t) tg)) h input (uint64_to_uint32 pos_after_tag) in
destr (validate_dsum_cases_eq t f g) (validate_dsum_cases_if t f g) (fun _ _ -> ()) (fun _ _ _ _ -> ()) (validate_dsum_cases' t f f32 g32) tg input pos_after_tag
#pop-options
#reset-options "--z3rlimit 64 --z3cliopt smt.arith.nl=false --initial_ifuel 8 --max_ifuel 8 --initial_fuel 2 --max_fuel 2"
let valid_dsum_intro_known
(h: HS.mem)
(t: dsum)
(#kt: parser_kind)
(p: parser kt (dsum_repr_type t))
(f: ((x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x))))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: Lemma
(requires (
valid (parse_maybe_enum_key p (dsum_enum t)) h input pos /\ (
let k' = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
Known? k' /\ (
let Known k = k' in
valid (dsnd (f k)) h input (get_valid_pos (parse_maybe_enum_key p (dsum_enum t)) h input pos)
))))
(ensures (
let Known k = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
let pos_payload = get_valid_pos (parse_maybe_enum_key p (dsum_enum t)) h input pos in
valid_content_pos
(parse_dsum t p f g) h input pos
(synth_dsum_case t (Known k) (contents (dsnd (f k)) h input pos_payload))
(get_valid_pos (dsnd (f k)) h input pos_payload)
))
= valid_facts (parse_maybe_enum_key p (dsum_enum t)) h input pos;
let Known k = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
let pos_payload = get_valid_pos (parse_maybe_enum_key p (dsum_enum t)) h input pos in
valid_facts (dsnd (f k)) h input pos_payload;
valid_facts (parse_dsum t p f g) h input pos;
parse_dsum_eq t p f g (bytes_of_slice_from h input pos)
let valid_dsum_intro_unknown
(h: HS.mem)
(t: dsum)
(#kt: parser_kind)
(p: parser kt (dsum_repr_type t))
(f: ((x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x))))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: Lemma
(requires (
valid (parse_maybe_enum_key p (dsum_enum t)) h input pos /\ (
let k' = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
Unknown? k' /\
valid g h input (get_valid_pos (parse_maybe_enum_key p (dsum_enum t)) h input pos)
)))
(ensures (
let Unknown r = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
let pos_payload = get_valid_pos (parse_maybe_enum_key p (dsum_enum t)) h input pos in
valid_content_pos
(parse_dsum t p f g) h input pos
(synth_dsum_case t (Unknown r) (contents g h input pos_payload))
(get_valid_pos g h input pos_payload)
))
= valid_facts (parse_maybe_enum_key p (dsum_enum t)) h input pos;
let Unknown r = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
let pos_payload = get_valid_pos (parse_maybe_enum_key p (dsum_enum t)) h input pos in
valid_facts g h input pos_payload;
valid_facts (parse_dsum t p f g) h input pos;
parse_dsum_eq t p f g (bytes_of_slice_from h input pos)
#reset-options
inline_for_extraction
let finalize_dsum_case_known
(t: dsum)
(#kt: parser_kind)
(#p: parser kt (dsum_repr_type t))
(s: serializer p)
(w: leaf_writer_strong s)
(f: ((x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x))))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
(destr: enum_repr_of_key'_t (dsum_enum t))
(k: dsum_known_key t)
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: HST.Stack unit
(requires (fun h ->
let len_tag = serialized_length (serialize_enum_key _ s (dsum_enum t)) k in
U32.v pos + len_tag < 4294967296 /\ (
let pos_payload = pos `U32.add` U32.uint_to_t len_tag in
valid (dsnd (f k)) h input pos_payload /\
writable input.base (U32.v pos) (U32.v pos_payload) h
)))
(ensures (fun h _ h' ->
let len_tag = serialized_length (serialize_enum_key _ s (dsum_enum t)) k in
let pos_payload = pos `U32.add` U32.uint_to_t len_tag in
B.modifies (loc_slice_from_to input pos pos_payload) h h' /\
valid_content_pos (parse_dsum t p f g) h' input pos (synth_dsum_case t (Known k) (contents (dsnd (f k)) h input pos_payload)) (get_valid_pos (dsnd (f k)) h input pos_payload)
))
= let pos1 = write_enum_key w (dsum_enum t) destr k input pos in
let h = HST.get () in
[@inline_let]
let _ =
valid_facts (parse_enum_key p (dsum_enum t)) h input pos;
valid_facts (parse_maybe_enum_key p (dsum_enum t)) h input pos;
let sq = bytes_of_slice_from h input pos in
parse_enum_key_eq p (dsum_enum t) sq;
parse_maybe_enum_key_eq p (dsum_enum t) sq;
valid_dsum_intro_known h t p f g input pos
in
()
inline_for_extraction
let finalize_dsum_case_unknown
(t: dsum)
(#kt: parser_kind)
(#p: parser kt (dsum_repr_type t))
(s: serializer p)
(w: leaf_writer_strong s)
(f: ((x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x))))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
(r: unknown_enum_repr (dsum_enum t))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: HST.Stack unit
(requires (fun h ->
let len_tag = serialized_length s r in
U32.v pos + len_tag < 4294967296 /\ (
let pos_payload = pos `U32.add` U32.uint_to_t len_tag in
valid g h input pos_payload /\
writable input.base (U32.v pos) (U32.v pos_payload) h
)))
(ensures (fun h _ h' ->
let len_tag = serialized_length s r in
let pos_payload = pos `U32.add` U32.uint_to_t len_tag in
B.modifies (loc_slice_from_to input pos pos_payload) h h' /\
valid_content_pos (parse_dsum t p f g) h' input pos (synth_dsum_case t (Unknown r) (contents g h input pos_payload)) (get_valid_pos g h input pos_payload)
))
= let pos1 = w r input pos in
let h = HST.get () in
[@inline_let]
let _ =
valid_facts (parse_maybe_enum_key p (dsum_enum t)) h input pos;
valid_facts p h input pos;
let sq = bytes_of_slice_from h input pos in
parse_maybe_enum_key_eq p (dsum_enum t) sq;
valid_dsum_intro_unknown h t p f g input pos
in
()
let valid_dsum_elim_tag
(h: HS.mem)
(t: dsum)
(#kt: parser_kind)
(p: parser kt (dsum_repr_type t))
(f: ((x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x))))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: Lemma
(requires (
valid (parse_dsum t p f g) h input pos
))
(ensures (
valid (parse_maybe_enum_key p (dsum_enum t)) h input pos /\
contents (parse_maybe_enum_key p (dsum_enum t)) h input pos == dsum_tag_of_data t (contents (parse_dsum t p f g) h input pos)
))
= let _ = parse_dsum_eq_ t p f g (bytes_of_slice_from h input pos) in
let _ = valid_facts (parse_dsum t p f g) h input pos in
let _ = valid_facts (parse_maybe_enum_key p (dsum_enum t)) h input pos in
()
inline_for_extraction
let read_dsum_tag
(t: dsum)
(#kt: parser_kind)
(#p: parser kt (dsum_repr_type t))
(p32: leaf_reader p)
(destr: maybe_enum_destr_t (maybe_enum_key (dsum_enum t)) (dsum_enum t))
(f: ((x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x))))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: HST.Stack (dsum_key t)
(requires (fun h ->
valid (parse_dsum t p f g) h input pos
))
(ensures (fun h res h' ->
B.modifies B.loc_none h h' /\
res == dsum_tag_of_data t (contents (parse_dsum t p f g) h input pos)
))
= let h = HST.get () in
[@inline_let] let _ = valid_dsum_elim_tag h t p f g input pos in
read_maybe_enum_key p32 (dsum_enum t) destr input pos
#push-options "--z3rlimit 32"
let valid_dsum_elim_known
(h: HS.mem)
(t: dsum)
(#kt: parser_kind)
(p: parser kt (dsum_repr_type t))
(f: ((x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x))))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: Lemma
(requires (
valid (parse_dsum t p f g) h input pos /\
Known? (dsum_tag_of_data t (contents (parse_dsum t p f g) h input pos))
))
(ensures (
valid (parse_maybe_enum_key p (dsum_enum t)) h input pos /\ (
let k' = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
let pos_payload = get_valid_pos (parse_maybe_enum_key p (dsum_enum t)) h input pos in
Known? k' /\ (
let Known k = k' in
valid (dsnd (f k)) h input pos_payload /\
valid_content_pos
(parse_dsum t p f g) h input pos
(synth_dsum_case t (Known k) (contents (dsnd (f k)) h input pos_payload))
(get_valid_pos (dsnd (f k)) h input pos_payload)
))))
=
valid_facts (parse_dsum t p f g) h input pos;
parse_dsum_eq t p f g (bytes_of_slice_from h input pos);
valid_facts (parse_maybe_enum_key p (dsum_enum t)) h input pos;
let Known k = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
let pos_payload = get_valid_pos (parse_maybe_enum_key p (dsum_enum t)) h input pos in
valid_facts (dsnd (f k)) h input pos_payload
#pop-options
let valid_dsum_elim_unknown
(h: HS.mem)
(t: dsum)
(#kt: parser_kind)
(p: parser kt (dsum_repr_type t))
(f: ((x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x))))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: Lemma
(requires (
valid (parse_dsum t p f g) h input pos /\
Unknown? (dsum_tag_of_data t (contents (parse_dsum t p f g) h input pos))
))
(ensures (
valid (parse_maybe_enum_key p (dsum_enum t)) h input pos /\ (
let k' = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
let pos_payload = get_valid_pos (parse_maybe_enum_key p (dsum_enum t)) h input pos in
Unknown? k' /\ (
let Unknown r = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
valid g h input pos_payload /\
valid_content_pos
(parse_dsum t p f g) h input pos
(synth_dsum_case t (Unknown r) (contents g h input pos_payload))
(get_valid_pos g h input pos_payload)
))))
=
valid_facts (parse_dsum t p f g) h input pos;
parse_dsum_eq t p f g (bytes_of_slice_from h input pos);
valid_facts (parse_maybe_enum_key p (dsum_enum t)) h input pos;
let Unknown r = contents (parse_maybe_enum_key p (dsum_enum t)) h input pos in
let pos_payload = get_valid_pos (parse_maybe_enum_key p (dsum_enum t)) h input pos in
valid_facts g h input pos_payload
inline_for_extraction
let jump_dsum_cases_t
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(#k: parser_kind)
(g: parser k (dsum_type_of_unknown_tag s))
(x: dsum_key s)
: Tot Type
= jumper (parse_dsum_cases' s f g x)
let jump_dsum_cases_eq
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(#k: parser_kind)
(g: parser k (dsum_type_of_unknown_tag s))
(x: dsum_key s)
(v1 v2 : jump_dsum_cases_t s f g x)
: GTot Type0
= True
inline_for_extraction
let jump_dsum_cases_if'
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(#k: parser_kind)
(g: parser k (dsum_type_of_unknown_tag s))
(x: dsum_key s)
(cond: bool)
(ift: (cond_true cond -> Tot (jump_dsum_cases_t s f g x)))
(iff: (cond_false cond -> Tot (jump_dsum_cases_t s f g x)))
: Tot (jump_dsum_cases_t s f g x)
= fun #rrel #rel input len ->
if cond
then (ift () <: jump_dsum_cases_t s f g x) input len
else (iff () <: jump_dsum_cases_t s f g x) input len
inline_for_extraction
let jump_dsum_cases_if
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(#k: parser_kind)
(g: parser k (dsum_type_of_unknown_tag s))
(x: dsum_key s)
: Tot (if_combinator _ (jump_dsum_cases_eq s f g x))
= jump_dsum_cases_if' s f g x
inline_for_extraction
let jump_dsum_cases'
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(f' : (x: dsum_known_key s) -> Tot (jumper (dsnd (f x))))
(#k: parser_kind)
(#g: parser k (dsum_type_of_unknown_tag s))
(g' : jumper g)
(x: dsum_key s)
: Tot (jump_dsum_cases_t s f g x)
= synth_dsum_case_injective s x;
match x with
| Known x' -> jump_synth (f' x') (synth_dsum_case s (Known x')) () <: jumper (parse_dsum_cases' s f g x)
| Unknown x' -> jump_synth g' (synth_dsum_case s (Unknown x')) () <: jumper (parse_dsum_cases' s f g x)
inline_for_extraction
let jump_dsum_cases'_destr
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(f' : (x: dsum_known_key s) -> Tot (jumper (dsnd (f x))))
(#k: parser_kind)
(#g: parser k (dsum_type_of_unknown_tag s))
(g' : jumper g)
(destr: dep_enum_destr _ (fun k -> jump_dsum_cases_t s f g (Known k)))
(x: dsum_key s)
: Tot (jump_dsum_cases_t s f g x)
= fun #rrel #rel input pos ->
match x with
| Known k ->
destr
_
(fun k -> jump_dsum_cases_if s f g (Known k))
(fun _ _ -> ())
(fun _ _ _ _ -> ())
(fun k -> jump_dsum_cases' s f f' g' (Known k))
k
input
pos
| Unknown r -> jump_dsum_cases' s f f' g' (Unknown r) input pos
inline_for_extraction
let jump_dsum_cases
(s: dsum)
(f: (x: dsum_known_key s) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag s x)))
(f' : (x: dsum_known_key s) -> Tot (jumper (dsnd (f x))))
(#k: parser_kind)
(#g: parser k (dsum_type_of_unknown_tag s))
(g' : jumper g)
(destr: dep_enum_destr _ (fun k -> jump_dsum_cases_t s f g (Known k)))
(x: dsum_key s)
: Tot (jumper (parse_dsum_cases s f g x))
= fun #rrel #rel input pos ->
let h = HST.get () in
[@inline_let]
let _ =
valid_facts (parse_dsum_cases' s f g x) h input pos;
valid_facts (parse_dsum_cases s f g x) h input pos;
parse_dsum_cases_eq' s f g x (bytes_of_slice_from h input pos)
in
jump_dsum_cases'_destr s f f' g' destr x input pos
#push-options "--z3rlimit 16"
inline_for_extraction
let jump_dsum
(#kt: parser_kind)
(t: dsum)
(#p: parser kt (dsum_repr_type t))
(v: jumper p)
(p32: leaf_reader p)
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(f32: (x: dsum_known_key t) -> Tot (jumper (dsnd (f x))))
(#k': parser_kind)
(#g: parser k' (dsum_type_of_unknown_tag t))
(g32: jumper g)
(destr: dep_maybe_enum_destr_t (dsum_enum t) (jump_dsum_cases_t t f g))
: Tot (jumper (parse_dsum t p f g))
= fun #rrel #rel input pos ->
let h = HST.get () in
[@inline_let]
let _ = parse_dsum_eq' t p f g (bytes_of_slice_from h input pos) in
[@inline_let]
let _ = valid_facts (parse_dsum t p f g) h input pos in
[@inline_let]
let _ = valid_facts p h input pos in
let pos_after_tag = v input pos in
let tg = p32 input pos in
[@inline_let]
let _ = valid_facts (parse_dsum_cases' t f g (maybe_enum_key_of_repr (dsum_enum t) tg)) h input pos_after_tag in
destr (jump_dsum_cases_eq t f g) (jump_dsum_cases_if t f g) (fun _ _ -> ()) (fun _ _ _ _ -> ()) (jump_dsum_cases' t f f32 g32) tg input pos_after_tag
#pop-options
inline_for_extraction
let read_dsum_cases'
(t: dsum)
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(f32: (x: dsum_known_key t) -> Tot (leaf_reader (dsnd (f x))))
(#k': parser_kind)
(g: parser k' (dsum_type_of_unknown_tag t))
(g32: leaf_reader g)
(x: dsum_key t)
: Tot (leaf_reader (parse_dsum_cases' t f g x))
= fun #rrel #rel input pos ->
[@inline_let]
let _ = synth_dsum_case_injective t x in
match x with
| Known x' ->
read_synth'
(dsnd (f x'))
(synth_dsum_case t (Known x'))
(f32 x')
()
input
pos
| Unknown x' ->
read_synth'
g
(synth_dsum_case t (Unknown x'))
g32
()
input
pos
inline_for_extraction
let read_dsum_cases_t
(t: dsum)
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(#k': parser_kind)
(g: parser k' (dsum_type_of_unknown_tag t))
(k: dsum_known_key t)
: Tot Type
= leaf_reader (parse_dsum_cases' t f g (Known k))
let read_dsum_cases_t_eq
(t: dsum)
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(#k': parser_kind)
(g: parser k' (dsum_type_of_unknown_tag t))
(k: dsum_known_key t)
(x y : read_dsum_cases_t t f g k)
: GTot Type0
= True
inline_for_extraction
let read_dsum_cases_t_if
(t: dsum)
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(#k': parser_kind)
(g: parser k' (dsum_type_of_unknown_tag t))
(k: dsum_known_key t)
: Tot (if_combinator _ (read_dsum_cases_t_eq t f g k))
= fun cond (sv_true: cond_true cond -> Tot (read_dsum_cases_t t f g k)) (sv_false: cond_false cond -> Tot (read_dsum_cases_t t f g k)) #_ #_ input pos ->
if cond
then sv_true () input pos
else sv_false () input pos
inline_for_extraction
let read_dsum_cases
(t: dsum)
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(f32: (x: dsum_known_key t) -> Tot (leaf_reader (dsnd (f x))))
(#k': parser_kind)
(g: parser k' (dsum_type_of_unknown_tag t))
(g32: leaf_reader g)
(destr: dep_enum_destr _ (read_dsum_cases_t t f g))
(x: dsum_key t)
: Tot (leaf_reader (parse_dsum_cases' t f g x))
= fun #_ #_ input pos ->
match x with
| Known k ->
destr
_
(read_dsum_cases_t_if t f g)
(fun _ _ -> ())
(fun _ _ _ _ -> ())
(fun k -> read_dsum_cases' t f f32 g g32 (Known k))
k
input
pos
| Unknown r ->
read_dsum_cases' t f f32 g g32 (Unknown r) input pos
#push-options "--z3rlimit 16"
inline_for_extraction
let read_dsum
(#kt: parser_kind)
(t: dsum)
(#p: parser kt (dsum_repr_type t))
(p32: leaf_reader (parse_maybe_enum_key p (dsum_enum t)))
(j: jumper p)
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(f32: (x: dsum_known_key t) -> Tot (leaf_reader (dsnd (f x))))
(#k': parser_kind)
(#g: parser k' (dsum_type_of_unknown_tag t))
(g32: leaf_reader g)
(destr: dep_enum_destr _ (read_dsum_cases_t t f g))
: Tot (leaf_reader (parse_dsum t p f g))
= fun #_ #_ input pos ->
let h = HST.get () in
valid_facts (parse_dsum t p f g) h input pos;
parse_dsum_eq_ t p f g (bytes_of_slice_from h input pos);
valid_facts (parse_maybe_enum_key p (dsum_enum t)) h input pos;
let k = p32 input pos in
let pos' = jump_maybe_enum_key j (dsum_enum t) input pos in
valid_facts (parse_dsum_cases' t f g k) h input pos' ;
read_dsum_cases t f f32 g g32 destr k input pos'
#pop-options
inline_for_extraction
let serialize32_dsum_type_of_tag
(t: dsum)
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(sf: (x: dsum_known_key t) -> Tot (serializer (dsnd (f x))))
(sf32: (x: dsum_known_key t) -> Tot (serializer32 (sf x)))
(#k': parser_kind)
(#g: parser k' (dsum_type_of_unknown_tag t))
(#sg: serializer g)
(sg32: serializer32 sg)
(tg: dsum_key t)
: Tot (serializer32 (serialize_dsum_type_of_tag t f sf g sg tg))
= match tg with
| Known x' -> serialize32_ext (dsnd (f x')) (sf x') (sf32 x') (parse_dsum_type_of_tag t f g tg) ()
| Unknown x' -> serialize32_ext g sg sg32 (parse_dsum_type_of_tag t f g tg) ()
inline_for_extraction
let serialize32_dsum_cases_aux
(t: dsum)
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(sf: (x: dsum_known_key t) -> Tot (serializer (dsnd (f x))))
(sf32: (x: dsum_known_key t) -> Tot (serializer32 (sf x)))
(#k': parser_kind)
(#g: parser k' (dsum_type_of_unknown_tag t))
(#sg: serializer g)
(sg32: serializer32 sg)
(tg: dsum_key t)
: Tot (serializer32 (serialize_dsum_cases t f sf g sg tg))
= [@inline_let]
let _ = synth_dsum_case_injective t tg in
[@inline_let]
let _ = synth_dsum_case_inverse t tg in
serialize32_synth
(serialize32_dsum_type_of_tag t f sf sf32 sg32 tg)
(synth_dsum_case t tg)
(synth_dsum_case_recip t tg)
(fun x -> synth_dsum_case_recip t tg x)
()
inline_for_extraction
let serialize32_dsum_cases_t
(t: dsum)
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(sf: (x: dsum_known_key t) -> Tot (serializer (dsnd (f x))))
(#k': parser_kind)
(g: parser k' (dsum_type_of_unknown_tag t))
(sg: serializer g)
(k: dsum_known_key t)
: Tot Type
= serializer32 (serialize_dsum_cases t f sf g sg (Known k))
let serialize32_dsum_cases_t_eq
(t: dsum)
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(sf: (x: dsum_known_key t) -> Tot (serializer (dsnd (f x))))
(#k': parser_kind)
(g: parser k' (dsum_type_of_unknown_tag t))
(sg: serializer g)
(k: dsum_known_key t)
(x y: serialize32_dsum_cases_t t f sf g sg k)
: GTot Type0
= True
inline_for_extraction
let serialize32_dsum_cases_t_if
(t: dsum)
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(sf: (x: dsum_known_key t) -> Tot (serializer (dsnd (f x))))
(#k': parser_kind)
(g: parser k' (dsum_type_of_unknown_tag t))
(sg: serializer g)
(k: dsum_known_key t)
: Tot (if_combinator _ (serialize32_dsum_cases_t_eq t f sf g sg k))
= fun cond (sv_true: (cond_true cond -> Tot (serialize32_dsum_cases_t t f sf g sg k))) (sv_false: (cond_false cond -> Tot (serialize32_dsum_cases_t t f sf g sg k))) x #rrel #rel output pos ->
if cond
then (sv_true () x output pos)
else (sv_false () x output pos)
inline_for_extraction
let serialize32_dsum_cases
(t: dsum)
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(sf: (x: dsum_known_key t) -> Tot (serializer (dsnd (f x))))
(sf32: (x: dsum_known_key t) -> Tot (serializer32 (sf x)))
(#k': parser_kind)
(#g: parser k' (dsum_type_of_unknown_tag t))
(#sg: serializer g)
(sg32: serializer32 sg)
(destr: dep_enum_destr _ (serialize32_dsum_cases_t t f sf g sg))
(tg: dsum_key t)
: Tot (serializer32 (serialize_dsum_cases t f sf g sg tg))
= fun x #rrel #rel output pos ->
match tg with
| Known k ->
destr
_
(serialize32_dsum_cases_t_if t f sf g sg)
(fun _ _ -> ())
(fun _ _ _ _ -> ())
(fun k -> serialize32_dsum_cases_aux t f sf sf32 sg32 (Known k))
k
x
output
pos
| Unknown r ->
serialize32_dsum_cases_aux t f sf sf32 sg32 (Unknown r) x output pos
inline_for_extraction
let serialize32_dsum
(#kt: parser_kind)
(t: dsum)
(#p: parser kt (dsum_repr_type t))
(s: serializer p {kt.parser_kind_subkind == Some ParserStrong})
(s32: serializer32 (serialize_maybe_enum_key _ s (dsum_enum t)))
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(sf: (x: dsum_known_key t) -> Tot (serializer (dsnd (f x))))
(sf32: (x: dsum_known_key t) -> Tot (serializer32 (sf x)))
(#k': parser_kind)
(#g: parser k' (dsum_type_of_unknown_tag t))
(#sg: serializer g)
(sg32: serializer32 sg)
(destr: dep_enum_destr _ (serialize32_dsum_cases_t t f sf g sg))
: Tot (serializer32 (serialize_dsum t s f sf g sg))
= fun x #_ #_ output pos ->
[@inline_let]
let _ = serialize_dsum_eq' t s f sf g sg x in
let tg = dsum_tag_of_data t x in
serialize32_nondep_then_aux
s32
(serialize32_dsum_cases t f sf sf32 sg32 destr tg)
tg
x
output
pos
let clens_dsum_tag
(s: dsum)
: Tot (clens (dsum_type s) (dsum_key s))
= {
clens_cond = (fun _ -> True);
clens_get = dsum_tag_of_data s;
}
let gaccessor_dsum_tag
(#kt: parser_kind)
(t: dsum)
(p: parser kt (dsum_repr_type t))
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
: Tot (gaccessor (parse_dsum t p f g) (parse_maybe_enum_key p (dsum_enum t)) (clens_dsum_tag t))
= gaccessor_tagged_union_tag
(parse_maybe_enum_key p (dsum_enum t))
(dsum_tag_of_data t)
(parse_dsum_cases t f g)
inline_for_extraction
let accessor_dsum_tag
(#kt: parser_kind)
(t: dsum)
(p: parser kt (dsum_repr_type t))
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
: Tot (accessor (gaccessor_dsum_tag t p f g))
= accessor_tagged_union_tag
(parse_maybe_enum_key p (dsum_enum t))
(dsum_tag_of_data t)
(parse_dsum_cases t f g)
let clens_dsum_payload
(s: dsum)
(k: dsum_key s)
: Tot (clens (dsum_type s) (dsum_type_of_tag s k))
= {
clens_cond = (fun (x: dsum_type s) -> dsum_tag_of_data s x == k);
clens_get = (fun (x: dsum_type s) -> synth_dsum_case_recip s k x <: Ghost (dsum_type_of_tag s k) (requires (dsum_tag_of_data s x == k)) (ensures (fun _ -> True)));
}
let clens_dsum_unknown_payload
(s: dsum)
: Tot (clens (dsum_type s) (dsum_type_of_unknown_tag s))
= {
clens_cond = (fun (x: dsum_type s) -> Unknown? (dsum_tag_of_data s x));
clens_get = (fun (x: dsum_type s) -> synth_dsum_case_recip s (dsum_tag_of_data s x) x <: Ghost (dsum_type_of_unknown_tag s) (requires (Unknown? (dsum_tag_of_data s x))) (ensures (fun _ -> True)));
}
#push-options "--z3rlimit 16"
let gaccessor_clens_dsum_payload'
(#kt: parser_kind)
(t: dsum)
(p: parser kt (dsum_repr_type t))
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
(k: dsum_key t)
: Tot (gaccessor' (parse_dsum t p f g) (parse_dsum_type_of_tag' t f g k) (clens_dsum_payload t k))
= fun (input: bytes) ->
parse_dsum_eq3 t p f g input;
let res =
match parse p input with
| Some (_, consumed) ->
synth_dsum_case_inverse t k;
synth_dsum_case_injective t k;
synth_injective_synth_inverse_synth_inverse_recip (synth_dsum_case t k) (synth_dsum_case_recip t k) ();
(consumed)
| _ -> (0) // dummy
in
(res <: (res: _ { gaccessor_post' (parse_dsum t p f g) (parse_dsum_type_of_tag' t f g k) (clens_dsum_payload t k) input res } ))
let gaccessor_clens_dsum_payload_injective
(#kt: parser_kind)
(t: dsum)
(p: parser kt (dsum_repr_type t))
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
(k: dsum_key t)
(sl sl' : bytes)
: Lemma
(requires (
gaccessor_pre (parse_dsum t p f g) (parse_dsum_type_of_tag' t f g k) (clens_dsum_payload t k) sl /\
gaccessor_pre (parse_dsum t p f g) (parse_dsum_type_of_tag' t f g k) (clens_dsum_payload t k) sl' /\
injective_precond (parse_dsum t p f g) sl sl'
))
(ensures (
gaccessor_clens_dsum_payload' t p f g k sl == gaccessor_clens_dsum_payload' t p f g k sl'
))
=
parse_dsum_eq3 t p f g sl;
parse_dsum_eq3 t p f g sl';
parse_injective (parse_dsum t p f g) sl sl' ;
parse_injective p sl sl'
let gaccessor_clens_dsum_payload_no_lookahead
(#kt: parser_kind)
(t: dsum)
(p: parser kt (dsum_repr_type t))
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
(k: dsum_key t)
(sl sl' : bytes)
: Lemma
(requires (
(parse_dsum_kind kt t f ku).parser_kind_subkind == Some ParserStrong /\
gaccessor_pre (parse_dsum t p f g) (parse_dsum_type_of_tag' t f g k) (clens_dsum_payload t k) sl /\
gaccessor_pre (parse_dsum t p f g) (parse_dsum_type_of_tag' t f g k) (clens_dsum_payload t k) sl' /\
no_lookahead_on_precond (parse_dsum t p f g) sl sl'
))
(ensures (
gaccessor_clens_dsum_payload' t p f g k sl == gaccessor_clens_dsum_payload' t p f g k sl'
))
= parse_dsum_eq3 t p f g sl;
parse_dsum_eq3 t p f g sl';
parse_strong_prefix (parse_dsum t p f g) sl sl' ;
parse_injective p sl sl'
let gaccessor_clens_dsum_payload
(#kt: parser_kind)
(t: dsum)
(p: parser kt (dsum_repr_type t))
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
(k: dsum_key t)
: Tot (gaccessor (parse_dsum t p f g) (parse_dsum_type_of_tag' t f g k) (clens_dsum_payload t k))
= Classical.forall_intro_2 (fun x -> Classical.move_requires (gaccessor_clens_dsum_payload_injective t p f g k x));
Classical.forall_intro_2 (fun x -> Classical.move_requires (gaccessor_clens_dsum_payload_no_lookahead t p f g k x));
gaccessor_prop_equiv (parse_dsum t p f g) (parse_dsum_type_of_tag' t f g k) (clens_dsum_payload t k) (gaccessor_clens_dsum_payload' t p f g k);
gaccessor_clens_dsum_payload' t p f g k
inline_for_extraction
let accessor_clens_dsum_payload'
(#kt: parser_kind)
(t: dsum)
(#p: parser kt (dsum_repr_type t))
(j: jumper p)
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
(k: dsum_key t)
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: HST.Stack U32.t
(requires (fun h ->
valid (parse_dsum t p f g) h input pos /\
(clens_dsum_payload t k).clens_cond (contents (parse_dsum t p f g) h input pos)
))
(ensures (fun h pos' h' ->
B.modifies B.loc_none h h' /\
pos' == slice_access h (gaccessor_clens_dsum_payload t p f g k) input pos
))
=
let h = HST.get () in
[@inline_let]
let _ =
let pos' = get_valid_pos (parse_dsum t p f g) h input pos in
let large = bytes_of_slice_from h input pos in
slice_access_eq h (gaccessor_clens_dsum_payload t p f g k) input pos;
valid_facts (parse_dsum t p f g) h input pos;
parse_dsum_eq3 t p f g large;
valid_facts p h input pos
in
j input pos
#pop-options
inline_for_extraction
let accessor_clens_dsum_payload
(#kt: parser_kind)
(t: dsum)
(#p: parser kt (dsum_repr_type t))
(j: jumper p)
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
(k: dsum_key t)
: Tot (accessor (gaccessor_clens_dsum_payload t p f g k))
= fun #rrel #rel -> accessor_clens_dsum_payload' t j f g k #rrel #rel
#push-options "--z3rlimit 16"
let gaccessor_clens_dsum_unknown_payload'
(#kt: parser_kind)
(t: dsum)
(p: parser kt (dsum_repr_type t))
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
: Tot (gaccessor' (parse_dsum t p f g) g (clens_dsum_unknown_payload t))
= fun (input: bytes) ->
parse_dsum_eq3 t p f g input;
let res =
match parse p input with
| Some (tg, consumed) ->
let k = maybe_enum_key_of_repr (dsum_enum t) tg in
synth_dsum_case_inverse t k;
synth_dsum_case_injective t k;
synth_injective_synth_inverse_synth_inverse_recip (synth_dsum_case t k) (synth_dsum_case_recip t k) ();
(consumed)
| _ -> (0) // dummy
in
(res <: (res: _ { gaccessor_post' (parse_dsum t p f g) g (clens_dsum_unknown_payload t) input res } ))
let gaccessor_clens_dsum_unknown_payload_injective
(#kt: parser_kind)
(t: dsum)
(p: parser kt (dsum_repr_type t))
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
(sl sl' : bytes)
: Lemma
(requires (
gaccessor_pre (parse_dsum t p f g) g (clens_dsum_unknown_payload t) sl /\
gaccessor_pre (parse_dsum t p f g) g (clens_dsum_unknown_payload t) sl' /\
injective_precond (parse_dsum t p f g) sl sl'
))
(ensures (gaccessor_clens_dsum_unknown_payload' t p f g sl == gaccessor_clens_dsum_unknown_payload' t p f g sl'))
= parse_dsum_eq3 t p f g sl;
parse_dsum_eq3 t p f g sl';
parse_injective (parse_dsum t p f g) sl sl' ;
parse_injective p sl sl'
let gaccessor_clens_dsum_unknown_payload_no_lookahead
(#kt: parser_kind)
(t: dsum)
(p: parser kt (dsum_repr_type t))
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
(sl sl' : bytes)
: Lemma
(requires (
(parse_dsum_kind kt t f ku).parser_kind_subkind == Some ParserStrong /\
gaccessor_pre (parse_dsum t p f g) g (clens_dsum_unknown_payload t) sl /\
gaccessor_pre (parse_dsum t p f g) g (clens_dsum_unknown_payload t) sl' /\
no_lookahead_on_precond (parse_dsum t p f g) sl sl'
))
(ensures (gaccessor_clens_dsum_unknown_payload' t p f g sl == gaccessor_clens_dsum_unknown_payload' t p f g sl'))
=
parse_dsum_eq3 t p f g sl;
parse_dsum_eq3 t p f g sl';
parse_strong_prefix (parse_dsum t p f g) sl sl' ;
parse_injective p sl sl'
let gaccessor_clens_dsum_unknown_payload
(#kt: parser_kind)
(t: dsum)
(p: parser kt (dsum_repr_type t))
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
: Tot (gaccessor (parse_dsum t p f g) g (clens_dsum_unknown_payload t))
= Classical.forall_intro_2 (fun x -> Classical.move_requires (gaccessor_clens_dsum_unknown_payload_injective t p f g x));
Classical.forall_intro_2 (fun x -> Classical.move_requires (gaccessor_clens_dsum_unknown_payload_no_lookahead t p f g x));
gaccessor_prop_equiv (parse_dsum t p f g) g (clens_dsum_unknown_payload t) (gaccessor_clens_dsum_unknown_payload' t p f g);
gaccessor_clens_dsum_unknown_payload' t p f g
inline_for_extraction
let accessor_clens_dsum_unknown_payload'
(#kt: parser_kind)
(t: dsum)
(#p: parser kt (dsum_repr_type t))
(j: jumper p)
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
(#rrel #rel: _)
(input: slice rrel rel)
(pos: U32.t)
: HST.Stack U32.t
(requires (fun h ->
valid (parse_dsum t p f g) h input pos /\
(clens_dsum_unknown_payload t).clens_cond (contents (parse_dsum t p f g) h input pos)
))
(ensures (fun h pos' h' ->
B.modifies B.loc_none h h' /\
pos' == slice_access h (gaccessor_clens_dsum_unknown_payload t p f g) input pos
))
=
let h = HST.get () in
[@inline_let]
let _ =
let pos' = get_valid_pos (parse_dsum t p f g) h input pos in
let large = bytes_of_slice_from h input pos in
slice_access_eq h (gaccessor_clens_dsum_unknown_payload t p f g) input pos;
valid_facts (parse_dsum t p f g) h input pos;
parse_dsum_eq3 t p f g large;
valid_facts p h input pos
in
j input pos
#pop-options
inline_for_extraction
let accessor_clens_dsum_unknown_payload
(#kt: parser_kind)
(t: dsum)
(#p: parser kt (dsum_repr_type t))
(j: jumper p { kt.parser_kind_subkind == Some ParserStrong })
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
: Tot (accessor (gaccessor_clens_dsum_unknown_payload t p f g))
= fun #rrel #rel -> accessor_clens_dsum_unknown_payload' t j f g #rrel #rel
let clens_dsum_cases_payload
(s: dsum)
(k: dsum_key s)
: Tot (clens (dsum_cases s k) (dsum_type_of_tag s k))
= {
clens_cond = (fun (x: dsum_cases s k) -> True);
clens_get = (fun (x: dsum_cases s k) -> synth_dsum_case_recip s k x <: Ghost (dsum_type_of_tag s k) (requires (True)) (ensures (fun _ -> True)));
}
let gaccessor_clens_dsum_cases_known_payload
(t: dsum)
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
(k: dsum_known_key t)
: Tot (gaccessor (parse_dsum_cases' t f g (Known k)) (dsnd (f k)) (clens_dsum_cases_payload t (Known k)))
= synth_dsum_case_injective t (Known k);
synth_dsum_case_inverse t (Known k);
synth_injective_synth_inverse_synth_inverse_recip (synth_dsum_case t (Known k)) (synth_dsum_case_recip t (Known k)) ();
gaccessor_ext
(gaccessor_synth (dsnd (f k)) (synth_dsum_case t (Known k)) (synth_dsum_case_recip t (Known k)) ())
(clens_dsum_cases_payload t (Known k))
()
inline_for_extraction
let accessor_clens_dsum_cases_known_payload
(t: dsum)
(f: (x: dsum_known_key t) -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x)))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
(k: dsum_known_key t)
: Tot (accessor (gaccessor_clens_dsum_cases_known_payload t f g k))
= [@inline_let]
let _ =
synth_dsum_case_injective t (Known k);
synth_dsum_case_inverse t (Known k);
synth_injective_synth_inverse_synth_inverse_recip (synth_dsum_case t (Known k)) (synth_dsum_case_recip t (Known k)) ()
in
accessor_ext
(accessor_synth (dsnd (f k)) (synth_dsum_case t (Known k)) (synth_dsum_case_recip t (Known k)) ())
(clens_dsum_cases_payload t (Known k))
() | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"LowStar.Buffer.fst.checked",
"LowParse.Spec.Sum.fst.checked",
"LowParse.Low.Enum.fst.checked",
"FStar.UInt64.fsti.checked",
"FStar.UInt32.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Int.Cast.fst.checked",
"FStar.HyperStack.ST.fsti.checked",
"FStar.HyperStack.fst.checked",
"FStar.Classical.fsti.checked"
],
"interface_file": false,
"source_file": "LowParse.Low.Sum.fst"
} | [
{
"abbrev": true,
"full_module": "FStar.HyperStack",
"short_module": "HS"
},
{
"abbrev": true,
"full_module": "FStar.UInt64",
"short_module": "U64"
},
{
"abbrev": true,
"full_module": "FStar.Int.Cast",
"short_module": "Cast"
},
{
"abbrev": true,
"full_module": "LowStar.Buffer",
"short_module": "B"
},
{
"abbrev": true,
"full_module": "FStar.HyperStack.ST",
"short_module": "HST"
},
{
"abbrev": true,
"full_module": "FStar.UInt32",
"short_module": "U32"
},
{
"abbrev": false,
"full_module": "LowParse.Spec.Sum",
"short_module": null
},
{
"abbrev": false,
"full_module": "LowParse.Low.Enum",
"short_module": null
},
{
"abbrev": false,
"full_module": "LowParse.Low",
"short_module": null
},
{
"abbrev": false,
"full_module": "LowParse.Low",
"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",
"short_module": null
}
] | {
"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_elim_box": false,
"smtencoding_l_arith_repr": "boxwrap",
"smtencoding_nl_arith_repr": "boxwrap",
"smtencoding_valid_elim": false,
"smtencoding_valid_intro": true,
"tcnorm": true,
"trivial_pre_for_unannotated_effectful_fns": true,
"z3cliopt": [],
"z3refresh": false,
"z3rlimit": 5,
"z3rlimit_factor": 1,
"z3seed": 0,
"z3smtopt": [],
"z3version": "4.8.5"
} | false |
t: LowParse.Spec.Sum.dsum ->
f:
(x: LowParse.Spec.Sum.dsum_known_key t
-> Prims.dtuple2 LowParse.Spec.Base.parser_kind
(fun k -> LowParse.Spec.Base.parser k (LowParse.Spec.Sum.dsum_type_of_known_tag t x))) ->
g: LowParse.Spec.Base.parser ku (LowParse.Spec.Sum.dsum_type_of_unknown_tag t) ->
k: LowParse.Spec.Sum.dsum_unknown_key t
-> LowParse.Low.Base.Spec.gaccessor (LowParse.Spec.Sum.parse_dsum_cases' t
f
g
(LowParse.Spec.Enum.Unknown k))
g
(LowParse.Low.Sum.clens_dsum_cases_payload t (LowParse.Spec.Enum.Unknown k)) | Prims.Tot | [
"total"
] | [] | [
"LowParse.Spec.Sum.dsum",
"LowParse.Spec.Sum.dsum_known_key",
"Prims.dtuple2",
"LowParse.Spec.Base.parser_kind",
"LowParse.Spec.Base.parser",
"LowParse.Spec.Sum.dsum_type_of_known_tag",
"LowParse.Spec.Sum.dsum_type_of_unknown_tag",
"LowParse.Spec.Sum.dsum_unknown_key",
"LowParse.Low.Base.Spec.gaccessor_ext",
"LowParse.Spec.Sum.dsum_cases",
"LowParse.Spec.Enum.Unknown",
"LowParse.Spec.Sum.dsum_key_type",
"LowParse.Spec.Sum.dsum_repr_type",
"LowParse.Spec.Sum.dsum_enum",
"LowParse.Spec.Combinators.parse_synth",
"LowParse.Spec.Sum.synth_dsum_case",
"LowParse.Low.Combinators.clens_synth",
"LowParse.Spec.Sum.synth_dsum_case_recip",
"LowParse.Low.Combinators.gaccessor_synth",
"LowParse.Low.Sum.clens_dsum_cases_payload",
"Prims.unit",
"LowParse.Spec.Combinators.synth_injective_synth_inverse_synth_inverse_recip",
"LowParse.Spec.Base.refine_with_tag",
"LowParse.Spec.Sum.dsum_key",
"LowParse.Spec.Sum.dsum_type",
"LowParse.Spec.Sum.dsum_tag_of_data",
"LowParse.Spec.Sum.dsum_type_of_tag",
"LowParse.Spec.Sum.synth_dsum_case_inverse",
"LowParse.Spec.Sum.synth_dsum_case_injective",
"LowParse.Low.Base.Spec.gaccessor",
"LowParse.Spec.Sum.parse_dsum_cases_kind",
"LowParse.Spec.Sum.parse_dsum_cases'"
] | [] | false | false | false | false | false | let gaccessor_clens_dsum_cases_unknown_payload
(t: dsum)
(f: (x: dsum_known_key t -> Tot (k: parser_kind & parser k (dsum_type_of_known_tag t x))))
(#ku: parser_kind)
(g: parser ku (dsum_type_of_unknown_tag t))
(k: dsum_unknown_key t)
: Tot
(gaccessor (parse_dsum_cases' t f g (Unknown k)) g (clens_dsum_cases_payload t (Unknown k))) =
| synth_dsum_case_injective t (Unknown k);
synth_dsum_case_inverse t (Unknown k);
synth_injective_synth_inverse_synth_inverse_recip (synth_dsum_case t (Unknown k))
(synth_dsum_case_recip t (Unknown k))
();
gaccessor_ext (gaccessor_synth g
(synth_dsum_case t (Unknown k))
(synth_dsum_case_recip t (Unknown k))
())
(clens_dsum_cases_payload t (Unknown k))
() | false |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.