ViewVC Help
View File | Revision Log | Show Annotations | Download File
/cvs/libeio/eio.c
Revision: 1.91
Committed: Sun Jul 17 04:20:04 2011 UTC (12 years, 10 months ago) by root
Content type: text/plain
Branch: MAIN
Changes since 1.90: +106 -64 lines
Log Message:
initial windows support

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