blob: 6762c0516b25e9a051ef069488bfc9ad55c1b458 (
plain) (
blame)
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
|
// Copyright Vespa.ai. Licensed under the terms of the Apache 2.0 license. See LICENSE in the project root.
#include "bitvector_search_cache.h"
#include <vespa/searchlib/common/bitvector.h>
#include <vespa/vespalib/stllike/hash_map.hpp>
#include <vespa/vespalib/util/memoryusage.h>
#include <mutex>
namespace search::attribute {
BitVectorSearchCache::BitVectorSearchCache()
: _mutex(),
_size(0),
_entries_extra_memory_usage(0),
_cache()
{}
BitVectorSearchCache::~BitVectorSearchCache() = default;
void
BitVectorSearchCache::insert(const vespalib::string &term, std::shared_ptr<Entry> entry)
{
size_t entry_extra_memory_usage = 0;
if (entry) {
entry_extra_memory_usage = sizeof(Entry);
if (entry->bitVector) {
entry_extra_memory_usage += entry->bitVector->getFileBytes();
}
}
std::unique_lock guard(_mutex);
auto ins_res = _cache.insert(std::make_pair(term, std::move(entry)));
_size.store(_cache.size());
if (ins_res.second) {
_entries_extra_memory_usage += entry_extra_memory_usage;
}
}
std::shared_ptr<BitVectorSearchCache::Entry>
BitVectorSearchCache::find(const vespalib::string &term) const
{
if (size() > 0ul) {
std::shared_lock guard(_mutex);
auto itr = _cache.find(term);
if (itr != _cache.end()) {
return itr->second;
}
}
return {};
}
vespalib::MemoryUsage
BitVectorSearchCache::get_memory_usage() const
{
std::lock_guard guard(_mutex);
size_t cache_memory_consumption = _cache.getMemoryConsumption();
size_t cache_memory_used = _cache.getMemoryUsed();
size_t self_memory_used = sizeof(BitVectorSearchCache) - sizeof(_cache);
size_t allocated = self_memory_used + cache_memory_consumption + _entries_extra_memory_usage;
size_t used = self_memory_used + cache_memory_used + _entries_extra_memory_usage;
return vespalib::MemoryUsage(allocated, used, 0, 0);
}
void
BitVectorSearchCache::clear()
{
std::unique_lock guard(_mutex);
_cache.clear();
_size.store(0ul, std::memory_order_relaxed);
_entries_extra_memory_usage = 0;
}
}
|
