Home
last modified time | relevance | path

Searched refs:keys (Results 626 - 650 of 3641) sorted by relevance

1...<<21222324252627282930>>...146

/kernel/linux/linux-5.10/fs/xfs/libxfs/
H A Dxfs_rtbitmap.c1069 struct xfs_rtalloc_rec keys[2]; in xfs_rtalloc_query_all() local
1071 keys[0].ar_startext = 0; in xfs_rtalloc_query_all()
1072 keys[1].ar_startext = tp->t_mountp->m_sb.sb_rextents - 1; in xfs_rtalloc_query_all()
1073 keys[0].ar_extcount = keys[1].ar_extcount = 0; in xfs_rtalloc_query_all()
1075 return xfs_rtalloc_query_range(tp, &keys[0], &keys[1], fn, priv); in xfs_rtalloc_query_all()
/kernel/linux/linux-6.6/fs/xfs/libxfs/
H A Dxfs_rtbitmap.c1103 struct xfs_rtalloc_rec keys[2]; in xfs_rtalloc_query_all() local
1105 keys[0].ar_startext = 0; in xfs_rtalloc_query_all()
1106 keys[1].ar_startext = mp->m_sb.sb_rextents - 1; in xfs_rtalloc_query_all()
1107 keys[0].ar_extcount = keys[1].ar_extcount = 0; in xfs_rtalloc_query_all()
1109 return xfs_rtalloc_query_range(mp, tp, &keys[0], &keys[1], fn, priv); in xfs_rtalloc_query_all()
/kernel/linux/linux-6.6/tools/testing/selftests/hid/tests/
H A Dtest_keyboard.py31 def _update_key_state(self, keys):
33 Update the internal state of keys with the new state given.
35 :param key: a tuple of chars for the currently pressed keys.
37 # First remove the already released keys
42 # self.keystates contains now the list of currently pressed keys,
44 for key in self.keystates.keys():
48 for key in keys:
58 def create_array_report(self, keys, reportID=None, application=None):
62 :param keys: a tuple of chars for the pressed keys
[all...]
/kernel/linux/linux-6.6/scripts/dtc/
H A Ddt_to_config94 'gpio-keys' => ['drivers/input/keyboard/gpio_keys.c'],
1030 for my $compat (sort keys %compat_white_list) {
1039 for my $compat (sort keys %driver_hard_code_list) {
1044 for my $compat (sort keys %driver_hard_code_list) {
1065 for my $driver (sort keys %driver_config_hard_code_list) {
1070 for my $driver (sort keys %driver_config_hard_code_list) {
1180 for my $compat (keys %driver_hard_code_list) {
1191 for my $driver (keys %driver_config_hard_code_list) {
/third_party/python/Tools/c-analyzer/c_common/
H A Dscriptutil.py489 def process_args(args, argv, processors, *, keys=None):
493 if keys is None:
498 remainder = set(keys)
513 def process_args_by_key(args, argv, processors, keys):
514 extracted = process_args(args, argv, processors, keys=keys)
515 return [extracted[key] for key in keys]
/third_party/wpa_supplicant/wpa_supplicant-2.9/src/tls/
H A Dtlsv1_client.c742 * @keys: Structure of random data (filled on success)
745 int tlsv1_client_get_random(struct tlsv1_client *conn, struct tls_random *keys) in tlsv1_client_get_random() argument
747 os_memset(keys, 0, sizeof(*keys)); in tlsv1_client_get_random()
751 keys->client_random = conn->client_random; in tlsv1_client_get_random()
752 keys->client_random_len = TLS_RANDOM_LEN; in tlsv1_client_get_random()
755 keys->server_random = conn->server_random; in tlsv1_client_get_random()
756 keys->server_random_len = TLS_RANDOM_LEN; in tlsv1_client_get_random()
/third_party/wpa_supplicant/wpa_supplicant-2.9_standard/src/tls/
H A Dtlsv1_client.c766 * @keys: Structure of random data (filled on success)
769 int tlsv1_client_get_random(struct tlsv1_client *conn, struct tls_random *keys) in tlsv1_client_get_random() argument
771 os_memset(keys, 0, sizeof(*keys)); in tlsv1_client_get_random()
775 keys->client_random = conn->client_random; in tlsv1_client_get_random()
776 keys->client_random_len = TLS_RANDOM_LEN; in tlsv1_client_get_random()
779 keys->server_random = conn->server_random; in tlsv1_client_get_random()
780 keys->server_random_len = TLS_RANDOM_LEN; in tlsv1_client_get_random()
/foundation/deviceprofile/device_info_manager/services/core/src/deviceprofilemanager/listener/
H A Dkv_data_change_listener.cpp73 void KvDataChangeListener::OnChange(const DistributedKv::DataOrigin& origin, Keys&& keys) in OnChange() argument
80 .GetEntriesByKeys(keys[ChangeOp::OP_INSERT]); in OnChange()
85 .GetEntriesByKeys(keys[ChangeOp::OP_UPDATE]); in OnChange()
89 std::vector<std::string> delKeys = keys[ChangeOp::OP_DELETE]; in OnChange()
/foundation/distributeddatamgr/datamgr_service/services/distributeddataservice/service/test/mock/
H A Ddb_store_mock.h61 DBStatus DeleteBatch(const std::vector<Key> &keys) override;
85 DBStatus DeleteLocalBatch(const std::vector<Key> &keys) override;
101 DBStatus GetKeys(const Key &keyPrefix, std::vector<Key> &keys) const override;
123 DBStatus DeleteBatch(ConcurrentMap<Key, Value> &store, const std::vector<Key> &keys);
/foundation/distributeddatamgr/relational_store/frameworks/js/napi/common/src/
H A Djs_sendable_utils.cpp123 napi_value keys = nullptr; in ToSendableObject() local
125 static_cast<napi_key_filter>(napi_key_enumerable | napi_key_skip_symbols), napi_key_numbers_to_strings, &keys); in ToSendableObject()
128 status = napi_get_array_length(env, keys, &length); in ToSendableObject()
135 status = napi_get_element(env, keys, i, &key); in ToSendableObject()
/foundation/distributedhardware/distributed_hardware_fwk/services/distributedhardwarefwkservice/src/resourcemanager/
H A Dlocal_capability_info_manager.cpp122 std::vector<std::string> keys; in AddCapability() local
132 keys.push_back(key); in AddCapability()
135 if (keys.empty() || values.empty()) { in AddCapability()
139 if (dbAdapterPtr_->PutDataBatch(keys, values) != DH_FWK_SUCCESS) { in AddCapability()
/foundation/graphic/graphic_2d/rosen/modules/composer/hdi_backend/test/unittest/
H A Dhdiscreen_test.cpp109 std::vector<GraphicHDRMetadataKey> keys; in HWTEST_F() local
110 ASSERT_EQ(hdiScreen_->GetSupportedMetaDataKey(keys), GRAPHIC_DISPLAY_NULL_PTR); in HWTEST_F()
395 std::vector<GraphicHDRMetadataKey> keys = { key }; in HWTEST_F() local
396 ASSERT_EQ(HdiScreenTest::hdiScreen_->GetSupportedMetaDataKey(keys), 0); in HWTEST_F()
/kernel/linux/linux-5.10/security/keys/
H A Dgc.c10 #include <keys/keyring-type.h>
19 * Reaper for unused keys.
25 * Reaper for links from keyrings to dead keys.
93 * reaper to go through a cycle finding expired keys.
103 * Reap keys of dead type.
106 * collector: the first to mark keys of that type as being dead, the second to
107 * collect dead links and the third to clean up the dead keys. We have to be
133 * Garbage collect a list of unreferenced, detached keys
135 static noinline void key_gc_unused_keys(struct list_head *keys) in key_gc_unused_keys() argument
137 while (!list_empty(keys)) { in key_gc_unused_keys()
[all...]
/kernel/linux/linux-5.10/tools/lib/bpf/
H A Dbpf.h138 LIBBPF_API int bpf_map_delete_batch(int fd, void *keys,
142 void *keys, void *values, __u32 *count,
145 void *out_batch, void *keys,
148 LIBBPF_API int bpf_map_update_batch(int fd, void *keys, void *values,
/kernel/linux/linux-5.10/fs/nilfs2/
H A Ddirect.c203 __u64 *keys, __u64 *ptrs, int nitems) in nilfs_direct_gather_data()
215 keys[n] = key; in nilfs_direct_gather_data()
224 __u64 key, __u64 *keys, __u64 *ptrs, int n) in nilfs_direct_delete_and_convert()
243 if ((j < n) && (i == keys[j])) { in nilfs_direct_delete_and_convert()
202 nilfs_direct_gather_data(struct nilfs_bmap *direct, __u64 *keys, __u64 *ptrs, int nitems) nilfs_direct_gather_data() argument
223 nilfs_direct_delete_and_convert(struct nilfs_bmap *bmap, __u64 key, __u64 *keys, __u64 *ptrs, int n) nilfs_direct_delete_and_convert() argument
/kernel/linux/linux-5.10/include/uapi/linux/
H A Dbcache.h21 /* Btree keys - all units are in sectors */
213 __le16 keys; member
272 __u16 keys; member
335 * last_seq is the oldest journal entry that still has keys the btree hasn't
350 __u32 keys; member
416 * On disk a btree node is a list/log of these; within each set the keys are
424 __u32 keys; member
/kernel/linux/linux-6.6/fs/nilfs2/
H A Ddirect.c203 __u64 *keys, __u64 *ptrs, int nitems) in nilfs_direct_gather_data()
215 keys[n] = key; in nilfs_direct_gather_data()
224 __u64 key, __u64 *keys, __u64 *ptrs, int n) in nilfs_direct_delete_and_convert()
243 if ((j < n) && (i == keys[j])) { in nilfs_direct_delete_and_convert()
202 nilfs_direct_gather_data(struct nilfs_bmap *direct, __u64 *keys, __u64 *ptrs, int nitems) nilfs_direct_gather_data() argument
223 nilfs_direct_delete_and_convert(struct nilfs_bmap *bmap, __u64 key, __u64 *keys, __u64 *ptrs, int n) nilfs_direct_delete_and_convert() argument
/kernel/linux/linux-6.6/drivers/md/bcache/
H A Dbcache_ondisk.h21 /* Btree keys - all units are in sectors */
214 __le16 keys; member
273 __u16 keys; member
336 * last_seq is the oldest journal entry that still has keys the btree hasn't
351 __u32 keys; member
417 * On disk a btree node is a list/log of these; within each set the keys are
425 __u32 keys; member
/kernel/linux/linux-6.6/security/keys/
H A Dgc.c10 #include <keys/keyring-type.h>
19 * Reaper for unused keys.
25 * Reaper for links from keyrings to dead keys.
93 * reaper to go through a cycle finding expired keys.
103 * Reap keys of dead type.
106 * collector: the first to mark keys of that type as being dead, the second to
107 * collect dead links and the third to clean up the dead keys. We have to be
133 * Garbage collect a list of unreferenced, detached keys
135 static noinline void key_gc_unused_keys(struct list_head *keys) in key_gc_unused_keys() argument
137 while (!list_empty(keys)) { in key_gc_unused_keys()
[all...]
/test/xts/hats/hdf/display/buffer/unittest/
H A Ddisplay_buffer_ut.cpp233 std::vector<uint32_t> keys = {}; in MetadataTest() local
243 ret = displayBuffer_->ListMetadataKeys(handle, keys); in MetadataTest()
246 EXPECT_TRUE(keys.size() == 1 && keys[0] == key); in MetadataTest()
/third_party/icu/icu4j/main/classes/core/src/com/ibm/icu/impl/
H A DRelation.java27 * A Relation is a set of mappings from keys to values.
158 public V putAll(Collection<K> keys, V value) { in putAll() argument
160 for (K key : keys) { in putAll()
325 public final Set<V> removeAll(K... keys) { in removeAll() argument
326 return removeAll(Arrays.asList(keys)); in removeAll()
/third_party/icu/tools/unicodetools/com/ibm/rbm/
H A DRBTMXExporter.java118 Enumeration keys = lookups.keys(); in appendTUV()
119 while (keys.hasMoreElements()) { in appendTUV()
120 String key = (String)keys.nextElement(); in appendTUV()
H A DRBTMXImporter.java235 Enumeration keys = hash.keys(); in getEncodingsVector()
236 while (keys.hasMoreElements()) { in getEncodingsVector()
237 v.addElement(keys.nextElement()); in getEncodingsVector()
/third_party/icu/ohos_icu4j/src/main/java/ohos/global/icu/impl/
H A DRelation.java28 * A Relation is a set of mappings from keys to values.
160 public V putAll(Collection<K> keys, V value) { in putAll() argument
162 for (K key : keys) { in putAll()
327 public final Set<V> removeAll(K... keys) { in removeAll() argument
328 return removeAll(Arrays.asList(keys)); in removeAll()
/third_party/node/test/pummel/
H A Dtest-policy-integrity-worker-commonjs.js237 const keys = Object.keys(configurations);
238 if (keys.length === 0) {
241 const config = keys[0];

Completed in 20 milliseconds

1...<<21222324252627282930>>...146