Wyatt Hepler | b760954 | 2020-01-24 10:29:54 -0800 | [diff] [blame] | 1 | // Copyright 2020 The Pigweed Authors |
| 2 | // |
| 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 |
| 5 | // the License at |
| 6 | // |
| 7 | // https://www.apache.org/licenses/LICENSE-2.0 |
| 8 | // |
| 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 |
| 13 | // the License. |
| 14 | |
Wyatt Hepler | b760954 | 2020-01-24 10:29:54 -0800 | [diff] [blame] | 15 | #include "pw_kvs/key_value_store.h" |
| 16 | |
Wyatt Hepler | bab0e20 | 2020-02-04 07:40:08 -0800 | [diff] [blame] | 17 | #include <algorithm> |
Wyatt Hepler | 5a33d8c | 2020-02-06 09:32:58 -0800 | [diff] [blame] | 18 | #include <cinttypes> |
Wyatt Hepler | b760954 | 2020-01-24 10:29:54 -0800 | [diff] [blame] | 19 | #include <cstring> |
Wyatt Hepler | 4da1fcb | 2020-01-30 17:32:18 -0800 | [diff] [blame] | 20 | #include <type_traits> |
Wyatt Hepler | b760954 | 2020-01-24 10:29:54 -0800 | [diff] [blame] | 21 | |
Wyatt Hepler | 22d0d9f | 2020-03-05 14:57:11 -0800 | [diff] [blame] | 22 | #include "pw_kvs/format.h" |
| 23 | |
Keir Mierle | 8c352dc | 2020-02-02 13:58:19 -0800 | [diff] [blame] | 24 | #define PW_LOG_USE_ULTRA_SHORT_NAMES 1 |
Wyatt Hepler | bdd8e5a | 2020-02-20 19:27:26 -0800 | [diff] [blame] | 25 | #include "pw_kvs/internal/entry.h" |
Wyatt Hepler | 4da1fcb | 2020-01-30 17:32:18 -0800 | [diff] [blame] | 26 | #include "pw_kvs_private/macros.h" |
Keir Mierle | 8c352dc | 2020-02-02 13:58:19 -0800 | [diff] [blame] | 27 | #include "pw_log/log.h" |
Wyatt Hepler | b760954 | 2020-01-24 10:29:54 -0800 | [diff] [blame] | 28 | |
Wyatt Hepler | 2ad6067 | 2020-01-21 08:00:16 -0800 | [diff] [blame] | 29 | namespace pw::kvs { |
Wyatt Hepler | a00d1ef | 2020-02-14 14:31:26 -0800 | [diff] [blame] | 30 | namespace { |
Wyatt Hepler | b760954 | 2020-01-24 10:29:54 -0800 | [diff] [blame] | 31 | |
Wyatt Hepler | acaacf9 | 2020-01-24 10:58:30 -0800 | [diff] [blame] | 32 | using std::byte; |
Wyatt Hepler | 4da1fcb | 2020-01-30 17:32:18 -0800 | [diff] [blame] | 33 | using std::string_view; |
Wyatt Hepler | acaacf9 | 2020-01-24 10:58:30 -0800 | [diff] [blame] | 34 | |
Wyatt Hepler | a00d1ef | 2020-02-14 14:31:26 -0800 | [diff] [blame] | 35 | constexpr bool InvalidKey(std::string_view key) { |
Wyatt Hepler | bdd8e5a | 2020-02-20 19:27:26 -0800 | [diff] [blame] | 36 | return key.empty() || (key.size() > internal::Entry::kMaxKeyLength); |
Wyatt Hepler | a00d1ef | 2020-02-14 14:31:26 -0800 | [diff] [blame] | 37 | } |
| 38 | |
| 39 | } // namespace |
| 40 | |
Wyatt Hepler | ad0a793 | 2020-02-06 08:20:38 -0800 | [diff] [blame] | 41 | KeyValueStore::KeyValueStore(FlashPartition* partition, |
Wyatt Hepler | 38ce30f | 2020-02-19 11:48:31 -0800 | [diff] [blame] | 42 | Vector<KeyDescriptor>& key_descriptor_list, |
| 43 | Vector<SectorDescriptor>& sector_descriptor_list, |
David Rogers | f3884eb | 2020-03-08 19:21:40 -0700 | [diff] [blame^] | 44 | size_t redundancy, |
Wyatt Hepler | 22d0d9f | 2020-03-05 14:57:11 -0800 | [diff] [blame] | 45 | span<const EntryFormat> formats, |
Wyatt Hepler | ad0a793 | 2020-02-06 08:20:38 -0800 | [diff] [blame] | 46 | const Options& options) |
| 47 | : partition_(*partition), |
Wyatt Hepler | 22d0d9f | 2020-03-05 14:57:11 -0800 | [diff] [blame] | 48 | formats_(formats), |
Wyatt Hepler | 38ce30f | 2020-02-19 11:48:31 -0800 | [diff] [blame] | 49 | key_descriptors_(key_descriptor_list), |
Wyatt Hepler | d229828 | 2020-02-20 17:12:45 -0800 | [diff] [blame] | 50 | sectors_(sector_descriptor_list), |
David Rogers | f3884eb | 2020-03-08 19:21:40 -0700 | [diff] [blame^] | 51 | redundancy_(redundancy), |
Wyatt Hepler | d229828 | 2020-02-20 17:12:45 -0800 | [diff] [blame] | 52 | options_(options) { |
| 53 | Reset(); |
| 54 | } |
Wyatt Hepler | ad0a793 | 2020-02-06 08:20:38 -0800 | [diff] [blame] | 55 | |
Wyatt Hepler | 4da1fcb | 2020-01-30 17:32:18 -0800 | [diff] [blame] | 56 | Status KeyValueStore::Init() { |
Wyatt Hepler | d229828 | 2020-02-20 17:12:45 -0800 | [diff] [blame] | 57 | Reset(); |
| 58 | |
David Rogers | 2e9e0c8 | 2020-02-13 15:06:06 -0800 | [diff] [blame] | 59 | INF("Initializing key value store"); |
Wyatt Hepler | 38ce30f | 2020-02-19 11:48:31 -0800 | [diff] [blame] | 60 | if (partition_.sector_count() > sectors_.max_size()) { |
David Rogers | 2e9e0c8 | 2020-02-13 15:06:06 -0800 | [diff] [blame] | 61 | ERR("KVS init failed: kMaxUsableSectors (=%zu) must be at least as " |
| 62 | "large as the number of sectors in the flash partition (=%zu)", |
Wyatt Hepler | 38ce30f | 2020-02-19 11:48:31 -0800 | [diff] [blame] | 63 | sectors_.max_size(), |
David Rogers | 2e9e0c8 | 2020-02-13 15:06:06 -0800 | [diff] [blame] | 64 | partition_.sector_count()); |
Wyatt Hepler | ad0a793 | 2020-02-06 08:20:38 -0800 | [diff] [blame] | 65 | return Status::FAILED_PRECONDITION; |
| 66 | } |
| 67 | |
Keir Mierle | 8c352dc | 2020-02-02 13:58:19 -0800 | [diff] [blame] | 68 | const size_t sector_size_bytes = partition_.sector_size_bytes(); |
Keir Mierle | 8c352dc | 2020-02-02 13:58:19 -0800 | [diff] [blame] | 69 | |
David Rogers | f0a3544 | 2020-02-04 12:16:38 -0800 | [diff] [blame] | 70 | if (working_buffer_.size() < sector_size_bytes) { |
Wyatt Hepler | ce7b8df | 2020-02-21 10:38:39 -0800 | [diff] [blame] | 71 | ERR("KVS init failed: working_buffer_ (%zu B) is smaller than sector size " |
| 72 | "(%zu B)", |
David Rogers | f0a3544 | 2020-02-04 12:16:38 -0800 | [diff] [blame] | 73 | working_buffer_.size(), |
| 74 | sector_size_bytes); |
| 75 | return Status::INVALID_ARGUMENT; |
| 76 | } |
| 77 | |
Keir Mierle | 8c352dc | 2020-02-02 13:58:19 -0800 | [diff] [blame] | 78 | DBG("First pass: Read all entries from all sectors"); |
Wyatt Hepler | 2c7eca0 | 2020-02-18 16:01:42 -0800 | [diff] [blame] | 79 | Address sector_address = 0; |
Keir Mierle | 8c352dc | 2020-02-02 13:58:19 -0800 | [diff] [blame] | 80 | |
Wyatt Hepler | d229828 | 2020-02-20 17:12:45 -0800 | [diff] [blame] | 81 | sectors_.assign(partition_.sector_count(), |
| 82 | SectorDescriptor(sector_size_bytes)); |
| 83 | |
Alexei Frolov | d4adf91 | 2020-02-21 13:29:15 -0800 | [diff] [blame] | 84 | size_t total_corrupt_bytes = 0; |
| 85 | int corrupt_entries = 0; |
David Rogers | 9162748 | 2020-02-27 17:38:12 -0800 | [diff] [blame] | 86 | bool empty_sector_found = false; |
Alexei Frolov | d4adf91 | 2020-02-21 13:29:15 -0800 | [diff] [blame] | 87 | |
Wyatt Hepler | 2c7eca0 | 2020-02-18 16:01:42 -0800 | [diff] [blame] | 88 | for (SectorDescriptor& sector : sectors_) { |
Keir Mierle | 8c352dc | 2020-02-02 13:58:19 -0800 | [diff] [blame] | 89 | Address entry_address = sector_address; |
| 90 | |
Alexei Frolov | d4adf91 | 2020-02-21 13:29:15 -0800 | [diff] [blame] | 91 | size_t sector_corrupt_bytes = 0; |
| 92 | |
Wyatt Hepler | 2c7eca0 | 2020-02-18 16:01:42 -0800 | [diff] [blame] | 93 | for (int num_entries_in_sector = 0; true; num_entries_in_sector++) { |
| 94 | DBG("Load entry: sector=%" PRIx32 ", entry#=%d, address=%" PRIx32, |
| 95 | sector_address, |
Keir Mierle | 8c352dc | 2020-02-02 13:58:19 -0800 | [diff] [blame] | 96 | num_entries_in_sector, |
Wyatt Hepler | 2c7eca0 | 2020-02-18 16:01:42 -0800 | [diff] [blame] | 97 | entry_address); |
Keir Mierle | 8c352dc | 2020-02-02 13:58:19 -0800 | [diff] [blame] | 98 | |
Wyatt Hepler | 2c7eca0 | 2020-02-18 16:01:42 -0800 | [diff] [blame] | 99 | if (!AddressInSector(sector, entry_address)) { |
Keir Mierle | 8c352dc | 2020-02-02 13:58:19 -0800 | [diff] [blame] | 100 | DBG("Fell off end of sector; moving to the next sector"); |
| 101 | break; |
| 102 | } |
| 103 | |
| 104 | Address next_entry_address; |
| 105 | Status status = LoadEntry(entry_address, &next_entry_address); |
| 106 | if (status == Status::NOT_FOUND) { |
| 107 | DBG("Hit un-written data in sector; moving to the next sector"); |
| 108 | break; |
| 109 | } |
| 110 | if (status == Status::DATA_LOSS) { |
Alexei Frolov | d4adf91 | 2020-02-21 13:29:15 -0800 | [diff] [blame] | 111 | // The entry could not be read, indicating data corruption within the |
| 112 | // sector. Try to scan the remainder of the sector for other entries. |
David Rogers | a2562b5 | 2020-03-05 15:30:05 -0800 | [diff] [blame] | 113 | WRN("KVS init: data loss detected in sector %u at address %zu", |
Wyatt Hepler | 2c7eca0 | 2020-02-18 16:01:42 -0800 | [diff] [blame] | 114 | SectorIndex(§or), |
| 115 | size_t(entry_address)); |
Alexei Frolov | d4adf91 | 2020-02-21 13:29:15 -0800 | [diff] [blame] | 116 | |
| 117 | corrupt_entries++; |
| 118 | |
| 119 | status = ScanForEntry(sector, |
| 120 | entry_address + Entry::kMinAlignmentBytes, |
| 121 | &next_entry_address); |
| 122 | if (status == Status::NOT_FOUND) { |
| 123 | // No further entries in this sector. Mark the remaining bytes in the |
| 124 | // sector as corrupt (since we can't reliably know the size of the |
| 125 | // corrupt entry). |
| 126 | sector_corrupt_bytes += |
| 127 | sector_size_bytes - (entry_address - sector_address); |
| 128 | break; |
| 129 | } |
| 130 | |
| 131 | if (!status.ok()) { |
| 132 | ERR("Unexpected error in KVS initialization: %s", status.str()); |
| 133 | return Status::UNKNOWN; |
| 134 | } |
| 135 | |
| 136 | sector_corrupt_bytes += next_entry_address - entry_address; |
| 137 | } else if (!status.ok()) { |
| 138 | ERR("Unexpected error in KVS initialization: %s", status.str()); |
| 139 | return Status::UNKNOWN; |
Keir Mierle | 8c352dc | 2020-02-02 13:58:19 -0800 | [diff] [blame] | 140 | } |
Keir Mierle | 8c352dc | 2020-02-02 13:58:19 -0800 | [diff] [blame] | 141 | |
| 142 | // Entry loaded successfully; so get ready to load the next one. |
| 143 | entry_address = next_entry_address; |
| 144 | |
| 145 | // Update of the number of writable bytes in this sector. |
Wyatt Hepler | 2c7eca0 | 2020-02-18 16:01:42 -0800 | [diff] [blame] | 146 | sector.set_writable_bytes(sector_size_bytes - |
| 147 | (entry_address - sector_address)); |
Keir Mierle | 8c352dc | 2020-02-02 13:58:19 -0800 | [diff] [blame] | 148 | } |
Wyatt Hepler | 2c7eca0 | 2020-02-18 16:01:42 -0800 | [diff] [blame] | 149 | |
Alexei Frolov | d4adf91 | 2020-02-21 13:29:15 -0800 | [diff] [blame] | 150 | if (sector_corrupt_bytes > 0) { |
| 151 | // If the sector contains corrupt data, prevent any further entries from |
| 152 | // being written to it by indicating that it has no space. This should |
| 153 | // also make it a decent GC candidate. Valid keys in the sector are still |
| 154 | // readable as normal. |
| 155 | sector.set_writable_bytes(0); |
| 156 | |
| 157 | WRN("Sector %u contains %zuB of corrupt data", |
| 158 | SectorIndex(§or), |
| 159 | sector_corrupt_bytes); |
| 160 | } |
| 161 | |
David Rogers | 9162748 | 2020-02-27 17:38:12 -0800 | [diff] [blame] | 162 | if (sector.Empty(sector_size_bytes)) { |
| 163 | empty_sector_found = true; |
| 164 | } |
Wyatt Hepler | 2c7eca0 | 2020-02-18 16:01:42 -0800 | [diff] [blame] | 165 | sector_address += sector_size_bytes; |
Alexei Frolov | d4adf91 | 2020-02-21 13:29:15 -0800 | [diff] [blame] | 166 | total_corrupt_bytes += sector_corrupt_bytes; |
Keir Mierle | 8c352dc | 2020-02-02 13:58:19 -0800 | [diff] [blame] | 167 | } |
| 168 | |
| 169 | DBG("Second pass: Count valid bytes in each sector"); |
Wyatt Hepler | 1fc1104 | 2020-02-19 17:17:51 -0800 | [diff] [blame] | 170 | const KeyDescriptor* newest_key = nullptr; |
Wyatt Hepler | 1fc1104 | 2020-02-19 17:17:51 -0800 | [diff] [blame] | 171 | |
Keir Mierle | 8c352dc | 2020-02-02 13:58:19 -0800 | [diff] [blame] | 172 | // For every valid key, increment the valid bytes for that sector. |
Wyatt Hepler | 1c329ca | 2020-02-07 18:07:23 -0800 | [diff] [blame] | 173 | for (KeyDescriptor& key_descriptor : key_descriptors_) { |
David Rogers | f56131c | 2020-03-04 10:19:22 -0800 | [diff] [blame] | 174 | for (auto& address : key_descriptor.addresses()) { |
| 175 | Entry entry; |
David Rogers | a2562b5 | 2020-03-05 15:30:05 -0800 | [diff] [blame] | 176 | TRY(Entry::Read(partition_, address, formats_, &entry)); |
David Rogers | f56131c | 2020-03-04 10:19:22 -0800 | [diff] [blame] | 177 | SectorFromAddress(address)->AddValidBytes(entry.size()); |
| 178 | } |
Wyatt Hepler | 1fc1104 | 2020-02-19 17:17:51 -0800 | [diff] [blame] | 179 | if (key_descriptor.IsNewerThan(last_transaction_id_)) { |
| 180 | last_transaction_id_ = key_descriptor.transaction_id(); |
| 181 | newest_key = &key_descriptor; |
| 182 | } |
Keir Mierle | 8c352dc | 2020-02-02 13:58:19 -0800 | [diff] [blame] | 183 | } |
Wyatt Hepler | 1fc1104 | 2020-02-19 17:17:51 -0800 | [diff] [blame] | 184 | |
| 185 | if (newest_key == nullptr) { |
| 186 | last_new_sector_ = sectors_.begin(); |
| 187 | } else { |
David Rogers | f56131c | 2020-03-04 10:19:22 -0800 | [diff] [blame] | 188 | last_new_sector_ = SectorFromAddress(newest_key->addresses().back()); |
Wyatt Hepler | 1fc1104 | 2020-02-19 17:17:51 -0800 | [diff] [blame] | 189 | } |
| 190 | |
David Rogers | 9162748 | 2020-02-27 17:38:12 -0800 | [diff] [blame] | 191 | if (!empty_sector_found) { |
| 192 | // TODO: Record/report the error condition and recovery result. |
| 193 | Status gc_result = GarbageCollectPartial(); |
| 194 | |
| 195 | if (!gc_result.ok()) { |
| 196 | ERR("KVS init failed: Unable to maintain required free sector"); |
| 197 | return Status::INTERNAL; |
| 198 | } |
| 199 | } |
| 200 | |
Wyatt Hepler | 729f28c | 2020-02-05 09:46:00 -0800 | [diff] [blame] | 201 | initialized_ = true; |
David Rogers | 2e9e0c8 | 2020-02-13 15:06:06 -0800 | [diff] [blame] | 202 | |
Armando Montanez | 5464d5f | 2020-02-20 10:12:20 -0800 | [diff] [blame] | 203 | INF("KeyValueStore init complete: active keys %zu, deleted keys %zu, sectors " |
David Rogers | 2e9e0c8 | 2020-02-13 15:06:06 -0800 | [diff] [blame] | 204 | "%zu, logical sector size %zu bytes", |
| 205 | size(), |
| 206 | (key_descriptors_.size() - size()), |
| 207 | sectors_.size(), |
| 208 | partition_.sector_size_bytes()); |
| 209 | |
Alexei Frolov | d4adf91 | 2020-02-21 13:29:15 -0800 | [diff] [blame] | 210 | if (total_corrupt_bytes > 0) { |
| 211 | WRN("Found %zu corrupt bytes and %d corrupt entries during init process; " |
| 212 | "some keys may be missing", |
| 213 | total_corrupt_bytes, |
| 214 | corrupt_entries); |
| 215 | return Status::DATA_LOSS; |
| 216 | } |
| 217 | |
Keir Mierle | 8c352dc | 2020-02-02 13:58:19 -0800 | [diff] [blame] | 218 | return Status::OK; |
| 219 | } |
| 220 | |
Alexei Frolov | 9e23583 | 2020-02-24 12:44:45 -0800 | [diff] [blame] | 221 | KeyValueStore::StorageStats KeyValueStore::GetStorageStats() const { |
| 222 | StorageStats stats{0, 0, 0}; |
| 223 | const size_t sector_size = partition_.sector_size_bytes(); |
| 224 | bool found_empty_sector = false; |
| 225 | |
| 226 | for (const SectorDescriptor& sector : sectors_) { |
| 227 | stats.in_use_bytes += sector.valid_bytes(); |
| 228 | stats.reclaimable_bytes += sector.RecoverableBytes(sector_size); |
| 229 | |
| 230 | if (!found_empty_sector && sector.Empty(sector_size)) { |
| 231 | // The KVS tries to always keep an empty sector for GC, so don't count |
| 232 | // the first empty sector seen as writable space. However, a free sector |
| 233 | // cannot always be assumed to exist; if a GC operation fails, all sectors |
| 234 | // may be partially written, in which case the space reported might be |
| 235 | // inaccurate. |
| 236 | found_empty_sector = true; |
| 237 | continue; |
| 238 | } |
| 239 | |
| 240 | stats.writable_bytes += sector.writable_bytes(); |
| 241 | } |
| 242 | |
| 243 | return stats; |
| 244 | } |
| 245 | |
Keir Mierle | 8c352dc | 2020-02-02 13:58:19 -0800 | [diff] [blame] | 246 | Status KeyValueStore::LoadEntry(Address entry_address, |
| 247 | Address* next_entry_address) { |
Wyatt Hepler | e541e07 | 2020-02-14 09:10:53 -0800 | [diff] [blame] | 248 | Entry entry; |
Wyatt Hepler | 22d0d9f | 2020-03-05 14:57:11 -0800 | [diff] [blame] | 249 | TRY(Entry::Read(partition_, entry_address, formats_, &entry)); |
Keir Mierle | 8c352dc | 2020-02-02 13:58:19 -0800 | [diff] [blame] | 250 | |
| 251 | // Read the key from flash & validate the entry (which reads the value). |
Wyatt Hepler | a00d1ef | 2020-02-14 14:31:26 -0800 | [diff] [blame] | 252 | Entry::KeyBuffer key_buffer; |
Wyatt Hepler | e541e07 | 2020-02-14 09:10:53 -0800 | [diff] [blame] | 253 | TRY_ASSIGN(size_t key_length, entry.ReadKey(key_buffer)); |
| 254 | const string_view key(key_buffer.data(), key_length); |
Wyatt Hepler | bab0e20 | 2020-02-04 07:40:08 -0800 | [diff] [blame] | 255 | |
Wyatt Hepler | 22d0d9f | 2020-03-05 14:57:11 -0800 | [diff] [blame] | 256 | TRY(entry.VerifyChecksumInFlash()); |
David Rogers | f56131c | 2020-03-04 10:19:22 -0800 | [diff] [blame] | 257 | |
| 258 | // A valid entry was found, so update the next entry address before doing any |
| 259 | // of the checks that happen in AppendNewOrOverwriteStaleExistingDescriptor(). |
| 260 | *next_entry_address = entry.next_address(); |
Wyatt Hepler | 1fc1104 | 2020-02-19 17:17:51 -0800 | [diff] [blame] | 261 | TRY(AppendNewOrOverwriteStaleExistingDescriptor(entry.descriptor(key))); |
Keir Mierle | 8c352dc | 2020-02-02 13:58:19 -0800 | [diff] [blame] | 262 | |
Keir Mierle | 8c352dc | 2020-02-02 13:58:19 -0800 | [diff] [blame] | 263 | return Status::OK; |
| 264 | } |
| 265 | |
Alexei Frolov | d4adf91 | 2020-02-21 13:29:15 -0800 | [diff] [blame] | 266 | // Scans flash memory within a sector to find a KVS entry magic. |
Alexei Frolov | d4adf91 | 2020-02-21 13:29:15 -0800 | [diff] [blame] | 267 | Status KeyValueStore::ScanForEntry(const SectorDescriptor& sector, |
| 268 | Address start_address, |
| 269 | Address* next_entry_address) { |
| 270 | DBG("Scanning sector %u for entries starting from address %zx", |
| 271 | SectorIndex(§or), |
| 272 | size_t(start_address)); |
| 273 | |
| 274 | // Entries must start at addresses which are aligned on a multiple of |
| 275 | // Entry::kMinAlignmentBytes. However, that multiple can vary between entries. |
| 276 | // When scanning, we don't have an entry to tell us what the current alignment |
| 277 | // is, so the minimum alignment is used to be exhaustive. |
| 278 | for (Address address = AlignUp(start_address, Entry::kMinAlignmentBytes); |
| 279 | AddressInSector(sector, address); |
| 280 | address += Entry::kMinAlignmentBytes) { |
Alexei Frolov | d4adf91 | 2020-02-21 13:29:15 -0800 | [diff] [blame] | 281 | uint32_t magic; |
| 282 | TRY(partition_.Read(address, as_writable_bytes(span(&magic, 1)))); |
Wyatt Hepler | 22d0d9f | 2020-03-05 14:57:11 -0800 | [diff] [blame] | 283 | if (formats_.KnownMagic(magic)) { |
Alexei Frolov | d4adf91 | 2020-02-21 13:29:15 -0800 | [diff] [blame] | 284 | DBG("Found entry magic at address %zx", size_t(address)); |
| 285 | *next_entry_address = address; |
| 286 | return Status::OK; |
| 287 | } |
| 288 | } |
| 289 | |
| 290 | return Status::NOT_FOUND; |
| 291 | } |
| 292 | |
Keir Mierle | 8c352dc | 2020-02-02 13:58:19 -0800 | [diff] [blame] | 293 | // TODO: This method is the trigger of the O(valid_entries * all_entries) time |
| 294 | // complexity for reading. At some cost to memory, this could be optimized by |
| 295 | // using a hash table instead of scanning, but in practice this should be fine |
| 296 | // for a small number of keys |
| 297 | Status KeyValueStore::AppendNewOrOverwriteStaleExistingDescriptor( |
| 298 | const KeyDescriptor& key_descriptor) { |
| 299 | // With the new key descriptor, either add it to the descriptor table or |
| 300 | // overwrite an existing entry with an older version of the key. |
Wyatt Hepler | 1fc1104 | 2020-02-19 17:17:51 -0800 | [diff] [blame] | 301 | KeyDescriptor* existing_descriptor = FindDescriptor(key_descriptor.hash()); |
Keir Mierle | 8c352dc | 2020-02-02 13:58:19 -0800 | [diff] [blame] | 302 | |
Wyatt Hepler | 5406a67 | 2020-02-18 15:42:38 -0800 | [diff] [blame] | 303 | // Write a new entry. |
| 304 | if (existing_descriptor == nullptr) { |
| 305 | if (key_descriptors_.full()) { |
| 306 | return Status::RESOURCE_EXHAUSTED; |
| 307 | } |
| 308 | key_descriptors_.push_back(key_descriptor); |
Wyatt Hepler | 1fc1104 | 2020-02-19 17:17:51 -0800 | [diff] [blame] | 309 | } else if (key_descriptor.IsNewerThan( |
| 310 | existing_descriptor->transaction_id())) { |
Wyatt Hepler | 5406a67 | 2020-02-18 15:42:38 -0800 | [diff] [blame] | 311 | // Existing entry is old; replace the existing entry with the new one. |
| 312 | *existing_descriptor = key_descriptor; |
David Rogers | f56131c | 2020-03-04 10:19:22 -0800 | [diff] [blame] | 313 | } else if (existing_descriptor->transaction_id() == |
| 314 | key_descriptor.transaction_id()) { |
| 315 | // If the entries have a duplicate transaction ID, add the new (redundant) |
| 316 | // entry to the existing descriptor. |
| 317 | if (existing_descriptor->hash() != key_descriptor.hash()) { |
David Rogers | f3884eb | 2020-03-08 19:21:40 -0700 | [diff] [blame^] | 318 | ERR("Duplicate entry for key 0x%08" PRIx32 " with transaction ID %" PRIu32 |
David Rogers | f56131c | 2020-03-04 10:19:22 -0800 | [diff] [blame] | 319 | " has non-matching hash", |
| 320 | key_descriptor.hash(), |
| 321 | key_descriptor.transaction_id()); |
Wyatt Hepler | 5406a67 | 2020-02-18 15:42:38 -0800 | [diff] [blame] | 322 | return Status::DATA_LOSS; |
| 323 | } |
David Rogers | f56131c | 2020-03-04 10:19:22 -0800 | [diff] [blame] | 324 | |
| 325 | // Verify that this entry is not in the same sector as an existing copy of |
| 326 | // this same key. |
| 327 | for (auto address : existing_descriptor->addresses()) { |
| 328 | if (SectorFromAddress(address) == |
| 329 | SectorFromAddress(key_descriptor.address())) { |
| 330 | DBG("Multiple Redundant entries in same sector %u", |
| 331 | SectorIndex(SectorFromAddress(address))); |
| 332 | return Status::DATA_LOSS; |
| 333 | } |
| 334 | } |
| 335 | existing_descriptor->addresses().push_back(key_descriptor.address()); |
| 336 | } else { |
Wyatt Hepler | 5406a67 | 2020-02-18 15:42:38 -0800 | [diff] [blame] | 337 | DBG("Found stale entry when appending; ignoring"); |
Keir Mierle | 8c352dc | 2020-02-02 13:58:19 -0800 | [diff] [blame] | 338 | } |
Keir Mierle | 8c352dc | 2020-02-02 13:58:19 -0800 | [diff] [blame] | 339 | return Status::OK; |
| 340 | } |
| 341 | |
Keir Mierle | 8c352dc | 2020-02-02 13:58:19 -0800 | [diff] [blame] | 342 | KeyValueStore::KeyDescriptor* KeyValueStore::FindDescriptor(uint32_t hash) { |
Wyatt Hepler | 1c329ca | 2020-02-07 18:07:23 -0800 | [diff] [blame] | 343 | for (KeyDescriptor& key_descriptor : key_descriptors_) { |
Wyatt Hepler | 1fc1104 | 2020-02-19 17:17:51 -0800 | [diff] [blame] | 344 | if (key_descriptor.hash() == hash) { |
Wyatt Hepler | 1c329ca | 2020-02-07 18:07:23 -0800 | [diff] [blame] | 345 | return &key_descriptor; |
Keir Mierle | 8c352dc | 2020-02-02 13:58:19 -0800 | [diff] [blame] | 346 | } |
| 347 | } |
| 348 | return nullptr; |
Wyatt Hepler | 4da1fcb | 2020-01-30 17:32:18 -0800 | [diff] [blame] | 349 | } |
| 350 | |
| 351 | StatusWithSize KeyValueStore::Get(string_view key, |
Wyatt Hepler | 5f6efc0 | 2020-02-18 16:54:31 -0800 | [diff] [blame] | 352 | span<byte> value_buffer, |
| 353 | size_t offset_bytes) const { |
Wyatt Hepler | 50f7077 | 2020-02-13 11:25:10 -0800 | [diff] [blame] | 354 | TRY_WITH_SIZE(CheckOperation(key)); |
Wyatt Hepler | 4da1fcb | 2020-01-30 17:32:18 -0800 | [diff] [blame] | 355 | |
David Rogers | 2761aeb | 2020-01-31 17:09:00 -0800 | [diff] [blame] | 356 | const KeyDescriptor* key_descriptor; |
Wyatt Hepler | 2d40169 | 2020-02-13 16:01:23 -0800 | [diff] [blame] | 357 | TRY_WITH_SIZE(FindExistingKeyDescriptor(key, &key_descriptor)); |
Wyatt Hepler | 6c24c06 | 2020-02-05 15:30:49 -0800 | [diff] [blame] | 358 | |
Wyatt Hepler | fac8113 | 2020-02-27 17:26:33 -0800 | [diff] [blame] | 359 | return Get(key, *key_descriptor, value_buffer, offset_bytes); |
Wyatt Hepler | 4da1fcb | 2020-01-30 17:32:18 -0800 | [diff] [blame] | 360 | } |
| 361 | |
Wyatt Hepler | fac8113 | 2020-02-27 17:26:33 -0800 | [diff] [blame] | 362 | Status KeyValueStore::PutBytes(string_view key, span<const byte> value) { |
Keir Mierle | 8c352dc | 2020-02-02 13:58:19 -0800 | [diff] [blame] | 363 | DBG("Writing key/value; key length=%zu, value length=%zu", |
| 364 | key.size(), |
| 365 | value.size()); |
Wyatt Hepler | 729f28c | 2020-02-05 09:46:00 -0800 | [diff] [blame] | 366 | |
| 367 | TRY(CheckOperation(key)); |
Wyatt Hepler | 4da1fcb | 2020-01-30 17:32:18 -0800 | [diff] [blame] | 368 | |
Wyatt Hepler | 5406a67 | 2020-02-18 15:42:38 -0800 | [diff] [blame] | 369 | if (Entry::size(partition_, key, value) > partition_.sector_size_bytes()) { |
| 370 | DBG("%zu B value with %zu B key cannot fit in one sector", |
| 371 | value.size(), |
| 372 | key.size()); |
| 373 | return Status::INVALID_ARGUMENT; |
Wyatt Hepler | 4da1fcb | 2020-01-30 17:32:18 -0800 | [diff] [blame] | 374 | } |
| 375 | |
David Rogers | 2761aeb | 2020-01-31 17:09:00 -0800 | [diff] [blame] | 376 | KeyDescriptor* key_descriptor; |
Wyatt Hepler | 2d40169 | 2020-02-13 16:01:23 -0800 | [diff] [blame] | 377 | Status status = FindKeyDescriptor(key, &key_descriptor); |
| 378 | |
| 379 | if (status.ok()) { |
David Rogers | f56131c | 2020-03-04 10:19:22 -0800 | [diff] [blame] | 380 | // TODO: figure out logging how to support multiple addresses. |
David Rogers | f3884eb | 2020-03-08 19:21:40 -0700 | [diff] [blame^] | 381 | DBG("Overwriting entry for key 0x%08" PRIx32 " in %u sectors including %u", |
Wyatt Hepler | 1fc1104 | 2020-02-19 17:17:51 -0800 | [diff] [blame] | 382 | key_descriptor->hash(), |
David Rogers | f56131c | 2020-03-04 10:19:22 -0800 | [diff] [blame] | 383 | unsigned(key_descriptor->addresses().size()), |
| 384 | SectorIndex(SectorFromAddress(key_descriptor->address()))); |
Wyatt Hepler | 5a33d8c | 2020-02-06 09:32:58 -0800 | [diff] [blame] | 385 | return WriteEntryForExistingKey( |
| 386 | key_descriptor, KeyDescriptor::kValid, key, value); |
Wyatt Hepler | 4da1fcb | 2020-01-30 17:32:18 -0800 | [diff] [blame] | 387 | } |
David Rogers | 2761aeb | 2020-01-31 17:09:00 -0800 | [diff] [blame] | 388 | |
Wyatt Hepler | 2d40169 | 2020-02-13 16:01:23 -0800 | [diff] [blame] | 389 | if (status == Status::NOT_FOUND) { |
| 390 | return WriteEntryForNewKey(key, value); |
| 391 | } |
| 392 | |
| 393 | return status; |
Wyatt Hepler | 4da1fcb | 2020-01-30 17:32:18 -0800 | [diff] [blame] | 394 | } |
| 395 | |
| 396 | Status KeyValueStore::Delete(string_view key) { |
Wyatt Hepler | 729f28c | 2020-02-05 09:46:00 -0800 | [diff] [blame] | 397 | TRY(CheckOperation(key)); |
| 398 | |
Wyatt Hepler | 6c24c06 | 2020-02-05 15:30:49 -0800 | [diff] [blame] | 399 | KeyDescriptor* key_descriptor; |
Wyatt Hepler | 2d40169 | 2020-02-13 16:01:23 -0800 | [diff] [blame] | 400 | TRY(FindExistingKeyDescriptor(key, &key_descriptor)); |
Wyatt Hepler | 4da1fcb | 2020-01-30 17:32:18 -0800 | [diff] [blame] | 401 | |
David Rogers | f56131c | 2020-03-04 10:19:22 -0800 | [diff] [blame] | 402 | // TODO: figure out logging how to support multiple addresses. |
David Rogers | f3884eb | 2020-03-08 19:21:40 -0700 | [diff] [blame^] | 403 | DBG("Writing tombstone for key 0x%08" PRIx32 " in %u sectors including %u", |
Wyatt Hepler | 1fc1104 | 2020-02-19 17:17:51 -0800 | [diff] [blame] | 404 | key_descriptor->hash(), |
David Rogers | f56131c | 2020-03-04 10:19:22 -0800 | [diff] [blame] | 405 | unsigned(key_descriptor->addresses().size()), |
| 406 | SectorIndex(SectorFromAddress(key_descriptor->address()))); |
Wyatt Hepler | 5a33d8c | 2020-02-06 09:32:58 -0800 | [diff] [blame] | 407 | return WriteEntryForExistingKey( |
| 408 | key_descriptor, KeyDescriptor::kDeleted, key, {}); |
Wyatt Hepler | 6c24c06 | 2020-02-05 15:30:49 -0800 | [diff] [blame] | 409 | } |
| 410 | |
Wyatt Hepler | 08d37d8 | 2020-02-27 15:45:37 -0800 | [diff] [blame] | 411 | void KeyValueStore::Item::ReadKey() { |
| 412 | key_buffer_.fill('\0'); |
| 413 | |
| 414 | Entry entry; |
David Rogers | f3884eb | 2020-03-08 19:21:40 -0700 | [diff] [blame^] | 415 | // TODO: add support for using one of the redundant entries if reading the |
| 416 | // first copy fails. |
Wyatt Hepler | 22d0d9f | 2020-03-05 14:57:11 -0800 | [diff] [blame] | 417 | if (Entry::Read( |
| 418 | kvs_.partition_, descriptor_->address(), kvs_.formats_, &entry) |
| 419 | .ok()) { |
Wyatt Hepler | 08d37d8 | 2020-02-27 15:45:37 -0800 | [diff] [blame] | 420 | entry.ReadKey(key_buffer_); |
| 421 | } |
| 422 | } |
| 423 | |
Wyatt Hepler | 6c24c06 | 2020-02-05 15:30:49 -0800 | [diff] [blame] | 424 | KeyValueStore::iterator& KeyValueStore::iterator::operator++() { |
| 425 | // Skip to the next entry that is valid (not deleted). |
Wyatt Hepler | 08d37d8 | 2020-02-27 15:45:37 -0800 | [diff] [blame] | 426 | while (++item_.descriptor_ != item_.kvs_.key_descriptors_.end() && |
| 427 | item_.descriptor_->deleted()) { |
Wyatt Hepler | 6c24c06 | 2020-02-05 15:30:49 -0800 | [diff] [blame] | 428 | } |
| 429 | return *this; |
| 430 | } |
| 431 | |
Wyatt Hepler | 6c24c06 | 2020-02-05 15:30:49 -0800 | [diff] [blame] | 432 | KeyValueStore::iterator KeyValueStore::begin() const { |
Wyatt Hepler | 08d37d8 | 2020-02-27 15:45:37 -0800 | [diff] [blame] | 433 | const KeyDescriptor* descriptor = key_descriptors_.begin(); |
Wyatt Hepler | 6c24c06 | 2020-02-05 15:30:49 -0800 | [diff] [blame] | 434 | // Skip over any deleted entries at the start of the descriptor list. |
Wyatt Hepler | 08d37d8 | 2020-02-27 15:45:37 -0800 | [diff] [blame] | 435 | while (descriptor != key_descriptors_.end() && descriptor->deleted()) { |
| 436 | ++descriptor; |
Wyatt Hepler | 6c24c06 | 2020-02-05 15:30:49 -0800 | [diff] [blame] | 437 | } |
Wyatt Hepler | 08d37d8 | 2020-02-27 15:45:37 -0800 | [diff] [blame] | 438 | return iterator(*this, descriptor); |
Wyatt Hepler | 6c24c06 | 2020-02-05 15:30:49 -0800 | [diff] [blame] | 439 | } |
| 440 | |
| 441 | // TODO(hepler): The valid entry count could be tracked in the KVS to avoid the |
| 442 | // need for this for-loop. |
| 443 | size_t KeyValueStore::size() const { |
| 444 | size_t valid_entries = 0; |
| 445 | |
Wyatt Hepler | 1c329ca | 2020-02-07 18:07:23 -0800 | [diff] [blame] | 446 | for (const KeyDescriptor& key_descriptor : key_descriptors_) { |
| 447 | if (!key_descriptor.deleted()) { |
Wyatt Hepler | 6c24c06 | 2020-02-05 15:30:49 -0800 | [diff] [blame] | 448 | valid_entries += 1; |
| 449 | } |
| 450 | } |
| 451 | |
| 452 | return valid_entries; |
Wyatt Hepler | 4da1fcb | 2020-01-30 17:32:18 -0800 | [diff] [blame] | 453 | } |
| 454 | |
Wyatt Hepler | ed163b0 | 2020-02-03 17:49:32 -0800 | [diff] [blame] | 455 | StatusWithSize KeyValueStore::ValueSize(std::string_view key) const { |
Wyatt Hepler | 50f7077 | 2020-02-13 11:25:10 -0800 | [diff] [blame] | 456 | TRY_WITH_SIZE(CheckOperation(key)); |
Wyatt Hepler | ed163b0 | 2020-02-03 17:49:32 -0800 | [diff] [blame] | 457 | |
| 458 | const KeyDescriptor* key_descriptor; |
Wyatt Hepler | 2d40169 | 2020-02-13 16:01:23 -0800 | [diff] [blame] | 459 | TRY_WITH_SIZE(FindExistingKeyDescriptor(key, &key_descriptor)); |
Wyatt Hepler | 6c24c06 | 2020-02-05 15:30:49 -0800 | [diff] [blame] | 460 | |
Wyatt Hepler | fac8113 | 2020-02-27 17:26:33 -0800 | [diff] [blame] | 461 | return ValueSize(*key_descriptor); |
| 462 | } |
Wyatt Hepler | ed163b0 | 2020-02-03 17:49:32 -0800 | [diff] [blame] | 463 | |
Wyatt Hepler | fac8113 | 2020-02-27 17:26:33 -0800 | [diff] [blame] | 464 | StatusWithSize KeyValueStore::Get(string_view key, |
| 465 | const KeyDescriptor& descriptor, |
| 466 | span<std::byte> value_buffer, |
| 467 | size_t offset_bytes) const { |
| 468 | Entry entry; |
David Rogers | a2562b5 | 2020-03-05 15:30:05 -0800 | [diff] [blame] | 469 | // TODO: add support for using one of the redundant entries if reading the |
| 470 | // first copy fails. |
Wyatt Hepler | 22d0d9f | 2020-03-05 14:57:11 -0800 | [diff] [blame] | 471 | TRY_WITH_SIZE( |
| 472 | Entry::Read(partition_, descriptor.address(), formats_, &entry)); |
Wyatt Hepler | fac8113 | 2020-02-27 17:26:33 -0800 | [diff] [blame] | 473 | |
| 474 | StatusWithSize result = entry.ReadValue(value_buffer, offset_bytes); |
| 475 | if (result.ok() && options_.verify_on_read && offset_bytes == 0u) { |
Wyatt Hepler | 22d0d9f | 2020-03-05 14:57:11 -0800 | [diff] [blame] | 476 | Status verify_result = |
| 477 | entry.VerifyChecksum(key, value_buffer.first(result.size())); |
Wyatt Hepler | fac8113 | 2020-02-27 17:26:33 -0800 | [diff] [blame] | 478 | if (!verify_result.ok()) { |
| 479 | std::memset(value_buffer.data(), 0, result.size()); |
| 480 | return StatusWithSize(verify_result, 0); |
| 481 | } |
| 482 | |
| 483 | return StatusWithSize(verify_result, result.size()); |
| 484 | } |
| 485 | return result; |
Wyatt Hepler | ed163b0 | 2020-02-03 17:49:32 -0800 | [diff] [blame] | 486 | } |
| 487 | |
Wyatt Hepler | 6e3a83b | 2020-02-04 07:36:45 -0800 | [diff] [blame] | 488 | Status KeyValueStore::FixedSizeGet(std::string_view key, |
Wyatt Hepler | fac8113 | 2020-02-27 17:26:33 -0800 | [diff] [blame] | 489 | void* value, |
| 490 | size_t size_bytes) const { |
| 491 | TRY(CheckOperation(key)); |
| 492 | |
| 493 | const KeyDescriptor* descriptor; |
| 494 | TRY(FindExistingKeyDescriptor(key, &descriptor)); |
| 495 | |
| 496 | return FixedSizeGet(key, *descriptor, value, size_bytes); |
| 497 | } |
| 498 | |
| 499 | Status KeyValueStore::FixedSizeGet(std::string_view key, |
| 500 | const KeyDescriptor& descriptor, |
| 501 | void* value, |
Wyatt Hepler | 6e3a83b | 2020-02-04 07:36:45 -0800 | [diff] [blame] | 502 | size_t size_bytes) const { |
| 503 | // Ensure that the size of the stored value matches the size of the type. |
| 504 | // Otherwise, report error. This check avoids potential memory corruption. |
Wyatt Hepler | fac8113 | 2020-02-27 17:26:33 -0800 | [diff] [blame] | 505 | TRY_ASSIGN(const size_t actual_size, ValueSize(descriptor)); |
| 506 | |
| 507 | if (actual_size != size_bytes) { |
| 508 | DBG("Requested %zu B read, but value is %zu B", size_bytes, actual_size); |
Wyatt Hepler | 6e3a83b | 2020-02-04 07:36:45 -0800 | [diff] [blame] | 509 | return Status::INVALID_ARGUMENT; |
Wyatt Hepler | bab0e20 | 2020-02-04 07:40:08 -0800 | [diff] [blame] | 510 | } |
Wyatt Hepler | fac8113 | 2020-02-27 17:26:33 -0800 | [diff] [blame] | 511 | |
| 512 | StatusWithSize result = |
| 513 | Get(key, descriptor, span(static_cast<byte*>(value), size_bytes), 0); |
| 514 | |
| 515 | return result.status(); |
| 516 | } |
| 517 | |
| 518 | StatusWithSize KeyValueStore::ValueSize(const KeyDescriptor& descriptor) const { |
| 519 | Entry entry; |
David Rogers | f3884eb | 2020-03-08 19:21:40 -0700 | [diff] [blame^] | 520 | // TODO: add support for using one of the redundant entries if reading the |
| 521 | // first copy fails. |
Wyatt Hepler | 22d0d9f | 2020-03-05 14:57:11 -0800 | [diff] [blame] | 522 | TRY_WITH_SIZE( |
| 523 | Entry::Read(partition_, descriptor.address(), formats_, &entry)); |
Wyatt Hepler | fac8113 | 2020-02-27 17:26:33 -0800 | [diff] [blame] | 524 | |
| 525 | return StatusWithSize(entry.value_size()); |
Keir Mierle | 8c352dc | 2020-02-02 13:58:19 -0800 | [diff] [blame] | 526 | } |
| 527 | |
Wyatt Hepler | 729f28c | 2020-02-05 09:46:00 -0800 | [diff] [blame] | 528 | Status KeyValueStore::CheckOperation(string_view key) const { |
Wyatt Hepler | acaacf9 | 2020-01-24 10:58:30 -0800 | [diff] [blame] | 529 | if (InvalidKey(key)) { |
Wyatt Hepler | b760954 | 2020-01-24 10:29:54 -0800 | [diff] [blame] | 530 | return Status::INVALID_ARGUMENT; |
| 531 | } |
Wyatt Hepler | d229828 | 2020-02-20 17:12:45 -0800 | [diff] [blame] | 532 | if (!initialized()) { |
Wyatt Hepler | b760954 | 2020-01-24 10:29:54 -0800 | [diff] [blame] | 533 | return Status::FAILED_PRECONDITION; |
| 534 | } |
Wyatt Hepler | b760954 | 2020-01-24 10:29:54 -0800 | [diff] [blame] | 535 | return Status::OK; |
| 536 | } |
| 537 | |
Wyatt Hepler | 2d40169 | 2020-02-13 16:01:23 -0800 | [diff] [blame] | 538 | // Searches for a KeyDescriptor that matches this key and sets *result to point |
| 539 | // to it if one is found. |
| 540 | // |
| 541 | // OK: there is a matching descriptor and *result is set |
| 542 | // NOT_FOUND: there is no descriptor that matches this key, but this key |
| 543 | // has a unique hash (and could potentially be added to the KVS) |
| 544 | // ALREADY_EXISTS: there is no descriptor that matches this key, but the |
| 545 | // key's hash collides with the hash for an existing descriptor |
| 546 | // |
David Rogers | 2761aeb | 2020-01-31 17:09:00 -0800 | [diff] [blame] | 547 | Status KeyValueStore::FindKeyDescriptor(string_view key, |
| 548 | const KeyDescriptor** result) const { |
Wyatt Hepler | 1fc1104 | 2020-02-19 17:17:51 -0800 | [diff] [blame] | 549 | const uint32_t hash = internal::Hash(key); |
Wyatt Hepler | a00d1ef | 2020-02-14 14:31:26 -0800 | [diff] [blame] | 550 | Entry::KeyBuffer key_buffer; |
Wyatt Hepler | b760954 | 2020-01-24 10:29:54 -0800 | [diff] [blame] | 551 | |
Wyatt Hepler | 1c329ca | 2020-02-07 18:07:23 -0800 | [diff] [blame] | 552 | for (auto& descriptor : key_descriptors_) { |
Wyatt Hepler | 1fc1104 | 2020-02-19 17:17:51 -0800 | [diff] [blame] | 553 | if (descriptor.hash() == hash) { |
David Rogers | f3884eb | 2020-03-08 19:21:40 -0700 | [diff] [blame^] | 554 | // TODO: add support for using one of the redundant entries if reading the |
| 555 | // first copy fails. |
Wyatt Hepler | e541e07 | 2020-02-14 09:10:53 -0800 | [diff] [blame] | 556 | TRY(Entry::ReadKey( |
Wyatt Hepler | 1fc1104 | 2020-02-19 17:17:51 -0800 | [diff] [blame] | 557 | partition_, descriptor.address(), key.size(), key_buffer.data())); |
Wyatt Hepler | b760954 | 2020-01-24 10:29:54 -0800 | [diff] [blame] | 558 | |
Wyatt Hepler | e541e07 | 2020-02-14 09:10:53 -0800 | [diff] [blame] | 559 | if (key == string_view(key_buffer.data(), key.size())) { |
Wyatt Hepler | 5a33d8c | 2020-02-06 09:32:58 -0800 | [diff] [blame] | 560 | DBG("Found match for key hash 0x%08" PRIx32, hash); |
David Rogers | 2761aeb | 2020-01-31 17:09:00 -0800 | [diff] [blame] | 561 | *result = &descriptor; |
Wyatt Hepler | b760954 | 2020-01-24 10:29:54 -0800 | [diff] [blame] | 562 | return Status::OK; |
Wyatt Hepler | 2d40169 | 2020-02-13 16:01:23 -0800 | [diff] [blame] | 563 | } else { |
| 564 | WRN("Found key hash collision for 0x%08" PRIx32, hash); |
| 565 | return Status::ALREADY_EXISTS; |
Wyatt Hepler | b760954 | 2020-01-24 10:29:54 -0800 | [diff] [blame] | 566 | } |
Wyatt Hepler | b760954 | 2020-01-24 10:29:54 -0800 | [diff] [blame] | 567 | } |
| 568 | } |
Wyatt Hepler | 4da1fcb | 2020-01-30 17:32:18 -0800 | [diff] [blame] | 569 | return Status::NOT_FOUND; |
| 570 | } |
| 571 | |
Wyatt Hepler | 2d40169 | 2020-02-13 16:01:23 -0800 | [diff] [blame] | 572 | // Searches for a KeyDescriptor that matches this key and sets *result to point |
| 573 | // to it if one is found. |
| 574 | // |
| 575 | // OK: there is a matching descriptor and *result is set |
| 576 | // NOT_FOUND: there is no descriptor that matches this key |
| 577 | // |
| 578 | Status KeyValueStore::FindExistingKeyDescriptor( |
| 579 | string_view key, const KeyDescriptor** result) const { |
| 580 | Status status = FindKeyDescriptor(key, result); |
| 581 | |
| 582 | // If the key's hash collides with an existing key or if the key is deleted, |
| 583 | // treat it as if it is not in the KVS. |
| 584 | if (status == Status::ALREADY_EXISTS || |
| 585 | (status.ok() && (*result)->deleted())) { |
| 586 | return Status::NOT_FOUND; |
| 587 | } |
| 588 | return status; |
| 589 | } |
| 590 | |
David Rogers | 2761aeb | 2020-01-31 17:09:00 -0800 | [diff] [blame] | 591 | Status KeyValueStore::WriteEntryForExistingKey(KeyDescriptor* key_descriptor, |
Wyatt Hepler | 5a33d8c | 2020-02-06 09:32:58 -0800 | [diff] [blame] | 592 | KeyDescriptor::State new_state, |
Wyatt Hepler | 4da1fcb | 2020-01-30 17:32:18 -0800 | [diff] [blame] | 593 | string_view key, |
| 594 | span<const byte> value) { |
Wyatt Hepler | 30a5215 | 2020-02-12 11:26:05 -0800 | [diff] [blame] | 595 | Entry original_entry; |
David Rogers | a2562b5 | 2020-03-05 15:30:05 -0800 | [diff] [blame] | 596 | // TODO: add support for using one of the redundant entries if reading the |
| 597 | // first copy fails. |
Wyatt Hepler | 22d0d9f | 2020-03-05 14:57:11 -0800 | [diff] [blame] | 598 | TRY(Entry::Read( |
| 599 | partition_, key_descriptor->address(), formats_, &original_entry)); |
Wyatt Hepler | 6c24c06 | 2020-02-05 15:30:49 -0800 | [diff] [blame] | 600 | |
David Rogers | a2562b5 | 2020-03-05 15:30:05 -0800 | [diff] [blame] | 601 | // Create a new temporary key descriptor to use while writing the new |
| 602 | // key-value out to flash. Once the writing is done, update the main |
| 603 | // descriptor for this key with the new information. |
| 604 | KeyDescriptor new_key_descriptor(key); |
| 605 | TRY(WriteEntry(&new_key_descriptor, key, value, new_state)); |
David Rogers | 3464d0a | 2020-02-07 11:45:46 -0800 | [diff] [blame] | 606 | |
David Rogers | a2562b5 | 2020-03-05 15:30:05 -0800 | [diff] [blame] | 607 | // Update the main descriptor for the new key version. |
David Rogers | f56131c | 2020-03-04 10:19:22 -0800 | [diff] [blame] | 608 | KeyDescriptor old_key_descriptor = *key_descriptor; |
David Rogers | a2562b5 | 2020-03-05 15:30:05 -0800 | [diff] [blame] | 609 | *key_descriptor = new_key_descriptor; |
David Rogers | 3464d0a | 2020-02-07 11:45:46 -0800 | [diff] [blame] | 610 | |
David Rogers | a2562b5 | 2020-03-05 15:30:05 -0800 | [diff] [blame] | 611 | // Remove all the valid bytes for the old key version, which are now stale. |
David Rogers | f56131c | 2020-03-04 10:19:22 -0800 | [diff] [blame] | 612 | for (auto& address : old_key_descriptor.addresses()) { |
| 613 | SectorFromAddress(address)->RemoveValidBytes(original_entry.size()); |
| 614 | } |
| 615 | |
Wyatt Hepler | 5a33d8c | 2020-02-06 09:32:58 -0800 | [diff] [blame] | 616 | return Status::OK; |
Wyatt Hepler | 4da1fcb | 2020-01-30 17:32:18 -0800 | [diff] [blame] | 617 | } |
| 618 | |
| 619 | Status KeyValueStore::WriteEntryForNewKey(string_view key, |
| 620 | span<const byte> value) { |
Wyatt Hepler | 1c329ca | 2020-02-07 18:07:23 -0800 | [diff] [blame] | 621 | if (key_descriptors_.full()) { |
Keir Mierle | 8c352dc | 2020-02-02 13:58:19 -0800 | [diff] [blame] | 622 | WRN("KVS full: trying to store a new entry, but can't. Have %zu entries", |
Wyatt Hepler | 1c329ca | 2020-02-07 18:07:23 -0800 | [diff] [blame] | 623 | key_descriptors_.size()); |
Wyatt Hepler | 4da1fcb | 2020-01-30 17:32:18 -0800 | [diff] [blame] | 624 | return Status::RESOURCE_EXHAUSTED; |
| 625 | } |
| 626 | |
David Rogers | a2562b5 | 2020-03-05 15:30:05 -0800 | [diff] [blame] | 627 | // Create the KeyDescriptor that will be added to the list and write it to |
| 628 | // flash. |
Wyatt Hepler | 1fc1104 | 2020-02-19 17:17:51 -0800 | [diff] [blame] | 629 | KeyDescriptor key_descriptor(key); |
David Rogers | a2562b5 | 2020-03-05 15:30:05 -0800 | [diff] [blame] | 630 | TRY(WriteEntry(&key_descriptor, key, value, KeyDescriptor::kValid)); |
Wyatt Hepler | 4da1fcb | 2020-01-30 17:32:18 -0800 | [diff] [blame] | 631 | |
Wyatt Hepler | 1c329ca | 2020-02-07 18:07:23 -0800 | [diff] [blame] | 632 | // Only add the entry when we are certain the write succeeded. |
| 633 | key_descriptors_.push_back(key_descriptor); |
Wyatt Hepler | b760954 | 2020-01-24 10:29:54 -0800 | [diff] [blame] | 634 | return Status::OK; |
| 635 | } |
| 636 | |
David Rogers | a2562b5 | 2020-03-05 15:30:05 -0800 | [diff] [blame] | 637 | Status KeyValueStore::WriteEntry(KeyDescriptor* key_descriptor, |
| 638 | string_view key, |
| 639 | span<const byte> value, |
| 640 | KeyDescriptor::State new_state) { |
| 641 | size_t entry_size = Entry::size(partition_, key, value); |
| 642 | |
| 643 | Entry entry = CreateEntry(0, key, value, new_state); |
| 644 | *key_descriptor = entry.descriptor(key); |
| 645 | key_descriptor->addresses().clear(); |
| 646 | |
| 647 | // For number of redundany entries to be written, do the following: |
| 648 | // - Find a sector to write an individual entry to. This optionally will |
| 649 | // include garbage collecting one or more sectors if needed. |
| 650 | // - Write the entry to the sector. |
| 651 | // - Repeat for redundancy number of total entries. |
David Rogers | f3884eb | 2020-03-08 19:21:40 -0700 | [diff] [blame^] | 652 | for (size_t i = 0; i < redundancy_; i++) { |
David Rogers | a2562b5 | 2020-03-05 15:30:05 -0800 | [diff] [blame] | 653 | SectorDescriptor* sector; |
| 654 | TRY(GetSectorForWrite(§or, entry_size, key_descriptor)); |
| 655 | |
| 656 | DBG("Writing entry %zu; found sector: %u", i, SectorIndex(sector)); |
| 657 | const Address write_address = NextWritableAddress(sector); |
| 658 | TRY(AppendEntry(write_address, entry, key, value)); |
| 659 | |
| 660 | // Entry copy was written successfully; update the key descriptor to reflect |
| 661 | // the new entry. |
| 662 | key_descriptor->addresses().push_back(write_address); |
| 663 | } |
| 664 | |
| 665 | // Once all the entries are written, add valid bytes to each of the sectors |
| 666 | // that entries were written to. |
| 667 | for (auto new_address : key_descriptor->addresses()) { |
| 668 | SectorFromAddress(new_address)->AddValidBytes(entry.size()); |
| 669 | } |
| 670 | |
| 671 | return Status::OK; |
| 672 | } |
| 673 | |
| 674 | // Find a sector to use for writing a new entry to. Do automatic garbage |
| 675 | // collection if needed and allowed. |
| 676 | // |
| 677 | // OK: Sector found with needed space. |
| 678 | // RESOURCE_EXHAUSTED: No sector available with the needed space. |
| 679 | Status KeyValueStore::GetSectorForWrite(SectorDescriptor** sector, |
| 680 | size_t entry_size, |
| 681 | KeyDescriptor* key_descriptor) { |
| 682 | Status result = FindSectorWithSpace( |
| 683 | sector, entry_size, kAppendEntry, key_descriptor->addresses()); |
| 684 | |
David Rogers | f3884eb | 2020-03-08 19:21:40 -0700 | [diff] [blame^] | 685 | size_t gc_sector_count = 0; |
David Rogers | a2562b5 | 2020-03-05 15:30:05 -0800 | [diff] [blame] | 686 | bool do_auto_gc = options_.gc_on_write != GargbageCollectOnWrite::kDisabled; |
| 687 | |
| 688 | // Do garbage collection as needed, so long as policy allows. |
| 689 | while (result == Status::RESOURCE_EXHAUSTED && do_auto_gc) { |
| 690 | if (options_.gc_on_write == GargbageCollectOnWrite::kOneSector) { |
| 691 | // If GC config option is kOneSector clear the flag to not do any more |
| 692 | // GC after this try. |
| 693 | do_auto_gc = false; |
| 694 | } |
| 695 | // Garbage collect and then try again to find the best sector. |
David Rogers | f3884eb | 2020-03-08 19:21:40 -0700 | [diff] [blame^] | 696 | Status gc_status = GarbageCollectPartial(key_descriptor); |
David Rogers | a2562b5 | 2020-03-05 15:30:05 -0800 | [diff] [blame] | 697 | if (!gc_status.ok()) { |
| 698 | if (gc_status == Status::NOT_FOUND) { |
| 699 | // Not enough space, and no reclaimable bytes, this KVS is full! |
| 700 | return Status::RESOURCE_EXHAUSTED; |
| 701 | } |
| 702 | return gc_status; |
| 703 | } |
| 704 | |
| 705 | result = FindSectorWithSpace( |
| 706 | sector, entry_size, kAppendEntry, key_descriptor->addresses()); |
David Rogers | f3884eb | 2020-03-08 19:21:40 -0700 | [diff] [blame^] | 707 | |
| 708 | gc_sector_count++; |
| 709 | // Allow total sectors + 2 number of GC cycles so that once reclaimable |
| 710 | // bytes in all the sectors have been reclaimed can try and free up space by |
| 711 | // moving entries for keys other than the one being worked on in to sectors |
| 712 | // that have copies of the key trying to be written. |
| 713 | if (gc_sector_count > (partition_.sector_count() + 2)) { |
| 714 | ERR("Did more GC sectors than total sectors!!!!"); |
| 715 | return Status::RESOURCE_EXHAUSTED; |
| 716 | } |
David Rogers | a2562b5 | 2020-03-05 15:30:05 -0800 | [diff] [blame] | 717 | } |
| 718 | |
| 719 | if (!result.ok()) { |
| 720 | WRN("Unable to find sector to write %zu B", entry_size); |
| 721 | } |
| 722 | return result; |
| 723 | } |
| 724 | |
| 725 | Status KeyValueStore::AppendEntry(Address write_address, |
| 726 | Entry& entry, |
| 727 | string_view key, |
| 728 | span<const byte> value) { |
| 729 | entry.UpdateAddress(write_address); |
| 730 | |
| 731 | StatusWithSize result = entry.Write(key, value); |
| 732 | // Remove any bytes that were written, even if the write was not successful. |
| 733 | // This is important to retain the writable space invariant on the sectors. |
| 734 | SectorFromAddress(write_address)->RemoveWritableBytes(result.size()); |
| 735 | |
| 736 | if (!result.ok()) { |
| 737 | ERR("Failed to write %zu bytes at %#zx. %zu actually written", |
| 738 | entry.size(), |
| 739 | size_t(write_address), |
| 740 | result.size()); |
| 741 | return result.status(); |
| 742 | } |
| 743 | |
| 744 | if (options_.verify_on_write) { |
| 745 | TRY(entry.VerifyChecksumInFlash()); |
| 746 | } |
| 747 | |
| 748 | return Status::OK; |
| 749 | } |
| 750 | |
David Rogers | f3884eb | 2020-03-08 19:21:40 -0700 | [diff] [blame^] | 751 | Status KeyValueStore::RelocateEntry(KeyDescriptor* key_descriptor, |
David Rogers | a2562b5 | 2020-03-05 15:30:05 -0800 | [diff] [blame] | 752 | KeyValueStore::Address old_address) { |
| 753 | Entry entry; |
| 754 | TRY(Entry::Read(partition_, old_address, formats_, &entry)); |
| 755 | |
| 756 | // Find a new sector for the entry and write it to the new location. For |
| 757 | // relocation the find should not not be a sector already containing the key |
| 758 | // but can be the always empty sector, since this is part of the GC process |
| 759 | // that will result in a new empty sector. Also find a sector that does not |
| 760 | // have reclaimable space (mostly for the full GC, where that would result in |
| 761 | // an immediate extra relocation). |
| 762 | SectorDescriptor* new_sector; |
| 763 | |
| 764 | TRY(FindSectorWithSpace( |
David Rogers | f3884eb | 2020-03-08 19:21:40 -0700 | [diff] [blame^] | 765 | &new_sector, entry.size(), kGarbageCollect, key_descriptor->addresses())); |
David Rogers | a2562b5 | 2020-03-05 15:30:05 -0800 | [diff] [blame] | 766 | const Address new_address = NextWritableAddress(new_sector); |
| 767 | TRY(MoveEntry(new_address, entry)); |
| 768 | |
| 769 | // TODO: Perhaps add check that the entry matches the key descriptor (key |
| 770 | // hash, ID, checksum). |
| 771 | |
| 772 | // Entry was written successfully; update the key descriptor and the sector |
| 773 | // descriptors to reflect the new entry. |
David Rogers | f3884eb | 2020-03-08 19:21:40 -0700 | [diff] [blame^] | 774 | TRY(key_descriptor->UpdateAddress(old_address, new_address)); |
| 775 | |
| 776 | if ((key_descriptor >= key_descriptors_.begin()) && |
| 777 | (key_descriptor < key_descriptors_.end())) { |
| 778 | // If the key_descriptor is in the main key_descriptors_ list, it has been |
| 779 | // accounted for in valid bytes, so only do valid byte updates for those |
| 780 | // descriptors. |
| 781 | new_sector->AddValidBytes(entry.size()); |
| 782 | SectorFromAddress(old_address)->RemoveValidBytes(entry.size()); |
| 783 | } |
David Rogers | a2562b5 | 2020-03-05 15:30:05 -0800 | [diff] [blame] | 784 | |
| 785 | return Status::OK; |
| 786 | } |
| 787 | |
| 788 | Status KeyValueStore::MoveEntry(Address new_address, Entry& entry) { |
| 789 | // Step 1: Read the old entry. |
David Rogers | f0a3544 | 2020-02-04 12:16:38 -0800 | [diff] [blame] | 790 | struct TempEntry { |
Wyatt Hepler | e541e07 | 2020-02-14 09:10:53 -0800 | [diff] [blame] | 791 | Entry::KeyBuffer key; |
Wyatt Hepler | ce7b8df | 2020-02-21 10:38:39 -0800 | [diff] [blame] | 792 | std::array<byte, sizeof(working_buffer_) - sizeof(key)> value; |
David Rogers | f0a3544 | 2020-02-04 12:16:38 -0800 | [diff] [blame] | 793 | }; |
Wyatt Hepler | ce7b8df | 2020-02-21 10:38:39 -0800 | [diff] [blame] | 794 | auto [key_buffer, value_buffer] = |
| 795 | *std::launder(reinterpret_cast<TempEntry*>(working_buffer_.data())); |
David Rogers | f0a3544 | 2020-02-04 12:16:38 -0800 | [diff] [blame] | 796 | |
Wyatt Hepler | e541e07 | 2020-02-14 09:10:53 -0800 | [diff] [blame] | 797 | // Read the entry to be relocated. Store the entry in a local variable and |
David Rogers | f0a3544 | 2020-02-04 12:16:38 -0800 | [diff] [blame] | 798 | // store the key and value in the TempEntry stored in the static allocated |
| 799 | // working_buffer_. |
Wyatt Hepler | ce7b8df | 2020-02-21 10:38:39 -0800 | [diff] [blame] | 800 | TRY_ASSIGN(size_t key_length, entry.ReadKey(key_buffer)); |
| 801 | string_view key = string_view(key_buffer.data(), key_length); |
| 802 | |
| 803 | StatusWithSize result = entry.ReadValue(value_buffer); |
| 804 | if (!result.ok()) { |
David Rogers | f0a3544 | 2020-02-04 12:16:38 -0800 | [diff] [blame] | 805 | return Status::INTERNAL; |
| 806 | } |
| 807 | |
Wyatt Hepler | ce7b8df | 2020-02-21 10:38:39 -0800 | [diff] [blame] | 808 | const span value = span(value_buffer.data(), result.size()); |
Wyatt Hepler | 22d0d9f | 2020-03-05 14:57:11 -0800 | [diff] [blame] | 809 | TRY(entry.VerifyChecksum(key, value)); |
David Rogers | f0a3544 | 2020-02-04 12:16:38 -0800 | [diff] [blame] | 810 | |
David Rogers | f3884eb | 2020-03-08 19:21:40 -0700 | [diff] [blame^] | 811 | DBG("Moving %zu B entry with transaction ID %zu to to sector %u address %#zx", |
David Rogers | a2562b5 | 2020-03-05 15:30:05 -0800 | [diff] [blame] | 812 | entry.size(), |
| 813 | size_t(entry.transaction_id()), |
David Rogers | f3884eb | 2020-03-08 19:21:40 -0700 | [diff] [blame^] | 814 | SectorIndex(SectorFromAddress(new_address)), |
David Rogers | a2562b5 | 2020-03-05 15:30:05 -0800 | [diff] [blame] | 815 | size_t(new_address)); |
David Rogers | cd87c32 | 2020-02-27 14:04:08 -0800 | [diff] [blame] | 816 | |
David Rogers | a2562b5 | 2020-03-05 15:30:05 -0800 | [diff] [blame] | 817 | // Step 2: Write the entry to the new location. |
| 818 | entry.UpdateAddress(new_address); |
| 819 | result = entry.Write(key, value); |
| 820 | |
| 821 | // Remove any bytes that were written, even if the write was not successful. |
| 822 | // This is important to retain the writable space invariant on the sectors. |
| 823 | SectorFromAddress(new_address)->RemoveWritableBytes(result.size()); |
| 824 | |
| 825 | if (!result.ok()) { |
| 826 | ERR("Failed to write %zu bytes at %" PRIx32 ". %zu actually written", |
| 827 | entry.size(), |
| 828 | new_address, |
| 829 | result.size()); |
| 830 | return result.status(); |
David Rogers | f56131c | 2020-03-04 10:19:22 -0800 | [diff] [blame] | 831 | } |
| 832 | |
David Rogers | a2562b5 | 2020-03-05 15:30:05 -0800 | [diff] [blame] | 833 | // Step 3: Verify write to the new location. |
| 834 | if (options_.verify_on_write) { |
| 835 | TRY(entry.VerifyChecksumInFlash()); |
David Rogers | f56131c | 2020-03-04 10:19:22 -0800 | [diff] [blame] | 836 | } |
David Rogers | df025cd | 2020-02-06 17:05:34 -0800 | [diff] [blame] | 837 | |
| 838 | return Status::OK; |
David Rogers | a12786b | 2020-01-31 16:02:33 -0800 | [diff] [blame] | 839 | } |
| 840 | |
David Rogers | f3884eb | 2020-03-08 19:21:40 -0700 | [diff] [blame^] | 841 | // Find if search_set contains value. |
| 842 | // TODO: At some point move this to pw_containers, along with adding tests for |
| 843 | // it. |
| 844 | template <typename Container, typename T> |
| 845 | bool Contains(const Container& search_set, const T& value) { |
| 846 | return std::find(std::begin(search_set), std::end(search_set), value) != |
| 847 | std::end(search_set); |
| 848 | } |
| 849 | |
David Rogers | 8db5a72 | 2020-02-03 18:28:34 -0800 | [diff] [blame] | 850 | // Find either an existing sector with enough space that is not the sector to |
| 851 | // skip, or an empty sector. Maintains the invariant that there is always at |
David Rogers | c8fe1f5 | 2020-02-27 14:04:08 -0800 | [diff] [blame] | 852 | // least 1 empty sector except during GC. On GC, skip sectors that have |
| 853 | // reclaimable bytes. |
Wyatt Hepler | 5a33d8c | 2020-02-06 09:32:58 -0800 | [diff] [blame] | 854 | Status KeyValueStore::FindSectorWithSpace( |
| 855 | SectorDescriptor** found_sector, |
| 856 | size_t size, |
David Rogers | c8fe1f5 | 2020-02-27 14:04:08 -0800 | [diff] [blame] | 857 | FindSectorMode find_mode, |
David Rogers | a2562b5 | 2020-03-05 15:30:05 -0800 | [diff] [blame] | 858 | span<const Address> addresses_to_skip) { |
Wyatt Hepler | 2c7eca0 | 2020-02-18 16:01:42 -0800 | [diff] [blame] | 859 | SectorDescriptor* first_empty_sector = nullptr; |
David Rogers | c8fe1f5 | 2020-02-27 14:04:08 -0800 | [diff] [blame] | 860 | bool at_least_two_empty_sectors = (find_mode == kGarbageCollect); |
Wyatt Hepler | 2c7eca0 | 2020-02-18 16:01:42 -0800 | [diff] [blame] | 861 | |
David Rogers | f3884eb | 2020-03-08 19:21:40 -0700 | [diff] [blame^] | 862 | // Used for the GC reclaimable bytes check |
| 863 | SectorDescriptor* non_empty_least_reclaimable_sector = nullptr; |
| 864 | const size_t sector_size_bytes = partition_.sector_size_bytes(); |
| 865 | |
David Rogers | a2562b5 | 2020-03-05 15:30:05 -0800 | [diff] [blame] | 866 | // Build a vector of sectors to avoid. |
David Rogers | f3884eb | 2020-03-08 19:21:40 -0700 | [diff] [blame^] | 867 | Vector<SectorDescriptor*, internal::kEntryRedundancy> sectors_to_skip; |
David Rogers | a2562b5 | 2020-03-05 15:30:05 -0800 | [diff] [blame] | 868 | for (auto& address : addresses_to_skip) { |
| 869 | sectors_to_skip.push_back(SectorFromAddress(address)); |
| 870 | } |
| 871 | |
David Rogers | f3884eb | 2020-03-08 19:21:40 -0700 | [diff] [blame^] | 872 | DBG("Find sector with %zu bytes available, starting with sector %u, %s", |
Wyatt Hepler | 2c7eca0 | 2020-02-18 16:01:42 -0800 | [diff] [blame] | 873 | size, |
David Rogers | f3884eb | 2020-03-08 19:21:40 -0700 | [diff] [blame^] | 874 | SectorIndex(last_new_sector_), |
| 875 | (find_mode == kAppendEntry) ? "Append" : "GC"); |
David Rogers | cd87c32 | 2020-02-27 14:04:08 -0800 | [diff] [blame] | 876 | for (auto& skip_sector : sectors_to_skip) { |
| 877 | DBG(" Skip sector %u", SectorIndex(skip_sector)); |
Wyatt Hepler | 2c7eca0 | 2020-02-18 16:01:42 -0800 | [diff] [blame] | 878 | } |
Wyatt Hepler | 2c7eca0 | 2020-02-18 16:01:42 -0800 | [diff] [blame] | 879 | |
David Rogers | 8ce55cd | 2020-02-04 19:41:48 -0800 | [diff] [blame] | 880 | // The last_new_sector_ is the sector that was last selected as the "new empty |
| 881 | // sector" to write to. This last new sector is used as the starting point for |
| 882 | // the next "find a new empty sector to write to" operation. By using the last |
| 883 | // new sector as the start point we will cycle which empty sector is selected |
| 884 | // next, spreading the wear across all the empty sectors and get a wear |
| 885 | // leveling benefit, rather than putting more wear on the lower number |
| 886 | // sectors. |
Wyatt Hepler | 2c7eca0 | 2020-02-18 16:01:42 -0800 | [diff] [blame] | 887 | SectorDescriptor* sector = last_new_sector_; |
David Rogers | 67f4b6c | 2020-02-06 16:17:09 -0800 | [diff] [blame] | 888 | |
David Rogers | f3884eb | 2020-03-08 19:21:40 -0700 | [diff] [blame^] | 889 | // Look for a sector to use with enough space. The search uses a 3 priority |
David Rogers | cd87c32 | 2020-02-27 14:04:08 -0800 | [diff] [blame] | 890 | // tier process. |
| 891 | // |
David Rogers | c8fe1f5 | 2020-02-27 14:04:08 -0800 | [diff] [blame] | 892 | // Tier 1 is sector that already has valid data. During GC only select a |
| 893 | // sector that has no reclaimable bytes. Immediately use the first matching |
| 894 | // sector that is found. |
David Rogers | cd87c32 | 2020-02-27 14:04:08 -0800 | [diff] [blame] | 895 | // |
David Rogers | c8fe1f5 | 2020-02-27 14:04:08 -0800 | [diff] [blame] | 896 | // Tier 2 is find sectors that are empty/erased. While scanning for a partial |
| 897 | // sector, keep track of the first empty sector and if a second empty sector |
| 898 | // was seen. If during GC then count the second empty sector as always seen. |
David Rogers | f3884eb | 2020-03-08 19:21:40 -0700 | [diff] [blame^] | 899 | // |
| 900 | // Tier 3 is during garbage collection, find sectors with enough space that |
| 901 | // are not empty but have recoverable bytes. Pick the sector with the least |
| 902 | // recoverable bytes to minimize the likelyhood of this sector needing to be |
| 903 | // garbage collected soon. |
Wyatt Hepler | 1c329ca | 2020-02-07 18:07:23 -0800 | [diff] [blame] | 904 | for (size_t j = 0; j < sectors_.size(); j++) { |
Wyatt Hepler | 2c7eca0 | 2020-02-18 16:01:42 -0800 | [diff] [blame] | 905 | sector += 1; |
| 906 | if (sector == sectors_.end()) { |
| 907 | sector = sectors_.begin(); |
| 908 | } |
Keir Mierle | 8c352dc | 2020-02-02 13:58:19 -0800 | [diff] [blame] | 909 | |
David Rogers | f3884eb | 2020-03-08 19:21:40 -0700 | [diff] [blame^] | 910 | // Skip sectors in the skip list. |
| 911 | if (Contains(sectors_to_skip, sector)) { |
David Rogers | 8db5a72 | 2020-02-03 18:28:34 -0800 | [diff] [blame] | 912 | continue; |
| 913 | } |
| 914 | |
David Rogers | f3884eb | 2020-03-08 19:21:40 -0700 | [diff] [blame^] | 915 | if (!sector->Empty(sector_size_bytes) && sector->HasSpace(size)) { |
| 916 | if ((find_mode == kAppendEntry) || |
| 917 | (sector->RecoverableBytes(sector_size_bytes) == 0)) { |
| 918 | *found_sector = sector; |
| 919 | return Status::OK; |
| 920 | } else { |
| 921 | if ((non_empty_least_reclaimable_sector == nullptr) || |
| 922 | (non_empty_least_reclaimable_sector->RecoverableBytes( |
| 923 | sector_size_bytes) < |
| 924 | sector->RecoverableBytes(sector_size_bytes))) { |
| 925 | non_empty_least_reclaimable_sector = sector; |
| 926 | } |
| 927 | } |
Wyatt Hepler | 4da1fcb | 2020-01-30 17:32:18 -0800 | [diff] [blame] | 928 | } |
| 929 | |
Wyatt Hepler | 2c7eca0 | 2020-02-18 16:01:42 -0800 | [diff] [blame] | 930 | if (sector->Empty(sector_size_bytes)) { |
Wyatt Hepler | 4da1fcb | 2020-01-30 17:32:18 -0800 | [diff] [blame] | 931 | if (first_empty_sector == nullptr) { |
Wyatt Hepler | 2c7eca0 | 2020-02-18 16:01:42 -0800 | [diff] [blame] | 932 | first_empty_sector = sector; |
Wyatt Hepler | 4da1fcb | 2020-01-30 17:32:18 -0800 | [diff] [blame] | 933 | } else { |
| 934 | at_least_two_empty_sectors = true; |
Wyatt Hepler | 2ad6067 | 2020-01-21 08:00:16 -0800 | [diff] [blame] | 935 | } |
Wyatt Hepler | b760954 | 2020-01-24 10:29:54 -0800 | [diff] [blame] | 936 | } |
| 937 | } |
Wyatt Hepler | 4da1fcb | 2020-01-30 17:32:18 -0800 | [diff] [blame] | 938 | |
David Rogers | f3884eb | 2020-03-08 19:21:40 -0700 | [diff] [blame^] | 939 | // Tier 2 check: If the scan for a partial sector does not find a suitable |
| 940 | // sector, use the first empty sector that was found. Normally it is required |
| 941 | // to keep 1 empty sector after the sector found here, but that rule does not |
| 942 | // apply during GC. |
| 943 | if (first_empty_sector != nullptr && at_least_two_empty_sectors) { |
Wyatt Hepler | 2c7eca0 | 2020-02-18 16:01:42 -0800 | [diff] [blame] | 944 | DBG(" Found a usable empty sector; returning the first found (%u)", |
David Rogers | 8ce55cd | 2020-02-04 19:41:48 -0800 | [diff] [blame] | 945 | SectorIndex(first_empty_sector)); |
| 946 | last_new_sector_ = first_empty_sector; |
| 947 | *found_sector = first_empty_sector; |
| 948 | return Status::OK; |
Wyatt Hepler | 4da1fcb | 2020-01-30 17:32:18 -0800 | [diff] [blame] | 949 | } |
David Rogers | 8ce55cd | 2020-02-04 19:41:48 -0800 | [diff] [blame] | 950 | |
David Rogers | f3884eb | 2020-03-08 19:21:40 -0700 | [diff] [blame^] | 951 | // Tier 3 check: If we got this far, use the sector with least recoverable |
| 952 | // bytes |
| 953 | if (non_empty_least_reclaimable_sector != nullptr) { |
| 954 | *found_sector = non_empty_least_reclaimable_sector; |
| 955 | DBG(" Found a usable sector %u, with %zu B recoverable, in GC", |
| 956 | SectorIndex(*found_sector), |
| 957 | (*found_sector)->RecoverableBytes(sector_size_bytes)); |
| 958 | return Status::OK; |
| 959 | } |
| 960 | |
David Rogers | 8ce55cd | 2020-02-04 19:41:48 -0800 | [diff] [blame] | 961 | // No sector was found. |
David Rogers | 67f4b6c | 2020-02-06 16:17:09 -0800 | [diff] [blame] | 962 | DBG(" Unable to find a usable sector"); |
David Rogers | 8ce55cd | 2020-02-04 19:41:48 -0800 | [diff] [blame] | 963 | *found_sector = nullptr; |
| 964 | return Status::RESOURCE_EXHAUSTED; |
Wyatt Hepler | b760954 | 2020-01-24 10:29:54 -0800 | [diff] [blame] | 965 | } |
| 966 | |
David Rogers | f3884eb | 2020-03-08 19:21:40 -0700 | [diff] [blame^] | 967 | // TODO: Break up this function in to smaller sub-chunks including create an |
| 968 | // abstraction for the sector list. Look in to being able to unit test this as |
| 969 | // its own thing |
| 970 | KeyValueStore::SectorDescriptor* KeyValueStore::FindSectorToGarbageCollect( |
| 971 | span<const Address> addresses_to_avoid) { |
Wyatt Hepler | 2c7eca0 | 2020-02-18 16:01:42 -0800 | [diff] [blame] | 972 | const size_t sector_size_bytes = partition_.sector_size_bytes(); |
David Rogers | 2761aeb | 2020-01-31 17:09:00 -0800 | [diff] [blame] | 973 | SectorDescriptor* sector_candidate = nullptr; |
David Rogers | a12786b | 2020-01-31 16:02:33 -0800 | [diff] [blame] | 974 | size_t candidate_bytes = 0; |
| 975 | |
David Rogers | f3884eb | 2020-03-08 19:21:40 -0700 | [diff] [blame^] | 976 | // Build a vector of sectors to avoid. |
| 977 | Vector<const SectorDescriptor*, internal::kEntryRedundancy> sectors_to_skip; |
| 978 | for (auto& address : addresses_to_avoid) { |
| 979 | sectors_to_skip.push_back(SectorFromAddress(address)); |
| 980 | DBG(" Skip sector %u", SectorIndex(SectorFromAddress(address))); |
| 981 | } |
| 982 | |
David Rogers | a12786b | 2020-01-31 16:02:33 -0800 | [diff] [blame] | 983 | // Step 1: Try to find a sectors with stale keys and no valid keys (no |
| 984 | // relocation needed). If any such sectors are found, use the sector with the |
| 985 | // most reclaimable bytes. |
Wyatt Hepler | 1c329ca | 2020-02-07 18:07:23 -0800 | [diff] [blame] | 986 | for (auto& sector : sectors_) { |
Wyatt Hepler | 2c7eca0 | 2020-02-18 16:01:42 -0800 | [diff] [blame] | 987 | if ((sector.valid_bytes() == 0) && |
David Rogers | f3884eb | 2020-03-08 19:21:40 -0700 | [diff] [blame^] | 988 | (sector.RecoverableBytes(sector_size_bytes) > candidate_bytes) && |
| 989 | !Contains(sectors_to_skip, §or)) { |
David Rogers | a12786b | 2020-01-31 16:02:33 -0800 | [diff] [blame] | 990 | sector_candidate = §or; |
Wyatt Hepler | 2c7eca0 | 2020-02-18 16:01:42 -0800 | [diff] [blame] | 991 | candidate_bytes = sector.RecoverableBytes(sector_size_bytes); |
David Rogers | a12786b | 2020-01-31 16:02:33 -0800 | [diff] [blame] | 992 | } |
| 993 | } |
| 994 | |
David Rogers | f3884eb | 2020-03-08 19:21:40 -0700 | [diff] [blame^] | 995 | // Step 2a: If step 1 yields no sectors, just find the sector with the most |
| 996 | // reclaimable bytes but no addresses to avoid. |
| 997 | if (sector_candidate == nullptr) { |
| 998 | for (auto& sector : sectors_) { |
| 999 | if ((sector.RecoverableBytes(sector_size_bytes) > candidate_bytes) && |
| 1000 | !Contains(sectors_to_skip, §or)) { |
| 1001 | sector_candidate = §or; |
| 1002 | candidate_bytes = sector.RecoverableBytes(sector_size_bytes); |
| 1003 | } |
| 1004 | } |
| 1005 | } |
| 1006 | |
| 1007 | // Step 2b: If step 1 yields no sectors, just find the sector with the most |
David Rogers | a12786b | 2020-01-31 16:02:33 -0800 | [diff] [blame] | 1008 | // reclaimable bytes. |
| 1009 | if (sector_candidate == nullptr) { |
Wyatt Hepler | 1c329ca | 2020-02-07 18:07:23 -0800 | [diff] [blame] | 1010 | for (auto& sector : sectors_) { |
Wyatt Hepler | 2c7eca0 | 2020-02-18 16:01:42 -0800 | [diff] [blame] | 1011 | if (sector.RecoverableBytes(sector_size_bytes) > candidate_bytes) { |
David Rogers | a12786b | 2020-01-31 16:02:33 -0800 | [diff] [blame] | 1012 | sector_candidate = §or; |
Wyatt Hepler | 2c7eca0 | 2020-02-18 16:01:42 -0800 | [diff] [blame] | 1013 | candidate_bytes = sector.RecoverableBytes(sector_size_bytes); |
David Rogers | a12786b | 2020-01-31 16:02:33 -0800 | [diff] [blame] | 1014 | } |
| 1015 | } |
| 1016 | } |
| 1017 | |
David Rogers | f3884eb | 2020-03-08 19:21:40 -0700 | [diff] [blame^] | 1018 | // Step 3: If no sectors with reclaimable bytes, select the sector with the |
| 1019 | // most free bytes. This at least will allow entries of existing keys to get |
| 1020 | // spread to other sectors, including sectors that already have copies of the |
| 1021 | // current key being written. |
| 1022 | if (sector_candidate == nullptr) { |
| 1023 | for (auto& sector : sectors_) { |
| 1024 | if ((sector.valid_bytes() > candidate_bytes) && |
| 1025 | !Contains(sectors_to_skip, §or)) { |
| 1026 | sector_candidate = §or; |
| 1027 | candidate_bytes = sector.valid_bytes(); |
| 1028 | DBG(" Doing GC on sector with no reclaimable bytes!"); |
| 1029 | } |
| 1030 | } |
| 1031 | } |
| 1032 | |
David Rogers | 5981f31 | 2020-02-13 13:33:56 -0800 | [diff] [blame] | 1033 | if (sector_candidate != nullptr) { |
Wyatt Hepler | 2c7eca0 | 2020-02-18 16:01:42 -0800 | [diff] [blame] | 1034 | DBG("Found sector %u to Garbage Collect, %zu recoverable bytes", |
David Rogers | 5981f31 | 2020-02-13 13:33:56 -0800 | [diff] [blame] | 1035 | SectorIndex(sector_candidate), |
Wyatt Hepler | 2c7eca0 | 2020-02-18 16:01:42 -0800 | [diff] [blame] | 1036 | sector_candidate->RecoverableBytes(sector_size_bytes)); |
David Rogers | 5981f31 | 2020-02-13 13:33:56 -0800 | [diff] [blame] | 1037 | } else { |
| 1038 | DBG("Unable to find sector to garbage collect!"); |
| 1039 | } |
David Rogers | a12786b | 2020-01-31 16:02:33 -0800 | [diff] [blame] | 1040 | return sector_candidate; |
| 1041 | } |
| 1042 | |
David Rogers | cd87c32 | 2020-02-27 14:04:08 -0800 | [diff] [blame] | 1043 | Status KeyValueStore::GarbageCollectFull() { |
| 1044 | DBG("Garbage Collect all sectors"); |
David Rogers | cd87c32 | 2020-02-27 14:04:08 -0800 | [diff] [blame] | 1045 | SectorDescriptor* sector = last_new_sector_; |
| 1046 | |
| 1047 | // TODO: look in to making an iterator method for cycling through sectors |
| 1048 | // starting from last_new_sector_. |
| 1049 | for (size_t j = 0; j < sectors_.size(); j++) { |
| 1050 | sector += 1; |
| 1051 | if (sector == sectors_.end()) { |
| 1052 | sector = sectors_.begin(); |
| 1053 | } |
| 1054 | |
| 1055 | if (sector->RecoverableBytes(partition_.sector_size_bytes()) > 0) { |
| 1056 | TRY(GarbageCollectSector(sector)); |
| 1057 | } |
| 1058 | } |
| 1059 | |
| 1060 | DBG("Garbage Collect all complete"); |
David Rogers | cd87c32 | 2020-02-27 14:04:08 -0800 | [diff] [blame] | 1061 | return Status::OK; |
| 1062 | } |
| 1063 | |
David Rogers | f3884eb | 2020-03-08 19:21:40 -0700 | [diff] [blame^] | 1064 | Status KeyValueStore::GarbageCollectPartial(KeyDescriptor* key_in_progress) { |
| 1065 | DBG("Garbage Collect a single sector%s", |
| 1066 | (key_in_progress == nullptr) ? "" : ", with key in progress"); |
David Rogers | 67f4b6c | 2020-02-06 16:17:09 -0800 | [diff] [blame] | 1067 | |
David Rogers | a12786b | 2020-01-31 16:02:33 -0800 | [diff] [blame] | 1068 | // Step 1: Find the sector to garbage collect |
David Rogers | f3884eb | 2020-03-08 19:21:40 -0700 | [diff] [blame^] | 1069 | auto addresses = span<const Address>(); |
| 1070 | if (key_in_progress != nullptr) { |
| 1071 | DBG(" Use addresses to avoid"); |
| 1072 | addresses = key_in_progress->addresses(); |
| 1073 | } |
| 1074 | SectorDescriptor* sector_to_gc = FindSectorToGarbageCollect(addresses); |
Wyatt Hepler | 4da1fcb | 2020-01-30 17:32:18 -0800 | [diff] [blame] | 1075 | |
David Rogers | a12786b | 2020-01-31 16:02:33 -0800 | [diff] [blame] | 1076 | if (sector_to_gc == nullptr) { |
David Rogers | a2562b5 | 2020-03-05 15:30:05 -0800 | [diff] [blame] | 1077 | // Nothing to GC. |
| 1078 | return Status::NOT_FOUND; |
David Rogers | a12786b | 2020-01-31 16:02:33 -0800 | [diff] [blame] | 1079 | } |
Wyatt Hepler | 4da1fcb | 2020-01-30 17:32:18 -0800 | [diff] [blame] | 1080 | |
David Rogers | f3884eb | 2020-03-08 19:21:40 -0700 | [diff] [blame^] | 1081 | TRY(GarbageCollectSector(sector_to_gc, key_in_progress)); |
David Rogers | cd87c32 | 2020-02-27 14:04:08 -0800 | [diff] [blame] | 1082 | return Status::OK; |
| 1083 | } |
| 1084 | |
David Rogers | f3884eb | 2020-03-08 19:21:40 -0700 | [diff] [blame^] | 1085 | Status KeyValueStore::RelocateKeyAddressesInSector( |
| 1086 | internal::SectorDescriptor* sector_to_gc, |
| 1087 | internal::KeyDescriptor* descriptor) { |
| 1088 | for (auto address : descriptor->addresses()) { |
| 1089 | if (AddressInSector(*sector_to_gc, address)) { |
| 1090 | DBG(" Relocate entry for Key 0x%08zx, address %zu", |
| 1091 | size_t(descriptor->hash()), |
| 1092 | size_t(address)); |
| 1093 | TRY(RelocateEntry(descriptor, address)); |
| 1094 | } |
| 1095 | } |
| 1096 | return Status::OK; |
| 1097 | }; |
| 1098 | |
| 1099 | Status KeyValueStore::GarbageCollectSector(SectorDescriptor* sector_to_gc, |
| 1100 | KeyDescriptor* key_in_progress) { |
| 1101 | // Pre-step: Check if the key in progress has any addresses in the sector to |
| 1102 | // GC. |
| 1103 | bool key_in_progress_in_sector = false; |
| 1104 | if (key_in_progress != nullptr) { |
| 1105 | for (Address address : key_in_progress->addresses()) { |
| 1106 | if (AddressInSector(*sector_to_gc, address)) { |
| 1107 | key_in_progress_in_sector = true; |
| 1108 | break; |
David Rogers | a12786b | 2020-01-31 16:02:33 -0800 | [diff] [blame] | 1109 | } |
Wyatt Hepler | b760954 | 2020-01-24 10:29:54 -0800 | [diff] [blame] | 1110 | } |
| 1111 | } |
Wyatt Hepler | b760954 | 2020-01-24 10:29:54 -0800 | [diff] [blame] | 1112 | |
David Rogers | f3884eb | 2020-03-08 19:21:40 -0700 | [diff] [blame^] | 1113 | // Step 1: Move any valid entries in the GC sector to other sectors |
| 1114 | if ((sector_to_gc->valid_bytes() != 0 || key_in_progress_in_sector)) { |
| 1115 | if (key_in_progress != nullptr) { |
| 1116 | TRY(RelocateKeyAddressesInSector(sector_to_gc, key_in_progress)); |
| 1117 | } |
| 1118 | for (auto& descriptor : key_descriptors_) { |
| 1119 | TRY(RelocateKeyAddressesInSector(sector_to_gc, &descriptor)); |
| 1120 | } |
| 1121 | } |
| 1122 | |
Wyatt Hepler | 2c7eca0 | 2020-02-18 16:01:42 -0800 | [diff] [blame] | 1123 | if (sector_to_gc->valid_bytes() != 0) { |
David Rogers | 67f4b6c | 2020-02-06 16:17:09 -0800 | [diff] [blame] | 1124 | ERR(" Failed to relocate valid entries from sector being garbage " |
Wyatt Hepler | 2c7eca0 | 2020-02-18 16:01:42 -0800 | [diff] [blame] | 1125 | "collected, %zu valid bytes remain", |
| 1126 | sector_to_gc->valid_bytes()); |
Wyatt Hepler | b760954 | 2020-01-24 10:29:54 -0800 | [diff] [blame] | 1127 | return Status::INTERNAL; |
| 1128 | } |
| 1129 | |
David Rogers | cd87c32 | 2020-02-27 14:04:08 -0800 | [diff] [blame] | 1130 | // Step 2: Reinitialize the sector |
Wyatt Hepler | 2c7eca0 | 2020-02-18 16:01:42 -0800 | [diff] [blame] | 1131 | sector_to_gc->set_writable_bytes(0); |
David Rogers | a12786b | 2020-01-31 16:02:33 -0800 | [diff] [blame] | 1132 | TRY(partition_.Erase(SectorBaseAddress(sector_to_gc), 1)); |
Wyatt Hepler | 2c7eca0 | 2020-02-18 16:01:42 -0800 | [diff] [blame] | 1133 | sector_to_gc->set_writable_bytes(partition_.sector_size_bytes()); |
Wyatt Hepler | b760954 | 2020-01-24 10:29:54 -0800 | [diff] [blame] | 1134 | |
David Rogers | cd87c32 | 2020-02-27 14:04:08 -0800 | [diff] [blame] | 1135 | DBG(" Garbage Collect sector %u complete", SectorIndex(sector_to_gc)); |
David Rogers | a12786b | 2020-01-31 16:02:33 -0800 | [diff] [blame] | 1136 | return Status::OK; |
Wyatt Hepler | 4da1fcb | 2020-01-30 17:32:18 -0800 | [diff] [blame] | 1137 | } |
| 1138 | |
Wyatt Hepler | bdd8e5a | 2020-02-20 19:27:26 -0800 | [diff] [blame] | 1139 | KeyValueStore::Entry KeyValueStore::CreateEntry(Address address, |
| 1140 | std::string_view key, |
| 1141 | span<const byte> value, |
| 1142 | KeyDescriptor::State state) { |
Keir Mierle | 9e38b40 | 2020-02-21 13:06:21 -0800 | [diff] [blame] | 1143 | // Always bump the transaction ID when creating a new entry. |
| 1144 | // |
| 1145 | // Burning transaction IDs prevents inconsistencies between flash and memory |
| 1146 | // that which could happen if a write succeeds, but for some reason the read |
| 1147 | // and verify step fails. Here's how this would happen: |
| 1148 | // |
| 1149 | // 1. The entry is written but for some reason the flash reports failure OR |
| 1150 | // The write succeeds, but the read / verify operation fails. |
| 1151 | // 2. The transaction ID is NOT incremented, because of the failure |
| 1152 | // 3. (later) A new entry is written, re-using the transaction ID (oops) |
| 1153 | // |
| 1154 | // By always burning transaction IDs, the above problem can't happen. |
| 1155 | last_transaction_id_ += 1; |
| 1156 | |
Wyatt Hepler | 1fc1104 | 2020-02-19 17:17:51 -0800 | [diff] [blame] | 1157 | if (state == KeyDescriptor::kDeleted) { |
Wyatt Hepler | 7465be3 | 2020-02-21 15:30:53 -0800 | [diff] [blame] | 1158 | return Entry::Tombstone( |
Wyatt Hepler | 22d0d9f | 2020-03-05 14:57:11 -0800 | [diff] [blame] | 1159 | partition_, address, formats_.primary(), key, last_transaction_id_); |
Wyatt Hepler | 1fc1104 | 2020-02-19 17:17:51 -0800 | [diff] [blame] | 1160 | } |
| 1161 | return Entry::Valid(partition_, |
| 1162 | address, |
Wyatt Hepler | 22d0d9f | 2020-03-05 14:57:11 -0800 | [diff] [blame] | 1163 | formats_.primary(), |
Wyatt Hepler | 1fc1104 | 2020-02-19 17:17:51 -0800 | [diff] [blame] | 1164 | key, |
| 1165 | value, |
Keir Mierle | 9e38b40 | 2020-02-21 13:06:21 -0800 | [diff] [blame] | 1166 | last_transaction_id_); |
Wyatt Hepler | d229828 | 2020-02-20 17:12:45 -0800 | [diff] [blame] | 1167 | } |
| 1168 | |
| 1169 | void KeyValueStore::Reset() { |
| 1170 | initialized_ = false; |
| 1171 | key_descriptors_.clear(); |
| 1172 | last_new_sector_ = nullptr; |
| 1173 | last_transaction_id_ = 0; |
Wyatt Hepler | 1fc1104 | 2020-02-19 17:17:51 -0800 | [diff] [blame] | 1174 | } |
| 1175 | |
Keir Mierle | 8c352dc | 2020-02-02 13:58:19 -0800 | [diff] [blame] | 1176 | void KeyValueStore::LogDebugInfo() { |
Keir Mierle | 8c352dc | 2020-02-02 13:58:19 -0800 | [diff] [blame] | 1177 | const size_t sector_size_bytes = partition_.sector_size_bytes(); |
| 1178 | DBG("====================== KEY VALUE STORE DUMP ========================="); |
| 1179 | DBG(" "); |
| 1180 | DBG("Flash partition:"); |
Wyatt Hepler | ad0a793 | 2020-02-06 08:20:38 -0800 | [diff] [blame] | 1181 | DBG(" Sector count = %zu", partition_.sector_count()); |
Wyatt Hepler | 38ce30f | 2020-02-19 11:48:31 -0800 | [diff] [blame] | 1182 | DBG(" Sector max count = %zu", sectors_.max_size()); |
Wyatt Hepler | 1c329ca | 2020-02-07 18:07:23 -0800 | [diff] [blame] | 1183 | DBG(" Sectors in use = %zu", sectors_.size()); |
Keir Mierle | 8c352dc | 2020-02-02 13:58:19 -0800 | [diff] [blame] | 1184 | DBG(" Sector size = %zu", sector_size_bytes); |
| 1185 | DBG(" Total size = %zu", partition_.size_bytes()); |
| 1186 | DBG(" Alignment = %zu", partition_.alignment_bytes()); |
| 1187 | DBG(" "); |
| 1188 | DBG("Key descriptors:"); |
Wyatt Hepler | 1c329ca | 2020-02-07 18:07:23 -0800 | [diff] [blame] | 1189 | DBG(" Entry count = %zu", key_descriptors_.size()); |
Wyatt Hepler | 38ce30f | 2020-02-19 11:48:31 -0800 | [diff] [blame] | 1190 | DBG(" Max entry count = %zu", key_descriptors_.max_size()); |
Keir Mierle | 8c352dc | 2020-02-02 13:58:19 -0800 | [diff] [blame] | 1191 | DBG(" "); |
| 1192 | DBG(" # hash version address address (hex)"); |
Wyatt Hepler | 1c329ca | 2020-02-07 18:07:23 -0800 | [diff] [blame] | 1193 | for (size_t i = 0; i < key_descriptors_.size(); ++i) { |
| 1194 | const KeyDescriptor& kd = key_descriptors_[i]; |
Keir Mierle | 8c352dc | 2020-02-02 13:58:19 -0800 | [diff] [blame] | 1195 | DBG(" |%3zu: | %8zx |%8zu | %8zu | %8zx", |
| 1196 | i, |
Wyatt Hepler | 1fc1104 | 2020-02-19 17:17:51 -0800 | [diff] [blame] | 1197 | size_t(kd.hash()), |
| 1198 | size_t(kd.transaction_id()), |
| 1199 | size_t(kd.address()), |
| 1200 | size_t(kd.address())); |
Keir Mierle | 8c352dc | 2020-02-02 13:58:19 -0800 | [diff] [blame] | 1201 | } |
| 1202 | DBG(" "); |
| 1203 | |
| 1204 | DBG("Sector descriptors:"); |
| 1205 | DBG(" # tail free valid has_space"); |
Wyatt Hepler | 1c329ca | 2020-02-07 18:07:23 -0800 | [diff] [blame] | 1206 | for (size_t sector_id = 0; sector_id < sectors_.size(); ++sector_id) { |
| 1207 | const SectorDescriptor& sd = sectors_[sector_id]; |
Keir Mierle | 8c352dc | 2020-02-02 13:58:19 -0800 | [diff] [blame] | 1208 | DBG(" |%3zu: | %8zu |%8zu | %s", |
| 1209 | sector_id, |
Wyatt Hepler | 2c7eca0 | 2020-02-18 16:01:42 -0800 | [diff] [blame] | 1210 | size_t(sd.writable_bytes()), |
| 1211 | sd.valid_bytes(), |
| 1212 | sd.writable_bytes() ? "YES" : ""); |
Keir Mierle | 8c352dc | 2020-02-02 13:58:19 -0800 | [diff] [blame] | 1213 | } |
| 1214 | DBG(" "); |
| 1215 | |
| 1216 | // TODO: This should stop logging after some threshold. |
| 1217 | // size_t dumped_bytes = 0; |
| 1218 | DBG("Sector raw data:"); |
Wyatt Hepler | 1c329ca | 2020-02-07 18:07:23 -0800 | [diff] [blame] | 1219 | for (size_t sector_id = 0; sector_id < sectors_.size(); ++sector_id) { |
Keir Mierle | 8c352dc | 2020-02-02 13:58:19 -0800 | [diff] [blame] | 1220 | // Read sector data. Yes, this will blow the stack on embedded. |
Wyatt Hepler | 1c329ca | 2020-02-07 18:07:23 -0800 | [diff] [blame] | 1221 | std::array<byte, 500> raw_sector_data; // TODO!!! |
Keir Mierle | 8c352dc | 2020-02-02 13:58:19 -0800 | [diff] [blame] | 1222 | StatusWithSize sws = |
| 1223 | partition_.Read(sector_id * sector_size_bytes, raw_sector_data); |
| 1224 | DBG("Read: %zu bytes", sws.size()); |
| 1225 | |
| 1226 | DBG(" base addr offs 0 1 2 3 4 5 6 7"); |
| 1227 | for (size_t i = 0; i < sector_size_bytes; i += 8) { |
| 1228 | DBG(" %3zu %8zx %5zu | %02x %02x %02x %02x %02x %02x %02x %02x", |
| 1229 | sector_id, |
| 1230 | (sector_id * sector_size_bytes) + i, |
| 1231 | i, |
| 1232 | static_cast<unsigned int>(raw_sector_data[i + 0]), |
| 1233 | static_cast<unsigned int>(raw_sector_data[i + 1]), |
| 1234 | static_cast<unsigned int>(raw_sector_data[i + 2]), |
| 1235 | static_cast<unsigned int>(raw_sector_data[i + 3]), |
| 1236 | static_cast<unsigned int>(raw_sector_data[i + 4]), |
| 1237 | static_cast<unsigned int>(raw_sector_data[i + 5]), |
| 1238 | static_cast<unsigned int>(raw_sector_data[i + 6]), |
| 1239 | static_cast<unsigned int>(raw_sector_data[i + 7])); |
| 1240 | |
| 1241 | // TODO: Fix exit condition. |
| 1242 | if (i > 128) { |
| 1243 | break; |
| 1244 | } |
| 1245 | } |
| 1246 | DBG(" "); |
| 1247 | } |
| 1248 | |
| 1249 | DBG("////////////////////// KEY VALUE STORE DUMP END /////////////////////"); |
| 1250 | } |
| 1251 | |
David Rogers | cf680ab | 2020-02-12 23:28:32 -0800 | [diff] [blame] | 1252 | void KeyValueStore::LogSectors() const { |
| 1253 | DBG("Sector descriptors: count %zu", sectors_.size()); |
Wyatt Hepler | 1c329ca | 2020-02-07 18:07:23 -0800 | [diff] [blame] | 1254 | for (auto& sector : sectors_) { |
Wyatt Hepler | 2c7eca0 | 2020-02-18 16:01:42 -0800 | [diff] [blame] | 1255 | DBG(" - Sector %u: valid %zu, recoverable %zu, free %zu", |
David Rogers | 50185ad | 2020-02-07 00:02:46 -0800 | [diff] [blame] | 1256 | SectorIndex(§or), |
Wyatt Hepler | 2c7eca0 | 2020-02-18 16:01:42 -0800 | [diff] [blame] | 1257 | sector.valid_bytes(), |
| 1258 | sector.RecoverableBytes(partition_.sector_size_bytes()), |
| 1259 | sector.writable_bytes()); |
David Rogers | 50185ad | 2020-02-07 00:02:46 -0800 | [diff] [blame] | 1260 | } |
| 1261 | } |
| 1262 | |
David Rogers | cf680ab | 2020-02-12 23:28:32 -0800 | [diff] [blame] | 1263 | void KeyValueStore::LogKeyDescriptor() const { |
| 1264 | DBG("Key descriptors: count %zu", key_descriptors_.size()); |
| 1265 | for (auto& key : key_descriptors_) { |
Wyatt Hepler | 1fc1104 | 2020-02-19 17:17:51 -0800 | [diff] [blame] | 1266 | DBG(" - Key: %s, hash %#zx, transaction ID %zu, address %#zx", |
David Rogers | cf680ab | 2020-02-12 23:28:32 -0800 | [diff] [blame] | 1267 | key.deleted() ? "Deleted" : "Valid", |
Wyatt Hepler | 1fc1104 | 2020-02-19 17:17:51 -0800 | [diff] [blame] | 1268 | static_cast<size_t>(key.hash()), |
| 1269 | static_cast<size_t>(key.transaction_id()), |
| 1270 | static_cast<size_t>(key.address())); |
David Rogers | cf680ab | 2020-02-12 23:28:32 -0800 | [diff] [blame] | 1271 | } |
| 1272 | } |
| 1273 | |
Wyatt Hepler | 2ad6067 | 2020-01-21 08:00:16 -0800 | [diff] [blame] | 1274 | } // namespace pw::kvs |