-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathrecover.go
232 lines (217 loc) · 5.35 KB
/
recover.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
package trans
import (
"bufio"
"fmt"
"io"
"math/rand"
"os"
"strings"
)
type RecoverClient struct {
chunkClients []*ClientWithInfo
activeClients []*ClientWithInfo
recoverClients []*ClientWithInfo
dataShards int
parShards int
}
type ClientWithInfo struct {
Client Client
Index int
Recover bool
}
func NewRecoverClient(chunkClients []*ClientWithInfo, dataShards, parShards int) (*RecoverClient, error) {
if dataShards < 3 {
return nil, fmt.Errorf("data shards should not be less than 3")
}
if parShards < 1 {
return nil, fmt.Errorf("parity shards should not be less than 1")
}
if len(chunkClients) != dataShards+parShards {
return nil, fmt.Errorf("number of chunk servers should be equal with sum of data shards and parity shards")
}
rc := &RecoverClient{
chunkClients: chunkClients,
activeClients: make([]*ClientWithInfo, 0),
recoverClients: make([]*ClientWithInfo, 0),
dataShards: dataShards,
parShards: parShards,
}
for _, item := range chunkClients {
if item.Recover {
rc.recoverClients = append(rc.recoverClients, item)
} else {
rc.activeClients = append(rc.activeClients, item)
}
}
if len(rc.activeClients) < dataShards {
return nil, fmt.Errorf("exppect at least %d active clients, but only got %d ", dataShards, len(rc.activeClients))
}
return rc, nil
}
func (ec *RecoverClient) Recover(startKey string) (err error) {
idx := rand.Intn(len(ec.activeClients))
keyChan, err := ec.activeClients[idx].Client.AllKeysChan(startKey)
if err != nil {
return fmt.Errorf("RecoverClient failed to call AllKeysChan, idx: %d, err: %s", idx, err)
}
for key := range keyChan {
ec.RecoverKey(key)
}
return
}
func (ec *RecoverClient) Close() {
for _, client := range ec.chunkClients {
client.Client.Close()
}
}
func (ec *RecoverClient) ExportAllKeys(startKey, pathToAllKeys string) error {
f, err := os.OpenFile(pathToAllKeys, os.O_CREATE|os.O_RDWR, 0644)
if err != nil {
return err
}
defer f.Close()
idx := rand.Intn(len(ec.activeClients))
keyChan, err := ec.activeClients[idx].Client.AllKeysChan(startKey)
if err != nil {
return fmt.Errorf("RecoverClient failed to call AllKeysChan, idx: %d, err: %s", idx, err)
}
for key := range keyChan {
if _, err = f.WriteString(fmt.Sprintf("%s\n", key)); err != nil {
return err
}
}
return nil
}
func (ec *RecoverClient) RecoverFromFile(startKey, pathToAllKeys string) (err error) {
foundStartKey := false
f, err := os.Open(pathToAllKeys)
if err != nil {
return err
}
defer f.Close()
liner := bufio.NewReader(f)
for {
line, err := liner.ReadString('\n')
if err != nil {
if err == io.EOF {
fmt.Println("end with input file")
} else {
logger.Error(err)
}
break
}
key := strings.TrimSpace(line)
if startKey != "" && !foundStartKey {
if startKey != key {
continue
}
foundStartKey = true
}
ec.RecoverKey(key)
}
return
}
func (ec *RecoverClient) RecoverKey(key string) (err error) {
// first to make sure that the key doesn't exist in at least one of the recover clients
var needRecover bool
for _, recoverClient := range ec.recoverClients {
if has, _ := recoverClient.Client.Has(key); !has {
needRecover = true
break
}
}
if !needRecover { // recover clients already has the key, just go to net key to recover
return nil
}
ch := make(chan ecres)
shardsNum := ec.dataShards + ec.parShards
for _, client := range ec.activeClients {
go func(idx int, client Client, ch chan ecres) {
res := ecres{
i: idx,
}
v, err := client.Get(key)
if err != nil {
res.e = err
} else {
res.v = v
}
ch <- res
}(client.Index, client.Client, ch)
}
shards := make([][]byte, shardsNum)
actNum := len(ec.activeClients)
for i := 0; i < actNum; i++ {
res := <-ch
if res.e != nil {
logger.Warnf("fetch index: %d shard failed: %s", res.i, res.e)
} else {
shards[res.i] = res.v
}
}
recShards, err := ErasueRecover(shards, ec.dataShards, ec.parShards)
if err != nil {
return err
}
ch2 := make(chan string)
for _, recoverClient := range ec.recoverClients {
go func(recoverClient *ClientWithInfo, ch2 chan string) {
if has, _ := recoverClient.Client.Has(key); !has {
if err := recoverClient.Client.Put(key, recShards[recoverClient.Index]); err != nil {
logger.Error(err)
ch2 <- "failed"
} else {
ch2 <- "done"
}
} else {
ch2 <- "skip"
}
}(recoverClient, ch2)
}
for range ec.recoverClients {
logger.Info(<-ch2)
}
return
}
func (ec *RecoverClient) RecoverCheck(pathToAllKeys, pathToUnrecoverKeys string) (err error) {
totalNum := 0
needRecoverNum := 0
o, err := os.OpenFile(pathToUnrecoverKeys, os.O_CREATE|os.O_RDWR, 0644)
if err != nil {
return
}
defer o.Close()
f, err := os.Open(pathToAllKeys)
if err != nil {
return err
}
defer f.Close()
liner := bufio.NewReader(f)
for {
line, err := liner.ReadString('\n')
if err != nil {
if err == io.EOF {
fmt.Println("end with input file")
} else {
logger.Error(err)
}
break
}
key := strings.TrimSpace(line)
totalNum++
var needRecover bool
for _, recoverClient := range ec.recoverClients {
if has, _ := recoverClient.Client.Has(key); !has {
needRecover = true
break
}
}
if needRecover {
o.WriteString(fmt.Sprintf("%s\n", key))
needRecoverNum++
}
}
logger.Infof("total: %d", totalNum)
logger.Infof("need recover: %d", needRecoverNum)
return
}