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 // VMOptions=--optimization-counter-threshold=10 --no-background-compilation | 4 // VMOptions=--optimization-counter-threshold=10 --no-background-compilation |
5 | 5 |
6 import "package:expect/expect.dart"; | 6 import "package:expect/expect.dart"; |
7 | 7 |
8 // Note: in --limit-ints-to-64-bits mode all integers are 64-bit already. | 8 // Note: in --limit-ints-to-64-bits mode all integers are 64-bit already. |
9 // Still, it is harmless to apply _uint64Mask because (1 << 64) is 0 (all bits | 9 // Still, it is harmless to apply _uint64Mask because (1 << 64) is 0 (all bits |
10 // are shifted out), so _uint64Mask is -1 (its bit pattern is 0xffffffffffffffff
). | 10 // are shifted out), so _uint64Mask is -1 (its bit pattern is 0xffffffffffffffff
). |
(...skipping 43 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
54 | 54 |
55 // JavaScript shifts by the amount modulo 32. That is x << y is equivalent to | 55 // JavaScript shifts by the amount modulo 32. That is x << y is equivalent to |
56 // x << (y & 0x1F). Dart does not. | 56 // x << (y & 0x1F). Dart does not. |
57 main() { | 57 main() { |
58 for (var i = 0; i < 10; ++i) { | 58 for (var i = 0; i < 10; ++i) { |
59 constants(); | 59 constants(); |
60 interceptors(); | 60 interceptors(); |
61 speculative(); | 61 speculative(); |
62 } | 62 } |
63 } | 63 } |
OLD | NEW |