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
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
|
// THIS REALLY BELONGS INTO A HEADER FILE
//
//
#include <stdlib.h>
#include <string.h>
#include <stdio.h>
#include <fcntl.h>
#include <sys/types.h>
#include <sys/mman.h>
#include <unistd.h>
#include <time.h>
/* Should be called BYTE, WORD, DWORD - but some OSs already have that and there's no #iftypedef */
/* They mark memory used as data instead of integer or human readable string -
they should be cast before used as integer/text */
typedef unsigned char ot_byte;
typedef unsigned short ot_word;
typedef unsigned long ot_dword;
typedef unsigned long ot_time;
typedef ot_byte ot_hash[20];
typedef ot_byte ot_ip[ 4/*0*/ ];
// tunables
const unsigned long OT_TIMEOUT = 2700;
const unsigned long OT_HUGE_FILESIZE = 1024*1024*256; // Thats 256MB per file, enough for 204800 peers of 128 bytes
#define OT_COMPACT_ONLY
#define MEMMOVE memmove
#define BZERO bzero
#define FORMAT_FIXED_STRING sprintf
#define FORMAT_FORMAT_STRING sprintf
#define BINARY_FIND binary_search
#define NOW time(NULL)
typedef struct ot_peer {
#ifndef OT_COMPACT_ONLY
ot_hash id;
ot_hash key;
#endif
ot_ip ip;
ot_word port;
ot_time death;
ot_byte flags;
} *ot_peer;
ot_byte PEER_FLAG_SEEDING = 0x80;
ot_byte PEER_IP_LENGTH_MASK = 0x3f;
typedef struct {
ot_hash hash;
ot_peer peer_list;
unsigned long peer_count;
unsigned long seed_count;
} *ot_torrent;
void *map_file( char *file_name );
void unmap_file( char *file_name, void *map, unsigned long real_size );
// This behaves quite like bsearch but allows to find
// the insertion point for inserts after unsuccessful searches
// in this case exactmatch is 0 on exit
//
void *binary_search( const void *key, const void *base,
const unsigned long member_count, const unsigned long member_size,
int (*compar) (const void *, const void *),
int *exactmatch );
int compare_hash( const void *hash1, const void *hash2 ) { return memcmp( hash1, hash2, sizeof( ot_hash )); }
int compare_ip_port( const void *peer1, const void *peer2 ) { return memcmp( peer1, peer2, 6); }
//
//
// END OF STUFF THAT BELONGS INTO A HEADER FILE
unsigned long torrents_count = 0;
ot_torrent torrents_list = 0;
ot_byte *scratch_space = 0;
// Converter function from memory to human readable hex strings
// * definitely not thread safe!!!
//
char ths[1+2*20];char *to_hex(ot_byte*s){char*m="0123456789ABCDEF";char*e=ths+40;char*t=ths;while(t<e){*t++=m[*s>>4];*t++=m[*s++&15];}*t=0;return ths;}
ot_torrent add_peer_to_torrent( ot_hash hash, ot_peer peer ) {
ot_torrent torrent;
ot_peer peer_dest;
int exactmatch;
torrent = BINARY_FIND( hash, torrents_list, torrents_count, sizeof( *torrent ), compare_hash, &exactmatch );
if( !exactmatch ) {
// Assume, OS will provide us with space, after all, this is file backed
MEMMOVE( torrent + 1, torrent, ( torrents_list + torrents_count ) - torrent );
// Create a new torrent entry, then
MEMMOVE( &torrent->hash, hash, sizeof( ot_hash ) );
torrent->peer_list = map_file( to_hex( hash ) );
torrent->peer_count = 0;
torrent->seed_count = 0;
}
peer_dest = BINARY_FIND( peer, torrent->peer_list, torrent->peer_count, sizeof( *peer_dest ), compare_ip_port, &exactmatch );
if( exactmatch ) {
// If peer was a seeder but isn't anymore, decrease seeder count
if( ( peer_dest->flags & PEER_FLAG_SEEDING ) && !( peer->flags & PEER_FLAG_SEEDING ) )
torrent->seed_count--;
if( !( peer_dest->flags & PEER_FLAG_SEEDING ) && ( peer->flags & PEER_FLAG_SEEDING ) )
torrent->seed_count++;
} else {
// Assume, OS will provide us with space, after all, this is file backed
MEMMOVE( peer_dest + 1, peer_dest, ( torrent->peer_list + torrent->peer_count ) - peer_dest );
// Create a new peer entry, then
MEMMOVE( peer_dest, peer, sizeof( ot_peer ) );
torrent->peer_count++;
torrent->seed_count+= ( peer->flags & PEER_FLAG_SEEDING ) ? 1 : 0;
}
// Set new time out time
peer_dest->death = NOW + OT_TIMEOUT;
return torrent;
}
#define SETINVALID( i ) (scratch_space[index] = 3);
#define SETSELECTED( i ) (scratch_space[index] = 1);
#define TESTSELECTED( i ) (scratch_space[index] == 1 )
#define TESTSET( i ) (scratch_space[index])
#define RANDOM random()
inline int TESTVALIDPEER( ot_peer p ) { return p->death > NOW; }
// Compiles a list of random peers for a torrent
// * scratch space keeps track of death or already selected peers
// * reply must have enough space to hold 1+(1+16+2+1)*amount+1 bytes
// * Selector function can be anything, maybe test for seeds, etc.
// * that RANDOM may return huge values
// * does not yet check not to return self
// * it is not guaranteed to see all peers, so no assumptions on active seeders/peers may be done
// * since compact format cannot handle v6 addresses, it must be enabled by OT_COMPACT_ONLY
//
void return_peers_for_torrent( ot_torrent torrent, unsigned long amount, char *reply ) {
register ot_peer peer_base = torrent->peer_list;
unsigned long peer_count = torrent->peer_count;
unsigned long selected_count = 0, invalid_count = 0;
unsigned long index = 0;
// optimize later ;)
BZERO( scratch_space, peer_count );
while( ( selected_count < amount ) && ( selected_count + invalid_count < peer_count ) ) {
// skip to first non-flagged peer
while( TESTSET(index) ) index = ( index + 1 ) % peer_count;
if( TESTVALIDPEER( peer_base + index ) ) {
SETINVALID(index); invalid_count++;
} else {
SETSELECTED(index); selected_count++;
index = ( index + RANDOM ) % peer_count;
}
}
// Now our scratchspace contains a list of selected_count valid peers
// Collect them into a reply string
index = 0;
#ifndef OT_COMPACT_ONLY
reply += FORMAT_FIXED_STRING( reply, "d5:peersl" );
#else
reply += FORMAT_FORMAT_STRING( reply, "d5:peers%li:",6*selected_count );
#endif
while( selected_count-- ) {
ot_peer peer;
while( !TESTSELECTED( index ) ) ++index;
peer = peer_base + index;
#ifdef OT_COMPACT_ONLY
MEMMOVE( reply, &peer->ip, 4 );
MEMMOVE( reply+4, &peer->port, 2 );
reply += 6;
#else
reply += FORMAT_FORMAT_STRING( reply, "d2:ip%d:%s7:peer id20:%20c4:porti%ie",
peer->flags & PEER_IP_LENGTH_MASK,
peer->ip,
peer->id,
peer->port );
#endif
}
#ifndef OT_COMPACT_ONLY
reply += FORMAT_FIXED_STRING( reply, "ee" );
#else
reply += FORMAT_FIXED_STRING( reply, "e" );
#endif
}
// Compacts a torrents peer list
// * torrents older than OT_TIMEOUT are being kicked
// * is rather expansive
// * if this fails, torrent file is invalid, should add flag
//
void heal_torrent( ot_torrent torrent ) {
unsigned long index = 0, base = 0, end, seed_count = 0, now = NOW;
// Initialize base to first dead peer.
while( ( base < torrent->peer_count ) && torrent->peer_list[base].death <= now ) {
seed_count += ( torrent->peer_list[base].flags & PEER_FLAG_SEEDING ) ? 1 : 0;
base++;
}
// No dead peers? Home.
if( base == torrent->peer_count ) return;
// From now index always looks to the next living peer while base keeps track of
// the dead peer that marks the beginning of insert space.
index = base + 1;
while( 1 ) {
// Let index search for next living peer
while( ( index < torrent->peer_count ) && torrent->peer_list[index].death > now ) index++;
// No further living peers found - base is our new peer count
if( index == torrent->peer_count ) {
torrent->peer_count = base;
torrent->seed_count = seed_count;
return;
}
end = index + 1;
// Let end search for next dead peer (end of living peers)
while( ( end < torrent->peer_count ) && torrent->peer_list[end].death <= now ) {
seed_count += ( torrent->peer_list[end].flags & PEER_FLAG_SEEDING ) ? 1 : 0;
end++;
}
// We either hit a dead peer or the end of our peers
// In both cases: move block towards base
MEMMOVE( torrent->peer_list + base, torrent->peer_list + index, ( end - index ) * sizeof( struct ot_peer ) );
base += end - index;
index = end;
}
}
void dispose_torrent( ot_torrent torrent ) {
unmap_file( "", torrent->peer_list, 0 );
unlink( to_hex( torrent->hash ) );
MEMMOVE( torrent, torrent + 1, ( torrents_list + torrents_count ) - ( torrent + 1 ) );
torrents_count--;
}
void *binary_search( const void *key, const void *base,
unsigned long member_count, const unsigned long member_size,
int (*compar) (const void *, const void *),
int *exactmatch ) {
ot_byte *lookat = ((ot_byte*)base) + member_size * (member_count >> 1);
*exactmatch = 1;
while( member_count ) {
int cmp = compar((void*)lookat, key);
if (cmp == 0) return (void *)lookat;
if (cmp < 0) {
base = (void*)(lookat + member_size);
--member_count;
}
member_count >>= 1;
lookat = ((ot_byte*)base) + member_size * (member_count >> 1);
}
*exactmatch = 0;
return (void*)lookat;
}
// This function maps a "huge" file into process space
// * no name will aqcuire anonymous growable memory
// * memory will not be "freed" from systems vm if once used, until unmap_file
// * I guess, we should be checking for more errors...
//
void *map_file( char *file_name ) {
char *map;
if( file_name ) {
int file_desc=open(file_name,O_RDWR|O_CREAT|O_NDELAY,0644);
if( file_desc < 0) return 0;
map=mmap(0,OT_HUGE_FILESIZE,PROT_READ|PROT_WRITE,MAP_SHARED,file_desc,0);
close(file_desc);
} else
map=mmap(0,OT_HUGE_FILESIZE,PROT_READ|PROT_WRITE,MAP_ANON,-1,0);
return (map == (char*)-1) ? 0 : map;
}
void unmap_file( char *file_name, void *map, unsigned long real_size ) {
munmap( map, OT_HUGE_FILESIZE );
if( file_name)
truncate( file_name, real_size );
}
int init_logic( ) {
scratch_space = map_file( "" );
torrents_list = map_file( "" );
torrents_count = 0;
// Scan directory for filenames in the form [0-9A-F]{20}
// ...
return 0;
}
void deinit_logic( ) {
// For all torrents... blablabla
while( torrents_count-- )
unmap_file( to_hex(torrents_list[torrents_count].hash), torrents_list[torrents_count].peer_list, torrents_list[torrents_count].peer_count * sizeof(struct ot_peer) );
unmap_file( "", torrents_list, 0 );
unmap_file( "", scratch_space, 0 );
}
|