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 | // Test bitwise operations with booleans. |
| 29 | |
| 30 | var t = 1; |
| 31 | |
| 32 | function testFalseLeftHandSide() { |
| 33 | var b; |
| 34 | if (t) b = false; |
| 35 | assertEquals(b | 1, 1); |
| 36 | assertEquals(b & 1, 0); |
| 37 | assertEquals(b ^ 1, 1); |
| 38 | assertEquals(b << 1, 0); |
| 39 | assertEquals(b >> 1, 0); |
| 40 | assertEquals(b >>> 1, 0); |
| 41 | } |
| 42 | |
| 43 | function testFalseRightHandSide() { |
| 44 | if (t) b = false; |
| 45 | assertEquals(1 | b, 1); |
| 46 | assertEquals(1 & b, 0); |
| 47 | assertEquals(1 ^ b, 1); |
| 48 | assertEquals(1 << b, 1); |
| 49 | assertEquals(1 >> b, 1); |
| 50 | assertEquals(1 >>> b, 1); |
| 51 | } |
| 52 | |
| 53 | function testTrueLeftHandSide() { |
| 54 | if (t) b = true; |
| 55 | assertEquals(b | 1, 1); |
| 56 | assertEquals(b & 1, 1); |
| 57 | assertEquals(b ^ 1, 0); |
| 58 | assertEquals(b << 1, 2); |
| 59 | assertEquals(b >> 1, 0); |
| 60 | assertEquals(b >>> 1, 0); |
| 61 | } |
| 62 | |
| 63 | function testTrueRightHandSide() { |
| 64 | if (t) b = true; |
| 65 | assertEquals(1 | b, 1); |
| 66 | assertEquals(1 & b, 1); |
| 67 | assertEquals(1 ^ b, 0); |
| 68 | assertEquals(1 << b, 2); |
| 69 | assertEquals(1 >> b, 0); |
| 70 | assertEquals(1 >>> b, 0); |
| 71 | } |
| 72 | |
| 73 | function testBothSides() { |
| 74 | if (t) a = true; |
| 75 | if (t) b = false; |
| 76 | assertEquals(a | b, 1); |
| 77 | assertEquals(a & b, 0); |
| 78 | assertEquals(a ^ b, 1); |
| 79 | assertEquals(a << b, 1); |
| 80 | assertEquals(a >> b, 1); |
| 81 | assertEquals(a >>> b, 1); |
| 82 | } |
| 83 | |
| 84 | |
| 85 | testFalseLeftHandSide(); |
| 86 | testFalseRightHandSide(); |
| 87 | testTrueLeftHandSide(); |
| 88 | testTrueRightHandSide(); |
| 89 | testFalseLeftHandSide(); |
| 90 | testFalseRightHandSide(); |
| 91 | testTrueLeftHandSide(); |
| 92 | testTrueRightHandSide(); |
| 93 | testBothSides(); |
| 94 | testBothSides(); |