HomeSort by relevance Sort by last modified time
    Searched refs:full_hashes (Results 1 - 13 of 13) sorted by null

  /external/chromium_org/chrome/browser/safe_browsing/
protocol_parser_unittest.cc 395 std::vector<SBFullHashResult> full_hashes; local
398 &cache_lifetime, &full_hashes));
400 ASSERT_EQ(3U, full_hashes.size());
401 EXPECT_EQ(memcmp(&full_hashes[0].hash,
404 EXPECT_EQ(safe_browsing_util::PHISH, full_hashes[0].list_id);
405 EXPECT_EQ(memcmp(&full_hashes[1].hash,
408 EXPECT_EQ(safe_browsing_util::PHISH, full_hashes[1].list_id);
409 EXPECT_EQ(memcmp(&full_hashes[2].hash,
412 EXPECT_EQ(safe_browsing_util::PHISH, full_hashes[2].list_id);
425 &cache_lifetime, &full_hashes));
481 std::vector<SBFullHashResult> full_hashes; local
513 std::vector<SBFullHashResult> full_hashes; local
    [all...]
database_manager_unittest.cc 83 std::vector<SBFullHashResult> full_hashes; local
97 full_hashes.push_back(full_hash);
104 full_hashes.push_back(full_hash);
109 kMalwareHostHash, full_hashes));
113 kPhishingHostHash, full_hashes));
117 kSafeHostHash, full_hashes));
122 kMalwareUrl, full_hashes, &index));
127 kPhishingUrl, full_hashes, &index));
133 kSafeUrl, full_hashes, &index));
database_manager.cc 46 // |true| if there were any prefix hits in |full_hashes|.
50 const std::vector<SBFullHashResult>& full_hashes) {
52 if (full_hashes.empty()) {
71 // Return the list id from the first result in |full_hashes| which matches
75 const std::vector<SBFullHashResult>& full_hashes,
77 for (size_t i = 0; i < full_hashes.size(); ++i) {
78 if (SBFullHashEqual(hash, full_hashes[i].hash)) {
81 return static_cast<safe_browsing_util::ListType>(full_hashes[i].list_id);
89 // |full_hashes|, or INVALID if none match.
92 const std::vector<SBFullHashResult>& full_hashes,
    [all...]
safe_browsing_database.cc 127 std::vector<SBFullHash>* full_hashes) {
141 full_hashes->push_back(SBFullHashForString(hosts[i] + path));
149 full_hashes->push_back(
159 std::vector<SBFullHash> full_hashes; local
161 BrowseFullHashesToCheck(urls[i], false, &full_hashes);
163 for (size_t i = 0; i < full_hashes.size(); ++i)
164 prefixes->push_back(full_hashes[i].prefix);
302 std::vector<SBFullHashResult>& cached_hashes = cached_result.full_hashes;
532 std::vector<SBAddFullHash> full_hashes; local
533 if (csd_whitelist_store_->GetAddFullHashes(&full_hashes)) {
548 std::vector<SBAddFullHash> full_hashes; local
602 std::vector<SBAddFullHash> full_hashes; local
642 std::vector<SBFullHash> full_hashes; local
707 std::vector<SBFullHash> full_hashes; local
713 std::vector<SBFullHash> full_hashes; local
1164 std::vector<SBAddFullHash> full_hashes; local
1324 std::vector<SBAddFullHash> full_hashes; local
1569 std::vector<SBFullHash> full_hashes; local
    [all...]
protocol_parser.h 55 std::vector<SBFullHashResult>* full_hashes);
protocol_parser.cc 136 std::vector<SBFullHashResult>* full_hashes) {
150 if (full_hashes) {
151 (*full_hashes)[full_hashes->size() - hash_count + i].metadata.assign(
174 std::vector<SBFullHashResult>* full_hashes) {
175 full_hashes->clear();
241 full_hashes->push_back(full_hash);
244 if (has_metadata && !ParseGetHashMetadata(hash_count, &reader, full_hashes))
database_manager.h 59 const std::vector<SBFullHash>& full_hashes,
65 // Either |urls| or |full_hashes| is used to lookup database. |*_results|
71 std::vector<SBFullHash> full_hashes; member in struct:SafeBrowsingDatabaseManager::SafeBrowsingCheck
188 const std::vector<SBFullHashResult>& full_hashes,
240 // Return the threat type from the first result in |full_hashes| which matches
244 const std::vector<SBFullHashResult>& full_hashes);
248 // |full_hashes|, or SAFE if none match.
251 const std::vector<SBFullHashResult>& full_hashes,
313 const std::vector<SBFullHashResult>& full_hashes);
315 // Run one check against |full_hashes|. Returns |true| if the chec
    [all...]
prefix_set.cc 92 std::vector<SBFullHash>* full_hashes) {
93 DCHECK(index && deltas && full_hashes);
96 full_hashes_.swap(*full_hashes);
201 std::vector<SBFullHash> full_hashes; local
203 sizeof(full_hashes[0]) * header.full_hashes_size;
237 full_hashes.resize(header.full_hashes_size);
238 read = fread(&(full_hashes[0]), sizeof(full_hashes[0]), full_hashes.size(),
240 if (read != full_hashes.size()
    [all...]
safe_browsing_database_unittest.cc 147 const SBFullHash full_hashes[2] = { local
153 &full_hashes[0], sizeof(full_hashes),
1660 std::vector<SBFullHash> full_hashes; local
1917 std::vector<SBFullHash> full_hashes; local
    [all...]
prefix_set.h 129 std::vector<SBFullHash>* full_hashes);
safe_browsing_database.h 347 bool ContainsBrowseUrlHashes(const std::vector<SBFullHash>& full_hashes,
372 void LoadWhitelist(const std::vector<SBAddFullHash>& full_hashes,
380 void LoadIpBlacklist(const std::vector<SBAddFullHash>& full_hashes);
456 // empty full_hashes field. Cleared on each update.
protocol_manager.cc 181 std::vector<SBFullHashResult> full_hashes; local
182 callback.Run(full_hashes, base::TimeDelta());
237 std::vector<SBFullHashResult> full_hashes; local
254 data.data(), data.length(), &cache_lifetime, &full_hashes)) {
255 full_hashes.clear();
273 // Invoke the callback with full_hashes, even if there was a parse error or
274 // an error response code (in which case full_hashes will be empty). The
276 details.callback.Run(full_hashes, cache_lifetime);
safe_browsing_util.h 103 std::vector<SBFullHashResult> full_hashes; member in struct:SBCachedFullHashResult

Completed in 414 milliseconds