内存的分配管理与回收 c语言程序,内存管理垃圾回收 C语言内存分配垃圾回收3大算法引用计数3个缺点...

最新推荐文章于 2024-05-16 00:43:27 发布

队长小翼

最新推荐文章于 2024-05-16 00:43:27 发布

阅读量300

点赞数

文章标签：内存的分配管理与回收 c语言程序

小结：php

一、垃圾回收的本质：找到并回收再也不被使用的内存空间；程序员

二、标记清除方式和复制收集方式的对比；算法

三、复制收集方式的局部性优势；编程

https://en.wikipedia.org/wiki/C_(programming_language)#Memory_management数组

Memory management

One of the most important functions of a programming language is to provide facilities for managing memory and the objects that are stored in memory. C provides three distinct ways to allocate memory for objects:缓存

Static memory allocation: space for the object is provided in the binary at compile-time; these objects have an extent (or lifetime) as long as the binary which contains them is loaded into memory.

Automatic memory allocation: temporary objects can be stored on the stack, and this space is automatically freed and reusable after the block in which they are declared is exited.

Dynamic memory allocation: blocks of memory of arbitrary size can be requested at run-time using library functions such as heap; these blocks persist until subsequently freed for reuse by calling the library function

These three approaches are appropriate in different situations and have various trade-offs. For example, static memory allocation has little allocation overhead, automatic allocation may involve slightly more overhead, and dynamic memory allocation can potentially have a great deal of overhead for both allocation and deallocation. The persistent nature of static objects is useful for maintaining state information across function calls, automatic allocation is easy to use but stack space is typically much more limited and transient than either static memory or heap space, and dynamic memory allocation allows convenient allocation of objects whose size is known only at run-time. Most C programs make extensive use of all three.安全

Where possible, automatic or static allocation is usually simplest because the storage is managed by the compiler, freeing the programmer of the potentially error-prone chore of manually allocating and releasing storage. However, many data structures can change in size at runtime, and since static allocations (and automatic allocations before C99) must have a fixed size at compile-time, there are many situations in which dynamic allocation is necessary.linker or loader, before the program can even begin execution.)并发

Unless otherwise specified, static objects contain zero or null pointer values upon program startup. Automatically and dynamically allocated objects are initialized only if an initial value is explicitly specified; otherwise they initially have indeterminate values (typically, whatever bit pattern happens to be present in the storage, which might not even represent a valid value for that type). If the program attempts to access an uninitialized value, the results are undefined. Many modern compilers try to detect and warn about this problem, but both false positives and false negatives can occur.app

Another issue is that heap memory allocation has to be synchronized with its actual usage in any program in order for it to be reused as much as possible. For example, if the only pointer to a heap memory allocation goes out of scope or has its value overwritten before automatic garbage collection.) less

https://zh.wikipedia.org/wiki/C动态内存分配

C动态内存分配是在C语言中为了实现动态内存分配而进行的手动内存管理。这种管理是经过C标准库中的malloc、realloc、calloc、free等函数进行的。

C++为了兼容 C 语言也提供这些函数，可是更推荐使用new、delete操做符来完成相似的操做。

malloc所实际使用的内存分配机制有不少不一样的实现，执行时间和内存消耗各有不一样。

函数概述

C 动态内存分配函数在头文件stdlib.h中声明(C++ 中对应的头文件名称为cstdlib)。

函数

描述

malloc

分配指定数量的字节

realloc

调整指定内存块的大小，必要时会从新分配

calloc

分配指定数量的字节，并初始化为 0

free

释放指定的内存块

类型安全

malloc所执行的内存分配基于字节数而不是类型，其返回类型为 void 指针(void *)，表示该指针所指向区域的数据类型未知。C++ 因为其强类型系统，实际使用该指针时须要进行强制类型转换，而 C 语言中则没必要进行。

int * ptr;

ptr = malloc(10 * sizeof(int)); /* 不进行强制类型转换 */ ptr = (int *)malloc(10 * sizeof(int)); /* 进行强制类型转换 */

另见

https://zh.wikipedia.org/wiki/C语言

内存管理

C语言的特点之一是：程序员必须亲自处理内存的分配细节。

C语言使用栈(Stack)来保存函数返回地址／栈帧基址、完成函数的参数传递和函数局部变量的存储。若是程序须要在运行的过程当中动态分配内存，能够利用堆(Heap)来实现。

基本上C程序的元素存储在内存的时候有3种分配策略：

静态分配

若是一个变量声明为全局变量或者是函数的静态变量，这个变量的存储将使用静态分配方式。静态分配的内存通常会被编译器放在数据段或代码段来存储，具体取决于实现。这样作的前提是，在编译时就必须肯定变量的大小。以IA32的x86平台及gcc编译器为例，全局及静态变量放在数据段的低端；全局及静态常量放在代码段的高端。

自动分配

函数的自动局部变量应该随着函数的返回会自动释放(失效)，这个要求在通常的体系中都是利用栈(Stack)来知足的。相比于静态分配，这时候，就没必要绝对要求这个变量在编译时就必须肯定变量的大小，运行时才决定也不迟，可是C89仍然要求在编译时就要肯定，而C99放松了这个限制。但不管是C89仍是C99，都不容许一个已经分配的自动变量运行时改变大小。

因此说C函数永远不该该返回一个局部变量的地址。

要指出的是，自动分配也属于动态分配，甚至能够用alloca函数来像分配堆(Heap)同样进行分配，并且释放是自动的。

动态分配

还有一种更加特殊的状况，变量的大小在运行时有可能改变，或者虽然单个变量大小不变，变量的数目却有很大弹性，不能静态分配或者自动分配，这时候可使用堆(Heap)来知足要求。ANSI C定义的堆操做函数是malloc、calloc、realloc和free。

使用堆(Heap)内存将带来额外的开销和风险。

《代码的将来》p76

垃圾回收 garbage collection GC

对象本质：

在Java和Rub中，程序在运行时会建立不少对象。从编程角度来看，它们是对象；但从计算机角度来看，它们也就是一些装有数据的内存空间而已。

麻烦来源：

在C和C++这样的语言中，这些内存空间是由人手动进行管理的。当须要内存空间时，要请求操做系统进行分配，不须要的时候要返还给操做系统。

然而，正是“再也不须要”这一点，带来了各类各样的麻烦；而若是认为某些内存空间“可能还要用到”而不还给操做系统或者是用完了却忘记返还，这些没法访问的空间就会