| 123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305 | /* <!-- copyright *//* * aria2 - The high speed download utility * * Copyright (C) 2006 Tatsuhiro Tsujikawa * * This program is free software; you can redistribute it and/or modify * it under the terms of the GNU General Public License as published by * the Free Software Foundation; either version 2 of the License, or * (at your option) any later version. * * This program is distributed in the hope that it will be useful, * but WITHOUT ANY WARRANTY; without even the implied warranty of * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the * GNU General Public License for more details. * * You should have received a copy of the GNU General Public License * along with this program; if not, write to the Free Software * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA  02110-1301  USA * * In addition, as a special exception, the copyright holders give * permission to link the code of portions of this program with the * OpenSSL library under certain conditions as described in each * individual source file, and distribute linked combinations * including the two. * You must obey the GNU General Public License in all respects * for all of the code used other than OpenSSL.  If you modify * file(s) with this exception, you may extend this exception to your * version of the file(s), but you are not obligated to do so.  If you * do not wish to do so, delete this exception statement from your * version.  If you delete this exception statement from all source * files in the program, then also delete it here. *//* copyright --> */#ifndef _D_PEER_H_#define _D_PEER_H_#include "common.h"#include <cassert>#include <string>#include <deque>#include <algorithm>#include "SharedHandle.h"#include "TimeA2.h"#include "BtConstants.h"#include "PeerStat.h"#include "a2functional.h"namespace aria2 {class PeerSessionResource;class BtMessageDispatcher;class Peer {public:  std::string ipaddr;  // TCP port of the other end of communication.  If _incoming is  // true, then this port is not a port the peer is listening to and  // we cannot connect to it.  uint16_t port;private:  std::string id;  int32_t _cuid;  unsigned char _peerId[PEER_ID_LENGTH];  Time _firstContactTime;  Time _badConditionStartTime;  bool _seeder;  PeerSessionResource* _res;  // If true, port is assumed not to be a listening port.  bool _incoming;  // Before calling updateSeeder(),  make sure that  // allocateSessionResource() is called and _res is created.  // Otherwise assertion fails.  void updateSeeder();public:  Peer(std::string ipaddr, uint16_t port, bool incoming = false);  ~Peer();  bool operator==(const Peer& p)  {    return id == p.id;  }    bool operator!=(const Peer& p)  {    return !(*this == p);  }  void resetStatus();  void usedBy(int32_t cuid);  int32_t usedBy() const  {    return _cuid;  }  bool unused() const  {    return _cuid == 0;  }  // Returns true iff _res != 0.  bool isActive() const  {    return _res != 0;  }  void setPeerId(const unsigned char* peerId);  const unsigned char* getPeerId() const  {    return _peerId;  }  bool isSeeder() const  {    return _seeder;  }  const std::string& getID() const  {    return id;  }  void startBadCondition();  bool isGood() const;  void allocateSessionResource(size_t pieceLength, uint64_t totalLength);  void releaseSessionResource();  const Time& getFirstContactTime() const  {    return _firstContactTime;  }  void setFirstContactTime(const Time& time);  const Time& getBadConditionStartTime() const  {    return _badConditionStartTime;  }  // Before calling following member functions,  make sure that  // allocateSessionResource() is called and _res is created.  // Otherwise assertion fails.  // localhost is choking this peer  bool amChoking() const;  void amChoking(bool b) const;  // localhost is interested in this peer  bool amInterested() const;  void amInterested(bool b) const;  // this peer is choking localhost  bool peerChoking() const;  void peerChoking(bool b) const;  // this peer is interested in localhost  bool peerInterested() const;  void peerInterested(bool b);    // this peer should be choked  bool chokingRequired() const;  void chokingRequired(bool b);  // this peer is eligible for unchoking optionally.  bool optUnchoking() const;  void optUnchoking(bool b);  // this peer is snubbing.  bool snubbing() const;  void snubbing(bool b);  void updateUploadLength(size_t bytes);  void updateDownloadLength(size_t bytes);  /**   * Returns the transfer rate from localhost to remote host.   */  unsigned int calculateUploadSpeed();  unsigned int calculateUploadSpeed(const struct timeval& now);  /**   * Returns the transfer rate from remote host to localhost.   */  unsigned int calculateDownloadSpeed();  unsigned int calculateDownloadSpeed(const struct timeval& now);  /**   * Returns the number of bytes uploaded to the remote host.   */  uint64_t getSessionUploadLength() const;  /**   * Returns the number of bytes downloaded from the remote host.   */  uint64_t getSessionDownloadLength() const;    void setBitfield(const unsigned char* bitfield, size_t bitfieldLength);  const unsigned char* getBitfield() const;  size_t getBitfieldLength() const;  void setAllBitfield();  /**   * operation = 1: set index-th bit to 1   * operation = 0: set index-th bit to 0   */  void updateBitfield(size_t index, int operation);    void setFastExtensionEnabled(bool enabled);  bool isFastExtensionEnabled() const;  void addPeerAllowedIndex(size_t index);  bool isInPeerAllowedIndexSet(size_t index) const;  size_t countPeerAllowedIndexSet() const;  const std::deque<size_t>& getPeerAllowedIndexSet() const;  void addAmAllowedIndex(size_t index);  bool isInAmAllowedIndexSet(size_t index) const;  void setExtendedMessagingEnabled(bool enabled);  bool isExtendedMessagingEnabled() const;  void setDHTEnabled(bool enabled);  bool isDHTEnabled() const;  bool shouldBeChoking() const;  bool hasPiece(size_t index) const;  void updateLatency(unsigned int latency);  unsigned int getLatency() const;  uint8_t getExtensionMessageID(const std::string& name) const;  std::string getExtensionName(uint8_t id) const;  void setExtension(const std::string& name, uint8_t id);  const Time& getLastDownloadUpdate() const;  const Time& getLastAmUnchoking() const;  uint64_t getCompletedLength() const;  bool isIncomingPeer() const  {    return _incoming;  }  void setIncomingPeer(bool incoming);  void setBtMessageDispatcher(const WeakHandle<BtMessageDispatcher>& dpt);  size_t countOutstandingUpload() const;};template<typename InputIterator>size_t countSeeder(InputIterator first, InputIterator last){  return std::count_if(first, last, mem_fun_sh(&Peer::isSeeder));}typedef SharedHandle<Peer> PeerHandle;typedef std::deque<PeerHandle> Peers;} // namespace aria2#endif // _D_PEER_H_
 |