Home
last modified time | relevance | path

Searched refs:indexes (Results 1 – 4 of 4) sorted by relevance

/art/compiler/dex/
Dtype_inference.cc357 const auto& indexes = mir_graph_->GetTopologicalSortOrderIndexes(); in FindTopologicallyEarliestPredecessor() local
358 DCHECK_LT(bb->id, indexes.size()); in FindTopologicallyEarliestPredecessor()
359 size_t best_idx = indexes[bb->id]; in FindTopologicallyEarliestPredecessor()
362 DCHECK_LT(pred_id, indexes.size()); in FindTopologicallyEarliestPredecessor()
363 if (best_idx > indexes[pred_id]) { in FindTopologicallyEarliestPredecessor()
364 best_idx = indexes[pred_id]; in FindTopologicallyEarliestPredecessor()
369 DCHECK_LT(best_idx, indexes[bb->id]); in FindTopologicallyEarliestPredecessor()
Dmir_optimization.cc1159 temp_.cice.indexes = temp_scoped_alloc_->AllocArray<uint16_t>(end, kArenaAllocGrowableArray); in EliminateClassInitChecksGate()
1160 std::fill_n(temp_.cice.indexes, end, 0xffffu); in EliminateClassInitChecksGate()
1207 temp_.cice.indexes[mir->offset / 2u] = index; in EliminateClassInitChecksGate()
1220 temp_.cice.indexes[mir->offset / 2u] = index; in EliminateClassInitChecksGate()
1231 temp_.cice.indexes = nullptr; in EliminateClassInitChecksGate()
1285 uint16_t index = temp_.cice.indexes[mir->offset / 2u]; in EliminateClassInitChecks()
1350 DCHECK(temp_.cice.indexes != nullptr); in EliminateClassInitChecksEnd()
1351 temp_.cice.indexes = nullptr; in EliminateClassInitChecksEnd()
Dgvn_dead_code_elimination_test.cc439 void ExpectValueNamesNE(const size_t (&indexes)[count]) { in ExpectValueNamesNE()
441 size_t idx1 = indexes[i1]; in ExpectValueNamesNE()
443 size_t idx2 = indexes[i2]; in ExpectValueNamesNE()
450 void ExpectNoNullCheck(const size_t (&indexes)[count]) { in ExpectNoNullCheck()
452 size_t idx = indexes[i]; in ExpectNoNullCheck()
Dmir_graph.h1401 uint16_t* indexes; member