aboutsummaryrefslogtreecommitdiffstats
path: root/lib/percept/test/ipc_tree.erl
diff options
context:
space:
mode:
authorErlang/OTP <[email protected]>2009-11-20 14:54:40 +0000
committerErlang/OTP <[email protected]>2009-11-20 14:54:40 +0000
commit84adefa331c4159d432d22840663c38f155cd4c1 (patch)
treebff9a9c66adda4df2106dfd0e5c053ab182a12bd /lib/percept/test/ipc_tree.erl
downloadotp-84adefa331c4159d432d22840663c38f155cd4c1.tar.gz
otp-84adefa331c4159d432d22840663c38f155cd4c1.tar.bz2
otp-84adefa331c4159d432d22840663c38f155cd4c1.zip
The R13B03 release.OTP_R13B03
Diffstat (limited to 'lib/percept/test/ipc_tree.erl')
-rw-r--r--lib/percept/test/ipc_tree.erl48
1 files changed, 48 insertions, 0 deletions
diff --git a/lib/percept/test/ipc_tree.erl b/lib/percept/test/ipc_tree.erl
new file mode 100644
index 0000000000..f7639eed1b
--- /dev/null
+++ b/lib/percept/test/ipc_tree.erl
@@ -0,0 +1,48 @@
+%% ``The contents of this file are subject to the Erlang Public License,
+%% Version 1.1, (the "License"); you may not use this file except in
+%% compliance with the License. You should have received a copy of the
+%% Erlang Public License along with this software. If not, it can be
+%% retrieved via the world wide web at http://www.erlang.org/.
+%%
+%% Software distributed under the License is distributed on an "AS IS"
+%% basis, WITHOUT WARRANTY OF ANY KIND, either express or implied. See
+%% the License for the specific language governing rights and limitations
+%% under the License.
+%%
+%% The Initial Developer of the Original Code is Ericsson Utvecklings AB.
+%% Portions created by Ericsson are Copyright 1999, Ericsson Utvecklings
+%% AB. All Rights Reserved.''
+%%
+%% $Id$
+%%
+
+-module(ipc_tree).
+-export([go/1, init/2]).
+
+go(N) ->
+ start(N, self()),
+ receive stop -> ok end.
+
+start(Depth, ParentPid) ->
+ spawn(?MODULE, init, [Depth, ParentPid]).
+
+init(0, ParentPid) ->
+ workload(5000),
+ ParentPid ! stop,
+ ok;
+init(Depth, ParentPid) ->
+ Pid1 = spawn(?MODULE, init, [Depth - 1, self()]),
+ Pid2 = spawn(?MODULE, init, [Depth - 1, self()]),
+ main([Pid1,Pid2], ParentPid).
+
+main(Pids, ParentPid) ->
+ workload(5000),
+ gather(Pids),
+ ParentPid ! stop,
+ ok.
+
+gather([]) -> ok;
+gather([_|Pids]) -> receive _ -> gather(Pids) end.
+
+workload(0) -> ok;
+workload(N) -> math:sin(2), workload(N - 1).