OLD | NEW |
1 // Copyright (c) 2014, the Dart project authors. Please see the AUTHORS file | 1 // Copyright (c) 2014, 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 // VMOptions=--optimization-counter-threshold=100 --no-background-compilation | 4 // VMOptions=--optimization-counter-threshold=100 --no-background-compilation |
5 // VMOptions=--optimization-counter-threshold=100 --no-background-compilation --
no-use-field-guards | 5 // VMOptions=--optimization-counter-threshold=100 --no-background-compilation --
no-use-field-guards |
6 | 6 |
7 // Test lazy deoptimization at type checks with deferred loading. | 7 // Test lazy deoptimization at type checks with deferred loading. |
8 | 8 |
9 import "package:expect/expect.dart"; | 9 import "package:expect/expect.dart"; |
10 import "cha_deopt2_lib.dart"; | 10 import "cha_deopt2_lib.dart"; |
(...skipping 10 matching lines...) Expand all Loading... |
21 }); | 21 }); |
22 } | 22 } |
23 | 23 |
24 make_array() { | 24 make_array() { |
25 try { | 25 try { |
26 if (loaded) { | 26 if (loaded) { |
27 return [new A(), new B(), new C(), new D(), new E(), d.make_u()]; | 27 return [new A(), new B(), new C(), new D(), new E(), d.make_u()]; |
28 } else { | 28 } else { |
29 return [new A(), new B(), new C(), new D(), new E(), new T()]; | 29 return [new A(), new B(), new C(), new D(), new E(), new T()]; |
30 } | 30 } |
31 } catch (e) { } | 31 } catch (e) {} |
32 } | 32 } |
33 | 33 |
34 bla() { | 34 bla() { |
35 var count = 0; | 35 var count = 0; |
36 for (var x in make_array()) { | 36 for (var x in make_array()) { |
37 if (x is T) count++; | 37 if (x is T) count++; |
38 } | 38 } |
39 return count; | 39 return count; |
40 } | 40 } |
OLD | NEW |