queue_entry
struct queue_entry : public DoublyLinkedListLinkImpl<queue_entry> {
typedef DoublyLinkedList<queue_entry> QueueEntryList;
while (queue_entry* chunk = fChunkHeads.RemoveHead())
queue_entry* AllocateEntry()
queue_entry* newEntries = (queue_entry*)malloc(chunkSize);
for (size_t i = 1; i < (chunkSize / sizeof(queue_entry)); i++)
void FreeEntry(queue_entry* entry)
status_t AddEntry(queue_entry* newEntry);
void RemoveEntry(queue_entry* newEntry);
void CleanupAndFree(queue_entry* entry);
queue_entry fInlineEntries[8];
queue_entry* newEntry = fData->AllocateEntry();
while (queue_entry* entry = it.Next()) {
queue_entry* entry = fData->fEvents.Head();
TimedEventQueueData::AddEntry(queue_entry* newEntry)
while (queue_entry* entry = it.Next()) {
TimedEventQueueData::RemoveEntry(queue_entry* entry)
TimedEventQueueData::CleanupAndFree(queue_entry* entry)
queue_entry* entry = fData->fEvents.First();
queue_entry* entry = fData->fEvents.First();
queue_entry* entry = fData->fEvents.Last();
queue_entry* entry = fData->fEvents.Last();
while (queue_entry* entry = it.Next()) {
while (queue_entry* entry = it.Next()) {
while (queue_entry* entry = entries.RemoveHead())
while (queue_entry* entry = it.Next()) {