Searched defs:cu_ (Results 1 - 9 of 9) sorted by relevance

/art/compiler/dex/portable/
H A Dmir_to_gbc.h56 cu_(cu),
179 CompilationUnit* cu_; member in class:art::MirConverter
/art/compiler/dex/
H A Dmir_graph_test.cc59 cu_.mir_graph->block_id_map_.clear();
60 cu_.mir_graph->block_list_.Reset();
67 BasicBlock* bb = cu_.mir_graph->NewMemBB(def->type, i);
68 cu_.mir_graph->block_list_.Insert(bb);
78 bb->successor_blocks = new (&cu_.arena) GrowableArray<SuccessorBlockInfo*>(
79 &cu_.arena, def->num_successors, kGrowableArraySuccessorBlocks);
82 static_cast<SuccessorBlockInfo*>(cu_.arena.Alloc(sizeof(SuccessorBlockInfo),
89 bb->predecessors = new (&cu_.arena) GrowableArray<BasicBlockId>(
90 &cu_.arena, def->num_predecessors, kGrowableArrayPredecessors);
97 cu_
161 CompilationUnit cu_; member in class:art::TopologicalSortOrderTest
[all...]
H A Dlocal_value_numbering_test.cc89 cu_.mir_graph->ifield_lowering_infos_.Reset();
90 cu_.mir_graph->ifield_lowering_infos_.Resize(count);
100 cu_.mir_graph->ifield_lowering_infos_.Insert(field_info);
110 cu_.mir_graph->sfield_lowering_infos_.Reset();
111 cu_.mir_graph->sfield_lowering_infos_.Resize(count);
123 cu_.mir_graph->sfield_lowering_infos_.Insert(field_info);
134 mirs_ = reinterpret_cast<MIR*>(cu_.arena.Alloc(sizeof(MIR) * count, kArenaAllocMIR));
143 ASSERT_LT(def->field_info, cu_.mir_graph->ifield_lowering_infos_.Size());
146 ASSERT_LT(def->field_info, cu_.mir_graph->sfield_lowering_infos_.Size());
173 CHECK_LT(sfield_index, cu_
204 CompilationUnit cu_; member in class:art::LocalValueNumberingTest
[all...]
H A Dmir_optimization_test.cc79 cu_.mir_graph->sfield_lowering_infos_.Reset();
80 cu_.mir_graph->sfield_lowering_infos_.Resize(count);
92 cu_.mir_graph->sfield_lowering_infos_.Insert(field_info);
102 cu_.mir_graph->block_id_map_.clear();
103 cu_.mir_graph->block_list_.Reset();
110 BasicBlock* bb = cu_.mir_graph->NewMemBB(def->type, i);
111 cu_.mir_graph->block_list_.Insert(bb);
121 bb->successor_blocks = new (&cu_.arena) GrowableArray<SuccessorBlockInfo*>(
122 &cu_.arena, def->num_successors, kGrowableArraySuccessorBlocks);
125 static_cast<SuccessorBlockInfo*>(cu_
216 CompilationUnit cu_; member in class:art::ClassInitCheckEliminationTest
[all...]
H A Dglobal_value_numbering.h196 return cu_;
207 CompilationUnit* const cu_; member in class:art::GlobalValueNumbering
H A Dglobal_value_numbering_test.cc132 cu_.mir_graph->ifield_lowering_infos_.Reset();
133 cu_.mir_graph->ifield_lowering_infos_.Resize(count);
143 cu_.mir_graph->ifield_lowering_infos_.Insert(field_info);
153 cu_.mir_graph->sfield_lowering_infos_.Reset();
154 cu_.mir_graph->sfield_lowering_infos_.Resize(count);
166 cu_.mir_graph->sfield_lowering_infos_.Insert(field_info);
176 cu_.mir_graph->block_id_map_.clear();
177 cu_.mir_graph->block_list_.Reset();
184 BasicBlock* bb = cu_.mir_graph->NewMemBB(def->type, i);
185 cu_
355 CompilationUnit cu_; member in class:art::GlobalValueNumberingTest
[all...]
H A Dmir_graph.h581 return cu_->code_item->insns_size_in_code_units_;
915 return (vreg >= cu_->num_regs);
1137 CompilationUnit* const cu_; member in class:art::MIRGraph
/art/compiler/driver/
H A Ddex_compilation_unit.h44 return cu_;
112 CompilationUnit* const cu_; member in class:art::DexCompilationUnit
/art/compiler/dex/quick/
H A Dmir_to_lir.h221 #define SLOW_FIELD_PATH (cu_->enable_debug & (1 << kDebugSlowFieldPath))
222 #define SLOW_INVOKE_PATH (cu_->enable_debug & (1 << kDebugSlowInvokePath))
223 #define SLOW_STRING_PATH (cu_->enable_debug & (1 << kDebugSlowStringPath))
224 #define SLOW_TYPE_PATH (cu_->enable_debug & (1 << kDebugSlowTypePath))
225 #define EXERCISE_SLOWEST_STRING_PATH (cu_->enable_debug & (1 << kDebugSlowestStringPath))
525 m2l_(m2l), cu_(m2l->cu_), current_dex_pc_(dexpc), fromfast_(fromfast), cont_(cont) {
547 CompilationUnit* const cu_; member in class:art::Mir2Lir::LIRSlowPath
1464 return cu_;
1688 CompilationUnit* const cu_; member in class:art::Mir2Lir
[all...]

Completed in 9039 milliseconds