1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
|
# bt-semaphore
A simple semaphore class for bordeaux-threads inspired by SBCL's semaphore.
## Installation
`bt-semaphore` is available via [Quicklisp](http://www.quicklisp.org/beta/). You
can also clone the Git repo if you prefer to use bleeding edge:
```
cd ~/quicklisp/local-projects
git clone https://github.com/rmoritz/bt-semaphore
```
## Usage
There are seven functions of interest at the moment:
- `make-semaphore` creates a semaphore instance
- `wait-on-semaphore` blocks until the semaphore can be decremented (ie. its
count > 0) or the timeout has expired
- `signal-semaphore` increments the semaphore & wakes n waiting threads
- `try-semaphore` decrements the semaphore without blocking
- `semaphore-count` returns the current count of the semaphore
- `semaphore-waiters` returns the number of threads waiting on semaphore
- `semaphore-name` is an accessor for the semaphore's name slot
To illustrate, here's a tiny example:
```common-lisp
(ql:quickload :bt-semaphore)
(defun semaphore-demo ()
(defparameter sem (bt-sem:make-semaphore))
(defparameter lock (bt:make-lock))
(defparameter num 0)
(format t "spawn 20 threads with 4s timeout~%")
(loop
repeat 20
do (bt:make-thread
(lambda ()
(if (bt-sem:wait-on-semaphore sem :timeout 4)
(bt:with-lock-held (lock)
(incf num))))))
(format t "num is ~d~%" num)
(sleep 0.33)
(format t "there are ~d waiting threads~%~%" (bt-sem:semaphore-waiters sem))
(format t "signal 5 threads~%")
(bt-sem:signal-semaphore sem 5)
(sleep 0.33)
(bt:with-lock-held (lock)
(format t "num is ~d~%" num))
(format t "there are ~d waiting threads~%~%" (bt-sem:semaphore-waiters sem))
(format t "signal 10 threads~%")
(bt-sem:signal-semaphore sem 10)
(sleep 0.33)
(bt:with-lock-held (lock)
(format t "num is ~d~%" num))
(format t "there are ~d waiting threads~%~%" (bt-sem:semaphore-waiters sem))
(format t "4s sleep~%")
(sleep 4)
(bt:with-lock-held (lock)
(format t "num is ~d~%" num))
(format t "there are ~d waiting threads~%~%" (bt-sem:semaphore-waiters sem)))
```
Calling `SEMAPHORE-DEMO` at the REPL should produce the following output:
```
spawn 20 threads with 4s timeout
num is 0
there are 20 waiting threads
signal 5 threads
num is 5
there are 15 waiting threads
signal 10 threads
num is 15
there are 5 waiting threads
4s sleep
num is 15
there are 0 waiting threads
```
## Status
The basics are done. It's not yet a replacement for `SB-THREAD:SEMAPHORE`, but
we're getting there.
You can run the test suites to verify that everything is working as it
should by invoking `(ql:quickload :bt-semaphore-test)` or `(asdf:test-system
:bt-semaphore)`.
## Bugs
I'm not aware of any bugs, but if you believe you've found one, please do
[report it](https://github.com/rmoritz/bt-semaphore/issues).
## Author
* Ralph Möritz (ralphmoritz@outlook.com)
## License
Copyright (c) Ralph Möritz 2013.
Permission is hereby granted, free of charge, to any person obtaining a copy of
this software and associated documentation files (the "Software"), to deal in
the Software without restriction, including without limitation the rights to
use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies
of the Software, and to permit persons to whom the Software is furnished to do
so, subject to the following conditions:
The above copyright notice and this permission notice shall be included in all
copies or substantial portions of the Software.
**THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
SOFTWARE.**
|
