Home
last modified time | relevance | path

Searched refs:heap_loc (Results 1 – 3 of 3) sorted by relevance

/art/compiler/optimizing/
Dscheduler.cc79 size_t heap_loc = heap_location_collector_->GetArrayHeapLocation(instruction); in ArrayAccessHeapLocation() local
81 DCHECK(heap_loc != HeapLocationCollector::kHeapLocationNotFound); in ArrayAccessHeapLocation()
82 return heap_loc; in ArrayAccessHeapLocation()
155 size_t heap_loc = heap_location_collector_->GetFieldHeapLocation(ref, GetFieldInfo(instr)); in FieldAccessHeapLocation() local
157 DCHECK(heap_loc != HeapLocationCollector::kHeapLocationNotFound); in FieldAccessHeapLocation()
159 return heap_loc; in FieldAccessHeapLocation()
Dload_store_analysis.h536 HeapLocation* heap_loc = new (allocator_) HeapLocation( in MaybeCreateHeapLocation() local
538 heap_locations_.push_back(heap_loc); in MaybeCreateHeapLocation()
Dload_store_elimination.cc919 void RecordFieldInfo(const FieldInfo* info, size_t heap_loc) { in RecordFieldInfo() argument
920 field_infos_[heap_loc] = info; in RecordFieldInfo()
2911 to_restore_[rec.blk_id][rec.heap_loc].value = rec.val_; in ~ScopedRestoreHeapValues()
2918 for (size_t heap_loc : Range(to_restore_[blk_id].size())) { in ForEachRecord() local
2919 LSEVisitor::ValueRecord* vr = &to_restore_[blk_id][heap_loc]; in ForEachRecord()
2923 updated_values_.push_back({blk_id, heap_loc, initial}); in ForEachRecord()
2932 size_t heap_loc; member