blob: 7055e349247155e68a3fbbdf200480794b34bd91 [file] [log] [blame]
Ben Murdochb0fe1622011-05-05 13:52:32 +01001// Copyright 2010 the V8 project authors. All rights reserved.
Kristian Monsen81362e12011-02-04 12:39:27 +00002// 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
Ben Murdoch4a90d5f2016-03-22 12:00:34 +000028// Flags: --allow-natives-syntax
Ben Murdochb0fe1622011-05-05 13:52:32 +010029//
30// Regression test for global value numbering.
Kristian Monsen81362e12011-02-04 12:39:27 +000031
Ben Murdochb0fe1622011-05-05 13:52:32 +010032function test(a) {
33 var res = a[0] + a[0];
34 if (res == 0) {
35 a[0] = 1;
36 }
37 return a[0];
Kristian Monsen81362e12011-02-04 12:39:27 +000038}
39
Ben Murdochb0fe1622011-05-05 13:52:32 +010040var a = new Array();
41
Ben Murdochb8a8cc12014-11-26 15:28:44 +000042var n = 100;
Ben Murdochb0fe1622011-05-05 13:52:32 +010043
44var result = 0;
45for (var i = 0; i < n; ++i) {
Ben Murdochb8a8cc12014-11-26 15:28:44 +000046 if (i == 10) %OptimizeFunctionOnNextCall(test);
Ben Murdochb0fe1622011-05-05 13:52:32 +010047 a[0] = 0;
48 result += test(a);
49}
50
51
52assertEquals(n, result);