OLD | NEW |
1 // Copyright (c) 2012, the Dart project authors. Please see the AUTHORS file | 1 // Copyright (c) 2012, the Dart project authors. Please see the AUTHORS file |
2 // for details. All rights reserved. Use of this source code is governed by a | 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. | 3 // BSD-style license that can be found in the LICENSE file. |
4 | 4 |
5 // Test inlining of a closure call with constant propagation. | 5 // Test inlining of a closure call with constant propagation. |
6 primeForSmis(bool b) { | 6 primeForSmis(bool b) { |
7 smi_op(a, b) => a + b; | 7 smi_op(a, b) => a + b; |
8 if (b) { | 8 if (b) { |
9 return smi_op(1, 2); | 9 return smi_op(1, 2); |
10 } else { | 10 } else { |
11 return smi_op(true, false); | 11 return smi_op(true, false); |
12 } | 12 } |
13 } | 13 } |
14 | 14 |
15 | 15 |
16 main() { | 16 main() { |
17 for (var i=0; i<2000; i++) { | 17 for (var i=0; i<2000; i++) { |
18 Expect.equals(3, primeForSmis(true)); | 18 Expect.equals(3, primeForSmis(true)); |
19 } | 19 } |
20 } | 20 } |
OLD | NEW |