mirror of
https://github.com/VectorCamp/vectorscan.git
synced 2025-09-29 19:24:25 +03:00
ng: split NGWrapper into NGHolder, ExpressionInfo
We now use NGHolder for all graph information, while other expression properties (report, flag information, etc) go in new class ExpressionInfo.
This commit is contained in:
committed by
Matthew Barr
parent
fadfab6d8c
commit
5dfae12a62
@@ -1,5 +1,5 @@
|
||||
/*
|
||||
* Copyright (c) 2015-2016, Intel Corporation
|
||||
* Copyright (c) 2015-2017, Intel Corporation
|
||||
*
|
||||
* Redistribution and use in source and binary forms, with or without
|
||||
* modification, are permitted provided that the following conditions are met:
|
||||
@@ -96,7 +96,8 @@ protected:
|
||||
const CompileContext cc(true, false, target, grey);
|
||||
ReportManager rm(cc.grey);
|
||||
ParsedExpression parsed(0, pattern.c_str(), flags, 0);
|
||||
unique_ptr<NGWrapper> g = buildWrapper(rm, cc, parsed);
|
||||
auto built_expr = buildGraph(rm, cc, parsed);
|
||||
const auto &g = built_expr.g;
|
||||
ASSERT_TRUE(g != nullptr);
|
||||
clearReports(*g);
|
||||
|
||||
|
@@ -1,5 +1,5 @@
|
||||
/*
|
||||
* Copyright (c) 2015-2016, Intel Corporation
|
||||
* Copyright (c) 2015-2017, Intel Corporation
|
||||
*
|
||||
* Redistribution and use in source and binary forms, with or without
|
||||
* modification, are permitted provided that the following conditions are met:
|
||||
@@ -73,7 +73,8 @@ protected:
|
||||
CompileContext cc(false, false, target, Grey());
|
||||
ReportManager rm(cc.grey);
|
||||
ParsedExpression parsed(0, expr.c_str(), flags, 0);
|
||||
unique_ptr<NGWrapper> g = buildWrapper(rm, cc, parsed);
|
||||
auto built_expr = buildGraph(rm, cc, parsed);
|
||||
const auto &g = built_expr.g;
|
||||
ASSERT_TRUE(g != nullptr);
|
||||
clearReports(*g);
|
||||
|
||||
@@ -306,7 +307,8 @@ protected:
|
||||
CompileContext cc(false, false, get_current_target(), Grey());
|
||||
ReportManager rm(cc.grey);
|
||||
ParsedExpression parsed(0, expr.c_str(), flags, 0);
|
||||
unique_ptr<NGWrapper> g = buildWrapper(rm, cc, parsed);
|
||||
auto built_expr = buildGraph(rm, cc, parsed);
|
||||
const auto &g = built_expr.g;
|
||||
ASSERT_TRUE(g != nullptr);
|
||||
clearReports(*g);
|
||||
|
||||
@@ -365,7 +367,8 @@ protected:
|
||||
CompileContext cc(true, false, get_current_target(), Grey());
|
||||
ParsedExpression parsed(0, expr.c_str(), flags, 0);
|
||||
ReportManager rm(cc.grey);
|
||||
unique_ptr<NGWrapper> g = buildWrapper(rm, cc, parsed);
|
||||
auto built_expr = buildGraph(rm, cc, parsed);
|
||||
const auto &g = built_expr.g;
|
||||
ASSERT_TRUE(g != nullptr);
|
||||
clearReports(*g);
|
||||
|
||||
|
@@ -1,5 +1,5 @@
|
||||
/*
|
||||
* Copyright (c) 2015, Intel Corporation
|
||||
* Copyright (c) 2015-2017, Intel Corporation
|
||||
*
|
||||
* Redistribution and use in source and binary forms, with or without
|
||||
* modification, are permitted provided that the following conditions are met:
|
||||
@@ -40,18 +40,19 @@ namespace ue2 {
|
||||
|
||||
// Helper function: construct a graph from an expression, flags and context.
|
||||
inline
|
||||
std::unique_ptr<NGWrapper> constructGraphWithCC(const std::string &expr,
|
||||
CompileContext &cc,
|
||||
unsigned flags) {
|
||||
std::unique_ptr<NGHolder> constructGraphWithCC(const std::string &expr,
|
||||
CompileContext &cc,
|
||||
unsigned flags) {
|
||||
ReportManager rm(cc.grey);
|
||||
ParsedExpression parsed(0, expr.c_str(), flags, 0);
|
||||
return buildWrapper(rm, cc, parsed);
|
||||
auto built_expr = buildGraph(rm, cc, parsed);
|
||||
return std::move(built_expr.g);
|
||||
}
|
||||
|
||||
// Helper function: construct a graph from an expression and its flags.
|
||||
inline
|
||||
std::unique_ptr<NGWrapper> constructGraph(const std::string &expr,
|
||||
unsigned flags) {
|
||||
std::unique_ptr<NGHolder> constructGraph(const std::string &expr,
|
||||
unsigned flags) {
|
||||
CompileContext cc(false, false, get_current_target(), Grey());
|
||||
return constructGraphWithCC(expr, cc, flags);
|
||||
}
|
||||
|
@@ -1,5 +1,5 @@
|
||||
/*
|
||||
* Copyright (c) 2015-2016, Intel Corporation
|
||||
* Copyright (c) 2015-2017, Intel Corporation
|
||||
*
|
||||
* Redistribution and use in source and binary forms, with or without
|
||||
* modification, are permitted provided that the following conditions are met:
|
||||
@@ -54,7 +54,7 @@ TEST(NFAGraph, RemoveEquivalence1) {
|
||||
// The graph should be merged into: a(b|c)
|
||||
CompileContext cc(false, false, get_current_target(), Grey());
|
||||
|
||||
unique_ptr<NGWrapper> graph(constructGraphWithCC("(ab|ac)", cc, 0));
|
||||
auto graph(constructGraphWithCC("(ab|ac)", cc, 0));
|
||||
ASSERT_TRUE(graph != nullptr);
|
||||
NGHolder &g = *graph;
|
||||
g.kind = NFA_SUFFIX;
|
||||
@@ -115,7 +115,7 @@ TEST(NFAGraph, RemoveEquivalence2) {
|
||||
// The graph should be merged into: (b|c)a
|
||||
CompileContext cc(false, false, get_current_target(), Grey());
|
||||
|
||||
unique_ptr<NGWrapper> graph(constructGraphWithCC("(ba|ca)", cc, 0));
|
||||
auto graph(constructGraphWithCC("(ba|ca)", cc, 0));
|
||||
ASSERT_TRUE(graph != nullptr);
|
||||
NGHolder &g = *graph;
|
||||
g.kind = NFA_SUFFIX;
|
||||
@@ -176,8 +176,7 @@ TEST(NFAGraph, RemoveEquivalence3) {
|
||||
// The graph should be merged into: a(..)+(X|Y)
|
||||
CompileContext cc(false, false, get_current_target(), Grey());
|
||||
|
||||
unique_ptr<NGWrapper> graph(constructGraphWithCC("a(..)+X|a(..)+Y", cc,
|
||||
HS_FLAG_DOTALL));
|
||||
auto graph(constructGraphWithCC("a(..)+X|a(..)+Y", cc, HS_FLAG_DOTALL));
|
||||
ASSERT_TRUE(graph != nullptr);
|
||||
NGHolder &g = *graph;
|
||||
g.kind = NFA_SUFFIX;
|
||||
@@ -266,8 +265,7 @@ TEST(NFAGraph, RemoveEquivalence4) {
|
||||
// The graph should be merged into: (X|Y)(..)+a
|
||||
CompileContext cc(false, false, get_current_target(), Grey());
|
||||
|
||||
unique_ptr<NGWrapper> graph(constructGraphWithCC("X(..)+a|Y(..)+a", cc,
|
||||
HS_FLAG_DOTALL));
|
||||
auto graph(constructGraphWithCC("X(..)+a|Y(..)+a", cc, HS_FLAG_DOTALL));
|
||||
ASSERT_TRUE(graph != nullptr);
|
||||
NGHolder &g = *graph;
|
||||
g.kind = NFA_SUFFIX;
|
||||
@@ -363,8 +361,7 @@ TEST(NFAGraph, RemoveEquivalence5) {
|
||||
// The graph should be merged into: [^\x00]*[\x00]
|
||||
CompileContext cc(false, false, get_current_target(), Grey());
|
||||
|
||||
unique_ptr<NGWrapper> graph(constructGraphWithCC("[^\\x00][^\\x00]*[\\x00]",
|
||||
cc, 0));
|
||||
auto graph(constructGraphWithCC("[^\\x00][^\\x00]*[\\x00]", cc, 0));
|
||||
ASSERT_TRUE(graph != nullptr);
|
||||
NGHolder &g = *graph;
|
||||
g.kind = NFA_PREFIX;
|
||||
@@ -420,7 +417,7 @@ TEST(NFAGraph, RemoveEquivalence5) {
|
||||
TEST(NFAGraph, RemoveEquivalence6) {
|
||||
// Build a small graph with two redundant vertices: ^(.*|.*)a
|
||||
// The graph should be merged into: a
|
||||
unique_ptr<NGWrapper> graph(constructGraph("^(.*|.*)a", HS_FLAG_DOTALL));
|
||||
auto graph(constructGraph("^(.*|.*)a", HS_FLAG_DOTALL));
|
||||
ASSERT_TRUE(graph != nullptr);
|
||||
NGHolder &g = *graph;
|
||||
|
||||
@@ -458,7 +455,7 @@ TEST(NFAGraph, RemoveEquivalence6) {
|
||||
TEST(NFAGraph, RemoveEquivalence7) {
|
||||
// Build a small graph with no redundant vertices: ^.+a
|
||||
// Make sure we don't merge anything
|
||||
unique_ptr<NGWrapper> graph(constructGraph("^.+a", HS_FLAG_DOTALL));
|
||||
auto graph(constructGraph("^.+a", HS_FLAG_DOTALL));
|
||||
ASSERT_TRUE(graph != nullptr);
|
||||
NGHolder &g = *graph;
|
||||
|
||||
|
@@ -208,7 +208,8 @@ TEST_P(MatchesTest, Check) {
|
||||
CompileContext cc(false, false, get_current_target(), Grey());
|
||||
ReportManager rm(cc.grey);
|
||||
ParsedExpression parsed(0, t.pattern.c_str(), t.flags, 0);
|
||||
auto g = buildWrapper(rm, cc, parsed);
|
||||
auto built_expr = buildGraph(rm, cc, parsed);
|
||||
const auto &g = built_expr.g;
|
||||
bool utf8 = (t.flags & HS_FLAG_UTF8) > 0;
|
||||
|
||||
set<pair<size_t, size_t>> matches;
|
||||
|
@@ -1,5 +1,5 @@
|
||||
/*
|
||||
* Copyright (c) 2015-2016, Intel Corporation
|
||||
* Copyright (c) 2015-2017, Intel Corporation
|
||||
*
|
||||
* Redistribution and use in source and binary forms, with or without
|
||||
* modification, are permitted provided that the following conditions are met:
|
||||
@@ -53,7 +53,7 @@ TEST(NFAGraph, RemoveRedundancy1) {
|
||||
// The character reachability should be merged into: [ab]c
|
||||
CompileContext cc(false, false, get_current_target(), Grey());
|
||||
|
||||
unique_ptr<NGWrapper> graph(constructGraphWithCC("(a|b)c", cc, 0));
|
||||
auto graph(constructGraphWithCC("(a|b)c", cc, 0));
|
||||
ASSERT_TRUE(graph.get() != nullptr);
|
||||
NGHolder &g = *graph;
|
||||
|
||||
@@ -95,8 +95,7 @@ TEST(NFAGraph, RemoveRedundancy2) {
|
||||
// Build a small graph with a redundant vertex: a.*b?c
|
||||
// The dot-star should swallow the 'b?', leaving a.*c
|
||||
CompileContext cc(false, false, get_current_target(), Grey());
|
||||
unique_ptr<NGWrapper> graph(constructGraphWithCC("a.*b?c", cc,
|
||||
HS_FLAG_DOTALL));
|
||||
auto graph(constructGraphWithCC("a.*b?c", cc, HS_FLAG_DOTALL));
|
||||
ASSERT_TRUE(graph.get() != nullptr);
|
||||
NGHolder &g = *graph;
|
||||
|
||||
@@ -152,8 +151,7 @@ TEST(NFAGraph, RemoveRedundancy2) {
|
||||
|
||||
TEST(NFAGraph, RemoveRedundancy3) {
|
||||
CompileContext cc(false, false, get_current_target(), Grey());
|
||||
unique_ptr<NGWrapper> graph(constructGraphWithCC("foobar.*(a|b)?teakettle",
|
||||
cc, 0));
|
||||
auto graph(constructGraphWithCC("foobar.*(a|b)?teakettle", cc, 0));
|
||||
ASSERT_TRUE(graph.get() != nullptr);
|
||||
|
||||
unsigned countBefore = num_vertices(*graph);
|
||||
@@ -166,7 +164,7 @@ TEST(NFAGraph, RemoveRedundancy3) {
|
||||
|
||||
TEST(NFAGraph, RemoveRedundancy4) {
|
||||
CompileContext cc(false, false, get_current_target(), Grey());
|
||||
unique_ptr<NGWrapper> graph(constructGraphWithCC("foo([A-Z]|a|b|q)", cc, 0));
|
||||
auto graph(constructGraphWithCC("foo([A-Z]|a|b|q)", cc, 0));
|
||||
ASSERT_TRUE(graph.get() != nullptr);
|
||||
|
||||
unsigned countBefore = num_vertices(*graph);
|
||||
@@ -178,8 +176,7 @@ TEST(NFAGraph, RemoveRedundancy4) {
|
||||
|
||||
TEST(NFAGraph, RemoveRedundancy5) {
|
||||
CompileContext cc(false, false, get_current_target(), Grey());
|
||||
unique_ptr<NGWrapper> graph(constructGraphWithCC("[0-9]?badgerbrush",
|
||||
cc, 0));
|
||||
auto graph(constructGraphWithCC("[0-9]?badgerbrush", cc, 0));
|
||||
ASSERT_TRUE(graph.get() != nullptr);
|
||||
|
||||
unsigned countBefore = num_vertices(*graph);
|
||||
|
@@ -1,5 +1,5 @@
|
||||
/*
|
||||
* Copyright (c) 2015, Intel Corporation
|
||||
* Copyright (c) 2015-2017, Intel Corporation
|
||||
*
|
||||
* Redistribution and use in source and binary forms, with or without
|
||||
* modification, are permitted provided that the following conditions are met:
|
||||
@@ -79,10 +79,10 @@ INSTANTIATE_TEST_CASE_P(NFAWidth, NFAWidthTest, ValuesIn(widthTests));
|
||||
TEST_P(NFAWidthTest, Check) {
|
||||
const WidthTest &t = GetParam();
|
||||
SCOPED_TRACE(testing::Message() << "Pattern: " << t.pattern);
|
||||
unique_ptr<NGWrapper> w(constructGraph(t.pattern, 0));
|
||||
auto g = constructGraph(t.pattern, 0);
|
||||
|
||||
ASSERT_EQ(t.minWidth, findMinWidth(*w));
|
||||
ASSERT_EQ(t.maxWidth, findMaxWidth(*w));
|
||||
ASSERT_EQ(t.minWidth, findMinWidth(*g));
|
||||
ASSERT_EQ(t.maxWidth, findMaxWidth(*g));
|
||||
}
|
||||
|
||||
// for google test
|
||||
|
Reference in New Issue
Block a user