/src/leveldb/db/version_edit.cc
Line | Count | Source |
1 | | // Copyright (c) 2011 The LevelDB Authors. All rights reserved. |
2 | | // Use of this source code is governed by a BSD-style license that can be |
3 | | // found in the LICENSE file. See the AUTHORS file for names of contributors. |
4 | | |
5 | | #include "db/version_edit.h" |
6 | | |
7 | | #include "db/version_set.h" |
8 | | #include "util/coding.h" |
9 | | |
10 | | namespace leveldb { |
11 | | |
12 | | // Tag numbers for serialized VersionEdit. These numbers are written to |
13 | | // disk and should not be changed. |
14 | | enum Tag { |
15 | | kComparator = 1, |
16 | | kLogNumber = 2, |
17 | | kNextFileNumber = 3, |
18 | | kLastSequence = 4, |
19 | | kCompactPointer = 5, |
20 | | kDeletedFile = 6, |
21 | | kNewFile = 7, |
22 | | // 8 was used for large value refs |
23 | | kPrevLogNumber = 9 |
24 | | }; |
25 | | |
26 | 875k | void VersionEdit::Clear() { |
27 | 875k | comparator_.clear(); |
28 | 875k | log_number_ = 0; |
29 | 875k | prev_log_number_ = 0; |
30 | 875k | last_sequence_ = 0; |
31 | 875k | next_file_number_ = 0; |
32 | 875k | has_comparator_ = false; |
33 | 875k | has_log_number_ = false; |
34 | 875k | has_prev_log_number_ = false; |
35 | 875k | has_next_file_number_ = false; |
36 | 875k | has_last_sequence_ = false; |
37 | 875k | compact_pointers_.clear(); |
38 | 875k | deleted_files_.clear(); |
39 | 875k | new_files_.clear(); |
40 | 875k | } |
41 | | |
42 | 299k | void VersionEdit::EncodeTo(std::string* dst) const { |
43 | 299k | if (has_comparator_) { |
44 | 121k | PutVarint32(dst, kComparator); |
45 | 121k | PutLengthPrefixedSlice(dst, comparator_); |
46 | 121k | } |
47 | 299k | if (has_log_number_) { |
48 | 183k | PutVarint32(dst, kLogNumber); |
49 | 183k | PutVarint64(dst, log_number_); |
50 | 183k | } |
51 | 299k | if (has_prev_log_number_) { |
52 | 178k | PutVarint32(dst, kPrevLogNumber); |
53 | 178k | PutVarint64(dst, prev_log_number_); |
54 | 178k | } |
55 | 299k | if (has_next_file_number_) { |
56 | 183k | PutVarint32(dst, kNextFileNumber); |
57 | 183k | PutVarint64(dst, next_file_number_); |
58 | 183k | } |
59 | 299k | if (has_last_sequence_) { |
60 | 183k | PutVarint32(dst, kLastSequence); |
61 | 183k | PutVarint64(dst, last_sequence_); |
62 | 183k | } |
63 | | |
64 | 424k | for (size_t i = 0; i < compact_pointers_.size(); i++) { |
65 | 124k | PutVarint32(dst, kCompactPointer); |
66 | 124k | PutVarint32(dst, compact_pointers_[i].first); // level |
67 | 124k | PutLengthPrefixedSlice(dst, compact_pointers_[i].second.Encode()); |
68 | 124k | } |
69 | | |
70 | 299k | for (const auto& deleted_file_kvp : deleted_files_) { |
71 | 72.4k | PutVarint32(dst, kDeletedFile); |
72 | 72.4k | PutVarint32(dst, deleted_file_kvp.first); // level |
73 | 72.4k | PutVarint64(dst, deleted_file_kvp.second); // file number |
74 | 72.4k | } |
75 | | |
76 | 1.19M | for (size_t i = 0; i < new_files_.size(); i++) { |
77 | 897k | const FileMetaData& f = new_files_[i].second; |
78 | 897k | PutVarint32(dst, kNewFile); |
79 | 897k | PutVarint32(dst, new_files_[i].first); // level |
80 | 897k | PutVarint64(dst, f.number); |
81 | 897k | PutVarint64(dst, f.file_size); |
82 | 897k | PutLengthPrefixedSlice(dst, f.smallest.Encode()); |
83 | 897k | PutLengthPrefixedSlice(dst, f.largest.Encode()); |
84 | 897k | } |
85 | 299k | } |
86 | | |
87 | 1.88M | static bool GetInternalKey(Slice* input, InternalKey* dst) { |
88 | 1.88M | Slice str; |
89 | 1.88M | if (GetLengthPrefixedSlice(input, &str)) { |
90 | 1.88M | return dst->DecodeFrom(str); |
91 | 1.88M | } else { |
92 | 0 | return false; |
93 | 0 | } |
94 | 1.88M | } |
95 | | |
96 | 1.06M | static bool GetLevel(Slice* input, int* level) { |
97 | 1.06M | uint32_t v; |
98 | 1.06M | if (GetVarint32(input, &v) && v < config::kNumLevels) { |
99 | 1.06M | *level = v; |
100 | 1.06M | return true; |
101 | 1.06M | } else { |
102 | 0 | return false; |
103 | 0 | } |
104 | 1.06M | } |
105 | | |
106 | 284k | Status VersionEdit::DecodeFrom(const Slice& src) { |
107 | 284k | Clear(); |
108 | 284k | Slice input = src; |
109 | 284k | const char* msg = nullptr; |
110 | 284k | uint32_t tag; |
111 | | |
112 | | // Temporary storage for parsing |
113 | 284k | int level; |
114 | 284k | uint64_t number; |
115 | 284k | FileMetaData f; |
116 | 284k | Slice str; |
117 | 284k | InternalKey key; |
118 | | |
119 | 2.15M | while (msg == nullptr && GetVarint32(&input, &tag)) { |
120 | 1.87M | switch (tag) { |
121 | 116k | case kComparator: |
122 | 116k | if (GetLengthPrefixedSlice(&input, &str)) { |
123 | 116k | comparator_ = str.ToString(); |
124 | 116k | has_comparator_ = true; |
125 | 116k | } else { |
126 | 0 | msg = "comparator name"; |
127 | 0 | } |
128 | 116k | break; |
129 | | |
130 | 173k | case kLogNumber: |
131 | 173k | if (GetVarint64(&input, &log_number_)) { |
132 | 173k | has_log_number_ = true; |
133 | 173k | } else { |
134 | 0 | msg = "log number"; |
135 | 0 | } |
136 | 173k | break; |
137 | | |
138 | 167k | case kPrevLogNumber: |
139 | 167k | if (GetVarint64(&input, &prev_log_number_)) { |
140 | 167k | has_prev_log_number_ = true; |
141 | 167k | } else { |
142 | 0 | msg = "previous log number"; |
143 | 0 | } |
144 | 167k | break; |
145 | | |
146 | 173k | case kNextFileNumber: |
147 | 173k | if (GetVarint64(&input, &next_file_number_)) { |
148 | 173k | has_next_file_number_ = true; |
149 | 173k | } else { |
150 | 0 | msg = "next file number"; |
151 | 0 | } |
152 | 173k | break; |
153 | | |
154 | 173k | case kLastSequence: |
155 | 173k | if (GetVarint64(&input, &last_sequence_)) { |
156 | 173k | has_last_sequence_ = true; |
157 | 173k | } else { |
158 | 0 | msg = "last sequence number"; |
159 | 0 | } |
160 | 173k | break; |
161 | | |
162 | 120k | case kCompactPointer: |
163 | 120k | if (GetLevel(&input, &level) && GetInternalKey(&input, &key)) { |
164 | 120k | compact_pointers_.push_back(std::make_pair(level, key)); |
165 | 120k | } else { |
166 | 0 | msg = "compaction pointer"; |
167 | 0 | } |
168 | 120k | break; |
169 | | |
170 | 68.0k | case kDeletedFile: |
171 | 68.0k | if (GetLevel(&input, &level) && GetVarint64(&input, &number)) { |
172 | 68.0k | deleted_files_.insert(std::make_pair(level, number)); |
173 | 68.0k | } else { |
174 | 0 | msg = "deleted file"; |
175 | 0 | } |
176 | 68.0k | break; |
177 | | |
178 | 881k | case kNewFile: |
179 | 881k | if (GetLevel(&input, &level) && GetVarint64(&input, &f.number) && |
180 | 881k | GetVarint64(&input, &f.file_size) && |
181 | 881k | GetInternalKey(&input, &f.smallest) && |
182 | 881k | GetInternalKey(&input, &f.largest)) { |
183 | 881k | new_files_.push_back(std::make_pair(level, f)); |
184 | 881k | } else { |
185 | 0 | msg = "new-file entry"; |
186 | 0 | } |
187 | 881k | break; |
188 | | |
189 | 0 | default: |
190 | 0 | msg = "unknown tag"; |
191 | 0 | break; |
192 | 1.87M | } |
193 | 1.87M | } |
194 | | |
195 | 284k | if (msg == nullptr && !input.empty()) { |
196 | 0 | msg = "invalid tag"; |
197 | 0 | } |
198 | | |
199 | 284k | Status result; |
200 | 284k | if (msg != nullptr) { |
201 | 0 | result = Status::Corruption("VersionEdit", msg); |
202 | 0 | } |
203 | 284k | return result; |
204 | 284k | } |
205 | | |
206 | 0 | std::string VersionEdit::DebugString() const { |
207 | 0 | std::string r; |
208 | 0 | r.append("VersionEdit {"); |
209 | 0 | if (has_comparator_) { |
210 | 0 | r.append("\n Comparator: "); |
211 | 0 | r.append(comparator_); |
212 | 0 | } |
213 | 0 | if (has_log_number_) { |
214 | 0 | r.append("\n LogNumber: "); |
215 | 0 | AppendNumberTo(&r, log_number_); |
216 | 0 | } |
217 | 0 | if (has_prev_log_number_) { |
218 | 0 | r.append("\n PrevLogNumber: "); |
219 | 0 | AppendNumberTo(&r, prev_log_number_); |
220 | 0 | } |
221 | 0 | if (has_next_file_number_) { |
222 | 0 | r.append("\n NextFile: "); |
223 | 0 | AppendNumberTo(&r, next_file_number_); |
224 | 0 | } |
225 | 0 | if (has_last_sequence_) { |
226 | 0 | r.append("\n LastSeq: "); |
227 | 0 | AppendNumberTo(&r, last_sequence_); |
228 | 0 | } |
229 | 0 | for (size_t i = 0; i < compact_pointers_.size(); i++) { |
230 | 0 | r.append("\n CompactPointer: "); |
231 | 0 | AppendNumberTo(&r, compact_pointers_[i].first); |
232 | 0 | r.append(" "); |
233 | 0 | r.append(compact_pointers_[i].second.DebugString()); |
234 | 0 | } |
235 | 0 | for (const auto& deleted_files_kvp : deleted_files_) { |
236 | 0 | r.append("\n RemoveFile: "); |
237 | 0 | AppendNumberTo(&r, deleted_files_kvp.first); |
238 | 0 | r.append(" "); |
239 | 0 | AppendNumberTo(&r, deleted_files_kvp.second); |
240 | 0 | } |
241 | 0 | for (size_t i = 0; i < new_files_.size(); i++) { |
242 | 0 | const FileMetaData& f = new_files_[i].second; |
243 | 0 | r.append("\n AddFile: "); |
244 | 0 | AppendNumberTo(&r, new_files_[i].first); |
245 | 0 | r.append(" "); |
246 | 0 | AppendNumberTo(&r, f.number); |
247 | 0 | r.append(" "); |
248 | 0 | AppendNumberTo(&r, f.file_size); |
249 | 0 | r.append(" "); |
250 | 0 | r.append(f.smallest.DebugString()); |
251 | 0 | r.append(" .. "); |
252 | 0 | r.append(f.largest.DebugString()); |
253 | 0 | } |
254 | 0 | r.append("\n}\n"); |
255 | 0 | return r; |
256 | 0 | } |
257 | | |
258 | | } // namespace leveldb |