Home
last modified time | relevance | path

Searched refs:input_records (Results 1 – 2 of 2) sorted by relevance

/art/compiler/optimizing/
Dgraph_checker.cc440 auto&& input_records = instruction->GetInputRecords(); in VisitInstruction()
441 for (size_t i = 0; i < input_records.size(); ++i) { in VisitInstruction()
442 const HUserRecord<HInstruction*>& input_record = input_records[i]; in VisitInstruction()
816 ArrayRef<HUserRecord<HInstruction*>> input_records = phi->GetInputRecords(); in VisitPhi() local
817 if (input_records[0].GetInstruction() == phi) { in VisitPhi()
824 for (size_t i = 0; i < input_records.size(); ++i) { in VisitPhi()
825 HInstruction* input = input_records[i].GetInstruction(); in VisitPhi()
848 if (input_records.empty()) { in VisitPhi()
856 if (input_records.size() != input_count_next) { in VisitPhi()
861 input_records.size(), in VisitPhi()
[all …]
Dnodes.h2629 ArrayRef<HUserRecord<HInstruction*>> input_records = GetInputRecords(); in SetRawInputRecordAt() local
2630 input_records[index] = input; in SetRawInputRecordAt()
4907 ArrayRef<HUserRecord<HInstruction*>> input_records = HInvoke::GetInputRecords();
4909 DCHECK(!input_records.empty());
4910 DCHECK_GT(input_records.size(), GetNumberOfArguments());
4911 HInstruction* last_input = input_records.back().GetInstruction();
4921 return input_records;