summaryrefslogtreecommitdiff
path: root/deps/v8/test/mjsunit/optimized-array-indexof.js
diff options
context:
space:
mode:
Diffstat (limited to 'deps/v8/test/mjsunit/optimized-array-indexof.js')
-rw-r--r--deps/v8/test/mjsunit/optimized-array-indexof.js360
1 files changed, 360 insertions, 0 deletions
diff --git a/deps/v8/test/mjsunit/optimized-array-indexof.js b/deps/v8/test/mjsunit/optimized-array-indexof.js
new file mode 100644
index 0000000000..d0fe067a6a
--- /dev/null
+++ b/deps/v8/test/mjsunit/optimized-array-indexof.js
@@ -0,0 +1,360 @@
+// Copyright 2022 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 --turbo-inline-array-builtins --opt
+// Flags: --no-always-opt
+
+
+// normal case
+(() => {
+ const a = [
+ 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13,
+ 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25
+ ];
+ function testArrayIndexOf() {
+ return a.indexOf(20, 0);
+ }
+ %PrepareFunctionForOptimization(testArrayIndexOf);
+ testArrayIndexOf();
+ assertEquals(19, testArrayIndexOf());
+ %OptimizeFunctionOnNextCall(testArrayIndexOf);
+ testArrayIndexOf();
+ assertEquals(19, testArrayIndexOf());
+ testArrayIndexOf();
+ assertOptimized(testArrayIndexOf);
+})();
+
+// from_index is not smi will lead to bailout
+(() => {
+ const a = [
+ 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13,
+ 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25
+ ];
+ function testArrayIndexOf() {
+ return a.indexOf(20, {
+ valueOf: () => {
+ return 0;
+ }
+ });
+ }
+ %PrepareFunctionForOptimization(testArrayIndexOf);
+ testArrayIndexOf();
+ assertEquals(19, testArrayIndexOf());
+ %OptimizeFunctionOnNextCall(testArrayIndexOf);
+ testArrayIndexOf();
+ assertEquals(19, testArrayIndexOf());
+ assertFalse(isOptimized(testArrayIndexOf));
+})();
+
+// Length change detected during get from_index, will bailout
+(() => {
+ let called_values;
+ function testArrayIndexOf(deopt) {
+ const a = [1, 2, 3, 4, 5, 6, 7, 8, 9, 10];
+ return a.indexOf(9, {
+ valueOf: () => {
+ if (deopt) {
+ a.length = 3;
+ }
+ return 0;
+ }
+ });
+ }
+ %PrepareFunctionForOptimization(testArrayIndexOf);
+ assertEquals(8, testArrayIndexOf());
+ testArrayIndexOf();
+ %OptimizeFunctionOnNextCall(testArrayIndexOf);
+ assertEquals(8, testArrayIndexOf());
+ assertEquals(-1, testArrayIndexOf(true));
+ assertFalse(isOptimized(testArrayIndexOf));
+})();
+
+// Input array change during get from_index, will bailout
+(() => {
+ function testArrayIndexOf(deopt) {
+ const a = [1, 2, 3, 4, 5];
+ return a.indexOf(9, {
+ valueOf: () => {
+ if (deopt) {
+ a[0] = 9;
+ }
+ return 0;
+ }
+ });
+ }
+ %PrepareFunctionForOptimization(testArrayIndexOf);
+ assertEquals(-1, testArrayIndexOf());
+ testArrayIndexOf();
+ %OptimizeFunctionOnNextCall(testArrayIndexOf);
+ assertEquals(0, testArrayIndexOf(true));
+ assertEquals(-1, testArrayIndexOf());
+ assertFalse(isOptimized(testArrayIndexOf));
+})();
+
+// Handle from_index is undefined, will bail out
+(() => {
+ const a = [
+ 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13,
+ 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25
+ ];
+ function testArrayIndexOf() {
+ return a.indexOf(20, undefined);
+ }
+ %PrepareFunctionForOptimization(testArrayIndexOf);
+ testArrayIndexOf();
+ assertEquals(19, testArrayIndexOf());
+ %OptimizeFunctionOnNextCall(testArrayIndexOf);
+ testArrayIndexOf();
+ assertEquals(19, testArrayIndexOf());
+ assertFalse(isOptimized(testArrayIndexOf));
+})();
+
+// Handle from_index is null, will bail out
+(() => {
+ const a = [
+ 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13,
+ 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25
+ ];
+ function testArrayIndexOf() {
+ return a.indexOf(20, undefined);
+ }
+ %PrepareFunctionForOptimization(testArrayIndexOf);
+ testArrayIndexOf();
+ assertEquals(19, testArrayIndexOf());
+ %OptimizeFunctionOnNextCall(testArrayIndexOf);
+ testArrayIndexOf();
+ assertEquals(19, testArrayIndexOf());
+ assertFalse(isOptimized(testArrayIndexOf));
+})();
+
+// Handle from_index is float, will bail out
+(() => {
+ const a = [
+ 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13,
+ 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25
+ ];
+ function testArrayIndexOf() {
+ return a.indexOf(20, 0.5);
+ }
+ %PrepareFunctionForOptimization(testArrayIndexOf);
+ testArrayIndexOf();
+ assertEquals(19, testArrayIndexOf());
+ %OptimizeFunctionOnNextCall(testArrayIndexOf);
+ testArrayIndexOf();
+ assertEquals(19, testArrayIndexOf());
+ assertFalse(isOptimized(testArrayIndexOf));
+})();
+
+// Handle from_index is symbol, will throw
+(() => {
+ const a = [
+ 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13,
+ 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25
+ ];
+ function testArrayIndexOf() {
+ return a.indexOf(20, Symbol.for('123'));
+ }
+ %PrepareFunctionForOptimization(testArrayIndexOf);
+ assertThrows(() => testArrayIndexOf());
+ %OptimizeFunctionOnNextCall(testArrayIndexOf);
+ assertThrows(() => testArrayIndexOf());
+ assertFalse(isOptimized(testArrayIndexOf));
+})();
+
+// Handle from_index is string, will bailout
+(() => {
+ const a = [
+ 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13,
+ 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25
+ ];
+ function testArrayIndexOf() {
+ return a.indexOf(20, '0');
+ }
+ %PrepareFunctionForOptimization(testArrayIndexOf);
+ testArrayIndexOf();
+ assertEquals(19, testArrayIndexOf());
+ %OptimizeFunctionOnNextCall(testArrayIndexOf);
+ testArrayIndexOf()
+ assertEquals(19, testArrayIndexOf());
+ assertFalse(isOptimized(testArrayIndexOf));
+})();
+
+// Handle from_index is object which cannot convert to smi, will throw
+(() => {
+ const a = [
+ 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13,
+ 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25
+ ];
+ function testArrayIndexOf() {
+ return a.indexOf(20, {
+ valueOf: () => {
+ return Symbol.for('123')
+ }
+ });
+ }
+ %PrepareFunctionForOptimization(testArrayIndexOf);
+ assertThrows(() => testArrayIndexOf());
+ %OptimizeFunctionOnNextCall(testArrayIndexOf);
+ assertThrows(() => testArrayIndexOf());
+ assertFalse(isOptimized(testArrayIndexOf));
+})();
+
+// Handle input array is smi packed elements and search_element is number
+// , will be inlined
+(() => {
+ const a = [
+ 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13,
+ 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25
+ ];
+ function testArrayIndexOf() {
+ return a.indexOf(20);
+ }
+ %PrepareFunctionForOptimization(testArrayIndexOf);
+ testArrayIndexOf();
+ assertEquals(19, testArrayIndexOf());
+ %OptimizeFunctionOnNextCall(testArrayIndexOf);
+ testArrayIndexOf();
+ assertEquals(19, testArrayIndexOf());
+ assertOptimized(testArrayIndexOf);
+})();
+
+// Handle input array is double packed elements, will be inlined
+(() => {
+ const a = [
+ 1.5, 2.5, 3.5, 4.5, 5.5, 6.5, 7.5, 8.5, 9.5,
+ 10.5, 11.5, 12.5, 13.5, 14.5, 15.5, 16.5, 17.5, 18.5,
+ 19.5, 20.5, 21.5, 22.5, 23.5, 24.5, 25.5
+ ];
+ function testArrayIndexOf() {
+ return a.indexOf(20.5);
+ }
+ %PrepareFunctionForOptimization(testArrayIndexOf);
+ testArrayIndexOf();
+ assertEquals(19, testArrayIndexOf());
+ %OptimizeFunctionOnNextCall(testArrayIndexOf);
+ testArrayIndexOf();
+ assertEquals(19, testArrayIndexOf());
+ assertOptimized(testArrayIndexOf);
+})();
+
+// Handle input array is double packed elements and has NaN, will be inlined
+(() => {
+ const a = [
+ NaN, 2.5, 3.5, 4.5, 5.5, 6.5, 7.5, 8.5, 9.5,
+ 10.5, 11.5, 12.5, 13.5, 14.5, 15.5, 16.5, 17.5, 18.5,
+ 19.5, 20.5, 21.5, 22.5, 23.5, 24.5, 25.5
+ ];
+ function testArrayIndexOf() {
+ return a.indexOf(NaN);
+ }
+ %PrepareFunctionForOptimization(testArrayIndexOf);
+ testArrayIndexOf();
+ assertEquals(-1, testArrayIndexOf());
+ %OptimizeFunctionOnNextCall(testArrayIndexOf);
+ testArrayIndexOf();
+ assertEquals(-1, testArrayIndexOf());
+ assertOptimized(testArrayIndexOf);
+})();
+
+// Handle input array is packed elements and search_element is double,
+// will be inlined
+(() => {
+ const a = [
+ 1.5, 2.5, Symbol.for("123"), "4.5", BigInt(123), 6.5, 7.5, 8.5, 9.5,
+ 10.5, 11.5, 12.5, 13.5, 14.5, 15.5, 16.5, 17.5, 18.5,
+ 19.5, 20.5, 21.5, 22.5, 23.5, 24.5, {}
+ ];
+ function testArrayIndexOf() {
+ return a.indexOf(20.5);
+ }
+ %PrepareFunctionForOptimization(testArrayIndexOf);
+ testArrayIndexOf();
+ assertEquals(19, testArrayIndexOf());
+ %OptimizeFunctionOnNextCall(testArrayIndexOf);
+ testArrayIndexOf();
+ assertEquals(19, testArrayIndexOf());
+ assertOptimized(testArrayIndexOf);
+})();
+
+
+// Handle input array is packed elements and search_element is object,
+// will be inlined
+(() => {
+ const obj = {}
+ const a = [
+ 1.5, 2.5, Symbol.for("123"), "4.5", BigInt(123), 6.5, 7.5, 8.5, 9.5,
+ 10.5, 11.5, 12.5, 13.5, 14.5, 15.5, 16.5, 17.5, 18.5,
+ 19.5, 20.5, 21.5, 22.5, 23.5, 24.5, obj
+ ];
+ function testArrayIndexOf() {
+ return a.indexOf(obj);
+ }
+ %PrepareFunctionForOptimization(testArrayIndexOf);
+ testArrayIndexOf();
+ assertEquals(24, testArrayIndexOf());
+ %OptimizeFunctionOnNextCall(testArrayIndexOf);
+ testArrayIndexOf();
+ assertEquals(24, testArrayIndexOf());
+ assertOptimized(testArrayIndexOf);
+})();
+
+// Handle input array is packed elements and search_element is symbol,
+// will be inlined
+(() => {
+ const a = [
+ 1.5, 2.5, Symbol.for("123"), "4.5", BigInt(123), 6.5, 7.5, 8.5, 9.5,
+ 10.5, 11.5, 12.5, 13.5, 14.5, 15.5, 16.5, 17.5, 18.5,
+ 19.5, 20.5, 21.5, 22.5, 23.5, 24.5, {}
+ ];
+ function testArrayIndexOf() {
+ return a.indexOf(Symbol.for("123"));
+ }
+ %PrepareFunctionForOptimization(testArrayIndexOf);
+ testArrayIndexOf();
+ assertEquals(2, testArrayIndexOf());
+ %OptimizeFunctionOnNextCall(testArrayIndexOf);
+ testArrayIndexOf();
+ assertEquals(2, testArrayIndexOf());
+ assertOptimized(testArrayIndexOf);
+})();
+
+// Handle input array is packed elements and search_element is BigInt,
+// will be inlined
+(() => {
+ const a = [
+ 1.5, 2.5, Symbol.for("123"), "4.5", BigInt(123), 6.5, 7.5, 8.5, 9.5,
+ 10.5, 11.5, 12.5, 13.5, 14.5, 15.5, 16.5, 17.5, 18.5,
+ 19.5, 20.5, 21.5, 22.5, 23.5, 24.5, {}
+ ];
+ function testArrayIndexOf() {
+ return a.indexOf(BigInt(123));
+ }
+ %PrepareFunctionForOptimization(testArrayIndexOf);
+ testArrayIndexOf();
+ assertEquals(4, testArrayIndexOf());
+ %OptimizeFunctionOnNextCall(testArrayIndexOf);
+ testArrayIndexOf();
+ assertEquals(4, testArrayIndexOf());
+ assertOptimized(testArrayIndexOf);
+})();
+
+// Handle input array is packed elements and search_element is string,
+// will be inlined
+(() => {
+ const a = [
+ 1.5, 2.5, Symbol.for("123"), "4.5", BigInt(123), 6.5, 7.5, 8.5, 9.5,
+ 10.5, 11.5, 12.5, 13.5, 14.5, 15.5, 16.5, 17.5, 18.5,
+ 19.5, 20.5, 21.5, 22.5, 23.5, 24.5, {}
+ ];
+ function testArrayIndexOf() {
+ return a.indexOf("4.5");
+ }
+ %PrepareFunctionForOptimization(testArrayIndexOf);
+ testArrayIndexOf();
+ assertEquals(3, testArrayIndexOf());
+ %OptimizeFunctionOnNextCall(testArrayIndexOf);
+ testArrayIndexOf();
+ assertEquals(3, testArrayIndexOf());
+ assertOptimized(testArrayIndexOf);
+})();
View Lorry Controller Status