算术与逻辑运算
学习对寄存器和内存中的数据执行基本算术运算(ADD、SUB、MUL、DIV)和逻辑运算(AND、OR、XOR、NOT)。
算术与逻辑运算 是 CoddyKit 上的免费 Assembly Language & x86 Low-Level Systems Programming 课时。 这是第 2 节课,共 4 节。 你可以在下方免费阅读本课时的完整内容 — 然后在浏览器中使用内置代码编辑器和全天候 AI 导师进行实践。 这是 Assembly Language & x86 Low-Level Systems Programming 学习路径的一部分,你的进度在网页和 CoddyKit 应用中同步。 Assembly Language & x86 Low-Level Systems Programming 课程共包含 4 节课。
本课时的部分内容尚未翻译,以英文显示。
Intro to Assembly Ops
Welcome to the world of x86 Assembly's core operations! Today, we'll learn how CPUs perform basic math and logic.
These instructions are fundamental. They allow your programs to calculate values, make decisions, and manipulate data at the lowest level.
Addition: The ADD Instruction
The ADD instruction is used to add two numbers. It takes two operands: a destination and a source.
- Syntax:
ADD destination, source - The
sourcevalue is added to thedestinationvalue. - The result is stored back in the
destinationoperand. - Operands can be registers, memory locations, or immediate values (constants).
For example, ADD EAX, EBX adds the value in EBX to EAX, storing the sum in EAX.
ADD in Action
Let's see ADD in a simple program. We'll add 3 to 5, storing the result in the EAX register.
Try running this example:
section .text
global _start
_start:
mov eax, 5 ; Load 5 into EAX
add eax, 3 ; Add 3 to EAX (EAX becomes 8)
; Exit the program (Linux 32-bit syscall)
mov eax, 1 ; sys_exit syscall number
xor ebx, ebx ; Exit code 0
int 0x80 ; Call kernelSubtraction: The SUB Instruction
The SUB instruction is the opposite of ADD. It subtracts the source operand from the destination operand.
- Syntax:
SUB destination, source - The
sourcevalue is subtracted from thedestinationvalue. - The result is stored back in the
destinationoperand.
Like ADD, SUB can use registers, memory, or immediate values as operands. It's essential for basic arithmetic and comparisons.
SUB in Action
Here's SUB at work. We'll load 10 into EAX and then subtract 4 from it.
Run this code to see the subtraction:
section .text
global _start
_start:
mov eax, 10 ; Load 10 into EAX
sub eax, 4 ; Subtract 4 from EAX (EAX becomes 6)
; Exit the program (Linux 32-bit syscall)
mov eax, 1 ; sys_exit syscall number
xor ebx, ebx ; Exit code 0
int 0x80 ; Call kernelMultiplication: MUL & IMUL
Multiplication in x86 Assembly uses MUL for unsigned numbers and IMUL for signed numbers.
MULandIMULoften use theAX,EAX, orRAXregister implicitly as one operand.- For 32-bit multiplication, if you multiply a value in
EAXby another register (e.g.,EBX), the 64-bit result is stored across two registers: the lower 32 bits inEAXand the higher 32 bits inEDX.
Always remember to consider the size of your operands and the potential size of the result!
Multiplication Example
Let's multiply 5 by 6 using MUL. The result will be 30.
After execution, EAX will hold the lower part of the result, and EDX will hold the higher part (which will be 0 in this case).
section .text
global _start
_start:
mov eax, 5 ; Load 5 into EAX
mov ebx, 6 ; Load 6 into EBX
mul ebx ; Multiply EAX by EBX. Result in EDX:EAX
; EAX will be 30, EDX will be 0
; Exit the program (Linux 32-bit syscall)
mov eax, 1 ; sys_exit syscall number
xor ebx, ebx ; Exit code 0
int 0x80 ; Call kernelDivision: DIV & IDIV
Division is handled by DIV (unsigned) and IDIV (signed). These instructions are a bit more complex.
- For 32-bit division, the dividend (number to be divided) is expected to be in
EDX:EAX(EDXholds the high 32 bits,EAXholds the low 32 bits). - The divisor is specified as an operand (e.g., a register or memory location).
- After division, the quotient (result) is stored in
EAX, and the remainder is stored inEDX.
Always ensure EDX is correctly set (often cleared to 0) before an unsigned division if your dividend fits in EAX.
Division Example
Let's divide 10 by 3. We expect a quotient of 3 and a remainder of 1.
Observe how EDX is cleared before the division, as our dividend (10) fits entirely within EAX.
section .text
global _start
_start:
mov eax, 10 ; Load 10 into EAX (low part of dividend)
mov edx, 0 ; Clear EDX (high part of dividend for 32-bit)
mov ebx, 3 ; Load 3 into EBX (divisor)
div ebx ; Divide EDX:EAX by EBX.
; Quotient in EAX (3), Remainder in EDX (1)
; Exit the program (Linux 32-bit syscall)
mov eax, 1 ; sys_exit syscall number
xor ebx, ebx ; Exit code 0
int 0x80 ; Call kernelBitwise Logic: AND, OR, XOR, NOT
Beyond arithmetic, assembly excels at bitwise operations. These instructions manipulate individual bits within a number.
AND: Sets a bit if both corresponding bits are 1. Useful for masking bits.OR: Sets a bit if at least one corresponding bit is 1. Useful for setting specific bits.XOR: Sets a bit if corresponding bits are different. Useful for toggling bits or quickly clearing a register (e.g.,XOR EAX, EAX).NOT: Inverts all bits (flips 0s to 1s, and 1s to 0s). This is a unary operation (takes one operand).
These are crucial for low-level control, flags, and data manipulation.
Quick Check: Bitwise Ops
Consider the following assembly snippet:
mov al, 0b11001010
and al, 0b00001111What will be the final value stored in the AL register after these instructions execute?
Recap: Fundamental Operations
Great job! You've learned the essential arithmetic and bitwise logic operations in x86 Assembly.
- Arithmetic:
ADD,SUB,MUL/IMUL,DIV/IDIVperform calculations. - Logic:
AND,OR,XOR,NOTmanipulate individual bits for masking, setting, toggling, and inverting.
These instructions are the building blocks for complex programs, enabling your CPU to process data and make decisions effectively. Keep practicing!
常见问题解答
「算术与逻辑运算」课时是免费的吗?
是的 — 「算术与逻辑运算」的完整文本可在网页上免费阅读。要进行交互式练习(内置代码编辑器和全天候 AI 导师)并解锁 Assembly Language & x86 Low-Level Systems Programming 课程的其余内容,请升级到 CoddyKit PRO。 Assembly Language & x86 Low-Level Systems Programming 课程共包含 4 节课。
「算术与逻辑运算」这节课中我会学到什么?
学习对寄存器和内存中的数据执行基本算术运算(ADD、SUB、MUL、DIV)和逻辑运算(AND、OR、XOR、NOT)。 你通过在浏览器中直接运行的动手代码来练习 Assembly Language & x86 Low-Level Systems Programming,全天候 AI 导师会在你学习这节课的过程中回答你的问题。
学习 Assembly Language & x86 Low-Level Systems Programming 需要有经验吗?
无需任何先前经验。CoddyKit 上的 Assembly Language & x86 Low-Level Systems Programming 课程适合初学者到高级学习者,你可以从这里开始或从头开始,按照自己的节奏学习。 这是第 2 节课,共 4 节。
「算术与逻辑运算」课时需要多长时间?
大多数 CoddyKit 课程大约需要 5–10 分钟。每节课都很精短且互动,所以你能稳步进步,并在网页和应用中从离开的地方继续。
我能在这节 Assembly Language & x86 Low-Level Systems Programming 课中编写并运行代码吗?
能。每节 Assembly Language & x86 Low-Level Systems Programming 课都包含内置代码编辑器,你可以在浏览器中直接编写并运行真实代码,并获得即时 AI 反馈 — 无需本地设置。