| 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 // Dart test program for testing arrays. | 4 // Dart test program for testing arrays. |
| 5 | 5 |
| 6 import "package:expect/expect.dart"; | |
| 7 | |
| 8 bar() => true; | 6 bar() => true; |
| 9 | 7 |
| 10 tata() => 1.5; | 8 tata() => 1.5; |
| 11 | 9 |
| 12 // The type propagation in Dart2Js wrongly took the intersection of all incoming | 10 // The type propagation in Dart2Js wrongly took the intersection of all incoming |
| 13 // types in a loop-phi. In this case the back-edge brought type 'number' which, | 11 // types in a loop-phi. In this case the back-edge brought type 'number' which, |
| 14 // combined with 'integer' (i = 0) was narrowed to 'integer'. As a result no | 12 // combined with 'integer' (i = 0) was narrowed to 'integer'. As a result no |
| 15 // check was inserted for the list access. | 13 // check was inserted for the list access. |
| 16 foo(a) { | 14 foo(a) { |
| 17 var i; | 15 var i; |
| (...skipping 10 matching lines...) Expand all Loading... |
| 28 for (int j = 0; j < 1; j++) { | 26 for (int j = 0; j < 1; j++) { |
| 29 // The phi, combining the two 'i's must reach the conclusion that i is of | 27 // The phi, combining the two 'i's must reach the conclusion that i is of |
| 30 // type num and therefore needs a check before accessing the array. | 28 // type num and therefore needs a check before accessing the array. |
| 31 a[i]; | 29 a[i]; |
| 32 } | 30 } |
| 33 } | 31 } |
| 34 | 32 |
| 35 main() { | 33 main() { |
| 36 Expect.throws(() => foo([1, 2])); | 34 Expect.throws(() => foo([1, 2])); |
| 37 } | 35 } |
| OLD | NEW |