int next_piece(int previous_piece, struct peer_state *peer) {
/*
for(int i=0;i<get_total_pieces_available();i++){
if(piece_occurence_value[i] >0 && piece_status[i] == PIECE_EMPTY &&
is_bit_set(peer->bitfield,i)){
if(next_piece != -2 && piece_occurence_value[i] <= piece_occurence_value[next_piece])
next_piece = i;
}
}
*/
//printf("Insice next piece\n");
fflush(stdout);
if(previous_piece!=-1){
piece_status[previous_piece]=PIECE_FINISHED;
}
draw_state();
int next_piece=-2;
//using the bitfield count and checking next rare piece
for(int i=0;i<get_total_pieces_available();i++){
if(piece_occurence_value[i] >0 && piece_status[i] == PIECE_EMPTY &&
is_bit_set(peer->bitfield,i)){
if(next_piece == -2)
next_piece = i;
if(next_piece != -2 && piece_occurence_value[i] <= piece_occurence_value[next_piece])
next_piece = i;
}
}
piece_status[next_piece]=PIECE_PENDING;
return next_piece;
}
void
draw_wire(ModeInfo * mi)
{
int offset, i, j, found = 0;
unsigned char *z, *znew;
circuitstruct *wp;
if (circuits == NULL)
return;
wp = &circuits[MI_SCREEN(mi)];
if (wp->newcells == NULL)
return;
MI_IS_DRAWN(mi) = True;
/* wires do not grow so min max stuff does not change */
for (j = wp->minrow; j <= wp->maxrow; j++) {
for (i = wp->mincol; i <= wp->maxcol; i++) {
offset = j * wp->bncols + i;
z = wp->oldcells + offset;
znew = wp->newcells + offset;
if (*z != *znew) { /* Counting on once a space always a space */
found = 1;
*z = *znew;
if (!addtolist(mi, i - 2, j - 2, *znew - 1)) {
free_wire(MI_DISPLAY(mi), wp);
return;
}
}
}
}
for (i = 0; i < COLORS - 1; i++)
if (!draw_state(mi, i)) {
free_wire(MI_DISPLAY(mi), wp);
return;
}
if (++wp->generation > MI_CYCLES(mi) || !found) {
init_wire(mi);
return;
} else
do_gen(wp);
if (wp->redrawing) {
for (i = 0; i < REDRAWSTEP; i++) {
if ((*(wp->oldcells + wp->redrawpos))) {
drawCell(mi, wp->redrawpos % wp->bncols - 2,
wp->redrawpos / wp->bncols - 2, *(wp->oldcells + wp->redrawpos) - 1);
}
if (++(wp->redrawpos) >= wp->bncols * (wp->bnrows - 2)) {
wp->redrawing = 0;
break;
}
}
}
}
/* so far, we're assuming that every peer actually have all pieces. That's not good!
so change something here?
return the next piece (based on the prvs. piece) or -1 if there is no next piece
CHANGE to return a pending piece if there are no new pieces available!
Keep track of how many bytes of each piece you have, and supply that as the offset. */
int next_piece(int previous_piece) {
if(previous_piece!=-1)
piece_status[previous_piece]=PIECE_FINISHED;
draw_state();
for(int i=0;i<(file_length/piece_length+1);i++) {
if(piece_status[i]==PIECE_EMPTY) {
if(debug)
fprintf(stderr,"Next piece %d / %d\n",i,file_length/piece_length);
piece_status[i]=PIECE_PENDING;
return i;
}
}
return -1;
}
ENTRYPOINT void
draw_demon (ModeInfo * mi)
{
int i, j, k, l, mj = 0, ml;
demonstruct *dp;
if (demons == NULL)
return;
dp = &demons[MI_SCREEN(mi)];
if (dp->cellList == NULL)
return;
MI_IS_DRAWN(mi) = True;
if (dp->state >= dp->states) {
(void) memcpy((char *) dp->newcell, (char *) dp->oldcell,
dp->ncols * dp->nrows * sizeof (unsigned char));
if (dp->neighbors == 6) {
for (j = 0; j < dp->nrows; j++) {
for (i = 0; i < dp->ncols; i++) {
/* NE */
if (!(j & 1))
k = (i + 1 == dp->ncols) ? 0 : i + 1;
else
k = i;
l = (!j) ? dp->nrows - 1 : j - 1;
ml = l * dp->ncols;
if (dp->oldcell[k + ml] ==
(int) (dp->oldcell[i + mj] + 1) % dp->states)
dp->newcell[i + mj] = dp->oldcell[k + ml];
/* E */
k = (i + 1 == dp->ncols) ? 0 : i + 1;
ml = mj;
if (dp->oldcell[k + ml] ==
(int) (dp->oldcell[i + mj] + 1) % dp->states)
dp->newcell[i + mj] = dp->oldcell[k + ml];
/* SE */
if (!(j & 1))
k = (i + 1 == dp->ncols) ? 0 : i + 1;
else
k = i;
l = (j + 1 == dp->nrows) ? 0 : j + 1;
ml = l * dp->ncols;
if (dp->oldcell[k + ml] ==
(int) (dp->oldcell[i + mj] + 1) % dp->states)
dp->newcell[i + mj] = dp->oldcell[k + ml];
/* SW */
if (j & 1)
k = (!i) ? dp->ncols - 1 : i - 1;
else
k = i;
l = (j + 1 == dp->nrows) ? 0 : j + 1;
ml = l * dp->ncols;
if (dp->oldcell[k + ml] ==
(int) (dp->oldcell[i + mj] + 1) % dp->states)
dp->newcell[i + mj] = dp->oldcell[k + ml];
/* W */
k = (!i) ? dp->ncols - 1 : i - 1;
ml = mj;
if (dp->oldcell[k + ml] ==
(int) (dp->oldcell[i + mj] + 1) % dp->states)
dp->newcell[i + mj] = dp->oldcell[k + ml];
/* NW */
if (j & 1)
k = (!i) ? dp->ncols - 1 : i - 1;
else
k = i;
l = (!j) ? dp->nrows - 1 : j - 1;
ml = l * dp->ncols;
if (dp->oldcell[k + ml] ==
(int) (dp->oldcell[i + mj] + 1) % dp->states)
dp->newcell[i + mj] = dp->oldcell[k + ml];
}
mj += dp->ncols;
}
} else if (dp->neighbors == 4 || dp->neighbors == 8) {
for (j = 0; j < dp->nrows; j++) {
for (i = 0; i < dp->ncols; i++) {
/* N */
k = i;
l = (!j) ? dp->nrows - 1 : j - 1;
ml = l * dp->ncols;
if (dp->oldcell[k + ml] ==
(int) (dp->oldcell[i + mj] + 1) % dp->states)
dp->newcell[i + mj] = dp->oldcell[k + ml];
/* E */
k = (i + 1 == dp->ncols) ? 0 : i + 1;
ml = mj;
if (dp->oldcell[k + ml] ==
(int) (dp->oldcell[i + mj] + 1) % dp->states)
dp->newcell[i + mj] = dp->oldcell[k + ml];
/* S */
k = i;
l = (j + 1 == dp->nrows) ? 0 : j + 1;
ml = l * dp->ncols;
if (dp->oldcell[k + ml] ==
(int) (dp->oldcell[i + mj] + 1) % dp->states)
dp->newcell[i + mj] = dp->oldcell[k + ml];
/* W */
k = (!i) ? dp->ncols - 1 : i - 1;
l = j;
ml = mj;
if (dp->oldcell[k + ml] ==
(int) (dp->oldcell[i + mj] + 1) % dp->states)
dp->newcell[i + mj] = dp->oldcell[k + ml];
}
mj += dp->ncols;
}
if (dp->neighbors == 8) {
mj = 0;
for (j = 0; j < dp->nrows; j++) {
for (i = 0; i < dp->ncols; i++) {
/* NE */
k = (i + 1 == dp->ncols) ? 0 : i + 1;
l = (!j) ? dp->nrows - 1 : j - 1;
ml = l * dp->ncols;
if (dp->oldcell[k + ml] ==
(int) (dp->oldcell[i + mj] + 1) % dp->states)
dp->newcell[i + mj] = dp->oldcell[k + ml];
/* SE */
k = (i + 1 == dp->ncols) ? 0 : i + 1;
l = (j + 1 == dp->nrows) ? 0 : j + 1;
ml = l * dp->ncols;
if (dp->oldcell[k + ml] ==
(int) (dp->oldcell[i + mj] + 1) % dp->states)
dp->newcell[i + mj] = dp->oldcell[k + ml];
/* SW */
k = (!i) ? dp->ncols - 1 : i - 1;
l = (j + 1 == dp->nrows) ? 0 : j + 1;
ml = l * dp->ncols;
if (dp->oldcell[k + ml] ==
(int) (dp->oldcell[i + mj] + 1) % dp->states)
dp->newcell[i + mj] = dp->oldcell[k + ml];
/* NW */
k = (!i) ? dp->ncols - 1 : i - 1;
l = (!j) ? dp->nrows - 1 : j - 1;
ml = l * dp->ncols;
if (dp->oldcell[k + ml] ==
(int) (dp->oldcell[i + mj] + 1) % dp->states)
dp->newcell[i + mj] = dp->oldcell[k + ml];
}
mj += dp->ncols;
}
}
} else if (dp->neighbors == 3 || dp->neighbors == 9 ||
dp->neighbors == 12) {
for (j = 0; j < dp->nrows; j++) {
for (i = 0; i < dp->ncols; i++) {
if ((i + j) % 2) { /* right */
/* W */
k = (!i) ? dp->ncols - 1 : i - 1;
ml = mj;
if (dp->oldcell[k + ml] ==
(int) (dp->oldcell[i + mj] + 1) % dp->states)
dp->newcell[i + mj] = dp->oldcell[k + ml];
} else { /* left */
/* E */
k = (i + 1 == dp->ncols) ? 0 : i + 1;
ml = mj;
if (dp->oldcell[k + ml] ==
(int) (dp->oldcell[i + mj] + 1) % dp->states)
dp->newcell[i + mj] = dp->oldcell[k + ml];
}
/* N */
k = i;
l = (!j) ? dp->nrows - 1 : j - 1;
ml = l * dp->ncols;
if (dp->oldcell[k + ml] ==
(int) (dp->oldcell[i + mj] + 1) % dp->states)
dp->newcell[i + mj] = dp->oldcell[k + ml];
/* S */
k = i;
l = (j + 1 == dp->nrows) ? 0 : j + 1;
ml = l * dp->ncols;
if (dp->oldcell[k + ml] ==
(int) (dp->oldcell[i + mj] + 1) % dp->states)
dp->newcell[i + mj] = dp->oldcell[k + ml];
}
mj += dp->ncols;
}
if (dp->neighbors == 9 || dp->neighbors == 12) {
mj = 0;
for (j = 0; j < dp->nrows; j++) {
for (i = 0; i < dp->ncols; i++) {
/* NN */
k = i;
if (!j)
l = dp->nrows - 2;
else if (!(j - 1))
l = dp->nrows - 1;
else
l = j - 2;
ml = l * dp->ncols;
if (dp->oldcell[k + ml] ==
(int) (dp->oldcell[i + mj] + 1) % dp->states)
dp->newcell[i + mj] = dp->oldcell[k + ml];
/* SS */
k = i;
if (j + 1 == dp->nrows)
l = 1;
else if (j + 2 == dp->nrows)
l = 0;
else
l = j + 2;
ml = l * dp->ncols;
if (dp->oldcell[k + ml] ==
(int) (dp->oldcell[i + mj] + 1) % dp->states)
dp->newcell[i + mj] = dp->oldcell[k + ml];
/* NW */
k = (!i) ? dp->ncols - 1 : i - 1;
l = (!j) ? dp->nrows - 1 : j - 1;
ml = l * dp->ncols;
if (dp->oldcell[k + ml] ==
(int) (dp->oldcell[i + mj] + 1) % dp->states)
dp->newcell[i + mj] = dp->oldcell[k + ml];
/* NE */
k = (i + 1 == dp->ncols) ? 0 : i + 1;
l = (!j) ? dp->nrows - 1 : j - 1;
ml = l * dp->ncols;
if (dp->oldcell[k + ml] ==
(int) (dp->oldcell[i + mj] + 1) % dp->states)
dp->newcell[i + mj] = dp->oldcell[k + ml];
/* SW */
k = (!i) ? dp->ncols - 1 : i - 1;
l = (j + 1 == dp->nrows) ? 0 : j + 1;
ml = l * dp->ncols;
if (dp->oldcell[k + ml] ==
(int) (dp->oldcell[i + mj] + 1) % dp->states)
dp->newcell[i + mj] = dp->oldcell[k + ml];
/* SE */
k = (i + 1 == dp->ncols) ? 0 : i + 1;
l = (j + 1 == dp->nrows) ? 0 : j + 1;
ml = l * dp->ncols;
if (dp->oldcell[k + ml] ==
(int) (dp->oldcell[i + mj] + 1) % dp->states)
dp->newcell[i + mj] = dp->oldcell[k + ml];
}
mj += dp->ncols;
}
if (dp->neighbors == 12) {
mj = 0;
for (j = 0; j < dp->nrows; j++) {
for (i = 0; i < dp->ncols; i++) {
if ((i + j) % 2) { /* right */
/* NNW */
k = (!i) ? dp->ncols - 1 : i - 1;
if (!j)
l = dp->nrows - 2;
else if (!(j - 1))
l = dp->nrows - 1;
else
l = j - 2;
ml = l * dp->ncols;
if (dp->oldcell[k + ml] ==
(int) (dp->oldcell[i + mj] + 1) % dp->states)
dp->newcell[i + mj] = dp->oldcell[k + ml];
/* SSW */
k = (!i) ? dp->ncols - 1 : i - 1;
if (j + 1 == dp->nrows)
l = 1;
else if (j + 2 == dp->nrows)
l = 0;
else
l = j + 2;
ml = l * dp->ncols;
if (dp->oldcell[k + ml] ==
(int) (dp->oldcell[i + mj] + 1) % dp->states)
dp->newcell[i + mj] = dp->oldcell[k + ml];
/* EE */
k = (i + 1 == dp->ncols) ? 0 : i + 1;
l = j;
ml = mj;
if (dp->oldcell[k + ml] ==
(int) (dp->oldcell[i + mj] + 1) % dp->states)
dp->newcell[i + mj] = dp->oldcell[k + ml];
} else { /* left */
/* NNE */
k = (i + 1 == dp->ncols) ? 0 : i + 1;
if (!j)
l = dp->nrows - 2;
else if (!(j - 1))
l = dp->nrows - 1;
else
l = j - 2;
ml = l * dp->ncols;
if (dp->oldcell[k + ml] ==
(int) (dp->oldcell[i + mj] + 1) % dp->states)
dp->newcell[i + mj] = dp->oldcell[k + ml];
/* SSE */
k = (i + 1 == dp->ncols) ? 0 : i + 1;
if (j + 1 == dp->nrows)
l = 1;
else if (j + 2 == dp->nrows)
l = 0;
else
l = j + 2;
ml = l * dp->ncols;
if (dp->oldcell[k + ml] ==
(int) (dp->oldcell[i + mj] + 1) % dp->states)
dp->newcell[i + mj] = dp->oldcell[k + ml];
/* WW */
k = (!i) ? dp->ncols - 1 : i - 1;
l = j;
ml = mj;
if (dp->oldcell[k + ml] ==
(int) (dp->oldcell[i + mj] + 1) % dp->states)
dp->newcell[i + mj] = dp->oldcell[k + ml];
}
}
mj += dp->ncols;
}
}
}
}
mj = 0;
for (j = 0; j < dp->nrows; j++) {
for (i = 0; i < dp->ncols; i++)
if (dp->oldcell[i + mj] != dp->newcell[i + mj]) {
dp->oldcell[i + mj] = dp->newcell[i + mj];
if (!addtolist(mi, i, j, dp->oldcell[i + mj])) {
free_demon(MI_DISPLAY(mi), dp);
return;
}
}
mj += dp->ncols;
}
if (++dp->generation > MI_CYCLES(mi))
init_demon(mi);
dp->state = 0;
} else {
if (dp->ncells[dp->state])
if (!draw_state(mi, dp->state)) {
free_demon(MI_DISPLAY(mi), dp);
return;
}
dp->state++;
}
if (dp->redrawing) {
for (i = 0; i < REDRAWSTEP; i++) {
if (dp->oldcell[dp->redrawpos]) {
drawcell(mi, dp->redrawpos % dp->ncols, dp->redrawpos / dp->ncols,
dp->oldcell[dp->redrawpos]);
}
if (++(dp->redrawpos) >= dp->ncols * dp->nrows) {
dp->redrawing = 0;
break;
}
}
}
}
void listen_from_peers()
{
struct peer_state* peer = peers;
unsigned int msglen = 0;
while(missing_blocks() > 0)
{
fd_set fdrset_clone;
fd_set fdwset_clone;
FD_COPY(&fdrset,&fdrset_clone);
FD_COPY(&fdwset,&fdwset_clone);
int rdy = select(FD_SETSIZE,&fdrset_clone,&fdwset_clone,0, 0);
if(rdy <= 0) {
continue;
}
peer = peers;
if(active_peers() == 0){
break;
}
while(peer){
if(FD_ISSET(peer->socket,&fdwset_clone)){
if(peer->connected == 0){
//to send the handshake if it is not connected
send_handshake(peer);
}
else if(peer->send_count > 0) {
//to send the have/interested/piece messages to peers
send_buffed_msg(peer);
}
}
if(FD_ISSET(peer->socket,&fdrset_clone))
{
int newbytes = recv(peer->socket,peer->incoming+peer->count,BUFSIZE-peer->count,0);
if(newbytes <= 0){
peer->trying_to_connect = 0;
if(newbytes == 0){
piece_status[peer->requested_piece] = PIECE_EMPTY;
}
disconnet_peer(peer);
reconnect_peer(peer);
peer = peer->next;
continue;
}
peer->count += newbytes;
if(!peer->handshaked){
peer->count -= peer->incoming[0]+49;
if(peer->count) {
memmove(peer->incoming,peer->incoming + peer->incoming[0]+49,peer->count);
}
peer->handshaked = 1;
}
if(memcmp(peer->incoming+peer->incoming[0]+8+20,"-UICCS450-",strlen("-UICCS450-"))==0) {
fprintf(stderr,"Caught a CS450 peer, exiting.\n");
disconnet_peer(peer);
continue;
}
while(peer->count >= (ntohl(((int*)peer->incoming)[0])) + 4){
msglen = ntohl(((int*)peer->incoming)[0]);
switch(peer->incoming[4]) {
// CHOKE
case 0: {
if(debug)
fprintf(stderr,"Choke\n");
peer->choked = 1;
piece_status[peer->requested_piece]=PIECE_EMPTY;
peer->requested_piece = -1;
break;
}
// UNCHOKE
case 1: {
if(debug)
fprintf(stderr,"Unchoke\n");
peer->choked = 0;
peer->requested_piece = next_piece(-1,peer);
request_block(peer,peer->requested_piece,0);
break;
}
//Interested
case 2: {
//dev_notifier();
send_choke_unchoke_msg(peer,0); //ischoked = 0
peer->not_interested = 0;
break;
}
//Not interested
case 3: {
//dev_notifier();
peer->not_interested = 1;
break;
}
// HAVE -- update the bitfield for this peer
case 4: {
int piece = ntohl(*((int*)&peer->incoming[5]));
int bitfield_byte = piece/8;
int bitfield_bit = piece%8;
if(debug)
fprintf(stderr,"Have %d\n",piece);
peer->bitfield[bitfield_byte] |= 1 << (7 - bitfield_bit);
piece_occurence_value[piece]++;
send_interested(peer);
break;
}
// BITFIELD -- set the bitfield for this peer
case 5:
//peer->choked = 0; //commenting it according to prof's note in class
if(debug)
printf("Bitfield of length %d\n",msglen-1);
int fieldlen = msglen - 1;
if(fieldlen != (file_length/piece_length/8+1)) {
disconnet_peer(peer);
if(active_peers() == 0){
break;
}
peer = peer->next;
continue;
}
memcpy(peer->bitfield,peer->incoming+5,fieldlen);
read_bit_maps(peer->bitfield,fieldlen);
send_interested(peer);
break;
//Request piece
case 6: {
if(peer->i_choked_it == 1)
break;
decode_request_send_piece_to_peer(peer);
}
break;
// PIECE
case 7: {
//make the tit for tatter
peer->send_recv_balancer++;
if(peer->i_choked_it && peer->send_recv_balancer == 0){
peer->i_choked_it = 0;
send_choke_unchoke_msg(peer,0); //unchoke peer
}
int piece = ntohl(*((int*)&peer->incoming[5]));
int offset = ntohl(*((int*)&peer->incoming[9]));
int datalen = msglen - 9;
fprintf(stderr,"Writing piece %d, offset %d, ending at %d\n",piece,offset,piece*piece_length+offset+datalen);
write_block(peer->incoming+13,piece,offset,datalen,1);
draw_state();
offset+=datalen;
if(offset==piece_length || (piece*piece_length+offset == file_length) ) {
broadcast_have_msg(piece);
draw_state();
if(debug)
fprintf(stderr,"Reached end of piece %d at offset %d\n",piece,offset);
peer->requested_piece=next_piece(piece,peer);
offset = 0;
}
request_block(peer,peer->requested_piece,offset);
break;
}
}
drop_message(peer);
}
}
peer = peer->next;
}
}
return;
}
void
draw_dilemma(ModeInfo * mi)
{
int col, row, mrow, colrow, n, i;
dilemmastruct *dp;
if (dilemmas == NULL)
return;
dp = &dilemmas[MI_SCREEN(mi)];
if (dp->s == NULL)
return;
MI_IS_DRAWN(mi) = True;
if (dp->state >= 2 * COLORS) {
for (col = 0; col < dp->ncols; col++) {
for (row = 0; row < dp->nrows; row++) {
colrow = col + row * dp->ncols;
if (conscious)
dp->payoff[colrow] =
dp->pm[(int) dp->s[colrow]][(int) dp->s[colrow]];
else
dp->payoff[colrow] = 0.0;
for (n = 0; n < dp->neighbors; n++)
dp->payoff[colrow] +=
dp->pm[(int) dp->s[colrow]][(int)
dp->s[neighbor_position(dp,
col, row, n * 360 / dp->neighbors)]];
}
}
for (row = 0; row < dp->nrows; row++) {
for (col = 0; col < dp->ncols; col++) {
float hp;
int position;
colrow = col + row * dp->ncols;
hp = dp->payoff[colrow];
dp->sn[colrow] = dp->s[colrow];
for (n = 0; n < dp->neighbors; n++) {
position = neighbor_position(dp, col, row, n * 360 / dp->neighbors);
if (ROUND_FLOAT(dp->payoff[position], 0.001) >
ROUND_FLOAT(hp, 0.001)) {
hp = dp->payoff[position];
dp->sn[colrow] = dp->s[position];
}
}
}
}
mrow = 0;
for (row = 0; row < dp->nrows; row++) {
for (col = 0; col < dp->ncols; col++) {
addtolist(mi, col, row,
dp->sn[col + mrow] * BITMAPS + dp->s[col + mrow]);
}
mrow += dp->ncols;
}
if (++dp->generation > MI_CYCLES(mi) ||
dp->defectors == dp->npositions || dp->defectors == 0)
init_dilemma(mi);
dp->state = 0;
} else {
if (dp->state < COLORS) {
draw_state(mi, dp->state);
}
dp->state++;
}
#if 1
if (dp->redrawing) {
for (i = 0; i < REDRAWSTEP; i++) {
drawcell(mi, dp->redrawpos % dp->ncols, dp->redrawpos / dp->ncols,
dp->colors[(int) dp->sn[dp->redrawpos]][(int) dp->s[dp->redrawpos]],
dp->sn[dp->redrawpos], False);
if (++(dp->redrawpos) >= dp->npositions) {
dp->redrawing = 0;
break;
}
}
}
#endif
}
// handles the message. no, we *don't* need to pass in msglen
int handle_message(struct peer_state* peer) {
int msglen = ntohl(((int*)peer->incoming)[0]); // because not returned from receive message
int newbytes = 0;
fflush(stdout);
if(msglen == 0) {
piece_status[peer->requested_piece] = PIECE_EMPTY;
draw_state();
shutdown_peer(peer);
return 0;
}
// not picking any of the cases in switch; calling handle_message prematurely?
switch(peer->incoming[4]) {
// CHOKE
case 0: {
if(debug)
fprintf(stderr,"Choke\n");
peer->choked = 1;
piece_status[peer->requested_piece] = PIECE_EMPTY;
peer->requested_piece = -1;
break;
}
// UNCHOKE
case 1: {
if(debug)
fprintf(stderr,"Unchoke\n");
peer->choked = 0;
// grab a new piece - WARNING: this assumes that you don't get choked mid-piece!
peer->requested_piece = next_piece(-1);
// keep track of how many bytes downloaded of the piece
// add to piece_status
request_block(peer,peer->requested_piece,0);
break;
}
// INTERESTED
case 2: {
// TODO: Send unchoke message to peer (?)
peer->choked = 0; // unchoke peer
break;
}
// HAVE -- update the bitfield for this peer
case 4: {
int piece_index = ntohl(*((int*)&peer->incoming[5]));
int bitfield_byte = piece_index/8;
int bitfield_bit = 7-(piece_index%8);
if(debug)
fprintf(stderr,"Have %d\n", piece_index);
peer->bitfield[bitfield_byte] |= 1 << bitfield_bit;
send_interested(peer);
break;
}
// BITFIELD - set the bitfield for this peer
case 5: {
peer->choked = 0;
if(debug)
printf("Bitfield of length %d\n", msglen-1);
int fieldlen = msglen - 1;
if(fieldlen != (file_length/piece_length/8+1)) {
fprintf(stderr,"Incorrect bitfield size, expected %d\n", file_length/piece_length/8+1);
shutdown_peer(peer);
return 0;
}
memcpy(peer->bitfield,peer->incoming+5,fieldlen);
send_interested(peer);
break;
}
// REQUEST
case 6: {
// peer is requesting piece
// copy from file
// send to them
// update ratio information
break;
}
// PIECE
case 7: {
int piece = ntohl(*((int*)&peer->incoming[5]));
int offset = ntohl(*((int*)&peer->incoming[9]));
int datalen = msglen - 9;
fprintf(stderr,"Writing piece %d, offset %d, ending at %d\n", piece, offset, piece*piece_length+offset+datalen);
write_block(peer->incoming+13,piece,offset,datalen,1); // save this block to comp
draw_state(); // segfault source?
offset += datalen;
if(offset==piece_length || (piece*piece_length+offset == file_length) ) {
if(debug)
fprintf(stderr, "Reached end of piece %d at offset %d\n", piece, offset);
peer->requested_piece = next_piece(piece);
offset = 0;
if(peer->requested_piece == -1) {
fprintf(stderr,"No more pieces to download!\n");
// but don't exit if sth. is still being downloaded
for(int i = 0; i < file_length/piece_length+1; i++)
if(piece_status[i] != 2) {
shutdown_peer(peer);
return 0;
}
shutdown_peer(peer);
return 0;
}
}
request_block(peer,peer->requested_piece,offset);
break;
}
case 20: {
printf("Extended type is %d\n", peer->incoming[5]);
struct bencode *extended = ben_decode(peer->incoming,msglen);
print_bencode(extended);
break;
}
}
drop_message(peer);
return 1;
}