File: //proc/2/task/2/root/usr/lib/python2.4/Demo/metaclasses/Synch.pyo
mò
‚=5Dc @ sÄ d Z d k Z d f d „ ƒ YZ d „ Z d k l Z l Z l Z d e f d „ ƒ YZ d e f d „ ƒ YZ d
e f d „ ƒ YZ
e
d f h ƒ Z d
„ Z e
d j o e ƒ e ƒ n d S( s` Synchronization metaclass.
This metaclass makes it possible to declare synchronized methods.
Nt Lockc B s, t Z d Z d „ Z d d „ Z d „ Z RS( s Reentrant lock.
This is a mutex-like object which can be acquired by the same
thread more than once. It keeps a reference count of the number
of times it has been acquired by the same thread. Each acquire()
call must be matched by a release() call and only the last
release() call actually releases the lock for acquisition by
another thread.
The implementation uses two locks internally:
__mutex is a short term lock used to protect the instance variables
__wait is the lock for which other threads wait
A thread intending to acquire both locks should acquire __wait
first.
The implementation uses two other instance variables, protected by
locking __mutex:
__tid is the thread ID of the thread that currently has the lock
__count is the number of times the current thread has acquired it
When the lock is released, __tid is None and __count is zero.
c C s4 t i ƒ | _ t i ƒ | _ d | _ d | _ d S( s0 Constructor. Initialize all instance variables.i N( t threadt
allocate_lockt selft _Lock__mutext _Lock__waitt Nonet
_Lock__tidt _Lock__count( R ( ( t, /usr/lib/python2.4/Demo/metaclasses/Synch.pyt __init__* s
i c C s¼ | i i ƒ z2 | i t i ƒ j o | i d | _ d Sn Wd | i i ƒ X| i i | ƒ } | o | o d Sn z- | i i ƒ t i ƒ | _ d | _ d SWd | i i ƒ Xd S( s} Acquire the lock.
If the optional flag argument is false, returns immediately
when it cannot acquire the __wait lock without blocking (it
may still block for a little while in order to acquire the
__mutex lock).
The return value is only relevant when the flag argument is
false; it is 1 if the lock is acquired, 0 if not.
i Ni ( R R t acquireR R t get_identR t releaseR t flagt locked( R R R ( ( R R 1 s(
c C s` | i i ƒ z> | i d | _ | i d j o d | _ | i i ƒ n Wd | i i ƒ Xd S( sì Release the lock.
If this thread doesn't currently have the lock, an assertion
error is raised.
Only allow another thread to acquire the lock when the count
reaches zero after decrementing it.
i i N( R R R R R R R R
( R ( ( R R
Q s
( t __name__t
__module__t __doc__R
R R
( ( ( R R
s c C sö g } | d „ } | | d „ } t ƒ } | i ƒ | | ƒ | i ƒ | i ƒ t i | | f ƒ t i | | | f ƒ t i | | f ƒ t i | | f ƒ | i ƒ d k } x0 t
| ƒ d j o t
| ƒ GH| i d ƒ q· Wt
| ƒ GHd S( Nc C s3 | i ƒ d t i ƒ G| i ƒ | i d ƒ d S( Ns f2 running in thread %d
i ( t lockR R R R
t donet append( R R ( ( R t f2k s
c C sE | i ƒ d t i ƒ Gz | | ƒ Wd | i ƒ X| i d ƒ d S( Ns f1 running in thread %d
i ( R R R R R R
R R ( R R R ( ( R t f1q s
i f0.001( R R R R R R R
R t start_new_threadt timet lent sleep( R R R R R ( ( R t _testLockg s&
( s MetaClasss
MetaHelpers MetaMethodWrappert LockingMethodWrapperc B s t Z d „ Z RS( Nc O s’ | i d d j o5 | i d d j o! t | i | i f | | ƒ Sn | i i i ƒ z! t | i | i f | | ƒ SWd | i i i ƒ Xd S( Ni t _(
R R t applyt funct instt argst kwt __lock__R R
( R R" R# ( ( R t __call__• s (!! ( R R R% ( ( ( R R ” s t
LockingHelperc B s t Z e Z d „ Z RS( Nc C s t i | | ƒ t ƒ | _ d S( N( t
MetaHelpert __helperinit__R t formalclassR R$ ( R R) ( ( R R( s ( R R R t __methodwrapper__R( ( ( ( R R& ž s t LockingMetaClassc B s t Z e Z RS( N( R R R& t
__helper__( ( ( R R+ ¤ s t Lockingc C sÒ d t f d „ ƒ Y} d d „ } d d „ } t i ƒ } | i ƒ t i ƒ } | i ƒ | d ƒ } d } t i | | | | f ƒ t i | | | | f ƒ | i ƒ d GH| i ƒ d GHd Gt | i ƒ GHd S(
Nt Bufferc B s# t Z d „ Z d „ Z d „ Z RS( Nc C s0 | | _ d g | i | _ d | _ | _ d S( Ni ( t initialsizeR t sizeR t buffert firstt last( R R/ ( ( R R
¬ s c C sP | i d | i | i j o/ | | i | i <| i d | i | _ d Sn d G| i GHd | i | i | i f GH| i | i j o | i | i | i !} n | i | i | i | i } d G| GH| d g | i d | _ d | _ | i d | _ | i d | _ d G| i GHd G| i GHd | i | i | i f GH| i | ƒ d S( Ni s buffer =s first = %d, last = %d, size = %ds temp =i i s Buffer size doubled tos new buffer =( R R3 R0 R2 t itemR1 t tempR t put( R R4 R5 ( ( R R6 ± s$ c C sH | i | i j o
t ‚ n | i | i } | i d | i | _ | S( Ni ( R R2 R3 t EOFErrorR1 R4 R0 ( R R4 ( ( R t getË s
( R R R
R6 R8 ( ( ( R R. « s iè c C s_ d k } d } x2 | | j o$ d G| GH| i | ƒ | d } q Wd G| Gd GH| i ƒ d S( Ni R6 i s Producer: done producingt items( R t it nR1 R6 t waitR
( R1 R< R; R: R ( ( R t producerÓ s
c C s¿ d k } d } d } xŒ | | j o~ yM | i ƒ } | | j o t d | | f ‚ n d G| GH| d } d } Wq t j
o | i | ƒ | d } q Xq Wd G| Gd GH| i ƒ d S( Ni f0.001s get() returned %s, expected %st goti i s Consumer: done consumingR9 ( R R: t toutR; R1 R8 t xt AssertionErrorR7 R R< R
( R1 R< R; R: R? R R@ ( ( R t consumerÝ s"
i s
Producer dones All dones buffer size ==(
R- R. R= RB R R t pwaitR t cwaitR1 R; R R ( R= R. RC R; R1 RD RB ( ( R t _test© s (
t __main__( R R R R t Metat MetaClassR' t MetaMethodWrapperR R& R+ R- RE R ( R& R R RE R- R+ R' R RI R RH ( ( R t ? s Z +
U