blob: 1d7a170dcfc70789e1776df75ef2a14e9ddf5cdd (
plain) (
blame)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
|
#include "queue.h"
#include <stdio.h>
#include <stdlib.h>
Queue *queueAlloc() {
Queue *new = malloc(sizeof(Queue));
new->first = NULL;
new->last = NULL;
return new;
}
void queueAdd(Queue *queue, int item) {
struct queueItem *new = malloc(sizeof(struct queueItem));
new->item = item;
if (queue->first) {
new->next = queue->last;
new->previous = NULL;
queue->last->previous = new;
queue->last = new;
} else {
new->next = NULL;
new->previous = NULL;
queue->first = new;
queue->last = new;
}
}
int queuePop(Queue *queue) {
if (!queue->first) {
return -1;
}
int out = queue->first->item;
queue->first = queue->first->previous;
return out;
}
void queueFree(Queue *queue) {
struct queueItem *qi = queue->last;
struct queueItem *t = NULL;
while (qi) {
// printf("Address:");
// printf("%p\n", (void *)qi);
t = qi->next;
free(qi);
qi = t;
}
free(queue);
}
|