-
Notifications
You must be signed in to change notification settings - Fork 3
/
v3_mvcc_commute.clj
238 lines (207 loc) · 9.7 KB
/
v3_mvcc_commute.clj
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
; Copyright (c) 2011-2013, Tom Van Cutsem, Vrije Universiteit Brussel
; All rights reserved.
;
; Redistribution and use in source and binary forms, with or without
; modification, are permitted provided that the following conditions are met:
; * Redistributions of source code must retain the above copyright
; notice, this list of conditions and the following disclaimer.
; * Redistributions in binary form must reproduce the above copyright
; notice, this list of conditions and the following disclaimer in the
; documentation and/or other materials provided with the distribution.
; * Neither the name of the Vrije Universiteit Brussel nor the
; names of its contributors may be used to endorse or promote products
; derived from this software without specific prior written permission.
;
;THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND
;ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
;WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
;DISCLAIMED. IN NO EVENT SHALL VRIJE UNIVERSITEIT BRUSSEL BE LIABLE FOR ANY
;DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
;(INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
;LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND
;ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
;(INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
;SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
;; MC-STM: meta-circular STM in Clojure
;; Multicore Programming
;; (c) 2011-2013, Tom Van Cutsem
;; version 3 - MVCC with commute and ensure
;; Improvements over v2:
;; - proper support for commute and ensure
;;
;; Limitations:
;; - a single global commit-lock for all transactions
;; (= severe bottleneck, but makes it easy to validate and commit)
(ns stm.v3-mvcc-commute
(:use (clojure (set :only [union]))))
;; === MC-STM internals ===
; a thread-local var that holds the current transaction executed by this thread
; if the thread does not execute a transaction, this is set to nil
(def ^:dynamic *current-transaction* nil)
; global counter, incremented every time a transaction commits successfully
(def GLOBAL_WRITE_POINT (atom 0))
; maximum amount of older values stored, per mc-ref
(def MAX_HISTORY 10)
(defn make-transaction
"create and return a new transaction data structure"
[]
{ :read-point @GLOBAL_WRITE_POINT,
:in-tx-values (atom {}), ; map: ref -> any value
:written-refs (atom #{}), ; set of written-to refs
:commutes (atom {}), ; map: ref -> seq of commute-fns
:ensures (atom #{}) }) ; set of ensure-d refs
(defn find-entry-before-or-on
"returns an entry in history-chain whose write-pt <= read-pt,
or nil if no such entry exists"
[history-chain read-pt]
(some (fn [pair]
(if (and pair (<= (:write-point pair) read-pt))
pair)) history-chain))
; history lists of mc-refs are ordered youngest to eldest
(def most-recent first)
(defn tx-retry []
"immediately abort and retry the current transaction"
(throw (new stm.RetryEx)))
(defn tx-read
"read the value of ref inside transaction tx"
[tx mc-ref]
(let [in-tx-values (:in-tx-values tx)]
(if (contains? @in-tx-values mc-ref)
(@in-tx-values mc-ref) ; return the in-tx-value
; search the history chain for entry with write-point <= tx's read-point
(let [ref-entry (find-entry-before-or-on @mc-ref (:read-point tx))]
(if (not ref-entry)
; if such an entry was not found, retry
(tx-retry))
(let [in-tx-value (:value ref-entry)]
(swap! in-tx-values assoc mc-ref in-tx-value) ; cache the value
in-tx-value))))) ; save and return the ref's value
(defn tx-write
"write val to ref inside transaction tx"
[tx ref val]
; can't set a ref after it has already been commuted
(if (contains? @(:commutes tx) ref)
(throw (IllegalStateException. "can't set after commute on " ref)))
(swap! (:in-tx-values tx) assoc ref val)
(swap! (:written-refs tx) conj ref)
val)
(defn tx-ensure
"ensure ref inside transaction tx"
[tx ref]
; mark this ref as being ensure-d
(swap! (:ensures tx) conj ref))
(defn tx-commute
"commute ref inside transaction tx"
[tx ref fun args]
; apply fun to the in-tx-value or
; the most recent value if not read/written before
(let [in-tx-values @(:in-tx-values tx)
res (apply fun (if (contains? in-tx-values ref)
(in-tx-values ref)
(:value (most-recent @ref))) args)]
; retain the result as an in-transaction-value
(swap! (:in-tx-values tx) assoc ref res)
; mark the ref as being commuted,
; storing fun and args because it will be re-executed at commit time
(swap! (:commutes tx) (fn [commutes]
(assoc commutes ref
(cons (fn [val] (apply fun val args))
(commutes ref)))))
res))
; a single global lock for all transactions to acquire on commit
; we use the monitor of a fresh empty Java object
; all threads share the same root-binding, so will acquire the same lock
(def COMMIT_LOCK (new java.lang.Object))
(defn tx-commit
"returns normally if tx committed successfully, throws RetryEx otherwise"
[tx]
(let [written-refs @(:written-refs tx)
ensured-refs @(:ensures tx)
commuted-refs @(:commutes tx)]
(when (not-every? empty? [written-refs ensured-refs commuted-refs])
(locking COMMIT_LOCK
; validate both written-refs and ensured-refs
; Note: no need to validate commuted-refs
(doseq [ref (union written-refs ensured-refs)]
(if (> (:write-point (most-recent @ref))
(:read-point tx))
(tx-retry)))
; if validation OK, re-apply commutes based on its most recent value
(doseq [[commuted-ref commute-fns] commuted-refs]
; if a ref has been written to (by set/alter as well as commute),
; its in-transaction-value will be correct so we don't need to set it
(when (not (contains? written-refs commuted-ref))
(swap! (:in-tx-values tx) assoc commuted-ref
; apply each commute-fn to the result of the previous commute-fn,
; starting with the most recent value
((reduce comp identity commute-fns)
(:value (most-recent @commuted-ref))))))
(let [in-tx-values @(:in-tx-values tx)
new-write-point (inc @GLOBAL_WRITE_POINT)]
; make in-tx-value of all written-to or commuted refs public
(doseq [ref (union written-refs (keys commuted-refs))]
(swap! ref (fn [history-chain]
; add a new entry to the front of the history list...
(cons {:value (in-tx-values ref)
:write-point new-write-point}
; ... and remove the eldest
(butlast history-chain)))))
(swap! GLOBAL_WRITE_POINT inc)))))) ; make the new write-point public
; Note: if a transaction didn't write or ensure any refs,
; it automatically commits
; this function is a little more complicated than it needs to be because
; it can't tail-recursively call itself from within a catch-clause.
; The inner let either returns the value of the transaction, wrapped in a map,
; or nil, to indicate that the transaction must be retried.
; The outer let tests for nil and if so, calls the function tail-recursively
(defn tx-run
"runs zero-argument fun as the body of transaction tx."
[tx fun]
(let [res (binding [*current-transaction* tx]
(try
(let [result (fun)]
(tx-commit tx)
; commit succeeded, return result
{:result result}) ; wrap result, as it may be nil
(catch stm.RetryEx e
nil)))]
(if res
(:result res)
(recur (make-transaction) fun)))) ; tx aborted, retry with fresh tx
; default empty history list, shared by all fresh mc-refs
(def DEFAULT_HISTORY_TAIL (repeat (dec MAX_HISTORY) nil))
;; === MC-STM public API ===
; mc-ref is now a list of length MAX_HISTORY, containing
; {:value, :write-point} pairs, potentially followed by trailing nil values.
; Pairs are ordered latest :write-point first, oldest :write-point last
(defn mc-ref [val]
(atom (cons {:value val :write-point @GLOBAL_WRITE_POINT}
DEFAULT_HISTORY_TAIL)))
(defn mc-deref [ref]
(if (nil? *current-transaction*)
; reading a ref outside of a transaction
(:value (most-recent @ref))
; reading a ref inside a transaction
(tx-read *current-transaction* ref)))
(defn mc-ref-set [ref newval]
(if (nil? *current-transaction*)
; writing a ref outside of a transaction
(throw (IllegalStateException. "can't set mc-ref outside transaction"))
; writing a ref inside a transaction
(tx-write *current-transaction* ref newval)))
(defn mc-alter [ref fun & args]
(mc-ref-set ref (apply fun (mc-deref ref) args)))
(defn mc-commute [ref fun & args]
(if (nil? *current-transaction*)
(throw (IllegalStateException. "can't commute mc-ref outside transaction"))
(tx-commute *current-transaction* ref fun args)))
(defn mc-ensure [ref]
(if (nil? *current-transaction*)
(throw (IllegalStateException. "can't ensure mc-ref outside transaction"))
(tx-ensure *current-transaction* ref)))
(defmacro mc-dosync [& exps]
`(mc-sync (fn [] ~@exps)))
(defn mc-sync [fun]
(if (nil? *current-transaction*)
(tx-run (make-transaction) fun)
(fun))) ; nested dosync blocks implicitly run in the parent transaction