126 struct queue_entry : public DoublyLinkedListLinkImpl<queue_entry> {  struct
129 typedef DoublyLinkedList<queue_entry> QueueEntryList;  argument
148 		while (queue_entry* chunk = fChunkHeads.RemoveHead())  in ~TimedEventQueueData()
152 	queue_entry* AllocateEntry()  in AllocateEntry()
160 		queue_entry* newEntries = (queue_entry*)malloc(chunkSize);  in AllocateEntry()
162 		for (size_t i = 1; i < (chunkSize / sizeof(queue_entry)); i++)  in AllocateEntry()
168 	void FreeEntry(queue_entry* entry)  in FreeEntry()
177 	status_t	AddEntry(queue_entry* newEntry);
178 	void		RemoveEntry(queue_entry* newEntry);
179 	void		CleanupAndFree(queue_entry* entry);
193 	queue_entry			fInlineEntries[8];
221 	queue_entry* newEntry = fData->AllocateEntry();  in AddEvent()
239 	while (queue_entry* entry = it.Next()) {  in RemoveEvent()
265 	queue_entry* entry = fData->fEvents.Head();  in RemoveFirstEvent()
282 TimedEventQueueData::AddEntry(queue_entry* newEntry)  in AddEntry()
298 	while (queue_entry* entry = it.Next()) {  in AddEntry()
314 TimedEventQueueData::RemoveEntry(queue_entry* entry)  in RemoveEntry()
324 TimedEventQueueData::CleanupAndFree(queue_entry* entry)  in CleanupAndFree()
389 	queue_entry* entry = fData->fEvents.First();  in FirstEvent()
402 	queue_entry* entry = fData->fEvents.First();  in FirstEventTime()
415 	queue_entry* entry = fData->fEvents.Last();  in LastEvent()
428 	queue_entry* entry = fData->fEvents.Last();  in LastEventTime()
443 	while (queue_entry* entry = it.Next()) {  in FindFirstMatch()
468 	while (queue_entry* entry = it.Next()) {  in DoForEach()
500 		while (queue_entry* entry = entries.RemoveHead())  in DoForEach()
516 	while (queue_entry* entry = it.Next()) {  in FlushEvents()