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
|
/* Copyright (C) 2011 CZ.NIC, z.s.p.o. <knot-dns@labs.nic.cz>
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 3 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, see <http://www.gnu.org/licenses/>.
*/
#include <string.h>
#include <stdlib.h>
#include <unistd.h>
#include "common/evqueue.h"
/*! \brief Singleton application-wide event queue. */
evqueue_t *s_evqueue = 0;
evqueue_t *evqueue_new()
{
evqueue_t* q = malloc(sizeof(evqueue_t));
/* Initialize fds. */
if (pipe(q->fds) < 0) {
free(q);
q = 0;
}
return q;
}
void evqueue_free(evqueue_t **q)
{
/* Check. */
if (!q) {
return;
}
/* Invalidate pointer to queue. */
evqueue_t *eq = *q;
*q = 0;
/* Deinitialize. */
close(eq->fds[EVQUEUE_READFD]);
close(eq->fds[EVQUEUE_WRITEFD]);
free(eq);
}
int evqueue_poll(evqueue_t *q, const struct timespec *ts,
const sigset_t *sigmask)
{
/* Check. */
if (!q) {
return -1;
}
/* Prepare fd set. */
fd_set rfds;
FD_ZERO(&rfds);
FD_SET(q->fds[EVQUEUE_READFD], &rfds);
/* Wait for events. */
int ret = pselect(q->fds[EVQUEUE_READFD] + 1, &rfds, 0, 0, ts, sigmask);
if (ret < 0) {
return -1;
}
return ret;
}
int evqueue_read(evqueue_t *q, void *dst, size_t len)
{
if (!q || !dst || len == 0) {
return -1;
}
return read(q->fds[EVQUEUE_READFD], dst, len);
}
int evqueue_write(evqueue_t *q, const void *src, size_t len)
{
if (!q || !src || len == 0) {
return -1;
}
return write(q->fds[EVQUEUE_WRITEFD], src, len);
}
int evqueue_get(evqueue_t *q, event_t *ev)
{
/* Check. */
if (!q || !ev) {
return -1;
}
/* Read data. */
int ret = evqueue_read(q, ev, sizeof(event_t));
if (ret != sizeof(event_t)) {
return -1;
}
/* Set parent. */
ev->parent = q;
return 0;
}
int evqueue_add(evqueue_t *q, const event_t *ev)
{
/* Check. */
if (!q || !ev) {
return -1;
}
/* Write data. */
int ret = evqueue_write(q, ev, sizeof(event_t));
if (ret != sizeof(event_t)) {
return -1;
}
return 0;
}
|
