Linux內核設計與實現（簡體書）

《Linux內核設計與實現(英文版·第3版)》基於Linux2.6 介紹了Linux內核的設計與實現，涵蓋了從核心內核系統的應用到內核設計與實現等各方面內容，主要內容包括：進程管理、調度、時間管理和定時器、系統調用接口、內存尋址、內存管理、頁緩存、VFS、內核同步、可移植性、調試技術等。此外，《Linux內核設計與實現(英文版·第3版)》還討論了Linux2.6 頗具特色的內容，包括CFS調度程序、搶占式內核、塊I／0層以及I／0調度程序。
《Linux內核設計與實現(英文版·第3版)》詳細描述了Linux內核的主要子系統和特點，包括其設計、實現和接口，既介紹理論也討論具體應用，填補了Linux內核理論和實踐細節之間的鴻溝，能夠帶領讀者快速走進Linux內核世界，真正開發內核代碼。
如果你是一名Linux內核愛好者，《Linux內核設計與實現(英文版·第3版)》的內容可以幫助你大顯身手。如果你是一名普通程序員，《Linux內核設計與實現(英文版·第3版)》的內容將會拓寬你的編程思路。如果你初次接觸Linux內核，《Linux內核設計與實現(英文版·第3版)》則可以幫助你對內核各個核心子系統有一個整體把握。
《Linux內核設計與實現(英文版·第3版)》新增內容：·增加一章專門描述內核數據結構·詳細描述中斷處理程序·擴充虛擬內存和內存分配的內容·調試Linux內核的技巧·內核同步和鎖機制的深度描述·提交內核補丁以及參與Linux內核社區的建設性建議

作者：（美國）洛夫（Robert Love）

Robert Love is an open source programmer，speaker，and author who has been usingand contributing to Linux for more than 15 years. Robert is currendy senior softwareengineer at Google，where he was a member of the team that developed the Androidmobile platforms kernel.Prior to Google，he was ChiefArchitect，Linux Desktop，atNoveU.Before NoveU.he was a kernel engineer at MontaVista Software and Xilllian. Roberts kernel projects include the preemptive kernel,the process scheduler，thekernel events layer，inotifi],VM erdaancements，and several device drivers. Robert has given numerous talks on and has written multiple articles about the Linuxkernel.He is a contributing editor for Linux Iournal.His other books include LinuxSystem Programming and Linux in a Nutshell. Robert received a B.A.degree in mathematics and a B.S.degree i11 computer sciencefrom the University ofFlorida.He lives in Boston.

1 Introductlon to the Unux Kernel1
History of Unix1
Along Came Linus：Introduction to Linux3
Overview of Operating Systems and Kernels4
Linux Versus Classic Unix Kernels6
Linux Kernel Versions 8
The Linux KerneI Development Community10
Before We Begin10
2 Getting Started with the Kernel 11
Obtaining the Kernel Source11
UsingGit 11
Installing the Kernel Source12
Using Patches12
The Kernel Source Tree12
Building the Kernel3
Configuring the Kernel14
Minimizing Build Noise15
Spawning Multiple Build Jobs16
Installing the New Kernel16
A Beast ofa Difierent Nature16
No Iibc or Standard Headers17
GNU C18
Inline Functions18
Inline Assembly19
Branch Annotation19
No Memory Protection20
No(Easy)Use of Floating Point20
SmalI．Fixed．Size Stack20
Synchronization and Concurrency21
Importance of Portability21
Conclusion21
3 Process Management23
The Process23
Process Descriptor and the Task Structure24
Allocating the Process Descriptor 25
Storing the Process Descriptor 26
Process State27
Manipulating the Current Process State 29
Process Context29t
The Process Family Tree29
Process Creation31
Copy-on-Write31
Forking 32
vforko33
The Linux Implementation of Threads33
Creating Threads34
KerneI Threads35
Process Termination36
Removing the Process Descriptor 37
The Dilemma of the Parentless Task 38
Conclusion 40
4 Process Scheduling 41
Multitasking 41
Linuxs Process Scheduler 42
Policy 43
I／o-Bound Versus Processor-Bound Processes 43
Process Priority 44
Timeslice 45
The Scheduling Policy in Action 45
The Linux Scheduling AIgorithm 46
Scheduler Classes 46
Process Scheduling in Unix Systems 47
Fair Scheduling 48
The Linux Scheduling Implementation50
Time Accounting50
The Scheduler Entity Structure50
The VirtuaI Runtime51
Process Selection52
Pickingthe NextTask 53
Adding Processes to the Tree54
Removing Processes from the Tree56
The Scheduler Entry Point57
Sleeping and Waking Up58
WaitQueues 58
Waking Up 61
Preemllotion and Context Switching 62
User PreemptionI62
Kernel PreemIption63
Real-Time Scheduling Policies64
ScheduIer．Related System Calls65
Scheduling Policy and Priority-Related
System Calls66
Processor Affinity SystemI Calls66
Yielding Processor Time66
Conclusion67
5 System Calls 69
Communicating with the Kernel69
APIs，POSIX。and the C Library 70
Syscalls71
System Call Numbers72
System CalI Performance72
System Call Handler73
Denoting the Correct System Call73
Parameter Passing74
System Call Implementation74
Implementing System Calls74
Verifying the Parameters75
System CalI Context 78
Final Steps in Binding a System Call79
Accessing the System Call I from Use Space 81
Why Not to Implement a System Call 82
Conclusion 83
6 KerneI Data Structures 85
Linked Lists 85
Singly and Doubly Linked Lists 85
Circular Linked Lists 86
Moving Through a Linked List 87
The Linux Kernels Implementation 88
The Linked List StFUcture88
Defining a LinkedList 89
List Heads90
Manipulating Linked Lists90
Adding a Node to a Linked List90
Deleting a Node from a Linked List91
Moving and Splicing Linked List Nodes92
Traversing Linked Lists93
The Basic Approach93
The Usable Approach93
Iterating Through a List Backward94
Iterating While Removing95
Other Linked List Methods96
Queues 96
kfIf097

Creating a Queue97
Enqueuing Data98
Dequeuing Data98
Obtaining the Size of a Queue98
Resetting and Destroying the Queue99
Example Queue Usage99
Maps100
Initializing an idr101
Allocating a New UlD101
Looking Up a UID102
Removing a UID 103
Destroying an idr103
Binary Trees103
Binary Search 1．rees104
Self-Balancing Binary Search Trees105
Red-Black Trees105
rbtrees106