-
Notifications
You must be signed in to change notification settings - Fork 79
/
range.go
256 lines (221 loc) · 7.08 KB
/
range.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
// 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 backend
import (
"bytes"
"context"
"fmt"
"io"
"math"
"time"
"github.com/pkg/errors"
"k8s.io/klog/v2"
proto "github.com/kubewharf/kubebrain-client/api/v2rpc"
"github.com/kubewharf/kubebrain/pkg/storage"
)
// Get implements Backend interface
func (b *backend) Get(ctx context.Context, r *proto.GetRequest) (resp *proto.GetResponse, err error) {
ts := time.Now()
defer func() {
klog.V(klogLevel).InfoS("get",
"key", Key(r.GetKey()),
"rev", r.GetRevision(),
"respRev", resp.GetHeader().GetRevision(),
"respSize", resp.Size(),
"latency", time.Since(ts))
}()
curRev := b.tso.GetRevision()
requireRev := r.GetRevision()
val, modRev, err := b.get(ctx, r.Key, requireRev)
if err == storage.ErrKeyNotFound {
return &proto.GetResponse{
Header: responseHeader(curRev),
}, nil
} else if err != nil {
klog.ErrorS(err, "backend get err", "key", string(r.GetKey()), "revision", r.GetRevision())
return nil, err
}
if modRev > curRev {
curRev = modRev
}
resp = &proto.GetResponse{
Header: responseHeader(curRev),
}
if val != nil {
resp.Kv = &proto.KeyValue{
Key: r.Key,
Value: val,
Revision: modRev,
}
}
return resp, nil
}
func (b *backend) getLatestInternalVal(ctx context.Context, key []byte) (val []byte, modRevision uint64, err error) {
return b.getInternalVal(ctx, key, 0)
}
// get returns the user-visible value and the revision it's modified with.
// NOTICE: return storage.ErrKeyNotFound if the value is not exist or is a tombstone.
// modRevision maybe non-zero even if there is a storage.ErrKeyNotFound.
func (b *backend) get(ctx context.Context, key []byte, revision uint64) (val []byte, modRevision uint64, err error) {
val, modRevision, err = b.getInternalVal(ctx, key, revision)
if bytes.Compare(val, tombStoneBytes) == 0 {
return nil, modRevision, storage.ErrKeyNotFound
}
return val, modRevision, err
}
func (b *backend) getInternalVal(ctx context.Context, key []byte, revision uint64) (val []byte, modRevision uint64, err error) {
if revision == 0 {
revision = math.MaxUint64
}
startKey := b.coder.EncodeObjectKey(key, revision)
endKey := b.coder.EncodeObjectKey(key, 0)
iter, err := b.kv.Iter(ctx, startKey, endKey, 0, 1)
if err != nil {
return nil, 0, err
}
defer iter.Close()
err = iter.Next(ctx)
if err != nil {
if err == io.EOF {
// it's compacted after deleted or it doesn't exist
return nil, 0, storage.ErrKeyNotFound
}
return nil, 0, err
}
userKey, modRev, err := b.coder.Decode(iter.Key())
if modRev == 0 || bytes.Compare(userKey, key) != 0 {
// check if
// 1. the internal key is a revision key
// 2. the user key is mismatched
// these cases are impossible if there is neither issue in the backend storage nor other illegal writing
return nil, 0, storage.ErrKeyNotFound
}
return iter.Val(), modRev, nil
}
// List implements Backend interface
func (b *backend) List(ctx context.Context, r *proto.RangeRequest) (resp *proto.RangeResponse, err error) {
ts := time.Now()
defer func() {
klog.V(klogLevel).InfoS("list",
"start", Key(r.GetKey()),
"end", Key(r.GetEnd()),
"rev", r.GetRevision(),
"limit", r.GetLimit(),
"respCount", len(resp.GetKvs()),
"respSize", resp.Size(),
"latency", time.Since(ts))
}()
if len(r.End) == 0 {
return nil, fmt.Errorf("invalid nil end field in RangeRequest")
}
reqRevision := r.Revision
curRevision := b.tso.GetRevision()
if reqRevision == 0 {
reqRevision = curRevision
}
if bytes.Compare(r.Key, r.End) >= 0 {
return nil, errors.New("invalid range end")
}
key, rangeEnd := b.coder.EncodeObjectKey(r.Key, 0), b.coder.EncodeObjectKey(r.End, 0)
// add limit to check if there is more value
limit := r.Limit
if limit > 0 {
limit++
}
kvs, err := b.scanner.Range(ctx, key, rangeEnd, reqRevision, limit)
if err != nil {
klog.ErrorS(err, "backend range err", "key", string(r.GetKey()), "end", string(r.GetEnd()), "revision", r.GetRevision())
return nil, err
}
resp = &proto.RangeResponse{
Header: responseHeader(curRevision),
}
if limit > 0 && len(kvs) > int(r.Limit) {
resp.More = true
kvs = kvs[0:r.Limit]
}
resp.Kvs = kvs
return resp, nil
}
// Count implements Backend interface
func (b *backend) Count(ctx context.Context, r *proto.CountRequest) (resp *proto.CountResponse, err error) {
ts := time.Now()
defer func() {
klog.V(klogLevel).InfoS("count",
"start", Key(r.GetKey()),
"end", Key(r.GetEnd()),
"respCount", resp.GetCount(),
"latency", time.Since(ts))
}()
rev := b.tso.GetRevision()
if !b.config.EnableEtcdCompatibility {
return &proto.CountResponse{
Header: responseHeader(rev),
Count: uint64(0),
}, nil
}
key, rangeEnd := b.coder.EncodeObjectKey(r.Key, 0), b.coder.EncodeObjectKey(r.End, 0)
count, err := b.scanner.Count(ctx, key, rangeEnd, rev)
if err != nil {
klog.Errorf("backend count %v return err %v", r, err)
return nil, err
}
return &proto.CountResponse{
Header: responseHeader(rev),
Count: uint64(count),
}, nil
}
// GetPartitions implements Backend interface
func (b *backend) GetPartitions(ctx context.Context, r *proto.ListPartitionRequest) (resp *proto.ListPartitionResponse, err error) {
ts := time.Now()
defer func() {
klog.V(klogLevel).InfoS("get partitions",
"start", Key(r.GetKey()),
"end", Key(r.GetEnd()),
"respCount", resp.GetPartitionNum(),
"latency", time.Since(ts))
}()
rev := b.tso.GetRevision()
start, end := b.coder.EncodeObjectKey(r.Key, 0), b.coder.EncodeObjectKey(r.End, 0)
partitions, err := b.kv.GetPartitions(ctx, start, end)
if err != nil {
klog.Errorf("backend getPartitions %v return err %v", r, err)
return nil, err
}
resp = &proto.ListPartitionResponse{
Header: responseHeader(rev),
PartitionNum: int64(len(partitions)),
}
// kvs length = partition number + 1
resp.PartitionKeys = make([][]byte, 0, len(partitions)+1)
for idx, p := range partitions {
// append range start of partition only
resp.PartitionKeys = append(resp.PartitionKeys, p.Start)
// append last end of partition
if idx == len(partitions)-1 {
resp.PartitionKeys = append(resp.PartitionKeys, p.End)
}
}
return resp, nil
}
// ListByStream implements Backend interface
func (b *backend) ListByStream(ctx context.Context, startKey, endKey []byte, rev uint64) (<-chan *proto.StreamRangeResponse, error) {
curRev := b.tso.GetRevision()
if rev == 0 {
rev = curRev
}
klog.V(klogLevel).InfoS("list by stream", "start", Key(startKey), "end", Key(endKey), "rev", rev)
stream := b.scanner.RangeStream(ctx, startKey, endKey, rev)
return stream, nil
}