/third_party/libbpf/src/ |
H A D | hashmap.c | 21 /* start with 4 buckets */ 45 map->buckets = NULL; in hashmap__init() 71 free(map->buckets); in hashmap__clear() 72 map->buckets = NULL; in hashmap__clear() 124 free(map->buckets); in hashmap_grow() 125 map->buckets = new_buckets; in hashmap_grow() 137 if (!map->buckets) in hashmap_find_entry() 140 for (prev_ptr = &map->buckets[hash], cur = *prev_ptr; in hashmap_find_entry() 200 hashmap_add_entry(&map->buckets[h], entry); in hashmap_insert()
|
/third_party/mesa3d/src/gallium/auxiliary/cso_cache/ |
H A D | cso_hash.c | 110 struct cso_node **oldBuckets = hash->buckets; in cso_data_rehash() 116 hash->buckets = MALLOC(sizeof(struct cso_node*) * hash->numBuckets); in cso_data_rehash() 118 hash->buckets[i] = e; in cso_data_rehash() 132 beforeFirstNode = &hash->buckets[h % hash->numBuckets]; in cso_data_rehash() 162 struct cso_node **bucket = hash->buckets; in cso_data_first_node() 192 hash->buckets = NULL; in cso_hash_init() 203 struct cso_node **bucket = hash->buckets; in cso_hash_deinit() 214 FREE(hash->buckets); in cso_hash_deinit() 244 bucket = a.d->buckets + start; in cso_hash_data_next() 291 node_ptr = &hash->buckets[nod in cso_hash_erase() [all...] |
/third_party/ltp/lib/ |
H A D | tst_timer_test.c | 82 unsigned int i, buckets[rows]; in frequency_plot() local 89 memset(buckets, 0, sizeof(buckets)); in frequency_plot() 92 * We work with discrete data buckets smaller than 1 does not make in frequency_plot() 93 * sense as well as it's a good idea to keep buckets integer sized in frequency_plot() 101 buckets[bucket]++; in frequency_plot() 104 unsigned int max_bucket = buckets[0]; in frequency_plot() 106 max_bucket = MAX(max_bucket, buckets[i]); in frequency_plot() 116 if (buckets[l]) in frequency_plot() 121 if (buckets[ in frequency_plot() [all...] |
/third_party/node/deps/brotli/c/enc/ |
H A D | hash_longest_match_quickly_inc.h | 58 uint32_t* BROTLI_RESTRICT buckets = self->buckets_; in Prepare() local 66 buckets[key] = 0; in Prepare() 70 buckets[(key + (j << 3)) & BUCKET_MASK] = 0; in Prepare() 79 memset(buckets, 0, sizeof(uint32_t) * BUCKET_SIZE); in Prepare() 155 uint32_t* BROTLI_RESTRICT buckets = self->buckets_; in FindLongestMatch() local 179 buckets[key] = (uint32_t)cur_ix; in FindLongestMatch() 194 prev_ix = buckets[key]; in FindLongestMatch() 195 buckets[key] = (uint32_t)cur_ix; in FindLongestMatch() 226 prev_ix = buckets[keys[i]]; in FindLongestMatch() 257 buckets[key_ou in FindLongestMatch() [all...] |
/third_party/node/deps/npm/node_modules/cacache/lib/ |
H A D | verify.js | 185 const buckets = {} 193 if (buckets[hashed] && !excluded) { 194 buckets[hashed].push(entry) 195 } else if (buckets[hashed] && excluded) { 198 buckets[hashed] = [] 199 buckets[hashed]._path = index.bucketPath(cache, k) 201 buckets[hashed] = [entry] 202 buckets[hashed]._path = index.bucketPath(cache, k) 207 Object.keys(buckets), 209 return rebuildBucket(cache, buckets[ke [all...] |
/third_party/skia/third_party/externals/brotli/c/enc/ |
H A D | hash_longest_match_quickly_inc.h | 58 uint32_t* BROTLI_RESTRICT buckets = self->buckets_; in Prepare() local 66 buckets[key] = 0; in Prepare() 70 buckets[(key + (j << 3)) & BUCKET_MASK] = 0; in Prepare() 79 memset(buckets, 0, sizeof(uint32_t) * BUCKET_SIZE); in Prepare() 155 uint32_t* BROTLI_RESTRICT buckets = self->buckets_; in FindLongestMatch() local 179 buckets[key] = (uint32_t)cur_ix; in FindLongestMatch() 194 prev_ix = buckets[key]; in FindLongestMatch() 195 buckets[key] = (uint32_t)cur_ix; in FindLongestMatch() 226 prev_ix = buckets[keys[i]]; in FindLongestMatch() 257 buckets[key_ou in FindLongestMatch() [all...] |
/third_party/skia/third_party/externals/freetype/src/cache/ |
H A D | ftccache.c | 100 return cache->buckets + idx; in ftc_get_top_node_for_hash() 107 * buckets array appropriately, we simply degrade the hash table's 118 FT_UFast count = mask + p + 1; /* number of buckets */ in ftc_cache_resize() 121 /* do we need to expand the buckets array? */ in ftc_cache_resize() 127 /* try to expand the buckets array _before_ splitting in ftc_cache_resize() 137 if ( FT_RENEW_ARRAY( cache->buckets, in ftc_cache_resize() 143 pnode = cache->buckets + p; in ftc_cache_resize() 161 cache->buckets[p + mask + 1] = new_list; in ftc_cache_resize() 174 /* do we need to shrink the buckets array? */ in ftc_cache_resize() 191 if ( FT_QRENEW_ARRAY( cache->buckets, in ftc_cache_resize() [all...] |
/third_party/node/deps/cares/src/lib/ |
H A D | ares__htable_asvp.c | 118 const void **buckets = NULL; in ares__htable_asvp_keys() local 129 buckets = ares__htable_all_buckets(htable->hash, &cnt); in ares__htable_asvp_keys() 130 if (buckets == NULL || cnt == 0) { in ares__htable_asvp_keys() 136 ares_free(buckets); in ares__htable_asvp_keys() 141 out[i] = ((const ares__htable_asvp_bucket_t *)buckets[i])->key; in ares__htable_asvp_keys() 144 ares_free(buckets); in ares__htable_asvp_keys()
|
/third_party/libunwind/libunwind/src/ia64/ |
H A D | Gscript.c | 84 cache->buckets[i].lru_chain = (i - 1); in flush_script_cache() 85 cache->buckets[i].coll_chain = -1; in flush_script_cache() 86 cache->buckets[i].ip = 0; in flush_script_cache() 130 struct ia64_script *script = cache->buckets + c->hint; in script_lookup() 144 script = cache->buckets + index; in script_lookup() 150 c->hint = cache->buckets[c->prev_script].hint = in script_lookup() 151 (script - cache->buckets); in script_lookup() 156 script = cache->buckets + script->coll_chain; in script_lookup() 177 script = cache->buckets + head; in script_new() 181 cache->buckets[cach in script_new() [all...] |
/third_party/mesa3d/src/gallium/auxiliary/pipebuffer/ |
H A D | pb_cache.c | 86 struct list_head *cache = &mgr->buckets[entry->bucket_index]; in pb_cache_add_buffer() 96 release_expired_buffers_locked(&mgr->buckets[i], current_time); in pb_cache_add_buffer() 158 struct list_head *cache = &mgr->buckets[bucket_index]; in pb_cache_reclaim_buffer() 235 struct list_head *cache = &mgr->buckets[i]; in pb_cache_release_all_buffers() 265 * @param num_heaps Number of separate caches/buckets indexed by bucket_index 289 mgr->buckets = CALLOC(num_heaps, sizeof(struct list_head)); in pb_cache_init() 290 if (!mgr->buckets) in pb_cache_init() 294 list_inithead(&mgr->buckets[i]); in pb_cache_init() 317 FREE(mgr->buckets); in pb_cache_deinit() 318 mgr->buckets in pb_cache_deinit() [all...] |
/third_party/rust/crates/unicode-width/scripts/ |
H A D | unicode.py | 184 list overlaps with another's width list, those buckets can be merged via `try_extend`.""" 230 same bucket. Returns a list of the buckets in increasing order of those bits.""" 233 buckets = [Bucket() for _ in range(0, 2 ** num_bits)] 236 buckets[(codepoint >> low_bit) & mask].append(codepoint, width) 237 return buckets 245 Typically, tables contain a list of buckets of codepoints. Bucket `i`'s codepoints should 248 key to compression is that two different buckets in two different sub-tables may have the 252 discard the buckets and convert the entries into `EffectiveWidth` values.""" 267 buckets = [] 269 buckets 290 def buckets(self): global() member in Table [all...] |
/kernel/linux/linux-6.6/tools/testing/selftests/drivers/net/netdevsim/ |
H A D | nexthop.sh | 213 $IP nexthop add id 10 group 1/2 type resilient buckets 4 214 nexthop_check "id 10" "id 10 group 1/2 type resilient buckets 4 idle_timer 120 unbalanced_timer 0 unbalanced_time 0 trap" 218 check_err $? "Wrong nexthop buckets count" 220 check_err $? "Wrong nexthop buckets count" 229 $IP nexthop add id 10 group 1,3/2,2 type resilient buckets 5 230 nexthop_check "id 10" "id 10 group 1,3/2,2 type resilient buckets 5 idle_timer 120 unbalanced_timer 0 unbalanced_time 0 trap" 234 check_err $? "Wrong nexthop buckets count" 236 check_err $? "Wrong nexthop buckets count" 259 $IP nexthop add id 10 group 1/2 type resilient buckets 4 &> /dev/null 325 $IP nexthop add id 10 group 1/2 type resilient buckets [all...] |
/kernel/linux/linux-6.6/lib/ |
H A D | hashtable_test.c | 189 int buckets[2]; in hashtable_test_hash_for_each_possible() local 219 /* Save the buckets for the different keys. */ in hashtable_test_hash_for_each_possible() 223 buckets[y->key] = bkt; in hashtable_test_hash_for_each_possible() 230 if (buckets[0] == buckets[1]) { in hashtable_test_hash_for_each_possible() 244 int buckets[2]; in hashtable_test_hash_for_each_possible_safe() local 277 /* Save the buckets for the different keys. */ in hashtable_test_hash_for_each_possible_safe() 281 buckets[y->key] = bkt; in hashtable_test_hash_for_each_possible_safe() 288 if (buckets[0] == buckets[ in hashtable_test_hash_for_each_possible_safe() [all...] |
/third_party/skia/third_party/externals/abseil-cpp/absl/random/ |
H A D | log_uniform_int_distribution_test.cc | 160 std::vector<int64_t> buckets(max_bucket + 1); in ChiSquaredTestImpl() 166 // Convert the output of the generator to one of num_bucket buckets. in ChiSquaredTestImpl() 169 ++buckets[bucket]; in ChiSquaredTestImpl() 174 const int dof = buckets.size() - 1; in ChiSquaredTestImpl() 175 const double expected = trials / static_cast<double>(buckets.size()); in ChiSquaredTestImpl() 180 std::begin(buckets), std::end(buckets), expected); in ChiSquaredTestImpl() 186 for (size_t i = 0; i < buckets.size(); i++) { in ChiSquaredTestImpl() 187 ABSL_INTERNAL_LOG(INFO, absl::StrCat(i, ": ", buckets[i])); in ChiSquaredTestImpl()
|
/foundation/distributeddatamgr/datamgr_service/services/distributeddataservice/service/common/ |
H A D | value_proxy.h | 192 Buckets(Buckets &&buckets) noexcept 194 *this = std::move(buckets); 196 Buckets &operator=(Buckets &&buckets) noexcept; 200 std::vector<T> buckets; in operator std::vector() local 201 buckets.reserve(value_.size()); in operator std::vector() 203 buckets.emplace_back(std::move(bucket)); in operator std::vector() 206 return buckets; in operator std::vector() 226 static Buckets Convert(DistributedData::VBuckets &&buckets); 227 static Buckets Convert(std::vector<NativeRdb::ValuesBucket> &&buckets); 228 static Buckets Convert(std::vector<CommonType::ValuesBucket> &&buckets); [all...] |
H A D | value_proxy.cpp | 124 ValueProxy::Buckets ValueProxy::Convert(std::vector<NativeRdb::ValuesBucket> &&buckets) in Convert() argument 127 proxy.value_.reserve(buckets.size()); in Convert() 128 for (auto &bucket : buckets) { in Convert() 134 ValueProxy::Buckets ValueProxy::Convert(std::vector<CommonType::ValuesBucket> &&buckets) in Convert() argument 137 proxy.value_.reserve(buckets.size()); in Convert() 138 for (auto &bucket : buckets) { in Convert() 144 ValueProxy::Buckets ValueProxy::Convert(std::vector<DistributedDB::VBucket> &&buckets) in Convert() argument 147 proxy.value_.reserve(buckets.size()); in Convert() 148 for (auto &bucket : buckets) { in Convert() 154 ValueProxy::Buckets ValueProxy::Convert(DistributedData::VBuckets &&buckets) in Convert() argument [all...] |
/kernel/linux/linux-6.6/tools/perf/ |
H A D | builtin-ftrace.c | 685 static void make_histogram(int buckets[], char *buf, size_t len, char *linebuf, in make_histogram() argument 742 buckets[i]++; in make_histogram() 753 static void display_histogram(int buckets[], bool use_nsec) in display_histogram() argument 762 total += buckets[i]; in display_histogram() 772 bar_len = buckets[0] * bar_total / total; in display_histogram() 774 0, 1, "us", buckets[0], bar_len, bar, bar_total - bar_len, ""); in display_histogram() 786 bar_len = buckets[i] * bar_total / total; in display_histogram() 788 start, stop, unit, buckets[i], bar_len, bar, in display_histogram() 792 bar_len = buckets[NUM_BUCKET - 1] * bar_total / total; in display_histogram() 794 1, "...", use_nsec ? "ms" : " s", buckets[NUM_BUCKE in display_histogram() 861 read_func_latency(struct perf_ftrace *ftrace, int buckets[]) read_func_latency() argument 886 int buckets[NUM_BUCKET] = { }; __cmd_latency() local [all...] |
/third_party/mesa3d/src/amd/registers/ |
H A D | canonicalize.py | 50 buckets = defaultdict(list) 52 buckets[RE_number.sub('0', regmap.name)].append(regmap) 54 for bucket in buckets.values():
|
/third_party/node/deps/v8/tools/ |
H A D | generate-runtime-call-stats.py | 36 help="group common stats together into buckets") 124 help="useable with --group to only show buckets specified by filter") 374 buckets = {} 403 if bucket_name not in buckets: 405 buckets[bucket_name] = bucket 407 bucket = buckets[bucket_name] 410 return buckets 413 def create_table(buckets, record_bucket_names=True, filter=None): 415 for bucket in buckets.values(): 447 buckets [all...] |
/kernel/linux/linux-5.10/net/ceph/crush/ |
H A D | crush.c | 110 /* buckets */ in crush_destroy() 111 if (map->buckets) { in crush_destroy() 114 if (map->buckets[b] == NULL) in crush_destroy() 116 crush_destroy_bucket(map->buckets[b]); in crush_destroy() 118 kfree(map->buckets); in crush_destroy()
|
/kernel/linux/linux-6.6/net/ceph/crush/ |
H A D | crush.c | 110 /* buckets */ in crush_destroy() 111 if (map->buckets) { in crush_destroy() 114 if (map->buckets[b] == NULL) in crush_destroy() 116 crush_destroy_bucket(map->buckets[b]); in crush_destroy() 118 kfree(map->buckets); in crush_destroy()
|
/third_party/rust/crates/aho-corasick/src/packed/teddy/ |
H A D | runtime.rs | 8 // variants: Slim 128-bit Teddy (8 buckets), Slim 256-bit Teddy (8 buckets) 9 // and Fat 256-bit Teddy (16 buckets). For each variant, there are three 76 /// The allocation of patterns in buckets. This only contains the IDs of 79 pub buckets: Vec<Vec<PatternID>>, 112 // ID in all Teddy buckets are valid indices into `pats`. While this in find_at() 192 self.buckets.len() * mem::size_of::<Vec<PatternID>>() in heap_bytes() 214 debug_assert_eq!(8, self.buckets.len()); in verify128() 246 debug_assert_eq!(8, self.buckets.len()); in verify256() 279 debug_assert_eq!(16, self.buckets in verify_fat256() [all...] |
/foundation/ability/ability_runtime/services/dataobsmgr/src/ |
H A D | dataobs_mgr_changeinfo.cpp | 89 VBuckets buckets; in Unmarshalling() local 90 if (!(DataObsUtils::Unmarshal(parcel, buckets))) { in Unmarshalling() 97 output.valueBuckets_ = std::move(buckets); in Unmarshalling()
|
/kernel/linux/linux-5.10/kernel/bpf/ |
H A D | bpf_local_storage.c | 21 return &smap->buckets[hash_ptr(selem, smap->bucket_log)]; in select_bucket() 501 b = &smap->buckets[i]; in bpf_local_storage_map_free() 528 kvfree(smap->buckets); in bpf_local_storage_map_free() 565 /* Use at least 2 buckets, select_bucket() is undefined behavior with 1 bucket */ in bpf_local_storage_map_alloc() 568 cost = sizeof(*smap->buckets) * nbuckets + sizeof(*smap); in bpf_local_storage_map_alloc() 576 smap->buckets = kvcalloc(sizeof(*smap->buckets), nbuckets, in bpf_local_storage_map_alloc() 578 if (!smap->buckets) { in bpf_local_storage_map_alloc() 585 INIT_HLIST_HEAD(&smap->buckets[i].list); in bpf_local_storage_map_alloc() 586 raw_spin_lock_init(&smap->buckets[ in bpf_local_storage_map_alloc() [all...] |
/third_party/libcoap/include/coap3/ |
H A D | coap_uthash_internal.h | 129 /* initial number of buckets */ 130 #define HASH_INITIAL_NUM_BUCKETS 32U /* initial number of buckets */ 131 #define HASH_INITIAL_NUM_BUCKETS_LOG2 5U /* lg2 of initial number of buckets */ 144 (head)->hh.tbl->buckets[_hd_bkt].count++; \ 161 HASH_FIND_IN_BKT((head)->hh.tbl, hh, (head)->hh.tbl->buckets[ _hf_bkt ], keyptr, keylen, hashval, out); \ 224 (head)->hh.tbl->buckets = (UT_hash_bucket*)uthash_malloc( \ 227 if (!(head)->hh.tbl->buckets) { \ 231 uthash_bzero((head)->hh.tbl->buckets, \ 236 uthash_free((head)->hh.tbl->buckets, \ 320 HASH_ADD_TO_BKT((head)->hh.tbl->buckets[_ha_bk 1093 UT_hash_bucket *buckets; global() member [all...] |