| /rocksdb-6.9/util/ |
| D | comparator.cc | 33 void FindShortestSeparator(std::string* start, in FindShortestSeparator() argument
56 (*start)[diff_index]++; in FindShortestSeparator()
57 start->resize(diff_index + 1); in FindShortestSeparator()
68 while (diff_index < start->size()) { in FindShortestSeparator()
73 (*start)[diff_index]++; in FindShortestSeparator()
74 start->resize(diff_index + 1); in FindShortestSeparator()
80 assert(Compare(*start, limit) < 0); in FindShortestSeparator()
147 void FindShortestSeparator(std::string* start, in FindShortestSeparator() argument
183 std::string old_start = *start; in FindShortestSeparator()
185 start->resize(diff_index + 1); in FindShortestSeparator()
[all …]
|
| D | string_util.cc | 252 size_t start = 0; in trim() local
254 while (isspace(str[start]) != 0 && start < end) { in trim()
255 ++start; in trim()
257 while (isspace(str[end]) != 0 && start < end) { in trim()
260 if (start <= end) { in trim()
261 return str.substr(start, end - start + 1); in trim()
384 size_t start = 0; in ParseVectorInt() local
385 while (start < value.size()) { in ParseVectorInt()
386 size_t end = value.find(':', start); in ParseVectorInt()
391 result.push_back(ParseInt(value.substr(start, end - start))); in ParseVectorInt()
[all …]
|
| D | coding_test.cc | 107 const char* start = p; in TEST() local
111 ASSERT_EQ(VarintLength(actual), p - start); in TEST()
142 const char* start = p; in TEST() local
146 ASSERT_EQ(VarintLength(actual), p - start); in TEST()
|
| D | timer_queue_test.cc | 34 static auto start = Clock::now(); in now() local
35 return std::chrono::duration<double, std::milli>(Clock::now() - start) in now()
|
| D | user_comparator_wrapper.h | 39 void FindShortestSeparator(std::string* start, in FindShortestSeparator() argument
41 return user_comparator_->FindShortestSeparator(start, limit); in FindShortestSeparator()
|
| /rocksdb-6.9/java/src/main/java/org/rocksdb/util/ |
| D | BytewiseComparator.java | 56 public void findShortestSeparator(final ByteBuffer start,
59 final int minLength = Math.min(start.remaining(), limit.remaining());
62 start.get(diffIndex) == limit.get(diffIndex)) {
69 final int startByte = start.get(diffIndex) & 0xff;
79 start.put(diffIndex, (byte)((start.get(diffIndex) & 0xff) + 1));
80 start.limit(diffIndex + 1);
91 while (diffIndex < start.remaining()) {
94 if ((start.get(diffIndex) & 0xff) <
96 start.put(diffIndex, (byte)((start.get(diffIndex) & 0xff) + 1));
97 start.limit(diffIndex + 1);
[all …]
|
| D | ReverseBytewiseComparator.java | 42 public void findShortestSeparator(final ByteBuffer start, in findShortestSeparator() argument
45 final int minLength = Math.min(start.remaining(), limit.remaining()); in findShortestSeparator()
48 start.get(diffIndex) == limit.get(diffIndex)) { in findShortestSeparator()
64 final int startByte = start.get(diffIndex) & 0xff; in findShortestSeparator()
66 if (startByte > limitByte && diffIndex < start.remaining() - 1) { in findShortestSeparator()
80 start.limit(diffIndex + 1); in findShortestSeparator()
84 assert(BytewiseComparator._compare(start.duplicate(), limit.duplicate()) > 0); in findShortestSeparator()
|
| /rocksdb-6.9/db/ |
| D | manual_compaction_test.cc | 205 Slice start("5"); in TEST_F() local
208 db->CompactRange(CompactRangeOptions(), &start, &end); in TEST_F()
215 Slice start("3"); in TEST_F() local
218 db->CompactRange(CompactRangeOptions(), &start, &end); in TEST_F()
238 Slice start("9"); in TEST_F() local
240 db->CompactRange(CompactRangeOptions(), &start, nullptr); in TEST_F()
248 Slice start("2"); in TEST_F() local
251 db->CompactRange(CompactRangeOptions(), &start, &end); in TEST_F()
260 Slice start("2"); in TEST_F() local
263 db->CompactRange(CompactRangeOptions(), &start, &end); in TEST_F()
[all …]
|
| D | range_del_aggregator_test.cc | 50 ParsedInternalKey start; member
57 ParsedInternalKey start; member
69 Slice start; member
89 EXPECT_EQ(0, icmp.Compare(iter->start_key(), expected_range_dels[i].start)); in VerifyIterator()
103 reverse_expected_range_dels[i].start)); in VerifyIterator()
120 EXPECT_EQ(0, icmp.Compare(iter->start_key(), test_case.start)); in VerifySeek()
136 EXPECT_EQ(0, icmp.Compare(iter->start_key(), test_case.start)); in VerifySeekForPrev()
607 Slice start("_"); in TEST_F() local
625 Slice start("p"); in TEST_F() local
650 Slice start("bb"); in TEST_F() local
[all …]
|
| D | range_del_aggregator_bench.cc | 103 PersistentRangeTombstone(std::string start, std::string end, in PersistentRangeTombstone()
105 : start_key(std::move(start)), end_key(std::move(end)) { in PersistentRangeTombstone()
201 uint64_t start = rnd.Uniform(FLAGS_tombstone_start_upper_bound); in main() local
203 std::round(start + std::max(1.0, normal_dist(random_gen)))); in main()
206 ROCKSDB_NAMESPACE::Key(start), ROCKSDB_NAMESPACE::Key(end), j); in main()
|
| D | dbformat.cc | 137 void InternalKeyComparator::FindShortestSeparator(std::string* start, in FindShortestSeparator() argument
140 Slice user_start = ExtractUserKey(*start); in FindShortestSeparator()
150 assert(this->Compare(*start, tmp) < 0); in FindShortestSeparator()
152 start->swap(tmp); in FindShortestSeparator()
|
| D | wal_manager.cc | 348 int64_t start = 0; // signed to avoid overflow when target is < first file. in RetainProbableWalFiles() local
351 while (end >= start) { in RetainProbableWalFiles()
352 int64_t mid = start + (end - start) / 2; // Avoid overflow. in RetainProbableWalFiles()
358 start = mid + 1; in RetainProbableWalFiles()
|
| D | range_del_aggregator.cc | 276 bool RangeDelAggregator::StripeRep::IsRangeOverlapped(const Slice& start, in IsRangeOverlapped() argument
285 ParsedInternalKey start_ikey(start, kMaxSequenceNumber, in IsRangeOverlapped()
290 for (iter->SeekForPrev(start); in IsRangeOverlapped()
330 bool ReadRangeDelAggregator::IsRangeOverlapped(const Slice& start, in IsRangeOverlapped() argument
333 return rep_.IsRangeOverlapped(start, end); in IsRangeOverlapped()
|
| D | db_test.cc | 1390 start = Key(500); in TEST_F()
1400 start = Key(500); in TEST_F()
1406 start = Key(100); in TEST_F()
1430 start = Key(100); in TEST_F()
1436 start = Key(1050); in TEST_F()
1442 start = Key(2100); in TEST_F()
1448 start = Key(1050); in TEST_F()
1480 start = Key(1); in TEST_F()
1568 start = Key(500); in TEST_F()
1577 start = Key(50); in TEST_F()
[all …]
|
| /rocksdb-6.9/table/block_based/ |
| D | block_based_filter_block.cc | 270 const uint32_t start = DecodeFixed32(offset + index * 4); in MayMatch() local
272 if (start <= limit && limit <= (uint32_t)(offset - data)) { in MayMatch()
273 const Slice filter = Slice(data + start, limit - start); in MayMatch()
287 } else if (start == limit) { in MayMatch()
334 uint32_t start = DecodeFixed32(offset + index * 4); in ToString() local
337 if (start != limit) { in ToString()
340 Slice filter = Slice(data + start, limit - start); in ToString()
341 AppendItem(&result, start, filter.ToString(true)); in ToString()
|
| /rocksdb-6.9/options/ |
| D | options_helper.cc | 317 size_t start = 0; in ParseVectorCompressionType() local
399 size_t start = 0; in ParseStructOptions() local
401 start++; in ParseStructOptions()
403 while ((start != std::string::npos) && (start < opt_str.size())) { in ParseStructOptions()
934 size_t start = 0; in ParseCompressionOptions() local
941 start = end + 1; in ParseCompressionOptions()
948 start = end + 1; in ParseCompressionOptions()
955 ParseInt(value.substr(start, value.size() - start)); in ParseCompressionOptions()
964 ParseInt(value.substr(start, value.size() - start)); in ParseCompressionOptions()
975 ParseInt(value.substr(start, value.size() - start)); in ParseCompressionOptions()
[all …]
|
| D | options_parser.cc | 455 size_t start = 0; in TrimAndRemoveComment() local
474 while (start < end && isspace(line[start]) != 0) { in TrimAndRemoveComment()
475 ++start; in TrimAndRemoveComment()
479 while (start < end && isspace(line[end - 1]) != 0) { in TrimAndRemoveComment()
483 if (start < end) { in TrimAndRemoveComment()
484 return line.substr(start, end - start); in TrimAndRemoveComment()
|
| /rocksdb-6.9/java/src/main/java/org/rocksdb/ |
| D | Range.java | 12 final Slice start; field in Range
15 public Range(final Slice start, final Slice limit) { in Range() argument
16 this.start = start; in Range()
|
| D | AbstractComparatorJniBridge.java | 88 final ByteBuffer start, final int startLen, in findShortestSeparatorInternal() argument
91 start.limit(startLen); in findShortestSeparatorInternal()
96 comparator.findShortestSeparator(start, limit); in findShortestSeparatorInternal()
97 return start.remaining(); in findShortestSeparatorInternal()
|
| /rocksdb-6.9/java/rocksjni/ |
| D | comparatorjnicallback.cc | 288 std::string* start, const Slice& limit) const { in FindShortestSeparator() argument
289 if (start == nullptr) { in FindShortestSeparator()
298 static_cast<int64_t>(start->length()) <= m_options->max_reused_buffer_size; in FindShortestSeparator()
304 Slice sstart(start->data(), start->length()); in FindShortestSeparator()
329 j_start_buf, reuse_jbuf_start ? start->length() : -1, in FindShortestSeparator()
336 } else if (static_cast<size_t>(jstart_len) != start->length()) { in FindShortestSeparator()
358 start->assign(static_cast<const char*>(start_buf), jstart_len); in FindShortestSeparator()
369 start->resize(jstart_len); in FindShortestSeparator()
392 …JniUtil::byteString<std::string>(env, jarray, [start, jstart_len](const char* data, const size_t) { in FindShortestSeparator()
393 return start->assign(data, static_cast<size_t>(jstart_len)); in FindShortestSeparator()
|
| /rocksdb-6.9/db_stress_tool/ |
| D | db_stress_common.h | 443 for (size_t start = 0; start < size_key; start += sizeof(uint64_t)) { in GetIntVal() local
444 size_t end = start + sizeof(uint64_t); in GetIntVal()
446 little_endian_key[start + i] = big_endian_key[end - 1 - i]; in GetIntVal()
449 Slice(&little_endian_key[start], sizeof(uint64_t)); in GetIntVal()
469 uint64_t start = 0; in GetPrefixKeyCount() local
472 if (!GetIntVal(prefix, &start) || !GetIntVal(ub, &end)) { in GetPrefixKeyCount()
476 return end - start; in GetPrefixKeyCount()
|
| /rocksdb-6.9/db/compaction/ |
| D | compaction_picker.cc | 47 size_t start = 0; in FindIntraL0Compaction() local
48 for (; start < level_files.size(); start++) { in FindIntraL0Compaction()
49 if (level_files[start]->being_compacted) { in FindIntraL0Compaction()
56 if (level_files[start]->fd.largest_seqno <= earliest_mem_seqno) { in FindIntraL0Compaction()
60 if (start >= level_files.size()) { in FindIntraL0Compaction()
65 level_files[start]->compensated_file_size; in FindIntraL0Compaction()
72 for (limit = start + 1; limit < level_files.size(); ++limit) { in FindIntraL0Compaction()
84 if ((limit - start) >= min_files_to_compact && in FindIntraL0Compaction()
88 for (size_t i = start; i < limit; ++i) { in FindIntraL0Compaction()
554 InternalKey start, limit; in GetGrandparents() local
[all …]
|
| D | compaction_job_stats_test.cc | 302 uint64_t Size(const Slice& start, const Slice& limit, int cf = 0) { in Size() argument
303 Range r(start, limit); in Size()
313 void Compact(int cf, const Slice& start, const Slice& limit, in Compact() argument
317 ASSERT_OK(db_->CompactRange(compact_options, handles_[cf], &start, &limit)); in Compact()
320 void Compact(int cf, const Slice& start, const Slice& limit) { in Compact() argument
322 db_->CompactRange(CompactRangeOptions(), handles_[cf], &start, &limit)); in Compact()
325 void Compact(const Slice& start, const Slice& limit) { in Compact() argument
326 ASSERT_OK(db_->CompactRange(CompactRangeOptions(), &start, &limit)); in Compact()
329 void TEST_Compact(int level, int cf, const Slice& start, const Slice& limit) { in TEST_Compact() argument
330 ASSERT_OK(dbfull()->TEST_CompactRange(level, &start, &limit, handles_[cf], in TEST_Compact()
|
| /rocksdb-6.9/table/plain/ |
| D | plain_table_key_coding.cc | 228 const char* start = file_info_->file_data.data() + offset; in ReadVarint32() local
231 const char* key_ptr = GetVarint32Ptr(start, limit, out); in ReadVarint32()
233 *bytes_read = static_cast<uint32_t>(key_ptr - start); in ReadVarint32()
242 const char* start; in ReadVarint32NonMmap() local
251 start = bytes.data(); in ReadVarint32NonMmap()
254 const char* key_ptr = GetVarint32Ptr(start, limit, out); in ReadVarint32NonMmap()
256 (key_ptr != nullptr) ? static_cast<uint32_t>(key_ptr - start) : 0; in ReadVarint32NonMmap()
|
| /rocksdb-6.9/tools/block_cache_analyzer/ |
| D | block_cache_pysim.py | 360 start /= kMicrosInSecond * self.time_unit
368 for trace_time in range(start, end):
376 for trace_time in range(start, end):
383 start /= kMicrosInSecond * self.time_unit
391 for trace_time in range(start, end):
399 for trace_time in range(start, end):
434 start /= kMicrosInSecond * self.time_unit
442 for trace_time in range(start, end):
452 for trace_time in range(start, end):
463 start /= kMicrosInSecond * self.time_unit
[all …]
|