Lines Matching defs:key
65 struct btrfs_key *key);
77 struct btrfs_key key;
84 key.objectid = start;
85 key.offset = len;
86 key.type = BTRFS_EXTENT_ITEM_KEY;
87 ret = btrfs_search_slot(NULL, root, &key, path, 0, 0);
111 struct btrfs_key key;
136 key.objectid = bytenr;
137 key.offset = offset;
139 key.type = BTRFS_METADATA_ITEM_KEY;
141 key.type = BTRFS_EXTENT_ITEM_KEY;
144 ret = btrfs_search_slot(NULL, extent_root, &key, path, 0, 0);
148 if (ret > 0 && metadata && key.type == BTRFS_METADATA_ITEM_KEY) {
151 btrfs_item_key_to_cpu(path->nodes[0], &key,
153 if (key.objectid == bytenr &&
154 key.type == BTRFS_EXTENT_ITEM_KEY &&
155 key.offset == fs_info->nodesize)
249 * and the pointer's key. These information allow us to find the block by
286 * The key objectid corresponds to the first byte in the extent,
287 * The key type is used to differentiate between types of back refs.
288 * There are different meanings of the key offset for different types
304 * The key offset for the implicit back refs is hash of the first
311 * The key offset for the implicit back refs is the first byte of
329 * only consist of key. The key offset for the implicit back refs is
330 * objectid of block's owner tree. The key offset for the full back refs
333 * When implicit back refs is used, information about the lowest key and
437 struct btrfs_key key;
445 key.objectid = bytenr;
447 key.type = BTRFS_SHARED_DATA_REF_KEY;
448 key.offset = parent;
450 key.type = BTRFS_EXTENT_DATA_REF_KEY;
451 key.offset = hash_extent_data_ref(root_objectid,
456 ret = btrfs_search_slot(trans, root, &key, path, -1, 1);
483 btrfs_item_key_to_cpu(leaf, &key, path->slots[0]);
484 if (key.objectid != bytenr ||
485 key.type != BTRFS_EXTENT_DATA_REF_KEY)
513 struct btrfs_key key;
519 key.objectid = bytenr;
521 key.type = BTRFS_SHARED_DATA_REF_KEY;
522 key.offset = parent;
525 key.type = BTRFS_EXTENT_DATA_REF_KEY;
526 key.offset = hash_extent_data_ref(root_objectid,
531 ret = btrfs_insert_empty_item(trans, root, path, &key, size);
556 key.offset++;
557 ret = btrfs_insert_empty_item(trans, root, path, &key,
590 struct btrfs_key key;
598 btrfs_item_key_to_cpu(leaf, &key, path->slots[0]);
600 if (key.type == BTRFS_EXTENT_DATA_REF_KEY) {
604 } else if (key.type == BTRFS_SHARED_DATA_REF_KEY) {
610 "unrecognized backref key (%llu %u %llu)",
611 key.objectid, key.type, key.offset);
622 if (key.type == BTRFS_EXTENT_DATA_REF_KEY)
624 else if (key.type == BTRFS_SHARED_DATA_REF_KEY)
634 struct btrfs_key key;
642 btrfs_item_key_to_cpu(leaf, &key, path->slots[0]);
658 } else if (key.type == BTRFS_EXTENT_DATA_REF_KEY) {
662 } else if (key.type == BTRFS_SHARED_DATA_REF_KEY) {
678 struct btrfs_key key;
681 key.objectid = bytenr;
683 key.type = BTRFS_SHARED_BLOCK_REF_KEY;
684 key.offset = parent;
686 key.type = BTRFS_TREE_BLOCK_REF_KEY;
687 key.offset = root_objectid;
690 ret = btrfs_search_slot(trans, root, &key, path, -1, 1);
702 struct btrfs_key key;
705 key.objectid = bytenr;
707 key.type = BTRFS_SHARED_BLOCK_REF_KEY;
708 key.offset = parent;
710 key.type = BTRFS_TREE_BLOCK_REF_KEY;
711 key.offset = root_objectid;
714 ret = btrfs_insert_empty_item(trans, root, path, &key, 0);
737 struct btrfs_key *key)
747 btrfs_item_key_to_cpu(path->nodes[level], key,
750 btrfs_node_key_to_cpu(path->nodes[level], key,
780 struct btrfs_key key;
796 key.objectid = bytenr;
797 key.type = BTRFS_EXTENT_ITEM_KEY;
798 key.offset = num_bytes;
813 key.type = BTRFS_METADATA_ITEM_KEY;
814 key.offset = owner;
818 ret = btrfs_search_slot(trans, root, &key, path, extra_size, 1);
832 btrfs_item_key_to_cpu(path->nodes[0], &key,
834 if (key.objectid == bytenr &&
835 key.type == BTRFS_EXTENT_ITEM_KEY &&
836 key.offset == num_bytes)
840 key.objectid = bytenr;
841 key.type = BTRFS_EXTENT_ITEM_KEY;
842 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) {
1091 struct btrfs_key key;
1094 btrfs_item_key_to_cpu(leaf, &key, path->slots[0]);
1095 if (key.type == BTRFS_METADATA_ITEM_KEY)
1098 extent_size = key.offset;
1102 key.objectid, extent_size, refs_to_mod, refs);
1135 struct btrfs_key key;
1137 btrfs_item_key_to_cpu(leaf, &key, path->slots[0]);
1142 key.objectid, refs_to_mod);
1148 struct btrfs_key key;
1151 btrfs_item_key_to_cpu(leaf, &key, path->slots[0]);
1152 if (key.type == BTRFS_METADATA_ITEM_KEY)
1155 extent_size = key.offset;
1159 (unsigned long)iref, key.objectid, extent_size,
1488 struct btrfs_key key;
1511 btrfs_item_key_to_cpu(leaf, &key, path->slots[0]);
1596 btrfs_set_tree_block_key(leaf, bi, &extent_op->key);
1606 struct btrfs_key key;
1625 key.objectid = head->bytenr;
1628 key.type = BTRFS_METADATA_ITEM_KEY;
1629 key.offset = extent_op->level;
1631 key.type = BTRFS_EXTENT_ITEM_KEY;
1632 key.offset = head->num_bytes;
1635 root = btrfs_extent_root(fs_info, key.objectid);
1637 ret = btrfs_search_slot(trans, root, &key, path, 0, 1);
1646 btrfs_item_key_to_cpu(path->nodes[0], &key,
1648 if (key.objectid == head->bytenr &&
1649 key.type == BTRFS_EXTENT_ITEM_KEY &&
1650 key.offset == head->num_bytes)
1657 key.objectid = head->bytenr;
1658 key.offset = head->num_bytes;
1659 key.type = BTRFS_EXTENT_ITEM_KEY;
2317 struct btrfs_key key;
2322 key.objectid = bytenr;
2323 key.offset = (u64)-1;
2324 key.type = BTRFS_EXTENT_ITEM_KEY;
2326 ret = btrfs_search_slot(NULL, extent_root, &key, path, 0, 0);
2337 btrfs_item_key_to_cpu(leaf, &key, path->slots[0]);
2339 if (key.objectid != bytenr || key.type != BTRFS_EXTENT_ITEM_KEY)
2413 struct btrfs_key key;
2443 btrfs_item_key_to_cpu(buf, &key, i);
2444 if (key.type != BTRFS_EXTENT_DATA_KEY)
2456 key.offset -= btrfs_file_extent_offset(buf, fi);
2459 btrfs_init_data_ref(&generic_ref, ref_root, key.objectid,
2460 key.offset, root->root_key.objectid,
2627 struct btrfs_key key;
2636 btrfs_item_key_to_cpu(eb, &key, i);
2637 if (key.type != BTRFS_EXTENT_DATA_KEY)
2645 key.objectid = btrfs_file_extent_disk_bytenr(eb, item);
2646 key.offset = btrfs_file_extent_disk_num_bytes(eb, item);
2647 ret = __exclude_logged_extent(fs_info, key.objectid, key.offset);
2901 * item 0 key (13631488 EXTENT_ITEM 1048576) itemoff 16201 itemsize 82
2917 * item 0 key (13631488 EXTENT_ITEM 1048576) itemoff 16201 itemsize 82
2925 * item 0 key (13631488 EXTENT_ITEM 1048576) itemoff 3971 itemsize 24
2928 * item 2 key (13631488 EXTENT_DATA_REF <HASH>) itemoff 3915 itemsize 28
2942 * item 0 key (13631488 EXTENT_ITEM 1048576) itemoff 3971 itemsize 24
2954 struct btrfs_key key;
3005 btrfs_item_key_to_cpu(path->nodes[0], &key,
3007 if (key.objectid != bytenr)
3009 if (key.type == BTRFS_EXTENT_ITEM_KEY &&
3010 key.offset == num_bytes) {
3014 if (key.type == BTRFS_METADATA_ITEM_KEY &&
3015 key.offset == owner_objectid) {
3044 key.objectid = bytenr;
3045 key.type = BTRFS_EXTENT_ITEM_KEY;
3046 key.offset = num_bytes;
3049 key.type = BTRFS_METADATA_ITEM_KEY;
3050 key.offset = owner_objectid;
3054 &key, path, -1, 1);
3061 btrfs_item_key_to_cpu(path->nodes[0], &key,
3063 if (key.objectid == bytenr &&
3064 key.type == BTRFS_EXTENT_ITEM_KEY &&
3065 key.offset == num_bytes)
3071 key.objectid = bytenr;
3072 key.type = BTRFS_EXTENT_ITEM_KEY;
3073 key.offset = num_bytes;
3076 &key, path, -1, 1);
3116 key.type == BTRFS_EXTENT_ITEM_KEY) {
3121 "invalid extent item size for key (%llu, %u, %llu) slot %u owner %llu, has %u expect >= %zu",
3122 key.objectid, key.type, key.offset,
3184 "invalid iref, extent item key (%llu %u %llu) slot %u doesn't have wanted iref",
3185 key.objectid, key.type,
3186 key.offset, path->slots[0]);
4196 * The key ins is changed to record the hole:
4500 * @ins - This key is modified to record the found hole. It will
4751 btrfs_set_tree_block_key(leaf, block_info, &extent_op->key);
4930 const struct btrfs_disk_key *key,
4985 if (key)
4986 memcpy(&extent_op->key, key, sizeof(extent_op->key));
4988 memset(&extent_op->key, 0, sizeof(extent_op->key));
5047 struct btrfs_key key;
5099 btrfs_node_key_to_cpu(eb, &key, slot);
5100 ret = btrfs_comp_cpu_keys(&key,
5193 * would have a drop_progress key that hadn't been updated properly.
5241 struct btrfs_key key;
5305 btrfs_node_key_to_cpu(path->nodes[level], &key,
5307 ret = btrfs_comp_cpu_keys(&key, &wc->update_progress);
5407 * We need to update the next key in our walk control so we can
5408 * update the drop_progress key accordingly. We don't care if
5409 * find_next_key doesn't find a key because that means we're at
5641 struct btrfs_key key;
5699 btrfs_disk_key_to_cpu(&key, &root_item->drop_progress);
5700 memcpy(&wc->update_progress, &key,
5706 ret = btrfs_search_slot(NULL, root, &key, path, 0, 0);