Home
last modified time | relevance | path

Searched refs:data_ (Results 1 – 25 of 32) sorted by relevance

12

/rocksdb-6.9/util/
Dheap.h47 data_.push_back(value); in push()
58 return data_.front(); in top()
63 data_.front() = value; in replace_top()
75 data_.front() = std::move(data_.back()); in pop()
76 data_.pop_back(); in pop()
86 data_.swap(other.data_); in swap()
91 data_.clear(); in clear()
114 data_[index] = std::move(data_[parent]); in upheap()
136 cmp_(data_[left_child], data_[right_child])) { in downheap()
142 data_[index] = std::move(data_[picked_child]); in downheap()
[all …]
Dslice.cc152 data_ = buf->data(); in Slice()
162 unsigned char c = data_[i]; in ToString()
168 result.assign(data_, size_); in ToString()
187 int h1 = fromHex(data_[i++]); in DecodeHex()
191 int h2 = fromHex(data_[i++]); in DecodeHex()
223 data_ = other.data_; in operator =()
229 data_ = buf_->data(); in operator =()
232 data_ = other.data_; in operator =()
Ddynamic_bloom.h83 std::atomic<uint64_t>* data_; variable
130 PREFETCH(data_ + a, 0, 3); in MayContain()
146 PREFETCH(data_ + a, 0, 3); in Prefetch()
175 PREFETCH(data_ + a, 0, 3); in MayContainHash()
186 uint64_t val = data_[byte_offset ^ i].load(std::memory_order_relaxed); in DoubleProbe()
199 PREFETCH(data_ + a, 0, 3); in AddHash()
206 or_func(&data_[a ^ i], mask); in AddHash()
Dcore_local.h39 std::unique_ptr<T[]> data_;
51 data_.reset(new T[static_cast<size_t>(1) << size_shift_]); in CoreLocalArray()
80 return &data_[core_idx]; in AccessAtCore()
Dbloom_test.cc740 std::array<char, 3000> data_; member
744 RawFilterTester() : metadata_ptr_(&*(data_.end() - 5)) {} in RawFilterTester()
751 assert(len <= data_.size()); in ResetNoFill()
757 data_.fill(fill_ones ? 0xff : 0); in Reset()
763 for (uint32_t i = 0; i < data_.size(); ++i) { in ResetWeirdFill()
764 data_[i] = static_cast<char>(0x7b7b >> (i % 7)); in ResetWeirdFill()
Ddynamic_bloom.cc67 data_ = reinterpret_cast<std::atomic<uint64_t>*>(raw); in DynamicBloom()
/rocksdb-6.9/include/rocksdb/
Dslice.h74 return data_[n];
79 data_ = ""; in clear()
86 data_ += n; in remove_prefix()
126 (memcmp(data_ + size_ - x.size_, x.data_, x.size_) == 0)); in ends_with()
133 const char* data_; variable
161 data_ = s.data(); in PinSlice()
170 data_ = s.data(); in PinSlice()
204 data_ += n; in remove_prefix()
248 assert(data_ != nullptr && b.data_ != nullptr); in compare()
250 int r = memcmp(data_, b.data_, min_len); in compare()
[all …]
/rocksdb-6.9/port/win/
Dwin_thread.cc42 data_ = std::make_shared<Data>(std::move(func)); in Init()
49 data_->handle_ = _beginthreadex(NULL, in Init()
56 if (data_->handle_ == 0) { in Init()
65 data_(nullptr), in WindowsThread()
74 if (data_) { in ~WindowsThread()
79 data_.reset(); in ~WindowsThread()
95 data_ = std::move(o.data_); in operator =()
104 return (data_ && data_->handle_ != 0); in joinable()
149 data_->handle_ = 0; in join()
162 data_->handle_ = 0; in detach()
[all …]
Dport_win.cc135 RX_WIN32_FIND_DATA data_; member
165 &dir->data_, FindExSearchNameMatch, in opendir()
173 RX_FILESTRING x(dir->data_.cFileName, RX_FNLEN(dir->data_.cFileName)); in opendir()
190 auto ret = RX_FindNextFile(dirp->handle_, &dirp->data_); in readdir()
196 RX_FILESTRING x(dirp->data_.cFileName, RX_FNLEN(dirp->data_.cFileName)); in readdir()
Dwin_thread.h33 std::shared_ptr<Data> data_; variable
/rocksdb-6.9/table/block_based/
Dblock.cc242 if (data_ == nullptr) { // Not init yet in Seek()
323 limit = data_ + restarts_; in SeekForGetImpl()
384 if (data_ == nullptr) { // Not init yet in Seek()
421 if (data_ == nullptr) { // Not init yet in SeekForPrev()
446 if (data_ == nullptr) { // Not init yet in SeekToFirst()
503 const char* p = data_ + current_; in ParseNextDataKey()
573 const char* p = data_ + current_; in ParseNextIndexKey()
676 data_ + region_offset, data_ + restarts_, &shared, &non_shared); in BinarySeek()
707 ? DecodeKeyV4()(data_ + region_offset, data_ + restarts_, &shared, in CompareBlockKey()
709 : DecodeKey()(data_ + region_offset, data_ + restarts_, &shared, in CompareBlockKey()
[all …]
Dblock.h163 const char* data() const { return data_; } in data()
223 const char* data_; // contents_.data.data() variable
237 assert(data_ == nullptr); // Ensure it is called only once in InitializeBase()
241 data_ = data; in InitializeBase()
258 data_ = nullptr; in InvalidateBase()
294 return static_cast<uint32_t>(value_.data() - data_); in ValueOffset()
305 const char* data_; // underlying block contents variable
335 return static_cast<uint32_t>((value_.data() + value_.size()) - data_); in NextEntryOffset()
340 return DecodeFixed32(data_ + restarts_ + index * sizeof(uint32_t)); in GetRestartPoint()
350 value_ = Slice(data_ + offset, 0); in SeekToRestartPoint()
Dfilter_policy.cc160 : data_(data), num_probes_(num_probes), len_bytes_(len_bytes) {} in FastLocalBloomBitsReader()
171 FastLocalBloomImpl::PrepareHash(Lower32of64(h), len_bytes_, data_, in MayMatch()
174 data_ + byte_offset); in MayMatch()
182 FastLocalBloomImpl::PrepareHash(Lower32of64(h), len_bytes_, data_, in MayMatch()
188 hashes[i], num_probes_, data_ + byte_offsets[i]); in MayMatch()
193 const char* data_; member in ROCKSDB_NAMESPACE::__anona271d7140111::FastLocalBloomBitsReader
386 : data_(data), in LegacyBloomBitsReader()
408 hash, num_probes_, data_ + byte_offset, log2_cache_line_size_); in MayMatch()
416 LegacyBloomImpl::PrepareHashMayMatch(hashes[i], num_lines_, data_, in MayMatch()
422 hashes[i], num_probes_, data_ + byte_offsets[i], in MayMatch()
[all …]
Dfull_filter_block_test.cc55 : data_(contents.data()), len_(static_cast<uint32_t>(contents.size())) {} in TestFilterBitsReader()
62 if (h == DecodeFixed32(data_ + i)) { in MayMatch()
70 const char* data_; member in ROCKSDB_NAMESPACE::TestFilterBitsReader
/rocksdb-6.9/table/plain/
Dplain_table_bloom.h56 Slice GetRawData() const { return Slice(data_, GetTotalBits() / 8); } in GetRawData()
69 char* data_; variable
84 h, kNumBlocks, data_, &ignored, LOG2_CACHE_LINE_SIZE); in Prefetch()
95 h, kNumBlocks, kNumProbes, data_, LOG2_CACHE_LINE_SIZE); in MayContainHash()
98 data_); in MayContainHash()
105 LegacyLocalityBloomImpl<true>::AddHash(h, kNumBlocks, kNumProbes, data_, in AddHash()
108 LegacyNoLocalityBloomImpl::AddHash(h, kTotalBits, kNumProbes, data_); in AddHash()
Dplain_table_bloom.cc33 : kTotalBits(0), kNumBlocks(0), kNumProbes(num_probes), data_(nullptr) {} in PlainTableBloomV1()
37 data_ = raw_data; in SetRawData()
65 data_ = raw; in SetTotalBits()
/rocksdb-6.9/utilities/merge_operators/
Dsortlist.cc59 const char* begin = slice.data_; in MakeVector()
60 while (*slice.data_ != ',' && *slice.data_) slice.data_++; in MakeVector()
61 operand.push_back(std::stoi(std::string(begin, slice.data_))); in MakeVector()
62 } while (0 != *slice.data_++); in MakeVector()
/rocksdb-6.9/env/
Dmock_env.cc84 data_.resize(size); in Truncate()
99 data_[static_cast<size_t>(pos)] = static_cast<char>(rnd_.Uniform(256)); in CorruptBuffer()
115 memcpy(scratch, &(data_[offset_]), n); in Read()
118 *result = Slice(&(data_[offset_]), n); in Read()
126 if (offset + data.size() > data_.size()) { in Write()
127 data_.resize(offset_ + data.size()); in Write()
129 data_.replace(offset_, data.size(), data.data(), data.size()); in Write()
130 size_ = data_.size(); in Write()
137 data_.append(data.data(), data.size()); in Append()
138 size_ = data_.size(); in Append()
[all …]
/rocksdb-6.9/java/rocksjni/
Dslice.cc214 const char* buf = slice->data_ - internalBufferOffset; in Java_org_rocksdb_Slice_clear0()
240 const char* buf = slice->data_ - internalBufferOffset; in Java_org_rocksdb_Slice_disposeInternalBuf()
329 const char* buf = slice->data_ - internalBufferOffset; in Java_org_rocksdb_DirectSlice_clear0()
356 const char* buf = slice->data_ - internalBufferOffset; in Java_org_rocksdb_DirectSlice_disposeInternalBuf()
/rocksdb-6.9/utilities/persistent_cache/
Dblock_cache_tier.h91 : key_(std::move(key)), data_(data) {} in InsertOp()
99 size_t Size() { return data_.size() + key_.size(); } in Size()
102 std::string data_; member
/rocksdb-6.9/db/
Ddb_iter_test.cc40 data_.reserve(16); in TestIterator()
67 data_.push_back( in Add()
82 std::sort(data_.begin(), data_.end(), in Finish()
100 for (auto it = data_.begin(); it != data_.end(); ++it) { in Vanish()
110 data_.erase(it); in Vanish()
128 valid_ = (data_.size() > 0); in SeekToFirst()
136 valid_ = (data_.size() > 0); in SeekToLast()
137 iter_ = data_.size() - 1; in SeekToLast()
193 return data_[iter_].first; in key()
198 return data_[iter_].second; in value()
[all …]
/rocksdb-6.9/memtable/
Dmemtablerep_bench.cc137 std::string data_; member in ROCKSDB_NAMESPACE::RandomGenerator
144 test::RandomString(&rnd, size, &data_); in RandomGenerator()
149 assert(len <= data_.size()); in Generate()
150 if (pos_ + len > data_.size()) { in Generate()
154 return Slice(data_.data() + pos_ - len, len); in Generate()
/rocksdb-6.9/third-party/folly/folly/synchronization/
DParkingLot.h154 const Data data_; member
158 : WaitNodeBase(key, lotid), data_(std::forward<D>(data)) {} in WaitNode()
302 auto result = std::forward<Func>(func)(node->data_); in unpark()
/rocksdb-6.9/test_util/
Dtestutil.h534 : data_(data), offset_(0), read_count_(read_count) {} in SeqStringSource()
538 if (offset_ < data_.size()) { in Read()
539 n = std::min(data_.size() - offset_, n); in Read()
540 memcpy(scratch, data_.data() + offset_, n); in Read()
551 if (offset_ >= data_.size()) { in Skip()
561 std::string data_;
/rocksdb-6.9/java/benchmark/src/main/java/org/rocksdb/benchmark/
DDbBenchmark.java1549 private final byte[] data_; field in DbBenchmark.RandomGenerator
1562 data_ = new byte[dataLength_]; in RandomGenerator()
1567 System.arraycopy(value, 0, data_, pos, in RandomGenerator()
1593 if (position_ + value.length > data_.length) { in generate()
1595 assert(value.length <= data_.length); in generate()
1598 System.arraycopy(data_, position_ - value.length, in generate()

12