mirror of
https://github.com/RetroShare/RetroShare.git
synced 2024-10-01 02:35:48 -04:00
9e469d8baf
- suppressed old DwlQueue class - turned mDownloads into a list of pointers to allow easy cross-info update between queue and std::map of downloads - added queue functionality for moving files top/bottom/up/down - added the necessary functions in rsFiles Put back display of exact sizes in FileTransferInfoWidget Suppressed some warnings. **Warning**: this commit requires a make clean. git-svn-id: http://svn.code.sf.net/p/retroshare/code/trunk@2493 b45a01b8-16f6-495d-af2f-9b41ad6348cc
440 lines
10 KiB
C++
440 lines
10 KiB
C++
#include "ftfilecreator.h"
|
|
#include <errno.h>
|
|
#include <stdio.h>
|
|
|
|
/*******
|
|
* #define FILE_DEBUG 1
|
|
******/
|
|
|
|
#define CHUNK_MAX_AGE 20
|
|
|
|
|
|
/***********************************************************
|
|
*
|
|
* ftFileCreator methods
|
|
*
|
|
***********************************************************/
|
|
|
|
ftFileCreator::ftFileCreator(std::string path, uint64_t size, std::string hash)
|
|
: ftFileProvider(path,size,hash), chunkMap(size)
|
|
{
|
|
/*
|
|
* FIXME any inits to do?
|
|
*/
|
|
|
|
#ifdef FILE_DEBUG
|
|
std::cerr << "ftFileCreator()";
|
|
std::cerr << std::endl;
|
|
std::cerr << "\tpath: " << path;
|
|
std::cerr << std::endl;
|
|
std::cerr << "\tsize: " << size;
|
|
std::cerr << std::endl;
|
|
std::cerr << "\thash: " << hash;
|
|
std::cerr << std::endl;
|
|
#endif
|
|
RsStackMutex stack(ftcMutex); /********** STACK LOCKED MTX ******/
|
|
_last_recv_time_t = time(NULL) ;
|
|
}
|
|
|
|
bool ftFileCreator::getFileData(uint64_t offset, uint32_t &chunk_size, void *data)
|
|
{
|
|
// Only send the data if we actually have it.
|
|
//
|
|
bool have_it = false ;
|
|
{
|
|
RsStackMutex stack(ftcMutex); /********** STACK LOCKED MTX ******/
|
|
|
|
have_it = chunkMap.isChunkAvailable(offset, chunk_size) ;
|
|
}
|
|
|
|
if(have_it)
|
|
return ftFileProvider::getFileData(offset, chunk_size, data);
|
|
else
|
|
return false ;
|
|
}
|
|
|
|
time_t ftFileCreator::lastRecvTimeStamp()
|
|
{
|
|
RsStackMutex stack(ftcMutex); /********** STACK LOCKED MTX ******/
|
|
return _last_recv_time_t ;
|
|
}
|
|
|
|
void ftFileCreator::closeFile()
|
|
{
|
|
RsStackMutex stack(ftcMutex); /********** STACK LOCKED MTX ******/
|
|
|
|
if(fd != NULL)
|
|
fclose(fd) ;
|
|
|
|
fd = NULL ;
|
|
}
|
|
|
|
uint64_t ftFileCreator::getRecvd()
|
|
{
|
|
RsStackMutex stack(ftcMutex); /********** STACK LOCKED MTX ******/
|
|
return chunkMap.getTotalReceived() ;
|
|
}
|
|
|
|
bool ftFileCreator::addFileData(uint64_t offset, uint32_t chunk_size, void *data)
|
|
{
|
|
#ifdef FILE_DEBUG
|
|
std::cerr << "ftFileCreator::addFileData(";
|
|
std::cerr << offset;
|
|
std::cerr << ", " << chunk_size;
|
|
std::cerr << ", " << data << ")";
|
|
std::cerr << " this: " << this;
|
|
std::cerr << std::endl;
|
|
#endif
|
|
/* dodgey checking outside of mutex... much check again inside FileAttrs(). */
|
|
/* Check File is open */
|
|
|
|
if (fd == NULL)
|
|
if (!initializeFileAttrs())
|
|
return false;
|
|
|
|
RsStackMutex stack(ftcMutex); /********** STACK LOCKED MTX ******/
|
|
|
|
/*
|
|
* check its at the correct location
|
|
*/
|
|
if (offset + chunk_size > mSize)
|
|
{
|
|
chunk_size = mSize - offset;
|
|
std::cerr <<"Chunk Size greater than total file size, adjusting chunk " << "size " << chunk_size << std::endl;
|
|
|
|
}
|
|
|
|
/*
|
|
* go to the offset of the file
|
|
*/
|
|
if (0 != fseeko64(this->fd, offset, SEEK_SET))
|
|
{
|
|
std::cerr << "ftFileCreator::addFileData() Bad fseek" << std::endl;
|
|
return 0;
|
|
}
|
|
|
|
if (1 != fwrite(data, chunk_size, 1, this->fd))
|
|
{
|
|
std::cerr << "ftFileCreator::addFileData() Bad fwrite" << std::endl;
|
|
std::cerr << "ERRNO: " << errno << std::endl;
|
|
|
|
return 0;
|
|
}
|
|
|
|
#ifdef FILE_DEBUG
|
|
std::cerr << "ftFileCreator::addFileData() added Data...";
|
|
std::cerr << std::endl;
|
|
std::cerr << " pos: " << pos;
|
|
std::cerr << std::endl;
|
|
#endif
|
|
/*
|
|
* Notify ftFileChunker about chunks received
|
|
*/
|
|
locked_notifyReceived(offset,chunk_size);
|
|
|
|
/*
|
|
* FIXME HANDLE COMPLETION HERE - Any better way?
|
|
*/
|
|
|
|
return 1;
|
|
}
|
|
|
|
void ftFileCreator::removeInactiveChunks()
|
|
{
|
|
RsStackMutex stack(ftcMutex); /********** STACK LOCKED MTX ******/
|
|
|
|
#ifdef FILE_DEBUG
|
|
std::cerr << "ftFileCreator::removeInactiveChunks(): looking for old chunks." << std::endl ;
|
|
#endif
|
|
std::vector<ftChunk::ChunkId> to_remove ;
|
|
|
|
chunkMap.removeInactiveChunks(to_remove) ;
|
|
|
|
#ifdef FILE_DEBUG
|
|
if(!to_remove.empty())
|
|
std::cerr << "ftFileCreator::removeInactiveChunks(): removing slice ids: " ;
|
|
#endif
|
|
// This double loop looks costly, but it's called on very few chunks, and not often, so it's ok.
|
|
//
|
|
for(uint32_t i=0;i<to_remove.size();++i)
|
|
{
|
|
#ifdef FILE_DEBUG
|
|
std::cerr << to_remove[i] << " " ;
|
|
#endif
|
|
for(std::map<uint64_t,ftChunk>::iterator it(mChunks.begin());it!=mChunks.end();)
|
|
if(it->second.id == to_remove[i])
|
|
{
|
|
std::map<uint64_t,ftChunk>::iterator tmp(it) ;
|
|
++it ;
|
|
mChunks.erase(tmp) ;
|
|
}
|
|
else
|
|
++it ;
|
|
}
|
|
#ifdef FILE_DEBUG
|
|
if(!to_remove.empty())
|
|
std::cerr << std::endl ;
|
|
#endif
|
|
}
|
|
|
|
int ftFileCreator::initializeFileAttrs()
|
|
{
|
|
#ifdef FILE_DEBUG
|
|
std::cerr << "ftFileCreator::initializeFileAttrs() Filename: " << file_name << " this: " << this << std::endl;
|
|
#endif
|
|
|
|
/*
|
|
* check if the file exists
|
|
* cant use FileProviders verion because that opens readonly.
|
|
*/
|
|
|
|
RsStackMutex stack(ftcMutex); /********** STACK LOCKED MTX ******/
|
|
if (fd)
|
|
return 1;
|
|
|
|
/*
|
|
* check if the file exists
|
|
*/
|
|
|
|
{
|
|
#ifdef FILE_DEBUG
|
|
std::cerr << "ftFileCreator::initializeFileAttrs() trying (r+b) " << file_name << " this: " << this << std::endl;
|
|
#endif
|
|
std::cerr << std::endl;
|
|
}
|
|
|
|
/*
|
|
* attempt to open file
|
|
*/
|
|
|
|
fd = fopen64(file_name.c_str(), "r+b");
|
|
|
|
if (!fd)
|
|
{
|
|
std::cerr << "ftFileCreator::initializeFileAttrs() Failed to open (r+b): ";
|
|
std::cerr << file_name << std::endl;
|
|
|
|
std::cerr << "ftFileCreator::initializeFileAttrs() opening w+b";
|
|
std::cerr << std::endl;
|
|
|
|
/* try opening for write */
|
|
fd = fopen64(file_name.c_str(), "w+b");
|
|
if (!fd)
|
|
{
|
|
std::cerr << "ftFileCreator::initializeFileAttrs()";
|
|
std::cerr << " Failed to open (w+b): "<< file_name << std::endl;
|
|
return 0;
|
|
}
|
|
}
|
|
|
|
|
|
|
|
|
|
/*
|
|
* if it opened, find it's length
|
|
* move to the end
|
|
*/
|
|
|
|
// if (0 != fseeko64(fd, 0L, SEEK_END))
|
|
// {
|
|
// std::cerr << "ftFileCreator::initializeFileAttrs() Seek Failed" << std::endl;
|
|
// return 0;
|
|
// }
|
|
|
|
#ifdef FILE_DEBUG
|
|
std::cerr << "ftFileCreator::initializeFileAttrs() File Expected Size: " << mSize << " RecvdSize: " << recvdsize << std::endl;
|
|
#endif
|
|
|
|
return 1;
|
|
}
|
|
ftFileCreator::~ftFileCreator()
|
|
{
|
|
/*
|
|
* FIXME Any cleanups specific to filecreator?
|
|
*/
|
|
}
|
|
|
|
|
|
int ftFileCreator::locked_notifyReceived(uint64_t offset, uint32_t chunk_size)
|
|
{
|
|
/* ALREADY LOCKED */
|
|
#ifdef FILE_DEBUG
|
|
std::cerr << "ftFileCreator::locked_notifyReceived( " << offset;
|
|
std::cerr << ", " << chunk_size << " )";
|
|
std::cerr << " this: " << this;
|
|
std::cerr << std::endl;
|
|
#endif
|
|
|
|
/* find the chunk */
|
|
std::map<uint64_t, ftChunk>::iterator it = mChunks.find(offset);
|
|
|
|
if (it == mChunks.end())
|
|
{
|
|
#ifdef FILE_DEBUG
|
|
std::cerr << "ftFileCreator::locked_notifyReceived() ";
|
|
std::cerr << " Failed to match to existing chunk - ignoring";
|
|
std::cerr << std::endl;
|
|
|
|
locked_printChunkMap();
|
|
#endif
|
|
return 0; /* ignoring */
|
|
}
|
|
|
|
ftChunk chunk = it->second;
|
|
mChunks.erase(it);
|
|
|
|
if (chunk.size != chunk_size)
|
|
{
|
|
/* partial : shrink chunk */
|
|
chunk.size -= chunk_size;
|
|
chunk.offset += chunk_size;
|
|
mChunks[chunk.offset] = chunk;
|
|
}
|
|
else // notify the chunkmap that the slice is finished
|
|
chunkMap.dataReceived(chunk.id) ;
|
|
|
|
_last_recv_time_t = time(NULL) ;
|
|
|
|
/* otherwise there is another earlier block to go
|
|
*/
|
|
|
|
return 1;
|
|
}
|
|
|
|
FileChunksInfo::ChunkStrategy ftFileCreator::getChunkStrategy()
|
|
{
|
|
RsStackMutex stack(ftcMutex); /********** STACK LOCKED MTX ******/
|
|
|
|
return chunkMap.getStrategy() ;
|
|
}
|
|
void ftFileCreator::setChunkStrategy(FileChunksInfo::ChunkStrategy s)
|
|
{
|
|
RsStackMutex stack(ftcMutex); /********** STACK LOCKED MTX ******/
|
|
|
|
#ifdef FILE_DEBUG
|
|
std::cerr << "ftFileCtreator: setting chunk strategy to " << s << std::endl ;
|
|
#endif
|
|
chunkMap.setStrategy(s) ;
|
|
}
|
|
|
|
/* Returns true if more to get
|
|
* But can return size = 0, if we are still waiting for the data.
|
|
*/
|
|
|
|
bool ftFileCreator::getMissingChunk(const std::string& peer_id,uint32_t size_hint,uint64_t &offset, uint32_t& size,bool& source_chunk_map_needed)
|
|
{
|
|
RsStackMutex stack(ftcMutex); /********** STACK LOCKED MTX ******/
|
|
#ifdef FILE_DEBUG
|
|
std::cerr << "ffc::getMissingChunk(...,"<< size_hint << ")";
|
|
std::cerr << " this: " << this;
|
|
std::cerr << std::endl;
|
|
locked_printChunkMap();
|
|
#endif
|
|
source_chunk_map_needed = false ;
|
|
|
|
/* check for freed chunks */
|
|
time_t ts = time(NULL);
|
|
time_t old = ts-CHUNK_MAX_AGE;
|
|
|
|
std::map<uint64_t, ftChunk>::iterator it;
|
|
for(it = mChunks.begin(); it != mChunks.end(); it++)
|
|
{
|
|
/* very simple algorithm */
|
|
if (it->second.ts < old)
|
|
{
|
|
#ifdef FILE_DEBUG
|
|
std::cerr << "ffc::getMissingChunk() Re-asking for an old chunk";
|
|
std::cerr << std::endl;
|
|
#endif
|
|
|
|
/* retry this one */
|
|
it->second.ts = ts;
|
|
size = it->second.size;
|
|
offset = it->second.offset;
|
|
|
|
return true;
|
|
}
|
|
}
|
|
|
|
/* else allocate a new chunk */
|
|
|
|
ftChunk chunk ;
|
|
|
|
if(!chunkMap.getDataChunk(peer_id,size_hint,chunk,source_chunk_map_needed))
|
|
return false ;
|
|
|
|
#ifdef FILE_DEBUG
|
|
std::cerr << "ffc::getMissingChunk() Retrieved new chunk: " << chunk << std::endl ;
|
|
#endif
|
|
|
|
mChunks[chunk.offset] = chunk ;
|
|
|
|
offset = chunk.offset ;
|
|
size = chunk.size ;
|
|
|
|
return true; /* cos more data to get */
|
|
}
|
|
|
|
void ftFileCreator::getChunkMap(FileChunksInfo& info)
|
|
{
|
|
RsStackMutex stack(ftcMutex); /********** STACK LOCKED MTX ******/
|
|
|
|
chunkMap.getChunksInfo(info) ;
|
|
}
|
|
|
|
bool ftFileCreator::locked_printChunkMap()
|
|
{
|
|
#ifdef FILE_DEBUG
|
|
std::cerr << "ftFileCreator::locked_printChunkMap()";
|
|
std::cerr << " this: " << this;
|
|
std::cerr << std::endl;
|
|
#endif
|
|
|
|
/* check start point */
|
|
std::cerr << "\tOutstanding Chunks:";
|
|
std::cerr << std::endl;
|
|
|
|
std::map<uint64_t, ftChunk>::iterator it;
|
|
|
|
for(it = mChunks.begin(); it != mChunks.end(); it++)
|
|
std::cerr << " " << it->second << std::endl ;
|
|
|
|
return true;
|
|
}
|
|
|
|
void ftFileCreator::setAvailabilityMap(const CompressedChunkMap& cmap)
|
|
{
|
|
RsStackMutex stack(ftcMutex); /********** STACK LOCKED MTX ******/
|
|
|
|
chunkMap.setAvailabilityMap(cmap) ;
|
|
}
|
|
|
|
void ftFileCreator::getAvailabilityMap(CompressedChunkMap& map)
|
|
{
|
|
RsStackMutex stack(ftcMutex); /********** STACK LOCKED MTX ******/
|
|
|
|
chunkMap.getAvailabilityMap(map) ;
|
|
}
|
|
|
|
void ftFileCreator::setSourceMap(const std::string& peer_id,const CompressedChunkMap& compressed_map)
|
|
{
|
|
RsStackMutex stack(ftcMutex); /********** STACK LOCKED MTX ******/
|
|
|
|
// At this point, we should cancel all file chunks that are asked to the
|
|
// peer and which this peer actually doesn't possesses. Otherwise, the transfer may get stuck.
|
|
// This should be done by:
|
|
// - first setting the peer availability map
|
|
// - then asking the chunkmap which chunks are being downloaded, but actually shouldn't
|
|
// - cancelling them in the ftFileCreator, so that they can be re-asked later to another peer.
|
|
//
|
|
chunkMap.setPeerAvailabilityMap(peer_id,compressed_map) ;
|
|
}
|
|
|
|
bool ftFileCreator::finished()
|
|
{
|
|
RsStackMutex stack(ftcMutex); /********** STACK LOCKED MTX ******/
|
|
|
|
return chunkMap.isComplete() ;
|
|
}
|
|
|