| OLD | NEW |
| (Empty) |
| 1 // Copyright (c) 2011, the Dart project authors. Please see the AUTHORS file | |
| 2 // for details. All rights reserved. Use of this source code is governed by a | |
| 3 // BSD-style license that can be found in the LICENSE file. | |
| 4 // Test various optimizations and deoptimizations of optimizing compiler.. | |
| 5 | |
| 6 addThem(a, b) { | |
| 7 return a + b; | |
| 8 } | |
| 9 | |
| 10 isItInt(a) { | |
| 11 return a is int; | |
| 12 } | |
| 13 | |
| 14 doNeg(a) { | |
| 15 return -a; | |
| 16 } | |
| 17 | |
| 18 doNeg2(a) { | |
| 19 return -a; | |
| 20 } | |
| 21 | |
| 22 doNot(a) { | |
| 23 return !a; | |
| 24 } | |
| 25 | |
| 26 doBitNot(a) { | |
| 27 return ~a; | |
| 28 } | |
| 29 | |
| 30 doStore1(a, v) { | |
| 31 a[1] = v; | |
| 32 } | |
| 33 | |
| 34 doStore2(a, v) { | |
| 35 a[2] = v; | |
| 36 } | |
| 37 | |
| 38 class StringPlus { | |
| 39 const StringPlus(String this._val); | |
| 40 operator + (right) => new StringPlus("${_val}${right}"); | |
| 41 toString() => _val; | |
| 42 | |
| 43 final String _val; | |
| 44 } | |
| 45 | |
| 46 main() { | |
| 47 for (int i = 0; i < 2000; i++) { | |
| 48 Expect.stringEquals("HI 5", addThem(const StringPlus("HI "), 5).toString()); | |
| 49 Expect.equals(true, isItInt(5)); | |
| 50 } | |
| 51 Expect.equals(8, addThem(3, 5)); | |
| 52 for (int i = 0; i < 2000; i++) { | |
| 53 Expect.stringEquals("HI 5", addThem(const StringPlus("HI "), 5).toString()); | |
| 54 Expect.equals(8, addThem(3, 5)); | |
| 55 } | |
| 56 for (int i = -500; i < 500; i++) { | |
| 57 var r = doNeg(i); | |
| 58 var p = doNeg(r); | |
| 59 Expect.equals(i, p); | |
| 60 } | |
| 61 var maxSmi = (1 << 30) - 1; | |
| 62 Expect.equals(maxSmi, doNeg(doNeg(maxSmi))); | |
| 63 // Deoptimize because of overflow. | |
| 64 var minInt = -(1 << 30); | |
| 65 Expect.equals(minInt, doNeg(doNeg(minInt))); | |
| 66 | |
| 67 for (int i = 0; i < 1000; i++) { | |
| 68 Expect.equals(false, doNot(true)); | |
| 69 Expect.equals(true, doNot(doNot(true))); | |
| 70 } | |
| 71 for (int i = 0; i < 1000; i++) { | |
| 72 Expect.equals(-57, doBitNot(56)); | |
| 73 Expect.equals(55, doBitNot(-56)); | |
| 74 } | |
| 75 | |
| 76 for (int i = 0; i < 2000; i++) { | |
| 77 Expect.equals(-2.2, doNeg2(2.2)); | |
| 78 } | |
| 79 // Deoptimize. | |
| 80 Expect.equals(-5, doNeg2(5)); | |
| 81 | |
| 82 var fixed = new List(10); | |
| 83 var growable = [1, 2, 3, 4, 5]; | |
| 84 | |
| 85 for (int i = 0; i < 2000; i++) { | |
| 86 doStore1(fixed, 7); | |
| 87 Expect.equals(7, fixed[1]); | |
| 88 doStore2(growable, 12); | |
| 89 Expect.equals(12, growable[2]); | |
| 90 } | |
| 91 | |
| 92 // Deoptimize. | |
| 93 doStore1(growable, 8); | |
| 94 Expect.equals(8, growable[1]); | |
| 95 doStore2(fixed, 101); | |
| 96 Expect.equals(101, fixed[2]); | |
| 97 } | |
| OLD | NEW |