forked from vitessio/vitess
-
Notifications
You must be signed in to change notification settings - Fork 6
/
lookup_hash.go
368 lines (320 loc) · 11.2 KB
/
lookup_hash.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
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
// Copyright 2014, Google Inc. All rights reserved.
// Use of this source code is governed by a BSD-style
// license that can be found in the LICENSE file.
package vindexes
import (
"fmt"
mproto "github.com/youtube/vitess/go/mysql/proto"
tproto "github.com/youtube/vitess/go/vt/tabletserver/proto"
"github.com/youtube/vitess/go/vt/vtgate/planbuilder"
)
func init() {
planbuilder.Register("lookup_hash", NewLookupHash)
planbuilder.Register("lookup_hash_autoinc", NewLookupHashAuto)
planbuilder.Register("lookup_hash_unique", NewLookupHashUnique)
planbuilder.Register("lookup_hash_unique_autoinc", NewLookupHashUniqueAuto)
}
//====================================================================
// LookupHash defines a vindex that uses a lookup table.
// The table is expected to define the id column as unique. It's
// NonUnique and a Lookup.
type LookupHash struct {
lkp lookup
}
// NewLookupHash creates a LookupHash vindex.
func NewLookupHash(m map[string]interface{}) (planbuilder.Vindex, error) {
lhu := &LookupHash{}
lhu.lkp.Init(m)
return lhu, nil
}
// Cost returns the cost of this vindex as 20.
func (vind *LookupHash) Cost() int {
return 20
}
// Map returns the corresponding KeyspaceId values for the given ids.
func (vind *LookupHash) Map(vcursor planbuilder.VCursor, ids []interface{}) ([][][]byte, error) {
return vind.lkp.Map2(vcursor, ids)
}
// Verify returns true if id maps to ksid.
func (vind *LookupHash) Verify(vcursor planbuilder.VCursor, id interface{}, ksid []byte) (bool, error) {
return vind.lkp.Verify(vcursor, id, ksid)
}
// Create reserves the id by inserting it into the vindex table.
func (vind *LookupHash) Create(vcursor planbuilder.VCursor, id interface{}, ksid []byte) error {
return vind.lkp.Create(vcursor, id, ksid)
}
// Delete deletes the entry from the vindex table.
func (vind *LookupHash) Delete(vcursor planbuilder.VCursor, ids []interface{}, ksid []byte) error {
return vind.lkp.Delete(vcursor, ids, ksid)
}
//====================================================================
// LookupHashAuto defines a vindex that uses a lookup table.
// The table is expected to define the id column as unique. It's
// NonUnique and a Lookup. It's also a LookupGenerator, because it
// can use the autoinc capabilities of the lookup table.
type LookupHashAuto struct {
lkp lookup
}
// NewLookupHashAuto creates a new LookupHashAuto.
func NewLookupHashAuto(m map[string]interface{}) (planbuilder.Vindex, error) {
h := &LookupHashAuto{}
h.lkp.Init(m)
return h, nil
}
// Cost returns the cost of this index as 20.
func (vind *LookupHashAuto) Cost() int {
return 20
}
// Map returns the corresponding KeyspaceId values for the given ids.
func (vind *LookupHashAuto) Map(vcursor planbuilder.VCursor, ids []interface{}) ([][][]byte, error) {
return vind.lkp.Map2(vcursor, ids)
}
// Verify returns true if id maps to ksid.
func (vind *LookupHashAuto) Verify(vcursor planbuilder.VCursor, id interface{}, ksid []byte) (bool, error) {
return vind.lkp.Verify(vcursor, id, ksid)
}
// Create reserves the id by inserting it into the vindex table.
func (vind *LookupHashAuto) Create(vcursor planbuilder.VCursor, id interface{}, ksid []byte) error {
return vind.lkp.Create(vcursor, id, ksid)
}
// Generate reserves the id by inserting it into the vindex table.
func (vind *LookupHashAuto) Generate(vcursor planbuilder.VCursor, ksid []byte) (id int64, err error) {
return vind.lkp.Generate(vcursor, ksid)
}
// Delete deletes the entry from the vindex table.
func (vind *LookupHashAuto) Delete(vcursor planbuilder.VCursor, ids []interface{}, ksid []byte) error {
return vind.lkp.Delete(vcursor, ids, ksid)
}
//====================================================================
// LookupHashUnique defines a vindex that uses a lookup table.
// The table is expected to define the id column as unique. It's
// Unique and a Lookup.
type LookupHashUnique struct {
lkp lookup
}
// NewLookupHashUnique creates a LookupHashUnique vindex.
func NewLookupHashUnique(m map[string]interface{}) (planbuilder.Vindex, error) {
lhu := &LookupHashUnique{}
lhu.lkp.Init(m)
return lhu, nil
}
// Cost returns the cost of this vindex as 10.
func (vind *LookupHashUnique) Cost() int {
return 10
}
// Map returns the corresponding KeyspaceId values for the given ids.
func (vind *LookupHashUnique) Map(vcursor planbuilder.VCursor, ids []interface{}) ([][]byte, error) {
return vind.lkp.Map1(vcursor, ids)
}
// Verify returns true if id maps to ksid.
func (vind *LookupHashUnique) Verify(vcursor planbuilder.VCursor, id interface{}, ksid []byte) (bool, error) {
return vind.lkp.Verify(vcursor, id, ksid)
}
// Create reserves the id by inserting it into the vindex table.
func (vind *LookupHashUnique) Create(vcursor planbuilder.VCursor, id interface{}, ksid []byte) error {
return vind.lkp.Create(vcursor, id, ksid)
}
// Delete deletes the entry from the vindex table.
func (vind *LookupHashUnique) Delete(vcursor planbuilder.VCursor, ids []interface{}, ksid []byte) error {
return vind.lkp.Delete(vcursor, ids, ksid)
}
//====================================================================
// LookupHashUniqueAuto defines a vindex that uses a lookup table.
// The table is expected to define the id column as unique. It's
// Unique and a Lookup. It's also a LookupGenerator, because it
// can use the autoinc capabilities of the lookup table.
type LookupHashUniqueAuto struct {
lkp lookup
}
// NewLookupHashUniqueAuto creates a new LookupHashUniqueAuto.
func NewLookupHashUniqueAuto(m map[string]interface{}) (planbuilder.Vindex, error) {
h := &LookupHashUniqueAuto{}
h.lkp.Init(m)
return h, nil
}
// Cost returns the cost of this index as 10.
func (vind *LookupHashUniqueAuto) Cost() int {
return 10
}
// Map returns the corresponding KeyspaceId values for the given ids.
func (vind *LookupHashUniqueAuto) Map(vcursor planbuilder.VCursor, ids []interface{}) ([][]byte, error) {
return vind.lkp.Map1(vcursor, ids)
}
// Verify returns true if id maps to ksid.
func (vind *LookupHashUniqueAuto) Verify(vcursor planbuilder.VCursor, id interface{}, ksid []byte) (bool, error) {
return vind.lkp.Verify(vcursor, id, ksid)
}
// Create reserves the id by inserting it into the vindex table.
func (vind *LookupHashUniqueAuto) Create(vcursor planbuilder.VCursor, id interface{}, ksid []byte) error {
return vind.lkp.Create(vcursor, id, ksid)
}
// Generate reserves the id by inserting it into the vindex table.
func (vind *LookupHashUniqueAuto) Generate(vcursor planbuilder.VCursor, ksid []byte) (id int64, err error) {
return vind.lkp.Generate(vcursor, ksid)
}
// Delete deletes the entry from the vindex table.
func (vind *LookupHashUniqueAuto) Delete(vcursor planbuilder.VCursor, ids []interface{}, ksid []byte) error {
return vind.lkp.Delete(vcursor, ids, ksid)
}
//====================================================================
// lookup implements the functions for the Lookup vindexes.
type lookup struct {
Table, From, To string
sel, ver, ins, del string
}
func (lkp *lookup) Init(m map[string]interface{}) {
get := func(name string) string {
v, _ := m[name].(string)
return v
}
t := get("Table")
from := get("From")
to := get("To")
lkp.Table = t
lkp.From = from
lkp.To = to
lkp.sel = fmt.Sprintf("select %s from %s where %s = :%s", to, t, from, from)
lkp.ver = fmt.Sprintf("select %s from %s where %s = :%s and %s = :%s", from, t, from, from, to, to)
lkp.ins = fmt.Sprintf("insert into %s(%s, %s) values(:%s, :%s)", t, from, to, from, to)
lkp.del = fmt.Sprintf("delete from %s where %s in ::%s and %s = :%s", t, from, from, to, to)
}
// Map1 is for a unique vindex.
func (lkp *lookup) Map1(vcursor planbuilder.VCursor, ids []interface{}) ([][]byte, error) {
out := make([][]byte, 0, len(ids))
bq := &tproto.BoundQuery{
Sql: lkp.sel,
}
for _, id := range ids {
bq.BindVariables = map[string]interface{}{
lkp.From: id,
}
result, err := vcursor.Execute(bq)
if err != nil {
return nil, fmt.Errorf("lookup.Map: %v", err)
}
if len(result.Rows) == 0 {
out = append(out, []byte{})
continue
}
if len(result.Rows) != 1 {
return nil, fmt.Errorf("lookup.Map: unexpected multiple results from vindex %s: %v", lkp.Table, id)
}
inum, err := mproto.Convert(result.Fields[0], result.Rows[0][0])
if err != nil {
return nil, fmt.Errorf("lookup.Map: %v", err)
}
num, err := getNumber(inum)
if err != nil {
return nil, fmt.Errorf("lookup.Map: %v", err)
}
out = append(out, vhash(num))
}
return out, nil
}
// Map2 is for a non-unique vindex.
func (lkp *lookup) Map2(vcursor planbuilder.VCursor, ids []interface{}) ([][][]byte, error) {
out := make([][][]byte, 0, len(ids))
bq := &tproto.BoundQuery{
Sql: lkp.sel,
}
for _, id := range ids {
bq.BindVariables = map[string]interface{}{
lkp.From: id,
}
result, err := vcursor.Execute(bq)
if err != nil {
return nil, fmt.Errorf("lookup.Map: %v", err)
}
var ksids [][]byte
for _, row := range result.Rows {
inum, err := mproto.Convert(result.Fields[0], row[0])
if err != nil {
return nil, fmt.Errorf("lookup.Map: %v", err)
}
num, err := getNumber(inum)
if err != nil {
return nil, fmt.Errorf("lookup.Map: %v", err)
}
ksids = append(ksids, vhash(num))
}
out = append(out, ksids)
}
return out, nil
}
// Verify returns true if id maps to ksid.
func (lkp *lookup) Verify(vcursor planbuilder.VCursor, id interface{}, ksid []byte) (bool, error) {
val, err := vunhash(ksid)
if err != nil {
return false, fmt.Errorf("lookup.Verify: %v", err)
}
bq := &tproto.BoundQuery{
Sql: lkp.ver,
BindVariables: map[string]interface{}{
lkp.From: id,
lkp.To: val,
},
}
result, err := vcursor.Execute(bq)
if err != nil {
return false, fmt.Errorf("lookup.Verify: %v", err)
}
if len(result.Rows) == 0 {
return false, nil
}
return true, nil
}
// Create creates an association between id and ksid by inserting a row in the vindex table.
func (lkp *lookup) Create(vcursor planbuilder.VCursor, id interface{}, ksid []byte) error {
val, err := vunhash(ksid)
if err != nil {
return fmt.Errorf("lookup.Create: %v", err)
}
bq := &tproto.BoundQuery{
Sql: lkp.ins,
BindVariables: map[string]interface{}{
lkp.From: id,
lkp.To: val,
},
}
if _, err := vcursor.Execute(bq); err != nil {
return fmt.Errorf("lookup.Create: %v", err)
}
return nil
}
// Generate generates an id and associates the ksid to the new id.
func (lkp *lookup) Generate(vcursor planbuilder.VCursor, ksid []byte) (id int64, err error) {
val, err := vunhash(ksid)
if err != nil {
return 0, fmt.Errorf("lookup.Generate: %v", err)
}
bq := &tproto.BoundQuery{
Sql: lkp.ins,
BindVariables: map[string]interface{}{
lkp.From: nil,
lkp.To: val,
},
}
result, err := vcursor.Execute(bq)
if err != nil {
return 0, fmt.Errorf("lookup.Generate: %v", err)
}
return int64(result.InsertId), err
}
// Delete deletes the association between ids and ksid.
func (lkp *lookup) Delete(vcursor planbuilder.VCursor, ids []interface{}, ksid []byte) error {
val, err := vunhash(ksid)
if err != nil {
return fmt.Errorf("lookup.Delete: %v", err)
}
bq := &tproto.BoundQuery{
Sql: lkp.del,
BindVariables: map[string]interface{}{
lkp.From: ids,
lkp.To: val,
},
}
if _, err := vcursor.Execute(bq); err != nil {
return fmt.Errorf("lookup.Delete: %v", err)
}
return nil
}