mirror of
https://github.com/zeek/zeek.git
synced 2025-10-02 06:38:20 +00:00
db1c70b32e
When friend'ing a global function via qualified-id, Clang complains if it's not been previously declared.
78 lines
1.5 KiB
C++
78 lines
1.5 KiB
C++
#ifndef binpac_regex_h
|
|
#define binpac_regex_h
|
|
|
|
#include "binpac.h"
|
|
#include "RE.h"
|
|
|
|
class RE_Matcher;
|
|
|
|
namespace binpac
|
|
{
|
|
|
|
// Must be called before any binpac functionality is used.
|
|
//
|
|
// Note, this must be declared/defined here, and inline, because the RE
|
|
// functionality can only be used when compiling from inside Bro.
|
|
inline void init();
|
|
|
|
// Internal vector recording not yet compiled matchers.
|
|
extern std::vector<RE_Matcher*>* uncompiled_re_matchers;
|
|
|
|
class RegExMatcher {
|
|
public:
|
|
RegExMatcher(const char *pattern)
|
|
: pattern_(pattern)
|
|
{
|
|
if ( ! uncompiled_re_matchers )
|
|
uncompiled_re_matchers = new std::vector<RE_Matcher*>;
|
|
|
|
re_matcher_ = new RE_Matcher(pattern_.c_str());
|
|
uncompiled_re_matchers->push_back(re_matcher_);
|
|
}
|
|
|
|
~RegExMatcher()
|
|
{
|
|
delete re_matcher_;
|
|
}
|
|
|
|
// Returns the length of longest match, or -1 on mismatch.
|
|
int MatchPrefix(const_byteptr data, int len)
|
|
{
|
|
return re_matcher_->MatchPrefix(data, len);
|
|
}
|
|
|
|
private:
|
|
friend void ::binpac::init();
|
|
|
|
// Function, and state, for compiling matchers.
|
|
static void init();
|
|
|
|
string pattern_;
|
|
RE_Matcher *re_matcher_;
|
|
};
|
|
|
|
inline void RegExMatcher::init()
|
|
{
|
|
if ( ! uncompiled_re_matchers )
|
|
return;
|
|
|
|
for ( size_t i = 0; i < uncompiled_re_matchers->size(); ++i )
|
|
{
|
|
if ( ! (*uncompiled_re_matchers)[i]->Compile() )
|
|
{
|
|
fprintf(stderr, "binpac: cannot compile regular expression\n");
|
|
exit(1);
|
|
}
|
|
}
|
|
|
|
uncompiled_re_matchers->clear();
|
|
}
|
|
|
|
inline void init()
|
|
{
|
|
RegExMatcher::init();
|
|
}
|
|
|
|
} // namespace binpac
|
|
|
|
#endif // binpac_regex_h
|