mirror of
https://github.com/scylladb/scylladb.git
synced 2026-04-29 04:37:00 +00:00
74 lines
2.1 KiB
C++
74 lines
2.1 KiB
C++
/*
|
|
* Copyright (C) 2018-present ScyllaDB
|
|
*/
|
|
|
|
/*
|
|
* This file is part of Scylla.
|
|
*
|
|
* Scylla is free software: you can redistribute it and/or modify
|
|
* it under the terms of the GNU Affero General Public License as published by
|
|
* the Free Software Foundation, either version 3 of the License, or
|
|
* (at your option) any later version.
|
|
*
|
|
* Scylla 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 General Public License for more details.
|
|
*
|
|
* You should have received a copy of the GNU General Public License
|
|
* along with Scylla. If not, see <http://www.gnu.org/licenses/>.
|
|
*/
|
|
|
|
#pragma once
|
|
|
|
#include <cstddef>
|
|
#include <limits>
|
|
|
|
namespace db::view {
|
|
|
|
/**
|
|
* The view update backlog represents the pending view data that a base replica
|
|
* maintains. It is the maximum of the memory backlog - how much memory pending
|
|
* view updates are consuming out of the their allocated quota - and the disk
|
|
* backlog - how much view hints are consuming. The size of a backlog is relative
|
|
* to its maximum size.
|
|
*/
|
|
struct update_backlog {
|
|
size_t current;
|
|
size_t max;
|
|
|
|
float relative_size() const {
|
|
return float(current) / float(max);
|
|
}
|
|
|
|
friend bool operator==(const update_backlog& lhs, const update_backlog& rhs) {
|
|
return lhs.relative_size() == rhs.relative_size();
|
|
}
|
|
|
|
friend bool operator<(const update_backlog& lhs, const update_backlog& rhs) {
|
|
return lhs.relative_size() < rhs.relative_size();
|
|
}
|
|
|
|
friend bool operator!=(const update_backlog& lhs, const update_backlog& rhs) {
|
|
return !(lhs == rhs);
|
|
}
|
|
|
|
friend bool operator<=(const update_backlog& lhs, const update_backlog& rhs) {
|
|
return !(rhs < lhs);
|
|
}
|
|
|
|
friend bool operator>(const update_backlog& lhs, const update_backlog& rhs) {
|
|
return rhs < lhs;
|
|
}
|
|
|
|
friend bool operator>=(const update_backlog& lhs, const update_backlog& rhs) {
|
|
return !(lhs < rhs);
|
|
}
|
|
|
|
static update_backlog no_backlog() {
|
|
return update_backlog{0, std::numeric_limits<size_t>::max()};
|
|
}
|
|
};
|
|
|
|
}
|