ULK --- Chap3 Processes: How Processes Are Organized

标签：

The runqueue lists group all processes in a  TASK_RUNNING state. When it comes to grouping

processes in other states, the various states call for different types of treatment, with Linux

opting for one of choices shown in the following list.

Processes in a TASK_STOPPED, EXIT_ZOMBIE, or EXIT_DEAD state are not linked in specific lists.

There is no need to group processes in any of these three states, because stopped, zombie, and

dead processes are accessed only via PID or via linked lists of child process for a particular parent.

Processes in a TASK_INTERRUPTIBLE or TASK_UNINTERRUPTIBLE state are subdivided into many

classes, each of which corresponds to a specific event. In this case, the process state does not

provide enough information to retrieve the process quickly, so it is necessary to introduce additional

lists of processes. These are called wait queues and are discussed next.

　　　　　　　　　　　　　　　　　　　　　　　　Wait Queues

Wait queues have several uses in the kernel, particularly for interrupt handling, process synchronization,

and timing. Because these topics are discussed in later chapters, we will just say here that a process

must often wait for some events to occur, such as for a disk operation to terminate, a system resource

to be released, or a fixed interval of time to elapse. Wait queues implement conditional waits on events:

a process wishing to wait for a specific event places itself in the proper wait queue and relinquishes control.

Therefore, a wait queue represents a set of sleeping processes, whch are woken up by the kernel when

some condition becomes true.

Wait queues are implemented as doubly linked list whose elements include pointers to process descriptors.

Each wait queue is identified by a wait queue head, a data structure of type wait_queue_head_t:

Because wait queues are modified by interrupt handlers as well as by major kernel functions, the doubly

linked lists must be protected from concurrent accesses, which could include unpredictable results.

Synchronization is achieved by the lock spin lock in the wait queue head. The task_list field is the head of

the list of waiting processes.

Elements of a wait queue list are of type wait_queue_t:

Each element in the wait queue list represents a sleeping process, which is waiting for some event to occur;

its descriptor address is stored in the task field. The task_list field contains the pointers that link this element

to the list of processes waiting for the same event.

However, it is not always convention to wake up all sleeping processes in a wait queue. For instance, if two

or more processes are waiting for exclusive access to some resource to be released, it makes sense to wake

up just one process in the wait queue. This process takes the resource, which the other processes continue to

sleep.

ULK --- Chap3 Processes: How Processes Are Organized

标签：

原文地址：http://www.cnblogs.com/miaoyong/p/4948986.html