Free of Memory not on the Heap |
Weakness ID: 590 (Weakness Variant) | Status: Incomplete |
Description Summary
Extended Description
When free() is called on an invalid pointer, the program's memory management data structures may become corrupted. This corruption can cause the program to crash or, in some circumstances, an attacker may be able to cause free() to operate on controllable memory locations to modify critical program variables or execute code.
Scope | Effect |
---|---|
Authorization | There is the potential for arbitrary code execution with privileges of the vulnerable program via a "write, what where" primitive. If pointers to memory which hold user information are freed, a malicious user will be able to write 4 bytes anywhere in memory. |
Example 1
In this example, an array of record_t structs, bar, is allocated automatically on the stack as a local variable and the programmer attempts to call free() on the array. The consequences will vary based on the implementation of free(), but it will not succeed in deallocating the memory.
This example shows the array allocated globally, as part of the data segment of memory and the programmer attempts to call free() on the array.
Instead, if the programmer wanted to dynamically manage the memory, malloc() or calloc() should have been used.
Additionally, you can pass global variables to free() when they are pointers to dynamically allocated memory.
Phase: Implementation Only free pointers that you have called malloc on previously. This is the recommended solution. Keep track of which pointers point at the beginning of valid chunks and free them only once. |
Phase: Implementation Before freeing a pointer, the programmer should make sure that the pointer was previously allocated on the heap and that the memory belongs to the programmer. Freeing an unallocated pointer will cause undefined behavior in the program. |
Phases: Implementation; Operation Use a library that contains built-in protection against free of invalid pointers, such as glibc. |
Phase: Architecture and Design Use a language that provides abstractions for memory allocation and deallocation. |
Phase: Testing Use a tool that dynamically detects memory management problems, such as valgrind. |
Nature | Type | ID | Name | View(s) this relationship pertains to![]() |
---|---|---|---|---|
ChildOf | ![]() | 399 | Resource Management Errors | Development Concepts (primary)699 |
ChildOf | ![]() | 742 | CERT C Secure Coding Section 08 - Memory Management (MEM) | Weaknesses Addressed by the CERT C Secure Coding Standard (primary)734 |
ChildOf | ![]() | 762 | Mismatched Memory Management Routines | Research Concepts (primary)1000 |
CanPrecede | ![]() | 123 | Write-what-where Condition | Research Concepts1000 |
Mapped Taxonomy Name | Node ID | Fit | Mapped Node Name |
---|---|---|---|
CERT C Secure Coding | MEM34-C | Only free memory allocated dynamically |
"Valgrind". <http://valgrind.org/>. |
In C++, if the new operator was used to allocate the memory, it may be allocated with the malloc(), calloc() or realloc() family of functions in the implementation. Someone aware of this behavior might choose to map this problem to CWE-590 or to its parent, CWE-762, depending on their perspective. |
Modifications | ||||
---|---|---|---|---|
Modification Date | Modifier | Organization | Source | |
2008-07-01 | Eric Dalci | Cigital | External | |
updated Time of Introduction | ||||
2008-09-08 | CWE Content Team | MITRE | Internal | |
updated Description, Relationships, Other Notes | ||||
2008-11-24 | CWE Content Team | MITRE | Internal | |
updated Relationships, Taxonomy Mappings | ||||
2009-01-12 | CWE Content Team | MITRE | Internal | |
updated Potential Mitigations | ||||
2009-05-27 | CWE Content Team | MITRE | Internal | |
updated Common Consequences, Demonstrative Examples, Description, Maintenance Notes, Name, Other Notes, Potential Mitigations, References, Relationships | ||||
Previous Entry Names | ||||
Change Date | Previous Entry Name | |||
2008-04-11 | Improperly Freeing Heap Memory | |||
2009-05-27 | Free of Invalid Pointer Not on the Heap | |||
2009-10-29 | Free of Memory not on the Heap | |||