内存分配方式堆和栈（Memory allocation modes, heaps, and stacks）.docVIP

内存分配方式堆和栈（Memory allocation modes, heaps, and stacks） 1. memory allocation There are three ways to allocate memory: [1] is allocated from the static storage area. Memory has been allocated when the program is compiled, and it exists throughout the entire run of the program. For example, global variables, static variables. [2] is created on the stack. When executing functions, the storage units of local variables in the function can be created on the stack, and the storage units are automatically released at the end of the execution of the function. Stack memory allocation operations are built into the processors instruction set, with high efficiency, but limited memory allocation. [3] is allocated from a heap, also known as dynamic memory allocation. When the program is running, use malloc or new to apply as much memory as possible, and the programmer is responsible for releasing memory whenever free or delete is used. Dynamic memory survival by the programmer decided to use a very flexible, but if in the heap space, have the responsibility to recycle it, otherwise the program will run a memory leak, will frequently heap space allocation and release of different sizes produced in pile pieces. Memory space for 2. programs A program allocates the operating system to the memory blocks it runs, divided into 4 regions, as shown in the following figure. Code area (code, area) program memory space Global data area (data, area) Heap area (heap) Stack area (stack, area) A program compiled by C/C++ occupies the following sections of memory, 1, stack area (stack). The compiler automatically allocates, releases, stores local variables, function parameters, returns data, and returns addresses for running functions. Its operation is similar to the stack in the data structure. 2, heap area (heap)? Generally distributed by the programmer release, if the programmer does not release, the program may be recycled by the end of OS. The distribution is similar to the linked list. 3, the