* gdb.base/multi-forks.exp: Doc fix.

diff --git a/gdb/testsuite/ChangeLog b/gdb/testsuite/ChangeLog
index 8f561e4..a214ec1 100644 (file)
--- a/gdb/testsuite/ChangeLog
+++ b/gdb/testsuite/ChangeLog
@@ -1,3 +1,7 @@
+2007-12-26  Jim Blandy  <jimb@codesourcery.com>
+
+       * gdb.base/multi-forks.exp: Doc fix.
+
 2007-12-26  Joel Brobecker  <brobecker@adacore.com>
 
        * gdb.ada/Makefile.in (EXECUTABLES): Update list.

diff --git a/gdb/testsuite/gdb.base/multi-forks.exp b/gdb/testsuite/gdb.base/multi-forks.exp
index 7161be5..b607d43 100644 (file)
--- a/gdb/testsuite/gdb.base/multi-forks.exp
+++ b/gdb/testsuite/gdb.base/multi-forks.exp
@@ -53,9 +53,14 @@ global gdb_prompt
 # parent and child of multiple Unix fork() system calls.
 #
 
-# Inferior program calls fork 4 times.  Since each fork
-# calls fork 4 times, there will be 16 forks.  Each fork
-# saves the return values of its own 4 fork calls.
+# The inferior program builds a tree of processes by executing a loop
+# four times, calling fork at each iteration.  Thus, at each
+# iteration, the total number of processes doubles; after four
+# iterations, we have 16 processes.  Each process saves the results
+# from its 'fork' calls, so we can tell which leaf a given process is
+# by looking at which forks returned zero and which returned a pid: a
+# zero means to take the child's branch; a pid means to take the
+# parent's branch.
 
 # First set gdb to follow the child.
 # The result should be that each of the 4 forks returns zero.