OLD | NEW |
1 // Copyright 2013 the V8 project authors. All rights reserved. | 1 // Copyright 2013 the V8 project authors. All rights reserved. |
2 // Redistribution and use in source and binary forms, with or without | 2 // Redistribution and use in source and binary forms, with or without |
3 // modification, are permitted provided that the following conditions are | 3 // modification, are permitted provided that the following conditions are |
4 // met: | 4 // met: |
5 // | 5 // |
6 // * Redistributions of source code must retain the above copyright | 6 // * Redistributions of source code must retain the above copyright |
7 // notice, this list of conditions and the following disclaimer. | 7 // notice, this list of conditions and the following disclaimer. |
8 // * Redistributions in binary form must reproduce the above | 8 // * Redistributions in binary form must reproduce the above |
9 // copyright notice, this list of conditions and the following | 9 // copyright notice, this list of conditions and the following |
10 // disclaimer in the documentation and/or other materials provided | 10 // disclaimer in the documentation and/or other materials provided |
(...skipping 10 matching lines...) Expand all Loading... |
21 // SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT | 21 // SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT |
22 // LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, | 22 // LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, |
23 // DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY | 23 // DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY |
24 // THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT | 24 // THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT |
25 // (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE | 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. | 26 // OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. |
27 | 27 |
28 // Flags: --track-fields --track-double-fields --allow-natives-syntax | 28 // Flags: --track-fields --track-double-fields --allow-natives-syntax |
29 | 29 |
30 function smi_field() { | 30 function smi_field() { |
31 return {"smi":0}; | 31 // Assign twice to make the field non-constant. |
| 32 // TODO(ishell): update test once constant field tracking is done. |
| 33 var o = {smi: 1}; |
| 34 o.smi = 0; |
| 35 return o; |
32 } | 36 } |
33 | 37 |
34 function check_smi_repr(o, d1, d2) { | 38 function check_smi_repr(o, d1, d2) { |
35 var s = o.smi; | 39 var s = o.smi; |
36 var d = d1 - d2; | 40 var d = d1 - d2; |
37 s = s + d; | 41 s = s + d; |
38 o.smi = s; | 42 o.smi = s; |
39 return o; | 43 return o; |
40 } | 44 } |
41 | 45 |
(...skipping 17 matching lines...) Expand all Loading... |
59 } | 63 } |
60 | 64 |
61 check_smi_repr_from_tagged(smi_field(), tagged_smi_field()); | 65 check_smi_repr_from_tagged(smi_field(), tagged_smi_field()); |
62 check_smi_repr_from_tagged(smi_field(), tagged_smi_field()); | 66 check_smi_repr_from_tagged(smi_field(), tagged_smi_field()); |
63 %OptimizeFunctionOnNextCall(check_smi_repr_from_tagged); | 67 %OptimizeFunctionOnNextCall(check_smi_repr_from_tagged); |
64 var val = check_smi_repr_from_tagged(smi_field(), tagged_smi_field()); | 68 var val = check_smi_repr_from_tagged(smi_field(), tagged_smi_field()); |
65 assertTrue(%HaveSameMap(val, test)); | 69 assertTrue(%HaveSameMap(val, test)); |
66 var overflow = tagged_smi_field(); | 70 var overflow = tagged_smi_field(); |
67 overflow.tag = 0x80000000; | 71 overflow.tag = 0x80000000; |
68 var val = check_smi_repr_from_tagged(smi_field(), overflow); | 72 var val = check_smi_repr_from_tagged(smi_field(), overflow); |
OLD | NEW |