forked from pingcap/br
-
Notifications
You must be signed in to change notification settings - Fork 0
/
range.go
136 lines (121 loc) · 3.63 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
// Copyright 2020 PingCAP, Inc. Licensed under Apache-2.0.
package restore
import (
"bytes"
"sort"
"sync"
"github.com/pingcap/errors"
"github.com/pingcap/kvproto/pkg/import_sstpb"
"github.com/pingcap/kvproto/pkg/metapb"
"github.com/pingcap/log"
"github.com/pingcap/tidb/tablecodec"
"go.uber.org/zap"
berrors "github.com/pingcap/br/pkg/errors"
"github.com/pingcap/br/pkg/logutil"
"github.com/pingcap/br/pkg/rtree"
)
// Range record start and end key for localStoreDir.DB
// so we can write it to tikv in streaming
type Range struct {
Start []byte
End []byte
}
type syncdRanges struct {
sync.Mutex
ranges []Range
}
func (r *syncdRanges) add(g Range) {
r.Lock()
r.ranges = append(r.ranges, g)
r.Unlock()
}
func (r *syncdRanges) take() []Range {
r.Lock()
rg := r.ranges
r.ranges = []Range{}
r.Unlock()
if len(rg) > 0 {
sort.Slice(rg, func(i, j int) bool {
return bytes.Compare(rg[i].Start, rg[j].Start) < 0
})
}
return rg
}
func newSyncdRanges() *syncdRanges {
return &syncdRanges{
ranges: make([]Range, 0, 128),
}
}
// SortRanges checks if the range overlapped and sort them.
func SortRanges(ranges []rtree.Range, rewriteRules *RewriteRules) ([]rtree.Range, error) {
rangeTree := rtree.NewRangeTree()
for _, rg := range ranges {
if rewriteRules != nil {
startID := tablecodec.DecodeTableID(rg.StartKey)
endID := tablecodec.DecodeTableID(rg.EndKey)
var rule *import_sstpb.RewriteRule
if startID == endID {
rg.StartKey, rule = replacePrefix(rg.StartKey, rewriteRules)
if rule == nil {
log.Warn("cannot find rewrite rule", logutil.Key("key", rg.StartKey))
} else {
log.Debug(
"rewrite start key",
logutil.Key("key", rg.StartKey), logutil.RewriteRule(rule))
}
rg.EndKey, rule = replacePrefix(rg.EndKey, rewriteRules)
if rule == nil {
log.Warn("cannot find rewrite rule", logutil.Key("key", rg.EndKey))
} else {
log.Debug(
"rewrite end key",
logutil.Key("key", rg.EndKey),
logutil.RewriteRule(rule))
}
} else {
log.Warn("table id does not match",
logutil.Key("startKey", rg.StartKey),
logutil.Key("endKey", rg.EndKey),
zap.Int64("startID", startID),
zap.Int64("endID", endID))
return nil, errors.Annotate(berrors.ErrRestoreTableIDMismatch, "table id mismatch")
}
}
if out := rangeTree.InsertRange(rg); out != nil {
log.Error("insert ranges overlapped",
logutil.Key("startKeyOut", out.StartKey),
logutil.Key("endKeyOut", out.EndKey),
logutil.Key("startKeyIn", rg.StartKey),
logutil.Key("endKeyIn", rg.EndKey))
return nil, errors.Annotatef(berrors.ErrRestoreInvalidRange, "ranges overlapped")
}
}
sortedRanges := rangeTree.GetSortedRanges()
return sortedRanges, nil
}
// RegionInfo includes a region and the leader of the region.
type RegionInfo struct {
Region *metapb.Region
Leader *metapb.Peer
}
// ContainsInterior returns whether the region contains the given key, and also
// that the key does not fall on the boundary (start key) of the region.
func (region *RegionInfo) ContainsInterior(key []byte) bool {
return bytes.Compare(key, region.Region.GetStartKey()) > 0 &&
(len(region.Region.GetEndKey()) == 0 ||
bytes.Compare(key, region.Region.GetEndKey()) < 0)
}
// RewriteRules contains rules for rewriting keys of tables.
type RewriteRules struct {
Data []*import_sstpb.RewriteRule
}
// Append append its argument to this rewrite rules.
func (r *RewriteRules) Append(other RewriteRules) {
r.Data = append(r.Data, other.Data...)
}
// EmptyRewriteRule make a new, empty rewrite rule.
func EmptyRewriteRule() *RewriteRules {
return &RewriteRules{
Data: []*import_sstpb.RewriteRule{},
}
}