Location:
Search - malloc
Search list
Description: UART I/O and Memory Allocation Example for GNU
The project GNU_IODemo shows how to use memory allocation routines (malloc) and char I/O (printf, scanf) via a serial interface with the GNU toolchain.
The I/O functions are adapted for the Analog Devices ADuC7000 series using the SERIAL.C module.
The example also shows the efficiency of the Keil CA ARM Compiler run-time library which is tuned for single chip systems.-UART I/O and Memory Allocation for Example The GNU project GNU_IODemo shows how to use memo ry allocation routines (malloc) and char I/O (p rintf. Scanf) via a serial interface with the GNU toolc DERA. The I/O functions are adapted for the Anal og Devices ADuC7000 series using the SERIAL.C m odule. The example also shows the efficiency of the Keil CA ARM Compiler run-time library which is tuned for single chip systems.
Platform: |
Size: 43008 |
Author: 郭文彬 |
Hits:
Description: 一个很好的内存泄露的监测代码，非常适合在嵌入式系统开发时使用-a good memory leakage monitoring code, very suitable for embedded systems development in the use of
Platform: |
Size: 78848 |
Author: 里我 |
Hits:
Description: This code detects memory leaks in embedded VC++ almost the same way crtdbg does in VC++. At the end of program execution it will display in the debug window if there were any memory leaks and how the memory looks so you can identify where your memory leak occurred. It will display in the debug window a message saying no memory leaks detected if there are no memory leaks. Similar to what crtdbg.h does in VC++. The code detects memory leaks generated with calls to new and delete operators in C++. The code doesn t detect memory leaks generated with C functions: malloc, calloc, free, but that can be done in the future. Let me know and I will program it. -This code detects memory leaks in embedded VC almost the same way crtdbg does in VC. At the en d of program execution it will display in the deb ug window if there were any memory leaks and how t he looks memory so you can identify where your me mory leak occurred. It will display in the debug window a message saying no memory leaks detecte d if there are no memory leaks. Similar to what cr tdbg.h does in VC. The code detects memory leaks generated with calls to new and delete operator s in C. The code doesn t detect memory leaks " ated with C functions : malloc, malloc, free, but that can be done in the future. Let me know and I will program it.
Platform: |
Size: 2048 |
Author: 杨久敏 |
Hits:
Description: 一个C程序，用char *malloc(unsigned size)函数向系统申请一次内存空间-a C program, char* malloc (unsigned size) function to the system for a memory space
Platform: |
Size: 1024 |
Author: liutao |
Hits:
Description: 一个C程序，用char *malloc(unsigned size)函数向系统申请一次内存空间-a C program, char* malloc (unsigned size) function to the system for a memory space
Platform: |
Size: 1024 |
Author: liutao |
Hits:
Description: #include "stdio.h"
#include "math.h"
#include "malloc.h"
#include "string.h"
#define m 6
#define n 29
#define p 0.5-#include "stdio.h"#include "math.h"#include "malloc.h"#include "string.h"#define m 6#define n 29#define p 0.5
Platform: |
Size: 3072 |
Author: jiangshan |
Hits:
Description: #include "stdio.h"
#include "math.h"
#include "malloc.h"
#include "string.h"
#define m 6
#define n 29
#define p 0.5-#include "stdio.h"#include "math.h"#include "malloc.h"#include "string.h"#define m 6#define n 29#define p 0.5
Platform: |
Size: 108544 |
Author: jiangshan |
Hits:
Description: #include "stdio.h"
#include "math.h"
#include "malloc.h"
#include "string.h"
#define m 6
#define n 29
#define p 0.5-#include "stdio.h"#include "math.h"#include "malloc.h"#include "string.h"#define m 6#define n 29#define p 0.5
Platform: |
Size: 53248 |
Author: jiangshan |
Hits:
Description: #include "stdio.h"
#include "math.h"
#include "malloc.h"
#include "string.h"
#define m 6
#define n 29
#define p 0.5-#include "stdio.h"#include "math.h"#include "malloc.h"#include "string.h"#define m 6#define n 29#define p 0.5
Platform: |
Size: 1679360 |
Author: jiangshan |
Hits:
Description:
Platform: |
Size: 1897472 |
Author: 黄石 |
Hits:
Description: * Function:
* 1. Replace the first oldstr with newstr in srcstr
* Arguments:
* IN :
* srcstr
* oldstr
* newstr
* OUT :
* srcstr
* Return:
* 1. If find and replace one oldstr with newstr in srcstr , return 1
* 2. If find no oldstr in srcstr , return 0
* 3. If error (malloc return NULL) return -1
* Notes:
* 1. srcstr should be large size enough.-* Function :* 1. Replace the first oldstr with newstr in srcs tr* Arguments :* IN : srcstr oldstr**** newstr OUT :* srcstr* Return :* 1. If find and replace one with newstr in oldstr srcstr, return 1* 2. If find no oldstr in srcstr. return 0* 3. If error (malloc return NULL) RETUR n-1* Notes :* 1. srcstr size should be large enough.
Platform: |
Size: 2048 |
Author: 阿健 |
Hits:
Description: #include <stdio.h>
#include <string.h>
#include <stdlib.h>
#include <malloc.h>
#include <math.h>
#include <conio.h>
struct DuLNode{
struct DuLNode *prior
int data
struct DuLNode *next-# include
Platform: |
Size: 3072 |
Author: 黄宇 |
Hits:
Description: 用VC实现了动态数组分配的
包括所有源代码-with VC dynamic array allocation, including all source code
Platform: |
Size: 171008 |
Author: 陈天胜 |
Hits:
Description: 一个简单实用的内存管理程序，可以完成malloc/free功能。-a simple and practical memory management procedures to be completed malloc/free function.
Platform: |
Size: 5120 |
Author: 李明 |
Hits:
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: 8192 |
Author: Demonic |
Hits:
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: 8192 |
Author: Demonic |
Hits:
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: 7168 |
Author: Demonic |
Hits:
Description: c语言进阶编程的源码，跟操作系统底层相关，非常好，配合我上传的教程使用-c Advanced programming language source code, associated with the underlying operating system, very good, with the tutorial I used to upload
Platform: |
Size: 147456 |
Author: 杨光 |
Hits:
Description: 此系统主要是演示数据结构中的单链表,仅供学习,交流之用,通过学习可以看到局部变量,全局变量,数据结构,算法的有机结合.在win-tc下可直接运行,在某些Troubc c下需要将malloc.h改为alloc.h-This system is mainly demonstration of a single data structure linked list, for learning, exchange of use, by learning to see local variables, global variables, data structure, the organic integration of algorithms. In win-tc can be run directly in the Troubc c under certain malloc.h changed alloc.h need to
Platform: |
Size: 8192 |
Author: 杨业春 |
Hits:
Description: 一个类STL的多平台可移植的算法容器库,主要用于嵌入式系统编程时的内存管理等方面，尤其是缺少支持malloc 和free的情况下。-STL a class of multi-platform portable containers algorithm library, mainly used in embedded systems programming, such as memory management, in particular the lack of support for malloc and free circumstances.
Platform: |
Size: 674816 |
Author: su |
Hits: