mirror of
https://github.com/google/leveldb.git
synced 2024-12-28 04:00:09 +08:00
36a5f8ed7f
- Replace raw slice comparison with a call to user comparator. Added test for custom comparators. - Fix end of namespace comments. - Fixed bug in picking inputs for a level-0 compaction. When finding overlapping files, the covered range may expand as files are added to the input set. We now correctly expand the range when this happens instead of continuing to use the old range. For example, suppose L0 contains files with the following ranges: F1: a .. d F2: c .. g F3: f .. j and the initial compaction target is F3. We used to search for range f..j which yielded {F2,F3}. However we now expand the range as soon as another file is added. In this case, when F2 is added, we expand the range to c..j and restart the search. That picks up file F1 as well. This change fixes a bug related to deleted keys showing up incorrectly after a compaction as described in Issue 44. (Sync with upstream @25072954)
174 lines
4.6 KiB
C++
174 lines
4.6 KiB
C++
// Copyright (c) 2011 The LevelDB Authors. All rights reserved.
|
|
// Use of this source code is governed by a BSD-style license that can be
|
|
// found in the LICENSE file. See the AUTHORS file for names of contributors.
|
|
|
|
#include "util/coding.h"
|
|
|
|
#include "util/testharness.h"
|
|
|
|
namespace leveldb {
|
|
|
|
class Coding { };
|
|
|
|
TEST(Coding, Fixed32) {
|
|
std::string s;
|
|
for (uint32_t v = 0; v < 100000; v++) {
|
|
PutFixed32(&s, v);
|
|
}
|
|
|
|
const char* p = s.data();
|
|
for (uint32_t v = 0; v < 100000; v++) {
|
|
uint32_t actual = DecodeFixed32(p);
|
|
ASSERT_EQ(v, actual);
|
|
p += sizeof(uint32_t);
|
|
}
|
|
}
|
|
|
|
TEST(Coding, Fixed64) {
|
|
std::string s;
|
|
for (int power = 0; power <= 63; power++) {
|
|
uint64_t v = static_cast<uint64_t>(1) << power;
|
|
PutFixed64(&s, v - 1);
|
|
PutFixed64(&s, v + 0);
|
|
PutFixed64(&s, v + 1);
|
|
}
|
|
|
|
const char* p = s.data();
|
|
for (int power = 0; power <= 63; power++) {
|
|
uint64_t v = static_cast<uint64_t>(1) << power;
|
|
uint64_t actual;
|
|
actual = DecodeFixed64(p);
|
|
ASSERT_EQ(v-1, actual);
|
|
p += sizeof(uint64_t);
|
|
|
|
actual = DecodeFixed64(p);
|
|
ASSERT_EQ(v+0, actual);
|
|
p += sizeof(uint64_t);
|
|
|
|
actual = DecodeFixed64(p);
|
|
ASSERT_EQ(v+1, actual);
|
|
p += sizeof(uint64_t);
|
|
}
|
|
}
|
|
|
|
TEST(Coding, Varint32) {
|
|
std::string s;
|
|
for (uint32_t i = 0; i < (32 * 32); i++) {
|
|
uint32_t v = (i / 32) << (i % 32);
|
|
PutVarint32(&s, v);
|
|
}
|
|
|
|
const char* p = s.data();
|
|
const char* limit = p + s.size();
|
|
for (uint32_t i = 0; i < (32 * 32); i++) {
|
|
uint32_t expected = (i / 32) << (i % 32);
|
|
uint32_t actual;
|
|
const char* start = p;
|
|
p = GetVarint32Ptr(p, limit, &actual);
|
|
ASSERT_TRUE(p != NULL);
|
|
ASSERT_EQ(expected, actual);
|
|
ASSERT_EQ(VarintLength(actual), p - start);
|
|
}
|
|
ASSERT_EQ(p, s.data() + s.size());
|
|
}
|
|
|
|
TEST(Coding, Varint64) {
|
|
// Construct the list of values to check
|
|
std::vector<uint64_t> values;
|
|
// Some special values
|
|
values.push_back(0);
|
|
values.push_back(100);
|
|
values.push_back(~static_cast<uint64_t>(0));
|
|
values.push_back(~static_cast<uint64_t>(0) - 1);
|
|
for (uint32_t k = 0; k < 64; k++) {
|
|
// Test values near powers of two
|
|
const uint64_t power = 1ull << k;
|
|
values.push_back(power);
|
|
values.push_back(power-1);
|
|
values.push_back(power+1);
|
|
};
|
|
|
|
std::string s;
|
|
for (int i = 0; i < values.size(); i++) {
|
|
PutVarint64(&s, values[i]);
|
|
}
|
|
|
|
const char* p = s.data();
|
|
const char* limit = p + s.size();
|
|
for (int i = 0; i < values.size(); i++) {
|
|
ASSERT_TRUE(p < limit);
|
|
uint64_t actual;
|
|
const char* start = p;
|
|
p = GetVarint64Ptr(p, limit, &actual);
|
|
ASSERT_TRUE(p != NULL);
|
|
ASSERT_EQ(values[i], actual);
|
|
ASSERT_EQ(VarintLength(actual), p - start);
|
|
}
|
|
ASSERT_EQ(p, limit);
|
|
|
|
}
|
|
|
|
TEST(Coding, Varint32Overflow) {
|
|
uint32_t result;
|
|
std::string input("\x81\x82\x83\x84\x85\x11");
|
|
ASSERT_TRUE(GetVarint32Ptr(input.data(), input.data() + input.size(), &result)
|
|
== NULL);
|
|
}
|
|
|
|
TEST(Coding, Varint32Truncation) {
|
|
uint32_t large_value = (1u << 31) + 100;
|
|
std::string s;
|
|
PutVarint32(&s, large_value);
|
|
uint32_t result;
|
|
for (int len = 0; len < s.size() - 1; len++) {
|
|
ASSERT_TRUE(GetVarint32Ptr(s.data(), s.data() + len, &result) == NULL);
|
|
}
|
|
ASSERT_TRUE(GetVarint32Ptr(s.data(), s.data() + s.size(), &result) != NULL);
|
|
ASSERT_EQ(large_value, result);
|
|
}
|
|
|
|
TEST(Coding, Varint64Overflow) {
|
|
uint64_t result;
|
|
std::string input("\x81\x82\x83\x84\x85\x81\x82\x83\x84\x85\x11");
|
|
ASSERT_TRUE(GetVarint64Ptr(input.data(), input.data() + input.size(), &result)
|
|
== NULL);
|
|
}
|
|
|
|
TEST(Coding, Varint64Truncation) {
|
|
uint64_t large_value = (1ull << 63) + 100ull;
|
|
std::string s;
|
|
PutVarint64(&s, large_value);
|
|
uint64_t result;
|
|
for (int len = 0; len < s.size() - 1; len++) {
|
|
ASSERT_TRUE(GetVarint64Ptr(s.data(), s.data() + len, &result) == NULL);
|
|
}
|
|
ASSERT_TRUE(GetVarint64Ptr(s.data(), s.data() + s.size(), &result) != NULL);
|
|
ASSERT_EQ(large_value, result);
|
|
}
|
|
|
|
TEST(Coding, Strings) {
|
|
std::string s;
|
|
PutLengthPrefixedSlice(&s, Slice(""));
|
|
PutLengthPrefixedSlice(&s, Slice("foo"));
|
|
PutLengthPrefixedSlice(&s, Slice("bar"));
|
|
PutLengthPrefixedSlice(&s, Slice(std::string(200, 'x')));
|
|
|
|
Slice input(s);
|
|
Slice v;
|
|
ASSERT_TRUE(GetLengthPrefixedSlice(&input, &v));
|
|
ASSERT_EQ("", v.ToString());
|
|
ASSERT_TRUE(GetLengthPrefixedSlice(&input, &v));
|
|
ASSERT_EQ("foo", v.ToString());
|
|
ASSERT_TRUE(GetLengthPrefixedSlice(&input, &v));
|
|
ASSERT_EQ("bar", v.ToString());
|
|
ASSERT_TRUE(GetLengthPrefixedSlice(&input, &v));
|
|
ASSERT_EQ(std::string(200, 'x'), v.ToString());
|
|
ASSERT_EQ("", input.ToString());
|
|
}
|
|
|
|
} // namespace leveldb
|
|
|
|
int main(int argc, char** argv) {
|
|
return leveldb::test::RunAllTests();
|
|
}
|