| /linux-master/drivers/md/dm-vdo/indexer/ |
| H A D | radix-sort.c | 47 sort_key_t *first_key; member in struct:task
78 while ((--next >= task.first_key) &&
94 for (next = task.first_key + 1; next <= task.last_key; next++)
99 static inline void push_task(struct task **stack_pointer, sort_key_t *first_key, argument
104 task->first_key = first_key;
105 task->last_key = &first_key[count - 1];
134 for (key_ptr = task.first_key; key_ptr <= task.last_key; key_ptr++) {
154 * pile[0] = first_key + bin->size[0],
166 * @first_key
172 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) argument
[all...] |
| /linux-master/fs/btrfs/ |
| H A D | tree-checker.h | 38 struct btrfs_key first_key; member in struct:btrfs_tree_parent_check
72 struct btrfs_key *first_key, u64 parent_transid);
|
| H A D | qgroup.h | 161 struct btrfs_key first_key; member in struct:btrfs_qgroup_swapped_block
|
| H A D | tree-checker.c | 2071 struct btrfs_key *first_key, u64 parent_transid)
2088 if (!first_key)
2100 /* We have @first_key, so this @eb must have at least one item */
2113 ret = btrfs_comp_cpu_keys(first_key, &found_key);
2120 eb->start, parent_transid, first_key->objectid,
2121 first_key->type, first_key->offset,
2070 btrfs_verify_level_key(struct extent_buffer *eb, int level, struct btrfs_key *first_key, u64 parent_transid) argument
|
| H A D | delayed-inode.c | 668 struct btrfs_key first_key; local
731 first_key.objectid = node->inode_id;
732 first_key.type = BTRFS_DIR_INDEX_KEY;
733 first_key.offset = first_item->index;
734 batch.keys = &first_key;
|
| H A D | print-tree.c | 431 btrfs_node_key_to_cpu(c, &check.first_key, i);
|
| H A D | ctree.c | 895 btrfs_node_key_to_cpu(parent, &check.first_key, slot);
1510 btrfs_node_key_to_cpu(*eb_ret, &check.first_key, slot);
1531 * Do extra check for first_key, eb can be stale due to
1536 parent_level - 1, &check.first_key, gen)) {
1870 struct btrfs_disk_key first_key; local
1873 btrfs_item_key(leaf, &first_key, 0);
1882 ret = btrfs_comp_keys(&first_key, key);
|
| H A D | qgroup.c | 4641 btrfs_node_key_to_cpu(reloc_parent, &block->first_key, reloc_slot);
4751 memcpy(&check.first_key, &block->first_key, sizeof(check.first_key));
|
| H A D | disk-io.c | 428 struct btrfs_key *expect_key = &check->first_key;
|
| H A D | tree-log.c | 2611 btrfs_node_key_to_cpu(cur, &check.first_key, path->slots[*level]);
|
| H A D | extent-tree.c | 5493 btrfs_node_key_to_cpu(path->nodes[level], &check.first_key,
|
| /linux-master/tools/testing/selftests/bpf/ |
| H A D | test_maps.c | 39 long long key, next_key, first_key, value; local
106 assert(bpf_map_get_next_key(fd, NULL, &first_key) == 0 &&
107 (first_key == 1 || first_key == 2));
109 (next_key == first_key));
112 (next_key != first_key));
156 long long key, next_key, first_key; local
227 assert(bpf_map_get_next_key(fd, NULL, &first_key) == 0 &&
228 ((expected_key_mask & first_key) == first_key));
[all...] |
| /linux-master/drivers/md/persistent-data/ |
| H A D | dm-btree-remove.c | 750 uint64_t *first_key, uint64_t end_key,
757 r = remove_one(info, root, first_key, end_key, &root, nr_removed);
749 dm_btree_remove_leaves(struct dm_btree_info *info, dm_block_t root, uint64_t *first_key, uint64_t end_key, dm_block_t *new_root, unsigned int *nr_removed) argument
|
| /linux-master/net/ipv4/ |
| H A D | tcp_ao.c | 1165 struct tcp_ao_key *key, *new_key, *first_key;
1231 first_key = hlist_entry_safe(key_head, struct tcp_ao_key, node);
1237 new_ao->current_key = first_key;
1244 new_ao->rnext_key = first_key;
1164 struct tcp_ao_key *key, *new_key, *first_key; local
|