summaryrefslogtreecommitdiff
path: root/src/PeerMessage.cc
blob: ddaa30664b8ae8698667f12a4cbf51dca0dbe934 (plain)
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
/* <!-- copyright */
/*
 * aria2 - a simple utility for downloading files faster
 *
 * Copyright (C) 2006 Tatsuhiro Tsujikawa
 *
 * This program is free software; you can redistribute it and/or modify
 * it under the terms of the GNU General Public License as published by
 * the Free Software Foundation; either version 2 of the License, or
 * (at your option) any later version.
 *
 * This program is distributed in the hope that it will be useful,
 * but WITHOUT ANY WARRANTY; without even the implied warranty of
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
 * GNU General Public License for more details.
 *
 * You should have received a copy of the GNU General Public License
 * along with this program; if not, write to the Free Software
 * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
 */
/* copyright --> */
#include "PeerMessage.h"
#include "Util.h"

void PeerMessage::setBitfield(const unsigned char* bitfield, int bitfieldLength) {
  if(this->bitfield != NULL) {
    delete [] bitfield;
  }
  this->bitfieldLength = bitfieldLength;
  this->bitfield = new unsigned char[this->bitfieldLength];
  memcpy(this->bitfield, bitfield, this->bitfieldLength);
}

void PeerMessage::setBlock(const char* block, int blockLength) {
  if(this->block != NULL) {
    delete [] block;
  }
  this->blockLength = blockLength;
  this->block = new char[this->blockLength];
  memcpy(this->block, block, this->blockLength);
}

string PeerMessage::toString() const {
  switch(id) {
  case CHOKE:
    return "choke";
  case UNCHOKE:
    return "unchoke";
  case INTERESTED:
    return "interested";
  case NOT_INTERESTED:
    return "not interested";
  case HAVE:
    return "have index="+Util::itos(index);
  case BITFIELD:
    return "bitfield "+Util::toHex(bitfield, bitfieldLength);
  case REQUEST:
    return "request index="+Util::itos(index)+", begin="+Util::itos(begin)+
      ", length="+Util::itos(length);
  case PIECE:
    return "piece index="+Util::itos(index)+", begin="+Util::itos(begin)+
      ", length="+Util::itos(blockLength);
  case CANCEL:
    return "calcel index="+Util::itos(index)+", begin="+Util::itos(begin)+
      ", length="+Util::itos(length);
  case KEEP_ALIVE:
    return "keep alive";
  default:
    return "unknown";
  }
}