RAPPOR implementation

components/rappor/bloom_filter.cc

+// 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