Chromium Code Reviews
chromiumcodereview-hr@appspot.gserviceaccount.com (chromiumcodereview-hr) | Please choose your nickname with Settings | Help | Chromium Project | Gerrit Changes | Sign out
(5)

Side by Side Diff: components/feedback/anonymizer_tool.cc

Issue 1543633003: Added anonymization patterns for URLs and email addresses (Closed) Base URL: https://chromium.googlesource.com/chromium/src.git@bug-567870-introduce-anonymizer
Patch Set: Fixed includes Created 4 years, 11 months ago
Use n/p to move between diff chunks; N/P to move between comments. Draft comments are only viewable by you.
Jump to:
View unified diff | Download patch
« no previous file with comments | « components/feedback/anonymizer_tool.h ('k') | components/feedback/anonymizer_tool_unittest.cc » ('j') | no next file with comments »
Toggle Intra-line Diffs ('i') | Expand Comments ('e') | Collapse Comments ('c') | Show Comments Hide Comments ('s')
OLDNEW
1 // Copyright 2015 The Chromium Authors. All rights reserved. 1 // Copyright 2015 The Chromium Authors. All rights reserved.
2 // Use of this source code is governed by a BSD-style license that can be 2 // Use of this source code is governed by a BSD-style license that can be
3 // found in the LICENSE file. 3 // found in the LICENSE file.
4 4
5 #include "components/feedback/anonymizer_tool.h" 5 #include "components/feedback/anonymizer_tool.h"
6 6
7 #include <base/strings/string_number_conversions.h> 7 #include <utility>
8 #include <base/strings/string_util.h> 8
9 #include <base/strings/stringprintf.h> 9 #include "base/strings/string_number_conversions.h"
10 #include "base/strings/string_util.h"
11 #include "base/strings/stringprintf.h"
10 12
11 #include "third_party/re2/src/re2/re2.h" 13 #include "third_party/re2/src/re2/re2.h"
12 14
13 using re2::RE2; 15 using re2::RE2;
14 16
15 namespace feedback { 17 namespace feedback {
16 18
17 namespace { 19 namespace {
18 20
19 // The |kCustomPatterns| array defines patterns to match and anonymize. Each 21 // The |kCustomPatternsWithContext| array defines patterns to match and
20 // pattern needs to define three capturing parentheses groups: 22 // anonymize. Each pattern needs to define three capturing parentheses groups:
21 // 23 //
22 // - a group for the pattern before the identifier to be anonymized; 24 // - a group for the pattern before the identifier to be anonymized;
23 // - a group for the identifier to be anonymized; 25 // - a group for the identifier to be anonymized;
24 // - a group for the pattern after the identifier to be anonymized. 26 // - a group for the pattern after the identifier to be anonymized.
25 // 27 //
28 // The first and the last capture group are the origin of the "WithContext"
29 // suffix in the name of this constant.
30 //
26 // Every matched identifier (in the context of the whole pattern) is anonymized 31 // Every matched identifier (in the context of the whole pattern) is anonymized
27 // by replacing it with an incremental instance identifier. Every different 32 // by replacing it with an incremental instance identifier. Every different
28 // pattern defines a separate instance identifier space. See the unit test for 33 // pattern defines a separate instance identifier space. See the unit test for
29 // AnonymizerTool::AnonymizeCustomPattern for pattern anonymization examples. 34 // AnonymizerTool::AnonymizeCustomPattern for pattern anonymization examples.
30 // 35 //
31 // Useful regular expression syntax: 36 // Useful regular expression syntax:
32 // 37 //
33 // +? is a non-greedy (lazy) +. 38 // +? is a non-greedy (lazy) +.
34 // \b matches a word boundary. 39 // \b matches a word boundary.
35 // (?i) turns on case insensitivy for the remainder of the regex. 40 // (?i) turns on case insensitivy for the remainder of the regex.
36 // (?-s) turns off "dot matches newline" for the remainder of the regex. 41 // (?-s) turns off "dot matches newline" for the remainder of the regex.
37 // (?:regex) denotes non-capturing parentheses group. 42 // (?:regex) denotes non-capturing parentheses group.
38 const char* kCustomPatterns[] = { 43 const char* kCustomPatternsWithContext[] = {
39 "(\\bCell ID: ')([0-9a-fA-F]+)(')", // ModemManager 44 "(\\bCell ID: ')([0-9a-fA-F]+)(')", // ModemManager
40 "(\\bLocation area code: ')([0-9a-fA-F]+)(')", // ModemManager 45 "(\\bLocation area code: ')([0-9a-fA-F]+)(')", // ModemManager
41 "(?i-s)(\\bssid[= ]')(.+)(')", // wpa_supplicant 46 "(?i-s)(\\bssid[= ]')(.+)(')", // wpa_supplicant
42 "(?-s)(\\bSSID - hexdump\\(len=[0-9]+\\): )(.+)()", // wpa_supplicant 47 "(?-s)(\\bSSID - hexdump\\(len=[0-9]+\\): )(.+)()", // wpa_supplicant
43 "(?-s)(\\[SSID=)(.+?)(\\])", // shill 48 "(?-s)(\\[SSID=)(.+?)(\\])", // shill
44 }; 49 };
45 50
51 // Helper macro: Non capturing group
52 #define NCG(x) "(?:" x ")"
53 // Helper macro: Optional non capturing group
54 #define OPT_NCG(x) NCG(x) "?"
55
56 //////////////////////////////////////////////////////////////////////////
57 // Patterns for URLs, or better IRIs, based on RFC 3987 with an artificial
58 // limitation on the scheme to increase precision. Otherwise anything
59 // like "ID:" would be considered an IRI.
60
61 #define UNRESERVED "[-a-z0-9._~]"
62 #define RESERVED NGC(GEN_DELIMS "|" SUB_DELIMS)
63 #define SUB_DELIMS "[!$&'()*+,;=]"
64 #define GEN_DELIMS "[:/?#[\\]@]"
65
66 #define DIGIT "[0-9]"
67 #define HEXDIG "[0-9a-f]"
68
69 #define PCT_ENCODED "%" HEXDIG HEXDIG
70
71 #define DEC_OCTET NCG("[0-9]|[1-9][0-9]|1[0-9][0-9]|2[0-4][0-9]|25[0-9]")
72
73 #define IPV4ADDRESS DEC_OCTET "\\." DEC_OCTET "\\." DEC_OCTET "\\." DEC_OCTET
74
75 #define H16 NCG(HEXDIG) "{1,4}"
76 #define LS32 NCG(H16 ":" H16 "|" IPV4ADDRESS)
77
78 #define IPV6ADDRESS NCG( \
79 NCG(H16 ":") "{6}" LS32 "|" \
80 "::" NCG(H16 ":") "{5}" LS32 "|" \
81 OPT_NCG( H16) "::" NCG(H16 ":") "{4}" LS32 "|" \
82 OPT_NCG( NCG(H16 ":") "{0,1}" H16) "::" NCG(H16 ":") "{3}" LS32 "|" \
83 OPT_NCG( NCG(H16 ":") "{0,2}" H16) "::" NCG(H16 ":") "{2}" LS32 "|" \
84 OPT_NCG( NCG(H16 ":") "{0,3}" H16) "::" NCG(H16 ":") LS32 "|" \
85 OPT_NCG( NCG(H16 ":") "{0,4}" H16) "::" LS32 "|" \
86 OPT_NCG( NCG(H16 ":") "{0,5}" H16) "::" H16 "|" \
87 OPT_NCG( NCG(H16 ":") "{0,6}" H16) "::")
88
89 #define IPVFUTURE \
90 "v" HEXDIG \
91 "+" \
92 "\\." NCG(UNRESERVED "|" SUB_DELIMS \
93 "|" \
94 ":") "+"
95
96 #define IP_LITERAL "\\[" NCG(IPV6ADDRESS "|" IPVFUTURE) "\\]"
97
98 #define PORT DIGIT "*"
99
100 // This is a diversion of RFC 3987
101 #define SCHEME NCG("http|https|ftp|chrome|chrome-extension|android")
102
103 #define IPRIVATE \
104 "[" \
105 "\\x{E000}-\\x{F8FF}" \
106 "\\x{F0000}-\\x{FFFFD}" \
107 "\\x{100000}-\\x{10FFFD}" \
108 "]"
109
110 #define UCSCHAR \
111 "[" "\\x{A0}-\\x{D7FF}" "\\x{F900}-\\x{FDCF}" "\\x{FDF0}-\\x{FFEF}" \
112 "\\x{10000}-\\x{1FFFD}" "\\x{20000}-\\x{2FFFD}" "\\x{30000}-\\x{3FFFD}" \
113 "\\x{40000}-\\x{4FFFD}" "\\x{50000}-\\x{5FFFD}" "\\x{60000}-\\x{6FFFD}" \
114 "\\x{70000}-\\x{7FFFD}" "\\x{80000}-\\x{8FFFD}" "\\x{90000}-\\x{9FFFD}" \
115 "\\x{A0000}-\\x{AFFFD}" "\\x{B0000}-\\x{BFFFD}" "\\x{C0000}-\\x{CFFFD}" \
116 "\\x{D0000}-\\x{DFFFD}" "\\x{E1000}-\\x{EFFFD}" "]"
117
118 #define IUNRESERVED NCG("[-a-z0-9._~]" "|" UCSCHAR)
119
120 #define IPCHAR NCG(IUNRESERVED "|" PCT_ENCODED "|" SUB_DELIMS "|" "[:@]")
121 #define IFRAGMENT NCG(IPCHAR "|" "[/?]") "*"
122 #define IQUERY NCG(IPCHAR "|" IPRIVATE "|" "[/?]") "*"
123
124 #define ISEGMENT IPCHAR "*"
125 #define ISEGMENT_NZ IPCHAR "+"
126 #define ISEGMENT_NZ_NC \
127 NCG(IUNRESERVED "|" PCT_ENCODED "|" SUB_DELIMS \
128 "|" "@") "+"
129
130 #define IPATH_EMPTY ""
131 #define IPATH_ROOTLESS ISEGMENT_NZ NCG("/" ISEGMENT) "*"
132 #define IPATH_NOSCHEME ISEGMENT_NZ_NC NCG("/" ISEGMENT) "*"
133 #define IPATH_ABSOLUTE "/" OPT_NCG(ISEGMENT_NZ NCG("/" ISEGMENT) "*")
134 #define IPATH_ABEMPTY NCG("/" ISEGMENT) "*"
135
136 #define IPATH NCG(IPATH_ABEMPTY "|" IPATH_ABSOLUTE "|" IPATH_NOSCHEME "|" \
137 IPATH_ROOTLESS "|" IPATH_EMPTY)
138
139 #define IREG_NAME NCG(IUNRESERVED "|" PCT_ENCODED "|" SUB_DELIMS) "*"
140
141 #define IHOST NCG(IP_LITERAL "|" IPV4ADDRESS "|" IREG_NAME)
142 #define IUSERINFO NCG(IUNRESERVED "|" PCT_ENCODED "|" SUB_DELIMS "|" ":") "*"
143 #define IAUTHORITY OPT_NCG(IUSERINFO "@") IHOST OPT_NCG(":" PORT)
144
145 #define IRELATIVE_PART NCG("//" IAUTHORITY IPATH_ABEMPTY "|" IPATH_ABSOLUTE \
146 "|" IPATH_NOSCHEME "|" IPATH_EMPTY)
147
148 #define IRELATIVE_REF IRELATIVE_PART OPT_NCG("?" IQUERY) OPT_NCG("#" IFRAGMENT)
149
150 // RFC 3987 requires IPATH_EMPTY here but it is omitted so that statements
151 // that end with "Android:" for example are not considered a URL.
152 #define IHIER_PART NCG("//" IAUTHORITY IPATH_ABEMPTY "|" IPATH_ABSOLUTE \
153 "|" IPATH_ROOTLESS)
154
155 #define ABSOLUTE_IRI SCHEME ":" IHIER_PART OPT_NCG("?" IQUERY)
156
157 #define IRI SCHEME ":" IHIER_PART OPT_NCG("\\?" IQUERY) OPT_NCG("#" IFRAGMENT)
158
159 #define IRI_REFERENCE NCG(IRI "|" IRELATIVE_REF)
160
161 // TODO(battre): Use http://tools.ietf.org/html/rfc5322 to represent email
162 // addresses. Capture names as well ("First Lastname" <foo@bar.com>).
163
164 // The |kCustomPatternWithoutContext| array defines further patterns to match
165 // and anonymize. Each pattern consists of a single capturing group.
166 CustomPatternWithoutContext kCustomPatternsWithoutContext[] = {
167 {"URL", "(?i)(" IRI ")"},
168 // Email Addresses need to come after URLs because they can be part
169 // of a query parameter.
170 {"email", "(?i)([0-9a-z._%+-]+@[a-z0-9.-]+\\.[a-z]{2,6})"},
171 // IP filter rules need to come after URLs so that they don't disturb the
172 // URL pattern in case the IP address is part of a URL.
173 {"IPv4", "(?i)(" IPV4ADDRESS ")"},
174 {"IPv6", "(?i)(" IPV6ADDRESS ")"},
175 };
176
177 // Like RE2's FindAndConsume, searches for the first occurrence of |pattern| in
178 // |input| and consumes the bytes until the end of the pattern matching. Unlike
179 // FindAndConsume, the bytes skipped before the match of |pattern| are stored
180 // in |skipped_input|.
vasilii 2016/01/11 10:54:29 I think it's misleading because if you pass no arg
battre 2016/01/11 10:59:23 I have added an example. Is it clearer now?
vasilii 2016/01/11 11:58:32 The comment is false. Something meaningful is stor
battre 2016/01/11 12:33:08 Done.
181 bool FindAndConsumeAndGetSkippedN(re2::StringPiece* input,
182 const re2::RE2& pattern,
183 re2::StringPiece* skipped_input,
184 re2::StringPiece* args[],
185 int argc) {
186 re2::StringPiece old_input = *input;
187
188 re2::RE2::Arg a0(argc > 0 ? args[0] : nullptr);
189 re2::RE2::Arg a1(argc > 1 ? args[1] : nullptr);
190 re2::RE2::Arg a2(argc > 2 ? args[2] : nullptr);
191 const re2::RE2::Arg* const wrapped_args[] = {&a0, &a1, &a2};
192 CHECK_LE(argc, 3);
193
194 bool result = re2::RE2::FindAndConsumeN(input, pattern, wrapped_args, argc);
195
196 if (skipped_input && result && argc > 0) {
197 size_t bytes_skipped = args[0]->data() - old_input.data();
198 *skipped_input = re2::StringPiece(old_input.data(), bytes_skipped);
199 }
200 return result;
201 }
202
203 // All |match_groups| need to be of type re2::StringPiece*.
204 template <typename... Arg>
205 bool FindAndConsumeAndGetSkipped(re2::StringPiece* input,
206 const re2::RE2& pattern,
207 re2::StringPiece* skipped_input,
208 Arg*... match_groups) {
209 re2::StringPiece* args[] = {match_groups...};
210 return FindAndConsumeAndGetSkippedN(input, pattern, skipped_input, args,
211 arraysize(args));
212 }
213
46 } // namespace 214 } // namespace
47 215
48 AnonymizerTool::AnonymizerTool() 216 AnonymizerTool::AnonymizerTool()
49 : custom_patterns_(arraysize(kCustomPatterns)) {} 217 : custom_patterns_with_context_(arraysize(kCustomPatternsWithContext)),
218 custom_patterns_without_context_(
219 arraysize(kCustomPatternsWithoutContext)) {}
50 220
51 AnonymizerTool::~AnonymizerTool() {} 221 AnonymizerTool::~AnonymizerTool() {}
52 222
53 std::string AnonymizerTool::Anonymize(const std::string& input) { 223 std::string AnonymizerTool::Anonymize(const std::string& input) {
54 std::string anonymized = AnonymizeMACAddresses(input); 224 std::string anonymized = AnonymizeMACAddresses(input);
55 anonymized = AnonymizeCustomPatterns(std::move(anonymized)); 225 anonymized = AnonymizeCustomPatterns(std::move(anonymized));
56 return anonymized; 226 return anonymized;
57 } 227 }
58 228
229 RE2* AnonymizerTool::GetRegExp(const std::string& pattern) {
230 if (regexp_cache_.find(pattern) == regexp_cache_.end()) {
231 RE2::Options options;
232 // set_multiline of pcre is not supported by RE2, yet.
233 options.set_dot_nl(true); // Dot matches a new line.
234 scoped_ptr<RE2> re = make_scoped_ptr(new RE2(pattern, options));
235 DCHECK_EQ(re2::RE2::NoError, re->error_code())
236 << "Failed to parse:\n" << pattern << "\n" << re->error();
237 regexp_cache_[pattern] = std::move(re);
238 }
239 return regexp_cache_[pattern].get();
240 }
241
59 std::string AnonymizerTool::AnonymizeMACAddresses(const std::string& input) { 242 std::string AnonymizerTool::AnonymizeMACAddresses(const std::string& input) {
60 // This regular expression finds the next MAC address. It splits the data into 243 // This regular expression finds the next MAC address. It splits the data into
61 // a section preceding the MAC address, an OUI (Organizationally Unique 244 // an OUI (Organizationally Unique Identifier) part and a NIC (Network
62 // Identifier) part and a NIC (Network Interface Controller) specific part. 245 // Interface Controller) specific part.
63 246
64 RE2::Options options; 247 RE2* mac_re = GetRegExp(
65 // set_multiline of pcre is not supported by RE2, yet. 248 "([0-9a-fA-F][0-9a-fA-F]:"
66 options.set_dot_nl(true); // Dot matches a new line.
67 RE2 mac_re(
68 "(.*?)("
69 "[0-9a-fA-F][0-9a-fA-F]:"
70 "[0-9a-fA-F][0-9a-fA-F]:" 249 "[0-9a-fA-F][0-9a-fA-F]:"
71 "[0-9a-fA-F][0-9a-fA-F]):(" 250 "[0-9a-fA-F][0-9a-fA-F]):("
72 "[0-9a-fA-F][0-9a-fA-F]:" 251 "[0-9a-fA-F][0-9a-fA-F]:"
73 "[0-9a-fA-F][0-9a-fA-F]:" 252 "[0-9a-fA-F][0-9a-fA-F]:"
74 "[0-9a-fA-F][0-9a-fA-F])", 253 "[0-9a-fA-F][0-9a-fA-F])");
75 options);
76 254
77 std::string result; 255 std::string result;
78 result.reserve(input.size()); 256 result.reserve(input.size());
79 257
80 // Keep consuming, building up a result string as we go. 258 // Keep consuming, building up a result string as we go.
81 re2::StringPiece text(input); 259 re2::StringPiece text(input);
82 std::string pre_mac, oui, nic; 260 re2::StringPiece skipped;
83 while (re2::RE2::Consume(&text, mac_re, RE2::Arg(&pre_mac), RE2::Arg(&oui), 261 re2::StringPiece pre_mac, oui, nic;
84 RE2::Arg(&nic))) { 262 while (FindAndConsumeAndGetSkipped(&text, *mac_re, &skipped, &oui, &nic)) {
85 // Look up the MAC address in the hash. 263 // Look up the MAC address in the hash.
86 oui = base::ToLowerASCII(oui); 264 std::string oui_string = base::ToLowerASCII(oui.as_string());
87 nic = base::ToLowerASCII(nic); 265 std::string nic_string = base::ToLowerASCII(nic.as_string());
88 std::string mac = oui + ":" + nic; 266 std::string mac = oui_string + ":" + nic_string;
89 std::string replacement_mac = mac_addresses_[mac]; 267 std::string replacement_mac = mac_addresses_[mac];
90 if (replacement_mac.empty()) { 268 if (replacement_mac.empty()) {
91 // If not found, build up a replacement MAC address by generating a new 269 // If not found, build up a replacement MAC address by generating a new
92 // NIC part. 270 // NIC part.
93 int mac_id = mac_addresses_.size(); 271 int mac_id = mac_addresses_.size();
94 replacement_mac = base::StringPrintf( 272 replacement_mac = base::StringPrintf(
95 "%s:%02x:%02x:%02x", oui.c_str(), (mac_id & 0x00ff0000) >> 16, 273 "%s:%02x:%02x:%02x", oui_string.c_str(), (mac_id & 0x00ff0000) >> 16,
96 (mac_id & 0x0000ff00) >> 8, (mac_id & 0x000000ff)); 274 (mac_id & 0x0000ff00) >> 8, (mac_id & 0x000000ff));
97 mac_addresses_[mac] = replacement_mac; 275 mac_addresses_[mac] = replacement_mac;
98 } 276 }
99 277
100 result += pre_mac; 278 skipped.AppendToString(&result);
101 result += replacement_mac; 279 result += replacement_mac;
102 } 280 }
103 281
104 text.AppendToString(&result); 282 text.AppendToString(&result);
105 return result; 283 return result;
106 } 284 }
107 285
108 std::string AnonymizerTool::AnonymizeCustomPatterns(std::string input) { 286 std::string AnonymizerTool::AnonymizeCustomPatterns(std::string input) {
109 for (size_t i = 0; i < arraysize(kCustomPatterns); i++) { 287 for (size_t i = 0; i < arraysize(kCustomPatternsWithContext); i++) {
110 input = 288 input =
111 AnonymizeCustomPattern(input, kCustomPatterns[i], &custom_patterns_[i]); 289 AnonymizeCustomPatternWithContext(input, kCustomPatternsWithContext[i],
290 &custom_patterns_with_context_[i]);
291 }
292 for (size_t i = 0; i < arraysize(kCustomPatternsWithoutContext); i++) {
293 input = AnonymizeCustomPatternWithoutContext(
294 input, kCustomPatternsWithoutContext[i],
295 &custom_patterns_without_context_[i]);
112 } 296 }
113 return input; 297 return input;
114 } 298 }
115 299
116 // static 300 std::string AnonymizerTool::AnonymizeCustomPatternWithContext(
117 std::string AnonymizerTool::AnonymizeCustomPattern(
118 const std::string& input, 301 const std::string& input,
119 const std::string& pattern, 302 const std::string& pattern,
120 std::map<std::string, std::string>* identifier_space) { 303 std::map<std::string, std::string>* identifier_space) {
121 RE2::Options options; 304 RE2* re = GetRegExp(pattern);
122 // set_multiline of pcre is not supported by RE2, yet. 305 DCHECK_EQ(3, re->NumberOfCapturingGroups());
123 options.set_dot_nl(true); // Dot matches a new line.
124 RE2 re("(.*?)" + pattern, options);
125 DCHECK_EQ(4, re.NumberOfCapturingGroups());
126 306
127 std::string result; 307 std::string result;
128 result.reserve(input.size()); 308 result.reserve(input.size());
129 309
130 // Keep consuming, building up a result string as we go. 310 // Keep consuming, building up a result string as we go.
131 re2::StringPiece text(input); 311 re2::StringPiece text(input);
132 std::string pre_match, pre_matched_id, matched_id, post_matched_id; 312 re2::StringPiece skipped;
133 while (RE2::Consume(&text, re, RE2::Arg(&pre_match), 313 re2::StringPiece pre_match, pre_matched_id, matched_id, post_matched_id;
134 RE2::Arg(&pre_matched_id), RE2::Arg(&matched_id), 314 while (FindAndConsumeAndGetSkipped(&text, *re, &skipped, &pre_matched_id,
135 RE2::Arg(&post_matched_id))) { 315 &matched_id, &post_matched_id)) {
136 std::string replacement_id = (*identifier_space)[matched_id]; 316 std::string matched_id_as_string = matched_id.as_string();
317 std::string replacement_id = (*identifier_space)[matched_id_as_string];
137 if (replacement_id.empty()) { 318 if (replacement_id.empty()) {
138 replacement_id = base::IntToString(identifier_space->size()); 319 replacement_id = base::IntToString(identifier_space->size());
139 (*identifier_space)[matched_id] = replacement_id; 320 (*identifier_space)[matched_id_as_string] = replacement_id;
140 } 321 }
141 322
142 result += pre_match; 323 skipped.AppendToString(&result);
143 result += pre_matched_id; 324 pre_matched_id.AppendToString(&result);
144 result += replacement_id; 325 result += replacement_id;
145 result += post_matched_id; 326 post_matched_id.AppendToString(&result);
146 } 327 }
147 text.AppendToString(&result); 328 text.AppendToString(&result);
148 return result; 329 return result;
330 }
331
332 std::string AnonymizerTool::AnonymizeCustomPatternWithoutContext(
333 const std::string& input,
334 const CustomPatternWithoutContext& pattern,
335 std::map<std::string, std::string>* identifier_space) {
336 RE2* re = GetRegExp(pattern.pattern);
337 DCHECK_EQ(1, re->NumberOfCapturingGroups());
338
339 std::string result;
340 result.reserve(input.size());
341
342 // Keep consuming, building up a result string as we go.
343 re2::StringPiece text(input);
344 re2::StringPiece skipped;
345 re2::StringPiece matched_id;
346 while (FindAndConsumeAndGetSkipped(&text, *re, &skipped, &matched_id)) {
347 std::string matched_id_as_string = matched_id.as_string();
348 std::string replacement_id = (*identifier_space)[matched_id_as_string];
349 if (replacement_id.empty()) {
350 // The weird Uint64toString trick is because Windows does not like to deal
351 // with %zu and a size_t in printf, nor does it support %llu.
352 replacement_id = base::StringPrintf(
353 "<%s: %s>", pattern.alias,
354 base::Uint64ToString(identifier_space->size()).c_str());
355 (*identifier_space)[matched_id_as_string] = replacement_id;
356 }
357
358 skipped.AppendToString(&result);
359 result += replacement_id;
360 }
361 text.AppendToString(&result);
362 return result;
149 } 363 }
150 364
151 } // namespace feedback 365 } // namespace feedback
OLDNEW
« no previous file with comments | « components/feedback/anonymizer_tool.h ('k') | components/feedback/anonymizer_tool_unittest.cc » ('j') | no next file with comments »

Powered by Google App Engine
This is Rietveld 408576698