java锁分析

公平锁与非公平锁

概念

公平锁:多个线程按照申请锁的顺序来获取锁，类似排队打饭，先来后到．

非公平锁:多个线程获取锁的顺序并不是按照申请锁的顺序，有可能后申请的线程比先申请的线程优先获取锁，在高并发的情况下，有可能出现优先级反转或饥饿的现象

公平锁:ReentrantLock设置为true为公平锁

非公平锁:ReentrantLock默认非公平锁,synchronized

区别

• ReentrantLock的创建,可以指定构造函数的boolean类型来得到公平锁和非公平锁,默认非公平锁

• 非公平锁的吞吐量比公平锁大

公平锁

在并发环境中,每个线程获得锁时会先查看锁维护的等待队列,如果为空,或者当前线程是等待队列的第一个,就占有锁,否则就会加入到等待对列中,以后会按照FIFO(先进先出)的规则从队列中取到自己

非公平锁

上来直接尝试占有锁,如果尝试失败,就采用类似公平锁的那种方式.

 //非公平锁
 final boolean nonfairTryAcquire(int acquires) {
     final Thread current = Thread.currentThread();
     int c = getState();
     if (c == 0) {
         //区别重点看这里
         if (compareAndSetState(0, acquires)) {
             setExclusiveOwnerThread(current);
             return true;
         }
     }
     else if (current == getExclusiveOwnerThread()) {
         int nextc = c + acquires;
         if (nextc < 0) // overflow
             throw new Error("Maximum lock count exceeded");
         setState(nextc);
         return true;
     }
     return false;
 }

  //公平锁
  protected final boolean tryAcquire(int acquires) {
      final Thread current = Thread.currentThread();
      int c = getState();
      if (c == 0) {
          //hasQueuedPredecessors这个方法就是最大区别所在
          if (!hasQueuedPredecessors() &&
              compareAndSetState(0, acquires)) {
              setExclusiveOwnerThread(current);
              return true;
          }
      }
      else if (current == getExclusiveOwnerThread()) {
          int nextc = c + acquires;
          if (nextc < 0)
              throw new Error("Maximum lock count exceeded");
          setState(nextc);
          return true;
      }
      return false;
  }

可重入锁

可重入锁(递归锁)

概念

指的是同一个线程外层函数获得锁之后,内层递归函数仍然能获取该锁的代码,在同一个线程在外层方法获取锁的时候,在进入内层方法会自动获取锁.

也就是说,线程可以进入任何一个他已经拥有的锁所同步着的代码块.

synchronized和ReentrantLock都是可重入锁

可重入锁最大的作用是避免死锁

代码

package top.ygy.thread;

import java.util.concurrent.locks.ReentrantLock;

/**
 * @Description: TODO(可重入锁示例)
 * @author yangguangyuan
 * @date 2019年6月18日 
 * synchronized和ReentrantLock都是可重入锁
 * 
 * ynchronized 示例一 
 * ReentrantLock 示例二
 * 
 * lock和unlock成对即可
 */
class Phone implements Runnable {

	public synchronized void sendSMS() {
		System.out.println(Thread.currentThread().getId() + "\t invoked sendSMS");
		sendEmail();
	}

	public synchronized void sendEmail() {
		System.out.println(Thread.currentThread().getId() + "\t invoked sendEmail");
	}

	ReentrantLock lock = new ReentrantLock();
	@Override
	public void run() {
		get();
	}

	public void get() {
		try {
			lock.lock();
			System.out.println(Thread.currentThread().getId() + "\t invoked get");
			set();
		} catch (Exception e) {
		} finally {
			lock.unlock();
		}
	}

	public void set() {
		try {
			lock.lock();
			System.out.println(Thread.currentThread().getId() + "\t invoked set");
		} catch (Exception e) {
		} finally {
			lock.unlock();
		}
	}
}

public class ReentrantLockDemo {

	public static void main(String[] args) {
		Phone phone = new Phone();

		new Thread(() -> {
			phone.sendSMS();
		}).start();

		new Thread(() -> {
			phone.sendSMS();
		}).start();

		Thread t3 = new Thread(phone);
		Thread t4 = new Thread(phone);
		t3.start();
		t4.start();
	}

}

不可重入锁

概念

所谓不可重入锁，即若当前线程执行某个方法已经获取了该锁，那么在方法中尝试再次获取锁时，就会获取不到被阻塞.

代码

试设计一个不可重入锁：

public class Lock{
    private boolean isLocked = false;
    public synchronized void lock() throws InterruptedException{
        while(isLocked){    
            wait();
        }
        isLocked = true;
    }
    public synchronized void unlock(){
        isLocked = false;
        notify();
    }
}

使用该锁：

public class Count{
    Lock lock = new Lock();
    public void print(){
        lock.lock();
        doAdd();
        lock.unlock();
    }
    public void doAdd(){
        lock.lock();
        //do something
        lock.unlock();
    }
}

自旋锁

概念

是指尝试获取锁的线程不会立即阻塞,而是采用循环的方式去尝试获取锁,这样的好处是减少线程上下文的切换,缺点是循环会消耗cpu

 public final int getAndAddInt(Object paramObject, long paramLong, int paramInt)
  {
    int i;
    do
      i = getIntVolatile(paramObject, paramLong);
    while (!compareAndSwapInt(paramObject, paramLong, i, i + paramInt));
    return i;
  }

代码

package top.ygy.thread;

import java.util.concurrent.TimeUnit;
import java.util.concurrent.atomic.AtomicReference;

/**
 * @Description: TODO(自旋锁示例)
 * @author yangguangyuan
 * @date 2019年6月18日
 *
 */
public class SpinLockDemo {

	AtomicReference atomicReference = new AtomicReference();
	
	public void mylock() {
		Thread thread = Thread.currentThread();
		System.out.println(Thread.currentThread().getName()+"\t mylock");
		while(!atomicReference.compareAndSet(null, thread)) {
			
		}
		
		
	}
	
	public void unlock() {
		Thread thread = Thread.currentThread();
		atomicReference.compareAndSet(thread, null);
		System.out.println(Thread.currentThread().getName()+"\t unlock");
	}
	
	public static void main(String[] args) {
		SpinLockDemo spinLockDemo = new SpinLockDemo();
		new Thread(()->{
			spinLockDemo.mylock();
			try {
				TimeUnit.SECONDS.sleep(5);
			} catch (InterruptedException e) {
				e.printStackTrace();
			}
			spinLockDemo.unlock();
		},"AA") .start();
		
		try {
			TimeUnit.SECONDS.sleep(1);
		} catch (InterruptedException e) {
			e.printStackTrace();
		}
		
		new Thread(()->{
			spinLockDemo.mylock();
			spinLockDemo.unlock();
		},"BB") .start();
	}
}

读写锁

概念

独占锁:指该锁一次只能被一个线程所持有.(ReentrantLock和synchronized都是独占锁)

共享锁:指该锁可被多个线程所持有

ReentrantReadWriteLock读锁是共享锁,写锁是独锁

读锁的共享锁可保证并发读是非常高效的,读写,写读,写写的过程是互斥的.

代码

package top.ygy.thread;

import java.util.HashMap;
import java.util.Map;
import java.util.concurrent.TimeUnit;
import java.util.concurrent.locks.ReentrantReadWriteLock;

class MyCache {
	private volatile Map<String, Object> map = new HashMap<>();
	ReentrantReadWriteLock rwLock = new ReentrantReadWriteLock();
	
	public void put(String key, Object value) {
		rwLock.writeLock().lock();
		try {
			System.out.println(Thread.currentThread().getName() + "\t 正在写入: " + key);
			try {
				TimeUnit.MILLISECONDS.sleep(300);
			} catch (InterruptedException e) {
				e.printStackTrace();
			}

			map.put(key, value);
			System.out.println(Thread.currentThread().getName() + "\t 写入完成:");
		} catch (Exception e) {
			e.printStackTrace();
		}finally {
			rwLock.writeLock().unlock();
		}
	}

	public void get(String key) {
		rwLock.readLock().lock();
		try {
			System.out.println(Thread.currentThread().getName() + "\t 正在读取:");
			try {
				TimeUnit.MILLISECONDS.sleep(300);
			} catch (InterruptedException e) {
				e.printStackTrace();
			}
			Object result = map.get(key);
			System.out.println(Thread.currentThread().getName() + "\t 读取完成:" + result);
		} catch (Exception e) {
			e.printStackTrace();
		}finally {
			rwLock.readLock().unlock();
		}
	}
}

/**
 * @Description: TODO(读写锁示例)
 * @author yangguangyuan
 * @date 2019年6月19日
 *
 *       多线程同时读一个资源没有任何问题,所以为了满足并发量,读取共享资源应该可以同时进行.
 *       但是,如果有一个线程想去写共享资源,就不应该有其他线程可以对该资源进行读或写
 * 
 *       读-读共存 读-写不能共存 写-写不能共存
 */
public class ReadWriteLockDemo {

	public static void main(String[] args) {
		MyCache myCache = new MyCache();

		for (int i = 0; i < 5; i++) {
			final int tempInt = i;
			new Thread(() -> {
				myCache.put(tempInt+"", tempInt+"");
			},String.valueOf(i)).start();
		}
		
		for (int i = 0; i < 5; i++) {
			final int tempInt = i;
			new Thread(() -> {
				myCache.get(tempInt+"");
			},String.valueOf(i)).start();
		}
	}
}

参考:Java不可重入锁和可重入锁理解