a )(b1@sdZddlZddlZddlmZmZddlmZddlm Z m Z m Z Gddde Z Gd d d e ZGd d d ZGd ddZGdddZGdddeZGdddeZdS)z. Tests for L{twisted._threads._threadworker}. N) ThreadErrorlocal)SynchronousTestCase) AlreadyQuit LockWorker ThreadWorkerc@seZdZdZdS)FakeQueueEmptyz8 L{FakeQueue}'s C{get} has exhausted the queue. N__name__ __module__ __qualname____doc__rrFlib/python3.9/site-packages/twisted/_threads/test/test_threadworker.pyr sr c@seZdZdZdS) WouldDeadlockzf If this were a real lock, you'd be deadlocked because the lock would be double-acquired. Nr rrrrrsrc@s eZdZdZddZddZdS) FakeThreadz A fake L{threading.Thread}. @ivar target: A target function to run. @type target: L{callable} @ivar started: Has this thread been started? @type started: L{bool} cCs||_d|_dS)z7 Create a L{FakeThread} with a target. FN)targetstarted)selfrrrr__init__)szFakeThread.__init__cCs d|_dS)z) Set the "started" flag. TN)rrrrrstart0szFakeThread.startN)r r r rrrrrrrrs rc@s(eZdZdZddZddZddZdS) FakeQueuez A fake L{Queue} implementing C{put} and C{get}. @ivar items: A lit of items placed by C{put} but not yet retrieved by C{get}. @type items: L{list} cCs g|_dS)z( Create a L{FakeQueue}. N)itemsrrrrr@szFakeQueue.__init__cCs|j|dS)zv Put an item into the queue for later retrieval by L{FakeQueue.get}. @param item: any object N)rappend)ritemrrrputFsz FakeQueue.putcCs|js t|jdS)zR Get an item. @return: an item previously put by C{put}. r)rr poprrrrgetNsz FakeQueue.getN)r r r rrrrrrrrr7src@s(eZdZdZddZddZddZdS) FakeLockzi A stand-in for L{threading.Lock}. @ivar acquired: Whether this lock is presently acquired. cCs d|_dS)z9 Create a lock in the un-acquired state. FN)acquiredrrrrr`szFakeLock.__init__cCs|jr td|_dS)zX Acquire the lock. Raise an exception if the lock is already acquired. TN)r!rrrrracquirefszFakeLock.acquirecCs|js td|_dS)zf Release the lock. Raise an exception if the lock is not presently acquired. FN)r!rrrrrreleasenszFakeLock.releaseN)r r r rrr"r#rrrrr Ysr c@s(eZdZdZddZddZddZdS) ThreadWorkerTestsz$ Tests for L{ThreadWorker}. cs,g_t_fdd}t|j_dS)z4 Create a worker with fake threads. cs"t|d}|j||S)N)r)rr fakeThreadsr)rZ newThreadrrr startThreads  z,ThreadWorkerTests.setUp..startThreadN)r%rZ fakeQueuerworker)rr&rrrsetUp}s zThreadWorkerTests.setUpcsx|t|jd||jdjdfddd_|j|jd|t|jdj |jddS)z L{ThreadWorker} calls its C{createThread} callable to create a thread, its C{createQueue} callable to create a queue, and then the thread's target pulls work from that queue. rTcs d_dSNT)donerdoItrrr-sz@ThreadWorkerTests.test_startsThreadAndPerformsWork..doItFN) assertEquallenr%rr+r'do assertRaisesr rrrr,r test_startsThreadAndPerformsWorks  z2ThreadWorkerTests.test_startsThreadAndPerformsWorkcCs0|j|t|jj|t|jjtdS)z L{ThreadWorker.quit} causes future calls to L{ThreadWorker.do} and L{ThreadWorker.quit} to raise L{AlreadyQuit}. N)r'quitr1rr0listrrrrtest_quitPreventsFutureCallss z.ThreadWorkerTests.test_quitPreventsFutureCallsN)r r r rr(r2r5rrrrr$xsr$c@sHeZdZdZddZddZddZdd Zd d Zd d Z ddZ dS)LockWorkerTestsz" Tests for L{LockWorker}. cCs t}||t|jdS)ze The L{FakeLock} test fixture will alert us if there's a potential deadlock. N)r r"r1rrlockrrrtest_fakeDeadlocksz!LockWorkerTests.test_fakeDeadlockcCs>t}|t|j||d||t|jdS)zk The L{FakeLock} test fixture will alert us if there's a potential double-release. N)r r1rr#r"r.r7rrrtest_fakeDoubleReleases z&LockWorkerTests.test_fakeDoubleReleasecsbt}tt|}fddd_||jd|jd|jddS)zp L{LockWorker.do} immediately performs the work it's given, while the lock is acquired. csd_j_dSr*)r+r!rr8workrrr<sz@LockWorkerTests.test_doExecutesImmediatelyWithLock..workFTN)rr rr+r0r.r!)rZstorager'rr;r"test_doExecutesImmediatelyWithLocks  z2LockWorkerTests.test_doExecutesImmediatelyWithLockcsbtttggfddd_|ddg|ddgdS)z If L{LockWorker.do} is called recursively, it postpones the inner call until the outer one is complete. csNjd7_jjtdkr<jd8_dS)Nr)r)levelrr!r/r0rr!Zlevelsr8r<r'rrr<s     z6LockWorkerTests.test_doUnwindsReentrancy..workrr)TN)r rrr>r0r.rrr?rtest_doUnwindsReentrancys  z(LockWorkerTests.test_doUnwindsReentrancycCsnt}t|}t|t}d}||d|t| |d| t |j| t |j t dS)z L{LockWorker.quit} frees the resources associated with its lock and causes further calls to C{do} and C{quit} to fail. N)r weakrefrefrrZ assertIsNotr3gccollectassertIsr1rr0r4)rr8rBr'rrr test_quits  zLockWorkerTests.test_quitcstt}ttfddd_fddd_jdjdjddt  |ddS)z If L{LockWorker.quit} is invoked during a call to L{LockWorker.do}, all recursive work scheduled with L{LockWorker.do} will be completed and the lock will be released. cs,tjtd_dSr*)r0r3r1rr4completer)phase1phase2rr'rrrHs z5LockWorkerTests.test_quitWhileWorking..phase1Fcsd_j_dSr*)rGr!r)r8rIrrrI sz5LockWorkerTests.test_quitWhileWorking..phase2TN) r rArBrrrGr0r.r!rCrDrE)rrBr)r8rHrIrr'rtest_quitWhileWorkings   z%LockWorkerTests.test_quitWhileWorkingcCs2Gdddt}|tt}|t|jtdS)z If L{LockWorker.do} is called concurrently with L{LockWorker.quit}, and C{quit} wins the race before C{do} gets the lock attribute, then L{AlreadyQuit} will be raised. c@s&eZdZeddZejddZdS)zALockWorkerTests.test_quitWhileGettingLock..RacyLockWorkercSs||jdSN_lock)r3__dict__rrrrrL"szGLockWorkerTests.test_quitWhileGettingLock..RacyLockWorker._lockcSs||jd<dSrK)rM)rvaluerrrrL'sN)r r r propertyrLsetterrrrrRacyLockWorker!s rQN)rr rr1rr0r4)rrQr'rrrtest_quitWhileGettingLocks z)LockWorkerTests.test_quitWhileGettingLockN) r r r rr9r:r=r@rFrJrRrrrrr6s  r6)rrCrAZ threadingrrZtwisted.trial.unittestrrrr Exceptionr rrrr r$r6rrrrs "0