Home
last modified time | relevance | path

Searched refs:n (Results 1 – 25 of 134) sorted by relevance

123456

/rocksdb-6.9/file/
Dsequence_file_reader.cc29 size_t offset = offset_.fetch_add(n); in Read()
58 offset_ += static_cast<size_t>(n); in Skip()
62 return file_->Skip(n); in Skip()
103 n -= cached_len; in Read()
139 read_offset_ += n; in Skip()
140 n = 0; in Skip()
143 if (n > 0) { in Skip()
145 s = file_->Skip(n); in Skip()
147 read_offset_ += n; in Skip()
192 if (n > buffer_.Capacity()) { in ReadIntoBuffer()
[all …]
Dreadahead_raf.cc38 Status Read(uint64_t offset, size_t n, Slice* result, in Read() argument
41 if (n + alignment_ >= readahead_size_) { in Read()
42 return file_->Read(offset, n, result, scratch); in Read()
52 if (TryReadFromCache(offset, n, &cached_len, scratch) && in Read()
53 (cached_len == n || buffer_.CurrentSize() < readahead_size_)) { in Read()
74 Status Prefetch(uint64_t offset, size_t n) override { in Prefetch() argument
75 if (n < readahead_size_) { in Prefetch()
128 Status ReadIntoBuffer(uint64_t offset, size_t n) const { in ReadIntoBuffer()
129 if (n > buffer_.Capacity()) { in ReadIntoBuffer()
130 n = buffer_.Capacity(); in ReadIntoBuffer()
[all …]
Dfile_prefetch_buffer.cc25 uint64_t offset, size_t n, in Prefetch() argument
33 uint64_t roundup_end = Roundup(offset_ + n, alignment); in Prefetch()
50 if (offset + n <= buffer_offset_ + buffer_.CurrentSize()) { in Prefetch()
99 bool FilePrefetchBuffer::TryReadFromCache(uint64_t offset, size_t n, in TryReadFromCache() argument
112 if (offset + n > buffer_offset_ + buffer_.CurrentSize()) { in TryReadFromCache()
118 s = Prefetch(file_reader_, offset, std::max(n, readahead_size_), in TryReadFromCache()
121 s = Prefetch(file_reader_, offset, n + readahead_size_, for_compaction); in TryReadFromCache()
133 *result = Slice(buffer_.BufferStart() + offset_in_buffer, n); in TryReadFromCache()
/rocksdb-6.9/util/
Drandom.h64 uint32_t Uniform(int n) { return Next() % n; } in Uniform() argument
68 bool OneIn(int n) { return Uniform(n) == 0; } in OneIn() argument
72 bool OneInOpt(int n) { return n > 0 && OneIn(n); } in OneInOpt() argument
108 uint32_t Uniform(uint32_t n) { in Uniform() argument
111 0, n - 1)(generator_)); in Uniform()
117 uint32_t Uniformish(uint32_t n) { in Uniformish() argument
119 return static_cast<uint32_t>((uint64_t(generator_()) * uint64_t(n)) >> 32); in Uniformish()
124 bool OneIn(uint32_t n) { return Uniform(n) == 0; } in OneIn() argument
150 uint64_t Uniform(uint64_t n) { in Uniform() argument
151 return std::uniform_int_distribution<uint64_t>(0, n - 1)(generator_); in Uniform()
[all …]
Dautovector.h200 if (n > kSize) {
220 assert(n < size());
221 if (n < kSize) {
222 return values_[n];
228 assert(n < size());
229 if (n < kSize) {
230 return values_[n];
236 assert(n < size());
237 return (*this)[n];
241 assert(n < size());
[all …]
Dfile_reader_writer_test.cc298 Read(offset, n)); in TEST_P()
312 size_t n = in TEST_P() local
315 Read(offset, n)); in TEST_P()
344 std::string Read(size_t n) { in Read() argument
349 void Skip(size_t n) { test_read_holder_->Skip(n); } in Skip() argument
393 Skip(n); in TEST_P()
395 ASSERT_EQ(str.substr(offset, std::min(n, strLen - offset)), Read(n)); in TEST_P()
397 offset = std::min(offset + n, strLen); in TEST_P()
414 size_t n = GetReadaheadSize() + in TEST_P() local
417 Skip(n); in TEST_P()
[all …]
Dhash.cc18 uint32_t Hash(const char* data, size_t n, uint32_t seed) { in Hash() argument
24 const char* limit = data + n; in Hash()
25 uint32_t h = static_cast<uint32_t>(seed ^ (n * m)); in Hash()
74 uint64_t Hash64(const char* data, size_t n, uint64_t seed) { in Hash64() argument
75 return XXH3p_64bits_withSeed(data, n, seed); in Hash64()
78 uint64_t Hash64(const char* data, size_t n) { in Hash64() argument
80 return XXH3p_64bits(data, n); in Hash64()
Dhash.h30 extern uint64_t Hash64(const char* data, size_t n, uint64_t seed);
33 extern uint64_t Hash64(const char* data, size_t n);
38 inline uint64_t NPHash64(const char* data, size_t n, uint32_t seed) { in NPHash64() argument
40 return Hash64(data, n, seed); in NPHash64()
44 inline uint64_t NPHash64(const char* data, size_t n) { in NPHash64() argument
46 return Hash64(data, n); in NPHash64()
52 extern uint32_t Hash(const char* data, size_t n, uint32_t seed);
/rocksdb-6.9/include/rocksdb/
Dslice.h41 Slice(const char* d, size_t n) : data_(d), size_(n) {} in Slice() argument
73 assert(n < size());
74 return data_[n];
85 assert(n <= size()); in remove_prefix()
86 data_ += n; in remove_prefix()
87 size_ -= n; in remove_prefix()
92 size_ -= n; in remove_suffix()
194 size_ -= n; in remove_suffix()
196 buf_->erase(size() - n, n); in remove_suffix()
204 data_ += n; in remove_prefix()
[all …]
/rocksdb-6.9/db_stress_tool/
Ddb_stress_stat.h154 void AddIterations(long n) { iterations_ += n; } in AddIterations() argument
156 void AddDeletes(long n) { deletes_ += n; } in AddDeletes() argument
158 void AddSingleDeletes(size_t n) { single_deletes_ += n; } in AddSingleDeletes() argument
160 void AddRangeDeletions(long n) { range_deletions_ += n; } in AddRangeDeletions() argument
162 void AddCoveredByRangeDeletions(long n) { covered_by_range_deletions_ += n; } in AddCoveredByRangeDeletions() argument
164 void AddErrors(long n) { errors_ += n; } in AddErrors() argument
166 void AddNumCompactFilesSucceed(long n) { num_compact_files_succeed_ += n; } in AddNumCompactFilesSucceed() argument
168 void AddNumCompactFilesFailed(long n) { num_compact_files_failed_ += n; } in AddNumCompactFilesFailed() argument
/rocksdb-6.9/db/
Dlog_test.cc29 while (result.size() < n) { in BigString()
32 result.resize(n); in BigString()
88 if (contents_.size() < n) { in Read()
89 n = contents_.size(); in Read()
315 Write(BigString("foo", n)); in TEST_P()
330 Write(BigString("foo", n)); in TEST_P()
344 Write(BigString("foo", n)); in TEST_P()
358 Write(BigString("foo", n)); in TEST_P()
631 Write(BigString("foo", n)); in TEST_P()
632 Write(BigString("bar", n)); in TEST_P()
[all …]
Dlog_writer.cc117 IOStatus Writer::EmitPhysicalRecord(RecordType t, const char* ptr, size_t n) { in EmitPhysicalRecord() argument
118 assert(n <= 0xffff); // Must fit in two bytes in EmitPhysicalRecord()
124 buf[4] = static_cast<char>(n & 0xff); in EmitPhysicalRecord()
125 buf[5] = static_cast<char>(n >> 8); in EmitPhysicalRecord()
131 assert(block_offset_ + kHeaderSize + n <= kBlockSize); in EmitPhysicalRecord()
135 assert(block_offset_ + kRecyclableHeaderSize + n <= kBlockSize); in EmitPhysicalRecord()
148 crc = crc32c::Extend(crc, ptr, n); in EmitPhysicalRecord()
155 s = dest_->Append(Slice(ptr, n)); in EmitPhysicalRecord()
157 block_offset_ += header_size + n; in EmitPhysicalRecord()
/rocksdb-6.9/memtable/
Dskiplist.h175 Node* Next(int n) {
176 assert(n >= 0);
181 void SetNext(int n, Node* x) {
182 assert(n >= 0);
185 next_[n].store(x, std::memory_order_release);
189 Node* NoBarrier_Next(int n) {
190 assert(n >= 0);
193 void NoBarrier_SetNext(int n, Node* x) {
194 assert(n >= 0);
195 next_[n].store(x, std::memory_order_relaxed);
[all …]
Dinlineskiplist.h313 Node* Next(int n) {
314 assert(n >= 0);
321 assert(n >= 0);
328 assert(n >= 0);
333 Node* NoBarrier_Next(int n) {
334 assert(n >= 0);
339 assert(n >= 0);
448 assert(n != head_);
449 return (n != nullptr) && (compare_(n->Key(), key) < 0);
456 assert(n != head_);
[all …]
Dhash_linklist_rep.cc34 explicit BucketHeader(void* n, uint32_t count) in BucketHeader()
35 : next(n), num_entries(count) {} in BucketHeader()
238 bool KeyIsAfterNode(const Slice& internal_key, const Node* n) const { in KeyIsAfterNode()
240 return (n != nullptr) && (compare_(n->key, internal_key) < 0); in KeyIsAfterNode()
243 bool KeyIsAfterNode(const Key& key, const Node* n) const { in KeyIsAfterNode()
245 return (n != nullptr) && (compare_(n->key, key) < 0); in KeyIsAfterNode()
248 bool KeyIsAfterOrAtNode(const Slice& internal_key, const Node* n) const { in KeyIsAfterOrAtNode()
250 return (n != nullptr) && (compare_(n->key, internal_key) <= 0); in KeyIsAfterOrAtNode()
253 bool KeyIsAfterOrAtNode(const Key& key, const Node* n) const { in KeyIsAfterOrAtNode()
255 return (n != nullptr) && (compare_(n->key, key) <= 0); in KeyIsAfterOrAtNode()
/rocksdb-6.9/env/
Denv_encryption.cc64 Status Skip(uint64_t n) override { in Skip() argument
65 auto status = file_->Skip(n); in Skip()
69 offset_ += n; in Skip()
707 if (n != blockSize) { in Encrypt()
726 dataSize -= n; in Encrypt()
730 data += n; in Encrypt()
752 if (n != blockSize) { in Decrypt()
774 assert(dataSize >= n); in Decrypt()
775 if (dataSize < n) { in Decrypt()
779 dataSize -= n; in Decrypt()
[all …]
Dio_posix.cc241 if (r < n) { in Read()
266 size_t left = n; in PositionedRead()
577 size_t left = n; in Read()
740 r = readahead(fd_, offset, n); in Prefetch()
750 ToString(n), in Prefetch()
847 } else if (offset + n > length_) { in Read()
1002 memcpy(dst_, src, n); in Append()
1003 dst_ += n; in Append()
1004 src += n; in Append()
1005 left -= n; in Append()
[all …]
Dmock_env.cc107 if (n > available) { in Read()
108 n = static_cast<size_t>(available); in Read()
110 if (n == 0) { in Read()
115 memcpy(scratch, &(data_[offset_]), n); in Read()
116 *result = Slice(scratch, n); in Read()
118 *result = Slice(&(data_[offset_]), n); in Read()
196 Status Skip(uint64_t n) override { in Skip() argument
201 if (n > available) { in Skip()
202 n = available; in Skip()
204 pos_ += static_cast<size_t>(n); in Skip()
[all …]
/rocksdb-6.9/port/win/
Dio_win.cc220 } else if (offset + n > length_) { in Read()
221 n = length_ - static_cast<size_t>(offset); in Read()
402 size_t n = std::min(left, avail); in Append() local
403 memcpy(dst_, src, n); in Append()
404 dst_ += n; in Append()
405 src += n; in Append()
406 left -= n; in Append()
583 if (n > std::numeric_limits<DWORD>::max()) { in Read()
620 !IsSectorAligned(n)) { in PositionedRead()
632 Status WinSequentialFile::Skip(uint64_t n) { in Skip() argument
[all …]
/rocksdb-6.9/CMakeFiles/3.30.5/CompilerIdC/
DCMakeCCompilerId.c749 #define DEC(n) \ argument
757 ('0' + ((n) % 10))
760 #define HEX(n) \ argument
761 ('0' + ((n)>>28 & 0xF)), \
762 ('0' + ((n)>>24 & 0xF)), \
763 ('0' + ((n)>>20 & 0xF)), \
764 ('0' + ((n)>>16 & 0xF)), \
765 ('0' + ((n)>>12 & 0xF)), \
766 ('0' + ((n)>>8 & 0xF)), \
767 ('0' + ((n)>>4 & 0xF)), \
[all …]
/rocksdb-6.9/CMakeFiles/3.30.5/CompilerIdCXX/
DCMakeCXXCompilerId.cpp728 #define DEC(n) \ argument
736 ('0' + ((n) % 10))
739 #define HEX(n) \ argument
740 ('0' + ((n)>>28 & 0xF)), \
741 ('0' + ((n)>>24 & 0xF)), \
742 ('0' + ((n)>>20 & 0xF)), \
743 ('0' + ((n)>>16 & 0xF)), \
744 ('0' + ((n)>>12 & 0xF)), \
745 ('0' + ((n)>>8 & 0xF)), \
746 ('0' + ((n)>>4 & 0xF)), \
[all …]
/rocksdb-6.9/utilities/persistent_cache/
Dhash_table_bench.cc132 void StartThreads(const size_t n, void (*fn)(void*)) { in StartThreads() argument
134 for (size_t i = 0; i < n; ++i) { in StartThreads()
229 Node n(key, val); in Insert() local
230 return impl_.Insert(n); in Insert()
234 Node n(key, string()); in Erase() local
235 return impl_.Erase(n, nullptr); in Erase()
239 Node n(key, string()); in Lookup() local
241 bool status = impl_.Find(n, &n, &rlock); in Lookup()
244 *val = n.val_; in Lookup()
/rocksdb-6.9/table/
Dformat.cc357 if (!Snappy_GetUncompressedLength(data, n, &ulength)) { in UncompressBlockContentsForCompressionType()
361 if (!Snappy_Uncompress(data, n, ubuf.get())) { in UncompressBlockContentsForCompressionType()
369 uncompression_info, data, n, &decompress_size, in UncompressBlockContentsForCompressionType()
381 data, n, &decompress_size, in UncompressBlockContentsForCompressionType()
393 uncompression_info, data, n, &decompress_size, in UncompressBlockContentsForCompressionType()
405 uncompression_info, data, n, &decompress_size, in UncompressBlockContentsForCompressionType()
418 ubuf.reset(XPRESS_Uncompress(data, n, &decompress_size)); in UncompressBlockContentsForCompressionType()
429 ubuf = ZSTD_Uncompress(uncompression_info, data, n, &decompress_size, in UncompressBlockContentsForCompressionType()
461 const char* data, size_t n, in UncompressBlockContents() argument
465 assert(data[n] != kNoCompression); in UncompressBlockContents()
[all …]
Dmerging_iterator.cc40 InternalIterator** children, int n, bool is_arena_mode, in MergingIterator() argument
49 children_.resize(n); in MergingIterator()
50 for (int i = 0; i < n; i++) { in MergingIterator()
409 InternalIterator** list, int n, in NewMergingIterator() argument
411 assert(n >= 0); in NewMergingIterator()
412 if (n == 0) { in NewMergingIterator()
414 } else if (n == 1) { in NewMergingIterator()
418 return new MergingIterator(cmp, list, n, false, prefix_seek_mode); in NewMergingIterator()
421 return new (mem) MergingIterator(cmp, list, n, true, prefix_seek_mode); in NewMergingIterator()
/rocksdb-6.9/utilities/
Denv_mirror.cc24 Status Read(size_t n, Slice* result, char* scratch) override { in Read() argument
26 Status as = a_->Read(n, &aslice, scratch); in Read()
28 char* bscratch = new char[n]; in Read()
42 Status bs = b_->Read(n, result, scratch); in Read()
48 Status Skip(uint64_t n) override { in Skip() argument
49 Status as = a_->Skip(n); in Skip()
50 Status bs = b_->Skip(n); in Skip()
68 Status Read(uint64_t offset, size_t n, Slice* result, in Read() argument
70 Status as = a_->Read(offset, n, result, scratch); in Read()
72 char* bscratch = new char[n]; in Read()
[all …]

123456