Step into the minefield of C ++-C ++ memory management (I)

Entering the minefield in C ++-C ++ memory management details

Computer Teaching Network

2006-04-25/

The great Bill Gates once said: 640 K ought to be enough for everybody-Bill Gates 1981 Programmers often write memory management programs, so they are always worried. If you don't want to touch the mines, the only solution is to discover all the hidden mines and exclude them. The content of this article is much deeper than that of general textbooks. Readers must carefully read this article to truly understand memory management. 　　1. Memory Allocation Method There are three memory allocation methods: (1) distribution from the static storage area. The program has been allocated when it is compiled, and the program exists throughout the entire runtime. For example, global variables and static variables. (2) create a stack. When a function is executed, the storage units of local variables in the function can be created on the stack. When the function is executed, these storage units are automatically released. Stack memory allocation computation is built into the processor's instruction set, which is highly efficient, but the memory capacity allocated is limited. (3) allocate from the stack, also known as dynamic memory allocation. When the program runs, it uses malloc or new to apply for any amount of memory. The programmer is responsible for releasing the memory with free or delete. The lifetime of the dynamic memory is determined by us. It is very flexible to use, but the problem is also the most. 　　2. Common memory errors and Countermeasures Memory Errors are very troublesome. The compiler cannot automatically detect these errors, which can be captured only when the program is running. Most of these errors do not have obvious symptoms, but they are often invisible and increase the difficulty of error correction. Sometimes the user finds you angrily, but the program has not encountered any problems. When you leave, the error occurs again. Common memory errors and their countermeasures are as follows: * If the memory allocation is unsuccessful, it is used. New programmers often make this mistake because they do not realize that memory allocation will fail. A common solution is to check whether the pointer is null before using the memory. If the pointer P is a function parameter, use assert (P! = NULL) Check. If you use malloc or new to apply for memory, you should use if (P = NULL) or if (P! = NULL. * Although the memory allocation is successful, it is referenced before initialization. There are two main causes for this mistake: first, there is no idea of initialization; second, the default initial values of the memory are all zero, resulting in incorrect reference values (such as arrays ). There is no uniform standard for the default initial values of the memory. Although sometimes it is zero, we prefer to trust it without any trust. Therefore, no matter which method is used to create an array, do not forget to assign the initial value. Even the zero value cannot be omitted, so do not bother. * The memory allocation is successful and initialized, but the operation is beyond the memory boundary. For example, when an array is used, the subscript "more than 1" or "less than 1" is often performed. Especially in for loop statements, the number of loops is easy to make a mistake, resulting in array operations out of bounds. * Forgot to release the memory, causing memory leakage. A function containing such errors loses a piece of memory every time it is called. At the beginning, the system had sufficient memory and you could not see the error. Once a program suddenly died, the system prompts: memory is exhausted. Dynamic Memory application and release must be paired. The usage of malloc and free in the program must be the same, otherwise there must be an error (the same applies to new/delete ). * The memory is released but it is used again. 　 There are three scenarios: (1) The object calling relationship in the program is too complex, so it is difficult to figure out whether an object has released the memory. At this time, we should re-design the data structure to fundamentally solve the chaos of Object Management. (2) The Return Statement of the function is incorrect. Be sure not to return the "Pointer" or "Reference" pointing to "stack memory" because the function body is automatically destroyed when it ends. (3) After the memory is released using free or delete, the pointer is not set to null. As a result, a "wild pointer" is generated ". [Rule 1] after applying for memory with malloc or new, check whether the pointer value is null immediately. Prevents the use of memory with NULL pointer values. Rule 2: Do not forget to assign initial values to arrays and dynamic memory. Avoid using uninitialized memory as the right value. Rule 3: avoid overrunning the subscript of an array or pointer. Be careful when "more than 1" or "less than 1" is performed. [Rule 4] dynamic memory application and release must be paired to prevent memory leakage. [Rule 5] after the memory is released with free or delete, the pointer is immediately set to null to avoid "wild pointer ". 　　3. Comparison of pointers and Arrays In C ++/C Programs, pointers and arrays can be replaced with each other in many places, which leads to the illusion that the two are equivalent. An array is either created in a static storage area (such as a global array) or on a stack. The array name corresponds to (rather than pointing to) a piece of memory, and its address and capacity remain unchanged during the lifetime, only the content of the array can be changed. A pointer can point to any type of memory block at any time, and its feature is "variable". Therefore, we often use pointers to operate dynamic memory. Pointers are far more flexible than arrays, but they are more dangerous. The following uses a string as an example to compare the features of pointers and arrays. 3.1 modify content In the example 3-1, the size of character array a is 6 characters, and its content is hello. The content of A can be changed, for example, a [0] = 'x '. The pointer P points to the constant string "world" (in the static storage area with the content of World). The content of the constant string cannot be modified. In terms of syntax, the compiler does not think that the statement P [0] = 'X' is inappropriate, but this statement attempts to modify the content of the constant string and causes a running error. Char A [] = "hello "; A [0] = 'X '; Cout <A <Endl; Char * P = "world"; // note that P points to a constant string P [0] = 'X'; // the compiler cannot find this error. Cout <p <Endl; Example 3.1 modify the array and pointer content 3.2 content replication and Comparison The array name cannot be directly copied or compared. In Example 7-3-2, if you want to copy the content of array a to array B, you cannot use statement B = A. Otherwise, a compilation error is generated. Use the standard library function strcpy for replication. Similarly, if the content of B and A is the same, it cannot be determined by if (B = A). The standard library function strcmp should be used for comparison. Statement P = A does not copy the content of A, but assigns the address of A to P. To copy the content of A, use the library function malloc as P to apply for a memory with a capacity of strlen (A) + 1 characters, and then use strcpy to copy strings. Similarly, the statement if (P = A) compares not the content but the address, and should be compared using the database function strcmp. // Array... Char A [] = "hello "; Char B [10]; Strcpy (B, A); // B = A cannot be used; If (strcmp (B, A) = 0) // If (B = A) cannot be used) ... // Pointer... Int Len = strlen (); Char * P = (char *) malloc (sizeof (char) * (LEN + 1 )); Strcpy (P, A); // do not use P =; If (strcmp (P, A) = 0) // do not use if (P =) ... Example 3.2 copying and comparing the array and pointer content 3.3 computing memory capacity The sizeof operator can be used to calculate the array capacity (number of bytes ). In Example 7-3-3 (a), the value of sizeof (a) is 12 (don't forget ''). The pointer P points to A, but the value of sizeof (P) is 4. This is because sizeof (p) obtains the number of bytes of a pointer variable, which is equivalent to sizeof (char *) rather than the memory capacity referred to by P. C ++/C language cannot know the memory capacity referred to by the pointer unless you remember it when applying for memory. Note: When an array is passed as a function parameter, the array will automatically degrade to a pointer of the same type. In Example 7-3-3 (B), sizeof (a) is always equal to sizeof (char *) regardless of the size of array *). Char A [] = "Hello World "; Char * P =; Cout <sizeof (a) <Endl; // 12 bytes Cout <sizeof (p) <Endl; // 4 bytes Example 3.3 (a) calculates the memory capacity of arrays and pointers Void func (char a [1, 100]) { Cout <sizeof (a) <Endl; // 4 bytes instead of 100 bytes } Example 3.3 (B) the array degrades to a pointer