| /third_party/elfio/elfio/ |
| H A D | elfio_symbols.hpp | 362 uint32_t bucket = hash % nbuckets; in gnu_hash_lookup()
371 if ( convertor( buckets[bucket] ) >= symoffset ) { in gnu_hash_lookup()
372 uint32_t chain_index = convertor( buckets[bucket] ) - symoffset; in gnu_hash_lookup()
|
| /third_party/musl/src/network/liteos_a/ |
| H A D | getifaddrs.c | 164 unsigned int bucket = ifs->index % IFADDRS_HASH_SIZE; in netlink_msg_to_ifaddr() local
165 ifs->hash_next = ctx->hash[bucket]; in netlink_msg_to_ifaddr()
166 ctx->hash[bucket] = ifs; in netlink_msg_to_ifaddr()
|
| /third_party/musl/porting/liteos_a/user/src/network/ |
| H A D | getifaddrs.c | 164 unsigned int bucket = ifs->index % IFADDRS_HASH_SIZE; in netlink_msg_to_ifaddr() local
165 ifs->hash_next = ctx->hash[bucket]; in netlink_msg_to_ifaddr()
166 ctx->hash[bucket] = ifs; in netlink_msg_to_ifaddr()
|
| /third_party/node/deps/v8/tools/profview/ |
| H A D | profview.js | 303 let bucket = bucketDescriptors[i];
304 for (let j = 0; j < bucket.kinds.length; j++) {
305 kindToBucketDescriptor[bucket.kinds[j]] = bucket;
311 let bucket = bucketDescriptors[i];
312 for (let j = 0; j < bucket.kinds.length; j++) {
313 if (bucket.kinds[j] === kind) {
314 return bucket;
957 // Calculate the bar heights for each bucket.
974 // No ticks fell into this bucket
[all...] |
| /foundation/distributeddatamgr/datamgr_service/services/distributeddataservice/rust/ylong_cloud_extension/src/service_impl/ |
| H A D | cloud_db.rs | 251 for (bucket, ext) in values.iter().zip(extends.iter_mut()) { in upload()
289 for (key, value) in bucket { in upload()
|
| /third_party/skia/third_party/externals/abseil-cpp/absl/random/ |
| H A D | uniform_real_distribution_test.cc | 275 auto bucket = static_cast<size_t>((x - min_val) * factor); in TYPED_TEST() local
276 counts[bucket]++; in TYPED_TEST()
|
| /foundation/distributeddatamgr/relational_store/interfaces/ndk/src/ |
| H A D | relational_store.cpp | 448 auto bucket = RelationalValuesBucket::GetSelf(valuesBucket); in OH_Rdb_Insert() local
449 if (rdbStore == nullptr || table == nullptr || bucket == nullptr) { in OH_Rdb_Insert()
453 rdbStore->GetStore()->Insert(rowId, table, bucket->Get()); in OH_Rdb_Insert()
461 auto bucket = RelationalValuesBucket::GetSelf(valueBucket); in OH_Rdb_Update() local
462 if (rdbStore == nullptr || predicate == nullptr || bucket == nullptr) { in OH_Rdb_Update()
466 rdbStore->GetStore()->Update(updatedRows, bucket->Get(), predicate->Get()); in OH_Rdb_Update()
|
| /foundation/distributeddatamgr/kv_store/frameworks/libs/distributeddb/test/unittest/common/syncer/cloud/ |
| H A D | distributeddb_cloud_db_proxy_test.cpp | 62 VBucket bucket; in ModifyRecords() local
67 bucket.insert({ field, static_cast<int64_t>(v + 1) }); in ModifyRecords()
69 bucket.insert({ field, val }); in ModifyRecords()
72 tempRecord.push_back(bucket); in ModifyRecords()
|
| H A D | distributeddb_cloud_kv_syncer_test.cpp | 522 VBucket bucket; in HWTEST_F() local
523 bucket.insert_or_assign(std::string("k"), std::string("k")); in HWTEST_F()
524 syncDataPk.push_back(bucket); in HWTEST_F()
|
| H A D | virtual_cloud_db.cpp | 324 VBucket bucket = tableData.record; in GetCloudData() local
326 bucket.insert(ex); in GetCloudData()
328 data.push_back(std::move(bucket)); in GetCloudData()
|
| /third_party/rust/crates/aho-corasick/src/packed/teddy/ |
| H A D | runtime.rs | 26 // bucket `i` (where the `j`th position is the position in the current window
200 /// byte occurring at `at + j` in `haystack` is in the bucket `i`.
232 /// byte occurring at `at + j` in `haystack` is in the bucket `i`.
265 /// bucket `j < 16 ? i : i + 8`.
338 // N.B. While the bucket count is known from self.buckets.len(), in verify64()
347 let bucket = bit % bucket_count; in verify64()
348 if let Some(m) = self.verify_bucket(pats, haystack, bucket, at) { in verify64()
356 /// `haystack` corresponding only to patterns in the given bucket.
362 bucket: usize, in verify_bucket()
380 // N.B. The bounds check for this bucket looku in verify_bucket()
[all...] |
| /foundation/filemanagement/dfs_service/test/unittests/clouddisk_database/mock/ |
| H A D | meta_file_clouddisk_mock.cpp | 354 uint32_t bucket = GetBucketByLevel(level); in GetBidxFromLevel() local
355 if (bucket == 0) { in GetBidxFromLevel()
358 return BUCKET_BLOCKS * GetBucketaddr(level, namehash % bucket); in GetBidxFromLevel()
|
| /third_party/elfutils/libdwfl/ |
| H A D | dwfl_module_getdwarf.c | 763 for (Elf32_Word bucket = 0; bucket < nbuckets; ++bucket) in translate_offs()
764 if (buckets[bucket] > maxndx) in translate_offs()
765 maxndx = buckets[bucket]; in translate_offs()
|
| /third_party/node/deps/v8/src/builtins/ |
| H A D | builtins-internal-gen.cc | 185 // Load bucket in InsertIntoRememberedSet()
186 TNode<IntPtrT> bucket = LoadBucket(slot_set, slot_offset, &slow_path); in InsertIntoRememberedSet() local
189 SetBitInCell(bucket, slot_offset); in InsertIntoRememberedSet()
218 TNode<IntPtrT> bucket = UncheckedCast<IntPtrT>( in LoadBucket() local
221 GotoIf(WordEqual(bucket, IntPtrConstant(0)), slow_path); in LoadBucket()
222 return bucket; in LoadBucket()
225 void SetBitInCell(TNode<IntPtrT> bucket, TNode<WordT> slot_offset) { in SetBitInCell() argument
233 UncheckedCast<IntPtrT>(IntPtrAdd(bucket, cell_offset)); in SetBitInCell()
|
| H A D | builtins-collections-gen.cc | 652 // Get the index of the bucket.
656 const TNode<IntPtrT> bucket =
659 table, bucket, CollectionType::HashTableStartIndex() * kTaggedSize)));
661 // Walk the bucket chain.
701 // Load the index of the next entry in the bucket chain.
1599 // Store the key, value and connect the element to the bucket chain.
1610 const TNode<IntPtrT> bucket =
1613 table, bucket, OrderedHashMap::HashTableStartIndex() * kTaggedSize));
1631 // Update the bucket head.
1633 table, bucket, SmiTa
[all...] |
| /third_party/node/deps/v8/src/diagnostics/ |
| H A D | objects-printer.cc | 946 for (int bucket = 0; bucket < table.NumberOfBuckets(); bucket++) { in PrintOrderedHashTableHeaderAndBuckets()
947 Object entry = table.get(T::HashTableStartIndex() + bucket); in PrintOrderedHashTableHeaderAndBuckets()
949 os << "\n " << std::setw(12) << bucket << ": " << Brief(entry); in PrintOrderedHashTableHeaderAndBuckets()
1079 for (int bucket = 0; bucket < this->Capacity(); ++bucket) { in SwissNameDictionaryPrint()
1081 if (!this->ToKey(this->GetReadOnlyRoots(), bucket, &k)) continue; in SwissNameDictionaryPrint()
1083 Object value = this->ValueAtRaw(bucket); in SwissNameDictionaryPrint()
1085 os << "\\n " << std::setw(12) << std::dec << bucket << ": "; SwissNameDictionaryPrint() local
[all...] |
| /foundation/distributeddatamgr/kv_store/frameworks/libs/distributeddb/storage/src/sqlite/relational/ |
| H A D | sqlite_relational_utils.cpp | 238 int SQLiteRelationalUtils::GetSelectVBucket(sqlite3_stmt *stmt, VBucket &bucket) in GetSelectVBucket() argument
251 bucket.insert_or_assign(colName, std::move(typeVal)); in GetSelectVBucket()
|
| /third_party/node/deps/v8/src/strings/ |
| H A D | string-search.h | 485 int bucket = (sizeof(PatternChar) == 1) ? c : c % AlphabetSize(); in PopulateBoyerMooreHorspoolTable() local
486 bad_char_occurrence[bucket] = i; in PopulateBoyerMooreHorspoolTable()
|
| /foundation/filemanagement/dfs_service/utils/dentry/src/ |
| H A D | meta_file_clouddisk.cpp | 342 uint32_t bucket = GetBucketByLevel(level); in GetBidxFromLevel() local
343 if (bucket == 0) { in GetBidxFromLevel()
346 return BUCKET_BLOCKS * GetBucketaddr(level, namehash % bucket); in GetBidxFromLevel()
|
| /third_party/node/deps/v8/tools/ |
| H A D | windbg.js | 837 let bucket = rs[s].buckets_[b];
838 if (bucket.isNull) continue;
839 // there are 32 cells in each bucket, cell's size is 32 bits
840 print(` bucket ${hex(bucket.address.asNumber())}:`);
841 const first_cell = bucket.address.asNumber();
|
| /foundation/systemabilitymgr/samgr_lite/samgr_endpoint/source/ |
| H A D | samgr_mini_ipc_adapter.c | 49 if (TB_CheckMessage(&endpoint->bucket) == BUCKET_BUSY) {
in Dispatch()
|
| /foundation/distributeddatamgr/relational_store/interfaces/inner_api/rdb_data_share_adapter/include/ |
| H A D | rdb_utils.h | 84 API_EXPORT static ValuesBucket ToValuesBucket(DataShareValuesBucket bucket);
|
| /third_party/nghttp2/lib/ |
| H A D | nghttp2_hd.c | 534 nghttp2_hd_entry **bucket; in hd_map_insert() local
536 bucket = &map->table[ent->hash & (HD_MAP_SIZE - 1)]; in hd_map_insert()
538 if (*bucket == NULL) { in hd_map_insert()
539 *bucket = ent; in hd_map_insert()
544 ent->next = *bucket; in hd_map_insert()
545 *bucket = ent; in hd_map_insert()
|
| /third_party/node/deps/nghttp2/lib/ |
| H A D | nghttp2_hd.c | 534 nghttp2_hd_entry **bucket; in hd_map_insert() local
536 bucket = &map->table[ent->hash & (HD_MAP_SIZE - 1)]; in hd_map_insert()
538 if (*bucket == NULL) { in hd_map_insert()
539 *bucket = ent; in hd_map_insert()
544 ent->next = *bucket; in hd_map_insert()
545 *bucket = ent; in hd_map_insert()
|
| /third_party/node/src/ |
| H A D | string_search.h | 527 int bucket = (sizeof(Char) == 1) ? c : c % AlphabetSize(); in PopulateBoyerMooreHorspoolTable() local
528 bad_char_occurrence[bucket] = i; in PopulateBoyerMooreHorspoolTable()
|