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
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
|
// Copyright Yahoo. Licensed under the terms of the Apache 2.0 license. See LICENSE in the project root.
#pragma once
#include "lid_hold_list.h"
#include "lidstatevector.h"
#include <vespa/searchlib/attribute/attributeguard.h>
#include <vespa/vespalib/util/memoryusage.h>
#include <atomic>
namespace search::queryeval {
class Blueprint;
}
namespace proton::documentmetastore {
/**
* Class responsible for allocating lids and managing
* which lids are used, active and free.
*/
class LidAllocator
{
private:
using DocId = uint32_t;
using generation_t = vespalib::GenerationHandler::generation_t;
LidHoldList _holdLids;
LidStateVector _freeLids;
LidStateVector _usedLids;
LidStateVector _pendingHoldLids;
LidStateVector _activeLids;
std::atomic<uint32_t> _numActiveLids;
bool _lidFreeListConstructed;
public:
LidAllocator(uint32_t size,
uint32_t capacity,
vespalib::GenerationHolder &genHolder);
~LidAllocator();
DocId getFreeLid(DocId lidLimit);
DocId peekFreeLid(DocId lidLimit);
void ensureSpace(uint32_t newSize, uint32_t newCapacity);
void registerLid(DocId lid) { _usedLids.setBit(lid); }
void unregisterLid(DocId lid);
void unregister_lids(const std::vector<DocId>& lids);
vespalib::MemoryUsage getMemoryUsage() const;
void reclaim_memory(generation_t oldest_used_gen) {
_holdLids.reclaim_memory(oldest_used_gen, _freeLids);
}
void moveLidBegin(DocId fromLid, DocId toLid);
void moveLidEnd(DocId fromLid, DocId toLid);
void holdLids(const std::vector<DocId> &lids, DocId lidLimit,
generation_t currentGeneration);
bool holdLidOK(DocId lid, DocId lidLimit) const;
void constructFreeList(DocId lidLimit);
std::unique_ptr<search::queryeval::Blueprint> createWhiteListBlueprint() const;
void updateActiveLids(DocId lid, bool active);
void clearDocs(DocId lidLow, DocId lidLimit);
void shrinkLidSpace(DocId committedDocIdLimit);
uint32_t getNumUsedLids() const { return _usedLids.count(); }
uint32_t getNumActiveLids() const noexcept {
return _numActiveLids.load(std::memory_order_relaxed);
}
void setFreeListConstructed() {
_lidFreeListConstructed = true;
}
bool isFreeListConstructed() const {
return _lidFreeListConstructed;
}
bool validButMaybeUnusedLid(DocId lid) const {
return lid < _usedLids.size();
}
bool validLid(DocId lid) const {
auto &vector = _usedLids.getBitVector();
return (lid < vector.getSizeAcquire() && vector.testBitAcquire(lid));
}
bool validLid(DocId lid, uint32_t limit) const {
return (lid < limit && _usedLids.testBitAcquire(lid));
}
DocId getLowestFreeLid() const {
return _freeLids.getLowest();
}
DocId getHighestUsedLid() const {
return _usedLids.getHighest();
}
const search::BitVector &getActiveLids() const { return _activeLids.getBitVector(); }
const search::BitVector &getUsedLids() const { return _usedLids.getBitVector(); }
};
}
|
