代码搜索:malloc
找到约 10,000 项符合「malloc」的源代码
代码结果 10,000
www.eeworm.com/read/367608/9740220
h lstack.h
/**************2008.2.6*********************链式栈的操作*******************************/
#include
#include
#include
#include
/*******************************
www.eeworm.com/read/248697/12545886
c pid.c
char ker_pid_name[][256]={
"pub/sub daemon", // 0
"kernel daemon", // 1
"kernel scheduler", // 2
"malloc", // 3
"timer", // 4
"adc",
www.eeworm.com/read/104047/15711884
cpp wbx.cpp
// Wbx.cpp: implementation of the CWbx class.
//
//////////////////////////////////////////////////////////////////////
#include "stdafx.h"
#include
#include "vt100.h"
#include
www.eeworm.com/read/104047/15711983
cpp wbx.cpp
// Wbx.cpp: implementation of the CWbx class.
//
//////////////////////////////////////////////////////////////////////
#include "stdafx.h"
#include
#include "vt100.h"
#include
www.eeworm.com/read/100819/15863881
c bombersprites.c
//Load the sprites
void LoadSprites ()
{
FILE *SSFFile;
unsigned char RGBPal [256][3];
int DAC;
//Assign memory to sprite buffer
SpriteBuf = (char *)malloc (64000
www.eeworm.com/read/370630/9589888
cpp algo3-5.cpp
// algo3-5.cpp 利用栈求解迷宫问题(只输出一个解,算法3.3)
#include
#include
#include // malloc()等
#include // INT_MAX等
#include // EOF(=^Z或F6),NULL
#include
www.eeworm.com/read/125819/6020985
h features.h
/** Z80 specific features.
*/
#ifndef __SDC51_ASM_Z80_FEATURES_H
#define __SDC51_ASM_Z80_FEATURES_H 1
#define _REENTRANT
#define _CODE
#define _SDCC_MANGLES_SUPPORT_FUNS 1
#define _SDCC_Z80_STYLE
www.eeworm.com/read/125819/6020986
h features.h
/** Z80 specific features.
*/
#ifndef __SDC51_ASM_Z80_FEATURES_H
#define __SDC51_ASM_Z80_FEATURES_H 1
#define _REENTRANT
#define _CODE
#define _SDCC_MANGLES_SUPPORT_FUNS 1
#define _SDCC_Z80_STYLE
www.eeworm.com/read/391022/8428224
cpp snmp.cpp
/*---------------------------------------
SNMP信息刺探程序
----------------------------------------*/
#include
#include
#include
#include
#pragma c
www.eeworm.com/read/189877/8453942
c vxmalloc.c
/*
This version of malloc for VxWorks contains two different algorithms.
One is the BSD based Kingsley "bucket" allocator which has some
unique fragmentation behavior. The oth