ViewVC Help
View File | Revision Log | Show Annotations | Download File
/cvs/libeio/eio.c
Revision: 1.121
Committed: Sat Jun 2 20:13:26 2012 UTC (12 years ago) by root
Content type: text/plain
Branch: MAIN
Changes since 1.120: +1 -53 lines
Log Message:
nuke pread/pwrite emulation

File Contents

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