Lines Matching refs:entry

58 	event_queue_entry *entry;
59 entry = fFirstEntry;
60 while (entry) {
62 deleteme = entry;
63 entry = entry->next;
120 for (event_queue_entry *entry = fLastEntry; entry; entry = entry->prev) {
121 if (entry->event.event_time <= event.event_time) {
122 //insert after entry
125 newentry->prev = entry;
126 newentry->next = entry->next;
127 (entry->next)->prev = newentry;
128 entry->next = newentry;
144 for (event_queue_entry *entry = fFirstEntry; entry; entry = entry->next) {
145 if (entry->event == *event) {
147 RemoveEntry(entry);
229 event_queue_entry *entry;
235 for (entry = fFirstEntry; entry; entry = entry->next) {
236 if (eventType == BTimedEventQueue::B_ANY_EVENT || eventType == entry->event.type)
237 return &entry->event;
246 for (entry = fFirstEntry; entry != end; entry = entry->next) {
247 if (eventType == BTimedEventQueue::B_ANY_EVENT || eventType == entry->event.type) {
248 return &entry->event;
256 for (entry = fFirstEntry; entry; entry = entry->next) {
257 if (eventTime == entry->event.event_time) {
259 if (eventType == BTimedEventQueue::B_ANY_EVENT || eventType == entry->event.type)
260 return &entry->event;
268 for (entry = GetStart_AfterTime(eventTime, inclusive); entry; entry = entry->next) {
269 if (eventType == BTimedEventQueue::B_ANY_EVENT || eventType == entry->event.type) {
270 return &entry->event;
289 event_queue_entry *entry;
297 for (entry = fFirstEntry; entry; ) {
298 if (eventType == BTimedEventQueue::B_ANY_EVENT || eventType == entry->event.type) {
299 action = (*hook)(&entry->event, context);
304 CleanupEvent(&entry->event);
305 remove = entry;
306 entry = entry->next;
312 entry = entry->next;
316 entry = entry->next;
326 for (entry = fFirstEntry; entry != end; ) {
327 if (eventType == BTimedEventQueue::B_ANY_EVENT || eventType == entry->event.type) {
328 action = (*hook)(&entry->event, context);
333 CleanupEvent(&entry->event);
334 remove = entry;
335 entry = entry->next;
341 entry = entry->next;
345 entry = entry->next;
353 for (entry = fFirstEntry; entry; ) {
354 if (eventTime == entry->event.event_time) {
356 if (eventType == BTimedEventQueue::B_ANY_EVENT || eventType == entry->event.type) {
357 action = (*hook)(&entry->event, context);
362 CleanupEvent(&entry->event);
363 remove = entry;
364 entry = entry->next;
370 entry = entry->next;
374 entry = entry->next;
379 entry = entry->next;
386 for (entry = GetStart_AfterTime(eventTime, inclusive); entry; ) {
387 if (eventType == BTimedEventQueue::B_ANY_EVENT || eventType == entry->event.type) {
388 action = (*hook)(&entry->event, context);
393 CleanupEvent(&entry->event);
394 remove = entry;
395 entry = entry->next;
401 entry = entry->next;
405 entry = entry->next;
422 event_queue_entry *entry;
429 for (entry = fFirstEntry; entry; ) {
430 if (eventType == BTimedEventQueue::B_ANY_EVENT || eventType == entry->event.type) {
431 CleanupEvent(&entry->event);
432 remove = entry;
433 entry = entry->next;
436 entry = entry->next;
446 for (entry = fFirstEntry; entry != end; ) {
447 if (eventType == BTimedEventQueue::B_ANY_EVENT || eventType == entry->event.type) {
448 CleanupEvent(&entry->event);
449 remove = entry;
450 entry = entry->next;
453 entry = entry->next;
461 for (entry = fFirstEntry; entry; ) {
462 if (eventTime == entry->event.event_time) {
464 if (eventType == BTimedEventQueue::B_ANY_EVENT || eventType == entry->event.type) {
465 CleanupEvent(&entry->event);
466 remove = entry;
467 entry = entry->next;
470 entry = entry->next;
475 entry = entry->next;
482 for (entry = GetStart_AfterTime(eventTime, inclusive); entry; ) {
483 if (eventType == BTimedEventQueue::B_ANY_EVENT || eventType == entry->event.type) {
484 CleanupEvent(&entry->event);
485 remove = entry;
486 entry = entry->next;
489 entry = entry->next;
509 _event_queue_imp::RemoveEntry(event_queue_entry *entry)
511 //remove the entry from double-linked list
513 if (entry->prev != NULL)
514 (entry->prev)->next = entry->next;
515 if (entry->next != NULL)
516 (entry->next)->prev = entry->prev;
517 if (entry == fFirstEntry) {
518 fFirstEntry = entry->next;
522 if (entry == fLastEntry) {
523 fLastEntry = entry->prev;
527 delete entry;
588 event_queue_entry *entry;
590 entry = fLastEntry;
591 while (entry) {
592 if ((entry->event.event_time > eventTime) || (!inclusive && entry->event.event_time == eventTime))
593 entry = entry->prev;
597 return entry;
604 event_queue_entry *entry;
606 entry = fFirstEntry;
607 while (entry) {
608 if ((entry->event.event_time < eventTime) || (!inclusive && entry->event.event_time == eventTime))
609 entry = entry->next;
613 return entry;
624 for (event_queue_entry *entry = fFirstEntry; entry; entry = entry->next) {
625 TRACE("entry = 0x%x\n",(int)entry);
626 TRACE(" entry.prev = 0x%x\n",(int)entry->prev);
627 TRACE(" entry.next = 0x%x\n",(int)entry->next);
628 TRACE(" entry.event.event_time = 0x%x\n",(int)entry->event.event_time);