| 123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960 |
- /* <!-- copyright */
- /*
- * aria2 - a simple utility for downloading files faster
- *
- * 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., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
- */
- /* copyright --> */
- #include "Peer.h"
- Peer* Peer::nullPeer = new Peer("", 0, 0, 0);
- void Peer::updateBitfield(int index, int operation) {
- if(operation == 1) {
- bitfield->setBit(index);
- } else if(operation == 0) {
- bitfield->unsetBit(index);
- }
- }
- #define THRESHOLD 1024*1024*2
- bool Peer::shouldChoke() const {
- if(bitfield->countBlock()*0.7 < bitfield->countMissingBlock()) {
- return false;
- }
- if(peerDownload <= pieceLength*10) {
- return false;
- }
- // we are always optimistic.
- if(amInterested && peerInterested) {
- return false;
- }
- if(amChocking) {
- return !(peerDownload+pieceLength*5 < peerUpload);
- } else {
- return peerDownload >= peerUpload+pieceLength*5;
- }
- }
- bool Peer::hasPiece(int index) const {
- return bitfield->isBitSet(index);
- }
- bool Peer::isSeeder() const {
- return bitfield->isAllBitSet();
- }
|