การควบคุมลำดับการทำงานและการเรียกฟังก์ชัน

In assembly, instructions usually run one after another. This is called sequential execution. But real programs need to make decisions, repeat actions, and call functions.

This is where control flow comes in! It's how a program changes its execution path based on conditions, creating loops and calling subroutines.

Conditional jumps are like if statements in high-level languages. They let your program execute different code blocks based on a condition.

The CMP instruction compares two values and sets CPU flags. Then, jump instructions like JE (Jump if Equal) or JNE (Jump if Not Equal) check these flags to decide whether to jump.

Beyond JE and JNE, many other conditional jump instructions exist to handle different comparisons:

• JG: Jump if Greater
• JL: Jump if Less
• JGE: Jump if Greater or Equal
• JLE: Jump if Less or Equal
• JZ: Jump if Zero (often used after CMP or arithmetic)
• JNZ: Jump if Not Zero

These instructions interpret the CPU's flags register, which stores the results of previous operations.

You can create loops using conditional jumps. A loop typically involves:

1. An initialization (e.g., setting a counter).
2. A condition check (using CMP and a conditional jump).
3. The loop body (instructions to repeat).
4. An update (e.g., incrementing the counter).
5. An unconditional jump back to the condition check.

The stack is a crucial memory region used for temporary storage, especially during function calls. It operates on a LIFO (Last-In, First-Out) principle.

Think of it like a stack of plates: you can only add a new plate to the top (PUSH) or remove the top plate (POP).

• PUSH: Decreases the stack pointer (ESP/RSP) and places data on the stack.
• POP: Retrieves data from the top of the stack and increases the stack pointer.

When a program needs to execute a separate block of code (a function or subroutine), it uses the CALL instruction. This is fundamental for modular programming.

• The CALL instruction first pushes the return address (the address of the instruction immediately following CALL) onto the stack.
• Then, it jumps unconditionally to the target function's entry point.
• The RET instruction, typically found at the end of a function, pops the return address from the stack and jumps back to that address, resuming execution in the caller.

How do functions receive input? In x86/x64 assembly, arguments are often passed via the stack or registers.

When using the stack, arguments are pushed onto the stack by the caller before the CALL instruction. The called function then accesses these arguments relative to the stack pointer (ESP/RSP) or base pointer (EBP/RBP).

The calling convention dictates the order and method of argument passing.

Functions also need space for their own local variables. This space is allocated on the stack within what's called a stack frame.

A stack frame is typically established by:

1. Saving the old base pointer (PUSH EBP/RBP).
2. Setting the new base pointer to the current stack pointer (MOV EBP, ESP/RBP, RSP).
3. Allocating space for local variables (SUB ESP, size).

The base pointer (EBP/RBP) provides a stable reference point to access arguments and local variables within the current function.

Let's see a simple C function and understand how its call, arguments, and local variables relate to assembly and the stack.

When main calls calculate_sum, the arguments 15 and 25 are pushed onto the stack. Inside calculate_sum, space for local_var is allocated on the stack. The function's return value is typically placed in a register like EAX.

Understanding the stack's role in function calls is crucial for reverse engineering.

Which of the following actions occur when an x86/x64 CALL instruction is executed?

Great job! You've learned how programs make decisions and execute functions in assembly.

• Conditional Jumps (JE, JNE, JG, etc.) combined with CMP enable if statements and loops.
• The Stack is a LIFO structure critical for temporary data, managed by PUSH and POP.
• Function Calls use CALL to push the return address and jump, and RET to pop it and return.
• Arguments and local variables are often handled via the stack within a function's stack frame.

Understanding these concepts is vital for tracing program execution and analyzing binaries!