Warning: Cannot modify header information - headers already sent by (output started at /var/www/jonas-eriksen.dk/pic/private/index.php:1) in /var/www/jonas-eriksen.dk/pic/private/index.php on line 215
z fc @ s= d Z d d l Z y d d l Z Wn e k
rB e j e = n Xd d l Z d d l m Z
d d l m Z
d d l m Z m Z d d l m Z d 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 d d e d d d d e Z! d e" f d YZ# e$ a% e$ a& d Z' d! Z( e Z) d" Z* d# e# f d$ YZ+ d% Z, d& e# f d' YZ- d( Z. d) e# f d* YZ/ d+ Z0 d, e/ f d- YZ1 d. Z2 d/ e# f d0 YZ3 e
j4 Z5 e5 d1 d2 Z6 e a7 i Z8 i Z9 d e# f d3 YZ: d4 Z; d5 e: f d6 YZ< d7 e: f d8 YZ= d9 Z> d: e: f d; YZ? d< Z@ e@ ZA d= ZB eB ZC d> ZD d? ZE d d@ l mF ZF e= jG ZH y d dA l mI ZJ Wn! e k
rd dB lK mJ ZJ n XdC ZL dD ZM e dE k r9eM n d S(F s; Thread module emulating a subset of Java's threading model.iN( t deque( t count( t timet sleep( t
format_exct activeCountt active_countt Conditiont
currentThreadt current_threadt enumeratet Eventt Lockt RLockt Semaphoret BoundedSemaphoret Threadt Timert
setprofilet settracet localt
stack_sizet ignoret categoryt modulet threadingt messages
sys.exc_cleart _Verbosec B s e Z d d Z d Z RS( c C s" | d k r t } n | | _ d S( N( t Nonet _VERBOSEt _Verbose__verbose( t selft verbose( ( s! /usr/lib64/python2.7/threading.pyt __init__; s c G sr | j rn | | } t } y t | j } Wn t k
rJ d | } n Xd | | f } t j j | n d S( Ns s %s: %s
( R t
_get_identt _activet namet KeyErrort _syst stderrt write( R t formatt argst identR$ ( ( s! /usr/lib64/python2.7/threading.pyt _note@ s
N( t __name__t
__module__R R! R, ( ( ( s! /usr/lib64/python2.7/threading.pyR 9 s c C s
| a d S( s Set 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( t
_profile_hook( t func( ( s! /usr/lib64/python2.7/threading.pyR Z s c C s
| a d S( s Set 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( t _trace_hook( R0 ( ( s! /usr/lib64/python2.7/threading.pyR d s c O s
t | | S( s2 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.
( t _RLock( R* t kwargs( ( s! /usr/lib64/python2.7/threading.pyR
r s R2 c B sb e Z d Z d
d Z d Z d d Z e Z d Z d Z d Z
d Z d Z RS( s 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 s2 t j | | t | _ d | _ d | _ d S( Ni ( R R! t _allocate_lockt
_RLock__blockR t
_RLock__ownert
_RLock__count( R R ( ( s! /usr/lib64/python2.7/threading.pyR! s c C sH | j } y t | j } Wn t k
r- n Xd | j j | | j f S( Ns <%s owner=%r count=%d>( R6 R# R$ R% t __class__R- R7 ( R t owner( ( s! /usr/lib64/python2.7/threading.pyt __repr__ s
i c C s t } | j | k r? | j d | _ | j d | | d S| j j | } | r | | _ d | _ | j d | | n | j d | | | S( s 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.
i s! %s.acquire(%s): recursive successs %s.acquire(%s): initial successs %s.acquire(%s): failure( R" R6 R7 R, R5 t acquire( R t blockingt met rc( ( s! /usr/lib64/python2.7/threading.pyR; s c C sx | j t k r! t d n | j d | _ } | sd d | _ | j j | j d | n | j d | d S( sm 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.
s cannot release un-acquired locki s %s.release(): final releases %s.release(): non-final releaseN( R6 R" t RuntimeErrorR7 R R5 t releaseR, ( R R ( ( s! /usr/lib64/python2.7/threading.pyR@ s
c C s | j d S( N( R@ ( R t tt vt tb( ( s! /usr/lib64/python2.7/threading.pyt __exit__ s c C s? | \ } } | j j | | _ | | _ | j d | d S( Ns %s._acquire_restore()( R5 R; R7 R6 R, ( R t count_ownerR R9 ( ( s! /usr/lib64/python2.7/threading.pyt _acquire_restore s
c C sK | j d | | j } d | _ | j } d | _ | j j | | f S( Ns %s._release_save()i ( R, R7 R6 R R5 R@ ( R R R9 ( ( s! /usr/lib64/python2.7/threading.pyt
_release_save s
c C s | j t k S( N( R6 R" ( R ( ( s! /usr/lib64/python2.7/threading.pyt _is_owned s N(
R- R. t __doc__R R! R: R; t __enter__R@ RD RF RG RH ( ( ( s! /usr/lib64/python2.7/threading.pyR2 } s &
c O s
t | | S( s} Factory function that returns a new condition variable object.
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.
( t
_Condition( R* R3 ( ( s! /usr/lib64/python2.7/threading.pyR s RK c B s} e Z d Z d d d Z d Z d Z d Z d Z d Z d Z
d e d Z d d
Z
d Z e Z RS(
sl Condition variables allow one or more threads to wait until they are
notified by another thread.
c C s t j | | | d k r( t } n | | _ | j | _ | j | _ y | j | _ Wn t k
rl n Xy | j | _ Wn t k
r n Xy | j
| _
Wn t k
r n Xg | _ d S( N( R R! R R
t _Condition__lockR; R@ RG t AttributeErrorRF RH t _Condition__waiters( R t lockR ( ( s! /usr/lib64/python2.7/threading.pyR! s&
c C s
| j j S( N( RL RJ ( R ( ( s! /usr/lib64/python2.7/threading.pyRJ s c G s | j j | S( N( RL RD ( R R* ( ( s! /usr/lib64/python2.7/threading.pyRD s c C s d | j t | j f S( Ns ( RL t lenRN ( R ( ( s! /usr/lib64/python2.7/threading.pyR: # s c C s | j j d S( N( RL R@ ( R ( ( s! /usr/lib64/python2.7/threading.pyRG & s c C s | j j d S( N( RL R; ( R t x( ( s! /usr/lib64/python2.7/threading.pyRF ) s c C s+ | j j d r# | j j t St Sd S( Ni ( RL R; R@ t Falset True( R ( ( s! /usr/lib64/python2.7/threading.pyRH , s
c C s~ | j s t d n t } | j | j j | | j } z | d k rv | j | j d | n t | } d } x t
r| j d } | r Pn t | t | } | d k r Pn | r t | d | d } n | } t | } t | q W| sU| j d | | y | j j
| Wqht k
rQqhXn | j d | | Wd | j | Xd S(
sj 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 notifyAll() 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.
s cannot wait on un-acquired locks %s.wait(): got itgMb@?i i g?s %s.wait(%s): timed outs %s.wait(%s): got itN( RH R? R4 R; RN t appendRG R R, t _timeRS t mint _sleept removet
ValueErrorRF ( R t timeoutt balancingt waitert saved_statet endtimet delayt gotitt remaining( ( s! /usr/lib64/python2.7/threading.pyt wait5 s@
i c C s | j s t d n | j } | | } | sH | j d | d S| j d | | | d k ri d pl d x= | D]5 } | j y | j | Wqw t k
r qw Xqw Wd S( sK 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.
s! cannot notify on un-acquired locks %s.notify(): no waitersNs" %s.notify(): notifying %d waiter%si t st ( RH R? RN R, R@ RX RY ( R t nRN t waitersR\ ( ( s! /usr/lib64/python2.7/threading.pyt notifyy s
c C s | j t | j d S( s Wake 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( Rg RP RN ( R ( ( s! /usr/lib64/python2.7/threading.pyt notifyAll s N( R- R. RI R R! RJ RD R: RG RF RH RS Rb Rg Rh t
notify_all( ( ( s! /usr/lib64/python2.7/threading.pyRK s D c O s
t | | S( sO A factory function that returns a new semaphore.
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.
( t
_Semaphore( R* R3 ( ( s! /usr/lib64/python2.7/threading.pyR s Rj c B sA e Z d Z d d d Z d d Z e Z d Z d Z RS( s" 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.
i c C sJ | d k r t d n t j | | t t | _ | | _ d S( Ni s$ semaphore initial value must be >= 0( RY R R! R R t _Semaphore__condt _Semaphore__value( R t valueR ( ( s! /usr/lib64/python2.7/threading.pyR! s
c C s t } | j w xo | j d k rU | s, Pn | j d | | | j | j j q W| j d | _ | j d | | j t } Wd QX| S( s 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.
i s) %s.acquire(%s): blocked waiting, value=%si s %s.acquire: success, value=%sN( RR Rk Rl R, Rb RS ( R R< R> ( ( s! /usr/lib64/python2.7/threading.pyR; s
c C sG | j 8 | j d | _ | j d | | j | j j Wd QXd S( s 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.
i s %s.release: success, value=%sN( Rk Rl R, Rg ( R ( ( s! /usr/lib64/python2.7/threading.pyR@ s
c C s | j d S( N( R@ ( R RA RB RC ( ( s! /usr/lib64/python2.7/threading.pyRD s N( R- R. RI R R! R; RJ R@ RD ( ( ( s! /usr/lib64/python2.7/threading.pyRj s % c O s
t | | S( s A factory function that returns a new 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.
( t _BoundedSemaphore( R* R3 ( ( s! /usr/lib64/python2.7/threading.pyR s Rn c B s& e Z d Z d d d Z d Z RS( s 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.
i c C s t j | | | | | _ d S( N( Rj R! t _initial_value( R Rm R ( ( s! /usr/lib64/python2.7/threading.pyR!
s c C sQ | j B | j | j k r+ t d n | j d 7_ | j j Wd QXd S( s6 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.
s! Semaphore released too many timesi N( Rk Rl Ro RY Rg ( R ( ( s! /usr/lib64/python2.7/threading.pyR@ s
N( R- R. RI R R! R@ ( ( ( s! /usr/lib64/python2.7/threading.pyRn s c O s
t | | S( s A factory function that returns a new event.
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.
( t _Event( R* R3 ( ( s! /usr/lib64/python2.7/threading.pyR " s Rp c B sS e Z d Z d d Z d Z d Z e Z d Z d Z d e
d Z RS( s A factory function that returns a new event object. An event manages 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.
c C s/ t j | | t t | _ t | _ d S( N( R R! R R t _Event__condRR t _Event__flag( R R ( ( s! /usr/lib64/python2.7/threading.pyR! 5 s c C s | j j t d S( N( Rq R! R ( R ( ( s! /usr/lib64/python2.7/threading.pyt _reset_internal_locks: s c C s | j S( s5 Return true if and only if the internal flag is true.( Rr ( R ( ( s! /usr/lib64/python2.7/threading.pyt isSet> s c C s* | j t | _ | j j Wd QXd S( s Set the internal flag to true.
All threads waiting for the flag to become true are awakened. Threads
that call wait() once the flag is true will not block at all.
N( Rq RS Rr Ri ( R ( ( s! /usr/lib64/python2.7/threading.pyt setD s
c C s | j t | _ Wd QXd S( s Reset the internal flag to false.
Subsequently, threads calling wait() will block until set() is called to
set the internal flag to true again.
N( Rq RR Rr ( R ( ( s! /usr/lib64/python2.7/threading.pyt clearO s
c C s: | j + | j s) | j j | | n | j SWd QXd S( sH 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( Rq Rr Rb ( R RZ R[ ( ( s! /usr/lib64/python2.7/threading.pyRb Y s
N( R- R. RI R R! Rs Rt t is_setRu Rv RS Rb ( ( ( s! /usr/lib64/python2.7/threading.pyRp , s
s Thread-%dc C s | t S( N( t _counter( t template( ( s! /usr/lib64/python2.7/threading.pyt _newnamep s c B s= e Z d Z e Z e j Z e j Z d d d d d d d Z d Z e
d Z d Z d Z d Z d Z d Z d Z d
Z d Z d Z d e d
Z e
d Z e j d Z e
d Z d Z e Z e
d Z e j d Z d Z d Z! d Z" d Z# RS( sq A class that represents a thread of control.
This class can be safely subclassed in a limited fashion.
c C s | d k s t d t j | | | d k r= i } n | | _ t | pU t | _ | | _ | | _ | j
| _ d | _ t
| _ t | _ t t | _ t | _ t j | _ d S( sC 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.
s# group argument must be None for nowN( R t AssertionErrorR R! t _Thread__targett strRz t
_Thread__namet
_Thread__argst _Thread__kwargst _set_daemont _Thread__daemonict _Thread__identR t _Thread__startedRR t _Thread__stoppedR R t _Thread__blockRS t _Thread__initializedR& R' t _Thread__stderr( R t groupt targetR$ R* R3 R ( ( s! /usr/lib64/python2.7/threading.pyR! s c C s0 t | d r | j j n | j j d S( NR ( t hasattrR R! R Rs ( R ( ( s! /usr/lib64/python2.7/threading.pyRs s c C s | j S( N( R ( R ( ( s! /usr/lib64/python2.7/threading.pyt _block s c C s
t j S( N( R t daemon( R ( ( s! /usr/lib64/python2.7/threading.pyR s c C s | j s t d d } | j j r3 d } n | j rE d } n | j r[ | d 7} n | j d k r~ | d | j 7} n d | j j | j
| f S( Ns Thread.__init__() was not calledt initialt startedt stoppeds daemons %ss <%s(%s, %s)>( R R{ R Rw R R R R R8 R- R~ ( R t status( ( s! /usr/lib64/python2.7/threading.pyR: s
c C s | j s t d n | j j r6 t d n | j d | t | t | t wct limitt _dequet queue( R R ( ( s! /usr/lib64/python2.7/threading.pyR! s
c S s | j j x9 t | j | j k rH | j d | | j j q W| j j | | j d | t | j | j j
| j j d S( Ns put(%s): queue fulls put(%s): appended, length now %d( R R; RP R R R, R Rb RT R> Rg R@ ( R t item( ( s! /usr/lib64/python2.7/threading.pyt put s
c S s | j j x' | j s6 | j d | j j q W| j j } | j d | t | j | j j | j j
| S( Ns get(): queue emptys get(): got %s, %d left( R R; R R, R> Rb t popleftRP R Rg R@ ( R R ( ( s! /usr/lib64/python2.7/threading.pyt get s
( R- R. R! R R ( ( ( s! /usr/lib64/python2.7/threading.pyR s t ProducerThreadc B s e Z d Z d Z RS( c S s) t j | d d | | _ | | _ d S( NR$ t Producer( R R! R t quota( R R R ( ( s! /usr/lib64/python2.7/threading.pyR! s c S sh d d l m } d } xK | | j k rc | d } | j j d | j | f t | d q Wd S( Ni( t randomi i s %s.%dgh㈵>( R R R R R$ RW ( R R t counter( ( s! /usr/lib64/python2.7/threading.pyR s
( R- R. R! R ( ( ( s! /usr/lib64/python2.7/threading.pyR s t ConsumerThreadc B s e Z d Z d Z RS( c S s) t j | d d | | _ | | _ d S( NR$ t Consumer( R R! R R ( R R R ( ( s! /usr/lib64/python2.7/threading.pyR! s c S s> x7 | j d k r9 | j j } | GH| j d | _ q Wd S( Ni i ( R R R ( R R ( ( s! /usr/lib64/python2.7/threading.pyR s ( R- R. R! R ( ( ( s! /usr/lib64/python2.7/threading.pyR s i i i s Producer-%di gư>( R R t rangeR$ RT R RW R ( R R R t NPt QLt NIt Qt Pt iRA t C( ( s! /usr/lib64/python2.7/threading.pyt _test s(
t __main__(N RI t sysR& R t ImportErrorR R- t warningst collectionsR R t itertoolsR t _countR RU R RW t tracebackR R t __all__t start_new_threadR t
allocate_lockR4 t get_identR" t errort ThreadErrort filterwarningst DeprecationWarningRR R t objectR R R/ R1 R R R R
R2 R RK R Rj R Rn R Rp t nextRx Rz R R# R R R R R R R R R R R R R
R R t _shutdownR R t _threading_localR R ( ( ( s! /usr/lib64/python2.7/threading.pyt s
u
J
B
% R