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
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
|
#include "DHT.h"
//Function to send packet(data) of length length to ip_port
int sendpacket(IP_Port ip_port, char * data, uint32_t length)
{
ADDR addr = {.family = AF_INET, .ip = ip_port.ip, .port = ip_port.port};
return sendto(sock, data, length, 0, (struct sockaddr *)&addr, sizeof(addr));
}
//Compares client_id1 and client_id2 with client_id
//return 0 if both are same distance
//return 1 if client_id1 is closer.
//return 2 if client_id2 is closer.
int id_closest(char * client_id, char * client_id1, char * client_id2)
{
uint32_t i;
for(i = 0; i < CLIENT_ID_SIZE; i++)
{
if(abs(client_id[i] ^ client_id1[i]) < abs(client_id[i] ^ client_id2[i]))
{
return 1;
}
else if(abs(client_id[i] ^ client_id1[i]) > abs(client_id[i] ^ client_id2[i]))
{
return 2;
}
}
return 0;
}
//check if client with client_id is already in list of length length.
//if it is set it's corresponding timestamp to current time.
//return True(1) or False(0)
int client_in_list(Client_data * list, uint32_t length, char * client_id)
{
uint32_t i, j;
for(i = 0; i < length; i++)
{
for(j = 0; j < CLIENT_ID_SIZE; j++)
{
if(list[i].client_id[j] != client_id[j])
{
break;
}
}
if((j - 1) == CLIENT_ID_SIZE)
{
//Refresh the client timestamp.
list[i].timestamp = unix_time();
return 1;
}
}
return 0;
}
//the number of seconds for a non responsive node to become bad.
#define BAD_NODE_TIMEOUT 130
//replace first bad (or empty) node with this one
//return 0 if successfull
//return 1 if not (list contains no bad nodes)
int replace_bad(Client_data * list, uint32_t length, char * client_id, IP_Port ip_port)
{
uint32_t i;
for(i = 0; i < length; i++)
{
if(list[i].timestamp + BAD_NODE_TIMEOUT < unix_time())
{
memcpy(list[i].client_id, client_id, CLIENT_ID_SIZE);
list[i].ip_port = ip_port;
list[i].timestamp = unix_time();
return 0;
}
}
return 1;
}
//replace the first good node further to the comp_client_id than that of the client_id
int replace_good(Client_data * list, uint32_t length, char * client_id, IP_Port ip_port, char * comp_client_id)
{
uint32_t i;
for(i = 0; i < length; i++)
{
if(id_closest(comp_client_id, list[i].client_id, client_id) == 2)
{
memcpy(list[i].client_id, client_id, CLIENT_ID_SIZE);
list[i].ip_port = ip_port;
list[i].timestamp = unix_time();
return 0;
}
}
return 1;
}
//Attempt to add client with ip_port and client_id to the friends client list and close_clientlist
int addto_lists(IP_Port ip_port, char * client_id)
{
uint32_t i;
//NOTE: current behaviour if there are two clients with the same id is to only keep one (the first one)
if(!client_in_list(close_clientlist, LCLIENT_LIST, client_id))
{
if(replace_bad(close_clientlist, LCLIENT_LIST, client_id, ip_port))
{
//if we can't replace bad nodes we try replacing good ones
replace_good(close_clientlist, LCLIENT_LIST, client_id, ip_port, self_client_id);
}
}
for(i = 0; i < num_friends; i++)
{
if(!client_in_list(friends_list[i].client_list, LCLIENT_LIST, client_id))
{
if(replace_bad(friends_list[i].client_list, LCLIENT_LIST, client_id, ip_port))
{
//if we can't replace bad nodes we try replacing good ones
replace_good(friends_list[i].client_list, LCLIENT_LIST, client_id, ip_port, self_client_id);
}
}
}
}
//ping timeout in seconds
#define PING_TIMEOUT 10
//check if we are currently pinging an ip_port
//if we are already, return 1
//else return 0
//TODO: Maybe optimize this
int is_pinging(IP_Port ip_port)
{
uint32_t i;
for(i = 0; i < LPING_ARRAY; i++ )
{
if((pings[i].timestamp + PING_TIMEOUT) > unix_time() &&
pings[i].ip_port.ip.i == ip_port.ip.i &&
pings[i].ip_port.port == ip_port.port)
{
return 1;
}
}
return 0;
}
//Same as last function but for get_node requests.
int is_gettingnodes(IP_Port ip_port)
{
uint32_t i;
for(i = 0; i < LSEND_NODES_ARRAY; i++ )
{
if((send_nodes[i].timestamp + PING_TIMEOUT) > unix_time() &&
send_nodes[i].ip_port.ip.i == ip_port.ip.i &&
send_nodes[i].ip_port.port == ip_port.port)
{
return 1;
}
}
return 0;
}
//Add a new ping request to the list of ping requests
//returns the ping_id to put in the ping request
//TODO: Maybe optimize this
int add_pinging(IP_Port ip_port)
{
uint32_t i, j;
int ping_id = rand();
for(i = 0; i < PING_TIMEOUT; i++ )
{
for(j = 0; j < LPING_ARRAY; j++ )
{
if((pings[j].timestamp + PING_TIMEOUT - i) < unix_time())
{
pings[j].timestamp = unix_time();
pings[j].ip_port = ip_port;
pings[j].ping_id = ping_id;
return ping_id;
}
}
}
}
//Same but for get node requests
int add_gettingnodes(IP_Port ip_port)
{
uint32_t i, j;
int ping_id = rand();
for(i = 0; i < PING_TIMEOUT; i++ )
{
for(j = 0; j < LSEND_NODES_ARRAY; j++ )
{
if((send_nodes[j].timestamp + PING_TIMEOUT - i) < unix_time())
{
send_nodes[j].timestamp = unix_time();
send_nodes[j].ip_port = ip_port;
send_nodes[j].ping_id = ping_id;
return ping_id;
}
}
}
}
//send a ping request
int pingreq(IP_Port ip_port)
{
if(is_pinging(ip_port))
{
return 1;
}
int ping_id = add_pinging(ip_port);
char data[5 + CLIENT_ID_SIZE];
data[0] = 0;
memcpy(data + 1, &ping_id, 4);
memcpy(data + 5, self_client_id, CLIENT_ID_SIZE);
return sendpacket(ip_port, data, sizeof(data));
}
//send a ping response
int pingres(IP_Port ip_port, uint32_t ping_id)
{
char data[5 + CLIENT_ID_SIZE];
data[0] = 1;
memcpy(data + 1, &ping_id, 4);
memcpy(data + 5, self_client_id, CLIENT_ID_SIZE);
return sendpacket(ip_port, data, sizeof(data));
}
//send a getnodes request
int getnodes(IP_Port ip_port, char * client_id)
{
if(is_gettingnodes(ip_port))
{
return 1;
}
int ping_id = add_pinging(ip_port);
char data[5 + CLIENT_ID_SIZE*2];
data[0] = 2;
memcpy(data + 1, &ping_id, 4);
memcpy(data + 5, self_client_id, CLIENT_ID_SIZE);
memcpy(data + 5 + CLIENT_ID_SIZE, client_id, CLIENT_ID_SIZE);
return sendpacket(ip_port, data, sizeof(data));
}
//send a send nodes response
//Currently incomplete: missing bunch of stuff
int sendnodes(IP_Port ip_port, char * client_id)
{
char data[5 + (CLIENT_ID_SIZE + 6)*8];
data[0] = 3;
memcpy(data + 5, self_client_id, CLIENT_ID_SIZE);
memcpy(data + 5 + CLIENT_ID_SIZE, client_id, CLIENT_ID_SIZE);
sendpacket(ip_port, data, sizeof(data));
}
//Packet handling functions
//One to handle each types of packets
int handle_pingreq(char * packet, uint32_t length, IP_Port source)
{
if(length != 5 + CLIENT_ID_SIZE)
{
return 1;
}
uint32_t ping_id;
memcpy(&ping_id, packet + 1, 4);
pingres(source, ping_id);
return 0;
}
int handle_pingres(char * packet, uint32_t length, IP_Port source)
{
if(length != (5 + CLIENT_ID_SIZE))
{
return 1;
}
addto_lists(source, packet + 5);
}
int handle_getnodes(char * packet, uint32_t length, IP_Port source)
{
if(length != (5 + CLIENT_ID_SIZE*2))
{
return 1;
}
return 0;
}
int handle_sendnodes(char * packet, uint32_t length, IP_Port source)
{
if(length > 325 || (length - 5) % (CLIENT_ID_SIZE + 6) != 0)
{
return 1;
}
addto_lists(source, packet + 5);
}
void addfriend(char * client_id)
{
}
char delfriend(char * client_id)
{
}
IP_Port getfriendip(char * client_id)
{
}
void DHT_recvpacket(char * packet, uint32_t length, IP_Port source)
{
switch (packet[0]) {
case 0:
handle_pingreq(packet, length, source);
break;
case 1:
handle_pingres(packet, length, source);
break;
case 2:
handle_getnodes(packet, length, source);
break;
case 3:
handle_sendnodes(packet, length, source);
break;
default:
return;
}
}
//Ping each client in the "friends" list every 60 seconds.
//Send a get nodes request every 20 seconds to a random good node for each "friend" in our "friends" list.
void doFriends()
{
}
void doClose()
{
}
void doDHT()
{
}
void bootstrap(IP_Port ip_port)
{
getnodes(ip_port, self_client_id);
}
|