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
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
|
/*
* (C) 2006-2009 by Pablo Neira Ayuso <pablo@netfilter.org>
*
* This program is free software; you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation; either version 2 of the License, or
* (at your option) any later version.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program; if not, write to the Free Software
* Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
*/
#include "queue.h"
#include "event.h"
#include <errno.h>
#include <stdlib.h>
#include <string.h>
struct queue *
queue_create(const char *name, int max_objects, unsigned int flags)
{
struct queue *b;
b = calloc(sizeof(struct queue), 1);
if (b == NULL)
return NULL;
b->max_elems = max_objects;
INIT_LIST_HEAD(&b->head);
b->flags = flags;
if (flags & QUEUE_F_EVFD) {
b->evfd = create_evfd();
if (b->evfd == NULL) {
free(b);
return NULL;
}
}
strncpy(b->name, name, QUEUE_NAMELEN);
b->name[QUEUE_NAMELEN-1]='\0';
return b;
}
void queue_destroy(struct queue *b)
{
if (b->flags & QUEUE_F_EVFD)
destroy_evfd(b->evfd);
free(b);
}
void queue_node_init(struct queue_node *n, int type)
{
INIT_LIST_HEAD(&n->head);
n->type = type;
}
void *queue_node_data(struct queue_node *n)
{
return ((char *)n) + sizeof(struct queue_node);
}
struct queue_object *queue_object_new(int type, size_t size)
{
struct queue_object *obj;
obj = calloc(sizeof(struct queue_object) + size, 1);
if (obj == NULL)
return NULL;
obj->qnode.size = size;
queue_node_init(&obj->qnode, type);
return obj;
}
void queue_object_free(struct queue_object *obj)
{
free(obj);
}
int queue_add(struct queue *b, struct queue_node *n)
{
if (!list_empty(&n->head))
return 0;
if (b->num_elems >= b->max_elems) {
errno = ENOSPC;
return -1;
}
n->owner = b;
list_add_tail(&n->head, &b->head);
b->num_elems++;
if (b->evfd)
write_evfd(b->evfd);
return 1;
}
int queue_del(struct queue_node *n)
{
if (list_empty(&n->head))
return 0;
list_del_init(&n->head);
n->owner->num_elems--;
if (n->owner->evfd)
read_evfd(n->owner->evfd);
n->owner = NULL;
return 1;
}
struct queue_node *queue_del_head(struct queue *b)
{
struct queue_node *n = (struct queue_node *) b->head.next;
queue_del(n);
return n;
}
int queue_in(struct queue *b, struct queue_node *n)
{
return b == n->owner;
}
int queue_get_eventfd(struct queue *b)
{
return get_read_evfd(b->evfd);
}
void queue_iterate(struct queue *b,
const void *data,
int (*iterate)(struct queue_node *n, const void *data2))
{
struct list_head *i, *tmp;
struct queue_node *n;
list_for_each_safe(i, tmp, &b->head) {
n = (struct queue_node *) i;
if (iterate(n, data))
break;
}
}
unsigned int queue_len(const struct queue *b)
{
return b->num_elems;
}
|
