10225501448 李度 10225101546 陈胤遒 10215501422 高宇菲
You can not select more than 25 topics Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.

187 lines
6.4 KiB

  1. // Copyright (c) 2011 The LevelDB Authors. All rights reserved.
  2. // Use of this source code is governed by a BSD-style license that can be
  3. // found in the LICENSE file. See the AUTHORS file for names of contributors.
  4. #ifndef STORAGE_LEVELDB_INCLUDE_OPTIONS_H_
  5. #define STORAGE_LEVELDB_INCLUDE_OPTIONS_H_
  6. #include <stddef.h>
  7. namespace leveldb {
  8. class Cache;
  9. class Comparator;
  10. class Env;
  11. class Logger;
  12. class Snapshot;
  13. // DB contents are stored in a set of blocks, each of which holds a
  14. // sequence of key,value pairs. Each block may be compressed before
  15. // being stored in a file. The following enum describes which
  16. // compression method (if any) is used to compress a block.
  17. enum CompressionType {
  18. // NOTE: do not change the values of existing entries, as these are
  19. // part of the persistent format on disk.
  20. kNoCompression = 0x0,
  21. kSnappyCompression = 0x1
  22. };
  23. // Options to control the behavior of a database (passed to DB::Open)
  24. struct Options {
  25. // -------------------
  26. // Parameters that affect behavior
  27. // Comparator used to define the order of keys in the table.
  28. // Default: a comparator that uses lexicographic byte-wise ordering
  29. //
  30. // REQUIRES: The client must ensure that the comparator supplied
  31. // here has the same name and orders keys *exactly* the same as the
  32. // comparator provided to previous open calls on the same DB.
  33. const Comparator* comparator;
  34. // If true, the database will be created if it is missing.
  35. // Default: false
  36. bool create_if_missing;
  37. // If true, an error is raised if the database already exists.
  38. // Default: false
  39. bool error_if_exists;
  40. // If true, the implementation will do aggressive checking of the
  41. // data it is processing and will stop early if it detects any
  42. // errors. This may have unforeseen ramifications: for example, a
  43. // corruption of one DB entry may cause a large number of entries to
  44. // become unreadable or for the entire DB to become unopenable.
  45. // Default: false
  46. bool paranoid_checks;
  47. // Use the specified object to interact with the environment,
  48. // e.g. to read/write files, schedule background work, etc.
  49. // Default: Env::Default()
  50. Env* env;
  51. // Any internal progress/error information generated by the db will
  52. // be written to info_log if it is non-NULL, or to a file stored
  53. // in the same directory as the DB contents if info_log is NULL.
  54. // Default: NULL
  55. Logger* info_log;
  56. // -------------------
  57. // Parameters that affect performance
  58. // Amount of data to build up in memory (backed by an unsorted log
  59. // on disk) before converting to a sorted on-disk file.
  60. //
  61. // Larger values increase performance, especially during bulk loads.
  62. // Up to two write buffers may be held in memory at the same time,
  63. // so you may wish to adjust this parameter to control memory usage.
  64. // Also, a larger write buffer will result in a longer recovery time
  65. // the next time the database is opened.
  66. //
  67. // Default: 4MB
  68. size_t write_buffer_size;
  69. // Number of open files that can be used by the DB. You may need to
  70. // increase this if your database has a large working set (budget
  71. // one open file per 2MB of working set).
  72. //
  73. // Default: 1000
  74. int max_open_files;
  75. // Control over blocks (user data is stored in a set of blocks, and
  76. // a block is the unit of reading from disk).
  77. // If non-NULL, use the specified cache for blocks.
  78. // If NULL, leveldb will automatically create and use an 8MB internal cache.
  79. // Default: NULL
  80. Cache* block_cache;
  81. // Approximate size of user data packed per block. Note that the
  82. // block size specified here corresponds to uncompressed data. The
  83. // actual size of the unit read from disk may be smaller if
  84. // compression is enabled. This parameter can be changed dynamically.
  85. //
  86. // Default: 4K
  87. size_t block_size;
  88. // Number of keys between restart points for delta encoding of keys.
  89. // This parameter can be changed dynamically. Most clients should
  90. // leave this parameter alone.
  91. //
  92. // Default: 16
  93. int block_restart_interval;
  94. // Compress blocks using the specified compression algorithm. This
  95. // parameter can be changed dynamically.
  96. //
  97. // Default: kSnappyCompression, which gives lightweight but fast
  98. // compression.
  99. //
  100. // Typical speeds of kSnappyCompression on an Intel(R) Core(TM)2 2.4GHz:
  101. // ~200-500MB/s compression
  102. // ~400-800MB/s decompression
  103. // Note that these speeds are significantly faster than most
  104. // persistent storage speeds, and therefore it is typically never
  105. // worth switching to kNoCompression. Even if the input data is
  106. // incompressible, the kSnappyCompression implementation will
  107. // efficiently detect that and will switch to uncompressed mode.
  108. CompressionType compression;
  109. // Create an Options object with default values for all fields.
  110. Options();
  111. };
  112. // Options that control read operations
  113. struct ReadOptions {
  114. // If true, all data read from underlying storage will be
  115. // verified against corresponding checksums.
  116. // Default: false
  117. bool verify_checksums;
  118. // Should the data read for this iteration be cached in memory?
  119. // Callers may wish to set this field to false for bulk scans.
  120. // Default: true
  121. bool fill_cache;
  122. // If "snapshot" is non-NULL, read as of the supplied snapshot
  123. // (which must belong to the DB that is being read and which must
  124. // not have been released). If "snapshot" is NULL, use an impliicit
  125. // snapshot of the state at the beginning of this read operation.
  126. // Default: NULL
  127. const Snapshot* snapshot;
  128. ReadOptions()
  129. : verify_checksums(false),
  130. fill_cache(true),
  131. snapshot(NULL) {
  132. }
  133. };
  134. // Options that control write operations
  135. struct WriteOptions {
  136. // If true, the write will be flushed from the operating system
  137. // buffer cache (by calling WritableFile::Sync()) before the write
  138. // is considered complete. If this flag is true, writes will be
  139. // slower.
  140. //
  141. // If this flag is false, and the machine crashes, some recent
  142. // writes may be lost. Note that if it is just the process that
  143. // crashes (i.e., the machine does not reboot), no writes will be
  144. // lost even if sync==false.
  145. //
  146. // In other words, a DB write with sync==false has similar
  147. // crash semantics as the "write()" system call. A DB write
  148. // with sync==true has similar crash semantics to a "write()"
  149. // system call followed by "fsync()".
  150. //
  151. // Default: false
  152. bool sync;
  153. WriteOptions()
  154. : sync(false) {
  155. }
  156. };
  157. } // namespace leveldb
  158. #endif // STORAGE_LEVELDB_INCLUDE_OPTIONS_H_