Searched refs:key (Results 76 - 100 of 3067) sorted by last modified time

1234567891011>>

/linux-master/fs/smb/client/
H A Dcifsfs.c41 #include <linux/key-type.h>
/linux-master/fs/bcachefs/
H A Djournal_io.c1466 bch2_bkey_has_device_c(bkey_i_to_s_c(&w->key), ca->dev_idx) ||
1472 bch2_bkey_append_ptr(&w->key,
1559 BUG_ON(bkey_val_u64s(&w->key.k) > BCH_REPLICAS_MAX);
1733 extent_for_each_ptr(bkey_i_to_s_extent(&w->key), ptr) {
2058 w->devs_written = bch2_bkey_devs(bkey_i_to_s_c(&w->key));
H A Drecovery.c139 * BTREE_UPDATE_KEY_CACHE_RECLAIM disables key cache lookup/update to
140 * keep the key cache coherent with the underlying btree. Nothing
141 * besides the allocator is doing updates yet so we don't need key cache
142 * coherency for non-alloc btrees, and key cache fills for snapshots
218 * k->allocated means the key wasn't read in from the journal,
263 bch_err_msg(c, ret, "while replaying key at btree %s level %u:",
324 bkey_copy(&r->key, (struct bkey_i *) entry->start);
457 mustfix_fsck_err_on((ret = r->error = bch2_btree_root_read(c, i, &r->key, r->level)),
H A Dbtree_update_interior.c63 struct bpos node_min = b->key.k.type == KEY_TYPE_btree_ptr_v2
64 ? bkey_i_to_btree_ptr_v2(&b->key)->v.min_key
72 BUG_ON(b->key.k.type == KEY_TYPE_btree_ptr_v2 &&
73 !bpos_eq(bkey_i_to_btree_ptr_v2(&b->key)->v.min_key,
100 bch2_bkey_val_to_text(&buf, c, bkey_i_to_s_c(&b->key));
121 bch2_bkey_val_to_text(&buf, c, bkey_i_to_s_c(&b->key));
125 } else if (!bpos_eq(prev.k->k.p, b->key.k.p)) {
132 bch2_bkey_val_to_text(&buf, c, bkey_i_to_s_c(&b->key));
133 prt_str(&buf, "\n last key ");
371 bkey_copy(&b->key,
[all...]
H A Dbtree_types.h107 __BKEY_PADDED(key, BKEY_BTREE_PTR_VAL_U64s_MAX);
205 * @pos or the first key strictly greater than @pos
305 * Current unpacked key - so that bch2_btree_iter_next()/
327 struct bkey_cached_key key; member in struct:bkey_cached
341 ? container_of(b, struct btree, c)->key.k.p
342 : container_of(b, struct bkey_cached, c)->key.pos;
355 * @old_k may be a key from the journal; @old_btree_u64s always refers
356 * to the size of the key being overwritten in the btree:
361 /* key being overwritten: */
657 /* Type of a key i
[all...]
H A Dbtree_io.c528 b->written, btree_ptr_sectors_written(&b->key));
653 * depend on the values of min/max key:
744 if (b->key.k.type == KEY_TYPE_btree_ptr_v2) {
746 &bkey_i_to_btree_ptr_v2(&b->key)->v;
772 if (b->key.k.type == KEY_TYPE_btree_ptr_v2) {
774 &bkey_i_to_btree_ptr_v2(&b->key)->v;
778 b->data->max_key = b->key.k.p;
792 btree_err_on(!bpos_eq(bn->max_key, b->key.k.p),
796 "incorrect max key %s",
861 bool updated_range = b->key
[all...]
H A Dbtree_key_cache.c28 const struct bkey_cached_key *key = arg->key; local
30 return ck->key.btree_id != key->btree_id ||
31 !bpos_eq(ck->key.pos, key->pos);
36 .key_offset = offsetof(struct bkey_cached, key),
45 struct bkey_cached_key key = { local
50 return rhashtable_lookup_fast(&c->btree_key_cache.table, &key,
77 memset(&ck->key, ~
612 btree_key_cache_flush_pos(struct btree_trans *trans, struct bkey_cached_key key, u64 journal_seq, unsigned commit_flags, bool evict) argument
726 struct bkey_cached_key key; local
[all...]
H A Dbtree_gc.c78 switch (b->key.k.type) {
80 struct bkey_i_btree_ptr *src = bkey_i_to_btree_ptr(&b->key);
93 bkey_copy(&dst->k_i, &b->key);
118 bkey_copy(&b->key, new);
137 bch2_bkey_val_to_text(&buf, c, bkey_i_to_s_c(&b->key));
161 bkey_copy(&b->key, &new->k_i);
173 bch2_bkey_val_to_text(&buf, c, bkey_i_to_s_c(&b->key));
181 ret = bch2_journal_key_delete(c, b->c.btree_id, b->c.level + 1, b->key.k.p);
205 bkey_copy(&b->key, &new->k_i);
218 : bpos_successor(prev->key
[all...]
H A Dbcachefs_format.h60 * The various btrees share a common format for the key - so as to avoid
62 * structures for the key values.
64 * The size of a key/value pair is stored as a u8 in units of u64s, so the max
66 * value, and a format field indicating whether the key is packed or not (and
67 * also meant to allow adding new key fields in the future, if desired).
71 * be generous with field sizes in the common part of the key format (64 bit
199 /* Size of combined key and value, in u64s */
202 /* Format of key (0 for format local to btree node) */
248 * representation of an unpacked key also is just one type of packed key
642 __le64 key[4]; member in struct:bch_key
653 struct bch_key key; member in struct:bch_encrypted_key
668 struct bch_encrypted_key key; member in struct:bch_sb_field_crypt
[all...]
H A Dbackpointers.c318 return bkey_i_to_s_c(&b->key);
346 bkey_i_to_s_c(&b->key),
353 backpointer_not_found(trans, bp_pos, bp, bkey_i_to_s_c(&b->key));
386 "backpointer for nonexistent alloc key: %llu:%llu:0\n%s",
399 /* verify that every backpointer has a corresponding alloc key */
705 k = bkey_i_to_s_c(&b->key);
767 BBPOS(btree, b->key.k.p);
/linux-master/drivers/usb/gadget/function/
H A Df_fs.c2008 return invalf(fc, "%s: unmapped value: %u", param->key, result.uint_32);
/linux-master/drivers/thunderbolt/
H A Dtb.h147 * @key: Contains the key used to challenge the device or %NULL if not
148 * supported. Size of the key is %TB_SWITCH_KEY_SIZE.
150 * @connection_key: Connection key used with ICM messaging
201 u8 *key; member in struct:tb_switch
483 * @add_switch_key: Add key to switch
484 * @challenge_switch_key: Challenge switch using key
H A Dswitch.c1802 if (sw->key)
1810 if (sw->key)
1901 if (sw->key)
1902 ret = sysfs_emit(buf, "%*phN\n", TB_SWITCH_KEY_SIZE, sw->key);
1914 u8 key[TB_SWITCH_KEY_SIZE]; local
1920 else if (hex2bin(key, buf, sizeof(key)))
1929 kfree(sw->key);
1931 sw->key = NULL;
1933 sw->key
[all...]
/linux-master/drivers/accessibility/speakup/
H A Dmain.c1262 pr_debug("(%d), not valid key, (max_allowed = %d)\n",
1328 static int edit_bits(struct vc_data *vc, u_char type, u_char ch, u_short key) argument
1556 /* the key press flushes if !no_inter but we want to flush on cursor
1950 static int handle_goto(struct vc_data *vc, u_char type, u_char ch, u_short key) argument
/linux-master/block/
H A Dioctl.c316 return ops->pr_reserve(bdev, rsv.key, rsv.type, rsv.flags);
334 return ops->pr_release(bdev, rsv.key, rsv.type);
370 return ops->pr_clear(bdev, c.key);
H A Dblk-iocost.c1462 int flags, void *key)
1465 struct iocg_wake_ctx *ctx = key;
1483 default_wake_function(wq_entry, mode, flags, key);
1461 iocg_wake_fn(struct wait_queue_entry *wq_entry, unsigned mode, int flags, void *key) argument
/linux-master/arch/x86/kvm/
H A Dx86.c9859 WARN_ON(static_branch_unlikely(&kvm_xen_enabled.key));
13206 static inline u32 kvm_async_pf_next_probe(u32 key) argument
13208 return (key + 1) & (ASYNC_PF_PER_VCPU - 1);
13213 u32 key = kvm_async_pf_hash_fn(gfn); local
13215 while (vcpu->arch.apf.gfns[key] != ~0)
13216 key = kvm_async_pf_next_probe(key);
13218 vcpu->arch.apf.gfns[key] = gfn;
13224 u32 key = kvm_async_pf_hash_fn(gfn); local
13227 (vcpu->arch.apf.gfns[key] !
[all...]
H A Dpmu.c348 static int find_filter_index(u64 *events, u64 nevents, u64 key) argument
350 u64 *fe = bsearch(&key, events, nevents, sizeof(events[0]),
H A Dlapic.c500 static_branch_inc(&apic_sw_disabled.key);
2556 static_branch_inc(&apic_hw_disabled.key);
2861 static_branch_inc(&apic_sw_disabled.key); /* sw disabled at reset */
3344 WARN_ON(static_branch_unlikely(&apic_hw_disabled.key));
3346 WARN_ON(static_branch_unlikely(&apic_sw_disabled.key));
/linux-master/arch/powerpc/crypto/
H A Dchacha-p10-glue.c60 void chacha_init_arch(u32 *state, const u32 *key, const u8 *iv) argument
62 chacha_init_generic(state, key, iv);
98 chacha_init_generic(state, ctx->key, iv);
140 chacha_init_generic(state, ctx->key, req->iv);
141 hchacha_block_arch(state, subctx.key, ctx->nrounds);
/linux-master/tools/testing/selftests/net/tcp_ao/
H A Dsetsockopt-closed.c108 cmd = "key add: ";
112 cmd = "key del: ";
147 test_error("add default key");
160 test_error("add default key");
169 test_error("add default key");
222 offsetof(struct tcp_ao_add, key));
258 test_fail("optmem limit test failed: added %zu key", i);
262 test_fail("optmem limit test failed: couldn't add %zu key", i);
265 test_ok("optmem limit was hit on adding %zu key", i);
322 setsockopt_checked(sk, TCP_AO_ADD_KEY, &ao, EINVAL, "bad key flag
[all...]
/linux-master/tools/perf/util/bpf_skel/
H A Dlock_contention.bpf.c33 __type(key, int);
133 /* determine the key of lock stat */
411 struct contention_key key = {}; local
451 key.stack_id = pelem->stack_id;
455 key.pid = pelem->flags;
459 key.pid = pid;
462 key.stack_id = pelem->stack_id;
465 key.lock_addr_or_cgroup = pelem->lock;
467 key.stack_id = pelem->stack_id;
470 key
[all...]
/linux-master/tools/perf/util/
H A Dannotate.c867 /* symbol histogram: key = offset << 16 | evsel->core.idx */
868 static size_t sym_hist_hash(long key, void *ctx __maybe_unused) argument
870 return (key >> 16) + (key & 0xffff);
/linux-master/tools/perf/ui/browsers/
H A Dannotate.c715 const char *help = "Press 'h' for help on key bindings";
718 int key; local
734 key = ui_browser__run(&browser->b, delay_secs);
747 switch (key) {
903 switch_percent_type(&annotate_opts, key == 'b');
926 return key;
938 /* reset abort key so that it can get Ctrl-C as a key */
/linux-master/tools/arch/s390/include/uapi/asm/
H A Dkvm.h70 __u8 key; /* access key, ignored if flag unset */ member in struct:kvm_s390_mem_op::__anon119::__anon120

Completed in 367 milliseconds

1234567891011>>