| /rocksdb-6.9/db/ |
| D | db_table_properties_test.cc | 52 std::vector<Range> ranges, std::size_t* num_properties = nullptr,
94 std::vector<Range> ranges, std::size_t* num_properties, in TestGetPropertiesOfTablesInRange() argument
99 EXPECT_GT(ranges.size(), 0U); in TestGetPropertiesOfTablesInRange()
103 db_->DefaultColumnFamily(), &ranges[0], ranges.size(), &props)); in TestGetPropertiesOfTablesInRange()
112 for (auto& r : ranges) { in TestGetPropertiesOfTablesInRange()
216 std::vector<Range> ranges; in TEST_F() local
219 ranges.push_back(Range(*it, *(it + 1))); in TEST_F()
223 TestGetPropertiesOfTablesInRange(std::move(ranges)); in TEST_F()
|
| D | convenience.cc | 29 const RangePtr* ranges, size_t n, in DeleteFilesInRanges() argument
32 ->DeleteFilesInRanges(column_family, ranges, n, include_end); in DeleteFilesInRanges()
|
| D | db_compaction_test.cc | 1178 for (size_t i = 0; i < ranges.size(); i++) { in TEST_P()
1179 for (int32_t j = ranges[i].first; j <= ranges[i].second; j++) { in TEST_P()
1200 for (size_t i = 0; i < ranges.size(); i++) { in TEST_P()
1201 for (int32_t j = ranges[i].first; j <= ranges[i].second; j++) { in TEST_P()
1214 ranges = { in TEST_P()
1225 for (int32_t j = ranges[i].first; j <= ranges[i].second; j++) { in TEST_P()
1235 for (int32_t j = ranges[i].first; j <= ranges[i].second; j++) { in TEST_P()
1777 std::vector<RangePtr> ranges; in TEST_F() local
1782 ranges.data(), ranges.size())); in TEST_F()
1805 std::vector<RangePtr> ranges; in TEST_F() local
[all …]
|
| D | column_family.cc | 1070 const autovector<Range>& ranges, SuperVersion* super_version, in RangesOverlapWithMemtables() argument
1094 for (size_t i = 0; i < ranges.size() && status.ok() && !*overlap; ++i) { in RangesOverlapWithMemtables()
1097 InternalKey range_start(ranges[i].start, kMaxSequenceNumber, in RangesOverlapWithMemtables()
1110 ucmp->Compare(seek_result.user_key, ranges[i].limit) <= 0) { in RangesOverlapWithMemtables()
1112 } else if (range_del_agg.IsRangeOverlapped(ranges[i].start, in RangesOverlapWithMemtables()
1113 ranges[i].limit)) { in RangesOverlapWithMemtables()
|
| D | external_sst_file_ingestion_job.cc | 184 autovector<Range> ranges; in NeedsFlush() local
186 ranges.emplace_back(file_to_ingest.smallest_internal_key.user_key(), in NeedsFlush()
190 cfd_->RangesOverlapWithMemtables(ranges, super_version, flush_needed); in NeedsFlush()
|
| D | c.cc | 1157 Range* ranges = new Range[num_ranges]; in rocksdb_approximate_sizes() local
1159 ranges[i].start = Slice(range_start_key[i], range_start_key_len[i]); in rocksdb_approximate_sizes()
1160 ranges[i].limit = Slice(range_limit_key[i], range_limit_key_len[i]); in rocksdb_approximate_sizes()
1162 db->rep->GetApproximateSizes(ranges, num_ranges, sizes); in rocksdb_approximate_sizes()
1163 delete[] ranges; in rocksdb_approximate_sizes()
1173 Range* ranges = new Range[num_ranges]; in rocksdb_approximate_sizes_cf() local
1175 ranges[i].start = Slice(range_start_key[i], range_start_key_len[i]); in rocksdb_approximate_sizes_cf()
1176 ranges[i].limit = Slice(range_limit_key[i], range_limit_key_len[i]); in rocksdb_approximate_sizes_cf()
1178 db->rep->GetApproximateSizes(column_family->rep, ranges, num_ranges, sizes); in rocksdb_approximate_sizes_cf()
1179 delete[] ranges; in rocksdb_approximate_sizes_cf()
|
| D | column_family.h | 405 Status RangesOverlapWithMemtables(const autovector<Range>& ranges,
|
| D | version_set.cc | 3349 std::map<InternalKey*, FileMetaData*, decltype(ikey_lt)> ranges(ikey_lt); in EstimateLiveDataSize() local
3361 ranges.end() : ranges.lower_bound(&file->smallest); in EstimateLiveDataSize()
3362 found_end = (lb == ranges.end()); in EstimateLiveDataSize()
3365 ranges.emplace_hint(lb, &file->largest, file); in EstimateLiveDataSize()
|
| D | db_test.cc | 5621 std::vector<std::pair<int32_t, int32_t>> ranges = { in TEST_F() local
5628 for (const auto& range : ranges) { in TEST_F()
5637 ASSERT_EQ(level0_files, ranges.size()); in TEST_F()
|
| /rocksdb-6.9/java/src/main/java/org/rocksdb/ |
| D | RocksDB.java | 2979 final List<Range> ranges, in getApproximateSizes() argument
2990 toRangeSliceHandles(ranges), flags); in getApproximateSizes()
4036 final List<Range> ranges) throws RocksDBException { in getPropertiesOfTablesInRange() argument
4039 toRangeSliceHandles(ranges)); in getPropertiesOfTablesInRange()
4052 final List<Range> ranges) throws RocksDBException { in getPropertiesOfTablesInRange() argument
4053 return getPropertiesOfTablesInRange(null, ranges); in getPropertiesOfTablesInRange()
4163 if (ranges.size() == 0) { in deleteFilesInRanges()
4166 if ((ranges.size() % 2) != 0) { in deleteFilesInRanges()
4171 final byte[][] rangesArray = ranges.toArray(new byte[ranges.size()][]); in deleteFilesInRanges()
4207 for (int i = 0, j = 0; i < ranges.size(); i++) { in toRangeSliceHandles()
[all …]
|
| /rocksdb-6.9/docs/_posts/ |
| D | 2017-01-06-rocksdb-5-0-1-released.markdown | 12 * Introduce DB::DeleteRange for optimized deletion of large ranges of contiguous keys.
17 * New compaction filter API: CompactionFilter::FilterV2(). Allows to drop ranges of keys.
|
| D | 2016-01-29-compaction_pri.markdown | 28 …ys that are frequently updated while other key ranges are very cold. In this case, keeping hot key…
30 …s the coldest range. By compacting coldest range first, we leave the hot ranges in the level. If y…
|
| D | 2018-11-21-delete-range.markdown | 22 of its admin tool commands, `nodetool cleanup`, removes key-ranges that have been migrated
44 in cases where readers must not see keys in deleted ranges. Further, it has the
140 want to store skylines (see “Read Path” subsection below) computed over our ranges so we can binary…
|
| /rocksdb-6.9/db/compaction/ |
| D | compaction_job.cc | 500 std::vector<RangeWithSize> ranges; in GenSubcompactionBoundaries() local
523 ranges.emplace_back(a, b, size); in GenSubcompactionBoundaries()
536 std::min({static_cast<uint64_t>(ranges.size()), in GenSubcompactionBoundaries()
545 for (size_t i = 0; i < ranges.size() - 1; i++) { in GenSubcompactionBoundaries()
546 sum += ranges[i].size; in GenSubcompactionBoundaries()
553 boundaries_.emplace_back(ExtractUserKey(ranges[i].range.limit)); in GenSubcompactionBoundaries()
559 sizes_.emplace_back(sum + ranges.back().size); in GenSubcompactionBoundaries()
|
| /rocksdb-6.9/java/rocksjni/ |
| D | rocksjni.cc | 2278 auto ranges = std::unique_ptr<ROCKSDB_NAMESPACE::Range[]>( in Java_org_rocksdb_RocksDB_getApproximateSizes() local
2283 ranges.get()[i] = ROCKSDB_NAMESPACE::Range(*start, *limit); in Java_org_rocksdb_RocksDB_getApproximateSizes()
2296 db->GetApproximateSizes(cf_handle, ranges.get(), in Java_org_rocksdb_RocksDB_getApproximateSizes()
3180 auto ranges = std::unique_ptr<ROCKSDB_NAMESPACE::Range[]>( in Java_org_rocksdb_RocksDB_getPropertiesOfTablesInRange() local
3187 ranges[j++] = ROCKSDB_NAMESPACE::Range(*start, *limit); in Java_org_rocksdb_RocksDB_getPropertiesOfTablesInRange()
3192 cf_handle, ranges.get(), ranges_len, &table_properties_collection); in Java_org_rocksdb_RocksDB_getPropertiesOfTablesInRange()
3338 bool get_slice_helper(JNIEnv* env, jobjectArray ranges, jsize index, in get_slice_helper() argument
3341 jobject jArray = env->GetObjectArrayElement(ranges, index); in get_slice_helper()
3372 jobjectArray ranges, jboolean include_end) { in Java_org_rocksdb_RocksDB_deleteFilesInRanges() argument
3373 jsize length = env->GetArrayLength(ranges); in Java_org_rocksdb_RocksDB_deleteFilesInRanges()
[all …]
|
| /rocksdb-6.9/include/rocksdb/ |
| D | convenience.h | 335 const RangePtr* ranges, size_t n,
|
| /rocksdb-6.9/tools/ |
| D | ldb_cmd.cc | 2397 Range ranges[1]; in DoCommand() local
2398 ranges[0] = Range(start_key_, end_key_); in DoCommand()
2400 db_->GetApproximateSizes(GetCfHandle(), ranges, 1, sizes); in DoCommand()
|
| /rocksdb-6.9/db/db_impl/ |
| D | db_impl.cc | 3258 const RangePtr* ranges, size_t n, in DeleteFilesInRanges() argument
3272 auto begin = ranges[r].start, end = ranges[r].limit; in DeleteFilesInRanges()
|
| D | db_impl.h | 385 const RangePtr* ranges, size_t n,
|
| /rocksdb-6.9/ |
| D | HISTORY.md | 509 * Add new function `DeleteFilesInRanges()` to delete files in multiple ranges at once for better pe…
706 * Introduce DB::DeleteRange for optimized deletion of large ranges of contiguous keys.
711 * New compaction filter API: CompactionFilter::FilterV2(). Allows to drop ranges of keys.
|