Home
last modified time | relevance | path

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

/art/compiler/optimizing/
Dload_store_analysis.cc36 static bool CanBinaryOpAndIndexAlias(const HBinaryOperation* idx1, in CanBinaryOpAndIndexAlias() argument
40 if (!IsAddOrSub(idx1)) { in CanBinaryOpAndIndexAlias()
44 if (idx1->AsBinaryOperation()->GetLeastConstantLeft() != idx2) { in CanBinaryOpAndIndexAlias()
48 if (!idx1->GetConstantRight()->IsIntConstant()) { in CanBinaryOpAndIndexAlias()
54 int64_t l1 = idx1->IsAdd() ? in CanBinaryOpAndIndexAlias()
55 idx1->GetConstantRight()->AsIntConstant()->GetValue() : in CanBinaryOpAndIndexAlias()
56 -idx1->GetConstantRight()->AsIntConstant()->GetValue(); in CanBinaryOpAndIndexAlias()
63 static bool CanBinaryOpsAlias(const HBinaryOperation* idx1, in CanBinaryOpsAlias() argument
67 if (!IsAddOrSub(idx1) || !IsAddOrSub(idx2)) { in CanBinaryOpsAlias()
71 if (idx1->AsBinaryOperation()->GetLeastConstantLeft() != in CanBinaryOpsAlias()
[all …]
Dload_store_analysis.h454 bool CanArrayElementsAlias(const HInstruction* idx1,
494 HInstruction* idx1 = loc1->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() argument
1873 DCHECK_NE(idx1, idx2); in MayAliasOnBackEdge()
1875 if (heap_location_collector_.MayAlias(idx1, idx2)) { in MayAliasOnBackEdge()
1883 HeapLocation* loc1 = heap_location_collector_.GetHeapLocation(idx1); in MayAliasOnBackEdge()
/art/libdexfile/dex/
Ddex_file_verifier.cc2827 dex::TypeIndex idx1 = interfaces->GetTypeItem(i).type_idx_; in CheckInterClassDefItem() local
2830 if (UNLIKELY(idx1 == idx2)) { in CheckInterClassDefItem()
2831 ErrorStringPrintf("Duplicate interface: '%s'", dex_file_->StringByTypeIdx(idx1)); in CheckInterClassDefItem()