代码搜索：malloc
找到约 10,000 项符合「malloc」的源代码
代码结果 10,000
www.eeworm.com/read/221874/14716409
c read.c
#include "struct.h"
/* local data types */
struct node {
char *name;
int x,y,w,h,n,type;
struct pin *head, *tail;
struct node *next;
};
struct pin {
char *name;
int x,y;
struct pin *n
www.eeworm.com/read/221635/14732496
h stdafx.h
// stdafx.h : 标准系统包含文件的包含文件，
// 或是常用但不常更改的项目特定的包含文件
//
#pragma once
//#define WIN32_LEAN_AND_MEAN // 从 Windows 头中排除极少使用的资料
// Windows 头文件：
#include
#include
//
www.eeworm.com/read/121010/14775153
h shared.h
#ifndef _SHARED_H_
#define _SHARED_H_
#define VERSION "0.9.3"
/* Data types */
typedef unsigned long int dword;
typedef unsigned short int word;
typedef unsigned char byte;
/* To ke
www.eeworm.com/read/121010/14775234
h osd.h
#ifndef _OSD_H_
#define _OSD_H_
#include
#include
#include
#include
#include
#include "..\shared.h"
#include "unzip.h"
#endif /* _O
www.eeworm.com/read/121010/14775832
h osd.h
#ifndef _OSD_H_
#define _OSD_H_
#include
#include
#include
#include
#include
#include
#include
#include
www.eeworm.com/read/120923/14783164
cpp memcheck.cpp
//: C03:MemCheck.cpp {O}
// From "Thinking in C++, 2nd Edition, Volume 2"
// by Bruce Eckel & Chuck Allison, (c) 2001 MindView, Inc.
// Available at www.BruceEckel.com.
// Memory allocation tester
www.eeworm.com/read/120093/14812959
txt makesc~1.txt
# For people w/o a make facility, the following should help compile
# the sgpc system.
#
# Please do read the comments in the various makefiles in regards to
# the switch settings (TYPE, COMPRESS
www.eeworm.com/read/219502/14878393
cpp algo0211.cpp
void CreateList_L(LinkList &L, int n) { // 算法2.11
// 逆位序输入（随机产生）n个元素的值，建立带表头结点的单链线性表L
LinkList p;
int i;
L = (LinkList)malloc(sizeof(LNode));
L->next = NULL; // 先建立一个带头结点
www.eeworm.com/read/118192/14882862
c 习题－22.c
//本程序只给出了算法思想
//读者可以自己完善本程序
Status LinkList_Divide(LinkList &L,CiList &A,CiList &B,CiList &C)
//把单链表L的元素按类型分为三个循环链表.CiList为带头结点的单循环链表类型.
{
s=L->next;
A=(CiList*)malloc(sizeof(CiLNode));p=A
www.eeworm.com/read/118192/14882964
c 习题－28.c
//本程序只给出了算法思想
//读者可以自己完善本程序
void BSTree_Insert_Key(BiThrTree &T,int x)//在后继线索二叉搜索树T中插入元素x
{
if(T->datartag) //T没有右子树时,作为右孩子插入
{
p=T->rchild;
q=(BiThrNode*)mall