2018-12-31 20:04:05 +01:00
|
|
|
//
|
2018-01-02 14:42:31 +01:00
|
|
|
// Copyright Aliaksei Levin (levlam@telegram.org), Arseny Smirnov (arseny30@gmail.com) 2014-2018
|
2018-12-31 20:04:05 +01:00
|
|
|
//
|
|
|
|
// Distributed under the Boost Software License, Version 1.0. (See accompanying
|
|
|
|
// file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
|
|
|
|
//
|
|
|
|
#include "td/actor/Timeout.h"
|
|
|
|
|
|
|
|
#include "td/utils/Time.h"
|
|
|
|
|
|
|
|
namespace td {
|
|
|
|
|
|
|
|
bool MultiTimeout::has_timeout(int64 key) const {
|
|
|
|
return items_.find(Item(key)) != items_.end();
|
|
|
|
}
|
|
|
|
|
|
|
|
void MultiTimeout::set_timeout_at(int64 key, double timeout) {
|
|
|
|
LOG(DEBUG) << "Set timeout for " << key << " in " << timeout - Time::now();
|
|
|
|
auto item = items_.emplace(key);
|
|
|
|
auto heap_node = static_cast<HeapNode *>(const_cast<Item *>(&*item.first));
|
|
|
|
if (heap_node->in_heap()) {
|
|
|
|
CHECK(!item.second);
|
|
|
|
bool need_update_timeout = heap_node->is_top();
|
|
|
|
timeout_queue_.fix(timeout, heap_node);
|
|
|
|
if (need_update_timeout || heap_node->is_top()) {
|
|
|
|
update_timeout();
|
|
|
|
}
|
|
|
|
} else {
|
|
|
|
CHECK(item.second);
|
|
|
|
timeout_queue_.insert(timeout, heap_node);
|
|
|
|
if (heap_node->is_top()) {
|
|
|
|
update_timeout();
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
void MultiTimeout::add_timeout_at(int64 key, double timeout) {
|
|
|
|
LOG(DEBUG) << "Add timeout for " << key << " in " << timeout - Time::now();
|
|
|
|
auto item = items_.emplace(key);
|
|
|
|
auto heap_node = static_cast<HeapNode *>(const_cast<Item *>(&*item.first));
|
|
|
|
if (heap_node->in_heap()) {
|
|
|
|
CHECK(!item.second);
|
|
|
|
} else {
|
|
|
|
CHECK(item.second);
|
|
|
|
timeout_queue_.insert(timeout, heap_node);
|
|
|
|
if (heap_node->is_top()) {
|
|
|
|
update_timeout();
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
void MultiTimeout::cancel_timeout(int64 key) {
|
|
|
|
LOG(DEBUG) << "Cancel timeout for " << key;
|
|
|
|
auto item = items_.find(Item(key));
|
|
|
|
if (item != items_.end()) {
|
|
|
|
auto heap_node = static_cast<HeapNode *>(const_cast<Item *>(&*item));
|
|
|
|
CHECK(heap_node->in_heap());
|
|
|
|
bool need_update_timeout = heap_node->is_top();
|
|
|
|
timeout_queue_.erase(heap_node);
|
|
|
|
items_.erase(item);
|
|
|
|
|
|
|
|
if (need_update_timeout) {
|
|
|
|
update_timeout();
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
void MultiTimeout::update_timeout() {
|
|
|
|
if (items_.empty()) {
|
|
|
|
LOG(DEBUG) << "Cancel timeout";
|
|
|
|
CHECK(timeout_queue_.empty());
|
|
|
|
CHECK(Actor::has_timeout());
|
|
|
|
Actor::cancel_timeout();
|
|
|
|
} else {
|
|
|
|
LOG(DEBUG) << "Set timeout in " << timeout_queue_.top_key() - Time::now_cached();
|
|
|
|
Actor::set_timeout_at(timeout_queue_.top_key());
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2018-11-27 02:10:52 +01:00
|
|
|
vector<int64> MultiTimeout::get_expired_keys(double now) {
|
|
|
|
vector<int64> expired_keys;
|
2018-12-31 20:04:05 +01:00
|
|
|
while (!timeout_queue_.empty() && timeout_queue_.top_key() < now) {
|
|
|
|
int64 key = static_cast<Item *>(timeout_queue_.pop())->key;
|
|
|
|
items_.erase(Item(key));
|
2018-11-27 02:10:52 +01:00
|
|
|
expired_keys.push_back(key);
|
2018-12-31 20:04:05 +01:00
|
|
|
}
|
2018-11-27 02:10:52 +01:00
|
|
|
return expired_keys;
|
|
|
|
}
|
|
|
|
|
|
|
|
void MultiTimeout::timeout_expired() {
|
|
|
|
vector<int64> expired_keys = get_expired_keys(Time::now_cached());
|
2018-12-31 20:04:05 +01:00
|
|
|
if (!items_.empty()) {
|
|
|
|
update_timeout();
|
|
|
|
}
|
2018-11-27 02:10:52 +01:00
|
|
|
for (auto key : expired_keys) {
|
|
|
|
callback_(data_, key);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
void MultiTimeout::run_all() {
|
|
|
|
vector<int64> expired_keys = get_expired_keys(Time::now_cached() + 1e10);
|
|
|
|
if (!expired_keys.empty()) {
|
|
|
|
update_timeout();
|
|
|
|
}
|
|
|
|
for (auto key : expired_keys) {
|
2018-01-29 12:25:29 +01:00
|
|
|
callback_(data_, key);
|
|
|
|
}
|
2018-12-31 20:04:05 +01:00
|
|
|
}
|
|
|
|
|
|
|
|
} // namespace td
|