Searched refs:key1 (Results 1 - 25 of 74) sorted by relevance

123

/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.c349 static int conf_get_by_keys(snd_config_t *root, const char *key1, argument
354 if (key1) {
355 ret = snd_config_search(root, key1, &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, key
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.c75 int key1; member in struct:ep93xx_keypad
88 int keycode, key1, key2; local
93 key1 = keypad->keycodes[keycode];
99 if (keypad->key1 && key1 != keypad->key1 && key2 != keypad->key1)
100 input_report_key(input_dev, keypad->key1, 0);
102 if (keypad->key2 && key1 != keypad->key2 && key2 != keypad->key2)
105 input_report_key(input_dev, key1,
[all...]
/linux-master/security/selinux/ss/
H A Dsymtab.c28 static int symcmp(const void *key1, const void *key2) argument
32 keyp1 = key1;
H A Davtab.c98 static int avtab_node_cmp(const struct avtab_key *key1, argument
101 u16 specified = key1->specified & ~(AVTAB_ENABLED | AVTAB_ENABLED_OLD);
103 if (key1->source_type == key2->source_type &&
104 key1->target_type == key2->target_type &&
105 key1->target_class == key2->target_class &&
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
[all...]
/linux-master/net/mptcp/
H A Dcrypto_test.c37 u64 key1, key2; local
43 key1 = be64_to_cpu(*((__be64 *)&tests[i].key[0]));
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
54 put_unaligned_be64(key1, key1be);
/linux-master/tools/testing/selftests/bpf/prog_tests/
H A Dtimer_mim.c10 int err, prog_fd, key1 = 1; local
38 err = bpf_map__delete_elem(timer_skel->maps.outer_arr, &key1, sizeof(key1), 0);
/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
191 const union xfs_btree_key *key1,
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
213 * immediately adjacent, @key1 should be the high key of the first
219 const union xfs_btree_key *key1,
529 const union xfs_btree_key *key1,
545 const union xfs_btree_key *key1,
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.c119 static int befs_compare_strings(const void *key1, int keylen1,
702 * @key1: pointer to the first key to be compared
703 * @keylen1: length in bytes of key1
707 * Returns 0 if @key1 and @key2 are equal.
708 * Returns >0 if @key1 is greater.
712 befs_compare_strings(const void *key1, int keylen1, argument
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;
731 btree_compare_uint32(cont void *key1, in
[all...]
/linux-master/arch/arm/crypto/
H A Daes-ce-core.S26 .macro enc_dround, key1, key2
27 enc_round q0, \key1
31 .macro dec_dround, key1, key2
32 dec_round q0, \key1
36 .macro enc_fround, key1, key2, key3
37 enc_round q0, \key1
42 .macro dec_fround, key1, key2, key3
43 dec_round q0, \key1
48 .macro enc_dround_4x, key1, key2
49 enc_round q0, \key1
[all...]
/linux-master/fs/ubifs/
H A Dkey.h472 * @key1: the first key to compare
475 * This function compares 2 keys and returns %-1 if @key1 is less than
476 * @key2, %0 if the keys are equivalent and %1 if @key1 is greater than @key2.
479 const union ubifs_key *key1,
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])
497 * @key1: the first key to compare
500 * This function compares 2 keys and returns %1 if @key1 i
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...]
H A Dtnc_misc.c391 const union ubifs_key *key1, *key2; local
393 key1 = &znode->zbranch[i].key;
396 cmp = keys_cmp(c, key1, key2);
401 } else if (cmp == 0 && !is_hash_key(c, key1)) {
485 union ubifs_key key1, *key = &zbr->key; local
507 key_read(c, node + UBIFS_KEY_OFFSET, &key1);
508 if (!keys_eq(c, key, &key1)) {
512 dbg_tnck(&key1, "but found node's key ");
H A Dtnc.c1730 union ubifs_key key1; local
1759 key_read(c, buf + UBIFS_KEY_OFFSET, &key1);
1760 if (!keys_eq(c, &zbr->key, &key1)) {
1764 dbg_tnck(&key1, "found node's key ");
2036 union ubifs_key *key, *key1; local
2042 key1 = &znode->parent->zbranch[0].key;
2044 while (keys_cmp(c, key, key1) < 0) {
2045 key_copy(c, key, key1);
2050 key1 = &znode->parent->zbranch[0].key;
2123 union ubifs_key *key = &zbr->key, *key1; local
2905 union ubifs_key key1, key2; local
[all...]
/linux-master/tools/testing/selftests/hid/tests/
H A Dtest_gamepad.py70 key1 = libevdev.evbit(uhdev.buttons_map[b1])
76 expected_event0 = libevdev.InputEvent(key1, 1)
83 assert evdev.value[key1] == 1
88 expected_event = libevdev.InputEvent(key1, 0)
92 assert evdev.value[key1] == 0
101 assert evdev.value[key1] == 0
/linux-master/kernel/futex/
H A Dfutex.h207 * @key1: Pointer to key1
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 Drequeue.c81 * If key1 and key2 hash to the same bucket, no need to
247 * @key1: the from futex key
270 struct futex_hash_bucket *hb2, union futex_key *key1,
292 top_waiter = futex_top_waiter(hb1, key1);
371 union futex_key key1 = FUTEX_KEY_INIT, key2 = FUTEX_KEY_INIT; local
431 ret = get_futex_key(uaddr1, flags1, &key1, FUTEX_READ);
443 if (requeue_pi && futex_match(&key1, &key2))
446 hb1 = futex_hash(&key1);
488 ret = futex_proxy_trylock_atomic(uaddr2, hb1, hb2, &key1,
578 if (!futex_match(&this->key, &key1))
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
[all...]
H A Dwaitwake.c256 union futex_key key1 = FUTEX_KEY_INIT, key2 = FUTEX_KEY_INIT; local
263 ret = get_futex_key(uaddr1, flags, &key1, FUTEX_READ);
270 hb1 = futex_hash(&key1);
302 if (futex_match (&this->key, &key1)) {
/linux-master/crypto/
H A Dxcbc.c57 u8 key1[XCBC_BLOCKSIZE]; local
58 int bs = sizeof(key1);
65 crypto_cipher_encrypt_one(ctx->child, key1, (u8 *)ks);
67 return crypto_cipher_setkey(ctx->child, key1, bs);
/linux-master/tools/lib/bpf/
H A Dstrset.c30 static bool strset_equal_fn(long key1, long key2, void *ctx) argument
33 const char *str1 = s->strs_data + key1;
/linux-master/drivers/infiniband/sw/rxe/
H A Drxe_verbs.h16 static inline int pkey_match(u16 key1, u16 key2) argument
18 return (((key1 & 0x7fff) != 0) &&
19 ((key1 & 0x7fff) == (key2 & 0x7fff)) &&
20 ((key1 & 0x8000) || (key2 & 0x8000))) ? 1 : 0;
/linux-master/arch/arm64/crypto/
H A Daes-glue.c117 struct crypto_aes_ctx key1; member in struct:crypto_aes_xts_ctx
122 struct crypto_aes_ctx key1; member in struct:crypto_aes_essiv_cbc_ctx
155 ret = aes_expandkey(&ctx->key1, in_key, key_len / 2);
170 ret = aes_expandkey(&ctx->key1, in_key, key_len);
411 int err, rounds = 6 + ctx->key1.key_length / 4;
421 ctx->key1.key_enc, rounds, blocks,
433 int err, rounds = 6 + ctx->key1.key_length / 4;
443 ctx->key1.key_dec, rounds, blocks,
545 int err, first, rounds = 6 + ctx->key1.key_length / 4;
584 ctx->key1
[all...]
/linux-master/include/linux/
H A Dbtree-128.h88 u64 key1, u64 key2, size_t index);
/linux-master/fs/hfs/
H A Dcatalog.c160 * struct hfs_cat_key *key1: pointer to the first 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
175 k1p = key1->cat.ParID;
181 return hfs_strcmp(key1->cat.CName.name, key1->cat.CName.len,

Completed in 213 milliseconds

123