Commit 2c834b1c authored by Simon Zünd's avatar Simon Zünd Committed by Commit Bot

Remove Array.p.sort regression test "regress-2185"

This CL removes a regression test that was intended to check that the
maximum call stack size was not exceeded when calling Array.p.sort.

As the new sorting algorithm (TimSort) does not work recursively, this
test is no longer really necessary. It is also rather slow and causes
issues on some bots, so we remove the test.

R=mslekova@chromium.org

Bug: v8:7783
Change-Id: I5bb9693ab825fe077776fd6825688545286285fd
Reviewed-on: https://chromium-review.googlesource.com/1196511Reviewed-by: 's avatarJakob Gruber <jgruber@chromium.org>
Commit-Queue: Simon Zünd <szuend@google.com>
Cr-Commit-Position: refs/heads/master@{#55527}
parent f19a7068
...@@ -375,7 +375,6 @@ ...@@ -375,7 +375,6 @@
'math-floor-of-div': [PASS, SLOW], 'math-floor-of-div': [PASS, SLOW],
'messages': [PASS, SLOW], 'messages': [PASS, SLOW],
'packed-elements': [PASS, SLOW], 'packed-elements': [PASS, SLOW],
'regress/regress-2185': [PASS, SLOW],
'regress/regress-2790': [PASS, SLOW], 'regress/regress-2790': [PASS, SLOW],
'regress/regress-331444': [PASS, SLOW], 'regress/regress-331444': [PASS, SLOW],
'regress/regress-490': [PASS, SLOW], 'regress/regress-490': [PASS, SLOW],
...@@ -802,18 +801,11 @@ ...@@ -802,18 +801,11 @@
# Slow tests: https://crbug.com/v8/7783 # Slow tests: https://crbug.com/v8/7783
'lexicographic-compare': [SKIP], 'lexicographic-compare': [SKIP],
'md5': [SKIP], 'md5': [SKIP],
'regress/regress-2185': [SKIP],
'wasm/asm-wasm-f32': [SKIP], 'wasm/asm-wasm-f32': [SKIP],
'wasm/asm-wasm-f64': [SKIP], 'wasm/asm-wasm-f64': [SKIP],
'wasm/grow-memory': [SKIP], 'wasm/grow-memory': [SKIP],
}], # variant == nooptimization and (arch == arm or arch == arm64) and simulator_run }], # variant == nooptimization and (arch == arm or arch == arm64) and simulator_run
##############################################################################
['(arch == arm or arch == arm64) and simulator_run', {
# Slow tests: https://crbug.com/v8/7783
'regress/regress-2185': [SKIP],
}], # (arch == arm or arch == arm64) and simulator_run
############################################################################## ##############################################################################
['(arch == arm or arch == arm64)', { ['(arch == arm or arch == arm64)', {
# Flaky tests: https://crbug.com/v8/8090 # Flaky tests: https://crbug.com/v8/8090
......
// 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: --noenable-slow-asserts
var a = [];
for (var i = 0; i < 2; i++) {
for (var j = 0; j < 30000; j++) {
a.push(j);
}
}
a.sort(function(a, b) { return a - b; } );
Markdown is supported
0% or
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment