MINIX 3内核进程表

在MINIX 3中，进程表被分成内核、进程管理、文件系统三个部分，各部分维护它们各自所需要的那些域，三个部分的进程表中相同进程的位置是相同的。

MINIX 3内核进程表数据结构定义在src/kernel/Proc.h中，主要用途是进程调度和进程间通信。

// src/kernel/Proc.h #ifndef PROC_H #define PROC_H /* Here is the declaration of the process table. It contains all process * data, including registers, flags, scheduling priority, memory map, * accounting, message passing (IPC) information, and so on. * * Many assembly code routines reference fields in it. The offsets to these * fields are defined in the assembler include file sconst.h. When changing * struct proc, be sure to change sconst.h to match. */ #include <minix/com.h> #include "protect.h" #include "const.h" #include "priv.h" struct proc { struct stackframe_s p_reg; /* process' registers saved in stack frame */ #if (CHIP == INTEL) reg_t p_ldt_sel; /* selector in gdt with ldt base and limit */ struct segdesc_s p_ldt[2+NR_REMOTE_SEGS]; /* CS, DS and remote segments */ #endif #if (CHIP == M68000) /* M68000 specific registers and FPU details go here. */ #endif proc_nr_t p_nr; /* number of this process (for fast access) */ struct priv *p_priv; /* system privileges structure */ char p_rts_flags; /* SENDING, RECEIVING, etc. */ char p_misc_flags; /* Flags that do suspend the process */ char p_priority; /* current scheduling priority */ char p_max_priority; /* maximum scheduling priority */ char p_ticks_left; /* number of scheduling ticks left */ char p_quantum_size; /* quantum size in ticks */ struct mem_map p_memmap[NR_LOCAL_SEGS]; /* memory map (T, D, S) */ clock_t p_user_time; /* user time in ticks */ clock_t p_sys_time; /* sys time in ticks */ struct proc *p_nextready; /* pointer to next ready process */ struct proc *p_caller_q; /* head of list of procs wishing to send */ struct proc *p_q_link; /* link to next proc wishing to send */ message *p_messbuf; /* pointer to passed message buffer */ proc_nr_t p_getfrom; /* from whom does process want to receive? */ proc_nr_t p_sendto; /* to whom does process want to send? */ sigset_t p_pending; /* bit map for pending kernel signals */ char p_name[P_NAME_LEN]; /* name of the process, including /0 */ #if DEBUG_SCHED_CHECK int p_ready, p_found; #endif }; /* Bits for the runtime flags. A process is runnable iff p_rts_flags == 0. */ #define SLOT_FREE 0x01 /* process slot is free */ #define NO_MAP 0x02 /* keeps unmapped forked child from running */ #define SENDING 0x04 /* process blocked trying to SEND */ #define RECEIVING 0x08 /* process blocked trying to RECEIVE */ #define SIGNALED 0x10 /* set when new kernel signal arrives */ #define SIG_PENDING 0x20 /* unready while signal being processed */ #define P_STOP 0x40 /* set when process is being traced */ #define NO_PRIV 0x80 /* keep forked system process from running */ /* Misc flags */ #define MF_VM 0x01 /* Process uses VM */ /* Scheduling priorities for p_priority. Values must start at zero (highest * priority) and increment. Priorities of the processes in the boot image * can be set in table.c. IDLE must have a queue for itself, to prevent low * priority user processes to run round-robin with IDLE. */ #define NR_SCHED_QUEUES 16 /* MUST equal minimum priority + 1 */ #define TASK_Q 0 /* highest, used for kernel tasks */ #define MAX_USER_Q 0 /* highest priority for user processes */ #define USER_Q 7 /* default (should correspond to nice 0) */ #define MIN_USER_Q 14 /* minimum priority for user processes */ #define IDLE_Q 15 /* lowest, only IDLE process goes here */ /* Magic process table addresses. */ #define BEG_PROC_ADDR (&proc[0]) #define BEG_USER_ADDR (&proc[NR_TASKS]) #define END_PROC_ADDR (&proc[NR_TASKS + NR_PROCS]) #define NIL_PROC ((struct proc *) 0) #define NIL_SYS_PROC ((struct proc *) 1) #define cproc_addr(n) (&(proc + NR_TASKS)[(n)]) #define proc_addr(n) (pproc_addr + NR_TASKS)[(n)] #define proc_nr(p) ((p)->p_nr) #define isokprocn(n) ((unsigned) ((n) + NR_TASKS) < NR_PROCS + NR_TASKS) #define isemptyn(n) isemptyp(proc_addr(n)) #define isemptyp(p) ((p)->p_rts_flags == SLOT_FREE) #define iskernelp(p) iskerneln((p)->p_nr) #define iskerneln(n) ((n) < 0) #define isuserp(p) isusern((p)->p_nr) #define isusern(n) ((n) >= 0) /* The process table and pointers to process table slots. The pointers allow * faster access because now a process entry can be found by indexing the * pproc_addr array, while accessing an element i requires a multiplication * with sizeof(struct proc) to determine the address. */ EXTERN struct proc proc[NR_TASKS + NR_PROCS]; /* process table */ EXTERN struct proc *pproc_addr[NR_TASKS + NR_PROCS]; EXTERN struct proc *rdy_head[NR_SCHED_QUEUES]; /* ptrs to ready list headers */ EXTERN struct proc *rdy_tail[NR_SCHED_QUEUES]; /* ptrs to ready list tails */ #endif /* PROC_H */

proc结构体就是进程表项的数据结构，先来看看proc结构体中各个域的含义。

26，p_nr，进程号，值得注意的是，内核进程CLOCK（-3）、SYSTEM（-2）、KERNEL（-1）和IDLE进程（-4）的进程号是负数；

28，p_rts_flags，进程的各种标志位，各位意义对应62~69行，只有各位为0时进程为就绪状态；

44，p_name，进程的名称。

进程调度：

30，p_priority，进程的当前优先级，MINIX 3的进程优先级是可变的，内核进程和IDLE进程除外；

31，p_max_priority，进程能够获得的最大优先级；

32，p_ticks_left，进程上一次运行剩余的时间片；

33，p_quantum_size，进程可以获得的时间片；

37，p_nextready，指向同一优先级队列的下一个就绪进程；

进程通信：

38，p_caller_q，指向等待想它发送消息的进程；

39，p_q_link，指向下一个和它一样等待向同一个目标进程发送消息的进程；

40，p_messbuf，消息缓冲区；

41，p_getfrom，消息的源进程号；

42，p_sendto，消息的目标进程号；

 

proc结构体之外还定义了一些宏和变量。

75，NIL_PROC，表示空进程，相当于NULL；

78，proc_addr(n)，这个宏用于根据进程号获取进程表项，注意内核进程的进程号是负数，但C语言数组下标从0开始；

79，proc_nr(p)，这个宏根据进程获取进程号；

83，iskernelp(p)，判断进程是不是内核进程（进程号小于0）；

85，isuserp(p)，判断进程是不是用户进程（进程号非负）；

92，proc[NR_TASKS + NR_PROCS]，进程表，NR_TASKS是内核进程（进程号为负数）数，NR_PROCS是用户进程数上限；

93，pproc_addr[NR_TASKS + NR_PROCS]，进程表项指针数组，加快查找速度；

94、95，rdy_head[NR_SCHED_QUEUES]、rdy_tail[NR_SCHED_QUEUES]，进程优先级队列的队头数组和队尾数组，16个队列。