代码搜索：malloc
找到约 10,000 项符合「malloc」的源代码
代码结果 10,000
www.eeworm.com/read/140797/7146998
h malloc.h
/*
* malloc.h
*
* Internals for the memory allocator
*/
#include
#include
/*
* This is the minimum chunk size we will ask the kernel for; this should
* be a multiple of t
www.eeworm.com/read/140797/7147057
c malloc.c
/*
* malloc.c
*
* Very simple linked-list based malloc()/free().
*/
#include
#include "init.h"
#include "malloc.h"
struct free_arena_header __malloc_head =
{
{
ARENA_TYPE_HEAD,
www.eeworm.com/read/219035/7147249
m malloc.m
function h = malloc
% MALLOC Allocate memory.
%
% P = MALLOC allocate memory to pointer P.
% It is equivalent to P = POINTER
%
% See also POINTERS, @POINTER\POINTER
h = pointer;
www.eeworm.com/read/464359/7164510
c malloc.c
#include "com.h"
#if 1
#define MAX_MALLC_NUM 400
#define BLOCKNUM 0X100000
UINT8 BufOSUse[BLOCKNUM];
UINT8 Mallc_Num=0;
typedef enum _MallogStatus
{
Buf_Empty=0,
Buf_FULL
}MallogStatu
www.eeworm.com/read/464339/7165132
h malloc.h
www.eeworm.com/read/462821/7195343
h malloc.h
/* malloc.h
memory management functions and variables.
Copyright (c) 1991 by Borland International
All Rights Reserved.
*/
#if !defined(__MALLOC_H)
#define __MALLOC_H
#if !
www.eeworm.com/read/461713/7221738
h malloc.h
/* malloc.h
memory management functions and variables.
Copyright (c) 1991 by Borland International
All Rights Reserved.
*/
#if !defined(__MALLOC_H)
#define __MALLOC_H
#if !
www.eeworm.com/read/458360/7298586
h malloc.h
/* @(#) malloc.h 1.2 1/27/86 17:46:48 */
/*ident "@(#)cfront:incl/malloc.h 1.2"*/
/*
Constants defining mallopt operations
*/
#define M_MXFAST 1 /* set size of blocks to be fast */
#define M_NLBLKS
www.eeworm.com/read/456569/7344825
h malloc.h
/* malloc.h
memory management functions and variables.
Copyright (c) 1991 by Borland International
All Rights Reserved.
*/
#if !defined(__MALLOC_H)
#define __MALLOC_H
#if !
www.eeworm.com/read/454275/7395275
c malloc.c
/*
* malloc.c --- a general purpose kernel memory allocator for Linux.
*
* Written by Theodore Ts'o (tytso@mit.edu), 11/29/91
*
* This routine is written to be as fast as possible, so that it
*