Home
last modified time | relevance | path

Searched refs:cur_key (Results 1 – 8 of 8) sorted by relevance

/linux/Documentation/bpf/
H A Dmap_lpm_trie.rst94 int bpf_map_get_next_key (int fd, const void *cur_key, void *next_key)
98 fetched by calling ``bpf_map_get_next_key()`` with ``cur_key`` set to
101 ``-ENOENT`` if ``cur_key`` is the last key in the trie, or negative
181 struct ipv4_lpm_key *cur_key = NULL;
187 err = bpf_map_get_next_key(map_fd, cur_key, &next_key);
195 cur_key = &next_key;
H A Dmap_hash.rst126 int bpf_map_get_next_key(int fd, const void *cur_key, void *next_key)
130 calling ``bpf_map_get_next_key()`` with ``cur_key`` set to
133 cur_key is the last key in the hash, or negative error in case of
136 Note that if ``cur_key`` gets deleted then ``bpf_map_get_next_key()``
202 struct key *cur_key = NULL;
208 err = bpf_map_get_next_key(map_fd, cur_key, &next_key);
216 cur_key = &next_key;
/linux/drivers/input/keyboard/
H A Ddlink-dir685-touchkeys.c24 unsigned long cur_key; member
49 changed = tk->cur_key ^ key; in dir685_tk_irq_thread()
57 tk->cur_key = key; in dir685_tk_irq_thread()
/linux/net/sctp/
H A Dauth.c801 struct sctp_shared_key *cur_key, *shkey; in sctp_auth_set_key() local
826 cur_key = sctp_auth_shkey_create(auth_key->sca_keynumber, GFP_KERNEL); in sctp_auth_set_key()
827 if (!cur_key) in sctp_auth_set_key()
833 kfree(cur_key); in sctp_auth_set_key()
838 cur_key->key = key; in sctp_auth_set_key()
841 list_add(&cur_key->key_list, sh_keys); in sctp_auth_set_key()
846 list_add(&cur_key->key_list, sh_keys); in sctp_auth_set_key()
850 list_del_init(&cur_key->key_list); in sctp_auth_set_key()
851 sctp_auth_shkey_release(cur_key); in sctp_auth_set_key()
/linux/fs/befs/
H A Dbtree.c417 int cur_key; in befs_btree_read() local
484 cur_key = key_no - key_sum; in befs_btree_read()
489 keystart = befs_bt_get_key(sb, this_node, cur_key, &keylen); in befs_btree_read()
492 (long long unsigned int)node_off, (int)cur_key, in befs_btree_read()
503 *value = fs64_to_cpu(sb, valarray[cur_key]); in befs_btree_read()
507 cur_key, keylen, keybuf, *value); in befs_btree_read()
/linux/fs/btrfs/
H A Dbackref.c2837 memset(&iter->cur_key, 0, sizeof(iter->cur_key)); in btrfs_backref_iter_release()
2884 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()
2940 if (iter->cur_key.type == BTRFS_EXTENT_ITEM_KEY || in btrfs_backref_iter_is_inline_ref()
2941 iter->cur_key.type == BTRFS_METADATA_ITEM_KEY) in btrfs_backref_iter_is_inline_ref()
3003 btrfs_item_key_to_cpu(path->nodes[0], &iter->cur_key, path->slots[0]); in btrfs_backref_iter_next()
3004 if (iter->cur_key.objectid != iter->bytenr || in btrfs_backref_iter_next()
[all …]
H A Dctree.c4744 struct btrfs_key cur_key; in btrfs_find_next_key() local
4756 btrfs_item_key_to_cpu(c, &cur_key, slot); in btrfs_find_next_key()
4758 btrfs_node_key_to_cpu(c, &cur_key, slot); in btrfs_find_next_key()
4763 ret = btrfs_search_slot(NULL, root, &cur_key, path, in btrfs_find_next_key()
/linux/tools/lib/bpf/
H A Dlibbpf.c11355 const void *cur_key, void *next_key, size_t key_sz) in bpf_map__get_next_key() argument
11363 return bpf_map_get_next_key(map->fd, cur_key, next_key); in bpf_map__get_next_key()