array-literal-feedback.js 6.67 KB
Newer Older
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27
// Copyright 2013 the V8 project authors. All rights reserved.
// Redistribution and use in source and binary forms, with or without
// modification, are permitted provided that the following conditions are
// met:
//
//     * Redistributions of source code must retain the above copyright
//       notice, this list of conditions and the following disclaimer.
//     * Redistributions in binary form must reproduce the above
//       copyright notice, this list of conditions and the following
//       disclaimer in the documentation and/or other materials provided
//       with the distribution.
//     * Neither the name of Google Inc. nor the names of its
//       contributors may be used to endorse or promote products derived
//       from this software without specific prior written permission.
//
// THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
// "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
// LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
// A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
// OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
// SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
// LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
// DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
// THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
// (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
// OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.

28
// Flags: --allow-natives-syntax --expose-gc --opt --no-always-opt --deopt-every-n-times=0
29

30
var elements_kind = {
31 32 33
  packed_smi               :  'packed smi elements',
  packed                   :  'packed elements',
  packed_double            :  'packed double elements',
34 35 36 37 38 39 40 41 42 43 44 45 46
  dictionary               :  'dictionary elements',
  external_byte            :  'external byte elements',
  external_unsigned_byte   :  'external unsigned byte elements',
  external_short           :  'external short elements',
  external_unsigned_short  :  'external unsigned short elements',
  external_int             :  'external int elements',
  external_unsigned_int    :  'external unsigned int elements',
  external_float           :  'external float elements',
  external_double          :  'external double elements',
  external_pixel           :  'external pixel elements'
}

function getKind(obj) {
47 48 49
  if (%HasSmiElements(obj)) return elements_kind.packed_smi;
  if (%HasObjectElements(obj)) return elements_kind.packed;
  if (%HasDoubleElements(obj)) return elements_kind.packed_double;
50 51 52 53
  if (%HasDictionaryElements(obj)) return elements_kind.dictionary;
}

function isHoley(obj) {
54
  if (%HasHoleyElements(obj)) return true;
55 56 57 58 59 60 61
  return false;
}

function assertKind(expected, obj, name_opt) {
  assertEquals(expected, getKind(obj), name_opt);
}

62 63 64
function get_literal(x) {
  var literal = [1, 2, x];
  return literal;
65
};
66

67
%PrepareFunctionForOptimization(get_literal);
68 69 70 71
get_literal(3);
// It's important to store a from before we crankshaft get_literal, because
// mementos won't be created from crankshafted code at all.
a = get_literal(3);
72
%OptimizeFunctionOnNextCall(get_literal);
73 74
get_literal(3);
assertOptimized(get_literal);
75
assertTrue(%HasSmiElements(a));
76 77 78 79 80 81 82
// a has a memento so the transition caused by the store will affect the
// boilerplate.
a[0] = 3.5;

// We should have transitioned the boilerplate array to double, and
// crankshafted code should de-opt on the unexpected elements kind
b = get_literal(3);
83
assertTrue(%HasDoubleElements(b));
84 85 86 87
assertEquals([1, 2, 3], b);
assertUnoptimized(get_literal);

// Optimize again
88
%PrepareFunctionForOptimization(get_literal);
89
get_literal(3);
90
%OptimizeFunctionOnNextCall(get_literal);
91
b = get_literal(3);
92
assertTrue(%HasDoubleElements(b));
93
assertOptimized(get_literal);
94 95


96
// Test: make sure allocation site information is updated through a
97
// transition from SMI->DOUBLE->PACKED
98 99 100 101
(function() {
  function bar(a, b, c) {
    return [a, b, c];
  }
102

103
  a = bar(1, 2, 3);
104 105
  a[0] = 3.5;
  a[1] = 'hi';
106
  b = bar(1, 2, 3);
107 108 109 110 111 112 113
  assertKind(elements_kind.packed, b);
})();


(function changeOptimizedEmptyArrayKind() {
  function f() {
    return new Array();
114 115
  };
  %PrepareFunctionForOptimization(f);
116 117 118 119 120 121 122 123 124 125 126 127 128 129 130
  var a = f();
  assertKind('packed smi elements', a);
  a = f();
  assertKind('packed smi elements', a);
  a = f();
  a.push(0.5);
  assertKind('packed double elements', a);
  %OptimizeFunctionOnNextCall(f);
  a = f();
  assertKind('packed double elements', a);
})();

(function changeOptimizedArrayLiteralKind() {
  function f() {
    return [1, 2];
131 132
  };
  %PrepareFunctionForOptimization(f);
133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166
  var a = f();
  assertKind('packed smi elements', a);

  a = f();
  a.push(0.5);
  assertKind('packed double elements', a);

  a = f();
  assertKind('packed double elements', a);
  assertFalse(isHoley(a));

  a = f();
  a.push(undefined);
  assertKind('packed elements', a);
  assertFalse(isHoley(a));

  a = f();
  assertKind('packed elements', a);
  assertFalse(isHoley(a));

  %OptimizeFunctionOnNextCall(f);

  a = f();
  assertKind('packed elements', a);
  assertFalse(isHoley(a));

  a = f();
  assertKind('packed elements', a);
  assertFalse(isHoley(a));
})();

(function changeOptimizedEmptyArrayLiteralKind() {
  function f() {
    return [];
167 168
  };
  %PrepareFunctionForOptimization(f);
169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197
  var a = f();
  assertKind('packed smi elements', a);
  assertFalse(isHoley(a));

  a = f();
  a.push(0.5);
  assertKind('packed double elements', a);
  assertFalse(isHoley(a));

  a = f();
  assertKind('packed double elements', a);
  assertFalse(isHoley(a));

  %OptimizeFunctionOnNextCall(f);

  a = f();
  assertKind('packed double elements', a);
  assertFalse(isHoley(a));

  a = f();
  assertKind('packed double elements', a);
  assertFalse(isHoley(a));
})();

(function changeEmptyArrayLiteralKind2() {
  function f() {
    var literal = [];
    %HeapObjectVerify(literal);
    return literal;
198 199
  };
  %PrepareFunctionForOptimization(f);
200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238
  var a = f();
  assertKind('packed smi elements', a);
  assertFalse(isHoley(a));

  a = f();
  a.push(0.5);
  assertKind('packed double elements', a);
  assertFalse(isHoley(a));

  a = f();
  assertKind('packed double elements', a);
  assertFalse(isHoley(a));

  a = f();
  a.push(undefined);
  assertKind('packed elements', a);
  assertFalse(isHoley(a));

  a = f();
  assertKind('packed elements', a);
  assertFalse(isHoley(a));

  a = f();
  a[10] = 1;
  assertKind('packed elements', a);
  assertTrue(isHoley(a));

  a = f();
  assertKind('packed elements', a);
  assertTrue(isHoley(a));

  a = f();
  a[10000] = 1;
  assertKind('dictionary elements', a);
  assertFalse(isHoley(a));

  a = f();
  assertKind('packed elements', a);
  assertTrue(isHoley(a));
239
})();