Searched defs:loop_info (Results 1 - 3 of 3) sorted by relevance

/art/compiler/optimizing/
H A Dlicm.cc93 HLoopInformation* loop_info = block->GetLoopInformation(); local
95 HBasicBlock* pre_header = loop_info->GetPreHeader();
97 for (HBlocksInLoopIterator it_loop(*loop_info); !it_loop.Done(); it_loop.Advance()) {
100 if (inner->GetLoopInformation() != loop_info) {
123 UpdateLoopPhisIn(instruction->GetEnvironment(), loop_info);
H A Dnodes.cc956 HLoopInformation* loop_info = GetLoopInformation(); local
963 && (loop_info == nullptr || !loop_info->IsBackEdge(*this));
1026 HLoopInformation* loop_info = it.Current(); local
1027 loop_info->Remove(this);
1028 if (loop_info->IsBackEdge(*this)) {
1032 loop_info->RemoveBackEdge(this);
1111 HLoopInformation* loop_info = it.Current(); local
1112 loop_info->Remove(other);
1113 if (loop_info
[all...]
H A Dbounds_check_elimination.cc270 // Returns if `block` that is in loop_info may exit the loop, unless it's
271 // the loop header for loop_info.
272 static bool EarlyExit(HBasicBlock* block, HLoopInformation* loop_info) { argument
273 DCHECK(loop_info->Contains(*block));
274 if (block == loop_info->GetHeader()) {
275 // Loop header of loop_info. Exiting loop is normal.
280 if (!loop_info->Contains(*successors.Get(i))) {
288 static bool DominatesAllBackEdges(HBasicBlock* block, HLoopInformation* loop_info) { argument
289 for (size_t i = 0, e = loop_info->GetBackEdges().Size(); i < e; ++i) {
290 HBasicBlock* back_edge = loop_info
299 HLoopInformation* loop_info = induction_variable_->GetBlock()->GetLoopInformation(); local
527 HLoopInformation* loop_info = header->GetLoopInformation(); local
[all...]

Completed in 64 milliseconds