Section TREES.
Variable V : Type.
Variable default: V.
Definition key := Z.
Inductive tree : Type :=
| E : tree
| T: tree -> key -> V -> tree -> tree.
Definition empty_tree : tree := E.
Fixpoint lookup (x: key) (t : tree) : V :=
match t with
| E => default
| T tl k v tr => if x <? k then lookup x tl
else if k <? x then lookup x tr
else v
end.
(*Fixpoint insert (x: key) (v: V) (s: node) : node := match s with | En => EX locka : val, EX lockb : val, N tree_t (TR empty_node locka) x v (TR empty_node lockb) | N (TR a la) y v' (TR b lb) => if  x <? y then N tree_t (TR (insert x v a) la) y v' (TR b lb) else if y <? x then N tree_t (TR a la) y v' (TR (insert x v b) lb) else N tree_t (TR a la) x v (TR b lb) end. *)
Fixpoint insert (x: key) (v: V) (s: tree) : tree :=
match s with
| E => T E x v E
| T a y v' b => if  x <? y then T (insert x v a) y v' b
else if y <? x then T a y v' (insert x v b)
else T a x v b
end.
Fixpoint pushdown_left (a: tree) (bc: tree) : tree :=
match bc with
| E => a
| T b y vy c => T (pushdown_left a b) y vy c
end.
Fixpoint delete (x: key) (s: tree) : tree :=
match s with
| E => E
| T a y v' b => if  x <? y then T (delete x a) y v' b
else if y <? x then T a y v' (delete x b)
else pushdown_left a b
end.
End TREES.
Arguments E {V}.
Arguments T {V} _ _ _ _.
Arguments insert {V} x v s.
Arguments lookup {V} default x t.
Arguments pushdown_left {V} a bc.
Arguments delete {V} x s.
Eval hnf in reptype (nested_field_type t_struct_tree_t [StructField _lock]).
(*Definition t_lock_pred' tl lsh p lock  := EX t : tree val, t_lock_pred tl lsh t p lock.  Definition t_lock_pred_uncurry (t: tree val) lsh (tl : (tree val -> (val * val) -> mpred)) := fun t '(p, lock) => t_lock_pred tl t lsh p lock.  Definition t_lock_pred'' t lsh :=  HORec (t_lock_pred_uncurry t lsh).  Definition t_lock_pred''' t lsh p lock  := t_lock_pred'' t lsh (p,lock).   Definition ltree_final lsh p lock (t : tree val) := !!(field_compatible t_struct_tree_t nil p) && (field_at lsh t_struct_tree_t [StructField _lock] lock p * lock_inv lsh lock (t_lock_pred''' t lsh p lock)). *)
Fixpoint tree_rep (t: tree val) (p: val) : mpred := (*tree strored in p correctly, see struct tree, representation in memory*)
match t with
| E => !!(p=nullval) && emp
| T a x v b => !! (Int.min_signed <= x <= Int.max_signed /\ tc_val (tptr Tvoid) v) &&
EX pa:val, EX pb:val,
data_at Tsh t_struct_tree (Vint (Int.repr x),(v,(pa,pb))) p *
tree_rep a pa * tree_rep b pb
end.
Definition ltree tl lsh p lock :=
!!(field_compatible t_struct_tree_t nil p) &&
(field_at lsh t_struct_tree_t [StructField _lock] lock p *
lock_inv lsh lock (tl (p, lock))).
Fixpoint node_rep tl lsh (t: tree val) (np: val) : mpred := (*tree strored in p correctly, see struct tree, representation in memory*)
match t with
| E => !!(np=nullval) && emp
| T a x v b => !! (Int.min_signed <= x <= Int.max_signed /\ tc_val (tptr Tvoid) v) && EX pa : val, EX pb : val, EX locka : val, EX lockb : val,
data_at Tsh t_struct_tree (Vint (Int.repr x),(v,(pa,pb))) np *
ltree tl lsh pa locka * ltree tl lsh pb lockb
end.
(*Definition t_lock_pred tl t lsh p lock :=  EX tp : val, (field_at Tsh (t_struct_tree_t) [StructField _t] tp p * node_rep tl lsh t tp * malloc_token Tsh (t_struct_tree_t) p * malloc_token Tsh (tlock) lock). *)
Definition t_lock_pred tl t lsh p (lock: val) :=
EX tp : val, (field_at Tsh (t_struct_tree_t) [StructField _t] tp p * node_rep tl lsh t tp). (* *
malloc_token Tsh (t_struct_tree_t) p *
malloc_token Tsh (tlock) lock).*)
Definition t_lock_pred' tl lsh p lock  :=
EX t : tree val, t_lock_pred tl t lsh p lock.
Definition t_lock_pred_uncurry lsh (tl : ((val * val) -> mpred)) := fun '(p, lock) =>
t_lock_pred' tl lsh p lock.
Definition t_lock_pred'' lsh :=  HORec (t_lock_pred_uncurry lsh).
Definition t_lock_pred''' lsh p lock := t_lock_pred'' lsh (p,lock).
Definition ltree_final lsh p lock :=
!!(field_compatible t_struct_tree_t nil p) &&
(field_at lsh t_struct_tree_t [StructField _lock] lock p *
lock_inv lsh lock (t_lock_pred''' lsh p lock)).
Definition treebox_rep (t: tree val) (b: val) :=
EX p: val, data_at Tsh (tptr t_struct_tree_t) p b.
Definition nodebox_rep (sh : share) (lock : val) (nb: val) :=
EX np: val, data_at Tsh (tptr (t_struct_tree_t)) np nb * ltree_final sh np lock.
Definition mallocN_spec :=
DECLARE _mallocN
WITH n: Z
PRE [ 1%positive OF tint]
PROP (4 <= n <= Int.max_unsigned)
LOCAL (temp 1%positive (Vint (Int.repr n)))
SEP ()
POST [ tptr tvoid ]
EX v: val,
PROP (malloc_compatible n v)
LOCAL (temp ret_temp v)
SEP (memory_block Tsh n v).
Definition freeN_spec :=
DECLARE _freeN
WITH p : val , n : Z
PRE [ 1%positive OF tptr tvoid , 2%positive OF tint]
(* we should also require natural_align_compatible (eval_id 1) *)
PROP() LOCAL (temp 1%positive p; temp 2%positive (Vint (Int.repr n)))
SEP (memory_block Tsh n p)
POST [ tvoid ]
PROP () LOCAL () SEP ().
Definition treebox_new_spec :=
DECLARE _treebox_new
WITH u : unit
PRE  [  ]
PROP() LOCAL() SEP ()
POST [ tptr (tptr t_struct_tree) ]
EX v:val,
PROP()
LOCAL(temp ret_temp v)
SEP (data_at Tsh (tptr t_struct_tree) nullval v).
(*Definition insert_spec := DECLARE _insert WITH b: val, x: Z, v: val, t: tree val PRE  [ _t OF (tptr (tptr t_struct_tree)), _x OF tint, _value OF (tptr Tvoid)   ] PROP( Int.min_signed <= x <= Int.max_signed; is_pointer_or_null v) LOCAL(temp _t b; temp _x (Vint (Int.repr x)); temp _value v) SEP (treebox_rep t b) POST [ Tvoid ] PROP() LOCAL() SEP (treebox_rep (insert x v t) b). *)
(*maybe I should add the treebox_rep in the ltree definition *)
(*NEW*)
Definition insert_spec :=
DECLARE _insert
WITH sh : share, p : val, lock : val,
b: val, x: Z, v: val, t: tree val
PRE [  _t OF (tptr (tptr t_struct_tree_t)), _x OF tint,
_value OF (tptr Tvoid)  ]
PROP (readable_share sh; Int.min_signed <= x <= Int.max_signed; is_pointer_or_null v)
LOCAL (temp _t b; temp _x (Vint (Int.repr x)); temp _value v)
SEP (nodebox_rep sh lock b)
POST [ Tvoid ]
PROP ()
LOCAL ()
SEP (nodebox_rep sh lock b).
(*Definition insert_spec prog := DECLARE (ext_link_prog prog "insert") insert_spec'.*)
Definition lookup_spec :=
DECLARE _lookup
WITH b: val, x: Z, v: val, t: tree val
PRE  [ _t OF (tptr (tptr t_struct_tree)), _x OF tint  ]
PROP( Int.min_signed <= x <= Int.max_signed)
LOCAL(temp _t b; temp _x (Vint (Int.repr x)))
SEP (treebox_rep t b)
POST [ tptr Tvoid ]
PROP()
LOCAL(temp ret_temp (lookup nullval x t))
SEP (treebox_rep t b).
Definition turn_left_spec :=
DECLARE _turn_left
WITH ta: tree val, x: Z, vx: val, tb: tree val, y: Z, vy: val, tc: tree val, b: val, l: val, pa: val, r: val
PRE  [ __l OF (tptr (tptr (Tstruct _tree noattr))),
_l OF (tptr (Tstruct _tree noattr)),
_r OF (tptr (Tstruct _tree noattr))]
PROP(Int.min_signed <= x <= Int.max_signed; is_pointer_or_null vx)
LOCAL(temp __l b; temp _l l; temp _r r)
SEP (data_at Tsh (tptr t_struct_tree) l b;
data_at Tsh t_struct_tree (Vint (Int.repr x), (vx, (pa, r))) l;
tree_rep ta pa;
tree_rep (T tb y vy tc) r)
POST [ Tvoid ]
EX pc: val,
PROP(Int.min_signed <= y <= Int.max_signed; is_pointer_or_null vy)
LOCAL()
SEP (data_at Tsh (tptr t_struct_tree) r b;
data_at Tsh t_struct_tree (Vint (Int.repr y), (vy, (l, pc))) r;
tree_rep (T ta x vx tb) l;
tree_rep tc pc).
Definition pushdown_left_spec :=
DECLARE _pushdown_left
WITH ta: tree val, x: Z, v: val, tb: tree val, b: val, p: val
PRE  [ _t OF (tptr (tptr (Tstruct _tree noattr)))]
PROP(Int.min_signed <= x <= Int.max_signed; tc_val (tptr Tvoid) v)
LOCAL(temp _t b)
SEP (data_at Tsh (tptr t_struct_tree) p b;
field_at Tsh t_struct_tree [StructField _key] (Vint (Int.repr x)) p;
field_at Tsh t_struct_tree [StructField _value] v p;
treebox_rep ta (field_address t_struct_tree [StructField _left] p);
treebox_rep tb (field_address t_struct_tree [StructField _right] p))
POST [ Tvoid ]
PROP()
LOCAL()
SEP (treebox_rep (pushdown_left ta tb) b).
Definition delete_spec :=
DECLARE _delete
WITH b: val, x: Z, t: tree val
PRE  [ _t OF (tptr (tptr t_struct_tree)), _x OF tint]
PROP( Int.min_signed <= x <= Int.max_signed)
LOCAL(temp _t b; temp _x (Vint (Int.repr x)))
SEP (treebox_rep t b)
POST [ Tvoid ]
PROP()
LOCAL()
SEP (treebox_rep (delete x t) b).
Definition tree_free_spec :=
DECLARE _tree_free
WITH t: tree val, p: val
PRE  [ _p OF (tptr t_struct_tree) ]
PROP() LOCAL(temp _p p) SEP (tree_rep t p)
POST [ Tvoid ]
PROP()
LOCAL()
SEP (emp).
Definition treebox_free_spec :=
DECLARE _treebox_free
WITH t: tree val, b: val
PRE  [ _b OF (tptr (tptr t_struct_tree)) ]
PROP() LOCAL(temp _b b) SEP (treebox_rep t b)
POST [ Tvoid ]
PROP()
LOCAL()
SEP (emp).
Definition acquire_spec := DECLARE _acquire acquire_spec.
Definition release_spec := DECLARE _release release_spec.
Definition makelock_spec := DECLARE _makelock (makelock_spec _).
(*Definition freelock_spec := DECLARE _freelock (freelock_spec _). Definition spawn_spec := DECLARE _spawn spawn_spec. Definition freelock2_spec := DECLARE _freelock2 (freelock2_spec _). Definition release2_spec := DECLARE _release2 release2_spec.*)
(*no freelock_spec, spawn_spec, freelock2_spec, release2_spec*)
Definition Gprog : funspecs :=
ltac:(with_library prog [acquire_spec; release_spec; makelock_spec;
(* acquire_spec; release_spec; makelock_spec; freelock_spec; makecond_spec; freecond_spec; wait_spec; signal_spec;*)
mallocN_spec; freeN_spec; treebox_new_spec;
tree_free_spec; treebox_free_spec;
insert_spec; lookup_spec;
turn_left_spec; pushdown_left_spec; delete_spec
]).
Hint Resolve tree_rep_saturate_local: saturate_local.
Hint Resolve tree_rep_valid_pointer: valid_pointer.
(*Lemma treebox_rep_saturate_local: forall t b, treebox_rep t b |-- !! field_compatible (tptr t_struct_tree_t) [] b.  Hint Resolve treebox_rep_saturate_local: saturate_local.  Definition insert_inv (b0: val) (t0: tree val) (x: Z) (v: val): environ -> mpred := EX b: val, EX t: tree val, PROP() LOCAL(temp _t b; temp _x (Vint (Int.repr x));   temp _value v) SEP(treebox_rep t b;  (treebox_rep (insert x v t) b -* treebox_rep (insert x v t0) b0)). (* b0 which points to t0 which is the entire tree *)
*)
Definition insert_inv' (b0: val) (t0: tree val) (x: Z) (v: val): environ -> mpred :=
EX b: val, EX lock: val, EX lsh: share,
PROP(readable_share lsh)
LOCAL(temp _t b; temp _x (Vint (Int.repr x));   temp _value v)
SEP(nodebox_rep lsh lock b).
Definition insert_inv (b0: val) (lsh0 : share) (lock0 : val) (t0: tree val) (x: Z) (v: val): environ -> mpred :=
EX b: val, EX lock: val, EX lsh: share,
PROP(readable_share lsh)
LOCAL(temp _t b; temp _x (Vint (Int.repr x));   temp _value v)
SEP(nodebox_rep lsh lock b; nodebox_rep lsh lock b -* nodebox_rep lsh0 lock0 b0).

Lemma tree_rep_nullval: forall tl t lsh,
node_rep tl lsh t nullval |-- !! (t = E).