* gdb.base/multi-forks.exp: Doc fix.
This commit is contained in:
parent
fb5f3683c3
commit
aad9a19303
|
@ -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>
|
2007-12-26 Joel Brobecker <brobecker@adacore.com>
|
||||||
|
|
||||||
* gdb.ada/Makefile.in (EXECUTABLES): Update list.
|
* gdb.ada/Makefile.in (EXECUTABLES): Update list.
|
||||||
|
|
|
@ -53,9 +53,14 @@ global gdb_prompt
|
||||||
# parent and child of multiple Unix fork() system calls.
|
# parent and child of multiple Unix fork() system calls.
|
||||||
#
|
#
|
||||||
|
|
||||||
# Inferior program calls fork 4 times. Since each fork
|
# The inferior program builds a tree of processes by executing a loop
|
||||||
# calls fork 4 times, there will be 16 forks. Each fork
|
# four times, calling fork at each iteration. Thus, at each
|
||||||
# saves the return values of its own 4 fork calls.
|
# 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.
|
# First set gdb to follow the child.
|
||||||
# The result should be that each of the 4 forks returns zero.
|
# The result should be that each of the 4 forks returns zero.
|
||||||
|
|
Loading…
Reference in New Issue