forked from vitessio/vitess
/
tablet.go
688 lines (585 loc) · 19.8 KB
/
tablet.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
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
// Copyright 2013, 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 topo
import (
"fmt"
"reflect"
"sort"
"strconv"
"strings"
"sync"
"code.google.com/p/go.net/context"
log "github.com/golang/glog"
"github.com/henryanand/vitess/go/jscfg"
"github.com/henryanand/vitess/go/trace"
"github.com/henryanand/vitess/go/vt/key"
)
const (
// According to docs, the tablet uid / (mysql server id) is uint32.
// However, zero appears to be a sufficiently degenerate value to use
// as a marker for not having a parent server id.
// http://dev.mysql.com/doc/refman/5.1/en/replication-options.html
NO_TABLET = 0
// Default name for databases is the prefix plus keyspace
vtDbPrefix = "vt_"
)
// TabletAlias is the minimum required information to locate a tablet.
//
// Tablets are really globally unique, but crawling every cell to find
// out where it lives is time consuming and expensive. This is only
// needed during complex operations. Tablet cell assignments don't
// change that often, thus using a TabletAlias is efficient.
type TabletAlias struct {
Cell string
Uid uint32
}
// IsZero returns true iff cell and uid are empty
func (ta TabletAlias) IsZero() bool {
return ta.Cell == "" && ta.Uid == 0
}
// String formats a TabletAlias
func (ta TabletAlias) String() string {
return fmtAlias(ta.Cell, ta.Uid)
}
// TabletUidStr returns a string version of the uid
func (ta TabletAlias) TabletUidStr() string {
return tabletUidStr(ta.Uid)
}
// ParseTabletAliasString returns a TabletAlias for the input string,
// of the form <cell>-<uid>
func ParseTabletAliasString(aliasStr string) (result TabletAlias, err error) {
nameParts := strings.Split(aliasStr, "-")
if len(nameParts) != 2 {
err = fmt.Errorf("invalid tablet alias: %v", aliasStr)
return
}
result.Cell = nameParts[0]
result.Uid, err = ParseUid(nameParts[1])
if err != nil {
err = fmt.Errorf("invalid tablet uid %v: %v", aliasStr, err)
return
}
return
}
func tabletUidStr(uid uint32) string {
return fmt.Sprintf("%010d", uid)
}
// ParseUid parses just the uid (a number)
func ParseUid(value string) (uint32, error) {
uid, err := strconv.ParseUint(value, 10, 32)
if err != nil {
return 0, fmt.Errorf("bad tablet uid %v", err)
}
return uint32(uid), nil
}
func fmtAlias(cell string, uid uint32) string {
return fmt.Sprintf("%v-%v", cell, tabletUidStr(uid))
}
// TabletAliasList is used mainly for sorting
type TabletAliasList []TabletAlias
// Len is part of sort.Interface
func (tal TabletAliasList) Len() int {
return len(tal)
}
// Less is part of sort.Interface
func (tal TabletAliasList) Less(i, j int) bool {
if tal[i].Cell < tal[j].Cell {
return true
} else if tal[i].Cell > tal[j].Cell {
return false
}
return tal[i].Uid < tal[j].Uid
}
// Swap is part of sort.Interface
func (tal TabletAliasList) Swap(i, j int) {
tal[i], tal[j] = tal[j], tal[i]
}
// TabletType is the main type for a tablet. It has an implication on:
// - the replication graph
// - the services run by vttablet on a tablet
// - the uptime expectancy
type TabletType string
const (
// idle - no keyspace, shard or type assigned
TYPE_IDLE = TabletType("idle")
// primary copy of data
TYPE_MASTER = TabletType("master")
// a slaved copy of the data ready to be promoted to master
TYPE_REPLICA = TabletType("replica")
// a slaved copy of the data for olap load patterns.
// too many aliases for olap - need to pick one
TYPE_RDONLY = TabletType("rdonly")
TYPE_BATCH = TabletType("batch")
// a slaved copy of the data ready, but not serving query traffic
// could be a potential master.
TYPE_SPARE = TabletType("spare")
// a slaved copy of the data ready, but not serving query traffic
// implies something abnormal about the setup - don't consider it
// a potential master and don't worry about lag when reparenting.
TYPE_EXPERIMENTAL = TabletType("experimental")
// a slaved copy of the data intentionally lagged for pseudo backup
TYPE_LAG = TabletType("lag")
// when a reparent occurs, the tablet goes into lag_orphan state until
// it can be reparented properly
TYPE_LAG_ORPHAN = TabletType("lag_orphan")
// a slaved copy of the data that was serving but is now applying
// a schema change. Will go bak to its serving type after the
// upgrade
TYPE_SCHEMA_UPGRADE = TabletType("schema_apply")
// a slaved copy of the data, but offline to queries other than backup
// replication sql thread may be stopped
TYPE_BACKUP = TabletType("backup")
// a slaved copy of the data, where mysqld is *not* running,
// and we are serving our data files to clone slaves
// use 'vtctl Snapshot -server-mode ...' to get in this mode
// use 'vtctl SnapshotSourceEnd ...' to get out of this mode
TYPE_SNAPSHOT_SOURCE = TabletType("snapshot_source")
// A tablet that has not been in the replication graph and is restoring
// from a snapshot. idle -> restore -> spare
TYPE_RESTORE = TabletType("restore")
// A tablet that is running a checker process. It is probably
// lagging in replication.
TYPE_CHECKER = TabletType("checker")
// a machine with data that needs to be wiped
TYPE_SCRAP = TabletType("scrap")
)
var AllTabletTypes = []TabletType{TYPE_IDLE,
TYPE_MASTER,
TYPE_REPLICA,
TYPE_RDONLY,
TYPE_BATCH,
TYPE_SPARE,
TYPE_EXPERIMENTAL,
TYPE_LAG,
TYPE_LAG_ORPHAN,
TYPE_SCHEMA_UPGRADE,
TYPE_BACKUP,
TYPE_SNAPSHOT_SOURCE,
TYPE_RESTORE,
TYPE_CHECKER,
TYPE_SCRAP,
}
var SlaveTabletTypes = []TabletType{
TYPE_REPLICA,
TYPE_RDONLY,
TYPE_BATCH,
TYPE_SPARE,
TYPE_EXPERIMENTAL,
TYPE_LAG,
TYPE_LAG_ORPHAN,
TYPE_SCHEMA_UPGRADE,
TYPE_BACKUP,
TYPE_SNAPSHOT_SOURCE,
TYPE_RESTORE,
TYPE_CHECKER,
}
// IsTypeInList returns true if the given type is in the list.
// Use it with AllTabletType and SlaveTabletType for instance.
func IsTypeInList(tabletType TabletType, types []TabletType) bool {
for _, t := range types {
if tabletType == t {
return true
}
}
return false
}
// IsSlaveType returns true iff the type is a mysql replication slave.
func (tt TabletType) IsSlaveType() bool {
return IsTypeInList(tt, SlaveTabletTypes)
}
// MakeStringTypeList returns a list of strings that match the input list.
func MakeStringTypeList(types []TabletType) []string {
strs := make([]string, len(types))
for i, t := range types {
strs[i] = string(t)
}
sort.Strings(strs)
return strs
}
// IsTrivialTypeChange returns if this db type be trivially reassigned
// without changes to the replication graph
func IsTrivialTypeChange(oldTabletType, newTabletType TabletType) bool {
switch oldTabletType {
case TYPE_REPLICA, TYPE_RDONLY, TYPE_BATCH, TYPE_SPARE, TYPE_LAG, TYPE_LAG_ORPHAN, TYPE_BACKUP, TYPE_SNAPSHOT_SOURCE, TYPE_EXPERIMENTAL, TYPE_SCHEMA_UPGRADE, TYPE_CHECKER:
switch newTabletType {
case TYPE_REPLICA, TYPE_RDONLY, TYPE_BATCH, TYPE_SPARE, TYPE_LAG, TYPE_LAG_ORPHAN, TYPE_BACKUP, TYPE_SNAPSHOT_SOURCE, TYPE_EXPERIMENTAL, TYPE_SCHEMA_UPGRADE, TYPE_CHECKER:
return true
}
case TYPE_SCRAP:
return newTabletType == TYPE_IDLE
case TYPE_RESTORE:
switch newTabletType {
case TYPE_SPARE, TYPE_IDLE:
return true
}
}
return false
}
// IsValidTypeChange returns if we should we allow this transition at
// all. Most transitions are allowed, but some don't make sense under
// any circumstances. If a transition could be forced, don't disallow
// it here.
func IsValidTypeChange(oldTabletType, newTabletType TabletType) bool {
switch oldTabletType {
case TYPE_SNAPSHOT_SOURCE:
switch newTabletType {
case TYPE_BACKUP, TYPE_SNAPSHOT_SOURCE:
return false
}
}
return true
}
// IsInServingGraph returns if a tablet appears in the serving graph
func IsInServingGraph(tt TabletType) bool {
switch tt {
case TYPE_MASTER, TYPE_REPLICA, TYPE_RDONLY, TYPE_BATCH:
return true
}
return false
}
// IsRunningQueryService returns if a tablet is running the query service
func IsRunningQueryService(tt TabletType) bool {
switch tt {
case TYPE_MASTER, TYPE_REPLICA, TYPE_RDONLY, TYPE_BATCH, TYPE_CHECKER:
return true
}
return false
}
// IsRunningUpdateStream returns if a tablet is running the update stream
// RPC service.
func IsRunningUpdateStream(tt TabletType) bool {
switch tt {
case TYPE_MASTER, TYPE_REPLICA, TYPE_RDONLY, TYPE_BATCH:
return true
}
return false
}
// IsInReplicationGraph returns if this tablet appears in the replication graph
// Only IDLE and SCRAP are not in the replication graph.
// The other non-obvious types are BACKUP, SNAPSHOT_SOURCE, RESTORE
// and LAG_ORPHAN: these have had a master at some point (or were the
// master), so they are in the graph.
func IsInReplicationGraph(tt TabletType) bool {
switch tt {
case TYPE_IDLE, TYPE_SCRAP:
return false
}
return true
}
// IsSlaveType returns if this type should be connected to a master db
// and actively replicating?
// MASTER is not obviously (only support one level replication graph)
// IDLE and SCRAP are not either
// BACKUP, RESTORE, LAG_ORPHAN, TYPE_CHECKER may or may not be, but we don't know for sure
func IsSlaveType(tt TabletType) bool {
switch tt {
case TYPE_MASTER, TYPE_IDLE, TYPE_SCRAP, TYPE_BACKUP, TYPE_RESTORE, TYPE_LAG_ORPHAN, TYPE_CHECKER:
return false
}
return true
}
// TabletState describe if the tablet is read-only or read-write.
type TabletState string
const (
// The normal state for a master
STATE_READ_WRITE = TabletState("ReadWrite")
// The normal state for a slave, or temporarily a master. Not
// to be confused with type, which implies a workload.
STATE_READ_ONLY = TabletState("ReadOnly")
)
// Tablet is a pure data struct for information serialized into json
// and stored into topo.Server
type Tablet struct {
// Parent is the globally unique alias for our replication
// parent - IsZero() if this tablet has no parent
Parent TabletAlias
// What is this tablet?
Alias TabletAlias
// Locaiton of the tablet
Hostname string
IPAddr string
// Named port names. Currently supported ports: vt, vts,
// mysql.
Portmap map[string]int
// Tags contain freeform information about the tablet.
Tags map[string]string
// Health tracks how healthy the tablet is. Clients may decide
// to use this information to make educated decisions on which
// tablet to connect to.
Health map[string]string
// Information about the tablet inside a keyspace/shard
Keyspace string
Shard string
Type TabletType
// Is the tablet read-only?
State TabletState
// Normally the database name is implied by "vt_" + keyspace. I
// really want to remove this but there are some databases that are
// hard to rename.
DbNameOverride string
KeyRange key.KeyRange
}
// ValidatePortmap returns an error if the tablet's portmap doesn't
// contain all the necessary ports for the tablet to be fully
// operational. We only care about vt port now, as mysql may not even
// be running.
func (tablet *Tablet) ValidatePortmap() error {
if _, ok := tablet.Portmap["vt"]; !ok {
return fmt.Errorf("no vt port available")
}
return nil
}
// EndPoint returns an EndPoint associated with the tablet record
func (tablet *Tablet) EndPoint() (*EndPoint, error) {
entry := NewEndPoint(tablet.Alias.Uid, tablet.Hostname)
if err := tablet.ValidatePortmap(); err != nil {
return nil, err
}
entry.NamedPortMap = map[string]int{}
if port, ok := tablet.Portmap["vt"]; ok {
entry.NamedPortMap["_vtocc"] = port
entry.NamedPortMap["vt"] = port
}
if port, ok := tablet.Portmap["mysql"]; ok {
entry.NamedPortMap["_mysql"] = port
entry.NamedPortMap["mysql"] = port
}
if port, ok := tablet.Portmap["vts"]; ok {
entry.NamedPortMap["_vts"] = port
entry.NamedPortMap["vts"] = port
}
if len(tablet.Health) > 0 {
entry.Health = make(map[string]string, len(tablet.Health))
for k, v := range tablet.Health {
entry.Health[k] = v
}
}
return entry, nil
}
// Addr returns hostname:vt port
func (tablet *Tablet) Addr() string {
return fmt.Sprintf("%v:%v", tablet.Hostname, tablet.Portmap["vt"])
}
// MysqlAddr returns hostname:mysql port
func (tablet *Tablet) MysqlAddr() string {
return fmt.Sprintf("%v:%v", tablet.Hostname, tablet.Portmap["mysql"])
}
// MysqlIpAddr returns ip:mysql port
func (tablet *Tablet) MysqlIpAddr() string {
return fmt.Sprintf("%v:%v", tablet.IPAddr, tablet.Portmap["mysql"])
}
// DbName is usually implied by keyspace. Having the shard information in the
// database name complicates mysql replication.
func (tablet *Tablet) DbName() string {
if tablet.DbNameOverride != "" {
return tablet.DbNameOverride
}
if tablet.Keyspace == "" {
return ""
}
return vtDbPrefix + tablet.Keyspace
}
func (tablet *Tablet) IsInServingGraph() bool {
return IsInServingGraph(tablet.Type)
}
func (tablet *Tablet) IsRunningQueryService() bool {
return IsRunningQueryService(tablet.Type)
}
func (tablet *Tablet) IsInReplicationGraph() bool {
return IsInReplicationGraph(tablet.Type)
}
func (tablet *Tablet) IsSlaveType() bool {
return IsSlaveType(tablet.Type)
}
// Was this tablet ever assigned data? A "scrap" node will show up as assigned
// even though its data cannot be used for serving.
func (tablet *Tablet) IsAssigned() bool {
return tablet.Keyspace != "" && tablet.Shard != ""
}
func (tablet *Tablet) String() string {
return fmt.Sprintf("Tablet{%v}", tablet.Alias)
}
func (tablet *Tablet) Json() string {
return jscfg.ToJson(tablet)
}
// TabletInfo is the container for a Tablet, read from the topology server.
type TabletInfo struct {
version int64 // node version - used to prevent stomping concurrent writes
*Tablet
}
// Version returns the version of this tablet from last time it was read or
// updated.
func (ti *TabletInfo) Version() int64 {
return ti.version
}
// Complete validates and normalizes the tablet. If the shard name
// contains a '-' it is going to try to infer the keyrange from it.
func (tablet *Tablet) Complete() error {
switch tablet.Type {
case TYPE_MASTER:
tablet.State = STATE_READ_WRITE
if tablet.Parent.Uid != NO_TABLET {
return fmt.Errorf("master cannot have parent: %v", tablet.Parent.Uid)
}
case TYPE_IDLE:
if tablet.Parent.Uid != NO_TABLET {
return fmt.Errorf("idle cannot have parent: %v", tablet.Parent.Uid)
}
fallthrough
default:
tablet.State = STATE_READ_ONLY
}
var err error
tablet.Shard, tablet.KeyRange, err = ValidateShardName(tablet.Shard)
return err
}
// IsHealthEqual compares the tablet's health with the passed one, and
// returns true if they're equivalent.
func (tablet *Tablet) IsHealthEqual(health map[string]string) bool {
if len(health) == 0 && len(tablet.Health) == 0 {
return true
}
return reflect.DeepEqual(health, tablet.Health)
}
// NewTabletInfo returns a TabletInfo basing on tablet with the
// version set. This function should be only used by Server
// implementations.
func NewTabletInfo(tablet *Tablet, version int64) *TabletInfo {
return &TabletInfo{version: version, Tablet: tablet}
}
// UpdateTablet updates the tablet data only - not associated replication paths.
func UpdateTablet(ctx context.Context, ts Server, tablet *TabletInfo) error {
span := trace.NewSpanFromContext(ctx)
span.StartClient("TopoServer.UpdateTablet")
span.Annotate("tablet", tablet.Alias.String())
defer span.Finish()
var version int64 = -1
if tablet.version != 0 {
version = tablet.version
}
newVersion, err := ts.UpdateTablet(tablet, version)
if err == nil {
tablet.version = newVersion
}
return err
}
// Validate makes sure a tablet is represented correctly in the topology server.
func Validate(ts Server, tabletAlias TabletAlias) error {
// read the tablet record, make sure it parses
tablet, err := ts.GetTablet(tabletAlias)
if err != nil {
return err
}
// Some tablets have no information to generate valid replication paths.
// We have three cases to handle:
// - we are a master, in which case we may have an entry or not
// (we are in the process of adding entries to the graph for masters)
// - we are a slave in the replication graph, and should have
// replication data (second case below)
// - we are a master, or in scrap mode but used to be assigned
// in the graph somewhere (third case below)
// Idle tablets are just not in any graph at all, we don't even know
// their keyspace / shard to know where to check.
if tablet.Type == TYPE_MASTER {
si, err := ts.GetShardReplication(tablet.Alias.Cell, tablet.Keyspace, tablet.Shard)
if err != nil {
log.Warningf("master tablet %v with no ShardReplication object, assuming it's because of transition", tabletAlias)
return nil
}
rl, err := si.GetReplicationLink(tabletAlias)
if err != nil {
log.Warningf("master tablet %v with no ReplicationLink entry, assuming it's because of transition", tabletAlias)
return nil
}
if rl.Parent != tablet.Parent {
return fmt.Errorf("tablet %v has parent %v but has %v in shard replication object", tabletAlias, tablet.Parent, rl.Parent)
}
} else if tablet.IsInReplicationGraph() {
if err = ts.ValidateShard(tablet.Keyspace, tablet.Shard); err != nil {
return err
}
si, err := ts.GetShardReplication(tablet.Alias.Cell, tablet.Keyspace, tablet.Shard)
if err != nil {
return err
}
rl, err := si.GetReplicationLink(tabletAlias)
if err != nil {
return fmt.Errorf("tablet %v not found in cell %v shard replication: %v", tabletAlias, tablet.Alias.Cell, err)
}
if rl.Parent != tablet.Parent {
return fmt.Errorf("tablet %v has parent %v but has %v in shard replication object", tabletAlias, tablet.Parent, rl.Parent)
}
} else if tablet.IsAssigned() {
// this case is to make sure a scrap node that used to be in
// a replication graph doesn't leave a node behind.
// However, while an action is running, there is some
// time where this might be inconsistent.
si, err := ts.GetShardReplication(tablet.Alias.Cell, tablet.Keyspace, tablet.Shard)
if err != nil {
return err
}
rl, err := si.GetReplicationLink(tabletAlias)
if err != ErrNoNode {
return fmt.Errorf("unexpected replication data found(possible pending action?): %v (%v)", rl, tablet.Type)
}
}
return nil
}
// CreateTablet creates a new tablet and all associated paths for the
// replication graph.
func CreateTablet(ts Server, tablet *Tablet) error {
// Have the Server create the tablet
err := ts.CreateTablet(tablet)
if err != nil {
return err
}
// Then add the tablet to the replication graphs
if !tablet.IsInReplicationGraph() {
return nil
}
return UpdateTabletReplicationData(context.TODO(), ts, tablet)
}
// UpdateTabletReplicationData creates or updates the replication
// graph data for a tablet
func UpdateTabletReplicationData(ctx context.Context, ts Server, tablet *Tablet) error {
return UpdateShardReplicationRecord(ctx, ts, tablet.Keyspace, tablet.Shard, tablet.Alias, tablet.Parent)
}
// DeleteTabletReplicationData deletes replication data.
func DeleteTabletReplicationData(ts Server, tablet *Tablet) error {
return RemoveShardReplicationRecord(ts, tablet.Alias.Cell, tablet.Keyspace, tablet.Shard, tablet.Alias)
}
// GetTabletMap tries to read all the tablets in the provided list,
// and returns them all in a map.
// If error is ErrPartialResult, the results in the dictionary are
// incomplete, meaning some tablets couldn't be read.
func GetTabletMap(ctx context.Context, ts Server, tabletAliases []TabletAlias) (map[TabletAlias]*TabletInfo, error) {
span := trace.NewSpanFromContext(ctx)
span.StartLocal("topo.GetTabletMap")
span.Annotate("num_tablets", len(tabletAliases))
defer span.Finish()
wg := sync.WaitGroup{}
mutex := sync.Mutex{}
tabletMap := make(map[TabletAlias]*TabletInfo)
var someError error
for _, tabletAlias := range tabletAliases {
wg.Add(1)
go func(tabletAlias TabletAlias) {
defer wg.Done()
tabletInfo, err := ts.GetTablet(tabletAlias)
mutex.Lock()
if err != nil {
log.Warningf("%v: %v", tabletAlias, err)
// There can be data races removing nodes - ignore them for now.
if err != ErrNoNode {
someError = ErrPartialResult
}
} else {
tabletMap[tabletAlias] = tabletInfo
}
mutex.Unlock()
}(tabletAlias)
}
wg.Wait()
return tabletMap, someError
}