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: --track-fields --track-double-fields --allow-natives-syntax |
| 29 | |
| 30 | function smi_field() { |
| 31 | return {"smi":0}; |
| 32 | } |
| 33 | |
| 34 | function check_smi_repr(o, d1, d2) { |
| 35 | var s = o.smi; |
| 36 | var d = d1 - d2; |
| 37 | s = s + d; |
| 38 | o.smi = s; |
| 39 | return o; |
| 40 | } |
| 41 | |
| 42 | var test = smi_field(); |
| 43 | check_smi_repr(smi_field(), 5, 3); |
| 44 | check_smi_repr(smi_field(), 6, 2); |
| 45 | %OptimizeFunctionOnNextCall(check_smi_repr); |
| 46 | var val = check_smi_repr(smi_field(), 8, 1); |
| 47 | assertTrue(%HaveSameMap(val, test)); |
| 48 | |
| 49 | function tagged_smi_field() { |
| 50 | var o = {"tag":false}; |
| 51 | o.tag = 10; |
| 52 | return o; |
| 53 | } |
| 54 | |
| 55 | function check_smi_repr_from_tagged(o, o2) { |
| 56 | var t = o2.tag; |
| 57 | o.smi = t; |
| 58 | return o; |
| 59 | } |
| 60 | |
| 61 | check_smi_repr_from_tagged(smi_field(), tagged_smi_field()); |
| 62 | check_smi_repr_from_tagged(smi_field(), tagged_smi_field()); |
| 63 | %OptimizeFunctionOnNextCall(check_smi_repr_from_tagged); |
| 64 | var val = check_smi_repr_from_tagged(smi_field(), tagged_smi_field()); |
| 65 | assertTrue(%HaveSameMap(val, test)); |
| 66 | var overflow = tagged_smi_field(); |
| 67 | overflow.tag = 0x80000000; |
| 68 | var val = check_smi_repr_from_tagged(smi_field(), overflow); |