| /linux/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()
99 static inline void push_task(struct task **stack_pointer, sort_key_t *first_key, in push_task() argument
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()
154 * pile[0] = first_key + bin->size[0],
166 * @first_key
174 push_bins(struct task ** stack,struct task * end_of_stack,struct task ** list,sort_key_t * pile[],struct histogram * bins,sort_key_t * first_key,u16 offset,u16 length) push_bins() argument
[all...] |
| /linux/drivers/gpio/ ! |
| H A D | gpio-macsmc.c | 99 smc_key first_key, last_key; in macsmc_gpio_find_first_gpio_index() local
103 ret = apple_smc_get_key_by_index(smc, 0, &first_key); in macsmc_gpio_find_first_gpio_index()
106 if (key <= first_key) in macsmc_gpio_find_first_gpio_index()
|
| /linux/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()
[all...] |
| /linux/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 | 641 struct btrfs_key first_key; in btrfs_insert_delayed_item() local
704 first_key.objectid = node->inode_id; in btrfs_insert_delayed_item()
705 first_key.type = BTRFS_DIR_INDEX_KEY; in btrfs_insert_delayed_item()
706 first_key.offset = first_item->index; in btrfs_insert_delayed_item()
707 batch.keys = &first_key; in btrfs_insert_delayed_item()
|
| H A D | tree-checker.c | 2252 /* We have @first_key, so this @eb must have at least one item */ in btrfs_verify_level_key()
2266 ret = btrfs_comp_cpu_keys(&check->first_key, &found_key); in btrfs_verify_level_key()
2271 eb->start, check->transid, check->first_key.objectid, in btrfs_verify_level_key()
2272 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 | 841 btrfs_node_key_to_cpu(parent, &check.first_key, slot); in btrfs_read_node_slot()
1468 btrfs_node_key_to_cpu(*eb_ret, &check.first_key, slot); in read_block_for_search()
1489 * Do extra check for first_key, eb can be stale due to in read_block_for_search()
1861 struct btrfs_disk_key first_key; in search_leaf() local
1864 btrfs_item_key(leaf, &first_key, 0); in search_leaf()
1873 ret = btrfs_comp_keys(&first_key, key); in search_leaf()
|
| H A D | qgroup.c | 4749 btrfs_node_key_to_cpu(reloc_parent, &block->first_key, reloc_slot); in btrfs_qgroup_add_swapped_blocks()
4835 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 | extent-tree.c | 5592 btrfs_node_key_to_cpu(path->nodes[level], &check.first_key, path->slots[level]); in check_next_block_uptodate()
|
| H A D | tree-log.c | 2672 btrfs_node_key_to_cpu(cur, &check.first_key, path->slots[*level]); in walk_down_log_tree()
|
| /linux/include/linux/mfd/ ! |
| H A D | macsmc.h | 86 * @first_key: First valid SMC key
107 smc_key first_key; member
|
| /linux/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/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()
|