| /fs/ubifs/ |
| D | key.h | 91 union ubifs_key *key, ino_t inum) in ino_key_init() argument
93 key->u32[0] = inum; in ino_key_init()
94 key->u32[1] = UBIFS_INO_KEY << UBIFS_S_KEY_BLOCK_BITS; in ino_key_init()
106 union ubifs_key *key = k; in ino_key_init_flash() local
108 key->j32[0] = cpu_to_le32(inum); in ino_key_init_flash()
109 key->j32[1] = cpu_to_le32(UBIFS_INO_KEY << UBIFS_S_KEY_BLOCK_BITS); in ino_key_init_flash()
120 union ubifs_key *key, ino_t inum) in lowest_ino_key() argument
122 key->u32[0] = inum; in lowest_ino_key()
123 key->u32[1] = 0; in lowest_ino_key()
133 union ubifs_key *key, ino_t inum) in highest_ino_key() argument
[all …]
|
| D | tnc.c | 27 static int fallible_read_node(struct ubifs_info *c, const union ubifs_key *key,
351 ubifs_assert(c, is_hash_key(c, &zbr->key)); in lnc_add()
425 ubifs_assert(c, is_hash_key(c, &zbr->key)); in tnc_read_hashed_node()
435 err = fallible_read_node(c, &zbr->key, zbr, node); in tnc_read_hashed_node()
533 static int fallible_read_node(struct ubifs_info *c, const union ubifs_key *key, in fallible_read_node() argument
538 dbg_tnck(key, "LEB %d:%d, key ", zbr->lnum, zbr->offs); in fallible_read_node()
540 ret = try_read_node(c, node, key_type(c, key), zbr); in fallible_read_node()
546 key_read(c, &dent->key, &node_key); in fallible_read_node()
547 if (keys_cmp(c, key, &node_key) != 0) in fallible_read_node()
551 dbg_mntk(key, "dangling branch LEB %d:%d len %d, key ", in fallible_read_node()
[all …]
|
| /fs/nilfs2/ |
| D | direct.c | 24 nilfs_direct_get_ptr(const struct nilfs_bmap *direct, __u64 key) in nilfs_direct_get_ptr() argument
26 return le64_to_cpu(*(nilfs_direct_dptrs(direct) + key)); in nilfs_direct_get_ptr()
30 __u64 key, __u64 ptr) in nilfs_direct_set_ptr() argument
32 *(nilfs_direct_dptrs(direct) + key) = cpu_to_le64(ptr); in nilfs_direct_set_ptr()
36 __u64 key, int level, __u64 *ptrp) in nilfs_direct_lookup() argument
40 if (key > NILFS_DIRECT_KEY_MAX || level != 1) in nilfs_direct_lookup()
42 ptr = nilfs_direct_get_ptr(direct, key); in nilfs_direct_lookup()
51 __u64 key, __u64 *ptrp, in nilfs_direct_lookup_contig() argument
59 if (key > NILFS_DIRECT_KEY_MAX) in nilfs_direct_lookup_contig()
61 ptr = nilfs_direct_get_ptr(direct, key); in nilfs_direct_lookup_contig()
[all …]
|
| D | bmap.c | 62 int nilfs_bmap_lookup_at_level(struct nilfs_bmap *bmap, __u64 key, int level, in nilfs_bmap_lookup_at_level() argument
69 ret = bmap->b_ops->bop_lookup(bmap, key, level, ptrp); in nilfs_bmap_lookup_at_level()
94 int nilfs_bmap_lookup_contig(struct nilfs_bmap *bmap, __u64 key, __u64 *ptrp, in nilfs_bmap_lookup_contig() argument
100 ret = bmap->b_ops->bop_lookup_contig(bmap, key, ptrp, maxblocks); in nilfs_bmap_lookup_contig()
106 static int nilfs_bmap_do_insert(struct nilfs_bmap *bmap, __u64 key, __u64 ptr) in nilfs_bmap_do_insert() argument
113 ret = bmap->b_ops->bop_check_insert(bmap, key); in nilfs_bmap_do_insert()
120 bmap, key, ptr, keys, ptrs, n); in nilfs_bmap_do_insert()
129 return bmap->b_ops->bop_insert(bmap, key, ptr); in nilfs_bmap_do_insert()
150 int nilfs_bmap_insert(struct nilfs_bmap *bmap, __u64 key, unsigned long rec) in nilfs_bmap_insert() argument
155 ret = nilfs_bmap_do_insert(bmap, key, rec); in nilfs_bmap_insert()
[all …]
|
| /fs/afs/ |
| D | security.c | 23 struct key *afs_request_key(struct afs_cell *cell) in afs_request_key()
25 struct key *key; in afs_request_key() local
30 key = request_key_net(&key_type_rxrpc, cell->anonymous_key->description, in afs_request_key()
32 if (IS_ERR(key)) { in afs_request_key()
33 if (PTR_ERR(key) != -ENOKEY) { in afs_request_key()
34 _leave(" = %ld", PTR_ERR(key)); in afs_request_key()
35 return key; in afs_request_key()
43 _leave(" = {%x} [auth]", key_serial(key)); in afs_request_key()
44 return key; in afs_request_key()
51 struct key *afs_request_key_rcu(struct afs_cell *cell) in afs_request_key_rcu()
[all …]
|
| D | vl_alias.c | 17 static struct afs_volume *afs_sample_volume(struct afs_cell *cell, struct key *key, in afs_sample_volume() argument
27 .key = key, /* This might need to be something */ in afs_sample_volume()
187 static int afs_query_for_alias_one(struct afs_cell *cell, struct key *key, in afs_query_for_alias_one() argument
206 volume = afs_sample_volume(cell, key, pvol->name, pvol->name_len); in afs_query_for_alias_one()
234 static int afs_query_for_alias(struct afs_cell *cell, struct key *key) in afs_query_for_alias() argument
253 if (afs_query_for_alias_one(cell, key, p) != 0) in afs_query_for_alias()
276 static char *afs_vl_get_cell_name(struct afs_cell *cell, struct key *key) in afs_vl_get_cell_name() argument
283 if (!afs_begin_vlserver_operation(&vc, cell, key)) in afs_vl_get_cell_name()
302 static int yfs_check_canonical_cell_name(struct afs_cell *cell, struct key *key) in yfs_check_canonical_cell_name() argument
307 cell_name = afs_vl_get_cell_name(cell, key); in yfs_check_canonical_cell_name()
[all …]
|
| /fs/nfs/ |
| D | fscache.c | 54 struct nfs_server_key key; in nfs_fscache_get_client_cookie() local
55 uint16_t len = sizeof(key.hdr); in nfs_fscache_get_client_cookie()
57 memset(&key, 0, sizeof(key)); in nfs_fscache_get_client_cookie()
58 key.hdr.nfsversion = clp->rpc_ops->version; in nfs_fscache_get_client_cookie()
59 key.hdr.minorversion = clp->cl_minorversion; in nfs_fscache_get_client_cookie()
60 key.hdr.family = clp->cl_addr.ss_family; in nfs_fscache_get_client_cookie()
64 key.hdr.port = sin->sin_port; in nfs_fscache_get_client_cookie()
65 key.ipv4_addr = sin->sin_addr; in nfs_fscache_get_client_cookie()
66 len += sizeof(key.ipv4_addr); in nfs_fscache_get_client_cookie()
70 key.hdr.port = sin6->sin6_port; in nfs_fscache_get_client_cookie()
[all …]
|
| D | dns_resolve.c | 76 struct nfs_dns_ent *key; in nfs_dns_ent_update() local
79 key = container_of(ckey, struct nfs_dns_ent, h); in nfs_dns_ent_update()
81 memcpy(&new->addr, &key->addr, key->addrlen); in nfs_dns_ent_update()
82 new->addrlen = key->addrlen; in nfs_dns_ent_update()
89 struct nfs_dns_ent *key; in nfs_dns_ent_init() local
92 key = container_of(ckey, struct nfs_dns_ent, h); in nfs_dns_ent_init()
95 new->hostname = kmemdup_nul(key->hostname, key->namelen, GFP_KERNEL); in nfs_dns_ent_init()
97 new->namelen = key->namelen; in nfs_dns_ent_init()
135 static unsigned int nfs_dns_hash(const struct nfs_dns_ent *key) in nfs_dns_hash() argument
137 return hash_str(key->hostname, NFS_DNS_HASHBITS); in nfs_dns_hash()
[all …]
|
| /fs/btrfs/ |
| D | free-space-tree.c | 56 struct btrfs_key key; in add_new_free_space_info() local
60 key.objectid = block_group->start; in add_new_free_space_info()
61 key.type = BTRFS_FREE_SPACE_INFO_KEY; in add_new_free_space_info()
62 key.offset = block_group->length; in add_new_free_space_info()
64 ret = btrfs_insert_empty_item(trans, root, path, &key, sizeof(*info)); in add_new_free_space_info()
89 struct btrfs_key key; in search_free_space_info() local
92 key.objectid = block_group->start; in search_free_space_info()
93 key.type = BTRFS_FREE_SPACE_INFO_KEY; in search_free_space_info()
94 key.offset = block_group->length; in search_free_space_info()
96 ret = btrfs_search_slot(trans, root, &key, path, 0, cow); in search_free_space_info()
[all …]
|
| D | tree-checker.c | 80 struct btrfs_key key; in file_extent_err() local
84 btrfs_item_key_to_cpu(eb, &key, slot); in file_extent_err()
94 key.objectid, key.offset, &vaf); in file_extent_err()
114 struct btrfs_key *key, in file_extent_end() argument
122 end = ALIGN(key->offset + len, leaf->fs_info->sectorsize); in file_extent_end()
125 end = key->offset + len; in file_extent_end()
140 struct btrfs_key key; in dir_item_err() local
144 btrfs_item_key_to_cpu(eb, &key, slot); in dir_item_err()
154 key.objectid, &vaf); in dir_item_err()
168 struct btrfs_key *key, int slot, in check_prev_ino() argument
[all …]
|
| D | dir-item.c | 64 struct btrfs_key key, location; in btrfs_insert_xattr_item() local
72 key.objectid = objectid; in btrfs_insert_xattr_item()
73 key.type = BTRFS_XATTR_ITEM_KEY; in btrfs_insert_xattr_item()
74 key.offset = btrfs_name_hash(name, name_len); in btrfs_insert_xattr_item()
77 dir_item = insert_with_overflow(trans, root, path, &key, data_size, in btrfs_insert_xattr_item()
119 struct btrfs_key key; in btrfs_insert_dir_item() local
123 key.objectid = btrfs_ino(dir); in btrfs_insert_dir_item()
124 key.type = BTRFS_DIR_ITEM_KEY; in btrfs_insert_dir_item()
125 key.offset = btrfs_name_hash(name, name_len); in btrfs_insert_dir_item()
134 dir_item = insert_with_overflow(trans, root, path, &key, data_size, in btrfs_insert_dir_item()
[all …]
|
| D | root-tree.c | 119 *root, struct btrfs_key *key, struct btrfs_root_item in btrfs_update_root() argument
134 ret = btrfs_search_slot(trans, root, key, path, 0, 1); in btrfs_update_root()
141 key->objectid, key->type, key->offset, in btrfs_update_root()
160 ret = btrfs_search_slot(trans, root, key, path, in btrfs_update_root()
174 key, sizeof(*item)); in btrfs_update_root()
198 const struct btrfs_key *key, struct btrfs_root_item *item) in btrfs_insert_root() argument
204 return btrfs_insert_item(trans, root, key, item, sizeof(*item)); in btrfs_insert_root()
212 struct btrfs_key key; in btrfs_find_orphan_roots() local
221 key.objectid = BTRFS_ORPHAN_OBJECTID; in btrfs_find_orphan_roots()
222 key.type = BTRFS_ORPHAN_ITEM_KEY; in btrfs_find_orphan_roots()
[all …]
|
| D | uuid-tree.c | 14 static void btrfs_uuid_to_key(u8 *uuid, u8 type, struct btrfs_key *key) in btrfs_uuid_to_key() argument
16 key->type = type; in btrfs_uuid_to_key()
17 key->objectid = get_unaligned_le64(uuid); in btrfs_uuid_to_key()
18 key->offset = get_unaligned_le64(uuid + sizeof(u64)); in btrfs_uuid_to_key()
31 struct btrfs_key key; in btrfs_uuid_tree_lookup() local
44 btrfs_uuid_to_key(uuid, type, &key); in btrfs_uuid_tree_lookup()
45 ret = btrfs_search_slot(NULL, uuid_root, &key, path, 0, 0); in btrfs_uuid_tree_lookup()
89 struct btrfs_key key; in btrfs_uuid_tree_add() local
104 btrfs_uuid_to_key(uuid, type, &key); in btrfs_uuid_tree_add()
112 ret = btrfs_insert_empty_item(trans, uuid_root, path, &key, in btrfs_uuid_tree_add()
[all …]
|
| D | inode-item.c | 82 struct btrfs_key key; in btrfs_lookup_inode_extref() local
84 key.objectid = inode_objectid; in btrfs_lookup_inode_extref()
85 key.type = BTRFS_INODE_EXTREF_KEY; in btrfs_lookup_inode_extref()
86 key.offset = btrfs_extref_hash(ref_objectid, name, name_len); in btrfs_lookup_inode_extref()
88 ret = btrfs_search_slot(trans, root, &key, path, ins_len, cow); in btrfs_lookup_inode_extref()
105 struct btrfs_key key; in btrfs_del_inode_extref() local
114 key.objectid = inode_objectid; in btrfs_del_inode_extref()
115 key.type = BTRFS_INODE_EXTREF_KEY; in btrfs_del_inode_extref()
116 key.offset = btrfs_extref_hash(ref_objectid, name, name_len); in btrfs_del_inode_extref()
122 ret = btrfs_search_slot(trans, root, &key, path, -1, 1); in btrfs_del_inode_extref()
[all …]
|
| D | export.c | 142 struct btrfs_key key; in btrfs_get_parent() local
151 key.objectid = root->root_key.objectid; in btrfs_get_parent()
152 key.type = BTRFS_ROOT_BACKREF_KEY; in btrfs_get_parent()
153 key.offset = (u64)-1; in btrfs_get_parent()
156 key.objectid = btrfs_ino(BTRFS_I(dir)); in btrfs_get_parent()
157 key.type = BTRFS_INODE_REF_KEY; in btrfs_get_parent()
158 key.offset = (u64)-1; in btrfs_get_parent()
161 ret = btrfs_search_slot(NULL, root, &key, path, 0, 0); in btrfs_get_parent()
175 if (found_key.objectid != key.objectid || found_key.type != key.type) { in btrfs_get_parent()
183 key.objectid = btrfs_root_ref_dirid(leaf, ref); in btrfs_get_parent()
[all …]
|
| D | print-tree.c | 29 const char *btrfs_root_name(const struct btrfs_key *key, char *buf) in btrfs_root_name() argument
33 if (key->objectid == BTRFS_TREE_RELOC_OBJECTID) { in btrfs_root_name()
35 "TREE_RELOC offset=%llu", key->offset); in btrfs_root_name()
40 if (root_map[i].id == key->objectid) in btrfs_root_name()
44 snprintf(buf, BTRFS_ROOT_NAME_BUF_LEN, "%llu", key->objectid); in btrfs_root_name()
85 struct btrfs_disk_key key; in print_extent_item() local
109 btrfs_tree_block_key(eb, info, &key); in print_extent_item()
111 btrfs_disk_key_objectid(&key), key.type, in print_extent_item()
112 btrfs_disk_key_offset(&key), in print_extent_item()
212 struct btrfs_key key; in btrfs_print_leaf() local
[all …]
|
| D | file-item.c | 262 struct btrfs_key key; in search_csum_tree() local
277 btrfs_item_key_to_cpu(path->nodes[0], &key, path->slots[0]); in search_csum_tree()
280 csum_start = key.offset; in search_csum_tree()
294 btrfs_item_key_to_cpu(path->nodes[0], &key, path->slots[0]); in search_csum_tree()
297 csum_start = key.offset; in search_csum_tree()
500 struct btrfs_key key; in btrfs_lookup_csums_range() local
525 key.objectid = BTRFS_EXTENT_CSUM_OBJECTID; in btrfs_lookup_csums_range()
526 key.offset = start; in btrfs_lookup_csums_range()
527 key.type = BTRFS_EXTENT_CSUM_KEY; in btrfs_lookup_csums_range()
529 ret = btrfs_search_slot(NULL, root, &key, path, 0, 0); in btrfs_lookup_csums_range()
[all …]
|
| D | orphan.c | 13 struct btrfs_key key; in btrfs_insert_orphan_item() local
16 key.objectid = BTRFS_ORPHAN_OBJECTID; in btrfs_insert_orphan_item()
17 key.type = BTRFS_ORPHAN_ITEM_KEY; in btrfs_insert_orphan_item()
18 key.offset = offset; in btrfs_insert_orphan_item()
24 ret = btrfs_insert_empty_item(trans, root, path, &key, 0); in btrfs_insert_orphan_item()
34 struct btrfs_key key; in btrfs_del_orphan_item() local
37 key.objectid = BTRFS_ORPHAN_OBJECTID; in btrfs_del_orphan_item()
38 key.type = BTRFS_ORPHAN_ITEM_KEY; in btrfs_del_orphan_item()
39 key.offset = offset; in btrfs_del_orphan_item()
45 ret = btrfs_search_slot(trans, root, &key, path, -1, 1); in btrfs_del_orphan_item()
|
| /fs/btrfs/tests/ |
| D | extent-buffer-tests.c | 25 struct btrfs_key key; in test_btrfs_split_item() local
59 key.objectid = 0; in test_btrfs_split_item()
60 key.type = BTRFS_EXTENT_CSUM_KEY; in test_btrfs_split_item()
61 key.offset = 0; in test_btrfs_split_item()
63 setup_items_for_insert(root, path, &key, &value_len, 1); in test_btrfs_split_item()
68 key.offset = 3; in test_btrfs_split_item()
75 ret = btrfs_split_item(NULL, root, path, &key, 17); in test_btrfs_split_item()
85 btrfs_item_key_to_cpu(eb, &key, 0); in test_btrfs_split_item()
86 if (key.objectid != 0 || key.type != BTRFS_EXTENT_CSUM_KEY || in test_btrfs_split_item()
87 key.offset != 0) { in test_btrfs_split_item()
[all …]
|
| D | qgroup-tests.c | 72 struct btrfs_key key; in add_tree_ref() local
78 key.objectid = bytenr; in add_tree_ref()
79 key.type = BTRFS_EXTENT_ITEM_KEY; in add_tree_ref()
80 key.offset = num_bytes; in add_tree_ref()
88 ret = btrfs_search_slot(&trans, root, &key, path, 0, 1); in add_tree_ref()
101 key.objectid = bytenr; in add_tree_ref()
103 key.type = BTRFS_SHARED_BLOCK_REF_KEY; in add_tree_ref()
104 key.offset = parent; in add_tree_ref()
106 key.type = BTRFS_TREE_BLOCK_REF_KEY; in add_tree_ref()
107 key.offset = root_objectid; in add_tree_ref()
[all …]
|
| /fs/cachefiles/ |
| D | key.c | 37 char *key; in cachefiles_cook_key() local
77 key = kmalloc(max, cachefiles_gfp); in cachefiles_cook_key()
78 if (!key) in cachefiles_cook_key()
84 sprintf(key, "@%02x%c+", (unsigned) csum, 0); in cachefiles_cook_key()
92 key[len + 1] = cachefiles_charmap[acc & 63]; in cachefiles_cook_key()
94 key[len] = cachefiles_charmap[acc & 63]; in cachefiles_cook_key()
100 key[len++] = '\0'; in cachefiles_cook_key()
102 key[len++] = '+'; in cachefiles_cook_key()
106 key[len++] = *raw++; in cachefiles_cook_key()
119 key[len++] = '\0'; in cachefiles_cook_key()
[all …]
|
| /fs/crypto/ |
| D | keysetup_v1.c | 91 static struct key *
98 struct key *key; in find_and_lock_process_key() local
107 key = request_key(&key_type_logon, description, NULL); in find_and_lock_process_key()
109 if (IS_ERR(key)) in find_and_lock_process_key()
110 return key; in find_and_lock_process_key()
112 down_read(&key->sem); in find_and_lock_process_key()
113 ukp = user_key_payload_locked(key); in find_and_lock_process_key()
124 key->description); in find_and_lock_process_key()
131 key->description, payload->size, min_keysize); in find_and_lock_process_key()
136 return key; in find_and_lock_process_key()
[all …]
|
| /fs/reiserfs/ |
| D | prints.c | 17 static char *reiserfs_cpu_offset(struct cpu_key *key) in reiserfs_cpu_offset() argument
19 if (cpu_key_k_type(key) == TYPE_DIRENTRY) in reiserfs_cpu_offset()
22 GET_HASH_VALUE(cpu_key_k_offset(key)), in reiserfs_cpu_offset()
24 GET_GENERATION_NUMBER(cpu_key_k_offset(key))); in reiserfs_cpu_offset()
27 (unsigned long long)cpu_key_k_offset(key)); in reiserfs_cpu_offset()
31 static char *le_offset(struct reiserfs_key *key) in le_offset() argument
35 version = le_key_version(key); in le_offset()
36 if (le_key_k_type(version, key) == TYPE_DIRENTRY) in le_offset()
39 GET_HASH_VALUE(le_key_k_offset(version, key)), in le_offset()
41 GET_GENERATION_NUMBER(le_key_k_offset(version, key))); in le_offset()
[all …]
|
| /fs/ntfs3/ |
| D | bitmap.c | 27 size_t key; member
155 if (v < k->key) { in rb_lookup()
157 } else if (v > k->key) { in rb_lookup()
175 size_t e_ckey = e->count.key; in rb_insert_count()
176 size_t e_skey = e->start.key; in rb_insert_count()
182 if (e_ckey > k->count.key) { in rb_insert_count()
184 } else if (e_ckey < k->count.key) { in rb_insert_count()
186 } else if (e_skey < k->start.key) { in rb_insert_count()
188 } else if (e_skey > k->start.key) { in rb_insert_count()
208 size_t e_skey = e->start.key; in rb_insert_start()
[all …]
|
| /fs/orangefs/ |
| D | xattr.c | 31 static int is_reserved_key(const char *key, size_t size) in is_reserved_key() argument
37 return strncmp(key, SYSTEM_ORANGEFS_KEY, SYSTEM_ORANGEFS_KEY_LEN) ? 1 : 0; in is_reserved_key()
54 static unsigned int xattr_key(const char *key) in xattr_key() argument
57 while (key) in xattr_key()
58 i += *key++; in xattr_key()
63 const char *key) in find_cached_xattr() argument
69 h = &orangefs_inode->xattr_cache[xattr_key(key)]; in find_cached_xattr()
78 if (!strcmp(cx->key, key)) in find_cached_xattr()
153 strcpy(new_op->upcall.req.getxattr.key, name); in orangefs_inode_getxattr()
171 (char *)new_op->upcall.req.getxattr.key); in orangefs_inode_getxattr()
[all …]
|