--- jsr166/src/test/loops/BinaryAsyncAction.java	2013/02/05 19:54:07	1.15
+++ jsr166/src/test/loops/BinaryAsyncAction.java	2015/09/14 16:47:43	1.20
@@ -13,7 +13,7 @@ import java.util.concurrent.atomic.*;
  * have smaller stack space footprints and faster completion mechanics
  * but higher per-task footprints. Compared to LinkedAsyncActions,
  * BinaryAsyncActions are simpler to use and have less overhead in
- * typical uasges but are restricted to binary computation trees.
+ * typical usages but are restricted to binary computation trees.
  *
  * <p>Upon construction, a BinaryAsyncAction does not bear any
  * linkages. For non-root tasks, links must be established using
@@ -169,7 +169,7 @@ public abstract class BinaryAsyncAction
             a.sibling = null;
             a.parent = null;
             a.completeThis();
-            if (p == null || p.compareAndSetControlState(0, 1))
+            if (p == null ||  p.compareAndSetControlState(0, 1))
                 break;
             try {
                 p.onComplete(a, s);
@@ -281,5 +281,4 @@ public abstract class BinaryAsyncAction
     protected final void decrementControlState() {
         controlStateUpdater.decrementAndGet(this);
     }
-
 }