Searched defs:head (Results 1 - 5 of 5) sorted by relevance

/art/runtime/gc/
H A Dreference_queue.cc50 ObjPtr<mirror::Reference> head = list_->GetPendingNext<kWithoutReadBarrier>(); local
51 DCHECK(head != nullptr);
52 ref->SetPendingNext(head);
183 ObjPtr<mirror::Reference> const head = list_; local
184 ObjPtr<mirror::Reference> ref = head;
193 } while (LIKELY(ref != head));
/art/runtime/jit/
H A Ddebugger_interface.cc66 // 1) read the seqlock and then the linked list head pointer.
164 JITCodeEntry* head = descriptor.head_.load(std::memory_order_relaxed); local
170 entry->next_.store(head, std::memory_order_relaxed);
175 if (head != nullptr) {
176 head->prev_ = entry;
/art/runtime/base/
H A Darena_allocator.cc218 size_t head = memory_ - unaligned_memory_; local
219 size_t tail = overallocation - head;
220 MEMORY_TOOL_MAKE_NOACCESS(unaligned_memory_, head);
231 size_t head = memory_ - unaligned_memory_; local
232 size_t tail = overallocation - head;
233 MEMORY_TOOL_MAKE_UNDEFINED(unaligned_memory_, head);
/art/runtime/gc/allocator/
H A Drosalloc.h139 // traverse the list from the head to the tail when merging free lists.
156 // Removes from the head of the free list.
270 Slot* head = reinterpret_cast<Slot*>(head_); local
273 CHECK(head == nullptr);
278 CHECK(head != nullptr);
283 for (Slot* slot = head; slot != nullptr; slot = slot->Next()) {
294 // A pointer (Slot*) to the head of the list. Always 8 bytes so that we will have the same
406 // Add backwards so the first slot is at the head of the list.
/art/runtime/
H A Dthread.cc337 static FrameIdToShadowFrame* FindFrameIdToShadowFrame(FrameIdToShadowFrame* head, argument
340 for (FrameIdToShadowFrame* record = head; record != nullptr; record = record->GetNext()) {
396 FrameIdToShadowFrame* head = tlsPtr_.frame_id_to_shadow_frame; local
397 if (head->GetFrameId() == frame_id) {
398 tlsPtr_.frame_id_to_shadow_frame = head->GetNext();
399 FrameIdToShadowFrame::Delete(head);
402 FrameIdToShadowFrame* prev = head;
403 for (FrameIdToShadowFrame* record = head->GetNext();

Completed in 102 milliseconds