/src/leveldb/table/table_builder.cc
Line | Count | Source (jump to first uncovered line) |
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 "leveldb/table_builder.h" |
6 | | |
7 | | #include <cassert> |
8 | | |
9 | | #include "leveldb/comparator.h" |
10 | | #include "leveldb/env.h" |
11 | | #include "leveldb/filter_policy.h" |
12 | | #include "leveldb/options.h" |
13 | | #include "table/block_builder.h" |
14 | | #include "table/filter_block.h" |
15 | | #include "table/format.h" |
16 | | #include "util/coding.h" |
17 | | #include "util/crc32c.h" |
18 | | |
19 | | namespace leveldb { |
20 | | |
21 | | struct TableBuilder::Rep { |
22 | | Rep(const Options& opt, WritableFile* f) |
23 | 81.0k | : options(opt), |
24 | 81.0k | index_block_options(opt), |
25 | 81.0k | file(f), |
26 | 81.0k | offset(0), |
27 | 81.0k | data_block(&options), |
28 | 81.0k | index_block(&index_block_options), |
29 | 81.0k | num_entries(0), |
30 | 81.0k | closed(false), |
31 | 81.0k | filter_block(opt.filter_policy == nullptr |
32 | 81.0k | ? nullptr |
33 | 81.0k | : new FilterBlockBuilder(opt.filter_policy)), |
34 | 81.0k | pending_index_entry(false) { |
35 | 81.0k | index_block_options.block_restart_interval = 1; |
36 | 81.0k | } |
37 | | |
38 | | Options options; |
39 | | Options index_block_options; |
40 | | WritableFile* file; |
41 | | uint64_t offset; |
42 | | Status status; |
43 | | BlockBuilder data_block; |
44 | | BlockBuilder index_block; |
45 | | std::string last_key; |
46 | | int64_t num_entries; |
47 | | bool closed; // Either Finish() or Abandon() has been called. |
48 | | FilterBlockBuilder* filter_block; |
49 | | |
50 | | // We do not emit the index entry for a block until we have seen the |
51 | | // first key for the next data block. This allows us to use shorter |
52 | | // keys in the index block. For example, consider a block boundary |
53 | | // between the keys "the quick brown fox" and "the who". We can use |
54 | | // "the r" as the key for the index block entry since it is >= all |
55 | | // entries in the first block and < all entries in subsequent |
56 | | // blocks. |
57 | | // |
58 | | // Invariant: r->pending_index_entry is true only if data_block is empty. |
59 | | bool pending_index_entry; |
60 | | BlockHandle pending_handle; // Handle to add to index block |
61 | | |
62 | | std::string compressed_output; |
63 | | }; |
64 | | |
65 | | TableBuilder::TableBuilder(const Options& options, WritableFile* file) |
66 | 81.0k | : rep_(new Rep(options, file)) { |
67 | 81.0k | if (rep_->filter_block != nullptr) { |
68 | 0 | rep_->filter_block->StartBlock(0); |
69 | 0 | } |
70 | 81.0k | } |
71 | | |
72 | 81.0k | TableBuilder::~TableBuilder() { |
73 | 81.0k | assert(rep_->closed); // Catch errors where caller forgot to call Finish() |
74 | 81.0k | delete rep_->filter_block; |
75 | 81.0k | delete rep_; |
76 | 81.0k | } |
77 | | |
78 | 0 | Status TableBuilder::ChangeOptions(const Options& options) { |
79 | | // Note: if more fields are added to Options, update |
80 | | // this function to catch changes that should not be allowed to |
81 | | // change in the middle of building a Table. |
82 | 0 | if (options.comparator != rep_->options.comparator) { |
83 | 0 | return Status::InvalidArgument("changing comparator while building table"); |
84 | 0 | } |
85 | | |
86 | | // Note that any live BlockBuilders point to rep_->options and therefore |
87 | | // will automatically pick up the updated options. |
88 | 0 | rep_->options = options; |
89 | 0 | rep_->index_block_options = options; |
90 | 0 | rep_->index_block_options.block_restart_interval = 1; |
91 | 0 | return Status::OK(); |
92 | 0 | } |
93 | | |
94 | 1.86M | void TableBuilder::Add(const Slice& key, const Slice& value) { |
95 | 1.86M | Rep* r = rep_; |
96 | 1.86M | assert(!r->closed); |
97 | 1.86M | if (!ok()) return; |
98 | 1.86M | if (r->num_entries > 0) { |
99 | 1.78M | assert(r->options.comparator->Compare(key, Slice(r->last_key)) > 0); |
100 | 1.78M | } |
101 | | |
102 | 1.86M | if (r->pending_index_entry) { |
103 | 20.2k | assert(r->data_block.empty()); |
104 | 20.2k | r->options.comparator->FindShortestSeparator(&r->last_key, key); |
105 | 20.2k | std::string handle_encoding; |
106 | 20.2k | r->pending_handle.EncodeTo(&handle_encoding); |
107 | 20.2k | r->index_block.Add(r->last_key, Slice(handle_encoding)); |
108 | 20.2k | r->pending_index_entry = false; |
109 | 20.2k | } |
110 | | |
111 | 1.86M | if (r->filter_block != nullptr) { |
112 | 0 | r->filter_block->AddKey(key); |
113 | 0 | } |
114 | | |
115 | 1.86M | r->last_key.assign(key.data(), key.size()); |
116 | 1.86M | r->num_entries++; |
117 | 1.86M | r->data_block.Add(key, value); |
118 | | |
119 | 1.86M | const size_t estimated_block_size = r->data_block.CurrentSizeEstimate(); |
120 | 1.86M | if (estimated_block_size >= r->options.block_size) { |
121 | 22.6k | Flush(); |
122 | 22.6k | } |
123 | 1.86M | } |
124 | | |
125 | 97.2k | void TableBuilder::Flush() { |
126 | 97.2k | Rep* r = rep_; |
127 | 97.2k | assert(!r->closed); |
128 | 97.2k | if (!ok()) return; |
129 | 97.2k | if (r->data_block.empty()) return; |
130 | 96.1k | assert(!r->pending_index_entry); |
131 | 96.1k | WriteBlock(&r->data_block, &r->pending_handle); |
132 | 96.1k | if (ok()) { |
133 | 96.1k | r->pending_index_entry = true; |
134 | 96.1k | r->status = r->file->Flush(); |
135 | 96.1k | } |
136 | 96.1k | if (r->filter_block != nullptr) { |
137 | 0 | r->filter_block->StartBlock(r->offset); |
138 | 0 | } |
139 | 96.1k | } |
140 | | |
141 | 245k | void TableBuilder::WriteBlock(BlockBuilder* block, BlockHandle* handle) { |
142 | | // File format contains a sequence of blocks where each block has: |
143 | | // block_data: uint8[n] |
144 | | // type: uint8 |
145 | | // crc: uint32 |
146 | 245k | assert(ok()); |
147 | 245k | Rep* r = rep_; |
148 | 245k | Slice raw = block->Finish(); |
149 | | |
150 | 245k | Slice block_contents; |
151 | 245k | CompressionType type = r->options.compression; |
152 | | // TODO(postrelease): Support more compression options: zlib? |
153 | 245k | switch (type) { |
154 | 0 | case kNoCompression: |
155 | 0 | block_contents = raw; |
156 | 0 | break; |
157 | | |
158 | 245k | case kSnappyCompression: { |
159 | 245k | std::string* compressed = &r->compressed_output; |
160 | 245k | if (port::Snappy_Compress(raw.data(), raw.size(), compressed) && |
161 | 245k | compressed->size() < raw.size() - (raw.size() / 8u)) { |
162 | 0 | block_contents = *compressed; |
163 | 245k | } else { |
164 | | // Snappy not supported, or compressed less than 12.5%, so just |
165 | | // store uncompressed form |
166 | 245k | block_contents = raw; |
167 | 245k | type = kNoCompression; |
168 | 245k | } |
169 | 245k | break; |
170 | 0 | } |
171 | | |
172 | 0 | case kZstdCompression: { |
173 | 0 | std::string* compressed = &r->compressed_output; |
174 | 0 | if (port::Zstd_Compress(r->options.zstd_compression_level, raw.data(), |
175 | 0 | raw.size(), compressed) && |
176 | 0 | compressed->size() < raw.size() - (raw.size() / 8u)) { |
177 | 0 | block_contents = *compressed; |
178 | 0 | } else { |
179 | | // Zstd not supported, or compressed less than 12.5%, so just |
180 | | // store uncompressed form |
181 | 0 | block_contents = raw; |
182 | 0 | type = kNoCompression; |
183 | 0 | } |
184 | 0 | break; |
185 | 0 | } |
186 | 245k | } |
187 | 245k | WriteRawBlock(block_contents, type, handle); |
188 | 245k | r->compressed_output.clear(); |
189 | 245k | block->Reset(); |
190 | 245k | } |
191 | | |
192 | | void TableBuilder::WriteRawBlock(const Slice& block_contents, |
193 | 245k | CompressionType type, BlockHandle* handle) { |
194 | 245k | Rep* r = rep_; |
195 | 245k | handle->set_offset(r->offset); |
196 | 245k | handle->set_size(block_contents.size()); |
197 | 245k | r->status = r->file->Append(block_contents); |
198 | 245k | if (r->status.ok()) { |
199 | 245k | char trailer[kBlockTrailerSize]; |
200 | 245k | trailer[0] = type; |
201 | 245k | uint32_t crc = crc32c::Value(block_contents.data(), block_contents.size()); |
202 | 245k | crc = crc32c::Extend(crc, trailer, 1); // Extend crc to cover block type |
203 | 245k | EncodeFixed32(trailer + 1, crc32c::Mask(crc)); |
204 | 245k | r->status = r->file->Append(Slice(trailer, kBlockTrailerSize)); |
205 | 245k | if (r->status.ok()) { |
206 | 245k | r->offset += block_contents.size() + kBlockTrailerSize; |
207 | 245k | } |
208 | 245k | } |
209 | 245k | } |
210 | | |
211 | 2.35M | Status TableBuilder::status() const { return rep_->status; } |
212 | | |
213 | 74.5k | Status TableBuilder::Finish() { |
214 | 74.5k | Rep* r = rep_; |
215 | 74.5k | Flush(); |
216 | 74.5k | assert(!r->closed); |
217 | 74.5k | r->closed = true; |
218 | | |
219 | 74.5k | BlockHandle filter_block_handle, metaindex_block_handle, index_block_handle; |
220 | | |
221 | | // Write filter block |
222 | 74.5k | if (ok() && r->filter_block != nullptr) { |
223 | 0 | WriteRawBlock(r->filter_block->Finish(), kNoCompression, |
224 | 0 | &filter_block_handle); |
225 | 0 | } |
226 | | |
227 | | // Write metaindex block |
228 | 74.5k | if (ok()) { |
229 | 74.5k | BlockBuilder meta_index_block(&r->options); |
230 | 74.5k | if (r->filter_block != nullptr) { |
231 | | // Add mapping from "filter.Name" to location of filter data |
232 | 0 | std::string key = "filter."; |
233 | 0 | key.append(r->options.filter_policy->Name()); |
234 | 0 | std::string handle_encoding; |
235 | 0 | filter_block_handle.EncodeTo(&handle_encoding); |
236 | 0 | meta_index_block.Add(key, handle_encoding); |
237 | 0 | } |
238 | | |
239 | | // TODO(postrelease): Add stats and other meta blocks |
240 | 74.5k | WriteBlock(&meta_index_block, &metaindex_block_handle); |
241 | 74.5k | } |
242 | | |
243 | | // Write index block |
244 | 74.5k | if (ok()) { |
245 | 74.5k | if (r->pending_index_entry) { |
246 | 74.5k | r->options.comparator->FindShortSuccessor(&r->last_key); |
247 | 74.5k | std::string handle_encoding; |
248 | 74.5k | r->pending_handle.EncodeTo(&handle_encoding); |
249 | 74.5k | r->index_block.Add(r->last_key, Slice(handle_encoding)); |
250 | 74.5k | r->pending_index_entry = false; |
251 | 74.5k | } |
252 | 74.5k | WriteBlock(&r->index_block, &index_block_handle); |
253 | 74.5k | } |
254 | | |
255 | | // Write footer |
256 | 74.5k | if (ok()) { |
257 | 74.5k | Footer footer; |
258 | 74.5k | footer.set_metaindex_handle(metaindex_block_handle); |
259 | 74.5k | footer.set_index_handle(index_block_handle); |
260 | 74.5k | std::string footer_encoding; |
261 | 74.5k | footer.EncodeTo(&footer_encoding); |
262 | 74.5k | r->status = r->file->Append(footer_encoding); |
263 | 74.5k | if (r->status.ok()) { |
264 | 74.5k | r->offset += footer_encoding.size(); |
265 | 74.5k | } |
266 | 74.5k | } |
267 | 74.5k | return r->status; |
268 | 74.5k | } |
269 | | |
270 | 6.55k | void TableBuilder::Abandon() { |
271 | 6.55k | Rep* r = rep_; |
272 | 6.55k | assert(!r->closed); |
273 | 6.55k | r->closed = true; |
274 | 6.55k | } |
275 | | |
276 | 235k | uint64_t TableBuilder::NumEntries() const { return rep_->num_entries; } |
277 | | |
278 | 294k | uint64_t TableBuilder::FileSize() const { return rep_->offset; } |
279 | | |
280 | | } // namespace leveldb |