DefaultBtInteractive.cc 16 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556
  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 "DefaultBtInteractive.h"
  36. #include <cstring>
  37. #include "prefs.h"
  38. #include "message.h"
  39. #include "BtHandshakeMessage.h"
  40. #include "Util.h"
  41. #include "BtKeepAliveMessage.h"
  42. #include "BtChokeMessage.h"
  43. #include "BtUnchokeMessage.h"
  44. #include "BtRequestMessage.h"
  45. #include "BtPieceMessage.h"
  46. #include "DlAbortEx.h"
  47. #include "BtExtendedMessage.h"
  48. #include "HandshakeExtensionMessage.h"
  49. #include "UTPexExtensionMessage.h"
  50. #include "DefaultExtensionMessageFactory.h"
  51. #include "ExtensionMessageRegistry.h"
  52. #include "DHTNode.h"
  53. #include "Peer.h"
  54. #include "Piece.h"
  55. #include "BtContext.h"
  56. #include "PieceStorage.h"
  57. #include "PeerStorage.h"
  58. #include "BtRuntime.h"
  59. #include "BtMessageReceiver.h"
  60. #include "BtMessageDispatcher.h"
  61. #include "BtMessageFactory.h"
  62. #include "BtRequestFactory.h"
  63. #include "PeerConnection.h"
  64. #include "Logger.h"
  65. #include "LogFactory.h"
  66. #include "StringFormat.h"
  67. #include "RequestGroup.h"
  68. #include "RequestGroupMan.h"
  69. namespace aria2 {
  70. DefaultBtInteractive::DefaultBtInteractive
  71. (const SharedHandle<BtContext>& btContext, const SharedHandle<Peer>& peer)
  72. :
  73. _btContext(btContext),
  74. peer(peer),
  75. logger(LogFactory::getInstance()),
  76. allowedFastSetSize(10),
  77. keepAliveInterval(120),
  78. _utPexEnabled(false),
  79. _dhtEnabled(false),
  80. _numReceivedMessage(0)
  81. {}
  82. DefaultBtInteractive::~DefaultBtInteractive() {}
  83. void DefaultBtInteractive::initiateHandshake() {
  84. SharedHandle<BtMessage> message =
  85. messageFactory->createHandshakeMessage(_btContext->getInfoHash(),
  86. _btContext->getPeerId());
  87. dispatcher->addMessageToQueue(message);
  88. dispatcher->sendMessages();
  89. }
  90. BtMessageHandle DefaultBtInteractive::receiveHandshake(bool quickReply) {
  91. SharedHandle<BtHandshakeMessage> message =
  92. btMessageReceiver->receiveHandshake(quickReply);
  93. if(message.isNull()) {
  94. return SharedHandle<BtMessage>();
  95. }
  96. if(memcmp(message->getPeerId(), _btContext->getPeerId(),
  97. PEER_ID_LENGTH) == 0) {
  98. throw DL_ABORT_EX
  99. (StringFormat
  100. ("CUID#%d - Drop connection from the same Peer ID", cuid).str());
  101. }
  102. peer->setPeerId(message->getPeerId());
  103. if(message->isFastExtensionSupported()) {
  104. peer->setFastExtensionEnabled(true);
  105. logger->info(MSG_FAST_EXTENSION_ENABLED, cuid);
  106. }
  107. if(message->isExtendedMessagingEnabled()) {
  108. peer->setExtendedMessagingEnabled(true);
  109. if(!_utPexEnabled) {
  110. _extensionMessageRegistry->removeExtension("ut_pex");
  111. }
  112. logger->info(MSG_EXTENDED_MESSAGING_ENABLED, cuid);
  113. }
  114. if(message->isDHTEnabled()) {
  115. peer->setDHTEnabled(true);
  116. logger->info(MSG_DHT_ENABLED_PEER, cuid);
  117. }
  118. logger->info(MSG_RECEIVE_PEER_MESSAGE, cuid,
  119. peer->ipaddr.c_str(), peer->port,
  120. message->toString().c_str());
  121. return message;
  122. }
  123. BtMessageHandle DefaultBtInteractive::receiveAndSendHandshake() {
  124. return receiveHandshake(true);
  125. }
  126. void DefaultBtInteractive::doPostHandshakeProcessing() {
  127. // Set time 0 to haveCheckPoint to cache http/ftp download piece completion
  128. haveCheckPoint.setTimeInSec(0);
  129. keepAliveCheckPoint.reset();
  130. floodingCheckPoint.reset();
  131. _pexCheckPoint.setTimeInSec(0);
  132. if(peer->isExtendedMessagingEnabled()) {
  133. addHandshakeExtendedMessageToQueue();
  134. }
  135. addBitfieldMessageToQueue();
  136. if(peer->isDHTEnabled() && _dhtEnabled) {
  137. addPortMessageToQueue();
  138. }
  139. addAllowedFastMessageToQueue();
  140. sendPendingMessage();
  141. }
  142. void DefaultBtInteractive::addPortMessageToQueue()
  143. {
  144. dispatcher->addMessageToQueue
  145. (messageFactory->createPortMessage(_localNode->getPort()));
  146. }
  147. void DefaultBtInteractive::addHandshakeExtendedMessageToQueue()
  148. {
  149. static const std::string CLIENT_ARIA2("aria2");
  150. HandshakeExtensionMessageHandle m(new HandshakeExtensionMessage());
  151. m->setClientVersion(CLIENT_ARIA2);
  152. m->setTCPPort(_btRuntime->getListenPort());
  153. m->setExtensions(_extensionMessageRegistry->getExtensions());
  154. SharedHandle<BtMessage> msg = messageFactory->createBtExtendedMessage(m);
  155. dispatcher->addMessageToQueue(msg);
  156. }
  157. void DefaultBtInteractive::addBitfieldMessageToQueue() {
  158. if(peer->isFastExtensionEnabled()) {
  159. if(_pieceStorage->allDownloadFinished()) {
  160. dispatcher->addMessageToQueue(messageFactory->createHaveAllMessage());
  161. } else if(_pieceStorage->getCompletedLength() > 0) {
  162. dispatcher->addMessageToQueue(messageFactory->createBitfieldMessage());
  163. } else {
  164. dispatcher->addMessageToQueue(messageFactory->createHaveNoneMessage());
  165. }
  166. } else {
  167. if(_pieceStorage->getCompletedLength() > 0) {
  168. dispatcher->addMessageToQueue(messageFactory->createBitfieldMessage());
  169. }
  170. }
  171. }
  172. void DefaultBtInteractive::addAllowedFastMessageToQueue() {
  173. if(peer->isFastExtensionEnabled()) {
  174. std::deque<size_t> fastSet;
  175. _btContext->computeFastSet(fastSet, peer->ipaddr, allowedFastSetSize);
  176. for(std::deque<size_t>::const_iterator itr = fastSet.begin();
  177. itr != fastSet.end(); itr++) {
  178. dispatcher->addMessageToQueue
  179. (messageFactory->createAllowedFastMessage(*itr));
  180. }
  181. }
  182. }
  183. void DefaultBtInteractive::decideChoking() {
  184. if(peer->shouldBeChoking()) {
  185. if(!peer->amChoking()) {
  186. dispatcher->addMessageToQueue(messageFactory->createChokeMessage());
  187. }
  188. } else {
  189. if(peer->amChoking()) {
  190. dispatcher->addMessageToQueue(messageFactory->createUnchokeMessage());
  191. }
  192. }
  193. }
  194. void DefaultBtInteractive::checkHave() {
  195. std::deque<size_t> indexes;
  196. _pieceStorage->getAdvertisedPieceIndexes(indexes, cuid, haveCheckPoint);
  197. haveCheckPoint.reset();
  198. if(indexes.size() >= 20) {
  199. if(peer->isFastExtensionEnabled() && _pieceStorage->allDownloadFinished()) {
  200. dispatcher->addMessageToQueue(messageFactory->createHaveAllMessage());
  201. } else {
  202. dispatcher->addMessageToQueue(messageFactory->createBitfieldMessage());
  203. }
  204. } else {
  205. for(std::deque<size_t>::iterator itr = indexes.begin();
  206. itr != indexes.end(); itr++) {
  207. dispatcher->addMessageToQueue(messageFactory->createHaveMessage(*itr));
  208. }
  209. }
  210. }
  211. void DefaultBtInteractive::sendKeepAlive() {
  212. if(keepAliveCheckPoint.elapsed(keepAliveInterval)) {
  213. dispatcher->addMessageToQueue(messageFactory->createKeepAliveMessage());
  214. dispatcher->sendMessages();
  215. keepAliveCheckPoint.reset();
  216. }
  217. }
  218. size_t DefaultBtInteractive::receiveMessages() {
  219. size_t msgcount = 0;
  220. for(int i = 0; i < 50; i++) {
  221. if(_requestGroupMan->doesOverallDownloadSpeedExceed() ||
  222. _btContext->getOwnerRequestGroup()->doesDownloadSpeedExceed()) {
  223. break;
  224. }
  225. BtMessageHandle message = btMessageReceiver->receiveMessage();
  226. if(message.isNull()) {
  227. break;
  228. }
  229. ++msgcount;
  230. logger->info(MSG_RECEIVE_PEER_MESSAGE, cuid,
  231. peer->ipaddr.c_str(), peer->port,
  232. message->toString().c_str());
  233. message->doReceivedAction();
  234. switch(message->getId()) {
  235. case BtKeepAliveMessage::ID:
  236. floodingStat.incKeepAliveCount();
  237. break;
  238. case BtChokeMessage::ID:
  239. if(!peer->peerChoking()) {
  240. floodingStat.incChokeUnchokeCount();
  241. }
  242. break;
  243. case BtUnchokeMessage::ID:
  244. if(peer->peerChoking()) {
  245. floodingStat.incChokeUnchokeCount();
  246. }
  247. break;
  248. case BtPieceMessage::ID:
  249. _peerStorage->updateTransferStatFor(peer);
  250. // pass through
  251. case BtRequestMessage::ID:
  252. inactiveCheckPoint.reset();
  253. break;
  254. }
  255. }
  256. return msgcount;
  257. }
  258. void DefaultBtInteractive::decideInterest() {
  259. if(_pieceStorage->hasMissingPiece(peer)) {
  260. if(!peer->amInterested()) {
  261. logger->debug(MSG_PEER_INTERESTED, cuid);
  262. dispatcher->
  263. addMessageToQueue(messageFactory->createInterestedMessage());
  264. }
  265. } else {
  266. if(peer->amInterested()) {
  267. logger->debug(MSG_PEER_NOT_INTERESTED, cuid);
  268. dispatcher->
  269. addMessageToQueue(messageFactory->createNotInterestedMessage());
  270. }
  271. }
  272. }
  273. void DefaultBtInteractive::fillPiece(size_t maxMissingBlock) {
  274. if(_pieceStorage->hasMissingPiece(peer)) {
  275. size_t numMissingBlock = btRequestFactory->countMissingBlock();
  276. if(peer->peerChoking()) {
  277. if(peer->isFastExtensionEnabled()) {
  278. std::deque<size_t> excludedIndexes;
  279. btRequestFactory->getTargetPieceIndexes(excludedIndexes);
  280. while(numMissingBlock < maxMissingBlock) {
  281. SharedHandle<Piece> piece =
  282. _pieceStorage->getMissingFastPiece(peer, excludedIndexes);
  283. if(piece.isNull()) {
  284. break;
  285. } else {
  286. btRequestFactory->addTargetPiece(piece);
  287. numMissingBlock += piece->countMissingBlock();
  288. excludedIndexes.push_back(piece->getIndex());
  289. }
  290. }
  291. }
  292. } else {
  293. std::deque<size_t> excludedIndexes;
  294. btRequestFactory->getTargetPieceIndexes(excludedIndexes);
  295. while(numMissingBlock < maxMissingBlock) {
  296. SharedHandle<Piece> piece =
  297. _pieceStorage->getMissingPiece(peer, excludedIndexes);
  298. if(piece.isNull()) {
  299. break;
  300. } else {
  301. btRequestFactory->addTargetPiece(piece);
  302. numMissingBlock += piece->countMissingBlock();
  303. excludedIndexes.push_back(piece->getIndex());
  304. }
  305. }
  306. }
  307. }
  308. }
  309. void DefaultBtInteractive::addRequests() {
  310. size_t MAX_PENDING_REQUEST;
  311. if(peer->getLatency() < 500) {
  312. MAX_PENDING_REQUEST = 24;
  313. } else if(peer->getLatency() < 1500) {
  314. MAX_PENDING_REQUEST = 12;
  315. } else {
  316. MAX_PENDING_REQUEST = 6;
  317. }
  318. fillPiece(MAX_PENDING_REQUEST);
  319. size_t reqNumToCreate =
  320. MAX_PENDING_REQUEST <= dispatcher->countOutstandingRequest() ?
  321. 0 : MAX_PENDING_REQUEST-dispatcher->countOutstandingRequest();
  322. if(reqNumToCreate > 0) {
  323. BtMessages requests;
  324. if(_pieceStorage->isEndGame()) {
  325. btRequestFactory->createRequestMessagesOnEndGame(requests, reqNumToCreate);
  326. } else {
  327. btRequestFactory->createRequestMessages(requests, reqNumToCreate);
  328. }
  329. dispatcher->addMessageToQueue(requests);
  330. }
  331. }
  332. void DefaultBtInteractive::cancelAllPiece() {
  333. btRequestFactory->removeAllTargetPiece();
  334. }
  335. void DefaultBtInteractive::sendPendingMessage() {
  336. dispatcher->sendMessages();
  337. }
  338. void DefaultBtInteractive::detectMessageFlooding() {
  339. if(floodingCheckPoint.elapsed(FLOODING_CHECK_INTERVAL)) {
  340. if(floodingStat.getChokeUnchokeCount() >= 2 ||
  341. floodingStat.getKeepAliveCount() >= 2) {
  342. throw DL_ABORT_EX(EX_FLOODING_DETECTED);
  343. } else {
  344. floodingStat.reset();
  345. }
  346. floodingCheckPoint.reset();
  347. }
  348. }
  349. void DefaultBtInteractive::checkActiveInteraction()
  350. {
  351. // To allow aria2 to accept mutially interested peer, disconnect unintersted
  352. // peer.
  353. {
  354. time_t interval = 30;
  355. if(!peer->amInterested() && !peer->peerInterested() &&
  356. inactiveCheckPoint.elapsed(interval)) {
  357. // TODO change the message
  358. throw DL_ABORT_EX
  359. (StringFormat("Disconnect peer because we are not interested each other"
  360. " after %u second(s).", interval).str());
  361. }
  362. }
  363. // Since the peers which are *just* connected and do nothing to improve
  364. // mutual download progress are completely waste of resources, those peers
  365. // are disconnected in a certain time period.
  366. {
  367. time_t interval = 2*60;
  368. if(inactiveCheckPoint.elapsed(interval)) {
  369. throw DL_ABORT_EX
  370. (StringFormat(EX_DROP_INACTIVE_CONNECTION, interval).str());
  371. }
  372. }
  373. }
  374. void DefaultBtInteractive::addPeerExchangeMessage()
  375. {
  376. if(_pexCheckPoint.elapsed(UTPexExtensionMessage::DEFAULT_INTERVAL)) {
  377. UTPexExtensionMessageHandle m
  378. (new UTPexExtensionMessage(peer->getExtensionMessageID("ut_pex")));
  379. const Peers& peers = _peerStorage->getPeers();
  380. {
  381. for(std::deque<SharedHandle<Peer> >::const_iterator i =
  382. peers.begin(); i != peers.end() && !m->freshPeersAreFull(); ++i) {
  383. if(peer->ipaddr != (*i)->ipaddr) {
  384. m->addFreshPeer(*i);
  385. }
  386. }
  387. }
  388. {
  389. for(std::deque<SharedHandle<Peer> >::const_reverse_iterator i =
  390. peers.rbegin(); i != peers.rend() && !m->droppedPeersAreFull();
  391. ++i) {
  392. if(peer->ipaddr != (*i)->ipaddr) {
  393. m->addDroppedPeer(*i);
  394. }
  395. }
  396. }
  397. BtMessageHandle msg = messageFactory->createBtExtendedMessage(m);
  398. dispatcher->addMessageToQueue(msg);
  399. _pexCheckPoint.reset();
  400. }
  401. }
  402. void DefaultBtInteractive::doInteractionProcessing() {
  403. checkActiveInteraction();
  404. decideChoking();
  405. detectMessageFlooding();
  406. if(_perSecCheckPoint.elapsed(1)) {
  407. _perSecCheckPoint.reset();
  408. dispatcher->checkRequestSlotAndDoNecessaryThing();
  409. }
  410. checkHave();
  411. sendKeepAlive();
  412. _numReceivedMessage = receiveMessages();
  413. btRequestFactory->removeCompletedPiece();
  414. decideInterest();
  415. if(!_pieceStorage->downloadFinished()) {
  416. addRequests();
  417. }
  418. if(peer->getExtensionMessageID("ut_pex") && _utPexEnabled) {
  419. addPeerExchangeMessage();
  420. }
  421. sendPendingMessage();
  422. }
  423. void DefaultBtInteractive::setLocalNode(const WeakHandle<DHTNode>& node)
  424. {
  425. _localNode = node;
  426. }
  427. size_t DefaultBtInteractive::countPendingMessage()
  428. {
  429. return dispatcher->countMessageInQueue();
  430. }
  431. bool DefaultBtInteractive::isSendingMessageInProgress()
  432. {
  433. return dispatcher->isSendingInProgress();
  434. }
  435. size_t DefaultBtInteractive::countReceivedMessageInIteration() const
  436. {
  437. return _numReceivedMessage;
  438. }
  439. size_t DefaultBtInteractive::countOutstandingRequest()
  440. {
  441. return dispatcher->countOutstandingRequest();
  442. }
  443. void DefaultBtInteractive::setBtRuntime
  444. (const SharedHandle<BtRuntime>& btRuntime)
  445. {
  446. _btRuntime = btRuntime;
  447. }
  448. void DefaultBtInteractive::setPieceStorage
  449. (const SharedHandle<PieceStorage>& pieceStorage)
  450. {
  451. _pieceStorage = pieceStorage;
  452. }
  453. void DefaultBtInteractive::setPeerStorage
  454. (const SharedHandle<PeerStorage>& peerStorage)
  455. {
  456. _peerStorage = peerStorage;
  457. }
  458. void DefaultBtInteractive::setPeer(const SharedHandle<Peer>& peer)
  459. {
  460. this->peer = peer;
  461. }
  462. void DefaultBtInteractive::setBtMessageReceiver
  463. (const SharedHandle<BtMessageReceiver>& receiver)
  464. {
  465. this->btMessageReceiver = receiver;
  466. }
  467. void DefaultBtInteractive::setDispatcher
  468. (const SharedHandle<BtMessageDispatcher>& dispatcher)
  469. {
  470. this->dispatcher = dispatcher;
  471. }
  472. void DefaultBtInteractive::setBtRequestFactory
  473. (const SharedHandle<BtRequestFactory>& factory)
  474. {
  475. this->btRequestFactory = factory;
  476. }
  477. void DefaultBtInteractive::setPeerConnection
  478. (const SharedHandle<PeerConnection>& peerConnection)
  479. {
  480. this->peerConnection = peerConnection;
  481. }
  482. void DefaultBtInteractive::setExtensionMessageFactory
  483. (const SharedHandle<ExtensionMessageFactory>& factory)
  484. {
  485. _extensionMessageFactory = factory;
  486. }
  487. void DefaultBtInteractive::setBtMessageFactory
  488. (const SharedHandle<BtMessageFactory>& factory)
  489. {
  490. this->messageFactory = factory;
  491. }
  492. void DefaultBtInteractive::setRequestGroupMan
  493. (const WeakHandle<RequestGroupMan>& rgman)
  494. {
  495. _requestGroupMan = rgman;
  496. }
  497. } // namespace aria2