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
297
298
|
// Copyright 2017 Yahoo Holdings. Licensed under the terms of the Apache 2.0 license. See LICENSE in the project root.
#include "stackdumpiterator.h"
#include <vespa/vespalib/util/compress.h>
#include <vespa/vespalib/objects/nbo.h>
#include <cassert>
using search::query::PredicateQueryTerm;
namespace search {
SimpleQueryStackDumpIterator::SimpleQueryStackDumpIterator(vespalib::stringref buf) :
_buf(buf.begin()),
_bufEnd(buf.end()),
_bufLen(buf.size()),
_currPos(_buf),
_currEnd(_buf),
_currType(ParseItem::ITEM_UNDEF),
_currCreator(ParseItem::CREA_ORIG),
_currWeight(100),
_currUniqueId(0),
_currFlags(0),
_currArity(0),
_currArg1(0),
_currArg2(0),
_currArg3(0),
_predicate_query_term(),
_curr_index_name(),
_curr_term(),
_generatedTerm()
{
}
SimpleQueryStackDumpIterator::~SimpleQueryStackDumpIterator() = default;
vespalib::string
SimpleQueryStackDumpIterator::readString(const char *&p)
{
if (p >= _bufEnd) throw false;
uint64_t tmp;
p += vespalib::compress::Integer::decompressPositive(tmp, p);
vespalib::string s(p, tmp);
p += s.size();
return s;
}
vespalib::stringref
SimpleQueryStackDumpIterator::read_stringref(const char *&p)
{
if (p >= _bufEnd) throw false;
uint64_t len;
p += vespalib::compress::Integer::decompressPositive(len, p);
if (p > _bufEnd) throw false;
vespalib::stringref result(p, len);
p += len;
if (p > _bufEnd) throw false;
return result;
}
uint64_t
SimpleQueryStackDumpIterator::readUint64(const char *&p)
{
if (p + sizeof(uint64_t) > _bufEnd) throw false;
uint64_t l = vespalib::nbo::n2h(*(const uint64_t *)(const void *)p);
p += sizeof(uint64_t);
return l;
}
double
SimpleQueryStackDumpIterator::read_double(const char *&p)
{
if (p >= _bufEnd) throw false;
double result = vespalib::nbo::n2h(*reinterpret_cast<const double *>(p));
p += sizeof(double);
if (p > _bufEnd) throw false;
return result;
}
uint64_t
SimpleQueryStackDumpIterator::readCompressedPositiveInt(const char *&p)
{
if (p >= _bufEnd) throw false;
uint64_t tmp;
p += vespalib::compress::Integer::decompressPositive(tmp, p);
if (p > _bufEnd) throw false;
return tmp;
}
bool
SimpleQueryStackDumpIterator::next()
{
if (_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 = _currPos;
uint8_t typefield = *p++;
_currType = ParseItem::GetType(typefield);
if (ParseItem::GetFeature_Weight(typefield)) {
int64_t tmpLong;
if (p >= _bufEnd) return false;
p += vespalib::compress::Integer::decompress(tmpLong, p);
_currWeight.setPercent(tmpLong);
if (p > _bufEnd) return false;
} else {
_currWeight.setPercent(100);
}
if (ParseItem::getFeature_UniqueId(typefield)) {
try {
_currUniqueId = readCompressedPositiveInt(p);
} catch (...) {
return false;
}
} else {
_currUniqueId = 0;
}
if (ParseItem::getFeature_Flags(typefield)) {
if ((p + sizeof(uint32_t)) > _bufEnd) {
return false;
}
_currFlags = (uint8_t)*p++;
} else {
_currFlags = 0;
}
_currCreator = ParseItem::GetCreator(_currFlags);
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:
try {
_currArity = readCompressedPositiveInt(p);
_currArg1 = 0;
_curr_index_name = vespalib::stringref();
_curr_term = vespalib::stringref();
} catch (...) {
return false;
}
break;
case ParseItem::ITEM_NEAR:
case ParseItem::ITEM_ONEAR:
try {
_currArity = readCompressedPositiveInt(p);
_currArg1 = readCompressedPositiveInt(p);
_curr_index_name = vespalib::stringref();
_curr_term = vespalib::stringref();
} catch (...) {
return false;
}
break;
case ParseItem::ITEM_WEAK_AND:
try {
_currArity = readCompressedPositiveInt(p);
_currArg1 = readCompressedPositiveInt(p);
_curr_index_name = read_stringref(p);
_curr_term = vespalib::stringref();
} catch (...) {
return false;
}
break;
case ParseItem::ITEM_SAME_ELEMENT:
try {
_currArity = readCompressedPositiveInt(p);
_currArg1 = 0;
_curr_index_name = read_stringref(p);
_curr_term = vespalib::stringref();
} catch (...) {
return false;
}
break;
case ParseItem::ITEM_PURE_WEIGHTED_STRING:
try {
_curr_term = read_stringref(p);
_currArg1 = 0;
_currArity = 0;
} catch (...) {
return false;
}
break;
case ParseItem::ITEM_PURE_WEIGHTED_LONG:
if (p + sizeof(int64_t) > _bufEnd) return false;
_generatedTerm.clear();
_generatedTerm << vespalib::nbo::n2h(*reinterpret_cast<const int64_t *>(p));
_curr_term = vespalib::stringref(_generatedTerm.c_str(), _generatedTerm.size());
p += sizeof(int64_t);
if (p > _bufEnd) return false;
_currArg1 = 0;
_currArity = 0;
break;
case ParseItem::ITEM_WORD_ALTERNATIVES:
try {
_curr_index_name = read_stringref(p);
_currArity = readCompressedPositiveInt(p);
_curr_term = vespalib::stringref();
} catch (...) {
return false;
}
break;
case ParseItem::ITEM_NUMTERM:
case ParseItem::ITEM_TERM:
case ParseItem::ITEM_PREFIXTERM:
case ParseItem::ITEM_SUBSTRINGTERM:
case ParseItem::ITEM_EXACTSTRINGTERM:
case ParseItem::ITEM_SUFFIXTERM:
case ParseItem::ITEM_REGEXP:
try {
_curr_index_name = read_stringref(p);
_curr_term = read_stringref(p);
_currArg1 = 0;
_currArity = 0;
} catch (...) {
return false;
}
break;
case ParseItem::ITEM_PREDICATE_QUERY:
try {
_curr_index_name = read_stringref(p);
_predicate_query_term.reset(new PredicateQueryTerm);
size_t count = readCompressedPositiveInt(p);
for (size_t i = 0; i < count; ++i) {
vespalib::string key = readString(p);
vespalib::string value = readString(p);
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::string key = readString(p);
uint64_t value = readUint64(p);
uint64_t sub_queries = readUint64(p);
_predicate_query_term->addRangeFeature(
key, value, sub_queries);
}
if (p > _bufEnd) return false;
} catch (...) {
return false;
}
break;
case ParseItem::ITEM_WEIGHTED_SET:
case ParseItem::ITEM_DOT_PRODUCT:
case ParseItem::ITEM_WAND:
case ParseItem::ITEM_PHRASE:
try {
_currArity = readCompressedPositiveInt(p);
_curr_index_name = read_stringref(p);
if (_currType == ParseItem::ITEM_WAND) {
_currArg1 = readCompressedPositiveInt(p); // targetNumHits
_currArg2 = read_double(p); // scoreThreshold
_currArg3 = read_double(p); // thresholdBoostFactor
} else {
_currArg1 = 0;
}
_curr_term = vespalib::stringref();
} catch (...) {
return false;
}
break;
case ParseItem::ITEM_NEAREST_NEIGHBOR:
try {
_curr_index_name = read_stringref(p);
_curr_term = read_stringref(p); // query_tensor_name
_currArg1 = readCompressedPositiveInt(p); // target_num_hits
_currArg2 = readCompressedPositiveInt(p); // allow_approximate
_currArg3 = readCompressedPositiveInt(p); // explore_additional_hits
_currArity = 0;
} catch (...) {
return false;
}
break;
default:
// Unknown item, so report that no more are available
return false;
}
_currEnd = p;
// We should not have passed the buffer
assert(_currEnd <= _bufEnd);
return true;
}
}
|
