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 import "package:expect/expect.dart"; | |
6 | |
7 // Test that dart2s computes the right bailout environment in presence | 5 // Test that dart2s computes the right bailout environment in presence |
8 // of nested loops. | 6 // of nested loops. |
9 | 7 |
10 class A { | 8 class A { |
11 operator[] (index) => 42; | 9 operator[] (index) => 42; |
12 } | 10 } |
13 | 11 |
14 var a = new A(); | 12 var a = new A(); |
15 var b = new List(4); | 13 var b = new List(4); |
16 int count = 0; | 14 int count = 0; |
17 | 15 |
18 main() { | 16 main() { |
19 // Make the method recursive to make sure it gets an optimized | 17 // Make the method recursive to make sure it gets an optimized |
20 // version. | 18 // version. |
21 if (b[0] != null) main(); | 19 if (b[0] != null) main(); |
22 | 20 |
23 for (int i = 0; i < 2; i++) { | 21 for (int i = 0; i < 2; i++) { |
24 for (int j = 0; j < 2; j++) { | 22 for (int j = 0; j < 2; j++) { |
25 for (int k = 0; k < 2; k++) { | 23 for (int k = 0; k < 2; k++) { |
26 Expect.equals(42, a[i + j + k]); | 24 Expect.equals(42, a[i + j + k]); |
27 count++; | 25 count++; |
28 } | 26 } |
29 } | 27 } |
30 } | 28 } |
31 Expect.equals(8, count); | 29 Expect.equals(8, count); |
32 } | 30 } |
OLD | NEW |