Statistics
| Branch: | Revision:

streamers / streaming.c @ 03de31e0

History | View | Annotate | Download (17.7 KB)

1
/*
2
 *  Copyright (c) 2010 Luca Abeni
3
 *  Copyright (c) 2010 Csaba Kiraly
4
 *
5
 *  This is free software; see gpl-3.0.txt
6
 */
7
#include <sys/time.h>
8
#include <stdlib.h>
9
#include <stdio.h>
10
#include <stdint.h>
11
#include <stdbool.h>
12
#include <math.h>
13
#include <assert.h>
14
#include <string.h>
15
#include <inttypes.h>
16

    
17
#include <net_helper.h>
18
#include <chunk.h> 
19
#include <chunkbuffer.h> 
20
#include <trade_msg_la.h>
21
#include <trade_msg_ha.h>
22
#include <peerset.h>
23
#include <peer.h>
24
#include <chunkidset.h>
25
#include <limits.h>
26
#include <trade_sig_ha.h>
27
#include <chunkiser_attrib.h>
28

    
29
#include "streaming.h"
30
#include "output.h"
31
#include "input.h"
32
#include "dbg.h"
33
#include "chunk_signaling.h"
34
#include "chunklock.h"
35
#include "topology.h"
36
#include "measures.h"
37
#include "scheduling.h"
38

    
39
#include "scheduler_la.h"
40

    
41
# define CB_SIZE_TIME_UNLIMITED 1e12
42
uint64_t CB_SIZE_TIME = CB_SIZE_TIME_UNLIMITED;        //in millisec, defaults to unlimited
43

    
44
static bool heuristics_distance_maxdeliver = false;
45
static int bcast_after_receive_every = 0;
46
static bool neigh_on_chunk_recv = false;
47

    
48
struct chunk_attributes {
49
  uint64_t deadline;
50
  uint16_t deadline_increment;
51
  uint16_t hopcount;
52
} __attribute__((packed));
53

    
54
extern bool chunk_log;
55

    
56
struct chunk_buffer *cb;
57
static struct input_desc *input;
58
static int cb_size;
59
static int transid=0;
60

    
61
static int offer_per_tick = 1;        //N_p parameter of POLITO
62

    
63
int _needs(struct chunkID_set *cset, int cb_size, int cid);
64

    
65
uint64_t gettimeofday_in_us(void)
66
{
67
  struct timeval what_time; //to store the epoch time
68

    
69
  gettimeofday(&what_time, NULL);
70
  return what_time.tv_sec * 1000000ULL + what_time.tv_usec;
71
}
72

    
73
void cb_print()
74
{
75
#ifdef DEBUG
76
  struct chunk *chunks;
77
  int num_chunks, i, id;
78
  chunks = cb_get_chunks(cb, &num_chunks);
79

    
80
  dprintf("\tchbuf :");
81
  i = 0;
82
  if(num_chunks) {
83
    id = chunks[0].id;
84
    dprintf(" %d-> ",id);
85
    while (i < num_chunks) {
86
      if (id == chunks[i].id) {
87
        dprintf("%d",id % 10);
88
        i++;
89
      } else if (chunk_islocked(id)) {
90
        dprintf("*");
91
      } else {
92
        dprintf(".");
93
      }
94
      id++;
95
    }
96
  }
97
  dprintf("\n");
98
#endif
99
}
100

    
101
void stream_init(int size, struct nodeID *myID)
102
{
103
  static char conf[32];
104

    
105
  cb_size = size;
106

    
107
  sprintf(conf, "size=%d", cb_size);
108
  cb = cb_init(conf);
109
  chunkDeliveryInit(myID);
110
  chunkSignalingInit(myID);
111
  init_measures();
112
}
113

    
114
int source_init(const char *fname, struct nodeID *myID, int *fds, int fds_size, int buff_size)
115
{
116
  input = input_open(fname, fds, fds_size);
117
  if (input == NULL) {
118
    return -1;
119
  }
120

    
121
  stream_init(buff_size, myID);
122
  return 0;
123
}
124

    
125
void chunk_attributes_fill(struct chunk* c)
126
{
127
  struct chunk_attributes * ca;
128
  int priority = 1;
129

    
130
  assert((!c->attributes && c->attributes_size == 0) ||
131
         chunk_attributes_chunker_verify(c->attributes, c->attributes_size));
132

    
133
  if (chunk_attributes_chunker_verify(c->attributes, c->attributes_size)) {
134
    priority = ((struct chunk_attributes_chunker*) c->attributes)->priority;
135
    free(c->attributes);
136
    c->attributes = NULL;
137
    c->attributes_size = 0;
138
  }
139

    
140
  c->attributes_size = sizeof(struct chunk_attributes);
141
  c->attributes = ca = malloc(c->attributes_size);
142

    
143
  ca->deadline = c->id;
144
  ca->deadline_increment = priority * 2;
145
  ca->hopcount = 0;
146
}
147

    
148
int chunk_get_hopcount(struct chunk* c) {
149
  struct chunk_attributes * ca;
150

    
151
  if (!c->attributes || c->attributes_size != sizeof(struct chunk_attributes)) {
152
    fprintf(stderr,"Warning, chunk %d with strange attributes block. Size:%d expected:%lu\n", c->id, c->attributes ? c->attributes_size : 0, sizeof(struct chunk_attributes));
153
    return -1;
154
  }
155

    
156
  ca = (struct chunk_attributes *) c->attributes;
157
  return ca->hopcount;
158
}
159

    
160
void chunk_attributes_update_received(struct chunk* c)
161
{
162
  struct chunk_attributes * ca;
163

    
164
  if (!c->attributes || c->attributes_size != sizeof(struct chunk_attributes)) {
165
    fprintf(stderr,"Warning, received chunk %d with strange attributes block. Size:%d expected:%lu\n", c->id, c->attributes ? c->attributes_size : 0, sizeof(struct chunk_attributes));
166
    return;
167
  }
168

    
169
  ca = (struct chunk_attributes *) c->attributes;
170
  ca->hopcount++;
171
  dprintf("Received chunk %d with hopcount %hu\n", c->id, ca->hopcount);
172
}
173

    
174
void chunk_attributes_update_sending(const struct chunk* c)
175
{
176
  struct chunk_attributes * ca;
177

    
178
  if (!c->attributes || c->attributes_size != sizeof(struct chunk_attributes)) {
179
    fprintf(stderr,"Warning, chunk %d with strange attributes block\n", c->id);
180
    return;
181
  }
182

    
183
  ca = (struct chunk_attributes *) c->attributes;
184
  ca->deadline += ca->deadline_increment;
185
  dprintf("Sending chunk %d with deadline %lu (increment: %d)\n", c->id, ca->deadline, ca->deadline_increment);
186
}
187

    
188
struct chunkID_set *cb_to_bmap(struct chunk_buffer *chbuf)
189
{
190
  struct chunk *chunks;
191
  int num_chunks, i;
192
  struct chunkID_set *my_bmap = chunkID_set_init("type=bitmap");
193
  chunks = cb_get_chunks(chbuf, &num_chunks);
194

    
195
  for(i=num_chunks-1; i>=0; i--) {
196
    chunkID_set_add_chunk(my_bmap, chunks[i].id);
197
  }
198
  return my_bmap;
199
}
200

    
201
// a simple implementation that request everything that we miss ... up to max deliver
202
struct chunkID_set *get_chunks_to_accept(struct nodeID *fromid, const struct chunkID_set *cset_off, int max_deliver, uint16_t trans_id){
203
  struct chunkID_set *cset_acc, *my_bmap;
204
  int i, d, cset_off_size;
205
  //double lossrate;
206
  struct peer *from = nodeid_to_peer(fromid, 0);
207

    
208
  cset_acc = chunkID_set_init("size=0");
209

    
210
  //reduce load a little bit if there are losses on the path from this guy
211
  //lossrate = get_lossrate_receive(from->id);
212
  //lossrate = finite(lossrate) ? lossrate : 0;        //start agressively, assuming 0 loss
213
  //if (rand()/((double)RAND_MAX + 1) >= 10 * lossrate ) {
214
    my_bmap = cb_to_bmap(cb);
215
    cset_off_size = chunkID_set_size(cset_off);
216
    for (i = 0, d = 0; i < cset_off_size && d < max_deliver; i++) {
217
      int chunkid = chunkID_set_get_chunk(cset_off, i);
218
      //dprintf("\tdo I need c%d ? :",chunkid);
219
      if (!chunk_islocked(chunkid) && _needs(my_bmap, cb_size, chunkid)) {
220
        chunkID_set_add_chunk(cset_acc, chunkid);
221
        chunk_lock(chunkid,from);
222
        dtprintf("accepting %d from %s", chunkid, node_addr(fromid));
223
#ifdef MONL
224
        dprintf(", loss:%f rtt:%f", get_lossrate(fromid), get_rtt(fromid));
225
#endif
226
        dprintf("\n");
227
        d++;
228
      }
229
    }
230
    chunkID_set_free(my_bmap);
231
  //} else {
232
  //    dtprintf("accepting -- from %s loss:%f rtt:%f\n", node_addr(fromid), lossrate, get_rtt(fromid));
233
  //}
234

    
235
  return cset_acc;
236
}
237

    
238
void send_bmap(struct nodeID *toid)
239
{
240
  struct chunkID_set *my_bmap = cb_to_bmap(cb);
241
   sendBufferMap(toid,NULL, my_bmap, input ? 0 : cb_size, 0);
242
  chunkID_set_free(my_bmap);
243
}
244

    
245
void bcast_bmap()
246
{
247
  int i, n;
248
  struct peer *neighbours;
249
  struct peerset *pset;
250
  struct chunkID_set *my_bmap;
251

    
252
  pset = get_peers();
253
  n = peerset_size(pset);
254
  neighbours = peerset_get_peers(pset);
255

    
256
  my_bmap = cb_to_bmap(cb);        //cache our bmap for faster processing
257
  for (i = 0; i<n; i++) {
258
    sendBufferMap(neighbours[i].id,NULL, my_bmap, input ? 0 : cb_size, 0);
259
  }
260
  chunkID_set_free(my_bmap);
261
}
262

    
263
double get_average_lossrate_pset(struct peerset *pset)
264
{
265
  int i, n;
266
  struct peer *neighbours;
267

    
268
  n = peerset_size(pset);
269
  neighbours = peerset_get_peers(pset);
270
  {
271
    struct nodeID *nodeids[n];
272
    for (i = 0; i<n; i++) nodeids[i] = neighbours[i].id;
273
#ifdef MONL
274
    return get_average_lossrate(nodeids, n);
275
#else
276
    return 0;
277
#endif
278
  }
279
}
280

    
281
void ack_chunk(struct chunk *c, struct nodeID *from)
282
{
283
  //reduce load a little bit if there are losses on the path from this guy
284
  double average_lossrate = get_average_lossrate_pset(get_peers());
285
  average_lossrate = finite(average_lossrate) ? average_lossrate : 0;        //start agressively, assuming 0 loss
286
  if (rand()/((double)RAND_MAX + 1) < 1 * average_lossrate ) {
287
    return;
288
  }
289
  send_bmap(from);        //send explicit ack
290
}
291

    
292
void received_chunk(struct nodeID *from, const uint8_t *buff, int len)
293
{
294
  int res;
295
  static struct chunk c;
296
  struct peer *p;
297
  static int bcast_cnt;
298
  uint16_t transid;
299

    
300
  res = parseChunkMsg(buff + 1, len - 1, &c, &transid);
301
  if (res > 0) {
302
    chunk_attributes_update_received(&c);
303
    chunk_unlock(c.id);
304
    dprintf("Received chunk %d from peer: %s\n", c.id, node_addr(from));
305
    if(chunk_log){fprintf(stderr, "TEO: Received chunk %d from peer: %s at: %"PRIu64" hopcount: %i Size: %d bytes\n", c.id, node_addr(from), gettimeofday_in_us(), chunk_get_hopcount(&c), c.size);}
306
    output_deliver(&c);
307
    res = cb_add_chunk(cb, &c);
308
    reg_chunk_receive(c.id, c.timestamp, chunk_get_hopcount(&c), res==E_CB_OLD, res==E_CB_DUPLICATE);
309
    cb_print();
310
    if (res < 0) {
311
      dprintf("\tchunk too old, buffer full with newer chunks\n");
312
      if(chunk_log){fprintf(stderr, "TEO: Received chunk: %d too old (buffer full with newer chunks) from peer: %s at: %"PRIu64"\n", c.id, node_addr(from), gettimeofday_in_us());}
313
      free(c.data);
314
      free(c.attributes);
315
    }
316
    p = nodeid_to_peer(from, neigh_on_chunk_recv);
317
    if (p) {        //now we have it almost sure
318
      chunkID_set_add_chunk(p->bmap,c.id);        //don't send it back
319
    }
320
    ack_chunk(&c,from);        //send explicit ack
321
    if (bcast_after_receive_every && bcast_cnt % bcast_after_receive_every == 0) {
322
       bcast_bmap();
323
    }
324
  } else {
325
    fprintf(stderr,"\tError: can't decode chunk!\n");
326
  }
327
}
328

    
329
struct chunk *generated_chunk(suseconds_t *delta)
330
{
331
  struct chunk *c;
332

    
333
  c = malloc(sizeof(struct chunk));
334
  if (!c) {
335
    fprintf(stderr, "Memory allocation error!\n");
336
    return NULL;
337
  }
338

    
339
  *delta = input_get(input, c);
340
  if (*delta < 0) {
341
    fprintf(stderr, "Error in input!\n");
342
    exit(-1);
343
  }
344
  if (c->data == NULL) {
345
    free(c);
346
    return NULL;
347
  }
348
  dprintf("Generated chunk %d of %d bytes\n",c->id, c->size);
349
  chunk_attributes_fill(c);
350
  return c;
351
}
352

    
353
int add_chunk(struct chunk *c)
354
{
355
  int res;
356

    
357
  res = cb_add_chunk(cb, c);
358
  if (res < 0) {
359
    free(c->data);
360
    free(c->attributes);
361
    free(c);
362
    return 0;
363
  }
364
  free(c);
365
  return 1;
366
}
367

    
368
uint64_t get_chunk_timestamp(int cid){
369
  const struct chunk *c = cb_get_chunk(cb, cid);
370
  if (!c) return 0;
371

    
372
  return c->timestamp;
373
}
374

    
375
/**
376
 *example function to filter chunks based on whether a given peer needs them.
377
 *
378
 * Looks at buffermap information received about the given peer.
379
 */
380
int needs(struct peer *n, int cid){
381
  struct peer * p = n;
382

    
383
  if (CB_SIZE_TIME < CB_SIZE_TIME_UNLIMITED) {
384
    uint64_t ts;
385
    ts = get_chunk_timestamp(cid);
386
    if (ts && (ts < gettimeofday_in_us() - CB_SIZE_TIME)) {        //if we don't know the timestamp, we accept
387
      return 0;
388
    }
389
  }
390

    
391
  //dprintf("\t%s needs c%d ? :",node_addr(p->id),c->id);
392
  if (! p->bmap) {
393
    //dprintf("no bmap\n");
394
    return 1;        // if we have no bmap information, we assume it needs the chunk (aggressive behaviour!)
395
  }
396
  return _needs(p->bmap, p->cb_size, cid);
397
}
398

    
399
int _needs(struct chunkID_set *cset, int cb_size, int cid){
400

    
401
  if (cb_size == 0) { //if it declared it does not needs chunks
402
    return 0;
403
  }
404

    
405
  if (CB_SIZE_TIME < CB_SIZE_TIME_UNLIMITED) {
406
    uint64_t ts;
407
    ts = get_chunk_timestamp(cid);
408
    if (ts && (ts < gettimeofday_in_us() - CB_SIZE_TIME)) {        //if we don't know the timestamp, we accept
409
      return 0;
410
    }
411
  }
412

    
413
  if (chunkID_set_check(cset,cid) < 0) { //it might need the chunk
414
    int missing, min;
415
    //@TODO: add some bmap_timestamp based logic
416

    
417
    if (chunkID_set_size(cset) == 0) {
418
      //dprintf("bmap empty\n");
419
      return 1;        // if the bmap seems empty, it needs the chunk
420
    }
421
    missing = cb_size - chunkID_set_size(cset);
422
    missing = missing < 0 ? 0 : missing;
423
    min = chunkID_set_get_earliest(cset);
424
      //dprintf("%s ... cid(%d) >= min(%d) - missing(%d) ?\n",(cid >= min - missing)?"YES":"NO",cid, min, missing);
425
    return (cid >= min - missing);
426
  }
427

    
428
  //dprintf("has it\n");
429
  return 0;
430
}
431

    
432
double peerWeightReceivedfrom(struct peer **n){
433
  struct peer * p = *n;
434
  return timerisset(&p->bmap_timestamp) ? 1 : 0.1;
435
}
436

    
437
double peerWeightUniform(struct peer **n){
438
  return 1;
439
}
440

    
441
double peerWeightRtt(struct peer **n){
442
#ifdef MONL
443
  double rtt = get_rtt((*n)->id);
444
  //dprintf("RTT to %s: %f\n", node_addr(p->id), rtt);
445
  return finite(rtt) ? 1 / (rtt + 0.005) : 1 / 1;
446
#else
447
  return 1;
448
#endif
449
}
450

    
451
//ordering function for ELp peer selection, chunk ID based
452
//can't be used as weight
453
double peerScoreELpID(struct nodeID **n){
454
  struct chunkID_set *bmap;
455
  int latest;
456
  struct peer * p = nodeid_to_peer(*n, 0);
457
  if (!p) return 0;
458

    
459
  bmap = p->bmap;
460
  if (!bmap) return 0;
461
  latest = chunkID_set_get_latest(bmap);
462
  if (latest == INT_MIN) return 0;
463

    
464
  return -latest;
465
}
466

    
467
double chunkScoreChunkID(int *cid){
468
  return (double) *cid;
469
}
470

    
471
uint64_t get_chunk_deadline(int cid){
472
  const struct chunk_attributes * ca;
473
  const struct chunk *c;
474

    
475
  c = cb_get_chunk(cb, cid);
476
  if (!c) return 0;
477

    
478
  if (!c->attributes || c->attributes_size != sizeof(struct chunk_attributes)) {
479
    fprintf(stderr,"Warning, chunk %d with strange attributes block\n", c->id);
480
    return 0;
481
  }
482

    
483
  ca = (struct chunk_attributes *) c->attributes;
484
  return ca->deadline;
485
}
486

    
487
double chunkScoreDL(int *cid){
488
  return - (double)get_chunk_deadline(*cid);
489
}
490

    
491
double chunkScoreTimestamp(int *cid){
492
  return (double) get_chunk_timestamp(*cid);
493
}
494

    
495
void send_accepted_chunks(struct nodeID *toid, struct chunkID_set *cset_acc, int max_deliver, uint16_t trans_id){
496
  int i, d, cset_acc_size, res;
497
  struct peer *to = nodeid_to_peer(toid, 0);
498

    
499
  cset_acc_size = chunkID_set_size(cset_acc);
500
  reg_offer_accept(cset_acc_size > 0 ? 1 : 0);        //this only works if accepts are sent back even if 0 is accepted
501
  for (i = 0, d=0; i < cset_acc_size && d < max_deliver; i++) {
502
    const struct chunk *c;
503
    int chunkid = chunkID_set_get_chunk(cset_acc, i);
504
    c = cb_get_chunk(cb, chunkid);
505
    if (c && (!to || needs(to, chunkid)) ) {// we should have the chunk, and he should not have it. Although the "accept" should have been an answer to our "offer", we do some verification
506
      chunk_attributes_update_sending(c);
507
      res = sendChunk(toid, c, trans_id);
508
      if (res >= 0) {
509
        if(to) chunkID_set_add_chunk(to->bmap, c->id); //don't send twice ... assuming that it will actually arrive
510
        d++;
511
        reg_chunk_send(c->id);
512
        if(chunk_log){fprintf(stderr, "TEO: Sending chunk %d to peer: %s at: %"PRIu64" Result: %d Size: %d bytes\n", c->id, node_addr(toid), gettimeofday_in_us(), res, c->size);}
513
      } else {
514
        fprintf(stderr,"ERROR sending chunk %d\n",c->id);
515
      }
516
    }
517
  }
518
}
519

    
520
int offer_peer_count()
521
{
522
  return offer_per_tick;
523
}
524

    
525
int offer_max_deliver(struct nodeID *n)
526
{
527

    
528
  if (!heuristics_distance_maxdeliver) return 1;
529

    
530
#ifdef MONL
531
  switch (get_hopcount(n)) {
532
    case 0: return 5;
533
    case 1: return 2;
534
    default: return 1;
535
  }
536
#else
537
  return 1;
538
#endif
539
}
540

    
541
void send_offer()
542
{
543
  struct chunk *buff;
544
  int size, res, i, n;
545
  struct peer *neighbours;
546
  struct peerset *pset;
547

    
548
  pset = get_peers();
549
  n = peerset_size(pset);
550
  neighbours = peerset_get_peers(pset);
551
  dprintf("Send Offer: %d neighbours\n", n);
552
  if (n == 0) return;
553
  buff = cb_get_chunks(cb, &size);
554
  if (size == 0) return;
555

    
556
  {
557
    size_t selectedpeers_len = offer_peer_count();
558
    int chunkids[size];
559
    struct peer *nodeids[n];
560
    struct peer *selectedpeers[selectedpeers_len];
561

    
562
    //reduce load a little bit if there are losses on the path from this guy
563
    double average_lossrate = get_average_lossrate_pset(pset);
564
    average_lossrate = finite(average_lossrate) ? average_lossrate : 0;        //start agressively, assuming 0 loss
565
    if (rand()/((double)RAND_MAX + 1) < 10 * average_lossrate ) {
566
      return;
567
    }
568

    
569
    for (i = 0;i < size; i++) chunkids[size - 1 - i] = (buff+i)->id;
570
    for (i = 0; i<n; i++) nodeids[i] = (neighbours+i);
571
    selectPeersForChunks(SCHED_WEIGHTING, nodeids, n, chunkids, size, selectedpeers, &selectedpeers_len, SCHED_NEEDS, SCHED_PEER);
572

    
573
    for (i=0; i<selectedpeers_len ; i++){
574
      int max_deliver = offer_max_deliver(selectedpeers[i]->id);
575
      struct chunkID_set *my_bmap = cb_to_bmap(cb);
576
      dprintf("\t sending offer(%d) to %s, cb_size: %d\n", transid, node_addr(selectedpeers[i]->id), selectedpeers[i]->cb_size);
577
      res = offerChunks(selectedpeers[i]->id, my_bmap, max_deliver, transid++);
578
      chunkID_set_free(my_bmap);
579
    }
580
  }
581
}
582

    
583

    
584
void send_chunk()
585
{
586
  struct chunk *buff;
587
  int size, res, i, n;
588
  struct peer *neighbours;
589
  struct peerset *pset;
590

    
591
  pset = get_peers();
592
  n = peerset_size(pset);
593
  neighbours = peerset_get_peers(pset);
594
  dprintf("Send Chunk: %d neighbours\n", n);
595
  if (n == 0) return;
596
  buff = cb_get_chunks(cb, &size);
597
  dprintf("\t %d chunks in buffer...\n", size);
598
  if (size == 0) return;
599

    
600
  /************ STUPID DUMB SCHEDULING ****************/
601
  //target = n * (rand() / (RAND_MAX + 1.0)); /*0..n-1*/
602
  //c = size * (rand() / (RAND_MAX + 1.0)); /*0..size-1*/
603
  /************ /STUPID DUMB SCHEDULING ****************/
604

    
605
  /************ USE SCHEDULER ****************/
606
  {
607
    size_t selectedpairs_len = 1;
608
    int chunkids[size];
609
    struct peer *nodeids[n];
610
    struct PeerChunk selectedpairs[1];
611
  
612
    for (i = 0;i < size; i++) chunkids[size - 1 - i] = (buff+i)->id;
613
    for (i = 0; i<n; i++) nodeids[i] = (neighbours+i);
614
    SCHED_TYPE(SCHED_WEIGHTING, nodeids, n, chunkids, 1, selectedpairs, &selectedpairs_len, SCHED_NEEDS, SCHED_PEER, SCHED_CHUNK);
615
  /************ /USE SCHEDULER ****************/
616

    
617
    for (i=0; i<selectedpairs_len ; i++){
618
      struct peer *p = selectedpairs[i].peer;
619
      struct chunk *c = cb_get_chunk(cb, selectedpairs[i].chunk);
620
      dprintf("\t sending chunk[%d] to ", c->id);
621
      dprintf("%s\n", node_addr(p->id));
622

    
623
      send_bmap(p->id);
624

    
625
      chunk_attributes_update_sending(c);
626
      res = sendChunk(p->id, c, 0);        //we do not use transactions in pure push
627
      if(chunk_log){fprintf(stderr, "TEO: Sending chunk %d to peer: %s at: %"PRIu64" Result: %d Size: %d bytes\n", c->id, node_addr(p->id), gettimeofday_in_us(), res, c->size);}
628
      dprintf("\tResult: %d\n", res);
629
      if (res>=0) {
630
        chunkID_set_add_chunk(p->bmap,c->id); //don't send twice ... assuming that it will actually arrive
631
        reg_chunk_send(c->id);
632
      } else {
633
        fprintf(stderr,"ERROR sending chunk %d\n",c->id);
634
      }
635
    }
636
  }
637
}