Stack and stack differences

I 've been so persistent in some underlying concepts recently. The classic blog post "Difference Between Stack and stack" has been reposted N times, but it is still here for future reference. Thank you for your originality!
I. prerequisites-program memory allocation
The memory occupied by a C/C ++ compiled program is divided into the following parts:
1. stack: the stack zone is automatically allocated and released by the compiler, and stores function parameter values and local variable values. The operation method is similar to the stack in the data structure.
2. heap-generally assigned and released by the programmer. If the programmer does not release the heap, it may be recycled by the OS at the end of the program. Note that it is different from the heap in the data structure. The allocation method is similar to the linked list.
3. Global (static)-the storage of global variables and static variables is put together, and the initialized global variables and static variables are in one area, uninitialized global variables and uninitialized static variables are in another adjacent area. -The system is released after the program ends.
4. Text Constant Area-constant strings are placed here. The program is released by the System
5. program code area-stores the binary code of the function body.

Example Program (this is written by a senior, very detailed)
// Main. cpp

Int a = 0; // global initialization Zone

Char * p1; // not initialized globally

Main ()

{

Int B; // Stack

Char s [] = "abc"; // Stack

Char * p2; // Stack

Char * p3 = "123456"; // 123456 is in the constant zone, and p3 is in the stack.

Static int c = 0; // global (static) initialization Zone

P1 = (char *) malloc (10 );

P2 = (char *) malloc (20 );

// The allocated and byte areas are in the heap area.

Strcpy (p1, "123456"); // 123456 is placed in the constant area, and the compiler may optimize it to a place that corresponds to "123456" pointed to by p3.

}
Ii. Theoretical knowledge of heap and stack
2.1 Application Method
Stack: automatically assigned by the system. For example, declare a local variable int B in the function; the system automatically opens up space for B in the stack.
Heap: the programmer must apply for it and specify the size. In c, the malloc function, such as p1 = (char *) malloc (10 );
Use the new operator in C ++, such as p2 = (char *) malloc (10 );
But note that p1 and p2 are in the stack.
2.2 system response after application
STACK: as long as the remaining space of the stack exceeds the applied space, the system will provide the program with memory. Otherwise, an exception will be reported, prompting stack overflow.
Heap: First, you should know that the operating system has a linked list that records idle memory addresses. When the system receives a program application,
The linked list is traversed to find the heap node with the first space greater than the requested space. Then, the node is deleted from the idle node linked list and allocated to the program, for most systems, the size of the allocation will be recorded at the first address in the memory space, so that the delete statement in the code can correctly release the memory space. In addition, because the size of the heap node is not necessarily equal to the applied size, the system automatically places the excess part in the idle linked list.

2.3 Application size limit
STACK: in Windows, a stack is a data structure extended to a low address and a continuous memory area. This statement indicates that the stack top address and the maximum stack capacity are pre-defined by the system. In WINDOWS, the stack size is 2 MB (OR 1 MB, in short, it is a constant determined during compilation. If the requested space exceeds the remaining space of the stack, overflow will be prompted. Therefore, the space available from the stack is small.
Heap: the heap is a data structure extended to the high address and a non-sequential memory area. This is because the system uses the linked list to store the idle memory address, which is naturally discontinuous, And the traversal direction of the linked list is from the low address to the high address. The heap size is limited by the valid virtual memory in the computer system. It can be seen that the space obtained by the heap is flexible and large.
2.4 comparison of application efficiency:
The stack is automatically allocated by the system, which is faster. But programmers cannot control it.
The heap is the memory allocated by malloc/new, which is generally slow and prone to memory fragmentation. However, it is most convenient to use.
In addition, in WINDOWS, the best way is to use VirtualAlloc to allocate memory. It is not in the heap, nor in the stack, but to reserve a fast memory directly in the address space of the process, although it is the most inconvenient to use. However, it is fast and flexible.

Storage content in 2.5 heap and stack
STACK: when calling a function, the first entry to the stack is the address of the next instruction in the main function (the next executable statement in the function call statement), and then the parameters of the function, in most C compilers, parameters are written from right to left into the stack, followed by local variables in the function. Note that static variables are not included in the stack.
When the function call ends, the local variable first goes out of the stack, then the parameter, and the top pointer of the stack points to the address of the initial storage, that is, the next instruction in the main function, where the program continues to run.
Heap: Generally, the heap size is stored in one byte in the heap header. The specific content in the heap is arranged by the programmer.

2.6 comparison of access efficiency

Char s1 [] = "aaaaaaaaaaaaa ";

Char * s2 = "bbbbbbbbbbbbbbbbb ";
Aaaaaaaaaaa is assigned at runtime, while bbbbbbbbbbbbbbb is determined at compilation. However, in future access, the array on the stack is faster than the string pointed to by the pointer (such as the heap.
For example:

Void main ()

{

Char a = 1;

Char c [] = "1234567890 ";

Char * p = "1234567890 ";

A = c [1];

A = p [1];

Return;

}
Corresponding assembly code
10: a = c [1];
00401067 8A 4D F1 mov cl, byte ptr [ebp-0Fh]
0040106A 88 4D FC mov byte ptr [ebp-4], cl
11: a = p [1];
0040106D 8B 55 EC mov edx, dword ptr [ebp-14h]
00401070 8A 42 01 mov al, byte ptr [edx + 1]
00401073 88 45 FC mov byte ptr [ebp-4], al
The first type reads the elements in the string directly into the cl register, while the second type reads the pointer value into edx. Reading the characters based on edx is obviously slow.
2.7 summary:
The difference between stack and stack can be seen from the following metaphor: using Stack is like eating at a restaurant, just ordering food (sending an application), paying for it, and eating (using it ), when you are full, you don't have to worry about the preparation work, such as cutting and washing dishes, washing dishes, and so on. His advantage is that it is fast, but his degree of freedom is small.
Using heap is like making your favorite dishes. It is troublesome, but it suits your taste and has a high degree of freedom.

What we often call "stack" is a concept in the data structure. It is a linear table that allows insertion or deletion at one end. Its basic operations are push-in and pop-out stacks.

Heap: the location of the space allocated by functions such as malloc. The address increases from low to high.
Stack: it is the space used for automatic Variable Allocation and function calling. The address is reduced from high to low.