Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 1 | // Copyright 2008 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 | function dead1(a, b) { |
| 29 | a * b; |
| 30 | a << b; |
| 31 | a >> b; |
| 32 | a >>> b; |
| 33 | a | b; |
| 34 | a & b; |
| 35 | a ^ b; |
| 36 | return a; |
| 37 | } |
| 38 | |
| 39 | function dead2(a, b) { |
| 40 | (a | 0) * b; |
| 41 | (a | 0) << b; |
| 42 | (a | 0) >> b; |
| 43 | (a | 0) >>> b; |
| 44 | (a | 0) | b; |
| 45 | (a | 0) & b; |
| 46 | (a | 0) ^ b; |
| 47 | return a; |
| 48 | } |
| 49 | |
| 50 | function dead3(a, b) { |
| 51 | a == 2 ? (a * b) : (b * a); // dead |
| 52 | return a; |
| 53 | } |
| 54 | |
| 55 | function dead4(a) { |
| 56 | var z = 3; |
| 57 | for (i = 0; i < 3; i++) { |
| 58 | z * 3; // dead |
| 59 | } |
| 60 | return a; |
| 61 | } |
| 62 | |
| 63 | function dead5(a) { |
| 64 | var z = 3; |
| 65 | for (i = 0; i < 3; i++) { |
| 66 | z * 3; // dead |
| 67 | z++; |
| 68 | } |
| 69 | var w = z * a; |
| 70 | return a; // w is dead |
| 71 | } |
| 72 | |
| 73 | assertTrue(dead1(33, 32) == 33); |
| 74 | assertTrue(dead2(33, 32) == 33); |
| 75 | assertTrue(dead3(33, 32) == 33); |
| 76 | assertTrue(dead4(33) == 33); |
| 77 | assertTrue(dead5(33) == 33); |
| 78 | |
| 79 | assertTrue(dead1(34, 7) == 34); |
| 80 | assertTrue(dead2(34, 7) == 34); |
| 81 | assertTrue(dead3(34, 7) == 34); |
| 82 | assertTrue(dead4(34) == 34); |
| 83 | assertTrue(dead5(34) == 34); |
| 84 | |
| 85 | assertTrue(dead1(3.4, 0.1) == 3.4); |
| 86 | assertTrue(dead2(3.4, 0.1) == 3.4); |
| 87 | assertTrue(dead3(3.4, 0.1) == 3.4); |
| 88 | assertTrue(dead4(3.4) == 3.4); |
| 89 | assertTrue(dead5(3.4) == 3.4); |