-
Notifications
You must be signed in to change notification settings - Fork 0
/
writes.go
126 lines (105 loc) · 3.27 KB
/
writes.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
// Copyright 2023 Linka Cloud All rights reserved.
//
// 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 pending
import (
"github.com/dgraph-io/badger/v3"
)
type IterableMergedWrites interface {
Writes
MergedIterator(tx *badger.Txn, readTs uint64, opt badger.IteratorOptions) Iterator
}
type Writes interface {
Iterator(prefix []byte, readTs uint64, reversed bool) Iterator
Set(e *badger.Entry)
Delete(key []byte)
Replay(fn func(e *badger.Entry) error) error
Close() error
}
func NewWithDB(db *badger.DB, addReadKey func(key []byte)) IterableMergedWrites {
return newWrites(db.Opts().Dir, db.MaxBatchCount(), db.MaxBatchSize(), int(db.Opts().ValueThreshold), addReadKey)
}
func New(path string, maxCount, maxSize int64, threshold int, addReadKey func(key []byte)) IterableMergedWrites {
return newWrites(path, maxCount, maxSize, threshold, addReadKey)
}
func newWrites(path string, maxCount, maxSize int64, threshold int, addReadKey func(key []byte)) *writes {
w := newMem(addReadKey)
return &writes{
path: path,
m: w,
c: w,
maxCount: maxCount,
maxSize: maxSize,
valueThreshold: threshold,
addReadKey: addReadKey,
}
}
type writes struct {
path string
m *mem
w *wal
c Writes
count int64
size int64
maxCount int64
maxSize int64
valueThreshold int
addReadKey func(key []byte)
}
func (w *writes) MergedIterator(tx *badger.Txn, readTs uint64, opt badger.IteratorOptions) Iterator {
return newMergeIterator(&txIterator{tx.NewIterator(opt), w.addReadKey}, w.iterator(opt.Prefix, readTs, opt.Reverse), opt.Reverse)
}
func (w *writes) Iterator(prefix []byte, readTs uint64, reversed bool) Iterator {
return w.c.Iterator(prefix, readTs, reversed)
}
func (w *writes) iterator(prefix []byte, readTs uint64, reversed bool) iterator {
return w.c.Iterator(prefix, readTs, reversed).(iterator)
}
func (w *writes) Set(e *badger.Entry) {
if w.w == nil && !w.checkSize(e) {
w.w = newWal(w.path, w.m, w.maxSize)
w.c = w.w
}
w.c.Set(e)
}
func (w *writes) Delete(key []byte) {
e := &badger.Entry{
Key: key,
}
if w.w == nil && !w.checkSize(e) {
w.w = newWal(w.path, w.m, w.maxSize)
w.c = w.w
}
w.c.Delete(key)
}
func (w *writes) Replay(fn func(e *badger.Entry) error) error {
return w.c.Replay(fn)
}
func (w *writes) Close() error {
return w.c.Close()
}
func (w *writes) checkSize(e *badger.Entry) bool {
count := w.count + 1
size := w.size + int64(estimateSize(e, w.valueThreshold))
if count >= w.maxCount || size >= w.maxSize {
return false
}
w.count, w.size = count, size
return true
}
func estimateSize(e *badger.Entry, threshold int) int {
if len(e.Value) < threshold {
return len(e.Key) + len(e.Value) + 2 // Meta, UserMeta
}
return len(e.Key) + 12 + 2 // 12 for ValuePointer, 2 for metas.
}