blob: f039257cd57aa3d43d9f659b923ca00f843639fc (
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
49
50
51
52
53
54
55
56
57
58
59
60
61
|
// Copyright (c) 2023, Marvin Borner <dev@marvinborner.de>
// SPDX-License-Identifier: MIT
#include <stdlib.h>
#include <lib/queue.h>
#include <log.h>
struct queue *queue_new(void)
{
struct queue *queue = malloc(sizeof(*queue));
if (!queue)
fatal("out of memory!\n");
queue->head = 0;
queue->tail = 0;
return queue;
}
void queue_free(struct queue *queue)
{
while (queue->head) {
struct queue_node *node = queue->head;
queue->head = node->next;
free(node);
}
free(queue);
}
void queue_push(struct queue *queue, void *data)
{
struct queue_node *node = malloc(sizeof(*node));
if (!node)
fatal("out of memory!\n");
node->data = data;
node->next = 0;
if (queue->tail) {
queue->tail->next = node;
queue->tail = node;
} else {
queue->head = node;
queue->tail = node;
}
}
void *queue_pop(struct queue *queue)
{
if (!queue->head)
return 0;
struct queue_node *node = queue->head;
queue->head = node->next;
if (!queue->head)
queue->tail = 0;
void *data = node->data;
free(node);
return data;
}
int queue_empty(struct queue *queue)
{
return !queue->head;
}
|
