Reverse Engineering & Binary Analysis Basics · Lesson

Control Flow and Function Calls

Learn about conditional jumps, loops, and the mechanics of function calls, including stack usage.

Control Flow and Function Calls is a free Reverse Engineering & Binary Analysis Basics lesson on CoddyKit — lesson 3 of 4. You can read the complete lesson below for free — then practise it hands-on in the browser with a built-in code editor and a 24/7 AI tutor. It is part of the Reverse Engineering & Binary Analysis Basics learning path, one of 4 lessons in the course, and your progress syncs across the web and the CoddyKit app.

Control Flow: Making Programs Smart

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: If-Statements

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.

; Example: if (EAX == EBX) goto equal_label;
MOV EAX, 10
MOV EBX, 10
CMP EAX, EBX    ; Compare EAX and EBX
JE  equal_label ; Jump if Equal
; Code here runs if EAX != EBX
JMP end_label

equal_label:
; Code here runs if EAX == EBX

end_label:
; Program continues

More Jump Conditions

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.

Building Loops in Assembly

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

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

; Example: int i = 0; while (i < 3) { i++; }
MOV ECX, 0      ; Initialize counter i = 0

loop_start:
CMP ECX, 3      ; Compare i with 3
JGE loop_end    ; Jump if i >= 3 (exit loop)

INC ECX         ; Increment i
JMP loop_start  ; Jump back to loop_start

loop_end:
; Loop has finished, continue here

The Stack: LIFO Storage

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.

Function Calls: CALL and RET

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.

; Caller code:
; ... instructions
CALL my_function ; Calls the function
; ... execution continues here after my_function returns

; my_function definition:
my_function:
; ... function's body instructions
RET              ; Returns to the caller

Passing Arguments to Functions

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.

Local Variables and the Stack Frame

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:

Saving the old base pointer (PUSH EBP/RBP).
Setting the new base pointer to the current stack pointer (MOV EBP, ESP/RBP, RSP).
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.

Function Call Walkthrough

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.

#include <stdio.h>

int calculate_sum(int a, int b) {
  int local_var = a + b; // Local variable on stack
  return local_var;
}

int main() {
  int result = calculate_sum(15, 25);
  printf("Result: %d\n", result);
  return 0;
}

Quick Check: Function Calls

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?

Recap: Control Flow & Functions

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!

Frequently asked questions

Is the “Control Flow and Function Calls” lesson free?

Yes — the full text of “Control Flow and Function Calls” is free to read here on the web, and the Reverse Engineering & Binary Analysis Basics course includes 4 lessons in total. To practise it interactively (a built-in code editor and a 24/7 AI tutor) and unlock the rest of the Reverse Engineering & Binary Analysis Basics course, upgrade to CoddyKit PRO.

What will I learn in “Control Flow and Function Calls”?

Learn about conditional jumps, loops, and the mechanics of function calls, including stack usage. You practise Reverse Engineering & Binary Analysis Basics with hands-on code you run directly in the browser, and a 24/7 AI tutor answers your questions as you work through the lesson.

Do I need any experience to start Reverse Engineering & Binary Analysis Basics?

No prior experience is required. Reverse Engineering & Binary Analysis Basics on CoddyKit is structured for beginners through advanced learners; this is — lesson 3 of 4, so you can start here or from the beginning and move at your own pace.

How long does the “Control Flow and Function Calls” lesson take?

Most CoddyKit lessons take about 5–10 minutes. Each one is bite-sized and interactive, so you make steady progress and pick up exactly where you left off across the web and the app.

Can I write and run code in this Reverse Engineering & Binary Analysis Basics lesson?

Yes. Every Reverse Engineering & Binary Analysis Basics lesson includes a built-in code editor, so you write and run real code right in your browser and get instant AI feedback — no local setup required.

All lessons in this course

← Back to Reverse Engineering & Binary Analysis Basics