| /rocksdb-6.9/table/block_based/ |
| D | block_based_table_reader_impl.h | 54 CachableEntry<Block> block; in NewDataBlockIterator() local
60 assert(block.IsEmpty()); in NewDataBlockIterator()
65 assert(block.GetValue() != nullptr); in NewDataBlockIterator()
75 block.IsCached() || in NewDataBlockIterator()
80 if (!block.IsCached()) { in NewDataBlockIterator()
113 iter->SetCacheHandle(block.GetCacheHandle()); in NewDataBlockIterator()
116 block.TransferTo(iter); in NewDataBlockIterator()
138 assert(block.GetValue() != nullptr); in NewDataBlockIterator()
147 block.IsCached() || in NewDataBlockIterator()
152 if (!block.IsCached()) { in NewDataBlockIterator()
[all …]
|
| D | block_based_filter_block_test.cc | 62 CachableEntry<BlockContents> block( in TEST_F() local
66 BlockBasedFilterBlockReader reader(table_.get(), std::move(block)); in TEST_F()
91 CachableEntry<BlockContents> block( in TEST_F() local
95 BlockBasedFilterBlockReader reader(table_.get(), std::move(block)); in TEST_F()
153 CachableEntry<BlockContents> block( in TEST_F() local
157 BlockBasedFilterBlockReader reader(table_.get(), std::move(block)); in TEST_F()
252 CachableEntry<BlockContents> block( in TEST_F() local
257 new BlockBasedFilterBlockReader(table_.get(), std::move(block)); in TEST_F()
284 CachableEntry<BlockContents> block( in TEST_F() local
289 new BlockBasedFilterBlockReader(table_.get(), std::move(block)); in TEST_F()
[all …]
|
| D | full_filter_block_test.cc | 117 CachableEntry<ParsedFullFilterBlock> block( in TEST_F() local
122 FullFilterBlockReader reader(table_.get(), std::move(block)); in TEST_F()
140 CachableEntry<ParsedFullFilterBlock> block( in TEST_F() local
145 FullFilterBlockReader reader(table_.get(), std::move(block)); in TEST_F()
193 CachableEntry<ParsedFullFilterBlock> block( in TEST_F() local
198 FullFilterBlockReader reader(table_.get(), std::move(block)); in TEST_F()
287 CachableEntry<ParsedFullFilterBlock> block( in TEST_F() local
292 FullFilterBlockReader reader(table_.get(), std::move(block)); in TEST_F()
|
| D | partitioned_index_reader.cc | 159 CachableEntry<Block> block; in CacheDependencies() local
164 &block, BlockType::kIndex, /*get_context=*/nullptr, &lookup_context, in CacheDependencies()
167 assert(s.ok() || block.GetValue() == nullptr); in CacheDependencies()
168 if (s.ok() && block.GetValue() != nullptr) { in CacheDependencies()
169 if (block.IsCached()) { in CacheDependencies()
171 partition_map_[handle.offset()] = std::move(block); in CacheDependencies()
|
| D | block.cc.d | 1 table/block_based/block.cc.d table/block_based/block.o: \
2 table/block_based/block.cc table/block_based/block.h db/dbformat.h \
|
| D | partitioned_filter_block.cc | 349 CachableEntry<ParsedFullFilterBlock> block; in CacheDependencies() local
354 UncompressionDict::GetEmptyDict(), &block, BlockType::kFilter, in CacheDependencies()
357 assert(s.ok() || block.GetValue() == nullptr); in CacheDependencies()
358 if (s.ok() && block.GetValue() != nullptr) { in CacheDependencies()
359 if (block.IsCached()) { in CacheDependencies()
361 filter_map_[handle.offset()] = std::move(block); in CacheDependencies()
|
| /rocksdb-6.9/tools/block_cache_analyzer/ |
| D | block_cache_trace_analyzer.cc | 802 if (block.num_keys == 0) { in WriteGetSpatialLocality()
819 percent(block.key_num_access_map.size(), block.num_keys), 0.0)); in WriteGetSpatialLocality()
824 std::max(percent(block.referenced_data_size, block.block_size), 0.0)); in WriteGetSpatialLocality()
1088 if (block.num_accesses > 1) { in WriteReuseInterval()
1089 avg_reuse_interval = ((block.last_access_time - block.first_access_time) / in WriteReuseInterval()
1125 block.num_accesses; in WriteReuseInterval()
1150 if (block.num_accesses > 1) { in WriteReuseLifetime()
1152 (block.last_access_time - block.first_access_time) / kMicrosInSecond; in WriteReuseLifetime()
1223 if (block.second[start_time] && block.second[i]) { in WriteBlockReuseTimeline()
1806 if (block.num_keys == 0) { in PrintDataBlockAccessStats()
[all …]
|
| /rocksdb-6.9/docs/_posts/ |
| D | 2017-05-12-partitioned-index-filter.markdown | 8 … only a subset of them in block cache, their relatively large size negatively affects the performa…
12 …block per SST file. The size of the index/filter varies based on the configuration but for a SST o…
16 …block cache they are effectively competing with data blocks (as well as with each other) on this s…
18 … IO cost. While a simple point lookup might need at most a couple of data block reads (of size 4KB…
22 …block cache the partitions that are required to perform the index/filter query. The top-level inde…
28 …00TB of data by using direct IO (skipping OS file cache) and a very small block cache of size 60MB…
32 …ile cache) and block cache of size 6G and 2G. Without partitioning the linkbench throughput drops …
|
| D | 2014-09-12-new-bloom-filter-format.markdown | 12 In this post, we are introducing "full filter block" --- a new bloom filter format for [block based…
21 …a key, we first goes to the bloom filter block of SST file. If key may exist in filter, we goes in…
25 …ata block in SST file. It has complex structure (ref [here](https://github.com/facebook/rocksdb/wi…
27 Here's the work flow for checking original bloom filter in block based table:
29 1. Given the target key, we goes to the index block to get the "data block ID" where this key may r…
30 1. Using the "data block ID", we goes to the filter block and get the correct "offset of filter".
41 (1) Given the target key, we goes directly to the filter block and conduct the filter checking.
43 … be specific, there would be no checking for index block and no address jumping inside of filter b…
|
| D | 2018-08-23-data-block-hash-index.markdown | 7 We've designed and implemented a _data block hash index_ in RocksDB that has the benefit of both re…
23 // The index type that will be used for the data block.
25 kDataBlockBinarySearch = 0, // traditional block type
45 
47 We implemented a hash map at the end of the block to index the key to reduce the CPU overhead of th…
49 
58 
82 …block essentially takes up the data block cache space, making the effective data block cache size …
89 Data block hash index only supports point lookup. We do not support range lookup. Range lookup requ…
112 
[all …]
|
| D | 2019-03-08-format-version-4.markdown | 12 …block size, in some cases around 4-5x. This frees more space in block cache, which would result in…
24 …is_user_key` in TableProperties, which is used by the reader to know how to decode the index block.
27 …block handles. This saves the encoding of `BlockHandle::offset` of the non-head index entries in e…
|
| D | 2014-09-15-rocksdb-3-5-release.markdown | 19 …2. new ReadOptions.total_order_seek to force total order seek when block-based table is built with…
35 …zeForPointLookup() takes one parameter for block cache size. It now builds hash index, bloom filte…
|
| /rocksdb-6.9/docs/_sass/ |
| D | _slideshow.scss | 8 display: block;
13 display: block;
18 display: block;
23 display: block;
34 display: inline-block;
|
| D | _header.scss | 31 display: block;
54 display: block;
92 display: inline-block;
98 display: inline-block;
115 display: inline-block;
|
| D | _react_docs_nav.scss | 144 display: inline-block;
166 display: block;
194 display: inline-block;
225 display: block;
273 display: block;
298 display: block;
|
| D | _promo.scss | 14 display: block;
44 display: inline-block;
50 display: block;
|
| D | _base.scss | 18 display:block;
129 display: block;
135 display: block;
300 display: inline-block;
312 display: block;
445 display: block;
|
| /rocksdb-6.9/memory/ |
| D | arena.cc | 72 for (const auto& block : blocks_) { in ~Arena() local
73 delete[] block; in ~Arena()
212 char* block = new char[block_bytes]; in AllocateNewBlock() local
215 allocated_size = malloc_usable_size(block); in AllocateNewBlock()
229 blocks_.back() = block; in AllocateNewBlock()
230 return block; in AllocateNewBlock()
|
| D | memory_allocator.h | 32 auto block = reinterpret_cast<char*>(allocator->Allocate(size)); in AllocateBlock() local
33 return CacheAllocationPtr(block, allocator); in AllocateBlock()
|
| /rocksdb-6.9/utilities/persistent_cache/ |
| D | block_cache_tier_metadata.cc | 49 BlockInfo* block; in Lookup() local
51 if (!block_index_.Find(&lookup_key, &block, &rlock)) { in Lookup()
56 assert(block->key_ == key.ToString()); in Lookup()
58 *lba = block->lba_; in Lookup()
|
| D | block_cache_tier_file.h | 161 bool Read(const LBA& lba, Slice* key, Slice* block, char* scratch) override;
195 bool Read(const LBA& lba, Slice* key, Slice* block, char* scratch) override { in Read() argument
200 return RandomAccessCacheFile::Read(lba, key, block, scratch); in Read()
203 return ReadBuffer(lba, key, block, scratch); in Read()
216 bool ReadBuffer(const LBA& lba, Slice* key, Slice* block, char* scratch);
|
| D | persistent_cache_bench.cc | 195 auto block = NewBlock(key); in InsertKey() local
200 Status status = cache_->Insert(block_key, block.get(), FLAGS_iosize); in InsertKey()
231 std::unique_ptr<char[]> block; in ReadKey() local
233 Status status = cache_->Lookup(key, &block, &size); in ReadKey()
248 assert(memcmp(block.get(), expected_block.get(), FLAGS_iosize) == 0); in ReadKey()
|
| D | persistent_cache_test.h | 160 std::unique_ptr<char[]> block; variable
164 if (!cache_->Lookup(key, &block, &block_size).ok()) {
171 ASSERT_OK(cache_->Lookup(key, &block, &block_size));
173 ASSERT_EQ(memcmp(edata, block.get(), sizeof(edata)), 0);
|
| /rocksdb-6.9/env/ |
| D | env_encryption.cc | 705 char *block = data; in Encrypt() local
714 block = blockBuffer.get(); in Encrypt()
716 memmove(block + blockOffset, data, n); in Encrypt()
718 auto status = EncryptBlock(blockIndex, block, (char*)scratch.data()); in Encrypt()
722 if (block != data) { in Encrypt()
724 memmove(data, block + blockOffset, n); in Encrypt()
750 char *block = data; in Decrypt() local
759 block = blockBuffer.get(); in Decrypt()
761 memmove(block + blockOffset, data, n); in Decrypt()
767 if (block != data) { in Decrypt()
[all …]
|
| /rocksdb-6.9/ |
| D | HISTORY.md | 184 * The semantics of the per-block-type block read counts in the performance context now match those …
214 * The semantics of the per-block-type block read counts in the performance context now match those …
322 * Enable properties block checksum verification for block-based tables.
438 * Write properties meta-block at the end of block-based table to save read-ahead IO.
446 …x a bug caused by not copying the block trailer with compressed SST file, direct IO, prefetcher an…
464 …dd DB properties "rocksdb.block-cache-capacity", "rocksdb.block-cache-usage", "rocksdb.block-cache…
504 * Adds a BlockBasedTableOption to turn off index block compression.
517 * Fix advance reservation of arena block addresses.
910 …block cache. Previously, we only counted the sum of block sizes currently present in block cache. …
1019 …zeForPointLookup() takes one parameter for block cache size. It now builds hash index, bloom filte…
[all …]
|