Searched refs:key2 (Results 1 - 25 of 76) sorted by relevance

1234

/linux-master/tools/testing/selftests/alsa/
H A Dalsa-local.h19 snd_config_t *conf_get_subtree(snd_config_t *root, const char *key1, const char *key2);
20 int conf_get_count(snd_config_t *root, const char *key1, const char *key2);
21 const char *conf_get_string(snd_config_t *root, const char *key1, const char *key2, const char *def);
22 long conf_get_long(snd_config_t *root, const char *key1, const char *key2, long def);
23 int conf_get_bool(snd_config_t *root, const char *key1, const char *key2, int def);
24 void conf_get_string_array(snd_config_t *root, const char *key1, const char *key2,
H A Dconf.c350 const char *key2, snd_config_t **result)
359 if (key2)
360 ret = snd_config_search(root, key2, &root);
366 snd_config_t *conf_get_subtree(snd_config_t *root, const char *key1, const char *key2) argument
372 ret = conf_get_by_keys(root, key1, key2, &root);
376 ksft_exit_fail_msg("key '%s'.'%s' search error: %s\n", key1, key2, snd_strerror(ret));
380 int conf_get_count(snd_config_t *root, const char *key1, const char *key2) argument
388 ret = conf_get_by_keys(root, key1, key2, &cfg);
392 ksft_exit_fail_msg("key '%s'.'%s' search error: %s\n", key1, key2, snd_strerror(ret));
394 ksft_exit_fail_msg("key '%s'.'%s' is not a compound\n", key1, key2);
349 conf_get_by_keys(snd_config_t *root, const char *key1, const char *key2, snd_config_t **result) argument
401 conf_get_string(snd_config_t *root, const char *key1, const char *key2, const char *def) argument
419 conf_get_long(snd_config_t *root, const char *key1, const char *key2, long def) argument
437 conf_get_bool(snd_config_t *root, const char *key1, const char *key2, int def) argument
455 conf_get_string_array(snd_config_t *root, const char *key1, const char *key2, const char **array, int array_size, const char *def) argument
[all...]
/linux-master/drivers/input/keyboard/
H A Dep93xx_keypad.c76 int key2; member in struct:ep93xx_keypad
88 int keycode, key1, key2; local
96 key2 = keypad->keycodes[keycode];
99 if (keypad->key1 && key1 != keypad->key1 && key2 != keypad->key1)
102 if (keypad->key2 && key1 != keypad->key2 && key2 != keypad->key2)
103 input_report_key(input_dev, keypad->key2, 0);
106 input_report_key(input_dev, key2,
[all...]
/linux-master/security/selinux/ss/
H A Dsymtab.c28 static int symcmp(const void *key1, const void *key2) argument
33 keyp2 = key2;
H A Davtab.c99 const struct avtab_key *key2)
103 if (key1->source_type == key2->source_type &&
104 key1->target_type == key2->target_type &&
105 key1->target_class == key2->target_class &&
106 (specified & key2->specified))
108 if (key1->source_type < key2->source_type)
110 if (key1->source_type == key2->source_type &&
111 key1->target_type < key2->target_type)
113 if (key1->source_type == key2->source_type &&
114 key1->target_type == key2
98 avtab_node_cmp(const struct avtab_key *key1, const struct avtab_key *key2) argument
[all...]
H A Dhashtab.h23 int (*cmp)(const void *key1, const void *key2); /* comparison func */
/linux-master/net/mptcp/
H A Dcrypto_test.c37 u64 key1, key2; local
44 key2 = be64_to_cpu(*((__be64 *)&tests[i].key[8]));
51 mptcp_crypto_hmac_sha(key1, key2, msg, 8, hmac);
H A Dcrypto.c44 void mptcp_crypto_hmac_sha(u64 key1, u64 key2, u8 *msg, int len, void *hmac) argument
55 put_unaligned_be64(key2, key2be);
/linux-master/kernel/futex/
H A Drequeue.c73 * @key2: the new key for the requeued futex_q
77 struct futex_hash_bucket *hb2, union futex_key *key2)
81 * If key1 and key2 hash to the same bucket, no need to
91 q->key = *key2;
248 * @key2: the to futex key
271 union futex_key *key2, struct futex_pi_state **ps,
306 if (!futex_match(top_waiter->requeue_pi_key, key2))
321 ret = futex_lock_pi_atomic(pifutex, hb2, key2, ps, top_waiter->task,
330 requeue_pi_wake_futex(top_waiter, key2, hb2);
371 union futex_key key1 = FUTEX_KEY_INIT, key2 local
76 requeue_futex(struct futex_q *q, struct futex_hash_bucket *hb1, struct futex_hash_bucket *hb2, union futex_key *key2) argument
269 futex_proxy_trylock_atomic(u32 __user *pifutex, struct futex_hash_bucket *hb1, struct futex_hash_bucket *hb2, union futex_key *key1, union futex_key *key2, struct futex_pi_state **ps, struct task_struct **exiting, int set_waiters) argument
773 union futex_key key2 = FUTEX_KEY_INIT; local
[all...]
H A Dfutex.h208 * @key2: Pointer to key2
212 static inline int futex_match(union futex_key *key1, union futex_key *key2) argument
214 return (key1 && key2
215 && key1->both.word == key2->both.word
216 && key1->both.ptr == key2->both.ptr
217 && key1->both.offset == key2->both.offset);
H A Dwaitwake.c256 union futex_key key1 = FUTEX_KEY_INIT, key2 = FUTEX_KEY_INIT; local
266 ret = get_futex_key(uaddr2, flags, &key2, FUTEX_WRITE);
271 hb2 = futex_hash(&key2);
316 if (futex_match (&this->key, &key2)) {
/linux-master/fs/xfs/libxfs/
H A Dxfs_btree.h185 * Difference between key2 and key1 -- positive if key1 > key2,
186 * negative if key1 < key2, and zero if equal. If the @mask parameter
192 const union xfs_btree_key *key2,
210 * Given two btree keys @key1 and @key2, decide if it is impossible for
212 * @key1 < K < @key2. To determine if two btree records are
214 * record and @key2 should be the low key of the second record.
220 const union xfs_btree_key *key2,
530 const union xfs_btree_key *key2);
546 const union xfs_btree_key *key2)
543 xfs_btree_keycmp_lt( struct xfs_btree_cur *cur, const union xfs_btree_key *key1, const union xfs_btree_key *key2) argument
552 xfs_btree_keycmp_gt( struct xfs_btree_cur *cur, const union xfs_btree_key *key1, const union xfs_btree_key *key2) argument
561 xfs_btree_keycmp_eq( struct xfs_btree_cur *cur, const union xfs_btree_key *key1, const union xfs_btree_key *key2) argument
570 xfs_btree_keycmp_le( struct xfs_btree_cur *cur, const union xfs_btree_key *key1, const union xfs_btree_key *key2) argument
579 xfs_btree_keycmp_ge( struct xfs_btree_cur *cur, const union xfs_btree_key *key1, const union xfs_btree_key *key2) argument
588 xfs_btree_keycmp_ne( struct xfs_btree_cur *cur, const union xfs_btree_key *key1, const union xfs_btree_key *key2) argument
598 xfs_btree_masked_keycmp_lt( struct xfs_btree_cur *cur, const union xfs_btree_key *key1, const union xfs_btree_key *key2, const union xfs_btree_key *mask) argument
608 xfs_btree_masked_keycmp_gt( struct xfs_btree_cur *cur, const union xfs_btree_key *key1, const union xfs_btree_key *key2, const union xfs_btree_key *mask) argument
618 xfs_btree_masked_keycmp_ge( struct xfs_btree_cur *cur, const union xfs_btree_key *key1, const union xfs_btree_key *key2, const union xfs_btree_key *mask) argument
[all...]
/linux-master/arch/powerpc/crypto/
H A Daesp8-ppc.h28 const struct aes_key *key1, const struct aes_key *key2, u8 *iv);
30 const struct aes_key *key1, const struct aes_key *key2, u8 *iv);
/linux-master/fs/befs/
H A Dbtree.c120 const void *key2, int keylen2);
704 * @key2: pointer to the second key to be compared
705 * @keylen2: length in bytes of key2
707 * Returns 0 if @key1 and @key2 are equal.
709 * Returns <0 if @key2 is greater.
713 const void *key2, int keylen2)
716 int result = strncmp(key1, key2, len);
725 btree_compare_int32(cont void *key1, int keylen1, const void *key2, int keylen2)
727 return *(int32_t *) key1 - *(int32_t *) key2;
732 const void *key2, in
712 befs_compare_strings(const void *key1, int keylen1, const void *key2, int keylen2) argument
[all...]
/linux-master/arch/arm/crypto/
H A Daes-ce-core.S26 .macro enc_dround, key1, key2
28 enc_round q0, \key2
31 .macro dec_dround, key1, key2
33 dec_round q0, \key2
36 .macro enc_fround, key1, key2, key3
38 aese.8 q0, \key2
42 .macro dec_fround, key1, key2, key3
44 aesd.8 q0, \key2
48 .macro enc_dround_4x, key1, key2
53 enc_round q0, \key2
[all...]
/linux-master/fs/ubifs/
H A Dkey.h473 * @key2: the second key to compare
476 * @key2, %0 if the keys are equivalent and %1 if @key1 is greater than @key2.
480 const union ubifs_key *key2)
482 if (key1->u32[0] < key2->u32[0])
484 if (key1->u32[0] > key2->u32[0])
486 if (key1->u32[1] < key2->u32[1])
488 if (key1->u32[1] > key2->u32[1])
498 * @key2: the second key to compare
500 * This function compares 2 keys and returns %1 if @key1 is equal to @key2 an
478 keys_cmp(const struct ubifs_info *c, const union ubifs_key *key1, const union ubifs_key *key2) argument
503 keys_eq(const struct ubifs_info *c, const union ubifs_key *key1, const union ubifs_key *key2) argument
[all...]
/linux-master/tools/testing/selftests/hid/tests/
H A Dtest_gamepad.py72 key2 = libevdev.evbit(uhdev.buttons_map[b2])
77 expected_event1 = libevdev.InputEvent(key2, 1)
84 assert evdev.value[key2] == 1
93 assert evdev.value[key2] == 1
97 expected_event = libevdev.InputEvent(key2, 0)
102 assert evdev.value[key2] == 0
/linux-master/tools/lib/bpf/
H A Dstrset.c30 static bool strset_equal_fn(long key1, long key2, void *ctx) argument
34 const char *str2 = s->strs_data + key2;
/linux-master/drivers/infiniband/sw/rxe/
H A Drxe_verbs.h16 static inline int pkey_match(u16 key1, u16 key2) argument
19 ((key1 & 0x7fff) == (key2 & 0x7fff)) &&
20 ((key1 & 0x8000) || (key2 & 0x8000))) ? 1 : 0;
/linux-master/include/linux/
H A Dbtree-128.h88 u64 key1, u64 key2, size_t index);
/linux-master/fs/hfs/
H A Dcatalog.c161 * struct hfs_cat_key *key2: pointer to the second key to compare
165 * int: negative if key1<key2, positive if key1>key2, and 0 if key1==key2
167 * key1 and key2 point to "valid" (struct hfs_cat_key)s.
171 int hfs_cat_keycmp(const btree_key *key1, const btree_key *key2) argument
176 k2p = key2->cat.ParID;
182 key2->cat.CName.name, key2->cat.CName.len);
H A Dextent.c41 * struct hfs_ext_key *key2: pointer to the second key to compare
45 * int: negative if key1<key2, positive if key1>key2, and 0 if key1==key2
47 * key1 and key2 point to "valid" (struct hfs_ext_key)s.
50 int hfs_ext_keycmp(const btree_key *key1, const btree_key *key2) argument
56 fnum2 = key2->ext.FNum;
59 if (key1->ext.FkType != key2->ext.FkType)
60 return key1->ext.FkType < key2->ext.FkType ? -1 : 1;
63 block2 = key2
[all...]
/linux-master/drivers/md/dm-vdo/indexer/
H A Dradix-sort.c66 static inline int compare(sort_key_t key1, sort_key_t key2, u16 offset, u16 length) argument
68 return memcmp(&key1[offset], &key2[offset], length);
/linux-master/tools/perf/util/
H A Dthreads.c18 static bool key_equal(long key1, long key2, void *ctx __maybe_unused) argument
20 return key1 == key2;
/linux-master/kernel/bpf/
H A Dlocal_storage.c44 const struct bpf_cgroup_storage_key *key2 = _key2; local
46 if (key1->cgroup_inode_id < key2->cgroup_inode_id)
48 else if (key1->cgroup_inode_id > key2->cgroup_inode_id)
50 else if (key1->attach_type < key2->attach_type)
52 else if (key1->attach_type > key2->attach_type)

Completed in 366 milliseconds

1234