Home
last modified time | relevance | path

Searched refs:cur_key (Results 1 - 14 of 14) sorted by relevance

/kernel/linux/linux-5.10/fs/btrfs/
H A Dbackref.h90 struct btrfs_key cur_key; member
124 if (iter->cur_key.type == BTRFS_EXTENT_ITEM_KEY && in btrfs_backref_has_tree_block_info()
137 if (iter->cur_key.type == BTRFS_EXTENT_ITEM_KEY || in btrfs_backref_iter_is_inline_ref()
138 iter->cur_key.type == BTRFS_METADATA_ITEM_KEY) in btrfs_backref_iter_is_inline_ref()
150 memset(&iter->cur_key, 0, sizeof(iter->cur_key)); in btrfs_backref_iter_release()
H A Dbackref.c2429 memcpy(&iter->cur_key, &key, sizeof(key));
2462 btrfs_item_key_to_cpu(path->nodes[0], &iter->cur_key,
2464 if (iter->cur_key.objectid != bytenr ||
2465 (iter->cur_key.type != BTRFS_SHARED_BLOCK_REF_KEY &&
2466 iter->cur_key.type != BTRFS_TREE_BLOCK_REF_KEY)) {
2487 * Caller needs to check whether it's inline ref or not by iter->cur_key.
2530 btrfs_item_key_to_cpu(path->nodes[0], &iter->cur_key, path->slots[0]);
2531 if (iter->cur_key.objectid != iter->bytenr ||
2532 (iter->cur_key.type != BTRFS_TREE_BLOCK_REF_KEY &&
2533 iter->cur_key
[all...]
H A Dctree.c5389 struct btrfs_key cur_key; in btrfs_find_next_key() local
5401 btrfs_item_key_to_cpu(c, &cur_key, slot); in btrfs_find_next_key()
5403 btrfs_node_key_to_cpu(c, &cur_key, slot); in btrfs_find_next_key()
5408 ret = btrfs_search_slot(NULL, root, &cur_key, path, in btrfs_find_next_key()
/kernel/linux/linux-6.6/fs/btrfs/
H A Dbackref.h266 struct btrfs_key cur_key; member
299 if (iter->cur_key.type == BTRFS_EXTENT_ITEM_KEY && in btrfs_backref_has_tree_block_info()
312 if (iter->cur_key.type == BTRFS_EXTENT_ITEM_KEY || in btrfs_backref_iter_is_inline_ref()
313 iter->cur_key.type == BTRFS_METADATA_ITEM_KEY) in btrfs_backref_iter_is_inline_ref()
325 memset(&iter->cur_key, 0, sizeof(iter->cur_key)); in btrfs_backref_iter_release()
H A Dbackref.c2884 memcpy(&iter->cur_key, &key, sizeof(key)); in btrfs_backref_iter_start()
2917 btrfs_item_key_to_cpu(path->nodes[0], &iter->cur_key, in btrfs_backref_iter_start()
2919 if (iter->cur_key.objectid != bytenr || in btrfs_backref_iter_start()
2920 (iter->cur_key.type != BTRFS_SHARED_BLOCK_REF_KEY && in btrfs_backref_iter_start()
2921 iter->cur_key.type != BTRFS_TREE_BLOCK_REF_KEY)) { in btrfs_backref_iter_start()
2942 * Caller needs to check whether it's inline ref or not by iter->cur_key.
2987 btrfs_item_key_to_cpu(path->nodes[0], &iter->cur_key, path->slots[0]); in btrfs_backref_iter_next()
2988 if (iter->cur_key.objectid != iter->bytenr || in btrfs_backref_iter_next()
2989 (iter->cur_key.type != BTRFS_TREE_BLOCK_REF_KEY && in btrfs_backref_iter_next()
2990 iter->cur_key in btrfs_backref_iter_next()
[all...]
H A Dctree.c4870 struct btrfs_key cur_key; in btrfs_find_next_key() local
4882 btrfs_item_key_to_cpu(c, &cur_key, slot); in btrfs_find_next_key()
4884 btrfs_node_key_to_cpu(c, &cur_key, slot); in btrfs_find_next_key()
4889 ret = btrfs_search_slot(NULL, root, &cur_key, path, in btrfs_find_next_key()
/kernel/linux/linux-5.10/net/sctp/
H A Dauth.c821 struct sctp_shared_key *cur_key, *shkey; in sctp_auth_set_key() local
846 cur_key = sctp_auth_shkey_create(auth_key->sca_keynumber, GFP_KERNEL); in sctp_auth_set_key()
847 if (!cur_key) in sctp_auth_set_key()
853 kfree(cur_key); in sctp_auth_set_key()
858 cur_key->key = key; in sctp_auth_set_key()
861 list_add(&cur_key->key_list, sh_keys); in sctp_auth_set_key()
866 list_add(&cur_key->key_list, sh_keys); in sctp_auth_set_key()
870 list_del_init(&cur_key->key_list); in sctp_auth_set_key()
871 sctp_auth_shkey_release(cur_key); in sctp_auth_set_key()
/kernel/linux/linux-6.6/net/sctp/
H A Dauth.c821 struct sctp_shared_key *cur_key, *shkey; in sctp_auth_set_key() local
846 cur_key = sctp_auth_shkey_create(auth_key->sca_keynumber, GFP_KERNEL); in sctp_auth_set_key()
847 if (!cur_key) in sctp_auth_set_key()
853 kfree(cur_key); in sctp_auth_set_key()
858 cur_key->key = key; in sctp_auth_set_key()
861 list_add(&cur_key->key_list, sh_keys); in sctp_auth_set_key()
866 list_add(&cur_key->key_list, sh_keys); in sctp_auth_set_key()
870 list_del_init(&cur_key->key_list); in sctp_auth_set_key()
871 sctp_auth_shkey_release(cur_key); in sctp_auth_set_key()
/kernel/linux/linux-5.10/drivers/input/keyboard/
H A Ddlink-dir685-touchkeys.c23 unsigned long cur_key; member
48 changed = tk->cur_key ^ key; in dir685_tk_irq_thread()
56 tk->cur_key = key; in dir685_tk_irq_thread()
/kernel/linux/linux-6.6/drivers/input/keyboard/
H A Ddlink-dir685-touchkeys.c23 unsigned long cur_key; member
48 changed = tk->cur_key ^ key; in dir685_tk_irq_thread()
56 tk->cur_key = key; in dir685_tk_irq_thread()
/kernel/linux/linux-5.10/fs/befs/
H A Dbtree.c418 int cur_key; in befs_btree_read() local
485 cur_key = key_no - key_sum; in befs_btree_read()
490 keystart = befs_bt_get_key(sb, this_node, cur_key, &keylen); in befs_btree_read()
493 (long long unsigned int)node_off, (int)cur_key, in befs_btree_read()
504 *value = fs64_to_cpu(sb, valarray[cur_key]); in befs_btree_read()
508 cur_key, keylen, keybuf, *value); in befs_btree_read()
/kernel/linux/linux-6.6/fs/befs/
H A Dbtree.c418 int cur_key; in befs_btree_read() local
485 cur_key = key_no - key_sum; in befs_btree_read()
490 keystart = befs_bt_get_key(sb, this_node, cur_key, &keylen); in befs_btree_read()
493 (long long unsigned int)node_off, (int)cur_key, in befs_btree_read()
504 *value = fs64_to_cpu(sb, valarray[cur_key]); in befs_btree_read()
508 cur_key, keylen, keybuf, *value); in befs_btree_read()
/kernel/linux/linux-6.6/tools/lib/bpf/
H A Dlibbpf.h1140 * @param cur_key pointer to memory containing bytes of current key or NULL to
1144 * @return 0, on success; -ENOENT if **cur_key** is the last key in BPF map;
1151 const void *cur_key, void *next_key, size_t key_sz);
H A Dlibbpf.c9900 const void *cur_key, void *next_key, size_t key_sz) in bpf_map__get_next_key()
9908 return bpf_map_get_next_key(map->fd, cur_key, next_key); in bpf_map__get_next_key()
9899 bpf_map__get_next_key(const struct bpf_map *map, const void *cur_key, void *next_key, size_t key_sz) bpf_map__get_next_key() argument

Completed in 49 milliseconds