Memory layout in C
Introduction
Memory layout refers to how a computer’s memory is organized and structured. It defines how memory is divided and utilized by various system components.
This is crucial in C as it directly impacts how variables, functions, and data structures are stored and accessed during execution.
In this article, we’ll learn about the fundamental aspects of the memory layout in the C.
Segments In C’s Memory Layout
The memory layout in C consists of different segments, below are the segments;
- Text(Code) segment.
- Data segment.
- Heap.
- Stack.
The diagram below depicts C’s memory layout.

Now let’s discuss the segments in detail.
Text(code) Segment
The text segment is a region of memory in a C program that stores the compiled machine code instructions. These instructions constitute the executable logic of the program and are responsible for defining its behavior.
Here's a simple example to illustrate the concept of the text segment in a C program:
#include <stdio.h>
int main() {
int x = 5;
int y = 10;
int sum;
sum = x + y;
printf("The sum of %d and %d is %d\n", x, y, sum);
return 0;
}
The compiler converts the source code into machine code when this program is compiled. This machine code constitutes the logic and behavior of a program and is stored in the text segment.
While we can't directly see the machine code. We can understand that the text segment contains the compiled instructions.
Essentially, the text segment holds instructions that define how the program behaves when it's executed.
Data segment
The data segment is divided into two parts:
- Initialized data segment
- uninitialized data segment
Initialized Data Segment
The initialized data segment consists of global, extern, static(both local and global), and constant global variables initialized beforehand. The initialized data segment has two sections, the read-only and read-write sections.
Variables with predefined values that can be modified i.e. initialized global, extern, and static(both local and global) variables are stored in the read-write section. Constant variables on the other hand come under the read-only section.
Here's an example illustrating variables stored in the initialized data segment, both in the read-write and read-only sections:
#include <stdio.h>
// Global variable (read-write section)
int globalVar = 10;
// External variable declaration (read-write section)
extern int externVar;
// Static global variable (read-write section)
static int staticGlobalVar = 20;
// Constant global variable (read-only section)
const int constGlobalVar = 30;
int main() {
globalVar += 5;
staticGlobalVar += 10;
printf("Global variable: %d\n", globalVar);
printf("Extern variable: %d\n", externVar); // Assuming externVar is defined in another file
printf("Static global variable: %d\n", staticGlobalVar);
printf("Constant global variable: %d\n", constGlobalVar);
return 0;
}
This illustrates variables stored in the read-write and read-only sections of the initialized data segment.
Uninitialized Data Segment
The uninitialized data segment also known as BSS(Block started by symbol) segment consists of uninitialized global, extern, and static(both local and global) variables.
These variables are initialized to zero by default before the program's execution. They have read-write permissions. Thus allowing them to be both read from and written to during the program's execution.
Example:
#include <stdio.h>
// Uninitialized global variable (goes to the BSS segment)
int globalVar;
// Uninitialized static global variable (also goes to the BSS segment)
static int staticGlobalVar;
int main() {
// Uninitialized local static variable (goes to the BSS segment)
static int staticLocalVar;
printf("Uninitialized Global Variable: %d\n", globalVar);
printf("Uninitialized Static Global Variable: %d\n", staticGlobalVar);
printf("Uninitialized Static Local Variable: %d\n", staticLocalVar);
return 0;
}
In this program, the uninitialized variables will contain zero or null values by default. This is due to automatic initialization by the compiler. This shows the behavior of variables stored in the BSS segment.
Heap
The heap is a region of memory used for dynamic memory allocation during runtime. This allows memory to be allocated and released as needed during program execution. Functions such as malloc(), calloc(), realloc(), and free() are used for memory allocation and deallocation in the heap. The heap is accessible to all parts of the program.
Example:
#include <stdio.h>
#include <stdlib.h>
int main() {
// Dynamically allocate memory for an integer variable on the heap
int *ptr = (int *)malloc(sizeof(int));
return 0;
}
This code snippet demonstrates a simple use of dynamic memory allocation in C. It draws attention to the steps involved in requesting memory, initializing a pointer to that memory, and managing memory properly to avoid leaks. While error handling and memory deallocation are not included in this example, these are crucial components of working with dynamic memory in practical applications.
Stack
The stack segments primary function is to manage function calls and store local variables. This part is crucial in a program's memory layout, as it controls the flow within a program. The stack adopts a Last In, First Out (LIFO) structure, meaning the most recently added data is removed first. This makes the stack very efficient for managing local variables and nested function calls.
Example:
#include <stdio.h>
void functionA(int n) {
int a = n + 1; // Local variable
printf("In functionA, a = %d\n", a);
}
void functionB() {
int b = 10; // Local variable
printf("In functionB, b = %d\n", b);
functionA(b); // Call to functionA
}
int main() {
int x = 20; // Local variable
printf("In main, x = %d\n", x);
functionB(); // Call to functionB
return 0;
}
The code explains how stack frames store local variables. New stack frames are created by the function calls and are eliminated when the functions return. The printf instructions facilitate the visualization of each function's local variable values. The execution flow follows the calls to and returns from functions.
Conclusion
C programmers can improve their coding techniques and gain a better understanding of how their programs interact with memory by mastering these concepts. Understanding memory layout is a vital skill in your programming toolbox, whether you're optimizing for performance or troubleshooting a complex problem.
Feel free to follow, comment, and leave claps. Happy Coding!
Let’s connect on LinkedIn.
The above is the detailed content of Memory layout in C. For more information, please follow other related articles on the PHP Chinese website!
Hot AI Tools
Undresser.AI Undress
AI-powered app for creating realistic nude photos
AI Clothes Remover
Online AI tool for removing clothes from photos.
Undress AI Tool
Undress images for free
Clothoff.io
AI clothes remover
AI Hentai Generator
Generate AI Hentai for free.
Hot Article
Hot Tools
Notepad++7.3.1
Easy-to-use and free code editor
SublimeText3 Chinese version
Chinese version, very easy to use
Zend Studio 13.0.1
Powerful PHP integrated development environment
Dreamweaver CS6
Visual web development tools
SublimeText3 Mac version
God-level code editing software (SublimeText3)
Hot Topics
1378
52
C language data structure: data representation and operation of trees and graphs
Apr 04, 2025 am 11:18 AM
C language data structure: The data representation of the tree and graph is a hierarchical data structure consisting of nodes. Each node contains a data element and a pointer to its child nodes. The binary tree is a special type of tree. Each node has at most two child nodes. The data represents structTreeNode{intdata;structTreeNode*left;structTreeNode*right;}; Operation creates a tree traversal tree (predecision, in-order, and later order) search tree insertion node deletes node graph is a collection of data structures, where elements are vertices, and they can be connected together through edges with right or unrighted data representing neighbors.
The truth behind the C language file operation problem
Apr 04, 2025 am 11:24 AM
The truth about file operation problems: file opening failed: insufficient permissions, wrong paths, and file occupied. Data writing failed: the buffer is full, the file is not writable, and the disk space is insufficient. Other FAQs: slow file traversal, incorrect text file encoding, and binary file reading errors.
How do I use rvalue references effectively in C ?
Mar 18, 2025 pm 03:29 PM
Article discusses effective use of rvalue references in C for move semantics, perfect forwarding, and resource management, highlighting best practices and performance improvements.(159 characters)
How do I use ranges in C 20 for more expressive data manipulation?
Mar 17, 2025 pm 12:58 PM
C 20 ranges enhance data manipulation with expressiveness, composability, and efficiency. They simplify complex transformations and integrate into existing codebases for better performance and maintainability.
What are the basic requirements for c language functions
Apr 03, 2025 pm 10:06 PM
C language functions are the basis for code modularization and program building. They consist of declarations (function headers) and definitions (function bodies). C language uses values to pass parameters by default, but external variables can also be modified using address pass. Functions can have or have no return value, and the return value type must be consistent with the declaration. Function naming should be clear and easy to understand, using camel or underscore nomenclature. Follow the single responsibility principle and keep the function simplicity to improve maintainability and readability.
How to calculate c-subscript 3 subscript 5 c-subscript 3 subscript 5 algorithm tutorial
Apr 03, 2025 pm 10:33 PM
The calculation of C35 is essentially combinatorial mathematics, representing the number of combinations selected from 3 of 5 elements. The calculation formula is C53 = 5! / (3! * 2!), which can be directly calculated by loops to improve efficiency and avoid overflow. In addition, understanding the nature of combinations and mastering efficient calculation methods is crucial to solving many problems in the fields of probability statistics, cryptography, algorithm design, etc.
How do I use move semantics in C to improve performance?
Mar 18, 2025 pm 03:27 PM
The article discusses using move semantics in C to enhance performance by avoiding unnecessary copying. It covers implementing move constructors and assignment operators, using std::move, and identifies key scenarios and pitfalls for effective appl
How does dynamic dispatch work in C and how does it affect performance?
Mar 17, 2025 pm 01:08 PM
The article discusses dynamic dispatch in C , its performance costs, and optimization strategies. It highlights scenarios where dynamic dispatch impacts performance and compares it with static dispatch, emphasizing trade-offs between performance and


