PeerInteractionCommand.cc 14 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460
  1. /* <!-- copyright */
  2. /*
  3. * aria2 - a simple utility for downloading files faster
  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., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
  20. */
  21. /* copyright --> */
  22. #include "PeerInteractionCommand.h"
  23. #include "PeerInitiateConnectionCommand.h"
  24. #include "PeerMessageUtil.h"
  25. #include "DlAbortEx.h"
  26. #include "Util.h"
  27. #include "message.h"
  28. #include "prefs.h"
  29. #include <algorithm>
  30. PeerInteractionCommand::PeerInteractionCommand(int cuid, Peer* peer,
  31. TorrentDownloadEngine* e,
  32. const Socket* s, int sequence)
  33. :PeerAbstractCommand(cuid, peer, e, s), sequence(sequence) {
  34. if(sequence == INITIATOR_SEND_HANDSHAKE) {
  35. setReadCheckSocket(NULL);
  36. setWriteCheckSocket(socket);
  37. setTimeout(e->option->getAsInt(PREF_PEER_CONNECTION_TIMEOUT));
  38. }
  39. peerConnection = new PeerConnection(cuid, socket, e->option, e->logger,
  40. peer, e->torrentMan);
  41. sendMessageQueue = new SendMessageQueue(cuid, peerConnection, e->torrentMan,
  42. e->logger);
  43. piece = Piece::nullPiece;
  44. keepAliveCheckPoint.tv_sec = 0;
  45. keepAliveCheckPoint.tv_usec = 0;
  46. chokeCheckPoint.tv_sec = 0;
  47. chokeCheckPoint.tv_usec = 0;
  48. freqCheckPoint.tv_sec = 0;
  49. freqCheckPoint.tv_usec = 0;
  50. chokeUnchokeCount = 0;
  51. haveCount = 0;
  52. }
  53. PeerInteractionCommand::~PeerInteractionCommand() {
  54. delete peerConnection;
  55. delete sendMessageQueue;
  56. e->torrentMan->unadvertisePiece(cuid);
  57. }
  58. bool PeerInteractionCommand::executeInternal() {
  59. if(sequence == INITIATOR_SEND_HANDSHAKE) {
  60. socket->setBlockingMode();
  61. setReadCheckSocket(socket);
  62. setTimeout(e->option->getAsInt(PREF_TIMEOUT));
  63. }
  64. setWriteCheckSocket(NULL);
  65. switch(sequence) {
  66. case INITIATOR_SEND_HANDSHAKE:
  67. peerConnection->sendHandshake();
  68. sequence = INITIATOR_WAIT_HANDSHAKE;
  69. break;
  70. case INITIATOR_WAIT_HANDSHAKE: {
  71. HandshakeMessage* handshakeMessage = peerConnection->receiveHandshake();
  72. if(handshakeMessage == NULL) {
  73. break;
  74. }
  75. peer->setPeerId(handshakeMessage->peerId);
  76. e->logger->info(MSG_RECEIVE_PEER_MESSAGE, cuid,
  77. peer->ipaddr.c_str(), peer->port,
  78. handshakeMessage->toString().c_str());
  79. delete handshakeMessage;
  80. if(e->torrentMan->getDownloadLength() > 0) {
  81. peerConnection->sendBitfield();
  82. }
  83. sequence = WIRED;
  84. break;
  85. }
  86. case RECEIVER_WAIT_HANDSHAKE: {
  87. HandshakeMessage* handshakeMessage = peerConnection->receiveHandshake();
  88. if(handshakeMessage == NULL) {
  89. break;
  90. }
  91. peer->setPeerId(handshakeMessage->peerId);
  92. e->logger->info(MSG_RECEIVE_PEER_MESSAGE, cuid,
  93. peer->ipaddr.c_str(), peer->port,
  94. handshakeMessage->toString().c_str());
  95. delete handshakeMessage;
  96. peerConnection->sendHandshake();
  97. if(e->torrentMan->getDownloadLength() > 0) {
  98. peerConnection->sendBitfield();
  99. }
  100. sequence = WIRED;
  101. break;
  102. }
  103. case WIRED:
  104. detectMessageFlooding();
  105. checkLongTimePeerChoking();
  106. checkInactiveConnection();
  107. syncPiece();
  108. decideChoking();
  109. for(int i = 0; i < 10; i++) {
  110. if(!socket->isReadable(0)) {
  111. break;
  112. }
  113. receiveMessage();
  114. }
  115. sendMessageQueue->deleteTimeoutRequestSlot(piece);
  116. sendMessageQueue->deleteCompletedRequestSlot(piece);
  117. sendInterest();
  118. sendMessages();
  119. break;
  120. }
  121. if(sendMessageQueue->countPendingMessage() > 0) {
  122. setWriteCheckSocket(socket);
  123. }
  124. e->commands.push(this);
  125. return false;
  126. }
  127. void PeerInteractionCommand::checkInactiveConnection() {
  128. if((!peer->amInterested && !peer->peerInterested &&
  129. e->torrentMan->connections >= MAX_PEER_LIST_SIZE) ||
  130. (!peer->amInterested && e->torrentMan->connections >= MAX_PEER_LIST_SIZE &&
  131. e->torrentMan->isEndGame())) {
  132. throw new DlAbortEx("marked as inactive connection.");
  133. }
  134. }
  135. void PeerInteractionCommand::detectMessageFlooding() {
  136. struct timeval now;
  137. gettimeofday(&now, NULL);
  138. if(freqCheckPoint.tv_sec == 0 && freqCheckPoint.tv_usec == 0) {
  139. freqCheckPoint = now;
  140. } else {
  141. if(Util::difftv(now, freqCheckPoint) >= 5*1000000) {
  142. if(chokeUnchokeCount*1.0/(Util::difftv(now, freqCheckPoint)/1000000) >= 0.4
  143. || haveCount*1.0/(Util::difftv(now, freqCheckPoint)/1000000) >= 20.0) {
  144. throw new DlAbortEx("flooding detected.");
  145. } else {
  146. chokeUnchokeCount = 0;
  147. haveCount = 0;
  148. freqCheckPoint = now;
  149. }
  150. }
  151. }
  152. }
  153. void PeerInteractionCommand::checkLongTimePeerChoking() {
  154. if(e->torrentMan->downloadComplete()) {
  155. return;
  156. }
  157. struct timeval now;
  158. gettimeofday(&now, NULL);
  159. if(chokeCheckPoint.tv_sec == 0 && chokeCheckPoint.tv_usec == 0) {
  160. if(peer->amInterested && peer->peerChoking) {
  161. chokeCheckPoint = now;
  162. }
  163. } else {
  164. if(peer->amInterested && peer->peerChoking) {
  165. if(Util::difftv(now, chokeCheckPoint) >= 3*60*1000000) {
  166. throw new DlAbortEx("too long choking");
  167. }
  168. } else {
  169. chokeCheckPoint.tv_sec = 0;
  170. chokeCheckPoint.tv_usec = 0;
  171. }
  172. }
  173. }
  174. void PeerInteractionCommand::syncPiece() {
  175. if(Piece::isNull(piece)) {
  176. return;
  177. }
  178. e->torrentMan->syncPiece(piece);
  179. }
  180. void PeerInteractionCommand::decideChoking() {
  181. if(e->torrentMan->downloadComplete()) {
  182. if(peer->amChocking && peer->peerInterested) {
  183. PendingMessage pendingMessage(PeerMessage::UNCHOKE, peerConnection);
  184. sendMessageQueue->addPendingMessage(pendingMessage);
  185. }
  186. return;
  187. }
  188. if(peer->shouldChoke()) {
  189. if(!peer->amChocking) {
  190. PendingMessage pendingMessage(PeerMessage::CHOKE, peerConnection);
  191. sendMessageQueue->addPendingMessage(pendingMessage);
  192. }
  193. } else if(peer->amChocking && peer->peerInterested) {
  194. PendingMessage pendingMessage(PeerMessage::UNCHOKE, peerConnection);
  195. sendMessageQueue->addPendingMessage(pendingMessage);
  196. } else if(!peer->peerInterested) {
  197. PendingMessage pendingMessage(PeerMessage::CHOKE, peerConnection);
  198. sendMessageQueue->addPendingMessage(pendingMessage);
  199. }
  200. }
  201. void PeerInteractionCommand::receiveMessage() {
  202. PeerMessage* message = peerConnection->receiveMessage();
  203. if(message == NULL) {
  204. return;
  205. }
  206. e->logger->info(MSG_RECEIVE_PEER_MESSAGE, cuid,
  207. peer->ipaddr.c_str(), peer->port,
  208. message->toString().c_str());
  209. try {
  210. switch(message->getId()) {
  211. case PeerMessage::KEEP_ALIVE:
  212. break;
  213. case PeerMessage::CHOKE:
  214. if(!peer->peerChoking) {
  215. chokeUnchokeCount++;
  216. }
  217. peer->peerChoking = true;
  218. break;
  219. case PeerMessage::UNCHOKE:
  220. if(peer->peerChoking) {
  221. chokeUnchokeCount++;
  222. }
  223. peer->peerChoking = false;
  224. break;
  225. case PeerMessage::INTERESTED:
  226. peer->peerInterested = true;
  227. break;
  228. case PeerMessage::NOT_INTERESTED:
  229. peer->peerInterested = false;
  230. break;
  231. case PeerMessage::HAVE:
  232. haveCount++;
  233. peer->updateBitfield(message->getIndex(), 1);
  234. break;
  235. case PeerMessage::BITFIELD:
  236. peer->setBitfield(message->getBitfield(), message->getBitfieldLength());
  237. break;
  238. case PeerMessage::REQUEST:
  239. if(e->torrentMan->hasPiece(message->getIndex())) {
  240. PendingMessage pendingMessage
  241. = PendingMessage::createPieceMessage(message->getIndex(),
  242. message->getBegin(),
  243. message->getLength(),
  244. e->torrentMan->pieceLength,
  245. peerConnection);
  246. sendMessageQueue->addPendingMessage(pendingMessage);
  247. e->torrentMan->addUploadLength(message->getLength());
  248. e->torrentMan->addDeltaUpload(message->getLength());
  249. }
  250. break;
  251. case PeerMessage::CANCEL:
  252. sendMessageQueue->deletePendingPieceMessage(message);
  253. break;
  254. case PeerMessage::PIECE: {
  255. RequestSlot slot = sendMessageQueue->getCorrespoindingRequestSlot(message);
  256. peer->addPeerUpload(message->getBlockLength());
  257. if(!Piece::isNull(piece) && !RequestSlot::isNull(slot)) {
  258. long long int offset =
  259. ((long long int)message->getIndex())*e->torrentMan->pieceLength+message->getBegin();
  260. e->logger->debug("CUID#%d - write block length = %d, offset=%lld",
  261. cuid, message->getBlockLength(), offset);
  262. e->torrentMan->diskWriter->writeData(message->getBlock(),
  263. message->getBlockLength(),
  264. offset);
  265. piece.completeBlock(slot.getBlockIndex());
  266. sendMessageQueue->deleteRequestSlot(slot);
  267. e->torrentMan->updatePiece(piece);
  268. e->logger->debug("CUID#%d - setting piece bit index=%d", cuid,
  269. slot.getBlockIndex());
  270. e->torrentMan->addDeltaDownload(message->getBlockLength());
  271. if(piece.pieceComplete()) {
  272. if(checkPieceHash(piece)) {
  273. onGotNewPiece();
  274. } else {
  275. onGotWrongPiece();
  276. }
  277. }
  278. }
  279. break;
  280. }
  281. }
  282. delete message;
  283. } catch(Exception* ex) {
  284. delete message;
  285. throw;
  286. }
  287. }
  288. void PeerInteractionCommand::onGotNewPiece() {
  289. e->logger->info(MSG_GOT_NEW_PIECE, cuid, piece.getIndex());
  290. e->torrentMan->completePiece(piece);
  291. e->torrentMan->advertisePiece(cuid, piece.getIndex());
  292. piece = Piece::nullPiece;
  293. }
  294. void PeerInteractionCommand::onGotWrongPiece() {
  295. e->logger->error(MSG_GOT_WRONG_PIECE, cuid, piece.getIndex());
  296. erasePieceOnDisk(piece);
  297. piece.clearAllBlock();
  298. e->torrentMan->updatePiece(piece);
  299. }
  300. // TODO this method removed when PeerBalancerCommand is implemented
  301. bool PeerInteractionCommand::prepareForNextPeer(int wait) {
  302. if(e->torrentMan->isPeerAvailable()) {
  303. Peer* peer = e->torrentMan->getPeer();
  304. int newCuid = e->torrentMan->getNewCuid();
  305. peer->cuid = newCuid;
  306. PeerInitiateConnectionCommand* command = new PeerInitiateConnectionCommand(newCuid, peer, e);
  307. e->commands.push(command);
  308. }
  309. return true;
  310. }
  311. bool PeerInteractionCommand::prepareForRetry(int wait) {
  312. e->commands.push(this);
  313. return false;
  314. }
  315. Piece PeerInteractionCommand::getNewPieceAndSendInterest() {
  316. sendMessageQueue->cancelAllRequest();
  317. Piece piece = e->torrentMan->getMissingPiece(peer);
  318. if(Piece::isNull(piece)) {
  319. e->logger->debug("CUID#%d - try to send not-interested", cuid);
  320. PendingMessage pendingMessage(PeerMessage::NOT_INTERESTED, peerConnection);
  321. sendMessageQueue->addPendingMessage(pendingMessage);
  322. } else {
  323. e->logger->debug("CUID#%d - starting download for piece #%d", cuid, piece.getIndex());
  324. e->logger->debug("CUID#%d - try to send interested", cuid);
  325. PendingMessage pendingMessage(PeerMessage::INTERESTED, peerConnection);
  326. sendMessageQueue->addPendingMessage(pendingMessage);
  327. }
  328. return piece;
  329. }
  330. void PeerInteractionCommand::sendInterest() {
  331. if(Piece::isNull(piece)) {
  332. // retrive new piece from TorrentMan
  333. piece = getNewPieceAndSendInterest();
  334. } else if(peer->peerChoking) {
  335. sendMessageQueue->cancelAllRequest(piece);
  336. e->torrentMan->cancelPiece(piece);
  337. piece = Piece::nullPiece;
  338. } else if(piece.pieceComplete()) {
  339. piece = getNewPieceAndSendInterest();
  340. }
  341. }
  342. void PeerInteractionCommand::createRequestPendingMessage(int blockIndex) {
  343. PendingMessage pendingMessage =
  344. PendingMessage::createRequestMessage(piece, blockIndex, peerConnection);
  345. sendMessageQueue->addPendingMessage(pendingMessage);
  346. }
  347. void PeerInteractionCommand::sendMessages() {
  348. if(!Piece::isNull(piece) && !peer->peerChoking) {
  349. if(e->torrentMan->isEndGame()) {
  350. BlockIndexes missingBlockIndexes = piece.getAllMissingBlockIndexes();
  351. if(sendMessageQueue->countRequestSlot() == 0) {
  352. random_shuffle(missingBlockIndexes.begin(), missingBlockIndexes.end());
  353. int count = 0;
  354. for(PieceIndexes::const_iterator itr = missingBlockIndexes.begin();
  355. itr != missingBlockIndexes.end() && count < 6; itr++, count++) {
  356. createRequestPendingMessage(*itr);
  357. }
  358. }
  359. } else {
  360. for(int i = sendMessageQueue->countRequestSlot(); i < 6; i++) {
  361. int blockIndex = piece.getMissingUnusedBlockIndex();
  362. if(blockIndex == -1) {
  363. break;
  364. }
  365. e->torrentMan->updatePiece(piece);
  366. createRequestPendingMessage(blockIndex);
  367. }
  368. }
  369. }
  370. sendMessageQueue->send();
  371. }
  372. void PeerInteractionCommand::onAbort(Exception* ex) {
  373. sendMessageQueue->cancelAllRequest(piece);
  374. e->torrentMan->cancelPiece(piece);
  375. PeerAbstractCommand::onAbort(ex);
  376. }
  377. void PeerInteractionCommand::keepAlive() {
  378. if(keepAliveCheckPoint.tv_sec == 0 && keepAliveCheckPoint.tv_usec == 0) {
  379. gettimeofday(&keepAliveCheckPoint, NULL);
  380. } else {
  381. struct timeval now;
  382. gettimeofday(&now, NULL);
  383. if(Util::difftv(now, keepAliveCheckPoint) >= (long long int)120*1000000) {
  384. if(sendMessageQueue->countPendingMessage() == 0) {
  385. peerConnection->sendKeepAlive();
  386. }
  387. keepAliveCheckPoint = now;
  388. }
  389. }
  390. }
  391. void PeerInteractionCommand::beforeSocketCheck() {
  392. if(sequence == WIRED) {
  393. e->torrentMan->unadvertisePiece(cuid);
  394. detectMessageFlooding();
  395. checkLongTimePeerChoking();
  396. checkInactiveConnection();
  397. PieceIndexes indexes = e->torrentMan->getAdvertisedPieceIndexes(cuid);
  398. if(indexes.size() >= 20) {
  399. PendingMessage pendingMessage(PeerMessage::BITFIELD, peerConnection);
  400. sendMessageQueue->addPendingMessage(pendingMessage);
  401. } else {
  402. if(sendMessageQueue->countPendingMessage() == 0) {
  403. for(PieceIndexes::iterator itr = indexes.begin(); itr != indexes.end(); itr++) {
  404. peerConnection->sendHave(*itr);
  405. }
  406. } else {
  407. for(PieceIndexes::iterator itr = indexes.begin(); itr != indexes.end(); itr++) {
  408. PendingMessage pendingMessage = PendingMessage::createHaveMessage(*itr, peerConnection);
  409. sendMessageQueue->addPendingMessage(pendingMessage);
  410. }
  411. }
  412. }
  413. keepAlive();
  414. }
  415. }
  416. bool PeerInteractionCommand::checkPieceHash(const Piece& piece) {
  417. long long int offset = ((long long int)piece.getIndex())*e->torrentMan->pieceLength;
  418. return e->torrentMan->diskWriter->sha1Sum(offset, piece.getLength()) ==
  419. e->torrentMan->getPieceHash(piece.getIndex());
  420. }
  421. void PeerInteractionCommand::erasePieceOnDisk(const Piece& piece) {
  422. int BUFSIZE = 4096;
  423. char buf[BUFSIZE];
  424. memset(buf, 0, BUFSIZE);
  425. long long int offset = ((long long int)piece.getIndex())*e->torrentMan->pieceLength;
  426. for(int i = 0; i < piece.getLength()/BUFSIZE; i++) {
  427. e->torrentMan->diskWriter->writeData(buf, BUFSIZE, offset);
  428. offset += BUFSIZE;
  429. }
  430. int r = piece.getLength()%BUFSIZE;
  431. if(r > 0) {
  432. e->torrentMan->diskWriter->writeData(buf, r, offset);
  433. }
  434. }