代码搜索：malloc
找到约 10,000 项符合「malloc」的源代码
代码结果 10,000
www.eeworm.com/read/423304/10572504
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/160061/10575308
cpp cipan.cpp
#include
#include
#include
#include
typedef struct
{
int nums; //请求队列长度
int *mem; //访问请求
int *f; //每次访问磁臂移动磁道数
int *tmp; //SSTF临时变量
int *sh;
www.eeworm.com/read/159601/10635218
c memory.c
/*----------------------------------------------------------------------------*/
/* memory.c - memory management routines for sga code */
/*----------------------------------
www.eeworm.com/read/159593/10637750
c powell.c
#include "hjfgf.c"
double oneoptim(double x0[],double s[],double h0,double epsg,int n,double x[])
{double *a,*b,ff;
a=(double *)malloc(n*sizeof(double));
b=(double *)malloc(n*sizeof(double));
www.eeworm.com/read/159593/10637757
c dfpopt.c
#include "hjfgf.c"
#include "stdlib.h"
void gradient(double x[],double g[],int n)
{int i;
double af,f1,f2,dltx=0.000001;
for(i=0;i
www.eeworm.com/read/159592/10637773
c powell.c
#include "hjfgf.c"
double oneoptim(double x0[],double s[],double h0,double epsg,int n,double x[])
{double *a,*b,ff;
a=(double *)malloc(n*sizeof(double));
b=(double *)malloc(n*sizeof(double));
www.eeworm.com/read/277434/10638881
c 7ngin.c
#include "math.h"
#include "stdlib.h"
#include "6gmiv.c"
int ngin(m,n,eps1,eps2,x,ka,f,s)
void (*f)(),(*s)();
int m,n,ka;
double eps1,eps2,x[];
{ int i,j,k,l,kk,jt;
doubl
www.eeworm.com/read/277434/10638928
c 7netn.c
#include "stdlib.h"
#include "math.h"
#include "stdio.h"
#include "6gaus.c"
int netn(n,eps,t,h,x,k,f)
int n,k;
void (*f)();
double eps,t,h,x[];
{ int i,j,l;
double am,
www.eeworm.com/read/277434/10639156
c 12lplq.c
#include "stdlib.h"
#include "4rinv.c"
#include "4trmul.c"
int lplq(a,b,c,m,n,x)
int m,n;
double a[],b[],c[],x[];
{ int i,mn,k,j,l,*js;
double s,z,dd,y,*p,*d;
js=mall
www.eeworm.com/read/277434/10639307
c 6gmqr.c
#include "4maqr.c"
#include "stdlib.h"
int gmqr(a,m,n,b,q)
int m,n;
double a[],b[],q[];
{ int i,j;
double d,*c;
int maqr(double [],int,int,double []);
c=malloc(n*size