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
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
|
// Copyright Vespa.ai. Licensed under the terms of the Apache 2.0 license. See LICENSE in the project root.
#include "stackdumpiterator.h"
#include <vespa/searchlib/query/tree/predicate_query_term.h>
#include <vespa/vespalib/util/compress.h>
#include <vespa/vespalib/objects/nbo.h>
#include <cassert>
using search::query::PredicateQueryTerm;
namespace search {
namespace {
uint64_t
readUint64(const char *&p)
{
uint64_t value;
memcpy(&value, p, sizeof(value));
p += sizeof(value);
return vespalib::nbo::n2h(value);
}
double
read_double(const char *&p)
{
double value;
memcpy(&value, p, sizeof(value));
p += sizeof(value);
return vespalib::nbo::n2h(value);
}
}
SimpleQueryStackDumpIterator::SimpleQueryStackDumpIterator(vespalib::stringref buf)
: _buf(buf.begin()),
_bufEnd(buf.end()),
_currPos(0),
_currEnd(0),
_currType(ParseItem::ITEM_UNDEF),
_currFlags(0),
_currWeight(100),
_currUniqueId(0),
_currArity(0),
_curr_index_name(),
_curr_term(),
_curr_integer_term(0),
_extraIntArg1(0),
_extraIntArg2(0),
_extraIntArg3(0),
_extraDoubleArg4(0),
_extraDoubleArg5(0),
_predicate_query_term()
{
}
SimpleQueryStackDumpIterator::~SimpleQueryStackDumpIterator() = default;
vespalib::stringref
SimpleQueryStackDumpIterator::read_stringref(const char *&p)
{
uint64_t len = readCompressedPositiveInt(p);
if ((p + len) > _bufEnd) throw false;
vespalib::stringref result(p, len);
p += len;
return result;
}
uint64_t
SimpleQueryStackDumpIterator::readCompressedPositiveInt(const char *&p)
{
if (p > _bufEnd || !vespalib::compress::Integer::check_decompress_space(p, _bufEnd - p)) {
throw false;
}
uint64_t tmp;
p += vespalib::compress::Integer::decompressPositive(tmp, p);
assert(p <= _bufEnd);
return tmp;
}
int64_t
SimpleQueryStackDumpIterator::readCompressedInt(const char *&p)
{
if (p > _bufEnd || !vespalib::compress::Integer::check_decompress_positive_space(p, _bufEnd - p)) {
throw false;
}
int64_t tmp;
p += vespalib::compress::Integer::decompress(tmp, p);
assert(p <= _bufEnd);
return tmp;
}
bool
SimpleQueryStackDumpIterator::next() {
try {
return readNext();
} catch (...) {
return false;
}
}
bool SimpleQueryStackDumpIterator::readNext() {
if ((_buf + _currEnd) >= _bufEnd)
// End of buffer, so no more items available
return false;
// Set the position to the previous end. If just starting, sets pos to _buf
_currPos = _currEnd;
// Find an item at the current position
const char *p = _buf + _currPos;
uint8_t typefield = *p++;
_currType = ParseItem::GetType(typefield);
if (ParseItem::GetFeature_Weight(typefield)) {
int64_t tmpLong = readCompressedInt(p);
_currWeight.setPercent(tmpLong);
} else {
_currWeight.setPercent(100);
}
if (__builtin_expect(ParseItem::getFeature_UniqueId(typefield), false)) {
_currUniqueId = readCompressedPositiveInt(p);
} else {
_currUniqueId = 0;
}
if (__builtin_expect(ParseItem::getFeature_Flags(typefield), false)) {
if ((p + sizeof(uint8_t)) > _bufEnd) return false;
_currFlags = (uint8_t)*p++;
} else {
_currFlags = 0;
}
switch (_currType) {
case ParseItem::ITEM_OR:
case ParseItem::ITEM_EQUIV:
case ParseItem::ITEM_AND:
case ParseItem::ITEM_NOT:
case ParseItem::ITEM_RANK:
case ParseItem::ITEM_ANY:
_currArity = readCompressedPositiveInt(p);
_curr_index_name = vespalib::stringref();
_curr_term = vespalib::stringref();
break;
case ParseItem::ITEM_NEAR:
case ParseItem::ITEM_ONEAR:
_currArity = readCompressedPositiveInt(p);
_extraIntArg1 = readCompressedPositiveInt(p);
_curr_index_name = vespalib::stringref();
_curr_term = vespalib::stringref();
break;
case ParseItem::ITEM_WEAK_AND:
_currArity = readCompressedPositiveInt(p);
_extraIntArg1 = readCompressedPositiveInt(p); // targetNumHits
_curr_index_name = read_stringref(p);
_curr_term = vespalib::stringref();
break;
case ParseItem::ITEM_SAME_ELEMENT:
_currArity = readCompressedPositiveInt(p);
_curr_index_name = read_stringref(p);
_curr_term = vespalib::stringref();
break;
case ParseItem::ITEM_PURE_WEIGHTED_STRING:
_curr_term = read_stringref(p);
_currArity = 0;
break;
case ParseItem::ITEM_PURE_WEIGHTED_LONG:
{
if (p + sizeof(int64_t) > _bufEnd) {
return false;
}
_curr_integer_term = readUint64(p);
_currArity = 0;
}
break;
case ParseItem::ITEM_WORD_ALTERNATIVES:
_curr_index_name = read_stringref(p);
_currArity = readCompressedPositiveInt(p);
_curr_term = vespalib::stringref();
break;
case ParseItem::ITEM_NUMTERM:
case ParseItem::ITEM_GEO_LOCATION_TERM:
case ParseItem::ITEM_TERM:
case ParseItem::ITEM_PREFIXTERM:
case ParseItem::ITEM_SUBSTRINGTERM:
case ParseItem::ITEM_EXACTSTRINGTERM:
case ParseItem::ITEM_SUFFIXTERM:
case ParseItem::ITEM_REGEXP:
_curr_index_name = read_stringref(p);
_curr_term = read_stringref(p);
_currArity = 0;
break;
case ParseItem::ITEM_PREDICATE_QUERY:
if ( ! readPredicate(p)) return false;
break;
case ParseItem::ITEM_WEIGHTED_SET:
case ParseItem::ITEM_DOT_PRODUCT:
case ParseItem::ITEM_WAND:
case ParseItem::ITEM_PHRASE:
if (!readComplexTerm(p)) return false;
break;
case ParseItem::ITEM_NEAREST_NEIGHBOR:
if ( ! readNN(p)) return false;
break;
case ParseItem::ITEM_FUZZY:
if (!readFuzzy(p)) return false;
break;
case ParseItem::ITEM_TRUE:
case ParseItem::ITEM_FALSE:
// no content
_currArity = 0;
break;
default:
// Unknown item, so report that no more are available
return false;
}
_currEnd = p - _buf;
// We should not have passed the buffer
return (p <= _bufEnd);
}
bool
SimpleQueryStackDumpIterator::readPredicate(const char *&p) {
_curr_index_name = read_stringref(p);
_predicate_query_term = std::make_unique<PredicateQueryTerm>();
size_t count = readCompressedPositiveInt(p);
for (size_t i = 0; i < count; ++i) {
vespalib::stringref key = read_stringref(p);
vespalib::stringref value = read_stringref(p);
if (p + sizeof(uint64_t) > _bufEnd) return false;
uint64_t sub_queries = readUint64(p);
_predicate_query_term->addFeature(key, value, sub_queries);
}
count = readCompressedPositiveInt(p);
for (size_t i = 0; i < count; ++i) {
vespalib::stringref key = read_stringref(p);
if (p + 2*sizeof(uint64_t) > _bufEnd) return false;
uint64_t value = readUint64(p);
uint64_t sub_queries = readUint64(p);
_predicate_query_term->addRangeFeature(key, value, sub_queries);
}
return true;
}
bool
SimpleQueryStackDumpIterator::readNN(const char *& p) {
_curr_index_name = read_stringref(p);
_curr_term = read_stringref(p); // query_tensor_name
_extraIntArg1 = readCompressedPositiveInt(p); // targetNumHits
_extraIntArg2 = readCompressedPositiveInt(p); // allow_approximate
_extraIntArg3 = readCompressedPositiveInt(p); // explore_additional_hits
// XXX: remove later when QRS doesn't send this extra flag
_extraIntArg2 &= ~0x40;
// QRS always sends this now:
if ((p + sizeof(double))> _bufEnd) return false;
_extraDoubleArg4 = read_double(p); // distance threshold
_currArity = 0;
return true;
}
bool
SimpleQueryStackDumpIterator::readComplexTerm(const char *& p) {
_currArity = readCompressedPositiveInt(p);
_curr_index_name = read_stringref(p);
if (_currType == ParseItem::ITEM_WAND) {
_extraIntArg1 = readCompressedPositiveInt(p); // targetNumHits
if ((p + 2*sizeof(double))> _bufEnd) return false;
_extraDoubleArg4 = read_double(p); // scoreThreshold
_extraDoubleArg5 = read_double(p); // thresholdBoostFactor
}
_curr_term = vespalib::stringref();
return true;
}
bool
SimpleQueryStackDumpIterator::readFuzzy(const char *&p) {
_curr_index_name = read_stringref(p);
_curr_term = read_stringref(p); // fuzzy term
_extraIntArg1 = readCompressedPositiveInt(p); // maxEditDistance
_extraIntArg2 = readCompressedPositiveInt(p); // prefixLength
_currArity = 0;
return true;
}
std::unique_ptr<query::PredicateQueryTerm>
SimpleQueryStackDumpIterator::getPredicateQueryTerm()
{
return std::move(_predicate_query_term);
}
}
|