blob: 27cadeeb300c88e1459f5757c5268907c8f3b321 (
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
|
// Copyright Yahoo. Licensed under the terms of the Apache 2.0 license. See LICENSE in the project root.
#include "query_term_ucs4.h"
#include <vespa/vespalib/objects/visit.h>
#include <vespa/vespalib/text/utf8.h>
#include <mutex>
namespace search {
namespace {
std::mutex _globalMutex;
}
QueryTermUCS4::~QueryTermUCS4() {
ucs4_t * ucs4 = _termUCS4.load(std::memory_order_relaxed);
if (ucs4 != nullptr) {
delete [] ucs4;
}
}
QueryTermUCS4::QueryTermUCS4(const string & termS, Type type) :
QueryTermSimple(termS, type),
_termUCS4(nullptr),
_cachedTermLen(0)
{
vespalib::Utf8Reader r(termS);
while (r.hasMore()) {
ucs4_t u = r.getChar();
(void) u;
_cachedTermLen++;
}
}
const QueryTermUCS4::ucs4_t *
QueryTermUCS4::fillUCS4() {
/*
* Double checked locking......
* This is a 'dirty' optimisation, but this is done to avoid writing a lot of data and blow the cpu caches with something
* you do not really need most of the time. That matters when qps is very high and query is wide, and hits are few.
*/
std::unique_ptr<ucs4_t[]> ucs4 = asUcs4();
ucs4_t * next = ucs4.get();
{
std::lock_guard guard(_globalMutex);
ucs4_t *prev = _termUCS4.load(std::memory_order_relaxed);
if (prev != nullptr) return prev;
_termUCS4.store(ucs4.release(), std::memory_order_relaxed);
}
return next;
}
std::unique_ptr<QueryTermUCS4::ucs4_t[]>
QueryTermUCS4::asUcs4() const {
auto ucs4 = std::make_unique<ucs4_t[]>(_cachedTermLen + 1);
vespalib::Utf8Reader r(getTermString());
uint32_t i(0);
while (r.hasMore()) {
ucs4[i++] = r.getChar();
}
ucs4[_cachedTermLen] = 0;
return ucs4;
}
void
QueryTermUCS4::visitMembers(vespalib::ObjectVisitor & visitor) const
{
QueryTermSimple::visitMembers(visitor);
visit(visitor, "termlength", static_cast<uint64_t>(_cachedTermLen));
}
}
|
