test: Remove two obsolete regression tests

This CL removes two obsolete regression tests that were taking too
long on debug engine builds.

Bug: v8:12753
Bug: v8:12754
Change-Id: I818101725caa22fb4b2ed22381f01a2dd9436fe4
Reviewed-on: https://chromium-review.googlesource.com/c/v8/v8/+/3563563
Reviewed-by: Michael Lippautz <mlippautz@chromium.org>
Reviewed-by: Michael Achenbach <machenbach@chromium.org>
Commit-Queue: Nikolaos Papaspyrou <nikolaos@chromium.org>
Cr-Commit-Position: refs/heads/main@{#79727}
This commit is contained in:
Nikolaos Papaspyrou 2022-04-04 09:48:44 +02:00 committed by V8 LUCI CQ
parent dfe465d1ba
commit 173885cda8
3 changed files with 0 additions and 91 deletions

View File

@ -359,7 +359,6 @@
'compiler/array-multiple-receiver-maps': [SKIP],
# Tests taking too long
'regress/regress-1122': [SKIP],
'regress/regress-331444': [SKIP],
'regress/regress-353551': [SKIP],
'regress/regress-crbug-119926': [SKIP],
'regress/short-circuit': [SKIP],
@ -519,7 +518,6 @@
['is_full_debug', {
# Tests too slow in non-optimized debug mode.
'regress/regress-2790': [SKIP],
'regress/regress-331444': [SKIP],
'regress/regress-740784': [SKIP],
'regress/regress-992389': [SKIP],
}], # 'is_full_debug'
@ -594,7 +592,6 @@
'math-floor-of-div-nosudiv': [PASS, SLOW],
'messages': [PASS, SLOW],
'regress/regress-2790': [PASS, SLOW],
'regress/regress-331444': [PASS, SLOW],
'regress/regress-490': [PASS, SLOW],
'regress/regress-crbug-217858': [PASS, SLOW],
'regress/regress-create-exception': [PASS, SLOW],
@ -1210,7 +1207,6 @@
'regress/regress-crbug-482998': [SKIP],
'regress/regress-91008': [PASS, SLOW],
'regress/regress-779407': [PASS, SLOW],
'regress/regress-331444': [PASS, SLOW],
'harmony/regexp-property-lu-ui': [PASS, SLOW],
'whitespaces': [PASS, SLOW],
'generated-transition-stub': [PASS, SLOW],
@ -1695,7 +1691,6 @@
'wasm/memory_2gb_oob': [SKIP],
'wasm/memory_1gb_oob': [SKIP],
'wasm/memory_4gb_oob': [SKIP],
'regress/regress-331444': [SKIP],
'regress/regress-708247': [SKIP],
# Performs GC
'code-coverage-precise': [SKIP],

View File

@ -1,44 +0,0 @@
// Copyright 2014 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: --expose-gc
function boom() {
var args = [];
for (var i = 0; i < 110000; i++)
args.push(i);
return Array.apply(Array, args);
}
var array = boom();
function fib(n) {
var f0 = 0, f1 = 1;
for (; n > 0; n = n - 1) {
f0 + f1;
f0 = array;
}
}
fib(12);

View File

@ -1,42 +0,0 @@
// Copyright 2015 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: --expose-gc
var __v_9 = {};
var depth = 15;
var current = 0;
function __f_15(__v_3) {
if ((__v_3 % 50) != 0) {
return __v_3;
} else {
return __v_9 + 0.5;
}
}
function __f_13(a) {
a[100000 - 2] = 1;
for (var __v_3= 0; __v_3 < 70000; ++__v_3 ) {
a[__v_3] = __f_15(__v_3);
}
}
function __f_2(size) {
}
var tmp;
function __f_18(allocator) {
current++;
if (current == depth) return;
var __v_7 = new allocator(100000);
__f_13(__v_7);
var __v_4 = 6;
for (var __v_3= 0; __v_3 < 70000; __v_3 += 501 ) {
tmp += __v_3;
}
__f_18(Array);
current--;
}
gc();
__f_18(__f_2);