| /linux-6.15/drivers/md/dm-vdo/indexer/ |
| H A D | radix-sort.c | 47 sort_key_t *first_key; member
78 while ((--next >= task.first_key) && in insert_key()
94 for (next = task.first_key + 1; next <= task.last_key; next++) in insertion_sort()
104 task->first_key = first_key; in push_task()
105 task->last_key = &first_key[count - 1]; in push_task()
134 for (key_ptr = task.first_key; key_ptr <= task.last_key; key_ptr++) { in measure_bins()
174 struct histogram *bins, sort_key_t *first_key, in push_bins() argument
177 sort_key_t *pile_start = first_key; in push_bins()
248 .first_key = keys, in uds_radix_sort()
283 &insertion_task_list, pile, bins, task.first_key, in uds_radix_sort()
[all …]
|
| /linux-6.15/tools/testing/selftests/bpf/ |
| H A D | test_maps.c | 35 long long key, next_key, first_key, value; in test_hashmap() local
102 assert(bpf_map_get_next_key(fd, NULL, &first_key) == 0 && in test_hashmap()
103 (first_key == 1 || first_key == 2)); in test_hashmap()
105 (next_key == first_key)); in test_hashmap()
108 (next_key != first_key)); in test_hashmap()
152 long long key, next_key, first_key; in test_hashmap_percpu() local
223 assert(bpf_map_get_next_key(fd, NULL, &first_key) == 0 && in test_hashmap_percpu()
224 ((expected_key_mask & first_key) == first_key)); in test_hashmap_percpu()
226 if (first_key) { in test_hashmap_percpu()
227 assert(next_key == first_key); in test_hashmap_percpu()
[all …]
|
| /linux-6.15/fs/btrfs/ |
| H A D | tree-checker.h | 39 struct btrfs_key first_key; member
|
| H A D | qgroup.h | 169 struct btrfs_key first_key; member
|
| H A D | delayed-inode.c | 661 struct btrfs_key first_key; in btrfs_insert_delayed_item() local
724 first_key.objectid = node->inode_id; in btrfs_insert_delayed_item()
725 first_key.type = BTRFS_DIR_INDEX_KEY; in btrfs_insert_delayed_item()
726 first_key.offset = first_item->index; in btrfs_insert_delayed_item()
727 batch.keys = &first_key; in btrfs_insert_delayed_item()
|
| H A D | tree-checker.c | 2266 ret = btrfs_comp_cpu_keys(&check->first_key, &found_key); in btrfs_verify_level_key()
2273 eb->start, check->transid, check->first_key.objectid, in btrfs_verify_level_key()
2274 check->first_key.type, check->first_key.offset, in btrfs_verify_level_key()
|
| H A D | print-tree.c | 429 btrfs_node_key_to_cpu(c, &check.first_key, i); in btrfs_print_tree()
|
| H A D | ctree.c | 830 btrfs_node_key_to_cpu(parent, &check.first_key, slot); in btrfs_read_node_slot()
1457 btrfs_node_key_to_cpu(*eb_ret, &check.first_key, slot); in read_block_for_search()
1850 struct btrfs_disk_key first_key; in search_leaf() local
1853 btrfs_item_key(leaf, &first_key, 0); in search_leaf()
1862 ret = btrfs_comp_keys(&first_key, key); in search_leaf()
|
| H A D | qgroup.c | 4740 btrfs_node_key_to_cpu(reloc_parent, &block->first_key, reloc_slot); in btrfs_qgroup_add_swapped_blocks()
4850 memcpy(&check.first_key, &block->first_key, sizeof(check.first_key)); in btrfs_qgroup_trace_subtree_after_cow()
|
| H A D | disk-io.c | 430 const struct btrfs_key *expect_key = &check->first_key; in btrfs_validate_extent_buffer()
|
| H A D | tree-log.c | 2614 btrfs_node_key_to_cpu(cur, &check.first_key, path->slots[*level]); in walk_down_log_tree()
|
| H A D | extent-tree.c | 5551 btrfs_node_key_to_cpu(path->nodes[level], &check.first_key, path->slots[level]); in check_next_block_uptodate()
|
| /linux-6.15/drivers/md/persistent-data/ |
| H A D | dm-btree-remove.c | 750 uint64_t *first_key, uint64_t end_key, in dm_btree_remove_leaves() argument
757 r = remove_one(info, root, first_key, end_key, &root, nr_removed); in dm_btree_remove_leaves()
|
| /linux-6.15/net/ipv4/ |
| H A D | tcp_ao.c | 1192 struct tcp_ao_key *key, *new_key, *first_key; in tcp_ao_copy_all_matching() local
1258 first_key = hlist_entry_safe(key_head, struct tcp_ao_key, node); in tcp_ao_copy_all_matching()
1264 new_ao->current_key = first_key; in tcp_ao_copy_all_matching()
1271 new_ao->rnext_key = first_key; in tcp_ao_copy_all_matching()
|