/third_party/libdrm/tests/ |
H A D | drmsl.c | 113 unsigned long prev_key = 0; in print_neighbors() local 120 &prev_key, &prev_value, in print_neighbors() 123 key, retval, prev_key, next_key); in print_neighbors() 124 if (prev_key != expected_prev) { in print_neighbors() 126 prev_key, expected_prev); in print_neighbors()
|
/kernel/linux/linux-6.6/fs/btrfs/ |
H A D | tree-checker.c | 163 * This functions checks prev_key->objectid, to ensure current key and prev_key 173 struct btrfs_key *prev_key) in check_prev_ino() 193 if (key->objectid == prev_key->objectid) in check_prev_ino() 199 prev_key->objectid, key->objectid); in check_prev_ino() 204 struct btrfs_key *prev_key) in check_extent_data_item() 225 if (unlikely(!check_prev_ino(leaf, key, slot, prev_key))) in check_extent_data_item() 323 prev_key->objectid == key->objectid && in check_extent_data_item() 324 prev_key->type == BTRFS_EXTENT_DATA_KEY) { in check_extent_data_item() 330 prev_end = file_extent_end(leaf, prev_key, prev_f in check_extent_data_item() 171 check_prev_ino(struct extent_buffer *leaf, struct btrfs_key *key, int slot, struct btrfs_key *prev_key) check_prev_ino() argument 202 check_extent_data_item(struct extent_buffer *leaf, struct btrfs_key *key, int slot, struct btrfs_key *prev_key) check_extent_data_item() argument 342 check_csum_item(struct extent_buffer *leaf, struct btrfs_key *key, int slot, struct btrfs_key *prev_key) check_csum_item() argument 498 check_dir_item(struct extent_buffer *leaf, struct btrfs_key *key, struct btrfs_key *prev_key, int slot) check_dir_item() argument 1267 check_extent_item(struct extent_buffer *leaf, struct btrfs_key *key, int slot, struct btrfs_key *prev_key) check_extent_item() argument 1584 check_inode_ref(struct extent_buffer *leaf, struct btrfs_key *key, struct btrfs_key *prev_key, int slot) check_inode_ref() argument 1637 check_leaf_item(struct extent_buffer *leaf, struct btrfs_key *key, int slot, struct btrfs_key *prev_key) check_leaf_item() argument 1699 struct btrfs_key prev_key = {0, 0, 0}; __btrfs_check_leaf() local [all...] |
/kernel/linux/linux-5.10/fs/btrfs/ |
H A D | tree-checker.c | 157 * This functions checks prev_key->objectid, to ensure current key and prev_key 167 struct btrfs_key *prev_key) in check_prev_ino() 187 if (key->objectid == prev_key->objectid) in check_prev_ino() 193 prev_key->objectid, key->objectid); in check_prev_ino() 198 struct btrfs_key *prev_key) in check_extent_data_item() 219 if (!check_prev_ino(leaf, key, slot, prev_key)) in check_extent_data_item() 315 prev_key->objectid == key->objectid && in check_extent_data_item() 316 prev_key->type == BTRFS_EXTENT_DATA_KEY) { in check_extent_data_item() 322 prev_end = file_extent_end(leaf, prev_key, prev_f in check_extent_data_item() 165 check_prev_ino(struct extent_buffer *leaf, struct btrfs_key *key, int slot, struct btrfs_key *prev_key) check_prev_ino() argument 196 check_extent_data_item(struct extent_buffer *leaf, struct btrfs_key *key, int slot, struct btrfs_key *prev_key) check_extent_data_item() argument 334 check_csum_item(struct extent_buffer *leaf, struct btrfs_key *key, int slot, struct btrfs_key *prev_key) check_csum_item() argument 474 check_dir_item(struct extent_buffer *leaf, struct btrfs_key *key, struct btrfs_key *prev_key, int slot) check_dir_item() argument 1478 check_inode_ref(struct extent_buffer *leaf, struct btrfs_key *key, struct btrfs_key *prev_key, int slot) check_inode_ref() argument 1531 check_leaf_item(struct extent_buffer *leaf, struct btrfs_key *key, int slot, struct btrfs_key *prev_key) check_leaf_item() argument 1589 struct btrfs_key prev_key = {0, 0, 0}; check_leaf() local [all...] |
/kernel/linux/linux-5.10/tools/perf/util/ |
H A D | bpf_map.c | 31 void *prev_key = NULL, *key, *value; in bpf_map__fprintf() local 50 while ((err = bpf_map_get_next_key(fd, prev_key, key) == 0)) { in bpf_map__fprintf() 61 prev_key = key; in bpf_map__fprintf()
|
/kernel/linux/linux-6.6/tools/perf/util/ |
H A D | bpf_map.c | 31 void *prev_key = NULL, *key, *value; in bpf_map__fprintf() local 50 while ((err = bpf_map_get_next_key(fd, prev_key, key) == 0)) { in bpf_map__fprintf() 61 prev_key = key; in bpf_map__fprintf()
|
H A D | bpf_lock_contention.c | 252 struct contention_key *prev_key, key = {}; in lock_contention_read() local 290 prev_key = NULL; in lock_contention_read() 291 while (!bpf_map_get_next_key(fd, prev_key, &key)) { in lock_contention_read() 356 prev_key = &key; in lock_contention_read()
|
/kernel/linux/linux-6.6/tools/testing/selftests/bpf/prog_tests/ |
H A D | stacktrace_build_id_nmi.c | 15 __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()
|
H A D | stacktrace_build_id.c | 11 __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()
|
/kernel/linux/linux-5.10/kernel/ |
H A D | static_call.c | 214 struct static_call_key *key, *prev_key = NULL; in __static_call_init() local 230 if (key != prev_key) { in __static_call_init() 231 prev_key = key; in __static_call_init() 397 struct static_call_key *key, *prev_key = NULL; in static_call_del_module() local 403 if (key == prev_key) in static_call_del_module() 406 prev_key = key; in static_call_del_module()
|
/kernel/linux/linux-6.6/kernel/ |
H A D | static_call_inline.c | 225 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() 408 struct static_call_key *key, *prev_key = NULL; in static_call_del_module() local 414 if (key == prev_key) in static_call_del_module() 417 prev_key = key; in static_call_del_module()
|
/third_party/libdrm/ |
H A D | xf86drmSL.c | 232 unsigned long *prev_key, void **prev_value, in drmSLLookupNeighbors() 241 *prev_key = *next_key = key; in drmSLLookupNeighbors() 245 *prev_key = update[0]->key; in drmSLLookupNeighbors() 231 drmSLLookupNeighbors(void *l, unsigned long key, unsigned long *prev_key, void **prev_value, unsigned long *next_key, void **next_value) drmSLLookupNeighbors() argument
|
H A D | xf86drm.h | 761 unsigned long *prev_key, void **prev_value,
|
/kernel/linux/linux-5.10/kernel/bpf/ |
H A D | inode.c | 219 void *prev_key; in map_seq_next() local 226 prev_key = NULL; in map_seq_next() 228 prev_key = key; in map_seq_next() 231 if (map->ops->map_get_next_key(map, prev_key, key)) { in map_seq_next()
|
H A D | syscall.c | 1397 void *buf, *buf_prevkey, *prev_key, *key, *value; in generic_map_lookup_batch() local 1428 prev_key = NULL; in generic_map_lookup_batch() 1434 prev_key = buf_prevkey; in generic_map_lookup_batch() 1438 err = map->ops->map_get_next_key(map, prev_key, key); in generic_map_lookup_batch() 1467 if (!prev_key) in generic_map_lookup_batch() 1468 prev_key = buf_prevkey; in generic_map_lookup_batch() 1470 swap(prev_key, key); in generic_map_lookup_batch() 1480 (cp && copy_to_user(uobatch, prev_key, map->key_size)))) in generic_map_lookup_batch()
|
/kernel/linux/linux-6.6/kernel/bpf/ |
H A D | inode.c | 218 void *prev_key; in map_seq_next() local 225 prev_key = NULL; in map_seq_next() 227 prev_key = key; in map_seq_next() 230 if (map->ops->map_get_next_key(map, prev_key, key)) { in map_seq_next()
|
H A D | syscall.c | 1808 void *buf, *buf_prevkey, *prev_key, *key, *value; in generic_map_lookup_batch() local 1839 prev_key = NULL; in generic_map_lookup_batch() 1845 prev_key = buf_prevkey; in generic_map_lookup_batch() 1849 err = map->ops->map_get_next_key(map, prev_key, key); in generic_map_lookup_batch() 1878 if (!prev_key) in generic_map_lookup_batch() 1879 prev_key = buf_prevkey; in generic_map_lookup_batch() 1881 swap(prev_key, key); in generic_map_lookup_batch() 1891 (cp && copy_to_user(uobatch, prev_key, map->key_size)))) in generic_map_lookup_batch()
|
/kernel/linux/linux-5.10/lib/ |
H A D | rbtree_test.c | 195 u32 prev_key = 0; in check() local 199 WARN_ON_ONCE(node->key < prev_key); in check() 207 prev_key = node->key; in check()
|
/kernel/linux/linux-6.6/lib/ |
H A D | rbtree_test.c | 195 u32 prev_key = 0; in check() local 199 WARN_ON_ONCE(node->key < prev_key); in check() 207 prev_key = node->key; in check()
|
/kernel/linux/linux-5.10/tools/bpf/bpftool/ |
H A D | map.c | 835 void *key, *value, *prev_key; in map_dump() local 848 prev_key = NULL; in map_dump() 872 err = bpf_map_get_next_key(fd, prev_key, key); in map_dump() 880 prev_key = key; in map_dump()
|
/kernel/linux/linux-6.6/tools/bpf/bpftool/ |
H A D | map.c | 826 void *key, *value, *prev_key; in map_dump() local 839 prev_key = NULL; in map_dump() 866 err = bpf_map_get_next_key(fd, prev_key, key); in map_dump() 874 prev_key = key; in map_dump()
|
/third_party/node/deps/v8/src/diagnostics/ |
H A D | objects-debug.cc | 2095 Name prev_key; in IsSortedNoDuplicates() local 2115 DCHECK_NE(prev_key, key); in IsSortedNoDuplicates() 2118 int cmp = CompareKeys(prev_key, prev_hash, prev_kind, prev_attributes, key, in IsSortedNoDuplicates() 2124 prev_key = key; in IsSortedNoDuplicates()
|