Searched refs:key (Results 1 - 25 of 3065) sorted by last modified time

1234567891011>>

/linux-master/fs/btrfs/
H A Dscrub.c401 struct btrfs_key key; local
412 key.objectid = inum;
413 key.type = BTRFS_INODE_ITEM_KEY;
414 key.offset = 0;
416 ret = btrfs_search_slot(NULL, local_root, &key, swarn->path, 0, 0);
1338 struct btrfs_key key; local
1340 btrfs_item_key_to_cpu(path->nodes[0], &key, path->slots[0]);
1341 ASSERT(key.type == BTRFS_EXTENT_ITEM_KEY ||
1342 key.type == BTRFS_METADATA_ITEM_KEY);
1343 if (key
1376 struct btrfs_key key; local
1442 struct btrfs_key key; local
2468 struct btrfs_key key; local
[all...]
H A Dinode.c155 struct btrfs_key key; local
167 key.objectid = inum;
168 key.type = BTRFS_INODE_ITEM_KEY;
169 key.offset = 0;
171 ret = btrfs_search_slot(NULL, local_root, &key, &warn->path, 0, 0);
535 struct btrfs_key key; local
538 key.objectid = btrfs_ino(inode);
539 key.offset = 0;
540 key.type = BTRFS_EXTENT_DATA_KEY;
543 ret = btrfs_insert_empty_item(trans, root, path, &key,
1864 can_nocow_file_extent(struct btrfs_path *path, struct btrfs_key *key, struct btrfs_inode *inode, struct can_nocow_file_extent_args *args) argument
3500 struct btrfs_key key, found_key; local
4271 struct btrfs_key key; local
4378 struct btrfs_key key; local
5455 struct btrfs_key key; local
5655 new_simple_dir(struct inode *dir, struct btrfs_key *key, struct btrfs_root *root) argument
5802 struct btrfs_key key, found_key; local
5943 struct btrfs_key key; local
6253 struct btrfs_key key[2]; local
6489 struct btrfs_key key; local
7129 struct btrfs_key key; local
9504 struct btrfs_key key; local
[all...]
H A Dbackref.c36 const struct btrfs_key *key,
42 u64 offset = key->offset;
73 ret = ctx->indirect_ref_iterator(key->objectid, offset,
86 e->inum = key->objectid;
109 struct btrfs_key key; local
118 * the key. thus, we must look into all items and see that we
123 btrfs_item_key_to_cpu(eb, &key, slot);
124 if (key.type != BTRFS_EXTENT_DATA_KEY)
135 ret = check_extent_in_eb(ctx, &key, eb, fi, eie);
353 * - if you add a key, yo
35 check_extent_in_eb(struct btrfs_backref_walk_ctx *ctx, const struct btrfs_key *key, const struct extent_buffer *eb, const struct btrfs_file_extent_item *fi, struct extent_inode_elem **eie) argument
388 add_prelim_ref(const struct btrfs_fs_info *fs_info, struct preftree *preftree, u64 root_id, const struct btrfs_key *key, int level, u64 parent, u64 wanted_disk_byte, int count, struct share_check *sc, gfp_t gfp_mask) argument
429 add_indirect_ref(const struct btrfs_fs_info *fs_info, struct preftrees *preftrees, u64 root_id, const struct btrfs_key *key, int level, u64 wanted_disk_byte, int count, struct share_check *sc, gfp_t gfp_mask) argument
477 struct btrfs_key key; local
893 struct btrfs_key key; local
1021 struct btrfs_key key; local
1156 struct btrfs_key key; local
1389 struct btrfs_key key; local
2055 struct btrfs_key key; local
2213 struct btrfs_key key; local
2285 get_extent_inline_ref(unsigned long *ptr, const struct extent_buffer *eb, const struct btrfs_key *key, const struct btrfs_extent_item *ei, u32 item_size, struct btrfs_extent_inline_ref **out_eiref, int *out_type) argument
2341 tree_backref_for_extent(unsigned long *ptr, struct extent_buffer *eb, struct btrfs_key *key, struct btrfs_extent_item *ei, u32 item_size, u64 *out_root, u8 *out_level) argument
2866 struct btrfs_key key; local
3518 struct btrfs_key key; local
[all...]
/linux-master/virt/kvm/
H A Dkvm_main.c5781 struct kvm_io_range *range, key; local
5784 key = (struct kvm_io_range) {
5789 range = bsearch(&key, bus->range, bus->dev_count,
5796 while (off > 0 && kvm_io_bus_cmp(&key, &bus->range[off-1]) == 0)
/linux-master/kernel/sched/
H A Dsched.h2102 static __always_inline bool static_branch_##name(struct static_key *key) \
2104 return static_key_##enabled(key); \
/linux-master/fs/sysfs/
H A Dfile.c273 struct lock_class_key *key = NULL; local
304 key = attr->key ?: (struct lock_class_key *)&attr->skey;
308 PAGE_SIZE, ops, (void *)attr, ns, key);
322 struct lock_class_key *key = NULL; local
339 key = attr->key ?: (struct lock_class_key *)&attr->skey;
343 battr->size, ops, (void *)attr, ns, key);
/linux-master/fs/smb/client/
H A Dsmb2transport.c77 int smb2_get_sign_key(__u64 ses_id, struct TCP_Server_Info *server, u8 *key) argument
111 * session key
113 memcpy(key, ses->smb3signingkey, SMB3_SIGN_KEY_SIZE);
120 * Otherwise, use the channel key.
126 memcpy(key, chan->signkey, SMB3_SIGN_KEY_SIZE);
136 "%s: Could not find channel signing key for session 0x%llx\n",
312 struct kvec context, __u8 *key, unsigned int key_size)
324 memset(key, 0x0, key_size);
335 cifs_server_dbg(VFS, "%s: Could not set with session key\n", __func__);
386 memcpy(key, hashpt
311 generate_key(struct cifs_ses *ses, struct kvec label, struct kvec context, __u8 *key, unsigned int key_size) argument
571 u8 key[SMB3_SIGN_KEY_SIZE]; local
[all...]
H A Dsmb2pdu.c372 * Try alternate password for next reconnect (key rotation
1583 "SMB3 session key generation failed\n");
1606 struct key *spnego_key = NULL;
1639 /* keep session key if binding */
H A Dsmb2ops.c1482 cifs_tcon_dbg(VFS, "refcpy ioctl error %d getting resume key\n", rc);
1486 cifs_tcon_dbg(VFS, "Invalid refcopy resume key length\n");
1766 cifs_dbg(FYI, "%s: about to call request res key\n", __func__);
1767 /* Request a key from the server to identify the source of the copy */
1789 /* Request server copy to target from src identified by key */
4186 smb2_get_enc_key(struct TCP_Server_Info *server, __u64 ses_id, int enc, u8 *key) argument
4201 memcpy(key, ses_enc_key, SMB3_ENC_DEC_KEY_SIZE);
4230 u8 key[SMB3_ENC_DEC_KEY_SIZE]; local
4239 rc = smb2_get_enc_key(server, le64_to_cpu(tr_hdr->SessionId), enc, key);
4241 cifs_server_dbg(FYI, "%s: Could not get %scryption key
[all...]
H A Dfscache.c43 char *key; local
67 memset(&key, 0, sizeof(key));
81 key = kasprintf(GFP_KERNEL, "cifs,%pISpc,%s", sa, sharename);
82 if (!key)
86 vcookie = fscache_acquire_volume(key,
89 cifs_dbg(FYI, "%s: (%s/0x%p)\n", __func__, key, vcookie);
95 pr_err("Cache volume key already in use (%s)\n", key);
107 kfree(key);
130 struct cifs_fscache_inode_key key; local
[all...]
H A Dconnect.c2094 struct key *key; local
2104 /* try to find an address key first */
2122 key = request_key(&key_type_logon, desc, "");
2123 if (IS_ERR(key)) {
2126 rc = PTR_ERR(key);
2130 /* didn't work, try to find a domain key */
2133 key = request_key(&key_type_logon, desc, "");
2134 if (IS_ERR(key)) {
2135 rc = PTR_ERR(key);
[all...]
H A Dfs_context.c445 int smb3_parse_opt(const char *options, const char *key, char **val) argument
459 if (strncasecmp(p, key, strlen(key)))
637 * smb3_fs_context_parse_monolithic - Parse key[=val][,key[=val]]* mount data
641 * Parse a blob of data that's in key[=val][,key[=val]]* form. This can be
650 char *options = data, *key; local
661 while ((key = strsep(&options, ",")) != NULL) {
665 if (*key
[all...]
H A Dcifsproto.h91 extern int smb3_parse_opt(const char *options, const char *key, char **val);
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_node_scan.c436 .max_key = b->key.k.p,
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.c2003 return invalf(fc, "%s: unmapped value: %u", param->key, result.uint_32);

Completed in 550 milliseconds

1234567891011>>