Searched refs:key (Results 76 - 100 of 3065) sorted by relevance

1234567891011>>

/linux-master/tools/testing/selftests/bpf/progs/
H A Dtest_btf_map_in_map.c9 __type(key, int);
17 __type(key, int);
24 __type(key, int);
32 __type(key, int);
48 __type(key, int);
57 __type(key, int);
64 __type(key, int);
70 __type(key, int);
84 __type(key, int);
100 __type(key, in
127 int key = 0, val; local
[all...]
H A Dmap_kptr_fail.c18 __type(key, int);
28 int key = 0; local
30 v = bpf_map_lookup_elem(&array_map, &key);
43 int key = 0, id; local
45 v = bpf_map_lookup_elem(&array_map, &key);
62 int key = 0, id; local
64 v = bpf_map_lookup_elem(&array_map, &key);
81 int key = 0; local
83 v = bpf_map_lookup_elem(&array_map, &key);
97 int key local
112 int key = 0, id; local
136 int key = 0; local
156 int key = 0; local
172 int key = 0; local
190 int key = 0; local
209 int key = 0; local
224 int key = 0; local
240 int key = 0; local
260 int key = 0; local
280 int key = 0; local
299 int key = 0; local
317 int key = 0; local
338 int key = 0; local
353 int key = 0; local
372 int key = 0; local
[all...]
H A Dtest_stacktrace_build_id.c14 __type(key, __u32);
21 __type(key, __u32);
31 __type(key, __u32);
38 __type(key, __u32);
47 __u32 key = 0, val = 0, *value_p; local
50 value_p = bpf_map_lookup_elem(&control_map, &key);
55 key = bpf_get_stackid(args, &stackmap, BPF_F_USER_STACK);
56 if ((int)key >= 0) {
57 bpf_map_update_elem(&stackid_hmap, &key, &val, 0);
58 stack_p = bpf_map_lookup_elem(&stack_amap, &key);
[all...]
H A Dtest_stacktrace_map.c14 __type(key, __u32);
21 __type(key, __u32);
30 __type(key, __u32);
37 __type(key, __u32);
57 __u32 key = 0, val = 0, *value_p; local
60 value_p = bpf_map_lookup_elem(&control_map, &key);
65 key = bpf_get_stackid(ctx, &stackmap, 0);
66 if ((int)key >= 0) {
67 bpf_map_update_elem(&stackid_hmap, &key, &val, 0);
68 stack_p = bpf_map_lookup_elem(&stack_amap, &key);
[all...]
H A Dtest_btf_decl_tag.c31 __type(key, struct key_t);
38 struct key_t key; variable in typeref:struct:key_t
41 key.a = key.b = key.c = x;
42 bpf_map_update_elem(&hashmap1, &key, &val, 0);
/linux-master/include/linux/
H A Dbtree-type.h38 static inline void *BTREE_FN(lookup)(BTREE_TYPE_HEAD *head, BTREE_KEYTYPE key) argument
40 unsigned long _key = key;
44 static inline int BTREE_FN(insert)(BTREE_TYPE_HEAD *head, BTREE_KEYTYPE key, argument
47 unsigned long _key = key;
51 static inline int BTREE_FN(update)(BTREE_TYPE_HEAD *head, BTREE_KEYTYPE key, argument
54 unsigned long _key = key;
58 static inline void *BTREE_FN(remove)(BTREE_TYPE_HEAD *head, BTREE_KEYTYPE key) argument
60 unsigned long _key = key;
64 static inline void *BTREE_FN(last)(BTREE_TYPE_HEAD *head, BTREE_KEYTYPE *key) argument
69 *key
73 get_prev(BTREE_TYPE_HEAD *head, BTREE_KEYTYPE *key) argument
82 lookup(BTREE_TYPE_HEAD *head, BTREE_KEYTYPE key) argument
87 insert(BTREE_TYPE_HEAD *head, BTREE_KEYTYPE key, void *val, gfp_t gfp) argument
94 update(BTREE_TYPE_HEAD *head, BTREE_KEYTYPE key, void *val) argument
100 remove(BTREE_TYPE_HEAD *head, BTREE_KEYTYPE key) argument
105 last(BTREE_TYPE_HEAD *head, BTREE_KEYTYPE *key) argument
110 get_prev(BTREE_TYPE_HEAD *head, BTREE_KEYTYPE *key) argument
[all...]
H A Dbtree.h14 * use binary search to find the key on lookups.
24 * Each key here is an array of unsigned longs, geo->no_longs in total. The
92 * btree_lookup - look up a key in the btree
96 * @key: the key to look up
98 * This function returns the value for the given key, or %NULL.
101 unsigned long *key);
108 * @key: the key to add (must not already be present)
116 unsigned long *key, voi
[all...]
H A Dverification.h18 #define VERIFY_USE_SECONDARY_KEYRING ((struct key *)1UL)
19 #define VERIFY_USE_PLATFORM_KEYRING ((struct key *)2UL)
30 * The use to which an asymmetric key is being put.
45 struct key;
50 struct key *trusted_keys,
58 struct key *trusted_keys,
68 struct key *trusted_keys,
/linux-master/tools/testing/selftests/bpf/
H A Dtest_lru_map.c42 static int bpf_map_lookup_elem_with_ref_bit(int fd, unsigned long long key, argument
48 BPF_LD_IMM64(BPF_REG_3, key),
103 printf("key:%llu not found from map. %s(%d)\n",
108 printf("key:%llu value0:%llu != value1:%llu\n",
141 * Add key=1 (+1 key)
142 * Add key=2 (+1 key)
146 * Iterate map. Only found key=1 and key
150 unsigned long long key, value[nr_cpus]; local
241 unsigned long long key, end_key, value[nr_cpus]; local
317 unsigned long long key, value[nr_cpus]; local
424 unsigned long long key, end_key, value[nr_cpus]; local
489 unsigned long long key, value[nr_cpus]; local
547 unsigned long long key, value[nr_cpus]; local
564 unsigned long long key, value[nr_cpus]; local
612 unsigned long long key, value[nr_cpus]; local
678 unsigned long long key, value[nr_cpus]; local
769 unsigned long long key, value[nr_cpus]; local
[all...]
H A Dbpf_arena_htab.h34 int key; member in struct:hashtab_elem
40 static hashtab_elem_t *lookup_elem_raw(arena_list_head_t *head, __u32 hash, int key) argument
45 if (l->hash == hash && l->key == key)
51 static int htab_hash(int key) argument
53 return key;
56 __weak int htab_lookup_elem(htab_t *htab __arg_arena, int key) argument
62 head = select_bucket(htab, key);
63 l_old = lookup_elem_raw(head, htab_hash(key), key);
69 htab_update_elem(htab_t *htab __arg_arena, int key, int value) argument
[all...]
/linux-master/include/trace/events/
H A Dmctp.h29 TP_PROTO(const struct mctp_sk_key *key),
30 TP_ARGS(key),
37 __entry->paddr = key->peer_addr;
38 __entry->laddr = key->local_addr;
39 __entry->tag = key->tag;
49 TP_PROTO(const struct mctp_sk_key *key, int reason),
50 TP_ARGS(key, reason),
58 __entry->paddr = key->peer_addr;
59 __entry->laddr = key->local_addr;
60 __entry->tag = key
[all...]
/linux-master/samples/bpf/
H A Dtracex6.bpf.c16 __type(key, int);
23 __type(key, int);
31 u32 key = bpf_get_smp_processor_id(); local
35 count = bpf_perf_event_read(&counters, key);
40 val = bpf_map_lookup_elem(&values, &key);
44 bpf_map_update_elem(&values, &key, &count, BPF_NOEXIST);
58 u32 key = bpf_get_smp_processor_id(); local
67 error = bpf_perf_event_read_value(&counters, key, &buf, sizeof(buf));
71 val = bpf_map_lookup_elem(&values2, &key);
75 bpf_map_update_elem(&values2, &key,
[all...]
H A Dcpustat_kern.c56 __type(key, u32);
64 __type(key, u32);
72 __type(key, u32);
107 u32 key, cpu, pstate_idx; local
115 key = cpu * MAP_OFF_NUM + MAP_OFF_CSTATE_TIME;
116 cts = bpf_map_lookup_elem(&my_map, &key);
120 key = cpu * MAP_OFF_NUM + MAP_OFF_CSTATE_IDX;
121 cstate = bpf_map_lookup_elem(&my_map, &key);
125 key = cpu * MAP_OFF_NUM + MAP_OFF_PSTATE_TIME;
126 pts = bpf_map_lookup_elem(&my_map, &key);
215 u32 key, cpu, pstate_idx; local
[all...]
/linux-master/fs/afs/
H A Dsecurity.c21 * get a key
23 struct key *afs_request_key(struct afs_cell *cell)
25 struct key *key; local
29 _debug("key %s", cell->anonymous_key->description);
30 key = request_key_net(&key_type_rxrpc, cell->anonymous_key->description,
32 if (IS_ERR(key)) {
33 if (PTR_ERR(key) != -ENOKEY) {
34 _leave(" = %ld", PTR_ERR(key));
35 return key;
53 struct key *key; local
143 afs_cache_permit(struct afs_vnode *vnode, struct key *key, unsigned int cb_break, struct afs_status_cb *scb) argument
303 afs_check_permit_rcu(struct afs_vnode *vnode, struct key *key, afs_access_t *_access) argument
342 afs_check_permit(struct afs_vnode *vnode, struct key *key, afs_access_t *_access) argument
403 struct key *key; local
[all...]
/linux-master/tools/testing/selftests/bpf/prog_tests/
H A Dlookup_and_delete.c15 __u64 key, value = START_VALUE; local
18 for (key = 1; key < MAX_ENTRIES + 1; key++) {
19 err = bpf_map_update_elem(map_fd, &key, &value, BPF_NOEXIST);
29 __u64 key, value[nr_cpus]; local
35 for (key = 1; key < MAX_ENTRIES + 1; key++) {
36 err = bpf_map_update_elem(map_fd, &key, valu
78 trigger_tp(struct test_lookup_and_delete *skel, __u64 key, __u64 value) argument
101 __u64 key, value; local
137 __u64 key, val, value[nr_cpus]; local
177 __u64 key, value; local
223 __u64 key, val, value[nr_cpus]; local
[all...]
H A Dhash_large_key.c15 } key; local
16 bzero(&key, sizeof(key));
30 err = bpf_map_update_elem(hash_map_fd, &key, &value, BPF_ANY);
34 key.c = 1;
35 err = bpf_map_lookup_elem(hash_map_fd, &key, &value);
H A Dhtab_reuse.c27 unsigned int key; local
30 key = 7;
31 bpf_map_lookup_elem_flags(ctx->fd, &key, &value, BPF_F_LOCK);
44 unsigned int key; local
46 key = 7;
48 value.data = key;
49 bpf_map_update_elem(ctx->fd, &key, &value, BPF_F_LOCK);
50 bpf_map_delete_elem(ctx->fd, &key);
52 key = 24;
54 value.data = key;
[all...]
/linux-master/security/keys/
H A Dinternal.h2 /* Authentication token and access key management internal defs
14 #include <linux/key-type.h>
95 extern int __key_link_lock(struct key *keyring,
97 extern int __key_move_lock(struct key *l_keyring, struct key *u_keyring,
99 extern int __key_link_begin(struct key *keyring,
102 extern int __key_link_check_live_key(struct key *keyring, struct key *key);
103 extern void __key_link(struct key *keyrin
179 notify_key(struct key *key, enum key_notification_subtype subtype, u32 aux) argument
217 key_is_dead(const struct key *key, time64_t limit) argument
365 key_check(const struct key *key) argument
[all...]
/linux-master/lib/
H A Dtest_static_key_base.c34 static void invert_key(struct static_key *key) argument
36 if (static_key_enabled(key))
37 static_key_disable(key);
39 static_key_enable(key);
46 invert_key(&base_inv_true_key.key);
47 invert_key(&base_inv_false_key.key);
/linux-master/net/ceph/
H A Dcrypto.h18 void *key; member in struct:ceph_crypto_key
24 int ceph_crypto_key_encode(struct ceph_crypto_key *key, void **p, void *end);
25 int ceph_crypto_key_decode(struct ceph_crypto_key *key, void **p, void *end);
26 int ceph_crypto_key_unarmor(struct ceph_crypto_key *key, const char *in);
27 void ceph_crypto_key_destroy(struct ceph_crypto_key *key);
30 int ceph_crypt(const struct ceph_crypto_key *key, bool encrypt,
/linux-master/scripts/kconfig/
H A Dhashtable.h16 #define hash_head(table, key) (&(table)[(key) % HASH_SIZE(table)])
22 * @key: the key of the object to be added
24 #define hash_add(table, node, key) \
25 hlist_add_head(node, hash_head(table, key))
43 * @key: the key of the objects to iterate over
45 #define hash_for_each_possible(table, obj, member, key) \
46 hlist_for_each_entry(obj, hash_head(table, key), membe
[all...]
/linux-master/arch/powerpc/boot/
H A Dplanetcore.h28 /* Return the value associated with a given key in text,
33 const char *planetcore_get_key(const char *table, const char *key);
34 int planetcore_get_decimal(const char *table, const char *key, u64 *val);
35 int planetcore_get_hex(const char *table, const char *key, u64 *val);
/linux-master/net/openvswitch/
H A Dconntrack.h26 int ovs_ct_clear(struct sk_buff *skb, struct sw_flow_key *key);
28 void ovs_ct_fill_key(const struct sk_buff *skb, struct sw_flow_key *key,
51 const struct sw_flow_key *key,
64 struct sw_flow_key *key,
72 struct sw_flow_key *key)
78 struct sw_flow_key *key,
81 key->ct_state = 0;
82 key->ct_zone = 0;
83 key->ct.mark = 0;
84 memset(&key
50 ovs_ct_copy_action(struct net *net, const struct nlattr *nla, const struct sw_flow_key *key, struct sw_flow_actions **acts, bool log) argument
63 ovs_ct_execute(struct net *net, struct sk_buff *skb, struct sw_flow_key *key, const struct ovs_conntrack_info *info) argument
71 ovs_ct_clear(struct sk_buff *skb, struct sw_flow_key *key) argument
77 ovs_ct_fill_key(const struct sk_buff *skb, struct sw_flow_key *key, bool post_ct) argument
[all...]
/linux-master/tools/perf/util/bpf_skel/
H A Dkwork_trace.bpf.c89 static __always_inline int trace_event_match(struct work_key *key, char *name) argument
116 static __always_inline void do_update_time(void *map, struct work_key *key, argument
125 data = bpf_map_lookup_elem(map, key);
128 bpf_map_update_elem(map, key, &zero, BPF_NOEXIST);
129 data = bpf_map_lookup_elem(map, key);
145 static __always_inline void do_update_timestart(void *map, struct work_key *key) argument
149 bpf_map_update_elem(map, key, &ts, BPF_ANY);
153 struct work_key *key)
155 __u64 *time = bpf_map_lookup_elem(time_map, key);
158 bpf_map_delete_elem(time_map, key);
152 do_update_timeend(void *report_map, void *time_map, struct work_key *key) argument
163 do_update_name(void *map, struct work_key *key, char *name) argument
170 update_timestart(void *map, struct work_key *key) argument
179 update_timestart_and_name(void *time_map, void *names_map, struct work_key *key, char *name) argument
193 update_timeend(void *report_map, void *time_map, struct work_key *key) argument
204 update_timeend_and_name(void *report_map, void *time_map, void *names_map, struct work_key *key, char *name) argument
223 struct work_key key = { local
239 struct work_key key = { local
265 struct work_key key = { local
283 struct work_key key = { local
296 struct work_key key = { local
314 struct work_key key = { local
326 struct work_key key = { local
339 struct work_key key = { local
356 struct work_key key = { local
369 struct work_key key = { local
[all...]
/linux-master/include/crypto/
H A Dxts.h12 const u8 *key, unsigned int keylen)
15 * key consists of keys of equal size concatenated, therefore
22 * In FIPS mode only a combined key length of either 256 or
29 * Ensure that the AES and tweak key are not identical when
34 !crypto_memneq(key, key + (keylen / 2), keylen / 2))
11 xts_verify_key(struct crypto_skcipher *tfm, const u8 *key, unsigned int keylen) argument

Completed in 444 milliseconds

1234567891011>>