线程池汇总2

上篇(线程池汇总1)：http://1181731633.iteye.com/admin/blogs/2342551

线程池的源码实现：

一、线程池基类ThreadPoolExecutor：

1）看下其成员变量：

 

    private final BlockingQueue<Runnable> workQueue;//任务队列，工作线程从这里拿任务执行  
    private final ReentrantLock mainLock = new ReentrantLock();  
    /** 
     * Set containing all worker threads in pool. Accessed only when 
     * holding mainLock. 
     */  
    private final HashSet<Worker> workers = new HashSet<Worker>();//工作线程(执行任务可理解为线程take()取队列任务,无则阻塞)，就是初始化的时候有多少个同时工作的线程  
    private final Condition termination = mainLock.newCondition();  
    private int largestPoolSize;//  
    private long completedTaskCount;//完成的任务数  
    private volatile ThreadFactory threadFactory;  
  
    /** 
     * Handler called when saturated or shutdown in execute. 
     */  
    private volatile RejectedExecutionHandler handler;  
  
    /** 
     * Timeout in nanoseconds for idle threads waiting for work. 
     * Threads use this timeout when there are more than corePoolSize 
     * present or if allowCoreThreadTimeOut. Otherwise they wait 
     * forever for new work. 
     */  
    private volatile long keepAliveTime;  
  
    /** 
     * If false (default), core threads stay alive even when idle. 
     * If true, core threads use keepAliveTime to time out waiting 
     * for work. 
     */  
    private volatile boolean allowCoreThreadTimeOut;  
  
    /** 
     * Core pool size is the minimum number of workers to keep alive 
     * (and not allow to time out etc) unless allowCoreThreadTimeOut 
     * is set, in which case the minimum is zero. 
     */  
    private volatile int corePoolSize;  
  
    /** 
     * Maximum pool size. Note that the actual maximum is internally 
     * bounded by CAPACITY. 
     */  
    private volatile int maximumPoolSize;
    final void runWorker(Worker w) {
        Thread wt = Thread.currentThread();
        Runnable task = w.firstTask;
        w.firstTask = null;
        w.unlock(); // allow interrupts
        boolean completedAbruptly = true;
        try {
            while (task != null || (task = getTask()) != null) {
                w.lock();
                // If pool is stopping, ensure thread is interrupted;
                // if not, ensure thread is not interrupted.  This
                // requires a recheck in second case to deal with
                // shutdownNow race while clearing interrupt
                if ((runStateAtLeast(ctl.get(), STOP) ||
                     (Thread.interrupted() &&
                      runStateAtLeast(ctl.get(), STOP))) &&
                    !wt.isInterrupted())
                    wt.interrupt();
                try {
                    beforeExecute(wt, task);
                    Throwable thrown = null;
                    try {
                        task.run();
                    } catch (RuntimeException x) {
                        thrown = x; throw x;
                    } catch (Error x) {
                        thrown = x; throw x;
                    } catch (Throwable x) {
                        thrown = x; throw new Error(x);
                    } finally {
                        afterExecute(task, thrown);
                    }
                } finally {
                    task = null;
                    w.completedTasks++;
                    w.unlock();
                }
            }
            completedAbruptly = false;
        } finally {
            processWorkerExit(w, completedAbruptly);
        }
    }
    private Runnable getTask() {
        boolean timedOut = false; // Did the last poll() time out?

        for (;;) {
            int c = ctl.get();
            int rs = runStateOf(c);

            // Check if queue empty only if necessary.
            if (rs >= SHUTDOWN && (rs >= STOP || workQueue.isEmpty())) {
                decrementWorkerCount();
                return null;
            }

            int wc = workerCountOf(c);

            // Are workers subject to culling?
            boolean timed = allowCoreThreadTimeOut || wc > corePoolSize;

            if ((wc > maximumPoolSize || (timed && timedOut))
                && (wc > 1 || workQueue.isEmpty())) {
                if (compareAndDecrementWorkerCount(c))
                    return null;
                continue;
            }

            try {
                Runnable r = timed ?
                    workQueue.poll(keepAliveTime, TimeUnit.NANOSECONDS) :
                    workQueue.take();//调用线程池子类的自定义队列的take()方法
                if (r != null)
                    return r;
                timedOut = true;
            } catch (InterruptedException retry) {
                timedOut = false;
            }
        }
    }

 

 

 

 2）看下Worker的代码：

        public void run() {
            runWorker(this);
        }

 

 3）此类常用来创建线程池有两种()：主要是最大线程数和任务队列不同。

public static ExecutorService newFixedThreadPool(int arg) {  
      return new ThreadPoolExecutor(arg, arg, 0L, TimeUnit.MILLISECONDS, new LinkedBlockingQueue());  
   }  

 

核心线程数为0，最大线程数为Integer最大值，队列比较特殊

public static ExecutorService newCachedThreadPool() {  
      return new ThreadPoolExecutor(0, Integer.MAX_VALUE, 60L, TimeUnit.SECONDS, new SynchronousQueue());  
   }  

 

 二、ScheduledThreadPoolExecutor类：

1）构造方法和提交线程任务方法：

    public ScheduledThreadPoolExecutor(int corePoolSize) {
        super(corePoolSize, Integer.MAX_VALUE, 0, NANOSECONDS,
              new DelayedWorkQueue());
    }
    public ScheduledFuture<?> schedule(Runnable command,
                                       long delay,
                                       TimeUnit unit) {
        if (command == null || unit == null)
            throw new NullPointerException();
        RunnableScheduledFuture<?> t = decorateTask(command,
            new ScheduledFutureTask<Void>(command, null,
                                          triggerTime(delay, unit)));
        delayedExecute(t);
        return t;
    }

 2）ScheduledFutureTask的实现：

    private class ScheduledFutureTask<V>
            extends FutureTask<V> implements RunnableScheduledFuture<V> {

        /** Sequence number to break ties FIFO */
        private final long sequenceNumber;

        /** The time the task is enabled to execute in nanoTime units */
        private long time;
        private final long period;
        RunnableScheduledFuture<V> outerTask = this;
        public void run() {
            boolean periodic = isPeriodic();//是否周期性任务
            if (!canRunInCurrentRunState(periodic))
                cancel(false);
            else if (!periodic)
                ScheduledFutureTask.super.run();
            else if (ScheduledFutureTask.super.runAndReset()) {
                setNextRunTime();//重置时间
                reExecutePeriodic(outerTask);//重新放入队列
            }
        }
        private void setNextRunTime() {
            long p = period;
            if (p > 0)
                time += p;
            else
                time = triggerTime(-p);
        }
    }

 3）DelayedWorkQueue队列：

 

    static class DelayedWorkQueue extends AbstractQueue<Runnable>
        implements BlockingQueue<Runnable> {

        /*
         * A DelayedWorkQueue is based on a heap-based data structure
         * like those in DelayQueue and PriorityQueue, except that
         * every ScheduledFutureTask also records its index into the
         * heap array. This eliminates the need to find a task upon
         * cancellation, greatly speeding up removal (down from O(n)
         * to O(log n)), and reducing garbage retention that would
         * otherwise occur by waiting for the element to rise to top
         * before clearing. But because the queue may also hold
         * RunnableScheduledFutures that are not ScheduledFutureTasks,
         * we are not guaranteed to have such indices available, in
         * which case we fall back to linear search. (We expect that
         * most tasks will not be decorated, and that the faster cases
         * will be much more common.)
         *
         * All heap operations must record index changes -- mainly
         * within siftUp and siftDown. Upon removal, a task's
         * heapIndex is set to -1. Note that ScheduledFutureTasks can
         * appear at most once in the queue (this need not be true for
         * other kinds of tasks or work queues), so are uniquely
         * identified by heapIndex.
         */

        private static final int INITIAL_CAPACITY = 16;
        private RunnableScheduledFuture<?>[] queue =
            new RunnableScheduledFuture<?>[INITIAL_CAPACITY];
        private final ReentrantLock lock = new ReentrantLock();
        private int size = 0;

        /**
         * Thread designated to wait for the task at the head of the
         * queue.  This variant of the Leader-Follower pattern
         * (http://www.cs.wustl.edu/~schmidt/POSA/POSA2/) serves to
         * minimize unnecessary timed waiting.  When a thread becomes
         * the leader, it waits only for the next delay to elapse, but
         * other threads await indefinitely.  The leader thread must
         * signal some other thread before returning from take() or
         * poll(...), unless some other thread becomes leader in the
         * interim.  Whenever the head of the queue is replaced with a
         * task with an earlier expiration time, the leader field is
         * invalidated by being reset to null, and some waiting
         * thread, but not necessarily the current leader, is
         * signalled.  So waiting threads must be prepared to acquire
         * and lose leadership while waiting.
         */
        private Thread leader = null;
        private final Condition available = lock.newCondition();
        //取最小时间定时线程任务
        public RunnableScheduledFuture<?> take() throws InterruptedException {
            final ReentrantLock lock = this.lock;
            lock.lockInterruptibly();
            try {
                for (;;) {//循环，直到获取到元素为止
                    RunnableScheduledFuture<?> first = queue[0];
                    if (first == null)
                        available.await();
                    else {
                        long delay = first.getDelay(NANOSECONDS);
                        if (delay <= 0)
                            return finishPoll(first);//定时任务时间到，返回任务执行，并将数组最后一个元素放到队列头，然后依次与两个字节点进行比较，首先与根节点两个子节点[数组坐标1和2]比较，并与最小的交换位置，将之移到队列头，依然类推，在根节点的其中一个分支比较到底(用k<size >>> 1限制)。
                        first = null; // don't retain ref while waiting
                        if (leader != null)
                            available.await();
                        else {
                            Thread thisThread = Thread.currentThread();
                            leader = thisThread;
                            try {
                                available.awaitNanos(delay);//等待相应线程的定时时间
                            } finally {
                                if (leader == thisThread)
                                    leader = null;
                            }
                        }
                    }
                }
            } finally {
                if (leader == null && queue[0] != null)
                    available.signal();
                lock.unlock();
            }
        }
        private RunnableScheduledFuture<?> finishPoll(RunnableScheduledFuture<?> f) {
            int s = --size;
            RunnableScheduledFuture<?> x = queue[s];
            queue[s] = null;
            if (s != 0)
                siftDown(0, x);
            setIndex(f, -1);
            return f;
        }
        private void siftDown(int k, RunnableScheduledFuture<?> key) {
            int half = size >>> 1;
            while (k < half) {//在根节点[数组坐标0]的其中一个分支比较到底
                int child = (k << 1) + 1;
                RunnableScheduledFuture<?> c = queue[child];
                int right = child + 1;//每个父节点有两个子节点，两个子节点的大小不确定，所以都需要比较一下
                if (right < size && c.compareTo(queue[right]) > 0)
                    c = queue[child = right];
                if (key.compareTo(c) <= 0)
                    break;
                queue[k] = c;
                setIndex(c, k);
                k = child;
            }
            queue[k] = key;
            setIndex(key, k);
        }

        //新增一个线程任务
        public boolean offer(Runnable x) {
            if (x == null)
                throw new NullPointerException();
            RunnableScheduledFuture<?> e = (RunnableScheduledFuture<?>)x;
            final ReentrantLock lock = this.lock;
            lock.lock();
            try {
                int i = size;
                if (i >= queue.length)
                    grow();
                size = i + 1;
                if (i == 0) {
                    queue[0] = e;
                    setIndex(e, 0);//如果只有一个元素，放在首位就行了
                } else {
                    siftUp(i, e);//比较时间大小并插入数组
                }
                if (queue[0] == e) {
                    leader = null;
                    available.signal();
                }
            } finally {
                lock.unlock();
            }
            return true;
        }
        /**先将元素放到数组的末尾，并不断与自己的父节点比较并交换位置，直到找到合适位置
         * Sifts element added at bottom up to its heap-ordered spot.
         * Call only when holding lock.
         */
        private void siftUp(int k, RunnableScheduledFuture<?> key) {
            while (k > 0) {
                int parent = (k - 1) >>> 1;//二叉树时间排序值末尾的最大分支的父节点
                RunnableScheduledFuture<?> e = queue[parent];
                if (key.compareTo(e) >= 0)
                    break;//大于父节点的值，则找到了真正的位置，返回
                queue[k] = e;
                setIndex(e, k);//小于父节点的值，和父节点调换位置
                k = parent;
            }
            queue[k] = key;
            setIndex(key, k);
        }

 

二叉树特性(参考其他文章的描述)：

任意结点的子节点的索引位置是其本身索引位置乘2后+1，比如，元素2的子节点是2*2+1=5

任意结点的父节点的索引位置是该结点的索引位置-1后除2并向下取整，比如6的子节点是(6-1)/2 = 2

其中，这里的二叉树与数组坐标对应如下：

假设数组坐标分别为[0,1,2,3,4,5,6]

 三、