Coverage Report

Created: 2026-02-06 21:19

next uncovered line (L), next uncovered region (R), next uncovered branch (B)
/root/doris/be/src/vec/functions/match.cpp
Line
Count
Source
1
// Licensed to the Apache Software Foundation (ASF) under one
2
// or more contributor license agreements.  See the NOTICE file
3
// distributed with this work for additional information
4
// regarding copyright ownership.  The ASF licenses this file
5
// to you under the Apache License, Version 2.0 (the
6
// "License"); you may not use this file except in compliance
7
// with the License.  You may obtain a copy of the License at
8
//
9
//   http://www.apache.org/licenses/LICENSE-2.0
10
//
11
// Unless required by applicable law or agreed to in writing,
12
// software distributed under the License is distributed on an
13
// "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY
14
// KIND, either express or implied.  See the License for the
15
// specific language governing permissions and limitations
16
// under the License.
17
18
#include "vec/functions/match.h"
19
20
#include <hs/hs.h>
21
22
#include "olap/rowset/segment_v2/index_reader_helper.h"
23
#include "olap/rowset/segment_v2/inverted_index/analyzer/analyzer.h"
24
#include "runtime/query_context.h"
25
#include "runtime/runtime_state.h"
26
#include "util/debug_points.h"
27
28
namespace doris::vectorized {
29
#include "common/compile_check_begin.h"
30
31
namespace {
32
33
0
const InvertedIndexAnalyzerCtx* get_match_analyzer_ctx(FunctionContext* context) {
34
0
    if (context == nullptr) {
35
0
        return nullptr;
36
0
    }
37
0
    auto* analyzer_ctx = reinterpret_cast<const InvertedIndexAnalyzerCtx*>(
38
0
            context->get_function_state(FunctionContext::THREAD_LOCAL));
39
0
    if (analyzer_ctx == nullptr) {
40
0
        analyzer_ctx = reinterpret_cast<const InvertedIndexAnalyzerCtx*>(
41
0
                context->get_function_state(FunctionContext::FRAGMENT_LOCAL));
42
0
    }
43
0
    return analyzer_ctx;
44
0
}
45
46
} // namespace
47
48
Status FunctionMatchBase::evaluate_inverted_index(
49
        const ColumnsWithTypeAndName& arguments,
50
        const std::vector<vectorized::IndexFieldNameAndTypePair>& data_type_with_names,
51
        std::vector<segment_v2::IndexIterator*> iterators, uint32_t num_rows,
52
        const InvertedIndexAnalyzerCtx* analyzer_ctx,
53
0
        segment_v2::InvertedIndexResultBitmap& bitmap_result) const {
54
0
    DCHECK(arguments.size() == 1);
55
0
    DCHECK(data_type_with_names.size() == 1);
56
0
    DCHECK(iterators.size() == 1);
57
0
    auto* iter = iterators[0];
58
0
    auto data_type_with_name = data_type_with_names[0];
59
0
    if (iter == nullptr) {
60
0
        return Status::OK();
61
0
    }
62
0
    const std::string& function_name = get_name();
63
64
0
    if (function_name == MATCH_PHRASE_FUNCTION || function_name == MATCH_PHRASE_PREFIX_FUNCTION ||
65
0
        function_name == MATCH_PHRASE_EDGE_FUNCTION) {
66
0
        auto reader = iter->get_reader(InvertedIndexReaderType::FULLTEXT);
67
0
        if (reader && !segment_v2::IndexReaderHelper::is_support_phrase(reader)) {
68
0
            return Status::Error<ErrorCode::INDEX_INVALID_PARAMETERS>(
69
0
                    "phrase queries require setting support_phrase = true");
70
0
        }
71
0
    }
72
0
    Field param_value;
73
0
    arguments[0].column->get(0, param_value);
74
0
    if (param_value.is_null()) {
75
        // if query value is null, skip evaluate inverted index
76
0
        return Status::OK();
77
0
    }
78
0
    auto param_type = arguments[0].type->get_primitive_type();
79
0
    if (!is_string_type(param_type)) {
80
0
        return Status::Error<ErrorCode::INDEX_INVALID_PARAMETERS>(
81
0
                "arguments for match must be string");
82
0
    }
83
0
    std::unique_ptr<InvertedIndexQueryParamFactory> query_param = nullptr;
84
0
    RETURN_IF_ERROR(InvertedIndexQueryParamFactory::create_query_value(param_type, &param_value,
85
0
                                                                       query_param));
86
87
0
    InvertedIndexParam param;
88
0
    param.column_name = data_type_with_name.first;
89
0
    param.column_type = data_type_with_name.second;
90
0
    param.query_value = query_param->get_value();
91
0
    param.query_type = get_query_type_from_fn_name();
92
0
    param.num_rows = num_rows;
93
0
    param.roaring = std::make_shared<roaring::Roaring>();
94
0
    param.analyzer_ctx = analyzer_ctx;
95
0
    if (is_string_type(param_type)) {
96
0
        RETURN_IF_ERROR(iter->read_from_index(&param));
97
0
    } else {
98
0
        return Status::Error<ErrorCode::INDEX_INVALID_PARAMETERS>(
99
0
                "invalid params type for FunctionMatchBase::evaluate_inverted_index {}",
100
0
                param_type);
101
0
    }
102
0
    std::shared_ptr<roaring::Roaring> null_bitmap = std::make_shared<roaring::Roaring>();
103
0
    if (iter->has_null()) {
104
0
        segment_v2::InvertedIndexQueryCacheHandle null_bitmap_cache_handle;
105
0
        RETURN_IF_ERROR(iter->read_null_bitmap(&null_bitmap_cache_handle));
106
0
        null_bitmap = null_bitmap_cache_handle.get_bitmap();
107
0
    }
108
0
    segment_v2::InvertedIndexResultBitmap result(param.roaring, null_bitmap);
109
0
    bitmap_result = result;
110
0
    bitmap_result.mask_out_null();
111
112
0
    return Status::OK();
113
0
}
114
Status FunctionMatchBase::execute_impl(FunctionContext* context, Block& block,
115
                                       const ColumnNumbers& arguments, uint32_t result,
116
0
                                       size_t input_rows_count) const {
117
0
    ColumnPtr& column_ptr = block.get_by_position(arguments[1]).column;
118
0
    DataTypePtr& type_ptr = block.get_by_position(arguments[1]).type;
119
120
0
    auto format_options = DataTypeSerDe::get_default_format_options();
121
0
    auto time_zone = cctz::utc_time_zone();
122
0
    format_options.timezone =
123
0
            (context && context->state()) ? &context->state()->timezone_obj() : &time_zone;
124
125
0
    auto match_query_str = type_ptr->to_string(*column_ptr, 0, format_options);
126
0
    std::string column_name = block.get_by_position(arguments[0]).name;
127
0
    VLOG_DEBUG << "begin to execute match directly, column_name=" << column_name
128
0
               << ", match_query_str=" << match_query_str;
129
0
    auto* analyzer_ctx = get_match_analyzer_ctx(context);
130
0
    const ColumnPtr source_col =
131
0
            block.get_by_position(arguments[0]).column->convert_to_full_column_if_const();
132
0
    const auto* values = check_and_get_column<ColumnString>(source_col.get());
133
0
    const ColumnArray* array_col = nullptr;
134
0
    if (is_column<vectorized::ColumnArray>(source_col.get())) {
135
0
        array_col = check_and_get_column<ColumnArray>(source_col.get());
136
0
        if (array_col && !array_col->get_data().is_column_string()) {
137
0
            return Status::NotSupported(fmt::format(
138
0
                    "unsupported nested array of type {} for function {}",
139
0
                    is_column_nullable(array_col->get_data()) ? array_col->get_data().get_name()
140
0
                                                              : array_col->get_data().get_name(),
141
0
                    get_name()));
142
0
        }
143
144
0
        if (is_column_nullable(array_col->get_data())) {
145
0
            const auto& array_nested_null_column =
146
0
                    reinterpret_cast<const ColumnNullable&>(array_col->get_data());
147
0
            values = check_and_get_column<ColumnString>(
148
0
                    *(array_nested_null_column.get_nested_column_ptr()));
149
0
        } else {
150
            // array column element is always set Nullable for now.
151
0
            values = check_and_get_column<ColumnString>(*(array_col->get_data_ptr()));
152
0
        }
153
0
    } else if (const auto* nullable = check_and_get_column<ColumnNullable>(source_col.get())) {
154
0
        values = check_and_get_column<ColumnString>(*nullable->get_nested_column_ptr());
155
0
    }
156
157
0
    if (!values) {
158
0
        LOG(WARNING) << "Illegal column " << source_col->get_name();
159
0
        return Status::InternalError("Not supported input column types");
160
0
    }
161
    // result column
162
0
    auto res = ColumnUInt8::create();
163
0
    ColumnUInt8::Container& vec_res = res->get_data();
164
    // set default value to 0, and match functions only need to set 1/true
165
0
    vec_res.resize_fill(input_rows_count);
166
0
    RETURN_IF_ERROR(execute_match(context, column_name, match_query_str, input_rows_count, values,
167
0
                                  analyzer_ctx, (array_col ? &(array_col->get_offsets()) : nullptr),
168
0
                                  vec_res));
169
0
    block.replace_by_position(result, std::move(res));
170
171
0
    return Status::OK();
172
0
}
173
174
inline doris::segment_v2::InvertedIndexQueryType FunctionMatchBase::get_query_type_from_fn_name()
175
15
        const {
176
15
    std::string fn_name = get_name();
177
15
    if (fn_name == MATCH_ANY_FUNCTION) {
178
2
        return doris::segment_v2::InvertedIndexQueryType::MATCH_ANY_QUERY;
179
13
    } else if (fn_name == MATCH_ALL_FUNCTION) {
180
2
        return doris::segment_v2::InvertedIndexQueryType::MATCH_ALL_QUERY;
181
11
    } else if (fn_name == MATCH_PHRASE_FUNCTION) {
182
3
        return doris::segment_v2::InvertedIndexQueryType::MATCH_PHRASE_QUERY;
183
8
    } else if (fn_name == MATCH_PHRASE_PREFIX_FUNCTION) {
184
3
        return doris::segment_v2::InvertedIndexQueryType::MATCH_PHRASE_PREFIX_QUERY;
185
5
    } else if (fn_name == MATCH_PHRASE_REGEXP_FUNCTION) {
186
2
        return doris::segment_v2::InvertedIndexQueryType::MATCH_REGEXP_QUERY;
187
3
    } else if (fn_name == MATCH_PHRASE_EDGE_FUNCTION) {
188
3
        return doris::segment_v2::InvertedIndexQueryType::MATCH_PHRASE_EDGE_QUERY;
189
3
    }
190
0
    return doris::segment_v2::InvertedIndexQueryType::UNKNOWN_QUERY;
191
15
}
192
193
std::vector<TermInfo> FunctionMatchBase::analyse_query_str_token(
194
        const InvertedIndexAnalyzerCtx* analyzer_ctx, const std::string& match_query_str,
195
8
        const std::string& column_name) const {
196
8
    std::vector<TermInfo> query_tokens;
197
8
    if (analyzer_ctx == nullptr) {
198
3
        return query_tokens;
199
3
    }
200
201
5
    VLOG_DEBUG << "begin to run " << get_name() << ", parser_type: "
202
0
               << inverted_index_parser_type_to_string(analyzer_ctx->parser_type);
203
204
    // Decision is based on parser_type (from index properties):
205
    // - PARSER_NONE: no tokenization (keyword/exact match)
206
    // - Other parsers: tokenize using the analyzer
207
5
    if (!analyzer_ctx->should_tokenize()) {
208
        // Keyword index: all strings (including empty) are valid tokens for exact match.
209
        // Empty string is a valid value in keyword index and should be matchable.
210
1
        query_tokens.emplace_back(match_query_str);
211
1
        return query_tokens;
212
1
    }
213
214
    // Safety check: if analyzer is nullptr but tokenization is expected, fall back to no tokenization
215
4
    if (analyzer_ctx->analyzer == nullptr) {
216
0
        VLOG_DEBUG << "Analyzer is nullptr, falling back to no tokenization";
217
        // For fallback case, also allow empty strings to be matched
218
0
        query_tokens.emplace_back(match_query_str);
219
0
        return query_tokens;
220
0
    }
221
222
    // Tokenize using the analyzer
223
4
    auto reader = doris::segment_v2::inverted_index::InvertedIndexAnalyzer::create_reader(
224
4
            analyzer_ctx->char_filter_map);
225
4
    reader->init(match_query_str.data(), (int)match_query_str.size(), true);
226
4
    query_tokens = doris::segment_v2::inverted_index::InvertedIndexAnalyzer::get_analyse_result(
227
4
            reader, analyzer_ctx->analyzer.get());
228
4
    return query_tokens;
229
4
}
230
231
inline std::vector<TermInfo> FunctionMatchBase::analyse_data_token(
232
        const std::string& column_name, const InvertedIndexAnalyzerCtx* analyzer_ctx,
233
        const ColumnString* string_col, int32_t current_block_row_idx,
234
128
        const ColumnArray::Offsets64* array_offsets, int32_t& current_src_array_offset) const {
235
128
    std::vector<TermInfo> data_tokens;
236
128
    if (analyzer_ctx == nullptr) {
237
0
        return data_tokens;
238
0
    }
239
240
    // Determine tokenization strategy based on parser_type
241
128
    const bool should_tokenize =
242
128
            analyzer_ctx->should_tokenize() && analyzer_ctx->analyzer != nullptr;
243
244
128
    if (array_offsets) {
245
2
        for (auto next_src_array_offset = (*array_offsets)[current_block_row_idx];
246
6
             current_src_array_offset < next_src_array_offset; ++current_src_array_offset) {
247
4
            const auto& str_ref = string_col->get_data_at(current_src_array_offset);
248
4
            if (!should_tokenize) {
249
0
                data_tokens.emplace_back(str_ref.to_string());
250
0
                continue;
251
0
            }
252
4
            auto reader = doris::segment_v2::inverted_index::InvertedIndexAnalyzer::create_reader(
253
4
                    analyzer_ctx->char_filter_map);
254
4
            reader->init(str_ref.data, (int)str_ref.size, true);
255
4
            data_tokens =
256
4
                    doris::segment_v2::inverted_index::InvertedIndexAnalyzer::get_analyse_result(
257
4
                            reader, analyzer_ctx->analyzer.get());
258
4
        }
259
126
    } else {
260
126
        const auto& str_ref = string_col->get_data_at(current_block_row_idx);
261
126
        if (!should_tokenize) {
262
3
            data_tokens.emplace_back(str_ref.to_string());
263
123
        } else {
264
123
            auto reader = doris::segment_v2::inverted_index::InvertedIndexAnalyzer::create_reader(
265
123
                    analyzer_ctx->char_filter_map);
266
123
            reader->init(str_ref.data, (int)str_ref.size, true);
267
123
            data_tokens =
268
123
                    doris::segment_v2::inverted_index::InvertedIndexAnalyzer::get_analyse_result(
269
123
                            reader, analyzer_ctx->analyzer.get());
270
123
        }
271
126
    }
272
128
    return data_tokens;
273
128
}
274
275
0
Status FunctionMatchBase::check(FunctionContext* context, const std::string& function_name) const {
276
0
    if (!context->state()->query_options().enable_match_without_inverted_index) {
277
0
        return Status::Error<ErrorCode::INVERTED_INDEX_NOT_SUPPORTED>(
278
0
                "{} not support execute_match", function_name);
279
0
    }
280
281
0
    DBUG_EXECUTE_IF("match.invert_index_not_support_execute_match", {
282
0
        return Status::Error<ErrorCode::INVERTED_INDEX_NOT_SUPPORTED>(
283
0
                "debug point: {} not support execute_match", function_name);
284
0
    });
285
286
0
    return Status::OK();
287
0
}
288
289
Status FunctionMatchAny::execute_match(FunctionContext* context, const std::string& column_name,
290
                                       const std::string& match_query_str, size_t input_rows_count,
291
                                       const ColumnString* string_col,
292
                                       const InvertedIndexAnalyzerCtx* analyzer_ctx,
293
                                       const ColumnArray::Offsets64* array_offsets,
294
0
                                       ColumnUInt8::Container& result) const {
295
0
    RETURN_IF_ERROR(check(context, name));
296
297
0
    auto query_tokens = analyse_query_str_token(analyzer_ctx, match_query_str, column_name);
298
0
    if (query_tokens.empty()) {
299
0
        VLOG_DEBUG << fmt::format(
300
0
                "token parser result is empty for query, "
301
0
                "please check your query: '{}' and index parser: '{}'",
302
0
                match_query_str,
303
0
                analyzer_ctx ? inverted_index_parser_type_to_string(analyzer_ctx->parser_type)
304
0
                             : "unknown");
305
0
        return Status::OK();
306
0
    }
307
308
0
    auto current_src_array_offset = 0;
309
0
    for (int i = 0; i < input_rows_count; i++) {
310
0
        auto data_tokens = analyse_data_token(column_name, analyzer_ctx, string_col, i,
311
0
                                              array_offsets, current_src_array_offset);
312
313
        // TODO: more efficient impl
314
0
        for (auto& term_info : query_tokens) {
315
0
            auto it =
316
0
                    std::find_if(data_tokens.begin(), data_tokens.end(), [&](const TermInfo& info) {
317
0
                        return info.get_single_term() == term_info.get_single_term();
318
0
                    });
319
0
            if (it != data_tokens.end()) {
320
0
                result[i] = true;
321
0
                break;
322
0
            }
323
0
        }
324
0
    }
325
326
0
    return Status::OK();
327
0
}
328
329
Status FunctionMatchAll::execute_match(FunctionContext* context, const std::string& column_name,
330
                                       const std::string& match_query_str, size_t input_rows_count,
331
                                       const ColumnString* string_col,
332
                                       const InvertedIndexAnalyzerCtx* analyzer_ctx,
333
                                       const ColumnArray::Offsets64* array_offsets,
334
0
                                       ColumnUInt8::Container& result) const {
335
0
    RETURN_IF_ERROR(check(context, name));
336
337
0
    auto query_tokens = analyse_query_str_token(analyzer_ctx, match_query_str, column_name);
338
0
    if (query_tokens.empty()) {
339
0
        VLOG_DEBUG << fmt::format(
340
0
                "token parser result is empty for query, "
341
0
                "please check your query: '{}' and index parser: '{}'",
342
0
                match_query_str,
343
0
                analyzer_ctx ? inverted_index_parser_type_to_string(analyzer_ctx->parser_type)
344
0
                             : "unknown");
345
0
        return Status::OK();
346
0
    }
347
348
0
    auto current_src_array_offset = 0;
349
0
    for (int i = 0; i < input_rows_count; i++) {
350
0
        auto data_tokens = analyse_data_token(column_name, analyzer_ctx, string_col, i,
351
0
                                              array_offsets, current_src_array_offset);
352
353
        // TODO: more efficient impl
354
0
        auto find_count = 0;
355
0
        for (auto& term_info : query_tokens) {
356
0
            auto it =
357
0
                    std::find_if(data_tokens.begin(), data_tokens.end(), [&](const TermInfo& info) {
358
0
                        return info.get_single_term() == term_info.get_single_term();
359
0
                    });
360
0
            if (it != data_tokens.end()) {
361
0
                ++find_count;
362
0
            } else {
363
0
                break;
364
0
            }
365
0
        }
366
367
0
        if (find_count == query_tokens.size()) {
368
0
            result[i] = true;
369
0
        }
370
0
    }
371
372
0
    return Status::OK();
373
0
}
374
375
Status FunctionMatchPhrase::execute_match(FunctionContext* context, const std::string& column_name,
376
                                          const std::string& match_query_str,
377
                                          size_t input_rows_count, const ColumnString* string_col,
378
                                          const InvertedIndexAnalyzerCtx* analyzer_ctx,
379
                                          const ColumnArray::Offsets64* array_offsets,
380
0
                                          ColumnUInt8::Container& result) const {
381
0
    RETURN_IF_ERROR(check(context, name));
382
383
0
    auto query_tokens = analyse_query_str_token(analyzer_ctx, match_query_str, column_name);
384
0
    if (query_tokens.empty()) {
385
0
        VLOG_DEBUG << fmt::format(
386
0
                "token parser result is empty for query, "
387
0
                "please check your query: '{}' and index parser: '{}'",
388
0
                match_query_str,
389
0
                analyzer_ctx ? inverted_index_parser_type_to_string(analyzer_ctx->parser_type)
390
0
                             : "unknown");
391
0
        return Status::OK();
392
0
    }
393
394
0
    auto current_src_array_offset = 0;
395
0
    for (int i = 0; i < input_rows_count; i++) {
396
0
        auto data_tokens = analyse_data_token(column_name, analyzer_ctx, string_col, i,
397
0
                                              array_offsets, current_src_array_offset);
398
399
        // TODO: more efficient impl
400
0
        bool matched = false;
401
0
        auto data_it = data_tokens.begin();
402
0
        while (data_it != data_tokens.end()) {
403
            // find position of first token
404
0
            data_it = std::find_if(data_it, data_tokens.end(), [&](const TermInfo& info) {
405
0
                return info.get_single_term() == query_tokens[0].get_single_term();
406
0
            });
407
0
            if (data_it != data_tokens.end()) {
408
0
                matched = true;
409
0
                auto data_it_next = ++data_it;
410
0
                auto query_it = query_tokens.begin() + 1;
411
                // compare query_tokens after the first to data_tokens one by one
412
0
                while (query_it != query_tokens.end()) {
413
0
                    if (data_it_next == data_tokens.end() ||
414
0
                        data_it_next->get_single_term() != query_it->get_single_term()) {
415
0
                        matched = false;
416
0
                        break;
417
0
                    }
418
0
                    query_it++;
419
0
                    data_it_next++;
420
0
                }
421
422
0
                if (matched) {
423
0
                    break;
424
0
                }
425
0
            }
426
0
        }
427
428
        // check matched
429
0
        if (matched) {
430
0
            result[i] = true;
431
0
        }
432
0
    }
433
434
0
    return Status::OK();
435
0
}
436
437
Status FunctionMatchPhrasePrefix::execute_match(
438
        FunctionContext* context, const std::string& column_name,
439
        const std::string& match_query_str, size_t input_rows_count, const ColumnString* string_col,
440
        const InvertedIndexAnalyzerCtx* analyzer_ctx, const ColumnArray::Offsets64* array_offsets,
441
0
        ColumnUInt8::Container& result) const {
442
0
    RETURN_IF_ERROR(check(context, name));
443
444
0
    auto query_tokens = analyse_query_str_token(analyzer_ctx, match_query_str, column_name);
445
0
    if (query_tokens.empty()) {
446
0
        VLOG_DEBUG << fmt::format(
447
0
                "token parser result is empty for query, "
448
0
                "please check your query: '{}' and index parser: '{}'",
449
0
                match_query_str,
450
0
                analyzer_ctx ? inverted_index_parser_type_to_string(analyzer_ctx->parser_type)
451
0
                             : "unknown");
452
0
        return Status::OK();
453
0
    }
454
455
0
    int32_t current_src_array_offset = 0;
456
0
    for (int i = 0; i < input_rows_count; i++) {
457
0
        auto data_tokens = analyse_data_token(column_name, analyzer_ctx, string_col, i,
458
0
                                              array_offsets, current_src_array_offset);
459
460
0
        int64_t dis_count = data_tokens.size() - query_tokens.size();
461
0
        if (dis_count < 0) {
462
0
            continue;
463
0
        }
464
465
0
        for (size_t j = 0; j < dis_count + 1; j++) {
466
0
            if (data_tokens[j].get_single_term() == query_tokens[0].get_single_term() ||
467
0
                query_tokens.size() == 1) {
468
0
                bool match = true;
469
0
                for (size_t k = 0; k < query_tokens.size(); k++) {
470
0
                    const std::string& data_token = data_tokens[j + k].get_single_term();
471
0
                    const std::string& query_token = query_tokens[k].get_single_term();
472
0
                    if (k == query_tokens.size() - 1) {
473
0
                        if (data_token.compare(0, query_token.size(), query_token) != 0) {
474
0
                            match = false;
475
0
                            break;
476
0
                        }
477
0
                    } else {
478
0
                        if (data_token != query_token) {
479
0
                            match = false;
480
0
                            break;
481
0
                        }
482
0
                    }
483
0
                }
484
0
                if (match) {
485
0
                    result[i] = true;
486
0
                    break;
487
0
                }
488
0
            }
489
0
        }
490
0
    }
491
492
0
    return Status::OK();
493
0
}
494
495
Status FunctionMatchRegexp::execute_match(FunctionContext* context, const std::string& column_name,
496
                                          const std::string& match_query_str,
497
                                          size_t input_rows_count, const ColumnString* string_col,
498
                                          const InvertedIndexAnalyzerCtx* analyzer_ctx,
499
                                          const ColumnArray::Offsets64* array_offsets,
500
0
                                          ColumnUInt8::Container& result) const {
501
0
    RETURN_IF_ERROR(check(context, name));
502
503
0
    VLOG_DEBUG << "begin to run FunctionMatchRegexp::execute_match, parser_type: "
504
0
               << (analyzer_ctx ? inverted_index_parser_type_to_string(analyzer_ctx->parser_type)
505
0
                                : "unknown");
506
507
0
    const std::string& pattern = match_query_str;
508
509
0
    hs_database_t* database = nullptr;
510
0
    hs_compile_error_t* compile_err = nullptr;
511
0
    hs_scratch_t* scratch = nullptr;
512
513
0
    if (hs_compile(pattern.data(), HS_FLAG_DOTALL | HS_FLAG_ALLOWEMPTY | HS_FLAG_UTF8,
514
0
                   HS_MODE_BLOCK, nullptr, &database, &compile_err) != HS_SUCCESS) {
515
0
        std::string err_message = "hyperscan compilation failed: ";
516
0
        err_message.append(compile_err->message);
517
0
        LOG(ERROR) << err_message;
518
0
        hs_free_compile_error(compile_err);
519
0
        return Status::Error<ErrorCode::INDEX_INVALID_PARAMETERS>(err_message);
520
0
    }
521
522
0
    if (hs_alloc_scratch(database, &scratch) != HS_SUCCESS) {
523
0
        LOG(ERROR) << "hyperscan could not allocate scratch space.";
524
0
        hs_free_database(database);
525
0
        return Status::Error<ErrorCode::INDEX_INVALID_PARAMETERS>(
526
0
                "hyperscan could not allocate scratch space.");
527
0
    }
528
529
0
    auto on_match = [](unsigned int id, unsigned long long from, unsigned long long to,
530
0
                       unsigned int flags, void* context) -> int {
531
0
        *((bool*)context) = true;
532
0
        return 0;
533
0
    };
534
535
0
    try {
536
0
        auto current_src_array_offset = 0;
537
0
        for (int i = 0; i < input_rows_count; i++) {
538
0
            auto data_tokens = analyse_data_token(column_name, analyzer_ctx, string_col, i,
539
0
                                                  array_offsets, current_src_array_offset);
540
541
0
            for (auto& input : data_tokens) {
542
0
                bool is_match = false;
543
0
                const auto& input_str = input.get_single_term();
544
0
                if (hs_scan(database, input_str.data(), (uint32_t)input_str.size(), 0, scratch,
545
0
                            on_match, (void*)&is_match) != HS_SUCCESS) {
546
0
                    LOG(ERROR) << "hyperscan match failed: " << input_str;
547
0
                    break;
548
0
                }
549
550
0
                if (is_match) {
551
0
                    result[i] = true;
552
0
                    break;
553
0
                }
554
0
            }
555
0
        }
556
0
    }
557
0
    _CLFINALLY({
558
0
        hs_free_scratch(scratch);
559
0
        hs_free_database(database);
560
0
    })
561
562
0
    return Status::OK();
563
0
}
564
565
Status FunctionMatchPhraseEdge::execute_match(
566
        FunctionContext* context, const std::string& column_name,
567
        const std::string& match_query_str, size_t input_rows_count, const ColumnString* string_col,
568
        const InvertedIndexAnalyzerCtx* analyzer_ctx, const ColumnArray::Offsets64* array_offsets,
569
0
        ColumnUInt8::Container& result) const {
570
0
    RETURN_IF_ERROR(check(context, name));
571
572
0
    auto query_tokens = analyse_query_str_token(analyzer_ctx, match_query_str, column_name);
573
0
    if (query_tokens.empty()) {
574
0
        VLOG_DEBUG << fmt::format(
575
0
                "token parser result is empty for query, "
576
0
                "please check your query: '{}' and index parser: '{}'",
577
0
                match_query_str,
578
0
                analyzer_ctx ? inverted_index_parser_type_to_string(analyzer_ctx->parser_type)
579
0
                             : "unknown");
580
0
        return Status::OK();
581
0
    }
582
583
0
    int32_t current_src_array_offset = 0;
584
0
    for (int i = 0; i < input_rows_count; i++) {
585
0
        auto data_tokens = analyse_data_token(column_name, analyzer_ctx, string_col, i,
586
0
                                              array_offsets, current_src_array_offset);
587
588
0
        int64_t dis_count = data_tokens.size() - query_tokens.size();
589
0
        if (dis_count < 0) {
590
0
            continue;
591
0
        }
592
593
0
        for (size_t j = 0; j < dis_count + 1; j++) {
594
0
            bool match = true;
595
0
            if (query_tokens.size() == 1) {
596
0
                if (data_tokens[j].get_single_term().find(query_tokens[0].get_single_term()) ==
597
0
                    std::string::npos) {
598
0
                    match = false;
599
0
                }
600
0
            } else {
601
0
                for (size_t k = 0; k < query_tokens.size(); k++) {
602
0
                    const std::string& data_token = data_tokens[j + k].get_single_term();
603
0
                    const std::string& query_token = query_tokens[k].get_single_term();
604
0
                    if (k == 0) {
605
0
                        if (!data_token.ends_with(query_token)) {
606
0
                            match = false;
607
0
                            break;
608
0
                        }
609
0
                    } else if (k == query_tokens.size() - 1) {
610
0
                        if (!data_token.starts_with(query_token)) {
611
0
                            match = false;
612
0
                            break;
613
0
                        }
614
0
                    } else {
615
0
                        if (data_token != query_token) {
616
0
                            match = false;
617
0
                            break;
618
0
                        }
619
0
                    }
620
0
                }
621
0
            }
622
0
            if (match) {
623
0
                result[i] = true;
624
0
                break;
625
0
            }
626
0
        }
627
0
    }
628
629
0
    return Status::OK();
630
0
}
631
632
1
void register_function_match(SimpleFunctionFactory& factory) {
633
1
    factory.register_function<FunctionMatchAny>();
634
1
    factory.register_function<FunctionMatchAll>();
635
1
    factory.register_function<FunctionMatchPhrase>();
636
1
    factory.register_function<FunctionMatchPhrasePrefix>();
637
1
    factory.register_function<FunctionMatchRegexp>();
638
1
    factory.register_function<FunctionMatchPhraseEdge>();
639
1
}
640
#include "common/compile_check_end.h"
641
} // namespace doris::vectorized