-
Notifications
You must be signed in to change notification settings - Fork 79
/
batch.go
139 lines (124 loc) · 3.26 KB
/
batch.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
// Copyright 2022 ByteDance and/or its affiliates
//
// Licensed under the Apache License, Version 2.0 (the "License");
// you may not use this file except in compliance with the License.
// You may obtain a copy of the License at
//
// http://www.apache.org/licenses/LICENSE-2.0
//
// Unless required by applicable law or agreed to in writing, software
// distributed under the License is distributed on an "AS IS" BASIS,
// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
// See the License for the specific language governing permissions and
// limitations under the License.
package badger
import (
"bytes"
"context"
"time"
"github.com/dgraph-io/badger"
"github.com/pkg/errors"
"github.com/kubewharf/kubebrain/pkg/storage"
)
type batch struct {
txn *badger.Txn
list []func() error
}
func (b *batch) PutIfNotExist(key []byte, val []byte, ttl int64) {
idx := len(b.list)
f := func() error {
oldItem, err := b.txn.Get(key)
if err == nil {
// value exist
oldVal, copyErr := oldItem.ValueCopy(nil)
if copyErr != nil {
// maybe file is broken
return errors.Wrapf(err, "fail to copy value for key %s", key)
}
return storage.NewErrConflict(idx, key, oldVal)
} else if errors.Is(err, badger.ErrKeyNotFound) {
// value not exist
if ttl != 0 {
entry := badger.NewEntry(key, val).WithTTL(time.Duration(ttl) * time.Second)
return b.txn.SetEntry(entry)
}
return b.txn.Set(key, val)
}
// unknown error
return errors.Wrapf(err, "failed to get key %s", key)
}
b.list = append(b.list, f)
}
func (b *batch) CAS(key []byte, newVal []byte, oldVal []byte, ttl int64) {
idx := len(b.list)
f := func() error {
item, err := b.txn.Get(key)
if err != nil {
if err == badger.ErrKeyNotFound {
return storage.NewErrConflict(idx, key, nil)
}
return err
}
err = item.Value(func(val []byte) error {
if bytes.Compare(oldVal, val) != 0 {
return storage.NewErrConflict(idx, key, val)
}
return nil
})
if err != nil {
return err
}
if ttl != 0 {
entry := badger.NewEntry(key, newVal).WithTTL(time.Duration(ttl) * time.Second)
return b.txn.SetEntry(entry)
}
return b.txn.Set(key, newVal)
}
b.list = append(b.list, f)
}
func (b *batch) Put(key []byte, val []byte, ttl int64) {
f := func() error {
if ttl != 0 {
entry := badger.NewEntry(key, val).WithTTL(time.Duration(ttl) * time.Second)
return b.txn.SetEntry(entry)
}
return b.txn.Set(key, val)
}
b.list = append(b.list, f)
}
func (b *batch) Del(key []byte) {
f := func() error {
return b.txn.Delete(key)
}
b.list = append(b.list, f)
}
func (b *batch) DelCurrent(it storage.Iter) {
idx := len(b.list)
f := func() error {
i := it.(*iter)
item, err := b.txn.Get(i.Key())
if err != nil {
if errors.Is(err, badger.ErrKeyNotFound) {
err = storage.NewErrConflict(idx, it.Key(), nil)
}
return err
}
if item.Version() != i.iIter.Item().Version() {
val, _ := item.ValueCopy(nil)
return storage.NewErrConflict(idx, it.Key(), val)
}
return b.txn.Delete(i.Key())
}
b.list = append(b.list, f)
}
func (b *batch) Commit(ctx context.Context) error {
// discard it anyway finally
defer b.txn.Discard()
for _, f := range b.list {
err := f()
if err != nil {
return err
}
}
return b.txn.Commit()
}