Searched refs:prev_key (Results 1 - 10 of 10) sorted by relevance

/linux-master/tools/perf/util/
H A Dbpf_map.c31 void *prev_key = NULL, *key, *value; local
50 while ((err = bpf_map_get_next_key(fd, prev_key, key) == 0)) {
61 prev_key = key;
H A Dbpf_lock_contention.c247 int *prev_key, key; local
257 prev_key = NULL;
258 while (!bpf_map_get_next_key(ts_fd, prev_key, &key)) {
269 prev_key = &key;
283 prev_key = NULL;
284 while (!bpf_map_get_next_key(ts_fd, prev_key, &key)) {
294 prev_key = &key;
403 struct contention_key *prev_key, key = {}; local
443 prev_key = NULL;
444 while (!bpf_map_get_next_key(fd, prev_key,
[all...]
/linux-master/tools/testing/selftests/bpf/prog_tests/
H A Dstacktrace_build_id_nmi.c15 __u32 key, prev_key, val, duration = 0; local
105 prev_key = key;
106 } while (bpf_map__get_next_key(skel->maps.stackmap, &prev_key, &key, sizeof(key)) == 0);
H A Dstacktrace_build_id.c11 __u32 key, prev_key, val, duration = 0; local
77 prev_key = key;
78 } while (bpf_map__get_next_key(skel->maps.stackmap, &prev_key, &key, sizeof(key)) == 0);
/linux-master/fs/btrfs/
H A Dtree-checker.c167 * This functions checks prev_key->objectid, to ensure current key and prev_key
177 struct btrfs_key *prev_key)
197 if (key->objectid == prev_key->objectid)
203 prev_key->objectid, key->objectid);
208 struct btrfs_key *prev_key)
229 if (unlikely(!check_prev_ino(leaf, key, slot, prev_key)))
327 prev_key->objectid == key->objectid &&
328 prev_key->type == BTRFS_EXTENT_DATA_KEY) {
334 prev_end = file_extent_end(leaf, prev_key, prev_f
175 check_prev_ino(struct extent_buffer *leaf, struct btrfs_key *key, int slot, struct btrfs_key *prev_key) argument
206 check_extent_data_item(struct extent_buffer *leaf, struct btrfs_key *key, int slot, struct btrfs_key *prev_key) argument
346 check_csum_item(struct extent_buffer *leaf, struct btrfs_key *key, int slot, struct btrfs_key *prev_key) argument
502 check_dir_item(struct extent_buffer *leaf, struct btrfs_key *key, struct btrfs_key *prev_key, int slot) argument
1274 check_extent_item(struct extent_buffer *leaf, struct btrfs_key *key, int slot, struct btrfs_key *prev_key) argument
1632 check_inode_ref(struct extent_buffer *leaf, struct btrfs_key *key, struct btrfs_key *prev_key, int slot) argument
1723 check_leaf_item(struct extent_buffer *leaf, struct btrfs_key *key, int slot, struct btrfs_key *prev_key) argument
1788 struct btrfs_key prev_key = {0, 0, 0}; local
[all...]
/linux-master/kernel/
H A Dstatic_call_inline.c225 struct static_call_key *key, *prev_key = NULL; local
241 if (key != prev_key) {
242 prev_key = key;
408 struct static_call_key *key, *prev_key = NULL; local
414 if (key == prev_key)
417 prev_key = key;
/linux-master/lib/
H A Drbtree_test.c195 u32 prev_key = 0; local
199 WARN_ON_ONCE(node->key < prev_key);
207 prev_key = node->key;
/linux-master/kernel/bpf/
H A Dinode.c218 void *prev_key; local
225 prev_key = NULL;
227 prev_key = key;
230 if (map->ops->map_get_next_key(map, prev_key, key)) {
H A Dsyscall.c1903 void *buf, *buf_prevkey, *prev_key, *key, *value; local
1934 prev_key = NULL;
1940 prev_key = buf_prevkey;
1944 err = map->ops->map_get_next_key(map, prev_key, key);
1973 if (!prev_key)
1974 prev_key = buf_prevkey;
1976 swap(prev_key, key);
1986 (cp && copy_to_user(uobatch, prev_key, map->key_size))))
/linux-master/tools/bpf/bpftool/
H A Dmap.c826 void *key, *value, *prev_key; local
839 prev_key = NULL;
866 err = bpf_map_get_next_key(fd, prev_key, key);
874 prev_key = key;

Completed in 245 milliseconds