Dante/Kmake
1
0
Fork 0
forked from LeenkxTeam/Kmake
Code Pull Requests Activity

Upload Kmake

Browse Source
This commit is contained in:
Gorochu
2026-05-26 23:36:42 -07:00
parent ba051b2f74
commit 555ec72358
41615 changed files with 13344630 additions and 1 deletions
Download Patch File Download Diff File Expand all files Collapse all files

195
deps/v8/test/mjsunit/compiler/regress-crbug-1227677.js vendored Normal file
View File

@ -0,0 +1,195 @@
// Copyright 2021 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 --interrupt-budget=1024
(function() {
async function foo() {
for (let j = 0; j < 1; j++) {
const x = 2n * 3n;
for (let k = 0; k < 4; k++) {
function unused() {}
x >> 5n;
for (let i = 0; i < 100; i++) ;
for (let i = 0; i == 6; i++) await 7;
}
}
}
%PrepareFunctionForOptimization(foo);
foo();
foo();
%OptimizeFunctionOnNextCall(foo);
foo();
})();
(function() {
async function foo() {
for (let j = 0; j < 1; j++) {
const x = 2n * 3n;
for (let k = 0; k < 4; k++) {
function unused() {}
x << 5n;
for (let i = 0; i < 100; i++) ;
for (let i = 0; i == 6; i++) await 7;
}
}
}
%PrepareFunctionForOptimization(foo);
foo();
foo();
%OptimizeFunctionOnNextCall(foo);
foo();
})();
(function() {
async function foo() {
for (let j = 0; j < 1; j++) {
const x = 2n * 3n;
for (let k = 0; k < 4; k++) {
function unused() {}
x / 5n;
for (let i = 0; i < 100; i++) ;
for (let i = 0; i == 6; i++) await 7;
}
}
}
%PrepareFunctionForOptimization(foo);
foo();
foo();
%OptimizeFunctionOnNextCall(foo);
foo();
})();
(function() {
async function foo() {
for (let j = 0; j < 1; j++) {
const x = 2n * 3n;
for (let k = 0; k < 4; k++) {
function unused() {}
x % 5n;
for (let i = 0; i < 100; i++) ;
for (let i = 0; i == 6; i++) await 7;
}
}
}
%PrepareFunctionForOptimization(foo);
foo();
foo();
%OptimizeFunctionOnNextCall(foo);
foo();
})();
(function() {
async function foo() {
for (let j = 0; j < 1; j++) {
const x = 2n * 3n;
for (let k = 0; k < 4; k++) {
function unused() {}
x * 5n;
for (let i = 0; i < 100; i++) ;
for (let i = 0; i == 6; i++) await 7;
}
}
}
%PrepareFunctionForOptimization(foo);
foo();
foo();
%OptimizeFunctionOnNextCall(foo);
foo();
})();
(function() {
async function foo() {
for (let j = 0; j < 1; j++) {
const x = 2n * 3n;
for (let k = 0; k < 4; k++) {
function unused() {}
x ^ 5n;
for (let i = 0; i < 100; i++) ;
for (let i = 0; i == 6; i++) await 7;
}
}
}
%PrepareFunctionForOptimization(foo);
foo();
foo();
%OptimizeFunctionOnNextCall(foo);
foo();
})();
(function() {
async function foo() {
for (let j = 0; j < 1; j++) {
const x = 2n * 3n;
for (let k = 0; k < 4; k++) {
function unused() {}
x & 5n;
for (let i = 0; i < 100; i++) ;
for (let i = 0; i == 6; i++) await 7;
}
}
}
%PrepareFunctionForOptimization(foo);
foo();
foo();
%OptimizeFunctionOnNextCall(foo);
foo();
})();
(function() {
async function foo() {
for (let j = 0; j < 1; j++) {
const x = 2n * 3n;
for (let k = 0; k < 4; k++) {
function unused() {}
x | 5n;
for (let i = 0; i < 100; i++) ;
for (let i = 0; i == 6; i++) await 7;
}
}
}
%PrepareFunctionForOptimization(foo);
foo();
foo();
%OptimizeFunctionOnNextCall(foo);
foo();
})();
(function() {
async function foo() {
for (let j = 0; j < 1; j++) {
const x = 2n * 3n;
for (let k = 0; k < 4; k++) {
function unused() {}
x + 5n;
for (let i = 0; i < 100; i++) ;
for (let i = 0; i == 6; i++) await 7;
}
}
}
%PrepareFunctionForOptimization(foo);
foo();
foo();
%OptimizeFunctionOnNextCall(foo);
foo();
})();
(function() {
async function foo() {
for (let j = 0; j < 1; j++) {
const x = 2n * 3n;
for (let k = 0; k < 4; k++) {
function unused() {}
x < 5n;
for (let i = 0; i < 100; i++) ;
for (let i = 0; i == 6; i++) await 7;
}
}
}
%PrepareFunctionForOptimization(foo);
foo();
foo();
%OptimizeFunctionOnNextCall(foo);
foo();
})();