Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 1 | // Copyright 2013 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 --nodead-code-elimination |
| 29 | // Flags: --nofold-constants --nouse-gvn |
| 30 | |
| 31 | // Create a function to get a long series of removable simulates. |
| 32 | // f() { |
| 33 | // var _0 = <random>, _1 = <random>, ... _1000 = <random>, |
| 34 | // _1001 = <random var> + <random var>, |
| 35 | // _1002 = <random var> + <random var>, |
| 36 | // ... |
| 37 | // _99999 = <random var> + <random var>, |
| 38 | // x = 1; |
| 39 | // return _0; |
| 40 | // } |
| 41 | |
| 42 | var seed = 1; |
| 43 | |
| 44 | function rand() { |
| 45 | seed = seed * 171 % 1337 + 17; |
| 46 | return (seed % 1000) / 1000; |
| 47 | } |
| 48 | |
| 49 | function randi(max) { |
| 50 | seed = seed * 131 % 1773 + 13; |
| 51 | return seed % max; |
| 52 | } |
| 53 | |
| 54 | function varname(i) { |
| 55 | return "_" + i; |
| 56 | } |
| 57 | |
| 58 | var source = "var "; |
| 59 | |
| 60 | for (var i = 0; i < 750; i++) { |
| 61 | source += [varname(i), "=", rand(), ","].join(""); |
| 62 | } |
| 63 | |
| 64 | for (var i = 750; i < 3000; i++) { |
| 65 | source += [varname(i), "=", |
| 66 | varname(randi(i)), "+", |
| 67 | varname(randi(i)), ","].join(""); |
| 68 | } |
| 69 | |
| 70 | source += "x=1; return _0;" |
| 71 | var f = new Function(source); |
| 72 | |
| 73 | f(); |
| 74 | %OptimizeFunctionOnNextCall(f); |
| 75 | f(); |