FazBrowse GitHub Viewer
|
Trending
|
URL:
|
Home
Tools:
[Download Repo ZIP]
[View Raw Code]
[Original HTTPS Page]
cpython/Lib/multiprocessing/synchronize.py at main · python/cpython · GitHub
python
cpython
Repository navigation
Code
Issues
5k+
(5k+)
Pull requests
2.7k
(2.7k)
Actions
Projects
Security and quality
Insights
Expand file tree
Breadcrumbs
cpython
/
Lib
/
multiprocessing
/
synchronize.py
Copy path
More file actions
More file actions
Latest commit
History
History
History
411 lines (333 loc) · 12 KB
Breadcrumbs
cpython
/
Lib
/
multiprocessing
/
synchronize.py
Copy path
File metadata and controls
411 lines (333 loc) · 12 KB
Raw
Copy raw file
Download raw file
Open symbols panel
Edit and raw actions
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
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
#
# Module implementing synchronization primitives
#
# multiprocessing/synchronize.py
#
# Copyright (c) 2006-2008, R Oudkerk
# Licensed to PSF under a Contributor Agreement.
#
__all__
=
[
'Lock'
,
'RLock'
,
'Semaphore'
,
'BoundedSemaphore'
,
'Condition'
,
'Event'
]
import
threading
import
sys
import
tempfile
import
_multiprocessing
import
time
from
.
import
context
from
.
import
process
from
.
import
util
# TODO: Do any platforms still lack a functioning sem_open?
try
:
from
_multiprocessing
import
SemLock
,
sem_unlink
except
ImportError
:
raise
ImportError
(
"This platform lacks a functioning sem_open"
+
" implementation. https://github.com/python/cpython/issues/48020."
)
#
# Constants
#
# These match the enum in Modules/_multiprocessing/semaphore.c
RECURSIVE_MUTEX
=
0
SEMAPHORE
=
1
SEM_VALUE_MAX
=
_multiprocessing
.
SemLock
.
SEM_VALUE_MAX
#
# Base class for semaphores and mutexes; wraps `_multiprocessing.SemLock`
#
class
SemLock
(
object
):
_rand
=
tempfile
.
_RandomNameSequence
()
def
__init__
(
self
,
kind
,
value
,
maxvalue
,
*
,
ctx
):
if
ctx
is
None
:
ctx
=
context
.
_default_context
.
get_context
()
self
.
_is_fork_ctx
=
ctx
.
get_start_method
()
==
'fork'
unlink_now
=
sys
.
platform
==
'win32'
or
self
.
_is_fork_ctx
for
i
in
range
(
100
):
try
:
sl
=
self
.
_semlock
=
_multiprocessing
.
SemLock
(
kind
,
value
,
maxvalue
,
self
.
_make_name
(),
unlink_now
)
except
FileExistsError
:
pass
else
:
break
else
:
raise
FileExistsError
(
'cannot find name for semaphore'
)
util
.
debug
(
'created semlock with handle %s'
%
sl
.
handle
)
self
.
_make_methods
()
if
sys
.
platform
!=
'win32'
:
def
_after_fork
(
obj
):
obj
.
_semlock
.
_after_fork
()
util
.
register_after_fork
(
self
,
_after_fork
)
if
self
.
_semlock
.
name
is
not
None
:
# We only get here if we are on Unix with forking
# disabled. When the object is garbage collected or the
# process shuts down we unlink the semaphore name
from
.
resource_tracker
import
register
register
(
self
.
_semlock
.
name
,
"semaphore"
)
util
.
Finalize
(
self
,
SemLock
.
_cleanup
, (
self
.
_semlock
.
name
,),
exitpriority
=
0
)
@
staticmethod
def
_cleanup
(
name
):
from
.
resource_tracker
import
unregister
sem_unlink
(
name
)
unregister
(
name
,
"semaphore"
)
def
_make_methods
(
self
):
self
.
acquire
=
self
.
_semlock
.
acquire
self
.
release
=
self
.
_semlock
.
release
def
locked
(
self
):
return
self
.
_semlock
.
_is_zero
()
def
__enter__
(
self
):
return
self
.
_semlock
.
__enter__
()
def
__exit__
(
self
,
*
args
):
return
self
.
_semlock
.
__exit__
(
*
args
)
def
__getstate__
(
self
):
context
.
assert_spawning
(
self
)
sl
=
self
.
_semlock
if
sys
.
platform
==
'win32'
:
h
=
context
.
get_spawning_popen
().
duplicate_for_child
(
sl
.
handle
)
else
:
if
self
.
_is_fork_ctx
:
raise
RuntimeError
(
'A SemLock created in a fork context is being '
'shared with a process in a spawn context. This is '
'not supported. Please use the same context to create '
'multiprocessing objects and Process.'
)
h
=
sl
.
handle
return
(
h
,
sl
.
kind
,
sl
.
maxvalue
,
sl
.
name
)
def
__setstate__
(
self
,
state
):
self
.
_semlock
=
_multiprocessing
.
SemLock
.
_rebuild
(
*
state
)
util
.
debug
(
'recreated blocker with handle %r'
%
state
[
0
])
self
.
_make_methods
()
# Ensure that deserialized SemLock can be serialized again (gh-108520).
self
.
_is_fork_ctx
=
False
@
staticmethod
def
_make_name
():
return
'%s-%s'
%
(
process
.
current_process
().
_config
[
'semprefix'
],
next
(
SemLock
.
_rand
))
#
# Semaphore
#
class
Semaphore
(
SemLock
):
def
__init__
(
self
,
value
=
1
,
*
,
ctx
):
SemLock
.
__init__
(
self
,
SEMAPHORE
,
value
,
SEM_VALUE_MAX
,
ctx
=
ctx
)
def
get_value
(
self
):
'''Returns current value of Semaphore.
Raises NotImplementedError on Mac OSX
because of broken sem_getvalue().
'''
return
self
.
_semlock
.
_get_value
()
def
__repr__
(
self
):
try
:
value
=
self
.
get_value
()
except
Exception
:
value
=
'unknown'
return
'<%s(value=%s)>'
%
(
self
.
__class__
.
__name__
,
value
)
#
# Bounded semaphore
#
class
BoundedSemaphore
(
Semaphore
):
def
__init__
(
self
,
value
=
1
,
*
,
ctx
):
SemLock
.
__init__
(
self
,
SEMAPHORE
,
value
,
value
,
ctx
=
ctx
)
def
__repr__
(
self
):
try
:
value
=
self
.
get_value
()
except
Exception
:
value
=
'unknown'
return
'<%s(value=%s, maxvalue=%s)>'
%
\
(
self
.
__class__
.
__name__
,
value
,
self
.
_semlock
.
maxvalue
)
#
# Non-recursive lock
#
class
Lock
(
SemLock
):
def
__init__
(
self
,
*
,
ctx
):
SemLock
.
__init__
(
self
,
SEMAPHORE
,
1
,
1
,
ctx
=
ctx
)
def
__repr__
(
self
):
try
:
if
self
.
_semlock
.
_is_mine
():
name
=
process
.
current_process
().
name
if
threading
.
current_thread
().
name
!=
'MainThread'
:
name
+=
'|'
+
threading
.
current_thread
().
name
elif
not
self
.
_semlock
.
_is_zero
():
name
=
'None'
elif
self
.
_semlock
.
_count
()
>
0
:
name
=
'SomeOtherThread'
else
:
name
=
'SomeOtherProcess'
except
Exception
:
name
=
'unknown'
return
'<%s(owner=%s)>'
%
(
self
.
__class__
.
__name__
,
name
)
#
# Recursive lock
#
class
RLock
(
SemLock
):
def
__init__
(
self
,
*
,
ctx
):
SemLock
.
__init__
(
self
,
RECURSIVE_MUTEX
,
1
,
1
,
ctx
=
ctx
)
def
__repr__
(
self
):
try
:
if
self
.
_semlock
.
_is_mine
():
name
=
process
.
current_process
().
name
if
threading
.
current_thread
().
name
!=
'MainThread'
:
name
+=
'|'
+
threading
.
current_thread
().
name
count
=
self
.
_semlock
.
_count
()
elif
not
self
.
_semlock
.
_is_zero
():
name
,
count
=
'None'
,
0
elif
self
.
_semlock
.
_count
()
>
0
:
name
,
count
=
'SomeOtherThread'
,
'nonzero'
else
:
name
,
count
=
'SomeOtherProcess'
,
'nonzero'
except
Exception
:
name
,
count
=
'unknown'
,
'unknown'
return
'<%s(%s, %s)>'
%
(
self
.
__class__
.
__name__
,
name
,
count
)
#
# Condition variable
#
class
Condition
(
object
):
def
__init__
(
self
,
lock
=
None
,
*
,
ctx
):
self
.
_lock
=
lock
or
ctx
.
RLock
()
self
.
_sleeping_count
=
ctx
.
Semaphore
(
0
)
self
.
_woken_count
=
ctx
.
Semaphore
(
0
)
self
.
_wait_semaphore
=
ctx
.
Semaphore
(
0
)
self
.
_make_methods
()
def
__getstate__
(
self
):
context
.
assert_spawning
(
self
)
return
(
self
.
_lock
,
self
.
_sleeping_count
,
self
.
_woken_count
,
self
.
_wait_semaphore
)
def
__setstate__
(
self
,
state
):
(
self
.
_lock
,
self
.
_sleeping_count
,
self
.
_woken_count
,
self
.
_wait_semaphore
)
=
state
self
.
_make_methods
()
def
__enter__
(
self
):
return
self
.
_lock
.
__enter__
()
def
__exit__
(
self
,
*
args
):
return
self
.
_lock
.
__exit__
(
*
args
)
def
_make_methods
(
self
):
self
.
acquire
=
self
.
_lock
.
acquire
self
.
release
=
self
.
_lock
.
release
def
__repr__
(
self
):
try
:
num_waiters
=
(
self
.
_sleeping_count
.
get_value
()
-
self
.
_woken_count
.
get_value
())
except
Exception
:
num_waiters
=
'unknown'
return
'<%s(%s, %s)>'
%
(
self
.
__class__
.
__name__
,
self
.
_lock
,
num_waiters
)
def
wait
(
self
,
timeout
=
None
):
assert
self
.
_lock
.
_semlock
.
_is_mine
(), \
'must acquire() condition before using wait()'
# indicate that this thread is going to sleep
self
.
_sleeping_count
.
release
()
# release lock
count
=
self
.
_lock
.
_semlock
.
_count
()
for
i
in
range
(
count
):
self
.
_lock
.
release
()
try
:
# wait for notification or timeout
return
self
.
_wait_semaphore
.
acquire
(
True
,
timeout
)
finally
:
# indicate that this thread has woken
self
.
_woken_count
.
release
()
# reacquire lock
for
i
in
range
(
count
):
self
.
_lock
.
acquire
()
def
notify
(
self
,
n
=
1
):
assert
self
.
_lock
.
_semlock
.
_is_mine
(),
'lock is not owned'
assert
not
self
.
_wait_semaphore
.
acquire
(
False
), (
'notify: Should not have been able to acquire '
+
'_wait_semaphore'
)
# to take account of timeouts since last notify*() we subtract
# woken_count from sleeping_count and rezero woken_count
while
self
.
_woken_count
.
acquire
(
False
):
res
=
self
.
_sleeping_count
.
acquire
(
False
)
assert
res
, (
'notify: Bug in sleeping_count.acquire'
+
'- res should not be False'
)
sleepers
=
0
while
sleepers
<
n
and
self
.
_sleeping_count
.
acquire
(
False
):
self
.
_wait_semaphore
.
release
()
# wake up one sleeper
sleepers
+=
1
if
sleepers
:
for
i
in
range
(
sleepers
):
self
.
_woken_count
.
acquire
()
# wait for a sleeper to wake
# rezero wait_semaphore in case some timeouts just happened
while
self
.
_wait_semaphore
.
acquire
(
False
):
pass
def
notify_all
(
self
):
self
.
notify
(
n
=
sys
.
maxsize
)
def
wait_for
(
self
,
predicate
,
timeout
=
None
):
result
=
predicate
()
if
result
:
return
result
if
timeout
is
not
None
:
endtime
=
time
.
monotonic
()
+
timeout
else
:
endtime
=
None
waittime
=
None
while
not
result
:
if
endtime
is
not
None
:
waittime
=
endtime
-
time
.
monotonic
()
if
waittime
<=
0
:
break
self
.
wait
(
waittime
)
result
=
predicate
()
return
result
#
# Event
#
class
Event
(
object
):
def
__init__
(
self
,
*
,
ctx
):
self
.
_cond
=
ctx
.
Condition
(
ctx
.
Lock
())
self
.
_flag
=
ctx
.
Semaphore
(
0
)
def
is_set
(
self
):
with
self
.
_cond
:
if
self
.
_flag
.
acquire
(
False
):
self
.
_flag
.
release
()
return
True
return
False
def
set
(
self
):
with
self
.
_cond
:
self
.
_flag
.
acquire
(
False
)
self
.
_flag
.
release
()
self
.
_cond
.
notify_all
()
def
clear
(
self
):
with
self
.
_cond
:
self
.
_flag
.
acquire
(
False
)
def
wait
(
self
,
timeout
=
None
):
with
self
.
_cond
:
if
self
.
_flag
.
acquire
(
False
):
self
.
_flag
.
release
()
else
:
self
.
_cond
.
wait
(
timeout
)
if
self
.
_flag
.
acquire
(
False
):
self
.
_flag
.
release
()
return
True
return
False
def
__repr__
(
self
):
set_status
=
'set'
if
self
.
is_set
()
else
'unset'
return
f"<
{
type
(
self
).
__qualname__
}
at
{
id
(
self
):#x
}
{
set_status
}
>"
#
# Barrier
#
class
Barrier
(
threading
.
Barrier
):
def
__init__
(
self
,
parties
,
action
=
None
,
timeout
=
None
,
*
,
ctx
):
import
struct
from
.
heap
import
BufferWrapper
wrapper
=
BufferWrapper
(
struct
.
calcsize
(
'i'
)
*
2
)
cond
=
ctx
.
Condition
()
self
.
__setstate__
((
parties
,
action
,
timeout
,
cond
,
wrapper
))
self
.
_state
=
0
self
.
_count
=
0
def
__setstate__
(
self
,
state
):
(
self
.
_parties
,
self
.
_action
,
self
.
_timeout
,
self
.
_cond
,
self
.
_wrapper
)
=
state
self
.
_array
=
self
.
_wrapper
.
create_memoryview
().
cast
(
'i'
)
def
__getstate__
(
self
):
return
(
self
.
_parties
,
self
.
_action
,
self
.
_timeout
,
self
.
_cond
,
self
.
_wrapper
)
@
property
def
_state
(
self
):
return
self
.
_array
[
0
]
@
_state
.
setter
def
_state
(
self
,
value
):
self
.
_array
[
0
]
=
value
@
property
def
_count
(
self
):
return
self
.
_array
[
1
]
@
_count
.
setter
def
_count
(
self
,
value
):
self
.
_array
[
1
]
=
value
Back
|
FazBrowse Home
|
New Git URL