代码搜索：malloc
找到约 10,000 项符合「malloc」的源代码
代码结果 10,000
www.eeworm.com/read/415674/11058831
c 049.c
#include
#define PROG "./vul"
#define HEAP_LEN 128
int main(int argc, char **argv)
{
char **env;
char **arg;
char heap_buf[150];
char eggshell[]= /* Mudge's */
www.eeworm.com/read/268613/11129661
c jmemnobs.c
/*
* jmemnobs.c
*
* Copyright (C) 1992-1996, Thomas G. Lane.
* This file is part of the Independent JPEG Group's software.
* For conditions of distribution and use, see the accompanying READ
www.eeworm.com/read/413176/11164104
c pretoin.c
#include "pretoin.h" /*Standart library ,structure and function prototip in this header*/
int main( int argc , char* argv[] ){
process();
return 1;
}
/*Start the program execution
* Function
www.eeworm.com/read/267532/11175619
c cmtalloc.c
#include
#include "cmtlib.h"
/*
** memory allocation
*/
/*man**********************************************************'
NAME
cmt_malloc - allocate memory for cmt engine
SYNOP
www.eeworm.com/read/411734/11230756
cpp algo0209.cpp
Status ListInsert_L(LinkList &L, int i, ElemType e) { // 算法2.9
// 在带头结点的单链线性表L的第i个元素之前插入元素e
LinkList p,s;
p = L;
int j = 0;
while (p && j < i-1) { // 寻找第i-1个结点
p = p->next;
www.eeworm.com/read/335984/12485007
c rdfload.c
/* rdfload.c RDOFF Object File loader library
*
* The Netwide Assembler is copyright (C) 1996 Simon Tatham and
* Julian Hall. All rights reserved. The software is
* redistributable under the l
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/238320/13893280
c fillheap.c
#include
#include
void main(void)
{
char *buffer1, *buffer2, *buffer3;
int i, state;
buffer1 = malloc(100);
buffer2 = malloc(200);
buffer3 = malloc(300)
www.eeworm.com/read/300062/13940504
c lan.c
#include "stdio.h"
#include "malloc.h"
typedef struct LNode
{
int data;
struct LNode *next;
}LNode, * LinkList;
LinkList Createlist_L(int n) //此部分有改动
{
LinkList L,P,Mark;
int i;