Home
last modified time | relevance | path

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

/art/compiler/optimizing/
Dload_store_analysis.cc38 const HInstruction* idx2, in CanBinaryOpAndIndexAlias() argument
44 if (idx1->AsBinaryOperation()->GetLeastConstantLeft() != idx2) { in CanBinaryOpAndIndexAlias()
65 const HBinaryOperation* idx2, in CanBinaryOpsAlias() argument
67 if (!IsAddOrSub(idx1) || !IsAddOrSub(idx2)) { in CanBinaryOpsAlias()
72 idx2->AsBinaryOperation()->GetLeastConstantLeft()) { in CanBinaryOpsAlias()
77 !idx2->GetConstantRight()->IsIntConstant()) { in CanBinaryOpsAlias()
86 int64_t l2 = idx2->IsAdd() ? in CanBinaryOpsAlias()
87 idx2->GetConstantRight()->AsIntConstant()->GetValue() : in CanBinaryOpsAlias()
88 -idx2->GetConstantRight()->AsIntConstant()->GetValue(); in CanBinaryOpsAlias()
213 const HInstruction* idx2, in CanArrayElementsAlias() argument
[all …]
Dload_store_analysis.h456 const HInstruction* idx2,
495 HInstruction* idx2 = loc2->GetIndex(); in ComputeMayAlias() local
498 if (!CanArrayElementsAlias(idx1, vector_length1, idx2, vector_length2)) { in ComputeMayAlias()
Dload_store_elimination.cc945 bool MayAliasOnBackEdge(HBasicBlock* loop_header, size_t idx1, size_t idx2) const;
1872 bool LSEVisitor::MayAliasOnBackEdge(HBasicBlock* loop_header, size_t idx1, size_t idx2) const { in MayAliasOnBackEdge()
1873 DCHECK_NE(idx1, idx2); in MayAliasOnBackEdge()
1875 if (heap_location_collector_.MayAlias(idx1, idx2)) { in MayAliasOnBackEdge()
1884 HeapLocation* loc2 = heap_location_collector_.GetHeapLocation(idx2); in MayAliasOnBackEdge()
/art/libdexfile/dex/
Ddex_file_verifier.cc2829 dex::TypeIndex idx2 = interfaces->GetTypeItem(j).type_idx_; in CheckInterClassDefItem() local
2830 if (UNLIKELY(idx1 == idx2)) { in CheckInterClassDefItem()