| /foundation/distributeddatamgr/relational_store/interfaces/ndk/include/ |
| H A D | oh_values_bucket.h | 65 * @param bucket Represents a pointer to an {@link OH_VBucket} instance.
72 int (*putText)(OH_VBucket *bucket, const char *field, const char *value);
77 * @param bucket Represents a pointer to an {@link OH_VBucket} instance.
84 int (*putInt64)(OH_VBucket *bucket, const char *field, int64_t value);
89 * @param bucket Represents a pointer to an {@link OH_VBucket} instance.
96 int (*putReal)(OH_VBucket *bucket, const char *field, double value);
101 * @param bucket Represents a pointer to an {@link OH_VBucket} instance.
109 int (*putBlob)(OH_VBucket *bucket, const char *field, const uint8_t *value, uint32_t size);
114 * @param bucket Represents a pointer to an {@link OH_VBucket} instance.
120 int (*putNull)(OH_VBucket *bucket, cons
[all...] |
| /foundation/distributeddatamgr/relational_store/interfaces/ndk/src/ |
| H A D | relational_values_bucket.h | 27 static RelationalValuesBucket *GetSelf(OH_VBucket *bucket);
31 static int PutText(OH_VBucket *bucket, const char *field, const char *value);
32 static int PutInt64(OH_VBucket *bucket, const char *field, int64_t value);
33 static int PutReal(OH_VBucket *bucket, const char *field, double value);
34 static int PutBlob(OH_VBucket *bucket, const char *field, const uint8_t *value, uint32_t size);
35 static int PutNull(OH_VBucket *bucket, const char *field);
36 static int Clear(OH_VBucket *bucket);
37 static int Destroy(OH_VBucket *bucket);
38 static int PutValueObject(OH_VBucket *bucket, const char *field, OHOS::NativeRdb::ValueObject &&value);
|
| /kernel/linux/linux-5.10/drivers/interconnect/qcom/ |
| H A D | bcm-voter.c | 71 size_t i, bucket; in bcm_aggregate() local
76 for (bucket = 0; bucket < QCOM_ICC_NUM_BUCKETS; bucket++) { in bcm_aggregate()
79 temp = bcm_div(node->sum_avg[bucket] * bcm->aux_data.width, in bcm_aggregate()
81 agg_avg[bucket] = max(agg_avg[bucket], temp); in bcm_aggregate()
83 temp = bcm_div(node->max_peak[bucket] * bcm->aux_data.width, in bcm_aggregate()
85 agg_peak[bucket] = max(agg_peak[bucket], tem in bcm_aggregate()
138 tcs_list_gen(struct bcm_voter *voter, int bucket, struct tcs_cmd tcs_list[MAX_VCD], int n[MAX_VCD + 1]) tcs_list_gen() argument
[all...] |
| /third_party/jinja2/ |
| H A D | bccache.py | 60 """Resets the bucket (unloads the bytecode)."""
85 raise TypeError("can't write empty bucket")
115 def load_bytecode(self, bucket):
116 filename = path.join(self.directory, bucket.key)
119 bucket.load_bytecode(f)
121 def dump_bytecode(self, bucket):
122 filename = path.join(self.directory, bucket.key)
124 bucket.write_bytecode(f)
130 def load_bytecode(self, bucket: Bucket) -> None:
132 bucket
[all...] |
| /kernel/linux/linux-5.10/net/sched/ |
| H A D | sch_hhf.c | 21 * as heavy-hitter, it is immediately switched to the heavy-hitter bucket.
23 * in which the heavy-hitter bucket is served with less weight.
61 * dispatched to the heavy-hitter bucket accordingly.
68 * bucket.
71 * to the non-heavy-hitter bucket.
74 * send p to the heavy-hitter bucket.
105 WDRR_BUCKET_FOR_HH = 0, /* bucket id for heavy-hitters */
106 WDRR_BUCKET_FOR_NON_HH = 1 /* bucket id for non-heavy-hitters */
328 /* Removes one skb from head of bucket. */
329 static struct sk_buff *dequeue_head(struct wdrr_bucket *bucket) in dequeue_head() argument
339 bucket_add(struct wdrr_bucket *bucket, struct sk_buff *skb) bucket_add() argument
352 struct wdrr_bucket *bucket; hhf_drop() local
376 struct wdrr_bucket *bucket; hhf_enqueue() local
422 struct wdrr_bucket *bucket; hhf_dequeue() local
645 struct wdrr_bucket *bucket = q->buckets + i; hhf_init() local
[all...] |
| /kernel/linux/linux-6.6/net/sched/ |
| H A D | sch_hhf.c | 21 * as heavy-hitter, it is immediately switched to the heavy-hitter bucket.
23 * in which the heavy-hitter bucket is served with less weight.
61 * dispatched to the heavy-hitter bucket accordingly.
68 * bucket.
71 * to the non-heavy-hitter bucket.
74 * send p to the heavy-hitter bucket.
105 WDRR_BUCKET_FOR_HH = 0, /* bucket id for heavy-hitters */
106 WDRR_BUCKET_FOR_NON_HH = 1 /* bucket id for non-heavy-hitters */
328 /* Removes one skb from head of bucket. */
329 static struct sk_buff *dequeue_head(struct wdrr_bucket *bucket) in dequeue_head() argument
339 bucket_add(struct wdrr_bucket *bucket, struct sk_buff *skb) bucket_add() argument
352 struct wdrr_bucket *bucket; hhf_drop() local
376 struct wdrr_bucket *bucket; hhf_enqueue() local
422 struct wdrr_bucket *bucket; hhf_dequeue() local
642 struct wdrr_bucket *bucket = q->buckets + i; hhf_init() local
[all...] |
| /third_party/rust/crates/aho-corasick/src/packed/teddy/ |
| H A D | compile.rs | 247 // prefix to be in the same bucket, since it minimizes the amount in compile()
253 // same bucket. However, case insensitive searches are fairly in compile()
258 // the same bucket. in compile()
262 // same bucket, we ensure that we preserve correct leftmost-first in compile()
266 // the same bucket. The verification routine could be adjusted to in compile()
267 // support correct leftmost match semantics regardless of bucket in compile()
271 if let Some(&bucket) = lonibble_to_bucket.get(&lonybs) { in compile()
272 self.buckets[bucket].push(id); in compile()
277 let bucket = (self.buckets.len() - 1) in compile()
279 self.buckets[bucket] in compile()
[all...] |
| /kernel/linux/linux-6.6/drivers/interconnect/qcom/ |
| H A D | bcm-voter.c | 65 int bucket, i; in bcm_aggregate_mask() local
67 for (bucket = 0; bucket < QCOM_ICC_NUM_BUCKETS; bucket++) { in bcm_aggregate_mask()
68 bcm->vote_x[bucket] = 0; in bcm_aggregate_mask()
69 bcm->vote_y[bucket] = 0; in bcm_aggregate_mask()
74 /* If any vote in this bucket exists, keep the BCM enabled */ in bcm_aggregate_mask()
75 if (node->sum_avg[bucket] || node->max_peak[bucket]) { in bcm_aggregate_mask()
76 bcm->vote_x[bucket] in bcm_aggregate_mask()
94 size_t i, bucket; bcm_aggregate() local
156 tcs_list_gen(struct bcm_voter *voter, int bucket, struct tcs_cmd tcs_list[MAX_VCD], int n[MAX_VCD + 1]) tcs_list_gen() argument
[all...] |
| /foundation/distributeddatamgr/kv_store/frameworks/innerkitsimpl/distributeddatafwk/test/unittest/ |
| H A D | kv_utils_test.cpp | 504 * @tc.desc: dataShare values bucket to entry, the bucket is invalid
511 DataShareValuesBucket bucket {}; in HWTEST_F()
513 auto entry = KvUtils::ToEntry(bucket); in HWTEST_F()
515 bucket.Put("invalid key", "value"); in HWTEST_F()
516 EXPECT_FALSE(bucket.IsEmpty()); in HWTEST_F()
517 entry = KvUtils::ToEntry(bucket); in HWTEST_F()
519 bucket.Put(KEY, "value"); in HWTEST_F()
520 entry = KvUtils::ToEntry(bucket); in HWTEST_F()
526 * @tc.desc: dataShare values bucket t
704 DataShareValuesBucket bucket; HWTEST_F() local
[all...] |
| /foundation/systemabilitymgr/samgr_lite/samgr_endpoint/source/ |
| H A D | token_bucket.h | 29 int burst; // The burst size of the token bucket
39 inline static void TB_InitBucket(TokenBucket *bucket, int rate, int burst)
in TB_InitBucket() argument
41 bucket->last = 0;
in TB_InitBucket()
42 bucket->rate = rate;
in TB_InitBucket()
43 bucket->burst = burst;
in TB_InitBucket()
44 bucket->used = 0;
in TB_InitBucket()
46 int TB_CheckMessage(TokenBucket *bucket);
|
| /kernel/linux/linux-5.10/drivers/infiniband/sw/rdmavt/ |
| H A D | trace_qp.h | 60 TP_PROTO(struct rvt_qp *qp, u32 bucket),
61 TP_ARGS(qp, bucket),
65 __field(u32, bucket)
70 __entry->bucket = bucket;
73 "[%s] qpn 0x%x bucket %u",
76 __entry->bucket
81 TP_PROTO(struct rvt_qp *qp, u32 bucket),
82 TP_ARGS(qp, bucket));
85 TP_PROTO(struct rvt_qp *qp, u32 bucket),
[all...] |
| /kernel/linux/linux-5.10/net/9p/ |
| H A D | error.c | 181 int bucket; in p9_error_init() local
184 for (bucket = 0; bucket < ERRHASHSZ; bucket++) in p9_error_init()
185 INIT_HLIST_HEAD(&hash_errmap[bucket]); in p9_error_init()
190 bucket = jhash(c->name, c->namelen, 0) % ERRHASHSZ; in p9_error_init()
192 hlist_add_head(&c->list, &hash_errmap[bucket]); in p9_error_init()
210 int bucket; in p9_errstr2errno() local
214 bucket = jhash(errstr, len, 0) % ERRHASHSZ; in p9_errstr2errno()
215 hlist_for_each_entry(c, &hash_errmap[bucket], lis in p9_errstr2errno()
[all...] |
| /kernel/linux/linux-6.6/drivers/infiniband/sw/rdmavt/ |
| H A D | trace_qp.h | 18 TP_PROTO(struct rvt_qp *qp, u32 bucket),
19 TP_ARGS(qp, bucket),
23 __field(u32, bucket)
28 __entry->bucket = bucket;
31 "[%s] qpn 0x%x bucket %u",
34 __entry->bucket
39 TP_PROTO(struct rvt_qp *qp, u32 bucket),
40 TP_ARGS(qp, bucket));
43 TP_PROTO(struct rvt_qp *qp, u32 bucket),
[all...] |
| /kernel/linux/linux-6.6/net/9p/ |
| H A D | error.c | 179 int bucket; in p9_error_init() local
182 for (bucket = 0; bucket < ERRHASHSZ; bucket++) in p9_error_init()
183 INIT_HLIST_HEAD(&hash_errmap[bucket]); in p9_error_init()
188 bucket = jhash(c->name, c->namelen, 0) % ERRHASHSZ; in p9_error_init()
190 hlist_add_head(&c->list, &hash_errmap[bucket]); in p9_error_init()
208 int bucket; in p9_errstr2errno() local
212 bucket = jhash(errstr, len, 0) % ERRHASHSZ; in p9_errstr2errno()
213 hlist_for_each_entry(c, &hash_errmap[bucket], lis in p9_errstr2errno()
[all...] |
| /kernel/linux/linux-5.10/fs/nfs/ |
| H A D | nfs42xattr.c | 87 struct nfs4_xattr_bucket *bucket; member
120 * 1. inode i_lock or bucket lock
238 entry->bucket = NULL; in nfs4_xattr_alloc_entry()
389 struct nfs4_xattr_bucket *bucket; in nfs4_xattr_discard_cache() local
395 bucket = &cache->buckets[i]; in nfs4_xattr_discard_cache()
397 spin_lock(&bucket->lock); in nfs4_xattr_discard_cache()
398 bucket->draining = true; in nfs4_xattr_discard_cache()
399 hlist_for_each_entry_safe(entry, n, &bucket->hlist, hnode) { in nfs4_xattr_discard_cache()
404 spin_unlock(&bucket->lock); in nfs4_xattr_discard_cache()
512 nfs4_xattr_get_entry(struct nfs4_xattr_bucket *bucket, cons argument
530 struct nfs4_xattr_bucket *bucket; nfs4_xattr_hash_add() local
567 struct nfs4_xattr_bucket *bucket; nfs4_xattr_hash_remove() local
590 struct nfs4_xattr_bucket *bucket; nfs4_xattr_hash_find() local
893 struct nfs4_xattr_bucket *bucket; entry_lru_isolate() local
[all...] |
| /kernel/linux/linux-6.6/fs/nfs/ |
| H A D | nfs42xattr.c | 87 struct nfs4_xattr_bucket *bucket; member
120 * 1. inode i_lock or bucket lock
238 entry->bucket = NULL; in nfs4_xattr_alloc_entry()
388 struct nfs4_xattr_bucket *bucket; in nfs4_xattr_discard_cache() local
394 bucket = &cache->buckets[i]; in nfs4_xattr_discard_cache()
396 spin_lock(&bucket->lock); in nfs4_xattr_discard_cache()
397 bucket->draining = true; in nfs4_xattr_discard_cache()
398 hlist_for_each_entry_safe(entry, n, &bucket->hlist, hnode) { in nfs4_xattr_discard_cache()
403 spin_unlock(&bucket->lock); in nfs4_xattr_discard_cache()
511 nfs4_xattr_get_entry(struct nfs4_xattr_bucket *bucket, cons argument
529 struct nfs4_xattr_bucket *bucket; nfs4_xattr_hash_add() local
566 struct nfs4_xattr_bucket *bucket; nfs4_xattr_hash_remove() local
589 struct nfs4_xattr_bucket *bucket; nfs4_xattr_hash_find() local
892 struct nfs4_xattr_bucket *bucket; entry_lru_isolate() local
[all...] |
| /foundation/distributeddatamgr/relational_store/test/js/relationalstore/unittest/src/ |
| H A D | RdbStoreValueType.test.js | 66 let bucket = {
71 console.log(TAG + "insert(bigint_table," + bucket + ")");
72 let rowid = await store.insert("bigint_table", bucket);
83 expect(value1).assertEqual(bucket["value1"]);
88 expect(value2).assertEqual(bucket["value2"]);
105 let bucket = {
110 console.log(TAG + "insert(bigint_table," + bucket + ")");
111 let rowid = await store.insert("bigint_table", bucket);
122 expect(value1).assertEqual(bucket["value1"]);
127 expect(value2).assertEqual(bucket["value
[all...] |
| /kernel/linux/linux-5.10/net/vmw_vsock/ |
| H A D | diag.c | 52 unsigned int bucket; in vsock_diag_dump() local
63 bucket = cb->args[1]; in vsock_diag_dump()
72 while (bucket < ARRAY_SIZE(vsock_bind_table)) { in vsock_diag_dump()
73 struct list_head *head = &vsock_bind_table[bucket]; in vsock_diag_dump()
94 bucket++; in vsock_diag_dump()
98 bucket = 0; in vsock_diag_dump()
102 while (bucket < ARRAY_SIZE(vsock_connected_table)) { in vsock_diag_dump()
103 struct list_head *head = &vsock_connected_table[bucket]; in vsock_diag_dump()
128 bucket++; in vsock_diag_dump()
135 cb->args[1] = bucket; in vsock_diag_dump()
[all...] |
| /kernel/linux/linux-6.6/net/vmw_vsock/ |
| H A D | diag.c | 52 unsigned int bucket; in vsock_diag_dump() local
63 bucket = cb->args[1]; in vsock_diag_dump()
72 while (bucket < ARRAY_SIZE(vsock_bind_table)) { in vsock_diag_dump()
73 struct list_head *head = &vsock_bind_table[bucket]; in vsock_diag_dump()
94 bucket++; in vsock_diag_dump()
98 bucket = 0; in vsock_diag_dump()
102 while (bucket < ARRAY_SIZE(vsock_connected_table)) { in vsock_diag_dump()
103 struct list_head *head = &vsock_connected_table[bucket]; in vsock_diag_dump()
128 bucket++; in vsock_diag_dump()
135 cb->args[1] = bucket; in vsock_diag_dump()
[all...] |
| /third_party/node/deps/npm/node_modules/cacache/lib/ |
| H A D | entry-index.js | 34 const bucket = bucketPath(cache, key)
35 const entries = await bucketEntries(bucket)
86 await mkdir(path.dirname(bucket), { recursive: true })
89 await moveFile(tmp.target, bucket)
113 const bucket = bucketPath(cache, key)
122 await mkdir(path.dirname(bucket), { recursive: true })
132 await appendFile(bucket, `\n${hashEntry(stringified)}\t${stringified}`)
146 const bucket = bucketPath(cache, key)
148 const entries = await bucketEntries(bucket)
172 const bucket
[all...] |
| /kernel/linux/linux-5.10/fs/dlm/ |
| H A D | debug_fs.c | 368 unsigned bucket; member
427 unsigned bucket, entry; in table_seq_start() local
430 bucket = n >> 32; in table_seq_start()
433 if (bucket >= ls->ls_rsbtbl_size) in table_seq_start()
450 tree = toss ? &ls->ls_rsbtbl[bucket].toss : &ls->ls_rsbtbl[bucket].keep; in table_seq_start()
452 spin_lock(&ls->ls_rsbtbl[bucket].lock); in table_seq_start()
459 ri->bucket = bucket; in table_seq_start()
460 spin_unlock(&ls->ls_rsbtbl[bucket] in table_seq_start()
507 unsigned bucket; table_seq_next() local
[all...] |
| /kernel/linux/linux-6.6/fs/dlm/ |
| H A D | debug_fs.c | 417 unsigned bucket; member
484 unsigned bucket, entry; in table_seq_start() local
487 bucket = n >> 32; in table_seq_start()
490 if (bucket >= ls->ls_rsbtbl_size) in table_seq_start()
509 tree = toss ? &ls->ls_rsbtbl[bucket].toss : &ls->ls_rsbtbl[bucket].keep; in table_seq_start()
511 spin_lock(&ls->ls_rsbtbl[bucket].lock); in table_seq_start()
518 ri->bucket = bucket; in table_seq_start()
519 spin_unlock(&ls->ls_rsbtbl[bucket] in table_seq_start()
566 unsigned bucket; table_seq_next() local
[all...] |
| /third_party/icu/icu4j/main/classes/collate/src/com/ibm/icu/text/ |
| H A D | AlphabeticIndex.java | 43 * (bucket) of a larger "target" list. That is, each label corresponds to a bucket in
44 * the target list, where everything in the bucket is greater than or equal to the character
46 * they will be in sorted order in the right bucket.
51 * into an inflow bucket between the other two scripts.
72 * for (AlphabeticIndex.Bucket<Integer> bucket : index) {
73 * if (showAll || bucket.size() != 0) {
74 * showLabelAtTop(UI, bucket.getLabel());
80 * for (AlphabeticIndex.Bucket<Integer> bucket : index) {
81 * if (bucket
[all...] |
| /third_party/icu/ohos_icu4j/src/main/java/ohos/global/icu/text/ |
| H A D | AlphabeticIndex.java | 44 * (bucket) of a larger "target" list. That is, each label corresponds to a bucket in
45 * the target list, where everything in the bucket is greater than or equal to the character
47 * they will be in sorted order in the right bucket.
52 * into an inflow bucket between the other two scripts.
73 * for (AlphabeticIndex.Bucket<Integer> bucket : index) {
74 * if (showAll || bucket.size() != 0) {
75 * showLabelAtTop(UI, bucket.getLabel());
81 * for (AlphabeticIndex.Bucket<Integer> bucket : index) {
82 * if (bucket
[all...] |
| /third_party/icu/icu4j/main/tests/collate/src/com/ibm/icu/dev/test/collator/ |
| H A D | AlphabeticIndexTest.java | 230 Bucket<Integer> bucket = find(alphabeticIndex, probe); in TestA()
231 assertEquals("locale " + test[0] + " name=" + probe + " in bucket", in TestA()
232 expectedLabel, bucket.getLabel()); in TestA()
237 for (Bucket<Integer> bucket : alphabeticIndex) { in find()
238 for (Record<Integer> record : bucket) { in find()
240 return bucket; in find()
322 for (Bucket<String> bucket : alphabeticIndex) { in TestEmpty()
324 LabelType labelType = bucket.getLabelType(); in TestEmpty()
370 for (Bucket<Double> bucket : alphabeticIndex) { in TestInflow()
371 LabelType labelType = bucket in TestInflow()
[all...] |