9c5053bf4d
- Add Map, WeakMap, Set, and WeakSet initial prototype maps to native context. - Set and WeakSet constructors check whether prototype map differs from initial before choosing the fast path. Bug: chromium:798026 Change-Id: I5f9cc2463f89e17f06a66b565c625fce133d01fb Reviewed-on: https://chromium-review.googlesource.com/853698 Commit-Queue: Peter Wong <peter.wm.wong@gmail.com> Reviewed-by: Jakob Gruber <jgruber@chromium.org> Reviewed-by: Camillo Bruni <cbruni@chromium.org> Cr-Commit-Position: refs/heads/master@{#50691}
77 lines
2.2 KiB
JavaScript
77 lines
2.2 KiB
JavaScript
// Copyright 2018 the V8 project authors. All rights reserved.
|
|
// Use of this source code is governed by a BSD-style license that can be
|
|
// found in the LICENSE file.
|
|
|
|
// Flags: --allow-natives-syntax --opt
|
|
|
|
function TestSetPrototypeModified(ctor) {
|
|
const originalPrototypeAdd = ctor.prototype.add;
|
|
const k1 = {};
|
|
const k2 = {};
|
|
const entries = [k1, k2];
|
|
let addCount = 0;
|
|
|
|
ctor.prototype.add = function(value) {
|
|
addCount++;
|
|
originalPrototypeAdd.call(this, value);
|
|
entries.length = 1;
|
|
};
|
|
const set = new ctor(entries);
|
|
|
|
assertEquals(1, addCount);
|
|
assertTrue(set.has(k1));
|
|
assertFalse(set.has(k2));
|
|
|
|
ctor.prototype.add = originalPrototypeAdd;
|
|
}
|
|
TestSetPrototypeModified(Set);
|
|
TestSetPrototypeModified(Set);
|
|
TestSetPrototypeModified(Set);
|
|
%OptimizeFunctionOnNextCall(TestSetPrototypeModified);
|
|
TestSetPrototypeModified(Set);
|
|
assertOptimized(TestSetPrototypeModified);
|
|
%DeoptimizeFunction(TestSetPrototypeModified);
|
|
|
|
TestSetPrototypeModified(WeakSet);
|
|
TestSetPrototypeModified(WeakSet);
|
|
TestSetPrototypeModified(WeakSet);
|
|
%OptimizeFunctionOnNextCall(TestSetPrototypeModified);
|
|
TestSetPrototypeModified(WeakSet);
|
|
assertOptimized(TestSetPrototypeModified);
|
|
%DeoptimizeFunction(TestSetPrototypeModified);
|
|
|
|
function TestMapPrototypeModified(ctor) {
|
|
const originalPrototypeSet = ctor.prototype.set;
|
|
const k1 = {};
|
|
const k2 = {};
|
|
const entries = [[k1, 1], [k2, 2]];
|
|
let setCount = 0;
|
|
|
|
ctor.prototype.set = function(key, value) {
|
|
setCount++;
|
|
originalPrototypeSet.call(this, key, value);
|
|
entries.length = 1;
|
|
};
|
|
const map = new ctor(entries);
|
|
|
|
assertEquals(1, setCount);
|
|
assertTrue(map.has(k1));
|
|
assertFalse(map.has(k2));
|
|
|
|
ctor.prototype.set = originalPrototypeSet;
|
|
}
|
|
TestMapPrototypeModified(Map);
|
|
TestMapPrototypeModified(Map);
|
|
TestMapPrototypeModified(Map);
|
|
%OptimizeFunctionOnNextCall(TestMapPrototypeModified);
|
|
TestMapPrototypeModified(Map);
|
|
assertOptimized(TestMapPrototypeModified);
|
|
%DeoptimizeFunction(TestMapPrototypeModified);
|
|
|
|
TestMapPrototypeModified(WeakMap);
|
|
TestMapPrototypeModified(WeakMap);
|
|
TestMapPrototypeModified(WeakMap);
|
|
%OptimizeFunctionOnNextCall(TestMapPrototypeModified);
|
|
TestMapPrototypeModified(WeakMap);
|
|
assertOptimized(TestMapPrototypeModified);
|