ticket_lock.v 10.3 KB
Newer Older
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285
From iris.proofmode Require Import tactics.
From iris.algebra Require Import auth gset excl.
From iris.base_logic Require Import auth.
From iris_logrel Require Export logrel examples.lock.

Definition wait_loop: val :=
  rec: "wait_loop" "x" "lk" :=
    if: "x" = !(Fst "lk")
      then #() (* my turn *)
      else "wait_loop" "x" "lk".

Definition newlock : val :=
  λ: <>, ((* owner *) ref #0, (* next *) ref #0).

Definition acquire : val :=
  rec: "acquire" "lk" :=
    let: "n" := !(Snd "lk") in
    if: CAS (Snd "lk") "n" ("n" + #1)
      then wait_loop "n" "lk"
      else "acquire" "lk".

Definition release : val :=
  λ: "lk", (Fst "lk") <- !(Fst "lk") + #1.

Definition LockType := TProd (Tref TNat) (Tref TNat).

Hint Unfold LockType : typeable.

Lemma newlock_type Γ : typed Γ newlock (TArrow TUnit LockType).
Proof. solve_typed. Qed.

Hint Resolve newlock_type : typeable.

Lemma acquire_type Γ : typed Γ acquire (TArrow LockType TUnit).
Proof. unlock acquire wait_loop. solve_typed. Qed.

Hint Resolve acquire_type : typeable.

Lemma release_type Γ : typed Γ release (TArrow LockType TUnit).
Proof. solve_typed. Qed.

Hint Resolve release_type : typeable.

Definition lockτ := TExists (TProd (TProd (TArrow TUnit (TVar 0))
                                          (TArrow (TVar 0) TUnit))
                                          (TArrow (TVar 0) TUnit)).
Lemma ticket_lock_typed Γ : typed Γ (Pack (newlock, acquire, release)) lockτ.
Proof.
  apply TPack with LockType.
  asimpl. solve_typed.
Qed.

Class tlockG Σ :=
  tlock_G :> authG Σ (gset_disjUR nat).
Definition tlockΣ : gFunctors :=
  #[ authΣ (gset_disjUR nat) ].

Definition lockPool := gset ((loc * loc * gname) * loc).
Definition lockPoolR := gsetUR ((loc * loc * gname) * loc).

Class lockPoolG Σ :=
  lockPool_inG :> authG Σ lockPoolR.
Section refinement.
  Context `{logrelG Σ, tlockG Σ, lockPoolG Σ}.

  Definition lockInv (lo ln : loc) (γ : gname) (l' : loc) : iProp Σ :=
    ( (o n : nat) (b : bool), lo ↦ᵢ #o  ln ↦ᵢ #n
    own γ ( GSet (seq_set 0 n))  l' ↦ₛ #b
    if b then own γ ( GSet {[ o ]}) else True)%I.

  Definition lockPoolInv (P : lockPool) : iProp Σ :=
    ([ set] rs  P, match rs with
                     | ((lo, ln, γ), l') => lockInv lo ln γ l'
                     end)%I.

  Definition moduleInv γp : iProp Σ :=
    ( (P : lockPool), own γp ( P)  lockPoolInv P)%I.

  Program Definition lockInt (γp : gname) := λne vv,
    ( (lo ln : loc) (γ : gname) (l' : loc),
        vv.1 = (#lo, #ln)%V  vv.2 = #l'⌝
       own γp ( {[(lo, ln, γ), l']}))%I.
  Next Obligation. solve_proper. Qed.

  Instance lockInt_persistent γp ww : PersistentP (lockInt γp ww).
  Proof. apply _. Qed.

  Lemma lockPool_open_later (P : lockPool) (lo ln : loc) (γ : gname) (l' : loc) :
    (lo, ln, γ, l')  P 
     lockPoolInv P -
    ( lockInv lo ln γ l')   (lockInv lo ln γ l' - lockPoolInv P).
  Proof.
    iIntros (Hrin) "Hreg".
    rewrite /lockPoolInv.
    iDestruct (big_sepS_elem_of_acc _ P _ with "Hreg") as "[Hrs Hreg]"; first apply Hrin.
    by iFrame.
  Qed.

  Lemma lockPool_lookup γp (P : lockPool) x :
    own γp ( P) -
    own γp ( {[ x ]}) -
    x  P.
  Proof.
    iIntros "Ho Hrs".
    iDestruct (own_valid_2 with "Ho Hrs") as %Hfoo.
    iPureIntro.
    apply auth_valid_discrete in Hfoo.
    simpl in Hfoo. destruct Hfoo as [Hfoo _].
    revert Hfoo. rewrite left_id.
    by rewrite gset_included elem_of_subseteq_singleton.
  Qed.

  Lemma lockPool_excl (P : lockPool) (lo ln : loc) γ l' (v : val) :
    lockPoolInv P - lo ↦ᵢ v - (lo, ln, γ, l')  P.
  Proof.
    rewrite /lockPoolInv.
    iIntros "HP Hlo".
    iAssert ((lo, ln, γ, l')  P  False)%I as %Hbaz.
    {
      iIntros (HP).
      rewrite (big_sepS_elem_of _ P _ HP).
      iDestruct "HP" as (a b c) "(Hlo' & Hln & ?)".
      iDestruct (mapsto_valid_2 with "Hlo' Hlo") as %Hfoo;
      compute in Hfoo; contradiction.
    }
    iPureIntro. eauto.
  Qed.

  Lemma ticket_lock_refinement Γ :
    Γ  Pack (newlock, acquire, release)
      log
        Pack (lock.newlock, lock.acquire, lock.release) : lockτ.
  Proof.
    iIntros (Δ).
    pose (N:=logrelN.@"locked").
    iApply fupd_logrel'.
    iMod (own_alloc ( ( : lockPoolR))) as (γp) "HP"; first done.
    iMod (inv_alloc N _ (moduleInv γp) with "[HP]") as "#Hinv".
    { iNext. iExists . iFrame. by rewrite /lockPoolInv big_sepS_empty. }
    iModIntro.
    iApply (bin_log_related_pack _ (lockInt γp)).
    repeat iApply bin_log_related_pair.
    - (* Allocating a new lock *)
      unlock newlock lock.newlock.
      iApply bin_log_related_arrow_val; eauto.
      iAlways. iIntros (? ?) "/= [% %]". simplify_eq.
      rel_let_l. rel_let_r.
      rel_alloc_r as l' "Hl'".
      rel_alloc_l as lo "Hlo".
      rel_alloc_l_atomic.
      iInv N as (P) "[>HP Hpool]" "Hcl".
      iModIntro. iNext.
      iIntros (ln) "Hln".
      iApply fupd_logrel'.
      iMod (own_alloc ( (GSet )   (GSet ))) as (γ) "[Hγ Hγ']".
      { by rewrite -auth_both_op. }
      iMod (own_update with "HP") as "[HP Hls]".
      { eapply auth_update_alloc.
        eapply (gset_local_update _ _ ({[(lo, ln, γ, l')]}  P)).
        apply union_subseteq_r. }
      iModIntro.
      iDestruct (lockPool_excl _ lo ln γ l' with "Hpool Hlo") as %Hnew.
      iMod ("Hcl" with "[-Hls]") as "_".
      { iNext. iExists _; iFrame.
        rewrite /lockPoolInv.
        rewrite big_sepS_insert; last assumption.
        iFrame. iExists _,_,_. iFrame. simpl. iFrame. }
      rel_vals. iModIntro.
      rewrite -gset_op_union.
      iDestruct "Hls" as "[#Hls _]".
      iAlways. iExists _,_,_,_. iFrame "Hls". eauto.
    - (* Acquire *)
      unlock acquire.
      iApply bin_log_related_arrow_val; eauto.
      { by unlock lock.acquire. }
      iAlways. iIntros (? ?) "/= #Hl".
      iDestruct "Hl" as (lo ln γ l') "(% & % & Hls)". simplify_eq.
      iLöb as "IH".
      rel_let_l. repeat rel_proj_l.
      rel_load_l_atomic.
      iInv N as (P) "[>HP Hpool]" "Hcl".
      iDestruct (lockPool_lookup with "HP Hls") as %Hls.
      iDestruct (lockPool_open_later with "Hpool") as "[Hlk Hpool]"; first apply Hls.
      rewrite {1}/lockInv.
      iDestruct "Hlk" as (o n b) "(>Hlo & >Hln & ?)".
      iModIntro. iExists _; iFrame; iNext.
      iIntros "Hln".
      iMod ("Hcl" with "[-]") as "_".
      { iNext. iExists P; iFrame.
        iApply "Hpool". iExists _,_,_; iFrame. }
      rel_let_l. rel_proj_l. rel_op_l.
      clear Hls o b P.
      rel_cas_l_atomic.
      iInv N as (P) "[>HP Hpool]" "Hcl".
      iDestruct (lockPool_lookup with "HP Hls") as %Hls.
      iDestruct (lockPool_open_later with "Hpool") as "[Hlk Hpool]"; first apply Hls.
      rewrite {1}/lockInv.
      iDestruct "Hlk" as (o n' b) "(>Hlo & >Hln & Hseq & Hl' & Hrest)".
      iModIntro. iExists _; iFrame.
      iSplit; iIntros (?); iNext; iIntros "Hln"; rel_if_l.
      + iMod ("Hcl" with "[-]") as "_".
        { iNext. iExists P; iFrame.
          iApply "Hpool". iExists _,_,_; by iFrame. }
        iApply "IH".
      + simplify_eq.
        iApply fupd_logrel'.
        iMod (own_update with "Hseq") as "[Hseq Hticket]".
        { eapply auth_update_alloc.
          eapply (gset_disj_alloc_empty_local_update _ {[ n ]}).
          apply (seq_set_S_disjoint 0). }
        iModIntro.
        rewrite -(seq_set_S_union_L 0).
        rewrite Nat.add_1_r.
        iMod ("Hcl" with "[-Hticket]") as "_".
        { iNext. iExists P; iFrame.
          iApply "Hpool". iExists _,_,_; by iFrame. }
        iClear "IH".
        unlock wait_loop.
        rel_rec_l.
        iLöb as "IH".
        rel_let_l. rel_proj_l.
        rel_load_l_atomic. clear Hls P o b.
        iInv N as (P) "[>HP Hpool]" "Hcl".
        iDestruct (lockPool_lookup with "HP Hls") as %Hls.
        iDestruct (lockPool_open_later with "Hpool") as "[Hlk Hpool]"; first apply Hls.
        rewrite {1}/lockInv.
        iDestruct "Hlk" as (o n' b) "(>Hlo & >Hln & Hseq & Hl' & Hrest)".
        iModIntro. iExists _; iFrame; iNext.
        iIntros "Hlo".
        destruct (decide (n = o)); simplify_eq; rel_op_l.
        (* The ticket is called out *)
        * replace (if PeanoNat.Nat.eq_dec o o then LitV true else LitV false) with #true; last first.
          { (* TODO :( *) case_match; congruence. }
          rel_if_l.
          unlock lock.acquire.
          rel_rec_r.
          destruct b.
          { iDestruct (own_valid_2 with "Hticket Hrest") as %?%gset_disj_valid_op.
            set_solver. }
          rel_cas_suc_r. rel_if_r.
          iMod ("Hcl" with "[-]") as "_".
          { iNext. iExists P; iFrame.
            iApply "Hpool". iExists _,_,_; by iFrame. }
          iApply bin_log_related_unit.

        * replace (if PeanoNat.Nat.eq_dec n o then LitV true else LitV false) with #false; last first.
          { (* TODO :( *) case_match; congruence. }
          rel_if_l.
          iMod ("Hcl" with "[-Hticket]") as "_".
          { iNext. iExists P; iFrame.
            iApply "Hpool". iExists _,_,_; by iFrame. }
          rel_rec_l.
          by iApply "IH".
    - (* Release *)
      unlock release lock.release.
      iApply bin_log_related_arrow_val; eauto.
      iAlways. iIntros (? ?) "/= #Hl".
      iDestruct "Hl" as (lo ln γ l') "(% & % & Hls)". simplify_eq.
      rel_let_l. repeat rel_proj_l.
      rel_load_l_atomic.
      iInv N as (P) "[>HP Hpool]" "Hcl".
      iDestruct (lockPool_lookup with "HP Hls") as %Hls.
      iDestruct (lockPool_open_later with "Hpool") as "[Hlk Hpool]"; first apply Hls.
      rewrite {1}/lockInv.
      iDestruct "Hlk" as (o n b) "(>Hlo & >Hln & ?)".
      iModIntro. iExists _; iFrame; iNext.
      iIntros "Hlo".
      iMod ("Hcl" with "[-]") as "_".
      { iNext. iExists P; iFrame.
        iApply "Hpool". iExists _,_,_; iFrame. }
      rel_op_l.
      rel_store_l_atomic. clear Hls n b P.
      iInv N as (P) "[>HP Hpool]" "Hcl".
      iDestruct (lockPool_lookup with "HP Hls") as %Hls.
      iDestruct (lockPool_open_later with "Hpool") as "[Hlk Hpool]"; first apply Hls.
      rewrite {1}/lockInv.
      iDestruct "Hlk" as (o' n b) "(>Hlo & >Hln & Hseq & Hl' & Hrest)".
      iModIntro. iExists _; iFrame; iNext.
      iIntros "Hlo".
      rel_let_r. rel_store_r.
      iMod ("Hcl" with "[-]") as "_".
      { iNext. iExists P; iFrame.
        iApply "Hpool". iExists _,_,_; iFrame. }
      iApply bin_log_related_unit.
  Qed.
286

287
End refinement.