forked from libswift/libswift
-
Notifications
You must be signed in to change notification settings - Fork 0
/
avail.cpp
239 lines (197 loc) · 4.33 KB
/
avail.cpp
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
/*
* availability.h
* Tree keeping track of the availability of each bin in a swarm
*
* Created by Riccardo Petrocco
* Copyright 2009-2012 Delft University of Technology. All rights reserved.
*
*/
#include "swift.h"
using namespace swift;
#define DEBUGAVAILABILITY 0
uint8_t Availability::get(const bin_t bin)
{
if (bin.is_none())
return 255;
else if (size_)
return avail_[bin.toUInt()];
return 0;
}
void Availability::setBin(bin_t bin)
{
if (bin != bin_t::NONE)
{
bin_t beg = bin.base_left();
bin_t end = bin.base_right();
for (int i = beg.toUInt(); i<=end.toUInt(); i++)
{
// for the moment keep a counter
// TODO make it percentage
avail_[i]++;
}
}
}
void Availability::removeBin(bin_t bin)
{
bin_t beg = bin.base_left();
bin_t end = bin.base_right();
for (int i = beg.toUInt(); i<=end.toUInt(); i++)
{
avail_[i]--;
}
}
void Availability::setBinmap(binmap_t * binmap)
{
if (binmap->is_filled())
for (int i=0; i<size_; i++)
avail_[i]++;
else
if (!binmap->is_empty())
{
//status();
bin_t tmp_b;
binmap_t tmp_bm;
tmp_b = binmap_t::find_complement(tmp_bm, *binmap, 0);
while (tmp_b != bin_t::NONE)
{
setBin(tmp_b);
//binmap_t::copy(tmp_bm, *binmap, tmp_b);
tmp_bm.set(tmp_b);
tmp_b = binmap_t::find_complement(tmp_bm, *binmap, 0);
}
//status();
}
return;
}
void Availability::removeBinmap(binmap_t &binmap)
{
if (binmap.is_filled())
for (int i=0; i<size_; i++)
avail_[i]--;
else
if (!binmap.is_empty())
{
bin_t tmp_b;
binmap_t tmp_bm;
tmp_b = binmap_t::find_complement(tmp_bm, binmap, 0);
while (tmp_b != bin_t::NONE)
{
removeBin(tmp_b);
tmp_bm.set(tmp_b);
tmp_b = binmap_t::find_complement(tmp_bm, binmap, 0);
}
}
return;
}
void Availability::set(uint32_t channel_id, binmap_t& binmap, bin_t target)
{
if (DEBUGAVAILABILITY)
{
dprintf("%s #%u Availability -> setting %s (%llu)\n",tintstr(),channel_id,target.str().c_str(),target.toUInt());
}
if (size_>0 && !binmap.is_filled(target))
{
bin_t beg = target.base_left();
bin_t end = target.base_right();
for (int i = beg.toUInt(); i<=end.toUInt(); i++)
{
// for the moment keep a counter
// TODO make it percentage
if (!binmap.is_filled(bin_t(i)))
avail_[i]++;
//TODO avoid running into sub-trees that r filled
}
}
// keep track of the incoming have msgs
else
{
for (WaitingPeers::iterator vpci = waiting_peers_.begin(); vpci != waiting_peers_.end(); ++vpci)
{
if (vpci->first == channel_id)
{
waiting_peers_.erase(vpci);
break;
}
}
waiting_peers_.push_back(std::make_pair(channel_id, &binmap));
}
}
void Availability::remove(uint32_t channel_id, binmap_t& binmap)
{
if (DEBUGAVAILABILITY)
{
dprintf("%s #%u Availability -> removing peer\n",tintstr(),channel_id);
}
if (size_<=0)
{
WaitingPeers::iterator vpci = waiting_peers_.begin();
for(; vpci != waiting_peers_.end(); ++vpci)
{
if (vpci->first == channel_id)
{
waiting_peers_.erase(vpci);
break;
}
}
}
else
removeBinmap(binmap);
// remove the binmap from the availability
return;
}
void Availability::setSize(uint64_t size)
{
if (size && !size_)
{
// TODO can be optimized (bithacks)
uint64_t r = 0;
uint64_t s = size;
// check if the binmap is not complete
if (s & (s-1))
{
while (s >>= 1)
{
r++;
}
s = 1<<(r+1);
}
// consider higher layers
s += s-1;
size_ = s;
avail_ = new uint8_t[s]();
// Initialize with the binmaps we already received
for(WaitingPeers::iterator vpci = waiting_peers_.begin(); vpci != waiting_peers_.end(); ++vpci)
{
setBinmap(vpci->second);
}
if (DEBUGAVAILABILITY)
{
dprintf("%s #1 Availability -> setting size in chunk %llu \t avail size %lu\n",tintstr(), size, s);
}
}
}
bin_t Availability::getRarest(const bin_t range, int width)
{
assert(range.toUInt()<size_);
bin_t curr = range;
bin_t::uint_t idx = range.toUInt();
while (curr.base_length()>width)
{
idx = curr.toUInt();
if ( avail_[curr.left().toUInt()] <= avail_[curr.right().toUInt()] )
curr.to_left();
else
curr.to_right();
}
return curr;
}
void Availability::status() const
{
printf("availability:\n");
if (size_ > 0)
{
for (int i = 0; i < size_; i++)
printf("%d", avail_[i]);
}
printf("\n");
}