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
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
|
/* $OpenBSD: file.c,v 1.2 2012/12/07 08:04:58 ratchov Exp $ */
/*
* Copyright (c) 2008-2012 Alexandre Ratchov <alex@caoua.org>
*
* Permission to use, copy, modify, and distribute this software for any
* purpose with or without fee is hereby granted, provided that the above
* copyright notice and this permission notice appear in all copies.
*
* THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES
* WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF
* MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR
* ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
* WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN
* ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF
* OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
*/
/*
* non-blocking file i/o module: each file can be read or written (or
* both). To achieve non-blocking io, we simply use the poll() syscall
* in an event loop and dispatch events to sub-modules.
*
* the module also provides trivial timeout implementation,
* derived from:
*
* anoncvs@moule.caoua.org:/midish
*
* midish/timo.c rev 1.18
* midish/mdep.c rev 1.71
*
* A timeout is used to schedule the call of a routine (the callback)
* there is a global list of timeouts that is processed inside the
* event loop. Timeouts work as follows:
*
* first the timo structure must be initialized with timo_set()
*
* then the timeout is scheduled (only once) with timo_add()
*
* if the timeout expires, the call-back is called; then it can
* be scheduled again if needed. It's OK to reschedule it again
* from the callback
*
* the timeout can be aborted with timo_del(), it is OK to try to
* abort a timout that has expired
*
*/
#include <sys/time.h>
#include <sys/types.h>
#include <err.h>
#include <errno.h>
#include <fcntl.h>
#include <poll.h>
#include <signal.h>
#include <stdio.h>
#include <stdlib.h>
#include <time.h>
#include "file.h"
#include "utils.h"
#define MAXFDS 100
#define TIMER_USEC 10000
struct timespec file_ts;
struct file *file_list;
struct timo *timo_queue;
unsigned int timo_abstime;
int file_slowaccept = 0, file_nfds;
#ifdef DEBUG
long long file_wtime, file_utime;
#endif
/*
* initialise a timeout structure, arguments are callback and argument
* that will be passed to the callback
*/
void
timo_set(struct timo *o, void (*cb)(void *), void *arg)
{
o->cb = cb;
o->arg = arg;
o->set = 0;
}
/*
* schedule the callback in 'delta' 24-th of microseconds. The timeout
* must not be already scheduled
*/
void
timo_add(struct timo *o, unsigned int delta)
{
struct timo **i;
unsigned int val;
int diff;
#ifdef DEBUG
if (o->set) {
log_puts("timo_add: already set\n");
panic();
}
if (delta == 0) {
log_puts("timo_add: zero timeout is evil\n");
panic();
}
#endif
val = timo_abstime + delta;
for (i = &timo_queue; *i != NULL; i = &(*i)->next) {
diff = (*i)->val - val;
if (diff > 0) {
break;
}
}
o->set = 1;
o->val = val;
o->next = *i;
*i = o;
}
/*
* abort a scheduled timeout
*/
void
timo_del(struct timo *o)
{
struct timo **i;
for (i = &timo_queue; *i != NULL; i = &(*i)->next) {
if (*i == o) {
*i = o->next;
o->set = 0;
return;
}
}
#ifdef DEBUG
if (log_level >= 4)
log_puts("timo_del: not found\n");
#endif
}
/*
* routine to be called by the timer when 'delta' 24-th of microsecond
* elapsed. This routine updates time referece used by timeouts and
* calls expired timeouts
*/
void
timo_update(unsigned int delta)
{
struct timo *to;
int diff;
/*
* update time reference
*/
timo_abstime += delta;
/*
* remove from the queue and run expired timeouts
*/
while (timo_queue != NULL) {
/*
* there is no overflow here because + and - are
* modulo 2^32, they are the same for both signed and
* unsigned integers
*/
diff = timo_queue->val - timo_abstime;
if (diff > 0)
break;
to = timo_queue;
timo_queue = to->next;
to->set = 0;
to->cb(to->arg);
}
}
/*
* initialize timeout queue
*/
void
timo_init(void)
{
timo_queue = NULL;
timo_abstime = 0;
}
/*
* destroy timeout queue
*/
void
timo_done(void)
{
#ifdef DEBUG
if (timo_queue != NULL) {
log_puts("timo_done: timo_queue not empty!\n");
panic();
}
#endif
timo_queue = (struct timo *)0xdeadbeef;
}
#ifdef DEBUG
void
file_log(struct file *f)
{
static char *states[] = { "ini", "bus", "clo", "zom" };
log_puts(f->ops->name);
if (log_level >= 3) {
log_puts("(");
log_puts(f->name);
log_puts("|");
log_puts(states[f->state]);
log_puts(")");
}
}
#endif
struct file *
file_new(struct fileops *ops, void *arg, char *name, unsigned int nfds)
{
struct file *f;
if (file_nfds + nfds > MAXFDS) {
#ifdef DEBUG
if (log_level >= 1) {
log_puts(name);
log_puts(": too many polled files\n");
}
#endif
return NULL;
}
f = xmalloc(sizeof(struct file));
f->nfds = nfds;
f->ops = ops;
f->arg = arg;
f->name = name;
f->state = FILE_INIT;
f->next = file_list;
file_list = f;
#ifdef DEBUG
if (log_level >= 3) {
file_log(f);
log_puts(": created\n");
}
#endif
file_nfds += f->nfds;
return f;
}
void
file_del(struct file *f)
{
#ifdef DEBUG
if (f->state == FILE_ZOMB) {
log_puts("bad state in file_del()\n");
panic();
}
#endif
file_nfds -= f->nfds;
f->state = FILE_ZOMB;
#ifdef DEBUG
if (log_level >= 3) {
file_log(f);
log_puts(": destroyed\n");
}
#endif
}
int
file_poll(void)
{
nfds_t nfds, n;
struct pollfd pfds[MAXFDS];
struct file *f, **pf;
struct timespec ts;
#ifdef DEBUG
struct timespec sleepts;
struct timespec ts0, ts1;
long us;
int i;
#endif
long long delta_nsec;
int revents, res;
/*
* cleanup zombies
*/
pf = &file_list;
while ((f = *pf) != NULL) {
if (f->state == FILE_ZOMB) {
*pf = f->next;
xfree(f);
} else
pf = &f->next;
}
if (file_list == NULL && timo_queue == NULL) {
#ifdef DEBUG
if (log_level >= 3)
log_puts("nothing to do...\n");
#endif
return 0;
}
log_flush();
#ifdef DEBUG
if (log_level >= 4)
log_puts("poll:");
#endif
nfds = 0;
for (f = file_list; f != NULL; f = f->next) {
#ifdef DEBUG
if (log_level >= 4) {
log_puts(" ");
file_log(f);
}
#endif
n = f->ops->pollfd(f->arg, pfds + nfds);
if (n == 0) {
f->pfd = NULL;
continue;
}
f->pfd = pfds + nfds;
nfds += n;
#ifdef DEBUG
if (log_level >= 4) {
log_puts("=");
for (i = 0; i < n; i++) {
if (i > 0)
log_puts(",");
log_putx(f->pfd[i].events);
}
}
#endif
}
#ifdef DEBUG
if (log_level >= 4)
log_puts("\n");
#endif
#ifdef DEBUG
clock_gettime(CLOCK_MONOTONIC, &sleepts);
file_utime += 1000000000LL * (sleepts.tv_sec - file_ts.tv_sec);
file_utime += sleepts.tv_nsec - file_ts.tv_nsec;
#endif
res = poll(pfds, nfds, -1);
if (res < 0 && errno != EINTR)
err(1, "poll");
#ifdef DEBUG
if (log_level >= 4) {
log_puts("poll: return:");
for (i = 0; i < nfds; i++) {
log_puts(" ");
log_putx(pfds[i].revents);
}
log_puts("\n");
}
#endif
clock_gettime(CLOCK_MONOTONIC, &ts);
#ifdef DEBUG
file_wtime += 1000000000LL * (ts.tv_sec - sleepts.tv_sec);
file_wtime += ts.tv_nsec - sleepts.tv_nsec;
#endif
delta_nsec = 1000000000LL * (ts.tv_sec - file_ts.tv_sec);
delta_nsec += ts.tv_nsec - file_ts.tv_nsec;
#ifdef DEBUG
if (delta_nsec < 0)
log_puts("file_poll: negative time interval\n");
#endif
file_ts = ts;
if (delta_nsec >= 0 && delta_nsec < 1000000000LL)
timo_update(delta_nsec / 1000);
else {
if (log_level >= 2)
log_puts("ignored huge clock delta\n");
}
if (res <= 0)
return 1;
for (f = file_list; f != NULL; f = f->next) {
if (f->pfd == NULL)
continue;
#ifdef DEBUG
clock_gettime(CLOCK_MONOTONIC, &ts0);
#endif
revents = f->ops->revents(f->arg, f->pfd);
if ((revents & POLLHUP) && (f->state != FILE_ZOMB))
f->ops->hup(f->arg);
if ((revents & POLLIN) && (f->state != FILE_ZOMB))
f->ops->in(f->arg);
if ((revents & POLLOUT) && (f->state != FILE_ZOMB))
f->ops->out(f->arg);
#ifdef DEBUG
clock_gettime(CLOCK_MONOTONIC, &ts1);
us = 1000000L * (ts1.tv_sec - ts0.tv_sec);
us += (ts1.tv_nsec - ts0.tv_nsec) / 1000;
if (log_level >= 4 || (log_level >= 3 && us >= 5000)) {
file_log(f);
log_puts(": processed in ");
log_putu(us);
log_puts("us\n");
}
#endif
}
return 1;
}
/*
* handler for SIGALRM, invoked periodically
*/
void
file_sigalrm(int i)
{
/* nothing to do, we only want poll() to return EINTR */
}
void
filelist_init(void)
{
static struct sigaction sa;
struct itimerval it;
sigset_t set;
sigemptyset(&set);
(void)sigaddset(&set, SIGPIPE);
if (sigprocmask(SIG_BLOCK, &set, NULL))
err(1, "sigprocmask");
file_list = NULL;
if (clock_gettime(CLOCK_MONOTONIC, &file_ts) < 0) {
perror("clock_gettime");
exit(1);
}
sa.sa_flags = SA_RESTART;
sa.sa_handler = file_sigalrm;
sigfillset(&sa.sa_mask);
if (sigaction(SIGALRM, &sa, NULL) < 0) {
perror("sigaction");
exit(1);
}
it.it_interval.tv_sec = 0;
it.it_interval.tv_usec = TIMER_USEC;
it.it_value.tv_sec = 0;
it.it_value.tv_usec = TIMER_USEC;
if (setitimer(ITIMER_REAL, &it, NULL) < 0) {
perror("setitimer");
exit(1);
}
log_sync = 0;
timo_init();
}
void
filelist_done(void)
{
struct itimerval it;
#ifdef DEBUG
struct file *f;
if (file_list != NULL) {
for (f = file_list; f != NULL; f = f->next) {
file_log(f);
log_puts(" not closed\n");
}
panic();
}
log_sync = 1;
log_flush();
#endif
timerclear(&it.it_value);
timerclear(&it.it_interval);
if (setitimer(ITIMER_REAL, &it, NULL) < 0) {
perror("setitimer");
exit(1);
}
timo_done();
}
|