forked from AllAlgorithms/c
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathqueue.c
More file actions
92 lines (78 loc) · 1.5 KB
/
Copy pathqueue.c
File metadata and controls
92 lines (78 loc) · 1.5 KB
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
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
#include <stdlib.h>
#include "queue.h"
struct queue *
queue_init(const unsigned int max_size)
{
struct queue *queue = (struct queue *) malloc(sizeof(*queue));
if (queue) {
queue->max_size = max_size;
queue->size = 0;
queue->head = queue->tail = NULL;
return queue;
}
return NULL;
}
void
queue_destroy(struct queue *queue, fn_node_data_destroy fn)
{
struct queue_node *node = queue->head;
struct queue_node **node_next = &node->next;
while (node != NULL) {
if (fn != NULL) {
fn(node->data);
}
free(node);
node = *node_next;
node_next = &node->next;
}
}
struct queue_node *
queue_node_init(void *data, fn_node_data_init fn)
{
struct queue_node *node = (struct queue_node *) malloc(sizeof(*node));
if (node) {
if (fn != NULL) {
node->data = fn();
} else {
node->data = data;
}
node->next = NULL;
return node;
}
return NULL;
}
void
queue_node_destroy(struct queue_node *node, fn_node_data_destroy fn)
{
if (fn != NULL) {
fn(node->data);
}
free(node);
}
int
queue_enqueue(struct queue *queue, struct queue_node *node)
{
if (queue->size == queue->max_size) {
return -EQUEUEFULL;
}
if (queue->head == NULL && queue->tail == NULL) {
queue->head = queue->tail = node;
} else {
queue->tail->next = node;
queue->tail = node;
}
queue->size++;
return 0;
}
struct queue_node *
queue_dequeue(struct queue *queue)
{
struct queue_node *node;
if (queue->size == 0) {
return NULL;
}
node = queue->head;
queue->head = queue->head->next;
queue->size--;
return node;
}