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
|
/* <!-- 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 "PendingMessage.h"
bool PendingMessage::processMessage() {
bool retval = true;
switch(peerMessageId) {
case PeerMessage::HAVE:
if(!peerConnection->getPeer()->hasPiece(index)) {
peerConnection->sendHave(index);
}
break;
case PeerMessage::BITFIELD:
peerConnection->sendBitfield();
break;
case PeerMessage::UNCHOKE:
if(peerConnection->getPeer()->amChocking) {
peerConnection->sendUnchoke();
peerConnection->getPeer()->amChocking = false;
}
break;
case PeerMessage::CHOKE:
if(!peerConnection->getPeer()->amChocking) {
peerConnection->sendChoke();
peerConnection->getPeer()->amChocking = true;
}
break;
case PeerMessage::NOT_INTERESTED:
if(peerConnection->getPeer()->amInterested) {
peerConnection->sendNotInterested();
peerConnection->getPeer()->amInterested = false;
}
break;
case PeerMessage::INTERESTED:
if(!peerConnection->getPeer()->amInterested) {
peerConnection->sendInterested();
peerConnection->getPeer()->amInterested = true;
}
break;
case PeerMessage::PIECE:
if((!peerConnection->getPeer()->amChocking &&
peerConnection->getPeer()->peerInterested) || inProgress) {
if(!inProgress) {
peerConnection->sendPieceHeader(index, begin, length);
peerConnection->getPeer()->addPeerDownload(length);
}
inProgress = false;
int writtenLength = peerConnection->sendPieceData(pieceDataOffset, leftPieceDataLength);
if(writtenLength != leftPieceDataLength) {
inProgress = true;
leftPieceDataLength -= writtenLength;
pieceDataOffset += writtenLength;
retval = false;
}
}
break;
case PeerMessage::REQUEST:
if(!peerConnection->getPeer()->peerChoking) {
peerConnection->sendRequest(index, begin, length);
}
break;
case PeerMessage::CANCEL:
peerConnection->sendCancel(index, begin, length);
break;
default:
break;
}
return retval;
}
PendingMessage PendingMessage::createRequestMessage(const Piece& piece,
int blockIndex,
PeerConnection* peerConnection) {
PendingMessage pendingMessage(PeerMessage::REQUEST, peerConnection);
pendingMessage.setIndex(piece.getIndex());
pendingMessage.setBegin(blockIndex*piece.getBlockLength());
pendingMessage.setLength(piece.getBlockLength(blockIndex));
pendingMessage.setBlockIndex(blockIndex);
return pendingMessage;
}
PendingMessage PendingMessage::createCancelMessage(int index, int begin, int length, PeerConnection* peerConnection) {
PendingMessage pendingMessage(PeerMessage::CANCEL, peerConnection);
pendingMessage.setIndex(index);
pendingMessage.setBegin(begin);
pendingMessage.setLength(length);
return pendingMessage;
}
PendingMessage PendingMessage::createPieceMessage(int index, int begin, int length, int pieceLength, PeerConnection* peerConnection) {
PendingMessage pendingMessage(PeerMessage::PIECE, peerConnection);
pendingMessage.setIndex(index);
pendingMessage.setBegin(begin);
pendingMessage.setLength(length);
pendingMessage.setPieceDataOffset(((long long int)index)*pieceLength+begin);
pendingMessage.setLeftPieceDataLength(length);
return pendingMessage;
}
PendingMessage PendingMessage::createHaveMessage(int index, PeerConnection* peerConnection) {
PendingMessage pendingMessage(PeerMessage::HAVE, peerConnection);
pendingMessage.setIndex(index);
return pendingMessage;
}
|
