Home
last modified time | relevance | path

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

/bionic/linker/
Dlinked_list.h23 struct LinkedListEntry { struct
24 LinkedListEntry<T>* next; argument
46 LinkedListEntry<T>* new_entry = Allocator::alloc(); in push_front() argument
56 LinkedListEntry<T>* new_entry = Allocator::alloc(); in push_back()
72 LinkedListEntry<T>* entry = head_; in pop_front()
94 LinkedListEntry<T>* p = head_; in clear()
112 for (LinkedListEntry<T>* e = head_; e != nullptr; e = e->next) { in visit()
122 for (LinkedListEntry<T>* e = head_, *p = nullptr; e != nullptr;) { in remove_if()
124 LinkedListEntry<T>* next = e->next; in remove_if()
141 for (LinkedListEntry<T>* e = head_; e != nullptr; e = e->next) { in find_if()
[all …]
Dlinker.h115 static LinkedListEntry<soinfo>* alloc();
116 static void free(LinkedListEntry<soinfo>* entry);
Dlinker.cpp71 static LinkerTypeAllocator<LinkedListEntry<soinfo>> g_soinfo_links_allocator;
220 LinkedListEntry<soinfo>* SoinfoListAllocator::alloc() { in alloc()
224 void SoinfoListAllocator::free(LinkedListEntry<soinfo>* entry) { in free()
879 using linked_list_t = LinkedList<T, TypeBasedAllocator<LinkedListEntry<T>>>;
/bionic/linker/tests/
Dlinked_list_test.cpp32 typedef LinkedListEntry<const char> entry_t;