/linux-master/tools/testing/selftests/bpf/progs/ |
H A D | test_obj_id.c | 12 __type(key, __u32); 19 __u32 key = 0; local 22 value = bpf_map_lookup_elem(&test_map_id, &key);
|
H A D | linked_maps2.c | 8 /* modifiers and typedefs are ignored when comparing key/value types */ 14 __type(key, key_type); 21 __type(key, int); 29 __type(key, int); 41 /* update values with key = 2 */ 42 int key = 2, val = 2; local 47 bpf_map_update_elem(&map2, &key, &val, 0); 48 bpf_map_update_elem(&map_weak, &key, &val, 0); 56 /* lookup values with key = 1, set in another file */ 57 int key local [all...] |
H A D | linked_maps1.c | 13 __type(key, struct my_key); 23 __type(key, int); 35 __type(key, int); 47 /* update values with key = 1 */ 48 int key = 1, val = 1; local 53 bpf_map_update_elem(&map2, &key, &val, 0); 54 bpf_map_update_elem(&map_weak, &key, &val, 0); 62 /* lookup values with key = 2, set in another file */ 63 int key = 2, *val; local 71 val = bpf_map_lookup_elem(&map2, &key); [all...] |
H A D | recursion.c | 13 __type(key, int); 20 __type(key, int); 30 int key = 0; local 38 bpf_map_delete_elem(&hash2, &key);
|
H A D | sample_map_ret0.c | 7 __type(key, __u32); 14 __type(key, __u32); 23 __u32 key = 0; local 26 value = bpf_map_lookup_elem(&htab, &key);
|
H A D | bpf_iter_bpf_array_map.c | 18 __type(key, __u32); 25 __type(key, __u64); 35 __u32 *hmap_val, *key = ctx->key; local 38 if (key == (void *)0 || val == (void *)0) 41 bpf_seq_write(ctx->meta->seq, key, sizeof(__u32)); 43 key_sum += *key; 46 /* workaround - It's necessary to do this convoluted (val, key) 48 * bpf_map_update_elem(&hashmap1, val, key, BPF_ANY); 49 * because key ha [all...] |
/linux-master/tools/testing/selftests/bpf/prog_tests/ |
H A D | inner_array_lookup.c | 10 int key = 3; local 23 bpf_map_update_elem(map1_fd, &key, &val, 0); 26 bpf_map_lookup_elem(map1_fd, &key, &val);
|
/linux-master/drivers/md/dm-vdo/ |
H A D | int-map.h | 32 void *vdo_int_map_get(struct int_map *map, u64 key); 34 int __must_check vdo_int_map_put(struct int_map *map, u64 key, void *new_value, 37 void *vdo_int_map_remove(struct int_map *map, u64 key);
|
H A D | murmurhash3.h | 13 void murmurhash3_128(const void *key, int len, u32 seed, void *out);
|
/linux-master/include/linux/ |
H A D | btree-128.h | 24 u64 key[2] = {k1, k2}; local 25 return btree_lookup(&head->h, &btree_geo128, (unsigned long *)&key); 31 u64 key[2] = {*k1, *k2}; local 35 (unsigned long *)&key); 36 *k1 = key[0]; 37 *k2 = key[1]; 44 u64 key[2] = {k1, k2}; local 46 (unsigned long *)&key, val, gfp); 52 u64 key[2] = {k1, k2}; local 54 (unsigned long *)&key, va 59 u64 key[2] = {k1, k2}; local 65 u64 key[2]; local [all...] |
/linux-master/include/keys/ |
H A D | dns_resolver-type.h | 2 /* DNS resolver key type 11 #include <linux/key-type.h>
|
/linux-master/tools/testing/selftests/drivers/net/netdevsim/ |
H A D | ethtool-coalesce.sh | 14 for key in ${!SETTINGS_MAP[@]}; do 15 CURRENT_SETTINGS[$key]=$(get_value $key) 99 for key in ${!SETTINGS_MAP[@]}; do 100 EXPECTED_SETTINGS[$key]=$(get_value $key) 104 for key in ${!SETTINGS_MAP[@]}; do 107 ethtool -C $NSIM_NETDEV "$key" "$value" 109 EXPECTED_SETTINGS[$key]="$value"
|
H A D | ethtool-ring.sh | 15 for key in ${!SETTINGS_MAP[@]}; do 16 CURRENT_SETTINGS[$key]=$(get_value $key) 61 for key in ${!SETTINGS_MAP[@]}; do 62 EXPECTED_SETTINGS[$key]=$(get_value $key) 66 for key in ${!SETTINGS_MAP[@]}; do 69 ethtool -G $NSIM_NETDEV "$key" "$value" 71 EXPECTED_SETTINGS[$key]="$value"
|
/linux-master/arch/s390/crypto/ |
H A D | chacha-s390.h | 11 void chacha20_vx(u8 *out, const u8 *inp, size_t len, const u32 *key,
|
/linux-master/drivers/tee/optee/ |
H A D | notif.c | 18 u_int key; member in struct:notif_entry 21 static bool have_key(struct optee *optee, u_int key) argument 26 if (entry->key == key) 32 int optee_notif_wait(struct optee *optee, u_int key) argument 38 if (key > optee->notif.max_key) 45 entry->key = key; 50 * If the bit is already set it means that the key has already 53 if (test_bit(key, opte 85 optee_notif_send(struct optee *optee, u_int key) argument [all...] |
/linux-master/tools/testing/radix-tree/linux/ |
H A D | lockdep.h | 11 struct lock_class_key *key) 10 lockdep_set_class(spinlock_t *lock, struct lock_class_key *key) argument
|
/linux-master/security/integrity/ima/ |
H A D | ima_asymmetric_keys.c | 8 * Defines an IMA hook to measure asymmetric keys on key 19 * @keyring: keyring to which the key is linked to 20 * @key: created or updated key 21 * @payload: The data used to instantiate or update the key. 23 * @flags: key flags 24 * @create: flag indicating whether the key was created or updated 27 * The payload data used to instantiate or update the key is measured. 29 void ima_post_key_create_or_update(struct key *keyring, struct key *ke argument [all...] |
/linux-master/crypto/asymmetric_keys/ |
H A D | restrict.c | 2 /* Instantiate a public key crypto key from an X.509 Certificate 43 ca_keyid = p; /* owner key 'id:xxxxxx' */ 56 * @type: The type of key being added. 57 * @payload: The payload of the new key. 61 * those is the signing key and validates the new certificate, then mark the 66 * signature check fails or the key is blacklisted, -ENOPKG if the signature 70 int restrict_link_by_signature(struct key *dest_keyring, 73 struct key *trust_keyring) 76 struct key *ke local 212 struct key *key = NULL; local [all...] |
/linux-master/arch/powerpc/include/asm/ |
H A D | jump_label.h | 18 static __always_inline bool arch_static_branch(struct static_key *key, bool branch) argument 26 : : "i" (&((char *)key)[branch]) : : l_yes); 33 static __always_inline bool arch_static_branch_jump(struct static_key *key, bool branch) argument 41 : : "i" (&((char *)key)[branch]) : : l_yes);
|
/linux-master/security/keys/ |
H A D | user_defined.c | 2 /* user_defined.c: user defined key type 38 * This key type is essentially the same as key_type_user, but it does 57 * Preparse a user defined key payload 81 * Free a preparse of a user defined key payload 98 * update a user defined key 99 * - the key's semaphore is write-locked 101 int user_update(struct key *key, struct key_preparsed_payload *prep) argument 107 ret = key_payload_reserve(key, prep->datalen); 112 key 128 user_revoke(struct key *key) argument 146 user_destroy(struct key *key) argument 158 user_describe(const struct key *key, struct seq_file *m) argument 171 user_read(const struct key *key, char *buffer, size_t buflen) argument [all...] |
H A D | proc.c | 2 /* procfs files for key database enumeration 51 p = proc_create_seq("key-users", 0, NULL, &proc_key_users_ops); 53 panic("Cannot create /proc/key-users\n"); 70 struct key *key = rb_entry(n, struct key, serial_node); local 71 if (kuid_has_mapping(user_ns, key->user->uid)) 78 static struct key *find_ge_key(struct seq_file *p, key_serial_t id) 82 struct key *minkey = NULL; 85 struct key *ke local 116 struct key *key; local 131 struct key *key = rb_entry(n, struct key, serial_node); local 156 struct key *key = rb_entry(_p, struct key, serial_node); local [all...] |
/linux-master/drivers/nvdimm/ |
H A D | security.c | 11 #include <linux/key.h> 12 #include <linux/key-type.h> 23 MODULE_PARM_DESC(key_revalidate, "Require key validation at init."); 27 static void *key_data(struct key *key) argument 29 struct encrypted_key_payload *epayload = dereference_key_locked(key); 31 lockdep_assert_held_read(&key->sem); 36 static void nvdimm_put_key(struct key *key) argument 38 if (!key) 52 struct key *key = NULL; local 80 nvdimm_get_key_payload(struct nvdimm *nvdimm, struct key **key) argument 94 struct key *key; local 120 nvdimm_get_user_key_payload(struct nvdimm *nvdimm, key_serial_t id, int subclass, struct key **key) argument 141 struct key *key; local 169 struct key *key; local 253 struct key *key; local 302 struct key *key, *newkey; local 351 struct key *key = NULL; local 394 struct key *key = NULL; local 527 unsigned int key, newkey; local [all...] |
/linux-master/crypto/ |
H A D | nhpoly1305.c | 42 static void nh_generic(const u32 *key, const u8 *message, size_t message_len, argument 56 sums[0] += (u64)(u32)(m0 + key[ 0]) * (u32)(m2 + key[ 2]); 57 sums[1] += (u64)(u32)(m0 + key[ 4]) * (u32)(m2 + key[ 6]); 58 sums[2] += (u64)(u32)(m0 + key[ 8]) * (u32)(m2 + key[10]); 59 sums[3] += (u64)(u32)(m0 + key[12]) * (u32)(m2 + key[14]); 60 sums[0] += (u64)(u32)(m1 + key[ 76 process_nh_hash_value(struct nhpoly1305_state *state, const struct nhpoly1305_key *key) argument 92 nhpoly1305_units(struct nhpoly1305_state *state, const struct nhpoly1305_key *key, const u8 *src, unsigned int srclen, nh_t nh_fn) argument 125 crypto_nhpoly1305_setkey(struct crypto_shash *tfm, const u8 *key, unsigned int keylen) argument 160 const struct nhpoly1305_key *key = crypto_shash_ctx(desc->tfm); local 201 const struct nhpoly1305_key *key = crypto_shash_ctx(desc->tfm); local [all...] |
/linux-master/fs/cachefiles/ |
H A D | key.c | 31 * turn the raw key into something cooked 32 * - the key may be up to NAME_MAX in length (including the length word) 35 * - need to cut the cooked key into 252 char lengths (189 raw bytes) 39 const u8 *key = fscache_get_key(object->cookie), *kend; local 45 _enter(",%u,%*phN", keylen, keylen, key); 51 ch = key[i]; 63 memcpy(name + 1, key, keylen); 68 * chunk. We rely on the key having been padded out to a whole number 74 u32 be = be32_to_cpu(*(__be32 *)(key + i)); 75 u32 le = le32_to_cpu(*(__le32 *)(key [all...] |
/linux-master/samples/bpf/ |
H A D | tracex3_user.c | 21 __u32 key; local 24 for (key = 0; key < SLOTS; key++) 25 bpf_map_update_elem(fd, &key, values, BPF_ANY); 82 __u32 key; local 85 for (key = 0; key < SLOTS; key++) { 86 bpf_map_lookup_elem(fd, &key, value [all...] |