Home
last modified time | relevance | path

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

/system/core/libmemunreachable/
DLinkedList.h23 class LinkedList {
25 LinkedList() : next_(this), prev_(this), data_() {} in LinkedList() function
26 explicit LinkedList(T data) : LinkedList() { data_ = data; } in LinkedList() function
27 ~LinkedList() {} in ~LinkedList()
28 void insert(LinkedList<T>& node) { in insert()
43 LinkedList<T>* next() { return next_; } in next()
46 LinkedList<T>* next_;
47 LinkedList<T>* prev_;
58 LinkedList<T> node_;
DAllocator.cpp87 LinkedList<Chunk*> free_chunks_[kNumBuckets];
88 LinkedList<Chunk*> full_chunks_[kNumBuckets];
90 void MoveToList(Chunk* chunk, LinkedList<Chunk*>* head);
185 LinkedList<Chunk*> node_; // linked list sorted by minimum free count
325 for (LinkedList<Chunk*>* it = free_chunks_[i].next(); it->data() != NULL; it = it->next()) { in Empty()
330 for (LinkedList<Chunk*>* it = full_chunks_[i].next(); it->data() != NULL; it = it->next()) { in Empty()
424 void HeapImpl::MoveToList(Chunk* chunk, LinkedList<Chunk*>* head) { in MoveToList()
428 LinkedList<Chunk*>* node = head; in MoveToList()
/system/timezone/tzlookup_generator/src/main/java/com/android/libcore/timezone/tzlookup/
DErrors.java20 import java.util.LinkedList;
34 private final LinkedList<String> scopes = new LinkedList<>();
/system/timezone/distro/core/src/main/com/android/timezone/distro/
DFileUtils.java24 import java.util.LinkedList;
64 LinkedList<File> dirs = new LinkedList<>(); in ensureDirectoriesExist()