tdlight/td/telegram/OrderedMessage.cpp

422 lines
14 KiB
C++
Raw Normal View History

//
// Copyright Aliaksei Levin (levlam@telegram.org), Arseny Smirnov (arseny30@gmail.com) 2014-2023
//
// 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/telegram/OrderedMessage.h"
#include "td/utils/logging.h"
namespace td {
void OrderedMessages::insert(MessageId message_id, bool auto_attach, MessageId old_last_message_id,
const char *source) {
2023-05-11 19:31:09 +02:00
auto random_y = static_cast<int32>(static_cast<uint32>(message_id.get() * 2101234567u));
unique_ptr<OrderedMessage> *v = &messages_;
while (*v != nullptr && (*v)->random_y_ >= random_y) {
if ((*v)->message_id_.get() < message_id.get()) {
v = &(*v)->right_;
} else if ((*v)->message_id_ == message_id) {
UNREACHABLE();
} else {
v = &(*v)->left_;
}
}
auto message = make_unique<OrderedMessage>();
message->message_id_ = message_id;
message->random_y_ = random_y;
2023-05-03 11:29:41 +02:00
if (auto_attach) {
auto attach_info = auto_attach_message(message_id, old_last_message_id, source);
2023-05-11 19:31:09 +02:00
message->have_previous_ = attach_info.have_previous_;
message->have_next_ = attach_info.have_next_;
} else {
auto it = get_iterator(message_id);
if (*it != nullptr && (*it)->have_next_) {
// need to drop the connection between messages
auto previous_message = *it;
CHECK(previous_message->message_id_ < message_id);
++it;
auto next_message = *it;
CHECK(next_message != nullptr);
CHECK(next_message->message_id_ > message_id);
next_message->have_previous_ = false;
previous_message->have_next_ = false;
}
}
2023-05-02 22:27:37 +02:00
unique_ptr<OrderedMessage> *left = &message->left_;
unique_ptr<OrderedMessage> *right = &message->right_;
unique_ptr<OrderedMessage> cur = std::move(*v);
while (cur != nullptr) {
2023-05-02 22:27:37 +02:00
if (cur->message_id_.get() < message_id.get()) {
*left = std::move(cur);
2023-05-02 22:27:37 +02:00
left = &((*left)->right_);
cur = std::move(*left);
} else {
*right = std::move(cur);
2023-05-02 22:27:37 +02:00
right = &((*right)->left_);
cur = std::move(*right);
}
}
CHECK(*left == nullptr);
CHECK(*right == nullptr);
*v = std::move(message);
}
2023-05-03 00:34:58 +02:00
void OrderedMessages::erase(MessageId message_id, bool only_from_memory) {
2023-05-02 17:04:54 +02:00
unique_ptr<OrderedMessage> *v = &messages_;
while (*v != nullptr) {
2023-05-02 22:27:37 +02:00
if ((*v)->message_id_.get() < message_id.get()) {
v = &(*v)->right_;
} else if ((*v)->message_id_.get() > message_id.get()) {
v = &(*v)->left_;
} else {
break;
}
}
2023-05-03 00:34:58 +02:00
CHECK(*v != nullptr);
if ((*v)->have_previous_ && (only_from_memory || !(*v)->have_next_)) {
auto it = get_iterator(message_id);
2023-05-03 00:34:58 +02:00
CHECK(*it == v->get());
--it;
OrderedMessage *prev_m = *it;
CHECK(prev_m != nullptr);
prev_m->have_next_ = false;
}
if ((*v)->have_next_ && (only_from_memory || !(*v)->have_previous_)) {
auto it = get_iterator(message_id);
2023-05-03 00:34:58 +02:00
CHECK(*it == v->get());
++it;
OrderedMessage *next_m = *it;
CHECK(next_m != nullptr);
next_m->have_previous_ = false;
}
unique_ptr<OrderedMessage> result = std::move(*v);
2023-05-02 22:27:37 +02:00
unique_ptr<OrderedMessage> left = std::move(result->left_);
unique_ptr<OrderedMessage> right = std::move(result->right_);
while (left != nullptr || right != nullptr) {
2023-05-02 22:27:37 +02:00
if (left == nullptr || (right != nullptr && right->random_y_ > left->random_y_)) {
*v = std::move(right);
2023-05-02 22:27:37 +02:00
v = &((*v)->left_);
right = std::move(*v);
} else {
*v = std::move(left);
2023-05-02 22:27:37 +02:00
v = &((*v)->right_);
left = std::move(*v);
}
}
CHECK(*v == nullptr);
}
void OrderedMessages::attach_message_to_previous(MessageId message_id, const char *source) {
CHECK(message_id.is_valid());
auto it = get_iterator(message_id);
OrderedMessage *ordered_message = *it;
CHECK(ordered_message != nullptr);
2023-05-02 22:27:37 +02:00
CHECK(ordered_message->message_id_ == message_id);
if (ordered_message->have_previous_) {
return;
}
2023-05-02 22:27:37 +02:00
ordered_message->have_previous_ = true;
--it;
LOG_CHECK(*it != nullptr) << message_id << ' ' << source;
2023-05-02 22:27:37 +02:00
LOG(INFO) << "Attach " << message_id << " to the previous " << (*it)->message_id_ << " from " << source;
if ((*it)->have_next_) {
ordered_message->have_next_ = true;
} else {
2023-05-02 22:27:37 +02:00
(*it)->have_next_ = true;
}
}
void OrderedMessages::attach_message_to_next(MessageId message_id, const char *source) {
CHECK(message_id.is_valid());
auto it = get_iterator(message_id);
OrderedMessage *ordered_message = *it;
CHECK(ordered_message != nullptr);
2023-05-02 22:27:37 +02:00
CHECK(ordered_message->message_id_ == message_id);
if (ordered_message->have_next_) {
return;
}
2023-05-02 22:27:37 +02:00
ordered_message->have_next_ = true;
++it;
LOG_CHECK(*it != nullptr) << message_id << ' ' << source;
2023-05-02 22:27:37 +02:00
LOG(INFO) << "Attach " << message_id << " to the next " << (*it)->message_id_ << " from " << source;
if ((*it)->have_previous_) {
ordered_message->have_previous_ = true;
} else {
2023-05-02 22:27:37 +02:00
(*it)->have_previous_ = true;
}
}
OrderedMessages::AttachInfo OrderedMessages::auto_attach_message(MessageId message_id, MessageId last_message_id,
const char *source) {
auto it = get_iterator(message_id);
OrderedMessage *previous_message = *it;
if (previous_message != nullptr) {
2023-05-02 22:27:37 +02:00
auto previous_message_id = previous_message->message_id_;
CHECK(previous_message_id < message_id);
2023-05-02 22:27:37 +02:00
if (previous_message->have_next_ || (last_message_id.is_valid() && previous_message_id >= last_message_id)) {
if (message_id.is_server() && previous_message_id.is_server() && previous_message->have_next_) {
++it;
auto next_message = *it;
2023-05-03 11:22:47 +02:00
CHECK(next_message != nullptr);
if (next_message->message_id_.is_server()) {
LOG(ERROR) << "Attach " << message_id << " before " << next_message->message_id_ << " and after "
2023-05-03 11:29:41 +02:00
<< previous_message_id << " from " << source;
}
}
2023-05-03 11:29:41 +02:00
LOG(INFO) << "Attach " << message_id << " to the previous " << previous_message_id << " from " << source;
2023-05-02 22:27:37 +02:00
auto have_next = previous_message->have_next_;
previous_message->have_next_ = true;
return {true, have_next};
}
}
if (!message_id.is_yet_unsent()) {
// message may be attached to the next message if there is no previous message
OrderedMessage *cur = messages_.get();
OrderedMessage *next_message = nullptr;
while (cur != nullptr) {
2023-05-02 22:27:37 +02:00
if (cur->message_id_ < message_id) {
cur = cur->right_.get();
} else {
next_message = cur;
2023-05-02 22:27:37 +02:00
cur = cur->left_.get();
}
}
if (next_message != nullptr) {
2023-05-02 22:27:37 +02:00
CHECK(!next_message->have_previous_);
2023-05-03 11:29:41 +02:00
LOG(INFO) << "Attach " << message_id << " to the next " << next_message->message_id_ << " from " << source;
2023-05-02 22:27:37 +02:00
auto have_previous = next_message->have_previous_;
return {have_previous, true};
}
}
2023-05-03 11:29:41 +02:00
LOG(INFO) << "Can't auto-attach " << message_id << " from " << source;
return {false, false};
}
void OrderedMessages::do_find_older_messages(const OrderedMessage *ordered_message, MessageId max_message_id,
vector<MessageId> &message_ids) {
if (ordered_message == nullptr) {
return;
}
2023-05-02 22:27:37 +02:00
do_find_older_messages(ordered_message->left_.get(), max_message_id, message_ids);
2023-05-02 22:27:37 +02:00
if (ordered_message->message_id_ <= max_message_id) {
message_ids.push_back(ordered_message->message_id_);
2023-05-02 22:27:37 +02:00
do_find_older_messages(ordered_message->right_.get(), max_message_id, message_ids);
}
}
vector<MessageId> OrderedMessages::find_older_messages(MessageId max_message_id) const {
vector<MessageId> message_ids;
do_find_older_messages(messages_.get(), max_message_id, message_ids);
return message_ids;
}
void OrderedMessages::do_find_newer_messages(const OrderedMessage *ordered_message, MessageId min_message_id,
vector<MessageId> &message_ids) {
if (ordered_message == nullptr) {
return;
}
2023-05-02 22:27:37 +02:00
if (ordered_message->message_id_ > min_message_id) {
do_find_newer_messages(ordered_message->left_.get(), min_message_id, message_ids);
2023-05-02 22:27:37 +02:00
message_ids.push_back(ordered_message->message_id_);
}
2023-05-02 22:27:37 +02:00
do_find_newer_messages(ordered_message->right_.get(), min_message_id, message_ids);
}
vector<MessageId> OrderedMessages::find_newer_messages(MessageId min_message_id) const {
vector<MessageId> message_ids;
do_find_newer_messages(messages_.get(), min_message_id, message_ids);
return message_ids;
}
MessageId OrderedMessages::do_find_message_by_date(const OrderedMessage *ordered_message, int32 date,
const std::function<int32(MessageId)> &get_message_date) {
if (ordered_message == nullptr) {
return MessageId();
}
2023-05-02 22:27:37 +02:00
auto message_date = get_message_date(ordered_message->message_id_);
if (message_date > date) {
2023-05-02 22:27:37 +02:00
return do_find_message_by_date(ordered_message->left_.get(), date, get_message_date);
}
2023-05-02 22:27:37 +02:00
auto message_id = do_find_message_by_date(ordered_message->right_.get(), date, get_message_date);
if (message_id.is_valid()) {
return message_id;
}
2023-05-02 22:27:37 +02:00
return ordered_message->message_id_;
}
MessageId OrderedMessages::find_message_by_date(int32 date,
const std::function<int32(MessageId)> &get_message_date) const {
return do_find_message_by_date(messages_.get(), date, get_message_date);
}
void OrderedMessages::do_find_messages_by_date(const OrderedMessage *ordered_message, int32 min_date, int32 max_date,
const std::function<int32(MessageId)> &get_message_date,
vector<MessageId> &message_ids) {
if (ordered_message == nullptr) {
return;
}
2023-05-02 22:27:37 +02:00
auto message_date = get_message_date(ordered_message->message_id_);
if (message_date >= min_date) {
2023-05-02 22:27:37 +02:00
do_find_messages_by_date(ordered_message->left_.get(), min_date, max_date, get_message_date, message_ids);
if (message_date <= max_date) {
2023-05-02 22:27:37 +02:00
message_ids.push_back(ordered_message->message_id_);
}
}
if (message_date <= max_date) {
2023-05-02 22:27:37 +02:00
do_find_messages_by_date(ordered_message->right_.get(), min_date, max_date, get_message_date, message_ids);
}
}
vector<MessageId> OrderedMessages::find_messages_by_date(
int32 min_date, int32 max_date, const std::function<int32(MessageId)> &get_message_date) const {
vector<MessageId> message_ids;
do_find_messages_by_date(messages_.get(), min_date, max_date, get_message_date, message_ids);
return message_ids;
}
void OrderedMessages::do_traverse_messages(const OrderedMessage *ordered_message,
const std::function<bool(MessageId)> &need_scan_older,
const std::function<bool(MessageId)> &need_scan_newer) {
if (ordered_message == nullptr) {
return;
}
2023-05-02 22:27:37 +02:00
if (need_scan_older(ordered_message->message_id_)) {
do_traverse_messages(ordered_message->left_.get(), need_scan_older, need_scan_newer);
}
2023-05-02 22:27:37 +02:00
if (need_scan_newer(ordered_message->message_id_)) {
do_traverse_messages(ordered_message->right_.get(), need_scan_older, need_scan_newer);
}
}
void OrderedMessages::traverse_messages(const std::function<bool(MessageId)> &need_scan_older,
const std::function<bool(MessageId)> &need_scan_newer) const {
do_traverse_messages(messages_.get(), need_scan_older, need_scan_newer);
}
2023-05-05 15:03:03 +02:00
vector<MessageId> OrderedMessages::get_history(MessageId last_message_id, MessageId &from_message_id, int32 &offset,
int32 &limit, bool force) const {
CHECK(limit > 0);
bool is_limit_increased = false;
if (limit == -offset) {
limit++;
is_limit_increased = true;
}
2023-05-05 15:03:03 +02:00
CHECK(-limit < offset && offset <= 0);
auto it = get_const_iterator(from_message_id);
LOG(DEBUG) << "Iterator points to " << (*it ? (*it)->get_message_id() : MessageId());
bool from_the_end =
(last_message_id != MessageId() && from_message_id > last_message_id) || from_message_id >= MessageId::max();
if (from_the_end) {
limit += offset;
offset = 0;
if (last_message_id == MessageId()) {
it.clear();
}
} else {
bool have_a_gap = false;
if (*it == nullptr) {
// there is no gap if from_message_id is less than the first message
if (force && offset < 0 && messages_ != nullptr) {
MessageId min_message_id;
traverse_messages(
[&](MessageId message_id) {
min_message_id = message_id;
return true;
},
[](MessageId) { return false; });
CHECK(min_message_id > from_message_id);
from_message_id = min_message_id;
it = get_const_iterator(from_message_id);
CHECK(*it != nullptr);
} else {
have_a_gap = true;
}
} else if ((*it)->message_id_ != from_message_id) {
CHECK((*it)->message_id_ < from_message_id);
if (!(*it)->have_next_ && (last_message_id == MessageId() || (*it)->message_id_ < last_message_id)) {
have_a_gap = true;
}
}
if (have_a_gap) {
LOG(DEBUG) << "Have a gap near message to get message history from";
it.clear();
}
if (*it != nullptr && (*it)->message_id_ == from_message_id) {
if (offset < 0) {
offset++;
} else {
--it;
}
}
while (*it != nullptr && offset < 0) {
++it;
if (*it) {
++offset;
from_message_id = (*it)->message_id_;
}
}
if (offset < 0 &&
((last_message_id != MessageId() && from_message_id >= last_message_id) || (!have_a_gap && force))) {
CHECK(!have_a_gap);
limit += offset;
offset = 0;
it = get_const_iterator(from_message_id);
}
if (!have_a_gap && offset < 0) {
offset--;
}
}
LOG(INFO) << "Iterator after applying offset points to " << (*it ? (*it)->message_id_ : MessageId())
<< ", offset = " << offset << ", limit = " << limit << ", from_the_end = " << from_the_end;
vector<MessageId> message_ids;
if (*it != nullptr && offset == 0) {
while (*it != nullptr && message_ids.size() < static_cast<size_t>(limit)) {
from_message_id = (*it)->message_id_;
message_ids.push_back(from_message_id);
from_the_end = false;
--it;
}
}
if (from_the_end) {
from_message_id = MessageId();
}
if (is_limit_increased && static_cast<size_t>(limit) == message_ids.size()) {
message_ids.pop_back();
}
2023-05-05 15:03:03 +02:00
return message_ids;
}
} // namespace td