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