return queue;
}
+void initQueue(struct Queue * q) {
+ q->head=NULL;
+ q->tail=NULL;
+}
+
void freeQueue(struct Queue * q) {
RUNFREE(q);
}
}
#ifdef MULTICORE
+struct Queue * createQueue_I() {
+ struct Queue * queue = (struct Queue *)RUNMALLOC_I(sizeof(struct Queue));
+ queue->head = NULL;
+ queue->tail = NULL;
+ return queue;
+}
+
struct QueueItem * addNewItem_I(struct Queue * queue, void * ptr) {
struct QueueItem * item=RUNMALLOC_I(sizeof(struct QueueItem));
item->objectptr=ptr;
}
queue->head=q->next;
if(queue->tail == q) {
- queue->tail = NULL;
+ queue->tail = NULL;
}
RUNFREE(q);
return ptr;
}
void clearQueue(struct Queue * queue) {
- struct QueueItem * item=queue->head;
+ struct QueueItem * item=queue->head;
while(item!=NULL) {
- struct QueueItem * next=item->next;
- RUNFREE(item);
+ struct QueueItem * next=item->next;
+ RUNFREE(item);
item=next;
}
- queue->head=queue->tail=NULL;
- return NULL;
+ queue->head=queue->tail=NULL;
+ return;
}
#ifdef DEBUG_QUEUE
return 0;
}
- // i->prev != NULL
+ // i->prev != NULL
} else {
if( i->prev->next == NULL ) {
return 0;
return 0;
}
- // i->next != NULL
+ // i->next != NULL
} else {
if( i->next->prev == NULL ) {
return 0;
struct QueueItem* i;
printf("Queue empty? %d\n", isEmpty(queue));
-
- printf("head ");
+
+ printf("head ");
i = queue->head;
while( i != NULL ) {
printf("item ");