| /rocksdb-6.9/util/ |
| D | xxh3p.h | 443 XXH_ASSERT(1 <= len && len <= 3); in XXH3p_len_1to3_64b() 460 XXH_ASSERT(4 <= len && len <= 8); in XXH3p_len_4to8_64b() 475 XXH_ASSERT(9 <= len && len <= 16); in XXH3p_len_9to16_64b() 489 if (len) return XXH3p_len_1to3_64b(input, len, secret, seed); in XXH3p_len_0to16_64b() 1014 XXH_ASSERT(16 < len && len <= 128); in XXH3p_len_17to128_64b() 1044 XXH_ASSERT(128 < len && len <= XXH3p_MIDSIZE_MAX); in XXH3p_len_129to240_64b() 1111 XXH_ASSERT(1 <= len && len <= 3); in XXH3p_len_1to3_128b() 1133 XXH_ASSERT(4 <= len && len <= 8); in XXH3p_len_4to8_128b() 1154 XXH_ASSERT(9 <= len && len <= 16); in XXH3p_len_9to16_128b() 1241 XXH_ASSERT(128 < len && len <= XXH3p_MIDSIZE_MAX); in XXH3p_len_129to240_128b() [all …]
|
| D | crc32c_ppc.c | 19 unsigned long len) { in crc32_align() argument 27 unsigned long len); 30 unsigned len) { in crc32_vpmsum() argument 38 if (len < VMX_ALIGN + VMX_ALIGN_MASK) { in crc32_vpmsum() 39 crc = crc32_align(crc, data, (unsigned long)len); in crc32_vpmsum() 46 len -= prealign; in crc32_vpmsum() 52 tail = len & VMX_ALIGN_MASK; in crc32_vpmsum() 54 data += len & ~VMX_ALIGN_MASK; in crc32_vpmsum() 74 buf2 = (unsigned char *)malloc(len); in crc32c_ppc() 75 bzero(buf2, len); in crc32c_ppc() [all …]
|
| D | xxhash.cc | 401 len &= 15; in XXH32_finalize() 404 len -= 4; in XXH32_finalize() 408 --len; in XXH32_finalize() 476 len=0; in XXH32_endian_align() 481 if (len>=16) { in XXH32_endian_align() 826 len &= 31; in XXH64_finalize() 829 len -= 8; in XXH64_finalize() 833 len -= 4; in XXH64_finalize() 837 --len; in XXH64_finalize() 960 len=0; in XXH64_endian_align() [all …]
|
| D | murmurhash.cc | 36 uint64_t h = seed ^ (len * m); in MurmurHash64A() 39 const uint64_t * end = data + (len/8); in MurmurHash64A() 55 switch(len & 7) in MurmurHash64A() 99 unsigned int h = seed ^ len; in MurmurHash2() 105 while(len >= 4) in MurmurHash2() 117 len -= 4; in MurmurHash2() 122 switch(len) in MurmurHash2() 152 unsigned int h = seed ^ len; in MurmurHashNeutral2() 156 while(len >= 4) in MurmurHashNeutral2() 173 len -= 4; in MurmurHashNeutral2() [all …]
|
| D | coding.h | 334 int len = 1; in VarintLength() local 337 len++; in VarintLength() 339 return len; in VarintLength() 417 uint32_t len = 0; in GetLengthPrefixedSlice() local 418 if (GetVarint32(input, &len) && input->size() >= len) { in GetLengthPrefixedSlice() 420 input->remove_prefix(len); in GetLengthPrefixedSlice() 428 uint32_t len = 0; in GetLengthPrefixedSlice() local 432 return Slice(p, len); in GetLengthPrefixedSlice() 436 uint32_t len = 0; in GetSliceUntil() local 437 for (len = 0; len < slice->size() && slice->data()[len] != delimiter; ++len) { in GetSliceUntil() [all …]
|
| D | string_util.cc | 42 int AppendHumanMicros(uint64_t micros, char* output, int len, in AppendHumanMicros() argument 45 return snprintf(output, len, "%" PRIu64 " us", micros); in AppendHumanMicros() 47 return snprintf(output, len, "%.3lf ms", in AppendHumanMicros() 50 return snprintf(output, len, "%.3lf sec", in AppendHumanMicros() 53 return snprintf(output, len, "%02" PRIu64 ":%05.3f M:S", in AppendHumanMicros() 67 int AppendHumanBytes(uint64_t bytes, char* output, int len) { in AppendHumanBytes() argument 70 return snprintf(output, len, "%" PRIu64 "TB", bytes >> 40); in AppendHumanBytes() 72 return snprintf(output, len, "%" PRIu64 "GB", bytes >> 30); in AppendHumanBytes() 74 return snprintf(output, len, "%" PRIu64 "MB", bytes >> 20); in AppendHumanBytes() 76 return snprintf(output, len, "%" PRIu64 "KB", bytes >> 10); in AppendHumanBytes() [all …]
|
| D | slice.cc | 50 bool FullLengthEnabled(size_t* len) const override { in FullLengthEnabled() 51 *len = prefix_len_; in FullLengthEnabled() 88 bool FullLengthEnabled(size_t* len) const override { in FullLengthEnabled() 89 *len = cap_len_; in FullLengthEnabled() 175 std::string::size_type len = size_; in DecodeHex() local 176 if (len % 2) { in DecodeHex() 184 result->reserve(len / 2); in DecodeHex() 186 for (size_t i = 0; i < len;) { in DecodeHex()
|
| D | autovector.h | 101 self_type operator-(difference_type len) const { 102 return self_type(vect_, index_ - len); 110 self_type operator+(difference_type len) const { 111 return self_type(vect_, index_ + len); 114 self_type& operator+=(difference_type len) { 115 index_ += len; 119 self_type& operator-=(difference_type len) { 120 index_ -= len; 135 reference operator[](difference_type len) const { 136 return *(*this + len);
|
| D | crc32c.cc | 637 size_t len, in align_to_8() argument 641 if (len & 0x04) { in align_to_8() 645 if (len & 0x02) { in align_to_8() 649 if (len & 0x01) { in align_to_8() 694 if (len >= 8) { in crc32c_3way() 696 if (len > 216) { in crc32c_3way() 700 len -= align_bytes; in crc32c_3way() 705 count = len / 24; // number of triplets in crc32c_3way() 706 len %= 24; // bytes remaining in crc32c_3way() 1127 len = len & 7; in crc32c_3way() [all …]
|
| D | coding_test.cc | 164 for (unsigned int len = 0; len < s.size() - 1; len++) { in TEST() local 165 ASSERT_TRUE(GetVarint32Ptr(s.data(), s.data() + len, &result) == nullptr); in TEST() 184 for (unsigned int len = 0; len < s.size() - 1; len++) { in TEST() local 185 ASSERT_TRUE(GetVarint64Ptr(s.data(), s.data() + len, &result) == nullptr); in TEST()
|
| /rocksdb-6.9/java/rocksjni/ |
| D | slice.cc | 36 const size_t len = strlen(str); in Java_org_rocksdb_AbstractSlice_createNewSliceFromString() local 41 char* buf = new char[len + 1]; in Java_org_rocksdb_AbstractSlice_createNewSliceFromString() 42 memcpy(buf, str, len); in Java_org_rocksdb_AbstractSlice_createNewSliceFromString() 43 buf[len] = 0; in Java_org_rocksdb_AbstractSlice_createNewSliceFromString() 135 const int len = dataSize - offset; in Java_org_rocksdb_Slice_createNewSlice0() local 139 jbyte* buf = new jbyte[len]; in Java_org_rocksdb_Slice_createNewSlice0() 162 const int len = env->GetArrayLength(data) + 1; in Java_org_rocksdb_Slice_createNewSlice1() local 166 char* buf = new char[len]; in Java_org_rocksdb_Slice_createNewSlice1() 167 memcpy(buf, ptrData, len - 1); in Java_org_rocksdb_Slice_createNewSlice1() 168 buf[len - 1] = '\0'; in Java_org_rocksdb_Slice_createNewSlice1() [all …]
|
| /rocksdb-6.9/java/src/main/java/org/rocksdb/ |
| D | RocksDB.java | 637 checkBounds(offset, len, key.length); in put() 687 checkBounds(offset, len, key.length); in put() 732 checkBounds(offset, len, key.length); in put() 839 checkBounds(offset, len, key.length); in put() 2397 final int offset, final int len, in keyMayExist() argument 2517 key, offset, len, valueHolder); in keyMayExist() 2584 key, offset, len); in keyMayExist() 2590 key, offset, len); in keyMayExist() 4197 final int len = objectList.size(); in toNativeHandleList() local 4199 for (int i = 0; i < len; i++) { in toNativeHandleList() [all …]
|
| /rocksdb-6.9/tools/block_cache_analyzer/ |
| D | block_cache_pysim.py | 215 index = hash % len(self.table) 350 p95_index = min(int(0.95 * float(len(miss_bytes))), len(miss_bytes) - 1) 1028 if len(self.policies) == 1: 1076 if len(self.policies) == 1: 1177 return len(self.table) 1334 return len(self.od) 1408 self.p = min(self.c, self.p + max(len(self.b2) / len(self.b1), 1)) 1417 self.p = max(0, self.p - max(len(self.b1) / len(self.b2), 1)) 1425 while len(self.t1) + len(self.b1) >= self.c and self.b1: 1428 total = len(self.t1) + len(self.b1) + len(self.t2) + len(self.b2) [all …]
|
| D | block_cache_trace_analyzer_plot.py | 138 for i in range(len(label)): 160 for i in range(1, len(data_rows[0])): 163 for i in range(1, len(data_rows)): 164 for j in range(len(data_rows[i])): 182 for i in range(1, len(data_rows)): 185 for i in range(1, len(data_rows[0])): 187 for i in range(1, len(data_rows)): 224 if len(x) == 0 or len(labels) == 0: 274 if len(x) == 0 or len(label_stats) == 0: 360 label = label[: len(label) - len("_correlation_input")] [all …]
|
| /rocksdb-6.9/java/samples/src/main/java/ |
| D | RocksDBSample.java | 191 int len; in main() local 193 assert (len > insufficientArray.length); in main() 195 assert (len == RocksDB.NOT_FOUND); in main() 196 len = db.get(testKey, enoughArray); in main() 197 assert (len == testValue.length); in main() 202 assert (len == RocksDB.NOT_FOUND); in main() 204 assert (len == testValue.length); in main() 207 len = db.get(testKey, enoughArray); in main() 208 assert (len == RocksDB.NOT_FOUND); in main() 215 len = db.get(testKey, enoughArray); in main() [all …]
|
| /rocksdb-6.9/db/compaction/ |
| D | compaction.cc | 404 int len = 0; in InputLevelSummary() local 411 len += in InputLevelSummary() 412 snprintf(scratch->buffer + len, sizeof(scratch->buffer) - len, " + "); in InputLevelSummary() 413 len = std::min(len, static_cast<int>(sizeof(scratch->buffer))); in InputLevelSummary() 417 len += snprintf(scratch->buffer + len, sizeof(scratch->buffer) - len, in InputLevelSummary() 420 len = std::min(len, static_cast<int>(sizeof(scratch->buffer))); in InputLevelSummary() 422 snprintf(scratch->buffer + len, sizeof(scratch->buffer) - len, in InputLevelSummary() 450 int len) { in InputSummary() argument 454 int sz = len - write; in InputSummary() 472 if (write < 0 || write >= len) { in Summary() [all …]
|
| /rocksdb-6.9/table/block_based/ |
| D | filter_policy.cc | 59 uint32_t len = len_with_metadata - 5; in Finish() local 60 if (len > 0) { in Finish() 61 AddAllEntries(data, len); in Finish() 66 data[len] = static_cast<char>(-1); in Finish() 68 data[len + 1] = static_cast<char>(0); in Finish() 516 const size_t len = bloom_filter.size(); in KeyMayMatch() local 517 if (len < 2 || len > 0xffffffffU) { in KeyMayMatch() 649 uint32_t len = len_with_meta - 5; in GetFilterBitsReader() local 650 assert(len > 0); in GetFilterBitsReader() 683 uint32_t len = len_with_meta - 5; in GetBloomBitsReader() local [all …]
|
| /rocksdb-6.9/file/ |
| D | random_access_file_reader_test.cc | 71 ASSERT_EQ(r.len, r.result.size()); in AssertResult() 128 r0.len = alignment() / 4; in TEST_F() 133 r1.len = alignment() / 2; in TEST_F() 159 r0.len = alignment() / 4; in TEST_F() 164 r1.len = alignment(); in TEST_F() 169 r2.len = alignment() / 4; in TEST_F() 196 r0.len = alignment() / 2; in TEST_F() 201 r1.len = alignment() / 2; in TEST_F() 206 r2.len = alignment() / 2; in TEST_F() 231 r0.len = alignment() / 2; in TEST_F() [all …]
|
| D | random_access_file_reader.cc | 158 return static_cast<size_t>(r.offset) + r.len; in End() 165 req.len = Roundup(End(r), alignment) - req.offset; in Align() 185 dest->len = std::max(dest_end, src_end) - dest->offset; in TryMerge() 224 total_len += r.len; in MultiRead() 232 scratch += r.len; in MultiRead() 265 size_t len = std::min(r.len, static_cast<size_t>(fs_r.len - offset)); in MultiRead() local 266 r.result = Slice(fs_r.scratch + offset, len); in MultiRead()
|
| /rocksdb-6.9/table/plain/ |
| D | plain_table_factory.cc | 105 size_t len = opts_list.size(); in GetMemTableRepFactoryFromString() local 117 if (2 == len) { in GetMemTableRepFactoryFromString() 120 } else if (1 == len) { in GetMemTableRepFactoryFromString() 126 if (2 == len) { in GetMemTableRepFactoryFromString() 129 } else if (1 == len) { in GetMemTableRepFactoryFromString() 135 if (2 == len) { in GetMemTableRepFactoryFromString() 138 } else if (1 == len) { in GetMemTableRepFactoryFromString() 144 if (2 == len) { in GetMemTableRepFactoryFromString() 147 } else if (1 == len) { in GetMemTableRepFactoryFromString()
|
| D | plain_table_key_coding.cc | 101 auto len = ptr - key_size_buf; in AppendKey() local 102 IOStatus io_s = file->Append(Slice(key_size_buf, len)); in AppendKey() 106 *offset += len; in AppendKey() 172 uint32_t len) { in GetFromBuffer() argument 173 assert(file_offset + len <= file_info_->data_end_offset); in GetFromBuffer() 175 len); in GetFromBuffer() 178 bool PlainTableFileReader::ReadNonMmap(uint32_t file_offset, uint32_t len, in ReadNonMmap() argument 187 *out = GetFromBuffer(buffer, file_offset, len); in ReadNonMmap() 204 assert(file_offset + len <= file_info_->data_end_offset); in ReadNonMmap() 206 std::max(kPrefetchSize, len)); in ReadNonMmap() [all …]
|
| D | plain_table_key_coding.h | 90 bool Read(uint32_t file_offset, uint32_t len, Slice* out) { in Read() argument 92 assert(file_offset + len <= file_info_->data_end_offset); in Read() 93 *out = Slice(file_info_->file_data.data() + file_offset, len); in Read() 96 return ReadNonMmap(file_offset, len, out); in Read() 101 bool ReadNonMmap(uint32_t file_offset, uint32_t len, Slice* output); 132 Slice GetFromBuffer(Buffer* buf, uint32_t file_offset, uint32_t len);
|
| /rocksdb-6.9/java/src/test/java/org/rocksdb/ |
| D | KeyMayExistTest.java | 60 final int len = builder.toString().length() - offset; in keyMayExist() local 65 db.put(sliceKey, offset, len, sliceValue, 0, sliceValue.length); in keyMayExist() 67 exists = db.keyMayExist(sliceKey, offset, len, holder); in keyMayExist() 72 exists = db.keyMayExist(sliceKey, offset, len, null); in keyMayExist() 85 exists = db.keyMayExist(readOptions, sliceKey, offset, len, holder); in keyMayExist() 90 exists = db.keyMayExist(readOptions, sliceKey, offset, len, null); in keyMayExist() 106 exists = db.keyMayExist(columnFamilyHandleList.get(0), sliceKey, offset, len, in keyMayExist() 112 exists = db.keyMayExist(columnFamilyHandleList.get(0), sliceKey, offset, len, in keyMayExist() 130 sliceKey, offset, len, holder); in keyMayExist() 136 sliceKey, offset, len, null); in keyMayExist()
|
| /rocksdb-6.9/test_util/ |
| D | testutil.cc | 30 Slice RandomString(Random* rnd, int len, std::string* dst) { in RandomString() argument 31 dst->resize(len); in RandomString() 32 for (int i = 0; i < len; i++) { in RandomString() 40 ret.resize(len); in RandomHumanReadableString() 41 for (int i = 0; i < len; ++i) { in RandomHumanReadableString() 53 for (int i = 0; i < len; i++) { in RandomKey() 76 int raw = static_cast<int>(len * compressed_fraction); in CompressibleString() 83 while (dst->size() < (unsigned int)len) { in CompressibleString() 86 dst->resize(len); in CompressibleString() 162 std::string RandomName(Random* rnd, const size_t len) { in RandomName() argument [all …]
|
| /rocksdb-6.9/buckifier/ |
| D | buckify_rocksdb.py | 46 if len(line) == 0 or line[0] == '#': 61 root = root[(len(repo_path) + 1):] 120 if len(sys.argv) < 2: 183 if len(match_src) == 0: 186 elif len(match_src) > 1: 191 assert(len(match_src) == 1)
|