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
34 explicit LinkedListIterator(LinkedListEntry<T>* entry) : entry_(entry) {} in LinkedListIterator() argument
59 LinkedListEntry<T> *entry_;
83 LinkedListEntry<T>* new_entry = Allocator::alloc(); in push_front()
93 LinkedListEntry<T>* new_entry = Allocator::alloc(); in push_back()
109 LinkedListEntry<T>* entry = head_; in pop_front()
131 LinkedListEntry<T>* p = head_; in clear()
149 for (LinkedListEntry<T>* e = head_; e != nullptr; e = e->next) { in visit()
159 for (LinkedListEntry<T>* e = head_, *p = nullptr; e != nullptr;) { in remove_if()
[all …]
Dlinker.h115 static LinkedListEntry<soinfo>* alloc();
116 static void free(LinkedListEntry<soinfo>* entry);
125 static LinkedListEntry<android_namespace_t>* alloc();
126 static void free(LinkedListEntry<android_namespace_t>* entry);
Dlinker.cpp149 static LinkerTypeAllocator<LinkedListEntry<soinfo>> g_soinfo_links_allocator;
152 static LinkerTypeAllocator<LinkedListEntry<android_namespace_t>> g_namespace_list_allocator;
359 LinkedListEntry<soinfo>* SoinfoListAllocator::alloc() { in alloc()
363 void SoinfoListAllocator::free(LinkedListEntry<soinfo>* entry) { in free()
367 LinkedListEntry<android_namespace_t>* NamespaceListAllocator::alloc() { in alloc()
371 void NamespaceListAllocator::free(LinkedListEntry<android_namespace_t>* entry) { in free()
1227 using linked_list_t = LinkedList<T, TypeBasedAllocator<LinkedListEntry<T>>>;
/bionic/linker/tests/
Dlinked_list_test.cpp32 typedef LinkedListEntry<const char> entry_t;