1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
|
// Copyright Vespa.ai. Licensed under the terms of the Apache 2.0 license. See LICENSE in the project root.
#include "alloc_config.h"
#include "subdbtype.h"
#include <algorithm>
#include <vespa/log/log.h>
LOG_SETUP(".searchcore.proton.common.alloc_config");
using search::GrowStrategy;
using vespalib::datastore::CompactionStrategy;
namespace proton {
AllocConfig::AllocConfig(const AllocStrategy& alloc_strategy,
uint32_t redundancy, uint32_t searchable_copies)
: _alloc_strategy(alloc_strategy),
_redundancy(redundancy),
_searchable_copies(std::min(searchable_copies, redundancy))
{
if (searchable_copies > redundancy) {
LOG(error, "searchablecopies(%d) larger than redundancy(%d)."
"Internal configuration issue that must be fixed. Capped for now",
searchable_copies, redundancy);
}
}
AllocConfig::~AllocConfig() = default;
bool
AllocConfig::operator==(const AllocConfig &rhs) const noexcept
{
return ((_alloc_strategy == rhs._alloc_strategy) &&
(_redundancy == rhs._redundancy) &&
(_searchable_copies == rhs._searchable_copies));
}
AllocStrategy
AllocConfig::make_alloc_strategy(SubDbType sub_db_type) const
{
auto &baseline = _alloc_strategy.get_grow_strategy();
size_t initial_capacity = baseline.getInitialCapacity();
switch (sub_db_type) {
case SubDbType::READY:
initial_capacity *= _searchable_copies;
break;
case SubDbType::NOTREADY:
initial_capacity *= (_redundancy - _searchable_copies);
break;
case SubDbType::REMOVED:
default:
initial_capacity = std::max(1024ul, initial_capacity / 100);
break;
}
GrowStrategy grow_strategy(initial_capacity, baseline.getGrowFactor(), baseline.getGrowDelta(), initial_capacity, baseline.getMultiValueAllocGrowFactor());
return {grow_strategy, _alloc_strategy.get_compaction_strategy(), _alloc_strategy.get_amortize_count()};
}
}
|
