--- jsr166/src/jsr166y/CountedCompleter.java	2012/08/16 12:25:03	1.3
+++ jsr166/src/jsr166y/CountedCompleter.java	2012/11/14 18:45:53	1.11
@@ -22,12 +22,13 @@ package jsr166y;
  * decremented; otherwise, the completion action is performed, and if
  * this completer itself has a completer, the process is continued
  * with its completer.  As is the case with related synchronization
- * components such as {@link Phaser} and {@link
- * java.util.concurrent.Semaphore} these methods affect only internal
- * counts; they do not establish any further internal bookkeeping. In
- * particular, the identities of pending tasks are not maintained. As
- * illustrated below, you can create subclasses that do record some or
- * all pended tasks or their results when needed.
+ * components such as {@link java.util.concurrent.Phaser Phaser} and
+ * {@link java.util.concurrent.Semaphore Semaphore}, these methods
+ * affect only internal counts; they do not establish any further
+ * internal bookkeeping. In particular, the identities of pending
+ * tasks are not maintained. As illustrated below, you can create
+ * subclasses that do record some or all pending tasks or their
+ * results when needed.
  *
  * <p>A concrete CountedCompleter class must define method {@link
  * #compute}, that should, in almost all use cases, invoke {@code
@@ -141,7 +142,7 @@ package jsr166y;
  *
  * As a further improvement, notice that the left task need not even
  * exist.  Instead of creating a new one, we can iterate using the
- * original task, and add a pending count for each fork:
+ * original task, and add a pending count for each fork.
  *
  * <pre> {@code
  * class ForEach<E> ...
@@ -377,6 +378,19 @@ public abstract class CountedCompleter<T
     }
 
     /**
+     * Returns the root of the current computation; i.e., this
+     * task if it has no completer, else its completer's root.
+     *
+     * @return the root of the current computation
+     */
+    public final CountedCompleter<?> getRoot() {
+        CountedCompleter<?> a = this, p;
+        while ((p = a.completer) != null)
+            a = p;
+        return a;
+    }
+
+    /**
      * If the pending count is nonzero, decrements the count;
      * otherwise invokes {@link #onCompletion} and then similarly
      * tries to complete this task's completer, if one exists,
@@ -463,8 +477,6 @@ public abstract class CountedCompleter<T
             throw new Error(e);
         }
     }
-
-
     /**
      * Returns a sun.misc.Unsafe.  Suitable for use in a 3rd party package.
      * Replace with a simple call to Unsafe.getUnsafe when integrating