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
|
/* This software was written by Dirk Engling <erdgeist@erdgeist.org>
It is considered beerware. Prost. Skol. Cheers or whatever. */
/* System */
#include <poll.h>
#include <pthread.h>
#include <stdio.h>
#include <string.h>
#include <unistd.h>
/* Opentracker */
#include "ot_accesslist.h"
#include "ot_clean.h"
#include "ot_mutex.h"
#include "ot_stats.h"
#include "ot_vector.h"
#include "trackerlogic.h"
ot_time g_empty_torrent_timeout = OT_TORRENT_TIMEOUT;
/* Returns amount of removed peers */
static ssize_t clean_single_bucket(ot_peer *peers, size_t peer_count, size_t peer_size, time_t timedout, size_t *removed_seeders) {
ot_peer *last_peer, *insert_point;
if (!peer_count)
return 0;
last_peer = peers + peer_count * peer_size;
/* Two scan modes: unless there is one peer removed, just increase ot_peertime */
while (peers < last_peer) {
time_t timediff = timedout + OT_PEERTIME(peers, peer_size);
if (timediff >= OT_PEER_TIMEOUT)
break;
OT_PEERTIME(peers, peer_size) = timediff;
peers += peer_size;
}
/* If we at least remove one peer, we have to copy */
for (insert_point = peers; peers < last_peer; peers += peer_size) {
time_t timediff = timedout + OT_PEERTIME(peers, peer_size);
if (timediff < OT_PEER_TIMEOUT) {
OT_PEERTIME(peers, peer_size) = timediff;
memcpy(insert_point, peers, peer_size);
insert_point += peer_size;
} else if (OT_PEERFLAG_D(peers, peer_size) & PEER_FLAG_SEEDING)
(*removed_seeders)++;
}
return (peers - insert_point) / peer_size;
}
/* Age one family's peers by timedout minutes. Releases and zeroes the vector
once its last peer is gone, so an empty family costs nothing. */
static void clean_family_vector(ot_vector *peer_vector, size_t peer_size, ot_time timedout, size_t *removed_seeders) {
ot_vector *bucket = peer_vector;
size_t num_buckets = 1, peer_count;
if (OT_VECTOR_HASBUCKETS(peer_vector)) {
num_buckets = peer_vector->size;
bucket = (ot_vector *)peer_vector->data;
}
while (num_buckets--) {
size_t removed_peers = clean_single_bucket(bucket->data, bucket->size, peer_size, timedout, removed_seeders);
bucket->size -= removed_peers;
if (removed_peers)
vector_fixup_peers(bucket, peer_size);
/* Skip to next bucket, a vector containing peers */
++bucket;
}
peer_count = vector_peer_count(peer_vector);
/* Run dry: release the family (a collapsed bucket list or a plain vector) */
if (!peer_count) {
free_peer_vector(peer_vector);
memset(peer_vector, 0, sizeof(*peer_vector));
return;
}
/* See if we need to convert the vector from simple to bucket list or back */
if ((peer_count > OT_PEER_BUCKET_MINCOUNT) || OT_VECTOR_HASBUCKETS(peer_vector))
vector_redistribute_buckets(peer_vector, peer_size, peer_count);
}
/* Clean a single torrent
return 1 if torrent timed out
*/
int clean_single_torrent(ot_torrent *torrent) {
ot_time timedout = time_since_minutes(torrent->base);
ot_peerlist *peer_list = torrent->peer_list;
size_t removed_seeders = 0;
/* Touched since the last sweep: nothing to do */
if (!timedout)
return 0;
/* Torrent has idled out */
if (timedout > OT_TORRENT_TIMEOUT)
return 1;
/* Already empty and nothing arrived before the peer timeout: keep it only
while a down count is worth remembering */
if (timedout > OT_PEER_TIMEOUT && !peer_list)
return (torrent->down_count && timedout <= g_empty_torrent_timeout) ? 0 : 1;
/* Peers past the peer timeout are gone regardless, which caps how far the
lists are aged in this pass */
if (timedout > OT_PEER_TIMEOUT)
timedout = OT_PEER_TIMEOUT;
if (peer_list) {
clean_family_vector(&peer_list->peers6, OT_PEER_SIZE6, timedout, &removed_seeders);
clean_family_vector(&peer_list->peers4, OT_PEER_SIZE4, timedout, &removed_seeders);
peer_list->seed_count -= removed_seeders;
/* Both families gone: drop the peerlist, the torrent keeps only its count */
if (!vector_peer_count(&peer_list->peers6) && !vector_peer_count(&peer_list->peers4)) {
free_peerlist(peer_list);
torrent->peer_list = peer_list = NULL;
}
}
if (peer_list)
torrent->base = time_now_minutes(); /* still carrying peers */
else {
/* Fell empty: hold base a peer timeout back so a later idle sweep makes
the keep-or-drop decision above */
ot_time now = time_now_minutes();
torrent->base = now > OT_PEER_TIMEOUT ? (uint32_t)(now - OT_PEER_TIMEOUT) : 0;
}
return 0;
}
/* Written to once, by clean_deinit, and never read: the byte stays in and
every sleep after it returns at once */
static int g_clean_pipe[2] = {-1, -1};
static void clean_sleep(void) {
struct pollfd pfd;
pfd.fd = g_clean_pipe[0];
pfd.events = POLLIN;
pfd.revents = 0;
poll(&pfd, 1, OT_CLEAN_SLEEP / 1000);
}
/* Clean up all peers in one bucket, remove timedout pools and torrents */
static void clean_bucket(size_t bucket) {
ot_vector *torrents_list = mutex_bucket_lock((int)bucket);
size_t toffs;
int delta_torrentcount = 0;
for (toffs = 0; toffs < torrents_list->size; ++toffs) {
ot_torrent *torrent = ((ot_torrent *)(torrents_list->data)) + toffs;
if (clean_single_torrent(torrent)) {
vector_remove_torrent(torrents_list, torrent);
--delta_torrentcount;
--toffs;
}
}
mutex_bucket_unlock((int)bucket, delta_torrentcount);
}
static void *clean_worker(void *args) {
(void)args;
while (1) {
size_t bucket = OT_BUCKET_COUNT;
while (bucket) {
size_t todo = bucket < OT_CLEAN_BUCKETS_PER_WAKE ? bucket : OT_CLEAN_BUCKETS_PER_WAKE;
/* One bucket is locked at a time, however many a wake gets through */
while (todo--)
clean_bucket(--bucket);
if (!g_opentracker_running)
return NULL;
clean_sleep();
}
stats_cleanup();
#ifdef WANT_ACCESSLIST
accesslist_cleanup();
#endif
}
return NULL;
}
static pthread_t thread_id;
void clean_init(void) {
if (pipe(g_clean_pipe) == -1)
fprintf(stderr, "Warning: the cleaner has no pipe to be woken through and will take up to one sleep interval to stop.\n");
pthread_create(&thread_id, NULL, clean_worker, NULL);
}
void clean_deinit(void) {
const char byte = 0;
(void)!write(g_clean_pipe[1], &byte, 1);
pthread_join(thread_id, NULL);
close(g_clean_pipe[0]);
close(g_clean_pipe[1]);
}
|
