generated from ipfs/ipfs-repository-template
-
Notifications
You must be signed in to change notification settings - Fork 83
/
peer_ledger.go
156 lines (134 loc) · 3.05 KB
/
peer_ledger.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
package decision
import (
wl "github.com/ipfs/boxo/bitswap/client/wantlist"
pb "github.com/ipfs/boxo/bitswap/message/pb"
"github.com/ipfs/go-cid"
"github.com/libp2p/go-libp2p/core/peer"
)
type peerLedger struct {
// thoses two maps are inversions of each other
peers map[peer.ID]map[cid.Cid]entry
cids map[cid.Cid]map[peer.ID]entry
}
func newPeerLedger() *peerLedger {
return &peerLedger{
peers: make(map[peer.ID]map[cid.Cid]entry),
cids: make(map[cid.Cid]map[peer.ID]entry),
}
}
func (l *peerLedger) Wants(p peer.ID, e wl.Entry) {
cids, ok := l.peers[p]
if !ok {
cids = make(map[cid.Cid]entry)
l.peers[p] = cids
}
cids[e.Cid] = entry{e.Priority, e.WantType}
m, ok := l.cids[e.Cid]
if !ok {
m = make(map[peer.ID]entry)
l.cids[e.Cid] = m
}
m[p] = entry{e.Priority, e.WantType}
}
// CancelWant returns true if the cid was present in the wantlist.
func (l *peerLedger) CancelWant(p peer.ID, k cid.Cid) bool {
wants, ok := l.peers[p]
if !ok {
return false
}
delete(wants, k)
if len(wants) == 0 {
delete(l.peers, p)
}
l.removePeerFromCid(p, k)
return true
}
// CancelWantWithType will not cancel WantBlock if we sent a HAVE message.
func (l *peerLedger) CancelWantWithType(p peer.ID, k cid.Cid, typ pb.Message_Wantlist_WantType) {
wants, ok := l.peers[p]
if !ok {
return
}
e, ok := wants[k]
if !ok {
return
}
if typ == pb.Message_Wantlist_Have && e.WantType == pb.Message_Wantlist_Block {
return
}
delete(wants, k)
if len(wants) == 0 {
delete(l.peers, p)
}
l.removePeerFromCid(p, k)
}
func (l *peerLedger) removePeerFromCid(p peer.ID, k cid.Cid) {
m, ok := l.cids[k]
if !ok {
return
}
delete(m, p)
if len(m) == 0 {
delete(l.cids, k)
}
}
type entryForPeer struct {
Peer peer.ID
entry
}
type entry struct {
Priority int32
WantType pb.Message_Wantlist_WantType
}
func (l *peerLedger) Peers(k cid.Cid) []entryForPeer {
m, ok := l.cids[k]
if !ok {
return nil
}
peers := make([]entryForPeer, 0, len(m))
for p, e := range m {
peers = append(peers, entryForPeer{p, e})
}
return peers
}
func (l *peerLedger) CollectPeerIDs() []peer.ID {
peers := make([]peer.ID, 0, len(l.peers))
for p := range l.peers {
peers = append(peers, p)
}
return peers
}
func (l *peerLedger) WantlistSizeForPeer(p peer.ID) int {
return len(l.peers[p])
}
func (l *peerLedger) WantlistForPeer(p peer.ID) []wl.Entry {
cids, ok := l.peers[p]
if !ok {
return nil
}
entries := make([]wl.Entry, 0, len(l.cids))
for c, e := range cids {
entries = append(entries, wl.Entry{
Cid: c,
Priority: e.Priority,
WantType: e.WantType,
})
}
return entries
}
// ClearPeerWantlist does not take an effort to fully erase it from memory.
// This is intended when the peer is still connected and the map capacity could
// be reused. If the memory should be freed use PeerDisconnected instead.
func (l *peerLedger) ClearPeerWantlist(p peer.ID) {
cids, ok := l.peers[p]
if !ok {
return
}
for c := range cids {
l.removePeerFromCid(p, c)
}
}
func (l *peerLedger) PeerDisconnected(p peer.ID) {
l.ClearPeerWantlist(p)
delete(l.peers, p)
}