Lines Matching defs:full_hashes
78 std::vector<SBFullHash>* full_hashes) {
95 full_hashes->push_back(full_hash);
105 full_hashes->push_back(full_hash);
114 std::vector<SBFullHash> full_hashes;
116 BrowseFullHashesToCheck(urls[i], false, &full_hashes);
118 for (size_t i = 0; i < full_hashes.size(); ++i)
119 prefixes->push_back(full_hashes[i].prefix);
122 // Find the entries in |full_hashes| with prefix in |prefix_hits|, and
129 // |full_hashes| in parallel, so they must be sorted by prefix.
131 const std::vector<SBAddFullHash>& full_hashes,
138 std::vector<SBAddFullHash>::const_iterator hiter = full_hashes.begin();
140 while (piter != prefix_hits.end() && hiter != full_hashes.end()) {
539 std::vector<SBAddFullHash> full_hashes;
540 if (csd_whitelist_store_->GetAddFullHashes(&full_hashes)) {
541 LoadCsdWhitelist(full_hashes);
590 std::vector<SBFullHash> full_hashes;
591 BrowseFullHashesToCheck(url, false, &full_hashes);
592 if (full_hashes.empty())
607 for (size_t i = 0; i < full_hashes.size(); ++i) {
608 bool found = prefix_set_->Exists(full_hashes[i].prefix);
610 if (browse_bloom_filter_->Exists(full_hashes[i].prefix)) {
614 prefix_hits->push_back(full_hashes[i].prefix);
615 if (prefix_miss_cache_.count(full_hashes[i].prefix) > 0)
633 full_hashes[i].prefix)) {
717 std::vector<SBFullHash> full_hashes;
718 BrowseFullHashesToCheck(url, true, &full_hashes);
719 for (std::vector<SBFullHash>::const_iterator it = full_hashes.begin();
720 it != full_hashes.end(); ++it) {
1050 std::vector<SBAddFullHash> full_hashes;
1054 &full_hashes)) {
1059 LoadCsdWhitelist(full_hashes);
1291 const std::vector<SBAddFullHash>& full_hashes) {
1293 if (full_hashes.size() > kMaxCsdWhitelistSize) {
1299 for (std::vector<SBAddFullHash>::const_iterator it = full_hashes.begin();
1300 it != full_hashes.end(); ++it) {
