-
Notifications
You must be signed in to change notification settings - Fork 0
/
map.go
1117 lines (909 loc) · 21.5 KB
/
map.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
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
package cmap
import (
"encoding/json"
"fmt"
"github.com/fwhezfwhez/errorx"
"math"
"sync"
"sync/atomic"
"time"
)
// value saved
type Value struct {
// value
v interface{}
// value will be expired in exp seconds, -1 means no time limit
exp int64
// Map's offset, when map exec set/delete, offset++
offset int64
// generated time when a value is set, unixnano
execAt int64
}
// v is latter than v2 in time
// LatterThan helps judge set/del/sync make sense or not
func (v Value) LatterThan(v2 Value) bool {
if v.execAt > v2.execAt {
return true
}
if v.execAt < v2.execAt {
return false
}
return v.offset > v2.offset
}
// v is former than v2 in time
func (v Value) FormerThan(v2 Value) bool {
if v.execAt < v2.execAt {
return true
}
if v.execAt > v2.execAt {
return false
}
return v.offset < v2.offset
}
func (v Value) isExpire() bool {
if v.exp == -1 {
return false
}
if v.exp < time.Now().UnixNano() {
return true
}
return false
}
// make value readable
func (v Value) detail() map[string]interface{} {
m := map[string]interface{}{
"v": v.v,
"exp": v.exp,
"offset": v.offset,
"exec_at": v.execAt,
}
return m
}
// M_FREE and M_BUSY are signal of map.m state.
// When map.mode == M_FREE, data are writable and readable using map.m.
// When map.mode == M_BUSY, data are writable and readble using map.dirty, writable map.write and writable map.del
const (
M_FREE1 = 2 // free1-同步中, m 同步write和del
M_FREE2 = 0 // free2-同步完成, m可以独立承担读写
M_BUSY = 1
)
// Map is concurrently safe, and faster than sync.Map.
// Map consist of m, dirty, write, del, these 4 data register.
// In M_FREE mode, map.m is writable/readable to users.
// When calling map.ClearExpireKeys(), map will change mode into M_BUSY.
// In B_BUSY mode, map.m is unreadable and unwritable. users read data from dirty.
// At this moment,
// writing operation will write data to map.dirty, map.write
// deleting operation will write to map.del
// As soon as clearing job done, mode set to M_FREE,
// At this moment,
// map.m is return to job, writed and read
// map.write change to read-only and data in m.write will be sync to map.m then cleared
// map.del change to read-only and data in m.del will sync to map.m then cleared
// map.dirty are first be cleared and then synchronizing data from map.m and block new write request, after sync job done, finish all writing request.
type Map struct {
clearing int32
deltal *sync.RWMutex // 在增量复制时的锁
modl *sync.RWMutex
mode int
l *sync.RWMutex
m map[string]Value
dl *sync.RWMutex
dirty map[string]Value
wl *sync.RWMutex
write map[string]Value
dll *sync.RWMutex
offset int64
del map[string]Value
// 支持list功能
listLock *sync.RWMutex
}
// Help viewing map's detail.
// b, e:= json.MarshalIndent(m.Detail(), "", " ")
// fmt.Println(string(b))
type mapView struct {
Mode int
M map[string]interface{}
Dirty map[string]interface{}
Write map[string]interface{}
Offset int64
Del map[string]interface{}
}
func newMap() *Map {
return &Map{
deltal: &sync.RWMutex{},
modl: &sync.RWMutex{},
mode: M_FREE2,
l: &sync.RWMutex{},
m: make(map[string]Value),
dl: &sync.RWMutex{},
dirty: make(map[string]Value),
wl: &sync.RWMutex{},
write: make(map[string]Value),
dll: &sync.RWMutex{},
del: make(map[string]Value),
listLock: &sync.RWMutex{},
}
}
// new a concurrent map
func NewMap() *Map {
return newMap()
}
// Pause the world
// gLock and gUnlock must run in pair
func (m *Map) gLock() {
m.l.Lock()
m.wl.Lock()
m.dl.Lock()
m.dll.Lock()
}
// Continue
func (m *Map) gUnlock() {
m.dll.Unlock()
m.dl.Unlock()
m.wl.Unlock()
m.l.Unlock()
}
func (m *Map) gRLock() {
m.l.RLock()
m.wl.RLock()
m.dl.RLock()
m.dll.RLock()
}
func (m *Map) gRUnlock() {
m.l.RUnlock()
m.wl.RUnlock()
m.dl.RUnlock()
m.dll.RUnlock()
}
func (m *Map) IsBusy() bool {
m.modl.RLock()
defer m.modl.RUnlock()
return m.mode == M_BUSY
}
func (m *Map) IsFree1() bool {
m.modl.RLock()
defer m.modl.RUnlock()
return m.mode == M_FREE1
}
func (m *Map) IsFree2() bool {
m.modl.RLock()
defer m.modl.RUnlock()
return m.mode == M_FREE2
}
func (m *Map) isBusyWrapedBymodl() bool {
return m.mode == M_BUSY
}
func (m *Map) isFree1WrapedBymodl() bool {
return m.mode == M_FREE1
}
func (m *Map) isFree2WrapedBymodl() bool {
return m.mode == M_FREE2
}
// map.Set
func (m *Map) Set(key string, value interface{}) {
m.set(key, value, -1, false)
}
type Op struct {
enable bool
incrBy incrByType
}
type incrType struct {
enable bool
}
type incrByType struct {
enable bool
delta int
}
func (m *Map) set(key string, value interface{}, seconds int, nx bool, ops ...Op) interface{} {
var op Op
if len(ops) > 0 {
op = ops[0]
op.enable = true
}
var exp int64
if seconds == -1 {
exp = -1
} else {
exp = time.Now().Add(time.Duration(seconds) * time.Second).UnixNano()
}
ext := time.Now().UnixNano()
offset := m.offsetIncr()
// 发生set时,不会出现状态切换
m.modl.RLock()
defer m.modl.RUnlock()
// free2 时,写入m,写入dir
if m.isFree2WrapedBymodl() {
// set类型的命令
if op.enable == false {
setm(m.l, m.m, key, value, ext, offset, exp, nx)
setm(m.dl, m.dirty, key, value, ext, offset, exp, nx)
return value
}
// incrBy类型的命令
if op.incrBy.enable == true {
rs := casm(m.l, m.m, key, func(old interface{}) (interface{}, error) {
rs, e := incr(old, op.incrBy.delta)
if e != nil {
return nil, fmt.Errorf("err '%s' for key '%s'", e.Error(), key)
}
return rs, nil
}, exp, ext, offset)
casm(m.dl, m.dirty, key, func(old interface{}) (interface{}, error) {
rs, e := incr(old, op.incrBy.delta)
if e != nil {
return nil, fmt.Errorf("err '%s' for key '%s'", e.Error(), key)
}
return rs, nil
}, exp, ext, offset)
return rs
}
}
// 同步中时,写dir,阻塞m
if m.isFree1WrapedBymodl() {
if op.enable == false {
m.deltal.RLock()
setm(m.l, m.m, key, value, ext, offset, exp, nx)
m.deltal.RUnlock()
setm(m.dl, m.dirty, key, value, ext, offset, exp, nx)
return nil
}
if op.incrBy.enable == true {
m.deltal.RLock()
casm(m.l, m.m, key, func(old interface{}) (interface{}, error) {
rs, e := incr(old, op.incrBy.delta)
if e != nil {
return nil, fmt.Errorf("err '%s' for key '%s'", e.Error(), key)
}
return rs, nil
}, exp, ext, offset)
m.deltal.RUnlock()
rs := casm(m.dl, m.dirty, key, func(old interface{}) (interface{}, error) {
rs, e := incr(old, op.incrBy.delta)
if e != nil {
return nil, fmt.Errorf("err '%s' for key '%s'", e.Error(), key)
}
return rs, nil
}, exp, ext, offset)
return rs
}
}
if op.enable == false {
setm(m.dl, m.dirty, key, value, ext, offset, exp, nx)
setm(m.wl, m.write, key, value, ext, offset, exp, nx)
return nil
}
if op.incrBy.enable == true {
// busy时,写入dir和write
rs := casm(m.dl, m.dirty, key, func(old interface{}) (interface{}, error) {
rs, e := incr(old, op.incrBy.delta)
if e != nil {
return nil, fmt.Errorf("err '%s' for key '%s'", e.Error(), key)
}
return rs, nil
}, exp, ext, offset)
// busy时,写入dir和write
casm(m.wl, m.write, key, func(old interface{}) (interface{}, error) {
rs, e := incr(old, op.incrBy.delta)
if e != nil {
return nil, fmt.Errorf("err '%s' for key '%s'", e.Error(), key)
}
return rs, nil
}, exp, ext, offset)
return rs
}
return nil
}
// set,del,setnx,setex will increase map.offset.
// When offset reaches max int64 value, will be back to 0
// So to judege values former or latter, should compare v.execAt first and then comapre offset.
func (m *Map) offsetIncr() int64 {
atomic.CompareAndSwapInt64(&m.offset, math.MaxInt64-10000, 0)
atomic.AddInt64(&m.offset, 1)
return m.offset
}
// map.SetEX
// key-value will be put with expired time limit.
// If seconds are set -1, value will not be expired
// expired keys will be deleted as soon as calling m.Get(key), or calling m.ClearExpireKeys()
func (m *Map) SetEx(key string, value interface{}, seconds int) {
m.set(key, value, seconds, false)
}
// map.SetNx
// If key exist, do nothing, otherwise set key,value into map
func (m *Map) SetNx(key string, value interface{}) {
m.set(key, value, -1, true)
}
// map.SetEXNX
// If key exist, do nothing, otherwise set key,value into map
func (m *Map) SetExNx(key string, value interface{}, seconds int) {
m.set(key, value, seconds, true)
}
// increase key by 1.
// If key is not an integer type, will do nothing
func (m *Map) Incr(key string) int64 {
rs := m.set(key, nil, -1, false, Op{
incrBy: struct {
enable bool
delta int
}{enable: true, delta: 1},
})
return Int64(rs)
}
// increase key by one with expire seconds
func (m *Map) IncrEx(key string, seconds int) int64 {
// 通过get做失效
_, _ = m.get(key)
rs := m.set(key, nil, seconds, false, Op{
incrBy: struct {
enable bool
delta int
}{enable: true, delta: 1},
})
return Int64(rs)
}
// increase key by n
func (m *Map) IncrBy(key string, n int) int64 {
// 通过get做失效
_, _ = m.get(key)
rs := m.set(key, nil, -1, false, Op{
incrBy: struct {
enable bool
delta int
}{enable: true, delta: n},
})
return Int64(rs)
}
// increase key by n with expire seconds
func (m *Map) IncrByEx(key string, n int, seconds int) int64 {
// 通过get做失效
_, _ = m.get(key)
rs := m.set(key, nil, seconds, false, Op{
incrBy: struct {
enable bool
delta int
}{enable: true, delta: n},
})
return Int64(rs)
}
// decrease key by one
func (m *Map) Decr(key string) int64 {
// 通过get做失效
_, _ = m.get(key)
rs := m.set(key, nil, -1, false, Op{
incrBy: struct {
enable bool
delta int
}{enable: true, delta: -1},
})
return Int64(rs)
}
// decrease key by one with seconds expired
func (m *Map) DecrEx(key string, seconds int) int64 {
// 通过get做失效
_, _ = m.get(key)
rs := m.set(key, nil, seconds, false, Op{
incrBy: struct {
enable bool
delta int
}{enable: true, delta: -1},
})
return Int64(rs)
}
// decrease key by n
func (m *Map) DecrBy(key string, n int) int64 {
// 通过get做失效
_, _ = m.get(key)
rs := m.set(key, nil, -1, false, Op{
incrBy: struct {
enable bool
delta int
}{enable: true, delta: -n},
})
return Int64(rs)
}
// decrease key by n with expired seconds
func (m *Map) DecrByEx(key string, n int, seconds int) int64 {
// 通过get做失效
_, _ = m.get(key)
rs := m.set(key, nil, seconds, false, Op{
incrBy: struct {
enable bool
delta int
}{enable: true, delta: -n},
})
return Int64(rs)
}
func (m *Map) Get(key string) (interface{}, bool) {
return m.get(key)
}
// If key is expired or not existed, return nil
func (m *Map) get(key string) (interface{}, bool) {
// Get过程中。
// m 必须在mod保护态下,才能get
// dirty不论何时,都可以被get
m.modl.RLock()
var shouldRUnlock bool = true
defer func() {
if shouldRUnlock {
m.modl.RUnlock()
}
}()
// m free时,读取m
if m.isFree2WrapedBymodl() {
return getFrom(m.l, m.m, key)
}
m.modl.RUnlock()
shouldRUnlock = false
return getFrom(m.dl, m.dirty, key)
//// m繁忙时,读取dirty
//if m.isBusyWrapedBymodl() {
// return getFrom(m.dl, m.dirty, key)
//}
//
//// m 处于迁移中,读取dir
//if m.isFree1WrapedBymodl() {
// return getFrom(m.dl, m.dirty, key)
//}
return nil, false
}
// Delete todo, bug delete fail
func (m *Map) Delete(key string) {
offset := m.offsetIncr()
ext := time.Now().UnixNano()
m.modl.RLock()
defer m.modl.RUnlock()
if m.isFree2WrapedBymodl() {
deletem(m.l, m.m, key, ext)
func(ext int64) {
//fmt.Printf("del dir %s \n", key)
deletem(m.dl, m.dirty, key, ext)
// deletem(m.wl, m.write, key, ext)
}(ext)
return
}
if m.isFree1WrapedBymodl() {
// free1时,m1不能提供使用
func() {
m.deltal.RLock()
deletem(m.l, m.m, key, ext)
m.deltal.RUnlock()
}()
func() {
// deletem(m.wl, m.write, key, ext)
deletem(m.dl, m.dirty, key, ext)
}()
return
}
// deletem(m.wl, m.write, key, ext)
// busy时,要删除dir, 并且追加命令进del
deletem(m.dl, m.dirty, key, ext)
setm(m.dll, m.del, key, "waiting-deleted", ext, offset, -1, false)
}
func (m *Map) Detail() mapView {
var listMaxNum = 10
var flag = 0
mv := mapView{
M: make(map[string]interface{}),
Dirty: make(map[string]interface{}),
Del: make(map[string]interface{}),
Write: make(map[string]interface{}),
}
mv.Offset = m.offset
m.l.RLock()
for k, _ := range m.m {
flag++
mv.M[k] = m.m[k].detail()
if flag > listMaxNum {
mv.M["reach-max-detail"] = "end"
break
}
}
m.l.RUnlock()
m.dl.RLock()
flag = 0
for k, _ := range m.dirty {
mv.Dirty[k] = m.dirty[k].detail()
flag++
if flag > listMaxNum {
mv.Dirty["reach-max-detail"] = "end"
break
}
}
m.dl.RUnlock()
m.wl.RLock()
flag = 0
for k, _ := range m.write {
mv.Write[k] = m.write[k].detail()
flag++
if flag > listMaxNum {
mv.Write["reach-max-detail"] = "end"
break
}
}
m.wl.RUnlock()
flag = 0
m.dll.RLock()
for k, _ := range m.del {
mv.Del[k] = m.del[k].detail()
flag++
if flag > listMaxNum {
mv.Del["reach-max-detail"] = "end"
break
}
}
m.dll.RUnlock()
return mv
}
func (m *Map) DetailOf(key string) mapView {
mv := mapView{
Mode: m.mode,
M: make(map[string]interface{}),
Dirty: make(map[string]interface{}),
Del: make(map[string]interface{}),
Write: make(map[string]interface{}),
}
m.gRLock()
defer m.gRUnlock()
mv.M = m.m[key].detail()
mv.Dirty = m.dirty[key].detail()
mv.Del = m.del[key].detail()
mv.Write = m.write[key].detail()
return mv
}
func (m *Map) PrintDetail() string {
b, e := json.MarshalIndent(m.Detail(), "", " ")
if e != nil {
fmt.Println(e.Error())
return ""
}
fmt.Println(string(b))
return string(b)
}
func (m *Map) PrintDetailOf(key string) string {
b, e := json.MarshalIndent(m.DetailOf(key), "", " ")
if e != nil {
fmt.Println(e.Error())
return ""
}
return string(b)
}
func getFrom(l *sync.RWMutex, m map[string]Value, key string) (interface{}, bool) {
l.RLock()
value, ok := m[key]
l.RUnlock()
if !ok {
return nil, false
}
if value.exp == -1 {
return value.v, true
}
if time.Now().UnixNano() >= value.exp {
l.Lock()
delete(m, key)
l.Unlock()
return nil, false
}
return value.v, true
}
func (m *Map) setBusy() {
m.modl.Lock()
defer m.modl.Unlock()
m.mode = M_BUSY
// m.gUnlock()
}
func (m *Map) setFree1() {
m.modl.Lock()
defer m.modl.Unlock()
m.mode = M_FREE1
}
func (m *Map) setFree2() {
m.modl.Lock()
defer m.modl.Unlock()
m.mode = M_FREE2
}
// Returns Map.m real length, not m.dirty or m.write.
func (m *Map) Len() int {
m.l.RLock()
length := len(m.m)
m.l.RUnlock()
return length
}
// ClearExpireKeys clear expired keys, and it will not influence map write and read.
// When call m.ClearExpireKeys(), first will set m.mode=M_BUSY.
// At this moment, operation of write to Map.m is denied and instead data will be writen to Map.write which will sync to Map.m after clear job done.
// operation of read will use Map.dirty.
// After clear job has been done, Map.dirty will be cleared and copy from Map.m, Map.write will be unwritenable and data in Map.write will sync to Map.m.
func (m *Map) ClearExpireKeys() int {
// 利用atomic,确保高并发下,只会有一个ClearExpireKeys被执行
v := atomic.AddInt32(&m.clearing, 1)
defer atomic.AddInt32(&m.clearing, -1)
if v != 1 {
return 0
}
// 将模式切到busy下
// 因为在读写删进行时,mod是禁切换的。
// 所以能够切到busy,必然是读写删都在入口阻住了。
m.setBusy()
// 置为busy时,读写删自动放行。读取写入删除都切换到对应的模式。m此时将保持不对外不可用
n := m.clearExpireKeys()
m.modl.Lock()
m.mode = M_FREE1
m.deltal.Lock()
m.l.Lock()
m.wl.RLock()
for k, v := range m.write {
v2, ok := m.m[k]
if !ok {
m.m[k] = v
} else {
if v2.LatterThan(v) {
continue
}
}
}
m.wl.RUnlock()
m.l.Unlock()
// sync deleted operation from Map.del
m.l.Lock()
m.dll.RLock()
for k, v := range m.del {
v2, ok := m.m[k]
if !ok {
continue
}
if v.LatterThan(v2) {
delete(m.m, k)
}
}
m.dll.RUnlock()
m.l.Unlock()
m.deltal.Unlock()
m.modl.Unlock()
m.setFree2()
// 进入free2时,清理write和del,dir
m.dll.Lock()
m.del = make(map[string]Value)
m.dll.Unlock()
m.wl.Lock()
m.write = make(map[string]Value)
m.wl.Unlock()
clearExpire(m.dl, m.dirty)
return n
}
// Change to busy mode, now dirty provides read, write provides write, del provides delete.
// After clear expired keys in m, m will change into free auto..ly.
// in free mode, m.del and m.write will not provides read nor write, m.dirty will not read.
func (m *Map) clearExpireKeys() int {
return m.clearExpireKeysWithDepth(-1)
}
// Change to busy mode, now dirty provides read, write provides write, del provides delete.
// After clear expired keys in m, m will change into free auto..ly.
// in free mode, m.del and m.write will not provides read nor write, m.dirty will not read.
func (m *Map) clearExpireKeysWithDepth(depth int) int {
var num int
// keys should be deleted
var shouldDelete = make([]string, 0, len(m.m))
m.l.RLock()
var offset int
L:
for k, v := range m.m {
if v.exp == -1 {
continue
}
if v.exp < time.Now().UnixNano() {
shouldDelete = append(shouldDelete, k)
// If hit depth of delete times, will stop range
offset++
if depth > 0 && offset >= depth {
break L
}
}
}
m.l.RUnlock()
m.l.Lock()
for _, v := range shouldDelete {
delete(m.m, v)
num++
}
m.l.Unlock()
return num
}
// MLen
func (m *Map) MLen() int {
m.l.RLock()
leng := len(m.m)
m.l.RUnlock()
return leng
}
// range function returns bool value
// if false, will stop range process
func (m *Map) Range(f func(key string, value interface{}) bool) {
if m.IsFree2() {
rangem(m.l, m.m, f)
} else {
rangem(m.dl, m.dirty, f)
}
}
// RealLength returns cmap's real length.
// If it's busy, it returns length of dirty
// If free, returns length of m
func (m *Map) RealLength() int {
if m.IsBusy() {
return lengthOf(m.l, m.m)
}
return lengthOf(m.dl, m.dirty)
}
func rangem(l *sync.RWMutex, mp map[string]Value, f func(key string, value interface{}) bool) {
l.RLock()
defer l.RUnlock()
for k, v := range mp {
if !f(k, v.v) {
break
}
}
}
func lengthOf(l *sync.RWMutex, mp map[string]Value) int {
l.RLock()
defer l.RUnlock()
return len(mp)
}
func clearExpire(l *sync.RWMutex, m map[string]Value) int {
var shouldDelete = make([]string, 0, 10)
l.RLock()
for k, v := range m {
if v.isExpire() {
shouldDelete = append(shouldDelete, k)
}
}
l.RUnlock()
l.Lock()
for _, v := range shouldDelete {
delete(m, v)
}
l.Unlock()
return len(shouldDelete)
}
func setm(l *sync.RWMutex, m map[string]Value, key string, value interface{}, ext int64, offset int64, exp int64, nx bool) {
l.Lock()
defer l.Unlock()
newValue := Value{
v: value,
exp: exp,
execAt: ext,
offset: offset,
}
v, exist := m[key]
// 当未过期,并且已存在时,nx不操作
if exist && !v.isExpire() && nx == true {
return
}
// 不存在时,设置新值
if !exist {
m[key] = newValue
return
}
// 已失效时,设置新值
if v.isExpire() {
m[key] = newValue
return
}
// 比新key后执行,则设置新值
if v.FormerThan(newValue) {
m[key] = newValue
return
}
// 否则不操作
return
}
func deletem(l *sync.RWMutex, m map[string]Value, key string, ext int64) {
l.RLock()
_, exist := m[key]
l.RUnlock()
if !exist {
return
}
l.Lock()
delete(m, key)
l.Unlock()
//if v.isExpire() {
// delete(m, key)
// return
//}
//
//// 存储值的执行时间,小于ext时,才允许删。大于时,不能删
//if v.execAt < ext {
// delete(m, key)
// return
//}
return
}
func (m *Map) mirrorOf(key string) (interface{}, bool) {