Lines Matching defs:key
57 struct btrfs_key *key);
89 struct btrfs_key key;
96 key.objectid = start;
97 key.offset = len;
98 key.type = BTRFS_EXTENT_ITEM_KEY;
99 ret = btrfs_search_slot(NULL, fs_info->extent_root, &key, path, 0, 0);
122 struct btrfs_key key;
147 key.objectid = bytenr;
148 key.offset = offset;
150 key.type = BTRFS_METADATA_ITEM_KEY;
152 key.type = BTRFS_EXTENT_ITEM_KEY;
154 ret = btrfs_search_slot(trans, fs_info->extent_root, &key, path, 0, 0);
158 if (ret > 0 && metadata && key.type == BTRFS_METADATA_ITEM_KEY) {
161 btrfs_item_key_to_cpu(path->nodes[0], &key,
163 if (key.objectid == bytenr &&
164 key.type == BTRFS_EXTENT_ITEM_KEY &&
165 key.offset == fs_info->nodesize)
257 * and the pointer's key. These information allow us to find the block by
294 * The key objectid corresponds to the first byte in the extent,
295 * The key type is used to differentiate between types of back refs.
296 * There are different meanings of the key offset for different types
312 * The key offset for the implicit back refs is hash of the first
319 * The key offset for the implicit back refs is the first byte of
337 * only consist of key. The key offset for the implicit back refs is
338 * objectid of block's owner tree. The key offset for the full back refs
341 * When implicit back refs is used, information about the lowest key and
445 struct btrfs_key key;
453 key.objectid = bytenr;
455 key.type = BTRFS_SHARED_DATA_REF_KEY;
456 key.offset = parent;
458 key.type = BTRFS_EXTENT_DATA_REF_KEY;
459 key.offset = hash_extent_data_ref(root_objectid,
464 ret = btrfs_search_slot(trans, root, &key, path, -1, 1);
491 btrfs_item_key_to_cpu(leaf, &key, path->slots[0]);
492 if (key.objectid != bytenr ||
493 key.type != BTRFS_EXTENT_DATA_REF_KEY)
521 struct btrfs_key key;
527 key.objectid = bytenr;
529 key.type = BTRFS_SHARED_DATA_REF_KEY;
530 key.offset = parent;
533 key.type = BTRFS_EXTENT_DATA_REF_KEY;
534 key.offset = hash_extent_data_ref(root_objectid,
539 ret = btrfs_insert_empty_item(trans, root, path, &key, size);
564 key.offset++;
565 ret = btrfs_insert_empty_item(trans, root, path, &key,
597 struct btrfs_key key;
605 btrfs_item_key_to_cpu(leaf, &key, path->slots[0]);
607 if (key.type == BTRFS_EXTENT_DATA_REF_KEY) {
611 } else if (key.type == BTRFS_SHARED_DATA_REF_KEY) {
615 } else if (unlikely(key.type == BTRFS_EXTENT_REF_V0_KEY)) {
630 if (key.type == BTRFS_EXTENT_DATA_REF_KEY)
632 else if (key.type == BTRFS_SHARED_DATA_REF_KEY)
642 struct btrfs_key key;
650 btrfs_item_key_to_cpu(leaf, &key, path->slots[0]);
652 BUG_ON(key.type == BTRFS_EXTENT_REF_V0_KEY);
667 } else if (key.type == BTRFS_EXTENT_DATA_REF_KEY) {
671 } else if (key.type == BTRFS_SHARED_DATA_REF_KEY) {
687 struct btrfs_key key;
690 key.objectid = bytenr;
692 key.type = BTRFS_SHARED_BLOCK_REF_KEY;
693 key.offset = parent;
695 key.type = BTRFS_TREE_BLOCK_REF_KEY;
696 key.offset = root_objectid;
699 ret = btrfs_search_slot(trans, root, &key, path, -1, 1);
710 struct btrfs_key key;
713 key.objectid = bytenr;
715 key.type = BTRFS_SHARED_BLOCK_REF_KEY;
716 key.offset = parent;
718 key.type = BTRFS_TREE_BLOCK_REF_KEY;
719 key.offset = root_objectid;
723 path, &key, 0);
746 struct btrfs_key *key)
756 btrfs_item_key_to_cpu(path->nodes[level], key,
759 btrfs_node_key_to_cpu(path->nodes[level], key,
789 struct btrfs_key key;
805 key.objectid = bytenr;
806 key.type = BTRFS_EXTENT_ITEM_KEY;
807 key.offset = num_bytes;
821 key.type = BTRFS_METADATA_ITEM_KEY;
822 key.offset = owner;
826 ret = btrfs_search_slot(trans, root, &key, path, extra_size, 1);
840 btrfs_item_key_to_cpu(path->nodes[0], &key,
842 if (key.objectid == bytenr &&
843 key.type == BTRFS_EXTENT_ITEM_KEY &&
844 key.offset == num_bytes)
848 key.objectid = bytenr;
849 key.type = BTRFS_EXTENT_ITEM_KEY;
850 key.offset = num_bytes;
958 if (find_next_key(path, 0, &key) == 0 &&
959 key.objectid == bytenr &&
960 key.type < BTRFS_BLOCK_GROUP_ITEM_KEY) {
1427 struct btrfs_key key;
1451 btrfs_item_key_to_cpu(leaf, &key, path->slots[0]);
1538 btrfs_set_tree_block_key(leaf, bi, &extent_op->key);
1547 struct btrfs_key key;
1566 key.objectid = head->bytenr;
1569 key.type = BTRFS_METADATA_ITEM_KEY;
1570 key.offset = extent_op->level;
1572 key.type = BTRFS_EXTENT_ITEM_KEY;
1573 key.offset = head->num_bytes;
1578 ret = btrfs_search_slot(trans, fs_info->extent_root, &key, path, 0, 1);
1587 btrfs_item_key_to_cpu(path->nodes[0], &key,
1589 if (key.objectid == head->bytenr &&
1590 key.type == BTRFS_EXTENT_ITEM_KEY &&
1591 key.offset == head->num_bytes)
1598 key.objectid = head->bytenr;
1599 key.offset = head->num_bytes;
1600 key.type = BTRFS_EXTENT_ITEM_KEY;
2301 struct btrfs_key key;
2306 key.objectid = bytenr;
2307 key.offset = (u64)-1;
2308 key.type = BTRFS_EXTENT_ITEM_KEY;
2310 ret = btrfs_search_slot(NULL, extent_root, &key, path, 0, 0);
2321 btrfs_item_key_to_cpu(leaf, &key, path->slots[0]);
2323 if (key.objectid != bytenr || key.type != BTRFS_EXTENT_ITEM_KEY)
2402 struct btrfs_key key;
2432 btrfs_item_key_to_cpu(buf, &key, i);
2433 if (key.type != BTRFS_EXTENT_DATA_KEY)
2445 key.offset -= btrfs_file_extent_offset(buf, fi);
2449 btrfs_init_data_ref(&generic_ref, ref_root, key.objectid,
2450 key.offset);
2664 struct btrfs_key key;
2673 btrfs_item_key_to_cpu(eb, &key, i);
2674 if (key.type != BTRFS_EXTENT_DATA_KEY)
2682 key.objectid = btrfs_file_extent_disk_bytenr(eb, item);
2683 key.offset = btrfs_file_extent_disk_num_bytes(eb, item);
2684 ret = __exclude_logged_extent(fs_info, key.objectid, key.offset);
2907 * item 0 key (13631488 EXTENT_ITEM 1048576) itemoff 16201 itemsize 82
2923 * item 0 key (13631488 EXTENT_ITEM 1048576) itemoff 16201 itemsize 82
2931 * item 0 key (13631488 EXTENT_ITEM 1048576) itemoff 3971 itemsize 24
2934 * item 2 key (13631488 EXTENT_DATA_REF <HASH>) itemoff 3915 itemsize 28
2948 * item 0 key (13631488 EXTENT_ITEM 1048576) itemoff 3971 itemsize 24
2960 struct btrfs_key key;
3011 btrfs_item_key_to_cpu(path->nodes[0], &key,
3013 if (key.objectid != bytenr)
3015 if (key.type == BTRFS_EXTENT_ITEM_KEY &&
3016 key.offset == num_bytes) {
3020 if (key.type == BTRFS_METADATA_ITEM_KEY &&
3021 key.offset == owner_objectid) {
3051 key.objectid = bytenr;
3052 key.type = BTRFS_EXTENT_ITEM_KEY;
3053 key.offset = num_bytes;
3056 key.type = BTRFS_METADATA_ITEM_KEY;
3057 key.offset = owner_objectid;
3061 &key, path, -1, 1);
3068 btrfs_item_key_to_cpu(path->nodes[0], &key,
3070 if (key.objectid == bytenr &&
3071 key.type == BTRFS_EXTENT_ITEM_KEY &&
3072 key.offset == num_bytes)
3078 key.objectid = bytenr;
3079 key.type = BTRFS_EXTENT_ITEM_KEY;
3080 key.offset = num_bytes;
3083 &key, path, -1, 1);
3123 key.type == BTRFS_EXTENT_ITEM_KEY) {
3127 "invalid extent item size for key (%llu, %u, %llu) owner %llu, has %u expect >= %zu",
3128 key.objectid, key.type, key.offset,
3190 "invalid iref, extent item key (%llu %u %llu) doesn't have wanted iref",
3191 key.objectid, key.type,
3192 key.offset);
3972 * The key ins is changed to record the hole:
4253 * @ins - This key is modified to record the found hole. It will
4482 btrfs_set_tree_block_key(leaf, block_info, &extent_op->key);
4651 const struct btrfs_disk_key *key,
4706 if (key)
4707 memcpy(&extent_op->key, key, sizeof(extent_op->key));
4709 memset(&extent_op->key, 0, sizeof(extent_op->key));
4769 struct btrfs_key key;
4821 btrfs_node_key_to_cpu(eb, &key, slot);
4822 ret = btrfs_comp_cpu_keys(&key,
4916 * would have a drop_progress key that hadn't been updated properly.
4963 struct btrfs_key key;
5026 btrfs_node_key_to_cpu(path->nodes[level], &key,
5028 ret = btrfs_comp_cpu_keys(&key, &wc->update_progress);
5130 * We need to update the next key in our walk control so we can
5131 * update the drop_progress key accordingly. We don't care if
5132 * find_next_key doesn't find a key because that means we're at
5363 struct btrfs_key key;
5419 btrfs_disk_key_to_cpu(&key, &root_item->drop_progress);
5420 memcpy(&wc->update_progress, &key,
5426 ret = btrfs_search_slot(NULL, root, &key, path, 0, 0);