2008-07-29 11:18:27 -04:00
|
|
|
/*
|
|
|
|
* libretroshare/src/ft: fttransfermodule.cc
|
|
|
|
*
|
|
|
|
* File Transfer for RetroShare.
|
|
|
|
*
|
|
|
|
* Copyright 2008 by Robert Fernie.
|
|
|
|
*
|
|
|
|
* This library is free software; you can redistribute it and/or
|
|
|
|
* modify it under the terms of the GNU Library General Public
|
|
|
|
* License Version 2 as published by the Free Software Foundation.
|
|
|
|
*
|
|
|
|
* This library 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
|
|
|
|
* Library General Public License for more details.
|
|
|
|
*
|
|
|
|
* You should have received a copy of the GNU Library General Public
|
|
|
|
* License along with this library; if not, write to the Free Software
|
|
|
|
* Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307
|
|
|
|
* USA.
|
|
|
|
*
|
|
|
|
* Please report all bugs and problems to "retroshare@lunamutt.com".
|
|
|
|
*
|
2008-09-08 04:44:37 -04:00
|
|
|
*/
|
|
|
|
|
2008-10-29 16:58:23 -04:00
|
|
|
/*******
|
|
|
|
* #define FT_DEBUG 1
|
|
|
|
******/
|
2008-09-10 10:12:13 -04:00
|
|
|
|
2008-11-02 06:38:11 -05:00
|
|
|
#define FT_DEBUG 1
|
|
|
|
|
2008-09-08 04:44:37 -04:00
|
|
|
#include "fttransfermodule.h"
|
|
|
|
|
2008-11-04 18:12:53 -05:00
|
|
|
/*************************************************************************
|
|
|
|
* Notes on file transfer strategy.
|
|
|
|
* Care must be taken not to overload pipe. best way is to time requests.
|
|
|
|
* and according adjust data rate.
|
|
|
|
*
|
|
|
|
* each peer gets a 'max_rate' which is decided on the type of transfer.
|
|
|
|
* - trickle ...
|
|
|
|
* - stream ...
|
|
|
|
* - max ...
|
|
|
|
*
|
|
|
|
* Each peer is independently managed.
|
|
|
|
*
|
|
|
|
* via the functions:
|
|
|
|
*
|
|
|
|
*/
|
|
|
|
|
|
|
|
const double FT_TM_MAX_PEER_RATE = 1024 * 1024; /* 1MB/s */
|
2008-11-13 18:03:46 -05:00
|
|
|
const uint32_t FT_TM_MAX_RESETS = 5;
|
2008-11-04 18:12:53 -05:00
|
|
|
|
2008-09-09 09:08:22 -04:00
|
|
|
ftTransferModule::ftTransferModule(ftFileCreator *fc, ftDataMultiplex *dm, ftController *c)
|
|
|
|
:mFileCreator(fc), mMultiplexor(dm), mFtController(c), mFlag(0)
|
2008-09-08 04:44:37 -04:00
|
|
|
{
|
2008-11-02 06:38:11 -05:00
|
|
|
RsStackMutex stack(tfMtx); /******* STACK LOCKED ******/
|
|
|
|
|
2008-09-08 04:44:37 -04:00
|
|
|
mHash = mFileCreator->getHash();
|
|
|
|
mSize = mFileCreator->getFileSize();
|
2008-09-09 09:08:22 -04:00
|
|
|
mFileStatus.hash = mHash;
|
2008-09-08 04:44:37 -04:00
|
|
|
|
|
|
|
// Dummy for Testing (should be handled independantly for
|
|
|
|
// each peer.
|
|
|
|
//mChunkSize = 10000;
|
2008-11-04 18:12:53 -05:00
|
|
|
desiredRate = 1000000; /* 1MB/s ??? */
|
|
|
|
actualRate = 0;
|
2008-09-08 04:44:37 -04:00
|
|
|
return;
|
|
|
|
}
|
|
|
|
|
2008-07-29 11:18:27 -04:00
|
|
|
ftTransferModule::~ftTransferModule()
|
|
|
|
{}
|
|
|
|
|
2008-11-02 06:38:11 -05:00
|
|
|
|
2008-07-29 11:18:27 -04:00
|
|
|
bool ftTransferModule::setFileSources(std::list<std::string> peerIds)
|
|
|
|
{
|
2008-11-02 06:38:11 -05:00
|
|
|
RsStackMutex stack(tfMtx); /******* STACK LOCKED ******/
|
|
|
|
|
2008-09-08 10:04:10 -04:00
|
|
|
mFileSources.clear();
|
|
|
|
|
2008-09-10 10:12:13 -04:00
|
|
|
#ifdef FT_DEBUG
|
|
|
|
std::cerr << "ftTransferModule::setFileSources()";
|
|
|
|
std::cerr << " List of peers: " ;
|
|
|
|
#endif
|
|
|
|
|
2008-07-29 11:18:27 -04:00
|
|
|
std::list<std::string>::iterator it;
|
|
|
|
for(it = peerIds.begin(); it != peerIds.end(); it++)
|
|
|
|
{
|
2008-09-10 10:12:13 -04:00
|
|
|
|
|
|
|
#ifdef FT_DEBUG
|
|
|
|
std::cerr << " \t" << *it;
|
|
|
|
#endif
|
|
|
|
|
2008-09-09 09:08:22 -04:00
|
|
|
peerInfo pInfo(*it);
|
|
|
|
mFileSources.insert(std::pair<std::string,peerInfo>(*it,pInfo));
|
2008-07-29 11:18:27 -04:00
|
|
|
}
|
|
|
|
|
2008-09-10 10:12:13 -04:00
|
|
|
#ifdef FT_DEBUG
|
|
|
|
std::cerr << std::endl;
|
|
|
|
#endif
|
|
|
|
|
2008-09-08 10:04:10 -04:00
|
|
|
return true;
|
2008-07-29 11:18:27 -04:00
|
|
|
}
|
|
|
|
|
2008-11-02 06:38:11 -05:00
|
|
|
bool ftTransferModule::getFileSources(std::list<std::string> &peerIds)
|
|
|
|
{
|
|
|
|
RsStackMutex stack(tfMtx); /******* STACK LOCKED ******/
|
|
|
|
std::map<std::string,peerInfo>::iterator it;
|
|
|
|
for(it = mFileSources.begin(); it != mFileSources.end(); it++)
|
|
|
|
{
|
|
|
|
peerIds.push_back(it->first);
|
|
|
|
}
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
2008-11-13 18:03:46 -05:00
|
|
|
bool ftTransferModule::addFileSource(std::string peerId)
|
|
|
|
{
|
|
|
|
RsStackMutex stack(tfMtx); /******* STACK LOCKED ******/
|
|
|
|
std::map<std::string,peerInfo>::iterator mit;
|
|
|
|
mit = mFileSources.find(peerId);
|
|
|
|
|
|
|
|
if (mit == mFileSources.end())
|
|
|
|
{
|
|
|
|
/* add in new source */
|
|
|
|
peerInfo pInfo(peerId);
|
|
|
|
mFileSources.insert(std::pair<std::string,peerInfo>(peerId,pInfo));
|
|
|
|
mit = mFileSources.find(peerId);
|
|
|
|
|
|
|
|
#ifdef FT_DEBUG
|
|
|
|
std::cerr << "ftTransferModule::addFileSource()";
|
|
|
|
std::cerr << " adding peer: " << peerId << " to sourceList";
|
|
|
|
std::cerr << std::endl;
|
|
|
|
#endif
|
|
|
|
|
|
|
|
}
|
|
|
|
else
|
|
|
|
{
|
|
|
|
#ifdef FT_DEBUG
|
|
|
|
std::cerr << "ftTransferModule::addFileSource()";
|
|
|
|
std::cerr << " peer: " << peerId << " already there";
|
|
|
|
std::cerr << std::endl;
|
|
|
|
#endif
|
|
|
|
}
|
|
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
2008-09-09 03:24:06 -04:00
|
|
|
bool ftTransferModule::setPeerState(std::string peerId,uint32_t state,uint32_t maxRate)
|
2008-07-29 11:18:27 -04:00
|
|
|
{
|
2008-11-02 06:38:11 -05:00
|
|
|
RsStackMutex stack(tfMtx); /******* STACK LOCKED ******/
|
2008-09-09 03:24:06 -04:00
|
|
|
#ifdef FT_DEBUG
|
|
|
|
std::cerr << "ftTransferModule::setPeerState()";
|
|
|
|
std::cerr << " peerId: " << peerId;
|
|
|
|
std::cerr << " state: " << state;
|
|
|
|
std::cerr << " maxRate: " << maxRate << std::endl;
|
|
|
|
#endif
|
|
|
|
|
2008-09-08 10:04:10 -04:00
|
|
|
std::map<std::string,peerInfo>::iterator mit;
|
|
|
|
mit = mFileSources.find(peerId);
|
2008-07-29 11:18:27 -04:00
|
|
|
|
2008-11-13 18:03:46 -05:00
|
|
|
if (mit == mFileSources.end())
|
|
|
|
{
|
|
|
|
/* add in new source */
|
|
|
|
|
|
|
|
#ifdef FT_DEBUG
|
|
|
|
std::cerr << "ftTransferModule::setPeerState()";
|
|
|
|
std::cerr << " adding new peer to sourceList";
|
|
|
|
std::cerr << std::endl;
|
|
|
|
#endif
|
|
|
|
return false;
|
|
|
|
}
|
2008-07-29 11:18:27 -04:00
|
|
|
|
2008-09-08 10:04:10 -04:00
|
|
|
(mit->second).state=state;
|
|
|
|
(mit->second).desiredRate=maxRate;
|
2008-11-04 18:12:53 -05:00
|
|
|
(mit->second).actualRate=maxRate; /* should give big kick in right direction */
|
2008-07-29 11:18:27 -04:00
|
|
|
|
2008-09-09 03:24:06 -04:00
|
|
|
std::list<std::string>::iterator it;
|
2008-11-04 18:12:53 -05:00
|
|
|
it = std::find(mOnlinePeers.begin(), mOnlinePeers.end(), peerId);
|
2008-09-09 03:24:06 -04:00
|
|
|
|
|
|
|
if (state!=PQIPEER_NOT_ONLINE)
|
|
|
|
{
|
|
|
|
//change to online, add peerId in online peer list
|
|
|
|
if (it==mOnlinePeers.end()) mOnlinePeers.push_back(peerId);
|
|
|
|
}
|
|
|
|
else
|
|
|
|
{
|
|
|
|
//change to offline, remove peerId in online peer list
|
|
|
|
if (it!=mOnlinePeers.end()) mOnlinePeers.erase(it);
|
|
|
|
}
|
2008-09-08 10:04:10 -04:00
|
|
|
|
|
|
|
return true;
|
2008-07-29 11:18:27 -04:00
|
|
|
}
|
|
|
|
|
2008-11-02 06:38:11 -05:00
|
|
|
|
|
|
|
bool ftTransferModule::getPeerState(std::string peerId,uint32_t &state,uint32_t &tfRate)
|
|
|
|
{
|
|
|
|
RsStackMutex stack(tfMtx); /******* STACK LOCKED ******/
|
|
|
|
std::map<std::string,peerInfo>::iterator mit;
|
|
|
|
mit = mFileSources.find(peerId);
|
|
|
|
|
|
|
|
if (mit == mFileSources.end()) return false;
|
|
|
|
|
|
|
|
state = (mit->second).state;
|
|
|
|
tfRate = (uint32_t) (mit->second).actualRate;
|
|
|
|
|
|
|
|
#ifdef FT_DEBUG
|
|
|
|
std::cerr << "ftTransferModule::getPeerState()";
|
|
|
|
std::cerr << " peerId: " << peerId;
|
|
|
|
std::cerr << " state: " << state;
|
|
|
|
std::cerr << " tfRate: " << tfRate << std::endl;
|
|
|
|
#endif
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
2008-07-29 11:18:27 -04:00
|
|
|
uint32_t ftTransferModule::getDataRate(std::string peerId)
|
|
|
|
{
|
2008-11-02 06:38:11 -05:00
|
|
|
RsStackMutex stack(tfMtx); /******* STACK LOCKED ******/
|
2008-07-29 11:18:27 -04:00
|
|
|
std::map<std::string,peerInfo>::iterator mit;
|
2008-09-08 10:04:10 -04:00
|
|
|
mit = mFileSources.find(peerId);
|
|
|
|
if (mit == mFileSources.end())
|
|
|
|
{
|
|
|
|
#ifdef FT_DEBUG
|
|
|
|
std::cerr << "ftTransferModule::getDataRate()";
|
|
|
|
std::cerr << " peerId: " << peerId;
|
|
|
|
std::cerr << " peer not exist in file sources " << std::endl;
|
|
|
|
#endif
|
2008-07-29 11:18:27 -04:00
|
|
|
return 0;
|
2008-09-08 10:04:10 -04:00
|
|
|
}
|
2008-07-29 11:18:27 -04:00
|
|
|
else
|
2008-08-17 11:23:11 -04:00
|
|
|
return (uint32_t) (mit->second).actualRate;
|
2008-07-29 11:18:27 -04:00
|
|
|
}
|
|
|
|
|
2008-09-08 04:44:37 -04:00
|
|
|
|
|
|
|
//interface to client module
|
|
|
|
bool ftTransferModule::recvFileData(std::string peerId, uint64_t offset,
|
|
|
|
uint32_t chunk_size, void *data)
|
|
|
|
{
|
|
|
|
#ifdef FT_DEBUG
|
|
|
|
std::cerr << "ftTransferModule::recvFileData()";
|
|
|
|
std::cerr << " peerId: " << peerId;
|
|
|
|
std::cerr << " offset: " << offset;
|
|
|
|
std::cerr << " chunksize: " << chunk_size;
|
2008-10-29 16:58:23 -04:00
|
|
|
std::cerr << " data: " << data;
|
2008-09-08 04:44:37 -04:00
|
|
|
std::cerr << std::endl;
|
|
|
|
#endif
|
2008-09-08 10:04:10 -04:00
|
|
|
|
2008-11-04 18:12:53 -05:00
|
|
|
bool ok = false;
|
|
|
|
|
2008-11-02 06:38:11 -05:00
|
|
|
{
|
|
|
|
RsStackMutex stack(tfMtx); /******* STACK LOCKED ******/
|
|
|
|
|
2008-11-04 18:12:53 -05:00
|
|
|
std::map<std::string,peerInfo>::iterator mit;
|
|
|
|
mit = mFileSources.find(peerId);
|
2008-09-08 10:04:10 -04:00
|
|
|
|
2008-11-04 18:12:53 -05:00
|
|
|
if (mit == mFileSources.end())
|
|
|
|
{
|
2008-10-22 14:12:58 -04:00
|
|
|
#ifdef FT_DEBUG
|
2008-11-04 18:12:53 -05:00
|
|
|
std::cerr << "ftTransferModule::recvFileData()";
|
|
|
|
std::cerr << " peer not found in sources";
|
|
|
|
std::cerr << std::endl;
|
2008-10-22 14:12:58 -04:00
|
|
|
#endif
|
2008-11-04 18:12:53 -05:00
|
|
|
return false;
|
|
|
|
}
|
|
|
|
ok = locked_recvPeerData(mit->second, offset, chunk_size, data);
|
2008-09-08 10:04:10 -04:00
|
|
|
|
2008-11-02 06:38:11 -05:00
|
|
|
} /***** STACK MUTEX END ****/
|
2008-11-04 18:12:53 -05:00
|
|
|
|
|
|
|
if (ok)
|
|
|
|
storeData(offset, chunk_size, data);
|
|
|
|
return ok;
|
2008-09-08 04:44:37 -04:00
|
|
|
}
|
|
|
|
|
|
|
|
void ftTransferModule::requestData(std::string peerId, uint64_t offset, uint32_t chunk_size)
|
|
|
|
{
|
2008-09-08 10:04:10 -04:00
|
|
|
#ifdef FT_DEBUG
|
2008-09-08 04:44:37 -04:00
|
|
|
std::cerr << "ftTransferModule::requestData()";
|
|
|
|
std::cerr << " peerId: " << peerId;
|
2008-09-08 10:04:10 -04:00
|
|
|
std::cerr << " hash: " << mHash;
|
|
|
|
std::cerr << " size: " << mSize;
|
2008-09-08 04:44:37 -04:00
|
|
|
std::cerr << " offset: " << offset;
|
|
|
|
std::cerr << " chunk_size: " << chunk_size;
|
|
|
|
std::cerr << std::endl;
|
2008-09-08 10:04:10 -04:00
|
|
|
#endif
|
2008-09-08 04:44:37 -04:00
|
|
|
|
|
|
|
mMultiplexor->sendDataRequest(peerId, mHash, mSize, offset,chunk_size);
|
|
|
|
}
|
|
|
|
|
|
|
|
bool ftTransferModule::getChunk(uint64_t &offset, uint32_t &chunk_size)
|
|
|
|
{
|
2008-09-08 10:04:10 -04:00
|
|
|
#ifdef FT_DEBUG
|
2008-09-08 04:44:37 -04:00
|
|
|
std::cerr << "ftTransferModule::getChunk()";
|
2008-09-08 10:04:10 -04:00
|
|
|
std::cerr << " hash: " << mHash;
|
|
|
|
std::cerr << " size: " << mSize;
|
|
|
|
std::cerr << " offset: " << offset;
|
2008-09-08 04:44:37 -04:00
|
|
|
std::cerr << " chunk_size: " << chunk_size;
|
|
|
|
std::cerr << std::endl;
|
2008-09-08 10:04:10 -04:00
|
|
|
#endif
|
2008-09-08 04:44:37 -04:00
|
|
|
|
|
|
|
bool val = mFileCreator->getMissingChunk(offset, chunk_size);
|
|
|
|
|
2008-09-08 10:04:10 -04:00
|
|
|
#ifdef FT_DEBUG
|
2008-09-08 04:44:37 -04:00
|
|
|
if (val)
|
|
|
|
{
|
|
|
|
std::cerr << "ftTransferModule::getChunk()";
|
2008-09-08 10:04:10 -04:00
|
|
|
std::cerr << " Answer: Chunk Available";
|
|
|
|
std::cerr << " hash: " << mHash;
|
|
|
|
std::cerr << " size: " << mSize;
|
|
|
|
std::cerr << " offset: " << offset;
|
2008-09-08 04:44:37 -04:00
|
|
|
std::cerr << " chunk_size: " << chunk_size;
|
|
|
|
std::cerr << std::endl;
|
|
|
|
}
|
|
|
|
else
|
|
|
|
{
|
|
|
|
std::cerr << "ftTransferModule::getChunk()";
|
|
|
|
std::cerr << " Answer: No Chunk Available";
|
|
|
|
std::cerr << std::endl;
|
|
|
|
}
|
2008-09-08 10:04:10 -04:00
|
|
|
#endif
|
2008-09-08 04:44:37 -04:00
|
|
|
|
|
|
|
return val;
|
|
|
|
}
|
|
|
|
|
|
|
|
bool ftTransferModule::storeData(uint64_t offset, uint32_t chunk_size,void *data)
|
|
|
|
{
|
2008-09-08 10:04:10 -04:00
|
|
|
#ifdef FT_DEBUG
|
2008-09-08 04:44:37 -04:00
|
|
|
std::cerr << "ftTransferModule::storeData()";
|
2008-09-08 10:04:10 -04:00
|
|
|
std::cerr << " hash: " << mHash;
|
|
|
|
std::cerr << " size: " << mSize;
|
2008-09-08 04:44:37 -04:00
|
|
|
std::cerr << " offset: " << offset;
|
|
|
|
std::cerr << " chunk_size: " << chunk_size;
|
|
|
|
std::cerr << std::endl;
|
2008-09-08 10:04:10 -04:00
|
|
|
#endif
|
2008-09-08 04:44:37 -04:00
|
|
|
|
|
|
|
return mFileCreator -> addFileData(offset, chunk_size, data);
|
|
|
|
}
|
|
|
|
|
2008-09-09 03:24:06 -04:00
|
|
|
bool ftTransferModule::queryInactive()
|
2008-07-29 11:18:27 -04:00
|
|
|
{
|
2008-11-02 06:38:11 -05:00
|
|
|
/* NB: Not sure about this lock... might cause deadlock.
|
|
|
|
*/
|
|
|
|
RsStackMutex stack(tfMtx); /******* STACK LOCKED ******/
|
|
|
|
|
2008-07-29 11:18:27 -04:00
|
|
|
#ifdef FT_DEBUG
|
2008-09-08 10:04:10 -04:00
|
|
|
std::cerr << "ftTransferModule::queryInactive()" << std::endl;
|
2008-07-29 11:18:27 -04:00
|
|
|
#endif
|
2008-09-08 10:04:10 -04:00
|
|
|
|
2008-11-04 18:12:53 -05:00
|
|
|
if (mFileStatus.stat == ftFileStatus::PQIFILE_INIT)
|
|
|
|
mFileStatus.stat = ftFileStatus::PQIFILE_DOWNLOADING;
|
2008-09-08 04:44:37 -04:00
|
|
|
|
2008-11-04 18:12:53 -05:00
|
|
|
if (mFileStatus.stat != ftFileStatus::PQIFILE_DOWNLOADING)
|
|
|
|
{
|
|
|
|
if (mFileStatus.stat == ftFileStatus::PQIFILE_FAIL_CANCEL)
|
|
|
|
mFlag = 2; //file canceled by user
|
|
|
|
return false;
|
2008-10-29 16:58:23 -04:00
|
|
|
}
|
2008-09-08 10:04:10 -04:00
|
|
|
|
2008-11-04 18:12:53 -05:00
|
|
|
std::map<std::string,peerInfo>::iterator mit;
|
|
|
|
for(mit = mFileSources.begin(); mit != mFileSources.end(); mit++)
|
|
|
|
{
|
|
|
|
locked_tickPeerTransfer(mit->second);
|
|
|
|
}
|
|
|
|
return true;
|
2008-07-29 11:18:27 -04:00
|
|
|
}
|
|
|
|
|
2008-09-08 04:44:37 -04:00
|
|
|
bool ftTransferModule::pauseTransfer()
|
2008-07-29 11:18:27 -04:00
|
|
|
{
|
2008-11-02 06:38:11 -05:00
|
|
|
RsStackMutex stack(tfMtx); /******* STACK LOCKED ******/
|
|
|
|
|
2008-09-08 04:44:37 -04:00
|
|
|
/*
|
2008-07-29 11:18:27 -04:00
|
|
|
std::map<std::string,peerInfo>::iterator mit;
|
|
|
|
for(mit = mOnlinePeers.begin(); mit != mOnlinePeers.end(); mit++)
|
|
|
|
{
|
|
|
|
(mit->second).state = PQIPEER_SUSPEND;
|
|
|
|
}
|
2008-09-08 04:44:37 -04:00
|
|
|
*/
|
|
|
|
mFileStatus.stat=ftFileStatus::PQIFILE_PAUSE;
|
|
|
|
|
2008-07-29 11:18:27 -04:00
|
|
|
return 1;
|
|
|
|
}
|
|
|
|
|
|
|
|
bool ftTransferModule::resumeTransfer()
|
|
|
|
{
|
2008-11-02 06:38:11 -05:00
|
|
|
RsStackMutex stack(tfMtx); /******* STACK LOCKED ******/
|
2008-09-08 04:44:37 -04:00
|
|
|
/*
|
2008-07-29 11:18:27 -04:00
|
|
|
std::map<std::string,peerInfo>::iterator mit;
|
|
|
|
for(mit = mOnlinePeers.begin(); mit != mOnlinePeers.end(); mit++)
|
|
|
|
{
|
|
|
|
(mit->second).state = PQIPEER_IDLE;
|
|
|
|
}
|
2008-09-08 04:44:37 -04:00
|
|
|
*/
|
|
|
|
mFileStatus.stat=ftFileStatus::PQIFILE_DOWNLOADING;
|
2008-07-29 11:18:27 -04:00
|
|
|
|
|
|
|
return 1;
|
|
|
|
}
|
|
|
|
|
2008-09-08 04:44:37 -04:00
|
|
|
bool ftTransferModule::cancelTransfer()
|
|
|
|
{
|
2008-11-02 06:38:11 -05:00
|
|
|
RsStackMutex stack(tfMtx); /******* STACK LOCKED ******/
|
2008-09-08 10:04:10 -04:00
|
|
|
mFileStatus.stat=ftFileStatus::PQIFILE_FAIL_CANCEL;
|
|
|
|
|
|
|
|
return 1;
|
2008-09-08 04:44:37 -04:00
|
|
|
}
|
|
|
|
|
|
|
|
bool ftTransferModule::completeFileTransfer()
|
|
|
|
{
|
2008-10-29 16:58:23 -04:00
|
|
|
std::cerr << "ftTransferModule::completeFileTransfer()";
|
|
|
|
std::cerr << std::endl;
|
|
|
|
|
|
|
|
if (mFtController)
|
|
|
|
mFtController->FlagFileComplete(mHash);
|
2008-09-08 04:44:37 -04:00
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
2008-07-29 11:18:27 -04:00
|
|
|
int ftTransferModule::tick()
|
|
|
|
{
|
2008-09-10 10:12:13 -04:00
|
|
|
#ifdef FT_DEBUG
|
2008-11-04 18:12:53 -05:00
|
|
|
{
|
|
|
|
RsStackMutex stack(tfMtx); /******* STACK LOCKED ******/
|
|
|
|
|
2008-09-10 10:12:13 -04:00
|
|
|
std::cerr << "ftTransferModule::tick()";
|
|
|
|
std::cerr << " mFlag: " << mFlag;
|
2008-11-04 18:12:53 -05:00
|
|
|
std::cerr << " mHash: " << mHash;
|
|
|
|
std::cerr << " mSize: " << mSize;
|
2008-09-10 10:12:13 -04:00
|
|
|
std::cerr << std::endl;
|
2008-11-04 18:12:53 -05:00
|
|
|
|
|
|
|
std::cerr << "Peers: ";
|
|
|
|
std::map<std::string,peerInfo>::iterator it;
|
|
|
|
for(it = mFileSources.begin(); it != mFileSources.end(); it++)
|
|
|
|
{
|
|
|
|
std::cerr << " " << it->first;
|
|
|
|
}
|
|
|
|
std::cerr << std::endl;
|
|
|
|
|
|
|
|
|
|
|
|
}
|
2008-09-10 10:12:13 -04:00
|
|
|
#endif
|
|
|
|
|
2008-11-04 18:12:53 -05:00
|
|
|
|
2008-07-29 11:18:27 -04:00
|
|
|
queryInactive();
|
2008-11-02 06:38:11 -05:00
|
|
|
|
|
|
|
uint32_t flags = 0;
|
|
|
|
{
|
|
|
|
RsStackMutex stack(tfMtx); /******* STACK LOCKED ******/
|
|
|
|
flags = mFlag;
|
|
|
|
}
|
|
|
|
|
|
|
|
switch (flags)
|
2008-09-09 03:24:06 -04:00
|
|
|
{
|
|
|
|
case 0:
|
|
|
|
adjustSpeed();
|
|
|
|
break;
|
|
|
|
case 1:
|
|
|
|
completeFileTransfer();
|
|
|
|
break;
|
|
|
|
case 2:
|
|
|
|
/* tell me what to do here */
|
|
|
|
break;
|
|
|
|
default:
|
|
|
|
break;
|
|
|
|
}
|
2008-07-29 11:18:27 -04:00
|
|
|
|
|
|
|
return 0;
|
|
|
|
}
|
2008-09-08 04:44:37 -04:00
|
|
|
|
|
|
|
|
|
|
|
void ftTransferModule::adjustSpeed()
|
|
|
|
{
|
2008-11-02 06:38:11 -05:00
|
|
|
RsStackMutex stack(tfMtx); /******* STACK LOCKED ******/
|
|
|
|
|
2008-08-06 00:12:36 -04:00
|
|
|
std::map<std::string,peerInfo>::iterator mit;
|
2008-11-02 06:38:11 -05:00
|
|
|
|
2008-11-04 18:12:53 -05:00
|
|
|
|
|
|
|
actualRate = 0;
|
|
|
|
for(mit = mFileSources.begin(); mit != mFileSources.end(); mit++)
|
|
|
|
{
|
2008-11-02 06:38:11 -05:00
|
|
|
#ifdef FT_DEBUG
|
|
|
|
std::cerr << "ftTransferModule::adjustSpeed()";
|
2008-11-04 18:12:53 -05:00
|
|
|
std::cerr << "Peer: " << mit->first;
|
|
|
|
std::cerr << " Desired Rate: " << (mit->second).desiredRate;
|
|
|
|
std::cerr << " Actual Rate: " << (mit->second).actualRate;
|
2008-11-02 06:38:11 -05:00
|
|
|
std::cerr << std::endl;
|
|
|
|
#endif
|
2008-11-04 18:12:53 -05:00
|
|
|
actualRate += mit->second.actualRate;
|
|
|
|
}
|
2008-11-02 06:38:11 -05:00
|
|
|
|
|
|
|
#ifdef FT_DEBUG
|
2008-11-04 18:12:53 -05:00
|
|
|
std::cerr << "ftTransferModule::adjustSpeed() Totals:";
|
|
|
|
std::cerr << "Desired Rate: " << desiredRate << " Actual Rate: " << actualRate;
|
2008-11-02 06:38:11 -05:00
|
|
|
std::cerr << std::endl;
|
|
|
|
#endif
|
|
|
|
|
2008-11-04 18:12:53 -05:00
|
|
|
return;
|
|
|
|
}
|
2008-09-08 04:44:37 -04:00
|
|
|
|
2008-11-04 18:12:53 -05:00
|
|
|
|
|
|
|
/*******************************************************************************
|
|
|
|
* Actual Peer Transfer Management Code.
|
|
|
|
*
|
|
|
|
* request very tick, at rate
|
|
|
|
*
|
|
|
|
*
|
|
|
|
**/
|
|
|
|
|
|
|
|
const uint32_t FT_TM_MINIMUM_CHUNK = 1024; /* ie 1Kb / sec */
|
2008-11-13 18:03:46 -05:00
|
|
|
const uint32_t FT_TM_RESTART_DOWNLOAD = 10; /* 10 seconds */
|
2008-11-04 18:12:53 -05:00
|
|
|
const uint32_t FT_TM_DOWNLOAD_TIMEOUT = 5; /* 5 seconds */
|
|
|
|
|
2008-11-13 18:03:46 -05:00
|
|
|
/* NOTEs on this function...
|
|
|
|
* 1) This is the critical function for deciding the rate at which ft takes place.
|
|
|
|
* 2) Some of the peers might not have the file... care must be taken avoid deadlock.
|
|
|
|
*
|
|
|
|
* Eg. A edge case which fails badly.
|
|
|
|
* Small 1K file (one chunk), with 3 sources (A,B,C). A doesn't have file.
|
|
|
|
* (a) request data from A. B & C pause cos no more data needed.
|
|
|
|
* (b) all timeout, chunk reset... then back to request again (a) and repeat.
|
|
|
|
* (c) all timeout x 5 and are disabled.... no transfer, while B&C had it all the time.
|
|
|
|
*
|
|
|
|
* To solve this we might need random waiting periods, so each peer can
|
|
|
|
* be tried.
|
|
|
|
*
|
|
|
|
*
|
|
|
|
*/
|
|
|
|
|
2008-11-04 18:12:53 -05:00
|
|
|
bool ftTransferModule::locked_tickPeerTransfer(peerInfo &info)
|
|
|
|
{
|
|
|
|
/* how long has it been? */
|
|
|
|
time_t ts = time(NULL);
|
|
|
|
|
|
|
|
int ageRecv = ts - info.recvTS;
|
|
|
|
int ageReq = ts - info.lastTS;
|
|
|
|
|
2008-11-09 17:17:20 -05:00
|
|
|
/* if offline - ignore */
|
|
|
|
if ((info.state == PQIPEER_SUSPEND) ||
|
|
|
|
(info.state == PQIPEER_NOT_ONLINE))
|
|
|
|
{
|
|
|
|
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
|
2008-11-13 18:03:46 -05:00
|
|
|
if (ageReq > FT_TM_RESTART_DOWNLOAD * (info.nResets + 1))
|
2008-11-04 18:12:53 -05:00
|
|
|
{
|
2008-11-13 18:03:46 -05:00
|
|
|
if (info.nResets > 1) /* 3rd timeout */
|
|
|
|
{
|
|
|
|
/* 90% chance of return false...
|
|
|
|
* will mean variations in which peer
|
|
|
|
* starts first. hopefully stop deadlocks.
|
|
|
|
*/
|
|
|
|
if (rand() % 10 != 0)
|
|
|
|
{
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2008-11-04 18:12:53 -05:00
|
|
|
info.state = PQIPEER_DOWNLOADING;
|
|
|
|
info.recvTS = ts; /* reset to activate */
|
2008-11-13 18:03:46 -05:00
|
|
|
info.nResets++;
|
2008-11-04 18:12:53 -05:00
|
|
|
ageRecv = 0;
|
2008-11-13 18:03:46 -05:00
|
|
|
|
|
|
|
if (info.nResets >= FT_TM_MAX_RESETS)
|
|
|
|
{
|
|
|
|
/* for this file anyway */
|
|
|
|
info.state = PQIPEER_NOT_ONLINE;
|
|
|
|
return false;
|
|
|
|
}
|
2008-11-04 18:12:53 -05:00
|
|
|
}
|
|
|
|
|
|
|
|
if (ageRecv > FT_TM_DOWNLOAD_TIMEOUT)
|
|
|
|
{
|
|
|
|
info.state = PQIPEER_IDLE;
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* update rate */
|
|
|
|
info.actualRate = info.actualRate * 0.75 + 0.25 * info.lastTransfers;
|
|
|
|
info.lastTransfers = 0;
|
|
|
|
|
|
|
|
/* request at 10% more than actual rate */
|
|
|
|
uint32_t next_req = info.actualRate * 1.1;
|
|
|
|
|
|
|
|
if (next_req > info.desiredRate * 1.1)
|
|
|
|
next_req = info.desiredRate * 1.1;
|
|
|
|
|
|
|
|
if (next_req > FT_TM_MAX_PEER_RATE)
|
|
|
|
next_req = FT_TM_MAX_PEER_RATE;
|
|
|
|
|
|
|
|
if (next_req < FT_TM_MINIMUM_CHUNK)
|
|
|
|
next_req = FT_TM_MINIMUM_CHUNK;
|
|
|
|
|
|
|
|
info.lastTS = ts;
|
|
|
|
|
|
|
|
/* do request */
|
|
|
|
uint64_t req_offset = 0;
|
|
|
|
if (getChunk(req_offset,next_req))
|
|
|
|
{
|
|
|
|
if (next_req > 0)
|
|
|
|
{
|
|
|
|
info.state = PQIPEER_DOWNLOADING;
|
|
|
|
requestData(info.peerId,req_offset,next_req);
|
|
|
|
}
|
|
|
|
else
|
|
|
|
{
|
|
|
|
std::cerr << "transfermodule::Waiting for available data";
|
|
|
|
std::cerr << std::endl;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
else mFlag = 1;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
//interface to client module
|
|
|
|
bool ftTransferModule::locked_recvPeerData(peerInfo &info, uint64_t offset,
|
|
|
|
uint32_t chunk_size, void *data)
|
|
|
|
{
|
2008-11-02 06:38:11 -05:00
|
|
|
#ifdef FT_DEBUG
|
2008-11-04 18:12:53 -05:00
|
|
|
std::cerr << "ftTransferModule::locked_recvPeerData()";
|
|
|
|
std::cerr << " peerId: " << info.peerId;
|
|
|
|
std::cerr << " offset: " << offset;
|
|
|
|
std::cerr << " chunksize: " << chunk_size;
|
|
|
|
std::cerr << " data: " << data;
|
2008-11-02 06:38:11 -05:00
|
|
|
std::cerr << std::endl;
|
|
|
|
#endif
|
2008-09-08 04:44:37 -04:00
|
|
|
|
2008-11-04 18:12:53 -05:00
|
|
|
time_t ts = time(NULL);
|
|
|
|
info.recvTS = ts;
|
2008-11-13 18:03:46 -05:00
|
|
|
info.nResets = 0;
|
2008-11-04 18:12:53 -05:00
|
|
|
info.state = PQIPEER_DOWNLOADING;
|
|
|
|
info.lastTransfers += chunk_size;
|
|
|
|
|
|
|
|
return true;
|
|
|
|
}
|
2008-09-08 04:44:37 -04:00
|
|
|
|