-
Notifications
You must be signed in to change notification settings - Fork 0
/
DS.go
165 lines (133 loc) · 2.96 KB
/
DS.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
package reader
import (
"github.com/emirpasic/gods/maps/treemap"
"github.com/cespare/xxhash"
"strings"
"bytes"
"encoding/binary"
"github.com/emirpasic/gods/sets/treeset"
"strconv"
)
/*
type KV struct {
Key string
value string
}
*/
type KHV struct {
Key string
Hash uint64
Size uint32
}
type ReceiverData struct {
queue *treeset.Set
keyMap *treemap.Map
keyRemoved *treeset.Set
}
type DeltaReceiver struct {
DB int
DBtype int
StartVersion uint64
//
DrainVer <-chan VersionData // for final database replication
//
//
NotifyVer chan<- string // for versionable database replication
pubsubver *PubSubVersion
//
//
pubsubstr *PubSubStr
DrainString chan<- string // for non-versionless databases replication
}
func (r *DeltaReceiver) SubscribeVersions(sname string) <-chan VersionData {
ch := make(chan VersionData, 1)
r.pubsubver.AddSubscriber(ch, sname)
return ch
}
func (r *DeltaReceiver) SubscribeKeys(sname string) <-chan string {
ch := make(chan string)
r.pubsubstr.AddSubscriber(ch, sname)
return ch
}
const srQueue = 10
func (r *DeltaReceiver) Init(so ServerOptions, dbt int, ver uint64) {
DB := so.DB
r.DB = DB
r.DBtype = dbt
r.StartVersion = ver
ch2 := make(chan string)
ch1 := make(chan VersionData)
r.DrainVer = ch1
r.pubsubver = &PubSubVersion{}
r.pubsubver.InitPubSub(r.DrainVer, "RV "+strconv.Itoa(DB))
if dbt == 0 {
r.NotifyVer = ch2
go ReadVersionDelta(so, ch2, ch1, ver) // start delta readers
} else {
r.pubsubstr = &PubSubStr{}
r.pubsubstr.InitPubSub(ch2, "RS "+strconv.Itoa(DB))
r.DrainString = ch2
}
}
func bySizeAndKey(a, b interface{}) int {
// Type assertion, program will panic if this is not respected
c1 := a.(KHV)
c2 := b.(KHV)
switch {
case c1.Size < c2.Size:
return 1
case c1.Size > c2.Size:
return -1
case c1.Hash < c2.Hash:
return 1
case c1.Hash > c2.Hash:
return -1
default:
return strings.Compare(c1.Key, c2.Key)
}
}
func (r *ReceiverData) Init(DB int) {
r.queue = treeset.NewWith(bySizeAndKey)
r.keyMap = treemap.NewWithStringComparator()
r.keyRemoved = treeset.NewWithStringComparator()
}
func (r *ReceiverData) Add(k string, v string) {
if r.keyRemoved.Contains(k) {
r.keyRemoved.Remove(k)
} else {
pk := KHV{Key: k, Hash: xxhash.Sum64String(v), Size: uint32(len(v))}
r.queue.Add(pk)
}
}
func (r *ReceiverData) Delete(k string) {
pkv, found := r.keyMap.Get(k)
if found {
r.queue.Remove(pkv)
} else {
r.keyRemoved.Remove(k)
}
}
func (r *ReceiverData) Consume(buf *bytes.Buffer, maxChunk int) uint32 {
da := make([]*KHV, 0)
qi := r.queue.Iterator()
var c uint32
c = 0
maxc := uint32(maxChunk)
for qi.Next() && c < maxc {
value := qi.Value().(KHV)
da = append(da, &value)
c++
}
binary.Write(buf, binary.BigEndian, c)
for _, v := range da {
//
// msg:=sendrecv.Msg{}
binary.Write(buf, binary.BigEndian, v.Key)
binary.Write(buf, binary.BigEndian, v.Hash)
//
r.keyMap.Remove(v.Key)
r.queue.Remove(*v)
//
}
return c
}