mirror of
https://github.com/scylladb/scylladb.git
synced 2026-04-26 19:35:12 +00:00
81ec49c82f
select() is too generic for the method that retrieve sstable runs, and it has a completely different meaning that the former select method used to select sstables based on token range. let's give it a more descriptive name. Signed-off-by: Raphael S. Carvalho <raphaelsc@scylladb.com> Message-Id: <20200811193401.22749-1-raphaelsc@scylladb.com>
109 lines
4.3 KiB
C++
109 lines
4.3 KiB
C++
/*
|
|
* Copyright (C) 2016 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 "shared_sstable.hh"
|
|
#include "dht/i_partitioner.hh"
|
|
#include <seastar/core/shared_ptr.hh>
|
|
#include <vector>
|
|
|
|
namespace sstables {
|
|
|
|
class sstable_set_impl;
|
|
class incremental_selector_impl;
|
|
|
|
// Structure holds all sstables (a.k.a. fragments) that belong to same run identifier, which is an UUID.
|
|
// SStables in that same run will not overlap with one another.
|
|
class sstable_run {
|
|
sstable_list _all;
|
|
public:
|
|
void insert(shared_sstable sst);
|
|
void erase(shared_sstable sst);
|
|
// Data size of the whole run, meaning it's a sum of the data size of all its fragments.
|
|
uint64_t data_size() const;
|
|
const sstable_list& all() const { return _all; }
|
|
};
|
|
|
|
class sstable_set {
|
|
std::unique_ptr<sstable_set_impl> _impl;
|
|
schema_ptr _schema;
|
|
// used to support column_family::get_sstable(), which wants to return an sstable_list
|
|
// that has a reference somewhere
|
|
lw_shared_ptr<sstable_list> _all;
|
|
std::unordered_map<utils::UUID, sstable_run> _all_runs;
|
|
public:
|
|
~sstable_set();
|
|
sstable_set(std::unique_ptr<sstable_set_impl> impl, schema_ptr s, lw_shared_ptr<sstable_list> all);
|
|
sstable_set(const sstable_set&);
|
|
sstable_set(sstable_set&&) noexcept;
|
|
sstable_set& operator=(const sstable_set&);
|
|
sstable_set& operator=(sstable_set&&) noexcept;
|
|
std::vector<shared_sstable> select(const dht::partition_range& range) const;
|
|
// Return all runs which contain any of the input sstables.
|
|
std::vector<sstable_run> select_sstable_runs(const std::vector<shared_sstable>& sstables) const;
|
|
lw_shared_ptr<sstable_list> all() const { return _all; }
|
|
void insert(shared_sstable sst);
|
|
void erase(shared_sstable sst);
|
|
|
|
// Used to incrementally select sstables from sstable set using ring-position.
|
|
// sstable set must be alive during the lifetime of the selector.
|
|
class incremental_selector {
|
|
std::unique_ptr<incremental_selector_impl> _impl;
|
|
dht::ring_position_comparator _cmp;
|
|
mutable std::optional<dht::partition_range> _current_range;
|
|
mutable std::optional<nonwrapping_range<dht::ring_position_view>> _current_range_view;
|
|
mutable std::vector<shared_sstable> _current_sstables;
|
|
mutable dht::ring_position_view _current_next_position = dht::ring_position_view::min();
|
|
public:
|
|
~incremental_selector();
|
|
incremental_selector(std::unique_ptr<incremental_selector_impl> impl, const schema& s);
|
|
incremental_selector(incremental_selector&&) noexcept;
|
|
|
|
struct selection {
|
|
const std::vector<shared_sstable>& sstables;
|
|
dht::ring_position_view next_position;
|
|
};
|
|
|
|
// Return the sstables that intersect with `pos` and the next
|
|
// position where the intersecting sstables change.
|
|
// To walk through the token range incrementally call `select()`
|
|
// with `dht::ring_position_view::min()` and then pass back the
|
|
// returned `next_position` on each next call until
|
|
// `next_position` becomes `dht::ring_position::max()`.
|
|
//
|
|
// Successive calls to `select()' have to pass weakly monotonic
|
|
// positions (incrementability).
|
|
//
|
|
// NOTE: both `selection.sstables` and `selection.next_position`
|
|
// are only guaranteed to be valid until the next call to
|
|
// `select()`.
|
|
selection select(const dht::ring_position_view& pos) const;
|
|
};
|
|
incremental_selector make_incremental_selector() const;
|
|
};
|
|
|
|
sstable_set make_partitioned_sstable_set(schema_ptr schema, lw_shared_ptr<sstable_list> all, bool use_level_metadata = true);
|
|
|
|
std::ostream& operator<<(std::ostream& os, const sstables::sstable_run& run);
|
|
|
|
}
|