| /* |
| * Copyright (C) 2011 The Android Open Source Project |
| * |
| * Licensed under the Apache License, Version 2.0 (the "License"); |
| * you may not use this file except in compliance with the License. |
| * You may obtain a copy of the License at |
| * |
| * http://www.apache.org/licenses/LICENSE-2.0 |
| * |
| * Unless required by applicable law or agreed to in writing, software |
| * distributed under the License is distributed on an "AS IS" BASIS, |
| * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. |
| * See the License for the specific language governing permissions and |
| * limitations under the License. |
| */ |
| |
| #ifndef ART_SRC_COMPILER_DATAFLOW_H_ |
| #define ART_SRC_COMPILER_DATAFLOW_H_ |
| |
| #include "compiler_internals.h" |
| |
| namespace art { |
| |
| enum DataFlowAttributePos { |
| kUA = 0, |
| kUB, |
| kUC, |
| kAWide, |
| kBWide, |
| kCWide, |
| kDA, |
| kIsMove, |
| kSetsConst, |
| kFormat35c, |
| kFormat3rc, |
| kNullCheckSrc0, // Null check of uses[0]. |
| kNullCheckSrc1, // Null check of uses[1]. |
| kNullCheckSrc2, // Null check of uses[2]. |
| kNullCheckOut0, // Null check out outgoing arg0. |
| kDstNonNull, // May assume dst is non-null. |
| kRetNonNull, // May assume retval is non-null. |
| kNullTransferSrc0, // Object copy src[0] -> dst. |
| kNullTransferSrcN, // Phi null check state transfer. |
| kRangeCheckSrc1, // Range check of uses[1]. |
| kRangeCheckSrc2, // Range check of uses[2]. |
| kRangeCheckSrc3, // Range check of uses[3]. |
| kFPA, |
| kFPB, |
| kFPC, |
| kCoreA, |
| kCoreB, |
| kCoreC, |
| kRefA, |
| kRefB, |
| kRefC, |
| kUsesMethodStar, // Implicit use of Method*. |
| }; |
| |
| #define DF_NOP 0 |
| #define DF_UA (1 << kUA) |
| #define DF_UB (1 << kUB) |
| #define DF_UC (1 << kUC) |
| #define DF_A_WIDE (1 << kAWide) |
| #define DF_B_WIDE (1 << kBWide) |
| #define DF_C_WIDE (1 << kCWide) |
| #define DF_DA (1 << kDA) |
| #define DF_IS_MOVE (1 << kIsMove) |
| #define DF_SETS_CONST (1 << kSetsConst) |
| #define DF_FORMAT_35C (1 << kFormat35c) |
| #define DF_FORMAT_3RC (1 << kFormat3rc) |
| #define DF_NULL_CHK_0 (1 << kNullCheckSrc0) |
| #define DF_NULL_CHK_1 (1 << kNullCheckSrc1) |
| #define DF_NULL_CHK_2 (1 << kNullCheckSrc2) |
| #define DF_NULL_CHK_OUT0 (1 << kNullCheckOut0) |
| #define DF_NON_NULL_DST (1 << kDstNonNull) |
| #define DF_NON_NULL_RET (1 << kRetNonNull) |
| #define DF_NULL_TRANSFER_0 (1 << kNullTransferSrc0) |
| #define DF_NULL_TRANSFER_N (1 << kNullTransferSrcN) |
| #define DF_RANGE_CHK_1 (1 << kRangeCheckSrc1) |
| #define DF_RANGE_CHK_2 (1 << kRangeCheckSrc2) |
| #define DF_RANGE_CHK_3 (1 << kRangeCheckSrc3) |
| #define DF_FP_A (1 << kFPA) |
| #define DF_FP_B (1 << kFPB) |
| #define DF_FP_C (1 << kFPC) |
| #define DF_CORE_A (1 << kCoreA) |
| #define DF_CORE_B (1 << kCoreB) |
| #define DF_CORE_C (1 << kCoreC) |
| #define DF_REF_A (1 << kRefA) |
| #define DF_REF_B (1 << kRefB) |
| #define DF_REF_C (1 << kRefC) |
| #define DF_UMS (1 << kUsesMethodStar) |
| |
| #define DF_HAS_USES (DF_UA | DF_UB | DF_UC) |
| |
| #define DF_HAS_DEFS (DF_DA) |
| |
| #define DF_HAS_NULL_CHKS (DF_NULL_CHK_0 | \ |
| DF_NULL_CHK_1 | \ |
| DF_NULL_CHK_2 | \ |
| DF_NULL_CHK_OUT0) |
| |
| #define DF_HAS_RANGE_CHKS (DF_RANGE_CHK_1 | \ |
| DF_RANGE_CHK_2 | \ |
| DF_RANGE_CHK_3) |
| |
| #define DF_HAS_NR_CHKS (DF_HAS_NULL_CHKS | \ |
| DF_HAS_RANGE_CHKS) |
| |
| #define DF_A_IS_REG (DF_UA | DF_DA) |
| #define DF_B_IS_REG (DF_UB) |
| #define DF_C_IS_REG (DF_UC) |
| #define DF_IS_GETTER_OR_SETTER (DF_IS_GETTER | DF_IS_SETTER) |
| #define DF_USES_FP (DF_FP_A | DF_FP_B | DF_FP_C) |
| |
| extern const int oat_data_flow_attributes[kMirOpLast]; |
| |
| struct BasicBlockDataFlow { |
| ArenaBitVector* use_v; |
| ArenaBitVector* def_v; |
| ArenaBitVector* live_in_v; |
| ArenaBitVector* phi_v; |
| int* vreg_to_ssa_map; |
| ArenaBitVector* ending_null_check_v; |
| }; |
| |
| struct SSARepresentation { |
| int num_uses; |
| int* uses; |
| bool* fp_use; |
| int num_defs; |
| int* defs; |
| bool* fp_def; |
| }; |
| |
| /* |
| * An induction variable is represented by "m*i + c", where i is a basic |
| * induction variable. |
| */ |
| struct InductionVariableInfo { |
| int ssa_reg; |
| int basic_ssa_reg; |
| int m; // multiplier |
| int c; // constant |
| int inc; // loop increment |
| }; |
| |
| struct ArrayAccessInfo { |
| int array_reg; |
| int iv_reg; |
| int max_c; // For DIV - will affect upper bound checking. |
| int min_c; // For DIV - will affect lower bound checking. |
| }; |
| |
| struct LoopInfo { |
| BasicBlock* header; |
| GrowableList incoming_back_edges; |
| ArenaBitVector* blocks; |
| }; |
| |
| int SRegToVReg(const CompilationUnit* cu, int ssa_reg); |
| char* GetDalvikDisassembly(CompilationUnit* cu, const MIR* mir); |
| bool FindLocalLiveIn(CompilationUnit* cu, BasicBlock* bb); |
| bool DoSSAConversion(CompilationUnit* cu, BasicBlock* bb); |
| bool DoConstantPropogation(CompilationUnit* cu, BasicBlock* bb); |
| void CompilerInitializeSSAConversion(CompilationUnit* cu); |
| bool ClearVisitedFlag(struct CompilationUnit* cu, struct BasicBlock* bb); |
| void DataFlowAnalysisDispatcher(CompilationUnit* cu, bool (*func)(CompilationUnit*, BasicBlock*), |
| DataFlowAnalysisMode dfa_mode, bool is_iterative); |
| MIR* FindMoveResult(CompilationUnit* cu, BasicBlock* bb, MIR* mir); |
| void NullCheckElimination(CompilationUnit *cu); |
| void BasicBlockCombine(CompilationUnit* cu); |
| void CodeLayout(CompilationUnit* cu); |
| void DumpCheckStats(CompilationUnit *cu); |
| void BasicBlockOptimization(CompilationUnit *cu); |
| void LoopDetection(CompilationUnit *cu); |
| void MethodUseCount(CompilationUnit *cu); |
| |
| } // namespace art |
| |
| #endif // ART_SRC_COMPILER_DATAFLOW_H_ |