1 // Copyright 2020 The Chromium Authors
2 // Use of this source code is governed by a BSD-style license that can be
3 // found in the LICENSE file.
4
5 #include "net/base/scheme_host_port_matcher.h"
6
7 #include "base/containers/adapters.h"
8 #include "base/containers/contains.h"
9 #include "base/strings/string_tokenizer.h"
10 #include "base/strings/string_util.h"
11 #include "base/trace_event/memory_usage_estimator.h"
12
13 namespace net {
14
15 SchemeHostPortMatcher::SchemeHostPortMatcher() = default;
16 SchemeHostPortMatcher::SchemeHostPortMatcher(SchemeHostPortMatcher&& rhs) =
17 default;
18 SchemeHostPortMatcher& SchemeHostPortMatcher::operator=(
19 SchemeHostPortMatcher&& rhs) = default;
20 SchemeHostPortMatcher::~SchemeHostPortMatcher() = default;
21
22 // Declares SchemeHostPortMatcher::kParseRuleListDelimiterList[], not a
23 // redefinition. This is needed for link.
24 // static
25 constexpr char SchemeHostPortMatcher::kParseRuleListDelimiterList[];
26
27 // Declares SchemeHostPortMatcher::kPrintRuleListDelimiter, not a
28 // redefinition. This is needed for link.
29 // static
30 constexpr char SchemeHostPortMatcher::kPrintRuleListDelimiter;
31
32 // static
FromRawString(const std::string & raw)33 SchemeHostPortMatcher SchemeHostPortMatcher::FromRawString(
34 const std::string& raw) {
35 SchemeHostPortMatcher result;
36
37 base::StringTokenizer entries(raw, kParseRuleListDelimiterList);
38 while (entries.GetNext()) {
39 auto rule = SchemeHostPortMatcherRule::FromUntrimmedRawString(
40 entries.token_piece());
41 if (rule) {
42 result.AddAsLastRule(std::move(rule));
43 }
44 }
45
46 return result;
47 }
48
AddAsFirstRule(std::unique_ptr<SchemeHostPortMatcherRule> rule)49 void SchemeHostPortMatcher::AddAsFirstRule(
50 std::unique_ptr<SchemeHostPortMatcherRule> rule) {
51 DCHECK(rule);
52 rules_.insert(rules_.begin(), std::move(rule));
53 }
54
AddAsLastRule(std::unique_ptr<SchemeHostPortMatcherRule> rule)55 void SchemeHostPortMatcher::AddAsLastRule(
56 std::unique_ptr<SchemeHostPortMatcherRule> rule) {
57 DCHECK(rule);
58 rules_.push_back(std::move(rule));
59 }
60
ReplaceRule(size_t index,std::unique_ptr<SchemeHostPortMatcherRule> rule)61 void SchemeHostPortMatcher::ReplaceRule(
62 size_t index,
63 std::unique_ptr<SchemeHostPortMatcherRule> rule) {
64 DCHECK_LT(index, rules_.size());
65 rules_[index] = std::move(rule);
66 }
67
Includes(const GURL & url) const68 bool SchemeHostPortMatcher::Includes(const GURL& url) const {
69 return Evaluate(url) == SchemeHostPortMatcherResult::kInclude;
70 }
71
Evaluate(const GURL & url) const72 SchemeHostPortMatcherResult SchemeHostPortMatcher::Evaluate(
73 const GURL& url) const {
74 // Later rules override earlier rules, so evaluating the rule list can be
75 // done by iterating over it in reverse and short-circuiting when a match is
76 // found.
77 //
78 // The order of evaluation generally doesn't matter if all the rules are
79 // positive rules, so matches are just additive.
80 //
81 // However when mixing positive and negative rules, evaluation order makes a
82 // difference.
83 for (const auto& rule : base::Reversed(rules_)) {
84 SchemeHostPortMatcherResult result = rule->Evaluate(url);
85 if (result != SchemeHostPortMatcherResult::kNoMatch)
86 return result;
87 }
88
89 return SchemeHostPortMatcherResult::kNoMatch;
90 }
91
ToString() const92 std::string SchemeHostPortMatcher::ToString() const {
93 std::string result;
94 for (const auto& rule : rules_) {
95 DCHECK(!base::Contains(rule->ToString(), kParseRuleListDelimiterList));
96 result += rule->ToString();
97 result.push_back(kPrintRuleListDelimiter);
98 }
99 return result;
100 }
101
Clear()102 void SchemeHostPortMatcher::Clear() {
103 rules_.clear();
104 }
105
106 #if !BUILDFLAG(CRONET_BUILD)
EstimateMemoryUsage() const107 size_t SchemeHostPortMatcher::EstimateMemoryUsage() const {
108 return base::trace_event::EstimateMemoryUsage(rules_);
109 }
110 #endif // !BUILDFLAG(CRONET_BUILD)
111
112 } // namespace net
113