-
Notifications
You must be signed in to change notification settings - Fork 58
/
repairing_task.go
692 lines (631 loc) · 23.4 KB
/
repairing_task.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
689
690
691
692
/*
* Copyright (c) 2008-2022, Hazelcast, Inc. All Rights Reserved.
*
* Licensed under the Apache License, Version 2.0 (the "License")
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/
package nearcache
import (
"context"
"errors"
"fmt"
"sync"
"sync/atomic"
"time"
pubcluster "github.com/hazelcast/hazelcast-go-client/cluster"
"github.com/hazelcast/hazelcast-go-client/hzerrors"
"github.com/hazelcast/hazelcast-go-client/internal/cluster"
"github.com/hazelcast/hazelcast-go-client/internal/invocation"
ilogger "github.com/hazelcast/hazelcast-go-client/internal/logger"
"github.com/hazelcast/hazelcast-go-client/internal/proto"
"github.com/hazelcast/hazelcast-go-client/internal/proto/codec"
"github.com/hazelcast/hazelcast-go-client/internal/serialization"
"github.com/hazelcast/hazelcast-go-client/types"
)
/*
ReparingTask runs on Near Cache side and only one instance is created per data-structure type like IMap and ICache.
Repairing responsibilities of this task are:
- To scan RepairingHandlers to see if any Near Cache needs to be invalidated according to missed invalidation counts (controlled via MaxToleratedMissCount).
- To send periodic generic-operations to cluster members in order to fetch latest partition sequences and UUIDs (controlled via InvalidationMinReconciliationIntervalSeconds.
See: com.hazelcast.internal.nearcache.impl.invalidation.RepairingTask
*/
type ReparingTask struct {
reconciliationIntervalNanos int64
lastAntiEntropyRunNanos int64
handlers *sync.Map
ss *serialization.Service
ps *cluster.PartitionService
doneCh <-chan struct{}
invalidationMetaDataFetcher InvalidationMetaDataFetcher
lg ilogger.LogAdaptor
localUUID types.UUID
maxToleratedMissCount int
partitionCount int32
running int32
}
func NewReparingTask(recInt int, maxMissCnt int, ss *serialization.Service, ps *cluster.PartitionService, lg ilogger.LogAdaptor, mf InvalidationMetaDataFetcher, uuid types.UUID, doneCh <-chan struct{}) *ReparingTask {
nc := &ReparingTask{
reconciliationIntervalNanos: int64(recInt) * 1_000_000_000,
maxToleratedMissCount: maxMissCnt,
invalidationMetaDataFetcher: mf,
doneCh: doneCh,
ss: ss,
ps: ps,
lg: lg,
localUUID: uuid,
handlers: &sync.Map{},
partitionCount: ps.PartitionCount(),
}
return nc
}
func (rt *ReparingTask) start() {
// see: com.hazelcast.internal.nearcache.impl.invalidation.RepairingTask#scheduleNextRun
rt.lg.Debug(func() string {
return "nearacahe.ReparingTask started"
})
const interval = 1 * time.Second
timer := time.NewTimer(interval)
defer timer.Stop()
rt.run()
for {
select {
case <-rt.doneCh:
return
case <-timer.C:
rt.run()
timer.Reset(interval)
}
}
}
func (rt *ReparingTask) RegisterAndGetHandler(ctx context.Context, name string, nc *NearCache) (*RepairingHandler, error) {
handler := NewRepairingHandler(name, nc, rt.partitionCount, rt.ss, rt.ps, rt.lg, rt.localUUID)
// ignoring the "loaded" return value
h, loaded := rt.handlers.LoadOrStore(name, handler)
if !loaded {
sr := NewStaleReadDetector(handler, rt.ps)
nc.store.staleReadDetector = &sr
rt.initRepairingHandler(ctx, handler)
}
if atomic.CompareAndSwapInt32(&rt.running, 0, 1) {
// this is the first added handler
go rt.start()
atomic.StoreInt64(&rt.lastAntiEntropyRunNanos, time.Now().UnixNano())
}
return h.(*RepairingHandler), nil
}
func (rt *ReparingTask) DeregisterHandler(name string) {
// port of: com.hazelcast.internal.nearcache.impl.invalidation.RepairingTask#deregisterHandler
rt.handlers.Delete(name)
}
func (rt *ReparingTask) initRepairingHandler(ctx context.Context, handler *RepairingHandler) {
// port of: com.hazelcast.internal.nearcache.impl.invalidation.RepairingTask#initRepairingHandler
rt.lg.Trace(func() string {
return "nearcache.ReparingTask.initRepairingHandler: initializing"
})
if !rt.invalidationMetaDataFetcher.Init(ctx, handler) {
rt.initRepairingHandlerAsync(handler)
}
}
func (rt *ReparingTask) initRepairingHandlerAsync(handler *RepairingHandler) {
// port of: com.hazelcast.internal.nearcache.impl.invalidation.RepairingTask#initRepairingHandlerAsync
rt.lg.Trace(func() string {
return "nearcache.ReparingTask.initRepairingHandler: initializing"
})
go func() {
timer := time.NewTimer(time.Duration(rescheduleFailedInitializationAfterMillis) * time.Millisecond)
defer timer.Stop()
select {
case <-rt.doneCh:
return
case <-timer.C:
rt.initRepairingHandlerAsyncRun(handler, 1)
}
}()
}
func (rt *ReparingTask) initRepairingHandlerAsyncRun(handler *RepairingHandler, roundNumber int32) {
// reference implementation calls initRepairingHandler, but I think that's wrong
if rt.invalidationMetaDataFetcher.Init(context.Background(), handler) {
return
}
totalDelay := totalDelaySoFarNanos(roundNumber)
if rt.reconciliationIntervalNanos > totalDelay {
delay := roundNumber * rescheduleFailedInitializationAfterMillis
timer := time.NewTimer(time.Duration(delay) * time.Millisecond)
defer timer.Stop()
select {
case <-rt.doneCh:
return
case <-timer.C:
rt.initRepairingHandlerAsyncRun(handler, roundNumber+1)
}
}
// else don't reschedule this task again and fallback to anti-entropy (see #runAntiEntropy)
// if we haven't managed to initialize repairing handler so far.
}
func (rt *ReparingTask) run() {
// port of: com.hazelcast.internal.nearcache.impl.invalidation.RepairingTask#run
rt.fixSequenceGaps()
if rt.isAntiEntropyNeeded() {
rt.runAntiEntropy(context.Background())
}
}
// fixSequenceGaps marks relevant data as stale if missed invalidation event count is above the max tolerated miss count.
func (rt *ReparingTask) fixSequenceGaps() {
rt.handlers.Range(func(_, value interface{}) bool {
handler := value.(*RepairingHandler)
if rt.isAboveMaxToleratedMissCount(handler) {
rt.updateLastKnownStaleSequences(handler)
}
return true
})
}
func (rt *ReparingTask) isAboveMaxToleratedMissCount(handler *RepairingHandler) bool {
var total int64
for i := int32(0); i < rt.partitionCount; i++ {
md := handler.GetMetaDataContainer(i)
total += md.MissedSequenceCount()
if total > int64(rt.maxToleratedMissCount) {
rt.lg.Trace(func() string {
return fmt.Sprintf("above tolerated miss count:[map=%s,missCount=%d,maxToleratedMissCount=%d]",
handler.Name(), total, rt.maxToleratedMissCount)
})
return true
}
}
return false
}
func (rt *ReparingTask) updateLastKnownStaleSequences(handler *RepairingHandler) {
for i := int32(0); i < rt.partitionCount; i++ {
md := handler.GetMetaDataContainer(i)
mc := md.MissedSequenceCount()
if mc != 0 {
// return value is ignored.
md.AddAndGetMissedSequenceCount(-mc)
handler.UpdateLastKnownStaleSequence(md, i)
}
}
}
func (rt *ReparingTask) isAntiEntropyNeeded() bool {
if rt.reconciliationIntervalNanos == 0 {
return false
}
now := time.Now().UnixNano()
since := now - atomic.LoadInt64(&rt.lastAntiEntropyRunNanos)
rt.lg.Trace(func() string {
return fmt.Sprintf("since last anti-entropy: %d, recon interval: %d, needed: %t",
since, rt.reconciliationIntervalNanos, since >= rt.reconciliationIntervalNanos)
})
return since >= rt.reconciliationIntervalNanos
}
// runAntiEntropy periodically sends generic operations to cluster members to get latest invalidation metadata.
func (rt *ReparingTask) runAntiEntropy(ctx context.Context) {
// port of: com.hazelcast.internal.nearcache.impl.invalidation.RepairingTask#runAntiEntropy
rt.lg.Debug(func() string {
return "nearcache.ReparingTask.runAntiEntropy"
})
// get a copy of the handlers, so we don't have to deal with sync.Map.
handlers := map[string]*RepairingHandler{}
rt.handlers.Range(func(k, v interface{}) bool {
handlers[k.(string)] = v.(*RepairingHandler)
return true
})
rt.invalidationMetaDataFetcher.fetchMetadata(ctx, handlers)
atomic.StoreInt64(&rt.lastAntiEntropyRunNanos, time.Now().UnixNano())
}
// RepairingHandler is the port of: com.hazelcast.internal.nearcache.impl.invalidation.RepairingHandler
type RepairingHandler struct {
name string
metadataContainers []*MetaDataContainer
nc *NearCache
toNearCacheKey func(key interface{}) (interface{}, error)
ss *serialization.Service
ps *cluster.PartitionService
localUUID types.UUID
lg ilogger.LogAdaptor
}
func NewRepairingHandler(name string, nc *NearCache, partitionCount int32, ss *serialization.Service, ps *cluster.PartitionService, lg ilogger.LogAdaptor, uuid types.UUID) *RepairingHandler {
mcs := make([]*MetaDataContainer, partitionCount)
for i := int32(0); i < partitionCount; i++ {
mcs[i] = NewMetaDataContainer()
}
sk := nc.Config().SerializeKeys
f := func(key interface{}) (interface{}, error) {
if sk {
return key, nil
}
return ss.ToObject(key.(serialization.Data))
}
return &RepairingHandler{
name: name,
nc: nc,
metadataContainers: mcs,
toNearCacheKey: f,
ss: ss,
ps: ps,
lg: lg,
localUUID: uuid,
}
}
func (h *RepairingHandler) Name() string {
return h.name
}
func (h *RepairingHandler) GetMetaDataContainer(partition int32) *MetaDataContainer {
return h.metadataContainers[partition]
}
func (h *RepairingHandler) UpdateLastKnownStaleSequence(md *MetaDataContainer, partition int32) {
var lastReceived int64
var lastKnown int64
for {
lastReceived = md.Sequence()
lastKnown = md.StaleSequence()
if lastKnown >= lastReceived {
break
}
if md.CASStaleSequence(lastKnown, lastReceived) {
break
}
}
h.lg.Trace(func() string {
return fmt.Sprintf("stale sequences updated:[map=%s,partition=%d,lowerSequencesStaleThan=%d,lastReceivedSequence=%d]",
h.name, partition, md.StaleSequence(), md.Sequence())
})
}
// Handle handles a single invalidation.
func (h *RepairingHandler) Handle(key serialization.Data, source, partition types.UUID, seq int64) error {
// port of: com.hazelcast.internal.nearcache.impl.invalidation.RepairingHandler#handle(com.hazelcast.internal.serialization.Data, java.util.UUID, java.util.UUID, long)
// Apply invalidation if it's not originated by local member/client.
// Since local Near Caches are invalidated immediately there is no need to invalidate them twice.
if h.localUUID != source {
if key == nil {
h.nc.Clear()
} else {
k, err := h.toNearCacheKey(key)
if err != nil {
return err
}
h.nc.Invalidate(k)
}
}
pid, err := h.getPartitionIDOrDefault(key)
if err != nil {
return err
}
h.CheckOrRepairUUID(pid, partition)
h.CheckOrRepairSequence(pid, seq, false)
return nil
}
// HandleBatch handles a batch of validations.
func (h *RepairingHandler) HandleBatch(keys []serialization.Data, sources []types.UUID, partitions []types.UUID, seqs []int64) error {
// port of: com.hazelcast.internal.nearcache.impl.invalidation.RepairingHandler#handle(java.util.Collection<com.hazelcast.internal.serialization.Data>, java.util.Collection<java.util.UUID>, java.util.Collection<java.util.UUID>, java.util.Collection<java.lang.Long>)
// assumes len(keys) == len(source) -- len(partitions) == len(seqs)
sz := len(keys)
for i := 0; i < sz; i++ {
if err := h.Handle(keys[i], sources[i], partitions[i], seqs[i]); err != nil {
return err
}
}
return nil
}
func (h *RepairingHandler) InitUUID(partition int32, uuid types.UUID) {
// port of: com.hazelcast.internal.nearcache.impl.invalidation.RepairingHandler#initUuid
h.metadataContainers[partition].SetUUID(uuid)
}
func (h *RepairingHandler) InitSequence(partition int32, seq int64) {
// port of: com.hazelcast.internal.nearcache.impl.invalidation.RepairingHandler#initSequence
h.metadataContainers[partition].SetSequence(seq)
}
func (h *RepairingHandler) CheckOrRepairUUID(partition int32, new types.UUID) {
// this method may be called concurrently: anti-entropy, event service
if new.Default() {
h.lg.Warnf("nearcache.RepairingHandler.CheckOrRepairUUID: new UUID should not be the default UUID")
return
}
md := h.GetMetaDataContainer(partition)
for {
prev := md.UUID()
if prev == new {
break
}
if md.CASUUID(prev, new) {
md.ResetSequence()
md.ResetStaleSequence()
h.lg.Trace(func() string {
return fmt.Sprintf("invalid UUID, lost remote partition data unexpectedly:[name=%s,partition=%d,prevUuid=%s,newUuid=%s]",
h.name, partition, prev, new)
})
break
}
}
}
func (h *RepairingHandler) CheckOrRepairSequence(partition int32, nextSeq int64, viaAntiEntropy bool) {
if nextSeq <= 0 {
h.lg.Warnf("nearcache.RepairingHandler.CheckOrRepairSequence: CheckOrRepairSequence <= 0")
return
}
md := h.GetMetaDataContainer(partition)
for {
curSeq := md.Sequence()
if curSeq >= nextSeq {
break
}
if md.CASSequence(curSeq, nextSeq) {
diff := nextSeq - curSeq
if viaAntiEntropy || diff > 1 {
// We have found at least one missing sequence between current and next sequences.
// If miss is detected by anti-entropy, number of missed sequences will be miss = next - current.
// Otherwise it means miss is detected by observing received invalidation event sequence numbers and number of missed sequences will be miss = next - current - 1.
missCnt := diff
if !viaAntiEntropy {
missCnt -= 1
}
total := md.AddAndGetMissedSequenceCount(missCnt)
h.lg.Trace(func() string {
return fmt.Sprintf("invalid sequence:[map=%s,partition=%d,currentSequence=%d,nextSequence=%d,totalMissCount=%d]",
h.name, partition, curSeq, nextSeq, total)
})
}
break
}
}
}
func (h *RepairingHandler) getPartitionIDOrDefault(key serialization.Data) (int32, error) {
if key == nil {
// name is used to determine partition ID of map-wide events like clear()
// since key is nil, we are using name to find the partition ID
data, err := h.ss.ToData(h.name)
if err != nil {
return 0, err
}
key = data
}
return h.ps.GetPartitionID(key)
}
// MetaDataContainer contains one partitions' invalidation metadata.
// port of: com.hazelcast.internal.nearcache.impl.invalidation.MetaDataContainer
type MetaDataContainer struct {
seq int64
staleSeq int64
missedSeqs int64
uuid atomic.Value
}
func NewMetaDataContainer() *MetaDataContainer {
uuid := atomic.Value{}
uuid.Store(types.UUID{})
return &MetaDataContainer{
uuid: uuid,
}
}
func (mc *MetaDataContainer) SetUUID(uuid types.UUID) {
mc.uuid.Store(uuid)
}
func (mc *MetaDataContainer) UUID() types.UUID {
return mc.uuid.Load().(types.UUID)
}
func (mc *MetaDataContainer) CASUUID(prev, new types.UUID) bool {
return mc.uuid.CompareAndSwap(prev, new)
}
func (mc *MetaDataContainer) SetSequence(seq int64) {
atomic.StoreInt64(&mc.seq, seq)
}
func (mc *MetaDataContainer) Sequence() int64 {
return atomic.LoadInt64(&mc.seq)
}
func (mc *MetaDataContainer) ResetSequence() {
mc.SetSequence(0)
}
func (mc *MetaDataContainer) CASSequence(current, next int64) bool {
return atomic.CompareAndSwapInt64(&mc.seq, current, next)
}
func (mc *MetaDataContainer) SetStaleSequence(seq int64) {
atomic.StoreInt64(&mc.staleSeq, seq)
}
func (mc *MetaDataContainer) StaleSequence() int64 {
return atomic.LoadInt64(&mc.staleSeq)
}
func (mc *MetaDataContainer) ResetStaleSequence() {
mc.SetStaleSequence(0)
}
func (mc *MetaDataContainer) CASStaleSequence(lastKnown, lastReceived int64) bool {
return atomic.CompareAndSwapInt64(&mc.staleSeq, lastKnown, lastReceived)
}
func (mc *MetaDataContainer) MissedSequenceCount() int64 {
return atomic.LoadInt64(&mc.missedSeqs)
}
func (mc *MetaDataContainer) AddAndGetMissedSequenceCount(count int64) int64 {
return atomic.AddInt64(&mc.missedSeqs, count)
}
// InvalidationMetaDataFetcher runs on Near Cache side.
// An instance of this task is responsible for fetching of all Near Caches' remote metadata like last sequence numbers and partition UUIDs.
// port of: com.hazelcast.internal.nearcache.impl.invalidation.InvalidationMetaDataFetcher
// port of: com.hazelcast.client.map.impl.nearcache.invalidation.ClientMapInvalidationMetaDataFetcher
type InvalidationMetaDataFetcher struct {
cs *cluster.Service
is *invocation.Service
invFactory *cluster.ConnectionInvocationFactory
lg ilogger.LogAdaptor
}
func NewInvalidationMetaDataFetcher(cs *cluster.Service, is *invocation.Service, invFactory *cluster.ConnectionInvocationFactory, lg ilogger.LogAdaptor) InvalidationMetaDataFetcher {
df := InvalidationMetaDataFetcher{
cs: cs,
is: is,
invFactory: invFactory,
lg: lg,
}
return df
}
func (df InvalidationMetaDataFetcher) Init(ctx context.Context, handler *RepairingHandler) bool {
// port of: com.hazelcast.internal.nearcache.impl.invalidation.InvalidationMetaDataFetcher#init
handlers := map[string]*RepairingHandler{
handler.Name(): handler,
}
invs := df.fetchMembersMetadataFor(ctx, []string{handler.Name()})
for _, inv := range invs {
npsPairs, psPairs, err := df.extractMemberMetadata(ctx, inv)
if err != nil {
df.handleErrorWhileProcessingMetadata(err)
return false
}
df.initUUIDs(psPairs, handlers)
df.initSequence(npsPairs, handlers)
}
return true
}
func (df InvalidationMetaDataFetcher) fetchMetadata(ctx context.Context, handlers map[string]*RepairingHandler) {
// port of: com.hazelcast.internal.nearcache.impl.invalidation.InvalidationMetaDataFetcher#fetchMetadata
if len(handlers) == 0 {
return
}
// getDataStructureNames
names := []string{}
for _, h := range handlers {
names = append(names, h.Name())
}
invs := df.fetchMembersMetadataFor(ctx, names)
for _, inv := range invs {
df.processMemberMetadata(ctx, inv, handlers)
}
}
func (df InvalidationMetaDataFetcher) fetchMembersMetadataFor(ctx context.Context, names []string) map[types.UUID]invocation.Invocation {
// port of: com.hazelcast.internal.nearcache.impl.invalidation.InvalidationMetaDataFetcher#fetchMembersMetadataFor
mems := filterDataMembers(df.cs.OrderedMembers())
if len(mems) == 0 {
return nil
}
invs := make(map[types.UUID]invocation.Invocation, len(mems))
for _, mem := range mems {
inv, err := df.fetchMetaDataOf(ctx, mem, names)
if err != nil {
df.handleErrorWhileProcessingMetadata(err)
continue
}
invs[mem.UUID] = inv
}
return invs
}
func (df InvalidationMetaDataFetcher) fetchMetaDataOf(ctx context.Context, mem pubcluster.MemberInfo, names []string) (*cluster.MemberBoundInvocation, error) {
// port of: com.hazelcast.client.map.impl.nearcache.invalidation.ClientMapInvalidationMetaDataFetcher#fetchMetadataOf
msg := codec.EncodeMapFetchNearCacheInvalidationMetadataRequest(names, mem.UUID)
inv := df.invFactory.NewMemberBoundInvocation(msg, &mem, time.Now())
if err := df.is.SendRequest(ctx, inv); err != nil {
return nil, err
}
return inv, nil
}
func (df *InvalidationMetaDataFetcher) extractMemberMetadata(ctx context.Context, inv invocation.Invocation) (namePartitionSequenceList []proto.Pair, partitionUuidList []proto.Pair, err error) {
// port of: com.hazelcast.client.map.impl.nearcache.invalidation.ClientMapInvalidationMetaDataFetcher#extractMemberMetadata
ctx, cancel := context.WithTimeout(ctx, 1*time.Minute)
defer cancel()
res, err := inv.GetWithContext(ctx)
if err != nil {
return nil, nil, err
}
npsPairs, psPairs := codec.DecodeMapFetchNearCacheInvalidationMetadataResponse(res)
return npsPairs, psPairs, nil
}
func (df *InvalidationMetaDataFetcher) processMemberMetadata(ctx context.Context, inv invocation.Invocation, handlers map[string]*RepairingHandler) {
// port of: com.hazelcast.internal.nearcache.impl.invalidation.InvalidationMetaDataFetcher#processMemberMetadata
npsPairs, psPairs, err := df.extractMemberMetadata(ctx, inv)
if err != nil {
df.handleErrorWhileProcessingMetadata(err)
return
}
df.repairUUIDs(psPairs, handlers)
df.repairSequences(npsPairs, handlers)
}
func (df InvalidationMetaDataFetcher) handleErrorWhileProcessingMetadata(err error) {
// port of: com.hazelcast.internal.nearcache.impl.invalidation.InvalidationMetaDataFetcher#handleExceptionWhileProcessingMetadata
if errors.Is(err, hzerrors.ErrIllegalState) {
df.lg.Trace(func() string {
return fmt.Sprintf("nearcache.InvalidationMetaDataFetcher.processMemberMetadata: ERROR %s", err.Error())
})
}
df.lg.Warnf("can't fetch or extract invalidation metadata: %s", err.Error())
}
func (df *InvalidationMetaDataFetcher) initUUIDs(psPairs []proto.Pair, handlers map[string]*RepairingHandler) {
// port of: com.hazelcast.internal.nearcache.impl.invalidation.InvalidationMetaDataFetcher#initUuid
for _, p := range psPairs {
partition := p.Key.(int32)
partitionUUID := p.Value.(types.UUID)
for _, handler := range handlers {
handler.InitUUID(partition, partitionUUID)
}
}
}
func (df *InvalidationMetaDataFetcher) initSequence(npsPairs []proto.Pair, handlers map[string]*RepairingHandler) {
// port of: com.hazelcast.internal.nearcache.impl.invalidation.InvalidationMetaDataFetcher#initSequence
for _, np := range npsPairs {
handler := handlers[np.Key.(string)]
vvs := np.Value.([]proto.Pair)
for _, subEntry := range vvs {
partitionID := subEntry.Key.(int32)
partitionSeq := subEntry.Value.(int64)
handler.InitSequence(partitionID, partitionSeq)
}
}
}
func (df *InvalidationMetaDataFetcher) repairUUIDs(psPairs []proto.Pair, handlers map[string]*RepairingHandler) {
// see: com.hazelcast.internal.nearcache.impl.invalidation.InvalidationMetaDataFetcher#repairUuids
for _, p := range psPairs {
k := p.Key.(int32)
v := p.Value.(types.UUID)
for _, handler := range handlers {
handler.CheckOrRepairUUID(k, v)
}
}
}
func (df *InvalidationMetaDataFetcher) repairSequences(npsPairs []proto.Pair, handlers map[string]*RepairingHandler) {
// see: com.hazelcast.internal.nearcache.impl.invalidation.InvalidationMetaDataFetcher#repairSequences
for _, np := range npsPairs {
handler := handlers[np.Key.(string)]
vvs := np.Value.([]proto.Pair)
for _, vv := range vvs {
partition := vv.Key.(int32)
nextSeq := vv.Value.(int64)
handler.CheckOrRepairSequence(partition, nextSeq, true)
}
}
}
// filterDataMembers removes lite members from the given slice.
// Order of the members is not preserved.
func filterDataMembers(mems []pubcluster.MemberInfo) []pubcluster.MemberInfo {
di := len(mems)
loop:
for i := 0; i < di; i++ {
if mems[i].LiteMember {
// order is not important, delete by moving deleted items to the end.
// find the first non-lite member
di--
for mems[di].LiteMember {
if di <= i {
// no more data members left
break loop
}
di--
}
mems[i], mems[di] = mems[di], mems[i]
}
}
// all deleted items are at the end.
// shrink the slice to get rid of them.
return mems[:di]
}
const (
rescheduleFailedInitializationAfterMillis = 500
)
func totalDelaySoFarNanos(num int32) int64 {
// port of: com.hazelcast.internal.nearcache.impl.invalidation.RepairingTask#totalDelaySoFarNanos
var delayMS int64
for i := int32(1); i < num; i++ {
delayMS += int64(num) * rescheduleFailedInitializationAfterMillis
}
return delayMS * 1_000_000
}