10225501448 李度 10225101546 陈胤遒 10215501422 高宇菲

95 linhas
2.8 KiB

Release 1.18 Changes are: * Update version number to 1.18 * Replace the basic fprintf call with a call to fwrite in order to work around the apparent compiler optimization/rewrite failure that we are seeing with the new toolchain/iOS SDKs provided with Xcode6 and iOS8. * Fix ALL the header guards. * Createed a README.md with the LevelDB project description. * A new CONTRIBUTING file. * Don't implicitly convert uint64_t to size_t or int. Either preserve it as uint64_t, or explicitly cast. This fixes MSVC warnings about possible value truncation when compiling this code in Chromium. * Added a DumpFile() library function that encapsulates the guts of the "leveldbutil dump" command. This will allow clients to dump data to their log files instead of stdout. It will also allow clients to supply their own environment. * leveldb: Remove unused function 'ConsumeChar'. * leveldbutil: Remove unused member variables from WriteBatchItemPrinter. * OpenBSD, NetBSD and DragonflyBSD have _LITTLE_ENDIAN, so define PLATFORM_IS_LITTLE_ENDIAN like on FreeBSD. This fixes: * issue #143 * issue #198 * issue #249 * Switch from <cstdatomic> to <atomic>. The former never made it into the standard and doesn't exist in modern gcc versions at all. The later contains everything that leveldb was using from the former. This problem was noticed when porting to Portable Native Client where no memory barrier is defined. The fact that <cstdatomic> is missing normally goes unnoticed since memory barriers are defined for most architectures. * Make Hash() treat its input as unsigned. Before this change LevelDB files from platforms with different signedness of char were not compatible. This change fixes: issue #243 * Verify checksums of index/meta/filter blocks when paranoid_checks set. * Invoke all tools for iOS with xcrun. (This was causing problems with the new XCode 5.1.1 image on pulse.) * include <sys/stat.h> only once, and fix the following linter warning: "Found C system header after C++ system header" * When encountering a corrupted table file, return Status::Corruption instead of Status::InvalidArgument. * Support cygwin as build platform, patch is from https://code.google.com/p/leveldb/issues/detail?id=188 * Fix typo, merge patch from https://code.google.com/p/leveldb/issues/detail?id=159 * Fix typos and comments, and address the following two issues: * issue #166 * issue #241 * Add missing db synchronize after "fillseq" in the benchmark. * Removed unused variable in SeekRandom: value (issue #201)
10 anos atrás
  1. // Copyright (c) 2012 The LevelDB Authors. All rights reserved.
  2. // Use of this source code is governed by a BSD-style license that can be
  3. // found in the LICENSE file. See the AUTHORS file for names of contributors.
  4. #include "leveldb/filter_policy.h"
  5. #include "leveldb/slice.h"
  6. #include "util/hash.h"
  7. namespace leveldb {
  8. namespace {
  9. static uint32_t BloomHash(const Slice& key) {
  10. return Hash(key.data(), key.size(), 0xbc9f1d34);
  11. }
  12. class BloomFilterPolicy : public FilterPolicy {
  13. private:
  14. size_t bits_per_key_;
  15. size_t k_;
  16. public:
  17. explicit BloomFilterPolicy(int bits_per_key)
  18. : bits_per_key_(bits_per_key) {
  19. // We intentionally round down to reduce probing cost a little bit
  20. k_ = static_cast<size_t>(bits_per_key * 0.69); // 0.69 =~ ln(2)
  21. if (k_ < 1) k_ = 1;
  22. if (k_ > 30) k_ = 30;
  23. }
  24. virtual const char* Name() const {
  25. return "leveldb.BuiltinBloomFilter2";
  26. }
  27. virtual void CreateFilter(const Slice* keys, int n, std::string* dst) const {
  28. // Compute bloom filter size (in both bits and bytes)
  29. size_t bits = n * bits_per_key_;
  30. // For small n, we can see a very high false positive rate. Fix it
  31. // by enforcing a minimum bloom filter length.
  32. if (bits < 64) bits = 64;
  33. size_t bytes = (bits + 7) / 8;
  34. bits = bytes * 8;
  35. const size_t init_size = dst->size();
  36. dst->resize(init_size + bytes, 0);
  37. dst->push_back(static_cast<char>(k_)); // Remember # of probes in filter
  38. char* array = &(*dst)[init_size];
  39. for (int i = 0; i < n; i++) {
  40. // Use double-hashing to generate a sequence of hash values.
  41. // See analysis in [Kirsch,Mitzenmacher 2006].
  42. uint32_t h = BloomHash(keys[i]);
  43. const uint32_t delta = (h >> 17) | (h << 15); // Rotate right 17 bits
  44. for (size_t j = 0; j < k_; j++) {
  45. const uint32_t bitpos = h % bits;
  46. array[bitpos/8] |= (1 << (bitpos % 8));
  47. h += delta;
  48. }
  49. }
  50. }
  51. virtual bool KeyMayMatch(const Slice& key, const Slice& bloom_filter) const {
  52. const size_t len = bloom_filter.size();
  53. if (len < 2) return false;
  54. const char* array = bloom_filter.data();
  55. const size_t bits = (len - 1) * 8;
  56. // Use the encoded k so that we can read filters generated by
  57. // bloom filters created using different parameters.
  58. const size_t k = array[len-1];
  59. if (k > 30) {
  60. // Reserved for potentially new encodings for short bloom filters.
  61. // Consider it a match.
  62. return true;
  63. }
  64. uint32_t h = BloomHash(key);
  65. const uint32_t delta = (h >> 17) | (h << 15); // Rotate right 17 bits
  66. for (size_t j = 0; j < k; j++) {
  67. const uint32_t bitpos = h % bits;
  68. if ((array[bitpos/8] & (1 << (bitpos % 8))) == 0) return false;
  69. h += delta;
  70. }
  71. return true;
  72. }
  73. };
  74. }
  75. const FilterPolicy* NewBloomFilterPolicy(int bits_per_key) {
  76. return new BloomFilterPolicy(bits_per_key);
  77. }
  78. } // namespace leveldb