generated from ipfs/ipfs-repository-template
-
Notifications
You must be signed in to change notification settings - Fork 89
/
sessioninterestmanager.go
201 lines (172 loc) · 5.6 KB
/
sessioninterestmanager.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
package sessioninterestmanager
import (
"sync"
blocks "github.com/ipfs/go-block-format"
cid "github.com/ipfs/go-cid"
)
// SessionInterestManager records the CIDs that each session is interested in.
type SessionInterestManager struct {
lk sync.RWMutex
wants map[cid.Cid]map[uint64]bool
}
// New initializes a new SessionInterestManager.
func New() *SessionInterestManager {
return &SessionInterestManager{
// Map of cids -> sessions -> bool
//
// The boolean indicates whether the session still wants the block
// or is just interested in receiving messages about it.
//
// Note that once the block is received the session no longer wants
// the block, but still wants to receive messages from peers who have
// the block as they may have other blocks the session is interested in.
wants: make(map[cid.Cid]map[uint64]bool),
}
}
// When the client asks the session for blocks, the session calls
// RecordSessionInterest() with those cids.
func (sim *SessionInterestManager) RecordSessionInterest(ses uint64, ks []cid.Cid) {
sim.lk.Lock()
defer sim.lk.Unlock()
// For each key
for _, c := range ks {
// Record that the session wants the blocks
if want, ok := sim.wants[c]; ok {
want[ses] = true
} else {
sim.wants[c] = map[uint64]bool{ses: true}
}
}
}
// When the session shuts down it calls RemoveSessionInterest().
// Returns the keys that no session is interested in any more.
func (sim *SessionInterestManager) RemoveSession(ses uint64) []cid.Cid {
sim.lk.Lock()
defer sim.lk.Unlock()
// The keys that no session is interested in
deletedKs := make([]cid.Cid, 0)
// For each known key
for c := range sim.wants {
// Remove the session from the list of sessions that want the key
delete(sim.wants[c], ses)
// If there are no more sessions that want the key
if len(sim.wants[c]) == 0 {
// Clean up the list memory
delete(sim.wants, c)
// Add the key to the list of keys that no session is interested in
deletedKs = append(deletedKs, c)
}
}
return deletedKs
}
// When the session receives blocks, it calls RemoveSessionWants().
func (sim *SessionInterestManager) RemoveSessionWants(ses uint64, ks []cid.Cid) {
sim.lk.Lock()
defer sim.lk.Unlock()
// For each key
for _, c := range ks {
// If the session wanted the block
if wanted, ok := sim.wants[c][ses]; ok && wanted {
// Mark the block as unwanted
sim.wants[c][ses] = false
}
}
}
// When a request is cancelled, the session calls RemoveSessionInterested().
// Returns the keys that no session is interested in any more.
func (sim *SessionInterestManager) RemoveSessionInterested(ses uint64, ks []cid.Cid) []cid.Cid {
sim.lk.Lock()
defer sim.lk.Unlock()
// The keys that no session is interested in
deletedKs := make([]cid.Cid, 0, len(ks))
// For each key
for _, c := range ks {
// If there is a list of sessions that want the key
if _, ok := sim.wants[c]; ok {
// Remove the session from the list of sessions that want the key
delete(sim.wants[c], ses)
// If there are no more sessions that want the key
if len(sim.wants[c]) == 0 {
// Clean up the list memory
delete(sim.wants, c)
// Add the key to the list of keys that no session is interested in
deletedKs = append(deletedKs, c)
}
}
}
return deletedKs
}
// The session calls FilterSessionInterested() to filter the sets of keys for
// those that the session is interested in
func (sim *SessionInterestManager) FilterSessionInterested(ses uint64, ksets ...[]cid.Cid) [][]cid.Cid {
sim.lk.RLock()
defer sim.lk.RUnlock()
// For each set of keys
kres := make([][]cid.Cid, len(ksets))
for i, ks := range ksets {
// The set of keys that at least one session is interested in
has := make([]cid.Cid, 0, len(ks))
// For each key in the list
for _, c := range ks {
// If there is a session that's interested, add the key to the set
if _, ok := sim.wants[c][ses]; ok {
has = append(has, c)
}
}
kres[i] = has
}
return kres
}
// When bitswap receives blocks it calls SplitWantedUnwanted() to discard
// unwanted blocks
func (sim *SessionInterestManager) SplitWantedUnwanted(blks []blocks.Block) ([]blocks.Block, []blocks.Block) {
sim.lk.RLock()
defer sim.lk.RUnlock()
// Get the wanted block keys as a set
wantedKs := cid.NewSet()
for _, b := range blks {
c := b.Cid()
// For each session that is interested in the key
for ses := range sim.wants[c] {
// If the session wants the key (rather than just being interested)
if wanted, ok := sim.wants[c][ses]; ok && wanted {
// Add the key to the set
wantedKs.Add(c)
}
}
}
// Separate the blocks into wanted and unwanted
wantedBlks := make([]blocks.Block, 0, len(blks))
notWantedBlks := make([]blocks.Block, 0)
for _, b := range blks {
if wantedKs.Has(b.Cid()) {
wantedBlks = append(wantedBlks, b)
} else {
notWantedBlks = append(notWantedBlks, b)
}
}
return wantedBlks, notWantedBlks
}
// When the SessionManager receives a message it calls InterestedSessions() to
// find out which sessions are interested in the message.
func (sim *SessionInterestManager) InterestedSessions(blks []cid.Cid, haves []cid.Cid, dontHaves []cid.Cid) []uint64 {
sim.lk.RLock()
defer sim.lk.RUnlock()
ks := make([]cid.Cid, 0, len(blks)+len(haves)+len(dontHaves))
ks = append(ks, blks...)
ks = append(ks, haves...)
ks = append(ks, dontHaves...)
// Create a set of sessions that are interested in the keys
sesSet := make(map[uint64]struct{})
for _, c := range ks {
for s := range sim.wants[c] {
sesSet[s] = struct{}{}
}
}
// Convert the set into a list
ses := make([]uint64, 0, len(sesSet))
for s := range sesSet {
ses = append(ses, s)
}
return ses
}