mirror of
https://github.com/rakshasa/rtorrent.git
synced 2026-08-09 11:42:33 +00:00
rakshasa
da764db3b9
git-svn-id: svn://rakshasa.no/libtorrent/trunk/rtorrent@348 e378c898-3ddf-0310-93e7-cc216c733640
96 lines
2.5 KiB
C++
96 lines
2.5 KiB
C++
// rTorrent - BitTorrent client
|
|
// Copyright (C) 2005, Jari Sundell
|
|
//
|
|
// 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
|
|
//
|
|
// Contact: Jari Sundell <jaris@ifi.uio.no>
|
|
//
|
|
// Skomakerveien 33
|
|
// 3185 Skoppum, NORWAY
|
|
|
|
#include "config.h"
|
|
|
|
#include <algorithm>
|
|
#include <stdexcept>
|
|
#include <sigc++/bind.h>
|
|
|
|
#include "download.h"
|
|
#include "rak/functional.h"
|
|
#include "hash_queue.h"
|
|
|
|
namespace core {
|
|
|
|
void
|
|
HashQueue::insert(Download* d, Slot s) {
|
|
if (d->get_download().is_hash_checking())
|
|
return;
|
|
|
|
if (std::find_if(begin(), end(), rak::equal(d, std::mem_fun(&HashQueueNode::get_download))) != end())
|
|
throw std::logic_error("core::HashQueue::insert(...) received a Download that is already queued");
|
|
|
|
if (d->get_download().is_hash_checked()) {
|
|
s();
|
|
return;
|
|
}
|
|
|
|
iterator itr = Base::insert(end(), new HashQueueNode(d, s));
|
|
|
|
(*itr)->set_connection(d->get_download().signal_hash_done(sigc::bind(sigc::mem_fun(*this, &HashQueue::receive_hash_done), itr)));
|
|
|
|
fill_queue();
|
|
}
|
|
|
|
void
|
|
HashQueue::remove(Download* d) {
|
|
iterator itr = std::find_if(begin(), end(), rak::equal(d, std::mem_fun(&HashQueueNode::get_download)));
|
|
|
|
if (itr == end())
|
|
return;
|
|
|
|
if ((*itr)->get_download()->get_download().is_hash_checking())
|
|
// What do we do if we're already checking?
|
|
;
|
|
|
|
delete *itr;
|
|
Base::erase(itr);
|
|
|
|
fill_queue();
|
|
}
|
|
|
|
void
|
|
HashQueue::receive_hash_done(Base::iterator itr) {
|
|
Slot s = (*itr)->get_slot();
|
|
|
|
delete *itr;
|
|
Base::erase(itr);
|
|
|
|
s();
|
|
|
|
fill_queue();
|
|
}
|
|
|
|
void
|
|
HashQueue::fill_queue() {
|
|
if (empty() || front()->get_download()->get_download().is_hash_checking())
|
|
return;
|
|
|
|
if (front()->get_download()->get_download().is_hash_checked())
|
|
throw std::logic_error("core::HashQueue::fill_queue() encountered a checked hash");
|
|
|
|
front()->get_download()->get_download().hash_check();
|
|
}
|
|
|
|
}
|