Home
last modified time | relevance | path

Searched refs:limit (Results 1 – 25 of 81) sorted by relevance

1234

/rocksdb-6.9/table/block_based/
Dblock.cc44 assert(limit - p >= 3); in operator ()()
75 if (limit - p < 3) { in operator ()()
116 if (limit - p < 3) return nullptr; in operator ()()
319 const char* limit = nullptr; in SeekForGetImpl() local
321 limit = data_ + GetRestartPoint(restart_index_ + 1); in SeekForGetImpl()
323 limit = data_ + restarts_; in SeekForGetImpl()
501 bool DataBlockIter::ParseNextDataKey(const char* limit) { in ParseNextDataKey() argument
504 if (!limit) { in ParseNextDataKey()
508 if (p >= limit) { in ParseNextDataKey()
575 if (p >= limit) { in ParseNextIndexKey()
[all …]
Dblock_based_filter_block.cc271 const uint32_t limit = DecodeFixed32(offset + index * 4 + 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()
335 uint32_t limit = DecodeFixed32(offset + index * 4 + 4); in ToString() local
337 if (start != limit) { in ToString()
340 Slice filter = Slice(data + start, limit - start); in ToString()
/rocksdb-6.9/java/src/main/java/org/rocksdb/
DAbstractComparatorJniBridge.java47 a.limit(aLen); in compareInternal()
51 b.limit(bLen); in compareInternal()
89 final ByteBuffer limit, final int limitLen) { in findShortestSeparatorInternal() argument
91 start.limit(startLen); in findShortestSeparatorInternal()
94 limit.limit(limitLen); in findShortestSeparatorInternal()
96 comparator.findShortestSeparator(start, limit); in findShortestSeparatorInternal()
120 key.limit(keyLen); in findShortSuccessorInternal()
DRange.java13 final Slice limit; field in Range
15 public Range(final Slice start, final Slice limit) { in Range() argument
17 this.limit = limit; in Range()
DAbstractWriteBatch.java63 key.position(key.limit()); in put()
64 value.position(value.limit()); in put()
73 key.position(key.limit()); in put()
74 value.position(value.limit()); in put()
115 key.position(key.limit()); in remove()
123 key.position(key.limit()); in remove()
DRocksIterator.java60 key.limit(Math.min(key.position() + result, key.limit())); in key()
95 value.limit(Math.min(value.position() + result, value.limit())); in value()
DSstFileReaderIterator.java60 key.limit(Math.min(key.position() + result, key.limit())); in key()
95 value.limit(Math.min(value.position() + result, value.limit())); in value()
/rocksdb-6.9/util/
Dcomparator.cc34 const Slice& limit) const override { in FindShortestSeparator()
36 size_t min_length = std::min(start->size(), limit.size()); in FindShortestSeparator()
39 ((*start)[diff_index] == limit[diff_index])) { in FindShortestSeparator()
47 uint8_t limit_byte = static_cast<uint8_t>(limit[diff_index]); in FindShortestSeparator()
55 if (diff_index < limit.size() - 1 || start_byte + 1 < limit_byte) { in FindShortestSeparator()
80 assert(Compare(*start, limit) < 0); in FindShortestSeparator()
148 const Slice& limit) const override { in FindShortestSeparator()
150 size_t min_length = std::min(start->size(), limit.size()); in FindShortestSeparator()
153 ((*start)[diff_index] == limit[diff_index])) { in FindShortestSeparator()
170 uint8_t limit_byte = static_cast<uint8_t>(limit[diff_index]); in FindShortestSeparator()
[all …]
Dconcurrent_task_limiter_impl.cc31 void ConcurrentTaskLimiterImpl::SetMaxOutstandingTask(int32_t limit) { in SetMaxOutstandingTask() argument
32 max_outstanding_tasks_.store(limit, std::memory_order_relaxed); in SetMaxOutstandingTask()
45 int32_t limit = max_outstanding_tasks_.load(std::memory_order_relaxed); in GetToken() local
49 while (force || limit < 0 || tasks < limit) { in GetToken()
58 const std::string& name, int32_t limit) { in NewConcurrentTaskLimiter() argument
59 return new ConcurrentTaskLimiterImpl(name, limit); in NewConcurrentTaskLimiter()
Dcoding.h88 const char* ret = GetVarint64Ptr(p, limit, &u); in GetVarsignedint64Ptr()
155 const char* limit, in GetVarint32Ptr() argument
157 if (p < limit) { in GetVarint32Ptr()
164 return GetVarint32PtrFallback(p, limit, value); in GetVarint32Ptr()
371 const char* limit = p + input->size(); in GetVarint32() local
372 const char* q = GetVarint32Ptr(p, limit, value); in GetVarint32()
376 *input = Slice(q, static_cast<size_t>(limit - q)); in GetVarint32()
383 const char* limit = p + input->size(); in GetVarint64() local
384 const char* q = GetVarint64Ptr(p, limit, value); in GetVarint64()
388 *input = Slice(q, static_cast<size_t>(limit - q)); in GetVarint64()
[all …]
Dcoding.cc54 const char* GetVarint32PtrFallback(const char* p, const char* limit, in GetVarint32PtrFallback() argument
57 for (uint32_t shift = 0; shift <= 28 && p < limit; shift += 7) { in GetVarint32PtrFallback()
72 const char* GetVarint64Ptr(const char* p, const char* limit, uint64_t* value) { in GetVarint64Ptr() argument
74 for (uint32_t shift = 0; shift <= 63 && p < limit; shift += 7) { in GetVarint64Ptr()
Dcoding_test.cc103 const char* limit = p + s.size(); in TEST() local
108 p = GetVarint32Ptr(p, limit, &actual); in TEST()
138 const char* limit = p + s.size(); in TEST() local
140 ASSERT_TRUE(p < limit); in TEST()
143 p = GetVarint64Ptr(p, limit, &actual); in TEST()
148 ASSERT_EQ(p, limit); in TEST()
Dhash.cc24 const char* limit = data + n; in Hash() local
28 while (data + 4 <= limit) { in Hash()
37 switch (limit - data) { in Hash()
/rocksdb-6.9/java/src/main/java/org/rocksdb/util/
DBytewiseComparator.java57 final ByteBuffer limit) {
59 final int minLength = Math.min(start.remaining(), limit.remaining());
62 start.get(diffIndex) == limit.get(diffIndex)) {
70 final int limitByte = limit.get(diffIndex) & 0xff;
78 if (diffIndex < limit.remaining() - 1 || startByte + 1 < limitByte) {
80 start.limit(diffIndex + 1);
97 start.limit(diffIndex + 1);
103 assert(compare(start.duplicate(), limit.duplicate()) < 0);
115 key.limit(i+1);
DReverseBytewiseComparator.java43 final ByteBuffer limit) { in findShortestSeparator() argument
45 final int minLength = Math.min(start.remaining(), limit.remaining()); in findShortestSeparator()
48 start.get(diffIndex) == limit.get(diffIndex)) { in findShortestSeparator()
65 final int limitByte = limit.get(diffIndex) & 0xff; in findShortestSeparator()
80 start.limit(diffIndex + 1); in findShortestSeparator()
84 assert(BytewiseComparator._compare(start.duplicate(), limit.duplicate()) > 0); in findShortestSeparator()
/rocksdb-6.9/logging/
Dposix_logger.h104 char* limit = base + bufsize; in Logv() local
111 p += snprintf(p, limit - p, in Logv()
123 if (p < limit) { in Logv()
126 p += vsnprintf(p, limit - p, format, backup_ap); in Logv()
131 if (p >= limit) { in Logv()
135 p = limit - 1; in Logv()
144 assert(p <= limit); in Logv()
Denv_logger.h100 char* limit = base + bufsize; in Logv() local
107 p += snprintf(p, limit - p, "%04d/%02d/%02d-%02d:%02d:%02d.%06d %llx ", in Logv()
113 if (p < limit) { in Logv()
116 p += vsnprintf(p, limit - p, format, backup_ap); in Logv()
121 if (p >= limit) { in Logv()
125 p = limit - 1; in Logv()
134 assert(p <= limit); in Logv()
Dlog_buffer.cc27 char* limit = alloc_mem + max_log_size - 1; in AddLogToBuffer() local
33 if (p < limit) { in AddLogToBuffer()
36 auto n = vsnprintf(p, limit - p, format, backup_ap); in AddLogToBuffer()
44 p = limit; in AddLogToBuffer()
49 if (p > limit) { in AddLogToBuffer()
50 p = limit; in AddLogToBuffer()
/rocksdb-6.9/port/win/
Dwin_logger.cc119 char* limit = base + bufsize; in Logv() local
126 p += snprintf(p, limit - p, "%04d/%02d/%02d-%02d:%02d:%02d.%06d %llx ", in Logv()
132 if (p < limit) { in Logv()
135 int done = vsnprintf(p, limit - p, format, backup_ap); in Logv()
145 if (p >= limit) { in Logv()
149 p = limit - 1; in Logv()
158 assert(p <= limit); in Logv()
/rocksdb-6.9/db/compaction/
Dcompaction_picker.cc68 size_t limit; in FindIntraL0Compaction() local
72 for (limit = start + 1; limit < level_files.size(); ++limit) { in FindIntraL0Compaction()
75 new_compact_bytes_per_del_file = compact_bytes / (limit - start); in FindIntraL0Compaction()
76 if (level_files[limit]->being_compacted || in FindIntraL0Compaction()
84 if ((limit - start) >= min_files_to_compact && in FindIntraL0Compaction()
88 for (size_t i = start; i < limit; ++i) { in FindIntraL0Compaction()
506 output_level_inputs_size + expanded_inputs_size < limit && in SetupOtherInputs()
554 InternalKey start, limit; in GetGrandparents() local
555 GetRange(inputs, output_level_inputs, &start, &limit); in GetGrandparents()
560 &limit, grandparents); in GetGrandparents()
[all …]
/rocksdb-6.9/java/src/test/java/org/rocksdb/
DRocksIteratorTest.java46 assertThat(key.limit()).isEqualTo(2); in rocksIterator()
48 assertThat(value.limit()).isEqualTo(2); in rocksIterator()
61 assertThat(key.limit()).isEqualTo(4); in rocksIterator()
63 assertThat(value.limit()).isEqualTo(6); in rocksIterator()
97 assertThat(key.limit()).isEqualTo(4); in rocksIterator()
106 assertThat(key.limit()).isEqualTo(4); in rocksIterator()
/rocksdb-6.9/docs/_posts/
D2017-12-18-17-auto-tuned-rate-limiter.markdown12 …he upper-bound of the window within which a rate limit will be picked dynamically. The chosen rate…
16 …rmarks for this ratio, which will trigger a change in rate limit when breached. The rate limit can…
20 …was created with 1000MB/s as its upper bound. The dynamically chosen rate limit hovers around 125M…
/rocksdb-6.9/tools/advisor/test/input_files/
Dtriggered_rules.ini26 …c-write-buffer-size:inc-hard-pending-compaction-bytes-limit:inc-soft-pending-compaction-bytes-limit
65 [Suggestion "inc-hard-pending-compaction-bytes-limit"]
69 [Suggestion "inc-soft-pending-compaction-bytes-limit"]
/rocksdb-6.9/env/
Denv_hdfs.cc332 char* limit = base + bufsize; in Logv() local
339 p += snprintf(p, limit - p, in Logv()
351 if (p < limit) { in Logv()
354 p += vsnprintf(p, limit - p, format, backup_ap); in Logv()
359 if (p >= limit) { in Logv()
363 p = limit - 1; in Logv()
372 assert(p <= limit); in Logv()
/rocksdb-6.9/java/jmh/src/main/java/org/rocksdb/jmh/
DMultiGetBenchmarks.java130 private int next(final int inc, final int limit) { in next() argument
136 if (nextIdx >= limit) { in next()
145 if (nextIdx >= limit) { in next()

1234