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 | 4 |
| 5 #if !defined(DART_PRECOMPILED_RUNTIME) |
| 6 |
5 #include "vm/flow_graph_range_analysis.h" | 7 #include "vm/flow_graph_range_analysis.h" |
6 | 8 |
7 #include "vm/bit_vector.h" | 9 #include "vm/bit_vector.h" |
8 #include "vm/il_printer.h" | 10 #include "vm/il_printer.h" |
9 | 11 |
10 namespace dart { | 12 namespace dart { |
11 | 13 |
12 DEFINE_FLAG(bool, | 14 DEFINE_FLAG(bool, |
13 array_bounds_check_elimination, | 15 array_bounds_check_elimination, |
14 true, | 16 true, |
(...skipping 2944 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
2959 return max.offset() < canonical_length.offset(); | 2961 return max.offset() < canonical_length.offset(); |
2960 } | 2962 } |
2961 } while (CanonicalizeMaxBoundary(&max) || | 2963 } while (CanonicalizeMaxBoundary(&max) || |
2962 CanonicalizeMinBoundary(&canonical_length)); | 2964 CanonicalizeMinBoundary(&canonical_length)); |
2963 | 2965 |
2964 // Failed to prove that maximum is bounded with array length. | 2966 // Failed to prove that maximum is bounded with array length. |
2965 return false; | 2967 return false; |
2966 } | 2968 } |
2967 | 2969 |
2968 } // namespace dart | 2970 } // namespace dart |
| 2971 |
| 2972 #endif // !defined(DART_PRECOMPILED_RUNTIME) |
OLD | NEW |