summaryrefslogtreecommitdiffstats
path: root/upstream/mageia-cauldron/man3pm/Thread::Semaphore.3pm
blob: 7e0ba5f25b5a2c3843a26ee7fd6c554fba8b65a9 (plain)
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
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
.\" -*- mode: troff; coding: utf-8 -*-
.\" Automatically generated by Pod::Man 5.01 (Pod::Simple 3.43)
.\"
.\" Standard preamble:
.\" ========================================================================
.de Sp \" Vertical space (when we can't use .PP)
.if t .sp .5v
.if n .sp
..
.de Vb \" Begin verbatim text
.ft CW
.nf
.ne \\$1
..
.de Ve \" End verbatim text
.ft R
.fi
..
.\" \*(C` and \*(C' are quotes in nroff, nothing in troff, for use with C<>.
.ie n \{\
.    ds C` ""
.    ds C' ""
'br\}
.el\{\
.    ds C`
.    ds C'
'br\}
.\"
.\" Escape single quotes in literal strings from groff's Unicode transform.
.ie \n(.g .ds Aq \(aq
.el       .ds Aq '
.\"
.\" If the F register is >0, we'll generate index entries on stderr for
.\" titles (.TH), headers (.SH), subsections (.SS), items (.Ip), and index
.\" entries marked with X<> in POD.  Of course, you'll have to process the
.\" output yourself in some meaningful fashion.
.\"
.\" Avoid warning from groff about undefined register 'F'.
.de IX
..
.nr rF 0
.if \n(.g .if rF .nr rF 1
.if (\n(rF:(\n(.g==0)) \{\
.    if \nF \{\
.        de IX
.        tm Index:\\$1\t\\n%\t"\\$2"
..
.        if !\nF==2 \{\
.            nr % 0
.            nr F 2
.        \}
.    \}
.\}
.rr rF
.\" ========================================================================
.\"
.IX Title "Thread::Semaphore 3pm"
.TH Thread::Semaphore 3pm 2023-11-28 "perl v5.38.2" "Perl Programmers Reference Guide"
.\" For nroff, turn off justification.  Always turn off hyphenation; it makes
.\" way too many mistakes in technical documents.
.if n .ad l
.nh
.SH NAME
Thread::Semaphore \- Thread\-safe semaphores
.SH VERSION
.IX Header "VERSION"
This document describes Thread::Semaphore version 2.13
.SH SYNOPSIS
.IX Header "SYNOPSIS"
.Vb 5
\&    use Thread::Semaphore;
\&    my $s = Thread::Semaphore\->new();
\&    $s\->down();   # Also known as the semaphore P operation.
\&    # The guarded section is here
\&    $s\->up();     # Also known as the semaphore V operation.
\&
\&    # Decrement the semaphore only if it would immediately succeed.
\&    if ($s\->down_nb()) {
\&        # The guarded section is here
\&        $s\->up();
\&    }
\&
\&    # Forcefully decrement the semaphore even if its count goes below 0.
\&    $s\->down_force();
\&
\&    # The default value for semaphore operations is 1
\&    my $s = Thread::Semaphore\->new($initial_value);
\&    $s\->down($down_value);
\&    $s\->up($up_value);
\&    if ($s\->down_nb($down_value)) {
\&        ...
\&        $s\->up($up_value);
\&    }
\&    $s\->down_force($down_value);
.Ve
.SH DESCRIPTION
.IX Header "DESCRIPTION"
Semaphores provide a mechanism to regulate access to resources.  Unlike
locks, semaphores aren't tied to particular scalars, and so may be used to
control access to anything you care to use them for.
.PP
Semaphores don't limit their values to zero and one, so they can be used to
control access to some resource that there may be more than one of (e.g.,
filehandles).  Increment and decrement amounts aren't fixed at one either,
so threads can reserve or return multiple resources at once.
.SH METHODS
.IX Header "METHODS"
.IP \->\fBnew()\fR 8
.IX Item "->new()"
.PD 0
.IP \->new(NUMBER) 8
.IX Item "->new(NUMBER)"
.PD
\&\f(CW\*(C`new\*(C'\fR creates a new semaphore, and initializes its count to the specified
number (which must be an integer).  If no number is specified, the
semaphore's count defaults to 1.
.IP \->\fBdown()\fR 8
.IX Item "->down()"
.PD 0
.IP \->down(NUMBER) 8
.IX Item "->down(NUMBER)"
.PD
The \f(CW\*(C`down\*(C'\fR method decreases the semaphore's count by the specified number
(which must be an integer >= 1), or by one if no number is specified.
.Sp
If the semaphore's count would drop below zero, this method will block
until such time as the semaphore's count is greater than or equal to the
amount you're \f(CW\*(C`down\*(C'\fRing the semaphore's count by.
.Sp
This is the semaphore "P operation" (the name derives from the Dutch
word "pak", which means "capture" \-\- the semaphore operations were
named by the late Dijkstra, who was Dutch).
.IP \->\fBdown_nb()\fR 8
.IX Item "->down_nb()"
.PD 0
.IP \->down_nb(NUMBER) 8
.IX Item "->down_nb(NUMBER)"
.PD
The \f(CW\*(C`down_nb\*(C'\fR method attempts to decrease the semaphore's count by the
specified number (which must be an integer >= 1), or by one if no number
is specified.
.Sp
If the semaphore's count would drop below zero, this method will return
\&\fIfalse\fR, and the semaphore's count remains unchanged.  Otherwise, the
semaphore's count is decremented and this method returns \fItrue\fR.
.IP \->\fBdown_force()\fR 8
.IX Item "->down_force()"
.PD 0
.IP \->down_force(NUMBER) 8
.IX Item "->down_force(NUMBER)"
.PD
The \f(CW\*(C`down_force\*(C'\fR method decreases the semaphore's count by the specified
number (which must be an integer >= 1), or by one if no number is specified.
This method does not block, and may cause the semaphore's count to drop
below zero.
.IP \->down_timed(TIMEOUT) 8
.IX Item "->down_timed(TIMEOUT)"
.PD 0
.IP "\->down_timed(TIMEOUT, NUMBER)" 8
.IX Item "->down_timed(TIMEOUT, NUMBER)"
.PD
The \f(CW\*(C`down_timed\*(C'\fR method attempts to decrease the semaphore's count by 1
or by the specified number within the specified timeout period given in
seconds (which must be an integer >= 0).
.Sp
If the semaphore's count would drop below zero, this method will block
until either the semaphore's count is greater than or equal to the
amount you're \f(CW\*(C`down\*(C'\fRing the semaphore's count by, or until the timeout is
reached.
.Sp
If the timeout is reached, this method will return \fIfalse\fR, and the
semaphore's count remains unchanged.  Otherwise, the semaphore's count is
decremented and this method returns \fItrue\fR.
.IP \->\fBup()\fR 8
.IX Item "->up()"
.PD 0
.IP \->up(NUMBER) 8
.IX Item "->up(NUMBER)"
.PD
The \f(CW\*(C`up\*(C'\fR method increases the semaphore's count by the number specified
(which must be an integer >= 1), or by one if no number is specified.
.Sp
This will unblock any thread that is blocked trying to \f(CW\*(C`down\*(C'\fR the
semaphore if the \f(CW\*(C`up\*(C'\fR raises the semaphore's count above the amount that
the \f(CW\*(C`down\*(C'\fR is trying to decrement it by.  For example, if three threads
are blocked trying to \f(CW\*(C`down\*(C'\fR a semaphore by one, and another thread \f(CW\*(C`up\*(C'\fRs
the semaphore by two, then two of the blocked threads (which two is
indeterminate) will become unblocked.
.Sp
This is the semaphore "V operation" (the name derives from the Dutch
word "vrij", which means "release").
.SH NOTES
.IX Header "NOTES"
Semaphores created by Thread::Semaphore can be used in both threaded and
non-threaded applications.  This allows you to write modules and packages
that potentially make use of semaphores, and that will function in either
environment.
.SH "SEE ALSO"
.IX Header "SEE ALSO"
Thread::Semaphore on MetaCPAN:
<https://metacpan.org/release/Thread\-Semaphore>
.PP
Code repository for CPAN distribution:
<https://github.com/Dual\-Life/Thread\-Semaphore>
.PP
threads, threads::shared
.PP
Sample code in the \fIexamples\fR directory of this distribution on CPAN.
.SH MAINTAINER
.IX Header "MAINTAINER"
Jerry D. Hedden, <jdhedden\ AT\ cpan\ DOT\ org>
.SH LICENSE
.IX Header "LICENSE"
This program is free software; you can redistribute it and/or modify it under
the same terms as Perl itself.