-
Notifications
You must be signed in to change notification settings - Fork 13
/
distribution.go
277 lines (241 loc) · 8.54 KB
/
distribution.go
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
package sturdyc
import (
"context"
"encoding/json"
"errors"
"fmt"
"maps"
"time"
)
// distributedRecord represents the records that we're writing to the distributed storage.
type distributedRecord[V any] struct {
CreatedAt time.Time `json:"created_at"`
Value V `json:"value"`
IsMissingRecord bool `json:"is_missing_record"`
}
// DistributedStorage is an abstraction that the cache interacts with in order
// to keep the distributed storage and in-memory cache in sync. Please note that
// you are responsible for setting the TTL and eviction policy of this storage.
type DistributedStorage interface {
Get(ctx context.Context, key string) ([]byte, bool)
Set(ctx context.Context, key string, value []byte)
GetBatch(ctx context.Context, keys []string) map[string][]byte
SetBatch(ctx context.Context, records map[string][]byte)
}
// DistributedStorageWithDeletions is an abstraction that the cache interacts
// with when you want to use a distributed storage with early refreshes. Please
// note that you are responsible for setting the TTL and eviction policy of
// this storage. The cache will only call the delete functions when it performs
// a refresh and notices that the record has been deleted at the underlying
// data source.
type DistributedStorageWithDeletions interface {
DistributedStorage
Delete(ctx context.Context, key string)
DeleteBatch(ctx context.Context, keys []string)
}
// distributedStorage adds noop implementations for the delete functions so
// that the cache doesn't have to deal with multiple storage types.
type distributedStorage struct {
DistributedStorage
}
// Delete is a noop implementation of the delete function.
func (d *distributedStorage) Delete(_ context.Context, _ string) {
}
// DeleteBatch is a noop implementation of the delete batch function.
func (d *distributedStorage) DeleteBatch(_ context.Context, _ []string) {
}
func marshalRecord[V, T any](value V, c *Client[T]) ([]byte, error) {
record := distributedRecord[V]{CreatedAt: c.clock.Now(), Value: value, IsMissingRecord: false}
bytes, err := json.Marshal(record)
if err != nil {
c.log.Error(fmt.Sprintf("sturdyc: error marshalling record: %v", err))
}
return bytes, err
}
func marshalMissingRecord[V, T any](c *Client[T]) ([]byte, error) {
var missingRecord distributedRecord[V]
missingRecord.CreatedAt = c.clock.Now()
missingRecord.IsMissingRecord = true
bytes, err := json.Marshal(missingRecord)
if err != nil {
c.log.Error(fmt.Sprintf("sturdyc: error marshalling missing record: %v", err))
}
return bytes, err
}
func unmarshalRecord[V any](bytes []byte, key string, log Logger) (distributedRecord[V], error) {
var record distributedRecord[V]
unmarshalErr := json.Unmarshal(bytes, &record)
if unmarshalErr != nil {
log.Error("sturdyc: error unmarshalling key: " + key)
}
return record, unmarshalErr
}
func writeMissingRecord[V, T any](c *Client[T], key string) {
c.safeGo(func() {
if missingRecordBytes, missingRecordErr := marshalMissingRecord[V](c); missingRecordErr == nil {
c.distributedStorage.Set(context.Background(), key, missingRecordBytes)
}
})
}
func distributedFetch[V, T any](c *Client[T], key string, fetchFn FetchFn[V]) FetchFn[V] {
if c.distributedStorage == nil {
return fetchFn
}
return func(ctx context.Context) (V, error) {
stale, hasStale := *new(V), false
bytes, ok := c.distributedStorage.Get(ctx, key)
if ok {
c.reportDistributedCacheHit(true)
record, unmarshalErr := unmarshalRecord[V](bytes, key, c.log)
if unmarshalErr != nil {
return record.Value, unmarshalErr
}
// Check if the record is fresh enough to not need a refresh.
if !c.distributedEarlyRefreshes || c.clock.Since(record.CreatedAt) < c.distributedRefreshAfterDuration {
if record.IsMissingRecord {
c.reportDistributedMissingRecord()
return record.Value, ErrNotFound
}
return record.Value, nil
}
c.reportDistributedRefresh()
stale, hasStale = record.Value, true
}
if !ok {
c.reportDistributedCacheHit(false)
}
// If it's not fresh enough, we'll retrieve it from the source.
response, fetchErr := fetchFn(ctx)
if fetchErr == nil {
c.safeGo(func() {
if recordBytes, marshalErr := marshalRecord[V](response, c); marshalErr == nil {
c.distributedStorage.Set(context.Background(), key, recordBytes)
}
})
return response, nil
}
if errors.Is(fetchErr, ErrNotFound) {
if c.storeMissingRecords {
writeMissingRecord[V](c, key)
return response, fetchErr
}
if hasStale {
c.safeGo(func() {
c.distributedStorage.Delete(context.Background(), key)
})
}
return response, fetchErr
}
if hasStale {
c.reportDistributedStaleFallback()
return stale, nil
}
return response, fetchErr
}
}
func distributedBatchFetch[V, T any](c *Client[T], keyFn KeyFn, fetchFn BatchFetchFn[V]) BatchFetchFn[V] {
if c.distributedStorage == nil {
return fetchFn
}
return func(ctx context.Context, ids []string) (map[string]V, error) {
// We need to be able to look up the ID of the record based on the key.
keyIDMap := make(map[string]string, len(ids))
keys := make([]string, 0, len(ids))
for _, id := range ids {
key := keyFn(id)
keyIDMap[key] = id
keys = append(keys, key)
}
distributedRecords := c.distributedStorage.GetBatch(ctx, keys)
// Group the records we got from the distributed storage into fresh/stale maps.
fresh := make(map[string]V, len(ids))
stale := make(map[string]V, len(ids))
// The IDs that we need to get from the underlying data source are the ones that are stale or missing.
idsToRefresh := make([]string, 0, len(ids))
for _, id := range ids {
key := keyFn(id)
bytes, ok := distributedRecords[key]
if !ok {
c.reportDistributedCacheHit(false)
idsToRefresh = append(idsToRefresh, id)
continue
}
c.reportDistributedCacheHit(true)
record, unmarshalErr := unmarshalRecord[V](bytes, key, c.log)
if unmarshalErr != nil {
idsToRefresh = append(idsToRefresh, id)
continue
}
// If early refreshes isn't enabled it means all records are fresh, otherwise we'll check the CreatedAt time.
if !c.distributedEarlyRefreshes || c.clock.Since(record.CreatedAt) < c.distributedRefreshAfterDuration {
// We never want to return missing records.
if !record.IsMissingRecord {
fresh[id] = record.Value
} else {
c.reportDistributedMissingRecord()
}
continue
}
idsToRefresh = append(idsToRefresh, id)
c.reportDistributedRefresh()
// We never want to return missing records.
if !record.IsMissingRecord {
stale[id] = record.Value
} else {
c.reportDistributedMissingRecord()
}
}
if len(idsToRefresh) == 0 {
return fresh, nil
}
dataSourceResponses, err := fetchFn(ctx, idsToRefresh)
// In case of an error, we'll proceed with the ones we got from the distributed storage.
// NOTE: It's important that we return a specific error here, otherwise we'll potentially
// end up caching the IDs that we weren't able to retrieve from the underlying data source
// as missing records.
if err != nil {
for i := 0; i < len(stale); i++ {
c.reportDistributedStaleFallback()
}
c.log.Error(fmt.Sprintf("sturdyc: error fetching records from the underlying data source. %v", err))
maps.Copy(stale, fresh)
return stale, errOnlyDistributedRecords
}
// Next, we'll want to check if we should change any of the records to be missing or perform deletions.
recordsToWrite := make(map[string][]byte, len(dataSourceResponses))
keysToDelete := make([]string, 0, max(len(idsToRefresh)-len(dataSourceResponses), 0))
for _, id := range idsToRefresh {
key := keyFn(id)
response, ok := dataSourceResponses[id]
if ok {
if recordBytes, marshalErr := marshalRecord[V](response, c); marshalErr == nil {
recordsToWrite[key] = recordBytes
}
continue
}
// At this point, we know that we weren't able to retrieve this ID from the underlying data source.
if c.storeMissingRecords {
if bytes, err := marshalMissingRecord[V](c); err == nil {
recordsToWrite[key] = bytes
}
continue
}
// If the record exists in the distributed storage but not at the underlying data source, we'll have to delete it.
if _, okStale := stale[id]; okStale {
keysToDelete = append(keysToDelete, key)
}
}
if len(keysToDelete) > 0 {
c.safeGo(func() {
c.distributedStorage.DeleteBatch(context.Background(), keysToDelete)
})
}
if len(recordsToWrite) > 0 {
c.safeGo(func() {
c.distributedStorage.SetBatch(context.Background(), recordsToWrite)
})
}
maps.Copy(fresh, dataSourceResponses)
return fresh, nil
}
}