COMPUTER SYSTEMS · PEKING UNIVERSITY
14 · 课件覆盖索引与来源
这里保留全部现有课件的页码主题，包括附加材料。页题名由 PDF 文本抽取清理，少数无题页用内容起始行标识；它是回查索引，正文按知识主题合并重复例子。
覆盖情况#
| 来源 | 页数 | 对应章节 | 状态 |
|---|---|---|---|
| ICS01-overview-20260907.pdf | 50 | 01，相关补充见 13 | 已提取全部页面主题，按主题整理 |
| ICS02-bits-bytes-ints-20260910.pdf | 68 | 02，相关补充见 13 | 已提取全部页面主题，按主题整理 |
| ICS03-float-20260914.pdf | 48 | 03，相关补充见 13 | 已提取全部页面主题，按主题整理 |
| ICS04-machine-basics-20260917.pdf | 47 | 04，相关补充见 13 | 已提取全部页面主题，按主题整理 |
| ICS05-machine-control-20260921.pdf | 64 | 05，相关补充见 13 | 已提取全部页面主题，按主题整理 |
| ICS06-machine-procedures-20260924.pdf | 75 | 06，相关补充见 13 | 已提取全部页面主题，按主题整理 |
| ICS07-machine-data-20260928.pdf | 51 | 07，相关补充见 13 | 已提取全部页面主题，按主题整理 |
小班研讨题第 2～7 讲共 6 份、每份 2 页，已全文读取并归并到正文与第 13 章。教材扫描版仅提取前部信息作为版次参考，正文公式基于课件、CS:APP 通用原理及官方资料核对；没有宣称逐页阅读整本扫描教材。
第 8 讲课件未提供；该章标为教材/往年题补充。09～11 是旧期中扩展。历史题阅读深度见第 12 章。
逐页主题清单#
ICS01-overview-20260907#
| PDF 页 | 页内主题 / 内容起始 | 正文回查 |
|---|---|---|
| 1 | Course Overview 课程概述 · 1st Lecture, Sep 7, 2026 第一讲，2026年9月7日 | 01 |
| 2 | 主要内容 · ¢ 课程起源 | 01 |
| 3 | 课程起源 · ¢ 创立： | 01 |
| 4 | 合作建设课程 · 课程特点： | 01 |
| 5 | 小班教学的启动 · ¢ 2010-2011 学年，本科班级规模的初步统计 | 01 |
| 6 | 北京大学本科生“研讨型小班教学”试点 · ¢ 2012年秋开展第一批试点 | 01 |
| 7 | 主要内容 · ¢ 课程起源 | 01 |
| 8 | 本课程的教学方式 · ¢ 研讨型教学的两种主要方式 | 01 |
| 9 | 课程安排 · 周次 日期 大班课 主题 日期 小班课 日期 大班课 主题 LAB节点 | 01 |
| 10 | 大班课程安排 · ¢ 上半学期的主体内容 | 01 |
| 11 | 大班课程安排 · ¢ 下半学期的主体内容 | 01 |
| 12 | 课程特点： · 课时多，教学内容多 | 01 |
| 13 | 课程特点： · 大班教学和小班研讨结合 | 01 |
| 14 | 实验题系统 课程特点： · 学生在指定系统上完成实验题 | 01 |
| 15 | 主要内容 · ¢ 课程起源 | 01 |
| 16 | 本课程关注的问题和目标 · ¢ 本课程关注的问题： | 01 |
| 17 | 本课程独特的视角 · ¢ 本课程是从编程者角度出发，描述计算机系统 | 01 |
| 18 | 问题1：整型不是整数，浮点型不是实数 · Ints are not Integers, Floats are not Reals | 01 |
| 19 | 计算机系统中的算术 ≠ 数学中的算术(1/2) · ¢ 整数性质 | 01 |
| 20 | 计算机系统中的算术 ≠ 数学中的算术(2/2) · ¢ 有些性质在计算机系统中并不成立 | 01 |
| 21 | 问题2：了解汇编 (1/4) · You’ve Got to Know Assembly | 01 |
| 22 | 问题2：了解汇编 (2/4) · You’ve Got to Know Assembly | 01 |
| 23 | 问题2：了解汇编 (3/4) · You’ve Got to Know Assembly | 01 |
| 24 | 问题2：了解汇编 (4/4) · You’ve Got to Know Assembly | 01 |
| 25 | 问题3：内存对程序性能的影响至关重要 · Memory Matters Random Access Memory Is | 01 |
| 26 | 内存引用错误 (1/3) · typedef struct { | 01 |
| 27 | 内存引用错误 (2/3) · typedef struct { fun(0) à 3.14 | 01 |
| 28 | 内存引用错误 (3/3) · ¢ C 和 C++ 并没有提供对此类错误的防范机制， | 01 |
| 29 | 问题4：算法性能分析结果 ≠ 实际程序性能 · There’s more to performance than asymptotic | 01 |
| 30 | 内存性能影响程序性能 · void copyij (int src[2048][2048], void copyji (int src[2048][2048], | 01 |
| 31 | 为什么性能有这些差别 · copyij | 01 |
| 32 | 问题5：计算机网络环境下的新问题 · Computers do more than execute programs | 01 |
| 33 | 问题5：计算机网络环境下的新问题 · Computers do more than execute programs | 01 |
| 34 | 主要内容 · ¢ 课程起源 | 01 |
| 35 | 课程主体内容 · ① 程序与数据 Programs and Data | 01 |
| 36 | 一、程序与数据 · Programs and Data (1/2) | 01 |
| 37 | 一、程序与数据 · Programs and Data (2/2) | 01 |
| 38 | 二、处理器体系结构 和 程序性能 · Processor Architecture & Performance | 01 |
| 39 | 三、分级存储器体系 · The Memory Hierarchy | 01 |
| 40 | 四、异常控制流 · Exceptional Control Flow | 01 |
| 41 | 五、虚拟内存 · Virtual Memory | 01 |
| 42 | 六、网络和并发 · Networking, and Concurrency | 01 |
| 43 | 实验题（LAB） · L1 Datalab 位级数据操作实验 | 01 |
| 44 | 每个实验必须独立完成（不得由AI代做） · ¢ 每次LAB都有可能抽查代码重合度，对比对象包 | 01 |
| 45 | 主要内容 · ¢ 课程起源 | 01 |
| 46 | 课程主页 http://course.pku.edu.cn · 课程通知，课后作业等 | 01 |
| 47 | 课程教材 · ¢ Computer Systems: A Programmer's Perspective（3rd Edition） | 01 |
| 48 | 成绩评定占比 · ¢ 期末考试：30分 | 01 |
| 49 | 需要注意的问题 · Q：为什么教学网的小班和安排的不一致？ | 01 |
| 50 | 页脚 / 结束页 | 01 |
ICS02-bits-bytes-ints-20260910#
| PDF 页 | 页内主题 / 内容起始 | 正文回查 |
|---|---|---|
| 1 | Bits, Bytes, and Integers · 2nd Lecture, Sep 10, 2026 | 02 |
| 2 | Today: Bits, Bytes, and Integers · ¢ Representing information as bits | 02 |
| 3 | Binary Representations · ¢ Base 2 Number Representation | 02 |
| 4 | Encoding Byte Values · al y | 02 |
| 5 | Data Representations · C Data Type Typical 32-bit Intel IA32 x86-64 | 02 |
| 6 | Today: Bits, Bytes, and Integers · ¢ Representing information as bits | 02 |
| 7 | Boolean Algebra · ¢ Developed by George Boole in 19th Century | 02 |
| 8 | General Boolean Algebras · ¢ Operate on Bit Vectors | 02 |
| 9 | Example: Representing & Manipulating Sets · ¢ Representation | 02 |
| 10 | Bit-Level Operations in C · ¢ Operations &, /, ~, ^ Available in C | 02 |
| 11 | Contrast: Logic Operations in C · ¢ Contrast to Logical Operators | 02 |
| 12 | Shift Operations · ¢ Left Shift: x << y Argument x 01100010 | 02 |
| 13 | Today: Bits, Bytes, and Integers · ¢ Representing information as bits | 02 |
| 14 | Encoding Integers · Unsigned Two’s Complement | 02 |
| 15 | Two-complement: Simple Example · -16 8 4 2 1 | 02 |
| 16 | Encoding Example (Cont.) · x = 15213: 00111011 01101101 | 02 |
| 17 | Numeric Ranges · ¢ Unsigned Values | 02 |
| 18 | Values for Different Word Sizes · W | 02 |
| 19 | Unsigned & Signed Numeric Values · X B2U(X) B2T(X) ¢ Equivalence | 02 |
| 20 | Today: Bits, Bytes, and Integers · ¢ Representing information as bits | 02 |
| 21 | Mapping Between Signed & Unsigned · Two’s Complement Unsigned | 02 |
| 22 | Mapping Signed « Unsigned · Bits Signed Unsigned | 02 |
| 23 | Mapping Signed « Unsigned · Bits Signed Unsigned | 02 |
| 24 | Relation between Signed & Unsigned · Two’s Complement Unsigned | 02 |
| 25 | Conversion Visualized · ¢ 2’s Comp. ® Unsigned | 02 |
| 26 | Signed vs. Unsigned in C · ¢ Constants | 02 |
| 27 | Casting Surprises · ¢ Expression Evaluation | 02 |
| 28 | Summary · Casting Signed ↔ Unsigned: Basic Rules | 02 |
| 29 | Today: Bits, Bytes, and Integers · ¢ Representing information as bits | 02 |
| 30 | Sign Extension · ¢ Task: | 02 |
| 31 | Sign Extension: Simple Example · Positive number Negative number | 02 |
| 32 | Sign Extension Example · short int x = 15213; | 02 |
| 33 | Truncation: Simple Example · No sign change Sign change | 02 |
| 34 | Summary: · Expanding, Truncating: Basic Rules | 02 |
| 35 | Today: Bits, Bytes, and Integers · ¢ Representing information as bits | 02 |
| 36 | Unsigned Addition · Operands: w bits u ••• | 02 |
| 37 | Unsigned Addition · Operands: w bits u ••• | 02 |
| 38 | Visualizing (Mathematical) Integer Addition · ¢ Integer Addition Add4(u , v) | 02 |
| 39 | Visualizing Unsigned Addition · ¢ Wraps Around Overflow | 02 |
| 40 | Two’s Complement Addition · Operands: w bits u ••• | 02 |
| 41 | TAdd Overflow · ¢ Functionality True Sum | 02 |
| 42 | Visualizing 2’s Complement Addition · NegOver | 02 |
| 43 | Characterizing TAdd · Positive Overflow | 02 |
| 44 | Multiplication · ¢ Goal: Computing Product of w-bit numbers x, y | 02 |
| 45 | Unsigned Multiplication in C · u ••• | 02 |
| 46 | Signed Multiplication in C · u ••• | 02 |
| 47 | Power-of-2 Multiply with Shift · ¢ Operation | 02 |
| 48 | Unsigned Power-of-2 Divide with Shift · ¢ Quotient of Unsigned by Power of 2 | 02 |
| 49 | Today: Bits, Bytes, and Integers · ¢ Representing information as bits | 02 |
| 50 | Arithmetic: Basic Rules · ¢ Addition: | 02 |
| 51 | Why Should I Use Unsigned? · ¢ Don’t use without understanding implications | 02 |
| 52 | Counting Down with Unsigned · ¢ Proper way to use unsigned as loop index | 02 |
| 53 | Why Should I Use Unsigned? (cont.) · ¢ Do Use When Performing Modular Arithmetic | 02 |
| 54 | Today: Bits, Bytes, and Integers · ¢ Representing information as bits | 02 |
| 55 | Byte-Oriented Memory Organization · •0 •F | 02 |
| 56 | Machine Words · ¢ Any given computer has a “Word Size” | 02 |
| 57 | Word-Oriented Memory Organization · 32-bit 64-bit | 02 |
| 58 | Example Data Representations · C Data Type Typical 32-bit Typical 64-bit x86-64 | 02 |
| 59 | Byte Ordering · ¢ So, how are the bytes within a multi-byte word ordered in | 02 |
| 60 | Byte Ordering Example · ¢ Example | 02 |
| 61 | Decimal: 15213 · Representing Integers Binary: 0011 1011 0110 1101 | 02 |
| 62 | Examining Data Representations · ¢ Code to Print Byte Representation of Data | 02 |
| 63 | show_bytes Execution Example · int a = 15213; | 02 |
| 64 | Representing Pointers · int B = -15213; | 02 |
| 65 | Representing Strings · char S[6] = "18213"; | 02 |
| 66 | Reading Byte-Reversed Listings · ¢ Disassembly | 02 |
| 67 | Summary · ¢ Representing information as bits | 02 |
| 68 | Integer C Puzzles · x < 0 Þ ((x*2) < 0) | 02 |
ICS03-float-20260914#
| PDF 页 | 页内主题 / 内容起始 | 正文回查 |
|---|---|---|
| 1 | Floating Point · 3rd Lecture, Sep. 14, 2026 | 03 |
| 2 | Today: Floating Point · ¢ Background: Fractional binary numbers | 03 |
| 3 | Fractional binary numbers · ¢ What is 1011.1012? | 03 |
| 4 | Fractional Binary Numbers · 2i | 03 |
| 5 | Fractional Binary Numbers: Examples · ¢ Value Representation | 03 |
| 6 | Representable Numbers · ¢ Limitation #1 | 03 |
| 7 | Today: Floating Point · ¢ Background: Fractional binary numbers | 03 |
| 8 | IEEE Floating Point · ¢ IEEE Standard 754 | 03 |
| 9 | This is important! · ¢ Ariane 5 explodes on maiden voyage: $500 MILLION dollars lost | 03 |
| 10 | (Binary) Scientific Notation · ¢ What are the parts of a number in scientific notation? | 03 |
| 11 | Floating Point Representation · Example: | 03 |
| 12 | Precision options · ¢ Single precision: 32 bits | 03 |
| 13 | Three “kinds” of floating point numbers · s exp frac | 03 |
| 14 | “Normalized” Values v = (–1)s M 2E · ¢ When: exp ≠ 000…0 and exp ≠ 111…1 | 03 |
| 15 | Normalized Encoding Example v = (–1)s M 2E · E = Exp – Bias | 03 |
| 16 | Denormalized Values v = (–1)s M 2E · E = 1 – Bias | 03 |
| 17 | Special Values · ¢ Condition: exp = 111…1 | 03 |
| 18 | C float Decoding Example v = (–1)s M 2E · E = exp – Bias | 03 |
| 19 | C float Decoding Example #1 v = (–1)s M 2E · E = exp – Bias | 03 |
| 20 | C float Decoding Example #1 v = (–1)s M 2E · E = exp – Bias | 03 |
| 21 | C float Decoding Example #2 v = (–1)s M 2E · E = 1 – Bias | 03 |
| 22 | C float Decoding Example #2 v = (–1)s M 2E · E = 1 – Bias | 03 |
| 23 | Visualization: Floating Point Encodings · −¥ +¥ | 03 |
| 24 | Today: Floating Point · ¢ Background: Fractional binary numbers | 03 |
| 25 | Tiny Floating Point Example · s exp frac | 03 |
| 26 | v = (–1)s M 2E · Dynamic Range (s=0 only) norm: E = exp – Bias | 03 |
| 27 | Distribution of Values · ¢ 6-bit IEEE-like format | 03 |
| 28 | Distribution of Values (close-up view) · ¢ 6-bit IEEE-like format | 03 |
| 29 | Special Properties of the IEEE Encoding · ¢ FP Zero Same as Integer Zero | 03 |
| 30 | Today: Floating Point · ¢ Background: Fractional binary numbers | 03 |
| 31 | Floating Point Operations: Basic Idea · ¢ x +f y = Round(x + y) | 03 |
| 32 | Rounding · ¢ Rounding Modes (illustrate with $ rounding) | 03 |
| 33 | Closer Look at Round-To-Even · ¢ Default Rounding Mode | 03 |
| 34 | Rounding Binary Numbers · ¢ Binary Fractional Numbers | 03 |
| 35 | FP Multiplication · ¢ (–1)s1 M1 2E1 x (–1)s2 M2 2E2 | 03 |
| 36 | Floating Point Addition · ¢ (–1)s1 M1 2E1 + (-1)s2 M2 2E2 | 03 |
| 37 | Mathematical Properties of FP Add · ¢ Compare to those of Abelian Group | 03 |
| 38 | Mathematical Properties of FP Mult · ¢ Compare to Commutative Ring | 03 |
| 39 | Today: Floating Point · ¢ Background: Fractional binary numbers | 03 |
| 40 | Floating Point in C · ¢ C Guarantees Two Levels | 03 |
| 41 | Floating Point Puzzles · ¢ For each of the following C expressions, either: | 03 |
| 42 | Summary · ¢ IEEE Floating Point has clear mathematical properties | 03 |
| 43 | Additional Slides | 03 |
| 44 | Creating Floating Point Number · ¢ Steps s exp frac | 03 |
| 45 | Normalize s exp frac · 1 4-bits 3-bits | 03 |
| 46 | Rounding 1.BBGRXXX · Guard bit: LSB of result | 03 |
| 47 | Postnormalize · ¢ Issue | 03 |
| 48 | Interesting Numbers {single,double} · Description exp frac Numeric Value | 03 |
ICS04-machine-basics-20260917#
| PDF 页 | 页内主题 / 内容起始 | 正文回查 |
|---|---|---|
| 1 | Machine-Level Programming I: Basics · 4th Lecture, Sep. 17, 2026 | 04 |
| 2 | Today: Machine Programming I: Basics · ¢ History of Intel processors and architectures | 04 |
| 3 | Intel x86 Processors · ¢ Dominate laptop/desktop/server market | 04 |
| 4 | Intel x86 Evolution: Milestones · Name Date Transistors MHz | 04 |
| 5 | Intel x86 Processors, cont. · ¢ Machine Evolution | 04 |
| 6 | Intel x86 Processors, cont. · ¢ Past Generations Process technology | 04 |
| 7 | 2018 State of the Art: Coffee Lake · ¢ Mobile Model: Core i7 ¢ Server Model: Xeon E | 04 |
| 8 | x86 Clones: Advanced Micro Devices (AMD) · ¢ Historically | 04 |
| 9 | Intel’s 64-Bit History · ¢ 2001: Intel Attempts Radical Shift from IA32 to IA64 | 04 |
| 10 | Our Coverage · ¢ IA32 | 04 |
| 11 | Today: Machine Programming I: Basics · ¢ History of Intel processors and architectures | 04 |
| 12 | Definitions · ¢ Architecture: (also ISA: instruction set architecture) The | 04 |
| 13 | Assembly/Machine Code View · CPU Memory | 04 |
| 14 | Turning C into Object Code · § Code in files p1.c p2.c | 04 |
| 15 | Compiling Into Assembly · C Code (sum.c) Generated x86-64 Assembly | 04 |
| 16 | What it really looks like · .globl sumstore | 04 |
| 17 | What it really looks like · .globl sumstore | 04 |
| 18 | Assembly Characteristics: Data Types · ¢ “Integer” data of 1, 2, 4, or 8 bytes | 04 |
| 19 | Assembly Characteristics: Operations · ¢ Transfer data between memory and register | 04 |
| 20 | Object Code · Code for sumstore | 04 |
| 21 | Machine Instruction Example · ¢ C Code | 04 |
| 22 | Disassembling Object Code · Disassembled | 04 |
| 23 | Alternate Disassembly · Disassembled | 04 |
| 24 | What Can be Disassembled? · % objdump -d WINWORD.EXE | 04 |
| 25 | Today: Machine Programming I: Basics · ¢ History of Intel processors and architectures | 04 |
| 26 | x86-64 Integer Registers · %rax %eax %r8 %r8d | 04 |
| 27 | Some History: IA32 Registers Origin · (mostly obsolete) | 04 |
| 28 | Moving Data %rax · ¢ Moving Data %rcx | 04 |
| 29 | movq Operand Combinations · Source Dest Src,Dest C Analog | 04 |
| 30 | Simple Memory Addressing Modes · ¢ Normal (R) Mem[Reg[R]] | 04 |
| 31 | Example of Simple Addressing Modes · void swap | 04 |
| 32 | Understanding Swap() · Memory | 04 |
| 33 | Understanding Swap() · Memory | 04 |
| 34 | Understanding Swap() · Memory | 04 |
| 35 | Understanding Swap() · Memory | 04 |
| 36 | Understanding Swap() · Memory | 04 |
| 37 | Understanding Swap() · Memory | 04 |
| 38 | Simple Memory Addressing Modes · ¢ Normal (R) Mem[Reg[R]] | 04 |
| 39 | Complete Memory Addressing Modes · ¢ Most General Form | 04 |
| 40 | Address Computation Examples · %rdx 0xf000 | 04 |
| 41 | Today: Machine Programming I: Basics · ¢ History of Intel processors and architectures | 04 |
| 42 | Address Computation Instruction · ¢ leaq Src, Dst | 04 |
| 43 | Some Arithmetic Operations · ¢ Two Operand Instructions: | 04 |
| 44 | Some Arithmetic Operations · ¢ One Operand Instructions | 04 |
| 45 | Arithmetic Expression Example · arith: | 04 |
| 46 | Understanding Arithmetic Expression · Example arith: | 04 |
| 47 | Machine Programming I: Summary · ¢ History of Intel processors and architectures | 04 |
ICS05-machine-control-20260921#
| PDF 页 | 页内主题 / 内容起始 | 正文回查 |
|---|---|---|
| 1 | Machine-Level Programming II: Control · 5th Lecture, Sep. 21, 2026 | 05 |
| 2 | Recall: ISA = Assembly/Machine Code View · CPU Memory | 05 |
| 3 | Recall: Turning C into Object Code · § Code in files p1.c p2.c | 05 |
| 4 | Recall: Move & Arithmetic Operations · ¢ Some Two Operand Instructions: | 05 |
| 5 | Recall: Addressing Modes · ¢ Most General Form | 05 |
| 6 | Memory operands and LEA · ¢ In most instructions, a memory operand accesses memory | 05 |
| 7 | Why use LEA? · ¢ CPU designers’ intended use: calculate a pointer to an object | 05 |
| 8 | Sidebar: instruction suffixes · ¢ Most x86 instructions can be written with or without a | 05 |
| 9 | Today · ¢ Control: Condition codes | 05 |
| 10 | Control flow · extern void op1(void); | 05 |
| 11 | Control flow in assembly language · extern void op1(void); decision: | 05 |
| 12 | Control flow in assembly language · extern void op1(void); decision: | 05 |
| 13 | Processor State (x86-64, Partial) · ¢ Information about | 05 |
| 14 | Condition Codes (Implicit Setting) · ¢ Single bit registers | 05 |
| 15 | ZF set when · 000000000000…00000000000 | 05 |
| 16 | SF set when · yxxxxxxxxxxxx... | 05 |
| 17 | CF set when · 1xxxxxxxxxxxx... | 05 |
| 18 | OF set when · yxxxxxxxxxxxx... a | 05 |
| 19 | Condition Codes (Explicit Setting: Compare) · ¢ Explicit Setting by Compare Instruction | 05 |
| 20 | Condition Codes (Explicit Setting: Test) · ¢ Explicit Setting by Test instruction | 05 |
| 21 | Reading Condition Codes · ¢ SetX Instructions | 05 |
| 22 | Example: setl (Signed <) · ¢ Condition: SF^OF | 05 |
| 23 | x86-64 Integer Registers · %rax %al %r8 %r8b | 05 |
| 24 | Reading Condition Codes (Cont.) · ¢ SetX Instructions: | 05 |
| 25 | Explicit Reading Condition Codes (Cont.) · SetX Instructions: | 05 |
| 26 | Today · ¢ Control: Condition codes | 05 |
| 27 | Jumping · ¢ jX Instructions | 05 |
| 28 | Conditional Branch Example (Old Style) · ¢ Generation Get to this shortly | 05 |
| 29 | Expressing with Goto Code · ¢ C allows goto statement | 05 |
| 30 | General Conditional Expression · Translation (Using Branches) | 05 |
| 31 | Using Conditional Moves · ¢ Conditional Move Instructions | 05 |
| 32 | Conditional Move Example · long absdiff | 05 |
| 33 | Bad Cases for Conditional Move · Expensive Computations | 05 |
| 34 | Exercise · SetX Condition Description | 05 |
| 35 | Exercise · SetX Condition Description | 05 |
| 36 | Today · ¢ Control: Condition codes | 05 |
| 37 | “Do-While” Loop Example · C Code Goto Version | 05 |
| 38 | General “Do-While” Translation · C Code Goto Version | 05 |
| 39 | “Do-While” Loop Compilation · Goto Version | 05 |
| 40 | General “While” Translation #1 · ¢ “Jump-to-middle” translation | 05 |
| 41 | While Loop Example #1 · C Code Jump to Middle | 05 |
| 42 | General “While” Translation #2 · While version | 05 |
| 43 | While Loop Example #2 · C Code Do-While Version | 05 |
| 44 | “For” Loop Form Init · General Form i = 0 | 05 |
| 45 | “For” Loop à While Loop · For Version | 05 |
| 46 | For-While Conversion · long pcount_for_while | 05 |
| 47 | “For” Loop Do-While Conversion · Goto Version | 05 |
| 48 | Today · ¢ Control: Condition codes | 05 |
| 49 | long switch_eg · (long x, long y, long z) Switch Statement | 05 |
| 50 | Jump Table Structure · Switch Form Jump Table Jump Targets | 05 |
| 51 | Switch Statement Example · long switch_eg(long x, long y, long z) | 05 |
| 52 | Switch Statement Example · long switch_eg(long x, long y, long z) | 05 |
| 53 | Assembly Setup Explanation · ¢ Table Structure Jump table | 05 |
| 54 | Jump Table · Jump table | 05 |
| 55 | Code Blocks (x == 1) · switch(x) { .L3: | 05 |
| 56 | Handling Fall-Through · long w = 1; | 05 |
| 57 | Code Blocks (x == 2, x == 3) · .L5: # Case 2 | 05 |
| 58 | Code Blocks (x == 5, x == 6, default) · switch(x) { .L7: # Case 5,6 | 05 |
| 59 | Summarizing · ¢ C Control | 05 |
| 60 | Summary · ¢ Today | 05 |
| 61 | Additional Slides | 05 |
| 62 | Finding Jump Table in Binary · 00000000004005e0 <switch_eg>: | 05 |
| 63 | Finding Jump Table in Binary (cont.) · 00000000004005e0 <switch_eg>: | 05 |
| 64 | Finding Jump Table in Binary (cont.) · % gdb switch | 05 |
ICS06-machine-procedures-20260924#
| PDF 页 | 页内主题 / 内容起始 | 正文回查 |
|---|---|---|
| 1 | Machine-Level Programming III: · Procedures | 06 |
| 2 | Objectives · ¢ Basic functionality of the pairs: push / pop and call / ret | 06 |
| 3 | Today · ¢ Procedures | 06 |
| 4 | Mechanisms in Procedures · P(…) { | 06 |
| 5 | Mechanisms in Procedures · P(…) { | 06 |
| 6 | Mechanisms in Procedures · P(…) { | 06 |
| 7 | Mechanisms in Procedures · P(…) { | 06 |
| 8 | Mechanisms in Procedures · P(…) { | 06 |
| 9 | Today · ¢ Procedures | 06 |
| 10 | x86-64 Stack · ¢ Region of memory managed | 06 |
| 11 | x86-64 Stack · ¢ Region of memory Stack “Bottom” | 06 |
| 12 | x86-64 Stack · ¢ Region of memory managed | 06 |
| 13 | x86-64 Stack: Push · ¢ pushq Src | 06 |
| 14 | x86-64 Stack: Push · ¢ pushq Src | 06 |
| 15 | x86-64 Stack: Pop · ¢ popq Dest Stack “Bottom” | 06 |
| 16 | x86-64 Stack: Pop · ¢ popq Dest Stack “Bottom” | 06 |
| 17 | x86-64 Stack: Pop · ¢ popq Dest Stack “Bottom” | 06 |
| 18 | Today · ¢ Procedures | 06 |
| 19 | void multstore · (long x, long y, long *dest) Code Examples | 06 |
| 20 | Procedure Control Flow · ¢ Use stack to support procedure call and return | 06 |
| 21 | Control Flow Example #1 • · 0000000000400540 <multstore>: | 06 |
| 22 | Control Flow Example #2 • · 0000000000400540 <multstore>: | 06 |
| 23 | Control Flow Example #3 • · 0000000000400540 <multstore>: | 06 |
| 24 | Control Flow Example #4 • · 0000000000400540 <multstore>: | 06 |
| 25 | Today · ¢ Procedures | 06 |
| 26 | Procedure Data Flow · Registers Stack | 06 |
| 27 | void multstore · Data Flow (long x, long y, long *dest) | 06 |
| 28 | Today · ¢ Procedures | 06 |
| 29 | Stack-Based Languages · ¢ Languages that support recursion | 06 |
| 30 | Call Chain Example · Example | 06 |
| 31 | Stack Frames Previous · Frame | 06 |
| 32 | Stack · Example | 06 |
| 33 | Stack · Example | 06 |
| 34 | Stack · Example | 06 |
| 35 | Stack · Example | 06 |
| 36 | Stack · Example | 06 |
| 37 | Stack · Example | 06 |
| 38 | Stack · Example | 06 |
| 39 | Stack · Example | 06 |
| 40 | Stack · Example | 06 |
| 41 | Stack · Example | 06 |
| 42 | Stack · Example | 06 |
| 43 | x86-64/Linux Stack Frame · ¢ Current Stack Frame (“Top” to | 06 |
| 44 | Example: incr · long incr(long *p, long val) { | 06 |
| 45 | Example: Calling incr #1 · Initial Stack Structure | 06 |
| 46 | Example: Calling incr #2 · Stack Structure | 06 |
| 47 | Example: Calling incr #2 · Stack Structure | 06 |
| 48 | Example: Calling incr #2 · Stack Structure | 06 |
| 49 | Example: Calling incr #3a Stack Structure · long call_incr() { | 06 |
| 50 | Example: Calling incr #3b Stack Structure · long call_incr() { | 06 |
| 51 | Example: Calling incr #4 Stack Structure · long call_incr() { | 06 |
| 52 | Example: Calling incr #5a Stack Structure · long call_incr() { | 06 |
| 53 | Example: Calling incr #5b · long call_incr() { Updated Stack Structure | 06 |
| 54 | Register Saving Conventions · ¢ When procedure yoo calls who: | 06 |
| 55 | Register Saving Conventions · ¢ When procedure yoo calls who: | 06 |
| 56 | x86-64 Linux Register Usage #1 · ¢ %rax Return value %rax | 06 |
| 57 | x86-64 Linux Register Usage #2 · ¢ %rbx, %r12, %r13, %r14 %rbx | 06 |
| 58 | Callee-Saved Example #1 · Initial Stack Structure | 06 |
| 59 | Callee-Saved Example #2 · Initial Stack Structure | 06 |
| 60 | Callee-Saved Example #3 · Initial Stack Structure | 06 |
| 61 | Callee-Saved Example #4 Stack Structure · long call_incr2(long x) { | 06 |
| 62 | Callee-Saved Example #5 Stack Structure · long call_incr2(long x) { | 06 |
| 63 | Callee-Saved Example #6 Stack Structure · long call_incr2(long x) { | 06 |
| 64 | Callee-Saved Example #7 Stack Structure · long call_incr2(long x) { | 06 |
| 65 | Callee-Saved Example #8 Initial Stack Structure · long call_incr2(long x) { | 06 |
| 66 | Today · ¢ Procedures | 06 |
| 67 | Recursive Function pcount_r: · movl $0, %eax | 06 |
| 68 | Recursive Function Terminal Case · /* Recursive popcount */ pcount_r: | 06 |
| 69 | Recursive Function Register Save · pcount_r: | 06 |
| 70 | Recursive Function Call Setup · /* Recursive popcount */ pcount_r: | 06 |
| 71 | Recursive Function Call · /* Recursive popcount */ pcount_r: | 06 |
| 72 | Recursive Function Result · /* Recursive popcount */ pcount_r: | 06 |
| 73 | Recursive Function Completion · pcount_r: | 06 |
| 74 | Observations About Recursion · ¢ Handled Without Special Consideration | 06 |
| 75 | x86-64 Procedure Summary · ¢ Important Points | 06 |
ICS07-machine-data-20260928#
| PDF 页 | 页内主题 / 内容起始 | 正文回查 |
|---|---|---|
| 1 | Machine-Level Programming IV: · Data | 07 |
| 2 | Today · ¢ Arrays | 07 |
| 3 | Array Allocation · ¢ Basic Principle | 07 |
| 4 | Array Access · ¢ Basic Principle | 07 |
| 5 | Array Access · ¢ Basic Principle | 07 |
| 6 | Array Access · ¢ Basic Principle | 07 |
| 7 | Array Example · #define ZLEN 5 | 07 |
| 8 | Array Accessing Example · zip_dig cmu; 1 5 2 1 3 | 07 |
| 9 | Array Loop Example · void zincr(zip_dig z) { | 07 |
| 10 | Multidimensional (Nested) Arrays · ¢ Declaration A[0][0] • • • A[0][C-1] | 07 |
| 11 | Nested Array Example · #define PCOUNT 4 | 07 |
| 12 | Nested Array Row Access · ¢ Row Vectors | 07 |
| 13 | Nested Array Row Access Code · 1 5 2 0 6 1 5 2 1 3 1 5 2 1 7 1 5 2 2 1 | 07 |
| 14 | Nested Array Element Access · ¢ Array Elements | 07 |
| 15 | Nested Array Element Access Code · 1 5 2 0 6 1 5 2 1 3 1 5 2 1 7 1 5 2 2 1 | 07 |
| 16 | Multi-Level Array Example · zip_dig cmu = { 1, 5, 2, 1, 3 }; ¢ Variable univ denotes | 07 |
| 17 | Element Access in Multi-Level Array · int get_univ_digit | 07 |
| 18 | Array Element Accesses · Nested array Multi-level array | 07 |
| 19 | N X N Matrix #define N 16 · typedef int fix_matrix[N][N]; | 07 |
| 20 | 16 X 16 Matrix Access · ¢ Array Elements | 07 |
| 21 | n X n Matrix Access · ¢ Array Elements | 07 |
| 22 | Example: Array Access · #include <stdio.h> | 07 |
| 23 | Example: Array Access · #include <stdio.h> | 07 |
| 24 | Today · ¢ Arrays | 07 |
| 25 | Structure Representation · r | 07 |
| 26 | Generating Pointer to Structure Member · r r+4*idx | 07 |
| 27 | struct rec { · Following Linked List int a[4]; | 07 |
| 28 | Structures & Alignment · ¢ Unaligned Data struct S1 { | 07 |
| 29 | Alignment Principles · ¢ Aligned Data | 07 |
| 30 | Specific Cases of Alignment (x86-64) · ¢ 1 byte: char, … | 07 |
| 31 | Satisfying Alignment with Structures · ¢ Within structure: struct S1 { | 07 |
| 32 | Meeting Overall Alignment Requirement · ¢ For largest alignment requirement K struct S2 { | 07 |
| 33 | Arrays of Structures · struct S2 { | 07 |
| 34 | Accessing Array Elements struct S3 { · short i; | 07 |
| 35 | Saving Space · ¢ Put large data types first | 07 |
| 36 | Today · ¢ Arrays | 07 |
| 37 | Background · ¢ History | 07 |
| 38 | Programming with SSE3 · XMM Registers | 07 |
| 39 | Scalar & SIMD Operations · n Scalar Operations: Single Precision addss %xmm0,%xmm1 | 07 |
| 40 | FP Basics · ¢ Arguments passed in %xmm0, %xmm1, ... | 07 |
| 41 | FP Memory Referencing · ¢ Integer (and pointer) arguments passed in regular registers | 07 |
| 42 | Other Aspects of FP Code · ¢ Lots of instructions | 07 |
| 43 | Summary · ¢ Arrays | 07 |
| 44 | Additional Slides | 07 |
| 45 | Understanding Pointers & Arrays #1 · Decl An *An | 07 |
| 46 | Understanding Pointers & Arrays #1 · Decl An *An | 07 |
| 47 | Understanding Pointers & Arrays #2 · Decl An *An **An | 07 |
| 48 | Understanding Pointers & Arrays #2 · Decl An *An **An | 07 |
| 49 | Understanding Pointers & Arrays #3 · Decl An *An **An | 07 |
| 50 | Allocated pointer Declaration · Allocated pointer to unallocated int | 07 |
| 51 | Understanding Pointers & Arrays #3 · Decl An *An **An | 07 |
可核对的外部来源#
- 指定 GitHub 仓库：公开试卷、2024 勘误、复习细节。作者也提醒笔记可能有错误，本手册已单列纠正。
- CS:APP 第 3 版官方勘误：用于核对移位、扩展等细节；可继续到其中文版勘误链接。
- Intel 官方手册：指令的最终机器语义参考。
- System V AMD64 ABI 项目：Linux x86-64 调用与类型布局参考。
- Microsoft x64 ABI：Windows 对比。
使用与维护#
知识点使用原创表述与重新推导的例子；题目仅给出处、题号、页码与解法导向。网站没有发布扫描教材和课堂 PDF。更新时优先补新的课件，再更新正文和此清单；考试政策以教师最新通知为准。
已知限制#
- 尚缺第 8 讲课件以及当前考试最终通知。
- 2014 旧卷存在 OCR 乱码，精确作答应看原始 PDF。
- 早年卷仅完成题型浏览，没有对所有标准答案做独立验算。
- 部分开放调研（如最新 CPU 产品排行）不属于稳定知识，这里解释比较方法而不编造当前市场表。
- 课堂口头补充不在本地文件中，未纳入“已覆盖”的承诺。