在c++;代码gdb 我在运行C++应用程序时遇到了SEG错误。在gdb中,它以某种方式显示我的单指针位置已损坏。但我在应用程序中创建了十万个这样的对象指针。我怎么能看一个导致撞车的呢 我可以在bt命令中执行任何操作来查看该指针的生存期吗
谢谢在c++;代码gdb 我在运行C++应用程序时遇到了SEG错误。在gdb中,它以某种方式显示我的单指针位置已损坏。但我在应用程序中创建了十万个这样的对象指针。我怎么能看一个导致撞车的呢 我可以在bt命令中执行任何操作来查看该指针的生存期吗,c++,gdb,C++,Gdb,谢谢 Ruchi据我所知,在gdb的帮助下,您无法获得此类信息,但出于这些目的,您可以尝试valgrind memcheck with option--track origins我过去在具有大约256K指针的应用程序中遇到过一些mem泄漏问题(由编译器错误引起),因此我不得不以某种方式进行检查。经过一番努力之后,我创建了一个包含所有分配指针及其大小的表,并创建了一些函数来保持更新。结果是: 文件:mmap.h //-----------------------------------------
Ruchi据我所知,在gdb的帮助下,您无法获得此类信息,但出于这些目的,您可以尝试valgrind memcheck with option--track origins我过去在具有大约256K指针的应用程序中遇到过一些mem泄漏问题(由编译器错误引起),因此我不得不以某种方式进行检查。经过一番努力之后,我创建了一个包含所有分配指针及其大小的表,并创建了一些函数来保持更新。结果是: 文件:mmap.h
//---------------------------------------------------------------------------
//--- Memory map system ver: 2.03 -------------------------------------------
//---------------------------------------------------------------------------
#ifndef _mmap_h
#define _mmap_h
//---------------------------------------------------------------------------
#define _mmap_aprox
//---------------------------------------------------------------------------
/*
new
#ifdef _mmap_h
if () mmap_new('Main',,sizeof());
#endif
#ifdef _mmap_h
if () mmap_del('Main',);
#endif
delete
*/
//---------------------------------------------------------------------------
struct _mmap_entry
{
char ids[4]; // id string
DWORD beg,end; // mem adr <beg,end)
_mmap_entry(){ beg=0; end=0; ((DWORD*)(ids))[0]='LLUN'; };
_mmap_entry(_mmap_entry& a) { *this=a; }
~_mmap_entry() {}
_mmap_entry* operator = (const _mmap_entry *a) { *this=*a; return this; }
//_mmap_entry* operator = (const _mmap_entry &a) { ...copy... return this; }
};
//---------------------------------------------------------------------------
const int _mmap_entries=4*1024; // max num of allocated memory chunks (pointers)
const int _mmapn_entries=32; // num of last news to remember
const int _mmapd_entries=32; // num of last dels to remember
static _mmap_entry mmap [_mmap_entries]; // memory map table active ptrs
static _mmap_entry mmapn[_mmapn_entries]; // memory map table last news
static _mmap_entry mmapd[_mmapd_entries]; // memory map table last dels
static int mmaps=0; // num of used entries in memory map table
static int mmapn_ix=0; // num of last deletes to remember
static int mmapd_ix=0; // num of last deletes to remember
static int mmap_errs=0; // error count
static int mmap_news=0; // allocations count
static int mmap_dels=0; // deallocations count
//---------------------------------------------------------------------------
void mmap_err(const char* msg,DWORD ptr) // breakpointeable error
{
mmap_errs++;
}
//---------------------------------------------------------------------------
int mmap_new(DWORD ids,void* ptr,DWORD siz) // tracks all allocations return false if error
{
mmap_news++;
int i,j; _mmap_entry e,*p;
e.beg=DWORD(ptr);
e.end=e.beg+siz;
e.ids[0]=((char*)&ids)[3];
e.ids[1]=((char*)&ids)[2];
e.ids[2]=((char*)&ids)[1];
e.ids[3]=((char*)&ids)[0];
if (e.beg==0)
{
mmap_err("Not enough memory.",e.beg);
return 0;
}
// find first i where mmap[i].end >= e.beg
#ifdef _mmap_aprox
if (!mmaps) i=0;
else{
for (j=1;j<mmaps;j<<=1); j>>=1; if (!j) j=1;
for (i=0;j;j>>=1)
{
i|=j;
p=mmap+i;
if ((i>=mmaps)||(e.beg<p->end)) i^=j;
if ((e.beg<p->end)&&(e.end>p->beg))
{
mmap_err("Bad allocation.",e.beg); // memory already allocated
return 0;
}
}
if (e.beg>=mmap[i].end) i++;
}
#endif
#ifndef _mmap_aprox
for (i=mmaps-1,p=mmap+i;i>=0;i--,p--)
if (e.beg<p->end)
{
if (e.end>p->beg)
{
mmap_err("Bad allocation.",e.beg); // memory already allocated
return 0;
}
} else break; i++;
#endif
// insert new pointer at i
if (mmaps>=_mmap_entries)
{
mmap_err("Too many pointers.",e.beg); // _mmap_entries is too low
return 0;
}
for (j=mmaps;j>i;j--) mmap[j]=mmap[j-1];
mmap[i]=e; mmaps++;
// remember last new in mmapn table
mmapn[mmapn_ix]=e; mmapn_ix++;
if (mmapn_ix>=_mmapn_entries) mmapn_ix=0;
return 1;
};
//---------------------------------------------------------------------------
int mmap_del(DWORD ids,void* ptr) // tracks all deallocations return false if error
{
mmap_dels++;
int i,j; _mmap_entry *p;
DWORD adr=DWORD(ptr);
if (adr==0)
{
mmap_err("Can not delete NULL.",adr);
return 0;
}
if (mmap<=0)
{
mmap_err("Nothing to delete.",adr);
return 0;
}
// find mmap[i] where beg==ptr and delete it if found
#ifdef _mmap_aprox
if (!mmaps) i=0;
else{
for (j=1;j<mmaps;j<<=1); j>>=1; if (!j) j=1;
for (i=0;j;j>>=1)
{
i|=j;
p=mmap+i;
if ((i>=mmaps)||(adr<p->beg)) i^=j;
}
if (adr==mmap[i].beg)
{
if (mmaps>1) for (j=i;j<mmaps-1;j++) mmap[j]=mmap[j+1];
mmaps--;
// remember last delete in mmapd table
mmapd[mmapd_ix]=mmap[mmaps]; mmapd_ix++;
if (mmapd_ix>=_mmapd_entries) mmapd_ix=0;
// delete ptr from mmap table
mmap[mmaps].beg=0;
mmap[mmaps].end=0;
return 1;
}
for (p=mmap,j=0;j<=i;j++,p++) // test all mmap[j].beg < adr
if (adr<p->end) // if overlap then ...
{
mmap_err("Wrong delete pointer.",adr); // pointer inside already allocated space
return 0;
}
}
#endif
#ifndef _mmap_aprox
for (p=mmap,i=0;i<mmaps;i++,p++)
if (p->beg==adr)
{
if (mmaps>1) for (j=i;j<mmaps-1;j++) mmap[j]=mmap[j+1];
mmaps--;
mmap[mmaps].beg=0;
mmap[mmaps].end=0;
return 1;
} else if (p->beg>adr) break;
for (p=mmap,i=0;i<mmaps;i++,p++)
if ((adr>p->beg)&&(adr<p->end))
{
mmap_err("Wrong delete pointer.",adr); // pointer inside already allocated space
return 0;
}
#endif
mmap_err("Delete pointer not found.",adr);
return 0;
};
//---------------------------------------------------------------------------
#endif
//---------------------------------------------------------------------------
//---------------------------------------------------------------------------
因此,如果您将mmap.h作为第一个包含项强>
- 将断点放在函数void mmap_err(const char*msg,DWORD ptr)内
- 运行应用程序
- 如果发生任何分配错误,那么它将在异常之前中断,这样您就可以实际看到信息和种类错误,也可以单步执行错误发生的代码
对于将动态分配的所有结构和类或其任何组件
是这样的:
class/struct T
{
public:
T() {}
T(T& a) { *this=a; }
~T() {}
T* operator = (const T *a) { *this=*a; return this; }
// if any dynamic allocation occur then this must be done also else not
//T* operator = (const T &a) { ... copy a to this ... return this; }
};
看看valgrind,它会给你你需要的信息谢谢sim,你能告诉我追踪来源的语法吗。。我找不到帮助?
class/struct T
{
public:
T() {}
T(T& a) { *this=a; }
~T() {}
T* operator = (const T *a) { *this=*a; return this; }
// if any dynamic allocation occur then this must be done also else not
//T* operator = (const T &a) { ... copy a to this ... return this; }
};