C++内存算法.doc

Chapter 1 Memory Management Mechanisms 1 1.1 Overview 1 1.2 Mechanism Versus Policy 1 1.3 Memory Hierarchy 3 1.4 Address Lines and Buses 6 1.5 Intel Pentium Architecture 8 1.5.1 Real Mode Operation 11 1.5.2 Protected Mode Operation 15 Protected Mode Paging 21 Paging as Protection 25 Addresses: Logical, Linear, and Physical 26 Page Frames and Pages 27 1.6 Closing Thoughts 33 1.7 References 34 Chapter 2: Memory Management Policies 35 2.1 Overview 35 2.2 Case Study: MS-DOS 35 2.2.1 DOS Segmentation and Paging 36 2.2.2 DOS Memory Map 36 2.2.3 Memory Usage 38 2.2.4 Example: A Simple Video Driver 39 2.2.5 Example: Usurping DOS 41 2.2.6 Jumping the 640KB Hurdle 45 2.3 Case Study: MMURTL 48 2.3.1 Background and Design Goals 48 2.3.2 MMURTL and Segmentation 49 2.3.3 Paging Variations 51 2.3.4 MMURTL and Paging 51 2.3.5 Memory Allocation 53 2.4 Case Study: Linux 55 2.4.1 History and MINIX 55 2.4.2 Design Goals and Features 55 2.4.3 Linux and Segmentation 56 2.4.4 Linux and Paging 58 2.4.5 Page Fault Handling 62 2.4.6 Memory Allocation 62 2.4.7 Memory Usage 66 2.4.8 Example: Siege Warfare 67 2.4.9 Example: Siege Warfare, More Treachery 71 2.5 Case Study: Windows 76 2.5.1 Historical Forces 76 2.5.2 Memory Map Overview 79 2.5.3 Windows and Segmentation 81 Special Weapons and Tactics 82 Crashing Windows with a Keystroke 83 Reverse Engineering the GDT 84 2.5.4 Windows and Paging 86 Linear Address Space Taxonomy 86 Musical Chairs for Pages 88 Memory Protection 89 Demand Paging 90 2.5.5 Memory Allocation 91 2.5.6 Memory Usage 94 2.5.7 Turning Off Paging 97 2.5.8 Example: Things That Go Thunk in the Night 98 2.6 Closing Thoughts 101 2.7 References 102 2.7.1 Books and Articles 102 2.7.2 Web Sites 103 Chapter 3: High-Level Services 105 3.1 View from 10,000 Feet 105 3.2 Compiler-Based Allocation 106 3.2.1 Data Section 109 3.2.2 Code Section 112 3.2.3 Stack 113 Activation Records 115 Scope 121 Static or Dynamic? 127 3.3 Heap Allocation 127 3.3.1 System Call Interface 128 3.