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
|
// Copyright 2020 The Chromium Authors
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
#include "net/base/scheme_host_port_matcher.h"
#include "base/containers/adapters.h"
#include "base/containers/contains.h"
#include "base/strings/string_tokenizer.h"
#include "base/strings/string_util.h"
#include "base/trace_event/memory_usage_estimator.h"
namespace net {
SchemeHostPortMatcher::SchemeHostPortMatcher() = default;
SchemeHostPortMatcher::SchemeHostPortMatcher(SchemeHostPortMatcher&& rhs) =
default;
SchemeHostPortMatcher& SchemeHostPortMatcher::operator=(
SchemeHostPortMatcher&& rhs) = default;
SchemeHostPortMatcher::~SchemeHostPortMatcher() = default;
// Declares SchemeHostPortMatcher::kParseRuleListDelimiterList[], not a
// redefinition. This is needed for link.
// static
constexpr char SchemeHostPortMatcher::kParseRuleListDelimiterList[];
// Declares SchemeHostPortMatcher::kPrintRuleListDelimiter, not a
// redefinition. This is needed for link.
// static
constexpr char SchemeHostPortMatcher::kPrintRuleListDelimiter;
// static
SchemeHostPortMatcher SchemeHostPortMatcher::FromRawString(
const std::string& raw) {
SchemeHostPortMatcher result;
base::StringTokenizer entries(raw, kParseRuleListDelimiterList);
while (entries.GetNext()) {
auto rule = SchemeHostPortMatcherRule::FromUntrimmedRawString(
entries.token_piece());
if (rule) {
result.AddAsLastRule(std::move(rule));
}
}
return result;
}
void SchemeHostPortMatcher::AddAsFirstRule(
std::unique_ptr<SchemeHostPortMatcherRule> rule) {
DCHECK(rule);
rules_.insert(rules_.begin(), std::move(rule));
}
void SchemeHostPortMatcher::AddAsLastRule(
std::unique_ptr<SchemeHostPortMatcherRule> rule) {
DCHECK(rule);
rules_.push_back(std::move(rule));
}
void SchemeHostPortMatcher::ReplaceRule(
size_t index,
std::unique_ptr<SchemeHostPortMatcherRule> rule) {
DCHECK_LT(index, rules_.size());
rules_[index] = std::move(rule);
}
bool SchemeHostPortMatcher::Includes(const GURL& url) const {
return Evaluate(url) == SchemeHostPortMatcherResult::kInclude;
}
SchemeHostPortMatcherResult SchemeHostPortMatcher::Evaluate(
const GURL& url) const {
// Later rules override earlier rules, so evaluating the rule list can be
// done by iterating over it in reverse and short-circuiting when a match is
// found.
//
// The order of evaluation generally doesn't matter if all the rules are
// positive rules, so matches are just additive.
//
// However when mixing positive and negative rules, evaluation order makes a
// difference.
for (const auto& rule : base::Reversed(rules_)) {
SchemeHostPortMatcherResult result = rule->Evaluate(url);
if (result != SchemeHostPortMatcherResult::kNoMatch)
return result;
}
return SchemeHostPortMatcherResult::kNoMatch;
}
std::string SchemeHostPortMatcher::ToString() const {
std::string result;
for (const auto& rule : rules_) {
DCHECK(!base::Contains(rule->ToString(), kParseRuleListDelimiterList));
result += rule->ToString();
result.push_back(kPrintRuleListDelimiter);
}
return result;
}
void SchemeHostPortMatcher::Clear() {
rules_.clear();
}
#if !BUILDFLAG(CRONET_BUILD)
size_t SchemeHostPortMatcher::EstimateMemoryUsage() const {
return base::trace_event::EstimateMemoryUsage(rules_);
}
#endif // !BUILDFLAG(CRONET_BUILD)
} // namespace net
|
