2015-06-29 04:47:11 +02:00
|
|
|
/*
|
|
|
|
|
|
|
|
Copyright (c) 2015, Arvid Norberg
|
|
|
|
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.
|
|
|
|
|
|
|
|
*/
|
|
|
|
|
|
|
|
#ifndef TORRENT_FILE_PROGRESS_HPP_INCLUDE
|
|
|
|
#define TORRENT_FILE_PROGRESS_HPP_INCLUDE
|
|
|
|
|
|
|
|
#include <vector>
|
2016-06-18 20:01:38 +02:00
|
|
|
#include <cstdint>
|
2015-06-29 04:47:11 +02:00
|
|
|
|
2015-07-08 05:46:33 +02:00
|
|
|
#include "libtorrent/export.hpp"
|
2016-12-22 16:42:33 +01:00
|
|
|
#include "libtorrent/units.hpp"
|
|
|
|
#include "libtorrent/aux_/vector.hpp"
|
2015-07-08 05:46:33 +02:00
|
|
|
|
2016-07-02 01:46:59 +02:00
|
|
|
#if TORRENT_USE_INVARIANT_CHECKS
|
2016-06-05 20:06:11 +02:00
|
|
|
#include "libtorrent/bitfield.hpp"
|
|
|
|
#include "libtorrent/invariant_check.hpp"
|
|
|
|
#endif
|
|
|
|
|
2017-01-29 17:00:07 +01:00
|
|
|
#if TORRENT_USE_INVARIANT_CHECKS
|
|
|
|
#include "libtorrent/invariant_check.hpp"
|
|
|
|
#include "libtorrent/bitfield.hpp"
|
|
|
|
#endif
|
|
|
|
|
2015-06-29 04:47:11 +02:00
|
|
|
namespace libtorrent
|
|
|
|
{
|
|
|
|
class piece_picker;
|
|
|
|
class file_storage;
|
|
|
|
class alert_manager;
|
2015-07-31 03:29:22 +02:00
|
|
|
struct torrent_handle;
|
2015-06-29 04:47:11 +02:00
|
|
|
|
|
|
|
namespace aux
|
|
|
|
{
|
2015-07-08 05:46:33 +02:00
|
|
|
struct TORRENT_EXTRA_EXPORT file_progress
|
2015-06-29 04:47:11 +02:00
|
|
|
{
|
|
|
|
file_progress();
|
|
|
|
|
|
|
|
void init(piece_picker const& picker
|
|
|
|
, file_storage const& fs);
|
|
|
|
|
2016-12-22 16:42:33 +01:00
|
|
|
void export_progress(vector<std::int64_t, file_index_t> &fp);
|
2015-06-29 04:47:11 +02:00
|
|
|
|
2016-07-03 20:48:18 +02:00
|
|
|
bool empty() const { return m_file_progress.empty(); }
|
2015-06-29 04:47:11 +02:00
|
|
|
void clear();
|
|
|
|
|
2016-12-22 16:42:33 +01:00
|
|
|
void update(file_storage const& fs, piece_index_t index
|
2015-06-29 04:47:11 +02:00
|
|
|
, alert_manager* alerts, torrent_handle const& h);
|
|
|
|
|
|
|
|
private:
|
|
|
|
|
|
|
|
// this vector contains the number of bytes completely
|
|
|
|
// downloaded (as in passed-hash-check) in each file.
|
|
|
|
// this lets us trigger on individual files completing
|
|
|
|
// the vector is allocated lazily, when file progress
|
|
|
|
// is first queried by the client
|
2016-12-22 16:42:33 +01:00
|
|
|
vector<std::int64_t, file_index_t> m_file_progress;
|
2016-06-05 20:06:11 +02:00
|
|
|
|
2016-07-02 01:46:59 +02:00
|
|
|
#if TORRENT_USE_INVARIANT_CHECKS
|
2016-06-05 20:06:11 +02:00
|
|
|
friend class libtorrent::invariant_access;
|
|
|
|
void check_invariant() const;
|
|
|
|
|
|
|
|
// this is used to assert we never add the same piece twice
|
2016-12-22 16:42:33 +01:00
|
|
|
typed_bitfield<piece_index_t> m_have_pieces;
|
2016-06-05 20:06:11 +02:00
|
|
|
|
|
|
|
// to make sure we never say we've downloaded more bytes of a file than
|
|
|
|
// its file size
|
2016-12-22 16:42:33 +01:00
|
|
|
vector<std::int64_t, file_index_t> m_file_sizes;
|
2016-06-05 20:06:11 +02:00
|
|
|
#endif
|
2015-06-29 04:47:11 +02:00
|
|
|
};
|
|
|
|
} }
|
|
|
|
|
|
|
|
#endif
|