transfer.cpp

   1 /*
   2  *  transfer.cpp
   3  *  some transfer-scope code
   4  *
   5  *  Created by Victor Grishchenko on 10/6/09.
   6  *  Copyright 2009 Delft University of Technology. All rights reserved.
   7  *
   8  */
   9 #include <errno.h>
  10 #include <string>
  11 #include <sstream>
  12 #include "swift.h"
  13
  14 #include "ext/seq_picker.cpp" // FIXME FIXME FIXME FIXME
  15
  16 using namespace swift;
  17
  18 std::vector<FileTransfer*> FileTransfer::files(20);
  19
  20 #define BINHASHSIZE (sizeof(bin64_t)+sizeof(Sha1Hash))
  21
  22 // FIXME: separate Bootstrap() and Download(), then Size(), Progress(), SeqProgress()
  23
  24 FileTransfer::FileTransfer (const char* filename, const Sha1Hash& _root_hash) :
  25     file_(filename,_root_hash), hs_in_offset_(0), cb_installed(0)
  26 {
  27     if (files.size()<fd()+1)
  28         files.resize(fd()+1);
  29     files[fd()] = this;
  30     picker_ = new SeqPiecePicker(this);
  31     picker_->Randomize(rand()&63);
  32     init_time_ = Datagram::Time();
  33 }
  34
  35
  36 void    Channel::CloseTransfer (FileTransfer* trans) {
  37     for(int i=0; i<Channel::channels.size(); i++)
  38         if (Channel::channels[i] && Channel::channels[i]->transfer_==trans)
  39             delete Channel::channels[i];
  40 }
  41
  42
  43 void swift::AddProgressCallback (int transfer,ProgressCallback cb,uint8_t agg) {
  44     FileTransfer* trans = FileTransfer::file(transfer);
  45     if (!trans)
  46         return;
  47     trans->cb_agg[trans->cb_installed] = agg;
  48     trans->callbacks[trans->cb_installed++] = cb;
  49 }
  50
  51
  52 void swift::ExternallyRetrieved (int transfer,bin64_t piece) {
  53     FileTransfer* trans = FileTransfer::file(transfer);
  54     if (!trans)
  55         return;
  56     trans->ack_out().set(piece); // that easy
  57 }
  58
  59
  60 void swift::RemoveProgressCallback (int transfer, ProgressCallback cb) {
  61     FileTransfer* trans = FileTransfer::file(transfer);
  62     if (!trans)
  63         return;
  64     for(int i=0; i<trans->cb_installed; i++)
  65         if (trans->callbacks[i]==cb)
  66             trans->callbacks[i]=trans->callbacks[--trans->cb_installed];
  67 }
  68
  69
  70 FileTransfer::~FileTransfer ()
  71 {
  72     Channel::CloseTransfer(this);
  73     files[fd()] = NULL;
  74     delete picker_;
  75 }
  76
  77
  78 FileTransfer* FileTransfer::Find (const Sha1Hash& root_hash) {
  79     for(int i=0; i<files.size(); i++)
  80         if (files[i] && files[i]->root_hash()==root_hash)
  81             return files[i];
  82     return NULL;
  83 }
  84
  85
  86 int       swift:: Find (Sha1Hash hash) {
  87     FileTransfer* t = FileTransfer::Find(hash);
  88     if (t)
  89         return t->fd();
  90     return -1;
  91 }
  92
  93
  94
  95 void            FileTransfer::OnPexIn (const Address& addr) {
  96     for(int i=0; i<hs_in_.size(); i++) {
  97         Channel* c = Channel::channel(hs_in_[i]);
  98         if (c && c->transfer().fd()==this->fd() && c->peer()==addr)
  99             return; // already connected
 100     }
 101     if (hs_in_.size()<20) {
 102         new Channel(this,Datagram::default_socket(),addr);
 103     } else {
 104         pex_in_.push_back(addr);
 105         if (pex_in_.size()>1000)
 106             pex_in_.pop_front();
 107     }
 108 }
 109
 110
 111 int        FileTransfer::RevealChannel (int& pex_out_) { // FIXME brainfuck
 112     pex_out_ -= hs_in_offset_;
 113     if (pex_out_<0)
 114         pex_out_ = 0;
 115     while (pex_out_<hs_in_.size()) {
 116         Channel* c = Channel::channel(hs_in_[pex_out_]);
 117         if (c && c->transfer().fd()==this->fd()) {
 118             if (c->is_established()) {
 119                 pex_out_ += hs_in_offset_ + 1;
 120                 return c->id();
 121             } else
 122                 pex_out_++;
 123         } else {
 124             hs_in_[pex_out_] = hs_in_[0];
 125             hs_in_.pop_front();
 126             hs_in_offset_++;
 127         }
 128     }
 129     pex_out_ += hs_in_offset_;
 130     return -1;
 131 }
 132