| Index: test/mjsunit/unbox-double-arrays.js
|
| ===================================================================
|
| --- test/mjsunit/unbox-double-arrays.js (revision 8778)
|
| +++ test/mjsunit/unbox-double-arrays.js (working copy)
|
| @@ -27,52 +27,501 @@
|
|
|
| // Test dictionary -> double elements -> dictionary elements round trip
|
|
|
| -var foo = new Array(500000);
|
| +// Flags: --allow-natives-syntax --unbox-double-arrays --expose-gc
|
| +var large_array_size = 100000;
|
| +var approx_dict_to_elements_threshold = 70000;
|
|
|
| -function func(a) {
|
| - for (var i= 0; i < 100000; ++i ) {
|
| - a[i] = i+0.5;
|
| +var name = 0;
|
| +
|
| +function expected_array_value(i) {
|
| + if ((i % 50) != 0) {
|
| + return i;
|
| + } else {
|
| + return i + 0.5;
|
| }
|
| }
|
|
|
| -func(foo);
|
| +function force_to_fast_double_array(a) {
|
| + a[large_array_size - 2] = 1;
|
| + for (var i= 0; i < approx_dict_to_elements_threshold; ++i ) {
|
| + a[i] = expected_array_value(i);
|
| + }
|
| + assertTrue(%HasFastDoubleElements(a));
|
| +}
|
|
|
| -for (var i= 0; i < 100000; i += 500 ) {
|
| - assertEquals(i+0.5, foo[i]);
|
| +function make_object_like_array(size) {
|
| + obj = new Object();
|
| + obj.length = size;
|
| + return obj;
|
| }
|
|
|
| -delete foo[5];
|
| -// Don't use assertEquals for comparison to undefined due to
|
| -assertTrue(undefined === foo[5]);
|
| -assertTrue(undefined === foo[500000-1]);
|
| -assertTrue(undefined === foo[-1]);
|
| -assertEquals(500000, foo.length);
|
| +function testOneArrayType(allocator) {
|
| + var large_array = new allocator(large_array_size);
|
| + force_to_fast_double_array(large_array);
|
| + var six = 6;
|
|
|
| + for (var i= 0; i < approx_dict_to_elements_threshold; i += 501 ) {
|
| + assertEquals(expected_array_value(i), large_array[i]);
|
| + }
|
| +
|
| + // This function has a constant and won't get inlined.
|
| + function computed_6() {
|
| + return six;
|
| + }
|
| +
|
| + // Multiple versions of the test function makes sure that IC/Crankshaft state
|
| + // doesn't get reused.
|
| + function test_various_loads(a, value_5, value_6, value_7) {
|
| + assertTrue(%HasFastDoubleElements(a));
|
| + assertEquals(value_5, a[5]);
|
| + assertEquals(value_6, a[6]);
|
| + assertEquals(value_6, a[computed_6()]); // Test non-constant key
|
| + assertEquals(value_7, a[7]);
|
| + assertEquals(undefined, a[large_array_size-1]);
|
| + assertEquals(undefined, a[-1]);
|
| + assertEquals(large_array_size, a.length);
|
| + assertTrue(%HasFastDoubleElements(a));
|
| + }
|
| +
|
| + function test_various_loads2(a, value_5, value_6, value_7) {
|
| + assertTrue(%HasFastDoubleElements(a));
|
| + assertEquals(value_5, a[5]);
|
| + assertEquals(value_6, a[6]);
|
| + assertEquals(value_6, a[computed_6()]); // Test non-constant key
|
| + assertEquals(value_7, a[7]);
|
| + assertEquals(undefined, a[large_array_size-1]);
|
| + assertEquals(undefined, a[-1]);
|
| + assertEquals(large_array_size, a.length);
|
| + assertTrue(%HasFastDoubleElements(a));
|
| + }
|
| +
|
| + function test_various_loads3(a, value_5, value_6, value_7) {
|
| + assertTrue(%HasFastDoubleElements(a));
|
| + assertEquals(value_5, a[5]);
|
| + assertEquals(value_6, a[6]);
|
| + assertEquals(value_6, a[computed_6()]); // Test non-constant key
|
| + assertEquals(value_7, a[7]);
|
| + assertEquals(undefined, a[large_array_size-1]);
|
| + assertEquals(undefined, a[-1]);
|
| + assertEquals(large_array_size, a.length);
|
| + assertTrue(%HasFastDoubleElements(a));
|
| + }
|
| +
|
| + function test_various_loads4(a, value_5, value_6, value_7) {
|
| + assertTrue(%HasFastDoubleElements(a));
|
| + assertEquals(value_5, a[5]);
|
| + assertEquals(value_6, a[6]);
|
| + assertEquals(value_6, a[computed_6()]); // Test non-constant key
|
| + assertEquals(value_7, a[7]);
|
| + assertEquals(undefined, a[large_array_size-1]);
|
| + assertEquals(undefined, a[-1]);
|
| + assertEquals(large_array_size, a.length);
|
| + assertTrue(%HasFastDoubleElements(a));
|
| + }
|
| +
|
| + function test_various_loads5(a, value_5, value_6, value_7) {
|
| + assertTrue(%HasFastDoubleElements(a));
|
| + assertEquals(value_5, a[5]);
|
| + assertEquals(value_6, a[6]);
|
| + assertEquals(value_6, a[computed_6()]); // Test non-constant key
|
| + assertEquals(value_7, a[7]);
|
| + assertEquals(undefined, a[large_array_size-1]);
|
| + assertEquals(undefined, a[-1]);
|
| + assertEquals(large_array_size, a.length);
|
| + assertTrue(%HasFastDoubleElements(a));
|
| + }
|
| +
|
| + function test_various_loads6(a, value_5, value_6, value_7) {
|
| + assertTrue(%HasFastDoubleElements(a));
|
| + assertEquals(value_5, a[5]);
|
| + assertEquals(value_6, a[6]);
|
| + assertEquals(value_6, a[computed_6()]); // Test non-constant key
|
| + assertEquals(value_7, a[7]);
|
| + assertEquals(undefined, a[large_array_size-1]);
|
| + assertEquals(undefined, a[-1]);
|
| + assertEquals(large_array_size, a.length);
|
| + assertTrue(%HasFastDoubleElements(a));
|
| + }
|
| +
|
| + function test_various_stores(a, value_5, value_6, value_7) {
|
| + assertTrue(%HasFastDoubleElements(a));
|
| + a[5] = value_5;
|
| + a[computed_6()] = value_6;
|
| + a[7] = value_7;
|
| + assertTrue(%HasFastDoubleElements(a));
|
| + }
|
| +
|
| + // Test double and integer values
|
| + test_various_loads(large_array,
|
| + expected_array_value(5),
|
| + expected_array_value(6),
|
| + expected_array_value(7));
|
| + test_various_loads(large_array,
|
| + expected_array_value(5),
|
| + expected_array_value(6),
|
| + expected_array_value(7));
|
| + test_various_loads(large_array,
|
| + expected_array_value(5),
|
| + expected_array_value(6),
|
| + expected_array_value(7));
|
| + %OptimizeFunctionOnNextCall(test_various_loads);
|
| + test_various_loads(large_array,
|
| + expected_array_value(5),
|
| + expected_array_value(6),
|
| + expected_array_value(7));
|
| +
|
| + // Test NaN values
|
| + test_various_stores(large_array, NaN, -NaN, expected_array_value(7));
|
| +
|
| + test_various_loads2(large_array,
|
| + NaN,
|
| + -NaN,
|
| + expected_array_value(7));
|
| + test_various_loads2(large_array,
|
| + NaN,
|
| + -NaN,
|
| + expected_array_value(7));
|
| + test_various_loads2(large_array,
|
| + NaN,
|
| + -NaN,
|
| + expected_array_value(7));
|
| + %OptimizeFunctionOnNextCall(test_various_loads2);
|
| + test_various_loads2(large_array,
|
| + NaN,
|
| + -NaN,
|
| + expected_array_value(7));
|
| +
|
| + // Test Infinity values
|
| + test_various_stores(large_array,
|
| + Infinity,
|
| + -Infinity,
|
| + expected_array_value(7));
|
| +
|
| + test_various_loads3(large_array,
|
| + Infinity,
|
| + -Infinity,
|
| + expected_array_value(7));
|
| + test_various_loads3(large_array,
|
| + Infinity,
|
| + -Infinity,
|
| + expected_array_value(7));
|
| + test_various_loads3(large_array,
|
| + Infinity,
|
| + -Infinity,
|
| + expected_array_value(7));
|
| + %OptimizeFunctionOnNextCall(test_various_loads3);
|
| + test_various_loads3(large_array,
|
| + Infinity,
|
| + -Infinity,
|
| + expected_array_value(7));
|
| +
|
| + // Test the hole for the default runtime implementation.
|
| + delete large_array[5];
|
| + delete large_array[6];
|
| + test_various_loads4(large_array,
|
| + undefined,
|
| + undefined,
|
| + expected_array_value(7));
|
| +
|
| + // Test the keyed load IC implementation when the value is the hole.
|
| + test_various_stores(large_array,
|
| + expected_array_value(5),
|
| + expected_array_value(6),
|
| + expected_array_value(7));
|
| + test_various_loads5(large_array,
|
| + expected_array_value(5),
|
| + expected_array_value(6),
|
| + expected_array_value(7));
|
| + test_various_loads5(large_array,
|
| + expected_array_value(5),
|
| + expected_array_value(6),
|
| + expected_array_value(7));
|
| + delete large_array[5];
|
| + delete large_array[6];
|
| + test_various_loads5(large_array,
|
| + undefined,
|
| + undefined,
|
| + expected_array_value(7));
|
| + test_various_loads5(large_array,
|
| + undefined,
|
| + undefined,
|
| + expected_array_value(7));
|
| +
|
| + // Make sure Crankshaft code handles the hole correctly (bailout)
|
| + test_various_stores(large_array,
|
| + expected_array_value(5),
|
| + expected_array_value(6),
|
| + expected_array_value(7));
|
| + test_various_loads6(large_array,
|
| + expected_array_value(5),
|
| + expected_array_value(6),
|
| + expected_array_value(7));
|
| + test_various_loads6(large_array,
|
| + expected_array_value(5),
|
| + expected_array_value(6),
|
| + expected_array_value(7));
|
| + %OptimizeFunctionOnNextCall(test_various_loads6);
|
| + test_various_loads6(large_array,
|
| + expected_array_value(5),
|
| + expected_array_value(6),
|
| + expected_array_value(7));
|
| +
|
| + delete large_array[5];
|
| + delete large_array[6];
|
| + test_various_loads6(large_array,
|
| + undefined,
|
| + undefined,
|
| + expected_array_value(7));
|
| +
|
| + // Test stores for non-NaN.
|
| + %OptimizeFunctionOnNextCall(test_various_stores);
|
| + test_various_stores(large_array,
|
| + expected_array_value(5),
|
| + expected_array_value(6),
|
| + expected_array_value(7));
|
| +
|
| + test_various_stores(large_array,
|
| + expected_array_value(5),
|
| + expected_array_value(6),
|
| + expected_array_value(7));
|
| +
|
| + test_various_loads6(large_array,
|
| + expected_array_value(5),
|
| + expected_array_value(6),
|
| + expected_array_value(7));
|
| +
|
| + // Test NaN behavior for stores.
|
| + test_various_stores(large_array,
|
| + NaN,
|
| + -NaN,
|
| + expected_array_value(7));
|
| +
|
| + test_various_stores(large_array,
|
| + NaN,
|
| + -NaN,
|
| + expected_array_value(7));
|
| +
|
| + test_various_loads6(large_array,
|
| + NaN,
|
| + -NaN,
|
| + expected_array_value(7));
|
| +
|
| + // Test Infinity behavior for stores.
|
| + test_various_stores(large_array,
|
| + Infinity,
|
| + -Infinity,
|
| + expected_array_value(7));
|
| +
|
| + test_various_stores(large_array,
|
| + Infinity,
|
| + -Infinity,
|
| + expected_array_value(7));
|
| +
|
| + test_various_loads6(large_array,
|
| + Infinity,
|
| + -Infinity,
|
| + expected_array_value(7));
|
| +
|
| + assertTrue(%GetOptimizationStatus(test_various_stores) != 2);
|
| +
|
| + // Make sure that we haven't converted from fast double.
|
| + assertTrue(%HasFastDoubleElements(large_array));
|
| +}
|
| +
|
| +testOneArrayType(make_object_like_array);
|
| +testOneArrayType(Array);
|
| +
|
| +var large_array = new Array(large_array_size);
|
| +force_to_fast_double_array(large_array);
|
| +assertTrue(%HasFastDoubleElements(large_array));
|
| +
|
| // Cause the array to grow beyond it's JSArray length. This will double the
|
| // size of the capacity and force the array into "slow" dictionary case.
|
| -foo[500001] = 50;
|
| -assertEquals(50, foo[500001]);
|
| -assertEquals(500002, foo.length);
|
| -assertTrue(undefined === foo[5])
|
| -assertTrue(undefined === foo[500000-1])
|
| -assertTrue(undefined === foo[-1])
|
| -assertEquals(500002, foo.length);
|
| +large_array[5] = Infinity;
|
| +large_array[large_array_size+10001] = 50;
|
| +assertTrue(%HasDictionaryElements(large_array));
|
| +assertEquals(50, large_array[large_array_size+10001]);
|
| +assertEquals(large_array_size+10002, large_array.length);
|
| +assertEquals(Infinity, large_array[5]);
|
| +assertEquals(undefined, large_array[large_array_size-1]);
|
| +assertEquals(undefined, large_array[-1]);
|
| +assertEquals(large_array_size+10002, large_array.length);
|
|
|
| // Test dictionary -> double elements -> fast elements.
|
| +var large_array2 = new Array(large_array_size);
|
| +force_to_fast_double_array(large_array2);
|
| +delete large_array2[5];
|
|
|
| -var foo2 = new Array(500000);
|
| -func(foo2);
|
| -delete foo2[5];
|
| -
|
| // Convert back to fast elements and make sure the contents of the array are
|
| // unchanged.
|
| -foo2[25] = new Object();
|
| -for (var i= 0; i < 100000; i += 500 ) {
|
| +large_array2[25] = new Object();
|
| +assertTrue(%HasFastElements(large_array2));
|
| +for (var i= 0; i < approx_dict_to_elements_threshold; i += 500 ) {
|
| if (i != 25 && i != 5) {
|
| - assertEquals(i+0.5, foo2[i]);
|
| + assertEquals(expected_array_value(i), large_array2[i]);
|
| }
|
| }
|
| -assertTrue(undefined === foo2[5])
|
| -assertTrue(undefined === foo2[500000-1])
|
| -assertTrue(undefined === foo2[-1])
|
| -assertEquals(500000, foo2.length);
|
| +assertEquals(undefined, large_array2[5]);
|
| +assertEquals(undefined, large_array2[large_array_size-1]);
|
| +assertEquals(undefined, large_array2[-1]);
|
| +assertEquals(large_array_size, large_array2.length);
|
| +
|
| +// Make sure it's possible to change the array's length and that array is still
|
| +// intact after the resize.
|
| +var large_array3 = new Array(large_array_size);
|
| +force_to_fast_double_array(large_array3);
|
| +large_array3.length = 60000;
|
| +assertEquals(60000, large_array3.length);
|
| +assertEquals(undefined, large_array3[60000]);
|
| +assertTrue(%HasFastDoubleElements(large_array3));
|
| +assertEquals(expected_array_value(5), large_array3[5]);
|
| +assertEquals(expected_array_value(6), large_array3[6]);
|
| +assertEquals(expected_array_value(7), large_array3[7]);
|
| +assertEquals(expected_array_value(large_array3.length-1),
|
| + large_array3[large_array3.length-1]);
|
| +assertEquals(undefined, large_array3[large_array_size-1]);
|
| +assertEquals(undefined, large_array3[-1]);
|
| +gc();
|
| +
|
| +for (var i= 0; i < large_array3.length; i += 501 ) {
|
| + assertEquals(expected_array_value(i), large_array3[i]);
|
| +}
|
| +
|
| +large_array3.length = 25;
|
| +assertEquals(25, large_array3.length);
|
| +assertTrue(%HasFastDoubleElements(large_array3));
|
| +assertEquals(undefined, large_array3[25]);
|
| +assertEquals(expected_array_value(5), large_array3[5]);
|
| +assertEquals(expected_array_value(6), large_array3[6]);
|
| +assertEquals(expected_array_value(7), large_array3[7]);
|
| +assertEquals(expected_array_value(large_array3.length-1),
|
| + large_array3[large_array3.length-1]);
|
| +assertEquals(undefined, large_array3[large_array_size-1]);
|
| +assertEquals(undefined, large_array3[-1]);
|
| +gc();
|
| +
|
| +for (var i= 0; i < large_array3.length; ++i) {
|
| + assertEquals(expected_array_value(i), large_array3[i]);
|
| +}
|
| +
|
| +large_array3.length = 100;
|
| +assertEquals(100, large_array3.length);
|
| +large_array3[95] = 95;
|
| +assertTrue(%HasFastDoubleElements(large_array3));
|
| +assertEquals(undefined, large_array3[100]);
|
| +assertEquals(95, large_array3[95]);
|
| +assertEquals(expected_array_value(5), large_array3[5]);
|
| +assertEquals(expected_array_value(6), large_array3[6]);
|
| +assertEquals(expected_array_value(7), large_array3[7]);
|
| +assertEquals(undefined, large_array3[large_array3.length-1]);
|
| +assertEquals(undefined, large_array3[large_array_size-1]);
|
| +assertEquals(undefined, large_array3[-1]);
|
| +gc();
|
| +
|
| +// Test apply on arrays backed by double elements.
|
| +function called_by_apply(arg0, arg1, arg2, arg3, arg4, arg5, arg6) {
|
| + assertEquals(expected_array_value(0), arg0);
|
| + assertEquals(NaN, arg1);
|
| + assertEquals(-NaN, arg2);
|
| + assertEquals(Infinity, arg3);
|
| + assertEquals(-Infinity, arg4);
|
| + assertEquals(expected_array_value(5), arg5);
|
| +}
|
| +
|
| +large_array3[1] = NaN;
|
| +large_array3[2] = -NaN;
|
| +large_array3[3] = Infinity;
|
| +large_array3[4] = -Infinity;
|
| +
|
| +function call_apply() {
|
| + assertTrue(%HasFastDoubleElements(large_array3));
|
| + called_by_apply.apply({}, large_array3);
|
| +}
|
| +
|
| +call_apply();
|
| +call_apply();
|
| +call_apply();
|
| +%OptimizeFunctionOnNextCall(call_apply);
|
| +call_apply();
|
| +call_apply();
|
| +call_apply();
|
| +
|
| +function test_for_in() {
|
| + // Due to previous tests, keys 0..25 and 95 should be present.
|
| + next_expected = 0;
|
| + assertTrue(%HasFastDoubleElements(large_array3));
|
| + for (x in large_array3) {
|
| + assertTrue(next_expected++ == x);
|
| + if (next_expected == 25) {
|
| + next_expected = 95;
|
| + }
|
| + }
|
| + assertTrue(next_expected == 96);
|
| +}
|
| +
|
| +test_for_in();
|
| +test_for_in();
|
| +test_for_in();
|
| +%OptimizeFunctionOnNextCall(test_for_in);
|
| +test_for_in();
|
| +test_for_in();
|
| +test_for_in();
|
| +
|
| +function test_get_property_names() {
|
| + names = %GetPropertyNames(large_array3);
|
| + property_name_count = 0;
|
| + for (x in names) { property_name_count++; };
|
| + assertEquals(26, property_name_count);
|
| +}
|
| +
|
| +test_get_property_names();
|
| +test_get_property_names();
|
| +test_get_property_names();
|
| +
|
| +// Test elements getters.
|
| +assertEquals(expected_array_value(10), large_array3[10]);
|
| +assertEquals(expected_array_value(-NaN), large_array3[2]);
|
| +large_array3.__defineGetter__("2", function(){
|
| + return expected_array_value(10);
|
| +});
|
| +
|
| +function test_getter() {
|
| + assertEquals(expected_array_value(10), large_array3[10]);
|
| + assertEquals(expected_array_value(10), large_array3[2]);
|
| +}
|
| +
|
| +test_getter();
|
| +test_getter();
|
| +test_getter();
|
| +%OptimizeFunctionOnNextCall(test_getter);
|
| +test_getter();
|
| +test_getter();
|
| +test_getter();
|
| +
|
| +// Test element setters.
|
| +large_array4 = new Array(large_array_size);
|
| +force_to_fast_double_array(large_array4);
|
| +
|
| +var setter_called = false;
|
| +
|
| +assertEquals(expected_array_value(10), large_array4[10]);
|
| +assertEquals(expected_array_value(2), large_array4[2]);
|
| +large_array4.__defineSetter__("10", function(value){
|
| + setter_called = true;
|
| + });
|
| +
|
| +function test_setter() {
|
| + setter_called = false;
|
| + large_array4[10] = 119;
|
| + assertTrue(setter_called);
|
| + assertEquals(undefined, large_array4[10]);
|
| + assertEquals(expected_array_value(2), large_array4[2]);
|
| +}
|
| +
|
| +test_setter();
|
| +test_setter();
|
| +test_setter();
|
| +%OptimizeFunctionOnNextCall(test_setter);
|
| +test_setter();
|
| +test_setter();
|
| +test_setter();
|
|
|