#include "dispatch.h" void queue_init(Queue *queue) { queue->head = 0; queue->count = 0; } int queue_push(Queue *queue, Message message) { if (queue->count >= QUEUE_CAPACITY) return -2; queue->slots[queue->count++] = message; return 0; } const Message *queue_front(const Queue *queue) { return queue->count ? &queue->slots[0] : NULL; } const Message *queue_at(const Queue *queue, unsigned ordinal) { return ordinal < queue->count ? &queue->slots[ordinal] : NULL; } int queue_pop(Queue *queue) { unsigned i; if (!queue->count) return -2; --queue->count; for (i=0; icount; ++i) queue->slots[i]=queue->slots[i+1]; return 0; } unsigned queue_age(Queue *queue) { unsigned i=0, removed=0; while (icount) { if (--queue->slots[i].lease == 0) { unsigned j; --queue->count; for (j=i; jcount; ++j) queue->slots[j]=queue->slots[j+1]; ++removed; } else ++i; } return removed; } unsigned queue_clear(Queue *queue) { unsigned old=queue->count; queue->count=0; return old; } unsigned queue_remove_id(Queue *queue, int id) { unsigned i=0, removed=0; while (icount) { if (queue->slots[i].id == id) { unsigned j; --queue->count; for (j=i; jcount; ++j) queue->slots[j]=queue->slots[j+1]; ++removed; } else ++i; } return removed; } int queue_transfer(Queue *source, Queue *target, unsigned count) { unsigned i; if (source==target || count>source->count) return -4; if (target->count+count>QUEUE_CAPACITY) return -2; for (i=0; islots[i]); for (i=0; i