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

  /external/chromium/chrome/browser/safe_browsing/
safe_browsing_store_unittest.cc 90 EXPECT_TRUE(SBAddPrefixHashLess(SBSubFullHash(12, 10, two),
91 SBSubFullHash(9, 11, one)));
92 EXPECT_FALSE(SBAddPrefixHashLess(SBSubFullHash(12, 11, two),
93 SBSubFullHash(9, 10, one)));
96 EXPECT_TRUE(SBAddPrefixHashLess(SBSubFullHash(12, 10, one),
97 SBSubFullHash(9, 10, two)));
98 EXPECT_FALSE(SBAddPrefixHashLess(SBSubFullHash(12, 10, two),
99 SBSubFullHash(9, 10, one)));
102 EXPECT_TRUE(SBAddPrefixHashLess(SBSubFullHash(12, 10, one),
103 SBSubFullHash(9, 10, onetwo)))
    [all...]
safe_browsing_store.h 28 // List of SBSubFullHash (chunk_id, target SBAddPrefix, and an SBFullHash).
90 struct SBSubFullHash {
95 SBSubFullHash(int32 id, int32 add_id, const SBFullHash& h)
97 SBSubFullHash() : chunk_id(), add_chunk_id(), full_hash() {}
145 std::vector<SBSubFullHash>* sub_full_hashes,
safe_browsing_store.cc 170 std::vector<SBSubFullHash>* sub_full_hashes,
186 SBAddPrefixHashLess<SBSubFullHash,SBSubFullHash>);
213 SBAddPrefixHashLess<SBAddFullHash,SBSubFullHash>,
214 SBAddPrefixHashLess<SBSubFullHash,SBAddFullHash>,
safe_browsing_store_file.h 227 std::vector<SBSubFullHash>().swap(sub_hashes_);
246 std::vector<SBSubFullHash> sub_hashes_;
safe_browsing_util.h 209 struct SBSubFullHash {
252 SBSubFullHash sub_full_hashes_[1];
safe_browsing_store_file.cc 173 expected_size += header.sub_hash_count * sizeof(SBSubFullHash);
350 sub_hashes_.push_back(SBSubFullHash(chunk_id, add_chunk_id, full_hash));
487 std::vector<SBSubFullHash> sub_full_hashes;
572 expected_size += header.sub_hash_count * sizeof(SBSubFullHash);
safe_browsing_util.cc 98 return sizeof(SBSubFullHash);
  /external/chromium_org/chrome/browser/safe_browsing/
safe_browsing_store_unittest.cc 90 EXPECT_TRUE(SBAddPrefixHashLess(SBSubFullHash(12, 10, two),
91 SBSubFullHash(9, 11, one)));
92 EXPECT_FALSE(SBAddPrefixHashLess(SBSubFullHash(12, 11, two),
93 SBSubFullHash(9, 10, one)));
96 EXPECT_TRUE(SBAddPrefixHashLess(SBSubFullHash(12, 10, one),
97 SBSubFullHash(9, 10, two)));
98 EXPECT_FALSE(SBAddPrefixHashLess(SBSubFullHash(12, 10, two),
99 SBSubFullHash(9, 10, one)));
102 EXPECT_TRUE(SBAddPrefixHashLess(SBSubFullHash(12, 10, one),
103 SBSubFullHash(9, 10, onetwo)))
    [all...]
safe_browsing_store.cc 170 std::vector<SBSubFullHash>* sub_full_hashes,
186 SBAddPrefixHashLess<SBSubFullHash,SBSubFullHash>);
205 SBAddPrefixHashLess<SBAddFullHash,SBSubFullHash>,
206 SBAddPrefixHashLess<SBSubFullHash,SBAddFullHash>,
safe_browsing_store.h 28 // List of SBSubFullHash (chunk_id, target SBAddPrefix, and an SBFullHash).
94 struct SBSubFullHash {
99 SBSubFullHash(int32 id, int32 add_id, const SBFullHash& h)
101 SBSubFullHash() : chunk_id(), add_chunk_id(), full_hash() {}
145 std::vector<SBSubFullHash>* sub_full_hashes,
safe_browsing_store_file.h 242 std::vector<SBSubFullHash>().swap(sub_hashes_);
261 std::vector<SBSubFullHash> sub_hashes_;
safe_browsing_util.h 232 struct SBSubFullHash {
275 SBSubFullHash sub_full_hashes_[1];
safe_browsing_store_file.cc 147 expected_size += header.sub_hash_count * sizeof(SBSubFullHash);
354 sub_hashes_.push_back(SBSubFullHash(chunk_id, add_chunk_id, full_hash));
490 std::vector<SBSubFullHash> sub_full_hashes;
577 expected_size += header.sub_hash_count * sizeof(SBSubFullHash);
safe_browsing_util.cc 90 return sizeof(SBSubFullHash);

Completed in 237 milliseconds