c++ [wrong]simple "Garbage Collector"
In fact, Ptr alone can accomplish the task mentioned below.
Implementation see Ptr.h, main2.cpp. In C++11, we also have a better choice: std::shared_ptr (as you can see in main3.cpp).
main2.cpp
#include "Ptr.h" #include <iostream> using namespace std; class Box
{
public:
void dosomething() { cout << "Box dosomething" << endl; }
Box() { cout << "Box cons" << endl; }
~Box() { cout << "Box des" << endl; }
}; Ptr<Box> global; Ptr<Box> func() {
Ptr<Box> pb(new Box());
return pb;
} void call(Ptr<Box> ptr)
{
if(ptr)
ptr->dosomething();
else
cout << "ptr is null" << endl;
} int main()
{
Ptr<Box> p = func();
p->dosomething();
(*p).dosomething();
Ptr<Box> p2 = p;
call(p2);
p2.reset();
cout << "after p2.reset" << endl;
global = p;
p.reset();
call(p);
(*global).dosomething();
global.reset();
cout << "after global.reset" << endl;
return ;
}
Ptr.h
#ifndef PTR_H
#define PTR_H #include <cstddef> template <typename TYPE>
class Ptr { public:
void reset()
{
dec_use();
}
Ptr& operator=(const Ptr<TYPE> ©)
{
dec_use();
obj = copy.obj;
use_count = copy.use_count;
if (use_count) ++*use_count;
return *this;
}
TYPE* operator->() { return obj; }
TYPE& operator*() { return *obj; }
const TYPE* operator->() const { return obj; }
const TYPE& operator*() const { return *obj; }
operator bool() const { return (obj != NULL); } Ptr(): obj(NULL), use_count(NULL) {}
Ptr(TYPE *obj_): obj(obj_), use_count(new int()) {}
Ptr(const Ptr ©): obj(NULL), use_count(NULL)
{
obj = copy.obj;
use_count = copy.use_count;
if (use_count) ++*use_count;
}
~Ptr()
{
dec_use();
}
private:
void dec_use() // decrease use_count
{
if (use_count != NULL) {
if( --*use_count == ) {
delete obj;
delete use_count;
}
obj = NULL;
use_count = NULL;
}
}
TYPE *obj; // the actual object
int *use_count; // number of Ptr objects point to 'obj'
}; #endif // PTR_H
main3.cpp
#include <memory> #include <iostream> using namespace std; class Box
{
public:
void dosomething() { cout << "Box dosomething" << endl; }
Box() { cout << "Box cons" << endl; }
~Box() { cout << "Box des" << endl; }
}; shared_ptr<Box> global; shared_ptr<Box> func() {
shared_ptr<Box> pb(new Box());
return pb;
} void call(shared_ptr<Box> ptr)
{
if(ptr)
ptr->dosomething();
else
cout << "ptr is null" << endl;
} int main()
{
shared_ptr<Box> p = func();
p->dosomething();
(*p).dosomething();
shared_ptr<Box> p2 = p;
call(p2);
p2.reset();
cout << "after p2.reset" << endl;
global = p;
p.reset();
call(p);
(*global).dosomething();
global.reset();
cout << "after global.reset" << endl;
return ;
}
---------------------------------------- stupidest iead I've ever seen -----------------------------------------
| |
| |
The idea is to create a Ptr type that acts like a reference in Java.
And A Garbage Collector (MemMgr) type that acts like a garbage collector in Java.
Just a toy. :D
Question: why not delete all memory fragments managed by MemMgr in its destructor?
Answer: If you want to delete a piece of memory, you must cast the void* pointer to the exact type of that memory. However, there's no way for a MemMgr to know the type of the memory pieces, because type information is not managed by MemMgr. And you can't use the free function from <cstdlib>. For example, if you write "MemMgr *p = new MemMgr; free(p);" you'll find that the destructor of MemMgr is not called. And As shown in "test.cpp". "free" only works in pair with "malloc" or "realloc" etc functions in <cstdlib>. "delete" should work in pair with "new".
see this question: http://stackoverflow.com/questions/1518711/how-does-free-know-how-much-to-free
test.cpp
#include "MemMgr.h"
#include <cstdlib> int main()
{
MemMgr *p = new MemMgr;
free(p);
return ;
}
main.cpp
#include "MemMgr.h" #include <iostream> using namespace std; class Box
{
public:
void dosomething() { cout << "Box dosomething" << endl; }
Box() { cout << "Box cons" << endl; }
~Box() { cout << "Box des" << endl; }
}; Ptr<Box> global;
MemMgr mgr; Ptr<Box> func() {
Ptr<Box> pb = mgr.regist(new Box());
return pb;
} int main()
{
Ptr<Box> p = func();
p->dosomething();
(*p).dosomething();
Ptr<Box> p2 = p;
p2->dosomething();
cout << "end of main" << endl;
global = p2;
return ;
}
MemMgr.h
#ifndef MEMMGR_H
#define MEMMGR_H #include <map> template <typename TYPE>
class Ptr; /**
MemMgr take the idea of Garbage Collector
from the Java language. It's just much simple
and limited.
*/
class MemMgr
{
template <typename T> friend class Ptr;
private:
typedef unsigned long count;
template <typename T> void login(T* ptr_obj);
template <typename T> void logout(T* ptr_obj);
std::map<void*, count> cmap;
public:
MemMgr();
/**
Client is responsible to ensure obj is in the heap,
and make sure only use Ptr objects rather than ordinary
pointers when manipulating objects managed by MemMgr. Otherwise the behavior of the MemMgr is undefined. If MemMgr is destroyed before any Ptr object managed
by it, all Ptr objects managed by that MemMgr are corrupted
and their behavior is undefined, which eventually leads to
memory leak. So it's crucial to make sure MemMgr is not destroyed
before ALL Ptr objects managed by it are destroyed.
*/
template <typename T> Ptr<T> regist(T *obj);
~MemMgr(); }; /**
Ptr acts like a reference in java.
*/
template <typename TYPE>
class Ptr { friend class MemMgr; public:
Ptr& operator=(const Ptr<TYPE> ©)
{
if(copy) {
logout();
obj = copy.obj;
mgr = copy.mgr;
copy.mgr->login(&obj);
} // else leaves obj and mgr NULL
return *this;
}
TYPE* operator->() { return obj; }
TYPE& operator*() { return *obj; }
const TYPE* operator->() const { return obj; }
const TYPE& operator*() const { return *obj; }
operator bool() const { return ( (obj != NULL) && (mgr != NULL) ); } Ptr(): obj(NULL), mgr(NULL) {}
Ptr(const Ptr ©): obj(NULL), mgr(NULL)
{
if(copy) {
obj = copy.obj;
mgr = copy.mgr;
copy.mgr->login(obj);
}
}
~Ptr()
{
logout();
}
private:
Ptr(TYPE *_obj, MemMgr *_mgr): obj(_obj), mgr(_mgr)
{
mgr->login(obj);
}
void logout() {
if (*this) {
mgr->logout(obj); obj = NULL; mgr = NULL;
}
}
TYPE *obj;
MemMgr *mgr;
}; template <typename T> Ptr<T> MemMgr::regist(T *obj)
{
return Ptr<T>(obj, this);
} template <typename T>
void MemMgr::login(T* ptr_obj)
{
std::map<void*, count>::iterator iter = cmap.find(ptr_obj);
if (iter != cmap.end()) {
++(iter->second);
} else {
cmap.insert(std::pair<void*, count>(ptr_obj, ));
}
} template <typename T>
void MemMgr::logout(T* ptr_obj)
{
std::map<void*, count>::iterator iter = cmap.find(ptr_obj);
if (iter != cmap.end()) {
--(iter->second);
if (iter->second == ) {
T *p = (T*)(iter->first);
delete p;
}
}
} #endif // MEMMGR_H
MemMgr.cpp
#include "MemMgr.h" #include <iostream> using namespace std; MemMgr::MemMgr()
{
cout << "MemMgr cons" << endl;
} MemMgr::~MemMgr()
{
cout << "MemMgr des" << endl;
}
c++ [wrong]simple "Garbage Collector"的更多相关文章
- [GC]一个简单的Garbage Collector的实现
前言: 最近看了google的工程师写的一个非常简单的垃圾收集器,大概200多行C代码,感叹大牛总能够把复杂的东西通过很简单的语言和代码表达出来.为了增加自己的理解,决定把大牛的想法和代码分析一遍,与 ...
- 一个简单的Garbage Collector的实现
一个简单的Garbage Collector的实现 前言: 最近看了google的工程师写的一个非常简单的垃圾收集器,大概200多行C代码,感叹大牛总能够把复杂的东西通过很简单的语言和代码表达出来.为 ...
- AGC027 B - Garbage Collector 枚举/贪心
目录 题目链接 题解 代码 题目链接 AGC027 B - Garbage Collector 题解 对于一组选取组的最优方案为,走到一点,然后顺着路径往回取点 设选取点坐标升序为{a,b,c,d} ...
- New Garbage Collector http://wiki.luajit.org/New-Garbage-Collector
New Garbage Collector http://wiki.luajit.org/New-Garbage-Collector GC Algorithms This is a short ove ...
- agc 027 B - Garbage Collector
B - Garbage Collector https://agc027.contest.atcoder.jp/tasks/agc027_b 题意: x坐标轴上n个垃圾,有一个机器人在从原点,要清扫垃 ...
- Getting Started with the G1 Garbage Collector(译)
原文链接:Getting Started with the G1 Garbage Collector 概述 目的 这篇教程包含了G1垃圾收集器使用和它如何与HotSpot JVM配合使用的基本知识.你 ...
- Erlang Garbage Collector
Erlang Garbage Collector | Erlang Solution blog https://www.erlang-solutions.com/blog/erlang-garbage ...
- 提交并发量的方法:Java GC tuning :Garbage collector
三色算法,高效率垃圾回收,jvm调优 Garbage collector:垃圾回收器 What garbage? 没有任何引用指向它的对象 JVM GC回收算法: 引用计数法(ReferenceCou ...
- The Go Blog Getting to Go: The Journey of Go's Garbage Collector
Getting to Go: The Journey of Go's Garbage Collector https://blog.golang.org/ismmkeynote
随机推荐
- Social regularizations
trust-aware :如何从隐式信任中导出显示信任.链接预测就是搞这一方面的么? 和类似谱聚类的拉普拉斯矩阵结合在一起,没怎么看.
- Linq To Sql的各种查询
一.Inner Join //request为查询条件 var result = from a in db.TableA join b in db.TableB on a.ID equal ...
- ztree jquery 树 控件
插件地址:http://www.ztree.me 数据:[{"id":1,"pId":-1,"name":"根目录"}, ...
- 最佳eclipse字体推荐(个人觉得)
首先大家能够看看这里面推荐的最佳十款字体.http://www.iteye.com/news/11102-10-great-programming-font 可是经过測试发现,排名第一的字体在ecli ...
- iOS:XMPP即时聊天知识
XMPP即时聊天框架:XMPPFramework XMPP The Extensible Messaging and Presence Protocol(可扩展通讯和表示协议). 基于XML XM ...
- fl2440hello world模块驱动编写
许多语言,例如C,C++,JAVA等等都是从hello world开始的,因此我们的驱动程序的开发也要从hello world入手. 首先来看下我们的代码: /******************** ...
- Netty源码分析之NioEventLoop(转)
原文:http://www.jianshu.com/p/9acf36f7e025 上一章节中,我们分析了Netty服务的启动过程,本章节分析Netty的NioEventLoop是如工作的. NioEv ...
- Managed Media Aggregation using Rtsp and Rtp
his article was written almost 2 years ago, it's content may not reflect the latest state of the cod ...
- ural 1057 Amount of degrees 【数位dp】
题意:求(x--y)区间转化为 c 进制 1 的个数为 k 的数的出现次数. 分析:发现其满足区间减法,所以能够求直接求0---x 的转化为 c 进制中 1 的个数为k的数的出现次数. 首先用一个数组 ...
- grid 布局 等比例
<!DOCTYPE html> <html lang="zh"> <head> <meta charset="UTF-8&quo ...