- Sort Score
- Result 10 results
- Languages All
Results 1 - 3 of 3 for LockB (0.14 sec)
-
android/guava-tests/test/com/google/common/util/concurrent/CycleDetectingLockFactoryTest.java
lockA.lock(); } // Tests transitive deadlock detection. public void testDeadlock_threeLocks() { // Establish an ordering from lockA -> lockB. lockA.lock(); lockB.lock(); lockB.unlock(); lockA.unlock(); // Establish an ordering from lockB -> lockC. lockB.lock(); lockC.lock(); lockB.unlock(); // lockC -> lockA should fail.
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Wed Sep 06 17:04:31 GMT 2023 - 16.1K bytes - Viewed (1) -
guava-tests/test/com/google/common/util/concurrent/CycleDetectingLockFactoryTest.java
lockA.lock(); } // Tests transitive deadlock detection. public void testDeadlock_threeLocks() { // Establish an ordering from lockA -> lockB. lockA.lock(); lockB.lock(); lockB.unlock(); lockA.unlock(); // Establish an ordering from lockB -> lockC. lockB.lock(); lockC.lock(); lockB.unlock(); // lockC -> lockA should fail.
Java - Registered: Fri Apr 12 12:43:09 GMT 2024 - Last Modified: Wed Sep 06 17:04:31 GMT 2023 - 16.1K bytes - Viewed (0) -
android/guava/src/com/google/common/util/concurrent/CycleDetectingLockFactory.java
* * <pre> * Thread1: acquire(LockA) --X acquire(LockB) * Thread2: acquire(LockB) --X acquire(LockA) * </pre> * * <p>Neither thread will progress because each is waiting for the other. In more complex * applications, cycles can arise from interactions among more than 2 locks: * * <pre> * Thread1: acquire(LockA) --X acquire(LockB) * Thread2: acquire(LockB) --X acquire(LockC) * ...
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Fri Dec 15 19:31:54 GMT 2023 - 35.9K bytes - Viewed (0)