1// Copyright 2014 the V8 project authors. All rights reserved.
2// Redistribution and use in source and binary forms, with or without
3// modification, are permitted provided that the following conditions are
4// met:
5//
6//     * Redistributions of source code must retain the above copyright
7//       notice, this list of conditions and the following disclaimer.
8//     * Redistributions in binary form must reproduce the above
9//       copyright notice, this list of conditions and the following
10//       disclaimer in the documentation and/or other materials provided
11//       with the distribution.
12//     * Neither the name of Google Inc. nor the names of its
13//       contributors may be used to endorse or promote products derived
14//       from this software without specific prior written permission.
15//
16// THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
17// "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
18// LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
19// A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
20// OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
21// SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
22// LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
23// DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
24// THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
25// (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
26// OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
27
28// Flags: --allow-natives-syntax --noalways-opt
29
30function check(func, input, expected) {
31  func(-1);
32  func(-1);
33  %OptimizeFunctionOnNextCall(func);
34  assertEquals(expected, func(input));
35  assertOptimized(func);
36}
37
38function mul_by_neg_1(a) { return a * -1; }
39function mul_by_0(a) {  return a * 0; }
40function mul_by_1(a) { return a * 1; }
41function mul_by_2(a) { return a * 2; }
42
43check(mul_by_neg_1, 2, -2);
44check(mul_by_0, 2, 0);
45check(mul_by_1, 2, 2);
46check(mul_by_2, 2, 4);
47
48function limit_range(a) {
49  // Limit the range of 'a' to enable no-overflow optimizations.
50  return Math.max(Math.min(a | 0, 10), -10);
51}
52
53function mul_by_neg_127(a) { return limit_range(a) * -127; }
54function mul_by_neg_128(a) { return limit_range(a) * -128; }
55function mul_by_neg_129(a) { return limit_range(a) * -129; }
56function mul_by_1023(a) { return limit_range(a) * 1023; }
57function mul_by_1024(a) { return limit_range(a) * 1024; }
58function mul_by_1025(a) { return limit_range(a) * 1025; }
59
60check(mul_by_neg_127, 2, -254);
61check(mul_by_neg_128, 2, -256);
62check(mul_by_neg_129, 2, -258);
63check(mul_by_1023, 2, 2046);
64check(mul_by_1024, 2, 2048);
65check(mul_by_1025, 2, 2050);
66
67// Deopt on minus zero.
68assertEquals(-0, mul_by_neg_128(0));
69assertUnoptimized(mul_by_neg_128);
70assertEquals(-0, mul_by_2(-0));
71assertUnoptimized(mul_by_2);
72
73// Deopt on overflow.
74
75// 2^30 is a smi boundary on arm and ia32.
76var two_30 = 1 << 30;
77// 2^31 is a smi boundary on arm64 and x64.
78var two_31 = 2 * two_30;
79
80// TODO(rmcilroy): replace after r16361 with:  if (%IsValidSmi(two_31)) {
81if (true) {
82  assertEquals(two_31, mul_by_neg_1(-two_31));
83  assertUnoptimized(mul_by_neg_1);
84} else {
85  assertEquals(two_30, mul_by_neg_1(-two_30));
86  assertUnoptimized(mul_by_neg_1);
87}
88