aboutsummaryrefslogtreecommitdiff
path: root/deps/v8/test/mjsunit/allocation-site-info.js
blob: 5f6817b6d365f19190d82d6f4169774086eac905 (plain)
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
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
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
167
168
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
198
199
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
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
// Copyright 2012 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.

// Flags: --allow-natives-syntax --smi-only-arrays --expose-gc
// Flags: --track-allocation-sites --noalways-opt

// Test element kind of objects.
// Since --smi-only-arrays affects builtins, its default setting at compile
// time sticks if built with snapshot.  If --smi-only-arrays is deactivated
// by default, only a no-snapshot build actually has smi-only arrays enabled
// in this test case.  Depending on whether smi-only arrays are actually
// enabled, this test takes the appropriate code path to check smi-only arrays.

// support_smi_only_arrays = %HasFastSmiElements(new Array(1,2,3,4,5,6,7,8));
support_smi_only_arrays = true;

if (support_smi_only_arrays) {
  print("Tests include smi-only arrays.");
} else {
  print("Tests do NOT include smi-only arrays.");
}

var elements_kind = {
  fast_smi_only            :  'fast smi only elements',
  fast                     :  'fast elements',
  fast_double              :  'fast double elements',
  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) {
  if (%HasFastSmiElements(obj)) return elements_kind.fast_smi_only;
  if (%HasFastObjectElements(obj)) return elements_kind.fast;
  if (%HasFastDoubleElements(obj)) return elements_kind.fast_double;
  if (%HasDictionaryElements(obj)) return elements_kind.dictionary;
}

function isHoley(obj) {
  if (%HasFastHoleyElements(obj)) return true;
  return false;
}

function assertKind(expected, obj, name_opt) {
  if (!support_smi_only_arrays &&
      expected == elements_kind.fast_smi_only) {
    expected = elements_kind.fast;
  }
  assertEquals(expected, getKind(obj), name_opt);
}

function assertHoley(obj, name_opt) {
  assertEquals(true, isHoley(obj), name_opt);
}

function assertNotHoley(obj, name_opt) {
  assertEquals(false, isHoley(obj), name_opt);
}

if (support_smi_only_arrays) {
  obj = [];
  assertNotHoley(obj);
  assertKind(elements_kind.fast_smi_only, obj);

  obj = [1, 2, 3];
  assertNotHoley(obj);
  assertKind(elements_kind.fast_smi_only, obj);

  obj = new Array();
  assertNotHoley(obj);
  assertKind(elements_kind.fast_smi_only, obj);

  obj = new Array(0);
  assertNotHoley(obj);
  assertKind(elements_kind.fast_smi_only, obj);

  obj = new Array(2);
  assertHoley(obj);
  assertKind(elements_kind.fast_smi_only, obj);

  obj = new Array(1,2,3);
  assertNotHoley(obj);
  assertKind(elements_kind.fast_smi_only, obj);

  obj = new Array(1, "hi", 2, undefined);
  assertNotHoley(obj);
  assertKind(elements_kind.fast, obj);

  function fastliteralcase(literal, value) {
    literal[0] = value;
    return literal;
  }

  function get_standard_literal() {
    var literal = [1, 2, 3];
    return literal;
  }

  // Case: [1,2,3] as allocation site
  obj = fastliteralcase(get_standard_literal(), 1);
  assertKind(elements_kind.fast_smi_only, obj);
  obj = fastliteralcase(get_standard_literal(), 1.5);
  assertKind(elements_kind.fast_double, obj);
  obj = fastliteralcase(get_standard_literal(), 2);
  assertKind(elements_kind.fast_double, obj);

  // The test below is in a loop because arrays that live
  // at global scope without the chance of being recreated
  // don't have allocation site information attached.
  for (i = 0; i < 2; i++) {
    obj = fastliteralcase([5, 3, 2], 1.5);
    assertKind(elements_kind.fast_double, obj);
    obj = fastliteralcase([3, 6, 2], 1.5);
    assertKind(elements_kind.fast_double, obj);
    obj = fastliteralcase([2, 6, 3], 2);
    assertKind(elements_kind.fast_smi_only, obj);
  }

  // Verify that we will not pretransition the double->fast path.
  obj = fastliteralcase(get_standard_literal(), "elliot");
  assertKind(elements_kind.fast, obj);
  // This fails until we turn off optimistic transitions to the
  // most general elements kind seen on keyed stores. It's a goal
  // to turn it off, but for now we need it.
  // obj = fastliteralcase(3);
  // assertKind(elements_kind.fast_double, obj);

  // Make sure this works in crankshafted code too.
  %OptimizeFunctionOnNextCall(get_standard_literal);
  get_standard_literal();
  obj = get_standard_literal();
  assertKind(elements_kind.fast_double, obj);

  function fastliteralcase_smifast(value) {
    var literal = [1, 2, 3, 4];
    literal[0] = value;
    return literal;
  }

  obj = fastliteralcase_smifast(1);
  assertKind(elements_kind.fast_smi_only, obj);
  obj = fastliteralcase_smifast("carter");
  assertKind(elements_kind.fast, obj);
  obj = fastliteralcase_smifast(2);
  assertKind(elements_kind.fast, obj);

  // Case: make sure transitions from packed to holey are tracked
  function fastliteralcase_smiholey(index, value) {
    var literal = [1, 2, 3, 4];
    literal[index] = value;
    return literal;
  }

  obj = fastliteralcase_smiholey(5, 1);
  assertKind(elements_kind.fast_smi_only, obj);
  assertHoley(obj);
  obj = fastliteralcase_smiholey(0, 1);
  assertKind(elements_kind.fast_smi_only, obj);
  assertHoley(obj);

  function newarraycase_smidouble(value) {
    var a = new Array();
    a[0] = value;
    return a;
  }

  // Case: new Array() as allocation site, smi->double
  obj = newarraycase_smidouble(1);
  assertKind(elements_kind.fast_smi_only, obj);
  obj = newarraycase_smidouble(1.5);
  assertKind(elements_kind.fast_double, obj);
  obj = newarraycase_smidouble(2);
  assertKind(elements_kind.fast_double, obj);

  function newarraycase_smiobj(value) {
    var a = new Array();
    a[0] = value;
    return a;
  }

  // Case: new Array() as allocation site, smi->fast
  obj = newarraycase_smiobj(1);
  assertKind(elements_kind.fast_smi_only, obj);
  obj = newarraycase_smiobj("gloria");
  assertKind(elements_kind.fast, obj);
  obj = newarraycase_smiobj(2);
  assertKind(elements_kind.fast, obj);

  function newarraycase_length_smidouble(value) {
    var a = new Array(3);
    a[0] = value;
    return a;
  }

  // Case: new Array(length) as allocation site
  obj = newarraycase_length_smidouble(1);
  assertKind(elements_kind.fast_smi_only, obj);
  obj = newarraycase_length_smidouble(1.5);
  assertKind(elements_kind.fast_double, obj);
  obj = newarraycase_length_smidouble(2);
  assertKind(elements_kind.fast_double, obj);

  // Try to continue the transition to fast object, but
  // we will not pretransition from double->fast, because
  // it may hurt performance ("poisoning").
  obj = newarraycase_length_smidouble("coates");
  assertKind(elements_kind.fast, obj);
  obj = newarraycase_length_smidouble(2.5);
  // However, because of optimistic transitions, we will
  // transition to the most general kind of elements kind found,
  // therefore I can't count on this assert yet.
  // assertKind(elements_kind.fast_double, obj);

  function newarraycase_length_smiobj(value) {
    var a = new Array(3);
    a[0] = value;
    return a;
  }

  // Case: new Array(<length>) as allocation site, smi->fast
  obj = newarraycase_length_smiobj(1);
  assertKind(elements_kind.fast_smi_only, obj);
  obj = newarraycase_length_smiobj("gloria");
  assertKind(elements_kind.fast, obj);
  obj = newarraycase_length_smiobj(2);
  assertKind(elements_kind.fast, obj);

  function newarraycase_list_smidouble(value) {
    var a = new Array(1, 2, 3);
    a[0] = value;
    return a;
  }

  obj = newarraycase_list_smidouble(1);
  assertKind(elements_kind.fast_smi_only, obj);
  obj = newarraycase_list_smidouble(1.5);
  assertKind(elements_kind.fast_double, obj);
  obj = newarraycase_list_smidouble(2);
  assertKind(elements_kind.fast_double, obj);

  function newarraycase_list_smiobj(value) {
    var a = new Array(4, 5, 6);
    a[0] = value;
    return a;
  }

  obj = newarraycase_list_smiobj(1);
  assertKind(elements_kind.fast_smi_only, obj);
  obj = newarraycase_list_smiobj("coates");
  assertKind(elements_kind.fast, obj);
  obj = newarraycase_list_smiobj(2);
  assertKind(elements_kind.fast, obj);

  // Case: array constructor calls with out of date feedback.
  // The boilerplate should incorporate all feedback, but the input array
  // should be minimally transitioned based on immediate need.
  (function() {
    function foo(i) {
      // We have two cases, one for literals one for constructed arrays.
      var a = (i == 0)
        ? [1, 2, 3]
        : new Array(1, 2, 3);
      return a;
    }

    for (i = 0; i < 2; i++) {
      a = foo(i);
      b = foo(i);
      b[5] = 1;  // boilerplate goes holey
      assertHoley(foo(i));
      a[0] = 3.5;  // boilerplate goes holey double
      assertKind(elements_kind.fast_double, a);
      assertNotHoley(a);
      c = foo(i);
      assertKind(elements_kind.fast_double, c);
      assertHoley(c);
    }
  })();

  function newarraycase_onearg(len, value) {
    var a = new Array(len);
    a[0] = value;
    return a;
  }

  obj = newarraycase_onearg(5, 3.5);
  assertKind(elements_kind.fast_double, obj);
  obj = newarraycase_onearg(10, 5);
  assertKind(elements_kind.fast_double, obj);
  obj = newarraycase_onearg(0, 5);
  assertKind(elements_kind.fast_double, obj);
  // Now pass a length that forces the dictionary path.
  obj = newarraycase_onearg(100000, 5);
  assertKind(elements_kind.dictionary, obj);
  assertTrue(obj.length == 100000);

  // Verify that cross context calls work
  var realmA = Realm.current();
  var realmB = Realm.create();
  assertEquals(0, realmA);
  assertEquals(1, realmB);

  function instanceof_check(type) {
    assertTrue(new type() instanceof type);
    assertTrue(new type(5) instanceof type);
    assertTrue(new type(1,2,3) instanceof type);
  }

  function instanceof_check2(type) {
    assertTrue(new type() instanceof type);
    assertTrue(new type(5) instanceof type);
    assertTrue(new type(1,2,3) instanceof type);
  }

  var realmBArray = Realm.eval(realmB, "Array");
  instanceof_check(Array);
  instanceof_check(realmBArray);

  // instanceof_check2 is here because the call site goes through a state.
  // Since instanceof_check(Array) was first called with the current context
  // Array function, it went from (uninit->Array) then (Array->megamorphic).
  // We'll get a different state traversal if we start with realmBArray.
  // It'll go (uninit->realmBArray) then (realmBArray->megamorphic). Recognize
  // that state "Array" implies an AllocationSite is present, and code is
  // configured to use it.
  instanceof_check2(realmBArray);
  instanceof_check2(Array);

  %OptimizeFunctionOnNextCall(instanceof_check);

  // No de-opt will occur because HCallNewArray wasn't selected, on account of
  // the call site not being monomorphic to Array.
  instanceof_check(Array);
  assertOptimized(instanceof_check);
  instanceof_check(realmBArray);
  assertOptimized(instanceof_check);

  // Try to optimize again, but first clear all type feedback, and allow it
  // to be monomorphic on first call. Only after crankshafting do we introduce
  // realmBArray. This should deopt the method.
  %DeoptimizeFunction(instanceof_check);
  %ClearFunctionTypeFeedback(instanceof_check);
  instanceof_check(Array);
  instanceof_check(Array);
  %OptimizeFunctionOnNextCall(instanceof_check);
  instanceof_check(Array);
  assertOptimized(instanceof_check);

  instanceof_check(realmBArray);
  assertUnoptimized(instanceof_check);
}