Functions in C Programming (Modularity & Scope)

Functions are the fundamental building blocks of structured C programming. They allow developers to divide complex software into modular, testable, and reusable logic units. Mastering function prototypes, stack activation frames, parameter passing mechanics, and recursion is essential for writing robust systems-level code.

1. Anatomy of a C Function and Function Prototypes

Every C function is defined by four core components: return type, function name, parameter list, and execution body. A function prototype declares the function signature to the compiler before its actual definition appears, enabling compile-time argument validation across translation units.

2. The Call Stack & Activation Records

When a function is called, the CPU pushes a new Activation Record (stack frame) onto the call stack. This frame preserves the caller return address, caller register states, input parameters, and local variables. Upon reaching return, the stack frame is popped in LIFO order, and execution resumes seamlessly at the saved return address.

3. Call by Value vs. Call by Reference

By default, C passes all function arguments by value, creating local copies inside the callee stack frame. To modify the caller original variables, you must simulate call by reference by passing pointer addresses.

// Call by Reference using pointers
void swap(int *a, int *b) {
    int temp = *a;
    *a = *b;
    *b = temp;
}

int main(void) {
    int x = 10, y = 20;
    swap(&x, &y); // Passes memory addresses
    // x is now 20, y is now 10
    return 0;
}

4. Recursion: Base Cases and Stack Overflow Traps

A recursive function calls itself to solve smaller sub-problems. Every recursive function must contain a base condition that terminates execution. Without a properly bounded base case, infinite recursion will rapidly exhaust available stack memory, triggering a stack overflow segmentation fault.