代码搜索:malloc

找到约 10,000 项符合「malloc」的源代码

代码结果 10,000
www.eeworm.com/read/377683/9266385

test mallocc.test

# 2007 Aug 13 # # The author disclaims copyright to this source code. In place of # a legal notice, here is a blessing: # # May you do good and not evil. # May you find forgiveness for yourself
www.eeworm.com/read/180558/9302726

c algo6-1.c

/* algo6-1.c 求赫夫曼编码。实现算法6.12的程序 */ #include"c1.h" #include"c6-7.h" int min1(HuffmanTree t,int i) { /* 函数void select()调用 */ int j,flag; unsigned int k=UINT_MAX; /* 取k为不小于可能的值 */
www.eeworm.com/read/180141/9318394

c 4-4-4.c

/*中国系统分析员顾问团,http://www.csai.cn*/ /*程序员下午考试指南书籍源码*/ #include #include #include #define N 100 typedef struct node { int data; struct node * link; } NODE; NOD
www.eeworm.com/read/180141/9318446

c 8-2-12.c

/*中国系统分析员顾问团,http://www.csai.cn*/ /*程序员下午考试指南书籍源码*/ #include #include #define N 100 long factor (int m,int fac[],int *cp){ int c1, c2 , i, k; long s; fac[0] = 1; for(
www.eeworm.com/read/375082/9373416

cpp shujujiegousuanfa.cpp

#include #include #define MAX 1000 typedef struct { int row; int col; int val; }tb; typedef struct { int m,n,t; tb data[MAX]; } TB; TB *third(
www.eeworm.com/read/374569/9395945

cpp ysfh.cpp

#include #include "stdlib.h" struct cir { int data; struct cir *next; }; void main() { struct cir *sl,*u,*p; int n,m,i,t; //n是持有密码卡的人数,m是报数上限,i是表中
www.eeworm.com/read/374564/9396049

c mpeg2dec.c

/* mpeg2dec.c, main(), initialization, option processing */ /* Copyright (C) 1994, MPEG Software Simulation Group. All Rights Reserved. */ /* * Disclaimer of Warranty * * These
www.eeworm.com/read/374004/9424102

c myar.c

#include #include #include "math.h" #define TRUE 1 #define FALSE 0 #define MAXCOEFF 100 #define MAXENTROPY 0 #define LEASTSQUARES 1 int AutoRegression(doubl
www.eeworm.com/read/374004/9424111

c myar.c

#include #include #include "math.h" #define TRUE 1 #define FALSE 0 #define MAXCOEFF 100 #define MAXENTROPY 0 #define LEASTSQUARES 1 int AutoRegression(doubl
www.eeworm.com/read/373994/9424282

c qbaj.c

# include "stdlib.h" void qbaj(p,n,m,k) int n,m,k,p[]; { int i,j,l,*b; b=malloc(n*sizeof(int)); for (i=0;i