***检测到glibc***..:free(）:无效的下一个大小(正常）:..***fclose(）;之后;
*** glibc detected *** ...: free(): invalid next size (normal): ...*** after fclose();
我刚开始问编程问题，所以如果我做的事情不对/不正确。。。请原谅我。
我习惯了"简单"的ANSI C编程，但我决定尝试在我的"口袋"里添加一些客观的编程技能——现在看起来不太好。起初，我无法以任何方式成功地使用"new"（在运行时分配2D阵列），但最后我放弃了，只使用了我习惯的calloc
但现在我在使用fclose时遇到了这个错误，我不知道它是怎么引起的。。。请帮帮我？
我确实先读了类似的线程，但这次对我没有帮助
这是一个非常简单的小程序，所以我只会复制整个代码，希望有人知道问题出在哪里
#include <iostream>
#include <stdio.h>
#include <stdlib.h>
#include <math.h>
#include <time.h>
#include <fstream>
#include <vector>
#include <new>
#include <malloc.h>
#define min(a,b) ((a) < (b)) ? (a) : (b)
#define square(a) a*a
#define cube(a, b, c) a*b*c
using namespace std;
class AlphaTime
{
long *alpha;
long *time;
long **NeighbourCells;
private:
bool set_NeighbourCells (long);
bool initualize_alpha_t(long);
public:
bool get_NeighbourCells(long );
bool init_NeighbourCells (long);
bool init_alpha_t(long);
void set_initial_places (long, long);
bool run(long, long);
bool count(long, long);
bool print(long, long, long);
};
/**********************************************************************************/
bool AlphaTime::init_alpha_t( long Lmax )
{
bool err;
return (err=initualize_alpha_t(Lmax) );
}
/**********************************************************************************/
bool AlphaTime::initualize_alpha_t( long Lmax )
{
bool err=0;
long i;
alpha = (long*) calloc((size_t) cube(Lmax,Lmax,Lmax), sizeof(long));
if(alpha==NULL) {err=1; goto RET;}
for(i = 0; i < cube(Lmax, Lmax, Lmax); i++)
alpha[i]=0;
RET:
return(err);
}
/**********************************************************************************/
int main(int argc, char *farg[])
{
int i;
bool errflag=0, End=0;
long Conc, Lmax, step;
long Lmax3;
AlphaTime avrami;
if (argc != 3)
goto ERR;
Lmax = atol (farg[2]);
Conc = atol (farg[1]);
Lmax3 = cube(Lmax, Lmax, Lmax);
printf("Conc = %ld, Lmax = %ldn",Conc, Lmax);
if(errflag=avrami.init_alpha_t(Lmax)) goto ERR_AR;
if(errflag=avrami.init_NeighbourCells(Lmax)) goto ERR_AR;
avrami.set_initial_places(Conc, Lmax);
for(step = 2; step < Lmax3; step++)
{
End = avrami.run(Lmax, step);
if (!End) break;
}
if(errflag=avrami.count(Lmax, step)) goto ERR_AR;
cout<<"step = "<<step<<endl; //getchar();
if(errflag=avrami.print(Conc, Lmax, step)) goto ERR_AR;
exit(0);
ERR:
cout<<"Inaccurate start parameters.";
cout<<"nUsage:n avrm number_of_skipped_places_for_active_place length_of_cube_edgen";
exit(-1);
ERR_AR:
cout<<"ERROR while allocating arraysn";
exit(-1);
}
/**********************************************************************************/
bool AlphaTime::init_NeighbourCells( long Lmax )
{
bool err;
return(err=set_NeighbourCells(Lmax));
}
/**********************************************************************************/
bool AlphaTime::set_NeighbourCells( long Lmax )
{
bool err=0;
int i, j, k, t, cell = 0;
long *a1, row;
const long Lmax2 = square(Lmax);
const long Lmax3 = cube(Lmax, Lmax, Lmax);
const long L2Lm1 = cube(Lmax, Lmax, (Lmax-1));
a1 = (long*) calloc((size_t) cube(Lmax,Lmax,Lmax)*7, sizeof(long));
NeighbourCells = (long**) calloc((size_t) 7, sizeof(long*));
if(!a1||!NeighbourCells)
{
err=1;
goto RET;
}
for (row=0; row<(cube(Lmax,Lmax,Lmax)); row++)
{
NeighbourCells[row]=a1+row*7;
if(!NeighbourCells[row])
{
err=1;
goto RET;
}
}
CHECK:
if(!NeighbourCells)
{
err=1;
goto RET;
}
NeighbourCells[0][0]=1;
NeighbourCells[0][1]=Lmax;
NeighbourCells[0][2]=(Lmax*Lmax);
NeighbourCells[0][3]=-1;
NeighbourCells[0][4]=-1;
NeighbourCells[0][5]=-1;
NeighbourCells[0][6]=-1;
for(k = 1; k < Lmax-1; k++)
{
NeighbourCells[k][0]=k-1;
NeighbourCells[k][1]=k+1;
NeighbourCells[k][2]=k+Lmax;
NeighbourCells[k][3]=k+Lmax*Lmax;
NeighbourCells[k][4]=-1;
NeighbourCells[k][5]=-1;
NeighbourCells[k][6]=-1;
}
NeighbourCells[Lmax-1][0]=Lmax-2;
NeighbourCells[Lmax-1][1]=2*Lmax-1;
NeighbourCells[Lmax-1][2]=(Lmax*Lmax+Lmax-1);
NeighbourCells[Lmax-1][3]=-1;
NeighbourCells[Lmax-1][4]=-1;
NeighbourCells[Lmax-1][5]=-1;
NeighbourCells[Lmax-1][6]=-1;
for(j = Lmax; j < Lmax*(Lmax-1); j+=Lmax)
{
//sledwa lqw ryb
NeighbourCells[j][0]=j-Lmax;
NeighbourCells[j][1]=j+1;
NeighbourCells[j][2]=j+Lmax;
NeighbourCells[j][3]=Lmax*Lmax+j;
NeighbourCells[j][4]=NeighbourCells[j][5]=NeighbourCells[j][6]=-1;
for(k = j+1; k < j+Lmax-1; k++)
{
NeighbourCells[k][0]=k-Lmax;
NeighbourCells[k][1]=k-1;
NeighbourCells[k][2]=k+1;
NeighbourCells[k][3]=k+Lmax;
NeighbourCells[k][4]=k+Lmax*Lmax;
NeighbourCells[k][5]=NeighbourCells[k][6]=-1;
}
NeighbourCells[k][0]=k-Lmax;
NeighbourCells[k][1]=k-1;
NeighbourCells[k][2]=k+Lmax;
NeighbourCells[k][3]=Lmax*Lmax+k;
NeighbourCells[k][4]=NeighbourCells[k][5]=NeighbourCells[k][6]=-1;
}
NeighbourCells[Lmax*(Lmax-1)][0]=Lmax*(Lmax-2);
NeighbourCells[Lmax*(Lmax-1)][1]=Lmax*(Lmax-1)+1;
NeighbourCells[Lmax*(Lmax-1)][2]=Lmax*(Lmax-1)+Lmax*Lmax;
NeighbourCells[Lmax*(Lmax-1)][3]=NeighbourCells[Lmax*(Lmax-1)][4]=NeighbourCells[Lmax*(Lmax-1)][5]=NeighbourCells[Lmax*(Lmax-1)][6]=-1;
for(k = Lmax*(Lmax-1)+1; k < (Lmax*Lmax-1)-1; k++)
{
NeighbourCells[k][0]=k-Lmax;
NeighbourCells[k][1]=k-1;
NeighbourCells[k][2]=k+1;
NeighbourCells[k][3]=k+Lmax*Lmax;
NeighbourCells[k][4]=NeighbourCells[k][5]=NeighbourCells[k][6]=-1;
}
NeighbourCells[Lmax*Lmax-1][0]=Lmax*(Lmax-1)-1;
NeighbourCells[Lmax*Lmax-1][1]=Lmax*Lmax-2;
NeighbourCells[Lmax*Lmax-1][2]=Lmax*Lmax-1+Lmax*Lmax;
NeighbourCells[Lmax*Lmax-1][3]=NeighbourCells[Lmax*Lmax-1][4]=NeighbourCells[Lmax*Lmax-1][5]=NeighbourCells[Lmax*Lmax-1][6]=-1;
for(i = Lmax2; i < L2Lm1; i+=Lmax2)
{
NeighbourCells[i][0]=i-Lmax2;
NeighbourCells[i][1]=i+1;
NeighbourCells[i][2]=i+Lmax;
NeighbourCells[i][3]=i+Lmax2;
NeighbourCells[i][4]=NeighbourCells[i][5]=NeighbourCells[i][6]=-1;
for(k = i+1; k < i+Lmax-1; k++)
{
NeighbourCells[k][0]=k-Lmax2;
NeighbourCells[k][1]=k-1;
NeighbourCells[k][2]=k+1;
NeighbourCells[k][3]=k+Lmax;
NeighbourCells[k][4]=k+Lmax2;
NeighbourCells[k][5]=NeighbourCells[k][6]=-1;
}
NeighbourCells[j+Lmax-1][0]=j+Lmax-1-Lmax2;
NeighbourCells[j+Lmax-1][1]=j+Lmax-1-1;
NeighbourCells[j+Lmax-1][2]=j+Lmax-1+Lmax;
NeighbourCells[j+Lmax-1][3]=j+Lmax-1+Lmax2;
NeighbourCells[j+Lmax-1][4]=NeighbourCells[j+Lmax-1][5]=NeighbourCells[j+Lmax-1][6]=-1;
for(j = i+Lmax; j < i+Lmax2-Lmax; j+=Lmax)
{
NeighbourCells[j][0]=j-Lmax2;
NeighbourCells[j][1]=j+1;
NeighbourCells[j][2]=j+Lmax;
NeighbourCells[j][3]=j+Lmax2;
NeighbourCells[j][4]=NeighbourCells[j][5]=NeighbourCells[j][6]=-1;
for(k = j+1; k < j+Lmax-1; k++)
{
NeighbourCells[k][0]=k-Lmax2;
NeighbourCells[k][1]=k-Lmax;
NeighbourCells[k][2]=k-1;
NeighbourCells[k][3]=k+1;
NeighbourCells[k][4]=k+Lmax;
NeighbourCells[k][5]=k+Lmax2;
NeighbourCells[k][6]=-1;
} //for k
NeighbourCells[k][0]=k-Lmax2;
NeighbourCells[k][1]=k-Lmax;
NeighbourCells[k][2]=k-1;
NeighbourCells[k][3]=k+Lmax;
NeighbourCells[k][4]=k+Lmax2;
NeighbourCells[k][5]=NeighbourCells[k][6]=-1;
} //for j
NeighbourCells[j][0]=j-Lmax2;
NeighbourCells[j][1]=j-Lmax;
NeighbourCells[j][2]=j+1;
NeighbourCells[j][3]=j+Lmax2;
NeighbourCells[j][4]=
NeighbourCells[j][4]=NeighbourCells[j][5]=NeighbourCells[j][6]=-1;
for(k = j+1; k < j+Lmax-1; k++)
{
NeighbourCells[k][0]=k-Lmax2;
NeighbourCells[k][1]=k-1;
NeighbourCells[k][2]=k+1;
NeighbourCells[k][3]=k+Lmax2;
NeighbourCells[k][4]=NeighbourCells[k][5]=NeighbourCells[k][6]=-1;
}
NeighbourCells[k][0]=k-Lmax2;
NeighbourCells[k][1]=k-Lmax;
NeighbourCells[k][2]=k-1;
NeighbourCells[k][3]=k+Lmax2;
NeighbourCells[k][4]=NeighbourCells[k][5]=NeighbourCells[k][6]=-1;
}//for i
NeighbourCells[L2Lm1][0]=L2Lm1-Lmax2;
NeighbourCells[L2Lm1][1]=L2Lm1+1;
NeighbourCells[L2Lm1][2]=L2Lm1+Lmax;
NeighbourCells[L2Lm1][3]=-1;
NeighbourCells[L2Lm1][4]=-1;
NeighbourCells[L2Lm1][5]=-1;
NeighbourCells[L2Lm1][6]=-1;
for(k = L2Lm1+1; k < L2Lm1+Lmax-1; k++)
{
NeighbourCells[k][0]=k-Lmax*Lmax;
NeighbourCells[k][1]=k-1;
NeighbourCells[k][2]=k+1;
NeighbourCells[k][3]=k+Lmax;
NeighbourCells[k][4]=-1;
NeighbourCells[k][5]=-1;
NeighbourCells[k][6]=-1;
}
NeighbourCells[Lmax3-Lmax2+Lmax-1][0]=Lmax3-Lmax2+Lmax-1-Lmax2;
NeighbourCells[Lmax3-Lmax2+Lmax-1][1]=Lmax3-Lmax2+Lmax-1-1;
NeighbourCells[Lmax3-Lmax2+Lmax-1][2]=Lmax3-Lmax2+Lmax-1+Lmax;
NeighbourCells[Lmax3-Lmax2+Lmax-1][3]=-1;
NeighbourCells[Lmax3-Lmax2+Lmax-1][4]=-1;
NeighbourCells[Lmax3-Lmax2+Lmax-1][5]=-1;
NeighbourCells[Lmax3-Lmax2+Lmax-1][6]=-1;
for(j = Lmax3-Lmax*(Lmax-1); j < Lmax3-Lmax; j+=Lmax)
{
NeighbourCells[j][0]=j-Lmax2;
NeighbourCells[j][1]=j-Lmax;
NeighbourCells[j][2]=j+1;
NeighbourCells[j][3]=j+Lmax;
NeighbourCells[j][4]=NeighbourCells[j][5]=NeighbourCells[j][6]=-1;
for(k = j+1; k < j+Lmax-1; k++)
{
NeighbourCells[k][0]=k-Lmax2;
NeighbourCells[k][1]=k-Lmax;
NeighbourCells[k][2]=k-1;
NeighbourCells[k][3]=k+1;
NeighbourCells[k][4]=k+Lmax;
NeighbourCells[k][5]=NeighbourCells[k][6]=-1;
}
NeighbourCells[k][0]=k-Lmax2;
NeighbourCells[k][1]=k-Lmax;
NeighbourCells[k][2]=k-1;
NeighbourCells[k][3]=k+Lmax;
NeighbourCells[k][4]=NeighbourCells[k][5]=NeighbourCells[k][6]=-1;
}
NeighbourCells[Lmax3-Lmax][0]=Lmax3-Lmax-Lmax2;
NeighbourCells[Lmax3-Lmax][1]=Lmax3-Lmax-Lmax;
NeighbourCells[Lmax3-Lmax][2]=Lmax3-Lmax+1;
NeighbourCells[Lmax3-Lmax][3]=NeighbourCells[Lmax3-Lmax][4]=NeighbourCells[Lmax3-Lmax][5]=NeighbourCells[Lmax3-Lmax][6]=-1;
for(k = Lmax3-Lmax+1; k < Lmax3-1; k++)
{
NeighbourCells[k][0]=k-Lmax2;
NeighbourCells[k][1]=k-Lmax;
NeighbourCells[k][2]=k-1;
NeighbourCells[k][3]=k+1;
NeighbourCells[k][4]=NeighbourCells[k][5]=NeighbourCells[k][6]=-1;
}
NeighbourCells[Lmax3-1][0]=Lmax3-1-Lmax2;
NeighbourCells[Lmax3-1][1]=Lmax3-1-Lmax;
NeighbourCells[Lmax3-1][2]=Lmax3-1-1;
NeighbourCells[Lmax3-1][3]=-1;
NeighbourCells[Lmax3-1][4]=-1;
NeighbourCells[Lmax3-1][5]=-1;
NeighbourCells[Lmax3-1][6]=-1;
RET:
return(err);
}
/**********************************************************************************/
void AlphaTime::set_initial_places (long Conc, long Lmax)
{
long i, j, k, t, tt, rest, start;
const long Lmax2 = square(Lmax);
const long Lmax3 = cube(Lmax, Lmax, Lmax);
const long L2Lm1 = cube(Lmax, Lmax, (Lmax-1));
for(i = (Conc-1); i < Lmax2; i+=Conc)
{
alpha[i]=1;
}
for(i = (Lmax*Conc -1); i < Lmax3; i+=(Lmax*Conc))
{
alpha[i]=1;
}
j = 0;
while( !( (alpha[j]) && !( (j+1)%Lmax) ) ) j++;
for(i = j; i < Lmax3 - Lmax; i+=Lmax*Conc)
{
alpha[i]=1;
}
for(i = L2Lm1+(Conc-1); i < Lmax3; i+=Conc)
{
alpha[i]=1;
}
for(start = 0, rest = Conc -1, j = start+rest; start < Lmax; start++, j= start*Lmax2+rest )
{
for(i=j; i<(start*Lmax2+Lmax); i+=Conc)
{
alpha[i]=1;
rest = Lmax2*start+Lmax-1-i;
}
rest = Conc-1 - rest;
}
j = i;
for(start = 0, rest = Conc -1; start < Lmax; start++, j= start*Lmax2+Lmax2-Lmax+rest )
{
for(i=j; i<(start*Lmax2+Lmax2); i+=Conc)
{
alpha[i]=1;
rest = start*Lmax2+Lmax2-1-i;
}
rest = Conc-1 - rest;
}
}
/**********************************************************************************/
bool AlphaTime::run( long Lmax, long step)
{
bool More=0;
const long Lmax3 = cube(Lmax, Lmax, Lmax);
long i,j;
for(i = 0; i < Lmax3; i++)
{
if((!alpha[i])||(alpha[i]==step))
{
continue;
}
j = 0;
while(NeighbourCells[i][j]!=-1)
{
if(!alpha[NeighbourCells[i][j]])
{
alpha[NeighbourCells[i][j]] = step;
More=1;
}
j++;
}
}
return(More);
}
/**********************************************************************************/
bool AlphaTime::count( long Lmax, long step)
{
bool err=0;
const long EndStep=step-1;
const char Lmax3 = cube(Lmax, Lmax, Lmax);
long i;
time = (long*) calloc((size_t) EndStep, sizeof(long));
if((alpha==NULL)||(time==NULL)) {err=1; goto RET;}
for (i = 0; i < EndStep; i++) time[i]=0;
for (i = 0; i < Lmax3; i++)
{
time[alpha[i]]++;
}
RET:
return(err);
}
/**********************************************************************************/
bool AlphaTime::print( long Conc, long Lmax, long step)
{
bool err=0;
const long EndStep=step-1;
const char Lmax3 = cube(Lmax, Lmax, Lmax);
char fname[40];
long i, sum=0, Sum;
FILE *fp;
sprintf(fname,"alpha_cubeL%ldC%ld", Lmax,Conc);
fp=fopen(fname,"w");
if(fp==(NULL)) goto RET;
fprintf( fp,"# max time is %ldn",EndStep);
fprintf( fp,"# time dalpha alphan");
for (i = 0, Sum = 0; i < EndStep; i++)
{
Sum+=time[i];
}
for (i = 0; i < EndStep; i++)
{
sum+=time[i];
fprintf( fp," %ld %.5lf %.5lfn",i+1, (double)time[i]/(double)Sum,(double)sum/(double)Sum);
}
fclose(fp);
sprintf(fnameLN,"LNalpha_cubeL%ldC%ld", Lmax,Conc);
fp=fopen(fnameLN,"w");
if(fp==(NULL)) goto RET;
fprintf( fp,"# max time is %ldn",EndStep);
fprintf( fp,"# ln(t) ln(ln(1/(1-alpha)))n");
for (sum=0, i = 0; i < EndStep; i++)
{
sum+=time[i];
if ((time[i])&&(sum!=Sum) )
fprintf( fp," %5lf %5lfn",
log(i+1), log(log(1/(1-(double)sum/(double)Sum))));
}
fclose(fp);
RET:
return(err);
}
输出是…
> g++ -g -lm avrm.cpp -o avrm
> avrm 512 30
Conc = 512, Lmax = 30
step = 34
*** glibc detected *** avrm: free(): invalid next size (normal): 0x0811e698 ***
======= Backtrace: =========
阿尼的想法？请
您只为数组NeighbourCells:分配了7元素
NeighbourCells = (long**) calloc((size_t) 7, sizeof(long*));
但您正在访问超出阵列端的：
for (row=0; row<(cube(Lmax,Lmax,Lmax)); row++)
{
NeighbourCells[row]=a1+row*7;
由于Lmax是传递的第二个命令行参数（转换为long后）。在您的示例运行中，它是30。因此，循环计数器从0运行到27000（即cube(30,30,30)）
相关文章：
- 为什么在popback(）操作之后，它仍然打印完整的矢量
- 在类定义之后定义一个私有方法
- 在循环C++中指定字符串之后，不会打印该字符串
- C++宏忽略之后的内容
- 要与"if constexpr"一起使用的编译时消息(在预处理器之后）
- strncpy之后的char数组的错误行为
- 计算十进制 c++ 之后的数字
- "x += x--"之后的 x 是什么？
- 类的前向声明之后的类成员函数定义，在类声明之前
- 为什么将双精度转换为 int 似乎在第 16 位数字之后将其四舍五入?
- execlp(） 在 fork(） 之后无法正常工作
- 我认为我的代码很好，但它在 cin a 之后停止并且没有进一步?
- 如何在MISRA C++之后实施CRTP
- 在 OpenCV 的 namedWindow 之前或之后初始化 Tesseract
- 检测到堆损坏:在正常块 c++ 动态 2D 数组之后
- C++ 如果在 if 为 true 之后运行，为什么还会这样做
- 在 fork(） 之后，我在我的程序中不断得到相同的 pid
- OpenSSL C API:如何在程序exec(）之后恢复TLS连接?
- 了解在返回值之前和之后使用 EAX 的函数调用
- ***检测到glibc***..:free(）:无效的下一个大小(正常）:..***fclose(）;之后;
