Home
last modified time | relevance | path

Searched refs:cur_key (Results 1 – 3 of 3) 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/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()