AI 真的提高了我的工作效率

#include <linux/init.h>
#include <linux/module.h>
#include <linux/kernel.h>
#include <linux/kfifo.h>
#include <linux/slab.h>

#define FIFO_SIZE 1024

static DEFINE_KFIFO(my_fifo, char, FIFO_SIZE);

static int __init kfifo_example_init(void)
{
    int ret;
    char data[] = "Hello, kfifo!";
    char buf[FIFO_SIZE];

    // 初始化 kfifo
    ret = kfifo_in(&my_fifo, data, sizeof(data));
    if (ret != sizeof(data)) {
        printk(KERN_ERR "Failed to initialize kfifo\n");
        return -ENOSPC;
    }

    // 从 kfifo 中读取数据
    ret = kfifo_out(&my_fifo, buf, sizeof(data));
    if (ret != sizeof(data)) {
        printk(KERN_ERR "Failed to read from kfifo\n");
        return -EFAULT;
    }

    buf[sizeof(data)] = '\0'; // 添加字符串结束符

    printk(KERN_INFO "Read from kfifo: %s\n", buf);

    return 0;
}

static void __exit kfifo_example_exit(void)
{
    kfifo_free(&my_fifo); // 释放 kfifo 的空间
    printk(KERN_INFO "kfifo example module unloaded\n");
}

module_init(kfifo_example_init);
module_exit(kfifo_example_exit);

MODULE_LICENSE("GPL");
MODULE_AUTHOR("Your Name");
MODULE_DESCRIPTION("A simple kernel module demonstrating the use of kfifo");

#include <linux/init.h>
#include <linux/module.h>
#include <linux/kernel.h>
#include <linux/list.h>
#include <linux/slab.h>

struct student {
    int id;
    char name[20];
    struct list_head list;
};

static LIST_HEAD(student_list);

static int __init list_example_init(void)
{
    struct student *s1, *s2, *s;
    
    // 为两个学生分配内存
    s1 = kmalloc(sizeof(struct student), GFP_KERNEL);
    s2 = kmalloc(sizeof(struct student), GFP_KERNEL);
    
    if (!s1 || !s2) {
        printk(KERN_ERR "Memory allocation failed\n");
        return -ENOMEM;
    }
    
    s1->id = 1;
    strncpy(s1->name, "Alice", sizeof(s1->name));
    INIT_LIST_HEAD(&s1->list);
    
    s2->id = 2;
    strncpy(s2->name, "Bob", sizeof(s2->name));
    INIT_LIST_HEAD(&s2->list);
    
    // 将学生添加到链表中
    list_add_tail(&s1->list, &student_list);
    list_add_tail(&s2->list, &student_list);
    
    // 遍历链表并打印学生信息
    printk(KERN_INFO "Student list:\n");
    list_for_each_entry(s, &student_list, list) {
        printk(KERN_INFO "ID: %d, Name: %s\n", s->id, s->name);
    }

    return 0;
}

static void __exit list_example_exit(void)
{
    struct student *s, *tmp;
    
    // 释放链表中学生的内存
    list_for_each_entry_safe(s, tmp, &student_list, list) {
        list_del(&s->list);
        kfree(s);
    }
    
    printk(KERN_INFO "List example module unloaded\n");
}

module_init(list_example_init);
module_exit(list_example_exit);

MODULE_LICENSE("GPL");
MODULE_AUTHOR("Your Name");
MODULE_DESCRIPTION("A simple kernel module demonstrating the use of linked list in the kernel");

# Makefile 4.0

obj-m := xxxx.o

CURRENT_PATH := $(shell pwd)
LINUX_KERNEL := $(shell uname -r)
LINUX_KERNEL_PATH := /usr/src/linux-headers-$(LINUX_KERNEL)

all:
 make -C $(LINUX_KERNEL_PATH) M=$(CURRENT_PATH) modules
 
clean:
 make -C $(LINUX_KERNEL_PATH) M=$(CURRENT_PATH) clean