forked from dgraph-io/dgraph
/
predicate_move.go
279 lines (257 loc) · 7.17 KB
/
predicate_move.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
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
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
/*
* Copyright (C) 2017 Dgraph Labs, Inc. and Contributors
*
* This program is free software: you can redistribute it and/or modify
* it under the terms of the GNU Affero General Public License as published by
* the Free Software Foundation, either version 3 of the License, or
* (at your option) any later version.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU Affero General Public License for more details.
*
* You should have received a copy of the GNU Affero General Public License
* along with this program. If not, see <http://www.gnu.org/licenses/>.
*/
package worker
import (
"bytes"
"fmt"
"io"
"math"
"strconv"
"sync"
"sync/atomic"
"golang.org/x/net/context"
"github.com/dgraph-io/badger"
"github.com/dgraph-io/dgraph/posting"
"github.com/dgraph-io/dgraph/protos/api"
"github.com/dgraph-io/dgraph/protos/intern"
"github.com/dgraph-io/dgraph/schema"
"github.com/dgraph-io/dgraph/x"
"github.com/dgraph-io/dgraph/y"
)
var (
errEmptyPredicate = x.Errorf("Predicate not specified")
errNotLeader = x.Errorf("Server is not leader of this group")
emptyPayload = api.Payload{}
)
// size of kvs won't be too big, we would take care before proposing.
func populateKeyValues(ctx context.Context, kvs []*intern.KV) error {
// No new deletion/background cleanup would start after we start streaming tablet,
// so all the proposals for a particular tablet would atmost wait for deletion of
// single tablet.
groups().waitForBackgroundDeletion()
x.Printf("Writing %d keys\n", len(kvs))
var hasError uint32
var wg sync.WaitGroup
wg.Add(len(kvs))
for _, kv := range kvs {
txn := pstore.NewTransactionAt(math.MaxUint64, true)
txn.SetWithMeta(kv.Key, kv.Val, kv.UserMeta[0])
txn.CommitAt(kv.Version, func(err error) {
if err != nil {
atomic.StoreUint32(&hasError, 1)
}
wg.Done()
})
txn.Discard()
}
if hasError > 0 {
return x.Errorf("Error while writing to badger")
}
return nil
}
func movePredicateHelper(ctx context.Context, predicate string, gid uint32) error {
pl := groups().Leader(gid)
if pl == nil {
return x.Errorf("Unable to find a connection for groupd: %d\n", gid)
}
c := intern.NewWorkerClient(pl.Get())
stream, err := c.ReceivePredicate(ctx)
if err != nil {
return err
}
count := 0
sendPl := func(stream intern.Worker_ReceivePredicateClient, l *posting.List) error {
kv, err := l.MarshalToKv()
if err != nil {
return err
}
return stream.Send(kv)
}
// sends all data except schema, schema key has different prefix
txn := pstore.NewTransactionAt(math.MaxUint64, false)
defer txn.Discard()
iterOpts := badger.DefaultIteratorOptions
iterOpts.AllVersions = true
it := txn.NewIterator(iterOpts)
defer it.Close()
prefix := x.PredicatePrefix(predicate)
var prevKey []byte
for it.Seek(prefix); it.ValidForPrefix(prefix); it.Next() {
item := it.Item()
key := item.Key()
if bytes.Equal(key, prevKey) {
it.Next()
continue
}
if cap(prevKey) < len(key) {
prevKey = make([]byte, len(key))
}
copy(prevKey, key)
l, err := posting.ReadPostingList(key, it)
if err != nil {
return err
}
count++
if err := sendPl(stream, l); err != nil {
return err
}
}
// send schema
schemaKey := x.SchemaKey(predicate)
item, err := txn.Get(schemaKey)
if err != nil && err != badger.ErrKeyNotFound {
return err
}
val, err := item.Value()
if err != nil {
return err
}
kv := &intern.KV{}
kv.Key = schemaKey
kv.Val = val
kv.Version = 1
kv.UserMeta = []byte{item.UserMeta()}
if err := stream.Send(kv); err != nil {
return err
}
count++
x.Printf("Sent %d number of keys for predicate %v\n", count, predicate)
payload, err := stream.CloseAndRecv()
if err != nil {
return err
}
recvCount, err := strconv.Atoi(string(payload.Data))
if err != nil {
return err
}
if recvCount != count {
return x.Errorf("Sent count %d doesn't match with received %d", count, recvCount)
}
return nil
}
func batchAndProposeKeyValues(ctx context.Context, kvs chan *intern.KV) error {
n := groups().Node
proposal := &intern.Proposal{}
size := 0
firstKV := true
var predicate string
for kv := range kvs {
if size >= 32<<20 { // 32 MB
if err := n.ProposeAndWait(ctx, proposal); err != nil {
return err
}
proposal.Kv = proposal.Kv[:0]
size = 0
continue
}
if firstKV {
firstKV = false
pk := x.Parse(kv.Key)
predicate = pk.Attr
// Delete on all nodes.
p := &intern.Proposal{CleanPredicate: pk.Attr}
err := groups().Node.ProposeAndWait(ctx, p)
if err != nil {
x.Printf("Error while cleaning predicate %v %v\n", pk.Attr, err)
}
}
proposal.Kv = append(proposal.Kv, kv)
size = size + len(kv.Key) + len(kv.Val)
}
// Propose remaining keys.
if err := n.ProposeAndWait(ctx, proposal); err != nil {
return err
}
return schema.Load(predicate)
}
// Returns count which can be used to verify whether we have moved all keys
// for a predicate or not.
func (w *grpcWorker) ReceivePredicate(stream intern.Worker_ReceivePredicateServer) error {
// Values can be pretty big so having less buffer is safer.
kvs := make(chan *intern.KV, 10)
che := make(chan error, 1)
// We can use count to check the number of posting lists returned in tests.
count := 0
ctx := stream.Context()
payload := &api.Payload{}
go func() {
// Takes care of throttling and batching.
che <- batchAndProposeKeyValues(ctx, kvs)
}()
for {
kv, err := stream.Recv()
if err == io.EOF {
payload.Data = []byte(fmt.Sprintf("%d", count))
stream.SendAndClose(payload)
break
}
if err != nil {
x.Printf("received %d number of keys, err %v\n", count, err)
return err
}
count++
select {
case kvs <- kv:
case <-ctx.Done():
close(kvs)
<-che
x.Printf("received %d number of keys, context deadline\n", count)
return ctx.Err()
case err := <-che:
x.Printf("received %d number of keys, error %v\n", count, err)
return err
}
}
close(kvs)
err := <-che
x.Printf("received %d number of keys, error %v\n", count, err)
return err
}
func (w *grpcWorker) MovePredicate(ctx context.Context,
in *intern.MovePredicatePayload) (*api.Payload, error) {
if groups().gid != in.SourceGroupId {
return &emptyPayload,
x.Errorf("Group id doesn't match, received request for %d, my gid: %d",
in.SourceGroupId, groups().gid)
}
if len(in.Predicate) == 0 {
return &emptyPayload, errEmptyPredicate
}
if !groups().ServesTablet(in.Predicate) {
return &emptyPayload, errUnservedTablet
}
n := groups().Node
if !n.AmLeader() {
return &emptyPayload, errNotLeader
}
// Ensures that all future mtuations beyond this point are rejected
if err := n.ProposeAndWait(ctx, &intern.Proposal{State: in.State}); err != nil {
return &emptyPayload, err
}
tctxs := posting.Txns().Iterate(func(key []byte) bool {
pk := x.Parse(key)
return pk.Attr == in.Predicate
})
if len(tctxs) > 0 {
go tryAbortTransactions(tctxs)
return &emptyPayload, y.ErrConflict
}
// We iterate over badger, so need to flush and wait for sync watermark to catch up.
n.applyAllMarks(ctx)
err := movePredicateHelper(ctx, in.Predicate, in.DestGroupId)
return &emptyPayload, err
}