/opt/alt/python34/lib64/python3.4/__pycache__
Edit: /opt/alt/python34/lib64/python3.4/__pycache__/threading.cpython-34.pyc (38965B)
f # @ s~ d Z d d l Z d d l Z y d d l m Z Wn" e k
rV d d l m Z Yn Xd d l m Z
d d l m Z d d l
m Z m Z y d d l m Z Wn" e k
r d d l m Z Yn Xd d
d d d
d d d d d d d d d d d d g Z e j Z e j Z e j Z e j Z e j Z y
e j Z Wn e! k
rSd Z Yn Xe j" Z" [ d a# d a$ d d Z% d d Z& e Z' d d Z Gd d d Z( e( Z) Gd d
d
Z* Gd d d Z+ Gd! d d e+ Z, Gd" d
d
Z- Gd# d d Z. Gd$ d% d% e/ Z0 e j1 Z2 e2 d& d' d( Z3 e a4 i Z5 i Z6 e Z7 Gd) d d Z8 Gd* d d e8 Z9 Gd+ d, d, e8 Z: Gd- d. d. e8 Z; d/ d Z< e< Z= d0 d Z> e> Z? d1 d2 Z@ d3 d ZA d d4 l mB ZB e: aC d5 d6 ZD d7 d8 ZE d9 d: ZF y d d; l mG ZH Wn" e k
rmd d< lI mH ZH Yn Xd= d> ZJ d S)?z;Thread module emulating a subset of Java's threading model. N) monotonic)time)
format_exc)WeakSet)islicecount)deque active_count Conditioncurrent_thread enumerateEventLockRLock SemaphoreBoundedSemaphoreThreadBarrierTimer ThreadError
setprofilesettracelocal
stack_sizec C s
| a d S)zSet a profile function for all threads started from the threading module.
The func will be passed to sys.setprofile() for each thread, before its
run() method is called.
N)
_profile_hook)func r ./opt/alt/python34/lib64/python3.4/threading.pyr 3 s c C s
| a d S)zSet a trace function for all threads started from the threading module.
The func will be passed to sys.settrace() for each thread, before its run()
method is called.
N) _trace_hook)r r r r r = s c O s& t d k r t | | St | | S)a2 Factory function that returns a new reentrant lock.
A reentrant lock must be released by the thread that acquired it. Once a
thread has acquired a reentrant lock, the same thread may acquire it again
without blocking; the thread must release it once for each time it has
acquired it.
N)_CRLock_PyRLock)argskwargsr r r r K s
c @ s e Z d Z d Z d d Z d d Z d d d d Z e Z d
d Z d d
Z d d Z
d d Z d d Z d S)_RLocka, This class implements reentrant lock objects.
A reentrant lock must be released by the thread that acquired it. Once a
thread has acquired a reentrant lock, the same thread may acquire it
again without blocking; the thread must release it once for each time it
has acquired it.
c C s" t | _ d | _ d | _ d S)Nr )_allocate_lock_block_owner_count)selfr r r __init__b s z_RLock.__init__c C sI | j } y t | j } Wn t k
r. Yn Xd | j j | | j f S)Nz<%s owner=%r count=%d>)r& _activenameKeyError __class____name__r' )r( ownerr r r __repr__g s
z_RLock.__repr__T c C s_ t } | j | k r+ | j d 7_ d S| j j | | } | r[ | | _ d | _ n | S)a Acquire a lock, blocking or non-blocking.
When invoked without arguments: if this thread already owns the lock,
increment the recursion level by one, and return immediately. Otherwise,
if another thread owns the lock, block until the lock is unlocked. Once
the lock is unlocked (not owned by any thread), then grab ownership, set
the recursion level to one, and return. If more than one thread is
blocked waiting until the lock is unlocked, only one at a time will be
able to grab ownership of the lock. There is no return value in this
case.
When invoked with the blocking argument set to true, do the same thing
as when called without arguments, and return true.
When invoked with the blocking argument set to false, do not block. If a
call without an argument would block, return false immediately;
otherwise, do the same thing as when called without arguments, and
return true.
When invoked with the floating-point timeout argument set to a positive
value, block for at most the number of seconds specified by timeout
and as long as the lock cannot be acquired. Return true if the lock has
been acquired, false if the timeout has elapsed.
r1 ) get_identr& r' r% acquire)r( blockingtimeoutmercr r r r3 p s z_RLock.acquirec C sX | j t k r! t d n | j d | _ } | sT d | _ | j j n d S)am Release a lock, decrementing the recursion level.
If after the decrement it is zero, reset the lock to unlocked (not owned
by any thread), and if any other threads are blocked waiting for the
lock to become unlocked, allow exactly one of them to proceed. If after
the decrement the recursion level is still nonzero, the lock remains
locked and owned by the calling thread.
Only call this method when the calling thread owns the lock. A
RuntimeError is raised if this method is called when the lock is
unlocked.
There is no return value.
z cannot release un-acquired lockr1 N)r& r2 RuntimeErrorr' r% release)r( r r r r r9 s z_RLock.releasec C s | j d S)N)r9 )r( tvtbr r r __exit__ s z_RLock.__exit__c C s# | j j | \ | _ | _ d S)N)r% r3 r' r& )r( stater r r _acquire_restore s
z_RLock._acquire_restorec C sY | j d k r t d n | j } d | _ | j } d | _ | j j | | f S)Nr z cannot release un-acquired lock)r' r8 r& r% r9 )r( r r/ r r r
_release_save s
z_RLock._release_savec C s | j t k S)N)r& r2 )r( r r r _is_owned s z_RLock._is_ownedN)
r.
__module__ __qualname____doc__r) r0 r3 __enter__r9 r= r? r@ rA r r r r r# X s $
r# c @ s e Z d Z d Z d d d Z d d Z d d Z d d
Z d d Z d
d Z d d Z
d d d Z d d d Z d d d Z
d d Z e Z d S)r
aj Class that implements a condition variable.
A condition variable allows one or more threads to wait until they are
notified by another thread.
If the lock argument is given and not None, it must be a Lock or RLock
object, and it is used as the underlying lock. Otherwise, a new RLock object
is created and used as the underlying lock.
Nc C s | d k r t } n | | _ | j | _ | j | _ y | j | _ Wn t k
r] Yn Xy | j | _ Wn t k
r Yn Xy | j | _ Wn t k
r Yn Xt | _ d S)N)
r _lockr3 r9 r@ AttributeErrorr? rA _deque_waiters)r( lockr r r r) s$
zCondition.__init__c C s
| j j S)N)rG rF )r( r r r rF s zCondition.__enter__c G s | j j | S)N)rG r= )r( r! r r r r= s zCondition.__exit__c C s d | j t | j f S)Nz
)rG lenrJ )r( r r r r0 s zCondition.__repr__c C s | j j d S)N)rG r9 )r( r r r r@ s zCondition._release_savec C s | j j d S)N)rG r3 )r( xr r r r? s zCondition._acquire_restorec C s+ | j j d r# | j j d Sd Sd S)Nr FT)rG r3 r9 )r( r r r rA s
zCondition._is_ownedc C s | j s t d n t } | j | j j | | j } d } zW | d k rr | j d } n0 | d k r | j d | } n | j d } | SWd | j | | s y | j j | Wq t k
r Yq Xn Xd S)ak Wait until notified or until a timeout occurs.
If the calling thread has not acquired the lock when this method is
called, a RuntimeError is raised.
This method releases the underlying lock, and then blocks until it is
awakened by a notify() or notify_all() call for the same condition
variable in another thread, or until the optional timeout occurs. Once
awakened or timed out, it re-acquires the lock and returns.
When the timeout argument is present and not None, it should be a
floating point number specifying a timeout for the operation in seconds
(or fractions thereof).
When the underlying lock is an RLock, it is not released using its
release() method, since this may not actually unlock the lock when it
was acquired multiple times recursively. Instead, an internal interface
of the RLock class is used, which really unlocks it even when it has
been recursively acquired several times. Another internal interface is
then used to restore the recursion level when the lock is reacquired.
z cannot wait on un-acquired lockFNTr )
rA r8 r$ r3 rJ appendr@ r? remove
ValueError)r( r5 waiterZ saved_stateZgotitr r r wait s*
zCondition.waitc C s d } | } | } xh | s | d k rf | d k rF t | } qf | t } | d k rf Pqf n | j | | } q W| S)zWait until a condition evaluates to True.
predicate should be a callable which result will be interpreted as a
boolean value. A timeout may be provided giving the maximum time to
wait.
Nr )_timerR )r( Z predicater5 endtimeZwaittimeresultr r r wait_for2 s
zCondition.wait_forr1 c C s | j s t d n | j } t t | | } | sC d Sx> | D]6 } | j y | j | WqJ t k
r YqJ XqJ Wd S)aK Wake up one or more threads waiting on this condition, if any.
If the calling thread has not acquired the lock when this method is
called, a RuntimeError is raised.
This method wakes up at most n of the threads waiting for the condition
variable; it is a no-op if no threads are waiting.
z!cannot notify on un-acquired lockN)rA r8 rJ rI _islicer9 rO rP )r( nZ all_waitersZwaiters_to_notifyrQ r r r notifyI s
zCondition.notifyc C s | j t | j d S)zWake up all threads waiting on this condition.
If the calling thread has not acquired the lock when this method
is called, a RuntimeError is raised.
N)rY rL rJ )r( r r r
notify_all` s zCondition.notify_all)r. rC rD rE r) rF r= r0 r@ r? rA rR rV rY rZ Z notifyAllr r r r r
s
0 c @ sU e Z d Z d Z d d d Z d d d d Z e Z d d
Z d d Z d S)
r aG This class implements semaphore objects.
Semaphores manage a counter representing the number of release() calls minus
the number of acquire() calls, plus an initial value. The acquire() method
blocks if necessary until it can return without making the counter
negative. If not given, value defaults to 1.
r1 c C s: | d k r t d n t t | _ | | _ d S)Nr z$semaphore initial value must be >= 0)rP r
r _cond_value)r( valuer r r r) x s zSemaphore.__init__TNc
C s | r" | d k r" t d n d } d } | j x | j d k r | sT Pn | d k r | d k r| t | } q | t } | d k r Pq n | j j | q; W| j d 8_ d } Wd QX| S)a Acquire a semaphore, decrementing the internal counter by one.
When invoked without arguments: if the internal counter is larger than
zero on entry, decrement it by one and return immediately. If it is zero
on entry, block, waiting until some other thread has called release() to
make it larger than zero. This is done with proper interlocking so that
if multiple acquire() calls are blocked, release() will wake exactly one
of them up. The implementation may pick one at random, so the order in
which blocked threads are awakened should not be relied on. There is no
return value in this case.
When invoked with blocking set to true, do the same thing as when called
without arguments, and return true.
When invoked with blocking set to false, do not block. If a call without
an argument would block, return false immediately; otherwise, do the
same thing as when called without arguments, and return true.
When invoked with a timeout other than None, it will block for at
most timeout seconds. If acquire does not complete successfully in
that interval, return false. Return true otherwise.
Nz.can't specify timeout for non-blocking acquireFr r1 T)rP r[ r\ rS rR )r( r4 r5 r7 rT r r r r3 ~ s$
zSemaphore.acquirec
C s0 | j ! | j d 7_ | j j Wd QXd S)zRelease a semaphore, incrementing the internal counter by one.
When the counter is zero on entry and another thread is waiting for it
to become larger than zero again, wake up that thread.
r1 N)r[ r\ rY )r( r r r r9 s
zSemaphore.releasec C s | j d S)N)r9 )r( r: r; r< r r r r= s zSemaphore.__exit__) r. rC rD rE r) r3 rF r9 r= r r r r r l s - c @ s1 e Z d Z d Z d d d Z d d Z d S)r a Implements a bounded semaphore.
A bounded semaphore checks to make sure its current value doesn't exceed its
initial value. If it does, ValueError is raised. In most situations
semaphores are used to guard resources with limited capacity.
If the semaphore is released too many times it's a sign of a bug. If not
given, value defaults to 1.
Like regular semaphores, bounded semaphores manage a counter representing
the number of release() calls minus the number of acquire() calls, plus an
initial value. The acquire() method blocks if necessary until it can return
without making the counter negative. If not given, value defaults to 1.
r1 c C s t j | | | | _ d S)N)r r) _initial_value)r( r] r r r r) s zBoundedSemaphore.__init__c
C sQ | j B | j | j k r+ t d n | j d 7_ | j j Wd QXd S)a6 Release a semaphore, incrementing the internal counter by one.
When the counter is zero on entry and another thread is waiting for it
to become larger than zero again, wake up that thread.
If the number of releases exceeds the number of acquires,
raise a ValueError.
z!Semaphore released too many timesr1 N)r[ r\ r^ rP rY )r( r r r r9 s
zBoundedSemaphore.releaseN)r. rC rD rE r) r9 r r r r r s c @ sg e Z d Z d Z d d Z d d Z d d Z e Z d d Z d
d Z d d
d Z
d S)r
zClass implementing event objects.
Events manage a flag that can be set to true with the set() method and reset
to false with the clear() method. The wait() method blocks until the flag is
true. The flag is initially false.
c C s t t | _ d | _ d S)NF)r
r r[ _flag)r( r r r r) s zEvent.__init__c C s | j j t d S)N)r[ r) r )r( r r r _reset_internal_locks s zEvent._reset_internal_locksc C s | j S)z5Return true if and only if the internal flag is true.)r_ )r( r r r is_set s z Event.is_setc C s* | j d | _ | j j Wd QXd S)zSet the internal flag to true.
All threads waiting for it to become true are awakened. Threads
that call wait() once the flag is true will not block at all.
TN)r[ r_ rZ )r( r r r set s
z Event.setc C s | j d | _ Wd QXd S)zReset the internal flag to false.
Subsequently, threads calling wait() will block until set() is called to
set the internal flag to true again.
FN)r[ r_ )r( r r r clear s
z Event.clearNc C s< | j - | j } | s. | j j | } n | SWd QXd S)aH Block until the internal flag is true.
If the internal flag is true on entry, return immediately. Otherwise,
block until another thread calls set() to set the flag to true, or until
the optional timeout occurs.
When the timeout argument is present and not None, it should be a
floating point number specifying a timeout for the operation in seconds
(or fractions thereof).
This method returns the internal flag on exit, so it will always return
True except if a timeout is given and the operation times out.
N)r[ r_ rR )r( r5 Zsignaledr r r rR s
z
Event.wait) r. rC rD rE r) r` ra ZisSetrb rc rR r r r r r
s
c @ s e Z d Z d Z d d d d Z d d d Z d d Z d d
Z d d Z d
d Z d d Z
d d Z d d Z e
d d Z e
d d Z e
d d Z d S)r zImplements a Barrier.
Useful for synchronizing a fixed number of threads at known synchronization
points. Threads block on 'wait()' and are simultaneously once they have all
made that call.
Nc C sC t t | _ | | _ | | _ | | _ d | _ d | _ d S)aW Create a barrier, initialised to 'parties' threads.
'action' is a callable which, when supplied, will be called by one of
the threads after they have all entered the barrier and just prior to
releasing them all. If a 'timeout' is provided, it is uses as the
default for all subsequent 'wait()' calls.
r N)r
r r[ _action_timeout_parties_stater' )r( partiesactionr5 r r r r) : s zBarrier.__init__c C s | d k r | j } n | j y | j | j } | j d 7_ z5 | d | j k rg | j n
| j | | SWd | j d 8_ | j XWd QXd S)aN Wait for the barrier.
When the specified number of threads have started waiting, they are all
simultaneously awoken. If an 'action' was provided for the barrier, one
of the threads will have executed that callback prior to returning.
Returns an individual index number from 0 to 'parties-1'.
Nr1 )re r[ _enterr' rf _release_wait_exit)r( r5 indexr r r rR J s
z Barrier.waitc C sT x | j d k r" | j j q W| j d k r; t n | j d k sP t d S)Nr1 r rB )rB r1 )rg r[ rR BrokenBarrierErrorAssertionError)r( r r r rj h s
zBarrier._enterc C sL y0 | j r | j n d | _ | j j Wn | j Yn Xd S)Nr1 )rd rg r[ rZ _break)r( r r r rk s s
zBarrier._releasec se j j f d d | s4 j t n j d k rL t n j d k sa t d S)Nc s
j d k S)Nr )rg r )r( r r s z Barrier._wait..r r1 )r[ rV rq ro rg rp )r( r5 r )r( r rl s !
z
Barrier._waitc C s> | j d k r: | j d k r: d | _ | j j q: n d S)Nr r1 rB )rB r1 )r' rg r[ rZ )r( r r r rm s z
Barrier._exitc C sr | j c | j d k rR | j d k r4 d | _ q[ | j d k r[ d | _ q[ n d | _ | j j Wd QXd S)zReset the barrier to the initial state.
Any threads currently waiting will get the BrokenBarrier exception
raised.
r r1 NrB rB )r[ r' rg rZ )r( r r r reset s
z
Barrier.resetc C s | j | j Wd QXd S)zPlace the barrier into a 'broken' state.
Useful in case of error. Any currently waiting threads and threads
attempting to 'wait()' will have BrokenBarrierError raised.
N)r[ rq )r( r r r abort s
z
Barrier.abortc C s d | _ | j j d S)Nrs rt )rg r[ rZ )r( r r r rq s zBarrier._breakc C s | j S)z:Return the number of threads required to trip the barrier.)rf )r( r r r rh s zBarrier.partiesc C s | j d k r | j Sd S)z>Return the number of threads currently waiting at the barrier.r )rg r' )r( r r r n_waiting s zBarrier.n_waitingc C s
| j d k S)z0Return True if the barrier is in a broken state.rs rt )rg )r( r r r broken s zBarrier.broken)r. rC rD rE r) rR rj rk rl rm ru rv rq propertyrh rw rx r r r r r 1 s
c @ s e Z d Z d S)ro N)r. rC rD r r r r ro s ro z Thread-%dc C s | t S)N)_counter)templater r r _newname s r| c @ s e Z d Z d Z d Z e j Z d d d f d d d d d Z d d Z d d
Z
d d Z d
d Z d d Z
d d Z d d Z d d Z d d Z d d Z d d d Z d d3 d d Z e d! d" Z e j d# d" Z e d$ d% Z d& d' Z e Z e d( d) Z e j d* d) Z d+ d, Z d- d. Z d/ d0 Z d1 d2 Z d S)4r a A class that represents a thread of control.
This class can be safely subclassed in a limited fashion. There are two ways
to specify the activity: by passing a callable object to the constructor, or
by overriding the run() method in a subclass.
FNdaemonc C s | d k s t d | d k r- i } n | | _ t | pE t | _ | | _ | | _ | d k rx | | _ n t j | _ d | _
d | _ t | _
d | _ d | _ t j | _ t j | d S)aK This constructor should always be called with keyword arguments. Arguments are:
*group* should be None; reserved for future extension when a ThreadGroup
class is implemented.
*target* is the callable object to be invoked by the run()
method. Defaults to None, meaning nothing is called.
*name* is the thread name. By default, a unique name is constructed of
the form "Thread-N" where N is a small decimal number.
*args* is the argument tuple for the target invocation. Defaults to ().
*kwargs* is a dictionary of keyword arguments for the target
invocation. Defaults to {}.
If a subclass overrides the constructor, it must make sure to invoke
the base class constructor (Thread.__init__()) before doing anything
else to the thread.
Nz#group argument must be None for nowFT)rp _targetstrr| _name_args_kwargs _daemonicr r} _ident _tstate_lockr
_started _is_stopped _initialized_sysstderr_stderr _danglingadd)r( grouptargetr+ r! r" r} r r r r) s" zThread.__init__c C s6 | j j | r | j n d | _ d | _ d S)NT)r r` _set_tstate_lockr r )r( is_aliver r r r` s
z Thread._reset_internal_locksc C s | j s t d d } | j j r3 d } n | j | j rO d } n | j re | d 7} n | j d k r | d | j 7} n d | j j | j
| f S)Nz Thread.__init__() was not calledinitialZstartedZstoppedz daemonz %sz <%s(%s, %s)>) r rp r ra r r r r r- r. r )r( Zstatusr r r r0 ) s
zThread.__repr__c C s | j s t d n | j j r6 t d n t | t | s
kP&O