HomeSort by relevance Sort by last modified time
    Searched refs:mir_graph_ (Results 1 - 25 of 29) sorted by null

1 2

  /art/compiler/dex/
dataflow_iterator-inl.h 32 res = mir_graph_->GetBasicBlock(bb_id);
55 res = mir_graph_->GetBasicBlock(bb_id);
70 res = mir_graph_->GetBasicBlock(bb_id);
93 res = mir_graph_->GetBasicBlock(bb_id);
127 BasicBlock* bb = mir_graph_->GetBasicBlock(block_id_list_->Get(idx_ - 1));
131 ChildBlockIterator iter(bb, mir_graph_);
147 BasicBlock* loop_head = mir_graph_->GetBasicBlock(block_id_list_->Get(loop_head_idx));
163 BasicBlock* bb = mir_graph_->GetBasicBlock(block_id_list_->Get(idx));
global_value_numbering.cc 25 mir_graph_(cu->mir_graph.get()),
28 max_bbs_to_process_(kMaxBbsToProcessMultiplyFactor * mir_graph_->GetNumReachableBlocks()),
37 lvns_(mir_graph_->GetNumBlocks(), nullptr, allocator->Adapter()),
89 if (mir_graph_->GetTopologicalSortOrderLoopHeadStack()->Size() != 0) {
91 auto top = mir_graph_->GetTopologicalSortOrderLoopHeadStack()->Peek();
95 loop_head_idx != mir_graph_->GetTopologicalSortOrderIndexes()->Get(bb->id);
98 for (BasicBlock* pred_bb = mir_graph_->GetBasicBlock(iter.Next());
99 pred_bb != nullptr; pred_bb = mir_graph_->GetBasicBlock(iter.Next())) {
102 mir_graph_->GetTopologicalSortOrderIndexes()->Get(pred_bb->id) < loop_head_idx)) {
126 BasicBlock* pred_bb = mir_graph_->GetBasicBlock(merge_lvns_[0]->Id())
    [all...]
dataflow_iterator.h 72 : mir_graph_(mir_graph),
104 MIRGraph* const mir_graph_; /**< @brief the MIRGraph */ member in class:art::DataflowIterator
413 loop_head_stack_(mir_graph_->GetTopologicalSortOrderLoopHeadStack()) {
global_value_numbering.h 188 return mir_graph_->GetBasicBlock(bb_id);
200 return mir_graph_;
208 MIRGraph* mir_graph_; member in class:art::GlobalValueNumbering
mir_graph.cc     [all...]
  /art/compiler/dex/quick/
mir_to_lir.cc 336 return_mir = bb->GetNextUnconditionalMir(mir_graph_, mir);
345 return_mir = bb->GetNextUnconditionalMir(mir_graph_, mir);
349 return_mir = bb->GetNextUnconditionalMir(mir_graph_, mir);
358 mir_graph_->catches_.clear();
391 RegLocation rl_dest = mir_graph_->GetBadLoc();
392 RegLocation rl_result = mir_graph_->GetBadLoc();
404 rl_src[0] = rl_src[1] = rl_src[2] = mir_graph_->GetBadLoc();
407 rl_src[next_loc++] = mir_graph_->GetSrcWide(mir, next_sreg);
410 rl_src[next_loc++] = mir_graph_->GetSrc(mir, next_sreg);
416 rl_src[next_loc++] = mir_graph_->GetSrcWide(mir, next_sreg)
    [all...]
gen_loadstore.cc 49 int base_vreg = mir_graph_->SRegToVReg(rl_dest.s_reg_low);
50 for (int i = 0; !used_as_reference && (i < mir_graph_->GetNumSSARegs()); i++) {
51 if (mir_graph_->SRegToVReg(mir_graph_->reg_location_[i].s_reg_low) == base_vreg) {
52 used_as_reference |= mir_graph_->reg_location_[i].ref;
89 DCHECK(!rl_src.ref || (mir_graph_->ConstantValue(rl_src) == 0));
90 LoadConstantNoClobber(r_dest, mir_graph_->ConstantValue(rl_src));
124 LoadConstantWide(r_dest, mir_graph_->ConstantValueWide(rl_src));
305 DCHECK_EQ((mir_graph_->SRegToVReg(rl_dest.s_reg_low)+1),
306 mir_graph_->SRegToVReg(GetSRegHi(rl_dest.s_reg_low)))
    [all...]
ralloc_util.cc 252 DCHECK_LT(s_reg, mir_graph_->GetNumSSARegs());
254 int v_reg = mir_graph_->SRegToVReg(s_reg);
266 DCHECK_LT(position, mir_graph_->GetNumUsedCompilerTemps());
274 int v_reg = mir_graph_->SRegToVReg(s_reg);
308 int v_reg = mir_graph_->SRegToVReg(s_reg);
758 if (mir_graph_->SRegToVReg(info2->SReg()) < mir_graph_->SRegToVReg(info1->SReg())) {
761 int v_reg = mir_graph_->SRegToVReg(info1->SReg());
769 int v_reg = mir_graph_->SRegToVReg(info->SReg());
781 int v_reg = mir_graph_->SRegToVReg(info->SReg())
    [all...]
codegen_util.cc 67 res = InexpensiveConstantDouble(mir_graph_->ConstantValueWide(rl_src));
69 res = InexpensiveConstantLong(mir_graph_->ConstantValueWide(rl_src));
73 res = InexpensiveConstantFloat(mir_graph_->ConstantValue(rl_src));
75 res = InexpensiveConstantInt(mir_graph_->ConstantValue(rl_src));
277 int num_regs = cu_->num_dalvik_registers + mir_graph_->GetNumUsedCompilerTemps();
288 } else if (i == mir_graph_->GetMethodSReg()) {
327 LOG(INFO) << "CompilerTemps : " << mir_graph_->GetNumUsedCompilerTemps();
629 // Sort dex_pcs, so that we can quickly check it against the ordered mir_graph_->catches_.
634 for (uint32_t dex_pc : mir_graph_->catches_) {
649 LOG(INFO) << "Entries @ decode: " << mir_graph_->catches_.size() << ", Entries in table:
    [all...]
gen_common.cc 261 int32_t constant_value = mir_graph_->ConstantValue(rl_src2);
265 OpCmpImmBranch(cond, rl_src1.reg, mir_graph_->ConstantValue(rl_src2), taken);
533 const MirSFieldLoweringInfo& field_info = mir_graph_->GetSFieldLoweringInfo(mir);
607 if (is_object && !mir_graph_->IsConstantNullRef(rl_src)) {
622 const MirSFieldLoweringInfo& field_info = mir_graph_->GetSFieldLoweringInfo(mir);
725 const MirIFieldLoweringInfo& field_info = mir_graph_->GetIFieldLoweringInfo(mir);
772 const MirIFieldLoweringInfo& field_info = mir_graph_->GetIFieldLoweringInfo(mir);
797 if (is_object && !mir_graph_->IsConstantNullRef(rl_src)) {
    [all...]
  /art/compiler/dex/portable/
mir_to_gbc.cc 74 int v_reg = mir_graph_->SRegToVReg(s_reg);
138 BasicBlock* bb = mir_graph_->FindBlock(vaddr);
331 if (mir_graph_->GetBasicBlock(bb->taken)->start_offset <= mir->offset) {
346 if (mir_graph_->GetBasicBlock(bb->taken)->start_offset <= mir->offset) {
469 CallInfo* info = mir_graph_->NewMemCallInfo(bb, mir, invoke_type, is_range);
707 RegLocation rl_dest = mir_graph_->GetBadLoc();
718 LOG(INFO) << mir_graph_->extended_mir_op_names_[op_val - kMirOpFirst] << " 0x" << std::hex << op_val;
726 rl_src[0] = rl_src[1] = rl_src[2] = mir_graph_->GetBadLoc();
729 rl_src[next_loc++] = mir_graph_->GetSrcWide(mir, next_sreg);
732 rl_src[next_loc++] = mir_graph_->GetSrc(mir, next_sreg)
    [all...]
mir_to_gbc.h 57 mir_graph_(mir_graph),
180 MIRGraph* mir_graph_; member in class:art::MirConverter
  /art/compiler/dex/quick/x86/
call_x86.cc 42 mir_graph_->FindBlock(current_dalvik_offset_ + targets[i]);
86 RegLocation rl_method = mir_graph_->GetRegLocation(base_of_code_->s_reg_low);
160 RegLocation rl_method = mir_graph_->GetRegLocation(base_of_code_->s_reg_low);
222 bool skip_overflow_check = mir_graph_->MethodIsLeaf() && !FrameNeedsStackCheck(frame_size_, isa);
fp_x86.cc 501 rl_src1 = mir_graph_->GetSrcWide(mir, 0);
502 rl_src2 = mir_graph_->GetSrcWide(mir, 2);
507 rl_src1 = mir_graph_->GetSrc(mir, 0);
508 rl_src2 = mir_graph_->GetSrc(mir, 1);
609 int v_src_reg = mir_graph_->SRegToVReg(rl_src.s_reg_low);
610 int v_dst_reg = mir_graph_->SRegToVReg(rl_dest.s_reg_low);
660 int v_src_reg = mir_graph_->SRegToVReg(rl_src.s_reg_low);
661 int v_dst_reg = mir_graph_->SRegToVReg(rl_dest.s_reg_low);
int_x86.cc 272 RegLocation rl_src = mir_graph_->GetSrc(mir, 0);
273 RegLocation rl_dest = mir_graph_->GetDest(mir);
347 RegLocation rl_true = mir_graph_->GetSrc(mir, 1);
348 RegLocation rl_false = mir_graph_->GetSrc(mir, 2);
386 RegLocation rl_src1 = mir_graph_->GetSrcWide(mir, 0);
387 RegLocation rl_src2 = mir_graph_->GetSrcWide(mir, 2);
396 int64_t val = mir_graph_->ConstantValueWide(rl_src2);
    [all...]
utility_x86.cc 579 RegLocation rl_method = mir_graph_->GetRegLocation(base_of_code_->s_reg_low);
    [all...]
target_x86.cc     [all...]
  /art/compiler/dex/quick/arm64/
int_arm64.cc 184 RegLocation rl_src = mir_graph_->GetSrc(mir, 0);
189 RegLocation rl_dest = mir_graph_->GetDest(mir);
198 RegLocation rl_true = mir_graph_->reg_location_[mir->ssa_rep->uses[1]];
199 RegLocation rl_false = mir_graph_->reg_location_[mir->ssa_rep->uses[2]];
215 RegLocation rl_src1 = mir_graph_->GetSrcWide(mir, 0);
216 RegLocation rl_src2 = mir_graph_->GetSrcWide(mir, 2);
231 int64_t val = mir_graph_->ConstantValueWide(rl_src2);
730 if (is_object && !mir_graph_->IsConstantNullRef(rl_new_value)) {
800 if ((rl_src_pos.is_const && (mir_graph_->ConstantValue(rl_src_pos) < 0)) ||
801 (rl_dst_pos.is_const && (mir_graph_->ConstantValue(rl_dst_pos) < 0)) |
    [all...]
fp_arm64.cc 207 rl_src1 = mir_graph_->GetSrcWide(mir, 0);
208 rl_src2 = mir_graph_->GetSrcWide(mir, 2);
213 rl_src1 = mir_graph_->GetSrc(mir, 0);
214 rl_src2 = mir_graph_->GetSrc(mir, 1);
call_arm64.cc 332 bool skip_overflow_check = mir_graph_->MethodIsLeaf() && !FrameNeedsStackCheck(frame_size_, kArm64);
  /art/compiler/dex/quick/arm/
int_arm.cc 232 RegLocation rl_src = mir_graph_->GetSrc(mir, 0);
233 RegLocation rl_dest = mir_graph_->GetDest(mir);
282 RegLocation rl_true = mir_graph_->reg_location_[mir->ssa_rep->uses[1]];
283 RegLocation rl_false = mir_graph_->reg_location_[mir->ssa_rep->uses[2]];
306 RegLocation rl_src1 = mir_graph_->GetSrcWide(mir, 0);
307 RegLocation rl_src2 = mir_graph_->GetSrcWide(mir, 2);
317 int64_t val = mir_graph_->ConstantValueWide(rl_src2);
861 if (is_object && !mir_graph_->IsConstantNullRef(rl_new_value)) {
    [all...]
fp_arm.cc 220 rl_src1 = mir_graph_->GetSrcWide(mir, 0);
221 rl_src2 = mir_graph_->GetSrcWide(mir, 2);
226 rl_src1 = mir_graph_->GetSrc(mir, 0);
227 rl_src2 = mir_graph_->GetSrc(mir, 1);
target_arm.cc 762 int v_reg = mir_graph_->SRegToVReg(s_reg);
817 int v_reg = mir_graph_->SRegToVReg(s_reg);
call_arm.cc 357 bool skip_overflow_check = mir_graph_->MethodIsLeaf() && !FrameNeedsStackCheck(frame_size_, kArm);
  /art/compiler/dex/quick/mips/
call_mips.cc 306 bool skip_overflow_check = mir_graph_->MethodIsLeaf() && !FrameNeedsStackCheck(frame_size_, kMips);

Completed in 223 milliseconds

1 2