| /linux-6.1.9/fs/btrfs/ |
| D | disk-io.h | 34 struct btrfs_key *first_key, u64 parent_transid);
37 int level, struct btrfs_key *first_key);
121 int level, struct btrfs_key *first_key);
|
| D | print-tree.c | 387 struct btrfs_key first_key; in btrfs_print_tree() local
390 btrfs_node_key_to_cpu(c, &first_key, i); in btrfs_print_tree()
394 level - 1, &first_key); in btrfs_print_tree()
|
| D | qgroup.h | 143 struct btrfs_key first_key; member
|
| D | ctree.c | 854 struct btrfs_key first_key; in btrfs_read_node_slot() local
861 btrfs_node_key_to_cpu(parent, &first_key, slot); in btrfs_read_node_slot()
865 level - 1, &first_key); in btrfs_read_node_slot()
1427 struct btrfs_key first_key; in read_block_for_search() local
1436 btrfs_node_key_to_cpu(*eb_ret, &first_key, slot); in read_block_for_search()
1458 parent_level - 1, &first_key, gen)) { in read_block_for_search()
1475 ret = btrfs_read_extent_buffer(tmp, gen, parent_level - 1, &first_key); in read_block_for_search()
1506 gen, parent_level - 1, &first_key); in read_block_for_search()
1793 struct btrfs_disk_key first_key; in search_leaf() local
1796 btrfs_item_key(leaf, &first_key, 0); in search_leaf()
[all …]
|
| D | delayed-inode.c | 649 struct btrfs_key first_key; in btrfs_insert_delayed_item() local
712 first_key.objectid = node->inode_id; in btrfs_insert_delayed_item()
713 first_key.type = BTRFS_DIR_INDEX_KEY; in btrfs_insert_delayed_item()
714 first_key.offset = first_item->index; in btrfs_insert_delayed_item()
715 batch.keys = &first_key; in btrfs_insert_delayed_item()
|
| D | disk-io.c | 192 struct btrfs_key *first_key, u64 parent_transid) in btrfs_verify_level_key() argument
209 if (!first_key) in btrfs_verify_level_key()
234 ret = btrfs_comp_cpu_keys(first_key, &found_key); in btrfs_verify_level_key()
241 eb->start, parent_transid, first_key->objectid, in btrfs_verify_level_key()
242 first_key->type, first_key->offset, in btrfs_verify_level_key()
259 struct btrfs_key *first_key) in btrfs_read_extent_buffer() argument
278 first_key, parent_transid)) in btrfs_read_extent_buffer()
936 int level, struct btrfs_key *first_key) in read_tree_block() argument
945 ret = btrfs_read_extent_buffer(buf, parent_transid, level, first_key); in read_tree_block()
|
| D | tree-log.c | 2619 struct btrfs_key first_key; in walk_down_log_tree() local
2631 btrfs_node_key_to_cpu(cur, &first_key, path->slots[*level]); in walk_down_log_tree()
2651 *level - 1, &first_key); in walk_down_log_tree()
2679 ret = btrfs_read_extent_buffer(next, ptr_gen, *level - 1, &first_key); in walk_down_log_tree()
|
| D | extent-tree.c | 5262 struct btrfs_key first_key; in do_walk_down() local
5284 btrfs_node_key_to_cpu(path->nodes[level], &first_key, in do_walk_down()
5347 generation, level - 1, &first_key); in do_walk_down()
|
| D | qgroup.c | 4256 btrfs_node_key_to_cpu(reloc_parent, &block->first_key, reloc_slot); in btrfs_qgroup_add_swapped_blocks()
4365 &block->first_key); in btrfs_qgroup_trace_subtree_after_cow()
|
| /linux-6.1.9/tools/testing/selftests/bpf/ |
| D | test_maps.c | 39 long long key, next_key, first_key, value; in test_hashmap() local
106 assert(bpf_map_get_next_key(fd, NULL, &first_key) == 0 && in test_hashmap()
107 (first_key == 1 || first_key == 2)); in test_hashmap()
109 (next_key == first_key)); in test_hashmap()
112 (next_key != first_key)); in test_hashmap()
156 long long key, next_key, first_key; in test_hashmap_percpu() local
227 assert(bpf_map_get_next_key(fd, NULL, &first_key) == 0 && in test_hashmap_percpu()
228 ((expected_key_mask & first_key) == first_key)); in test_hashmap_percpu()
230 if (first_key) { in test_hashmap_percpu()
231 assert(next_key == first_key); in test_hashmap_percpu()
[all …]
|
| /linux-6.1.9/drivers/md/persistent-data/ |
| D | dm-btree-remove.c | 744 uint64_t *first_key, uint64_t end_key, in dm_btree_remove_leaves() argument
751 r = remove_one(info, root, first_key, end_key, &root, nr_removed); in dm_btree_remove_leaves()
|