Linux kernel mirror (for testing) git.kernel.org/pub/scm/linux/kernel/git/torvalds/linux.git
kernel os linux

btrfs: use the key format macros when printing keys

Change all locations that print a key to use the new macros to print
them in order to ensure a consistent style and avoid repetitive code.

Reviewed-by: Qu Wenruo <wqu@suse.com>
Signed-off-by: Filipe Manana <fdmanana@suse.com>
Reviewed-by: David Sterba <dsterba@suse.com>
Signed-off-by: David Sterba <dsterba@suse.com>

authored by

Filipe Manana and committed by
David Sterba
af1e800c 95de4b09

+64 -79
+5 -6
fs/btrfs/backref.c
··· 666 666 ret = btrfs_search_old_slot(root, &search_key, path, ctx->time_seq); 667 667 668 668 btrfs_debug(ctx->fs_info, 669 - "search slot in root %llu (level %d, ref count %d) returned %d for key (%llu %u %llu)", 670 - ref->root_id, level, ref->count, ret, 671 - ref->key_for_search.objectid, ref->key_for_search.type, 672 - ref->key_for_search.offset); 669 + "search slot in root %llu (level %d, ref count %d) returned %d for key " BTRFS_KEY_FMT, 670 + ref->root_id, level, ref->count, ret, 671 + BTRFS_KEY_FMT_VALUE(&ref->key_for_search)); 673 672 if (ret < 0) 674 673 goto out; 675 674 ··· 3322 3323 eb = path->nodes[level]; 3323 3324 if (btrfs_node_blockptr(eb, path->slots[level]) != cur->bytenr) { 3324 3325 btrfs_err(fs_info, 3325 - "couldn't find block (%llu) (level %d) in tree (%llu) with key (%llu %u %llu)", 3326 + "couldn't find block (%llu) (level %d) in tree (%llu) with key " BTRFS_KEY_FMT, 3326 3327 cur->bytenr, level - 1, btrfs_root_id(root), 3327 - tree_key->objectid, tree_key->type, tree_key->offset); 3328 + BTRFS_KEY_FMT_VALUE(tree_key)); 3328 3329 btrfs_put_root(root); 3329 3330 ret = -ENOENT; 3330 3331 goto out;
+7 -10
fs/btrfs/ctree.c
··· 2599 2599 if (unlikely(btrfs_comp_keys(&disk_key, new_key) >= 0)) { 2600 2600 btrfs_print_leaf(eb); 2601 2601 btrfs_crit(fs_info, 2602 - "slot %u key (%llu %u %llu) new key (%llu %u %llu)", 2602 + "slot %u key " BTRFS_KEY_FMT " new key " BTRFS_KEY_FMT, 2603 2603 slot, btrfs_disk_key_objectid(&disk_key), 2604 2604 btrfs_disk_key_type(&disk_key), 2605 2605 btrfs_disk_key_offset(&disk_key), 2606 - new_key->objectid, new_key->type, 2607 - new_key->offset); 2606 + BTRFS_KEY_FMT_VALUE(new_key)); 2608 2607 BUG(); 2609 2608 } 2610 2609 } ··· 2612 2613 if (unlikely(btrfs_comp_keys(&disk_key, new_key) <= 0)) { 2613 2614 btrfs_print_leaf(eb); 2614 2615 btrfs_crit(fs_info, 2615 - "slot %u key (%llu %u %llu) new key (%llu %u %llu)", 2616 + "slot %u key " BTRFS_KEY_FMT " new key " BTRFS_KEY_FMT, 2616 2617 slot, btrfs_disk_key_objectid(&disk_key), 2617 2618 btrfs_disk_key_type(&disk_key), 2618 2619 btrfs_disk_key_offset(&disk_key), 2619 - new_key->objectid, new_key->type, 2620 - new_key->offset); 2620 + BTRFS_KEY_FMT_VALUE(new_key)); 2621 2621 BUG(); 2622 2622 } 2623 2623 } ··· 2675 2677 btrfs_crit(left->fs_info, "right extent buffer:"); 2676 2678 btrfs_print_tree(right, false); 2677 2679 btrfs_crit(left->fs_info, 2678 - "bad key order, sibling blocks, left last (%llu %u %llu) right first (%llu %u %llu)", 2679 - left_last.objectid, left_last.type, 2680 - left_last.offset, right_first.objectid, 2681 - right_first.type, right_first.offset); 2680 + "bad key order, sibling blocks, left last " BTRFS_KEY_FMT " right first " BTRFS_KEY_FMT, 2681 + BTRFS_KEY_FMT_VALUE(&left_last), 2682 + BTRFS_KEY_FMT_VALUE(&right_first)); 2682 2683 return true; 2683 2684 } 2684 2685 return false;
+7 -7
fs/btrfs/extent-tree.c
··· 164 164 if (unlikely(num_refs == 0)) { 165 165 ret = -EUCLEAN; 166 166 btrfs_err(fs_info, 167 - "unexpected zero reference count for extent item (%llu %u %llu)", 168 - key.objectid, key.type, key.offset); 167 + "unexpected zero reference count for extent item " BTRFS_KEY_FMT, 168 + BTRFS_KEY_FMT_VALUE(&key)); 169 169 btrfs_abort_transaction(trans, ret); 170 170 return ret; 171 171 } ··· 597 597 num_refs = btrfs_shared_data_ref_count(leaf, ref2); 598 598 } else { 599 599 btrfs_err(trans->fs_info, 600 - "unrecognized backref key (%llu %u %llu)", 601 - key.objectid, key.type, key.offset); 600 + "unrecognized backref key " BTRFS_KEY_FMT, 601 + BTRFS_KEY_FMT_VALUE(&key)); 602 602 btrfs_abort_transaction(trans, -EUCLEAN); 603 603 return -EUCLEAN; 604 604 } ··· 3326 3326 if (iref) { 3327 3327 if (unlikely(path->slots[0] != extent_slot)) { 3328 3328 abort_and_dump(trans, path, 3329 - "invalid iref, extent item key (%llu %u %llu) slot %u doesn't have wanted iref", 3330 - key.objectid, key.type, 3331 - key.offset, path->slots[0]); 3329 + "invalid iref, extent item key " BTRFS_KEY_FMT " slot %u doesn't have wanted iref", 3330 + BTRFS_KEY_FMT_VALUE(&key), 3331 + path->slots[0]); 3332 3332 ret = -EUCLEAN; 3333 3333 goto out; 3334 3334 }
+2 -2
fs/btrfs/inode.c
··· 5644 5644 location->type != BTRFS_ROOT_ITEM_KEY)) { 5645 5645 ret = -EUCLEAN; 5646 5646 btrfs_warn(root->fs_info, 5647 - "%s gets something invalid in DIR_ITEM (name %s, directory ino %llu, location(%llu %u %llu))", 5647 + "%s gets something invalid in DIR_ITEM (name %s, directory ino %llu, location " BTRFS_KEY_FMT ")", 5648 5648 __func__, fname.disk_name.name, btrfs_ino(dir), 5649 - location->objectid, location->type, location->offset); 5649 + BTRFS_KEY_FMT_VALUE(location)); 5650 5650 } 5651 5651 if (!ret) 5652 5652 *type = btrfs_dir_ftype(path->nodes[0], di);
+6 -8
fs/btrfs/print-tree.c
··· 131 131 struct btrfs_tree_block_info *info; 132 132 info = (struct btrfs_tree_block_info *)(ei + 1); 133 133 btrfs_tree_block_key(eb, info, &key); 134 - pr_info("\t\ttree block key (%llu %u %llu) level %d\n", 134 + pr_info("\t\ttree block key " BTRFS_KEY_FMT " level %d\n", 135 135 btrfs_disk_key_objectid(&key), key.type, 136 136 btrfs_disk_key_offset(&key), 137 137 btrfs_tree_block_level(eb, info)); ··· 277 277 struct btrfs_key location; 278 278 279 279 btrfs_dir_item_key_to_cpu(eb, di, &location); 280 - pr_info("\t\tlocation key (%llu %u %llu) type %d\n", 281 - location.objectid, location.type, location.offset, 282 - btrfs_dir_ftype(eb, di)); 280 + pr_info("\t\tlocation key " BTRFS_KEY_FMT " type %d\n", 281 + BTRFS_KEY_FMT_VALUE(&location), btrfs_dir_ftype(eb, di)); 283 282 pr_info("\t\ttransid %llu data_len %u name_len %u\n", 284 283 btrfs_dir_transid(eb, di), data_len, name_len); 285 284 di = (struct btrfs_dir_item *)((char *)di + len); ··· 597 598 print_eb_refs_lock(c); 598 599 for (i = 0; i < nr; i++) { 599 600 btrfs_node_key_to_cpu(c, &key, i); 600 - pr_info("\tkey %d (%llu %u %llu) block %llu gen %llu\n", 601 - i, key.objectid, key.type, key.offset, 602 - btrfs_node_blockptr(c, i), 603 - btrfs_node_ptr_generation(c, i)); 601 + pr_info("\tkey %d " BTRFS_KEY_FMT " block %llu gen %llu\n", 602 + i, BTRFS_KEY_FMT_VALUE(&key), btrfs_node_blockptr(c, i), 603 + btrfs_node_ptr_generation(c, i)); 604 604 } 605 605 if (!follow) 606 606 return;
+2 -4
fs/btrfs/qgroup.c
··· 3712 3712 path, 1, 0); 3713 3713 3714 3714 btrfs_debug(fs_info, 3715 - "current progress key (%llu %u %llu), search_slot ret %d", 3716 - fs_info->qgroup_rescan_progress.objectid, 3717 - fs_info->qgroup_rescan_progress.type, 3718 - fs_info->qgroup_rescan_progress.offset, ret); 3715 + "current progress key " BTRFS_KEY_FMT ", search_slot ret %d", 3716 + BTRFS_KEY_FMT_VALUE(&fs_info->qgroup_rescan_progress), ret); 3719 3717 3720 3718 if (ret) { 3721 3719 /*
+2 -2
fs/btrfs/relocation.c
··· 615 615 616 616 btrfs_disk_key_to_cpu(&cpu_key, &root->root_item.drop_progress); 617 617 btrfs_err(fs_info, 618 - "cannot relocate partially dropped subvolume %llu, drop progress key (%llu %u %llu)", 619 - objectid, cpu_key.objectid, cpu_key.type, cpu_key.offset); 618 + "cannot relocate partially dropped subvolume %llu, drop progress key " BTRFS_KEY_FMT, 619 + objectid, BTRFS_KEY_FMT_VALUE(&cpu_key)); 620 620 ret = -EUCLEAN; 621 621 goto fail; 622 622 }
+2 -2
fs/btrfs/root-tree.c
··· 147 147 148 148 if (unlikely(ret > 0)) { 149 149 btrfs_crit(fs_info, 150 - "unable to find root key (%llu %u %llu) in tree %llu", 151 - key->objectid, key->type, key->offset, btrfs_root_id(root)); 150 + "unable to find root key " BTRFS_KEY_FMT " in tree %llu", 151 + BTRFS_KEY_FMT_VALUE(key), btrfs_root_id(root)); 152 152 ret = -EUCLEAN; 153 153 btrfs_abort_transaction(trans, ret); 154 154 return ret;
+4 -6
fs/btrfs/send.c
··· 1053 1053 } 1054 1054 if (unlikely(start < p->buf)) { 1055 1055 btrfs_err(root->fs_info, 1056 - "send: path ref buffer underflow for key (%llu %u %llu)", 1057 - found_key->objectid, 1058 - found_key->type, 1059 - found_key->offset); 1056 + "send: path ref buffer underflow for key " BTRFS_KEY_FMT, 1057 + BTRFS_KEY_FMT_VALUE(found_key)); 1060 1058 ret = -EINVAL; 1061 1059 goto out; 1062 1060 } ··· 7272 7274 if (unlikely(ret > 0)) { 7273 7275 btrfs_print_tree(path->nodes[path->lowest_level], false); 7274 7276 btrfs_err(root->fs_info, 7275 - "send: key (%llu %u %llu) not found in %s root %llu, lowest_level %d, slot %d", 7276 - key->objectid, key->type, key->offset, 7277 + "send: key " BTRFS_KEY_FMT" not found in %s root %llu, lowest_level %d, slot %d", 7278 + BTRFS_KEY_FMT_VALUE(key), 7277 7279 (root == sctx->parent_root ? "parent" : "send"), 7278 7280 btrfs_root_id(root), path->lowest_level, 7279 7281 path->slots[path->lowest_level]);
+9 -12
fs/btrfs/tree-checker.c
··· 1618 1618 1619 1619 if (unlikely(prev_end > key->objectid)) { 1620 1620 extent_err(leaf, slot, 1621 - "previous extent [%llu %u %llu] overlaps current extent [%llu %u %llu]", 1622 - prev_key->objectid, prev_key->type, 1623 - prev_key->offset, key->objectid, key->type, 1624 - key->offset); 1621 + "previous extent " BTRFS_KEY_FMT " overlaps current extent " BTRFS_KEY_FMT, 1622 + BTRFS_KEY_FMT_VALUE(prev_key), 1623 + BTRFS_KEY_FMT_VALUE(key)); 1625 1624 return -EUCLEAN; 1626 1625 } 1627 1626 } ··· 2059 2060 /* Make sure the keys are in the right order */ 2060 2061 if (unlikely(btrfs_comp_cpu_keys(&prev_key, &key) >= 0)) { 2061 2062 generic_err(leaf, slot, 2062 - "bad key order, prev (%llu %u %llu) current (%llu %u %llu)", 2063 - prev_key.objectid, prev_key.type, 2064 - prev_key.offset, key.objectid, key.type, 2065 - key.offset); 2063 + "bad key order, prev " BTRFS_KEY_FMT " current " BTRFS_KEY_FMT, 2064 + BTRFS_KEY_FMT_VALUE(&prev_key), 2065 + BTRFS_KEY_FMT_VALUE(&key)); 2066 2066 return BTRFS_TREE_BLOCK_BAD_KEY_ORDER; 2067 2067 } 2068 2068 ··· 2179 2181 2180 2182 if (unlikely(btrfs_comp_cpu_keys(&key, &next_key) >= 0)) { 2181 2183 generic_err(node, slot, 2182 - "bad key order, current (%llu %u %llu) next (%llu %u %llu)", 2183 - key.objectid, key.type, key.offset, 2184 - next_key.objectid, next_key.type, 2185 - next_key.offset); 2184 + "bad key order, current " BTRFS_KEY_FMT " next " BTRFS_KEY_FMT, 2185 + BTRFS_KEY_FMT_VALUE(&key), 2186 + BTRFS_KEY_FMT_VALUE(&next_key)); 2186 2187 return BTRFS_TREE_BLOCK_BAD_KEY_ORDER; 2187 2188 } 2188 2189 }
+18 -20
fs/btrfs/tree-log.c
··· 198 198 199 199 if (wc->log_leaf) { 200 200 btrfs_crit(fs_info, 201 - "log tree (for root %llu) leaf currently being processed (slot %d key %llu %u %llu):", 201 + "log tree (for root %llu) leaf currently being processed (slot %d key " BTRFS_KEY_FMT "):", 202 202 btrfs_root_id(wc->root), wc->log_slot, 203 - wc->log_key.objectid, wc->log_key.type, wc->log_key.offset); 203 + BTRFS_KEY_FMT_VALUE(&wc->log_key)); 204 204 btrfs_print_leaf(wc->log_leaf); 205 205 } 206 206 ··· 510 510 ret = btrfs_search_slot(NULL, root, &wc->log_key, wc->subvol_path, 0, 0); 511 511 if (ret < 0) { 512 512 btrfs_abort_log_replay(wc, ret, 513 - "failed to search subvolume tree for key (%llu %u %llu) root %llu", 514 - wc->log_key.objectid, wc->log_key.type, 515 - wc->log_key.offset, btrfs_root_id(root)); 513 + "failed to search subvolume tree for key " BTRFS_KEY_FMT " root %llu", 514 + BTRFS_KEY_FMT_VALUE(&wc->log_key), 515 + btrfs_root_id(root)); 516 516 return ret; 517 517 } 518 518 ··· 618 618 btrfs_extend_item(trans, wc->subvol_path, item_size - found_size); 619 619 } else if (ret) { 620 620 btrfs_abort_log_replay(wc, ret, 621 - "failed to insert item for key (%llu %u %llu)", 622 - wc->log_key.objectid, wc->log_key.type, 623 - wc->log_key.offset); 621 + "failed to insert item for key " BTRFS_KEY_FMT, 622 + BTRFS_KEY_FMT_VALUE(&wc->log_key)); 624 623 return ret; 625 624 } 626 625 dst_ptr = btrfs_item_ptr_offset(dst_eb, dst_slot); ··· 828 829 &wc->log_key, sizeof(*item)); 829 830 if (ret) { 830 831 btrfs_abort_log_replay(wc, ret, 831 - "failed to insert item with key (%llu %u %llu) root %llu", 832 - wc->log_key.objectid, wc->log_key.type, 833 - wc->log_key.offset, btrfs_root_id(root)); 832 + "failed to insert item with key " BTRFS_KEY_FMT " root %llu", 833 + BTRFS_KEY_FMT_VALUE(&wc->log_key), 834 + btrfs_root_id(root)); 834 835 goto out; 835 836 } 836 837 dest_offset = btrfs_item_ptr_offset(wc->subvol_path->nodes[0], ··· 1347 1348 ret = btrfs_search_slot(NULL, root, &search_key, wc->subvol_path, 0, 0); 1348 1349 if (ret < 0) { 1349 1350 btrfs_abort_log_replay(wc, ret, 1350 - "failed to search subvolume tree for key (%llu %u %llu) root %llu", 1351 - search_key.objectid, search_key.type, 1352 - search_key.offset, btrfs_root_id(root)); 1351 + "failed to search subvolume tree for key " BTRFS_KEY_FMT " root %llu", 1352 + BTRFS_KEY_FMT_VALUE(&search_key), 1353 + btrfs_root_id(root)); 1353 1354 return ret; 1354 1355 } else if (ret == 0) { 1355 1356 /* ··· 1482 1483 } 1483 1484 if (ret < 0) { 1484 1485 btrfs_abort_log_replay(wc, ret, 1485 - "failed to search subvolume tree for key (%llu %u %llu) root %llu", 1486 - wc->log_key.objectid, wc->log_key.type, 1487 - wc->log_key.offset, btrfs_root_id(root)); 1486 + "failed to search subvolume tree for key " BTRFS_KEY_FMT " root %llu", 1487 + BTRFS_KEY_FMT_VALUE(&wc->log_key), 1488 + btrfs_root_id(root)); 1488 1489 goto out; 1489 1490 } 1490 1491 ··· 2699 2700 wc->subvol_path, 0, 0); 2700 2701 if (ret < 0) { 2701 2702 btrfs_abort_log_replay(wc, ret, 2702 - "failed to search root %llu for key (%llu %u %llu)", 2703 + "failed to search root %llu for key " BTRFS_KEY_FMT, 2703 2704 btrfs_root_id(root), 2704 - dir_key.objectid, dir_key.type, 2705 - dir_key.offset); 2705 + BTRFS_KEY_FMT_VALUE(&dir_key)); 2706 2706 goto out; 2707 2707 } 2708 2708