| /rocksdb-6.9/util/ |
| D | heap.h | 103 static inline size_t get_parent(size_t index) { return (index - 1) / 2; } in get_parent() argument
104 static inline size_t get_left(size_t index) { return 2 * index + 1; } in get_left() argument
105 static inline size_t get_right(size_t index) { return 2 * index + 2; } in get_right() argument
107 void upheap(size_t index) { in upheap() argument
109 while (index > get_root()) { in upheap()
115 index = parent; in upheap()
117 data_[index] = std::move(v); in upheap()
121 void downheap(size_t index) { in downheap() argument
143 index = picked_child; in downheap()
146 if (index == 0) { in downheap()
[all …]
|
| D | autovector_test.cc | 158 size_t index = 0; in TEST_F() local
160 ASSERT_EQ(vec[index++], item); in TEST_F()
163 index = vec.size() - 1; in TEST_F()
165 ASSERT_EQ(vec[index--], *pos); in TEST_F()
170 index = 0; in TEST_F()
172 ASSERT_EQ(cvec[index++], item); in TEST_F()
175 index = vec.size() - 1; in TEST_F()
177 ASSERT_EQ(cvec[index--], *pos); in TEST_F()
209 int index = 0; in GetTestKeys() local
223 int index = 0; in BenchmarkVectorCreationAndInsertion() local
[all …]
|
| D | status.cc | 132 uint32_t index = static_cast<int32_t>(subcode_); in ToString() local
133 assert(sizeof(msgs) > index); in ToString()
134 result.append(msgs[index]); in ToString()
|
| /rocksdb-6.9/db/ |
| D | file_indexer.cc | 53 *right_bound = index.smallest_rb; in GetNextLevelIndex()
55 *left_bound = index.smallest_lb; in GetNextLevelIndex()
58 *left_bound = index.smallest_lb; in GetNextLevelIndex()
59 *right_bound = index.largest_rb; in GetNextLevelIndex()
61 *left_bound = index.largest_lb; in GetNextLevelIndex()
62 *right_bound = index.largest_rb; in GetNextLevelIndex()
64 *left_bound = index.largest_lb; in GetNextLevelIndex()
115 [](IndexUnit* index, int32_t f_idx) { index->smallest_lb = f_idx; }); in UpdateIndex() argument
122 [](IndexUnit* index, int32_t f_idx) { index->largest_lb = f_idx; }); in UpdateIndex() argument
129 [](IndexUnit* index, int32_t f_idx) { index->smallest_rb = f_idx; }); in UpdateIndex() argument
[all …]
|
| /rocksdb-6.9/docs/_posts/ |
| D | 2017-05-12-partitioned-index-filter.markdown | 8 …index blocks becomes non-trivial. Although `cache_index_and_filter_blocks` allows storing only a s…
10 ### How large are the index/filter blocks?
12 …index/filter block per SST file. The size of the index/filter varies based on the configuration bu…
14 ### What is the big deal with large index/filter blocks?
16 …index/filter blocks are stored in block cache they are effectively competing with data blocks (as …
18 …index/filter, it has to be reloaded from the disk, and its large size is not helping in reducing t…
20 ## What is partitioned index/filters?
22 …index/filter of a SST file is partitioned into smaller blocks with an additional top-level index o…
|
| D | 2018-08-23-data-block-hash-index.markdown | 23 // The index type that will be used for the data block.
26 kDataBlockBinaryAndHash = 1, // additional hash index
29 // Set to kDataBlockBinaryAndHash to enable hash index
45 
47 …k to index the key to reduce the CPU overhead of the binary search. The hash index is just an arra…
49 
58 
77 …index feature, one should 1) have a comparator that can never treat different keys as equal; and 2…
87 …index, i.e. restart interval index, the total number of restart intervals cannot be more than 253 …
112 
[all …]
|
| D | 2019-03-08-format-version-4.markdown | 8 …index and data blocks are the same: index blocks use the same key format of <`user_key`,`seq`> and…
12 Using `format_version`=4 significantly reduces the index block size, in some cases around 4-5x. Thi…
24 …index blocks. In such cases, `format_version`=3 skips encoding the sequence number and sets `index…
27 …index blocks by delta encoding the index values, which are the block handles. This saves the encod…
29 The index format in `format_version=4` would be as follows:
|
| D | 2014-06-23-plaintable-a-new-file-format.markdown | 24 …e misses (if they cannot be parallellized, which are usually the case for index look-ups). On our …
28 1. to use a hash index, which is
31 Having addressed our latency goal, the next task was to design a very compact hash index to minimiz…
33 1. We only use 32-bit integers for data and index offsets.The first bit serves as a flag, so we can…
34 1. We never copy keys or parts of keys to index search structures. We store only offsets from which…
|
| D | 2015-07-17-spatial-indexing-in-rocksdb.markdown | 10 … a need to develop a spatial database at Facebook. We needed to store and index Earth's map data. …
22 …d to be built. Each spatial index is defined by a bounding box and granularity. For map rendering,…
37 …index the feature. In the loading phase we process the map style to determine the list of zoom lev…
50 The indexing part is pretty simple. For each feature, we first find a list of index tiles that it i…
|
| /rocksdb-6.9/utilities/cassandra/ |
| D | format.cc | 23 ColumnBase::ColumnBase(int8_t mask, int8_t index) in ColumnBase() argument
24 : mask_(mask), index_(index) {} in ColumnBase()
57 int8_t index, in Column() argument
85 offset += sizeof(index); in Deserialize()
98 int8_t index, in ExpiringColumn() argument
146 offset += sizeof(index); in Deserialize()
162 int8_t index, in Tombstone() argument
195 offset += sizeof(index); in Deserialize()
363 int8_t index = column->Index(); in Merge() local
365 merged_columns[index] = column; in Merge()
[all …]
|
| D | cassandra_format_test.cc | 21 int8_t index = 1; in TEST() local
25 EXPECT_EQ(c.Index(), index); in TEST()
38 EXPECT_EQ(Deserialize<int8_t>(dest.c_str(), offset), index); in TEST()
49 EXPECT_EQ(c1->Index(), index); in TEST()
72 int8_t index = 3; in TEST() local
75 ExpiringColumn c = ExpiringColumn(mask, index, timestamp, in TEST()
78 EXPECT_EQ(c.Index(), index); in TEST()
105 EXPECT_EQ(c1->Index(), index); in TEST()
141 int8_t index = 2; in TEST() local
147 EXPECT_EQ(c.Index(), index); in TEST()
[all …]
|
| D | test_utils.cc | 18 int8_t index, in CreateTestColumn() argument
22 new Tombstone(mask, index, ToSeconds(timestamp), timestamp)); in CreateTestColumn()
25 mask, index, timestamp, sizeof(kExpiringData), kExpiringData, kTtl)); in CreateTestColumn()
28 new Column(mask, index, timestamp, sizeof(kData), kData)); in CreateTestColumn()
33 int8_t index, in CreateTestColumnSpec() argument
35 return std::make_tuple(mask, index, timestamp); in CreateTestColumnSpec()
|
| D | format.h | 77 ColumnBase(int8_t mask, int8_t index);
95 Column(int8_t mask, int8_t index, int64_t timestamp,
112 Tombstone(int8_t mask, int8_t index,
129 ExpiringColumn(int8_t mask, int8_t index, int64_t timestamp,
|
| /rocksdb-6.9/table/block_based/ |
| D | block_prefix_index.cc | 51 uint32_t index = block_id ^ kBlockArrayMask; in DecodeIndex() local
52 assert(index < kBlockArrayMask); in DecodeIndex()
53 return index; in DecodeIndex()
56 inline uint32_t EncodeIndex(uint32_t index) { in EncodeIndex() argument
57 assert(index < kBlockArrayMask); in EncodeIndex()
58 return index | kBlockArrayMask; in EncodeIndex()
222 uint32_t index = DecodeIndex(block_id); in GetBlocks() local
223 assert(index < num_block_array_buffer_entries_); in GetBlocks()
224 *blocks = &block_array_buffer_[index + 1]; in GetBlocks()
225 uint32_t num_blocks = block_array_buffer_[index]; in GetBlocks()
[all …]
|
| D | block_test.cc | 118 int index = rnd.Uniform(num_records); in TEST_F() local
119 Slice k(keys[index]); in TEST_F()
125 ASSERT_EQ(v.ToString().compare(values[index]), 0); in TEST_F()
456 int index = rnd.Uniform(num_records); in TEST_F() local
457 Slice k(keys[index]); in TEST_F()
461 if (read_keys.find(index) == read_keys.end()) { in TEST_F()
462 read_keys.insert(index); in TEST_F()
581 for (int index = 0; index < num_records; ++index) { in TEST_P() local
587 EXPECT_EQ(separators[index], k.ToString()); in TEST_P()
604 int index = rnd.Uniform(num_records); in TEST_P() local
[all …]
|
| D | block.cc | 245 uint32_t index = 0; in Seek() local
252 SeekToRestartPoint(index); in Seek()
388 uint32_t index = 0; in Seek() local
411 SeekToRestartPoint(index); in Seek()
424 uint32_t index = 0; in SeekForPrev() local
431 SeekToRestartPoint(index); in SeekForPrev()
696 *index = left; in BinarySeek()
726 assert(index); in BinaryBlockIndexSeek()
766 *index = block_ids[left]; in BinaryBlockIndexSeek()
788 *index = right_index + 1; in BinaryBlockIndexSeek()
[all …]
|
| D | data_block_hash_index_test.cc | 23 bool SearchForOffset(DataBlockHashIndex& index, const char* data, in SearchForOffset() argument
26 uint8_t entry = index.Lookup(data, map_offset, key); in SearchForOffset()
101 DataBlockHashIndex index; in TEST() local
140 DataBlockHashIndex index; in TEST() local
177 DataBlockHashIndex index; in TEST() local
218 DataBlockHashIndex index; in TEST() local
481 int index = rnd.Uniform(num_records); in TEST() local
482 std::string ukey(keys[index] + "1" /* existing key marker */); in TEST()
489 ASSERT_EQ(values[index], iter->value()); in TEST()
519 int index = rnd.Uniform(num_records); in TEST() local
[all …]
|
| D | block_based_filter_block.cc | 268 const uint64_t index = block_offset >> base_lg; in MayMatch() local
269 if (index < num) { in MayMatch()
270 const uint32_t start = DecodeFixed32(offset + index * 4); in MayMatch()
271 const uint32_t limit = DecodeFixed32(offset + index * 4 + 4); in MayMatch()
333 for (size_t index = 0; index < num; index++) { in ToString() local
334 uint32_t start = DecodeFixed32(offset + index * 4); in ToString()
335 uint32_t limit = DecodeFixed32(offset + index * 4 + 4); in ToString()
339 ROCKSDB_NAMESPACE::ToString(index + 1) + "\n"); in ToString()
|
| D | block.h | 338 uint32_t GetRestartPoint(uint32_t index) { in GetRestartPoint() argument
339 assert(index < num_restarts_); in GetRestartPoint()
340 return DecodeFixed32(data_ + restarts_ + index * sizeof(uint32_t)); in GetRestartPoint()
343 void SeekToRestartPoint(uint32_t index) { in SeekToRestartPoint() argument
345 restart_index_ = index; in SeekToRestartPoint()
349 uint32_t offset = GetRestartPoint(index); in SeekToRestartPoint()
357 uint32_t* index, const Comparator* comp);
602 bool PrefixSeek(const Slice& target, uint32_t* index, bool* prefix_may_exist);
607 uint32_t left, uint32_t right, uint32_t* index,
|
| /rocksdb-6.9/db/blob/ |
| D | db_blob_index_test.cc | 142 std::string index = ToString(i); in TEST_F() local
144 ASSERT_OK(PutBlobIndex(&batch, "key" + index, "blob" + index)); in TEST_F()
149 std::string index = ToString(i); in TEST_F() local
150 ASSERT_EQ("blob" + index, GetBlobIndex("key" + index)); in TEST_F()
244 auto get_key = [](int index) { in TEST_F() argument
246 snprintf(buf, sizeof(buf), "%02d", index); in TEST_F()
250 auto get_value = [&](int index, int version) { in TEST_F() argument
285 iterator->Seek(get_key(index)); in TEST_F()
295 iterator->Seek(get_key(index - 1)); in TEST_F()
307 iterator->SeekForPrev(get_key(index)); in TEST_F()
[all …]
|
| /rocksdb-6.9/utilities/transactions/ |
| D | transaction_test.h | 237 std::function<void(size_t)> txn_t0 = [&](size_t index) {
238 return txn_t0_with_status(index, Status::OK());
240 std::function<void(size_t)> txn_t1 = [&](size_t index) {
244 auto istr = std::to_string(index);
264 std::function<void(size_t)> txn_t2 = [&](size_t index) {
269 auto istr = std::to_string(index);
302 auto istr = std::to_string(index);
335 auto istr = std::to_string(index);
379 uint32_t index = 0; in CrossCompatibilityTest() local
392 auto istr = std::to_string(index); in CrossCompatibilityTest()
[all …]
|
| /rocksdb-6.9/tools/block_cache_analyzer/ |
| D | block_cache_pysim.py | 167 pos = index
215 index = hash % len(self.table)
216 if self.table[index] is None:
217 self.table[index] = []
222 if self.table[index][i].hash == hash and self.table[index][i].key == key:
255 new_table[index] = []
270 index = hash % len(self.table)
273 if self.table[index] is None:
282 self.table[index][i] = None
297 index = hash % len(self.table)
[all …]
|
| /rocksdb-6.9/table/plain/ |
| D | plain_table_index.cc | 164 uint32_t* index = in FillIndexes() local
166 char* sub_index = reinterpret_cast<char*>(index + index_size_); in FillIndexes()
174 PutUnaligned(index + i, (uint32_t)PlainTableIndex::kMaxFileSize); in FillIndexes()
178 PutUnaligned(index + i, hash_to_offsets[i]->offset); in FillIndexes()
182 PutUnaligned(index + i, sub_index_offset | PlainTableIndex::kSubIndexMask); in FillIndexes()
|
| /rocksdb-6.9/test_util/ |
| D | sync_point.h | 48 #define TEST_IDX_SYNC_POINT(x, index) argument
137 #define TEST_IDX_SYNC_POINT(x, index) \ argument
139 std::to_string(index))
|
| /rocksdb-6.9/docs/_sass/ |
| D | _react_header_nav.scss | 16 z-index: 101;
106 z-index: 99;
128 z-index: 100;
|