24小时热门版块排行榜    

查看: 200  |  回复: 1
当前主题已经存档。

zsglly

木虫 (著名写手)

[交流] C++ Without Memory Errors(英)

by Dejan Jelović

Here are the slides and the code from a recent talk I've given on writing C++ programs without memory errors.

An article with more details will be ready soon.


--------------------------------------------------------------------------------

Memory errors are the worst kind of errors in C and C++. They are hard to reproduce and thus hard to debug. Have you ever used a non-trivial C or C++ program that never crashed?


--------------------------------------------------------------------------------

I've been programming in Java for the last year. In Java one sees almost no hard to reproduce problems. Why is that?


--------------------------------------------------------------------------------

Is it because Java is a safer language? No. Java makes you use too many casts and lacks support for types with value semantics. It doesn't have destructors so resource management is really hard. It is less safe than C++.


--------------------------------------------------------------------------------

The real reason is garbage collection.


--------------------------------------------------------------------------------

How does garbage collection help? Does it free us from freeing memory? Not really. Try implementing a Vector in Java and you will see how easy it is to forget to set a reference to null, thus leaking memory.


--------------------------------------------------------------------------------

The benefit of garbage collection is this: it guarantees that a pointer will either point to a valid allocated object or be null.


--------------------------------------------------------------------------------

Think about it: if a pointer is either valid or null, there can be no weird memory errors.


--------------------------------------------------------------------------------

How do we do that in C++?


--------------------------------------------------------------------------------

How about adding garbage collection to C++? A company named Geodesic claims their garbage collector for C++ works great.


--------------------------------------------------------------------------------

Garbage collection helps, but it is not enough. We still have to call the destructors manually, and to remember to set pointers to NULL. That's too much room for error.

There is also a performance penalty. Programs with garbage collection use 50% more memory than programs with manual memory management. That translates into much slower execution because it increases the chances of memory being swapping out to disk.


--------------------------------------------------------------------------------

Here's the solution: Use a smart pointer.


--------------------------------------------------------------------------------

What would be the characteristics of such a smart pointer?

It always points either to a valid allocated object or is NULL.  
It deletes the object once there are no more references to it.  
It can be used with existing code.  
Programs that don’t do low-level stuff can be written exclusively using this pointer. Native pointers don’t have to be used at all.  
Native pointers can be converted into smart pointers via a special construct. It should be easy to search for this construct using grep since it is unsafe.  
Thread-safe.  
Exception safe.  
Fast. It should have zero dereferencing overhead and minimal manipulation overhead.  
It shouldn’t have problems with circular references.  

--------------------------------------------------------------------------------

If we disregard the requirement #9, then it's easy. Simply have a smart pointer that is made out of two native pointers. One points to the real object, the other to the reference count:






--------------------------------------------------------------------------------

We also provide a template function called create that creates a new object using the operator new and then returns a smart pointer. That guarantees that the smart pointer is valid.  
We also provide a back door to ease the transition. There is a wrapPtr function that takes a native pointer and makes a smart pointer. This is unsafe. So we didn't use a constructor, but a special function that is easy to search for if you have any problems.


--------------------------------------------------------------------------------

This leaves us with the problem of circular references.


--------------------------------------------------------------------------------

Circular references and reference counting don't go well together. Maybe we can find a simpler problem?


--------------------------------------------------------------------------------

In real-world programs you almost never have real cyclic data structures. Usually you have hierarchies, like the window hierarchy or a directory tree:




--------------------------------------------------------------------------------

The problem with a reference counting and hierarchies is that a parent points to a child, and a child points to the parent. Hence they both have a reference count of one, and are never deleted.


--------------------------------------------------------------------------------

People that use reference-counted pointers usually find a way out of this mess by using a native pointer from the child to the parent.

But this is not a good solution, because we are trying not to use native pointers. We want pointers that are either pointing to a valid object or are null.


--------------------------------------------------------------------------------

Here's a solution: we need weak smart pointers!

They will be just like regular reference counter pointers, only their references won't count. If you have a "strong" pointer and a weak pointer pointing to the same object, and the strong pointer is destroyed, the weak pointer immediately becomes null.


--------------------------------------------------------------------------------

How do we implement this? We keep two reference counts: One for total number of pointers, and one for strong pointers.

When dereferencing a weak pointer, we check the strong reference count. If it is zero, we return NULL.


--------------------------------------------------------------------------------

Try it out! The code is right here: SafePtr.zip.

The code is done using the Intel C++ compiler for the Windows platform.

You need a compiler that can handle templates correctly. Visual C++ (version 6, service pack 4) chokes on them and either silently makes a compilation error or gives an internal compiler error.

If you are not using Windows you will need to modify the SmartPtr.h file. It uses the Windows API function InterlockedIncrement and InterlockedDecrement to modify the reference count. These functions are nothing more than a thread-safe way to increment and decrement a long. Each OS or compiler should have the equivalents, you just have to find them.


--------------------------------------------------------------------------------

There are three files in the archive:

safeptr.h - this is the one that you need to include in order to use the smart pointers; everything is in the namespace named 'safe'.

test.cpp - this is a program that puts the smart pointer through the hoops

demo.cpp - look at this one if you want to learn how to use the library



Read more...


--------------------------------------------------------------------------------

Content of this site is © Dejan Jelovic. All rights reserved.

[ Last edited by 幻影无痕 on 2006-11-29 at 08:00 ]
回复此楼
做人要厚道啊!厚道啊!
已阅   回复此楼   关注TA 给TA发消息 送TA红花 TA的回帖

1

2楼2005-12-22 18:23:51
已阅   回复此楼   关注TA 给TA发消息 送TA红花 TA的回帖
相关版块跳转 我要订阅楼主 zsglly 的主题更新
普通表情 高级回复 (可上传附件)
最具人气热帖推荐 [查看全部] 作者 回/看 最后发表
[考研] 292求调剂 +7 yhk_819 2026-02-28 7/350 2026-03-02 12:43 by 无际的草原
[考研] 哈工大计算机刘劼团队招生 +4 hit_aiot 2026-03-01 6/300 2026-03-02 11:53 by 一声问好
[考研] 化工270求调剂 +7 什么名字qwq 2026-03-02 7/350 2026-03-02 11:26 by yuchj
[考研] 材料学硕318求调剂 +14 February_Feb 2026-03-01 16/800 2026-03-02 11:17 by yuchj
[考研] 274求调剂 +3 cgyzqwn 2026-03-01 7/350 2026-03-02 10:38 by lature00
[考研] 欢迎采矿、地质、岩土、计算机、人工智能等专业的同学报考 +5 pin8023 2026-02-28 7/350 2026-03-02 10:33 by ZY,先生
[考研] 0854复试调剂 276 +4 wmm9 2026-03-01 6/300 2026-03-02 09:28 by 热情沙漠
[考研] 282求调剂 +3 2103240126 2026-03-02 4/200 2026-03-02 09:25 by 汪!?!
[考研] 高分子化学与物理调剂 +6 好好好1233 2026-02-28 13/650 2026-03-02 07:27 by 好好好1233
[考研] 江苏省农科院招调剂1名 +3 Qwertyuop 2026-03-01 3/150 2026-03-01 23:18 by aaadim
[基金申请] 成果系统访问量大,请一小时后再尝试。---NSFC啥时候好哦,已经两天这样了 +4 NSFC2026我来了 2026-02-28 4/200 2026-03-01 22:37 by 铁门栓
[考研] 0805总分292,求调剂 +7 幻想之殇 2026-03-01 7/350 2026-03-01 21:22 by 公瑾逍遥
[考研] 306分材料调剂 +4 chuanzhu川烛 2026-03-01 5/250 2026-03-01 19:48 by 无际的草原
[考研] 0856材料求调剂 +4 麻辣鱿鱼 2026-02-28 4/200 2026-03-01 16:51 by caszguilin
[考研] 311求调剂 +6 亭亭亭01 2026-03-01 6/300 2026-03-01 15:41 by 324616
[考研] 求调剂 +6 repeatt?t 2026-02-28 6/300 2026-03-01 14:37 by Sakura绘
[考研] 课题组接收材料类调剂研究生 +3 gaoxiaoniuma 2026-02-28 4/200 2026-03-01 14:30 by jjj三跨
[考研] 302材料工程求调剂 +4 Doleres 2026-03-01 5/250 2026-03-01 11:52 by liqiongjy
[论文投稿] Optics letters投稿被拒求助 30+3 luckyry 2026-02-26 4/200 2026-03-01 09:06 by babero
[高分子] 求环氧树脂研发1名 +3 孙xc 2026-02-25 11/550 2026-02-28 16:57 by ichall
信息提示
请填处理意见