Home
last modified time | relevance | path

Searched refs:first_key (Results 1 - 24 of 24) sorted by relevance

/kernel/linux/linux-6.6/fs/btrfs/
H A Dtree-checker.h36 struct btrfs_key first_key; member
70 struct btrfs_key *first_key, u64 parent_transid);
H A Dqgroup.h144 struct btrfs_key first_key; member
H A Dtree-checker.c1982 struct btrfs_key *first_key, u64 parent_transid) in btrfs_verify_level_key()
1999 if (!first_key) in btrfs_verify_level_key()
2011 /* We have @first_key, so this @eb must have at least one item */ 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()
1981 btrfs_verify_level_key(struct extent_buffer *eb, int level, struct btrfs_key *first_key, u64 parent_transid) btrfs_verify_level_key() argument
H A Ddelayed-inode.c658 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()
H A Dprint-tree.c396 btrfs_node_key_to_cpu(c, &check.first_key, i); in btrfs_print_tree()
H A Dctree.c1022 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()
1658 * Do extra check for first_key, eb can be stale due to 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()
H A Dqgroup.c4306 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()
H A Dextent-tree.c5268 btrfs_node_key_to_cpu(path->nodes[level], &check.first_key, in do_walk_down()
H A Ddisk-io.c404 struct btrfs_key *expect_key = &check->first_key; in btrfs_validate_extent_buffer()
H A Dtree-log.c2616 btrfs_node_key_to_cpu(cur, &check.first_key, path->slots[*level]); in walk_down_log_tree()
/kernel/linux/linux-5.10/fs/btrfs/
H A Ddisk-io.h44 struct btrfs_key *first_key, u64 parent_transid);
47 struct btrfs_key *first_key);
112 struct btrfs_key *first_key);
H A Dprint-tree.c396 struct btrfs_key first_key; in btrfs_print_tree() local
399 btrfs_node_key_to_cpu(c, &first_key, i); in btrfs_print_tree()
402 level - 1, &first_key); in btrfs_print_tree()
H A Dqgroup.c2038 struct btrfs_key first_key; in qgroup_trace_extent_swap() local
2048 btrfs_node_key_to_cpu(eb, &first_key, parent_slot); in qgroup_trace_extent_swap()
2051 cur_level, &first_key); in qgroup_trace_extent_swap()
2160 struct btrfs_key first_key; in qgroup_trace_new_subtree_blocks() local
2184 btrfs_node_key_to_cpu(eb, &first_key, parent_slot); in qgroup_trace_new_subtree_blocks()
2191 cur_level, &first_key); in qgroup_trace_new_subtree_blocks()
2350 struct btrfs_key first_key; in btrfs_qgroup_trace_subtree() local
2363 btrfs_node_key_to_cpu(eb, &first_key, parent_slot); in btrfs_qgroup_trace_subtree()
2366 level, &first_key); in btrfs_qgroup_trace_subtree()
4258 btrfs_node_key_to_cpu(reloc_parent, &block->first_key, reloc_slo in btrfs_qgroup_add_swapped_blocks()
[all...]
H A Dqgroup.h140 struct btrfs_key first_key; member
H A Drelocation.c1241 struct btrfs_key first_key; in replace_path() local
1258 btrfs_node_key_to_cpu(parent, &first_key, slot); in replace_path()
1284 level - 1, &first_key); in replace_path()
1450 struct btrfs_key first_key; in walk_down_reloc_tree() local
1472 btrfs_node_key_to_cpu(eb, &first_key, path->slots[i]); in walk_down_reloc_tree()
1474 &first_key); in walk_down_reloc_tree()
2244 struct btrfs_key first_key; in do_relocation() local
2318 btrfs_node_key_to_cpu(upper->eb, &first_key, slot); in do_relocation()
2320 upper->level - 1, &first_key); in do_relocation()
H A Dctree.c1635 struct btrfs_key first_key; in btrfs_realloc_node() local
1645 btrfs_node_key_to_cpu(parent, &first_key, i); in btrfs_realloc_node()
1671 &first_key); in btrfs_realloc_node()
1680 parent_level - 1,&first_key); in btrfs_realloc_node()
1820 struct btrfs_key first_key; in btrfs_read_node_slot() local
1827 btrfs_node_key_to_cpu(parent, &first_key, slot); in btrfs_read_node_slot()
1830 level - 1, &first_key); in btrfs_read_node_slot()
2400 struct btrfs_key first_key; in read_block_for_search() local
2407 btrfs_node_key_to_cpu(*eb_ret, &first_key, slot); in read_block_for_search()
2414 * Do extra check for first_key, e in read_block_for_search()
[all...]
H A Ddisk-io.c329 struct btrfs_key *first_key, u64 parent_transid) in btrfs_verify_level_key()
346 if (!first_key) in btrfs_verify_level_key()
358 /* We have @first_key, so this @eb must have at least one item */ in btrfs_verify_level_key()
371 ret = btrfs_comp_cpu_keys(first_key, &found_key); in btrfs_verify_level_key()
378 eb->start, parent_transid, first_key->objectid, in btrfs_verify_level_key()
379 first_key->type, first_key->offset, in btrfs_verify_level_key()
392 * @first_key: expected key of first slot, skip check if NULL
396 struct btrfs_key *first_key) in btree_read_extent_buffer_pages()
415 first_key, parent_transi in btree_read_extent_buffer_pages()
328 btrfs_verify_level_key(struct extent_buffer *eb, int level, struct btrfs_key *first_key, u64 parent_transid) btrfs_verify_level_key() argument
394 btree_read_extent_buffer_pages(struct extent_buffer *eb, u64 parent_transid, int level, struct btrfs_key *first_key) btree_read_extent_buffer_pages() argument
983 read_tree_block(struct btrfs_fs_info *fs_info, u64 bytenr, u64 parent_transid, int level, struct btrfs_key *first_key) read_tree_block() argument
4344 btrfs_read_buffer(struct extent_buffer *buf, u64 parent_transid, int level, struct btrfs_key *first_key) btrfs_read_buffer() argument
[all...]
H A Dref-verify.c561 struct btrfs_key first_key; in walk_down_tree() local
567 btrfs_node_key_to_cpu(path->nodes[level], &first_key, in walk_down_tree()
570 level - 1, &first_key); in walk_down_tree()
H A Dtree-log.c2744 struct btrfs_key first_key; in walk_down_log_tree() local
2756 btrfs_node_key_to_cpu(cur, &first_key, path->slots[*level]); in walk_down_log_tree()
2774 *level - 1, &first_key); in walk_down_log_tree()
2801 ret = btrfs_read_buffer(next, ptr_gen, *level - 1, &first_key); in walk_down_log_tree()
H A Dextent-tree.c4964 struct btrfs_key first_key; in do_walk_down() local
4986 btrfs_node_key_to_cpu(path->nodes[level], &first_key, in do_walk_down()
5052 &first_key); in do_walk_down()
/kernel/linux/linux-5.10/tools/testing/selftests/bpf/
H A Dtest_maps.c39 long long key, next_key, first_key, value; in test_hashmap() local
100 assert(bpf_map_get_next_key(fd, NULL, &first_key) == 0 && in test_hashmap()
101 (first_key == 1 || first_key == 2)); in test_hashmap()
103 (next_key == first_key)); in test_hashmap()
106 (next_key != first_key)); in test_hashmap()
151 long long key, next_key, first_key; in test_hashmap_percpu() local
212 assert(bpf_map_get_next_key(fd, NULL, &first_key) == 0 && in test_hashmap_percpu()
213 ((expected_key_mask & first_key) == first_key)); in test_hashmap_percpu()
[all...]
/kernel/linux/linux-6.6/tools/testing/selftests/bpf/
H A Dtest_maps.c39 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()
[all...]
/kernel/linux/linux-5.10/drivers/md/persistent-data/
H A Ddm-btree-remove.c673 uint64_t *first_key, uint64_t end_key, in dm_btree_remove_leaves()
680 r = remove_one(info, root, first_key, end_key, &root, nr_removed); in dm_btree_remove_leaves()
672 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 *nr_removed) dm_btree_remove_leaves() argument
/kernel/linux/linux-6.6/drivers/md/persistent-data/
H A Ddm-btree-remove.c750 uint64_t *first_key, uint64_t end_key, in dm_btree_remove_leaves()
757 r = remove_one(info, root, first_key, end_key, &root, nr_removed); in dm_btree_remove_leaves()
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) dm_btree_remove_leaves() argument

Completed in 70 milliseconds