mirror of
https://github.com/ClickHouse/ClickHouse.git
synced 2024-12-19 04:42:37 +00:00
238 lines
7.1 KiB
C++
238 lines
7.1 KiB
C++
#pragma once
|
|
|
|
#include <map>
|
|
#include <memory>
|
|
#include <mutex>
|
|
#include <optional>
|
|
#include <string>
|
|
#include <utility>
|
|
#include <vector>
|
|
#include <Functions/likePatternToRegexp.h>
|
|
#include <Common/ObjectPool.h>
|
|
#include <Common/OptimizedRegularExpression.h>
|
|
#include <Common/ProfileEvents.h>
|
|
#include <Common/Exception.h>
|
|
#include <common/StringRef.h>
|
|
|
|
|
|
#include <Common/config.h>
|
|
#if USE_HYPERSCAN
|
|
# if __has_include(<hs/hs.h>)
|
|
# include <hs/hs.h>
|
|
# else
|
|
# include <hs.h>
|
|
# endif
|
|
#endif
|
|
|
|
namespace ProfileEvents
|
|
{
|
|
extern const Event RegexpCreated;
|
|
}
|
|
|
|
|
|
namespace DB
|
|
{
|
|
namespace ErrorCodes
|
|
{
|
|
extern const int CANNOT_ALLOCATE_MEMORY;
|
|
extern const int LOGICAL_ERROR;
|
|
}
|
|
|
|
namespace Regexps
|
|
{
|
|
using Regexp = OptimizedRegularExpressionImpl<false>;
|
|
using Pool = ObjectPoolMap<Regexp, String>;
|
|
|
|
template <bool like>
|
|
inline Regexp createRegexp(const std::string & pattern, int flags)
|
|
{
|
|
return {pattern, flags};
|
|
}
|
|
|
|
template <>
|
|
inline Regexp createRegexp<true>(const std::string & pattern, int flags)
|
|
{
|
|
return {likePatternToRegexp(pattern), flags};
|
|
}
|
|
|
|
template <bool like, bool no_capture>
|
|
inline Pool::Pointer get(const std::string & pattern)
|
|
{
|
|
/// C++11 has thread-safe function-local statics on most modern compilers.
|
|
static Pool known_regexps; /// Different variables for different pattern parameters.
|
|
|
|
return known_regexps.get(pattern, [&pattern]
|
|
{
|
|
int flags = OptimizedRegularExpression::RE_DOT_NL;
|
|
if (no_capture)
|
|
flags |= OptimizedRegularExpression::RE_NO_CAPTURE;
|
|
|
|
ProfileEvents::increment(ProfileEvents::RegexpCreated);
|
|
return new Regexp{createRegexp<like>(pattern, flags)};
|
|
});
|
|
}
|
|
}
|
|
|
|
#if USE_HYPERSCAN
|
|
|
|
namespace MultiRegexps
|
|
{
|
|
template <typename Deleter, Deleter deleter>
|
|
struct HyperscanDeleter
|
|
{
|
|
template <typename T>
|
|
void operator()(T * ptr) const
|
|
{
|
|
deleter(ptr);
|
|
}
|
|
};
|
|
|
|
using CompilerError = std::unique_ptr<hs_compile_error_t, HyperscanDeleter<decltype(&hs_free_compile_error), &hs_free_compile_error>>;
|
|
using ScratchPtr = std::unique_ptr<hs_scratch_t, HyperscanDeleter<decltype(&hs_free_scratch), &hs_free_scratch>>;
|
|
using DataBasePtr = std::unique_ptr<hs_database_t, HyperscanDeleter<decltype(&hs_free_database), &hs_free_database>>;
|
|
|
|
/// Database is thread safe across multiple threads and Scratch is not but we can copy it whenever we use it in the searcher
|
|
class Regexps
|
|
{
|
|
public:
|
|
Regexps(hs_database_t * db_, hs_scratch_t * scratch_) : db{db_}, scratch{scratch_} {}
|
|
|
|
hs_database_t * getDB() const { return db.get(); }
|
|
hs_scratch_t * getScratch() const { return scratch.get(); }
|
|
private:
|
|
DataBasePtr db;
|
|
ScratchPtr scratch;
|
|
};
|
|
|
|
struct Pool
|
|
{
|
|
/// Mutex for finding in map
|
|
std::mutex mutex;
|
|
/// Patterns + possible edit_distance to database and scratch
|
|
std::map<std::pair<std::vector<String>, std::optional<UInt32>>, Regexps> storage;
|
|
};
|
|
|
|
template <bool FindAnyIndex, bool CompileForEditDistance>
|
|
inline Regexps constructRegexps(const std::vector<String> & str_patterns, std::optional<UInt32> edit_distance)
|
|
{
|
|
(void)edit_distance;
|
|
/// Common pointers
|
|
std::vector<const char *> ptrns;
|
|
std::vector<unsigned int> flags;
|
|
|
|
/// Pointer for external edit distance compilation
|
|
std::vector<hs_expr_ext> ext_exprs;
|
|
std::vector<const hs_expr_ext *> ext_exprs_ptrs;
|
|
|
|
ptrns.reserve(str_patterns.size());
|
|
flags.reserve(str_patterns.size());
|
|
|
|
if constexpr (CompileForEditDistance)
|
|
{
|
|
ext_exprs.reserve(str_patterns.size());
|
|
ext_exprs_ptrs.reserve(str_patterns.size());
|
|
}
|
|
|
|
for (const StringRef ref : str_patterns)
|
|
{
|
|
ptrns.push_back(ref.data);
|
|
flags.push_back(HS_FLAG_DOTALL | HS_FLAG_ALLOWEMPTY | HS_FLAG_SINGLEMATCH | HS_FLAG_UTF8);
|
|
if constexpr (CompileForEditDistance)
|
|
{
|
|
flags.back() &= ~HS_FLAG_UTF8;
|
|
ext_exprs.emplace_back();
|
|
ext_exprs.back().flags = HS_EXT_FLAG_EDIT_DISTANCE;
|
|
ext_exprs.back().edit_distance = edit_distance.value();
|
|
ext_exprs_ptrs.push_back(&ext_exprs.back());
|
|
}
|
|
}
|
|
hs_database_t * db = nullptr;
|
|
hs_compile_error_t * compile_error;
|
|
|
|
|
|
std::unique_ptr<unsigned int[]> ids;
|
|
|
|
if constexpr (FindAnyIndex)
|
|
{
|
|
ids.reset(new unsigned int[ptrns.size()]);
|
|
for (size_t i = 0; i < ptrns.size(); ++i)
|
|
ids[i] = i + 1;
|
|
}
|
|
|
|
hs_error_t err;
|
|
if constexpr (!CompileForEditDistance)
|
|
err = hs_compile_multi(
|
|
ptrns.data(),
|
|
flags.data(),
|
|
ids.get(),
|
|
ptrns.size(),
|
|
HS_MODE_BLOCK,
|
|
nullptr,
|
|
&db,
|
|
&compile_error);
|
|
else
|
|
err = hs_compile_ext_multi(
|
|
ptrns.data(),
|
|
flags.data(),
|
|
ids.get(),
|
|
ext_exprs_ptrs.data(),
|
|
ptrns.size(),
|
|
HS_MODE_BLOCK,
|
|
nullptr,
|
|
&db,
|
|
&compile_error);
|
|
|
|
if (err != HS_SUCCESS)
|
|
{
|
|
CompilerError error(compile_error);
|
|
|
|
if (error->expression < 0)
|
|
throw Exception(String(error->message), ErrorCodes::LOGICAL_ERROR);
|
|
else
|
|
throw Exception(
|
|
"Pattern '" + str_patterns[error->expression] + "' failed with error '" + String(error->message),
|
|
ErrorCodes::LOGICAL_ERROR);
|
|
}
|
|
|
|
ProfileEvents::increment(ProfileEvents::RegexpCreated);
|
|
|
|
hs_scratch_t * scratch = nullptr;
|
|
err = hs_alloc_scratch(db, &scratch);
|
|
|
|
if (err != HS_SUCCESS)
|
|
throw Exception("Could not allocate scratch space for hyperscan", ErrorCodes::CANNOT_ALLOCATE_MEMORY);
|
|
|
|
return Regexps{db, scratch};
|
|
}
|
|
|
|
/// If CompileForEditDistance is False, edit_distance must be nullopt
|
|
template <bool FindAnyIndex, bool CompileForEditDistance>
|
|
inline Regexps * get(const std::vector<StringRef> & patterns, std::optional<UInt32> edit_distance)
|
|
{
|
|
/// C++11 has thread-safe function-local statics on most modern compilers.
|
|
static Pool known_regexps; /// Different variables for different pattern parameters.
|
|
|
|
std::vector<String> str_patterns;
|
|
str_patterns.reserve(patterns.size());
|
|
for (const StringRef & ref : patterns)
|
|
str_patterns.push_back(ref.toString());
|
|
|
|
std::unique_lock lock(known_regexps.mutex);
|
|
|
|
auto it = known_regexps.storage.find({str_patterns, edit_distance});
|
|
|
|
if (known_regexps.storage.end() == it)
|
|
it = known_regexps.storage.emplace(
|
|
std::pair{str_patterns, edit_distance},
|
|
constructRegexps<FindAnyIndex, CompileForEditDistance>(str_patterns, edit_distance)).first;
|
|
|
|
lock.unlock();
|
|
|
|
return &it->second;
|
|
}
|
|
}
|
|
|
|
#endif // USE_HYPERSCAN
|
|
|
|
}
|