Function test

deps/v8/test/mjsunit/generated-transition-stub.js:8–202

()

%NeverOptimizeFunction(test);
function test() {

  const iteration_count = 1;

  function transition1(a, i, v) {
    a[i] = v;
  }

  //
  // Test PACKED SMI -> PACKED DOUBLE
  //

  %PrepareFunctionForOptimization(transition1);
  const a1 = [0, 1, 2, 3, 4];
  transition1(a1, 0, 2.5);
  const a2 = [0, 1, 2, 3, 4];
  transition1(a2, 0, 2.5);
  assertFalse(%HasHoleyElements(a2));
  %OptimizeFunctionOnNextCall(transition1);

  const a3 = [0, 1, 2, 3, 4];
  assertTrue(%HasSmiElements(a3));
  transition1(a3, 0, 2.5);
  assertFalse(%HasHoleyElements(a3));
  assertEquals(4, a3[4]);
  assertEquals(2.5, a3[0]);

  // Test handling of hole.
  const a4 = [0, 1, 2, 3, 4, 5, 6, 7, 8, 9];
  a4.length = 7;
  assertTrue(%HasSmiElements(a4));
  transition1(a4, 0, 2.5);
  assertFalse(%HasHoleyElements(a4));
  assertEquals(2.5, a4[0]);
  assertEquals(undefined, a4[8]);

  // Large array should deopt to runtimea
  for (j = 0; j < iteration_count; ++j) {
    const a5 = new Array();
    for (i = 0; i < 0x40000; ++i) {
      a5[i] = 0;
    }
    assertTrue(%HasSmiElements(a5) || %HasDoubleElements(a5));
    transition1(a5, 0, 2.5);
    assertEquals(2.5, a5[0]);
  }

  //
  // Test HOLEY SMI -> HOLEY DOUBLE
  //

  function transition2(a, i, v) {
    a[i] = v;
  }

  %PrepareFunctionForOptimization(transition2);
  const b1 = [0, 1, 2, , 4];
  transition2(b1, 0, 2.5);