-
Notifications
You must be signed in to change notification settings - Fork 3.8k
/
replica_evaluate_test.go
464 lines (445 loc) · 14.1 KB
/
replica_evaluate_test.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
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
// Copyright 2020 The Cockroach Authors.
//
// Use of this software is governed by the Business Source License
// included in the file licenses/BSL.txt.
//
// As of the Change Date specified in that file, in accordance with
// the Business Source License, use of this software will be governed
// by the Apache License, Version 2.0, included in the file
// licenses/APL.txt.
package kvserver
import (
"context"
"fmt"
"testing"
"github.com/cockroachdb/cockroach/pkg/kv/kvserver/abortspan"
"github.com/cockroachdb/cockroach/pkg/kv/kvserver/batcheval"
"github.com/cockroachdb/cockroach/pkg/kv/kvserver/batcheval/result"
"github.com/cockroachdb/cockroach/pkg/kv/kvserver/concurrency/lock"
"github.com/cockroachdb/cockroach/pkg/kv/kvserver/storagebase"
"github.com/cockroachdb/cockroach/pkg/roachpb"
"github.com/cockroachdb/cockroach/pkg/storage"
"github.com/cockroachdb/cockroach/pkg/storage/enginepb"
"github.com/cockroachdb/cockroach/pkg/util/hlc"
"github.com/cockroachdb/cockroach/pkg/util/leaktest"
"github.com/stretchr/testify/require"
)
func TestEvaluateBatch(t *testing.T) {
defer leaktest.AfterTest(t)()
ts := hlc.Timestamp{WallTime: 1}
txn := roachpb.MakeTransaction("test", roachpb.Key("a"), 0, ts, 0)
tcs := []testCase{
//
// Test suite for MaxRequestSpans.
//
{
// We should never evaluate empty batches, but here's what would happen
// if we did.
name: "all empty",
setup: func(t *testing.T, d *data) {},
check: func(t *testing.T, r resp) {
require.Nil(t, r.pErr)
require.NotNil(t, r.br)
require.Empty(t, r.br.Responses)
},
}, {
// Scanning without limit should return everything.
name: "scan without MaxSpanRequestKeys",
setup: func(t *testing.T, d *data) {
writeABCDEF(t, d)
req := scanArgsString("a", "z")
d.ba.Add(req)
},
check: func(t *testing.T, r resp) {
verifyScanResult(t, r, []string{"a", "b", "c", "d", "e", "f"})
verifyResumeSpans(t, r, "")
},
}, {
// Ditto in reverse.
name: "reverse scan without MaxSpanRequestKeys",
setup: func(t *testing.T, d *data) {
writeABCDEF(t, d)
req := revScanArgsString("a", "z")
d.ba.Add(req)
},
check: func(t *testing.T, r resp) {
verifyScanResult(t, r, []string{"f", "e", "d", "c", "b", "a"})
verifyResumeSpans(t, r, "")
},
}, {
// Scanning with "giant" limit should return everything.
name: "scan with giant MaxSpanRequestKeys",
setup: func(t *testing.T, d *data) {
writeABCDEF(t, d)
req := scanArgsString("a", "z")
d.ba.Add(req)
d.ba.MaxSpanRequestKeys = 100000
},
check: func(t *testing.T, r resp) {
verifyScanResult(t, r, []string{"a", "b", "c", "d", "e", "f"})
verifyResumeSpans(t, r, "")
},
}, {
// Ditto in reverse.
name: "reverse scan with giant MaxSpanRequestKeys",
setup: func(t *testing.T, d *data) {
writeABCDEF(t, d)
req := revScanArgsString("a", "z")
d.ba.Add(req)
d.ba.MaxSpanRequestKeys = 100000
},
check: func(t *testing.T, r resp) {
verifyScanResult(t, r, []string{"f", "e", "d", "c", "b", "a"})
verifyResumeSpans(t, r, "")
},
}, {
// Similar to above, just two scans.
name: "scans with giant MaxSpanRequestKeys",
setup: func(t *testing.T, d *data) {
writeABCDEF(t, d)
d.ba.Add(scanArgsString("a", "c"))
d.ba.Add(scanArgsString("d", "g"))
d.ba.MaxSpanRequestKeys = 100000
},
check: func(t *testing.T, r resp) {
verifyScanResult(t, r, []string{"a", "b"}, []string{"d", "e", "f"})
verifyResumeSpans(t, r, "", "")
},
}, {
// Ditto in reverse.
name: "reverse scans with giant MaxSpanRequestKeys",
setup: func(t *testing.T, d *data) {
writeABCDEF(t, d)
d.ba.Add(revScanArgsString("d", "g"))
d.ba.Add(revScanArgsString("a", "c"))
d.ba.MaxSpanRequestKeys = 100000
},
check: func(t *testing.T, r resp) {
verifyScanResult(t, r, []string{"f", "e", "d"}, []string{"b", "a"})
verifyResumeSpans(t, r, "", "")
},
}, {
// A batch limited to return only one key. Throw in a Get which is
// not subject to limitation and should thus have returned a value.
// However, the second scan comes up empty because there's no quota left.
//
// Note that there is currently a lot of undesirable behavior in the KV
// API for pretty much any batch that's not a nonoverlapping sorted run
// of only scans or only reverse scans. For example, in the example
// below, one would get a response for get(f) even though the resume
// span on the first scan is `[c,...)`. The higher layers of KV don't
// handle that correctly. Right now we just trust that nobody will
// send such requests.
name: "scans with MaxSpanRequestKeys=1",
setup: func(t *testing.T, d *data) {
writeABCDEF(t, d)
d.ba.Add(scanArgsString("a", "c"))
d.ba.Add(getArgsString("f"))
d.ba.Add(scanArgsString("d", "f"))
d.ba.MaxSpanRequestKeys = 1
},
check: func(t *testing.T, r resp) {
verifyScanResult(t, r, []string{"a"}, []string{"f"}, nil)
verifyResumeSpans(t, r, "b-c", "", "d-f")
b, err := r.br.Responses[1].GetGet().Value.GetBytes()
require.NoError(t, err)
require.Equal(t, "value-f", string(b))
},
}, {
// Ditto in reverse.
name: "reverse scans with MaxSpanRequestKeys=1",
setup: func(t *testing.T, d *data) {
writeABCDEF(t, d)
d.ba.Add(revScanArgsString("d", "f"))
d.ba.Add(getArgsString("f"))
d.ba.Add(revScanArgsString("a", "c"))
d.ba.MaxSpanRequestKeys = 1
},
check: func(t *testing.T, r resp) {
verifyScanResult(t, r, []string{"e"}, []string{"f"}, nil)
verifyResumeSpans(t, r, "d-d\x00", "", "a-c")
b, err := r.br.Responses[1].GetGet().Value.GetBytes()
require.NoError(t, err)
require.Equal(t, "value-f", string(b))
},
}, {
// Similar, but this time the request allows the second scan to
// return one (but not more) remaining key. Again there's a Get
// that isn't counted against the limit.
name: "scans with MaxSpanRequestKeys=3",
setup: func(t *testing.T, d *data) {
writeABCDEF(t, d)
d.ba.Add(scanArgsString("a", "c"))
d.ba.Add(getArgsString("e"))
d.ba.Add(scanArgsString("c", "e"))
d.ba.MaxSpanRequestKeys = 3
},
check: func(t *testing.T, r resp) {
verifyScanResult(t, r, []string{"a", "b"}, []string{"e"}, []string{"c"})
verifyResumeSpans(t, r, "", "", "d-e")
b, err := r.br.Responses[1].GetGet().Value.GetBytes()
require.NoError(t, err)
require.Equal(t, "value-e", string(b))
},
}, {
// Ditto in reverse.
name: "reverse scans with MaxSpanRequestKeys=3",
setup: func(t *testing.T, d *data) {
writeABCDEF(t, d)
d.ba.Add(revScanArgsString("c", "e"))
d.ba.Add(getArgsString("e"))
d.ba.Add(revScanArgsString("a", "c"))
d.ba.MaxSpanRequestKeys = 3
},
check: func(t *testing.T, r resp) {
verifyScanResult(t, r, []string{"d", "c"}, []string{"e"}, []string{"b"})
verifyResumeSpans(t, r, "", "", "a-a\x00")
b, err := r.br.Responses[1].GetGet().Value.GetBytes()
require.NoError(t, err)
require.Equal(t, "value-e", string(b))
},
},
//
// Test suite for TargetBytes.
//
{
// Two scans and a target bytes limit that saturates during the
// first.
name: "scans with TargetBytes=1",
setup: func(t *testing.T, d *data) {
writeABCDEF(t, d)
d.ba.Add(scanArgsString("a", "c"))
d.ba.Add(getArgsString("e"))
d.ba.Add(scanArgsString("c", "e"))
d.ba.TargetBytes = 1
// Also set a nontrivial MaxSpanRequestKeys, just to make sure
// there's no weird interaction (like it overriding TargetBytes).
// The stricter one ought to win.
d.ba.MaxSpanRequestKeys = 3
},
check: func(t *testing.T, r resp) {
verifyScanResult(t, r, []string{"a"}, []string{"e"}, nil)
verifyResumeSpans(t, r, "b-c", "", "c-e")
b, err := r.br.Responses[1].GetGet().Value.GetBytes()
require.NoError(t, err)
require.Equal(t, "value-e", string(b))
},
}, {
// Ditto in reverse.
name: "reverse scans with TargetBytes=1",
setup: func(t *testing.T, d *data) {
writeABCDEF(t, d)
d.ba.Add(revScanArgsString("c", "e"))
d.ba.Add(getArgsString("e"))
d.ba.Add(revScanArgsString("a", "c"))
d.ba.TargetBytes = 1
d.ba.MaxSpanRequestKeys = 3
},
check: func(t *testing.T, r resp) {
verifyScanResult(t, r, []string{"d"}, []string{"e"}, nil)
verifyResumeSpans(t, r, "c-c\x00", "", "a-c")
b, err := r.br.Responses[1].GetGet().Value.GetBytes()
require.NoError(t, err)
require.Equal(t, "value-e", string(b))
},
},
//
// Test suite for KeyLocking.
//
{
// Three scans that observe 3, 1, and 0 keys, respectively. An
// unreplicated lock should be acquired on each key that is scanned.
name: "scan with key locking",
setup: func(t *testing.T, d *data) {
writeABCDEF(t, d)
d.ba.Txn = &txn
scanAD := scanArgsString("a", "d")
scanAD.KeyLocking = lock.Exclusive
d.ba.Add(scanAD)
scanEF := scanArgsString("e", "f")
scanEF.KeyLocking = lock.Exclusive
d.ba.Add(scanEF)
scanHJ := scanArgsString("h", "j")
scanHJ.KeyLocking = lock.Exclusive
d.ba.Add(scanHJ)
},
check: func(t *testing.T, r resp) {
verifyScanResult(t, r, []string{"a", "b", "c"}, []string{"e"}, nil)
verifyAcquiredLocks(t, r, lock.Unreplicated, "a", "b", "c", "e")
verifyAcquiredLocks(t, r, lock.Replicated, []string(nil)...)
},
},
{
// Ditto in reverse.
name: "reverse scan with key locking",
setup: func(t *testing.T, d *data) {
writeABCDEF(t, d)
d.ba.Txn = &txn
scanAD := revScanArgsString("a", "d")
scanAD.KeyLocking = lock.Exclusive
d.ba.Add(scanAD)
scanEF := revScanArgsString("e", "f")
scanEF.KeyLocking = lock.Exclusive
d.ba.Add(scanEF)
scanHJ := revScanArgsString("h", "j")
scanHJ.KeyLocking = lock.Exclusive
d.ba.Add(scanHJ)
},
check: func(t *testing.T, r resp) {
verifyScanResult(t, r, []string{"c", "b", "a"}, []string{"e"}, nil)
verifyAcquiredLocks(t, r, lock.Unreplicated, "c", "b", "a", "e")
verifyAcquiredLocks(t, r, lock.Replicated, []string(nil)...)
},
},
{
// Three scans that observe 3, 1, and 0 keys, respectively. No
// transaction set, so no locks should be acquired.
name: "scan with key locking without txn",
setup: func(t *testing.T, d *data) {
writeABCDEF(t, d)
scanAD := scanArgsString("a", "d")
scanAD.KeyLocking = lock.Exclusive
d.ba.Add(scanAD)
scanEF := scanArgsString("e", "f")
scanEF.KeyLocking = lock.Exclusive
d.ba.Add(scanEF)
scanHJ := scanArgsString("h", "j")
scanHJ.KeyLocking = lock.Exclusive
d.ba.Add(scanHJ)
},
check: func(t *testing.T, r resp) {
verifyScanResult(t, r, []string{"a", "b", "c"}, []string{"e"}, nil)
verifyAcquiredLocks(t, r, lock.Unreplicated, []string(nil)...)
verifyAcquiredLocks(t, r, lock.Replicated, []string(nil)...)
},
},
{
// Ditto in reverse.
name: "reverse scan with key locking without txn",
setup: func(t *testing.T, d *data) {
writeABCDEF(t, d)
scanAD := revScanArgsString("a", "d")
scanAD.KeyLocking = lock.Exclusive
d.ba.Add(scanAD)
scanEF := revScanArgsString("e", "f")
scanEF.KeyLocking = lock.Exclusive
d.ba.Add(scanEF)
scanHJ := revScanArgsString("h", "j")
scanHJ.KeyLocking = lock.Exclusive
d.ba.Add(scanHJ)
},
check: func(t *testing.T, r resp) {
verifyScanResult(t, r, []string{"c", "b", "a"}, []string{"e"}, nil)
verifyAcquiredLocks(t, r, lock.Unreplicated, []string(nil)...)
verifyAcquiredLocks(t, r, lock.Replicated, []string(nil)...)
},
},
}
for _, tc := range tcs {
t.Run(tc.name, func(t *testing.T) {
ctx := context.Background()
eng := storage.NewDefaultInMem()
defer eng.Close()
d := &data{
idKey: storagebase.CmdIDKey("testing"),
eng: eng,
}
d.AbortSpan = abortspan.New(1)
d.ba.Header.Timestamp = ts
tc.setup(t, d)
var r resp
r.d = d
r.br, r.res, r.pErr = evaluateBatch(
ctx,
d.idKey,
d.eng,
d.MockEvalCtx.EvalContext(),
&d.ms,
&d.ba,
d.readOnly,
)
tc.check(t, r)
})
}
}
type data struct {
batcheval.MockEvalCtx
ba roachpb.BatchRequest
idKey storagebase.CmdIDKey
eng storage.Engine
ms enginepb.MVCCStats
readOnly bool
}
type resp struct {
d *data
br *roachpb.BatchResponse
res result.Result
pErr *roachpb.Error
}
type testCase struct {
name string
setup func(*testing.T, *data)
check func(*testing.T, resp)
}
func writeABCDEF(t *testing.T, d *data) {
for _, k := range []string{"a", "b", "c", "d", "e", "f"} {
require.NoError(t, storage.MVCCPut(
context.Background(), d.eng, nil /* ms */, roachpb.Key(k), d.ba.Timestamp,
roachpb.MakeValueFromString("value-"+k), nil /* txn */))
}
}
func verifyScanResult(t *testing.T, r resp, keysPerResp ...[]string) {
require.Nil(t, r.pErr)
require.NotNil(t, r.br)
require.Len(t, r.br.Responses, len(keysPerResp))
for i, keys := range keysPerResp {
var isGet bool
scan := r.br.Responses[i].GetInner()
var rows []roachpb.KeyValue
switch req := scan.(type) {
case *roachpb.ScanResponse:
rows = req.Rows
case *roachpb.ReverseScanResponse:
rows = req.Rows
case *roachpb.GetResponse:
isGet = true
rows = []roachpb.KeyValue{{
Key: r.d.ba.Requests[i].GetGet().Key,
Value: *req.Value,
}}
default:
}
if !isGet {
require.EqualValues(t, len(keys), scan.Header().NumKeys, "in response #%d", i+1)
} else {
require.Zero(t, scan.Header().NumKeys, "in response #%d", i+1)
}
var actKeys []string
for _, row := range rows {
actKeys = append(actKeys, string(row.Key))
}
require.Equal(t, keys, actKeys, "in response #%i", i+1)
}
}
func verifyResumeSpans(t *testing.T, r resp, resumeSpans ...string) {
for i, span := range resumeSpans {
if span == "" {
continue // don't check request
}
rs := r.br.Responses[i].GetInner().Header().ResumeSpan
var act string
if rs != nil {
act = fmt.Sprintf("%s-%s", string(rs.Key), string(rs.EndKey))
}
require.Equal(t, span, act, "#%d", i+1)
}
}
func verifyAcquiredLocks(t *testing.T, r resp, dur lock.Durability, lockedKeys ...string) {
var foundLocked []string
for _, l := range r.res.Local.AcquiredLocks {
if l.Durability == dur {
foundLocked = append(foundLocked, string(l.Key))
}
}
require.Equal(t, lockedKeys, foundLocked)
}