C++:重载全局new/delete实现跨平台多线程内存检测
Reference: https://blog.csdn.net/u014023615/article/details/39551191
Reference: https://blog.csdn.net/u014023615/article/details/39551191
实现类:
DumpMemoryLeaks.h
/**
* @file DumpMemoryLeaks.h
* @brief 跟踪内存分配并定时输到文件,以协助检查有无内存泄漏
*
* 修订记录
* @author jack3z
* @version 1.00
* @date 2014-05-18
*
*/
#ifndef DUMPMEMORYLEAKS_H
#define DUMPMEMORYLEAKS_H
#ifdef __linux__
# include <pthread.h>
#else
# include <Windows.h>
#endif
#include <stdio.h>
#include <stdlib.h>
#include <malloc.h>
#include <time.h>
#include <string>
#include <map>
#include <list>
#include <assert.h>
#ifndef DUMP_MEM_REPORT_FREQUENCY
//# define DUMP_MEM_REPORT_FREQUENCY (30*60) //每隔30分钟输出一次内存分配情况
//# define DUMP_MEM_REPORT_FREQUENCY 60 //每隔一分钟输出一次内存分配情况
# define DUMP_MEM_REPORT_FREQUENCY 10 //测试时,10秒输出一次内存分配情况
#endif
struct StMemAllocRec
{
void* addr;
size_t nSize;
};
class CAllocLocalInfo
{
public:
CAllocLocalInfo()
{
m_nLine = -1;
}
std::string m_strFile;
int m_nLine;
bool operator<(const CAllocLocalInfo& other) const
{
return m_strFile < other.m_strFile || (m_strFile==other.m_strFile && m_nLine < other.m_nLine);
}
};
class CDumpMemoryLeaks
{
private:
CDumpMemoryLeaks(void);
~CDumpMemoryLeaks(void);
public:
static CDumpMemoryLeaks& GetInstance()
{
static CDumpMemoryLeaks inst;
return inst;
}
void Init();
void AddTrack(void* addr, size_t asize, const char *fname, int lnum);
void RemoveTrack(void* addr);
protected:
bool IsTheTime2Dump()
{
return m_timeDump < time(NULL);
}
void ResetDumpTime()
{
m_timeDump = time(NULL) + DUMP_MEM_REPORT_FREQUENCY;
}
void Dump();
void lock()
{
#ifdef __linux__
pthread_mutex_lock(&m_mtx);
#else
EnterCriticalSection(&m_mtx);
#endif
}
void unlock()
{
#ifdef __linux__
pthread_mutex_unlock(&m_mtx);
#else
LeaveCriticalSection(&m_mtx);
#endif
}
protected:
bool m_bInit;
FILE* m_fpDumpFile;
std::string m_strDumpFile;
std::map< CAllocLocalInfo, std::list<StMemAllocRec> > m_mapAllocRec;
std::map<void *,CAllocLocalInfo> m_mapAddr2AllocLocal;
time_t m_timeDump;
std::string m_strMsg;
char m_szBuf[1024];
#ifdef __linux__
pthread_mutex_t m_mtx;
#else
CRITICAL_SECTION m_mtx;
#endif
};
//#ifdef DEBUG_REPORT_NEW_ALLOC
inline void * operator new(size_t size, const char* file, const size_t line)
{
void *ptr = (void*)malloc(size);
CDumpMemoryLeaks::GetInstance().AddTrack(ptr, size, file, line);
return(ptr);
}
inline void * operator new [](size_t size, const char* file, const size_t line)
{
void *ptr = (void*)malloc(size);
CDumpMemoryLeaks::GetInstance().AddTrack(ptr, size, file, line);
return ptr;
}
inline void operator delete(void *p)
{
CDumpMemoryLeaks::GetInstance().RemoveTrack(p);
free(p);
}
inline void operator delete(void *p, size_t size)
{
CDumpMemoryLeaks::GetInstance().RemoveTrack(p);
free(p);
}
inline void operator delete(void *p, const char* file, const size_t line)
{
CDumpMemoryLeaks::GetInstance().RemoveTrack(p);
free(p);
}
inline void operator delete [](void *p)
{
CDumpMemoryLeaks::GetInstance().RemoveTrack(p);
free(p);
}
inline void operator delete [](void *p, size_t size)
{
CDumpMemoryLeaks::GetInstance().RemoveTrack(p);
free(p);
}
inline void operator delete [](void *p, const char* file, const size_t line)
{
CDumpMemoryLeaks::GetInstance().RemoveTrack(p);
free(p);
}
#define malloc(s) ((void*)new unsigned char[s])
#define free(p) (delete [] (char*)(p));
#define new new(__FILE__, __LINE__) //1st parameter:size is not needed, passed by the compiler
//#endif
#endif
DumpMemoryLeaks.cpp
#include "DumpMemoryLeaks.h"
#ifndef localtime_r
#if _MSC_VER >= 1400
//Visual C++ 2005 以及更高版本
# define localtime_r(_Time_ptr,_Tm_ptr) (localtime_s((_Tm_ptr),(_Time_ptr)) == 0 ? (_Tm_ptr) : NULL)
#else
# define localtime_r(_Time_ptr,_Tm_ptr) ( *(_Tm_ptr) = *localtime(_Time_ptr), (_Tm_ptr))
#endif //#if _MSC_VER >= 1500
#endif //#ifndef localtime_r
#ifdef _MSC_VER
# ifndef snprintf
# define snprintf _snprintf
# endif//snprintf
#endif //_MSC_VER
CDumpMemoryLeaks::CDumpMemoryLeaks(void)
{
m_bInit = false;
m_fpDumpFile = NULL;
m_timeDump = NULL;
memset(m_szBuf,0,sizeof(m_szBuf));
#ifdef __linux__
pthread_mutexattr_t mattr;
pthread_mutexattr_init(&mattr);
pthread_mutexattr_settype(&mattr , PTHREAD_MUTEX_RECURSIVE);
pthread_mutex_init(&m_mtx,&mattr);
#else
InitializeCriticalSection(&m_mtx);
#endif
}
CDumpMemoryLeaks::~CDumpMemoryLeaks(void)
{
if (m_fpDumpFile)
{
fclose(m_fpDumpFile);
m_fpDumpFile = NULL;
}
#ifdef __linux__
pthread_mutex_destroy(&m_mtx);
#else
DeleteCriticalSection(&m_mtx);
#endif
}
void CDumpMemoryLeaks::Init()
{
lock();
if (!m_bInit)
{
ResetDumpTime();
m_bInit = true;
}
unlock();
}
void CDumpMemoryLeaks::AddTrack(void* addr, size_t asize, const char *fname, int lnum)
{
lock();
if (!m_bInit)
{
Init();
}
CAllocLocalInfo alloc_local;
alloc_local.m_strFile = fname;
alloc_local.m_nLine = lnum;
StMemAllocRec mem_alloc_rec;
mem_alloc_rec.addr = addr;
mem_alloc_rec.nSize = asize;
m_mapAllocRec[alloc_local].push_back(mem_alloc_rec);
m_mapAddr2AllocLocal[addr] = alloc_local;
if (IsTheTime2Dump())
{
Dump();
ResetDumpTime();
}
unlock();
}
void CDumpMemoryLeaks::RemoveTrack(void* addr)
{
lock();
if (!m_bInit)
{
Init();
}
bool bRemoveSuccess = false;
std::map<void *, CAllocLocalInfo>::iterator itorAddr2AllocLocal = m_mapAddr2AllocLocal.find(addr);
if (itorAddr2AllocLocal == m_mapAddr2AllocLocal.end())
{
unlock();
return;
}
else
{
std::map< CAllocLocalInfo, std::list<StMemAllocRec> >::iterator itorAllocRec = m_mapAllocRec.find(itorAddr2AllocLocal->second);
assert(itorAllocRec != m_mapAllocRec.end());
std::list<StMemAllocRec>& listAllocRec = itorAllocRec->second;
for (std::list<StMemAllocRec>::iterator itor = listAllocRec.begin();
itor != listAllocRec.end();
++itor)
{
if ((*itor).addr == addr)
{
listAllocRec.erase(itor);
bRemoveSuccess = true;
break;
}
}
if (listAllocRec.empty())
{
m_mapAllocRec.erase(itorAllocRec);
m_mapAddr2AllocLocal.erase(itorAddr2AllocLocal);
}
}
assert(bRemoveSuccess);
if (IsTheTime2Dump())
{
Dump();
ResetDumpTime();
}
unlock();
}
void CDumpMemoryLeaks::Dump()
{
time_t timeNow = time(NULL);
struct tm tmNow;
if (NULL == localtime_r(&timeNow,&tmNow))
{
assert(false);
}
if (m_strMsg.empty())
{//生成信息
size_t nTotalAlloc = 0;
std::list<CAllocLocalInfo> listLocal;//按内存大到小排序
std::map<CAllocLocalInfo,size_t> mapLocal2Size;
for (std::map< CAllocLocalInfo, std::list<StMemAllocRec> >::iterator itor = m_mapAllocRec.begin();
itor != m_mapAllocRec.end();
++itor)
{
const CAllocLocalInfo& local = itor->first;
std::list<StMemAllocRec>& listAllocRec = itor->second;
for (std::list<StMemAllocRec>::iterator itor = listAllocRec.begin();
itor != listAllocRec.end();
++itor)
{
nTotalAlloc += itor->nSize;
mapLocal2Size[local] += itor->nSize;
}
}
for (std::map<CAllocLocalInfo,size_t>::iterator itor = mapLocal2Size.begin();
itor != mapLocal2Size.end();
++itor)
{
std::list<CAllocLocalInfo>::iterator itorLocalList = listLocal.begin();
for (;
itorLocalList != listLocal.end();
++itorLocalList)
{
if (itor->second >= mapLocal2Size[*itorLocalList])
{
break;
}
}
listLocal.insert(itorLocalList,itor->first);
}
snprintf(m_szBuf,sizeof(m_szBuf)-1,"Total unfree:%lu \n",(unsigned long)nTotalAlloc);
m_strMsg += "\n";
m_strMsg += m_szBuf;
m_strMsg += "--------------------------------------------------------------------------\n";
snprintf(m_szBuf,sizeof(m_szBuf)-1,
"Time: %04u-%02u-%02u %02u:%02u:%02u\n\n",
tmNow.tm_year + 1900,
tmNow.tm_mon + 1,
tmNow.tm_mday,
tmNow.tm_hour,
tmNow.tm_min,
tmNow.tm_sec
);
m_strMsg += m_szBuf;
double dTotalReciprocal = 1.0/(double)nTotalAlloc;
for (std::list<CAllocLocalInfo>::iterator itorLocalList = listLocal.begin();
itorLocalList != listLocal.end();
++itorLocalList)
{
size_t nSize = mapLocal2Size[*itorLocalList];
snprintf(m_szBuf,sizeof(m_szBuf)-1,
"%s:line %d, unfreed size:%lu, percentage:%lf %%; alloc times:%lu\n",
itorLocalList->m_strFile.c_str(),
itorLocalList->m_nLine,
nSize,
nSize*dTotalReciprocal*100,
(unsigned long)m_mapAllocRec[*itorLocalList].size()
);
m_strMsg += m_szBuf;
}
m_strMsg += "--------------------------------------------------------------------------\n";
}
//////////////////////////////////////////////////////////////////////////
//文件操作:打开文件,分割文件并写入
snprintf(m_szBuf,sizeof(m_szBuf)-1,
"MemoryAllocReport_%04u-%02u-%02u.txt",
tmNow.tm_year + 1900,
tmNow.tm_mon + 1,
tmNow.tm_mday
);
if (!m_fpDumpFile)
{
m_fpDumpFile = fopen(m_szBuf,"a");
m_strDumpFile = m_szBuf;
fprintf(m_fpDumpFile, "\n\n---------------- DumpMemoryLeaks begin! ----------------\n");
}
else
{
if (m_strDumpFile != m_szBuf)
{
fclose(m_fpDumpFile);
m_fpDumpFile = fopen(m_szBuf,"w");
m_strDumpFile = m_szBuf;
}
}
fwrite(m_strMsg.c_str(),m_strMsg.length(),1,m_fpDumpFile);
//文件操作结束
//////////////////////////////////////////////////////////////////////////
m_strMsg.clear();
}
实现方法:把文件保存到项目源文件目录下并在全局头文件添加# include "DumpMemoryLeaks.h"
如在win32工程中的stdafx.h文件内添加:
#ifdef _DEBUG
# include "DumpMemoryLeaks.h"
#endif // _DEBUG
测试:
// DbgMemLeak.cpp : 定义控制台应用程序的入口点。
//
#include "stdafx.h"
#include <list>
using namespace std;
class A
{
public:
A()
{
m_i = 9;
}
~A()
{
if (m_i != 9)
{
assert(false);
}
m_i = 1;
}
int m_i;
};
class B
{
public:
B()
{
printf("new B instance %p \n", this);
}
~B()
{
printf("delete B instance %p \n", this);
}
};
int main(int argc, _TCHAR* argv[])
{
/*
{//测试构造和析构
B* pB = new B();
delete pB;
Sleep(3*1000);//方便观察终端输出内容
}
*/
{//测试数组构造和析构
B* pArray = new B[4];
delete[] pArray;
pArray = NULL;
Sleep(3*1000);//方便观察终端输出内容
}
/*
{//测试new和delete基础类型数组
char* pChArr = new char[1024];
delete pChArr;
}
*/
//模拟内存泄漏
for (int i = 0; i < 60*30*10; ++i)
{
A* p = new A ;
Sleep(100);
if (i%2 == 0)
{
delete p;
}
}
for (int i = 0; ; ++i)
{
A* p = new A ;
Sleep(1);
if (i%4 == 0)
{
delete p;
}
}
return 0;
}
---------------------
本文来自 jack3z 的CSDN 博客 ,全文地址请点击:https://blog.csdn.net/u014023615/article/details/39551191?utm_source=copy
C++:重载全局new/delete实现跨平台多线程内存检测的更多相关文章
- 重载全局new/delete实现内存检测
下面介绍用重载new/delete运算符的方式来实现一个简单的内存泄露检测工具,基本思想是重载全局new/delete运算符,被检测代码调用new和delete运算符时就会调用重载过的operator ...
- 【ThinkingInC++】64、重载new和delete,来模仿内存的分配
/** * 书本:[ThinkingInC++] * 功能:重载new和delete.来模仿内存的分配 * 时间:2014年10月5日14:30:11 * 作者:cutter_point */ #in ...
- 重载operator new delete函数
可以重载global的operator new delete 函数,细节如下: MyNewDelete.h #pragma once #include <stdlib.h> #includ ...
- ZT c++ 中的重载全局new,delete
c++ 中的重载全局new,delete 分类: c++ 2010-08-06 10:31 116人阅读 评论(1) 收藏 举报 deletec++file编译器语言工作 最近做一个小项目,对c++又 ...
- C++ 重载new和delete操作符
原因: C++标准库提供的new和delete操作符,是一个通用实现,未针对具体对象做具体分析 存在分配器速度慢.小型对象空间浪费严重等问题,不适用于对效率和内存有限制的应用场景 好处: 灵活的内 ...
- 重载new和delete来检测内存泄漏
重载new和delete来检测内存泄漏 1. 简述 内存泄漏属于资源泄漏的一种,百度百科将内存泄漏分为四种:常发性内存泄漏.偶发性内存泄漏.一次性内存泄漏和隐式内存泄漏. 常发性指:内存泄漏的代 ...
- 重载new和delete
当我们创建一个new表达式时,会发生两件事.首先使用operator new()分配内存,然后调用构造函数.在delete表达式里,调用了析构函数,然后使用operator delete()释放内存. ...
- C++中基于Crt的内存泄漏检测(重载new和delete,记录在Map里)
尽管这个概念已经让人说滥了 ,还是想简单记录一下, 以备以后查询. #ifdef _DEBUG#define DEBUG_CLIENTBLOCK new( _CLIENT_BLOCK, __FIL ...
- c/c++ 重载new,delete运算符 placement new
重载new,delete运算符 new,delete在c++中也被归为运算符,所以可以重载它们. new的行为: 先开辟内存空间 再调用类的构造函数 开辟内存空间的部分,可以被重载. delete的行 ...
随机推荐
- ubuntu TensorFlow安装
Tensorflow安装确实比caffe简单... cuda,cudnn安装就不说了 1 安裝pip(有就跳过) sudo apt-get install python-pip python-dev ...
- Python爬虫之Beautiful Soup解析库的使用(五)
Python爬虫之Beautiful Soup解析库的使用 Beautiful Soup-介绍 Python第三方库,用于从HTML或XML中提取数据官方:http://www.crummv.com/ ...
- 005.Docker存储管理
一 Docker volume形态 因为Docker 采用 AFUS 分层文件系统时,文件系统的改动都是发生在最上面的容器层,在容器的生命周期内,它是持续的,包括容器在被停止后.但是,当容器被删除后, ...
- RBF(径向基)神经网络
只要模型是一层一层的,并使用AD/BP算法,就能称作 BP神经网络.RBF 神经网络是其中一个特例.本文主要包括以下内容: 什么是径向基函数 RBF神经网络 RBF神经网络的学习问题 RBF神经网络与 ...
- jQueryPrint 的简单使用
jQueryPrint 的简单使用 一.为什么要使用 jQueryPrint? 1.当然是方便的要死尼,相比于其他的方法. 2.打印整个页面或者局部页面都是非常的可以的,使用很方便. 3.如果要导出 ...
- [SRM577]BoardPainting
题意:一个全白的网格,你要将一些格子涂黑,每次只能选一行或一列中的连续白格涂黑,问最小操作次数 先假装我们一次涂一个联通块,那么答案就是联通块个数,然后在这个基础上增加一些代价让方案变得合法 考虑这样 ...
- 4558: [JLoi2016]方
4558: [JLoi2016]方 https://lydsy.com/JudgeOnline/problem.php?id=4558 分析: 容斥原理+各种神奇的计数. 如果没有被删除了的点的话,直 ...
- BZOJ.3638.CF172 k-Maximum Subsequence Sum(模拟费用流 线段树)
题目链接 各种zz错误..简直了 /* 19604kb 36292ms 题意:选$k$段不相交的区间,使其权值和最大. 朴素线段树:线段树上每个点维护O(k)个信息,区间合并时O(k^2),总O(mk ...
- python生成指定文件夹目录树
# -*- coding: utf-8 -*- import sys from pathlib import Path class DirectionTree(object): "" ...
- centos 7 秘钥分发
生成秘钥 [root@node1 ~]# ssh-keygen 查看秘钥 [root@node1 ~]# ls .ssh/id_rsa* .ssh/id_rsa .ssh/id_rsa.pub 将秘钥 ...