Line data Source code
1 : // Copyright 2011 The LevelDB-Go and Pebble Authors. All rights reserved. Use
2 : // of this source code is governed by a BSD-style license that can be found in
3 : // the LICENSE file.
4 :
5 : package pebble
6 :
7 : import (
8 : "bytes"
9 : "fmt"
10 : "io"
11 : "regexp"
12 : "runtime"
13 : "slices"
14 : "sort"
15 : "strconv"
16 : "strings"
17 : "time"
18 : "unicode"
19 :
20 : "github.com/cockroachdb/crlib/fifo"
21 : "github.com/cockroachdb/errors"
22 : "github.com/cockroachdb/pebble/internal/base"
23 : "github.com/cockroachdb/pebble/internal/cache"
24 : "github.com/cockroachdb/pebble/internal/humanize"
25 : "github.com/cockroachdb/pebble/internal/keyspan"
26 : "github.com/cockroachdb/pebble/internal/manifest"
27 : "github.com/cockroachdb/pebble/internal/testkeys"
28 : "github.com/cockroachdb/pebble/objstorage/objstorageprovider"
29 : "github.com/cockroachdb/pebble/objstorage/remote"
30 : "github.com/cockroachdb/pebble/rangekey"
31 : "github.com/cockroachdb/pebble/sstable"
32 : "github.com/cockroachdb/pebble/sstable/blob"
33 : "github.com/cockroachdb/pebble/sstable/block"
34 : "github.com/cockroachdb/pebble/sstable/colblk"
35 : "github.com/cockroachdb/pebble/vfs"
36 : "github.com/cockroachdb/pebble/wal"
37 : "github.com/cockroachdb/redact"
38 : )
39 :
40 : const (
41 : cacheDefaultSize = 8 << 20 // 8 MB
42 : defaultLevelMultiplier = 10
43 : )
44 :
45 : // FilterType exports the base.FilterType type.
46 : type FilterType = base.FilterType
47 :
48 : // Exported TableFilter constants.
49 : const (
50 : TableFilter = base.TableFilter
51 : )
52 :
53 : // FilterWriter exports the base.FilterWriter type.
54 : type FilterWriter = base.FilterWriter
55 :
56 : // FilterPolicy exports the base.FilterPolicy type.
57 : type FilterPolicy = base.FilterPolicy
58 :
59 : var NoFilterPolicy = base.NoFilterPolicy
60 :
61 : // KeySchema exports the colblk.KeySchema type.
62 : type KeySchema = colblk.KeySchema
63 :
64 : // BlockPropertyCollector exports the sstable.BlockPropertyCollector type.
65 : type BlockPropertyCollector = sstable.BlockPropertyCollector
66 :
67 : // BlockPropertyFilter exports the sstable.BlockPropertyFilter type.
68 : type BlockPropertyFilter = base.BlockPropertyFilter
69 :
70 : // ShortAttributeExtractor exports the base.ShortAttributeExtractor type.
71 : type ShortAttributeExtractor = base.ShortAttributeExtractor
72 :
73 : // UserKeyPrefixBound exports the sstable.UserKeyPrefixBound type.
74 : type UserKeyPrefixBound = sstable.UserKeyPrefixBound
75 :
76 : // IterKeyType configures which types of keys an iterator should surface.
77 : type IterKeyType int8
78 :
79 : // DirLock represents a file lock on a directory. It may be passed to Open through
80 : // Options.Lock to elide lock aquisition during Open.
81 : type DirLock = base.DirLock
82 :
83 : // LockDirectory acquires the directory lock in the named directory, preventing
84 : // another process from opening the database. LockDirectory returns a
85 : // handle to the held lock that may be passed to Open, skipping lock acquisition
86 : // during Open.
87 : //
88 : // LockDirectory may be used to expand the critical section protected by the
89 : // database lock to include setup before the call to Open.
90 0 : func LockDirectory(dirname string, fs vfs.FS) (*DirLock, error) {
91 0 : return base.LockDirectory(dirname, fs)
92 0 : }
93 :
94 : const (
95 : // IterKeyTypePointsOnly configures an iterator to iterate over point keys
96 : // only.
97 : IterKeyTypePointsOnly IterKeyType = iota
98 : // IterKeyTypeRangesOnly configures an iterator to iterate over range keys
99 : // only.
100 : IterKeyTypeRangesOnly
101 : // IterKeyTypePointsAndRanges configures an iterator iterate over both point
102 : // keys and range keys simultaneously.
103 : IterKeyTypePointsAndRanges
104 : )
105 :
106 : // String implements fmt.Stringer.
107 0 : func (t IterKeyType) String() string {
108 0 : switch t {
109 0 : case IterKeyTypePointsOnly:
110 0 : return "points-only"
111 0 : case IterKeyTypeRangesOnly:
112 0 : return "ranges-only"
113 0 : case IterKeyTypePointsAndRanges:
114 0 : return "points-and-ranges"
115 0 : default:
116 0 : panic(fmt.Sprintf("unknown key type %d", t))
117 : }
118 : }
119 :
120 : // IterOptions hold the optional per-query parameters for NewIter.
121 : //
122 : // Like Options, a nil *IterOptions is valid and means to use the default
123 : // values.
124 : type IterOptions struct {
125 : // LowerBound specifies the smallest key (inclusive) that the iterator will
126 : // return during iteration. If the iterator is seeked or iterated past this
127 : // boundary the iterator will return Valid()==false. Setting LowerBound
128 : // effectively truncates the key space visible to the iterator.
129 : LowerBound []byte
130 : // UpperBound specifies the largest key (exclusive) that the iterator will
131 : // return during iteration. If the iterator is seeked or iterated past this
132 : // boundary the iterator will return Valid()==false. Setting UpperBound
133 : // effectively truncates the key space visible to the iterator.
134 : UpperBound []byte
135 : // SkipPoint may be used to skip over point keys that don't match an
136 : // arbitrary predicate during iteration. If set, the Iterator invokes
137 : // SkipPoint for keys encountered. If SkipPoint returns true, the iterator
138 : // will skip the key without yielding it to the iterator operation in
139 : // progress.
140 : //
141 : // SkipPoint must be a pure function and always return the same result when
142 : // provided the same arguments. The iterator may call SkipPoint multiple
143 : // times for the same user key.
144 : SkipPoint func(userKey []byte) bool
145 : // PointKeyFilters can be used to avoid scanning tables and blocks in tables
146 : // when iterating over point keys. This slice represents an intersection
147 : // across all filters, i.e., all filters must indicate that the block is
148 : // relevant.
149 : //
150 : // Performance note: When len(PointKeyFilters) > 0, the caller should ensure
151 : // that cap(PointKeyFilters) is at least len(PointKeyFilters)+1. This helps
152 : // avoid allocations in Pebble internal code that mutates the slice.
153 : PointKeyFilters []BlockPropertyFilter
154 : // RangeKeyFilters can be usefd to avoid scanning tables and blocks in tables
155 : // when iterating over range keys. The same requirements that apply to
156 : // PointKeyFilters apply here too.
157 : RangeKeyFilters []BlockPropertyFilter
158 : // KeyTypes configures which types of keys to iterate over: point keys,
159 : // range keys, or both.
160 : KeyTypes IterKeyType
161 : // RangeKeyMasking can be used to enable automatic masking of point keys by
162 : // range keys. Range key masking is only supported during combined range key
163 : // and point key iteration mode (IterKeyTypePointsAndRanges).
164 : RangeKeyMasking RangeKeyMasking
165 :
166 : // OnlyReadGuaranteedDurable is an advanced option that is only supported by
167 : // the Reader implemented by DB. When set to true, only the guaranteed to be
168 : // durable state is visible in the iterator.
169 : // - This definition is made under the assumption that the FS implementation
170 : // is providing a durability guarantee when data is synced.
171 : // - The visible state represents a consistent point in the history of the
172 : // DB.
173 : // - The implementation is free to choose a conservative definition of what
174 : // is guaranteed durable. For simplicity, the current implementation
175 : // ignores memtables. A more sophisticated implementation could track the
176 : // highest seqnum that is synced to the WAL and published and use that as
177 : // the visible seqnum for an iterator. Note that the latter approach is
178 : // not strictly better than the former since we can have DBs that are (a)
179 : // synced more rarely than memtable flushes, (b) have no WAL. (a) is
180 : // likely to be true in a future CockroachDB context where the DB
181 : // containing the state machine may be rarely synced.
182 : // NB: this current implementation relies on the fact that memtables are
183 : // flushed in seqnum order, and any ingested sstables that happen to have a
184 : // lower seqnum than a non-flushed memtable don't have any overlapping keys.
185 : // This is the fundamental level invariant used in other code too, like when
186 : // merging iterators.
187 : //
188 : // Semantically, using this option provides the caller a "snapshot" as of
189 : // the time the most recent memtable was flushed. An alternate interface
190 : // would be to add a NewSnapshot variant. Creating a snapshot is heavier
191 : // weight than creating an iterator, so we have opted to support this
192 : // iterator option.
193 : OnlyReadGuaranteedDurable bool
194 : // UseL6Filters allows the caller to opt into reading filter blocks for L6
195 : // sstables. Helpful if a lot of SeekPrefixGEs are expected in quick
196 : // succession, that are also likely to not yield a single key. Filter blocks in
197 : // L6 can be relatively large, often larger than data blocks, so the benefit of
198 : // loading them in the cache is minimized if the probability of the key
199 : // existing is not low or if we just expect a one-time Seek (where loading the
200 : // data block directly is better).
201 : UseL6Filters bool
202 : // Category is used for categorized iterator stats. This should not be
203 : // changed by calling SetOptions.
204 : Category block.Category
205 :
206 : DebugRangeKeyStack bool
207 :
208 : // Internal options.
209 :
210 : logger Logger
211 : // Layer corresponding to this file. Only passed in if constructed by a
212 : // levelIter.
213 : layer manifest.Layer
214 : // disableLazyCombinedIteration is an internal testing option.
215 : disableLazyCombinedIteration bool
216 : // snapshotForHideObsoletePoints is specified for/by levelIter when opening
217 : // files and is used to decide whether to hide obsolete points. A value of 0
218 : // implies obsolete points should not be hidden.
219 : snapshotForHideObsoletePoints base.SeqNum
220 :
221 : // NB: If adding new Options, you must account for them in iterator
222 : // construction and Iterator.SetOptions.
223 : }
224 :
225 : // GetLowerBound returns the LowerBound or nil if the receiver is nil.
226 1 : func (o *IterOptions) GetLowerBound() []byte {
227 1 : if o == nil {
228 1 : return nil
229 1 : }
230 1 : return o.LowerBound
231 : }
232 :
233 : // GetUpperBound returns the UpperBound or nil if the receiver is nil.
234 1 : func (o *IterOptions) GetUpperBound() []byte {
235 1 : if o == nil {
236 1 : return nil
237 1 : }
238 1 : return o.UpperBound
239 : }
240 :
241 1 : func (o *IterOptions) pointKeys() bool {
242 1 : if o == nil {
243 0 : return true
244 0 : }
245 1 : return o.KeyTypes == IterKeyTypePointsOnly || o.KeyTypes == IterKeyTypePointsAndRanges
246 : }
247 :
248 1 : func (o *IterOptions) rangeKeys() bool {
249 1 : if o == nil {
250 0 : return false
251 0 : }
252 1 : return o.KeyTypes == IterKeyTypeRangesOnly || o.KeyTypes == IterKeyTypePointsAndRanges
253 : }
254 :
255 1 : func (o *IterOptions) getLogger() Logger {
256 1 : if o == nil || o.logger == nil {
257 1 : return DefaultLogger
258 1 : }
259 1 : return o.logger
260 : }
261 :
262 : // SpanIterOptions creates a SpanIterOptions from this IterOptions.
263 1 : func (o *IterOptions) SpanIterOptions() keyspan.SpanIterOptions {
264 1 : if o == nil {
265 1 : return keyspan.SpanIterOptions{}
266 1 : }
267 1 : return keyspan.SpanIterOptions{
268 1 : RangeKeyFilters: o.RangeKeyFilters,
269 1 : }
270 : }
271 :
272 : // ScanInternalOptions is similar to IterOptions, meant for use with
273 : // scanInternalIterator.
274 : type ScanInternalOptions struct {
275 : IterOptions
276 :
277 : Category block.Category
278 :
279 : VisitPointKey func(key *InternalKey, value LazyValue, iterInfo IteratorLevel) error
280 : VisitRangeDel func(start, end []byte, seqNum SeqNum) error
281 : VisitRangeKey func(start, end []byte, keys []rangekey.Key) error
282 : VisitSharedFile func(sst *SharedSSTMeta) error
283 : VisitExternalFile func(sst *ExternalFile) error
284 :
285 : // IncludeObsoleteKeys specifies whether keys shadowed by newer internal keys
286 : // are exposed. If false, only one internal key per user key is exposed.
287 : IncludeObsoleteKeys bool
288 :
289 : // RateLimitFunc is used to limit the amount of bytes read per second.
290 : RateLimitFunc func(key *InternalKey, value LazyValue) error
291 : }
292 :
293 : // RangeKeyMasking configures automatic hiding of point keys by range keys. A
294 : // non-nil Suffix enables range-key masking. When enabled, range keys with
295 : // suffixes ≥ Suffix behave as masks. All point keys that are contained within a
296 : // masking range key's bounds and have suffixes greater than the range key's
297 : // suffix are automatically skipped.
298 : //
299 : // Specifically, when configured with a RangeKeyMasking.Suffix _s_, and there
300 : // exists a range key with suffix _r_ covering a point key with suffix _p_, and
301 : //
302 : // _s_ ≤ _r_ < _p_
303 : //
304 : // then the point key is elided.
305 : //
306 : // Range-key masking may only be used when iterating over both point keys and
307 : // range keys with IterKeyTypePointsAndRanges.
308 : type RangeKeyMasking struct {
309 : // Suffix configures which range keys may mask point keys. Only range keys
310 : // that are defined at suffixes greater than or equal to Suffix will mask
311 : // point keys.
312 : Suffix []byte
313 : // Filter is an optional field that may be used to improve performance of
314 : // range-key masking through a block-property filter defined over key
315 : // suffixes. If non-nil, Filter is called by Pebble to construct a
316 : // block-property filter mask at iterator creation. The filter is used to
317 : // skip whole point-key blocks containing point keys with suffixes greater
318 : // than a covering range-key's suffix.
319 : //
320 : // To use this functionality, the caller must create and configure (through
321 : // Options.BlockPropertyCollectors) a block-property collector that records
322 : // the maxmimum suffix contained within a block. The caller then must write
323 : // and provide a BlockPropertyFilterMask implementation on that same
324 : // property. See the BlockPropertyFilterMask type for more information.
325 : Filter func() BlockPropertyFilterMask
326 : }
327 :
328 : // BlockPropertyFilterMask extends the BlockPropertyFilter interface for use
329 : // with range-key masking. Unlike an ordinary block property filter, a
330 : // BlockPropertyFilterMask's filtering criteria is allowed to change when Pebble
331 : // invokes its SetSuffix method.
332 : //
333 : // When a Pebble iterator steps into a range key's bounds and the range key has
334 : // a suffix greater than or equal to RangeKeyMasking.Suffix, the range key acts
335 : // as a mask. The masking range key hides all point keys that fall within the
336 : // range key's bounds and have suffixes > the range key's suffix. Without a
337 : // filter mask configured, Pebble performs this hiding by stepping through point
338 : // keys and comparing suffixes. If large numbers of point keys are masked, this
339 : // requires Pebble to load, iterate through and discard a large number of
340 : // sstable blocks containing masked point keys.
341 : //
342 : // If a block-property collector and a filter mask are configured, Pebble may
343 : // skip loading some point-key blocks altogether. If a block's keys are known to
344 : // all fall within the bounds of the masking range key and the block was
345 : // annotated by a block-property collector with the maximal suffix, Pebble can
346 : // ask the filter mask to compare the property to the current masking range
347 : // key's suffix. If the mask reports no intersection, the block may be skipped.
348 : //
349 : // If unsuffixed and suffixed keys are written to the database, care must be
350 : // taken to avoid unintentionally masking un-suffixed keys located in the same
351 : // block as suffixed keys. One solution is to interpret unsuffixed keys as
352 : // containing the maximal suffix value, ensuring that blocks containing
353 : // unsuffixed keys are always loaded.
354 : type BlockPropertyFilterMask interface {
355 : BlockPropertyFilter
356 :
357 : // SetSuffix configures the mask with the suffix of a range key. The filter
358 : // should return false from Intersects whenever it's provided with a
359 : // property encoding a block's minimum suffix that's greater (according to
360 : // Compare) than the provided suffix.
361 : SetSuffix(suffix []byte) error
362 : }
363 :
364 : // WriteOptions hold the optional per-query parameters for Set and Delete
365 : // operations.
366 : //
367 : // Like Options, a nil *WriteOptions is valid and means to use the default
368 : // values.
369 : type WriteOptions struct {
370 : // Sync is whether to sync writes through the OS buffer cache and down onto
371 : // the actual disk, if applicable. Setting Sync is required for durability of
372 : // individual write operations but can result in slower writes.
373 : //
374 : // If false, and the process or machine crashes, then a recent write may be
375 : // lost. This is due to the recently written data being buffered inside the
376 : // process running Pebble. This differs from the semantics of a write system
377 : // call in which the data is buffered in the OS buffer cache and would thus
378 : // survive a process crash.
379 : //
380 : // The default value is true.
381 : Sync bool
382 : }
383 :
384 : // Sync specifies the default write options for writes which synchronize to
385 : // disk.
386 : var Sync = &WriteOptions{Sync: true}
387 :
388 : // NoSync specifies the default write options for writes which do not
389 : // synchronize to disk.
390 : var NoSync = &WriteOptions{Sync: false}
391 :
392 : // GetSync returns the Sync value or true if the receiver is nil.
393 1 : func (o *WriteOptions) GetSync() bool {
394 1 : return o == nil || o.Sync
395 1 : }
396 :
397 : // LevelOptions holds the optional per-level parameters.
398 : type LevelOptions struct {
399 : // BlockRestartInterval is the number of keys between restart points
400 : // for delta encoding of keys.
401 : //
402 : // The default value is 16 for L0, and the value from the previous level for
403 : // all other levels.
404 : BlockRestartInterval int
405 :
406 : // BlockSize is the target uncompressed size in bytes of each table block.
407 : //
408 : // The default value is 4096 for L0, and the value from the previous level for
409 : // all other levels.
410 : BlockSize int
411 :
412 : // BlockSizeThreshold finishes a block if the block size is larger than the
413 : // specified percentage of the target block size and adding the next entry
414 : // would cause the block to be larger than the target block size.
415 : //
416 : // The default value is 90 for L0, and the value from the previous level for
417 : // all other levels.
418 : BlockSizeThreshold int
419 :
420 : // Compression defines the per-block compression to use.
421 : //
422 : // The default value is Snappy for L0, or the function from the previous level
423 : // for all other levels.
424 : //
425 : // ApplyCompressionSettings can be used to initialize this field for all levels.
426 : Compression func() *sstable.CompressionProfile
427 :
428 : // FilterPolicy defines a filter algorithm (such as a Bloom filter) that can
429 : // reduce disk reads for Get calls.
430 : //
431 : // One such implementation is bloom.FilterPolicy(10) from the pebble/bloom
432 : // package.
433 : //
434 : // The default value for L0 is NoFilterPolicy (no filter), and the value from
435 : // the previous level for all other levels.
436 : FilterPolicy FilterPolicy
437 :
438 : // FilterType is a legacy field. The default and only possible value is
439 : // TableFilter.
440 : FilterType FilterType
441 :
442 : // IndexBlockSize is the target uncompressed size in bytes of each index
443 : // block. When the index block size is larger than this target, two-level
444 : // indexes are automatically enabled. Setting this option to a large value
445 : // (such as math.MaxInt32) disables the automatic creation of two-level
446 : // indexes.
447 : //
448 : // The default value is the value of BlockSize for L0, or the value from the
449 : // previous level for all other levels.
450 : IndexBlockSize int
451 : }
452 :
453 : // EnsureL0Defaults ensures that the L0 default values for the options have been
454 : // initialized.
455 1 : func (o *LevelOptions) EnsureL0Defaults() {
456 1 : if o.BlockRestartInterval <= 0 {
457 0 : o.BlockRestartInterval = base.DefaultBlockRestartInterval
458 0 : }
459 1 : if o.BlockSize <= 0 {
460 0 : o.BlockSize = base.DefaultBlockSize
461 1 : } else if o.BlockSize > sstable.MaximumRestartOffset {
462 0 : panic(errors.Errorf("BlockSize %d exceeds MaximumRestartOffset", o.BlockSize))
463 : }
464 1 : if o.BlockSizeThreshold <= 0 {
465 0 : o.BlockSizeThreshold = base.DefaultBlockSizeThreshold
466 0 : }
467 1 : if o.Compression == nil {
468 0 : o.Compression = func() *sstable.CompressionProfile { return sstable.SnappyCompression }
469 : }
470 1 : if o.FilterPolicy == nil {
471 0 : o.FilterPolicy = NoFilterPolicy
472 0 : }
473 1 : if o.IndexBlockSize <= 0 {
474 0 : o.IndexBlockSize = o.BlockSize
475 0 : }
476 : }
477 :
478 : // EnsureL1PlusDefaults ensures that the L1+ default values for the options have
479 : // been initialized. Requires the fully initialized options for the level above.
480 1 : func (o *LevelOptions) EnsureL1PlusDefaults(previousLevel *LevelOptions) {
481 1 : if o.BlockRestartInterval <= 0 {
482 0 : o.BlockRestartInterval = previousLevel.BlockRestartInterval
483 0 : }
484 1 : if o.BlockSize <= 0 {
485 0 : o.BlockSize = previousLevel.BlockSize
486 1 : } else if o.BlockSize > sstable.MaximumRestartOffset {
487 0 : panic(errors.Errorf("BlockSize %d exceeds MaximumRestartOffset", o.BlockSize))
488 : }
489 1 : if o.BlockSizeThreshold <= 0 {
490 0 : o.BlockSizeThreshold = previousLevel.BlockSizeThreshold
491 0 : }
492 1 : if o.Compression == nil {
493 0 : o.Compression = previousLevel.Compression
494 0 : }
495 1 : if o.FilterPolicy == nil {
496 0 : o.FilterPolicy = previousLevel.FilterPolicy
497 0 : }
498 1 : if o.IndexBlockSize <= 0 {
499 0 : o.IndexBlockSize = previousLevel.IndexBlockSize
500 0 : }
501 : }
502 :
503 : // Options holds the optional parameters for configuring pebble. These options
504 : // apply to the DB at large; per-query options are defined by the IterOptions
505 : // and WriteOptions types.
506 : type Options struct {
507 : // Sync sstables periodically in order to smooth out writes to disk. This
508 : // option does not provide any persistency guarantee, but is used to avoid
509 : // latency spikes if the OS automatically decides to write out a large chunk
510 : // of dirty filesystem buffers. This option only controls SSTable syncs; WAL
511 : // syncs are controlled by WALBytesPerSync.
512 : //
513 : // The default value is 512KB.
514 : BytesPerSync int
515 :
516 : // Cache is used to cache uncompressed blocks from sstables. If it is nil,
517 : // a block cache of CacheSize will be created for each DB.
518 : Cache *cache.Cache
519 : // CacheSize is used when Cache is not set. The default value is 8 MB.
520 : CacheSize int64
521 :
522 : // LoadBlockSema, if set, is used to limit the number of blocks that can be
523 : // loaded (i.e. read from the filesystem) in parallel. Each load acquires one
524 : // unit from the semaphore for the duration of the read.
525 : LoadBlockSema *fifo.Semaphore
526 :
527 : // Cleaner cleans obsolete files.
528 : //
529 : // The default cleaner uses the DeleteCleaner.
530 : Cleaner Cleaner
531 :
532 : // Local contains option that pertain to files stored on the local filesystem.
533 : Local struct {
534 : // ReadaheadConfig is used to retrieve the current readahead mode; it is
535 : // consulted whenever a read handle is initialized.
536 : ReadaheadConfig *ReadaheadConfig
537 :
538 : // TODO(radu): move BytesPerSync, LoadBlockSema, Cleaner here.
539 : }
540 :
541 : // Comparer defines a total ordering over the space of []byte keys: a 'less
542 : // than' relationship. The same comparison algorithm must be used for reads
543 : // and writes over the lifetime of the DB.
544 : //
545 : // The default value uses the same ordering as bytes.Compare.
546 : Comparer *Comparer
547 :
548 : // DebugCheck is invoked, if non-nil, whenever a new version is being
549 : // installed. Typically, this is set to pebble.DebugCheckLevels in tests
550 : // or tools only, to check invariants over all the data in the database.
551 : DebugCheck func(*DB) error
552 :
553 : // Disable the write-ahead log (WAL). Disabling the write-ahead log prohibits
554 : // crash recovery, but can improve performance if crash recovery is not
555 : // needed (e.g. when only temporary state is being stored in the database).
556 : //
557 : // TODO(peter): untested
558 : DisableWAL bool
559 :
560 : // ErrorIfExists causes an error on Open if the database already exists.
561 : // The error can be checked with errors.Is(err, ErrDBAlreadyExists).
562 : //
563 : // The default value is false.
564 : ErrorIfExists bool
565 :
566 : // ErrorIfNotExists causes an error on Open if the database does not already
567 : // exist. The error can be checked with errors.Is(err, ErrDBDoesNotExist).
568 : //
569 : // The default value is false which will cause a database to be created if it
570 : // does not already exist.
571 : ErrorIfNotExists bool
572 :
573 : // ErrorIfNotPristine causes an error on Open if the database already exists
574 : // and any operations have been performed on the database. The error can be
575 : // checked with errors.Is(err, ErrDBNotPristine).
576 : //
577 : // Note that a database that contained keys that were all subsequently deleted
578 : // may or may not trigger the error. Currently, we check if there are any live
579 : // SSTs or log records to replay.
580 : ErrorIfNotPristine bool
581 :
582 : // EventListener provides hooks to listening to significant DB events such as
583 : // flushes, compactions, and table deletion.
584 : EventListener *EventListener
585 :
586 : // Experimental contains experimental options which are off by default.
587 : // These options are temporary and will eventually either be deleted, moved
588 : // out of the experimental group, or made the non-adjustable default. These
589 : // options may change at any time, so do not rely on them.
590 : Experimental struct {
591 : // The threshold of L0 read-amplification at which compaction concurrency
592 : // is enabled (if CompactionDebtConcurrency was not already exceeded).
593 : // Every multiple of this value enables another concurrent
594 : // compaction up to CompactionConcurrencyRange.
595 : L0CompactionConcurrency int
596 :
597 : // CompactionDebtConcurrency controls the threshold of compaction debt
598 : // at which additional compaction concurrency slots are added. For every
599 : // multiple of this value in compaction debt bytes, an additional
600 : // concurrent compaction is added. This works "on top" of
601 : // L0CompactionConcurrency, so the higher of the count of compaction
602 : // concurrency slots as determined by the two options is chosen.
603 : CompactionDebtConcurrency uint64
604 :
605 : // CompactionGarbageFractionForMaxConcurrency is the fraction of garbage
606 : // due to DELs and RANGEDELs that causes MaxConcurrentCompactions to be
607 : // allowed. Concurrent compactions are allowed in a linear manner upto
608 : // this limit being reached. A value <= 0.0 disables adding concurrency
609 : // due to garbage.
610 : CompactionGarbageFractionForMaxConcurrency func() float64
611 :
612 : // UseDeprecatedCompensatedScore is a temporary option to revert the
613 : // compaction picker to the previous behavior of only considering
614 : // compaction out of a level if its compensated fill factor divided by
615 : // the next level's fill factor is >= 1.0. The details of this setting
616 : // are documented within its use within the compaction picker.
617 : //
618 : // The default value is false.
619 : UseDeprecatedCompensatedScore func() bool
620 :
621 : // IngestSplit, if it returns true, allows for ingest-time splitting of
622 : // existing sstables into two virtual sstables to allow ingestion sstables to
623 : // slot into a lower level than they otherwise would have.
624 : IngestSplit func() bool
625 :
626 : // ReadCompactionRate controls the frequency of read triggered
627 : // compactions by adjusting `AllowedSeeks` in manifest.TableMetadata:
628 : //
629 : // AllowedSeeks = FileSize / ReadCompactionRate
630 : //
631 : // From LevelDB:
632 : // ```
633 : // We arrange to automatically compact this file after
634 : // a certain number of seeks. Let's assume:
635 : // (1) One seek costs 10ms
636 : // (2) Writing or reading 1MB costs 10ms (100MB/s)
637 : // (3) A compaction of 1MB does 25MB of IO:
638 : // 1MB read from this level
639 : // 10-12MB read from next level (boundaries may be misaligned)
640 : // 10-12MB written to next level
641 : // This implies that 25 seeks cost the same as the compaction
642 : // of 1MB of data. I.e., one seek costs approximately the
643 : // same as the compaction of 40KB of data. We are a little
644 : // conservative and allow approximately one seek for every 16KB
645 : // of data before triggering a compaction.
646 : // ```
647 : ReadCompactionRate int64
648 :
649 : // ReadSamplingMultiplier is a multiplier for the readSamplingPeriod in
650 : // iterator.maybeSampleRead() to control the frequency of read sampling
651 : // to trigger a read triggered compaction. A value of -1 prevents sampling
652 : // and disables read triggered compactions. The default is 1 << 4. which
653 : // gets multiplied with a constant of 1 << 16 to yield 1 << 20 (1MB).
654 : ReadSamplingMultiplier int64
655 :
656 : // NumDeletionsThreshold defines the minimum number of point tombstones
657 : // that must be present in a single data block for that block to be
658 : // considered tombstone-dense for the purposes of triggering a
659 : // tombstone density compaction. Data blocks may also be considered
660 : // tombstone-dense if they meet the criteria defined by
661 : // DeletionSizeRatioThreshold below. Tombstone-dense blocks are identified
662 : // when sstables are written, and so this is effectively an option for
663 : // sstable writers. The default value is 100.
664 : NumDeletionsThreshold int
665 :
666 : // DeletionSizeRatioThreshold defines the minimum ratio of the size of
667 : // point tombstones to the size of a data block that must be reached
668 : // for that block to be considered tombstone-dense for the purposes of
669 : // triggering a tombstone density compaction. Data blocks may also be
670 : // considered tombstone-dense if they meet the criteria defined by
671 : // NumDeletionsThreshold above. Tombstone-dense blocks are identified
672 : // when sstables are written, and so this is effectively an option for
673 : // sstable writers. The default value is 0.5.
674 : DeletionSizeRatioThreshold float32
675 :
676 : // TombstoneDenseCompactionThreshold is the minimum percent of data
677 : // blocks in a table that must be tombstone-dense for that table to be
678 : // eligible for a tombstone density compaction. It should be defined as a
679 : // ratio out of 1. The default value is 0.10.
680 : //
681 : // If multiple tables are eligible for a tombstone density compaction, then
682 : // tables with a higher percent of tombstone-dense blocks are still
683 : // prioritized for compaction.
684 : //
685 : // A zero or negative value disables tombstone density compactions.
686 : TombstoneDenseCompactionThreshold float64
687 :
688 : // FileCacheShards is the number of shards per file cache.
689 : // Reducing the value can reduce the number of idle goroutines per DB
690 : // instance which can be useful in scenarios with a lot of DB instances
691 : // and a large number of CPUs, but doing so can lead to higher contention
692 : // in the file cache and reduced performance.
693 : //
694 : // The default value is the number of logical CPUs, which can be
695 : // limited by runtime.GOMAXPROCS.
696 : FileCacheShards int
697 :
698 : // ValidateOnIngest schedules validation of sstables after they have
699 : // been ingested.
700 : //
701 : // By default, this value is false.
702 : ValidateOnIngest bool
703 :
704 : // LevelMultiplier configures the size multiplier used to determine the
705 : // desired size of each level of the LSM. Defaults to 10.
706 : LevelMultiplier int
707 :
708 : // MultiLevelCompactionHeuristic determines whether to add an additional
709 : // level to a conventional two level compaction.
710 : MultiLevelCompactionHeuristic func() MultiLevelHeuristic
711 :
712 : // EnableValueBlocks is used to decide whether to enable writing
713 : // TableFormatPebblev3 sstables. This setting is only respected by a
714 : // specific subset of format major versions: FormatSSTableValueBlocks,
715 : // FormatFlushableIngest and FormatPrePebblev1MarkedCompacted. In lower
716 : // format major versions, value blocks are never enabled. In higher
717 : // format major versions, value blocks are always enabled.
718 : EnableValueBlocks func() bool
719 :
720 : // ShortAttributeExtractor is used iff EnableValueBlocks() returns true
721 : // (else ignored). If non-nil, a ShortAttribute can be extracted from the
722 : // value and stored with the key, when the value is stored elsewhere.
723 : ShortAttributeExtractor ShortAttributeExtractor
724 :
725 : // DisableIngestAsFlushable disables lazy ingestion of sstables through
726 : // a WAL write and memtable rotation. Only effectual if the format
727 : // major version is at least `FormatFlushableIngest`.
728 : DisableIngestAsFlushable func() bool
729 :
730 : // RemoteStorage enables use of remote storage (e.g. S3) for storing
731 : // sstables. Setting this option enables use of CreateOnShared option and
732 : // allows ingestion of external files.
733 : RemoteStorage remote.StorageFactory
734 :
735 : // If CreateOnShared is non-zero, new sstables are created on remote storage
736 : // (using CreateOnSharedLocator and with the appropriate
737 : // CreateOnSharedStrategy). These sstables can be shared between different
738 : // Pebble instances; the lifecycle of such objects is managed by the
739 : // remote.Storage constructed by options.RemoteStorage.
740 : //
741 : // Can only be used when RemoteStorage is set (and recognizes
742 : // CreateOnSharedLocator).
743 : CreateOnShared remote.CreateOnSharedStrategy
744 : CreateOnSharedLocator remote.Locator
745 :
746 : // CacheSizeBytesBytes is the size of the on-disk block cache for objects
747 : // on shared storage in bytes. If it is 0, no cache is used.
748 : SecondaryCacheSizeBytes int64
749 :
750 : // EnableDeleteOnlyCompactionExcises enables delete-only compactions to also
751 : // apply delete-only compaction hints on sstables that partially overlap
752 : // with it. This application happens through an excise, similar to
753 : // the excise phase of IngestAndExcise.
754 : EnableDeleteOnlyCompactionExcises func() bool
755 :
756 : // CompactionScheduler, if set, is used to create a scheduler to limit
757 : // concurrent compactions as well as to pace compactions already chosen. If
758 : // nil, a default scheduler is created and used.
759 : CompactionScheduler func() CompactionScheduler
760 :
761 : UserKeyCategories UserKeyCategories
762 :
763 : // ValueSeparationPolicy controls the policy for separating values into
764 : // external blob files. If nil, value separation defaults to disabled.
765 : // The value separation policy is ignored if EnableColumnarBlocks() is
766 : // false.
767 : ValueSeparationPolicy func() ValueSeparationPolicy
768 :
769 : // SpanPolicyFunc is used to determine the SpanPolicy for a key region.
770 : SpanPolicyFunc SpanPolicyFunc
771 : }
772 :
773 : // Filters is a map from filter policy name to filter policy. It is used for
774 : // debugging tools which may be used on multiple databases configured with
775 : // different filter policies. It is not necessary to populate this filters
776 : // map during normal usage of a DB (it will be done automatically by
777 : // EnsureDefaults).
778 : Filters map[string]FilterPolicy
779 :
780 : // FlushDelayDeleteRange configures how long the database should wait before
781 : // forcing a flush of a memtable that contains a range deletion. Disk space
782 : // cannot be reclaimed until the range deletion is flushed. No automatic
783 : // flush occurs if zero.
784 : FlushDelayDeleteRange time.Duration
785 :
786 : // FlushDelayRangeKey configures how long the database should wait before
787 : // forcing a flush of a memtable that contains a range key. Range keys in
788 : // the memtable prevent lazy combined iteration, so it's desirable to flush
789 : // range keys promptly. No automatic flush occurs if zero.
790 : FlushDelayRangeKey time.Duration
791 :
792 : // FlushSplitBytes denotes the target number of bytes per sublevel in
793 : // each flush split interval (i.e. range between two flush split keys)
794 : // in L0 sstables. When set to zero, only a single sstable is generated
795 : // by each flush. When set to a non-zero value, flushes are split at
796 : // points to meet L0's TargetFileSize, any grandparent-related overlap
797 : // options, and at boundary keys of L0 flush split intervals (which are
798 : // targeted to contain around FlushSplitBytes bytes in each sublevel
799 : // between pairs of boundary keys). Splitting sstables during flush
800 : // allows increased compaction flexibility and concurrency when those
801 : // tables are compacted to lower levels.
802 : FlushSplitBytes int64
803 :
804 : // FormatMajorVersion sets the format of on-disk files. It is
805 : // recommended to set the format major version to an explicit
806 : // version, as the default may change over time.
807 : //
808 : // At Open if the existing database is formatted using a later
809 : // format major version that is known to this version of Pebble,
810 : // Pebble will continue to use the later format major version. If
811 : // the existing database's version is unknown, the caller may use
812 : // FormatMostCompatible and will be able to open the database
813 : // regardless of its actual version.
814 : //
815 : // If the existing database is formatted using a format major
816 : // version earlier than the one specified, Open will automatically
817 : // ratchet the database to the specified format major version.
818 : FormatMajorVersion FormatMajorVersion
819 :
820 : // FS provides the interface for persistent file storage.
821 : //
822 : // The default value uses the underlying operating system's file system.
823 : FS vfs.FS
824 :
825 : // KeySchema is the name of the key schema that should be used when writing
826 : // new sstables. There must be a key schema with this name defined in
827 : // KeySchemas. If not set, colblk.DefaultKeySchema is used to construct a
828 : // default key schema.
829 : KeySchema string
830 :
831 : // KeySchemas defines the set of known schemas of user keys. When columnar
832 : // blocks are in use (see FormatColumnarBlocks), the user may specify how a
833 : // key should be decomposed into columns. Each KeySchema must have a unique
834 : // name. The schema named by Options.KeySchema is used while writing
835 : // sstables during flushes and compactions.
836 : //
837 : // Multiple KeySchemas may be used over the lifetime of a database. Once a
838 : // KeySchema is used, it must be provided in KeySchemas in subsequent calls
839 : // to Open for perpetuity.
840 : KeySchemas sstable.KeySchemas
841 :
842 : // Lock, if set, must be a database lock acquired through LockDirectory for
843 : // the same directory passed to Open. If provided, Open will skip locking
844 : // the directory. Closing the database will not release the lock, and it's
845 : // the responsibility of the caller to release the lock after closing the
846 : // database.
847 : //
848 : // Open will enforce that the Lock passed locks the same directory passed to
849 : // Open. Concurrent calls to Open using the same Lock are detected and
850 : // prohibited.
851 : Lock *base.DirLock
852 :
853 : // The count of L0 files necessary to trigger an L0 compaction.
854 : L0CompactionFileThreshold int
855 :
856 : // The amount of L0 read-amplification necessary to trigger an L0 compaction.
857 : L0CompactionThreshold int
858 :
859 : // Hard limit on L0 read-amplification, computed as the number of L0
860 : // sublevels. Writes are stopped when this threshold is reached.
861 : L0StopWritesThreshold int
862 :
863 : // The maximum number of bytes for LBase. The base level is the level which
864 : // L0 is compacted into. The base level is determined dynamically based on
865 : // the existing data in the LSM. The maximum number of bytes for other levels
866 : // is computed dynamically based on the base level's maximum size. When the
867 : // maximum number of bytes for a level is exceeded, compaction is requested.
868 : LBaseMaxBytes int64
869 :
870 : // TargetFileSizes contains the target file size for each level, ignoring
871 : // unpopulated levels. Specifically:
872 : // - TargetFileSizes[0] is the target file size for L0;
873 : // - TargetFileSizes[1] is the target file size for Lbase;
874 : // - TargetFileSizes[2] is the target file size for Lbase+1;
875 : // and so on.
876 : //
877 : // The default value for TargetFileSizes[0] is 2MB.
878 : // The default value for TargetFileSizes[i] is TargetFileSizes[i-1] * 2.
879 : TargetFileSizes [manifest.NumLevels]int64
880 :
881 : // Per-level options. Levels[i] contains the options for Li (regardless of
882 : // what Lbase is).
883 : Levels [manifest.NumLevels]LevelOptions
884 :
885 : // LoggerAndTracer will be used, if non-nil, else Logger will be used and
886 : // tracing will be a noop.
887 :
888 : // Logger used to write log messages.
889 : //
890 : // The default logger uses the Go standard library log package.
891 : Logger Logger
892 : // LoggerAndTracer is used for writing log messages and traces.
893 : LoggerAndTracer LoggerAndTracer
894 :
895 : // MaxManifestFileSize is the maximum size the MANIFEST file is allowed to
896 : // become. When the MANIFEST exceeds this size it is rolled over and a new
897 : // MANIFEST is created.
898 : MaxManifestFileSize int64
899 :
900 : // MaxOpenFiles is a soft limit on the number of open files that can be
901 : // used by the DB.
902 : //
903 : // The default value is 1000.
904 : MaxOpenFiles int
905 :
906 : // The size of a MemTable in steady state. The actual MemTable size starts at
907 : // min(256KB, MemTableSize) and doubles for each subsequent MemTable up to
908 : // MemTableSize. This reduces the memory pressure caused by MemTables for
909 : // short lived (test) DB instances. Note that more than one MemTable can be
910 : // in existence since flushing a MemTable involves creating a new one and
911 : // writing the contents of the old one in the
912 : // background. MemTableStopWritesThreshold places a hard limit on the size of
913 : // the queued MemTables.
914 : //
915 : // The default value is 4MB.
916 : MemTableSize uint64
917 :
918 : // Hard limit on the number of queued of MemTables. Writes are stopped when
919 : // the sum of the queued memtable sizes exceeds:
920 : // MemTableStopWritesThreshold * MemTableSize.
921 : //
922 : // This value should be at least 2 or writes will stop whenever a MemTable is
923 : // being flushed.
924 : //
925 : // The default value is 2.
926 : MemTableStopWritesThreshold int
927 :
928 : // Merger defines the associative merge operation to use for merging values
929 : // written with {Batch,DB}.Merge.
930 : //
931 : // The default merger concatenates values.
932 : Merger *Merger
933 :
934 : // CompactionConcurrencyRange returns a [lower, upper] range for the number of
935 : // compactions Pebble runs in parallel (with the caveats below), not including
936 : // download compactions (which have a separate limit specified by
937 : // MaxConcurrentDownloads).
938 : //
939 : // The lower value is the concurrency allowed under normal circumstances.
940 : // Pebble can dynamically increase the concurrency based on heuristics (like
941 : // high read amplification or compaction debt) up to the maximum.
942 : //
943 : // The upper value is a rough upper bound since delete-only compactions (a) do
944 : // not use the CompactionScheduler, and (b) the CompactionScheduler may use
945 : // other criteria to decide on how many compactions to permit.
946 : //
947 : // Elaborating on (b), when the ConcurrencyLimitScheduler is being used, the
948 : // value returned by DB.GetAllowedWithoutPermission fully controls how many
949 : // compactions get to run. Other CompactionSchedulers may use additional
950 : // criteria, like resource availability.
951 : //
952 : // Elaborating on (a), we don't use the CompactionScheduler to schedule
953 : // delete-only compactions since they are expected to be almost free from a
954 : // CPU and disk usage perspective. Since the CompactionScheduler does not
955 : // know about their existence, the total running count can exceed this
956 : // value. For example, consider CompactionConcurrencyRange returns 3, and the
957 : // current value returned from DB.GetAllowedWithoutPermission is also 3. Say
958 : // 3 delete-only compactions are also running. Then the
959 : // ConcurrencyLimitScheduler can also start 3 other compactions, for a total
960 : // of 6.
961 : //
962 : // DB.GetAllowedWithoutPermission returns a value in the interval
963 : // [lower, upper]. A value > lower is returned:
964 : // - when L0 read-amplification passes the L0CompactionConcurrency threshold;
965 : // - when compaction debt passes the CompactionDebtConcurrency threshold;
966 : // - when there are multiple manual compactions waiting to run.
967 : //
968 : // lower and upper must be greater than 0. If lower > upper, then upper is
969 : // used for both.
970 : //
971 : // The default values are 1, 1.
972 : CompactionConcurrencyRange func() (lower, upper int)
973 :
974 : // MaxConcurrentDownloads specifies the maximum number of download
975 : // compactions. These are compactions that copy an external file to the local
976 : // store.
977 : //
978 : // This limit is independent of CompactionConcurrencyRange; at any point in
979 : // time, we may be running CompactionConcurrencyRange non-download compactions
980 : // and MaxConcurrentDownloads download compactions.
981 : //
982 : // MaxConcurrentDownloads() must be greater than 0.
983 : //
984 : // The default value is 1.
985 : MaxConcurrentDownloads func() int
986 :
987 : // DisableAutomaticCompactions dictates whether automatic compactions are
988 : // scheduled or not. The default is false (enabled). This option is only used
989 : // externally when running a manual compaction, and internally for tests.
990 : //
991 : // Note that this field is only consulted while holding DB.mu, so it it safe
992 : // for a test to modify it while holding DB.mu.
993 : DisableAutomaticCompactions bool
994 :
995 : // DisableConsistencyCheck disables the consistency check that is performed on
996 : // open. Should only be used when a database cannot be opened normally (e.g.
997 : // some of the tables don't exist / aren't accessible).
998 : DisableConsistencyCheck bool
999 :
1000 : // DisableTableStats dictates whether tables should be loaded asynchronously
1001 : // to compute statistics that inform compaction heuristics. The collection
1002 : // of table stats improves compaction of tombstones, reclaiming disk space
1003 : // more quickly and in some cases reducing write amplification in the
1004 : // presence of tombstones. Disabling table stats may be useful in tests
1005 : // that require determinism as the asynchronicity of table stats collection
1006 : // introduces significant nondeterminism.
1007 : DisableTableStats bool
1008 :
1009 : // NoSyncOnClose decides whether the Pebble instance will enforce a
1010 : // close-time synchronization (e.g., fdatasync() or sync_file_range())
1011 : // on files it writes to. Setting this to true removes the guarantee for a
1012 : // sync on close. Some implementations can still issue a non-blocking sync.
1013 : NoSyncOnClose bool
1014 :
1015 : // NumPrevManifest is the number of non-current or older manifests which
1016 : // we want to keep around for debugging purposes. By default, we're going
1017 : // to keep one older manifest.
1018 : NumPrevManifest int
1019 :
1020 : // ReadOnly indicates that the DB should be opened in read-only mode. Writes
1021 : // to the DB will return an error, background compactions are disabled, and
1022 : // the flush that normally occurs after replaying the WAL at startup is
1023 : // disabled.
1024 : ReadOnly bool
1025 :
1026 : // FileCache is an initialized FileCache which should be set as an
1027 : // option if the DB needs to be initialized with a pre-existing file cache.
1028 : // If FileCache is nil, then a file cache which is unique to the DB instance
1029 : // is created. FileCache can be shared between db instances by setting it here.
1030 : // The FileCache set here must use the same underlying cache as Options.Cache
1031 : // and pebble will panic otherwise.
1032 : FileCache *FileCache
1033 :
1034 : // BlockPropertyCollectors is a list of BlockPropertyCollector creation
1035 : // functions. A new BlockPropertyCollector is created for each sstable
1036 : // built and lives for the lifetime of writing that table.
1037 : BlockPropertyCollectors []func() BlockPropertyCollector
1038 :
1039 : // WALBytesPerSync sets the number of bytes to write to a WAL before calling
1040 : // Sync on it in the background. Just like with BytesPerSync above, this
1041 : // helps smooth out disk write latencies, and avoids cases where the OS
1042 : // writes a lot of buffered data to disk at once. However, this is less
1043 : // necessary with WALs, as many write operations already pass in
1044 : // Sync = true.
1045 : //
1046 : // The default value is 0, i.e. no background syncing. This matches the
1047 : // default behaviour in RocksDB.
1048 : WALBytesPerSync int
1049 :
1050 : // WALDir specifies the directory to store write-ahead logs (WALs) in. If
1051 : // empty (the default), WALs will be stored in the same directory as sstables
1052 : // (i.e. the directory passed to pebble.Open).
1053 : WALDir string
1054 :
1055 : // WALDirLock, if set, must be a directory lock acquired through LockDirectory
1056 : // for the same directory set on WALDir passed to Open. If provided, Open will
1057 : // skip locking the directory. Closing the database will not release the lock,
1058 : // and it's the responsibility of the caller to release the lock after closing the
1059 : // database.
1060 : //
1061 : // Open will enforce that the Lock passed locks the same WAL directory passed to
1062 : // Open. Concurrent calls to Open using the same Lock are detected and
1063 : // prohibited.
1064 : WALDirLock *base.DirLock
1065 :
1066 : // WALFailover may be set to configure Pebble to monitor writes to its
1067 : // write-ahead log and failover to writing write-ahead log entries to a
1068 : // secondary location (eg, a separate physical disk). WALFailover may be
1069 : // used to improve write availability in the presence of transient disk
1070 : // unavailability.
1071 : WALFailover *WALFailoverOptions
1072 :
1073 : // WALRecoveryDirs is a list of additional directories that should be
1074 : // scanned for the existence of additional write-ahead logs. WALRecoveryDirs
1075 : // is expected to be used when starting Pebble with a new WALDir or a new
1076 : // WALFailover configuration. The directories associated with the previous
1077 : // configuration may still contain WALs that are required for recovery of
1078 : // the current database state.
1079 : //
1080 : // If a previous WAL configuration may have stored WALs elsewhere but there
1081 : // is not a corresponding entry in WALRecoveryDirs, Open will error.
1082 : WALRecoveryDirs []wal.Dir
1083 :
1084 : // WALMinSyncInterval is the minimum duration between syncs of the WAL. If
1085 : // WAL syncs are requested faster than this interval, they will be
1086 : // artificially delayed. Introducing a small artificial delay (500us) between
1087 : // WAL syncs can allow more operations to arrive and reduce IO operations
1088 : // while having a minimal impact on throughput. This option is supplied as a
1089 : // closure in order to allow the value to be changed dynamically. The default
1090 : // value is 0.
1091 : //
1092 : // TODO(peter): rather than a closure, should there be another mechanism for
1093 : // changing options dynamically?
1094 : WALMinSyncInterval func() time.Duration
1095 :
1096 : // The controls below manage deletion pacing, which slows down
1097 : // deletions when compactions finish or when readers close and
1098 : // obsolete files must be cleaned up. Rapid deletion of many
1099 : // files simultaneously can increase disk latency on certain
1100 : // SSDs, and this functionality helps protect against that.
1101 :
1102 : // TargetByteDeletionRate is the rate (in bytes per second) at which sstable file
1103 : // deletions are limited to (under normal circumstances).
1104 : //
1105 : // This value is only a best-effort target; the effective rate can be
1106 : // higher if deletions are falling behind or disk space is running low.
1107 : //
1108 : // Setting this to 0 disables deletion pacing, which is also the default.
1109 : TargetByteDeletionRate int
1110 :
1111 : // FreeSpaceThresholdBytes specifies the minimum amount of free disk space that Pebble
1112 : // attempts to maintain. If free disk space drops below this threshold, deletions
1113 : // are accelerated above TargetByteDeletionRate until the threshold is restored.
1114 : // Default is 16GB.
1115 : FreeSpaceThresholdBytes uint64
1116 :
1117 : // FreeSpaceTimeframe sets the duration (in seconds) within which Pebble attempts
1118 : // to restore the free disk space back to FreeSpaceThreshold. A lower value means
1119 : // more aggressive deletions. Default is 10s.
1120 : FreeSpaceTimeframe time.Duration
1121 :
1122 : // ObsoleteBytesMaxRatio specifies the maximum allowed ratio of obsolete files to
1123 : // live files. If this ratio is exceeded, Pebble speeds up deletions above the
1124 : // TargetByteDeletionRate until the ratio is restored. Default is 0.20.
1125 : ObsoleteBytesMaxRatio float64
1126 :
1127 : // ObsoleteBytesTimeframe sets the duration (in seconds) within which Pebble aims
1128 : // to restore the obsolete-to-live bytes ratio below ObsoleteBytesMaxRatio. A lower
1129 : // value means more aggressive deletions. Default is 300s.
1130 : ObsoleteBytesTimeframe time.Duration
1131 :
1132 : // EnableSQLRowSpillMetrics specifies whether the Pebble instance will only be used
1133 : // to temporarily persist data spilled to disk for row-oriented SQL query execution.
1134 : EnableSQLRowSpillMetrics bool
1135 :
1136 : // AllocatorSizeClasses provides a sorted list containing the supported size
1137 : // classes of the underlying memory allocator. This provides hints to the
1138 : // sstable block writer's flushing policy to select block sizes that
1139 : // preemptively reduce internal fragmentation when loaded into the block cache.
1140 : AllocatorSizeClasses []int
1141 :
1142 : // private options are only used by internal tests or are used internally
1143 : // for facilitating upgrade paths of unconfigurable functionality.
1144 : private struct {
1145 : // disableDeleteOnlyCompactions prevents the scheduling of delete-only
1146 : // compactions that drop sstables wholy covered by range tombstones or
1147 : // range key tombstones.
1148 : disableDeleteOnlyCompactions bool
1149 :
1150 : // disableElisionOnlyCompactions prevents the scheduling of elision-only
1151 : // compactions that rewrite sstables in place in order to elide obsolete
1152 : // keys.
1153 : disableElisionOnlyCompactions bool
1154 :
1155 : // disableLazyCombinedIteration is a private option used by the
1156 : // metamorphic tests to test equivalence between lazy-combined iteration
1157 : // and constructing the range-key iterator upfront. It's a private
1158 : // option to avoid littering the public interface with options that we
1159 : // do not want to allow users to actually configure.
1160 : disableLazyCombinedIteration bool
1161 :
1162 : // testingAlwaysWaitForCleanup is set by some tests to force waiting for
1163 : // obsolete file deletion (to make events deterministic).
1164 : testingAlwaysWaitForCleanup bool
1165 :
1166 : // fsCloser holds a closer that should be invoked after a DB using these
1167 : // Options is closed. This is used to automatically stop the
1168 : // long-running goroutine associated with the disk-health-checking FS.
1169 : // See the initialization of FS in EnsureDefaults. Note that care has
1170 : // been taken to ensure that it is still safe to continue using the FS
1171 : // after this closer has been invoked. However, if write operations
1172 : // against the FS are made after the DB is closed, the FS may leak a
1173 : // goroutine indefinitely.
1174 : fsCloser io.Closer
1175 : }
1176 : }
1177 :
1178 : // ValueSeparationPolicy controls the policy for separating values into
1179 : // external blob files.
1180 : type ValueSeparationPolicy struct {
1181 : // Enabled controls whether value separation is enabled.
1182 : Enabled bool
1183 : // MinimumSize imposes a lower bound on the size of values that can be
1184 : // separated into a blob file. Values smaller than this are always written
1185 : // to the sstable (but may still be written to a value block within the
1186 : // sstable).
1187 : //
1188 : // MinimumSize must be > 0.
1189 : MinimumSize int
1190 : // MaxBlobReferenceDepth limits the number of potentially overlapping (in
1191 : // the keyspace) blob files that can be referenced by a single sstable. If a
1192 : // compaction may produce an output sstable referencing more than this many
1193 : // overlapping blob files, the compaction will instead rewrite referenced
1194 : // values into new blob files.
1195 : //
1196 : // MaxBlobReferenceDepth must be > 0.
1197 : MaxBlobReferenceDepth int
1198 : // RewriteMinimumAge specifies how old a blob file must be in order for it
1199 : // to be eligible for a rewrite that reclaims disk space. Lower values
1200 : // reduce space amplification at the cost of write amplification
1201 : RewriteMinimumAge time.Duration
1202 : // GarbageRatioLowPriority is a value in the range [0, 1.0] configuring how
1203 : // aggressively blob files should be written in order to reduce space
1204 : // amplification induced by value separation. As sstable compactions rewrite
1205 : // references to blob files, data may be duplicated. Older blob files
1206 : // containing the duplicated data may need to remain because other sstables
1207 : // are referencing other values contained in the same file.
1208 : //
1209 : // The DB can rewrite these blob files in place in order to reduce this
1210 : // space amplification, but this incurs write amplification. This option
1211 : // configures how much garbage may accrue before the DB will attempt to
1212 : // rewrite blob files to reduce it if there is no other higher priority
1213 : // compaction work available. A value of 0.20 indicates that once 20% of
1214 : // values in blob files are unreferenced, the DB should attempt to rewrite
1215 : // blob files to reclaim disk space.
1216 : //
1217 : // A value of 1.0 indicates that the DB should never attempt to rewrite blob
1218 : // files.
1219 : GarbageRatioLowPriority float64
1220 : // GarbageRatioHighPriority is a value in the range [0, 1.0] configuring how
1221 : // much garbage must be present before the DB will schedule blob file
1222 : // rewrite compactions at a high priority (including above default
1223 : // compactions necessary to keep up with incoming writes). At most 1 blob file
1224 : // rewrite compaction will be scheduled at a time.
1225 : //
1226 : // See GarbageRatioLowPriority for more details. Must be >=
1227 : // GarbageRatioLowPriority.
1228 : GarbageRatioHighPriority float64
1229 : }
1230 :
1231 : // SpanPolicy contains policies that can vary by key range. The zero value is
1232 : // the default value.
1233 : type SpanPolicy struct {
1234 : // Prefer a faster compression algorithm for the keys in this span.
1235 : //
1236 : // This is useful for keys that are frequently read or written but which don't
1237 : // amount to a significant amount of space.
1238 : PreferFastCompression bool
1239 :
1240 : // DisableValueSeparationBySuffix disables discriminating KVs depending on
1241 : // suffix.
1242 : //
1243 : // Among a set of keys with the same prefix, Pebble's default heuristics
1244 : // optimize access to the KV with the smallest suffix. This is useful for MVCC
1245 : // keys (where the smallest suffix is the latest version), but should be
1246 : // disabled for keys where the suffix does not correspond to a version.
1247 : DisableValueSeparationBySuffix bool
1248 :
1249 : // ValueStoragePolicy is a hint used to determine where to store the values
1250 : // for KVs.
1251 : ValueStoragePolicy ValueStoragePolicy
1252 : }
1253 :
1254 : // String returns a string representation of the SpanPolicy.
1255 0 : func (p SpanPolicy) String() string {
1256 0 : var sb strings.Builder
1257 0 : if p.PreferFastCompression {
1258 0 : sb.WriteString("fast-compression,")
1259 0 : }
1260 0 : if p.DisableValueSeparationBySuffix {
1261 0 : sb.WriteString("disable-value-separation-by-suffix,")
1262 0 : }
1263 0 : switch p.ValueStoragePolicy {
1264 0 : case ValueStorageLowReadLatency:
1265 0 : sb.WriteString("low-read-latency,")
1266 0 : case ValueStorageLatencyTolerant:
1267 0 : sb.WriteString("latency-tolerant,")
1268 : }
1269 0 : return strings.TrimSuffix(sb.String(), ",")
1270 : }
1271 :
1272 : // ValueStoragePolicy is a hint used to determine where to store the values for
1273 : // KVs.
1274 : type ValueStoragePolicy uint8
1275 :
1276 : const (
1277 : // ValueStorageDefault is the default value; Pebble will respect global
1278 : // configuration for value blocks and value separation.
1279 : ValueStorageDefault ValueStoragePolicy = iota
1280 :
1281 : // ValueStorageLowReadLatency indicates Pebble should prefer storing values
1282 : // in-place.
1283 : ValueStorageLowReadLatency
1284 :
1285 : // ValueStorageLatencyTolerant indicates value retrieval can tolerate
1286 : // additional latency, so Pebble should aggressively prefer storing values
1287 : // separately if it can reduce write amplification.
1288 : //
1289 : // If the global Options' enable value separation, Pebble may choose to
1290 : // separate values under the LatencyTolerant policy even if they do not meet
1291 : // the minimum size threshold of the global Options' ValueSeparationPolicy.
1292 : ValueStorageLatencyTolerant
1293 : )
1294 :
1295 : // SpanPolicyFunc is used to determine the SpanPolicy for a key region.
1296 : //
1297 : // The returned policy is valid from the start key until (and not including) the
1298 : // end key.
1299 : //
1300 : // A flush or compaction will call this function once for the first key to be
1301 : // output. If the compaction reaches the end key, the current output sst is
1302 : // finished and the function is called again.
1303 : //
1304 : // The end key can be empty, in which case the policy is valid for the entire
1305 : // keyspace after startKey.
1306 : type SpanPolicyFunc func(startKey []byte) (policy SpanPolicy, endKey []byte, err error)
1307 :
1308 : // SpanAndPolicy defines a key range and the policy to apply to it.
1309 : type SpanAndPolicy struct {
1310 : KeyRange KeyRange
1311 : Policy SpanPolicy
1312 : }
1313 :
1314 : // MakeStaticSpanPolicyFunc returns a SpanPolicyFunc that applies a given policy
1315 : // to the given span (and the default policy outside the span). The supplied
1316 : // policies must be non-overlapping in key range.
1317 0 : func MakeStaticSpanPolicyFunc(cmp base.Compare, inputPolicies ...SpanAndPolicy) SpanPolicyFunc {
1318 0 : // Collect all the boundaries of the input policies, sort and deduplicate them.
1319 0 : uniqueKeys := make([][]byte, 0, 2*len(inputPolicies))
1320 0 : for i := range inputPolicies {
1321 0 : uniqueKeys = append(uniqueKeys, inputPolicies[i].KeyRange.Start)
1322 0 : uniqueKeys = append(uniqueKeys, inputPolicies[i].KeyRange.End)
1323 0 : }
1324 0 : slices.SortFunc(uniqueKeys, cmp)
1325 0 : uniqueKeys = slices.CompactFunc(uniqueKeys, func(a, b []byte) bool { return cmp(a, b) == 0 })
1326 :
1327 : // Create a list of policies.
1328 0 : policies := make([]SpanPolicy, len(uniqueKeys)-1)
1329 0 : for _, p := range inputPolicies {
1330 0 : idx, _ := slices.BinarySearchFunc(uniqueKeys, p.KeyRange.Start, cmp)
1331 0 : policies[idx] = p.Policy
1332 0 : }
1333 :
1334 0 : return func(startKey []byte) (_ SpanPolicy, endKey []byte, _ error) {
1335 0 : // Find the policy that applies to the start key.
1336 0 : idx, eq := slices.BinarySearchFunc(uniqueKeys, startKey, cmp)
1337 0 : switch idx {
1338 0 : case len(uniqueKeys):
1339 0 : // The start key is after the last policy.
1340 0 : return SpanPolicy{}, nil, nil
1341 0 : case len(uniqueKeys) - 1:
1342 0 : if eq {
1343 0 : // The start key is exactly the start of the last policy.
1344 0 : return SpanPolicy{}, nil, nil
1345 0 : }
1346 0 : case 0:
1347 0 : if !eq {
1348 0 : // The start key is before the first policy.
1349 0 : return SpanPolicy{}, uniqueKeys[0], nil
1350 0 : }
1351 : }
1352 0 : if eq {
1353 0 : // The start key is exactly the start of this policy.
1354 0 : return policies[idx], uniqueKeys[idx+1], nil
1355 0 : }
1356 : // The start key is between two policies.
1357 0 : return policies[idx-1], uniqueKeys[idx], nil
1358 : }
1359 : }
1360 :
1361 : // WALFailoverOptions configures the WAL failover mechanics to use during
1362 : // transient write unavailability on the primary WAL volume.
1363 : type WALFailoverOptions struct {
1364 : // Secondary indicates the secondary directory and VFS to use in the event a
1365 : // write to the primary WAL stalls. The Lock field may be set during setup to
1366 : // preacquire the lock on the secondary directory.
1367 : Secondary wal.Dir
1368 :
1369 : // FailoverOptions provides configuration of the thresholds and intervals
1370 : // involved in WAL failover. If any of its fields are left unspecified,
1371 : // reasonable defaults will be used.
1372 : wal.FailoverOptions
1373 : }
1374 :
1375 : // ReadaheadConfig controls the use of read-ahead.
1376 : type ReadaheadConfig = objstorageprovider.ReadaheadConfig
1377 :
1378 : // JemallocSizeClasses exports sstable.JemallocSizeClasses.
1379 : var JemallocSizeClasses = sstable.JemallocSizeClasses
1380 :
1381 : // DebugCheckLevels calls CheckLevels on the provided database.
1382 : // It may be set in the DebugCheck field of Options to check
1383 : // level invariants whenever a new version is installed.
1384 1 : func DebugCheckLevels(db *DB) error {
1385 1 : return db.CheckLevels(nil)
1386 1 : }
1387 :
1388 : // DBCompressionSettings contains compression settings for the entire store. It
1389 : // defines compression profiles for each LSM level.
1390 : type DBCompressionSettings struct {
1391 : Name string
1392 : Levels [manifest.NumLevels]*block.CompressionProfile
1393 : }
1394 :
1395 : // Predefined compression settings.
1396 : var (
1397 : DBCompressionNone = UniformDBCompressionSettings(block.NoCompression)
1398 : DBCompressionFastest = UniformDBCompressionSettings(block.FastestCompression)
1399 1 : DBCompressionBalanced = func() DBCompressionSettings {
1400 1 : cs := DBCompressionSettings{Name: "Balanced"}
1401 1 : for i := 0; i < manifest.NumLevels-2; i++ {
1402 1 : cs.Levels[i] = block.FastestCompression
1403 1 : }
1404 1 : cs.Levels[manifest.NumLevels-2] = block.FastCompression // Zstd1 for value blocks.
1405 1 : cs.Levels[manifest.NumLevels-1] = block.BalancedCompression // Zstd1 for data and value blocks.
1406 1 : return cs
1407 : }()
1408 1 : DBCompressionGood = func() DBCompressionSettings {
1409 1 : cs := DBCompressionSettings{Name: "Good"}
1410 1 : for i := 0; i < manifest.NumLevels-2; i++ {
1411 1 : cs.Levels[i] = block.FastestCompression
1412 1 : }
1413 1 : cs.Levels[manifest.NumLevels-2] = block.BalancedCompression // Zstd1 for data and value blocks.
1414 1 : cs.Levels[manifest.NumLevels-1] = block.GoodCompression // Zstd3 for data and value blocks.
1415 1 : return cs
1416 : }()
1417 : )
1418 :
1419 : // UniformDBCompressionSettings returns a DBCompressionSettings which uses the
1420 : // same compression profile on all LSM levels.
1421 1 : func UniformDBCompressionSettings(profile *block.CompressionProfile) DBCompressionSettings {
1422 1 : cs := DBCompressionSettings{Name: profile.Name}
1423 1 : for i := range cs.Levels {
1424 1 : cs.Levels[i] = profile
1425 1 : }
1426 1 : return cs
1427 : }
1428 :
1429 : // ApplyCompressionSettings sets the Compression field in each LevelOptions to
1430 : // call the given function and return the compression profile for that level.
1431 0 : func (o *Options) ApplyCompressionSettings(csFn func() DBCompressionSettings) {
1432 0 : for i := range o.Levels {
1433 0 : levelIdx := i
1434 0 : o.Levels[i].Compression = func() *block.CompressionProfile {
1435 0 : return csFn().Levels[levelIdx]
1436 0 : }
1437 : }
1438 : }
1439 :
1440 : // EnsureDefaults ensures that the default values for all options are set if a
1441 : // valid value was not already specified.
1442 1 : func (o *Options) EnsureDefaults() {
1443 1 : if o.Cache == nil && o.CacheSize == 0 {
1444 0 : o.CacheSize = cacheDefaultSize
1445 0 : }
1446 1 : o.Comparer = o.Comparer.EnsureDefaults()
1447 1 :
1448 1 : if o.BytesPerSync <= 0 {
1449 0 : o.BytesPerSync = 512 << 10 // 512 KB
1450 0 : }
1451 1 : if o.Cleaner == nil {
1452 0 : o.Cleaner = DeleteCleaner{}
1453 0 : }
1454 :
1455 1 : if o.FreeSpaceThresholdBytes == 0 {
1456 0 : o.FreeSpaceThresholdBytes = 16 << 30 // 16 GB
1457 0 : }
1458 :
1459 1 : if o.FreeSpaceTimeframe == 0 {
1460 0 : o.FreeSpaceTimeframe = 10 * time.Second
1461 0 : }
1462 :
1463 1 : if o.ObsoleteBytesMaxRatio == 0 {
1464 0 : o.ObsoleteBytesMaxRatio = 0.20
1465 0 : }
1466 :
1467 1 : if o.ObsoleteBytesTimeframe == 0 {
1468 0 : o.ObsoleteBytesTimeframe = 300 * time.Second
1469 0 : }
1470 :
1471 1 : if o.Experimental.DisableIngestAsFlushable == nil {
1472 1 : o.Experimental.DisableIngestAsFlushable = func() bool { return false }
1473 : }
1474 1 : if o.Experimental.L0CompactionConcurrency <= 0 {
1475 0 : o.Experimental.L0CompactionConcurrency = 10
1476 0 : }
1477 1 : if o.Experimental.CompactionDebtConcurrency <= 0 {
1478 0 : o.Experimental.CompactionDebtConcurrency = 1 << 30 // 1 GB
1479 0 : }
1480 1 : if o.Experimental.CompactionGarbageFractionForMaxConcurrency == nil {
1481 0 : // When 40% of the DB is garbage, the compaction concurrency is at the
1482 0 : // maximum permitted.
1483 0 : o.Experimental.CompactionGarbageFractionForMaxConcurrency = func() float64 { return 0.4 }
1484 : }
1485 1 : if o.Experimental.ValueSeparationPolicy == nil {
1486 0 : o.Experimental.ValueSeparationPolicy = func() ValueSeparationPolicy {
1487 0 : return ValueSeparationPolicy{Enabled: false}
1488 0 : }
1489 : }
1490 1 : if o.KeySchema == "" && len(o.KeySchemas) == 0 {
1491 0 : ks := colblk.DefaultKeySchema(o.Comparer, 16 /* bundleSize */)
1492 0 : o.KeySchema = ks.Name
1493 0 : o.KeySchemas = sstable.MakeKeySchemas(&ks)
1494 0 : }
1495 1 : if o.L0CompactionThreshold <= 0 {
1496 0 : o.L0CompactionThreshold = 4
1497 0 : }
1498 1 : if o.L0CompactionFileThreshold <= 0 {
1499 0 : // Some justification for the default of 500:
1500 0 : // Why not smaller?:
1501 0 : // - The default target file size for L0 is 2MB, so 500 files is <= 1GB
1502 0 : // of data. At observed compaction speeds of > 20MB/s, L0 can be
1503 0 : // cleared of all files in < 1min, so this backlog is not huge.
1504 0 : // - 500 files is low overhead for instantiating L0 sublevels from
1505 0 : // scratch.
1506 0 : // - Lower values were observed to cause excessive and inefficient
1507 0 : // compactions out of L0 in a TPCC import benchmark.
1508 0 : // Why not larger?:
1509 0 : // - More than 1min to compact everything out of L0.
1510 0 : // - CockroachDB's admission control system uses a threshold of 1000
1511 0 : // files to start throttling writes to Pebble. Using 500 here gives
1512 0 : // us headroom between when Pebble should start compacting L0 and
1513 0 : // when the admission control threshold is reached.
1514 0 : //
1515 0 : // We can revisit this default in the future based on better
1516 0 : // experimental understanding.
1517 0 : //
1518 0 : // TODO(jackson): Experiment with slightly lower thresholds [or higher
1519 0 : // admission control thresholds] to see whether a higher L0 score at the
1520 0 : // threshold (currently 2.0) is necessary for some workloads to avoid
1521 0 : // starving L0 in favor of lower-level compactions.
1522 0 : o.L0CompactionFileThreshold = 500
1523 0 : }
1524 1 : if o.L0StopWritesThreshold <= 0 {
1525 0 : o.L0StopWritesThreshold = 12
1526 0 : }
1527 1 : if o.LBaseMaxBytes <= 0 {
1528 0 : o.LBaseMaxBytes = 64 << 20 // 64 MB
1529 0 : }
1530 1 : if o.TargetFileSizes[0] <= 0 {
1531 0 : o.TargetFileSizes[0] = 2 << 20 // 2 MB
1532 0 : }
1533 1 : for i := 1; i < len(o.TargetFileSizes); i++ {
1534 1 : if o.TargetFileSizes[i] <= 0 {
1535 0 : o.TargetFileSizes[i] = o.TargetFileSizes[i-1] * 2
1536 0 : }
1537 : }
1538 1 : o.Levels[0].EnsureL0Defaults()
1539 1 : for i := 1; i < len(o.Levels); i++ {
1540 1 : o.Levels[i].EnsureL1PlusDefaults(&o.Levels[i-1])
1541 1 : }
1542 1 : if o.Logger == nil {
1543 1 : o.Logger = DefaultLogger
1544 1 : }
1545 1 : if o.EventListener == nil {
1546 1 : o.EventListener = &EventListener{}
1547 1 : }
1548 1 : o.EventListener.EnsureDefaults(o.Logger)
1549 1 : if o.MaxManifestFileSize == 0 {
1550 0 : o.MaxManifestFileSize = 128 << 20 // 128 MB
1551 0 : }
1552 1 : if o.MaxOpenFiles == 0 {
1553 0 : o.MaxOpenFiles = 1000
1554 0 : }
1555 1 : if o.MemTableSize <= 0 {
1556 0 : o.MemTableSize = 4 << 20 // 4 MB
1557 0 : }
1558 1 : if o.MemTableStopWritesThreshold <= 0 {
1559 0 : o.MemTableStopWritesThreshold = 2
1560 0 : }
1561 1 : if o.Merger == nil {
1562 0 : o.Merger = DefaultMerger
1563 0 : }
1564 1 : if o.CompactionConcurrencyRange == nil {
1565 0 : o.CompactionConcurrencyRange = func() (int, int) { return 1, 1 }
1566 : }
1567 1 : if o.MaxConcurrentDownloads == nil {
1568 0 : o.MaxConcurrentDownloads = func() int { return 1 }
1569 : }
1570 1 : if o.NumPrevManifest <= 0 {
1571 1 : o.NumPrevManifest = 1
1572 1 : }
1573 :
1574 1 : if o.FormatMajorVersion == FormatDefault {
1575 0 : o.FormatMajorVersion = FormatMinSupported
1576 0 : if o.Experimental.CreateOnShared != remote.CreateOnSharedNone {
1577 0 : o.FormatMajorVersion = FormatMinForSharedObjects
1578 0 : }
1579 : }
1580 :
1581 1 : if o.FS == nil {
1582 0 : o.WithFSDefaults()
1583 0 : }
1584 1 : if o.FlushSplitBytes <= 0 {
1585 0 : o.FlushSplitBytes = 2 * o.TargetFileSizes[0]
1586 0 : }
1587 1 : if o.WALFailover != nil {
1588 1 : o.WALFailover.FailoverOptions.EnsureDefaults()
1589 1 : }
1590 1 : if o.Experimental.UseDeprecatedCompensatedScore == nil {
1591 1 : o.Experimental.UseDeprecatedCompensatedScore = func() bool { return false }
1592 : }
1593 1 : if o.Experimental.LevelMultiplier <= 0 {
1594 1 : o.Experimental.LevelMultiplier = defaultLevelMultiplier
1595 1 : }
1596 1 : if o.Experimental.ReadCompactionRate == 0 {
1597 0 : o.Experimental.ReadCompactionRate = 16000
1598 0 : }
1599 1 : if o.Experimental.ReadSamplingMultiplier == 0 {
1600 0 : o.Experimental.ReadSamplingMultiplier = 1 << 4
1601 0 : }
1602 1 : if o.Experimental.NumDeletionsThreshold == 0 {
1603 0 : o.Experimental.NumDeletionsThreshold = sstable.DefaultNumDeletionsThreshold
1604 0 : }
1605 1 : if o.Experimental.DeletionSizeRatioThreshold == 0 {
1606 0 : o.Experimental.DeletionSizeRatioThreshold = sstable.DefaultDeletionSizeRatioThreshold
1607 0 : }
1608 1 : if o.Experimental.TombstoneDenseCompactionThreshold == 0 {
1609 0 : o.Experimental.TombstoneDenseCompactionThreshold = 0.10
1610 0 : }
1611 1 : if o.Experimental.FileCacheShards <= 0 {
1612 0 : o.Experimental.FileCacheShards = runtime.GOMAXPROCS(0)
1613 0 : }
1614 1 : if o.Experimental.MultiLevelCompactionHeuristic == nil {
1615 0 : o.Experimental.MultiLevelCompactionHeuristic = OptionWriteAmpHeuristic
1616 0 : }
1617 1 : if o.Experimental.SpanPolicyFunc == nil {
1618 1 : o.Experimental.SpanPolicyFunc = func(startKey []byte) (SpanPolicy, []byte, error) { return SpanPolicy{}, nil, nil }
1619 : }
1620 : // TODO(jackson): Enable value separation by default once we have confidence
1621 : // in a default policy.
1622 :
1623 1 : o.initMaps()
1624 : }
1625 :
1626 : // TargetFileSize computes the target file size for the given output level.
1627 1 : func (o *Options) TargetFileSize(outputLevel int, baseLevel int) int64 {
1628 1 : if outputLevel == 0 {
1629 1 : return o.TargetFileSizes[0]
1630 1 : }
1631 1 : if baseLevel > outputLevel {
1632 0 : panic(fmt.Sprintf("invalid base level %d (output level %d)", baseLevel, outputLevel))
1633 : }
1634 1 : return o.TargetFileSizes[outputLevel-baseLevel+1]
1635 : }
1636 :
1637 : // DefaultOptions returns a new Options object with the default values set.
1638 0 : func DefaultOptions() *Options {
1639 0 : o := &Options{}
1640 0 : o.EnsureDefaults()
1641 0 : return o
1642 0 : }
1643 :
1644 : // WithFSDefaults configures the Options to wrap the configured filesystem with
1645 : // the default virtual file system middleware, like disk-health checking.
1646 1 : func (o *Options) WithFSDefaults() {
1647 1 : if o.FS == nil {
1648 0 : o.FS = vfs.Default
1649 0 : }
1650 1 : o.FS, o.private.fsCloser = vfs.WithDiskHealthChecks(o.FS, 5*time.Second, nil,
1651 1 : func(info vfs.DiskSlowInfo) {
1652 0 : o.EventListener.DiskSlow(info)
1653 0 : })
1654 : }
1655 :
1656 : // AddEventListener adds the provided event listener to the Options, in addition
1657 : // to any existing event listener.
1658 0 : func (o *Options) AddEventListener(l EventListener) {
1659 0 : if o.EventListener != nil {
1660 0 : l = TeeEventListener(l, *o.EventListener)
1661 0 : }
1662 0 : o.EventListener = &l
1663 : }
1664 :
1665 : // initMaps initializes the Comparers, Filters, and Mergers maps.
1666 1 : func (o *Options) initMaps() {
1667 1 : for i := range o.Levels {
1668 1 : l := &o.Levels[i]
1669 1 : if l.FilterPolicy != NoFilterPolicy {
1670 1 : if o.Filters == nil {
1671 1 : o.Filters = make(map[string]FilterPolicy)
1672 1 : }
1673 1 : name := l.FilterPolicy.Name()
1674 1 : if _, ok := o.Filters[name]; !ok {
1675 1 : o.Filters[name] = l.FilterPolicy
1676 1 : }
1677 : }
1678 : }
1679 : }
1680 :
1681 : // Clone creates a shallow-copy of the supplied options.
1682 1 : func (o *Options) Clone() *Options {
1683 1 : if o == nil {
1684 0 : return &Options{}
1685 0 : }
1686 1 : n := *o
1687 1 : if o.WALFailover != nil {
1688 1 : c := *o.WALFailover
1689 1 : n.WALFailover = &c
1690 1 : }
1691 1 : return &n
1692 : }
1693 :
1694 1 : func (o *Options) String() string {
1695 1 : var buf bytes.Buffer
1696 1 :
1697 1 : cacheSize := o.CacheSize
1698 1 : if o.Cache != nil {
1699 1 : cacheSize = o.Cache.MaxSize()
1700 1 : }
1701 :
1702 1 : fmt.Fprintf(&buf, "[Version]\n")
1703 1 : fmt.Fprintf(&buf, " pebble_version=0.1\n")
1704 1 : fmt.Fprintf(&buf, "\n")
1705 1 : fmt.Fprintf(&buf, "[Options]\n")
1706 1 : fmt.Fprintf(&buf, " bytes_per_sync=%d\n", o.BytesPerSync)
1707 1 : fmt.Fprintf(&buf, " cache_size=%d\n", cacheSize)
1708 1 : fmt.Fprintf(&buf, " cleaner=%s\n", o.Cleaner)
1709 1 : fmt.Fprintf(&buf, " compaction_debt_concurrency=%d\n", o.Experimental.CompactionDebtConcurrency)
1710 1 : fmt.Fprintf(&buf, " compaction_garbage_fraction_for_max_concurrency=%.2f\n",
1711 1 : o.Experimental.CompactionGarbageFractionForMaxConcurrency())
1712 1 : fmt.Fprintf(&buf, " comparer=%s\n", o.Comparer.Name)
1713 1 : fmt.Fprintf(&buf, " disable_wal=%t\n", o.DisableWAL)
1714 1 : if o.Experimental.DisableIngestAsFlushable != nil && o.Experimental.DisableIngestAsFlushable() {
1715 1 : fmt.Fprintf(&buf, " disable_ingest_as_flushable=%t\n", true)
1716 1 : }
1717 1 : fmt.Fprintf(&buf, " flush_delay_delete_range=%s\n", o.FlushDelayDeleteRange)
1718 1 : fmt.Fprintf(&buf, " flush_delay_range_key=%s\n", o.FlushDelayRangeKey)
1719 1 : fmt.Fprintf(&buf, " flush_split_bytes=%d\n", o.FlushSplitBytes)
1720 1 : fmt.Fprintf(&buf, " format_major_version=%d\n", o.FormatMajorVersion)
1721 1 : fmt.Fprintf(&buf, " key_schema=%s\n", o.KeySchema)
1722 1 : fmt.Fprintf(&buf, " l0_compaction_concurrency=%d\n", o.Experimental.L0CompactionConcurrency)
1723 1 : fmt.Fprintf(&buf, " l0_compaction_file_threshold=%d\n", o.L0CompactionFileThreshold)
1724 1 : fmt.Fprintf(&buf, " l0_compaction_threshold=%d\n", o.L0CompactionThreshold)
1725 1 : fmt.Fprintf(&buf, " l0_stop_writes_threshold=%d\n", o.L0StopWritesThreshold)
1726 1 : fmt.Fprintf(&buf, " lbase_max_bytes=%d\n", o.LBaseMaxBytes)
1727 1 : if o.Experimental.LevelMultiplier != defaultLevelMultiplier {
1728 1 : fmt.Fprintf(&buf, " level_multiplier=%d\n", o.Experimental.LevelMultiplier)
1729 1 : }
1730 1 : lower, upper := o.CompactionConcurrencyRange()
1731 1 : fmt.Fprintf(&buf, " concurrent_compactions=%d\n", lower)
1732 1 : fmt.Fprintf(&buf, " max_concurrent_compactions=%d\n", upper)
1733 1 : fmt.Fprintf(&buf, " max_concurrent_downloads=%d\n", o.MaxConcurrentDownloads())
1734 1 : fmt.Fprintf(&buf, " max_manifest_file_size=%d\n", o.MaxManifestFileSize)
1735 1 : fmt.Fprintf(&buf, " max_open_files=%d\n", o.MaxOpenFiles)
1736 1 : fmt.Fprintf(&buf, " mem_table_size=%d\n", o.MemTableSize)
1737 1 : fmt.Fprintf(&buf, " mem_table_stop_writes_threshold=%d\n", o.MemTableStopWritesThreshold)
1738 1 : fmt.Fprintf(&buf, " min_deletion_rate=%d\n", o.TargetByteDeletionRate)
1739 1 : fmt.Fprintf(&buf, " free_space_threshold_bytes=%d\n", o.FreeSpaceThresholdBytes)
1740 1 : fmt.Fprintf(&buf, " free_space_timeframe=%s\n", o.FreeSpaceTimeframe.String())
1741 1 : fmt.Fprintf(&buf, " obsolete_bytes_max_ratio=%f\n", o.ObsoleteBytesMaxRatio)
1742 1 : fmt.Fprintf(&buf, " obsolete_bytes_timeframe=%s\n", o.ObsoleteBytesTimeframe.String())
1743 1 : fmt.Fprintf(&buf, " merger=%s\n", o.Merger.Name)
1744 1 : if o.Experimental.MultiLevelCompactionHeuristic != nil {
1745 1 : fmt.Fprintf(&buf, " multilevel_compaction_heuristic=%s\n", o.Experimental.MultiLevelCompactionHeuristic().String())
1746 1 : }
1747 1 : fmt.Fprintf(&buf, " read_compaction_rate=%d\n", o.Experimental.ReadCompactionRate)
1748 1 : fmt.Fprintf(&buf, " read_sampling_multiplier=%d\n", o.Experimental.ReadSamplingMultiplier)
1749 1 : fmt.Fprintf(&buf, " num_deletions_threshold=%d\n", o.Experimental.NumDeletionsThreshold)
1750 1 : fmt.Fprintf(&buf, " deletion_size_ratio_threshold=%f\n", o.Experimental.DeletionSizeRatioThreshold)
1751 1 : fmt.Fprintf(&buf, " tombstone_dense_compaction_threshold=%f\n", o.Experimental.TombstoneDenseCompactionThreshold)
1752 1 : // We no longer care about strict_wal_tail, but set it to true in case an
1753 1 : // older version reads the options.
1754 1 : fmt.Fprintf(&buf, " strict_wal_tail=%t\n", true)
1755 1 : fmt.Fprintf(&buf, " table_cache_shards=%d\n", o.Experimental.FileCacheShards)
1756 1 : fmt.Fprintf(&buf, " validate_on_ingest=%t\n", o.Experimental.ValidateOnIngest)
1757 1 : fmt.Fprintf(&buf, " wal_dir=%s\n", o.WALDir)
1758 1 : fmt.Fprintf(&buf, " wal_bytes_per_sync=%d\n", o.WALBytesPerSync)
1759 1 : fmt.Fprintf(&buf, " secondary_cache_size_bytes=%d\n", o.Experimental.SecondaryCacheSizeBytes)
1760 1 : fmt.Fprintf(&buf, " create_on_shared=%d\n", o.Experimental.CreateOnShared)
1761 1 :
1762 1 : // Private options.
1763 1 : //
1764 1 : // These options are only encoded if true, because we do not want them to
1765 1 : // appear in production serialized Options files, since they're testing-only
1766 1 : // options. They're only serialized when true, which still ensures that the
1767 1 : // metamorphic tests may propagate them to subprocesses.
1768 1 : if o.private.disableDeleteOnlyCompactions {
1769 1 : fmt.Fprintln(&buf, " disable_delete_only_compactions=true")
1770 1 : }
1771 1 : if o.private.disableElisionOnlyCompactions {
1772 1 : fmt.Fprintln(&buf, " disable_elision_only_compactions=true")
1773 1 : }
1774 1 : if o.private.disableLazyCombinedIteration {
1775 1 : fmt.Fprintln(&buf, " disable_lazy_combined_iteration=true")
1776 1 : }
1777 :
1778 1 : if o.Experimental.ValueSeparationPolicy != nil {
1779 1 : policy := o.Experimental.ValueSeparationPolicy()
1780 1 : if policy.Enabled {
1781 1 : fmt.Fprintln(&buf)
1782 1 : fmt.Fprintln(&buf, "[Value Separation]")
1783 1 : fmt.Fprintf(&buf, " enabled=%t\n", policy.Enabled)
1784 1 : fmt.Fprintf(&buf, " minimum_size=%d\n", policy.MinimumSize)
1785 1 : fmt.Fprintf(&buf, " max_blob_reference_depth=%d\n", policy.MaxBlobReferenceDepth)
1786 1 : fmt.Fprintf(&buf, " rewrite_minimum_age=%s\n", policy.RewriteMinimumAge)
1787 1 : fmt.Fprintf(&buf, " garbage_ratio_low_priority=%.2f\n", policy.GarbageRatioLowPriority)
1788 1 : fmt.Fprintf(&buf, " garbage_ratio_high_priority=%.2f\n", policy.GarbageRatioHighPriority)
1789 1 : }
1790 : }
1791 :
1792 1 : if o.WALFailover != nil {
1793 1 : unhealthyThreshold, _ := o.WALFailover.FailoverOptions.UnhealthyOperationLatencyThreshold()
1794 1 : fmt.Fprintf(&buf, "\n")
1795 1 : fmt.Fprintf(&buf, "[WAL Failover]\n")
1796 1 : fmt.Fprintf(&buf, " secondary_dir=%s\n", o.WALFailover.Secondary.Dirname)
1797 1 : fmt.Fprintf(&buf, " primary_dir_probe_interval=%s\n", o.WALFailover.FailoverOptions.PrimaryDirProbeInterval)
1798 1 : fmt.Fprintf(&buf, " healthy_probe_latency_threshold=%s\n", o.WALFailover.FailoverOptions.HealthyProbeLatencyThreshold)
1799 1 : fmt.Fprintf(&buf, " healthy_interval=%s\n", o.WALFailover.FailoverOptions.HealthyInterval)
1800 1 : fmt.Fprintf(&buf, " unhealthy_sampling_interval=%s\n", o.WALFailover.FailoverOptions.UnhealthySamplingInterval)
1801 1 : fmt.Fprintf(&buf, " unhealthy_operation_latency_threshold=%s\n", unhealthyThreshold)
1802 1 : fmt.Fprintf(&buf, " elevated_write_stall_threshold_lag=%s\n", o.WALFailover.FailoverOptions.ElevatedWriteStallThresholdLag)
1803 1 : }
1804 :
1805 1 : for i := range o.Levels {
1806 1 : l := &o.Levels[i]
1807 1 : fmt.Fprintf(&buf, "\n")
1808 1 : fmt.Fprintf(&buf, "[Level \"%d\"]\n", i)
1809 1 : fmt.Fprintf(&buf, " block_restart_interval=%d\n", l.BlockRestartInterval)
1810 1 : fmt.Fprintf(&buf, " block_size=%d\n", l.BlockSize)
1811 1 : fmt.Fprintf(&buf, " block_size_threshold=%d\n", l.BlockSizeThreshold)
1812 1 : fmt.Fprintf(&buf, " compression=%s\n", l.Compression().Name)
1813 1 : fmt.Fprintf(&buf, " filter_policy=%s\n", l.FilterPolicy.Name())
1814 1 : fmt.Fprintf(&buf, " filter_type=%s\n", l.FilterType)
1815 1 : fmt.Fprintf(&buf, " index_block_size=%d\n", l.IndexBlockSize)
1816 1 : fmt.Fprintf(&buf, " target_file_size=%d\n", o.TargetFileSizes[i])
1817 1 : }
1818 :
1819 1 : return buf.String()
1820 : }
1821 :
1822 : type parseOptionsFuncs struct {
1823 : visitNewSection func(i, j int, section string) error
1824 : visitKeyValue func(i, j int, section, key, value string) error
1825 : visitCommentOrWhitespace func(i, j int, whitespace string) error
1826 : }
1827 :
1828 : // parseOptions takes options serialized by Options.String() and parses them
1829 : // into keys and values. It calls fns.visitNewSection for the beginning of each
1830 : // new section, fns.visitKeyValue for each key-value pair, and
1831 : // visitCommentOrWhitespace for comments and whitespace between key-value pairs.
1832 1 : func parseOptions(s string, fns parseOptionsFuncs) error {
1833 1 : var section, mappedSection string
1834 1 : i := 0
1835 1 : for i < len(s) {
1836 1 : rem := s[i:]
1837 1 : j := strings.IndexByte(rem, '\n')
1838 1 : if j < 0 {
1839 0 : j = len(rem)
1840 1 : } else {
1841 1 : j += 1 // Include the newline.
1842 1 : }
1843 1 : line := strings.TrimSpace(s[i : i+j])
1844 1 : startOff, endOff := i, i+j
1845 1 : i += j
1846 1 :
1847 1 : if len(line) == 0 || line[0] == ';' || line[0] == '#' {
1848 1 : // Skip blank lines and comments.
1849 1 : if fns.visitCommentOrWhitespace != nil {
1850 1 : if err := fns.visitCommentOrWhitespace(startOff, endOff, line); err != nil {
1851 0 : return err
1852 0 : }
1853 : }
1854 1 : continue
1855 : }
1856 1 : n := len(line)
1857 1 : if line[0] == '[' && line[n-1] == ']' {
1858 1 : // Parse section.
1859 1 : section = line[1 : n-1]
1860 1 : // RocksDB uses a similar (INI-style) syntax for the OPTIONS file, but
1861 1 : // different section names and keys. The "CFOptions ..." paths are the
1862 1 : // RocksDB versions which we map to the Pebble paths.
1863 1 : mappedSection = section
1864 1 : if section == `CFOptions "default"` {
1865 0 : mappedSection = "Options"
1866 0 : }
1867 1 : if fns.visitNewSection != nil {
1868 1 : if err := fns.visitNewSection(startOff, endOff, mappedSection); err != nil {
1869 0 : return err
1870 0 : }
1871 : }
1872 1 : continue
1873 : }
1874 :
1875 1 : pos := strings.Index(line, "=")
1876 1 : if pos < 0 {
1877 0 : const maxLen = 50
1878 0 : if len(line) > maxLen {
1879 0 : line = line[:maxLen-3] + "..."
1880 0 : }
1881 0 : return base.CorruptionErrorf("invalid key=value syntax: %q", errors.Safe(line))
1882 : }
1883 :
1884 1 : key := strings.TrimSpace(line[:pos])
1885 1 : value := strings.TrimSpace(line[pos+1:])
1886 1 :
1887 1 : if section == `CFOptions "default"` {
1888 0 : switch key {
1889 0 : case "comparator":
1890 0 : key = "comparer"
1891 0 : case "merge_operator":
1892 0 : key = "merger"
1893 : }
1894 : }
1895 1 : if fns.visitKeyValue != nil {
1896 1 : if err := fns.visitKeyValue(startOff, endOff, mappedSection, key, value); err != nil {
1897 0 : return err
1898 0 : }
1899 : }
1900 : }
1901 1 : return nil
1902 : }
1903 :
1904 : // ParseHooks contains callbacks to create options fields which can have
1905 : // user-defined implementations.
1906 : type ParseHooks struct {
1907 : NewCleaner func(name string) (Cleaner, error)
1908 : NewComparer func(name string) (*Comparer, error)
1909 : NewFilterPolicy func(name string) (FilterPolicy, error)
1910 : NewKeySchema func(name string) (KeySchema, error)
1911 : NewMerger func(name string) (*Merger, error)
1912 : SkipUnknown func(name, value string) bool
1913 : }
1914 :
1915 : // Parse parses the options from the specified string. Note that certain
1916 : // options cannot be parsed into populated fields. For example, comparer and
1917 : // merger.
1918 1 : func (o *Options) Parse(s string, hooks *ParseHooks) error {
1919 1 : var valSepPolicy ValueSeparationPolicy
1920 1 : var concurrencyLimit struct {
1921 1 : lower int
1922 1 : lowerSet bool
1923 1 : upper int
1924 1 : upperSet bool
1925 1 : }
1926 1 :
1927 1 : visitKeyValue := func(i, j int, section, key, value string) error {
1928 1 : // WARNING: DO NOT remove entries from the switches below because doing so
1929 1 : // causes a key previously written to the OPTIONS file to be considered unknown,
1930 1 : // a backwards incompatible change. Instead, leave in support for parsing the
1931 1 : // key but simply don't parse the value.
1932 1 :
1933 1 : parseComparer := func(name string) (*Comparer, error) {
1934 1 : switch name {
1935 0 : case DefaultComparer.Name:
1936 0 : return DefaultComparer, nil
1937 1 : case testkeys.Comparer.Name:
1938 1 : return testkeys.Comparer, nil
1939 1 : default:
1940 1 : if hooks != nil && hooks.NewComparer != nil {
1941 1 : return hooks.NewComparer(name)
1942 1 : }
1943 0 : return nil, nil
1944 : }
1945 : }
1946 :
1947 1 : switch {
1948 1 : case section == "Version":
1949 1 : switch key {
1950 1 : case "pebble_version":
1951 0 : default:
1952 0 : if hooks != nil && hooks.SkipUnknown != nil && hooks.SkipUnknown(section+"."+key, value) {
1953 0 : return nil
1954 0 : }
1955 0 : return errors.Errorf("pebble: unknown option: %s.%s",
1956 0 : errors.Safe(section), errors.Safe(key))
1957 : }
1958 1 : return nil
1959 :
1960 1 : case section == "Options":
1961 1 : var err error
1962 1 : switch key {
1963 1 : case "bytes_per_sync":
1964 1 : o.BytesPerSync, err = strconv.Atoi(value)
1965 1 : case "cache_size":
1966 1 : o.CacheSize, err = strconv.ParseInt(value, 10, 64)
1967 1 : case "cleaner":
1968 1 : switch value {
1969 1 : case "archive":
1970 1 : o.Cleaner = ArchiveCleaner{}
1971 0 : case "delete":
1972 0 : o.Cleaner = DeleteCleaner{}
1973 0 : default:
1974 0 : if hooks != nil && hooks.NewCleaner != nil {
1975 0 : o.Cleaner, err = hooks.NewCleaner(value)
1976 0 : }
1977 : }
1978 1 : case "comparer":
1979 1 : var comparer *Comparer
1980 1 : comparer, err = parseComparer(value)
1981 1 : if comparer != nil {
1982 1 : o.Comparer = comparer
1983 1 : }
1984 1 : case "compaction_debt_concurrency":
1985 1 : o.Experimental.CompactionDebtConcurrency, err = strconv.ParseUint(value, 10, 64)
1986 1 : case "compaction_garbage_fraction_for_max_concurrency":
1987 1 : var frac float64
1988 1 : frac, err = strconv.ParseFloat(value, 64)
1989 1 : if err == nil {
1990 1 : o.Experimental.CompactionGarbageFractionForMaxConcurrency =
1991 1 : func() float64 { return frac }
1992 : }
1993 0 : case "delete_range_flush_delay":
1994 0 : // NB: This is a deprecated serialization of the
1995 0 : // `flush_delay_delete_range`.
1996 0 : o.FlushDelayDeleteRange, err = time.ParseDuration(value)
1997 1 : case "disable_delete_only_compactions":
1998 1 : o.private.disableDeleteOnlyCompactions, err = strconv.ParseBool(value)
1999 1 : case "disable_elision_only_compactions":
2000 1 : o.private.disableElisionOnlyCompactions, err = strconv.ParseBool(value)
2001 1 : case "disable_ingest_as_flushable":
2002 1 : var v bool
2003 1 : v, err = strconv.ParseBool(value)
2004 1 : if err == nil {
2005 1 : o.Experimental.DisableIngestAsFlushable = func() bool { return v }
2006 : }
2007 1 : case "disable_lazy_combined_iteration":
2008 1 : o.private.disableLazyCombinedIteration, err = strconv.ParseBool(value)
2009 1 : case "disable_wal":
2010 1 : o.DisableWAL, err = strconv.ParseBool(value)
2011 0 : case "enable_columnar_blocks":
2012 : // Do nothing; option existed in older versions of pebble.
2013 1 : case "flush_delay_delete_range":
2014 1 : o.FlushDelayDeleteRange, err = time.ParseDuration(value)
2015 1 : case "flush_delay_range_key":
2016 1 : o.FlushDelayRangeKey, err = time.ParseDuration(value)
2017 1 : case "flush_split_bytes":
2018 1 : o.FlushSplitBytes, err = strconv.ParseInt(value, 10, 64)
2019 1 : case "format_major_version":
2020 1 : // NB: The version written here may be stale. Open does
2021 1 : // not use the format major version encoded in the
2022 1 : // OPTIONS file other than to validate that the encoded
2023 1 : // version is valid right here.
2024 1 : var v uint64
2025 1 : v, err = strconv.ParseUint(value, 10, 64)
2026 1 : if vers := FormatMajorVersion(v); vers > internalFormatNewest || vers == FormatDefault {
2027 0 : err = errors.Newf("unsupported format major version %d", o.FormatMajorVersion)
2028 0 : }
2029 1 : if err == nil {
2030 1 : o.FormatMajorVersion = FormatMajorVersion(v)
2031 1 : }
2032 1 : case "key_schema":
2033 1 : o.KeySchema = value
2034 1 : if o.KeySchemas == nil {
2035 0 : o.KeySchemas = make(map[string]*KeySchema)
2036 0 : }
2037 1 : if _, ok := o.KeySchemas[o.KeySchema]; !ok {
2038 0 : if strings.HasPrefix(value, "DefaultKeySchema(") && strings.HasSuffix(value, ")") {
2039 0 : argsStr := strings.TrimSuffix(strings.TrimPrefix(value, "DefaultKeySchema("), ")")
2040 0 : args := strings.FieldsFunc(argsStr, func(r rune) bool {
2041 0 : return unicode.IsSpace(r) || r == ','
2042 0 : })
2043 0 : var comparer *base.Comparer
2044 0 : var bundleSize int
2045 0 : comparer, err = parseComparer(args[0])
2046 0 : if err == nil {
2047 0 : bundleSize, err = strconv.Atoi(args[1])
2048 0 : }
2049 0 : if err == nil {
2050 0 : schema := colblk.DefaultKeySchema(comparer, bundleSize)
2051 0 : o.KeySchema = schema.Name
2052 0 : o.KeySchemas[o.KeySchema] = &schema
2053 0 : }
2054 0 : } else if hooks != nil && hooks.NewKeySchema != nil {
2055 0 : var schema KeySchema
2056 0 : schema, err = hooks.NewKeySchema(value)
2057 0 : if err == nil {
2058 0 : o.KeySchemas[value] = &schema
2059 0 : }
2060 : }
2061 : }
2062 1 : case "l0_compaction_concurrency":
2063 1 : o.Experimental.L0CompactionConcurrency, err = strconv.Atoi(value)
2064 1 : case "l0_compaction_file_threshold":
2065 1 : o.L0CompactionFileThreshold, err = strconv.Atoi(value)
2066 1 : case "l0_compaction_threshold":
2067 1 : o.L0CompactionThreshold, err = strconv.Atoi(value)
2068 1 : case "l0_stop_writes_threshold":
2069 1 : o.L0StopWritesThreshold, err = strconv.Atoi(value)
2070 0 : case "l0_sublevel_compactions":
2071 : // Do nothing; option existed in older versions of pebble.
2072 1 : case "lbase_max_bytes":
2073 1 : o.LBaseMaxBytes, err = strconv.ParseInt(value, 10, 64)
2074 1 : case "level_multiplier":
2075 1 : o.Experimental.LevelMultiplier, err = strconv.Atoi(value)
2076 1 : case "concurrent_compactions":
2077 1 : concurrencyLimit.lowerSet = true
2078 1 : concurrencyLimit.lower, err = strconv.Atoi(value)
2079 1 : case "max_concurrent_compactions":
2080 1 : concurrencyLimit.upperSet = true
2081 1 : concurrencyLimit.upper, err = strconv.Atoi(value)
2082 1 : case "max_concurrent_downloads":
2083 1 : var concurrentDownloads int
2084 1 : concurrentDownloads, err = strconv.Atoi(value)
2085 1 : if concurrentDownloads <= 0 {
2086 0 : err = errors.New("max_concurrent_compactions cannot be <= 0")
2087 1 : } else {
2088 1 : o.MaxConcurrentDownloads = func() int { return concurrentDownloads }
2089 : }
2090 1 : case "max_manifest_file_size":
2091 1 : o.MaxManifestFileSize, err = strconv.ParseInt(value, 10, 64)
2092 1 : case "max_open_files":
2093 1 : o.MaxOpenFiles, err = strconv.Atoi(value)
2094 1 : case "mem_table_size":
2095 1 : o.MemTableSize, err = strconv.ParseUint(value, 10, 64)
2096 1 : case "mem_table_stop_writes_threshold":
2097 1 : o.MemTableStopWritesThreshold, err = strconv.Atoi(value)
2098 0 : case "min_compaction_rate":
2099 : // Do nothing; option existed in older versions of pebble, and
2100 : // may be meaningful again eventually.
2101 1 : case "min_deletion_rate":
2102 1 : o.TargetByteDeletionRate, err = strconv.Atoi(value)
2103 1 : case "free_space_threshold_bytes":
2104 1 : o.FreeSpaceThresholdBytes, err = strconv.ParseUint(value, 10, 64)
2105 1 : case "free_space_timeframe":
2106 1 : o.FreeSpaceTimeframe, err = time.ParseDuration(value)
2107 1 : case "obsolete_bytes_max_ratio":
2108 1 : o.ObsoleteBytesMaxRatio, err = strconv.ParseFloat(value, 64)
2109 1 : case "obsolete_bytes_timeframe":
2110 1 : o.ObsoleteBytesTimeframe, err = time.ParseDuration(value)
2111 0 : case "min_flush_rate":
2112 : // Do nothing; option existed in older versions of pebble, and
2113 : // may be meaningful again eventually.
2114 1 : case "multilevel_compaction_heuristic":
2115 1 : switch {
2116 1 : case value == "none":
2117 1 : o.Experimental.MultiLevelCompactionHeuristic = OptionNoMultiLevel
2118 1 : case strings.HasPrefix(value, "wamp"):
2119 1 : o.Experimental.MultiLevelCompactionHeuristic = OptionWriteAmpHeuristic
2120 1 : fields := strings.FieldsFunc(strings.TrimPrefix(value, "wamp"), func(r rune) bool {
2121 1 : return unicode.IsSpace(r) || r == ',' || r == '(' || r == ')'
2122 1 : })
2123 1 : if len(fields) != 2 {
2124 0 : err = errors.Newf("require 2 arguments")
2125 0 : }
2126 1 : var h WriteAmpHeuristic
2127 1 : if err == nil {
2128 1 : h.AddPropensity, err = strconv.ParseFloat(fields[0], 64)
2129 1 : }
2130 1 : if err == nil {
2131 1 : h.AllowL0, err = strconv.ParseBool(fields[1])
2132 1 : }
2133 :
2134 1 : if err == nil {
2135 1 : if h.AllowL0 || h.AddPropensity != 0 {
2136 1 : o.Experimental.MultiLevelCompactionHeuristic = func() MultiLevelHeuristic {
2137 1 : return &h
2138 1 : }
2139 : }
2140 0 : } else {
2141 0 : err = errors.Wrapf(err, "unexpected wamp heuristic arguments: %s", value)
2142 0 : }
2143 0 : default:
2144 0 : err = errors.Newf("unrecognized multilevel compaction heuristic: %s", value)
2145 : }
2146 0 : case "point_tombstone_weight":
2147 : // Do nothing; deprecated.
2148 1 : case "strict_wal_tail":
2149 1 : var strictWALTail bool
2150 1 : strictWALTail, err = strconv.ParseBool(value)
2151 1 : if err == nil && !strictWALTail {
2152 0 : err = errors.Newf("reading from versions with strict_wal_tail=false no longer supported")
2153 0 : }
2154 1 : case "merger":
2155 1 : switch value {
2156 0 : case "nullptr":
2157 0 : o.Merger = nil
2158 1 : case "pebble.concatenate":
2159 1 : o.Merger = DefaultMerger
2160 0 : default:
2161 0 : if hooks != nil && hooks.NewMerger != nil {
2162 0 : o.Merger, err = hooks.NewMerger(value)
2163 0 : }
2164 : }
2165 1 : case "read_compaction_rate":
2166 1 : o.Experimental.ReadCompactionRate, err = strconv.ParseInt(value, 10, 64)
2167 1 : case "read_sampling_multiplier":
2168 1 : o.Experimental.ReadSamplingMultiplier, err = strconv.ParseInt(value, 10, 64)
2169 1 : case "num_deletions_threshold":
2170 1 : o.Experimental.NumDeletionsThreshold, err = strconv.Atoi(value)
2171 1 : case "deletion_size_ratio_threshold":
2172 1 : val, parseErr := strconv.ParseFloat(value, 32)
2173 1 : o.Experimental.DeletionSizeRatioThreshold = float32(val)
2174 1 : err = parseErr
2175 1 : case "tombstone_dense_compaction_threshold":
2176 1 : o.Experimental.TombstoneDenseCompactionThreshold, err = strconv.ParseFloat(value, 64)
2177 1 : case "table_cache_shards":
2178 1 : o.Experimental.FileCacheShards, err = strconv.Atoi(value)
2179 0 : case "table_format":
2180 0 : switch value {
2181 0 : case "leveldb":
2182 0 : case "rocksdbv2":
2183 0 : default:
2184 0 : return errors.Errorf("pebble: unknown table format: %q", errors.Safe(value))
2185 : }
2186 0 : case "table_property_collectors":
2187 : // No longer implemented; ignore.
2188 1 : case "validate_on_ingest":
2189 1 : o.Experimental.ValidateOnIngest, err = strconv.ParseBool(value)
2190 1 : case "wal_dir":
2191 1 : o.WALDir = value
2192 1 : case "wal_bytes_per_sync":
2193 1 : o.WALBytesPerSync, err = strconv.Atoi(value)
2194 0 : case "max_writer_concurrency":
2195 : // No longer implemented; ignore.
2196 0 : case "force_writer_parallelism":
2197 : // No longer implemented; ignore.
2198 1 : case "secondary_cache_size_bytes":
2199 1 : o.Experimental.SecondaryCacheSizeBytes, err = strconv.ParseInt(value, 10, 64)
2200 1 : case "create_on_shared":
2201 1 : var createOnSharedInt int64
2202 1 : createOnSharedInt, err = strconv.ParseInt(value, 10, 64)
2203 1 : o.Experimental.CreateOnShared = remote.CreateOnSharedStrategy(createOnSharedInt)
2204 0 : default:
2205 0 : if hooks != nil && hooks.SkipUnknown != nil && hooks.SkipUnknown(section+"."+key, value) {
2206 0 : return nil
2207 0 : }
2208 0 : return errors.Errorf("pebble: unknown option: %s.%s",
2209 0 : errors.Safe(section), errors.Safe(key))
2210 : }
2211 1 : return err
2212 :
2213 1 : case section == "Value Separation":
2214 1 : var err error
2215 1 : switch key {
2216 1 : case "enabled":
2217 1 : valSepPolicy.Enabled, err = strconv.ParseBool(value)
2218 1 : case "minimum_size":
2219 1 : var minimumSize int
2220 1 : minimumSize, err = strconv.Atoi(value)
2221 1 : valSepPolicy.MinimumSize = minimumSize
2222 1 : case "max_blob_reference_depth":
2223 1 : valSepPolicy.MaxBlobReferenceDepth, err = strconv.Atoi(value)
2224 1 : case "rewrite_minimum_age":
2225 1 : valSepPolicy.RewriteMinimumAge, err = time.ParseDuration(value)
2226 1 : case "target_garbage_ratio", "garbage_ratio_low_priority":
2227 1 : // NB: "target_garbage_ratio" is a deprecated name for the same field.
2228 1 : valSepPolicy.GarbageRatioLowPriority, err = strconv.ParseFloat(value, 64)
2229 1 : case "garbage_ratio_high_priority":
2230 1 : valSepPolicy.GarbageRatioHighPriority, err = strconv.ParseFloat(value, 64)
2231 0 : default:
2232 0 : if hooks != nil && hooks.SkipUnknown != nil && hooks.SkipUnknown(section+"."+key, value) {
2233 0 : return nil
2234 0 : }
2235 0 : return errors.Errorf("pebble: unknown option: %s.%s", errors.Safe(section), errors.Safe(key))
2236 : }
2237 1 : return err
2238 :
2239 1 : case section == "WAL Failover":
2240 1 : if o.WALFailover == nil {
2241 1 : o.WALFailover = new(WALFailoverOptions)
2242 1 : }
2243 1 : var err error
2244 1 : switch key {
2245 1 : case "secondary_dir":
2246 1 : o.WALFailover.Secondary = wal.Dir{Dirname: value, FS: vfs.Default}
2247 1 : case "primary_dir_probe_interval":
2248 1 : o.WALFailover.PrimaryDirProbeInterval, err = time.ParseDuration(value)
2249 1 : case "healthy_probe_latency_threshold":
2250 1 : o.WALFailover.HealthyProbeLatencyThreshold, err = time.ParseDuration(value)
2251 1 : case "healthy_interval":
2252 1 : o.WALFailover.HealthyInterval, err = time.ParseDuration(value)
2253 1 : case "unhealthy_sampling_interval":
2254 1 : o.WALFailover.UnhealthySamplingInterval, err = time.ParseDuration(value)
2255 1 : case "unhealthy_operation_latency_threshold":
2256 1 : var threshold time.Duration
2257 1 : threshold, err = time.ParseDuration(value)
2258 1 : o.WALFailover.UnhealthyOperationLatencyThreshold = func() (time.Duration, bool) {
2259 1 : return threshold, true
2260 1 : }
2261 1 : case "elevated_write_stall_threshold_lag":
2262 1 : o.WALFailover.ElevatedWriteStallThresholdLag, err = time.ParseDuration(value)
2263 0 : default:
2264 0 : if hooks != nil && hooks.SkipUnknown != nil && hooks.SkipUnknown(section+"."+key, value) {
2265 0 : return nil
2266 0 : }
2267 0 : return errors.Errorf("pebble: unknown option: %s.%s",
2268 0 : errors.Safe(section), errors.Safe(key))
2269 : }
2270 1 : return err
2271 :
2272 1 : case strings.HasPrefix(section, "Level "):
2273 1 : m := regexp.MustCompile(`Level\s*"?(\d+)"?\s*$`).FindStringSubmatch(section)
2274 1 : if m == nil {
2275 0 : return errors.Errorf("pebble: unknown section: %q", errors.Safe(section))
2276 0 : }
2277 1 : index, _ := strconv.Atoi(m[1])
2278 1 :
2279 1 : l := &o.Levels[index]
2280 1 :
2281 1 : var err error
2282 1 : switch key {
2283 1 : case "block_restart_interval":
2284 1 : l.BlockRestartInterval, err = strconv.Atoi(value)
2285 1 : case "block_size":
2286 1 : l.BlockSize, err = strconv.Atoi(value)
2287 1 : case "block_size_threshold":
2288 1 : l.BlockSizeThreshold, err = strconv.Atoi(value)
2289 1 : case "compression":
2290 1 : profile := block.CompressionProfileByName(value)
2291 1 : if profile == nil {
2292 0 : return errors.Errorf("pebble: unknown compression: %q", errors.Safe(value))
2293 0 : }
2294 1 : l.Compression = func() *sstable.CompressionProfile { return profile }
2295 1 : case "filter_policy":
2296 1 : if hooks != nil && hooks.NewFilterPolicy != nil {
2297 1 : l.FilterPolicy, err = hooks.NewFilterPolicy(value)
2298 1 : } else {
2299 0 : l.FilterPolicy = NoFilterPolicy
2300 0 : }
2301 1 : case "filter_type":
2302 1 : switch value {
2303 1 : case "table":
2304 1 : l.FilterType = TableFilter
2305 0 : default:
2306 0 : return errors.Errorf("pebble: unknown filter type: %q", errors.Safe(value))
2307 : }
2308 1 : case "index_block_size":
2309 1 : l.IndexBlockSize, err = strconv.Atoi(value)
2310 1 : case "target_file_size":
2311 1 : o.TargetFileSizes[index], err = strconv.ParseInt(value, 10, 64)
2312 0 : default:
2313 0 : if hooks != nil && hooks.SkipUnknown != nil && hooks.SkipUnknown(section+"."+key, value) {
2314 0 : return nil
2315 0 : }
2316 0 : return errors.Errorf("pebble: unknown option: %s.%s", errors.Safe(section), errors.Safe(key))
2317 : }
2318 1 : return err
2319 : }
2320 1 : if hooks != nil && hooks.SkipUnknown != nil && hooks.SkipUnknown(section+"."+key, value) {
2321 1 : return nil
2322 1 : }
2323 0 : return errors.Errorf("pebble: unknown section %q or key %q", errors.Safe(section), errors.Safe(key))
2324 : }
2325 1 : err := parseOptions(s, parseOptionsFuncs{
2326 1 : visitKeyValue: visitKeyValue,
2327 1 : })
2328 1 : if err != nil {
2329 0 : return err
2330 0 : }
2331 1 : o.Experimental.ValueSeparationPolicy = func() ValueSeparationPolicy { return valSepPolicy }
2332 1 : if concurrencyLimit.lowerSet || concurrencyLimit.upperSet {
2333 1 : if !concurrencyLimit.lowerSet {
2334 0 : concurrencyLimit.lower = 1
2335 1 : } else if concurrencyLimit.lower < 1 {
2336 0 : return errors.New("baseline_concurrent_compactions cannot be <= 0")
2337 0 : }
2338 1 : if !concurrencyLimit.upperSet {
2339 0 : concurrencyLimit.upper = concurrencyLimit.lower
2340 1 : } else if concurrencyLimit.upper < concurrencyLimit.lower {
2341 0 : return errors.Newf("max_concurrent_compactions cannot be < %d", concurrencyLimit.lower)
2342 0 : }
2343 1 : o.CompactionConcurrencyRange = func() (int, int) {
2344 1 : return concurrencyLimit.lower, concurrencyLimit.upper
2345 1 : }
2346 : }
2347 1 : return nil
2348 : }
2349 :
2350 : // ErrMissingWALRecoveryDir is an error returned when a database is attempted to be
2351 : // opened without supplying a Options.WALRecoveryDir entry for a directory that
2352 : // may contain WALs required to recover a consistent database state.
2353 : type ErrMissingWALRecoveryDir struct {
2354 : Dir string
2355 : ExtraInfo string
2356 : }
2357 :
2358 : // Error implements error.
2359 0 : func (e ErrMissingWALRecoveryDir) Error() string {
2360 0 : return fmt.Sprintf("directory %q may contain relevant WALs but is not in WALRecoveryDirs%s", e.Dir, e.ExtraInfo)
2361 0 : }
2362 :
2363 : // CheckCompatibility verifies the options are compatible with the previous options
2364 : // serialized by Options.String(). For example, the Comparer and Merger must be
2365 : // the same, or data will not be able to be properly read from the DB.
2366 : //
2367 : // This function only looks at specific keys and does not error out if the
2368 : // options are newer and contain unknown keys.
2369 1 : func (o *Options) CheckCompatibility(storeDir string, previousOptions string) error {
2370 1 : previousWALDir := ""
2371 1 :
2372 1 : visitKeyValue := func(i, j int, section, key, value string) error {
2373 1 : switch section + "." + key {
2374 1 : case "Options.comparer":
2375 1 : if value != o.Comparer.Name {
2376 0 : return errors.Errorf("pebble: comparer name from file %q != comparer name from options %q",
2377 0 : errors.Safe(value), errors.Safe(o.Comparer.Name))
2378 0 : }
2379 1 : case "Options.merger":
2380 1 : // RocksDB allows the merge operator to be unspecified, in which case it
2381 1 : // shows up as "nullptr".
2382 1 : if value != "nullptr" && value != o.Merger.Name {
2383 0 : return errors.Errorf("pebble: merger name from file %q != merger name from options %q",
2384 0 : errors.Safe(value), errors.Safe(o.Merger.Name))
2385 0 : }
2386 1 : case "Options.wal_dir":
2387 1 : previousWALDir = value
2388 1 : case "WAL Failover.secondary_dir":
2389 1 : previousWALSecondaryDir := value
2390 1 : if err := o.checkWALDir(storeDir, previousWALSecondaryDir, "WALFailover.Secondary changed from previous options"); err != nil {
2391 0 : return err
2392 0 : }
2393 : }
2394 1 : return nil
2395 : }
2396 1 : if err := parseOptions(previousOptions, parseOptionsFuncs{visitKeyValue: visitKeyValue}); err != nil {
2397 0 : return err
2398 0 : }
2399 1 : if err := o.checkWALDir(storeDir, previousWALDir, "WALDir changed from previous options"); err != nil {
2400 0 : return err
2401 0 : }
2402 1 : return nil
2403 : }
2404 :
2405 : // checkWALDir verifies that walDir is among o.WALDir, o.WALFailover.Secondary,
2406 : // or o.WALRecoveryDirs. An empty "walDir" maps to the storeDir.
2407 1 : func (o *Options) checkWALDir(storeDir, walDir, errContext string) error {
2408 1 : walPath := resolveStorePath(storeDir, walDir)
2409 1 : if walDir == "" {
2410 1 : walPath = storeDir
2411 1 : }
2412 :
2413 1 : if o.WALDir == "" {
2414 1 : if walPath == storeDir {
2415 1 : return nil
2416 1 : }
2417 1 : } else {
2418 1 : if walPath == resolveStorePath(storeDir, o.WALDir) {
2419 1 : return nil
2420 1 : }
2421 : }
2422 :
2423 1 : if o.WALFailover != nil && walPath == resolveStorePath(storeDir, o.WALFailover.Secondary.Dirname) {
2424 1 : return nil
2425 1 : }
2426 :
2427 0 : for _, d := range o.WALRecoveryDirs {
2428 0 : // TODO(radu): should we also check that d.FS is the same as walDir's FS?
2429 0 : if walPath == resolveStorePath(storeDir, d.Dirname) {
2430 0 : return nil
2431 0 : }
2432 : }
2433 :
2434 0 : var buf bytes.Buffer
2435 0 : fmt.Fprintf(&buf, "\n %s\n", errContext)
2436 0 : fmt.Fprintf(&buf, " o.WALDir: %q\n", o.WALDir)
2437 0 : if o.WALFailover != nil {
2438 0 : fmt.Fprintf(&buf, " o.WALFailover.Secondary.Dirname: %q\n", o.WALFailover.Secondary.Dirname)
2439 0 : }
2440 0 : fmt.Fprintf(&buf, " o.WALRecoveryDirs: %d", len(o.WALRecoveryDirs))
2441 0 : for _, d := range o.WALRecoveryDirs {
2442 0 : fmt.Fprintf(&buf, "\n %q", d.Dirname)
2443 0 : }
2444 0 : return ErrMissingWALRecoveryDir{Dir: walPath, ExtraInfo: buf.String()}
2445 : }
2446 :
2447 : // Validate verifies that the options are mutually consistent. For example,
2448 : // L0StopWritesThreshold must be >= L0CompactionThreshold, otherwise a write
2449 : // stall would persist indefinitely.
2450 1 : func (o *Options) Validate() error {
2451 1 : // Note that we can presume Options.EnsureDefaults has been called, so there
2452 1 : // is no need to check for zero values.
2453 1 :
2454 1 : var buf strings.Builder
2455 1 : if o.Experimental.L0CompactionConcurrency < 1 {
2456 0 : fmt.Fprintf(&buf, "L0CompactionConcurrency (%d) must be >= 1\n",
2457 0 : o.Experimental.L0CompactionConcurrency)
2458 0 : }
2459 1 : if o.L0StopWritesThreshold < o.L0CompactionThreshold {
2460 0 : fmt.Fprintf(&buf, "L0StopWritesThreshold (%d) must be >= L0CompactionThreshold (%d)\n",
2461 0 : o.L0StopWritesThreshold, o.L0CompactionThreshold)
2462 0 : }
2463 1 : if uint64(o.MemTableSize) >= maxMemTableSize {
2464 0 : fmt.Fprintf(&buf, "MemTableSize (%s) must be < %s\n",
2465 0 : humanize.Bytes.Uint64(uint64(o.MemTableSize)), humanize.Bytes.Uint64(maxMemTableSize))
2466 0 : }
2467 1 : if o.MemTableStopWritesThreshold < 2 {
2468 0 : fmt.Fprintf(&buf, "MemTableStopWritesThreshold (%d) must be >= 2\n",
2469 0 : o.MemTableStopWritesThreshold)
2470 0 : }
2471 1 : if o.FormatMajorVersion < FormatMinSupported || o.FormatMajorVersion > internalFormatNewest {
2472 0 : fmt.Fprintf(&buf, "FormatMajorVersion (%d) must be between %d and %d\n",
2473 0 : o.FormatMajorVersion, FormatMinSupported, internalFormatNewest)
2474 0 : }
2475 1 : if o.Experimental.CreateOnShared != remote.CreateOnSharedNone && o.FormatMajorVersion < FormatMinForSharedObjects {
2476 0 : fmt.Fprintf(&buf, "FormatMajorVersion (%d) when CreateOnShared is set must be at least %d\n",
2477 0 : o.FormatMajorVersion, FormatMinForSharedObjects)
2478 0 : }
2479 1 : if len(o.KeySchemas) > 0 {
2480 1 : if o.KeySchema == "" {
2481 0 : fmt.Fprintf(&buf, "KeySchemas is set but KeySchema is not\n")
2482 0 : }
2483 1 : if _, ok := o.KeySchemas[o.KeySchema]; !ok {
2484 0 : fmt.Fprintf(&buf, "KeySchema %q not found in KeySchemas\n", o.KeySchema)
2485 0 : }
2486 : }
2487 1 : if policy := o.Experimental.ValueSeparationPolicy(); policy.Enabled {
2488 1 : if policy.MinimumSize <= 0 {
2489 0 : fmt.Fprintf(&buf, "ValueSeparationPolicy.MinimumSize (%d) must be > 0\n", policy.MinimumSize)
2490 0 : }
2491 1 : if policy.MaxBlobReferenceDepth <= 0 {
2492 0 : fmt.Fprintf(&buf, "ValueSeparationPolicy.MaxBlobReferenceDepth (%d) must be > 0\n", policy.MaxBlobReferenceDepth)
2493 0 : }
2494 1 : if policy.GarbageRatioHighPriority < policy.GarbageRatioLowPriority {
2495 0 : fmt.Fprintf(&buf, "ValueSeparationPolicy.GarbageRatioHighPriority (%f) must be >= ValueSeparationPolicy.GarbageRatioLowPriority (%f)\n",
2496 0 : policy.GarbageRatioHighPriority, policy.GarbageRatioLowPriority)
2497 0 : }
2498 : }
2499 :
2500 1 : if buf.Len() == 0 {
2501 1 : return nil
2502 1 : }
2503 0 : return errors.New(buf.String())
2504 : }
2505 :
2506 : // MakeReaderOptions constructs sstable.ReaderOptions from the corresponding
2507 : // options in the receiver.
2508 1 : func (o *Options) MakeReaderOptions() sstable.ReaderOptions {
2509 1 : var readerOpts sstable.ReaderOptions
2510 1 : if o != nil {
2511 1 : readerOpts.Comparer = o.Comparer
2512 1 : readerOpts.Filters = o.Filters
2513 1 : readerOpts.KeySchemas = o.KeySchemas
2514 1 : readerOpts.LoadBlockSema = o.LoadBlockSema
2515 1 : readerOpts.LoggerAndTracer = o.LoggerAndTracer
2516 1 : readerOpts.Merger = o.Merger
2517 1 : }
2518 1 : return readerOpts
2519 : }
2520 :
2521 : // MakeWriterOptions constructs sstable.WriterOptions for the specified level
2522 : // from the corresponding options in the receiver.
2523 1 : func (o *Options) MakeWriterOptions(level int, format sstable.TableFormat) sstable.WriterOptions {
2524 1 : var writerOpts sstable.WriterOptions
2525 1 : writerOpts.TableFormat = format
2526 1 : if o != nil {
2527 1 : writerOpts.Comparer = o.Comparer
2528 1 : if o.Merger != nil {
2529 1 : writerOpts.MergerName = o.Merger.Name
2530 1 : }
2531 1 : writerOpts.BlockPropertyCollectors = o.BlockPropertyCollectors
2532 : }
2533 1 : if format >= sstable.TableFormatPebblev3 {
2534 1 : writerOpts.ShortAttributeExtractor = o.Experimental.ShortAttributeExtractor
2535 1 : if format >= sstable.TableFormatPebblev4 && level == numLevels-1 {
2536 1 : writerOpts.WritingToLowestLevel = true
2537 1 : }
2538 : }
2539 1 : levelOpts := o.Levels[level]
2540 1 : writerOpts.BlockRestartInterval = levelOpts.BlockRestartInterval
2541 1 : writerOpts.BlockSize = levelOpts.BlockSize
2542 1 : writerOpts.BlockSizeThreshold = levelOpts.BlockSizeThreshold
2543 1 : writerOpts.Compression = levelOpts.Compression()
2544 1 : writerOpts.FilterPolicy = levelOpts.FilterPolicy
2545 1 : writerOpts.FilterType = levelOpts.FilterType
2546 1 : writerOpts.IndexBlockSize = levelOpts.IndexBlockSize
2547 1 : if o.KeySchema != "" {
2548 1 : var ok bool
2549 1 : writerOpts.KeySchema, ok = o.KeySchemas[o.KeySchema]
2550 1 : if !ok {
2551 0 : panic(fmt.Sprintf("invalid schema %q", redact.Safe(o.KeySchema)))
2552 : }
2553 : }
2554 1 : writerOpts.AllocatorSizeClasses = o.AllocatorSizeClasses
2555 1 : writerOpts.NumDeletionsThreshold = o.Experimental.NumDeletionsThreshold
2556 1 : writerOpts.DeletionSizeRatioThreshold = o.Experimental.DeletionSizeRatioThreshold
2557 1 : return writerOpts
2558 : }
2559 :
2560 : // MakeBlobWriterOptions constructs blob.FileWriterOptions from the corresponding
2561 : // options in the receiver.
2562 1 : func (o *Options) MakeBlobWriterOptions(level int, format blob.FileFormat) blob.FileWriterOptions {
2563 1 : lo := o.Levels[level]
2564 1 : return blob.FileWriterOptions{
2565 1 : Format: format,
2566 1 : Compression: lo.Compression(),
2567 1 : ChecksumType: block.ChecksumTypeCRC32c,
2568 1 : FlushGovernor: block.MakeFlushGovernor(
2569 1 : lo.BlockSize,
2570 1 : lo.BlockSizeThreshold,
2571 1 : base.SizeClassAwareBlockSizeThreshold,
2572 1 : o.AllocatorSizeClasses,
2573 1 : ),
2574 1 : }
2575 1 : }
2576 :
2577 1 : func (o *Options) MakeObjStorageProviderSettings(dirname string) objstorageprovider.Settings {
2578 1 : s := objstorageprovider.Settings{
2579 1 : Logger: o.Logger,
2580 1 : FS: o.FS,
2581 1 : FSDirName: dirname,
2582 1 : FSCleaner: o.Cleaner,
2583 1 : NoSyncOnClose: o.NoSyncOnClose,
2584 1 : BytesPerSync: o.BytesPerSync,
2585 1 : }
2586 1 : s.Local.ReadaheadConfig = o.Local.ReadaheadConfig
2587 1 : s.Remote.StorageFactory = o.Experimental.RemoteStorage
2588 1 : s.Remote.CreateOnShared = o.Experimental.CreateOnShared
2589 1 : s.Remote.CreateOnSharedLocator = o.Experimental.CreateOnSharedLocator
2590 1 : s.Remote.CacheSizeBytes = o.Experimental.SecondaryCacheSizeBytes
2591 1 : return s
2592 1 : }
2593 :
2594 : // UserKeyCategories describes a partitioning of the user key space. Each
2595 : // partition is a category with a name. The categories are used for informative
2596 : // purposes only (like pprof labels). Pebble does not treat keys differently
2597 : // based on the UserKeyCategories.
2598 : //
2599 : // The partitions are defined by their upper bounds. The last partition is
2600 : // assumed to go until the end of keyspace; its UpperBound is ignored. The rest
2601 : // of the partitions are ordered by their UpperBound.
2602 : type UserKeyCategories struct {
2603 : categories []UserKeyCategory
2604 : cmp base.Compare
2605 : // rangeNames[i][j] contains the string referring to the categories in the
2606 : // range [i, j], with j > i.
2607 : rangeNames [][]string
2608 : }
2609 :
2610 : // UserKeyCategory describes a partition of the user key space.
2611 : //
2612 : // User keys >= the previous category's UpperBound and < this category's
2613 : // UpperBound are part of this category.
2614 : type UserKeyCategory struct {
2615 : Name string
2616 : // UpperBound is the exclusive upper bound of the category. All user keys >= the
2617 : // previous category's UpperBound and < this UpperBound are part of this
2618 : // category.
2619 : UpperBound []byte
2620 : }
2621 :
2622 : // MakeUserKeyCategories creates a UserKeyCategories object with the given
2623 : // categories. The object is immutable and can be reused across different
2624 : // stores.
2625 0 : func MakeUserKeyCategories(cmp base.Compare, categories ...UserKeyCategory) UserKeyCategories {
2626 0 : n := len(categories)
2627 0 : if n == 0 {
2628 0 : return UserKeyCategories{}
2629 0 : }
2630 0 : if categories[n-1].UpperBound != nil {
2631 0 : panic("last category UpperBound must be nil")
2632 : }
2633 : // Verify that the partitions are ordered as expected.
2634 0 : for i := 1; i < n-1; i++ {
2635 0 : if cmp(categories[i-1].UpperBound, categories[i].UpperBound) >= 0 {
2636 0 : panic("invalid UserKeyCategories: key prefixes must be sorted")
2637 : }
2638 : }
2639 :
2640 : // Precalculate a table of range names to avoid allocations in the
2641 : // categorization path.
2642 0 : rangeNamesBuf := make([]string, n*n)
2643 0 : rangeNames := make([][]string, n)
2644 0 : for i := range rangeNames {
2645 0 : rangeNames[i] = rangeNamesBuf[:n]
2646 0 : rangeNamesBuf = rangeNamesBuf[n:]
2647 0 : for j := i + 1; j < n; j++ {
2648 0 : rangeNames[i][j] = categories[i].Name + "-" + categories[j].Name
2649 0 : }
2650 : }
2651 0 : return UserKeyCategories{
2652 0 : categories: categories,
2653 0 : cmp: cmp,
2654 0 : rangeNames: rangeNames,
2655 0 : }
2656 : }
2657 :
2658 : // Len returns the number of categories defined.
2659 1 : func (kc *UserKeyCategories) Len() int {
2660 1 : return len(kc.categories)
2661 1 : }
2662 :
2663 : // CategorizeKey returns the name of the category containing the key.
2664 0 : func (kc *UserKeyCategories) CategorizeKey(userKey []byte) string {
2665 0 : idx := sort.Search(len(kc.categories)-1, func(i int) bool {
2666 0 : return kc.cmp(userKey, kc.categories[i].UpperBound) < 0
2667 0 : })
2668 0 : return kc.categories[idx].Name
2669 : }
2670 :
2671 : // CategorizeKeyRange returns the name of the category containing the key range.
2672 : // If the key range spans multiple categories, the result shows the first and
2673 : // last category separated by a dash, e.g. `cat1-cat5`.
2674 0 : func (kc *UserKeyCategories) CategorizeKeyRange(startUserKey, endUserKey []byte) string {
2675 0 : n := len(kc.categories)
2676 0 : p := sort.Search(n-1, func(i int) bool {
2677 0 : return kc.cmp(startUserKey, kc.categories[i].UpperBound) < 0
2678 0 : })
2679 0 : if p == n-1 || kc.cmp(endUserKey, kc.categories[p].UpperBound) < 0 {
2680 0 : // Fast path for a single category.
2681 0 : return kc.categories[p].Name
2682 0 : }
2683 : // Binary search among the remaining categories.
2684 0 : q := p + 1 + sort.Search(n-2-p, func(i int) bool {
2685 0 : return kc.cmp(endUserKey, kc.categories[p+1+i].UpperBound) < 0
2686 0 : })
2687 0 : return kc.rangeNames[p][q]
2688 : }
2689 :
2690 : const storePathIdentifier = "{store_path}"
2691 :
2692 : // MakeStoreRelativePath takes a path that is relative to the store directory
2693 : // and creates a path that can be used for Options.WALDir and wal.Dir.Dirname.
2694 : //
2695 : // This is used in metamorphic tests, so that the test run directory can be
2696 : // copied or moved.
2697 0 : func MakeStoreRelativePath(fs vfs.FS, relativePath string) string {
2698 0 : if relativePath == "" {
2699 0 : return storePathIdentifier
2700 0 : }
2701 0 : return fs.PathJoin(storePathIdentifier, relativePath)
2702 : }
2703 :
2704 : // resolveStorePath is the inverse of MakeStoreRelativePath(). It replaces any
2705 : // storePathIdentifier prefix with the store dir.
2706 1 : func resolveStorePath(storeDir, path string) string {
2707 1 : if remainder, ok := strings.CutPrefix(path, storePathIdentifier); ok {
2708 1 : return storeDir + remainder
2709 1 : }
2710 1 : return path
2711 : }
|
