kvstore_test.go 18 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657
  1. // Copyright 2015 The etcd Authors
  2. //
  3. // Licensed under the Apache License, Version 2.0 (the "License");
  4. // you may not use this file except in compliance with the License.
  5. // You may obtain a copy of the License at
  6. //
  7. // http://www.apache.org/licenses/LICENSE-2.0
  8. //
  9. // Unless required by applicable law or agreed to in writing, software
  10. // distributed under the License is distributed on an "AS IS" BASIS,
  11. // WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
  12. // See the License for the specific language governing permissions and
  13. // limitations under the License.
  14. package mvcc
  15. import (
  16. "crypto/rand"
  17. "encoding/binary"
  18. "math"
  19. "os"
  20. "reflect"
  21. "testing"
  22. "time"
  23. "github.com/coreos/etcd/lease"
  24. "github.com/coreos/etcd/mvcc/backend"
  25. "github.com/coreos/etcd/mvcc/mvccpb"
  26. "github.com/coreos/etcd/pkg/schedule"
  27. "github.com/coreos/etcd/pkg/testutil"
  28. )
  29. func TestStoreRev(t *testing.T) {
  30. b, tmpPath := backend.NewDefaultTmpBackend()
  31. s := NewStore(b, &lease.FakeLessor{}, nil)
  32. defer s.Close()
  33. defer os.Remove(tmpPath)
  34. for i := 1; i <= 3; i++ {
  35. s.Put([]byte("foo"), []byte("bar"), lease.NoLease)
  36. if r := s.Rev(); r != int64(i+1) {
  37. t.Errorf("#%d: rev = %d, want %d", i, r, i+1)
  38. }
  39. }
  40. }
  41. func TestStorePut(t *testing.T) {
  42. kv := mvccpb.KeyValue{
  43. Key: []byte("foo"),
  44. Value: []byte("bar"),
  45. CreateRevision: 1,
  46. ModRevision: 2,
  47. Version: 1,
  48. }
  49. kvb, err := kv.Marshal()
  50. if err != nil {
  51. t.Fatal(err)
  52. }
  53. tests := []struct {
  54. rev revision
  55. r indexGetResp
  56. rr *rangeResp
  57. wrev revision
  58. wkey []byte
  59. wkv mvccpb.KeyValue
  60. wputrev revision
  61. }{
  62. {
  63. revision{1, 0},
  64. indexGetResp{revision{}, revision{}, 0, ErrRevisionNotFound},
  65. nil,
  66. revision{2, 0},
  67. newTestKeyBytes(revision{2, 0}, false),
  68. mvccpb.KeyValue{
  69. Key: []byte("foo"),
  70. Value: []byte("bar"),
  71. CreateRevision: 2,
  72. ModRevision: 2,
  73. Version: 1,
  74. Lease: 1,
  75. },
  76. revision{2, 0},
  77. },
  78. {
  79. revision{1, 1},
  80. indexGetResp{revision{2, 0}, revision{2, 0}, 1, nil},
  81. &rangeResp{[][]byte{newTestKeyBytes(revision{2, 1}, false)}, [][]byte{kvb}},
  82. revision{2, 0},
  83. newTestKeyBytes(revision{2, 0}, false),
  84. mvccpb.KeyValue{
  85. Key: []byte("foo"),
  86. Value: []byte("bar"),
  87. CreateRevision: 2,
  88. ModRevision: 2,
  89. Version: 2,
  90. Lease: 2,
  91. },
  92. revision{2, 0},
  93. },
  94. {
  95. revision{2, 0},
  96. indexGetResp{revision{2, 1}, revision{2, 0}, 2, nil},
  97. &rangeResp{[][]byte{newTestKeyBytes(revision{2, 1}, false)}, [][]byte{kvb}},
  98. revision{3, 0},
  99. newTestKeyBytes(revision{3, 0}, false),
  100. mvccpb.KeyValue{
  101. Key: []byte("foo"),
  102. Value: []byte("bar"),
  103. CreateRevision: 2,
  104. ModRevision: 3,
  105. Version: 3,
  106. Lease: 3,
  107. },
  108. revision{3, 0},
  109. },
  110. }
  111. for i, tt := range tests {
  112. s := newFakeStore()
  113. b := s.b.(*fakeBackend)
  114. fi := s.kvindex.(*fakeIndex)
  115. s.currentRev = tt.rev.main
  116. fi.indexGetRespc <- tt.r
  117. if tt.rr != nil {
  118. b.tx.rangeRespc <- *tt.rr
  119. }
  120. s.Put([]byte("foo"), []byte("bar"), lease.LeaseID(i+1))
  121. data, err := tt.wkv.Marshal()
  122. if err != nil {
  123. t.Errorf("#%d: marshal err = %v, want nil", i, err)
  124. }
  125. wact := []testutil.Action{
  126. {"seqput", []interface{}{keyBucketName, tt.wkey, data}},
  127. }
  128. if tt.rr != nil {
  129. wact = []testutil.Action{
  130. {"seqput", []interface{}{keyBucketName, tt.wkey, data}},
  131. }
  132. }
  133. if g := b.tx.Action(); !reflect.DeepEqual(g, wact) {
  134. t.Errorf("#%d: tx action = %+v, want %+v", i, g, wact)
  135. }
  136. wact = []testutil.Action{
  137. {"get", []interface{}{[]byte("foo"), tt.wputrev.main}},
  138. {"put", []interface{}{[]byte("foo"), tt.wputrev}},
  139. }
  140. if g := fi.Action(); !reflect.DeepEqual(g, wact) {
  141. t.Errorf("#%d: index action = %+v, want %+v", i, g, wact)
  142. }
  143. if s.currentRev != tt.wrev.main {
  144. t.Errorf("#%d: rev = %+v, want %+v", i, s.currentRev, tt.wrev)
  145. }
  146. s.Close()
  147. }
  148. }
  149. func TestStoreRange(t *testing.T) {
  150. key := newTestKeyBytes(revision{2, 0}, false)
  151. kv := mvccpb.KeyValue{
  152. Key: []byte("foo"),
  153. Value: []byte("bar"),
  154. CreateRevision: 1,
  155. ModRevision: 2,
  156. Version: 1,
  157. }
  158. kvb, err := kv.Marshal()
  159. if err != nil {
  160. t.Fatal(err)
  161. }
  162. wrev := int64(2)
  163. tests := []struct {
  164. idxr indexRangeResp
  165. r rangeResp
  166. }{
  167. {
  168. indexRangeResp{[][]byte{[]byte("foo")}, []revision{{2, 0}}},
  169. rangeResp{[][]byte{key}, [][]byte{kvb}},
  170. },
  171. {
  172. indexRangeResp{[][]byte{[]byte("foo"), []byte("foo1")}, []revision{{2, 0}, {3, 0}}},
  173. rangeResp{[][]byte{key}, [][]byte{kvb}},
  174. },
  175. }
  176. ro := RangeOptions{Limit: 1, Rev: 0, Count: false}
  177. for i, tt := range tests {
  178. s := newFakeStore()
  179. b := s.b.(*fakeBackend)
  180. fi := s.kvindex.(*fakeIndex)
  181. s.currentRev = 2
  182. b.tx.rangeRespc <- tt.r
  183. fi.indexRangeRespc <- tt.idxr
  184. ret, err := s.Range([]byte("foo"), []byte("goo"), ro)
  185. if err != nil {
  186. t.Errorf("#%d: err = %v, want nil", i, err)
  187. }
  188. if w := []mvccpb.KeyValue{kv}; !reflect.DeepEqual(ret.KVs, w) {
  189. t.Errorf("#%d: kvs = %+v, want %+v", i, ret.KVs, w)
  190. }
  191. if ret.Rev != wrev {
  192. t.Errorf("#%d: rev = %d, want %d", i, ret.Rev, wrev)
  193. }
  194. wstart, wend := revBytesRange(tt.idxr.revs[0])
  195. wact := []testutil.Action{
  196. {"range", []interface{}{keyBucketName, wstart, wend, int64(0)}},
  197. }
  198. if g := b.tx.Action(); !reflect.DeepEqual(g, wact) {
  199. t.Errorf("#%d: tx action = %+v, want %+v", i, g, wact)
  200. }
  201. wact = []testutil.Action{
  202. {"range", []interface{}{[]byte("foo"), []byte("goo"), wrev}},
  203. }
  204. if g := fi.Action(); !reflect.DeepEqual(g, wact) {
  205. t.Errorf("#%d: index action = %+v, want %+v", i, g, wact)
  206. }
  207. if s.currentRev != 2 {
  208. t.Errorf("#%d: current rev = %+v, want %+v", i, s.currentRev, 2)
  209. }
  210. s.Close()
  211. }
  212. }
  213. func TestStoreDeleteRange(t *testing.T) {
  214. key := newTestKeyBytes(revision{2, 0}, false)
  215. kv := mvccpb.KeyValue{
  216. Key: []byte("foo"),
  217. Value: []byte("bar"),
  218. CreateRevision: 1,
  219. ModRevision: 2,
  220. Version: 1,
  221. }
  222. kvb, err := kv.Marshal()
  223. if err != nil {
  224. t.Fatal(err)
  225. }
  226. tests := []struct {
  227. rev revision
  228. r indexRangeResp
  229. rr rangeResp
  230. wkey []byte
  231. wrev revision
  232. wrrev int64
  233. wdelrev revision
  234. }{
  235. {
  236. revision{2, 0},
  237. indexRangeResp{[][]byte{[]byte("foo")}, []revision{{2, 0}}},
  238. rangeResp{[][]byte{key}, [][]byte{kvb}},
  239. newTestKeyBytes(revision{3, 0}, true),
  240. revision{3, 0},
  241. 2,
  242. revision{3, 0},
  243. },
  244. }
  245. for i, tt := range tests {
  246. s := newFakeStore()
  247. b := s.b.(*fakeBackend)
  248. fi := s.kvindex.(*fakeIndex)
  249. s.currentRev = tt.rev.main
  250. fi.indexRangeRespc <- tt.r
  251. b.tx.rangeRespc <- tt.rr
  252. n, _ := s.DeleteRange([]byte("foo"), []byte("goo"))
  253. if n != 1 {
  254. t.Errorf("#%d: n = %d, want 1", i, n)
  255. }
  256. data, err := (&mvccpb.KeyValue{
  257. Key: []byte("foo"),
  258. }).Marshal()
  259. if err != nil {
  260. t.Errorf("#%d: marshal err = %v, want nil", i, err)
  261. }
  262. wact := []testutil.Action{
  263. {"seqput", []interface{}{keyBucketName, tt.wkey, data}},
  264. }
  265. if g := b.tx.Action(); !reflect.DeepEqual(g, wact) {
  266. t.Errorf("#%d: tx action = %+v, want %+v", i, g, wact)
  267. }
  268. wact = []testutil.Action{
  269. {"range", []interface{}{[]byte("foo"), []byte("goo"), tt.wrrev}},
  270. {"tombstone", []interface{}{[]byte("foo"), tt.wdelrev}},
  271. }
  272. if g := fi.Action(); !reflect.DeepEqual(g, wact) {
  273. t.Errorf("#%d: index action = %+v, want %+v", i, g, wact)
  274. }
  275. if s.currentRev != tt.wrev.main {
  276. t.Errorf("#%d: rev = %+v, want %+v", i, s.currentRev, tt.wrev)
  277. }
  278. }
  279. }
  280. func TestStoreCompact(t *testing.T) {
  281. s := newFakeStore()
  282. defer s.Close()
  283. b := s.b.(*fakeBackend)
  284. fi := s.kvindex.(*fakeIndex)
  285. s.currentRev = 3
  286. fi.indexCompactRespc <- map[revision]struct{}{{1, 0}: {}}
  287. key1 := newTestKeyBytes(revision{1, 0}, false)
  288. key2 := newTestKeyBytes(revision{2, 0}, false)
  289. b.tx.rangeRespc <- rangeResp{[][]byte{key1, key2}, nil}
  290. s.Compact(3)
  291. s.fifoSched.WaitFinish(1)
  292. if s.compactMainRev != 3 {
  293. t.Errorf("compact main rev = %d, want 3", s.compactMainRev)
  294. }
  295. end := make([]byte, 8)
  296. binary.BigEndian.PutUint64(end, uint64(4))
  297. wact := []testutil.Action{
  298. {"put", []interface{}{metaBucketName, scheduledCompactKeyName, newTestRevBytes(revision{3, 0})}},
  299. {"range", []interface{}{keyBucketName, make([]byte, 17), end, int64(10000)}},
  300. {"delete", []interface{}{keyBucketName, key2}},
  301. {"put", []interface{}{metaBucketName, finishedCompactKeyName, newTestRevBytes(revision{3, 0})}},
  302. }
  303. if g := b.tx.Action(); !reflect.DeepEqual(g, wact) {
  304. t.Errorf("tx actions = %+v, want %+v", g, wact)
  305. }
  306. wact = []testutil.Action{
  307. {"compact", []interface{}{int64(3)}},
  308. }
  309. if g := fi.Action(); !reflect.DeepEqual(g, wact) {
  310. t.Errorf("index action = %+v, want %+v", g, wact)
  311. }
  312. }
  313. func TestStoreRestore(t *testing.T) {
  314. s := newFakeStore()
  315. b := s.b.(*fakeBackend)
  316. fi := s.kvindex.(*fakeIndex)
  317. putkey := newTestKeyBytes(revision{3, 0}, false)
  318. putkv := mvccpb.KeyValue{
  319. Key: []byte("foo"),
  320. Value: []byte("bar"),
  321. CreateRevision: 4,
  322. ModRevision: 4,
  323. Version: 1,
  324. }
  325. putkvb, err := putkv.Marshal()
  326. if err != nil {
  327. t.Fatal(err)
  328. }
  329. delkey := newTestKeyBytes(revision{5, 0}, true)
  330. delkv := mvccpb.KeyValue{
  331. Key: []byte("foo"),
  332. }
  333. delkvb, err := delkv.Marshal()
  334. if err != nil {
  335. t.Fatal(err)
  336. }
  337. b.tx.rangeRespc <- rangeResp{[][]byte{finishedCompactKeyName}, [][]byte{newTestRevBytes(revision{3, 0})}}
  338. b.tx.rangeRespc <- rangeResp{[][]byte{putkey, delkey}, [][]byte{putkvb, delkvb}}
  339. b.tx.rangeRespc <- rangeResp{[][]byte{scheduledCompactKeyName}, [][]byte{newTestRevBytes(revision{3, 0})}}
  340. s.restore()
  341. if s.compactMainRev != 3 {
  342. t.Errorf("compact rev = %d, want 5", s.compactMainRev)
  343. }
  344. if s.currentRev != 5 {
  345. t.Errorf("current rev = %v, want 5", s.currentRev)
  346. }
  347. wact := []testutil.Action{
  348. {"range", []interface{}{metaBucketName, finishedCompactKeyName, []byte(nil), int64(0)}},
  349. {"range", []interface{}{keyBucketName, newTestRevBytes(revision{1, 0}), newTestRevBytes(revision{math.MaxInt64, math.MaxInt64}), int64(0)}},
  350. {"range", []interface{}{metaBucketName, scheduledCompactKeyName, []byte(nil), int64(0)}},
  351. }
  352. if g := b.tx.Action(); !reflect.DeepEqual(g, wact) {
  353. t.Errorf("tx actions = %+v, want %+v", g, wact)
  354. }
  355. gens := []generation{
  356. {created: revision{4, 0}, ver: 2, revs: []revision{{3, 0}, {5, 0}}},
  357. {created: revision{0, 0}, ver: 0, revs: nil},
  358. }
  359. ki := &keyIndex{key: []byte("foo"), modified: revision{5, 0}, generations: gens}
  360. wact = []testutil.Action{
  361. {"insert", []interface{}{ki}},
  362. }
  363. if g := fi.Action(); !reflect.DeepEqual(g, wact) {
  364. t.Errorf("index action = %+v, want %+v", g, wact)
  365. }
  366. }
  367. func TestRestoreContinueUnfinishedCompaction(t *testing.T) {
  368. b, tmpPath := backend.NewDefaultTmpBackend()
  369. s0 := NewStore(b, &lease.FakeLessor{}, nil)
  370. defer os.Remove(tmpPath)
  371. s0.Put([]byte("foo"), []byte("bar"), lease.NoLease)
  372. s0.Put([]byte("foo"), []byte("bar1"), lease.NoLease)
  373. s0.Put([]byte("foo"), []byte("bar2"), lease.NoLease)
  374. // write scheduled compaction, but not do compaction
  375. rbytes := newRevBytes()
  376. revToBytes(revision{main: 2}, rbytes)
  377. tx := s0.b.BatchTx()
  378. tx.Lock()
  379. tx.UnsafePut(metaBucketName, scheduledCompactKeyName, rbytes)
  380. tx.Unlock()
  381. s0.Close()
  382. s1 := NewStore(b, &lease.FakeLessor{}, nil)
  383. // wait for scheduled compaction to be finished
  384. time.Sleep(100 * time.Millisecond)
  385. if _, err := s1.Range([]byte("foo"), nil, RangeOptions{Rev: 1}); err != ErrCompacted {
  386. t.Errorf("range on compacted rev error = %v, want %v", err, ErrCompacted)
  387. }
  388. // check the key in backend is deleted
  389. revbytes := newRevBytes()
  390. revToBytes(revision{main: 1}, revbytes)
  391. // The disk compaction is done asynchronously and requires more time on slow disk.
  392. // try 5 times for CI with slow IO.
  393. for i := 0; i < 5; i++ {
  394. tx = s1.b.BatchTx()
  395. tx.Lock()
  396. ks, _ := tx.UnsafeRange(keyBucketName, revbytes, nil, 0)
  397. tx.Unlock()
  398. if len(ks) != 0 {
  399. time.Sleep(100 * time.Millisecond)
  400. continue
  401. }
  402. return
  403. }
  404. t.Errorf("key for rev %+v still exists, want deleted", bytesToRev(revbytes))
  405. }
  406. func TestTxnPut(t *testing.T) {
  407. // assign arbitrary size
  408. bytesN := 30
  409. sliceN := 100
  410. keys := createBytesSlice(bytesN, sliceN)
  411. vals := createBytesSlice(bytesN, sliceN)
  412. b, tmpPath := backend.NewDefaultTmpBackend()
  413. s := NewStore(b, &lease.FakeLessor{}, nil)
  414. defer cleanup(s, b, tmpPath)
  415. for i := 0; i < sliceN; i++ {
  416. txn := s.Write()
  417. base := int64(i + 2)
  418. if rev := txn.Put(keys[i], vals[i], lease.NoLease); rev != base {
  419. t.Errorf("#%d: rev = %d, want %d", i, rev, base)
  420. }
  421. txn.End()
  422. }
  423. }
  424. func TestTxnBlockBackendForceCommit(t *testing.T) {
  425. b, tmpPath := backend.NewDefaultTmpBackend()
  426. s := NewStore(b, &lease.FakeLessor{}, nil)
  427. defer os.Remove(tmpPath)
  428. txn := s.Read()
  429. done := make(chan struct{})
  430. go func() {
  431. s.b.ForceCommit()
  432. done <- struct{}{}
  433. }()
  434. select {
  435. case <-done:
  436. t.Fatalf("failed to block ForceCommit")
  437. case <-time.After(100 * time.Millisecond):
  438. }
  439. txn.End()
  440. select {
  441. case <-done:
  442. case <-time.After(5 * time.Second): // wait 5 seconds for CI with slow IO
  443. testutil.FatalStack(t, "failed to execute ForceCommit")
  444. }
  445. }
  446. // TODO: test attach key to lessor
  447. func newTestRevBytes(rev revision) []byte {
  448. bytes := newRevBytes()
  449. revToBytes(rev, bytes)
  450. return bytes
  451. }
  452. func newTestKeyBytes(rev revision, tombstone bool) []byte {
  453. bytes := newRevBytes()
  454. revToBytes(rev, bytes)
  455. if tombstone {
  456. bytes = appendMarkTombstone(bytes)
  457. }
  458. return bytes
  459. }
  460. func newFakeStore() *store {
  461. b := &fakeBackend{&fakeBatchTx{
  462. Recorder: &testutil.RecorderBuffered{},
  463. rangeRespc: make(chan rangeResp, 5)}}
  464. fi := &fakeIndex{
  465. Recorder: &testutil.RecorderBuffered{},
  466. indexGetRespc: make(chan indexGetResp, 1),
  467. indexRangeRespc: make(chan indexRangeResp, 1),
  468. indexRangeEventsRespc: make(chan indexRangeEventsResp, 1),
  469. indexCompactRespc: make(chan map[revision]struct{}, 1),
  470. }
  471. s := &store{
  472. b: b,
  473. le: &lease.FakeLessor{},
  474. kvindex: fi,
  475. currentRev: 0,
  476. compactMainRev: -1,
  477. fifoSched: schedule.NewFIFOScheduler(),
  478. stopc: make(chan struct{}),
  479. }
  480. s.ReadView, s.WriteView = &readView{s}, &writeView{s}
  481. return s
  482. }
  483. type rangeResp struct {
  484. keys [][]byte
  485. vals [][]byte
  486. }
  487. type fakeBatchTx struct {
  488. testutil.Recorder
  489. rangeRespc chan rangeResp
  490. }
  491. func (b *fakeBatchTx) Lock() {}
  492. func (b *fakeBatchTx) Unlock() {}
  493. func (b *fakeBatchTx) UnsafeCreateBucket(name []byte) {}
  494. func (b *fakeBatchTx) UnsafePut(bucketName []byte, key []byte, value []byte) {
  495. b.Recorder.Record(testutil.Action{Name: "put", Params: []interface{}{bucketName, key, value}})
  496. }
  497. func (b *fakeBatchTx) UnsafeSeqPut(bucketName []byte, key []byte, value []byte) {
  498. b.Recorder.Record(testutil.Action{Name: "seqput", Params: []interface{}{bucketName, key, value}})
  499. }
  500. func (b *fakeBatchTx) UnsafeRange(bucketName []byte, key, endKey []byte, limit int64) (keys [][]byte, vals [][]byte) {
  501. b.Recorder.Record(testutil.Action{Name: "range", Params: []interface{}{bucketName, key, endKey, limit}})
  502. r := <-b.rangeRespc
  503. return r.keys, r.vals
  504. }
  505. func (b *fakeBatchTx) UnsafeDelete(bucketName []byte, key []byte) {
  506. b.Recorder.Record(testutil.Action{Name: "delete", Params: []interface{}{bucketName, key}})
  507. }
  508. func (b *fakeBatchTx) UnsafeForEach(bucketName []byte, visitor func(k, v []byte) error) error {
  509. return nil
  510. }
  511. func (b *fakeBatchTx) Commit() {}
  512. func (b *fakeBatchTx) CommitAndStop() {}
  513. type fakeBackend struct {
  514. tx *fakeBatchTx
  515. }
  516. func (b *fakeBackend) BatchTx() backend.BatchTx { return b.tx }
  517. func (b *fakeBackend) ReadTx() backend.ReadTx { return b.tx }
  518. func (b *fakeBackend) Hash(ignores map[backend.IgnoreKey]struct{}) (uint32, error) { return 0, nil }
  519. func (b *fakeBackend) Size() int64 { return 0 }
  520. func (b *fakeBackend) Snapshot() backend.Snapshot { return nil }
  521. func (b *fakeBackend) ForceCommit() {}
  522. func (b *fakeBackend) Defrag() error { return nil }
  523. func (b *fakeBackend) Close() error { return nil }
  524. type indexGetResp struct {
  525. rev revision
  526. created revision
  527. ver int64
  528. err error
  529. }
  530. type indexRangeResp struct {
  531. keys [][]byte
  532. revs []revision
  533. }
  534. type indexRangeEventsResp struct {
  535. revs []revision
  536. }
  537. type fakeIndex struct {
  538. testutil.Recorder
  539. indexGetRespc chan indexGetResp
  540. indexRangeRespc chan indexRangeResp
  541. indexRangeEventsRespc chan indexRangeEventsResp
  542. indexCompactRespc chan map[revision]struct{}
  543. }
  544. func (i *fakeIndex) Get(key []byte, atRev int64) (rev, created revision, ver int64, err error) {
  545. i.Recorder.Record(testutil.Action{Name: "get", Params: []interface{}{key, atRev}})
  546. r := <-i.indexGetRespc
  547. return r.rev, r.created, r.ver, r.err
  548. }
  549. func (i *fakeIndex) Range(key, end []byte, atRev int64) ([][]byte, []revision) {
  550. i.Recorder.Record(testutil.Action{Name: "range", Params: []interface{}{key, end, atRev}})
  551. r := <-i.indexRangeRespc
  552. return r.keys, r.revs
  553. }
  554. func (i *fakeIndex) Put(key []byte, rev revision) {
  555. i.Recorder.Record(testutil.Action{Name: "put", Params: []interface{}{key, rev}})
  556. }
  557. func (i *fakeIndex) Tombstone(key []byte, rev revision) error {
  558. i.Recorder.Record(testutil.Action{Name: "tombstone", Params: []interface{}{key, rev}})
  559. return nil
  560. }
  561. func (i *fakeIndex) RangeSince(key, end []byte, rev int64) []revision {
  562. i.Recorder.Record(testutil.Action{Name: "rangeEvents", Params: []interface{}{key, end, rev}})
  563. r := <-i.indexRangeEventsRespc
  564. return r.revs
  565. }
  566. func (i *fakeIndex) Compact(rev int64) map[revision]struct{} {
  567. i.Recorder.Record(testutil.Action{Name: "compact", Params: []interface{}{rev}})
  568. return <-i.indexCompactRespc
  569. }
  570. func (i *fakeIndex) Equal(b index) bool { return false }
  571. func (i *fakeIndex) Insert(ki *keyIndex) {
  572. i.Recorder.Record(testutil.Action{Name: "insert", Params: []interface{}{ki}})
  573. }
  574. func createBytesSlice(bytesN, sliceN int) [][]byte {
  575. rs := [][]byte{}
  576. for len(rs) != sliceN {
  577. v := make([]byte, bytesN)
  578. if _, err := rand.Read(v); err != nil {
  579. panic(err)
  580. }
  581. rs = append(rs, v)
  582. }
  583. return rs
  584. }