DefaultBtInteractive.cc 15 KB

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