-
Notifications
You must be signed in to change notification settings - Fork 455
/
sharded.go
220 lines (186 loc) · 6.28 KB
/
sharded.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
// Copyright (c) 2016 Uber Technologies, Inc.
//
// Permission is hereby granted, free of charge, to any person obtaining a copy
// of this software and associated documentation files (the "Software"), to deal
// in the Software without restriction, including without limitation the rights
// to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
// copies of the Software, and to permit persons to whom the Software is
// furnished to do so, subject to the following conditions:
//
// The above copyright notice and this permission notice shall be included in
// all copies or substantial portions of the Software.
//
// THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
// IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
// FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
// AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
// LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
// OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
// THE SOFTWARE.
package algo
import (
"errors"
"fmt"
"github.com/m3db/m3/src/cluster/placement"
)
var (
errNotEnoughIsolationGroups = errors.New("not enough isolation groups to take shards, please make sure RF is less than number of isolation groups")
errIncompatibleWithShardedAlgo = errors.New("could not apply sharded algo on the placement")
)
type shardedPlacementAlgorithm struct {
opts placement.Options
}
func newShardedAlgorithm(opts placement.Options) placement.Algorithm {
return shardedPlacementAlgorithm{opts: opts}
}
func (a shardedPlacementAlgorithm) IsCompatibleWith(p placement.Placement) error {
if !p.IsSharded() {
return errIncompatibleWithShardedAlgo
}
return nil
}
func (a shardedPlacementAlgorithm) InitialPlacement(
instances []placement.Instance,
shards []uint32,
rf int,
) (placement.Placement, error) {
ph := newInitHelper(placement.Instances(instances).Clone(), shards, a.opts)
if err := ph.placeShards(newShards(shards), nil, ph.Instances()); err != nil {
return nil, err
}
var (
p = ph.generatePlacement()
err error
)
for i := 1; i < rf; i++ {
p, err = a.AddReplica(p)
if err != nil {
return nil, err
}
}
return tryCleanupShardState(p, a.opts)
}
func (a shardedPlacementAlgorithm) AddReplica(p placement.Placement) (placement.Placement, error) {
if err := a.IsCompatibleWith(p); err != nil {
return nil, err
}
p = p.Clone()
ph := newAddReplicaHelper(p, a.opts)
if err := ph.placeShards(newShards(p.Shards()), nil, nonLeavingInstances(ph.Instances())); err != nil {
return nil, err
}
if err := ph.optimize(safe); err != nil {
return nil, err
}
return tryCleanupShardState(ph.generatePlacement(), a.opts)
}
func (a shardedPlacementAlgorithm) RemoveInstances(
p placement.Placement,
instanceIDs []string,
) (placement.Placement, error) {
if err := a.IsCompatibleWith(p); err != nil {
return nil, err
}
p = p.Clone()
for _, instanceID := range instanceIDs {
ph, leavingInstance, err := newRemoveInstanceHelper(p, instanceID, a.opts)
if err != nil {
return nil, err
}
// place the shards from the leaving instance to the rest of the cluster
if err := ph.placeShards(leavingInstance.Shards().All(), leavingInstance, ph.Instances()); err != nil {
return nil, err
}
if err := ph.optimize(safe); err != nil {
return nil, err
}
if p, _, err = addInstanceToPlacement(ph.generatePlacement(), leavingInstance, withShards); err != nil {
return nil, err
}
}
return tryCleanupShardState(p, a.opts)
}
func (a shardedPlacementAlgorithm) AddInstances(
p placement.Placement,
instances []placement.Instance,
) (placement.Placement, error) {
if err := a.IsCompatibleWith(p); err != nil {
return nil, err
}
p = p.Clone()
for _, instance := range instances {
ph, addingInstance, err := newAddInstanceHelper(p, instance, a.opts, withLeavingShardsOnly)
if err != nil {
return nil, err
}
if err := ph.addInstance(addingInstance); err != nil {
return nil, err
}
p = ph.generatePlacement()
}
return tryCleanupShardState(p, a.opts)
}
func (a shardedPlacementAlgorithm) ReplaceInstances(
p placement.Placement,
leavingInstanceIDs []string,
addingInstances []placement.Instance,
) (placement.Placement, error) {
if err := a.IsCompatibleWith(p); err != nil {
return nil, err
}
p = p.Clone()
ph, leavingInstances, addingInstances, err := newReplaceInstanceHelper(p, leavingInstanceIDs, addingInstances, a.opts)
if err != nil {
return nil, err
}
for _, leavingInstance := range leavingInstances {
err = ph.placeShards(leavingInstance.Shards().All(), leavingInstance, addingInstances)
if err != nil && err != errNotEnoughIsolationGroups {
// errNotEnoughIsolationGroups means the adding instances do not
// have enough isolation groups to take all the shards, but the rest
// instances might have more isolation groups to take all the shards.
return nil, err
}
load := loadOnInstance(leavingInstance)
if load != 0 && !a.opts.AllowPartialReplace() {
return nil, fmt.Errorf("could not fully replace all shards from %s, %d shards left unassigned",
leavingInstance.ID(), load)
}
}
if a.opts.AllowPartialReplace() {
// Place the shards left on the leaving instance to the rest of the cluster.
for _, leavingInstance := range leavingInstances {
if err = ph.placeShards(leavingInstance.Shards().All(), leavingInstance, ph.Instances()); err != nil {
return nil, err
}
}
if err := ph.optimize(unsafe); err != nil {
return nil, err
}
}
p = ph.generatePlacement()
for _, leavingInstance := range leavingInstances {
if p, _, err = addInstanceToPlacement(p, leavingInstance, withShards); err != nil {
return nil, err
}
}
return tryCleanupShardState(p, a.opts)
}
func (a shardedPlacementAlgorithm) MarkShardsAvailable(
p placement.Placement,
instanceID string,
shardIDs ...uint32,
) (placement.Placement, error) {
if err := a.IsCompatibleWith(p); err != nil {
return nil, err
}
return markShardsAvailable(p.Clone(), instanceID, shardIDs, a.opts)
}
func (a shardedPlacementAlgorithm) MarkAllShardsAvailable(
p placement.Placement,
) (placement.Placement, bool, error) {
if err := a.IsCompatibleWith(p); err != nil {
return nil, false, err
}
return markAllShardsAvailable(p, a.opts)
}