zoukankan      html  css  js  c++  java
  • 死锁与递归锁


    from threading import Thread,Lock import time mutexA=Lock() mutexB=Lock() class MyThread(Thread): def run(self): self.func1() self.func2() def func1(self): mutexA.acquire() print('33[41m%s 拿到A锁33[0m' %self.name) mutexB.acquire() print('33[42m%s 拿到B锁33[0m' %self.name) mutexB.release() mutexA.release() def func2(self): mutexB.acquire() print('33[43m%s 拿到B锁33[0m' %self.name) time.sleep(2) mutexA.acquire() print('33[44m%s 拿到A锁33[0m' %self.name) mutexA.release() mutexB.release() if __name__ == '__main__': for i in range(10): t=MyThread() t.start()

      死锁↑    递归锁↓

    from threading import Lock,Thread,RLock
    import time
    mutexB=mutexA=RLock()       #同一把锁锁
    class MyThread(Thread):
        def run(self):
            self.f1()
            self.f2()
        def f1(self):
            mutexA.acquire()
            print('拿到A锁',self.name)
            mutexB.acquire()
            print('拿到B锁',self.name)
            mutexB.release()
            mutexA.release()
        def f2(self):
            mutexB.acquire()
            print('拿到B锁', self.name)
            mutexA.acquire()
            print('拿到A锁', self.name)
            mutexA.release()
            mutexB.release()
    if __name__ == '__main__':
        for i in range(10):
            t = MyThread()
            t.start()
    

      

  • 相关阅读:
    Splay复习
    带权并查集复习-HDU3038
    罗素悖论-图灵停机问题
    数独解法c++实现
    状压DP NOI2001 炮兵阵地
    区间第k大数
    分块随笔T2
    分块感想
    webkit的高级属性
    设计模式
  • 原文地址:https://www.cnblogs.com/52-qq/p/7453148.html
Copyright © 2011-2022 走看看