ViewVC Help
View File | Revision Log | Show Annotations | Download File
/cvs/libeio/eio.c
Revision: 1.72
Committed: Fri Jun 10 12:45:20 2011 UTC (12 years, 11 months ago) by root
Content type: text/plain
Branch: MAIN
Changes since 1.71: +116 -78 lines
Log Message:
*** empty log message ***

File Contents

# Content
1 /*
2 * libeio implementation
3 *
4 * Copyright (c) 2007,2008,2009,2010,2011 Marc Alexander Lehmann <libeio@schmorp.de>
5 * All rights reserved.
6 *
7 * Redistribution and use in source and binary forms, with or without modifica-
8 * tion, are permitted provided that the following conditions are met:
9 *
10 * 1. Redistributions of source code must retain the above copyright notice,
11 * this list of conditions and the following disclaimer.
12 *
13 * 2. Redistributions in binary form must reproduce the above copyright
14 * notice, this list of conditions and the following disclaimer in the
15 * documentation and/or other materials provided with the distribution.
16 *
17 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR IMPLIED
18 * WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MER-
19 * CHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO
20 * EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPE-
21 * CIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
22 * PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS;
23 * OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY,
24 * WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTH-
25 * ERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED
26 * OF THE POSSIBILITY OF SUCH DAMAGE.
27 *
28 * Alternatively, the contents of this file may be used under the terms of
29 * the GNU General Public License ("GPL") version 2 or any later version,
30 * in which case the provisions of the GPL are applicable instead of
31 * the above. If you wish to allow the use of your version of this file
32 * only under the terms of the GPL and not to allow others to use your
33 * version of this file under the BSD license, indicate your decision
34 * by deleting the provisions above and replace them with the notice
35 * and other provisions required by the GPL. If you do not delete the
36 * provisions above, a recipient may use your version of this file under
37 * either the BSD or the GPL.
38 */
39
40 #ifndef _WIN32
41 # include "config.h"
42 #endif
43
44 #include "eio.h"
45 #include "ecb.h"
46
47 #ifdef EIO_STACKSIZE
48 # define XTHREAD_STACKSIZE EIO_STACKSIZE
49 #endif
50 #include "xthread.h"
51
52 #include <errno.h>
53 #include <stddef.h>
54 #include <stdlib.h>
55 #include <string.h>
56 #include <errno.h>
57 #include <sys/types.h>
58 #include <sys/stat.h>
59 #include <sys/statvfs.h>
60 #include <limits.h>
61 #include <fcntl.h>
62 #include <assert.h>
63
64 /* intptr_t comes from unistd.h, says POSIX/UNIX/tradition */
65 /* intptr_t only comes form stdint.h, says idiot openbsd coder */
66 #if HAVE_STDINT_H
67 # include <stdint.h>
68 #endif
69
70 #ifndef EIO_FINISH
71 # define EIO_FINISH(req) ((req)->finish) && !EIO_CANCELLED (req) ? (req)->finish (req) : 0
72 #endif
73
74 #ifndef EIO_DESTROY
75 # define EIO_DESTROY(req) do { if ((req)->destroy) (req)->destroy (req); } while (0)
76 #endif
77
78 #ifndef EIO_FEED
79 # define EIO_FEED(req) do { if ((req)->feed ) (req)->feed (req); } while (0)
80 #endif
81
82 #ifdef _WIN32
83
84 /*doh*/
85 #else
86
87 # include <sys/time.h>
88 # include <sys/select.h>
89 # include <unistd.h>
90 # include <utime.h>
91 # include <signal.h>
92 # include <dirent.h>
93
94 #if _POSIX_MEMLOCK || _POSIX_MEMLOCK_RANGE || _POSIX_MAPPED_FILES
95 # include <sys/mman.h>
96 #endif
97
98 /* POSIX_SOURCE is useless on bsd's, and XOPEN_SOURCE is unreliable there, too */
99 # if __FreeBSD__ || defined __NetBSD__ || defined __OpenBSD__
100 # define _DIRENT_HAVE_D_TYPE /* sigh */
101 # define D_INO(de) (de)->d_fileno
102 # define D_NAMLEN(de) (de)->d_namlen
103 # elif __linux || defined d_ino || _XOPEN_SOURCE >= 600
104 # define D_INO(de) (de)->d_ino
105 # endif
106
107 #ifdef _D_EXACT_NAMLEN
108 # undef D_NAMLEN
109 # define D_NAMLEN(de) _D_EXACT_NAMLEN (de)
110 #endif
111
112 # ifdef _DIRENT_HAVE_D_TYPE
113 # define D_TYPE(de) (de)->d_type
114 # endif
115
116 # ifndef EIO_STRUCT_DIRENT
117 # define EIO_STRUCT_DIRENT struct dirent
118 # endif
119
120 #endif
121
122 #if HAVE_SENDFILE
123 # if __linux
124 # include <sys/sendfile.h>
125 # elif __FreeBSD__ || defined __APPLE__
126 # include <sys/socket.h>
127 # include <sys/uio.h>
128 # elif __hpux
129 # include <sys/socket.h>
130 # elif __solaris
131 # include <sys/sendfile.h>
132 # else
133 # error sendfile support requested but not available
134 # endif
135 #endif
136
137 #ifndef D_TYPE
138 # define D_TYPE(de) 0
139 #endif
140 #ifndef D_INO
141 # define D_INO(de) 0
142 #endif
143 #ifndef D_NAMLEN
144 # define D_NAMLEN(de) strlen ((de)->d_name)
145 #endif
146
147 /* used for struct dirent, AIX doesn't provide it */
148 #ifndef NAME_MAX
149 # define NAME_MAX 4096
150 #endif
151
152 /* used for readlink etc. */
153 #ifndef PATH_MAX
154 # define PATH_MAX 4096
155 #endif
156
157 /* buffer size for various temporary buffers */
158 #define EIO_BUFSIZE 65536
159
160 #define dBUF \
161 char *eio_buf; \
162 ETP_WORKER_LOCK (self); \
163 self->dbuf = eio_buf = malloc (EIO_BUFSIZE); \
164 ETP_WORKER_UNLOCK (self); \
165 errno = ENOMEM; \
166 if (!eio_buf) \
167 return -1;
168
169 #define EIO_TICKS ((1000000 + 1023) >> 10)
170
171 #define ETP_PRI_MIN EIO_PRI_MIN
172 #define ETP_PRI_MAX EIO_PRI_MAX
173
174 struct etp_worker;
175
176 #define ETP_REQ eio_req
177 #define ETP_DESTROY(req) eio_destroy (req)
178 static int eio_finish (eio_req *req);
179 #define ETP_FINISH(req) eio_finish (req)
180 static void eio_execute (struct etp_worker *self, eio_req *req);
181 #define ETP_EXECUTE(wrk,req) eio_execute (wrk,req)
182
183 #define ETP_WORKER_CLEAR(req) \
184 if (wrk->dbuf) \
185 { \
186 free (wrk->dbuf); \
187 wrk->dbuf = 0; \
188 } \
189 \
190 if (wrk->dirp) \
191 { \
192 closedir (wrk->dirp); \
193 wrk->dirp = 0; \
194 }
195
196 #define ETP_WORKER_COMMON \
197 void *dbuf; \
198 DIR *dirp;
199
200 /*****************************************************************************/
201
202 #define ETP_NUM_PRI (ETP_PRI_MAX - ETP_PRI_MIN + 1)
203
204 /* calculate time difference in ~1/EIO_TICKS of a second */
205 ECB_INLINE int
206 tvdiff (struct timeval *tv1, struct timeval *tv2)
207 {
208 return (tv2->tv_sec - tv1->tv_sec ) * EIO_TICKS
209 + ((tv2->tv_usec - tv1->tv_usec) >> 10);
210 }
211
212 static unsigned int started, idle, wanted = 4;
213
214 static void (*want_poll_cb) (void);
215 static void (*done_poll_cb) (void);
216
217 static unsigned int max_poll_time; /* reslock */
218 static unsigned int max_poll_reqs; /* reslock */
219
220 static volatile unsigned int nreqs; /* reqlock */
221 static volatile unsigned int nready; /* reqlock */
222 static volatile unsigned int npending; /* reqlock */
223 static volatile unsigned int max_idle = 4; /* maximum number of threads that can idle indefinitely */
224 static volatile unsigned int idle_timeout = 10; /* number of seconds after which an idle threads exit */
225
226 static xmutex_t wrklock;
227 static xmutex_t reslock;
228 static xmutex_t reqlock;
229 static xcond_t reqwait;
230
231 #if !HAVE_PREADWRITE
232 /*
233 * make our pread/pwrite emulation safe against themselves, but not against
234 * normal read/write by using a mutex. slows down execution a lot,
235 * but that's your problem, not mine.
236 */
237 static xmutex_t preadwritelock = X_MUTEX_INIT;
238 #endif
239
240 typedef struct etp_worker
241 {
242 /* locked by wrklock */
243 struct etp_worker *prev, *next;
244
245 xthread_t tid;
246
247 /* locked by reslock, reqlock or wrklock */
248 ETP_REQ *req; /* currently processed request */
249
250 ETP_WORKER_COMMON
251 } etp_worker;
252
253 static etp_worker wrk_first = { &wrk_first, &wrk_first, 0 }; /* NOT etp */
254
255 #define ETP_WORKER_LOCK(wrk) X_LOCK (wrklock)
256 #define ETP_WORKER_UNLOCK(wrk) X_UNLOCK (wrklock)
257
258 /* worker threads management */
259
260 static void ecb_cold
261 etp_worker_clear (etp_worker *wrk)
262 {
263 ETP_WORKER_CLEAR (wrk);
264 }
265
266 static void ecb_cold
267 etp_worker_free (etp_worker *wrk)
268 {
269 wrk->next->prev = wrk->prev;
270 wrk->prev->next = wrk->next;
271
272 free (wrk);
273 }
274
275 static unsigned int
276 etp_nreqs (void)
277 {
278 int retval;
279 if (WORDACCESS_UNSAFE) X_LOCK (reqlock);
280 retval = nreqs;
281 if (WORDACCESS_UNSAFE) X_UNLOCK (reqlock);
282 return retval;
283 }
284
285 static unsigned int
286 etp_nready (void)
287 {
288 unsigned int retval;
289
290 if (WORDACCESS_UNSAFE) X_LOCK (reqlock);
291 retval = nready;
292 if (WORDACCESS_UNSAFE) X_UNLOCK (reqlock);
293
294 return retval;
295 }
296
297 static unsigned int
298 etp_npending (void)
299 {
300 unsigned int retval;
301
302 if (WORDACCESS_UNSAFE) X_LOCK (reqlock);
303 retval = npending;
304 if (WORDACCESS_UNSAFE) X_UNLOCK (reqlock);
305
306 return retval;
307 }
308
309 static unsigned int
310 etp_nthreads (void)
311 {
312 unsigned int retval;
313
314 if (WORDACCESS_UNSAFE) X_LOCK (reqlock);
315 retval = started;
316 if (WORDACCESS_UNSAFE) X_UNLOCK (reqlock);
317
318 return retval;
319 }
320
321 /*
322 * a somewhat faster data structure might be nice, but
323 * with 8 priorities this actually needs <20 insns
324 * per shift, the most expensive operation.
325 */
326 typedef struct {
327 ETP_REQ *qs[ETP_NUM_PRI], *qe[ETP_NUM_PRI]; /* qstart, qend */
328 int size;
329 } etp_reqq;
330
331 static etp_reqq req_queue;
332 static etp_reqq res_queue;
333
334 static int ecb_noinline
335 reqq_push (etp_reqq *q, ETP_REQ *req)
336 {
337 int pri = req->pri;
338 req->next = 0;
339
340 if (q->qe[pri])
341 {
342 q->qe[pri]->next = req;
343 q->qe[pri] = req;
344 }
345 else
346 q->qe[pri] = q->qs[pri] = req;
347
348 return q->size++;
349 }
350
351 static ETP_REQ * ecb_noinline
352 reqq_shift (etp_reqq *q)
353 {
354 int pri;
355
356 if (!q->size)
357 return 0;
358
359 --q->size;
360
361 for (pri = ETP_NUM_PRI; pri--; )
362 {
363 eio_req *req = q->qs[pri];
364
365 if (req)
366 {
367 if (!(q->qs[pri] = (eio_req *)req->next))
368 q->qe[pri] = 0;
369
370 return req;
371 }
372 }
373
374 abort ();
375 }
376
377 static void ecb_cold
378 etp_thread_init (void)
379 {
380 X_MUTEX_CREATE (wrklock);
381 X_MUTEX_CREATE (reslock);
382 X_MUTEX_CREATE (reqlock);
383 X_COND_CREATE (reqwait);
384 }
385
386 static void ecb_cold
387 etp_atfork_prepare (void)
388 {
389 X_LOCK (wrklock);
390 X_LOCK (reqlock);
391 X_LOCK (reslock);
392 #if !HAVE_PREADWRITE
393 X_LOCK (preadwritelock);
394 #endif
395 }
396
397 static void ecb_cold
398 etp_atfork_parent (void)
399 {
400 #if !HAVE_PREADWRITE
401 X_UNLOCK (preadwritelock);
402 #endif
403 X_UNLOCK (reslock);
404 X_UNLOCK (reqlock);
405 X_UNLOCK (wrklock);
406 }
407
408 static void ecb_cold
409 etp_atfork_child (void)
410 {
411 ETP_REQ *prv;
412
413 while ((prv = reqq_shift (&req_queue)))
414 ETP_DESTROY (prv);
415
416 while ((prv = reqq_shift (&res_queue)))
417 ETP_DESTROY (prv);
418
419 while (wrk_first.next != &wrk_first)
420 {
421 etp_worker *wrk = wrk_first.next;
422
423 if (wrk->req)
424 ETP_DESTROY (wrk->req);
425
426 etp_worker_clear (wrk);
427 etp_worker_free (wrk);
428 }
429
430 started = 0;
431 idle = 0;
432 nreqs = 0;
433 nready = 0;
434 npending = 0;
435
436 etp_thread_init ();
437 }
438
439 static void ecb_cold
440 etp_once_init (void)
441 {
442 etp_thread_init ();
443 X_THREAD_ATFORK (etp_atfork_prepare, etp_atfork_parent, etp_atfork_child);
444 }
445
446 static int ecb_cold
447 etp_init (void (*want_poll)(void), void (*done_poll)(void))
448 {
449 static pthread_once_t doinit = PTHREAD_ONCE_INIT;
450
451 pthread_once (&doinit, etp_once_init);
452
453 want_poll_cb = want_poll;
454 done_poll_cb = done_poll;
455
456 return 0;
457 }
458
459 X_THREAD_PROC (etp_proc);
460
461 static void ecb_cold
462 etp_start_thread (void)
463 {
464 etp_worker *wrk = calloc (1, sizeof (etp_worker));
465
466 /*TODO*/
467 assert (("unable to allocate worker thread data", wrk));
468
469 X_LOCK (wrklock);
470
471 if (thread_create (&wrk->tid, etp_proc, (void *)wrk))
472 {
473 wrk->prev = &wrk_first;
474 wrk->next = wrk_first.next;
475 wrk_first.next->prev = wrk;
476 wrk_first.next = wrk;
477 ++started;
478 }
479 else
480 free (wrk);
481
482 X_UNLOCK (wrklock);
483 }
484
485 static void
486 etp_maybe_start_thread (void)
487 {
488 if (ecb_expect_true (etp_nthreads () >= wanted))
489 return;
490
491 /* todo: maybe use idle here, but might be less exact */
492 if (ecb_expect_true (0 <= (int)etp_nthreads () + (int)etp_npending () - (int)etp_nreqs ()))
493 return;
494
495 etp_start_thread ();
496 }
497
498 static void ecb_cold
499 etp_end_thread (void)
500 {
501 eio_req *req = calloc (1, sizeof (eio_req));
502
503 req->type = -1;
504 req->pri = ETP_PRI_MAX - ETP_PRI_MIN;
505
506 X_LOCK (reqlock);
507 reqq_push (&req_queue, req);
508 X_COND_SIGNAL (reqwait);
509 X_UNLOCK (reqlock);
510
511 X_LOCK (wrklock);
512 --started;
513 X_UNLOCK (wrklock);
514 }
515
516 static int
517 etp_poll (void)
518 {
519 unsigned int maxreqs;
520 unsigned int maxtime;
521 struct timeval tv_start, tv_now;
522
523 X_LOCK (reslock);
524 maxreqs = max_poll_reqs;
525 maxtime = max_poll_time;
526 X_UNLOCK (reslock);
527
528 if (maxtime)
529 gettimeofday (&tv_start, 0);
530
531 for (;;)
532 {
533 ETP_REQ *req;
534
535 etp_maybe_start_thread ();
536
537 X_LOCK (reslock);
538 req = reqq_shift (&res_queue);
539
540 if (req)
541 {
542 --npending;
543
544 if (!res_queue.size && done_poll_cb)
545 done_poll_cb ();
546 }
547
548 X_UNLOCK (reslock);
549
550 if (!req)
551 return 0;
552
553 X_LOCK (reqlock);
554 --nreqs;
555 X_UNLOCK (reqlock);
556
557 if (ecb_expect_false (req->type == EIO_GROUP && req->size))
558 {
559 req->int1 = 1; /* mark request as delayed */
560 continue;
561 }
562 else
563 {
564 int res = ETP_FINISH (req);
565 if (ecb_expect_false (res))
566 return res;
567 }
568
569 if (ecb_expect_false (maxreqs && !--maxreqs))
570 break;
571
572 if (maxtime)
573 {
574 gettimeofday (&tv_now, 0);
575
576 if (tvdiff (&tv_start, &tv_now) >= maxtime)
577 break;
578 }
579 }
580
581 errno = EAGAIN;
582 return -1;
583 }
584
585 static void
586 etp_cancel (ETP_REQ *req)
587 {
588 X_LOCK (wrklock);
589 req->flags |= EIO_FLAG_CANCELLED;
590 X_UNLOCK (wrklock);
591
592 eio_grp_cancel (req);
593 }
594
595 static void
596 etp_submit (ETP_REQ *req)
597 {
598 req->pri -= ETP_PRI_MIN;
599
600 if (ecb_expect_false (req->pri < ETP_PRI_MIN - ETP_PRI_MIN)) req->pri = ETP_PRI_MIN - ETP_PRI_MIN;
601 if (ecb_expect_false (req->pri > ETP_PRI_MAX - ETP_PRI_MIN)) req->pri = ETP_PRI_MAX - ETP_PRI_MIN;
602
603 if (ecb_expect_false (req->type == EIO_GROUP))
604 {
605 /* I hope this is worth it :/ */
606 X_LOCK (reqlock);
607 ++nreqs;
608 X_UNLOCK (reqlock);
609
610 X_LOCK (reslock);
611
612 ++npending;
613
614 if (!reqq_push (&res_queue, req) && want_poll_cb)
615 want_poll_cb ();
616
617 X_UNLOCK (reslock);
618 }
619 else
620 {
621 X_LOCK (reqlock);
622 ++nreqs;
623 ++nready;
624 reqq_push (&req_queue, req);
625 X_COND_SIGNAL (reqwait);
626 X_UNLOCK (reqlock);
627
628 etp_maybe_start_thread ();
629 }
630 }
631
632 static void ecb_cold
633 etp_set_max_poll_time (double nseconds)
634 {
635 if (WORDACCESS_UNSAFE) X_LOCK (reslock);
636 max_poll_time = nseconds * EIO_TICKS;
637 if (WORDACCESS_UNSAFE) X_UNLOCK (reslock);
638 }
639
640 static void ecb_cold
641 etp_set_max_poll_reqs (unsigned int maxreqs)
642 {
643 if (WORDACCESS_UNSAFE) X_LOCK (reslock);
644 max_poll_reqs = maxreqs;
645 if (WORDACCESS_UNSAFE) X_UNLOCK (reslock);
646 }
647
648 static void ecb_cold
649 etp_set_max_idle (unsigned int nthreads)
650 {
651 if (WORDACCESS_UNSAFE) X_LOCK (reqlock);
652 max_idle = nthreads;
653 if (WORDACCESS_UNSAFE) X_UNLOCK (reqlock);
654 }
655
656 static void ecb_cold
657 etp_set_idle_timeout (unsigned int seconds)
658 {
659 if (WORDACCESS_UNSAFE) X_LOCK (reqlock);
660 idle_timeout = seconds;
661 if (WORDACCESS_UNSAFE) X_UNLOCK (reqlock);
662 }
663
664 static void ecb_cold
665 etp_set_min_parallel (unsigned int nthreads)
666 {
667 if (wanted < nthreads)
668 wanted = nthreads;
669 }
670
671 static void ecb_cold
672 etp_set_max_parallel (unsigned int nthreads)
673 {
674 if (wanted > nthreads)
675 wanted = nthreads;
676
677 while (started > wanted)
678 etp_end_thread ();
679 }
680
681 /*****************************************************************************/
682
683 static void
684 grp_try_feed (eio_req *grp)
685 {
686 while (grp->size < grp->int2 && !EIO_CANCELLED (grp))
687 {
688 grp->flags &= ~EIO_FLAG_GROUPADD;
689
690 EIO_FEED (grp);
691
692 /* stop if no progress has been made */
693 if (!(grp->flags & EIO_FLAG_GROUPADD))
694 {
695 grp->feed = 0;
696 break;
697 }
698 }
699 }
700
701 static int
702 grp_dec (eio_req *grp)
703 {
704 --grp->size;
705
706 /* call feeder, if applicable */
707 grp_try_feed (grp);
708
709 /* finish, if done */
710 if (!grp->size && grp->int1)
711 return eio_finish (grp);
712 else
713 return 0;
714 }
715
716 void
717 eio_destroy (eio_req *req)
718 {
719 if ((req)->flags & EIO_FLAG_PTR1_FREE) free (req->ptr1);
720 if ((req)->flags & EIO_FLAG_PTR2_FREE) free (req->ptr2);
721
722 EIO_DESTROY (req);
723 }
724
725 static int
726 eio_finish (eio_req *req)
727 {
728 int res = EIO_FINISH (req);
729
730 if (req->grp)
731 {
732 int res2;
733 eio_req *grp = req->grp;
734
735 /* unlink request */
736 if (req->grp_next) req->grp_next->grp_prev = req->grp_prev;
737 if (req->grp_prev) req->grp_prev->grp_next = req->grp_next;
738
739 if (grp->grp_first == req)
740 grp->grp_first = req->grp_next;
741
742 res2 = grp_dec (grp);
743
744 if (!res && res2)
745 res = res2;
746 }
747
748 eio_destroy (req);
749
750 return res;
751 }
752
753 void
754 eio_grp_cancel (eio_req *grp)
755 {
756 for (grp = grp->grp_first; grp; grp = grp->grp_next)
757 eio_cancel (grp);
758 }
759
760 void
761 eio_cancel (eio_req *req)
762 {
763 etp_cancel (req);
764 }
765
766 void
767 eio_submit (eio_req *req)
768 {
769 etp_submit (req);
770 }
771
772 unsigned int
773 eio_nreqs (void)
774 {
775 return etp_nreqs ();
776 }
777
778 unsigned int
779 eio_nready (void)
780 {
781 return etp_nready ();
782 }
783
784 unsigned int
785 eio_npending (void)
786 {
787 return etp_npending ();
788 }
789
790 unsigned int ecb_cold
791 eio_nthreads (void)
792 {
793 return etp_nthreads ();
794 }
795
796 void ecb_cold
797 eio_set_max_poll_time (double nseconds)
798 {
799 etp_set_max_poll_time (nseconds);
800 }
801
802 void ecb_cold
803 eio_set_max_poll_reqs (unsigned int maxreqs)
804 {
805 etp_set_max_poll_reqs (maxreqs);
806 }
807
808 void ecb_cold
809 eio_set_max_idle (unsigned int nthreads)
810 {
811 etp_set_max_idle (nthreads);
812 }
813
814 void ecb_cold
815 eio_set_idle_timeout (unsigned int seconds)
816 {
817 etp_set_idle_timeout (seconds);
818 }
819
820 void ecb_cold
821 eio_set_min_parallel (unsigned int nthreads)
822 {
823 etp_set_min_parallel (nthreads);
824 }
825
826 void ecb_cold
827 eio_set_max_parallel (unsigned int nthreads)
828 {
829 etp_set_max_parallel (nthreads);
830 }
831
832 int eio_poll (void)
833 {
834 return etp_poll ();
835 }
836
837 /*****************************************************************************/
838 /* work around various missing functions */
839
840 #if !HAVE_PREADWRITE
841 # undef pread
842 # undef pwrite
843 # define pread eio__pread
844 # define pwrite eio__pwrite
845
846 static ssize_t
847 eio__pread (int fd, void *buf, size_t count, off_t offset)
848 {
849 ssize_t res;
850 off_t ooffset;
851
852 X_LOCK (preadwritelock);
853 ooffset = lseek (fd, 0, SEEK_CUR);
854 lseek (fd, offset, SEEK_SET);
855 res = read (fd, buf, count);
856 lseek (fd, ooffset, SEEK_SET);
857 X_UNLOCK (preadwritelock);
858
859 return res;
860 }
861
862 static ssize_t
863 eio__pwrite (int fd, void *buf, size_t count, off_t offset)
864 {
865 ssize_t res;
866 off_t ooffset;
867
868 X_LOCK (preadwritelock);
869 ooffset = lseek (fd, 0, SEEK_CUR);
870 lseek (fd, offset, SEEK_SET);
871 res = write (fd, buf, count);
872 lseek (fd, ooffset, SEEK_SET);
873 X_UNLOCK (preadwritelock);
874
875 return res;
876 }
877 #endif
878
879 #ifndef HAVE_UTIMES
880
881 # undef utimes
882 # define utimes(path,times) eio__utimes (path, times)
883
884 static int
885 eio__utimes (const char *filename, const struct timeval times[2])
886 {
887 if (times)
888 {
889 struct utimbuf buf;
890
891 buf.actime = times[0].tv_sec;
892 buf.modtime = times[1].tv_sec;
893
894 return utime (filename, &buf);
895 }
896 else
897 return utime (filename, 0);
898 }
899
900 #endif
901
902 #ifndef HAVE_FUTIMES
903
904 # undef futimes
905 # define futimes(fd,times) eio__futimes (fd, times)
906
907 static int
908 eio__futimes (int fd, const struct timeval tv[2])
909 {
910 errno = ENOSYS;
911 return -1;
912 }
913
914 #endif
915
916 #if !HAVE_FDATASYNC
917 # undef fdatasync
918 # define fdatasync(fd) fsync (fd)
919 #endif
920
921 /* sync_file_range always needs emulation */
922 static int
923 eio__sync_file_range (int fd, off_t offset, size_t nbytes, unsigned int flags)
924 {
925 #if HAVE_SYNC_FILE_RANGE
926 int res;
927
928 if (EIO_SYNC_FILE_RANGE_WAIT_BEFORE != SYNC_FILE_RANGE_WAIT_BEFORE
929 || EIO_SYNC_FILE_RANGE_WRITE != SYNC_FILE_RANGE_WRITE
930 || EIO_SYNC_FILE_RANGE_WAIT_AFTER != SYNC_FILE_RANGE_WAIT_AFTER)
931 {
932 flags = 0
933 | (flags & EIO_SYNC_FILE_RANGE_WAIT_BEFORE ? SYNC_FILE_RANGE_WAIT_BEFORE : 0)
934 | (flags & EIO_SYNC_FILE_RANGE_WRITE ? SYNC_FILE_RANGE_WRITE : 0)
935 | (flags & EIO_SYNC_FILE_RANGE_WAIT_AFTER ? SYNC_FILE_RANGE_WAIT_AFTER : 0);
936 }
937
938 res = sync_file_range (fd, offset, nbytes, flags);
939
940 if (!res || errno != ENOSYS)
941 return res;
942 #endif
943
944 /* even though we could play tricks with the flags, it's better to always
945 * call fdatasync, as that matches the expectation of its users best */
946 return fdatasync (fd);
947 }
948
949 #if !HAVE_READAHEAD
950 # undef readahead
951 # define readahead(fd,offset,count) eio__readahead (fd, offset, count, self)
952
953 static ssize_t
954 eio__readahead (int fd, off_t offset, size_t count, etp_worker *self)
955 {
956 size_t todo = count;
957 dBUF;
958
959 while (todo > 0)
960 {
961 size_t len = todo < EIO_BUFSIZE ? todo : EIO_BUFSIZE;
962
963 pread (fd, eio_buf, len, offset);
964 offset += len;
965 todo -= len;
966 }
967
968 errno = 0;
969 return count;
970 }
971
972 #endif
973
974 /* sendfile always needs emulation */
975 static ssize_t
976 eio__sendfile (int ofd, int ifd, off_t offset, size_t count, etp_worker *self)
977 {
978 ssize_t written = 0;
979 ssize_t res;
980
981 if (!count)
982 return 0;
983
984 for (;;)
985 {
986 #if HAVE_SENDFILE
987 # if __linux
988 off_t soffset = offset;
989 res = sendfile (ofd, ifd, &soffset, count);
990
991 # elif __FreeBSD__
992 /*
993 * Of course, the freebsd sendfile is a dire hack with no thoughts
994 * wasted on making it similar to other I/O functions.
995 */
996 off_t sbytes;
997 res = sendfile (ifd, ofd, offset, count, 0, &sbytes, 0);
998
999 #if 0 /* according to the manpage, this is correct, but broken behaviour */
1000 /* freebsd' sendfile will return 0 on success */
1001 /* freebsd 8 documents it as only setting *sbytes on EINTR and EAGAIN, but */
1002 /* not on e.g. EIO or EPIPE - sounds broken */
1003 if ((res < 0 && (errno == EAGAIN || errno == EINTR) && sbytes) || res == 0)
1004 res = sbytes;
1005 #endif
1006
1007 /* according to source inspection, this is correct, and useful behaviour */
1008 if (sbytes)
1009 res = sbytes;
1010
1011 # elif defined (__APPLE__)
1012 off_t sbytes = count;
1013 res = sendfile (ifd, ofd, offset, &sbytes, 0, 0);
1014
1015 /* according to the manpage, sbytes is always valid */
1016 if (sbytes)
1017 res = sbytes;
1018
1019 # elif __hpux
1020 res = sendfile (ofd, ifd, offset, count, 0, 0);
1021
1022 # elif __solaris
1023 struct sendfilevec vec;
1024 size_t sbytes;
1025
1026 vec.sfv_fd = ifd;
1027 vec.sfv_flag = 0;
1028 vec.sfv_off = offset;
1029 vec.sfv_len = count;
1030
1031 res = sendfilev (ofd, &vec, 1, &sbytes);
1032
1033 if (res < 0 && sbytes)
1034 res = sbytes;
1035
1036 # endif
1037
1038 #elif defined (_WIN32)
1039 /* does not work, just for documentation of what would need to be done */
1040 /* actually, cannot be done like this, as TransmitFile changes the file offset, */
1041 /* libeio guarantees that the file offset does not change, and windows */
1042 /* has no way to get an independent handle to the same file description */
1043 HANDLE h = TO_SOCKET (ifd);
1044 SetFilePointer (h, offset, 0, FILE_BEGIN);
1045 res = TransmitFile (TO_SOCKET (ofd), h, count, 0, 0, 0, 0);
1046
1047 #else
1048 res = -1;
1049 errno = ENOSYS;
1050 #endif
1051
1052 /* we assume sendfile can copy at least 128mb in one go */
1053 if (res <= 128 * 1024 * 1024)
1054 {
1055 if (res > 0)
1056 written += res;
1057
1058 if (written)
1059 return written;
1060
1061 break;
1062 }
1063 else
1064 {
1065 /* if we requested more, then probably the kernel was lazy */
1066 written += res;
1067 offset += res;
1068 count -= res;
1069
1070 if (!count)
1071 return written;
1072 }
1073 }
1074
1075 if (res < 0
1076 && (errno == ENOSYS || errno == EINVAL || errno == ENOTSOCK
1077 /* BSDs */
1078 #ifdef ENOTSUP /* sigh, if the steenking pile called openbsd would only try to at least compile posix code... */
1079 || errno == ENOTSUP
1080 #endif
1081 || errno == EOPNOTSUPP /* BSDs */
1082 #if __solaris
1083 || errno == EAFNOSUPPORT || errno == EPROTOTYPE
1084 #endif
1085 )
1086 )
1087 {
1088 /* emulate sendfile. this is a major pain in the ass */
1089 dBUF;
1090
1091 res = 0;
1092
1093 while (count)
1094 {
1095 ssize_t cnt;
1096
1097 cnt = pread (ifd, eio_buf, count > EIO_BUFSIZE ? EIO_BUFSIZE : count, offset);
1098
1099 if (cnt <= 0)
1100 {
1101 if (cnt && !res) res = -1;
1102 break;
1103 }
1104
1105 cnt = write (ofd, eio_buf, cnt);
1106
1107 if (cnt <= 0)
1108 {
1109 if (cnt && !res) res = -1;
1110 break;
1111 }
1112
1113 offset += cnt;
1114 res += cnt;
1115 count -= cnt;
1116 }
1117 }
1118
1119 return res;
1120 }
1121
1122 static signed char
1123 eio_dent_cmp (const eio_dirent *a, const eio_dirent *b)
1124 {
1125 return a->score - b->score ? a->score - b->score /* works because our signed char is always 0..100 */
1126 : a->inode < b->inode ? -1
1127 : a->inode > b->inode ? 1
1128 : 0;
1129 }
1130
1131 #define EIO_DENT_CMP(i,op,j) eio_dent_cmp (&i, &j) op 0
1132
1133 #define EIO_SORT_CUTOFF 30 /* quite high, but performs well on many filesystems */
1134 #define EIO_SORT_FAST 60 /* when to only use insertion sort */
1135
1136 static void
1137 eio_dent_radix_sort (eio_dirent *dents, int size, signed char score_bits, ino_t inode_bits)
1138 {
1139 unsigned char bits [9 + sizeof (ino_t) * 8];
1140 unsigned char *bit = bits;
1141
1142 assert (CHAR_BIT == 8);
1143 assert (sizeof (eio_dirent) * 8 < 256);
1144 assert (offsetof (eio_dirent, inode)); /* we use bit #0 as sentinel */
1145 assert (offsetof (eio_dirent, score)); /* we use bit #0 as sentinel */
1146
1147 if (size <= EIO_SORT_FAST)
1148 return;
1149
1150 /* first prepare an array of bits to test in our radix sort */
1151 /* try to take endianness into account, as well as differences in ino_t sizes */
1152 /* inode_bits must contain all inodes ORed together */
1153 /* which is used to skip bits that are 0 everywhere, which is very common */
1154 {
1155 ino_t endianness;
1156 int i, j;
1157
1158 /* we store the byte offset of byte n into byte n of "endianness" */
1159 for (i = 0; i < sizeof (ino_t); ++i)
1160 ((unsigned char *)&endianness)[i] = i;
1161
1162 *bit++ = 0;
1163
1164 for (i = 0; i < sizeof (ino_t); ++i)
1165 {
1166 /* shifting off the byte offsets out of "endianness" */
1167 int offs = (offsetof (eio_dirent, inode) + (endianness & 0xff)) * 8;
1168 endianness >>= 8;
1169
1170 for (j = 0; j < 8; ++j)
1171 if (inode_bits & (((ino_t)1) << (i * 8 + j)))
1172 *bit++ = offs + j;
1173 }
1174
1175 for (j = 0; j < 8; ++j)
1176 if (score_bits & (1 << j))
1177 *bit++ = offsetof (eio_dirent, score) * 8 + j;
1178 }
1179
1180 /* now actually do the sorting (a variant of MSD radix sort) */
1181 {
1182 eio_dirent *base_stk [9 + sizeof (ino_t) * 8], *base;
1183 eio_dirent *end_stk [9 + sizeof (ino_t) * 8], *end;
1184 unsigned char *bit_stk [9 + sizeof (ino_t) * 8];
1185 int stk_idx = 0;
1186
1187 base_stk [stk_idx] = dents;
1188 end_stk [stk_idx] = dents + size;
1189 bit_stk [stk_idx] = bit - 1;
1190
1191 do
1192 {
1193 base = base_stk [stk_idx];
1194 end = end_stk [stk_idx];
1195 bit = bit_stk [stk_idx];
1196
1197 for (;;)
1198 {
1199 unsigned char O = *bit >> 3;
1200 unsigned char M = 1 << (*bit & 7);
1201
1202 eio_dirent *a = base;
1203 eio_dirent *b = end;
1204
1205 if (b - a < EIO_SORT_CUTOFF)
1206 break;
1207
1208 /* now bit-partition the array on the bit */
1209 /* this ugly asymmetric loop seems to perform much better than typical */
1210 /* partition algos found in the literature */
1211 do
1212 if (!(((unsigned char *)a)[O] & M))
1213 ++a;
1214 else if (!(((unsigned char *)--b)[O] & M))
1215 {
1216 eio_dirent tmp = *a; *a = *b; *b = tmp;
1217 ++a;
1218 }
1219 while (b > a);
1220
1221 /* next bit, or stop, if no bits left in this path */
1222 if (!*--bit)
1223 break;
1224
1225 base_stk [stk_idx] = a;
1226 end_stk [stk_idx] = end;
1227 bit_stk [stk_idx] = bit;
1228 ++stk_idx;
1229
1230 end = a;
1231 }
1232 }
1233 while (stk_idx--);
1234 }
1235 }
1236
1237 static void
1238 eio_dent_insertion_sort (eio_dirent *dents, int size)
1239 {
1240 /* first move the smallest element to the front, to act as a sentinel */
1241 {
1242 int i;
1243 eio_dirent *min = dents;
1244
1245 /* the radix pre-pass ensures that the minimum element is in the first EIO_SORT_CUTOFF + 1 elements */
1246 for (i = size > EIO_SORT_FAST ? EIO_SORT_CUTOFF + 1 : size; --i; )
1247 if (EIO_DENT_CMP (dents [i], <, *min))
1248 min = &dents [i];
1249
1250 /* swap elements 0 and j (minimum) */
1251 {
1252 eio_dirent tmp = *dents; *dents = *min; *min = tmp;
1253 }
1254 }
1255
1256 /* then do standard insertion sort, assuming that all elements are >= dents [0] */
1257 {
1258 eio_dirent *i, *j;
1259
1260 for (i = dents + 1; i < dents + size; ++i)
1261 {
1262 eio_dirent value = *i;
1263
1264 for (j = i - 1; EIO_DENT_CMP (*j, >, value); --j)
1265 j [1] = j [0];
1266
1267 j [1] = value;
1268 }
1269 }
1270 }
1271
1272 static void
1273 eio_dent_sort (eio_dirent *dents, int size, signed char score_bits, ino_t inode_bits)
1274 {
1275 if (size <= 1)
1276 return; /* our insertion sort relies on size > 0 */
1277
1278 /* first we use a radix sort, but only for dirs >= EIO_SORT_FAST */
1279 /* and stop sorting when the partitions are <= EIO_SORT_CUTOFF */
1280 eio_dent_radix_sort (dents, size, score_bits, inode_bits);
1281
1282 /* use an insertion sort at the end, or for small arrays, */
1283 /* as insertion sort is more efficient for small partitions */
1284 eio_dent_insertion_sort (dents, size);
1285 }
1286
1287 /* read a full directory */
1288 static void
1289 eio__scandir (eio_req *req, etp_worker *self)
1290 {
1291 DIR *dirp;
1292 EIO_STRUCT_DIRENT *entp;
1293 char *name, *names;
1294 int namesalloc = 4096;
1295 int namesoffs = 0;
1296 int flags = req->int1;
1297 eio_dirent *dents = 0;
1298 int dentalloc = 128;
1299 int dentoffs = 0;
1300 ino_t inode_bits = 0;
1301
1302 req->result = -1;
1303
1304 if (!(flags & EIO_READDIR_DENTS))
1305 flags &= ~(EIO_READDIR_DIRS_FIRST | EIO_READDIR_STAT_ORDER);
1306
1307 X_LOCK (wrklock);
1308 /* the corresponding closedir is in ETP_WORKER_CLEAR */
1309 self->dirp = dirp = opendir (req->ptr1);
1310
1311 req->flags |= EIO_FLAG_PTR1_FREE | EIO_FLAG_PTR2_FREE;
1312 req->ptr1 = dents = flags ? malloc (dentalloc * sizeof (eio_dirent)) : 0;
1313 req->ptr2 = names = malloc (namesalloc);
1314 X_UNLOCK (wrklock);
1315
1316 if (dirp && names && (!flags || dents))
1317 for (;;)
1318 {
1319 errno = 0;
1320 entp = readdir (dirp);
1321
1322 if (!entp)
1323 {
1324 if (errno)
1325 break;
1326
1327 /* sort etc. */
1328 req->int1 = flags;
1329 req->result = dentoffs;
1330
1331 if (flags & EIO_READDIR_STAT_ORDER)
1332 eio_dent_sort (dents, dentoffs, flags & EIO_READDIR_DIRS_FIRST ? 7 : 0, inode_bits);
1333 else if (flags & EIO_READDIR_DIRS_FIRST)
1334 if (flags & EIO_READDIR_FOUND_UNKNOWN)
1335 eio_dent_sort (dents, dentoffs, 7, inode_bits); /* sort by score and inode */
1336 else
1337 {
1338 /* in this case, all is known, and we just put dirs first and sort them */
1339 eio_dirent *oth = dents + dentoffs;
1340 eio_dirent *dir = dents;
1341
1342 /* now partition dirs to the front, and non-dirs to the back */
1343 /* by walking from both sides and swapping if necessary */
1344 while (oth > dir)
1345 {
1346 if (dir->type == EIO_DT_DIR)
1347 ++dir;
1348 else if ((--oth)->type == EIO_DT_DIR)
1349 {
1350 eio_dirent tmp = *dir; *dir = *oth; *oth = tmp;
1351
1352 ++dir;
1353 }
1354 }
1355
1356 /* now sort the dirs only (dirs all have the same score) */
1357 eio_dent_sort (dents, dir - dents, 0, inode_bits);
1358 }
1359
1360 break;
1361 }
1362
1363 /* now add the entry to our list(s) */
1364 name = entp->d_name;
1365
1366 /* skip . and .. entries */
1367 if (name [0] != '.' || (name [1] && (name [1] != '.' || name [2])))
1368 {
1369 int len = D_NAMLEN (entp) + 1;
1370
1371 while (ecb_expect_false (namesoffs + len > namesalloc))
1372 {
1373 namesalloc *= 2;
1374 X_LOCK (wrklock);
1375 req->ptr2 = names = realloc (names, namesalloc);
1376 X_UNLOCK (wrklock);
1377
1378 if (!names)
1379 break;
1380 }
1381
1382 memcpy (names + namesoffs, name, len);
1383
1384 if (dents)
1385 {
1386 struct eio_dirent *ent;
1387
1388 if (ecb_expect_false (dentoffs == dentalloc))
1389 {
1390 dentalloc *= 2;
1391 X_LOCK (wrklock);
1392 req->ptr1 = dents = realloc (dents, dentalloc * sizeof (eio_dirent));
1393 X_UNLOCK (wrklock);
1394
1395 if (!dents)
1396 break;
1397 }
1398
1399 ent = dents + dentoffs;
1400
1401 ent->nameofs = namesoffs; /* rather dirtily we store the offset in the pointer */
1402 ent->namelen = len - 1;
1403 ent->inode = D_INO (entp);
1404
1405 inode_bits |= ent->inode;
1406
1407 switch (D_TYPE (entp))
1408 {
1409 default:
1410 ent->type = EIO_DT_UNKNOWN;
1411 flags |= EIO_READDIR_FOUND_UNKNOWN;
1412 break;
1413
1414 #ifdef DT_FIFO
1415 case DT_FIFO: ent->type = EIO_DT_FIFO; break;
1416 #endif
1417 #ifdef DT_CHR
1418 case DT_CHR: ent->type = EIO_DT_CHR; break;
1419 #endif
1420 #ifdef DT_MPC
1421 case DT_MPC: ent->type = EIO_DT_MPC; break;
1422 #endif
1423 #ifdef DT_DIR
1424 case DT_DIR: ent->type = EIO_DT_DIR; break;
1425 #endif
1426 #ifdef DT_NAM
1427 case DT_NAM: ent->type = EIO_DT_NAM; break;
1428 #endif
1429 #ifdef DT_BLK
1430 case DT_BLK: ent->type = EIO_DT_BLK; break;
1431 #endif
1432 #ifdef DT_MPB
1433 case DT_MPB: ent->type = EIO_DT_MPB; break;
1434 #endif
1435 #ifdef DT_REG
1436 case DT_REG: ent->type = EIO_DT_REG; break;
1437 #endif
1438 #ifdef DT_NWK
1439 case DT_NWK: ent->type = EIO_DT_NWK; break;
1440 #endif
1441 #ifdef DT_CMP
1442 case DT_CMP: ent->type = EIO_DT_CMP; break;
1443 #endif
1444 #ifdef DT_LNK
1445 case DT_LNK: ent->type = EIO_DT_LNK; break;
1446 #endif
1447 #ifdef DT_SOCK
1448 case DT_SOCK: ent->type = EIO_DT_SOCK; break;
1449 #endif
1450 #ifdef DT_DOOR
1451 case DT_DOOR: ent->type = EIO_DT_DOOR; break;
1452 #endif
1453 #ifdef DT_WHT
1454 case DT_WHT: ent->type = EIO_DT_WHT; break;
1455 #endif
1456 }
1457
1458 ent->score = 7;
1459
1460 if (flags & EIO_READDIR_DIRS_FIRST)
1461 {
1462 if (ent->type == EIO_DT_UNKNOWN)
1463 {
1464 if (*name == '.') /* leading dots are likely directories, and, in any case, rare */
1465 ent->score = 1;
1466 else if (!strchr (name, '.')) /* absense of dots indicate likely dirs */
1467 ent->score = len <= 2 ? 4 - len : len <= 4 ? 4 : len <= 7 ? 5 : 6; /* shorter == more likely dir, but avoid too many classes */
1468 }
1469 else if (ent->type == EIO_DT_DIR)
1470 ent->score = 0;
1471 }
1472 }
1473
1474 namesoffs += len;
1475 ++dentoffs;
1476 }
1477
1478 if (EIO_CANCELLED (req))
1479 {
1480 errno = ECANCELED;
1481 break;
1482 }
1483 }
1484 }
1485
1486 #ifdef PAGESIZE
1487 # define eio_pagesize() PAGESIZE
1488 #else
1489 static intptr_t
1490 eio_pagesize (void)
1491 {
1492 static intptr_t page;
1493
1494 if (!page)
1495 page = sysconf (_SC_PAGESIZE);
1496
1497 return page;
1498 }
1499 #endif
1500
1501 static void
1502 eio_page_align (void **addr, size_t *length)
1503 {
1504 intptr_t mask = eio_pagesize () - 1;
1505
1506 /* round down addr */
1507 intptr_t adj = mask & (intptr_t)*addr;
1508
1509 *addr = (void *)((intptr_t)*addr - adj);
1510 *length += adj;
1511
1512 /* round up length */
1513 *length = (*length + mask) & ~mask;
1514 }
1515
1516 #if !_POSIX_MEMLOCK
1517 # define eio__mlockall(a) ((errno = ENOSYS), -1)
1518 #else
1519
1520 static int
1521 eio__mlockall (int flags)
1522 {
1523 #if __GLIBC__ == 2 && __GLIBC_MINOR__ <= 7
1524 extern int mallopt (int, int);
1525 mallopt (-6, 238); /* http://bugs.debian.org/cgi-bin/bugreport.cgi?bug=473812 */
1526 #endif
1527
1528 if (EIO_MCL_CURRENT != MCL_CURRENT
1529 || EIO_MCL_FUTURE != MCL_FUTURE)
1530 {
1531 flags = 0
1532 | (flags & EIO_MCL_CURRENT ? MCL_CURRENT : 0)
1533 | (flags & EIO_MCL_FUTURE ? MCL_FUTURE : 0);
1534 }
1535
1536 return mlockall (flags);
1537 }
1538 #endif
1539
1540 #if !_POSIX_MEMLOCK_RANGE
1541 # define eio__mlock(a,b) ((errno = ENOSYS), -1)
1542 #else
1543
1544 static int
1545 eio__mlock (void *addr, size_t length)
1546 {
1547 eio_page_align (&addr, &length);
1548
1549 return mlock (addr, length);
1550 }
1551
1552 #endif
1553
1554 #if !(_POSIX_MAPPED_FILES && _POSIX_SYNCHRONIZED_IO)
1555 # define eio__msync(a,b,c) ((errno = ENOSYS), -1)
1556 #else
1557
1558 static int
1559 eio__msync (void *mem, size_t len, int flags)
1560 {
1561 eio_page_align (&mem, &len);
1562
1563 if (EIO_MS_ASYNC != MS_SYNC
1564 || EIO_MS_INVALIDATE != MS_INVALIDATE
1565 || EIO_MS_SYNC != MS_SYNC)
1566 {
1567 flags = 0
1568 | (flags & EIO_MS_ASYNC ? MS_ASYNC : 0)
1569 | (flags & EIO_MS_INVALIDATE ? MS_INVALIDATE : 0)
1570 | (flags & EIO_MS_SYNC ? MS_SYNC : 0);
1571 }
1572
1573 return msync (mem, len, flags);
1574 }
1575
1576 #endif
1577
1578 static int
1579 eio__mtouch (eio_req *req)
1580 {
1581 void *mem = req->ptr2;
1582 size_t len = req->size;
1583 int flags = req->int1;
1584
1585 eio_page_align (&mem, &len);
1586
1587 {
1588 intptr_t addr = (intptr_t)mem;
1589 intptr_t end = addr + len;
1590 intptr_t page = eio_pagesize ();
1591
1592 if (addr < end)
1593 if (flags & EIO_MT_MODIFY) /* modify */
1594 do { *((volatile sig_atomic_t *)addr) |= 0; } while ((addr += page) < len && !EIO_CANCELLED (req));
1595 else
1596 do { *((volatile sig_atomic_t *)addr) ; } while ((addr += page) < len && !EIO_CANCELLED (req));
1597 }
1598
1599 return 0;
1600 }
1601
1602 /*****************************************************************************/
1603
1604 #define ALLOC(len) \
1605 if (!req->ptr2) \
1606 { \
1607 X_LOCK (wrklock); \
1608 req->flags |= EIO_FLAG_PTR2_FREE; \
1609 X_UNLOCK (wrklock); \
1610 req->ptr2 = malloc (len); \
1611 if (!req->ptr2) \
1612 { \
1613 errno = ENOMEM; \
1614 req->result = -1; \
1615 break; \
1616 } \
1617 }
1618
1619 X_THREAD_PROC (etp_proc)
1620 {
1621 ETP_REQ *req;
1622 struct timespec ts;
1623 etp_worker *self = (etp_worker *)thr_arg;
1624
1625 /* try to distribute timeouts somewhat randomly */
1626 ts.tv_nsec = ((unsigned long)self & 1023UL) * (1000000000UL / 1024UL);
1627
1628 for (;;)
1629 {
1630 X_LOCK (reqlock);
1631
1632 for (;;)
1633 {
1634 self->req = req = reqq_shift (&req_queue);
1635
1636 if (req)
1637 break;
1638
1639 ++idle;
1640
1641 ts.tv_sec = time (0) + idle_timeout;
1642 if (X_COND_TIMEDWAIT (reqwait, reqlock, ts) == ETIMEDOUT)
1643 {
1644 if (idle > max_idle)
1645 {
1646 --idle;
1647 X_UNLOCK (reqlock);
1648 X_LOCK (wrklock);
1649 --started;
1650 X_UNLOCK (wrklock);
1651 goto quit;
1652 }
1653
1654 /* we are allowed to idle, so do so without any timeout */
1655 X_COND_WAIT (reqwait, reqlock);
1656 }
1657
1658 --idle;
1659 }
1660
1661 --nready;
1662
1663 X_UNLOCK (reqlock);
1664
1665 if (req->type < 0)
1666 goto quit;
1667
1668 if (!EIO_CANCELLED (req))
1669 ETP_EXECUTE (self, req);
1670
1671 X_LOCK (reslock);
1672
1673 ++npending;
1674
1675 if (!reqq_push (&res_queue, req) && want_poll_cb)
1676 want_poll_cb ();
1677
1678 self->req = 0;
1679 etp_worker_clear (self);
1680
1681 X_UNLOCK (reslock);
1682 }
1683
1684 quit:
1685 X_LOCK (wrklock);
1686 etp_worker_free (self);
1687 X_UNLOCK (wrklock);
1688
1689 return 0;
1690 }
1691
1692 /*****************************************************************************/
1693
1694 int ecb_cold
1695 eio_init (void (*want_poll)(void), void (*done_poll)(void))
1696 {
1697 return etp_init (want_poll, done_poll);
1698 }
1699
1700 ECB_INLINE void
1701 eio_api_destroy (eio_req *req)
1702 {
1703 free (req);
1704 }
1705
1706 #define REQ(rtype) \
1707 eio_req *req; \
1708 \
1709 req = (eio_req *)calloc (1, sizeof *req); \
1710 if (!req) \
1711 return 0; \
1712 \
1713 req->type = rtype; \
1714 req->pri = pri; \
1715 req->finish = cb; \
1716 req->data = data; \
1717 req->destroy = eio_api_destroy;
1718
1719 #define SEND eio_submit (req); return req
1720
1721 #define PATH \
1722 req->flags |= EIO_FLAG_PTR1_FREE; \
1723 req->ptr1 = strdup (path); \
1724 if (!req->ptr1) \
1725 { \
1726 eio_api_destroy (req); \
1727 return 0; \
1728 }
1729
1730 static void
1731 eio_execute (etp_worker *self, eio_req *req)
1732 {
1733 switch (req->type)
1734 {
1735 case EIO_READ: ALLOC (req->size);
1736 req->result = req->offs >= 0
1737 ? pread (req->int1, req->ptr2, req->size, req->offs)
1738 : read (req->int1, req->ptr2, req->size); break;
1739 case EIO_WRITE: req->result = req->offs >= 0
1740 ? pwrite (req->int1, req->ptr2, req->size, req->offs)
1741 : write (req->int1, req->ptr2, req->size); break;
1742
1743 case EIO_READAHEAD: req->result = readahead (req->int1, req->offs, req->size); break;
1744 case EIO_SENDFILE: req->result = eio__sendfile (req->int1, req->int2, req->offs, req->size, self); break;
1745
1746 case EIO_STAT: ALLOC (sizeof (EIO_STRUCT_STAT));
1747 req->result = stat (req->ptr1, (EIO_STRUCT_STAT *)req->ptr2); break;
1748 case EIO_LSTAT: ALLOC (sizeof (EIO_STRUCT_STAT));
1749 req->result = lstat (req->ptr1, (EIO_STRUCT_STAT *)req->ptr2); break;
1750 case EIO_FSTAT: ALLOC (sizeof (EIO_STRUCT_STAT));
1751 req->result = fstat (req->int1, (EIO_STRUCT_STAT *)req->ptr2); break;
1752
1753 case EIO_STATVFS: ALLOC (sizeof (EIO_STRUCT_STATVFS));
1754 req->result = statvfs (req->ptr1, (EIO_STRUCT_STATVFS *)req->ptr2); break;
1755 case EIO_FSTATVFS: ALLOC (sizeof (EIO_STRUCT_STATVFS));
1756 req->result = fstatvfs (req->int1, (EIO_STRUCT_STATVFS *)req->ptr2); break;
1757
1758 case EIO_CHOWN: req->result = chown (req->ptr1, req->int2, req->int3); break;
1759 case EIO_FCHOWN: req->result = fchown (req->int1, req->int2, req->int3); break;
1760 case EIO_CHMOD: req->result = chmod (req->ptr1, (mode_t)req->int2); break;
1761 case EIO_FCHMOD: req->result = fchmod (req->int1, (mode_t)req->int2); break;
1762 case EIO_TRUNCATE: req->result = truncate (req->ptr1, req->offs); break;
1763 case EIO_FTRUNCATE: req->result = ftruncate (req->int1, req->offs); break;
1764
1765 case EIO_OPEN: req->result = open (req->ptr1, req->int1, (mode_t)req->int2); break;
1766 case EIO_CLOSE: req->result = close (req->int1); break;
1767 case EIO_DUP2: req->result = dup2 (req->int1, req->int2); break;
1768 case EIO_UNLINK: req->result = unlink (req->ptr1); break;
1769 case EIO_RMDIR: req->result = rmdir (req->ptr1); break;
1770 case EIO_MKDIR: req->result = mkdir (req->ptr1, (mode_t)req->int2); break;
1771 case EIO_RENAME: req->result = rename (req->ptr1, req->ptr2); break;
1772 case EIO_LINK: req->result = link (req->ptr1, req->ptr2); break;
1773 case EIO_SYMLINK: req->result = symlink (req->ptr1, req->ptr2); break;
1774 case EIO_MKNOD: req->result = mknod (req->ptr1, (mode_t)req->int2, (dev_t)req->offs); break;
1775
1776 case EIO_READLINK: ALLOC (PATH_MAX);
1777 req->result = readlink (req->ptr1, req->ptr2, PATH_MAX); break;
1778
1779 case EIO_SYNC: req->result = 0; sync (); break;
1780 case EIO_FSYNC: req->result = fsync (req->int1); break;
1781 case EIO_FDATASYNC: req->result = fdatasync (req->int1); break;
1782 case EIO_MSYNC: req->result = eio__msync (req->ptr2, req->size, req->int1); break;
1783 case EIO_MTOUCH: req->result = eio__mtouch (req); break;
1784 case EIO_MLOCK: req->result = eio__mlock (req->ptr2, req->size); break;
1785 case EIO_MLOCKALL: req->result = eio__mlockall (req->int1); break;
1786 case EIO_SYNC_FILE_RANGE: req->result = eio__sync_file_range (req->int1, req->offs, req->size, req->int2); break;
1787
1788 case EIO_READDIR: eio__scandir (req, self); break;
1789
1790 case EIO_BUSY:
1791 #ifdef _WIN32
1792 Sleep (req->nv1 * 1e3);
1793 #else
1794 {
1795 struct timeval tv;
1796
1797 tv.tv_sec = req->nv1;
1798 tv.tv_usec = (req->nv1 - tv.tv_sec) * 1e6;
1799
1800 req->result = select (0, 0, 0, 0, &tv);
1801 }
1802 #endif
1803 break;
1804
1805 case EIO_UTIME:
1806 case EIO_FUTIME:
1807 {
1808 struct timeval tv[2];
1809 struct timeval *times;
1810
1811 if (req->nv1 != -1. || req->nv2 != -1.)
1812 {
1813 tv[0].tv_sec = req->nv1;
1814 tv[0].tv_usec = (req->nv1 - tv[0].tv_sec) * 1000000.;
1815 tv[1].tv_sec = req->nv2;
1816 tv[1].tv_usec = (req->nv2 - tv[1].tv_sec) * 1000000.;
1817
1818 times = tv;
1819 }
1820 else
1821 times = 0;
1822
1823 req->result = req->type == EIO_FUTIME
1824 ? futimes (req->int1, times)
1825 : utimes (req->ptr1, times);
1826 }
1827 break;
1828
1829 case EIO_GROUP:
1830 abort (); /* handled in eio_request */
1831
1832 case EIO_NOP:
1833 req->result = 0;
1834 break;
1835
1836 case EIO_CUSTOM:
1837 req->feed (req);
1838 break;
1839
1840 default:
1841 errno = ENOSYS;
1842 req->result = -1;
1843 break;
1844 }
1845
1846 req->errorno = errno;
1847 }
1848
1849 #ifndef EIO_NO_WRAPPERS
1850
1851 eio_req *eio_nop (int pri, eio_cb cb, void *data)
1852 {
1853 REQ (EIO_NOP); SEND;
1854 }
1855
1856 eio_req *eio_busy (double delay, int pri, eio_cb cb, void *data)
1857 {
1858 REQ (EIO_BUSY); req->nv1 = delay; SEND;
1859 }
1860
1861 eio_req *eio_sync (int pri, eio_cb cb, void *data)
1862 {
1863 REQ (EIO_SYNC); SEND;
1864 }
1865
1866 eio_req *eio_fsync (int fd, int pri, eio_cb cb, void *data)
1867 {
1868 REQ (EIO_FSYNC); req->int1 = fd; SEND;
1869 }
1870
1871 eio_req *eio_msync (void *addr, size_t length, int flags, int pri, eio_cb cb, void *data)
1872 {
1873 REQ (EIO_MSYNC); req->ptr2 = addr; req->size = length; req->int1 = flags; SEND;
1874 }
1875
1876 eio_req *eio_mtouch (void *addr, size_t length, int flags, int pri, eio_cb cb, void *data)
1877 {
1878 REQ (EIO_MTOUCH); req->ptr2 = addr; req->size = length; req->int1 = flags; SEND;
1879 }
1880
1881 eio_req *eio_mlock (void *addr, size_t length, int pri, eio_cb cb, void *data)
1882 {
1883 REQ (EIO_MLOCK); req->ptr2 = addr; req->size = length; SEND;
1884 }
1885
1886 eio_req *eio_mlockall (int flags, int pri, eio_cb cb, void *data)
1887 {
1888 REQ (EIO_MLOCKALL); req->int1 = flags; SEND;
1889 }
1890
1891 eio_req *eio_sync_file_range (int fd, off_t offset, size_t nbytes, unsigned int flags, int pri, eio_cb cb, void *data)
1892 {
1893 REQ (EIO_SYNC_FILE_RANGE); req->int1 = fd; req->offs = offset; req->size = nbytes; req->int2 = flags; SEND;
1894 }
1895
1896 eio_req *eio_fdatasync (int fd, int pri, eio_cb cb, void *data)
1897 {
1898 REQ (EIO_FDATASYNC); req->int1 = fd; SEND;
1899 }
1900
1901 eio_req *eio_close (int fd, int pri, eio_cb cb, void *data)
1902 {
1903 REQ (EIO_CLOSE); req->int1 = fd; SEND;
1904 }
1905
1906 eio_req *eio_readahead (int fd, off_t offset, size_t length, int pri, eio_cb cb, void *data)
1907 {
1908 REQ (EIO_READAHEAD); req->int1 = fd; req->offs = offset; req->size = length; SEND;
1909 }
1910
1911 eio_req *eio_read (int fd, void *buf, size_t length, off_t offset, int pri, eio_cb cb, void *data)
1912 {
1913 REQ (EIO_READ); req->int1 = fd; req->offs = offset; req->size = length; req->ptr2 = buf; SEND;
1914 }
1915
1916 eio_req *eio_write (int fd, void *buf, size_t length, off_t offset, int pri, eio_cb cb, void *data)
1917 {
1918 REQ (EIO_WRITE); req->int1 = fd; req->offs = offset; req->size = length; req->ptr2 = buf; SEND;
1919 }
1920
1921 eio_req *eio_fstat (int fd, int pri, eio_cb cb, void *data)
1922 {
1923 REQ (EIO_FSTAT); req->int1 = fd; SEND;
1924 }
1925
1926 eio_req *eio_fstatvfs (int fd, int pri, eio_cb cb, void *data)
1927 {
1928 REQ (EIO_FSTATVFS); req->int1 = fd; SEND;
1929 }
1930
1931 eio_req *eio_futime (int fd, double atime, double mtime, int pri, eio_cb cb, void *data)
1932 {
1933 REQ (EIO_FUTIME); req->int1 = fd; req->nv1 = atime; req->nv2 = mtime; SEND;
1934 }
1935
1936 eio_req *eio_ftruncate (int fd, off_t offset, int pri, eio_cb cb, void *data)
1937 {
1938 REQ (EIO_FTRUNCATE); req->int1 = fd; req->offs = offset; SEND;
1939 }
1940
1941 eio_req *eio_fchmod (int fd, mode_t mode, int pri, eio_cb cb, void *data)
1942 {
1943 REQ (EIO_FCHMOD); req->int1 = fd; req->int2 = (long)mode; SEND;
1944 }
1945
1946 eio_req *eio_fchown (int fd, uid_t uid, gid_t gid, int pri, eio_cb cb, void *data)
1947 {
1948 REQ (EIO_FCHOWN); req->int1 = fd; req->int2 = (long)uid; req->int3 = (long)gid; SEND;
1949 }
1950
1951 eio_req *eio_dup2 (int fd, int fd2, int pri, eio_cb cb, void *data)
1952 {
1953 REQ (EIO_DUP2); req->int1 = fd; req->int2 = fd2; SEND;
1954 }
1955
1956 eio_req *eio_sendfile (int out_fd, int in_fd, off_t in_offset, size_t length, int pri, eio_cb cb, void *data)
1957 {
1958 REQ (EIO_SENDFILE); req->int1 = out_fd; req->int2 = in_fd; req->offs = in_offset; req->size = length; SEND;
1959 }
1960
1961 eio_req *eio_open (const char *path, int flags, mode_t mode, int pri, eio_cb cb, void *data)
1962 {
1963 REQ (EIO_OPEN); PATH; req->int1 = flags; req->int2 = (long)mode; SEND;
1964 }
1965
1966 eio_req *eio_utime (const char *path, double atime, double mtime, int pri, eio_cb cb, void *data)
1967 {
1968 REQ (EIO_UTIME); PATH; req->nv1 = atime; req->nv2 = mtime; SEND;
1969 }
1970
1971 eio_req *eio_truncate (const char *path, off_t offset, int pri, eio_cb cb, void *data)
1972 {
1973 REQ (EIO_TRUNCATE); PATH; req->offs = offset; SEND;
1974 }
1975
1976 eio_req *eio_chown (const char *path, uid_t uid, gid_t gid, int pri, eio_cb cb, void *data)
1977 {
1978 REQ (EIO_CHOWN); PATH; req->int2 = (long)uid; req->int3 = (long)gid; SEND;
1979 }
1980
1981 eio_req *eio_chmod (const char *path, mode_t mode, int pri, eio_cb cb, void *data)
1982 {
1983 REQ (EIO_CHMOD); PATH; req->int2 = (long)mode; SEND;
1984 }
1985
1986 eio_req *eio_mkdir (const char *path, mode_t mode, int pri, eio_cb cb, void *data)
1987 {
1988 REQ (EIO_MKDIR); PATH; req->int2 = (long)mode; SEND;
1989 }
1990
1991 static eio_req *
1992 eio__1path (int type, const char *path, int pri, eio_cb cb, void *data)
1993 {
1994 REQ (type); PATH; SEND;
1995 }
1996
1997 eio_req *eio_readlink (const char *path, int pri, eio_cb cb, void *data)
1998 {
1999 return eio__1path (EIO_READLINK, path, pri, cb, data);
2000 }
2001
2002 eio_req *eio_stat (const char *path, int pri, eio_cb cb, void *data)
2003 {
2004 return eio__1path (EIO_STAT, path, pri, cb, data);
2005 }
2006
2007 eio_req *eio_lstat (const char *path, int pri, eio_cb cb, void *data)
2008 {
2009 return eio__1path (EIO_LSTAT, path, pri, cb, data);
2010 }
2011
2012 eio_req *eio_statvfs (const char *path, int pri, eio_cb cb, void *data)
2013 {
2014 return eio__1path (EIO_STATVFS, path, pri, cb, data);
2015 }
2016
2017 eio_req *eio_unlink (const char *path, int pri, eio_cb cb, void *data)
2018 {
2019 return eio__1path (EIO_UNLINK, path, pri, cb, data);
2020 }
2021
2022 eio_req *eio_rmdir (const char *path, int pri, eio_cb cb, void *data)
2023 {
2024 return eio__1path (EIO_RMDIR, path, pri, cb, data);
2025 }
2026
2027 eio_req *eio_readdir (const char *path, int flags, int pri, eio_cb cb, void *data)
2028 {
2029 REQ (EIO_READDIR); PATH; req->int1 = flags; SEND;
2030 }
2031
2032 eio_req *eio_mknod (const char *path, mode_t mode, dev_t dev, int pri, eio_cb cb, void *data)
2033 {
2034 REQ (EIO_MKNOD); PATH; req->int2 = (long)mode; req->offs = (off_t)dev; SEND;
2035 }
2036
2037 static eio_req *
2038 eio__2path (int type, const char *path, const char *new_path, int pri, eio_cb cb, void *data)
2039 {
2040 REQ (type); PATH;
2041
2042 req->flags |= EIO_FLAG_PTR2_FREE;
2043 req->ptr2 = strdup (new_path);
2044 if (!req->ptr2)
2045 {
2046 eio_api_destroy (req);
2047 return 0;
2048 }
2049
2050 SEND;
2051 }
2052
2053 eio_req *eio_link (const char *path, const char *new_path, int pri, eio_cb cb, void *data)
2054 {
2055 return eio__2path (EIO_LINK, path, new_path, pri, cb, data);
2056 }
2057
2058 eio_req *eio_symlink (const char *path, const char *new_path, int pri, eio_cb cb, void *data)
2059 {
2060 return eio__2path (EIO_SYMLINK, path, new_path, pri, cb, data);
2061 }
2062
2063 eio_req *eio_rename (const char *path, const char *new_path, int pri, eio_cb cb, void *data)
2064 {
2065 return eio__2path (EIO_RENAME, path, new_path, pri, cb, data);
2066 }
2067
2068 eio_req *eio_custom (void (*execute)(eio_req *), int pri, eio_cb cb, void *data)
2069 {
2070 REQ (EIO_CUSTOM); req->feed = execute; SEND;
2071 }
2072
2073 #endif
2074
2075 eio_req *eio_grp (eio_cb cb, void *data)
2076 {
2077 const int pri = EIO_PRI_MAX;
2078
2079 REQ (EIO_GROUP); SEND;
2080 }
2081
2082 #undef REQ
2083 #undef PATH
2084 #undef SEND
2085
2086 /*****************************************************************************/
2087 /* grp functions */
2088
2089 void
2090 eio_grp_feed (eio_req *grp, void (*feed)(eio_req *req), int limit)
2091 {
2092 grp->int2 = limit;
2093 grp->feed = feed;
2094
2095 grp_try_feed (grp);
2096 }
2097
2098 void
2099 eio_grp_limit (eio_req *grp, int limit)
2100 {
2101 grp->int2 = limit;
2102
2103 grp_try_feed (grp);
2104 }
2105
2106 void
2107 eio_grp_add (eio_req *grp, eio_req *req)
2108 {
2109 assert (("cannot add requests to IO::AIO::GRP after the group finished", grp->int1 != 2));
2110
2111 grp->flags |= EIO_FLAG_GROUPADD;
2112
2113 ++grp->size;
2114 req->grp = grp;
2115
2116 req->grp_prev = 0;
2117 req->grp_next = grp->grp_first;
2118
2119 if (grp->grp_first)
2120 grp->grp_first->grp_prev = req;
2121
2122 grp->grp_first = req;
2123 }
2124
2125 /*****************************************************************************/
2126 /* misc garbage */
2127
2128 ssize_t
2129 eio_sendfile_sync (int ofd, int ifd, off_t offset, size_t count)
2130 {
2131 etp_worker wrk;
2132 ssize_t ret;
2133
2134 wrk.dbuf = 0;
2135
2136 ret = eio__sendfile (ofd, ifd, offset, count, &wrk);
2137
2138 if (wrk.dbuf)
2139 free (wrk.dbuf);
2140
2141 return ret;
2142 }
2143