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