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
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
|
/* $Id$ */
/** @file
*
* Definition of template classes that provide simple API to
* do matching between values and value filters constructed from strings.
*/
/*
* Copyright (C) 2006-2017 Oracle Corporation
*
* This file is part of VirtualBox Open Source Edition (OSE), as
* available from http://www.virtualbox.org. This file is free software;
* you can redistribute it and/or modify it under the terms of the GNU
* General Public License (GPL) as published by the Free Software
* Foundation, in version 2 as it comes in the "COPYING" file of the
* VirtualBox OSE distribution. VirtualBox OSE is distributed in the
* hope that it will be useful, but WITHOUT ANY WARRANTY of any kind.
*/
#include "Matching.h"
#include "Logging.h"
#include <stdlib.h>
#include <iprt/errcore.h>
namespace matching
{
// static
void ParsedIntervalFilter_base::parse (const char *aFilter,
ParsedIntervalFilter_base *that)
{
// initially null and valid
that->mNull = true;
that->mValid = true;
that->mErrorPosition = 0;
if (!aFilter || strncmp(aFilter, RT_STR_TUPLE("int:")) != 0)
return;
that->mNull = false;
size_t len = strlen (aFilter);
Mode mode = Single; // what's expected next
size_t start = 4, end = 4;
size_t err = 0; // less than 4 indicates success
do
{
end = strcspn(aFilter + start, ",-");
end += start;
char delim = aFilter[end];
if (delim == '-')
{
if (mode == End)
{
err = end;
break;
}
else
mode = Start;
}
// skip spaces around numbers
size_t s = start;
while (s < end && aFilter[s] == ' ') ++s;
size_t e = end - 1;
while (e > s && aFilter[e] == ' ') --e;
++e;
that->parseValue(aFilter, s, e, mode);
if (!that->mValid)
return;
if (mode == Start)
mode = End;
else if (mode == End)
mode = Single;
start = end + 1;
}
while (start <= len);
if (err >= 4)
{
that->mValid = false;
that->mErrorPosition = err;
}
}
// static
size_t ParsedIntervalFilter_base::parseValue (
const char *aFilter, size_t aStart, size_t aEnd,
bool aIsSigned, const Limits &aLimits,
Widest &val)
{
char *endptr = NULL;
int vrc = 0;
if (aIsSigned)
vrc = RTStrToInt64Ex(aFilter + aStart, &endptr, 0, &val.ll);
else
vrc = RTStrToUInt64Ex(aFilter + aStart, &endptr, 0, &val.ull);
AssertReturn(endptr, 0);
size_t parsed = endptr - aFilter;
// return parsed if not able to parse to the end
if (parsed != aEnd)
return parsed;
// return aStart if out if range
if (vrc == VWRN_NUMBER_TOO_BIG ||
(aIsSigned &&
(val.ll < aLimits.min.ll ||
val.ll > aLimits.max.ll)) ||
(!aIsSigned &&
(val.ull < aLimits.min.ull ||
val.ull > aLimits.max.ull)))
return aStart;
return parsed;
}
void ParsedBoolFilter::parse (const Bstr &aFilter)
{
mNull = false;
mValid = true;
mErrorPosition = 0;
if (aFilter.isEmpty())
{
mValueAny = true;
mValue = false;
}
else
{
mValueAny = false;
if (aFilter == L"true" || aFilter == L"yes" || aFilter == L"1")
mValue = true;
else
if (aFilter == L"false" || aFilter == L"no" || aFilter == L"0")
mValue = false;
else
mValid = false;
}
}
void ParsedRegexpFilter_base::parse (const Bstr &aFilter)
{
/// @todo (dmik) parse "rx:<regexp>" string
// note, that min/max checks must not be done, when the string
// begins with "rx:". These limits are for exact matching only!
// empty or null string means any match (see #isMatch() below),
// so we don't apply Min/Max restrictions in this case
if (!aFilter.isEmpty())
{
size_t len = aFilter.length();
if (mMinLen > 0 && len < mMinLen)
{
mNull = mValid = false;
mErrorPosition = len;
return;
}
if (mMaxLen > 0 && len > mMaxLen)
{
mNull = mValid = false;
mErrorPosition = mMaxLen;
return;
}
}
mSimple = aFilter;
mNull = false;
mValid = true;
mErrorPosition = 0;
}
bool ParsedRegexpFilter_base::isMatch (const Bstr &aValue) const
{
/// @todo (dmik) do regexp matching
// empty or null mSimple matches any match
return mSimple.isEmpty()
|| (mIgnoreCase && mSimple.compare(aValue, Bstr::CaseInsensitive) == 0)
|| (!mIgnoreCase && mSimple.compare(aValue) == 0);
}
} /* namespace matching */
/* vi: set tabstop=4 shiftwidth=4 expandtab: */
|
