ViewVC Help
View File | Revision Log | Show Annotations | Download File | Root Listing
root/jsr166/jsr166/src/test/tck/RecursiveActionTest.java
(Generate patch)

Comparing jsr166/src/test/tck/RecursiveActionTest.java (file contents):
Revision 1.28 by jsr166, Wed Dec 1 22:37:51 2010 UTC vs.
Revision 1.36 by jsr166, Sun Jun 26 06:50:19 2011 UTC

# Line 1 | Line 1
1   /*
2   * Written by Doug Lea with assistance from members of JCP JSR-166
3   * Expert Group and released to the public domain, as explained at
4 < * http://creativecommons.org/licenses/publicdomain
4 > * http://creativecommons.org/publicdomain/zero/1.0/
5   */
6  
7   import junit.framework.*;
# Line 12 | Line 12 | import java.util.concurrent.ForkJoinPool
12   import java.util.concurrent.ForkJoinTask;
13   import java.util.concurrent.ForkJoinWorkerThread;
14   import java.util.concurrent.RecursiveAction;
15 + import java.util.concurrent.ThreadLocalRandom;
16   import java.util.concurrent.TimeUnit;
17   import java.util.concurrent.TimeoutException;
18   import static java.util.concurrent.TimeUnit.SECONDS;
19 + import java.util.Arrays;
20   import java.util.HashSet;
21  
22   public class RecursiveActionTest extends JSR166TestCase {
# Line 134 | Line 136 | public class RecursiveActionTest extends
136          assertFalse(a.isCancelled());
137          assertFalse(a.isCompletedNormally());
138          assertTrue(a.isCompletedAbnormally());
139 <        assertSame(t, a.getException());
139 >        assertSame(t.getClass(), a.getException().getClass());
140          assertNull(a.getRawResult());
141          assertFalse(a.cancel(false));
142          assertFalse(a.cancel(true));
# Line 143 | Line 145 | public class RecursiveActionTest extends
145              a.join();
146              shouldThrow();
147          } catch (Throwable expected) {
148 <            assertSame(t, expected);
148 >            assertSame(expected.getClass(), t.getClass());
149          }
150  
151          try {
152              a.get();
153              shouldThrow();
154          } catch (ExecutionException success) {
155 <            assertSame(t, success.getCause());
155 >            assertSame(t.getClass(), success.getCause().getClass());
156          } catch (Throwable fail) { threadUnexpectedException(fail); }
157  
158          try {
159              a.get(5L, SECONDS);
160              shouldThrow();
161          } catch (ExecutionException success) {
162 <            assertSame(t, success.getCause());
162 >            assertSame(t.getClass(), success.getCause().getClass());
163          } catch (Throwable fail) { threadUnexpectedException(fail); }
164      }
165  
166 <    static final class FJException extends RuntimeException {
167 <        FJException() { super(); }
166 >    public static final class FJException extends RuntimeException {
167 >        public FJException() { super(); }
168 >        public FJException(Throwable cause) { super(cause); }
169      }
170  
171      // A simple recursive action for testing
# Line 266 | Line 269 | public class RecursiveActionTest extends
269                  assertEquals(21, f.result);
270                  checkCompletedNormally(f);
271  
272 <                f.reinitialize();
272 >                f = new FibAction(8);
273                  f.cancel(true);
274                  assertSame(f, f.fork());
275                  myself.interrupt();
# Line 279 | Line 282 | public class RecursiveActionTest extends
282                      checkCancelled(f);
283                  }
284  
285 <                f.reinitialize();
285 >                f = new FibAction(8);
286                  f.completeExceptionally(new FJException());
287                  assertSame(f, f.fork());
288                  myself.interrupt();
# Line 293 | Line 296 | public class RecursiveActionTest extends
296                  }
297  
298                  // test quietlyJoin()
299 <                f.reinitialize();
299 >                f = new FibAction(8);
300                  assertSame(f, f.fork());
301                  myself.interrupt();
302                  assertTrue(myself.isInterrupted());
# Line 302 | Line 305 | public class RecursiveActionTest extends
305                  assertEquals(21, f.result);
306                  checkCompletedNormally(f);
307  
308 <                f.reinitialize();
308 >                f = new FibAction(8);
309                  f.cancel(true);
310                  assertSame(f, f.fork());
311                  myself.interrupt();
# Line 311 | Line 314 | public class RecursiveActionTest extends
314                  Thread.interrupted();
315                  checkCancelled(f);
316  
317 <                f.reinitialize();
317 >                f = new FibAction(8);
318                  f.completeExceptionally(new FJException());
319                  assertSame(f, f.fork());
320                  myself.interrupt();
# Line 489 | Line 492 | public class RecursiveActionTest extends
492          testInvokeOnPool(mainPool(), a);
493      }
494  
492 –
495      /**
496       * helpQuiesce returns when tasks are complete.
497       * getQueuedTaskCount returns 0 when quiescent
# Line 499 | Line 501 | public class RecursiveActionTest extends
501              public void realCompute() {
502                  FibAction f = new FibAction(8);
503                  assertSame(f, f.fork());
504 <                f.helpQuiesce();
504 >                helpQuiesce();
505                  assertEquals(21, f.result);
506                  assertEquals(0, getQueuedTaskCount());
507                  checkCompletedNormally(f);
# Line 507 | Line 509 | public class RecursiveActionTest extends
509          testInvokeOnPool(mainPool(), a);
510      }
511  
510 –
512      /**
513       * invoke task throws exception when task completes abnormally
514       */
# Line 771 | Line 772 | public class RecursiveActionTest extends
772                  ForkJoinWorkerThread w =
773                      (ForkJoinWorkerThread) Thread.currentThread();
774                  assertTrue(w.getPoolIndex() >= 0);
775 <                assertTrue(w.getPoolIndex() < mainPool.getPoolSize());
775 >                // pool size can shrink after assigning index, so cannot check
776 >                // assertTrue(w.getPoolIndex() < mainPool.getPoolSize());
777              }};
778          testInvokeOnPool(mainPool, a);
779      }
780  
779 –
781      /**
782       * setRawResult(null) succeeds
783       */
# Line 790 | Line 791 | public class RecursiveActionTest extends
791      }
792  
793      /**
794 <     * A reinitialized task may be re-invoked
794 >     * A reinitialized normally completed task may be re-invoked
795       */
796      public void testReinitialize() {
797          RecursiveAction a = new CheckedRecursiveAction() {
# Line 810 | Line 811 | public class RecursiveActionTest extends
811      }
812  
813      /**
814 +     * A reinitialized abnormally completed task may be re-invoked
815 +     */
816 +    public void testReinitializeAbnormal() {
817 +        RecursiveAction a = new CheckedRecursiveAction() {
818 +            public void realCompute() {
819 +                FailingFibAction f = new FailingFibAction(8);
820 +                checkNotDone(f);
821 +
822 +                for (int i = 0; i < 3; i++) {
823 +                    try {
824 +                        f.invoke();
825 +                        shouldThrow();
826 +                    } catch (FJException success) {
827 +                        checkCompletedAbnormally(f, success);
828 +                    }
829 +                    f.reinitialize();
830 +                    checkNotDone(f);
831 +                }
832 +            }};
833 +        testInvokeOnPool(mainPool(), a);
834 +    }
835 +
836 +    /**
837       * invoke task throws exception after invoking completeExceptionally
838       */
839      public void testCompleteExceptionally() {
# Line 923 | Line 947 | public class RecursiveActionTest extends
947          testInvokeOnPool(mainPool(), a);
948      }
949  
926 –
950      /**
951       * invokeAll(tasks) with any null task throws NPE
952       */
# Line 1174 | Line 1197 | public class RecursiveActionTest extends
1197          testInvokeOnPool(asyncSingletonPool(), a);
1198      }
1199  
1200 +    static class SortTask extends RecursiveAction {
1201 +        final long[] array; final int lo, hi;
1202 +        SortTask(long[] array, int lo, int hi) {
1203 +            this.array = array; this.lo = lo; this.hi = hi;
1204 +        }
1205 +        final static int THRESHOLD = 100;
1206 +        protected void compute() {
1207 +            if (hi - lo < THRESHOLD)
1208 +                sequentiallySort(array, lo, hi);
1209 +            else {
1210 +                int mid = (lo + hi) >>> 1;
1211 +                invokeAll(new SortTask(array, lo, mid),
1212 +                          new SortTask(array, mid, hi));
1213 +                merge(array, lo, mid, hi);
1214 +            }
1215 +        }
1216 +        static void sequentiallySort(long[] array, int lo, int hi) {
1217 +            Arrays.sort(array, lo, hi);
1218 +        }
1219 +        static void merge(long[] array, int lo, int mid, int hi) {
1220 +            long[] buf = Arrays.copyOfRange(array, lo, mid);
1221 +            for (int i = 0, j = lo, k = mid; i < buf.length; j++)
1222 +                array[j] = (k == hi || buf[i] < array[k]) ?
1223 +                    buf[i++] : array[k++];
1224 +        }
1225 +    }
1226 +
1227 +    /**
1228 +     * SortTask demo works as advertised
1229 +     */
1230 +    public void testSortTaskDemo() {
1231 +        ThreadLocalRandom rnd = ThreadLocalRandom.current();
1232 +        long[] array = new long[1007];
1233 +        for (int i = 0; i < array.length; i++)
1234 +            array[i] = rnd.nextLong();
1235 +        long[] arrayClone = array.clone();
1236 +        testInvokeOnPool(mainPool(),
1237 +                         new SortTask(array, 0, array.length));
1238 +        Arrays.sort(arrayClone);
1239 +        assertTrue(Arrays.equals(array, arrayClone));
1240 +    }
1241   }

Diff Legend

– Removed lines
+ Added lines
< Changed lines
> Changed lines