/* * Written by Doug Lea with assistance from members of JCP JSR-166 * Expert Group and released to the public domain. Use, modify, and * redistribute this code in any way without acknowledgement. */ package java.util.concurrent; import java.util.concurrent.locks.*; import java.util.*; /** * An {@link ExecutorService} that executes each submitted task on one * of several pooled threads. * *

Thread pools address two different problems at the same time: * they usually provide improved performance when executing large * numbers of asynchronous tasks, due to reduced per-task invocation * overhead, and they provide a means of bounding and managing the * resources, including threads, consumed in executing a collection of * tasks. * *

This class is very configurable and can be configured to create * a new thread for each task, or even to execute tasks sequentially * in a single thread, in addition to its most common configuration, * which reuses a pool of threads. * *

To be useful across a wide range of contexts, this class * provides many adjustable parameters and extensibility hooks. * However, programmers are urged to use the more convenient factory * methods newCachedThreadPool (unbounded thread pool, with * automatic thread reclamation), newFixedThreadPool (fixed * size thread pool), newSingleThreadPoolExecutor (single * background thread for execution of tasks), and * newThreadPerTaskExeceutor (execute each task in a new * thread), that preconfigure settings for the most common usage * scenarios. * *

This class also maintain some basic statistics, such as the * number of completed tasks, that may be useful for monitoring and * tuning executors. * *

Tuning guide

*
* *
Core and maximum pool size
* *
A ThreadPoolExecutor will automatically adjust the pool size * according to the bounds set by corePoolSize and maximumPoolSize. * When a new task is submitted, and fewer than corePoolSize threads * are running, a new thread is created to handle the request, even if * other worker threads are idle. If there are more than the * corePoolSize but less than maximumPoolSize threads running, a new * thread will be created only if the queue is full. By setting * corePoolSize and maximumPoolSize the same, you create a fixed-size * thread pool.
* *
Keep-alive
* *
The keepAliveTime determines what happens to idle threads. If * the pool currently has more than the core number of threads, excess * threads will be terminated if they have been idle for more than the * keepAliveTime.
* *
Queueing
* *
You are free to specify the queuing mechanism used to handle * submitted tasks. A good default is to use queueless synchronous * channels to to hand off work to threads. This is a safe, * conservative policy that avoids lockups when handling sets of * requests that might have internal dependencies. Using an unbounded * queue (for example a LinkedBlockingQueue) which will cause new * tasks to be queued in cases where all corePoolSize threads are * busy, so no more that corePoolSize threads will be craated. This * may be appropriate when each task is completely independent of * others, so tasks cannot affect each others execution. For example, * in an http server. When given a choice, this pool always prefers * adding a new thread rather than queueing if there are currently * fewer than the current getCorePoolSize threads running, but * otherwise always prefers queuing a request rather than adding a new * thread. * *

While queuing can be useful in smoothing out transient bursts of * requests, especially in socket-based services, it is not very well * behaved when commands continue to arrive on average faster than * they can be processed. * * Queue sizes and maximum pool sizes can often be traded off for each * other. Using large queues and small pools minimizes CPU usage, OS * resources, and context-switching overhead, but can lead to * artifically low throughput. If tasks frequently block (for example * if they are I/O bound), a JVM and underlying OS may be able to * schedule time for more threads than you otherwise allow. Use of * small queues or queueless handoffs generally requires larger pool * sizes, which keeps CPUs busier but may encounter unacceptable * scheduling overhead, which also decreases throughput. *

* *
Creating new threads
* *
New threads are created using a ThreadFactory. By default, * threads are created simply with the new Thread(Runnable) * constructor, but by supplying a different ThreadFactory, you can * alter the thread's name, thread group, priority, daemon status, * etc.
* *
Before and after intercepts
* *
This class has overridable methods that which are called before * and after execution of each task. These can be used to manipulate * the execution environment (for example, reinitializing * ThreadLocals), gather statistics, or perform logging.
* *
Blocked execution
* *
There are a number of factors which can bound the number of * tasks which can execute at once, including the maximum pool size * and the queuing mechanism used. If the executor determines that a * task cannot be executed because it has been refused by the queue * and no threads are available, or because the executor has been shut * down, the RejectedExecutionHandler's rejectedExecution method is * invoked.
* *
Termination
* *
ThreadPoolExecutor supports two shutdown options, immediate and * graceful. In an immediate shutdown, any threads currently * executing are interrupted, and any tasks not yet begun are returned * from the shutdownNow call. In a graceful shutdown, all queued * tasks are allowed to run, but new tasks may not be submitted. *
* *
* * @since 1.5 * @see RejectedExecutionHandler * @see Executors * @see ThreadFactory * * @spec JSR-166 * @revised $Date: 2003/08/09 19:55:30 $ * @editor $Author: dl $ * @author Doug Lea */ public class ThreadPoolExecutor implements ExecutorService { /** * Queue used for holding tasks and handing off to worker threads. */ private final BlockingQueue workQueue; /** * Lock held on updates to poolSize, corePoolSize, maximumPoolSize, and * workers set. */ private final ReentrantLock mainLock = new ReentrantLock(); /** * Wait condition to support awaitTermination */ private final Condition termination = mainLock.newCondition(); /** * Set containing all worker threads in pool. */ private final Set workers = new HashSet(); /** * Timeout in nanosecods for idle threads waiting for work. * Threads use this timeout only when there are more than * corePoolSize present. Otherwise they wait forever for new work. */ private volatile long keepAliveTime; /** * Core pool size, updated only while holding mainLock, * but volatile to allow concurrent readability even * during updates. */ private volatile int corePoolSize; /** * Maximum pool size, updated only while holding mainLock * but volatile to allow concurrent readability even * during updates. */ private volatile int maximumPoolSize; /** * Current pool size, updated only while holding mainLock * but volatile to allow concurrent readability even * during updates. */ private volatile int poolSize; /** * Shutdown status, becomes (and remains) nonzero when shutdown called. */ private volatile int shutdownStatus; // Special values for status /** Normal, not-shutdown mode */ private static final int NOT_SHUTDOWN = 0; /** Controlled shutdown mode */ private static final int SHUTDOWN_WHEN_IDLE = 1; /*8 Immediate shutdown mode */ private static final int SHUTDOWN_NOW = 2; /** * Latch that becomes true when all threads terminate after shutdown. */ private volatile boolean isTerminated; /** * Handler called when saturated or shutdown in execute. */ private volatile RejectedExecutionHandler handler = defaultHandler; /** * Factory for new threads. */ private volatile ThreadFactory threadFactory = defaultThreadFactory; /** * Tracks largest attained pool size. */ private int largestPoolSize; /** * Counter for completed tasks. Updated only on termination of * worker threads. */ private long completedTaskCount; /** * The default thread facotry */ private static final ThreadFactory defaultThreadFactory = new ThreadFactory() { public Thread newThread(Runnable r) { return new Thread(r); } }; /** * The default rejectect execution handler */ private static final RejectedExecutionHandler defaultHandler = new AbortPolicy(); /** * Invoke the rejected execution handler for the give command. */ void reject(Runnable command) { handler.rejectedExecution(command, this); } /** * Create and return a new thread running firstTask as its first * task. Call only while holding mainLock * @param firstTask the task the new thread should run first (or * null if none) * @return the new thread */ private Thread addThread(Runnable firstTask) { Worker w = new Worker(firstTask); Thread t = threadFactory.newThread(w); w.thread = t; workers.add(w); int nt = ++poolSize; if (nt > largestPoolSize) largestPoolSize = nt; return t; } // addIfUnderCorePoolSize is non-private; accessible to ScheduledExecutor /** * Create and start a new thread running firstTask as its first * task, only if less than corePoolSize threads are running. * @param firstTask the task the new thread should run first (or * null if none) * @return true if successful. */ boolean addIfUnderCorePoolSize(Runnable firstTask) { Thread t = null; mainLock.lock(); try { if (poolSize < corePoolSize) t = addThread(firstTask); } finally { mainLock.unlock(); } if (t == null) return false; t.start(); return true; } /** * Create and start a new thread only if less than maximumPoolSize * threads are running. The new thread runs as its first task the * next task in queue, or if there is none, the given task. * @param firstTask the task the new thread should run first (or * null if none) * @return null on failure, else the first task to be run by new thread. */ private Runnable addIfUnderMaximumPoolSize(Runnable firstTask) { Thread t = null; Runnable next = null; mainLock.lock(); try { if (poolSize < maximumPoolSize) { next = workQueue.poll(); if (next == null) next = firstTask; t = addThread(next); } } finally { mainLock.unlock(); } if (t == null) return null; t.start(); return next; } /** * Get the next task for a worker thread to run. * @return the task * @throws InterruptedException if interrupted while waiting for task */ private Runnable getTask() throws InterruptedException { for (;;) { int stat = shutdownStatus; if (stat == SHUTDOWN_NOW) return null; if (stat == SHUTDOWN_WHEN_IDLE) // help drain queue before dying return workQueue.poll(); if (poolSize <= corePoolSize) // untimed wait if core return workQueue.take(); long timeout = keepAliveTime; if (timeout <= 0) // must die immediately for 0 timeout return null; Runnable task = workQueue.poll(timeout, TimeUnit.NANOSECONDS); if (task != null) return task; if (poolSize > corePoolSize) // timed out return null; // else, after timeout, pool shrank so shouldn't die, so retry } } /** * Perform bookkeeping for a terminated worker thread. * @param w the worker */ private void workerDone(Worker w) { boolean allDone = false; mainLock.lock(); try { completedTaskCount += w.completedTasks; workers.remove(w); if (--poolSize > 0) return; // If this was last thread, deal with potential shutdown int stat = shutdownStatus; // If there are queued tasks but no threads, create replacement. if (stat != SHUTDOWN_NOW) { Runnable r = workQueue.poll(); if (r != null) { addThread(r).start(); return; } } // if no tasks and not shutdown, can exit without replacement if (stat == NOT_SHUTDOWN) return; allDone = true; isTerminated = true; termination.signalAll(); } finally { mainLock.unlock(); } if (allDone) // call outside lock terminated(); } /** * Worker threads */ private class Worker implements Runnable { /** * The runLock is acquired and released surrounding each task * execution. It mainly protects against interrupts that are * intended to cancel the worker thread from instead * interrupting the task being run. */ private final ReentrantLock runLock = new ReentrantLock(); /** * Initial task to run before entering run loop */ private Runnable firstTask; /** * Per thread completed task counter; accumulated * into completedTaskCount upon termination. */ volatile long completedTasks; /** * Thread this worker is running in. Acts as a final field, * but cannot be set until thread is created. */ Thread thread; Worker(Runnable firstTask) { this.firstTask = firstTask; } boolean isActive() { return runLock.isLocked(); } /** * Interrupt thread if not running a task */ void interruptIfIdle() { if (runLock.tryLock()) { try { thread.interrupt(); } finally { runLock.unlock(); } } } /** * Cause thread to die even if running a task. */ void interruptNow() { thread.interrupt(); } /** * Run a single task between before/after methods. */ private void runTask(Runnable task) { runLock.lock(); try { // Abort now if immediate cancel. Otherwise, we have // committed to run this task. if (shutdownStatus == SHUTDOWN_NOW) return; Thread.interrupted(); // clear interrupt status on entry boolean ran = false; beforeExecute(thread, task); try { task.run(); ran = true; afterExecute(task, null); ++completedTasks; } catch(RuntimeException ex) { if (!ran) afterExecute(task, ex); // else the exception occurred within // afterExecute itself in which case we don't // want to call it again. throw ex; } } finally { runLock.unlock(); } } /** * Main run loop */ public void run() { try { for (;;) { Runnable task; if (firstTask != null) { task = firstTask; firstTask = null; } else { task = getTask(); if (task == null) break; } runTask(task); task = null; // unnecessary but can help GC } } catch(InterruptedException ie) { // fall through } finally { workerDone(this); } } } /** * Creates a new ThreadPoolExecutor with the given initial * parameters. It may be more convenient to use one of the factory * methods instead of this general purpose constructor. * * @param corePoolSize the number of threads to keep in the * pool, even if they are idle. * @param maximumPoolSize the maximum number of threads to allow in the * pool. * @param keepAliveTime when the number of threads is greater than * the core, this is the maximum time that excess idle threads * will wait for new tasks before terminating. * @param unit the time unit for the keepAliveTime * argument. * @param workQueue the queue to use for holding tasks before the * are executed. This queue will hold only the Runnable * tasks submitted by the execute method. * @throws IllegalArgumentException if corePoolSize, or * keepAliveTime less than zero, or if maximumPoolSize less than or * equal to zero, or if corePoolSize greater than maximumPoolSize. * @throws NullPointerException if workQueue is null */ public ThreadPoolExecutor(int corePoolSize, int maximumPoolSize, long keepAliveTime, TimeUnit unit, BlockingQueue workQueue) { this(corePoolSize, maximumPoolSize, keepAliveTime, unit, workQueue, defaultThreadFactory, defaultHandler); } /** * Creates a new ThreadPoolExecutor with the given initial * parameters. * * @param corePoolSize the number of threads to keep in the * pool, even if they are idle. * @param maximumPoolSize the maximum number of threads to allow in the * pool. * @param keepAliveTime when the number of threads is greater than * the core, this is the maximum time that excess idle threads * will wait for new tasks before terminating. * @param unit the time unit for the keepAliveTime * argument. * @param workQueue the queue to use for holding tasks before the * are executed. This queue will hold only the Runnable * tasks submitted by the execute method. * @param threadFactory the factory to use when the executor * creates a new thread. * @throws IllegalArgumentException if corePoolSize, or * keepAliveTime less than zero, or if maximumPoolSize less than or * equal to zero, or if corePoolSize greater than maximumPoolSize. * @throws NullPointerException if workQueue * or threadFactory are null. */ public ThreadPoolExecutor(int corePoolSize, int maximumPoolSize, long keepAliveTime, TimeUnit unit, BlockingQueue workQueue, ThreadFactory threadFactory) { this(corePoolSize, maximumPoolSize, keepAliveTime, unit, workQueue, threadFactory, defaultHandler); } /** * Creates a new ThreadPoolExecutor with the given initial * parameters. * * @param corePoolSize the number of threads to keep in the * pool, even if they are idle. * @param maximumPoolSize the maximum number of threads to allow in the * pool. * @param keepAliveTime when the number of threads is greater than * the core, this is the maximum time that excess idle threads * will wait for new tasks before terminating. * @param unit the time unit for the keepAliveTime * argument. * @param workQueue the queue to use for holding tasks before the * are executed. This queue will hold only the Runnable * tasks submitted by the execute method. * @param handler the handler to use when execution is blocked * because the thread bounds and queue capacities are reached. * @throws IllegalArgumentException if corePoolSize, or * keepAliveTime less than zero, or if maximumPoolSize less than or * equal to zero, or if corePoolSize greater than maximumPoolSize. * @throws NullPointerException if workQueue * or handler are null. */ public ThreadPoolExecutor(int corePoolSize, int maximumPoolSize, long keepAliveTime, TimeUnit unit, BlockingQueue workQueue, RejectedExecutionHandler handler) { this(corePoolSize, maximumPoolSize, keepAliveTime, unit, workQueue, defaultThreadFactory, handler); } /** * Creates a new ThreadPoolExecutor with the given initial * parameters. * * @param corePoolSize the number of threads to keep in the * pool, even if they are idle. * @param maximumPoolSize the maximum number of threads to allow in the * pool. * @param keepAliveTime when the number of threads is greater than * the core, this is the maximum time that excess idle threads * will wait for new tasks before terminating. * @param unit the time unit for the keepAliveTime * argument. * @param workQueue the queue to use for holding tasks before the * are executed. This queue will hold only the Runnable * tasks submitted by the execute method. * @param threadFactory the factory to use when the executor * creates a new thread. * @param handler the handler to use when execution is blocked * because the thread bounds and queue capacities are reached. * @throws IllegalArgumentException if corePoolSize, or * keepAliveTime less than zero, or if maximumPoolSize less than or * equal to zero, or if corePoolSize greater than maximumPoolSize. * @throws NullPointerException if workQueue * or threadFactory or handler are null. */ public ThreadPoolExecutor(int corePoolSize, int maximumPoolSize, long keepAliveTime, TimeUnit unit, BlockingQueue workQueue, ThreadFactory threadFactory, RejectedExecutionHandler handler) { if (corePoolSize < 0 || maximumPoolSize <= 0 || maximumPoolSize < corePoolSize || keepAliveTime < 0) throw new IllegalArgumentException(); if (workQueue == null || threadFactory == null || handler == null) throw new NullPointerException(); this.corePoolSize = corePoolSize; this.maximumPoolSize = maximumPoolSize; this.workQueue = workQueue; this.keepAliveTime = unit.toNanos(keepAliveTime); this.threadFactory = threadFactory; this.handler = handler; } /** * Executes the given task sometime in the future. The task * may execute in a new thread or in an existing pooled thread. * * If the task cannot be submitted for execution, either because this * executor has been shutdown or because its capacity has been reached, * the task is handled by the current RejectedExecutionHandler. * * @param command the task to execute * @throws RejectedExecutionException at discretion of * RejectedExecutionHandler, if task cannot be accepted * for execution */ public void execute(Runnable command) { for (;;) { if (shutdownStatus != NOT_SHUTDOWN) { reject(command); return; } if (poolSize < corePoolSize && addIfUnderCorePoolSize(command)) return; if (workQueue.offer(command)) return; Runnable r = addIfUnderMaximumPoolSize(command); if (r == command) return; if (r == null) { reject(command); return; } // else retry } } public void shutdown() { mainLock.lock(); try { if (shutdownStatus == NOT_SHUTDOWN) // don't override shutdownNow shutdownStatus = SHUTDOWN_WHEN_IDLE; for (Iterator it = workers.iterator(); it.hasNext(); ) it.next().interruptIfIdle(); } finally { mainLock.unlock(); } } public List shutdownNow() { mainLock.lock(); try { shutdownStatus = SHUTDOWN_NOW; for (Iterator it = workers.iterator(); it.hasNext(); ) it.next().interruptNow(); } finally { mainLock.unlock(); } return Arrays.asList(workQueue.toArray()); } public boolean isShutdown() { return shutdownStatus != NOT_SHUTDOWN; } public boolean isTerminated() { return isTerminated; } public boolean awaitTermination(long timeout, TimeUnit unit) throws InterruptedException { mainLock.lock(); try { return termination.await(timeout, unit); } finally { mainLock.unlock(); } } /** * Invokes shutdown when this executor is no longer * referenced. */ protected void finalize() { shutdown(); } /** * Sets the thread factory used to create new threads. * * @param threadFactory the new thread factory * @see #getThreadFactory */ public void setThreadFactory(ThreadFactory threadFactory) { this.threadFactory = threadFactory; } /** * Returns the thread factory used to create new threads. * * @return the current thread factory * @see #setThreadFactory */ public ThreadFactory getThreadFactory() { return threadFactory; } /** * Sets a new handler for unexecutable tasks. * * @param handler the new handler * @see #getRejectedExecutionHandler */ public void setRejectedExecutionHandler(RejectedExecutionHandler handler) { this.handler = handler; } /** * Returns the current handler for unexecutable tasks. * * @return the current handler * @see #setRejectedExecutionHandler */ public RejectedExecutionHandler getRejectedExecutionHandler() { return handler; } /** * Returns the task queue used by this executor. Note that * this queue may be in active use. Retrieveing the task queue * does not prevent queued tasks from executing. * * @return the task queue */ public BlockingQueue getQueue() { return workQueue; } /** * Removes this task from internal queue if it is present, thus * causing it not to be run if it has not already started. This * method may be useful as one part of a cancellation scheme. * * @param task the task to remove * @return true if the task was removed */ public boolean remove(Runnable task) { return getQueue().remove(task); } /** * Removes from the work queue all {@link Cancellable} tasks * that have been cancelled. This method can be useful as a * storage reclamation operation, that has no other impact * on functionality. Cancelled tasks are never executed, but * may accumulate in work queues until worker threads can * actively remove them. Invoking this method ensures that they * are instead removed now. */ public void purge() { Iterator it = getQueue().iterator(); while (it.hasNext()) { Runnable r = it.next(); if (r instanceof Cancellable) { Cancellable c = (Cancellable)r; if (c.isCancelled()) it.remove(); } } } /** * Sets the core number of threads. This overrides any value set * in the constructor. If the new value is smaller than the * current value, excess existing threads will be terminated when * they next become idle. * * @param corePoolSize the new core size * @throws IllegalArgumentException if corePoolSize * less than zero * @see #getCorePoolSize */ public void setCorePoolSize(int corePoolSize) { if (corePoolSize < 0) throw new IllegalArgumentException(); mainLock.lock(); try { int extra = this.corePoolSize - corePoolSize; this.corePoolSize = corePoolSize; if (extra > 0 && poolSize > corePoolSize) { Iterator it = workers.iterator(); while (it.hasNext() && extra > 0 && poolSize > corePoolSize && workQueue.remainingCapacity() == 0) { it.next().interruptIfIdle(); --extra; } } } finally { mainLock.unlock(); } } /** * Returns the core number of threads. * * @return the core number of threads * @see #setCorePoolSize */ public int getCorePoolSize() { return corePoolSize; } /** * Sets the maximum allowed number of threads. This overrides any * value set in the constructor. If the new value is smaller than * the current value, excess existing threads will be * terminated when they next become idle. * * @param maximumPoolSize the new maximum * @throws IllegalArgumentException if maximumPoolSize less than zero or * the {@link #getCorePoolSize core pool size} * @see #getMaximumPoolSize */ public void setMaximumPoolSize(int maximumPoolSize) { if (maximumPoolSize <= 0 || maximumPoolSize < corePoolSize) throw new IllegalArgumentException(); mainLock.lock(); try { int extra = this.maximumPoolSize - maximumPoolSize; this.maximumPoolSize = maximumPoolSize; if (extra > 0 && poolSize > maximumPoolSize) { Iterator it = workers.iterator(); while (it.hasNext() && extra > 0 && poolSize > maximumPoolSize) { it.next().interruptIfIdle(); --extra; } } } finally { mainLock.unlock(); } } /** * Returns the maximum allowed number of threads. * * @return the maximum allowed number of threads * @see #setMaximumPoolSize */ public int getMaximumPoolSize() { return maximumPoolSize; } /** * Sets the time limit for which threads may remain idle before * being terminated. If there are more than the core number of * threads currently in the pool, after waiting this amount of * time without processing a task, excess threads will be * terminated. This overrides any value set in the constructor. * @param time the time to wait. A time value of zero will cause * excess threads to terminate immediately after executing tasks. * @param unit the time unit of the time argument * @throws IllegalArgumentException if msecs less than zero * @see #getKeepAliveTime */ public void setKeepAliveTime(long time, TimeUnit unit) { if (time < 0) throw new IllegalArgumentException(); this.keepAliveTime = unit.toNanos(time); } /** * Returns the thread keep-alive time, which is the amount of time * which threads in excess of the core pool size may remain * idle before being terminated. * * @param unit the desired time unit of the result * @return the time limit * @see #setKeepAliveTime */ public long getKeepAliveTime(TimeUnit unit) { return unit.convert(keepAliveTime, TimeUnit.NANOSECONDS); } /* Statistics */ /** * Returns the current number of threads in the pool. * * @return the number of threads */ public int getPoolSize() { return poolSize; } /** * Returns the approximate number of threads that are actively * executing tasks. * * @return the number of threads */ public int getActiveCount() { mainLock.lock(); try { int n = 0; for (Iterator it = workers.iterator(); it.hasNext(); ) { if (it.next().isActive()) ++n; } return n; } finally { mainLock.unlock(); } } /** * Returns the largest number of threads that have ever * simultaneously been in the pool. * * @return the number of threads */ public int getLargestPoolSize() { mainLock.lock(); try { return largestPoolSize; } finally { mainLock.unlock(); } } /** * Returns the approximate total number of tasks that have been * scheduled for execution. Because the states of tasks and * threads may change dynamically during computation, the returned * value is only an approximation. * * @return the number of tasks */ public long getTaskCount() { mainLock.lock(); try { long n = completedTaskCount; for (Iterator it = workers.iterator(); it.hasNext(); ) { Worker w = it.next(); n += w.completedTasks; if (w.isActive()) ++n; } return n + workQueue.size(); } finally { mainLock.unlock(); } } /** * Returns the approximate total number of tasks that have * completed execution. Because the states of tasks and threads * may change dynamically during computation, the returned value * is only an approximation. * * @return the number of tasks */ public long getCompletedTaskCount() { mainLock.lock(); try { long n = completedTaskCount; for (Iterator it = workers.iterator(); it.hasNext(); ) n += it.next().completedTasks; return n; } finally { mainLock.unlock(); } } /** * Method invoked prior to executing the given Runnable in given * thread. This method may be used to re-initialize ThreadLocals, * or to perform logging. Note: To properly nest multiple * overridings, subclasses should generally invoke * super.beforeExecute at the end of this method. * * @param t the thread that will run task r. * @param r the task that will be executed. */ protected void beforeExecute(Thread t, Runnable r) { } /** * Method invoked upon completion of execution of the given * Runnable. If non-null, the Throwable is the uncaught exception * that caused execution to terminate abruptly. Note: To properly * nest multiple overridings, subclasses should generally invoke * super.afterExecute at the beginning of this method. * * @param r the runnable that has completed. * @param t the exception that cause termination, or null if * execution completed normally. */ protected void afterExecute(Runnable r, Throwable t) { } /** * Method invoked when the Executor has terminated. Default * implementation does nothing. */ protected void terminated() { } /** * A handler for unexecutable tasks that runs these tasks directly in the * calling thread of the execute method. This is the default * RejectedExecutionHandler. */ public static class CallerRunsPolicy implements RejectedExecutionHandler { /** * Constructs a CallerRunsPolicy. */ public CallerRunsPolicy() { } public void rejectedExecution(Runnable r, ThreadPoolExecutor e) { if (!e.isShutdown()) { r.run(); } } } /** * A handler for unexecutable tasks that throws a * RejectedExecutionException. */ public static class AbortPolicy implements RejectedExecutionHandler { /** * Constructs a AbortPolicy. */ public AbortPolicy() { } public void rejectedExecution(Runnable r, ThreadPoolExecutor e) { throw new RejectedExecutionException(); } } /** * A handler for unexecutable tasks that waits until the task can be * submitted for execution. */ public static class WaitPolicy implements RejectedExecutionHandler { /** * Constructs a WaitPolicy. */ public WaitPolicy() { } public void rejectedExecution(Runnable r, ThreadPoolExecutor e) { if (!e.isShutdown()) { try { e.getQueue().put(r); } catch (InterruptedException ie) { Thread.currentThread().interrupt(); throw new RejectedExecutionException(ie); } } } } /** * A handler for unexecutable tasks that silently discards these tasks. */ public static class DiscardPolicy implements RejectedExecutionHandler { /** * Constructs DiscardPolicy. */ public DiscardPolicy() { } public void rejectedExecution(Runnable r, ThreadPoolExecutor e) { } } /** * A handler for unexecutable tasks that discards the oldest * unhandled request. */ public static class DiscardOldestPolicy implements RejectedExecutionHandler { /** * Constructs a DiscardOldestPolicy for the given executor. */ public DiscardOldestPolicy() { } public void rejectedExecution(Runnable r, ThreadPoolExecutor e) { if (!e.isShutdown()) { e.getQueue().poll(); e.execute(r); } } } }