Home  >  C++ Resources  > Resource Management   >  Resource Transfer

Strong Pointers and Resource Management in C++

Resource Transfer

So far we've been talking about resources whose lifetimes could be limited to a single scope. Now it's time to tackle the hard problem--how to safely transfer resources between scopes. The problem is most clearly visible when you're dealing with containers. You can dynamically create a bunch of objects, store them in a container, later retrieve them, use them, and eventually dispose of them. For this to work safely--with no leaks--objects have to change owners.

The obvious solution is to use smart pointers, both before adding objects to the container and after retrieving them. This is how it goes. You add the Release method to the smart pointer.

template <class T>
T * SPtr<T>::Release () 
    T * pTmp = _p; 
    _p = 0; 
    return pTmp;

Notice that after Release is called, the smart pointer is no longer the owner of the object--its internal pointer is null.

Now, whoever calls Release must be a very responsible person and immediately stash the returned pointer into some other owner object. In our case, it's the container who calls Release, as in this Stack example

void Stack::Push (SPtr <Item> & item) throw (char *)
    if (_top == maxStack)
        throw "Stack overflow";
    _arr [_top++] = item.Release ();

Again, you can enforce the responsible use of Release--you can grep for it in your sources.

What should the corresponding Pop method do? Should it release the resource and pray that whoever calls it be a responsible person and immediately make a direct resource transfer into a smart pointer? That just doesn't sound right.

Strong Pointers

Resource Management worked in the Index Server™, and I was pretty satisfied with it. Then I started thinking...; This methodology forms such a complete system, wouldn't it be really nice to have support for it built directly into the language? I came up with the idea of strong and weak pointers. A strong pointer would be a lot like our SPtr--it would destroy the object it pointed to when going out of scope. Resource transfer would occur as a result of simple assignment of strong pointers. There would also be weak pointers, used for accessing objects without owning them--sort of like assignable references.

Any pointer could be declared either strong or weak and the language would take care of type conversion rules. For instance, you could not pass a weak pointer where a strong pointer was expected, but the opposite would be legal. The Push method would accept a strong pointer and transfer its resource to the Stack's array of strong pointers. The Pop method would return a strong pointer, so the client would have to assign it to another strong pointer. The introduction of strong pointers into the language would make garbage collection history.

There is only one small problem--modifying the C++ standard is as easy as running for President of the United States. When I mentioned my idea to Bjarne Stroustrup, he looked at me as if I just asked him to lend me a thousand dollars.

Then a sudden idea struck me. I can implement strong pointers myself. They are, after all, just like smart pointers. It's not a big problem to provide them with a copy constructor and an overloaded assignment operator. In fact, this is what the standard library auto_ptr's have. It's important to give the resource-transfer semantics to these operations, but that's also easy.

template <class T>
SPtr<T>::SPtr (SPtr<T> & ptr) 
    _p = ptr.Release ();

template <class T>
void SPtr<T>::operator = (SPtr<T> & ptr) 
    if (_p != ptr._p)
        delete _p; 
        _p = ptr.Release ();

What made the whole idea suddenly click was the realization that I could pass such encapsulated pointers by value! I had my cake and could eat it too. Look at the new implementation of Stack.

class Stack
    enum { maxStack = 3 };
    Stack ()
    : _top (0)
    void Push (SPtr<Item> & item) throw (char *)
        if (_top >= maxStack)
            throw "Stack overflow';
        _arr [_top++] = item;
    SPtr<Item> Pop ()
        if (_top == 0)
            return SPtr<Item> ();
        return _arr [--_top];
    int _top;
    SPtr<Item> _arr [maxStack];

The Pop method forces the client to assign its result to a strong pointer, SPtr<Item>. An attempt to assign it to a regular pointer will result in a compiler error, because the types don't match.

Moreover, since Pop returns a strong pointer by value (there is no ampersand after SPtr<Item> in the declaration of Pop), the compiler performs a resource transfer for us in the return statement. It calls operator= to acquire an Item from the array, and the copy constructor to pass it to the caller. The caller ends up owning the Item through the strong pointer to which he or she has assigned the result of Pop.

I immediately new I was into something. I started rewriting my code using the new approach.


I had an old parser of arithmetic operations that was written using old Resource Management techniques. A parser is a producer of nodes that form a parsing tree. These nodes are dynamically allocated. For instance, the Expression method of the parser produces an expression node.

It took me no time to rewrite the parser using strong pointers. I made the methods Expression, Term and Factor return strong pointers to Nodes, and return them by value. Look at the implementation of the Expression method.

SPtr<Node> Parser::Expression()
    // Parse a term
    SPtr<Node> pNode = Term ();
    EToken token = _scanner.Token();
    if ( token == tPlus || token == tMinus )
        // Expr := Term { ('+' | '-') Term }
        SPtr<MultiNode> pMultiNode = new SumNode (pNode);
            SPtr<Node> pRight = Term ();
            pMultiNode->AddChild (pRight, (token == tPlus));
            token = _scanner.Token();
        } while (token == tPlus || token == tMinus);
        pNode = up_cast<Node, MultiNode> (pMultiNode);
    // otherwise Expr := Term
    return pNode; // by value!

First, the method Term is called. It returns a strong pointer to Node by value and we immediately store it in our own strong pointer, pNode. If the next token is not the plus or the minus sign, we simply return this SPtr by value, thus releasing the ownership of the Node to the caller.

If, on the other hand, the token is either plus or minus, we create a new SumNode and immediately (direct transfer) store it in a strong pointer to MultiNode. Here SumNode derives from MultiNode, which derives from Node. The ownership of the original Node is passed to the SumNode.

We keep creating terms as long as they are separated by plus or minus signs. We transfer these terms to our MultiNode, which takes over their ownership. Finally, we up-cast the strong-pointer-to-MultiNode to the strong-pointer-to-Node and return it to the caller.

We need to do the explicit up-casting of strong pointers even though the pointers they encapsulate can be implicitly converted. For instance, a MultiNode is-a Node, but the same is-a relationship does not hold between SPtr<MultiNode> and SPtr<Node>, because they are separate classes (instantiations of the template) that don't inherit from each other. The up_cast template is defined as follows.

template<class To, class From>
inline SPtr<To> up_cast (SPtr<From> & from)
    return SPtr<To> (from.Release ());

If your compiler supports member templates, the newest addition to C++ standard, you can instead define a template constructor for SPtr<T> that takes a strong pointer to another class U.

template <class T>
template <class U>     SPtr<T>::SPtr (SPrt<U> & uptr)
    : _p (uptr.Release ()) 

The trick here is that this template will not compile if U is not a subclass of T (in other words, it will only compile if U is-a T). That's because uptr.Release () returns a pointer to U, which is then assigned to _p which is a pointer to T. So if U is not a T, this assignment will result in a compile-time error.


Then I realized that the template auto_ptr, that was added to the Standard Library, was nothing else but my strong pointer. At that time there were still some implementation differences (the release method of auto_ptr didn't zero the internal pointer--your compiler's library might in fact still contain this obsolete implementation), but they were resolved at the last moment, before the Standard was officially accepted.

Transfer Semantics

So far I've been describing a methodology for managing resources in a C++ program. The idea was to keep all resources encapsulated in lightweight objects that would be responsible for their release. In particular, all resources allocated using operator new could be stored and passed inside strong pointers (the Standard Library auto_ptr).

The key word here is passing. A container may safely release a resource by returning a strong pointer by value. The client of the container may only receive such resource by providing an appropriate strong pointer to store it. Any attempt to assign the result to a naked pointer will be immediately detected by the compiler.

auto_ptr<Item> item = stack.Pop ();  // ok
Item * p = stack.Pop (); // Error! Type mismatch.

Objects that are passed by value are said to have value semantics or copy semantics. Strong pointers are passed by value--but can we say they have copy semantics? Not really! The objects they point to are definitely not being copied. In fact, after the transfer, the source auto_ptr no longer has access to the original object and the target auto_ptr becomes its sole owner. (The old implementation of auto_ptr used to retain access to the object even after releasing its ownership.) It makes perfect sense to call this new behavior "transfer semantics."

The copy constructor and the assignment operator that define the auto_ptr's transfer semantics take a non-const references to auto_ptr as their arguments.

auto_ptr (auto_ptr<T> & ptr);
auto_ptr & operator = (auto_ptr<T> & ptr);

This is because they do modify their sources--they take away the ownership of the resources.

By defining an appropriate copy constructor and overloading the assignment operator, you can add transfer semantics to a variety of objects. For instance, a lot of resources in Windows, such as dynamically created menus or bitmaps, can be encapsulated in classes with transfer semantics.

NextNext: Strong Vectors