DefaultPeerStorage.cc 10 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347
  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(const Option* option):
  49. option(option),
  50. logger(LogFactory::getInstance()),
  51. removedPeerSessionDownloadLength(0),
  52. removedPeerSessionUploadLength(0),
  53. _seederStateChoke(new BtSeederStateChoke()),
  54. _leecherStateChoke(new BtLeecherStateChoke()),
  55. _lastTransferStatMapUpdated(0)
  56. {}
  57. DefaultPeerStorage::~DefaultPeerStorage()
  58. {
  59. delete _seederStateChoke;
  60. delete _leecherStateChoke;
  61. }
  62. class FindIdenticalPeer {
  63. private:
  64. SharedHandle<Peer> _peer;
  65. public:
  66. FindIdenticalPeer(const SharedHandle<Peer>& peer):_peer(peer) {}
  67. bool operator()(const SharedHandle<Peer>& peer) const {
  68. return (_peer == peer) ||
  69. ((_peer->ipaddr == peer->ipaddr) && (_peer->port == peer->port));
  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->ipaddr.c_str(), peer->port);
  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, peer->ipaddr.c_str(), peer->port);
  109. }
  110. }
  111. }
  112. }
  113. const std::deque<SharedHandle<Peer> >& DefaultPeerStorage::getPeers()
  114. {
  115. return peers;
  116. }
  117. class FindFinePeer {
  118. public:
  119. bool operator()(const SharedHandle<Peer>& peer) const {
  120. return peer->unused() && peer->isGood();
  121. }
  122. };
  123. SharedHandle<Peer> DefaultPeerStorage::getUnusedPeer() {
  124. std::deque<SharedHandle<Peer> >::const_iterator itr =
  125. std::find_if(peers.begin(), peers.end(), FindFinePeer());
  126. if(itr == peers.end()) {
  127. return SharedHandle<Peer>();
  128. } else {
  129. return *itr;
  130. }
  131. }
  132. class FindPeer {
  133. private:
  134. std::string ipaddr;
  135. uint16_t port;
  136. public:
  137. FindPeer(const std::string& ipaddr, uint16_t port):
  138. ipaddr(ipaddr), port(port) {}
  139. bool operator()(const SharedHandle<Peer>& peer) const {
  140. return ipaddr == peer->ipaddr && port == peer->port;
  141. }
  142. };
  143. SharedHandle<Peer> DefaultPeerStorage::getPeer(const std::string& ipaddr,
  144. uint16_t port) const {
  145. std::deque<SharedHandle<Peer> >::const_iterator itr =
  146. std::find_if(peers.begin(), peers.end(), FindPeer(ipaddr, port));
  147. if(itr == peers.end()) {
  148. return SharedHandle<Peer>();
  149. } else {
  150. return *itr;
  151. }
  152. }
  153. size_t DefaultPeerStorage::countPeer() const {
  154. return peers.size();
  155. }
  156. bool DefaultPeerStorage::isPeerAvailable() {
  157. return !getUnusedPeer().isNull();
  158. }
  159. class CollectActivePeer {
  160. private:
  161. std::vector<SharedHandle<Peer> >& _activePeers;
  162. public:
  163. CollectActivePeer(std::vector<SharedHandle<Peer> >& activePeers):
  164. _activePeers(activePeers) {}
  165. void operator()(const SharedHandle<Peer>& peer)
  166. {
  167. if(peer->isActive()) {
  168. _activePeers.push_back(peer);
  169. }
  170. }
  171. };
  172. void DefaultPeerStorage::getActivePeers
  173. (std::vector<SharedHandle<Peer> >& activePeers)
  174. {
  175. std::for_each(peers.begin(), peers.end(), CollectActivePeer(activePeers));
  176. }
  177. static TransferStat calculateStatFor(const SharedHandle<Peer>& peer)
  178. {
  179. TransferStat s;
  180. s.downloadSpeed = peer->calculateDownloadSpeed();
  181. s.uploadSpeed = peer->calculateUploadSpeed();
  182. s.sessionDownloadLength = peer->getSessionDownloadLength();
  183. s.sessionUploadLength = peer->getSessionUploadLength();
  184. return s;
  185. }
  186. TransferStat DefaultPeerStorage::calculateStat()
  187. {
  188. TransferStat stat;
  189. if(_lastTransferStatMapUpdated.differenceInMillis(global::wallclock) >= 250) {
  190. if(logger->debug()) {
  191. logger->debug("Updating TransferStat of PeerStorage");
  192. }
  193. _lastTransferStatMapUpdated = global::wallclock;
  194. _peerTransferStatMap.clear();
  195. std::vector<SharedHandle<Peer> > activePeers;
  196. getActivePeers(activePeers);
  197. for(std::vector<SharedHandle<Peer> >::const_iterator i =
  198. activePeers.begin(), eoi = activePeers.end(); i != eoi; ++i) {
  199. TransferStat s;
  200. s.downloadSpeed = (*i)->calculateDownloadSpeed();
  201. s.uploadSpeed = (*i)->calculateUploadSpeed();
  202. s.sessionDownloadLength = (*i)->getSessionDownloadLength();
  203. s.sessionUploadLength = (*i)->getSessionUploadLength();
  204. _peerTransferStatMap[(*i)->getID()] = calculateStatFor(*i);
  205. stat += s;
  206. }
  207. _cachedTransferStat = stat;
  208. } else {
  209. stat = _cachedTransferStat;
  210. }
  211. stat.sessionDownloadLength += removedPeerSessionDownloadLength;
  212. stat.sessionUploadLength += removedPeerSessionUploadLength;
  213. stat.setAllTimeUploadLength(_btRuntime->getUploadLengthAtStartup()+
  214. stat.getSessionUploadLength());
  215. return stat;
  216. }
  217. void DefaultPeerStorage::updateTransferStatFor(const SharedHandle<Peer>& peer)
  218. {
  219. if(logger->debug()) {
  220. logger->debug("Updating TransferStat for peer %s", peer->getID().c_str());
  221. }
  222. std::map<std::string, TransferStat>::iterator itr =
  223. _peerTransferStatMap.find(peer->getID());
  224. assert(itr != _peerTransferStatMap.end());
  225. _cachedTransferStat -= (*itr).second;
  226. TransferStat s = calculateStatFor(peer);
  227. _cachedTransferStat += s;
  228. (*itr).second = s;
  229. }
  230. TransferStat DefaultPeerStorage::getTransferStatFor
  231. (const SharedHandle<Peer>& peer)
  232. {
  233. return _peerTransferStatMap[peer->getID()];
  234. }
  235. void DefaultPeerStorage::deleteUnusedPeer(size_t delSize) {
  236. std::deque<SharedHandle<Peer> > temp;
  237. for(std::deque<SharedHandle<Peer> >::const_reverse_iterator itr =
  238. peers.rbegin(), eoi = peers.rend(); itr != eoi; ++itr) {
  239. const SharedHandle<Peer>& p = *itr;
  240. if(p->unused() && delSize > 0) {
  241. onErasingPeer(p);
  242. delSize--;
  243. } else {
  244. temp.push_front(p);
  245. }
  246. }
  247. peers = temp;
  248. }
  249. void DefaultPeerStorage::onErasingPeer(const SharedHandle<Peer>& peer) {}
  250. void DefaultPeerStorage::onReturningPeer(const SharedHandle<Peer>& peer)
  251. {
  252. if(peer->isActive()) {
  253. TransferStat removedStat(calculateStatFor(peer));
  254. removedPeerSessionDownloadLength += removedStat.getSessionDownloadLength();
  255. removedPeerSessionUploadLength += removedStat.getSessionUploadLength();
  256. _cachedTransferStat -= removedStat;
  257. // Execute choking algorithm if unchoked and interested peer is
  258. // disconnected.
  259. if(!peer->amChoking() && peer->peerInterested()) {
  260. executeChoke();
  261. }
  262. }
  263. }
  264. void DefaultPeerStorage::returnPeer(const SharedHandle<Peer>& peer)
  265. {
  266. std::deque<SharedHandle<Peer> >::iterator itr =
  267. std::find(peers.begin(), peers.end(), peer);
  268. if(itr == peers.end()) {
  269. if(logger->debug()) {
  270. logger->debug("Cannot find peer %s:%u in PeerStorage.",
  271. peer->ipaddr.c_str(), peer->port);
  272. }
  273. } else {
  274. peers.erase(itr);
  275. onReturningPeer(peer);
  276. onErasingPeer(peer);
  277. }
  278. }
  279. bool DefaultPeerStorage::chokeRoundIntervalElapsed()
  280. {
  281. const time_t CHOKE_ROUND_INTERVAL = 10;
  282. if(_pieceStorage->downloadFinished()) {
  283. return _seederStateChoke->getLastRound().
  284. difference(global::wallclock) >= CHOKE_ROUND_INTERVAL;
  285. } else {
  286. return _leecherStateChoke->getLastRound().
  287. difference(global::wallclock) >= CHOKE_ROUND_INTERVAL;
  288. }
  289. }
  290. void DefaultPeerStorage::executeChoke()
  291. {
  292. std::vector<SharedHandle<Peer> > activePeers;
  293. getActivePeers(activePeers);
  294. if(_pieceStorage->downloadFinished()) {
  295. return _seederStateChoke->executeChoke(activePeers);
  296. } else {
  297. return _leecherStateChoke->executeChoke(activePeers);
  298. }
  299. }
  300. void DefaultPeerStorage::setPieceStorage(const SharedHandle<PieceStorage>& ps)
  301. {
  302. _pieceStorage = ps;
  303. }
  304. void DefaultPeerStorage::setBtRuntime(const SharedHandle<BtRuntime>& btRuntime)
  305. {
  306. _btRuntime = btRuntime;
  307. }
  308. } // namespace aria2