Operações aritméticas e lógicas
Aprenda a executar operações aritméticas básicas (ADD, SUB, MUL, DIV) e lógicas (AND, OR, XOR, NOT) sobre dados em registradores e na memória.
Operações aritméticas e lógicas é uma aula grátis de Assembly Language & x86 Low-Level Systems Programming no CoddyKit. Esta é a aula 2 de 4. Você pode ler a aula completa abaixo gratuitamente — depois pratica ao vivo no navegador com um editor de código integrado e um tutor de IA 24/7. Faz parte do caminho de aprendizado de Assembly Language & x86 Low-Level Systems Programming, e seu progresso é sincronizado entre a web e o app CoddyKit. O curso de Assembly Language & x86 Low-Level Systems Programming inclui 4 aulas no total.
Partes desta aula ainda não foram traduzidas e aparecem em inglês.
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!
Aprenda Assembly com um tutor de IA — grátis
Escreva e execute código real no seu navegador, obtenha ajuda instantânea de um tutor de IA 24/7 e continue de onde parou na web ou no app.
- Cursos
- 12
- Aulas
- 48
Perguntas Frequentes
A aula “Operações aritméticas e lógicas” é grátis?
Sim — o texto completo de “Operações aritméticas e lógicas” é grátis para ler aqui na web. Para praticá-la interativamente (um editor de código integrado e um tutor de IA 24/7) e desbloquear o restante do curso de Assembly Language & x86 Low-Level Systems Programming, atualize para CoddyKit PRO. O curso de Assembly Language & x86 Low-Level Systems Programming inclui 4 aulas no total.
O que vou aprender em “Operações aritméticas e lógicas”?
Aprenda a executar operações aritméticas básicas (ADD, SUB, MUL, DIV) e lógicas (AND, OR, XOR, NOT) sobre dados em registradores e na memória. Você pratica Assembly Language & x86 Low-Level Systems Programming com código prático que executa diretamente no navegador, e um tutor de IA 24/7 responde suas dúvidas enquanto trabalha na aula.
Preciso ter experiência prévia para começar Assembly Language & x86 Low-Level Systems Programming?
Nenhuma experiência prévia é necessária. Assembly Language & x86 Low-Level Systems Programming no CoddyKit é estruturado para alunos iniciantes até avançados, então você pode começar aqui ou desde o início e aprender no seu ritmo. Esta é a aula 2 de 4.
Quanto tempo leva a aula “Operações aritméticas e lógicas”?
A maioria das aulas CoddyKit leva cerca de 5–10 minutos. Cada uma é compacta e interativa, então você faz progresso constante e retoma exatamente de onde parou entre web e app.
Posso escrever e executar código nesta aula de Assembly Language & x86 Low-Level Systems Programming?
Sim. Cada aula de Assembly Language & x86 Low-Level Systems Programming inclui um editor de código integrado, então você escreve e executa código real direto no navegador e recebe feedback de IA instantaneamente — nenhuma configuração local necessária.
Todas as aulas deste curso
- Instruções de movimentação de dados (MOV, PUSH, POP)
- Operações aritméticas e lógicas
- Saltos condicionais e laços
- Instruções bit a bit e de deslocamento