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
|
/*
Copyright (C) 2021 The Falco Authors.
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, software
distributed under the License is distributed on an "AS IS" BASIS,
WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
See the License for the specific language governing permissions and
limitations under the License.
*/
#include <string.h>
#include "prefix_search.h"
using namespace std;
path_prefix_search::path_prefix_search()
{
}
path_prefix_search::~path_prefix_search()
{
}
void path_prefix_search::add_search_path(const char *path)
{
bool dummy = true;
return path_prefix_map<bool>::add_search_path(path, dummy);
}
void path_prefix_search::add_search_path(const filter_value_t &path)
{
bool dummy = true;
return path_prefix_map<bool>::add_search_path(path, dummy);
}
void path_prefix_search::add_search_path(const std::string &str)
{
bool dummy = true;
return path_prefix_map<bool>::add_search_path(str, dummy);
}
bool path_prefix_search::match(const char *path)
{
const bool *val = path_prefix_map<bool>::match(path);
return (val != NULL);
}
bool path_prefix_search::match(const filter_value_t &path)
{
const bool *val = path_prefix_map<bool>::match(path);
return (val != NULL);
}
std::string path_prefix_search::as_string()
{
return path_prefix_map<bool>::as_string(false);
}
void path_prefix_map_ut::split_path(const filter_value_t &path, filter_components_t &components)
{
components.clear();
uint8_t *pos = path.first;
while (pos < path.first + path.second)
{
uint8_t *sep = (uint8_t *) memchr((char *) pos, '/', path.second - (pos - path.first));
if (sep)
{
if (sep-pos > 0)
{
components.emplace_back(pos, sep-pos);
}
pos = sep + 1;
}
else
{
components.emplace_back(pos, path.second - (pos - path.first));
pos = path.first + path.second + 1;
}
}
}
|
