/
cache.clj
514 lines (456 loc) · 16.2 KB
/
cache.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
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
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
; Copyright (c) Rich Hickey. All rights reserved.
; The use and distribution terms for this software are covered by the
; Eclipse Public License 1.0 (http://opensource.org/licenses/eclipse-1.0.php)
; which can be found in the file epl-v10.html at the root of this distribution.
; By using this software in any fashion, you are agreeing to be bound by
; the terms of this license.
; You must not remove this notice, or any other, from this software.
(ns ^{:doc "A caching library for Clojure."
:author "Fogus"}
clojure.core.cache)
;; # Protocols and Types
(defprotocol CacheProtocol
"This is the protocol describing the basic cache capability."
(lookup [cache e]
[cache e not-found]
"Retrieve the value associated with `e` if it exists, else `nil` in
the 2-arg case. Retrieve the value associated with `e` if it exists,
else `not-found` in the 3-arg case.")
(has? [cache e]
"Checks if the cache contains a value associtaed with `e`")
(hit [cache e]
"Is meant to be called if the cache is determined to contain a value
associated with `e`")
(miss [cache e ret]
"Is meant to be called if the cache is determined to **not** contain a
value associated with `e`")
(evict [cache e]
"Removes an entry from the cache")
(seed [cache base]
"Is used to signal that the cache should be created with a seed.
The contract is that said cache should return an instance of its
own type."))
(defmacro defcache
[type-name fields & specifics]
(let [[base-field & _] fields]
`(deftype ~type-name [~@fields]
~@specifics
clojure.lang.ILookup
(valAt [this# key#]
(lookup this# key#))
(valAt [this# key# not-found#]
(if (has? this# key#)
(lookup this# key#)
not-found#))
clojure.lang.IPersistentMap
(assoc [this# k# v#]
(miss this# k# v#))
(without [this# k#]
(evict this# k#))
clojure.lang.Associative
(containsKey [this# k#]
(has? this# k#))
(entryAt [this# k#]
(when (has? this# k#)
(clojure.lang.MapEntry. k# (lookup this# k#))))
clojure.lang.Counted
(count [this#]
(clojure.core/count ~base-field))
clojure.lang.IPersistentCollection
(cons [_# elem#]
(clojure.core/cons ~base-field elem#))
(empty [this#]
(seed this# (empty ~base-field)))
(equiv [_# other#]
(.equiv ~base-field other#))
clojure.lang.Seqable
(seq [_#]
(seq ~base-field))
;; Java interfaces
java.lang.Iterable
(iterator [this#] (.iterator ~base-field)))))
(defcache BasicCache [cache]
CacheProtocol
(lookup [_ item]
(get cache item))
(lookup [_ item not-found]
(get cache item not-found))
(has? [_ item]
(contains? cache item))
(hit [this item] this)
(miss [_ item result]
(BasicCache. (assoc cache item result)))
(evict [_ key]
(BasicCache. (dissoc cache key)))
(seed [_ base]
(BasicCache. base))
Object
(toString [_] (str cache)))
;; FnCache
(defcache FnCache [cache f]
CacheProtocol
(lookup [_ item]
(f (get cache item)))
(lookup [_ item not-found]
(let [ret (get cache item not-found)]
(if (= ret not-found)
not-found
(f ret))))
(has? [_ item]
(contains? cache item))
(hit [this item] this)
(miss [_ item result]
(BasicCache. (assoc cache item result)))
(evict [_ key]
(BasicCache. (dissoc cache key)))
(seed [_ base]
(BasicCache. base))
Object
(toString [_] (str cache)))
;; # FIFO
(defn- describe-layout [mappy limit]
(let [q clojure.lang.PersistentQueue/EMPTY
ks (keys mappy)
[dropping keeping] (split-at (- (count ks) limit) ks)]
{:dropping dropping
:keeping keeping
:queue
(into q (concat (repeat (- limit (count keeping)) ::free)
(take limit keeping)))}))
(defn- dissoc-keys [m ks]
(if ks
(recur (dissoc m (first ks)) (next ks))
m))
(defn- prune-queue [q ks]
(into clojure.lang.PersistentQueue/EMPTY
(filter (complement (set ks)) q)))
(defcache FIFOCache [cache q limit]
CacheProtocol
(lookup [_ item]
(get cache item))
(lookup [_ item not-found]
(get cache item not-found))
(has? [_ item]
(contains? cache item))
(hit [this item]
this)
(miss [_ item result]
(let [k (peek q)]
(FIFOCache. (-> cache (dissoc k) (assoc item result))
(-> q pop (conj item))
limit)))
(evict [this key]
(let [v (get cache key ::miss)]
(if (= v ::miss)
this
(FIFOCache. (dissoc cache key)
(prune-queue q [key])
limit))))
(seed [_ base]
(let [{dropping :dropping
q :queue} (describe-layout base limit)]
(FIFOCache. (dissoc-keys base dropping)
q
limit)))
Object
(toString [_]
(str cache \, \space (pr-str q))))
(defcache LRUCache [cache lru tick limit]
CacheProtocol
(lookup [_ item]
(get cache item))
(lookup [_ item not-found]
(get cache item not-found))
(has? [_ item]
(contains? cache item))
(hit [_ item]
(let [tick+ (inc tick)]
(LRUCache. cache
(assoc lru item tick+)
tick+
limit)))
(miss [_ item result]
(let [tick+ (inc tick)]
(if-let [ks (keys lru)]
(let [k (apply min-key lru ks)]
(LRUCache. (-> cache (dissoc k) (assoc item result)) ;; expulsion case
(-> lru (dissoc k) (assoc item tick+))
tick+
limit))
(LRUCache. (assoc cache item result) ;; no change case
(assoc lru item tick+)
tick+
limit))))
(evict [this key]
(let [v (get cache key ::miss)]
(if (= v ::miss)
this
(LRUCache. (dissoc cache key)
(dissoc lru key)
tick
limit))))
(seed [_ base]
(LRUCache. base
(into {} (for [x (range (- limit) 0)] [x x]))
0
limit))
Object
(toString [_]
(str cache \, \space lru \, \space tick \, \space limit)))
(declare key-killer)
(defcache TTLCache [cache ttl limit]
CacheProtocol
(lookup [_ item]
(get cache item))
(lookup [_ item not-found]
(get cache item not-found))
(has? [_ item]
(when-let [t (get ttl item)]
(< (- (System/currentTimeMillis)
t)
limit)))
(hit [this item] this)
(miss [this item result]
(let [now (System/currentTimeMillis)
kill-old (key-killer ttl limit now)]
(TTLCache. (assoc (kill-old cache) item result)
(assoc (kill-old ttl) item now)
limit)))
(seed [_ base]
(let [now (System/currentTimeMillis)]
(TTLCache. base
(into {} (for [x base] [(key x) now]))
limit)))
(evict [_ key]
(TTLCache. (dissoc cache key)
(dissoc ttl key)
limit))
Object
(toString [_]
(str cache \, \space ttl \, \space limit)))
(defn- key-killer
[ttl limit now]
(let [ks (map key (filter #(> (- now (val %)) limit)
ttl))]
#(apply dissoc % ks)))
(defcache LUCache [cache lu limit]
CacheProtocol
(lookup [_ item]
(get cache item))
(lookup [_ item not-found]
(get cache item not-found))
(has? [_ item]
(contains? cache item))
(hit [_ item]
(LUCache. cache (update-in lu [item] inc) limit))
(miss [_ item result]
(if-let [ks (keys lu)]
(let [k (apply min-key lu ks)]
(LUCache. (-> cache (dissoc k) (assoc item result)) ;; expulsion case
(-> lu (dissoc k) (assoc item 0))
limit))
(LUCache. (assoc cache item result) ;; no change case
(assoc lu item 0)
limit)))
(evict [this key]
(let [v (get cache key ::miss)]
(if (= v ::miss)
this
(LUCache. (dissoc cache key)
(dissoc lu key)
limit))))
(seed [_ base]
(LUCache. base
(into {} (for [x (range (- limit) 0)] [x x]))
limit))
Object
(toString [_]
(str cache \, \space lu \, \space limit)))
;; # LIRS
;; *initial Clojure implementation by Jan Oberhagemann*
;; A
;; [LIRS](http://citeseer.ist.psu.edu/viewdoc/summary?doi=10.1.1.116.2184)
;; cache consists of two LRU lists, `S` and `Q`, and keeps more history
;; than a LRU cache. Every cached item is either a LIR, HIR or
;; non-resident HIR block. `Q` contains only HIR blocks, `S` contains
;; LIR, HIR, non-resident HIR blocks. The total cache size is
;; |`S`|+|`Q`|, |`S`| is typically 99% of the cache size.
;; * LIR block:
;; Low Inter-Reference block, a cached item with a short interval
;; between accesses. A block `x`, `x` ∈ `S` ∧ `x` ∉ `Q` ∧ `x` ∈
;; `cache`, is a LIR block.
;; * HIR block:
;; High Inter-Reference block, a cached item with rare accesses and
;; long interval. A block `x`, `x` ∈ `Q` ∧ `x` ∈ `cache`, is a HIR block.
;; * non-resident HIR block:
;; only the key of the HIR block is cached, without the corresponding
;; value a test (has?) for the corresponding key is always a
;; miss. Used for additional history information. A block `x`, `x` ∈
;; `S` ∧ `x` ∉ `Q` ∧ `x` ∉ `cache`, is a non-resident HIR block.
;; ## Outline of the implemented algorithm
;; `cache` is used to store the key value pairs.
;; `S` and `Q` maintain the relative order of accesses of the keys, like
;; a LRU list.
;; Definition of `prune stack`:
;;
;; repeatedly remove oldest item from S until an item k, k ∉ Q ∧
;; k ∈ cache (a LIR block), is found
;; In case of a miss for key `k` and value `v` (`k` ∉ cache) and
;;
;; * (1.1) `S` is not filled, |`S`| < `limitS`
;; add k to S
;; add k to the cache
;; * (1.2) `k` ∉ `S`, never seen or not seen for a long, long time
;; remove oldest item x from Q
;; remove x from cache
;; add k to S
;; add k to Q
;; add k to the cache
;; * (1.3) `k` ∈ `S`, this is a non-resident HIR block
;; remove oldest item x from Q
;; remove x from cache
;; add k to S
;; remove oldest item y from S
;; add y to Q
;; prune stack
;; In case of a hit for key `k` (`k` ∈ cache) and
;; * (2.1) `k` ∈ `S` ∧ `k` ∉ `Q`, a LIR block
;; add k to S / refresh
;; prune stack if k was the oldest item in S
;; * (2.2) `k` ∈ `S` ∧ `k` ∈ `Q`, a HIR block
;; add k to S / refresh
;; remove k from Q
;; remove oldest item x from S
;; add x to Q
;; prune stack
;; * (2.3) `k` ∉ `S` ∧ `k` ∈ `Q`, a HIR block, only older than the oldest item in S
;; add k to S
;; add k to Q / refresh
(defn- prune-stack [lruS lruQ cache]
(loop [s lruS q lruQ c cache]
(let [k (apply min-key s (keys s))]
(if (or (contains? q k) ; HIR item
(not (contains? c k))) ; non-resident HIR item
(recur (dissoc s k) q c)
s))))
(defcache LIRSCache [cache lruS lruQ tick limitS limitQ]
CacheProtocol
(lookup [_ item]
(get cache item))
(lookup [_ item not-found]
(get cache item not-found))
(has? [_ item]
(contains? cache item))
(hit [_ item]
(let [tick+ (inc tick)]
(if (not (contains? lruS item))
; (2.3) item ∉ S ∧ item ∈ Q
(LIRSCache. cache (assoc lruS item tick+) (assoc lruQ item tick+) tick+ limitS limitQ)
(let [k (apply min-key lruS (keys lruS))]
(if (contains? lruQ item)
; (2.2) item ∈ S ∧ item ∈ Q
(let [new-lruQ (-> lruQ (dissoc item) (assoc k tick+))]
(LIRSCache. cache
(-> lruS (dissoc k) (assoc item tick+) (prune-stack new-lruQ cache))
new-lruQ
tick+
limitS
limitQ))
; (2.1) item ∈ S ∧ item ∉ Q
(LIRSCache. cache
(-> lruS (assoc item tick+) (prune-stack lruQ cache))
lruQ
tick+
limitS
limitQ))))))
(miss [_ item result]
(let [tick+ (inc tick)]
(if (< (count cache) limitS)
; (1.1)
(let [k (apply min-key lruS (keys lruS))]
(LIRSCache. (assoc cache item result)
(-> lruS (dissoc k) (assoc item tick+))
lruQ
tick+
limitS
limitQ))
(let [k (apply min-key lruQ (keys lruQ))
new-lruQ (dissoc lruQ k)
new-cache (-> cache (dissoc k) (assoc item result))]
(if (contains? lruS item)
; (1.3)
(let [lastS (apply min-key lruS (keys lruS))]
(LIRSCache. new-cache
(-> lruS (dissoc lastS) (assoc item tick+) (prune-stack new-lruQ new-cache))
(assoc new-lruQ lastS tick+)
tick+
limitS
limitQ))
; (1.2)
(LIRSCache. new-cache
(assoc lruS item tick+)
(assoc new-lruQ item tick+)
tick+
limitS
limitQ))))))
(seed [_ base]
(LIRSCache. base
(into {} (for [x (range (- limitS) 0)] [x x]))
(into {} (for [x (range (- limitQ) 0)] [x x]))
0
limitS
limitQ))
Object
(toString [_]
(str cache \, \space lruS \, \space lruQ \, \space tick \, \space limitS \, \space limitQ)))
;; Factories
(defn basic-cache-factory
"Returns a pluggable basic cache initialied to `base`"
[base]
{:pre [(map? base)]}
(BasicCache. base))
(defn fifo-cache-factory
"Returns a FIFO cache with the cache and FIFO queue initialized to `base` --
the queue is filled as the values are pulled out of `base`. If the associative
structure can guarantee ordering, then the said ordering will define the
eventual eviction order. Otherwise, there are no guarantees for the eventual
eviction ordering.
If the number of elements in `base` is greater than the limit then some items
in `base` will be dropped from the resulting cache. If the associative
structure used as `base` can guarantee sorting, then the last `limit` elements
will be used as the cache seed values. Otherwise, there are no guarantees about
the elements in the resulting cache."
[limit base]
{:pre [(number? limit) (< 0 limit)
(map? base)]
:post [(== limit (count (.q %)))]}
(clojure.core.cache/seed (FIFOCache. {} clojure.lang.PersistentQueue/EMPTY limit) base))
(defn lru-cache-factory
"Returns an LRU cache with the cache and usage-table initialied to `base` --
each entry is initialized with the same usage value. (maybe this should be
randomized?)"
[limit base]
{:pre [(number? limit) (< 0 limit)
(map? base)]}
(clojure.core.cache/seed (LRUCache. {} {} 0 limit) base))
(defn ttl-cache-factory
"Returns a TTL cache with the cache and expiration-table initialied to `base` --
each with the same time-to-live."
[ttl base]
{:pre [(number? ttl) (<= 0 ttl)
(map? base)]}
(clojure.core.cache/seed (TTLCache. {} {} ttl) base))
(defn lu-cache-factory
"Returns an LU cache with the cache and usage-table initialied to `base`."
[limit base]
{:pre [(number? limit) (< 0 limit)
(map? base)]}
(clojure.core.cache/seed (LUCache. {} {} limit) base))
(defn lirs-cache-factory
"Returns an LIRS cache with the S & R LRU lists set to the indicated
limts."
[s-history-limit q-history-limit base]
{:pre [(number? s-history-limit) (< 0 s-history-limit)
(number? q-history-limit) (< 0 q-history-limit)
(map? base)]}
(seed (LIRSCache. {} {} {} 0 s-history-limit q-history-limit) base))