mirror of
https://github.com/ton-blockchain/ton
synced 2025-03-09 15:40:10 +00:00
Recent updates in storage (#667)
* Fix error handling in Torrent.cpp, improve choosing peers for upload * Various improvements in storage daemon "get-pieces-info" Store "added at" Improve calculating up/down speed Improve TL protocol for future compatibility Remove empty directories on "--remove-files" Better windows support Debug logs in PeerActor More restrictions on TorrentInfo Bugfixes * Global speed limits for download and upload +bugfix * Reset download/upload speed on changing settings or completion * Exclude some system files in TorrentCreator
This commit is contained in:
parent
e3af63e6c0
commit
bb21f732fd
21 changed files with 974 additions and 213 deletions
82
storage/SpeedLimiter.cpp
Normal file
82
storage/SpeedLimiter.cpp
Normal file
|
@ -0,0 +1,82 @@
|
|||
/*
|
||||
This file is part of TON Blockchain Library.
|
||||
|
||||
TON Blockchain Library is free software: you can redistribute it and/or modify
|
||||
it under the terms of the GNU Lesser General Public License as published by
|
||||
the Free Software Foundation, either version 2 of the License, or
|
||||
(at your option) any later version.
|
||||
|
||||
TON Blockchain Library 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 Lesser General Public License for more details.
|
||||
|
||||
You should have received a copy of the GNU Lesser General Public License
|
||||
along with TON Blockchain Library. If not, see <http://www.gnu.org/licenses/>.
|
||||
*/
|
||||
|
||||
#include "SpeedLimiter.h"
|
||||
|
||||
namespace ton {
|
||||
|
||||
SpeedLimiter::SpeedLimiter(double max_speed) : max_speed_(max_speed) {
|
||||
}
|
||||
|
||||
void SpeedLimiter::set_max_speed(double max_speed) {
|
||||
max_speed_ = max_speed;
|
||||
auto old_queue = std::move(queue_);
|
||||
unlock_at_ = (queue_.empty() ? td::Timestamp::now() : queue_.front().execute_at_);
|
||||
queue_ = {};
|
||||
while (!old_queue.empty()) {
|
||||
auto &e = old_queue.front();
|
||||
enqueue(e.size_, e.timeout_, std::move(e.promise_));
|
||||
old_queue.pop();
|
||||
}
|
||||
process_queue();
|
||||
}
|
||||
|
||||
void SpeedLimiter::enqueue(double size, td::Timestamp timeout, td::Promise<td::Unit> promise) {
|
||||
if (max_speed_ < 0.0) {
|
||||
promise.set_result(td::Unit());
|
||||
return;
|
||||
}
|
||||
if (max_speed_ == 0.0) {
|
||||
promise.set_error(td::Status::Error("Speed limit is 0"));
|
||||
return;
|
||||
}
|
||||
if (timeout < unlock_at_) {
|
||||
promise.set_error(td::Status::Error("Timeout caused by speed limit"));
|
||||
return;
|
||||
}
|
||||
if (queue_.empty() && unlock_at_.is_in_past()) {
|
||||
unlock_at_ = td::Timestamp::now();
|
||||
promise.set_result(td::Unit());
|
||||
} else {
|
||||
queue_.push({unlock_at_, size, timeout, std::move(promise)});
|
||||
}
|
||||
unlock_at_ = td::Timestamp::in(size / max_speed_, unlock_at_);
|
||||
if (!queue_.empty()) {
|
||||
alarm_timestamp() = queue_.front().execute_at_;
|
||||
}
|
||||
}
|
||||
|
||||
void SpeedLimiter::alarm() {
|
||||
process_queue();
|
||||
}
|
||||
|
||||
void SpeedLimiter::process_queue() {
|
||||
while (!queue_.empty()) {
|
||||
auto &e = queue_.front();
|
||||
if (e.execute_at_.is_in_past()) {
|
||||
e.promise_.set_result(td::Unit());
|
||||
queue_.pop();
|
||||
} else {
|
||||
break;
|
||||
}
|
||||
}
|
||||
if (!queue_.empty()) {
|
||||
alarm_timestamp() = queue_.front().execute_at_;
|
||||
}
|
||||
}
|
||||
|
||||
} // namespace ton
|
Loading…
Add table
Add a link
Reference in a new issue