superblock.c

本文介绍了一个简单的Linux内核模块,该模块用于遍历系统中的所有超级块(super_blocks),并打印出每个文件系统的设备标识符和类型名称,同时统计了所有inode的数量。

摘要生成于 C知道 ,由 DeepSeek-R1 满血版支持, 前往体验 >

#include<linux/module.h>
#include<linux/fs.h>
#include<linux/init.h>
#include<linux/list.h>
#include<linux/spinlock.h>
#include<linux/kdev_t.h>

#define SUPER_BLOCKS_ADDRESS 0xffffffff81c77670
#define SB_LOCK_ADDRESS 0xffffffff820137b0

static int __init my_init(void)
{
    struct super_block *sb;
    struct list_head *pos;
    struct list_head *linode;
    struct inode *pinode;
    unsigned long long count = 0;
   
    printk("\nPrint some fields of super_blocks:\n");
    spin_lock((spinlock_t *)SB_LOCK_ADDRESS);
    list_for_each(pos, (struct list_head *)SUPER_BLOCKS_ADDRESS) {
        sb = list_entry(pos, struct super_block, s_list);
        printk("dev_t: %d : %d", MAJOR(sb->s_dev), MINOR(sb->s_dev));
        printk("  file_type name: %s\n",sb->s_type->name);

        list_for_each(linode, &sb->s_inodes) {
            pinode=list_entry(linode,struct inode,i_sb_list);
            count++;
            printk(" %lu\t",pinode->i_ino);
        }
    }
    spin_unlock((spinlock_t *)SB_LOCK_ADDRESS);
    printk("The number of inodes: %llu\n",sizeof(struct inode) *count);
    return 0;
}

static void __exit my_exit(void)
{
    printk("unloading...\n");
}

module_init(my_init);
module_exit(my_exit);
MODULE_LICENSE("GPL");

root@vm:/mnt/data/models# sudo xfs_repair /dev/vdb Phase 1 - find and verify superblock... bad primary superblock - bad magic number !!! attempting to find secondary superblock... ...........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................Sorry, could not find valid secondary superblock Exiting now.
最新发布
03-14
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值