1 // Copyright 2020 The Pigweed Authors
3 // Licensed under the Apache License, Version 2.0 (the "License"); you may not
4 // use this file except in compliance with the License. You may obtain a copy of
7 // https://www.apache.org/licenses/LICENSE-2.0
9 // Unless required by applicable law or agreed to in writing, software
10 // distributed under the License is distributed on an "AS IS" BASIS, WITHOUT
11 // WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. See the
12 // License for the specific language governing permissions and limitations under
15 // Always use stats, these tests depend on it.
16 #define PW_KVS_RECORD_PARTITION_STATS 1
18 #include "gtest/gtest.h"
19 #include "pw_kvs/fake_flash_memory.h"
20 #include "pw_kvs/flash_memory.h"
21 #include "pw_kvs/flash_partition_with_stats.h"
22 #include "pw_kvs/key_value_store.h"
23 #include "pw_log/log.h"
28 // For KVS magic value always use a random 32 bit integer rather than a
29 // human readable 4 bytes. See pw_kvs/format.h for more information.
30 constexpr EntryFormat format{.magic = 0x1bce4ad5, .checksum = nullptr};
32 class WearTest : public ::testing::Test {
35 : flash_(internal::Entry::kMinAlignmentBytes),
36 partition_(&flash_, 0, flash_.sector_count()),
37 kvs_(&partition_, format) {
38 EXPECT_EQ(OkStatus(), kvs_.Init());
41 static constexpr size_t kSectors = 16;
42 static constexpr size_t kMaxEntries = 256;
43 static constexpr size_t kTestPartitionSectorSize = 512;
45 FakeFlashMemoryBuffer<kTestPartitionSectorSize, kSectors> flash_;
46 FlashPartitionWithStatsBuffer<kSectors> partition_;
48 KeyValueStoreBuffer<kMaxEntries, kSectors> kvs_;
51 // Block of data to use for entry value. Sized to 470 so the total entry results
52 // in using most of the 512 byte sector.
53 uint8_t test_data[470] = {1, 2, 3, 4, 5, 6};
55 // Write a large key (i.e. only one entry fits in each sector) enough times to
56 // fill up the KVS multiple times, and ensure every sector was garbage collected
57 // multiple additional times.
58 TEST_F(WearTest, RepeatedLargeEntry) {
59 // Initialize an empty KVS, erasing flash and all tracked sector erase counts.
60 partition_.ResetCounters();
62 // Add enough large entries to fill the entire KVS several times.
63 for (size_t i = 0; i < kSectors * 10; ++i) {
64 // modify the value to ensure a key-value different than was previously
68 EXPECT_TRUE(kvs_.Put("large_entry", std::span(test_data)).ok());
71 // Ensure every sector has been erased at several times due to garbage
73 EXPECT_GE(partition_.min_erase_count(), 7u);
74 EXPECT_LE(partition_.max_erase_count(), partition_.min_erase_count() + 1u);
76 partition_.SaveStorageStats(kvs_, "WearTest RepeatedLargeEntry");
79 // Test a KVS with a number of entries, several sectors that are nearly full
80 // of stale (reclaimable) space, and not enough writable (free) space to add a
81 // redundant copy for any of the entries. Tests that the add redundancy step of
82 // repair is able to use garbage collection to free up space needed for the new
84 TEST_F(WearTest, TwoPassFillWithLargeAndLarger) {
85 partition_.ResetCounters();
87 // Add a large entry that will only fit once per sector enough times to fill
88 // the KVS with mostly stale data.
89 for (size_t i = 0; i < kSectors; i++) {
90 // modify the value to ensure a key-value different than was previously
97 std::as_bytes(std::span(test_data, sizeof(test_data) - 70))));
100 // Add many copies of a differently sized entry that is larger than the
102 for (size_t i = 0; i < kSectors * 200; i++) {
103 // Modify the value to ensure a key-value different than was previously
107 printf("Add entry %zu\n", i);
108 EXPECT_EQ(OkStatus(), kvs_.Put("big_key", test_data));
111 EXPECT_EQ(2u, kvs_.size());
112 EXPECT_LT(partition_.max_erase_count(),
113 2u * partition_.average_erase_count());
117 } // namespace pw::kvs