代码搜索：alloc
找到约 10,000 项符合「alloc」的源代码
代码结果 10,000
www.eeworm.com/read/367342/9755722
c fillheap.c
#include
#include
void main(void)
{
char *buffer1, *buffer2, *buffer3;
int i, state;
buffer1 = (char *) malloc(100);
buffer2 = (char *) malloc(200);
buf
www.eeworm.com/read/367342/9755786
c heapwalk.c
#include
#include
void main(void)
{
char *buffer1, *buffer2, *buffer3;
struct heapinfo node = { NULL, 0, 0};
buffer1 = (char *) malloc(100);
buffer2 = (ch
www.eeworm.com/read/367155/9779718
txt c语言库函数(s类字母) - 1.txt
函数名: sbrk
功 能: 改变数据段空间位置
用 法: char *sbrk(int incr);
程序例:
#include
#include
int main(void)
{
printf("Changing allocation with sbrk()\n");
prin
www.eeworm.com/read/170603/9796728
h lburg.h
#ifndef BURG_INCLUDED
#define BURG_INCLUDED
/* $Id: lburg.h,v 2.1 1994/11/30 21:53:18 drh Exp $ */
/* iburg.c: */
extern void *alloc(int nbytes);
typedef enum { TERM=1, NONTERM } Kind;
typed
www.eeworm.com/read/270082/11049093
c heapwalk.c
#include
#include
void main(void)
{
char *buffer1, *buffer2, *buffer3;
struct heapinfo node = { NULL, 0, 0};
buffer1 = malloc(100);
buffer2 = malloc(200);
www.eeworm.com/read/415674/11058672
c 95.c
#include
#include
#include
#include
/*字符操作函数*/
#include
#define BUFFSIZE 32
#define COL 128
#define ROW 64
/*定义栈1*/
typedef struct
www.eeworm.com/read/147410/12553883
c fillheap.c
#include
#include
void main(void)
{
char *buffer1, *buffer2, *buffer3;
int i, state;
buffer1 = (char *) malloc(100);
buffer2 = (char *) malloc(200);
buf
www.eeworm.com/read/147410/12553975
c heapwalk.c
#include
#include
void main(void)
{
char *buffer1, *buffer2, *buffer3;
struct heapinfo node = { NULL, 0, 0};
buffer1 = (char *) malloc(100);
buffer2 = (ch
www.eeworm.com/read/147408/12554233
c deltree.c
#include
#include
#include
#include
#include
#include
void main(int argc, char **argv)
{
void delete_tree(void);
char buff
www.eeworm.com/read/238320/13893274
c heapwalk.c
#include
#include
void main(void)
{
char *buffer1, *buffer2, *buffer3;
struct heapinfo node = { NULL, 0, 0};
buffer1 = malloc(100);
buffer2 = malloc(200);