5 * Created by Victor Grishchenko on 3/6/09.
6 * Copyright 2009 Delft University of Technology. All rights reserved.
13 #include <sys/select.h>
16 #include <arpa/inet.h>
22 //#include <glog/logging.h>
27 using namespace swift;
29 swift::tint Channel::last_tick = 0;
30 int Channel::MAX_REORDERING = 4;
31 bool Channel::SELF_CONN_OK = false;
32 swift::tint Channel::TIMEOUT = TINT_SEC*60;
33 std::vector<Channel*> Channel::channels(1);
34 SOCKET Channel::sockets[8] = {0,0,0,0,0,0,0,0};
35 int Channel::socket_count = 0;
36 Address Channel::tracker;
37 tbheap Channel::send_queue;
38 #include "ext/simple_selector.cpp"
39 PeerSelector* Channel::peer_selector = new SimpleSelector();
41 Channel::Channel (FileTransfer* transfer, int socket, Address peer_addr) :
42 transfer_(transfer), peer_(peer_addr), peer_channel_id_(0), pex_out_(0),
43 socket_(socket==-1?sockets[0]:socket), // FIXME
44 data_out_cap_(bin64_t::ALL), last_data_out_time_(0), last_data_in_time_(0),
45 own_id_mentioned_(false), next_send_time_(0), last_send_time_(0),
46 last_recv_time_(0), rtt_avg_(TINT_SEC), dev_avg_(0), dip_avg_(TINT_SEC),
47 data_in_dbl_(bin64_t::NONE), hint_out_size_(0),
48 cwnd_(1), send_interval_(TINT_SEC), send_control_(PING_PONG_CONTROL),
49 sent_since_recv_(0), ack_rcvd_recent_(0), ack_not_rcvd_recent_(0),
50 last_loss_time_(0), owd_min_bin_(0), owd_min_bin_start_(NOW),
51 owd_cur_bin_(0), dgrams_sent_(0), dgrams_rcvd_(0),
52 data_in_(TINT_NEVER,bin64_t::NONE)
56 this->id_ = channels.size();
57 channels.push_back(this);
58 transfer_->hs_in_.push_back(id_);
59 for(int i=0; i<4; i++) {
60 owd_min_bins_[i] = TINT_NEVER;
61 owd_current_[i] = TINT_NEVER;
64 dprintf("%s #%u init %s\n",tintstr(),id_,peer_.str());
68 Channel::~Channel () {
73 void swift::SetTracker(const Address& tracker) {
74 Channel::tracker = tracker;
78 int Channel::DecodeID(int scrambled) {
79 return scrambled ^ (int)Datagram::start;
81 int Channel::EncodeID(int unscrambled) {
82 return unscrambled ^ (int)Datagram::start;
86 int swift::Listen (Address addr) {
87 int sock = Datagram::Bind(addr);
88 if (sock!=INVALID_SOCKET)
89 Channel::sockets[Channel::socket_count++] = sock;
94 void swift::Shutdown (int sock_des) {
95 for(int i=0; i<Channel::socket_count; i++)
96 if (sock_des==-1 || Channel::sockets[i]==sock_des) {
97 Datagram::Close(Channel::sockets[i]);
98 Channel::sockets[i] = Channel::sockets[--Channel::socket_count];
103 void swift::Loop (tint till) {
108 int swift::Open (const char* filename, const Sha1Hash& hash) {
109 FileTransfer* ft = new FileTransfer(filename, hash);
110 if (ft && ft->file().file_descriptor()) {
112 /*if (FileTransfer::files.size()<fdes) // FIXME duplication
113 FileTransfer::files.resize(fdes);
114 FileTransfer::files[fdes] = ft;*/
116 // initiate tracker connections
117 if (Channel::tracker!=Address())
120 return ft->file().file_descriptor();
129 void swift::Close (int fd) {
130 if (fd<FileTransfer::files.size() && FileTransfer::files[fd])
131 delete FileTransfer::files[fd];
135 void swift::AddPeer (Address address, const Sha1Hash& root) {
136 Channel::peer_selector->AddPeer(address,root);
140 uint64_t swift::Size (int fdes) {
141 if (FileTransfer::files.size()>fdes && FileTransfer::files[fdes])
142 return FileTransfer::files[fdes]->file().size();
148 bool swift::IsComplete (int fdes) {
149 if (FileTransfer::files.size()>fdes && FileTransfer::files[fdes])
150 return FileTransfer::files[fdes]->file().is_complete();
156 uint64_t swift::Complete (int fdes) {
157 if (FileTransfer::files.size()>fdes && FileTransfer::files[fdes])
158 return FileTransfer::files[fdes]->file().complete();
164 uint64_t swift::SeqComplete (int fdes) {
165 if (FileTransfer::files.size()>fdes && FileTransfer::files[fdes])
166 return FileTransfer::files[fdes]->file().seq_complete();
172 const Sha1Hash& swift::RootMerkleHash (int file) {
173 FileTransfer* trans = FileTransfer::file(file);
175 return Sha1Hash::ZERO;
176 return trans->file().root_hash();
180 /** <h2> swift handshake </h2>
183 <li> to send a datagram, a channel must be created
184 (channels are cheap and easily recycled)
185 <li> a datagram must contain either the receiving
186 channel id (scrambled) or the root hash