Index: components/url_matcher/url_matcher.cc |
diff --git a/components/url_matcher/url_matcher.cc b/components/url_matcher/url_matcher.cc |
index de8632d730e4aa408515118b2b026f7ef0c79b3c..a9edbf513e84a6f9ba06bc0131400af84d160154 100644 |
--- a/components/url_matcher/url_matcher.cc |
+++ b/components/url_matcher/url_matcher.cc |
@@ -149,6 +149,31 @@ bool IsOriginAndPathRegexCriterion(URLMatcherCondition::Criterion criterion) { |
return criterion == URLMatcherCondition::ORIGIN_AND_PATH_MATCHES; |
} |
+// These are symbols that are not contained in 7-bit ASCII used in GURLs. |
+const char kBeginningOfURL[] = {static_cast<char>(-1), 0}; |
+const char kEndOfDomain[] = {static_cast<char>(-2), 0}; |
+const char kEndOfPath[] = {static_cast<char>(-3), 0}; |
+const char kBeginningOfQueryComponent[] = {static_cast<char>(-4), 0}; |
+const char kEndOfURL[] = {static_cast<char>(-5), 0}; |
+const char kQuerySeperator = '&'; |
Joao da Silva
2014/04/02 07:46:59
kQuerySeparator
kaliamoorthi
2014/04/02 10:56:53
Done.
|
+ |
+// This function prepares the query string by replacing query separator with a |
+// magic value (|kBeginningOfQueryComponent|). When the boolean |
+// |prepend_beginning_of_query_component| is true the function prepends the |
+// query with the same magic. This is done to locate the start of a key value |
+// pair in the query string. The parameter |query| is passed by value |
+// intentionally, since it is locally modified. |
+std::string PrepareQuery(std::string query, |
+ bool prepend_beginning_of_query_component) { |
+ for (std::string::iterator it = query.begin(); it != query.end(); ++it) { |
+ if (*it == kQuerySeperator) |
+ *it = kBeginningOfQueryComponent[0]; |
+ } |
+ return prepend_beginning_of_query_component |
+ ? kBeginningOfQueryComponent + query |
+ : query; |
+} |
+ |
} // namespace |
// |
@@ -196,7 +221,6 @@ bool URLMatcherCondition::IsFullURLCondition() const { |
switch (criterion_) { |
case HOST_CONTAINS: |
case PATH_CONTAINS: |
- case QUERY_CONTAINS: |
case URL_PREFIX: |
case URL_SUFFIX: |
case URL_CONTAINS: |
@@ -233,8 +257,8 @@ bool URLMatcherCondition::IsMatch( |
return url.path().find(string_pattern_->pattern()) != |
std::string::npos; |
case QUERY_CONTAINS: |
- return url.query().find(string_pattern_->pattern()) != |
- std::string::npos; |
+ return PrepareQuery(url.query(), false) |
+ .find(string_pattern_->pattern()) != std::string::npos; |
battre
2014/04/02 08:14:54
I think with the new syntax (CreateQueryContainsCo
kaliamoorthi
2014/04/02 10:56:53
I decorated the URL for component searches for ena
|
default: |
break; |
} |
@@ -245,14 +269,6 @@ bool URLMatcherCondition::IsMatch( |
// URLMatcherConditionFactory |
// |
-namespace { |
-// These are symbols that are not contained in 7-bit ASCII used in GURLs. |
-const char kBeginningOfURL[] = {static_cast<char>(-1), 0}; |
-const char kEndOfDomain[] = {static_cast<char>(-2), 0}; |
-const char kEndOfPath[] = {static_cast<char>(-3), 0}; |
-const char kEndOfURL[] = {static_cast<char>(-4), 0}; |
-} // namespace |
- |
URLMatcherConditionFactory::URLMatcherConditionFactory() : id_counter_(0) {} |
URLMatcherConditionFactory::~URLMatcherConditionFactory() { |
@@ -265,7 +281,8 @@ std::string URLMatcherConditionFactory::CanonicalizeURLForComponentSearches( |
const GURL& url) const { |
return kBeginningOfURL + CanonicalizeHostname(url.host()) + kEndOfDomain + |
url.path() + kEndOfPath + |
- (url.has_query() ? "?" + url.query() : std::string()) + kEndOfURL; |
+ (url.has_query() ? PrepareQuery(url.query(), true) : std::string()) + |
+ kEndOfURL; |
} |
URLMatcherCondition URLMatcherConditionFactory::CreateHostPrefixCondition( |
@@ -317,9 +334,9 @@ URLMatcherCondition URLMatcherConditionFactory::CreateQueryPrefixCondition( |
const std::string& prefix) { |
std::string pattern; |
if (!prefix.empty() && prefix[0] == '?') |
- pattern = kEndOfPath + prefix; |
+ pattern = kEndOfPath + PrepareQuery(prefix.substr(1), true); |
else |
- pattern = kEndOfPath + ('?' + prefix); |
+ pattern = kEndOfPath + PrepareQuery(prefix, true); |
return CreateCondition(URLMatcherCondition::QUERY_PREFIX, pattern); |
} |
@@ -330,25 +347,40 @@ URLMatcherCondition URLMatcherConditionFactory::CreateQuerySuffixCondition( |
return CreateQueryEqualsCondition(suffix); |
} else { |
return CreateCondition(URLMatcherCondition::QUERY_SUFFIX, |
- suffix + kEndOfURL); |
+ PrepareQuery(suffix, false) + kEndOfURL); |
} |
} |
+URLMatcherCondition |
+URLMatcherConditionFactory::CreateQueryContainsExactCondition( |
+ const std::string& str) { |
+ std::string pattern; |
+ if (!str.empty() && str[0] == '?') |
+ pattern = str.substr(1); |
+ else |
+ pattern = str; |
+ return CreateCondition(URLMatcherCondition::QUERY_CONTAINS, |
+ PrepareQuery(pattern, true)); |
+} |
+ |
URLMatcherCondition URLMatcherConditionFactory::CreateQueryContainsCondition( |
const std::string& str) { |
+ std::string pattern; |
if (!str.empty() && str[0] == '?') |
- return CreateQueryPrefixCondition(str); |
+ pattern = str.substr(1); |
else |
- return CreateCondition(URLMatcherCondition::QUERY_CONTAINS, str); |
+ pattern = str; |
+ return CreateCondition(URLMatcherCondition::QUERY_CONTAINS, |
+ PrepareQuery(pattern, false)); |
} |
URLMatcherCondition URLMatcherConditionFactory::CreateQueryEqualsCondition( |
const std::string& str) { |
std::string pattern; |
if (!str.empty() && str[0] == '?') |
- pattern = kEndOfPath + str + kEndOfURL; |
+ pattern = kEndOfPath + PrepareQuery(str.substr(1), true) + kEndOfURL; |
else |
- pattern = kEndOfPath + ('?' + str) + kEndOfURL; |
+ pattern = kEndOfPath + PrepareQuery(str, true) + kEndOfURL; |
return CreateCondition(URLMatcherCondition::QUERY_EQUALS, pattern); |
} |