forked from premiere/premiere-libtorrent
67 lines
2.4 KiB
C++
67 lines
2.4 KiB
C++
|
/*
|
||
|
|
||
|
Copyright (c) 2003-2016, Arvid Norberg, Daniel Wallin
|
||
|
All rights reserved.
|
||
|
|
||
|
Redistribution and use in source and binary forms, with or without
|
||
|
modification, are permitted provided that the following conditions
|
||
|
are met:
|
||
|
|
||
|
* Redistributions of source code must retain the above copyright
|
||
|
notice, this list of conditions and the following disclaimer.
|
||
|
* Redistributions in binary form must reproduce the above copyright
|
||
|
notice, this list of conditions and the following disclaimer in
|
||
|
the documentation and/or other materials provided with the distribution.
|
||
|
* Neither the name of the author nor the names of its
|
||
|
contributors may be used to endorse or promote products derived
|
||
|
from this software without specific prior written permission.
|
||
|
|
||
|
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
|
||
|
AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
|
||
|
IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
|
||
|
ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
|
||
|
LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
|
||
|
CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
|
||
|
SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
|
||
|
INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
|
||
|
CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
|
||
|
ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
|
||
|
POSSIBILITY OF SUCH DAMAGE.
|
||
|
|
||
|
*/
|
||
|
|
||
|
#include "libtorrent/aux_/storage_piece_set.hpp"
|
||
|
#include "libtorrent/assert.hpp"
|
||
|
#include "libtorrent/block_cache.hpp"
|
||
|
#include "libtorrent/storage.hpp" // for storage_interface
|
||
|
|
||
|
namespace libtorrent { namespace aux
|
||
|
{
|
||
|
void storage_piece_set::add_piece(cached_piece_entry* p)
|
||
|
{
|
||
|
TORRENT_ASSERT(p->in_storage == false);
|
||
|
TORRENT_ASSERT(p->storage.get() == this);
|
||
|
TORRENT_ASSERT(m_cached_pieces.count(p) == 0);
|
||
|
m_cached_pieces.insert(p);
|
||
|
#if TORRENT_USE_ASSERTS
|
||
|
p->in_storage = true;
|
||
|
#endif
|
||
|
}
|
||
|
|
||
|
bool storage_piece_set::has_piece(cached_piece_entry const* p) const
|
||
|
{
|
||
|
return m_cached_pieces.count(const_cast<cached_piece_entry*>(p)) > 0;
|
||
|
}
|
||
|
|
||
|
void storage_piece_set::remove_piece(cached_piece_entry* p)
|
||
|
{
|
||
|
TORRENT_ASSERT(p->in_storage == true);
|
||
|
TORRENT_ASSERT(m_cached_pieces.count(p) == 1);
|
||
|
m_cached_pieces.erase(p);
|
||
|
#if TORRENT_USE_ASSERTS
|
||
|
p->in_storage = false;
|
||
|
#endif
|
||
|
}
|
||
|
|
||
|
}}
|