Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 1 | // Copyright 2012 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 |
| 29 | |
| 30 | // Test CompareIC stubs for normal and strict equality comparison of known |
| 31 | // objects in slow mode. These objects share the same map even though they |
| 32 | // might have completely different properties. |
| 33 | |
| 34 | function eq(a, b) { |
| 35 | return a == b; |
| 36 | } |
| 37 | |
| 38 | function eq_strict(a, b) { |
| 39 | return a === b; |
| 40 | } |
| 41 | |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 42 | function le(a, b) { |
| 43 | return a <= b; |
| 44 | } |
| 45 | |
| 46 | function lt(a, b) { |
| 47 | return a < b; |
| 48 | } |
| 49 | |
| 50 | function ge(a, b) { |
| 51 | return a >= b; |
| 52 | } |
| 53 | |
| 54 | function gt(a, b) { |
| 55 | return a > b; |
| 56 | } |
| 57 | |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 58 | function test(a, b) { |
| 59 | // Check CompareIC for equality of known objects. |
| 60 | assertTrue(eq(a, a)); |
| 61 | assertTrue(eq(b, b)); |
| 62 | assertFalse(eq(a, b)); |
| 63 | // Check CompareIC for strict equality of known objects. |
| 64 | assertTrue(eq_strict(a, a)); |
| 65 | assertTrue(eq_strict(b, b)); |
| 66 | assertFalse(eq_strict(a, b)); |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 67 | // Check CompareIC for less than or equal of known objects. |
| 68 | assertTrue(le(a, a)); |
| 69 | assertTrue(le(a, b)); |
| 70 | assertTrue(le(b, a)); |
| 71 | // Check CompareIC for less than of known objects. |
| 72 | assertFalse(lt(a, a)); |
| 73 | assertFalse(lt(a, b)); |
| 74 | assertFalse(lt(b, a)); |
| 75 | // Check CompareIC for greater than or equal of known objects. |
| 76 | assertTrue(ge(a, a)); |
| 77 | assertTrue(ge(a, b)); |
| 78 | assertTrue(ge(b, a)); |
| 79 | // Check CompareIC for greater than of known objects. |
| 80 | assertFalse(gt(a, a)); |
| 81 | assertFalse(gt(a, b)); |
| 82 | assertFalse(gt(b, a)); |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 83 | } |
| 84 | |
| 85 | // Prepare two objects in slow mode that have the same map. |
| 86 | var obj1 = %OptimizeObjectForAddingMultipleProperties({}, 1); |
| 87 | var obj2 = %OptimizeObjectForAddingMultipleProperties({}, 1); |
| 88 | |
| 89 | // Test original objects. |
| 90 | assertTrue(%HaveSameMap(obj1, obj2)); |
| 91 | test(obj1, obj2); |
| 92 | |
| 93 | // Test after adding property to first object. |
| 94 | obj1.x = 1; |
| 95 | assertTrue(%HaveSameMap(obj1, obj2)); |
| 96 | test(obj1, obj2); |
| 97 | |
| 98 | // Test after adding property to second object. |
| 99 | obj2.y = 2; |
| 100 | assertTrue(%HaveSameMap(obj1, obj2)); |
| 101 | test(obj1, obj2); |