OpenGrok
Home
Sort by relevance
Sort by last modified time
Full Search
Definition
Symbol
File Path
History
|
|
Help
Searched
refs:SBAddFullHash
(Results
1 - 10
of
10
) sorted by null
/external/chromium/chrome/browser/safe_browsing/
safe_browsing_store_unittest.cc
41
EXPECT_TRUE(SBAddPrefixHashLess(
SBAddFullHash
(10, now, two),
42
SBAddFullHash
(11, now, one)));
43
EXPECT_FALSE(SBAddPrefixHashLess(
SBAddFullHash
(11, now, two),
44
SBAddFullHash
(10, now, one)));
47
EXPECT_TRUE(SBAddPrefixHashLess(
SBAddFullHash
(10, now, one),
48
SBAddFullHash
(10, now, two)));
49
EXPECT_FALSE(SBAddPrefixHashLess(
SBAddFullHash
(10, now, two),
50
SBAddFullHash
(10, now, one)));
53
EXPECT_TRUE(SBAddPrefixHashLess(
SBAddFullHash
(10, now, one),
54
SBAddFullHash
(10, now, onetwo)))
[
all
...]
safe_browsing_store.h
27
// List of
SBAddFullHash
(SBAddPrefix, time received and an SBFullHash).
68
struct
SBAddFullHash
{
73
SBAddFullHash
(int32 id, base::Time r, const SBFullHash& h)
81
SBAddFullHash
(int32 id, int32 r, const SBFullHash& h)
84
SBAddFullHash
() : chunk_id(), received(), full_hash() {}
144
std::vector<
SBAddFullHash
>* add_full_hashes,
182
std::vector<
SBAddFullHash
>* add_full_hashes) = 0;
232
const std::vector<
SBAddFullHash
>& pending_adds,
235
std::vector<
SBAddFullHash
>* add_full_hashes_result) = 0;
safe_browsing_store_file.h
121
virtual bool GetAddFullHashes(std::vector<
SBAddFullHash
>* add_full_hashes);
138
virtual bool FinishUpdate(const std::vector<
SBAddFullHash
>& pending_adds,
141
std::vector<
SBAddFullHash
>* add_full_hashes_result);
162
virtual bool DoUpdate(const std::vector<
SBAddFullHash
>& pending_adds,
165
std::vector<
SBAddFullHash
>* add_full_hashes_result);
226
std::vector<
SBAddFullHash
>().swap(add_hashes_);
245
std::vector<
SBAddFullHash
> add_hashes_;
safe_browsing_store.cc
169
std::vector<
SBAddFullHash
>* add_full_hashes,
184
SBAddPrefixHashLess<
SBAddFullHash
,
SBAddFullHash
>);
211
std::vector<
SBAddFullHash
> removed_full_adds;
213
SBAddPrefixHashLess<
SBAddFullHash
,SBSubFullHash>,
214
SBAddPrefixHashLess<SBSubFullHash,
SBAddFullHash
>,
safe_browsing_store_unittest_helper.cc
46
std::vector<
SBAddFullHash
> pending_adds;
49
std::vector<
SBAddFullHash
> add_full_hashes_result;
91
std::vector<
SBAddFullHash
> pending_adds;
94
std::vector<
SBAddFullHash
> add_full_hashes_result;
164
std::vector<
SBAddFullHash
> pending_adds;
167
std::vector<
SBAddFullHash
> add_full_hashes_result;
268
std::vector<
SBAddFullHash
> pending_adds;
271
std::vector<
SBAddFullHash
> add_full_hashes_result;
338
std::vector<
SBAddFullHash
> pending_adds;
341
std::vector<
SBAddFullHash
> add_full_hashes_result
[
all
...]
safe_browsing_database.h
246
void LoadCsdWhitelist(const std::vector<
SBAddFullHash
>& full_hashes);
325
std::vector<
SBAddFullHash
> full_browse_hashes_;
326
std::vector<
SBAddFullHash
> pending_browse_hashes_;
safe_browsing_store_file_unittest.cc
100
std::vector<
SBAddFullHash
> pending_adds;
103
std::vector<
SBAddFullHash
> orig_hashes;
125
std::vector<
SBAddFullHash
> add_hashes;
safe_browsing_store_file.cc
172
expected_size += header.add_hash_count * sizeof(
SBAddFullHash
);
310
std::vector<
SBAddFullHash
>* add_full_hashes) {
337
add_hashes_.push_back(
SBAddFullHash
(chunk_id, receive_time, full_hash));
475
const std::vector<
SBAddFullHash
>& pending_adds,
478
std::vector<
SBAddFullHash
>* add_full_hashes_result) {
486
std::vector<
SBAddFullHash
> add_full_hashes;
571
expected_size += header.add_hash_count * sizeof(
SBAddFullHash
);
672
const std::vector<
SBAddFullHash
>& pending_adds,
675
std::vector<
SBAddFullHash
>* add_full_hashes_result) {
safe_browsing_database.cc
131
const std::vector<
SBAddFullHash
>& full_hashes,
138
std::vector<
SBAddFullHash
>::const_iterator hiter = full_hashes.begin();
216
// Order |
SBAddFullHash
| on the prefix part. |SBAddPrefixLess()| from
218
bool SBAddFullHashPrefixLess(const
SBAddFullHash
& a, const
SBAddFullHash
& b) {
539
std::vector<
SBAddFullHash
> full_hashes;
[
all
...]
safe_browsing_database_unittest.cc
[
all
...]
Completed in 619 milliseconds