Home
last modified time | relevance | path

Searched refs:prev_key (Results 1 – 13 of 13) sorted by relevance

/linux/fs/btrfs/
H A Dtree-checker.c177 struct btrfs_key *prev_key) in check_prev_ino() argument
198 if (key->objectid == prev_key->objectid) in check_prev_ino()
204 prev_key->objectid, key->objectid); in check_prev_ino()
209 struct btrfs_key *prev_key) in check_extent_data_item() argument
230 if (unlikely(!check_prev_ino(leaf, key, slot, prev_key))) in check_extent_data_item()
355 prev_key->objectid == key->objectid && in check_extent_data_item()
356 prev_key->type == BTRFS_EXTENT_DATA_KEY) { in check_extent_data_item()
362 prev_end = file_extent_end(leaf, prev_key, prev_fi); in check_extent_data_item()
393 int slot, struct btrfs_key *prev_key) in check_csum_item() argument
417 if (slot > 0 && prev_key->type == BTRFS_EXTENT_CSUM_KEY) { in check_csum_item()
[all …]
/linux/tools/perf/util/
H A Dbpf_lock_contention.c65 long key, *prev_key; in run_slab_cache_iter() local
84 prev_key = NULL; in run_slab_cache_iter()
85 while (!bpf_map_get_next_key(fd, prev_key, &key)) { in run_slab_cache_iter()
96 prev_key = &key; in run_slab_cache_iter()
409 long key, *prev_key; in lock_contention_prepare()
415 prev_key = NULL; in lock_contention_prepare()
416 while (!bpf_map_get_next_key(cache_fd, prev_key, &key)) { in lock_contention_prepare()
428 prev_key = &key;
500 int *prev_key, key; in account_end_timestamp()
510 prev_key in account_end_timestamp()
402 long key, *prev_key; lock_contention_prepare() local
493 int *prev_key, key; account_end_timestamp() local
721 struct contention_key *prev_key, key = {}; lock_contention_read() local
[all...]
H A Dbpf_map.c
H A Dbpf-trace-summary.c380 struct syscall_key *prev_key, key; in trace_print_bpf_summary() local
394 prev_key = NULL; in trace_print_bpf_summary()
395 while (!bpf_map__get_next_key(map, prev_key, &key, sizeof(key))) { in trace_print_bpf_summary()
414 prev_key = &key; in trace_print_bpf_summary()
H A Dbpf-filter.c238 u64 key, *prev_key = NULL; in destroy_event_hash() local
253 while (!bpf_map_get_next_key(fd, prev_key, &key)) { in destroy_event_hash()
270 prev_key = &key; in destroy_event_hash()
/linux/tools/testing/selftests/bpf/prog_tests/
H A Dstacktrace_build_id.c11 __u32 key, prev_key, val, duration = 0; in test_stacktrace_build_id() local
77 prev_key = key; in test_stacktrace_build_id()
78 } while (bpf_map__get_next_key(skel->maps.stackmap, &prev_key, &key, sizeof(key)) == 0); in test_stacktrace_build_id()
H A Dstacktrace_build_id_nmi.c15 __u32 key, prev_key, val, duration = 0; in test_stacktrace_build_id_nmi() local
105 prev_key = key; in test_stacktrace_build_id_nmi()
106 } while (bpf_map__get_next_key(skel->maps.stackmap, &prev_key, &key, sizeof(key)) == 0); in test_stacktrace_build_id_nmi()
/linux/kernel/
H A Dstatic_call_inline.c225 struct static_call_key *key, *prev_key = NULL; in __static_call_init() local
241 if (key != prev_key) { in __static_call_init()
242 prev_key = key; in __static_call_init()
407 struct static_call_key *key, *prev_key = NULL; in static_call_del_module() local
424 if (key == prev_key) in static_call_del_module()
427 prev_key = key; in static_call_del_module()
/linux/lib/
H A Drhashtable.c700 const void *prev_key) in __rhashtable_next_in_table() argument
702 struct rhashtable_compare_arg arg = { .ht = ht, .key = prev_key }; in __rhashtable_next_in_table()
708 if (prev_key) { in __rhashtable_next_in_table()
709 b = rht_key_hashfn(ht, tbl, prev_key, params); in __rhashtable_next_in_table()
771 void *rhashtable_next_key(struct rhashtable *ht, const void *prev_key) in rhashtable_next_key() argument
781 he = __rhashtable_next_in_table(ht, tbl, prev_key); in rhashtable_next_key()
785 prev_key = NULL; in rhashtable_next_key()
H A Drbtree_test.c196 u32 prev_key = 0; in check() local
200 WARN_ON_ONCE(node->key < prev_key); in check()
208 prev_key = node->key; in check()
/linux/tools/bpf/bpftool/
H A Dmap.c833 void *key, *value, *prev_key; in map_dump() local
846 prev_key = NULL; in map_dump()
873 err = bpf_map_get_next_key(fd, prev_key, key); in map_dump()
881 prev_key = key; in map_dump()
/linux/kernel/bpf/
H A Dsyscall.c2131 void *buf, *buf_prevkey, *prev_key, *key, *value; in generic_map_lookup_batch() local
2159 prev_key = NULL; in generic_map_lookup_batch()
2165 prev_key = buf_prevkey; in generic_map_lookup_batch()
2169 err = map->ops->map_get_next_key(map, prev_key, key); in generic_map_lookup_batch()
2194 if (!prev_key) in generic_map_lookup_batch()
2195 prev_key = buf_prevkey; in generic_map_lookup_batch()
2197 swap(prev_key, key); in generic_map_lookup_batch()
2205 (cp && copy_to_user(uobatch, prev_key, map->key_size)))) in generic_map_lookup_batch()
H A Dhashtab.c3199 void *prev_key = NULL; in bpf_each_rhash_elem() local
3215 while ((elem = rhashtable_next_key(&rhtab->ht, prev_key))) { in bpf_each_rhash_elem()
3226 prev_key = elem->data; /* valid while RCU held */ in bpf_each_rhash_elem()