Search - malloc

[Hook api] leakfree

Description: 以malloc hook的方式检测内存泄漏的工具 -malloc hook to the memory leak detection tools
Platform: | Size: 179453 | Author: chen | Hits:

Description: The Gray Watson debugging malloc library is C source code for a drop in replacement for the system malloc & other memory manage ment routines. What is unique about this library is that it contains a number of powerful debugging facilities including very comprehensive heap testing and ex- cellent run-time debugging information.
Platform: | Size: 98714 | Author: 何东 | Hits:

[Other resource] xianxingbiao

Description: 实习题 [问题描述] 1. 设顺序表中的数据元素递增有序，将插入到顺序表的适当位置上，是该表仍然有序。 [输入] 初始顺序表，插入字符。 [输出] 插入x后线性表的结果 [存储结构] 采用顺序存储结构 [算法的基本思想] 建立一个递增顺序表，插入一个数值并移动元素，使其仍然有序。程序如下： #include \"iostream.h\" #include <malloc.h> #define LIST_INTI_SIZE 100//初始空间大小 typedef struct SqList -attachment that [problem description] 1. Established order of the table data elements incremental orderly, will be inserted into the appropriate sequence table position is that the schedule remains orderly. [Imported] initial order and inserting characters. [Output] x inserted after the results of the linear scale [storage structure] sequence storage structure [algorithm for the basic idea : the establishment of a - incremental sequence table, insert a numerical and mobile elements, it remains orderly. The procedure is as follows : # include "iostream.h" # include
Platform: | Size: 8550 | Author: Demonic | Hits:

[Other resource] shu

Description: 1.[问题描述] 编写递归算法，计算二叉树中叶子结点的数目 [输入] 按照先序序列的顺序输入该结点的内容。其输入abd eh cf i g . [输出] 按中序序列输出，输出的结果为；dbheaficg并计算出二叉树中叶子结点的数目为4 [存储结构] 采用二叉表存储 [算法的基本思想] 采用递归方法建立和遍历二叉树。首先建立二叉树的根结点，然后建立其左右子树，直到空子树为止，中序遍历二叉树时，先遍厉左子树，后遍厉右子树，最后访问根结点。根据左右子树的最后一个结点计算出二叉树中叶子结点的数目。程序如下： #include<stdio.h> #include<malloc.h> #include\"stdlib.h\" -1. [Description of the issue] to prepare recursive algorithm, Binary calculation leaves the number of nodes [imported] in accordance with the first order input sequence in the order of the node contents. Input abd eh i g cf. [Output] by the order sequence output, the results of the output; dbheaficg calculated Binary leaf node to the number four [storage structure] Table 2 forks storage [ The basic idea algorithm] recursive method and traverse binary tree. First established binary tree root node, and then to build their son around the tree, the tree until the loopholes, which preorder binary tree, Li first times the left sub-tree, right after Li times-tree root node final visit. Under the sub-trees around the last one node calculated Binary leaf node number. The procedure is as follows : #
Platform: | Size: 8133 | Author: Demonic | Hits:

[Other resource] shu2

Description: 2.[问题描述] 编写递归算法，在二叉树中求位于先序序列中第K个位置的结点 [输入] 按照先序序列的顺序输入该结点的内容。其输入abd eh cf i g 。输入要求的位置 [输出] 若二叉树不空，按先序序列输出，求出所求位置的结点 [存储结构] 采用二叉表存储 [算法的基本思想] 采用递归方法建立和遍历二叉树。首先建立二叉树的根结点，然后建立其左右子树，直到空子树为止，先序遍历二叉树时，先遍厉左子树，后遍厉右子树，最后访问根结点并计算出二叉树中叶子结点的数目和第K个位置的结点 #include<stdio.h> #include<malloc.h> struct node{ char info struct node*llink,*rlink } typedef struct node NODE -2. [Description of the issue] to prepare recursive algorithm, Binary for the first sequence sequence in the first position of the K-node [imported] in accordance with the first order input sequence in the order of the nodes content. Input abd eh i g cf. Import requirements of the position [output] if the binary tree is not empty, the first sequence by sequence output obtained by seeking the location of nodes [storage structure] Table 2 forks storage [algorithm for the basic idea] recursive method and Traversing binary tree. First established binary tree root node, and then to build their son around the tree, the tree until the loopholes, preorder binary tree, Li first times the left sub-tree, after repeatedly Li-right tree Finally visit root node and calculated Binary leaf nodes and the nu
Platform: | Size: 7096 | Author: Demonic | Hits:

[OS Develop] dmalloc-5.4.2

Description: 减少内存碎片的malloc分配函数，非常不错，可以用于LINUX, WIN32 ,VXWORKS
Platform: | Size: 371228 | Author: 张三 | Hits:

[Other] DMALLOC

Description: MALLOC调试工具(附源码
Platform: | Size: 4278 | Author: yanxiaobin | Hits:

[Other resource] mTrack

Description: 嵌入式系统下内存泄漏检查库函数mTrace以及测试代码,有详细使用文档.这个是将malloc和free 函数控制起来,检查内存.
Platform: | Size: 41333 | Author: Andrew Huang | Hits:

[Linux-Unix] myprog

Description: 用char *malloc(unsigned size)函数向系统申请一次内存空间（如size=1000，单位为字节），用首次适应法 addr = (char *)fmalloc(unsigned size) 和 ffree(unsigned size,char * addr)（基本要求）或循环首次适应法（提高一步） addr = (char *)lmalloc(unsigned size) 和 lfree(unsigned size,char * addr) 模拟UNIX可变分区内存管理，实现对该内存区的分配和释放管理。
Platform: | Size: 1855 | Author: lensoft | Hits:

[Other resource] C_memory_management

Description: C语言内存管理源码，一个介绍Malloc实现的源码。嵌入式系统里面可以参考，以了解如何减少内存碎片的问题！
Platform: | Size: 1661 | Author: 李平 | Hits:

[OS program] linklistnode(c)

Description: 此系统主要是演示数据结构中的单链表,仅供学习,交流之用,通过学习可以看到局部变量,全局变量,数据结构,算法的有机结合.在win-tc下可直接运行,在某些Troubc c下需要将malloc.h改为alloc.h
Platform: | Size: 8081 | Author: 杨业春 | Hits:

[OS program] Exercise2

Description: 系统级编程课程中的内存围栏，意在改写自己的malloc和free函数，增强程序处理的容错性，健壮性
Platform: | Size: 339213 | Author: 程功 | Hits:

[Embeded-SCM Develop] ylib90

Description: 一个类STL的多平台可移植的算法容器库,主要用于嵌入式系统编程时的内存管理等方面，尤其是缺少支持malloc 和free的情况下。
Platform: | Size: 675218 | Author: su | Hits:

[Other resource] c

Description: #include<malloc.h> #include<limits.h> #include<stdio.h> #include<graphics.h> #include<io.h> #include<math.h> #include<process.h> #include<conio.h> #define m 100 #define OK 1 typedef int Status typedef char TElemType /*树元素的类型*/ int t=35 int n=20 int h=14 int u=2 int leaf=0,non_l_leaf=0,non_r_leaf=0,root=0 /*各种结点数*/ char le[m],l[m],r[m],ro[m] /*用与存放各种结点*/ typedef struct BiTNode/*定义二叉树*/
Platform: | Size: 2243 | Author: 全文 | Hits:

[Windows Develop] xmem

Description: XMEM Extended C/C++ Dynamic Memory Control and Debug Library: The extended C/C++ Dynamic Memory Control and Debug Library XMEM is a replacement library for malloc/free and new/delete to find memory leaks and other memory related errors in C/C++ code
Platform: | Size: 1184545 | Author: zhl | Hits:

[OS Develop] neicunfeipei

Description: 编写一个C程序，用char *malloc(unsigned size)函数向系统申请一次内存空间（如size=1000，单位为字节），用循环首次适应法 addr = (char *)lmalloc(unsigned size) 和 lfree(unsigned size,char * addr)模拟可变分区内存管理，实现对该内存区的分配和释放管理。
Platform: | Size: 1881 | Author: fy | Hits:

[OS program] debugging_malloc

Description: 编写标准函数的包装模块解决内存漏洞问题通常的malloc和free代码是不允许调用者存在错误的，比如说在程序引用越界、忘记释放内存块，或将一个内存块释放了两次，这些错误通常不会立即影响程序的执行，但当程序用到错误的内存时，已分配的内存过多时，程序就会开始不正常，用程序跟踪调试检查错误出现的地方会很困难。本次实验的任务就是为malloc和free写一个包装模块，使用这个模块可以发现代码中的上述错误。
Platform: | Size: 186716 | Author: js | Hits:

Category

Source Code

Web/Internet

Develop Tools

Document

Other

Search in results

OS

Platform

Language

File Type

Search list