BtPieceMessage.cc 9.5 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283
  1. /* <!-- copyright */
  2. /*
  3. * aria2 - The high speed download utility
  4. *
  5. * Copyright (C) 2006 Tatsuhiro Tsujikawa
  6. *
  7. * This program is free software; you can redistribute it and/or modify
  8. * it under the terms of the GNU General Public License as published by
  9. * the Free Software Foundation; either version 2 of the License, or
  10. * (at your option) any later version.
  11. *
  12. * This program is distributed in the hope that it will be useful,
  13. * but WITHOUT ANY WARRANTY; without even the implied warranty of
  14. * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
  15. * GNU General Public License for more details.
  16. *
  17. * You should have received a copy of the GNU General Public License
  18. * along with this program; if not, write to the Free Software
  19. * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
  20. *
  21. * In addition, as a special exception, the copyright holders give
  22. * permission to link the code of portions of this program with the
  23. * OpenSSL library under certain conditions as described in each
  24. * individual source file, and distribute linked combinations
  25. * including the two.
  26. * You must obey the GNU General Public License in all respects
  27. * for all of the code used other than OpenSSL. If you modify
  28. * file(s) with this exception, you may extend this exception to your
  29. * version of the file(s), but you are not obligated to do so. If you
  30. * do not wish to do so, delete this exception statement from your
  31. * version. If you delete this exception statement from all source
  32. * files in the program, then also delete it here.
  33. */
  34. /* copyright --> */
  35. #include "BtPieceMessage.h"
  36. #include "PeerMessageUtil.h"
  37. #include "Util.h"
  38. #include "message.h"
  39. #include "DlAbortEx.h"
  40. #include "BtChokingEvent.h"
  41. #include "BtCancelSendingPieceEvent.h"
  42. void BtPieceMessage::setBlock(const unsigned char* block, int32_t blockLength) {
  43. delete [] this->block;
  44. this->blockLength = blockLength;
  45. this->block = new unsigned char[this->blockLength];
  46. memcpy(this->block, block, this->blockLength);
  47. }
  48. BtPieceMessageHandle BtPieceMessage::create(const unsigned char* data, int32_t dataLength) {
  49. if(dataLength <= 9) {
  50. throw new DlAbortEx(EX_INVALID_PAYLOAD_SIZE, "piece", dataLength, 9);
  51. }
  52. int8_t id = PeerMessageUtil::getId(data);
  53. if(id != ID) {
  54. throw new DlAbortEx(EX_INVALID_BT_MESSAGE_ID, id, "piece", ID);
  55. }
  56. BtPieceMessageHandle message = new BtPieceMessage();
  57. message->setIndex(PeerMessageUtil::getIntParam(data, 1));
  58. message->setBegin(PeerMessageUtil::getIntParam(data, 5));
  59. message->setBlock(data+9, dataLength-9);
  60. return message;
  61. }
  62. void BtPieceMessage::doReceivedAction() {
  63. RequestSlot slot = dispatcher->getOutstandingRequest(index,
  64. begin,
  65. blockLength);
  66. peer->updateDownloadLength(blockLength);
  67. if(!RequestSlot::isNull(slot)) {
  68. peer->snubbing = false;
  69. peer->updateLatency(slot.getLatencyInMillis());
  70. PieceHandle piece = pieceStorage->getPiece(index);
  71. int64_t offset =
  72. ((int64_t)index)*btContext->getPieceLength()+begin;
  73. logger->debug("CUID#%d - Piece received. index=%d, begin=%d, length=%d, offset=%llu, blockIndex=%d",
  74. cuid, index, begin, blockLength, offset, slot.getBlockIndex());
  75. pieceStorage->getDiskAdaptor()->writeData(block,
  76. blockLength,
  77. offset);
  78. piece->completeBlock(slot.getBlockIndex());
  79. logger->debug("CUID#%d - Piece bitfield %s",
  80. cuid,
  81. Util::toHex(piece->getBitfield(),
  82. piece->getBitfieldLength()).c_str());
  83. dispatcher->removeOutstandingRequest(slot);
  84. if(piece->pieceComplete()) {
  85. if(checkPieceHash(piece)) {
  86. onNewPiece(piece);
  87. } else {
  88. onWrongPiece(piece);
  89. }
  90. }
  91. }
  92. }
  93. int32_t BtPieceMessage::MESSAGE_HEADER_LENGTH = 13;
  94. const unsigned char* BtPieceMessage::getMessageHeader() {
  95. if(!msgHeader) {
  96. /**
  97. * len --- 9+blockLength, 4bytes
  98. * id --- 7, 1byte
  99. * index --- index, 4bytes
  100. * begin --- begin, 4bytes
  101. * total: 13bytes
  102. */
  103. msgHeader = new unsigned char[MESSAGE_HEADER_LENGTH];
  104. PeerMessageUtil::createPeerMessageString(msgHeader, MESSAGE_HEADER_LENGTH,
  105. 9+blockLength, ID);
  106. PeerMessageUtil::setIntParam(&msgHeader[5], index);
  107. PeerMessageUtil::setIntParam(&msgHeader[9], begin);
  108. }
  109. return msgHeader;
  110. }
  111. int32_t BtPieceMessage::getMessageHeaderLength() {
  112. return MESSAGE_HEADER_LENGTH;
  113. }
  114. void BtPieceMessage::send() {
  115. if(invalidate) {
  116. return;
  117. }
  118. if(!headerSent) {
  119. if(!sendingInProgress) {
  120. logger->info(MSG_SEND_PEER_MESSAGE,
  121. cuid, peer->ipaddr.c_str(), peer->port,
  122. toString().c_str());
  123. getMessageHeader();
  124. leftDataLength = getMessageHeaderLength();
  125. sendingInProgress = true;
  126. }
  127. int32_t writtenLength
  128. = peerConnection->sendMessage(msgHeader+getMessageHeaderLength()-leftDataLength,
  129. leftDataLength);
  130. if(writtenLength == leftDataLength) {
  131. headerSent = true;
  132. leftDataLength = blockLength;
  133. } else {
  134. leftDataLength -= writtenLength;
  135. }
  136. }
  137. if(headerSent) {
  138. sendingInProgress = false;
  139. int64_t pieceDataOffset =
  140. ((int64_t)index)*btContext->getPieceLength()+begin+blockLength-leftDataLength;
  141. int32_t writtenLength =
  142. sendPieceData(pieceDataOffset, leftDataLength);
  143. peer->updateUploadLength(writtenLength);
  144. if(writtenLength < leftDataLength) {
  145. sendingInProgress = true;
  146. }
  147. leftDataLength -= writtenLength;
  148. }
  149. }
  150. int32_t BtPieceMessage::sendPieceData(int64_t offset, int32_t length) const {
  151. int32_t BUF_SIZE = 256;
  152. unsigned char buf[BUF_SIZE];
  153. int32_t iteration = length/BUF_SIZE;
  154. int32_t writtenLength = 0;
  155. for(int32_t i = 0; i < iteration; i++) {
  156. if(pieceStorage->getDiskAdaptor()->readData(buf, BUF_SIZE, offset+i*BUF_SIZE) < BUF_SIZE) {
  157. throw new DlAbortEx("Failed to read data from disk.");
  158. }
  159. int32_t ws = peerConnection->sendMessage(buf, BUF_SIZE);
  160. writtenLength += ws;
  161. if(ws != BUF_SIZE) {
  162. return writtenLength;
  163. }
  164. }
  165. int32_t rem = length%BUF_SIZE;
  166. if(rem > 0) {
  167. if(pieceStorage->getDiskAdaptor()->readData(buf, rem, offset+iteration*BUF_SIZE) < rem) {
  168. throw new DlAbortEx("Failed to read data from disk.");
  169. }
  170. int32_t ws = peerConnection->sendMessage(buf, rem);
  171. writtenLength += ws;
  172. }
  173. return writtenLength;
  174. }
  175. string BtPieceMessage::toString() const {
  176. return "piece index="+Util::itos(index)+", begin="+Util::itos(begin)+
  177. ", length="+Util::itos(blockLength);
  178. }
  179. bool BtPieceMessage::checkPieceHash(const PieceHandle& piece) {
  180. int64_t offset =
  181. ((int64_t)piece->getIndex())*btContext->getPieceLength();
  182. return pieceStorage->getDiskAdaptor()->messageDigest(offset, piece->getLength(), DIGEST_ALGO_SHA1) ==
  183. btContext->getPieceHash(piece->getIndex());
  184. }
  185. void BtPieceMessage::onNewPiece(const PieceHandle& piece) {
  186. logger->info(MSG_GOT_NEW_PIECE, cuid, piece->getIndex());
  187. pieceStorage->completePiece(piece);
  188. pieceStorage->advertisePiece(cuid, piece->getIndex());
  189. }
  190. void BtPieceMessage::onWrongPiece(const PieceHandle& piece) {
  191. logger->info(MSG_GOT_WRONG_PIECE, cuid, piece->getIndex());
  192. erasePieceOnDisk(piece);
  193. piece->clearAllBlock();
  194. requestFactory->removeTargetPiece(piece);
  195. }
  196. void BtPieceMessage::erasePieceOnDisk(const PieceHandle& piece) {
  197. int32_t BUFSIZE = 4096;
  198. unsigned char buf[BUFSIZE];
  199. memset(buf, 0, BUFSIZE);
  200. int64_t offset =
  201. ((int64_t)piece->getIndex())*btContext->getPieceLength();
  202. for(int32_t i = 0; i < piece->getLength()/BUFSIZE; i++) {
  203. pieceStorage->getDiskAdaptor()->writeData(buf, BUFSIZE, offset);
  204. offset += BUFSIZE;
  205. }
  206. int32_t r = piece->getLength()%BUFSIZE;
  207. if(r > 0) {
  208. pieceStorage->getDiskAdaptor()->writeData(buf, r, offset);
  209. }
  210. }
  211. bool BtPieceMessage::BtChokingEventListener::canHandle(const BtEventHandle& event) {
  212. BtChokingEvent* intEvent = dynamic_cast<BtChokingEvent*>(event.get());
  213. return intEvent != 0;
  214. }
  215. void BtPieceMessage::BtChokingEventListener::handleEventInternal(const BtEventHandle& event) {
  216. message->handleChokingEvent(event);
  217. }
  218. void BtPieceMessage::handleChokingEvent(const BtEventHandle& event) {
  219. if(!invalidate &&
  220. !sendingInProgress &&
  221. !peer->isInAmAllowedIndexSet(index)) {
  222. logger->debug("CUID#%d - Reject piece message in queue because"
  223. " the peer has been choked. index=%d, begin=%d, length=%d",
  224. cuid,
  225. index,
  226. begin,
  227. blockLength);
  228. if(peer->isFastExtensionEnabled()) {
  229. BtMessageHandle rej = messageFactory->createRejectMessage(index,
  230. begin,
  231. blockLength);
  232. dispatcher->addMessageToQueue(rej);
  233. }
  234. invalidate = true;
  235. }
  236. }
  237. bool BtPieceMessage::BtCancelSendingPieceEventListener::canHandle(const BtEventHandle& event) {
  238. BtCancelSendingPieceEvent* intEvent = dynamic_cast<BtCancelSendingPieceEvent*>(event.get());
  239. return intEvent != 0;
  240. }
  241. void BtPieceMessage::BtCancelSendingPieceEventListener::handleEventInternal(const BtEventHandle& event) {
  242. message->handleCancelSendingPieceEvent(event);
  243. }
  244. void BtPieceMessage::handleCancelSendingPieceEvent(const BtEventHandle& event) {
  245. BtCancelSendingPieceEvent* intEvent = (BtCancelSendingPieceEvent*)(event.get());
  246. if(!invalidate &&
  247. !sendingInProgress &&
  248. index == intEvent->getIndex() &&
  249. begin == intEvent->getBegin() &&
  250. blockLength == intEvent->getLength()) {
  251. logger->debug("CUID#%d - Reject piece message in queue because cancel"
  252. " message received. index=%d, begin=%d, length=%d",
  253. cuid, index, begin, blockLength);
  254. if(peer->isFastExtensionEnabled()) {
  255. BtMessageHandle rej = messageFactory->createRejectMessage(index,
  256. begin,
  257. blockLength);
  258. dispatcher->addMessageToQueue(rej);
  259. }
  260. invalidate = true;
  261. }
  262. }