1. Building Stable Systems▲
1-0. Introduction▲
Software engineers spend about as much time validating code as they do creating it. Quality is or should be the goal of every programmer, and one can go a long way towards that goal by eliminating problems before they happen. In addition, software systems should be robust enough to behave reasonably in the presence of unforeseen environmental problems.
Exceptions were introduced into C++ to support sophisticated error handling without cluttering code with an inordinate amount of error-handling logic. Chapter 1 shows how proper use of exceptions can make for well-behaved software, and also introduces the design principles that underlie exception-safe code. In Chapter 2 we cover unit testing and debugging techniques intended to maximize code quality long before it's released. The use of assertions to express and enforce program invariants is a sure sign of an experienced software engineer. We also introduce a simple framework to support unit testing.
1-1. Exception Handling▲
Improving error recovery is one of the most powerful ways you can increase the robustness of your code.
Unfortunately, it's almost accepted practice to ignore error conditions, as if we're in a state of denial about errors. One reason, no doubt, is the tediousness and code bloat of checking for many errors. For example, printf( ) returns the number of characters that were successfully printed, but virtually no one checks this value. The proliferation of code alone would be disgusting, not to mention the difficulty it would add in reading the code.
The problem with C's approach to error handling could be thought of as coupling—the user of a function must tie the error-handling code so closely to that function that it becomes too ungainly and awkward to use.
One of the major features in C++ is exception handling, which is a better way of thinking about and handling errors. With exception handling:
- Error-handling code is not nearly so tedious to write, and it doesn't become mixed up with your “normal” code. You write the code you want to happen; later in a separate section you write the code to cope with the problems. If you make multiple calls to a function, you handle the errors from that function once, in one place.
- Errors cannot be ignored. If a function needs to send an error message to the caller of that function, it “throws” an object representing that error out of the function. If the caller doesn't “catch” the error and handle it, it goes to the next enclosing dynamic scope, and so on until the error is either caught or the program terminates because there was no handler to catch that type of exception.
This chapter examines C's approach to error handling (such as it is), discusses why it did not work well for C, and explains why it won't work at all for C++. This chapter also covers try, throw,and catch, the C++ keywords that support exception handling.
1-1-1. Traditional error handling▲
In most of the examples in these volumes, we use assert( ) as it was intended: for debugging during development with code that can be disabled with #define NDEBUG for the shipping product. Runtime error checking uses the require.h functions (assure( ) and require( )) developed in Chapter 9 in Volume 1 and repeated here in Appendix B. These functions are a convenient way to say, “There's a problem here you'll probably want to handle with some more sophisticated code, but you don't need to be distracted by it in this example.” The require.h functions might be enough for small programs, but for complicated products you'll want to write more sophisticated error-handling code.
Error handling is quite straightforward when you know exactly what to do, because you have all the necessary information in that context. You can just handle the error at that point.
The problem occurs when you don't have enough information in that context, and you need to pass the error information into a different context where that information does exist. In C, you can handle this situation using three approaches:
- Return error information from the function or, if the return value cannot be used this way, set a global error condition flag. (Standard C provides errno and perror( ) to support this.) As mentioned earlier, the programmer is likely to ignore the error information because tedious and obfuscating error checking must occur with each function call. In addition, returning from a function that hits an exceptional condition might not make sense.
- Use the little-known Standard C library signal-handling system, implemented with the signal( ) function (to determine what happens when the event occurs) and raise( ) (to generate an event). Again, this approach involves high coupling because it requires the user of any library that generates signals to understand and install the appropriate signal-handling mechanism. In large projects the signal numbers from different libraries might clash.
- Use the nonlocal goto functions in the Standard C library: setjmp( ) and longjmp( ). With setjmp( ) you save a known good state in the program, and if you get into trouble, longjmp( ) will restore that state. Again, there is high coupling between the place where the state is stored and the place where the error occurs.
When considering error-handling schemes with C++, there's an additional critical problem: The C techniques of signals and setjmp( )/longjmp( ) do not call destructors, so objects aren't properly cleaned up. (In fact, if longjmp( ) jumps past the end of a scope where destructors should be called, the behavior of the program is undefined.) This makes it virtually impossible to effectively recover from an exceptional condition because you'll always leave objects behind that haven't been cleaned up and that can no longer be accessed. The following example demonstrates this with setjmp/longjmp:
//: C01:Nonlocal.cpp
// setjmp() & longjmp().
#include
<iostream>
#include
<csetjmp>
using
namespace
std;
class
Rainbow {
public
:
Rainbow() {
cout <<
"Rainbow()"
<<
endl; }
~
Rainbow() {
cout <<
"~Rainbow()"
<<
endl; }
}
;
jmp_buf kansas;
void
oz() {
Rainbow rb;
for
(int
i =
0
; i <
3
; i++
)
cout <<
"there's no place like
home"
<<
endl;
longjmp(kansas, 47
);
}
int
main() {
if
(setjmp(kansas) ==
0
) {
cout <<
"tornado, witch,
munchkins..."
<<
endl;
oz();
}
else
{
cout <<
"Auntie Em! "
<<
"I had the strangest
dream..."
<<
endl;
}
}
///
:~
The setjmp( ) function is odd because if you call it directly, it stores all the relevant information about the current processor state (such as the contents of the instruction pointer and runtime stack pointer) in the jmp_buf and returns zero. In this case it behaves like an ordinary function. However, if you call longjmp( ) using the same jmp_buf, it's as if you're returning from setjmp( ) again—you pop right out the back end of the setjmp( ). This time, the value returned is the second argument to longjmp( ), so you can detect that you're actually coming back from a longjmp( ). You can imagine that with many different jmp_bufs, you could pop around to many different places in the program. The difference between a local goto (with a label) and this nonlocal goto is that you can return to any pre-determined location higher up in the runtime stack with setjmp( )/longjmp( ) (wherever you've placed a call to setjmp( )).
The problem in C++ is that longjmp( ) doesn't respect objects; in particular it doesn't call destructors when it jumps out of a scope.(1) Destructor calls are essential, so this approach won't work with C++. In fact, the C++ Standard states that branching into a scope with goto (effectively bypassing constructor calls), or branching out of a scope with longjmp( ) where an object on the stack has a destructor, constitutes undefined behavior.
1-1-2. Throwing an exception▲
If you encounter an exceptional situation in your code—that is, if you don't have enough information in the current context to decide what to do—you can send information about the error into a larger context by creating an object that contains that information and “throwing” it out of your current context. This is called throwing an exception. Here's what it looks like:
//: C01:MyError.cpp {RunByHand}
class
MyError {
const
char
*
const
data;
public
:
MyError(const
char
*
const
msg =
0
) : data(msg) {}
}
;
void
f() {
// Here we throw an exception object:
throw
MyError("something bad happened"
);
}
int
main() {
// As you'll see shortly, we'll want a try block here:
f();
}
///
:~
MyError is an ordinary class, which in this case takes a char* as a constructor argument. You can use any type when you throw (including built-in types), but usually you'll create special classes for throwing exceptions.
The keyword throw causes a number of relatively magical things to happen. First, it creates a copy of the object you're throwing and, in effect, “returns” it from the function containing the throw expression, even though that object type isn't normally what the function is designed to return. A naive way to think about exception handling is as an alternate return mechanism (although you'll find you can get into trouble if you take that analogy too far). You can also exit from ordinary scopes by throwing an exception. In any case, a value is returned, and the function or scope exits.
Any similarity to a return statement ends there because where you return is some place completely different from where a normal function call returns. (You end up in an appropriate part of the code—called an exception handler—that might be far removed from where the exception was thrown.) In addition, any local objects created by the time the exception occurs are destroyed. This automatic cleanup of local objects is often called “stack unwinding.”
In addition, you can throw as many different types of objects as you want. Typically, you'll throw a different type for each category of error. The idea is to store the information in the object and in the name of its class so that someone in a calling context can figure out what to do with your exception.
1-1-3. Catching an exception▲
As mentioned earlier, one of the advantages of C++ exception handling is that you can concentrate on the problem you're trying to solve in one place, and then deal with the errors from that code in another place.
1-1-3-1. The try block▲
If you're inside a function and you throw an exception (or a called function throws an exception), the function exits because of the thrown exception. If you don't want a throw to leave a function, you can set up a special block within the function where you try to solve your actual programming problem (and potentially generate exceptions). This block is called the try block because you try your various function calls there. The try block is an ordinary scope, preceded by the keyword try:
try
{
// Code that may generate exceptions
}
If you check for errors by carefully examining the return codes from the functions you use, you need to surround every function call with setup and test code, even if you call the same function several times. With exception handling, you put everything in a try block and handle exceptions after the try block. Thus, your code is a lot easier to write and to read because the goal of the code is not confused with the error handling.
1-1-3-2. Exception handlers▲
Of course, the thrown exception must end up some place. This place is the exception handler, and you need one exception handler for every exception type you want to catch. However, polymorphism also works for exceptions, so one exception handler can work with an exception type and classes derived from that type.
Exception handlers immediately follow the try block and are denoted by the keyword catch:
try
{
// Code that may generate exceptions
}
catch
(type1 id1) {
// Handle exceptions of type1
}
catch
(type2 id2) {
// Handle exceptions of type2
}
catch
(type3 id3)
// Etc...
}
catch
(typeN idN)
// Handle exceptions of typeN
}
// Normal execution resumes here...
The syntax of a catch clause resembles functions that take a single argument. The identifier (id1, id2, and so on) can be used inside the handler, just like a function argument, although you can omit the identifier if it's not needed in the handler. The exception type usually gives you enough information to deal with it.
The handlers must appear directly after the try block. If an exception is thrown, the exception-handling mechanism goes hunting for the first handler with an argument that matches the type of the exception. It then enters that catch clause, and the exception is considered handled. (The search for handlers stops once the catch clause is found.) Only the matching catch clause executes; control then resumes after the last handler associated with that try block.
Notice that, within the try block, a number of different function calls might generate the same type of exception, but you need only one handler.
To illustrate try and catch, the following variation of Nonlocal.cpp replaces the call to setjmp( ) with a try block and replaces the call to longjmp( ) with a throw statement:
//: C01:Nonlocal2.cpp
// Illustrates exceptions.
#include
<iostream>
using
namespace
std;
class
Rainbow {
public
:
Rainbow() {
cout <<
"Rainbow()"
<<
endl; }
~
Rainbow() {
cout <<
"~Rainbow()"
<<
endl; }
}
;
void
oz() {
Rainbow rb;
for
(int
i =
0
; i <
3
; i++
)
cout <<
"there's no place like
home"
<<
endl;
throw
47
;
}
int
main() {
try
{
cout <<
"tornado, witch, munchkins..."
<<
endl;
oz();
}
catch
(int
) {
cout <<
"Auntie Em! I had the strangest
dream..."
<<
endl;
}
}
///
:~
When the throw statement in oz( ) executes, program control backtracks until it finds the catch clause that takes an int parameter. Execution resumes with the body of that catch clause. The most important difference between this program and Nonlocal.cpp is that the destructor for the object rb is called when the throw statement causes execution to leave the function oz( ).
1-1-3-3. Termination and resumption▲
There are two basic models in exception-handling theory: termination and resumption. In termination (which is what C++ supports), you assume the error is so critical that there's no way to automatically resume execution at the point where the exception occurred. In other words, whoever threw the exception decided there was no way to salvage the situation, and they don't want to come back.
The alternative error-handling model is called resumption, first introduced with the PL/I language in the 1960s.(2) Using resumption semantics means that the exception handler is expected to do something to rectify the situation, and then the faulting code is automatically retried, presuming success the second time. If you want resumption in C++, you must explicitly transfer execution back to the code where the error occurred, usually by repeating the function call that sent you there in the first place. It is not unusual to place your try block inside a while loop that keeps reentering the try block until the result is satisfactory.
Historically, programmers using operating systems that supported resumptive exception handling eventually ended up using termination-like code and skipping resumption. Although resumption sounds attractive at first, it seems it isn't quite so useful in practice. One reason may be the distance that can occur between the exception and its handler. It is one thing to terminate to a handler that's far away, but to jump to that handler and then back again may be too conceptually difficult for large systems where the exception is generated from many points.
1-1-4. Exception matching▲
When an exception is thrown, the exception-handling system looks through the “nearest” handlers in the order they appear in the source code. When it finds a match, the exception is considered handled and no further searching occurs.
Matching an exception doesn't require a perfect correlation between the exception and its handler. An object or reference to a derived-class object will match a handler for the base class. (However, if the handler is for an object rather than a reference, the exception object is “sliced”—truncated to the base type—as it is passed to the handler. This does no damage, but loses all the derived-type information.) For this reason, as well as to avoid making yet another copy of the exception object, it is always better to catch an exception by reference instead of by value.(3) If a pointer is thrown, the usual standard pointer conversions are used to match the exception. However, no automatic type conversions are used to convert from one exception type to another in the process of matching. For example:
//: C01:Autoexcp.cpp
// No matching conversions.
#include
<iostream>
using
namespace
std;
class
Except1 {}
;
class
Except2 {
public
:
Except2(const
Except1&
) {}
}
;
void
f() {
throw
Except1(); }
int
main() {
try
{
f();
}
catch
(Except2&
) {
cout <<
"inside catch(Except2)"
<<
endl;
}
catch
(Except1&
) {
cout <<
"inside catch(Except1)"
<<
endl;
}
}
///
:~
Even though you might think the first handler could be matched by converting an Except1 object into an Except2 using the converting constructor, the system will not perform such a conversion during exception handling, and you'll end up at the Except1 handler.
The following example shows how a base-class handler can catch a derived-class exception:
//: C01:Basexcpt.cpp
// Exception hierarchies.
#include
<iostream>
using
namespace
std;
class
X {
public
:
class
Trouble {}
;
class
Small : public
Trouble {}
;
class
Big : public
Trouble {}
;
void
f() {
throw
Big(); }
}
;
int
main() {
X x;
try
{
x.f();
}
catch
(X::
Trouble&
) {
cout <<
"caught Trouble"
<<
endl;
// Hidden by previous handler:
}
catch
(X::
Small&
) {
cout <<
"caught Small Trouble"
<<
endl;
}
catch
(X::
Big&
) {
cout <<
"caught Big Trouble"
<<
endl;
}
}
///
:~
Here, the exception-handling mechanism will always match a Trouble object, or anything that is a Trouble (through public inheritance),(4) to the first handler. That means the second and third handlers are never called because the first one captures them all. It makes more sense to catch the derived types first and put the base type at the end to catch anything less specific.
Notice that these examples catch exceptions by reference, although for these classes it isn't important because there are no additional members in the derived classes, and there are no argument identifiers in the handlers anyway. You'll usually want to use reference arguments rather than value arguments in your handlers to avoid slicing off information.
1-1-4-1. Catching any exception▲
Sometimes you want to create a handler that catches any type of exception. You do this using the ellipsis in the argument list:
catch
(...) {
cout <<
"an exception was thrown"
<<
endl;
}
Because an ellipsis catches any exception, you'll want to put it at the end of your list of handlers to avoid pre-empting any that follow it.
The ellipsis gives you no possibility to have an argument, so you can't know anything about the exception or its type. It's a “catchall.” Such a catch clause is often used to clean up some resources and then rethrow the exception.
1-1-4-2. Rethrowing an exception▲
You usually want to rethrow an exception when you have some resource that needs to be released, such as a network connection or heap memory that needs to be deallocated. (See the section “Resource Management” later in this chapter for more detail). If an exception occurs, you don't necessarily care what error caused the exception—you just want to close the connection you opened previously. After that, you'll want to let some other context closer to the user (that is, higher up in the call chain) handle the exception. In this case the ellipsis specification is just what you want. You want to catch any exception, clean up your resource, and then rethrow the exception for handling elsewhere. You rethrow an exception by using throw with no argument inside a handler:
catch
(...) {
cout <<
"an exception was
thrown"
<<
endl;
// Deallocate your resource here,
and
then rethrow
throw
;
}
Any further catch clauses for the same try block are still ignored—the throw causes the exception to go to the exception handlers in the next-higher context. In addition, everything about the exception object is preserved, so the handler at the higher context that catches the specific exception type can extract any information the object may contain.
1-1-4-3. Uncaught exceptions▲
As we explained in the beginning of this chapter, exception handling is considered better than the traditional return-an-error-code technique because exceptions can't be ignored, and because the error handling logic is separated from the problem at hand. If none of the exception handlers following a particular try block matches an exception, that exception moves to the next-higher context, that is, the function or try block surrounding the try block that did not catch the exception. (The location of this try block is not always obvious at first glance, since it's higher up in the call chain.) This process continues until, at some level, a handler matches the exception. At that point, the exception is considered “caught,” and no further searching occurs.
The terminate( ) function
If no handler at any level catches the exception, the special library function terminate( ) (declared in the <exception> header) is automatically called. By default, terminate( ) calls the Standard C library function abort( ) , which abruptly exits the program. On Unix systems, abort( ) also causes a core dump. When abort( ) is called, no calls to normal program termination functions occur, which means that destructors for global and static objects do not execute. The terminate( ) function also executes if a destructor for a local object throws an exception while the stack is unwinding (interrupting the exception that was in progress) or if a global or static object's constructor or destructor throws an exception. (In general, do not allow a destructor to throw an exception.)
The set_terminate( ) function
You can install your own terminate( ) function using the standard set_terminate( ) function, which returns a pointer to the terminate( ) function you are replacing (which will be the default library version the first time you call it), so you can restore it later if you want. Your custom terminate( ) must take no arguments and have a void return value. In addition, any terminate( ) handler you install must not return or throw an exception, but instead must execute some sort of program-termination logic. If terminate( ) is called, the problem is unrecoverable.
The following example shows the use of set_terminate( ). Here, the return value is saved and restored so that the terminate( ) function can be used to help isolate the section of code where the uncaught exception occurs:
//: C01:Terminator.cpp
// Use of set_terminate(). Also shows uncaught
exceptions.
#include
<exception>
#include
<iostream>
using
namespace
std;
void
terminator() {
cout <<
"I'll be back!"
<<
endl;
exit(0
);
}
void
(*
old_terminate)() =
set_terminate(terminator);
class
Botch {
public
:
class
Fruit {}
;
void
f() {
cout <<
"Botch::f()"
<<
endl;
throw
Fruit();
}
~
Botch() {
throw
'c'
; }
}
;
int
main() {
try
{
Botch b;
b.f();
}
catch
(...) {
cout <<
"inside catch(...)"
<<
endl;
}
}
///
:~
The definition of old_terminate looks a bit confusing at first: it not only creates a pointer to a function, but it initializes that pointer to the return value of set_terminate( ). Even though you might be familiar with seeing a semicolon right after a pointer-to-function declaration, here it's just another kind of variable and can be initialized when it is defined.
The class Botch not only throws an exception inside f( ), but also in its destructor. This causes a call to terminate( ), as you can see in main( ). Even though the exception handler says catch(...), which would seem to catch everything and leave no cause for terminate( ) to be called, terminate( ) is called anyway. In the process of cleaning up the objects on the stack to handle one exception, the Botch destructor is called, and that generates a second exception, forcing a call to terminate( ). Thus, a destructor that throws an exception or causes one to be thrown is usually a sign of poor design or sloppy coding.
1-1-5. Cleaning up▲
Part of the magic of exception handling is that you can pop from normal program flow into the appropriate exception handler. Doing so wouldn't be useful, however, if things weren't cleaned up properly as the exception was thrown. C++ exception handling guarantees that as you leave a scope, all objects in that scope whose constructors have been completed will have their destructors called.
Here's an example that demonstrates that constructors that aren't completed don't have the associated destructors called. It also shows what happens when an exception is thrown in the middle of the creation of an array of objects:
//: C01:Cleanup.cpp
// Exceptions clean up complete objects only.
#include
<iostream>
using
namespace
std;
class
Trace {
static
int
counter;
int
objid;
public
:
Trace() {
objid =
counter++
;
cout <<
"constructing Trace #"
<<
objid <<
endl;
if
(objid ==
3
) throw
3
;
}
~
Trace() {
cout <<
"destructing Trace #"
<<
objid <<
endl;
}
}
;
int
Trace::
counter =
0
;
int
main() {
try
{
Trace n1;
// Throws exception:
Trace array[5
];
Trace n2; // Won't get here.
}
catch
(int
i) {
cout <<
"caught "
<<
i
<<
endl;
}
}
///
:~
The class Trace keeps track of objects so that you can trace program progress. It keeps a count of the number of objects created with a static data member counter and tracks the number of the particular object with objid.
The main program creates a single object, n1 (objid 0), and then attempts to create an array of five Trace objects, but an exception is thrown before the fourth object (#3) is fully created. The object n2 is never created. You can see the results in the output of the program:
constructing Trace #0
constructing Trace #1
constructing Trace #2
constructing Trace #3
destructing Trace #2
destructing Trace #1
destructing Trace #0
caught 3
Three array elements are successfully created, but in the middle of the constructor for the fourth element, an exception is thrown. Because the fourth construction in main( ) (for array[2]) never completes, only the destructors for objects array[1] and array[0] are called. Finally, object n1 is destroyed, but not object n2, because it was never created.
1-1-5-1. Resource management▲
When writing code with exceptions, it's particularly important that you always ask, “If an exception occurs, will my resources be properly cleaned up?” Most of the time you're fairly safe, but in constructors there's a particular problem: if an exception is thrown before a constructor is completed, the associated destructor will not be called for that object. Thus, you must be especially diligent while writing your constructor.
The difficulty is in allocating resources in constructors. If an exception occurs in the constructor, the destructor doesn't get a chance to deallocate the resource. This problem occurs most often with “naked” pointers. For example:
//: C01:Rawp.cpp
// Naked pointers.
#include
<iostream>
#include
<cstddef>
using
namespace
std;
class
Cat {
public
:
Cat() {
cout <<
"Cat()"
<<
endl; }
~
Cat() {
cout <<
"~Cat()"
<<
endl; }
}
;
class
Dog {
public
:
void
*
operator
new
(size_t sz) {
cout <<
"allocating a Dog"
<<
endl;
throw
47
;
}
void
operator
delete
(void
*
p) {
cout <<
"deallocating a Dog"
<<
endl;
::
operator
delete
(p);
}
}
;
class
UseResources {
Cat*
bp;
Dog*
op;
public
:
UseResources(int
count =
1
) {
cout <<
"UseResources()"
<<
endl;
bp =
new
Cat[count];
op =
new
Dog;
}
~
UseResources() {
cout <<
"~UseResources()"
<<
endl;
delete
[] bp; // Array delete
delete
op;
}
}
;
int
main() {
try
{
UseResources ur(3
);
}
catch
(int
) {
cout <<
"inside handler"
<<
endl;
}
}
///
:~
The output is
UseResources()
Cat()
Cat()
Cat()
allocating a Dog
inside handler
The UseResources constructor is entered, and the Cat constructor is successfully completed for the three array objects. However, inside Dog::operator new( ), an exception is thrown (to simulate an out-of-memory error). Suddenly, you end up inside the handler, without the UseResources destructor being called. This is correct because the UseResources constructor was unable to finish, but it also means the Cat objects that were successfully created on the heap were never destroyed.
1-1-5-2. Making everything an object▲
To prevent such resource leaks, you must guard against these “raw” resource allocations in one of two ways:
- You can catch exceptions inside the constructor and then release the resource.
- You can place the allocations inside an object's constructor, and you can place the deallocations inside an object's destructor.
Using the latter approach, each allocation becomes atomic, by virtue of being part of the lifetime of a local object, and if it fails, the other resource allocation objects are properly cleaned up during stack unwinding. This technique is called Resource Acquisition Is Initialization (RAII for short) because it equates resource control with object lifetime. Using templates is an excellent way to modify the previous example to achieve this:
//: C01:Wrapped.cpp
// Safe, atomic pointers.
#include
<iostream>
#include
<cstddef>
using
namespace
std;
// Simplified. Yours may have other arguments.
template
<
class
T, int
sz =
1
>
class
PWrap {
T*
ptr;
public
:
class
RangeError {}
; // Exception class
PWrap() {
ptr =
new
T[sz];
cout <<
"PWrap constructor"
<<
endl;
}
~
PWrap() {
delete
[] ptr;
cout <<
"PWrap destructor"
<<
endl;
}
T&
operator
[](int
i) throw
(RangeError) {
if
(i >=
0
&&
i <
sz) return
ptr[i];
throw
RangeError();
}
}
;
class
Cat {
public
:
Cat() {
cout <<
"Cat()"
<<
endl; }
~
Cat() {
cout <<
"~Cat()"
<<
endl; }
void
g() {}
}
;
class
Dog {
public
:
void
*
operator
new
[](size_t) {
cout <<
"Allocating a Dog"
<<
endl;
throw
47
;
}
void
operator
delete
[](void
*
p) {
cout <<
"Deallocating a Dog"
<<
endl;
::
operator
delete
[](p);
}
}
;
class
UseResources {
PWrap<
Cat, 3
>
cats;
PWrap<
Dog>
dog;
public
:
UseResources() {
cout <<
"UseResources()"
<<
endl; }
~
UseResources() {
cout <<
"~UseResources()"
<<
endl; }
void
f() {
cats[1
].g(); }
}
;
int
main() {
try
{
UseResources ur;
}
catch
(int
) {
cout <<
"inside handler"
<<
endl;
}
catch
(...) {
cout <<
"inside catch(...)"
<<
endl;
}
}
///
:~
The difference is the use of the template to wrap the pointers and make them into objects. The constructors for these objects are called before the body of the UseResources constructor, and any of these constructors that complete before an exception is thrown will have their associated destructors called during stack unwinding.
The PWrap template shows a more typical use of exceptions than you've seen so far: A nested class called RangeError is created to use in operator[ ] if its argument is out of range. Because operator[ ] returns a reference, it cannot return zero. (There are no null references.) This is a true exceptional condition—you don't know what to do in the current context and you can't return an improbable value. In this example, RangeError(5) is simple and assumes all the necessary information is in the class name, but you might also want to add a member that contains the value of the index, if that is useful.
Now the output is
Cat()
Cat()
Cat()
PWrap constructor
allocating a Dog
~
Cat()
~
Cat()
~
Cat()
PWrap destructor
inside handler
Again, the storage allocation for Dog throws an exception, but this time the array of Cat objects is properly cleaned up, so there is no memory leak.
1-1-5-3. auto_ptr▲
Since dynamic memory is the most frequent resource used in a typical C++ program, the standard provides an RAII wrapper for pointers to heap memory that automatically frees the memory. The auto_ptr class template, defined in the <memory> header, has a constructor that takes a pointer to its generic type (whatever you use in your code). The auto_ptr class template also overloads the pointer operators * and -> to forward these operations to the original pointer the auto_ptr object is holding. So you can use the auto_ptr object as if it were a raw pointer. Here's how it works:
//: C01:Auto_ptr.cpp
// Illustrates the RAII nature of auto_ptr.
#include
<memory>
#include
<iostream>
#include
<cstddef>
using
namespace
std;
class
TraceHeap {
int
i;
public
:
static
void
*
operator
new
(size_t siz) {
void
*
p =
::
operator
new
(siz);
cout <<
"Allocating TraceHeap object on
the heap "
<<
"at address "
<<
p
<<
endl;
return
p;
}
static
void
operator
delete
(void
*
p) {
cout <<
"Deleting TraceHeap object at
address "
<<
p <<
endl;
::
operator
delete
(p);
}
TraceHeap(int
i) : i(i) {}
int
getVal() const
{
return
i; }
}
;
int
main() {
auto_ptr<
TraceHeap>
pMyObject(new
TraceHeap(5
));
cout <<
pMyObject->
getVal() <<
endl;
// Prints 5
}
///
:~
The TraceHeap class overloads the operator new and operator delete so you can see exactly what's happening. Notice that, like any other class template, you specify the type you're going to use in a template parameter. You don't say TraceHeap*, however—auto_ptr already knows that it will be storing a pointer to your type. The second line of main( ) verifies that auto_ptr's operator->( ) function applies the indirection to the original, underlying pointer. Most important, even though we didn't explicitly delete the original pointer, pMyObject's destructor deletes the original pointer during stack unwinding, as the following output verifies:
Allocating TraceHeap object on the heap at address
8930040
5
Deleting TraceHeap object at
address 8930040
The auto_ptr class template is also handy for pointer data members. Since class objects contained by value are always destructed, auto_ptr members always delete the raw pointer they wrap when the containing object is destructed.(6)
1-1-5-4. Function-level try blocks▲
Since constructors can routinely throw exceptions, you might want to handle exceptions that occur when an object's member or base subobjects are initialized. To do this, you can place the initialization of such subobjects in a function-level try block. In a departure from the usual syntax, the try block for constructor initializers is the constructor body, and the associated catch block follows the body of the constructor, as in the following example:
//: C01:InitExcept.cpp {-bor}
// Handles exceptions from subobjects.
#include
<iostream>
using
namespace
std;
class
Base {
int
i;
public
:
class
BaseExcept {}
;
Base(int
i) : i(i) {
throw
BaseExcept(); }
}
;
class
Derived : public
Base {
public
:
class
DerivedExcept {
const
char
*
msg;
public
:
DerivedExcept(const
char
*
msg) : msg(msg) {}
const
char
*
what() const
{
return
msg; }
}
;
Derived(int
j) try
: Base(j) {
// Constructor body
cout <<
"This won't print"
<<
endl;
}
catch
(BaseExcept&
) {
throw
DerivedExcept("Base subobject
threw"
);;
}
}
;
int
main() {
try
{
Derived d(3
);
}
catch
(Derived::
DerivedExcept&
d) {
cout <<
d.what() <<
endl; //
"Base subobject threw"
}
}
///
:~
Notice that the initializer list in the constructor for Derived goes after the try keyword but before the constructor body. If an exception does occur, the contained object is not constructed, so it makes no sense to return to the code that created it. For this reason, the only sensible thing to do is to throw an exception in the function-level catch clause.
Although it is not terribly useful, C++ also allows function-level try blocks for any function, as the following example illustrates:
//: C01:FunctionTryBlock.cpp {-bor}
// Function-level try blocks.
// {RunByHand} (Don't run automatically by the
makefile)
#include
<iostream>
using
namespace
std;
int
main() try
{
throw
"main"
;
}
catch
(const
char
*
msg) {
cout <<
msg <<
endl;
return
1
;
}
///
:~
In this case, the catch block can return in the same manner that the function body normally returns. Using this type of function-level try block isn't much different from inserting a try-catch around the code inside of the function body.
1-1-6. Standard exceptions▲
The exceptions used with the Standard C++ library are also available for your use. Generally it's easier and faster to start with a standard exception class than to try to define your own. If the standard class doesn't do exactly what you need, you can derive from it.
All standard exception classes derive ultimately from the class exception, defined in the header <exception>. The two main derived classes are logic_error and runtime_error, which are found in <stdexcept> (which itself includes <exception>). The class logic_error represents errors in programming logic, such as passing an invalid argument. Runtime errors are those that occur as the result of unforeseen forces such as hardware failure or memory exhaustion. Both runtime_error and logic_error provide a constructor that takes a std::string argument so that you can store a message in the exception object and extract it later with exception::what( ) , as the following program illustrates:
//: C01:StdExcept.cpp
// Derives an exception class from std::runtime_error.
#include
<stdexcept>
#include
<iostream>
using
namespace
std;
class
MyError : public
runtime_error {
public
:
MyError(const
string&
msg =
""
) :
runtime_error(msg) {}
}
;
int
main() {
try
{
throw
MyError("my message"
);
}
catch
(MyError&
x) {
cout <<
x.what() <<
endl;
}
}
///
:~
Although the runtime_error constructor inserts the message into its std::exception subobject, std::exception does not provide a constructor that takes a std::string argument. You'll usually want to derive your exception classes from either runtime_error or logic_error (or one of their derivatives), and not from std::exception.
The following tables describe the standard exception classes:
exception | The base class for all the exceptions thrown by the C++ Standard library. You can ask what( ) and retrieve the optional string with which the exception was initialized. |
logic_error | Derived from exception. Reports program logic errors, which could presumably be detected by inspection. |
runtime_error | Derived from exception.Reports runtime errors, which can presumably be detected only when the program executes. |
The iostream exception class ios::failure is also derived from exception, but it has no further subclasses.
You can use the classes in both of the following tables as they are, or you can use them as base classes from which to derive your own more specific types of exceptions.
Exception classes derived from logic_error | |
---|---|
domain_error | Reports violations of a precondition. |
invalid_argument | Indicates an invalid argument to the function from which it is thrown. |
length_error | Indicates an attempt to produce an object whose length is greater than or equal to npos (the largest representable value of context's size type, usually std::size_t). |
out_of_range | Reports an out-of-range argument. |
bad_cast | Thrown for executing an invalid dynamic_cast expression in runtime type identification (see Chapter 8). |
bad_typeid | Reports a null pointer p in an expression typeid(*p). (Again, a runtime type identification feature in Chapter 8). |
Exception classes derived from runtime_error | |
---|---|
range_error | Reports violation of a postcondition. |
overflow_error | Reports an arithmetic overflow. |
bad_alloc | Reports a failure to allocate storage. |
1-1-7. Exception specifications▲
You're not required to inform the people using your function what exceptions you might throw. However, failure to do so can be considered uncivilized because it means that users cannot be sure what code to write to catch all potential exceptions. If they have your source code, they can hunt through and look for throw statements, but often a library doesn't come with sources. Good documentation can help alleviate this problem, but how many software projects are well documented? C++ provides syntax to tell the user the exceptions that are thrown by this function, so the user can handle them. This is the optional exception specification, which adorns a function's declaration, appearing after the argument list.
The exception specification reuses the keyword throw, followed by a parenthesized list of all the types of potential exceptions that the function can throw. Your function declaration might look like this:
void
f() throw
(toobig, toosmall, divzero);
As far as exceptions are concerned, the traditional function declaration
void
f();
means that any type of exception can be thrown from the function. If you say
void
f() throw
();
no exceptions whatsoever will be thrown from the function (so you'd better be sure that no functions farther down in the call chain let any exceptions propagate up!).
For good coding policy, good documentation, and ease-of-use for the function caller, consider using exception specifications when you write functions that throw exceptions. (Variations on this guideline are discussed later in this chapter.)
The unexpected( ) function
If your exception specification claims you're going to throw a certain set of exceptions and then you throw something that isn't in that set, what's the penalty? The special function unexpected( ) is called when you throw something other than what appears in the exception specification. Should this unfortunate situation occur, the default unexpected( ) calls the terminate( ) function described earlier in this chapter.
The set_unexpected( ) function
Like terminate( ), the unexpected( ) mechanism installs your own function to respond to unexpected exceptions. You do so with a function called set_unexpected( ), which, like set_terminate( ), takes the address of a function with no arguments and void return value. Also, because it returns the previous value of the unexpected( ) pointer, you can save it and restore it later. To use set_unexpected( ), include the header file <exception>. Here's an example that shows a simple use of the features discussed so far in this section:
//: C01:Unexpected.cpp
// Exception specifications & unexpected(),
//{-msc} (Doesn't terminate properly)
#include
<exception>
#include
<iostream>
using
namespace
std;
class
Up {}
;
class
Fit {}
;
void
g();
void
f(int
i) throw
(Up, Fit) {
switch
(i) {
case
1
: throw
Up();
case
2
: throw
Fit();
}
g();
}
// void g() {} // Version 1
void
g() {
throw
47
; }
// Version 2
void
my_unexpected() {
cout <<
"unexpected exception thrown"
<<
endl;
exit(0
);
}
int
main() {
set_unexpected(my_unexpected); // (Ignores return
value)
for
(int
i =
1
; i <=
3
; i++
)
try
{
f(i);
}
catch
(Up) {
cout <<
"Up caught"
<<
endl;
}
catch
(Fit) {
cout <<
"Fit caught"
<<
endl;
}
}
///
:~
The classes Up and Fit are created solely to throw as exceptions. Often exception classes will be small, but they can certainly hold additional information so that the handlers can query for it.
The f( ) function promises in its exception specification to throw only exceptions of type Up and Fit, and from looking at the function definition, this seems plausible. Version one of g( ), called by f( ), doesn't throw any exceptions, so this is true. But if someone changes g( ) so that it throws a different type of exception (like the second version in this example, which throws an int), the exception specification for f( ) is violated.
The my_unexpected( ) function has no arguments or return value, following the proper form for a custom unexpected( ) function. It simply displays a message so that you can see that it was called, and then exits the program (exit(0) is used here so that the book's make process is not aborted). Your new unexpected( ) function should not have a return statement.
In main( ), the try block is within a for loop, so all the possibilities are exercised. In this way, you can achieve something like resumption. Nest the try block inside a for, while, do, or if and cause any exceptions to attempt to repair the problem; then attempt the try block again.
Only the Up and Fit exceptions are caught because those are the only exceptions that the programmer of f( ) said would be thrown. Version two of g( ) causes my_unexpected( ) to be called because f( ) then throws an int.
In the call to set_unexpected( ), the return value is ignored, but it can also be saved in a pointer to function and be restored later, as we did in the set_terminate( ) example earlier in this chapter.
A typical unexpected handler logs the error and terminates the program by calling exit( ). It can, however, throw another exception (or rethrow the same exception) or call abort( ). If it throws an exception of a type allowed by the function whose specification was originally violated, the search resumes at the call of the function with this exception specification. (This behavior is unique to unexpected( ).)
If the exception thrown from your unexpected handler is not allowed by the original function's specification, one of the following occurs:
1. If std::bad_exception (defined in <exception>) was in the function's exception specification, the exception thrown from the unexpected handler is replaced with a std::bad_exception object, and the search resumes from the function as before.
2. If the original function's specification did not include std::bad_exception, terminate( ) is called.
The following program illustrates this behavior:
//: C01:BadException.cpp {-bor}
#include
<exception>
// For std::bad_exception
#include
<iostream>
#include
<cstdio>
using
namespace
std;
// Exception classes:
class
A {}
;
class
B {}
;
// terminate() handler
void
my_thandler() {
cout <<
"terminate called"
<<
endl;
exit(0
);
}
// unexpected() handlers
void
my_uhandler1() {
throw
A(); }
void
my_uhandler2() {
throw
; }
// If we embed this throw statement in f or g,
// the compiler detects the violation and reports
// an error, so we put it in its own function.
void
t() {
throw
B(); }
void
f() throw
(A) {
t(); }
void
g() throw
(A, bad_exception) {
t(); }
int
main() {
set_terminate(my_thandler);
set_unexpected(my_uhandler1);
try
{
f();
}
catch
(A&
) {
cout <<
"caught an A from f"
<<
endl;
}
set_unexpected(my_uhandler2);
try
{
g();
}
catch
(bad_exception&
) {
cout <<
"caught a bad_exception from
g"
<<
endl;
}
try
{
f();
}
catch
(...) {
cout <<
"This will never print"
<<
endl;
}
}
///
:~
The my_uhandler1( ) handler throws an acceptable exception (A), so execution resumes at the first catch, which succeeds. The my_uhandler2( ) handler does not throw a valid exception (B), but since g specifies bad_exception, the B exception is replaced by a bad_exception object, and the second catch also succeeds. Since f does not include bad_exception in its specification, my_thandler( ) is called as a terminate handler. Here's the output:
caught an A from f
caught a bad_exception from g
terminate called
1-1-7-1. Better exception specifications?▲
You may feel that the existing exception specification rules aren't very safe, and that
void
f();
should mean that no exceptions are thrown from this function. If the programmer wants to throw any type of exception, you might think he or she should have to say
void
f() throw
(...); // Not in C++
This would surely be an improvement because function declarations would be more explicit. Unfortunately, you can't always know by looking at the code in a function whether an exception will be thrown—it could happen because of a memory allocation, for example. Worse, existing functions written before exception handling was introduced into the language may find themselves inadvertently throwing exceptions because of the functions they call (which might be linked into new, exception-throwing versions). Hence, the uninformative situation whereby
void
f();
means, “Maybe I'll throw an exception, maybe I won't.” This ambiguity is necessary to avoid hindering code evolution. If you want to specify that f throws no exceptions, use the empty list, as in:
void
f() throw
();
1-1-7-2. Exception specifications and inheritance▲
Each public function in a class essentially forms a contract with the user; if you pass it certain arguments, it will perform certain operations and/or return a result. The same contract must hold true in derived classes; otherwise the expected “is-a” relationship between derived and base classes is violated. Since exception specifications are logically part of a function's declaration, they too must remain consistent across an inheritance hierarchy. For example, if a member function in a base class says it will only throw an exception of type A, an override of that function in a derived class must not add any other exception types to the specification list because that would break any programs that adhere to the base class interface. You can, however, specify fewer exceptions or none at all, since that doesn't require the user to do anything differently. You can also specify anything that “is-a” A in place of A in the derived function's specification. Here's an example.
//: C01:Covariance.cpp {-xo}
// Should cause compile error. {-mwcc}{-msc}
#include
<iostream>
using
namespace
std;
class
Base {
public
:
class
BaseException {}
;
class
DerivedException : public
BaseException {}
;
virtual
void
f() throw
(DerivedException) {
throw
DerivedException();
}
virtual
void
g() throw
(BaseException) {
throw
BaseException();
}
}
;
class
Derived : public
Base {
public
:
void
f() throw
(BaseException) {
throw
BaseException();
}
virtual
void
g() throw
(DerivedException) {
throw
DerivedException();
}
}
; ///
:~
A compiler should flag the override of Derived::f( ) with an error (or at least a warning) since it changes its exception specification in a way that violates the specification of Base::f( ). The specification for Derived::g( ) is acceptable because DerivedException “is-a” BaseException (not the other way around). You can think of Base/Derived and BaseException/DerivedException as parallel class hierarchies; when you are in Derived, you can replace references to BaseException in exception specifications and return values with DerivedException. This behavior is called covariance (since both sets of classes vary down their respective hierarchies together). (Reminder from Volume 1: parameter types are not covariant—you are not allowed to change the signature of an overridden virtual function.)
1-1-7-3. When not to use exception specifications▲
If you peruse the function declarations throughout the Standard C++ library, you'll find that not a single exception specification occurs anywhere! Although this might seem strange, there is a good reason for this seeming incongruity: the library consists mainly of templates, and you never know what a generic type or function might do. For example, suppose you are developing a generic stack template and attempt to affix an exception specification to your pop function, like this:
T pop() throw
(logic_error);
Since the only error you anticipate is a stack underflow, you might think it's safe to specify a logic_error or some other appropriate exception type. But type T's copy constructor could throw an exception. Then unexpected( ) would be called, and your program would terminate. You can't make unsupportable guarantees. If you don't know what exceptions might occur, don't use exception specifications. That's why template classes, which constitute the majority of the Standard C++ library, do not use exception specifications—they specify the exceptions they know about in documentation and leave the rest to you. Exception specifications are mainly for non-template classes.
1-1-8. Exception safety▲
In Chapter 7 we'll take an in-depth look at the containers in the Standard C++ library, including the stack container. One thing you'll notice is that the declaration of the pop( ) member function looks like this:
void
pop();
You might think it strange that pop( ) doesn't return a value. Instead, it just removes the element at the top of the stack. To retrieve the top value, call top( ) before you call pop( ). There is an important reason for this behavior, and it has to do with exception safety, a crucial consideration in library design. There are different levels of exception safety, but most importantly, and just as the name implies, exception safety is about correct semantics in the face of exceptions.
Suppose you are implementing a stack with a dynamic array (we'll call it data and the counter integer count), and you try to write pop( ) so that it returns a value. The code for such a pop( ) might look something like this:
template
<
class
T>
T stack<
T>
::
pop() {
if
(count ==
0
)
throw
logic_error("stack underflow"
);
else
return
data[--
count];
}
What happens if the copy constructor that is called for the return value in the last line throws an exception when the value is returned? The popped element is not returned because of the exception, and yet count has already been decremented, so the top element you wanted is lost forever! The problem is that this function attempts to do two things at once: (1) return a value, and (2) change the state of the stack. It is better to separate these two actions into two separate member functions, which is exactly what the standard stack class does. (In other words, follow the design practice of cohesion—every function should do one thing well.) Exception-safe code leaves objects in a consistent state and does not leak resources.
You also need to be careful writing custom assignment operators. In Chapter 12 of Volume 1, you saw that operator= should adhere to the following pattern:
1. Make sure you're not assigning to self. If you are, go to step 6. (This is strictly an optimization.)
2. Allocate new memory required by pointer data members.
3. Copy data from the old memory to the new.
4. Delete the old memory.
5. Update the object's state by assigning the new heap pointers to the pointer data members.
6. Return *this.
It's important to not change the state of your object until all the new pieces have been safely allocated and initialized. A good technique is to move steps 2 and 3 into a separate function, often called clone( ). The following example does this for a class that has two pointer members, theString and theInts:
//: C01:SafeAssign.cpp
// An Exception-safe operator=.
#include
<iostream>
#include
<new>
// For std::bad_alloc
#include
<cstring>
#include
<cstddef>
using
namespace
std;
// A class that has two pointer members using the heap
class
HasPointers {
// A Handle class to hold the data
struct
MyData {
const
char
*
theString;
const
int
*
theInts;
size_t numInts;
MyData(const
char
*
pString, const
int
*
pInts,
size_t nInts)
:
theString(pString), theInts(pInts),
numInts(nInts) {}
}
*
theData; // The handle
// Clone and cleanup functions:
static
MyData*
clone(const
char
*
otherString,
const
int
*
otherInts, size_t nInts) {
char
*
newChars =
new
char
[strlen(otherString)+
1
];
int
*
newInts;
try
{
newInts =
new
int
[nInts];
}
catch
(bad_alloc&
) {
delete
[] newChars;
throw
;
}
try
{
// This example uses built-in types, so it won't
// throw, but for class types it could throw, so
we
// use a try block for illustration. (This is the
// point of the example!)
strcpy(newChars, otherString);
for
(size_t i =
0
; i <
nInts; ++
i)
newInts[i] =
otherInts[i];
}
catch
(...) {
delete
[] newInts;
delete
[] newChars;
throw
;
}
return
new
MyData(newChars, newInts, nInts);
}
static
MyData*
clone(const
MyData*
otherData) {
return
clone(otherData->
theString, otherData->
theInts,
otherData->
numInts);
}
static
void
cleanup(const
MyData*
theData) {
delete
[] theData->
theString;
delete
[] theData->
theInts;
delete
theData;
}
public
:
HasPointers(const
char
*
someString, const
int
*
someInts,
size_t numInts) {
theData =
clone(someString, someInts, numInts);
}
HasPointers(const
HasPointers&
source) {
theData =
clone(source.theData);
}
HasPointers&
operator
=
(const
HasPointers&
rhs) {
if
(this
!=
&
rhs) {
MyData*
newData =
clone(rhs.theData->
theString,
rhs.theData->
theInts,
rhs.theData->
numInts);
cleanup(theData);
theData =
newData;
}
return
*
this
;
}
~
HasPointers() {
cleanup(theData); }
friend
ostream&
operator
<<
(ostream&
os, const
HasPointers&
obj) {
os <<
obj.theData->
theString <<
": "
;
for
(size_t i =
0
; i <
obj.theData->
numInts;
++
i)
os <<
obj.theData->
theInts[i] <<
'
';
return
os;
}
}
;
int
main() {
int
someNums[] =
{
1
, 2
, 3
, 4
}
;
size_t someCount =
sizeof
someNums /
sizeof
someNums[0
];
int
someMoreNums[] =
{
5
, 6
, 7
}
;
size_t someMoreCount =
sizeof
someMoreNums /
sizeof
someMoreNums[0
];
HasPointers h1("Hello"
, someNums,
someCount);
HasPointers h2("Goodbye"
, someMoreNums,
someMoreCount);
cout <<
h1 <<
endl; // Hello: 1 2 3 4
h1 =
h2;
cout <<
h1 <<
endl; // Goodbye: 5 6 7
}
///
:~
For convenience, HasPointers uses the MyData class as a handle to the two pointers. Whenever it's time to allocate more memory, whether during construction or assignment, the first clone function is ultimately called to do the job. If memory fails for the first call to the new operator, a bad_alloc exception is thrown automatically. If it happens on the second allocation (for theInts), we must clean up the memory for theString—hence the first try block that catches a bad_alloc exception. The second try block isn't crucial here because we're just copying ints and pointers (so no exceptions will occur), but whenever you copy objects, their assignment operators can possibly cause an exception, so everything needs to be cleaned up. In both exception handlers, notice that we rethrow the exception. That's because we're just managing resources here; the user still needs to know that something went wrong, so we let the exception propagate up the dynamic chain. Software libraries that don't silently swallow exceptions are called exception neutral. Always strive to write libraries that are both exception safe and exception neutral.(7)
If you inspect the previous code closely, you'll notice that none of the delete operations will throw an exception. This code depends on that fact. Recall that when you call delete on an object, the object's destructor is called. It turns out to be practically impossible to design exception-safe code without assuming that destructors don't throw exceptions. Don't let destructors throw exceptions. (We're going to remind you about this once more before this chapter is done).(8)
1-1-9. Programming with exceptions▲
For most programmers, especially C programmers, exceptions are not available in their existing language and require some adjustment. Here are guidelines for programming with exceptions.
1-1-9-1. When to avoid exceptions▲
Exceptions aren't the answer to all problems; overuse can cause trouble. The following sections point out situations where exceptions are not warranted. The best advice for deciding when to use exceptions is to throw exceptions only when a function fails to meet its specification.
Not for asynchronous events
The Standard C signal( )system and any similar system handle asynchronous events: events that happen outside the flow of a program, and thus events the program cannot anticipate. You cannot use C++ exceptions to handle asynchronous events because the exception and its handler are on the same call stack. That is, exceptions rely on the dynamic chain of function calls on the program's runtime stack (they have “dynamic scope”), whereas asynchronous events must be handled by completely separate code that is not part of the normal program flow (typically, interrupt service routines or event loops). Don't throw exceptions from interrupt handlers.
This is not to say that asynchronous events cannot be associated with exceptions. But the interrupt handler should do its job as quickly as possible and then return. The typical way to handle this situation is to set a flag in the interrupt handler, and check it synchronously in the mainline code.
Not for benign error conditions
If you have enough information to handle an error, it's not an exception. Take care of it in the current context rather than throwing an exception to a larger context.
Also, C++ exceptions are not thrown for machine-level events such as divide-by-zero.(9) It's assumed that some other mechanism, such as the operating system or hardware, deals with these events. In this way, C++ exceptions can be reasonably efficient, and their use is isolated to program-level exceptional conditions.
Not for flow-of-control
An exception looks somewhat like an alternate return mechanism and somewhat like a switch statement, so you might be tempted to use an exception instead of these ordinary language mechanisms. This is a bad idea, partly because the exception-handling system is significantly less efficient than normal program execution. Exceptions are a rare event, so the normal program shouldn't pay for them. Also, exceptions from anything other than error conditions are quite confusing to the user of your class or function.
You're not forced to use exceptions
Some programs are quite simple (small utilities, for example). You might only need to take input and perform some processing. In these programs, you might attempt to allocate memory and fail, try to open a file and fail, and so on. It is acceptable in these programs to display a message and exit the program, allowing the system to clean up the mess, rather than to work hard to catch all exceptions and recover all the resources yourself. Basically, if you don't need exceptions, you're not forced to use them.
New exceptions, old code
Another situation that arises is the modification of an existing program that doesn't use exceptions. You might introduce a library that does use exceptions and wonder if you need to modify all your code throughout the program. Assuming you have an acceptable error-handling scheme already in place, the most straightforward thing to do is surround the largest block that uses the new library (this might be all the code in main( ))with a try block, followed by a catch(...) and basic error message). You can refine this to whatever degree necessary by adding more specific handlers, but, in any case, the code you must add can be minimal. It's even better to isolate your exception-generating code in a try block and write handlers to convert the exceptions into your existing error-handling scheme.
It's truly important to think about exceptions when you're creating a library for someone else to use, especially if you can't know how they need to respond to critical error conditions (recall the earlier discussions on exception safety and why there are no exception specifications in the Standard C++ Library).
1-1-9-2. Typical uses of exceptions▲
Do use exceptions to do the following:
- Fix the problem and retry the function that caused the exception.
- Patch things up and continue without retrying the function.
- Do whatever you can in the current context and rethrow the same exception to a higher context.
- Do whatever you can in the current context and throw a different exception to a higher context.
- Terminate the program.
- Wrap functions (especially C library functions) that use ordinary error schemes so they produce exceptions instead.
- Simplify. If your error handling scheme makes things more complicated, it is painful and annoying to use. Exceptions can be used to make error handling simpler and more effective.
- Make your library and program safer. This is a short-term investment (for debugging) and a long-term investment (for application robustness).
When to use exception specifications
The exception specification is like a function prototype: it tells the user to write exception-handling code and what exceptions to handle. It tells the compiler the exceptions that might come out of this function so that it can detect violations at runtime.
You can't always look at the code and anticipate which exceptions will arise from a particular function. Sometimes, the functions it calls produce an unexpected exception, and sometimes an old function that didn't throw an exception is replaced with a new one that does, and you get a call to unexpected( ). Any time you use exception specifications or call functions that do, consider creating your own unexpected( ) function that logs a message and then either throws an exception or aborts the program.
As we explained earlier, you should avoid using exception specifications in template classes, since you can't anticipate what types of exceptions the template parameter classes might throw.
Start with standard exceptions
Check out the Standard C++ library exceptions before creating your own. If a standard exception does what you need, chances are it's a lot easier for your user to understand and handle.
If the exception type you want isn't part of the standard library, try to inherit one from an existing standard exception. It's nice if your users can always write their code to expect the what( ) function defined in the exception( ) class interface.
Nest your own exceptions
If you create exceptions for your particular class, it's a good idea to nest the exception classes either inside your class or inside a namespace containing your class, to provide a clear message to the reader that this exception is only for your class. In addition, it prevents pollution of the global namespace.
You can nest your exceptions even if you're deriving them from C++ Standard exceptions.
Use exception hierarchies
Using exception hierarchies is a valuable way to classify the types of critical errors that might be encountered with your class or library. This gives helpful information to users, assists them in organizing their code, and gives them the option of ignoring all the specific types of exceptions and just catching the base-class type. Also, any exceptions added later by inheriting from the same base class will not force all existing code to be rewritten—the base-class handler will catch the new exception.
The Standard C++ exceptions are a good example of an exception hierarchy. Build your exceptions on top of it if you can.
Multiple inheritance (MI)
As you'll read in Chapter 9, the only essential place for MI is if you need to upcast an object pointer to two different base classes—that is, if you need polymorphic behavior with both of those base classes. It turns out that exception hierarchies are useful places for multiple inheritance because a base-class handler from any of the roots of the multiply inherited exception class can handle the exception.
Catch by reference, not by value
As you saw in the section “Exception matching,” you should catch exceptions by reference for two reasons:
- To avoid making a needless copy of the exception object when it is passed to the handler.
- To avoid object slicing when catching a derived exception as a base class object.
Although you can also throw and catch pointers, by doing so you introduce more coupling—the thrower and the catcher must agree on how the exception object is allocated and cleaned up. This is a problem because the exception itself might have occurred from heap exhaustion. If you throw exception objects, the exception-handling system takes care of all storage.
Throw exceptions in constructors
Because a constructor has no return value, you've previously had two ways to report an error during construction:
- Set a nonlocal flag and hope the user checks it.
- Return an incompletely created object and hope the user checks it.
This problem is serious because C programmers expect that object creation is always successful, which is not unreasonable in C because the types are so primitive. But continuing execution after construction fails in a C++ program is a guaranteed disaster, so constructors are one of the most important places to throw exceptions—now you have a safe, effective way to handle constructor errors. However, you must also pay attention to pointers inside objects and the way cleanup occurs when an exception is thrown inside a constructor.
Don't cause exceptions in destructors
Because destructors are called in the process of throwing other exceptions, you'll never want to throw an exception in a destructor or cause another exception to be thrown by some action you perform in the destructor. If this happens, a new exception can be thrown before the catch-clause for an existing exception is reached, which will cause a call to terminate( ).
If you call any functions inside a destructor that can throw exceptions, those calls should be within a try block in the destructor, and the destructor must handle all exceptions itself. None must escape from the destructor.
Avoid naked pointers
See Wrapped.cpp earlier in this chapter. A naked pointer usually means vulnerability in the constructor if resources are allocated for that pointer. A pointer doesn't have a destructor, so those resources aren't released if an exception is thrown in the constructor. Use auto_ptr or other smart pointer types(10) for pointers that reference heap memory.
1-1-10. Overhead▲
When an exception is thrown, there's considerable runtime overhead (but it's good overhead, since objects are cleaned up automatically!). For this reason, you never want to use exceptions as part of your normal flow-of-control, no matter how tempting and clever it may seem. Exceptions should occur only rarely, so the overhead is piled on the exception and not on the normally executing code. One of the important design goals for exception handling was that it could be implemented with no impact on execution speed when it wasn't used; that is, as long as you don't throw an exception, your code runs as fast as it would without exception handling. Whether this is true depends on the particular compiler implementation you're using. (See the description of the “zero-cost model” later in this section.)
You can think of a throw expression as a call to a special system function that takes the exception object as an argument and backtracks up the chain of execution. For this to work, extra information needs to be put on the stack by the compiler, to aid in stack unwinding. To understand this, you need to know about the runtime stack.
Whenever a function is called, information about that function is pushed onto the runtime stack in an activation record instance (ARI), also called a stack frame. A typical stack frame contains the address of the calling function (so execution can return to it), a pointer to the ARI of the function's static parent (the scope that lexically contains the called function, so variables global to the function can be accessed), and a pointer to the function that called it (its dynamic parent). The path that logically results from repetitively following the dynamic parent links is the dynamic chain, or call chain, that we've mentioned previously in this chapter. This is how execution can backtrack when an exception is thrown, and it is the mechanism that makes it possible for components developed without knowledge of one another to communicate errors at runtime.
To enable stack unwinding for exception handling, extra exception-related information about each function needs to be available for each stack frame. This information describes which destructors need to be called (so that local objects can be cleaned up), indicates whether the current function has a try block, and lists which exceptions the associated catch clauses can handle. There is space penalty for this extra information, so programs that support exception handling can be somewhat larger than those that don't.(11) Even the compile-time size of programs using exception handling is greater, since the logic of how to generate the expanded stack frames during runtime must be generated by the compiler.
To illustrate this, we compiled the following program both with and without exception-handling support in Borland C++ Builder and Microsoft Visual C++:(12)
//: C01:HasDestructor.cpp {O}
class
HasDestructor {
public
:
~
HasDestructor() {}
}
;
void
g(); // For all we know, g may throw.
void
f() {
HasDestructor h;
g();
}
///
:~
If exception handling is enabled, the compiler must keep information about ~HasDestructor( ) available at runtime in the ARI for f( ) (so it can destroy h properly should g( ) throw an exception). The following table summarizes the result of the compilations in terms of the size of the compiled (.obj) files (in bytes).
Compiler\Mode | With Exception Support | Without Exception Support |
Borland | 616 | 234 |
Microsoft | 1162 | 680 |
Don't take the percentage differences between the two modes too seriously. Remember that exceptions (should) typically constitute a small part of a program, so the space overhead tends to be much smaller (usually between 5 and 15 percent).
This extra housekeeping slows down execution, but a clever compiler implementation avoids this. Since information about exception-handling code and the offsets of local objects can be computed once at compile time, such information can be kept in a single place associated with each function, but not in each ARI. You essentially remove exception overhead from each ARI and thus avoid the extra time to push them onto the stack. This approach is called the zero-cost model(13) of exception handling, and the optimized storage mentioned earlier is known as the shadow stack.(14)
1-1-11. Summary▲
Error recovery is a fundamental concern for every program you write. It's especially important in C++ when creating program components for others to use. To create a robust system, each component must be robust.
The goals for exception handling in C++ are to simplify the creation of large, reliable programs using less code than currently possible, with more confidence that your application doesn't have an unhandled error. This is accomplished with little or no performance penalty and with low impact on existing code.
Basic exceptions are not terribly difficult to learn; begin using them in your programs as soon as you can. Exceptions are one of those features that provide immediate and significant benefits to your project.
1-1-12. Exercises▲
Solutions to selected exercises can be found in the electronic document The Thinking in C++ Volume 2 Annotated Solution Guide, available for a small fee from www.MindView.net.
- Write three functions: one that returns an error value to indicate an error condition, one that sets errno, and one that uses signal( ). Write code that calls these functions and responds to the errors. Now write a fourth function that throws an exception. Call this function and catch the exception. Describe the differences between these four approaches, and why exception handling is an improvement.
- Create a class with member functions that throw exceptions. Within this class, make a nested class to use as an exception object. It takes a single const char* as its argument; this represents a description string. Create a member function that throws this exception. (State this in the function's exception specification.) Write a try block that calls this function and a catch clause that handles the exception by displaying its description string.
- Rewrite the Stash class from Chapter 13 of Volume 1 so that it throws out_of_range exceptions for operator[ ].
- Write a generic main( ) that takes all exceptions and reports them as errors.
- Create a class with its own operator new. This operator should allocate ten objects, and on the eleventh object “run out of memory” and throw an exception. Also add a static member function that reclaims this memory. Now create a main( ) with a try block and a catch clause that calls the memory-restoration routine. Put these inside a while loop, to demonstrate recovering from an exception and continuing execution.
- Create a destructor that throws an exception, and write code to prove to yourself that this is a bad idea by showing that if a new exception is thrown before the handler for the existing one is reached, terminate( ) is called.
- Prove to yourself that all exception objects (the ones that are thrown) are properly destroyed.
- Prove to yourself that if you create an exception object on the heap and throw the pointer to that object, it will not be cleaned up.
- Write a function with an exception specification that can throw four exception types: a char, an int, a bool, and your own exception class. Catch each in main( ) and verify the catch. Derive your exception class from a standard exception. Write the function in such a way that the system recovers and tries to execute it again.
- Modify your solution to the previous exercise to throw a double from the function, violating the exception specification. Catch the violation with your own unexpected handler that displays a message and exits the program gracefully (meaning abort( ) is not called).
- Write a Garage class that has a Car that is having troubles with its Motor. Use a function-level try block in the Garage class constructor to catch an exception (thrown from the Motor class) when its Car object is initialized. Throw a different exception from the body of the Garage constructor's handler and catch it in main( ).
1-2. Defensive Programming▲
Writing “perfect software” may be an elusive goal for developers, but a few defensive techniques, routinely applied, can go a long way toward improving the quality of your code.
Although the complexity of typical production software guarantees that testers will always have a job, we hope you still yearn to produce defect-free software. Object-oriented design techniques do much to corral the difficulty of large projects, but eventually you must write loops and functions. These details of “programming in the small” become the building blocks of the larger components needed for your designs. If your loops are off by one or your functions calculate the correct values only “most” of the time, you're in trouble no matter how fancy your overall methodology. In this chapter, you'll see practices that help create robust code regardless of the size of your project.
Your code is, among other things, an expression of your attempt to solve a problem. It should be clear to the reader (including yourself) exactly what you were thinking when you designed that loop. At certain points in your program, you should be able to make bold statements that some condition or other holds. (If you can't, you really haven't yet solved the problem.) Such statements are called invariants, since they should invariably be true at the point where they appear in the code; if not, either your design is faulty, or your code does not accurately reflect your design.
Consider a program that plays the guessing game of Hi-Lo. One person thinks of a number between 1 and 100, and the other person guesses the number. (We'll let the computer do the guessing.) The person who holds the number tells the guesser whether their guess is high, low or correct. The best strategy for the guesser is a binary search, which chooses the midpoint of the range of numbers where the sought-after number resides. The high-low response tells the guesser which half of the list holds the number, and the process repeats, halving the size of the active search range on each iteration. So how do you write a loop to drive the repetition properly? It's not sufficient to just say
bool
guessed =
false
;
while
(!
guessed) {
...
}
because a malicious user might respond deceitfully, and you could spend all day guessing. What assumption, however simple, are you making each time you guess? In other words, what condition should hold by design on each loop iteration?
The simple assumption is that the secret number is within the current active range of unguessed numbers: [1, 100]. Suppose we label the endpoints of the range with the variables low and high. Each time you pass through the loop you need to make sure that if the number was in the range [low, high] at the beginning of the loop, you calculate the new range so that it still contains the number at the end of the current loop iteration.
The goal is to express the loop invariant in code so that a violation can be detected at runtime. Unfortunately, since the computer doesn't know the secret number, you can't express this condition directly in code, but you can at least make a comment to that effect:
while
(!
guessed) {
// INVARIANT: the number is in the range [low, high]
...
}
What happens when the user says that a guess is too high or too low when it isn't? The deception will exclude the secret number from the new subrange. Because one lie always leads to another, eventually your range will diminish to nothing (since you shrink it by half each time and the secret number isn't in there). We can express this condition in the following program:
//: C02:HiLo.cpp {RunByHand}
// Plays the game of Hi-Lo to illustrate a loop
invariant.
#include
<cstdlib>
#include
<iostream>
#include
<string>
using
namespace
std;
int
main() {
cout <<
"Think of a number between 1 and
100"
<<
endl
<<
"I will make a
guess; "
<<
"tell me if I'm
(H)igh or (L)ow"
<<
endl;
int
low =
1
, high =
100
;
bool
guessed =
false
;
while
(!
guessed) {
// Invariant: the number is in the range [low,
high]
if
(low >
high) {
// Invariant violation
cout <<
"You cheated! I quit"
<<
endl;
return
EXIT_FAILURE;
}
int
guess =
(low +
high) /
2
;
cout <<
"My guess is "
<<
guess <<
". "
;
cout <<
"(H)igh, (L)ow, or (E)qual?
"
;
string response;
cin >>
response;
switch
(toupper(response[0
])) {
case
'H'
:
high =
guess -
1
;
break
;
case
'L'
:
low =
guess +
1
;
break
;
case
'E'
:
guessed =
true
;
break
;
default
:
cout <<
"Invalid response"
<<
endl;
continue
;
}
}
cout <<
"I got it!"
<<
endl;
return
EXIT_SUCCESS;
}
///
:~
The violation of the invariant is detected with the condition if(low > high), because if the user always tells the truth, we will always find the secret number before we run out of guesses.
We also use a standard C technique for reporting program status to the calling context by returning different values from main( ). It is portable to use the statement return 0; to indicate success, but there is no portable value to indicate failure. For this reason we use the macro declared for this purpose in <cstdlib>: EXIT_FAILURE. For consistency, whenever we use EXIT_FAILURE we also use EXIT_SUCCESS, even though the latter is always defined as zero.
1-2-1. Assertions▲
The condition in the Hi-Lo program depends on user input, so you can't prevent a violation of the invariant. However, invariants usually depend only on the code you write, so they will always hold if you've implemented your design correctly. In this case, it is clearer to make an assertion, which is a positive statement that reveals your design decisions.
Suppose you are implementing a vector of integers: an expandable array that grows on demand. The function that adds an element to the vector must first verify that there is an open slot in the underlying array that holds the elements; otherwise, it needs to request more heap space and copy the existing elements to the new space before adding the new element (and deleting the old array). Such a function might look like the following:
void
MyVector::
push_back(int
x) {
if
(nextSlot ==
capacity)
grow();
assert(nextSlot <
capacity);
data[nextSlot++
] =
x;
}
In this example, data is a dynamic array of ints with capacity slots and nextSlot slots in use. The purpose of grow( ) is to expand the size of data so that the new value of capacity is strictly greater than nextSlot. Proper behavior of MyVector depends on this design decision, and it will never fail if the rest of the supporting code is correct. We assert the condition with the assert( ) macro, which is defined in the header <cassert>.
The Standard C library assert( ) macro is brief, to the point, and portable. If the condition in its parameter evaluates to non-zero, execution continues uninterrupted; if it doesn't, a message containing the text of the offending expression along with its source file name and line number is printed to the standard error channel and the program aborts. Is that too drastic? In practice, it is much more drastic to let execution continue when a basic design assumption has failed. Your program needs to be fixed.
If all goes well, you will thoroughly test your code with all assertions intact by the time the final product is deployed. (We'll say more about testing later.) Depending on the nature of your application, the machine cycles needed to test all assertions at runtime might be too much of a performance hit in the field. If that's the case, you can remove all the assertion code automatically by defining the macro NDEBUG and rebuilding the application.
To see how this works, note that a typical implementation of assert( ) looks something like this:
#ifdef NDEBUG
#define assert(cond) ((void)0)
#else
void
assertImpl(const
char
*
, const
char
*
, long
);
#define assert(cond) \
((cond) ? (void)0 : assertImpl(???))
#endif
When the macro NDEBUG is defined, the code decays to the expression (void) 0, so all that's left in the compilation stream is an essentially empty statement as a result of the semicolon you appended to each assert( ) invocation. If NDEBUG is not defined, assert(cond) expands to a conditional statement that, when cond is zero, calls a compiler-dependent function (which we named assertImpl( )) with a string argument representing the text of cond, along with the file name and line number where the assertion appeared. (We used “???” as a place holder in the example, but the string mentioned is actually computed there, along with the file name and the line number where the macro occurs in that file. How these values are obtained is immaterial to our discussion.) If you want to turn assertions on and off at different points in your program, you must not only #define or #undef NDEBUG, but you must also re-include <cassert>. Macros are evaluated as the preprocessor encounters them and thus use whatever NDEBUG state applies at the point of inclusion. The most common way to define NDEBUG once for an entire program is as a compiler option, whether through project settings in your visual environment or via the command line, as in:
mycc -
DNDEBUG myfile.cpp
Most compilers use the -D flag to define macro names. (Substitute the name of your compiler's executable for mycc above.) The advantage of this approach is that you can leave your assertions in the source code as an invaluable bit of documentation, and yet there is no runtime penalty. Because the code in an assertion disappears when NDEBUG is defined, it is important that you never do work in an assertion. Only test conditions that do not change the state of your program.
Whether using NDEBUG for released code is a good idea remains a subject of debate. Tony Hoare, one of the most influential computer scientists of all time,(15) has suggested that turning off runtime checks such as assertions is similar to a sailing enthusiast who wears a life jacket while training on land and then discards it when he goes to sea.(16) If an assertion fails in production, you have a problem much worse than degradation in performance, so choose wisely.
Not all conditions should be enforced by assertions. User errors and runtime resource failures should be signaled by throwing exceptions, as we explained in detail in Chapter 1. It is tempting to use assertions for most error conditions while roughing out code, with the intent to replace many of them later with robust exception handling. Like any other temptation, use caution, since you might forget to make all the necessary changes later. Remember: assertions are intended to verify design decisions that will only fail because of faulty programmer logic. The ideal is to solve all assertion violations during development. Don't use assertions for conditions that aren't totally in your control (for example, conditions that depend on user input). In particular, you wouldn't want to use assertions to validate function arguments; throw a logic_error instead.
The use of assertions as a tool to ensure program correctness was formalized by Bertrand Meyer in his Design by Contract methodology.(17) Every function has an implicit contract with clients that, given certain preconditions, guarantees certain postconditions. In other words, the preconditions are the requirements for using the function, such as supplying arguments within certain ranges, and the postconditions are the results delivered by the function, either by return value or by side-effect.
When client programs fail to give you valid input, you must tell them they have broken the contract. This is not the best time to abort the program (although you're justified in doing so since the contract was violated), but an exception is certainly appropriate. This is why the Standard C++ library throws exceptions derived from logic_error, such as out_of_range.(18) If there are functions that only you call, however, such as private functions in a class of your own design, the assert( ) macro is appropriate, since you have total control over the situation and you certainly want to debug your code before shipping.
A postcondition failure indicates a program error, and it is appropriate to use assertions for any invariant at any time, including the postcondition test at the end of a function. This applies in particular to class member functions that maintain the state of an object. In the MyVector example earlier, for instance, a reasonable invariant for all public member functions would be:
assert(0
<=
nextSlot &&
nextSlot <=
capacity);
or, if nextSlot is an unsigned integer, simply
assert(nextSlot <=
capacity);
Such an invariant is called a class invariant and can reasonably be enforced by an assertion. Subclasses play the role of subcontractor to their base classes because they must maintain the original contract between the base class and its clients. For this reason, the preconditions in derived classes must impose no extra requirements beyond those in the base contract, and the postconditions must deliver at least as much.(19)
Validating results returned to the client, however, is nothing more or less than testing, so using post-condition assertions in this case would be duplicating work. Yes, it's good documentation, but more than one developer has been fooled into improperly using post-condition assertions as a substitute for unit testing.
1-2-2. A simple unit test framework▲
Writing software is all about meeting requirements.(20) Creating these requirements is difficult, and they can change from day to day; you might discover at a weekly project meeting that what you just spent the week doing is not exactly what the users really want.
People cannot articulate software requirements without sampling an evolving, working system. It's much better to specify a little, design a little, code a little, and test a little. Then, after evaluating the outcome, do it all over again. The ability to develop in such an iterative fashion is one of the great advances of the object-oriented approach, but it requires nimble programmers who can craft resilient code. Change is hard.
Another impetus for change comes from you, the programmer. The craftsperson in you wants to continually improve the design of your code. What maintenance programmer hasn't cursed the aging, flagship company product as a convoluted, unmodifiable patchwork of spaghetti? Management's reluctance to let you tamper with a functioning system robs code of the resilience it needs to endure. “If it's not broken, don't fix it” eventually gives way to, “We can't fix it—rewrite it.” Change is necessary.
Fortunately, our industry is growing accustomed to the discipline of refactoring, the art of internally restructuring code to improve its design, without changing its behavior.(21) Such improvements include extracting a new function from another, or inversely, combining member functions; replacing a member function with an object; parameterizing a member function or class; and replacing conditionals with polymorphism. Refactoring helps code evolve.
Whether the force for change comes from users or programmers, changes today may break what worked yesterday. We need a way to build code that withstands change and improves over time.
Extreme Programming (XP)(22) is only one of many practices that support a quick-on-your-feet motif. In this section we explore what we think is the key to making flexible, incremental development succeed: an easy-to-use automated unit test framework. (Note that testers, software professionals who test others' code for a living, are still indispensable. Here, we are merely describing a way to help developers write better code.)
Developers write unit tests to gain the confidence to say the two most important things that any developer can say:
- I understand the requirements.
- My code meets those requirements (to the best of my knowledge).
There is no better way to ensure that you know what the code you're about to write should do than to write the unit tests first. This simple exercise helps focus the mind on the task ahead and will likely lead to working code faster than just jumping into coding. Or, to express it in XP terms:
Testing + programming is faster than just programming.
Writing tests first also guards you against boundary conditions that might break your code, so your code is more robust.
When your code passes all your tests, you know that if the system isn't working, your code is probably not the problem. The statement “All my tests pass” is a powerful argument.
1-2-2-1. Automated testing▲
So what does a unit test look like? Too often developers just use some well-behaved input to produce some expected output, which they inspect visually. Two dangers exist in this approach. First, programs don't always receive only well-behaved input. We all know that we should test the boundaries of program input, but it's hard to think about this when you're trying to just get things working. If you write the test for a function first before you start coding, you can wear your “tester hat” and ask yourself, “What could possibly make this break?” Code a test that will prove the function you'll write isn't broken, and then put on your developer hat and make it happen. You'll write better code than if you hadn't written the test first.
The second danger is that inspecting output visually is tedious and error prone. Most any such thing a human can do a computer can do, but without human error. It's better to formulate tests as collections of Boolean expressions and have a test program report any failures.
For example, suppose you need to build a Date class that has the following properties:
- A date can be initialized with a string (YYYYMMDD), three integers (Y, M, D), or nothing (giving today's date).
- A date object can yield its year, month, and day or a string of the form “YYYYMMDD”.
- All relational comparisons are available, as well as computing the duration between two dates (in years, months, and days).
- Dates to be compared need to be able to span an arbitrary number of centuries (for example, 1600-2200).
Your class can store three integers representing the year, month, and day. (Just be sure the year is at least 16 bits in size to satisfy the last bulleted item.) The interface for your Date class might look like this:
//: C02:Date1.h
// A first pass at Date.h.
#ifndef DATE1_H
#define DATE1_H
#include
<string>
class
Date {
public
:
// A struct to hold elapsed time:
struct
Duration {
int
years;
int
months;
int
days;
Duration(int
y, int
m, int
d)
:
years(y), months(m), days(d) {}
}
;
Date();
Date(int
year, int
month, int
day);
Date(const
std::
string&
);
int
getYear() const
;
int
getMonth() const
;
int
getDay() const
;
std::
string toString() const
;
friend
bool
operator
<
(const
Date&
, const
Date&
);
friend
bool
operator
>
(const
Date&
, const
Date&
);
friend
bool
operator
<=
(const
Date&
, const
Date&
);
friend
bool
operator
>=
(const
Date&
, const
Date&
);
friend
bool
operator
==
(const
Date&
, const
Date&
);
friend
bool
operator
!=
(const
Date&
, const
Date&
);
friend
Duration duration(const
Date&
, const
Date&
);
}
;
#endif
// DATE1_H ///:~
Before you implement this class, you can solidify your grasp of the requirements by writing the beginnings of a test program. You might come up with something like the following:
//: C02:SimpleDateTest.cpp
//{L} Date
#include
<iostream>
#include
"Date.h"
// From Appendix B
using
namespace
std;
// Test machinery
int
nPass =
0
, nFail =
0
;
void
test(bool
t) {
if
(t) nPass++
; else
nFail++
; }
int
main() {
Date mybday(1951
, 10
, 1
);
test(mybday.getYear() ==
1951
);
test(mybday.getMonth() ==
10
);
test(mybday.getDay() ==
1
);
cout <<
"Passed: "
<<
nPass
<<
", Failed: "
<<
nFail <<
endl;
}
/* Expected output:
Passed: 3, Failed: 0
*/
///
:~
In this trivial case, the function test( ) maintains the global variables nPass and nFail. The only visual inspection you do is to read the final score. If a test failed, a more sophisticated test( ) displays an appropriate message. The framework described later in this chapter has such a test function, among other things.
You can now implement enough of the Date class to get these tests to pass, and then you can proceed iteratively until all the requirements are met. By writing tests first, you are more likely to think of corner cases that might break your upcoming implementation, and you're more likely to write the code correctly the first time. Such an exercise might produce the following version of a test for the Date class:
//: C02:SimpleDateTest2.cpp
//{L} Date
#include
<iostream>
#include
"Date.h"
using
namespace
std;
// Test machinery
int
nPass =
0
, nFail =
0
;
void
test(bool
t) {
if
(t) ++
nPass; else
++
nFail; }
int
main() {
Date mybday(1951
, 10
, 1
);
Date today;
Date
myevebday("19510930"
);
// Test the operators
test(mybday <
today);
test(mybday <=
today);
test(mybday !=
today);
test(mybday ==
mybday);
test(mybday >=
mybday);
test(mybday <=
mybday);
test(myevebday <
mybday);
test(mybday >
myevebday);
test(mybday >=
myevebday);
test(mybday !=
myevebday);
// Test the functions
test(mybday.getYear() ==
1951
);
test(mybday.getMonth() ==
10
);
test(mybday.getDay() ==
1
);
test(myevebday.getYear() ==
1951
);
test(myevebday.getMonth() ==
9
);
test(myevebday.getDay() ==
30
);
test(mybday.toString() ==
"19511001"
);
test(myevebday.toString() ==
"19510930"
);
// Test duration
Date d2(2003
, 7
, 4
);
Date::
Duration dur =
duration(mybday, d2);
test(dur.years ==
51
);
test(dur.months ==
9
);
test(dur.days ==
3
);
// Report results:
cout <<
"Passed: "
<<
nPass
<<
", Failed: "
<<
nFail <<
endl;
}
///
:~
This test can be more fully developed. For example, we haven't tested that long durations are handled correctly. We'll stop here, but you get the idea. The full implementation for the Date class is available in the files Date.h and Date.cpp in the appendix.(23)
1-2-2-2. The TestSuite Framework▲
Some automated C++ unit test tools are available on the World Wide Web for download, such as CppUnit.(24) Our purpose here is not only to present a test mechanism that is easy to use, but also easy to understand internally and even modify if necessary. So, in the spirit of “Do The Simplest Thing That Could Possibly Work,”(25) we have developed the TestSuite Framework, a namespace named TestSuite that contains two key classes: Test and Suite.
The Test class is an abstract base class from which you derive a test object. It keeps track of the number of passes and failures and displays the text of any test condition that fails. You simply to override the run( ) member function, which should in turn call the test_( ) macro for each Boolean test condition you define.
To define a test for the Date class using the framework, you can inherit from Test as shown in the following program:
//: C02:DateTest.h
#ifndef DATETEST_H
#define DATETEST_H
#include
"Date.h"
#include
"../TestSuite/Test.h"
class
DateTest : public
TestSuite::
Test {
Date mybday;
Date today;
Date myevebday;
public
:
DateTest(): mybday(1951
, 10
, 1
),
myevebday("19510930"
) {}
void
run() {
testOps();
testFunctions();
testDuration();
}
void
testOps() {
test_(mybday <
today);
test_(mybday <=
today);
test_(mybday !=
today);
test_(mybday ==
mybday);
test_(mybday >=
mybday);
test_(mybday <=
mybday);
test_(myevebday <
mybday);
test_(mybday >
myevebday);
test_(mybday >=
myevebday);
test_(mybday !=
myevebday);
}
void
testFunctions() {
test_(mybday.getYear() ==
1951
);
test_(mybday.getMonth() ==
10
);
test_(mybday.getDay() ==
1
);
test_(myevebday.getYear() ==
1951
);
test_(myevebday.getMonth() ==
9
);
test_(myevebday.getDay() ==
30
);
test_(mybday.toString() ==
"19511001"
);
test_(myevebday.toString() ==
"19510930"
);
}
void
testDuration() {
Date d2(2003
, 7
, 4
);
Date::
Duration dur =
duration(mybday, d2);
test_(dur.years ==
51
);
test_(dur.months ==
9
);
test_(dur.days ==
3
);
}
}
;
#endif
// DATETEST_H ///:~
Running the test is a simple matter of instantiating a DateTest object and calling its run( ) member function:
//: C02:DateTest.cpp
// Automated testing (with a framework).
//{L} Date ../TestSuite/Test
#include
<iostream>
#include
"DateTest.h"
using
namespace
std;
int
main() {
DateTest test;
test.run();
return
test.report();
}
/* Output:
Test "DateTest":
Passed: 21, Failed: 0
*/
///
:~
The Test::report( ) function displays the previous output and returns the number of failures, so it is suitable to use as a return value from main( ).
The Test class uses RTTI(26) to get the name of your class (for example, DateTest) for the report. There is also a setStream( ) member function if you want the test results sent to a file instead of to the standard output (the default). You'll see the Test class implementation later in this chapter.
The test_( ) macro can extract the text of the Boolean condition that fails, along with its file name and line number.(27) To see what happens when a failure occurs, you can introduce an intentional error in the code, for example by reversing the condition in the first call to test_( ) in DateTest::testOps( ) in the previous example code. The output indicates exactly what test was in error and where it happened:
DateTest failure: (mybday >
today) , DateTest.h
(line 31
)
Test "DateTest"
:
Passed
:
20
Failed: 1
In addition to test_( ), the framework includes the functions succeed_( ) and fail_( ), for cases where a Boolean test won't do. These functions apply when the class you're testing might throw exceptions. During testing, create an input set that will cause the exception to occur. If it doesn't, it's an error and you call fail_( ) explicitly to display a message and update the failure count. If it does throw the exception as expected, you call succeed_( ) to update the success count.
To illustrate, suppose we modify the specification of the two non-default Date constructors to throw a DateError exception (a type nested inside Date and derived from std::logic_error) if the input parameters do not represent a valid date:
Date(const
string&
s) throw
(DateError);
Date(int
year, int
month, int
day) throw
(DateError);
The DateTest::run( ) member function can now call the following function to test the exception handling:
void
testExceptions() {
try
{
Date d(0
,0
,0
); // Invalid
fail_("Invalid date undetected in Date int
ctor"
);
}
catch
(Date::
DateError&
) {
succeed_();
}
try
{
Date d(""
); // Invalid
fail_("Invalid date undetected in Date
string ctor"
);
}
catch
(Date::
DateError&
) {
succeed_();
}
}
In both cases, if an exception is not thrown, it is an error. Notice that you must manually pass a message to fail_( ), since no Boolean expression is being evaluated.
1-2-2-3. Test suites▲
Real projects usually contain many classes, so you need a way to group tests so that you can just push a single button to test the entire project.(28) The Suite class collects tests into a functional unit. You add Test objects to a Suite with the addTest( ) member function, or you can include an entire existing suite with addSuite( ). To illustrate, the following example collects the programs in Chapter 3 that use the Test class into a single suite. Note that this file will appear in the Chapter 3 subdirectory:
//: C03:StringSuite.cpp
//{L} ../TestSuite/Test
../
TestSuite/
Suite
//{L} TrimTest
// Illustrates a test suite
for
code from Chapter 3
#include
<iostream>
#include
"../TestSuite/Suite.h"
#include
"StringStorage.h"
#include
"Sieve.h"
#include
"Find.h"
#include
"Rparse.h"
#include
"TrimTest.h"
#include
"CompStr.h"
using
namespace
std;
using
namespace
TestSuite;
int
main() {
Suite suite("String
Tests"
);
suite.addTest(new
StringStorageTest);
suite.addTest(new
SieveTest);
suite.addTest(new
FindTest);
suite.addTest(new
RparseTest);
suite.addTest(new
TrimTest);
suite.addTest(new
CompStrTest);
suite.run();
long
nFail =
suite.report();
suite.free();
return
nFail;
}
/* Output:
s1 = 62345
s2 = 12345
Suite "String Tests"
====================
Test
"StringStorageTest":
Passed: 2 Failed: 0
Test "SieveTest":
Passed: 50 Failed: 0
Test "FindTest":
Passed: 9 Failed: 0
Test "RparseTest":
Passed: 8 Failed: 0
Test "TrimTest":
Passed: 11 Failed: 0
Test "CompStrTest":
Passed: 8 Failed: 0
*/
///
:~
Five of the above tests are completely contained in header files. TrimTest is not, because it contains static data that must be defined in an implementation file. The two first two output lines are trace lines from the StringStorage test. You must give the suite a name as a constructor argument. The Suite::run( ) member function calls Test::run( ) for each of its contained tests. Much the same thing happens for Suite::report( ), except that you can send the individual test reports to a different destination stream than that of the suite report. If the test passed to addSuite( ) already has a stream pointer assigned, it keeps it. Otherwise, it gets its stream from the Suite object. (As with Test, there is an optional second argument to the suite constructor that defaults to std::cout.) The destructor for Suite does not automatically delete the contained Test pointers because they don't need to reside on the heap; that's the job of Suite::free( ).
1-2-2-4. The test framework code▲
The test framework code is in a subdirectory called TestSuite in the code distribution available at www.MindView.net. To use it, include the search path for the TestSuite subdirectory in your header, link the object files, and include the TestSuite subdirectory in the library search path. Here is the header for Test.h:
//: TestSuite:Test.h
#ifndef TEST_H
#define TEST_H
#include
<string>
#include
<iostream>
#include
<cassert>
using
std::
string;
using
std::
ostream;
using
std::
cout;
// fail_() has an underscore to prevent collision with
// ios::fail(). For consistency, test_() and succeed_()
// also have underscores.
#define test_(cond) \
do_test(cond, #cond, __FILE__, __LINE__)
#define fail_(str) \
do_fail(str, __FILE__, __LINE__)
namespace
TestSuite {
class
Test {
ostream*
osptr;
long
nPass;
long
nFail;
// Disallowed:
Test(const
Test&
);
Test&
operator
=
(const
Test&
);
protected
:
void
do_test(bool
cond, const
string&
lbl,
const
char
*
fname, long
lineno);
void
do_fail(const
string&
lbl,
const
char
*
fname, long
lineno);
public
:
Test(ostream*
osptr =
&
cout) {
this
->
osptr =
osptr;
nPass =
nFail =
0
;
}
virtual
~
Test() {}
virtual
void
run() =
0
;
long
getNumPassed() const
{
return
nPass; }
long
getNumFailed() const
{
return
nFail; }
const
ostream*
getStream() const
{
return
osptr; }
void
setStream(ostream*
osptr) {
this
->
osptr =
osptr; }
void
succeed_() {
++
nPass; }
long
report() const
;
virtual
void
reset() {
nPass =
nFail =
0
; }
}
;
}
// namespace TestSuite
#endif
// TEST_H ///:~
There are three virtual functions in the Test class:
- A virtual destructor
- The function reset( )
- The pure virtual function run( )
As explained in Volume 1, it is an error to delete a derived heap object through a base pointer unless the base class has a virtual destructor. Any class intended to be a base class (usually evidenced by the presence of at least one other virtual function) should have a virtual destructor. The default implementation of the Test::reset( ) resets the success and failure counters to zero. You might want to override this function to reset the state of the data in your derived test object; just be sure to call Test::reset( ) explicitly in your override so that the counters are reset. The Test::run( ) member function is pure virtual since you are required to override it in your derived class.
The test_( ) and fail_( ) macros can include file name and line number information available from the preprocessor. We originally omitted the trailing underscores in the names, but the fail( ) macro then collided with ios::fail( ), causing compiler errors.
Here is the implementation of the remainder of the Test functions:
//: TestSuite:Test.cpp {O}
#include
"Test.h"
#include
<iostream>
#include
<typeinfo>
using
namespace
std;
using
namespace
TestSuite;
void
Test::
do_test(bool
cond, const
std::
string&
lbl,
const
char
*
fname, long
lineno) {
if
(!
cond)
do_fail(lbl, fname, lineno);
else
succeed_();
}
void
Test::
do_fail(const
std::
string&
lbl,
const
char
*
fname, long
lineno) {
++
nFail;
if
(osptr) {
*
osptr <<
typeid
(*
this
).name()
<<
"failure: ("
<<
lbl
<<
") , "
<<
fname
<<
" (line "
<<
lineno
<<
")"
<<
endl;
}
}
long
Test::
report() const
{
if
(osptr) {
*
osptr <<
"Test
\"
"
<<
typeid
(*
this
).name()
<<
"
\"
:
\n\t
Passed: "
<<
nPass
<<
"
\t
Failed: "
<<
nFail
<<
endl;
}
return
nFail;
}
///
:~
The Test class keeps track of the number of successes and failures as well as the stream where you want Test::report( ) to display the results. The test_( ) and fail_( ) macros extract the current file name and line number information from the preprocessor and pass the file name to do_test( ) and the line number to do_fail( ), which do the actual work of displaying a message and updating the appropriate counter. We can't think of a good reason to allow copy and assignment of test objects, so we have disallowed these operations by making their prototypes private and omitting their respective function bodies.
Here is the header file for Suite:
//: TestSuite:Suite.h
#ifndef SUITE_H
#define SUITE_H
#include
<vector>
#include
<stdexcept>
#include
"../TestSuite/Test.h"
using
std::
vector;
using
std::
logic_error;
namespace
TestSuite {
class
TestSuiteError : public
logic_error {
public
:
TestSuiteError(const
string&
s =
""
)
:
logic_error(s) {}
}
;
class
Suite {
string name;
ostream*
osptr;
vector<
Test*>
tests;
void
reset();
// Disallowed ops:
Suite(const
Suite&
);
Suite&
operator
=
(const
Suite&
);
public
:
Suite(const
string&
name, ostream*
osptr =
&
cout)
:
name(name) {
this
->
osptr =
osptr; }
string getName() const
{
return
name; }
long
getNumPassed() const
;
long
getNumFailed() const
;
const
ostream*
getStream() const
{
return
osptr; }
void
setStream(ostream*
osptr) {
this
->
osptr =
osptr; }
void
addTest(Test*
t) throw
(TestSuiteError);
void
addSuite(const
Suite&
);
void
run(); // Calls Test::run() repeatedly
long
report() const
;
void
free(); // Deletes tests
}
;
}
// namespace TestSuite
#endif
// SUITE_H ///:~
The Suite class holds pointers to its Test objects in a vector. Notice the exception specification on the addTest( ) member function. When you add a test to a suite, Suite::addTest( ) verifies that the pointer you pass is not null; if it is null, it throws a TestSuiteError exception. Since this makes it impossible to add a null pointer to a suite, addSuite( ) asserts this condition on each of its tests, as do the other functions that traverse the vector of tests (see the following implementation). Copy and assignment are disallowed as they are in the Test class.
//: TestSuite:Suite.cpp {O}
#include
"Suite.h"
#include
<iostream>
#include
<cassert>
#include
<cstddef>
using
namespace
std;
using
namespace
TestSuite;
void
Suite::
addTest(Test*
t) throw
(TestSuiteError) {
// Verify test is valid and has a stream:
if
(t ==
0
)
throw
TestSuiteError("Null test in
Suite::addTest"
);
else
if
(osptr &&
!
t->
getStream())
t->
setStream(osptr);
tests.push_back(t);
t->
reset();
}
void
Suite::
addSuite(const
Suite&
s) {
for
(size_t i =
0
; i <
s.tests.size(); ++
i) {
assert(tests[i]);
addTest(s.tests[i]);
}
}
void
Suite::
free() {
for
(size_t i =
0
; i <
tests.size(); ++
i) {
delete
tests[i];
tests[i] =
0
;
}
}
void
Suite::
run() {
reset();
for
(size_t i =
0
; i <
tests.size(); ++
i) {
assert(tests[i]);
tests[i]->
run();
}
}
long
Suite::
report() const
{
if
(osptr) {
long
totFail =
0
;
*
osptr <<
"Suite
\"
"
<<
name
<<
"
\"\n
======="
;
size_t i;
for
(i =
0
; i <
name.size(); ++
i)
*
osptr <<
'='
;
*
osptr <<
"="
<<
endl;
for
(i =
0
; i <
tests.size(); ++
i) {
assert(tests[i]);
totFail +=
tests[i]->
report();
}
*
osptr <<
"======="
;
for
(i =
0
; i <
name.size(); ++
i)
*
osptr <<
'='
;
*
osptr <<
"="
<<
endl;
return
totFail;
}
else
return
getNumFailed();
}
long
Suite::
getNumPassed() const
{
long
totPass =
0
;
for
(size_t i =
0
; i <
tests.size(); ++
i) {
assert(tests[i]);
totPass +=
tests[i]->
getNumPassed();
}
return
totPass;
}
long
Suite::
getNumFailed() const
{
long
totFail =
0
;
for
(size_t i =
0
; i <
tests.size(); ++
i) {
assert(tests[i]);
totFail +=
tests[i]->
getNumFailed();
}
return
totFail;
}
void
Suite::
reset() {
for
(size_t i =
0
; i <
tests.size(); ++
i) {
assert(tests[i]);
tests[i]->
reset();
}
}
///
:~
We will be using the TestSuite framework wherever it applies throughout the rest of this book.
1-2-3. Debugging techniques▲
The best debugging habit is to use assertions as explained in the beginning of this chapter; by doing so you'll help find logic errors before they cause real trouble. This section contains some other tips and techniques that might help during debugging.
1-2-3-1. Trace macros▲
Sometimes it's useful to print the code of each statement as it is executed, either to cout or to a trace file. Here's a preprocessor macro to accomplish this:
#define TRACE(ARG) cout << #ARG << endl; ARG
Now you can go through and surround the statements you trace with this macro. However, this can introduce problems. For example, if you take the statement:
for
(int
i =
0
; i <
100
; i++
)
cout <<
i <<
endl;
and put both lines inside TRACE( ) macros, you get this:
TRACE(for
(int
i =
0
; i <
100
; i++
))
TRACE( cout <<
i <<
endl;)
which expands to this:
cout <<
"for(int i = 0; i < 100;
i++)"
<<
endl;
for
(int
i =
0
; i <
100
; i++
)
cout <<
"cout << i <<
endl;"
<<
endl;
cout <<
i <<
endl;
which isn't exactly what you want. Thus, you must use this technique carefully.
The following is a variation on the TRACE( ) macro:
#define D(a) cout << #a
"=["
<< a <<
"]"
<<
endl;
If you want to display an expression, you simply put it inside a call to D( ). The expression is displayed, followed by its value (assuming there's an overloaded operator << for the result type). For example, you can say D(a + b). You can use this macro any time you want to check an intermediate value.
These two macros represent the two most fundamental things you do with a debugger: trace through the code execution and display values. A good debugger is an excellent productivity tool, but sometimes debuggers are not available, or it's not convenient to use them. These techniques always work, regardless of the situation.
1-2-3-2. Trace file▲
DISCLAIMER: This section and the next contain code which is officially unsanctioned by the C++ Standard. In particular, we redefine cout and new via macros, which can cause surprising results if you're not careful. Our examples work on all the compilers we use, however, and provide useful information. This is the only place in this book where we will depart from the sanctity of standard-compliant coding practice. Use at your own risk! Note that in order for this to work, a using-declaration must be used, so that cout isn't prefixed by its namespace, i.e. std::cout will not work.
The following code easily creates a trace file and sends all the output that would normally go to cout into that file. All you must do is #define TRACEON and include the header file (of course, it's fairly easy just to write the two key lines right into your file):
//: C03:Trace.h
// Creating a trace file.
#ifndef TRACE_H
#define TRACE_H
#include
<fstream>
#ifdef TRACEON
std::
ofstream TRACEFILE__("TRACE.OUT"
);
#define cout TRACEFILE__
#endif
#endif
// TRACE_H ///:~
Here's a simple test of the previous file:
//: C03:Tracetst.cpp {-bor}
#include
<iostream>
#include
<fstream>
#include
"../require.h"
using
namespace
std;
#define TRACEON
#include
"Trace.h"
int
main() {
ifstream
f("Tracetst.cpp"
);
assure(f, "Tracetst.cpp"
);
cout <<
f.rdbuf(); // Dumps file contents to
file
}
///
:~
Because cout has been textually turned into something else by Trace.h, all the cout statements in your program now send information to the trace file. This is a convenient way of capturing your output into a file, in case your operating system doesn't make output redirection easy.
1-2-3-3. Finding memory leaks▲
The following straightforward debugging techniques are explained in Volume 1:
1. For array bounds checking, use the Array template in C16:Array3.cpp of Volume 1 for all arrays. You can turn off the checking and increase efficiency when you're ready to ship. (Although this doesn't deal with the case of taking a pointer to an array.)
2. Check for non-virtual destructors in base classes.
Tracking new/delete and malloc/free
Common problems with memory allocation include mistakenly calling delete for memory that's not on the free store, deleting the free store more than once, and, most often, forgetting to delete a pointer. This section discusses a system that can help you track down these kinds of problems.
As an additional disclaimer beyond that of the preceding section: because of the way we overload new, the following technique may not work on all platforms, and will only work for programs that do not call the function operator new( ) explicitly. We have been quite careful in this book to only present code that fully conforms to the C++ Standard, but in this one instance we're making an exception for the following reasons:
1. Even though it's technically illegal, it works on many compilers.(29)
2. We illustrate some useful thinking along the way.
To use the memory checking system, you simply include the header file MemCheck.h, link the MemCheck.obj file into your application to intercept all the calls to new and delete, and call the macro MEM_ON( ) (explained later in this section) to initiate memory tracing. A trace of all allocations and deallocations is printed to the standard output (via stdout). When you use this system, all calls to new store information about the file and line where they were called. This is accomplished by using the placement syntax for operator new.(30) Although you typically use the placement syntax when you need to place objects at a specific point in memory, it can also create an operator new( ) with any number of arguments. This is used in the following example to store the results of the __FILE__ and __LINE__ macros whenever new is called:
//: C02:MemCheck.h
#ifndef MEMCHECK_H
#define MEMCHECK_H
#include
<cstddef>
// For size_t
// Usurp the new operator (both scalar and array
versions)
void
*
operator
new
(std::
size_t, const
char
*
, long
);
void
*
operator
new
[](std::
size_t, const
char
*
, long
);
#define new new (__FILE__, __LINE__)
extern
bool
traceFlag;
#define TRACE_ON() traceFlag = true
#define TRACE_OFF() traceFlag = false
extern
bool
activeFlag;
#define MEM_ON() activeFlag = true
#define MEM_OFF() activeFlag = false
#endif
// MEMCHECK_H ///:~
It is important to include this file in any source file in which you want to track free store activity, but include it last (after your other #include directives). Most headers in the standard library are templates, and since most compilers use the inclusion model of template compilation (meaning all source code is in the headers), the macro that replaces new in MemCheck.h would usurp all instances of the new operator in the library source code (and would likely result in compile errors). Besides, you are only interested in tracking your own memory errors, not the library's.
In the following file, which contains the memory tracking implementation, everything is done with C standard I/O rather than with C++ iostreams. It shouldn't make a difference, since we're not interfering with iostreams' use of the free store, but when we tried it, some compilers complained. All compilers were happy with the <cstdio> version.
//: C02:MemCheck.cpp {O}
#include
<cstdio>
#include
<cstdlib>
#include
<cassert>
#include
<cstddef>
using
namespace
std;
#undef new
// Global flags set by macros in MemCheck.h
bool
traceFlag =
true
;
bool
activeFlag =
false
;
namespace
{
// Memory map entry type
struct
Info {
void
*
ptr;
const
char
*
file;
long
line;
}
;
// Memory map data
const
size_t MAXPTRS =
10000
u;
Info memMap[MAXPTRS];
size_t nptrs =
0
;
// Searches the map for an address
int
findPtr(void
*
p) {
for
(size_t i =
0
; i <
nptrs; ++
i)
if
(memMap[i].ptr ==
p)
return
i;
return
-
1
;
}
void
delPtr(void
*
p) {
int
pos =
findPtr(p);
assert(pos >=
0
);
// Remove pointer from map
for
(size_t i =
pos; i <
nptrs-
1
; ++
i)
memMap[i] =
memMap[i+
1
];
--
nptrs;
}
// Dummy type for static destructor
struct
Sentinel {
~
Sentinel() {
if
(nptrs >
0
) {
printf("Leaked memory at:
\n
"
);
for
(size_t i =
0
; i <
nptrs; ++
i)
printf("
\t
%p (file: %s, line %ld)
\n
"
,
memMap[i].ptr, memMap[i].file,
memMap[i].line);
}
else
printf("No user memory leaks!
\n
"
);
}
}
;
// Static dummy object
Sentinel s;
}
// End anonymous namespace
// Overload scalar new
void
*
operator
new
(size_t siz, const
char
*
file, long
line) {
void
*
p =
malloc(siz);
if
(activeFlag) {
if
(nptrs ==
MAXPTRS) {
printf("memory map too small (increase
MAXPTRS)\n"
);
exit(1
);
}
memMap[nptrs].ptr =
p;
memMap[nptrs].file =
file;
memMap[nptrs].line =
line;
++
nptrs;
}
if
(traceFlag) {
printf("Allocated %u bytes at address %p
"
, siz, p);
printf("(file: %s, line: %ld)
\n
"
, file,
line);
}
return
p;
}
// Overload array new
void
*
operator
new
[](size_t siz, const
char
*
file, long
line) {
return
operator
new
(siz, file, line);
}
// Override scalar delete
void
operator
delete
(void
*
p) {
if
(findPtr(p) >=
0
) {
free(p);
assert(nptrs >
0
);
delPtr(p);
if
(traceFlag)
printf("Deleted memory at address
%p\n"
, p);
}
else
if
(!
p &&
activeFlag)
printf("Attempt to delete unknown pointer:
%p\n"
, p);
}
// Override array delete
void
operator
delete
[](void
*
p) {
operator
delete
(p);
}
///
:~
The Boolean flags traceFlag and activeFlag are global, so they can be modified in your code by the macros TRACE_ON( ), TRACE_OFF( ), MEM_ON( ), and MEM_OFF( ). In general, enclose all the code in your main( ) within a MEM_ON( )-MEM_OFF( ) pair so that memory is always tracked. Tracing, which echoes the activity of the replacement functions for operator new( ) and operator delete( ), is on by default, but you can turn it off with TRACE_OFF( ). In any case, the final results are always printed (see the test runs later in this chapter).
The MemCheck facility tracks memory by keeping all addresses allocated by operator new( ) in an array of Info structures, which also holds the file name and line number where the call to new occurred. To prevent collision with any names you have placed in the global namespace, as much information as possible is kept inside the anonymous namespace. The Sentinel class exists solely to call a static object destructor as the program shuts down. This destructor inspects memMap to see if any pointers are waiting to be deleted (indicating a memory leak).
Our operator new( ) uses malloc( ) to get memory, and then adds the pointer and its associated file information to memMap. The operator delete( ) function undoes all that work by calling free( ) and decrementing nptrs, but first it checks to see if the pointer in question is in the map in the first place. If it isn't, either you're trying to delete an address that isn't on the free store, or you're trying to delete one that's already been deleted and removed from the map. The activeFlag variable is important here because we don't want to process any deallocations from any system shutdown activity. By calling MEM_OFF( ) at the end of your code, activeFlag will be set to false, and such subsequent calls to delete will be ignored. (That's bad in a real program, but our purpose here is to find your leaks; we're not debugging the library.) For simplicity, we forward all work for array new and delete to their scalar counterparts.
The following is a simple test using the MemCheck facility:
//: C02:MemTest.cpp
//{L} MemCheck
// Test of MemCheck system.
#include
<iostream>
#include
<vector>
#include
<cstring>
#include
"MemCheck.h"
// Must appear last!
using
namespace
std;
class
Foo {
char
*
s;
public
:
Foo(const
char
*
s ) {
this
->
s =
new
char
[strlen(s) +
1
];
strcpy(this
->
s, s);
}
~
Foo() {
delete
[] s; }
}
;
int
main() {
MEM_ON();
cout <<
"hello"
<<
endl;
int
*
p =
new
int
;
delete
p;
int
*
q =
new
int
[3
];
delete
[] q;
int
*
r;
delete
r;
vector<
int
>
v;
v.push_back(1
);
Foo s("goodbye"
);
MEM_OFF();
}
///
:~
This example verifies that you can use MemCheck in the presence of streams, standard containers, and classes that allocate memory in constructors. The pointers p and q are allocated and deallocated without any problem, but r is not a valid heap pointer, so the output indicates the error as an attempt to delete an unknown pointer:
hello
Allocated 4
bytes at address 0xa010778
(file:
memtest.cpp, line: 25
)
Deleted memory at address 0xa010778
Allocated 12
bytes at address 0xa010778
(file:
memtest.cpp, line: 27
)
Deleted memory at address 0xa010778
Attempt to delete
unknown pointer: 0x1
Allocated 8
bytes at address 0xa0108c0
(file:
memtest.cpp, line: 14
)
Deleted memory at address 0xa0108c0
No user memory leaks!
Because of the call to MEM_OFF( ), no subsequent calls to operator delete( ) by vector or ostream are processed. You still might get some calls to delete from reallocations performed by the containers.
If you call TRACE_OFF( ) at the beginning of the program, the output is
hello
Attempt to delete
unknown pointer: 0x1
No user memory leaks!
1-2-4. Summary▲
Much of the headache of software engineering can be avoided by being deliberate about what you're doing. You've probably been using mental assertions as you've crafted your loops and functions, even if you haven't routinely used the assert( ) macro. If you'll use assert( ), you'll find logic errors sooner and end up with more readable code as well. Remember to only use assertions for invariants, though, and not for runtime error handling.
Nothing will give you more peace of mind than thoroughly tested code. If it's been a hassle for you in the past, use an automated framework, such as the one we've presented here, to integrate routine testing into your daily work. You (and your users!) will be glad you did.
1-2-5. Exercises▲
Solutions to selected exercises can be found in the electronic document The Thinking in C++ Volume 2 Annotated Solution Guide, available for a small fee from www.MindView.net.
- Write a test program using the TestSuite Framework for the standard vector class that thoroughly tests the following member functions with a vector of integers: push_back( ) (appends an element to the end of the vector), front( ) (returns the first element in the vector), back( ) (returns the last element in the vector), pop_back( ) (removes the last element without returning it), at( ) (returns the element in a specified index position), and size( ) (returns the number of elements). Be sure to verify that vector::at( ) throws a std::out_of_range exception if the supplied index is out of range.
- Suppose you are asked to develop a class named Rational
that supports rational numbers (fractions). The fraction in a Rational
object should always be stored in lowest terms, and a denominator of zero is an
error. Here is a sample interface for such a Rational class:
Sélectionnez
//: C02:Rational.h {-xo}
#ifndef RATIONAL_H
#define RATIONAL_H
#include
<iosfwd>
class
Rational{
public
:
Rational(int
numerator=
0
,int
denominator=
1
); Rationaloperator
-
()const
;friend
Rationaloperator
+
(const
Rational&
,const
Rational&
);friend
Rationaloperator
-
(const
Rational&
,const
Rational&
);friend
Rationaloperator
*
(const
Rational&
,const
Rational&
);friend
Rationaloperator
/
(const
Rational&
,const
Rational&
);friend
std::
ostream&
operator
<<
(std::
ostream&
,const
Rational&
);friend
std::
istream&
operator
>>
(std::
istream&
, Rational&
); Rational&
operator
+=
(const
Rational&
); Rational&
operator
-=
(const
Rational&
); Rational&
operator
*=
(const
Rational&
); Rational&
operator
/=
(const
Rational&
);friend
bool
operator
<
(const
Rational&
,const
Rational&
);friend
bool
operator
>
(const
Rational&
,const
Rational&
);friend
bool
operator
<=
(const
Rational&
,const
Rational&
);friend
bool
operator
>=
(const
Rational&
,const
Rational&
);friend
bool
operator
==
(const
Rational&
,const
Rational&
);friend
bool
operator
!=
(const
Rational&
,const
Rational&
);}
;#endif
// RATIONAL_H ///:~
Write a complete specification for this class, including preconditions, postconditions, and exception specifications.
- Write a test using the TestSuite framework that thoroughly tests all the specifications from the previous exercise, including testing exceptions.
- Implement the Rational class so that all the tests from the previous exercise pass. Use assertions only for invariants.
- The file BuggedSearch.cpp below contains a binary search
function that searches the range [beg, end) for what. There are
some bugs in the algorithm. Use the trace techniques from this chapter to debug
the search function.
Sélectionnez
//: C02:BuggedSearch.cpp {-xo}
//{L} ../TestSuite/Test
#include
<cstdlib>
#include
<ctime>
#include
<cassert>
#include
<fstream>
#include
"../TestSuite/Test.h"
using
namespace
std;// This function is only one with bugs
int
*
binarySearch(int
*
beg,int
*
end,int
what){
while
(end-
beg!=
1
){
if
(*
beg==
what)return
beg;int
mid=
(end-
beg)/
2
;if
(what<=
beg[mid]) end=
beg+
mid;else
beg=
beg+
mid;}
return
0
;}
class
BinarySearchTest :public
TestSuite::
Test{
enum
{
SZ=
10
}
;int
*
data;int
max;// Track largest number
int
current;// Current non-contained number
// Used in notContained()
// Find the next number not contained in the array
int
notContained(){
while
(data[current]+
1
==
data[current+
1
])++
current;if
(current>=
SZ)return
max+
1
;int
retValue=
data[current++
]+
1
;return
retValue;}
void
setData(){
data=
new
int
[SZ]; assert(!
max);// Input values with increments of one. Leave
// out some values on both odd and even indexes.
for
(int
i=
0
; i<
SZ; rand()%
2
==
0
? max+=
1
: max+=
2
) data[i++
]=
max;}
void
testInBound(){
// Test locations both odd and even
// not contained and contained
for
(int
i=
SZ;--
i>=
0
;) test_(binarySearch(data, data+
SZ, data[i]));for
(int
i=
notContained(); i<
max; i=
notContained()) test_(!
binarySearch(data, data+
SZ, i));}
void
testOutBounds(){
// Test lower values
for
(int
i=
data[0
];--
i>
data[0
]-
100
;) test_(!
binarySearch(data, data+
SZ, i));// Test higher values
for
(int
i=
data[SZ-
1
];++
i<
data[SZ-
1
]+
100
;) test_(!
binarySearch(data, data+
SZ, i));}
public
:
BinarySearchTest(){
max=
current=
0
;}
void
run(){
setData(); testInBound(); testOutBounds();delete
[] data;}
}
;int
main(){
srand(time(0
)); BinarySearchTest t; t.run();return
t.report();}
///
:~