aboutsummaryrefslogtreecommitdiff
path: root/test/test_threads_ex.lua
diff options
context:
space:
mode:
authorAlexey Melnichuk <mimir@newmail.ru>2014-06-23 09:40:01 +0500
committerAlexey Melnichuk <mimir@newmail.ru>2014-06-23 09:40:01 +0500
commitf0a6754cd15912de529b9662e3e08bfaadd6bf1e (patch)
tree49da84a4d154dfd4771093cfd9aaacc47036ca78 /test/test_threads_ex.lua
parented9ed9a1c794c0d49f83cb00a557ae6085bf47e4 (diff)
downloadlua-llthreads2-f0a6754cd15912de529b9662e3e08bfaadd6bf1e.tar.gz
lua-llthreads2-f0a6754cd15912de529b9662e3e08bfaadd6bf1e.tar.bz2
lua-llthreads2-f0a6754cd15912de529b9662e3e08bfaadd6bf1e.zip
Add. `llthreads2.ex` module.
Diffstat (limited to 'test/test_threads_ex.lua')
-rw-r--r--test/test_threads_ex.lua64
1 files changed, 64 insertions, 0 deletions
diff --git a/test/test_threads_ex.lua b/test/test_threads_ex.lua
new file mode 100644
index 0000000..3a6cc41
--- /dev/null
+++ b/test/test_threads_ex.lua
@@ -0,0 +1,64 @@
1-- Copyright (c) 2011 by Ross Anderson <ross_j_anderson@yahoo.com>
2--
3-- Permission is hereby granted, free of charge, to any person obtaining a copy
4-- of this software and associated documentation files (the "Software"), to deal
5-- in the Software without restriction, including without limitation the rights
6-- to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
7-- copies of the Software, and to permit persons to whom the Software is
8-- furnished to do so, subject to the following conditions:
9--
10-- The above copyright notice and this permission notice shall be included in
11-- all copies or substantial portions of the Software.
12--
13-- THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
14-- IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
15-- FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
16-- AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
17-- LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
18-- OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
19-- THE SOFTWARE.
20
21-- Sub-thread processing example in Lua using llthreads - 1,000 quick sub-thread execution
22
23-- luajit sub_threads.lua
24
25-- level 0 string literal enclosure [[ ]] of child execution code
26local thread_code = function(num_threads, ...)
27 print("CHILD: received from ROOT params:", num_threads, ...)
28 local llthreads = require"llthreads.ex" -- need to re-declare this under this scope
29 local t = {} -- thread storage table
30
31 -- create a new child sub-thread execution code - it requires level 1 literal string [=[ ]=] enclosures, level 2 would be [==[ ]==]
32 local executed_child_code = function(...)
33 return "Hello from child sub-thread, new input params:", ...
34 end
35
36 -- create 1000 sub-threads - which creates an incremental 30% / 20% utilization spike on the two AMD cpu cores
37 print("CHILD: Create sub threads:", num_threads)
38 for i=1,num_threads do
39 -- create child sub-thread with code to execute and the input parmeters
40 local thread = llthreads.new(executed_child_code , "number:", 1000 + i, "nil:", nil, "bool:", true)
41 assert(thread:start()) -- start new child sub-thread
42 table.insert(t, thread) -- append the thread at the end of the thread table
43 end
44
45 -- wait (block) for all child sub-threads to complete before returning to ROOT
46 while true do
47 -- always wait on the first element, since order is not important
48 print("CHILD: sub-thread returned: ", t[1]:join())
49 table.remove(t,1) -- always remove the first element
50 if (#t == 0) then break end
51 end
52 return ... -- return the parents' input params back to the root
53end
54
55local llthreads = require"llthreads.ex"
56
57local num_threads = tonumber(arg[1] or 1000)
58
59-- create child thread.
60local thread = llthreads.new(thread_code, num_threads, "number:", 1000, "nil:", nil, "bool:", true)
61-- start joinable child thread.
62assert(thread:start())
63-- wait for all child and child sub-threads to finish
64print("ROOT: child returned: ", thread:join())