1.1 --- /dev/null Thu Jan 01 00:00:00 1970 +0000 1.2 +++ b/js/src/jit-test/tests/parallel/Array-scanPar-sorted.js Wed Dec 31 06:09:35 2014 +0100 1.3 @@ -0,0 +1,38 @@ 1.4 +// |jit-test| slow; 1.5 + 1.6 +load(libdir + "parallelarray-helpers.js"); 1.7 + 1.8 +function mergeSorted(l1, l2) { 1.9 + var result = []; 1.10 + var i1 = 0, i2 = 0, j = 0; 1.11 + while (i1 < l1.length && i2 < l2.length) { 1.12 + if (l1[i1] < l2[i2]) 1.13 + result[j++] = l1[i1++]; 1.14 + else 1.15 + result[j++] = l2[i2++]; 1.16 + } 1.17 + while (i1 < l1.length) { 1.18 + result[j++] = l1[i1++]; 1.19 + } 1.20 + while (i2 < l2.length) { 1.21 + result[j++] = l2[i2++]; 1.22 + } 1.23 + return result; 1.24 +} 1.25 + 1.26 +function test() { 1.27 + var elts = []; 1.28 + var ints = range(1, 5), c = 0; 1.29 + 1.30 + // Using 2048 as the length of elts induces bailouts due to GC. 1.31 + // This exposed various bugs. 1.32 + for (var i = 0; i < 2048; i++) 1.33 + elts[i] = ints; 1.34 + 1.35 + var scanned1 = seq_scan(elts, mergeSorted); 1.36 + var scanned2 = elts.scanPar(mergeSorted); 1.37 + assertStructuralEq(scanned1, scanned2); 1.38 +} 1.39 + 1.40 +if (getBuildConfiguration().parallelJS) 1.41 + test();