2017-12-13 09:17:25 +00:00
|
|
|
// Copyright 2017 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
|
|
|
|
|
2017-12-14 07:40:31 +00:00
|
|
|
/* Test MapCheck behavior */
|
|
|
|
|
|
|
|
(function testForEachMapCheck() {
|
2017-12-13 09:17:25 +00:00
|
|
|
function f(v,n,o) {
|
|
|
|
Object.freeze(o);
|
|
|
|
}
|
|
|
|
function g() {
|
|
|
|
[1,2,3].forEach(f);
|
|
|
|
}
|
|
|
|
g();
|
|
|
|
g();
|
|
|
|
%OptimizeFunctionOnNextCall(g);
|
|
|
|
g();
|
|
|
|
%OptimizeFunctionOnNextCall(g);
|
|
|
|
g();
|
|
|
|
assertOptimized(g);
|
|
|
|
})();
|
|
|
|
|
|
|
|
|
2017-12-14 07:40:31 +00:00
|
|
|
(function testFindMapCheck() {
|
2017-12-13 09:17:25 +00:00
|
|
|
function f(v,n,o) {
|
|
|
|
Object.freeze(o);
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
function g() {
|
|
|
|
[1,2,3].find(f);
|
|
|
|
}
|
|
|
|
g();
|
|
|
|
g();
|
|
|
|
%OptimizeFunctionOnNextCall(g);
|
|
|
|
g();
|
|
|
|
%OptimizeFunctionOnNextCall(g);
|
|
|
|
g();
|
|
|
|
assertOptimized(g);
|
|
|
|
})();
|
|
|
|
|
2017-12-14 07:40:31 +00:00
|
|
|
(function testMapMapCheck() {
|
2017-12-13 09:17:25 +00:00
|
|
|
function f(v,n,o) {
|
|
|
|
Object.freeze(o);
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
function g() {
|
|
|
|
[1,2,3].map(f);
|
|
|
|
}
|
|
|
|
g();
|
|
|
|
g();
|
|
|
|
%OptimizeFunctionOnNextCall(g);
|
|
|
|
g();
|
|
|
|
%OptimizeFunctionOnNextCall(g);
|
|
|
|
g();
|
|
|
|
assertOptimized(g);
|
|
|
|
})();
|
|
|
|
|
2017-12-14 07:40:31 +00:00
|
|
|
(function testFilterMapCheck() {
|
2017-12-13 09:17:25 +00:00
|
|
|
function f(v,n,o) {
|
|
|
|
Object.freeze(o);
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
function g() {
|
|
|
|
[1,2,3].filter(f);
|
|
|
|
}
|
|
|
|
g();
|
|
|
|
g();
|
|
|
|
%OptimizeFunctionOnNextCall(g);
|
|
|
|
g();
|
|
|
|
%OptimizeFunctionOnNextCall(g);
|
|
|
|
g();
|
|
|
|
assertOptimized(g);
|
|
|
|
})();
|
2017-12-14 07:40:31 +00:00
|
|
|
|
|
|
|
|
|
|
|
/* Test CheckBounds behavior */
|
|
|
|
|
|
|
|
(function testForEachCheckBounds() {
|
|
|
|
function f(v,n,o) {
|
|
|
|
o.length=2;
|
|
|
|
}
|
|
|
|
function g() {
|
|
|
|
[1,2,3].forEach(f);
|
|
|
|
}
|
|
|
|
g();
|
|
|
|
g();
|
|
|
|
%OptimizeFunctionOnNextCall(g);
|
|
|
|
g();
|
|
|
|
%OptimizeFunctionOnNextCall(g);
|
|
|
|
g();
|
|
|
|
assertOptimized(g);
|
|
|
|
})();
|
|
|
|
|
|
|
|
|
|
|
|
(function testFindCheckBounds() {
|
|
|
|
function f(v,n,o) {
|
|
|
|
o.length=2;
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
function g() {
|
|
|
|
[1,2,3].find(f);
|
|
|
|
}
|
|
|
|
g();
|
|
|
|
g();
|
|
|
|
%OptimizeFunctionOnNextCall(g);
|
|
|
|
g();
|
|
|
|
%OptimizeFunctionOnNextCall(g);
|
|
|
|
g();
|
|
|
|
assertOptimized(g);
|
|
|
|
})();
|
|
|
|
|
|
|
|
(function testMapCheckBounds() {
|
|
|
|
function f(v,n,o) {
|
|
|
|
o.length=2;
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
function g() {
|
|
|
|
[1,2,3].map(f);
|
|
|
|
}
|
|
|
|
g();
|
|
|
|
g();
|
|
|
|
%OptimizeFunctionOnNextCall(g);
|
|
|
|
g();
|
|
|
|
%OptimizeFunctionOnNextCall(g);
|
|
|
|
g();
|
|
|
|
assertOptimized(g);
|
|
|
|
})();
|
|
|
|
|
|
|
|
(function testFilterCheckBounds() {
|
|
|
|
function f(v,n,o) {
|
|
|
|
o.length = 2;
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
function g() {
|
|
|
|
[1,2,3].filter(f);
|
|
|
|
}
|
|
|
|
g();
|
|
|
|
g();
|
|
|
|
%OptimizeFunctionOnNextCall(g);
|
|
|
|
g();
|
|
|
|
g();
|
|
|
|
%OptimizeFunctionOnNextCall(g);
|
|
|
|
g();
|
|
|
|
g();
|
|
|
|
assertOptimized(g);
|
|
|
|
})();
|