buzbee | 311ca16 | 2013-02-28 15:56:43 -0800 | [diff] [blame] | 1 | /* |
| 2 | * Copyright (C) 2013 The Android Open Source Project |
| 3 | * |
| 4 | * Licensed under the Apache License, Version 2.0 (the "License"); |
| 5 | * you may not use this file except in compliance with the License. |
| 6 | * You may obtain a copy of the License at |
| 7 | * |
| 8 | * http://www.apache.org/licenses/LICENSE-2.0 |
| 9 | * |
| 10 | * Unless required by applicable law or agreed to in writing, software |
| 11 | * distributed under the License is distributed on an "AS IS" BASIS, |
| 12 | * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. |
| 13 | * See the License for the specific language governing permissions and |
| 14 | * limitations under the License. |
| 15 | */ |
| 16 | |
Brian Carlstrom | fc0e321 | 2013-07-17 14:40:12 -0700 | [diff] [blame] | 17 | #ifndef ART_COMPILER_DEX_MIR_GRAPH_H_ |
| 18 | #define ART_COMPILER_DEX_MIR_GRAPH_H_ |
buzbee | 311ca16 | 2013-02-28 15:56:43 -0800 | [diff] [blame] | 19 | |
Ian Rogers | 0f67847 | 2014-03-10 16:18:37 -0700 | [diff] [blame] | 20 | #include <stdint.h> |
| 21 | |
buzbee | 311ca16 | 2013-02-28 15:56:43 -0800 | [diff] [blame] | 22 | #include "dex_file.h" |
| 23 | #include "dex_instruction.h" |
| 24 | #include "compiler_ir.h" |
Vladimir Marko | be0e546 | 2014-02-26 11:24:15 +0000 | [diff] [blame] | 25 | #include "invoke_type.h" |
Vladimir Marko | f096aad | 2014-01-23 15:51:58 +0000 | [diff] [blame] | 26 | #include "mir_field_info.h" |
| 27 | #include "mir_method_info.h" |
Nicolas Geoffray | 0e33643 | 2014-02-26 18:24:38 +0000 | [diff] [blame] | 28 | #include "utils/arena_bit_vector.h" |
Nicolas Geoffray | 818f210 | 2014-02-18 16:43:35 +0000 | [diff] [blame] | 29 | #include "utils/growable_array.h" |
Bill Buzbee | 00e1ec6 | 2014-02-27 23:44:13 +0000 | [diff] [blame] | 30 | #include "reg_storage.h" |
buzbee | 311ca16 | 2013-02-28 15:56:43 -0800 | [diff] [blame] | 31 | |
| 32 | namespace art { |
| 33 | |
buzbee | ee17e0a | 2013-07-31 10:47:37 -0700 | [diff] [blame] | 34 | enum InstructionAnalysisAttributePos { |
| 35 | kUninterestingOp = 0, |
| 36 | kArithmeticOp, |
| 37 | kFPOp, |
| 38 | kSingleOp, |
| 39 | kDoubleOp, |
| 40 | kIntOp, |
| 41 | kLongOp, |
| 42 | kBranchOp, |
| 43 | kInvokeOp, |
| 44 | kArrayOp, |
| 45 | kHeavyweightOp, |
| 46 | kSimpleConstOp, |
buzbee | fe9ca40 | 2013-08-21 09:48:11 -0700 | [diff] [blame] | 47 | kMoveOp, |
| 48 | kSwitch |
buzbee | ee17e0a | 2013-07-31 10:47:37 -0700 | [diff] [blame] | 49 | }; |
| 50 | |
| 51 | #define AN_NONE (1 << kUninterestingOp) |
| 52 | #define AN_MATH (1 << kArithmeticOp) |
| 53 | #define AN_FP (1 << kFPOp) |
| 54 | #define AN_LONG (1 << kLongOp) |
| 55 | #define AN_INT (1 << kIntOp) |
| 56 | #define AN_SINGLE (1 << kSingleOp) |
| 57 | #define AN_DOUBLE (1 << kDoubleOp) |
| 58 | #define AN_FLOATMATH (1 << kFPOp) |
| 59 | #define AN_BRANCH (1 << kBranchOp) |
| 60 | #define AN_INVOKE (1 << kInvokeOp) |
| 61 | #define AN_ARRAYOP (1 << kArrayOp) |
| 62 | #define AN_HEAVYWEIGHT (1 << kHeavyweightOp) |
| 63 | #define AN_SIMPLECONST (1 << kSimpleConstOp) |
| 64 | #define AN_MOVE (1 << kMoveOp) |
buzbee | fe9ca40 | 2013-08-21 09:48:11 -0700 | [diff] [blame] | 65 | #define AN_SWITCH (1 << kSwitch) |
buzbee | ee17e0a | 2013-07-31 10:47:37 -0700 | [diff] [blame] | 66 | #define AN_COMPUTATIONAL (AN_MATH | AN_ARRAYOP | AN_MOVE | AN_SIMPLECONST) |
| 67 | |
buzbee | 311ca16 | 2013-02-28 15:56:43 -0800 | [diff] [blame] | 68 | enum DataFlowAttributePos { |
| 69 | kUA = 0, |
| 70 | kUB, |
| 71 | kUC, |
| 72 | kAWide, |
| 73 | kBWide, |
| 74 | kCWide, |
| 75 | kDA, |
| 76 | kIsMove, |
| 77 | kSetsConst, |
| 78 | kFormat35c, |
| 79 | kFormat3rc, |
| 80 | kNullCheckSrc0, // Null check of uses[0]. |
| 81 | kNullCheckSrc1, // Null check of uses[1]. |
| 82 | kNullCheckSrc2, // Null check of uses[2]. |
| 83 | kNullCheckOut0, // Null check out outgoing arg0. |
| 84 | kDstNonNull, // May assume dst is non-null. |
| 85 | kRetNonNull, // May assume retval is non-null. |
| 86 | kNullTransferSrc0, // Object copy src[0] -> dst. |
| 87 | kNullTransferSrcN, // Phi null check state transfer. |
| 88 | kRangeCheckSrc1, // Range check of uses[1]. |
| 89 | kRangeCheckSrc2, // Range check of uses[2]. |
| 90 | kRangeCheckSrc3, // Range check of uses[3]. |
| 91 | kFPA, |
| 92 | kFPB, |
| 93 | kFPC, |
| 94 | kCoreA, |
| 95 | kCoreB, |
| 96 | kCoreC, |
| 97 | kRefA, |
| 98 | kRefB, |
| 99 | kRefC, |
| 100 | kUsesMethodStar, // Implicit use of Method*. |
Vladimir Marko | 3d73ba2 | 2014-03-06 15:18:04 +0000 | [diff] [blame] | 101 | kUsesIField, // Accesses an instance field (IGET/IPUT). |
| 102 | kUsesSField, // Accesses a static field (SGET/SPUT). |
buzbee | 1da1e2f | 2013-11-15 13:37:01 -0800 | [diff] [blame] | 103 | kDoLVN, // Worth computing local value numbers. |
buzbee | 311ca16 | 2013-02-28 15:56:43 -0800 | [diff] [blame] | 104 | }; |
| 105 | |
Ian Rogers | 0f67847 | 2014-03-10 16:18:37 -0700 | [diff] [blame] | 106 | #define DF_NOP UINT64_C(0) |
| 107 | #define DF_UA (UINT64_C(1) << kUA) |
| 108 | #define DF_UB (UINT64_C(1) << kUB) |
| 109 | #define DF_UC (UINT64_C(1) << kUC) |
| 110 | #define DF_A_WIDE (UINT64_C(1) << kAWide) |
| 111 | #define DF_B_WIDE (UINT64_C(1) << kBWide) |
| 112 | #define DF_C_WIDE (UINT64_C(1) << kCWide) |
| 113 | #define DF_DA (UINT64_C(1) << kDA) |
| 114 | #define DF_IS_MOVE (UINT64_C(1) << kIsMove) |
| 115 | #define DF_SETS_CONST (UINT64_C(1) << kSetsConst) |
| 116 | #define DF_FORMAT_35C (UINT64_C(1) << kFormat35c) |
| 117 | #define DF_FORMAT_3RC (UINT64_C(1) << kFormat3rc) |
| 118 | #define DF_NULL_CHK_0 (UINT64_C(1) << kNullCheckSrc0) |
| 119 | #define DF_NULL_CHK_1 (UINT64_C(1) << kNullCheckSrc1) |
| 120 | #define DF_NULL_CHK_2 (UINT64_C(1) << kNullCheckSrc2) |
| 121 | #define DF_NULL_CHK_OUT0 (UINT64_C(1) << kNullCheckOut0) |
| 122 | #define DF_NON_NULL_DST (UINT64_C(1) << kDstNonNull) |
| 123 | #define DF_NON_NULL_RET (UINT64_C(1) << kRetNonNull) |
| 124 | #define DF_NULL_TRANSFER_0 (UINT64_C(1) << kNullTransferSrc0) |
| 125 | #define DF_NULL_TRANSFER_N (UINT64_C(1) << kNullTransferSrcN) |
| 126 | #define DF_RANGE_CHK_1 (UINT64_C(1) << kRangeCheckSrc1) |
| 127 | #define DF_RANGE_CHK_2 (UINT64_C(1) << kRangeCheckSrc2) |
| 128 | #define DF_RANGE_CHK_3 (UINT64_C(1) << kRangeCheckSrc3) |
| 129 | #define DF_FP_A (UINT64_C(1) << kFPA) |
| 130 | #define DF_FP_B (UINT64_C(1) << kFPB) |
| 131 | #define DF_FP_C (UINT64_C(1) << kFPC) |
| 132 | #define DF_CORE_A (UINT64_C(1) << kCoreA) |
| 133 | #define DF_CORE_B (UINT64_C(1) << kCoreB) |
| 134 | #define DF_CORE_C (UINT64_C(1) << kCoreC) |
| 135 | #define DF_REF_A (UINT64_C(1) << kRefA) |
| 136 | #define DF_REF_B (UINT64_C(1) << kRefB) |
| 137 | #define DF_REF_C (UINT64_C(1) << kRefC) |
| 138 | #define DF_UMS (UINT64_C(1) << kUsesMethodStar) |
Vladimir Marko | 3d73ba2 | 2014-03-06 15:18:04 +0000 | [diff] [blame] | 139 | #define DF_IFIELD (UINT64_C(1) << kUsesIField) |
| 140 | #define DF_SFIELD (UINT64_C(1) << kUsesSField) |
Ian Rogers | 0f67847 | 2014-03-10 16:18:37 -0700 | [diff] [blame] | 141 | #define DF_LVN (UINT64_C(1) << kDoLVN) |
buzbee | 311ca16 | 2013-02-28 15:56:43 -0800 | [diff] [blame] | 142 | |
| 143 | #define DF_HAS_USES (DF_UA | DF_UB | DF_UC) |
| 144 | |
| 145 | #define DF_HAS_DEFS (DF_DA) |
| 146 | |
| 147 | #define DF_HAS_NULL_CHKS (DF_NULL_CHK_0 | \ |
| 148 | DF_NULL_CHK_1 | \ |
| 149 | DF_NULL_CHK_2 | \ |
| 150 | DF_NULL_CHK_OUT0) |
| 151 | |
| 152 | #define DF_HAS_RANGE_CHKS (DF_RANGE_CHK_1 | \ |
| 153 | DF_RANGE_CHK_2 | \ |
| 154 | DF_RANGE_CHK_3) |
| 155 | |
| 156 | #define DF_HAS_NR_CHKS (DF_HAS_NULL_CHKS | \ |
| 157 | DF_HAS_RANGE_CHKS) |
| 158 | |
| 159 | #define DF_A_IS_REG (DF_UA | DF_DA) |
| 160 | #define DF_B_IS_REG (DF_UB) |
| 161 | #define DF_C_IS_REG (DF_UC) |
| 162 | #define DF_IS_GETTER_OR_SETTER (DF_IS_GETTER | DF_IS_SETTER) |
| 163 | #define DF_USES_FP (DF_FP_A | DF_FP_B | DF_FP_C) |
Bill Buzbee | 0b1191c | 2013-10-28 22:11:59 +0000 | [diff] [blame] | 164 | #define DF_NULL_TRANSFER (DF_NULL_TRANSFER_0 | DF_NULL_TRANSFER_N) |
buzbee | 1fd3346 | 2013-03-25 13:40:45 -0700 | [diff] [blame] | 165 | enum OatMethodAttributes { |
| 166 | kIsLeaf, // Method is leaf. |
| 167 | kHasLoop, // Method contains simple loop. |
| 168 | }; |
| 169 | |
| 170 | #define METHOD_IS_LEAF (1 << kIsLeaf) |
| 171 | #define METHOD_HAS_LOOP (1 << kHasLoop) |
| 172 | |
| 173 | // Minimum field size to contain Dalvik v_reg number. |
| 174 | #define VREG_NUM_WIDTH 16 |
| 175 | |
| 176 | #define INVALID_SREG (-1) |
| 177 | #define INVALID_VREG (0xFFFFU) |
buzbee | 1fd3346 | 2013-03-25 13:40:45 -0700 | [diff] [blame] | 178 | #define INVALID_OFFSET (0xDEADF00FU) |
| 179 | |
buzbee | 1fd3346 | 2013-03-25 13:40:45 -0700 | [diff] [blame] | 180 | #define MIR_IGNORE_NULL_CHECK (1 << kMIRIgnoreNullCheck) |
| 181 | #define MIR_NULL_CHECK_ONLY (1 << kMIRNullCheckOnly) |
| 182 | #define MIR_IGNORE_RANGE_CHECK (1 << kMIRIgnoreRangeCheck) |
| 183 | #define MIR_RANGE_CHECK_ONLY (1 << kMIRRangeCheckOnly) |
Vladimir Marko | bfea9c2 | 2014-01-17 17:49:33 +0000 | [diff] [blame] | 184 | #define MIR_IGNORE_CLINIT_CHECK (1 << kMIRIgnoreClInitCheck) |
buzbee | 1fd3346 | 2013-03-25 13:40:45 -0700 | [diff] [blame] | 185 | #define MIR_INLINED (1 << kMIRInlined) |
| 186 | #define MIR_INLINED_PRED (1 << kMIRInlinedPred) |
| 187 | #define MIR_CALLEE (1 << kMIRCallee) |
| 188 | #define MIR_IGNORE_SUSPEND_CHECK (1 << kMIRIgnoreSuspendCheck) |
| 189 | #define MIR_DUP (1 << kMIRDup) |
| 190 | |
buzbee | 862a760 | 2013-04-05 10:58:54 -0700 | [diff] [blame] | 191 | #define BLOCK_NAME_LEN 80 |
| 192 | |
buzbee | 0d82948 | 2013-10-11 15:24:55 -0700 | [diff] [blame] | 193 | typedef uint16_t BasicBlockId; |
| 194 | static const BasicBlockId NullBasicBlockId = 0; |
Wei Jin | 04f4d8a | 2014-05-29 18:04:29 -0700 | [diff] [blame] | 195 | static constexpr bool kLeafOptimization = false; |
buzbee | 0d82948 | 2013-10-11 15:24:55 -0700 | [diff] [blame] | 196 | |
buzbee | 1fd3346 | 2013-03-25 13:40:45 -0700 | [diff] [blame] | 197 | /* |
| 198 | * In general, vreg/sreg describe Dalvik registers that originated with dx. However, |
| 199 | * it is useful to have compiler-generated temporary registers and have them treated |
| 200 | * in the same manner as dx-generated virtual registers. This struct records the SSA |
| 201 | * name of compiler-introduced temporaries. |
| 202 | */ |
| 203 | struct CompilerTemp { |
Razvan A Lupusoru | da7a69b | 2014-01-08 15:09:50 -0800 | [diff] [blame] | 204 | int32_t v_reg; // Virtual register number for temporary. |
| 205 | int32_t s_reg_low; // SSA name for low Dalvik word. |
| 206 | }; |
| 207 | |
| 208 | enum CompilerTempType { |
| 209 | kCompilerTempVR, // A virtual register temporary. |
| 210 | kCompilerTempSpecialMethodPtr, // Temporary that keeps track of current method pointer. |
buzbee | 1fd3346 | 2013-03-25 13:40:45 -0700 | [diff] [blame] | 211 | }; |
| 212 | |
| 213 | // When debug option enabled, records effectiveness of null and range check elimination. |
| 214 | struct Checkstats { |
buzbee | 0d82948 | 2013-10-11 15:24:55 -0700 | [diff] [blame] | 215 | int32_t null_checks; |
| 216 | int32_t null_checks_eliminated; |
| 217 | int32_t range_checks; |
| 218 | int32_t range_checks_eliminated; |
buzbee | 1fd3346 | 2013-03-25 13:40:45 -0700 | [diff] [blame] | 219 | }; |
| 220 | |
| 221 | // Dataflow attributes of a basic block. |
| 222 | struct BasicBlockDataFlow { |
| 223 | ArenaBitVector* use_v; |
| 224 | ArenaBitVector* def_v; |
| 225 | ArenaBitVector* live_in_v; |
| 226 | ArenaBitVector* phi_v; |
Jean Christophe Beyler | 4896d7b | 2014-05-01 15:36:22 -0700 | [diff] [blame] | 227 | int32_t* vreg_to_ssa_map_exit; |
Vladimir Marko | bfea9c2 | 2014-01-17 17:49:33 +0000 | [diff] [blame] | 228 | ArenaBitVector* ending_check_v; // For null check and class init check elimination. |
buzbee | 1fd3346 | 2013-03-25 13:40:45 -0700 | [diff] [blame] | 229 | }; |
| 230 | |
| 231 | /* |
| 232 | * Normalized use/def for a MIR operation using SSA names rather than vregs. Note that |
| 233 | * uses/defs retain the Dalvik convention that long operations operate on a pair of 32-bit |
| 234 | * vregs. For example, "ADD_LONG v0, v2, v3" would have 2 defs (v0/v1) and 4 uses (v2/v3, v4/v5). |
| 235 | * Following SSA renaming, this is the primary struct used by code generators to locate |
| 236 | * operand and result registers. This is a somewhat confusing and unhelpful convention that |
| 237 | * we may want to revisit in the future. |
Jean Christophe Beyler | 4896d7b | 2014-05-01 15:36:22 -0700 | [diff] [blame] | 238 | * |
| 239 | * TODO: |
| 240 | * 1. Add accessors for uses/defs and make data private |
| 241 | * 2. Change fp_use/fp_def to a bit array (could help memory usage) |
| 242 | * 3. Combine array storage into internal array and handled via accessors from 1. |
buzbee | 1fd3346 | 2013-03-25 13:40:45 -0700 | [diff] [blame] | 243 | */ |
| 244 | struct SSARepresentation { |
buzbee | 0d82948 | 2013-10-11 15:24:55 -0700 | [diff] [blame] | 245 | int32_t* uses; |
buzbee | 1fd3346 | 2013-03-25 13:40:45 -0700 | [diff] [blame] | 246 | bool* fp_use; |
buzbee | 0d82948 | 2013-10-11 15:24:55 -0700 | [diff] [blame] | 247 | int32_t* defs; |
buzbee | 1fd3346 | 2013-03-25 13:40:45 -0700 | [diff] [blame] | 248 | bool* fp_def; |
Jean Christophe Beyler | 4896d7b | 2014-05-01 15:36:22 -0700 | [diff] [blame] | 249 | int16_t num_uses_allocated; |
| 250 | int16_t num_defs_allocated; |
| 251 | int16_t num_uses; |
| 252 | int16_t num_defs; |
Jean Christophe Beyler | 3aa5773 | 2014-04-17 12:47:24 -0700 | [diff] [blame] | 253 | |
| 254 | static uint32_t GetStartUseIndex(Instruction::Code opcode); |
buzbee | 1fd3346 | 2013-03-25 13:40:45 -0700 | [diff] [blame] | 255 | }; |
| 256 | |
| 257 | /* |
| 258 | * The Midlevel Intermediate Representation node, which may be largely considered a |
| 259 | * wrapper around a Dalvik byte code. |
| 260 | */ |
| 261 | struct MIR { |
buzbee | 0d82948 | 2013-10-11 15:24:55 -0700 | [diff] [blame] | 262 | /* |
| 263 | * TODO: remove embedded DecodedInstruction to save space, keeping only opcode. Recover |
| 264 | * additional fields on as-needed basis. Question: how to support MIR Pseudo-ops; probably |
| 265 | * need to carry aux data pointer. |
| 266 | */ |
Ian Rogers | 29a2648 | 2014-05-02 15:27:29 -0700 | [diff] [blame] | 267 | struct DecodedInstruction { |
| 268 | uint32_t vA; |
| 269 | uint32_t vB; |
| 270 | uint64_t vB_wide; /* for k51l */ |
| 271 | uint32_t vC; |
| 272 | uint32_t arg[5]; /* vC/D/E/F/G in invoke or filled-new-array */ |
| 273 | Instruction::Code opcode; |
Jean Christophe Beyler | 3aa5773 | 2014-04-17 12:47:24 -0700 | [diff] [blame] | 274 | |
| 275 | explicit DecodedInstruction():vA(0), vB(0), vB_wide(0), vC(0), opcode(Instruction::NOP) { |
| 276 | } |
Jean Christophe Beyler | c3db20b | 2014-05-05 21:09:40 -0700 | [diff] [blame] | 277 | |
| 278 | /* |
| 279 | * Given a decoded instruction representing a const bytecode, it updates |
| 280 | * the out arguments with proper values as dictated by the constant bytecode. |
| 281 | */ |
| 282 | bool GetConstant(int64_t* ptr_value, bool* wide) const; |
| 283 | |
| 284 | bool IsStore() const { |
| 285 | return ((Instruction::FlagsOf(opcode) & Instruction::kStore) == Instruction::kStore); |
| 286 | } |
| 287 | |
| 288 | bool IsLoad() const { |
| 289 | return ((Instruction::FlagsOf(opcode) & Instruction::kLoad) == Instruction::kLoad); |
| 290 | } |
| 291 | |
| 292 | bool IsConditionalBranch() const { |
| 293 | return (Instruction::FlagsOf(opcode) == (Instruction::kContinue | Instruction::kBranch)); |
| 294 | } |
| 295 | |
| 296 | /** |
| 297 | * @brief Is the register C component of the decoded instruction a constant? |
| 298 | */ |
| 299 | bool IsCFieldOrConstant() const { |
| 300 | return ((Instruction::FlagsOf(opcode) & Instruction::kRegCFieldOrConstant) == Instruction::kRegCFieldOrConstant); |
| 301 | } |
| 302 | |
| 303 | /** |
| 304 | * @brief Is the register C component of the decoded instruction a constant? |
| 305 | */ |
| 306 | bool IsBFieldOrConstant() const { |
| 307 | return ((Instruction::FlagsOf(opcode) & Instruction::kRegBFieldOrConstant) == Instruction::kRegBFieldOrConstant); |
| 308 | } |
| 309 | |
| 310 | bool IsCast() const { |
| 311 | return ((Instruction::FlagsOf(opcode) & Instruction::kCast) == Instruction::kCast); |
| 312 | } |
| 313 | |
| 314 | /** |
| 315 | * @brief Does the instruction clobber memory? |
| 316 | * @details Clobber means that the instruction changes the memory not in a punctual way. |
| 317 | * Therefore any supposition on memory aliasing or memory contents should be disregarded |
| 318 | * when crossing such an instruction. |
| 319 | */ |
| 320 | bool Clobbers() const { |
| 321 | return ((Instruction::FlagsOf(opcode) & Instruction::kClobber) == Instruction::kClobber); |
| 322 | } |
| 323 | |
| 324 | bool IsLinear() const { |
| 325 | return (Instruction::FlagsOf(opcode) & (Instruction::kAdd | Instruction::kSubtract)) != 0; |
| 326 | } |
Ian Rogers | 29a2648 | 2014-05-02 15:27:29 -0700 | [diff] [blame] | 327 | } dalvikInsn; |
| 328 | |
buzbee | 0d82948 | 2013-10-11 15:24:55 -0700 | [diff] [blame] | 329 | NarrowDexOffset offset; // Offset of the instruction in code units. |
| 330 | uint16_t optimization_flags; |
| 331 | int16_t m_unit_index; // From which method was this MIR included |
Jean Christophe Beyler | 3aa5773 | 2014-04-17 12:47:24 -0700 | [diff] [blame] | 332 | BasicBlockId bb; |
buzbee | 1fd3346 | 2013-03-25 13:40:45 -0700 | [diff] [blame] | 333 | MIR* next; |
| 334 | SSARepresentation* ssa_rep; |
buzbee | 1fd3346 | 2013-03-25 13:40:45 -0700 | [diff] [blame] | 335 | union { |
buzbee | 0d82948 | 2013-10-11 15:24:55 -0700 | [diff] [blame] | 336 | // Incoming edges for phi node. |
| 337 | BasicBlockId* phi_incoming; |
Vladimir Marko | 4376c87 | 2014-01-23 12:39:29 +0000 | [diff] [blame] | 338 | // Establish link from check instruction (kMirOpCheck) to the actual throwing instruction. |
buzbee | 1fd3346 | 2013-03-25 13:40:45 -0700 | [diff] [blame] | 339 | MIR* throw_insn; |
Vladimir Marko | a1a7074 | 2014-03-03 10:28:05 +0000 | [diff] [blame] | 340 | // Branch condition for fused cmp or select. |
Vladimir Marko | a894607 | 2014-01-22 10:30:44 +0000 | [diff] [blame] | 341 | ConditionCode ccode; |
Vladimir Marko | be0e546 | 2014-02-26 11:24:15 +0000 | [diff] [blame] | 342 | // IGET/IPUT lowering info index, points to MIRGraph::ifield_lowering_infos_. Due to limit on |
| 343 | // the number of code points (64K) and size of IGET/IPUT insn (2), this will never exceed 32K. |
| 344 | uint32_t ifield_lowering_info; |
| 345 | // SGET/SPUT lowering info index, points to MIRGraph::sfield_lowering_infos_. Due to limit on |
| 346 | // the number of code points (64K) and size of SGET/SPUT insn (2), this will never exceed 32K. |
| 347 | uint32_t sfield_lowering_info; |
Vladimir Marko | f096aad | 2014-01-23 15:51:58 +0000 | [diff] [blame] | 348 | // INVOKE data index, points to MIRGraph::method_lowering_infos_. |
| 349 | uint32_t method_lowering_info; |
buzbee | 1fd3346 | 2013-03-25 13:40:45 -0700 | [diff] [blame] | 350 | } meta; |
Jean Christophe Beyler | 3aa5773 | 2014-04-17 12:47:24 -0700 | [diff] [blame] | 351 | |
| 352 | explicit MIR():offset(0), optimization_flags(0), m_unit_index(0), bb(NullBasicBlockId), |
| 353 | next(nullptr), ssa_rep(nullptr) { |
| 354 | memset(&meta, 0, sizeof(meta)); |
| 355 | } |
| 356 | |
| 357 | uint32_t GetStartUseIndex() const { |
| 358 | return SSARepresentation::GetStartUseIndex(dalvikInsn.opcode); |
| 359 | } |
| 360 | |
| 361 | MIR* Copy(CompilationUnit *c_unit); |
| 362 | MIR* Copy(MIRGraph* mir_Graph); |
| 363 | |
| 364 | static void* operator new(size_t size, ArenaAllocator* arena) { |
| 365 | return arena->Alloc(sizeof(MIR), kArenaAllocMIR); |
| 366 | } |
| 367 | static void operator delete(void* p) {} // Nop. |
buzbee | 1fd3346 | 2013-03-25 13:40:45 -0700 | [diff] [blame] | 368 | }; |
| 369 | |
buzbee | 862a760 | 2013-04-05 10:58:54 -0700 | [diff] [blame] | 370 | struct SuccessorBlockInfo; |
| 371 | |
buzbee | 1fd3346 | 2013-03-25 13:40:45 -0700 | [diff] [blame] | 372 | struct BasicBlock { |
buzbee | 0d82948 | 2013-10-11 15:24:55 -0700 | [diff] [blame] | 373 | BasicBlockId id; |
| 374 | BasicBlockId dfs_id; |
| 375 | NarrowDexOffset start_offset; // Offset in code units. |
| 376 | BasicBlockId fall_through; |
| 377 | BasicBlockId taken; |
| 378 | BasicBlockId i_dom; // Immediate dominator. |
buzbee | 1fd3346 | 2013-03-25 13:40:45 -0700 | [diff] [blame] | 379 | uint16_t nesting_depth; |
buzbee | 0d82948 | 2013-10-11 15:24:55 -0700 | [diff] [blame] | 380 | BBType block_type:4; |
| 381 | BlockListType successor_block_list_type:4; |
| 382 | bool visited:1; |
| 383 | bool hidden:1; |
| 384 | bool catch_entry:1; |
| 385 | bool explicit_throw:1; |
| 386 | bool conditional_branch:1; |
buzbee | 1da1e2f | 2013-11-15 13:37:01 -0800 | [diff] [blame] | 387 | bool terminated_by_return:1; // Block ends with a Dalvik return opcode. |
| 388 | bool dominates_return:1; // Is a member of return extended basic block. |
| 389 | bool use_lvn:1; // Run local value numbering on this block. |
buzbee | 1fd3346 | 2013-03-25 13:40:45 -0700 | [diff] [blame] | 390 | MIR* first_mir_insn; |
| 391 | MIR* last_mir_insn; |
buzbee | 1fd3346 | 2013-03-25 13:40:45 -0700 | [diff] [blame] | 392 | BasicBlockDataFlow* data_flow_info; |
buzbee | 1fd3346 | 2013-03-25 13:40:45 -0700 | [diff] [blame] | 393 | ArenaBitVector* dominators; |
| 394 | ArenaBitVector* i_dominated; // Set nodes being immediately dominated. |
| 395 | ArenaBitVector* dom_frontier; // Dominance frontier. |
buzbee | 0d82948 | 2013-10-11 15:24:55 -0700 | [diff] [blame] | 396 | GrowableArray<BasicBlockId>* predecessors; |
| 397 | GrowableArray<SuccessorBlockInfo*>* successor_blocks; |
Jean Christophe Beyler | cdacac4 | 2014-03-13 14:54:59 -0700 | [diff] [blame] | 398 | |
| 399 | void AppendMIR(MIR* mir); |
Jean Christophe Beyler | 8512758 | 2014-05-11 23:36:41 -0700 | [diff] [blame] | 400 | void AppendMIRList(MIR* first_list_mir, MIR* last_list_mir); |
| 401 | void AppendMIRList(const std::vector<MIR*>& insns); |
Jean Christophe Beyler | cdacac4 | 2014-03-13 14:54:59 -0700 | [diff] [blame] | 402 | void PrependMIR(MIR* mir); |
Jean Christophe Beyler | 8512758 | 2014-05-11 23:36:41 -0700 | [diff] [blame] | 403 | void PrependMIRList(MIR* first_list_mir, MIR* last_list_mir); |
| 404 | void PrependMIRList(const std::vector<MIR*>& to_add); |
Jean Christophe Beyler | cdacac4 | 2014-03-13 14:54:59 -0700 | [diff] [blame] | 405 | void InsertMIRAfter(MIR* current_mir, MIR* new_mir); |
Jean Christophe Beyler | 8512758 | 2014-05-11 23:36:41 -0700 | [diff] [blame] | 406 | void InsertMIRListAfter(MIR* insert_after, MIR* first_list_mir, MIR* last_list_mir); |
Jean Christophe Beyler | 3aa5773 | 2014-04-17 12:47:24 -0700 | [diff] [blame] | 407 | MIR* FindPreviousMIR(MIR* mir); |
Jean Christophe Beyler | 8512758 | 2014-05-11 23:36:41 -0700 | [diff] [blame] | 408 | void InsertMIRBefore(MIR* insert_before, MIR* list); |
| 409 | void InsertMIRListBefore(MIR* insert_before, MIR* first_list_mir, MIR* last_list_mir); |
| 410 | bool RemoveMIR(MIR* mir); |
| 411 | bool RemoveMIRList(MIR* first_list_mir, MIR* last_list_mir); |
| 412 | |
| 413 | BasicBlock* Copy(CompilationUnit* c_unit); |
| 414 | BasicBlock* Copy(MIRGraph* mir_graph); |
| 415 | |
| 416 | /** |
| 417 | * @brief Reset the optimization_flags field of each MIR. |
| 418 | */ |
| 419 | void ResetOptimizationFlags(uint16_t reset_flags); |
| 420 | |
| 421 | /** |
| 422 | * @brief Hide the BasicBlock. |
| 423 | * @details Set it to kDalvikByteCode, set hidden to true, remove all MIRs, |
| 424 | * remove itself from any predecessor edges, remove itself from any |
| 425 | * child's predecessor growable array. |
| 426 | */ |
| 427 | void Hide(CompilationUnit* c_unit); |
| 428 | |
| 429 | /** |
| 430 | * @brief Is ssa_reg the last SSA definition of that VR in the block? |
| 431 | */ |
| 432 | bool IsSSALiveOut(const CompilationUnit* c_unit, int ssa_reg); |
| 433 | |
| 434 | /** |
| 435 | * @brief Replace the edge going to old_bb to now go towards new_bb. |
| 436 | */ |
| 437 | bool ReplaceChild(BasicBlockId old_bb, BasicBlockId new_bb); |
| 438 | |
| 439 | /** |
| 440 | * @brief Update the predecessor growable array from old_pred to new_pred. |
| 441 | */ |
| 442 | void UpdatePredecessor(BasicBlockId old_pred, BasicBlockId new_pred); |
Jean Christophe Beyler | cdacac4 | 2014-03-13 14:54:59 -0700 | [diff] [blame] | 443 | |
| 444 | /** |
| 445 | * @brief Used to obtain the next MIR that follows unconditionally. |
| 446 | * @details The implementation does not guarantee that a MIR does not |
| 447 | * follow even if this method returns nullptr. |
| 448 | * @param mir_graph the MIRGraph. |
| 449 | * @param current The MIR for which to find an unconditional follower. |
| 450 | * @return Returns the following MIR if one can be found. |
| 451 | */ |
| 452 | MIR* GetNextUnconditionalMir(MIRGraph* mir_graph, MIR* current); |
Jean Christophe Beyler | 44e5bde | 2014-04-29 14:40:41 -0700 | [diff] [blame] | 453 | bool IsExceptionBlock() const; |
Jean Christophe Beyler | 8512758 | 2014-05-11 23:36:41 -0700 | [diff] [blame] | 454 | |
| 455 | static void* operator new(size_t size, ArenaAllocator* arena) { |
| 456 | return arena->Alloc(sizeof(BasicBlock), kArenaAllocBB); |
| 457 | } |
| 458 | static void operator delete(void* p) {} // Nop. |
buzbee | 1fd3346 | 2013-03-25 13:40:45 -0700 | [diff] [blame] | 459 | }; |
| 460 | |
| 461 | /* |
| 462 | * The "blocks" field in "successor_block_list" points to an array of elements with the type |
Jean Christophe Beyler | 44e5bde | 2014-04-29 14:40:41 -0700 | [diff] [blame] | 463 | * "SuccessorBlockInfo". For catch blocks, key is type index for the exception. For switch |
buzbee | 1fd3346 | 2013-03-25 13:40:45 -0700 | [diff] [blame] | 464 | * blocks, key is the case value. |
| 465 | */ |
| 466 | struct SuccessorBlockInfo { |
buzbee | 0d82948 | 2013-10-11 15:24:55 -0700 | [diff] [blame] | 467 | BasicBlockId block; |
buzbee | 1fd3346 | 2013-03-25 13:40:45 -0700 | [diff] [blame] | 468 | int key; |
| 469 | }; |
| 470 | |
Jean Christophe Beyler | f8c762b | 2014-05-02 12:54:37 -0700 | [diff] [blame] | 471 | /** |
| 472 | * @class ChildBlockIterator |
| 473 | * @brief Enable an easy iteration of the children. |
| 474 | */ |
| 475 | class ChildBlockIterator { |
| 476 | public: |
| 477 | /** |
| 478 | * @brief Constructs a child iterator. |
| 479 | * @param bb The basic whose children we need to iterate through. |
| 480 | * @param mir_graph The MIRGraph used to get the basic block during iteration. |
| 481 | */ |
| 482 | ChildBlockIterator(BasicBlock* bb, MIRGraph* mir_graph); |
| 483 | BasicBlock* Next(); |
| 484 | |
| 485 | private: |
| 486 | BasicBlock* basic_block_; |
| 487 | MIRGraph* mir_graph_; |
| 488 | bool visited_fallthrough_; |
| 489 | bool visited_taken_; |
| 490 | bool have_successors_; |
| 491 | GrowableArray<SuccessorBlockInfo*>::Iterator successor_iter_; |
| 492 | }; |
| 493 | |
buzbee | 1fd3346 | 2013-03-25 13:40:45 -0700 | [diff] [blame] | 494 | /* |
| 495 | * Whereas a SSA name describes a definition of a Dalvik vreg, the RegLocation describes |
| 496 | * the type of an SSA name (and, can also be used by code generators to record where the |
| 497 | * value is located (i.e. - physical register, frame, spill, etc.). For each SSA name (SReg) |
| 498 | * there is a RegLocation. |
buzbee | 0d82948 | 2013-10-11 15:24:55 -0700 | [diff] [blame] | 499 | * A note on SSA names: |
| 500 | * o SSA names for Dalvik vRegs v0..vN will be assigned 0..N. These represent the "vN_0" |
| 501 | * names. Negative SSA names represent special values not present in the Dalvik byte code. |
| 502 | * For example, SSA name -1 represents an invalid SSA name, and SSA name -2 represents the |
| 503 | * the Method pointer. SSA names < -2 are reserved for future use. |
| 504 | * o The vN_0 names for non-argument Dalvik should in practice never be used (as they would |
| 505 | * represent the read of an undefined local variable). The first definition of the |
| 506 | * underlying Dalvik vReg will result in a vN_1 name. |
| 507 | * |
buzbee | 1fd3346 | 2013-03-25 13:40:45 -0700 | [diff] [blame] | 508 | * FIXME: The orig_sreg field was added as a workaround for llvm bitcode generation. With |
| 509 | * the latest restructuring, we should be able to remove it and rely on s_reg_low throughout. |
| 510 | */ |
| 511 | struct RegLocation { |
| 512 | RegLocationType location:3; |
| 513 | unsigned wide:1; |
| 514 | unsigned defined:1; // Do we know the type? |
| 515 | unsigned is_const:1; // Constant, value in mir_graph->constant_values[]. |
| 516 | unsigned fp:1; // Floating point? |
| 517 | unsigned core:1; // Non-floating point? |
| 518 | unsigned ref:1; // Something GC cares about. |
Brian Carlstrom | 7934ac2 | 2013-07-26 10:54:15 -0700 | [diff] [blame] | 519 | unsigned high_word:1; // High word of pair? |
buzbee | 1fd3346 | 2013-03-25 13:40:45 -0700 | [diff] [blame] | 520 | unsigned home:1; // Does this represent the home location? |
Bill Buzbee | 00e1ec6 | 2014-02-27 23:44:13 +0000 | [diff] [blame] | 521 | RegStorage reg; // Encoded physical registers. |
buzbee | 0d82948 | 2013-10-11 15:24:55 -0700 | [diff] [blame] | 522 | int16_t s_reg_low; // SSA name for low Dalvik word. |
| 523 | int16_t orig_sreg; // TODO: remove after Bitcode gen complete |
| 524 | // and consolidate usage w/ s_reg_low. |
buzbee | 1fd3346 | 2013-03-25 13:40:45 -0700 | [diff] [blame] | 525 | }; |
| 526 | |
| 527 | /* |
| 528 | * Collection of information describing an invoke, and the destination of |
| 529 | * the subsequent MOVE_RESULT (if applicable). Collected as a unit to enable |
| 530 | * more efficient invoke code generation. |
| 531 | */ |
| 532 | struct CallInfo { |
| 533 | int num_arg_words; // Note: word count, not arg count. |
| 534 | RegLocation* args; // One for each word of arguments. |
| 535 | RegLocation result; // Eventual target of MOVE_RESULT. |
| 536 | int opt_flags; |
| 537 | InvokeType type; |
| 538 | uint32_t dex_idx; |
| 539 | uint32_t index; // Method idx for invokes, type idx for FilledNewArray. |
| 540 | uintptr_t direct_code; |
| 541 | uintptr_t direct_method; |
| 542 | RegLocation target; // Target of following move_result. |
| 543 | bool skip_this; |
| 544 | bool is_range; |
buzbee | 0d82948 | 2013-10-11 15:24:55 -0700 | [diff] [blame] | 545 | DexOffset offset; // Offset in code units. |
Vladimir Marko | f096aad | 2014-01-23 15:51:58 +0000 | [diff] [blame] | 546 | MIR* mir; |
buzbee | 1fd3346 | 2013-03-25 13:40:45 -0700 | [diff] [blame] | 547 | }; |
| 548 | |
| 549 | |
buzbee | 091cc40 | 2014-03-31 10:14:40 -0700 | [diff] [blame] | 550 | const RegLocation bad_loc = {kLocDalvikFrame, 0, 0, 0, 0, 0, 0, 0, 0, RegStorage(), INVALID_SREG, |
| 551 | INVALID_SREG}; |
buzbee | 311ca16 | 2013-02-28 15:56:43 -0800 | [diff] [blame] | 552 | |
| 553 | class MIRGraph { |
Ian Rogers | 71fe267 | 2013-03-19 20:45:02 -0700 | [diff] [blame] | 554 | public: |
buzbee | 862a760 | 2013-04-05 10:58:54 -0700 | [diff] [blame] | 555 | MIRGraph(CompilationUnit* cu, ArenaAllocator* arena); |
Ian Rogers | 6282dc1 | 2013-04-18 15:54:02 -0700 | [diff] [blame] | 556 | ~MIRGraph(); |
buzbee | 311ca16 | 2013-02-28 15:56:43 -0800 | [diff] [blame] | 557 | |
Ian Rogers | 71fe267 | 2013-03-19 20:45:02 -0700 | [diff] [blame] | 558 | /* |
buzbee | ee17e0a | 2013-07-31 10:47:37 -0700 | [diff] [blame] | 559 | * Examine the graph to determine whether it's worthwile to spend the time compiling |
| 560 | * this method. |
| 561 | */ |
Brian Carlstrom | 6449c62 | 2014-02-10 23:48:36 -0800 | [diff] [blame] | 562 | bool SkipCompilation(); |
buzbee | ee17e0a | 2013-07-31 10:47:37 -0700 | [diff] [blame] | 563 | |
| 564 | /* |
Dave Allison | 39c3bfb | 2014-01-28 18:33:52 -0800 | [diff] [blame] | 565 | * Should we skip the compilation of this method based on its name? |
| 566 | */ |
| 567 | bool SkipCompilation(const std::string& methodname); |
| 568 | |
| 569 | /* |
Ian Rogers | 71fe267 | 2013-03-19 20:45:02 -0700 | [diff] [blame] | 570 | * Parse dex method and add MIR at current insert point. Returns id (which is |
| 571 | * actually the index of the method in the m_units_ array). |
| 572 | */ |
| 573 | void InlineMethod(const DexFile::CodeItem* code_item, uint32_t access_flags, |
Ian Rogers | 8b2c0b9 | 2013-09-19 02:56:49 -0700 | [diff] [blame] | 574 | InvokeType invoke_type, uint16_t class_def_idx, |
Ian Rogers | 71fe267 | 2013-03-19 20:45:02 -0700 | [diff] [blame] | 575 | uint32_t method_idx, jobject class_loader, const DexFile& dex_file); |
buzbee | 311ca16 | 2013-02-28 15:56:43 -0800 | [diff] [blame] | 576 | |
Ian Rogers | 71fe267 | 2013-03-19 20:45:02 -0700 | [diff] [blame] | 577 | /* Find existing block */ |
buzbee | 0d82948 | 2013-10-11 15:24:55 -0700 | [diff] [blame] | 578 | BasicBlock* FindBlock(DexOffset code_offset) { |
Ian Rogers | 71fe267 | 2013-03-19 20:45:02 -0700 | [diff] [blame] | 579 | return FindBlock(code_offset, false, false, NULL); |
| 580 | } |
buzbee | 311ca16 | 2013-02-28 15:56:43 -0800 | [diff] [blame] | 581 | |
Ian Rogers | 71fe267 | 2013-03-19 20:45:02 -0700 | [diff] [blame] | 582 | const uint16_t* GetCurrentInsns() const { |
| 583 | return current_code_item_->insns_; |
| 584 | } |
buzbee | 311ca16 | 2013-02-28 15:56:43 -0800 | [diff] [blame] | 585 | |
Ian Rogers | 71fe267 | 2013-03-19 20:45:02 -0700 | [diff] [blame] | 586 | const uint16_t* GetInsns(int m_unit_index) const { |
| 587 | return m_units_[m_unit_index]->GetCodeItem()->insns_; |
| 588 | } |
buzbee | 311ca16 | 2013-02-28 15:56:43 -0800 | [diff] [blame] | 589 | |
Andreas Gampe | 4439596 | 2014-06-13 13:44:40 -0700 | [diff] [blame^] | 590 | unsigned int GetNumBlocks() const { |
Ian Rogers | 71fe267 | 2013-03-19 20:45:02 -0700 | [diff] [blame] | 591 | return num_blocks_; |
| 592 | } |
buzbee | 311ca16 | 2013-02-28 15:56:43 -0800 | [diff] [blame] | 593 | |
buzbee | ee17e0a | 2013-07-31 10:47:37 -0700 | [diff] [blame] | 594 | size_t GetNumDalvikInsns() const { |
| 595 | return cu_->code_item->insns_size_in_code_units_; |
| 596 | } |
| 597 | |
Ian Rogers | 71fe267 | 2013-03-19 20:45:02 -0700 | [diff] [blame] | 598 | ArenaBitVector* GetTryBlockAddr() const { |
| 599 | return try_block_addr_; |
| 600 | } |
buzbee | 311ca16 | 2013-02-28 15:56:43 -0800 | [diff] [blame] | 601 | |
Ian Rogers | 71fe267 | 2013-03-19 20:45:02 -0700 | [diff] [blame] | 602 | BasicBlock* GetEntryBlock() const { |
| 603 | return entry_block_; |
| 604 | } |
buzbee | 311ca16 | 2013-02-28 15:56:43 -0800 | [diff] [blame] | 605 | |
Ian Rogers | 71fe267 | 2013-03-19 20:45:02 -0700 | [diff] [blame] | 606 | BasicBlock* GetExitBlock() const { |
| 607 | return exit_block_; |
| 608 | } |
buzbee | 311ca16 | 2013-02-28 15:56:43 -0800 | [diff] [blame] | 609 | |
Andreas Gampe | 4439596 | 2014-06-13 13:44:40 -0700 | [diff] [blame^] | 610 | BasicBlock* GetBasicBlock(unsigned int block_id) const { |
buzbee | 0d82948 | 2013-10-11 15:24:55 -0700 | [diff] [blame] | 611 | return (block_id == NullBasicBlockId) ? NULL : block_list_.Get(block_id); |
Ian Rogers | 71fe267 | 2013-03-19 20:45:02 -0700 | [diff] [blame] | 612 | } |
buzbee | 311ca16 | 2013-02-28 15:56:43 -0800 | [diff] [blame] | 613 | |
Ian Rogers | 71fe267 | 2013-03-19 20:45:02 -0700 | [diff] [blame] | 614 | size_t GetBasicBlockListCount() const { |
buzbee | 862a760 | 2013-04-05 10:58:54 -0700 | [diff] [blame] | 615 | return block_list_.Size(); |
Ian Rogers | 71fe267 | 2013-03-19 20:45:02 -0700 | [diff] [blame] | 616 | } |
buzbee | 311ca16 | 2013-02-28 15:56:43 -0800 | [diff] [blame] | 617 | |
buzbee | 862a760 | 2013-04-05 10:58:54 -0700 | [diff] [blame] | 618 | GrowableArray<BasicBlock*>* GetBlockList() { |
Ian Rogers | 71fe267 | 2013-03-19 20:45:02 -0700 | [diff] [blame] | 619 | return &block_list_; |
| 620 | } |
buzbee | 311ca16 | 2013-02-28 15:56:43 -0800 | [diff] [blame] | 621 | |
buzbee | 0d82948 | 2013-10-11 15:24:55 -0700 | [diff] [blame] | 622 | GrowableArray<BasicBlockId>* GetDfsOrder() { |
buzbee | 862a760 | 2013-04-05 10:58:54 -0700 | [diff] [blame] | 623 | return dfs_order_; |
Ian Rogers | 71fe267 | 2013-03-19 20:45:02 -0700 | [diff] [blame] | 624 | } |
buzbee | 311ca16 | 2013-02-28 15:56:43 -0800 | [diff] [blame] | 625 | |
buzbee | 0d82948 | 2013-10-11 15:24:55 -0700 | [diff] [blame] | 626 | GrowableArray<BasicBlockId>* GetDfsPostOrder() { |
buzbee | 862a760 | 2013-04-05 10:58:54 -0700 | [diff] [blame] | 627 | return dfs_post_order_; |
Ian Rogers | 71fe267 | 2013-03-19 20:45:02 -0700 | [diff] [blame] | 628 | } |
buzbee | 311ca16 | 2013-02-28 15:56:43 -0800 | [diff] [blame] | 629 | |
buzbee | 0d82948 | 2013-10-11 15:24:55 -0700 | [diff] [blame] | 630 | GrowableArray<BasicBlockId>* GetDomPostOrder() { |
buzbee | 862a760 | 2013-04-05 10:58:54 -0700 | [diff] [blame] | 631 | return dom_post_order_traversal_; |
Ian Rogers | 71fe267 | 2013-03-19 20:45:02 -0700 | [diff] [blame] | 632 | } |
buzbee | 311ca16 | 2013-02-28 15:56:43 -0800 | [diff] [blame] | 633 | |
Ian Rogers | 71fe267 | 2013-03-19 20:45:02 -0700 | [diff] [blame] | 634 | int GetDefCount() const { |
| 635 | return def_count_; |
| 636 | } |
buzbee | 311ca16 | 2013-02-28 15:56:43 -0800 | [diff] [blame] | 637 | |
buzbee | 862a760 | 2013-04-05 10:58:54 -0700 | [diff] [blame] | 638 | ArenaAllocator* GetArena() { |
| 639 | return arena_; |
| 640 | } |
| 641 | |
Ian Rogers | 71fe267 | 2013-03-19 20:45:02 -0700 | [diff] [blame] | 642 | void EnableOpcodeCounting() { |
Mathieu Chartier | f6c4b3b | 2013-08-24 16:11:37 -0700 | [diff] [blame] | 643 | opcode_count_ = static_cast<int*>(arena_->Alloc(kNumPackedOpcodes * sizeof(int), |
Vladimir Marko | 83cc7ae | 2014-02-12 18:02:05 +0000 | [diff] [blame] | 644 | kArenaAllocMisc)); |
Ian Rogers | 71fe267 | 2013-03-19 20:45:02 -0700 | [diff] [blame] | 645 | } |
buzbee | 311ca16 | 2013-02-28 15:56:43 -0800 | [diff] [blame] | 646 | |
Ian Rogers | 71fe267 | 2013-03-19 20:45:02 -0700 | [diff] [blame] | 647 | void ShowOpcodeStats(); |
buzbee | 311ca16 | 2013-02-28 15:56:43 -0800 | [diff] [blame] | 648 | |
Ian Rogers | 71fe267 | 2013-03-19 20:45:02 -0700 | [diff] [blame] | 649 | DexCompilationUnit* GetCurrentDexCompilationUnit() const { |
| 650 | return m_units_[current_method_]; |
| 651 | } |
buzbee | 311ca16 | 2013-02-28 15:56:43 -0800 | [diff] [blame] | 652 | |
Jean Christophe Beyler | d0a5155 | 2014-01-10 14:18:31 -0800 | [diff] [blame] | 653 | /** |
| 654 | * @brief Dump a CFG into a dot file format. |
| 655 | * @param dir_prefix the directory the file will be created in. |
| 656 | * @param all_blocks does the dumper use all the basic blocks or use the reachable blocks. |
| 657 | * @param suffix does the filename require a suffix or not (default = nullptr). |
| 658 | */ |
| 659 | void DumpCFG(const char* dir_prefix, bool all_blocks, const char* suffix = nullptr); |
buzbee | 311ca16 | 2013-02-28 15:56:43 -0800 | [diff] [blame] | 660 | |
Vladimir Marko | 3d73ba2 | 2014-03-06 15:18:04 +0000 | [diff] [blame] | 661 | bool HasFieldAccess() const { |
| 662 | return (merged_df_flags_ & (DF_IFIELD | DF_SFIELD)) != 0u; |
| 663 | } |
| 664 | |
Vladimir Marko | bfea9c2 | 2014-01-17 17:49:33 +0000 | [diff] [blame] | 665 | bool HasStaticFieldAccess() const { |
| 666 | return (merged_df_flags_ & DF_SFIELD) != 0u; |
| 667 | } |
| 668 | |
Vladimir Marko | 3d73ba2 | 2014-03-06 15:18:04 +0000 | [diff] [blame] | 669 | bool HasInvokes() const { |
| 670 | // NOTE: These formats include the rare filled-new-array/range. |
| 671 | return (merged_df_flags_ & (DF_FORMAT_35C | DF_FORMAT_3RC)) != 0u; |
| 672 | } |
| 673 | |
Vladimir Marko | be0e546 | 2014-02-26 11:24:15 +0000 | [diff] [blame] | 674 | void DoCacheFieldLoweringInfo(); |
| 675 | |
Vladimir Marko | 3d73ba2 | 2014-03-06 15:18:04 +0000 | [diff] [blame] | 676 | const MirIFieldLoweringInfo& GetIFieldLoweringInfo(MIR* mir) const { |
Vladimir Marko | be0e546 | 2014-02-26 11:24:15 +0000 | [diff] [blame] | 677 | DCHECK_LT(mir->meta.ifield_lowering_info, ifield_lowering_infos_.Size()); |
| 678 | return ifield_lowering_infos_.GetRawStorage()[mir->meta.ifield_lowering_info]; |
| 679 | } |
| 680 | |
Vladimir Marko | 3d73ba2 | 2014-03-06 15:18:04 +0000 | [diff] [blame] | 681 | const MirSFieldLoweringInfo& GetSFieldLoweringInfo(MIR* mir) const { |
Vladimir Marko | be0e546 | 2014-02-26 11:24:15 +0000 | [diff] [blame] | 682 | DCHECK_LT(mir->meta.sfield_lowering_info, sfield_lowering_infos_.Size()); |
| 683 | return sfield_lowering_infos_.GetRawStorage()[mir->meta.sfield_lowering_info]; |
| 684 | } |
| 685 | |
Vladimir Marko | f096aad | 2014-01-23 15:51:58 +0000 | [diff] [blame] | 686 | void DoCacheMethodLoweringInfo(); |
| 687 | |
| 688 | const MirMethodLoweringInfo& GetMethodLoweringInfo(MIR* mir) { |
| 689 | DCHECK_LT(mir->meta.method_lowering_info, method_lowering_infos_.Size()); |
| 690 | return method_lowering_infos_.GetRawStorage()[mir->meta.method_lowering_info]; |
| 691 | } |
| 692 | |
Vladimir Marko | 9820b7c | 2014-01-02 16:40:37 +0000 | [diff] [blame] | 693 | void ComputeInlineIFieldLoweringInfo(uint16_t field_idx, MIR* invoke, MIR* iget_or_iput); |
| 694 | |
buzbee | 1da1e2f | 2013-11-15 13:37:01 -0800 | [diff] [blame] | 695 | void InitRegLocations(); |
| 696 | |
| 697 | void RemapRegLocations(); |
buzbee | 311ca16 | 2013-02-28 15:56:43 -0800 | [diff] [blame] | 698 | |
Ian Rogers | 71fe267 | 2013-03-19 20:45:02 -0700 | [diff] [blame] | 699 | void DumpRegLocTable(RegLocation* table, int count); |
buzbee | 311ca16 | 2013-02-28 15:56:43 -0800 | [diff] [blame] | 700 | |
Ian Rogers | 71fe267 | 2013-03-19 20:45:02 -0700 | [diff] [blame] | 701 | void BasicBlockOptimization(); |
buzbee | 311ca16 | 2013-02-28 15:56:43 -0800 | [diff] [blame] | 702 | |
Jean Christophe Beyler | 44e5bde | 2014-04-29 14:40:41 -0700 | [diff] [blame] | 703 | GrowableArray<BasicBlockId>* GetTopologicalSortOrder() { |
| 704 | return topological_order_; |
| 705 | } |
| 706 | |
Ian Rogers | 71fe267 | 2013-03-19 20:45:02 -0700 | [diff] [blame] | 707 | bool IsConst(int32_t s_reg) const { |
buzbee | 862a760 | 2013-04-05 10:58:54 -0700 | [diff] [blame] | 708 | return is_constant_v_->IsBitSet(s_reg); |
Ian Rogers | 71fe267 | 2013-03-19 20:45:02 -0700 | [diff] [blame] | 709 | } |
buzbee | 311ca16 | 2013-02-28 15:56:43 -0800 | [diff] [blame] | 710 | |
Ian Rogers | 71fe267 | 2013-03-19 20:45:02 -0700 | [diff] [blame] | 711 | bool IsConst(RegLocation loc) const { |
Mark Mendell | 5bb149e | 2013-12-17 13:26:54 -0800 | [diff] [blame] | 712 | return loc.orig_sreg < 0 ? false : IsConst(loc.orig_sreg); |
Ian Rogers | 71fe267 | 2013-03-19 20:45:02 -0700 | [diff] [blame] | 713 | } |
buzbee | 311ca16 | 2013-02-28 15:56:43 -0800 | [diff] [blame] | 714 | |
Ian Rogers | 71fe267 | 2013-03-19 20:45:02 -0700 | [diff] [blame] | 715 | int32_t ConstantValue(RegLocation loc) const { |
| 716 | DCHECK(IsConst(loc)); |
| 717 | return constant_values_[loc.orig_sreg]; |
| 718 | } |
buzbee | 311ca16 | 2013-02-28 15:56:43 -0800 | [diff] [blame] | 719 | |
Ian Rogers | 71fe267 | 2013-03-19 20:45:02 -0700 | [diff] [blame] | 720 | int32_t ConstantValue(int32_t s_reg) const { |
| 721 | DCHECK(IsConst(s_reg)); |
| 722 | return constant_values_[s_reg]; |
| 723 | } |
buzbee | 311ca16 | 2013-02-28 15:56:43 -0800 | [diff] [blame] | 724 | |
Ian Rogers | 71fe267 | 2013-03-19 20:45:02 -0700 | [diff] [blame] | 725 | int64_t ConstantValueWide(RegLocation loc) const { |
| 726 | DCHECK(IsConst(loc)); |
| 727 | return (static_cast<int64_t>(constant_values_[loc.orig_sreg + 1]) << 32) | |
| 728 | Low32Bits(static_cast<int64_t>(constant_values_[loc.orig_sreg])); |
| 729 | } |
buzbee | 311ca16 | 2013-02-28 15:56:43 -0800 | [diff] [blame] | 730 | |
Ian Rogers | 71fe267 | 2013-03-19 20:45:02 -0700 | [diff] [blame] | 731 | bool IsConstantNullRef(RegLocation loc) const { |
| 732 | return loc.ref && loc.is_const && (ConstantValue(loc) == 0); |
| 733 | } |
buzbee | 311ca16 | 2013-02-28 15:56:43 -0800 | [diff] [blame] | 734 | |
Ian Rogers | 71fe267 | 2013-03-19 20:45:02 -0700 | [diff] [blame] | 735 | int GetNumSSARegs() const { |
| 736 | return num_ssa_regs_; |
| 737 | } |
buzbee | 311ca16 | 2013-02-28 15:56:43 -0800 | [diff] [blame] | 738 | |
Ian Rogers | 71fe267 | 2013-03-19 20:45:02 -0700 | [diff] [blame] | 739 | void SetNumSSARegs(int new_num) { |
buzbee | 0d82948 | 2013-10-11 15:24:55 -0700 | [diff] [blame] | 740 | /* |
| 741 | * TODO: It's theoretically possible to exceed 32767, though any cases which did |
| 742 | * would be filtered out with current settings. When orig_sreg field is removed |
| 743 | * from RegLocation, expand s_reg_low to handle all possible cases and remove DCHECK(). |
| 744 | */ |
| 745 | DCHECK_EQ(new_num, static_cast<int16_t>(new_num)); |
Ian Rogers | 71fe267 | 2013-03-19 20:45:02 -0700 | [diff] [blame] | 746 | num_ssa_regs_ = new_num; |
| 747 | } |
buzbee | 311ca16 | 2013-02-28 15:56:43 -0800 | [diff] [blame] | 748 | |
buzbee | 862a760 | 2013-04-05 10:58:54 -0700 | [diff] [blame] | 749 | unsigned int GetNumReachableBlocks() const { |
Ian Rogers | 71fe267 | 2013-03-19 20:45:02 -0700 | [diff] [blame] | 750 | return num_reachable_blocks_; |
| 751 | } |
buzbee | 311ca16 | 2013-02-28 15:56:43 -0800 | [diff] [blame] | 752 | |
Ian Rogers | 71fe267 | 2013-03-19 20:45:02 -0700 | [diff] [blame] | 753 | int GetUseCount(int vreg) const { |
buzbee | 862a760 | 2013-04-05 10:58:54 -0700 | [diff] [blame] | 754 | return use_counts_.Get(vreg); |
Ian Rogers | 71fe267 | 2013-03-19 20:45:02 -0700 | [diff] [blame] | 755 | } |
buzbee | 311ca16 | 2013-02-28 15:56:43 -0800 | [diff] [blame] | 756 | |
Ian Rogers | 71fe267 | 2013-03-19 20:45:02 -0700 | [diff] [blame] | 757 | int GetRawUseCount(int vreg) const { |
buzbee | 862a760 | 2013-04-05 10:58:54 -0700 | [diff] [blame] | 758 | return raw_use_counts_.Get(vreg); |
Ian Rogers | 71fe267 | 2013-03-19 20:45:02 -0700 | [diff] [blame] | 759 | } |
buzbee | 311ca16 | 2013-02-28 15:56:43 -0800 | [diff] [blame] | 760 | |
Ian Rogers | 71fe267 | 2013-03-19 20:45:02 -0700 | [diff] [blame] | 761 | int GetSSASubscript(int ssa_reg) const { |
buzbee | 862a760 | 2013-04-05 10:58:54 -0700 | [diff] [blame] | 762 | return ssa_subscripts_->Get(ssa_reg); |
Ian Rogers | 71fe267 | 2013-03-19 20:45:02 -0700 | [diff] [blame] | 763 | } |
buzbee | 311ca16 | 2013-02-28 15:56:43 -0800 | [diff] [blame] | 764 | |
Brian Carlstrom | 2ce745c | 2013-07-17 17:44:30 -0700 | [diff] [blame] | 765 | RegLocation GetRawSrc(MIR* mir, int num) { |
buzbee | 1fd3346 | 2013-03-25 13:40:45 -0700 | [diff] [blame] | 766 | DCHECK(num < mir->ssa_rep->num_uses); |
| 767 | RegLocation res = reg_location_[mir->ssa_rep->uses[num]]; |
| 768 | return res; |
| 769 | } |
| 770 | |
Brian Carlstrom | 2ce745c | 2013-07-17 17:44:30 -0700 | [diff] [blame] | 771 | RegLocation GetRawDest(MIR* mir) { |
buzbee | 1fd3346 | 2013-03-25 13:40:45 -0700 | [diff] [blame] | 772 | DCHECK_GT(mir->ssa_rep->num_defs, 0); |
| 773 | RegLocation res = reg_location_[mir->ssa_rep->defs[0]]; |
| 774 | return res; |
| 775 | } |
| 776 | |
Brian Carlstrom | 2ce745c | 2013-07-17 17:44:30 -0700 | [diff] [blame] | 777 | RegLocation GetDest(MIR* mir) { |
buzbee | 1fd3346 | 2013-03-25 13:40:45 -0700 | [diff] [blame] | 778 | RegLocation res = GetRawDest(mir); |
| 779 | DCHECK(!res.wide); |
| 780 | return res; |
| 781 | } |
| 782 | |
Brian Carlstrom | 2ce745c | 2013-07-17 17:44:30 -0700 | [diff] [blame] | 783 | RegLocation GetSrc(MIR* mir, int num) { |
buzbee | 1fd3346 | 2013-03-25 13:40:45 -0700 | [diff] [blame] | 784 | RegLocation res = GetRawSrc(mir, num); |
| 785 | DCHECK(!res.wide); |
| 786 | return res; |
| 787 | } |
| 788 | |
Brian Carlstrom | 2ce745c | 2013-07-17 17:44:30 -0700 | [diff] [blame] | 789 | RegLocation GetDestWide(MIR* mir) { |
buzbee | 1fd3346 | 2013-03-25 13:40:45 -0700 | [diff] [blame] | 790 | RegLocation res = GetRawDest(mir); |
| 791 | DCHECK(res.wide); |
| 792 | return res; |
| 793 | } |
| 794 | |
Brian Carlstrom | 2ce745c | 2013-07-17 17:44:30 -0700 | [diff] [blame] | 795 | RegLocation GetSrcWide(MIR* mir, int low) { |
buzbee | 1fd3346 | 2013-03-25 13:40:45 -0700 | [diff] [blame] | 796 | RegLocation res = GetRawSrc(mir, low); |
| 797 | DCHECK(res.wide); |
| 798 | return res; |
| 799 | } |
| 800 | |
| 801 | RegLocation GetBadLoc() { |
| 802 | return bad_loc; |
| 803 | } |
| 804 | |
Razvan A Lupusoru | da7a69b | 2014-01-08 15:09:50 -0800 | [diff] [blame] | 805 | int GetMethodSReg() const { |
buzbee | 1fd3346 | 2013-03-25 13:40:45 -0700 | [diff] [blame] | 806 | return method_sreg_; |
| 807 | } |
| 808 | |
Razvan A Lupusoru | da7a69b | 2014-01-08 15:09:50 -0800 | [diff] [blame] | 809 | /** |
| 810 | * @brief Used to obtain the number of compiler temporaries being used. |
| 811 | * @return Returns the number of compiler temporaries. |
| 812 | */ |
| 813 | size_t GetNumUsedCompilerTemps() const { |
| 814 | size_t total_num_temps = compiler_temps_.Size(); |
| 815 | DCHECK_LE(num_non_special_compiler_temps_, total_num_temps); |
| 816 | return total_num_temps; |
| 817 | } |
| 818 | |
| 819 | /** |
| 820 | * @brief Used to obtain the number of non-special compiler temporaries being used. |
| 821 | * @return Returns the number of non-special compiler temporaries. |
| 822 | */ |
| 823 | size_t GetNumNonSpecialCompilerTemps() const { |
| 824 | return num_non_special_compiler_temps_; |
| 825 | } |
| 826 | |
| 827 | /** |
| 828 | * @brief Used to set the total number of available non-special compiler temporaries. |
| 829 | * @details Can fail setting the new max if there are more temps being used than the new_max. |
| 830 | * @param new_max The new maximum number of non-special compiler temporaries. |
| 831 | * @return Returns true if the max was set and false if failed to set. |
| 832 | */ |
| 833 | bool SetMaxAvailableNonSpecialCompilerTemps(size_t new_max) { |
| 834 | if (new_max < GetNumNonSpecialCompilerTemps()) { |
| 835 | return false; |
| 836 | } else { |
| 837 | max_available_non_special_compiler_temps_ = new_max; |
| 838 | return true; |
| 839 | } |
| 840 | } |
| 841 | |
| 842 | /** |
| 843 | * @brief Provides the number of non-special compiler temps available. |
| 844 | * @details Even if this returns zero, special compiler temps are guaranteed to be available. |
| 845 | * @return Returns the number of available temps. |
| 846 | */ |
| 847 | size_t GetNumAvailableNonSpecialCompilerTemps(); |
| 848 | |
| 849 | /** |
| 850 | * @brief Used to obtain an existing compiler temporary. |
| 851 | * @param index The index of the temporary which must be strictly less than the |
| 852 | * number of temporaries. |
| 853 | * @return Returns the temporary that was asked for. |
| 854 | */ |
| 855 | CompilerTemp* GetCompilerTemp(size_t index) const { |
| 856 | return compiler_temps_.Get(index); |
| 857 | } |
| 858 | |
| 859 | /** |
| 860 | * @brief Used to obtain the maximum number of compiler temporaries that can be requested. |
| 861 | * @return Returns the maximum number of compiler temporaries, whether used or not. |
| 862 | */ |
| 863 | size_t GetMaxPossibleCompilerTemps() const { |
| 864 | return max_available_special_compiler_temps_ + max_available_non_special_compiler_temps_; |
| 865 | } |
| 866 | |
| 867 | /** |
| 868 | * @brief Used to obtain a new unique compiler temporary. |
| 869 | * @param ct_type Type of compiler temporary requested. |
| 870 | * @param wide Whether we should allocate a wide temporary. |
| 871 | * @return Returns the newly created compiler temporary. |
| 872 | */ |
| 873 | CompilerTemp* GetNewCompilerTemp(CompilerTempType ct_type, bool wide); |
| 874 | |
buzbee | 1fd3346 | 2013-03-25 13:40:45 -0700 | [diff] [blame] | 875 | bool MethodIsLeaf() { |
| 876 | return attributes_ & METHOD_IS_LEAF; |
| 877 | } |
| 878 | |
| 879 | RegLocation GetRegLocation(int index) { |
Mark Mendell | 67c39c4 | 2014-01-31 17:28:00 -0800 | [diff] [blame] | 880 | DCHECK((index >= 0) && (index < num_ssa_regs_)); |
buzbee | 1fd3346 | 2013-03-25 13:40:45 -0700 | [diff] [blame] | 881 | return reg_location_[index]; |
| 882 | } |
| 883 | |
| 884 | RegLocation GetMethodLoc() { |
| 885 | return reg_location_[method_sreg_]; |
| 886 | } |
| 887 | |
buzbee | 0d82948 | 2013-10-11 15:24:55 -0700 | [diff] [blame] | 888 | bool IsBackedge(BasicBlock* branch_bb, BasicBlockId target_bb_id) { |
| 889 | return ((target_bb_id != NullBasicBlockId) && |
| 890 | (GetBasicBlock(target_bb_id)->start_offset <= branch_bb->start_offset)); |
buzbee | 9329e6d | 2013-08-19 12:55:10 -0700 | [diff] [blame] | 891 | } |
| 892 | |
| 893 | bool IsBackwardsBranch(BasicBlock* branch_bb) { |
| 894 | return IsBackedge(branch_bb, branch_bb->taken) || IsBackedge(branch_bb, branch_bb->fall_through); |
| 895 | } |
| 896 | |
buzbee | 0d82948 | 2013-10-11 15:24:55 -0700 | [diff] [blame] | 897 | void CountBranch(DexOffset target_offset) { |
buzbee | b48819d | 2013-09-14 16:15:25 -0700 | [diff] [blame] | 898 | if (target_offset <= current_offset_) { |
| 899 | backward_branches_++; |
| 900 | } else { |
| 901 | forward_branches_++; |
| 902 | } |
| 903 | } |
| 904 | |
| 905 | int GetBranchCount() { |
| 906 | return backward_branches_ + forward_branches_; |
| 907 | } |
| 908 | |
buzbee | 35ba7f3 | 2014-05-31 08:59:01 -0700 | [diff] [blame] | 909 | static bool IsPseudoMirOp(Instruction::Code opcode) { |
buzbee | b48819d | 2013-09-14 16:15:25 -0700 | [diff] [blame] | 910 | return static_cast<int>(opcode) >= static_cast<int>(kMirOpFirst); |
| 911 | } |
| 912 | |
buzbee | 35ba7f3 | 2014-05-31 08:59:01 -0700 | [diff] [blame] | 913 | static bool IsPseudoMirOp(int opcode) { |
buzbee | b48819d | 2013-09-14 16:15:25 -0700 | [diff] [blame] | 914 | return opcode >= static_cast<int>(kMirOpFirst); |
| 915 | } |
| 916 | |
buzbee | b1f1d64 | 2014-02-27 12:55:32 -0800 | [diff] [blame] | 917 | // Is this vreg in the in set? |
| 918 | bool IsInVReg(int vreg) { |
| 919 | return (vreg >= cu_->num_regs); |
| 920 | } |
| 921 | |
Ian Rogers | 71fe267 | 2013-03-19 20:45:02 -0700 | [diff] [blame] | 922 | void DumpCheckStats(); |
Ian Rogers | 71fe267 | 2013-03-19 20:45:02 -0700 | [diff] [blame] | 923 | MIR* FindMoveResult(BasicBlock* bb, MIR* mir); |
| 924 | int SRegToVReg(int ssa_reg) const; |
| 925 | void VerifyDataflow(); |
Ian Rogers | 71fe267 | 2013-03-19 20:45:02 -0700 | [diff] [blame] | 926 | void CheckForDominanceFrontier(BasicBlock* dom_bb, const BasicBlock* succ_bb); |
Vladimir Marko | bfea9c2 | 2014-01-17 17:49:33 +0000 | [diff] [blame] | 927 | void EliminateNullChecksAndInferTypesStart(); |
Jean Christophe Beyler | 2469e60 | 2014-05-06 20:36:55 -0700 | [diff] [blame] | 928 | bool EliminateNullChecksAndInferTypes(BasicBlock* bb); |
Vladimir Marko | bfea9c2 | 2014-01-17 17:49:33 +0000 | [diff] [blame] | 929 | void EliminateNullChecksAndInferTypesEnd(); |
| 930 | bool EliminateClassInitChecksGate(); |
| 931 | bool EliminateClassInitChecks(BasicBlock* bb); |
| 932 | void EliminateClassInitChecksEnd(); |
buzbee | 28c2300 | 2013-09-07 09:12:27 -0700 | [diff] [blame] | 933 | /* |
| 934 | * Type inference handling helpers. Because Dalvik's bytecode is not fully typed, |
| 935 | * we have to do some work to figure out the sreg type. For some operations it is |
| 936 | * clear based on the opcode (i.e. ADD_FLOAT v0, v1, v2), but for others (MOVE), we |
| 937 | * may never know the "real" type. |
| 938 | * |
| 939 | * We perform the type inference operation by using an iterative walk over |
| 940 | * the graph, propagating types "defined" by typed opcodes to uses and defs in |
| 941 | * non-typed opcodes (such as MOVE). The Setxx(index) helpers are used to set defined |
| 942 | * types on typed opcodes (such as ADD_INT). The Setxx(index, is_xx) form is used to |
| 943 | * propagate types through non-typed opcodes such as PHI and MOVE. The is_xx flag |
| 944 | * tells whether our guess of the type is based on a previously typed definition. |
| 945 | * If so, the defined type takes precedence. Note that it's possible to have the same sreg |
| 946 | * show multiple defined types because dx treats constants as untyped bit patterns. |
| 947 | * The return value of the Setxx() helpers says whether or not the Setxx() action changed |
| 948 | * the current guess, and is used to know when to terminate the iterative walk. |
| 949 | */ |
buzbee | 1fd3346 | 2013-03-25 13:40:45 -0700 | [diff] [blame] | 950 | bool SetFp(int index, bool is_fp); |
buzbee | 28c2300 | 2013-09-07 09:12:27 -0700 | [diff] [blame] | 951 | bool SetFp(int index); |
buzbee | 1fd3346 | 2013-03-25 13:40:45 -0700 | [diff] [blame] | 952 | bool SetCore(int index, bool is_core); |
buzbee | 28c2300 | 2013-09-07 09:12:27 -0700 | [diff] [blame] | 953 | bool SetCore(int index); |
buzbee | 1fd3346 | 2013-03-25 13:40:45 -0700 | [diff] [blame] | 954 | bool SetRef(int index, bool is_ref); |
buzbee | 28c2300 | 2013-09-07 09:12:27 -0700 | [diff] [blame] | 955 | bool SetRef(int index); |
buzbee | 1fd3346 | 2013-03-25 13:40:45 -0700 | [diff] [blame] | 956 | bool SetWide(int index, bool is_wide); |
buzbee | 28c2300 | 2013-09-07 09:12:27 -0700 | [diff] [blame] | 957 | bool SetWide(int index); |
buzbee | 1fd3346 | 2013-03-25 13:40:45 -0700 | [diff] [blame] | 958 | bool SetHigh(int index, bool is_high); |
buzbee | 28c2300 | 2013-09-07 09:12:27 -0700 | [diff] [blame] | 959 | bool SetHigh(int index); |
| 960 | |
buzbee | 1fd3346 | 2013-03-25 13:40:45 -0700 | [diff] [blame] | 961 | char* GetDalvikDisassembly(const MIR* mir); |
buzbee | 1fd3346 | 2013-03-25 13:40:45 -0700 | [diff] [blame] | 962 | void ReplaceSpecialChars(std::string& str); |
| 963 | std::string GetSSAName(int ssa_reg); |
| 964 | std::string GetSSANameWithConst(int ssa_reg, bool singles_only); |
| 965 | void GetBlockName(BasicBlock* bb, char* name); |
| 966 | const char* GetShortyFromTargetIdx(int); |
| 967 | void DumpMIRGraph(); |
| 968 | CallInfo* NewMemCallInfo(BasicBlock* bb, MIR* mir, InvokeType type, bool is_range); |
buzbee | 862a760 | 2013-04-05 10:58:54 -0700 | [diff] [blame] | 969 | BasicBlock* NewMemBB(BBType block_type, int block_id); |
Jean Christophe Beyler | 3aa5773 | 2014-04-17 12:47:24 -0700 | [diff] [blame] | 970 | MIR* NewMIR(); |
buzbee | 0d82948 | 2013-10-11 15:24:55 -0700 | [diff] [blame] | 971 | MIR* AdvanceMIR(BasicBlock** p_bb, MIR* mir); |
| 972 | BasicBlock* NextDominatedBlock(BasicBlock* bb); |
| 973 | bool LayoutBlocks(BasicBlock* bb); |
Jean Christophe Beyler | 44e5bde | 2014-04-29 14:40:41 -0700 | [diff] [blame] | 974 | void ComputeTopologicalSortOrder(); |
Jean Christophe Beyler | 8512758 | 2014-05-11 23:36:41 -0700 | [diff] [blame] | 975 | BasicBlock* CreateNewBB(BBType block_type); |
buzbee | 311ca16 | 2013-02-28 15:56:43 -0800 | [diff] [blame] | 976 | |
Vladimir Marko | 9820b7c | 2014-01-02 16:40:37 +0000 | [diff] [blame] | 977 | bool InlineCallsGate(); |
| 978 | void InlineCallsStart(); |
| 979 | void InlineCalls(BasicBlock* bb); |
| 980 | void InlineCallsEnd(); |
| 981 | |
Jean Christophe Beyler | 4e97c53 | 2014-01-07 10:07:18 -0800 | [diff] [blame] | 982 | /** |
| 983 | * @brief Perform the initial preparation for the Method Uses. |
| 984 | */ |
| 985 | void InitializeMethodUses(); |
| 986 | |
| 987 | /** |
| 988 | * @brief Perform the initial preparation for the Constant Propagation. |
| 989 | */ |
| 990 | void InitializeConstantPropagation(); |
| 991 | |
| 992 | /** |
| 993 | * @brief Perform the initial preparation for the SSA Transformation. |
| 994 | */ |
Vladimir Marko | a5b8fde | 2014-05-23 15:16:44 +0100 | [diff] [blame] | 995 | void SSATransformationStart(); |
Jean Christophe Beyler | 4e97c53 | 2014-01-07 10:07:18 -0800 | [diff] [blame] | 996 | |
| 997 | /** |
| 998 | * @brief Insert a the operands for the Phi nodes. |
| 999 | * @param bb the considered BasicBlock. |
| 1000 | * @return true |
| 1001 | */ |
| 1002 | bool InsertPhiNodeOperands(BasicBlock* bb); |
| 1003 | |
| 1004 | /** |
Vladimir Marko | a5b8fde | 2014-05-23 15:16:44 +0100 | [diff] [blame] | 1005 | * @brief Perform the cleanup after the SSA Transformation. |
| 1006 | */ |
| 1007 | void SSATransformationEnd(); |
| 1008 | |
| 1009 | /** |
Jean Christophe Beyler | 4e97c53 | 2014-01-07 10:07:18 -0800 | [diff] [blame] | 1010 | * @brief Perform constant propagation on a BasicBlock. |
| 1011 | * @param bb the considered BasicBlock. |
| 1012 | */ |
| 1013 | void DoConstantPropagation(BasicBlock* bb); |
| 1014 | |
| 1015 | /** |
| 1016 | * @brief Count the uses in the BasicBlock |
| 1017 | * @param bb the BasicBlock |
| 1018 | */ |
| 1019 | void CountUses(struct BasicBlock* bb); |
| 1020 | |
Jean Christophe Beyler | cc794c3 | 2014-05-02 09:34:13 -0700 | [diff] [blame] | 1021 | static uint64_t GetDataFlowAttributes(Instruction::Code opcode); |
| 1022 | static uint64_t GetDataFlowAttributes(MIR* mir); |
| 1023 | |
Jean Christophe Beyler | 4e97c53 | 2014-01-07 10:07:18 -0800 | [diff] [blame] | 1024 | /** |
Jean Christophe Beyler | 4e97c53 | 2014-01-07 10:07:18 -0800 | [diff] [blame] | 1025 | * @brief Combine BasicBlocks |
| 1026 | * @param the BasicBlock we are considering |
| 1027 | */ |
| 1028 | void CombineBlocks(BasicBlock* bb); |
| 1029 | |
| 1030 | void ClearAllVisitedFlags(); |
Jean Christophe Beyler | 4896d7b | 2014-05-01 15:36:22 -0700 | [diff] [blame] | 1031 | |
| 1032 | void AllocateSSAUseData(MIR *mir, int num_uses); |
| 1033 | void AllocateSSADefData(MIR *mir, int num_defs); |
Jean Christophe Beyler | 2469e60 | 2014-05-06 20:36:55 -0700 | [diff] [blame] | 1034 | void CalculateBasicBlockInformation(); |
| 1035 | void InitializeBasicBlockData(); |
| 1036 | void ComputeDFSOrders(); |
| 1037 | void ComputeDefBlockMatrix(); |
| 1038 | void ComputeDominators(); |
| 1039 | void CompilerInitializeSSAConversion(); |
| 1040 | void InsertPhiNodes(); |
| 1041 | void DoDFSPreOrderSSARename(BasicBlock* block); |
Jean Christophe Beyler | 4896d7b | 2014-05-01 15:36:22 -0700 | [diff] [blame] | 1042 | |
Ian Rogers | 71fe267 | 2013-03-19 20:45:02 -0700 | [diff] [blame] | 1043 | /* |
| 1044 | * IsDebugBuild sanity check: keep track of the Dex PCs for catch entries so that later on |
| 1045 | * we can verify that all catch entries have native PC entries. |
| 1046 | */ |
Brian Carlstrom | 6f485c6 | 2013-07-18 15:35:35 -0700 | [diff] [blame] | 1047 | std::set<uint32_t> catches_; |
buzbee | 311ca16 | 2013-02-28 15:56:43 -0800 | [diff] [blame] | 1048 | |
Brian Carlstrom | 6f485c6 | 2013-07-18 15:35:35 -0700 | [diff] [blame] | 1049 | // TODO: make these private. |
| 1050 | RegLocation* reg_location_; // Map SSA names to location. |
Brian Carlstrom | 6f485c6 | 2013-07-18 15:35:35 -0700 | [diff] [blame] | 1051 | SafeMap<unsigned int, unsigned int> block_id_map_; // Block collapse lookup cache. |
buzbee | 1fd3346 | 2013-03-25 13:40:45 -0700 | [diff] [blame] | 1052 | |
Brian Carlstrom | 6f485c6 | 2013-07-18 15:35:35 -0700 | [diff] [blame] | 1053 | static const char* extended_mir_op_names_[kMirOpLast - kMirOpFirst]; |
buzbee | ee17e0a | 2013-07-31 10:47:37 -0700 | [diff] [blame] | 1054 | static const uint32_t analysis_attributes_[kMirOpLast]; |
buzbee | 1fd3346 | 2013-03-25 13:40:45 -0700 | [diff] [blame] | 1055 | |
Mark Mendell | e87f9b5 | 2014-04-30 14:13:18 -0400 | [diff] [blame] | 1056 | void HandleSSADef(int* defs, int dalvik_reg, int reg_index); |
| 1057 | bool InferTypeAndSize(BasicBlock* bb, MIR* mir, bool changed); |
Mark Mendell | e87f9b5 | 2014-04-30 14:13:18 -0400 | [diff] [blame] | 1058 | |
Wei Jin | 04f4d8a | 2014-05-29 18:04:29 -0700 | [diff] [blame] | 1059 | // Used for removing redudant suspend tests |
| 1060 | void AppendGenSuspendTestList(BasicBlock* bb) { |
| 1061 | if (gen_suspend_test_list_.Size() == 0 || |
| 1062 | gen_suspend_test_list_.Get(gen_suspend_test_list_.Size() - 1) != bb) { |
| 1063 | gen_suspend_test_list_.Insert(bb); |
| 1064 | } |
| 1065 | } |
| 1066 | |
| 1067 | /* This is used to check if there is already a method call dominating the |
| 1068 | * source basic block of a backedge and being dominated by the target basic |
| 1069 | * block of the backedge. |
| 1070 | */ |
| 1071 | bool HasSuspendTestBetween(BasicBlock* source, BasicBlockId target_id); |
| 1072 | |
Mark Mendell | e87f9b5 | 2014-04-30 14:13:18 -0400 | [diff] [blame] | 1073 | protected: |
Brian Carlstrom | 6f485c6 | 2013-07-18 15:35:35 -0700 | [diff] [blame] | 1074 | int FindCommonParent(int block1, int block2); |
| 1075 | void ComputeSuccLineIn(ArenaBitVector* dest, const ArenaBitVector* src1, |
| 1076 | const ArenaBitVector* src2); |
| 1077 | void HandleLiveInUse(ArenaBitVector* use_v, ArenaBitVector* def_v, |
| 1078 | ArenaBitVector* live_in_v, int dalvik_reg_id); |
| 1079 | void HandleDef(ArenaBitVector* def_v, int dalvik_reg_id); |
Brian Carlstrom | 6f485c6 | 2013-07-18 15:35:35 -0700 | [diff] [blame] | 1080 | bool DoSSAConversion(BasicBlock* bb); |
| 1081 | bool InvokeUsesMethodStar(MIR* mir); |
Ian Rogers | 29a2648 | 2014-05-02 15:27:29 -0700 | [diff] [blame] | 1082 | int ParseInsn(const uint16_t* code_ptr, MIR::DecodedInstruction* decoded_instruction); |
Brian Carlstrom | 6f485c6 | 2013-07-18 15:35:35 -0700 | [diff] [blame] | 1083 | bool ContentIsInsn(const uint16_t* code_ptr); |
buzbee | 0d82948 | 2013-10-11 15:24:55 -0700 | [diff] [blame] | 1084 | BasicBlock* SplitBlock(DexOffset code_offset, BasicBlock* orig_block, |
Ian Rogers | 71fe267 | 2013-03-19 20:45:02 -0700 | [diff] [blame] | 1085 | BasicBlock** immed_pred_block_p); |
buzbee | 0d82948 | 2013-10-11 15:24:55 -0700 | [diff] [blame] | 1086 | BasicBlock* FindBlock(DexOffset code_offset, bool split, bool create, |
Brian Carlstrom | 6f485c6 | 2013-07-18 15:35:35 -0700 | [diff] [blame] | 1087 | BasicBlock** immed_pred_block_p); |
| 1088 | void ProcessTryCatchBlocks(); |
buzbee | 0d82948 | 2013-10-11 15:24:55 -0700 | [diff] [blame] | 1089 | BasicBlock* ProcessCanBranch(BasicBlock* cur_block, MIR* insn, DexOffset cur_offset, int width, |
Brian Carlstrom | 6f485c6 | 2013-07-18 15:35:35 -0700 | [diff] [blame] | 1090 | int flags, const uint16_t* code_ptr, const uint16_t* code_end); |
buzbee | 17189ac | 2013-11-08 11:07:02 -0800 | [diff] [blame] | 1091 | BasicBlock* ProcessCanSwitch(BasicBlock* cur_block, MIR* insn, DexOffset cur_offset, int width, |
| 1092 | int flags); |
buzbee | 0d82948 | 2013-10-11 15:24:55 -0700 | [diff] [blame] | 1093 | BasicBlock* ProcessCanThrow(BasicBlock* cur_block, MIR* insn, DexOffset cur_offset, int width, |
Brian Carlstrom | 6f485c6 | 2013-07-18 15:35:35 -0700 | [diff] [blame] | 1094 | int flags, ArenaBitVector* try_block_addr, const uint16_t* code_ptr, |
| 1095 | const uint16_t* code_end); |
| 1096 | int AddNewSReg(int v_reg); |
| 1097 | void HandleSSAUse(int* uses, int dalvik_reg, int reg_index); |
Brian Carlstrom | 6f485c6 | 2013-07-18 15:35:35 -0700 | [diff] [blame] | 1098 | void DataFlowSSAFormat35C(MIR* mir); |
| 1099 | void DataFlowSSAFormat3RC(MIR* mir); |
| 1100 | bool FindLocalLiveIn(BasicBlock* bb); |
Brian Carlstrom | 6f485c6 | 2013-07-18 15:35:35 -0700 | [diff] [blame] | 1101 | bool VerifyPredInfo(BasicBlock* bb); |
| 1102 | BasicBlock* NeedsVisit(BasicBlock* bb); |
| 1103 | BasicBlock* NextUnvisitedSuccessor(BasicBlock* bb); |
| 1104 | void MarkPreOrder(BasicBlock* bb); |
| 1105 | void RecordDFSOrders(BasicBlock* bb); |
Brian Carlstrom | 6f485c6 | 2013-07-18 15:35:35 -0700 | [diff] [blame] | 1106 | void ComputeDomPostOrderTraversal(BasicBlock* bb); |
Brian Carlstrom | 6f485c6 | 2013-07-18 15:35:35 -0700 | [diff] [blame] | 1107 | void SetConstant(int32_t ssa_reg, int value); |
| 1108 | void SetConstantWide(int ssa_reg, int64_t value); |
| 1109 | int GetSSAUseCount(int s_reg); |
| 1110 | bool BasicBlockOpt(BasicBlock* bb); |
Brian Carlstrom | 6f485c6 | 2013-07-18 15:35:35 -0700 | [diff] [blame] | 1111 | bool BuildExtendedBBList(struct BasicBlock* bb); |
| 1112 | bool FillDefBlockMatrix(BasicBlock* bb); |
| 1113 | void InitializeDominationInfo(BasicBlock* bb); |
| 1114 | bool ComputeblockIDom(BasicBlock* bb); |
| 1115 | bool ComputeBlockDominators(BasicBlock* bb); |
| 1116 | bool SetDominators(BasicBlock* bb); |
| 1117 | bool ComputeBlockLiveIns(BasicBlock* bb); |
Brian Carlstrom | 6f485c6 | 2013-07-18 15:35:35 -0700 | [diff] [blame] | 1118 | bool ComputeDominanceFrontier(BasicBlock* bb); |
Jean Christophe Beyler | 4e97c53 | 2014-01-07 10:07:18 -0800 | [diff] [blame] | 1119 | |
Brian Carlstrom | 6f485c6 | 2013-07-18 15:35:35 -0700 | [diff] [blame] | 1120 | void CountChecks(BasicBlock* bb); |
buzbee | ee17e0a | 2013-07-31 10:47:37 -0700 | [diff] [blame] | 1121 | void AnalyzeBlock(BasicBlock* bb, struct MethodStats* stats); |
| 1122 | bool ComputeSkipCompilation(struct MethodStats* stats, bool skip_default); |
buzbee | 311ca16 | 2013-02-28 15:56:43 -0800 | [diff] [blame] | 1123 | |
Brian Carlstrom | 6f485c6 | 2013-07-18 15:35:35 -0700 | [diff] [blame] | 1124 | CompilationUnit* const cu_; |
| 1125 | GrowableArray<int>* ssa_base_vregs_; |
| 1126 | GrowableArray<int>* ssa_subscripts_; |
| 1127 | // Map original Dalvik virtual reg i to the current SSA name. |
| 1128 | int* vreg_to_ssa_map_; // length == method->registers_size |
| 1129 | int* ssa_last_defs_; // length == method->registers_size |
| 1130 | ArenaBitVector* is_constant_v_; // length == num_ssa_reg |
| 1131 | int* constant_values_; // length == num_ssa_reg |
| 1132 | // Use counts of ssa names. |
| 1133 | GrowableArray<uint32_t> use_counts_; // Weighted by nesting depth |
| 1134 | GrowableArray<uint32_t> raw_use_counts_; // Not weighted |
| 1135 | unsigned int num_reachable_blocks_; |
Jean Christophe Beyler | 4896d7b | 2014-05-01 15:36:22 -0700 | [diff] [blame] | 1136 | unsigned int max_num_reachable_blocks_; |
buzbee | 0d82948 | 2013-10-11 15:24:55 -0700 | [diff] [blame] | 1137 | GrowableArray<BasicBlockId>* dfs_order_; |
| 1138 | GrowableArray<BasicBlockId>* dfs_post_order_; |
| 1139 | GrowableArray<BasicBlockId>* dom_post_order_traversal_; |
Jean Christophe Beyler | 44e5bde | 2014-04-29 14:40:41 -0700 | [diff] [blame] | 1140 | GrowableArray<BasicBlockId>* topological_order_; |
Brian Carlstrom | 6f485c6 | 2013-07-18 15:35:35 -0700 | [diff] [blame] | 1141 | int* i_dom_list_; |
| 1142 | ArenaBitVector** def_block_matrix_; // num_dalvik_register x num_blocks. |
Ian Rogers | 700a402 | 2014-05-19 16:49:03 -0700 | [diff] [blame] | 1143 | std::unique_ptr<ScopedArenaAllocator> temp_scoped_alloc_; |
Vladimir Marko | bfea9c2 | 2014-01-17 17:49:33 +0000 | [diff] [blame] | 1144 | uint16_t* temp_insn_data_; |
| 1145 | uint32_t temp_bit_vector_size_; |
| 1146 | ArenaBitVector* temp_bit_vector_; |
Brian Carlstrom | 6f485c6 | 2013-07-18 15:35:35 -0700 | [diff] [blame] | 1147 | static const int kInvalidEntry = -1; |
| 1148 | GrowableArray<BasicBlock*> block_list_; |
| 1149 | ArenaBitVector* try_block_addr_; |
| 1150 | BasicBlock* entry_block_; |
| 1151 | BasicBlock* exit_block_; |
Andreas Gampe | 4439596 | 2014-06-13 13:44:40 -0700 | [diff] [blame^] | 1152 | unsigned int num_blocks_; |
Brian Carlstrom | 6f485c6 | 2013-07-18 15:35:35 -0700 | [diff] [blame] | 1153 | const DexFile::CodeItem* current_code_item_; |
buzbee | b48819d | 2013-09-14 16:15:25 -0700 | [diff] [blame] | 1154 | GrowableArray<uint16_t> dex_pc_to_block_map_; // FindBlock lookup cache. |
Brian Carlstrom | 6f485c6 | 2013-07-18 15:35:35 -0700 | [diff] [blame] | 1155 | std::vector<DexCompilationUnit*> m_units_; // List of methods included in this graph |
| 1156 | typedef std::pair<int, int> MIRLocation; // Insert point, (m_unit_ index, offset) |
| 1157 | std::vector<MIRLocation> method_stack_; // Include stack |
| 1158 | int current_method_; |
buzbee | 0d82948 | 2013-10-11 15:24:55 -0700 | [diff] [blame] | 1159 | DexOffset current_offset_; // Offset in code units |
Brian Carlstrom | 6f485c6 | 2013-07-18 15:35:35 -0700 | [diff] [blame] | 1160 | int def_count_; // Used to estimate size of ssa name storage. |
| 1161 | int* opcode_count_; // Dex opcode coverage stats. |
| 1162 | int num_ssa_regs_; // Number of names following SSA transformation. |
buzbee | 0d82948 | 2013-10-11 15:24:55 -0700 | [diff] [blame] | 1163 | std::vector<BasicBlockId> extended_basic_blocks_; // Heads of block "traces". |
Brian Carlstrom | 6f485c6 | 2013-07-18 15:35:35 -0700 | [diff] [blame] | 1164 | int method_sreg_; |
| 1165 | unsigned int attributes_; |
| 1166 | Checkstats* checkstats_; |
| 1167 | ArenaAllocator* arena_; |
buzbee | b48819d | 2013-09-14 16:15:25 -0700 | [diff] [blame] | 1168 | int backward_branches_; |
| 1169 | int forward_branches_; |
Razvan A Lupusoru | da7a69b | 2014-01-08 15:09:50 -0800 | [diff] [blame] | 1170 | GrowableArray<CompilerTemp*> compiler_temps_; |
| 1171 | size_t num_non_special_compiler_temps_; |
| 1172 | size_t max_available_non_special_compiler_temps_; |
| 1173 | size_t max_available_special_compiler_temps_; |
buzbee | b1f1d64 | 2014-02-27 12:55:32 -0800 | [diff] [blame] | 1174 | bool punt_to_interpreter_; // Difficult or not worthwhile - just interpret. |
Vladimir Marko | 3d73ba2 | 2014-03-06 15:18:04 +0000 | [diff] [blame] | 1175 | uint64_t merged_df_flags_; |
Vladimir Marko | be0e546 | 2014-02-26 11:24:15 +0000 | [diff] [blame] | 1176 | GrowableArray<MirIFieldLoweringInfo> ifield_lowering_infos_; |
| 1177 | GrowableArray<MirSFieldLoweringInfo> sfield_lowering_infos_; |
Vladimir Marko | f096aad | 2014-01-23 15:51:58 +0000 | [diff] [blame] | 1178 | GrowableArray<MirMethodLoweringInfo> method_lowering_infos_; |
Jean Christophe Beyler | cc794c3 | 2014-05-02 09:34:13 -0700 | [diff] [blame] | 1179 | static const uint64_t oat_data_flow_attributes_[kMirOpLast]; |
Wei Jin | 04f4d8a | 2014-05-29 18:04:29 -0700 | [diff] [blame] | 1180 | GrowableArray<BasicBlock*> gen_suspend_test_list_; // List of blocks containing suspend tests |
Vladimir Marko | f59f18b | 2014-02-17 15:53:57 +0000 | [diff] [blame] | 1181 | |
Vladimir Marko | bfea9c2 | 2014-01-17 17:49:33 +0000 | [diff] [blame] | 1182 | friend class ClassInitCheckEliminationTest; |
Vladimir Marko | f59f18b | 2014-02-17 15:53:57 +0000 | [diff] [blame] | 1183 | friend class LocalValueNumberingTest; |
buzbee | 311ca16 | 2013-02-28 15:56:43 -0800 | [diff] [blame] | 1184 | }; |
| 1185 | |
| 1186 | } // namespace art |
| 1187 | |
Brian Carlstrom | fc0e321 | 2013-07-17 14:40:12 -0700 | [diff] [blame] | 1188 | #endif // ART_COMPILER_DEX_MIR_GRAPH_H_ |