DefaultBtAnnounce.cc 9.0 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312
  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 "DefaultBtAnnounce.h"
  36. #include "LogFactory.h"
  37. #include "Logger.h"
  38. #include "DelegatingPeerListProcessor.h"
  39. #include "Util.h"
  40. #include "prefs.h"
  41. #include "DlAbortEx.h"
  42. #include "message.h"
  43. #include "SimpleRandomizer.h"
  44. #include "BtContext.h"
  45. #include "PieceStorage.h"
  46. #include "BtRuntime.h"
  47. #include "PeerStorage.h"
  48. #include "Peer.h"
  49. #include "Option.h"
  50. #include "StringFormat.h"
  51. #include "A2STR.h"
  52. #include "Request.h"
  53. #include "bencode.h"
  54. namespace aria2 {
  55. DefaultBtAnnounce::DefaultBtAnnounce(const BtContextHandle& btContext,
  56. const Option* option):
  57. btContext(btContext),
  58. trackers(0),
  59. interval(DEFAULT_ANNOUNCE_INTERVAL),
  60. minInterval(DEFAULT_ANNOUNCE_INTERVAL),
  61. complete(0),
  62. incomplete(0),
  63. announceList(btContext->getAnnounceTiers()),
  64. option(option),
  65. logger(LogFactory::getInstance()),
  66. _randomizer(SimpleRandomizer::getInstance())
  67. {
  68. prevAnnounceTime.setTimeInSec(0);
  69. generateKey();
  70. }
  71. DefaultBtAnnounce::~DefaultBtAnnounce() {
  72. }
  73. void DefaultBtAnnounce::generateKey()
  74. {
  75. key = Util::randomAlpha(8, _randomizer);
  76. }
  77. bool DefaultBtAnnounce::isDefaultAnnounceReady() {
  78. return (trackers == 0 && prevAnnounceTime.elapsed(minInterval) &&
  79. !announceList.allTiersFailed());
  80. }
  81. bool DefaultBtAnnounce::isStoppedAnnounceReady() {
  82. return (trackers == 0 &&
  83. btRuntime->isHalt() &&
  84. announceList.countStoppedAllowedTier());
  85. }
  86. bool DefaultBtAnnounce::isCompletedAnnounceReady() {
  87. return (trackers == 0 &&
  88. pieceStorage->allDownloadFinished() &&
  89. announceList.countCompletedAllowedTier());
  90. }
  91. bool DefaultBtAnnounce::isAnnounceReady() {
  92. return
  93. isStoppedAnnounceReady() ||
  94. isCompletedAnnounceReady() ||
  95. isDefaultAnnounceReady();
  96. }
  97. static bool uriHasQuery(const std::string& uri)
  98. {
  99. Request req;
  100. req.setUrl(uri);
  101. return !req.getQuery().empty();
  102. }
  103. std::string DefaultBtAnnounce::getAnnounceUrl() {
  104. if(isStoppedAnnounceReady()) {
  105. if(!announceList.currentTierAcceptsStoppedEvent()) {
  106. announceList.moveToStoppedAllowedTier();
  107. }
  108. announceList.setEvent(AnnounceTier::STOPPED);
  109. } else if(isCompletedAnnounceReady()) {
  110. if(!announceList.currentTierAcceptsCompletedEvent()) {
  111. announceList.moveToCompletedAllowedTier();
  112. }
  113. announceList.setEvent(AnnounceTier::COMPLETED);
  114. } else if(isDefaultAnnounceReady()) {
  115. // If download completed before "started" event is sent to a tracker,
  116. // we change the event to something else to prevent us from
  117. // sending "completed" event.
  118. if(pieceStorage->allDownloadFinished() &&
  119. announceList.getEvent() == AnnounceTier::STARTED) {
  120. announceList.setEvent(AnnounceTier::STARTED_AFTER_COMPLETION);
  121. }
  122. } else {
  123. return A2STR::NIL;
  124. }
  125. unsigned int numWant = 50;
  126. if(!btRuntime->lessThanMinPeers() || btRuntime->isHalt()) {
  127. numWant = 0;
  128. }
  129. TransferStat stat = peerStorage->calculateStat();
  130. uint64_t left =
  131. pieceStorage->getTotalLength()-pieceStorage->getCompletedLength();
  132. std::string url = announceList.getAnnounce();
  133. url += uriHasQuery(url) ? "&" : "?";
  134. url +=
  135. "info_hash="+Util::torrentUrlencode(btContext->getInfoHash(),
  136. btContext->getInfoHashLength())+
  137. "&peer_id="+Util::torrentUrlencode(btContext->getPeerId(), 20)+
  138. "&uploaded="+Util::uitos(stat.getSessionUploadLength())+
  139. "&downloaded="+Util::uitos(stat.getSessionDownloadLength())+
  140. "&left="+Util::uitos(left)+
  141. "&compact=1"+
  142. "&key="+key+
  143. "&numwant="+Util::uitos(numWant)+
  144. "&no_peer_id=1";
  145. if(btRuntime->getListenPort() > 0) {
  146. url += "&port="+Util::uitos(btRuntime->getListenPort());
  147. }
  148. std::string event = announceList.getEventString();
  149. if(!event.empty()) {
  150. url += "&event="+event;
  151. }
  152. if(!trackerId.empty()) {
  153. url += "&trackerid="+Util::torrentUrlencode(trackerId);
  154. }
  155. if(option->getAsBool(PREF_BT_REQUIRE_CRYPTO)) {
  156. url += "&requirecrypto=1";
  157. } else {
  158. url += "&supportcrypto=1";
  159. }
  160. if(!option->blank(PREF_BT_EXTERNAL_IP)) {
  161. url += "&ip="+option->get(PREF_BT_EXTERNAL_IP);
  162. }
  163. return url;
  164. }
  165. void DefaultBtAnnounce::announceStart() {
  166. trackers++;
  167. }
  168. void DefaultBtAnnounce::announceSuccess() {
  169. trackers = 0;
  170. announceList.announceSuccess();
  171. }
  172. void DefaultBtAnnounce::announceFailure() {
  173. trackers = 0;
  174. announceList.announceFailure();
  175. }
  176. bool DefaultBtAnnounce::isAllAnnounceFailed() {
  177. return announceList.allTiersFailed();
  178. }
  179. void DefaultBtAnnounce::resetAnnounce() {
  180. prevAnnounceTime.reset();
  181. announceList.resetTier();
  182. }
  183. void
  184. DefaultBtAnnounce::processAnnounceResponse(const unsigned char* trackerResponse,
  185. size_t trackerResponseLength)
  186. {
  187. logger->debug("Now processing tracker response.");
  188. const bencode::BDE dict =
  189. bencode::decode(trackerResponse, trackerResponseLength);
  190. if(!dict.isDict()) {
  191. throw DlAbortEx(MSG_NULL_TRACKER_RESPONSE);
  192. }
  193. const bencode::BDE& failure = dict[BtAnnounce::FAILURE_REASON];
  194. if(failure.isString()) {
  195. throw DlAbortEx
  196. (StringFormat(EX_TRACKER_FAILURE, failure.s().c_str()).str());
  197. }
  198. const bencode::BDE& warn = dict[BtAnnounce::WARNING_MESSAGE];
  199. if(warn.isString()) {
  200. logger->warn(MSG_TRACKER_WARNING_MESSAGE, warn.s().c_str());
  201. }
  202. const bencode::BDE& tid = dict[BtAnnounce::TRACKER_ID];
  203. if(tid.isString()) {
  204. trackerId = tid.s();
  205. logger->debug("Tracker ID:%s", trackerId.c_str());
  206. }
  207. const bencode::BDE& ival = dict[BtAnnounce::INTERVAL];
  208. if(ival.isInteger() && ival.i() > 0) {
  209. interval = ival.i();
  210. logger->debug("Interval:%d", interval);
  211. }
  212. const bencode::BDE& mival = dict[BtAnnounce::MIN_INTERVAL];
  213. if(mival.isInteger() && mival.i() > 0) {
  214. minInterval = mival.i();
  215. logger->debug("Min interval:%d", minInterval);
  216. if(minInterval > interval) {
  217. minInterval = interval;
  218. }
  219. } else {
  220. // Use interval as a minInterval if minInterval is not supplied.
  221. minInterval = interval;
  222. }
  223. const bencode::BDE& comp = dict[BtAnnounce::COMPLETE];
  224. if(comp.isInteger()) {
  225. complete = comp.i();
  226. logger->debug("Complete:%d", complete);
  227. }
  228. const bencode::BDE& incomp = dict[BtAnnounce::INCOMPLETE];
  229. if(incomp.isInteger()) {
  230. incomplete = incomp.i();
  231. logger->debug("Incomplete:%d", incomplete);
  232. }
  233. const bencode::BDE& peerData = dict[BtAnnounce::PEERS];
  234. if(!peerData.isNone()) {
  235. if(!btRuntime->isHalt() && btRuntime->lessThanMinPeers()) {
  236. DelegatingPeerListProcessor proc;
  237. std::deque<SharedHandle<Peer> > peers;
  238. proc.extractPeer(peers, peerData);
  239. peerStorage->addPeer(peers);
  240. }
  241. } else {
  242. logger->info(MSG_NO_PEER_LIST_RECEIVED);
  243. }
  244. }
  245. bool DefaultBtAnnounce::noMoreAnnounce() {
  246. return (trackers == 0 &&
  247. btRuntime->isHalt() &&
  248. !announceList.countStoppedAllowedTier());
  249. }
  250. void DefaultBtAnnounce::shuffleAnnounce() {
  251. announceList.shuffle();
  252. }
  253. void DefaultBtAnnounce::setRandomizer(const RandomizerHandle& randomizer)
  254. {
  255. _randomizer = randomizer;
  256. }
  257. void DefaultBtAnnounce::setBtRuntime(const BtRuntimeHandle& btRuntime)
  258. {
  259. this->btRuntime = btRuntime;
  260. }
  261. BtRuntimeHandle DefaultBtAnnounce::getBtRuntime() const
  262. {
  263. return btRuntime;
  264. }
  265. void DefaultBtAnnounce::setPieceStorage(const PieceStorageHandle& pieceStorage)
  266. {
  267. this->pieceStorage = pieceStorage;
  268. }
  269. PieceStorageHandle DefaultBtAnnounce::getPieceStorage() const
  270. {
  271. return pieceStorage;
  272. }
  273. void DefaultBtAnnounce::setPeerStorage(const PeerStorageHandle& peerStorage)
  274. {
  275. this->peerStorage = peerStorage;
  276. }
  277. PeerStorageHandle DefaultBtAnnounce::getPeerStorage() const
  278. {
  279. return peerStorage;
  280. }
  281. void DefaultBtAnnounce::overrideMinInterval(time_t interval)
  282. {
  283. minInterval = interval;
  284. }
  285. } // namespace aria2