2018-12-31 20:04:05 +01:00
|
|
|
//
|
2024-01-01 01:07:21 +01:00
|
|
|
// Copyright Aliaksei Levin (levlam@telegram.org), Arseny Smirnov (arseny30@gmail.com) 2014-2024
|
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)
|
|
|
|
//
|
|
|
|
#pragma once
|
|
|
|
|
|
|
|
#include "td/utils/ChangesProcessor.h"
|
2019-02-12 21:48:16 +01:00
|
|
|
#include "td/utils/common.h"
|
2018-12-31 20:04:05 +01:00
|
|
|
|
|
|
|
namespace td {
|
2018-10-28 18:30:47 +01:00
|
|
|
|
2018-12-31 20:04:05 +01:00
|
|
|
// It is not about handling gaps.
|
2023-01-15 09:05:53 +01:00
|
|
|
// It is about finding mem processed PTS.
|
2018-12-31 20:04:05 +01:00
|
|
|
// All checks must be done before.
|
|
|
|
|
|
|
|
class PtsManager {
|
|
|
|
public:
|
|
|
|
using PtsId = ChangesProcessor<int32>::Id;
|
|
|
|
void init(int32 pts) {
|
|
|
|
db_pts_ = pts;
|
|
|
|
mem_pts_ = pts;
|
|
|
|
state_helper_.clear();
|
|
|
|
}
|
|
|
|
|
|
|
|
// 0 if not a checkpoint
|
|
|
|
PtsId add_pts(int32 pts) {
|
2020-08-02 00:40:48 +02:00
|
|
|
if (pts > 0) {
|
2018-12-31 20:04:05 +01:00
|
|
|
mem_pts_ = pts;
|
|
|
|
}
|
|
|
|
return state_helper_.add(pts);
|
|
|
|
}
|
|
|
|
|
|
|
|
// return db_pts
|
|
|
|
int32 finish(PtsId pts_id) {
|
|
|
|
state_helper_.finish(pts_id, [&](int32 pts) {
|
|
|
|
if (pts != 0) {
|
|
|
|
db_pts_ = pts;
|
|
|
|
}
|
|
|
|
});
|
|
|
|
return db_pts_;
|
|
|
|
}
|
|
|
|
|
|
|
|
int32 db_pts() const {
|
|
|
|
return db_pts_;
|
|
|
|
}
|
|
|
|
int32 mem_pts() const {
|
|
|
|
return mem_pts_;
|
|
|
|
}
|
|
|
|
|
|
|
|
private:
|
|
|
|
int32 db_pts_ = -1;
|
|
|
|
int32 mem_pts_ = -1;
|
|
|
|
ChangesProcessor<int32> state_helper_;
|
|
|
|
};
|
2018-10-28 18:30:47 +01:00
|
|
|
|
2018-12-31 20:04:05 +01:00
|
|
|
} // namespace td
|