Peer.cc 2.8 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596
  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 "Peer.h"
  36. PeerHandle nullPeer = PeerHandle(new Peer("", 0, 0, 0));
  37. void Peer::updateBitfield(int index, int operation) {
  38. if(operation == 1) {
  39. bitfield->setBit(index);
  40. } else if(operation == 0) {
  41. bitfield->unsetBit(index);
  42. }
  43. }
  44. #define THRESHOLD 1024*1024*2
  45. bool Peer::shouldBeChoking() const {
  46. if(optUnchoking) {
  47. return false;
  48. }
  49. return chokingRequired;
  50. }
  51. bool Peer::hasPiece(int index) const {
  52. return bitfield->isBitSet(index);
  53. }
  54. bool Peer::isSeeder() const {
  55. return bitfield->isAllBitSet();
  56. }
  57. void Peer::resetStatus() {
  58. tryCount = 0;
  59. cuid = 0;
  60. amChoking = true;
  61. amInterested = false;
  62. peerChoking = true;
  63. peerInterested = false;
  64. chokingRequired = true;
  65. optUnchoking = false;
  66. snubbing = false;
  67. fastExtensionEnabled = false;
  68. latency = DEFAULT_LATENCY;
  69. fastSet.clear();
  70. peerStat.reset();
  71. }
  72. bool Peer::isInFastSet(int index) const {
  73. return find(fastSet.begin(), fastSet.end(), index) != fastSet.end();
  74. }
  75. void Peer::addFastSetIndex(int index) {
  76. if(!isInFastSet(index)) {
  77. fastSet.push_back(index);
  78. }
  79. }
  80. void Peer::setAllBitfield() {
  81. bitfield->setAllBit();
  82. }
  83. void Peer::updateLatency(int latency) {
  84. this->latency = (this->latency*20+latency*80)/200;
  85. }