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

Unified Diff: components/rappor/bloom_filter.cc

Issue 49753002: RAPPOR implementation (Closed) Base URL: https://chromium.googlesource.com/chromium/src.git@master
Patch Set: Created 7 years 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 side-by-side diff with in-line comments
Download patch
Index: components/rappor/bloom_filter.cc
diff --git a/components/rappor/bloom_filter.cc b/components/rappor/bloom_filter.cc
new file mode 100644
index 0000000000000000000000000000000000000000..67c606d37517888b895d4bbef5f03630dbd6c8c7
--- /dev/null
+++ b/components/rappor/bloom_filter.cc
@@ -0,0 +1,52 @@
+// Copyright (c) 2013 The Chromium Authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+#include <string>
+
+#include "base/logging.h"
+#include "components/rappor/bloom_filter.h"
+#include "third_party/smhasher/src/MurmurHash3.h"
+
+namespace {
+
+// Distinct seeds are used to create unique hash functions for the bloom filter.
+const uint32_t kHashSeedCount = 4;
+const uint32_t kHashSeeds[kHashSeedCount] = {0xd123957d, 0x6752fc9b,
+ 0xcb6a0102, 0x1a82ea95};
+
+uint32_t MurmurHash3String(const std::string& str, uint32_t seed) {
+ uint32_t output = 0;
+ // This function is optimized for x86_32, but should work on any platform.
+ MurmurHash3_x86_32(str.data(), str.size(), seed, &output);
+ return output;
+}
+
+} // namespace
+
+namespace rappor {
+
+BloomFilter::BloomFilter(uint32_t bytes_size, uint32_t hash_count)
+ : bytes_(bytes_size), hash_count_(hash_count) {
+ DCHECK(hash_count <= kHashSeedCount);
Alexei Svitkine (slow) 2013/12/19 19:47:02 DCHECK_LE
Steven Holte 2013/12/20 03:03:55 Done.
+}
+
+void BloomFilter::AddString(const std::string& str) {
+ for (size_t j = 0; j < hash_count_; ++j) {
+ uint32_t index = MurmurHash3String(str, kHashSeeds[j]);
+ uint32_t byte_index = (index / 8) % bytes_.size();
+ uint32_t bit_index = index % 8;
+ bytes_[byte_index] |= 1 << bit_index;
+ }
+}
+
+void BloomFilter::AddStrings(const std::vector<std::string>& strings) {
+ for (size_t i = 0, len = strings.size(); i < len; ++i)
+ AddString(strings[i]);
+}
+
+const ByteVector& BloomFilter::bytes() const { return bytes_; }
+
+uint32_t BloomFilter::hash_count() const { return hash_count_; }
Alexei Svitkine (slow) 2013/12/19 19:47:02 These can be inlined in the header.
Steven Holte 2013/12/20 03:03:55 Done.
+
+} // namespace rappor

Powered by Google App Engine
This is Rietveld 408576698