DefaultPeerStorage.cc 10 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356
  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 "DefaultPeerStorage.h"
  36. #include <algorithm>
  37. #include "LogFactory.h"
  38. #include "Logger.h"
  39. #include "message.h"
  40. #include "Peer.h"
  41. #include "BtRuntime.h"
  42. #include "BtSeederStateChoke.h"
  43. #include "BtLeecherStateChoke.h"
  44. #include "PieceStorage.h"
  45. #include "wallclock.h"
  46. namespace aria2 {
  47. static const int MAX_PEER_LIST_SIZE = 1024;
  48. DefaultPeerStorage::DefaultPeerStorage():
  49. _logger(LogFactory::getInstance()),
  50. _removedPeerSessionDownloadLength(0),
  51. _removedPeerSessionUploadLength(0),
  52. _seederStateChoke(new BtSeederStateChoke()),
  53. _leecherStateChoke(new BtLeecherStateChoke()),
  54. _lastTransferStatMapUpdated(0)
  55. {}
  56. DefaultPeerStorage::~DefaultPeerStorage()
  57. {
  58. delete _seederStateChoke;
  59. delete _leecherStateChoke;
  60. }
  61. class FindIdenticalPeer {
  62. private:
  63. SharedHandle<Peer> _peer;
  64. public:
  65. FindIdenticalPeer(const SharedHandle<Peer>& peer):_peer(peer) {}
  66. bool operator()(const SharedHandle<Peer>& peer) const {
  67. return (_peer == peer) ||
  68. ((_peer->getIPAddress() == peer->getIPAddress()) &&
  69. (_peer->getPort() == peer->getPort()));
  70. }
  71. };
  72. bool DefaultPeerStorage::isPeerAlreadyAdded(const SharedHandle<Peer>& peer)
  73. {
  74. return std::find_if(_peers.begin(), _peers.end(),
  75. FindIdenticalPeer(peer)) != _peers.end();
  76. }
  77. static size_t calculateMaxPeerListSize(const SharedHandle<BtRuntime>& btRuntime)
  78. {
  79. if(btRuntime.isNull()) {
  80. return MAX_PEER_LIST_SIZE;
  81. }
  82. return btRuntime->getMaxPeers() == 0 ?
  83. MAX_PEER_LIST_SIZE :
  84. btRuntime->getMaxPeers()+(btRuntime->getMaxPeers() >> 2);
  85. }
  86. bool DefaultPeerStorage::addPeer(const SharedHandle<Peer>& peer) {
  87. if(isPeerAlreadyAdded(peer)) {
  88. if(_logger->debug()) {
  89. _logger->debug("Adding %s:%u is rejected because it has been already"
  90. " added.", peer->getIPAddress().c_str(), peer->getPort());
  91. }
  92. return false;
  93. }
  94. size_t maxPeerListSize = calculateMaxPeerListSize(_btRuntime);
  95. if(_peers.size() >= maxPeerListSize) {
  96. deleteUnusedPeer(_peers.size()-maxPeerListSize+1);
  97. }
  98. _peers.push_front(peer);
  99. return true;
  100. }
  101. void DefaultPeerStorage::addPeer(const std::vector<SharedHandle<Peer> >& peers)
  102. {
  103. for(std::vector<SharedHandle<Peer> >::const_iterator itr = peers.begin(),
  104. eoi = peers.end(); itr != eoi; ++itr) {
  105. const SharedHandle<Peer>& peer = *itr;
  106. if(addPeer(peer)) {
  107. if(_logger->debug()) {
  108. _logger->debug(MSG_ADDING_PEER,
  109. peer->getIPAddress().c_str(), peer->getPort());
  110. }
  111. }
  112. }
  113. }
  114. const std::deque<SharedHandle<Peer> >& DefaultPeerStorage::getPeers()
  115. {
  116. return _peers;
  117. }
  118. class FindFinePeer {
  119. public:
  120. bool operator()(const SharedHandle<Peer>& peer) const {
  121. return peer->unused() && peer->isGood();
  122. }
  123. };
  124. SharedHandle<Peer> DefaultPeerStorage::getUnusedPeer() {
  125. std::deque<SharedHandle<Peer> >::const_iterator itr =
  126. std::find_if(_peers.begin(), _peers.end(), FindFinePeer());
  127. if(itr == _peers.end()) {
  128. return SharedHandle<Peer>();
  129. } else {
  130. return *itr;
  131. }
  132. }
  133. class FindPeer {
  134. private:
  135. std::string ipaddr;
  136. uint16_t port;
  137. public:
  138. FindPeer(const std::string& ipaddr, uint16_t port):
  139. ipaddr(ipaddr), port(port) {}
  140. bool operator()(const SharedHandle<Peer>& peer) const {
  141. return ipaddr == peer->getIPAddress() && port == peer->getPort();
  142. }
  143. };
  144. SharedHandle<Peer> DefaultPeerStorage::getPeer(const std::string& ipaddr,
  145. uint16_t port) const {
  146. std::deque<SharedHandle<Peer> >::const_iterator itr =
  147. std::find_if(_peers.begin(), _peers.end(), FindPeer(ipaddr, port));
  148. if(itr == _peers.end()) {
  149. return SharedHandle<Peer>();
  150. } else {
  151. return *itr;
  152. }
  153. }
  154. size_t DefaultPeerStorage::countPeer() const {
  155. return _peers.size();
  156. }
  157. bool DefaultPeerStorage::isPeerAvailable() {
  158. return !getUnusedPeer().isNull();
  159. }
  160. class CollectActivePeer {
  161. private:
  162. std::vector<SharedHandle<Peer> >& _activePeers;
  163. public:
  164. CollectActivePeer(std::vector<SharedHandle<Peer> >& activePeers):
  165. _activePeers(activePeers) {}
  166. void operator()(const SharedHandle<Peer>& peer)
  167. {
  168. if(peer->isActive()) {
  169. _activePeers.push_back(peer);
  170. }
  171. }
  172. };
  173. void DefaultPeerStorage::getActivePeers
  174. (std::vector<SharedHandle<Peer> >& activePeers)
  175. {
  176. std::for_each(_peers.begin(), _peers.end(), CollectActivePeer(activePeers));
  177. }
  178. static TransferStat calculateStatFor(const SharedHandle<Peer>& peer)
  179. {
  180. TransferStat s;
  181. s.downloadSpeed = peer->calculateDownloadSpeed();
  182. s.uploadSpeed = peer->calculateUploadSpeed();
  183. s.sessionDownloadLength = peer->getSessionDownloadLength();
  184. s.sessionUploadLength = peer->getSessionUploadLength();
  185. return s;
  186. }
  187. TransferStat DefaultPeerStorage::calculateStat()
  188. {
  189. TransferStat stat;
  190. if(_lastTransferStatMapUpdated.differenceInMillis(global::wallclock) >= 250) {
  191. if(_logger->debug()) {
  192. _logger->debug("Updating TransferStat of PeerStorage");
  193. }
  194. _lastTransferStatMapUpdated = global::wallclock;
  195. _peerTransferStatMap.clear();
  196. std::vector<SharedHandle<Peer> > activePeers;
  197. getActivePeers(activePeers);
  198. for(std::vector<SharedHandle<Peer> >::const_iterator i =
  199. activePeers.begin(), eoi = activePeers.end(); i != eoi; ++i) {
  200. TransferStat s;
  201. s.downloadSpeed = (*i)->calculateDownloadSpeed();
  202. s.uploadSpeed = (*i)->calculateUploadSpeed();
  203. s.sessionDownloadLength = (*i)->getSessionDownloadLength();
  204. s.sessionUploadLength = (*i)->getSessionUploadLength();
  205. _peerTransferStatMap[(*i)->getID()] = calculateStatFor(*i);
  206. stat += s;
  207. }
  208. _cachedTransferStat = stat;
  209. } else {
  210. stat = _cachedTransferStat;
  211. }
  212. stat.sessionDownloadLength += _removedPeerSessionDownloadLength;
  213. stat.sessionUploadLength += _removedPeerSessionUploadLength;
  214. stat.setAllTimeUploadLength(_btRuntime->getUploadLengthAtStartup()+
  215. stat.getSessionUploadLength());
  216. return stat;
  217. }
  218. void DefaultPeerStorage::updateTransferStatFor(const SharedHandle<Peer>& peer)
  219. {
  220. if(_logger->debug()) {
  221. _logger->debug("Updating TransferStat for peer %s", peer->getID().c_str());
  222. }
  223. std::map<std::string, TransferStat>::iterator itr =
  224. _peerTransferStatMap.find(peer->getID());
  225. if(itr == _peerTransferStatMap.end()) {
  226. return;
  227. }
  228. _cachedTransferStat -= (*itr).second;
  229. TransferStat s = calculateStatFor(peer);
  230. _cachedTransferStat += s;
  231. (*itr).second = s;
  232. }
  233. TransferStat DefaultPeerStorage::getTransferStatFor
  234. (const SharedHandle<Peer>& peer)
  235. {
  236. std::map<std::string, TransferStat>::const_iterator itr =
  237. _peerTransferStatMap.find(peer->getID());
  238. if(itr == _peerTransferStatMap.end()) {
  239. return TransferStat();
  240. } else {
  241. return (*itr).second;
  242. }
  243. }
  244. void DefaultPeerStorage::deleteUnusedPeer(size_t delSize) {
  245. std::deque<SharedHandle<Peer> > temp;
  246. for(std::deque<SharedHandle<Peer> >::const_reverse_iterator itr =
  247. _peers.rbegin(), eoi = _peers.rend(); itr != eoi; ++itr) {
  248. const SharedHandle<Peer>& p = *itr;
  249. if(p->unused() && delSize > 0) {
  250. onErasingPeer(p);
  251. delSize--;
  252. } else {
  253. temp.push_front(p);
  254. }
  255. }
  256. _peers.swap(temp);
  257. }
  258. void DefaultPeerStorage::onErasingPeer(const SharedHandle<Peer>& peer) {}
  259. void DefaultPeerStorage::onReturningPeer(const SharedHandle<Peer>& peer)
  260. {
  261. if(peer->isActive()) {
  262. TransferStat removedStat(calculateStatFor(peer));
  263. _removedPeerSessionDownloadLength += removedStat.getSessionDownloadLength();
  264. _removedPeerSessionUploadLength += removedStat.getSessionUploadLength();
  265. _cachedTransferStat -= removedStat;
  266. // Execute choking algorithm if unchoked and interested peer is
  267. // disconnected.
  268. if(!peer->amChoking() && peer->peerInterested()) {
  269. executeChoke();
  270. }
  271. }
  272. }
  273. void DefaultPeerStorage::returnPeer(const SharedHandle<Peer>& peer)
  274. {
  275. std::deque<SharedHandle<Peer> >::iterator itr =
  276. std::find(_peers.begin(), _peers.end(), peer);
  277. if(itr == _peers.end()) {
  278. if(_logger->debug()) {
  279. _logger->debug("Cannot find peer %s:%u in PeerStorage.",
  280. peer->getIPAddress().c_str(), peer->getPort());
  281. }
  282. } else {
  283. _peers.erase(itr);
  284. onReturningPeer(peer);
  285. onErasingPeer(peer);
  286. }
  287. }
  288. bool DefaultPeerStorage::chokeRoundIntervalElapsed()
  289. {
  290. const time_t CHOKE_ROUND_INTERVAL = 10;
  291. if(_pieceStorage->downloadFinished()) {
  292. return _seederStateChoke->getLastRound().
  293. difference(global::wallclock) >= CHOKE_ROUND_INTERVAL;
  294. } else {
  295. return _leecherStateChoke->getLastRound().
  296. difference(global::wallclock) >= CHOKE_ROUND_INTERVAL;
  297. }
  298. }
  299. void DefaultPeerStorage::executeChoke()
  300. {
  301. std::vector<SharedHandle<Peer> > activePeers;
  302. getActivePeers(activePeers);
  303. if(_pieceStorage->downloadFinished()) {
  304. return _seederStateChoke->executeChoke(activePeers);
  305. } else {
  306. return _leecherStateChoke->executeChoke(activePeers);
  307. }
  308. }
  309. void DefaultPeerStorage::setPieceStorage(const SharedHandle<PieceStorage>& ps)
  310. {
  311. _pieceStorage = ps;
  312. }
  313. void DefaultPeerStorage::setBtRuntime(const SharedHandle<BtRuntime>& btRuntime)
  314. {
  315. _btRuntime = btRuntime;
  316. }
  317. } // namespace aria2