/
rules_exceptions.cc
97 lines (77 loc) · 2.34 KB
/
rules_exceptions.cc
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
/*
* ModSecurity, http://www.modsecurity.org/
* Copyright (c) 2015 Trustwave Holdings, Inc. (http://www.trustwave.com/)
*
* 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
*
* If any of the files related to licensing are missing or if you have any
* other questions related to licensing please contact Trustwave Holdings, Inc.
* directly using the email address security@modsecurity.org.
*
*/
#include "modsecurity/rules_exceptions.h"
#include <string>
#include "src/utils.h"
namespace modsecurity {
bool RulesExceptions::load(const std::string &a, std::string *error) {
std::vector<std::string> toRemove = modsecurity::split(a, ' ');
for (std::string &a : toRemove) {
std::string b = removeBracketsIfNeeded(a);
size_t dash = b.find('-');
if (dash != std::string::npos) {
std::string n1s = std::string(b, 0, dash);
std::string n2s = std::string(b, dash + 1, b.size() - (dash + 1));
int n1n = 0;
int n2n = 0;
try {
n1n = std::stoi(n1s);
} catch (...) {
error->assign("Not a number: " + n1s);
return false;
}
try {
n2n = std::stoi(n2s);
} catch (...) {
error->assign("Not a number: " + n2s);
return false;
}
if (n1s > n2s) {
error->assign("Invalid range: " + b);
return false;
}
addRange(n1n, n2n);
} else {
try {
int num = std::stoi(b);
addNumber(num);
} catch (...) {
error->assign("Not a number or range: " + b);
return false;
}
}
}
return true;
}
bool RulesExceptions::addNumber(int a) {
m_numbers.push_back(a);
}
bool RulesExceptions::addRange(int a, int b) {
m_ranges.push_back(std::make_pair(a, b));
}
bool RulesExceptions::contains(int a) {
for (int z : m_numbers) {
if (a == z) {
return true;
}
}
for (auto z : m_ranges) {
if (z.first <= a && z.second >= a) {
return true;
}
}
return false;
}
} // namespace modsecurity