Linux内核分析：实验二

原创作品转载请注明出处 + 《Linux内核分析》MOOC课程http://mooc.study.163.com/course/USTC-1000029000

该实验要求完成一个简单的时间片轮转多道程序内核代码。

 

首先我们看看mykernel里面的mypcb.h:

 

#define MAX_TASK_NUM  10  // max num of task in system #define KERNEL_STACK_SIZE  1024*8 

struct Thread 
{
    unsigned long ip;
    unsigned long sp;
};

typedef struct PCB{
    int pid;
    volatile long state;        /* -1 unrunnable, 0 runnable, >0 stopped */
    char stack[KERNEL_STACK_SIZE];        /* CPU-specific state of this task */
    struct Thread thread;
    unsigned long task_entry;
    struct PCB *next;
}tPCB;

该文件在最开始定义了最大的任务数量MAX_TASK_NUM和内核栈大小KERNEN_STACK_SIZE;然后定义了一个结构体，用来保存指令指针ip和栈顶指针sp；然后结构体PCB里面定义了进程号pid,进程状态state等属性从而完成了对进程的基本描述。

 

进入kernel目录的mymain.c,我们会看到如下代码：

 

void __init my_start_kernel(void)
{
    int pid = 0;

    /* Initialize process 0*/
    task[pid].pid = pid;
    task[pid].state = 0;/* -1 unrunnable, 0 runnable, >0 stopped */

    // set task 0 execute entry address to my_process
    task[pid].task_entry = task[pid].thread.ip = (unsigned long)my_process;
    task[pid].thread.sp = (unsigned long)&task[pid].stack[KERNEL_STACK_SIZE-1];
    task[pid].next = &task[pid];

    /*fork more process */
    for(pid=1;pid<MAX_TASK_NUM;pid++)
    {
        memcpy(&task[pid],&task[0],sizeof(tPCB));
        task[pid].pid = pid;
        task[pid].state = -1;
        task[pid].thread.sp = (unsigned long)&task[pid].stack[KERNEL_STACK_SIZE-1];
        task[pid].priority=get_rand(PRIORITY_MAX);//each time all tasks get a random priority
    }
    task[MAX_TASK_NUM-1].next=&task[0];
    printk(KERN_NOTICE "\n\n\n\n\n\n system begin :>>>process 0 running!!!<<<\n\n");

    /* start process 0 by task[0] */
    pid = 0;
    my_current_task = &task[pid];
    asm volatile(
         "movl %1,%%esp\n\t" /* set task[pid].thread.sp to esp */
         "pushl %1\n\t" /* push ebp */
         "pushl %0\n\t" /* push task[pid].thread.ip */
         "ret\n\t" /* pop task[pid].thread.ip to eip */
         "popl %%ebp\n\t"
         :
         : "c" (task[pid].thread.ip),"d" (task[pid].thread.sp) /* input c or d mean %ecx/%edx*/
    );
}

该函数首先将任务初始化为0，状态置为0表示可运行；设置运行的进程号以及栈顶sp,然后设置下一个进程指向自己；将剩下的任务随机分配优先权限。嵌入的一段汇编代码首先将sp赋值给esp,然后将sp进栈，再把ip进栈；最后return和ebp出栈，这样就完成了一个进程的启动。

 

void __init my_start_kernel(void)
{
    int i = 0;
    while(1)
    {
        i++;
        if(i%100000 == 0)
        printk(KERN_NOTICE "my_start_kernel here  %d \n",i);

    }
}

该函数是操作系统的启动函数，我们可以看到，每循环执行100000次，打印出“my_start_kernel here".。

 

在myinterrupt.c里面，我们可以看到下面这个函数：

void my_schedule(void) { tPCB * next; tPCB * prev; if(my_current_task == NULL || my_current_task->next == NULL) { return; } printk(KERN_NOTICE ">>>my_schedule<<<\n"); /* schedule */ next = my_current_task->next; prev = my_current_task; if(next->state == 0)/* -1 unrunnable, 0 runnable, >0 stopped */ { /* switch to next process */ asm volatile( "pushl %%ebp\n\t" /* save ebp */ "movl %%esp,%0\n\t" /* save esp */ "movl %2,%%esp\n\t" /* restore esp */ "movl $1f,%1\n\t" /* save eip */ "pushl %3\n\t" "ret\n\t" /* restore eip */ "1:\t" /* next process start here */ "popl %%ebp\n\t" : "=m" (prev->thread.sp),"=m" (prev->thread.ip) : "m" (next->thread.sp),"m" (next->thread.ip) ); my_current_task = next; printk(KERN_NOTICE ">>>switch %d to %d<<<\n",prev->pid,next->pid); } else { next->state = 0; my_current_task = next; printk(KERN_NOTICE ">>>switch %d to %d<<<\n",prev->pid,next->pid); /* switch to new process */ asm volatile( "pushl %%ebp\n\t" /* save ebp */ "movl %%esp,%0\n\t" /* save esp */ "movl %2,%%esp\n\t" /* restore esp */ "movl %2,%%ebp\n\t" /* restore ebp */ "movl $1f,%1\n\t" /* save eip */ "pushl %3\n\t" "ret\n\t" /* restore eip */ : "=m" (prev->thread.sp),"=m" (prev->thread.ip) : "m" (next->thread.sp),"m" (next->thread.ip) ); } return; }

在myshedule函数中如果下一个进程可运行，则ebp压栈，将esp保存到上一个进程的sp中，下条进程的sp保存到esp，然后存储eip上一个也就是保存进程的上下文，然后开启下一个进程；若下一个进程不可运行，先要将其标记为可运行，然后再进行进程的上下文切换，这里与上面有一点不同的地方是此进程没有运行过，栈是空的，栈顶指针和栈基指针相同，所以是把 Thread 中的 sp 赋给 ebp。

运行截图：