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
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
|
/* 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 <config.h>
#include <stdlib.h>
#include <stdint.h>
#include <sys/time.h>
#include <pthread.h>
#include "tests/common/fdset_tests.h"
#include "common/fdset.h"
#define WRITE_PATTERN ((char) 0xde)
#define WRITE_PATTERN_LEN sizeof(char)
/* Subtract the `struct timeval' values X and Y,
storing the result in RESULT.
Return 1 if the difference is negative, otherwise 0.
Copyright http://www.delorie.com/gnu/docs/glibc/libc_428.html
*/
static int timeval_subtract (struct timeval *result, struct timeval *x, struct timeval* y)
{
/* Perform the carry for the later subtraction by updating y. */
if (x->tv_usec < y->tv_usec) {
int nsec = (y->tv_usec - x->tv_usec) / 1000000 + 1;
y->tv_usec -= 1000000 * nsec;
y->tv_sec += nsec;
}
if (x->tv_usec - y->tv_usec > 1000000) {
int nsec = (x->tv_usec - y->tv_usec) / 1000000;
y->tv_usec += 1000000 * nsec;
y->tv_sec -= nsec;
}
/* Compute the time remaining to wait.
tv_usec is certainly positive. */
result->tv_sec = x->tv_sec - y->tv_sec;
result->tv_usec = x->tv_usec - y->tv_usec;
/* Return 1 if result is negative. */
return x->tv_sec < y->tv_sec;
}
static size_t timeval_diff(struct timeval *from, struct timeval *to) {
struct timeval res;
timeval_subtract(&res, to, from);
return res.tv_sec*1000 + res.tv_usec/1000;
}
static int fdset_tests_count(int argc, char *argv[]);
static int fdset_tests_run(int argc, char *argv[]);
/*! Exported unit API.
*/
unit_api fdset_tests_api = {
"Native fdset poll wrapper", //! Unit name
&fdset_tests_count, //! Count scheduled tests
&fdset_tests_run //! Run scheduled tests
};
void* thr_action(void *arg)
{
int *fd = (int *)arg;
/* Sleep for 100ms. */
struct timeval tv;
tv.tv_sec = 0;
tv.tv_usec = 100 * 1000; // 100ms
select(0, 0, 0, 0, &tv);
/* Write pattern. */
char pattern = WRITE_PATTERN;
if (write(*fd, &pattern, WRITE_PATTERN_LEN) == -1) {
// Error.
}
return NULL;
}
static int fdset_tests_count(int argc, char *argv[])
{
return 11;
}
static int fdset_tests_run(int argc, char *argv[])
{
/* 1. Create fdset. */
fdset_t set;
int ret = fdset_init(&set, 32);
ok(ret == 0, "fdset: init");
/* 2. Create pipe. */
int fds[2], tmpfds[2];
ret = pipe(fds);
ok(ret >= 0, "fdset: pipe() works");
ret = pipe(tmpfds);
/* 3. Add fd to set. */
ret = fdset_add(&set, fds[0], POLLIN, NULL);
ok(ret == 0, "fdset: add to set works");
fdset_add(&set, tmpfds[0], POLLIN, NULL);
/* Schedule write. */
struct timeval ts, te;
gettimeofday(&ts, 0);
pthread_t t;
pthread_create(&t, 0, thr_action, &fds[1]);
/* 4. Watch fdset. */
int nfds = poll(set.pfd, set.n, 2000);
gettimeofday(&te, 0);
size_t diff = timeval_diff(&ts, &te);
ok(nfds > 0 && diff > 99 && diff < 10000,
"fdset: poll returned %d events in %zu ms", nfds, diff);
/* 5. Prepare event set. */
ok(set.pfd[0].revents & POLLIN, "fdset: pipe is active");
/* 6. Receive data. */
char buf = 0x00;
ret = read(set.pfd[0].fd, &buf, WRITE_PATTERN_LEN);
ok(ret >= 0 && buf == WRITE_PATTERN, "fdset: contains valid data");
/* 7-9. Remove from event set. */
ret = fdset_remove(&set, 0);
ok(ret == 0, "fdset: remove from fdset works");
close(fds[0]);
close(fds[1]);
ret = fdset_remove(&set, 0);
close(tmpfds[1]);
close(tmpfds[1]);
ok(ret == 0, "fdset: remove from fdset works (2)");
ret = fdset_remove(&set, 0);
ok(ret != 0, "fdset: removing nonexistent item");
/* 10. Crash test. */
lives_ok({
fdset_init(0, 0);
fdset_add(0, 1, 1, 0);
fdset_add(0, 0, 1, 0);
fdset_remove(0, 1);
fdset_remove(0, 0);
}, "fdset: crash test successful");
/* 11. Destroy fdset. */
ret = fdset_clear(&set);
ok(ret == 0, "fdset: destroyed");
/* Cleanup. */
pthread_join(t, 0);
return 0;
}
|
