Home
last modified time | relevance | path

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

/bionic/linker/
Dlinked_list.h34 struct LinkedListEntry { struct
35 LinkedListEntry<T>* next; argument
45 explicit LinkedListIterator(LinkedListEntry<T>* entry) : entry_(entry) {} in LinkedListIterator() argument
70 LinkedListEntry<T> *entry_;
86 LinkedListEntry<T>* head;
87 LinkedListEntry<T>* tail;
92 static_assert(sizeof(LinkedListHeader) == sizeof(LinkedListEntry<T>));
93 static_assert(alignof(LinkedListHeader) == alignof(LinkedListEntry<T>));
99 Allocator::free(reinterpret_cast<LinkedListEntry<T>*>(header_)); in ~LinkedList()
114 LinkedListEntry<T>* new_entry = Allocator::alloc(); in push_front()
[all …]
Dlinker_common_types.h46 static LinkedListEntry<soinfo>* alloc();
47 static void free(LinkedListEntry<soinfo>* entry);
56 static LinkedListEntry<android_namespace_t>* alloc();
57 static void free(LinkedListEntry<android_namespace_t>* entry);
Dlinked_list_test.cpp44 typedef LinkedListEntry<const char> entry_t;
Dlinker.cpp89 static LinkerTypeAllocator<LinkedListEntry<soinfo>> g_soinfo_links_allocator;
92 static LinkerTypeAllocator<LinkedListEntry<android_namespace_t>> g_namespace_list_allocator;
296 LinkedListEntry<soinfo>* SoinfoListAllocator::alloc() { in alloc()
300 void SoinfoListAllocator::free(LinkedListEntry<soinfo>* entry) { in free()
304 LinkedListEntry<android_namespace_t>* NamespaceListAllocator::alloc() { in alloc()
308 void NamespaceListAllocator::free(LinkedListEntry<android_namespace_t>* entry) { in free()
681 using linked_list_t = LinkedList<T, TypeBasedAllocator<LinkedListEntry<T>>>;