Searched refs:first_key (Results 1 – 12 of 12) sorted by relevance
/linux-6.6.21/fs/btrfs/ |
D | tree-checker.h | 36 struct btrfs_key first_key; member 70 struct btrfs_key *first_key, u64 parent_transid);
|
D | tree-checker.c | 1982 struct btrfs_key *first_key, u64 parent_transid) in btrfs_verify_level_key() argument 1999 if (!first_key) in btrfs_verify_level_key() 2024 ret = btrfs_comp_cpu_keys(first_key, &found_key); in btrfs_verify_level_key() 2031 eb->start, parent_transid, first_key->objectid, in btrfs_verify_level_key() 2032 first_key->type, first_key->offset, in btrfs_verify_level_key()
|
D | qgroup.h | 144 struct btrfs_key first_key; member
|
D | delayed-inode.c | 658 struct btrfs_key first_key; in btrfs_insert_delayed_item() local 721 first_key.objectid = node->inode_id; in btrfs_insert_delayed_item() 722 first_key.type = BTRFS_DIR_INDEX_KEY; in btrfs_insert_delayed_item() 723 first_key.offset = first_item->index; in btrfs_insert_delayed_item() 724 batch.keys = &first_key; in btrfs_insert_delayed_item()
|
D | print-tree.c | 396 btrfs_node_key_to_cpu(c, &check.first_key, i); in btrfs_print_tree()
|
D | ctree.c | 1022 btrfs_node_key_to_cpu(parent, &check.first_key, slot); in btrfs_read_node_slot() 1637 btrfs_node_key_to_cpu(*eb_ret, &check.first_key, slot); in read_block_for_search() 1663 parent_level - 1, &check.first_key, gen)) { in read_block_for_search() 1997 struct btrfs_disk_key first_key; in search_leaf() local 2000 btrfs_item_key(leaf, &first_key, 0); in search_leaf() 2009 ret = comp_keys(&first_key, key); in search_leaf()
|
D | qgroup.c | 4306 btrfs_node_key_to_cpu(reloc_parent, &block->first_key, reloc_slot); in btrfs_qgroup_add_swapped_blocks() 4416 memcpy(&check.first_key, &block->first_key, sizeof(check.first_key)); in btrfs_qgroup_trace_subtree_after_cow()
|
D | disk-io.c | 404 struct btrfs_key *expect_key = &check->first_key; in btrfs_validate_extent_buffer()
|
D | extent-tree.c | 5268 btrfs_node_key_to_cpu(path->nodes[level], &check.first_key, in do_walk_down()
|
D | tree-log.c | 2616 btrfs_node_key_to_cpu(cur, &check.first_key, path->slots[*level]); in walk_down_log_tree()
|
/linux-6.6.21/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.6.21/drivers/md/persistent-data/ |
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()
|