Repository navigation
Expand file tree
/
Copy pathregion_splitter.go
More file actions
262 lines (240 loc) · 7.01 KB
/
Copy pathregion_splitter.go
File metadata and controls
262 lines (240 loc) · 7.01 KB
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
257
258
259
260
261
262
// Copyright 2020 TiKV Project Authors.
//
// 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 schedule
import (
"bytes"
"context"
"encoding/hex"
"errors"
"math"
"time"
"github.com/pingcap/kvproto/pkg/pdpb"
"github.com/pingcap/log"
"github.com/tikv/pd/pkg/logutil"
"github.com/tikv/pd/pkg/typeutil"
"github.com/tikv/pd/server/core"
"github.com/tikv/pd/server/schedule/operator"
"go.uber.org/zap"
)
const (
watchInterval = 100 * time.Millisecond
timeout = 1 * time.Minute
)
// SplitRegionsHandler used to handle region splitting
type SplitRegionsHandler interface {
SplitRegionByKeys(region *core.RegionInfo, splitKeys [][]byte) error
ScanRegionsByKeyRange(groupKeys *regionGroupKeys, results *splitKeyResults)
}
// NewSplitRegionsHandler return SplitRegionsHandler
func NewSplitRegionsHandler(cluster Cluster, oc *OperatorController) SplitRegionsHandler {
return &splitRegionsHandler{
cluster: cluster,
oc: oc,
}
}
// RegionSplitter handles split regions
type RegionSplitter struct {
cluster Cluster
handler SplitRegionsHandler
}
// NewRegionSplitter return a region splitter
func NewRegionSplitter(cluster Cluster, handler SplitRegionsHandler) *RegionSplitter {
return &RegionSplitter{
cluster: cluster,
handler: handler,
}
}
// SplitRegions support splitRegions by given split keys.
func (r *RegionSplitter) SplitRegions(ctx context.Context, splitKeys [][]byte, retryLimit int) (int, []uint64) {
if len(splitKeys) < 1 {
return 0, nil
}
unprocessedKeys := splitKeys
newRegions := make(map[uint64]struct{}, len(splitKeys))
for i := 0; i <= retryLimit; i++ {
unprocessedKeys = r.splitRegionsByKeys(ctx, unprocessedKeys, newRegions)
if len(unprocessedKeys) < 1 {
break
}
// sleep for a while between each retry
time.Sleep(typeutil.MinDuration(maxSleepDuration, time.Duration(math.Pow(2, float64(i)))*initialSleepDuration))
}
returned := make([]uint64, 0, len(newRegions))
for regionID := range newRegions {
returned = append(returned, regionID)
}
return 100 - len(unprocessedKeys)*100/len(splitKeys), returned
}
func (r *RegionSplitter) splitRegionsByKeys(parCtx context.Context, splitKeys [][]byte, newRegions map[uint64]struct{}) [][]byte {
validGroups := r.groupKeysByRegion(splitKeys)
for key, group := range validGroups {
err := r.handler.SplitRegionByKeys(group.region, group.keys)
if err != nil {
delete(validGroups, key)
continue
}
}
results := newSplitKeyResults()
ticker := time.NewTicker(watchInterval)
ctx, cancel := context.WithTimeout(parCtx, timeout)
defer func() {
ticker.Stop()
cancel()
}()
for {
select {
case <-ticker.C:
for _, groupKeys := range validGroups {
if groupKeys.finished {
continue
}
r.handler.ScanRegionsByKeyRange(groupKeys, results)
}
case <-ctx.Done():
break
}
finished := true
for _, groupKeys := range validGroups {
if !groupKeys.finished {
finished = false
}
}
if finished {
break
}
}
for newID := range results.getSplitRegions() {
newRegions[newID] = struct{}{}
}
return results.getUnProcessedKeys(splitKeys)
}
// groupKeysByRegion separates keys into groups by their belonging Regions.
func (r *RegionSplitter) groupKeysByRegion(keys [][]byte) map[uint64]*regionGroupKeys {
groups := make(map[uint64]*regionGroupKeys, len(keys))
for _, key := range keys {
region := r.cluster.GetRegionByKey(key)
if region == nil {
log.Error("region hollow", logutil.ZapRedactByteString("key", key))
continue
}
// assert region valid
if !r.checkRegionValid(region) {
continue
}
log.Info("found region",
zap.Uint64("region-id", region.GetID()),
logutil.ZapRedactByteString("key", key))
_, ok := groups[region.GetID()]
if !ok {
groups[region.GetID()] = ®ionGroupKeys{
region: region,
keys: [][]byte{
key,
},
}
} else {
groups[region.GetID()].keys = append(groups[region.GetID()].keys, key)
}
}
return groups
}
func (r *RegionSplitter) checkRegionValid(region *core.RegionInfo) bool {
if r.cluster.IsRegionHot(region) {
return false
}
if !IsRegionReplicated(r.cluster, region) {
r.cluster.AddSuspectRegions(region.GetID())
return false
}
if region.GetLeader() == nil {
return false
}
return true
}
type splitRegionsHandler struct {
cluster Cluster
oc *OperatorController
}
func (h *splitRegionsHandler) SplitRegionByKeys(region *core.RegionInfo, splitKeys [][]byte) error {
op, err := operator.CreateSplitRegionOperator("region-splitter", region, 0, pdpb.CheckPolicy_USEKEY, splitKeys)
if err != nil {
return err
}
if ok := h.oc.AddOperator(op); !ok {
log.Warn("add region split operator failed", zap.Uint64("region-id", region.GetID()))
return errors.New("add region split operator failed")
}
return nil
}
func (h *splitRegionsHandler) ScanRegionsByKeyRange(groupKeys *regionGroupKeys, results *splitKeyResults) {
splitKeys := groupKeys.keys
startKey, endKey := groupKeys.region.GetStartKey(), groupKeys.region.GetEndKey()
createdRegions := make(map[uint64][]byte, len(splitKeys))
defer func() {
results.addRegionsID(createdRegions)
}()
regions := h.cluster.ScanRegions(startKey, endKey, -1)
for _, region := range regions {
for _, splitKey := range splitKeys {
if bytes.Equal(splitKey, region.GetStartKey()) {
log.Info("found split region",
zap.Uint64("region-id", region.GetID()),
logutil.ZapRedactString("split-key", hex.EncodeToString(splitKey)))
createdRegions[region.GetID()] = splitKey
}
}
}
if len(createdRegions) >= len(splitKeys) {
groupKeys.finished = true
}
}
type regionGroupKeys struct {
// finished indicates all the split regions have been found in `region` according to the `keys`
finished bool
region *core.RegionInfo
keys [][]byte
}
type splitKeyResults struct {
// newRegionID -> newRegionID's startKey
newRegions map[uint64][]byte
}
func newSplitKeyResults() *splitKeyResults {
s := &splitKeyResults{}
s.newRegions = make(map[uint64][]byte)
return s
}
func (r *splitKeyResults) addRegionsID(regionsID map[uint64][]byte) {
for id, splitKey := range regionsID {
r.newRegions[id] = splitKey
}
}
func (r *splitKeyResults) getSplitRegions() map[uint64][]byte {
return r.newRegions
}
func (r *splitKeyResults) getUnProcessedKeys(splitKeys [][]byte) [][]byte {
var unProcessedKeys [][]byte
for _, splitKey := range splitKeys {
processed := false
for _, regionStartKey := range r.newRegions {
if bytes.Equal(splitKey, regionStartKey) {
processed = true
break
}
}
if !processed {
unProcessedKeys = append(unProcessedKeys, splitKey)
}
}
return unProcessedKeys
}