summaryrefslogtreecommitdiff
path: root/src/PieceMessage.h
blob: 54c13148002349c4447a1d708156ba889bfe5895 (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
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
/* <!-- 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 --> */
#ifndef _D_PIECE_MESSAGE_H_
#define _D_PIECE_MESSAGE_H_

#include "PeerMessage.h"
#include "TorrentMan.h"

class PieceMessage : public PeerMessage {
private:
  int index;
  int begin;
  char* block;
  int blockLength;
  int leftDataLength;
  bool headerSent;
  int pendingCount;
  // for check
  int pieces;
  int pieceLength;
  
  char msgHeader[13];

  bool checkPieceHash(const Piece& piece);
  void onGotNewPiece(Piece& piece);
  void onGotWrongPiece(Piece& piece);
  void erasePieceOnDisk(const Piece& piece);
  int sendPieceData(long long int offset, int length) const;
public:
  PieceMessage():PeerMessage(),
		 index(0), begin(0), block(NULL), blockLength(0),
		 leftDataLength(0), headerSent(false),
		 pendingCount(0),
		 pieces(0), pieceLength(0) {}

  virtual ~PieceMessage() {
    if(block != NULL) {
      delete []  block;
    }
  }

  enum ID_t {
    ID = 7
  };

  int getIndex() const { return index; }
  void setIndex(int index) { this->index = index; }
  int getBegin() const { return begin; }
  void setBegin(int begin) { this->begin = begin; }
  const char* getBlock() const { return block; }
  void setBlock(const char* block, int blockLength);
  int getBlockLength() const { return blockLength; }
  void setBlockLength(int blockLength) { this->blockLength = blockLength; }

  void setPieces(int pieces) {
    this->pieces = pieces;
  }
  int getPieces() const { return pieces;}

  void setPieceLength(int pieceLength) {
    this->pieceLength = pieceLength;
  }
  int getPieceLength() const { return pieceLength;}

  void incrementPendingCount() { pendingCount++; }
  bool isPendingCountMax() const { return pendingCount > 2; }

  static PieceMessage* create(const char* data, int dataLength);

  virtual int getId() const { return ID; }
  virtual void receivedAction();
  virtual const char* getMessageHeader();
  virtual int getMessageHeaderLength();
  virtual void send();
  virtual void check() const;
  virtual string toString() const;
};

#endif // _D_PIECE_MESSAGE_H_