Repository navigation
Expand file tree
/
Copy pathqueue.c
More file actions
118 lines (96 loc) · 2.6 KB
/
Copy pathqueue.c
File metadata and controls
118 lines (96 loc) · 2.6 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
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
#include "queue.h"
#include "common.h"
#include "common_internal.h"
#include <stdlib.h>
#include <string.h>
typedef struct queue_node queue_node_t;
struct queue_options {
ctl_tops_t common;
};
struct queue_node {
void* val;
queue_node_t* next;
};
struct queue {
queue_node_t* head;
queue_node_t* tail;
size_t length;
size_t size;
queue_options_t opts;
};
static void __queue_set_opts(queue_t* queue, queue_options_t* options)
{
queue->opts.common.allocator = options && options->common.allocator ? options->common.allocator : malloc;
queue->opts.common.delete_cb = options && options->common.delete_cb ? options->common.delete_cb : NULL;
}
queue_t* queue_create(size_t size, queue_options_t* options)
{
queue_t* __q = (queue_t*)malloc(sizeof(queue_t));
__queue_set_opts(__q, options);
__q->head = __q->tail = NULL;
__q->length = 0;
__q->size = size;
return __q;
}
void queue_enqueue(queue_t* queue, void* val, size_t size)
{
__TYPE_CHECK(queue->size, size);
ctl_allocator_t alloc = queue->opts.common.allocator;
queue_node_t* __node = (queue_node_t*)alloc(sizeof(queue_node_t));
__node->val = NULL;
__node->next = NULL;
__ctl_assign_val(&__node->val, &val, alloc, queue->size, size);
if (!queue->head) {
queue->head = __node;
queue->tail = queue->head;
} else {
queue->tail->next = __node;
queue->tail = queue->tail->next;
}
queue->length++;
}
int queue_dequeue(queue_t* queue, void* rmval)
{
queue_node_t* __curptr = queue->head;
ctl_delete_cb_t __dcb = queue->opts.common.delete_cb;
if (!__curptr)
return 1;
queue->head = __curptr->next;
if (rmval)
memcpy(rmval, __curptr->val, queue->size);
__DELETE_NODE(__curptr, queue->size, queue->opts.common.flags, __dcb);
queue->length--;
return 0;
}
void queue_clear(queue_t* queue)
{
queue_node_t *__curptr, *__nxtptr;
ctl_delete_cb_t __dcb = queue->opts.common.delete_cb;
__curptr = queue->head;
while (__curptr != NULL) {
__nxtptr = __curptr->next;
__DELETE_NODE(__curptr, queue->size, queue->opts.common.flags, __dcb);
__curptr = __nxtptr;
}
}
void queue_for_each(queue_t* queue, ctl_handle_cb_t cb)
{
queue_node_t* __curptr = queue->head;
while (__curptr != NULL) {
cb(__curptr->val);
__curptr = __curptr->next;
}
}
size_t queue_size(queue_t* queue)
{
return queue->size;
}
size_t queue_length(queue_t* queue)
{
return queue->length;
}
void queue_delete(queue_t* queue)
{
queue_clear(queue);
free((queue_t*)queue);
}